{"version":3,"file":"static/js/main.89ab2d19.js","mappings":";yCAAO,SAASA,EAAcC,GAAsB,IAAfC,EAAKC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,KAC3C,IAAIG,EAAOL,EAAQ,IACL,OAAVC,IAAgBI,EAAOL,EAAQ,IAAMC,EAAQ,KAGjD,IAFA,IACIK,EADgBC,mBAAmBC,SAASC,QACzBC,MAAM,KACpBC,EAAI,EAAGA,EAAIL,EAAGH,OAAQQ,IAAK,CAElC,IADA,IAAIC,EAAIN,EAAGK,GACY,MAAhBC,EAAEC,OAAO,IACdD,EAAIA,EAAEE,UAAU,GAElB,GAAwB,IAApBF,EAAEG,QAAQV,GACZ,OAAOO,EAAEE,UAAUT,EAAKF,OAAQS,EAAET,OAEtC,CACA,MAAO,EACT,CACO,SAASa,EAAchB,EAAOiB,GAAuB,IAAfhB,EAAKC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,KACnD,IAAIgB,EAAI,IAAIC,KACZD,EAAEE,QAAQF,EAAEG,UAAY,MACxB,IAAIC,EAAU,WAAaJ,EAAEK,cACf,OAAVtB,IAAgBD,EAAQA,EAAQ,IAAMC,GAC1CO,SAASC,OAAST,EAAQ,IAAMiB,EAAS,IAAMK,EAAU,SAC3D,CACO,SAASE,EAAiBxB,GAAsB,IAAfC,EAAKC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,KAEhC,OAAVD,IAAgBD,EAAQA,EAAQ,IAAMC,GAC1CO,SAASC,OAAST,kDACpB,4PCvBO,SAASyB,EAAOC,GAErB,MAAsD,MAA/CA,EAASC,UAAmEC,KAAtBF,EAASC,UAAsF,gBAA/CD,EAASC,QACxH,CAMO,SAASE,EAAiBC,GAC/B,IAAIC,EAASC,OAAON,SAASK,OAAOE,OAAO,GAE3C,OADmB,IAAIC,gBAAgBH,GACnBI,IAAIL,EAC1B,CACO,SAASM,IACd,IAAIL,EAASC,OAAON,SAASK,OAAOE,OAAO,GAE3C,OADmB,IAAIC,gBAAgBH,EAEzC,CAiBO,SAASM,IACd,MAAO,KACT,CACO,SAASC,IACd,MAAO,SACT,CACO,SAASC,IACd,MAAO,cACT,CACO,SAASC,IAA6C,IACvDC,EATG,MAUP,OAFiDvC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,OAGlD,IAAK,MAGL,QAAUuC,EAdL,MAcoB,MAFzB,IAAK,SAAWA,EATX,UAS+B,MACpC,IAAK,SAAWA,EAPX,eAWP,OAAOA,CACT,CAiBO,SAASC,EAAkBC,EAAQC,GACxC,IAAIC,EAAOC,OAAOC,MAAQ,EAAI,IAE1BC,EACF,4HAFQF,OAAOG,OAAS,EAAI,KAI5B,UACAJ,EAEFb,OAAe,OAAI,SAAUkB,GAC3BC,QAAQC,IAAIF,GACZN,EAAWM,EACb,EAEA,IAAIG,EAAyB,UAAhBC,EAAAA,EAAAA,MAAyB,KAAM,KAC5CtB,OAAOuB,KACLZ,EAAOa,qBACL,SACAb,EAAOc,sBACP,SAASJ,EACT,cACArB,OAAON,SAASgC,SAChB,KACA1B,OAAON,SAASiC,UACc,cAA7B3B,OAAON,SAASiC,SAA2B,QAAU,IACtD,iBACF,iBACAX,EAEJ,CACO,SAASY,EAAuBC,EAASC,EAAKC,GACnD,IAAIC,EAAa,GACbC,EAAS,EACTC,EAAqBC,IAAAA,OAASN,GAAS,SAAUO,GACnD,OAAOA,EAAEC,QAAQC,MAAMC,aAAeT,CACxC,IACA,KAAOE,EAAW7D,OAAS4D,GAAoBE,EAAS,KAAM,CAC5D,IAAIO,EAASL,IAAAA,OAAS,EAAGM,OAAOC,KAAKR,GAAoB/D,QACrDwE,EAAWT,EAAmBU,MAAMJ,EAAQA,EAAS,GACrDG,EAASxE,OAAS,IAIV,IAFRgE,IAAAA,UAAYH,GAAY,SAAUI,GAChC,OAAOA,EAAES,UAAYF,EAAS,GAAGE,OACnC,KAEAb,EAAWc,QAAQH,GAGvBV,GACF,CACA,OAAOD,CACT,CA6BO,SAASe,EAAyBC,GACvC,IAAIC,EAAS,GACb,IAAK,IAAItE,EAAI,EAAGA,EAAIqE,EAAI7E,OAAQQ,IAAK,CACnC,IAAIuE,EAAOF,EAAIrE,GAEH,MAATuE,GAA+B,MAAfF,EAAIrE,EAAI,IACf,MAATuE,GAA+B,MAAfF,EAAIrE,EAAI,GAEzBA,IAGFsE,GAAkBC,CACpB,CACA,OAAOD,CACT,CACO,SAASE,EAAYH,GAC1B,IAAIC,EAAS,GACTG,EAAM,GACV,IAAK,IAAIzE,EAAI,EAAGA,EAAIqE,EAAI7E,OAAQQ,IAAK,CACnC,IAAIuE,EAAOF,EAAIrE,GACF,MAATuE,GAA+B,MAAfF,EAAIrE,EAAI,IAAsB,KAARyE,EAKtB,MAATF,GAA+B,MAAfF,EAAIrE,EAAI,IAAsB,MAARyE,EAOpC,MAATF,GAA+B,MAAfF,EAAIrE,EAAI,IAAsB,KAARyE,EAKtB,MAATF,GAA+B,MAAfF,EAAIrE,EAAI,IAAsB,MAARyE,EAMjDH,GAAkBC,GALhBD,GAAkB,UAClBG,EAAM,GACNzE,MAPAsE,GAAkB,4CAClBG,EAAM,IACNzE,MATAsE,GAAkB,YAClBG,EAAM,GACNzE,MAPAsE,GAAkB,WAClBG,EAAM,IACNzE,IAqBJ,CAEA,OAAOsE,CACT,CAaO,SAASI,EAAiBC,GAC/B,MAAO,CACL,CACEC,YAAa,MACbC,cAAe,MACfC,eAAeC,EAAAA,EAAAA,GAAS,kBACxBC,QAAS,CACP,CACEC,SAAU,OACVrB,WAAY,MACZsB,YAAYH,EAAAA,EAAAA,GAAS,wBAIxBJ,EACH,CACEC,YAAa,QACbC,cAAe,QACfC,cAAe,SACfE,QAAS,CACP,CACEC,SAAU,EACVrB,WAAY,QACZsB,WAAY,YAKtB,CAEO,SAASC,EAAqBC,GAQnC,MAPa,CACXC,eAAgBD,EAAKE,YAAYC,QAAO,CAACC,EAAGC,IAAMD,EAAEE,MAAQD,EAAEC,QAC9DC,MAAOP,EAAKE,YAAYC,QACtB,CAACC,EAAGC,IAAMD,EAAEE,MAAQF,EAAEI,SAAWH,EAAEC,MAAQD,EAAEG,WAE/CC,cAAeT,EAAKE,YAAYC,QAAO,CAACC,EAAGC,IAAMD,EAAEI,SAAWH,EAAEG,WAGpE,CAEO,SAASE,EAAeC,GAC7B,IAAIzB,EAAS,CACX0B,SAAU,EACVC,WAAY,EACZC,cAAe,EACfC,MAAO,GAwBT,OAtBAJ,EAAKK,KAAKhB,IACR,GAAIA,EAAKA,KAAKiB,QACZ/B,EAAO0B,UACLM,WAAWlB,EAAKA,KAAKmB,aAAalB,gBAAgBmB,QAAQ,GAC1DF,WAAWlB,EAAKqB,YAClBnC,EAAO4B,eACLI,WAAWlB,EAAKA,KAAKmB,aAAaV,eAAeW,QAAQ,GACzDF,WAAWlB,EAAKqB,YAClBnC,EAAO6B,OACLG,WAAWlB,EAAKA,KAAKmB,aAAaZ,OAAOa,QAAQ,GACjDF,WAAWlB,EAAKqB,gBACb,CACL,IAAIC,EACFJ,WAAWlB,EAAKA,KAAKuB,QAAQH,QAAQ,GAAKF,WAAWlB,EAAKqB,YAC5DnC,EAAO0B,UAAYU,EACnBpC,EAAO2B,YAAcK,WAAWI,GAAWF,QAAQ,GAAKI,IACxDtC,EAAO6B,OAASO,GAAa,EAAIE,IACnC,CACA,OAAO,CAAI,IAEbtC,EAAmB,WAAIA,EAAO0B,SAEvB1B,CACT,CAEO,SAASuC,IAAwG,IAClHC,GAAU,EACd,GACO,SAHsCvH,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGwH,aAAaC,QAAQ,QAAUD,aAAaC,QAAQ,QAAU,OAG/FF,GAAU,OAGbA,GAAU,EAEtB,OAAOA,CACT,CACO,SAASF,IAAoG,IAC9GE,EAAU,GACd,GACO,SAHkCvH,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGwH,aAAaC,QAAQ,QAAUD,aAAaC,QAAQ,QAAU,OAG3FF,EAAU,QAGbA,EAAU,EAEtB,OAAOA,CACT,oGCjTO,SAASG,IAAwC,IAA5B3H,EAAKC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,QAAS2H,EAAQ3H,UAAAC,OAAA,EAAAD,UAAA,QAAAE,GACnDY,EAAAA,EAAAA,IAAc,WAAYf,GAC1B+B,OAAON,SAASoG,SAChBC,YAAW,KACTF,GAAU,GACT,IACL,CACO,SAASvE,IACd,MAAqC,MAA9BvD,EAAAA,EAAAA,IAAc,YAAqB,SAAUA,EAAAA,EAAAA,IAAc,WACpE,CAEO,SAASiI,EAAqBC,EAAQC,GAAgC,IAArBC,EAAUjI,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,MAC/DkI,EAAc,GAwBlB,OAIIpG,OAAON,SAAS2G,KAflBD,GAAeH,EACfG,GACgC,MAA9BrI,EAAAA,EAAAA,IAAc,aAEoB,WAA9BA,EAAAA,EAAAA,IAAc,YADd,IAGA,OACNqI,GAAe,eACfA,IAAe5F,EAAAA,EAAAA,IAAyB2F,GAAc,IACtDC,GAAe,WAEVA,CACT,CAaO,SAASE,IACd,MAAqC,MAA9BvI,EAAAA,EAAAA,IAAc,YAAqB,OAAQA,EAAAA,EAAAA,IAAc,WAClE,sECpDIwI,EAAS,CAAC,EAEC,SAAS7C,EAAS8C,GAC/B,MAAsB,WAAlBlF,EAAAA,EAAAA,MACKkF,OAEuBpI,IAAvBmI,EAAOC,GAA4BD,EAAOC,GAAcA,CAEnE,CAEO,SAASC,EAAsBC,GACpCH,EAAS,CAAC,EACVA,EAASG,CACX,gICZO,MAAMC,GAAYC,EAAAA,EAAAA,IAAY,CACnCvI,KAAM,OACNwI,aAAc,CAAEC,UAAW,GAAIC,UAAU,EAAOC,QAAQ,GACxDC,SAAU,CACRC,UAAWA,CAACC,EAAOC,KACV,IAAKD,EAAOH,OAAQI,EAAOC,UAEpCC,eAAgBA,CAACH,EAAOC,KACtB,IAAIG,EAAW7B,aAAaC,QAAQ,QAEpC,OADAD,aAAa8B,QAAQ,QAAQD,IAAYvH,OAAOyH,KAAKC,KAAKC,UAAU,MAC7D,IACFR,EACHL,UAAW,GACXc,WAAY,EACZC,WAAY5C,WAAW,GAAKE,QAAQ,GACrC,EAEH2C,eAAgBA,CAACX,EAAOC,KACtB,IAAIW,EAAYX,EAAOC,QACnBW,EAAQ,EACRlB,EAAY,GAEZS,EAAW7B,aAAaC,QAAQ,QAOpC,OANID,aAAaC,QAAQ,QAAQ4B,OAC/BT,EAAYY,KAAKO,MAAMjI,OAAOkI,KAAKxC,aAAaC,QAAQ,QAAQ4B,OAChET,EAAUqB,SAASpE,IACjBiE,GAAgB,CAAC,KAGd,KACFI,EAAAA,EAAAA,IAAQjB,GACXkB,IAAKN,EACLjB,UAAWA,EACXc,WAAYI,MACTvD,EAAAA,EAAAA,IAAeqC,GACnB,EAEHwB,eAAgBA,CAACnB,EAAOC,KACtB,IAAImB,GAAeH,EAAAA,EAAAA,IAAQjB,GACvBqB,EAAWpB,EAAOC,QAClB1E,EAAW,GAEfA,EAAW4F,EAAazB,UAAU2B,QAC/B9J,GAAMA,EAAEoF,KAAK2E,YAAcF,IAE9B,IAAIjB,EAAW7B,aAAaC,QAAQ,QAEpC,OADAD,aAAa8B,QAAQ,QAAQD,IAAYvH,OAAOyH,KAAKC,KAAKC,UAAUhF,KAC7D,IACF4F,EACHzB,UAAWnE,EACXiF,WAAYjF,EAASxE,WAClBsG,EAAAA,EAAAA,IAAe9B,GACnB,EAEHgG,cAAeA,CAACxB,EAAOC,KACrB,IAAImB,GAAeH,EAAAA,EAAAA,IAAQjB,GACvByB,EAAmB,IAAIL,EAAazB,WACpC+B,EAAgBzB,EAAOC,QAAQtD,KAC/B+E,GAAQ,EAERC,EAAWH,EAAiB7D,KAAKhB,IACnC,GAAIA,EAAKA,KAAK2E,YAAcG,EAAcH,UAExC,GADAI,GAAQ,GACsB,IAA1B1B,EAAOC,QAAQ2B,OACjB,GAAwC,IAApCjF,EAAKA,KAAKkF,sBAA6B,CACzC,IAAI7D,EACFH,WAAWlB,EAAKqB,YAChBH,WAAWmC,EAAOC,QAAQjC,YAC5BrB,EAAO,IAAKA,EAAMqB,WAAYA,EAChC,KAAO,CACL,IAAIA,EACFrB,EAAKqB,WAAa8D,SAAS9B,EAAOC,QAAQjC,YAC5CrB,EAAO,IAAKA,EAAMqB,WAAYA,EAChC,MAEArB,EAAO,IAAKA,EAAMqB,WAAYgC,EAAOC,QAAQjC,YAGjD,OAAOrB,CAAI,IAEb6E,EAAmBG,EACdD,GACHF,EAAiB9F,KAAKsE,EAAOC,SAE/B,IAAIE,EAAW7B,aAAaC,QAAQ,QAMpC,OALAD,aAAa8B,QACX,QAAQD,IACRvH,OAAOyH,KAAKC,KAAKC,UAAUiB,KAGtB,IACFL,EACHzB,UAAW8B,EACXhB,WAAYgB,EAAiBzK,WAC1BsG,EAAAA,EAAAA,IAAemE,GACnB,KAKMO,EAAwBC,GAAQC,MAAOC,EAAUC,KAC5DD,EAASpC,GAAU,IAEnB,IAAIsC,EAAe9B,KAAKC,UAAUyB,GAC9BK,EAAO,CAAC,EAEVA,OAD2BrL,IAAzBmL,IAAWG,KAAKD,MAA+C,OAAzBF,IAAWG,KAAKD,KACjD/B,KAAKC,UAAU,CACpBgC,MAAOJ,IAAWG,KAAKD,KAAKE,MAC5BC,SAAUL,IAAWG,KAAKD,KAAKI,SAC/BC,KAAMP,IAAWG,KAAKD,KAAKM,MAC3BC,SAAUT,IAAWG,KAAKD,KAAKQ,SAG1B,GAGT,IAAIC,EAAO1L,SAAS2L,cAAc,QAClC3L,SAAS4L,KAAKC,YAAYH,GAC1B,IAAII,EAAW9L,SAAS2L,cAAc,SAClCI,EAAW/L,SAAS2L,cAAc,SACtCD,EAAKM,OAAS,OACdN,EAAK9C,OAAS,GAAGmC,IAAWG,KAAKe,cAAcC,uBAAsBlK,EAAAA,EAAAA,IACnE+I,IAAWG,KAAKe,cAAcE,wCAEhCL,EAASM,MAAQpB,EACjBc,EAASjM,KAAO,OAChBiM,EAASO,KAAO,SAChBN,EAASK,MAAQnB,EACjBc,EAASlM,KAAO,WAChBkM,EAASM,KAAO,SAChBX,EAAKG,YAAYC,GACjBJ,EAAKG,YAAYE,GACjBjB,EAAShC,KACT4C,EAAKY,QAAQ,GAGF,eACXhD,EAAc,cACda,EAAa,eACbL,EAAc,UACdpB,EAAS,eACTI,GACEX,EAAUoE,QAEd,EAAepE,EAAiB,sJC9HnB,MAAAqE,GAIE,EAJFA,GAQC,EARDA,EAaE,oBCZFC,EAAS,SAAUC,EAAoBC,GAClD,IAAKD,EACH,MAAME,EAAeD,EAEzB,EAKaC,EAAiB,SAAUD,GACtC,OAAO,IAAIE,MACT,sBACEL,EACA,6BACAG,EAEN,ECrBMG,EAAoB,SAAUtI,GAElC,MAAMuI,EAAgB,GACtB,IAAIC,EAAI,EACR,IAAK,IAAI7M,EAAI,EAAGA,EAAIqE,EAAI7E,OAAQQ,IAAK,CACnC,IAAIC,EAAIoE,EAAIyI,WAAW9M,GACnBC,EAAI,IACN2M,EAAIC,KAAO5M,EACFA,EAAI,MACb2M,EAAIC,KAAQ5M,GAAK,EAAK,IACtB2M,EAAIC,KAAY,GAAJ5M,EAAU,KAEL,SAAZ,MAAJA,IACDD,EAAI,EAAIqE,EAAI7E,QACyB,SAAZ,MAAxB6E,EAAIyI,WAAW9M,EAAI,KAGpBC,EAAI,QAAgB,KAAJA,IAAe,KAA6B,KAAtBoE,EAAIyI,aAAa9M,IACvD4M,EAAIC,KAAQ5M,GAAK,GAAM,IACvB2M,EAAIC,KAAS5M,GAAK,GAAM,GAAM,IAC9B2M,EAAIC,KAAS5M,GAAK,EAAK,GAAM,IAC7B2M,EAAIC,KAAY,GAAJ5M,EAAU,MAEtB2M,EAAIC,KAAQ5M,GAAK,GAAM,IACvB2M,EAAIC,KAAS5M,GAAK,EAAK,GAAM,IAC7B2M,EAAIC,KAAY,GAAJ5M,EAAU,IAEzB,CACD,OAAO2M,CACT,EA4DaG,EAAiB,CAI5BC,eAAgB,KAKhBC,eAAgB,KAMhBC,sBAAuB,KAMvBC,sBAAuB,KAMvBC,kBACE,iEAKF,gBAAIC,GACF,OAAOC,KAAKF,kBAAoB,OAMlC,wBAAIG,GACF,OAAOD,KAAKF,kBAAoB,OAUlCI,mBAAoC,oBAATjE,KAW3BkE,eAAAA,CAAgBC,EAA8BC,GAC5C,IAAKC,MAAMC,QAAQH,GACjB,MAAMhB,MAAM,iDAGdY,KAAKQ,QAEL,MAAMC,EAAgBJ,EAClBL,KAAKJ,sBACLI,KAAKN,eAEHgB,EAAS,GAEf,IAAK,IAAIhO,EAAI,EAAGA,EAAI0N,EAAMlO,OAAQQ,GAAK,EAAG,CACxC,MAAMiO,EAAQP,EAAM1N,GACdkO,EAAYlO,EAAI,EAAI0N,EAAMlO,OAC1B2O,EAAQD,EAAYR,EAAM1N,EAAI,GAAK,EACnCoO,EAAYpO,EAAI,EAAI0N,EAAMlO,OAC1B6O,EAAQD,EAAYV,EAAM1N,EAAI,GAAK,EAEnCsO,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,EAAO7J,KACL4J,EAAcO,GACdP,EAAcQ,GACdR,EAAcS,GACdT,EAAcU,GAEjB,CAED,OAAOT,EAAOU,KAAK,KAWrBC,YAAAA,CAAajB,EAAeC,GAG1B,OAAIL,KAAKE,qBAAuBG,EACvB7E,KAAK4E,GAEPJ,KAAKG,gBAAgBd,EAAkBe,GAAQC,IAWxDiB,YAAAA,CAAalB,EAAeC,GAG1B,OAAIL,KAAKE,qBAAuBG,EACvBpE,KAAKmE,GA3LQ,SAAUmB,GAElC,MAAMjC,EAAgB,GACtB,IAAIkC,EAAM,EACR7O,EAAI,EACN,KAAO6O,EAAMD,EAAMrP,QAAQ,CACzB,MAAMuP,EAAKF,EAAMC,KACjB,GAAIC,EAAK,IACPnC,EAAI3M,KAAO+O,OAAOC,aAAaF,QAC1B,GAAIA,EAAK,KAAOA,EAAK,IAAK,CAC/B,MAAMG,EAAKL,EAAMC,KACjBlC,EAAI3M,KAAO+O,OAAOC,cAAoB,GAALF,IAAY,EAAW,GAALG,EACpD,MAAM,GAAIH,EAAK,KAAOA,EAAK,IAAK,CAE/B,MAGMI,IACI,EAALJ,IAAW,IAAa,GAJlBF,EAAMC,OAImB,IAAa,GAHtCD,EAAMC,OAGuC,EAAW,GAFxDD,EAAMC,MAGf,MACFlC,EAAI3M,KAAO+O,OAAOC,aAAa,OAAUE,GAAK,KAC9CvC,EAAI3M,KAAO+O,OAAOC,aAAa,OAAc,KAAJE,GAC1C,KAAM,CACL,MAAMD,EAAKL,EAAMC,KACXM,EAAKP,EAAMC,KACjBlC,EAAI3M,KAAO+O,OAAOC,cACT,GAALF,IAAY,IAAa,GAALG,IAAY,EAAW,GAALE,EAE3C,CACF,CACD,OAAOxC,EAAI8B,KAAK,GAClB,CA8JWW,CAAkB/B,KAAKgC,wBAAwB5B,EAAOC,KAkB/D2B,uBAAAA,CAAwB5B,EAAeC,GACrCL,KAAKQ,QAEL,MAAMyB,EAAgB5B,EAClBL,KAAKH,sBACLG,KAAKL,eAEHe,EAAmB,GAEzB,IAAK,IAAIhO,EAAI,EAAGA,EAAI0N,EAAMlO,QAAU,CAClC,MAAMyO,EAAQsB,EAAc7B,EAAMxN,OAAOF,MAGnCmO,EADYnO,EAAI0N,EAAMlO,OACF+P,EAAc7B,EAAMxN,OAAOF,IAAM,IACzDA,EAEF,MACMqO,EADYrO,EAAI0N,EAAMlO,OACF+P,EAAc7B,EAAMxN,OAAOF,IAAM,KACzDA,EAEF,MACMwP,EADYxP,EAAI0N,EAAMlO,OACF+P,EAAc7B,EAAMxN,OAAOF,IAAM,GAG3D,KAFEA,EAEW,MAATiO,GAA0B,MAATE,GAA0B,MAATE,GAA0B,MAATmB,EACrD,MAAM,IAAIC,EAGZ,MAAMnB,EAAYL,GAAS,EAAME,GAAS,EAG1C,GAFAH,EAAO7J,KAAKmK,GAEE,KAAVD,EAAc,CAChB,MAAME,EAAaJ,GAAS,EAAK,IAASE,GAAS,EAGnD,GAFAL,EAAO7J,KAAKoK,GAEE,KAAViB,EAAc,CAChB,MAAMhB,EAAaH,GAAS,EAAK,IAAQmB,EACzCxB,EAAO7J,KAAKqK,EACb,CACF,CACF,CAED,OAAOR,GAQTF,KAAAA,GACE,IAAKR,KAAKN,eAAgB,CACxBM,KAAKN,eAAiB,CAAC,EACvBM,KAAKL,eAAiB,CAAC,EACvBK,KAAKJ,sBAAwB,CAAC,EAC9BI,KAAKH,sBAAwB,CAAC,EAG9B,IAAK,IAAInN,EAAI,EAAGA,EAAIsN,KAAKD,aAAa7N,OAAQQ,IAC5CsN,KAAKN,eAAehN,GAAKsN,KAAKD,aAAanN,OAAOF,GAClDsN,KAAKL,eAAeK,KAAKN,eAAehN,IAAMA,EAC9CsN,KAAKJ,sBAAsBlN,GAAKsN,KAAKC,qBAAqBrN,OAAOF,GACjEsN,KAAKH,sBAAsBG,KAAKJ,sBAAsBlN,IAAMA,EAGxDA,GAAKsN,KAAKF,kBAAkB5N,SAC9B8N,KAAKL,eAAeK,KAAKC,qBAAqBrN,OAAOF,IAAMA,EAC3DsN,KAAKH,sBAAsBG,KAAKD,aAAanN,OAAOF,IAAMA,EAG/D,IAOC,MAAOyP,UAAgC/C,MAA7CgD,WAAAA,uBACW,KAAIhQ,KAAG,2BAMX,MAAMiQ,EAAe,SAAUtL,GACpC,MAAMuL,EAAYjD,EAAkBtI,GACpC,OAAO0I,EAAOU,gBAAgBmC,GAAW,EAC3C,EAMaC,EAAgC,SAAUxL,GAErD,OAAOsL,EAAatL,GAAKyL,QAAQ,MAAO,GAC1C,EAWaC,EAAe,SAAU1L,GACpC,IACE,OAAO0I,EAAO6B,aAAavK,GAAK,EACjC,CAAC,MAAO2L,GACPxN,QAAQyN,MAAM,wBAAyBD,EACxC,CACD,OAAO,IACT,ECnWM,SAAUE,EAAYjE,GAC1B,OAAOkE,OAAW1Q,EAAWwM,EAC/B,CAgBgB,SAAAkE,EAAWC,EAAiBC,GAC1C,KAAMA,aAAkBvM,QACtB,OAAOuM,EAGT,OAAQA,EAAOX,aACb,KAAKlP,KAIH,OAAO,IAAIA,KADO6P,EACQ3P,WAE5B,KAAKoD,YACYrE,IAAX2Q,IACFA,EAAS,CAAC,GAEZ,MACF,KAAKxC,MAEHwC,EAAS,GACT,MAEF,QAEE,OAAOC,EAGX,IAAK,MAAMC,KAAQD,EAEZA,EAAOE,eAAeD,IAad,cAbmCA,IAG/CF,EAAmCE,GAAQH,EACzCC,EAAmCE,GACnCD,EAAmCC,KAIxC,OAAOF,CACT,CCtBA,MAAMI,EAAwBA,eChC5B,GAAoB,qBAATC,KACT,OAAOA,KAET,GAAsB,qBAAXpP,OACT,OAAOA,OAET,GAAsB,qBAAXqP,EAAAA,EACT,OAAOA,EAAAA,EAET,MAAM,IAAIhE,MAAM,kCAClB,CDuBEiE,GAAYC,sBA2CDC,EAAcA,KACzB,IACE,OACEL,KApC6BM,MACjC,GAAuB,qBAAZ7P,QACT,OAEF,MAAM8P,EAAqB9P,CAAAA,SAAAA,aAAAA,WAAAA,GAAAA,qBAAAA,EAAAA,qBAAAA,EAAAA,qBAAAA,EAAAA,cAAAA,GAAY2P,sBACvC,OAAIG,EACKhI,KAAKO,MAAMyH,QADpB,CAEC,EA8BGD,IA3BwBE,MAC5B,GAAwB,qBAAbnR,SACT,OAEF,IAAIoR,EACJ,IACEA,EAAQpR,SAASC,OAAOmR,MAAM,gCAC/B,CAAC,MAAOjB,GAGP,MACD,CACD,MAAMkB,EAAUD,GAASlB,EAAakB,EAAM,IAC5C,OAAOC,GAAWnI,KAAKO,MAAM4H,EAAQ,EAejCF,EAEH,CAAC,MAAOhB,GAQP,YADAxN,QAAQ2O,KAAK,+CAA+CnB,IAE7D,GAmBUoB,EACXC,IAEA,MAAM3J,EAZN2J,KACuB,IAAAC,EAAAC,EAAA,OAA4B,QAA5BA,EAAe,QAAfD,EAAAT,WAAe,IAAAS,OAAA,EAAAA,EAAAE,qBAAa,IAAAD,OAAA,EAAAA,EAAGF,EAAY,EAWrDI,CAAuBJ,GACpC,IAAK3J,EACH,OAEF,MAAMgK,EAAiBhK,EAAKiK,YAAY,KACxC,GAAID,GAAkB,GAAKA,EAAiB,IAAMhK,EAAKlI,OACrD,MAAM,IAAIkN,MAAM,gBAAgBhF,yCAGlC,MAAMkK,EAAOrH,SAAS7C,EAAKvH,UAAUuR,EAAiB,GAAI,IAC1D,MAAgB,MAAZhK,EAAK,GAEA,CAACA,EAAKvH,UAAU,EAAGuR,EAAiB,GAAIE,GAExC,CAAClK,EAAKvH,UAAU,EAAGuR,GAAiBE,EAC5C,EAOUC,EAAsBA,KAAyC,IAAAP,EAC1E,OAAa,QAAbA,EAAAT,WAAa,IAAAS,OAAA,EAAAA,EAAEtP,MAAM,QE/IV8P,EAIXpC,WAAAA,GAFA,KAAAqC,OAAoC,OACpC,KAAAC,QAAqC,OAEnC1E,KAAK2E,QAAU,IAAIC,SAAQ,CAACF,EAASD,KACnCzE,KAAK0E,QAAUA,EACf1E,KAAKyE,OAASA,CAAmC,IASrDI,YAAAA,CACEjL,GAEA,MAAO,CAAC+I,EAAOhE,KACTgE,EACF3C,KAAKyE,OAAO9B,GAEZ3C,KAAK0E,QAAQ/F,GAES,oBAAb/E,IAGToG,KAAK2E,QAAQG,OAAM,SAIK,IAApBlL,EAAS1H,OACX0H,EAAS+I,GAET/I,EAAS+I,EAAOhE,GAEnB,YCzBSoG,IACd,MACuB,qBAAdC,WAC2B,kBAA3BA,UAAqB,UAErBA,UAAqB,UAErB,EAEX,UASgBC,IACd,MACoB,qBAAXlR,WAGJA,OAAgB,SAAKA,OAAiB,UAAKA,OAAiB,WAC/D,oDAAoDmR,KAAKH,IAE7D,UA0GgBI,IACd,OAAiC,IAA1BpG,IAA2D,IAAzBA,CAC3C,CC1FM,MAAOqG,UAAsBhG,MAIjCgD,WAAAA,CAEWiD,EACTnG,EAEOoG,GAEPC,MAAMrG,GALG,KAAImG,KAAJA,EAGF,KAAUC,WAAVA,EAPA,KAAIlT,KAdI,gBA2BfoE,OAAOgP,eAAexF,KAAMoF,EAAcK,WAItCrG,MAAMsG,mBACRtG,MAAMsG,kBAAkB1F,KAAM2F,EAAaF,UAAUG,eAK9CD,EAIXvD,WAAAA,CACmByD,EACAC,EACAC,GAFA,KAAOF,QAAPA,EACA,KAAWC,YAAXA,EACA,KAAMC,OAANA,EAGnBH,MAAAA,CACEP,GAGA,MAAMC,GAAcrT,UAAAC,QAAA,OAAAC,EAAAF,UAAA,KAAyB,CAAC,EACxC+T,EAAW,GAAGhG,KAAK6F,WAAWR,IAC9BY,EAAWjG,KAAK+F,OAAOV,GAEvBnG,EAAU+G,EAUpB,SAAyBA,EAAkBC,GACzC,OAAOD,EAASzD,QAAQ2D,GAAS,CAACjQ,EAAGiB,KACnC,MAAMwH,EAAQuH,EAAK/O,GACnB,OAAgB,MAATwH,EAAgB+C,OAAO/C,GAAS,IAAIxH,KAAO,GAEtD,CAf+BiP,CAAgBH,EAAUX,GAAc,QAE7De,EAAc,GAAGrG,KAAK8F,gBAAgB5G,MAAY8G,MAIxD,OAFc,IAAIZ,EAAcY,EAAUK,EAAaf,IAa3D,MAAMa,EAAU,gBC9GV,SAAUG,EAASvP,GACvB,OAAO0E,KAAKO,MAAMjF,EACpB,CAOM,SAAU2E,EAAUwK,GACxB,OAAOzK,KAAKC,UAAUwK,EACxB,CCIO,MAAMK,EAAS,SAAUC,GAC9B,IAAIC,EAAS,CAAC,EACZC,EAAiB,CAAC,EAClBR,EAAO,CAAC,EACRS,EAAY,GAEd,IACE,MAAMC,EAAQJ,EAAM/T,MAAM,KAC1BgU,EAASH,EAAS7D,EAAamE,EAAM,KAAO,IAC5CF,EAASJ,EAAS7D,EAAamE,EAAM,KAAO,IAC5CD,EAAYC,EAAM,GAClBV,EAAOQ,EAAU,GAAK,CAAC,SAChBA,EAAU,CAClB,CAAC,MAAOhE,GAAI,CAEb,MAAO,CACL+D,SACAC,SACAR,OACAS,YAEJ,EC1CgB,SAAAE,EAA2B1J,EAAQhG,GACjD,OAAOX,OAAOiP,UAAUxC,eAAe6D,KAAK3J,EAAKhG,EACnD,CAEgB,SAAA4P,EACd5J,EACAhG,GAEA,OAAIX,OAAOiP,UAAUxC,eAAe6D,KAAK3J,EAAKhG,GACrCgG,EAAIhG,QAEX,CAEJ,CAEM,SAAU6P,EAAQ7J,GACtB,IAAK,MAAMhG,KAAOgG,EAChB,GAAI3G,OAAOiP,UAAUxC,eAAe6D,KAAK3J,EAAKhG,GAC5C,OAAO,EAGX,OAAO,CACT,UAEgB2B,EACdqE,EACA8J,EACAC,GAEA,MAAMC,EAAkC,CAAC,EACzC,IAAK,MAAMhQ,KAAOgG,EACZ3G,OAAOiP,UAAUxC,eAAe6D,KAAK3J,EAAKhG,KAC5CgQ,EAAIhQ,GAAO8P,EAAGH,KAAKI,EAAY/J,EAAIhG,GAAMA,EAAKgG,IAGlD,OAAOgK,CACT,CAKgB,SAAAC,EAAUlP,EAAWC,GACnC,GAAID,IAAMC,EACR,OAAO,EAGT,MAAMkP,EAAQ7Q,OAAOC,KAAKyB,GACpBoP,EAAQ9Q,OAAOC,KAAK0B,GAC1B,IAAK,MAAMoP,KAAKF,EAAO,CACrB,IAAKC,EAAME,SAASD,GAClB,OAAO,EAGT,MAAME,EAASvP,EAA8BqP,GACvCG,EAASvP,EAA8BoP,GAC7C,GAAII,EAASF,IAAUE,EAASD,IAC9B,IAAKN,EAAUK,EAAOC,GACpB,OAAO,OAEJ,GAAID,IAAUC,EACnB,OAAO,CAEV,CAED,IAAK,MAAMH,KAAKD,EACd,IAAKD,EAAMG,SAASD,GAClB,OAAO,EAGX,OAAO,CACT,CAEA,SAASI,EAASC,GAChB,OAAiB,OAAVA,GAAmC,kBAAVA,CAClC,OClDaC,EAuCXzF,WAAAA,GAjCQ,KAAM0F,OAAa,GAMnB,KAAIC,KAAa,GAOjB,KAAEC,GAAa,GAMf,KAAIC,KAAa,GAKjB,KAAMC,OAAW,EAKjB,KAAMC,OAAW,EAKvBnI,KAAKoI,UAAY,GAEjBpI,KAAKiI,KAAK,GAAK,IACf,IAAK,IAAIvV,EAAI,EAAGA,EAAIsN,KAAKoI,YAAa1V,EACpCsN,KAAKiI,KAAKvV,GAAK,EAGjBsN,KAAKqI,QAGPA,KAAAA,GACErI,KAAK8H,OAAO,GAAK,WACjB9H,KAAK8H,OAAO,GAAK,WACjB9H,KAAK8H,OAAO,GAAK,WACjB9H,KAAK8H,OAAO,GAAK,UACjB9H,KAAK8H,OAAO,GAAK,WAEjB9H,KAAKkI,OAAS,EACdlI,KAAKmI,OAAS,EAShBG,SAAAA,CAAUC,EAAqCC,GACxCA,IACHA,EAAS,GAGX,MAAMC,EAAIzI,KAAKgI,GAGf,GAAmB,kBAARO,EACT,IAAK,IAAI7V,EAAI,EAAGA,EAAI,GAAIA,IAStB+V,EAAE/V,GACC6V,EAAI/I,WAAWgJ,IAAW,GAC1BD,EAAI/I,WAAWgJ,EAAS,IAAM,GAC9BD,EAAI/I,WAAWgJ,EAAS,IAAM,EAC/BD,EAAI/I,WAAWgJ,EAAS,GAC1BA,GAAU,OAGZ,IAAK,IAAI9V,EAAI,EAAGA,EAAI,GAAIA,IACtB+V,EAAE/V,GACC6V,EAAIC,IAAW,GACfD,EAAIC,EAAS,IAAM,GACnBD,EAAIC,EAAS,IAAM,EACpBD,EAAIC,EAAS,GACfA,GAAU,EAKd,IAAK,IAAI9V,EAAI,GAAIA,EAAI,GAAIA,IAAK,CAC5B,MAAMgW,EAAID,EAAE/V,EAAI,GAAK+V,EAAE/V,EAAI,GAAK+V,EAAE/V,EAAI,IAAM+V,EAAE/V,EAAI,IAClD+V,EAAE/V,GAA+B,YAAxBgW,GAAK,EAAMA,IAAM,GAC3B,CAED,IAKIC,EAAGpB,EALHrP,EAAI8H,KAAK8H,OAAO,GAChB3P,EAAI6H,KAAK8H,OAAO,GAChBnV,EAAIqN,KAAK8H,OAAO,GAChB7U,EAAI+M,KAAK8H,OAAO,GAChBpF,EAAI1C,KAAK8H,OAAO,GAIpB,IAAK,IAAIpV,EAAI,EAAGA,EAAI,GAAIA,IAAK,CACvBA,EAAI,GACFA,EAAI,IACNiW,EAAI1V,EAAKkF,GAAKxF,EAAIM,GAClBsU,EAAI,aAEJoB,EAAIxQ,EAAIxF,EAAIM,EACZsU,EAAI,YAGF7U,EAAI,IACNiW,EAAKxQ,EAAIxF,EAAMM,GAAKkF,EAAIxF,GACxB4U,EAAI,aAEJoB,EAAIxQ,EAAIxF,EAAIM,EACZsU,EAAI,YAIR,MAAMmB,GAAOxQ,GAAK,EAAMA,IAAM,IAAOyQ,EAAIjG,EAAI6E,EAAIkB,EAAE/V,GAAM,WACzDgQ,EAAIzP,EACJA,EAAIN,EACJA,EAA8B,YAAxBwF,GAAK,GAAOA,IAAM,GACxBA,EAAID,EACJA,EAAIwQ,CACL,CAED1I,KAAK8H,OAAO,GAAM9H,KAAK8H,OAAO,GAAK5P,EAAK,WACxC8H,KAAK8H,OAAO,GAAM9H,KAAK8H,OAAO,GAAK3P,EAAK,WACxC6H,KAAK8H,OAAO,GAAM9H,KAAK8H,OAAO,GAAKnV,EAAK,WACxCqN,KAAK8H,OAAO,GAAM9H,KAAK8H,OAAO,GAAK7U,EAAK,WACxC+M,KAAK8H,OAAO,GAAM9H,KAAK8H,OAAO,GAAKpF,EAAK,WAG1CkG,MAAAA,CAAOrH,EAAwCrP,GAE7C,GAAa,MAATqP,EACF,YAGapP,IAAXD,IACFA,EAASqP,EAAMrP,QAGjB,MAAM2W,EAAmB3W,EAAS8N,KAAKoI,UACvC,IAAIU,EAAI,EAER,MAAMP,EAAMvI,KAAK+H,KACjB,IAAIgB,EAAQ/I,KAAKkI,OAGjB,KAAOY,EAAI5W,GAAQ,CAKjB,GAAc,IAAV6W,EACF,KAAOD,GAAKD,GACV7I,KAAKsI,UAAU/G,EAAOuH,GACtBA,GAAK9I,KAAKoI,UAId,GAAqB,kBAAV7G,GACT,KAAOuH,EAAI5W,GAIT,GAHAqW,EAAIQ,GAASxH,EAAM/B,WAAWsJ,KAC5BC,IACAD,EACEC,IAAU/I,KAAKoI,UAAW,CAC5BpI,KAAKsI,UAAUC,GACfQ,EAAQ,EAER,KACD,OAGH,KAAOD,EAAI5W,GAIT,GAHAqW,EAAIQ,GAASxH,EAAMuH,KACjBC,IACAD,EACEC,IAAU/I,KAAKoI,UAAW,CAC5BpI,KAAKsI,UAAUC,GACfQ,EAAQ,EAER,KACD,CAGN,CAED/I,KAAKkI,OAASa,EACd/I,KAAKmI,QAAUjW,EAIjB8W,MAAAA,GACE,MAAMA,EAAmB,GACzB,IAAIC,EAA0B,EAAdjJ,KAAKmI,OAGjBnI,KAAKkI,OAAS,GAChBlI,KAAK4I,OAAO5I,KAAKiI,KAAM,GAAKjI,KAAKkI,QAEjClI,KAAK4I,OAAO5I,KAAKiI,KAAMjI,KAAKoI,WAAapI,KAAKkI,OAAS,KAIzD,IAAK,IAAIxV,EAAIsN,KAAKoI,UAAY,EAAG1V,GAAK,GAAIA,IACxCsN,KAAK+H,KAAKrV,GAAiB,IAAZuW,EACfA,GAAa,IAGfjJ,KAAKsI,UAAUtI,KAAK+H,MAEpB,IAAIe,EAAI,EACR,IAAK,IAAIpW,EAAI,EAAGA,EAAI,EAAGA,IACrB,IAAK,IAAIwW,EAAI,GAAIA,GAAK,EAAGA,GAAK,EAC5BF,EAAOF,GAAM9I,KAAK8H,OAAOpV,IAAMwW,EAAK,MAClCJ,EAGN,OAAOE,GC7NK,SAAAG,EAAYC,EAAgBC,GAC1C,MAAO,GAAGD,aAAkBC,aAC9B,CC1BO,MAuCMC,EAAe,SAAUvS,GACpC,IAAIwI,EAAI,EACR,IAAK,IAAI7M,EAAI,EAAGA,EAAIqE,EAAI7E,OAAQQ,IAAK,CACnC,MAAMC,EAAIoE,EAAIyI,WAAW9M,GACrBC,EAAI,IACN4M,IACS5M,EAAI,KACb4M,GAAK,EACI5M,GAAK,OAAUA,GAAK,OAE7B4M,GAAK,EACL7M,KAEA6M,GAAK,CAER,CACD,OAAOA,CACT,ECrEM,SAAUgK,EACd1D,GAEA,OAAIA,GAAYA,EAA+B2D,UACrC3D,EAA+B2D,UAEhC3D,CAEX,OCDa4D,EAiBXrH,WAAAA,CACWhQ,EACAsX,EACA9K,GAFA,KAAIxM,KAAJA,EACA,KAAesX,gBAAfA,EACA,KAAI9K,KAAJA,EAnBX,KAAiB+K,mBAAG,EAIpB,KAAYC,aAAe,CAAC,EAE5B,KAAAC,kBAA2C,OAE3C,KAAiBC,kBAAwC,KAczDC,oBAAAA,CAAqBC,GAEnB,OADAhK,KAAK6J,kBAAoBG,EAClBhK,KAGTiK,oBAAAA,CAAqBN,GAEnB,OADA3J,KAAK2J,kBAAoBA,EAClB3J,KAGTkK,eAAAA,CAAgBC,GAEd,OADAnK,KAAK4J,aAAeO,EACbnK,KAGToK,0BAAAA,CAA2BxQ,GAEzB,OADAoG,KAAK8J,kBAAoBlQ,EAClBoG,MCnDJ,MAAMqK,EAAqB,kBCgBrBC,EAWXlI,WAAAA,CACmBhQ,EACAmY,GADA,KAAInY,KAAJA,EACA,KAASmY,UAATA,EAZX,KAASC,UAAwB,KACxB,KAAAC,UAAgD,IAAIC,IACpD,KAAAC,kBAGb,IAAID,IACS,KAAAE,iBACf,IAAIF,IACE,KAAAG,gBAAuD,IAAIH,IAWnExW,GAAAA,CAAI4W,GAEF,MAAMC,EAAuB/K,KAAKgL,4BAA4BF,GAE9D,IAAK9K,KAAK2K,kBAAkBM,IAAIF,GAAuB,CACrD,MAAMG,EAAW,IAAI1G,EAGrB,GAFAxE,KAAK2K,kBAAkBQ,IAAIJ,EAAsBG,GAG/ClL,KAAKoL,cAAcL,IACnB/K,KAAKqL,uBAGL,IACE,MAAMC,EAAWtL,KAAKuL,uBAAuB,CAC3CC,mBAAoBT,IAElBO,GACFJ,EAASxG,QAAQ4G,EAEpB,CAAC,MAAO5I,IAKZ,CAED,OAAO1C,KAAK2K,kBAAkBzW,IAAI6W,GAAuBpG,QAmB3D8G,YAAAA,CAAaC,SAKX,MAAMX,EAAuB/K,KAAKgL,4BAChC,OAAAU,QAAA,IAAAA,OAAA,EAAAA,EAASZ,YAELa,EAAgC,QAArB3H,EAAA,OAAA0H,QAAA,IAAAA,OAAA,EAAAA,EAASC,gBAAY,IAAA3H,GAAAA,EAEtC,IACEhE,KAAKoL,cAAcL,KACnB/K,KAAKqL,uBAaA,CAEL,GAAIM,EACF,OAAO,KAEP,MAAMvM,MAAM,WAAWY,KAAK5N,wBAE/B,CAlBC,IACE,OAAO4N,KAAKuL,uBAAuB,CACjCC,mBAAoBT,GAEvB,CAAC,MAAOrI,GACP,GAAIiJ,EACF,OAAO,KAEP,MAAMjJ,CAET,EAWLkJ,YAAAA,GACE,OAAO5L,KAAKwK,UAGdqB,YAAAA,CAAarB,GACX,GAAIA,EAAUpY,OAAS4N,KAAK5N,KAC1B,MAAMgN,MACJ,yBAAyBoL,EAAUpY,qBAAqB4N,KAAK5N,SAIjE,GAAI4N,KAAKwK,UACP,MAAMpL,MAAM,iBAAiBY,KAAK5N,kCAMpC,GAHA4N,KAAKwK,UAAYA,EAGZxK,KAAKqL,uBAAV,CAKA,GA0NJ,SAA0Cb,GACxC,MAAuC,UAAhCA,EAAUX,iBACnB,CA5NQiC,CAAiBtB,GACnB,IACExK,KAAKuL,uBAAuB,CAAEC,mBAAoBnB,GACnD,CAAC,MAAO3H,IAWX,IAAK,MACH8I,EACAO,KACG/L,KAAK2K,kBAAkBqB,UAAW,CACrC,MAAMjB,EACJ/K,KAAKgL,4BAA4BQ,GAEnC,IAEE,MAAMF,EAAWtL,KAAKuL,uBAAuB,CAC3CC,mBAAoBT,IAEtBgB,EAAiBrH,QAAQ4G,EAC1B,CAAC,MAAO5I,IAIV,CAlCA,EAqCHuJ,aAAAA,GAAqD,IAAvCnB,EAAA7Y,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAqBoY,EACjCrK,KAAK2K,kBAAkBuB,OAAOpB,GAC9B9K,KAAK4K,iBAAiBsB,OAAOpB,GAC7B9K,KAAKyK,UAAUyB,OAAOpB,GAKxB,YAAMoB,GACJ,MAAMC,EAAW7L,MAAM8L,KAAKpM,KAAKyK,UAAU4B,gBAErCzH,QAAQ0H,IAAI,IACbH,EACA3P,QAAOqJ,GAAW,aAAcA,IAEhC/M,KAAI+M,GAAYA,EAAgB0G,SAAUL,cAC1CC,EACA3P,QAAOqJ,GAAW,YAAaA,IAE/B/M,KAAI+M,GAAYA,EAAgB2G,cAIvCC,cAAAA,GACE,OAAyB,MAAlBzM,KAAKwK,UAGdY,aAAAA,GAAqD,IAAvCN,EAAA7Y,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAqBoY,EACjC,OAAOrK,KAAKyK,UAAUQ,IAAIH,GAG5B4B,UAAAA,GAAkD,IAAvC5B,EAAA7Y,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAqBoY,EAC9B,OAAOrK,KAAK4K,iBAAiB1W,IAAI4W,IAAe,CAAC,EAGnD6B,UAAAA,GAAuC,IAA5BC,EAAA3a,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAA0B,CAAC,EACpC,MAAM,QAAEyZ,EAAU,CAAC,GAAMkB,EACnB7B,EAAuB/K,KAAKgL,4BAChC4B,EAAKpB,oBAEP,GAAIxL,KAAKoL,cAAcL,GACrB,MAAM3L,MACJ,GAAGY,KAAK5N,QAAQ2Y,mCAIpB,IAAK/K,KAAKyM,iBACR,MAAMrN,MAAM,aAAaY,KAAK5N,oCAGhC,MAAMkZ,EAAWtL,KAAKuL,uBAAuB,CAC3CC,mBAAoBT,EACpBW,YAIF,IAAK,MACHF,EACAO,KACG/L,KAAK2K,kBAAkBqB,UAAW,CAGjCjB,IADF/K,KAAKgL,4BAA4BQ,IAEjCO,EAAiBrH,QAAQ4G,EAE5B,CAED,OAAOA,EAWTuB,MAAAA,CAAOjT,EAA6BkR,SAClC,MAAMC,EAAuB/K,KAAKgL,4BAA4BF,GACxDgC,EAC0C,QAA9C9I,EAAAhE,KAAK6K,gBAAgB3W,IAAI6W,UAAqB,IAAA/G,EAAAA,EAC9C,IAAI+I,IACND,EAAkBE,IAAIpT,GACtBoG,KAAK6K,gBAAgBM,IAAIJ,EAAsB+B,GAE/C,MAAMG,EAAmBjN,KAAKyK,UAAUvW,IAAI6W,GAK5C,OAJIkC,GACFrT,EAASqT,EAAkBlC,GAGtB,KACL+B,EAAkBZ,OAAOtS,EAAS,EAQ9BsT,qBAAAA,CACN5B,EACAR,GAEA,MAAMqC,EAAYnN,KAAK6K,gBAAgB3W,IAAI4W,GAC3C,GAAKqC,EAGL,IAAK,MAAMvT,KAAYuT,EACrB,IACEvT,EAAS0R,EAAUR,EACpB,CAAC,MAAM9G,KAMJuH,sBAAAA,CAAsB6B,GAM7B,IAN8B,mBAC7B5B,EAAkB,QAClBE,EAAU,CAAC,GAIZ0B,EACK9B,EAAWtL,KAAKyK,UAAUvW,IAAIsX,GAClC,IAAKF,GAAYtL,KAAKwK,YACpBc,EAAWtL,KAAKwK,UAAUd,gBAAgB1J,KAAKuK,UAAW,CACxDiB,oBAqD+BV,EArDmBU,EAsDjDV,IAAeT,OAAqBlY,EAAY2Y,GArDjDY,YAEF1L,KAAKyK,UAAUU,IAAIK,EAAoBF,GACvCtL,KAAK4K,iBAAiBO,IAAIK,EAAoBE,GAO9C1L,KAAKkN,sBAAsB5B,EAAUE,GAOjCxL,KAAKwK,UAAUV,mBACjB,IACE9J,KAAKwK,UAAUV,kBACb9J,KAAKuK,UACLiB,EACAF,EAEH,CAAC,MAAMtH,IA4BhB,IAAuC8G,EAtBnC,OAAOQ,GAAY,KAGbN,2BAAAA,GACiC,IAAvCF,EAAA7Y,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAqBoY,EAErB,OAAIrK,KAAKwK,UACAxK,KAAKwK,UAAUb,kBAAoBmB,EAAaT,EAEhDS,EAIHO,oBAAAA,GACN,QACIrL,KAAKwK,WAC8B,aAArCxK,KAAKwK,UAAUX,yBCrVRwD,EAGXjL,WAAAA,CAA6BhQ,GAAA,KAAIA,KAAJA,EAFZ,KAAAkb,UAAY,IAAI5C,IAajC6C,YAAAA,CAA6B/C,GAC3B,MAAMgD,EAAWxN,KAAKyN,YAAYjD,EAAUpY,MAC5C,GAAIob,EAASf,iBACX,MAAM,IAAIrN,MACR,aAAaoL,EAAUpY,yCAAyC4N,KAAK5N,QAIzEob,EAAS3B,aAAarB,GAGxBkD,uBAAAA,CAAwClD,GACrBxK,KAAKyN,YAAYjD,EAAUpY,MAC/Bqa,kBAEXzM,KAAKsN,UAAUpB,OAAO1B,EAAUpY,MAGlC4N,KAAKuN,aAAa/C,GAUpBiD,WAAAA,CAA4Brb,GAC1B,GAAI4N,KAAKsN,UAAUrC,IAAI7Y,GACrB,OAAO4N,KAAKsN,UAAUpZ,IAAI9B,GAI5B,MAAMob,EAAW,IAAIlD,EAAYlY,EAAM4N,MAGvC,OAFAA,KAAKsN,UAAUnC,IAAI/Y,EAAMob,GAElBA,EAGTG,YAAAA,GACE,OAAOrN,MAAM8L,KAAKpM,KAAKsN,UAAUjB,WCtC9B,MAAM5B,EAAsB,OAavBmD,GAAZ,SAAYA,GACVA,EAAAA,EAAA,iBACAA,EAAAA,EAAA,qBACAA,EAAAA,EAAA,eACAA,EAAAA,EAAA,eACAA,EAAAA,EAAA,iBACAA,EAAAA,EAAA,kBACD,CAPD,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,EAAgC,SAAChD,EAAUiD,GAC/C,GAAIA,EAAUjD,EAASkD,SACrB,OAEF,MAAMC,GAAM,IAAIvb,MAAOwb,cACjBnQ,EAAS8P,EAAcE,GAC7B,IAAIhQ,EAMF,MAAM,IAAIa,MACR,8DAA8DmP,MAPtD,QAAAI,EAAA1c,UAAAC,OAN+C0c,EAAI,IAAAtO,MAAAqO,EAAA,EAAAA,EAAA,KAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAJD,EAAIC,EAAA,GAAA5c,UAAA4c,GAO7D3Z,QAAQqJ,GACN,IAAIkQ,OAASnD,EAASlZ,WACnBwc,EAOT,QAEaE,EAOX1M,WAAAA,CAAmBhQ,GAAA,KAAIA,KAAJA,EAUX,KAAS2c,UAAGX,EAsBZ,KAAWY,YAAeV,EAc1B,KAAeW,gBAAsB,KA1C3CxE,EAAU5T,KAAKmJ,MAQjB,YAAIwO,GACF,OAAOxO,KAAK+O,UAGd,YAAIP,CAASU,GACX,KAAMA,KAAOtB,GACX,MAAM,IAAIuB,UAAU,kBAAkBD,+BAExClP,KAAK+O,UAAYG,EAInBE,WAAAA,CAAYF,GACVlP,KAAK+O,UAA2B,kBAARG,EAAmBrB,EAAkBqB,GAAOA,EAQtE,cAAIG,GACF,OAAOrP,KAAKgP,YAEd,cAAIK,CAAWH,GACb,GAAmB,oBAARA,EACT,MAAM,IAAIC,UAAU,qDAEtBnP,KAAKgP,YAAcE,EAOrB,kBAAII,GACF,OAAOtP,KAAKiP,gBAEd,kBAAIK,CAAeJ,GACjBlP,KAAKiP,gBAAkBC,EAOzBK,KAAAA,GAAwB,QAAAC,EAAAvd,UAAAC,OAAf0c,EAAe,IAAAtO,MAAAkP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAfb,EAAea,GAAAxd,UAAAwd,GACtBzP,KAAKiP,iBAAmBjP,KAAKiP,gBAAgBjP,KAAM4N,EAASE,SAAUc,GACtE5O,KAAKgP,YAAYhP,KAAM4N,EAASE,SAAUc,GAE5CzZ,GAAAA,GAAsB,QAAAua,EAAAzd,UAAAC,OAAf0c,EAAe,IAAAtO,MAAAoP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAff,EAAee,GAAA1d,UAAA0d,GACpB3P,KAAKiP,iBACHjP,KAAKiP,gBAAgBjP,KAAM4N,EAASG,WAAYa,GAClD5O,KAAKgP,YAAYhP,KAAM4N,EAASG,WAAYa,GAE9C/K,IAAAA,GAAuB,QAAA+L,EAAA3d,UAAAC,OAAf0c,EAAe,IAAAtO,MAAAsP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAfjB,EAAeiB,GAAA5d,UAAA4d,GACrB7P,KAAKiP,iBAAmBjP,KAAKiP,gBAAgBjP,KAAM4N,EAASI,QAASY,GACrE5O,KAAKgP,YAAYhP,KAAM4N,EAASI,QAASY,GAE3CkB,IAAAA,GAAuB,QAAAC,EAAA9d,UAAAC,OAAf0c,EAAe,IAAAtO,MAAAyP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAfpB,EAAeoB,GAAA/d,UAAA+d,GACrBhQ,KAAKiP,iBAAmBjP,KAAKiP,gBAAgBjP,KAAM4N,EAASK,QAASW,GACrE5O,KAAKgP,YAAYhP,KAAM4N,EAASK,QAASW,GAE3CjM,KAAAA,GAAwB,QAAAsN,EAAAhe,UAAAC,OAAf0c,EAAe,IAAAtO,MAAA2P,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAftB,EAAesB,GAAAje,UAAAie,GACtBlQ,KAAKiP,iBAAmBjP,KAAKiP,gBAAgBjP,KAAM4N,EAASM,SAAUU,GACtE5O,KAAKgP,YAAYhP,KAAM4N,EAASM,SAAUU,IC/M9C,IAAIuB,EACAC,GAqBJ,MAAMC,GAAmB,IAAIC,QACvBC,GAAqB,IAAID,QACzBE,GAA2B,IAAIF,QAC/BG,GAAiB,IAAIH,QACrBI,GAAwB,IAAIJ,QA0DlC,IAAIK,GAAgB,CAChBzc,GAAAA,CAAI4O,EAAQE,EAAM4N,GACd,GAAI9N,aAAkB+N,eAAgB,CAElC,GAAa,SAAT7N,EACA,OAAOuN,GAAmBrc,IAAI4O,GAElC,GAAa,qBAATE,EACA,OAAOF,EAAOgO,kBAAoBN,GAAyBtc,IAAI4O,GAGnE,GAAa,UAATE,EACA,OAAO4N,EAASE,iBAAiB,QAC3B3e,EACAye,EAASG,YAAYH,EAASE,iBAAiB,GAE7D,CAEA,OAAOE,GAAKlO,EAAOE,GACvB,EACAmI,IAAGA,CAACrI,EAAQE,EAAMrE,KACdmE,EAAOE,GAAQrE,GACR,GAEXsM,IAAGA,CAACnI,EAAQE,IACJF,aAAkB+N,iBACR,SAAT7N,GAA4B,UAATA,IAGjBA,KAAQF,GAMvB,SAASmO,GAAaC,GAIlB,OAAIA,IAASC,YAAY1L,UAAU2L,aAC7B,qBAAsBP,eAAepL,WA7GnC2K,KACHA,GAAuB,CACpBiB,UAAU5L,UAAU6L,QACpBD,UAAU5L,UAAU8L,SACpBF,UAAU5L,UAAU+L,sBAqHEhK,SAAS0J,GAC5B,WAAmB,QAAA1B,EAAAvd,UAAAC,OAAN0c,EAAI,IAAAtO,MAAAkP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJb,EAAIa,GAAAxd,UAAAwd,GAIpB,OADAyB,EAAKO,MAAMC,GAAO1R,MAAO4O,GAClBoC,GAAKX,GAAiBnc,IAAI8L,MACrC,EAEG,WAAmB,QAAA0P,EAAAzd,UAAAC,OAAN0c,EAAI,IAAAtO,MAAAoP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJf,EAAIe,GAAA1d,UAAA0d,GAGpB,OAAOqB,GAAKE,EAAKO,MAAMC,GAAO1R,MAAO4O,GACzC,EAvBW,SAAU+C,GAAqB,QAAAhD,EAAA1c,UAAAC,OAAN0c,EAAI,IAAAtO,MAAAqO,EAAA,EAAAA,EAAA,KAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAJD,EAAIC,EAAA,GAAA5c,UAAA4c,GAChC,MAAM+C,EAAKV,EAAKpK,KAAK4K,GAAO1R,MAAO2R,KAAe/C,GAElD,OADA4B,GAAyBrF,IAAIyG,EAAID,EAAWE,KAAOF,EAAWE,OAAS,CAACF,IACjEX,GAAKY,EAChB,CAoBR,CACA,SAASE,GAAuBnT,GAC5B,MAAqB,oBAAVA,EACAsS,GAAatS,IAGpBA,aAAiBkS,gBAhGzB,SAAwCe,GAEpC,GAAIrB,GAAmBtF,IAAI2G,GACvB,OACJ,MAAMG,EAAO,IAAInN,SAAQ,CAACF,EAASD,KAC/B,MAAMuN,EAAWA,KACbJ,EAAGK,oBAAoB,WAAYC,GACnCN,EAAGK,oBAAoB,QAAStP,GAChCiP,EAAGK,oBAAoB,QAAStP,EAAM,EAEpCuP,EAAWA,KACbxN,IACAsN,GAAU,EAERrP,EAAQA,KACV8B,EAAOmN,EAAGjP,OAAS,IAAIwP,aAAa,aAAc,eAClDH,GAAU,EAEdJ,EAAGQ,iBAAiB,WAAYF,GAChCN,EAAGQ,iBAAiB,QAASzP,GAC7BiP,EAAGQ,iBAAiB,QAASzP,EAAM,IAGvC4N,GAAmBpF,IAAIyG,EAAIG,EAC/B,CAyEQM,CAA+B1T,GA9JhB2T,EA+JD3T,GAzJVwR,IACHA,EAAoB,CACjBgB,YACAoB,eACAC,SACAnB,UACAR,kBAZiD4B,MAAM9f,GAAM2f,aAAkB3f,IAgK5E,IAAI+f,MAAM/T,EAAOgS,IAErBhS,GAlKWgU,IAACL,CAmKvB,CACA,SAAStB,GAAKrS,GAGV,GAAIA,aAAiBiU,WACjB,OA3IR,SAA0BC,GACtB,MAAMlO,EAAU,IAAIC,SAAQ,CAACF,EAASD,KAClC,MAAMuN,EAAWA,KACba,EAAQZ,oBAAoB,UAAWa,GACvCD,EAAQZ,oBAAoB,QAAStP,EAAM,EAEzCmQ,EAAUA,KACZpO,EAAQsM,GAAK6B,EAAQ7b,SACrBgb,GAAU,EAERrP,EAAQA,KACV8B,EAAOoO,EAAQlQ,OACfqP,GAAU,EAEda,EAAQT,iBAAiB,UAAWU,GACpCD,EAAQT,iBAAiB,QAASzP,EAAM,IAe5C,OAbAgC,EACKoO,MAAMpU,IAGHA,aAAiB0S,WACjBhB,GAAiBlF,IAAIxM,EAAOkU,EAChC,IAGC/N,OAAM,SAGX4L,GAAsBvF,IAAIxG,EAASkO,GAC5BlO,CACX,CA4GeqO,CAAiBrU,GAG5B,GAAI8R,GAAexF,IAAItM,GACnB,OAAO8R,GAAevc,IAAIyK,GAC9B,MAAMsU,EAAWnB,GAAuBnT,GAOxC,OAJIsU,IAAatU,IACb8R,GAAetF,IAAIxM,EAAOsU,GAC1BvC,GAAsBvF,IAAI8H,EAAUtU,IAEjCsU,CACX,CACA,MAAMvB,GAAU/S,GAAU+R,GAAsBxc,IAAIyK,GCrIpD,MAAMuU,GAAc,CAAC,MAAO,SAAU,SAAU,aAAc,SACxDC,GAAe,CAAC,MAAO,MAAO,SAAU,SACxCC,GAAgB,IAAI1I,IAC1B,SAAS2I,GAAUvQ,EAAQE,GACvB,KAAMF,aAAkBqO,cAClBnO,KAAQF,GACM,kBAATE,EACP,OAEJ,GAAIoQ,GAAclf,IAAI8O,GAClB,OAAOoQ,GAAclf,IAAI8O,GAC7B,MAAMsQ,EAAiBtQ,EAAKR,QAAQ,aAAc,IAC5C+Q,EAAWvQ,IAASsQ,EACpBE,EAAUL,GAAa3L,SAAS8L,GACtC,KAEEA,KAAmBC,EAAWf,SAAWD,gBAAgB9M,aACrD+N,IAAWN,GAAY1L,SAAS8L,GAClC,OAEJ,MAAM/U,EAASnB,eAAgBqW,GAE3B,MAAM7B,EAAK5R,KAAKoR,YAAYqC,EAAWD,EAAU,YAAc,YAC/D,IAAI1Q,EAAS8O,EAAG8B,MAAM,QAAA/E,EAAA1c,UAAAC,OAHmB0c,EAAI,IAAAtO,MAAAqO,EAAA,EAAAA,EAAA,KAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAJD,EAAIC,EAAA,GAAA5c,UAAA4c,GAW7C,OAPI0E,IACAzQ,EAASA,EAAO6Q,MAAM/E,EAAKgF,iBAMjBhP,QAAQ0H,IAAI,CACtBxJ,EAAOwQ,MAAmB1E,GAC1B4E,GAAW5B,EAAGG,QACd,EACR,EAEA,OADAqB,GAAcjI,IAAInI,EAAMzE,GACjBA,CACX,CDgCIoS,GC/BUkD,KAAQ,IACfA,EACH3f,IAAKA,CAAC4O,EAAQE,EAAM4N,IAAayC,GAAUvQ,EAAQE,IAAS6Q,EAAS3f,IAAI4O,EAAQE,EAAM4N,GACvF3F,IAAKA,CAACnI,EAAQE,MAAWqQ,GAAUvQ,EAAQE,IAAS6Q,EAAS5I,IAAInI,EAAQE,KD4BzDpJ,CAAS+W,UE9FhBmD,GACX1R,WAAAA,CAA6BmI,GAAA,KAASA,UAATA,EAG7BwJ,qBAAAA,GAIE,OAHkB/T,KAAKuK,UAAUoD,eAI9B7U,KAAI0U,IACH,GAmBR,SAAkCA,GAChC,MAAMhD,EAAYgD,EAAS5B,eAC3B,MAAsB,aAAf,OAAApB,QAAS,IAATA,OAAS,EAATA,EAAW5L,KACpB,CAtBYoV,CAAyBxG,GAAW,CACtC,MAAM3H,EAAU2H,EAAS/B,eACzB,MAAO,GAAG5F,EAAQoO,WAAWpO,EAAQqO,SACtC,CACC,OAAO,IACR,IAEF1X,QAAO2X,GAAaA,IACpB/S,KAAK,4CCxBCgT,GAAS,IAAItF,EAAO,4uBC+BpBzE,GAAqB,YAErBgK,GAAsB,CACjC,CAACC,IAAU,YACX,CAACC,IAAgB,mBACjB,CAACC,IAAgB,iBACjB,CAACC,IAAsB,wBACvB,CAACC,IAAe,iBAChB,CAACC,IAAqB,wBACtB,CAACC,IAAW,YACZ,CAACC,IAAiB,mBAClB,CAACC,IAAe,YAChB,CAACC,IAAkB,oBACnB,CAACC,IAAqB,mBACtB,CAACC,IAAgB,UACjB,CAACC,IAAsB,iBACvB,CAACC,IAAoB,WACrB,CAACC,IAA0B,kBAC3B,CAACC,IAAgB,WACjB,CAACC,IAAsB,kBACvB,CAACC,IAAkB,YACnB,CAACC,IAAwB,mBACzB,CAACC,IAAmB,UACpB,CAACC,IAAyB,iBAC1B,CAACC,IAAc,WACf,CAACC,IAAoB,kBACrB,CAACC,IAAgB,WACjB,CAACC,IAAsB,kBACvB,CAACC,IAAa,cACd,UAAW,UACX,CAAC3jB,IAAc,eCjDJ4jB,GAAQ,IAAItL,IAKZuL,GAAc,IAAIvL,IAQlBwL,GAAc,IAAIxL,IAOf,SAAAyL,GACdC,EACA5L,GAEA,IACG4L,EAAwB7L,UAAUgD,aAAa/C,EACjD,CAAC,MAAO9H,GACP0R,GAAO7E,MACL,aAAa/E,EAAUpY,4CAA4CgkB,EAAIhkB,OACvEsQ,EAEH,CACH,CAoBM,SAAU2T,GACd7L,GAEA,MAAM8L,EAAgB9L,EAAUpY,KAChC,GAAI8jB,GAAYjL,IAAIqL,GAKlB,OAJAlC,GAAO7E,MACL,sDAAsD+G,OAGjD,EAGTJ,GAAY/K,IAAImL,EAAe9L,GAG/B,IAAK,MAAM4L,KAAOJ,GAAM3J,SACtB8J,GAAcC,EAAwB5L,GAGxC,IAAK,MAAM+L,KAAaN,GAAY5J,SAClC8J,GAAcI,EAAoC/L,GAGpD,OAAO,CACT,CAWgB,SAAAgM,GACdJ,EACAhkB,GAEA,MAAMqkB,EAAuBL,EAAwB7L,UAClDkD,YAAY,aACZhC,aAAa,CAAEE,UAAU,IAI5B,OAHI8K,GACGA,EAAoBC,mBAEnBN,EAAwB7L,UAAUkD,YAAYrb,EACxD,CC7FA,MA2CaukB,GAAgB,IAAIhR,EAC/B,MACA,WA7CiC,CACjC,SACE,6EAEF,eAAyB,iCACzB,gBACE,kFACF,cAAwB,kDACxB,qBAA+B,uCAC/B,aACE,0EACF,uBACE,6EAEF,uBACE,wDACF,WACE,gFACF,UACE,qFACF,UACE,mFACF,aACE,sFACF,sCACE,0GACF,iCACE,oEClCSiR,GAcXxU,WAAAA,CACEsJ,EACAhX,EACA6V,GANQ,KAAUsM,YAAG,EAQrB7W,KAAK8W,SAAgBtgB,OAAAugB,OAAA,GAAArL,GACrB1L,KAAKgX,QAAexgB,OAAAugB,OAAA,GAAAriB,GACpBsL,KAAKiX,MAAQviB,EAAOtC,KACpB4N,KAAKkX,gCACHxiB,EAAOyiB,+BACTnX,KAAKoX,WAAa7M,EAClBvK,KAAKuK,UAAUgD,aACb,IAAI9D,EAAU,OAAO,IAAMzJ,MAAM,WAIrC,kCAAImX,GAEF,OADAnX,KAAKqX,iBACErX,KAAKkX,gCAGd,kCAAIC,CAA+BjI,GACjClP,KAAKqX,iBACLrX,KAAKkX,gCAAkChI,EAGzC,QAAI9c,GAEF,OADA4N,KAAKqX,iBACErX,KAAKiX,MAGd,WAAIvL,GAEF,OADA1L,KAAKqX,iBACErX,KAAK8W,SAGd,UAAIpiB,GAEF,OADAsL,KAAKqX,iBACErX,KAAKgX,QAGd,aAAIzM,GACF,OAAOvK,KAAKoX,WAGd,aAAIE,GACF,OAAOtX,KAAK6W,WAGd,aAAIS,CAAUpI,GACZlP,KAAK6W,WAAa3H,EAOVmI,cAAAA,GACR,GAAIrX,KAAKsX,UACP,MAAMX,GAAc/Q,OAAO,cAAsB,CAAE2R,QAASvX,KAAKiX,kBC8BvDO,GACdV,GACc,IAAdW,EAASxlB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAETyZ,EAAUoL,EAEd,GAAyB,kBAAdW,EAAwB,CAEjCA,EAAY,CAAErlB,KADDqlB,EAEd,CAED,MAAM/iB,EAAM8B,OAAAugB,OAAA,CACV3kB,KAAMiY,GACN8M,gCAAgC,GAC7BM,GAECrlB,EAAOsC,EAAOtC,KAEpB,GAAoB,kBAATA,IAAsBA,EAC/B,MAAMukB,GAAc/Q,OAA8B,gBAChD2R,QAAS7V,OAAOtP,KAMpB,GAFAsZ,IAAAA,EAAYnH,MAEPmH,EACH,MAAMiL,GAAc/Q,OAAO,cAG7B,MAAM8R,EAAc1B,GAAM9hB,IAAI9B,GAC9B,GAAIslB,EAAa,CAEf,GACEtQ,EAAUsE,EAASgM,EAAYhM,UAC/BtE,EAAU1S,EAAQgjB,EAAYhjB,QAE9B,OAAOgjB,EAEP,MAAMf,GAAc/Q,OAA+B,iBAAE2R,QAASnlB,GAEjE,CAED,MAAMmY,EAAY,IAAI8C,EAAmBjb,GACzC,IAAK,MAAMoY,KAAa0L,GAAY7J,SAClC9B,EAAUgD,aAAa/C,GAGzB,MAAMmN,EAAS,IAAIf,GAAgBlL,EAAShX,EAAQ6V,GAIpD,OAFAyL,GAAM7K,IAAI/Y,EAAMulB,GAETA,CACT,UA4NgBC,GACdC,EACA3D,EACA4D,SAIA,IAAI7D,EAAmD,QAAzCjQ,EAAAqQ,GAAoBwD,UAAqB,IAAA7T,EAAAA,EAAA6T,EACnDC,IACF7D,GAAW,IAAI6D,KAEjB,MAAMC,EAAkB9D,EAAQtQ,MAAM,SAChCqU,EAAkB9D,EAAQvQ,MAAM,SACtC,GAAIoU,GAAmBC,EAAiB,CACtC,MAAMC,EAAU,CACd,+BAA+BhE,oBAA0BC,OAgB3D,OAdI6D,GACFE,EAAQphB,KACN,iBAAiBod,sDAGjB8D,GAAmBC,GACrBC,EAAQphB,KAAK,OAEXmhB,GACFC,EAAQphB,KACN,iBAAiBqd,2DAGrBE,GAAOtE,KAAKmI,EAAQ7W,KAAK,KAE1B,CACDiV,GACE,IAAI5M,EACF,GAAGwK,aACH,KAAM,CAAGA,UAASC,aAAU,WAIlC,CCraA,MAEMgE,GAAa,2BASnB,IAAIC,GAAiD,KACrD,SAASC,KA2BP,OA1BKD,KACHA,GR5BJ,SAAgB/lB,EAAM8hB,GAA0D,IAAjD,QAAEmE,EAAO,QAAEC,EAAO,SAAEC,EAAQ,WAAEC,GAAYvmB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EACzE,MAAM4gB,EAAU4F,UAAUnjB,KAAKlD,EAAM8hB,GAC/BwE,EAAc1H,GAAK6B,GAoBzB,OAnBIyF,GACAzF,EAAQT,iBAAiB,iBAAkBuG,IACvCL,EAAQtH,GAAK6B,EAAQ7b,QAAS2hB,EAAMC,WAAYD,EAAME,WAAY7H,GAAK6B,EAAQzB,aAAcuH,EAAM,IAGvGN,GACAxF,EAAQT,iBAAiB,WAAYuG,GAAUN,EAE/CM,EAAMC,WAAYD,EAAME,WAAYF,KAExCD,EACK3F,MAAM+F,IACHN,GACAM,EAAG1G,iBAAiB,SAAS,IAAMoG,MACnCD,GACAO,EAAG1G,iBAAiB,iBAAkBuG,GAAUJ,EAASI,EAAMC,WAAYD,EAAME,WAAYF,IACjG,IAEC7T,OAAM,SACJ4T,CACX,CQKgBK,CAdA,8BACG,EAagC,CAC7CT,QAASA,CAACQ,EAAIF,KAMZ,GACO,IADCA,EAEJ,IACEE,EAAGE,kBAAkBd,GACtB,CAAC,MAAOxV,GAIPxN,QAAQ4a,KAAKpN,EACd,CACJ,IAEFoC,OAAMpC,IACP,MAAMiU,GAAc/Q,OAA0B,YAC5CqT,qBAAsBvW,EAAExD,SACxB,KAGCiZ,EACT,CAyBO/a,eAAe8b,GACpB9C,EACA+C,GAEA,IACE,MACMvH,SADWwG,MACHhH,YAAY8G,GAAY,aAChCnH,EAAca,EAAGb,YAAYmH,UAC7BnH,EAAYqI,IAAID,EAAiBE,GAAWjD,UAC5CxE,EAAGG,IACV,CAAC,MAAOrP,GACP,GAAIA,aAAa0C,EACfgP,GAAOtE,KAAKpN,EAAExD,aACT,CACL,MAAMoa,EAAc3C,GAAc/Q,OAA2B,WAC3DqT,qBAAkC,OAAXvW,QAAA,IAAAA,OAAA,EAAAA,EAAaxD,UAEtCkV,GAAOtE,KAAKwJ,EAAYpa,QACzB,CACF,CACH,CAEA,SAASma,GAAWjD,GAClB,MAAO,GAAGA,EAAIhkB,QAAQgkB,EAAI1K,QAAQ6N,OACpC,OCxEaC,GAyBXpX,WAAAA,CAA6BmI,GAAA,KAASA,UAATA,EAT7B,KAAgBkP,iBAAiC,KAU/C,MAAMrD,EAAMpW,KAAKuK,UAAUkD,YAAY,OAAOhC,eAC9CzL,KAAK0Z,SAAW,IAAIC,GAAqBvD,GACzCpW,KAAK4Z,wBAA0B5Z,KAAK0Z,SAASG,OAAO9G,MAAK/b,IACvDgJ,KAAKyZ,iBAAmBziB,EACjBA,KAWX,sBAAM0f,WACJ,IACE,MAMMoD,EANiB9Z,KAAKuK,UACzBkD,YAAY,mBACZhC,eAI0BsI,wBACvBgG,EAAOC,KACb,GAAyC,OAAd,QAAvBhW,EAAAhE,KAAKyZ,wBAAkB,IAAAzV,OAAA,EAAAA,EAAAiW,cACzBja,KAAKyZ,uBAAyBzZ,KAAK4Z,wBAEM,OAAd,QAAvB3V,EAAAjE,KAAKyZ,wBAAkB,IAAAxV,OAAA,EAAAA,EAAAgW,aACzB,OAKJ,GACEja,KAAKyZ,iBAAiBS,wBAA0BH,GAChD/Z,KAAKyZ,iBAAiBQ,WAAWxH,MAC/B0H,GAAuBA,EAAoBJ,OAASA,IAGtD,OAYF,OATE/Z,KAAKyZ,iBAAiBQ,WAAWpjB,KAAK,CAAEkjB,OAAMD,UAGhD9Z,KAAKyZ,iBAAiBQ,WACpBja,KAAKyZ,iBAAiBQ,WAAWzd,QAAO2d,IACtC,MAAMC,EAAc,IAAIlnB,KAAKinB,EAAoBJ,MAAMM,UAEvD,OADYnnB,KAAKub,MACJ2L,GA9EuB,MA8E6B,IAE9Dpa,KAAK0Z,SAASY,UAAUta,KAAKyZ,iBACrC,CAAC,MAAO/W,GACP0R,GAAOtE,KAAKpN,EACb,EAUH,yBAAM6X,SACJ,IAKE,GAJ8B,OAA1Bva,KAAKyZ,wBACDzZ,KAAK4Z,wBAI0B,OAAd,QAAvB5V,EAAAhE,KAAKyZ,wBAAkB,IAAAzV,OAAA,EAAAA,EAAAiW,aACqB,IAA5Cja,KAAKyZ,iBAAiBQ,WAAW/nB,OAEjC,MAAO,GAET,MAAM6nB,EAAOC,MAEP,iBAAEQ,EAAgB,cAAEC,YAmC9BC,GAC0B,IAA1BC,EAAO1oB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAjJgB,KAwJvB,MAAMuoB,EAA4C,GAElD,IAAIC,EAAgBC,EAAgB/jB,QACpC,IAAK,MAAMwjB,KAAuBO,EAAiB,CAEjD,MAAME,EAAiBJ,EAAiBK,MACtCC,GAAMA,EAAGhB,QAAUK,EAAoBL,QAEzC,GAAKc,GAgBH,GAHAA,EAAeG,MAAMlkB,KAAKsjB,EAAoBJ,MAG1CiB,GAAWR,GAAoBG,EAAS,CAC1CC,EAAeG,MAAME,MACrB,KACD,OAbD,GAJAT,EAAiB3jB,KAAK,CACpBijB,MAAOK,EAAoBL,MAC3BiB,MAAO,CAACZ,EAAoBJ,QAE1BiB,GAAWR,GAAoBG,EAAS,CAG1CH,EAAiBS,MACjB,KACD,CAYHR,EAAgBA,EAAc9jB,MAAM,EACrC,CACD,MAAO,CACL6jB,mBACAC,gBAEJ,CAhFkDS,CAC1Clb,KAAKyZ,iBAAiBQ,YAElBkB,EAAe5Y,EACnB9G,KAAKC,UAAU,CAAEwY,QAAS,EAAG+F,WAAYO,KAgB3C,OAbAxa,KAAKyZ,iBAAiBS,sBAAwBH,EAC1CU,EAAcvoB,OAAS,GAEzB8N,KAAKyZ,iBAAiBQ,WAAaQ,QAI7Bza,KAAK0Z,SAASY,UAAUta,KAAKyZ,oBAEnCzZ,KAAKyZ,iBAAiBQ,WAAa,GAE9Bja,KAAK0Z,SAASY,UAAUta,KAAKyZ,mBAE7B0B,CACR,CAAC,MAAOzY,GAEP,OADA0R,GAAOtE,KAAKpN,GACL,EACR,GAIL,SAASsX,KAGP,OAFc,IAAI9mB,MAELwb,cAAc7b,UAAU,EAAG,GAC1C,OAkDa8mB,GAEXvX,WAAAA,CAAmBgU,GAAA,KAAGA,IAAHA,EACjBpW,KAAKob,wBAA0Bpb,KAAKqb,+BAEtC,kCAAMA,GACJ,mBxBtDF,IACE,MAA4B,kBAAd5C,SACf,CAAC,MAAO/V,GACP,OAAO,CACR,CACH,CwBiDS4Y,IxBvCA,IAAI1W,SAAQ,CAACF,EAASD,KAC3B,IACE,IAAI8W,GAAoB,EACxB,MAAMC,EACJ,0DACI3I,EAAU1P,KAAKsV,UAAUnjB,KAAKkmB,GACpC3I,EAAQ4I,UAAY,KAClB5I,EAAQ7b,OAAO0kB,QAEVH,GACHpY,KAAKsV,UAAUkD,eAAeH,GAEhC9W,GAAQ,EAAK,EAEfmO,EAAQ+I,gBAAkB,KACxBL,GAAW,CAAK,EAGlB1I,EAAQgJ,QAAU,WAChBpX,GAAoB,QAAbT,EAAA6O,EAAQlQ,aAAK,IAAAqB,OAAA,EAAAA,EAAE9E,UAAW,GAAG,CAEvC,CAAC,MAAOyD,IACP8B,EAAO9B,GACR,KwBoBIoQ,MAAK,KAAM,IACXjO,OAAM,KAAM,IAMnB,UAAM+U,GAEJ,SAD8B7Z,KAAKob,wBAG5B,CACL,MAAMU,QDxLL1e,eACLgZ,GAEA,IACE,MACMxE,SADWwG,MACHhH,YAAY8G,IACpBlhB,QAAe4a,EAAGb,YAAYmH,IAAYhkB,IAAImlB,GAAWjD,IAI/D,aADMxE,EAAGG,KACF/a,CACR,CAAC,MAAO0L,GACP,GAAIA,aAAa0C,EACfgP,GAAOtE,KAAKpN,EAAExD,aACT,CACL,MAAMoa,EAAc3C,GAAc/Q,OAAyB,WACzDqT,qBAAkC,OAAXvW,QAAA,IAAAA,OAAA,EAAAA,EAAaxD,UAEtCkV,GAAOtE,KAAKwJ,EAAYpa,QACzB,CACF,CACH,CCmKuC6c,CAA4B/b,KAAKoW,KAClE,OAAI,OAAA0F,QAAkB,IAAlBA,OAAkB,EAAlBA,EAAoB7B,YACf6B,EAEA,CAAE7B,WAAY,GAExB,CARC,MAAO,CAAEA,WAAY,IAWzB,eAAMK,CAAU0B,SAEd,SAD8Bhc,KAAKob,wBAG5B,CACL,MAAMa,QAAiCjc,KAAK6Z,OAC5C,OAAOX,GAA2BlZ,KAAKoW,IAAK,CAC1C8D,sBAEE,QADAlW,EAAAgY,EAAiB9B,6BACjB,IAAAlW,EAAAA,EAAAiY,EAAyB/B,sBAC3BD,WAAY+B,EAAiB/B,YAEhC,EAGH,SAAMjN,CAAIgP,SAER,SAD8Bhc,KAAKob,wBAG5B,CACL,MAAMa,QAAiCjc,KAAK6Z,OAC5C,OAAOX,GAA2BlZ,KAAKoW,IAAK,CAC1C8D,sBAEE,QADAlW,EAAAgY,EAAiB9B,6BACjB,IAAAlW,EAAAA,EAAAiY,EAAyB/B,sBAC3BD,WAAY,IACPgC,EAAyBhC,cACzB+B,EAAiB/B,aAGzB,GASC,SAAUe,GAAWN,GAEzB,OAAOnY,EAEL9G,KAAKC,UAAU,CAAEwY,QAAS,EAAG+F,WAAYS,KACzCxoB,MACJ,CCxRM,IAAiC4lB,MCMhB,GDLrBzB,GACE,IAAI5M,EACF,mBACAc,GAAa,IAAIuJ,GAA0BvJ,IAAU,YAIzD8L,GACE,IAAI5M,EACF,aACAc,GAAa,IAAIiP,GAAqBjP,IAAU,YAMpDqN,GAAgBtD,GAAM4H,GAASpE,IAE/BF,GAAgBtD,GAAM4H,GAAS,WAE/BtE,GAAgB,UAAW,IE1B7BA,wBAA+B,gDCDxB,IAAIuE,GAAc,GAMnB,SAAUC,GAAclI,GAC5BiI,GAAcjI,CAChB,OCEamI,GAOXja,WAAAA,CAAoBka,GAAA,KAAWA,YAAXA,EALZ,KAAOC,QAAG,YAWlBpR,GAAAA,CAAIhU,EAAawH,GACF,MAATA,EACFqB,KAAKsc,YAAYE,WAAWxc,KAAKyc,cAActlB,IAE/C6I,KAAKsc,YAAY/gB,QAAQyE,KAAKyc,cAActlB,GAAMuE,EAAUiD,IAOhEzK,GAAAA,CAAIiD,GACF,MAAMulB,EAAY1c,KAAKsc,YAAY5iB,QAAQsG,KAAKyc,cAActlB,IAC9D,OAAiB,MAAbulB,EACK,KAEApW,EAASoW,GAIpBC,MAAAA,CAAOxlB,GACL6I,KAAKsc,YAAYE,WAAWxc,KAAKyc,cAActlB,IAKjDslB,aAAAA,CAAcrqB,GACZ,OAAO4N,KAAKuc,QAAUnqB,EAGxBwqB,QAAAA,GACE,OAAO5c,KAAKsc,YAAYM,kBCjDfC,GAAbza,WAAAA,GACU,KAAM0a,OAA6B,CAAC,EAqB5C,KAAiBC,mBAAG,EAnBpB5R,GAAAA,CAAIhU,EAAawH,GACF,MAATA,SACKqB,KAAK8c,OAAO3lB,GAEnB6I,KAAK8c,OAAO3lB,GAAOwH,EAIvBzK,GAAAA,CAAIiD,GACF,OAAI0P,EAAS7G,KAAK8c,OAAQ3lB,GACjB6I,KAAK8c,OAAO3lB,GAEd,KAGTwlB,MAAAA,CAAOxlB,UACE6I,KAAK8c,OAAO3lB,ICXvB,MAAM6lB,GAAmB,SACvBC,GAEA,IAGE,GACoB,qBAAXlpB,QAC2B,qBAA3BA,OAAOkpB,GACd,CAEA,MAAMC,EAAanpB,OAAOkpB,GAG1B,OAFAC,EAAW3hB,QAAQ,oBAAqB,SACxC2hB,EAAWV,WAAW,qBACf,IAAIH,GAAkBa,EAC9B,CACF,CAAC,MAAOxa,GAAI,CAIb,OAAO,IAAIma,EACb,EAGaM,GAAoBH,GAAiB,gBAGrCI,GAAiBJ,GAAiB,kBCxBzCK,GAAY,IAAIvO,EAAO,sBAKhBwO,GAA+B,WAC1C,IAAIC,EAAK,EACT,OAAO,WACL,OAAOA,GACT,CACF,CAL4C,GAY/BC,GAAO,SAAUzmB,GAC5B,MAAMuL,EzBlByB,SAAUvL,GACzC,MAAMuI,EAAgB,GACtB,IAAIC,EAAI,EACR,IAAK,IAAI7M,EAAI,EAAGA,EAAIqE,EAAI7E,OAAQQ,IAAK,CACnC,IAAIC,EAAIoE,EAAIyI,WAAW9M,GAGvB,GAAIC,GAAK,OAAUA,GAAK,MAAQ,CAC9B,MAAM8qB,EAAO9qB,EAAI,MACjBD,IACAsM,EAAOtM,EAAIqE,EAAI7E,OAAQ,2CAEvBS,EAAI,OAAW8qB,GAAQ,KADX1mB,EAAIyI,WAAW9M,GAAK,MAEjC,CAEGC,EAAI,IACN2M,EAAIC,KAAO5M,EACFA,EAAI,MACb2M,EAAIC,KAAQ5M,GAAK,EAAK,IACtB2M,EAAIC,KAAY,GAAJ5M,EAAU,KACbA,EAAI,OACb2M,EAAIC,KAAQ5M,GAAK,GAAM,IACvB2M,EAAIC,KAAS5M,GAAK,EAAK,GAAM,IAC7B2M,EAAIC,KAAY,GAAJ5M,EAAU,MAEtB2M,EAAIC,KAAQ5M,GAAK,GAAM,IACvB2M,EAAIC,KAAS5M,GAAK,GAAM,GAAM,IAC9B2M,EAAIC,KAAS5M,GAAK,EAAK,GAAM,IAC7B2M,EAAIC,KAAY,GAAJ5M,EAAU,IAEzB,CACD,OAAO2M,CACT,CyBdoBoe,CAAkB3mB,GAC9BymB,EAAO,IAAI3V,EACjB2V,EAAK5U,OAAOtG,GACZ,MAAMqb,EAAYH,EAAKxU,SACvB,OAAOvJ,EAAOU,gBAAgBwd,EAChC,EAEMC,GAAmB,WACvB,IAAI1e,EAAU,GACd,IAAK,IAAIxM,EAAI,EAAGA,EAAIT,UAAQC,OAAQQ,IAAK,CACvC,MAAMmrB,EAAcnrB,EAAC,GAAAT,UAAAC,QAADQ,OAACP,EAAAF,UAADS,GAElB4N,MAAMC,QAAQsd,IACbA,GACgB,kBAARA,GAEwB,kBAAvBA,EAAY3rB,OAEtBgN,GAAW0e,GAAiBnM,MAAM,KAAMoM,GAExC3e,GADwB,kBAAR2e,EACLniB,EAAUmiB,GAEVA,EAEb3e,GAAW,GACZ,CAED,OAAOA,CACT,EAKO,IAAIkV,GAAuC,KAK9C0J,IAAY,EAOT,MAAMC,GAAgB,SAC3BC,EACAC,GAEAjf,GACGif,IAA0B,IAAZD,IAAgC,IAAZA,EACnC,+CAEc,IAAZA,GACFX,GAAU7O,SAAWZ,EAASG,QAC9BqG,GAASiJ,GAAUloB,IAAI+oB,KAAKb,IACxBY,GACFb,GAAejS,IAAI,mBAAmB,IAEZ,oBAAZ6S,EAChB5J,GAAS4J,GAET5J,GAAS,KACTgJ,GAAeT,OAAO,mBAE1B,EAEaxnB,GAAM,WAQjB,IAPkB,IAAd2oB,KACFA,IAAY,EACG,OAAX1J,KAA6D,IAA1CgJ,GAAelpB,IAAI,oBACxC6pB,IAAc,IAId3J,GAAQ,SAAAzF,EAAA1c,UAAAC,OARkBisB,EAAkB,IAAA7d,MAAAqO,GAAAc,EAAA,EAAAA,EAAAd,EAAAc,IAAlB0O,EAAkB1O,GAAAxd,UAAAwd,GAS9C,MAAMvQ,EAAU0e,GAAiBnM,MAAM,KAAM0M,GAC7C/J,GAAOlV,EACR,CACH,EAEakf,GAAa,SACxBC,GAEA,OAAO,WAA+B,QAAA7O,EAAAvd,UAAAC,OAAlBisB,EAAkB,IAAA7d,MAAAkP,GAAAG,EAAA,EAAAA,EAAAH,EAAAG,IAAlBwO,EAAkBxO,GAAA1d,UAAA0d,GACpCxa,GAAIkpB,KAAWF,EACjB,CACF,EAEaxb,GAAQ,WACnB,MAAMzD,EAAU,4BAA8B0e,MAAiB3rB,WAC/DorB,GAAU1a,MAAMzD,EAClB,EAEaof,GAAQ,WACnB,MAAMpf,EAAU,yBAAyB0e,MAAiB3rB,aAE1D,MADAorB,GAAU1a,MAAMzD,GACV,IAAIE,MAAMF,EAClB,EAEa4Q,GAAO,WAClB,MAAM5Q,EAAU,qBAAuB0e,MAAiB3rB,WACxDorB,GAAUvN,KAAK5Q,EACjB,EAgCaqf,GAAsB,SAAUrY,GAC3C,MACkB,kBAATA,IACNA,IAASA,GACRA,IAASsY,OAAOC,mBAChBvY,IAASsY,OAAOE,kBAEtB,EAiDaC,GAAW,aAKXC,GAAW,aAKXC,GAAc,SAAU3mB,EAAWC,GAC9C,GAAID,IAAMC,EACR,OAAO,EACF,GAAID,IAAMymB,IAAYxmB,IAAMymB,GACjC,OAAQ,EACH,GAAIzmB,IAAMwmB,IAAYzmB,IAAM0mB,GACjC,OAAO,EACF,CACL,MAAME,EAASC,GAAY7mB,GACzB8mB,EAASD,GAAY5mB,GAEvB,OAAe,OAAX2mB,EACa,OAAXE,EACKF,EAASE,IAAW,EAAI9mB,EAAEhG,OAASiG,EAAEjG,OAAS4sB,EAASE,GAEtD,EAEU,OAAXA,EACF,EAEA9mB,EAAIC,GAAK,EAAI,CAEvB,CACH,EAKa8mB,GAAgB,SAAU/mB,EAAWC,GAChD,OAAID,IAAMC,EACD,EACED,EAAIC,GACL,EAED,CAEX,EAEa+mB,GAAa,SACxB/nB,EACAgG,GAEA,GAAIA,GAAOhG,KAAOgG,EAChB,OAAOA,EAAIhG,GAEX,MAAM,IAAIiI,MACR,yBAA2BjI,EAAM,gBAAkBuE,EAAUyB,GAGnE,EAEagiB,GAAoB,SAAUhiB,GACzC,GAAmB,kBAARA,GAA4B,OAARA,EAC7B,OAAOzB,EAAUyB,GAGnB,MAAM1G,EAAO,GAEb,IAAK,MAAM8Q,KAAKpK,EACd1G,EAAKI,KAAK0Q,GAIZ9Q,EAAKob,OACL,IAAI1a,EAAM,IACV,IAAK,IAAIzE,EAAI,EAAGA,EAAI+D,EAAKvE,OAAQQ,IACrB,IAANA,IACFyE,GAAO,KAETA,GAAOuE,EAAUjF,EAAK/D,IACtByE,GAAO,IACPA,GAAOgoB,GAAkBhiB,EAAI1G,EAAK/D,KAIpC,OADAyE,GAAO,IACAA,CACT,EAQaioB,GAAoB,SAC/BroB,EACAsoB,GAEA,MAAMC,EAAMvoB,EAAI7E,OAEhB,GAAIotB,GAAOD,EACT,MAAO,CAACtoB,GAGV,MAAMwoB,EAAW,GACjB,IAAK,IAAI5sB,EAAI,EAAGA,EAAI2sB,EAAK3sB,GAAK0sB,EACxB1sB,EAAI0sB,EAAUC,EAChBC,EAAS1oB,KAAKE,EAAIlE,UAAUF,EAAG2sB,IAE/BC,EAAS1oB,KAAKE,EAAIlE,UAAUF,EAAGA,EAAI0sB,IAGvC,OAAOE,CACT,EAQgB,SAAAC,GAAKriB,EAAa8J,GAChC,IAAK,MAAM9P,KAAOgG,EACZA,EAAI8F,eAAe9L,IACrB8P,EAAG9P,EAAKgG,EAAIhG,GAGlB,CAsBO,MAAMsoB,GAAwB,SAAUC,GAC7C1gB,GAAQuf,GAAoBmB,GAAI,uBAEhC,MAEMC,EAAO,KACb,IAAIC,EAAGld,EAAGiG,EAAGkX,EAAIntB,EAIP,IAANgtB,GACFhd,EAAI,EACJiG,EAAI,EACJiX,EAAI,EAAIF,KAAOI,IAAW,EAAI,IAE9BF,EAAIF,EAAI,GACRA,EAAIK,KAAKC,IAAIN,KAEJK,KAAKE,IAAI,GAAG,OAEnBJ,EAAKE,KAAKG,IAAIH,KAAKI,MAAMJ,KAAK5qB,IAAIuqB,GAAKK,KAAKK,KAAMT,GAClDjd,EAAImd,EAAKF,EACThX,EAAIoX,KAAKM,MAAMX,EAAIK,KAAKE,IAAI,EAlBtB,GAkBiCJ,GAAME,KAAKE,IAAI,EAlBhD,OAqBNvd,EAAI,EACJiG,EAAIoX,KAAKM,MAAMX,EAAIK,KAAKE,IAAI,GAAG,SAKnC,MAAMK,EAAO,GACb,IAAK5tB,EA5BK,GA4BMA,EAAGA,GAAK,EACtB4tB,EAAKzpB,KAAK8R,EAAI,EAAI,EAAI,GACtBA,EAAIoX,KAAKI,MAAMxX,EAAI,GAErB,IAAKjW,EAjCS,GAiCEA,EAAGA,GAAK,EACtB4tB,EAAKzpB,KAAK6L,EAAI,EAAI,EAAI,GACtBA,EAAIqd,KAAKI,MAAMzd,EAAI,GAErB4d,EAAKzpB,KAAK+oB,EAAI,EAAI,GAClBU,EAAKC,UACL,MAAMxpB,EAAMupB,EAAKlf,KAAK,IAGtB,IAAIof,EAAgB,GACpB,IAAK9tB,EAAI,EAAGA,EAAI,GAAIA,GAAK,EAAG,CAC1B,IAAI+tB,EAAUxjB,SAASlG,EAAI/C,OAAOtB,EAAG,GAAI,GAAGkqB,SAAS,IAC9B,IAAnB6D,EAAQvuB,SACVuuB,EAAU,IAAMA,GAElBD,GAAgCC,CACjC,CACD,OAAOD,EAAcE,aACvB,EAiDO,MAAMC,GAAkB,IAAIC,OAAO,qBAe7B7B,GAAc,SAAUhoB,GACnC,GAAI4pB,GAAgBzb,KAAKnO,GAAM,CAC7B,MAAM8pB,EAASrC,OAAOznB,GACtB,GAAI8pB,IAbsB,YAaMA,GARN,WASxB,OAAOA,CAEV,CACD,OAAO,IACT,EAmBaC,GAAiB,SAAU7Z,GACtC,IACEA,GACD,CAAC,MAAOvE,GAEP5I,YAAW,KAKT,MAAMinB,EAAQre,EAAEqe,OAAS,GAEzB,MADAjR,GAAK,yCAA0CiR,GACzCre,CAAC,GACNqd,KAAKI,MAAM,GACf,CACH,EA+Daa,GAAwB,SACnC/Z,EACAga,GAEA,MAAMC,EAA2BpnB,WAAWmN,EAAIga,GAiBhD,MAdqB,kBAAZC,GAES,qBAATC,MAEPA,KAAiB,WAGjBA,KAAKC,WAAWF,GAEY,kBAAZA,GAAyBA,EAAuB,OAE/DA,EAAuB,QAGnBA,CACT,QC/lBaG,GAEXjf,WAAAA,CACUkf,EACAC,GADA,KAAQD,SAARA,EACA,KAAgBC,iBAAhBA,EAERvhB,KAAKwhB,SAA2B,OAAhBD,QAAA,IAAAA,OAAA,EAAAA,EAAkB9V,aAAa,CAAEE,UAAU,IACtD3L,KAAKwhB,UACQ,OAAhBD,QAAA,IAAAA,GAAAA,EAAkBrtB,MAAM6e,MAAKyO,GAAaxhB,KAAKwhB,SAAWA,IAI9DC,QAAAA,CAASC,GACP,OAAK1hB,KAAKwhB,SAeHxhB,KAAKwhB,SAASC,SAASC,GAdrB,IAAI9c,SAA6B,CAACF,EAASD,KAKhD3K,YAAW,KACLkG,KAAKwhB,SACPxhB,KAAKyhB,SAASC,GAAc3O,KAAKrO,EAASD,GAE1CC,EAAQ,KACT,GACA,EAAE,IAMXid,sBAAAA,CAAuBC,SACA,QAArB5d,EAAAhE,KAAKuhB,wBAAgB,IAAAvd,GAAAA,EACjB9P,MACD6e,MAAKyO,GAAYA,EAASK,iBAAiBD,KAGhDE,qBAAAA,GACEhS,GACE,oDAAoD9P,KAAKshB,gGCjClDS,GAGX3f,WAAAA,CACUkf,EACAU,EACAC,GAFA,KAAQX,SAARA,EACA,KAAgBU,iBAAhBA,EACA,KAAaC,cAAbA,EALF,KAAKC,MAAgC,KAO3CliB,KAAKkiB,MAAQD,EAAcxW,aAAa,CAAEE,UAAU,IAC/C3L,KAAKkiB,OACRD,EAAcpV,QAAOsV,GAASniB,KAAKkiB,MAAQC,IAI/CV,QAAAA,CAASC,GACP,OAAK1hB,KAAKkiB,MAgBHliB,KAAKkiB,MAAMT,SAASC,GAAc5c,OAAMnC,GAGzCA,GAAwB,+BAAfA,EAAM0C,MACjBlQ,GAAI,kEACG,MAEAyP,QAAQH,OAAO9B,KAtBjB,IAAIiC,SAA+B,CAACF,EAASD,KAKlD3K,YAAW,KACLkG,KAAKkiB,MACPliB,KAAKyhB,SAASC,GAAc3O,KAAKrO,EAASD,GAE1CC,EAAQ,KACT,GACA,EAAE,IAgBXid,sBAAAA,CAAuBC,GAGjB5hB,KAAKkiB,MACPliB,KAAKkiB,MAAME,qBAAqBR,GAEhC5hB,KAAKiiB,cACF/tB,MACA6e,MAAKoP,GAAQA,EAAKC,qBAAqBR,KAI9CS,yBAAAA,CAA0BT,GACxB5hB,KAAKiiB,cACF/tB,MACA6e,MAAKoP,GAAQA,EAAKG,wBAAwBV,KAG/CE,qBAAAA,GACE,IAAIS,EACF,0DACAviB,KAAKshB,SADL,iFAIE,eAAgBthB,KAAKgiB,iBACvBO,GACE,uJAGO,mBAAoBviB,KAAKgiB,iBAClCO,GACE,2JAIFA,GACE,kKAIJzS,GAAKyS,UAKIC,GAIXpgB,WAAAA,CAAoBqgB,GAAA,KAAWA,YAAXA,EAEpBhB,QAAAA,CAASC,GACP,OAAO9c,QAAQF,QAAQ,CACrB+d,YAAaziB,KAAKyiB,cAItBd,sBAAAA,CAAuBC,GAGrBA,EAAS5hB,KAAKyiB,aAGhBJ,yBAAAA,CAA0BT,GAAwC,CAElEE,qBAAAA,GAAqB,EAlBdU,GAAKE,MAAG,QC7GV,MAAMC,GAAmB,IAYnBC,GACX,6EAMWC,GAAwB,KAExBC,GAAY,YAEZC,GAAe,qBCbfC,GAaX5gB,WAAAA,CACEhI,EACgB6oB,EACAC,EACAC,GAIgC,IAHhCC,EAAAnxB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GACAoxB,EAAApxB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAyB,GACzBqxB,EAAArxB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GACAsxB,EAAAtxB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GANA,KAAMgxB,OAANA,EACA,KAASC,UAATA,EACA,KAAaC,cAAbA,EACA,KAASC,UAATA,EACA,KAAcC,eAAdA,EACA,KAA6BC,8BAA7BA,EACA,KAAeC,gBAAfA,EAEhBvjB,KAAKwjB,MAAQppB,EAAKsmB,cAClB1gB,KAAKyjB,QAAUzjB,KAAKwjB,MAAMxvB,OAAOgM,KAAKwjB,MAAM1wB,QAAQ,KAAO,GAC3DkN,KAAK0jB,aACFvG,GAAkBjpB,IAAI,QAAUkG,IAAoB4F,KAAKwjB,MAG9DG,eAAAA,GACE,MAA0C,OAAnC3jB,KAAK0jB,aAAa1vB,OAAO,EAAG,GAGrC4vB,YAAAA,GACE,MACmB,mBAAjB5jB,KAAKyjB,SACY,wBAAjBzjB,KAAKyjB,QAIT,QAAIrpB,GACF,OAAO4F,KAAKwjB,MAGd,QAAIppB,CAAKypB,GACHA,IAAY7jB,KAAK0jB,eACnB1jB,KAAK0jB,aAAeG,EAChB7jB,KAAK2jB,mBACPxG,GAAkBhS,IAAI,QAAUnL,KAAKwjB,MAAOxjB,KAAK0jB,eAKvD9G,QAAAA,GACE,IAAI7lB,EAAMiJ,KAAK8jB,cAIf,OAHI9jB,KAAKqjB,iBACPtsB,GAAO,IAAMiJ,KAAKqjB,eAAiB,KAE9BtsB,EAGT+sB,WAAAA,GACE,MAAMruB,EAAWuK,KAAKijB,OAAS,WAAa,UACtCc,EAAQ/jB,KAAKsjB,8BACf,OAAOtjB,KAAKkjB,YACZ,GACJ,MAAO,GAAGztB,IAAWuK,KAAK5F,QAAQ2pB,cAmBtBC,GACdC,EACArlB,EACAslB,GAKA,IAAIC,EACJ,GAJAnlB,EAAuB,kBAATJ,EAAmB,8BACjCI,EAAyB,kBAAXklB,EAAqB,gCAG/BtlB,IAASkkB,GACXqB,GACGF,EAAShB,OAAS,SAAW,SAAWgB,EAASP,aAAe,YAC9D,IAAI9kB,IAASmkB,GAMlB,MAAM,IAAI3jB,MAAM,4BAA8BR,GAL9CulB,GACGF,EAAShB,OAAS,WAAa,WAChCgB,EAASP,aACT,OAGH,EAlCH,SAAiCO,GAC/B,OACEA,EAAS7pB,OAAS6pB,EAASP,cAC3BO,EAASL,gBACTK,EAASX,6BAEb,EA6BMc,CAAwBH,KAC1BC,EAAW,GAAID,EAASf,WAG1B,MAAMmB,EAAkB,GAMxB,OAJA7E,GAAK0E,GAAQ,CAAC/sB,EAAawH,KACzB0lB,EAAMxtB,KAAKM,EAAM,IAAMwH,EAAM,IAGxBwlB,EAAUE,EAAMjjB,KAAK,IAC9B,OCzHakjB,GAAbliB,WAAAA,GACU,KAASmiB,UAA4B,CAAC,EAE9CC,gBAAAA,CAAiBpyB,GAAgC,IAAlBqyB,EAAAxyB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAiB,EACzC4U,EAAS7G,KAAKukB,UAAWnyB,KAC5B4N,KAAKukB,UAAUnyB,GAAQ,GAGzB4N,KAAKukB,UAAUnyB,IAASqyB,EAG1BvwB,GAAAA,GACE,OAAO0O,EAAS5C,KAAKukB,YCbzB,MAAMG,GAAgD,CAAC,EACjDC,GAAsC,CAAC,EAEvC,SAAUC,GAA0BX,GACxC,MAAMY,EAAaZ,EAASrH,WAM5B,OAJK8H,GAAYG,KACfH,GAAYG,GAAc,IAAIP,IAGzBI,GAAYG,EACrB,OCTaC,GASX1iB,WAAAA,CAAoB2iB,GAAA,KAAUA,WAAVA,EARpB,KAAgBC,iBAAc,GAC9B,KAAkBC,mBAAG,EACrB,KAAkBC,oBAAI,EACtB,KAAOC,QAAwB,KAO/BC,UAAAA,CAAWC,EAAqBzrB,GAC9BoG,KAAKklB,mBAAqBG,EAC1BrlB,KAAKmlB,QAAUvrB,EACXoG,KAAKklB,mBAAqBllB,KAAKilB,qBACjCjlB,KAAKmlB,UACLnlB,KAAKmlB,QAAU,MASnBG,cAAAA,CAAeC,EAAoBrf,GAEjC,IADAlG,KAAKglB,iBAAiBO,GAAcrf,EAC7BlG,KAAKglB,iBAAiBhlB,KAAKilB,qBAAqB,CACrD,MAAMO,EAAYxlB,KAAKglB,iBACrBhlB,KAAKilB,2BAEAjlB,KAAKglB,iBAAiBhlB,KAAKilB,oBAClC,IAAK,IAAIvyB,EAAI,EAAGA,EAAI8yB,EAAUtzB,SAAUQ,EAClC8yB,EAAU9yB,IACZouB,IAAe,KACb9gB,KAAK+kB,WAAWS,EAAU9yB,GAAG,IAInC,GAAIsN,KAAKilB,qBAAuBjlB,KAAKklB,mBAAoB,CACnDllB,KAAKmlB,UACPnlB,KAAKmlB,UACLnlB,KAAKmlB,QAAU,MAEjB,KACD,CACDnlB,KAAKilB,oBACN,GCtBE,MAAMQ,GAAgC,cAoChCC,GA4BXtjB,WAAAA,CACSujB,EACA1B,EACC2B,EACAC,EACAC,EACDC,EACAC,GANA,KAAML,OAANA,EACA,KAAQ1B,SAARA,EACC,KAAa2B,cAAbA,EACA,KAAaC,cAAbA,EACA,KAASC,UAATA,EACD,KAAkBC,mBAAlBA,EACA,KAAaC,cAAbA,EAlCT,KAASC,UAAG,EACZ,KAAaC,cAAG,EAUR,KAAcC,gBAAG,EAyBvBnmB,KAAKomB,KAAOhI,GAAWuH,GACvB3lB,KAAKqmB,OAASzB,GAA0BX,GACxCjkB,KAAKsmB,MAASpC,IAERlkB,KAAK6lB,gBACP3B,EAAOrB,IAAyB7iB,KAAK6lB,eAEhC7B,GAAsBC,EAAUlB,GAAcmB,IAQzD5uB,IAAAA,CAAKixB,EAA8BC,GAAmC,IAAAC,EAAA,KACpEzmB,KAAK0mB,cAAgB,EACrB1mB,KAAK2mB,cAAgBH,EACrBxmB,KAAK4mB,gBAAkB,IAAI9B,GAAeyB,GAC1CvmB,KAAK6mB,WAAY,EAEjB7mB,KAAK8mB,qBAAuBhtB,YAAW,KACrCkG,KAAKomB,KAAK,gCAEVpmB,KAAK+mB,YACL/mB,KAAK8mB,qBAAuB,IAAI,GAE/B/G,KAAKI,MArEe,MRqHQ,SAAUlZ,GAC3C,GAAI9B,KAAuC,aAAxB5S,SAASy0B,WAC1B/f,QACK,CAIL,IAAIggB,GAAS,EACb,MAAMC,EAAY,WACX30B,SAAS4L,KAKT8oB,IACHA,GAAS,EACThgB,KANAnN,WAAWotB,EAAWnH,KAAKI,MAAM,IAQrC,EAEI5tB,SAAS6f,kBACX7f,SAAS6f,iBAAiB,mBAAoB8U,GAAW,GAEzDnzB,OAAOqe,iBAAiB,OAAQ8U,GAAW,IAEjC30B,SAAiB40B,cAG1B50B,SAAiB40B,YAAY,sBAAsB,KACtB,aAAxB50B,SAASy0B,YACXE,GACD,IAIFnzB,OAAeozB,YAAY,SAAUD,GAMzC,CACH,CQvFIE,EAAoB,KAClB,GAAIpnB,KAAK6mB,UACP,OAIF7mB,KAAKqnB,gBAAkB,IAAIC,IACzB,WAAY,QAAA5X,EAAAzd,UAAAC,OAAR0c,EAAI,IAAAtO,MAAAoP,GAAAG,EAAA,EAAAA,EAAAH,EAAAG,IAAJjB,EAAIiB,GAAA5d,UAAA4d,GACN,MAAO0X,EAASC,EAAMC,EAAMC,EAAMC,GAAQ/Y,EAE1C,GADA6X,EAAKmB,wBAAwBhZ,GACxB6X,EAAKY,gBASV,GALIZ,EAAKK,uBACPe,aAAapB,EAAKK,sBAClBL,EAAKK,qBAAuB,MAE9BL,EAAKN,gBAAiB,EAClBoB,IAAY9B,GACdgB,EAAKlJ,GAAKiK,EACVf,EAAKqB,SAAWL,MACX,IA5H8B,UA4H1BF,EAgBT,MAAM,IAAInoB,MAAM,kCAAoCmoB,GAdhDC,GAGFf,EAAKY,gBAAgBU,cAAe,EAIpCtB,EAAKG,gBAAgBxB,WAAWoC,GAAgB,KAC9Cf,EAAKM,WAAW,KAGlBN,EAAKM,WAIR,CACH,IACA,WAAY,QAAAnX,EAAA3d,UAAAC,OAAR0c,EAAI,IAAAtO,MAAAsP,GAAAI,EAAA,EAAAA,EAAAJ,EAAAI,IAAJpB,EAAIoB,GAAA/d,UAAA+d,GACN,MAAOgY,EAAI9hB,GAAQ0I,EACnB6X,EAAKmB,wBAAwBhZ,GAC7B6X,EAAKG,gBAAgBtB,eAAe0C,EAAc9hB,MAEpD,KACElG,KAAK+mB,WAAW,GAElB/mB,KAAKsmB,OAKP,MAAM2B,EAA8C,CAAC,EACrDA,EAAUxC,IAAiC,IAC3CwC,EAAwC,IAAIlI,KAAKI,MAC/B,IAAhBJ,KAAKmI,UAEHloB,KAAKqnB,gBAAgBc,2BACvBF,EAA6C,GAC3CjoB,KAAKqnB,gBAAgBc,0BAEzBF,EAAuB,EAAItF,GACvB3iB,KAAK+lB,qBACPkC,EAAiC,EAAIjoB,KAAK+lB,oBAExC/lB,KAAKgmB,gBACPiC,EAA4B,GAAIjoB,KAAKgmB,eAEnChmB,KAAK4lB,gBACPqC,EAA8B,EAAIjoB,KAAK4lB,eAErC5lB,KAAK6lB,gBACPoC,EAAUpF,IAAyB7iB,KAAK6lB,eAGpB,qBAAbpyB,UACPA,SAASiC,UACTktB,GAAgB1d,KAAKzR,SAASiC,YAE9BuyB,EAAuB,EL/MN,KKiNnB,MAAMG,EAAapoB,KAAKsmB,MAAM2B,GAC9BjoB,KAAKomB,KAAK,+BAAiCgC,GAC3CpoB,KAAKqnB,gBAAgBgB,OAAOD,GAAY,QAEtC,IAONE,KAAAA,GACEtoB,KAAKqnB,gBAAgBkB,cAAcvoB,KAAKud,GAAIvd,KAAK8nB,UACjD9nB,KAAKwoB,uBAAuBxoB,KAAKud,GAAIvd,KAAK8nB,UAQ5C,iBAAOW,GACL/C,GAAsBgD,aAAc,EAQtC,oBAAOC,GACLjD,GAAsBkD,gBAAiB,EAIzC,kBAAOC,GACL,OAAI1jB,QAEOugB,GAAsBgD,cAM5BhD,GAAsBkD,gBACH,qBAAbr2B,UACmB,MAA1BA,SAAS2L,iBR8KK,kBAAXnK,QACPA,OAAe,QACfA,OAAe,OAAa,YAC3B,UAAUmR,KAAKnR,OAAON,SAASq1B,UASR,kBAAZC,SAA8C,kBAAfA,QAAQC,KQhLrDC,qBAAAA,GAAqB,CAKbC,SAAAA,GACNlpB,KAAK6mB,WAAY,EAEb7mB,KAAKqnB,kBACPrnB,KAAKqnB,gBAAgB3L,QACrB1b,KAAKqnB,gBAAkB,MAIrBrnB,KAAKmpB,iBACP52B,SAAS4L,KAAKirB,YAAYppB,KAAKmpB,gBAC/BnpB,KAAKmpB,eAAiB,MAGpBnpB,KAAK8mB,uBACPe,aAAa7nB,KAAK8mB,sBAClB9mB,KAAK8mB,qBAAuB,MAOxBC,SAAAA,GACD/mB,KAAK6mB,YACR7mB,KAAKomB,KAAK,8BACVpmB,KAAKkpB,YAEDlpB,KAAK2mB,gBACP3mB,KAAK2mB,cAAc3mB,KAAKmmB,gBACxBnmB,KAAK2mB,cAAgB,OAS3BjL,KAAAA,GACO1b,KAAK6mB,YACR7mB,KAAKomB,KAAK,6BACVpmB,KAAKkpB,aASTG,IAAAA,CAAKnjB,GACH,MAAMojB,EAAU5tB,EAAUwK,GAC1BlG,KAAKimB,WAAaqD,EAAQp3B,OAC1B8N,KAAKqmB,OAAO7B,iBAAiB,aAAc8E,EAAQp3B,QAGnD,MAAMq3B,EAAalnB,EAAainB,GAI1B/J,EAAWH,GAAkBmK,EAjSdC,MAqSrB,IAAK,IAAI92B,EAAI,EAAGA,EAAI6sB,EAASrtB,OAAQQ,IACnCsN,KAAKqnB,gBAAgBoC,eACnBzpB,KAAK0mB,cACLnH,EAASrtB,OACTqtB,EAAS7sB,IAEXsN,KAAK0mB,gBAST8B,sBAAAA,CAAuBjL,EAAYmM,GACjC,GAAIvkB,IACF,OAEFnF,KAAKmpB,eAAiB52B,SAAS2L,cAAc,UAC7C,MAAM+pB,EAAqC,CAC3CA,OAA2D,KAC3DA,EAAoC,GAAI1K,EACxC0K,EAAoC,GAAIyB,EACxC1pB,KAAKmpB,eAAeQ,IAAM3pB,KAAKsmB,MAAM2B,GACrCjoB,KAAKmpB,eAAeS,MAAMC,QAAU,OAEpCt3B,SAAS4L,KAAKC,YAAY4B,KAAKmpB,gBAMzBvB,uBAAAA,CAAwBhZ,GAE9B,MAAMsX,EAAgBxqB,EAAUkT,GAAM1c,OACtC8N,KAAKkmB,eAAiBA,EACtBlmB,KAAKqmB,OAAO7B,iBAAiB,iBAAkB0B,UAYtCoB,GAiCXllB,WAAAA,CACE0nB,EACAC,EACOvD,EACAF,GAEP,GAHO,KAAYE,aAAZA,EACA,KAAKF,MAALA,EAlCT,KAAA0D,oBAAsB,IAAIjd,IAG1B,KAAWkd,YAAmD,GAO9D,KAAAC,cAAgBnK,KAAKI,MAAsB,IAAhBJ,KAAKmI,UAIhC,KAAYH,cAAG,EAsBR5iB,IAuCHnF,KAAK8pB,UAAYA,EACjB9pB,KAAK+pB,YAAcA,MAxCH,CAKhB/pB,KAAKmoB,yBAA2B7K,KAChCvpB,OApZ2C,aAqZLiM,KAAKmoB,0BACvC2B,EACJ/1B,OAtZwC,UAsZAiM,KAAKmoB,0BAC3C4B,EAGF/pB,KAAKmqB,SAAW7C,GAA2B8C,gBAG3C,IAAIC,EAAS,GAGb,GACErqB,KAAKmqB,SAASR,KACwC,gBAAtD3pB,KAAKmqB,SAASR,IAAI31B,OAAO,EAAG,IAC5B,CAEAq2B,EAAS,4BADa93B,SAASyH,OACwB,cACxD,CACD,MAAMswB,EAAiB,eAAiBD,EAAS,iBACjD,IACErqB,KAAKmqB,SAASI,IAAIj1B,OAClB0K,KAAKmqB,SAASI,IAAIC,MAAMF,GACxBtqB,KAAKmqB,SAASI,IAAI7O,OACnB,CAAC,MAAOhZ,GACPvN,GAAI,2BACAuN,EAAEqe,OACJ5rB,GAAIuN,EAAEqe,OAER5rB,GAAIuN,EACL,CACF,EAUK,oBAAO0nB,GACb,MAAMK,EAASl4B,SAAS2L,cAAc,UAItC,GAHAusB,EAAOb,MAAMC,QAAU,QAGnBt3B,SAAS4L,KAqBX,KAAM,oGApBN5L,SAAS4L,KAAKC,YAAYqsB,GAC1B,IAIYA,EAAOC,cAAcn4B,UAG7B4C,GAAI,gCAEP,CAAC,MAAOuN,GACP,MAAM1I,EAASzH,SAASyH,OACxBywB,EAAOd,IACL,gEACA3vB,EACA,0BACH,CAkBH,OAVIywB,EAAOE,gBACTF,EAAOF,IAAME,EAAOE,gBACXF,EAAOC,cAChBD,EAAOF,IAAME,EAAOC,cAAcn4B,SAExBk4B,EAAel4B,WAEzBk4B,EAAOF,IAAOE,EAAel4B,UAGxBk4B,EAMT/O,KAAAA,GAEE1b,KAAK4qB,OAAQ,EAET5qB,KAAKmqB,WAIPnqB,KAAKmqB,SAASI,IAAIpsB,KAAK0sB,YAAc,GACrC/wB,YAAW,KACa,OAAlBkG,KAAKmqB,WACP53B,SAAS4L,KAAKirB,YAAYppB,KAAKmqB,UAC/BnqB,KAAKmqB,SAAW,KACjB,GACApK,KAAKI,MAAM,KAIhB,MAAMqG,EAAexmB,KAAKwmB,aACtBA,IACFxmB,KAAKwmB,aAAe,KACpBA,KASJ+B,aAAAA,CAAchL,EAAYmM,GAMxB,IALA1pB,KAAK8qB,KAAOvN,EACZvd,KAAK+qB,KAAOrB,EACZ1pB,KAAK4qB,OAAQ,EAGN5qB,KAAKgrB,iBAUNA,WAAAA,GAIN,GACEhrB,KAAK4qB,OACL5qB,KAAK+nB,cACL/nB,KAAKgqB,oBAAoBiB,MAAQjrB,KAAKiqB,YAAY/3B,OAAS,EAAI,EAAI,GACnE,CAEA8N,KAAKkqB,gBACL,MAAMjC,EAA8C,CAAC,EACrDA,EAAoC,GAAIjoB,KAAK8qB,KAC7C7C,EAAoC,GAAIjoB,KAAK+qB,KAC7C9C,EAAwC,IAAIjoB,KAAKkqB,cACjD,IAAIgB,EAASlrB,KAAKsmB,MAAM2B,GAEpBkD,EAAgB,GAChBz4B,EAAI,EAER,KAAOsN,KAAKiqB,YAAY/3B,OAAS,GAAG,CAGlC,KADgB8N,KAAKiqB,YAAY,GAEtBh3B,EAAgBf,OAliBX,GAoiBZi5B,EAAcj5B,QAriBA,MA6jBhB,MAtBA,CAEA,MAAMk5B,EAASprB,KAAKiqB,YAAYrW,QAChCuX,EACEA,SAGAz4B,EACA,IACA04B,EAAOC,IALPF,MAQAz4B,EACA,IACA04B,EAAOE,GAVPH,KAaAz4B,EACA,IACA04B,EAAOn4B,EACTP,GACD,CAGF,CAKD,OAHAw4B,GAAkBC,EAClBnrB,KAAKurB,gBAAgBL,EAAQlrB,KAAKkqB,gBAE3B,CACR,CACC,OAAO,EAUXT,cAAAA,CAAe+B,EAAgBC,EAAmBvlB,GAEhDlG,KAAKiqB,YAAYpzB,KAAK,CAAEw0B,IAAKG,EAAQF,GAAIG,EAAWx4B,EAAGiT,IAInDlG,KAAK4qB,OACP5qB,KAAKgrB,cASDO,eAAAA,CAAgBG,EAAaC,GAEnC3rB,KAAKgqB,oBAAoBhd,IAAI2e,GAE7B,MAAMC,EAAeA,KACnB5rB,KAAKgqB,oBAAoB9d,OAAOyf,GAChC3rB,KAAKgrB,aAAa,EAKda,EAAmB/xB,WACvB8xB,EACA7L,KAAKI,MApmBwB,OA+mB/BngB,KAAKqoB,OAAOqD,GARSI,KAEnBjE,aAAagE,GAGbD,GAAc,IAWlBvD,MAAAA,CAAOqD,EAAaK,GACd5mB,IAEDnF,KAAagsB,eAAeN,EAAKK,GAElCjyB,YAAW,KACT,IAEE,IAAKkG,KAAK+nB,aACR,OAEF,MAAMkE,EAAYjsB,KAAKmqB,SAASI,IAAIrsB,cAAc,UAClD+tB,EAAUrtB,KAAO,kBACjBqtB,EAAU7uB,OAAQ,EAClB6uB,EAAUtC,IAAM+B,EAEhBO,EAAUC,OAAUD,EAAkBE,mBACpC,WAEE,MAAMC,EAAUH,EAAkBjF,WAC7BoF,GAAqB,WAAXA,GAAkC,aAAXA,IAEpCH,EAAUC,OAAUD,EAAkBE,mBAAqB,KACvDF,EAAUI,YACZJ,EAAUI,WAAWjD,YAAY6C,GAEnCF,IAEJ,EACFE,EAAUpQ,QAAU,KAClB1mB,GAAI,oCAAsCu2B,GAC1C1rB,KAAK+nB,cAAe,EACpB/nB,KAAK0b,OAAO,EAEd1b,KAAKmqB,SAASI,IAAIpsB,KAAKC,YAAY6tB,EACpC,CAAC,MAAOvpB,OAGRqd,KAAKI,MAAM,KCzrBpB,IAAImM,GAAgB,KACQ,qBAAjBC,aACTD,GAAgBC,aACc,qBAAdC,YAChBF,GAAgBE,iBAULC,GA2BXrqB,WAAAA,CACSujB,EACP1B,EACQ2B,EACAC,EACAC,EACRC,EACAC,GANO,KAAML,OAANA,EAEC,KAAaC,cAAbA,EACA,KAAaC,cAAbA,EACA,KAASC,UAATA,EA/BV,KAAc4G,eAAkB,KAChC,KAAMC,OAAoB,KAC1B,KAAWC,YAAG,EACd,KAAS3G,UAAG,EACZ,KAAaC,cAAG,EA+BdlmB,KAAKomB,KAAOhI,GAAWpe,KAAK2lB,QAC5B3lB,KAAKqmB,OAASzB,GAA0BX,GACxCjkB,KAAKmkB,QAAUsI,GAAoBI,eACjC5I,EACA8B,EACAC,EACAH,EACAD,GAEF5lB,KAAKojB,UAAYa,EAASb,UAUpB,qBAAOyJ,CACb5I,EACA8B,EACAC,EACAH,EACAD,GAEA,MAAMqC,EAAqC,CAAC,EAwB5C,OAvBAA,EAAuB,EAAItF,IAGxBxd,KACmB,qBAAb1R,UACPA,SAASiC,UACTktB,GAAgB1d,KAAKzR,SAASiC,YAE9BuyB,EAAuB,EN1GJ,KM4GjBlC,IACFkC,EAAiC,EAAIlC,GAEnCC,IACFiC,EAA4B,GAAIjC,GAE9BH,IACFoC,EAAUpF,IAAyBgD,GAEjCD,IACFqC,EAA8B,EAAIrC,GAG7B5B,GAAsBC,EAAUnB,GAAWmF,GAOpD3yB,IAAAA,CAAKixB,EAA8BC,GACjCxmB,KAAKwmB,aAAeA,EACpBxmB,KAAKumB,UAAYA,EAEjBvmB,KAAKomB,KAAK,2BAA6BpmB,KAAKmkB,SAE5CnkB,KAAKmmB,gBAAiB,EAEtBhJ,GAAkBhS,IAAI,8BAA8B,GAEpD,IACE,IAAIO,EACJ,GAAIvG,IAAa,CACf,MAAM2nB,EAAS9sB,KAAKojB,UAAY,YAAc,OAE9C1X,EAAU,CACRqhB,QAAS,CACP,aAAc,YAAYpK,MAAoBxG,MAAexoB,QAAQq5B,YAAYF,IACjF,mBAAoB9sB,KAAK4lB,eAAiB,KAS1C5lB,KAAK8lB,YACPpa,EAAQqhB,QAAuB,cAAI,UAAU/sB,KAAK8lB,aAEhD9lB,KAAK6lB,gBACPna,EAAQqhB,QAAQ,uBAAyB/sB,KAAK6lB,eAIhD,MAAMoH,EAAMt5B,CAAAA,SAAAA,aAAAA,WAAAA,GAAAA,qBAAAA,EAAAA,qBAAAA,EAAAA,qBAAAA,EAAAA,cAAAA,GACNu5B,EAC+B,IAAnCltB,KAAKmkB,QAAQrxB,QAAQ,UACjBm6B,EAAiB,aAAKA,EAAiB,YACvCA,EAAgB,YAAKA,EAAgB,WAEvCC,IACFxhB,EAAe,MAAI,CAAEyhB,OAAQD,GAEhC,CACDltB,KAAKotB,OAAS,IAAId,GAActsB,KAAKmkB,QAAS,GAAIzY,EACnD,CAAC,MAAOhJ,GACP1C,KAAKomB,KAAK,kCACV,MAAMzjB,EAAQD,EAAExD,SAAWwD,EAAEwD,KAK7B,OAJIvD,GACF3C,KAAKomB,KAAKzjB,QAEZ3C,KAAK+mB,WAEN,CAED/mB,KAAKotB,OAAOC,OAAS,KACnBrtB,KAAKomB,KAAK,wBACVpmB,KAAKmmB,gBAAiB,CAAI,EAG5BnmB,KAAKotB,OAAOE,QAAU,KACpBttB,KAAKomB,KAAK,0CACVpmB,KAAKotB,OAAS,KACdptB,KAAK+mB,WAAW,EAGlB/mB,KAAKotB,OAAOG,UAAYC,IACtBxtB,KAAKytB,oBAAoBD,EAAQ,EAGnCxtB,KAAKotB,OAAOvR,QAAUnZ,IACpB1C,KAAKomB,KAAK,yCAEV,MAAMzjB,EAASD,EAAUxD,SAAYwD,EAAUwD,KAC3CvD,GACF3C,KAAKomB,KAAKzjB,GAEZ3C,KAAK+mB,WAAW,EAOpBuB,KAAAA,GAAK,CAIL,oBAAOK,GACL8D,GAAoB7D,gBAAiB,EAGvC,kBAAOC,GACL,IAAI6E,GAAe,EACnB,GAAyB,qBAAd1oB,WAA6BA,UAAU2oB,UAAW,CAC3D,MAAMC,EAAkB,iCAClBC,EAAkB7oB,UAAU2oB,UAAUhqB,MAAMiqB,GAC9CC,GAAmBA,EAAgB37B,OAAS,GAC1C8G,WAAW60B,EAAgB,IAAM,MACnCH,GAAe,EAGpB,CAED,OACGA,GACiB,OAAlBpB,KACCG,GAAoB7D,eAiBzB,uBAAOkF,GAGL,OACE3Q,GAAkBJ,oBACsC,IAAxDI,GAAkBjpB,IAAI,8BAI1B+0B,qBAAAA,GACE9L,GAAkBR,OAAO,8BAGnBoR,YAAAA,CAAa7nB,GAEnB,GADAlG,KAAK2sB,OAAO91B,KAAKqP,GACblG,KAAK2sB,OAAOz6B,SAAW8N,KAAK4sB,YAAa,CAC3C,MAAMoB,EAAWhuB,KAAK2sB,OAAOvrB,KAAK,IAClCpB,KAAK2sB,OAAS,KACd,MAAMsB,EAAW3nB,EAAS0nB,GAG1BhuB,KAAKumB,UAAU0H,EAChB,EAMKC,oBAAAA,CAAqBC,GAC3BnuB,KAAK4sB,YAAcuB,EACnBnuB,KAAK2sB,OAAS,GAORyB,kBAAAA,CAAmBloB,GAIzB,GAHAlH,EAAuB,OAAhBgB,KAAK2sB,OAAiB,kCAGzBzmB,EAAKhU,QAAU,EAAG,CACpB,MAAMi8B,EAAa3P,OAAOtY,GAC1B,IAAKmoB,MAAMF,GAET,OADAnuB,KAAKkuB,qBAAqBC,GACnB,IAEV,CAED,OADAnuB,KAAKkuB,qBAAqB,GACnBhoB,EAOTunB,mBAAAA,CAAoBa,GAClB,GAAoB,OAAhBtuB,KAAKotB,OACP,OAEF,MAAMlnB,EAAOooB,EAAW,KAMxB,GALAtuB,KAAKkmB,eAAiBhgB,EAAKhU,OAC3B8N,KAAKqmB,OAAO7B,iBAAiB,iBAAkBte,EAAKhU,QAEpD8N,KAAKuuB,iBAEe,OAAhBvuB,KAAK2sB,OAEP3sB,KAAK+tB,aAAa7nB,OACb,CAEL,MAAMsoB,EAAgBxuB,KAAKouB,mBAAmBloB,GACxB,OAAlBsoB,GACFxuB,KAAK+tB,aAAaS,EAErB,EAOHnF,IAAAA,CAAKnjB,GACHlG,KAAKuuB,iBAEL,MAAMjF,EAAU5tB,EAAUwK,GAC1BlG,KAAKimB,WAAaqD,EAAQp3B,OAC1B8N,KAAKqmB,OAAO7B,iBAAiB,aAAc8E,EAAQp3B,QAKnD,MAAMqtB,EAAWH,GAAkBkK,EAvUN,OA0UzB/J,EAASrtB,OAAS,GACpB8N,KAAKyuB,YAAY/sB,OAAO6d,EAASrtB,SAInC,IAAK,IAAIQ,EAAI,EAAGA,EAAI6sB,EAASrtB,OAAQQ,IACnCsN,KAAKyuB,YAAYlP,EAAS7sB,IAItBw2B,SAAAA,GACNlpB,KAAK6mB,WAAY,EACb7mB,KAAK0sB,iBACPgC,cAAc1uB,KAAK0sB,gBACnB1sB,KAAK0sB,eAAiB,MAGpB1sB,KAAKotB,SACPptB,KAAKotB,OAAO1R,QACZ1b,KAAKotB,OAAS,MAIVrG,SAAAA,GACD/mB,KAAK6mB,YACR7mB,KAAKomB,KAAK,+BACVpmB,KAAKkpB,YAGDlpB,KAAKwmB,eACPxmB,KAAKwmB,aAAaxmB,KAAKmmB,gBACvBnmB,KAAKwmB,aAAe,OAS1B9K,KAAAA,GACO1b,KAAK6mB,YACR7mB,KAAKomB,KAAK,6BACVpmB,KAAKkpB,aAQTqF,cAAAA,GACEG,cAAc1uB,KAAK0sB,gBACnB1sB,KAAK0sB,eAAiBiC,aAAY,KAE5B3uB,KAAKotB,QACPptB,KAAKyuB,YAAY,KAEnBzuB,KAAKuuB,gBAAgB,GAEpBxO,KAAKI,MArYyB,OA6Y3BsO,WAAAA,CAAY13B,GAIlB,IACEiJ,KAAKotB,OAAO/D,KAAKtyB,EAClB,CAAC,MAAO2L,GACP1C,KAAKomB,KACH,0CACA1jB,EAAExD,SAAWwD,EAAEwD,KACf,uBAEFpM,WAAWkG,KAAK+mB,UAAU7I,KAAKle,MAAO,EACvC,GA1LIysB,GAA4BmC,6BAAG,EAK/BnC,GAAcoC,eAAG,UClPbC,GAqBX1sB,WAAAA,CAAY6hB,GACVjkB,KAAK+uB,gBAAgB9K,GAhBvB,yBAAW+K,GACT,MAAO,CAACtJ,GAAuB+G,IAOjC,mCAAWwC,GACT,OAAOjvB,KAAKkvB,4BAUNH,eAAAA,CAAgB9K,GACtB,MAAMkL,EACJ1C,IAAuBA,GAAiC,cAC1D,IAAI2C,EACFD,IAA0B1C,GAAoBqB,mBAYhD,GAVI7J,EAASd,gBACNgM,GACHrf,GACE,mFAIJsf,GAAuB,GAGrBA,EACFpvB,KAAKqvB,YAAc,CAAC5C,QACf,CACL,MAAM6C,EAActvB,KAAKqvB,YAAc,GACvC,IAAK,MAAME,KAAaT,GAAiBE,eACnCO,GAAaA,EAAuB,eACtCD,EAAWz4B,KAAK04B,GAGpBT,GAAiBI,6BAA8B,CAChD,EAMHM,gBAAAA,GACE,GAAIxvB,KAAKqvB,YAAYn9B,OAAS,EAC5B,OAAO8N,KAAKqvB,YAAY,GAExB,MAAM,IAAIjwB,MAAM,2BAOpBqwB,gBAAAA,GACE,OAAIzvB,KAAKqvB,YAAYn9B,OAAS,EACrB8N,KAAKqvB,YAAY,GAEjB,MApEJP,GAA2BI,6BAAG,QCgC1BQ,GA6BXttB,WAAAA,CACSmb,EACCoS,EACAC,EACAC,EACAC,EACA/K,EACAgL,EACApJ,EACAqJ,EACDhK,GATA,KAAEzI,GAAFA,EACC,KAASoS,UAATA,EACA,KAAcC,eAAdA,EACA,KAAcC,eAAdA,EACA,KAAUC,WAAVA,EACA,KAAU/K,WAAVA,EACA,KAAQgL,SAARA,EACA,KAAapJ,cAAbA,EACA,KAAOqJ,QAAPA,EACD,KAAahK,cAAbA,EAtCT,KAAeiK,gBAAG,EAClB,KAAmBC,oBAAc,GAWzB,KAAAC,OAAkC,EA4BxCnwB,KAAKomB,KAAOhI,GAAW,KAAOpe,KAAKud,GAAK,KACxCvd,KAAKowB,kBAAoB,IAAItB,GAAiBa,GAC9C3vB,KAAKomB,KAAK,sBACVpmB,KAAKqwB,SAMCA,MAAAA,GACN,MAAMC,EAAOtwB,KAAKowB,kBAAkBZ,mBACpCxvB,KAAKuwB,MAAQ,IAAID,EACftwB,KAAKwwB,mBACLxwB,KAAK2vB,UACL3vB,KAAK4vB,eACL5vB,KAAK6vB,eACL7vB,KAAK8vB,WACL,KACA9vB,KAAKgmB,eAKPhmB,KAAKywB,0BAA4BH,EAAmC,8BAAK,EAEzE,MAAMI,EAAoB1wB,KAAK2wB,cAAc3wB,KAAKuwB,OAC5CK,EAAmB5wB,KAAK6wB,iBAAiB7wB,KAAKuwB,OACpDvwB,KAAK8wB,IAAM9wB,KAAKuwB,MAChBvwB,KAAK+wB,IAAM/wB,KAAKuwB,MAChBvwB,KAAKgxB,eAAiB,KACtBhxB,KAAKixB,YAAa,EAQlBn3B,YAAW,KAETkG,KAAKuwB,OAASvwB,KAAKuwB,MAAMj7B,KAAKo7B,EAAmBE,EAAiB,GACjE7Q,KAAKI,MAAM,IAEd,MAAM+Q,EAAmBZ,EAAqB,gBAAK,EAC/CY,EAAmB,IACrBlxB,KAAKmxB,gBAAkBnQ,IAAsB,KAC3ChhB,KAAKmxB,gBAAkB,KAClBnxB,KAAKixB,aAENjxB,KAAKuwB,OACLvwB,KAAKuwB,MAAMrK,cAnHiB,QAqH5BlmB,KAAKomB,KACH,wDACEpmB,KAAKuwB,MAAMrK,cACX,wCAEJlmB,KAAKixB,YAAa,EAClBjxB,KAAKuwB,MAAMtH,yBAEXjpB,KAAKuwB,OACLvwB,KAAKuwB,MAAMtK,UA/Ha,MAiIxBjmB,KAAKomB,KACH,oDACEpmB,KAAKuwB,MAAMtK,UACX,uCAKJjmB,KAAKomB,KAAK,+CACVpmB,KAAK0b,SAER,GAEAqE,KAAKI,MAAM+Q,KAIVV,gBAAAA,GACN,MAAO,KAAOxwB,KAAKud,GAAK,IAAMvd,KAAKiwB,kBAG7BY,gBAAAA,CAAiBP,GACvB,OAAOc,IACDd,IAAStwB,KAAKuwB,MAChBvwB,KAAKqxB,kBAAkBD,GACdd,IAAStwB,KAAKgxB,gBACvBhxB,KAAKomB,KAAK,8BACVpmB,KAAKsxB,8BAELtxB,KAAKomB,KAAK,4BACX,EAIGuK,aAAAA,CAAcL,GACpB,OAAQpxB,IACc,IAAhBc,KAAKmwB,SACHG,IAAStwB,KAAK+wB,IAChB/wB,KAAKuxB,0BAA0BryB,GACtBoxB,IAAStwB,KAAKgxB,eACvBhxB,KAAKwxB,4BAA4BtyB,GAEjCc,KAAKomB,KAAK,6BAEb,EAOLqL,WAAAA,CAAYC,GAEV,MAAMC,EAAM,CAAEjpB,EAAG,IAAKzV,EAAGy+B,GACzB1xB,KAAK4xB,UAAUD,GAGjBE,oBAAAA,GACM7xB,KAAK8wB,MAAQ9wB,KAAKgxB,gBAAkBhxB,KAAK+wB,MAAQ/wB,KAAKgxB,iBACxDhxB,KAAKomB,KACH,2CAA6CpmB,KAAKgxB,eAAerL,QAEnE3lB,KAAKuwB,MAAQvwB,KAAKgxB,eAClBhxB,KAAKgxB,eAAiB,MAKlBc,mBAAAA,CAAoBC,GAC1B,GA7LiB,MA6LGA,EAAa,CAC/B,MAAMC,EAAMD,EAAwB,EAxLvB,MAyLTC,EACFhyB,KAAKiyB,6BA7LS,MA8LLD,GAEThyB,KAAKomB,KAAK,wCACVpmB,KAAKgxB,eAAetV,QAGlB1b,KAAK8wB,MAAQ9wB,KAAKgxB,gBAClBhxB,KAAK+wB,MAAQ/wB,KAAKgxB,gBAElBhxB,KAAK0b,SArMM,MAuMJsW,IACThyB,KAAKomB,KAAK,0BACVpmB,KAAKkyB,8BACLlyB,KAAKiyB,6BAER,EAGKT,2BAAAA,CAA4BW,GAClC,MAAMC,EAAgBlT,GAAW,IAAKiT,GAChCjsB,EAAgBgZ,GAAW,IAAKiT,GACtC,GAAc,MAAVC,EACFpyB,KAAK8xB,oBAAoB5rB,OACpB,IAAc,MAAVksB,EAIT,MAAM,IAAIhzB,MAAM,2BAA6BgzB,GAF7CpyB,KAAKkwB,oBAAoBr5B,KAAKqP,EAG/B,EAGK+rB,0BAAAA,GACFjyB,KAAKkyB,6BAA+B,GACtClyB,KAAKomB,KAAK,oCACVpmB,KAAKixB,YAAa,EAClBjxB,KAAKgxB,eAAe/H,wBACpBjpB,KAAKqyB,wBAGLryB,KAAKomB,KAAK,8BACVpmB,KAAKgxB,eAAe3H,KAAK,CAAE3gB,EAAG,IAAKzV,EAAG,CAAEyV,EAlOjC,IAkO0CzV,EAAG,CAAC,MAIjDo/B,mBAAAA,GAENryB,KAAKgxB,eAAe1I,QAEpBtoB,KAAKomB,KAAK,mCACVpmB,KAAKgxB,eAAe3H,KAAK,CAAE3gB,EAAG,IAAKzV,EAAG,CAAEyV,EA7OzB,IA6OwCzV,EAAG,CAAC,KAI3D+M,KAAKomB,KAAK,kCACVpmB,KAAKuwB,MAAMlH,KAAK,CAAE3gB,EAAG,IAAKzV,EAAG,CAAEyV,EAjPV,IAiP+BzV,EAAG,CAAC,KACxD+M,KAAK8wB,IAAM9wB,KAAKgxB,eAEhBhxB,KAAK6xB,uBAGCN,yBAAAA,CAA0BY,GAEhC,MAAMC,EAAgBlT,GAAW,IAAKiT,GAChCjsB,EAAgBgZ,GAAW,IAAKiT,GACxB,MAAVC,EACFpyB,KAAKsyB,WAAWpsB,GACG,MAAVksB,GACTpyB,KAAKuyB,eAAersB,GAIhBqsB,cAAAA,CAAerzB,GACrBc,KAAKwyB,qBAGLxyB,KAAK+kB,WAAW7lB,GAGVszB,kBAAAA,GACDxyB,KAAKixB,aACRjxB,KAAKywB,4BACDzwB,KAAKywB,2BAA6B,IACpCzwB,KAAKomB,KAAK,kCACVpmB,KAAKixB,YAAa,EAClBjxB,KAAKuwB,MAAMtH,0BAKTqJ,UAAAA,CAAWP,GACjB,MAAMC,EAAc9S,GA5RH,IA4R4B6S,GAC7C,GA5RiB,MA4RGA,EAAa,CAC/B,MAAM32B,EAAU22B,EAAwB,EACxC,GArRe,MAqRXC,EAAsB,CACxB,MAAMS,EAAgBj8B,OAAAugB,OAAA,GAChB3b,GAOF4E,KAAK2vB,UAAUpM,kBAEjBkP,EAAiBC,EAAI1yB,KAAK2vB,UAAUv1B,MAEtC4F,KAAK2yB,aAAaF,EACnB,MAAM,GAtSY,MAsSRT,EAA0B,CACnChyB,KAAKomB,KAAK,qCACVpmB,KAAK+wB,IAAM/wB,KAAKgxB,eAChB,IAAK,IAAIt+B,EAAI,EAAGA,EAAIsN,KAAKkwB,oBAAoBh+B,SAAUQ,EACrDsN,KAAKuyB,eAAevyB,KAAKkwB,oBAAoBx9B,IAE/CsN,KAAKkwB,oBAAsB,GAC3BlwB,KAAK6xB,sBACN,KAnTkB,MAmTRG,EAGThyB,KAAK4yB,sBAAsBx3B,GArTb,MAsTL42B,EAEThyB,KAAK6yB,SAASz3B,GAvTA,MAwTL42B,EACTrvB,GAAM,iBAAmBvH,GAxTZ,MAyTJ42B,GACThyB,KAAKomB,KAAK,wBACVpmB,KAAKwyB,qBACLxyB,KAAK8yB,iCAELnwB,GAAM,mCAAqCqvB,EAE9C,EAMKW,YAAAA,CAAaI,GAMnB,MAAMC,EAAYD,EAAUzH,GACtBpX,EAAU6e,EAAUrT,EACpBtlB,EAAO24B,EAAUL,EACvB1yB,KAAKizB,UAAYF,EAAUnT,EAC3B5f,KAAK2vB,UAAUv1B,KAAOA,EAEF,IAAhB4F,KAAKmwB,SACPnwB,KAAKuwB,MAAMjI,QACXtoB,KAAKkzB,yBAAyBlzB,KAAKuwB,MAAOyC,GACtCrQ,KAAqBzO,GACvBpE,GAAK,sCAGP9P,KAAKmzB,oBAIDA,gBAAAA,GACN,MAAM7C,EAAOtwB,KAAKowB,kBAAkBX,mBAChCa,GACFtwB,KAAKozB,cAAc9C,GAIf8C,aAAAA,CAAc9C,GACpBtwB,KAAKgxB,eAAiB,IAAIV,EACxBtwB,KAAKwwB,mBACLxwB,KAAK2vB,UACL3vB,KAAK4vB,eACL5vB,KAAK6vB,eACL7vB,KAAK8vB,WACL9vB,KAAKizB,WAIPjzB,KAAKkyB,4BACH5B,EAAmC,8BAAK,EAE1C,MAAM/J,EAAYvmB,KAAK2wB,cAAc3wB,KAAKgxB,gBACpCxK,EAAexmB,KAAK6wB,iBAAiB7wB,KAAKgxB,gBAChDhxB,KAAKgxB,eAAe17B,KAAKixB,EAAWC,GAGpCxF,IAAsB,KAChBhhB,KAAKgxB,iBACPhxB,KAAKomB,KAAK,gCACVpmB,KAAKgxB,eAAetV,QACrB,GACAqE,KAAKI,MAnZY,MAsZd0S,QAAAA,CAASz4B,GACf4F,KAAKomB,KAAK,qCAAuChsB,GACjD4F,KAAK2vB,UAAUv1B,KAAOA,EAGF,IAAhB4F,KAAKmwB,OACPnwB,KAAK0b,SAGL1b,KAAKqzB,oBACLrzB,KAAKqwB,UAID6C,wBAAAA,CAAyB5C,EAAiB0C,GAChDhzB,KAAKomB,KAAK,oCACVpmB,KAAKuwB,MAAQD,EACbtwB,KAAKmwB,OAAS,EAEVnwB,KAAK+vB,WACP/vB,KAAK+vB,SAASiD,EAAWhzB,KAAKizB,WAC9BjzB,KAAK+vB,SAAW,MAKqB,IAAnC/vB,KAAKywB,2BACPzwB,KAAKomB,KAAK,kCACVpmB,KAAKixB,YAAa,GAElBjQ,IAAsB,KACpBhhB,KAAK8yB,+BAA+B,GACnC/S,KAAKI,MAlb8B,MAsblC2S,6BAAAA,GAED9yB,KAAKixB,YAA8B,IAAhBjxB,KAAKmwB,SAC3BnwB,KAAKomB,KAAK,4BACVpmB,KAAK4xB,UAAU,CAAElpB,EAAG,IAAKzV,EAAG,CAAEyV,EApavB,IAoagCzV,EAAG,CAAC,MAIvCq+B,0BAAAA,GACN,MAAMhB,EAAOtwB,KAAKgxB,eAClBhxB,KAAKgxB,eAAiB,KAClBhxB,KAAK8wB,MAAQR,GAAQtwB,KAAK+wB,MAAQT,GAEpCtwB,KAAK0b,QAQD2V,iBAAAA,CAAkBD,GACxBpxB,KAAKuwB,MAAQ,KAIRa,GAAiC,IAAhBpxB,KAAKmwB,OAQA,IAAhBnwB,KAAKmwB,QACdnwB,KAAKomB,KAAK,8BARVpmB,KAAKomB,KAAK,+BAENpmB,KAAK2vB,UAAUhM,oBACjBxG,GAAkBR,OAAO,QAAU3c,KAAK2vB,UAAUv1B,MAElD4F,KAAK2vB,UAAUjM,aAAe1jB,KAAK2vB,UAAUv1B,OAMjD4F,KAAK0b,QAGCkX,qBAAAA,CAAsBU,GAC5BtzB,KAAKomB,KAAK,0DAENpmB,KAAKgwB,UACPhwB,KAAKgwB,QAAQsD,GACbtzB,KAAKgwB,QAAU,MAKjBhwB,KAAK2mB,cAAgB,KAErB3mB,KAAK0b,QAGCkW,SAAAA,CAAU1rB,GAChB,GAAoB,IAAhBlG,KAAKmwB,OACP,KAAM,8BAENnwB,KAAK8wB,IAAIzH,KAAKnjB,GAOlBwV,KAAAA,GACsB,IAAhB1b,KAAKmwB,SACPnwB,KAAKomB,KAAK,gCACVpmB,KAAKmwB,OAAS,EAEdnwB,KAAKqzB,oBAEDrzB,KAAK2mB,gBACP3mB,KAAK2mB,gBACL3mB,KAAK2mB,cAAgB,OAKnB0M,iBAAAA,GACNrzB,KAAKomB,KAAK,iCACNpmB,KAAKuwB,QACPvwB,KAAKuwB,MAAM7U,QACX1b,KAAKuwB,MAAQ,MAGXvwB,KAAKgxB,iBACPhxB,KAAKgxB,eAAetV,QACpB1b,KAAKgxB,eAAiB,MAGpBhxB,KAAKmxB,kBACPtJ,aAAa7nB,KAAKmxB,iBAClBnxB,KAAKmxB,gBAAkB,aCjiBPoC,GAkBpBna,GAAAA,CACEoa,EACAttB,EACAutB,EACAC,GAAa,CAGfC,KAAAA,CACEH,EACAttB,EACAutB,EACAC,GAAa,CAOfE,gBAAAA,CAAiBptB,GAAgB,CAMjCqtB,oBAAAA,CAAqBrtB,GAAgB,CAErCstB,eAAAA,CACEN,EACAttB,EACAutB,GAA2C,CAG7CM,iBAAAA,CACEP,EACAttB,EACAutB,GAA2C,CAG7CO,kBAAAA,CACER,EACAC,GAA2C,CAG7CQ,WAAAA,CAAYC,GAAkC,QC/D1BC,GAQpB/xB,WAAAA,CAAoBgyB,GAAA,KAAcA,eAAdA,EAPZ,KAAUC,WAKd,CAAC,EAGHr1B,EACEsB,MAAMC,QAAQ6zB,IAAmBA,EAAeliC,OAAS,EACzD,8BAeMoiC,OAAAA,CAAQC,GAChB,GAAIj0B,MAAMC,QAAQP,KAAKq0B,WAAWE,IAAa,CAE7C,MAAMC,EAAY,IAAIx0B,KAAKq0B,WAAWE,IAAY,QAAAxkB,EAAA9d,UAAAC,OAHdisB,EAAkB,IAAA7d,MAAAyP,EAAA,EAAAA,EAAA,KAAAG,EAAA,EAAAA,EAAAH,EAAAG,IAAlBiO,EAAkBjO,EAAA,GAAAje,UAAAie,GAKtD,IAAK,IAAIxd,EAAI,EAAGA,EAAI8hC,EAAUtiC,OAAQQ,IACpC8hC,EAAU9hC,GAAGkH,SAAS6X,MAAM+iB,EAAU9hC,GAAG+hC,QAAStW,EAErD,EAGHuW,EAAAA,CAAGH,EAAmB36B,EAAgC66B,GACpDz0B,KAAK20B,mBAAmBJ,GACxBv0B,KAAKq0B,WAAWE,GAAav0B,KAAKq0B,WAAWE,IAAc,GAC3Dv0B,KAAKq0B,WAAWE,GAAW19B,KAAK,CAAE+C,WAAU66B,YAE5C,MAAMG,EAAY50B,KAAK60B,gBAAgBN,GACnCK,GACFh7B,EAAS6X,MAAMgjB,EAASG,GAI5BE,GAAAA,CAAIP,EAAmB36B,EAAgC66B,GACrDz0B,KAAK20B,mBAAmBJ,GACxB,MAAMC,EAAYx0B,KAAKq0B,WAAWE,IAAc,GAChD,IAAK,IAAI7hC,EAAI,EAAGA,EAAI8hC,EAAUtiC,OAAQQ,IACpC,GACE8hC,EAAU9hC,GAAGkH,WAAaA,KACxB66B,GAAWA,IAAYD,EAAU9hC,GAAG+hC,SAGtC,YADAD,EAAUO,OAAOriC,EAAG,GAMlBiiC,kBAAAA,CAAmBJ,GACzBv1B,EACEgB,KAAKo0B,eAAevZ,MAAKma,GAChBA,IAAOT,IAEhB,kBAAoBA,IC9DpB,MAAOU,WAAsBd,GAOjC/xB,WAAAA,GACEmD,MAAM,CAAC,WAPD,KAAO2vB,SAAG,EAcI,qBAAXnhC,QAC4B,qBAA5BA,OAAOqe,kBACbnN,MAEDlR,OAAOqe,iBACL,UACA,KACOpS,KAAKk1B,UACRl1B,KAAKk1B,SAAU,EACfl1B,KAAKs0B,QAAQ,UAAU,GACxB,IAEH,GAGFvgC,OAAOqe,iBACL,WACA,KACMpS,KAAKk1B,UACPl1B,KAAKk1B,SAAU,EACfl1B,KAAKs0B,QAAQ,UAAU,GACxB,IAEH,IAnCN,kBAAOa,GACL,OAAO,IAAIF,GAuCbJ,eAAAA,CAAgBN,GAEd,OADAv1B,EAAqB,WAAdu1B,EAAwB,uBAAyBA,GACjD,CAACv0B,KAAKk1B,SAGfE,eAAAA,GACE,OAAOp1B,KAAKk1B,eC5CHG,GAQXjzB,WAAAA,CAAYkzB,EAAiCC,GAC3C,QAAiB,IAAbA,EAAqB,CACvBv1B,KAAKw1B,QAAWF,EAAwB7iC,MAAM,KAG9C,IAAIgjC,EAAS,EACb,IAAK,IAAI/iC,EAAI,EAAGA,EAAIsN,KAAKw1B,QAAQtjC,OAAQQ,IACnCsN,KAAKw1B,QAAQ9iC,GAAGR,OAAS,IAC3B8N,KAAKw1B,QAAQC,GAAUz1B,KAAKw1B,QAAQ9iC,GACpC+iC,KAGJz1B,KAAKw1B,QAAQtjC,OAASujC,EAEtBz1B,KAAK01B,UAAY,CAClB,MACC11B,KAAKw1B,QAAUF,EACft1B,KAAK01B,UAAYH,EAIrB3Y,QAAAA,GACE,IAAI4W,EAAa,GACjB,IAAK,IAAI9gC,EAAIsN,KAAK01B,UAAWhjC,EAAIsN,KAAKw1B,QAAQtjC,OAAQQ,IAC5B,KAApBsN,KAAKw1B,QAAQ9iC,KACf8gC,GAAc,IAAMxzB,KAAKw1B,QAAQ9iC,IAIrC,OAAO8gC,GAAc,cAITmC,KACd,OAAO,IAAIN,GAAK,GAClB,CAEM,SAAUO,GAAaC,GAC3B,OAAIA,EAAKH,WAAaG,EAAKL,QAAQtjC,OAC1B,KAGF2jC,EAAKL,QAAQK,EAAKH,UAC3B,CAKM,SAAUI,GAAcD,GAC5B,OAAOA,EAAKL,QAAQtjC,OAAS2jC,EAAKH,SACpC,CAEM,SAAUK,GAAaF,GAC3B,IAAIN,EAAWM,EAAKH,UAIpB,OAHIH,EAAWM,EAAKL,QAAQtjC,QAC1BqjC,IAEK,IAAIF,GAAKQ,EAAKL,QAASD,EAChC,CAEM,SAAUS,GAAYH,GAC1B,OAAIA,EAAKH,UAAYG,EAAKL,QAAQtjC,OACzB2jC,EAAKL,QAAQK,EAAKL,QAAQtjC,OAAS,GAGrC,IACT,UAiBgB+jC,GAAUJ,GAA6B,IAAjBK,EAAAjkC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAgB,EACpD,OAAO4jC,EAAKL,QAAQ7+B,MAAMk/B,EAAKH,UAAYQ,EAC7C,CAEM,SAAUC,GAAWN,GACzB,GAAIA,EAAKH,WAAaG,EAAKL,QAAQtjC,OACjC,OAAO,KAGT,MAAMkkC,EAAS,GACf,IAAK,IAAI1jC,EAAImjC,EAAKH,UAAWhjC,EAAImjC,EAAKL,QAAQtjC,OAAS,EAAGQ,IACxD0jC,EAAOv/B,KAAKg/B,EAAKL,QAAQ9iC,IAG3B,OAAO,IAAI2iC,GAAKe,EAAQ,EAC1B,CAEgB,SAAAC,GAAUR,EAAYS,GACpC,MAAMF,EAAS,GACf,IAAK,IAAI1jC,EAAImjC,EAAKH,UAAWhjC,EAAImjC,EAAKL,QAAQtjC,OAAQQ,IACpD0jC,EAAOv/B,KAAKg/B,EAAKL,QAAQ9iC,IAG3B,GAAI4jC,aAAwBjB,GAC1B,IAAK,IAAI3iC,EAAI4jC,EAAaZ,UAAWhjC,EAAI4jC,EAAad,QAAQtjC,OAAQQ,IACpE0jC,EAAOv/B,KAAKy/B,EAAad,QAAQ9iC,QAE9B,CACL,MAAM6jC,EAAcD,EAAa7jC,MAAM,KACvC,IAAK,IAAIC,EAAI,EAAGA,EAAI6jC,EAAYrkC,OAAQQ,IAClC6jC,EAAY7jC,GAAGR,OAAS,GAC1BkkC,EAAOv/B,KAAK0/B,EAAY7jC,GAG7B,CAED,OAAO,IAAI2iC,GAAKe,EAAQ,EAC1B,CAKM,SAAUI,GAAYX,GAC1B,OAAOA,EAAKH,WAAaG,EAAKL,QAAQtjC,MACxC,CAKgB,SAAAukC,GAAgBC,EAAiBC,GAC/C,MAAMC,EAAQhB,GAAac,GACzBG,EAAQjB,GAAae,GACvB,GAAc,OAAVC,EACF,OAAOD,EACF,GAAIC,IAAUC,EACnB,OAAOJ,GAAgBV,GAAaW,GAAYX,GAAaY,IAE7D,MAAM,IAAIv3B,MACR,8BACEu3B,EADF,8BAIED,EACA,IAGR,CAuBgB,SAAAI,GAAWjB,EAAYkB,GACrC,GAAIjB,GAAcD,KAAUC,GAAciB,GACxC,OAAO,EAGT,IACE,IAAIrkC,EAAImjC,EAAKH,UAAWxsB,EAAI6tB,EAAMrB,UAClChjC,GAAKmjC,EAAKL,QAAQtjC,OAClBQ,IAAKwW,IAEL,GAAI2sB,EAAKL,QAAQ9iC,KAAOqkC,EAAMvB,QAAQtsB,GACpC,OAAO,EAIX,OAAO,CACT,CAKgB,SAAA8tB,GAAanB,EAAYkB,GACvC,IAAIrkC,EAAImjC,EAAKH,UACTxsB,EAAI6tB,EAAMrB,UACd,GAAII,GAAcD,GAAQC,GAAciB,GACtC,OAAO,EAET,KAAOrkC,EAAImjC,EAAKL,QAAQtjC,QAAQ,CAC9B,GAAI2jC,EAAKL,QAAQ9iC,KAAOqkC,EAAMvB,QAAQtsB,GACpC,OAAO,IAEPxW,IACAwW,CACH,CACD,OAAO,CACT,OAYa+tB,GASX70B,WAAAA,CAAYyzB,EAAmBqB,GAAA,KAAYA,aAAZA,EAC7Bl3B,KAAKm3B,OAASlB,GAAUJ,EAAM,GAE9B71B,KAAKo3B,YAAcrX,KAAKsX,IAAI,EAAGr3B,KAAKm3B,OAAOjlC,QAE3C,IAAK,IAAIQ,EAAI,EAAGA,EAAIsN,KAAKm3B,OAAOjlC,OAAQQ,IACtCsN,KAAKo3B,aAAe9tB,EAAatJ,KAAKm3B,OAAOzkC,IAE/C4kC,GAAyBt3B,OA0B7B,SAASs3B,GAAyBC,GAChC,GAAIA,EAAeH,YAvRS,IAwR1B,MAAM,IAAIh4B,MACRm4B,EAAeL,aAAfK,yCAIEA,EAAeH,YACf,MAGN,GAAIG,EAAeJ,OAAOjlC,OApSL,GAqSnB,MAAM,IAAIkN,MACRm4B,EAAeL,aAAfK,gGAIEC,GAA4BD,GAGpC,CAKM,SAAUC,GACdD,GAEA,OAAqC,IAAjCA,EAAeJ,OAAOjlC,OACjB,GAEF,gBAAkBqlC,EAAeJ,OAAO/1B,KAAK,KAAO,GAC7D,CCxTM,MAAOq2B,WAA0BtD,GAOrC/xB,WAAAA,GAEE,IAAIs1B,EACAC,EAFJpyB,MAAM,CAAC,YAIe,qBAAbhT,UAC8B,qBAA9BA,SAAS6f,mBAEkB,qBAAvB7f,SAAiB,QAE1BolC,EAAmB,mBACnBD,EAAS,UACiC,qBAA1BnlC,SAAoB,WACpColC,EAAmB,sBACnBD,EAAS,aACgC,qBAAzBnlC,SAAmB,UACnColC,EAAmB,qBACnBD,EAAS,YACoC,qBAA7BnlC,SAAuB,eACvColC,EAAmB,yBACnBD,EAAS,iBAQb13B,KAAK43B,UAAW,EAEZD,GACFplC,SAAS6f,iBACPulB,GACA,KACE,MAAME,GAAWtlC,SAASmlC,GACtBG,IAAY73B,KAAK43B,WACnB53B,KAAK43B,SAAWC,EAChB73B,KAAKs0B,QAAQ,UAAWuD,GACzB,IAEH,GA5CN,kBAAO1C,GACL,OAAO,IAAIsC,GAgDb5C,eAAAA,CAAgBN,GAEd,OADAv1B,EAAqB,YAAdu1B,EAAyB,uBAAyBA,GAClD,CAACv0B,KAAK43B,WCjCjB,MAAME,GAAsB,IA4CtB,MAAOC,WAA6BxE,GAwDxCnxB,WAAAA,CACUutB,EACAC,EACAoI,EAMAC,EACAC,EACAC,EACAC,EACAC,GAIR,GAFA9yB,QAdQ,KAASoqB,UAATA,EACA,KAAcC,eAAdA,EACA,KAAaoI,cAAbA,EAMA,KAAgBC,iBAAhBA,EACA,KAAmBC,oBAAnBA,EACA,KAAkBC,mBAAlBA,EACA,KAAsBC,uBAAtBA,EACA,KAAaC,cAAbA,EAnEV,KAAA9a,GAAKwa,GAAqBO,8BAClB,KAAIlS,KAAGhI,GAAW,KAAOpe,KAAKud,GAAK,KAEnC,KAAiBgb,kBAAkC,CAAC,EAC3C,KAAAC,QAGb,IAAI9tB,IACA,KAAgB+tB,iBAAqB,GACrC,KAAgBC,iBAAqB,GACrC,KAAoBC,qBAAG,EACvB,KAAoBC,qBAAG,EACvB,KAAyBC,0BAA0B,GACnD,KAAUC,YAAG,EACb,KAAeC,gBAAGjB,GAClB,KAAkBkB,mBA5DQ,IA6D1B,KAAsBC,uBAAiC,KAC/D,KAAajT,cAAkB,KAEvB,KAAyBkT,0BAAkB,KAE3C,KAAQtB,UAAY,EAGpB,KAAcuB,eAA0C,CAAC,EACzD,KAAcC,eAAG,EAEjB,KAASC,UAGN,KAEH,KAAUvJ,WAAkB,KAC5B,KAAcD,eAAkB,KAChC,KAAkByJ,oBAAG,EACrB,KAAsBC,uBAAG,EACzB,KAA0BC,2BAAG,EAE7B,KAAgBC,kBAAG,EACnB,KAA0BC,2BAAkB,KAC5C,KAA8BC,+BAAkB,KA+BlDtB,IAAkBlzB,IACpB,MAAM,IAAI/F,MACR,kFAIJq4B,GAAkBtC,cAAcT,GAAG,UAAW10B,KAAK45B,WAAY55B,OAEpB,IAAvC2vB,EAAUv1B,KAAKtH,QAAQ,YACzBmiC,GAAcE,cAAcT,GAAG,SAAU10B,KAAK65B,UAAW75B,MAInDyxB,WAAAA,CACRt2B,EACAgD,EACA27B,GAEA,MAAMC,IAAc/5B,KAAKo5B,eAEnBzH,EAAM,CAAEqI,EAAGD,EAAW7hC,EAAGiD,EAAQhD,EAAGgG,GAC1C6B,KAAKomB,KAAK1qB,EAAUi2B,IACpB3yB,EACEgB,KAAK84B,WACL,0DAEF94B,KAAKq5B,UAAU5H,YAAYE,GACvBmI,IACF95B,KAAKm5B,eAAeY,GAAaD,GAIrC5lC,GAAAA,CAAI6vB,GACF/jB,KAAKi6B,kBAEL,MAAM/uB,EAAW,IAAI1G,EAKf01B,EAAiB,CACrB/+B,OAAQ,IACR0X,QANc,CACdtT,EAAGwkB,EAAMoW,MAAMvd,WACfwd,EAAGrW,EAAMsW,cAKT5G,WAAav0B,IACX,MAAM9D,EAAU8D,EAAW,EACN,OAAjBA,EAAW,EACbgM,EAASxG,QAAQtJ,GAEjB8P,EAASzG,OAAOrJ,EACjB,GAGL4E,KAAK04B,iBAAiB7hC,KAAKqjC,GAC3Bl6B,KAAK44B,uBACL,MAAMjlB,EAAQ3T,KAAK04B,iBAAiBxmC,OAAS,EAM7C,OAJI8N,KAAK84B,YACP94B,KAAKs6B,SAAS3mB,GAGTzI,EAASvG,QAGlB41B,MAAAA,CACExW,EACAyW,EACAhmC,EACAi/B,GAEAzzB,KAAKi6B,kBAEL,MAAMQ,EAAU1W,EAAM2W,iBAChBlH,EAAazP,EAAMoW,MAAMvd,WAC/B5c,KAAKomB,KAAK,qBAAuBoN,EAAa,IAAMiH,GAC/Cz6B,KAAKw4B,QAAQvtB,IAAIuoB,IACpBxzB,KAAKw4B,QAAQrtB,IAAIqoB,EAAY,IAAI9oB,KAEnC1L,EACE+kB,EAAM4W,aAAaC,cAAgB7W,EAAM4W,aAAaE,eACtD,sDAEF77B,GACGgB,KAAKw4B,QAAQtkC,IAAIs/B,GAAavoB,IAAIwvB,GACnC,gDAEF,MAAMK,EAAyB,CAC7BrH,aACAsH,OAAQP,EACRzW,QACAvvB,OAEFwL,KAAKw4B,QAAQtkC,IAAIs/B,GAAaroB,IAAIsvB,EAASK,GAEvC96B,KAAK84B,YACP94B,KAAKg7B,YAAYF,GAIbR,QAAAA,CAAS3mB,GACf,MAAMzf,EAAM8L,KAAK04B,iBAAiB/kB,GAClC3T,KAAKyxB,YAAY,IAAKv9B,EAAI2e,SAAU3T,WAC3Bc,KAAK04B,iBAAiB/kB,GAC7B3T,KAAK44B,uBAC6B,IAA9B54B,KAAK44B,uBACP54B,KAAK04B,iBAAmB,IAEtBxkC,EAAIu/B,YACNv/B,EAAIu/B,WAAWv0B,EAChB,IAIG87B,WAAAA,CAAYF,GAClB,MAAM/W,EAAQ+W,EAAW/W,MACnByP,EAAazP,EAAMoW,MAAMvd,WACzB6d,EAAU1W,EAAM2W,iBACtB16B,KAAKomB,KAAK,aAAeoN,EAAa,QAAUiH,GAChD,MAAMQ,EAAgC,CAAW17B,EAAGi0B,GAKhDsH,EAAWtmC,MACbymC,EAAO,EAAIlX,EAAMsW,aACjBY,EAAO,EAAIH,EAAWtmC,KAGxBymC,EAAgB,EAAIH,EAAWC,SAE/B/6B,KAAKyxB,YAVU,IAUUwJ,GAAM/7B,IAC7B,MAAM9D,EAAmB8D,EAAoB,EACvCg8B,EAASh8B,EAAsB,EAGrC64B,GAAqBoD,sBAAsB//B,EAAS2oB,IAGlD/jB,KAAKw4B,QAAQtkC,IAAIs/B,IACjBxzB,KAAKw4B,QAAQtkC,IAAIs/B,GAAat/B,IAAIumC,MAEVK,IACxB96B,KAAKomB,KAAK,kBAAmBlnB,GAEd,OAAXg8B,GACFl7B,KAAKo7B,cAAc5H,EAAYiH,GAG7BK,EAAWrH,YACbqH,EAAWrH,WAAWyH,EAAQ9/B,GAEjC,IAIG,4BAAO+/B,CAAsB//B,EAAkB2oB,GACrD,GAAI3oB,GAA8B,kBAAZA,GAAwByL,EAASzL,EAAS,KAAM,CAEpE,MAAMigC,EAAWt0B,EAAQ3L,EAAgB,KACzC,GAAIkF,MAAMC,QAAQ86B,KAAcA,EAASvoC,QAAQ,YAAa,CAC5D,MAAMwoC,EACJ,gBAAkBvX,EAAM4W,aAAaY,WAAW3e,WAAa,IACzD4e,EAAYzX,EAAMoW,MAAMvd,WAC9B9M,GAEI,wGAA2CwrB,QACxCE,mDAER,CACF,EAGH5H,gBAAAA,CAAiBptB,GACfxG,KAAK8vB,WAAatpB,EAClBxG,KAAKomB,KAAK,wBACNpmB,KAAK8vB,WACP9vB,KAAKy7B,UAIDz7B,KAAK84B,YACP94B,KAAKyxB,YAAY,SAAU,CAAC,GAAG,SAInCzxB,KAAK07B,uCAAuCl1B,GAGtCk1B,sCAAAA,CAAuCC,IAGpBA,GAAoC,KAAtBA,EAAWzpC,Q9CjN/B,SAAUsU,GAC/B,MAAME,EAAiBH,EAAOC,GAAOE,OACrC,MAAyB,kBAAXA,IAA2C,IAApBA,EAAc,KACrD,C8C+M4Bk1B,CAAQD,MAC9B37B,KAAKomB,KACH,iEAEFpmB,KAAKg5B,mBAtT4B,KA0TrCnF,oBAAAA,CAAqBrtB,GACnBxG,KAAK6vB,eAAiBrpB,EACtBxG,KAAKomB,KAAK,6BACNpmB,KAAK6vB,eACP7vB,KAAK67B,cAKD77B,KAAK84B,YACP94B,KAAKyxB,YAAY,WAAY,CAAC,GAAG,SASvCgK,OAAAA,GACE,GAAIz7B,KAAK84B,YAAc94B,KAAK8vB,WAAY,CACtC,MAAMtpB,EAAQxG,KAAK8vB,WACbgM,E9C9PiB,SAAUt1B,GACrC,MACEE,EADcH,EAAOC,GACJE,OAEnB,QAASA,GAA4B,kBAAXA,GAAuBA,EAAOzD,eAAe,MACzE,C8CyPyB84B,CAAcv1B,GAAS,OAAS,QAC7Cw1B,EAAwC,CAAEC,KAAMz1B,GAC3B,OAAvBxG,KAAKq4B,cACP2D,EAAoB,QAAI,EACe,kBAAvBh8B,KAAKq4B,gBACrB2D,EAAqB,QAAIh8B,KAAKq4B,eAEhCr4B,KAAKyxB,YACHqK,EACAE,GACC70B,IACC,MAAM+zB,EAAS/zB,EAAkB,EAC3BjB,EAAQiB,EAAgB,GAAgB,QAE1CnH,KAAK8vB,aAAetpB,IACP,OAAX00B,EACFl7B,KAAKu5B,uBAAyB,EAG9Bv5B,KAAKk8B,eAAehB,EAAQh1B,GAE/B,GAGN,EAQH21B,WAAAA,GACM77B,KAAK84B,YAAc94B,KAAK6vB,gBAC1B7vB,KAAKyxB,YACH,WACA,CAAE,MAASzxB,KAAK6vB,iBACf1oB,IACC,MAAM+zB,EAAS/zB,EAAkB,EAC3BjB,EAAQiB,EAAgB,GAAgB,QAC/B,OAAX+zB,EACFl7B,KAAKw5B,2BAA6B,EAElCx5B,KAAKm8B,mBAAmBjB,EAAQh1B,EACjC,IAST8L,QAAAA,CAAS+R,EAAqBvvB,GAC5B,MAAMg/B,EAAazP,EAAMoW,MAAMvd,WACzB6d,EAAU1W,EAAM2W,iBAEtB16B,KAAKomB,KAAK,uBAAyBoN,EAAa,IAAMiH,GAEtDz7B,EACE+kB,EAAM4W,aAAaC,cAAgB7W,EAAM4W,aAAaE,eACtD,wDAEa76B,KAAKo7B,cAAc5H,EAAYiH,IAChCz6B,KAAK84B,YACjB94B,KAAKo8B,cAAc5I,EAAYiH,EAAS1W,EAAMsW,aAAc7lC,GAIxD4nC,aAAAA,CACN5I,EACAiH,EACA4B,EACA7nC,GAEAwL,KAAKomB,KAAK,eAAiBoN,EAAa,QAAUiH,GAElD,MAAMQ,EAAgC,CAAW17B,EAAGi0B,GAGhDh/B,IACFymC,EAAO,EAAIoB,EACXpB,EAAO,EAAIzmC,GAGbwL,KAAKyxB,YAPU,IAOUwJ,GAG3BnH,eAAAA,CACEN,EACAttB,EACAutB,GAEAzzB,KAAKi6B,kBAEDj6B,KAAK84B,WACP94B,KAAKs8B,kBAAkB,IAAK9I,EAAYttB,EAAMutB,GAE9CzzB,KAAK64B,0BAA0BhiC,KAAK,CAClC28B,aACAr4B,OAAQ,IACR+K,OACAutB,eAKNM,iBAAAA,CACEP,EACAttB,EACAutB,GAEAzzB,KAAKi6B,kBAEDj6B,KAAK84B,WACP94B,KAAKs8B,kBAAkB,KAAM9I,EAAYttB,EAAMutB,GAE/CzzB,KAAK64B,0BAA0BhiC,KAAK,CAClC28B,aACAr4B,OAAQ,KACR+K,OACAutB,eAKNO,kBAAAA,CACER,EACAC,GAEAzzB,KAAKi6B,kBAEDj6B,KAAK84B,WACP94B,KAAKs8B,kBAAkB,KAAM9I,EAAY,KAAMC,GAE/CzzB,KAAK64B,0BAA0BhiC,KAAK,CAClC28B,aACAr4B,OAAQ,KACR+K,KAAM,KACNutB,eAKE6I,iBAAAA,CACNnhC,EACAq4B,EACAttB,EACAutB,GAEA,MAAM5gB,EAAU,CAAWtT,EAAGi0B,EAAqBvgC,EAAGiT,GACtDlG,KAAKomB,KAAK,gBAAkBjrB,EAAQ0X,GACpC7S,KAAKyxB,YAAYt2B,EAAQ0X,GAAU0pB,IAC7B9I,GACF35B,YAAW,KACT25B,EACE8I,EAAuB,EACvBA,EAAuB,EACxB,GACAxc,KAAKI,MAAM,GACf,IAIL/G,GAAAA,CACEoa,EACAttB,EACAutB,EACAC,GAEA1zB,KAAKw8B,YAAY,IAAKhJ,EAAYttB,EAAMutB,EAAYC,GAGtDC,KAAAA,CACEH,EACAttB,EACAutB,EACAC,GAEA1zB,KAAKw8B,YAAY,IAAKhJ,EAAYttB,EAAMutB,EAAYC,GAGtD8I,WAAAA,CACErhC,EACAq4B,EACAttB,EACAutB,EACAC,GAEA1zB,KAAKi6B,kBAEL,MAAMpnB,EAAoC,CAC/BtT,EAAGi0B,EACHvgC,EAAGiT,QAGD/T,IAATuhC,IACF7gB,EAAoB,EAAI6gB,GAI1B1zB,KAAKy4B,iBAAiB5hC,KAAK,CACzBsE,SACA0X,UACA4gB,eAGFzzB,KAAK24B,uBACL,MAAMhlB,EAAQ3T,KAAKy4B,iBAAiBvmC,OAAS,EAEzC8N,KAAK84B,WACP94B,KAAKy8B,SAAS9oB,GAEd3T,KAAKomB,KAAK,kBAAoBoN,GAI1BiJ,QAAAA,CAAS9oB,GACf,MAAMxY,EAAS6E,KAAKy4B,iBAAiB9kB,GAAOxY,OACtC0X,EAAU7S,KAAKy4B,iBAAiB9kB,GAAOd,QACvC4gB,EAAazzB,KAAKy4B,iBAAiB9kB,GAAO8f,WAChDzzB,KAAKy4B,iBAAiB9kB,GAAO+oB,OAAS18B,KAAK84B,WAE3C94B,KAAKyxB,YAAYt2B,EAAQ0X,GAAU3T,IACjCc,KAAKomB,KAAKjrB,EAAS,YAAa+D,UAEzBc,KAAKy4B,iBAAiB9kB,GAC7B3T,KAAK24B,uBAG6B,IAA9B34B,KAAK24B,uBACP34B,KAAKy4B,iBAAmB,IAGtBhF,GACFA,EACEv0B,EAAsB,EACtBA,EAAsB,EAEzB,IAIL+0B,WAAAA,CAAYC,GAEV,GAAIl0B,KAAK84B,WAAY,CACnB,MAAMjmB,EAAU,CAAelgB,EAAGuhC,GAClCl0B,KAAKomB,KAAK,cAAevT,GAEzB7S,KAAKyxB,YAAsB,IAAK5e,GAAS7b,IAEvC,GAAe,OADAA,EAAqB,EACf,CACnB,MAAM2lC,EAAc3lC,EAAqB,EACzCgJ,KAAKomB,KAAK,cAAe,wBAA0BuW,EACpD,IAEJ,EAGKpK,cAAAA,CAAerzB,GACrB,GAAI,MAAOA,EAAS,CAElBc,KAAKomB,KAAK,gBAAkB1qB,EAAUwD,IACtC,MAAM09B,EAAS19B,EAAW,EACpB46B,EAAa95B,KAAKm5B,eAAeyD,GACnC9C,WACK95B,KAAKm5B,eAAeyD,GAC3B9C,EAAW56B,EAAoB,GAElC,KAAM,IAAI,UAAWA,EACpB,KAAM,qCAAuCA,EAAe,MACnD,MAAOA,GAEhBc,KAAK68B,YAAY39B,EAAW,EAAaA,EAAW,EACrD,EAGK29B,WAAAA,CAAY1hC,EAAgBgD,GAClC6B,KAAKomB,KAAK,sBAAuBjrB,EAAQgD,GAC1B,MAAXhD,EACF6E,KAAKg4B,cACH75B,EAAiB,EACjBA,EAAiB,GACL,EACZA,EAAQ,GAEU,MAAXhD,EACT6E,KAAKg4B,cACH75B,EAAiB,EACjBA,EAAiB,GACJ,EACbA,EAAQ,GAEU,MAAXhD,EACT6E,KAAK88B,iBACH3+B,EAAiB,EACjBA,EAAkB,GAEA,OAAXhD,EACT6E,KAAKk8B,eACH/9B,EAAwB,EACxBA,EAA0B,GAER,QAAXhD,EACT6E,KAAKm8B,mBACHh+B,EAAwB,EACxBA,EAA0B,GAER,OAAXhD,EACT6E,KAAK+8B,uBAAuB5+B,GAE5BwE,GACE,6CACEjH,EAAUP,GACV,sCAKA40B,QAAAA,CAASiD,EAAmBC,GAClCjzB,KAAKomB,KAAK,oBACVpmB,KAAK84B,YAAa,EAClB94B,KAAK25B,gCAAiC,IAAIzmC,MAAOE,UACjD4M,KAAKg9B,iBAAiBhK,GACtBhzB,KAAKgmB,cAAgBiN,EACjBjzB,KAAKy5B,kBACPz5B,KAAKi9B,oBAEPj9B,KAAKk9B,gBACLl9B,KAAKy5B,kBAAmB,EACxBz5B,KAAKi4B,kBAAiB,GAGhBkF,gBAAAA,CAAiBjc,GACvBliB,GACGgB,KAAKq5B,UACN,0DAGEr5B,KAAKk5B,2BACPrR,aAAa7nB,KAAKk5B,2BAMpBl5B,KAAKk5B,0BAA4Bp/B,YAAW,KAC1CkG,KAAKk5B,0BAA4B,KACjCl5B,KAAKo9B,sBAAsB,GAE1Brd,KAAKI,MAAMe,IAGR+Y,eAAAA,IACDj6B,KAAKq5B,WAAar5B,KAAKy5B,kBAC1Bz5B,KAAKm9B,iBAAiB,GAIlBvD,UAAAA,CAAW/B,GAGfA,IACC73B,KAAK43B,UACN53B,KAAK+4B,kBAAoB/4B,KAAKg5B,qBAE9Bh5B,KAAKomB,KAAK,2CACVpmB,KAAK+4B,gBAAkBjB,GAElB93B,KAAKq5B,WACRr5B,KAAKm9B,iBAAiB,IAG1Bn9B,KAAK43B,SAAWC,EAGVgC,SAAAA,CAAUwD,GACZA,GACFr9B,KAAKomB,KAAK,wBACVpmB,KAAK+4B,gBAAkBjB,GAClB93B,KAAKq5B,WACRr5B,KAAKm9B,iBAAiB,KAGxBn9B,KAAKomB,KAAK,8CACNpmB,KAAKq5B,WACPr5B,KAAKq5B,UAAU3d,SAKb4hB,qBAAAA,GAWN,GAVAt9B,KAAKomB,KAAK,4BACVpmB,KAAK84B,YAAa,EAClB94B,KAAKq5B,UAAY,KAGjBr5B,KAAKu9B,0BAGLv9B,KAAKm5B,eAAiB,CAAC,EAEnBn5B,KAAKw9B,mBAAoB,CAC3B,GAAKx9B,KAAK43B,UAIH,GAAI53B,KAAK25B,+BAAgC,EAG5C,IAAIzmC,MAAOE,UAAY4M,KAAK25B,+BAxuBA,MA0uB5B35B,KAAK+4B,gBAAkBjB,IAEzB93B,KAAK25B,+BAAiC,IACvC,OAXC35B,KAAKomB,KAAK,8CACVpmB,KAAK+4B,gBAAkB/4B,KAAKg5B,mBAC5Bh5B,KAAK05B,4BAA6B,IAAIxmC,MAAOE,UAW/C,MAAMqqC,GACJ,IAAIvqC,MAAOE,UAAY4M,KAAK05B,2BAC9B,IAAIgE,EAAiB3d,KAAKsX,IACxB,EACAr3B,KAAK+4B,gBAAkB0E,GAEzBC,EAAiB3d,KAAKmI,SAAWwV,EAEjC19B,KAAKomB,KAAK,0BAA4BsX,EAAiB,MACvD19B,KAAKm9B,iBAAiBO,GAGtB19B,KAAK+4B,gBAAkBhZ,KAAKG,IAC1BlgB,KAAKg5B,mBA7vBsB,IA8vB3Bh5B,KAAK+4B,gBAER,CACD/4B,KAAKi4B,kBAAiB,GAGhB,0BAAMmF,GACZ,GAAIp9B,KAAKw9B,mBAAoB,CAC3Bx9B,KAAKomB,KAAK,+BACVpmB,KAAK05B,4BAA6B,IAAIxmC,MAAOE,UAC7C4M,KAAK25B,+BAAiC,KACtC,MAAMgE,EAAgB39B,KAAKuyB,eAAerU,KAAKle,MACzC49B,EAAU59B,KAAK+vB,SAAS7R,KAAKle,MAC7BwmB,EAAexmB,KAAKs9B,sBAAsBpf,KAAKle,MAC/C2lB,EAAS3lB,KAAKud,GAAK,IAAMwa,GAAqB8F,oBAC9C7X,EAAgBhmB,KAAKgmB,cAC3B,IAAI8X,GAAW,EACXC,EAAgC,KACpC,MAAMC,EAAU,WACVD,EACFA,EAAWriB,SAEXoiB,GAAW,EACXtX,IAEJ,EACMyX,EAAgB,SAAUtM,GAC9B3yB,EACE++B,EACA,0DAEFA,EAAWtM,YAAYE,EACzB,EAEA3xB,KAAKq5B,UAAY,CACf3d,MAAOsiB,EACPvM,YAAawM,GAGf,MAAMvc,EAAe1hB,KAAKs5B,mBAC1Bt5B,KAAKs5B,oBAAqB,EAE1B,IAGE,MAAOxT,EAAWD,SAAuBjhB,QAAQ0H,IAAI,CACnDtM,KAAKm4B,mBAAmB1W,SAASC,GACjC1hB,KAAKo4B,uBAAuB3W,SAASC,KAGlCoc,EAoBH3oC,GAAI,0CAnBJA,GAAI,8CACJ6K,KAAK8vB,WAAahK,GAAaA,EAAUrD,YACzCziB,KAAK6vB,eAAiBhK,GAAiBA,EAAcrf,MACrDu3B,EAAa,IAAIrO,GACf/J,EACA3lB,KAAK2vB,UACL3vB,KAAK4vB,eACL5vB,KAAK6vB,eACL7vB,KAAK8vB,WACL6N,EACAC,EACApX,GACc8M,IACZxjB,GAAKwjB,EAAS,KAAOtzB,KAAK2vB,UAAU/S,WAAa,KACjD5c,KAAKk+B,UA7zBkB,cA6zBqB,GAE9ClY,GAKL,CAAC,MAAOrjB,IACP3C,KAAKomB,KAAK,wBAA0BzjB,IAC/Bm7B,IACC99B,KAAK2vB,UAAUvM,WAIjBtT,GAAKnN,IAEPq7B,IAEH,CACF,EAGHE,SAAAA,CAAU5K,GACRn+B,GAAI,uCAAyCm+B,GAC7CtzB,KAAKu4B,kBAAkBjF,IAAU,EAC7BtzB,KAAKq5B,UACPr5B,KAAKq5B,UAAU3d,SAEX1b,KAAKk5B,4BACPrR,aAAa7nB,KAAKk5B,2BAClBl5B,KAAKk5B,0BAA4B,MAE/Bl5B,KAAK84B,YACP94B,KAAKs9B,yBAKXa,MAAAA,CAAO7K,GACLn+B,GAAI,mCAAqCm+B,UAClCtzB,KAAKu4B,kBAAkBjF,GAC1BtsB,EAAQhH,KAAKu4B,qBACfv4B,KAAK+4B,gBAAkBjB,GAClB93B,KAAKq5B,WACRr5B,KAAKm9B,iBAAiB,IAKpBH,gBAAAA,CAAiBhK,GACvB,MAAMoL,EAAQpL,GAAY,IAAI9/B,MAAOE,UACrC4M,KAAKk4B,oBAAoB,CAAEmG,iBAAkBD,IAGvCb,uBAAAA,GACN,IAAK,IAAI7qC,EAAI,EAAGA,EAAIsN,KAAKy4B,iBAAiBvmC,OAAQQ,IAAK,CACrD,MAAM0mB,EAAMpZ,KAAKy4B,iBAAiB/lC,GAC9B0mB,GAAgB,MAAOA,EAAIvG,SAAWuG,EAAIsjB,SACxCtjB,EAAIqa,YACNra,EAAIqa,WAAW,qBAGVzzB,KAAKy4B,iBAAiB/lC,GAC7BsN,KAAK24B,uBAER,CAGiC,IAA9B34B,KAAK24B,uBACP34B,KAAKy4B,iBAAmB,IAIpBqE,gBAAAA,CAAiBtJ,EAAoBzP,GAE3C,IAAI0W,EAIFA,EAHG1W,EAGOA,EAAMjrB,KAAIshC,GAAKjb,GAAkBib,KAAIh5B,KAAK,KAF1C,UAIZ,MAAMm5B,EAASv6B,KAAKo7B,cAAc5H,EAAYiH,GAC1CF,GAAUA,EAAO9G,YACnB8G,EAAO9G,WAAW,qBAId2H,aAAAA,CAAc5H,EAAoBiH,GACxC,MAAM6D,EAAuB,IAAIjJ,GAAK7B,GAAY5W,WAClD,IAAI2d,EACJ,GAAIv6B,KAAKw4B,QAAQvtB,IAAIqzB,GAAuB,CAC1C,MAAMxlC,EAAMkH,KAAKw4B,QAAQtkC,IAAIoqC,GAC7B/D,EAASzhC,EAAI5E,IAAIumC,GACjB3hC,EAAIoT,OAAOuuB,GACM,IAAb3hC,EAAImyB,MACNjrB,KAAKw4B,QAAQtsB,OAAOoyB,EAEvB,MAEC/D,OAASpoC,EAEX,OAAOooC,EAGD2B,cAAAA,CAAeqC,EAAoBC,GACzCrpC,GAAI,uBAAyBopC,EAAa,IAAMC,GAChDx+B,KAAK8vB,WAAa,KAClB9vB,KAAKs5B,oBAAqB,EAC1Bt5B,KAAKq5B,UAAU3d,QACI,kBAAf6iB,GAAiD,sBAAfA,IAIpCv+B,KAAKu5B,yBACDv5B,KAAKu5B,wBA56BiB,IA86BxBv5B,KAAK+4B,gBAp7B0B,IAw7B/B/4B,KAAKm4B,mBAAmBrW,0BAKtBqa,kBAAAA,CAAmBoC,EAAoBC,GAC7CrpC,GAAI,4BAA8BopC,EAAa,IAAMC,GACrDx+B,KAAK6vB,eAAiB,KACtB7vB,KAAKs5B,oBAAqB,EAGP,kBAAfiF,GAAiD,sBAAfA,IAIpCv+B,KAAKw5B,6BACDx5B,KAAKw5B,4BAl8BiB,GAm8BxBx5B,KAAKo4B,uBAAuBtW,yBAK1Bib,sBAAAA,CAAuB5+B,GACzB6B,KAAKi5B,uBACPj5B,KAAKi5B,uBAAuB96B,GAExB,QAASA,GACXjJ,QAAQC,IACN,aAAgBgJ,EAAU,IAAaqE,QAAQ,KAAM,iBAMrD06B,aAAAA,GAENl9B,KAAKy7B,UACLz7B,KAAK67B,cAIL,IAAK,MAAM4C,KAAWz+B,KAAKw4B,QAAQnsB,SACjC,IAAK,MAAMyuB,KAAc2D,EAAQpyB,SAC/BrM,KAAKg7B,YAAYF,GAIrB,IAAK,IAAIpoC,EAAI,EAAGA,EAAIsN,KAAKy4B,iBAAiBvmC,OAAQQ,IAC5CsN,KAAKy4B,iBAAiB/lC,IACxBsN,KAAKy8B,SAAS/pC,GAIlB,KAAOsN,KAAK64B,0BAA0B3mC,QAAQ,CAC5C,MAAM2gB,EAAU7S,KAAK64B,0BAA0BjlB,QAC/C5T,KAAKs8B,kBACHzpB,EAAQ1X,OACR0X,EAAQ2gB,WACR3gB,EAAQ3M,KACR2M,EAAQ4gB,WAEX,CAED,IAAK,IAAI/gC,EAAI,EAAGA,EAAIsN,KAAK04B,iBAAiBxmC,OAAQQ,IAC5CsN,KAAK04B,iBAAiBhmC,IACxBsN,KAAKs6B,SAAS5nC,GAQZuqC,iBAAAA,GACN,MAAM/I,EAAiC,CAAC,EAExC,IAAIwK,EAAa,KACbv5B,MAEAu5B,EADE1+B,KAAK2vB,UAAUvM,UACJ,aAEA,QAIjB8Q,EAAM,OAASwK,EAAa,IAAMviB,GAAY3Z,QAAQ,MAAO,MAAQ,EAEjEyC,IACFivB,EAAM,qBAAuB,EjDt7BV,kBAAdlvB,WAAmD,gBAAzBA,UAAmB,UiDw7BlDkvB,EAAM,yBAA2B,GAEnCl0B,KAAKi0B,YAAYC,GAGXsJ,gBAAAA,GACN,MAAMH,EAASpI,GAAcE,cAAcC,kBAC3C,OAAOpuB,EAAQhH,KAAKu4B,oBAAsB8E,GAn8B7BtF,GAA2BO,4BAAG,EAK9BP,GAAiB8F,kBAAG,QCQxBc,GACXv8B,WAAAA,CAAmBhQ,EAAqBwsC,GAArB,KAAIxsC,KAAJA,EAAqB,KAAIwsC,KAAJA,EAExC,WAAOC,CAAKzsC,EAAcwsC,GACxB,OAAO,IAAID,GAAUvsC,EAAMwsC,UChITE,GASpBC,UAAAA,GACE,OAAO/+B,KAAKg/B,QAAQ9gB,KAAKle,MAU3Bi/B,mBAAAA,CAAoBC,EAAeC,GACjC,MAAMC,EAAa,IAAIT,GAAUhgB,GAAUugB,GACrCG,EAAa,IAAIV,GAAUhgB,GAAUwgB,GAC3C,OAAgD,IAAzCn/B,KAAKg/B,QAAQI,EAAYC,GAOlCC,OAAAA,GAEE,OAAQX,GAAkBY,KC5B9B,IAAIC,GAEE,MAAOC,WAAiBX,GAC5B,uBAAWU,GACT,OAAOA,GAGT,uBAAWA,CAAatwB,GACtBswB,GAAetwB,EAEjB8vB,OAAAA,CAAQ9mC,EAAcC,GACpB,OAAO0mB,GAAY3mB,EAAE9F,KAAM+F,EAAE/F,MAE/BstC,WAAAA,CAAYd,GAGV,MAAMz/B,EAAe,mDAEvB8/B,mBAAAA,CAAoBC,EAAeC,GACjC,OAAO,EAETG,OAAAA,GAEE,OAAQX,GAAkBY,IAE5BI,OAAAA,GAGE,OAAO,IAAIhB,GAAU/f,GAAU4gB,IAGjCI,QAAAA,CAASC,EAAoBztC,GAM3B,OALA4M,EACwB,kBAAf6gC,EACP,gDAGK,IAAIlB,GAAUkB,EAAYL,IAMnC5iB,QAAAA,GACE,MAAO,QAIJ,MAAMkjB,GAAY,IAAIL,SC/BhBM,GAOX39B,WAAAA,CACEw8B,EACAoB,EACAC,EACQC,GACmD,IAAnDC,EAAAluC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAA+C,KAD/C,KAAUiuC,WAAVA,EACA,KAAgBC,iBAAhBA,EAXF,KAAUC,WAAgD,GAahE,IAAIC,EAAM,EACV,MAAQzB,EAAK53B,WAQX,GANAq5B,EAAML,EAAWC,EAAWrB,EAAKznC,IAAK6oC,GAAY,EAE9CE,IACFG,IAAQ,GAGNA,EAAM,EAGNzB,EADE5+B,KAAKkgC,WACAtB,EAAKhqC,KAELgqC,EAAK0B,UAET,IAAY,IAARD,EAAW,CAEpBrgC,KAAKogC,WAAWvpC,KAAK+nC,GACrB,KACD,CAEC5+B,KAAKogC,WAAWvpC,KAAK+nC,GAEnBA,EADE5+B,KAAKkgC,WACAtB,EAAK0B,MAEL1B,EAAKhqC,IAEf,EAIL2rC,OAAAA,GACE,GAA+B,IAA3BvgC,KAAKogC,WAAWluC,OAClB,OAAO,KAGT,IACI8E,EADA4nC,EAAO5+B,KAAKogC,WAAWnlB,MAQ3B,GALEjkB,EADEgJ,KAAKmgC,iBACEngC,KAAKmgC,iBAAiBvB,EAAKznC,IAAKynC,EAAKjgC,OAErC,CAAExH,IAAKynC,EAAKznC,IAAKwH,MAAOigC,EAAKjgC,OAGpCqB,KAAKkgC,WAEP,IADAtB,EAAOA,EAAKhqC,MACJgqC,EAAK53B,WACXhH,KAAKogC,WAAWvpC,KAAK+nC,GACrBA,EAAOA,EAAK0B,WAId,IADA1B,EAAOA,EAAK0B,OACJ1B,EAAK53B,WACXhH,KAAKogC,WAAWvpC,KAAK+nC,GACrBA,EAAOA,EAAKhqC,KAIhB,OAAOoC,EAGTwpC,OAAAA,GACE,OAAOxgC,KAAKogC,WAAWluC,OAAS,EAGlCuuC,IAAAA,GACE,GAA+B,IAA3BzgC,KAAKogC,WAAWluC,OAClB,OAAO,KAGT,MAAM0sC,EAAO5+B,KAAKogC,WAAWpgC,KAAKogC,WAAWluC,OAAS,GACtD,OAAI8N,KAAKmgC,iBACAngC,KAAKmgC,iBAAiBvB,EAAKznC,IAAKynC,EAAKjgC,OAErC,CAAExH,IAAKynC,EAAKznC,IAAKwH,MAAOigC,EAAKjgC,cAQ7B+hC,GAYXt+B,WAAAA,CACSjL,EACAwH,EACPgiC,EACA/rC,EACA0rC,GAJO,KAAGnpC,IAAHA,EACA,KAAKwH,MAALA,EAKPqB,KAAK2gC,MAAiB,MAATA,EAAgBA,EAAQD,GAASE,IAC9C5gC,KAAKpL,KACK,MAARA,EAAeA,EAAQisC,GAAUC,WACnC9gC,KAAKsgC,MACM,MAATA,EAAgBA,EAASO,GAAUC,WAgBvCC,IAAAA,CACE5pC,EACAwH,EACAgiC,EACA/rC,EACA0rC,GAEA,OAAO,IAAII,GACF,MAAPvpC,EAAcA,EAAM6I,KAAK7I,IAChB,MAATwH,EAAgBA,EAAQqB,KAAKrB,MACpB,MAATgiC,EAAgBA,EAAQ3gC,KAAK2gC,MACrB,MAAR/rC,EAAeA,EAAOoL,KAAKpL,KAClB,MAAT0rC,EAAgBA,EAAQtgC,KAAKsgC,OAOjCvkC,KAAAA,GACE,OAAOiE,KAAKpL,KAAKmH,QAAU,EAAIiE,KAAKsgC,MAAMvkC,QAM5CiL,OAAAA,GACE,OAAO,EAYTg6B,gBAAAA,CAAiB7lC,GACf,OACE6E,KAAKpL,KAAKosC,iBAAiB7lC,MACzBA,EAAO6E,KAAK7I,IAAK6I,KAAKrB,QACxBqB,KAAKsgC,MAAMU,iBAAiB7lC,GAYhC8lC,gBAAAA,CAAiB9lC,GACf,OACE6E,KAAKsgC,MAAMW,iBAAiB9lC,IAC5BA,EAAO6E,KAAK7I,IAAK6I,KAAKrB,QACtBqB,KAAKpL,KAAKqsC,iBAAiB9lC,GAOvB+lC,IAAAA,GACN,OAAIlhC,KAAKpL,KAAKoS,UACLhH,KAECA,KAAKpL,KAAwBssC,OAOzCC,MAAAA,GACE,OAAOnhC,KAAKkhC,OAAO/pC,IAMrBiqC,MAAAA,GACE,OAAIphC,KAAKsgC,MAAMt5B,UACNhH,KAAK7I,IAEL6I,KAAKsgC,MAAMc,SAUtBC,MAAAA,CAAOlqC,EAAQwH,EAAUshC,GACvB,IAAIn3B,EAAoB9I,KACxB,MAAMqgC,EAAMJ,EAAW9oC,EAAK2R,EAAE3R,KAc9B,OAZE2R,EADEu3B,EAAM,EACJv3B,EAAEi4B,KAAK,KAAM,KAAM,KAAMj4B,EAAElU,KAAKysC,OAAOlqC,EAAKwH,EAAOshC,GAAa,MACnD,IAARI,EACLv3B,EAAEi4B,KAAK,KAAMpiC,EAAO,KAAM,KAAM,MAEhCmK,EAAEi4B,KACJ,KACA,KACA,KACA,KACAj4B,EAAEw3B,MAAMe,OAAOlqC,EAAKwH,EAAOshC,IAGxBn3B,EAAEw4B,SAMHC,UAAAA,GACN,GAAIvhC,KAAKpL,KAAKoS,UACZ,OAAO65B,GAAUC,WAEnB,IAAIh4B,EAAoB9I,KAKxB,OAJK8I,EAAElU,KAAK4sC,UAAa14B,EAAElU,KAAKA,KAAK4sC,WACnC14B,EAAIA,EAAE24B,gBAER34B,EAAIA,EAAEi4B,KAAK,KAAM,KAAM,KAAOj4B,EAAElU,KAAwB2sC,aAAc,MAC/Dz4B,EAAEw4B,SAQX3kB,MAAAA,CACExlB,EACA8oC,GAEA,IAAIn3B,EAAG44B,EAEP,GADA54B,EAAI9I,KACAigC,EAAW9oC,EAAK2R,EAAE3R,KAAO,EACtB2R,EAAElU,KAAKoS,WAAc8B,EAAElU,KAAK4sC,UAAa14B,EAAElU,KAAKA,KAAK4sC,WACxD14B,EAAIA,EAAE24B,gBAER34B,EAAIA,EAAEi4B,KAAK,KAAM,KAAM,KAAMj4B,EAAElU,KAAK+nB,OAAOxlB,EAAK8oC,GAAa,UACxD,CAOL,GANIn3B,EAAElU,KAAK4sC,WACT14B,EAAIA,EAAE64B,gBAEH74B,EAAEw3B,MAAMt5B,WAAc8B,EAAEw3B,MAAMkB,UAAa14B,EAAEw3B,MAAM1rC,KAAK4sC,WAC3D14B,EAAIA,EAAE84B,iBAEuB,IAA3B3B,EAAW9oC,EAAK2R,EAAE3R,KAAY,CAChC,GAAI2R,EAAEw3B,MAAMt5B,UACV,OAAO65B,GAAUC,WAEjBY,EAAY54B,EAAEw3B,MAAyBY,OACvCp4B,EAAIA,EAAEi4B,KACJW,EAASvqC,IACTuqC,EAAS/iC,MACT,KACA,KACCmK,EAAEw3B,MAAyBiB,aAGjC,CACDz4B,EAAIA,EAAEi4B,KAAK,KAAM,KAAM,KAAM,KAAMj4B,EAAEw3B,MAAM3jB,OAAOxlB,EAAK8oC,GACxD,CACD,OAAOn3B,EAAEw4B,SAMXE,MAAAA,GACE,OAAOxhC,KAAK2gC,MAMNW,MAAAA,GACN,IAAIx4B,EAAoB9I,KAUxB,OATI8I,EAAEw3B,MAAMkB,WAAa14B,EAAElU,KAAK4sC,WAC9B14B,EAAIA,EAAE+4B,eAEJ/4B,EAAElU,KAAK4sC,UAAY14B,EAAElU,KAAKA,KAAK4sC,WACjC14B,EAAIA,EAAE64B,gBAEJ74B,EAAElU,KAAK4sC,UAAY14B,EAAEw3B,MAAMkB,WAC7B14B,EAAIA,EAAEg5B,cAEDh5B,EAMD24B,YAAAA,GACN,IAAI34B,EAAI9I,KAAK8hC,aAYb,OAXIh5B,EAAEw3B,MAAM1rC,KAAK4sC,WACf14B,EAAIA,EAAEi4B,KACJ,KACA,KACA,KACA,KACCj4B,EAAEw3B,MAAyBqB,gBAE9B74B,EAAIA,EAAE+4B,cACN/4B,EAAIA,EAAEg5B,cAEDh5B,EAMD84B,aAAAA,GACN,IAAI94B,EAAI9I,KAAK8hC,aAKb,OAJIh5B,EAAElU,KAAKA,KAAK4sC,WACd14B,EAAIA,EAAE64B,eACN74B,EAAIA,EAAEg5B,cAEDh5B,EAMD+4B,WAAAA,GACN,MAAME,EAAK/hC,KAAK+gC,KAAK,KAAM,KAAML,GAASE,IAAK,KAAM5gC,KAAKsgC,MAAM1rC,MAChE,OAAOoL,KAAKsgC,MAAMS,KAAK,KAAM,KAAM/gC,KAAK2gC,MAAOoB,EAAI,MAM7CJ,YAAAA,GACN,MAAMK,EAAKhiC,KAAK+gC,KAAK,KAAM,KAAML,GAASE,IAAK5gC,KAAKpL,KAAK0rC,MAAO,MAChE,OAAOtgC,KAAKpL,KAAKmsC,KAAK,KAAM,KAAM/gC,KAAK2gC,MAAO,KAAMqB,GAM9CF,UAAAA,GACN,MAAMltC,EAAOoL,KAAKpL,KAAKmsC,KAAK,KAAM,MAAO/gC,KAAKpL,KAAK+rC,MAAO,KAAM,MAC1DL,EAAQtgC,KAAKsgC,MAAMS,KAAK,KAAM,MAAO/gC,KAAKsgC,MAAMK,MAAO,KAAM,MACnE,OAAO3gC,KAAK+gC,KAAK,KAAM,MAAO/gC,KAAK2gC,MAAO/rC,EAAM0rC,GAQ1C2B,cAAAA,GACN,MAAMC,EAAaliC,KAAKmiC,SACxB,OAAOpiB,KAAKE,IAAI,EAAKiiB,IAAeliC,KAAKjE,QAAU,EAGrDomC,MAAAA,GACE,GAAIniC,KAAKwhC,UAAYxhC,KAAKpL,KAAK4sC,SAC7B,MAAM,IAAIpiC,MACR,0BAA4BY,KAAK7I,IAAM,IAAM6I,KAAKrB,MAAQ,KAG9D,GAAIqB,KAAKsgC,MAAMkB,SACb,MAAM,IAAIpiC,MACR,mBAAqBY,KAAK7I,IAAM,IAAM6I,KAAKrB,MAAQ,YAGvD,MAAMujC,EAAaliC,KAAKpL,KAAKutC,SAC7B,GAAID,IAAeliC,KAAKsgC,MAAM6B,SAC5B,MAAM,IAAI/iC,MAAM,uBAEhB,OAAO8iC,GAAcliC,KAAKwhC,SAAW,EAAI,IApStCd,GAAGE,KAAG,EACNF,GAAK0B,OAAG,QAsZJvB,GAUXz+B,WAAAA,CACUigC,GAG6D,IAF7DC,EAEkBrwC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAA4uC,GAAUC,WAH5B,KAAWuB,YAAXA,EACA,KAAKC,MAALA,EAaVjB,MAAAA,CAAOlqC,EAAQwH,GACb,OAAO,IAAIkiC,GACT7gC,KAAKqiC,YACLriC,KAAKsiC,MACFjB,OAAOlqC,EAAKwH,EAAOqB,KAAKqiC,aACxBtB,KAAK,KAAM,KAAML,GAAS0B,MAAO,KAAM,OAU9CzlB,MAAAA,CAAOxlB,GACL,OAAO,IAAI0pC,GACT7gC,KAAKqiC,YACLriC,KAAKsiC,MACF3lB,OAAOxlB,EAAK6I,KAAKqiC,aACjBtB,KAAK,KAAM,KAAML,GAAS0B,MAAO,KAAM,OAW9CluC,GAAAA,CAAIiD,GACF,IAAIkpC,EACAzB,EAAO5+B,KAAKsiC,MAChB,MAAQ1D,EAAK53B,WAAW,CAEtB,GADAq5B,EAAMrgC,KAAKqiC,YAAYlrC,EAAKynC,EAAKznC,KACrB,IAARkpC,EACF,OAAOzB,EAAKjgC,MACH0hC,EAAM,EACfzB,EAAOA,EAAKhqC,KACHyrC,EAAM,IACfzB,EAAOA,EAAK0B,MAEf,CACD,OAAO,KAQTiC,iBAAAA,CAAkBprC,GAChB,IAAIkpC,EACFzB,EAAO5+B,KAAKsiC,MACZE,EAAc,KAChB,MAAQ5D,EAAK53B,WAAW,CAEtB,GADAq5B,EAAMrgC,KAAKqiC,YAAYlrC,EAAKynC,EAAKznC,KACrB,IAARkpC,EAAW,CACb,GAAKzB,EAAKhqC,KAAKoS,UAMR,OAAIw7B,EACFA,EAAYrrC,IAEZ,KAPP,IADAynC,EAAOA,EAAKhqC,MACJgqC,EAAK0B,MAAMt5B,WACjB43B,EAAOA,EAAK0B,MAEd,OAAO1B,EAAKznC,GAMf,CAAUkpC,EAAM,EACfzB,EAAOA,EAAKhqC,KACHyrC,EAAM,IACfmC,EAAc5D,EACdA,EAAOA,EAAK0B,MAEf,CAED,MAAM,IAAIlhC,MACR,yEAOJ4H,OAAAA,GACE,OAAOhH,KAAKsiC,MAAMt7B,UAMpBjL,KAAAA,GACE,OAAOiE,KAAKsiC,MAAMvmC,QAMpBolC,MAAAA,GACE,OAAOnhC,KAAKsiC,MAAMnB,SAMpBC,MAAAA,GACE,OAAOphC,KAAKsiC,MAAMlB,SAYpBJ,gBAAAA,CAAiB7lC,GACf,OAAO6E,KAAKsiC,MAAMtB,iBAAiB7lC,GAWrC8lC,gBAAAA,CAAiB9lC,GACf,OAAO6E,KAAKsiC,MAAMrB,iBAAiB9lC,GAOrCsnC,WAAAA,CACEC,GAEA,OAAO,IAAI3C,GACT//B,KAAKsiC,MACL,KACAtiC,KAAKqiC,aACL,EACAK,GAIJC,eAAAA,CACExrC,EACAurC,GAEA,OAAO,IAAI3C,GACT//B,KAAKsiC,MACLnrC,EACA6I,KAAKqiC,aACL,EACAK,GAIJE,sBAAAA,CACEzrC,EACAurC,GAEA,OAAO,IAAI3C,GACT//B,KAAKsiC,MACLnrC,EACA6I,KAAKqiC,aACL,EACAK,GAIJG,kBAAAA,CACEH,GAEA,OAAO,IAAI3C,GACT//B,KAAKsiC,MACL,KACAtiC,KAAKqiC,aACL,EACAK,IC1vBU,SAAAI,GAAqBluC,EAAiB0rC,GACpD,OAAOzhB,GAAYjqB,EAAKxC,KAAMkuC,EAAMluC,KACtC,CAEgB,SAAA2wC,GAAgBnuC,EAAc0rC,GAC5C,OAAOzhB,GAAYjqB,EAAM0rC,EAC3B,CCHA,IAAI0C,GFwiBKnC,GAAAC,WAAa,UAnGpBC,IAAAA,CACE5pC,EACAwH,EACAgiC,EACA/rC,EACA0rC,GAEA,OAAOtgC,KAWTqhC,MAAAA,CAAOlqC,EAAQwH,EAAUshC,GACvB,OAAO,IAAIS,GAASvpC,EAAKwH,EAAO,MAUlCge,MAAAA,CAAOxlB,EAAQ8oC,GACb,OAAOjgC,KAMTjE,KAAAA,GACE,OAAO,EAMTiL,OAAAA,GACE,OAAO,EAWTg6B,gBAAAA,CAAiB7lC,GACf,OAAO,EAWT8lC,gBAAAA,CAAiB9lC,GACf,OAAO,EAGTgmC,MAAAA,GACE,OAAO,KAGTC,MAAAA,GACE,OAAO,KAGTe,MAAAA,GACE,OAAO,EAMTX,MAAAA,GACE,OAAO,IEthBJ,MAAMyB,GAAmB,SAAUC,GACxC,MAAwB,kBAAbA,EACF,UAAYzjB,GAAsByjB,GAElC,UAAYA,CAEvB,EAKaC,GAAuB,SAAUC,GAC5C,GAAIA,EAAaC,aAAc,CAC7B,MAAMn0B,EAAMk0B,EAAal0B,MACzBlQ,EACiB,kBAARkQ,GACU,kBAARA,GACS,kBAARA,GAAoBrI,EAASqI,EAAkB,OACzD,uCAEH,MACClQ,EACEokC,IAAiBJ,IAAYI,EAAap8B,UAC1C,gCAIJhI,EACEokC,IAAiBJ,IAAYI,EAAaE,cAAct8B,UACxD,qDAEJ,EC3BA,IAAIu8B,GCXAC,GACAC,SDiBSC,GAsBXthC,WAAAA,CACmBuhC,GAC0D,IAAnEC,EAAA3xC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAsByxC,GAASH,0BAA0BzC,WADhD,KAAM6C,OAANA,EACT,KAAaC,cAAbA,EATF,KAASC,UAAkB,KAWjC7kC,OACkB7M,IAAhB6N,KAAK2jC,QAAwC,OAAhB3jC,KAAK2jC,OAClC,4DAGFR,GAAqBnjC,KAAK4jC,eA9B5B,oCAAWL,CAA0Br0B,GACnCq0B,GAA4Br0B,EAG9B,oCAAWq0B,GACT,OAAOA,GA6BTF,UAAAA,GACE,OAAO,EAITC,WAAAA,GACE,OAAOtjC,KAAK4jC,cAIdE,cAAAA,CAAeC,GACb,OAAO,IAAIL,GAAS1jC,KAAK2jC,OAAQI,GAInCC,iBAAAA,CAAkBC,GAEhB,MAAkB,cAAdA,EACKjkC,KAAK4jC,cAELF,GAASH,0BAA0BzC,WAK9CoD,QAAAA,CAASrO,GACP,OAAIW,GAAYX,GACP71B,KACyB,cAAvB41B,GAAaC,GACf71B,KAAK4jC,cAELF,GAASH,0BAA0BzC,WAG9CqD,QAAAA,GACE,OAAO,EAITC,uBAAAA,CAAwBH,EAAmBI,GACzC,OAAO,KAITC,oBAAAA,CAAqBL,EAAmBM,GACtC,MAAkB,cAAdN,EACKjkC,KAAK8jC,eAAeS,GAClBA,EAAav9B,WAA2B,cAAdi9B,EAC5BjkC,KAEA0jC,GAASH,0BAA0BzC,WAAWwD,qBACnDL,EACAM,GACAT,eAAe9jC,KAAK4jC,eAK1BY,WAAAA,CAAY3O,EAAY0O,GACtB,MAAME,EAAQ7O,GAAaC,GAC3B,OAAc,OAAV4O,EACKF,EACEA,EAAav9B,WAAuB,cAAVy9B,EAC5BzkC,MAEPhB,EACY,cAAVylC,GAAiD,IAAxB3O,GAAcD,GACvC,8CAGK71B,KAAKskC,qBACVG,EACAf,GAASH,0BAA0BzC,WAAW0D,YAC5CzO,GAAaF,GACb0O,KAORv9B,OAAAA,GACE,OAAO,EAIT09B,WAAAA,GACE,OAAO,EAITC,YAAAA,CAAahxB,EAAcxY,GACzB,OAAO,EAET+T,GAAAA,CAAI01B,GACF,OAAIA,IAAiB5kC,KAAKsjC,cAAct8B,UAC/B,CACL,SAAUhH,KAAK6kC,WACf,YAAa7kC,KAAKsjC,cAAcp0B,OAG3BlP,KAAK6kC,WAKhBnR,IAAAA,GACE,GAAuB,OAAnB1zB,KAAK6jC,UAAoB,CAC3B,IAAIiB,EAAS,GACR9kC,KAAK4jC,cAAc58B,YACtB89B,GACE,YACA7B,GAAiBjjC,KAAK4jC,cAAc10B,OACpC,KAGJ,MAAMtQ,SAAcoB,KAAK2jC,OACzBmB,GAAUlmC,EAAO,IAEfkmC,GADW,WAATlmC,EACQ6gB,GAAsBzf,KAAK2jC,QAE3B3jC,KAAK2jC,OAEjB3jC,KAAK6jC,UAAYrmB,GAAKsnB,EACvB,CACD,OAAO9kC,KAAK6jC,UAOdgB,QAAAA,GACE,OAAO7kC,KAAK2jC,OAEdoB,SAAAA,CAAUhO,GACR,OAAIA,IAAU2M,GAASH,0BAA0BzC,WACxC,EACE/J,aAAiB2M,GAASH,2BAC3B,GAERvkC,EAAO+3B,EAAMsM,aAAc,qBACpBrjC,KAAKglC,mBAAmBjO,IAO3BiO,kBAAAA,CAAmBC,GACzB,MAAMC,SAAuBD,EAAUtB,OACjCwB,SAAsBnlC,KAAK2jC,OAC3ByB,EAAa1B,GAAS2B,iBAAiBvyC,QAAQoyC,GAC/CI,EAAY5B,GAAS2B,iBAAiBvyC,QAAQqyC,GAGpD,OAFAnmC,EAAOomC,GAAc,EAAG,sBAAwBF,GAChDlmC,EAAOsmC,GAAa,EAAG,sBAAwBH,GAC3CC,IAAeE,EAEI,WAAjBH,EAEK,EAGHnlC,KAAK2jC,OAASsB,EAAUtB,QAClB,EACC3jC,KAAK2jC,SAAWsB,EAAUtB,OAC5B,EAEA,EAIJ2B,EAAYF,EAGvBG,SAAAA,GACE,OAAOvlC,KAETwlC,SAAAA,GACE,OAAO,EAETC,MAAAA,CAAO1O,GACL,GAAIA,IAAU/2B,KACZ,OAAO,EACF,GAAI+2B,EAAMsM,aAAc,CAC7B,MAAM4B,EAAYlO,EAClB,OACE/2B,KAAK2jC,SAAWsB,EAAUtB,QAC1B3jC,KAAK4jC,cAAc6B,OAAOR,EAAUrB,cAEvC,CACC,OAAO,GArNJF,GAAgB2B,iBAAG,CAAC,SAAU,UAAW,SAAU,UCkBrD,MAAMK,GAAiB,IAtCxB,cAA6B5G,GACjCE,OAAAA,CAAQ9mC,EAAcC,GACpB,MAAMwtC,EAAYztC,EAAE0mC,KAAK0E,cACnBsC,EAAYztC,EAAEymC,KAAK0E,cACnBuC,EAAWF,EAAUZ,UAAUa,GACrC,OAAiB,IAAbC,EACKhnB,GAAY3mB,EAAE9F,KAAM+F,EAAE/F,MAEtByzC,EAGXnG,WAAAA,CAAYd,GACV,OAAQA,EAAK0E,cAAct8B,UAE7Bi4B,mBAAAA,CAAoBC,EAAeC,GACjC,OAAQD,EAAQoE,cAAcmC,OAAOtG,EAAQmE,eAE/ChE,OAAAA,GAEE,OAAQX,GAAkBY,IAE5BI,OAAAA,GACE,OAAO,IAAIhB,GAAU/f,GAAU,IAAI8kB,GAAS,kBAAmBD,KAGjE7D,QAAAA,CAASC,EAAqBztC,GAC5B,MAAMgxC,EAAeI,GAAa3D,GAClC,OAAO,IAAIlB,GAAUvsC,EAAM,IAAIsxC,GAAS,kBAAmBN,IAM7DxmB,QAAAA,GACE,MAAO,cC/CLkpB,GAAQ/lB,KAAK5qB,IAAI,GAEvB,MAAM4wC,GAKJ3jC,WAAAA,CAAYlQ,GACQ8zC,MAIlBhmC,KAAKjE,OAJaiqC,EAII9zC,EAAS,EAF7B+K,SAAU8iB,KAAK5qB,IAAI6wC,GAAOF,GAAe,KAG3C9lC,KAAKimC,SAAWjmC,KAAKjE,MAAQ,EAC7B,MAAMmqC,GAHW5lB,EAGItgB,KAAKjE,MAHQkB,SAASqD,MAAMggB,EAAO,GAAGlf,KAAK,KAAM,IAArDkf,MAIjBtgB,KAAKmmC,MAASj0C,EAAS,EAAKg0C,EAG9BE,YAAAA,GAEE,MAAMpvC,IAAWgJ,KAAKmmC,MAAS,GAAOnmC,KAAKimC,UAE3C,OADAjmC,KAAKimC,WACEjvC,GAiBJ,MAAMqvC,GAAgB,SAC3BC,EACAjG,EACAkG,EACAC,GAEAF,EAAUz0B,KAAKwuB,GAEf,MAAMoG,EAAoB,SACxBC,EACAjpB,GAEA,MAAMvrB,EAASurB,EAAOipB,EACtB,IAAIC,EACAxvC,EACJ,GAAe,IAAXjF,EACF,OAAO,KACF,GAAe,IAAXA,EAGT,OAFAy0C,EAAYL,EAAUI,GACtBvvC,EAAMovC,EAAQA,EAAMI,GAAcA,EAC3B,IAAIjG,GACTvpC,EACAwvC,EAAU/H,KACV8B,GAAS0B,MACT,KACA,MAEG,CAEL,MAAMwE,EAAS3pC,SAAU/K,EAAS,EAAW,IAAMw0C,EAC7C9xC,EAAO6xC,EAAkBC,EAAKE,GAC9BtG,EAAQmG,EAAkBG,EAAS,EAAGnpB,GAG5C,OAFAkpB,EAAYL,EAAUM,GACtBzvC,EAAMovC,EAAQA,EAAMI,GAAcA,EAC3B,IAAIjG,GACTvpC,EACAwvC,EAAU/H,KACV8B,GAAS0B,MACTxtC,EACA0rC,EAEH,CACH,EAmDMuG,EAjDmB,SAAUC,GACjC,IAAIlI,EAAuB,KACvBiI,EAAO,KACPlzB,EAAQ2yB,EAAUp0C,OAEtB,MAAM60C,EAAe,SAAUC,EAAmBrG,GAChD,MAAM+F,EAAM/yB,EAAQqzB,EACdvpB,EAAO9J,EACbA,GAASqzB,EACT,MAAMC,EAAYR,EAAkBC,EAAM,EAAGjpB,GACvCkpB,EAAYL,EAAUI,GACtBvvC,EAASovC,EAAQA,EAAMI,GAAcA,EAC3CO,EACE,IAAIxG,GACFvpC,EACAwvC,EAAU/H,KACV+B,EACA,KACAsG,GAGN,EAEMC,EAAgB,SAAUC,GAC1BvI,GACFA,EAAKhqC,KAAOuyC,EACZvI,EAAOuI,IAEPN,EAAOM,EACPvI,EAAOuI,EAEX,EAEA,IAAK,IAAIz0C,EAAI,EAAGA,EAAIo0C,EAAO/qC,QAASrJ,EAAG,CACrC,MAAM00C,EAAQN,EAAOV,eAEfY,EAAYjnB,KAAKE,IAAI,EAAG6mB,EAAO/qC,OAASrJ,EAAI,IAC9C00C,EACFL,EAAaC,EAAWtG,GAAS0B,QAGjC2E,EAAaC,EAAWtG,GAAS0B,OACjC2E,EAAaC,EAAWtG,GAASE,KAEpC,CACD,OAAOiG,CACT,CAGaQ,CADE,IAAItB,GAAUO,EAAUp0C,SAGvC,OAAO,IAAI2uC,GAAgB2F,GAAcnG,EAAawG,EACxD,ECjIA,IAAIS,GAEJ,MAAMC,GAAiB,CAAC,QAEXC,GAkBXplC,WAAAA,CACUqlC,EAGAC,GAHA,KAAQD,SAARA,EAGA,KAASC,UAATA,EAlBV,kBAAWC,GAWT,OAVA3oC,EACEuoC,IAAkB7B,GAClB,uCAEF4B,GACEA,IACA,IAAIE,GACF,CAAE,YAAaD,IACf,CAAE,YAAa7B,KAEZ4B,GAUTpzC,GAAAA,CAAI0zC,GACF,MAAMC,EAAY9gC,EAAQ/G,KAAKynC,SAAUG,GACzC,IAAKC,EACH,MAAM,IAAIzoC,MAAM,wBAA0BwoC,GAG5C,OAAIC,aAAqBhH,GAChBgH,EAIA,KAIXC,QAAAA,CAASC,GACP,OAAOlhC,EAAS7G,KAAK0nC,UAAWK,EAAgBnrB,YAGlDorB,QAAAA,CACED,EACAE,GAEAjpC,EACE+oC,IAAoBjI,GACpB,uEAEF,MAAMwG,EAAY,GAClB,IAAI4B,GAAkB,EACtB,MAAMC,EAAOF,EAAiBxF,YAAY9D,GAAUE,MACpD,IAOIuJ,EAPAC,EAAOF,EAAK5H,UAChB,KAAO8H,GACLH,EACEA,GAAmBH,EAAgBrI,YAAY2I,EAAKzJ,MACtD0H,EAAUzvC,KAAKwxC,GACfA,EAAOF,EAAK5H,UAIZ6H,EADEF,EACS7B,GAAcC,EAAWyB,EAAgBhJ,cAEzCwI,GAEb,MAAMe,EAAYP,EAAgBnrB,WAC5B2rB,EAAmB/xC,OAAAugB,OAAA,GAAA/W,KAAK0nC,WAC9Ba,EAAYD,GAAaP,EACzB,MAAMS,EAAkBhyC,OAAAugB,OAAA,GAAA/W,KAAKynC,UAE7B,OADAe,EAAWF,GAAaF,EACjB,IAAIZ,GAASgB,EAAYD,GAMlCE,YAAAA,CACE9B,EACAsB,GAEA,MAAMO,EAAa1vC,EACjBkH,KAAKynC,UACL,CAACiB,EAA6CJ,KAC5C,MAAM30B,EAAQ5M,EAAQ/G,KAAK0nC,UAAWY,GAEtC,GADAtpC,EAAO2U,EAAO,oCAAsC20B,GAChDI,IAAoBnB,GAAgB,CAEtC,GAAI5zB,EAAM+rB,YAAYiH,EAAU/H,MAAO,CAErC,MAAM0H,EAAY,GACZ6B,EAAOF,EAAiBxF,YAAY9D,GAAUE,MACpD,IAAIwJ,EAAOF,EAAK5H,UAChB,KAAO8H,GACDA,EAAKj2C,OAASu0C,EAAUv0C,MAC1Bk0C,EAAUzvC,KAAKwxC,GAEjBA,EAAOF,EAAK5H,UAGd,OADA+F,EAAUzvC,KAAK8vC,GACRN,GAAcC,EAAW3yB,EAAMorB,aACvC,CAEC,OAAOwI,EAEV,CAAM,CACL,MAAMoB,EAAeV,EAAiB/zC,IAAIyyC,EAAUv0C,MACpD,IAAIw2C,EAAcF,EAMlB,OALIC,IACFC,EAAcA,EAAYjsB,OACxB,IAAIgiB,GAAUgI,EAAUv0C,KAAMu2C,KAG3BC,EAAYvH,OAAOsF,EAAWA,EAAU/H,KAChD,KAGL,OAAO,IAAI4I,GAASgB,EAAYxoC,KAAK0nC,WAMvCmB,iBAAAA,CACElC,EACAsB,GAEA,MAAMO,EAAa1vC,EACjBkH,KAAKynC,UACJiB,IACC,GAAIA,IAAoBnB,GAEtB,OAAOmB,EACF,CACL,MAAMC,EAAeV,EAAiB/zC,IAAIyyC,EAAUv0C,MACpD,OAAIu2C,EACKD,EAAgB/rB,OACrB,IAAIgiB,GAAUgI,EAAUv0C,KAAMu2C,IAIzBD,CAEV,KAGL,OAAO,IAAIlB,GAASgB,EAAYxoC,KAAK0nC,YCrIzC,IAAI5G,SAOSgI,GAkBX1mC,WAAAA,CACmB2mC,EACAnF,EACToF,GAFS,KAASD,UAATA,EACA,KAAanF,cAAbA,EACT,KAASoF,UAATA,EApBF,KAASnF,UAAkB,KA2B7B7jC,KAAK4jC,eACPT,GAAqBnjC,KAAK4jC,eAGxB5jC,KAAK+oC,UAAU/hC,WACjBhI,GACGgB,KAAK4jC,eAAiB5jC,KAAK4jC,cAAc58B,UAC1C,wCAhCN,qBAAW85B,GACT,OACEA,KACCA,GAAa,IAAIgI,GAChB,IAAIjI,GAAwBkC,IAC5B,KACAyE,GAASG,UAgCftE,UAAAA,GACE,OAAO,EAITC,WAAAA,GACE,OAAOtjC,KAAK4jC,eAAiB9C,GAI/BgD,cAAAA,CAAeC,GACb,OAAI/jC,KAAK+oC,UAAU/hC,UAEVhH,KAEA,IAAI8oC,GAAa9oC,KAAK+oC,UAAWhF,EAAiB/jC,KAAKgpC,WAKlEhF,iBAAAA,CAAkBC,GAEhB,GAAkB,cAAdA,EACF,OAAOjkC,KAAKsjC,cACP,CACL,MAAM2F,EAAQjpC,KAAK+oC,UAAU70C,IAAI+vC,GACjC,OAAiB,OAAVgF,EAAiBnI,GAAamI,CACtC,EAIH/E,QAAAA,CAASrO,GACP,MAAM4O,EAAQ7O,GAAaC,GAC3B,OAAc,OAAV4O,EACKzkC,KAGFA,KAAKgkC,kBAAkBS,GAAOP,SAASnO,GAAaF,IAI7DsO,QAAAA,CAASF,GACP,OAAyC,OAAlCjkC,KAAK+oC,UAAU70C,IAAI+vC,GAI5BK,oBAAAA,CAAqBL,EAAmBM,GAEtC,GADAvlC,EAAOulC,EAAc,8CACH,cAAdN,EACF,OAAOjkC,KAAK8jC,eAAeS,GACtB,CACL,MAAMoC,EAAY,IAAIhI,GAAUsF,EAAWM,GAC3C,IAAIqE,EAAaM,EACb3E,EAAav9B,WACf4hC,EAAc5oC,KAAK+oC,UAAUpsB,OAAOsnB,GACpCiF,EAAclpC,KAAKgpC,UAAUH,kBAC3BlC,EACA3mC,KAAK+oC,aAGPH,EAAc5oC,KAAK+oC,UAAU1H,OAAO4C,EAAWM,GAC/C2E,EAAclpC,KAAKgpC,UAAUP,aAAa9B,EAAW3mC,KAAK+oC,YAG5D,MAAMI,EAAcP,EAAY5hC,UAC5B85B,GACA9gC,KAAK4jC,cACT,OAAO,IAAIkF,GAAaF,EAAaO,EAAaD,EACnD,EAIH1E,WAAAA,CAAY3O,EAAY0O,GACtB,MAAME,EAAQ7O,GAAaC,GAC3B,GAAc,OAAV4O,EACF,OAAOF,EACF,CACLvlC,EACyB,cAAvB42B,GAAaC,IAAiD,IAAxBC,GAAcD,GACpD,8CAEF,MAAMuT,EAAoBppC,KAAKgkC,kBAAkBS,GAAOD,YACtDzO,GAAaF,GACb0O,GAEF,OAAOvkC,KAAKskC,qBAAqBG,EAAO2E,EACzC,EAIHpiC,OAAAA,GACE,OAAOhH,KAAK+oC,UAAU/hC,UAIxB09B,WAAAA,GACE,OAAO1kC,KAAK+oC,UAAUhtC,QAMxBmT,GAAAA,CAAI01B,GACF,GAAI5kC,KAAKgH,UACP,OAAO,KAGT,MAAM7J,EAAgC,CAAC,EACvC,IAAIksC,EAAU,EACZjI,EAAS,EACTkI,GAAiB,EAYnB,GAXAtpC,KAAK2kC,aAAae,IAAgB,CAACvuC,EAAaktC,KAC9ClnC,EAAIhG,GAAOktC,EAAUn1B,IAAI01B,GAEzByE,IACIC,GAAkBR,GAAanoB,gBAAgBzb,KAAK/N,GACtDiqC,EAASrhB,KAAKsX,IAAI+J,EAAQ5iB,OAAOrnB,IAEjCmyC,GAAiB,CAClB,KAGE1E,GAAgB0E,GAAkBlI,EAAS,EAAIiI,EAAS,CAE3D,MAAME,EAAmB,GAEzB,IAAK,MAAMpyC,KAAOgG,EAChBosC,EAAMpyC,GAA4BgG,EAAIhG,GAGxC,OAAOoyC,CACR,CAIC,OAHI3E,IAAiB5kC,KAAKsjC,cAAct8B,YACtC7J,EAAI,aAAe6C,KAAKsjC,cAAcp0B,OAEjC/R,EAKXu2B,IAAAA,GACE,GAAuB,OAAnB1zB,KAAK6jC,UAAoB,CAC3B,IAAIiB,EAAS,GACR9kC,KAAKsjC,cAAct8B,YACtB89B,GACE,YACA7B,GAAiBjjC,KAAKsjC,cAAcp0B,OACpC,KAGJlP,KAAK2kC,aAAae,IAAgB,CAACvuC,EAAKktC,KACtC,MAAMmF,EAAYnF,EAAU3Q,OACV,KAAd8V,IACF1E,GAAU,IAAM3tC,EAAM,IAAMqyC,EAC7B,IAGHxpC,KAAK6jC,UAAuB,KAAXiB,EAAgB,GAAKtnB,GAAKsnB,EAC5C,CACD,OAAO9kC,KAAK6jC,UAIdO,uBAAAA,CACEH,EACAI,EACA1wB,GAEA,MAAM81B,EAAMzpC,KAAK0pC,cAAc/1B,GAC/B,GAAI81B,EAAK,CACP,MAAME,EAAcF,EAAIlH,kBACtB,IAAI5D,GAAUsF,EAAWI,IAE3B,OAAOsF,EAAcA,EAAYv3C,KAAO,IACzC,CACC,OAAO4N,KAAK+oC,UAAUxG,kBAAkB0B,GAI5C2F,iBAAAA,CAAkB7B,GAChB,MAAM0B,EAAMzpC,KAAK0pC,cAAc3B,GAC/B,GAAI0B,EAAK,CACP,MAAMtI,EAASsI,EAAItI,SACnB,OAAOA,GAAUA,EAAO/uC,IACzB,CACC,OAAO4N,KAAK+oC,UAAU5H,SAI1B0I,aAAAA,CAAc9B,GACZ,MAAM5G,EAASnhC,KAAK4pC,kBAAkB7B,GACtC,OAAI5G,EACK,IAAIxC,GAAUwC,EAAQnhC,KAAK+oC,UAAU70C,IAAIitC,IAEzC,KAOX2I,gBAAAA,CAAiB/B,GACf,MAAM0B,EAAMzpC,KAAK0pC,cAAc3B,GAC/B,GAAI0B,EAAK,CACP,MAAMrI,EAASqI,EAAIrI,SACnB,OAAOA,GAAUA,EAAOhvC,IACzB,CACC,OAAO4N,KAAK+oC,UAAU3H,SAI1B2I,YAAAA,CAAahC,GACX,MAAM3G,EAASphC,KAAK8pC,iBAAiB/B,GACrC,OAAI3G,EACK,IAAIzC,GAAUyC,EAAQphC,KAAK+oC,UAAU70C,IAAIktC,IAEzC,KAGXuD,YAAAA,CACEhxB,EACAxY,GAEA,MAAMsuC,EAAMzpC,KAAK0pC,cAAc/1B,GAC/B,OAAI81B,EACKA,EAAIzI,kBAAiBgJ,GACnB7uC,EAAO6uC,EAAY53C,KAAM43C,EAAYpL,QAGvC5+B,KAAK+oC,UAAU/H,iBAAiB7lC,GAI3CsnC,WAAAA,CACEsF,GAEA,OAAO/nC,KAAK2iC,gBAAgBoF,EAAgBzI,UAAWyI,GAGzDpF,eAAAA,CACEsH,EACAlC,GAEA,MAAM0B,EAAMzpC,KAAK0pC,cAAc3B,GAC/B,GAAI0B,EACF,OAAOA,EAAI9G,gBAAgBsH,GAAW9yC,GAAOA,IACxC,CACL,MAAM+yC,EAAWlqC,KAAK+oC,UAAUpG,gBAC9BsH,EAAU73C,KACVusC,GAAUE,MAEZ,IAAIwJ,EAAO6B,EAASzJ,OACpB,KAAe,MAAR4H,GAAgBN,EAAgB/I,QAAQqJ,EAAM4B,GAAa,GAChEC,EAAS3J,UACT8H,EAAO6B,EAASzJ,OAElB,OAAOyJ,CACR,EAGHrH,kBAAAA,CACEkF,GAEA,OAAO/nC,KAAK4iC,uBACVmF,EAAgBpI,UAChBoI,GAIJnF,sBAAAA,CACEuH,EACApC,GAEA,MAAM0B,EAAMzpC,KAAK0pC,cAAc3B,GAC/B,GAAI0B,EACF,OAAOA,EAAI7G,uBAAuBuH,GAAShzC,GAClCA,IAEJ,CACL,MAAM+yC,EAAWlqC,KAAK+oC,UAAUnG,uBAC9BuH,EAAQ/3C,KACRusC,GAAUE,MAEZ,IAAIwJ,EAAO6B,EAASzJ,OACpB,KAAe,MAAR4H,GAAgBN,EAAgB/I,QAAQqJ,EAAM8B,GAAW,GAC9DD,EAAS3J,UACT8H,EAAO6B,EAASzJ,OAElB,OAAOyJ,CACR,EAEHnF,SAAAA,CAAUhO,GACR,OAAI/2B,KAAKgH,UACH+vB,EAAM/vB,UACD,GAEC,EAED+vB,EAAMsM,cAAgBtM,EAAM/vB,UAC9B,EACE+vB,IAAUqT,IACX,EAGD,EAGX7E,SAAAA,CAAUwC,GACR,GACEA,IAAoBjI,IACpB9/B,KAAKgpC,UAAUlB,SAASC,GAExB,OAAO/nC,KACF,CACL,MAAMkpC,EAAclpC,KAAKgpC,UAAUhB,SACjCD,EACA/nC,KAAK+oC,WAEP,OAAO,IAAID,GAAa9oC,KAAK+oC,UAAW/oC,KAAK4jC,cAAesF,EAC7D,EAEH1D,SAAAA,CAAU7xB,GACR,OAAOA,IAAUmsB,IAAa9/B,KAAKgpC,UAAUlB,SAASn0B,GAExD8xB,MAAAA,CAAO1O,GACL,GAAIA,IAAU/2B,KACZ,OAAO,EACF,GAAI+2B,EAAMsM,aACf,OAAO,EACF,CACL,MAAMgH,EAAoBtT,EAC1B,GAAK/2B,KAAKsjC,cAAcmC,OAAO4E,EAAkB/G,eAE1C,IACLtjC,KAAK+oC,UAAUhtC,UAAYsuC,EAAkBtB,UAAUhtC,QACvD,CACA,MAAMuuC,EAAWtqC,KAAKyiC,YAAYiD,IAC5B6E,EAAYF,EAAkB5H,YAAYiD,IAChD,IAAI8E,EAAcF,EAAS/J,UACvBkK,EAAeF,EAAUhK,UAC7B,KAAOiK,GAAeC,GAAc,CAClC,GACED,EAAYp4C,OAASq4C,EAAar4C,OACjCo4C,EAAY5L,KAAK6G,OAAOgF,EAAa7L,MAEtC,OAAO,EAET4L,EAAcF,EAAS/J,UACvBkK,EAAeF,EAAUhK,SAC1B,CACD,OAAuB,OAAhBiK,GAAyC,OAAjBC,CAChC,CACC,OAAO,CACR,CArBC,OAAO,CAsBV,EAQKf,aAAAA,CACN3B,GAEA,OAAIA,IAAoBjI,GACf,KAEA9/B,KAAKgpC,UAAU90C,IAAI6zC,EAAgBnrB,aA7Q/BksB,GAAenoB,gBAAG,iBAwT5B,MAAMypB,GAAW,IAtClB,cAAuBtB,GAC3B1mC,WAAAA,GACEmD,MACE,IAAIs7B,GAAwBkC,IAC5B+F,GAAahI,WACb0G,GAASG,SAIb5C,SAAAA,CAAUhO,GACR,OAAIA,IAAU/2B,KACL,EAEA,EAIXylC,MAAAA,CAAO1O,GAEL,OAAOA,IAAU/2B,KAGnBsjC,WAAAA,GACE,OAAOtjC,KAGTgkC,iBAAAA,CAAkBC,GAChB,OAAO6E,GAAahI,WAGtB95B,OAAAA,GACE,OAAO,IAmBXxQ,OAAOk0C,iBAAiB/L,GAAW,CACjCY,IAAK,CACH5gC,MAAO,IAAIggC,GAAUhgB,GAAUmqB,GAAahI,aAE9C6J,IAAK,CACHhsC,MAAO,IAAIggC,GAAU/f,GAAUwrB,OAOnC3K,GAASD,aAAesJ,GAAahI,WACrC4C,GAASH,0BAA4BuF,GLvfnC9F,GKwfSoH,GHrfL,SAAqBl7B,GACzBu0B,GAAWv0B,CACb,CGofA07B,CAAmBR,aC7eHS,GACdC,GACwB,IAAxB5H,EAAAjxC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAoB,KAEpB,GAAa,OAAT64C,EACF,OAAOhC,GAAahI,WAoBtB,GAjBoB,kBAATgK,GAAqB,cAAeA,IAC7C5H,EAAW4H,EAAK,cAGlB9rC,EACe,OAAbkkC,GACsB,kBAAbA,GACa,kBAAbA,GACc,kBAAbA,GAAyB,QAAUA,EAC7C,uCAAyCA,GAGvB,kBAAT4H,GAAqB,WAAYA,GAA2B,OAAnBA,EAAK,YACvDA,EAAOA,EAAK,WAIM,kBAATA,GAAqB,QAASA,EAAM,CAE7C,OAAO,IAAIpH,GADMoH,EACaD,GAAa3H,GAC5C,CAED,GAAM4H,aAAgBxqC,MA8Cf,CACL,IAAIs+B,EAAakK,GAAahI,WAa9B,OAZAthB,GAAKsrB,GAAM,CAAC3zC,EAAa4zC,KACvB,GAAIlkC,EAASikC,EAAgB3zC,IACC,MAAxBA,EAAItE,UAAU,EAAG,GAAY,CAE/B,MAAMwxC,EAAYwG,GAAaE,IAC3B1G,EAAUhB,cAAiBgB,EAAUr9B,YACvC43B,EAAOA,EAAK0F,qBAAqBntC,EAAKktC,GAEzC,CACF,IAGIzF,EAAKkF,eAAe+G,GAAa3H,GACzC,CA7D0C,CACzC,MAAM8H,EAAwB,GAC9B,IAAIC,GAAuB,EAc3B,GAZAzrB,GADqBsrB,GACF,CAAC3zC,EAAK8xC,KACvB,GAA4B,MAAxB9xC,EAAItE,UAAU,EAAG,GAAY,CAE/B,MAAMwxC,EAAYwG,GAAa5B,GAC1B5E,EAAUr9B,YACbikC,EACEA,IAAyB5G,EAAUf,cAAct8B,UACnDgkC,EAASn0C,KAAK,IAAI8nC,GAAUxnC,EAAKktC,IAEpC,KAGqB,IAApB2G,EAAS94C,OACX,OAAO42C,GAAahI,WAGtB,MAAMoK,EAAW7E,GACf2E,EACAlI,IACA6D,GAAaA,EAAUv0C,MACvB2wC,IAEF,GAAIkI,EAAsB,CACxB,MAAME,EAAiB9E,GACrB2E,EACAtF,GAAe3G,cAEjB,OAAO,IAAI+J,GACToC,EACAL,GAAa3H,GACb,IAAIsE,GACF,CAAE,YAAa2D,GACf,CAAE,YAAazF,KAGpB,CACC,OAAO,IAAIoD,GACToC,EACAL,GAAa3H,GACbsE,GAASG,QAGd,CAgBH,EJzGM,SAA0Bz4B,GAC9Bs0B,GAAet0B,CACjB,CIyGAk8B,CAAgBP,IC1GV,MAAOQ,WAAkBvM,GAC7B18B,WAAAA,CAAoBkpC,GAClB/lC,QADkB,KAAU+lC,WAAVA,EAGlBtsC,GACGw3B,GAAY8U,IAA4C,cAA7B1V,GAAa0V,GACzC,2DAIMC,YAAAA,CAAaC,GACrB,OAAOA,EAAKtH,SAASlkC,KAAKsrC,YAE5B5L,WAAAA,CAAYd,GACV,OAAQA,EAAKsF,SAASlkC,KAAKsrC,YAAYtkC,UAEzCg4B,OAAAA,CAAQ9mC,EAAcC,GACpB,MAAMszC,EAASzrC,KAAKurC,aAAarzC,EAAE0mC,MAC7B8M,EAAS1rC,KAAKurC,aAAapzC,EAAEymC,MAC7BiH,EAAW4F,EAAO1G,UAAU2G,GAClC,OAAiB,IAAb7F,EACKhnB,GAAY3mB,EAAE9F,KAAM+F,EAAE/F,MAEtByzC,EAGXjG,QAAAA,CAASC,EAAoBztC,GAC3B,MAAMu5C,EAAYd,GAAahL,GACzBjB,EAAOkK,GAAahI,WAAW0D,YACnCxkC,KAAKsrC,WACLK,GAEF,OAAO,IAAIhN,GAAUvsC,EAAMwsC,GAE7Be,OAAAA,GACE,MAAMf,EAAOkK,GAAahI,WAAW0D,YAAYxkC,KAAKsrC,WAAYlB,IAClE,OAAO,IAAIzL,GAAU/f,GAAUggB,GAEjChiB,QAAAA,GACE,OAAOqZ,GAAUj2B,KAAKsrC,WAAY,GAAGlqC,KAAK,MCNvC,MAAMwqC,GAAc,IArCrB,cAA0B9M,GAC9BE,OAAAA,CAAQ9mC,EAAcC,GACpB,MAAM0tC,EAAW3tC,EAAE0mC,KAAKmG,UAAU5sC,EAAEymC,MACpC,OAAiB,IAAbiH,EACKhnB,GAAY3mB,EAAE9F,KAAM+F,EAAE/F,MAEtByzC,EAGXnG,WAAAA,CAAYd,GACV,OAAO,EAETK,mBAAAA,CAAoBC,EAAeC,GACjC,OAAQD,EAAQuG,OAAOtG,GAEzBG,OAAAA,GAEE,OAAQX,GAAkBY,IAE5BI,OAAAA,GAEE,OAAQhB,GAAkBgM,IAG5B/K,QAAAA,CAASC,EAAoBztC,GAC3B,MAAMu5C,EAAYd,GAAahL,GAC/B,OAAO,IAAIlB,GAAUvsC,EAAMu5C,GAM7B/uB,QAAAA,GACE,MAAO,WCXL,SAAUivB,GAAYC,GAC1B,MAAO,CAAEltC,KAAM,QAAkBktC,eACnC,CAEgB,SAAAC,GACd9H,EACA6H,GAEA,MAAO,CAAEltC,KAA4B,cAAEktC,eAAc7H,YACvD,CAEgB,SAAA+H,GACd/H,EACA6H,GAEA,MAAO,CAAEltC,KAA8B,gBAAEktC,eAAc7H,YACzD,UAEgBgI,GACdhI,EACA6H,EACAI,GAEA,MAAO,CACLttC,KAA8B,gBAC9BktC,eACA7H,YACAiI,UAEJ,OCrCaC,GACX/pC,WAAAA,CAA6BgqC,GAAA,KAAMA,OAANA,EAE7B5H,WAAAA,CACEgH,EACAr0C,EACAk1C,EACAC,EACAvpC,EACAwpC,GAEAvtC,EACEwsC,EAAKhG,UAAUxlC,KAAKosC,QACpB,qDAEF,MAAMI,EAAWhB,EAAKxH,kBAAkB7sC,GAExC,OACEq1C,EAAStI,SAASoI,GAAc7G,OAAO4G,EAASnI,SAASoI,KAKrDE,EAASxlC,YAAcqlC,EAASrlC,UAK3BwkC,GAIiB,MAAxBe,IACEF,EAASrlC,UACPwkC,EAAKrH,SAAShtC,GAChBo1C,EAAqBE,iBACnBT,GAAmB70C,EAAKq1C,IAG1BxtC,EACEwsC,EAAKnI,aACL,uEAGKmJ,EAASxlC,UAClBulC,EAAqBE,iBAAiBV,GAAiB50C,EAAKk1C,IAE5DE,EAAqBE,iBACnBR,GAAmB90C,EAAKk1C,EAAUG,KAIpChB,EAAKnI,cAAgBgJ,EAASrlC,UACzBwkC,EAGAA,EAAKlH,qBAAqBntC,EAAKk1C,GAAU9G,UAAUvlC,KAAKosC,SAGnEM,cAAAA,CACER,EACAS,EACAJ,GA6BA,OA3B4B,MAAxBA,IACGL,EAAQ7I,cACX6I,EAAQvH,aAAae,IAAgB,CAACvuC,EAAKktC,KACpCsI,EAAQxI,SAAShtC,IACpBo1C,EAAqBE,iBACnBT,GAAmB70C,EAAKktC,GAE3B,IAGAsI,EAAQtJ,cACXsJ,EAAQhI,aAAae,IAAgB,CAACvuC,EAAKktC,KACzC,GAAI6H,EAAQ/H,SAAShtC,GAAM,CACzB,MAAMq1C,EAAWN,EAAQlI,kBAAkB7sC,GACtCq1C,EAAS/G,OAAOpB,IACnBkI,EAAqBE,iBACnBR,GAAmB90C,EAAKktC,EAAWmI,GAGxC,MACCD,EAAqBE,iBACnBV,GAAiB50C,EAAKktC,GAEzB,KAIAsI,EAAQpH,UAAUvlC,KAAKosC,QAEhCtI,cAAAA,CAAeoI,EAAe/C,GAC5B,OAAI+C,EAAQllC,UACH8hC,GAAahI,WAEboL,EAAQpI,eAAeqF,GAGlCyD,YAAAA,GACE,OAAO,EAETC,gBAAAA,GACE,OAAO7sC,KAETu7B,QAAAA,GACE,OAAOv7B,KAAKosC,cChHHU,GAaX1qC,WAAAA,CAAY8hB,GACVlkB,KAAK+sC,eAAiB,IAAIZ,GAAcjoB,EAAOqX,YAC/Cv7B,KAAKosC,OAASloB,EAAOqX,WACrBv7B,KAAKgtC,WAAaF,GAAaG,cAAc/oB,GAC7ClkB,KAAKktC,SAAWJ,GAAaK,YAAYjpB,GACzClkB,KAAKotC,mBAAqBlpB,EAAOmpB,eACjCrtC,KAAKstC,iBAAmBppB,EAAOqpB,cAGjCC,YAAAA,GACE,OAAOxtC,KAAKgtC,WAGdS,UAAAA,GACE,OAAOztC,KAAKktC,SAGdQ,OAAAA,CAAQ9O,GACN,MAAM+O,EAAgB3tC,KAAKotC,kBACvBptC,KAAKosC,OAAOpN,QAAQh/B,KAAKwtC,eAAgB5O,IAAS,EAClD5+B,KAAKosC,OAAOpN,QAAQh/B,KAAKwtC,eAAgB5O,GAAQ,EAC/CgP,EAAc5tC,KAAKstC,gBACrBttC,KAAKosC,OAAOpN,QAAQJ,EAAM5+B,KAAKytC,eAAiB,EAChDztC,KAAKosC,OAAOpN,QAAQJ,EAAM5+B,KAAKytC,cAAgB,EACnD,OAAOE,GAAiBC,EAE1BpJ,WAAAA,CACEgH,EACAr0C,EACAk1C,EACAC,EACAvpC,EACAwpC,GAKA,OAHKvsC,KAAK0tC,QAAQ,IAAI/O,GAAUxnC,EAAKk1C,MACnCA,EAAWvD,GAAahI,YAEnB9gC,KAAK+sC,eAAevI,YACzBgH,EACAr0C,EACAk1C,EACAC,EACAvpC,EACAwpC,GAGJG,cAAAA,CACER,EACAS,EACAJ,GAEII,EAAQtJ,eAEVsJ,EAAU7D,GAAahI,YAEzB,IAAI+M,EAAWlB,EAAQpH,UAAUvlC,KAAKosC,QAEtCyB,EAAWA,EAAS/J,eAAegF,GAAahI,YAChD,MAAM39B,EAAOnD,KAMb,OALA2sC,EAAQhI,aAAae,IAAgB,CAACvuC,EAAKktC,KACpClhC,EAAKuqC,QAAQ,IAAI/O,GAAUxnC,EAAKktC,MACnCwJ,EAAWA,EAASvJ,qBAAqBntC,EAAK2xC,GAAahI,YAC5D,IAEI9gC,KAAK+sC,eAAeL,eACzBR,EACA2B,EACAtB,GAGJzI,cAAAA,CAAeoI,EAAe/C,GAE5B,OAAO+C,EAETU,YAAAA,GACE,OAAO,EAETC,gBAAAA,GACE,OAAO7sC,KAAK+sC,eAEdxR,QAAAA,GACE,OAAOv7B,KAAKosC,OAGN,oBAAOa,CAAc/oB,GAC3B,GAAIA,EAAO4pB,WAAY,CACrB,MAAMC,EAAY7pB,EAAO8pB,oBACzB,OAAO9pB,EAAOqX,WAAWqE,SAAS1b,EAAO+pB,qBAAsBF,EAChE,CACC,OAAO7pB,EAAOqX,WAAW+D,UAIrB,kBAAO6N,CAAYjpB,GACzB,GAAIA,EAAOgqB,SAAU,CACnB,MAAMC,EAAUjqB,EAAOkqB,kBACvB,OAAOlqB,EAAOqX,WAAWqE,SAAS1b,EAAOmqB,mBAAoBF,EAC9D,CACC,OAAOjqB,EAAOqX,WAAWoE,iBCxGlB2O,GAaXlsC,WAAAA,CAAY8hB,GAgPJ,KAAsBqqB,uBAAI3P,GAChC5+B,KAAKwuC,SAAWxuC,KAAKyuC,cAAc7P,GAAQ5+B,KAAK0uC,gBAAgB9P,GAE1D,KAAoB+P,qBAAI/P,GAC9B5+B,KAAKwuC,SAAWxuC,KAAK0uC,gBAAgB9P,GAAQ5+B,KAAKyuC,cAAc7P,GAE1D,KAAA8P,gBAAmB9P,IACzB,MAAMgQ,EAAa5uC,KAAKosC,OAAOpN,QAC7Bh/B,KAAK6uC,cAAcrB,eACnB5O,GAEF,OAAO5+B,KAAKotC,kBAAoBwB,GAAc,EAAIA,EAAa,CAAC,EAG1D,KAAAH,cAAiB7P,IACvB,MAAMgQ,EAAa5uC,KAAKosC,OAAOpN,QAC7BJ,EACA5+B,KAAK6uC,cAAcpB,cAErB,OAAOztC,KAAKstC,gBAAkBsB,GAAc,EAAIA,EAAa,CAAC,EAlQ9D5uC,KAAK6uC,cAAgB,IAAI/B,GAAa5oB,GACtClkB,KAAKosC,OAASloB,EAAOqX,WACrBv7B,KAAK8uC,OAAS5qB,EAAO6qB,WACrB/uC,KAAKwuC,UAAYtqB,EAAO8qB,iBACxBhvC,KAAKotC,mBAAqBlpB,EAAOmpB,eACjCrtC,KAAKstC,iBAAmBppB,EAAOqpB,cAEjC/I,WAAAA,CACEgH,EACAr0C,EACAk1C,EACAC,EACAvpC,EACAwpC,GAKA,OAHKvsC,KAAK6uC,cAAcnB,QAAQ,IAAI/O,GAAUxnC,EAAKk1C,MACjDA,EAAWvD,GAAahI,YAEtB0K,EAAKxH,kBAAkB7sC,GAAKsuC,OAAO4G,GAE9Bb,EACEA,EAAK9G,cAAgB1kC,KAAK8uC,OAC5B9uC,KAAK6uC,cACThC,mBACArI,YACCgH,EACAr0C,EACAk1C,EACAC,EACAvpC,EACAwpC,GAGGvsC,KAAKivC,sBACVzD,EACAr0C,EACAk1C,EACAtpC,EACAwpC,GAING,cAAAA,CACER,EACAS,EACAJ,GAEA,IAAIsB,EACJ,GAAIlB,EAAQtJ,cAAgBsJ,EAAQ3lC,UAElC6mC,EAAW/E,GAAahI,WAAWyE,UAAUvlC,KAAKosC,aAElD,GACgB,EAAdpsC,KAAK8uC,OAAanC,EAAQjI,eAC1BiI,EAAQnH,UAAUxlC,KAAKosC,QACvB,CAIA,IAAIlC,EAFJ2D,EAAW/E,GAAahI,WAAWyE,UAAUvlC,KAAKosC,QAIhDlC,EADElqC,KAAKwuC,SACK7B,EAAyB/J,uBACnC5iC,KAAK6uC,cAAcpB,aACnBztC,KAAKosC,QAGKO,EAAyBhK,gBACnC3iC,KAAK6uC,cAAcrB,eACnBxtC,KAAKosC,QAGT,IAAIrwC,EAAQ,EACZ,KAAOmuC,EAAS1J,WAAazkC,EAAQiE,KAAK8uC,QAAQ,CAChD,MAAMzG,EAAO6B,EAAS3J,UACtB,GAAKvgC,KAAKuuC,uBAAuBlG,GAAjC,CAGO,IAAKroC,KAAK2uC,qBAAqBtG,GAEpC,MAEAwF,EAAWA,EAASvJ,qBAAqB+D,EAAKj2C,KAAMi2C,EAAKzJ,MACzD7iC,GACD,CACF,CACF,KAAM,CAQL,IAAImuC,EANJ2D,EAAWlB,EAAQpH,UAAUvlC,KAAKosC,QAElCyB,EAAWA,EAAS/J,eAClBgF,GAAahI,YAKboJ,EADElqC,KAAKwuC,SACIX,EAAShL,mBAAmB7iC,KAAKosC,QAEjCyB,EAASpL,YAAYziC,KAAKosC,QAGvC,IAAIrwC,EAAQ,EACZ,KAAOmuC,EAAS1J,WAAW,CACzB,MAAM6H,EAAO6B,EAAS3J,UAEpBxkC,EAAQiE,KAAK8uC,QACb9uC,KAAKuuC,uBAAuBlG,IAC5BroC,KAAK2uC,qBAAqBtG,GAE1BtsC,IAEA8xC,EAAWA,EAASvJ,qBAClB+D,EAAKj2C,KACL02C,GAAahI,WAGlB,CACF,CAEH,OAAO9gC,KAAK6uC,cACThC,mBACAH,eAAeR,EAAS2B,EAAUtB,GAEvCzI,cAAAA,CAAeoI,EAAe/C,GAE5B,OAAO+C,EAETU,YAAAA,GACE,OAAO,EAETC,gBAAAA,GACE,OAAO7sC,KAAK6uC,cAAchC,mBAE5BtR,QAAAA,GACE,OAAOv7B,KAAKosC,OAGN6C,qBAAAA,CACNzD,EACA0D,EACAC,EACApsC,EACAqsC,GAGA,IAAI/O,EACJ,GAAIrgC,KAAKwuC,SAAU,CACjB,MAAM3I,EAAW7lC,KAAKosC,OAAOrN,aAC7BsB,EAAMA,CAACnoC,EAAcC,IAAiB0tC,EAAS1tC,EAAGD,EACnD,MACCmoC,EAAMrgC,KAAKosC,OAAOrN,aAEpB,MAAMsQ,EAAgB7D,EACtBxsC,EAAOqwC,EAAc3K,gBAAkB1kC,KAAK8uC,OAAQ,IACpD,MAAMQ,EAAoB,IAAI3Q,GAAUuQ,EAAUC,GAC5CI,EAAiBvvC,KAAKwuC,SACxBa,EAAcxF,cAAc7pC,KAAKosC,QAChCiD,EAActF,aAAa/pC,KAAKosC,QAC/BoD,EAAUxvC,KAAK6uC,cAAcnB,QAAQ4B,GAC3C,GAAID,EAAclL,SAAS+K,GAAW,CACpC,MAAMO,EAAeJ,EAAcrL,kBAAkBkL,GACrD,IAAIQ,EAAY3sC,EAAO4sC,mBACrB3vC,KAAKosC,OACLmD,EACAvvC,KAAKwuC,UAEP,KACe,MAAbkB,IACCA,EAAUt9C,OAAS88C,GAAYG,EAAclL,SAASuL,EAAUt9C,QAKjEs9C,EAAY3sC,EAAO4sC,mBACjB3vC,KAAKosC,OACLsD,EACA1vC,KAAKwuC,UAGT,MAAMoB,EACS,MAAbF,EAAoB,EAAIrP,EAAIqP,EAAWJ,GAGzC,GADEE,IAAYL,EAAUnoC,WAAa4oC,GAAe,EAOlD,OALyB,MAArBR,GACFA,EAAkB3C,iBAChBR,GAAmBiD,EAAUC,EAAWM,IAGrCJ,EAAc/K,qBAAqB4K,EAAUC,GAC/C,CACoB,MAArBC,GACFA,EAAkB3C,iBAChBT,GAAmBkD,EAAUO,IAGjC,MAAMI,EAAgBR,EAAc/K,qBAClC4K,EACApG,GAAahI,YAIf,OADe,MAAb4O,GAAqB1vC,KAAK6uC,cAAcnB,QAAQgC,IAEvB,MAArBN,GACFA,EAAkB3C,iBAChBV,GAAiB2D,EAAUt9C,KAAMs9C,EAAU9Q,OAGxCiR,EAAcvL,qBACnBoL,EAAUt9C,KACVs9C,EAAU9Q,OAGLiR,CAEV,CACF,CAAM,OAAIV,EAAUnoC,UAEZwkC,EACEgE,GACLnP,EAAIkP,EAAgBD,IAAsB,GACnB,MAArBF,IACFA,EAAkB3C,iBAChBT,GAAmBuD,EAAen9C,KAAMm9C,EAAe3Q,OAEzDwQ,EAAkB3C,iBAChBV,GAAiBmD,EAAUC,KAGxBE,EACJ/K,qBAAqB4K,EAAUC,GAC/B7K,qBAAqBiL,EAAen9C,KAAM02C,GAAahI,aAKrD0K,SCzNAsE,GAAb1tC,WAAAA,GACE,KAAS2tC,WAAG,EACZ,KAASC,WAAG,EACZ,KAAaC,eAAG,EAChB,KAAA5C,gBAAiB,EACjB,KAAO6C,SAAG,EACV,KAAWC,aAAG,EACd,KAAA5C,eAAgB,EAChB,KAAMuB,OAAG,EACT,KAASsB,UAAG,GACZ,KAAgBC,iBAAmB,KACnC,KAAeC,gBAAG,GAClB,KAAcC,eAAmB,KACjC,KAAaC,cAAG,GAChB,KAAMpE,OAAkB1G,GAExBoI,QAAAA,GACE,OAAO9tC,KAAKgwC,UAMdhB,cAAAA,GACE,MAAuB,KAAnBhvC,KAAKowC,UAKApwC,KAAKgwC,UAEc,MAAnBhwC,KAAKowC,UAOhBnC,kBAAAA,GAEE,OADAjvC,EAAOgB,KAAKgwC,UAAW,oCAChBhwC,KAAKqwC,iBAOdrC,iBAAAA,GAEE,OADAhvC,EAAOgB,KAAKgwC,UAAW,oCACnBhwC,KAAKiwC,cACAjwC,KAAKswC,gBAEL3xB,GAIXuvB,MAAAA,GACE,OAAOluC,KAAKkwC,QAMd7B,gBAAAA,GAEE,OADArvC,EAAOgB,KAAKkwC,QAAS,kCACdlwC,KAAKuwC,eAOdnC,eAAAA,GAEE,OADApvC,EAAOgB,KAAKkwC,QAAS,kCACjBlwC,KAAKmwC,YACAnwC,KAAKwwC,cAEL5xB,GAIX6xB,QAAAA,GACE,OAAOzwC,KAAK+vC,UAMdW,gBAAAA,GACE,OAAO1wC,KAAK+vC,WAAgC,KAAnB/vC,KAAKowC,UAMhCrB,QAAAA,GAEE,OADA/vC,EAAOgB,KAAK+vC,UAAW,oCAChB/vC,KAAK8uC,OAGdvT,QAAAA,GACE,OAAOv7B,KAAKosC,OAGdvR,YAAAA,GACE,QAAS76B,KAAKgwC,WAAahwC,KAAKkwC,SAAWlwC,KAAK+vC,WAGlDnV,SAAAA,GACE,OAAO56B,KAAK66B,gBAAkB76B,KAAKosC,SAAW1G,GAGhD3E,IAAAA,GACE,MAAMA,EAAO,IAAI+O,GAejB,OAdA/O,EAAKgP,UAAY/vC,KAAK+vC,UACtBhP,EAAK+N,OAAS9uC,KAAK8uC,OACnB/N,EAAKiP,UAAYhwC,KAAKgwC,UACtBjP,EAAKsM,eAAiBrtC,KAAKqtC,eAC3BtM,EAAKsP,iBAAmBrwC,KAAKqwC,iBAC7BtP,EAAKkP,cAAgBjwC,KAAKiwC,cAC1BlP,EAAKuP,gBAAkBtwC,KAAKswC,gBAC5BvP,EAAKmP,QAAUlwC,KAAKkwC,QACpBnP,EAAKwM,cAAgBvtC,KAAKutC,cAC1BxM,EAAKwP,eAAiBvwC,KAAKuwC,eAC3BxP,EAAKoP,YAAcnwC,KAAKmwC,YACxBpP,EAAKyP,cAAgBxwC,KAAKwwC,cAC1BzP,EAAKqL,OAASpsC,KAAKosC,OACnBrL,EAAKqP,UAAYpwC,KAAKowC,UACfrP,GAqIL,SAAU4P,GACdC,GAEA,MAAMC,EAAsC,CAAC,EAE7C,GAAID,EAAYhW,YACd,OAAOiW,EAGT,IAAIC,EAaJ,GAZIF,EAAYxE,SAAW1G,GACzBoL,EAAU,YACDF,EAAYxE,SAAWR,GAChCkF,EAAU,SACDF,EAAYxE,SAAWtM,GAChCgR,EAAU,QAEV9xC,EAAO4xC,EAAYxE,kBAAkBf,GAAW,4BAChDyF,EAAUF,EAAYxE,OAAOxvB,YAE/Bi0B,EAAE,QAAkCn1C,EAAUo1C,GAE1CF,EAAYZ,UAAW,CACzB,MAAMe,EAAaH,EAAYvD,eAC5B,aACD,UACFwD,EAAGE,GAAcr1C,EAAUk1C,EAAYP,kBACnCO,EAAYX,gBACdY,EAAGE,IAAe,IAAMr1C,EAAUk1C,EAAYN,iBAEjD,CAED,GAAIM,EAAYV,QAAS,CACvB,MAAMc,EAAWJ,EAAYrD,cAC1B,YACD,QACFsD,EAAGG,GAAYt1C,EAAUk1C,EAAYL,gBACjCK,EAAYT,cACdU,EAAGG,IAAa,IAAMt1C,EAAUk1C,EAAYJ,eAE/C,CAUD,OARII,EAAYb,YACVa,EAAY5B,iBACd6B,EAAuC,aAAGD,EAAY9B,OAEtD+B,EAAsC,YAAGD,EAAY9B,QAIlD+B,CACT,CAEM,SAAUI,GACdL,GAEA,MAAMzzC,EAA+B,CAAC,EAmBtC,GAlBIyzC,EAAYZ,YACd7yC,EAA8C,GAC5CyzC,EAAYP,iBACVO,EAAYX,gBACd9yC,EAA6C,GAC3CyzC,EAAYN,iBAEhBnzC,EAAqD,KAClDyzC,EAAYvD,gBAEbuD,EAAYV,UACd/yC,EAA4C,GAAGyzC,EAAYL,eACvDK,EAAYT,cACdhzC,EAA2C,GAAGyzC,EAAYJ,eAE5DrzC,EAAmD,KAChDyzC,EAAYrD,eAEbqD,EAAYb,UAAW,CACzB5yC,EAAkC,EAAGyzC,EAAY9B,OACjD,IAAIoC,EAAWN,EAAYR,UACV,KAAbc,IAEAA,EADEN,EAAY5B,iBACH,IAEA,KAGf7xC,EAAG,GAAsC+zC,CAC1C,CAKD,OAHIN,EAAYxE,SAAW1G,KACzBvoC,EAAG,EAAkCyzC,EAAYxE,OAAOxvB,YAEnDzf,CACT,CClYM,MAAOg0C,WAA2B5d,GA8BtCnxB,WAAAA,CACUutB,EACAqI,EAMAG,EACAC,GAER7yB,QAVQ,KAASoqB,UAATA,EACA,KAAaqI,cAAbA,EAMA,KAAkBG,mBAAlBA,EACA,KAAsBC,uBAAtBA,EAjCF,KAAAhS,KAAqChI,GAAW,WAMhD,KAAQgzB,SAA4B,CAAC,EAX7Cnd,WAAAA,CAAYC,GACV,MAAM,IAAI90B,MAAM,2BAYlB,mBAAOiyC,CAAattB,EAAqBvvB,GACvC,YAAYrC,IAARqC,EACK,OAASA,GAEhBwK,EACE+kB,EAAM4W,aAAaC,YACnB,kDAEK7W,EAAMoW,MAAMvd,YAuBvB2d,MAAAA,CACExW,EACAyW,EACAhmC,EACAi/B,GAEA,MAAMD,EAAazP,EAAMoW,MAAMvd,WAC/B5c,KAAKomB,KAAK,qBAAuBoN,EAAa,IAAMzP,EAAM2W,kBAG1D,MAAM4W,EAAWH,GAAmBE,aAAattB,EAAOvvB,GAClD+8C,EAAa,CAAC,EACpBvxC,KAAKoxC,SAASE,GAAYC,EAE1B,MAAMC,EAAwBb,GAC5B5sB,EAAM4W,cAGR36B,KAAKyxC,aACHje,EAAa,QACbge,GACA,CAAC7uC,EAAO3L,KACN,IAAIkP,EAAOlP,EAWX,GATc,MAAV2L,IACFuD,EAAO,KACPvD,EAAQ,MAGI,OAAVA,GACF3C,KAAKg4B,cAAcxE,EAAYttB,GAAmB,EAAO1R,GAGvDuS,EAAQ/G,KAAKoxC,SAAUE,KAAcC,EAAY,CACnD,IAAIrW,EAIFA,EAHGv4B,EAEgB,MAAVA,EACA,oBAEA,cAAgBA,EAJhB,KAOX8wB,EAAWyH,EAAQ,KACpB,KAMPlpB,QAAAA,CAAS+R,EAAqBvvB,GAC5B,MAAM88C,EAAWH,GAAmBE,aAAattB,EAAOvvB,UACjDwL,KAAKoxC,SAASE,GAGvBp9C,GAAAA,CAAI6vB,GACF,MAAMytB,EAAwBb,GAC5B5sB,EAAM4W,cAGFnH,EAAazP,EAAMoW,MAAMvd,WAEzB1R,EAAW,IAAI1G,EA0BrB,OAxBAxE,KAAKyxC,aACHje,EAAa,QACbge,GACA,CAAC7uC,EAAO3L,KACN,IAAIkP,EAAOlP,EAEG,MAAV2L,IACFuD,EAAO,KACPvD,EAAQ,MAGI,OAAVA,GACF3C,KAAKg4B,cACHxE,EACAttB,GACa,EACJ,MAEXgF,EAASxG,QAAQwB,IAEjBgF,EAASzG,OAAO,IAAIrF,MAAM8G,GAC3B,IAGEgF,EAASvG,QAIlBivB,gBAAAA,CAAiBptB,IAQTirC,YAAAA,CACNje,GAE0D,IAD1Dge,EAA0Dv/C,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,MAC1D2H,EAA0D3H,UAAAC,OAAA,EAAAD,UAAA,QAAAE,EAI1D,OAFAq/C,EAA8B,OAAI,SAE3B5sC,QAAQ0H,IAAI,CACjBtM,KAAKm4B,mBAAmB1W,UAA2B,GACnDzhB,KAAKo4B,uBAAuB3W,UAA2B,KACtD1O,MAAK3F,IAA+B,IAA7B0Y,EAAWD,GAAczY,EAC7B0Y,GAAaA,EAAUrD,cACzB+uB,EAA4B,KAAI1rB,EAAUrD,aAExCoD,GAAiBA,EAAcrf,QACjCgrC,EAA0B,GAAI3rB,EAAcrf,OAG9C,MAAMklB,GACH1rB,KAAK2vB,UAAU1M,OAAS,WAAa,WACtCjjB,KAAK2vB,UAAUv1B,KACfo5B,EAFA,OAKAxzB,KAAK2vB,UAAUzM,UCzLjB,SAAsBwuB,GAG1B,MAAMxtB,EAAS,GACf,IAAK,MAAO/sB,EAAKwH,KAAUnI,OAAOwV,QAAQ0lC,GACpCpxC,MAAMC,QAAQ5B,GAChBA,EAAMzC,SAAQy1C,IACZztB,EAAOrtB,KACL+6C,mBAAmBz6C,GAAO,IAAMy6C,mBAAmBD,GACpD,IAGHztB,EAAOrtB,KAAK+6C,mBAAmBz6C,GAAO,IAAMy6C,mBAAmBjzC,IAGnE,OAAOulB,EAAOhyB,OAAS,IAAMgyB,EAAO9iB,KAAK,KAAO,EAClD,CD0KQywC,CAAYL,GAEdxxC,KAAKomB,KAAK,4BAA8BsF,GACxC,MAAMomB,EAAM,IAAIC,eAChBD,EAAI3lB,mBAAqB,KACvB,GAAIvyB,GAA+B,IAAnBk4C,EAAI9qB,WAAkB,CACpChnB,KAAKomB,KACH,qBAAuBsF,EAAM,qBAC7BomB,EAAI5W,OACJ,YACA4W,EAAIE,cAEN,IAAI7qC,EAAM,KACV,GAAI2qC,EAAI5W,QAAU,KAAO4W,EAAI5W,OAAS,IAAK,CACzC,IACE/zB,EAAMb,EAASwrC,EAAIE,aACpB,CAAC,MAAOtvC,GACPoN,GACE,qCACE4b,EACA,KACAomB,EAAIE,aAET,CACDp4C,EAAS,KAAMuN,EAChB,MAEoB,MAAf2qC,EAAI5W,QAAiC,MAAf4W,EAAI5W,QAC5BprB,GACE,sCACE4b,EACA,YACAomB,EAAI5W,QAGVthC,EAASk4C,EAAI5W,QAEfthC,EAAW,IACZ,GAGHk4C,EAAIx8C,KAAK,MAAOo2B,GAAuB,GACvComB,EAAIzoB,MAAM,WElOH4oB,GAAb7vC,WAAAA,GACU,KAAA8vC,UAAkBpJ,GAAahI,WAEvCqR,OAAAA,CAAQtc,GACN,OAAO71B,KAAKkyC,UAAUhO,SAASrO,GAGjCuc,cAAAA,CAAevc,EAAYwc,GACzBryC,KAAKkyC,UAAYlyC,KAAKkyC,UAAU1N,YAAY3O,EAAMwc,aCHtCC,KACd,MAAO,CACL3zC,MAAO,KACPqsC,SAAU,IAAItgC,IAElB,UAoCgB6nC,GACdC,EACA3c,EACA3vB,GAEA,GAAIswB,GAAYX,GACd2c,EAAmB7zC,MAAQuH,EAC3BssC,EAAmBxH,SAASyH,aACvB,GAAiC,OAA7BD,EAAmB7zC,MAC5B6zC,EAAmB7zC,MAAQ6zC,EAAmB7zC,MAAM6lC,YAAY3O,EAAM3vB,OACjE,CACL,MAAMgpC,EAAWtZ,GAAaC,GACzB2c,EAAmBxH,SAAS//B,IAAIikC,IACnCsD,EAAmBxH,SAAS7/B,IAAI+jC,EAAUoD,MAK5CC,GAFcC,EAAmBxH,SAAS92C,IAAIg7C,GAC9CrZ,EAAOE,GAAaF,GACoB3vB,EACzC,CACH,UA0DgBwsC,GACdF,EACAG,EACAzhC,GAEiC,OAA7BshC,EAAmB7zC,MACrBuS,EAAKyhC,EAAYH,EAAmB7zC,OAexB,SACd6zC,EACAthC,GAEAshC,EAAmBxH,SAAS9uC,SAAQ,CAAC02C,EAAMz7C,KACzC+Z,EAAK/Z,EAAKy7C,EAAK,GAEnB,CApBIC,CAA+BL,GAAoB,CAACr7C,EAAKy7C,KAEvDF,GAA8BE,EADjB,IAAIvd,GAAKsd,EAAW/1B,WAAa,IAAMzlB,GACV+Z,EAAK,GAGrD,OCvIa4hC,GAGX1wC,WAAAA,CAAoB2wC,GAAA,KAAWA,YAAXA,EAFZ,KAAKC,MAAmC,KAIhD9+C,GAAAA,GACE,MAAM++C,EAAWjzC,KAAK+yC,YAAY7+C,MAE5BkqC,EAAK5nC,OAAAugB,OAAA,GAAQk8B,GAQnB,OAPIjzC,KAAKgzC,OACPxzB,GAAKxf,KAAKgzC,OAAO,CAACE,EAAcv0C,KAC9By/B,EAAM8U,GAAQ9U,EAAM8U,GAAQv0C,CAAK,IAGrCqB,KAAKgzC,MAAQC,EAEN7U,SCRE+U,GAIX/wC,WAAAA,CAAYgxC,EAAqCC,GAAA,KAAOA,QAAPA,EAFjD,KAAcC,eAA6B,CAAC,EAG1CtzC,KAAKuzC,eAAiB,IAAIT,GAAcM,GAExC,MAAMlyB,EAbmB,IAevB,IAAgDnB,KAAKmI,SACvDlH,GAAsBhhB,KAAKwzC,aAAat1B,KAAKle,MAAO+f,KAAKI,MAAMe,IAGzDsyB,YAAAA,GACN,MAAMtf,EAAQl0B,KAAKuzC,eAAer/C,MAC5Bu/C,EAA8B,CAAC,EACrC,IAAIC,GAAoB,EAExBl0B,GAAK0U,GAAO,CAACgf,EAAcv0C,KACrBA,EAAQ,GAAKkI,EAAS7G,KAAKszC,eAAgBJ,KAC7CO,EAAcP,GAAQv0C,EACtB+0C,GAAoB,EACrB,IAGCA,GACF1zC,KAAKqzC,QAAQpf,YAAYwf,GAI3BzyB,GACEhhB,KAAKwzC,aAAat1B,KAAKle,MACvB+f,KAAKI,MAAsB,EAAhBJ,KAAKmI,SAlCQ,OCT9B,IAAYyrB,GA6CN,SAAUC,GACdnZ,GAEA,MAAO,CACLoZ,UAAU,EACVC,YAAY,EACZrZ,UACAsZ,QAAQ,EAEZ,EAtDA,SAAYJ,GACVA,EAAAA,EAAA,yBACAA,EAAAA,EAAA,iBACAA,EAAAA,EAAA,mCACAA,EAAAA,EAAA,oCACD,CALD,CAAYA,KAAAA,GAKX,WCEYK,GAUX5xC,WAAAA,CAC4ByzB,EACAoe,EACAC,GAFA,KAAIre,KAAJA,EACA,KAAYoe,aAAZA,EACA,KAAMC,OAANA,EAX5B,KAAAt1C,KAAO+0C,GAAcQ,eAGrB,KAAMpxC,ODgBC,CACL8wC,UAAU,EACVC,YAAY,EACZrZ,QAAS,KACTsZ,QAAQ,GCVVK,iBAAAA,CAAkBnQ,GAChB,GAAKzN,GAAYx2B,KAAK61B,MAUf,IAA+B,MAA3B71B,KAAKi0C,aAAat1C,MAM3B,OALAK,EACEgB,KAAKi0C,aAAajJ,SAAShkC,UAC3B,4DAGKhH,KACF,CACL,MAAMinC,EAAYjnC,KAAKi0C,aAAaI,QAAQ,IAAIhf,GAAK4O,IACrD,OAAO,IAAI+P,GAAare,KAAgBsR,EAAWjnC,KAAKk0C,OACzD,EAfC,OAJAl1C,EACE42B,GAAa51B,KAAK61B,QAAUoO,EAC5B,iDAEK,IAAI+P,GACTje,GAAa/1B,KAAK61B,MAClB71B,KAAKi0C,aACLj0C,KAAKk0C,eCjCAI,GAIXlyC,WAAAA,CAAmBW,EAAgC8yB,GAAhC,KAAM9yB,OAANA,EAAgC,KAAI8yB,KAAJA,EAFnD,KAAAj3B,KAAO+0C,GAAcY,gBAIrBH,iBAAAA,CAAkBnQ,GAChB,OAAIzN,GAAYx2B,KAAK61B,MACZ,IAAIye,GAAet0C,KAAK+C,OAAQ4yB,MAEhC,IAAI2e,GAAet0C,KAAK+C,OAAQgzB,GAAa/1B,KAAK61B,cCTlD2e,GAIXpyC,WAAAA,CACSW,EACA8yB,EACA2V,GAFA,KAAMzoC,OAANA,EACA,KAAI8yB,KAAJA,EACA,KAAI2V,KAAJA,EALT,KAAA5sC,KAAO+0C,GAAcc,UAQrBL,iBAAAA,CAAkBnQ,GAChB,OAAIzN,GAAYx2B,KAAK61B,MACZ,IAAI2e,GACTx0C,KAAK+C,OACL4yB,KACA31B,KAAKwrC,KAAKxH,kBAAkBC,IAGvB,IAAIuQ,GAAUx0C,KAAK+C,OAAQgzB,GAAa/1B,KAAK61B,MAAO71B,KAAKwrC,aCRzDkJ,GAIXtyC,WAAAA,CAC4BW,EACA8yB,EACAmV,GAFA,KAAMjoC,OAANA,EACA,KAAI8yB,KAAJA,EACA,KAAQmV,SAARA,EAL5B,KAAApsC,KAAO+0C,GAAcgB,MAOrBP,iBAAAA,CAAkBnQ,GAChB,GAAIzN,GAAYx2B,KAAK61B,MAAO,CAC1B,MAAMoR,EAAYjnC,KAAKgrC,SAASqJ,QAAQ,IAAIhf,GAAK4O,IACjD,OAAIgD,EAAUjgC,UAEL,KACEigC,EAAUtoC,MAEZ,IAAI61C,GAAUx0C,KAAK+C,OAAQ4yB,KAAgBsR,EAAUtoC,OAGrD,IAAI+1C,GAAM10C,KAAK+C,OAAQ4yB,KAAgBsR,EAEjD,CAKC,OAJAjoC,EACE42B,GAAa51B,KAAK61B,QAAUoO,EAC5B,kEAEK,IAAIyQ,GAAM10C,KAAK+C,OAAQgzB,GAAa/1B,KAAK61B,MAAO71B,KAAKgrC,UAGhEpuB,QAAAA,GACE,MACE,aACA5c,KAAK61B,KACL,KACA71B,KAAK+C,OAAO6Z,WACZ,WACA5c,KAAKgrC,SAASpuB,WACd,WC5COg4B,GACXxyC,WAAAA,CACUyyC,EACAC,EACAC,GAFA,KAAKF,MAALA,EACA,KAAiBC,kBAAjBA,EACA,KAASC,UAATA,EAMVC,kBAAAA,GACE,OAAOh1C,KAAK80C,kBAMdG,UAAAA,GACE,OAAOj1C,KAAK+0C,UAGdG,iBAAAA,CAAkBrf,GAChB,GAAIW,GAAYX,GACd,OAAO71B,KAAKg1C,uBAAyBh1C,KAAK+0C,UAG5C,MAAM7F,EAAWtZ,GAAaC,GAC9B,OAAO71B,KAAKm1C,mBAAmBjG,GAGjCiG,kBAAAA,CAAmBh+C,GACjB,OACG6I,KAAKg1C,uBAAyBh1C,KAAK+0C,WAAc/0C,KAAK60C,MAAM1Q,SAAShtC,GAI1Eg7C,OAAAA,GACE,OAAOnyC,KAAK60C,aC/BHO,GAGXhzC,WAAAA,CAAmBizC,GAAA,KAAMA,OAANA,EACjBr1C,KAAKosC,OAASpsC,KAAKq1C,OAAO1a,aAAaY,YAiF3C,SAAS+Z,GACPC,EACAC,EACAjhB,EACAkhB,EACAC,EACAC,GAEA,MAAMC,EAAkBH,EAAQj5C,QAAOq5C,GAAUA,EAAOj3C,OAAS21B,IAEjEqhB,EAAgB/jC,MAAK,CAAC3Z,EAAGC,IAoC3B,SACEo9C,EACAr9C,EACAC,GAEA,GAAmB,MAAfD,EAAE+rC,WAAoC,MAAf9rC,EAAE8rC,UAC3B,MAAM9kC,EAAe,sCAEvB,MAAM22C,EAAW,IAAInX,GAAUzmC,EAAE+rC,UAAW/rC,EAAE4zC,cACxCiK,EAAW,IAAIpX,GAAUxmC,EAAE8rC,UAAW9rC,EAAE2zC,cAC9C,OAAOyJ,EAAenJ,OAAOpN,QAAQ8W,EAAUC,EACjD,CA9CIC,CAA6BT,EAAgBr9C,EAAGC,KAElDy9C,EAAgB15C,SAAQ25C,IACtB,MAAMI,EAeV,SACEV,EACAM,EACAF,GAEA,MAAoB,UAAhBE,EAAOj3C,MAAoC,kBAAhBi3C,EAAOj3C,OAGpCi3C,EAAOK,SAAWP,EAAWvR,wBAC3ByR,EAAO5R,UACP4R,EAAO/J,aACPyJ,EAAenJ,SALVyJ,CASX,CA9B+BM,CACzBZ,EACAM,EACAF,GAEFD,EAAcx5C,SAAQk6C,IAChBA,EAAaC,WAAWR,EAAOj3C,OACjC42C,EAAO3+C,KACLu/C,EAAaE,YAAYL,EAAoBV,EAAeF,QAE/D,GACD,GAEN,CCjHgB,SAAAkB,GACdZ,EACAa,GAEA,MAAO,CAAEb,aAAYa,cACvB,CAEM,SAAUC,GACdC,EACAC,EACAzkC,EACA27B,GAEA,OAAO0I,GACL,IAAI3B,GAAU+B,EAAWzkC,EAAU27B,GACnC6I,EAAUF,YAEd,CAEM,SAAUI,GACdF,EACAG,EACA3kC,EACA27B,GAEA,OAAO0I,GACLG,EAAUf,WACV,IAAIf,GAAUiC,EAAY3kC,EAAU27B,GAExC,CAEM,SAAUiJ,GACdJ,GAEA,OAAOA,EAAUf,WAAWX,qBACxB0B,EAAUf,WAAWxD,UACrB,IACN,CAEM,SAAU4E,GACdL,GAEA,OAAOA,EAAUF,YAAYxB,qBACzB0B,EAAUF,YAAYrE,UACtB,IACN,CChDA,IAAI6E,SAkBSC,GASX70C,WAAAA,CACkBzD,GAIG,IAHHqsC,EAGZ/4C,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,IAzBD+kD,KACHA,GAAyB,IAAInW,GAC3B5hB,KAGG+3B,IAgBW,KAAKr4C,MAALA,EACA,KAAQqsC,SAARA,EAVlB,iBAAOkM,CAAc/5C,GACnB,IAAIy1C,EAAyB,IAAIqE,GAAiB,MAIlD,OAHAz3B,GAAKriB,GAAK,CAACg6C,EAAmBhI,KAC5ByD,EAAOA,EAAKznC,IAAI,IAAIkqB,GAAK8hB,GAAYhI,EAAU,IAE1CyD,EAcT5rC,OAAAA,GACE,OAAsB,OAAfhH,KAAKrB,OAAkBqB,KAAKgrC,SAAShkC,UAa9CowC,gCAAAA,CACEC,EACAC,GAEA,GAAkB,MAAdt3C,KAAKrB,OAAiB24C,EAAUt3C,KAAKrB,OACvC,MAAO,CAAEk3B,KAAMF,KAAgBh3B,MAAOqB,KAAKrB,OAE3C,GAAI63B,GAAY6gB,GACd,OAAO,KACF,CACL,MAAM5S,EAAQ7O,GAAayhB,GACrBpO,EAAQjpC,KAAKgrC,SAAS92C,IAAIuwC,GAChC,GAAc,OAAVwE,EAAgB,CAClB,MAAMsO,EACJtO,EAAMmO,iCACJrhB,GAAashB,GACbC,GAEJ,GAAiC,MAA7BC,EAAmC,CAKrC,MAAO,CAAE1hB,KAJQQ,GACf,IAAIhB,GAAKoP,GACT8S,EAA0B1hB,MAEHl3B,MAAO44C,EAA0B54C,MAC3D,CACC,OAAO,IAEV,CACC,OAAO,IAEV,EAQL64C,wBAAAA,CACEH,GAEA,OAAOr3C,KAAKo3C,iCAAiCC,GAAc,KAAM,IAMnEhD,OAAAA,CAAQgD,GACN,GAAI7gB,GAAY6gB,GACd,OAAOr3C,KACF,CACL,MAAMykC,EAAQ7O,GAAayhB,GACrBpQ,EAAYjnC,KAAKgrC,SAAS92C,IAAIuwC,GACpC,OAAkB,OAAdwC,EACKA,EAAUoN,QAAQte,GAAashB,IAE/B,IAAIJ,GAAiB,KAE/B,EAUH9rC,GAAAA,CAAIksC,EAAoBI,GACtB,GAAIjhB,GAAY6gB,GACd,OAAO,IAAIJ,GAAcQ,EAAOz3C,KAAKgrC,UAChC,CACL,MAAMvG,EAAQ7O,GAAayhB,GAErBhL,GADQrsC,KAAKgrC,SAAS92C,IAAIuwC,IAAU,IAAIwS,GAAiB,OACxC9rC,IAAI4qB,GAAashB,GAAeI,GACjD7O,EAAc5oC,KAAKgrC,SAAS3J,OAAOoD,EAAO4H,GAChD,OAAO,IAAI4K,GAAcj3C,KAAKrB,MAAOiqC,EACtC,EASHjsB,MAAAA,CAAO06B,GACL,GAAI7gB,GAAY6gB,GACd,OAAIr3C,KAAKgrC,SAAShkC,UACT,IAAIiwC,GAAiB,MAErB,IAAIA,GAAc,KAAMj3C,KAAKgrC,UAEjC,CACL,MAAMvG,EAAQ7O,GAAayhB,GACrBpO,EAAQjpC,KAAKgrC,SAAS92C,IAAIuwC,GAChC,GAAIwE,EAAO,CACT,MAAMoD,EAAWpD,EAAMtsB,OAAOoZ,GAAashB,IAC3C,IAAIzO,EAMJ,OAJEA,EADEyD,EAASrlC,UACGhH,KAAKgrC,SAASruB,OAAO8nB,GAErBzkC,KAAKgrC,SAAS3J,OAAOoD,EAAO4H,GAEzB,OAAfrsC,KAAKrB,OAAkBiqC,EAAY5hC,UAC9B,IAAIiwC,GAAiB,MAErB,IAAIA,GAAcj3C,KAAKrB,MAAOiqC,EAExC,CACC,OAAO5oC,IAEV,EASH9L,GAAAA,CAAImjD,GACF,GAAI7gB,GAAY6gB,GACd,OAAOr3C,KAAKrB,MACP,CACL,MAAM8lC,EAAQ7O,GAAayhB,GACrBpO,EAAQjpC,KAAKgrC,SAAS92C,IAAIuwC,GAChC,OAAIwE,EACKA,EAAM/0C,IAAI6hC,GAAashB,IAEvB,IAEV,EAUHK,OAAAA,CAAQL,EAAoBM,GAC1B,GAAInhB,GAAY6gB,GACd,OAAOM,EACF,CACL,MAAMlT,EAAQ7O,GAAayhB,GAErBhL,GADQrsC,KAAKgrC,SAAS92C,IAAIuwC,IAAU,IAAIwS,GAAiB,OACxCS,QAAQ3hB,GAAashB,GAAeM,GAC3D,IAAI/O,EAMJ,OAJEA,EADEyD,EAASrlC,UACGhH,KAAKgrC,SAASruB,OAAO8nB,GAErBzkC,KAAKgrC,SAAS3J,OAAOoD,EAAO4H,GAErC,IAAI4K,GAAcj3C,KAAKrB,MAAOiqC,EACtC,EAQHgP,IAAAA,CAAQ3wC,GACN,OAAOjH,KAAK63C,MAAMliB,KAAgB1uB,GAM5B4wC,KAAAA,CACNC,EACA7wC,GAEA,MAAM8wC,EAA4B,CAAC,EAMnC,OALA/3C,KAAKgrC,SAAShK,kBACZ,CAACkO,EAAkBjI,KACjB8Q,EAAM7I,GAAYjI,EAAU4Q,MAAMxhB,GAAUyhB,EAAW5I,GAAWjoC,EAAG,IAGlEA,EAAG6wC,EAAW93C,KAAKrB,MAAOo5C,GAMnCC,UAAAA,CAAcniB,EAAYltB,GACxB,OAAO3I,KAAKi4C,YAAYpiB,EAAMF,KAAgBhtB,GAGxCsvC,WAAAA,CACNC,EACAJ,EACAnvC,GAEA,MAAM3R,IAASgJ,KAAKrB,OAAQgK,EAAEmvC,EAAW93C,KAAKrB,OAC9C,GAAI3H,EACF,OAAOA,EAEP,GAAIw/B,GAAY0hB,GACd,OAAO,KACF,CACL,MAAMzT,EAAQ7O,GAAasiB,GACrBxI,EAAY1vC,KAAKgrC,SAAS92C,IAAIuwC,GACpC,OAAIiL,EACKA,EAAUuI,YACfliB,GAAamiB,GACb7hB,GAAUyhB,EAAWrT,GACrB97B,GAGK,IAEV,EAILwvC,aAAAA,CACEtiB,EACAltB,GAEA,OAAO3I,KAAKo4C,eAAeviB,EAAMF,KAAgBhtB,GAG3CyvC,cAAAA,CACNF,EACAG,EACA1vC,GAEA,GAAI6tB,GAAY0hB,GACd,OAAOl4C,KACF,CACDA,KAAKrB,OACPgK,EAAE0vC,EAAqBr4C,KAAKrB,OAE9B,MAAM8lC,EAAQ7O,GAAasiB,GACrBxI,EAAY1vC,KAAKgrC,SAAS92C,IAAIuwC,GACpC,OAAIiL,EACKA,EAAU0I,eACfriB,GAAamiB,GACb7hB,GAAUgiB,EAAqB5T,GAC/B97B,GAGK,IAAIsuC,GAAiB,KAE/B,EASHqB,OAAAA,CAAQ3vC,GACN3I,KAAKu4C,SAAS5iB,KAAgBhtB,GAGxB4vC,QAAAA,CACNF,EACA1vC,GAEA3I,KAAKgrC,SAAShK,kBAAiB,CAACiD,EAAWgD,KACzCA,EAAUsR,SAASliB,GAAUgiB,EAAqBpU,GAAYt7B,EAAE,IAE9D3I,KAAKrB,OACPgK,EAAE0vC,EAAqBr4C,KAAKrB,OAIhC65C,YAAAA,CAAa7vC,GACX3I,KAAKgrC,SAAShK,kBACZ,CAACiD,EAAmBgD,KACdA,EAAUtoC,OACZgK,EAAEs7B,EAAWgD,EAAUtoC,MACxB,WC/TI85C,GACXr2C,WAAAA,CAAmBs2C,GAAA,KAAUA,WAAVA,EAEnB,YAAOC,GACL,OAAO,IAAIF,GAAc,IAAIxB,GAAc,iBAI/B2B,GACdC,EACAhjB,EACA+I,GAEA,GAAIpI,GAAYX,GACd,OAAO,IAAI4iB,GAAc,IAAIxB,GAAcrY,IACtC,CACL,MAAMka,EAAWD,EAAcH,WAAWlB,yBAAyB3hB,GACnE,GAAgB,MAAZijB,EAAkB,CACpB,MAAMC,EAAeD,EAASjjB,KAC9B,IAAIl3B,EAAQm6C,EAASn6C,MACrB,MAAM04C,EAAe5gB,GAAgBsiB,EAAcljB,GAEnD,OADAl3B,EAAQA,EAAM6lC,YAAY6S,EAAczY,GACjC,IAAI6Z,GACTI,EAAcH,WAAWvtC,IAAI4tC,EAAcp6C,GAE9C,CAAM,CACL,MAAM01C,EAAU,IAAI4C,GAAcrY,GAC5Boa,EAAeH,EAAcH,WAAWhB,QAAQ7hB,EAAMwe,GAC5D,OAAO,IAAIoE,GAAcO,EAC1B,CACF,CACH,UAEgBC,GACdJ,EACAhjB,EACAqjB,GAEA,IAAIC,EAAWN,EAIf,OAHAr5B,GAAK05B,GAAS,CAAChK,EAAkBtQ,KAC/Bua,EAAWP,GAAsBO,EAAU9iB,GAAUR,EAAMqZ,GAAWtQ,EAAK,IAEtEua,CACT,CAUgB,SAAAC,GACdP,EACAhjB,GAEA,GAAIW,GAAYX,GACd,OAAO4iB,GAAcE,QAChB,CACL,MAAMK,EAAeH,EAAcH,WAAWhB,QAC5C7hB,EACA,IAAIohB,GAAoB,OAE1B,OAAO,IAAIwB,GAAcO,EAC1B,CACH,CAUgB,SAAAK,GACdR,EACAhjB,GAEA,OAA4D,MAArDyjB,GAA6BT,EAAehjB,EACrD,CAUgB,SAAAyjB,GACdT,EACAhjB,GAEA,MAAMijB,EAAWD,EAAcH,WAAWlB,yBAAyB3hB,GACnE,OAAgB,MAAZijB,EACKD,EAAcH,WAClBxkD,IAAI4kD,EAASjjB,MACbqO,SAASzN,GAAgBqiB,EAASjjB,KAAMA,IAEpC,IAEX,CAQM,SAAU0jB,GACdV,GAEA,MAAM7N,EAAwB,GACxBpM,EAAOia,EAAcH,WAAW/5C,MAoBtC,OAnBY,MAARigC,EAEGA,EAAKyE,cACPzE,EAAsB+F,aACrBe,IACA,CAACzB,EAAWI,KACV2G,EAASn0C,KAAK,IAAI8nC,GAAUsF,EAAWI,GAAW,IAKxDwU,EAAcH,WAAW1N,SAAShK,kBAChC,CAACiD,EAAWgD,KACa,MAAnBA,EAAUtoC,OACZqsC,EAASn0C,KAAK,IAAI8nC,GAAUsF,EAAWgD,EAAUtoC,OAClD,IAIAqsC,CACT,CAEgB,SAAAwO,GACdX,EACAhjB,GAEA,GAAIW,GAAYX,GACd,OAAOgjB,EACF,CACL,MAAMY,EAAgBH,GAA6BT,EAAehjB,GAClE,OACS,IAAI4iB,GADQ,MAAjBgB,EACuB,IAAIxC,GAAcwC,GAElBZ,EAAcH,WAAWrE,QAAQxe,GAE7D,CACH,CAMM,SAAU6jB,GAAqBb,GACnC,OAAOA,EAAcH,WAAW1xC,SAClC,CAQgB,SAAA2yC,GACdd,EACAja,GAEA,OAAOgb,GAAkBjkB,KAAgBkjB,EAAcH,WAAY9Z,EACrE,CAEA,SAASgb,GACPvC,EACAwC,EACAjb,GAEA,GAAuB,MAAnBib,EAAUl7C,MAEZ,OAAOigC,EAAK4F,YAAY6S,EAAcwC,EAAUl7C,OAC3C,CACL,IAAIm7C,EAAgB,KAyBpB,OAxBAD,EAAU7O,SAAShK,kBAAiB,CAACkO,EAAUjI,KAC5B,cAAbiI,GAGFlwC,EACsB,OAApBioC,EAAUtoC,MACV,6CAEFm7C,EAAgB7S,EAAUtoC,OAE1BigC,EAAOgb,GACLvjB,GAAUghB,EAAcnI,GACxBjI,EACArI,EAEH,IAGEA,EAAKsF,SAASmT,GAAcrwC,WAA+B,OAAlB8yC,IAC5Clb,EAAOA,EAAK4F,YACVnO,GAAUghB,EAAc,aACxByC,IAGGlb,CACR,CACH,CCzLgB,SAAAmb,GACdF,EACAhkB,GAEA,OAAOmkB,GAAgBnkB,EAAMgkB,EAC/B,CAsFgB,SAAAI,GACdJ,EACAK,GAOA,MAAMzQ,EAAMoQ,EAAUM,UAAUC,WAAUx6B,GACjCA,EAAEs6B,UAAYA,IAEvBl7C,EAAOyqC,GAAO,EAAG,gDACjB,MAAM4Q,EAAgBR,EAAUM,UAAU1Q,GAC1CoQ,EAAUM,UAAUplB,OAAO0U,EAAK,GAEhC,IAAI6Q,EAAyBD,EAAcxiB,QACvC0iB,GAAsC,EAEtC7nD,EAAImnD,EAAUM,UAAUjoD,OAAS,EAErC,KAAOooD,GAA0B5nD,GAAK,GAAG,CACvC,MAAM8nD,EAAeX,EAAUM,UAAUznD,GACrC8nD,EAAa3iB,UAEbnlC,GAAK+2C,GACLgR,GAA6BD,EAAcH,EAAcxkB,MAGzDykB,GAAyB,EAChBtjB,GAAaqjB,EAAcxkB,KAAM2kB,EAAa3kB,QAEvD0kB,GAAsC,IAG1C7nD,GACD,CAED,GAAK4nD,EAEE,IAAIC,EAGT,OA2CJ,SAA6BV,GAC3BA,EAAUa,cAAgBC,GACxBd,EAAUM,UACVS,GACAjlB,MAEEkkB,EAAUM,UAAUjoD,OAAS,EAC/B2nD,EAAUgB,YACRhB,EAAUM,UAAUN,EAAUM,UAAUjoD,OAAS,GAAGgoD,QAEtDL,EAAUgB,aAAe,CAE7B,CAxDIC,CAAoBjB,IACb,EAGP,GAAIQ,EAAc7O,KAChBqO,EAAUa,cAAgBtB,GACxBS,EAAUa,cACVL,EAAcxkB,UAEX,CAELrW,GADiB66B,EAAcrP,UACf/G,IACd4V,EAAUa,cAAgBtB,GACxBS,EAAUa,cACVrkB,GAAUgkB,EAAcxkB,KAAMoO,GAC/B,GAEJ,CACD,OAAO,CACR,CAtBC,OAAO,CAuBX,CAEA,SAASwW,GACPM,EACAllB,GAEA,GAAIklB,EAAYvP,KACd,OAAOxU,GAAa+jB,EAAYllB,KAAMA,GAEtC,IAAK,MAAMoO,KAAa8W,EAAY/P,SAClC,GACE+P,EAAY/P,SAAS/nC,eAAeghC,IACpCjN,GAAaX,GAAU0kB,EAAYllB,KAAMoO,GAAYpO,GAErD,OAAO,EAGX,OAAO,CAEX,CAsBA,SAAS+kB,GAAwBpwB,GAC/B,OAAOA,EAAMqN,OACf,CAMA,SAAS8iB,GACPK,EACAx+C,EACAy+C,GAEA,IAAIpC,EAAgBJ,GAAcE,QAClC,IAAK,IAAIjmD,EAAI,EAAGA,EAAIsoD,EAAO9oD,SAAUQ,EAAG,CACtC,MAAM83B,EAAQwwB,EAAOtoD,GAIrB,GAAI8J,EAAOguB,GAAQ,CACjB,MAAM0wB,EAAY1wB,EAAMqL,KACxB,IAAIwhB,EACJ,GAAI7sB,EAAMghB,KACJxU,GAAaikB,EAAUC,IACzB7D,EAAe5gB,GAAgBwkB,EAAUC,GACzCrC,EAAgBD,GACdC,EACAxB,EACA7sB,EAAMghB,OAECxU,GAAakkB,EAAWD,KACjC5D,EAAe5gB,GAAgBykB,EAAWD,GAC1CpC,EAAgBD,GACdC,EACAljB,KACAnL,EAAMghB,KAAKtH,SAASmT,SAKnB,KAAI7sB,EAAMwgB,SAgCf,MAAM7rC,EAAe,8CA/BrB,GAAI63B,GAAaikB,EAAUC,GACzB7D,EAAe5gB,GAAgBwkB,EAAUC,GACzCrC,EAAgBI,GACdJ,EACAxB,EACA7sB,EAAMwgB,eAEH,GAAIhU,GAAakkB,EAAWD,GAEjC,GADA5D,EAAe5gB,GAAgBykB,EAAWD,GACtCzkB,GAAY6gB,GACdwB,EAAgBI,GACdJ,EACAljB,KACAnL,EAAMwgB,cAEH,CACL,MAAM/B,EAAQliC,EAAQyjB,EAAMwgB,SAAUpV,GAAayhB,IACnD,GAAIpO,EAAO,CAET,MAAMkS,EAAWlS,EAAM/E,SAASnO,GAAashB,IAC7CwB,EAAgBD,GACdC,EACAljB,KACAwlB,EAEH,CACF,CAMJ,CACF,CACF,CACD,OAAOtC,CACT,CAqBM,SAAUuC,GACdvB,EACAwB,EACAC,EACAC,EACAC,GAEA,GAAKD,GAAsBC,EAyBpB,CACL,MAAM7nB,EAAQ6lB,GACZK,EAAUa,cACVW,GAEF,IAAKG,GAAuB9B,GAAqB/lB,GAC/C,OAAO2nB,EAGP,GACGE,GACsB,MAAvBF,GACCjC,GAA8B1lB,EAAOgC,MAGjC,CACL,MAAMn5B,EAAS,SAAUguB,GACvB,OACGA,EAAMqN,SAAW2jB,MAChBD,KACEA,EAAkBzoD,QAAQ03B,EAAM0vB,YACnCljB,GAAaxM,EAAMqL,KAAMwlB,IACxBrkB,GAAaqkB,EAAU7wB,EAAMqL,MAEnC,EAOA,OAAO8jB,GANagB,GAClBd,EAAUM,UACV39C,EACA6+C,GAEmBC,GAAuBxS,GAAahI,WAE1D,CAlBC,OAAO,IAoBZ,CA3D+C,CAC9C,MAAM2Y,EAAgBH,GACpBO,EAAUa,cACVW,GAEF,GAAqB,MAAjB5B,EACF,OAAOA,EACF,CACL,MAAMgC,EAAWjC,GACfK,EAAUa,cACVW,GAEF,GAAI3B,GAAqB+B,GACvB,OAAOH,EACF,GACkB,MAAvBA,GACCjC,GAA8BoC,EAAU9lB,MAIpC,CAEL,OAAOgkB,GAAmB8B,EADLH,GAAuBxS,GAAahI,WAE1D,CAJC,OAAO,IAKV,CACF,CAmCH,CAgQM,SAAU4a,GACdC,EACAL,EACAC,EACAC,GAEA,OAAOJ,GACLO,EAAa9B,UACb8B,EAAaN,SACbC,EACAC,EACAC,EAEJ,CAOgB,SAAAI,GACdD,EACAE,GAEA,gBAjRAhC,EACAwB,EACAQ,GAEA,IAAIC,EAAmBhT,GAAahI,WACpC,MAAMib,EAAczC,GAClBO,EAAUa,cACVW,GAEF,GAAIU,EAUF,OATKA,EAAY1Y,cAEf0Y,EAAYpX,aAAae,IAAgB,CAACzB,EAAWkL,KACnD2M,EAAmBA,EAAiBxX,qBAClCL,EACAkL,EACD,IAGE2M,EACF,GAAID,EAAwB,CAGjC,MAAMloB,EAAQ6lB,GACZK,EAAUa,cACVW,GAsBF,OApBAQ,EAAuBlX,aACrBe,IACA,CAACzB,EAAWI,KACV,MAAMzF,EAAO+a,GACXH,GAAgC7lB,EAAO,IAAI0B,GAAK4O,IAChDI,GAEFyX,EAAmBA,EAAiBxX,qBAClCL,EACArF,EACD,IAIL2a,GAAiC5lB,GAAOz3B,SAAQyqC,IAC9CmV,EAAmBA,EAAiBxX,qBAClCqC,EAAUv0C,KACVu0C,EAAU/H,KACX,IAEIkd,CACR,CAaC,OANAvC,GAJcC,GACZK,EAAUa,cACVW,IAEsCn/C,SAAQyqC,IAC9CmV,EAAmBA,EAAiBxX,qBAClCqC,EAAUv0C,KACVu0C,EAAU/H,KACX,IAEIkd,CAEX,CAkNSE,CACLL,EAAa9B,UACb8B,EAAaN,SACbQ,EAEJ,CAkBM,SAAUI,GACdN,EACA9lB,EACAqmB,EACAC,GAEA,OA/NI,SACJtC,EACAwB,EACAlE,EACA+E,EACAC,GAEAn9C,EACEk9C,GAAqBC,EACrB,6DAEF,MAAMtmB,EAAOQ,GAAUglB,EAAUlE,GACjC,GAAIkC,GAA8BQ,EAAUa,cAAe7kB,GAGzD,OAAO,KACF,CAEL,MAAMumB,EAAa5C,GACjBK,EAAUa,cACV7kB,GAEF,OAAI6jB,GAAqB0C,GAEhBD,EAAmBjY,SAASiT,GAQ5BwC,GACLyC,EACAD,EAAmBjY,SAASiT,GAGjC,CACH,CAyLSkF,CACLV,EAAa9B,UACb8B,EAAaN,SACbxlB,EACAqmB,EACAC,EAEJ,CAQgB,SAAAG,GACdX,EACA9lB,GAEA,OApKc,SACdgkB,EACAhkB,GAEA,OAAOyjB,GAA6BO,EAAUa,cAAe7kB,EAC/D,CA+JS0mB,CACLZ,EAAa9B,UACbxjB,GAAUslB,EAAaN,SAAUxlB,GAErC,CAMgB,SAAA2mB,GACdb,EACAc,EACAxS,EACAluC,EACAwkB,EACA5M,GAEA,OA3Kc,SACdkmC,EACAwB,EACAoB,EACAxS,EACAluC,EACAwkB,EACA5M,GAEA,IAAI+oC,EACJ,MAAM/oB,EAAQ6lB,GACZK,EAAUa,cACVW,GAEI5B,EAAgBH,GAA6B3lB,EAAOgC,MAC1D,GAAqB,MAAjB8jB,EACFiD,EAAYjD,MACP,IAA0B,MAAtBgD,EAIT,MAAO,GAHPC,EAAY/C,GAAmBhmB,EAAO8oB,EAIvC,CAED,GADAC,EAAYA,EAAUnX,UAAU5xB,GAC3B+oC,EAAU11C,WAAc01C,EAAUrZ,aAerC,MAAO,GAf4C,CACnD,MAAMsZ,EAAQ,GACRtc,EAAM1sB,EAAMorB,aACZoJ,EAAO5nB,EACRm8B,EAA2B9Z,uBAAuBqH,EAAWt2B,GAC7D+oC,EAA2B/Z,gBAAgBsH,EAAWt2B,GAC3D,IAAI00B,EAAOF,EAAK5H,UAChB,KAAO8H,GAAQsU,EAAMzqD,OAAS6J,GACC,IAAzBskC,EAAIgI,EAAM4B,IACZ0S,EAAM9lD,KAAKwxC,GAEbA,EAAOF,EAAK5H,UAEd,OAAOoc,CACR,CAGH,CAkISC,CACLjB,EAAa9B,UACb8B,EAAaN,SACboB,EACAxS,EACAluC,EACAwkB,EACA5M,EAEJ,UAMgBkpC,GACdlB,EACAzM,EACA4N,GAEA,OA5OI,SACJjD,EACAwB,EACAnM,EACAiN,GAEA,MAAMtmB,EAAOQ,GAAUglB,EAAUnM,GAC3BuK,EAAgBH,GACpBO,EAAUa,cACV7kB,GAEF,GAAqB,MAAjB4jB,EACF,OAAOA,EAEP,GAAI0C,EAAmBhH,mBAAmBjG,GAKxC,OAAOyK,GAJYH,GACjBK,EAAUa,cACV7kB,GAIAsmB,EAAmBhK,UAAUnO,kBAAkBkL,IAGjD,OAAO,IAGb,CAiNS6N,CACLpB,EAAa9B,UACb8B,EAAaN,SACbnM,EACA4N,EAEJ,CAKgB,SAAAE,GACdrB,EACA1X,GAEA,OAAO+V,GACL3jB,GAAUslB,EAAaN,SAAUpX,GACjC0X,EAAa9B,UAEjB,CAEgB,SAAAG,GACdnkB,EACAgkB,GAEA,MAAO,CACLwB,SAAUxlB,EACVgkB,YAEJ,OCvxBaoD,GAAb76C,WAAAA,GACmB,KAAA86C,UAAiC,IAAIxyC,IAEtD+hC,gBAAAA,CAAiBoJ,GACf,MAAMj3C,EAAOi3C,EAAOj3C,KACdswC,EAAW2G,EAAO5R,UACxBjlC,EACiC,gBAA/BJ,GACmC,kBAAjCA,GACiC,kBAAjCA,EACF,6CAEFI,EACe,cAAbkwC,EACA,mDAEF,MAAMiO,EAAYn9C,KAAKk9C,UAAUhpD,IAAIg7C,GACrC,GAAIiO,EAAW,CACb,MAAMC,EAAUD,EAAUv+C,KAC1B,GACiC,gBAA/BA,GACY,kBAAZw+C,EAEAp9C,KAAKk9C,UAAU/xC,IACb+jC,EACAjD,GACEiD,EACA2G,EAAO/J,aACPqR,EAAUrR,oBAGT,GAC4B,kBAAjCltC,GACY,gBAAZw+C,EAEAp9C,KAAKk9C,UAAUhxC,OAAOgjC,QACjB,GAC4B,kBAAjCtwC,GACY,kBAAZw+C,EAEAp9C,KAAKk9C,UAAU/xC,IACb+jC,EACAlD,GAAmBkD,EAAUiO,EAAUjR,eAEpC,GAC4B,kBAAjCttC,GACY,gBAAZw+C,EAEAp9C,KAAKk9C,UAAU/xC,IACb+jC,EACAnD,GAAiBmD,EAAU2G,EAAO/J,mBAE/B,IAC4B,kBAAjCltC,GACY,kBAAZw+C,EAOA,MAAMj+C,EACJ,mCACE02C,EACA,mBACAsH,GATJn9C,KAAKk9C,UAAU/xC,IACb+jC,EACAjD,GAAmBiD,EAAU2G,EAAO/J,aAAcqR,EAAUjR,SAS/D,CACF,MACClsC,KAAKk9C,UAAU/xC,IAAI+jC,EAAU2G,GAIjCwH,UAAAA,GACE,OAAO/8C,MAAM8L,KAAKpM,KAAKk9C,UAAU7wC,WCnC9B,MAAMixC,GAA2B,UAftCC,gBAAAA,CAAiBrO,GACf,OAAO,KAETS,kBAAAA,CACEh8B,EACAs1B,EACA1oB,GAEA,OAAO,aAaEi9B,GACXp7C,WAAAA,CACUq7C,EACAC,GAC2C,IAA3CC,EAAA1rD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAuC,KAFvC,KAAOwrD,QAAPA,EACA,KAAUC,WAAVA,EACA,KAAuBC,wBAAvBA,EAEVJ,gBAAAA,CAAiBrO,GACf,MAAMtQ,EAAO5+B,KAAK09C,WAAW/H,WAC7B,GAAI/W,EAAKuW,mBAAmBjG,GAC1B,OAAOtQ,EAAKuT,UAAUnO,kBAAkBkL,GACnC,CACL,MAAM0O,EAC4B,MAAhC59C,KAAK29C,wBACD,IAAI/I,GAAU50C,KAAK29C,yBAAyB,GAAM,GAClD39C,KAAK09C,WAAWlH,YACtB,OAAOqG,GAA8B78C,KAAKy9C,QAASvO,EAAU0O,EAC9D,EAEHjO,kBAAAA,CACEh8B,EACAs1B,EACA1oB,GAEA,MAAMk8B,EAC4B,MAAhCz8C,KAAK29C,wBACD39C,KAAK29C,wBACL5G,GAA+B/2C,KAAK09C,YACpCf,EAAQH,GACZx8C,KAAKy9C,QACLhB,EACAxT,EACA,EACA1oB,EACA5M,GAEF,OAAqB,IAAjBgpC,EAAMzqD,OACD,KAEAyqD,EAAM,ICpBb,SAAUkB,GACdC,EACAC,EACAC,EACAC,EACAC,GAEA,MAAMC,EAAc,IAAIlB,GACxB,IAAI1G,EAAc6H,EAClB,GAAIJ,EAAUp/C,OAAS+0C,GAAcc,UAAW,CAC9C,MAAMn6B,EAAY0jC,EACd1jC,EAAUvX,OAAO8wC,SACnB0C,EAAe8H,GACbP,EACAC,EACAzjC,EAAUub,KACVvb,EAAUkxB,KACVyS,EACAC,EACAC,IAGFn/C,EAAOsb,EAAUvX,OAAO+wC,WAAY,mBAIpCsK,EACE9jC,EAAUvX,OAAOgxC,QAChBgK,EAAavH,YAAYvB,eAAiBze,GAAYlc,EAAUub,MACnE0gB,EAAe+H,GACbR,EACAC,EACAzjC,EAAUub,KACVvb,EAAUkxB,KACVyS,EACAC,EACAE,EACAD,GAGL,MAAM,GAAIH,EAAUp/C,OAAS+0C,GAAcgB,MAAO,CACjD,MAAMhhB,EAAQqqB,EACVrqB,EAAM5wB,OAAO8wC,SACf0C,EAqYN,SACEuH,EACApH,EACA7gB,EACA0oB,EACAN,EACAzH,EACA2H,GAQA,IAAIK,EAAe9H,EA+BnB,OA9BA6H,EAAgBjG,SAAQ,CAACjB,EAAchT,KACrC,MAAM6W,EAAY7kB,GAAUR,EAAMwhB,GAC9BoH,GAA2B/H,EAAW9gB,GAAaslB,MACrDsD,EAAeH,GACbP,EACAU,EACAtD,EACA7W,EACA4Z,EACAzH,EACA2H,GAEH,IAGHI,EAAgBjG,SAAQ,CAACjB,EAAchT,KACrC,MAAM6W,EAAY7kB,GAAUR,EAAMwhB,GAC7BoH,GAA2B/H,EAAW9gB,GAAaslB,MACtDsD,EAAeH,GACbP,EACAU,EACAtD,EACA7W,EACA4Z,EACAzH,EACA2H,GAEH,IAGIK,CACT,CApbqBE,CACbZ,EACAC,EACApqB,EAAMkC,KACNlC,EAAMqX,SACNiT,EACAC,EACAC,IAGFn/C,EAAO20B,EAAM5wB,OAAO+wC,WAAY,mBAEhCsK,EACEzqB,EAAM5wB,OAAOgxC,QAAUgK,EAAavH,YAAYvB,aAClDsB,EAAeoI,GACbb,EACAC,EACApqB,EAAMkC,KACNlC,EAAMqX,SACNiT,EACAC,EACAE,EACAD,GAGL,MAAM,GAAIH,EAAUp/C,OAAS+0C,GAAcQ,eAAgB,CAC1D,MAAMyK,EAAeZ,EAYnBzH,EAXGqI,EAAa1K,OAqmBtB,SACE4J,EACApH,EACA7gB,EACAooB,EACA3C,EACA6C,GAEA,IAAIjsC,EACJ,GAAqD,MAAjDoqC,GAA2B2B,EAAapoB,GAC1C,OAAO6gB,EACF,CACL,MAAM3zC,EAAS,IAAIy6C,GACjBS,EACAvH,EACA4E,GAEIjM,EAAgBqH,EAAUf,WAAWxD,UAC3C,IAAItC,EACJ,GAAIrZ,GAAYX,IAAgC,cAAvBD,GAAaC,GAAuB,CAC3D,IAAIsJ,EACJ,GAAIuX,EAAUF,YAAYxB,qBACxB7V,EAAUuc,GACRuC,EACAlH,GAA+BL,QAE5B,CACL,MAAMmI,EAAiBnI,EAAUF,YAAYrE,UAC7CnzC,EACE6/C,aAA0B/V,GAC1B,iDAEF3J,EAAUyc,GACRqC,EACAY,EAEH,CAEDhP,EAAgBiO,EAActhD,OAAOkwC,eACnC2C,EACAlQ,EACAgf,EAEH,KAAM,CACL,MAAMjP,EAAWtZ,GAAaC,GAC9B,IAAIwW,EAAWwQ,GACboB,EACA/O,EACAwH,EAAUF,aAGE,MAAZnK,GACAqK,EAAUF,YAAYrB,mBAAmBjG,KAEzC7C,EAAWgD,EAAcrL,kBAAkBkL,IAG3CW,EADc,MAAZxD,EACcyR,EAActhD,OAAOgoC,YACnC6K,EACAH,EACA7C,EACAtW,GAAaF,GACb9yB,EACAo7C,GAEOzH,EAAUf,WAAWxD,UAAUhO,SAAS+K,GAEjC4O,EAActhD,OAAOgoC,YACnC6K,EACAH,EACApG,GAAahI,WACb/K,GAAaF,GACb9yB,EACAo7C,GAGc9O,EAGhBQ,EAAc7oC,WACd0vC,EAAUF,YAAYxB,uBAGtB9iC,EAAWwpC,GACTuC,EACAlH,GAA+BL,IAE7BxkC,EAASmxB,eACXwM,EAAgBiO,EAActhD,OAAOkwC,eACnCmD,EACA39B,EACAisC,IAIP,CAID,OAHAjsC,EACEwkC,EAAUF,YAAYxB,sBACqC,MAA3DsH,GAA2B2B,EAAatoB,MACnC8gB,GACLC,EACA7G,EACA39B,EACA4rC,EAActhD,OAAOowC,eAExB,CACH,CApsBqBkS,CACbhB,EACAC,EACAa,EAAa/oB,KACbooB,EACAC,EACAC,GA4eR,SACEL,EACApH,EACAqI,EACA9K,EACAgK,EACAC,EACAC,GAEA,GAAwD,MAApD7B,GAA2B2B,EAAac,GAC1C,OAAOrI,EAIT,MAAM0H,EAAmB1H,EAAUF,YAAYvB,aAIzCuB,EAAcE,EAAUF,YAC9B,GAA0B,MAAtBvC,EAAat1C,MAAe,CAE9B,GACG63B,GAAYuoB,IAAYvI,EAAYxB,sBACrCwB,EAAYtB,kBAAkB6J,GAE9B,OAAOT,GACLR,EACApH,EACAqI,EACAvI,EAAYrE,UAAUjO,SAAS6a,GAC/Bd,EACAC,EACAE,EACAD,GAEG,GAAI3nB,GAAYuoB,GAAU,CAG/B,IAAIR,EAAkB,IAAItH,GAAoB,MAI9C,OAHAT,EAAYrE,UAAUxN,aAAa7E,IAAW,CAAC1tC,EAAMwsC,KACnD2f,EAAkBA,EAAgBpzC,IAAI,IAAIkqB,GAAKjjC,GAAOwsC,EAAK,IAEtD+f,GACLb,EACApH,EACAqI,EACAR,EACAN,EACAC,EACAE,EACAD,EAEH,CACC,OAAOzH,CAEV,CAAM,CAEL,IAAI6H,EAAkB,IAAItH,GAAoB,MAU9C,OATAhD,EAAaqE,SAAQ,CAAC0G,EAAWrgD,KAC/B,MAAMsgD,EAAkB5oB,GAAU0oB,EAASC,GACvCxI,EAAYtB,kBAAkB+J,KAChCV,EAAkBA,EAAgBpzC,IAChC6zC,EACAxI,EAAYrE,UAAUjO,SAAS+a,IAElC,IAEIN,GACLb,EACApH,EACAqI,EACAR,EACAN,EACAC,EACAE,EACAD,EAEH,CACH,CA1kBqBe,CACbpB,EACAC,EACAa,EAAa/oB,KACb+oB,EAAa3K,aACbgK,EACAC,EACAC,EAYL,KAAM,IAAIH,EAAUp/C,OAAS+0C,GAAcY,gBAS1C,MAAMp1C,EAAe,2BAA6B6+C,EAAUp/C,MAR5D23C,EAwjBJ,SACEuH,EACApH,EACA7gB,EACAooB,EACAE,GAEA,MAAMgB,EAAgBzI,EAAUF,YAC1BD,EAAeK,GACnBF,EACAyI,EAAchN,UACdgN,EAAcnK,sBAAwBxe,GAAYX,GAClDspB,EAAclK,cAEhB,OAAOmK,GACLtB,EACAvH,EACA1gB,EACAooB,EACAX,GACAa,EAEJ,CA9kBmBkB,CACbvB,EACAC,EACAC,EAAUnoB,KACVooB,EACAE,EAIH,CACD,MAAM1I,EAAU0I,EAAYd,aAE5B,OAGF,SACEU,EACAxH,EACA4H,GAEA,MAAMxH,EAAYJ,EAAaZ,WAC/B,GAAIgB,EAAU3B,qBAAsB,CAClC,MAAMsK,EACJ3I,EAAUxE,UAAU9O,cAAgBsT,EAAUxE,UAAUnrC,UACpDu4C,EAAkBzI,GAA8BiH,IAEpDI,EAAYjsD,OAAS,IACpB6rD,EAAapI,WAAWX,sBACxBsK,IAAkB3I,EAAUxE,UAAU1M,OAAO8Z,KAC7C5I,EAAUxE,UAAU7O,cAAcmC,OAAO8Z,EAAgBjc,iBAE1D6a,EAAYtnD,KACVg1C,GAAYiL,GAA8BP,IAG/C,CACH,CAzBEiJ,CAAgCzB,EAAcxH,EAAcd,GACrD,CAAEiB,UAAWH,EAAcd,UACpC,CAyBA,SAAS2J,GACPtB,EACApH,EACA+I,EACAxB,EACAl7C,EACAo7C,GAEA,MAAMuB,EAAehJ,EAAUf,WAC/B,GAA2D,MAAvD2G,GAA2B2B,EAAawB,GAE1C,OAAO/I,EACF,CACL,IAAI7G,EAAe+N,EACnB,GAAIpnB,GAAYipB,GAMd,GAJAzgD,EACE03C,EAAUF,YAAYxB,qBACtB,8DAEE0B,EAAUF,YAAYvB,aAAc,CAItC,MAAMuB,EAAcO,GAA+BL,GAK7CiJ,EAAwB/D,GAC5BqC,EAJAzH,aAAuB1N,GACnB0N,EACA1N,GAAahI,YAKnB+O,EAAgBiO,EAActhD,OAAOkwC,eACnCgK,EAAUf,WAAWxD,UACrBwN,EACAxB,EAEH,KAAM,CACL,MAAMyB,EAAelE,GACnBuC,EACAlH,GAA+BL,IAEjC7G,EAAgBiO,EAActhD,OAAOkwC,eACnCgK,EAAUf,WAAWxD,UACrByN,EACAzB,EAEH,KACI,CACL,MAAMjP,EAAWtZ,GAAa6pB,GAC9B,GAAiB,cAAbvQ,EAA0B,CAC5BlwC,EACgC,IAA9B82B,GAAc2pB,GACd,yDAEF,MAAMI,EAAeH,EAAavN,UAClCyL,EAAalH,EAAUF,YAAYrE,UAEnC,MAAM2N,EAAkB7D,GACtBgC,EACAwB,EACAI,EACAjC,GAGA/N,EADqB,MAAnBiQ,EACchC,EAActhD,OAAOsnC,eACnC+b,EACAC,GAIcJ,EAAavN,SAEhC,KAAM,CACL,MAAM4N,EAAkBhqB,GAAa0pB,GAErC,IAAIO,EACJ,GAAIN,EAAavK,mBAAmBjG,GAAW,CAC7C0O,EAAalH,EAAUF,YAAYrE,UACnC,MAAM8N,EACJhE,GACEgC,EACAwB,EACAC,EAAavN,UACbyL,GAGFoC,EADsB,MAApBC,EACcP,EACbvN,UACAnO,kBAAkBkL,GAClB1K,YAAYub,EAAiBE,GAGhBP,EAAavN,UAAUnO,kBAAkBkL,EAE5D,MACC8Q,EAAgBnD,GACdoB,EACA/O,EACAwH,EAAUF,aAIZ3G,EADmB,MAAjBmQ,EACclC,EAActhD,OAAOgoC,YACnCkb,EAAavN,UACbjD,EACA8Q,EACAD,EACAh9C,EACAo7C,GAIcuB,EAAavN,SAEhC,CACF,CACD,OAAOsE,GACLC,EACA7G,EACA6P,EAAa1K,sBAAwBxe,GAAYipB,GACjD3B,EAActhD,OAAOowC,eAExB,CACH,CAEA,SAAS0R,GACPR,EACAC,EACA0B,EACAS,EACAjC,EACAC,EACAE,EACAD,GAEA,MAAMgC,EAAgBpC,EAAavH,YACnC,IAAI4J,EACJ,MAAMC,EAAejC,EACjBN,EAActhD,OACdshD,EAActhD,OAAOqwC,mBACzB,GAAIrW,GAAYipB,GACdW,EAAiBC,EAAa3T,eAC5ByT,EAAchO,UACd+N,EACA,WAEG,GAAIG,EAAazT,iBAAmBuT,EAAclL,aAAc,CAErE,MAAMqL,EAAgBH,EACnBhO,UACA3N,YAAYib,EAAYS,GAC3BE,EAAiBC,EAAa3T,eAC5ByT,EAAchO,UACdmO,EACA,KAEH,KAAM,CACL,MAAMpR,EAAWtZ,GAAa6pB,GAC9B,IACGU,EAAcjL,kBAAkBuK,IACjC3pB,GAAc2pB,GAAc,EAG5B,OAAO1B,EAET,MAAMgC,EAAkBhqB,GAAa0pB,GAE/Blb,EADY4b,EAAchO,UAAUnO,kBAAkBkL,GAC7B1K,YAAYub,EAAiBG,GAE1DE,EADe,cAAblR,EACemR,EAAavc,eAC5Bqc,EAAchO,UACd5N,GAGe8b,EAAa7b,YAC5B2b,EAAchO,UACdjD,EACA3K,EACAwb,EACAzC,GACA,KAGL,CACD,MAAM/G,EAAeK,GACnBmH,EACAqC,EACAD,EAAcnL,sBAAwBxe,GAAYipB,GAClDY,EAAazT,gBAOf,OAAOwS,GACLtB,EACAvH,EACAkJ,EACAxB,EATa,IAAIT,GACjBS,EACA1H,EACA2H,GAQAC,EAEJ,CAEA,SAASE,GACPP,EACAC,EACA0B,EACAS,EACAjC,EACAC,EACAC,GAEA,MAAMuB,EAAe3B,EAAapI,WAClC,IAAIY,EAAc1G,EAClB,MAAM9sC,EAAS,IAAIy6C,GACjBS,EACAF,EACAG,GAEF,GAAI1nB,GAAYipB,GACd5P,EAAgBiO,EAActhD,OAAOkwC,eACnCqR,EAAapI,WAAWxD,UACxB+N,EACA/B,GAEF5H,EAAeE,GACbsH,EACAlO,GACA,EACAiO,EAActhD,OAAOowC,oBAElB,CACL,MAAMsC,EAAWtZ,GAAa6pB,GAC9B,GAAiB,cAAbvQ,EACFW,EAAgBiO,EAActhD,OAAOsnC,eACnCia,EAAapI,WAAWxD,UACxB+N,GAEF3J,EAAeE,GACbsH,EACAlO,EACA6P,EAAa1K,qBACb0K,EAAazK,kBAEV,CACL,MAAM8K,EAAkBhqB,GAAa0pB,GAC/BjT,EAAWkT,EAAavN,UAAUnO,kBAAkBkL,GAC1D,IAAI7C,EACJ,GAAI7V,GAAYupB,GAEd1T,EAAW6T,MACN,CACL,MAAM7b,EAAYthC,EAAOw6C,iBAAiBrO,GAQtC7C,EAPa,MAAbhI,EAEiC,cAAjCrO,GAAY+pB,IACZ1b,EAAUH,SAAS/N,GAAW4pB,IAAkB/4C,UAIrCq9B,EAEAA,EAAUG,YAAYub,EAAiBG,GAIzCpX,GAAahI,UAE3B,CACD,GAAK0L,EAAS/G,OAAO4G,GAgBnBkK,EAAewH,MAhBe,CAS9BxH,EAAeE,GACbsH,EATmBD,EAActhD,OAAOgoC,YACxCkb,EAAavN,UACbjD,EACA7C,EACA0T,EACAh9C,EACAo7C,GAKAuB,EAAa1K,qBACb8I,EAActhD,OAAOowC,eAExB,CAGF,CACF,CACD,OAAO2J,CACT,CAEA,SAASkI,GACP/H,EACAxH,GAEA,OAAOwH,EAAUf,WAAWR,mBAAmBjG,EACjD,CAmDA,SAASqR,GACPzC,EACAlf,EACAjL,GAKA,OAHAA,EAAM2kB,SAAQ,CAACjB,EAAchT,KAC3BzF,EAAOA,EAAK4F,YAAY6S,EAAchT,EAAU,IAE3CzF,CACT,CAEA,SAAS+f,GACPb,EACApH,EACA7gB,EACA0oB,EACAN,EACAzH,EACA4H,EACAD,GAIA,GACEzH,EAAUF,YAAYrE,UAAUnrC,YAC/B0vC,EAAUF,YAAYxB,qBAEvB,OAAO0B,EAST,IACI8J,EADAhC,EAAe9H,EAGjB8J,EADEhqB,GAAYX,GACE0oB,EAEA,IAAItH,GAAoB,MAAMS,QAC5C7hB,EACA0oB,GAGJ,MAAMX,EAAalH,EAAUF,YAAYrE,UAiDzC,OAhDAqO,EAAcxV,SAAShK,kBAAiB,CAACkO,EAAUjI,KACjD,GAAI2W,EAAWzZ,SAAS+K,GAAW,CACjC,MAGM7C,EAAWkU,GACfzC,EAJkBpH,EAAUF,YAC3BrE,UACAnO,kBAAkBkL,GAInBjI,GAEFuX,EAAeF,GACbR,EACAU,EACA,IAAInpB,GAAK6Z,GACT7C,EACA4R,EACAzH,EACA4H,EACAD,EAEH,KAEHqC,EAAcxV,SAAShK,kBAAiB,CAACkO,EAAUuR,KACjD,MAAMC,GACHhK,EAAUF,YAAYrB,mBAAmBjG,IACjB,OAAzBuR,EAAe9hD,MACjB,IAAKi/C,EAAWzZ,SAAS+K,KAAcwR,EAAoB,CACzD,MAGMrU,EAAWkU,GACfzC,EAJkBpH,EAAUF,YAC3BrE,UACAnO,kBAAkBkL,GAInBuR,GAEFjC,EAAeF,GACbR,EACAU,EACA,IAAInpB,GAAK6Z,GACT7C,EACA4R,EACAzH,EACA4H,EACAD,EAEH,KAGIK,CACT,OCjmBamC,GAMXv+C,WAAAA,CAAoBizC,EAAsBuL,GAAtB,KAAMvL,OAANA,EAHpB,KAAmBwL,oBAAwB,GAIzC,MAAM38B,EAASlkB,KAAKq1C,OAAO1a,aAErBmmB,EAAc,IAAI3U,GAAcjoB,EAAOqX,YACvC/+B,GrBuI+Bo0C,EqBvIG1sB,GrBwI1B2W,eACP,IAAIsR,GAAcyE,EAAYrV,YAC5BqV,EAAYH,WACd,IAAInC,GAAcsC,GAElB,IAAI9D,GAAa8D,GANtB,IAAmCA,EqBrIrC5wC,KAAK+gD,WDEH,SAA2BvkD,GAC/B,MAAO,CAAEA,SACX,CCJsBwkD,CAAiBxkD,GAEnC,MAAMykD,EAAqBL,EAAiBpK,YACtC0K,EAAoBN,EAAiBjL,WAGrCkB,EAAaiK,EAAYpU,eAC7B5D,GAAahI,WACbmgB,EAAmB9O,UACnB,MAEIwE,EAAYn6C,EAAOkwC,eACvB5D,GAAahI,WACbogB,EAAkB/O,UAClB,MAEIiO,EAAiB,IAAIxL,GACzBiC,EACAoK,EAAmBjM,qBACnB8L,EAAYlU,gBAERiD,EAAgB,IAAI+E,GACxB+B,EACAuK,EAAkBlM,qBAClBx4C,EAAOowC,gBAGT5sC,KAAK09C,WAAanH,GAAa1G,EAAeuQ,GAC9CpgD,KAAKmhD,gBAAkB,IAAI/L,GAAep1C,KAAKq1C,QAGjD,SAAItxB,GACF,OAAO/jB,KAAKq1C,QAYA,SAAA+L,GACdC,EACAxrB,GAEA,MAAMyrB,EAAQvK,GAA+BsK,EAAK3D,YAClD,OAAI4D,IAIAD,EAAKt9B,MAAM4W,aAAaE,iBACtBrE,GAAYX,KACXyrB,EAAMtd,kBAAkBpO,GAAaC,IAAO7uB,WAExCs6C,EAAMpd,SAASrO,GAGnB,IACT,CAEM,SAAU0rB,GAAYF,GAC1B,OAA2C,IAApCA,EAAKR,oBAAoB3uD,MAClC,UAcgBsvD,GACdH,EACAI,EACAC,GAEA,MAAMC,EAA8B,GACpC,GAAID,EAAa,CACf1iD,EACuB,MAArByiD,EACA,mDAEF,MAAM5rB,EAAOwrB,EAAKt9B,MAAMoW,MACxBknB,EAAKR,oBAAoB3kD,SAAQk6C,IAC/B,MAAMwL,EAAaxL,EAAayL,kBAAkBH,EAAa7rB,GAC3D+rB,GACFD,EAAa9qD,KAAK+qD,EACnB,GAEJ,CAED,GAAIH,EAAmB,CACrB,IAAIK,EAAY,GAChB,IAAK,IAAIpvD,EAAI,EAAGA,EAAI2uD,EAAKR,oBAAoB3uD,SAAUQ,EAAG,CACxD,MAAMqvD,EAAWV,EAAKR,oBAAoBnuD,GAC1C,GAAKqvD,EAASrU,QAAQ+T,IAEf,GAAIA,EAAkBO,iBAAkB,CAE7CF,EAAYA,EAAUG,OAAOZ,EAAKR,oBAAoBlqD,MAAMjE,EAAI,IAChE,KACD,OALCovD,EAAUjrD,KAAKkrD,EAMlB,CACDV,EAAKR,oBAAsBiB,CAC5B,MACCT,EAAKR,oBAAsB,GAE7B,OAAOc,CACT,CAKM,SAAUO,GACdb,EACArD,EACAC,EACA3C,GAGE0C,EAAUp/C,OAAS+0C,GAAcgB,OACJ,OAA7BqJ,EAAUj7C,OAAO03B,UAEjBz7B,EACE+3C,GAA+BsK,EAAK3D,YACpC,6DAEF1+C,EACE83C,GAA8BuK,EAAK3D,YACnC,4DAIJ,MAAMK,EAAesD,EAAK3D,WACpB1mD,EAAS6mD,GACbwD,EAAKN,WACLhD,EACAC,EACAC,EACA3C,GD7IY,IACdwC,EACApH,ECuJA,ODxJAoH,EC8I2BuD,EAAKN,WD7IhCrK,EC6I4C1/C,EAAO0/C,UD3InD13C,EACE03C,EAAUf,WAAWxD,UAAU3M,UAAUsY,EAActhD,OAAO++B,YAC9D,0BAEFv8B,EACE03C,EAAUF,YAAYrE,UAAU3M,UAAUsY,EAActhD,OAAO++B,YAC/D,2BCuIFv8B,EACEhI,EAAO0/C,UAAUF,YAAYxB,uBAC1B+I,EAAavH,YAAYxB,qBAC5B,2DAGFqM,EAAK3D,WAAa1mD,EAAO0/C,UAElByL,GACLd,EACArqD,EAAOy+C,QACPz+C,EAAO0/C,UAAUf,WAAWxD,UAC5B,KAEJ,CAyBA,SAASgQ,GACPd,EACA5L,EACAE,EACA8L,GAEA,MAAM/L,EAAgB+L,EAClB,CAACA,GACDJ,EAAKR,oBACT,OR5NI,SACJtL,EACAE,EACAE,EACAyM,GAEA,MAAM5M,EAAkB,GAClB6M,EAAkB,GAuDxB,OArDA5M,EAAQv5C,SAAQ25C,IjBkBF,IACd5R,EiBjB4C,kBAAxC4R,EAAOj3C,MACP22C,EAAenJ,OAAOnN,oBACpB4W,EAAO3J,QACP2J,EAAO/J,eAGTuW,EAAMxrD,MjBWVotC,EiBXgC4R,EAAO5R,UjBchC,CAAErlC,KAA4B,cAAEktC,aiBdW+J,EAAO/J,ajBcJ7H,ciBblD,IAGHqR,GACEC,EACAC,EAAM,gBAENC,EACA2M,EACAzM,GAEFL,GACEC,EACAC,EAAM,cAENC,EACA2M,EACAzM,GAEFL,GACEC,EACAC,EAAM,cAEN6M,EACAD,EACAzM,GAEFL,GACEC,EACAC,EAAM,gBAENC,EACA2M,EACAzM,GAEFL,GACEC,EACAC,EAAM,QAENC,EACA2M,EACAzM,GAGKH,CACT,CQ6JS8M,CACLjB,EAAKF,gBACL1L,EACAE,EACAD,EAEJ,CCvOA,IAAI6M,GC6BAC,SDjBSC,GAAbrgD,WAAAA,GAOW,KAAAsgD,MAA2B,IAAIh4C,KAsBpC,SAAUi4C,GACdC,EACA5E,EACAC,EACA4E,GAEA,MAAMpoB,EAAUujB,EAAUj7C,OAAO03B,QACjC,GAAgB,OAAZA,EAAkB,CACpB,MAAM4mB,EAAOuB,EAAUF,MAAMxuD,IAAIumC,GAEjC,OADAz7B,EAAe,MAARqiD,EAAc,gDACda,GACLb,EACArD,EACAC,EACA4E,EAEH,CAAM,CACL,IAAIrN,EAAkB,GAEtB,IAAK,MAAM6L,KAAQuB,EAAUF,MAAMr2C,SACjCmpC,EAASA,EAAOyM,OACdC,GAAmBb,EAAMrD,EAAWC,EAAa4E,IAIrD,OAAOrN,CACR,CACH,CAWM,SAAUsN,GACdF,EACA7+B,EACAk6B,EACAzH,EACAuM,GAEA,MAAMtoB,EAAU1W,EAAM2W,iBAChB2mB,EAAOuB,EAAUF,MAAMxuD,IAAIumC,GACjC,IAAK4mB,EAAM,CAET,IAAI1L,EAAa+F,GACfuC,EACA8E,EAAsBvM,EAAc,MAElCwM,GAAqB,EACrBrN,EACFqN,GAAqB,EACZxM,aAAuB1N,IAChC6M,EAAaiG,GACXqC,EACAzH,GAEFwM,GAAqB,IAErBrN,EAAa7M,GAAahI,WAC1BkiB,GAAqB,GAEvB,MAAMtM,EAAYH,GAChB,IAAI3B,GAAUe,EAAYqN,GAAoB,GAC9C,IAAIpO,GAAU4B,EAAauM,GAAqB,IAElD,OAAO,IAAIpC,GAAK58B,EAAO2yB,EACxB,CACD,OAAO2K,CACT,CAYgB,SAAA4B,GACdL,EACA7+B,EACA09B,EACAxD,EACAzH,EACAuM,GAEA,MAAM1B,EAAOyB,GACXF,EACA7+B,EACAk6B,EACAzH,EACAuM,GAOF,OALKH,EAAUF,MAAMz3C,IAAI8Y,EAAM2W,mBAC7BkoB,EAAUF,MAAMv3C,IAAI4Y,EAAM2W,iBAAkB2mB,GDjDhC,SACdA,EACAI,GAEAJ,EAAKR,oBAAoBhqD,KAAK4qD,EAChC,CC+CEyB,CAAyB7B,EAAMI,GDgDjB,SACdJ,EACAjL,GAEA,MAAMO,EAAY0K,EAAK3D,WAAW/H,WAC5BwN,EAA2B,GAC5BxM,EAAUxE,UAAU9O,cACLsT,EAAUxE,UAClBxN,aAAae,IAAgB,CAACvuC,EAAKktC,KAC3C8e,EAAetsD,KAAKk1C,GAAiB50C,EAAKktC,GAAW,IAMzD,OAHIsS,EAAU3B,sBACZmO,EAAetsD,KAAKg1C,GAAY8K,EAAUxE,YAErCgQ,GACLd,EACA8B,EACAxM,EAAUxE,UACViE,EAEJ,CCpESgN,CAAqB/B,EAAMI,EACpC,CAYM,SAAU4B,GACdT,EACA7+B,EACA09B,EACAC,GAEA,MAAMjnB,EAAU1W,EAAM2W,iBAChB4oB,EAA0B,GAChC,IAAI3B,EAAwB,GAC5B,MAAM4B,EAAkBC,GAAyBZ,GACjD,GAAgB,YAAZnoB,EAEF,IAAK,MAAOgpB,EAAapC,KAASuB,EAAUF,MAAM12C,UAChD21C,EAAeA,EAAaM,OAC1BT,GAA4BH,EAAMI,EAAmBC,IAEnDH,GAAYF,KACduB,EAAUF,MAAMx2C,OAAOu3C,GAGlBpC,EAAKt9B,MAAM4W,aAAaE,gBAC3ByoB,EAAQzsD,KAAKwqD,EAAKt9B,YAInB,CAEL,MAAMs9B,EAAOuB,EAAUF,MAAMxuD,IAAIumC,GAC7B4mB,IACFM,EAAeA,EAAaM,OAC1BT,GAA4BH,EAAMI,EAAmBC,IAEnDH,GAAYF,KACduB,EAAUF,MAAMx2C,OAAOuuB,GAGlB4mB,EAAKt9B,MAAM4W,aAAaE,gBAC3ByoB,EAAQzsD,KAAKwqD,EAAKt9B,QAIzB,CASD,OAPIw/B,IAAoBC,GAAyBZ,IAE/CU,EAAQzsD,KACN,IA5KJmI,EAAOujD,GAAsB,oCACtBA,IA2KsCx+B,EAAM2/B,MAAO3/B,EAAMoW,QAIzD,CAAEmpB,UAAS9N,OAAQmM,EAC5B,CAEM,SAAUgC,GAAuBf,GACrC,MAAM5rD,EAAS,GACf,IAAK,MAAMqqD,KAAQuB,EAAUF,MAAMr2C,SAC5Bg1C,EAAKt9B,MAAM4W,aAAaE,gBAC3B7jC,EAAOH,KAAKwqD,GAGhB,OAAOrqD,CACT,CAMgB,SAAA4sD,GACdhB,EACA/sB,GAEA,IAAI2gB,EAA2B,KAC/B,IAAK,MAAM6K,KAAQuB,EAAUF,MAAMr2C,SACjCmqC,EAAcA,GAAe4K,GAA2BC,EAAMxrB,GAEhE,OAAO2gB,CACT,CAEgB,SAAAqN,GACdjB,EACA7+B,GAGA,GADeA,EAAM4W,aACVE,eACT,OAAOipB,GAAyBlB,GAC3B,CACL,MAAMnoB,EAAU1W,EAAM2W,iBACtB,OAAOkoB,EAAUF,MAAMxuD,IAAIumC,EAC5B,CACH,CAEgB,SAAAspB,GACdnB,EACA7+B,GAEA,OAAkD,MAA3C8/B,GAAsBjB,EAAW7+B,EAC1C,CAEM,SAAUy/B,GAAyBZ,GACvC,OAA8C,MAAvCkB,GAAyBlB,EAClC,CAEM,SAAUkB,GAAyBlB,GACvC,IAAK,MAAMvB,KAAQuB,EAAUF,MAAMr2C,SACjC,GAAIg1C,EAAKt9B,MAAM4W,aAAaE,eAC1B,OAAOwmB,EAGX,OAAO,IACT,CChNA,IAAI2C,GAAwB,QA2BfC,GAkBX7hD,WAAAA,CAAmB8hD,GAAA,KAAeA,gBAAfA,EAdnB,KAAAC,eAA2C,IAAIlN,GAAyB,MAKxE,KAAiBmN,kBNsfV,CACL1J,cAAejC,GAAcE,QAC7BwB,UAAW,GACXU,aAAc,GMvfP,KAAAwJ,cAAqC,IAAI35C,IACzC,KAAA45C,cAAqC,IAAI55C,KAc9C,SAAU65C,GACdC,EACA3uB,EACA4uB,EACAvK,EACAriB,GAWA,ONjGI,SACJgiB,EACAhkB,EACA2V,EACA0O,EACAriB,GAEA74B,EACEk7C,EAAUL,EAAUgB,YACpB,qDAEc1oD,IAAZ0lC,IACFA,GAAU,GAEZgiB,EAAUM,UAAUtjD,KAAK,CACvBg/B,OACA2V,OACA0O,UACAriB,YAGEA,IACFgiB,EAAUa,cAAgB9B,GACxBiB,EAAUa,cACV7kB,EACA2V,IAGJqO,EAAUgB,YAAcX,CAC1B,CM4DEwK,CACEF,EAASJ,kBACTvuB,EACA4uB,EACAvK,EACAriB,GAGGA,EAGI8sB,GACLH,EACA,IAAIhQ,GhB/HD,CACLX,UAAU,EACVC,YAAY,EACZrZ,QAAS,KACTsZ,QAAQ,GgB2HkCle,EAAM4uB,IAJzC,EAOX,CA8BM,SAAUG,GACdJ,EACAtK,GACuB,IAAvBhG,EAAAjiD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAEA,MAAMu4B,ENjFQ,SACdqvB,EACAK,GAEA,IAAK,IAAIxnD,EAAI,EAAGA,EAAImnD,EAAUM,UAAUjoD,OAAQQ,IAAK,CACnD,MAAMmyD,EAAShL,EAAUM,UAAUznD,GACnC,GAAImyD,EAAO3K,UAAYA,EACrB,OAAO2K,CAEV,CACD,OAAO,IACT,CMsEgBC,CAAkBN,EAASJ,kBAAmBlK,GAK5D,GAJyBD,GACvBuK,EAASJ,kBACTlK,GAIK,CACL,IAAIjG,EAAe,IAAIgD,GAAuB,MAS9C,OARkB,MAAdzsB,EAAMghB,KAERyI,EAAeA,EAAa9oC,IAAIwqB,MAAgB,GAEhDnW,GAAKgL,EAAMwgB,UAAWxX,IACpBygB,EAAeA,EAAa9oC,IAAI,IAAIkqB,GAAK7B,IAAa,EAAK,IAGxDmxB,GACLH,EACA,IAAIxQ,GAAaxpB,EAAMqL,KAAMoe,EAAcC,GAE9C,CAfC,MAAO,EAgBX,UAOgB6Q,GACdP,EACA3uB,EACA4uB,GAEA,OAAOE,GACLH,EACA,IAAIhQ,GhBhMC,CACLX,UAAU,EACVC,YAAY,EACZrZ,QAAS,KACTsZ,QAAQ,GgB4LkCle,EAAM4uB,GAEpD,CA0EgB,SAAAO,GACdR,EACAzgC,EACA09B,EACAC,GACyB,IAAzBuD,EAAiBhzD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAGjB,MAAM4jC,EAAO9R,EAAMoW,MACb+qB,EAAiBV,EAASL,eAAejwD,IAAI2hC,GACnD,IAAI8rB,EAAwB,GAI5B,GACEuD,IAC4B,YAA3BnhC,EAAM2W,kBACLqpB,GAA4BmB,EAAgBnhC,IAC9C,CACA,MAAMohC,EAAmB9B,GACvB6B,EACAnhC,EACA09B,EACAC,GD7Q4B,IC+QTwD,ED/QNxC,MAAMz3B,OCgRnBu5B,EAASL,eAAiBK,EAASL,eAAexnC,OAAOkZ,IAG3D,MAAMytB,EAAU6B,EAAiB7B,QAGjC,GAFA3B,EAAewD,EAAiB3P,QAE3ByP,EAAmB,CAStB,MAAMG,GACH,IACD9B,EAAQlJ,WAAUr2B,GACTA,EAAM4W,aAAaE,iBAExBwqB,EAAUb,EAASL,eAAenM,WACtCniB,GACA,CAACwhB,EAAciO,IACb9B,GAAyB8B,KAG7B,GAAIF,IAAoBC,EAAS,CAC/B,MAAMhR,EAAUmQ,EAASL,eAAe9P,QAAQxe,GAGhD,IAAKwe,EAAQrtC,UAAW,CAEtB,MAAMu+C,EAgfhB,SACElR,GAEA,OAAOA,EAAQuD,MAAa,CAACP,EAAcmO,EAAqBC,KAC9D,GAAID,GAAuBhC,GAAyBgC,GAAsB,CAExE,MAAO,CADc1B,GAAyB0B,GAE/C,CAAM,CAEL,IAAI9C,EAAgB,GAOpB,OANI8C,IACF9C,EAAQiB,GAAuB6B,IAEjChmC,GAAKimC,GAAU,CAAC52C,EAAc62C,KAC5BhD,EAAQA,EAAMT,OAAOyD,EAAW,IAE3BhD,CACR,IAEL,CAngB2BiD,CAAwCtR,GAGzD,IAAK,IAAI3hD,EAAI,EAAGA,EAAI6yD,EAASrzD,SAAUQ,EAAG,CACxC,MAAM2uD,EAAOkE,EAAS7yD,GACpBkzD,EAAWvE,EAAKt9B,MACZnC,EAAWikC,GAA+BrB,EAAUnD,GAC1DmD,EAASN,gBAAgB4B,eACvBC,GAA2BH,GAC3BI,GAAoBxB,EAAUoB,GAC9BhkC,EAASmZ,OACTnZ,EAAS6R,WAEZ,CACF,CAEF,CAID,IAAK4xB,GAAW/B,EAAQpxD,OAAS,IAAMwvD,EAGrC,GAAI0D,EAAiB,CAEnB,MAAMa,EAA4B,KAClCzB,EAASN,gBAAgBgC,cACvBH,GAA2BhiC,GAC3BkiC,EAEH,MACC3C,EAAQpnD,SAASiqD,IACf,MAAMC,EAAc5B,EAASF,cAAcpwD,IACzCmyD,GAAsBF,IAExB3B,EAASN,gBAAgBgC,cACvBH,GAA2BI,GAC3BC,EACD,GAIR,EA2eL,SAA6B5B,EAAoB/lB,GAC/C,IAAK,IAAIv1B,EAAI,EAAGA,EAAIu1B,EAAQvsC,SAAUgX,EAAG,CACvC,MAAMo9C,EAAe7nB,EAAQv1B,GAC7B,IAAKo9C,EAAa3rB,aAAaE,eAAgB,CAE7C,MAAM0rB,EAAkBF,GAAsBC,GACxCE,EAAkBhC,EAASF,cAAcpwD,IAAIqyD,GACnD/B,EAASF,cAAcp4C,OAAOq6C,GAC9B/B,EAASH,cAAcn4C,OAAOs6C,EAC/B,CACF,CACH,CApfIC,CAAoBjC,EAAUlB,EAC/B,CAGD,OAAO3B,CACT,CAOM,SAAU+E,GACdlC,EACA3uB,EACA2V,EACAh3C,GAEA,MAAMmyD,EAAWC,GAAwBpC,EAAUhwD,GACnD,GAAgB,MAAZmyD,EAAkB,CACpB,MAAM3sB,EAAI6sB,GAAuBF,GAC3BG,EAAY9sB,EAAEnE,KAClB4E,EAAUT,EAAES,QACR4c,EAAe5gB,GAAgBqwB,EAAWjxB,GAMhD,OAAOkxB,GAA8BvC,EAAUsC,EALpC,IAAItS,GACbZ,GAAoCnZ,GACpC4c,EACA7L,GAGH,CAEC,MAAO,EAEX,CAqCM,SAAUwb,GACdxC,EACAzgC,EACA09B,GACyB,IAAzBwF,EAAiBh1D,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAEjB,MAAM4jC,EAAO9R,EAAMoW,MAEnB,IAAIqc,EAA2B,KAC3B0Q,GAA2B,EAG/B1C,EAASL,eAAehM,cAActiB,GAAM,CAACsxB,EAAiBC,KAC5D,MAAM/P,EAAe5gB,GAAgB0wB,EAAiBtxB,GACtD2gB,EACEA,GAAeoN,GAAgCwD,EAAI/P,GACrD6P,EACEA,GAA4B1D,GAAyB4D,EAAG,IAE5D,IAWIrE,EAXAH,EAAY4B,EAASL,eAAejwD,IAAI2hC,GAY5C,GAXK+sB,GAIHsE,EACEA,GAA4B1D,GAAyBZ,GACvDpM,EACEA,GAAeoN,GAAgChB,EAAWjtB,QAN5DitB,EAAY,IAAIH,GAChB+B,EAASL,eAAiBK,EAASL,eAAeh5C,IAAI0qB,EAAM+sB,IAS3C,MAAfpM,EACFuM,GAAsB,MACjB,CACLA,GAAsB,EACtBvM,EAAc1N,GAAahI,WACX0jB,EAASL,eAAe9P,QAAQxe,GACxC2iB,cAAa,CAACvU,EAAWojB,KAC/B,MAAMnJ,EAAgB0F,GACpByD,EACA1xB,MAEEuoB,IACF1H,EAAcA,EAAYlS,qBACxBL,EACAia,GAEH,GAEJ,CAED,MAAMoJ,EAAoBvD,GAA4BnB,EAAW7+B,GACjE,IAAKujC,IAAsBvjC,EAAM4W,aAAaE,eAAgB,CAE5D,MAAM8rB,EAAWN,GAAsBtiC,GACvC/kB,GACGwlD,EAASF,cAAcr5C,IAAI07C,GAC5B,0CAEF,MAAMnyD,EAwXDwvD,KAvXLQ,EAASF,cAAcn5C,IAAIw7C,EAAUnyD,GACrCgwD,EAASH,cAAcl5C,IAAI3W,EAAKmyD,EACjC,CAED,IAAInR,EAASyN,GACXL,EACA7+B,EACA09B,EAJkB1H,GAAqByK,EAASJ,kBAAmBvuB,GAMnE2gB,EACAuM,GAEF,IAAKuE,IAAsBJ,IAA6BD,EAAmB,CACzE,MAAM5F,EAAOwC,GAAsBjB,EAAW7+B,GAC9CyxB,EAASA,EAAOyM,OAiXpB,SACEuC,EACAzgC,EACAs9B,GAEA,MAAMxrB,EAAO9R,EAAMoW,MACb3lC,EAAMwxD,GAAoBxB,EAAUzgC,GACpCnC,EAAWikC,GAA+BrB,EAAUnD,GAEpD7L,EAASgP,EAASN,gBAAgB4B,eACtCC,GAA2BhiC,GAC3BvvB,EACAotB,EAASmZ,OACTnZ,EAAS6R,YAGL4gB,EAAUmQ,EAASL,eAAe9P,QAAQxe,GAGhD,GAAIrhC,EACFwK,GACGwkD,GAAyBnP,EAAQ11C,OAClC,yDAEG,CAEL,MAAM4oD,EAAgBlT,EAAQuD,MAC5B,CAACP,EAAcmO,EAAqBC,KAClC,IACGjvB,GAAY6gB,IACbmO,GACAhC,GAAyBgC,GAEzB,MAAO,CAAC1B,GAAyB0B,GAAqBzhC,OACjD,CAEL,IAAI0a,EAA0B,GAW9B,OAVI+mB,IACF/mB,EAAUA,EAAQwjB,OAChB0B,GAAuB6B,GAAqB1sD,KAC1CuoD,GAAQA,EAAKt9B,UAInBvE,GAAKimC,GAAU,CAAC52C,EAAc24C,KAC5B/oB,EAAUA,EAAQwjB,OAAOuF,EAAa,IAEjC/oB,CACR,KAGL,IAAK,IAAI/rC,EAAI,EAAGA,EAAI60D,EAAcr1D,SAAUQ,EAAG,CAC7C,MAAM+0D,EAAcF,EAAc70D,GAClC8xD,EAASN,gBAAgBgC,cACvBH,GAA2B0B,GAC3BzB,GAAoBxB,EAAUiD,GAEjC,CACF,CACD,OAAOjS,CACT,CA7a2BkS,CAAuBlD,EAAUzgC,EAAOs9B,GAChE,CACD,OAAO7L,CACT,UAagBmS,GACdnD,EACA3uB,EACA0lB,GAEA,MACM1B,EAAY2K,EAASJ,kBACrB5N,EAAcgO,EAASL,eAAenM,WAC1CniB,GACA,CAACiiB,EAAW8K,KACV,MACMpM,EAAcoN,GAClBhB,EAFmBnsB,GAAgBqhB,EAAWjiB,IAKhD,GAAI2gB,EACF,OAAOA,CACR,IAGL,OAAO4E,GACLvB,EACAhkB,EACA2gB,EACA+E,GAnBwB,EAsB5B,CAEgB,SAAAqM,GACdpD,EACAzgC,GAEA,MAAM8R,EAAO9R,EAAMoW,MACnB,IAAIqc,EAA2B,KAG/BgO,EAASL,eAAehM,cAActiB,GAAM,CAACsxB,EAAiBC,KAC5D,MAAM/P,EAAe5gB,GAAgB0wB,EAAiBtxB,GACtD2gB,EACEA,GAAeoN,GAAgCwD,EAAI/P,EAAa,IAEpE,IAAIuL,EAAY4B,EAASL,eAAejwD,IAAI2hC,GACvC+sB,EAIHpM,EACEA,GAAeoN,GAAgChB,EAAWjtB,OAJ5DitB,EAAY,IAAIH,GAChB+B,EAASL,eAAiBK,EAASL,eAAeh5C,IAAI0qB,EAAM+sB,IAK9D,MAAMG,EAAqC,MAAfvM,EACtBqR,EAAoC9E,EACtC,IAAInO,GAAU4B,GAAa,GAAM,GACjC,KAYJ,OFliBI,SAA8B6K,GAClC,OAAOvK,GAA8BuK,EAAK3D,WAC5C,CEgiBSoK,CAPYhF,GACjBF,EACA7+B,EANuCg2B,GACvCyK,EAASJ,kBACTrgC,EAAMoW,OAMN4oB,EAAsB8E,EAAgB1V,UAAYrJ,GAAahI,WAC/DiiB,GAGJ,CAeA,SAAS4B,GACPH,EACAxG,GAEA,OAAO+J,GACL/J,EACAwG,EAASL,eACQ,KACjBpK,GAAqByK,EAASJ,kBAAmBzuB,MAErD,CAKA,SAASoyB,GACP/J,EACAgK,EACAxR,EACAyH,GAEA,GAAIznB,GAAYwnB,EAAUnoB,MACxB,OAAOoyB,GACLjK,EACAgK,EACAxR,EACAyH,GAEG,CACL,MAAM2E,EAAYoF,EAAc9zD,IAAIyhC,MAGjB,MAAf6gB,GAAoC,MAAboM,IACzBpM,EAAcoN,GAAgChB,EAAWjtB,OAG3D,IAAI6f,EAAkB,GACtB,MAAMvR,EAAYrO,GAAaooB,EAAUnoB,MACnCqyB,EAAiBlK,EAAU5J,kBAAkBnQ,GAC7CgD,EAAY+gB,EAAchd,SAAS92C,IAAI+vC,GAC7C,GAAIgD,GAAaihB,EAAgB,CAC/B,MAAMC,EAAmB3R,EACrBA,EAAYxS,kBAAkBC,GAC9B,KACEmkB,EAAmBpL,GAAkBiB,EAAaha,GACxDuR,EAASA,EAAOyM,OACd8F,GACEG,EACAjhB,EACAkhB,EACAC,GAGL,CAQD,OANIxF,IACFpN,EAASA,EAAOyM,OACdU,GAAwBC,EAAW5E,EAAWC,EAAazH,KAIxDhB,CACR,CACH,CAKA,SAASyS,GACPjK,EACAgK,EACAxR,EACAyH,GAEA,MAAM2E,EAAYoF,EAAc9zD,IAAIyhC,MAGjB,MAAf6gB,GAAoC,MAAboM,IACzBpM,EAAcoN,GAAgChB,EAAWjtB,OAG3D,IAAI6f,EAAkB,GAyBtB,OAxBAwS,EAAchd,SAAShK,kBAAiB,CAACiD,EAAWgD,KAClD,MAAMkhB,EAAmB3R,EACrBA,EAAYxS,kBAAkBC,GAC9B,KACEmkB,EAAmBpL,GAAkBiB,EAAaha,GAClDikB,EAAiBlK,EAAU5J,kBAAkBnQ,GAC/CikB,IACF1S,EAASA,EAAOyM,OACdgG,GACEC,EACAjhB,EACAkhB,EACAC,IAGL,IAGCxF,IACFpN,EAASA,EAAOyM,OACdU,GAAwBC,EAAW5E,EAAWC,EAAazH,KAIxDhB,CACT,CAEA,SAASqQ,GACPrB,EACAnD,GAEA,MAAMt9B,EAAQs9B,EAAKt9B,MACbvvB,EAAMwxD,GAAoBxB,EAAUzgC,GAE1C,MAAO,CACLgX,OAAQA,KACN,MAAMumB,EF5qBN,SAA6BD,GACjC,OAAOA,EAAK3D,WAAWlH,YAAYrE,SACrC,CE0qBoBkW,CAAmBhH,IAASvY,GAAahI,WACvD,OAAOwgB,EAAM5tB,MAAM,EAErBD,WAAayH,IACX,GAAe,OAAXA,EACF,OAAI1mC,WApfVgwD,EACA3uB,EACArhC,GAEA,MAAMmyD,EAAWC,GAAwBpC,EAAUhwD,GACnD,GAAImyD,EAAU,CACZ,MAAM3sB,EAAI6sB,GAAuBF,GAC3BG,EAAY9sB,EAAEnE,KAClB4E,EAAUT,EAAES,QACR4c,EAAe5gB,GAAgBqwB,EAAWjxB,GAKhD,OAAOkxB,GAA8BvC,EAAUsC,EAJpC,IAAIxS,GACbV,GAAoCnZ,GACpC4c,GAGH,CAEC,MAAO,EAEX,CAkeiBiR,CAAkC9D,EAAUzgC,EAAMoW,MAAO3lC,GArgB1D,SACdgwD,EACA3uB,GAEA,OAAO8uB,GACLH,EACA,IAAIlQ,GhBjOC,CACLT,UAAU,EACVC,YAAY,EACZrZ,QAAS,KACTsZ,QAAQ,GgB6NuCle,GAEnD,CA+fiB0yB,CAA4B/D,EAAUzgC,EAAMoW,OAEhD,CAGL,MAAMx3B,E3D3UE,SAAmB0C,EAAc0e,GAC/C,IAAIuP,EAAS,gBACA,YAATjuB,EACFiuB,EACE,0FAEgB,sBAATjuB,EACTiuB,EAAS,6DACS,gBAATjuB,IACTiuB,EAAS,8BAGX,MAAM3wB,EAAQ,IAAIvD,MAChBiG,EAAO,OAAS0e,EAAMoW,MAAMvd,WAAa,KAAO0W,GAIlD,OADC3wB,EAAc0C,KAAOA,EAAKmjD,cACpB7lD,CACT,C2DyTsB8lD,CAAmBvtB,EAAQnX,GACzC,OAAOihC,GACLR,EACAzgC,EACsB,KACtBphB,EAEH,GAGP,CAKgB,SAAAqjD,GACdxB,EACAzgC,GAEA,MAAM4iC,EAAWN,GAAsBtiC,GACvC,OAAOygC,EAASF,cAAcpwD,IAAIyyD,EACpC,CAKA,SAASN,GAAsBtiC,GAC7B,OAAOA,EAAMoW,MAAMvd,WAAa,IAAMmH,EAAM2W,gBAC9C,CAKA,SAASksB,GACPpC,EACAhwD,GAEA,OAAOgwD,EAASH,cAAcnwD,IAAIM,EACpC,CAKA,SAASqyD,GAAuBF,GAI9B,MAAM+B,EAAa/B,EAAS7zD,QAAQ,KAKpC,OAJAkM,GACkB,IAAhB0pD,GAAqBA,EAAa/B,EAASz0D,OAAS,EACpD,iBAEK,CACLuoC,QAASksB,EAAS3yD,OAAO00D,EAAa,GACtC7yB,KAAM,IAAIR,GAAKsxB,EAAS3yD,OAAO,EAAG00D,IAEtC,CAKA,SAAS3B,GACPvC,EACAsC,EACA9I,GAEA,MAAM4E,EAAY4B,EAASL,eAAejwD,IAAI4yD,GAC9C9nD,EAAO4jD,EAAW,wDAKlB,OAAOD,GAAwBC,EAAW5E,EAJtBjE,GAClByK,EAASJ,kBACT0C,GAEgE,KACpE,CAgCA,SAASf,GAA2BhiC,GAClC,OAAIA,EAAM4W,aAAaE,iBAAmB9W,EAAM4W,aAAaC,YAIpD,IA3zBT57B,EAAOwjD,GAAsB,oCACtBA,IA0zB0Cz+B,EAAM2/B,MAAO3/B,EAAMoW,OAE3DpW,CAEX,CC52BA,MAAM4kC,GACJvmD,WAAAA,CAAqByyC,GAAA,KAAKA,MAALA,EAErB7Q,iBAAAA,CAAkBC,GAChB,MAAMgF,EAAQjpC,KAAK60C,MAAM7Q,kBAAkBC,GAC3C,OAAO,IAAI0kB,GAAsB1f,GAGnCrK,IAAAA,GACE,OAAO5+B,KAAK60C,OAIhB,MAAM+T,GAIJxmD,WAAAA,CAAYoiD,EAAoB3uB,GAC9B71B,KAAK6oD,UAAYrE,EACjBxkD,KAAK8oD,MAAQjzB,EAGfmO,iBAAAA,CAAkBC,GAChB,MAAMkT,EAAY9gB,GAAUr2B,KAAK8oD,MAAO7kB,GACxC,OAAO,IAAI2kB,GAAsB5oD,KAAK6oD,UAAW1R,GAGnDvY,IAAAA,GACE,OAAO+oB,GAA+B3nD,KAAK6oD,UAAW7oD,KAAK8oD,QAOxD,MAcMC,GAA2B,SACtCpqD,EACAqqD,EACAC,GAEA,OAAKtqD,GAA0B,kBAAVA,GAGrBK,EAAO,QAASL,EAAO,6CAEK,kBAAjBA,EAAM,OACRuqD,GAA2BvqD,EAAM,OAAQqqD,EAAaC,GAC5B,kBAAjBtqD,EAAM,OACfwqD,GAA4BxqD,EAAM,OAAQqqD,QAEjDhqD,GAAO,EAAO,4BAA8BvD,KAAKC,UAAUiD,EAAO,KAAM,KATjEA,CAWX,EAEMuqD,GAA6B,SACjCE,EACArH,EACAkH,GAEA,GACO,cADCG,EAEJ,OAAOH,EAAwB,UAE/BjqD,GAAO,EAAO,4BAA8BoqD,EAElD,EAEMD,GAA8B,SAClCC,EACArH,EACAsH,GAEKD,EAAGnmD,eAAe,cACrBjE,GAAO,EAAO,4BAA8BvD,KAAKC,UAAU0tD,EAAI,KAAM,IAEvE,MAAMhrB,EAAQgrB,EAAc,UACP,kBAAVhrB,GACTp/B,GAAO,EAAO,+BAAiCo/B,GAGjD,MAAMkrB,EAAevH,EAASnjB,OAO9B,GANA5/B,EACmB,OAAjBsqD,GAAiD,qBAAjBA,EAChC,+CAIGA,EAAajmB,aAChB,OAAOjF,EAGT,MACM4qB,EADOM,EACYzkB,WACzB,MAA2B,kBAAhBmkB,EACF5qB,EAIF4qB,EAAc5qB,CACvB,EASamrB,GAA2B,SACtC1zB,EACA+I,EACA4lB,EACAyE,GAEA,OAAOO,GACL5qB,EACA,IAAIgqB,GAAsBpE,EAAU3uB,GACpCozB,EAEJ,EAOaQ,GAA+B,SAC1C7qB,EACAmjB,EACAkH,GAEA,OAAOO,GACL5qB,EACA,IAAI+pB,GAAsB5G,GAC1BkH,EAEJ,EAEA,SAASO,GACP5qB,EACAoqB,EACAC,GAEA,MAAMS,EAAS9qB,EAAK0E,cAAcp0B,MAM5Bg0B,EAAW6lB,GACfW,EACAV,EAAYhlB,kBAAkB,aAC9BilB,GAEF,IAAI9pB,EAEJ,GAAIP,EAAKyE,aAAc,CACrB,MAAMsmB,EAAW/qB,EACXjgC,EAAQoqD,GACZY,EAAS9kB,WACTmkB,EACAC,GAEF,OACEtqD,IAAUgrD,EAAS9kB,YACnB3B,IAAaymB,EAASrmB,cAAcp0B,MAE7B,IAAIw0B,GAAS/kC,EAAOksC,GAAa3H,IAEjCtE,CAEV,CAAM,CACL,MAAMgrB,EAAehrB,EAerB,OAdAO,EAAUyqB,EACN1mB,IAAa0mB,EAAatmB,cAAcp0B,QAC1CiwB,EAAUA,EAAQ2E,eAAe,IAAIJ,GAASR,KAEhD0mB,EAAajlB,aAAae,IAAgB,CAACzB,EAAWI,KACpD,MAAME,EAAeilB,GACnBnlB,EACA2kB,EAAYhlB,kBAAkBC,GAC9BglB,GAEE1kB,IAAiBF,IACnBlF,EAAUA,EAAQmF,qBAAqBL,EAAWM,GACnD,IAEIpF,CACR,CACH,OC9Ma0qB,GAMXznD,WAAAA,GAG4D,IAFjDhQ,EAAeH,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,MACf63D,EAAA73D,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAyB,KAC3B2sC,EAAA3sC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAoB,CAAE+4C,SAAU,CAAC,EAAG+e,WAAY,GAF9C,KAAI33D,KAAJA,EACA,KAAM03D,OAANA,EACF,KAAIlrB,KAAJA,GAUK,SAAAorB,GAAepX,EAAeqX,GAE5C,IAAIp0B,EAAOo0B,aAAmB50B,GAAO40B,EAAU,IAAI50B,GAAK40B,GACpDhhB,EAAQ2J,EACVvK,EAAOzS,GAAaC,GACtB,KAAgB,OAATwS,GAAe,CACpB,MAAMhE,EAAYt9B,EAAQkiC,EAAMrK,KAAKoM,SAAU3C,IAAS,CACtD2C,SAAU,CAAC,EACX+e,WAAY,GAEd9gB,EAAQ,IAAI4gB,GAAQxhB,EAAMY,EAAO5E,GACjCxO,EAAOE,GAAaF,GACpBwS,EAAOzS,GAAaC,EACrB,CAED,OAAOoT,CACT,CAOM,SAAUihB,GAAgBtX,GAC9B,OAAOA,EAAKhU,KAAKjgC,KACnB,CAOgB,SAAAwrD,GAAgBvX,EAAej0C,GAC7Ci0C,EAAKhU,KAAKjgC,MAAQA,EAClByrD,GAAkBxX,EACpB,CAKM,SAAUyX,GAAmBzX,GACjC,OAAOA,EAAKhU,KAAKmrB,WAAa,CAChC,CAcgB,SAAAO,GACd1X,EACAz3C,GAEAqkB,GAAKozB,EAAKhU,KAAKoM,UAAU,CAAC/B,EAAehC,KACvC9rC,EAAO,IAAI0uD,GAAQ5gB,EAAO2J,EAAM3L,GAAW,GAE/C,CAWM,SAAUsjB,GACd3X,EACAz3C,EACAqvD,EACAC,GAEID,IAAgBC,GAClBtvD,EAAOy3C,GAGT0X,GAAiB1X,GAAM3J,IACrBshB,GAAsBthB,EAAO9tC,GAAQ,EAAMsvD,EAAc,IAGvDD,GAAeC,GACjBtvD,EAAOy3C,EAEX,CAgDM,SAAU8X,GAAe9X,GAC7B,OAAO,IAAIvd,GACO,OAAhBud,EAAKkX,OACDlX,EAAKxgD,KACLs4D,GAAY9X,EAAKkX,QAAU,IAAMlX,EAAKxgD,KAE9C,CAKA,SAASg4D,GAAqBxX,GACR,OAAhBA,EAAKkX,QAWX,SAA4BlX,EAAe3O,EAAmBgF,GAC5D,MAAM0hB,EApHF,SAAyB/X,GAC7B,YAA8BzgD,IAAvB+3D,GAAatX,KAAwByX,GAAgBzX,EAC9D,CAkHqBgY,CAAY3hB,GACzB4hB,EAAchkD,EAAS+rC,EAAKhU,KAAKoM,SAAU/G,GAC7C0mB,GAAcE,UACTjY,EAAKhU,KAAKoM,SAAS/G,GAC1B2O,EAAKhU,KAAKmrB,aACVK,GAAkBxX,IACR+X,GAAeE,IACzBjY,EAAKhU,KAAKoM,SAAS/G,GAAagF,EAAMrK,KACtCgU,EAAKhU,KAAKmrB,aACVK,GAAkBxX,GAEtB,CAtBIkY,CAAgBlY,EAAKkX,OAAQlX,EAAKxgD,KAAMwgD,EAE5C,CCvKO,MAAMmY,GAAqB,iCAMrBC,GAAsB,+BAKtBC,GAAiB,SAEjBC,GAAa,SAAU/zD,GAClC,MACiB,kBAARA,GAAmC,IAAfA,EAAIjF,SAAiB64D,GAAmB7lD,KAAK/N,EAE5E,EAEag0D,GAAoB,SAAU33B,GACzC,MACwB,kBAAfA,GACe,IAAtBA,EAAWthC,SACV84D,GAAoB9lD,KAAKsuB,EAE9B,EA0Ca43B,GAAuB,SAClCjiD,EACAjD,EACA4iD,GAEA,MAAMjzB,EACJizB,aAAiBzzB,GAAO,IAAI4B,GAAe6xB,EAAO3/C,GAAe2/C,EAEnE,QAAa32D,IAAT+T,EACF,MAAM,IAAI9G,MACR+J,EAAc,sBAAwBquB,GAA4B3B,IAGtE,GAAoB,oBAAT3vB,EACT,MAAM,IAAI9G,MACR+J,EACE,uBACAquB,GAA4B3B,GAC5B,oBACA3vB,EAAK0W,YAGX,GAAI2B,GAAoBrY,GACtB,MAAM,IAAI9G,MACR+J,EACE,YACAjD,EAAK0W,WACL,IACA4a,GAA4B3B,IAKlC,GACkB,kBAAT3vB,GACPA,EAAKhU,OAAS+4D,GAAiB,GAC/B3hD,EAAapD,GAAQ+kD,GAErB,MAAM,IAAI7rD,MACR+J,EACE,kCACA8hD,GACA,eACAzzB,GAA4B3B,GAC5B,MACA3vB,EAAKrT,UAAU,EAAG,IAClB,SAMN,GAAIqT,GAAwB,kBAATA,EAAmB,CACpC,IAAImlD,GAAc,EACdC,GAAiB,EAwBrB,GAvBA9rC,GAAKtZ,GAAM,CAAC/O,EAAawH,KACvB,GAAY,WAARxH,EACFk0D,GAAc,OACT,GAAY,cAARl0D,GAA+B,QAARA,IAChCm0D,GAAiB,GACZJ,GAAW/zD,IACd,MAAM,IAAIiI,MACR+J,EACE,6BACAhS,EACA,KACAqgC,GAA4B3B,GAJ9B1sB,yF/C4GI,SACdouB,EACA0R,GAGI1R,EAAeJ,OAAOjlC,OAAS,IACjCqlC,EAAeH,aAAe,GAEhCG,EAAeJ,OAAOtgC,KAAKoyC,GAC3B1R,EAAeH,aAAe9tB,EAAa2/B,GAC3C3R,GAAyBC,EAC3B,C+C5GMg0B,CAAmB11B,EAAM1+B,GACzBi0D,GAAqBjiD,EAAaxK,EAAOk3B,G/C6GzC,SAA4B0B,GAChC,MAAMi0B,EAAOj0B,EAAeJ,OAAOlc,MACnCsc,EAAeH,aAAe9tB,EAAakiD,GAEvCj0B,EAAeJ,OAAOjlC,OAAS,IACjCqlC,EAAeH,aAAe,EAElC,C+CnHMq0B,CAAkB51B,EAAK,IAGrBw1B,GAAeC,EACjB,MAAM,IAAIlsD,MACR+J,EACE,4BACAquB,GAA4B3B,GAC5B,mCAGP,CACH,EA8Ia61B,GAAqB,SAChCtiD,EACAuiD,EACAn4B,EACA7nB,GAEA,KAAIA,QAA2BxZ,IAAfqhC,KAIX23B,GAAkB33B,GACrB,MAAM,IAAIp0B,MACR+J,EAAeC,EAAQuiD,GACrB,0BACAn4B,EAFFrqB,mFAON,EAyBayiD,GAAc,SACzBxiD,EACAyiD,GAGA,MAAMr4B,EAAaq4B,EAAUh2B,KAAKjZ,WAClC,GACuC,kBAA5BivC,EAAU5nC,SAAS7pB,MACO,IAAnCyxD,EAAU5nC,SAAS7pB,KAAKlI,SACtBg5D,GAAWW,EAAU5nC,SAASf,YACY,cAA1C2oC,EAAU5nC,SAAS7pB,KAAK3H,MAAM,KAAK,IACd,IAAtB+gC,EAAWthC,SApUqB,SAAUshC,GAM7C,OALIA,IAEFA,EAAaA,EAAWhxB,QAAQ,mBAAoB,MAG/C2oD,GAAkB33B,EAC3B,CA6TiCs4B,CAAsBt4B,GAEnD,MAAM,IAAIp0B,MACR+J,EAAeC,EAAQ,OAAvBD,uFAKN,QChXa4iD,GAAb3pD,WAAAA,GACE,KAAW4pD,YAAgB,GAK3B,KAAeC,gBAAG,GAMJ,SAAAC,GACdC,EACAC,GAGA,IAAIC,EAA6B,KACjC,IAAK,IAAI35D,EAAI,EAAGA,EAAI05D,EAAcl6D,OAAQQ,IAAK,CAC7C,MAAMwT,EAAOkmD,EAAc15D,GACrBmjC,EAAO3vB,EAAKomD,UACD,OAAbD,GAAsBv1B,GAAWjB,EAAMw2B,EAASx2B,QAClDs2B,EAAWH,YAAYn1D,KAAKw1D,GAC5BA,EAAW,MAGI,OAAbA,IACFA,EAAW,CAAE7W,OAAQ,GAAI3f,SAG3Bw2B,EAAS7W,OAAO3+C,KAAKqP,EACtB,CACGmmD,GACFF,EAAWH,YAAYn1D,KAAKw1D,EAEhC,UA+BgBE,GACdJ,EACAK,EACAJ,GAEAF,GAAsBC,EAAYC,GAClCK,GACEN,GACAO,GACE11B,GAAa01B,EAAWF,IACxBx1B,GAAaw1B,EAAaE,IAEhC,CAEA,SAASD,GACPN,EACA7U,GAEA6U,EAAWF,kBAEX,IAAIU,GAAU,EACd,IAAK,IAAIj6D,EAAI,EAAGA,EAAIy5D,EAAWH,YAAY95D,OAAQQ,IAAK,CACtD,MAAMk6D,EAAYT,EAAWH,YAAYt5D,GACzC,GAAIk6D,EAAW,CAETtV,EADcsV,EAAU/2B,OAE1Bg3B,GAAeV,EAAWH,YAAYt5D,IACtCy5D,EAAWH,YAAYt5D,GAAK,MAE5Bi6D,GAAU,CAEb,CACF,CAEGA,IACFR,EAAWH,YAAc,IAG3BG,EAAWF,iBACb,CAUA,SAASY,GAAeD,GACtB,IAAK,IAAIl6D,EAAI,EAAGA,EAAIk6D,EAAUpX,OAAOtjD,OAAQQ,IAAK,CAChD,MAAMkiC,EAAYg4B,EAAUpX,OAAO9iD,GACnC,GAAkB,OAAdkiC,EAAoB,CACtBg4B,EAAUpX,OAAO9iD,GAAK,KACtB,MAAMo6D,EAAUl4B,EAAUm4B,iBACtB34C,IACFjf,GAAI,UAAYy/B,EAAUhY,YAE5BkE,GAAegsC,EAChB,CACF,CACH,CCpDA,MAAME,GAAmB,uBAsDZC,GA0BX7qD,WAAAA,CACSutB,EACAu9B,EACA/0B,EACAg1B,GAHA,KAASx9B,UAATA,EACA,KAAgBu9B,iBAAhBA,EACA,KAAkB/0B,mBAAlBA,EACA,KAAiBg1B,kBAAjBA,EA1BT,KAAeC,gBAAG,EAKlB,KAAc7Z,eAAyB,KACvC,KAAA8Z,YAAc,IAAItB,GAClB,KAAYuB,aAAG,EAIf,KAA4BC,6BAA6C,KAGzE,KAAa5mC,cAAuB2rB,KAGpC,KAAAkb,sBAAwB,IAAI3D,GAG5B,KAAqB4D,sBAAgC,KASnDztD,KAAK7I,IAAM6I,KAAK2vB,UAAU7L,cAM5BlH,QAAAA,GACE,OACG5c,KAAK2vB,UAAU1M,OAAS,WAAa,WAAajjB,KAAK2vB,UAAUv1B,eAKxDszD,GACdC,EACAp0C,EACAq0C,GAIA,GAFAD,EAAKtnC,OAASzB,GAA0B+oC,EAAKh+B,WAEzCg+B,EAAKT,mBhE0WY,kBAAXn5D,QACNA,OAAkB,WAClBA,OAAkB,UAAa,WACjC,IAOUD,OACR,6FACG,EgErXL65D,EAAKta,QAAU,IAAIlC,GACjBwc,EAAKh+B,WACL,CACE6D,EACAttB,EACA2nD,EACAr5D,KAEAs5D,GAAiBH,EAAMn6B,EAAYttB,EAAM2nD,EAASr5D,EAAI,GAExDm5D,EAAKx1B,mBACLw1B,EAAKR,mBAIPrzD,YAAW,IAAMi0D,GAAoBJ,GAA2B,IAAO,OAClE,CAEL,GAA4B,qBAAjBC,GAAiD,OAAjBA,EAAuB,CAChE,GAA4B,kBAAjBA,EACT,MAAM,IAAIxuD,MACR,sEAGJ,IACE1D,EAAUkyD,EACX,CAAC,MAAOlrD,GACP,MAAM,IAAItD,MAAM,kCAAoCsD,EACrD,CACF,CAEDirD,EAAKF,sBAAwB,IAAI11B,GAC/B41B,EAAKh+B,UACLpW,GACA,CACEia,EACAttB,EACA2nD,EACAr5D,KAEAs5D,GAAiBH,EAAMn6B,EAAYttB,EAAM2nD,EAASr5D,EAAI,IAEvDw5D,IACCD,GAAoBJ,EAAMK,EAAc,IAEzC9U,KAmKP,SAAgCyU,EAAYzU,GAC1C15B,GAAK05B,GAAS,CAAC/hD,EAAawH,KAC1BsvD,GAAeN,EAAMx2D,EAAKwH,EAAM,GAEpC,CAtKQuvD,CAAuBP,EAAMzU,EAAQ,GAEvCyU,EAAKx1B,mBACLw1B,EAAKR,kBACLS,GAGFD,EAAKta,QAAUsa,EAAKF,qBACrB,CAEDE,EAAKx1B,mBAAmBxW,wBAAuBnb,IAC7CmnD,EAAKta,QAAQzf,iBAAiBptB,EAAM,IAGtCmnD,EAAKR,kBAAkBxrC,wBAAuB3qB,IAC5C22D,EAAKta,QAAQxf,qBAAqB78B,EAAOwP,MAAM,IAKjDmnD,EAAKQ,e1D1PS,SACdlqC,EACAmqC,GAEA,MAAMvpC,EAAaZ,EAASrH,WAM5B,OAJK+H,GAAUE,KACbF,GAAUE,GAAcupC,KAGnBzpC,GAAUE,EACnB,C0D+OwBwpC,CACpBV,EAAKh+B,WACL,IAAM,IAAIwjB,GAAcwa,EAAKtnC,OAAQsnC,EAAKta,WAI5Csa,EAAKW,UAAY,IAAIrc,GACrB0b,EAAKY,cAAgB,IAAItK,GAAS,CAChC6B,eAAgBA,CAAC/hC,EAAOvvB,EAAKgmC,EAAe/G,KAC1C,IAAI+6B,EAAsB,GAC1B,MAAM5vB,EAAO+uB,EAAKW,UAAUnc,QAAQpuB,EAAMoW,OAa1C,OAVKyE,EAAK53B,YACRwnD,EAAazJ,GACX4I,EAAKY,cACLxqC,EAAMoW,MACNyE,GAEF9kC,YAAW,KACT25B,EAAW,KAAK,GACf,IAEE+6B,CAAU,EAEnBtI,cAAeA,SAEjB+H,GAAeN,EAAM,aAAa,GAElCA,EAAKc,gBAAkB,IAAIxK,GAAS,CAClC6B,eAAgBA,CAAC/hC,EAAOvvB,EAAKgmC,EAAe/G,KAC1Ck6B,EAAKta,QAAQ9Y,OAAOxW,EAAOyW,EAAehmC,GAAK,CAAC0mC,EAAQh1B,KACtD,MAAMsvC,EAAS/hB,EAAWyH,EAAQh1B,GAClCqmD,GACEoB,EAAKN,YACLtpC,EAAMoW,MACNqb,EACD,IAGI,IAET0Q,cAAeA,CAACniC,EAAOvvB,KACrBm5D,EAAKta,QAAQrhC,SAAS+R,EAAOvvB,EAAI,GAGvC,CAKM,SAAUk6D,GAAef,GAC7B,MACMnlD,EADamlD,EAAKW,UAAUnc,QAAQ,IAAI9c,GAAK,2BACxBnmB,OAAoB,EAC/C,OAAO,IAAIhc,MAAOE,UAAYoV,CAChC,CAKM,SAAUmmD,GAAyBhB,GACvC,OJxQAthD,GAJAA,EI4Q0B,CACxB2mB,UAAW07B,GAAef,MJzQT,CAAC,GACF,UAAIthD,EAAkB,YAAK,IAAInZ,MAAOE,UACjDiZ,EAPyB,IAChCA,CI+QF,CAKA,SAASyhD,GACPH,EACAn6B,EACAttB,EACA2nD,EACAr5D,GAGAm5D,EAAKP,kBACL,MAAMv3B,EAAO,IAAIR,GAAK7B,GACtBttB,EAAOynD,EAAKJ,6BACRI,EAAKJ,6BAA6B/5B,EAAYttB,GAC9CA,EACJ,IAAIsvC,EAAS,GACb,GAAIhhD,EACF,GAAIq5D,EAAS,CACX,MAAMe,EAAiB91D,EACrBoN,GACC2oD,GAAiBhkB,GAAagkB,KAEjCrZ,ELkGA,SACJgP,EACA3uB,EACA0oB,EACA/pD,GAEA,MAAMmyD,EAAWC,GAAwBpC,EAAUhwD,GACnD,GAAImyD,EAAU,CACZ,MAAM3sB,EAAI6sB,GAAuBF,GAC3BG,EAAY9sB,EAAEnE,KAClB4E,EAAUT,EAAES,QACR4c,EAAe5gB,GAAgBqwB,EAAWjxB,GAC1Ci5B,EAAa7X,GAAcC,WAAWqH,GAM5C,OAAOwI,GAA8BvC,EAAUsC,EALpC,IAAIpS,GACbd,GAAoCnZ,GACpC4c,EACAyX,GAGH,CAEC,MAAO,EAEX,CKzHeC,CACPpB,EAAKc,gBACL54B,EACA+4B,EACAp6D,EAEH,KAAM,CACL,MAAMw6D,EAAankB,GAAa3kC,GAChCsvC,EAASkR,GACPiH,EAAKc,gBACL54B,EACAm5B,EACAx6D,EAEH,MACI,GAAIq5D,EAAS,CAClB,MAAMtP,EAAkBzlD,EACtBoN,GACC2oD,GAAiBhkB,GAAagkB,KAEjCrZ,WLnIFgP,EACA3uB,EACA0oB,GAEA,MAAMuQ,EAAa7X,GAAcC,WAAWqH,GAE5C,OAAOoG,GACLH,EACA,IAAI9P,GhBlNC,CACLb,UAAU,EACVC,YAAY,EACZrZ,QAAS,KACTsZ,QAAQ,GgB8M8Ble,EAAMi5B,GAEhD,CKyHaG,CACPtB,EAAKc,gBACL54B,EACA0oB,EAEH,KAAM,CACL,MAAM/S,EAAOX,GAAa3kC,GAC1BsvC,EAASuP,GAA6B4I,EAAKc,gBAAiB54B,EAAM2V,EACnE,CACD,IAAIc,EAAezW,EACf2f,EAAOtjD,OAAS,IAGlBo6C,EAAe4iB,GAAsBvB,EAAM93B,IAE7C02B,GAAoCoB,EAAKN,YAAa/gB,EAAckJ,EACtE,CAUA,SAASuY,GAAoBJ,EAAYK,GACvCC,GAAeN,EAAM,YAAaK,IACZ,IAAlBA,GAyPN,SAAmCL,GACjCwB,GAAQxB,EAAM,sBAEd,MAAM1E,EAAe0F,GAAyBhB,GACxCyB,EAA2B9c,KACjCI,GACEib,EAAKhnC,cACLgP,MACA,CAACE,EAAM+I,KACL,MAAMywB,EAAW9F,GACf1zB,EACA+I,EACA+uB,EAAKc,gBACLxF,GAEF1W,GAA2B6c,EAA0Bv5B,EAAMw5B,EAAS,IAGxE,IAAI7Z,EAAkB,GAEtB9C,GACE0c,EACAz5B,MACA,CAACE,EAAM2V,KACLgK,EAASA,EAAOyM,OACd8C,GAA6B4I,EAAKc,gBAAiB54B,EAAM2V,IAE3D,MAAMc,EAAegjB,GAAsB3B,EAAM93B,GACjDq5B,GAAsBvB,EAAMrhB,EAAa,IAI7CqhB,EAAKhnC,cAAgB2rB,KACrBia,GAAoCoB,EAAKN,YAAa13B,KAAgB6f,EACxE,CA1RI+Z,CAA0B5B,EAE9B,CAQA,SAASM,GAAeN,EAAYn6B,EAAoB70B,GACtD,MAAMk3B,EAAO,IAAIR,GAAK,UAAY7B,GAC5B2L,EAAU0L,GAAalsC,GAC7BgvD,EAAKW,UAAUlc,eAAevc,EAAMsJ,GACpC,MAAMqW,EAASuP,GACb4I,EAAKY,cACL14B,EACAsJ,GAEFotB,GAAoCoB,EAAKN,YAAax3B,EAAM2f,EAC9D,CAEA,SAASga,GAAmB7B,GAC1B,OAAOA,EAAKL,cACd,CAqYM,SAAUmC,GAAc9B,GACxBA,EAAKF,uBACPE,EAAKF,sBAAsBvvB,UAAU8uB,GAEzC,CA4CA,SAASmC,GAAQxB,GACf,IAAItvC,EAAS,GACTsvC,EAAKF,wBACPpvC,EAASsvC,EAAKF,sBAAsBlwC,GAAK,KAC1C,QAAAtN,EAAAhe,UAAAC,OAJ6BisB,EAAkB,IAAA7d,MAAA2P,EAAA,EAAAA,EAAA,KAAAy/C,EAAA,EAAAA,EAAAz/C,EAAAy/C,IAAlBvxC,EAAkBuxC,EAAA,GAAAz9D,UAAAy9D,GAKhDv6D,GAAIkpB,KAAWF,EACjB,CAwJA,SAASwxC,GACPhC,EACA93B,EACA+5B,GAEA,OACEjI,GAA+BgG,EAAKc,gBAAiB54B,EAAM+5B,IAC3D9mB,GAAahI,UAEjB,CAWA,SAAS+uB,GACPlC,GACsD,IAAtD/uB,EAA4B3sC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAA07D,EAAKH,sBAOjC,GAJK5uB,GACHkxB,GAAwCnC,EAAM/uB,GAG5CsrB,GAAatrB,GAAO,CACtB,MAAMmxB,EAAQC,GAA0BrC,EAAM/uB,GAC9C5/B,EAAO+wD,EAAM79D,OAAS,EAAG,yCAEV69D,EAAME,OAClB7+C,GAAoD,IAAvBA,EAAY8pB,UAqBhD,SACEyyB,EACA93B,EACAk6B,GAGA,MAAMG,EAAeH,EAAMj3D,KAAIq3D,GACtBA,EAAIC,iBAEPC,EAAcV,GAAmBhC,EAAM93B,EAAMq6B,GACnD,IAAII,EAAaD,EACjB,MAAME,EAAaF,EAAY38B,OAC/B,IAAK,IAAIhhC,EAAI,EAAGA,EAAIq9D,EAAM79D,OAAQQ,IAAK,CACrC,MAAMy9D,EAAMJ,EAAMr9D,GAClBsM,EACiB,IAAfmxD,EAAIj1B,OACJ,iEAEFi1B,EAAIj1B,OAAS,EACbi1B,EAAIK,aACJ,MAAMnZ,EAAe5gB,GAAgBZ,EAAMs6B,EAAIt6B,MAE/Cy6B,EAAaA,EAAW9rB,YACtB6S,EACA8Y,EAAIM,yBAEP,CAED,MAAMC,EAAaJ,EAAWphD,KAAI,GAC5ByhD,EAAa96B,EAGnB83B,EAAKta,QAAQj6B,IACXu3C,EAAW/zC,WACX8zC,GACCx1B,IACCi0B,GAAQxB,EAAM,2BAA4B,CACxC93B,KAAM86B,EAAW/zC,WACjBse,WAGF,IAAIsa,EAAkB,GACtB,GAAe,OAAXta,EAAiB,CAInB,MAAM/tB,EAAY,GAClB,IAAK,IAAIza,EAAI,EAAGA,EAAIq9D,EAAM79D,OAAQQ,IAChCq9D,EAAMr9D,GAAGwoC,OAAS,EAClBsa,EAASA,EAAOyM,OACd2C,GAAqB+I,EAAKc,gBAAiBsB,EAAMr9D,GAAG09D,iBAElDL,EAAMr9D,GAAG+gC,YAGXtmB,EAAUtW,MAAK,IACbk5D,EAAMr9D,GAAG+gC,WACP,MACA,EACAs8B,EAAMr9D,GAAGk+D,iCAIfb,EAAMr9D,GAAGm+D,YAIXf,GACEnC,EACA3D,GAAY2D,EAAKH,sBAAuB33B,IAG1Cg6B,GAA0BlC,EAAMA,EAAKH,uBAErCjB,GAAoCoB,EAAKN,YAAax3B,EAAM2f,GAG5D,IAAK,IAAI9iD,EAAI,EAAGA,EAAIya,EAAUjb,OAAQQ,IACpCouB,GAAe3T,EAAUza,GAE5B,KAAM,CAEL,GAAe,cAAXwoC,EACF,IAAK,IAAIxoC,EAAI,EAAGA,EAAIq9D,EAAM79D,OAAQQ,IACR,IAApBq9D,EAAMr9D,GAAGwoC,OACX60B,EAAMr9D,GAAGwoC,OAAS,EAElB60B,EAAMr9D,GAAGwoC,OAAS,MAGjB,CACLprB,GACE,kBAAoB6gD,EAAW/zC,WAAa,YAAcse,GAE5D,IAAK,IAAIxoC,EAAI,EAAGA,EAAIq9D,EAAM79D,OAAQQ,IAChCq9D,EAAMr9D,GAAGwoC,OAAS,EAClB60B,EAAMr9D,GAAGo+D,YAAc51B,CAE1B,CAEDg0B,GAAsBvB,EAAM93B,EAC7B,IAEH06B,EAEJ,CAzHMQ,CAAyBpD,EAAMjD,GAAY9rB,GAAOmxB,EAErD,MAAU1F,GAAgBzrB,IACzB0rB,GAAiB1rB,GAAMyF,IACrBwrB,GAA0BlC,EAAMtpB,EAAU,GAGhD,CA+HA,SAAS6qB,GAAsBvB,EAAYnB,GACzC,MAAMwE,EAA0BC,GAC9BtD,EACAnB,GAEI32B,EAAO60B,GAAYsG,GAKzB,OAUF,SACErD,EACAoC,EACAl6B,GAEA,GAAqB,IAAjBk6B,EAAM79D,OACR,OAMF,MAAMib,EAAY,GAClB,IAAIqoC,EAAkB,GAEtB,MAAM0b,EAAcnB,EAAMvzD,QAAO49B,GACX,IAAbA,EAAEc,SAELg1B,EAAegB,EAAYp4D,KAAIshC,GAC5BA,EAAEg2B,iBAEX,IAAK,IAAI19D,EAAI,EAAGA,EAAIq9D,EAAM79D,OAAQQ,IAAK,CACrC,MAAM0e,EAAc2+C,EAAMr9D,GACpB2kD,EAAe5gB,GAAgBZ,EAAMzkB,EAAYykB,MACvD,IACEi7B,EADEK,GAAmB,EAOvB,GALAnyD,EACmB,OAAjBq4C,EACA,iEAGyB,IAAvBjmC,EAAY8pB,OACdi2B,GAAmB,EACnBL,EAAc1/C,EAAY0/C,YAC1Btb,EAASA,EAAOyM,OACd2C,GACE+I,EAAKc,gBACLr9C,EAAYg/C,gBACZ,SAGC,GAA2B,IAAvBh/C,EAAY8pB,OACrB,GAAI9pB,EAAYo/C,YAvoCU,GAwoCxBW,GAAmB,EACnBL,EAAc,WACdtb,EAASA,EAAOyM,OACd2C,GACE+I,EAAKc,gBACLr9C,EAAYg/C,gBACZ,QAGC,CAEL,MAAMgB,EAAczB,GAClBhC,EACAv8C,EAAYykB,KACZq6B,GAEF9+C,EAAYigD,qBAAuBD,EACnC,MAAM3M,EAAUsL,EAAMr9D,GAAGkW,OAAOwoD,EAAYliD,OAC5C,QAAgB/c,IAAZsyD,EAAuB,CACzB2G,GACE,qCACA3G,EACArzC,EAAYykB,MAEd,IAAIy7B,EAAczmB,GAAa4Z,GAEV,kBAAZA,GACI,MAAXA,GACA59C,EAAS49C,EAAS,eAGlB6M,EAAcA,EAAYxtB,eAAestB,EAAY9tB,gBAGvD,MAAMiuB,EAAangD,EAAYg/C,eACzBnH,EAAe0F,GAAyBhB,GACxC6D,EAAkB/H,GACtB6H,EACAF,EACAnI,GAGF73C,EAAYq/C,yBAA2Ba,EACvClgD,EAAYw/C,8BAAgCY,EAC5CpgD,EAAYg/C,eAAiBZ,GAAmB7B,GAEhDuC,EAAan7B,OAAOm7B,EAAap9D,QAAQy+D,GAAa,GACtD/b,EAASA,EAAOyM,OACdsC,GACEoJ,EAAKc,gBACLr9C,EAAYykB,KACZ27B,EACApgD,EAAYg/C,eACZh/C,EAAYqgD,eAGhBjc,EAASA,EAAOyM,OACd2C,GAAqB+I,EAAKc,gBAAiB8C,GAAY,GAE1D,MACCJ,GAAmB,EACnBL,EAAc,SACdtb,EAASA,EAAOyM,OACd2C,GACE+I,EAAKc,gBACLr9C,EAAYg/C,gBACZ,GAIP,CAEH7D,GAAoCoB,EAAKN,YAAax3B,EAAM2f,GAC5DA,EAAS,GACL2b,IAEFpB,EAAMr9D,GAAGwoC,OAAS,EAKP21B,EAERd,EAAMr9D,GAAGm+D,UADV/2D,WAAW+2D,EAAW9wC,KAAKI,MAAM,IAG/B4vC,EAAMr9D,GAAG+gC,aACS,WAAhBq9B,EACF3jD,EAAUtW,MAAK,IACbk5D,EAAMr9D,GAAG+gC,WAAW,MAAM,EAAOs8B,EAAMr9D,GAAG2+D,wBAG5ClkD,EAAUtW,MAAK,IACbk5D,EAAMr9D,GAAG+gC,WAAW,IAAIr0B,MAAM0xD,IAAc,EAAO,SAK5D,CAhBG,IAAWD,EAmBff,GAAwCnC,EAAMA,EAAKH,uBAGnD,IAAK,IAAI96D,EAAI,EAAGA,EAAIya,EAAUjb,OAAQQ,IACpCouB,GAAe3T,EAAUza,IAI3Bm9D,GAA0BlC,EAAMA,EAAKH,sBACvC,CApKEkE,CAA0B/D,EADZqC,GAA0BrC,EAAMqD,GACPn7B,GAEhCA,CACT,CA2KA,SAASo7B,GACPtD,EACA93B,GAEA,IAAI4O,EAIAktB,EAAkBhE,EAAKH,sBAE3B,IADA/oB,EAAQ7O,GAAaC,GACJ,OAAV4O,QAAoDtyC,IAAlC+3D,GAAayH,IACpCA,EAAkB3H,GAAY2H,EAAiBltB,GAE/CA,EAAQ7O,GADRC,EAAOE,GAAaF,IAItB,OAAO87B,CACT,CASA,SAAS3B,GACPrC,EACAgE,GAGA,MAAMC,EAAkC,GAUxC,OATAC,GACElE,EACAgE,EACAC,GAIFA,EAAiB//C,MAAK,CAAC3Z,EAAGC,IAAMD,EAAE45D,MAAQ35D,EAAE25D,QAErCF,CACT,CAEA,SAASC,GACPlE,EACA/uB,EACAmxB,GAEA,MAAMgC,EAAY7H,GAAatrB,GAC/B,GAAImzB,EACF,IAAK,IAAIr/D,EAAI,EAAGA,EAAIq/D,EAAU7/D,OAAQQ,IACpCq9D,EAAMl5D,KAAKk7D,EAAUr/D,IAIzB43D,GAAiB1rB,GAAMqK,IACrB4oB,GAAsClE,EAAM1kB,EAAO8mB,EAAM,GAE7D,CAKA,SAASD,GACPnC,EACA/uB,GAEA,MAAMmxB,EAAQ7F,GAAatrB,GAC3B,GAAImxB,EAAO,CACT,IAAIiC,EAAK,EACT,IAAK,IAAI5lD,EAAO,EAAGA,EAAO2jD,EAAM79D,OAAQka,IACX,IAAvB2jD,EAAM3jD,GAAM8uB,SACd60B,EAAMiC,GAAMjC,EAAM3jD,GAClB4lD,KAGJjC,EAAM79D,OAAS8/D,EACf7H,GAAavrB,EAAMmxB,EAAM79D,OAAS,EAAI69D,OAAQ59D,EAC/C,CAEDm4D,GAAiB1rB,GAAMyF,IACrByrB,GAAwCnC,EAAMtpB,EAAU,GAE5D,CASA,SAASirB,GAAsB3B,EAAY93B,GACzC,MAAMyW,EAAeoe,GAAYuG,GAA+BtD,EAAM93B,IAEhE87B,EAAkB3H,GAAY2D,EAAKH,sBAAuB33B,GAYhE,gBHj0CA+c,EACAz3C,EACAqvD,GAEA,IAAI5rB,EAAO4rB,EAAc5X,EAAOA,EAAKkX,OACrC,KAAgB,OAATlrB,GAAe,CACpB,GAAIzjC,EAAOyjC,GACT,OAAO,EAETA,EAAOA,EAAKkrB,MACb,CAEH,CG2yCEmI,CAAoBN,GAAkB/yB,IACpCszB,GAA4BvE,EAAM/uB,EAAK,IAGzCszB,GAA4BvE,EAAMgE,GAElCpH,GAAsBoH,GAAkB/yB,IACtCszB,GAA4BvE,EAAM/uB,EAAK,IAGlC0N,CACT,CAOA,SAAS4lB,GACPvE,EACA/uB,GAEA,MAAMmxB,EAAQ7F,GAAatrB,GAC3B,GAAImxB,EAAO,CAIT,MAAM5iD,EAAY,GAIlB,IAAIqoC,EAAkB,GAClB2c,GAAY,EAChB,IAAK,IAAIz/D,EAAI,EAAGA,EAAIq9D,EAAM79D,OAAQQ,IACR,IAApBq9D,EAAMr9D,GAAGwoC,SAEkB,IAApB60B,EAAMr9D,GAAGwoC,QAClBl8B,EACEmzD,IAAaz/D,EAAI,EACjB,mDAEFy/D,EAAWz/D,EAEXq9D,EAAMr9D,GAAGwoC,OAAS,EAClB60B,EAAMr9D,GAAGo+D,YAAc,QAEvB9xD,EAC2C,IAAzC+wD,EAAMr9D,GAAGwoC,OACT,0CAGF60B,EAAMr9D,GAAGm+D,YACTrb,EAASA,EAAOyM,OACd2C,GACE+I,EAAKc,gBACLsB,EAAMr9D,GAAG09D,gBACT,IAGAL,EAAMr9D,GAAG+gC,YACXtmB,EAAUtW,KACRk5D,EAAMr9D,GAAG+gC,WAAWvV,KAAK,KAAM,IAAI9e,MAAM,QAAQ,EAAO,UAK9C,IAAd+yD,EAEFhI,GAAavrB,OAAMzsC,GAGnB49D,EAAM79D,OAASigE,EAAW,EAI5B5F,GACEoB,EAAKN,YACL3C,GAAY9rB,GACZ4W,GAEF,IAAK,IAAI9iD,EAAI,EAAGA,EAAIya,EAAUjb,OAAQQ,IACpCouB,GAAe3T,EAAUza,GAE5B,CACH,CCh/CO,MAAM0/D,GAAgB,SAC3BC,EACAjvC,GAEA,MAAMyoC,EAAYyG,GAAiBD,GACjCnvC,EAAY2oC,EAAU3oC,UAEC,iBAArB2oC,EAAU7xD,QACZskB,GACEutC,EAAUzxD,KAAVyxD,8EAQA3oC,GAA2B,cAAdA,GACM,cAArB2oC,EAAU7xD,QAEVskB,GACE,gFAICutC,EAAU5oC,QjEiFK,qBAAXlvB,QACPA,OAAON,UACPM,OAAON,SAASgC,WACgC,IAAhD1B,OAAON,SAASgC,SAAS3C,QAAQ,WAEjCgd,GACE,6FiEnFJ,MAAMqT,EAAqC,OAArB0oC,EAAU0G,QAAwC,QAArB1G,EAAU0G,OAE7D,MAAO,CACLtuC,SAAU,IAAIjB,GACZ6oC,EAAUzxD,KACVyxD,EAAU5oC,OACVC,EACAC,EACAC,EACoB,GACeF,IAAc2oC,EAAU2G,WAE7D38B,KAAM,IAAIR,GAAKw2B,EAAUr4B,YAE7B,EAEa8+B,GAAmB,SAAUD,GAWxC,IAAIj4D,EAAO,GACTJ,EAAS,GACTw4D,EAAY,GACZh/B,EAAa,GACbtQ,EAAY,GAGVD,GAAS,EACXsvC,EAAS,QACTjuD,EAAO,IAGT,GAAuB,kBAAZ+tD,EAAsB,CAE/B,IAAII,EAAWJ,EAAQv/D,QAAQ,MAC3B2/D,GAAY,IACdF,EAASF,EAAQx/D,UAAU,EAAG4/D,EAAW,GACzCJ,EAAUA,EAAQx/D,UAAU4/D,EAAW,IAIzC,IAAIC,EAAWL,EAAQv/D,QAAQ,MACb,IAAd4/D,IACFA,EAAWL,EAAQngE,QAErB,IAAIygE,EAAkBN,EAAQv/D,QAAQ,MACb,IAArB6/D,IACFA,EAAkBN,EAAQngE,QAE5BkI,EAAOi4D,EAAQx/D,UAAU,EAAGktB,KAAKG,IAAIwyC,EAAUC,IAC3CD,EAAWC,IAEbn/B,EA7HN,SAAoBA,GAClB,IAAIo/B,EAAoB,GACxB,MAAMx8B,EAAS5C,EAAW/gC,MAAM,KAChC,IAAK,IAAIC,EAAI,EAAGA,EAAI0jC,EAAOlkC,OAAQQ,IACjC,GAAI0jC,EAAO1jC,GAAGR,OAAS,EAAG,CACxB,IAAI2gE,EAAQz8B,EAAO1jC,GACnB,IACEmgE,EAAQvgE,mBAAmBugE,EAAMrwD,QAAQ,MAAO,KACjD,CAAC,MAAOE,GAAI,CACbkwD,GAAqB,IAAMC,CAC5B,CAEH,OAAOD,CACT,CAgHmBE,CAAWT,EAAQx/D,UAAU6/D,EAAUC,KAEtD,MAAM/hB,EA7GV,SAAqBmiB,GACnB,MAAMC,EAAU,CAAC,EACa,MAA1BD,EAAYngE,OAAO,KACrBmgE,EAAcA,EAAYlgE,UAAU,IAEtC,IAAK,MAAMogE,KAAWF,EAAYtgE,MAAM,KAAM,CAC5C,GAAuB,IAAnBwgE,EAAQ/gE,OACV,SAEF,MAAMghE,EAAKD,EAAQxgE,MAAM,KACP,IAAdygE,EAAGhhE,OACL8gE,EAAQ1gE,mBAAmB4gE,EAAG,KAAO5gE,mBAAmB4gE,EAAG,IAE3DpjD,GAAK,0BAA0BmjD,gBAAsBF,KAExD,CACD,OAAOC,CACT,CA4FwBG,CAClBd,EAAQx/D,UAAUktB,KAAKG,IAAImyC,EAAQngE,OAAQygE,KAI7CF,EAAWr4D,EAAKtH,QAAQ,KACpB2/D,GAAY,GACdxvC,EAAoB,UAAXsvC,GAAiC,QAAXA,EAC/BjuD,EAAOrH,SAAS7C,EAAKvH,UAAU4/D,EAAW,GAAI,KAE9CA,EAAWr4D,EAAKlI,OAGlB,MAAMkhE,EAAkBh5D,EAAKzD,MAAM,EAAG87D,GACtC,GAAsC,cAAlCW,EAAgB1yC,cAClB1mB,EAAS,iBACJ,GAAIo5D,EAAgB3gE,MAAM,KAAKP,QAAU,EAC9C8H,EAASo5D,MACJ,CAEL,MAAMC,EAASj5D,EAAKtH,QAAQ,KAC5B0/D,EAAYp4D,EAAKvH,UAAU,EAAGwgE,GAAQ3yC,cACtC1mB,EAASI,EAAKvH,UAAUwgE,EAAS,GAEjCnwC,EAAYsvC,CACb,CAEG,OAAQ5hB,IACV1tB,EAAY0tB,EAAgB,GAE/B,CAED,MAAO,CACLx2C,OACAkK,OACAtK,SACAw4D,YACAvvC,SACAsvC,SACA/+B,aACAtQ,YAEJ,EClKMowC,GACJ,oEAsByB,WAGzB,IAAIC,EAAe,EAMnB,MAAMC,EAA0B,EAqClC,CA9C2B,SCCdC,GAOXrxD,WAAAA,CACSmyB,EACAktB,EACAiS,EACAxd,GAHA,KAAS3hB,UAATA,EACA,KAAiBktB,kBAAjBA,EACA,KAAQiS,SAARA,EACA,KAAQxd,SAARA,EAEToW,OAAAA,GACE,MAAMqH,EAAM3zD,KAAK0zD,SAASC,IAC1B,MAAuB,UAAnB3zD,KAAKu0B,UACAo/B,EAAIx5B,MAEJw5B,EAAI7J,OAAO3vB,MAGtBy5B,YAAAA,GACE,OAAO5zD,KAAKu0B,UAEdw4B,cAAAA,GACE,OAAO/sD,KAAKyhD,kBAAkBsL,eAAe/sD,MAE/C4c,QAAAA,GACE,OACE5c,KAAKssD,UAAU1vC,WACf,IACA5c,KAAKu0B,UACL,IACA74B,EAAUsE,KAAK0zD,SAASG,oBAKjBC,GACX1xD,WAAAA,CACSq/C,EACA9+C,EACAkzB,GAFA,KAAiB4rB,kBAAjBA,EACA,KAAK9+C,MAALA,EACA,KAAIkzB,KAAJA,EAETy2B,OAAAA,GACE,OAAOtsD,KAAK61B,KAEd+9B,YAAAA,GACE,MAAO,SAET7G,cAAAA,GACE,OAAO/sD,KAAKyhD,kBAAkBsL,eAAe/sD,MAE/C4c,QAAAA,GACE,OAAO5c,KAAK61B,KAAKjZ,WAAa,iBC3DrBm3C,GACX3xD,WAAAA,CACmB4xD,EACAC,GADA,KAAgBD,iBAAhBA,EACA,KAAcC,eAAdA,EAGnBC,OAAAA,CACEC,EACAC,GAEAp0D,KAAKg0D,iBAAiBltD,KAAK,KAAMqtD,EAAiBC,GAGpDC,QAAAA,CAAS1xD,GAKP,OAJA3D,EACEgB,KAAKs0D,kBACL,gEAEKt0D,KAAKi0D,eAAentD,KAAK,KAAMnE,GAGxC,qBAAI2xD,GACF,QAASt0D,KAAKi0D,eAGhBvmB,OAAAA,CAAQ3W,GACN,OACE/2B,KAAKg0D,mBAAqBj9B,EAAMi9B,uBACQ7hE,IAAvC6N,KAAKg0D,iBAAiBO,cACrBv0D,KAAKg0D,iBAAiBO,eACpBx9B,EAAMi9B,iBAAiBO,cACzBv0D,KAAKg0D,iBAAiBv/B,UAAYsC,EAAMi9B,iBAAiBv/B,eCqBpD+/B,GAIXpyD,WAAAA,CACWshD,EACAvpB,EACAQ,EACA85B,GAHA,KAAK/Q,MAALA,EACA,KAAKvpB,MAALA,EACA,KAAYQ,aAAZA,EACA,KAAc85B,eAAdA,EAGX,OAAIt9D,GACF,OAAIq/B,GAAYx2B,KAAKm6B,OACZ,KAEAnE,GAAYh2B,KAAKm6B,OAI5B,OAAIw5B,GACF,OAAO,IAAIe,GAAc10D,KAAK0jD,MAAO1jD,KAAKm6B,OAG5C,oBAAIO,GACF,MAAMv9B,EAAM8zC,GAA0BjxC,KAAK26B,cACrCpd,EAAK4B,GAAkBhiB,GAC7B,MAAc,OAAPogB,EAAc,UAAYA,EAMnC,gBAAI8c,GACF,OAAO4W,GAA0BjxC,KAAK26B,cAGxCg6B,OAAAA,CAAQ59B,GAEN,MADAA,EAAQxtB,EAAmBwtB,cACJy9B,IACrB,OAAO,EAGT,MAAMI,EAAW50D,KAAK0jD,QAAU3sB,EAAM2sB,MAChCmR,EAAW/9B,GAAW92B,KAAKm6B,MAAOpD,EAAMoD,OACxC26B,EACJ90D,KAAK06B,mBAAqB3D,EAAM2D,iBAElC,OAAOk6B,GAAYC,GAAYC,EAGjCC,MAAAA,GACE,OAAO/0D,KAAK4c,WAGdA,QAAAA,GACE,OAAO5c,KAAK0jD,MAAM9mC,WtD7ChB,SAAiCiZ,GACrC,IAAIrC,EAAa,GACjB,IAAK,IAAI9gC,EAAImjC,EAAKH,UAAWhjC,EAAImjC,EAAKL,QAAQtjC,OAAQQ,IAC5B,KAApBmjC,EAAKL,QAAQ9iC,KACf8gC,GAAc,IAAMoe,mBAAmBlwC,OAAOm0B,EAAKL,QAAQ9iC,MAI/D,OAAO8gC,GAAc,GACvB,CsDoCmCwhC,CAAuBh1D,KAAKm6B,QAiGzD,MAAOu6B,WAAsBF,GAEjCpyD,WAAAA,CAAYurD,EAAY93B,GACtBtwB,MAAMooD,EAAM93B,EAAM,IAAIia,IAAe,GAGvC,UAAIga,GACF,MAAMmL,EAAa9+B,GAAWn2B,KAAKm6B,OACnC,OAAsB,OAAf86B,EACH,KACA,IAAIP,GAAc10D,KAAK0jD,MAAOuR,GAGpC,QAAIpuB,GACF,IAAI8sB,EAAqB3zD,KACzB,KAAsB,OAAf2zD,EAAI7J,QACT6J,EAAMA,EAAI7J,OAEZ,OAAO6J,SAkBEuB,GAOX9yD,WAAAA,CACW+yD,EAIAxB,EACAyB,GALA,KAAKD,MAALA,EAIA,KAAGxB,IAAHA,EACA,KAAMyB,OAANA,EAWX,YAAIlyB,GAEF,OAAOljC,KAAKm1D,MAAM7xB,cAAcp0B,MAYlC,OAAI/X,GACF,OAAO6I,KAAK2zD,IAAIx8D,IAIlB,QAAI8zB,GACF,OAAOjrB,KAAKm1D,MAAMzwB,cAepBuE,KAAAA,CAAMpT,GACJ,MAAMshB,EAAY,IAAI9hB,GAAKQ,GACrBw/B,EAAWpsB,GAAMjpC,KAAK2zD,IAAK99B,GACjC,OAAO,IAAIq/B,GACTl1D,KAAKm1D,MAAMjxB,SAASiT,GACpBke,EACA3vB,IAOJ4vB,MAAAA,GACE,OAAQt1D,KAAKm1D,MAAMnuD,UAarB6sD,SAAAA,GACE,OAAO7zD,KAAKm1D,MAAMjmD,KAAI,GAqBxBhT,OAAAA,CAAQf,GACN,GAAI6E,KAAKm1D,MAAM9xB,aACb,OAAO,EAKT,QAFqBrjC,KAAKm1D,MAEJxwB,aAAa3kC,KAAKo1D,QAAQ,CAACj+D,EAAKynC,IAC7CzjC,EACL,IAAI+5D,GAAat2B,EAAMqK,GAAMjpC,KAAK2zD,IAAKx8D,GAAMuuC,OAYnDvB,QAAAA,CAAStO,GACP,MAAMshB,EAAY,IAAI9hB,GAAKQ,GAC3B,OAAQ71B,KAAKm1D,MAAMjxB,SAASiT,GAAWnwC,UAezCuuD,WAAAA,GACE,OAAIv1D,KAAKm1D,MAAM9xB,eAGLrjC,KAAKm1D,MAAMnuD,UAOvB+tD,MAAAA,GACE,OAAO/0D,KAAK6zD,YAed3kD,GAAAA,GACE,OAAOlP,KAAKm1D,MAAMjmD,OAyBN,SAAAykD,GAAI76C,EAAc+c,GAGhC,OAFA/c,EAAKvP,EAAmBuP,IACrB08C,iBAAiB,YACJrjE,IAAT0jC,EAAqBoT,GAAMnwB,EAAG28C,MAAO5/B,GAAQ/c,EAAG28C,KACzD,CAqDgB,SAAAxsB,GACd6gB,EACAj0B,GPxLoC,IACpCzsB,EACAuiD,EACAn4B,EACA7nB,EO4LA,OALmC,OAA/BiqB,IADJk0B,EAASvgD,EAAmBugD,IACJ3vB,QP1LxB/wB,EO2LyB,QP1LzBuiD,EO0LkC,OPxLlChgD,GOwLgD,GPzLhD6nB,EOyL0CqC,KPpLxCrC,EAAaA,EAAWhxB,QAAQ,mBAAoB,MAGtDkpD,GAAmBtiD,EAAQuiD,EAAcn4B,EAAY7nB,IOmLnD+/C,GAAmB,QAAS,OAAQ71B,GAAM,GAErC,IAAI6+B,GAAc5K,EAAOpG,MAAOrtB,GAAUyzB,EAAO3vB,MAAOtE,GACjE,CAqQM,SAAU3hC,GAAI6vB,GAClBA,EAAQxa,EAAmBwa,GAC3B,MAAM2xC,EAAkB,IAAI3B,IAAgB,SACtCxpD,EAAY,IAAIorD,GAAuBD,GAC7C,gBLnWA/H,EACA5pC,EACA09B,GAGA,MAAMmU,EAAShO,GAAuB+F,EAAKc,gBAAiB1qC,GAC5D,OAAc,MAAV6xC,EACKhxD,QAAQF,QAAQkxD,GAElBjI,EAAKta,QAAQn/C,IAAI6vB,GAAOhR,MAC7B3X,IACE,MAAMwjC,EAAOiM,GAAazvC,GAASmqC,UACjCxhB,EAAM4W,aAAaY,YAerB,IAAIia,EACJ,GAPAwR,GACE2G,EAAKc,gBACL1qC,EACA09B,GACA,GAGE19B,EAAM4W,aAAaE,eACrB2a,EAASuP,GACP4I,EAAKc,gBACL1qC,EAAMoW,MACNyE,OAEG,CACL,MAAMpqC,EAAMwxD,GAAoB2H,EAAKc,gBAAiB1qC,GACtDyxB,EAASkR,GACPiH,EAAKc,gBACL1qC,EAAMoW,MACNyE,EACApqC,EAEH,CAuBD,OAZA+3D,GACEoB,EAAKN,YACLtpC,EAAMoW,MACNqb,GAEFwP,GACE2I,EAAKc,gBACL1qC,EACA09B,EACA,MACA,GAEK7iB,CAAI,IAEbi3B,IACE1G,GAAQxB,EAAM,iBAAmBjyD,EAAUqoB,GAAS,YAAc8xC,GAC3DjxD,QAAQH,OAAO,IAAIrF,MAAMy2D,MAGtC,CK2RSC,CAAa/xC,EAAM2/B,MAAO3/B,EAAOxZ,GAAWwI,MAAK6rB,GAC/C,IAAIs2B,GACTt2B,EACA,IAAI81B,GAAc3wC,EAAM2/B,MAAO3/B,EAAMoW,OACrCpW,EAAM4W,aAAaY,aAGzB,OAIao6B,GACXvzD,WAAAA,CAAoBszD,GAAA,KAAeA,gBAAfA,EAEpBrf,UAAAA,CAAW9hB,GACT,MAAqB,UAAdA,EAGT+hB,WAAAA,CAAYT,EAAgB9xB,GAC1B,MAAMpQ,EAAQoQ,EAAM4W,aAAaY,WACjC,OAAO,IAAIk4B,GACT,QACAzzD,KACA,IAAIk1D,GACFrf,EAAO/J,aACP,IAAI4oB,GAAc3wC,EAAM2/B,MAAO3/B,EAAMoW,OACrCxmB,IAKNo5C,cAAAA,CAAen4B,GACb,MAAiC,WAA7BA,EAAUg/B,eACL,IACL5zD,KAAK01D,gBAAgBrB,SAAUz/B,EAA0BjyB,OAEpD,IACL3C,KAAK01D,gBAAgBxB,QAASt/B,EAAwB8+B,SAAU,MAItE7R,iBAAAA,CAAkBl/C,EAAckzB,GAC9B,OAAI71B,KAAK01D,gBAAgBpB,kBAChB,IAAIR,GAAY9zD,KAAM2C,EAAOkzB,GAE7B,KAIX6X,OAAAA,CAAQ3W,GACN,OAAMA,aAAiB4+B,MAEX5+B,EAAM2+B,kBAAoB11D,KAAK01D,iBAIlC3+B,EAAM2+B,gBAAgBhoB,QAAQ1tC,KAAK01D,kBAI9C1T,cAAAA,GACE,OAAgC,OAAzBhiD,KAAK01D,kBX9yBV,SACJxmD,GAEAlQ,GACGujD,GACD,mDAEFA,GAAuBrzC,CACzB,CWgpEA6mD,CAAiCrB,IV/oE3B,SACJxlD,GAEAlQ,GACGwjD,GACD,mDAEFA,GAAuBtzC,CACzB,CUwoEA8mD,CAAgCtB,IC1pEhC,MAKMuB,GAIF,CAAC,EAKL,IAAIC,IAAgB,EA+Bd,SAAUC,GACd//C,EACAggD,EACA70C,EACAmK,EACAtI,GAEA,IAAIizC,EAA4B3qC,GAAOtV,EAAI1K,QAAQ4qD,iBACrCnkE,IAAVkkE,IACGjgD,EAAI1K,QAAQ6qD,WACfj4C,GACE,kHAKJnpB,GAAI,kCAAmCihB,EAAI1K,QAAQ6qD,WACnDF,EAAQ,GAAGjgD,EAAI1K,QAAQ6qD,yCAGzB,IAGIC,EAEAC,EALA5K,EAAYuG,GAAciE,EAAOjzC,GACjCa,EAAW4nC,EAAU5nC,SAKF,qBAAZtwB,UACT8iE,EAAiB9iE,CAAAA,SAAAA,aAAAA,WAAAA,GAAAA,qBAAAA,EAAAA,qBAAAA,EAAAA,qBAAAA,EAAAA,cAAAA,GAA+C,iCAG9D8iE,GACFD,GAAa,EACbH,EAAQ,UAAUI,QAAqBxyC,EAASf,YAChD2oC,EAAYuG,GAAciE,EAAOjzC,GACjCa,EAAW4nC,EAAU5nC,UAErBuyC,GAAc3K,EAAU5nC,SAAShB,OAGnC,MAAMyzC,EACJtzC,GAAaozC,EACT,IAAIh0C,GAAsBA,GAAsBE,OAChD,IAAIX,GAA0B3L,EAAIhkB,KAAMgkB,EAAI1K,QAAS0qD,GAE3DxK,GAAY,gCAAiCC,GACxCr1B,GAAYq1B,EAAUh2B,OACzBvX,GACE,4FAKJ,MAAMqvC,EA8BR,SACE1pC,EACA7N,EACAsgD,EACAn1C,GAEA,IAAIo1C,EAAWV,GAAM7/C,EAAIhkB,MAEpBukE,IACHA,EAAW,CAAC,EACZV,GAAM7/C,EAAIhkB,MAAQukE,GAGpB,IAAIhJ,EAAOgJ,EAAS1yC,EAASH,eACzB6pC,GACFrvC,GACE,2HAMJ,OAHAqvC,EAAO,IAAIV,GAAKhpC,EAAUiyC,GAAeQ,EAAmBn1C,GAC5Do1C,EAAS1yC,EAASH,eAAiB6pC,EAE5BA,CACT,CArDeiJ,CACX3yC,EACA7N,EACAsgD,EACA,IAAIr1C,GAAsBjL,EAAIhkB,KAAMmvB,IAEtC,OAAO,IAAIs1C,GAASlJ,EAAMv3C,EAC5B,OA0DaygD,GAWXz0D,WAAAA,CACS00D,EAEE1gD,GAFF,KAAa0gD,cAAbA,EAEE,KAAG1gD,IAAHA,EAZF,KAAM,KAAG,WAGlB,KAAgB2gD,kBAAY,EAY5B,SAAIrT,GASF,OARK1jD,KAAK+2D,mBACRrJ,GACE1tD,KAAK82D,cACL92D,KAAKoW,IAAI1K,QAAQ6N,MACjBvZ,KAAKoW,IAAI1K,QAAsC,8BAEjD1L,KAAK+2D,kBAAmB,GAEnB/2D,KAAK82D,cAGd,SAAIrB,GAIF,OAHKz1D,KAAKg3D,gBACRh3D,KAAKg3D,cAAgB,IAAItC,GAAc10D,KAAK0jD,MAAO/tB,OAE9C31B,KAAKg3D,cAGdxqD,OAAAA,GAME,OAL2B,OAAvBxM,KAAKg3D,iBAzFb,SAA+BrJ,EAAYp2C,GACzC,MAAMo/C,EAAWV,GAAM1+C,GAElBo/C,GAAYA,EAAShJ,EAAKx2D,OAASw2D,GACtCrvC,GAAM,YAAY/G,KAAWo2C,EAAKh+B,wCAEpC8/B,GAAc9B,UACPgJ,EAAShJ,EAAKx2D,IACvB,CAkFM8/D,CAAsBj3D,KAAK0jD,MAAO1jD,KAAKoW,IAAIhkB,MAC3C4N,KAAK82D,cAAgB,KACrB92D,KAAKg3D,cAAgB,MAEhBpyD,QAAQF,UAGjB8wD,gBAAAA,CAAiB0B,GACY,OAAvBl3D,KAAKg3D,eACP14C,GAAM,eAAiB44C,EAAU,4BCxPtCn/B,GAAqBtyB,UAAkB0xD,aAAe,SACrD3jC,EACAC,GAEAzzB,KAAKyxB,YAAY,IAAK,CAAElyB,EAAGi0B,GAAcC,EAC3C,EAGCsE,GAAqBtyB,UAAkB2xD,KAAO,SAC7ClxD,EACAmxD,GAEAr3D,KAAKyxB,YAAY,OAAQ,CAAEx+B,EAAGiT,GAAQmxD,EACxC,GCVM,SAA2Bv/C,GAC/BsE,cACA/F,GACE,IAAI5M,EACF,YACA,CAACc,EAAS+sD,KAAiC,IAA7B9rD,mBAAoBkgB,GAAK4rC,EAIrC,OAAOnB,GAHK5rD,EAAUkD,YAAY,OAAOhC,eACpBlB,EAAUkD,YAAY,iBAClBlD,EAAUkD,YAAY,sBAK7Cie,EACD,GACF,UAEDzhB,sBAAqB,IAEzB2N,GAAgBxlB,GAAM8hB,GAAS4D,GAE/BF,GAAgBxlB,GAAM8hB,GAAS,UACjC,CCvBAqjD,GCdA//C,GAVuB,CACrBggD,OAAQ,0CACRC,WAAY,8BACZnB,YAAa,kDACbC,UAAW,cACXmB,cAAe,0BACfC,kBAAmB,eACnBp+C,MAAO,8CAIT,IAAIT,cJ8SU,IADZ1C,EAAAnkB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GhFoBc,WAAwC,IAAjCG,EAAAH,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAeoY,GACpC,MAAM+L,EAAMJ,GAAM9hB,IAAI9B,GACtB,IAAKgkB,GAAOhkB,IAASiY,IAAsB9F,IACzC,OAAOiT,KAET,IAAKpB,EACH,MAAMO,GAAc/Q,OAAwB,UAAE2R,QAASnlB,IAGzD,OAAOgkB,CACT,CgF9BqBwhD,GACnBlsC,EAAYz5B,UAAAC,OAAA,EAAAD,UAAA,QAAAE,EAEZ,MAAM2mB,EAAKtC,GAAaJ,EAAK,YAAY3K,aAAa,CACpDX,WAAY4gB,IAEd,IAAK5S,EAAGi+C,iBAAkB,CACxB,MAAMc,EAAW/zD,EAAkC,YAC/C+zD,GAkBF,SACJ/+C,EACA1e,EACAkK,GAGM,IAFNoH,EAAAzZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAEI,CAAC,EAEL6mB,EAAKvP,EAAmBuP,GACxBA,EAAG08C,iBAAiB,eAChB18C,EAAGi+C,kBACLz4C,GACE,0EAIJ,MAAMqvC,EAAO70C,EAAGg+C,cAChB,IAAIgB,EACJ,GAAInK,EAAKh+B,UAAUvM,UACb1X,EAAQqsD,eACVz5C,GACE,sJAGJw5C,EAAgB,IAAIt1C,GAAsBA,GAAsBE,YAC3D,GAAIhX,EAAQqsD,cAAe,CAChC,MAAMvxD,EAC6B,kBAA1BkF,EAAQqsD,cACXrsD,EAAQqsD,cKpRF,SACdvxD,EACA+vD,GAEA,GAAI/vD,EAAMwxD,IACR,MAAM,IAAI54D,MACR,gHAIJ,MAKM64D,EAAU1B,GAAa,eACvB2B,EAAM1xD,EAAM0xD,KAAO,EACnBC,EAAM3xD,EAAM2xD,KAAO3xD,EAAM4xD,QAC/B,IAAKD,EACH,MAAM,IAAI/4D,MAAM,wDAGlB,MAAMhE,EAAO5E,OAAAugB,OAAA,CAEXshD,IAAK,kCAAkCJ,IACvCK,IAAKL,EACLC,MACAK,IAAKL,EAAM,KACXM,UAAWN,EACXC,MACAC,QAASD,EACTM,SAAU,CACRC,iBAAkB,SAClBC,WAAY,CAAC,IAIZnyD,GAKL,MAAO,CACLjE,EAA8B9G,KAAKC,UAjCtB,CACbk9D,IAAK,OACLh6D,KAAM,SAgCN2D,EAA8B9G,KAAKC,UAAUN,IAH7B,IAKhBgG,KAAK,IACT,CLsOUy3D,CAAoBntD,EAAQqsD,cAAej/C,EAAG1C,IAAI1K,QAAQ6qD,WAChEuB,EAAgB,IAAIt1C,GAAsBhc,EAC3C,EAjSH,SACEmnD,EACAvzD,EACAkK,EACAwzD,GAEAnK,EAAKh+B,UAAY,IAAI3M,GACnB,GAAG5oB,KAAQkK,KACG,EACdqpD,EAAKh+B,UAAUzM,UACfyqC,EAAKh+B,UAAUxM,cACfwqC,EAAKh+B,UAAUvM,UACfuqC,EAAKh+B,UAAUtM,eACfsqC,EAAKh+B,UAAUrM,+BACM,GAGnBw0C,IACFnK,EAAKx1B,mBAAqB2/B,EAE9B,CAgREgB,CAAiCnL,EAAMvzD,EAAMkK,EAAMwzD,EACrD,CApDMiB,CAAwBjgD,KAAO++C,EAElC,CACD,OAAO/+C,CACT,CI1TSkgD,kBETF,MAAMC,IAAYt+D,EAAAA,EAAAA,IAAY,CACnCvI,KAAM,OACNwI,aAAc,CACZs+D,MAAO,GACP17D,UAAMrL,EACNgnE,UAAU9jE,EAAAA,EAAAA,MACV+jE,GAAI,IAENp+D,SAAU,CACRq+D,MAAOA,CAACn+D,EAAOC,KAGN,IACFD,EACHk+D,GAJOj+D,EAAOC,UAOlBk+D,SAAUA,CAACp+D,EAAOC,KAET,IAAKD,EAAOg+D,MADJ/9D,EAAOC,QAAUD,EAAOC,QAAU,KAGnDm+D,eAAgBA,CAACr+D,EAAOC,IACfD,EAETs+D,wBAAyBA,CAACt+D,EAAOC,KAC/B,IAAIzG,EAASyG,EAAOC,QAEhBq+D,GAAMpkE,EAAAA,EAAAA,MASV,OALEX,EAAOglE,UAFG,UAARD,EAEiB/kE,EAAOglE,UAAUC,GAGjBjlE,EAAOglE,UAAUE,GAE/B,IACF1+D,EACH2+D,cAAe,IAAKnlE,EAAQykE,SAAUM,GACvC,EAEHK,WAAYA,CAAC5+D,EAAOC,KACX,IACFD,EACHsD,cAAerD,EAAOC,QACtBoC,KAAM,OAGVu8D,UAAWA,CAAC7+D,EAAOC,KAGjB,GAFAjG,QAAQC,IAAI,aAEyB,SAAjCsE,aAAaC,QAAQ,SAAuD,OAAjCD,aAAaC,QAAQ,QAElE,OADAxE,QAAQC,IAAI,0DACL,IACA+F,GAEJ,CACH,MAAMsC,EAAO/D,aAAaC,QAAQ,QAClCxE,QAAQC,IAAI,sCAAuCqI,GAEnD,IAEI,IAAIw8D,EAAQv+D,KAAKO,MAAMjI,OAAOkI,KAAKuB,IAGnC,OAFAtI,QAAQC,IAAI,wBAAyB6kE,GAE9B,IACA9+D,EACHsC,KAAMw8D,EAEd,CAAE,MAAOr3D,IAEL,OADAzN,QAAQyN,MAAM,sDAAuDA,IAC9D,IACAzH,EAEX,CACJ,GAGA++D,mBAAoBA,CAAC/+D,EAAOC,MAG1BpI,EAAAA,GAAAA,IAAc,OAAQoI,EAAOC,QAAQnG,WAAWI,EAAAA,EAAAA,OAGhDoE,aAAa8B,QAAQ,OAAQxH,OAAOyH,KAAKC,KAAKC,UAAUP,EAAOC,WAExD,IACFF,EACHsC,KAAMrC,EAAOC,UAGjB8+D,WAAYA,CAACh/D,EAAOC,MAClB5H,EAAAA,GAAAA,IAAiB,QAAQ8B,EAAAA,EAAAA,OACzBoE,aAAa8B,QAAQ,OAAQ,MACtB,IACFL,EACHsC,UAAMrL,OAMDgoE,GAAsB18D,GAASL,UAC1ClJ,GAAIy/D,GF3FG76C,GE2FmB,kBAAoBrb,IAC3CsV,MAAM2gD,IACL,MAAMxtD,EAAOwtD,EAASxkD,MACtB7R,EAASm8D,GAAwBtzD,GAAM,IAExCpB,OAAOnC,IACNzN,QAAQyN,MAAMA,EAAM,GACpB,EAGOy3D,GAA2B58D,GAASJ,MAAOC,EAAUC,KAChE,GACE7D,aAAaC,QAAQ,SACY,KAAjCD,aAAaC,QAAQ,SACY,OAAjCD,aAAaC,QAAQ,SACY,SAAjCD,aAAaC,QAAQ,QACrB,CACA,IAAI2gE,EAAM5+D,KAAKO,MAAOjI,OAAOkI,KAAKxC,aAAaC,QAAQ,UAGnD2gE,EAAKplE,YAAcuI,GAErBH,EAAS48D,GAAmB,IAAKI,EAAMplE,UAAWuI,IAEtD,CAIA,IAAIkuB,EAAM,GAAGpuB,IAAWG,KAAKe,cAAc87D,mFAAmF98D,IAG9H,IACE,IAAI++B,QAAiBg+B,MAAM7uC,GAC3B,GAAI6Q,EAASi+B,GAAI,CAIf,IAAIC,QAAal+B,EAASk+B,OAEtBC,GADS,IAAIC,WACGC,gBAAgBH,EAAM,mBAGtCI,EAAYH,EAAOI,cAAc,aAAajwC,YAC9CkwC,EAAYL,EAAOI,cAAc,aAAajwC,YAChD,GAAe,MAAZgwC,EACH,CACE3lE,QAAQC,IAAI,aAAc4lE,GAE1B,IAAIC,EAAaN,EAAOI,cAAc,cAAcjwC,YAAY34B,OAAS,EACpEwoE,EAAOI,cAAc,cAAcjwC,YAAc,GAClD/sB,EAAQ48D,EAAOI,cAAc,SAASjwC,YAEtCowC,EAAQP,EAAOI,cAAc,SAASjwC,YAAY34B,OAAS,EACzDwoE,EAAOI,cAAc,SAASjwC,YAAc,GAC9C7sB,EAAQ08D,EAAOI,cAAc,UAAUjwC,YAAY34B,OAAS,EACzDwoE,EAAOI,cAAc,UAAUjwC,YAAa,GAC/CqwC,EAASR,EAAOI,cAAc,UAAUjwC,YAAY34B,OAAS,EACzDwoE,EAAOI,cAAc,UAAUjwC,YAAc,GACjDjtB,EAAW88D,EAAOI,cAAc,YAAYjwC,YAAY34B,OAAS,EAC/DwoE,EAAOI,cAAc,YAAYjwC,YAAc,GACjDswC,EAAYT,EAAOI,cAAc,aAAajwC,YAAY34B,OAAS,EACjEwoE,EAAOI,cAAc,aAAajwC,YAAc,GAClDntB,EAAQg9D,EAAOI,cAAc,SAASjwC,YAAY34B,OAAS,EACzDwoE,EAAOI,cAAc,SAASjwC,YAAc,GAYlDxtB,EAAS48D,GAAmB,IAXX,CACXe,aACAl9D,QACAm9D,QACAj9D,SACAk9D,SACAt9D,WACAu9D,YACAz9D,SAGuCzI,UAAWuI,IAK1D,CAGF,MAGEtI,QAAQyN,MAAM,yBAA0B45B,EAASrB,OA2EvD,CAAE,MAAOv4B,IACPtF,EAAS48D,GAAmB,CAAE/zD,KAAMvD,GAAOnF,KAAMA,IACnD,IAGW,SACX87D,GAAQ,wBACRE,GAAuB,WACvBM,GAAU,mBACVG,GAAkB,WAClBC,GAAU,MACVb,GAAK,UACLU,IACEd,GAAUn6D,QAKd,GAAem6D,GAAiB,6QCzRpBmC,uHAAZ,SAAYA,GAQVA,EAAA,UAOAA,EAAA,YAMAA,EAAA,iBACD,CAtBD,CAAYA,IAAAA,EAsBX,KAqKD,MAAMC,EAAoB,WAqKV,SAAAC,EACd5vD,GAoBA,YApBA,IAAAA,IAAAA,EAAiC,CAAC,GAoB3B6vD,GAlBP,SACExnE,EACAynE,GAEA,IAAI,SAAE9nE,EAAQ,OAAEI,EAAM,KAAE4/B,GAAS3/B,EAAON,SACxC,OAAOgoE,EACL,GACA,CAAE/nE,WAAUI,SAAQ4/B,QAEnB8nC,EAActgE,OAASsgE,EAActgE,MAAMwgE,KAAQ,KACnDF,EAActgE,OAASsgE,EAActgE,MAAM/D,KAAQ,UAExD,IAEA,SAA2BpD,EAAgBi+D,GACzC,MAAqB,kBAAPA,EAAkBA,EAAK2J,EAAW3J,EAClD,GAKE,KACAtmD,EAEJ,CAyGgB,SAAAkwD,EAAUj9D,EAAYO,GACpC,IAAc,IAAVP,GAA6B,OAAVA,GAAmC,qBAAVA,EAC9C,MAAM,IAAIS,MAAMF,EAEpB,CAEgB,SAAA+Y,EAAQ4jD,EAAW38D,GACjC,IAAK28D,EAAM,CAEc,qBAAZ3mE,SAAyBA,QAAQ4a,KAAK5Q,GAEjD,IAME,MAAM,IAAIE,MAAMF,EAEjB,CAAC,MAAOwD,GAAI,CACd,CACH,CASA,SAASo5D,EAAgBroE,EAAoBkgB,GAC3C,MAAO,CACL+nD,IAAKjoE,EAASyH,MACd/D,IAAK1D,EAAS0D,IACdsyC,IAAK91B,EAET,CAKM,SAAU8nD,EACdt/D,EACA61D,EACA92D,EACA/D,GAcA,YAfA,IAAA+D,IAAAA,EAAa,MAGD6gE,EAAA,CACVroE,SAA6B,kBAAZyI,EAAuBA,EAAUA,EAAQzI,SAC1DI,OAAQ,GACR4/B,KAAM,IACY,kBAAPs+B,EAAkBgK,EAAUhK,GAAMA,EAAE,CAC/C92D,QAKA/D,IAAM66D,GAAOA,EAAgB76D,KAAQA,GAjChC4oB,KAAKmI,SAAStL,SAAS,IAAI5oB,OAAO,EAAG,IAoC9C,CAKgB,SAAA2nE,EAAUvuD,GAIV,IAJW,SACzB1Z,EAAW,IAAG,OACdI,EAAS,GAAE,KACX4/B,EAAO,IACOtmB,EAKd,OAJItZ,GAAqB,MAAXA,IACZJ,GAAiC,MAArBI,EAAOlB,OAAO,GAAakB,EAAS,IAAMA,GACpD4/B,GAAiB,MAATA,IACVhgC,GAA+B,MAAnBggC,EAAK9gC,OAAO,GAAa8gC,EAAO,IAAMA,GAC7ChgC,CACT,CAKM,SAAUsoE,EAAUnmC,GACxB,IAAIomC,EAA4B,CAAC,EAEjC,GAAIpmC,EAAM,CACR,IAAIqmC,EAAYrmC,EAAK/iC,QAAQ,KACzBopE,GAAa,IACfD,EAAWvoC,KAAOmC,EAAK7hC,OAAOkoE,GAC9BrmC,EAAOA,EAAK7hC,OAAO,EAAGkoE,IAGxB,IAAIC,EAActmC,EAAK/iC,QAAQ,KAC3BqpE,GAAe,IACjBF,EAAWnoE,OAAS+hC,EAAK7hC,OAAOmoE,GAChCtmC,EAAOA,EAAK7hC,OAAO,EAAGmoE,IAGpBtmC,IACFomC,EAAWvoE,SAAWmiC,EAEzB,CAED,OAAOomC,CACT,CASA,SAASV,EACPa,EACAC,EACAC,EACA5wD,QAAA,IAAAA,IAAAA,EAA6B,CAAC,GAE9B,IAAI,OAAE3X,EAASxB,SAASgqE,YAAY,SAAEC,GAAW,GAAU9wD,EACvD8vD,EAAgBznE,EAAO0oE,QACvBthE,EAASigE,EAAOsB,IAChB96C,EAA4B,KAE5BjO,EAAQ4nB,IASZ,SAASA,IAEP,OADYigC,EAActgE,OAAS,CAAEuuC,IAAK,OAC7BA,GACf,CAEA,SAASkzB,IACPxhE,EAASigE,EAAOsB,IAChB,IAAIE,EAAYrhC,IACZ6C,EAAqB,MAAbw+B,EAAoB,KAAOA,EAAYjpD,EACnDA,EAAQipD,EACJh7C,GACFA,EAAS,CAAEzmB,SAAQ1H,SAAUgpE,EAAQhpE,SAAU2qC,SAEnD,CA+CA,SAASy+B,EAAU7K,GAIjB,IAAI8K,EACyB,SAA3B/oE,EAAON,SAAS05B,OACZp5B,EAAON,SAAS05B,OAChBp5B,EAAON,SAASq1B,KAElBA,EAAqB,kBAAPkpC,EAAkBA,EAAK2J,EAAW3J,GASpD,OALAlpC,EAAOA,EAAKtmB,QAAQ,KAAM,OAC1Bo5D,EACEkB,EACsE,sEAAAh0C,GAEjE,IAAIi0C,IAAIj0C,EAAMg0C,EACvB,CApFa,MAATnpD,IACFA,EAAQ,EACR6nD,EAAcwB,aAAYjB,EAAM,GAAAP,EAActgE,MAAO,CAAAuuC,IAAK91B,IAAS,KAoFrE,IAAI8oD,EAAmB,CACrB,UAAIthE,GACF,OAAOA,GAET,YAAI1H,GACF,OAAO2oE,EAAYroE,EAAQynE,IAE7BjhC,MAAAA,CAAOtzB,GACL,GAAI2a,EACF,MAAM,IAAIxiB,MAAM,8CAKlB,OAHArL,EAAOqe,iBAAiBipD,EAAmBsB,GAC3C/6C,EAAW3a,EAEJ,KACLlT,EAAOke,oBAAoBopD,EAAmBsB,GAC9C/6C,EAAW,IAAI,GAGnBy6C,WAAWrK,GACFqK,EAAWtoE,EAAQi+D,GAE5B6K,YACAI,cAAAA,CAAejL,GAEb,IAAItmC,EAAMmxC,EAAU7K,GACpB,MAAO,CACLt+D,SAAUg4B,EAAIh4B,SACdI,OAAQ43B,EAAI53B,OACZ4/B,KAAMhI,EAAIgI,OAGd78B,KAlGF,SAAcm7D,EAAQ92D,GACpBC,EAASigE,EAAO8B,KAChB,IAAIzpE,EAAWgoE,EAAegB,EAAQhpE,SAAUu+D,EAAI92D,GAChDohE,GAAkBA,EAAiB7oE,EAAUu+D,GAEjDr+C,EAAQ4nB,IAAa,EACrB,IAAI4hC,EAAerB,EAAgBroE,EAAUkgB,GACzC+X,EAAM+wC,EAAQJ,WAAW5oE,GAG7B,IACE+nE,EAAc4B,UAAUD,EAAc,GAAIzxC,GAC1C,MAAO/oB,GAKP,GAAIA,aAAiBwP,cAA+B,mBAAfxP,EAAMvQ,KACzC,MAAMuQ,EAIR5O,EAAON,SAASsjB,OAAO2U,EACxB,CAEG8wC,GAAY56C,GACdA,EAAS,CAAEzmB,SAAQ1H,SAAUgpE,EAAQhpE,SAAU2qC,MAAO,GAE1D,EAuEE57B,QArEF,SAAiBwvD,EAAQ92D,GACvBC,EAASigE,EAAOiC,QAChB,IAAI5pE,EAAWgoE,EAAegB,EAAQhpE,SAAUu+D,EAAI92D,GAChDohE,GAAkBA,EAAiB7oE,EAAUu+D,GAEjDr+C,EAAQ4nB,IACR,IAAI4hC,EAAerB,EAAgBroE,EAAUkgB,GACzC+X,EAAM+wC,EAAQJ,WAAW5oE,GAC7B+nE,EAAcwB,aAAaG,EAAc,GAAIzxC,GAEzC8wC,GAAY56C,GACdA,EAAS,CAAEzmB,SAAQ1H,SAAUgpE,EAAQhpE,SAAU2qC,MAAO,GAE1D,EAyDEk/B,GAAGx0D,GACM0yD,EAAc8B,GAAGx0D,IAI5B,OAAO2zD,CACT,CC7tBA,IAAYc,GAAZ,SAAYA,GACVA,EAAA,YACAA,EAAA,oBACAA,EAAA,oBACAA,EAAA,aACD,CALD,CAAYA,IAAAA,EAKX,KAyOiC,IAAIxwD,IAAuB,CAC3D,OACA,gBACA,OACA,KACA,QACA,aAoNI,SAAUywD,EAGdC,EACAC,EACAC,QAAQ,IAARA,IAAAA,EAAW,KAEX,IAGIjqE,EAAWkqE,GAFU,kBAAhBF,EAA2B1B,EAAU0B,GAAeA,GAEvBhqE,UAAY,IAAKiqE,GAEvD,GAAgB,MAAZjqE,EACF,OAAO,KAGT,IAAImqE,EAAWC,EAAcL,IAgM/B,SAA2BI,GACzBA,EAAShsD,MAAK,CAAC3Z,EAAGC,IAChBD,EAAE6lE,QAAU5lE,EAAE4lE,MACV5lE,EAAE4lE,MAAQ7lE,EAAE6lE,MAyCpB,SAAwB7lE,EAAaC,GACnC,IAAI6lE,EACF9lE,EAAEhG,SAAWiG,EAAEjG,QAAUgG,EAAEvB,MAAM,GAAI,GAAGs5D,OAAM,CAACnnD,EAAGpW,IAAMoW,IAAM3Q,EAAEzF,KAElE,OAAOsrE,EAKH9lE,EAAEA,EAAEhG,OAAS,GAAKiG,EAAEA,EAAEjG,OAAS,GAG/B,CACN,CArDQ+rE,CACE/lE,EAAEgmE,WAAWplE,KAAKqlE,GAASA,EAAKC,gBAChCjmE,EAAE+lE,WAAWplE,KAAKqlE,GAASA,EAAKC,kBAG1C,CAxMEC,CAAkBR,GAElB,IAAInwB,EAAU,KACd,IAAK,IAAIh7C,EAAI,EAAc,MAAXg7C,GAAmBh7C,EAAImrE,EAAS3rE,SAAUQ,EAAG,CAO3D,IAAIkR,EAAUkvD,EAAWp/D,GACzBg6C,EAAU4wB,EAA0CT,EAASnrE,GAAIkR,EAClE,CAED,OAAO8pC,CACT,CAyCA,SAASowB,EAGPL,EACAI,EACAU,EACAtJ,QAF2C,IAA3C4I,IAAAA,EAA2C,SAC3C,IAAAU,IAAAA,EAA4C,SAClC,IAAVtJ,IAAAA,EAAa,IAEb,IAAIuJ,EAAeA,CACjBC,EACA9qD,EACA0jC,KAEA,IAAI8mB,EAAmC,CACrC9mB,kBACmBllD,IAAjBklD,EAA6BonB,EAAM5oC,MAAQ,GAAKwhB,EAClDqnB,eAAuC,IAAxBD,EAAMC,cACrBN,cAAezqD,EACf8qD,SAGEN,EAAK9mB,aAAasnB,WAAW,OAC/B/C,EACEuC,EAAK9mB,aAAasnB,WAAW1J,GAC7B,wBAAwBkJ,EAAK9mB,aAA7B,wBACM4d,EADN,4GAKFkJ,EAAK9mB,aAAe8mB,EAAK9mB,aAAa1gD,MAAMs+D,EAAW/iE,SAGzD,IAAI2jC,EAAO+oC,EAAU,CAAC3J,EAAYkJ,EAAK9mB,eACnC6mB,EAAaK,EAAYtc,OAAOkc,GAKhCM,EAAMzzB,UAAYyzB,EAAMzzB,SAAS94C,OAAS,IAC5C0pE,GAGkB,IAAhB6C,EAAM9qD,MACN,4FACuCkiB,EAAI,MAG7CioC,EAAcW,EAAMzzB,SAAU6yB,EAAUK,EAAYroC,KAKpC,MAAd4oC,EAAM5oC,MAAiB4oC,EAAM9qD,QAIjCkqD,EAAShnE,KAAK,CACZg/B,OACAkoC,MAAOc,EAAahpC,EAAM4oC,EAAM9qD,OAChCuqD,cACA,EAaJ,OAXAT,EAAOvhE,SAAQ,CAACuiE,EAAO9qD,KAAS,IAAAmrD,EAE9B,GAAmB,KAAfL,EAAM5oC,MAA0B,OAAXipC,EAACL,EAAM5oC,OAANipC,EAAYt3D,SAAS,KAG7C,IAAK,IAAIu3D,KAAYC,EAAwBP,EAAM5oC,MACjD2oC,EAAaC,EAAO9qD,EAAOorD,QAH7BP,EAAaC,EAAO9qD,EAKrB,IAGIkqD,CACT,CAgBA,SAASmB,EAAwBnpC,GAC/B,IAAIopC,EAAWppC,EAAKpjC,MAAM,KAC1B,GAAwB,IAApBwsE,EAAS/sE,OAAc,MAAO,GAElC,IAAKgtE,KAAUC,GAAQF,EAGnBG,EAAaF,EAAMG,SAAS,KAE5BC,EAAWJ,EAAM18D,QAAQ,MAAO,IAEpC,GAAoB,IAAhB28D,EAAKjtE,OAGP,OAAOktE,EAAa,CAACE,EAAU,IAAM,CAACA,GAGxC,IAAIC,EAAeP,EAAwBG,EAAK/9D,KAAK,MAEjDpK,EAAmB,GAqBvB,OAZAA,EAAOH,QACF0oE,EAAazmE,KAAK0mE,GACP,KAAZA,EAAiBF,EAAW,CAACA,EAAUE,GAASp+D,KAAK,QAKrDg+D,GACFpoE,EAAOH,QAAQ0oE,GAIVvoE,EAAO8B,KAAKimE,GACjBlpC,EAAK8oC,WAAW,MAAqB,KAAbI,EAAkB,IAAMA,GAEpD,CAaA,MAAMU,EAAU,YACVC,EAAsB,EACtBC,EAAkB,EAClBC,EAAoB,EACpBC,EAAqB,GACrBC,GAAgB,EAChBC,EAAWngD,GAAoB,MAANA,EAE/B,SAASi/C,EAAahpC,EAAcliB,GAClC,IAAIsrD,EAAWppC,EAAKpjC,MAAM,KACtButE,EAAef,EAAS/sE,OAS5B,OARI+sE,EAASxsD,KAAKstD,KAChBC,GAAgBF,GAGdnsD,IACFqsD,GAAgBL,GAGXV,EACJziE,QAAQojB,IAAOmgD,EAAQngD,KACvB3nB,QACC,CAAC8lE,EAAO9K,IACN8K,GACC0B,EAAQv6D,KAAK+tD,GACVyM,EACY,KAAZzM,EACA2M,EACAC,IACNG,EAEN,CAiBA,SAAS1B,EAIP2B,EACAvsE,GAEA,IAAI,WAAEwqE,GAAe+B,EAEjBC,EAAgB,CAAC,EACjBC,EAAkB,IAClBzyB,EAA2D,GAC/D,IAAK,IAAIh7C,EAAI,EAAGA,EAAIwrE,EAAWhsE,SAAUQ,EAAG,CAC1C,IAAIyrE,EAAOD,EAAWxrE,GAClB0tE,EAAM1tE,IAAMwrE,EAAWhsE,OAAS,EAChCmuE,EACkB,MAApBF,EACIzsE,EACAA,EAASiD,MAAMwpE,EAAgBjuE,SAAW,IAC5CyR,EAAQ28D,EACV,CAAEzqC,KAAMsoC,EAAK9mB,aAAcqnB,cAAeP,EAAKO,cAAe0B,OAC9DC,GAGF,IAAK18D,EAAO,OAAO,KAEnBnN,OAAOugB,OAAOmpD,EAAev8D,EAAMugB,QAEnC,IAAIu6C,EAAQN,EAAKM,MAEjB/wB,EAAQ72C,KAAK,CAEXqtB,OAAQg8C,EACRxsE,SAAUkrE,EAAU,CAACuB,EAAiBx8D,EAAMjQ,WAC5C6sE,aAAcC,EACZ5B,EAAU,CAACuB,EAAiBx8D,EAAM48D,gBAEpC9B,UAGyB,MAAvB96D,EAAM48D,eACRJ,EAAkBvB,EAAU,CAACuB,EAAiBx8D,EAAM48D,eAEvD,CAED,OAAO7yB,CACT,CAiHgB,SAAA4yB,EAIdG,EACA/sE,GAEuB,kBAAZ+sE,IACTA,EAAU,CAAE5qC,KAAM4qC,EAAS/B,eAAe,EAAO0B,KAAK,IAGxD,IAAKM,EAASC,GA4ChB,SACE9qC,EACA6oC,EACA0B,QADa,IAAb1B,IAAAA,GAAgB,QACb,IAAH0B,IAAAA,GAAM,GAENnoD,EACW,MAAT4d,IAAiBA,EAAKwpC,SAAS,MAAQxpC,EAAKwpC,SAAS,MACrD,eAAexpC,EAAf,oCACMA,EAAKrzB,QAAQ,MAAO,MAD1B,qIAGsCqzB,EAAKrzB,QAAQ,MAAO,MAAK,MAGjE,IAAI0hB,EAA8B,GAC9B08C,EACF,IACA/qC,EACGrzB,QAAQ,UAAW,IACnBA,QAAQ,OAAQ,KAChBA,QAAQ,qBAAsB,QAC9BA,QACC,qBACA,CAACtM,EAAW2qE,EAAmBzB,KAC7Bl7C,EAAOrtB,KAAK,CAAEgqE,YAAWzB,WAA0B,MAAdA,IAC9BA,EAAa,eAAiB,gBAIzCvpC,EAAKwpC,SAAS,MAChBn7C,EAAOrtB,KAAK,CAAEgqE,UAAW,MACzBD,GACW,MAAT/qC,GAAyB,OAATA,EACZ,QACA,qBACGuqC,EAETQ,GAAgB,QACE,KAAT/qC,GAAwB,MAATA,IAQxB+qC,GAAgB,iBAKlB,IAAIF,EAAU,IAAI9/C,OAAOggD,EAAclC,OAAgBvsE,EAAY,KAEnE,MAAO,CAACuuE,EAASx8C,EACnB,CAjGkC48C,CAC9BL,EAAQ5qC,KACR4qC,EAAQ/B,cACR+B,EAAQL,KAGNz8D,EAAQjQ,EAASiQ,MAAM+8D,GAC3B,IAAK/8D,EAAO,OAAO,KAEnB,IAAIw8D,EAAkBx8D,EAAM,GACxB48D,EAAeJ,EAAgB39D,QAAQ,UAAW,MAClDu+D,EAAgBp9D,EAAMhN,MAAM,GAuBhC,MAAO,CACLutB,OAvBmBy8C,EAAe1oE,QAClC,CAAC+oE,EAAI5zD,EAA6BuG,KAAS,IAApC,UAAEktD,EAAS,WAAEzB,GAAYhyD,EAG9B,GAAkB,MAAdyzD,EAAmB,CACrB,IAAII,EAAaF,EAAcptD,IAAU,GACzC4sD,EAAeJ,EACZxpE,MAAM,EAAGwpE,EAAgBjuE,OAAS+uE,EAAW/uE,QAC7CsQ,QAAQ,UAAW,KACvB,CAED,MAAM7D,EAAQoiE,EAAcptD,GAM5B,OAJEqtD,EAAKH,GADHzB,IAAezgE,OACCxM,GAECwM,GAAS,IAAI6D,QAAQ,OAAQ,KAE3Cw+D,CAAI,GAEb,CAAC,GAKDttE,SAAUysE,EACVI,eACAE,UAEJ,CA2DA,SAAS3N,EAAWn0D,GAClB,IACE,OAAOA,EACJlM,MAAM,KACNqG,KAAK4mB,GAAMptB,mBAAmBotB,GAAGld,QAAQ,MAAO,SAChDpB,KAAK,KACR,MAAOuB,GAQP,OAPAsV,GACE,EACA,iBAAiBtZ,EAAjB,oHAEegE,EAAK,MAGfhE,CACR,CACH,CAKgB,SAAAi/D,EACdlqE,EACAiqE,GAEA,GAAiB,MAAbA,EAAkB,OAAOjqE,EAE7B,IAAKA,EAASgtB,cAAci+C,WAAWhB,EAASj9C,eAC9C,OAAO,KAKT,IAAIwgD,EAAavD,EAAS0B,SAAS,KAC/B1B,EAASzrE,OAAS,EAClByrE,EAASzrE,OACTivE,EAAWztE,EAASd,OAAOsuE,GAC/B,OAAIC,GAAyB,MAAbA,EAEP,KAGFztE,EAASiD,MAAMuqE,IAAe,GACvC,CA2CA,SAASE,EACPnqE,EACAoqE,EACAC,EACAzrC,GAEA,MACE,qBAAqB5+B,EAArB,2CACQoqE,EAAK,YAAa5lE,KAAKC,UAC7Bm6B,GAFF,yCAIQyrC,EAJR,2HAOJ,CAyBM,SAAUC,EAEd7zB,GACA,OAAOA,EAAQlxC,QACb,CAACmH,EAAOgQ,IACI,IAAVA,GAAgBhQ,EAAM86D,MAAM5oC,MAAQlyB,EAAM86D,MAAM5oC,KAAK3jC,OAAS,GAEpE,CAIgB,SAAAsvE,EAEd9zB,EAAc+zB,GACd,IAAIC,EAAcH,EAA2B7zB,GAK7C,OAAI+zB,EACKC,EAAY5oE,KAAI,CAAC6K,EAAO8lC,IAC7BA,IAAQiE,EAAQx7C,OAAS,EAAIyR,EAAMjQ,SAAWiQ,EAAM48D,eAIjDmB,EAAY5oE,KAAK6K,GAAUA,EAAM48D,cAC1C,CAKM,SAAUoB,EACdC,EACAC,EACAC,EACAC,GAEA,IAAI/P,OAFU,IAAd+P,IAAAA,GAAiB,GAGI,kBAAVH,EACT5P,EAAKgK,EAAU4F,IAEf5P,EAAE+J,EAAQ,GAAA6F,GAEVhG,GACG5J,EAAGt+D,WAAas+D,EAAGt+D,SAAS8T,SAAS,KACtC45D,EAAoB,IAAK,WAAY,SAAUpP,IAEjD4J,GACG5J,EAAGt+D,WAAas+D,EAAGt+D,SAAS8T,SAAS,KACtC45D,EAAoB,IAAK,WAAY,OAAQpP,IAE/C4J,GACG5J,EAAGl+D,SAAWk+D,EAAGl+D,OAAO0T,SAAS,KAClC45D,EAAoB,IAAK,SAAU,OAAQpP,KAI/C,IAGI5lD,EAHA41D,EAAwB,KAAVJ,GAAgC,KAAhB5P,EAAGt+D,SACjCuuE,EAAaD,EAAc,IAAMhQ,EAAGt+D,SAaxC,GAAkB,MAAduuE,EACF71D,EAAO01D,MACF,CACL,IAAII,EAAqBL,EAAe3vE,OAAS,EAMjD,IAAK6vE,GAAkBE,EAAWtD,WAAW,MAAO,CAClD,IAAIwD,EAAaF,EAAWxvE,MAAM,KAElC,KAAyB,OAAlB0vE,EAAW,IAChBA,EAAWvuD,QACXsuD,GAAsB,EAGxBlQ,EAAGt+D,SAAWyuE,EAAW/gE,KAAK,IAC/B,CAEDgL,EAAO81D,GAAsB,EAAIL,EAAeK,GAAsB,GACvE,CAED,IAAIrsC,WAzKsBm8B,EAAQoQ,QAAY,IAAZA,IAAAA,EAAe,KACjD,IACE1uE,SAAUuuE,EAAU,OACpBnuE,EAAS,GAAE,KACX4/B,EAAO,IACS,kBAAPs+B,EAAkBgK,EAAUhK,GAAMA,EAEzCt+D,EAAWuuE,EACXA,EAAWtD,WAAW,KACpBsD,EAWR,SAAyB5qB,EAAsB+qB,GAC7C,IAAInD,EAAWmD,EAAa5/D,QAAQ,OAAQ,IAAI/P,MAAM,KAYtD,OAXuB4kD,EAAa5kD,MAAM,KAEzByJ,SAAS+2D,IACR,OAAZA,EAEEgM,EAAS/sE,OAAS,GAAG+sE,EAAShkD,MACb,MAAZg4C,GACTgM,EAASpoE,KAAKo8D,EACf,IAGIgM,EAAS/sE,OAAS,EAAI+sE,EAAS79D,KAAK,KAAO,GACpD,CAxBQihE,CAAgBJ,EAAYG,GAC9BA,EAEJ,MAAO,CACL1uE,WACAI,OAAQwuE,EAAgBxuE,GACxB4/B,KAAM6uC,EAAc7uC,GAExB,CAuJa8uC,CAAYxQ,EAAI5lD,GAGvBq2D,EACFR,GAA6B,MAAfA,GAAsBA,EAAW5C,SAAS,KAEtDqD,GACDV,GAA8B,MAAfC,IAAuBH,EAAiBzC,SAAS,KAQnE,OANGxpC,EAAKniC,SAAS2rE,SAAS,OACvBoD,IAA4BC,IAE7B7sC,EAAKniC,UAAY,KAGZmiC,CACT,OAiBa+oC,EAAa+D,GACxBA,EAAMvhE,KAAK,KAAKoB,QAAQ,SAAU,KAKvBg+D,EAAqB9sE,GAChCA,EAAS8O,QAAQ,OAAQ,IAAIA,QAAQ,OAAQ,KAKlC8/D,EAAmBxuE,GAC7BA,GAAqB,MAAXA,EAEPA,EAAO6qE,WAAW,KAClB7qE,EACA,IAAMA,EAHN,GAQOyuE,EAAiB7uC,GAC3BA,GAAiB,MAATA,EAAoBA,EAAKirC,WAAW,KAAOjrC,EAAO,IAAMA,EAAzC,GA+BpB,MAAOkvC,UAA6BxjE,OAyRpC,SAAUyjE,EAAqBlgE,GACnC,OACW,MAATA,GACwB,kBAAjBA,EAAMu4B,QACe,kBAArBv4B,EAAMmgE,YACa,mBAAnBngE,EAAMogE,UACb,SAAUpgE,CAEd,CC75BA,MAAMqgE,EAAgD,CACpD,OACA,MACA,QACA,UAMIC,GAJuB,IAAIl2D,IAC/Bi2D,GAG2C,CAC3C,SACGA,IAEuB,IAAIj2D,IAAgBk2D,GAEpB,IAAIl2D,IAAI,CAAC,IAAK,IAAK,IAAK,IAAK,MACf,IAAIA,IAAI,CAAC,IAAK,MAmnElBm2D,OAAO,kCCpyF7C,iBAQE,WAGA,IAAI/wE,EAUAgxE,EAAkB,sBAIlBC,EAAiB,4BAMjBC,EAAc,yBAgBdC,EAAwB,GACxBC,EAAoB,GACpBC,EAA0B,GAC1BC,EAAgB,IAChBC,EAAkB,IAiBlBC,EAAW,IACXC,EAAmB,iBAEnBC,EAAM,IAGNC,EAAmB,WAKnBC,EAAY,CACd,CAAC,MAAON,GACR,CAAC,OAtCkB,GAuCnB,CAAC,UAtCsB,GAuCvB,CAAC,QArCmB,GAsCpB,CAAC,aAAcH,GACf,CAAC,OAjCkB,KAkCnB,CAAC,UAAWC,GACZ,CAAC,eAAgBC,GACjB,CAAC,QAASE,IAIRM,EAAU,qBACVC,EAAW,iBAEXC,EAAU,mBACVC,EAAU,gBAEVC,EAAW,iBACXC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBAEZC,EAAY,kBACZC,EAAa,mBAEbC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBAEZC,EAAa,mBAGbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBAGZC,EAAuB,iBACvBC,EAAsB,qBACtBC,EAAwB,gCAGxBC,EAAgB,4BAChBC,EAAkB,WAClBC,EAAmBplD,OAAOklD,EAAc/iE,QACxCkjE,EAAqBrlD,OAAOmlD,EAAgBhjE,QAG5CmjE,EAAW,mBACXC,EAAa,kBACbC,GAAgB,mBAGhBC,GAAe,mDACfC,GAAgB,QAChBC,GAAa,mGAMbC,GAAe,sBACfC,GAAkB7lD,OAAO4lD,GAAazjE,QAGtC2jE,GAAc,OAGdC,GAAe,KAGfC,GAAgB,4CAChBC,GAAgB,oCAChBC,GAAiB,QAGjBC,GAAc,4CAYdC,GAA6B,mBAG7BC,GAAe,WAMfC,GAAe,kCAGfC,GAAU,OAGVC,GAAa,qBAGbC,GAAa,aAGbC,GAAe,8BAGfC,GAAY,cAGZC,GAAW,mBAGXC,GAAU,8CAGVC,GAAY,OAGZC,GAAoB,yBAGpBC,GAAgB,kBAIhBC,GAAeC,gDACfC,GAAiB,kBACjBC,GAAe,4BAKfC,GAAe,4BACfC,GAAa,iBACbC,GAAeC,8OAGfC,GAAS,YACTC,GAAW,IAAMV,GAAgB,IACjCW,GAAU,IAAMJ,GAAe,IAC/BK,GAAU,IAAMX,GAAe,IAC/BY,GAAW,OACXC,GAAY,IAAMX,GAAiB,IACnCY,GAAU,IAAMX,GAAe,IAC/BY,GAAS,KAAOhB,GAAgBO,GAAeM,GAAWV,GAAiBC,GAAeC,GAAe,IACzGY,GAAS,2BAETC,GAAc,KAAOlB,GAAgB,IACrCmB,GAAa,kCACbC,GAAa,qCACbC,GAAU,IAAMhB,GAAe,IAC/BiB,GAAQ,UAGRC,GAAc,MAAQR,GAAU,IAAMC,GAAS,IAC/CQ,GAAc,MAAQH,GAAU,IAAML,GAAS,IAC/CS,GAAkB,qCAClBC,GAAkB,qCAClBC,GAZa,MAAQf,GAAU,IAAMK,GAAS,IAYtB,IACxBW,GAAW,IAAMtB,GAAa,KAI9BuB,GAAQD,GAAWD,IAHP,MAAQL,GAAQ,MAAQ,CAACJ,GAAaC,GAAYC,IAAY5nE,KAAK,KAAO,IAAMooE,GAAWD,GAAW,MAIlHG,GAAU,MAAQ,CAAChB,GAAWK,GAAYC,IAAY5nE,KAAK,KAAO,IAAMqoE,GACxEE,GAAW,MAAQ,CAACb,GAAcN,GAAU,IAAKA,GAASO,GAAYC,GAAYV,IAAUlnE,KAAK,KAAO,IAGxGwoE,GAAShpD,OAAOynD,GAAQ,KAMxBwB,GAAcjpD,OAAO4nD,GAAS,KAG9BsB,GAAYlpD,OAAOioD,GAAS,MAAQA,GAAS,KAAOc,GAAWF,GAAO,KAGtEM,GAAgBnpD,OAAO,CACzBqoD,GAAU,IAAMN,GAAU,IAAMU,GAAkB,MAAQ,CAACd,GAASU,GAAS,KAAK7nE,KAAK,KAAO,IAC9FgoE,GAAc,IAAME,GAAkB,MAAQ,CAACf,GAASU,GAAUE,GAAa,KAAK/nE,KAAK,KAAO,IAChG6nE,GAAU,IAAME,GAAc,IAAME,GACpCJ,GAAU,IAAMK,GAtBD,mDADA,mDA0Bfb,GACAiB,IACAtoE,KAAK,KAAM,KAGT4oE,GAAeppD,OAAO,IAAMsoD,GAAQtB,GAAiBC,GAAeK,GAAa,KAGjF+B,GAAmB,qEAGnBC,GAAe,CACjB,QAAS,SAAU,WAAY,OAAQ,QAAS,eAAgB,eAChE,WAAY,YAAa,aAAc,aAAc,MAAO,OAAQ,SACpE,UAAW,SAAU,MAAO,SAAU,SAAU,YAAa,aAC7D,oBAAqB,cAAe,cAAe,UACnD,IAAK,eAAgB,WAAY,WAAY,cAI3CC,IAAmB,EAGnBC,GAAiB,CAAC,EACtBA,GAAelF,GAAckF,GAAejF,GAC5CiF,GAAehF,GAAWgF,GAAe/E,GACzC+E,GAAe9E,GAAY8E,GAAe7E,GAC1C6E,GAAe5E,GAAmB4E,GAAe3E,GACjD2E,GAAe1E,IAAa,EAC5B0E,GAAepG,GAAWoG,GAAenG,GACzCmG,GAAepF,GAAkBoF,GAAelG,GAChDkG,GAAenF,GAAemF,GAAejG,GAC7CiG,GAAehG,GAAYgG,GAAe/F,GAC1C+F,GAAe7F,GAAU6F,GAAe5F,GACxC4F,GAAe3F,GAAa2F,GAAezF,GAC3CyF,GAAexF,GAAUwF,GAAevF,GACxCuF,GAAerF,IAAc,EAG7B,IAAIsF,GAAgB,CAAC,EACrBA,GAAcrG,GAAWqG,GAAcpG,GACvCoG,GAAcrF,GAAkBqF,GAAcpF,GAC9CoF,GAAcnG,GAAWmG,GAAclG,GACvCkG,GAAcnF,GAAcmF,GAAclF,GAC1CkF,GAAcjF,GAAWiF,GAAchF,GACvCgF,GAAc/E,GAAY+E,GAAc9F,GACxC8F,GAAc7F,GAAa6F,GAAc5F,GACzC4F,GAAc1F,GAAa0F,GAAczF,GACzCyF,GAAcxF,GAAawF,GAAcvF,GACzCuF,GAAc9E,GAAY8E,GAAc7E,GACxC6E,GAAc5E,GAAa4E,GAAc3E,IAAa,EACtD2E,GAAcjG,GAAYiG,GAAchG,GACxCgG,GAActF,IAAc,EAG5B,IA4EIuF,GAAgB,CAClB,KAAM,KACN,IAAK,IACL,KAAM,IACN,KAAM,IACN,SAAU,QACV,SAAU,SAIRC,GAAiBvxE,WACjBwxE,GAAevtE,SAGfwtE,GAA8B,iBAAVrnE,EAAAA,GAAsBA,EAAAA,GAAUA,EAAAA,EAAO5M,SAAWA,QAAU4M,EAAAA,EAGhFsnE,GAA0B,iBAARvnE,MAAoBA,MAAQA,KAAK3M,SAAWA,QAAU2M,KAGxE0jC,GAAO4jC,IAAcC,IAAYC,SAAS,cAATA,GAGjCC,GAA4CC,IAAYA,EAAQC,UAAYD,EAG5EE,GAAaH,IAA4CI,IAAWA,EAAOF,UAAYE,EAGvFC,GAAgBF,IAAcA,GAAWF,UAAYD,GAGrDM,GAAcD,IAAiBR,GAAW92E,QAG1Cw3E,GAAY,WACd,IAEE,IAAIC,EAAQL,IAAcA,GAAWM,SAAWN,GAAWM,QAAQ,QAAQD,MAE3E,OAAIA,GAKGF,IAAeA,GAAYI,SAAWJ,GAAYI,QAAQ,OACnE,CAAE,MAAO5oE,GAAI,CACf,CAZgB,GAeZ6oE,GAAoBJ,IAAYA,GAASK,cACzCC,GAAaN,IAAYA,GAASO,OAClCC,GAAYR,IAAYA,GAASS,MACjCC,GAAeV,IAAYA,GAASW,SACpCC,GAAYZ,IAAYA,GAASa,MACjCC,GAAmBd,IAAYA,GAASe,aAc5C,SAASz6D,GAAMP,EAAMi7D,EAASv9D,GAC5B,OAAQA,EAAK1c,QACX,KAAK,EAAG,OAAOgf,EAAKpK,KAAKqlE,GACzB,KAAK,EAAG,OAAOj7D,EAAKpK,KAAKqlE,EAASv9D,EAAK,IACvC,KAAK,EAAG,OAAOsC,EAAKpK,KAAKqlE,EAASv9D,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOsC,EAAKpK,KAAKqlE,EAASv9D,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOsC,EAAKO,MAAM06D,EAASv9D,EAC7B,CAYA,SAASw9D,GAAgB7iC,EAAO8iC,EAAQC,EAAUnuB,GAIhD,IAHA,IAAIxqC,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,SAE9ByhB,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GAClB04D,EAAOluB,EAAax/C,EAAO2tE,EAAS3tE,GAAQ4qC,EAC9C,CACA,OAAO4U,CACT,CAWA,SAASouB,GAAUhjC,EAAO+iC,GAIxB,IAHA,IAAI34D,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,SAE9ByhB,EAAQzhB,IAC8B,IAAzCo6E,EAAS/iC,EAAM51B,GAAQA,EAAO41B,KAIpC,OAAOA,CACT,CAWA,SAASijC,GAAejjC,EAAO+iC,GAG7B,IAFA,IAAIp6E,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OAEhCA,MAC0C,IAA3Co6E,EAAS/iC,EAAMr3C,GAASA,EAAQq3C,KAItC,OAAOA,CACT,CAYA,SAASkjC,GAAWljC,EAAO+N,GAIzB,IAHA,IAAI3jC,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,SAE9ByhB,EAAQzhB,GACf,IAAKolD,EAAU/N,EAAM51B,GAAQA,EAAO41B,GAClC,OAAO,EAGX,OAAO,CACT,CAWA,SAASmjC,GAAYnjC,EAAO+N,GAM1B,IALA,IAAI3jC,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACnCy6E,EAAW,EACX31E,EAAS,KAEJ2c,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACd2jC,EAAU34C,EAAOgV,EAAO41B,KAC1BvyC,EAAO21E,KAAchuE,EAEzB,CACA,OAAO3H,CACT,CAWA,SAAS41E,GAAcrjC,EAAO5qC,GAE5B,SADsB,MAAT4qC,EAAgB,EAAIA,EAAMr3C,SACpB26E,GAAYtjC,EAAO5qC,EAAO,IAAM,CACrD,CAWA,SAASmuE,GAAkBvjC,EAAO5qC,EAAOshC,GAIvC,IAHA,IAAItsB,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,SAE9ByhB,EAAQzhB,GACf,GAAI+tC,EAAWthC,EAAO4qC,EAAM51B,IAC1B,OAAO,EAGX,OAAO,CACT,CAWA,SAASo5D,GAASxjC,EAAO+iC,GAKvB,IAJA,IAAI34D,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACnC8E,EAASsJ,MAAMpO,KAEVyhB,EAAQzhB,GACf8E,EAAO2c,GAAS24D,EAAS/iC,EAAM51B,GAAQA,EAAO41B,GAEhD,OAAOvyC,CACT,CAUA,SAASg2E,GAAUzjC,EAAOl9B,GAKxB,IAJA,IAAIsH,GAAS,EACTzhB,EAASma,EAAOna,OAChBsW,EAAS+gC,EAAMr3C,SAEVyhB,EAAQzhB,GACfq3C,EAAM/gC,EAASmL,GAAStH,EAAOsH,GAEjC,OAAO41B,CACT,CAcA,SAAS0jC,GAAY1jC,EAAO+iC,EAAUnuB,EAAa+uB,GACjD,IAAIv5D,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OAKvC,IAHIg7E,GAAah7E,IACfisD,EAAc5U,IAAQ51B,MAEfA,EAAQzhB,GACfisD,EAAcmuB,EAASnuB,EAAa5U,EAAM51B,GAAQA,EAAO41B,GAE3D,OAAO4U,CACT,CAcA,SAASgvB,GAAiB5jC,EAAO+iC,EAAUnuB,EAAa+uB,GACtD,IAAIh7E,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OAIvC,IAHIg7E,GAAah7E,IACfisD,EAAc5U,IAAQr3C,IAEjBA,KACLisD,EAAcmuB,EAASnuB,EAAa5U,EAAMr3C,GAASA,EAAQq3C,GAE7D,OAAO4U,CACT,CAYA,SAASivB,GAAU7jC,EAAO+N,GAIxB,IAHA,IAAI3jC,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,SAE9ByhB,EAAQzhB,GACf,GAAIolD,EAAU/N,EAAM51B,GAAQA,EAAO41B,GACjC,OAAO,EAGX,OAAO,CACT,CASA,IAAI8jC,GAAYC,GAAa,UAmC7B,SAASC,GAAYn6B,EAAYkE,EAAWk2B,GAC1C,IAAIx2E,EAOJ,OANAw2E,EAASp6B,GAAY,SAASz0C,EAAOxH,EAAKi8C,GACxC,GAAIkE,EAAU34C,EAAOxH,EAAKi8C,GAExB,OADAp8C,EAASG,GACF,CAEX,IACOH,CACT,CAaA,SAASy2E,GAAclkC,EAAO+N,EAAWo2B,EAAWC,GAIlD,IAHA,IAAIz7E,EAASq3C,EAAMr3C,OACfyhB,EAAQ+5D,GAAaC,EAAY,GAAK,GAElCA,EAAYh6D,MAAYA,EAAQzhB,GACtC,GAAIolD,EAAU/N,EAAM51B,GAAQA,EAAO41B,GACjC,OAAO51B,EAGX,OAAQ,CACV,CAWA,SAASk5D,GAAYtjC,EAAO5qC,EAAO+uE,GACjC,OAAO/uE,IAAUA,EAidnB,SAAuB4qC,EAAO5qC,EAAO+uE,GACnC,IAAI/5D,EAAQ+5D,EAAY,EACpBx7E,EAASq3C,EAAMr3C,OAEnB,OAASyhB,EAAQzhB,GACf,GAAIq3C,EAAM51B,KAAWhV,EACnB,OAAOgV,EAGX,OAAQ,CACV,CA1dMi6D,CAAcrkC,EAAO5qC,EAAO+uE,GAC5BD,GAAclkC,EAAOskC,GAAWH,EACtC,CAYA,SAASI,GAAgBvkC,EAAO5qC,EAAO+uE,EAAWztC,GAIhD,IAHA,IAAItsB,EAAQ+5D,EAAY,EACpBx7E,EAASq3C,EAAMr3C,SAEVyhB,EAAQzhB,GACf,GAAI+tC,EAAWsJ,EAAM51B,GAAQhV,GAC3B,OAAOgV,EAGX,OAAQ,CACV,CASA,SAASk6D,GAAUlvE,GACjB,OAAOA,IAAUA,CACnB,CAWA,SAASovE,GAASxkC,EAAO+iC,GACvB,IAAIp6E,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,OAAOA,EAAU87E,GAAQzkC,EAAO+iC,GAAYp6E,EAAU2xE,CACxD,CASA,SAASyJ,GAAan2E,GACpB,OAAO,SAASmb,GACd,OAAiB,MAAVA,EAAiBngB,EAAYmgB,EAAOnb,EAC7C,CACF,CASA,SAAS82E,GAAe37D,GACtB,OAAO,SAASnb,GACd,OAAiB,MAAVmb,EAAiBngB,EAAYmgB,EAAOnb,EAC7C,CACF,CAeA,SAAS+2E,GAAW96B,EAAYk5B,EAAUnuB,EAAa+uB,EAAWM,GAMhE,OALAA,EAASp6B,GAAY,SAASz0C,EAAOgV,EAAOy/B,GAC1C+K,EAAc+uB,GACTA,GAAY,EAAOvuE,GACpB2tE,EAASnuB,EAAax/C,EAAOgV,EAAOy/B,EAC1C,IACO+K,CACT,CA+BA,SAAS6vB,GAAQzkC,EAAO+iC,GAKtB,IAJA,IAAIt1E,EACA2c,GAAS,EACTzhB,EAASq3C,EAAMr3C,SAEVyhB,EAAQzhB,GAAQ,CACvB,IAAIiK,EAAUmwE,EAAS/iC,EAAM51B,IACzBxX,IAAYhK,IACd6E,EAASA,IAAW7E,EAAYgK,EAAWnF,EAASmF,EAExD,CACA,OAAOnF,CACT,CAWA,SAASm3E,GAAUrlE,EAAGwjE,GAIpB,IAHA,IAAI34D,GAAS,EACT3c,EAASsJ,MAAMwI,KAEV6K,EAAQ7K,GACf9R,EAAO2c,GAAS24D,EAAS34D,GAE3B,OAAO3c,CACT,CAwBA,SAASo3E,GAASC,GAChB,OAAOA,EACHA,EAAO13E,MAAM,EAAG23E,GAAgBD,GAAU,GAAG7rE,QAAQkkE,GAAa,IAClE2H,CACN,CASA,SAASE,GAAUr9D,GACjB,OAAO,SAASvS,GACd,OAAOuS,EAAKvS,EACd,CACF,CAYA,SAAS6vE,GAAWl8D,EAAQnI,GAC1B,OAAO4iE,GAAS5iE,GAAO,SAAShT,GAC9B,OAAOmb,EAAOnb,EAChB,GACF,CAUA,SAASs3E,GAASntB,EAAOnqD,GACvB,OAAOmqD,EAAMr2C,IAAI9T,EACnB,CAWA,SAASu3E,GAAgBC,EAAYC,GAInC,IAHA,IAAIj7D,GAAS,EACTzhB,EAASy8E,EAAWz8E,SAEfyhB,EAAQzhB,GAAU26E,GAAY+B,EAAYD,EAAWh7D,GAAQ,IAAM,IAC5E,OAAOA,CACT,CAWA,SAASk7D,GAAcF,EAAYC,GAGjC,IAFA,IAAIj7D,EAAQg7D,EAAWz8E,OAEhByhB,KAAWk5D,GAAY+B,EAAYD,EAAWh7D,GAAQ,IAAM,IACnE,OAAOA,CACT,CA8BA,IAAIm7D,GAAeb,GAjxBG,CAEpB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IACtB,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAC1E,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IAAK,OAAQ,IAChD,OAAQ,IAAM,OAAQ,IAAK,OAAQ,IACnC,OAAQ,KAAM,OAAQ,KACtB,OAAQ,KAAM,OAAQ,KACtB,OAAQ,KAER,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IACvE,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IACvE,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IACvE,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IACvE,SAAU,IAAM,SAAU,IAC1B,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IACvE,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IACvE,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IACxD,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IACtF,SAAU,IAAM,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IAAK,SAAU,IACtF,SAAU,IAAM,SAAU,IAC1B,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,IAAM,SAAU,IAAK,SAAU,IACzC,SAAU,KAAM,SAAU,KAC1B,SAAU,KAAM,SAAU,KAC1B,SAAU,KAAM,SAAU,MAouBxBc,GAAiBd,GAhuBH,CAChB,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,UAouBP,SAASe,GAAiBC,GACxB,MAAO,KAAO3E,GAAc2E,EAC9B,CAqBA,SAASC,GAAWb,GAClB,OAAOrE,GAAa9kE,KAAKmpE,EAC3B,CAqCA,SAASc,GAAWr2E,GAClB,IAAI6a,GAAS,EACT3c,EAASsJ,MAAMxH,EAAImyB,MAKvB,OAHAnyB,EAAIoD,SAAQ,SAASyC,EAAOxH,GAC1BH,IAAS2c,GAAS,CAACxc,EAAKwH,EAC1B,IACO3H,CACT,CAUA,SAASo4E,GAAQl+D,EAAMm+D,GACrB,OAAO,SAASxxD,GACd,OAAO3M,EAAKm+D,EAAUxxD,GACxB,CACF,CAWA,SAASyxD,GAAe/lC,EAAOgmC,GAM7B,IALA,IAAI57D,GAAS,EACTzhB,EAASq3C,EAAMr3C,OACfy6E,EAAW,EACX31E,EAAS,KAEJ2c,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACdhV,IAAU4wE,GAAe5wE,IAAU0kE,IACrC95B,EAAM51B,GAAS0vD,EACfrsE,EAAO21E,KAAch5D,EAEzB,CACA,OAAO3c,CACT,CASA,SAASw4E,GAAWrkE,GAClB,IAAIwI,GAAS,EACT3c,EAASsJ,MAAM6K,EAAI8f,MAKvB,OAHA9f,EAAIjP,SAAQ,SAASyC,GACnB3H,IAAS2c,GAAShV,CACpB,IACO3H,CACT,CASA,SAASy4E,GAAWtkE,GAClB,IAAIwI,GAAS,EACT3c,EAASsJ,MAAM6K,EAAI8f,MAKvB,OAHA9f,EAAIjP,SAAQ,SAASyC,GACnB3H,IAAS2c,GAAS,CAAChV,EAAOA,EAC5B,IACO3H,CACT,CAmDA,SAAS04E,GAAWrB,GAClB,OAAOa,GAAWb,GAiDpB,SAAqBA,GACnB,IAAIr3E,EAAS8yE,GAAU6F,UAAY,EACnC,KAAO7F,GAAU5kE,KAAKmpE,MAClBr3E,EAEJ,OAAOA,CACT,CAtDM44E,CAAYvB,GACZhB,GAAUgB,EAChB,CASA,SAASwB,GAAcxB,GACrB,OAAOa,GAAWb,GAmDpB,SAAwBA,GACtB,OAAOA,EAAO1qE,MAAMmmE,KAAc,EACpC,CApDMgG,CAAezB,GA7kBrB,SAAsBA,GACpB,OAAOA,EAAO57E,MAAM,GACtB,CA4kBMs9E,CAAa1B,EACnB,CAUA,SAASC,GAAgBD,GAGvB,IAFA,IAAI16D,EAAQ06D,EAAOn8E,OAEZyhB,KAAWgzD,GAAazhE,KAAKmpE,EAAOz7E,OAAO+gB,MAClD,OAAOA,CACT,CASA,IAAIq8D,GAAmB/B,GA38BH,CAClB,QAAS,IACT,OAAQ,IACR,OAAQ,IACR,SAAU,IACV,QAAS,MA4gCX,IAs3eI/3E,GAt3egB,SAAS+5E,EAAax7C,GAIxC,IAAIn0B,GAHJm0B,EAAqB,MAAXA,EAAkBoS,GAAO3wC,GAAEg6E,SAASrpC,GAAKrwC,SAAUi+B,EAASv+B,GAAEi6E,KAAKtpC,GAAMqjC,MAG/D5pE,MAChBpN,EAAOuhC,EAAQvhC,KACfkM,GAAQq1B,EAAQr1B,MAChBurE,GAAWl2C,EAAQk2C,SACnB5qD,GAAO0U,EAAQ1U,KACfvpB,GAASi+B,EAAQj+B,OACjBoqB,GAAS6T,EAAQ7T,OACjBlf,GAAS+yB,EAAQ/yB,OACjByN,GAAYslB,EAAQtlB,UAGpBihE,GAAa9vE,EAAMmF,UACnB4qE,GAAY1F,GAASllE,UACrB6qE,GAAc95E,GAAOiP,UAGrB8qE,GAAa97C,EAAQ,sBAGrB+7C,GAAeH,GAAUzzD,SAGzB3Z,GAAiBqtE,GAAYrtE,eAG7BwtE,GAAY,EAGZC,GAAc,WAChB,IAAI1Y,EAAM,SAAS2Y,KAAKJ,IAAcA,GAAW95E,MAAQ85E,GAAW95E,KAAKm6E,UAAY,IACrF,OAAO5Y,EAAO,iBAAmBA,EAAO,EAC1C,CAHkB,GAUd6Y,GAAuBP,GAAY1zD,SAGnCk0D,GAAmBN,GAAa1pE,KAAKtQ,IAGrCu6E,GAAUlqC,GAAK3wC,EAGf86E,GAAapwD,GAAO,IACtB4vD,GAAa1pE,KAAK7D,IAAgBT,QAAQgkE,GAAc,QACvDhkE,QAAQ,yDAA0D,SAAW,KAI5EyuE,GAAShG,GAAgBx2C,EAAQw8C,OAAS9+E,EAC1C+wE,GAASzuC,EAAQyuC,OACjBgO,GAAaz8C,EAAQy8C,WACrBC,GAAcF,GAASA,GAAOE,YAAch/E,EAC5Ci/E,GAAehC,GAAQ54E,GAAO66E,eAAgB76E,IAC9C86E,GAAe96E,GAAOoP,OACtB2rE,GAAuBjB,GAAYiB,qBACnCx8C,GAASq7C,GAAWr7C,OACpBy8C,GAAmBtO,GAASA,GAAOuO,mBAAqBt/E,EACxDu/E,GAAcxO,GAASA,GAAOh5B,SAAW/3C,EACzCw/E,GAAiBzO,GAASA,GAAO0O,YAAcz/E,EAE/C0/E,GAAkB,WACpB,IACE,IAAI3gE,EAAO4gE,GAAUt7E,GAAQ,kBAE7B,OADA0a,EAAK,CAAC,EAAG,GAAI,CAAC,GACPA,CACT,CAAE,MAAOxO,GAAI,CACf,CANsB,GASlBqvE,GAAkBt9C,EAAQ5M,eAAiBgf,GAAKhf,cAAgB4M,EAAQ5M,aACxEmqD,GAAS9+E,GAAQA,EAAKub,MAAQo4B,GAAK3zC,KAAKub,KAAOvb,EAAKub,IACpDwjE,GAAgBx9C,EAAQ36B,aAAe+sC,GAAK/sC,YAAc26B,EAAQ36B,WAGlEo4E,GAAanyD,GAAKoyD,KAClBC,GAAcryD,GAAKI,MACnBkyD,GAAmB77E,GAAO87E,sBAC1BC,GAAiBtB,GAASA,GAAOuB,SAAWrgF,EAC5CsgF,GAAiBh+C,EAAQi+C,SACzBC,GAAavC,GAAWhvE,KACxBwxE,GAAaxD,GAAQ54E,GAAOC,KAAMD,IAClCq8E,GAAY9yD,GAAKsX,IACjBy7C,GAAY/yD,GAAKG,IACjB6yD,GAAY7/E,EAAKub,IACjBukE,GAAiBv+C,EAAQx3B,SACzBg2E,GAAelzD,GAAKmI,OACpBgrD,GAAgB9C,GAAW7vD,QAG3B4yD,GAAWrB,GAAUr9C,EAAS,YAC9B/pB,GAAMonE,GAAUr9C,EAAS,OACzB7vB,GAAUktE,GAAUr9C,EAAS,WAC7B1nB,GAAM+kE,GAAUr9C,EAAS,OACzBnkB,GAAUwhE,GAAUr9C,EAAS,WAC7B2+C,GAAetB,GAAUt7E,GAAQ,UAGjC68E,GAAU/iE,IAAW,IAAIA,GAGzBgjE,GAAY,CAAC,EAGbC,GAAqBC,GAASL,IAC9BM,GAAgBD,GAAS9oE,IACzBgpE,GAAoBF,GAAS5uE,IAC7B+uE,GAAgBH,GAASzmE,IACzB6mE,GAAoBJ,GAASljE,IAG7BujE,GAAc3Q,GAASA,GAAOz9D,UAAYtT,EAC1C2hF,GAAgBD,GAAcA,GAAYx5D,QAAUloB,EACpD4hF,GAAiBF,GAAcA,GAAYj3D,SAAWzqB,EAyH1D,SAAS6hF,GAAOr1E,GACd,GAAIs1E,GAAat1E,KAAW4B,GAAQ5B,MAAYA,aAAiBu1E,IAAc,CAC7E,GAAIv1E,aAAiBw1E,GACnB,OAAOx1E,EAET,GAAIsE,GAAe6D,KAAKnI,EAAO,eAC7B,OAAOy1E,GAAaz1E,EAExB,CACA,OAAO,IAAIw1E,GAAcx1E,EAC3B,CAUA,IAAI01E,GAAc,WAChB,SAAS/hE,IAAU,CACnB,OAAO,SAASgiE,GACd,IAAK3sE,GAAS2sE,GACZ,MAAO,CAAC,EAEV,GAAIhD,GACF,OAAOA,GAAagD,GAEtBhiE,EAAO7M,UAAY6uE,EACnB,IAAIt9E,EAAS,IAAIsb,EAEjB,OADAA,EAAO7M,UAAYtT,EACZ6E,CACT,CACF,CAdkB,GAqBlB,SAASu9E,KACP,CAUF,SAASJ,GAAcx1E,EAAO61E,GAC5Bx0E,KAAKy0E,YAAc91E,EACnBqB,KAAK00E,YAAc,GACnB10E,KAAK20E,YAAcH,EACnBx0E,KAAK40E,UAAY,EACjB50E,KAAK60E,WAAa1iF,CACpB,CA+EA,SAAS+hF,GAAYv1E,GACnBqB,KAAKy0E,YAAc91E,EACnBqB,KAAK00E,YAAc,GACnB10E,KAAK80E,QAAU,EACf90E,KAAK+0E,cAAe,EACpB/0E,KAAKg1E,cAAgB,GACrBh1E,KAAKi1E,cAAgBnR,EACrB9jE,KAAKk1E,UAAY,EACnB,CA+GA,SAASC,GAAKnpE,GACZ,IAAI2H,GAAS,EACTzhB,EAAoB,MAAX8Z,EAAkB,EAAIA,EAAQ9Z,OAG3C,IADA8N,KAAKyyC,UACI9+B,EAAQzhB,GAAQ,CACvB,IAAIkjF,EAAQppE,EAAQ2H,GACpB3T,KAAKmL,IAAIiqE,EAAM,GAAIA,EAAM,GAC3B,CACF,CA+FA,SAASC,GAAUrpE,GACjB,IAAI2H,GAAS,EACTzhB,EAAoB,MAAX8Z,EAAkB,EAAIA,EAAQ9Z,OAG3C,IADA8N,KAAKyyC,UACI9+B,EAAQzhB,GAAQ,CACvB,IAAIkjF,EAAQppE,EAAQ2H,GACpB3T,KAAKmL,IAAIiqE,EAAM,GAAIA,EAAM,GAC3B,CACF,CA4GA,SAASE,GAAStpE,GAChB,IAAI2H,GAAS,EACTzhB,EAAoB,MAAX8Z,EAAkB,EAAIA,EAAQ9Z,OAG3C,IADA8N,KAAKyyC,UACI9+B,EAAQzhB,GAAQ,CACvB,IAAIkjF,EAAQppE,EAAQ2H,GACpB3T,KAAKmL,IAAIiqE,EAAM,GAAIA,EAAM,GAC3B,CACF,CA+FA,SAASG,GAASlpE,GAChB,IAAIsH,GAAS,EACTzhB,EAAmB,MAAVma,EAAiB,EAAIA,EAAOna,OAGzC,IADA8N,KAAKw1E,SAAW,IAAIF,KACX3hE,EAAQzhB,GACf8N,KAAKgN,IAAIX,EAAOsH,GAEpB,CA2CA,SAAS8hE,GAAMzpE,GACb,IAAI9F,EAAOlG,KAAKw1E,SAAW,IAAIH,GAAUrpE,GACzChM,KAAKirB,KAAO/kB,EAAK+kB,IACnB,CAoGA,SAASyqD,GAAc/2E,EAAOg3E,GAC5B,IAAIC,EAAQr1E,GAAQ5B,GAChBk3E,GAASD,GAASE,GAAYn3E,GAC9Bo3E,GAAUH,IAAUC,GAASrD,GAAS7zE,GACtCq3E,GAAUJ,IAAUC,IAAUE,GAAU7J,GAAavtE,GACrDs3E,EAAcL,GAASC,GAASE,GAAUC,EAC1Ch/E,EAASi/E,EAAc9H,GAAUxvE,EAAMzM,OAAQwP,IAAU,GACzDxP,EAAS8E,EAAO9E,OAEpB,IAAK,IAAIiF,KAAOwH,GACTg3E,IAAa1yE,GAAe6D,KAAKnI,EAAOxH,IACvC8+E,IAEQ,UAAP9+E,GAEC4+E,IAAkB,UAAP5+E,GAA0B,UAAPA,IAE9B6+E,IAAkB,UAAP7+E,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD++E,GAAQ/+E,EAAKjF,KAElB8E,EAAOH,KAAKM,GAGhB,OAAOH,CACT,CASA,SAASm/E,GAAY5sC,GACnB,IAAIr3C,EAASq3C,EAAMr3C,OACnB,OAAOA,EAASq3C,EAAM6sC,GAAW,EAAGlkF,EAAS,IAAMC,CACrD,CAUA,SAASkkF,GAAgB9sC,EAAOzgC,GAC9B,OAAOwtE,GAAYC,GAAUhtC,GAAQitC,GAAU1tE,EAAG,EAAGygC,EAAMr3C,QAC7D,CASA,SAASukF,GAAaltC,GACpB,OAAO+sC,GAAYC,GAAUhtC,GAC/B,CAWA,SAASmtC,GAAiBpkE,EAAQnb,EAAKwH,IAChCA,IAAUxM,IAAcwkF,GAAGrkE,EAAOnb,GAAMwH,IACxCA,IAAUxM,KAAegF,KAAOmb,KACnCskE,GAAgBtkE,EAAQnb,EAAKwH,EAEjC,CAYA,SAASk4E,GAAYvkE,EAAQnb,EAAKwH,GAChC,IAAIm4E,EAAWxkE,EAAOnb,GAChB8L,GAAe6D,KAAKwL,EAAQnb,IAAQw/E,GAAGG,EAAUn4E,KAClDA,IAAUxM,GAAegF,KAAOmb,IACnCskE,GAAgBtkE,EAAQnb,EAAKwH,EAEjC,CAUA,SAASo4E,GAAaxtC,EAAOpyC,GAE3B,IADA,IAAIjF,EAASq3C,EAAMr3C,OACZA,KACL,GAAIykF,GAAGptC,EAAMr3C,GAAQ,GAAIiF,GACvB,OAAOjF,EAGX,OAAQ,CACV,CAaA,SAAS8kF,GAAe5jC,EAAYi5B,EAAQC,EAAUnuB,GAIpD,OAHA84B,GAAS7jC,GAAY,SAASz0C,EAAOxH,EAAKi8C,GACxCi5B,EAAOluB,EAAax/C,EAAO2tE,EAAS3tE,GAAQy0C,EAC9C,IACO+K,CACT,CAWA,SAAS+4B,GAAW5kE,EAAQvP,GAC1B,OAAOuP,GAAU6kE,GAAWp0E,EAAQtM,GAAKsM,GAASuP,EACpD,CAwBA,SAASskE,GAAgBtkE,EAAQnb,EAAKwH,GACzB,aAAPxH,GAAsB06E,GACxBA,GAAev/D,EAAQnb,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASwH,EACT,UAAY,IAGd2T,EAAOnb,GAAOwH,CAElB,CAUA,SAASy4E,GAAO9kE,EAAQqwD,GAMtB,IALA,IAAIhvD,GAAS,EACTzhB,EAASywE,EAAMzwE,OACf8E,EAASsJ,EAAMpO,GACfmlF,EAAiB,MAAV/kE,IAEFqB,EAAQzhB,GACf8E,EAAO2c,GAAS0jE,EAAOllF,EAAY+B,GAAIoe,EAAQqwD,EAAMhvD,IAEvD,OAAO3c,CACT,CAWA,SAASw/E,GAAUjgF,EAAQ+gF,EAAOC,GAShC,OARIhhF,IAAWA,IACTghF,IAAUplF,IACZoE,EAASA,GAAUghF,EAAQhhF,EAASghF,GAElCD,IAAUnlF,IACZoE,EAASA,GAAU+gF,EAAQ/gF,EAAS+gF,IAGjC/gF,CACT,CAkBA,SAASihF,GAAU74E,EAAO84E,EAASC,EAAYvgF,EAAKmb,EAAQyO,GAC1D,IAAI/pB,EACA2gF,EArkFc,EAqkFLF,EACTG,EArkFc,EAqkFLH,EACTI,EArkFiB,EAqkFRJ,EAKb,GAHIC,IACF1gF,EAASsb,EAASolE,EAAW/4E,EAAOxH,EAAKmb,EAAQyO,GAAS22D,EAAW/4E,IAEnE3H,IAAW7E,EACb,OAAO6E,EAET,IAAK2Q,GAAShJ,GACZ,OAAOA,EAET,IAAIi3E,EAAQr1E,GAAQ5B,GACpB,GAAIi3E,GAEF,GADA5+E,EA68GJ,SAAwBuyC,GACtB,IAAIr3C,EAASq3C,EAAMr3C,OACf8E,EAAS,IAAIuyC,EAAMnnC,YAAYlQ,GAG/BA,GAA6B,iBAAZq3C,EAAM,IAAkBtmC,GAAe6D,KAAKyiC,EAAO,WACtEvyC,EAAO2c,MAAQ41B,EAAM51B,MACrB3c,EAAOoJ,MAAQmpC,EAAMnpC,OAEvB,OAAOpJ,CACT,CAv9Ga8gF,CAAen5E,IACnBg5E,EACH,OAAOpB,GAAU53E,EAAO3H,OAErB,CACL,IAAIxC,EAAMujF,GAAOp5E,GACbq5E,EAASxjF,GAAO6vE,GAAW7vE,GAAO8vE,EAEtC,GAAIkO,GAAS7zE,GACX,OAAOs5E,GAAYt5E,EAAOg5E,GAE5B,GAAInjF,GAAOiwE,GAAajwE,GAAOwvE,GAAYgU,IAAW1lE,GAEpD,GADAtb,EAAU4gF,GAAUI,EAAU,CAAC,EAAIE,GAAgBv5E,IAC9Cg5E,EACH,OAAOC,EA+nEf,SAAuB70E,EAAQuP,GAC7B,OAAO6kE,GAAWp0E,EAAQo1E,GAAap1E,GAASuP,EAClD,CAhoEY8lE,CAAcz5E,EAnH1B,SAAsB2T,EAAQvP,GAC5B,OAAOuP,GAAU6kE,GAAWp0E,EAAQs1E,GAAOt1E,GAASuP,EACtD,CAiHiCgmE,CAAathF,EAAQ2H,IAknEtD,SAAqBoE,EAAQuP,GAC3B,OAAO6kE,GAAWp0E,EAAQw1E,GAAWx1E,GAASuP,EAChD,CAnnEYkmE,CAAY75E,EAAOu4E,GAAWlgF,EAAQ2H,QAEvC,CACL,IAAK0rE,GAAc71E,GACjB,OAAO8d,EAAS3T,EAAQ,CAAC,EAE3B3H,EA49GN,SAAwBsb,EAAQ9d,EAAKmjF,GACnC,IAAIc,EAAOnmE,EAAOlQ,YAClB,OAAQ5N,GACN,KAAKwwE,EACH,OAAO0T,GAAiBpmE,GAE1B,KAAK4xD,EACL,KAAKC,EACH,OAAO,IAAIsU,GAAMnmE,GAEnB,KAAK2yD,EACH,OA5nDN,SAAuB0T,EAAUhB,GAC/B,IAAIiB,EAASjB,EAASe,GAAiBC,EAASC,QAAUD,EAASC,OACnE,OAAO,IAAID,EAASv2E,YAAYw2E,EAAQD,EAASE,WAAYF,EAASG,WACxE,CAynDaC,CAAczmE,EAAQqlE,GAE/B,KAAKzS,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,KAAKC,EAAiB,KAAKC,EAAW,KAAKC,EACxD,OAAOsT,GAAgB1mE,EAAQqlE,GAEjC,KAAKpT,EACH,OAAO,IAAIkU,EAEb,KAAKjU,EACL,KAAKK,EACH,OAAO,IAAI4T,EAAKnmE,GAElB,KAAKqyD,EACH,OA/nDN,SAAqBsU,GACnB,IAAIjiF,EAAS,IAAIiiF,EAAO72E,YAAY62E,EAAOl2E,OAAQokE,GAAQwJ,KAAKsI,IAEhE,OADAjiF,EAAO24E,UAAYsJ,EAAOtJ,UACnB34E,CACT,CA2nDakiF,CAAY5mE,GAErB,KAAKsyD,EACH,OAAO,IAAI6T,EAEb,KAAK3T,EACH,OAxnDeqU,EAwnDI7mE,EAvnDhBwhE,GAAgBt9E,GAAOs9E,GAAchtE,KAAKqyE,IAAW,CAAC,EAD/D,IAAqBA,CA0nDrB,CA9/GeC,CAAez6E,EAAOnK,EAAKmjF,EACtC,CACF,CAEA52D,IAAUA,EAAQ,IAAI00D,IACtB,IAAI4D,EAAUt4D,EAAM7sB,IAAIyK,GACxB,GAAI06E,EACF,OAAOA,EAETt4D,EAAM5V,IAAIxM,EAAO3H,GAEbg1E,GAAMrtE,GACRA,EAAMzC,SAAQ,SAASo9E,GACrBtiF,EAAOgW,IAAIwqE,GAAU8B,EAAU7B,EAASC,EAAY4B,EAAU36E,EAAOoiB,GACvE,IACS6qD,GAAMjtE,IACfA,EAAMzC,SAAQ,SAASo9E,EAAUniF,GAC/BH,EAAOmU,IAAIhU,EAAKqgF,GAAU8B,EAAU7B,EAASC,EAAYvgF,EAAKwH,EAAOoiB,GACvE,IAGF,IAII5W,EAAQyrE,EAAQzjF,GAJL0lF,EACVD,EAAS2B,GAAeC,GACxB5B,EAASS,GAAS5hF,IAEkBkI,GASzC,OARA4tE,GAAUpiE,GAASxL,GAAO,SAAS26E,EAAUniF,GACvCgT,IAEFmvE,EAAW36E,EADXxH,EAAMmiF,IAIRzC,GAAY7/E,EAAQG,EAAKqgF,GAAU8B,EAAU7B,EAASC,EAAYvgF,EAAKwH,EAAOoiB,GAChF,IACO/pB,CACT,CAwBA,SAASyiF,GAAennE,EAAQvP,EAAQoH,GACtC,IAAIjY,EAASiY,EAAMjY,OACnB,GAAc,MAAVogB,EACF,OAAQpgB,EAGV,IADAogB,EAAS9b,GAAO8b,GACTpgB,KAAU,CACf,IAAIiF,EAAMgT,EAAMjY,GACZolD,EAAYv0C,EAAO5L,GACnBwH,EAAQ2T,EAAOnb,GAEnB,GAAKwH,IAAUxM,KAAegF,KAAOmb,KAAaglC,EAAU34C,GAC1D,OAAO,CAEX,CACA,OAAO,CACT,CAYA,SAAS+6E,GAAUxoE,EAAMyoE,EAAM/qE,GAC7B,GAAmB,mBAARsC,EACT,MAAM,IAAI/B,GAAUg0D,GAEtB,OAAOrpE,IAAW,WAAaoX,EAAKO,MAAMtf,EAAWyc,EAAO,GAAG+qE,EACjE,CAaA,SAASC,GAAerwC,EAAOl9B,EAAQigE,EAAUrsC,GAC/C,IAAItsB,GAAS,EACTnM,EAAWolE,GACXiN,GAAW,EACX3nF,EAASq3C,EAAMr3C,OACf8E,EAAS,GACT8iF,EAAeztE,EAAOna,OAE1B,IAAKA,EACH,OAAO8E,EAELs1E,IACFjgE,EAAS0gE,GAAS1gE,EAAQkiE,GAAUjC,KAElCrsC,GACFz4B,EAAWslE,GACX+M,GAAW,GAEJxtE,EAAOna,QAtvFG,MAuvFjBsV,EAAWinE,GACXoL,GAAW,EACXxtE,EAAS,IAAIkpE,GAASlpE,IAExBuqB,EACA,OAASjjB,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACdomE,EAAuB,MAAZzN,EAAmB3tE,EAAQ2tE,EAAS3tE,GAGnD,GADAA,EAASshC,GAAwB,IAAVthC,EAAeA,EAAQ,EAC1Ck7E,GAAYE,IAAaA,EAAU,CAErC,IADA,IAAIC,EAAcF,EACXE,KACL,GAAI3tE,EAAO2tE,KAAiBD,EAC1B,SAASnjD,EAGb5/B,EAAOH,KAAK8H,EACd,MACU6I,EAAS6E,EAAQ0tE,EAAU95C,IACnCjpC,EAAOH,KAAK8H,EAEhB,CACA,OAAO3H,CACT,CAlkCAg9E,GAAOiG,iBAAmB,CAQxB,OAAU/T,EAQV,SAAYC,EAQZ,YAAeC,GAQf,SAAY,GAQZ,QAAW,CAQT,EAAK4N,KAKTA,GAAOvuE,UAAY8uE,GAAW9uE,UAC9BuuE,GAAOvuE,UAAUrD,YAAc4xE,GAE/BG,GAAc1uE,UAAY4uE,GAAWE,GAAW9uE,WAChD0uE,GAAc1uE,UAAUrD,YAAc+xE,GAsHtCD,GAAYzuE,UAAY4uE,GAAWE,GAAW9uE,WAC9CyuE,GAAYzuE,UAAUrD,YAAc8xE,GAoGpCiB,GAAK1vE,UAAUgtC,MAvEf,WACEzyC,KAAKw1E,SAAWpC,GAAeA,GAAa,MAAQ,CAAC,EACrDpzE,KAAKirB,KAAO,CACd,EAqEAkqD,GAAK1vE,UAAkB,OAzDvB,SAAoBtO,GAClB,IAAIH,EAASgJ,KAAKiL,IAAI9T,WAAe6I,KAAKw1E,SAASr+E,GAEnD,OADA6I,KAAKirB,MAAQj0B,EAAS,EAAI,EACnBA,CACT,EAsDAm+E,GAAK1vE,UAAUvR,IA3Cf,SAAiBiD,GACf,IAAI+O,EAAOlG,KAAKw1E,SAChB,GAAIpC,GAAc,CAChB,IAAIp8E,EAASkP,EAAK/O,GAClB,OAAOH,IAAWosE,EAAiBjxE,EAAY6E,CACjD,CACA,OAAOiM,GAAe6D,KAAKZ,EAAM/O,GAAO+O,EAAK/O,GAAOhF,CACtD,EAqCAgjF,GAAK1vE,UAAUwF,IA1Bf,SAAiB9T,GACf,IAAI+O,EAAOlG,KAAKw1E,SAChB,OAAOpC,GAAgBltE,EAAK/O,KAAShF,EAAa8Q,GAAe6D,KAAKZ,EAAM/O,EAC9E,EAwBAg+E,GAAK1vE,UAAU0F,IAZf,SAAiBhU,EAAKwH,GACpB,IAAIuH,EAAOlG,KAAKw1E,SAGhB,OAFAx1E,KAAKirB,MAAQjrB,KAAKiL,IAAI9T,GAAO,EAAI,EACjC+O,EAAK/O,GAAQi8E,IAAgBz0E,IAAUxM,EAAaixE,EAAiBzkE,EAC9DqB,IACT,EAwHAq1E,GAAU5vE,UAAUgtC,MApFpB,WACEzyC,KAAKw1E,SAAW,GAChBx1E,KAAKirB,KAAO,CACd,EAkFAoqD,GAAU5vE,UAAkB,OAvE5B,SAAyBtO,GACvB,IAAI+O,EAAOlG,KAAKw1E,SACZ7hE,EAAQojE,GAAa7wE,EAAM/O,GAE/B,QAAIwc,EAAQ,KAIRA,GADYzN,EAAKhU,OAAS,EAE5BgU,EAAK+U,MAEL8Z,GAAOjuB,KAAKZ,EAAMyN,EAAO,KAEzB3T,KAAKirB,MACA,EACT,EAyDAoqD,GAAU5vE,UAAUvR,IA9CpB,SAAsBiD,GACpB,IAAI+O,EAAOlG,KAAKw1E,SACZ7hE,EAAQojE,GAAa7wE,EAAM/O,GAE/B,OAAOwc,EAAQ,EAAIxhB,EAAY+T,EAAKyN,GAAO,EAC7C,EA0CA0hE,GAAU5vE,UAAUwF,IA/BpB,SAAsB9T,GACpB,OAAO4/E,GAAa/2E,KAAKw1E,SAAUr+E,IAAQ,CAC7C,EA8BAk+E,GAAU5vE,UAAU0F,IAlBpB,SAAsBhU,EAAKwH,GACzB,IAAIuH,EAAOlG,KAAKw1E,SACZ7hE,EAAQojE,GAAa7wE,EAAM/O,GAQ/B,OANIwc,EAAQ,KACR3T,KAAKirB,KACP/kB,EAAKrP,KAAK,CAACM,EAAKwH,KAEhBuH,EAAKyN,GAAO,GAAKhV,EAEZqB,IACT,EA0GAs1E,GAAS7vE,UAAUgtC,MAtEnB,WACEzyC,KAAKirB,KAAO,EACZjrB,KAAKw1E,SAAW,CACd,KAAQ,IAAIL,GACZ,IAAO,IAAKzqE,IAAO2qE,IACnB,OAAU,IAAIF,GAElB,EAgEAG,GAAS7vE,UAAkB,OArD3B,SAAwBtO,GACtB,IAAIH,EAASkjF,GAAWl6E,KAAM7I,GAAa,OAAEA,GAE7C,OADA6I,KAAKirB,MAAQj0B,EAAS,EAAI,EACnBA,CACT,EAkDAs+E,GAAS7vE,UAAUvR,IAvCnB,SAAqBiD,GACnB,OAAO+iF,GAAWl6E,KAAM7I,GAAKjD,IAAIiD,EACnC,EAsCAm+E,GAAS7vE,UAAUwF,IA3BnB,SAAqB9T,GACnB,OAAO+iF,GAAWl6E,KAAM7I,GAAK8T,IAAI9T,EACnC,EA0BAm+E,GAAS7vE,UAAU0F,IAdnB,SAAqBhU,EAAKwH,GACxB,IAAIuH,EAAOg0E,GAAWl6E,KAAM7I,GACxB8zB,EAAO/kB,EAAK+kB,KAIhB,OAFA/kB,EAAKiF,IAAIhU,EAAKwH,GACdqB,KAAKirB,MAAQ/kB,EAAK+kB,MAAQA,EAAO,EAAI,EAC9BjrB,IACT,EA0DAu1E,GAAS9vE,UAAUuH,IAAMuoE,GAAS9vE,UAAU5O,KAnB5C,SAAqB8H,GAEnB,OADAqB,KAAKw1E,SAASrqE,IAAIxM,EAAOykE,GAClBpjE,IACT,EAiBAu1E,GAAS9vE,UAAUwF,IANnB,SAAqBtM,GACnB,OAAOqB,KAAKw1E,SAASvqE,IAAItM,EAC3B,EAsGA82E,GAAMhwE,UAAUgtC,MA3EhB,WACEzyC,KAAKw1E,SAAW,IAAIH,GACpBr1E,KAAKirB,KAAO,CACd,EAyEAwqD,GAAMhwE,UAAkB,OA9DxB,SAAqBtO,GACnB,IAAI+O,EAAOlG,KAAKw1E,SACZx+E,EAASkP,EAAa,OAAE/O,GAG5B,OADA6I,KAAKirB,KAAO/kB,EAAK+kB,KACVj0B,CACT,EAyDAy+E,GAAMhwE,UAAUvR,IA9ChB,SAAkBiD,GAChB,OAAO6I,KAAKw1E,SAASthF,IAAIiD,EAC3B,EA6CAs+E,GAAMhwE,UAAUwF,IAlChB,SAAkB9T,GAChB,OAAO6I,KAAKw1E,SAASvqE,IAAI9T,EAC3B,EAiCAs+E,GAAMhwE,UAAU0F,IArBhB,SAAkBhU,EAAKwH,GACrB,IAAIuH,EAAOlG,KAAKw1E,SAChB,GAAItvE,aAAgBmvE,GAAW,CAC7B,IAAIhxD,EAAQne,EAAKsvE,SACjB,IAAK9qE,IAAQ2Z,EAAMnyB,OAASioF,IAG1B,OAFA91D,EAAMxtB,KAAK,CAACM,EAAKwH,IACjBqB,KAAKirB,OAAS/kB,EAAK+kB,KACZjrB,KAETkG,EAAOlG,KAAKw1E,SAAW,IAAIF,GAASjxD,EACtC,CAGA,OAFAne,EAAKiF,IAAIhU,EAAKwH,GACdqB,KAAKirB,KAAO/kB,EAAK+kB,KACVjrB,IACT,EAqcA,IAAIi3E,GAAWmD,GAAeC,IAU1BC,GAAgBF,GAAeG,IAAiB,GAWpD,SAASC,GAAUpnC,EAAYkE,GAC7B,IAAItgD,GAAS,EAKb,OAJAigF,GAAS7jC,GAAY,SAASz0C,EAAOgV,EAAOy/B,GAE1C,OADAp8C,IAAWsgD,EAAU34C,EAAOgV,EAAOy/B,EAErC,IACOp8C,CACT,CAYA,SAASyjF,GAAalxC,EAAO+iC,EAAUrsC,GAIrC,IAHA,IAAItsB,GAAS,EACTzhB,EAASq3C,EAAMr3C,SAEVyhB,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACdxX,EAAUmwE,EAAS3tE,GAEvB,GAAe,MAAXxC,IAAoB49E,IAAa5nF,EAC5BgK,IAAYA,IAAYu+E,GAASv+E,GAClC8jC,EAAW9jC,EAAS49E,IAE1B,IAAIA,EAAW59E,EACXnF,EAAS2H,CAEjB,CACA,OAAO3H,CACT,CAsCA,SAAS2jF,GAAWvnC,EAAYkE,GAC9B,IAAItgD,EAAS,GAMb,OALAigF,GAAS7jC,GAAY,SAASz0C,EAAOgV,EAAOy/B,GACtCkE,EAAU34C,EAAOgV,EAAOy/B,IAC1Bp8C,EAAOH,KAAK8H,EAEhB,IACO3H,CACT,CAaA,SAAS4jF,GAAYrxC,EAAOsxC,EAAOvjC,EAAWwjC,EAAU9jF,GACtD,IAAI2c,GAAS,EACTzhB,EAASq3C,EAAMr3C,OAKnB,IAHAolD,IAAcA,EAAYyjC,IAC1B/jF,IAAWA,EAAS,MAEX2c,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACdknE,EAAQ,GAAKvjC,EAAU34C,GACrBk8E,EAAQ,EAEVD,GAAYj8E,EAAOk8E,EAAQ,EAAGvjC,EAAWwjC,EAAU9jF,GAEnDg2E,GAAUh2E,EAAQ2H,GAEVm8E,IACV9jF,EAAOA,EAAO9E,QAAUyM,EAE5B,CACA,OAAO3H,CACT,CAaA,IAAIgkF,GAAUC,KAYVC,GAAeD,IAAc,GAUjC,SAASZ,GAAW/nE,EAAQg6D,GAC1B,OAAOh6D,GAAU0oE,GAAQ1oE,EAAQg6D,EAAU71E,GAC7C,CAUA,SAAS8jF,GAAgBjoE,EAAQg6D,GAC/B,OAAOh6D,GAAU4oE,GAAa5oE,EAAQg6D,EAAU71E,GAClD,CAWA,SAAS0kF,GAAc7oE,EAAQnI,GAC7B,OAAOuiE,GAAYviE,GAAO,SAAShT,GACjC,OAAOikF,GAAW9oE,EAAOnb,GAC3B,GACF,CAUA,SAASkkF,GAAQ/oE,EAAQujB,GAMvB,IAHA,IAAIliB,EAAQ,EACRzhB,GAHJ2jC,EAAOylD,GAASzlD,EAAMvjB,IAGJpgB,OAED,MAAVogB,GAAkBqB,EAAQzhB,GAC/BogB,EAASA,EAAOipE,GAAM1lD,EAAKliB,OAE7B,OAAQA,GAASA,GAASzhB,EAAUogB,EAASngB,CAC/C,CAaA,SAASqpF,GAAelpE,EAAQmpE,EAAUC,GACxC,IAAI1kF,EAASykF,EAASnpE,GACtB,OAAO/R,GAAQ+R,GAAUtb,EAASg2E,GAAUh2E,EAAQ0kF,EAAYppE,GAClE,CASA,SAASqpE,GAAWh9E,GAClB,OAAa,MAATA,EACKA,IAAUxM,EAn7FJ,qBARL,gBA67FFw/E,IAAkBA,MAAkBn7E,GAAOmI,GA23FrD,SAAmBA,GACjB,IAAIi9E,EAAQ34E,GAAe6D,KAAKnI,EAAOgzE,IACnCn9E,EAAMmK,EAAMgzE,IAEhB,IACEhzE,EAAMgzE,IAAkBx/E,EACxB,IAAI0pF,GAAW,CACjB,CAAE,MAAOn5E,GAAI,CAEb,IAAI1L,EAAS65E,GAAqB/pE,KAAKnI,GACnCk9E,IACED,EACFj9E,EAAMgzE,IAAkBn9E,SAEjBmK,EAAMgzE,KAGjB,OAAO36E,CACT,CA54FM8kF,CAAUn9E,GA+5GhB,SAAwBA,GACtB,OAAOkyE,GAAqB/pE,KAAKnI,EACnC,CAh6GMo9E,CAAep9E,EACrB,CAWA,SAASq9E,GAAOr9E,EAAOo4B,GACrB,OAAOp4B,EAAQo4B,CACjB,CAUA,SAASklD,GAAQ3pE,EAAQnb,GACvB,OAAiB,MAAVmb,GAAkBrP,GAAe6D,KAAKwL,EAAQnb,EACvD,CAUA,SAAS+kF,GAAU5pE,EAAQnb,GACzB,OAAiB,MAAVmb,GAAkBnb,KAAOX,GAAO8b,EACzC,CAyBA,SAAS6pE,GAAiBC,EAAQ9P,EAAUrsC,GAS1C,IARA,IAAIz4B,EAAWy4B,EAAa6sC,GAAoBF,GAC5C16E,EAASkqF,EAAO,GAAGlqF,OACnBmqF,EAAYD,EAAOlqF,OACnBoqF,EAAWD,EACXE,EAASj8E,EAAM+7E,GACfG,EAAY18D,IACZ9oB,EAAS,GAENslF,KAAY,CACjB,IAAI/yC,EAAQ6yC,EAAOE,GACfA,GAAYhQ,IACd/iC,EAAQwjC,GAASxjC,EAAOglC,GAAUjC,KAEpCkQ,EAAY1J,GAAUvpC,EAAMr3C,OAAQsqF,GACpCD,EAAOD,IAAar8C,IAAeqsC,GAAap6E,GAAU,KAAOq3C,EAAMr3C,QAAU,KAC7E,IAAIqjF,GAAS+G,GAAY/yC,GACzBp3C,CACN,CACAo3C,EAAQ6yC,EAAO,GAEf,IAAIzoE,GAAS,EACT8oE,EAAOF,EAAO,GAElB3lD,EACA,OAASjjB,EAAQzhB,GAAU8E,EAAO9E,OAASsqF,GAAW,CACpD,IAAI79E,EAAQ4qC,EAAM51B,GACdomE,EAAWzN,EAAWA,EAAS3tE,GAASA,EAG5C,GADAA,EAASshC,GAAwB,IAAVthC,EAAeA,EAAQ,IACxC89E,EACEhO,GAASgO,EAAM1C,GACfvyE,EAASxQ,EAAQ+iF,EAAU95C,IAC5B,CAEL,IADAq8C,EAAWD,IACFC,GAAU,CACjB,IAAIh7B,EAAQi7B,EAAOD,GACnB,KAAMh7B,EACEmtB,GAASntB,EAAOy4B,GAChBvyE,EAAS40E,EAAOE,GAAWvC,EAAU95C,IAE3C,SAASrJ,CAEb,CACI6lD,GACFA,EAAK5lF,KAAKkjF,GAEZ/iF,EAAOH,KAAK8H,EACd,CACF,CACA,OAAO3H,CACT,CA8BA,SAAS0lF,GAAWpqE,EAAQujB,EAAMjnB,GAGhC,IAAIsC,EAAiB,OADrBoB,EAASw3C,GAAOx3C,EADhBujB,EAAOylD,GAASzlD,EAAMvjB,KAEMA,EAASA,EAAOipE,GAAM/vB,GAAK31B,KACvD,OAAe,MAAR3kB,EAAe/e,EAAYsf,GAAMP,EAAMoB,EAAQ1D,EACxD,CASA,SAAS+tE,GAAgBh+E,GACvB,OAAOs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAUqlE,CACrD,CAsCA,SAAS4Y,GAAYj+E,EAAOo4B,EAAO0gD,EAASC,EAAY32D,GACtD,OAAIpiB,IAAUo4B,IAGD,MAATp4B,GAA0B,MAATo4B,IAAmBk9C,GAAat1E,KAAWs1E,GAAal9C,GACpEp4B,IAAUA,GAASo4B,IAAUA,EAmBxC,SAAyBzkB,EAAQykB,EAAO0gD,EAASC,EAAYmF,EAAW97D,GACtE,IAAI+7D,EAAWv8E,GAAQ+R,GACnByqE,EAAWx8E,GAAQw2B,GACnBimD,EAASF,EAAW7Y,EAAW8T,GAAOzlE,GACtC2qE,EAASF,EAAW9Y,EAAW8T,GAAOhhD,GAKtCmmD,GAHJF,EAASA,GAAUhZ,EAAUS,EAAYuY,IAGhBvY,EACrB0Y,GAHJF,EAASA,GAAUjZ,EAAUS,EAAYwY,IAGhBxY,EACrB2Y,EAAYJ,GAAUC,EAE1B,GAAIG,GAAa5K,GAASlgE,GAAS,CACjC,IAAKkgE,GAASz7C,GACZ,OAAO,EAET+lD,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAEhB,OADAn8D,IAAUA,EAAQ,IAAI00D,IACdqH,GAAY5Q,GAAa55D,GAC7B+qE,GAAY/qE,EAAQykB,EAAO0gD,EAASC,EAAYmF,EAAW97D,GA81EnE,SAAoBzO,EAAQykB,EAAOviC,EAAKijF,EAASC,EAAYmF,EAAW97D,GACtE,OAAQvsB,GACN,KAAKywE,EACH,GAAK3yD,EAAOwmE,YAAc/hD,EAAM+hD,YAC3BxmE,EAAOumE,YAAc9hD,EAAM8hD,WAC9B,OAAO,EAETvmE,EAASA,EAAOsmE,OAChB7hD,EAAQA,EAAM6hD,OAEhB,KAAK5T,EACH,QAAK1yD,EAAOwmE,YAAc/hD,EAAM+hD,aAC3B+D,EAAU,IAAI3L,GAAW5+D,GAAS,IAAI4+D,GAAWn6C,KAKxD,KAAKmtC,EACL,KAAKC,EACL,KAAKK,EAGH,OAAOmS,IAAIrkE,GAASykB,GAEtB,KAAKqtC,EACH,OAAO9xD,EAAOlgB,MAAQ2kC,EAAM3kC,MAAQkgB,EAAOpT,SAAW63B,EAAM73B,QAE9D,KAAKylE,EACL,KAAKE,EAIH,OAAOvyD,GAAWykB,EAAQ,GAE5B,KAAKwtC,EACH,IAAI+Y,EAAUnO,GAEhB,KAAKvK,EACH,IAAI2Y,EAxnLe,EAwnLH9F,EAGhB,GAFA6F,IAAYA,EAAU9N,IAElBl9D,EAAO2Y,MAAQ8L,EAAM9L,OAASsyD,EAChC,OAAO,EAGT,IAAIlE,EAAUt4D,EAAM7sB,IAAIoe,GACxB,GAAI+mE,EACF,OAAOA,GAAWtiD,EAEpB0gD,GAloLqB,EAqoLrB12D,EAAM5V,IAAImH,EAAQykB,GAClB,IAAI//B,EAASqmF,GAAYC,EAAQhrE,GAASgrE,EAAQvmD,GAAQ0gD,EAASC,EAAYmF,EAAW97D,GAE1F,OADAA,EAAc,OAAEzO,GACTtb,EAET,KAAK8tE,EACH,GAAIgP,GACF,OAAOA,GAAchtE,KAAKwL,IAAWwhE,GAAchtE,KAAKiwB,GAG9D,OAAO,CACT,CA55EQymD,CAAWlrE,EAAQykB,EAAOimD,EAAQvF,EAASC,EAAYmF,EAAW97D,GAExE,KAvvGuB,EAuvGjB02D,GAAiC,CACrC,IAAIgG,EAAeP,GAAYj6E,GAAe6D,KAAKwL,EAAQ,eACvDorE,EAAeP,GAAYl6E,GAAe6D,KAAKiwB,EAAO,eAE1D,GAAI0mD,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAenrE,EAAO3T,QAAU2T,EAC/CsrE,EAAeF,EAAe3mD,EAAMp4B,QAAUo4B,EAGlD,OADAhW,IAAUA,EAAQ,IAAI00D,IACfoH,EAAUc,EAAcC,EAAcnG,EAASC,EAAY32D,EACpE,CACF,CACA,IAAKq8D,EACH,OAAO,EAGT,OADAr8D,IAAUA,EAAQ,IAAI00D,IA05ExB,SAAsBnjE,EAAQykB,EAAO0gD,EAASC,EAAYmF,EAAW97D,GACnE,IAAIw8D,EAjqLmB,EAiqLP9F,EACZoG,EAAWrE,GAAWlnE,GACtBwrE,EAAYD,EAAS3rF,OACrB6rF,EAAWvE,GAAWziD,GACtBslD,EAAY0B,EAAS7rF,OAEzB,GAAI4rF,GAAazB,IAAckB,EAC7B,OAAO,EAET,IAAI5pE,EAAQmqE,EACZ,KAAOnqE,KAAS,CACd,IAAIxc,EAAM0mF,EAASlqE,GACnB,KAAM4pE,EAAYpmF,KAAO4/B,EAAQ9zB,GAAe6D,KAAKiwB,EAAO5/B,IAC1D,OAAO,CAEX,CAEA,IAAI6mF,EAAaj9D,EAAM7sB,IAAIoe,GACvB2rE,EAAal9D,EAAM7sB,IAAI6iC,GAC3B,GAAIinD,GAAcC,EAChB,OAAOD,GAAcjnD,GAASknD,GAAc3rE,EAE9C,IAAItb,GAAS,EACb+pB,EAAM5V,IAAImH,EAAQykB,GAClBhW,EAAM5V,IAAI4rB,EAAOzkB,GAEjB,IAAI4rE,EAAWX,EACf,OAAS5pE,EAAQmqE,GAAW,CAE1B,IAAIhH,EAAWxkE,EADfnb,EAAM0mF,EAASlqE,IAEXwqE,EAAWpnD,EAAM5/B,GAErB,GAAIugF,EACF,IAAI0G,EAAWb,EACX7F,EAAWyG,EAAUrH,EAAU3/E,EAAK4/B,EAAOzkB,EAAQyO,GACnD22D,EAAWZ,EAAUqH,EAAUhnF,EAAKmb,EAAQykB,EAAOhW,GAGzD,KAAMq9D,IAAajsF,EACV2kF,IAAaqH,GAAYtB,EAAU/F,EAAUqH,EAAU1G,EAASC,EAAY32D,GAC7Eq9D,GACD,CACLpnF,GAAS,EACT,KACF,CACAknF,IAAaA,EAAkB,eAAP/mF,EAC1B,CACA,GAAIH,IAAWknF,EAAU,CACvB,IAAIG,EAAU/rE,EAAOlQ,YACjBk8E,EAAUvnD,EAAM30B,YAGhBi8E,GAAWC,KACV,gBAAiBhsE,MAAU,gBAAiBykB,IACzB,mBAAXsnD,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvDtnF,GAAS,EAEb,CAGA,OAFA+pB,EAAc,OAAEzO,GAChByO,EAAc,OAAEgW,GACT//B,CACT,CAx9ESunF,CAAajsE,EAAQykB,EAAO0gD,EAASC,EAAYmF,EAAW97D,EACrE,CA5DSy9D,CAAgB7/E,EAAOo4B,EAAO0gD,EAASC,EAAYkF,GAAa77D,GACzE,CAkFA,SAAS09D,GAAYnsE,EAAQvP,EAAQ27E,EAAWhH,GAC9C,IAAI/jE,EAAQ+qE,EAAUxsF,OAClBA,EAASyhB,EACTgrE,GAAgBjH,EAEpB,GAAc,MAAVplE,EACF,OAAQpgB,EAGV,IADAogB,EAAS9b,GAAO8b,GACTqB,KAAS,CACd,IAAIzN,EAAOw4E,EAAU/qE,GACrB,GAAKgrE,GAAgBz4E,EAAK,GAClBA,EAAK,KAAOoM,EAAOpM,EAAK,MACtBA,EAAK,KAAMoM,GAEnB,OAAO,CAEX,CACA,OAASqB,EAAQzhB,GAAQ,CAEvB,IAAIiF,GADJ+O,EAAOw4E,EAAU/qE,IACF,GACXmjE,EAAWxkE,EAAOnb,GAClBynF,EAAW14E,EAAK,GAEpB,GAAIy4E,GAAgBz4E,EAAK,IACvB,GAAI4wE,IAAa3kF,KAAegF,KAAOmb,GACrC,OAAO,MAEJ,CACL,IAAIyO,EAAQ,IAAI00D,GAChB,GAAIiC,EACF,IAAI1gF,EAAS0gF,EAAWZ,EAAU8H,EAAUznF,EAAKmb,EAAQvP,EAAQge,GAEnE,KAAM/pB,IAAW7E,EACTyqF,GAAYgC,EAAU9H,EAAU+H,EAA+CnH,EAAY32D,GAC3F/pB,GAEN,OAAO,CAEX,CACF,CACA,OAAO,CACT,CAUA,SAAS8nF,GAAangF,GACpB,SAAKgJ,GAAShJ,KA05FEuS,EA15FiBvS,EA25FxB+xE,IAAeA,MAAcx/D,MAx5FxBkqE,GAAWz8E,GAASqyE,GAAa1J,IAChCpiE,KAAKsuE,GAAS70E,IAs5F/B,IAAkBuS,CAr5FlB,CA2CA,SAAS6tE,GAAapgF,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACKqgF,GAEW,iBAATrgF,EACF4B,GAAQ5B,GACXsgF,GAAoBtgF,EAAM,GAAIA,EAAM,IACpCugF,GAAYvgF,GAEXwgF,GAASxgF,EAClB,CASA,SAASygF,GAAS9sE,GAChB,IAAK+sE,GAAY/sE,GACf,OAAOsgE,GAAWtgE,GAEpB,IAAItb,EAAS,GACb,IAAK,IAAIG,KAAOX,GAAO8b,GACjBrP,GAAe6D,KAAKwL,EAAQnb,IAAe,eAAPA,GACtCH,EAAOH,KAAKM,GAGhB,OAAOH,CACT,CASA,SAASsoF,GAAWhtE,GAClB,IAAK3K,GAAS2K,GACZ,OA09FJ,SAAsBA,GACpB,IAAItb,EAAS,GACb,GAAc,MAAVsb,EACF,IAAK,IAAInb,KAAOX,GAAO8b,GACrBtb,EAAOH,KAAKM,GAGhB,OAAOH,CACT,CAl+FWuoF,CAAajtE,GAEtB,IAAIktE,EAAUH,GAAY/sE,GACtBtb,EAAS,GAEb,IAAK,IAAIG,KAAOmb,GACD,eAAPnb,IAAyBqoF,GAAYv8E,GAAe6D,KAAKwL,EAAQnb,KACrEH,EAAOH,KAAKM,GAGhB,OAAOH,CACT,CAWA,SAASyoF,GAAO9gF,EAAOo4B,GACrB,OAAOp4B,EAAQo4B,CACjB,CAUA,SAAS2oD,GAAQtsC,EAAYk5B,GAC3B,IAAI34D,GAAS,EACT3c,EAAS2oF,GAAYvsC,GAAc9yC,EAAM8yC,EAAWlhD,QAAU,GAKlE,OAHA+kF,GAAS7jC,GAAY,SAASz0C,EAAOxH,EAAKi8C,GACxCp8C,IAAS2c,GAAS24D,EAAS3tE,EAAOxH,EAAKi8C,EACzC,IACOp8C,CACT,CASA,SAASkoF,GAAYn8E,GACnB,IAAI27E,EAAYkB,GAAa78E,GAC7B,OAAwB,GAApB27E,EAAUxsF,QAAewsF,EAAU,GAAG,GACjCmB,GAAwBnB,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASpsE,GACd,OAAOA,IAAWvP,GAAU07E,GAAYnsE,EAAQvP,EAAQ27E,EAC1D,CACF,CAUA,SAASO,GAAoBppD,EAAM+oD,GACjC,OAAIkB,GAAMjqD,IAASkqD,GAAmBnB,GAC7BiB,GAAwBtE,GAAM1lD,GAAO+oD,GAEvC,SAAStsE,GACd,IAAIwkE,EAAW5iF,GAAIoe,EAAQujB,GAC3B,OAAQihD,IAAa3kF,GAAa2kF,IAAa8H,EAC3CoB,GAAM1tE,EAAQujB,GACd+mD,GAAYgC,EAAU9H,EAAU+H,EACtC,CACF,CAaA,SAASoB,GAAU3tE,EAAQvP,EAAQm9E,EAAUxI,EAAY32D,GACnDzO,IAAWvP,GAGfi4E,GAAQj4E,GAAQ,SAAS67E,EAAUznF,GAEjC,GADA4pB,IAAUA,EAAQ,IAAI00D,IAClB9tE,GAASi3E,IA+BjB,SAAuBtsE,EAAQvP,EAAQ5L,EAAK+oF,EAAUC,EAAWzI,EAAY32D,GAC3E,IAAI+1D,EAAW/vE,GAAQuL,EAAQnb,GAC3BynF,EAAW73E,GAAQhE,EAAQ5L,GAC3BkiF,EAAUt4D,EAAM7sB,IAAI0qF,GAExB,GAAIvF,EAEF,YADA3C,GAAiBpkE,EAAQnb,EAAKkiF,GAGhC,IAAIpmE,EAAWykE,EACXA,EAAWZ,EAAU8H,EAAWznF,EAAM,GAAKmb,EAAQvP,EAAQge,GAC3D5uB,EAEA0nF,EAAW5mE,IAAa9gB,EAE5B,GAAI0nF,EAAU,CACZ,IAAIjE,EAAQr1E,GAAQq+E,GAChB7I,GAAUH,GAASpD,GAASoM,GAC5BwB,GAAWxK,IAAUG,GAAU7J,GAAa0S,GAEhD3rE,EAAW2rE,EACPhJ,GAASG,GAAUqK,EACjB7/E,GAAQu2E,GACV7jE,EAAW6jE,EAEJuJ,GAAkBvJ,GACzB7jE,EAAWsjE,GAAUO,GAEdf,GACP8D,GAAW,EACX5mE,EAAWglE,GAAY2G,GAAU,IAE1BwB,GACPvG,GAAW,EACX5mE,EAAW+lE,GAAgB4F,GAAU,IAGrC3rE,EAAW,GAGNqtE,GAAc1B,IAAa9I,GAAY8I,IAC9C3rE,EAAW6jE,EACPhB,GAAYgB,GACd7jE,EAAWstE,GAAczJ,GAEjBnvE,GAASmvE,KAAasE,GAAWtE,KACzC7jE,EAAWilE,GAAgB0G,KAI7B/E,GAAW,CAEf,CACIA,IAEF94D,EAAM5V,IAAIyzE,EAAU3rE,GACpBktE,EAAUltE,EAAU2rE,EAAUsB,EAAUxI,EAAY32D,GACpDA,EAAc,OAAE69D,IAElBlI,GAAiBpkE,EAAQnb,EAAK8b,EAChC,CA1FMutE,CAAcluE,EAAQvP,EAAQ5L,EAAK+oF,EAAUD,GAAWvI,EAAY32D,OAEjE,CACH,IAAI9N,EAAWykE,EACXA,EAAW3wE,GAAQuL,EAAQnb,GAAMynF,EAAWznF,EAAM,GAAKmb,EAAQvP,EAAQge,GACvE5uB,EAEA8gB,IAAa9gB,IACf8gB,EAAW2rE,GAEblI,GAAiBpkE,EAAQnb,EAAK8b,EAChC,CACF,GAAGolE,GACL,CAuFA,SAASoI,GAAQl3C,EAAOzgC,GACtB,IAAI5W,EAASq3C,EAAMr3C,OACnB,GAAKA,EAIL,OAAOgkF,GADPptE,GAAKA,EAAI,EAAI5W,EAAS,EACJA,GAAUq3C,EAAMzgC,GAAK3W,CACzC,CAWA,SAASuuF,GAAYttC,EAAYutC,EAAWC,GAExCD,EADEA,EAAUzuF,OACA66E,GAAS4T,GAAW,SAASrU,GACvC,OAAI/rE,GAAQ+rE,GACH,SAAS3tE,GACd,OAAO08E,GAAQ18E,EAA2B,IAApB2tE,EAASp6E,OAAeo6E,EAAS,GAAKA,EAC9D,EAEKA,CACT,IAEY,CAAC0S,IAGf,IAAIrrE,GAAS,EACbgtE,EAAY5T,GAAS4T,EAAWpS,GAAUsS,OAE1C,IAAI7pF,EAAS0oF,GAAQtsC,GAAY,SAASz0C,EAAOxH,EAAKi8C,GACpD,IAAI0tC,EAAW/T,GAAS4T,GAAW,SAASrU,GAC1C,OAAOA,EAAS3tE,EAClB,IACA,MAAO,CAAE,SAAYmiF,EAAU,QAAWntE,EAAO,MAAShV,EAC5D,IAEA,OA5xFJ,SAAoB4qC,EAAOw3C,GACzB,IAAI7uF,EAASq3C,EAAMr3C,OAGnB,IADAq3C,EAAM13B,KAAKkvE,GACJ7uF,KACLq3C,EAAMr3C,GAAUq3C,EAAMr3C,GAAQyM,MAEhC,OAAO4qC,CACT,CAoxFWy3C,CAAWhqF,GAAQ,SAASsb,EAAQykB,GACzC,OA04BJ,SAAyBzkB,EAAQykB,EAAO6pD,GACtC,IAAIjtE,GAAS,EACTstE,EAAc3uE,EAAOwuE,SACrBI,EAAcnqD,EAAM+pD,SACpB5uF,EAAS+uF,EAAY/uF,OACrBivF,EAAeP,EAAO1uF,OAE1B,OAASyhB,EAAQzhB,GAAQ,CACvB,IAAI8E,EAASoqF,GAAiBH,EAAYttE,GAAQutE,EAAYvtE,IAC9D,GAAI3c,EACF,OAAI2c,GAASwtE,EACJnqF,EAGFA,GAAmB,QADd4pF,EAAOjtE,IACiB,EAAI,EAE5C,CAQA,OAAOrB,EAAOqB,MAAQojB,EAAMpjB,KAC9B,CAn6BW0tE,CAAgB/uE,EAAQykB,EAAO6pD,EACxC,GACF,CA0BA,SAASU,GAAWhvE,EAAQqwD,EAAOrrB,GAKjC,IAJA,IAAI3jC,GAAS,EACTzhB,EAASywE,EAAMzwE,OACf8E,EAAS,CAAC,IAEL2c,EAAQzhB,GAAQ,CACvB,IAAI2jC,EAAO8sC,EAAMhvD,GACbhV,EAAQ08E,GAAQ/oE,EAAQujB,GAExByhB,EAAU34C,EAAOk3B,IACnB0rD,GAAQvqF,EAAQskF,GAASzlD,EAAMvjB,GAAS3T,EAE5C,CACA,OAAO3H,CACT,CA0BA,SAASwqF,GAAYj4C,EAAOl9B,EAAQigE,EAAUrsC,GAC5C,IAAIntC,EAAUmtC,EAAa6tC,GAAkBjB,GACzCl5D,GAAS,EACTzhB,EAASma,EAAOna,OAChBuqF,EAAOlzC,EAQX,IANIA,IAAUl9B,IACZA,EAASkqE,GAAUlqE,IAEjBigE,IACFmQ,EAAO1P,GAASxjC,EAAOglC,GAAUjC,OAE1B34D,EAAQzhB,GAKf,IAJA,IAAIw7E,EAAY,EACZ/uE,EAAQ0N,EAAOsH,GACfomE,EAAWzN,EAAWA,EAAS3tE,GAASA,GAEpC+uE,EAAY56E,EAAQ2pF,EAAM1C,EAAUrM,EAAWztC,KAAgB,GACjEw8C,IAASlzC,GACXxU,GAAOjuB,KAAK21E,EAAM/O,EAAW,GAE/B34C,GAAOjuB,KAAKyiC,EAAOmkC,EAAW,GAGlC,OAAOnkC,CACT,CAWA,SAASk4C,GAAWl4C,EAAOm4C,GAIzB,IAHA,IAAIxvF,EAASq3C,EAAQm4C,EAAQxvF,OAAS,EAClCy9E,EAAYz9E,EAAS,EAElBA,KAAU,CACf,IAAIyhB,EAAQ+tE,EAAQxvF,GACpB,GAAIA,GAAUy9E,GAAah8D,IAAUguE,EAAU,CAC7C,IAAIA,EAAWhuE,EACXuiE,GAAQviE,GACVohB,GAAOjuB,KAAKyiC,EAAO51B,EAAO,GAE1BiuE,GAAUr4C,EAAO51B,EAErB,CACF,CACA,OAAO41B,CACT,CAWA,SAAS6sC,GAAWkB,EAAOC,GACzB,OAAOD,EAAQlF,GAAYa,MAAkBsE,EAAQD,EAAQ,GAC/D,CAiCA,SAASuK,GAAWxT,EAAQvlE,GAC1B,IAAI9R,EAAS,GACb,IAAKq3E,GAAUvlE,EAAI,GAAKA,EAAI86D,EAC1B,OAAO5sE,EAIT,GACM8R,EAAI,IACN9R,GAAUq3E,IAEZvlE,EAAIspE,GAAYtpE,EAAI,MAElBulE,GAAUA,SAELvlE,GAET,OAAO9R,CACT,CAUA,SAAS8qF,GAAS5wE,EAAMoX,GACtB,OAAOy5D,GAAYC,GAAS9wE,EAAMoX,EAAO02D,IAAW9tE,EAAO,GAC7D,CASA,SAAS+wE,GAAW7uC,GAClB,OAAO+iC,GAAY9pE,GAAO+mC,GAC5B,CAUA,SAAS8uC,GAAe9uC,EAAYtqC,GAClC,IAAIygC,EAAQl9B,GAAO+mC,GACnB,OAAOkjC,GAAY/sC,EAAOitC,GAAU1tE,EAAG,EAAGygC,EAAMr3C,QAClD,CAYA,SAASqvF,GAAQjvE,EAAQujB,EAAMl3B,EAAO+4E,GACpC,IAAK/vE,GAAS2K,GACZ,OAAOA,EAST,IALA,IAAIqB,GAAS,EACTzhB,GAHJ2jC,EAAOylD,GAASzlD,EAAMvjB,IAGJpgB,OACdy9E,EAAYz9E,EAAS,EACrBiwF,EAAS7vE,EAEI,MAAV6vE,KAAoBxuE,EAAQzhB,GAAQ,CACzC,IAAIiF,EAAMokF,GAAM1lD,EAAKliB,IACjBV,EAAWtU,EAEf,GAAY,cAARxH,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOmb,EAGT,GAAIqB,GAASg8D,EAAW,CACtB,IAAImH,EAAWqL,EAAOhrF,IACtB8b,EAAWykE,EAAaA,EAAWZ,EAAU3/E,EAAKgrF,GAAUhwF,KAC3CA,IACf8gB,EAAWtL,GAASmvE,GAChBA,EACCZ,GAAQrgD,EAAKliB,EAAQ,IAAM,GAAK,CAAC,EAE1C,CACAkjE,GAAYsL,EAAQhrF,EAAK8b,GACzBkvE,EAASA,EAAOhrF,EAClB,CACA,OAAOmb,CACT,CAUA,IAAI8vE,GAAe/O,GAAqB,SAASniE,EAAMhL,GAErD,OADAmtE,GAAQloE,IAAI+F,EAAMhL,GACXgL,CACT,EAH6B8tE,GAazBqD,GAAmBxQ,GAA4B,SAAS3gE,EAAMm9D,GAChE,OAAOwD,GAAe3gE,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASoxE,GAASjU,GAClB,UAAY,GAEhB,EAPwC2Q,GAgBxC,SAASuD,GAAYnvC,GACnB,OAAOkjC,GAAYjqE,GAAO+mC,GAC5B,CAWA,SAASovC,GAAUj5C,EAAOjhB,EAAO83C,GAC/B,IAAIzsD,GAAS,EACTzhB,EAASq3C,EAAMr3C,OAEfo2B,EAAQ,IACVA,GAASA,EAAQp2B,EAAS,EAAKA,EAASo2B,IAE1C83C,EAAMA,EAAMluE,EAASA,EAASkuE,GACpB,IACRA,GAAOluE,GAETA,EAASo2B,EAAQ83C,EAAM,EAAMA,EAAM93C,IAAW,EAC9CA,KAAW,EAGX,IADA,IAAItxB,EAASsJ,EAAMpO,KACVyhB,EAAQzhB,GACf8E,EAAO2c,GAAS41B,EAAM51B,EAAQ2U,GAEhC,OAAOtxB,CACT,CAWA,SAASyrF,GAASrvC,EAAYkE,GAC5B,IAAItgD,EAMJ,OAJAigF,GAAS7jC,GAAY,SAASz0C,EAAOgV,EAAOy/B,GAE1C,QADAp8C,EAASsgD,EAAU34C,EAAOgV,EAAOy/B,GAEnC,MACSp8C,CACX,CAcA,SAAS0rF,GAAgBn5C,EAAO5qC,EAAOgkF,GACrC,IAAIj8C,EAAM,EACNjpB,EAAgB,MAAT8rB,EAAgB7C,EAAM6C,EAAMr3C,OAEvC,GAAoB,iBAATyM,GAAqBA,IAAUA,GAAS8e,GAn/H3BqmD,WAm/H0D,CAChF,KAAOp9B,EAAMjpB,GAAM,CACjB,IAAImlE,EAAOl8C,EAAMjpB,IAAU,EACvBs8D,EAAWxwC,EAAMq5C,GAEJ,OAAb7I,IAAsBW,GAASX,KAC9B4I,EAAc5I,GAAYp7E,EAAUo7E,EAAWp7E,GAClD+nC,EAAMk8C,EAAM,EAEZnlE,EAAOmlE,CAEX,CACA,OAAOnlE,CACT,CACA,OAAOolE,GAAkBt5C,EAAO5qC,EAAOqgF,GAAU2D,EACnD,CAeA,SAASE,GAAkBt5C,EAAO5qC,EAAO2tE,EAAUqW,GACjD,IAAIj8C,EAAM,EACNjpB,EAAgB,MAAT8rB,EAAgB,EAAIA,EAAMr3C,OACrC,GAAa,IAATurB,EACF,OAAO,EAST,IALA,IAAIqlE,GADJnkF,EAAQ2tE,EAAS3tE,MACQA,EACrBokF,EAAsB,OAAVpkF,EACZqkF,EAActI,GAAS/7E,GACvBskF,EAAiBtkF,IAAUxM,EAExBu0C,EAAMjpB,GAAM,CACjB,IAAImlE,EAAMxQ,IAAa1rC,EAAMjpB,GAAQ,GACjCs8D,EAAWzN,EAAS/iC,EAAMq5C,IAC1BM,EAAenJ,IAAa5nF,EAC5BgxF,EAAyB,OAAbpJ,EACZqJ,EAAiBrJ,IAAaA,EAC9BsJ,EAAc3I,GAASX,GAE3B,GAAI+I,EACF,IAAIQ,EAASX,GAAcS,OAE3BE,EADSL,EACAG,IAAmBT,GAAcO,GACjCH,EACAK,GAAkBF,IAAiBP,IAAeQ,GAClDH,EACAI,GAAkBF,IAAiBC,IAAcR,IAAeU,IAChEF,IAAaE,IAGbV,EAAc5I,GAAYp7E,EAAUo7E,EAAWp7E,GAEtD2kF,EACF58C,EAAMk8C,EAAM,EAEZnlE,EAAOmlE,CAEX,CACA,OAAO9P,GAAUr1D,EA1jICqmD,WA2jIpB,CAWA,SAASyf,GAAeh6C,EAAO+iC,GAM7B,IALA,IAAI34D,GAAS,EACTzhB,EAASq3C,EAAMr3C,OACfy6E,EAAW,EACX31E,EAAS,KAEJ2c,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACdomE,EAAWzN,EAAWA,EAAS3tE,GAASA,EAE5C,IAAKgV,IAAUgjE,GAAGoD,EAAU0C,GAAO,CACjC,IAAIA,EAAO1C,EACX/iF,EAAO21E,KAAwB,IAAVhuE,EAAc,EAAIA,CACzC,CACF,CACA,OAAO3H,CACT,CAUA,SAASwsF,GAAa7kF,GACpB,MAAoB,iBAATA,EACFA,EAEL+7E,GAAS/7E,GACJklE,GAEDllE,CACV,CAUA,SAAS8kF,GAAa9kF,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI4B,GAAQ5B,GAEV,OAAOouE,GAASpuE,EAAO8kF,IAAgB,GAEzC,GAAI/I,GAAS/7E,GACX,OAAOo1E,GAAiBA,GAAejtE,KAAKnI,GAAS,GAEvD,IAAI3H,EAAU2H,EAAQ,GACtB,MAAkB,KAAV3H,GAAkB,EAAI2H,IAAU,IAAa,KAAO3H,CAC9D,CAWA,SAAS0sF,GAASn6C,EAAO+iC,EAAUrsC,GACjC,IAAItsB,GAAS,EACTnM,EAAWolE,GACX16E,EAASq3C,EAAMr3C,OACf2nF,GAAW,EACX7iF,EAAS,GACTylF,EAAOzlF,EAEX,GAAIipC,EACF45C,GAAW,EACXryE,EAAWslE,QAER,GAAI56E,GAjtIU,IAitIkB,CACnC,IAAIiZ,EAAMmhE,EAAW,KAAOqX,GAAUp6C,GACtC,GAAIp+B,EACF,OAAOqkE,GAAWrkE,GAEpB0uE,GAAW,EACXryE,EAAWinE,GACXgO,EAAO,IAAIlH,EACb,MAEEkH,EAAOnQ,EAAW,GAAKt1E,EAEzB4/B,EACA,OAASjjB,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACdomE,EAAWzN,EAAWA,EAAS3tE,GAASA,EAG5C,GADAA,EAASshC,GAAwB,IAAVthC,EAAeA,EAAQ,EAC1Ck7E,GAAYE,IAAaA,EAAU,CAErC,IADA,IAAI6J,EAAYnH,EAAKvqF,OACd0xF,KACL,GAAInH,EAAKmH,KAAe7J,EACtB,SAASnjD,EAGT01C,GACFmQ,EAAK5lF,KAAKkjF,GAEZ/iF,EAAOH,KAAK8H,EACd,MACU6I,EAASi1E,EAAM1C,EAAU95C,KAC7Bw8C,IAASzlF,GACXylF,EAAK5lF,KAAKkjF,GAEZ/iF,EAAOH,KAAK8H,GAEhB,CACA,OAAO3H,CACT,CAUA,SAAS4qF,GAAUtvE,EAAQujB,GAGzB,OAAiB,OADjBvjB,EAASw3C,GAAOx3C,EADhBujB,EAAOylD,GAASzlD,EAAMvjB,aAEUA,EAAOipE,GAAM/vB,GAAK31B,IACpD,CAYA,SAASguD,GAAWvxE,EAAQujB,EAAMiuD,EAASpM,GACzC,OAAO6J,GAAQjvE,EAAQujB,EAAMiuD,EAAQzI,GAAQ/oE,EAAQujB,IAAQ6hD,EAC/D,CAaA,SAASqM,GAAUx6C,EAAO+N,EAAW0sC,EAAQrW,GAI3C,IAHA,IAAIz7E,EAASq3C,EAAMr3C,OACfyhB,EAAQg6D,EAAYz7E,GAAU,GAE1By7E,EAAYh6D,MAAYA,EAAQzhB,IACtColD,EAAU/N,EAAM51B,GAAQA,EAAO41B,KAEjC,OAAOy6C,EACHxB,GAAUj5C,EAAQokC,EAAY,EAAIh6D,EAASg6D,EAAYh6D,EAAQ,EAAIzhB,GACnEswF,GAAUj5C,EAAQokC,EAAYh6D,EAAQ,EAAI,EAAKg6D,EAAYz7E,EAASyhB,EAC1E,CAYA,SAASswE,GAAiBtlF,EAAOG,GAC/B,IAAI9H,EAAS2H,EAIb,OAHI3H,aAAkBk9E,KACpBl9E,EAASA,EAAO2H,SAEXsuE,GAAYnuE,GAAS,SAAS9H,EAAQmE,GAC3C,OAAOA,EAAO+V,KAAKO,MAAMtW,EAAOgxE,QAASa,GAAU,CAACh2E,GAASmE,EAAOyT,MACtE,GAAG5X,EACL,CAYA,SAASktF,GAAQ9H,EAAQ9P,EAAUrsC,GACjC,IAAI/tC,EAASkqF,EAAOlqF,OACpB,GAAIA,EAAS,EACX,OAAOA,EAASwxF,GAAStH,EAAO,IAAM,GAKxC,IAHA,IAAIzoE,GAAS,EACT3c,EAASsJ,EAAMpO,KAEVyhB,EAAQzhB,GAIf,IAHA,IAAIq3C,EAAQ6yC,EAAOzoE,GACf2oE,GAAY,IAEPA,EAAWpqF,GACdoqF,GAAY3oE,IACd3c,EAAO2c,GAASimE,GAAe5iF,EAAO2c,IAAU41B,EAAO6yC,EAAOE,GAAWhQ,EAAUrsC,IAIzF,OAAOyjD,GAAS9I,GAAY5jF,EAAQ,GAAIs1E,EAAUrsC,EACpD,CAWA,SAASkkD,GAAch6E,EAAOkC,EAAQ+3E,GAMpC,IALA,IAAIzwE,GAAS,EACTzhB,EAASiY,EAAMjY,OACfmyF,EAAah4E,EAAOna,OACpB8E,EAAS,CAAC,IAEL2c,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQgV,EAAQ0wE,EAAah4E,EAAOsH,GAASxhB,EACjDiyF,EAAWptF,EAAQmT,EAAMwJ,GAAQhV,EACnC,CACA,OAAO3H,CACT,CASA,SAASstF,GAAoB3lF,GAC3B,OAAO0hF,GAAkB1hF,GAASA,EAAQ,EAC5C,CASA,SAAS4lF,GAAa5lF,GACpB,MAAuB,mBAATA,EAAsBA,EAAQqgF,EAC9C,CAUA,SAAS1D,GAAS38E,EAAO2T,GACvB,OAAI/R,GAAQ5B,GACHA,EAEFmhF,GAAMnhF,EAAO2T,GAAU,CAAC3T,GAAS6lF,GAAa5nE,GAASje,GAChE,CAWA,IAAI8lF,GAAW3C,GAWf,SAAS4C,GAAUn7C,EAAOjhB,EAAO83C,GAC/B,IAAIluE,EAASq3C,EAAMr3C,OAEnB,OADAkuE,EAAMA,IAAQjuE,EAAYD,EAASkuE,GAC1B93C,GAAS83C,GAAOluE,EAAUq3C,EAAQi5C,GAAUj5C,EAAOjhB,EAAO83C,EACrE,CAQA,IAAIv4C,GAAekqD,IAAmB,SAASx0D,GAC7C,OAAOspB,GAAKhf,aAAatK,EAC3B,EAUA,SAAS06D,GAAYW,EAAQjB,GAC3B,GAAIA,EACF,OAAOiB,EAAOjiF,QAEhB,IAAIzE,EAAS0mF,EAAO1mF,OAChB8E,EAASm6E,GAAcA,GAAYj/E,GAAU,IAAI0mF,EAAOx2E,YAAYlQ,GAGxE,OADA0mF,EAAO73C,KAAK/pC,GACLA,CACT,CASA,SAAS0hF,GAAiBiM,GACxB,IAAI3tF,EAAS,IAAI2tF,EAAYviF,YAAYuiF,EAAY7L,YAErD,OADA,IAAI5H,GAAWl6E,GAAQmU,IAAI,IAAI+lE,GAAWyT,IACnC3tF,CACT,CA+CA,SAASgiF,GAAgB4L,EAAYjN,GACnC,IAAIiB,EAASjB,EAASe,GAAiBkM,EAAWhM,QAAUgM,EAAWhM,OACvE,OAAO,IAAIgM,EAAWxiF,YAAYw2E,EAAQgM,EAAW/L,WAAY+L,EAAW1yF,OAC9E,CAUA,SAASkvF,GAAiBziF,EAAOo4B,GAC/B,GAAIp4B,IAAUo4B,EAAO,CACnB,IAAI8tD,EAAelmF,IAAUxM,EACzB4wF,EAAsB,OAAVpkF,EACZmmF,EAAiBnmF,IAAUA,EAC3BqkF,EAActI,GAAS/7E,GAEvBukF,EAAensD,IAAU5kC,EACzBgxF,EAAsB,OAAVpsD,EACZqsD,EAAiBrsD,IAAUA,EAC3BssD,EAAc3I,GAAS3jD,GAE3B,IAAMosD,IAAcE,IAAgBL,GAAerkF,EAAQo4B,GACtDisD,GAAeE,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5ByB,GAAgBzB,IACjB0B,EACH,OAAO,EAET,IAAM/B,IAAcC,IAAgBK,GAAe1kF,EAAQo4B,GACtDssD,GAAewB,GAAgBC,IAAmB/B,IAAcC,GAChEG,GAAa0B,GAAgBC,IAC5B5B,GAAgB4B,IACjB1B,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,CAsDA,SAAS2B,GAAYn2E,EAAMo2E,EAAUC,EAASC,GAU5C,IATA,IAAIC,GAAa,EACbC,EAAax2E,EAAK1c,OAClBmzF,EAAgBJ,EAAQ/yF,OACxBozF,GAAa,EACbC,EAAaP,EAAS9yF,OACtBszF,EAAc3S,GAAUuS,EAAaC,EAAe,GACpDruF,EAASsJ,EAAMilF,EAAaC,GAC5BC,GAAeP,IAEVI,EAAYC,GACnBvuF,EAAOsuF,GAAaN,EAASM,GAE/B,OAASH,EAAYE,IACfI,GAAeN,EAAYC,KAC7BpuF,EAAOiuF,EAAQE,IAAcv2E,EAAKu2E,IAGtC,KAAOK,KACLxuF,EAAOsuF,KAAe12E,EAAKu2E,KAE7B,OAAOnuF,CACT,CAaA,SAAS0uF,GAAiB92E,EAAMo2E,EAAUC,EAASC,GAWjD,IAVA,IAAIC,GAAa,EACbC,EAAax2E,EAAK1c,OAClByzF,GAAgB,EAChBN,EAAgBJ,EAAQ/yF,OACxB0zF,GAAc,EACdC,EAAcb,EAAS9yF,OACvBszF,EAAc3S,GAAUuS,EAAaC,EAAe,GACpDruF,EAASsJ,EAAMklF,EAAcK,GAC7BJ,GAAeP,IAEVC,EAAYK,GACnBxuF,EAAOmuF,GAAav2E,EAAKu2E,GAG3B,IADA,IAAI38E,EAAS28E,IACJS,EAAaC,GACpB7uF,EAAOwR,EAASo9E,GAAcZ,EAASY,GAEzC,OAASD,EAAeN,IAClBI,GAAeN,EAAYC,KAC7BpuF,EAAOwR,EAASy8E,EAAQU,IAAiB/2E,EAAKu2E,MAGlD,OAAOnuF,CACT,CAUA,SAASu/E,GAAUxzE,EAAQwmC,GACzB,IAAI51B,GAAS,EACTzhB,EAAS6Q,EAAO7Q,OAGpB,IADAq3C,IAAUA,EAAQjpC,EAAMpO,MACfyhB,EAAQzhB,GACfq3C,EAAM51B,GAAS5Q,EAAO4Q,GAExB,OAAO41B,CACT,CAYA,SAAS4tC,GAAWp0E,EAAQoH,EAAOmI,EAAQolE,GACzC,IAAIoO,GAASxzE,EACbA,IAAWA,EAAS,CAAC,GAKrB,IAHA,IAAIqB,GAAS,EACTzhB,EAASiY,EAAMjY,SAEVyhB,EAAQzhB,GAAQ,CACvB,IAAIiF,EAAMgT,EAAMwJ,GAEZV,EAAWykE,EACXA,EAAWplE,EAAOnb,GAAM4L,EAAO5L,GAAMA,EAAKmb,EAAQvP,GAClD5Q,EAEA8gB,IAAa9gB,IACf8gB,EAAWlQ,EAAO5L,IAEhB2uF,EACFlP,GAAgBtkE,EAAQnb,EAAK8b,GAE7B4jE,GAAYvkE,EAAQnb,EAAK8b,EAE7B,CACA,OAAOX,CACT,CAkCA,SAASyzE,GAAiB1Z,EAAQ2Z,GAChC,OAAO,SAAS5yC,EAAYk5B,GAC1B,IAAIp7D,EAAO3Q,GAAQ6yC,GAAcg5B,GAAkB4K,GAC/C74B,EAAc6nC,EAAcA,IAAgB,CAAC,EAEjD,OAAO90E,EAAKkiC,EAAYi5B,EAAQwU,GAAYvU,EAAU,GAAInuB,EAC5D,CACF,CASA,SAAS8nC,GAAeC,GACtB,OAAOpE,IAAS,SAASxvE,EAAQ6zE,GAC/B,IAAIxyE,GAAS,EACTzhB,EAASi0F,EAAQj0F,OACjBwlF,EAAaxlF,EAAS,EAAIi0F,EAAQj0F,EAAS,GAAKC,EAChDi0F,EAAQl0F,EAAS,EAAIi0F,EAAQ,GAAKh0F,EAWtC,IATAulF,EAAcwO,EAASh0F,OAAS,GAA0B,mBAAdwlF,GACvCxlF,IAAUwlF,GACXvlF,EAEAi0F,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClD1O,EAAaxlF,EAAS,EAAIC,EAAYulF,EACtCxlF,EAAS,GAEXogB,EAAS9b,GAAO8b,KACPqB,EAAQzhB,GAAQ,CACvB,IAAI6Q,EAASojF,EAAQxyE,GACjB5Q,GACFmjF,EAAS5zE,EAAQvP,EAAQ4Q,EAAO+jE,EAEpC,CACA,OAAOplE,CACT,GACF,CAUA,SAAS8nE,GAAe5M,EAAUG,GAChC,OAAO,SAASv6B,EAAYk5B,GAC1B,GAAkB,MAAdl5B,EACF,OAAOA,EAET,IAAKusC,GAAYvsC,GACf,OAAOo6B,EAASp6B,EAAYk5B,GAM9B,IAJA,IAAIp6E,EAASkhD,EAAWlhD,OACpByhB,EAAQg6D,EAAYz7E,GAAU,EAC9Bo0F,EAAW9vF,GAAO48C,IAEdu6B,EAAYh6D,MAAYA,EAAQzhB,KACa,IAA/Co6E,EAASga,EAAS3yE,GAAQA,EAAO2yE,KAIvC,OAAOlzC,CACT,CACF,CASA,SAAS6nC,GAActN,GACrB,OAAO,SAASr7D,EAAQg6D,EAAUmP,GAMhC,IALA,IAAI9nE,GAAS,EACT2yE,EAAW9vF,GAAO8b,GAClBnI,EAAQsxE,EAASnpE,GACjBpgB,EAASiY,EAAMjY,OAEZA,KAAU,CACf,IAAIiF,EAAMgT,EAAMwjE,EAAYz7E,IAAWyhB,GACvC,IAA+C,IAA3C24D,EAASga,EAASnvF,GAAMA,EAAKmvF,GAC/B,KAEJ,CACA,OAAOh0E,CACT,CACF,CA8BA,SAASi0E,GAAgBC,GACvB,OAAO,SAASnY,GAGd,IAAIM,EAAaO,GAFjBb,EAASzxD,GAASyxD,IAGdwB,GAAcxB,GACdl8E,EAEA88E,EAAMN,EACNA,EAAW,GACXN,EAAOz7E,OAAO,GAEd6zF,EAAW9X,EACX+V,GAAU/V,EAAY,GAAGvtE,KAAK,IAC9BitE,EAAO13E,MAAM,GAEjB,OAAOs4E,EAAIuX,KAAgBC,CAC7B,CACF,CASA,SAASC,GAAiB9sF,GACxB,OAAO,SAASy0E,GACd,OAAOpB,GAAY0Z,GAAMC,GAAOvY,GAAQ7rE,QAAQonE,GAAQ,KAAMhwE,EAAU,GAC1E,CACF,CAUA,SAASitF,GAAWpO,GAClB,OAAO,WAIL,IAAI7pE,EAAO3c,UACX,OAAQ2c,EAAK1c,QACX,KAAK,EAAG,OAAO,IAAIumF,EACnB,KAAK,EAAG,OAAO,IAAIA,EAAK7pE,EAAK,IAC7B,KAAK,EAAG,OAAO,IAAI6pE,EAAK7pE,EAAK,GAAIA,EAAK,IACtC,KAAK,EAAG,OAAO,IAAI6pE,EAAK7pE,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC/C,KAAK,EAAG,OAAO,IAAI6pE,EAAK7pE,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACxD,KAAK,EAAG,OAAO,IAAI6pE,EAAK7pE,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IACjE,KAAK,EAAG,OAAO,IAAI6pE,EAAK7pE,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAC1E,KAAK,EAAG,OAAO,IAAI6pE,EAAK7pE,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAErF,IAAIk4E,EAAczS,GAAWoE,EAAKhzE,WAC9BzO,EAASyhF,EAAKhnE,MAAMq1E,EAAal4E,GAIrC,OAAOjH,GAAS3Q,GAAUA,EAAS8vF,CACrC,CACF,CA8CA,SAASC,GAAWC,GAClB,OAAO,SAAS5zC,EAAYkE,EAAWo2B,GACrC,IAAI4Y,EAAW9vF,GAAO48C,GACtB,IAAKusC,GAAYvsC,GAAa,CAC5B,IAAIk5B,EAAWuU,GAAYvpC,EAAW,GACtClE,EAAa38C,GAAK28C,GAClBkE,EAAY,SAASngD,GAAO,OAAOm1E,EAASga,EAASnvF,GAAMA,EAAKmvF,EAAW,CAC7E,CACA,IAAI3yE,EAAQqzE,EAAc5zC,EAAYkE,EAAWo2B,GACjD,OAAO/5D,GAAS,EAAI2yE,EAASha,EAAWl5B,EAAWz/B,GAASA,GAASxhB,CACvE,CACF,CASA,SAAS80F,GAAWtZ,GAClB,OAAOuZ,IAAS,SAASC,GACvB,IAAIj1F,EAASi1F,EAAMj1F,OACfyhB,EAAQzhB,EACRk1F,EAASjT,GAAc1uE,UAAU4hF,KAKrC,IAHI1Z,GACFwZ,EAAM5mE,UAED5M,KAAS,CACd,IAAIzC,EAAOi2E,EAAMxzE,GACjB,GAAmB,mBAARzC,EACT,MAAM,IAAI/B,GAAUg0D,GAEtB,GAAIikB,IAAWE,GAAgC,WAArBC,GAAYr2E,GACpC,IAAIo2E,EAAU,IAAInT,GAAc,IAAI,EAExC,CAEA,IADAxgE,EAAQ2zE,EAAU3zE,EAAQzhB,IACjByhB,EAAQzhB,GAAQ,CAGvB,IAAIs1F,EAAWD,GAFfr2E,EAAOi2E,EAAMxzE,IAGTzN,EAAmB,WAAZshF,EAAwBC,GAAQv2E,GAAQ/e,EAMjDm1F,EAJEphF,GAAQwhF,GAAWxhF,EAAK,KACX,KAAXA,EAAK,KACJA,EAAK,GAAGhU,QAAqB,GAAXgU,EAAK,GAElBohF,EAAQC,GAAYrhF,EAAK,KAAKuL,MAAM61E,EAASphF,EAAK,IAElC,GAAfgL,EAAKhf,QAAew1F,GAAWx2E,GACtCo2E,EAAQE,KACRF,EAAQD,KAAKn2E,EAErB,CACA,OAAO,WACL,IAAItC,EAAO3c,UACP0M,EAAQiQ,EAAK,GAEjB,GAAI04E,GAA0B,GAAf14E,EAAK1c,QAAeqO,GAAQ5B,GACzC,OAAO2oF,EAAQK,MAAMhpF,GAAOA,QAK9B,IAHA,IAAIgV,EAAQ,EACR3c,EAAS9E,EAASi1F,EAAMxzE,GAAOlC,MAAMzR,KAAM4O,GAAQjQ,IAE9CgV,EAAQzhB,GACf8E,EAASmwF,EAAMxzE,GAAO7M,KAAK9G,KAAMhJ,GAEnC,OAAOA,CACT,CACF,GACF,CAqBA,SAAS4wF,GAAa12E,EAAMumE,EAAStL,EAAS6Y,EAAUC,EAAS4C,EAAeC,EAAcC,EAAQC,EAAKC,GACzG,IAAIC,EAAQzQ,EAAUhU,EAClB0kB,EA5iKa,EA4iKJ1Q,EACT2Q,EA5iKiB,EA4iKL3Q,EACZyN,EAAsB,GAAVzN,EACZ4Q,EAtiKa,IAsiKJ5Q,EACTgB,EAAO2P,EAAYj2F,EAAY00F,GAAW31E,GA6C9C,OA3CA,SAASo2E,IAKP,IAJA,IAAIp1F,EAASD,UAAUC,OACnB0c,EAAOtO,EAAMpO,GACbyhB,EAAQzhB,EAELyhB,KACL/E,EAAK+E,GAAS1hB,UAAU0hB,GAE1B,GAAIuxE,EACF,IAAI3V,EAAc+Y,GAAUhB,GACxBiB,EAvhIZ,SAAsBh/C,EAAOgmC,GAI3B,IAHA,IAAIr9E,EAASq3C,EAAMr3C,OACf8E,EAAS,EAEN9E,KACDq3C,EAAMr3C,KAAYq9E,KAClBv4E,EAGN,OAAOA,CACT,CA6gI2BwxF,CAAa55E,EAAM2gE,GASxC,GAPIyV,IACFp2E,EAAOm2E,GAAYn2E,EAAMo2E,EAAUC,EAASC,IAE1C2C,IACFj5E,EAAO82E,GAAiB92E,EAAMi5E,EAAeC,EAAc5C,IAE7DhzF,GAAUq2F,EACNrD,GAAahzF,EAAS+1F,EAAO,CAC/B,IAAIQ,EAAanZ,GAAe1gE,EAAM2gE,GACtC,OAAOmZ,GACLx3E,EAAMumE,EAASmQ,GAAcN,EAAQ/X,YAAapD,EAClDv9D,EAAM65E,EAAYV,EAAQC,EAAKC,EAAQ/1F,EAE3C,CACA,IAAI40F,EAAcqB,EAAShc,EAAUnsE,KACjCiH,EAAKmhF,EAAYtB,EAAY51E,GAAQA,EAczC,OAZAhf,EAAS0c,EAAK1c,OACV61F,EACFn5E,EAg4CN,SAAiB26B,EAAOm4C,GACtB,IAAIiH,EAAYp/C,EAAMr3C,OAClBA,EAAS4gF,GAAU4O,EAAQxvF,OAAQy2F,GACnCC,EAAWrS,GAAUhtC,GAEzB,KAAOr3C,KAAU,CACf,IAAIyhB,EAAQ+tE,EAAQxvF,GACpBq3C,EAAMr3C,GAAUgkF,GAAQviE,EAAOg1E,GAAaC,EAASj1E,GAASxhB,CAChE,CACA,OAAOo3C,CACT,CA14Cas/C,CAAQj6E,EAAMm5E,GACZM,GAAUn2F,EAAS,GAC5B0c,EAAK2R,UAEH2nE,GAASF,EAAM91F,IACjB0c,EAAK1c,OAAS81F,GAEZhoF,MAAQA,OAAS6mC,IAAQ7mC,gBAAgBsnF,IAC3CrgF,EAAKwxE,GAAQoO,GAAW5/E,IAEnBA,EAAGwK,MAAMq1E,EAAal4E,EAC/B,CAEF,CAUA,SAASk6E,GAAezc,EAAQ0c,GAC9B,OAAO,SAASz2E,EAAQg6D,GACtB,OAh/DJ,SAAsBh6D,EAAQ+5D,EAAQC,EAAUnuB,GAI9C,OAHAk8B,GAAW/nE,GAAQ,SAAS3T,EAAOxH,EAAKmb,GACtC+5D,EAAOluB,EAAamuB,EAAS3tE,GAAQxH,EAAKmb,EAC5C,IACO6rC,CACT,CA2+DW6qC,CAAa12E,EAAQ+5D,EAAQ0c,EAAWzc,GAAW,CAAC,EAC7D,CACF,CAUA,SAAS2c,GAAoBC,EAAUC,GACrC,OAAO,SAASxqF,EAAOo4B,GACrB,IAAI//B,EACJ,GAAI2H,IAAUxM,GAAa4kC,IAAU5kC,EACnC,OAAOg3F,EAKT,GAHIxqF,IAAUxM,IACZ6E,EAAS2H,GAEPo4B,IAAU5kC,EAAW,CACvB,GAAI6E,IAAW7E,EACb,OAAO4kC,EAEW,iBAATp4B,GAAqC,iBAATo4B,GACrCp4B,EAAQ8kF,GAAa9kF,GACrBo4B,EAAQ0sD,GAAa1sD,KAErBp4B,EAAQ6kF,GAAa7kF,GACrBo4B,EAAQysD,GAAazsD,IAEvB//B,EAASkyF,EAASvqF,EAAOo4B,EAC3B,CACA,OAAO//B,CACT,CACF,CASA,SAASoyF,GAAWC,GAClB,OAAOnC,IAAS,SAASvG,GAEvB,OADAA,EAAY5T,GAAS4T,EAAWpS,GAAUsS,OACnCiB,IAAS,SAASlzE,GACvB,IAAIu9D,EAAUnsE,KACd,OAAOqpF,EAAU1I,GAAW,SAASrU,GACnC,OAAO76D,GAAM66D,EAAUH,EAASv9D,EAClC,GACF,GACF,GACF,CAWA,SAAS06E,GAAcp3F,EAAQq3F,GAG7B,IAAIC,GAFJD,EAAQA,IAAUp3F,EAAY,IAAMsxF,GAAa8F,IAEzBr3F,OACxB,GAAIs3F,EAAc,EAChB,OAAOA,EAAc3H,GAAW0H,EAAOr3F,GAAUq3F,EAEnD,IAAIvyF,EAAS6qF,GAAW0H,EAAOrX,GAAWhgF,EAASw9E,GAAW6Z,KAC9D,OAAOra,GAAWqa,GACd7E,GAAU7U,GAAc74E,GAAS,EAAG9E,GAAQkP,KAAK,IACjDpK,EAAOL,MAAM,EAAGzE,EACtB,CA4CA,SAASu3F,GAAY9b,GACnB,OAAO,SAASrlD,EAAO83C,EAAKspB,GAa1B,OAZIA,GAAuB,iBAARA,GAAoBrD,GAAe/9D,EAAO83C,EAAKspB,KAChEtpB,EAAMspB,EAAOv3F,GAGfm2B,EAAQqhE,GAASrhE,GACb83C,IAAQjuE,GACViuE,EAAM93C,EACNA,EAAQ,GAER83C,EAAMupB,GAASvpB,GA57CrB,SAAmB93C,EAAO83C,EAAKspB,EAAM/b,GAKnC,IAJA,IAAIh6D,GAAS,EACTzhB,EAAS2gF,GAAUX,IAAY9R,EAAM93C,IAAUohE,GAAQ,IAAK,GAC5D1yF,EAASsJ,EAAMpO,GAEZA,KACL8E,EAAO22E,EAAYz7E,IAAWyhB,GAAS2U,EACvCA,GAASohE,EAEX,OAAO1yF,CACT,CAq7CW4yF,CAAUthE,EAAO83C,EADxBspB,EAAOA,IAASv3F,EAAam2B,EAAQ83C,EAAM,GAAK,EAAKupB,GAASD,GAC3B/b,EACrC,CACF,CASA,SAASkc,GAA0BX,GACjC,OAAO,SAASvqF,EAAOo4B,GAKrB,MAJsB,iBAATp4B,GAAqC,iBAATo4B,IACvCp4B,EAAQmrF,GAASnrF,GACjBo4B,EAAQ+yD,GAAS/yD,IAEZmyD,EAASvqF,EAAOo4B,EACzB,CACF,CAmBA,SAAS2xD,GAAcx3E,EAAMumE,EAASsS,EAAUxa,EAAapD,EAAS6Y,EAAUC,EAAS8C,EAAQC,EAAKC,GACpG,IAAI+B,EArxKc,EAqxKJvS,EAMdA,GAAYuS,EAAUzmB,EAAoBC,EA5xKlB,GA6xKxBiU,KAAauS,EAAUxmB,EAA0BD,MAG/CkU,IAAW,GAEb,IAAIhzB,EAAU,CACZvzC,EAAMumE,EAAStL,EAVC6d,EAAUhF,EAAW7yF,EAFtB63F,EAAU/E,EAAU9yF,EAGd63F,EAAU73F,EAAY6yF,EAFvBgF,EAAU73F,EAAY8yF,EAYzB8C,EAAQC,EAAKC,GAG5BjxF,EAAS+yF,EAASt4E,MAAMtf,EAAWsyD,GAKvC,OAJIijC,GAAWx2E,IACb+4E,GAAQjzF,EAAQytD,GAElBztD,EAAOu4E,YAAcA,EACd2a,GAAgBlzF,EAAQka,EAAMumE,EACvC,CASA,SAAS0S,GAAY3D,GACnB,IAAIt1E,EAAO6O,GAAKymE,GAChB,OAAO,SAASjwF,EAAQ6zF,GAGtB,GAFA7zF,EAASuzF,GAASvzF,IAClB6zF,EAAyB,MAAbA,EAAoB,EAAItX,GAAUuX,GAAUD,GAAY,OACnD3X,GAAel8E,GAAS,CAGvC,IAAI+zF,GAAQ1tE,GAASrmB,GAAU,KAAK9D,MAAM,KAI1C,SADA63F,GAAQ1tE,GAFI1L,EAAKo5E,EAAK,GAAK,MAAQA,EAAK,GAAKF,KAEnB,KAAK33F,MAAM,MACvB,GAAK,MAAQ63F,EAAK,GAAKF,GACvC,CACA,OAAOl5E,EAAK3a,EACd,CACF,CASA,IAAIotF,GAAc52E,IAAQ,EAAIyiE,GAAW,IAAIziE,GAAI,CAAC,EAAE,KAAK,IAAO42D,EAAmB,SAASt3D,GAC1F,OAAO,IAAIU,GAAIV,EACjB,EAF4Ek+E,GAW5E,SAASC,GAAc/O,GACrB,OAAO,SAASnpE,GACd,IAAI9d,EAAMujF,GAAOzlE,GACjB,OAAI9d,GAAO+vE,EACF4K,GAAW78D,GAEhB9d,GAAOowE,EACF6K,GAAWn9D,GAn6I1B,SAAqBA,EAAQnI,GAC3B,OAAO4iE,GAAS5iE,GAAO,SAAShT,GAC9B,MAAO,CAACA,EAAKmb,EAAOnb,GACtB,GACF,CAi6IaszF,CAAYn4E,EAAQmpE,EAASnpE,GACtC,CACF,CA2BA,SAASo4E,GAAWx5E,EAAMumE,EAAStL,EAAS6Y,EAAUC,EAAS8C,EAAQC,EAAKC,GAC1E,IAAIG,EAl4KiB,EAk4KL3Q,EAChB,IAAK2Q,GAA4B,mBAARl3E,EACvB,MAAM,IAAI/B,GAAUg0D,GAEtB,IAAIjxE,EAAS8yF,EAAWA,EAAS9yF,OAAS,EAS1C,GARKA,IACHulF,IAAW,GACXuN,EAAWC,EAAU9yF,GAEvB61F,EAAMA,IAAQ71F,EAAY61F,EAAMnV,GAAUwX,GAAUrC,GAAM,GAC1DC,EAAQA,IAAU91F,EAAY81F,EAAQoC,GAAUpC,GAChD/1F,GAAU+yF,EAAUA,EAAQ/yF,OAAS,EAEjCulF,EAAUjU,EAAyB,CACrC,IAAIqkB,EAAgB7C,EAChB8C,EAAe7C,EAEnBD,EAAWC,EAAU9yF,CACvB,CACA,IAAI+T,EAAOkiF,EAAYj2F,EAAYs1F,GAAQv2E,GAEvCuzC,EAAU,CACZvzC,EAAMumE,EAAStL,EAAS6Y,EAAUC,EAAS4C,EAAeC,EAC1DC,EAAQC,EAAKC,GAkBf,GAfI/hF,GA26BN,SAAmBA,EAAMnD,GACvB,IAAI00E,EAAUvxE,EAAK,GACfykF,EAAa5nF,EAAO,GACpB6nF,EAAanT,EAAUkT,EACvB9Q,EAAW+Q,EAAa,IAExBC,EACAF,GAAclnB,GA50MA,GA40MmBgU,GACjCkT,GAAclnB,GAAmBgU,GAAW/T,GAAqBx9D,EAAK,GAAGhU,QAAU6Q,EAAO,IAC5E,KAAd4nF,GAAqD5nF,EAAO,GAAG7Q,QAAU6Q,EAAO,IA90MlE,GA80M0E00E,EAG5F,IAAMoC,IAAYgR,EAChB,OAAO3kF,EAr1MQ,EAw1MbykF,IACFzkF,EAAK,GAAKnD,EAAO,GAEjB6nF,GA31Me,EA21MDnT,EAA2B,EAz1MnB,GA41MxB,IAAI94E,EAAQoE,EAAO,GACnB,GAAIpE,EAAO,CACT,IAAIqmF,EAAW9+E,EAAK,GACpBA,EAAK,GAAK8+E,EAAWD,GAAYC,EAAUrmF,EAAOoE,EAAO,IAAMpE,EAC/DuH,EAAK,GAAK8+E,EAAW1V,GAAeppE,EAAK,GAAIm9D,GAAetgE,EAAO,EACrE,EAEApE,EAAQoE,EAAO,MAEbiiF,EAAW9+E,EAAK,GAChBA,EAAK,GAAK8+E,EAAWU,GAAiBV,EAAUrmF,EAAOoE,EAAO,IAAMpE,EACpEuH,EAAK,GAAK8+E,EAAW1V,GAAeppE,EAAK,GAAIm9D,GAAetgE,EAAO,KAGrEpE,EAAQoE,EAAO,MAEbmD,EAAK,GAAKvH,GAGRgsF,EAAalnB,IACfv9D,EAAK,GAAgB,MAAXA,EAAK,GAAanD,EAAO,GAAK+vE,GAAU5sE,EAAK,GAAInD,EAAO,KAGrD,MAAXmD,EAAK,KACPA,EAAK,GAAKnD,EAAO,IAGnBmD,EAAK,GAAKnD,EAAO,GACjBmD,EAAK,GAAK0kF,CAGZ,CA/9BIE,CAAUrmC,EAASv+C,GAErBgL,EAAOuzC,EAAQ,GACfgzB,EAAUhzB,EAAQ,GAClB0nB,EAAU1nB,EAAQ,GAClBugC,EAAWvgC,EAAQ,GACnBwgC,EAAUxgC,EAAQ,KAClBwjC,EAAQxjC,EAAQ,GAAKA,EAAQ,KAAOtyD,EAC/Bi2F,EAAY,EAAIl3E,EAAKhf,OACtB2gF,GAAUpuB,EAAQ,GAAKvyD,EAAQ,KAEX,GAAVulF,IACZA,IAAW,IAERA,GA56KY,GA46KDA,EAGdzgF,EA56KgB,GA26KPygF,GAA8BA,GAAWnU,EApgBtD,SAAqBpyD,EAAMumE,EAASwQ,GAClC,IAAIxP,EAAOoO,GAAW31E,GAwBtB,OAtBA,SAASo2E,IAMP,IALA,IAAIp1F,EAASD,UAAUC,OACnB0c,EAAOtO,EAAMpO,GACbyhB,EAAQzhB,EACRq9E,EAAc+Y,GAAUhB,GAErB3zE,KACL/E,EAAK+E,GAAS1hB,UAAU0hB,GAE1B,IAAIsxE,EAAW/yF,EAAS,GAAK0c,EAAK,KAAO2gE,GAAe3gE,EAAK1c,EAAS,KAAOq9E,EACzE,GACAD,GAAe1gE,EAAM2gE,GAGzB,OADAr9E,GAAU+yF,EAAQ/yF,QACL+1F,EACJS,GACLx3E,EAAMumE,EAASmQ,GAAcN,EAAQ/X,YAAap9E,EAClDyc,EAAMq2E,EAAS9yF,EAAWA,EAAW81F,EAAQ/1F,GAG1Cuf,GADGzR,MAAQA,OAAS6mC,IAAQ7mC,gBAAgBsnF,EAAW7O,EAAOvnE,EACpDlR,KAAM4O,EACzB,CAEF,CA2eam8E,CAAY75E,EAAMumE,EAASwQ,GAC1BxQ,GAAWlU,GAAgC,IAAXkU,GAAqDwN,EAAQ/yF,OAG9F01F,GAAan2E,MAAMtf,EAAWsyD,GA9O3C,SAAuBvzC,EAAMumE,EAAStL,EAAS6Y,GAC7C,IAAImD,EAtsKa,EAssKJ1Q,EACTgB,EAAOoO,GAAW31E,GAkBtB,OAhBA,SAASo2E,IAQP,IAPA,IAAInC,GAAa,EACbC,EAAanzF,UAAUC,OACvBozF,GAAa,EACbC,EAAaP,EAAS9yF,OACtB0c,EAAOtO,EAAMilF,EAAaH,GAC1Bn+E,EAAMjH,MAAQA,OAAS6mC,IAAQ7mC,gBAAgBsnF,EAAW7O,EAAOvnE,IAE5Do0E,EAAYC,GACnB32E,EAAK02E,GAAaN,EAASM,GAE7B,KAAOF,KACLx2E,EAAK02E,KAAerzF,YAAYkzF,GAElC,OAAO1zE,GAAMxK,EAAIkhF,EAAShc,EAAUnsE,KAAM4O,EAC5C,CAEF,CAuNao8E,CAAc95E,EAAMumE,EAAStL,EAAS6Y,QAJ/C,IAAIhuF,EAhmBR,SAAoBka,EAAMumE,EAAStL,GACjC,IAAIgc,EA90Ja,EA80JJ1Q,EACTgB,EAAOoO,GAAW31E,GAMtB,OAJA,SAASo2E,IAEP,OADUtnF,MAAQA,OAAS6mC,IAAQ7mC,gBAAgBsnF,EAAW7O,EAAOvnE,GAC3DO,MAAM02E,EAAShc,EAAUnsE,KAAM/N,UAC3C,CAEF,CAulBiBg5F,CAAW/5E,EAAMumE,EAAStL,GASzC,OAAO+d,IADMhkF,EAAOk8E,GAAc6H,IACJjzF,EAAQytD,GAAUvzC,EAAMumE,EACxD,CAcA,SAASyT,GAAuBpU,EAAU8H,EAAUznF,EAAKmb,GACvD,OAAIwkE,IAAa3kF,GACZwkF,GAAGG,EAAUxG,GAAYn5E,MAAU8L,GAAe6D,KAAKwL,EAAQnb,GAC3DynF,EAEF9H,CACT,CAgBA,SAASqU,GAAoBrU,EAAU8H,EAAUznF,EAAKmb,EAAQvP,EAAQge,GAOpE,OANIpZ,GAASmvE,IAAanvE,GAASi3E,KAEjC79D,EAAM5V,IAAIyzE,EAAU9H,GACpBmJ,GAAUnJ,EAAU8H,EAAUzsF,EAAWg5F,GAAqBpqE,GAC9DA,EAAc,OAAE69D,IAEX9H,CACT,CAWA,SAASsU,GAAgBzsF,GACvB,OAAO2hF,GAAc3hF,GAASxM,EAAYwM,CAC5C,CAeA,SAAS0+E,GAAY9zC,EAAOxS,EAAO0gD,EAASC,EAAYmF,EAAW97D,GACjE,IAAIw8D,EApgLmB,EAogLP9F,EACZkR,EAAYp/C,EAAMr3C,OAClBmqF,EAAYtlD,EAAM7kC,OAEtB,GAAIy2F,GAAatM,KAAekB,GAAalB,EAAYsM,GACvD,OAAO,EAGT,IAAI0C,EAAatqE,EAAM7sB,IAAIq1C,GACvB00C,EAAal9D,EAAM7sB,IAAI6iC,GAC3B,GAAIs0D,GAAcpN,EAChB,OAAOoN,GAAct0D,GAASknD,GAAc10C,EAE9C,IAAI51B,GAAS,EACT3c,GAAS,EACTylF,EAlhLqB,EAkhLbhF,EAAoC,IAAIlC,GAAWpjF,EAM/D,IAJA4uB,EAAM5V,IAAIo+B,EAAOxS,GACjBhW,EAAM5V,IAAI4rB,EAAOwS,KAGR51B,EAAQg1E,GAAW,CAC1B,IAAI2C,EAAW/hD,EAAM51B,GACjBwqE,EAAWpnD,EAAMpjB,GAErB,GAAI+jE,EACF,IAAI0G,EAAWb,EACX7F,EAAWyG,EAAUmN,EAAU33E,EAAOojB,EAAOwS,EAAOxoB,GACpD22D,EAAW4T,EAAUnN,EAAUxqE,EAAO41B,EAAOxS,EAAOhW,GAE1D,GAAIq9D,IAAajsF,EAAW,CAC1B,GAAIisF,EACF,SAEFpnF,GAAS,EACT,KACF,CAEA,GAAIylF,GACF,IAAKrP,GAAUr2C,GAAO,SAASonD,EAAU7B,GACnC,IAAK7N,GAASgO,EAAMH,KACfgP,IAAanN,GAAYtB,EAAUyO,EAAUnN,EAAU1G,EAASC,EAAY32D,IAC/E,OAAO07D,EAAK5lF,KAAKylF,EAErB,IAAI,CACNtlF,GAAS,EACT,KACF,OACK,GACDs0F,IAAanN,IACXtB,EAAUyO,EAAUnN,EAAU1G,EAASC,EAAY32D,GACpD,CACL/pB,GAAS,EACT,KACF,CACF,CAGA,OAFA+pB,EAAc,OAAEwoB,GAChBxoB,EAAc,OAAEgW,GACT//B,CACT,CAyKA,SAASkwF,GAASh2E,GAChB,OAAO6wE,GAAYC,GAAS9wE,EAAM/e,EAAWo5F,IAAUr6E,EAAO,GAChE,CASA,SAASsoE,GAAWlnE,GAClB,OAAOkpE,GAAelpE,EAAQ7b,GAAM8hF,GACtC,CAUA,SAASgB,GAAajnE,GACpB,OAAOkpE,GAAelpE,EAAQ+lE,GAAQF,GACxC,CASA,IAAIsP,GAAWpU,GAAiB,SAASniE,GACvC,OAAOmiE,GAAQn/E,IAAIgd,EACrB,EAFyBq5E,GAWzB,SAAShD,GAAYr2E,GAKnB,IAJA,IAAIla,EAAUka,EAAK9e,KAAO,GACtBm3C,EAAQ+pC,GAAUt8E,GAClB9E,EAAS+Q,GAAe6D,KAAKwsE,GAAWt8E,GAAUuyC,EAAMr3C,OAAS,EAE9DA,KAAU,CACf,IAAIgU,EAAOqjC,EAAMr3C,GACbs5F,EAAYtlF,EAAKgL,KACrB,GAAiB,MAAbs6E,GAAqBA,GAAat6E,EACpC,OAAOhL,EAAK9T,IAEhB,CACA,OAAO4E,CACT,CASA,SAASsxF,GAAUp3E,GAEjB,OADajO,GAAe6D,KAAKktE,GAAQ,eAAiBA,GAAS9iE,GACrDq+D,WAChB,CAaA,SAASsR,KACP,IAAI7pF,EAASg9E,GAAO1H,UAAYA,GAEhC,OADAt1E,EAASA,IAAWs1E,GAAWyS,GAAe/nF,EACvC/E,UAAUC,OAAS8E,EAAO/E,UAAU,GAAIA,UAAU,IAAM+E,CACjE,CAUA,SAASkjF,GAAWphF,EAAK3B,GACvB,IAAI+O,EAAOpN,EAAI08E,SACf,OA+XF,SAAmB72E,GACjB,IAAIC,SAAcD,EAClB,MAAgB,UAARC,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAVD,EACU,OAAVA,CACP,CApYS8sF,CAAUt0F,GACb+O,EAAmB,iBAAP/O,EAAkB,SAAW,QACzC+O,EAAKpN,GACX,CASA,SAAS8mF,GAAattE,GAIpB,IAHA,IAAItb,EAASP,GAAK6b,GACdpgB,EAAS8E,EAAO9E,OAEbA,KAAU,CACf,IAAIiF,EAAMH,EAAO9E,GACbyM,EAAQ2T,EAAOnb,GAEnBH,EAAO9E,GAAU,CAACiF,EAAKwH,EAAOohF,GAAmBphF,GACnD,CACA,OAAO3H,CACT,CAUA,SAAS86E,GAAUx/D,EAAQnb,GACzB,IAAIwH,EAlxJR,SAAkB2T,EAAQnb,GACxB,OAAiB,MAAVmb,EAAiBngB,EAAYmgB,EAAOnb,EAC7C,CAgxJgB0tC,CAASvyB,EAAQnb,GAC7B,OAAO2nF,GAAangF,GAASA,EAAQxM,CACvC,CAoCA,IAAIomF,GAAclG,GAA+B,SAAS//D,GACxD,OAAc,MAAVA,EACK,IAETA,EAAS9b,GAAO8b,GACTo6D,GAAY2F,GAAiB//D,IAAS,SAAS6mE,GACpD,OAAO5H,GAAqBzqE,KAAKwL,EAAQ6mE,EAC3C,IACF,EARqCuS,GAiBjCvT,GAAgB9F,GAA+B,SAAS//D,GAE1D,IADA,IAAItb,EAAS,GACNsb,GACL06D,GAAUh2E,EAAQuhF,GAAWjmE,IAC7BA,EAAS8+D,GAAa9+D,GAExB,OAAOtb,CACT,EAPuC00F,GAgBnC3T,GAAS4D,GA2Eb,SAASgQ,GAAQr5E,EAAQujB,EAAM+1D,GAO7B,IAJA,IAAIj4E,GAAS,EACTzhB,GAHJ2jC,EAAOylD,GAASzlD,EAAMvjB,IAGJpgB,OACd8E,GAAS,IAEJ2c,EAAQzhB,GAAQ,CACvB,IAAIiF,EAAMokF,GAAM1lD,EAAKliB,IACrB,KAAM3c,EAAmB,MAAVsb,GAAkBs5E,EAAQt5E,EAAQnb,IAC/C,MAEFmb,EAASA,EAAOnb,EAClB,CACA,OAAIH,KAAY2c,GAASzhB,EAChB8E,KAET9E,EAAmB,MAAVogB,EAAiB,EAAIA,EAAOpgB,SAClB25F,GAAS35F,IAAWgkF,GAAQ/+E,EAAKjF,KACjDqO,GAAQ+R,IAAWwjE,GAAYxjE,GACpC,CA4BA,SAAS4lE,GAAgB5lE,GACvB,MAAqC,mBAAtBA,EAAOlQ,aAA8Bi9E,GAAY/sE,GAE5D,CAAC,EADD+hE,GAAWjD,GAAa9+D,GAE9B,CA4EA,SAASyoE,GAAcp8E,GACrB,OAAO4B,GAAQ5B,IAAUm3E,GAAYn3E,OAChC6yE,IAAoB7yE,GAASA,EAAM6yE,IAC1C,CAUA,SAAS0E,GAAQv3E,EAAOzM,GACtB,IAAI0M,SAAcD,EAGlB,SAFAzM,EAAmB,MAAVA,EAAiB0xE,EAAmB1xE,KAGlC,UAAR0M,GACU,UAARA,GAAoB4oE,GAAStiE,KAAKvG,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQzM,CACjD,CAYA,SAASm0F,GAAe1nF,EAAOgV,EAAOrB,GACpC,IAAK3K,GAAS2K,GACZ,OAAO,EAET,IAAI1T,SAAc+U,EAClB,SAAY,UAAR/U,EACK+gF,GAAYrtE,IAAW4jE,GAAQviE,EAAOrB,EAAOpgB,QACrC,UAAR0M,GAAoB+U,KAASrB,IAE7BqkE,GAAGrkE,EAAOqB,GAAQhV,EAG7B,CAUA,SAASmhF,GAAMnhF,EAAO2T,GACpB,GAAI/R,GAAQ5B,GACV,OAAO,EAET,IAAIC,SAAcD,EAClB,QAAY,UAARC,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATD,IAAiB+7E,GAAS/7E,MAGvB2nE,GAAcphE,KAAKvG,KAAW0nE,GAAanhE,KAAKvG,IAC1C,MAAV2T,GAAkB3T,KAASnI,GAAO8b,GACvC,CAwBA,SAASo1E,GAAWx2E,GAClB,IAAIs2E,EAAWD,GAAYr2E,GACvB6lB,EAAQi9C,GAAOwT,GAEnB,GAAoB,mBAATzwD,KAAyBywD,KAAYtT,GAAYzuE,WAC1D,OAAO,EAET,GAAIyL,IAAS6lB,EACX,OAAO,EAET,IAAI7wB,EAAOuhF,GAAQ1wD,GACnB,QAAS7wB,GAAQgL,IAAShL,EAAK,EACjC,EA9SKitE,IAAY4E,GAAO,IAAI5E,GAAS,IAAI2Y,YAAY,MAAQ7mB,GACxDv6D,IAAOqtE,GAAO,IAAIrtE,KAAQ65D,GAC1B3/D,IAAWmzE,GAAOnzE,GAAQF,YAAcggE,GACxC33D,IAAOgrE,GAAO,IAAIhrE,KAAQ63D,GAC1Bt0D,IAAWynE,GAAO,IAAIznE,KAAYy0D,KACrCgT,GAAS,SAASp5E,GAChB,IAAI3H,EAAS2kF,GAAWh9E,GACpB85E,EAAOzhF,GAAUytE,EAAY9lE,EAAMyD,YAAcjQ,EACjD45F,EAAatT,EAAOjF,GAASiF,GAAQ,GAEzC,GAAIsT,EACF,OAAQA,GACN,KAAKxY,GAAoB,OAAOtO,EAChC,KAAKwO,GAAe,OAAOlP,EAC3B,KAAKmP,GAAmB,OAAOhP,EAC/B,KAAKiP,GAAe,OAAO/O,EAC3B,KAAKgP,GAAmB,OAAO7O,EAGnC,OAAO/tE,CACT,GA8SF,IAAIg1F,GAAazb,GAAa6K,GAAa6Q,GAS3C,SAAS5M,GAAY1gF,GACnB,IAAI85E,EAAO95E,GAASA,EAAMyD,YAG1B,OAAOzD,KAFqB,mBAAR85E,GAAsBA,EAAKhzE,WAAc6qE,GAG/D,CAUA,SAASyP,GAAmBphF,GAC1B,OAAOA,IAAUA,IAAUgJ,GAAShJ,EACtC,CAWA,SAASkhF,GAAwB1oF,EAAKynF,GACpC,OAAO,SAAStsE,GACd,OAAc,MAAVA,IAGGA,EAAOnb,KAASynF,IACpBA,IAAazsF,GAAcgF,KAAOX,GAAO8b,IAC9C,CACF,CAoIA,SAAS0vE,GAAS9wE,EAAMoX,EAAO+mD,GAE7B,OADA/mD,EAAQuqD,GAAUvqD,IAAUn2B,EAAa+e,EAAKhf,OAAS,EAAKo2B,EAAO,GAC5D,WAML,IALA,IAAI1Z,EAAO3c,UACP0hB,GAAS,EACTzhB,EAAS2gF,GAAUjkE,EAAK1c,OAASo2B,EAAO,GACxCihB,EAAQjpC,EAAMpO,KAETyhB,EAAQzhB,GACfq3C,EAAM51B,GAAS/E,EAAK0Z,EAAQ3U,GAE9BA,GAAS,EAET,IADA,IAAIu4E,EAAY5rF,EAAMgoB,EAAQ,KACrB3U,EAAQ2U,GACf4jE,EAAUv4E,GAAS/E,EAAK+E,GAG1B,OADAu4E,EAAU5jE,GAAS+mD,EAAU9lC,GACtB93B,GAAMP,EAAMlR,KAAMksF,EAC3B,CACF,CAUA,SAASpiC,GAAOx3C,EAAQujB,GACtB,OAAOA,EAAK3jC,OAAS,EAAIogB,EAAS+oE,GAAQ/oE,EAAQkwE,GAAU3sD,EAAM,GAAI,GACxE,CAgCA,SAAS9uB,GAAQuL,EAAQnb,GACvB,IAAY,gBAARA,GAAgD,oBAAhBmb,EAAOnb,KAIhC,aAAPA,EAIJ,OAAOmb,EAAOnb,EAChB,CAgBA,IAAI8yF,GAAUkC,GAAS/J,IAUnBtoF,GAAam4E,IAAiB,SAAS/gE,EAAMyoE,GAC/C,OAAO9yC,GAAK/sC,WAAWoX,EAAMyoE,EAC/B,EAUIoI,GAAcoK,GAAS9J,IAY3B,SAAS6H,GAAgB5C,EAAS8E,EAAW3U,GAC3C,IAAI10E,EAAUqpF,EAAY,GAC1B,OAAOrK,GAAYuF,EA1brB,SAA2BvkF,EAAQspF,GACjC,IAAIn6F,EAASm6F,EAAQn6F,OACrB,IAAKA,EACH,OAAO6Q,EAET,IAAI4sE,EAAYz9E,EAAS,EAGzB,OAFAm6F,EAAQ1c,IAAcz9E,EAAS,EAAI,KAAO,IAAMm6F,EAAQ1c,GACxD0c,EAAUA,EAAQjrF,KAAKlP,EAAS,EAAI,KAAO,KACpC6Q,EAAOP,QAAQokE,GAAe,uBAAyBylB,EAAU,SAC1E,CAib8BC,CAAkBvpF,EAqHhD,SAA2BspF,EAAS5U,GAOlC,OANAlL,GAAUxI,GAAW,SAASumB,GAC5B,IAAI3rF,EAAQ,KAAO2rF,EAAK,GACnB7S,EAAU6S,EAAK,KAAQ1d,GAAcyf,EAAS1tF,IACjD0tF,EAAQx1F,KAAK8H,EAEjB,IACO0tF,EAAQx6E,MACjB,CA7HwD06E,CAtjBxD,SAAwBxpF,GACtB,IAAIY,EAAQZ,EAAOY,MAAMkjE,IACzB,OAAOljE,EAAQA,EAAM,GAAGlR,MAAMq0E,IAAkB,EAClD,CAmjB0E0lB,CAAezpF,GAAS00E,IAClG,CAWA,SAAS0U,GAASj7E,GAChB,IAAInV,EAAQ,EACR0wF,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQ3Z,KACRjxB,EApiNK,IAoiNmB4qC,EAAQD,GAGpC,GADAA,EAAaC,EACT5qC,EAAY,GACd,KAAM/lD,GAziNE,IA0iNN,OAAO9J,UAAU,QAGnB8J,EAAQ,EAEV,OAAOmV,EAAKO,MAAMtf,EAAWF,UAC/B,CACF,CAUA,SAASqkF,GAAY/sC,EAAOte,GAC1B,IAAItX,GAAS,EACTzhB,EAASq3C,EAAMr3C,OACfy9E,EAAYz9E,EAAS,EAGzB,IADA+4B,EAAOA,IAAS94B,EAAYD,EAAS+4B,IAC5BtX,EAAQsX,GAAM,CACrB,IAAI0hE,EAAOvW,GAAWziE,EAAOg8D,GACzBhxE,EAAQ4qC,EAAMojD,GAElBpjD,EAAMojD,GAAQpjD,EAAM51B,GACpB41B,EAAM51B,GAAShV,CACjB,CAEA,OADA4qC,EAAMr3C,OAAS+4B,EACRse,CACT,CASA,IAAIi7C,GAvTJ,SAAuBtzE,GACrB,IAAIla,EAAS41F,GAAQ17E,GAAM,SAAS/Z,GAIlC,OAh0MiB,MA6zMbmqD,EAAMr2B,MACRq2B,EAAM7O,QAEDt7C,CACT,IAEImqD,EAAQtqD,EAAOsqD,MACnB,OAAOtqD,CACT,CA6SmB61F,EAAc,SAASxe,GACxC,IAAIr3E,EAAS,GAOb,OAN6B,KAAzBq3E,EAAO7uE,WAAW,IACpBxI,EAAOH,KAAK,IAEdw3E,EAAO7rE,QAAQ+jE,IAAY,SAAS5iE,EAAOpN,EAAQu2F,EAAOC,GACxD/1F,EAAOH,KAAKi2F,EAAQC,EAAUvqF,QAAQykE,GAAc,MAAS1wE,GAAUoN,EACzE,IACO3M,CACT,IASA,SAASukF,GAAM58E,GACb,GAAoB,iBAATA,GAAqB+7E,GAAS/7E,GACvC,OAAOA,EAET,IAAI3H,EAAU2H,EAAQ,GACtB,MAAkB,KAAV3H,GAAkB,EAAI2H,IAAU,IAAa,KAAO3H,CAC9D,CASA,SAASw8E,GAAStiE,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOs/D,GAAa1pE,KAAKoK,EAC3B,CAAE,MAAOxO,GAAI,CACb,IACE,OAAQwO,EAAO,EACjB,CAAE,MAAOxO,GAAI,CACf,CACA,MAAO,EACT,CA2BA,SAAS0xE,GAAakT,GACpB,GAAIA,aAAmBpT,GACrB,OAAOoT,EAAQ0F,QAEjB,IAAIh2F,EAAS,IAAIm9E,GAAcmT,EAAQ7S,YAAa6S,EAAQ3S,WAI5D,OAHA39E,EAAO09E,YAAc6B,GAAU+Q,EAAQ5S,aACvC19E,EAAO49E,UAAa0S,EAAQ1S,UAC5B59E,EAAO69E,WAAayS,EAAQzS,WACrB79E,CACT,CAqIA,IAAIi2F,GAAanL,IAAS,SAASv4C,EAAOl9B,GACxC,OAAOg0E,GAAkB92C,GACrBqwC,GAAerwC,EAAOqxC,GAAYvuE,EAAQ,EAAGg0E,IAAmB,IAChE,EACN,IA4BI6M,GAAepL,IAAS,SAASv4C,EAAOl9B,GAC1C,IAAIigE,EAAW9gB,GAAKn/C,GAIpB,OAHIg0E,GAAkB/T,KACpBA,EAAWn6E,GAENkuF,GAAkB92C,GACrBqwC,GAAerwC,EAAOqxC,GAAYvuE,EAAQ,EAAGg0E,IAAmB,GAAOQ,GAAYvU,EAAU,IAC7F,EACN,IAyBI6gB,GAAiBrL,IAAS,SAASv4C,EAAOl9B,GAC5C,IAAI4zB,EAAaurB,GAAKn/C,GAItB,OAHIg0E,GAAkBpgD,KACpBA,EAAa9tC,GAERkuF,GAAkB92C,GACrBqwC,GAAerwC,EAAOqxC,GAAYvuE,EAAQ,EAAGg0E,IAAmB,GAAOluF,EAAW8tC,GAClF,EACN,IAqOA,SAASma,GAAU7Q,EAAO+N,EAAWo2B,GACnC,IAAIx7E,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIyhB,EAAqB,MAAb+5D,EAAoB,EAAI2c,GAAU3c,GAI9C,OAHI/5D,EAAQ,IACVA,EAAQk/D,GAAU3gF,EAASyhB,EAAO,IAE7B85D,GAAclkC,EAAOs3C,GAAYvpC,EAAW,GAAI3jC,EACzD,CAqCA,SAASy5E,GAAc7jD,EAAO+N,EAAWo2B,GACvC,IAAIx7E,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIyhB,EAAQzhB,EAAS,EAOrB,OANIw7E,IAAcv7E,IAChBwhB,EAAQ02E,GAAU3c,GAClB/5D,EAAQ+5D,EAAY,EAChBmF,GAAU3gF,EAASyhB,EAAO,GAC1Bm/D,GAAUn/D,EAAOzhB,EAAS,IAEzBu7E,GAAclkC,EAAOs3C,GAAYvpC,EAAW,GAAI3jC,GAAO,EAChE,CAgBA,SAAS43E,GAAQhiD,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMr3C,QACvB0oF,GAAYrxC,EAAO,GAAK,EAC1C,CA+FA,SAAS8jD,GAAK9jD,GACZ,OAAQA,GAASA,EAAMr3C,OAAUq3C,EAAM,GAAKp3C,CAC9C,CAyEA,IAAIm7F,GAAexL,IAAS,SAAS1F,GACnC,IAAImR,EAASxgB,GAASqP,EAAQkI,IAC9B,OAAQiJ,EAAOr7F,QAAUq7F,EAAO,KAAOnR,EAAO,GAC1CD,GAAiBoR,GACjB,EACN,IAyBIC,GAAiB1L,IAAS,SAAS1F,GACrC,IAAI9P,EAAW9gB,GAAK4wB,GAChBmR,EAASxgB,GAASqP,EAAQkI,IAO9B,OALIhY,IAAa9gB,GAAK+hC,GACpBjhB,EAAWn6E,EAEXo7F,EAAOtyE,MAEDsyE,EAAOr7F,QAAUq7F,EAAO,KAAOnR,EAAO,GAC1CD,GAAiBoR,EAAQ1M,GAAYvU,EAAU,IAC/C,EACN,IAuBImhB,GAAmB3L,IAAS,SAAS1F,GACvC,IAAIn8C,EAAaurB,GAAK4wB,GAClBmR,EAASxgB,GAASqP,EAAQkI,IAM9B,OAJArkD,EAAkC,mBAAdA,EAA2BA,EAAa9tC,IAE1Do7F,EAAOtyE,MAEDsyE,EAAOr7F,QAAUq7F,EAAO,KAAOnR,EAAO,GAC1CD,GAAiBoR,EAAQp7F,EAAW8tC,GACpC,EACN,IAmCA,SAASurB,GAAKjiB,GACZ,IAAIr3C,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,OAAOA,EAASq3C,EAAMr3C,EAAS,GAAKC,CACtC,CAsFA,IAAIu7F,GAAO5L,GAAS6L,IAsBpB,SAASA,GAAQpkD,EAAOl9B,GACtB,OAAQk9B,GAASA,EAAMr3C,QAAUma,GAAUA,EAAOna,OAC9CsvF,GAAYj4C,EAAOl9B,GACnBk9B,CACN,CAoFA,IAAIqkD,GAAS1G,IAAS,SAAS39C,EAAOm4C,GACpC,IAAIxvF,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACnC8E,EAASogF,GAAO7tC,EAAOm4C,GAM3B,OAJAD,GAAWl4C,EAAOwjC,GAAS2U,GAAS,SAAS/tE,GAC3C,OAAOuiE,GAAQviE,EAAOzhB,IAAWyhB,EAAQA,CAC3C,IAAG9B,KAAKuvE,KAEDpqF,CACT,IA0EA,SAASupB,GAAQgpB,GACf,OAAgB,MAATA,EAAgBA,EAAQ2pC,GAAcpsE,KAAKyiC,EACpD,CAiaA,IAAIskD,GAAQ/L,IAAS,SAAS1F,GAC5B,OAAOsH,GAAS9I,GAAYwB,EAAQ,EAAGiE,IAAmB,GAC5D,IAyBIyN,GAAUhM,IAAS,SAAS1F,GAC9B,IAAI9P,EAAW9gB,GAAK4wB,GAIpB,OAHIiE,GAAkB/T,KACpBA,EAAWn6E,GAENuxF,GAAS9I,GAAYwB,EAAQ,EAAGiE,IAAmB,GAAOQ,GAAYvU,EAAU,GACzF,IAuBIyhB,GAAYjM,IAAS,SAAS1F,GAChC,IAAIn8C,EAAaurB,GAAK4wB,GAEtB,OADAn8C,EAAkC,mBAAdA,EAA2BA,EAAa9tC,EACrDuxF,GAAS9I,GAAYwB,EAAQ,EAAGiE,IAAmB,GAAOluF,EAAW8tC,EAC9E,IA+FA,SAAS+tD,GAAMzkD,GACb,IAAMA,IAASA,EAAMr3C,OACnB,MAAO,GAET,IAAIA,EAAS,EAOb,OANAq3C,EAAQmjC,GAAYnjC,GAAO,SAAS0kD,GAClC,GAAI5N,GAAkB4N,GAEpB,OADA/7F,EAAS2gF,GAAUob,EAAM/7F,OAAQA,IAC1B,CAEX,IACOi8E,GAAUj8E,GAAQ,SAASyhB,GAChC,OAAOo5D,GAASxjC,EAAO+jC,GAAa35D,GACtC,GACF,CAuBA,SAASu6E,GAAU3kD,EAAO+iC,GACxB,IAAM/iC,IAASA,EAAMr3C,OACnB,MAAO,GAET,IAAI8E,EAASg3F,GAAMzkD,GACnB,OAAgB,MAAZ+iC,EACKt1E,EAEF+1E,GAAS/1E,GAAQ,SAASi3F,GAC/B,OAAOx8E,GAAM66D,EAAUn6E,EAAW87F,EACpC,GACF,CAsBA,IAAIE,GAAUrM,IAAS,SAASv4C,EAAOl9B,GACrC,OAAOg0E,GAAkB92C,GACrBqwC,GAAerwC,EAAOl9B,GACtB,EACN,IAoBI+hF,GAAMtM,IAAS,SAAS1F,GAC1B,OAAO8H,GAAQxX,GAAY0P,EAAQiE,IACrC,IAyBIgO,GAAQvM,IAAS,SAAS1F,GAC5B,IAAI9P,EAAW9gB,GAAK4wB,GAIpB,OAHIiE,GAAkB/T,KACpBA,EAAWn6E,GAEN+xF,GAAQxX,GAAY0P,EAAQiE,IAAoBQ,GAAYvU,EAAU,GAC/E,IAuBIgiB,GAAUxM,IAAS,SAAS1F,GAC9B,IAAIn8C,EAAaurB,GAAK4wB,GAEtB,OADAn8C,EAAkC,mBAAdA,EAA2BA,EAAa9tC,EACrD+xF,GAAQxX,GAAY0P,EAAQiE,IAAoBluF,EAAW8tC,EACpE,IAkBIsuD,GAAMzM,GAASkM,IA6DnB,IAAIQ,GAAU1M,IAAS,SAAS1F,GAC9B,IAAIlqF,EAASkqF,EAAOlqF,OAChBo6E,EAAWp6E,EAAS,EAAIkqF,EAAOlqF,EAAS,GAAKC,EAGjD,OADAm6E,EAA8B,mBAAZA,GAA0B8P,EAAOnhE,MAAOqxD,GAAYn6E,EAC/D+7F,GAAU9R,EAAQ9P,EAC3B,IAiCA,SAASmiB,GAAM9vF,GACb,IAAI3H,EAASg9E,GAAOr1E,GAEpB,OADA3H,EAAO29E,WAAY,EACZ39E,CACT,CAqDA,SAASqwF,GAAK1oF,EAAO+vF,GACnB,OAAOA,EAAY/vF,EACrB,CAkBA,IAAIgwF,GAAYzH,IAAS,SAASvkB,GAChC,IAAIzwE,EAASywE,EAAMzwE,OACfo2B,EAAQp2B,EAASywE,EAAM,GAAK,EAC5BhkE,EAAQqB,KAAKy0E,YACbia,EAAc,SAASp8E,GAAU,OAAO8kE,GAAO9kE,EAAQqwD,EAAQ,EAEnE,QAAIzwE,EAAS,GAAK8N,KAAK00E,YAAYxiF,SAC7ByM,aAAiBu1E,IAAiBgC,GAAQ5tD,KAGhD3pB,EAAQA,EAAMhI,MAAM2xB,GAAQA,GAASp2B,EAAS,EAAI,KAC5CwiF,YAAY79E,KAAK,CACrB,KAAQwwF,GACR,KAAQ,CAACqH,GACT,QAAWv8F,IAEN,IAAIgiF,GAAcx1E,EAAOqB,KAAK20E,WAAW0S,MAAK,SAAS99C,GAI5D,OAHIr3C,IAAWq3C,EAAMr3C,QACnBq3C,EAAM1yC,KAAK1E,GAENo3C,CACT,KAbSvpC,KAAKqnF,KAAKqH,EAcrB,IAiPA,IAAIE,GAAU7I,IAAiB,SAAS/uF,EAAQ2H,EAAOxH,GACjD8L,GAAe6D,KAAK9P,EAAQG,KAC5BH,EAAOG,GAETy/E,GAAgB5/E,EAAQG,EAAK,EAEjC,IAqIA,IAAI0jB,GAAOksE,GAAW3sC,IAqBlBy0C,GAAW9H,GAAWqG,IA2G1B,SAASlxF,GAAQk3C,EAAYk5B,GAE3B,OADW/rE,GAAQ6yC,GAAcm5B,GAAY0K,IACjC7jC,EAAYytC,GAAYvU,EAAU,GAChD,CAsBA,SAASwiB,GAAa17C,EAAYk5B,GAEhC,OADW/rE,GAAQ6yC,GAAco5B,GAAiB8N,IACtClnC,EAAYytC,GAAYvU,EAAU,GAChD,CAyBA,IAAIyiB,GAAUhJ,IAAiB,SAAS/uF,EAAQ2H,EAAOxH,GACjD8L,GAAe6D,KAAK9P,EAAQG,GAC9BH,EAAOG,GAAKN,KAAK8H,GAEjBi4E,GAAgB5/E,EAAQG,EAAK,CAACwH,GAElC,IAoEA,IAAIqwF,GAAYlN,IAAS,SAAS1uC,EAAYvd,EAAMjnB,GAClD,IAAI+E,GAAS,EACTqkE,EAAwB,mBAARniD,EAChB7+B,EAAS2oF,GAAYvsC,GAAc9yC,EAAM8yC,EAAWlhD,QAAU,GAKlE,OAHA+kF,GAAS7jC,GAAY,SAASz0C,GAC5B3H,IAAS2c,GAASqkE,EAASvmE,GAAMokB,EAAMl3B,EAAOiQ,GAAQ8tE,GAAW/9E,EAAOk3B,EAAMjnB,EAChF,IACO5X,CACT,IA8BIi4F,GAAQlJ,IAAiB,SAAS/uF,EAAQ2H,EAAOxH,GACnDy/E,GAAgB5/E,EAAQG,EAAKwH,EAC/B,IA4CA,SAAS7F,GAAIs6C,EAAYk5B,GAEvB,OADW/rE,GAAQ6yC,GAAc25B,GAAW2S,IAChCtsC,EAAYytC,GAAYvU,EAAU,GAChD,CAiFA,IAAI4iB,GAAYnJ,IAAiB,SAAS/uF,EAAQ2H,EAAOxH,GACvDH,EAAOG,EAAM,EAAI,GAAGN,KAAK8H,EAC3B,IAAG,WAAa,MAAO,CAAC,GAAI,GAAK,IAmSjC,IAAIwwF,GAASrN,IAAS,SAAS1uC,EAAYutC,GACzC,GAAkB,MAAdvtC,EACF,MAAO,GAET,IAAIlhD,EAASyuF,EAAUzuF,OAMvB,OALIA,EAAS,GAAKm0F,GAAejzC,EAAYutC,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHzuF,EAAS,GAAKm0F,GAAe1F,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBD,GAAYttC,EAAYwnC,GAAY+F,EAAW,GAAI,GAC5D,IAoBIlyE,GAAMujE,IAAU,WAClB,OAAOnrC,GAAK3zC,KAAKub,KACnB,EAyDA,SAASu5E,GAAI92E,EAAMpI,EAAGs9E,GAGpB,OAFAt9E,EAAIs9E,EAAQj0F,EAAY2W,EACxBA,EAAKoI,GAAa,MAALpI,EAAaoI,EAAKhf,OAAS4W,EACjC4hF,GAAWx5E,EAAMuyD,EAAetxE,EAAWA,EAAWA,EAAWA,EAAW2W,EACrF,CAmBA,SAASsmF,GAAOtmF,EAAGoI,GACjB,IAAIla,EACJ,GAAmB,mBAARka,EACT,MAAM,IAAI/B,GAAUg0D,GAGtB,OADAr6D,EAAIuhF,GAAUvhF,GACP,WAOL,QANMA,EAAI,IACR9R,EAASka,EAAKO,MAAMzR,KAAM/N,YAExB6W,GAAK,IACPoI,EAAO/e,GAEF6E,CACT,CACF,CAqCA,IAAIknB,GAAO4jE,IAAS,SAAS5wE,EAAMi7D,EAAS6Y,GAC1C,IAAIvN,EAv4Ta,EAw4TjB,GAAIuN,EAAS9yF,OAAQ,CACnB,IAAI+yF,EAAU3V,GAAe0V,EAAUsD,GAAUpqE,KACjDu5D,GAAWlU,CACb,CACA,OAAOmnB,GAAWx5E,EAAMumE,EAAStL,EAAS6Y,EAAUC,EACtD,IA+CIoK,GAAUvN,IAAS,SAASxvE,EAAQnb,EAAK6tF,GAC3C,IAAIvN,EAAU6X,EACd,GAAItK,EAAS9yF,OAAQ,CACnB,IAAI+yF,EAAU3V,GAAe0V,EAAUsD,GAAU+G,KACjD5X,GAAWlU,CACb,CACA,OAAOmnB,GAAWvzF,EAAKsgF,EAASnlE,EAAQ0yE,EAAUC,EACpD,IAqJA,SAASsK,GAASr+E,EAAMyoE,EAAMjuE,GAC5B,IAAI8jF,EACAC,EACAC,EACA14F,EACA24F,EACAC,EACAC,EAAiB,EACjBC,GAAU,EACVC,GAAS,EACTtJ,GAAW,EAEf,GAAmB,mBAARv1E,EACT,MAAM,IAAI/B,GAAUg0D,GAUtB,SAAS6sB,EAAW/uE,GAClB,IAAIrS,EAAO4gF,EACPrjB,EAAUsjB,EAKd,OAHAD,EAAWC,EAAWt9F,EACtB09F,EAAiB5uE,EACjBjqB,EAASka,EAAKO,MAAM06D,EAASv9D,EAE/B,CAqBA,SAASqhF,EAAahvE,GACpB,IAAIivE,EAAoBjvE,EAAO2uE,EAM/B,OAAQA,IAAiBz9F,GAAc+9F,GAAqBvW,GACzDuW,EAAoB,GAAOH,GANJ9uE,EAAO4uE,GAM8BH,CACjE,CAEA,SAASS,IACP,IAAIlvE,EAAOxS,KACX,GAAIwhF,EAAahvE,GACf,OAAOmvE,EAAanvE,GAGtB0uE,EAAU71F,GAAWq2F,EA3BvB,SAAuBlvE,GACrB,IAEIovE,EAAc1W,GAFM14D,EAAO2uE,GAI/B,OAAOG,EACHjd,GAAUud,EAAaX,GAJDzuE,EAAO4uE,IAK7BQ,CACN,CAmBqCC,CAAcrvE,GACnD,CAEA,SAASmvE,EAAanvE,GAKpB,OAJA0uE,EAAUx9F,EAINs0F,GAAY+I,EACPQ,EAAW/uE,IAEpBuuE,EAAWC,EAAWt9F,EACf6E,EACT,CAcA,SAASu5F,IACP,IAAItvE,EAAOxS,KACP+hF,EAAaP,EAAahvE,GAM9B,GAJAuuE,EAAWv9F,UACXw9F,EAAWzvF,KACX4vF,EAAe3uE,EAEXuvE,EAAY,CACd,GAAIb,IAAYx9F,EACd,OAzEN,SAAqB8uB,GAMnB,OAJA4uE,EAAiB5uE,EAEjB0uE,EAAU71F,GAAWq2F,EAAcxW,GAE5BmW,EAAUE,EAAW/uE,GAAQjqB,CACtC,CAkEay5F,CAAYb,GAErB,GAAIG,EAIF,OAFAloE,GAAa8nE,GACbA,EAAU71F,GAAWq2F,EAAcxW,GAC5BqW,EAAWJ,EAEtB,CAIA,OAHID,IAAYx9F,IACdw9F,EAAU71F,GAAWq2F,EAAcxW,IAE9B3iF,CACT,CAGA,OA3GA2iF,EAAOmQ,GAASnQ,IAAS,EACrBhyE,GAAS+D,KACXokF,IAAYpkF,EAAQokF,QAEpBJ,GADAK,EAAS,YAAarkF,GACHmnE,GAAUiX,GAASp+E,EAAQgkF,UAAY,EAAG/V,GAAQ+V,EACrEjJ,EAAW,aAAc/6E,IAAYA,EAAQ+6E,SAAWA,GAoG1D8J,EAAUG,OApCV,WACMf,IAAYx9F,GACd01B,GAAa8nE,GAEfE,EAAiB,EACjBL,EAAWI,EAAeH,EAAWE,EAAUx9F,CACjD,EA+BAo+F,EAAUI,MA7BV,WACE,OAAOhB,IAAYx9F,EAAY6E,EAASo5F,EAAa3hF,KACvD,EA4BO8hF,CACT,CAoBA,IAAIK,GAAQ9O,IAAS,SAAS5wE,EAAMtC,GAClC,OAAO8qE,GAAUxoE,EAAM,EAAGtC,EAC5B,IAqBIiiF,GAAQ/O,IAAS,SAAS5wE,EAAMyoE,EAAM/qE,GACxC,OAAO8qE,GAAUxoE,EAAM44E,GAASnQ,IAAS,EAAG/qE,EAC9C,IAoEA,SAASg+E,GAAQ17E,EAAM4/E,GACrB,GAAmB,mBAAR5/E,GAAmC,MAAZ4/E,GAAuC,mBAAZA,EAC3D,MAAM,IAAI3hF,GAAUg0D,GAEtB,IAAI4tB,EAAW,WACb,IAAIniF,EAAO3c,UACPkF,EAAM25F,EAAWA,EAASr/E,MAAMzR,KAAM4O,GAAQA,EAAK,GACnD0yC,EAAQyvC,EAASzvC,MAErB,GAAIA,EAAMr2C,IAAI9T,GACZ,OAAOmqD,EAAMptD,IAAIiD,GAEnB,IAAIH,EAASka,EAAKO,MAAMzR,KAAM4O,GAE9B,OADAmiF,EAASzvC,MAAQA,EAAMn2C,IAAIhU,EAAKH,IAAWsqD,EACpCtqD,CACT,EAEA,OADA+5F,EAASzvC,MAAQ,IAAKsrC,GAAQoE,OAAS1b,IAChCyb,CACT,CAyBA,SAASE,GAAO35C,GACd,GAAwB,mBAAbA,EACT,MAAM,IAAInoC,GAAUg0D,GAEtB,OAAO,WACL,IAAIv0D,EAAO3c,UACX,OAAQ2c,EAAK1c,QACX,KAAK,EAAG,OAAQolD,EAAUxwC,KAAK9G,MAC/B,KAAK,EAAG,OAAQs3C,EAAUxwC,KAAK9G,KAAM4O,EAAK,IAC1C,KAAK,EAAG,OAAQ0oC,EAAUxwC,KAAK9G,KAAM4O,EAAK,GAAIA,EAAK,IACnD,KAAK,EAAG,OAAQ0oC,EAAUxwC,KAAK9G,KAAM4O,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE9D,OAAQ0oC,EAAU7lC,MAAMzR,KAAM4O,EAChC,CACF,CApCAg+E,GAAQoE,MAAQ1b,GA2FhB,IAAI4b,GAAWzM,IAAS,SAASvzE,EAAMigF,GAKrC,IAAIC,GAJJD,EAAmC,GAArBA,EAAWj/F,QAAeqO,GAAQ4wF,EAAW,IACvDpkB,GAASokB,EAAW,GAAI5iB,GAAUsS,OAClC9T,GAAS6N,GAAYuW,EAAY,GAAI5iB,GAAUsS,QAEtB3uF,OAC7B,OAAO4vF,IAAS,SAASlzE,GAIvB,IAHA,IAAI+E,GAAS,EACTzhB,EAAS4gF,GAAUlkE,EAAK1c,OAAQk/F,KAE3Bz9E,EAAQzhB,GACf0c,EAAK+E,GAASw9E,EAAWx9E,GAAO7M,KAAK9G,KAAM4O,EAAK+E,IAElD,OAAOlC,GAAMP,EAAMlR,KAAM4O,EAC3B,GACF,IAmCIyiF,GAAUvP,IAAS,SAAS5wE,EAAM8zE,GACpC,IAAIC,EAAU3V,GAAe0V,EAAUsD,GAAU+I,KACjD,OAAO3G,GAAWx5E,EAAMqyD,EAAmBpxE,EAAW6yF,EAAUC,EAClE,IAkCIqM,GAAexP,IAAS,SAAS5wE,EAAM8zE,GACzC,IAAIC,EAAU3V,GAAe0V,EAAUsD,GAAUgJ,KACjD,OAAO5G,GAAWx5E,EAAMsyD,EAAyBrxE,EAAW6yF,EAAUC,EACxE,IAwBIsM,GAAQrK,IAAS,SAASh2E,EAAMwwE,GAClC,OAAOgJ,GAAWx5E,EAAMwyD,EAAiBvxE,EAAWA,EAAWA,EAAWuvF,EAC5E,IAgaA,SAAS/K,GAAGh4E,EAAOo4B,GACjB,OAAOp4B,IAAUo4B,GAAUp4B,IAAUA,GAASo4B,IAAUA,CAC1D,CAyBA,IAAIy6D,GAAK3H,GAA0B7N,IAyB/ByV,GAAM5H,IAA0B,SAASlrF,EAAOo4B,GAClD,OAAOp4B,GAASo4B,CAClB,IAoBI++C,GAAc6G,GAAgB,WAAa,OAAO1qF,SAAW,CAA/B,IAAsC0qF,GAAkB,SAASh+E,GACjG,OAAOs1E,GAAat1E,IAAUsE,GAAe6D,KAAKnI,EAAO,YACtD4yE,GAAqBzqE,KAAKnI,EAAO,SACtC,EAyBI4B,GAAUD,EAAMC,QAmBhBirE,GAAgBD,GAAoBgD,GAAUhD,IA75PlD,SAA2B5sE,GACzB,OAAOs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAUqmE,CACrD,EAs7PA,SAAS2a,GAAYhhF,GACnB,OAAgB,MAATA,GAAiBktF,GAASltF,EAAMzM,UAAYkpF,GAAWz8E,EAChE,CA2BA,SAAS0hF,GAAkB1hF,GACzB,OAAOs1E,GAAat1E,IAAUghF,GAAYhhF,EAC5C,CAyCA,IAAI6zE,GAAWD,IAAkB0Z,GAmB7BvgB,GAASD,GAAa8C,GAAU9C,IAxgQpC,SAAoB9sE,GAClB,OAAOs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAUwlE,CACrD,EA8qQA,SAASutB,GAAQ/yF,GACf,IAAKs1E,GAAat1E,GAChB,OAAO,EAET,IAAInK,EAAMmnF,GAAWh9E,GACrB,OAAOnK,GAAO4vE,GA9yWF,yBA8yWc5vE,GACC,iBAAjBmK,EAAMO,SAA4C,iBAAdP,EAAMvM,OAAqBkuF,GAAc3hF,EACzF,CAiDA,SAASy8E,GAAWz8E,GAClB,IAAKgJ,GAAShJ,GACZ,OAAO,EAIT,IAAInK,EAAMmnF,GAAWh9E,GACrB,OAAOnK,GAAO6vE,GAAW7vE,GAAO8vE,GA32WrB,0BA22W+B9vE,GA/1W/B,kBA+1WkDA,CAC/D,CA4BA,SAASm9F,GAAUhzF,GACjB,MAAuB,iBAATA,GAAqBA,GAAS0rF,GAAU1rF,EACxD,CA4BA,SAASktF,GAASltF,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASilE,CAC7C,CA2BA,SAASj8D,GAAShJ,GAChB,IAAIC,SAAcD,EAClB,OAAgB,MAATA,IAA0B,UAARC,GAA4B,YAARA,EAC/C,CA0BA,SAASq1E,GAAat1E,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,CAmBA,IAAIitE,GAAQD,GAAY4C,GAAU5C,IA5xQlC,SAAmBhtE,GACjB,OAAOs1E,GAAat1E,IAAUo5E,GAAOp5E,IAAU4lE,CACjD,EA4+QA,SAASqtB,GAASjzF,GAChB,MAAuB,iBAATA,GACXs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAU6lE,CACjD,CA8BA,SAAS8b,GAAc3hF,GACrB,IAAKs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAU8lE,EAC/C,OAAO,EAET,IAAI6P,EAAQlD,GAAazyE,GACzB,GAAc,OAAV21E,EACF,OAAO,EAET,IAAImE,EAAOx1E,GAAe6D,KAAKwtE,EAAO,gBAAkBA,EAAMlyE,YAC9D,MAAsB,mBAARq2E,GAAsBA,aAAgBA,GAClDjI,GAAa1pE,KAAK2xE,IAAS3H,EAC/B,CAmBA,IAAIhF,GAAWD,GAAe0C,GAAU1C,IA59QxC,SAAsBltE,GACpB,OAAOs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAUgmE,CACrD,EA4gRA,IAAIqH,GAAQD,GAAYwC,GAAUxC,IAngRlC,SAAmBptE,GACjB,OAAOs1E,GAAat1E,IAAUo5E,GAAOp5E,IAAUimE,CACjD,EAohRA,SAASitB,GAASlzF,GAChB,MAAuB,iBAATA,IACV4B,GAAQ5B,IAAUs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAUkmE,CACpE,CAmBA,SAAS6V,GAAS/7E,GAChB,MAAuB,iBAATA,GACXs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAUmmE,CACjD,CAmBA,IAAIoH,GAAeD,GAAmBsC,GAAUtC,IAvjRhD,SAA0BttE,GACxB,OAAOs1E,GAAat1E,IAClBktF,GAASltF,EAAMzM,WAAak4E,GAAeuR,GAAWh9E,GAC1D,EA4oRA,IAAImzF,GAAKjI,GAA0BpK,IAyB/BsS,GAAMlI,IAA0B,SAASlrF,EAAOo4B,GAClD,OAAOp4B,GAASo4B,CAClB,IAyBA,SAASi7D,GAAQrzF,GACf,IAAKA,EACH,MAAO,GAET,GAAIghF,GAAYhhF,GACd,OAAOkzF,GAASlzF,GAASkxE,GAAclxE,GAAS43E,GAAU53E,GAE5D,GAAI+yE,IAAe/yE,EAAM+yE,IACvB,OAv8VN,SAAyBxnC,GAIvB,IAHA,IAAIhkC,EACAlP,EAAS,KAEJkP,EAAOgkC,EAAS7B,QAAQt2B,MAC/B/a,EAAOH,KAAKqP,EAAKvH,OAEnB,OAAO3H,CACT,CA+7Vai7F,CAAgBtzF,EAAM+yE,OAE/B,IAAIl9E,EAAMujF,GAAOp5E,GAGjB,OAFWnK,GAAO+vE,EAAS4K,GAAc36E,GAAOowE,EAAS4K,GAAanjE,IAE1D1N,EACd,CAyBA,SAASgrF,GAAShrF,GAChB,OAAKA,GAGLA,EAAQmrF,GAASnrF,MACHglE,GAAYhlE,KAAU,IAxkYtB,uBAykYAA,EAAQ,GAAK,EAAI,GAGxBA,IAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,CA4BA,SAAS0rF,GAAU1rF,GACjB,IAAI3H,EAAS2yF,GAAShrF,GAClBuzF,EAAYl7F,EAAS,EAEzB,OAAOA,IAAWA,EAAUk7F,EAAYl7F,EAASk7F,EAAYl7F,EAAU,CACzE,CA6BA,SAASm7F,GAASxzF,GAChB,OAAOA,EAAQ63E,GAAU6T,GAAU1rF,GAAQ,EAAGmlE,GAAoB,CACpE,CAyBA,SAASgmB,GAASnrF,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAI+7E,GAAS/7E,GACX,OAAOklE,EAET,GAAIl8D,GAAShJ,GAAQ,CACnB,IAAIo4B,EAAgC,mBAAjBp4B,EAAM0b,QAAwB1b,EAAM0b,UAAY1b,EACnEA,EAAQgJ,GAASovB,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAATp4B,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQyvE,GAASzvE,GACjB,IAAIyzF,EAAW/qB,GAAWniE,KAAKvG,GAC/B,OAAQyzF,GAAY7qB,GAAUriE,KAAKvG,GAC/B6rE,GAAa7rE,EAAMhI,MAAM,GAAIy7F,EAAW,EAAI,GAC3ChrB,GAAWliE,KAAKvG,GAASklE,GAAOllE,CACvC,CA0BA,SAAS4hF,GAAc5hF,GACrB,OAAOw4E,GAAWx4E,EAAO05E,GAAO15E,GAClC,CAqDA,SAASie,GAASje,GAChB,OAAgB,MAATA,EAAgB,GAAK8kF,GAAa9kF,EAC3C,CAoCA,IAAIoY,GAASkvE,IAAe,SAAS3zE,EAAQvP,GAC3C,GAAIs8E,GAAYt8E,IAAW48E,GAAY58E,GACrCo0E,GAAWp0E,EAAQtM,GAAKsM,GAASuP,QAGnC,IAAK,IAAInb,KAAO4L,EACVE,GAAe6D,KAAK/D,EAAQ5L,IAC9B0/E,GAAYvkE,EAAQnb,EAAK4L,EAAO5L,GAGtC,IAiCIk7F,GAAWpM,IAAe,SAAS3zE,EAAQvP,GAC7Co0E,GAAWp0E,EAAQs1E,GAAOt1E,GAASuP,EACrC,IA+BIggF,GAAerM,IAAe,SAAS3zE,EAAQvP,EAAQm9E,EAAUxI,GACnEP,GAAWp0E,EAAQs1E,GAAOt1E,GAASuP,EAAQolE,EAC7C,IA8BI6a,GAAatM,IAAe,SAAS3zE,EAAQvP,EAAQm9E,EAAUxI,GACjEP,GAAWp0E,EAAQtM,GAAKsM,GAASuP,EAAQolE,EAC3C,IAmBI8a,GAAKtL,GAAS9P,IA8DlB,IAAIlH,GAAW4R,IAAS,SAASxvE,EAAQ6zE,GACvC7zE,EAAS9b,GAAO8b,GAEhB,IAAIqB,GAAS,EACTzhB,EAASi0F,EAAQj0F,OACjBk0F,EAAQl0F,EAAS,EAAIi0F,EAAQ,GAAKh0F,EAMtC,IAJIi0F,GAASC,GAAeF,EAAQ,GAAIA,EAAQ,GAAIC,KAClDl0F,EAAS,KAGFyhB,EAAQzhB,GAMf,IALA,IAAI6Q,EAASojF,EAAQxyE,GACjBxJ,EAAQkuE,GAAOt1E,GACf0vF,GAAc,EACdC,EAAcvoF,EAAMjY,SAEfugG,EAAaC,GAAa,CACjC,IAAIv7F,EAAMgT,EAAMsoF,GACZ9zF,EAAQ2T,EAAOnb,IAEfwH,IAAUxM,GACTwkF,GAAGh4E,EAAO2xE,GAAYn5E,MAAU8L,GAAe6D,KAAKwL,EAAQnb,MAC/Dmb,EAAOnb,GAAO4L,EAAO5L,GAEzB,CAGF,OAAOmb,CACT,IAqBIqgF,GAAe7Q,IAAS,SAASlzE,GAEnC,OADAA,EAAK/X,KAAK1E,EAAWg5F,IACd15E,GAAMmhF,GAAWzgG,EAAWyc,EACrC,IA+RA,SAAS1a,GAAIoe,EAAQujB,EAAMszD,GACzB,IAAInyF,EAAmB,MAAVsb,EAAiBngB,EAAYkpF,GAAQ/oE,EAAQujB,GAC1D,OAAO7+B,IAAW7E,EAAYg3F,EAAenyF,CAC/C,CA2DA,SAASgpF,GAAM1tE,EAAQujB,GACrB,OAAiB,MAAVvjB,GAAkBq5E,GAAQr5E,EAAQujB,EAAMqmD,GACjD,CAoBA,IAAI2W,GAAS/J,IAAe,SAAS9xF,EAAQ2H,EAAOxH,GACrC,MAATwH,GACyB,mBAAlBA,EAAMie,WACfje,EAAQkyE,GAAqB/pE,KAAKnI,IAGpC3H,EAAO2H,GAASxH,CAClB,GAAGmrF,GAAStD,KA4BR8T,GAAWhK,IAAe,SAAS9xF,EAAQ2H,EAAOxH,GACvC,MAATwH,GACyB,mBAAlBA,EAAMie,WACfje,EAAQkyE,GAAqB/pE,KAAKnI,IAGhCsE,GAAe6D,KAAK9P,EAAQ2H,GAC9B3H,EAAO2H,GAAO9H,KAAKM,GAEnBH,EAAO2H,GAAS,CAACxH,EAErB,GAAG0pF,IAoBCkS,GAASjR,GAASpF,IA8BtB,SAASjmF,GAAK6b,GACZ,OAAOqtE,GAAYrtE,GAAUojE,GAAcpjE,GAAU8sE,GAAS9sE,EAChE,CAyBA,SAAS+lE,GAAO/lE,GACd,OAAOqtE,GAAYrtE,GAAUojE,GAAcpjE,GAAQ,GAAQgtE,GAAWhtE,EACxE,CAsGA,IAAIqhB,GAAQsyD,IAAe,SAAS3zE,EAAQvP,EAAQm9E,GAClDD,GAAU3tE,EAAQvP,EAAQm9E,EAC5B,IAiCI0S,GAAY3M,IAAe,SAAS3zE,EAAQvP,EAAQm9E,EAAUxI,GAChEuI,GAAU3tE,EAAQvP,EAAQm9E,EAAUxI,EACtC,IAsBIsb,GAAO9L,IAAS,SAAS50E,EAAQqwD,GACnC,IAAI3rE,EAAS,CAAC,EACd,GAAc,MAAVsb,EACF,OAAOtb,EAET,IAAI2gF,GAAS,EACbhV,EAAQoK,GAASpK,GAAO,SAAS9sC,GAG/B,OAFAA,EAAOylD,GAASzlD,EAAMvjB,GACtBqlE,IAAWA,EAAS9hD,EAAK3jC,OAAS,GAC3B2jC,CACT,IACAshD,GAAW7kE,EAAQinE,GAAajnE,GAAStb,GACrC2gF,IACF3gF,EAASwgF,GAAUxgF,EAAQi8F,EAAwD7H,KAGrF,IADA,IAAIl5F,EAASywE,EAAMzwE,OACZA,KACL0vF,GAAU5qF,EAAQ2rE,EAAMzwE,IAE1B,OAAO8E,CACT,IA2CA,IAAIm5E,GAAO+W,IAAS,SAAS50E,EAAQqwD,GACnC,OAAiB,MAAVrwD,EAAiB,CAAC,EAnmT3B,SAAkBA,EAAQqwD,GACxB,OAAO2e,GAAWhvE,EAAQqwD,GAAO,SAAShkE,EAAOk3B,GAC/C,OAAOmqD,GAAM1tE,EAAQujB,EACvB,GACF,CA+lT+Bq9D,CAAS5gF,EAAQqwD,EAChD,IAoBA,SAASwwB,GAAO7gF,EAAQglC,GACtB,GAAc,MAAVhlC,EACF,MAAO,CAAC,EAEV,IAAInI,EAAQ4iE,GAASwM,GAAajnE,IAAS,SAAStP,GAClD,MAAO,CAACA,EACV,IAEA,OADAs0C,EAAYupC,GAAYvpC,GACjBgqC,GAAWhvE,EAAQnI,GAAO,SAASxL,EAAOk3B,GAC/C,OAAOyhB,EAAU34C,EAAOk3B,EAAK,GAC/B,GACF,CA0IA,IAAIu9D,GAAU5I,GAAc/zF,IA0BxB48F,GAAY7I,GAAcnS,IA4K9B,SAAShsE,GAAOiG,GACd,OAAiB,MAAVA,EAAiB,GAAKk8D,GAAWl8D,EAAQ7b,GAAK6b,GACvD,CAiNA,IAAIghF,GAAY5M,IAAiB,SAAS1vF,EAAQu8F,EAAM5/E,GAEtD,OADA4/E,EAAOA,EAAK7yE,cACL1pB,GAAU2c,EAAQ6/E,GAAWD,GAAQA,EAC9C,IAiBA,SAASC,GAAWnlB,GAClB,OAAOolB,GAAW72E,GAASyxD,GAAQ3tD,cACrC,CAoBA,SAASkmE,GAAOvY,GAEd,OADAA,EAASzxD,GAASyxD,KACDA,EAAO7rE,QAAQilE,GAASqH,IAActsE,QAAQqnE,GAAa,GAC9E,CAqHA,IAAI6pB,GAAYhN,IAAiB,SAAS1vF,EAAQu8F,EAAM5/E,GACtD,OAAO3c,GAAU2c,EAAQ,IAAM,IAAM4/E,EAAK7yE,aAC5C,IAsBIizE,GAAYjN,IAAiB,SAAS1vF,EAAQu8F,EAAM5/E,GACtD,OAAO3c,GAAU2c,EAAQ,IAAM,IAAM4/E,EAAK7yE,aAC5C,IAmBIkzE,GAAarN,GAAgB,eA0NjC,IAAIsN,GAAYnN,IAAiB,SAAS1vF,EAAQu8F,EAAM5/E,GACtD,OAAO3c,GAAU2c,EAAQ,IAAM,IAAM4/E,EAAK7yE,aAC5C,IA+DA,IAAIozE,GAAYpN,IAAiB,SAAS1vF,EAAQu8F,EAAM5/E,GACtD,OAAO3c,GAAU2c,EAAQ,IAAM,IAAM8/E,GAAWF,EAClD,IAqiBA,IAAIQ,GAAYrN,IAAiB,SAAS1vF,EAAQu8F,EAAM5/E,GACtD,OAAO3c,GAAU2c,EAAQ,IAAM,IAAM4/E,EAAK/qC,aAC5C,IAmBIirC,GAAalN,GAAgB,eAqBjC,SAASI,GAAMtY,EAAQ5N,EAAS2lB,GAI9B,OAHA/X,EAASzxD,GAASyxD,IAClB5N,EAAU2lB,EAAQj0F,EAAYsuE,KAEdtuE,EArybpB,SAAwBk8E,GACtB,OAAOpE,GAAiB/kE,KAAKmpE,EAC/B,CAoyba2lB,CAAe3lB,GA1jb5B,SAAsBA,GACpB,OAAOA,EAAO1qE,MAAMomE,KAAkB,EACxC,CAwjbsCkqB,CAAa5lB,GAzrcnD,SAAoBA,GAClB,OAAOA,EAAO1qE,MAAMojE,KAAgB,EACtC,CAurc6DmtB,CAAW7lB,GAE7DA,EAAO1qE,MAAM88D,IAAY,EAClC,CA0BA,IAAI0zB,GAAUrS,IAAS,SAAS5wE,EAAMtC,GACpC,IACE,OAAO6C,GAAMP,EAAM/e,EAAWyc,EAChC,CAAE,MAAOlM,GACP,OAAOgvF,GAAQhvF,GAAKA,EAAI,IAAItD,GAAMsD,EACpC,CACF,IA4BI0xF,GAAUlN,IAAS,SAAS50E,EAAQ+hF,GAKtC,OAJA9nB,GAAU8nB,GAAa,SAASl9F,GAC9BA,EAAMokF,GAAMpkF,GACZy/E,GAAgBtkE,EAAQnb,EAAK+mB,GAAK5L,EAAOnb,GAAMmb,GACjD,IACOA,CACT,IAoGA,SAASgwE,GAAS3jF,GAChB,OAAO,WACL,OAAOA,CACT,CACF,CAgDA,IAAI21F,GAAOrN,KAuBPsN,GAAYtN,IAAW,GAkB3B,SAASjI,GAASrgF,GAChB,OAAOA,CACT,CA4CA,SAAS2tE,GAASp7D,GAChB,OAAO6tE,GAA4B,mBAAR7tE,EAAqBA,EAAOsmE,GAAUtmE,EAjte/C,GAktepB,CAsGA,IAAI3S,GAASujF,IAAS,SAASjsD,EAAMjnB,GACnC,OAAO,SAAS0D,GACd,OAAOoqE,GAAWpqE,EAAQujB,EAAMjnB,EAClC,CACF,IAyBI4lF,GAAW1S,IAAS,SAASxvE,EAAQ1D,GACvC,OAAO,SAASinB,GACd,OAAO6mD,GAAWpqE,EAAQujB,EAAMjnB,EAClC,CACF,IAsCA,SAAS6lF,GAAMniF,EAAQvP,EAAQ2I,GAC7B,IAAIvB,EAAQ1T,GAAKsM,GACbsxF,EAAclZ,GAAcp4E,EAAQoH,GAEzB,MAAXuB,GACE/D,GAAS5E,KAAYsxF,EAAYniG,SAAWiY,EAAMjY,UACtDwZ,EAAU3I,EACVA,EAASuP,EACTA,EAAStS,KACTq0F,EAAclZ,GAAcp4E,EAAQtM,GAAKsM,KAE3C,IAAI0rF,IAAU9mF,GAAS+D,IAAY,UAAWA,MAAcA,EAAQ+iF,MAChEzW,EAASoD,GAAW9oE,GAqBxB,OAnBAi6D,GAAU8nB,GAAa,SAAS7N,GAC9B,IAAIt1E,EAAOnO,EAAOyjF,GAClBl0E,EAAOk0E,GAAct1E,EACjB8mE,IACF1lE,EAAO7M,UAAU+gF,GAAc,WAC7B,IAAIhS,EAAWx0E,KAAK20E,UACpB,GAAI8Z,GAASja,EAAU,CACrB,IAAIx9E,EAASsb,EAAOtS,KAAKy0E,aAKzB,OAJcz9E,EAAO09E,YAAc6B,GAAUv2E,KAAK00E,cAE1C79E,KAAK,CAAE,KAAQqa,EAAM,KAAQjf,UAAW,QAAWqgB,IAC3Dtb,EAAO29E,UAAYH,EACZx9E,CACT,CACA,OAAOka,EAAKO,MAAMa,EAAQ06D,GAAU,CAAChtE,KAAKrB,SAAU1M,WACtD,EAEJ,IAEOqgB,CACT,CAkCA,SAASi4E,KACP,CAgDF,IAAImK,GAAOtL,GAAWrc,IA8BlB4nB,GAAYvL,GAAW3c,IAiCvBmoB,GAAWxL,GAAWhc,IAwB1B,SAAS+R,GAAStpD,GAChB,OAAOiqD,GAAMjqD,GAAQy3C,GAAaiO,GAAM1lD,IAh3X1C,SAA0BA,GACxB,OAAO,SAASvjB,GACd,OAAO+oE,GAAQ/oE,EAAQujB,EACzB,CACF,CA42XmDg/D,CAAiBh/D,EACpE,CAsEA,IAAIi/D,GAAQrL,KAsCRsL,GAAatL,IAAY,GAoB7B,SAASiC,KACP,MAAO,EACT,CAeA,SAASO,KACP,OAAO,CACT,CA8JA,IAAIj/E,GAAMi8E,IAAoB,SAAS+L,EAAQC,GAC7C,OAAOD,EAASC,CAClB,GAAG,GAuBC9iB,GAAOgY,GAAY,QAiBnB+K,GAASjM,IAAoB,SAASkM,EAAUC,GAClD,OAAOD,EAAWC,CACpB,GAAG,GAuBCj1E,GAAQgqE,GAAY,SAwKxB,IAAIkL,GAAWpM,IAAoB,SAASqM,EAAYC,GACtD,OAAOD,EAAaC,CACtB,GAAG,GAuBCl1E,GAAQ8pE,GAAY,SAiBpBqL,GAAWvM,IAAoB,SAASwM,EAASC,GACnD,OAAOD,EAAUC,CACnB,GAAG,GAgmBH,OA1iBA1hB,GAAO2hB,MAp6MP,SAAe7sF,EAAGoI,GAChB,GAAmB,mBAARA,EACT,MAAM,IAAI/B,GAAUg0D,GAGtB,OADAr6D,EAAIuhF,GAAUvhF,GACP,WACL,KAAMA,EAAI,EACR,OAAOoI,EAAKO,MAAMzR,KAAM/N,UAE5B,CACF,EA25MA+hF,GAAOgU,IAAMA,GACbhU,GAAOj9D,OAASA,GAChBi9D,GAAOqe,SAAWA,GAClBre,GAAOse,aAAeA,GACtBte,GAAOue,WAAaA,GACpBve,GAAOwe,GAAKA,GACZxe,GAAOob,OAASA,GAChBpb,GAAO91D,KAAOA,GACd81D,GAAOogB,QAAUA,GACjBpgB,GAAOqb,QAAUA,GACjBrb,GAAO4hB,UAl8KP,WACE,IAAK3jG,UAAUC,OACb,MAAO,GAET,IAAIyM,EAAQ1M,UAAU,GACtB,OAAOsO,GAAQ5B,GAASA,EAAQ,CAACA,EACnC,EA67KAq1E,GAAOya,MAAQA,GACfza,GAAO6hB,MApgTP,SAAetsD,EAAOte,EAAMm7D,GAExBn7D,GADGm7D,EAAQC,GAAe98C,EAAOte,EAAMm7D,GAASn7D,IAAS94B,GAClD,EAEA0gF,GAAUwX,GAAUp/D,GAAO,GAEpC,IAAI/4B,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,IAAKA,GAAU+4B,EAAO,EACpB,MAAO,GAMT,IAJA,IAAItX,EAAQ,EACRg5D,EAAW,EACX31E,EAASsJ,EAAM4xE,GAAWhgF,EAAS+4B,IAEhCtX,EAAQzhB,GACb8E,EAAO21E,KAAc6V,GAAUj5C,EAAO51B,EAAQA,GAASsX,GAEzD,OAAOj0B,CACT,EAm/SAg9E,GAAO8hB,QAl+SP,SAAiBvsD,GAMf,IALA,IAAI51B,GAAS,EACTzhB,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACnCy6E,EAAW,EACX31E,EAAS,KAEJ2c,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACdhV,IACF3H,EAAO21E,KAAchuE,EAEzB,CACA,OAAO3H,CACT,EAs9SAg9E,GAAO/xB,OA97SP,WACE,IAAI/vD,EAASD,UAAUC,OACvB,IAAKA,EACH,MAAO,GAMT,IAJA,IAAI0c,EAAOtO,EAAMpO,EAAS,GACtBq3C,EAAQt3C,UAAU,GAClB0hB,EAAQzhB,EAELyhB,KACL/E,EAAK+E,EAAQ,GAAK1hB,UAAU0hB,GAE9B,OAAOq5D,GAAUzsE,GAAQgpC,GAASgtC,GAAUhtC,GAAS,CAACA,GAAQqxC,GAAYhsE,EAAM,GAClF,EAk7SAolE,GAAOnY,KA3tCP,SAAcx3C,GACZ,IAAInyB,EAAkB,MAATmyB,EAAgB,EAAIA,EAAMnyB,OACnC62F,EAAalI,KASjB,OAPAx8D,EAASnyB,EAAc66E,GAAS1oD,GAAO,SAASimE,GAC9C,GAAsB,mBAAXA,EAAK,GACd,MAAM,IAAIn7E,GAAUg0D,GAEtB,MAAO,CAAC4lB,EAAWuB,EAAK,IAAKA,EAAK,GACpC,IALkB,GAOXxI,IAAS,SAASlzE,GAEvB,IADA,IAAI+E,GAAS,IACJA,EAAQzhB,GAAQ,CACvB,IAAIo4F,EAAOjmE,EAAM1Q,GACjB,GAAIlC,GAAM64E,EAAK,GAAItqF,KAAM4O,GACvB,OAAO6C,GAAM64E,EAAK,GAAItqF,KAAM4O,EAEhC,CACF,GACF,EAwsCAolE,GAAO+hB,SA9qCP,SAAkBhzF,GAChB,OAz5YF,SAAsBA,GACpB,IAAIoH,EAAQ1T,GAAKsM,GACjB,OAAO,SAASuP,GACd,OAAOmnE,GAAennE,EAAQvP,EAAQoH,EACxC,CACF,CAo5YS6rF,CAAaxe,GAAUz0E,EA/ieZ,GAgjepB,EA6qCAixE,GAAOsO,SAAWA,GAClBtO,GAAO4a,QAAUA,GACjB5a,GAAOpuE,OAtuHP,SAAgBH,EAAWwwF,GACzB,IAAIj/F,EAASq9E,GAAW5uE,GACxB,OAAqB,MAAdwwF,EAAqBj/F,EAASkgF,GAAWlgF,EAAQi/F,EAC1D,EAouHAjiB,GAAOkiB,MAzuMP,SAASA,EAAMhlF,EAAM+2E,EAAO7B,GAE1B,IAAIpvF,EAAS0zF,GAAWx5E,EA7+TN,EA6+T6B/e,EAAWA,EAAWA,EAAWA,EAAWA,EAD3F81F,EAAQ7B,EAAQj0F,EAAY81F,GAG5B,OADAjxF,EAAOu4E,YAAc2mB,EAAM3mB,YACpBv4E,CACT,EAquMAg9E,GAAOmiB,WA7rMP,SAASA,EAAWjlF,EAAM+2E,EAAO7B,GAE/B,IAAIpvF,EAAS0zF,GAAWx5E,EAAMoyD,EAAuBnxE,EAAWA,EAAWA,EAAWA,EAAWA,EADjG81F,EAAQ7B,EAAQj0F,EAAY81F,GAG5B,OADAjxF,EAAOu4E,YAAc4mB,EAAW5mB,YACzBv4E,CACT,EAyrMAg9E,GAAOub,SAAWA,GAClBvb,GAAO9D,SAAWA,GAClB8D,GAAO2e,aAAeA,GACtB3e,GAAO4c,MAAQA,GACf5c,GAAO6c,MAAQA,GACf7c,GAAOiZ,WAAaA,GACpBjZ,GAAOkZ,aAAeA,GACtBlZ,GAAOmZ,eAAiBA,GACxBnZ,GAAOoiB,KAt0SP,SAAc7sD,EAAOzgC,EAAGs9E,GACtB,IAAIl0F,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,OAAKA,EAIEswF,GAAUj5C,GADjBzgC,EAAKs9E,GAASt9E,IAAM3W,EAAa,EAAIk4F,GAAUvhF,IACnB,EAAI,EAAIA,EAAG5W,GAH9B,EAIX,EAg0SA8hF,GAAOqiB,UArySP,SAAmB9sD,EAAOzgC,EAAGs9E,GAC3B,IAAIl0F,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,OAAKA,EAKEswF,GAAUj5C,EAAO,GADxBzgC,EAAI5W,GADJ4W,EAAKs9E,GAASt9E,IAAM3W,EAAa,EAAIk4F,GAAUvhF,KAEhB,EAAI,EAAIA,GAJ9B,EAKX,EA8xSAkrE,GAAOsiB,eAzvSP,SAAwB/sD,EAAO+N,GAC7B,OAAQ/N,GAASA,EAAMr3C,OACnB6xF,GAAUx6C,EAAOs3C,GAAYvpC,EAAW,IAAI,GAAM,GAClD,EACN,EAsvSA08B,GAAOuiB,UAjtSP,SAAmBhtD,EAAO+N,GACxB,OAAQ/N,GAASA,EAAMr3C,OACnB6xF,GAAUx6C,EAAOs3C,GAAYvpC,EAAW,IAAI,GAC5C,EACN,EA8sSA08B,GAAOwiB,KA/qSP,SAAcjtD,EAAO5qC,EAAO2pB,EAAO83C,GACjC,IAAIluE,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,OAAKA,GAGDo2B,GAAyB,iBAATA,GAAqB+9D,GAAe98C,EAAO5qC,EAAO2pB,KACpEA,EAAQ,EACR83C,EAAMluE,GAzvIV,SAAkBq3C,EAAO5qC,EAAO2pB,EAAO83C,GACrC,IAAIluE,EAASq3C,EAAMr3C,OAWnB,KATAo2B,EAAQ+hE,GAAU/hE,IACN,IACVA,GAASA,EAAQp2B,EAAS,EAAKA,EAASo2B,IAE1C83C,EAAOA,IAAQjuE,GAAaiuE,EAAMluE,EAAUA,EAASm4F,GAAUjqB,IACrD,IACRA,GAAOluE,GAETkuE,EAAM93C,EAAQ83C,EAAM,EAAI+xB,GAAS/xB,GAC1B93C,EAAQ83C,GACb72B,EAAMjhB,KAAW3pB,EAEnB,OAAO4qC,CACT,CA2uISktD,CAASltD,EAAO5qC,EAAO2pB,EAAO83C,IAN5B,EAOX,EAsqSA4T,GAAOx3E,OA3vOP,SAAgB42C,EAAYkE,GAE1B,OADW/2C,GAAQ6yC,GAAcs5B,GAAciO,IACnCvnC,EAAYytC,GAAYvpC,EAAW,GACjD,EAyvOA08B,GAAO0iB,QAvqOP,SAAiBtjD,EAAYk5B,GAC3B,OAAOsO,GAAY9hF,GAAIs6C,EAAYk5B,GAAW,EAChD,EAsqOA0H,GAAO2iB,YAhpOP,SAAqBvjD,EAAYk5B,GAC/B,OAAOsO,GAAY9hF,GAAIs6C,EAAYk5B,GAAW3I,EAChD,EA+oOAqQ,GAAO4iB,aAxnOP,SAAsBxjD,EAAYk5B,EAAUuO,GAE1C,OADAA,EAAQA,IAAU1oF,EAAY,EAAIk4F,GAAUxP,GACrCD,GAAY9hF,GAAIs6C,EAAYk5B,GAAWuO,EAChD,EAsnOA7G,GAAOuX,QAAUA,GACjBvX,GAAO6iB,YAviSP,SAAqBttD,GAEnB,OADsB,MAATA,EAAgB,EAAIA,EAAMr3C,QACvB0oF,GAAYrxC,EAAOo6B,GAAY,EACjD,EAqiSAqQ,GAAO8iB,aA/gSP,SAAsBvtD,EAAOsxC,GAE3B,OADsB,MAATtxC,EAAgB,EAAIA,EAAMr3C,QAKhC0oF,GAAYrxC,EADnBsxC,EAAQA,IAAU1oF,EAAY,EAAIk4F,GAAUxP,IAFnC,EAIX,EAygSA7G,GAAO+iB,KAz9LP,SAAc7lF,GACZ,OAAOw5E,GAAWx5E,EA5wUD,IA6wUnB,EAw9LA8iE,GAAOsgB,KAAOA,GACdtgB,GAAOugB,UAAYA,GACnBvgB,GAAOgjB,UA3/RP,SAAmB3yE,GAKjB,IAJA,IAAI1Q,GAAS,EACTzhB,EAAkB,MAATmyB,EAAgB,EAAIA,EAAMnyB,OACnC8E,EAAS,CAAC,IAEL2c,EAAQzhB,GAAQ,CACvB,IAAIo4F,EAAOjmE,EAAM1Q,GACjB3c,EAAOszF,EAAK,IAAMA,EAAK,EACzB,CACA,OAAOtzF,CACT,EAk/RAg9E,GAAOijB,UA38GP,SAAmB3kF,GACjB,OAAiB,MAAVA,EAAiB,GAAK6oE,GAAc7oE,EAAQ7b,GAAK6b,GAC1D,EA08GA0hE,GAAOkjB,YAj7GP,SAAqB5kF,GACnB,OAAiB,MAAVA,EAAiB,GAAK6oE,GAAc7oE,EAAQ+lE,GAAO/lE,GAC5D,EAg7GA0hE,GAAO+a,QAAUA,GACjB/a,GAAOmjB,QA56RP,SAAiB5tD,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMr3C,QACvBswF,GAAUj5C,EAAO,GAAI,GAAK,EAC5C,EA06RAyqC,GAAOsZ,aAAeA,GACtBtZ,GAAOwZ,eAAiBA,GACxBxZ,GAAOyZ,iBAAmBA,GAC1BzZ,GAAO6e,OAASA,GAChB7e,GAAO8e,SAAWA,GAClB9e,GAAOgb,UAAYA,GACnBhb,GAAO1H,SAAWA,GAClB0H,GAAOib,MAAQA,GACfjb,GAAOv9E,KAAOA,GACdu9E,GAAOqE,OAASA,GAChBrE,GAAOl7E,IAAMA,GACbk7E,GAAOojB,QA1rGP,SAAiB9kF,EAAQg6D,GACvB,IAAIt1E,EAAS,CAAC,EAMd,OALAs1E,EAAWuU,GAAYvU,EAAU,GAEjC+N,GAAW/nE,GAAQ,SAAS3T,EAAOxH,EAAKmb,GACtCskE,GAAgB5/E,EAAQs1E,EAAS3tE,EAAOxH,EAAKmb,GAAS3T,EACxD,IACO3H,CACT,EAmrGAg9E,GAAOqjB,UArpGP,SAAmB/kF,EAAQg6D,GACzB,IAAIt1E,EAAS,CAAC,EAMd,OALAs1E,EAAWuU,GAAYvU,EAAU,GAEjC+N,GAAW/nE,GAAQ,SAAS3T,EAAOxH,EAAKmb,GACtCskE,GAAgB5/E,EAAQG,EAAKm1E,EAAS3tE,EAAOxH,EAAKmb,GACpD,IACOtb,CACT,EA8oGAg9E,GAAOtmC,QAphCP,SAAiB3qC,GACf,OAAOm8E,GAAY1H,GAAUz0E,EAxveX,GAyvepB,EAmhCAixE,GAAOsjB,gBAh/BP,SAAyBzhE,EAAM+oD,GAC7B,OAAOK,GAAoBppD,EAAM2hD,GAAUoH,EA7xezB,GA8xepB,EA++BA5K,GAAO4Y,QAAUA,GACjB5Y,GAAOrgD,MAAQA,GACfqgD,GAAO4e,UAAYA,GACnB5e,GAAOz1E,OAASA,GAChBy1E,GAAOwgB,SAAWA,GAClBxgB,GAAOygB,MAAQA,GACfzgB,GAAOid,OAASA,GAChBjd,GAAOujB,OAzzBP,SAAgBzuF,GAEd,OADAA,EAAIuhF,GAAUvhF,GACPg5E,IAAS,SAASlzE,GACvB,OAAO6xE,GAAQ7xE,EAAM9F,EACvB,GACF,EAqzBAkrE,GAAOgf,KAAOA,GACdhf,GAAOwjB,OAnhGP,SAAgBllF,EAAQglC,GACtB,OAAO67C,GAAO7gF,EAAQ2+E,GAAOpQ,GAAYvpC,IAC3C,EAkhGA08B,GAAOyjB,KA73LP,SAAcvmF,GACZ,OAAOk+E,GAAO,EAAGl+E,EACnB,EA43LA8iE,GAAOljC,QAr4NP,SAAiBsC,EAAYutC,EAAWC,EAAQwF,GAC9C,OAAkB,MAAdhzC,EACK,IAEJ7yC,GAAQogF,KACXA,EAAyB,MAAbA,EAAoB,GAAK,CAACA,IAGnCpgF,GADLqgF,EAASwF,EAAQj0F,EAAYyuF,KAE3BA,EAAmB,MAAVA,EAAiB,GAAK,CAACA,IAE3BF,GAAYttC,EAAYutC,EAAWC,GAC5C,EA03NA5M,GAAO0gB,KAAOA,GACd1gB,GAAOkd,SAAWA,GAClBld,GAAO2gB,UAAYA,GACnB3gB,GAAO4gB,SAAWA,GAClB5gB,GAAOqd,QAAUA,GACjBrd,GAAOsd,aAAeA,GACtBtd,GAAOkb,UAAYA,GACnBlb,GAAO7D,KAAOA,GACd6D,GAAOmf,OAASA,GAChBnf,GAAOmL,SAAWA,GAClBnL,GAAO0jB,WA/rBP,SAAoBplF,GAClB,OAAO,SAASujB,GACd,OAAiB,MAAVvjB,EAAiBngB,EAAYkpF,GAAQ/oE,EAAQujB,EACtD,CACF,EA4rBAm+C,GAAO0Z,KAAOA,GACd1Z,GAAO2Z,QAAUA,GACjB3Z,GAAO2jB,UApsRP,SAAmBpuD,EAAOl9B,EAAQigE,GAChC,OAAQ/iC,GAASA,EAAMr3C,QAAUma,GAAUA,EAAOna,OAC9CsvF,GAAYj4C,EAAOl9B,EAAQw0E,GAAYvU,EAAU,IACjD/iC,CACN,EAisRAyqC,GAAO4jB,YAxqRP,SAAqBruD,EAAOl9B,EAAQ4zB,GAClC,OAAQsJ,GAASA,EAAMr3C,QAAUma,GAAUA,EAAOna,OAC9CsvF,GAAYj4C,EAAOl9B,EAAQla,EAAW8tC,GACtCsJ,CACN,EAqqRAyqC,GAAO4Z,OAASA,GAChB5Z,GAAO8gB,MAAQA,GACf9gB,GAAO+gB,WAAaA,GACpB/gB,GAAOud,MAAQA,GACfvd,GAAOvvE,OAxvNP,SAAgB2uC,EAAYkE,GAE1B,OADW/2C,GAAQ6yC,GAAcs5B,GAAciO,IACnCvnC,EAAY69C,GAAOpQ,GAAYvpC,EAAW,IACxD,EAsvNA08B,GAAOr3D,OAzmRP,SAAgB4sB,EAAO+N,GACrB,IAAItgD,EAAS,GACb,IAAMuyC,IAASA,EAAMr3C,OACnB,OAAO8E,EAET,IAAI2c,GAAS,EACT+tE,EAAU,GACVxvF,EAASq3C,EAAMr3C,OAGnB,IADAolD,EAAYupC,GAAYvpC,EAAW,KAC1B3jC,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAQ4qC,EAAM51B,GACd2jC,EAAU34C,EAAOgV,EAAO41B,KAC1BvyC,EAAOH,KAAK8H,GACZ+iF,EAAQ7qF,KAAK8c,GAEjB,CAEA,OADA8tE,GAAWl4C,EAAOm4C,GACX1qF,CACT,EAulRAg9E,GAAO7U,KAluLP,SAAcjuD,EAAMoX,GAClB,GAAmB,mBAARpX,EACT,MAAM,IAAI/B,GAAUg0D,GAGtB,OAAO2e,GAAS5wE,EADhBoX,EAAQA,IAAUn2B,EAAYm2B,EAAQ+hE,GAAU/hE,GAElD,EA6tLA0rD,GAAOzzD,QAAUA,GACjByzD,GAAO6jB,WAhtNP,SAAoBzkD,EAAYtqC,EAAGs9E,GAOjC,OALEt9E,GADGs9E,EAAQC,GAAejzC,EAAYtqC,EAAGs9E,GAASt9E,IAAM3W,GACpD,EAEAk4F,GAAUvhF,IAELvI,GAAQ6yC,GAAcijC,GAAkB6L,IACvC9uC,EAAYtqC,EAC1B,EAysNAkrE,GAAO7oE,IAv6FP,SAAamH,EAAQujB,EAAMl3B,GACzB,OAAiB,MAAV2T,EAAiBA,EAASivE,GAAQjvE,EAAQujB,EAAMl3B,EACzD,EAs6FAq1E,GAAO8jB,QA54FP,SAAiBxlF,EAAQujB,EAAMl3B,EAAO+4E,GAEpC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAavlF,EAC3C,MAAVmgB,EAAiBA,EAASivE,GAAQjvE,EAAQujB,EAAMl3B,EAAO+4E,EAChE,EA04FA1D,GAAO+jB,QA1rNP,SAAiB3kD,GAEf,OADW7yC,GAAQ6yC,GAAcqjC,GAAe8L,IACpCnvC,EACd,EAwrNA4gC,GAAOr9E,MAhjRP,SAAe4yC,EAAOjhB,EAAO83C,GAC3B,IAAIluE,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,OAAKA,GAGDkuE,GAAqB,iBAAPA,GAAmBimB,GAAe98C,EAAOjhB,EAAO83C,IAChE93C,EAAQ,EACR83C,EAAMluE,IAGNo2B,EAAiB,MAATA,EAAgB,EAAI+hE,GAAU/hE,GACtC83C,EAAMA,IAAQjuE,EAAYD,EAASm4F,GAAUjqB,IAExCoiB,GAAUj5C,EAAOjhB,EAAO83C,IAVtB,EAWX,EAmiRA4T,GAAOmb,OAASA,GAChBnb,GAAOgkB,WAx3QP,SAAoBzuD,GAClB,OAAQA,GAASA,EAAMr3C,OACnBqxF,GAAeh6C,GACf,EACN,EAq3QAyqC,GAAOikB,aAn2QP,SAAsB1uD,EAAO+iC,GAC3B,OAAQ/iC,GAASA,EAAMr3C,OACnBqxF,GAAeh6C,EAAOs3C,GAAYvU,EAAU,IAC5C,EACN,EAg2QA0H,GAAOvhF,MA5hEP,SAAe47E,EAAQ6pB,EAAWC,GAKhC,OAJIA,GAAyB,iBAATA,GAAqB9R,GAAehY,EAAQ6pB,EAAWC,KACzED,EAAYC,EAAQhmG,IAEtBgmG,EAAQA,IAAUhmG,EAAY2xE,EAAmBq0B,IAAU,IAI3D9pB,EAASzxD,GAASyxD,MAEQ,iBAAb6pB,GACO,MAAbA,IAAsBpsB,GAASosB,OAEpCA,EAAYzU,GAAayU,KACPhpB,GAAWb,GACpBqW,GAAU7U,GAAcxB,GAAS,EAAG8pB,GAGxC9pB,EAAO57E,MAAMylG,EAAWC,GAZtB,EAaX,EA0gEAnkB,GAAOokB,OAnsLP,SAAgBlnF,EAAMoX,GACpB,GAAmB,mBAARpX,EACT,MAAM,IAAI/B,GAAUg0D,GAGtB,OADA76C,EAAiB,MAATA,EAAgB,EAAIuqD,GAAUwX,GAAU/hE,GAAQ,GACjDw5D,IAAS,SAASlzE,GACvB,IAAI26B,EAAQ36B,EAAK0Z,GACb4jE,EAAYxH,GAAU91E,EAAM,EAAG0Z,GAKnC,OAHIihB,GACFyjC,GAAUkf,EAAW3iD,GAEhB93B,GAAMP,EAAMlR,KAAMksF,EAC3B,GACF,EAsrLAlY,GAAOqkB,KAl1QP,SAAc9uD,GACZ,IAAIr3C,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,OAAOA,EAASswF,GAAUj5C,EAAO,EAAGr3C,GAAU,EAChD,EAg1QA8hF,GAAOskB,KArzQP,SAAc/uD,EAAOzgC,EAAGs9E,GACtB,OAAM78C,GAASA,EAAMr3C,OAIdswF,GAAUj5C,EAAO,GADxBzgC,EAAKs9E,GAASt9E,IAAM3W,EAAa,EAAIk4F,GAAUvhF,IAChB,EAAI,EAAIA,GAH9B,EAIX,EAgzQAkrE,GAAOukB,UArxQP,SAAmBhvD,EAAOzgC,EAAGs9E,GAC3B,IAAIl0F,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,OAAKA,EAKEswF,GAAUj5C,GADjBzgC,EAAI5W,GADJ4W,EAAKs9E,GAASt9E,IAAM3W,EAAa,EAAIk4F,GAAUvhF,KAEnB,EAAI,EAAIA,EAAG5W,GAJ9B,EAKX,EA8wQA8hF,GAAOwkB,eAzuQP,SAAwBjvD,EAAO+N,GAC7B,OAAQ/N,GAASA,EAAMr3C,OACnB6xF,GAAUx6C,EAAOs3C,GAAYvpC,EAAW,IAAI,GAAO,GACnD,EACN,EAsuQA08B,GAAOykB,UAjsQP,SAAmBlvD,EAAO+N,GACxB,OAAQ/N,GAASA,EAAMr3C,OACnB6xF,GAAUx6C,EAAOs3C,GAAYvpC,EAAW,IACxC,EACN,EA8rQA08B,GAAO0kB,IApuPP,SAAa/5F,EAAO+vF,GAElB,OADAA,EAAY/vF,GACLA,CACT,EAkuPAq1E,GAAO2kB,SA9oLP,SAAkBznF,EAAMyoE,EAAMjuE,GAC5B,IAAIokF,GAAU,EACVrJ,GAAW,EAEf,GAAmB,mBAARv1E,EACT,MAAM,IAAI/B,GAAUg0D,GAMtB,OAJIx7D,GAAS+D,KACXokF,EAAU,YAAapkF,IAAYA,EAAQokF,QAAUA,EACrDrJ,EAAW,aAAc/6E,IAAYA,EAAQ+6E,SAAWA,GAEnD8I,GAASr+E,EAAMyoE,EAAM,CAC1B,QAAWmW,EACX,QAAWnW,EACX,SAAY8M,GAEhB,EA+nLAzS,GAAOqT,KAAOA,GACdrT,GAAOge,QAAUA,GACjBhe,GAAOof,QAAUA,GACjBpf,GAAOqf,UAAYA,GACnBrf,GAAO4kB,OArfP,SAAgBj6F,GACd,OAAI4B,GAAQ5B,GACHouE,GAASpuE,EAAO48E,IAElBb,GAAS/7E,GAAS,CAACA,GAAS43E,GAAUiO,GAAa5nE,GAASje,IACrE,EAifAq1E,GAAOuM,cAAgBA,GACvBvM,GAAO3E,UA10FP,SAAmB/8D,EAAQg6D,EAAUnuB,GACnC,IAAIy3B,EAAQr1E,GAAQ+R,GAChBumF,EAAYjjB,GAASpD,GAASlgE,IAAW45D,GAAa55D,GAG1D,GADAg6D,EAAWuU,GAAYvU,EAAU,GACd,MAAfnuB,EAAqB,CACvB,IAAIs6B,EAAOnmE,GAAUA,EAAOlQ,YAE1B+7C,EADE06C,EACYjjB,EAAQ,IAAI6C,EAAO,GAE1B9wE,GAAS2K,IACF8oE,GAAW3C,GAAQpE,GAAWjD,GAAa9+D,IAG3C,CAAC,CAEnB,CAIA,OAHCumF,EAAYtsB,GAAY8N,IAAY/nE,GAAQ,SAAS3T,EAAOgV,EAAOrB,GAClE,OAAOg6D,EAASnuB,EAAax/C,EAAOgV,EAAOrB,EAC7C,IACO6rC,CACT,EAszFA61B,GAAO8kB,MArnLP,SAAe5nF,GACb,OAAO82E,GAAI92E,EAAM,EACnB,EAonLA8iE,GAAO6Z,MAAQA,GACf7Z,GAAO8Z,QAAUA,GACjB9Z,GAAO+Z,UAAYA,GACnB/Z,GAAO+kB,KAzmQP,SAAcxvD,GACZ,OAAQA,GAASA,EAAMr3C,OAAUwxF,GAASn6C,GAAS,EACrD,EAwmQAyqC,GAAOglB,OA/kQP,SAAgBzvD,EAAO+iC,GACrB,OAAQ/iC,GAASA,EAAMr3C,OAAUwxF,GAASn6C,EAAOs3C,GAAYvU,EAAU,IAAM,EAC/E,EA8kQA0H,GAAOilB,SAxjQP,SAAkB1vD,EAAOtJ,GAEvB,OADAA,EAAkC,mBAAdA,EAA2BA,EAAa9tC,EACpDo3C,GAASA,EAAMr3C,OAAUwxF,GAASn6C,EAAOp3C,EAAW8tC,GAAc,EAC5E,EAsjQA+zC,GAAOklB,MAhyFP,SAAe5mF,EAAQujB,GACrB,OAAiB,MAAVvjB,GAAwBsvE,GAAUtvE,EAAQujB,EACnD,EA+xFAm+C,GAAOga,MAAQA,GACfha,GAAOka,UAAYA,GACnBla,GAAOprE,OApwFP,SAAgB0J,EAAQujB,EAAMiuD,GAC5B,OAAiB,MAAVxxE,EAAiBA,EAASuxE,GAAWvxE,EAAQujB,EAAM0uD,GAAaT,GACzE,EAmwFA9P,GAAOmlB,WAzuFP,SAAoB7mF,EAAQujB,EAAMiuD,EAASpM,GAEzC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAavlF,EAC3C,MAAVmgB,EAAiBA,EAASuxE,GAAWvxE,EAAQujB,EAAM0uD,GAAaT,GAAUpM,EACnF,EAuuFA1D,GAAO3nE,OAASA,GAChB2nE,GAAOolB,SAhrFP,SAAkB9mF,GAChB,OAAiB,MAAVA,EAAiB,GAAKk8D,GAAWl8D,EAAQ+lE,GAAO/lE,GACzD,EA+qFA0hE,GAAOma,QAAUA,GACjBna,GAAO2S,MAAQA,GACf3S,GAAOhjE,KA3mLP,SAAcrS,EAAO2oF,GACnB,OAAO+J,GAAQ9M,GAAa+C,GAAU3oF,EACxC,EA0mLAq1E,GAAOoa,IAAMA,GACbpa,GAAOqa,MAAQA,GACfra,GAAOsa,QAAUA,GACjBta,GAAOua,IAAMA,GACbva,GAAOqlB,UAj3PP,SAAmBlvF,EAAOkC,GACxB,OAAO83E,GAAch6E,GAAS,GAAIkC,GAAU,GAAIwqE,GAClD,EAg3PA7C,GAAOslB,cA/1PP,SAAuBnvF,EAAOkC,GAC5B,OAAO83E,GAAch6E,GAAS,GAAIkC,GAAU,GAAIk1E,GAClD,EA81PAvN,GAAOwa,QAAUA,GAGjBxa,GAAOhoE,QAAUonF,GACjBpf,GAAOulB,UAAYlG,GACnBrf,GAAOwlB,OAASnH,GAChBre,GAAOylB,WAAanH,GAGpBmC,GAAMzgB,GAAQA,IAKdA,GAAOhnE,IAAMA,GACbgnE,GAAOmgB,QAAUA,GACjBngB,GAAOsf,UAAYA,GACnBtf,GAAOwf,WAAaA,GACpBxf,GAAO7B,KAAOA,GACd6B,GAAO0lB,MAprFP,SAAenjG,EAAQ+gF,EAAOC,GAa5B,OAZIA,IAAUplF,IACZolF,EAAQD,EACRA,EAAQnlF,GAENolF,IAAUplF,IAEZolF,GADAA,EAAQuS,GAASvS,MACCA,EAAQA,EAAQ,GAEhCD,IAAUnlF,IAEZmlF,GADAA,EAAQwS,GAASxS,MACCA,EAAQA,EAAQ,GAE7Bd,GAAUsT,GAASvzF,GAAS+gF,EAAOC,EAC5C,EAuqFAvD,GAAOgZ,MA7jLP,SAAeruF,GACb,OAAO64E,GAAU74E,EArzVI,EAszVvB,EA4jLAq1E,GAAO2lB,UApgLP,SAAmBh7F,GACjB,OAAO64E,GAAU74E,EAAOs0F,EAC1B,EAmgLAjf,GAAO4lB,cAr+KP,SAAuBj7F,EAAO+4E,GAE5B,OAAOF,GAAU74E,EAAOs0F,EADxBvb,EAAkC,mBAAdA,EAA2BA,EAAavlF,EAE9D,EAm+KA6hF,GAAO6lB,UA7hLP,SAAmBl7F,EAAO+4E,GAExB,OAAOF,GAAU74E,EAz1VI,EAw1VrB+4E,EAAkC,mBAAdA,EAA2BA,EAAavlF,EAE9D,EA2hLA6hF,GAAO8lB,WA18KP,SAAoBxnF,EAAQvP,GAC1B,OAAiB,MAAVA,GAAkB02E,GAAennE,EAAQvP,EAAQtM,GAAKsM,GAC/D,EAy8KAixE,GAAO4S,OAASA,GAChB5S,GAAO+lB,UA1xCP,SAAmBp7F,EAAOwqF,GACxB,OAAiB,MAATxqF,GAAiBA,IAAUA,EAASwqF,EAAexqF,CAC7D,EAyxCAq1E,GAAOkhB,OAASA,GAChBlhB,GAAO3U,SAz9EP,SAAkBgP,EAAQvrE,EAAQk3F,GAChC3rB,EAASzxD,GAASyxD,GAClBvrE,EAAS2gF,GAAa3gF,GAEtB,IAAI5Q,EAASm8E,EAAOn8E,OAKhBkuE,EAJJ45B,EAAWA,IAAa7nG,EACpBD,EACAskF,GAAU6T,GAAU2P,GAAW,EAAG9nG,GAItC,OADA8nG,GAAYl3F,EAAO5Q,SACA,GAAKm8E,EAAO13E,MAAMqjG,EAAU55B,IAAQt9D,CACzD,EA88EAkxE,GAAO2C,GAAKA,GACZ3C,GAAOimB,OAj7EP,SAAgB5rB,GAEd,OADAA,EAASzxD,GAASyxD,KACApI,EAAmB/gE,KAAKmpE,GACtCA,EAAO7rE,QAAQujE,EAAiBgJ,IAChCV,CACN,EA66EA2F,GAAOkmB,aA55EP,SAAsB7rB,GAEpB,OADAA,EAASzxD,GAASyxD,KACA5H,GAAgBvhE,KAAKmpE,GACnCA,EAAO7rE,QAAQgkE,GAAc,QAC7B6H,CACN,EAw5EA2F,GAAO/jB,MA57OP,SAAe7c,EAAYkE,EAAW8uC,GACpC,IAAIl1E,EAAO3Q,GAAQ6yC,GAAcq5B,GAAa+N,GAI9C,OAHI4L,GAASC,GAAejzC,EAAYkE,EAAW8uC,KACjD9uC,EAAYnlD,GAEP+e,EAAKkiC,EAAYytC,GAAYvpC,EAAW,GACjD,EAu7OA08B,GAAOn5D,KAAOA,GACdm5D,GAAO55B,UAAYA,GACnB45B,GAAOmmB,QArxHP,SAAiB7nF,EAAQglC,GACvB,OAAOi2B,GAAYj7D,EAAQuuE,GAAYvpC,EAAW,GAAI+iC,GACxD,EAoxHArG,GAAO6a,SAAWA,GAClB7a,GAAOoZ,cAAgBA,GACvBpZ,GAAOomB,YAjvHP,SAAqB9nF,EAAQglC,GAC3B,OAAOi2B,GAAYj7D,EAAQuuE,GAAYvpC,EAAW,GAAIijC,GACxD,EAgvHAvG,GAAO7zD,MAAQA,GACf6zD,GAAO93E,QAAUA,GACjB83E,GAAO8a,aAAeA,GACtB9a,GAAOqmB,MArtHP,SAAe/nF,EAAQg6D,GACrB,OAAiB,MAAVh6D,EACHA,EACA0oE,GAAQ1oE,EAAQuuE,GAAYvU,EAAU,GAAI+L,GAChD,EAktHArE,GAAOsmB,WAtrHP,SAAoBhoF,EAAQg6D,GAC1B,OAAiB,MAAVh6D,EACHA,EACA4oE,GAAa5oE,EAAQuuE,GAAYvU,EAAU,GAAI+L,GACrD,EAmrHArE,GAAOumB,OArpHP,SAAgBjoF,EAAQg6D,GACtB,OAAOh6D,GAAU+nE,GAAW/nE,EAAQuuE,GAAYvU,EAAU,GAC5D,EAopHA0H,GAAOwmB,YAxnHP,SAAqBloF,EAAQg6D,GAC3B,OAAOh6D,GAAUioE,GAAgBjoE,EAAQuuE,GAAYvU,EAAU,GACjE,EAunHA0H,GAAO9/E,IAAMA,GACb8/E,GAAOwd,GAAKA,GACZxd,GAAOyd,IAAMA,GACbzd,GAAO/oE,IAzgHP,SAAaqH,EAAQujB,GACnB,OAAiB,MAAVvjB,GAAkBq5E,GAAQr5E,EAAQujB,EAAMomD,GACjD,EAwgHAjI,GAAOgM,MAAQA,GACfhM,GAAOqZ,KAAOA,GACdrZ,GAAOgL,SAAWA,GAClBhL,GAAOxsE,SA5pOP,SAAkB4rC,EAAYz0C,EAAO+uE,EAAW0Y,GAC9ChzC,EAAausC,GAAYvsC,GAAcA,EAAa/mC,GAAO+mC,GAC3Ds6B,EAAaA,IAAc0Y,EAASiE,GAAU3c,GAAa,EAE3D,IAAIx7E,EAASkhD,EAAWlhD,OAIxB,OAHIw7E,EAAY,IACdA,EAAYmF,GAAU3gF,EAASw7E,EAAW,IAErCmkB,GAASz+C,GACXs6B,GAAax7E,GAAUkhD,EAAWtgD,QAAQ6L,EAAO+uE,IAAc,IAC7Dx7E,GAAU26E,GAAYz5B,EAAYz0C,EAAO+uE,IAAc,CAChE,EAkpOAsG,GAAOlhF,QA9lSP,SAAiBy2C,EAAO5qC,EAAO+uE,GAC7B,IAAIx7E,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIyhB,EAAqB,MAAb+5D,EAAoB,EAAI2c,GAAU3c,GAI9C,OAHI/5D,EAAQ,IACVA,EAAQk/D,GAAU3gF,EAASyhB,EAAO,IAE7Bk5D,GAAYtjC,EAAO5qC,EAAOgV,EACnC,EAqlSAqgE,GAAOxkC,QAlqFP,SAAiBj5C,EAAQ+xB,EAAO83C,GAS9B,OARA93C,EAAQqhE,GAASrhE,GACb83C,IAAQjuE,GACViuE,EAAM93C,EACNA,EAAQ,GAER83C,EAAMupB,GAASvpB,GArsVnB,SAAqB7pE,EAAQ+xB,EAAO83C,GAClC,OAAO7pE,GAAUu8E,GAAUxqD,EAAO83C,IAAQ7pE,EAASs8E,GAAUvqD,EAAO83C,EACtE,CAssVSq6B,CADPlkG,EAASuzF,GAASvzF,GACS+xB,EAAO83C,EACpC,EAypFA4T,GAAO+e,OAASA,GAChB/e,GAAO8B,YAAcA,GACrB9B,GAAOzzE,QAAUA,GACjByzE,GAAOxI,cAAgBA,GACvBwI,GAAO2L,YAAcA,GACrB3L,GAAOqM,kBAAoBA,GAC3BrM,GAAO0mB,UAtwKP,SAAmB/7F,GACjB,OAAiB,IAAVA,IAA4B,IAAVA,GACtBs1E,GAAat1E,IAAUg9E,GAAWh9E,IAAUulE,CACjD,EAowKA8P,GAAOxB,SAAWA,GAClBwB,GAAOtI,OAASA,GAChBsI,GAAO2mB,UA7sKP,SAAmBh8F,GACjB,OAAOs1E,GAAat1E,IAA6B,IAAnBA,EAAMmsE,WAAmBwV,GAAc3hF,EACvE,EA4sKAq1E,GAAOhtE,QAzqKP,SAAiBrI,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAIghF,GAAYhhF,KACX4B,GAAQ5B,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAMo2B,QAC1Dy9C,GAAS7zE,IAAUutE,GAAavtE,IAAUm3E,GAAYn3E,IAC1D,OAAQA,EAAMzM,OAEhB,IAAIsC,EAAMujF,GAAOp5E,GACjB,GAAInK,GAAO+vE,GAAU/vE,GAAOowE,EAC1B,OAAQjmE,EAAMssB,KAEhB,GAAIo0D,GAAY1gF,GACd,OAAQygF,GAASzgF,GAAOzM,OAE1B,IAAK,IAAIiF,KAAOwH,EACd,GAAIsE,GAAe6D,KAAKnI,EAAOxH,GAC7B,OAAO,EAGX,OAAO,CACT,EAopKA68E,GAAOrf,QAtnKP,SAAiBh2D,EAAOo4B,GACtB,OAAO6lD,GAAYj+E,EAAOo4B,EAC5B,EAqnKAi9C,GAAO4mB,YAnlKP,SAAqBj8F,EAAOo4B,EAAO2gD,GAEjC,IAAI1gF,GADJ0gF,EAAkC,mBAAdA,EAA2BA,EAAavlF,GAClCulF,EAAW/4E,EAAOo4B,GAAS5kC,EACrD,OAAO6E,IAAW7E,EAAYyqF,GAAYj+E,EAAOo4B,EAAO5kC,EAAWulF,KAAgB1gF,CACrF,EAglKAg9E,GAAO0d,QAAUA,GACjB1d,GAAOtB,SA1hKP,SAAkB/zE,GAChB,MAAuB,iBAATA,GAAqB8zE,GAAe9zE,EACpD,EAyhKAq1E,GAAOoH,WAAaA,GACpBpH,GAAO2d,UAAYA,GACnB3d,GAAO6X,SAAWA,GAClB7X,GAAOpI,MAAQA,GACfoI,GAAO6mB,QA11JP,SAAiBvoF,EAAQvP,GACvB,OAAOuP,IAAWvP,GAAU07E,GAAYnsE,EAAQvP,EAAQ68E,GAAa78E,GACvE,EAy1JAixE,GAAO8mB,YAvzJP,SAAqBxoF,EAAQvP,EAAQ20E,GAEnC,OADAA,EAAkC,mBAAdA,EAA2BA,EAAavlF,EACrDssF,GAAYnsE,EAAQvP,EAAQ68E,GAAa78E,GAAS20E,EAC3D,EAqzJA1D,GAAO3lD,MAvxJP,SAAe1vB,GAIb,OAAOizF,GAASjzF,IAAUA,IAAUA,CACtC,EAmxJAq1E,GAAO+mB,SAvvJP,SAAkBp8F,GAChB,GAAIqtF,GAAWrtF,GACb,MAAM,IAAIS,GAtsXM,mEAwsXlB,OAAO0/E,GAAangF,EACtB,EAmvJAq1E,GAAOgnB,MAxsJP,SAAer8F,GACb,OAAgB,MAATA,CACT,EAusJAq1E,GAAOinB,OAjuJP,SAAgBt8F,GACd,OAAiB,OAAVA,CACT,EAguJAq1E,GAAO4d,SAAWA,GAClB5d,GAAOrsE,SAAWA,GAClBqsE,GAAOC,aAAeA,GACtBD,GAAOsM,cAAgBA,GACvBtM,GAAOlI,SAAWA,GAClBkI,GAAOknB,cArlJP,SAAuBv8F,GACrB,OAAOgzF,GAAUhzF,IAAUA,IAAS,kBAAqBA,GAASilE,CACpE,EAolJAoQ,GAAOhI,MAAQA,GACfgI,GAAO6d,SAAWA,GAClB7d,GAAO0G,SAAWA,GAClB1G,GAAO9H,aAAeA,GACtB8H,GAAOmnB,YAn/IP,SAAqBx8F,GACnB,OAAOA,IAAUxM,CACnB,EAk/IA6hF,GAAOonB,UA/9IP,SAAmBz8F,GACjB,OAAOs1E,GAAat1E,IAAUo5E,GAAOp5E,IAAUomE,CACjD,EA89IAiP,GAAOqnB,UA38IP,SAAmB18F,GACjB,OAAOs1E,GAAat1E,IAn6XP,oBAm6XiBg9E,GAAWh9E,EAC3C,EA08IAq1E,GAAO5yE,KAz/RP,SAAcmoC,EAAO2uD,GACnB,OAAgB,MAAT3uD,EAAgB,GAAKopC,GAAW7rE,KAAKyiC,EAAO2uD,EACrD,EAw/RAlkB,GAAO0f,UAAYA,GACnB1f,GAAOxoB,KAAOA,GACdwoB,GAAO3vE,YAh9RP,SAAqBklC,EAAO5qC,EAAO+uE,GACjC,IAAIx7E,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIyhB,EAAQzhB,EAKZ,OAJIw7E,IAAcv7E,IAEhBwhB,GADAA,EAAQ02E,GAAU3c,IACF,EAAImF,GAAU3gF,EAASyhB,EAAO,GAAKm/D,GAAUn/D,EAAOzhB,EAAS,IAExEyM,IAAUA,EArvMrB,SAA2B4qC,EAAO5qC,EAAO+uE,GAEvC,IADA,IAAI/5D,EAAQ+5D,EAAY,EACjB/5D,KACL,GAAI41B,EAAM51B,KAAWhV,EACnB,OAAOgV,EAGX,OAAOA,CACT,CA8uMQ2nF,CAAkB/xD,EAAO5qC,EAAOgV,GAChC85D,GAAclkC,EAAOskC,GAAWl6D,GAAO,EAC7C,EAo8RAqgE,GAAO2f,UAAYA,GACnB3f,GAAO4f,WAAaA,GACpB5f,GAAO8d,GAAKA,GACZ9d,GAAO+d,IAAMA,GACb/d,GAAO38C,IAhfP,SAAakS,GACX,OAAQA,GAASA,EAAMr3C,OACnBuoF,GAAalxC,EAAOy1C,GAAUhD,IAC9B7pF,CACN,EA6eA6hF,GAAOunB,MApdP,SAAehyD,EAAO+iC,GACpB,OAAQ/iC,GAASA,EAAMr3C,OACnBuoF,GAAalxC,EAAOs3C,GAAYvU,EAAU,GAAI0P,IAC9C7pF,CACN,EAidA6hF,GAAOwnB,KAjcP,SAAcjyD,GACZ,OAAOwkC,GAASxkC,EAAOy1C,GACzB,EAgcAhL,GAAOynB,OAvaP,SAAgBlyD,EAAO+iC,GACrB,OAAOyB,GAASxkC,EAAOs3C,GAAYvU,EAAU,GAC/C,EAsaA0H,GAAO9zD,IAlZP,SAAaqpB,GACX,OAAQA,GAASA,EAAMr3C,OACnBuoF,GAAalxC,EAAOy1C,GAAUS,IAC9BttF,CACN,EA+YA6hF,GAAO0nB,MAtXP,SAAenyD,EAAO+iC,GACpB,OAAQ/iC,GAASA,EAAMr3C,OACnBuoF,GAAalxC,EAAOs3C,GAAYvU,EAAU,GAAImT,IAC9CttF,CACN,EAmXA6hF,GAAO0X,UAAYA,GACnB1X,GAAOiY,UAAYA,GACnBjY,GAAO2nB,WAztBP,WACE,MAAO,CAAC,CACV,EAwtBA3nB,GAAO4nB,WAzsBP,WACE,MAAO,EACT,EAwsBA5nB,GAAO6nB,SAzrBP,WACE,OAAO,CACT,EAwrBA7nB,GAAOqhB,SAAWA,GAClBrhB,GAAO8nB,IA77RP,SAAavyD,EAAOzgC,GAClB,OAAQygC,GAASA,EAAMr3C,OAAUuuF,GAAQl3C,EAAO8gD,GAAUvhF,IAAM3W,CAClE,EA47RA6hF,GAAO+nB,WAliCP,WAIE,OAHIl1D,GAAK3wC,IAAM8J,OACb6mC,GAAK3wC,EAAI66E,IAEJ/wE,IACT,EA8hCAg0E,GAAOuW,KAAOA,GACdvW,GAAOvlE,IAAMA,GACbulE,GAAOgoB,IAj5EP,SAAa3tB,EAAQn8E,EAAQq3F,GAC3Blb,EAASzxD,GAASyxD,GAGlB,IAAI4tB,GAFJ/pG,EAASm4F,GAAUn4F,IAEMw9E,GAAWrB,GAAU,EAC9C,IAAKn8E,GAAU+pG,GAAa/pG,EAC1B,OAAOm8E,EAET,IAAIuU,GAAO1wF,EAAS+pG,GAAa,EACjC,OACE3S,GAAclX,GAAYwQ,GAAM2G,GAChClb,EACAib,GAAcpX,GAAW0Q,GAAM2G,EAEnC,EAo4EAvV,GAAOkoB,OA32EP,SAAgB7tB,EAAQn8E,EAAQq3F,GAC9Blb,EAASzxD,GAASyxD,GAGlB,IAAI4tB,GAFJ/pG,EAASm4F,GAAUn4F,IAEMw9E,GAAWrB,GAAU,EAC9C,OAAQn8E,GAAU+pG,EAAY/pG,EACzBm8E,EAASib,GAAcp3F,EAAS+pG,EAAW1S,GAC5Clb,CACN,EAo2EA2F,GAAOmoB,SA30EP,SAAkB9tB,EAAQn8E,EAAQq3F,GAChClb,EAASzxD,GAASyxD,GAGlB,IAAI4tB,GAFJ/pG,EAASm4F,GAAUn4F,IAEMw9E,GAAWrB,GAAU,EAC9C,OAAQn8E,GAAU+pG,EAAY/pG,EACzBo3F,GAAcp3F,EAAS+pG,EAAW1S,GAASlb,EAC5CA,CACN,EAo0EA2F,GAAO/2E,SA1yEP,SAAkBoxE,EAAQ+tB,EAAOhW,GAM/B,OALIA,GAAkB,MAATgW,EACXA,EAAQ,EACCA,IACTA,GAASA,GAEJppB,GAAep2D,GAASyxD,GAAQ7rE,QAAQkkE,GAAa,IAAK01B,GAAS,EAC5E,EAoyEApoB,GAAO9rD,OA1rFP,SAAgBovD,EAAOC,EAAO8kB,GA2B5B,GA1BIA,GAA+B,kBAAZA,GAAyBhW,GAAe/O,EAAOC,EAAO8kB,KAC3E9kB,EAAQ8kB,EAAWlqG,GAEjBkqG,IAAalqG,IACK,kBAATolF,GACT8kB,EAAW9kB,EACXA,EAAQplF,GAEe,kBAATmlF,IACd+kB,EAAW/kB,EACXA,EAAQnlF,IAGRmlF,IAAUnlF,GAAaolF,IAAUplF,GACnCmlF,EAAQ,EACRC,EAAQ,IAGRD,EAAQqS,GAASrS,GACbC,IAAUplF,GACZolF,EAAQD,EACRA,EAAQ,GAERC,EAAQoS,GAASpS,IAGjBD,EAAQC,EAAO,CACjB,IAAI+kB,EAAOhlB,EACXA,EAAQC,EACRA,EAAQ+kB,CACV,CACA,GAAID,GAAY/kB,EAAQ,GAAKC,EAAQ,EAAG,CACtC,IAAIoV,EAAO1Z,KACX,OAAOH,GAAUwE,EAASqV,GAAQpV,EAAQD,EAAQ/M,GAAe,QAAUoiB,EAAO,IAAIz6F,OAAS,KAAOqlF,EACxG,CACA,OAAOnB,GAAWkB,EAAOC,EAC3B,EAspFAvD,GAAO/7E,OA5+NP,SAAgBm7C,EAAYk5B,EAAUnuB,GACpC,IAAIjtC,EAAO3Q,GAAQ6yC,GAAc65B,GAAciB,GAC3ChB,EAAYj7E,UAAUC,OAAS,EAEnC,OAAOgf,EAAKkiC,EAAYytC,GAAYvU,EAAU,GAAInuB,EAAa+uB,EAAW+J,GAC5E,EAw+NAjD,GAAOuoB,YAh9NP,SAAqBnpD,EAAYk5B,EAAUnuB,GACzC,IAAIjtC,EAAO3Q,GAAQ6yC,GAAc+5B,GAAmBe,GAChDhB,EAAYj7E,UAAUC,OAAS,EAEnC,OAAOgf,EAAKkiC,EAAYytC,GAAYvU,EAAU,GAAInuB,EAAa+uB,EAAWoN,GAC5E,EA48NAtG,GAAOwoB,OA/wEP,SAAgBnuB,EAAQvlE,EAAGs9E,GAMzB,OAJEt9E,GADGs9E,EAAQC,GAAehY,EAAQvlE,EAAGs9E,GAASt9E,IAAM3W,GAChD,EAEAk4F,GAAUvhF,GAET+4E,GAAWjlE,GAASyxD,GAASvlE,EACtC,EAywEAkrE,GAAOxxE,QApvEP,WACE,IAAIoM,EAAO3c,UACPo8E,EAASzxD,GAAShO,EAAK,IAE3B,OAAOA,EAAK1c,OAAS,EAAIm8E,EAASA,EAAO7rE,QAAQoM,EAAK,GAAIA,EAAK,GACjE,EAgvEAolE,GAAOh9E,OAtoGP,SAAgBsb,EAAQujB,EAAMszD,GAG5B,IAAIx1E,GAAS,EACTzhB,GAHJ2jC,EAAOylD,GAASzlD,EAAMvjB,IAGJpgB,OAOlB,IAJKA,IACHA,EAAS,EACTogB,EAASngB,KAEFwhB,EAAQzhB,GAAQ,CACvB,IAAIyM,EAAkB,MAAV2T,EAAiBngB,EAAYmgB,EAAOipE,GAAM1lD,EAAKliB,KACvDhV,IAAUxM,IACZwhB,EAAQzhB,EACRyM,EAAQwqF,GAEV72E,EAAS8oE,GAAWz8E,GAASA,EAAMmI,KAAKwL,GAAU3T,CACpD,CACA,OAAO2T,CACT,EAmnGA0hE,GAAO3zD,MAAQA,GACf2zD,GAAO/D,aAAeA,EACtB+D,GAAOyoB,OA15NP,SAAgBrpD,GAEd,OADW7yC,GAAQ6yC,GAAc+iC,GAAc8L,IACnC7uC,EACd,EAw5NA4gC,GAAO/oD,KA/0NP,SAAcmoB,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIusC,GAAYvsC,GACd,OAAOy+C,GAASz+C,GAAcs8B,GAAWt8B,GAAcA,EAAWlhD,OAEpE,IAAIsC,EAAMujF,GAAO3kC,GACjB,OAAI5+C,GAAO+vE,GAAU/vE,GAAOowE,EACnBxxB,EAAWnoB,KAEbm0D,GAAShsC,GAAYlhD,MAC9B,EAo0NA8hF,GAAO6f,UAAYA,GACnB7f,GAAOvhE,KA/xNP,SAAc2gC,EAAYkE,EAAW8uC,GACnC,IAAIl1E,EAAO3Q,GAAQ6yC,GAAcg6B,GAAYqV,GAI7C,OAHI2D,GAASC,GAAejzC,EAAYkE,EAAW8uC,KACjD9uC,EAAYnlD,GAEP+e,EAAKkiC,EAAYytC,GAAYvpC,EAAW,GACjD,EA0xNA08B,GAAO0oB,YAhsRP,SAAqBnzD,EAAO5qC,GAC1B,OAAO+jF,GAAgBn5C,EAAO5qC,EAChC,EA+rRAq1E,GAAO2oB,cApqRP,SAAuBpzD,EAAO5qC,EAAO2tE,GACnC,OAAOuW,GAAkBt5C,EAAO5qC,EAAOkiF,GAAYvU,EAAU,GAC/D,EAmqRA0H,GAAO4oB,cAjpRP,SAAuBrzD,EAAO5qC,GAC5B,IAAIzM,EAAkB,MAATq3C,EAAgB,EAAIA,EAAMr3C,OACvC,GAAIA,EAAQ,CACV,IAAIyhB,EAAQ+uE,GAAgBn5C,EAAO5qC,GACnC,GAAIgV,EAAQzhB,GAAUykF,GAAGptC,EAAM51B,GAAQhV,GACrC,OAAOgV,CAEX,CACA,OAAQ,CACV,EAyoRAqgE,GAAO6oB,gBArnRP,SAAyBtzD,EAAO5qC,GAC9B,OAAO+jF,GAAgBn5C,EAAO5qC,GAAO,EACvC,EAonRAq1E,GAAO8oB,kBAzlRP,SAA2BvzD,EAAO5qC,EAAO2tE,GACvC,OAAOuW,GAAkBt5C,EAAO5qC,EAAOkiF,GAAYvU,EAAU,IAAI,EACnE,EAwlRA0H,GAAO+oB,kBAtkRP,SAA2BxzD,EAAO5qC,GAEhC,GADsB,MAAT4qC,EAAgB,EAAIA,EAAMr3C,OAC3B,CACV,IAAIyhB,EAAQ+uE,GAAgBn5C,EAAO5qC,GAAO,GAAQ,EAClD,GAAIg4E,GAAGptC,EAAM51B,GAAQhV,GACnB,OAAOgV,CAEX,CACA,OAAQ,CACV,EA8jRAqgE,GAAO8f,UAAYA,GACnB9f,GAAOrV,WA3oEP,SAAoB0P,EAAQvrE,EAAQk3F,GAOlC,OANA3rB,EAASzxD,GAASyxD,GAClB2rB,EAAuB,MAAZA,EACP,EACAxjB,GAAU6T,GAAU2P,GAAW,EAAG3rB,EAAOn8E,QAE7C4Q,EAAS2gF,GAAa3gF,GACfurE,EAAO13E,MAAMqjG,EAAUA,EAAWl3F,EAAO5Q,SAAW4Q,CAC7D,EAooEAkxE,GAAOwhB,SAAWA,GAClBxhB,GAAOgpB,IAzUP,SAAazzD,GACX,OAAQA,GAASA,EAAMr3C,OACnB87E,GAAQzkC,EAAOy1C,IACf,CACN,EAsUAhL,GAAOipB,MA7SP,SAAe1zD,EAAO+iC,GACpB,OAAQ/iC,GAASA,EAAMr3C,OACnB87E,GAAQzkC,EAAOs3C,GAAYvU,EAAU,IACrC,CACN,EA0SA0H,GAAO/tE,SA7hEP,SAAkBooE,EAAQ3iE,EAAS06E,GAIjC,IAAI8W,EAAWlpB,GAAOiG,iBAElBmM,GAASC,GAAehY,EAAQ3iE,EAAS06E,KAC3C16E,EAAUvZ,GAEZk8E,EAASzxD,GAASyxD,GAClB3iE,EAAU4mF,GAAa,CAAC,EAAG5mF,EAASwxF,EAAUhS,IAE9C,IAIIiS,EACAC,EALAC,EAAU/K,GAAa,CAAC,EAAG5mF,EAAQ2xF,QAASH,EAASG,QAASnS,IAC9DoS,EAAc7mG,GAAK4mG,GACnBE,EAAgB/uB,GAAW6uB,EAASC,GAIpC3pF,EAAQ,EACR6pF,EAAc9xF,EAAQ8xF,aAAe91B,GACrC3kE,EAAS,WAGT06F,EAAe78E,IAChBlV,EAAQuuF,QAAUvyB,IAAW3kE,OAAS,IACvCy6F,EAAYz6F,OAAS,KACpBy6F,IAAgBp3B,GAAgBc,GAAeQ,IAAW3kE,OAAS,KACnE2I,EAAQgyF,UAAYh2B,IAAW3kE,OAAS,KACzC,KAME46F,EAAY,kBACb16F,GAAe6D,KAAK4E,EAAS,cACzBA,EAAQiyF,UAAY,IAAIn7F,QAAQ,MAAO,KACvC,6BAA+B2nE,GAAmB,KACnD,KAENkE,EAAO7rE,QAAQi7F,GAAc,SAAS95F,EAAOi6F,EAAaC,EAAkBC,EAAiBC,EAAev1F,GAsB1G,OArBAq1F,IAAqBA,EAAmBC,GAGxC/6F,GAAUsrE,EAAO13E,MAAMgd,EAAOnL,GAAQhG,QAAQmlE,GAAmBqH,IAG7D4uB,IACFT,GAAa,EACbp6F,GAAU,YAAc66F,EAAc,UAEpCG,IACFX,GAAe,EACfr6F,GAAU,OAASg7F,EAAgB,eAEjCF,IACF96F,GAAU,iBAAmB86F,EAAmB,+BAElDlqF,EAAQnL,EAAS7E,EAAMzR,OAIhByR,CACT,IAEAZ,GAAU,OAIV,IAAIlP,EAAWoP,GAAe6D,KAAK4E,EAAS,aAAeA,EAAQ7X,SACnE,GAAKA,GAKA,GAAImzE,GAA2B9hE,KAAKrR,GACvC,MAAM,IAAIuL,GA3idmB,2DAsid7B2D,EAAS,iBAAmBA,EAAS,QASvCA,GAAUq6F,EAAer6F,EAAOP,QAAQmjE,EAAsB,IAAM5iE,GACjEP,QAAQojE,EAAqB,MAC7BpjE,QAAQqjE,EAAuB,OAGlC9iE,EAAS,aAAelP,GAAY,OAAS,SAC1CA,EACG,GACA,wBAEJ,qBACCspG,EACI,mBACA,KAEJC,EACG,uFAEA,OAEJr6F,EACA,gBAEF,IAAI/L,EAASm9F,IAAQ,WACnB,OAAOxpB,GAAS2yB,EAAaK,EAAY,UAAY56F,GAClD0O,MAAMtf,EAAWorG,EACtB,IAKA,GADAvmG,EAAO+L,OAASA,EACZ2uF,GAAQ16F,GACV,MAAMA,EAER,OAAOA,CACT,EA26DAg9E,GAAOgqB,MApsBP,SAAel1F,EAAGwjE,GAEhB,IADAxjE,EAAIuhF,GAAUvhF,IACN,GAAKA,EAAI86D,EACf,MAAO,GAET,IAAIjwD,EAAQmwD,EACR5xE,EAAS4gF,GAAUhqE,EAAGg7D,GAE1BwI,EAAWuU,GAAYvU,GACvBxjE,GAAKg7D,EAGL,IADA,IAAI9sE,EAASm3E,GAAUj8E,EAAQo6E,KACtB34D,EAAQ7K,GACfwjE,EAAS34D,GAEX,OAAO3c,CACT,EAqrBAg9E,GAAO2V,SAAWA,GAClB3V,GAAOqW,UAAYA,GACnBrW,GAAOme,SAAWA,GAClBne,GAAOiqB,QAx5DP,SAAiBt/F,GACf,OAAOie,GAASje,GAAO+hB,aACzB,EAu5DAszD,GAAO8V,SAAWA,GAClB9V,GAAOkqB,cApuIP,SAAuBv/F,GACrB,OAAOA,EACH63E,GAAU6T,GAAU1rF,IAAQ,iBAAmBilE,GACpC,IAAVjlE,EAAcA,EAAQ,CAC7B,EAiuIAq1E,GAAOp3D,SAAWA,GAClBo3D,GAAOmqB,QAn4DP,SAAiBx/F,GACf,OAAOie,GAASje,GAAO6pD,aACzB,EAk4DAwrB,GAAOoqB,KA12DP,SAAc/vB,EAAQkb,EAAOnD,GAE3B,IADA/X,EAASzxD,GAASyxD,MACH+X,GAASmD,IAAUp3F,GAChC,OAAOi8E,GAASC,GAElB,IAAKA,KAAYkb,EAAQ9F,GAAa8F,IACpC,OAAOlb,EAET,IAAIM,EAAakB,GAAcxB,GAC3BO,EAAaiB,GAAc0Z,GAI/B,OAAO7E,GAAU/V,EAHLD,GAAgBC,EAAYC,GAC9BC,GAAcF,EAAYC,GAAc,GAETxtE,KAAK,GAChD,EA61DA4yE,GAAOqqB,QAx0DP,SAAiBhwB,EAAQkb,EAAOnD,GAE9B,IADA/X,EAASzxD,GAASyxD,MACH+X,GAASmD,IAAUp3F,GAChC,OAAOk8E,EAAO13E,MAAM,EAAG23E,GAAgBD,GAAU,GAEnD,IAAKA,KAAYkb,EAAQ9F,GAAa8F,IACpC,OAAOlb,EAET,IAAIM,EAAakB,GAAcxB,GAG/B,OAAOqW,GAAU/V,EAAY,EAFnBE,GAAcF,EAAYkB,GAAc0Z,IAAU,GAEvBnoF,KAAK,GAC5C,EA6zDA4yE,GAAOsqB,UAxyDP,SAAmBjwB,EAAQkb,EAAOnD,GAEhC,IADA/X,EAASzxD,GAASyxD,MACH+X,GAASmD,IAAUp3F,GAChC,OAAOk8E,EAAO7rE,QAAQkkE,GAAa,IAErC,IAAK2H,KAAYkb,EAAQ9F,GAAa8F,IACpC,OAAOlb,EAET,IAAIM,EAAakB,GAAcxB,GAG/B,OAAOqW,GAAU/V,EAFLD,GAAgBC,EAAYkB,GAAc0Z,KAElBnoF,KAAK,GAC3C,EA6xDA4yE,GAAOuqB,SAtvDP,SAAkBlwB,EAAQ3iE,GACxB,IAAIxZ,EAnvdmB,GAovdnBssG,EAnvdqB,MAqvdzB,GAAI72F,GAAS+D,GAAU,CACrB,IAAIwsF,EAAY,cAAexsF,EAAUA,EAAQwsF,UAAYA,EAC7DhmG,EAAS,WAAYwZ,EAAU2+E,GAAU3+E,EAAQxZ,QAAUA,EAC3DssG,EAAW,aAAc9yF,EAAU+3E,GAAa/3E,EAAQ8yF,UAAYA,CACtE,CAGA,IAAIvC,GAFJ5tB,EAASzxD,GAASyxD,IAEKn8E,OACvB,GAAIg9E,GAAWb,GAAS,CACtB,IAAIM,EAAakB,GAAcxB,GAC/B4tB,EAAYttB,EAAWz8E,MACzB,CACA,GAAIA,GAAU+pG,EACZ,OAAO5tB,EAET,IAAIjO,EAAMluE,EAASw9E,GAAW8uB,GAC9B,GAAIp+B,EAAM,EACR,OAAOo+B,EAET,IAAIxnG,EAAS23E,EACT+V,GAAU/V,EAAY,EAAGvO,GAAKh/D,KAAK,IACnCitE,EAAO13E,MAAM,EAAGypE,GAEpB,GAAI83B,IAAc/lG,EAChB,OAAO6E,EAASwnG,EAKlB,GAHI7vB,IACFvO,GAAQppE,EAAO9E,OAASkuE,GAEtB0L,GAASosB,IACX,GAAI7pB,EAAO13E,MAAMypE,GAAKtsE,OAAOokG,GAAY,CACvC,IAAIv0F,EACA9Q,EAAYmE,EAMhB,IAJKkhG,EAAU90F,SACb80F,EAAYt3E,GAAOs3E,EAAUn1F,OAAQ6Z,GAASuqD,GAAQwJ,KAAKunB,IAAc,MAE3EA,EAAUvoB,UAAY,EACdhsE,EAAQu0F,EAAUvnB,KAAK99E,IAC7B,IAAI4rG,EAAS96F,EAAMgQ,MAErB3c,EAASA,EAAOL,MAAM,EAAG8nG,IAAWtsG,EAAYiuE,EAAMq+B,EACxD,OACK,GAAIpwB,EAAOv7E,QAAQ2wF,GAAayU,GAAY93B,IAAQA,EAAK,CAC9D,IAAIzsD,EAAQ3c,EAAOqN,YAAY6zF,GAC3BvkF,GAAS,IACX3c,EAASA,EAAOL,MAAM,EAAGgd,GAE7B,CACA,OAAO3c,EAASwnG,CAClB,EAisDAxqB,GAAO0qB,SA5qDP,SAAkBrwB,GAEhB,OADAA,EAASzxD,GAASyxD,KACArI,EAAiB9gE,KAAKmpE,GACpCA,EAAO7rE,QAAQsjE,EAAekK,IAC9B3B,CACN,EAwqDA2F,GAAO2qB,SAvpBP,SAAkBtgF,GAChB,IAAId,IAAOkzD,GACX,OAAO7zD,GAASyB,GAAUd,CAC5B,EAqpBAy2D,GAAO+f,UAAYA,GACnB/f,GAAOyf,WAAaA,GAGpBzf,GAAOx0D,KAAOtjB,GACd83E,GAAO4qB,UAAY9P,GACnB9a,GAAO9U,MAAQmuB,GAEfoH,GAAMzgB,GAAS,WACb,IAAIjxE,EAAS,CAAC,EAMd,OALAs3E,GAAWrG,IAAQ,SAAS9iE,EAAMs1E,GAC3BvjF,GAAe6D,KAAKktE,GAAOvuE,UAAW+gF,KACzCzjF,EAAOyjF,GAAct1E,EAEzB,IACOnO,CACT,CARe,GAQT,CAAE,OAAS,IAWjBixE,GAAO6qB,QA/ihBK,UAkjhBZtyB,GAAU,CAAC,OAAQ,UAAW,QAAS,aAAc,UAAW,iBAAiB,SAASia,GACxFxS,GAAOwS,GAAYjX,YAAcyE,EACnC,IAGAzH,GAAU,CAAC,OAAQ,SAAS,SAASia,EAAY7yE,GAC/CugE,GAAYzuE,UAAU+gF,GAAc,SAAS19E,GAC3CA,EAAIA,IAAM3W,EAAY,EAAI0gF,GAAUwX,GAAUvhF,GAAI,GAElD,IAAI9R,EAAUgJ,KAAK+0E,eAAiBphE,EAChC,IAAIugE,GAAYl0E,MAChBA,KAAKgtF,QAUT,OARIh2F,EAAO+9E,aACT/9E,EAAOi+E,cAAgBnC,GAAUhqE,EAAG9R,EAAOi+E,eAE3Cj+E,EAAOk+E,UAAUr+E,KAAK,CACpB,KAAQi8E,GAAUhqE,EAAGg7D,GACrB,KAAQ0iB,GAAcxvF,EAAO89E,QAAU,EAAI,QAAU,MAGlD99E,CACT,EAEAk9E,GAAYzuE,UAAU+gF,EAAa,SAAW,SAAS19E,GACrD,OAAO9I,KAAKugB,UAAUimE,GAAY19E,GAAGyX,SACvC,CACF,IAGAgsD,GAAU,CAAC,SAAU,MAAO,cAAc,SAASia,EAAY7yE,GAC7D,IAAI/U,EAAO+U,EAAQ,EACfmrF,EAjihBe,GAiihBJlgG,GA/hhBG,GA+hhByBA,EAE3Cs1E,GAAYzuE,UAAU+gF,GAAc,SAASla,GAC3C,IAAIt1E,EAASgJ,KAAKgtF,QAMlB,OALAh2F,EAAOg+E,cAAcn+E,KAAK,CACxB,SAAYgqF,GAAYvU,EAAU,GAClC,KAAQ1tE,IAEV5H,EAAO+9E,aAAe/9E,EAAO+9E,cAAgB+pB,EACtC9nG,CACT,CACF,IAGAu1E,GAAU,CAAC,OAAQ,SAAS,SAASia,EAAY7yE,GAC/C,IAAIorF,EAAW,QAAUprF,EAAQ,QAAU,IAE3CugE,GAAYzuE,UAAU+gF,GAAc,WAClC,OAAOxmF,KAAK++F,GAAU,GAAGpgG,QAAQ,EACnC,CACF,IAGA4tE,GAAU,CAAC,UAAW,SAAS,SAASia,EAAY7yE,GAClD,IAAIqrF,EAAW,QAAUrrF,EAAQ,GAAK,SAEtCugE,GAAYzuE,UAAU+gF,GAAc,WAClC,OAAOxmF,KAAK+0E,aAAe,IAAIb,GAAYl0E,MAAQA,KAAKg/F,GAAU,EACpE,CACF,IAEA9qB,GAAYzuE,UAAUqwF,QAAU,WAC9B,OAAO91F,KAAKxD,OAAOwiF,GACrB,EAEA9K,GAAYzuE,UAAUoV,KAAO,SAASy8B,GACpC,OAAOt3C,KAAKxD,OAAO86C,GAAW+1C,MAChC,EAEAnZ,GAAYzuE,UAAUopF,SAAW,SAASv3C,GACxC,OAAOt3C,KAAKugB,UAAU1F,KAAKy8B,EAC7B,EAEA48B,GAAYzuE,UAAUupF,UAAYlN,IAAS,SAASjsD,EAAMjnB,GACxD,MAAmB,mBAARinB,EACF,IAAIq+C,GAAYl0E,MAElBA,KAAKlH,KAAI,SAAS6F,GACvB,OAAO+9E,GAAW/9E,EAAOk3B,EAAMjnB,EACjC,GACF,IAEAslE,GAAYzuE,UAAUhB,OAAS,SAAS6yC,GACtC,OAAOt3C,KAAKxD,OAAOy0F,GAAOpQ,GAAYvpC,IACxC,EAEA48B,GAAYzuE,UAAU9O,MAAQ,SAAS2xB,EAAO83C,GAC5C93C,EAAQ+hE,GAAU/hE,GAElB,IAAItxB,EAASgJ,KACb,OAAIhJ,EAAO+9E,eAAiBzsD,EAAQ,GAAK83C,EAAM,GACtC,IAAI8T,GAAYl9E,IAErBsxB,EAAQ,EACVtxB,EAASA,EAAOuhG,WAAWjwE,GAClBA,IACTtxB,EAASA,EAAOo/F,KAAK9tE,IAEnB83C,IAAQjuE,IAEV6E,GADAopE,EAAMiqB,GAAUjqB,IACD,EAAIppE,EAAOq/F,WAAWj2B,GAAOppE,EAAOshG,KAAKl4B,EAAM93C,IAEzDtxB,EACT,EAEAk9E,GAAYzuE,UAAU+yF,eAAiB,SAASlhD,GAC9C,OAAOt3C,KAAKugB,UAAUk4E,UAAUnhD,GAAW/2B,SAC7C,EAEA2zD,GAAYzuE,UAAUusF,QAAU,WAC9B,OAAOhyF,KAAKs4F,KAAKx0B,EACnB,EAGAuW,GAAWnG,GAAYzuE,WAAW,SAASyL,EAAMs1E,GAC/C,IAAIyY,EAAgB,qCAAqC/5F,KAAKshF,GAC1D0Y,EAAU,kBAAkBh6F,KAAKshF,GACjC2Y,EAAanrB,GAAOkrB,EAAW,QAAwB,QAAd1Y,EAAuB,QAAU,IAAOA,GACjF4Y,EAAeF,GAAW,QAAQh6F,KAAKshF,GAEtC2Y,IAGLnrB,GAAOvuE,UAAU+gF,GAAc,WAC7B,IAAI7nF,EAAQqB,KAAKy0E,YACb7lE,EAAOswF,EAAU,CAAC,GAAKjtG,UACvBotG,EAAS1gG,aAAiBu1E,GAC1B5H,EAAW19D,EAAK,GAChB0wF,EAAUD,GAAU9+F,GAAQ5B,GAE5B+vF,EAAc,SAAS/vF,GACzB,IAAI3H,EAASmoG,EAAW1tF,MAAMuiE,GAAQhH,GAAU,CAACruE,GAAQiQ,IACzD,OAAQswF,GAAW1qB,EAAYx9E,EAAO,GAAKA,CAC7C,EAEIsoG,GAAWL,GAAoC,mBAAZ3yB,GAA6C,GAAnBA,EAASp6E,SAExEmtG,EAASC,GAAU,GAErB,IAAI9qB,EAAWx0E,KAAK20E,UAChB4qB,IAAav/F,KAAK00E,YAAYxiF,OAC9BstG,EAAcJ,IAAiB5qB,EAC/BirB,EAAWJ,IAAWE,EAE1B,IAAKH,GAAgBE,EAAS,CAC5B3gG,EAAQ8gG,EAAW9gG,EAAQ,IAAIu1E,GAAYl0E,MAC3C,IAAIhJ,EAASka,EAAKO,MAAM9S,EAAOiQ,GAE/B,OADA5X,EAAO09E,YAAY79E,KAAK,CAAE,KAAQwwF,GAAM,KAAQ,CAACqH,GAAc,QAAWv8F,IACnE,IAAIgiF,GAAcn9E,EAAQw9E,EACnC,CACA,OAAIgrB,GAAeC,EACVvuF,EAAKO,MAAMzR,KAAM4O,IAE1B5X,EAASgJ,KAAKqnF,KAAKqH,GACZ8Q,EAAeN,EAAUloG,EAAO2H,QAAQ,GAAK3H,EAAO2H,QAAW3H,EACxE,EACF,IAGAu1E,GAAU,CAAC,MAAO,OAAQ,QAAS,OAAQ,SAAU,YAAY,SAASia,GACxE,IAAIt1E,EAAOk/D,GAAWoW,GAClBkZ,EAAY,0BAA0Bx6F,KAAKshF,GAAc,MAAQ,OACjE4Y,EAAe,kBAAkBl6F,KAAKshF,GAE1CxS,GAAOvuE,UAAU+gF,GAAc,WAC7B,IAAI53E,EAAO3c,UACX,GAAImtG,IAAiBp/F,KAAK20E,UAAW,CACnC,IAAIh2E,EAAQqB,KAAKrB,QACjB,OAAOuS,EAAKO,MAAMlR,GAAQ5B,GAASA,EAAQ,GAAIiQ,EACjD,CACA,OAAO5O,KAAK0/F,IAAW,SAAS/gG,GAC9B,OAAOuS,EAAKO,MAAMlR,GAAQ5B,GAASA,EAAQ,GAAIiQ,EACjD,GACF,CACF,IAGAyrE,GAAWnG,GAAYzuE,WAAW,SAASyL,EAAMs1E,GAC/C,IAAI2Y,EAAanrB,GAAOwS,GACxB,GAAI2Y,EAAY,CACd,IAAIhoG,EAAMgoG,EAAW/sG,KAAO,GACvB6Q,GAAe6D,KAAKwsE,GAAWn8E,KAClCm8E,GAAUn8E,GAAO,IAEnBm8E,GAAUn8E,GAAKN,KAAK,CAAE,KAAQ2vF,EAAY,KAAQ2Y,GACpD,CACF,IAEA7rB,GAAUsU,GAAaz1F,EAlthBA,GAkthB+BC,MAAQ,CAAC,CAC7D,KAAQ,UACR,KAAQD,IAIV+hF,GAAYzuE,UAAUunF,MAh9dtB,WACE,IAAIh2F,EAAS,IAAIk9E,GAAYl0E,KAAKy0E,aAOlC,OANAz9E,EAAO09E,YAAc6B,GAAUv2E,KAAK00E,aACpC19E,EAAO89E,QAAU90E,KAAK80E,QACtB99E,EAAO+9E,aAAe/0E,KAAK+0E,aAC3B/9E,EAAOg+E,cAAgBuB,GAAUv2E,KAAKg1E,eACtCh+E,EAAOi+E,cAAgBj1E,KAAKi1E,cAC5Bj+E,EAAOk+E,UAAYqB,GAAUv2E,KAAKk1E,WAC3Bl+E,CACT,EAw8dAk9E,GAAYzuE,UAAU8a,QA97dtB,WACE,GAAIvgB,KAAK+0E,aAAc,CACrB,IAAI/9E,EAAS,IAAIk9E,GAAYl0E,MAC7BhJ,EAAO89E,SAAW,EAClB99E,EAAO+9E,cAAe,CACxB,MACE/9E,EAASgJ,KAAKgtF,SACPlY,UAAY,EAErB,OAAO99E,CACT,EAq7dAk9E,GAAYzuE,UAAU9G,MA36dtB,WACE,IAAI4qC,EAAQvpC,KAAKy0E,YAAY91E,QACzBghG,EAAM3/F,KAAK80E,QACXc,EAAQr1E,GAAQgpC,GAChBq2D,EAAUD,EAAM,EAChBhX,EAAY/S,EAAQrsC,EAAMr3C,OAAS,EACnCmvD,EA8pIN,SAAiB/4B,EAAO83C,EAAK+wB,GAC3B,IAAIx9E,GAAS,EACTzhB,EAASi/F,EAAWj/F,OAExB,OAASyhB,EAAQzhB,GAAQ,CACvB,IAAIgU,EAAOirF,EAAWx9E,GAClBsX,EAAO/kB,EAAK+kB,KAEhB,OAAQ/kB,EAAKtH,MACX,IAAK,OAAa0pB,GAAS2C,EAAM,MACjC,IAAK,YAAam1C,GAAOn1C,EAAM,MAC/B,IAAK,OAAam1C,EAAM0S,GAAU1S,EAAK93C,EAAQ2C,GAAO,MACtD,IAAK,YAAa3C,EAAQuqD,GAAUvqD,EAAO83C,EAAMn1C,GAErD,CACA,MAAO,CAAE,MAAS3C,EAAO,IAAO83C,EAClC,CA9qIay/B,CAAQ,EAAGlX,EAAW3oF,KAAKk1E,WAClC5sD,EAAQ+4B,EAAK/4B,MACb83C,EAAM/e,EAAK+e,IACXluE,EAASkuE,EAAM93C,EACf3U,EAAQisF,EAAUx/B,EAAO93C,EAAQ,EACjCq4D,EAAY3gF,KAAKg1E,cACjB8qB,EAAanf,EAAUzuF,OACvBy6E,EAAW,EACXozB,EAAYjtB,GAAU5gF,EAAQ8N,KAAKi1E,eAEvC,IAAKW,IAAWgqB,GAAWjX,GAAaz2F,GAAU6tG,GAAa7tG,EAC7D,OAAO+xF,GAAiB16C,EAAOvpC,KAAK00E,aAEtC,IAAI19E,EAAS,GAEb4/B,EACA,KAAO1kC,KAAYy6E,EAAWozB,GAAW,CAMvC,IAHA,IAAIC,GAAa,EACbrhG,EAAQ4qC,EAHZ51B,GAASgsF,KAKAK,EAAYF,GAAY,CAC/B,IAAI55F,EAAOy6E,EAAUqf,GACjB1zB,EAAWpmE,EAAKomE,SAChB1tE,EAAOsH,EAAKtH,KACZm7E,EAAWzN,EAAS3tE,GAExB,GA7zDY,GA6zDRC,EACFD,EAAQo7E,OACH,IAAKA,EAAU,CACpB,GAj0Da,GAi0DTn7E,EACF,SAASg4B,EAET,MAAMA,CAEV,CACF,CACA5/B,EAAO21E,KAAchuE,CACvB,CACA,OAAO3H,CACT,EA+3dAg9E,GAAOvuE,UAAU+sF,GAAK7D,GACtB3a,GAAOvuE,UAAUgpF,MA1iQjB,WACE,OAAOA,GAAMzuF,KACf,EAyiQAg0E,GAAOvuE,UAAUw6F,OA7gQjB,WACE,OAAO,IAAI9rB,GAAcn0E,KAAKrB,QAASqB,KAAK20E,UAC9C,EA4gQAX,GAAOvuE,UAAU4iC,KAp/PjB,WACMroC,KAAK60E,aAAe1iF,IACtB6N,KAAK60E,WAAamd,GAAQhyF,KAAKrB,UAEjC,IAAIoT,EAAO/R,KAAK40E,WAAa50E,KAAK60E,WAAW3iF,OAG7C,MAAO,CAAE,KAAQ6f,EAAM,MAFXA,EAAO5f,EAAY6N,KAAK60E,WAAW70E,KAAK40E,aAGtD,EA6+PAZ,GAAOvuE,UAAUkiF,MA77PjB,SAAsBhpF,GAIpB,IAHA,IAAI3H,EACA8yD,EAAS9pD,KAEN8pD,aAAkByqB,IAAY,CACnC,IAAIyY,EAAQ5Y,GAAatqB,GACzBkjC,EAAMpY,UAAY,EAClBoY,EAAMnY,WAAa1iF,EACf6E,EACF2qF,EAASlN,YAAcuY,EAEvBh2F,EAASg2F,EAEX,IAAIrL,EAAWqL,EACfljC,EAASA,EAAO2qB,WAClB,CAEA,OADAkN,EAASlN,YAAc91E,EAChB3H,CACT,EA46PAg9E,GAAOvuE,UAAU8a,QAt5PjB,WACE,IAAI5hB,EAAQqB,KAAKy0E,YACjB,GAAI91E,aAAiBu1E,GAAa,CAChC,IAAIgsB,EAAUvhG,EAUd,OATIqB,KAAK00E,YAAYxiF,SACnBguG,EAAU,IAAIhsB,GAAYl0E,QAE5BkgG,EAAUA,EAAQ3/E,WACVm0D,YAAY79E,KAAK,CACvB,KAAQwwF,GACR,KAAQ,CAAC9mE,IACT,QAAWpuB,IAEN,IAAIgiF,GAAc+rB,EAASlgG,KAAK20E,UACzC,CACA,OAAO30E,KAAKqnF,KAAK9mE,GACnB,EAu4PAyzD,GAAOvuE,UAAUsvD,OAASif,GAAOvuE,UAAU4U,QAAU25D,GAAOvuE,UAAU9G,MAv3PtE,WACE,OAAOslF,GAAiBjkF,KAAKy0E,YAAaz0E,KAAK00E,YACjD,EAw3PAV,GAAOvuE,UAAUy5D,MAAQ8U,GAAOvuE,UAAU4nF,KAEtC3b,KACFsC,GAAOvuE,UAAUisE,IAj+PnB,WACE,OAAO1xE,IACT,GAi+POg0E,EACT,CAKQ/D,GAQNppC,GAAK3wC,EAAIA,IAITiqG,EAAAA,WACE,OAAOjqG,EACR,mCAaJ,EAAC4Q,KAAK9G,mCC5yhBM,IAAIogG,EAAG/0B,EAAQ,MAASh5E,EAAGg5E,EAAQ,MAAa,SAAS9rE,EAAErH,GAAG,IAAI,IAAIC,EAAE,yDAAyDD,EAAEvF,EAAE,EAAEA,EAAEV,UAAUC,OAAOS,IAAIwF,GAAG,WAAWy5C,mBAAmB3/C,UAAUU,IAAI,MAAM,yBAAyBuF,EAAE,WAAWC,EAAE,gHAAgH,CAAC,IAAIkoG,EAAG,IAAItzF,IAAIuzF,EAAG,CAAC,EAAE,SAASC,EAAGroG,EAAEC,GAAGqoG,EAAGtoG,EAAEC,GAAGqoG,EAAGtoG,EAAE,UAAUC,EAAE,CACxb,SAASqoG,EAAGtoG,EAAEC,GAAW,IAARmoG,EAAGpoG,GAAGC,EAAMD,EAAE,EAAEA,EAAEC,EAAEjG,OAAOgG,IAAImoG,EAAGrzF,IAAI7U,EAAED,GAAG,CAC5D,IAAIuoG,IAAK,qBAAqB1sG,QAAQ,qBAAqBA,OAAOxB,UAAU,qBAAqBwB,OAAOxB,SAAS2L,eAAewiG,EAAGlqG,OAAOiP,UAAUxC,eAAe09F,EAAG,8VAA8VC,EACpgB,CAAC,EAAEC,EAAG,CAAC,EACiN,SAASnhF,EAAExnB,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,EAAEm4F,GAAG9gG,KAAK+gG,gBAAgB,IAAI5oG,GAAG,IAAIA,GAAG,IAAIA,EAAE6H,KAAKghG,cAAc/tG,EAAE+M,KAAKihG,mBAAmBv+F,EAAE1C,KAAKkhG,gBAAgBvuG,EAAEqN,KAAKmhG,aAAajpG,EAAE8H,KAAKpB,KAAKzG,EAAE6H,KAAKohG,YAAYz4F,EAAE3I,KAAKqhG,kBAAkBP,CAAC,CAAC,IAAIQ,EAAE,CAAC,EACpb,uIAAuI7uG,MAAM,KAAKyJ,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,CAAC,CAAC,gBAAgB,kBAAkB,CAAC,YAAY,SAAS,CAAC,UAAU,OAAO,CAAC,YAAY,eAAegE,SAAQ,SAAShE,GAAG,IAAIC,EAAED,EAAE,GAAGopG,EAAEnpG,GAAG,IAAIunB,EAAEvnB,EAAE,GAAE,EAAGD,EAAE,GAAG,MAAK,GAAG,EAAG,IAAG,CAAC,kBAAkB,YAAY,aAAa,SAASgE,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAEwoB,cAAc,MAAK,GAAG,EAAG,IAC1e,CAAC,cAAc,4BAA4B,YAAY,iBAAiBxkB,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,8OAA8OzF,MAAM,KAAKyJ,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAEwoB,cAAc,MAAK,GAAG,EAAG,IACxb,CAAC,UAAU,WAAW,QAAQ,YAAYxkB,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,CAAC,UAAU,YAAYgE,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,CAAC,OAAO,OAAO,OAAO,QAAQgE,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAE,MAAK,GAAG,EAAG,IAAG,CAAC,UAAU,SAASgE,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAEwoB,cAAc,MAAK,GAAG,EAAG,IAAG,IAAI6gF,EAAG,gBAAgB,SAASC,EAAGtpG,GAAG,OAAOA,EAAE,GAAGswD,aAAa,CAIxZ,SAASi5C,EAAGvpG,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAE4+F,EAAEr+F,eAAe9K,GAAGmpG,EAAEnpG,GAAG,MAAQ,OAAOuK,EAAE,IAAIA,EAAE9D,KAAK3L,KAAK,EAAEkF,EAAEjG,SAAS,MAAMiG,EAAE,IAAI,MAAMA,EAAE,IAAI,MAAMA,EAAE,IAAI,MAAMA,EAAE,MAP9I,SAAYD,EAAEC,EAAExF,EAAEM,GAAG,GAAG,OAAOkF,GAAG,qBAAqBA,GADqE,SAAYD,EAAEC,EAAExF,EAAEM,GAAG,GAAG,OAAON,GAAG,IAAIA,EAAEiM,KAAK,OAAM,EAAG,cAAczG,GAAG,IAAK,WAAW,IAAK,SAAS,OAAM,EAAG,IAAK,UAAU,OAAGlF,IAAc,OAAON,GAASA,EAAEouG,gBAAmD,WAAnC7oG,EAAEA,EAAEwoB,cAAc/pB,MAAM,EAAE,KAAsB,UAAUuB,GAAE,QAAQ,OAAM,EAAG,CAC/TwpG,CAAGxpG,EAAEC,EAAExF,EAAEM,GAAG,OAAM,EAAG,GAAGA,EAAE,OAAM,EAAG,GAAG,OAAON,EAAE,OAAOA,EAAEiM,MAAM,KAAK,EAAE,OAAOzG,EAAE,KAAK,EAAE,OAAM,IAAKA,EAAE,KAAK,EAAE,OAAOk2B,MAAMl2B,GAAG,KAAK,EAAE,OAAOk2B,MAAMl2B,IAAI,EAAEA,EAAE,OAAM,CAAE,CAOtEwpG,CAAGxpG,EAAExF,EAAE+P,EAAEzP,KAAKN,EAAE,MAAMM,GAAG,OAAOyP,EARxK,SAAYxK,GAAG,QAAGwoG,EAAG55F,KAAK+5F,EAAG3oG,KAAewoG,EAAG55F,KAAK85F,EAAG1oG,KAAeyoG,EAAGz7F,KAAKhN,GAAU2oG,EAAG3oG,IAAG,GAAG0oG,EAAG1oG,IAAG,GAAS,GAAE,CAQwD0pG,CAAGzpG,KAAK,OAAOxF,EAAEuF,EAAE2pG,gBAAgB1pG,GAAGD,EAAE4pG,aAAa3pG,EAAE,GAAGxF,IAAI+P,EAAEw+F,gBAAgBhpG,EAAEwK,EAAEy+F,cAAc,OAAOxuG,EAAE,IAAI+P,EAAE9D,MAAQ,GAAGjM,GAAGwF,EAAEuK,EAAEs+F,cAAc/tG,EAAEyP,EAAEu+F,mBAAmB,OAAOtuG,EAAEuF,EAAE2pG,gBAAgB1pG,IAAaxF,EAAE,KAAX+P,EAAEA,EAAE9D,OAAc,IAAI8D,IAAG,IAAK/P,EAAE,GAAG,GAAGA,EAAEM,EAAEiF,EAAE6pG,eAAe9uG,EAAEkF,EAAExF,GAAGuF,EAAE4pG,aAAa3pG,EAAExF,KAAI,CAHjd,0jCAA0jCF,MAAM,KAAKyJ,SAAQ,SAAShE,GAAG,IAAIC,EAAED,EAAEsK,QAAQ++F,EACzmCC,GAAIF,EAAEnpG,GAAG,IAAIunB,EAAEvnB,EAAE,GAAE,EAAGD,EAAE,MAAK,GAAG,EAAG,IAAG,2EAA2EzF,MAAM,KAAKyJ,SAAQ,SAAShE,GAAG,IAAIC,EAAED,EAAEsK,QAAQ++F,EAAGC,GAAIF,EAAEnpG,GAAG,IAAIunB,EAAEvnB,EAAE,GAAE,EAAGD,EAAE,gCAA+B,GAAG,EAAG,IAAG,CAAC,WAAW,WAAW,aAAagE,SAAQ,SAAShE,GAAG,IAAIC,EAAED,EAAEsK,QAAQ++F,EAAGC,GAAIF,EAAEnpG,GAAG,IAAIunB,EAAEvnB,EAAE,GAAE,EAAGD,EAAE,wCAAuC,GAAG,EAAG,IAAG,CAAC,WAAW,eAAegE,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAEwoB,cAAc,MAAK,GAAG,EAAG,IACld4gF,EAAEU,UAAU,IAAItiF,EAAE,YAAY,GAAE,EAAG,aAAa,gCAA+B,GAAG,GAAI,CAAC,MAAM,OAAO,SAAS,cAAcxjB,SAAQ,SAAShE,GAAGopG,EAAEppG,GAAG,IAAIwnB,EAAExnB,EAAE,GAAE,EAAGA,EAAEwoB,cAAc,MAAK,GAAG,EAAG,IAE5L,IAAIuhF,EAAG7B,EAAG8B,mDAAmDC,EAAGj/B,OAAOk/B,IAAI,iBAAiBC,EAAGn/B,OAAOk/B,IAAI,gBAAgBE,EAAGp/B,OAAOk/B,IAAI,kBAAkBG,EAAGr/B,OAAOk/B,IAAI,qBAAqBI,EAAGt/B,OAAOk/B,IAAI,kBAAkBK,EAAGv/B,OAAOk/B,IAAI,kBAAkBM,EAAGx/B,OAAOk/B,IAAI,iBAAiBO,EAAGz/B,OAAOk/B,IAAI,qBAAqBQ,EAAG1/B,OAAOk/B,IAAI,kBAAkBS,EAAG3/B,OAAOk/B,IAAI,uBAAuBU,EAAG5/B,OAAOk/B,IAAI,cAAcW,EAAG7/B,OAAOk/B,IAAI,cAAcl/B,OAAOk/B,IAAI,eAAel/B,OAAOk/B,IAAI,0BACje,IAAIY,EAAG9/B,OAAOk/B,IAAI,mBAAmBl/B,OAAOk/B,IAAI,uBAAuBl/B,OAAOk/B,IAAI,eAAel/B,OAAOk/B,IAAI,wBAAwB,IAAIa,EAAG//B,OAAOh5B,SAAS,SAASg5D,EAAGhrG,GAAG,OAAG,OAAOA,GAAG,kBAAkBA,EAAS,KAAwC,oBAAnCA,EAAE+qG,GAAI/qG,EAAE+qG,IAAK/qG,EAAE,eAA0CA,EAAE,IAAI,CAAC,IAAoBirG,EAAhBC,EAAE5sG,OAAOugB,OAAU,SAASssF,EAAGnrG,GAAG,QAAG,IAASirG,EAAG,IAAI,MAAM/jG,OAAQ,CAAC,MAAMzM,GAAG,IAAIwF,EAAExF,EAAEouB,MAAMq9E,OAAOz6F,MAAM,gBAAgBw/F,EAAGhrG,GAAGA,EAAE,IAAI,EAAE,CAAC,MAAM,KAAKgrG,EAAGjrG,CAAC,CAAC,IAAIorG,GAAG,EACzb,SAASC,EAAGrrG,EAAEC,GAAG,IAAID,GAAGorG,EAAG,MAAM,GAAGA,GAAG,EAAG,IAAI3wG,EAAEyM,MAAMokG,kBAAkBpkG,MAAMokG,uBAAkB,EAAO,IAAI,GAAGrrG,EAAE,GAAGA,EAAE,WAAW,MAAMiH,OAAQ,EAAE5I,OAAOq7E,eAAe15E,EAAEsN,UAAU,QAAQ,CAAC0F,IAAI,WAAW,MAAM/L,OAAQ,IAAI,kBAAkBqkG,SAASA,QAAQC,UAAU,CAAC,IAAID,QAAQC,UAAUvrG,EAAE,GAAG,CAAC,MAAMwrG,GAAG,IAAI1wG,EAAE0wG,CAAC,CAACF,QAAQC,UAAUxrG,EAAE,GAAGC,EAAE,KAAK,CAAC,IAAIA,EAAE2O,MAAM,CAAC,MAAM68F,GAAG1wG,EAAE0wG,CAAC,CAACzrG,EAAE4O,KAAK3O,EAAEsN,UAAU,KAAK,CAAC,IAAI,MAAMrG,OAAQ,CAAC,MAAMukG,GAAG1wG,EAAE0wG,CAAC,CAACzrG,GAAG,CAAC,CAAC,MAAMyrG,GAAG,GAAGA,GAAG1wG,GAAG,kBAAkB0wG,EAAE5iF,MAAM,CAAC,IAAI,IAAIre,EAAEihG,EAAE5iF,MAAMtuB,MAAM,MACnfkW,EAAE1V,EAAE8tB,MAAMtuB,MAAM,MAAMquG,EAAEp+F,EAAExQ,OAAO,EAAEwgC,EAAE/pB,EAAEzW,OAAO,EAAE,GAAG4uG,GAAG,GAAGpuE,GAAGhwB,EAAEo+F,KAAKn4F,EAAE+pB,IAAIA,IAAI,KAAK,GAAGouE,GAAG,GAAGpuE,EAAEouE,IAAIpuE,IAAI,GAAGhwB,EAAEo+F,KAAKn4F,EAAE+pB,GAAG,CAAC,GAAG,IAAIouE,GAAG,IAAIpuE,EAAG,MAAMouE,IAAQ,IAAJpuE,GAAShwB,EAAEo+F,KAAKn4F,EAAE+pB,GAAG,CAAC,IAAInrB,EAAE,KAAK7E,EAAEo+F,GAAGt+F,QAAQ,WAAW,QAA6F,OAArFtK,EAAE0rG,aAAar8F,EAAEC,SAAS,iBAAiBD,EAAEA,EAAE/E,QAAQ,cAActK,EAAE0rG,cAAqBr8F,CAAC,QAAO,GAAGu5F,GAAG,GAAGpuE,GAAG,KAAK,CAAC,CAAC,CAAC,QAAQ4wE,GAAG,EAAGlkG,MAAMokG,kBAAkB7wG,CAAC,CAAC,OAAOuF,EAAEA,EAAEA,EAAE0rG,aAAa1rG,EAAE9F,KAAK,IAAIixG,EAAGnrG,GAAG,EAAE,CAC9Z,SAAS2rG,EAAG3rG,GAAG,OAAOA,EAAE1D,KAAK,KAAK,EAAE,OAAO6uG,EAAGnrG,EAAE0G,MAAM,KAAK,GAAG,OAAOykG,EAAG,QAAQ,KAAK,GAAG,OAAOA,EAAG,YAAY,KAAK,GAAG,OAAOA,EAAG,gBAAgB,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,OAAOnrG,EAAEqrG,EAAGrrG,EAAE0G,MAAK,GAAM,KAAK,GAAG,OAAO1G,EAAEqrG,EAAGrrG,EAAE0G,KAAKklG,QAAO,GAAM,KAAK,EAAE,OAAO5rG,EAAEqrG,EAAGrrG,EAAE0G,MAAK,GAAM,QAAQ,MAAM,GAAG,CACxR,SAASmlG,EAAG7rG,GAAG,GAAG,MAAMA,EAAE,OAAO,KAAK,GAAG,oBAAoBA,EAAE,OAAOA,EAAE0rG,aAAa1rG,EAAE9F,MAAM,KAAK,GAAG,kBAAkB8F,EAAE,OAAOA,EAAE,OAAOA,GAAG,KAAKoqG,EAAG,MAAM,WAAW,KAAKD,EAAG,MAAM,SAAS,KAAKG,EAAG,MAAM,WAAW,KAAKD,EAAG,MAAM,aAAa,KAAKK,EAAG,MAAM,WAAW,KAAKC,EAAG,MAAM,eAAe,GAAG,kBAAkB3qG,EAAE,OAAOA,EAAE8rG,UAAU,KAAKtB,EAAG,OAAOxqG,EAAE0rG,aAAa,WAAW,YAAY,KAAKnB,EAAG,OAAOvqG,EAAE+rG,SAASL,aAAa,WAAW,YAAY,KAAKjB,EAAG,IAAIxqG,EAAED,EAAE4rG,OAC7Z,OADoa5rG,EAAEA,EAAE0rG,eACnd1rG,EAAE,MADieA,EAAEC,EAAEyrG,aAClfzrG,EAAE/F,MAAM,IAAY,cAAc8F,EAAE,IAAI,cAAqBA,EAAE,KAAK4qG,EAAG,OAA6B,QAAtB3qG,EAAED,EAAE0rG,aAAa,MAAczrG,EAAE4rG,EAAG7rG,EAAE0G,OAAO,OAAO,KAAKmkG,EAAG5qG,EAAED,EAAEgsG,SAAShsG,EAAEA,EAAEisG,MAAM,IAAI,OAAOJ,EAAG7rG,EAAEC,GAAG,CAAC,MAAMxF,GAAG,EAAE,OAAO,IAAI,CAC3M,SAASyxG,EAAGlsG,GAAG,IAAIC,EAAED,EAAE0G,KAAK,OAAO1G,EAAE1D,KAAK,KAAK,GAAG,MAAM,QAAQ,KAAK,EAAE,OAAO2D,EAAEyrG,aAAa,WAAW,YAAY,KAAK,GAAG,OAAOzrG,EAAE8rG,SAASL,aAAa,WAAW,YAAY,KAAK,GAAG,MAAM,qBAAqB,KAAK,GAAG,OAAkB1rG,GAAXA,EAAEC,EAAE2rG,QAAWF,aAAa1rG,EAAE9F,MAAM,GAAG+F,EAAEyrG,cAAc,KAAK1rG,EAAE,cAAcA,EAAE,IAAI,cAAc,KAAK,EAAE,MAAM,WAAW,KAAK,EAAE,OAAOC,EAAE,KAAK,EAAE,MAAM,SAAS,KAAK,EAAE,MAAM,OAAO,KAAK,EAAE,MAAM,OAAO,KAAK,GAAG,OAAO4rG,EAAG5rG,GAAG,KAAK,EAAE,OAAOA,IAAIoqG,EAAG,aAAa,OAAO,KAAK,GAAG,MAAM,YACtf,KAAK,GAAG,MAAM,WAAW,KAAK,GAAG,MAAM,QAAQ,KAAK,GAAG,MAAM,WAAW,KAAK,GAAG,MAAM,eAAe,KAAK,GAAG,MAAM,gBAAgB,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,GAAG,oBAAoBpqG,EAAE,OAAOA,EAAEyrG,aAAazrG,EAAE/F,MAAM,KAAK,GAAG,kBAAkB+F,EAAE,OAAOA,EAAE,OAAO,IAAI,CAAC,SAASksG,EAAGnsG,GAAG,cAAcA,GAAG,IAAK,UAAU,IAAK,SAAS,IAAK,SAAS,IAAK,YAAqB,IAAK,SAAS,OAAOA,EAAE,QAAQ,MAAM,GAAG,CACra,SAASosG,EAAGpsG,GAAG,IAAIC,EAAED,EAAE0G,KAAK,OAAO1G,EAAEA,EAAEqsG,WAAW,UAAUrsG,EAAEwoB,gBAAgB,aAAavoB,GAAG,UAAUA,EAAE,CAEtF,SAASqsG,EAAGtsG,GAAGA,EAAEusG,gBAAgBvsG,EAAEusG,cADvD,SAAYvsG,GAAG,IAAIC,EAAEmsG,EAAGpsG,GAAG,UAAU,QAAQvF,EAAE6D,OAAOkuG,yBAAyBxsG,EAAEkK,YAAYqD,UAAUtN,GAAGlF,EAAE,GAAGiF,EAAEC,GAAG,IAAID,EAAE+K,eAAe9K,IAAI,qBAAqBxF,GAAG,oBAAoBA,EAAEuB,KAAK,oBAAoBvB,EAAEwY,IAAI,CAAC,IAAIzI,EAAE/P,EAAEuB,IAAIyU,EAAEhW,EAAEwY,IAAiL,OAA7K3U,OAAOq7E,eAAe35E,EAAEC,EAAE,CAACwsG,cAAa,EAAGzwG,IAAI,WAAW,OAAOwO,EAAEoE,KAAK9G,KAAK,EAAEmL,IAAI,SAASjT,GAAGjF,EAAE,GAAGiF,EAAEyQ,EAAE7B,KAAK9G,KAAK9H,EAAE,IAAI1B,OAAOq7E,eAAe35E,EAAEC,EAAE,CAACysG,WAAWjyG,EAAEiyG,aAAmB,CAAC//D,SAAS,WAAW,OAAO5xC,CAAC,EAAE4xG,SAAS,SAAS3sG,GAAGjF,EAAE,GAAGiF,CAAC,EAAE4sG,aAAa,WAAW5sG,EAAEusG,cACxf,YAAYvsG,EAAEC,EAAE,EAAE,CAAC,CAAkD4sG,CAAG7sG,GAAG,CAAC,SAAS8sG,EAAG9sG,GAAG,IAAIA,EAAE,OAAM,EAAG,IAAIC,EAAED,EAAEusG,cAAc,IAAItsG,EAAE,OAAM,EAAG,IAAIxF,EAAEwF,EAAE0sC,WAAe5xC,EAAE,GAAqD,OAAlDiF,IAAIjF,EAAEqxG,EAAGpsG,GAAGA,EAAE+sG,QAAQ,OAAO,QAAQ/sG,EAAEyG,QAAOzG,EAAEjF,KAAaN,IAAGwF,EAAE0sG,SAAS3sG,IAAG,EAAM,CAAC,SAASgtG,EAAGhtG,GAAwD,GAAG,qBAAxDA,EAAEA,IAAI,qBAAqB3F,SAASA,cAAS,IAAkC,OAAO,KAAK,IAAI,OAAO2F,EAAEitG,eAAejtG,EAAEiG,IAAI,CAAC,MAAMhG,GAAG,OAAOD,EAAEiG,IAAI,CAAC,CACpa,SAASinG,EAAGltG,EAAEC,GAAG,IAAIxF,EAAEwF,EAAE8sG,QAAQ,OAAO7B,EAAE,CAAC,EAAEjrG,EAAE,CAACktG,oBAAe,EAAOlc,kBAAa,EAAOxqF,WAAM,EAAOsmG,QAAQ,MAAMtyG,EAAEA,EAAEuF,EAAEotG,cAAcC,gBAAgB,CAAC,SAASC,EAAGttG,EAAEC,GAAG,IAAIxF,EAAE,MAAMwF,EAAEgxF,aAAa,GAAGhxF,EAAEgxF,aAAal2F,EAAE,MAAMkF,EAAE8sG,QAAQ9sG,EAAE8sG,QAAQ9sG,EAAEktG,eAAe1yG,EAAE0xG,EAAG,MAAMlsG,EAAEwG,MAAMxG,EAAEwG,MAAMhM,GAAGuF,EAAEotG,cAAc,CAACC,eAAetyG,EAAEwyG,aAAa9yG,EAAE+yG,WAAW,aAAavtG,EAAEyG,MAAM,UAAUzG,EAAEyG,KAAK,MAAMzG,EAAE8sG,QAAQ,MAAM9sG,EAAEwG,MAAM,CAAC,SAASgnG,EAAGztG,EAAEC,GAAe,OAAZA,EAAEA,EAAE8sG,UAAiBxD,EAAGvpG,EAAE,UAAUC,GAAE,EAAG,CAC9d,SAASytG,EAAG1tG,EAAEC,GAAGwtG,EAAGztG,EAAEC,GAAG,IAAIxF,EAAE0xG,EAAGlsG,EAAEwG,OAAO1L,EAAEkF,EAAEyG,KAAK,GAAG,MAAMjM,EAAK,WAAWM,GAAM,IAAIN,GAAG,KAAKuF,EAAEyG,OAAOzG,EAAEyG,OAAOhM,KAAEuF,EAAEyG,MAAM,GAAGhM,GAAOuF,EAAEyG,QAAQ,GAAGhM,IAAIuF,EAAEyG,MAAM,GAAGhM,QAAQ,GAAG,WAAWM,GAAG,UAAUA,EAA8B,YAA3BiF,EAAE2pG,gBAAgB,SAAgB1pG,EAAE8K,eAAe,SAAS4iG,GAAG3tG,EAAEC,EAAEyG,KAAKjM,GAAGwF,EAAE8K,eAAe,iBAAiB4iG,GAAG3tG,EAAEC,EAAEyG,KAAKylG,EAAGlsG,EAAEgxF,eAAe,MAAMhxF,EAAE8sG,SAAS,MAAM9sG,EAAEktG,iBAAiBntG,EAAEmtG,iBAAiBltG,EAAEktG,eAAe,CACla,SAASvsF,EAAG5gB,EAAEC,EAAExF,GAAG,GAAGwF,EAAE8K,eAAe,UAAU9K,EAAE8K,eAAe,gBAAgB,CAAC,IAAIhQ,EAAEkF,EAAEyG,KAAK,KAAK,WAAW3L,GAAG,UAAUA,QAAG,IAASkF,EAAEwG,OAAO,OAAOxG,EAAEwG,OAAO,OAAOxG,EAAE,GAAGD,EAAEotG,cAAcG,aAAa9yG,GAAGwF,IAAID,EAAEyG,QAAQzG,EAAEyG,MAAMxG,GAAGD,EAAEixF,aAAahxF,CAAC,CAAU,MAATxF,EAAEuF,EAAE9F,QAAc8F,EAAE9F,KAAK,IAAI8F,EAAEmtG,iBAAiBntG,EAAEotG,cAAcC,eAAe,KAAK5yG,IAAIuF,EAAE9F,KAAKO,EAAE,CACzV,SAASkzG,GAAG3tG,EAAEC,EAAExF,GAAM,WAAWwF,GAAG+sG,EAAGhtG,EAAE4tG,iBAAiB5tG,IAAE,MAAMvF,EAAEuF,EAAEixF,aAAa,GAAGjxF,EAAEotG,cAAcG,aAAavtG,EAAEixF,eAAe,GAAGx2F,IAAIuF,EAAEixF,aAAa,GAAGx2F,GAAE,CAAC,IAAIozG,GAAGzlG,MAAMC,QAC7K,SAASylG,GAAG9tG,EAAEC,EAAExF,EAAEM,GAAe,GAAZiF,EAAEA,EAAEwT,QAAWvT,EAAE,CAACA,EAAE,CAAC,EAAE,IAAI,IAAIuK,EAAE,EAAEA,EAAE/P,EAAET,OAAOwQ,IAAIvK,EAAE,IAAIxF,EAAE+P,KAAI,EAAG,IAAI/P,EAAE,EAAEA,EAAEuF,EAAEhG,OAAOS,IAAI+P,EAAEvK,EAAE8K,eAAe,IAAI/K,EAAEvF,GAAGgM,OAAOzG,EAAEvF,GAAGszG,WAAWvjG,IAAIxK,EAAEvF,GAAGszG,SAASvjG,GAAGA,GAAGzP,IAAIiF,EAAEvF,GAAGuzG,iBAAgB,EAAG,KAAK,CAAmB,IAAlBvzG,EAAE,GAAG0xG,EAAG1xG,GAAGwF,EAAE,KAASuK,EAAE,EAAEA,EAAExK,EAAEhG,OAAOwQ,IAAI,CAAC,GAAGxK,EAAEwK,GAAG/D,QAAQhM,EAAiD,OAA9CuF,EAAEwK,GAAGujG,UAAS,OAAGhzG,IAAIiF,EAAEwK,GAAGwjG,iBAAgB,IAAW,OAAO/tG,GAAGD,EAAEwK,GAAGyjG,WAAWhuG,EAAED,EAAEwK,GAAG,CAAC,OAAOvK,IAAIA,EAAE8tG,UAAS,EAAG,CAAC,CACxY,SAASG,GAAGluG,EAAEC,GAAG,GAAG,MAAMA,EAAEkuG,wBAAwB,MAAMjnG,MAAMG,EAAE,KAAK,OAAO6jG,EAAE,CAAC,EAAEjrG,EAAE,CAACwG,WAAM,EAAOwqF,kBAAa,EAAOn+C,SAAS,GAAG9yC,EAAEotG,cAAcG,cAAc,CAAC,SAAS3qF,GAAG5iB,EAAEC,GAAG,IAAIxF,EAAEwF,EAAEwG,MAAM,GAAG,MAAMhM,EAAE,CAA+B,GAA9BA,EAAEwF,EAAE6yC,SAAS7yC,EAAEA,EAAEgxF,aAAgB,MAAMx2F,EAAE,CAAC,GAAG,MAAMwF,EAAE,MAAMiH,MAAMG,EAAE,KAAK,GAAGwmG,GAAGpzG,GAAG,CAAC,GAAG,EAAEA,EAAET,OAAO,MAAMkN,MAAMG,EAAE,KAAK5M,EAAEA,EAAE,EAAE,CAACwF,EAAExF,CAAC,CAAC,MAAMwF,IAAIA,EAAE,IAAIxF,EAAEwF,CAAC,CAACD,EAAEotG,cAAc,CAACG,aAAapB,EAAG1xG,GAAG,CACnY,SAAS2zG,GAAGpuG,EAAEC,GAAG,IAAIxF,EAAE0xG,EAAGlsG,EAAEwG,OAAO1L,EAAEoxG,EAAGlsG,EAAEgxF,cAAc,MAAMx2F,KAAIA,EAAE,GAAGA,KAAMuF,EAAEyG,QAAQzG,EAAEyG,MAAMhM,GAAG,MAAMwF,EAAEgxF,cAAcjxF,EAAEixF,eAAex2F,IAAIuF,EAAEixF,aAAax2F,IAAI,MAAMM,IAAIiF,EAAEixF,aAAa,GAAGl2F,EAAE,CAAC,SAASszG,GAAGruG,GAAG,IAAIC,EAAED,EAAE2yB,YAAY1yB,IAAID,EAAEotG,cAAcG,cAAc,KAAKttG,GAAG,OAAOA,IAAID,EAAEyG,MAAMxG,EAAE,CAAC,SAASquG,GAAGtuG,GAAG,OAAOA,GAAG,IAAK,MAAM,MAAM,6BAA6B,IAAK,OAAO,MAAM,qCAAqC,QAAQ,MAAM,+BAA+B,CAC7c,SAASuuG,GAAGvuG,EAAEC,GAAG,OAAO,MAAMD,GAAG,iCAAiCA,EAAEsuG,GAAGruG,GAAG,+BAA+BD,GAAG,kBAAkBC,EAAE,+BAA+BD,CAAC,CAChK,IAAIwuG,GAAexuG,GAAZyuG,IAAYzuG,GAAsJ,SAASA,EAAEC,GAAG,GAAG,+BAA+BD,EAAE0uG,cAAc,cAAc1uG,EAAEA,EAAE2uG,UAAU1uG,MAAM,CAA2F,KAA1FuuG,GAAGA,IAAIn0G,SAAS2L,cAAc,QAAU2oG,UAAU,QAAQ1uG,EAAEkiB,UAAUuC,WAAW,SAAazkB,EAAEuuG,GAAGI,WAAW5uG,EAAE4uG,YAAY5uG,EAAEkxB,YAAYlxB,EAAE4uG,YAAY,KAAK3uG,EAAE2uG,YAAY5uG,EAAEkG,YAAYjG,EAAE2uG,WAAW,CAAC,EAAvb,qBAAqBC,OAAOA,MAAMC,wBAAwB,SAAS7uG,EAAExF,EAAEM,EAAEyP,GAAGqkG,MAAMC,yBAAwB,WAAW,OAAO9uG,GAAEC,EAAExF,EAAM,GAAE,EAAEuF,IACtK,SAAS+uG,GAAG/uG,EAAEC,GAAG,GAAGA,EAAE,CAAC,IAAIxF,EAAEuF,EAAE4uG,WAAW,GAAGn0G,GAAGA,IAAIuF,EAAEgvG,WAAW,IAAIv0G,EAAEm4E,SAAwB,YAAdn4E,EAAEw0G,UAAUhvG,EAAS,CAACD,EAAE2yB,YAAY1yB,CAAC,CACtH,IAAIivG,GAAG,CAACC,yBAAwB,EAAGC,aAAY,EAAGC,mBAAkB,EAAGC,kBAAiB,EAAGC,kBAAiB,EAAGC,SAAQ,EAAGC,cAAa,EAAGC,iBAAgB,EAAGC,aAAY,EAAGC,SAAQ,EAAGC,MAAK,EAAGC,UAAS,EAAGC,cAAa,EAAGC,YAAW,EAAGC,cAAa,EAAGC,WAAU,EAAGC,UAAS,EAAGC,SAAQ,EAAGC,YAAW,EAAGC,aAAY,EAAGC,cAAa,EAAGC,YAAW,EAAGC,eAAc,EAAGC,gBAAe,EAAGC,iBAAgB,EAAGC,YAAW,EAAGC,WAAU,EAAGC,YAAW,EAAGC,SAAQ,EAAGn3C,OAAM,EAAGo3C,SAAQ,EAAGC,SAAQ,EAAGC,QAAO,EAAGC,QAAO,EAClfC,MAAK,EAAGC,aAAY,EAAGC,cAAa,EAAGC,aAAY,EAAGC,iBAAgB,EAAGC,kBAAiB,EAAGC,kBAAiB,EAAGC,eAAc,EAAGC,aAAY,GAAIC,GAAG,CAAC,SAAS,KAAK,MAAM,KAA6H,SAASC,GAAG9xG,EAAEC,EAAExF,GAAG,OAAO,MAAMwF,GAAG,mBAAmBA,GAAG,KAAKA,EAAE,GAAGxF,GAAG,kBAAkBwF,GAAG,IAAIA,GAAGivG,GAAGnkG,eAAe/K,IAAIkvG,GAAGlvG,IAAI,GAAGC,GAAGimG,OAAOjmG,EAAE,IAAI,CACzb,SAAS8xG,GAAG/xG,EAAEC,GAAa,IAAI,IAAIxF,KAAlBuF,EAAEA,EAAE0xB,MAAmBzxB,EAAE,GAAGA,EAAE8K,eAAetQ,GAAG,CAAC,IAAIM,EAAE,IAAIN,EAAEG,QAAQ,MAAM4P,EAAEsnG,GAAGr3G,EAAEwF,EAAExF,GAAGM,GAAG,UAAUN,IAAIA,EAAE,YAAYM,EAAEiF,EAAEgyG,YAAYv3G,EAAE+P,GAAGxK,EAAEvF,GAAG+P,CAAC,CAAC,CADYlM,OAAOC,KAAK2wG,IAAIlrG,SAAQ,SAAShE,GAAG6xG,GAAG7tG,SAAQ,SAAS/D,GAAGA,EAAEA,EAAED,EAAEtF,OAAO,GAAG41D,cAActwD,EAAErF,UAAU,GAAGu0G,GAAGjvG,GAAGivG,GAAGlvG,EAAE,GAAE,IAChI,IAAIiyG,GAAG/G,EAAE,CAACgH,UAAS,GAAI,CAACC,MAAK,EAAGvtC,MAAK,EAAGwtC,IAAG,EAAGC,KAAI,EAAGC,OAAM,EAAGC,IAAG,EAAGC,KAAI,EAAGtqG,OAAM,EAAGuqG,QAAO,EAAGC,MAAK,EAAGzsC,MAAK,EAAG0sC,OAAM,EAAG9nG,QAAO,EAAG+nG,OAAM,EAAGC,KAAI,IAClT,SAASC,GAAG9yG,EAAEC,GAAG,GAAGA,EAAE,CAAC,GAAGgyG,GAAGjyG,KAAK,MAAMC,EAAE6yC,UAAU,MAAM7yC,EAAEkuG,yBAAyB,MAAMjnG,MAAMG,EAAE,IAAIrH,IAAI,GAAG,MAAMC,EAAEkuG,wBAAwB,CAAC,GAAG,MAAMluG,EAAE6yC,SAAS,MAAM5rC,MAAMG,EAAE,KAAK,GAAG,kBAAkBpH,EAAEkuG,2BAA2B,WAAWluG,EAAEkuG,yBAAyB,MAAMjnG,MAAMG,EAAE,IAAK,CAAC,GAAG,MAAMpH,EAAEyxB,OAAO,kBAAkBzxB,EAAEyxB,MAAM,MAAMxqB,MAAMG,EAAE,IAAK,CAAC,CAClW,SAAS0rG,GAAG/yG,EAAEC,GAAG,IAAI,IAAID,EAAEpF,QAAQ,KAAK,MAAM,kBAAkBqF,EAAE+yG,GAAG,OAAOhzG,GAAG,IAAK,iBAAiB,IAAK,gBAAgB,IAAK,YAAY,IAAK,gBAAgB,IAAK,gBAAgB,IAAK,mBAAmB,IAAK,iBAAiB,IAAK,gBAAgB,OAAM,EAAG,QAAQ,OAAM,EAAG,CAAC,IAAIizG,GAAG,KAAK,SAASC,GAAGlzG,GAA6F,OAA1FA,EAAEA,EAAE4K,QAAQ5K,EAAEmzG,YAAYt3G,QAASu3G,0BAA0BpzG,EAAEA,EAAEozG,yBAAgC,IAAIpzG,EAAE4yE,SAAS5yE,EAAEm0B,WAAWn0B,CAAC,CAAC,IAAIqzG,GAAG,KAAKC,GAAG,KAAKC,GAAG,KACpc,SAASC,GAAGxzG,GAAG,GAAGA,EAAEyzG,GAAGzzG,GAAG,CAAC,GAAG,oBAAoBqzG,GAAG,MAAMnsG,MAAMG,EAAE,MAAM,IAAIpH,EAAED,EAAE0zG,UAAUzzG,IAAIA,EAAE0zG,GAAG1zG,GAAGozG,GAAGrzG,EAAE0zG,UAAU1zG,EAAE0G,KAAKzG,GAAG,CAAC,CAAC,SAAS2zG,GAAG5zG,GAAGszG,GAAGC,GAAGA,GAAG50G,KAAKqB,GAAGuzG,GAAG,CAACvzG,GAAGszG,GAAGtzG,CAAC,CAAC,SAAS6zG,KAAK,GAAGP,GAAG,CAAC,IAAItzG,EAAEszG,GAAGrzG,EAAEszG,GAAoB,GAAjBA,GAAGD,GAAG,KAAKE,GAAGxzG,GAAMC,EAAE,IAAID,EAAE,EAAEA,EAAEC,EAAEjG,OAAOgG,IAAIwzG,GAAGvzG,EAAED,GAAG,CAAC,CAAC,SAAS8zG,GAAG9zG,EAAEC,GAAG,OAAOD,EAAEC,EAAE,CAAC,SAAS8zG,KAAK,CAAC,IAAIC,IAAG,EAAG,SAASC,GAAGj0G,EAAEC,EAAExF,GAAG,GAAGu5G,GAAG,OAAOh0G,EAAEC,EAAExF,GAAGu5G,IAAG,EAAG,IAAI,OAAOF,GAAG9zG,EAAEC,EAAExF,EAAE,CAAC,QAAWu5G,IAAG,GAAG,OAAOV,IAAI,OAAOC,MAAGQ,KAAKF,KAAI,CAAC,CAChb,SAASK,GAAGl0G,EAAEC,GAAG,IAAIxF,EAAEuF,EAAE0zG,UAAU,GAAG,OAAOj5G,EAAE,OAAO,KAAK,IAAIM,EAAE44G,GAAGl5G,GAAG,GAAG,OAAOM,EAAE,OAAO,KAAKN,EAAEM,EAAEkF,GAAGD,EAAE,OAAOC,GAAG,IAAK,UAAU,IAAK,iBAAiB,IAAK,gBAAgB,IAAK,uBAAuB,IAAK,cAAc,IAAK,qBAAqB,IAAK,cAAc,IAAK,qBAAqB,IAAK,YAAY,IAAK,mBAAmB,IAAK,gBAAgBlF,GAAGA,EAAEkzG,YAAqBlzG,IAAI,YAAbiF,EAAEA,EAAE0G,OAAuB,UAAU1G,GAAG,WAAWA,GAAG,aAAaA,IAAIA,GAAGjF,EAAE,MAAMiF,EAAE,QAAQA,GAAE,EAAG,GAAGA,EAAE,OAAO,KAAK,GAAGvF,GAAG,oBACleA,EAAE,MAAMyM,MAAMG,EAAE,IAAIpH,SAASxF,IAAI,OAAOA,CAAC,CAAC,IAAI05G,IAAG,EAAG,GAAG5L,EAAG,IAAI,IAAI6L,GAAG,CAAC,EAAE91G,OAAOq7E,eAAey6B,GAAG,UAAU,CAACp4G,IAAI,WAAWm4G,IAAG,CAAE,IAAIt4G,OAAOqe,iBAAiB,OAAOk6F,GAAGA,IAAIv4G,OAAOke,oBAAoB,OAAOq6F,GAAGA,GAAG,CAAC,MAAMp0G,IAAGm0G,IAAG,CAAE,CAAC,SAASE,GAAGr0G,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,EAAEm4F,EAAEpuE,EAAEnrB,GAAG,IAAIo8F,EAAErjG,MAAMmF,UAAU9O,MAAMmQ,KAAK7U,UAAU,GAAG,IAAIkG,EAAEsZ,MAAM9e,EAAEgxG,EAAE,CAAC,MAAMn2E,GAAGxtB,KAAKwsG,QAAQh/E,EAAE,CAAC,CAAC,IAAIi/E,IAAG,EAAGC,GAAG,KAAKC,IAAG,EAAGC,GAAG,KAAKC,GAAG,CAACL,QAAQ,SAASt0G,GAAGu0G,IAAG,EAAGC,GAAGx0G,CAAC,GAAG,SAAS40G,GAAG50G,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,EAAEm4F,EAAEpuE,EAAEnrB,GAAGklG,IAAG,EAAGC,GAAG,KAAKH,GAAG96F,MAAMo7F,GAAG56G,UAAU,CACjW,SAAS86G,GAAG70G,GAAG,IAAIC,EAAED,EAAEvF,EAAEuF,EAAE,GAAGA,EAAE80G,UAAU,KAAK70G,EAAE80G,QAAQ90G,EAAEA,EAAE80G,WAAW,CAAC/0G,EAAEC,EAAE,GAAO,KAAa,MAAjBA,EAAED,GAASg1G,SAAcv6G,EAAEwF,EAAE80G,QAAQ/0G,EAAEC,EAAE80G,aAAa/0G,EAAE,CAAC,OAAO,IAAIC,EAAE3D,IAAI7B,EAAE,IAAI,CAAC,SAASw6G,GAAGj1G,GAAG,GAAG,KAAKA,EAAE1D,IAAI,CAAC,IAAI2D,EAAED,EAAEk1G,cAAsE,GAAxD,OAAOj1G,IAAkB,QAAdD,EAAEA,EAAE80G,aAAqB70G,EAAED,EAAEk1G,gBAAmB,OAAOj1G,EAAE,OAAOA,EAAEk1G,UAAU,CAAC,OAAO,IAAI,CAAC,SAASC,GAAGp1G,GAAG,GAAG60G,GAAG70G,KAAKA,EAAE,MAAMkH,MAAMG,EAAE,KAAM,CAE1S,SAASguG,GAAGr1G,GAAW,OAAO,QAAfA,EADtN,SAAYA,GAAG,IAAIC,EAAED,EAAE80G,UAAU,IAAI70G,EAAE,CAAS,GAAG,QAAXA,EAAE40G,GAAG70G,IAAe,MAAMkH,MAAMG,EAAE,MAAM,OAAOpH,IAAID,EAAE,KAAKA,CAAC,CAAC,IAAI,IAAIvF,EAAEuF,EAAEjF,EAAEkF,IAAI,CAAC,IAAIuK,EAAE/P,EAAEs6G,OAAO,GAAG,OAAOvqG,EAAE,MAAM,IAAIiG,EAAEjG,EAAEsqG,UAAU,GAAG,OAAOrkG,EAAE,CAAY,GAAG,QAAd1V,EAAEyP,EAAEuqG,QAAmB,CAACt6G,EAAEM,EAAE,QAAQ,CAAC,KAAK,CAAC,GAAGyP,EAAEumC,QAAQtgC,EAAEsgC,MAAM,CAAC,IAAItgC,EAAEjG,EAAEumC,MAAMtgC,GAAG,CAAC,GAAGA,IAAIhW,EAAE,OAAO26G,GAAG5qG,GAAGxK,EAAE,GAAGyQ,IAAI1V,EAAE,OAAOq6G,GAAG5qG,GAAGvK,EAAEwQ,EAAEA,EAAE6kG,OAAO,CAAC,MAAMpuG,MAAMG,EAAE,KAAM,CAAC,GAAG5M,EAAEs6G,SAASh6G,EAAEg6G,OAAOt6G,EAAE+P,EAAEzP,EAAE0V,MAAM,CAAC,IAAI,IAAIm4F,GAAE,EAAGpuE,EAAEhwB,EAAEumC,MAAMvW,GAAG,CAAC,GAAGA,IAAI//B,EAAE,CAACmuG,GAAE,EAAGnuG,EAAE+P,EAAEzP,EAAE0V,EAAE,KAAK,CAAC,GAAG+pB,IAAIz/B,EAAE,CAAC6tG,GAAE,EAAG7tG,EAAEyP,EAAE/P,EAAEgW,EAAE,KAAK,CAAC+pB,EAAEA,EAAE86E,OAAO,CAAC,IAAI1M,EAAE,CAAC,IAAIpuE,EAAE/pB,EAAEsgC,MAAMvW,GAAG,CAAC,GAAGA,IAC5f//B,EAAE,CAACmuG,GAAE,EAAGnuG,EAAEgW,EAAE1V,EAAEyP,EAAE,KAAK,CAAC,GAAGgwB,IAAIz/B,EAAE,CAAC6tG,GAAE,EAAG7tG,EAAE0V,EAAEhW,EAAE+P,EAAE,KAAK,CAACgwB,EAAEA,EAAE86E,OAAO,CAAC,IAAI1M,EAAE,MAAM1hG,MAAMG,EAAE,KAAM,CAAC,CAAC,GAAG5M,EAAEq6G,YAAY/5G,EAAE,MAAMmM,MAAMG,EAAE,KAAM,CAAC,GAAG,IAAI5M,EAAE6B,IAAI,MAAM4K,MAAMG,EAAE,MAAM,OAAO5M,EAAEi5G,UAAUzvG,UAAUxJ,EAAEuF,EAAEC,CAAC,CAAkBs1G,CAAGv1G,IAAmBw1G,GAAGx1G,GAAG,IAAI,CAAC,SAASw1G,GAAGx1G,GAAG,GAAG,IAAIA,EAAE1D,KAAK,IAAI0D,EAAE1D,IAAI,OAAO0D,EAAE,IAAIA,EAAEA,EAAE+wC,MAAM,OAAO/wC,GAAG,CAAC,IAAIC,EAAEu1G,GAAGx1G,GAAG,GAAG,OAAOC,EAAE,OAAOA,EAAED,EAAEA,EAAEs1G,OAAO,CAAC,OAAO,IAAI,CAC1X,IAAIG,GAAGt7G,EAAGu7G,0BAA0BC,GAAGx7G,EAAGy7G,wBAAwBC,GAAG17G,EAAG27G,qBAAqBC,GAAG57G,EAAG67G,sBAAsBC,GAAE97G,EAAG+7G,aAAaC,GAAGh8G,EAAGi8G,iCAAiCC,GAAGl8G,EAAGm8G,2BAA2BC,GAAGp8G,EAAGq8G,8BAA8BC,GAAGt8G,EAAGu8G,wBAAwBC,GAAGx8G,EAAGy8G,qBAAqBC,GAAG18G,EAAG28G,sBAAsBC,GAAG,KAAKC,GAAG,KACvV,IAAIC,GAAGpvF,KAAKqvF,MAAMrvF,KAAKqvF,MAAiC,SAAYl3G,GAAU,OAAPA,KAAK,EAAS,IAAIA,EAAE,GAAG,IAAIm3G,GAAGn3G,GAAGo3G,GAAG,GAAG,CAAC,EAA/ED,GAAGtvF,KAAK5qB,IAAIm6G,GAAGvvF,KAAKK,IAA4D,IAAImvF,GAAG,GAAGC,GAAG,QAC7H,SAASC,GAAGv3G,GAAG,OAAOA,GAAGA,GAAG,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,EAAE,OAAO,EAAE,KAAK,GAAG,OAAO,GAAG,KAAK,GAAG,OAAO,GAAG,KAAK,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,QAAQ,OAAS,QAAFA,EAAU,KAAK,QAAQ,KAAK,QAAQ,KAAK,SAAS,KAAK,SAAS,KAAK,SAAS,OAAS,UAAFA,EAAY,KAAK,UAAU,OAAO,UAAU,KAAK,UAAU,OAAO,UAAU,KAAK,UAAU,OAAO,UAAU,KAAK,WAAW,OAAO,WACzgB,QAAQ,OAAOA,EAAE,CAAC,SAASw3G,GAAGx3G,EAAEC,GAAG,IAAIxF,EAAEuF,EAAEy3G,aAAa,GAAG,IAAIh9G,EAAE,OAAO,EAAE,IAAIM,EAAE,EAAEyP,EAAExK,EAAE03G,eAAejnG,EAAEzQ,EAAE23G,YAAY/O,EAAI,UAAFnuG,EAAY,GAAG,IAAImuG,EAAE,CAAC,IAAIpuE,EAAEouE,GAAGp+F,EAAE,IAAIgwB,EAAEz/B,EAAEw8G,GAAG/8E,GAAS,KAAL/pB,GAAGm4F,KAAU7tG,EAAEw8G,GAAG9mG,GAAI,MAAa,KAAPm4F,EAAEnuG,GAAG+P,GAAQzP,EAAEw8G,GAAG3O,GAAG,IAAIn4F,IAAI1V,EAAEw8G,GAAG9mG,IAAI,GAAG,IAAI1V,EAAE,OAAO,EAAE,GAAG,IAAIkF,GAAGA,IAAIlF,GAAG,KAAKkF,EAAEuK,MAAKA,EAAEzP,GAAGA,KAAE0V,EAAExQ,GAAGA,IAAQ,KAAKuK,GAAG,KAAO,QAAFiG,IAAY,OAAOxQ,EAA0C,GAAxC,KAAO,EAAFlF,KAAOA,GAAK,GAAFN,GAA4B,KAAtBwF,EAAED,EAAE43G,gBAAwB,IAAI53G,EAAEA,EAAE63G,cAAc53G,GAAGlF,EAAE,EAAEkF,GAAcuK,EAAE,IAAb/P,EAAE,GAAGw8G,GAAGh3G,IAAUlF,GAAGiF,EAAEvF,GAAGwF,IAAIuK,EAAE,OAAOzP,CAAC,CACvc,SAAS+8G,GAAG93G,EAAEC,GAAG,OAAOD,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,OAAOC,EAAE,IAAI,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,QAAQ,OAAOA,EAAE,IAAuJ,QAAQ,OAAO,EAAE,CACrN,SAAS83G,GAAG/3G,GAAgC,OAAO,KAApCA,GAAkB,WAAhBA,EAAEy3G,cAAsCz3G,EAAI,WAAFA,EAAa,WAAW,CAAC,CAAC,SAASg4G,KAAK,IAAIh4G,EAAEq3G,GAAoC,OAA1B,KAAQ,SAAfA,KAAK,MAAqBA,GAAG,IAAWr3G,CAAC,CAAC,SAASi4G,GAAGj4G,GAAG,IAAI,IAAIC,EAAE,GAAGxF,EAAE,EAAE,GAAGA,EAAEA,IAAIwF,EAAEtB,KAAKqB,GAAG,OAAOC,CAAC,CAC3a,SAASi4G,GAAGl4G,EAAEC,EAAExF,GAAGuF,EAAEy3G,cAAcx3G,EAAE,YAAYA,IAAID,EAAE03G,eAAe,EAAE13G,EAAE23G,YAAY,IAAG33G,EAAEA,EAAEm4G,YAAWl4G,EAAE,GAAGg3G,GAAGh3G,IAAQxF,CAAC,CACzH,SAAS29G,GAAGp4G,EAAEC,GAAG,IAAIxF,EAAEuF,EAAE43G,gBAAgB33G,EAAE,IAAID,EAAEA,EAAE63G,cAAcp9G,GAAG,CAAC,IAAIM,EAAE,GAAGk8G,GAAGx8G,GAAG+P,EAAE,GAAGzP,EAAEyP,EAAEvK,EAAED,EAAEjF,GAAGkF,IAAID,EAAEjF,IAAIkF,GAAGxF,IAAI+P,CAAC,CAAC,CAAC,IAAI6tG,GAAE,EAAE,SAASC,GAAGt4G,GAAS,OAAO,GAAbA,IAAIA,GAAa,EAAEA,EAAE,KAAO,UAAFA,GAAa,GAAG,UAAU,EAAE,CAAC,CAAC,IAAIu4G,GAAGC,GAAGC,GAAGC,GAAGC,GAAGC,IAAG,EAAGC,GAAG,GAAGC,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAKC,GAAG,IAAIzmG,IAAI0mG,GAAG,IAAI1mG,IAAI2mG,GAAG,GAAGC,GAAG,6PAA6P7+G,MAAM,KAChiB,SAAS8+G,GAAGr5G,EAAEC,GAAG,OAAOD,GAAG,IAAK,UAAU,IAAK,WAAW84G,GAAG,KAAK,MAAM,IAAK,YAAY,IAAK,YAAYC,GAAG,KAAK,MAAM,IAAK,YAAY,IAAK,WAAWC,GAAG,KAAK,MAAM,IAAK,cAAc,IAAK,aAAaC,GAAGjlG,OAAO/T,EAAEq5G,WAAW,MAAM,IAAK,oBAAoB,IAAK,qBAAqBJ,GAAGllG,OAAO/T,EAAEq5G,WAAW,CACnT,SAASC,GAAGv5G,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,GAAG,OAAG,OAAOzQ,GAAGA,EAAEw5G,cAAc/oG,GAASzQ,EAAE,CAACy5G,UAAUx5G,EAAEy5G,aAAaj/G,EAAEk/G,iBAAiB5+G,EAAEy+G,YAAY/oG,EAAEmpG,iBAAiB,CAACpvG,IAAI,OAAOvK,IAAY,QAARA,EAAEwzG,GAAGxzG,KAAau4G,GAAGv4G,IAAID,IAAEA,EAAE25G,kBAAkB5+G,EAAEkF,EAAED,EAAE45G,iBAAiB,OAAOpvG,IAAI,IAAIvK,EAAErF,QAAQ4P,IAAIvK,EAAEtB,KAAK6L,GAAUxK,EAAC,CAEpR,SAAS65G,GAAG75G,GAAG,IAAIC,EAAE65G,GAAG95G,EAAE4K,QAAQ,GAAG,OAAO3K,EAAE,CAAC,IAAIxF,EAAEo6G,GAAG50G,GAAG,GAAG,OAAOxF,EAAE,GAAW,MAARwF,EAAExF,EAAE6B,MAAY,GAAW,QAAR2D,EAAEg1G,GAAGx6G,IAA4D,OAA/CuF,EAAEy5G,UAAUx5G,OAAE04G,GAAG34G,EAAEgrC,UAAS,WAAWytE,GAAGh+G,EAAE,SAAgB,GAAG,IAAIwF,GAAGxF,EAAEi5G,UAAUzvG,QAAQixG,cAAc6E,aAAmE,YAArD/5G,EAAEy5G,UAAU,IAAIh/G,EAAE6B,IAAI7B,EAAEi5G,UAAUsG,cAAc,KAAY,CAACh6G,EAAEy5G,UAAU,IAAI,CAClT,SAASQ,GAAGj6G,GAAG,GAAG,OAAOA,EAAEy5G,UAAU,OAAM,EAAG,IAAI,IAAIx5G,EAAED,EAAE45G,iBAAiB,EAAE35G,EAAEjG,QAAQ,CAAC,IAAIS,EAAEy/G,GAAGl6G,EAAE05G,aAAa15G,EAAE25G,iBAAiB15G,EAAE,GAAGD,EAAEw5G,aAAa,GAAG,OAAO/+G,EAAiG,OAAe,QAARwF,EAAEwzG,GAAGh5G,KAAa+9G,GAAGv4G,GAAGD,EAAEy5G,UAAUh/G,GAAE,EAA3H,IAAIM,EAAE,IAAtBN,EAAEuF,EAAEw5G,aAAwBtvG,YAAYzP,EAAEiM,KAAKjM,GAAGw4G,GAAGl4G,EAAEN,EAAEmQ,OAAOuvG,cAAcp/G,GAAGk4G,GAAG,KAA0DhzG,EAAEyb,OAAO,CAAC,OAAM,CAAE,CAAC,SAAS0+F,GAAGp6G,EAAEC,EAAExF,GAAGw/G,GAAGj6G,IAAIvF,EAAEuZ,OAAO/T,EAAE,CAAC,SAASo6G,KAAKzB,IAAG,EAAG,OAAOE,IAAImB,GAAGnB,MAAMA,GAAG,MAAM,OAAOC,IAAIkB,GAAGlB,MAAMA,GAAG,MAAM,OAAOC,IAAIiB,GAAGjB,MAAMA,GAAG,MAAMC,GAAGj1G,QAAQo2G,IAAIlB,GAAGl1G,QAAQo2G,GAAG,CACnf,SAASE,GAAGt6G,EAAEC,GAAGD,EAAEy5G,YAAYx5G,IAAID,EAAEy5G,UAAU,KAAKb,KAAKA,IAAG,EAAGz+G,EAAGu7G,0BAA0Bv7G,EAAGu8G,wBAAwB2D,KAAK,CAC5H,SAASE,GAAGv6G,GAAG,SAASC,EAAEA,GAAG,OAAOq6G,GAAGr6G,EAAED,EAAE,CAAC,GAAG,EAAE64G,GAAG7+G,OAAO,CAACsgH,GAAGzB,GAAG,GAAG74G,GAAG,IAAI,IAAIvF,EAAE,EAAEA,EAAEo+G,GAAG7+G,OAAOS,IAAI,CAAC,IAAIM,EAAE89G,GAAGp+G,GAAGM,EAAE0+G,YAAYz5G,IAAIjF,EAAE0+G,UAAU,KAAK,CAAC,CAAyF,IAAxF,OAAOX,IAAIwB,GAAGxB,GAAG94G,GAAG,OAAO+4G,IAAIuB,GAAGvB,GAAG/4G,GAAG,OAAOg5G,IAAIsB,GAAGtB,GAAGh5G,GAAGi5G,GAAGj1G,QAAQ/D,GAAGi5G,GAAGl1G,QAAQ/D,GAAOxF,EAAE,EAAEA,EAAE0+G,GAAGn/G,OAAOS,KAAIM,EAAEo+G,GAAG1+G,IAAKg/G,YAAYz5G,IAAIjF,EAAE0+G,UAAU,MAAM,KAAK,EAAEN,GAAGn/G,QAAiB,QAARS,EAAE0+G,GAAG,IAAYM,WAAYI,GAAGp/G,GAAG,OAAOA,EAAEg/G,WAAWN,GAAGz9F,OAAO,CAAC,IAAI8+F,GAAGzQ,EAAG0Q,wBAAwBC,IAAG,EAC5a,SAASC,GAAG36G,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAE6tG,GAAE5nG,EAAE+pG,GAAGI,WAAWJ,GAAGI,WAAW,KAAK,IAAIvC,GAAE,EAAEwC,GAAG76G,EAAEC,EAAExF,EAAEM,EAAE,CAAC,QAAQs9G,GAAE7tG,EAAEgwG,GAAGI,WAAWnqG,CAAC,CAAC,CAAC,SAASqqG,GAAG96G,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAE6tG,GAAE5nG,EAAE+pG,GAAGI,WAAWJ,GAAGI,WAAW,KAAK,IAAIvC,GAAE,EAAEwC,GAAG76G,EAAEC,EAAExF,EAAEM,EAAE,CAAC,QAAQs9G,GAAE7tG,EAAEgwG,GAAGI,WAAWnqG,CAAC,CAAC,CACjO,SAASoqG,GAAG76G,EAAEC,EAAExF,EAAEM,GAAG,GAAG2/G,GAAG,CAAC,IAAIlwG,EAAE0vG,GAAGl6G,EAAEC,EAAExF,EAAEM,GAAG,GAAG,OAAOyP,EAAEuwG,GAAG/6G,EAAEC,EAAElF,EAAEsqB,GAAG5qB,GAAG4+G,GAAGr5G,EAAEjF,QAAQ,GANtF,SAAYiF,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,OAAOvK,GAAG,IAAK,UAAU,OAAO64G,GAAGS,GAAGT,GAAG94G,EAAEC,EAAExF,EAAEM,EAAEyP,IAAG,EAAG,IAAK,YAAY,OAAOuuG,GAAGQ,GAAGR,GAAG/4G,EAAEC,EAAExF,EAAEM,EAAEyP,IAAG,EAAG,IAAK,YAAY,OAAOwuG,GAAGO,GAAGP,GAAGh5G,EAAEC,EAAExF,EAAEM,EAAEyP,IAAG,EAAG,IAAK,cAAc,IAAIiG,EAAEjG,EAAE8uG,UAAkD,OAAxCL,GAAGhmG,IAAIxC,EAAE8oG,GAAGN,GAAGj9G,IAAIyU,IAAI,KAAKzQ,EAAEC,EAAExF,EAAEM,EAAEyP,KAAU,EAAG,IAAK,oBAAoB,OAAOiG,EAAEjG,EAAE8uG,UAAUJ,GAAGjmG,IAAIxC,EAAE8oG,GAAGL,GAAGl9G,IAAIyU,IAAI,KAAKzQ,EAAEC,EAAExF,EAAEM,EAAEyP,KAAI,EAAG,OAAM,CAAE,CAM1QwwG,CAAGxwG,EAAExK,EAAEC,EAAExF,EAAEM,GAAGA,EAAEkgH,uBAAuB,GAAG5B,GAAGr5G,EAAEjF,GAAK,EAAFkF,IAAM,EAAEm5G,GAAGx+G,QAAQoF,GAAG,CAAC,KAAK,OAAOwK,GAAG,CAAC,IAAIiG,EAAEgjG,GAAGjpG,GAA0D,GAAvD,OAAOiG,GAAG8nG,GAAG9nG,GAAiB,QAAdA,EAAEypG,GAAGl6G,EAAEC,EAAExF,EAAEM,KAAaggH,GAAG/6G,EAAEC,EAAElF,EAAEsqB,GAAG5qB,GAAMgW,IAAIjG,EAAE,MAAMA,EAAEiG,CAAC,CAAC,OAAOjG,GAAGzP,EAAEkgH,iBAAiB,MAAMF,GAAG/6G,EAAEC,EAAElF,EAAE,KAAKN,EAAE,CAAC,CAAC,IAAI4qB,GAAG,KACpU,SAAS60F,GAAGl6G,EAAEC,EAAExF,EAAEM,GAA2B,GAAxBsqB,GAAG,KAAwB,QAAXrlB,EAAE85G,GAAV95G,EAAEkzG,GAAGn4G,KAAuB,GAAW,QAARkF,EAAE40G,GAAG70G,IAAYA,EAAE,UAAU,GAAW,MAARvF,EAAEwF,EAAE3D,KAAW,CAAS,GAAG,QAAX0D,EAAEi1G,GAAGh1G,IAAe,OAAOD,EAAEA,EAAE,IAAI,MAAM,GAAG,IAAIvF,EAAE,CAAC,GAAGwF,EAAEyzG,UAAUzvG,QAAQixG,cAAc6E,aAAa,OAAO,IAAI95G,EAAE3D,IAAI2D,EAAEyzG,UAAUsG,cAAc,KAAKh6G,EAAE,IAAI,MAAMC,IAAID,IAAIA,EAAE,MAAW,OAALqlB,GAAGrlB,EAAS,IAAI,CAC7S,SAASk7G,GAAGl7G,GAAG,OAAOA,GAAG,IAAK,SAAS,IAAK,QAAQ,IAAK,QAAQ,IAAK,cAAc,IAAK,OAAO,IAAK,MAAM,IAAK,WAAW,IAAK,WAAW,IAAK,UAAU,IAAK,YAAY,IAAK,OAAO,IAAK,UAAU,IAAK,WAAW,IAAK,QAAQ,IAAK,UAAU,IAAK,UAAU,IAAK,WAAW,IAAK,QAAQ,IAAK,YAAY,IAAK,UAAU,IAAK,QAAQ,IAAK,QAAQ,IAAK,OAAO,IAAK,gBAAgB,IAAK,cAAc,IAAK,YAAY,IAAK,aAAa,IAAK,QAAQ,IAAK,SAAS,IAAK,SAAS,IAAK,SAAS,IAAK,cAAc,IAAK,WAAW,IAAK,aAAa,IAAK,eAAe,IAAK,SAAS,IAAK,kBAAkB,IAAK,YAAY,IAAK,mBAAmB,IAAK,iBAAiB,IAAK,oBAAoB,IAAK,aAAa,IAAK,YAAY,IAAK,cAAc,IAAK,OAAO,IAAK,mBAAmB,IAAK,QAAQ,IAAK,aAAa,IAAK,WAAW,IAAK,SAAS,IAAK,cAAc,OAAO,EAAE,IAAK,OAAO,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,cAAc,IAAK,aAAa,IAAK,cAAc,IAAK,SAAS,IAAK,SAAS,IAAK,YAAY,IAAK,QAAQ,IAAK,aAAa,IAAK,aAAa,IAAK,eAAe,IAAK,eAAe,OAAO,EACpqC,IAAK,UAAU,OAAOm2G,MAAM,KAAKE,GAAG,OAAO,EAAE,KAAKE,GAAG,OAAO,EAAE,KAAKE,GAAG,KAAKE,GAAG,OAAO,GAAG,KAAKE,GAAG,OAAO,UAAU,QAAQ,OAAO,GAAG,QAAQ,OAAO,GAAG,CAAC,IAAIsE,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAK,SAASC,KAAK,GAAGD,GAAG,OAAOA,GAAG,IAAIr7G,EAAkBjF,EAAhBkF,EAAEm7G,GAAG3gH,EAAEwF,EAAEjG,OAASwQ,EAAE,UAAU2wG,GAAGA,GAAG10G,MAAM00G,GAAGxoF,YAAYliB,EAAEjG,EAAExQ,OAAO,IAAIgG,EAAE,EAAEA,EAAEvF,GAAGwF,EAAED,KAAKwK,EAAExK,GAAGA,KAAK,IAAI4oG,EAAEnuG,EAAEuF,EAAE,IAAIjF,EAAE,EAAEA,GAAG6tG,GAAG3oG,EAAExF,EAAEM,KAAKyP,EAAEiG,EAAE1V,GAAGA,KAAK,OAAOsgH,GAAG7wG,EAAE/L,MAAMuB,EAAE,EAAEjF,EAAE,EAAEA,OAAE,EAAO,CACxY,SAASwgH,GAAGv7G,GAAG,IAAIC,EAAED,EAAEw7G,QAA+E,MAAvE,aAAax7G,EAAgB,KAAbA,EAAEA,EAAEy7G,WAAgB,KAAKx7G,IAAID,EAAE,IAAKA,EAAEC,EAAE,KAAKD,IAAIA,EAAE,IAAW,IAAIA,GAAG,KAAKA,EAAEA,EAAE,CAAC,CAAC,SAAS07G,KAAK,OAAM,CAAE,CAAC,SAASC,KAAK,OAAM,CAAE,CAC5K,SAASC,GAAG57G,GAAG,SAASC,EAAEA,EAAElF,EAAEyP,EAAEiG,EAAEm4F,GAA6G,IAAI,IAAInuG,KAAlHqN,KAAK+zG,WAAW57G,EAAE6H,KAAKg0G,YAAYtxG,EAAE1C,KAAKpB,KAAK3L,EAAE+M,KAAK0xG,YAAY/oG,EAAE3I,KAAK8C,OAAOg+F,EAAE9gG,KAAKi0G,cAAc,KAAkB/7G,EAAEA,EAAE+K,eAAetQ,KAAKwF,EAAED,EAAEvF,GAAGqN,KAAKrN,GAAGwF,EAAEA,EAAEwQ,GAAGA,EAAEhW,IAAgI,OAA5HqN,KAAKk0G,oBAAoB,MAAMvrG,EAAEwrG,iBAAiBxrG,EAAEwrG,kBAAiB,IAAKxrG,EAAEyrG,aAAaR,GAAGC,GAAG7zG,KAAKq0G,qBAAqBR,GAAU7zG,IAAI,CAC9E,OAD+EojG,EAAEjrG,EAAEsN,UAAU,CAAC6uG,eAAe,WAAWt0G,KAAKm0G,kBAAiB,EAAG,IAAIj8G,EAAE8H,KAAK0xG,YAAYx5G,IAAIA,EAAEo8G,eAAep8G,EAAEo8G,iBAAiB,mBAAmBp8G,EAAEk8G,cAC7el8G,EAAEk8G,aAAY,GAAIp0G,KAAKk0G,mBAAmBN,GAAG,EAAET,gBAAgB,WAAW,IAAIj7G,EAAE8H,KAAK0xG,YAAYx5G,IAAIA,EAAEi7G,gBAAgBj7G,EAAEi7G,kBAAkB,mBAAmBj7G,EAAEq8G,eAAer8G,EAAEq8G,cAAa,GAAIv0G,KAAKq0G,qBAAqBT,GAAG,EAAEY,QAAQ,WAAW,EAAEC,aAAab,KAAYz7G,CAAC,CACjR,IAAoLu8G,GAAGC,GAAGC,GAAtLC,GAAG,CAACC,WAAW,EAAEC,QAAQ,EAAEC,WAAW,EAAEC,UAAU,SAAS/8G,GAAG,OAAOA,EAAE+8G,WAAW/hH,KAAKub,KAAK,EAAE0lG,iBAAiB,EAAEe,UAAU,GAAGC,GAAGrB,GAAGe,IAAIO,GAAGhS,EAAE,CAAC,EAAEyR,GAAG,CAACxzD,KAAK,EAAEg0D,OAAO,IAAIC,GAAGxB,GAAGsB,IAAaG,GAAGnS,EAAE,CAAC,EAAEgS,GAAG,CAACI,QAAQ,EAAEC,QAAQ,EAAEC,QAAQ,EAAEC,QAAQ,EAAEC,MAAM,EAAEC,MAAM,EAAEC,QAAQ,EAAEC,SAAS,EAAEC,OAAO,EAAEC,QAAQ,EAAEC,iBAAiBC,GAAGC,OAAO,EAAEC,QAAQ,EAAEC,cAAc,SAASp+G,GAAG,YAAO,IAASA,EAAEo+G,cAAcp+G,EAAEq+G,cAAcr+G,EAAEmzG,WAAWnzG,EAAEs+G,UAAUt+G,EAAEq+G,YAAYr+G,EAAEo+G,aAAa,EAAEG,UAAU,SAASv+G,GAAG,MAAG,cAC3eA,EAASA,EAAEu+G,WAAUv+G,IAAI08G,KAAKA,IAAI,cAAc18G,EAAE0G,MAAM81G,GAAGx8G,EAAEs9G,QAAQZ,GAAGY,QAAQb,GAAGz8G,EAAEu9G,QAAQb,GAAGa,SAASd,GAAGD,GAAG,EAAEE,GAAG18G,GAAUw8G,GAAE,EAAEgC,UAAU,SAASx+G,GAAG,MAAM,cAAcA,EAAEA,EAAEw+G,UAAU/B,EAAE,IAAIgC,GAAG7C,GAAGyB,IAAiCqB,GAAG9C,GAA7B1Q,EAAE,CAAC,EAAEmS,GAAG,CAACsB,aAAa,KAA4CC,GAAGhD,GAA9B1Q,EAAE,CAAC,EAAEgS,GAAG,CAACkB,cAAc,KAA0ES,GAAGjD,GAA5D1Q,EAAE,CAAC,EAAEyR,GAAG,CAACmC,cAAc,EAAEC,YAAY,EAAEC,cAAc,KAAcC,GAAG/T,EAAE,CAAC,EAAEyR,GAAG,CAACuC,cAAc,SAASl/G,GAAG,MAAM,kBAAkBA,EAAEA,EAAEk/G,cAAcrjH,OAAOqjH,aAAa,IAAIC,GAAGvD,GAAGqD,IAAyBG,GAAGxD,GAArB1Q,EAAE,CAAC,EAAEyR,GAAG,CAAC3uG,KAAK,KAAcqxG,GAAG,CAACC,IAAI,SACxfC,SAAS,IAAIC,KAAK,YAAYC,GAAG,UAAUC,MAAM,aAAaC,KAAK,YAAYC,IAAI,SAASC,IAAI,KAAKC,KAAK,cAAcC,KAAK,cAAcC,OAAO,aAAaC,gBAAgB,gBAAgBC,GAAG,CAAC,EAAE,YAAY,EAAE,MAAM,GAAG,QAAQ,GAAG,QAAQ,GAAG,QAAQ,GAAG,UAAU,GAAG,MAAM,GAAG,QAAQ,GAAG,WAAW,GAAG,SAAS,GAAG,IAAI,GAAG,SAAS,GAAG,WAAW,GAAG,MAAM,GAAG,OAAO,GAAG,YAAY,GAAG,UAAU,GAAG,aAAa,GAAG,YAAY,GAAG,SAAS,GAAG,SAAS,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KACtf,IAAI,KAAK,IAAI,KAAK,IAAI,MAAM,IAAI,MAAM,IAAI,MAAM,IAAI,UAAU,IAAI,aAAa,IAAI,QAAQC,GAAG,CAACC,IAAI,SAASC,QAAQ,UAAUC,KAAK,UAAUC,MAAM,YAAY,SAASC,GAAGxgH,GAAG,IAAIC,EAAE6H,KAAK0xG,YAAY,OAAOv5G,EAAE+9G,iBAAiB/9G,EAAE+9G,iBAAiBh+G,MAAIA,EAAEmgH,GAAGngH,OAAMC,EAAED,EAAK,CAAC,SAASi+G,KAAK,OAAOuC,EAAE,CAChS,IAAIC,GAAGvV,EAAE,CAAC,EAAEgS,GAAG,CAACj+G,IAAI,SAASe,GAAG,GAAGA,EAAEf,IAAI,CAAC,IAAIgB,EAAEo/G,GAAGr/G,EAAEf,MAAMe,EAAEf,IAAI,GAAG,iBAAiBgB,EAAE,OAAOA,CAAC,CAAC,MAAM,aAAaD,EAAE0G,KAAc,MAAR1G,EAAEu7G,GAAGv7G,IAAU,QAAQwJ,OAAOC,aAAazJ,GAAI,YAAYA,EAAE0G,MAAM,UAAU1G,EAAE0G,KAAKw5G,GAAGlgH,EAAEw7G,UAAU,eAAe,EAAE,EAAEruG,KAAK,EAAE5R,SAAS,EAAEqiH,QAAQ,EAAEC,SAAS,EAAEC,OAAO,EAAEC,QAAQ,EAAEzZ,OAAO,EAAEoc,OAAO,EAAE1C,iBAAiBC,GAAGxC,SAAS,SAASz7G,GAAG,MAAM,aAAaA,EAAE0G,KAAK60G,GAAGv7G,GAAG,CAAC,EAAEw7G,QAAQ,SAASx7G,GAAG,MAAM,YAAYA,EAAE0G,MAAM,UAAU1G,EAAE0G,KAAK1G,EAAEw7G,QAAQ,CAAC,EAAEmF,MAAM,SAAS3gH,GAAG,MAAM,aAC7eA,EAAE0G,KAAK60G,GAAGv7G,GAAG,YAAYA,EAAE0G,MAAM,UAAU1G,EAAE0G,KAAK1G,EAAEw7G,QAAQ,CAAC,IAAIoF,GAAGhF,GAAG6E,IAAiII,GAAGjF,GAA7H1Q,EAAE,CAAC,EAAEmS,GAAG,CAAC/D,UAAU,EAAE18G,MAAM,EAAEE,OAAO,EAAEgkH,SAAS,EAAEC,mBAAmB,EAAEC,MAAM,EAAEC,MAAM,EAAEC,MAAM,EAAEC,YAAY,EAAEC,UAAU,KAAmIC,GAAGzF,GAArH1Q,EAAE,CAAC,EAAEgS,GAAG,CAACoE,QAAQ,EAAEC,cAAc,EAAEC,eAAe,EAAE1D,OAAO,EAAEC,QAAQ,EAAEH,QAAQ,EAAEC,SAAS,EAAEG,iBAAiBC,MAA0EwD,GAAG7F,GAA3D1Q,EAAE,CAAC,EAAEyR,GAAG,CAAC1T,aAAa,EAAE8V,YAAY,EAAEC,cAAc,KAAc0C,GAAGxW,EAAE,CAAC,EAAEmS,GAAG,CAACsE,OAAO,SAAS3hH,GAAG,MAAM,WAAWA,EAAEA,EAAE2hH,OAAO,gBAAgB3hH,GAAGA,EAAE4hH,YAAY,CAAC,EACnfC,OAAO,SAAS7hH,GAAG,MAAM,WAAWA,EAAEA,EAAE6hH,OAAO,gBAAgB7hH,GAAGA,EAAE8hH,YAAY,eAAe9hH,GAAGA,EAAE+hH,WAAW,CAAC,EAAEC,OAAO,EAAEC,UAAU,IAAIC,GAAGtG,GAAG8F,IAAIS,GAAG,CAAC,EAAE,GAAG,GAAG,IAAIC,GAAG7Z,GAAI,qBAAqB1sG,OAAOwmH,GAAG,KAAK9Z,GAAI,iBAAiBluG,WAAWgoH,GAAGhoH,SAASioH,cAAc,IAAIC,GAAGha,GAAI,cAAc1sG,SAASwmH,GAAGG,GAAGja,KAAM6Z,IAAIC,IAAI,EAAEA,IAAI,IAAIA,IAAII,GAAGj5G,OAAOC,aAAa,IAAIi5G,IAAG,EAC1W,SAASC,GAAG3iH,EAAEC,GAAG,OAAOD,GAAG,IAAK,QAAQ,OAAO,IAAImiH,GAAGvnH,QAAQqF,EAAEu7G,SAAS,IAAK,UAAU,OAAO,MAAMv7G,EAAEu7G,QAAQ,IAAK,WAAW,IAAK,YAAY,IAAK,WAAW,OAAM,EAAG,QAAQ,OAAM,EAAG,CAAC,SAASoH,GAAG5iH,GAAc,MAAM,kBAAjBA,EAAEA,EAAEm9G,SAAkC,SAASn9G,EAAEA,EAAEgO,KAAK,IAAI,CAAC,IAAI60G,IAAG,EAE9Q,IAAIC,GAAG,CAACr6E,OAAM,EAAG5mB,MAAK,EAAGkhG,UAAS,EAAG,kBAAiB,EAAGC,OAAM,EAAGC,OAAM,EAAG5kH,QAAO,EAAGuxB,UAAS,EAAGgtE,OAAM,EAAGhhG,QAAO,EAAGsnH,KAAI,EAAG3gD,MAAK,EAAGx5C,MAAK,EAAGyK,KAAI,EAAG2vF,MAAK,GAAI,SAASC,GAAGpjH,GAAG,IAAIC,EAAED,GAAGA,EAAEqsG,UAAUrsG,EAAEqsG,SAAS7jF,cAAc,MAAM,UAAUvoB,IAAI6iH,GAAG9iH,EAAE0G,MAAM,aAAazG,CAAO,CAAC,SAASojH,GAAGrjH,EAAEC,EAAExF,EAAEM,GAAG64G,GAAG74G,GAAsB,GAAnBkF,EAAEqjH,GAAGrjH,EAAE,aAAgBjG,SAASS,EAAE,IAAIwiH,GAAG,WAAW,SAAS,KAAKxiH,EAAEM,GAAGiF,EAAErB,KAAK,CAAC8hB,MAAMhmB,EAAE6hC,UAAUr8B,IAAI,CAAC,IAAIsjH,GAAG,KAAKC,GAAG,KAAK,SAASC,GAAGzjH,GAAG0jH,GAAG1jH,EAAE,EAAE,CAAC,SAAS2jH,GAAG3jH,GAAe,GAAG8sG,EAAT8W,GAAG5jH,IAAY,OAAOA,CAAC,CACpe,SAAS6jH,GAAG7jH,EAAEC,GAAG,GAAG,WAAWD,EAAE,OAAOC,CAAC,CAAC,IAAI6jH,IAAG,EAAG,GAAGvb,EAAG,CAAC,IAAIwb,GAAG,GAAGxb,EAAG,CAAC,IAAIyb,GAAG,YAAY3pH,SAAS,IAAI2pH,GAAG,CAAC,IAAIC,GAAG5pH,SAAS2L,cAAc,OAAOi+G,GAAGra,aAAa,UAAU,WAAWoa,GAAG,oBAAoBC,GAAGC,OAAO,CAACH,GAAGC,EAAE,MAAMD,IAAG,EAAGD,GAAGC,MAAM1pH,SAASioH,cAAc,EAAEjoH,SAASioH,aAAa,CAAC,SAAS6B,KAAKZ,KAAKA,GAAGa,YAAY,mBAAmBC,IAAIb,GAAGD,GAAG,KAAK,CAAC,SAASc,GAAGrkH,GAAG,GAAG,UAAUA,EAAEipG,cAAc0a,GAAGH,IAAI,CAAC,IAAIvjH,EAAE,GAAGojH,GAAGpjH,EAAEujH,GAAGxjH,EAAEkzG,GAAGlzG,IAAIi0G,GAAGwP,GAAGxjH,EAAE,CAAC,CAC/b,SAASqkH,GAAGtkH,EAAEC,EAAExF,GAAG,YAAYuF,GAAGmkH,KAAUX,GAAG/oH,GAAR8oH,GAAGtjH,GAAUgvB,YAAY,mBAAmBo1F,KAAK,aAAarkH,GAAGmkH,IAAI,CAAC,SAASI,GAAGvkH,GAAG,GAAG,oBAAoBA,GAAG,UAAUA,GAAG,YAAYA,EAAE,OAAO2jH,GAAGH,GAAG,CAAC,SAASgB,GAAGxkH,EAAEC,GAAG,GAAG,UAAUD,EAAE,OAAO2jH,GAAG1jH,EAAE,CAAC,SAASwkH,GAAGzkH,EAAEC,GAAG,GAAG,UAAUD,GAAG,WAAWA,EAAE,OAAO2jH,GAAG1jH,EAAE,CAAiE,IAAIykH,GAAG,oBAAoBpmH,OAAO00G,GAAG10G,OAAO00G,GAA5G,SAAYhzG,EAAEC,GAAG,OAAOD,IAAIC,IAAI,IAAID,GAAG,EAAEA,IAAI,EAAEC,IAAID,IAAIA,GAAGC,IAAIA,CAAC,EACtW,SAAS0kH,GAAG3kH,EAAEC,GAAG,GAAGykH,GAAG1kH,EAAEC,GAAG,OAAM,EAAG,GAAG,kBAAkBD,GAAG,OAAOA,GAAG,kBAAkBC,GAAG,OAAOA,EAAE,OAAM,EAAG,IAAIxF,EAAE6D,OAAOC,KAAKyB,GAAGjF,EAAEuD,OAAOC,KAAK0B,GAAG,GAAGxF,EAAET,SAASe,EAAEf,OAAO,OAAM,EAAG,IAAIe,EAAE,EAAEA,EAAEN,EAAET,OAAOe,IAAI,CAAC,IAAIyP,EAAE/P,EAAEM,GAAG,IAAIytG,EAAG55F,KAAK3O,EAAEuK,KAAKk6G,GAAG1kH,EAAEwK,GAAGvK,EAAEuK,IAAI,OAAM,CAAE,CAAC,OAAM,CAAE,CAAC,SAASo6G,GAAG5kH,GAAG,KAAKA,GAAGA,EAAE4uG,YAAY5uG,EAAEA,EAAE4uG,WAAW,OAAO5uG,CAAC,CACtU,SAAS6kH,GAAG7kH,EAAEC,GAAG,IAAwBlF,EAApBN,EAAEmqH,GAAG5kH,GAAO,IAAJA,EAAE,EAAYvF,GAAG,CAAC,GAAG,IAAIA,EAAEm4E,SAAS,CAA0B,GAAzB73E,EAAEiF,EAAEvF,EAAEk4B,YAAY34B,OAAUgG,GAAGC,GAAGlF,GAAGkF,EAAE,MAAM,CAACymC,KAAKjsC,EAAE6V,OAAOrQ,EAAED,GAAGA,EAAEjF,CAAC,CAACiF,EAAE,CAAC,KAAKvF,GAAG,CAAC,GAAGA,EAAEqqH,YAAY,CAACrqH,EAAEA,EAAEqqH,YAAY,MAAM9kH,CAAC,CAACvF,EAAEA,EAAE05B,UAAU,CAAC15B,OAAE,CAAM,CAACA,EAAEmqH,GAAGnqH,EAAE,CAAC,CAAC,SAASsqH,GAAG/kH,EAAEC,GAAG,SAAOD,IAAGC,KAAED,IAAIC,KAAKD,GAAG,IAAIA,EAAE4yE,YAAY3yE,GAAG,IAAIA,EAAE2yE,SAASmyC,GAAG/kH,EAAEC,EAAEk0B,YAAY,aAAan0B,EAAEA,EAAE2O,SAAS1O,KAAGD,EAAEglH,4BAAwD,GAA7BhlH,EAAEglH,wBAAwB/kH,KAAY,CAC9Z,SAASglH,KAAK,IAAI,IAAIjlH,EAAEnE,OAAOoE,EAAE+sG,IAAK/sG,aAAaD,EAAEklH,mBAAmB,CAAC,IAAI,IAAIzqH,EAAE,kBAAkBwF,EAAEuyB,cAAcj3B,SAASq1B,IAAI,CAAC,MAAM71B,GAAGN,GAAE,CAAE,CAAC,IAAGA,EAAyB,MAAMwF,EAAE+sG,GAA/BhtG,EAAEC,EAAEuyB,eAAgCn4B,SAAS,CAAC,OAAO4F,CAAC,CAAC,SAASklH,GAAGnlH,GAAG,IAAIC,EAAED,GAAGA,EAAEqsG,UAAUrsG,EAAEqsG,SAAS7jF,cAAc,OAAOvoB,IAAI,UAAUA,IAAI,SAASD,EAAE0G,MAAM,WAAW1G,EAAE0G,MAAM,QAAQ1G,EAAE0G,MAAM,QAAQ1G,EAAE0G,MAAM,aAAa1G,EAAE0G,OAAO,aAAazG,GAAG,SAASD,EAAEolH,gBAAgB,CACxa,SAASC,GAAGrlH,GAAG,IAAIC,EAAEglH,KAAKxqH,EAAEuF,EAAEslH,YAAYvqH,EAAEiF,EAAEulH,eAAe,GAAGtlH,IAAIxF,GAAGA,GAAGA,EAAEmzG,eAAemX,GAAGtqH,EAAEmzG,cAAc4X,gBAAgB/qH,GAAG,CAAC,GAAG,OAAOM,GAAGoqH,GAAG1qH,GAAG,GAAGwF,EAAElF,EAAEq1B,WAAc,KAARpwB,EAAEjF,EAAEmtE,OAAiBloE,EAAEC,GAAG,mBAAmBxF,EAAEA,EAAEgrH,eAAexlH,EAAExF,EAAEirH,aAAa79F,KAAKG,IAAIhoB,EAAEvF,EAAEgM,MAAMzM,aAAa,IAAGgG,GAAGC,EAAExF,EAAEmzG,eAAevzG,WAAW4F,EAAEokE,aAAaxoE,QAAS8pH,aAAa,CAAC3lH,EAAEA,EAAE2lH,eAAe,IAAIn7G,EAAE/P,EAAEk4B,YAAY34B,OAAOyW,EAAEoX,KAAKG,IAAIjtB,EAAEq1B,MAAM5lB,GAAGzP,OAAE,IAASA,EAAEmtE,IAAIz3D,EAAEoX,KAAKG,IAAIjtB,EAAEmtE,IAAI19D,IAAIxK,EAAEshG,QAAQ7wF,EAAE1V,IAAIyP,EAAEzP,EAAEA,EAAE0V,EAAEA,EAAEjG,GAAGA,EAAEq6G,GAAGpqH,EAAEgW,GAAG,IAAIm4F,EAAEic,GAAGpqH,EACvfM,GAAGyP,GAAGo+F,IAAI,IAAI5oG,EAAE4lH,YAAY5lH,EAAE6lH,aAAar7G,EAAEk8B,MAAM1mC,EAAE8lH,eAAet7G,EAAE8F,QAAQtQ,EAAE+lH,YAAYnd,EAAEliE,MAAM1mC,EAAEgmH,cAAcpd,EAAEt4F,WAAUrQ,EAAEA,EAAEsxF,eAAgB00B,SAASz7G,EAAEk8B,KAAKl8B,EAAE8F,QAAQtQ,EAAEkmH,kBAAkBz1G,EAAE1V,GAAGiF,EAAEmmH,SAASlmH,GAAGD,EAAEshG,OAAOsH,EAAEliE,KAAKkiE,EAAEt4F,UAAUrQ,EAAEmmH,OAAOxd,EAAEliE,KAAKkiE,EAAEt4F,QAAQtQ,EAAEmmH,SAASlmH,IAAI,CAAM,IAALA,EAAE,GAAOD,EAAEvF,EAAEuF,EAAEA,EAAEm0B,YAAY,IAAIn0B,EAAE4yE,UAAU3yE,EAAEtB,KAAK,CAAC0nH,QAAQrmH,EAAEtD,KAAKsD,EAAEsmH,WAAWC,IAAIvmH,EAAEwmH,YAAmD,IAAvC,oBAAoB/rH,EAAEgsH,OAAOhsH,EAAEgsH,QAAYhsH,EAAE,EAAEA,EAAEwF,EAAEjG,OAAOS,KAAIuF,EAAEC,EAAExF,IAAK4rH,QAAQC,WAAWtmH,EAAEtD,KAAKsD,EAAEqmH,QAAQG,UAAUxmH,EAAEumH,GAAG,CAAC,CACzf,IAAIG,GAAGne,GAAI,iBAAiBluG,UAAU,IAAIA,SAASioH,aAAaqE,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAKC,IAAG,EAC3F,SAASC,GAAG/mH,EAAEC,EAAExF,GAAG,IAAIM,EAAEN,EAAEoB,SAASpB,EAAEA,EAAEJ,SAAS,IAAII,EAAEm4E,SAASn4E,EAAEA,EAAEmzG,cAAckZ,IAAI,MAAMH,IAAIA,KAAK3Z,EAAGjyG,KAAU,mBAALA,EAAE4rH,KAAyBxB,GAAGpqH,GAAGA,EAAE,CAACq1B,MAAMr1B,EAAE0qH,eAAev9C,IAAIntE,EAAE2qH,cAAuF3qH,EAAE,CAAC8qH,YAA3E9qH,GAAGA,EAAE6yG,eAAe7yG,EAAE6yG,cAAcvpC,aAAaxoE,QAAQ8pH,gBAA+BE,WAAWC,aAAa/qH,EAAE+qH,aAAaC,UAAUhrH,EAAEgrH,UAAUC,YAAYjrH,EAAEirH,aAAca,IAAIlC,GAAGkC,GAAG9rH,KAAK8rH,GAAG9rH,EAAsB,GAApBA,EAAEuoH,GAAGsD,GAAG,aAAgB5sH,SAASiG,EAAE,IAAIg9G,GAAG,WAAW,SAAS,KAAKh9G,EAAExF,GAAGuF,EAAErB,KAAK,CAAC8hB,MAAMxgB,EAAEq8B,UAAUvhC,IAAIkF,EAAE2K,OAAO+7G,KAAK,CACtf,SAASK,GAAGhnH,EAAEC,GAAG,IAAIxF,EAAE,CAAC,EAAiF,OAA/EA,EAAEuF,EAAEwoB,eAAevoB,EAAEuoB,cAAc/tB,EAAE,SAASuF,GAAG,SAASC,EAAExF,EAAE,MAAMuF,GAAG,MAAMC,EAASxF,CAAC,CAAC,IAAIwsH,GAAG,CAACC,aAAaF,GAAG,YAAY,gBAAgBG,mBAAmBH,GAAG,YAAY,sBAAsBI,eAAeJ,GAAG,YAAY,kBAAkBK,cAAcL,GAAG,aAAa,kBAAkBM,GAAG,CAAC,EAAEC,GAAG,CAAC,EACpF,SAASC,GAAGxnH,GAAG,GAAGsnH,GAAGtnH,GAAG,OAAOsnH,GAAGtnH,GAAG,IAAIinH,GAAGjnH,GAAG,OAAOA,EAAE,IAAYvF,EAARwF,EAAEgnH,GAAGjnH,GAAK,IAAIvF,KAAKwF,EAAE,GAAGA,EAAE8K,eAAetQ,IAAIA,KAAK8sH,GAAG,OAAOD,GAAGtnH,GAAGC,EAAExF,GAAG,OAAOuF,CAAC,CAA/XuoG,IAAKgf,GAAGltH,SAAS2L,cAAc,OAAO0rB,MAAM,mBAAmB71B,gBAAgBorH,GAAGC,aAAaO,iBAAiBR,GAAGE,mBAAmBM,iBAAiBR,GAAGG,eAAeK,WAAW,oBAAoB5rH,eAAeorH,GAAGI,cAAczM,YAAwJ,IAAI8M,GAAGF,GAAG,gBAAgBG,GAAGH,GAAG,sBAAsBI,GAAGJ,GAAG,kBAAkBK,GAAGL,GAAG,iBAAiBM,GAAG,IAAIt1G,IAAIu1G,GAAG,smBAAsmBxtH,MAAM,KAC/lC,SAASytH,GAAGhoH,EAAEC,GAAG6nH,GAAG70G,IAAIjT,EAAEC,GAAGooG,EAAGpoG,EAAE,CAACD,GAAG,CAAC,IAAI,IAAIioH,GAAG,EAAEA,GAAGF,GAAG/tH,OAAOiuH,KAAK,CAAC,IAAIC,GAAGH,GAAGE,IAA2DD,GAApDE,GAAG1/F,cAAuD,MAAtC0/F,GAAG,GAAG53D,cAAc43D,GAAGzpH,MAAM,IAAiB,CAACupH,GAAGN,GAAG,kBAAkBM,GAAGL,GAAG,wBAAwBK,GAAGJ,GAAG,oBAAoBI,GAAG,WAAW,iBAAiBA,GAAG,UAAU,WAAWA,GAAG,WAAW,UAAUA,GAAGH,GAAG,mBAAmBvf,EAAG,eAAe,CAAC,WAAW,cAAcA,EAAG,eAAe,CAAC,WAAW,cAAcA,EAAG,iBAAiB,CAAC,aAAa,gBAC7cA,EAAG,iBAAiB,CAAC,aAAa,gBAAgBD,EAAG,WAAW,oEAAoE9tG,MAAM,MAAM8tG,EAAG,WAAW,uFAAuF9tG,MAAM,MAAM8tG,EAAG,gBAAgB,CAAC,iBAAiB,WAAW,YAAY,UAAUA,EAAG,mBAAmB,2DAA2D9tG,MAAM,MAAM8tG,EAAG,qBAAqB,6DAA6D9tG,MAAM,MAC/f8tG,EAAG,sBAAsB,8DAA8D9tG,MAAM,MAAM,IAAI4tH,GAAG,6NAA6N5tH,MAAM,KAAK6tH,GAAG,IAAIvzG,IAAI,0CAA0Cta,MAAM,KAAKwvD,OAAOo+D,KACzZ,SAASE,GAAGroH,EAAEC,EAAExF,GAAG,IAAIM,EAAEiF,EAAE0G,MAAM,gBAAgB1G,EAAE+7G,cAActhH,EAlDjE,SAAYuF,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,EAAEm4F,EAAEpuE,EAAEnrB,GAA4B,GAAzBulG,GAAGr7F,MAAMzR,KAAK/N,WAAcw6G,GAAG,CAAC,IAAGA,GAAgC,MAAMrtG,MAAMG,EAAE,MAA1C,IAAIokG,EAAE+I,GAAGD,IAAG,EAAGC,GAAG,KAA8BC,KAAKA,IAAG,EAAGC,GAAGjJ,EAAE,CAAC,CAkDpE6c,CAAGvtH,EAAEkF,OAAE,EAAOD,GAAGA,EAAE+7G,cAAc,IAAI,CACxG,SAAS2H,GAAG1jH,EAAEC,GAAGA,EAAE,KAAO,EAAFA,GAAK,IAAI,IAAIxF,EAAE,EAAEA,EAAEuF,EAAEhG,OAAOS,IAAI,CAAC,IAAIM,EAAEiF,EAAEvF,GAAG+P,EAAEzP,EAAE0lB,MAAM1lB,EAAEA,EAAEuhC,UAAUt8B,EAAE,CAAC,IAAIyQ,OAAE,EAAO,GAAGxQ,EAAE,IAAI,IAAI2oG,EAAE7tG,EAAEf,OAAO,EAAE,GAAG4uG,EAAEA,IAAI,CAAC,IAAIpuE,EAAEz/B,EAAE6tG,GAAGv5F,EAAEmrB,EAAEpnB,SAASq4F,EAAEjxE,EAAEuhF,cAA2B,GAAbvhF,EAAEA,EAAE9Q,SAAYra,IAAIoB,GAAGjG,EAAE2xG,uBAAuB,MAAMn8G,EAAEqoH,GAAG79G,EAAEgwB,EAAEixE,GAAGh7F,EAAEpB,CAAC,MAAM,IAAIu5F,EAAE,EAAEA,EAAE7tG,EAAEf,OAAO4uG,IAAI,CAAoD,GAA5Cv5F,GAAPmrB,EAAEz/B,EAAE6tG,IAAOx1F,SAASq4F,EAAEjxE,EAAEuhF,cAAcvhF,EAAEA,EAAE9Q,SAAYra,IAAIoB,GAAGjG,EAAE2xG,uBAAuB,MAAMn8G,EAAEqoH,GAAG79G,EAAEgwB,EAAEixE,GAAGh7F,EAAEpB,CAAC,CAAC,CAAC,CAAC,GAAGolG,GAAG,MAAMz0G,EAAE00G,GAAGD,IAAG,EAAGC,GAAG,KAAK10G,CAAE,CAC5a,SAASuoH,GAAEvoH,EAAEC,GAAG,IAAIxF,EAAEwF,EAAEuoH,SAAI,IAAS/tH,IAAIA,EAAEwF,EAAEuoH,IAAI,IAAI3zG,KAAK,IAAI9Z,EAAEiF,EAAE,WAAWvF,EAAEsY,IAAIhY,KAAK0tH,GAAGxoH,EAAED,EAAE,GAAE,GAAIvF,EAAEqa,IAAI/Z,GAAG,CAAC,SAAS2tH,GAAG1oH,EAAEC,EAAExF,GAAG,IAAIM,EAAE,EAAEkF,IAAIlF,GAAG,GAAG0tH,GAAGhuH,EAAEuF,EAAEjF,EAAEkF,EAAE,CAAC,IAAI0oH,GAAG,kBAAkB9gG,KAAKmI,SAAStL,SAAS,IAAIjmB,MAAM,GAAG,SAASmqH,GAAG5oH,GAAG,IAAIA,EAAE2oH,IAAI,CAAC3oH,EAAE2oH,KAAI,EAAGxgB,EAAGnkG,SAAQ,SAAS/D,GAAG,oBAAoBA,IAAImoH,GAAGr1G,IAAI9S,IAAIyoH,GAAGzoH,GAAE,EAAGD,GAAG0oH,GAAGzoH,GAAE,EAAGD,GAAG,IAAG,IAAIC,EAAE,IAAID,EAAE4yE,SAAS5yE,EAAEA,EAAE4tG,cAAc,OAAO3tG,GAAGA,EAAE0oH,MAAM1oH,EAAE0oH,KAAI,EAAGD,GAAG,mBAAkB,EAAGzoH,GAAG,CAAC,CACjb,SAASwoH,GAAGzoH,EAAEC,EAAExF,EAAEM,GAAG,OAAOmgH,GAAGj7G,IAAI,KAAK,EAAE,IAAIuK,EAAEmwG,GAAG,MAAM,KAAK,EAAEnwG,EAAEswG,GAAG,MAAM,QAAQtwG,EAAEqwG,GAAGpgH,EAAE+P,EAAEwb,KAAK,KAAK/lB,EAAExF,EAAEuF,GAAGwK,OAAE,GAAQ2pG,IAAI,eAAel0G,GAAG,cAAcA,GAAG,UAAUA,IAAIuK,GAAE,GAAIzP,OAAE,IAASyP,EAAExK,EAAEka,iBAAiBja,EAAExF,EAAE,CAACouH,SAAQ,EAAGC,QAAQt+G,IAAIxK,EAAEka,iBAAiBja,EAAExF,GAAE,QAAI,IAAS+P,EAAExK,EAAEka,iBAAiBja,EAAExF,EAAE,CAACquH,QAAQt+G,IAAIxK,EAAEka,iBAAiBja,EAAExF,GAAE,EAAG,CAClV,SAASsgH,GAAG/6G,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,IAAIiG,EAAE1V,EAAE,GAAG,KAAO,EAAFkF,IAAM,KAAO,EAAFA,IAAM,OAAOlF,EAAEiF,EAAE,OAAO,CAAC,GAAG,OAAOjF,EAAE,OAAO,IAAI6tG,EAAE7tG,EAAEuB,IAAI,GAAG,IAAIssG,GAAG,IAAIA,EAAE,CAAC,IAAIpuE,EAAEz/B,EAAE24G,UAAUsG,cAAc,GAAGx/E,IAAIhwB,GAAG,IAAIgwB,EAAEo4C,UAAUp4C,EAAErG,aAAa3pB,EAAE,MAAM,GAAG,IAAIo+F,EAAE,IAAIA,EAAE7tG,EAAEg6G,OAAO,OAAOnM,GAAG,CAAC,IAAIv5F,EAAEu5F,EAAEtsG,IAAI,IAAG,IAAI+S,GAAG,IAAIA,MAAKA,EAAEu5F,EAAE8K,UAAUsG,iBAAkBxvG,GAAG,IAAI6E,EAAEujE,UAAUvjE,EAAE8kB,aAAa3pB,GAAE,OAAOo+F,EAAEA,EAAEmM,MAAM,CAAC,KAAK,OAAOv6E,GAAG,CAAS,GAAG,QAAXouE,EAAEkR,GAAGt/E,IAAe,OAAe,GAAG,KAAXnrB,EAAEu5F,EAAEtsG,MAAc,IAAI+S,EAAE,CAACtU,EAAE0V,EAAEm4F,EAAE,SAAS5oG,CAAC,CAACw6B,EAAEA,EAAErG,UAAU,CAAC,CAACp5B,EAAEA,EAAEg6G,MAAM,CAACd,IAAG,WAAW,IAAIl5G,EAAE0V,EAAEjG,EAAE0oG,GAAGz4G,GAAGmuG,EAAE,GACpf5oG,EAAE,CAAC,IAAIw6B,EAAEstF,GAAG9rH,IAAIgE,GAAG,QAAG,IAASw6B,EAAE,CAAC,IAAInrB,EAAE4tG,GAAGrsG,EAAE5Q,EAAE,OAAOA,GAAG,IAAK,WAAW,GAAG,IAAIu7G,GAAG9gH,GAAG,MAAMuF,EAAE,IAAK,UAAU,IAAK,QAAQqP,EAAEuxG,GAAG,MAAM,IAAK,UAAUhwG,EAAE,QAAQvB,EAAEuvG,GAAG,MAAM,IAAK,WAAWhuG,EAAE,OAAOvB,EAAEuvG,GAAG,MAAM,IAAK,aAAa,IAAK,YAAYvvG,EAAEuvG,GAAG,MAAM,IAAK,QAAQ,GAAG,IAAInkH,EAAEyjH,OAAO,MAAMl+G,EAAE,IAAK,WAAW,IAAK,WAAW,IAAK,YAAY,IAAK,YAAY,IAAK,UAAU,IAAK,WAAW,IAAK,YAAY,IAAK,cAAcqP,EAAEovG,GAAG,MAAM,IAAK,OAAO,IAAK,UAAU,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,WAAW,IAAK,YAAY,IAAK,OAAOpvG,EAC1iBqvG,GAAG,MAAM,IAAK,cAAc,IAAK,WAAW,IAAK,YAAY,IAAK,aAAarvG,EAAEgyG,GAAG,MAAM,KAAKqG,GAAG,KAAKC,GAAG,KAAKC,GAAGv4G,EAAEwvG,GAAG,MAAM,KAAKgJ,GAAGx4G,EAAEoyG,GAAG,MAAM,IAAK,SAASpyG,EAAE+tG,GAAG,MAAM,IAAK,QAAQ/tG,EAAE6yG,GAAG,MAAM,IAAK,OAAO,IAAK,MAAM,IAAK,QAAQ7yG,EAAE8vG,GAAG,MAAM,IAAK,oBAAoB,IAAK,qBAAqB,IAAK,gBAAgB,IAAK,cAAc,IAAK,cAAc,IAAK,aAAa,IAAK,cAAc,IAAK,YAAY9vG,EAAEwxG,GAAG,IAAIrwG,EAAE,KAAO,EAAFvQ,GAAK8oH,GAAGv4G,GAAG,WAAWxQ,EAAEgpH,EAAEx4G,EAAE,OAAOgqB,EAAEA,EAAE,UAAU,KAAKA,EAAEhqB,EAAE,GAAG,IAAI,IAAQ7G,EAAJs/G,EAAEluH,EAAI,OAC/ekuH,GAAG,CAAK,IAAIC,GAARv/G,EAAEs/G,GAAUvV,UAAsF,GAA5E,IAAI/pG,EAAErN,KAAK,OAAO4sH,IAAIv/G,EAAEu/G,EAAE,OAAOF,IAAc,OAAVE,EAAEhV,GAAG+U,EAAED,KAAYx4G,EAAE7R,KAAKwqH,GAAGF,EAAEC,EAAEv/G,MAASo/G,EAAE,MAAME,EAAEA,EAAElU,MAAM,CAAC,EAAEvkG,EAAExW,SAASwgC,EAAE,IAAInrB,EAAEmrB,EAAE5pB,EAAE,KAAKnW,EAAE+P,GAAGo+F,EAAEjqG,KAAK,CAAC8hB,MAAM+Z,EAAE8B,UAAU9rB,IAAI,CAAC,CAAC,GAAG,KAAO,EAAFvQ,GAAK,CAA4E,GAAnCoP,EAAE,aAAarP,GAAG,eAAeA,KAAtEw6B,EAAE,cAAcx6B,GAAG,gBAAgBA,IAA2CvF,IAAIw4G,MAAKriG,EAAEnW,EAAE2jH,eAAe3jH,EAAE4jH,eAAevE,GAAGlpG,KAAIA,EAAEw4G,OAAgB/5G,GAAGmrB,KAAGA,EAAEhwB,EAAE3O,SAAS2O,EAAEA,GAAGgwB,EAAEhwB,EAAEojG,eAAepzE,EAAE6pC,aAAa7pC,EAAE6uF,aAAaxtH,OAAUwT,GAAqCA,EAAEtU,EAAiB,QAAf6V,GAAnCA,EAAEnW,EAAE2jH,eAAe3jH,EAAE6jH,WAAkBxE,GAAGlpG,GAAG,QAC9dA,KAARm4G,EAAElU,GAAGjkG,KAAU,IAAIA,EAAEtU,KAAK,IAAIsU,EAAEtU,OAAKsU,EAAE,QAAUvB,EAAE,KAAKuB,EAAE7V,GAAKsU,IAAIuB,GAAE,CAAgU,GAA/TJ,EAAEiuG,GAAGyK,EAAE,eAAeF,EAAE,eAAeC,EAAE,QAAW,eAAejpH,GAAG,gBAAgBA,IAAEwQ,EAAEqwG,GAAGqI,EAAE,iBAAiBF,EAAE,iBAAiBC,EAAE,WAAUF,EAAE,MAAM15G,EAAEmrB,EAAEopF,GAAGv0G,GAAG1F,EAAE,MAAMiH,EAAE4pB,EAAEopF,GAAGhzG,IAAG4pB,EAAE,IAAIhqB,EAAE04G,EAAED,EAAE,QAAQ55G,EAAE5U,EAAE+P,IAAKI,OAAOm+G,EAAEvuF,EAAE4jF,cAAcz0G,EAAEu/G,EAAE,KAAKpP,GAAGtvG,KAAKzP,KAAIyV,EAAE,IAAIA,EAAEw4G,EAAEC,EAAE,QAAQr4G,EAAEnW,EAAE+P,IAAKI,OAAOjB,EAAE6G,EAAE4tG,cAAc2K,EAAEG,EAAE14G,GAAGu4G,EAAEG,EAAK75G,GAAGuB,EAAE3Q,EAAE,CAAa,IAAR+oH,EAAEp4G,EAAEq4G,EAAE,EAAMt/G,EAAhB6G,EAAEnB,EAAkB1F,EAAEA,EAAE2/G,GAAG3/G,GAAGs/G,IAAQ,IAAJt/G,EAAE,EAAMu/G,EAAEF,EAAEE,EAAEA,EAAEI,GAAGJ,GAAGv/G,IAAI,KAAK,EAAEs/G,EAAEt/G,GAAG6G,EAAE84G,GAAG94G,GAAGy4G,IAAI,KAAK,EAAEt/G,EAAEs/G,GAAGD,EACpfM,GAAGN,GAAGr/G,IAAI,KAAKs/G,KAAK,CAAC,GAAGz4G,IAAIw4G,GAAG,OAAOA,GAAGx4G,IAAIw4G,EAAElU,UAAU,MAAM70G,EAAEuQ,EAAE84G,GAAG94G,GAAGw4G,EAAEM,GAAGN,EAAE,CAACx4G,EAAE,IAAI,MAAMA,EAAE,KAAK,OAAOnB,GAAGk6G,GAAG3gB,EAAEpuE,EAAEnrB,EAAEmB,GAAE,GAAI,OAAOI,GAAG,OAAOm4G,GAAGQ,GAAG3gB,EAAEmgB,EAAEn4G,EAAEJ,GAAE,EAAG,CAA8D,GAAG,YAA1CnB,GAAjBmrB,EAAEz/B,EAAE6oH,GAAG7oH,GAAGc,QAAWwwG,UAAU7xE,EAAE6xE,SAAS7jF,gBAA+B,UAAUnZ,GAAG,SAASmrB,EAAE9zB,KAAK,IAAI8iH,EAAG3F,QAAQ,GAAGT,GAAG5oF,GAAG,GAAGspF,GAAG0F,EAAG/E,OAAO,CAAC+E,EAAGjF,GAAG,IAAIkF,EAAGnF,EAAE,MAAMj1G,EAAEmrB,EAAE6xE,WAAW,UAAUh9F,EAAEmZ,gBAAgB,aAAagS,EAAE9zB,MAAM,UAAU8zB,EAAE9zB,QAAQ8iH,EAAGhF,IACrV,OAD4VgF,IAAKA,EAAGA,EAAGxpH,EAAEjF,IAAKsoH,GAAGza,EAAE4gB,EAAG/uH,EAAE+P,IAAWi/G,GAAIA,EAAGzpH,EAAEw6B,EAAEz/B,GAAG,aAAaiF,IAAIypH,EAAGjvF,EAAE4yE,gBAClfqc,EAAGjc,YAAY,WAAWhzE,EAAE9zB,MAAMinG,GAAGnzE,EAAE,SAASA,EAAE/zB,QAAOgjH,EAAG1uH,EAAE6oH,GAAG7oH,GAAGc,OAAcmE,GAAG,IAAK,WAAaojH,GAAGqG,IAAK,SAASA,EAAGrE,mBAAgBuB,GAAG8C,EAAG7C,GAAG7rH,EAAE8rH,GAAG,MAAK,MAAM,IAAK,WAAWA,GAAGD,GAAGD,GAAG,KAAK,MAAM,IAAK,YAAYG,IAAG,EAAG,MAAM,IAAK,cAAc,IAAK,UAAU,IAAK,UAAUA,IAAG,EAAGC,GAAGne,EAAEnuG,EAAE+P,GAAG,MAAM,IAAK,kBAAkB,GAAGk8G,GAAG,MAAM,IAAK,UAAU,IAAK,QAAQK,GAAGne,EAAEnuG,EAAE+P,GAAG,IAAIk/G,EAAG,GAAGtH,GAAGniH,EAAE,CAAC,OAAOD,GAAG,IAAK,mBAAmB,IAAI2pH,EAAG,qBAAqB,MAAM1pH,EAAE,IAAK,iBAAiB0pH,EAAG,mBACpe,MAAM1pH,EAAE,IAAK,oBAAoB0pH,EAAG,sBAAsB,MAAM1pH,EAAE0pH,OAAG,CAAM,MAAM9G,GAAGF,GAAG3iH,EAAEvF,KAAKkvH,EAAG,oBAAoB,YAAY3pH,GAAG,MAAMvF,EAAE+gH,UAAUmO,EAAG,sBAAsBA,IAAKnH,IAAI,OAAO/nH,EAAEimH,SAASmC,IAAI,uBAAuB8G,EAAG,qBAAqBA,GAAI9G,KAAK6G,EAAGpO,OAAYF,GAAG,UAARD,GAAG3wG,GAAkB2wG,GAAG10G,MAAM00G,GAAGxoF,YAAYkwF,IAAG,IAAiB,GAAZ4G,EAAGnG,GAAGvoH,EAAE4uH,IAAS3vH,SAAS2vH,EAAG,IAAIvK,GAAGuK,EAAG3pH,EAAE,KAAKvF,EAAE+P,GAAGo+F,EAAEjqG,KAAK,CAAC8hB,MAAMkpG,EAAGrtF,UAAUmtF,IAAKC,EAAGC,EAAG37G,KAAK07G,EAAa,QAATA,EAAG9G,GAAGnoH,MAAekvH,EAAG37G,KAAK07G,MAAUA,EAAGnH,GA5BhM,SAAYviH,EAAEC,GAAG,OAAOD,GAAG,IAAK,iBAAiB,OAAO4iH,GAAG3iH,GAAG,IAAK,WAAW,OAAG,KAAKA,EAAE0gH,MAAa,MAAK+B,IAAG,EAAUD,IAAG,IAAK,YAAY,OAAOziH,EAAEC,EAAE+N,QAASy0G,IAAIC,GAAG,KAAK1iH,EAAE,QAAQ,OAAO,KAAK,CA4BE4pH,CAAG5pH,EAAEvF,GA3Bzd,SAAYuF,EAAEC,GAAG,GAAG4iH,GAAG,MAAM,mBAAmB7iH,IAAIoiH,IAAIO,GAAG3iH,EAAEC,IAAID,EAAEs7G,KAAKD,GAAGD,GAAGD,GAAG,KAAK0H,IAAG,EAAG7iH,GAAG,KAAK,OAAOA,GAAG,IAAK,QAAgQ,QAAQ,OAAO,KAA3P,IAAK,WAAW,KAAKC,EAAE29G,SAAS39G,EAAE69G,QAAQ79G,EAAE89G,UAAU99G,EAAE29G,SAAS39G,EAAE69G,OAAO,CAAC,GAAG79G,EAAElB,MAAM,EAAEkB,EAAElB,KAAK/E,OAAO,OAAOiG,EAAElB,KAAK,GAAGkB,EAAE0gH,MAAM,OAAOn3G,OAAOC,aAAaxJ,EAAE0gH,MAAM,CAAC,OAAO,KAAK,IAAK,iBAAiB,OAAO6B,IAAI,OAAOviH,EAAEygH,OAAO,KAAKzgH,EAAE+N,KAAyB,CA2BqF67G,CAAG7pH,EAAEvF,MACje,GADoeM,EAAEuoH,GAAGvoH,EAAE,kBACvef,SAASwQ,EAAE,IAAI40G,GAAG,gBAAgB,cAAc,KAAK3kH,EAAE+P,GAAGo+F,EAAEjqG,KAAK,CAAC8hB,MAAMjW,EAAE8xB,UAAUvhC,IAAIyP,EAAEwD,KAAK07G,GAAG,CAAChG,GAAG9a,EAAE3oG,EAAE,GAAE,CAAC,SAASkpH,GAAGnpH,EAAEC,EAAExF,GAAG,MAAM,CAAC2Y,SAASpT,EAAE0pB,SAASzpB,EAAE87G,cAActhH,EAAE,CAAC,SAAS6oH,GAAGtjH,EAAEC,GAAG,IAAI,IAAIxF,EAAEwF,EAAE,UAAUlF,EAAE,GAAG,OAAOiF,GAAG,CAAC,IAAIwK,EAAExK,EAAEyQ,EAAEjG,EAAEkpG,UAAU,IAAIlpG,EAAElO,KAAK,OAAOmU,IAAIjG,EAAEiG,EAAY,OAAVA,EAAEyjG,GAAGl0G,EAAEvF,KAAYM,EAAE+uH,QAAQX,GAAGnpH,EAAEyQ,EAAEjG,IAAc,OAAViG,EAAEyjG,GAAGl0G,EAAEC,KAAYlF,EAAE4D,KAAKwqH,GAAGnpH,EAAEyQ,EAAEjG,KAAKxK,EAAEA,EAAE+0G,MAAM,CAAC,OAAOh6G,CAAC,CAAC,SAASuuH,GAAGtpH,GAAG,GAAG,OAAOA,EAAE,OAAO,KAAK,GAAGA,EAAEA,EAAE+0G,aAAa/0G,GAAG,IAAIA,EAAE1D,KAAK,OAAO0D,GAAI,IAAI,CACnd,SAASupH,GAAGvpH,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,IAAI,IAAIiG,EAAExQ,EAAE47G,WAAWjT,EAAE,GAAG,OAAOnuG,GAAGA,IAAIM,GAAG,CAAC,IAAIy/B,EAAE//B,EAAE4U,EAAEmrB,EAAEs6E,UAAUrJ,EAAEjxE,EAAEk5E,UAAU,GAAG,OAAOrkG,GAAGA,IAAItU,EAAE,MAAM,IAAIy/B,EAAEl+B,KAAK,OAAOmvG,IAAIjxE,EAAEixE,EAAEjhG,EAAa,OAAV6E,EAAE6kG,GAAGz5G,EAAEgW,KAAYm4F,EAAEkhB,QAAQX,GAAG1uH,EAAE4U,EAAEmrB,IAAKhwB,GAAc,OAAV6E,EAAE6kG,GAAGz5G,EAAEgW,KAAYm4F,EAAEjqG,KAAKwqH,GAAG1uH,EAAE4U,EAAEmrB,KAAM//B,EAAEA,EAAEs6G,MAAM,CAAC,IAAInM,EAAE5uG,QAAQgG,EAAErB,KAAK,CAAC8hB,MAAMxgB,EAAEq8B,UAAUssE,GAAG,CAAC,IAAImhB,GAAG,SAASC,GAAG,iBAAiB,SAASC,GAAGjqH,GAAG,OAAO,kBAAkBA,EAAEA,EAAE,GAAGA,GAAGsK,QAAQy/G,GAAG,MAAMz/G,QAAQ0/G,GAAG,GAAG,CAAC,SAASE,GAAGlqH,EAAEC,EAAExF,GAAW,GAARwF,EAAEgqH,GAAGhqH,GAAMgqH,GAAGjqH,KAAKC,GAAGxF,EAAE,MAAMyM,MAAMG,EAAE,KAAM,CAAC,SAAS8iH,KAAK,CAC9e,IAAIC,GAAG,KAAKC,GAAG,KAAK,SAASC,GAAGtqH,EAAEC,GAAG,MAAM,aAAaD,GAAG,aAAaA,GAAG,kBAAkBC,EAAE6yC,UAAU,kBAAkB7yC,EAAE6yC,UAAU,kBAAkB7yC,EAAEkuG,yBAAyB,OAAOluG,EAAEkuG,yBAAyB,MAAMluG,EAAEkuG,wBAAwBoc,MAAM,CAC5P,IAAIC,GAAG,oBAAoB5oH,WAAWA,gBAAW,EAAO6oH,GAAG,oBAAoB96F,aAAaA,kBAAa,EAAO+6F,GAAG,oBAAoBh+G,QAAQA,aAAQ,EAAOi+G,GAAG,oBAAoBC,eAAeA,eAAe,qBAAqBF,GAAG,SAAS1qH,GAAG,OAAO0qH,GAAGl+G,QAAQ,MAAMqO,KAAK7a,GAAG4M,MAAMi+G,GAAG,EAAEL,GAAG,SAASK,GAAG7qH,GAAG4B,YAAW,WAAW,MAAM5B,CAAE,GAAE,CACpV,SAAS8qH,GAAG9qH,EAAEC,GAAG,IAAIxF,EAAEwF,EAAElF,EAAE,EAAE,EAAE,CAAC,IAAIyP,EAAE/P,EAAEqqH,YAA6B,GAAjB9kH,EAAEkxB,YAAYz2B,GAAM+P,GAAG,IAAIA,EAAEooE,SAAS,GAAY,QAATn4E,EAAE+P,EAAEwD,MAAc,CAAC,GAAG,IAAIjT,EAA0B,OAAvBiF,EAAEkxB,YAAY1mB,QAAG+vG,GAAGt6G,GAAUlF,GAAG,KAAK,MAAMN,GAAG,OAAOA,GAAG,OAAOA,GAAGM,IAAIN,EAAE+P,CAAC,OAAO/P,GAAG8/G,GAAGt6G,EAAE,CAAC,SAAS8qH,GAAG/qH,GAAG,KAAK,MAAMA,EAAEA,EAAEA,EAAE8kH,YAAY,CAAC,IAAI7kH,EAAED,EAAE4yE,SAAS,GAAG,IAAI3yE,GAAG,IAAIA,EAAE,MAAM,GAAG,IAAIA,EAAE,CAAU,GAAG,OAAZA,EAAED,EAAEgO,OAAiB,OAAO/N,GAAG,OAAOA,EAAE,MAAM,GAAG,OAAOA,EAAE,OAAO,IAAI,CAAC,CAAC,OAAOD,CAAC,CACjY,SAASgrH,GAAGhrH,GAAGA,EAAEA,EAAEirH,gBAAgB,IAAI,IAAIhrH,EAAE,EAAED,GAAG,CAAC,GAAG,IAAIA,EAAE4yE,SAAS,CAAC,IAAIn4E,EAAEuF,EAAEgO,KAAK,GAAG,MAAMvT,GAAG,OAAOA,GAAG,OAAOA,EAAE,CAAC,GAAG,IAAIwF,EAAE,OAAOD,EAAEC,GAAG,KAAK,OAAOxF,GAAGwF,GAAG,CAACD,EAAEA,EAAEirH,eAAe,CAAC,OAAO,IAAI,CAAC,IAAIC,GAAGrjG,KAAKmI,SAAStL,SAAS,IAAIjmB,MAAM,GAAG0sH,GAAG,gBAAgBD,GAAGE,GAAG,gBAAgBF,GAAG9B,GAAG,oBAAoB8B,GAAG1C,GAAG,iBAAiB0C,GAAGG,GAAG,oBAAoBH,GAAGI,GAAG,kBAAkBJ,GAClX,SAASpR,GAAG95G,GAAG,IAAIC,EAAED,EAAEmrH,IAAI,GAAGlrH,EAAE,OAAOA,EAAE,IAAI,IAAIxF,EAAEuF,EAAEm0B,WAAW15B,GAAG,CAAC,GAAGwF,EAAExF,EAAE2uH,KAAK3uH,EAAE0wH,IAAI,CAAe,GAAd1wH,EAAEwF,EAAE60G,UAAa,OAAO70G,EAAE8wC,OAAO,OAAOt2C,GAAG,OAAOA,EAAEs2C,MAAM,IAAI/wC,EAAEgrH,GAAGhrH,GAAG,OAAOA,GAAG,CAAC,GAAGvF,EAAEuF,EAAEmrH,IAAI,OAAO1wH,EAAEuF,EAAEgrH,GAAGhrH,EAAE,CAAC,OAAOC,CAAC,CAAKxF,GAAJuF,EAAEvF,GAAM05B,UAAU,CAAC,OAAO,IAAI,CAAC,SAASs/E,GAAGzzG,GAAkB,QAAfA,EAAEA,EAAEmrH,KAAKnrH,EAAEopH,MAAc,IAAIppH,EAAE1D,KAAK,IAAI0D,EAAE1D,KAAK,KAAK0D,EAAE1D,KAAK,IAAI0D,EAAE1D,IAAI,KAAK0D,CAAC,CAAC,SAAS4jH,GAAG5jH,GAAG,GAAG,IAAIA,EAAE1D,KAAK,IAAI0D,EAAE1D,IAAI,OAAO0D,EAAE0zG,UAAU,MAAMxsG,MAAMG,EAAE,IAAK,CAAC,SAASssG,GAAG3zG,GAAG,OAAOA,EAAEorH,KAAK,IAAI,CAAC,IAAIG,GAAG,GAAGC,IAAI,EAAE,SAASC,GAAGzrH,GAAG,MAAM,CAACiE,QAAQjE,EAAE,CACve,SAAS0rH,GAAE1rH,GAAG,EAAEwrH,KAAKxrH,EAAEiE,QAAQsnH,GAAGC,IAAID,GAAGC,IAAI,KAAKA,KAAK,CAAC,SAASG,GAAE3rH,EAAEC,GAAGurH,KAAKD,GAAGC,IAAIxrH,EAAEiE,QAAQjE,EAAEiE,QAAQhE,CAAC,CAAC,IAAI2rH,GAAG,CAAC,EAAEC,GAAEJ,GAAGG,IAAIE,GAAGL,IAAG,GAAIM,GAAGH,GAAG,SAASI,GAAGhsH,EAAEC,GAAG,IAAIxF,EAAEuF,EAAE0G,KAAKulH,aAAa,IAAIxxH,EAAE,OAAOmxH,GAAG,IAAI7wH,EAAEiF,EAAE0zG,UAAU,GAAG34G,GAAGA,EAAEmxH,8CAA8CjsH,EAAE,OAAOlF,EAAEoxH,0CAA0C,IAAS17G,EAALjG,EAAE,CAAC,EAAI,IAAIiG,KAAKhW,EAAE+P,EAAEiG,GAAGxQ,EAAEwQ,GAAoH,OAAjH1V,KAAIiF,EAAEA,EAAE0zG,WAAYwY,4CAA4CjsH,EAAED,EAAEmsH,0CAA0C3hH,GAAUA,CAAC,CAC9d,SAAS4hH,GAAGpsH,GAAyB,OAAO,QAA7BA,EAAEA,EAAEqsH,yBAAmC,IAASrsH,CAAC,CAAC,SAASssH,KAAKZ,GAAEI,IAAIJ,GAAEG,GAAE,CAAC,SAASU,GAAGvsH,EAAEC,EAAExF,GAAG,GAAGoxH,GAAE5nH,UAAU2nH,GAAG,MAAM1kH,MAAMG,EAAE,MAAMskH,GAAEE,GAAE5rH,GAAG0rH,GAAEG,GAAGrxH,EAAE,CAAC,SAAS+xH,GAAGxsH,EAAEC,EAAExF,GAAG,IAAIM,EAAEiF,EAAE0zG,UAAgC,GAAtBzzG,EAAEA,EAAEosH,kBAAqB,oBAAoBtxH,EAAE0xH,gBAAgB,OAAOhyH,EAAwB,IAAI,IAAI+P,KAA9BzP,EAAEA,EAAE0xH,kBAAiC,KAAKjiH,KAAKvK,GAAG,MAAMiH,MAAMG,EAAE,IAAI6kG,EAAGlsG,IAAI,UAAUwK,IAAI,OAAO0gG,EAAE,CAAC,EAAEzwG,EAAEM,EAAE,CACxX,SAAS2xH,GAAG1sH,GAA2G,OAAxGA,GAAGA,EAAEA,EAAE0zG,YAAY1zG,EAAE2sH,2CAA2Cf,GAAGG,GAAGF,GAAE5nH,QAAQ0nH,GAAEE,GAAE7rH,GAAG2rH,GAAEG,GAAGA,GAAG7nH,UAAe,CAAE,CAAC,SAAS2oH,GAAG5sH,EAAEC,EAAExF,GAAG,IAAIM,EAAEiF,EAAE0zG,UAAU,IAAI34G,EAAE,MAAMmM,MAAMG,EAAE,MAAM5M,GAAGuF,EAAEwsH,GAAGxsH,EAAEC,EAAE8rH,IAAIhxH,EAAE4xH,0CAA0C3sH,EAAE0rH,GAAEI,IAAIJ,GAAEG,IAAGF,GAAEE,GAAE7rH,IAAI0rH,GAAEI,IAAIH,GAAEG,GAAGrxH,EAAE,CAAC,IAAIoyH,GAAG,KAAKC,IAAG,EAAGC,IAAG,EAAG,SAASC,GAAGhtH,GAAG,OAAO6sH,GAAGA,GAAG,CAAC7sH,GAAG6sH,GAAGluH,KAAKqB,EAAE,CAChW,SAASitH,KAAK,IAAIF,IAAI,OAAOF,GAAG,CAACE,IAAG,EAAG,IAAI/sH,EAAE,EAAEC,EAAEo4G,GAAE,IAAI,IAAI59G,EAAEoyH,GAAG,IAAIxU,GAAE,EAAEr4G,EAAEvF,EAAET,OAAOgG,IAAI,CAAC,IAAIjF,EAAEN,EAAEuF,GAAG,GAAGjF,EAAEA,GAAE,SAAU,OAAOA,EAAE,CAAC8xH,GAAG,KAAKC,IAAG,CAAE,CAAC,MAAMtiH,GAAG,MAAM,OAAOqiH,KAAKA,GAAGA,GAAGpuH,MAAMuB,EAAE,IAAIy1G,GAAGY,GAAG4W,IAAIziH,CAAE,CAAC,QAAQ6tG,GAAEp4G,EAAE8sH,IAAG,CAAE,CAAC,CAAC,OAAO,IAAI,CAAC,IAAIG,GAAG,GAAGC,GAAG,EAAEC,GAAG,KAAKC,GAAG,EAAEC,GAAG,GAAGC,GAAG,EAAEC,GAAG,KAAKC,GAAG,EAAEC,GAAG,GAAG,SAASC,GAAG3tH,EAAEC,GAAGitH,GAAGC,MAAME,GAAGH,GAAGC,MAAMC,GAAGA,GAAGptH,EAAEqtH,GAAGptH,CAAC,CACjV,SAAS2tH,GAAG5tH,EAAEC,EAAExF,GAAG6yH,GAAGC,MAAME,GAAGH,GAAGC,MAAMG,GAAGJ,GAAGC,MAAMC,GAAGA,GAAGxtH,EAAE,IAAIjF,EAAE0yH,GAAGztH,EAAE0tH,GAAG,IAAIljH,EAAE,GAAGysG,GAAGl8G,GAAG,EAAEA,KAAK,GAAGyP,GAAG/P,GAAG,EAAE,IAAIgW,EAAE,GAAGwmG,GAAGh3G,GAAGuK,EAAE,GAAG,GAAGiG,EAAE,CAAC,IAAIm4F,EAAEp+F,EAAEA,EAAE,EAAEiG,GAAG1V,GAAG,GAAG6tG,GAAG,GAAGlkF,SAAS,IAAI3pB,IAAI6tG,EAAEp+F,GAAGo+F,EAAE6kB,GAAG,GAAG,GAAGxW,GAAGh3G,GAAGuK,EAAE/P,GAAG+P,EAAEzP,EAAE2yH,GAAGj9G,EAAEzQ,CAAC,MAAMytH,GAAG,GAAGh9G,EAAEhW,GAAG+P,EAAEzP,EAAE2yH,GAAG1tH,CAAC,CAAC,SAAS6tH,GAAG7tH,GAAG,OAAOA,EAAE+0G,SAAS4Y,GAAG3tH,EAAE,GAAG4tH,GAAG5tH,EAAE,EAAE,GAAG,CAAC,SAAS8tH,GAAG9tH,GAAG,KAAKA,IAAIotH,IAAIA,GAAGF,KAAKC,IAAID,GAAGC,IAAI,KAAKE,GAAGH,KAAKC,IAAID,GAAGC,IAAI,KAAK,KAAKntH,IAAIwtH,IAAIA,GAAGF,KAAKC,IAAID,GAAGC,IAAI,KAAKG,GAAGJ,KAAKC,IAAID,GAAGC,IAAI,KAAKE,GAAGH,KAAKC,IAAID,GAAGC,IAAI,IAAI,CAAC,IAAIQ,GAAG,KAAKC,GAAG,KAAKC,IAAE,EAAGC,GAAG,KACje,SAASC,GAAGnuH,EAAEC,GAAG,IAAIxF,EAAE2zH,GAAG,EAAE,KAAK,KAAK,GAAG3zH,EAAE4zH,YAAY,UAAU5zH,EAAEi5G,UAAUzzG,EAAExF,EAAEs6G,OAAO/0G,EAAgB,QAAdC,EAAED,EAAEsuH,YAAoBtuH,EAAEsuH,UAAU,CAAC7zH,GAAGuF,EAAEg1G,OAAO,IAAI/0G,EAAEtB,KAAKlE,EAAE,CACxJ,SAAS8zH,GAAGvuH,EAAEC,GAAG,OAAOD,EAAE1D,KAAK,KAAK,EAAE,IAAI7B,EAAEuF,EAAE0G,KAAyE,OAAO,QAA3EzG,EAAE,IAAIA,EAAE2yE,UAAUn4E,EAAE+tB,gBAAgBvoB,EAAEosG,SAAS7jF,cAAc,KAAKvoB,KAAmBD,EAAE0zG,UAAUzzG,EAAE8tH,GAAG/tH,EAAEguH,GAAGjD,GAAG9qH,EAAE2uG,aAAY,GAAO,KAAK,EAAE,OAAoD,QAA7C3uG,EAAE,KAAKD,EAAEwuH,cAAc,IAAIvuH,EAAE2yE,SAAS,KAAK3yE,KAAYD,EAAE0zG,UAAUzzG,EAAE8tH,GAAG/tH,EAAEguH,GAAG,MAAK,GAAO,KAAK,GAAG,OAA+B,QAAxB/tH,EAAE,IAAIA,EAAE2yE,SAAS,KAAK3yE,KAAYxF,EAAE,OAAO+yH,GAAG,CAACnoG,GAAGooG,GAAGgB,SAASf,IAAI,KAAK1tH,EAAEk1G,cAAc,CAACC,WAAWl1G,EAAEyuH,YAAYj0H,EAAEk0H,UAAU,aAAYl0H,EAAE2zH,GAAG,GAAG,KAAK,KAAK,IAAK1a,UAAUzzG,EAAExF,EAAEs6G,OAAO/0G,EAAEA,EAAE+wC,MAAMt2C,EAAEszH,GAAG/tH,EAAEguH,GAClf,MAAK,GAAO,QAAQ,OAAM,EAAG,CAAC,SAASY,GAAG5uH,GAAG,OAAO,KAAY,EAAPA,EAAE8R,OAAS,KAAa,IAAR9R,EAAEg1G,MAAU,CAAC,SAAS6Z,GAAG7uH,GAAG,GAAGiuH,GAAE,CAAC,IAAIhuH,EAAE+tH,GAAG,GAAG/tH,EAAE,CAAC,IAAIxF,EAAEwF,EAAE,IAAIsuH,GAAGvuH,EAAEC,GAAG,CAAC,GAAG2uH,GAAG5uH,GAAG,MAAMkH,MAAMG,EAAE,MAAMpH,EAAE8qH,GAAGtwH,EAAEqqH,aAAa,IAAI/pH,EAAEgzH,GAAG9tH,GAAGsuH,GAAGvuH,EAAEC,GAAGkuH,GAAGpzH,EAAEN,IAAIuF,EAAEg1G,OAAe,KAATh1G,EAAEg1G,MAAY,EAAEiZ,IAAE,EAAGF,GAAG/tH,EAAE,CAAC,KAAK,CAAC,GAAG4uH,GAAG5uH,GAAG,MAAMkH,MAAMG,EAAE,MAAMrH,EAAEg1G,OAAe,KAATh1G,EAAEg1G,MAAY,EAAEiZ,IAAE,EAAGF,GAAG/tH,CAAC,CAAC,CAAC,CAAC,SAAS8uH,GAAG9uH,GAAG,IAAIA,EAAEA,EAAE+0G,OAAO,OAAO/0G,GAAG,IAAIA,EAAE1D,KAAK,IAAI0D,EAAE1D,KAAK,KAAK0D,EAAE1D,KAAK0D,EAAEA,EAAE+0G,OAAOgZ,GAAG/tH,CAAC,CACha,SAAS+uH,GAAG/uH,GAAG,GAAGA,IAAI+tH,GAAG,OAAM,EAAG,IAAIE,GAAE,OAAOa,GAAG9uH,GAAGiuH,IAAE,GAAG,EAAG,IAAIhuH,EAAkG,IAA/FA,EAAE,IAAID,EAAE1D,QAAQ2D,EAAE,IAAID,EAAE1D,OAAgB2D,EAAE,UAAXA,EAAED,EAAE0G,OAAmB,SAASzG,IAAIqqH,GAAGtqH,EAAE0G,KAAK1G,EAAEgvH,gBAAmB/uH,IAAIA,EAAE+tH,IAAI,CAAC,GAAGY,GAAG5uH,GAAG,MAAMivH,KAAK/nH,MAAMG,EAAE,MAAM,KAAKpH,GAAGkuH,GAAGnuH,EAAEC,GAAGA,EAAE8qH,GAAG9qH,EAAE6kH,YAAY,CAAO,GAANgK,GAAG9uH,GAAM,KAAKA,EAAE1D,IAAI,CAAgD,KAA7B0D,EAAE,QAApBA,EAAEA,EAAEk1G,eAAyBl1G,EAAEm1G,WAAW,MAAW,MAAMjuG,MAAMG,EAAE,MAAMrH,EAAE,CAAiB,IAAhBA,EAAEA,EAAE8kH,YAAgB7kH,EAAE,EAAED,GAAG,CAAC,GAAG,IAAIA,EAAE4yE,SAAS,CAAC,IAAIn4E,EAAEuF,EAAEgO,KAAK,GAAG,OAAOvT,EAAE,CAAC,GAAG,IAAIwF,EAAE,CAAC+tH,GAAGjD,GAAG/qH,EAAE8kH,aAAa,MAAM9kH,CAAC,CAACC,GAAG,KAAK,MAAMxF,GAAG,OAAOA,GAAG,OAAOA,GAAGwF,GAAG,CAACD,EAAEA,EAAE8kH,WAAW,CAACkJ,GACjgB,IAAI,CAAC,MAAMA,GAAGD,GAAGhD,GAAG/qH,EAAE0zG,UAAUoR,aAAa,KAAK,OAAM,CAAE,CAAC,SAASmK,KAAK,IAAI,IAAIjvH,EAAEguH,GAAGhuH,GAAGA,EAAE+qH,GAAG/qH,EAAE8kH,YAAY,CAAC,SAASoK,KAAKlB,GAAGD,GAAG,KAAKE,IAAE,CAAE,CAAC,SAASkB,GAAGnvH,GAAG,OAAOkuH,GAAGA,GAAG,CAACluH,GAAGkuH,GAAGvvH,KAAKqB,EAAE,CAAC,IAAIovH,GAAGrlB,EAAG0Q,wBAAwB,SAAS4U,GAAGrvH,EAAEC,GAAG,GAAGD,GAAGA,EAAEsvH,aAAa,CAA4B,IAAI,IAAI70H,KAAnCwF,EAAEirG,EAAE,CAAC,EAAEjrG,GAAGD,EAAEA,EAAEsvH,kBAA4B,IAASrvH,EAAExF,KAAKwF,EAAExF,GAAGuF,EAAEvF,IAAI,OAAOwF,CAAC,CAAC,OAAOA,CAAC,CAAC,IAAIsvH,GAAG9D,GAAG,MAAM+D,GAAG,KAAKC,GAAG,KAAKC,GAAG,KAAK,SAASC,KAAKD,GAAGD,GAAGD,GAAG,IAAI,CAAC,SAASI,GAAG5vH,GAAG,IAAIC,EAAEsvH,GAAGtrH,QAAQynH,GAAE6D,IAAIvvH,EAAE6vH,cAAc5vH,CAAC,CACjd,SAAS6vH,GAAG9vH,EAAEC,EAAExF,GAAG,KAAK,OAAOuF,GAAG,CAAC,IAAIjF,EAAEiF,EAAE80G,UAA+H,IAApH90G,EAAE+vH,WAAW9vH,KAAKA,GAAGD,EAAE+vH,YAAY9vH,EAAE,OAAOlF,IAAIA,EAAEg1H,YAAY9vH,IAAI,OAAOlF,IAAIA,EAAEg1H,WAAW9vH,KAAKA,IAAIlF,EAAEg1H,YAAY9vH,GAAMD,IAAIvF,EAAE,MAAMuF,EAAEA,EAAE+0G,MAAM,CAAC,CAAC,SAASib,GAAGhwH,EAAEC,GAAGuvH,GAAGxvH,EAAE0vH,GAAGD,GAAG,KAAsB,QAAjBzvH,EAAEA,EAAEiwH,eAAuB,OAAOjwH,EAAEkwH,eAAe,KAAKlwH,EAAEmwH,MAAMlwH,KAAKmwH,IAAG,GAAIpwH,EAAEkwH,aAAa,KAAK,CACtU,SAASG,GAAGrwH,GAAG,IAAIC,EAAED,EAAE6vH,cAAc,GAAGH,KAAK1vH,EAAE,GAAGA,EAAE,CAACu8B,QAAQv8B,EAAEswH,cAAcrwH,EAAEkwC,KAAK,MAAM,OAAOs/E,GAAG,CAAC,GAAG,OAAOD,GAAG,MAAMtoH,MAAMG,EAAE,MAAMooH,GAAGzvH,EAAEwvH,GAAGS,aAAa,CAACE,MAAM,EAAED,aAAalwH,EAAE,MAAMyvH,GAAGA,GAAGt/E,KAAKnwC,EAAE,OAAOC,CAAC,CAAC,IAAIswH,GAAG,KAAK,SAASC,GAAGxwH,GAAG,OAAOuwH,GAAGA,GAAG,CAACvwH,GAAGuwH,GAAG5xH,KAAKqB,EAAE,CAAC,SAASywH,GAAGzwH,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAEvK,EAAEywH,YAA+E,OAAnE,OAAOlmH,GAAG/P,EAAE01C,KAAK11C,EAAE+1H,GAAGvwH,KAAKxF,EAAE01C,KAAK3lC,EAAE2lC,KAAK3lC,EAAE2lC,KAAK11C,GAAGwF,EAAEywH,YAAYj2H,EAASk2H,GAAG3wH,EAAEjF,EAAE,CAChY,SAAS41H,GAAG3wH,EAAEC,GAAGD,EAAEmwH,OAAOlwH,EAAE,IAAIxF,EAAEuF,EAAE80G,UAAqC,IAA3B,OAAOr6G,IAAIA,EAAE01H,OAAOlwH,GAAGxF,EAAEuF,EAAMA,EAAEA,EAAE+0G,OAAO,OAAO/0G,GAAGA,EAAE+vH,YAAY9vH,EAAgB,QAAdxF,EAAEuF,EAAE80G,aAAqBr6G,EAAEs1H,YAAY9vH,GAAGxF,EAAEuF,EAAEA,EAAEA,EAAE+0G,OAAO,OAAO,IAAIt6G,EAAE6B,IAAI7B,EAAEi5G,UAAU,IAAI,CAAC,IAAIkd,IAAG,EAAG,SAASC,GAAG7wH,GAAGA,EAAE8wH,YAAY,CAACC,UAAU/wH,EAAEk1G,cAAc8b,gBAAgB,KAAKC,eAAe,KAAKC,OAAO,CAACC,QAAQ,KAAKT,YAAY,KAAKP,MAAM,GAAGiB,QAAQ,KAAK,CACpX,SAASC,GAAGrxH,EAAEC,GAAGD,EAAEA,EAAE8wH,YAAY7wH,EAAE6wH,cAAc9wH,IAAIC,EAAE6wH,YAAY,CAACC,UAAU/wH,EAAE+wH,UAAUC,gBAAgBhxH,EAAEgxH,gBAAgBC,eAAejxH,EAAEixH,eAAeC,OAAOlxH,EAAEkxH,OAAOE,QAAQpxH,EAAEoxH,SAAS,CAAC,SAASE,GAAGtxH,EAAEC,GAAG,MAAM,CAACsxH,UAAUvxH,EAAEwxH,KAAKvxH,EAAE3D,IAAI,EAAE4G,QAAQ,KAAKxB,SAAS,KAAKyuC,KAAK,KAAK,CACtR,SAASshF,GAAGzxH,EAAEC,EAAExF,GAAG,IAAIM,EAAEiF,EAAE8wH,YAAY,GAAG,OAAO/1H,EAAE,OAAO,KAAgB,GAAXA,EAAEA,EAAEm2H,OAAU,KAAO,EAAFQ,IAAK,CAAC,IAAIlnH,EAAEzP,EAAEo2H,QAA+D,OAAvD,OAAO3mH,EAAEvK,EAAEkwC,KAAKlwC,GAAGA,EAAEkwC,KAAK3lC,EAAE2lC,KAAK3lC,EAAE2lC,KAAKlwC,GAAGlF,EAAEo2H,QAAQlxH,EAAS0wH,GAAG3wH,EAAEvF,EAAE,CAAoF,OAAnE,QAAhB+P,EAAEzP,EAAE21H,cAAsBzwH,EAAEkwC,KAAKlwC,EAAEuwH,GAAGz1H,KAAKkF,EAAEkwC,KAAK3lC,EAAE2lC,KAAK3lC,EAAE2lC,KAAKlwC,GAAGlF,EAAE21H,YAAYzwH,EAAS0wH,GAAG3wH,EAAEvF,EAAE,CAAC,SAASk3H,GAAG3xH,EAAEC,EAAExF,GAAmB,GAAG,QAAnBwF,EAAEA,EAAE6wH,eAA0B7wH,EAAEA,EAAEixH,OAAO,KAAO,QAAFz2H,IAAY,CAAC,IAAIM,EAAEkF,EAAEkwH,MAAwB11H,GAAlBM,GAAGiF,EAAEy3G,aAAkBx3G,EAAEkwH,MAAM11H,EAAE29G,GAAGp4G,EAAEvF,EAAE,CAAC,CACrZ,SAASm3H,GAAG5xH,EAAEC,GAAG,IAAIxF,EAAEuF,EAAE8wH,YAAY/1H,EAAEiF,EAAE80G,UAAU,GAAG,OAAO/5G,GAAoBN,KAAhBM,EAAEA,EAAE+1H,aAAmB,CAAC,IAAItmH,EAAE,KAAKiG,EAAE,KAAyB,GAAG,QAAvBhW,EAAEA,EAAEu2H,iBAA4B,CAAC,EAAE,CAAC,IAAIpoB,EAAE,CAAC2oB,UAAU92H,EAAE82H,UAAUC,KAAK/2H,EAAE+2H,KAAKl1H,IAAI7B,EAAE6B,IAAI4G,QAAQzI,EAAEyI,QAAQxB,SAASjH,EAAEiH,SAASyuC,KAAK,MAAM,OAAO1/B,EAAEjG,EAAEiG,EAAEm4F,EAAEn4F,EAAEA,EAAE0/B,KAAKy4D,EAAEnuG,EAAEA,EAAE01C,IAAI,OAAO,OAAO11C,GAAG,OAAOgW,EAAEjG,EAAEiG,EAAExQ,EAAEwQ,EAAEA,EAAE0/B,KAAKlwC,CAAC,MAAMuK,EAAEiG,EAAExQ,EAAiH,OAA/GxF,EAAE,CAACs2H,UAAUh2H,EAAEg2H,UAAUC,gBAAgBxmH,EAAEymH,eAAexgH,EAAEygH,OAAOn2H,EAAEm2H,OAAOE,QAAQr2H,EAAEq2H,cAASpxH,EAAE8wH,YAAYr2H,EAAQ,CAAoB,QAAnBuF,EAAEvF,EAAEw2H,gBAAwBx2H,EAAEu2H,gBAAgB/wH,EAAED,EAAEmwC,KACnflwC,EAAExF,EAAEw2H,eAAehxH,CAAC,CACpB,SAAS4xH,GAAG7xH,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAExK,EAAE8wH,YAAYF,IAAG,EAAG,IAAIngH,EAAEjG,EAAEwmH,gBAAgBpoB,EAAEp+F,EAAEymH,eAAez2F,EAAEhwB,EAAE0mH,OAAOC,QAAQ,GAAG,OAAO32F,EAAE,CAAChwB,EAAE0mH,OAAOC,QAAQ,KAAK,IAAI9hH,EAAEmrB,EAAEixE,EAAEp8F,EAAE8gC,KAAK9gC,EAAE8gC,KAAK,KAAK,OAAOy4D,EAAEn4F,EAAEg7F,EAAE7C,EAAEz4D,KAAKs7D,EAAE7C,EAAEv5F,EAAE,IAAIimB,EAAEt1B,EAAE80G,UAAU,OAAOx/E,KAAoBkF,GAAhBlF,EAAEA,EAAEw7F,aAAgBG,kBAAmBroB,IAAI,OAAOpuE,EAAElF,EAAE07F,gBAAgBvlB,EAAEjxE,EAAE2V,KAAKs7D,EAAEn2E,EAAE27F,eAAe5hH,GAAG,CAAC,GAAG,OAAOoB,EAAE,CAAC,IAAIyxB,EAAE13B,EAAEumH,UAA6B,IAAnBnoB,EAAE,EAAEtzE,EAAEm2E,EAAEp8F,EAAE,KAAKmrB,EAAE/pB,IAAI,CAAC,IAAIqxB,EAAEtH,EAAEg3F,KAAKM,EAAEt3F,EAAE+2F,UAAU,IAAIx2H,EAAE+mC,KAAKA,EAAE,CAAC,OAAOxM,IAAIA,EAAEA,EAAE6a,KAAK,CAACohF,UAAUO,EAAEN,KAAK,EAAEl1H,IAAIk+B,EAAEl+B,IAAI4G,QAAQs3B,EAAEt3B,QAAQxB,SAAS84B,EAAE94B,SACvfyuC,KAAK,OAAOnwC,EAAE,CAAC,IAAI4Q,EAAE5Q,EAAEwQ,EAAEgqB,EAAU,OAARsH,EAAE7hC,EAAE6xH,EAAEr3H,EAAS+V,EAAElU,KAAK,KAAK,EAAc,GAAG,oBAAfsU,EAAEJ,EAAEtN,SAAiC,CAACg/B,EAAEtxB,EAAEhC,KAAKkjH,EAAE5vF,EAAEJ,GAAG,MAAM9hC,CAAC,CAACkiC,EAAEtxB,EAAE,MAAM5Q,EAAE,KAAK,EAAE4Q,EAAEokG,OAAe,MAATpkG,EAAEokG,MAAa,IAAI,KAAK,EAAsD,GAAG,QAA3ClzE,EAAE,oBAAdlxB,EAAEJ,EAAEtN,SAAgC0N,EAAEhC,KAAKkjH,EAAE5vF,EAAEJ,GAAGlxB,SAAe,IAASkxB,EAAE,MAAM9hC,EAAEkiC,EAAEgpE,EAAE,CAAC,EAAEhpE,EAAEJ,GAAG,MAAM9hC,EAAE,KAAK,EAAE4wH,IAAG,EAAG,CAAC,OAAOp2F,EAAE94B,UAAU,IAAI84B,EAAEg3F,OAAOxxH,EAAEg1G,OAAO,GAAe,QAAZlzE,EAAEt3B,EAAE4mH,SAAiB5mH,EAAE4mH,QAAQ,CAAC52F,GAAGsH,EAAEnjC,KAAK67B,GAAG,MAAMs3F,EAAE,CAACP,UAAUO,EAAEN,KAAK1vF,EAAExlC,IAAIk+B,EAAEl+B,IAAI4G,QAAQs3B,EAAEt3B,QAAQxB,SAAS84B,EAAE94B,SAASyuC,KAAK,MAAM,OAAO7a,GAAGm2E,EAAEn2E,EAAEw8F,EAAEziH,EAAE6yB,GAAG5M,EAAEA,EAAE6a,KAAK2hF,EAAElpB,GAAG9mE,EAC3e,GAAG,QAAZtH,EAAEA,EAAE2V,MAAiB,IAAsB,QAAnB3V,EAAEhwB,EAAE0mH,OAAOC,SAAiB,MAAe32F,GAAJsH,EAAEtH,GAAM2V,KAAKrO,EAAEqO,KAAK,KAAK3lC,EAAEymH,eAAenvF,EAAEt3B,EAAE0mH,OAAOC,QAAQ,IAAI,EAAsG,GAA5F,OAAO77F,IAAIjmB,EAAE6yB,GAAG13B,EAAEumH,UAAU1hH,EAAE7E,EAAEwmH,gBAAgBvlB,EAAEjhG,EAAEymH,eAAe37F,EAA4B,QAA1Br1B,EAAEuK,EAAE0mH,OAAOR,aAAwB,CAAClmH,EAAEvK,EAAE,GAAG2oG,GAAGp+F,EAAEgnH,KAAKhnH,EAAEA,EAAE2lC,WAAW3lC,IAAIvK,EAAE,MAAM,OAAOwQ,IAAIjG,EAAE0mH,OAAOf,MAAM,GAAG4B,IAAInpB,EAAE5oG,EAAEmwH,MAAMvnB,EAAE5oG,EAAEk1G,cAAchzE,CAAC,CAAC,CAC9V,SAAS8vF,GAAGhyH,EAAEC,EAAExF,GAA8B,GAA3BuF,EAAEC,EAAEmxH,QAAQnxH,EAAEmxH,QAAQ,KAAQ,OAAOpxH,EAAE,IAAIC,EAAE,EAAEA,EAAED,EAAEhG,OAAOiG,IAAI,CAAC,IAAIlF,EAAEiF,EAAEC,GAAGuK,EAAEzP,EAAE2G,SAAS,GAAG,OAAO8I,EAAE,CAAqB,GAApBzP,EAAE2G,SAAS,KAAK3G,EAAEN,EAAK,oBAAoB+P,EAAE,MAAMtD,MAAMG,EAAE,IAAImD,IAAIA,EAAEoE,KAAK7T,EAAE,CAAC,CAAC,CAAC,IAAIk3H,IAAI,IAAI/pB,EAAG32F,WAAW2gH,KAAK,SAASC,GAAGnyH,EAAEC,EAAExF,EAAEM,GAA8BN,EAAE,QAAXA,EAAEA,EAAEM,EAAtBkF,EAAED,EAAEk1G,sBAAmC,IAASz6G,EAAEwF,EAAEirG,EAAE,CAAC,EAAEjrG,EAAExF,GAAGuF,EAAEk1G,cAAcz6G,EAAE,IAAIuF,EAAEmwH,QAAQnwH,EAAE8wH,YAAYC,UAAUt2H,EAAE,CAClX,IAAI23H,GAAG,CAACC,UAAU,SAASryH,GAAG,SAAOA,EAAEA,EAAEsyH,kBAAiBzd,GAAG70G,KAAKA,CAAI,EAAEuyH,gBAAgB,SAASvyH,EAAEC,EAAExF,GAAGuF,EAAEA,EAAEsyH,gBAAgB,IAAIv3H,EAAEy3H,KAAIhoH,EAAEioH,GAAGzyH,GAAGyQ,EAAE6gH,GAAGv2H,EAAEyP,GAAGiG,EAAEvN,QAAQjD,OAAE,IAASxF,GAAG,OAAOA,IAAIgW,EAAE/O,SAASjH,GAAe,QAAZwF,EAAEwxH,GAAGzxH,EAAEyQ,EAAEjG,MAAckoH,GAAGzyH,EAAED,EAAEwK,EAAEzP,GAAG42H,GAAG1xH,EAAED,EAAEwK,GAAG,EAAEmoH,oBAAoB,SAAS3yH,EAAEC,EAAExF,GAAGuF,EAAEA,EAAEsyH,gBAAgB,IAAIv3H,EAAEy3H,KAAIhoH,EAAEioH,GAAGzyH,GAAGyQ,EAAE6gH,GAAGv2H,EAAEyP,GAAGiG,EAAEnU,IAAI,EAAEmU,EAAEvN,QAAQjD,OAAE,IAASxF,GAAG,OAAOA,IAAIgW,EAAE/O,SAASjH,GAAe,QAAZwF,EAAEwxH,GAAGzxH,EAAEyQ,EAAEjG,MAAckoH,GAAGzyH,EAAED,EAAEwK,EAAEzP,GAAG42H,GAAG1xH,EAAED,EAAEwK,GAAG,EAAEooH,mBAAmB,SAAS5yH,EAAEC,GAAGD,EAAEA,EAAEsyH,gBAAgB,IAAI73H,EAAE+3H,KAAIz3H,EACnf03H,GAAGzyH,GAAGwK,EAAE8mH,GAAG72H,EAAEM,GAAGyP,EAAElO,IAAI,OAAE,IAAS2D,GAAG,OAAOA,IAAIuK,EAAE9I,SAASzB,GAAe,QAAZA,EAAEwxH,GAAGzxH,EAAEwK,EAAEzP,MAAc23H,GAAGzyH,EAAED,EAAEjF,EAAEN,GAAGk3H,GAAG1xH,EAAED,EAAEjF,GAAG,GAAG,SAAS83H,GAAG7yH,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,EAAEm4F,GAAiB,MAAM,oBAApB5oG,EAAEA,EAAE0zG,WAAsCof,sBAAsB9yH,EAAE8yH,sBAAsB/3H,EAAE0V,EAAEm4F,IAAG3oG,EAAEsN,YAAWtN,EAAEsN,UAAUwlH,wBAAsBpO,GAAGlqH,EAAEM,KAAK4pH,GAAGn6G,EAAEiG,GAAK,CAC1S,SAASuiH,GAAGhzH,EAAEC,EAAExF,GAAG,IAAIM,GAAE,EAAGyP,EAAEohH,GAAOn7G,EAAExQ,EAAEgzH,YAA2W,MAA/V,kBAAkBxiH,GAAG,OAAOA,EAAEA,EAAE4/G,GAAG5/G,IAAIjG,EAAE4hH,GAAGnsH,GAAG8rH,GAAGF,GAAE5nH,QAAyBwM,GAAG1V,EAAE,QAAtBA,EAAEkF,EAAEgsH,oBAA4B,IAASlxH,GAAGixH,GAAGhsH,EAAEwK,GAAGohH,IAAI3rH,EAAE,IAAIA,EAAExF,EAAEgW,GAAGzQ,EAAEk1G,cAAc,OAAOj1G,EAAE+C,YAAO,IAAS/C,EAAE+C,MAAM/C,EAAE+C,MAAM,KAAK/C,EAAE2rF,QAAQwmC,GAAGpyH,EAAE0zG,UAAUzzG,EAAEA,EAAEqyH,gBAAgBtyH,EAAEjF,KAAIiF,EAAEA,EAAE0zG,WAAYwY,4CAA4C1hH,EAAExK,EAAEmsH,0CAA0C17G,GAAUxQ,CAAC,CAC5Z,SAASizH,GAAGlzH,EAAEC,EAAExF,EAAEM,GAAGiF,EAAEC,EAAE+C,MAAM,oBAAoB/C,EAAEkzH,2BAA2BlzH,EAAEkzH,0BAA0B14H,EAAEM,GAAG,oBAAoBkF,EAAEmzH,kCAAkCnzH,EAAEmzH,iCAAiC34H,EAAEM,GAAGkF,EAAE+C,QAAQhD,GAAGoyH,GAAGO,oBAAoB1yH,EAAEA,EAAE+C,MAAM,KAAK,CACpQ,SAASqwH,GAAGrzH,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAExK,EAAE0zG,UAAUlpG,EAAEyH,MAAMxX,EAAE+P,EAAExH,MAAMhD,EAAEk1G,cAAc1qG,EAAE0nH,KAAKD,GAAGpB,GAAG7wH,GAAG,IAAIyQ,EAAExQ,EAAEgzH,YAAY,kBAAkBxiH,GAAG,OAAOA,EAAEjG,EAAE+xB,QAAQ8zF,GAAG5/G,IAAIA,EAAE27G,GAAGnsH,GAAG8rH,GAAGF,GAAE5nH,QAAQuG,EAAE+xB,QAAQyvF,GAAGhsH,EAAEyQ,IAAIjG,EAAExH,MAAMhD,EAAEk1G,cAA2C,oBAA7BzkG,EAAExQ,EAAEqzH,4BAAiDnB,GAAGnyH,EAAEC,EAAEwQ,EAAEhW,GAAG+P,EAAExH,MAAMhD,EAAEk1G,eAAe,oBAAoBj1G,EAAEqzH,0BAA0B,oBAAoB9oH,EAAE+oH,yBAAyB,oBAAoB/oH,EAAEgpH,2BAA2B,oBAAoBhpH,EAAEipH,qBAAqBxzH,EAAEuK,EAAExH,MACrf,oBAAoBwH,EAAEipH,oBAAoBjpH,EAAEipH,qBAAqB,oBAAoBjpH,EAAEgpH,2BAA2BhpH,EAAEgpH,4BAA4BvzH,IAAIuK,EAAExH,OAAOovH,GAAGO,oBAAoBnoH,EAAEA,EAAExH,MAAM,MAAM6uH,GAAG7xH,EAAEvF,EAAE+P,EAAEzP,GAAGyP,EAAExH,MAAMhD,EAAEk1G,eAAe,oBAAoB1qG,EAAEkpH,oBAAoB1zH,EAAEg1G,OAAO,QAAQ,CACpS,SAAS2e,GAAG3zH,EAAEC,EAAExF,GAAW,GAAG,QAAXuF,EAAEvF,EAAEghE,MAAiB,oBAAoBz7D,GAAG,kBAAkBA,EAAE,CAAC,GAAGvF,EAAEm5H,OAAO,CAAY,GAAXn5H,EAAEA,EAAEm5H,OAAY,CAAC,GAAG,IAAIn5H,EAAE6B,IAAI,MAAM4K,MAAMG,EAAE,MAAM,IAAItM,EAAEN,EAAEi5G,SAAS,CAAC,IAAI34G,EAAE,MAAMmM,MAAMG,EAAE,IAAIrH,IAAI,IAAIwK,EAAEzP,EAAE0V,EAAE,GAAGzQ,EAAE,OAAG,OAAOC,GAAG,OAAOA,EAAEw7D,KAAK,oBAAoBx7D,EAAEw7D,KAAKx7D,EAAEw7D,IAAIo4D,aAAapjH,EAASxQ,EAAEw7D,KAAIx7D,EAAE,SAASD,GAAG,IAAIC,EAAEuK,EAAE0nH,KAAKjyH,IAAIgyH,KAAKhyH,EAAEuK,EAAE0nH,KAAK,CAAC,GAAG,OAAOlyH,SAASC,EAAEwQ,GAAGxQ,EAAEwQ,GAAGzQ,CAAC,EAAEC,EAAE4zH,WAAWpjH,EAASxQ,EAAC,CAAC,GAAG,kBAAkBD,EAAE,MAAMkH,MAAMG,EAAE,MAAM,IAAI5M,EAAEm5H,OAAO,MAAM1sH,MAAMG,EAAE,IAAIrH,GAAI,CAAC,OAAOA,CAAC,CACre,SAAS8zH,GAAG9zH,EAAEC,GAAuC,MAApCD,EAAE1B,OAAOiP,UAAUmX,SAAS9V,KAAK3O,GAASiH,MAAMG,EAAE,GAAG,oBAAoBrH,EAAE,qBAAqB1B,OAAOC,KAAK0B,GAAGiJ,KAAK,MAAM,IAAIlJ,GAAI,CAAC,SAAS+zH,GAAG/zH,GAAiB,OAAOC,EAAfD,EAAEisG,OAAejsG,EAAEgsG,SAAS,CACrM,SAASgoB,GAAGh0H,GAAG,SAASC,EAAEA,EAAExF,GAAG,GAAGuF,EAAE,CAAC,IAAIjF,EAAEkF,EAAEquH,UAAU,OAAOvzH,GAAGkF,EAAEquH,UAAU,CAAC7zH,GAAGwF,EAAE+0G,OAAO,IAAIj6G,EAAE4D,KAAKlE,EAAE,CAAC,CAAC,SAASA,EAAEA,EAAEM,GAAG,IAAIiF,EAAE,OAAO,KAAK,KAAK,OAAOjF,GAAGkF,EAAExF,EAAEM,GAAGA,EAAEA,EAAEu6G,QAAQ,OAAO,IAAI,CAAC,SAASv6G,EAAEiF,EAAEC,GAAG,IAAID,EAAE,IAAIwS,IAAI,OAAOvS,GAAG,OAAOA,EAAEhB,IAAIe,EAAEiT,IAAIhT,EAAEhB,IAAIgB,GAAGD,EAAEiT,IAAIhT,EAAEwb,MAAMxb,GAAGA,EAAEA,EAAEq1G,QAAQ,OAAOt1G,CAAC,CAAC,SAASwK,EAAExK,EAAEC,GAAsC,OAAnCD,EAAEi0H,GAAGj0H,EAAEC,IAAKwb,MAAM,EAAEzb,EAAEs1G,QAAQ,KAAYt1G,CAAC,CAAC,SAASyQ,EAAExQ,EAAExF,EAAEM,GAAa,OAAVkF,EAAEwb,MAAM1gB,EAAMiF,EAA6C,QAAjBjF,EAAEkF,EAAE60G,YAA6B/5G,EAAEA,EAAE0gB,OAAQhhB,GAAGwF,EAAE+0G,OAAO,EAAEv6G,GAAGM,GAAEkF,EAAE+0G,OAAO,EAASv6G,IAArGwF,EAAE+0G,OAAO,QAAQv6G,EAAqF,CAAC,SAASmuG,EAAE3oG,GACzd,OAD4dD,GAC7f,OAAOC,EAAE60G,YAAY70G,EAAE+0G,OAAO,GAAU/0G,CAAC,CAAC,SAASu6B,EAAEx6B,EAAEC,EAAExF,EAAEM,GAAG,OAAG,OAAOkF,GAAG,IAAIA,EAAE3D,MAAW2D,EAAEi0H,GAAGz5H,EAAEuF,EAAE8R,KAAK/W,IAAKg6G,OAAO/0G,EAAEC,KAAEA,EAAEuK,EAAEvK,EAAExF,IAAKs6G,OAAO/0G,EAASC,EAAC,CAAC,SAASoP,EAAErP,EAAEC,EAAExF,EAAEM,GAAG,IAAI0V,EAAEhW,EAAEiM,KAAK,OAAG+J,IAAI25F,EAAU90E,EAAEt1B,EAAEC,EAAExF,EAAEwX,MAAM6gC,SAAS/3C,EAAEN,EAAEwE,KAAQ,OAAOgB,IAAIA,EAAEouH,cAAc59G,GAAG,kBAAkBA,GAAG,OAAOA,GAAGA,EAAEq7F,WAAWjB,GAAIkpB,GAAGtjH,KAAKxQ,EAAEyG,QAAa3L,EAAEyP,EAAEvK,EAAExF,EAAEwX,QAASwpD,IAAIk4D,GAAG3zH,EAAEC,EAAExF,GAAGM,EAAEg6G,OAAO/0G,EAAEjF,KAAEA,EAAEo5H,GAAG15H,EAAEiM,KAAKjM,EAAEwE,IAAIxE,EAAEwX,MAAM,KAAKjS,EAAE8R,KAAK/W,IAAK0gE,IAAIk4D,GAAG3zH,EAAEC,EAAExF,GAAGM,EAAEg6G,OAAO/0G,EAASjF,EAAC,CAAC,SAAS0wG,EAAEzrG,EAAEC,EAAExF,EAAEM,GAAG,OAAG,OAAOkF,GAAG,IAAIA,EAAE3D,KACjf2D,EAAEyzG,UAAUsG,gBAAgBv/G,EAAEu/G,eAAe/5G,EAAEyzG,UAAU0gB,iBAAiB35H,EAAE25H,iBAAsBn0H,EAAEo0H,GAAG55H,EAAEuF,EAAE8R,KAAK/W,IAAKg6G,OAAO/0G,EAAEC,KAAEA,EAAEuK,EAAEvK,EAAExF,EAAEq4C,UAAU,KAAMiiE,OAAO/0G,EAASC,EAAC,CAAC,SAASq1B,EAAEt1B,EAAEC,EAAExF,EAAEM,EAAE0V,GAAG,OAAG,OAAOxQ,GAAG,IAAIA,EAAE3D,MAAW2D,EAAEq0H,GAAG75H,EAAEuF,EAAE8R,KAAK/W,EAAE0V,IAAKskG,OAAO/0G,EAAEC,KAAEA,EAAEuK,EAAEvK,EAAExF,IAAKs6G,OAAO/0G,EAASC,EAAC,CAAC,SAASiiC,EAAEliC,EAAEC,EAAExF,GAAG,GAAG,kBAAkBwF,GAAG,KAAKA,GAAG,kBAAkBA,EAAE,OAAOA,EAAEi0H,GAAG,GAAGj0H,EAAED,EAAE8R,KAAKrX,IAAKs6G,OAAO/0G,EAAEC,EAAE,GAAG,kBAAkBA,GAAG,OAAOA,EAAE,CAAC,OAAOA,EAAE6rG,UAAU,KAAK7B,EAAG,OAAOxvG,EAAE05H,GAAGl0H,EAAEyG,KAAKzG,EAAEhB,IAAIgB,EAAEgS,MAAM,KAAKjS,EAAE8R,KAAKrX,IACjfghE,IAAIk4D,GAAG3zH,EAAE,KAAKC,GAAGxF,EAAEs6G,OAAO/0G,EAAEvF,EAAE,KAAK0vG,EAAG,OAAOlqG,EAAEo0H,GAAGp0H,EAAED,EAAE8R,KAAKrX,IAAKs6G,OAAO/0G,EAAEC,EAAE,KAAK4qG,EAAiB,OAAO3oE,EAAEliC,GAAEjF,EAAnBkF,EAAEgsG,OAAmBhsG,EAAE+rG,UAAUvxG,GAAG,GAAGozG,GAAG5tG,IAAI+qG,EAAG/qG,GAAG,OAAOA,EAAEq0H,GAAGr0H,EAAED,EAAE8R,KAAKrX,EAAE,OAAQs6G,OAAO/0G,EAAEC,EAAE6zH,GAAG9zH,EAAEC,EAAE,CAAC,OAAO,IAAI,CAAC,SAAS6hC,EAAE9hC,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAE,OAAOvK,EAAEA,EAAEhB,IAAI,KAAK,GAAG,kBAAkBxE,GAAG,KAAKA,GAAG,kBAAkBA,EAAE,OAAO,OAAO+P,EAAE,KAAKgwB,EAAEx6B,EAAEC,EAAE,GAAGxF,EAAEM,GAAG,GAAG,kBAAkBN,GAAG,OAAOA,EAAE,CAAC,OAAOA,EAAEqxG,UAAU,KAAK7B,EAAG,OAAOxvG,EAAEwE,MAAMuL,EAAE6E,EAAErP,EAAEC,EAAExF,EAAEM,GAAG,KAAK,KAAKovG,EAAG,OAAO1vG,EAAEwE,MAAMuL,EAAEihG,EAAEzrG,EAAEC,EAAExF,EAAEM,GAAG,KAAK,KAAK8vG,EAAG,OAAiB/oE,EAAE9hC,EACpfC,GADweuK,EAAE/P,EAAEwxG,OACxexxG,EAAEuxG,UAAUjxG,GAAG,GAAG8yG,GAAGpzG,IAAIuwG,EAAGvwG,GAAG,OAAO,OAAO+P,EAAE,KAAK8qB,EAAEt1B,EAAEC,EAAExF,EAAEM,EAAE,MAAM+4H,GAAG9zH,EAAEvF,EAAE,CAAC,OAAO,IAAI,CAAC,SAASq3H,EAAE9xH,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,GAAG,kBAAkBzP,GAAG,KAAKA,GAAG,kBAAkBA,EAAE,OAAwBy/B,EAAEv6B,EAAnBD,EAAEA,EAAEhE,IAAIvB,IAAI,KAAW,GAAGM,EAAEyP,GAAG,GAAG,kBAAkBzP,GAAG,OAAOA,EAAE,CAAC,OAAOA,EAAE+wG,UAAU,KAAK7B,EAAG,OAA2C56F,EAAEpP,EAAtCD,EAAEA,EAAEhE,IAAI,OAAOjB,EAAEkE,IAAIxE,EAAEM,EAAEkE,MAAM,KAAWlE,EAAEyP,GAAG,KAAK2/F,EAAG,OAA2CsB,EAAExrG,EAAtCD,EAAEA,EAAEhE,IAAI,OAAOjB,EAAEkE,IAAIxE,EAAEM,EAAEkE,MAAM,KAAWlE,EAAEyP,GAAG,KAAKqgG,EAAiB,OAAOinB,EAAE9xH,EAAEC,EAAExF,GAAEgW,EAAvB1V,EAAEkxG,OAAuBlxG,EAAEixG,UAAUxhG,GAAG,GAAGqjG,GAAG9yG,IAAIiwG,EAAGjwG,GAAG,OAAwBu6B,EAAEr1B,EAAnBD,EAAEA,EAAEhE,IAAIvB,IAAI,KAAWM,EAAEyP,EAAE,MAAMspH,GAAG7zH,EAAElF,EAAE,CAAC,OAAO,IAAI,CAC9f,SAAS6V,EAAEpG,EAAEo+F,EAAEpuE,EAAEnrB,GAAG,IAAI,IAAIo8F,EAAE,KAAKn2E,EAAE,KAAK3rB,EAAEi/F,EAAEqgB,EAAErgB,EAAE,EAAEogB,EAAE,KAAK,OAAOr/G,GAAGs/G,EAAEzuF,EAAExgC,OAAOivH,IAAI,CAACt/G,EAAE8R,MAAMwtG,GAAGD,EAAEr/G,EAAEA,EAAE,MAAMq/G,EAAEr/G,EAAE2rG,QAAQ,IAAI1kG,EAAEkxB,EAAEt3B,EAAEb,EAAE6wB,EAAEyuF,GAAG55G,GAAG,GAAG,OAAOuB,EAAE,CAAC,OAAOjH,IAAIA,EAAEq/G,GAAG,KAAK,CAAChpH,GAAG2J,GAAG,OAAOiH,EAAEkkG,WAAW70G,EAAEuK,EAAEb,GAAGi/F,EAAEn4F,EAAEG,EAAEg4F,EAAEqgB,GAAG,OAAO3zF,EAAEm2E,EAAE76F,EAAE0kB,EAAEggF,QAAQ1kG,EAAE0kB,EAAE1kB,EAAEjH,EAAEq/G,CAAC,CAAC,GAAGC,IAAIzuF,EAAExgC,OAAO,OAAOS,EAAE+P,EAAEb,GAAGskH,IAAGN,GAAGnjH,EAAEy+G,GAAGxd,EAAE,GAAG,OAAO9hG,EAAE,CAAC,KAAKs/G,EAAEzuF,EAAExgC,OAAOivH,IAAkB,QAAdt/G,EAAEu4B,EAAE13B,EAAEgwB,EAAEyuF,GAAG55G,MAAcu5F,EAAEn4F,EAAE9G,EAAEi/F,EAAEqgB,GAAG,OAAO3zF,EAAEm2E,EAAE9hG,EAAE2rB,EAAEggF,QAAQ3rG,EAAE2rB,EAAE3rB,GAAc,OAAXskH,IAAGN,GAAGnjH,EAAEy+G,GAAUxd,CAAC,CAAC,IAAI9hG,EAAE5O,EAAEyP,EAAEb,GAAGs/G,EAAEzuF,EAAExgC,OAAOivH,IAAsB,QAAlBD,EAAE8I,EAAEnoH,EAAEa,EAAEy+G,EAAEzuF,EAAEyuF,GAAG55G,MAAcrP,GAAG,OAAOgpH,EAAElU,WAAWnrG,EAAEqK,OAAO,OACvfg1G,EAAE/pH,IAAIgqH,EAAED,EAAE/pH,KAAK2pG,EAAEn4F,EAAEu4G,EAAEpgB,EAAEqgB,GAAG,OAAO3zF,EAAEm2E,EAAEud,EAAE1zF,EAAEggF,QAAQ0T,EAAE1zF,EAAE0zF,GAAuD,OAApDhpH,GAAG2J,EAAE3F,SAAQ,SAAShE,GAAG,OAAOC,EAAEuK,EAAExK,EAAE,IAAGiuH,IAAGN,GAAGnjH,EAAEy+G,GAAUxd,CAAC,CAAC,SAASj7F,EAAEhG,EAAEo+F,EAAEpuE,EAAEnrB,GAAG,IAAIo8F,EAAET,EAAGxwE,GAAG,GAAG,oBAAoBixE,EAAE,MAAMvkG,MAAMG,EAAE,MAAkB,GAAG,OAAfmzB,EAAEixE,EAAE78F,KAAK4rB,IAAc,MAAMtzB,MAAMG,EAAE,MAAM,IAAI,IAAIsC,EAAE8hG,EAAE,KAAKn2E,EAAEszE,EAAEqgB,EAAErgB,EAAE,EAAEogB,EAAE,KAAKp4G,EAAE4pB,EAAE2V,OAAO,OAAO7a,IAAI1kB,EAAEiJ,KAAKovG,IAAIr4G,EAAE4pB,EAAE2V,OAAO,CAAC7a,EAAE7Z,MAAMwtG,GAAGD,EAAE1zF,EAAEA,EAAE,MAAM0zF,EAAE1zF,EAAEggF,QAAQ,IAAI9kG,EAAEsxB,EAAEt3B,EAAE8qB,EAAE1kB,EAAEnK,MAAM4I,GAAG,GAAG,OAAOmB,EAAE,CAAC,OAAO8kB,IAAIA,EAAE0zF,GAAG,KAAK,CAAChpH,GAAGs1B,GAAG,OAAO9kB,EAAEskG,WAAW70G,EAAEuK,EAAE8qB,GAAGszE,EAAEn4F,EAAED,EAAEo4F,EAAEqgB,GAAG,OAAOt/G,EAAE8hG,EAAEj7F,EAAE7G,EAAE2rG,QAAQ9kG,EAAE7G,EAAE6G,EAAE8kB,EAAE0zF,CAAC,CAAC,GAAGp4G,EAAEiJ,KAAK,OAAOpf,EAAE+P,EACzf8qB,GAAG24F,IAAGN,GAAGnjH,EAAEy+G,GAAGxd,EAAE,GAAG,OAAOn2E,EAAE,CAAC,MAAM1kB,EAAEiJ,KAAKovG,IAAIr4G,EAAE4pB,EAAE2V,OAAwB,QAAjBv/B,EAAEsxB,EAAE13B,EAAEoG,EAAEnK,MAAM4I,MAAcu5F,EAAEn4F,EAAEG,EAAEg4F,EAAEqgB,GAAG,OAAOt/G,EAAE8hG,EAAE76F,EAAEjH,EAAE2rG,QAAQ1kG,EAAEjH,EAAEiH,GAAc,OAAXq9G,IAAGN,GAAGnjH,EAAEy+G,GAAUxd,CAAC,CAAC,IAAIn2E,EAAEv6B,EAAEyP,EAAE8qB,IAAI1kB,EAAEiJ,KAAKovG,IAAIr4G,EAAE4pB,EAAE2V,OAA4B,QAArBv/B,EAAEkhH,EAAEx8F,EAAE9qB,EAAEy+G,EAAEr4G,EAAEnK,MAAM4I,MAAcrP,GAAG,OAAO4Q,EAAEkkG,WAAWx/E,EAAEthB,OAAO,OAAOpD,EAAE3R,IAAIgqH,EAAEr4G,EAAE3R,KAAK2pG,EAAEn4F,EAAEG,EAAEg4F,EAAEqgB,GAAG,OAAOt/G,EAAE8hG,EAAE76F,EAAEjH,EAAE2rG,QAAQ1kG,EAAEjH,EAAEiH,GAAuD,OAApD5Q,GAAGs1B,EAAEtxB,SAAQ,SAAShE,GAAG,OAAOC,EAAEuK,EAAExK,EAAE,IAAGiuH,IAAGN,GAAGnjH,EAAEy+G,GAAUxd,CAAC,CAG3T,OAH4T,SAASsd,EAAE/oH,EAAEjF,EAAE0V,EAAE+pB,GAAkF,GAA/E,kBAAkB/pB,GAAG,OAAOA,GAAGA,EAAE/J,OAAO0jG,GAAI,OAAO35F,EAAExR,MAAMwR,EAAEA,EAAEwB,MAAM6gC,UAAa,kBAAkBriC,GAAG,OAAOA,EAAE,CAAC,OAAOA,EAAEq7F,UAAU,KAAK7B,EAAGjqG,EAAE,CAAC,IAAI,IAAIqP,EAC7hBoB,EAAExR,IAAIwsG,EAAE1wG,EAAE,OAAO0wG,GAAG,CAAC,GAAGA,EAAExsG,MAAMoQ,EAAE,CAAU,IAATA,EAAEoB,EAAE/J,QAAY0jG,GAAI,GAAG,IAAIqB,EAAEnvG,IAAI,CAAC7B,EAAEuF,EAAEyrG,EAAE6J,UAASv6G,EAAEyP,EAAEihG,EAAEh7F,EAAEwB,MAAM6gC,WAAYiiE,OAAO/0G,EAAEA,EAAEjF,EAAE,MAAMiF,CAAC,OAAO,GAAGyrG,EAAE4iB,cAAch/G,GAAG,kBAAkBA,GAAG,OAAOA,GAAGA,EAAEy8F,WAAWjB,GAAIkpB,GAAG1kH,KAAKo8F,EAAE/kG,KAAK,CAACjM,EAAEuF,EAAEyrG,EAAE6J,UAASv6G,EAAEyP,EAAEihG,EAAEh7F,EAAEwB,QAASwpD,IAAIk4D,GAAG3zH,EAAEyrG,EAAEh7F,GAAG1V,EAAEg6G,OAAO/0G,EAAEA,EAAEjF,EAAE,MAAMiF,CAAC,CAACvF,EAAEuF,EAAEyrG,GAAG,KAAK,CAAMxrG,EAAED,EAAEyrG,GAAGA,EAAEA,EAAE6J,OAAO,CAAC7kG,EAAE/J,OAAO0jG,IAAIrvG,EAAEu5H,GAAG7jH,EAAEwB,MAAM6gC,SAAS9yC,EAAE8R,KAAK0oB,EAAE/pB,EAAExR,MAAO81G,OAAO/0G,EAAEA,EAAEjF,KAAIy/B,EAAE25F,GAAG1jH,EAAE/J,KAAK+J,EAAExR,IAAIwR,EAAEwB,MAAM,KAAKjS,EAAE8R,KAAK0oB,IAAKihC,IAAIk4D,GAAG3zH,EAAEjF,EAAE0V,GAAG+pB,EAAEu6E,OAAO/0G,EAAEA,EAAEw6B,EAAE,CAAC,OAAOouE,EAAE5oG,GAAG,KAAKmqG,EAAGnqG,EAAE,CAAC,IAAIyrG,EAAEh7F,EAAExR,IAAI,OACzflE,GAAG,CAAC,GAAGA,EAAEkE,MAAMwsG,EAAC,CAAC,GAAG,IAAI1wG,EAAEuB,KAAKvB,EAAE24G,UAAUsG,gBAAgBvpG,EAAEupG,eAAej/G,EAAE24G,UAAU0gB,iBAAiB3jH,EAAE2jH,eAAe,CAAC35H,EAAEuF,EAAEjF,EAAEu6G,UAASv6G,EAAEyP,EAAEzP,EAAE0V,EAAEqiC,UAAU,KAAMiiE,OAAO/0G,EAAEA,EAAEjF,EAAE,MAAMiF,CAAC,CAAMvF,EAAEuF,EAAEjF,GAAG,KAAM,CAAKkF,EAAED,EAAEjF,GAAGA,EAAEA,EAAEu6G,OAAO,EAACv6G,EAAEs5H,GAAG5jH,EAAEzQ,EAAE8R,KAAK0oB,IAAKu6E,OAAO/0G,EAAEA,EAAEjF,CAAC,CAAC,OAAO6tG,EAAE5oG,GAAG,KAAK6qG,EAAG,OAAiBke,EAAE/oH,EAAEjF,GAAd0wG,EAAEh7F,EAAEw7F,OAAcx7F,EAAEu7F,UAAUxxE,GAAG,GAAGqzE,GAAGp9F,GAAG,OAAOG,EAAE5Q,EAAEjF,EAAE0V,EAAE+pB,GAAG,GAAGwwE,EAAGv6F,GAAG,OAAOD,EAAExQ,EAAEjF,EAAE0V,EAAE+pB,GAAGs5F,GAAG9zH,EAAEyQ,EAAE,CAAC,MAAM,kBAAkBA,GAAG,KAAKA,GAAG,kBAAkBA,GAAGA,EAAE,GAAGA,EAAE,OAAO1V,GAAG,IAAIA,EAAEuB,KAAK7B,EAAEuF,EAAEjF,EAAEu6G,UAASv6G,EAAEyP,EAAEzP,EAAE0V,IAAKskG,OAAO/0G,EAAEA,EAAEjF,IACnfN,EAAEuF,EAAEjF,IAAGA,EAAEm5H,GAAGzjH,EAAEzQ,EAAE8R,KAAK0oB,IAAKu6E,OAAO/0G,EAAEA,EAAEjF,GAAG6tG,EAAE5oG,IAAIvF,EAAEuF,EAAEjF,EAAE,CAAS,CAAC,IAAIw5H,GAAGP,IAAG,GAAIQ,GAAGR,IAAG,GAAIS,GAAG,CAAC,EAAEC,GAAGjJ,GAAGgJ,IAAIE,GAAGlJ,GAAGgJ,IAAIG,GAAGnJ,GAAGgJ,IAAI,SAASI,GAAG70H,GAAG,GAAGA,IAAIy0H,GAAG,MAAMvtH,MAAMG,EAAE,MAAM,OAAOrH,CAAC,CAAC,SAAS80H,GAAG90H,EAAEC,GAAyC,OAAtC0rH,GAAEiJ,GAAG30H,GAAG0rH,GAAEgJ,GAAG30H,GAAG2rH,GAAE+I,GAAGD,IAAIz0H,EAAEC,EAAE2yE,UAAmB,KAAK,EAAE,KAAK,GAAG3yE,GAAGA,EAAEA,EAAEulH,iBAAiBvlH,EAAEyuG,aAAaH,GAAG,KAAK,IAAI,MAAM,QAAkEtuG,EAAEsuG,GAArCtuG,GAAvBD,EAAE,IAAIA,EAAEC,EAAEk0B,WAAWl0B,GAAMyuG,cAAc,KAAK1uG,EAAEA,EAAE+0H,SAAkBrJ,GAAEgJ,IAAI/I,GAAE+I,GAAGz0H,EAAE,CAAC,SAAS+0H,KAAKtJ,GAAEgJ,IAAIhJ,GAAEiJ,IAAIjJ,GAAEkJ,GAAG,CACnb,SAASK,GAAGj1H,GAAG60H,GAAGD,GAAG3wH,SAAS,IAAIhE,EAAE40H,GAAGH,GAAGzwH,SAAaxJ,EAAE8zG,GAAGtuG,EAAED,EAAE0G,MAAMzG,IAAIxF,IAAIkxH,GAAEgJ,GAAG30H,GAAG2rH,GAAE+I,GAAGj6H,GAAG,CAAC,SAASy6H,GAAGl1H,GAAG20H,GAAG1wH,UAAUjE,IAAI0rH,GAAEgJ,IAAIhJ,GAAEiJ,IAAI,CAAC,IAAIQ,GAAE1J,GAAG,GACrJ,SAAS2J,GAAGp1H,GAAG,IAAI,IAAIC,EAAED,EAAE,OAAOC,GAAG,CAAC,GAAG,KAAKA,EAAE3D,IAAI,CAAC,IAAI7B,EAAEwF,EAAEi1G,cAAc,GAAG,OAAOz6G,IAAmB,QAAfA,EAAEA,EAAE06G,aAAqB,OAAO16G,EAAEuT,MAAM,OAAOvT,EAAEuT,MAAM,OAAO/N,CAAC,MAAM,GAAG,KAAKA,EAAE3D,UAAK,IAAS2D,EAAE+uH,cAAcqG,aAAa,GAAG,KAAa,IAARp1H,EAAE+0G,OAAW,OAAO/0G,OAAO,GAAG,OAAOA,EAAE8wC,MAAM,CAAC9wC,EAAE8wC,MAAMgkE,OAAO90G,EAAEA,EAAEA,EAAE8wC,MAAM,QAAQ,CAAC,GAAG9wC,IAAID,EAAE,MAAM,KAAK,OAAOC,EAAEq1G,SAAS,CAAC,GAAG,OAAOr1G,EAAE80G,QAAQ90G,EAAE80G,SAAS/0G,EAAE,OAAO,KAAKC,EAAEA,EAAE80G,MAAM,CAAC90G,EAAEq1G,QAAQP,OAAO90G,EAAE80G,OAAO90G,EAAEA,EAAEq1G,OAAO,CAAC,OAAO,IAAI,CAAC,IAAIggB,GAAG,GACrc,SAASC,KAAK,IAAI,IAAIv1H,EAAE,EAAEA,EAAEs1H,GAAGt7H,OAAOgG,IAAIs1H,GAAGt1H,GAAGw1H,8BAA8B,KAAKF,GAAGt7H,OAAO,CAAC,CAAC,IAAIy7H,GAAG1rB,EAAG2rB,uBAAuBC,GAAG5rB,EAAG0Q,wBAAwBmb,GAAG,EAAEC,GAAE,KAAKC,GAAE,KAAKC,GAAE,KAAKC,IAAG,EAAGC,IAAG,EAAGC,GAAG,EAAEC,GAAG,EAAE,SAASC,KAAI,MAAMlvH,MAAMG,EAAE,KAAM,CAAC,SAASgvH,GAAGr2H,EAAEC,GAAG,GAAG,OAAOA,EAAE,OAAM,EAAG,IAAI,IAAIxF,EAAE,EAAEA,EAAEwF,EAAEjG,QAAQS,EAAEuF,EAAEhG,OAAOS,IAAI,IAAIiqH,GAAG1kH,EAAEvF,GAAGwF,EAAExF,IAAI,OAAM,EAAG,OAAM,CAAE,CAChW,SAAS67H,GAAGt2H,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,GAAyH,GAAtHmlH,GAAGnlH,EAAEolH,GAAE51H,EAAEA,EAAEi1G,cAAc,KAAKj1G,EAAE6wH,YAAY,KAAK7wH,EAAEkwH,MAAM,EAAEsF,GAAGxxH,QAAQ,OAAOjE,GAAG,OAAOA,EAAEk1G,cAAcqhB,GAAGC,GAAGx2H,EAAEvF,EAAEM,EAAEyP,GAAMyrH,GAAG,CAACxlH,EAAE,EAAE,EAAE,CAAY,GAAXwlH,IAAG,EAAGC,GAAG,EAAK,IAAIzlH,EAAE,MAAMvJ,MAAMG,EAAE,MAAMoJ,GAAG,EAAEslH,GAAED,GAAE,KAAK71H,EAAE6wH,YAAY,KAAK2E,GAAGxxH,QAAQwyH,GAAGz2H,EAAEvF,EAAEM,EAAEyP,EAAE,OAAOyrH,GAAG,CAA+D,GAA9DR,GAAGxxH,QAAQyyH,GAAGz2H,EAAE,OAAO61H,IAAG,OAAOA,GAAE3lF,KAAKylF,GAAG,EAAEG,GAAED,GAAED,GAAE,KAAKG,IAAG,EAAM/1H,EAAE,MAAMiH,MAAMG,EAAE,MAAM,OAAOrH,CAAC,CAAC,SAAS22H,KAAK,IAAI32H,EAAE,IAAIk2H,GAAQ,OAALA,GAAG,EAASl2H,CAAC,CAC/Y,SAAS42H,KAAK,IAAI52H,EAAE,CAACk1G,cAAc,KAAK6b,UAAU,KAAK8F,UAAU,KAAKh/D,MAAM,KAAK1nB,KAAK,MAA8C,OAAxC,OAAO4lF,GAAEF,GAAE3gB,cAAc6gB,GAAE/1H,EAAE+1H,GAAEA,GAAE5lF,KAAKnwC,EAAS+1H,EAAC,CAAC,SAASe,KAAK,GAAG,OAAOhB,GAAE,CAAC,IAAI91H,EAAE61H,GAAE/gB,UAAU90G,EAAE,OAAOA,EAAEA,EAAEk1G,cAAc,IAAI,MAAMl1G,EAAE81H,GAAE3lF,KAAK,IAAIlwC,EAAE,OAAO81H,GAAEF,GAAE3gB,cAAc6gB,GAAE5lF,KAAK,GAAG,OAAOlwC,EAAE81H,GAAE91H,EAAE61H,GAAE91H,MAAM,CAAC,GAAG,OAAOA,EAAE,MAAMkH,MAAMG,EAAE,MAAUrH,EAAE,CAACk1G,eAAP4gB,GAAE91H,GAAqBk1G,cAAc6b,UAAU+E,GAAE/E,UAAU8F,UAAUf,GAAEe,UAAUh/D,MAAMi+D,GAAEj+D,MAAM1nB,KAAK,MAAM,OAAO4lF,GAAEF,GAAE3gB,cAAc6gB,GAAE/1H,EAAE+1H,GAAEA,GAAE5lF,KAAKnwC,CAAC,CAAC,OAAO+1H,EAAC,CACje,SAASgB,GAAG/2H,EAAEC,GAAG,MAAM,oBAAoBA,EAAEA,EAAED,GAAGC,CAAC,CACnD,SAAS+2H,GAAGh3H,GAAG,IAAIC,EAAE62H,KAAKr8H,EAAEwF,EAAE43D,MAAM,GAAG,OAAOp9D,EAAE,MAAMyM,MAAMG,EAAE,MAAM5M,EAAEw8H,oBAAoBj3H,EAAE,IAAIjF,EAAE+6H,GAAEtrH,EAAEzP,EAAE87H,UAAUpmH,EAAEhW,EAAE02H,QAAQ,GAAG,OAAO1gH,EAAE,CAAC,GAAG,OAAOjG,EAAE,CAAC,IAAIo+F,EAAEp+F,EAAE2lC,KAAK3lC,EAAE2lC,KAAK1/B,EAAE0/B,KAAK1/B,EAAE0/B,KAAKy4D,CAAC,CAAC7tG,EAAE87H,UAAUrsH,EAAEiG,EAAEhW,EAAE02H,QAAQ,IAAI,CAAC,GAAG,OAAO3mH,EAAE,CAACiG,EAAEjG,EAAE2lC,KAAKp1C,EAAEA,EAAEg2H,UAAU,IAAIv2F,EAAEouE,EAAE,KAAKv5F,EAAE,KAAKo8F,EAAEh7F,EAAE,EAAE,CAAC,IAAI6kB,EAAEm2E,EAAE+lB,KAAK,IAAIoE,GAAGtgG,KAAKA,EAAE,OAAOjmB,IAAIA,EAAEA,EAAE8gC,KAAK,CAACqhF,KAAK,EAAEvuH,OAAOwoG,EAAExoG,OAAOi0H,cAAczrB,EAAEyrB,cAAcC,WAAW1rB,EAAE0rB,WAAWhnF,KAAK,OAAOp1C,EAAE0wG,EAAEyrB,cAAczrB,EAAE0rB,WAAWn3H,EAAEjF,EAAE0wG,EAAExoG,YAAY,CAAC,IAAIi/B,EAAE,CAACsvF,KAAKl8F,EAAEryB,OAAOwoG,EAAExoG,OAAOi0H,cAAczrB,EAAEyrB,cACngBC,WAAW1rB,EAAE0rB,WAAWhnF,KAAK,MAAM,OAAO9gC,GAAGmrB,EAAEnrB,EAAE6yB,EAAE0mE,EAAE7tG,GAAGsU,EAAEA,EAAE8gC,KAAKjO,EAAE2zF,GAAE1F,OAAO76F,EAAEy8F,IAAIz8F,CAAC,CAACm2E,EAAEA,EAAEt7D,IAAI,OAAO,OAAOs7D,GAAGA,IAAIh7F,GAAG,OAAOpB,EAAEu5F,EAAE7tG,EAAEsU,EAAE8gC,KAAK3V,EAAEkqF,GAAG3pH,EAAEkF,EAAEi1G,iBAAiBkb,IAAG,GAAInwH,EAAEi1G,cAAcn6G,EAAEkF,EAAE8wH,UAAUnoB,EAAE3oG,EAAE42H,UAAUxnH,EAAE5U,EAAE28H,kBAAkBr8H,CAAC,CAAiB,GAAG,QAAnBiF,EAAEvF,EAAEi2H,aAAwB,CAAClmH,EAAExK,EAAE,GAAGyQ,EAAEjG,EAAEgnH,KAAKqE,GAAE1F,OAAO1/G,EAAEshH,IAAIthH,EAAEjG,EAAEA,EAAE2lC,WAAW3lC,IAAIxK,EAAE,MAAM,OAAOwK,IAAI/P,EAAE01H,MAAM,GAAG,MAAM,CAAClwH,EAAEi1G,cAAcz6G,EAAE0K,SAAS,CAC9X,SAASkyH,GAAGr3H,GAAG,IAAIC,EAAE62H,KAAKr8H,EAAEwF,EAAE43D,MAAM,GAAG,OAAOp9D,EAAE,MAAMyM,MAAMG,EAAE,MAAM5M,EAAEw8H,oBAAoBj3H,EAAE,IAAIjF,EAAEN,EAAE0K,SAASqF,EAAE/P,EAAE02H,QAAQ1gH,EAAExQ,EAAEi1G,cAAc,GAAG,OAAO1qG,EAAE,CAAC/P,EAAE02H,QAAQ,KAAK,IAAIvoB,EAAEp+F,EAAEA,EAAE2lC,KAAK,GAAG1/B,EAAEzQ,EAAEyQ,EAAEm4F,EAAE3lG,QAAQ2lG,EAAEA,EAAEz4D,WAAWy4D,IAAIp+F,GAAGk6G,GAAGj0G,EAAExQ,EAAEi1G,iBAAiBkb,IAAG,GAAInwH,EAAEi1G,cAAczkG,EAAE,OAAOxQ,EAAE42H,YAAY52H,EAAE8wH,UAAUtgH,GAAGhW,EAAE28H,kBAAkB3mH,CAAC,CAAC,MAAM,CAACA,EAAE1V,EAAE,CAAC,SAASu8H,KAAK,CACpW,SAASC,GAAGv3H,EAAEC,GAAG,IAAIxF,EAAEo7H,GAAE96H,EAAE+7H,KAAKtsH,EAAEvK,IAAIwQ,GAAGi0G,GAAG3pH,EAAEm6G,cAAc1qG,GAAsE,GAAnEiG,IAAI1V,EAAEm6G,cAAc1qG,EAAE4lH,IAAG,GAAIr1H,EAAEA,EAAE88D,MAAM2/D,GAAGC,GAAGzxG,KAAK,KAAKvrB,EAAEM,EAAEiF,GAAG,CAACA,IAAOjF,EAAE28H,cAAcz3H,GAAGwQ,GAAG,OAAOslH,IAAuB,EAApBA,GAAE7gB,cAAc54G,IAAM,CAAuD,GAAtD7B,EAAEu6G,OAAO,KAAK2iB,GAAG,EAAEC,GAAG5xG,KAAK,KAAKvrB,EAAEM,EAAEyP,EAAEvK,QAAG,EAAO,MAAS,OAAO43H,GAAE,MAAM3wH,MAAMG,EAAE,MAAM,KAAQ,GAAHuuH,KAAQkC,GAAGr9H,EAAEwF,EAAEuK,EAAE,CAAC,OAAOA,CAAC,CAAC,SAASstH,GAAG93H,EAAEC,EAAExF,GAAGuF,EAAEg1G,OAAO,MAAMh1G,EAAE,CAAC03H,YAAYz3H,EAAEwG,MAAMhM,GAAmB,QAAhBwF,EAAE41H,GAAE/E,cAAsB7wH,EAAE,CAAC83H,WAAW,KAAKC,OAAO,MAAMnC,GAAE/E,YAAY7wH,EAAEA,EAAE+3H,OAAO,CAACh4H,IAAgB,QAAXvF,EAAEwF,EAAE+3H,QAAgB/3H,EAAE+3H,OAAO,CAACh4H,GAAGvF,EAAEkE,KAAKqB,EAAG,CAClf,SAAS43H,GAAG53H,EAAEC,EAAExF,EAAEM,GAAGkF,EAAEwG,MAAMhM,EAAEwF,EAAEy3H,YAAY38H,EAAEk9H,GAAGh4H,IAAIi4H,GAAGl4H,EAAE,CAAC,SAASy3H,GAAGz3H,EAAEC,EAAExF,GAAG,OAAOA,GAAE,WAAWw9H,GAAGh4H,IAAIi4H,GAAGl4H,EAAE,GAAE,CAAC,SAASi4H,GAAGj4H,GAAG,IAAIC,EAAED,EAAE03H,YAAY13H,EAAEA,EAAEyG,MAAM,IAAI,IAAIhM,EAAEwF,IAAI,OAAOykH,GAAG1kH,EAAEvF,EAAE,CAAC,MAAMM,GAAG,OAAM,CAAE,CAAC,CAAC,SAASm9H,GAAGl4H,GAAG,IAAIC,EAAE0wH,GAAG3wH,EAAE,GAAG,OAAOC,GAAGyyH,GAAGzyH,EAAED,EAAE,GAAG,EAAE,CAClQ,SAASm4H,GAAGn4H,GAAG,IAAIC,EAAE22H,KAA8M,MAAzM,oBAAoB52H,IAAIA,EAAEA,KAAKC,EAAEi1G,cAAcj1G,EAAE8wH,UAAU/wH,EAAEA,EAAE,CAACmxH,QAAQ,KAAKT,YAAY,KAAKP,MAAM,EAAEhrH,SAAS,KAAK8xH,oBAAoBF,GAAGK,kBAAkBp3H,GAAGC,EAAE43D,MAAM73D,EAAEA,EAAEA,EAAEmF,SAASizH,GAAGpyG,KAAK,KAAK6vG,GAAE71H,GAAS,CAACC,EAAEi1G,cAAcl1G,EAAE,CAC5P,SAAS23H,GAAG33H,EAAEC,EAAExF,EAAEM,GAA8O,OAA3OiF,EAAE,CAAC1D,IAAI0D,EAAE0N,OAAOzN,EAAEo4H,QAAQ59H,EAAE69H,KAAKv9H,EAAEo1C,KAAK,MAAsB,QAAhBlwC,EAAE41H,GAAE/E,cAAsB7wH,EAAE,CAAC83H,WAAW,KAAKC,OAAO,MAAMnC,GAAE/E,YAAY7wH,EAAEA,EAAE83H,WAAW/3H,EAAEmwC,KAAKnwC,GAAmB,QAAfvF,EAAEwF,EAAE83H,YAAoB93H,EAAE83H,WAAW/3H,EAAEmwC,KAAKnwC,GAAGjF,EAAEN,EAAE01C,KAAK11C,EAAE01C,KAAKnwC,EAAEA,EAAEmwC,KAAKp1C,EAAEkF,EAAE83H,WAAW/3H,GAAWA,CAAC,CAAC,SAASu4H,KAAK,OAAOzB,KAAK5hB,aAAa,CAAC,SAASsjB,GAAGx4H,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAEosH,KAAKf,GAAE7gB,OAAOh1G,EAAEwK,EAAE0qG,cAAcyiB,GAAG,EAAE13H,EAAExF,OAAE,OAAO,IAASM,EAAE,KAAKA,EAAE,CAC9Y,SAAS09H,GAAGz4H,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAEssH,KAAK/7H,OAAE,IAASA,EAAE,KAAKA,EAAE,IAAI0V,OAAE,EAAO,GAAG,OAAOqlH,GAAE,CAAC,IAAIltB,EAAEktB,GAAE5gB,cAA0B,GAAZzkG,EAAEm4F,EAAEyvB,QAAW,OAAOt9H,GAAGs7H,GAAGt7H,EAAE6tG,EAAE0vB,MAAmC,YAA5B9tH,EAAE0qG,cAAcyiB,GAAG13H,EAAExF,EAAEgW,EAAE1V,GAAU,CAAC86H,GAAE7gB,OAAOh1G,EAAEwK,EAAE0qG,cAAcyiB,GAAG,EAAE13H,EAAExF,EAAEgW,EAAE1V,EAAE,CAAC,SAAS29H,GAAG14H,EAAEC,GAAG,OAAOu4H,GAAG,QAAQ,EAAEx4H,EAAEC,EAAE,CAAC,SAASu3H,GAAGx3H,EAAEC,GAAG,OAAOw4H,GAAG,KAAK,EAAEz4H,EAAEC,EAAE,CAAC,SAAS04H,GAAG34H,EAAEC,GAAG,OAAOw4H,GAAG,EAAE,EAAEz4H,EAAEC,EAAE,CAAC,SAAS24H,GAAG54H,EAAEC,GAAG,OAAOw4H,GAAG,EAAE,EAAEz4H,EAAEC,EAAE,CAChX,SAAS44H,GAAG74H,EAAEC,GAAG,MAAG,oBAAoBA,GAASD,EAAEA,IAAIC,EAAED,GAAG,WAAWC,EAAE,KAAK,GAAK,OAAOA,QAAG,IAASA,GAASD,EAAEA,IAAIC,EAAEgE,QAAQjE,EAAE,WAAWC,EAAEgE,QAAQ,IAAI,QAA1E,CAA2E,CAAC,SAAS60H,GAAG94H,EAAEC,EAAExF,GAA6C,OAA1CA,EAAE,OAAOA,QAAG,IAASA,EAAEA,EAAEsvD,OAAO,CAAC/pD,IAAI,KAAYy4H,GAAG,EAAE,EAAEI,GAAG7yG,KAAK,KAAK/lB,EAAED,GAAGvF,EAAE,CAAC,SAASs+H,KAAK,CAAC,SAASC,GAAGh5H,EAAEC,GAAG,IAAIxF,EAAEq8H,KAAK72H,OAAE,IAASA,EAAE,KAAKA,EAAE,IAAIlF,EAAEN,EAAEy6G,cAAc,OAAG,OAAOn6G,GAAG,OAAOkF,GAAGo2H,GAAGp2H,EAAElF,EAAE,IAAWA,EAAE,IAAGN,EAAEy6G,cAAc,CAACl1G,EAAEC,GAAUD,EAAC,CAC7Z,SAASi5H,GAAGj5H,EAAEC,GAAG,IAAIxF,EAAEq8H,KAAK72H,OAAE,IAASA,EAAE,KAAKA,EAAE,IAAIlF,EAAEN,EAAEy6G,cAAc,OAAG,OAAOn6G,GAAG,OAAOkF,GAAGo2H,GAAGp2H,EAAElF,EAAE,IAAWA,EAAE,IAAGiF,EAAEA,IAAIvF,EAAEy6G,cAAc,CAACl1G,EAAEC,GAAUD,EAAC,CAAC,SAASk5H,GAAGl5H,EAAEC,EAAExF,GAAG,OAAG,KAAQ,GAAHm7H,KAAc51H,EAAE+wH,YAAY/wH,EAAE+wH,WAAU,EAAGX,IAAG,GAAIpwH,EAAEk1G,cAAcz6G,IAAEiqH,GAAGjqH,EAAEwF,KAAKxF,EAAEu9G,KAAK6d,GAAE1F,OAAO11H,EAAEs3H,IAAIt3H,EAAEuF,EAAE+wH,WAAU,GAAW9wH,EAAC,CAAC,SAASk5H,GAAGn5H,EAAEC,GAAG,IAAIxF,EAAE49G,GAAEA,GAAE,IAAI59G,GAAG,EAAEA,EAAEA,EAAE,EAAEuF,GAAE,GAAI,IAAIjF,EAAE46H,GAAG/a,WAAW+a,GAAG/a,WAAW,CAAC,EAAE,IAAI56G,GAAE,GAAIC,GAAG,CAAC,QAAQo4G,GAAE59G,EAAEk7H,GAAG/a,WAAW7/G,CAAC,CAAC,CAAC,SAASq+H,KAAK,OAAOtC,KAAK5hB,aAAa,CAC1d,SAASmkB,GAAGr5H,EAAEC,EAAExF,GAAG,IAAIM,EAAE03H,GAAGzyH,GAAkE,GAA/DvF,EAAE,CAAC+2H,KAAKz2H,EAAEkI,OAAOxI,EAAEy8H,eAAc,EAAGC,WAAW,KAAKhnF,KAAK,MAASmpF,GAAGt5H,GAAGu5H,GAAGt5H,EAAExF,QAAQ,GAAiB,QAAdA,EAAEg2H,GAAGzwH,EAAEC,EAAExF,EAAEM,IAAY,CAAW23H,GAAGj4H,EAAEuF,EAAEjF,EAAXy3H,MAAgBgH,GAAG/+H,EAAEwF,EAAElF,EAAE,CAAC,CAC/K,SAASq9H,GAAGp4H,EAAEC,EAAExF,GAAG,IAAIM,EAAE03H,GAAGzyH,GAAGwK,EAAE,CAACgnH,KAAKz2H,EAAEkI,OAAOxI,EAAEy8H,eAAc,EAAGC,WAAW,KAAKhnF,KAAK,MAAM,GAAGmpF,GAAGt5H,GAAGu5H,GAAGt5H,EAAEuK,OAAO,CAAC,IAAIiG,EAAEzQ,EAAE80G,UAAU,GAAG,IAAI90G,EAAEmwH,QAAQ,OAAO1/G,GAAG,IAAIA,EAAE0/G,QAAiC,QAAxB1/G,EAAExQ,EAAEg3H,qBAA8B,IAAI,IAAIruB,EAAE3oG,EAAEm3H,kBAAkB58F,EAAE/pB,EAAEm4F,EAAEnuG,GAAqC,GAAlC+P,EAAE0sH,eAAc,EAAG1sH,EAAE2sH,WAAW38F,EAAKkqF,GAAGlqF,EAAEouE,GAAG,CAAC,IAAIv5F,EAAEpP,EAAEywH,YAA+E,OAAnE,OAAOrhH,GAAG7E,EAAE2lC,KAAK3lC,EAAEgmH,GAAGvwH,KAAKuK,EAAE2lC,KAAK9gC,EAAE8gC,KAAK9gC,EAAE8gC,KAAK3lC,QAAGvK,EAAEywH,YAAYlmH,EAAQ,CAAC,CAAC,MAAMihG,GAAG,CAAwB,QAAdhxG,EAAEg2H,GAAGzwH,EAAEC,EAAEuK,EAAEzP,MAAoB23H,GAAGj4H,EAAEuF,EAAEjF,EAAbyP,EAAEgoH,MAAgBgH,GAAG/+H,EAAEwF,EAAElF,GAAG,CAAC,CAC/c,SAASu+H,GAAGt5H,GAAG,IAAIC,EAAED,EAAE80G,UAAU,OAAO90G,IAAI61H,IAAG,OAAO51H,GAAGA,IAAI41H,EAAC,CAAC,SAAS0D,GAAGv5H,EAAEC,GAAGg2H,GAAGD,IAAG,EAAG,IAAIv7H,EAAEuF,EAAEmxH,QAAQ,OAAO12H,EAAEwF,EAAEkwC,KAAKlwC,GAAGA,EAAEkwC,KAAK11C,EAAE01C,KAAK11C,EAAE01C,KAAKlwC,GAAGD,EAAEmxH,QAAQlxH,CAAC,CAAC,SAASu5H,GAAGx5H,EAAEC,EAAExF,GAAG,GAAG,KAAO,QAAFA,GAAW,CAAC,IAAIM,EAAEkF,EAAEkwH,MAAwB11H,GAAlBM,GAAGiF,EAAEy3G,aAAkBx3G,EAAEkwH,MAAM11H,EAAE29G,GAAGp4G,EAAEvF,EAAE,CAAC,CAC9P,IAAIi8H,GAAG,CAAC+C,YAAYpJ,GAAGqJ,YAAYtD,GAAEuD,WAAWvD,GAAEwD,UAAUxD,GAAEyD,oBAAoBzD,GAAE0D,mBAAmB1D,GAAE2D,gBAAgB3D,GAAE4D,QAAQ5D,GAAE6D,WAAW7D,GAAE8D,OAAO9D,GAAE+D,SAAS/D,GAAEgE,cAAchE,GAAEiE,iBAAiBjE,GAAEkE,cAAclE,GAAEmE,iBAAiBnE,GAAEoE,qBAAqBpE,GAAEqE,MAAMrE,GAAEsE,0BAAyB,GAAInE,GAAG,CAACkD,YAAYpJ,GAAGqJ,YAAY,SAAS15H,EAAEC,GAA4C,OAAzC22H,KAAK1hB,cAAc,CAACl1G,OAAE,IAASC,EAAE,KAAKA,GAAUD,CAAC,EAAE25H,WAAWtJ,GAAGuJ,UAAUlB,GAAGmB,oBAAoB,SAAS75H,EAAEC,EAAExF,GAA6C,OAA1CA,EAAE,OAAOA,QAAG,IAASA,EAAEA,EAAEsvD,OAAO,CAAC/pD,IAAI,KAAYw4H,GAAG,QAC3f,EAAEK,GAAG7yG,KAAK,KAAK/lB,EAAED,GAAGvF,EAAE,EAAEs/H,gBAAgB,SAAS/5H,EAAEC,GAAG,OAAOu4H,GAAG,QAAQ,EAAEx4H,EAAEC,EAAE,EAAE65H,mBAAmB,SAAS95H,EAAEC,GAAG,OAAOu4H,GAAG,EAAE,EAAEx4H,EAAEC,EAAE,EAAE+5H,QAAQ,SAASh6H,EAAEC,GAAG,IAAIxF,EAAEm8H,KAAqD,OAAhD32H,OAAE,IAASA,EAAE,KAAKA,EAAED,EAAEA,IAAIvF,EAAEy6G,cAAc,CAACl1G,EAAEC,GAAUD,CAAC,EAAEi6H,WAAW,SAASj6H,EAAEC,EAAExF,GAAG,IAAIM,EAAE67H,KAAkM,OAA7L32H,OAAE,IAASxF,EAAEA,EAAEwF,GAAGA,EAAElF,EAAEm6G,cAAcn6G,EAAEg2H,UAAU9wH,EAAED,EAAE,CAACmxH,QAAQ,KAAKT,YAAY,KAAKP,MAAM,EAAEhrH,SAAS,KAAK8xH,oBAAoBj3H,EAAEo3H,kBAAkBn3H,GAAGlF,EAAE88D,MAAM73D,EAAEA,EAAEA,EAAEmF,SAASk0H,GAAGrzG,KAAK,KAAK6vG,GAAE71H,GAAS,CAACjF,EAAEm6G,cAAcl1G,EAAE,EAAEk6H,OAAO,SAASl6H,GAC3d,OAAdA,EAAE,CAACiE,QAAQjE,GAAhB42H,KAA4B1hB,cAAcl1G,CAAC,EAAEm6H,SAAShC,GAAGiC,cAAcrB,GAAGsB,iBAAiB,SAASr6H,GAAG,OAAO42H,KAAK1hB,cAAcl1G,CAAC,EAAEs6H,cAAc,WAAW,IAAIt6H,EAAEm4H,IAAG,GAAIl4H,EAAED,EAAE,GAA6C,OAA1CA,EAAEm5H,GAAGnzG,KAAK,KAAKhmB,EAAE,IAAI42H,KAAK1hB,cAAcl1G,EAAQ,CAACC,EAAED,EAAE,EAAEu6H,iBAAiB,WAAW,EAAEC,qBAAqB,SAASx6H,EAAEC,EAAExF,GAAG,IAAIM,EAAE86H,GAAErrH,EAAEosH,KAAK,GAAG3I,GAAE,CAAC,QAAG,IAASxzH,EAAE,MAAMyM,MAAMG,EAAE,MAAM5M,EAAEA,GAAG,KAAK,CAAO,GAANA,EAAEwF,IAAO,OAAO43H,GAAE,MAAM3wH,MAAMG,EAAE,MAAM,KAAQ,GAAHuuH,KAAQkC,GAAG/8H,EAAEkF,EAAExF,EAAE,CAAC+P,EAAE0qG,cAAcz6G,EAAE,IAAIgW,EAAE,CAAChK,MAAMhM,EAAEi9H,YAAYz3H,GACvZ,OAD0ZuK,EAAEqtD,MAAMpnD,EAAEioH,GAAGjB,GAAGzxG,KAAK,KAAKjrB,EACpf0V,EAAEzQ,GAAG,CAACA,IAAIjF,EAAEi6G,OAAO,KAAK2iB,GAAG,EAAEC,GAAG5xG,KAAK,KAAKjrB,EAAE0V,EAAEhW,EAAEwF,QAAG,EAAO,MAAaxF,CAAC,EAAEggI,MAAM,WAAW,IAAIz6H,EAAE42H,KAAK32H,EAAE43H,GAAE8C,iBAAiB,GAAG1M,GAAE,CAAC,IAAIxzH,EAAEizH,GAAkDztH,EAAE,IAAIA,EAAE,KAA9CxF,GAAHgzH,KAAU,GAAG,GAAGxW,GAAhBwW,IAAsB,IAAI/oG,SAAS,IAAIjqB,GAAuB,GAAPA,EAAEy7H,QAAWj2H,GAAG,IAAIxF,EAAEiqB,SAAS,KAAKzkB,GAAG,GAAG,MAAaA,EAAE,IAAIA,EAAE,KAAfxF,EAAE07H,MAAmBzxG,SAAS,IAAI,IAAI,OAAO1kB,EAAEk1G,cAAcj1G,CAAC,EAAEy6H,0BAAyB,GAAIlE,GAAG,CAACiD,YAAYpJ,GAAGqJ,YAAYV,GAAGW,WAAWtJ,GAAGuJ,UAAUpC,GAAGqC,oBAAoBf,GAAGgB,mBAAmBnB,GAAGoB,gBAAgBnB,GAAGoB,QAAQf,GAAGgB,WAAWjD,GAAGkD,OAAO3B,GAAG4B,SAAS,WAAW,OAAOnD,GAAGD,GAAG,EACrhBqD,cAAcrB,GAAGsB,iBAAiB,SAASr6H,GAAc,OAAOk5H,GAAZpC,KAAiBhB,GAAE5gB,cAAcl1G,EAAE,EAAEs6H,cAAc,WAAgD,MAAM,CAArCtD,GAAGD,IAAI,GAAKD,KAAK5hB,cAAyB,EAAEqlB,iBAAiBjD,GAAGkD,qBAAqBjD,GAAGkD,MAAMrB,GAAGsB,0BAAyB,GAAIjE,GAAG,CAACgD,YAAYpJ,GAAGqJ,YAAYV,GAAGW,WAAWtJ,GAAGuJ,UAAUpC,GAAGqC,oBAAoBf,GAAGgB,mBAAmBnB,GAAGoB,gBAAgBnB,GAAGoB,QAAQf,GAAGgB,WAAW5C,GAAG6C,OAAO3B,GAAG4B,SAAS,WAAW,OAAO9C,GAAGN,GAAG,EAAEqD,cAAcrB,GAAGsB,iBAAiB,SAASr6H,GAAG,IAAIC,EAAE62H,KAAK,OAAO,OACzfhB,GAAE71H,EAAEi1G,cAAcl1G,EAAEk5H,GAAGj5H,EAAE61H,GAAE5gB,cAAcl1G,EAAE,EAAEs6H,cAAc,WAAgD,MAAM,CAArCjD,GAAGN,IAAI,GAAKD,KAAK5hB,cAAyB,EAAEqlB,iBAAiBjD,GAAGkD,qBAAqBjD,GAAGkD,MAAMrB,GAAGsB,0BAAyB,GAAI,SAASE,GAAG56H,EAAEC,GAAG,IAAI,IAAIxF,EAAE,GAAGM,EAAEkF,EAAE,GAAGxF,GAAGkxG,EAAG5wG,GAAGA,EAAEA,EAAEg6G,aAAah6G,GAAG,IAAIyP,EAAE/P,CAAC,CAAC,MAAMgW,GAAGjG,EAAE,6BAA6BiG,EAAEzJ,QAAQ,KAAKyJ,EAAEoY,KAAK,CAAC,MAAM,CAACpiB,MAAMzG,EAAE6K,OAAO5K,EAAE4oB,MAAMre,EAAEsG,OAAO,KAAK,CAAC,SAAS+pH,GAAG76H,EAAEC,EAAExF,GAAG,MAAM,CAACgM,MAAMzG,EAAE6K,OAAO,KAAKge,MAAM,MAAMpuB,EAAEA,EAAE,KAAKqW,OAAO,MAAM7Q,EAAEA,EAAE,KAAK,CACzd,SAAS66H,GAAG96H,EAAEC,GAAG,IAAIjD,QAAQyN,MAAMxK,EAAEwG,MAAM,CAAC,MAAMhM,GAAGmH,YAAW,WAAW,MAAMnH,CAAE,GAAE,CAAC,CAAC,IAAIsgI,GAAG,oBAAoB3iH,QAAQA,QAAQ5F,IAAI,SAASwoH,GAAGh7H,EAAEC,EAAExF,IAAGA,EAAE62H,IAAI,EAAE72H,IAAK6B,IAAI,EAAE7B,EAAEyI,QAAQ,CAACmjH,QAAQ,MAAM,IAAItrH,EAAEkF,EAAEwG,MAAsD,OAAhDhM,EAAEiH,SAAS,WAAWu5H,KAAKA,IAAG,EAAGC,GAAGngI,GAAG+/H,GAAG96H,EAAEC,EAAE,EAASxF,CAAC,CAC3Q,SAAS0gI,GAAGn7H,EAAEC,EAAExF,IAAGA,EAAE62H,IAAI,EAAE72H,IAAK6B,IAAI,EAAE,IAAIvB,EAAEiF,EAAE0G,KAAK00H,yBAAyB,GAAG,oBAAoBrgI,EAAE,CAAC,IAAIyP,EAAEvK,EAAEwG,MAAMhM,EAAEyI,QAAQ,WAAW,OAAOnI,EAAEyP,EAAE,EAAE/P,EAAEiH,SAAS,WAAWo5H,GAAG96H,EAAEC,EAAE,CAAC,CAAC,IAAIwQ,EAAEzQ,EAAE0zG,UAA8O,OAApO,OAAOjjG,GAAG,oBAAoBA,EAAE4qH,oBAAoB5gI,EAAEiH,SAAS,WAAWo5H,GAAG96H,EAAEC,GAAG,oBAAoBlF,IAAI,OAAOugI,GAAGA,GAAG,IAAIzmH,IAAI,CAAC/M,OAAOwzH,GAAGxmH,IAAIhN,OAAO,IAAIrN,EAAEwF,EAAE4oB,MAAM/gB,KAAKuzH,kBAAkBp7H,EAAEwG,MAAM,CAAC80H,eAAe,OAAO9gI,EAAEA,EAAE,IAAI,GAAUA,CAAC,CACnb,SAAS+gI,GAAGx7H,EAAEC,EAAExF,GAAG,IAAIM,EAAEiF,EAAEy7H,UAAU,GAAG,OAAO1gI,EAAE,CAACA,EAAEiF,EAAEy7H,UAAU,IAAIV,GAAG,IAAIvwH,EAAE,IAAIqK,IAAI9Z,EAAEkY,IAAIhT,EAAEuK,EAAE,WAAiB,KAAXA,EAAEzP,EAAEiB,IAAIiE,MAAgBuK,EAAE,IAAIqK,IAAI9Z,EAAEkY,IAAIhT,EAAEuK,IAAIA,EAAEuI,IAAItY,KAAK+P,EAAEsK,IAAIra,GAAGuF,EAAE07H,GAAG11G,KAAK,KAAKhmB,EAAEC,EAAExF,GAAGwF,EAAE4a,KAAK7a,EAAEA,GAAG,CAAC,SAAS27H,GAAG37H,GAAG,EAAE,CAAC,IAAIC,EAA4E,IAAvEA,EAAE,KAAKD,EAAE1D,OAAsB2D,EAAE,QAApBA,EAAED,EAAEk1G,gBAAyB,OAAOj1G,EAAEk1G,YAAuBl1G,EAAE,OAAOD,EAAEA,EAAEA,EAAE+0G,MAAM,OAAO,OAAO/0G,GAAG,OAAO,IAAI,CAChW,SAAS47H,GAAG57H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,OAAG,KAAY,EAAPxK,EAAE8R,OAAe9R,IAAIC,EAAED,EAAEg1G,OAAO,OAAOh1G,EAAEg1G,OAAO,IAAIv6G,EAAEu6G,OAAO,OAAOv6G,EAAEu6G,QAAQ,MAAM,IAAIv6G,EAAE6B,MAAM,OAAO7B,EAAEq6G,UAAUr6G,EAAE6B,IAAI,KAAI2D,EAAEqxH,IAAI,EAAE,IAAKh1H,IAAI,EAAEm1H,GAAGh3H,EAAEwF,EAAE,KAAKxF,EAAE01H,OAAO,GAAGnwH,IAAEA,EAAEg1G,OAAO,MAAMh1G,EAAEmwH,MAAM3lH,EAASxK,EAAC,CAAC,IAAI67H,GAAG9xB,EAAG+xB,kBAAkB1L,IAAG,EAAG,SAAS2L,GAAG/7H,EAAEC,EAAExF,EAAEM,GAAGkF,EAAE8wC,MAAM,OAAO/wC,EAAEw0H,GAAGv0H,EAAE,KAAKxF,EAAEM,GAAGw5H,GAAGt0H,EAAED,EAAE+wC,MAAMt2C,EAAEM,EAAE,CACnV,SAASihI,GAAGh8H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG/P,EAAEA,EAAEmxG,OAAO,IAAIn7F,EAAExQ,EAAEw7D,IAAqC,OAAjCu0D,GAAG/vH,EAAEuK,GAAGzP,EAAEu7H,GAAGt2H,EAAEC,EAAExF,EAAEM,EAAE0V,EAAEjG,GAAG/P,EAAEk8H,KAAQ,OAAO32H,GAAIowH,IAA2EnC,IAAGxzH,GAAGozH,GAAG5tH,GAAGA,EAAE+0G,OAAO,EAAE+mB,GAAG/7H,EAAEC,EAAElF,EAAEyP,GAAUvK,EAAE8wC,QAA7G9wC,EAAE6wH,YAAY9wH,EAAE8wH,YAAY7wH,EAAE+0G,QAAQ,KAAKh1G,EAAEmwH,QAAQ3lH,EAAEyxH,GAAGj8H,EAAEC,EAAEuK,GAAoD,CACzN,SAAS0xH,GAAGl8H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,GAAG,OAAOxK,EAAE,CAAC,IAAIyQ,EAAEhW,EAAEiM,KAAK,MAAG,oBAAoB+J,GAAI0rH,GAAG1rH,SAAI,IAASA,EAAE6+G,cAAc,OAAO70H,EAAEqsC,cAAS,IAASrsC,EAAE60H,eAAoDtvH,EAAEm0H,GAAG15H,EAAEiM,KAAK,KAAK3L,EAAEkF,EAAEA,EAAE6R,KAAKtH,IAAKixD,IAAIx7D,EAAEw7D,IAAIz7D,EAAE+0G,OAAO90G,EAASA,EAAE8wC,MAAM/wC,IAArGC,EAAE3D,IAAI,GAAG2D,EAAEyG,KAAK+J,EAAE2rH,GAAGp8H,EAAEC,EAAEwQ,EAAE1V,EAAEyP,GAAyE,CAAW,GAAViG,EAAEzQ,EAAE+wC,MAAS,KAAK/wC,EAAEmwH,MAAM3lH,GAAG,CAAC,IAAIo+F,EAAEn4F,EAAEu+G,cAA0C,IAAhBv0H,EAAE,QAAdA,EAAEA,EAAEqsC,SAAmBrsC,EAAEkqH,IAAQ/b,EAAE7tG,IAAIiF,EAAEy7D,MAAMx7D,EAAEw7D,IAAI,OAAOwgE,GAAGj8H,EAAEC,EAAEuK,EAAE,CAA6C,OAA5CvK,EAAE+0G,OAAO,GAAEh1G,EAAEi0H,GAAGxjH,EAAE1V,IAAK0gE,IAAIx7D,EAAEw7D,IAAIz7D,EAAE+0G,OAAO90G,EAASA,EAAE8wC,MAAM/wC,CAAC,CAC1b,SAASo8H,GAAGp8H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,GAAG,OAAOxK,EAAE,CAAC,IAAIyQ,EAAEzQ,EAAEgvH,cAAc,GAAGrK,GAAGl0G,EAAE1V,IAAIiF,EAAEy7D,MAAMx7D,EAAEw7D,IAAI,IAAG20D,IAAG,EAAGnwH,EAAEuuH,aAAazzH,EAAE0V,EAAE,KAAKzQ,EAAEmwH,MAAM3lH,GAAsC,OAAOvK,EAAEkwH,MAAMnwH,EAAEmwH,MAAM8L,GAAGj8H,EAAEC,EAAEuK,GAAjE,KAAa,OAARxK,EAAEg1G,SAAgBob,IAAG,EAAyC,EAAC,OAAOiM,GAAGr8H,EAAEC,EAAExF,EAAEM,EAAEyP,EAAE,CACxN,SAAS8xH,GAAGt8H,EAAEC,EAAExF,GAAG,IAAIM,EAAEkF,EAAEuuH,aAAahkH,EAAEzP,EAAE+3C,SAASriC,EAAE,OAAOzQ,EAAEA,EAAEk1G,cAAc,KAAK,GAAG,WAAWn6G,EAAE+W,KAAK,GAAG,KAAY,EAAP7R,EAAE6R,MAAQ7R,EAAEi1G,cAAc,CAACqnB,UAAU,EAAEC,UAAU,KAAKC,YAAY,MAAM9Q,GAAE+Q,GAAGC,IAAIA,IAAIliI,MAAM,CAAC,GAAG,KAAO,WAAFA,GAAc,OAAOuF,EAAE,OAAOyQ,EAAEA,EAAE8rH,UAAU9hI,EAAEA,EAAEwF,EAAEkwH,MAAMlwH,EAAE8vH,WAAW,WAAW9vH,EAAEi1G,cAAc,CAACqnB,UAAUv8H,EAAEw8H,UAAU,KAAKC,YAAY,MAAMx8H,EAAE6wH,YAAY,KAAKnF,GAAE+Q,GAAGC,IAAIA,IAAI38H,EAAE,KAAKC,EAAEi1G,cAAc,CAACqnB,UAAU,EAAEC,UAAU,KAAKC,YAAY,MAAM1hI,EAAE,OAAO0V,EAAEA,EAAE8rH,UAAU9hI,EAAEkxH,GAAE+Q,GAAGC,IAAIA,IAAI5hI,CAAC,MAAM,OACtf0V,GAAG1V,EAAE0V,EAAE8rH,UAAU9hI,EAAEwF,EAAEi1G,cAAc,MAAMn6G,EAAEN,EAAEkxH,GAAE+Q,GAAGC,IAAIA,IAAI5hI,EAAc,OAAZghI,GAAG/7H,EAAEC,EAAEuK,EAAE/P,GAAUwF,EAAE8wC,KAAK,CAAC,SAAS6rF,GAAG58H,EAAEC,GAAG,IAAIxF,EAAEwF,EAAEw7D,KAAO,OAAOz7D,GAAG,OAAOvF,GAAG,OAAOuF,GAAGA,EAAEy7D,MAAMhhE,KAAEwF,EAAE+0G,OAAO,IAAI/0G,EAAE+0G,OAAO,QAAO,CAAC,SAASqnB,GAAGr8H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,IAAIiG,EAAE27G,GAAG3xH,GAAGsxH,GAAGF,GAAE5nH,QAAmD,OAA3CwM,EAAEu7G,GAAG/rH,EAAEwQ,GAAGu/G,GAAG/vH,EAAEuK,GAAG/P,EAAE67H,GAAGt2H,EAAEC,EAAExF,EAAEM,EAAE0V,EAAEjG,GAAGzP,EAAE47H,KAAQ,OAAO32H,GAAIowH,IAA2EnC,IAAGlzH,GAAG8yH,GAAG5tH,GAAGA,EAAE+0G,OAAO,EAAE+mB,GAAG/7H,EAAEC,EAAExF,EAAE+P,GAAUvK,EAAE8wC,QAA7G9wC,EAAE6wH,YAAY9wH,EAAE8wH,YAAY7wH,EAAE+0G,QAAQ,KAAKh1G,EAAEmwH,QAAQ3lH,EAAEyxH,GAAGj8H,EAAEC,EAAEuK,GAAoD,CACla,SAASqyH,GAAG78H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,GAAG4hH,GAAG3xH,GAAG,CAAC,IAAIgW,GAAE,EAAGi8G,GAAGzsH,EAAE,MAAMwQ,GAAE,EAAW,GAARu/G,GAAG/vH,EAAEuK,GAAM,OAAOvK,EAAEyzG,UAAUopB,GAAG98H,EAAEC,GAAG+yH,GAAG/yH,EAAExF,EAAEM,GAAGs4H,GAAGpzH,EAAExF,EAAEM,EAAEyP,GAAGzP,GAAE,OAAQ,GAAG,OAAOiF,EAAE,CAAC,IAAI4oG,EAAE3oG,EAAEyzG,UAAUl5E,EAAEv6B,EAAE+uH,cAAcpmB,EAAE32F,MAAMuoB,EAAE,IAAInrB,EAAEu5F,EAAErsE,QAAQkvE,EAAEhxG,EAAEw4H,YAAY,kBAAkBxnB,GAAG,OAAOA,EAAEA,EAAE4kB,GAAG5kB,GAAyBA,EAAEugB,GAAG/rH,EAA1BwrG,EAAE2gB,GAAG3xH,GAAGsxH,GAAGF,GAAE5nH,SAAmB,IAAIqxB,EAAE76B,EAAE64H,yBAAyBpxF,EAAE,oBAAoB5M,GAAG,oBAAoBszE,EAAE2qB,wBAAwBrxF,GAAG,oBAAoB0mE,EAAEwqB,kCAAkC,oBAAoBxqB,EAAEuqB,4BAC1d34F,IAAIz/B,GAAGsU,IAAIo8F,IAAIynB,GAAGjzH,EAAE2oG,EAAE7tG,EAAE0wG,GAAGmlB,IAAG,EAAG,IAAI9uF,EAAE7hC,EAAEi1G,cAActM,EAAE5lG,MAAM8+B,EAAE+vF,GAAG5xH,EAAElF,EAAE6tG,EAAEp+F,GAAG6E,EAAEpP,EAAEi1G,cAAc16E,IAAIz/B,GAAG+mC,IAAIzyB,GAAGy8G,GAAG7nH,SAAS2sH,IAAI,oBAAoBt7F,IAAI68F,GAAGlyH,EAAExF,EAAE66B,EAAEv6B,GAAGsU,EAAEpP,EAAEi1G,gBAAgB16E,EAAEo2F,IAAIiC,GAAG5yH,EAAExF,EAAE+/B,EAAEz/B,EAAE+mC,EAAEzyB,EAAEo8F,KAAKvpE,GAAG,oBAAoB0mE,EAAE4qB,2BAA2B,oBAAoB5qB,EAAE6qB,qBAAqB,oBAAoB7qB,EAAE6qB,oBAAoB7qB,EAAE6qB,qBAAqB,oBAAoB7qB,EAAE4qB,2BAA2B5qB,EAAE4qB,6BAA6B,oBAAoB5qB,EAAE8qB,oBAAoBzzH,EAAE+0G,OAAO,WAClf,oBAAoBpM,EAAE8qB,oBAAoBzzH,EAAE+0G,OAAO,SAAS/0G,EAAE+uH,cAAcj0H,EAAEkF,EAAEi1G,cAAc7lG,GAAGu5F,EAAE32F,MAAMlX,EAAE6tG,EAAE5lG,MAAMqM,EAAEu5F,EAAErsE,QAAQkvE,EAAE1wG,EAAEy/B,IAAI,oBAAoBouE,EAAE8qB,oBAAoBzzH,EAAE+0G,OAAO,SAASj6G,GAAE,EAAG,KAAK,CAAC6tG,EAAE3oG,EAAEyzG,UAAU2d,GAAGrxH,EAAEC,GAAGu6B,EAAEv6B,EAAE+uH,cAAcvjB,EAAExrG,EAAEyG,OAAOzG,EAAEouH,YAAY7zF,EAAE60F,GAAGpvH,EAAEyG,KAAK8zB,GAAGouE,EAAE32F,MAAMw5F,EAAEvpE,EAAEjiC,EAAEuuH,aAAa1sF,EAAE8mE,EAAErsE,QAAwB,kBAAhBltB,EAAE5U,EAAEw4H,cAAiC,OAAO5jH,EAAEA,EAAEghH,GAAGhhH,GAAyBA,EAAE28G,GAAG/rH,EAA1BoP,EAAE+8G,GAAG3xH,GAAGsxH,GAAGF,GAAE5nH,SAAmB,IAAI6tH,EAAEr3H,EAAE64H,0BAA0Bh+F,EAAE,oBAAoBw8F,GAAG,oBAAoBlpB,EAAE2qB,0BAC9e,oBAAoB3qB,EAAEwqB,kCAAkC,oBAAoBxqB,EAAEuqB,4BAA4B34F,IAAI0H,GAAGJ,IAAIzyB,IAAI6jH,GAAGjzH,EAAE2oG,EAAE7tG,EAAEsU,GAAGuhH,IAAG,EAAG9uF,EAAE7hC,EAAEi1G,cAActM,EAAE5lG,MAAM8+B,EAAE+vF,GAAG5xH,EAAElF,EAAE6tG,EAAEp+F,GAAG,IAAIoG,EAAE3Q,EAAEi1G,cAAc16E,IAAI0H,GAAGJ,IAAIlxB,GAAGk7G,GAAG7nH,SAAS2sH,IAAI,oBAAoBkB,IAAIK,GAAGlyH,EAAExF,EAAEq3H,EAAE/2H,GAAG6V,EAAE3Q,EAAEi1G,gBAAgBzJ,EAAEmlB,IAAIiC,GAAG5yH,EAAExF,EAAEgxG,EAAE1wG,EAAE+mC,EAAElxB,EAAEvB,KAAI,IAAKimB,GAAG,oBAAoBszE,EAAEm0B,4BAA4B,oBAAoBn0B,EAAEo0B,sBAAsB,oBAAoBp0B,EAAEo0B,qBAAqBp0B,EAAEo0B,oBAAoBjiI,EAAE6V,EAAEvB,GAAG,oBAAoBu5F,EAAEm0B,4BAC5fn0B,EAAEm0B,2BAA2BhiI,EAAE6V,EAAEvB,IAAI,oBAAoBu5F,EAAEq0B,qBAAqBh9H,EAAE+0G,OAAO,GAAG,oBAAoBpM,EAAE2qB,0BAA0BtzH,EAAE+0G,OAAO,QAAQ,oBAAoBpM,EAAEq0B,oBAAoBziG,IAAIx6B,EAAEgvH,eAAeltF,IAAI9hC,EAAEk1G,gBAAgBj1G,EAAE+0G,OAAO,GAAG,oBAAoBpM,EAAE2qB,yBAAyB/4F,IAAIx6B,EAAEgvH,eAAeltF,IAAI9hC,EAAEk1G,gBAAgBj1G,EAAE+0G,OAAO,MAAM/0G,EAAE+uH,cAAcj0H,EAAEkF,EAAEi1G,cAActkG,GAAGg4F,EAAE32F,MAAMlX,EAAE6tG,EAAE5lG,MAAM4N,EAAEg4F,EAAErsE,QAAQltB,EAAEtU,EAAE0wG,IAAI,oBAAoB7C,EAAEq0B,oBAAoBziG,IAAIx6B,EAAEgvH,eAAeltF,IACjf9hC,EAAEk1G,gBAAgBj1G,EAAE+0G,OAAO,GAAG,oBAAoBpM,EAAE2qB,yBAAyB/4F,IAAIx6B,EAAEgvH,eAAeltF,IAAI9hC,EAAEk1G,gBAAgBj1G,EAAE+0G,OAAO,MAAMj6G,GAAE,EAAG,CAAC,OAAOmiI,GAAGl9H,EAAEC,EAAExF,EAAEM,EAAE0V,EAAEjG,EAAE,CACnK,SAAS0yH,GAAGl9H,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,GAAGmsH,GAAG58H,EAAEC,GAAG,IAAI2oG,EAAE,KAAa,IAAR3oG,EAAE+0G,OAAW,IAAIj6G,IAAI6tG,EAAE,OAAOp+F,GAAGoiH,GAAG3sH,EAAExF,GAAE,GAAIwhI,GAAGj8H,EAAEC,EAAEwQ,GAAG1V,EAAEkF,EAAEyzG,UAAUmoB,GAAG53H,QAAQhE,EAAE,IAAIu6B,EAAEouE,GAAG,oBAAoBnuG,EAAE2gI,yBAAyB,KAAKrgI,EAAE6wG,SAAwI,OAA/H3rG,EAAE+0G,OAAO,EAAE,OAAOh1G,GAAG4oG,GAAG3oG,EAAE8wC,MAAMwjF,GAAGt0H,EAAED,EAAE+wC,MAAM,KAAKtgC,GAAGxQ,EAAE8wC,MAAMwjF,GAAGt0H,EAAE,KAAKu6B,EAAE/pB,IAAIsrH,GAAG/7H,EAAEC,EAAEu6B,EAAE/pB,GAAGxQ,EAAEi1G,cAAcn6G,EAAEiI,MAAMwH,GAAGoiH,GAAG3sH,EAAExF,GAAE,GAAWwF,EAAE8wC,KAAK,CAAC,SAASosF,GAAGn9H,GAAG,IAAIC,EAAED,EAAE0zG,UAAUzzG,EAAEm9H,eAAe7Q,GAAGvsH,EAAEC,EAAEm9H,eAAen9H,EAAEm9H,iBAAiBn9H,EAAEs8B,SAASt8B,EAAEs8B,SAASgwF,GAAGvsH,EAAEC,EAAEs8B,SAAQ,GAAIu4F,GAAG90H,EAAEC,EAAE+5G,cAAc,CAC5e,SAASqjB,GAAGr9H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAuC,OAApC0kH,KAAKC,GAAG3kH,GAAGvK,EAAE+0G,OAAO,IAAI+mB,GAAG/7H,EAAEC,EAAExF,EAAEM,GAAUkF,EAAE8wC,KAAK,CAAC,IAaqLusF,GAAGC,GAAGC,GAAGC,GAb1LC,GAAG,CAACvoB,WAAW,KAAKuZ,YAAY,KAAKC,UAAU,GAAG,SAASgP,GAAG39H,GAAG,MAAM,CAACu8H,UAAUv8H,EAAEw8H,UAAU,KAAKC,YAAY,KAAK,CAClM,SAASmB,GAAG59H,EAAEC,EAAExF,GAAG,IAA0D+/B,EAAtDz/B,EAAEkF,EAAEuuH,aAAahkH,EAAE2qH,GAAElxH,QAAQwM,GAAE,EAAGm4F,EAAE,KAAa,IAAR3oG,EAAE+0G,OAAqJ,IAAvIx6E,EAAEouE,KAAKpuE,GAAE,OAAOx6B,GAAG,OAAOA,EAAEk1G,gBAAiB,KAAO,EAAF1qG,IAASgwB,GAAE/pB,GAAE,EAAGxQ,EAAE+0G,QAAQ,KAAY,OAAOh1G,GAAG,OAAOA,EAAEk1G,gBAAc1qG,GAAG,GAAEmhH,GAAEwJ,GAAI,EAAF3qH,GAAQ,OAAOxK,EAA2B,OAAxB6uH,GAAG5uH,GAAwB,QAArBD,EAAEC,EAAEi1G,gBAA2C,QAAfl1G,EAAEA,EAAEm1G,aAA4B,KAAY,EAAPl1G,EAAE6R,MAAQ7R,EAAEkwH,MAAM,EAAE,OAAOnwH,EAAEgO,KAAK/N,EAAEkwH,MAAM,EAAElwH,EAAEkwH,MAAM,WAAW,OAAKvnB,EAAE7tG,EAAE+3C,SAAS9yC,EAAEjF,EAAE8iI,SAAgBptH,GAAG1V,EAAEkF,EAAE6R,KAAKrB,EAAExQ,EAAE8wC,MAAM63D,EAAE,CAAC92F,KAAK,SAASghC,SAAS81D,GAAG,KAAO,EAAF7tG,IAAM,OAAO0V,GAAGA,EAAEs/G,WAAW,EAAEt/G,EAAE+9G,aAC7e5lB,GAAGn4F,EAAEqtH,GAAGl1B,EAAE7tG,EAAE,EAAE,MAAMiF,EAAEs0H,GAAGt0H,EAAEjF,EAAEN,EAAE,MAAMgW,EAAEskG,OAAO90G,EAAED,EAAE+0G,OAAO90G,EAAEwQ,EAAE6kG,QAAQt1G,EAAEC,EAAE8wC,MAAMtgC,EAAExQ,EAAE8wC,MAAMmkE,cAAcyoB,GAAGljI,GAAGwF,EAAEi1G,cAAcwoB,GAAG19H,GAAG+9H,GAAG99H,EAAE2oG,IAAqB,GAAG,QAArBp+F,EAAExK,EAAEk1G,gBAA2C,QAAf16E,EAAEhwB,EAAE2qG,YAAqB,OAGpM,SAAYn1G,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,EAAEm4F,GAAG,GAAGnuG,EAAG,OAAW,IAARwF,EAAE+0G,OAAiB/0G,EAAE+0G,QAAQ,IAAwBgpB,GAAGh+H,EAAEC,EAAE2oG,EAA3B7tG,EAAE8/H,GAAG3zH,MAAMG,EAAE,SAAsB,OAAOpH,EAAEi1G,eAAqBj1G,EAAE8wC,MAAM/wC,EAAE+wC,MAAM9wC,EAAE+0G,OAAO,IAAI,OAAKvkG,EAAE1V,EAAE8iI,SAASrzH,EAAEvK,EAAE6R,KAAK/W,EAAE+iI,GAAG,CAAChsH,KAAK,UAAUghC,SAAS/3C,EAAE+3C,UAAUtoC,EAAE,EAAE,OAAMiG,EAAE6jH,GAAG7jH,EAAEjG,EAAEo+F,EAAE,OAAQoM,OAAO,EAAEj6G,EAAEg6G,OAAO90G,EAAEwQ,EAAEskG,OAAO90G,EAAElF,EAAEu6G,QAAQ7kG,EAAExQ,EAAE8wC,MAAMh2C,EAAE,KAAY,EAAPkF,EAAE6R,OAASyiH,GAAGt0H,EAAED,EAAE+wC,MAAM,KAAK63D,GAAG3oG,EAAE8wC,MAAMmkE,cAAcyoB,GAAG/0B,GAAG3oG,EAAEi1G,cAAcwoB,GAAUjtH,GAAE,GAAG,KAAY,EAAPxQ,EAAE6R,MAAQ,OAAOksH,GAAGh+H,EAAEC,EAAE2oG,EAAE,MAAM,GAAG,OAAOp+F,EAAEwD,KAAK,CAChd,GADidjT,EAAEyP,EAAEs6G,aAAat6G,EAAEs6G,YAAYmZ,QAC3e,IAAIzjG,EAAEz/B,EAAEmjI,KAA0C,OAArCnjI,EAAEy/B,EAA0CwjG,GAAGh+H,EAAEC,EAAE2oG,EAA/B7tG,EAAE8/H,GAAlBpqH,EAAEvJ,MAAMG,EAAE,MAAatM,OAAE,GAA0B,CAAwB,GAAvBy/B,EAAE,KAAKouE,EAAE5oG,EAAE+vH,YAAeK,IAAI51F,EAAE,CAAK,GAAG,QAAPz/B,EAAE88H,IAAc,CAAC,OAAOjvB,GAAGA,GAAG,KAAK,EAAEp+F,EAAE,EAAE,MAAM,KAAK,GAAGA,EAAE,EAAE,MAAM,KAAK,GAAG,KAAK,IAAI,KAAK,IAAI,KAAK,IAAI,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,KAAK,MAAM,KAAK,MAAM,KAAK,MAAM,KAAK,OAAO,KAAK,OAAO,KAAK,OAAO,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,QAAQ,KAAK,SAAS,KAAK,SAAS,KAAK,SAASA,EAAE,GAAG,MAAM,KAAK,UAAUA,EAAE,UAAU,MAAM,QAAQA,EAAE,EAChd,KADkdA,EAAE,KAAKA,GAAGzP,EAAE28G,eAAe9O,IAAI,EAAEp+F,IAC5eA,IAAIiG,EAAEk+G,YAAYl+G,EAAEk+G,UAAUnkH,EAAEmmH,GAAG3wH,EAAEwK,GAAGkoH,GAAG33H,EAAEiF,EAAEwK,GAAG,GAAG,CAA0B,OAAzB2zH,KAAgCH,GAAGh+H,EAAEC,EAAE2oG,EAAlC7tG,EAAE8/H,GAAG3zH,MAAMG,EAAE,OAAyB,CAAC,MAAG,OAAOmD,EAAEwD,MAAY/N,EAAE+0G,OAAO,IAAI/0G,EAAE8wC,MAAM/wC,EAAE+wC,MAAM9wC,EAAEm+H,GAAGp4G,KAAK,KAAKhmB,GAAGwK,EAAE6zH,YAAYp+H,EAAE,OAAKD,EAAEyQ,EAAEi+G,YAAYV,GAAGjD,GAAGvgH,EAAEs6G,aAAaiJ,GAAG9tH,EAAEguH,IAAE,EAAGC,GAAG,KAAK,OAAOluH,IAAIstH,GAAGC,MAAME,GAAGH,GAAGC,MAAMG,GAAGJ,GAAGC,MAAMC,GAAGC,GAAGztH,EAAEqlB,GAAGqoG,GAAG1tH,EAAEyuH,SAASjB,GAAGvtH,GAAGA,EAAE89H,GAAG99H,EAAElF,EAAE+3C,UAAU7yC,EAAE+0G,OAAO,KAAY/0G,EAAC,CALrKq+H,CAAGt+H,EAAEC,EAAE2oG,EAAE7tG,EAAEy/B,EAAEhwB,EAAE/P,GAAG,GAAGgW,EAAE,CAACA,EAAE1V,EAAE8iI,SAASj1B,EAAE3oG,EAAE6R,KAAe0oB,GAAVhwB,EAAExK,EAAE+wC,OAAUukE,QAAQ,IAAIjmG,EAAE,CAACyC,KAAK,SAASghC,SAAS/3C,EAAE+3C,UAChF,OAD0F,KAAO,EAAF81D,IAAM3oG,EAAE8wC,QAAQvmC,IAAGzP,EAAEkF,EAAE8wC,OAAQg/E,WAAW,EAAEh1H,EAAEyzH,aAAan/G,EAAEpP,EAAEquH,UAAU,OAAOvzH,EAAEk5H,GAAGzpH,EAAE6E,IAAKkvH,aAA4B,SAAf/zH,EAAE+zH,aAAuB,OAAO/jG,EAAE/pB,EAAEwjH,GAAGz5F,EAAE/pB,IAAIA,EAAE6jH,GAAG7jH,EAAEm4F,EAAEnuG,EAAE,OAAQu6G,OAAO,EAAGvkG,EAAEskG,OACnf90G,EAAElF,EAAEg6G,OAAO90G,EAAElF,EAAEu6G,QAAQ7kG,EAAExQ,EAAE8wC,MAAMh2C,EAAEA,EAAE0V,EAAEA,EAAExQ,EAAE8wC,MAA8B63D,EAAE,QAA1BA,EAAE5oG,EAAE+wC,MAAMmkE,eAAyByoB,GAAGljI,GAAG,CAAC8hI,UAAU3zB,EAAE2zB,UAAU9hI,EAAE+hI,UAAU,KAAKC,YAAY7zB,EAAE6zB,aAAahsH,EAAEykG,cAActM,EAAEn4F,EAAEs/G,WAAW/vH,EAAE+vH,YAAYt1H,EAAEwF,EAAEi1G,cAAcwoB,GAAU3iI,CAAC,CAAoO,OAAzNiF,GAAVyQ,EAAEzQ,EAAE+wC,OAAUukE,QAAQv6G,EAAEk5H,GAAGxjH,EAAE,CAACqB,KAAK,UAAUghC,SAAS/3C,EAAE+3C,WAAW,KAAY,EAAP7yC,EAAE6R,QAAU/W,EAAEo1H,MAAM11H,GAAGM,EAAEg6G,OAAO90G,EAAElF,EAAEu6G,QAAQ,KAAK,OAAOt1G,IAAkB,QAAdvF,EAAEwF,EAAEquH,YAAoBruH,EAAEquH,UAAU,CAACtuH,GAAGC,EAAE+0G,OAAO,IAAIv6G,EAAEkE,KAAKqB,IAAIC,EAAE8wC,MAAMh2C,EAAEkF,EAAEi1G,cAAc,KAAYn6G,CAAC,CACnd,SAASgjI,GAAG/9H,EAAEC,GAA8D,OAA3DA,EAAE69H,GAAG,CAAChsH,KAAK,UAAUghC,SAAS7yC,GAAGD,EAAE8R,KAAK,EAAE,OAAQijG,OAAO/0G,EAASA,EAAE+wC,MAAM9wC,CAAC,CAAC,SAAS+9H,GAAGh+H,EAAEC,EAAExF,EAAEM,GAAwG,OAArG,OAAOA,GAAGo0H,GAAGp0H,GAAGw5H,GAAGt0H,EAAED,EAAE+wC,MAAM,KAAKt2C,IAAGuF,EAAE+9H,GAAG99H,EAAEA,EAAEuuH,aAAa17E,WAAYkiE,OAAO,EAAE/0G,EAAEi1G,cAAc,KAAYl1G,CAAC,CAGkJ,SAASw+H,GAAGx+H,EAAEC,EAAExF,GAAGuF,EAAEmwH,OAAOlwH,EAAE,IAAIlF,EAAEiF,EAAE80G,UAAU,OAAO/5G,IAAIA,EAAEo1H,OAAOlwH,GAAG6vH,GAAG9vH,EAAE+0G,OAAO90G,EAAExF,EAAE,CACxc,SAASgkI,GAAGz+H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,IAAIiG,EAAEzQ,EAAEk1G,cAAc,OAAOzkG,EAAEzQ,EAAEk1G,cAAc,CAACwpB,YAAYz+H,EAAE0+H,UAAU,KAAKC,mBAAmB,EAAEtrE,KAAKv4D,EAAEolG,KAAK1lG,EAAEokI,SAASr0H,IAAIiG,EAAEiuH,YAAYz+H,EAAEwQ,EAAEkuH,UAAU,KAAKluH,EAAEmuH,mBAAmB,EAAEnuH,EAAE6iD,KAAKv4D,EAAE0V,EAAE0vF,KAAK1lG,EAAEgW,EAAEouH,SAASr0H,EAAE,CAC3O,SAASs0H,GAAG9+H,EAAEC,EAAExF,GAAG,IAAIM,EAAEkF,EAAEuuH,aAAahkH,EAAEzP,EAAEs6H,YAAY5kH,EAAE1V,EAAEolG,KAAsC,GAAjC47B,GAAG/7H,EAAEC,EAAElF,EAAE+3C,SAASr4C,GAAkB,KAAO,GAAtBM,EAAEo6H,GAAElxH,UAAqBlJ,EAAI,EAAFA,EAAI,EAAEkF,EAAE+0G,OAAO,QAAQ,CAAC,GAAG,OAAOh1G,GAAG,KAAa,IAARA,EAAEg1G,OAAWh1G,EAAE,IAAIA,EAAEC,EAAE8wC,MAAM,OAAO/wC,GAAG,CAAC,GAAG,KAAKA,EAAE1D,IAAI,OAAO0D,EAAEk1G,eAAespB,GAAGx+H,EAAEvF,EAAEwF,QAAQ,GAAG,KAAKD,EAAE1D,IAAIkiI,GAAGx+H,EAAEvF,EAAEwF,QAAQ,GAAG,OAAOD,EAAE+wC,MAAM,CAAC/wC,EAAE+wC,MAAMgkE,OAAO/0G,EAAEA,EAAEA,EAAE+wC,MAAM,QAAQ,CAAC,GAAG/wC,IAAIC,EAAE,MAAMD,EAAE,KAAK,OAAOA,EAAEs1G,SAAS,CAAC,GAAG,OAAOt1G,EAAE+0G,QAAQ/0G,EAAE+0G,SAAS90G,EAAE,MAAMD,EAAEA,EAAEA,EAAE+0G,MAAM,CAAC/0G,EAAEs1G,QAAQP,OAAO/0G,EAAE+0G,OAAO/0G,EAAEA,EAAEs1G,OAAO,CAACv6G,GAAG,CAAC,CAAQ,GAAP4wH,GAAEwJ,GAAEp6H,GAAM,KAAY,EAAPkF,EAAE6R,MAAQ7R,EAAEi1G,cAC/e,UAAU,OAAO1qG,GAAG,IAAK,WAAqB,IAAV/P,EAAEwF,EAAE8wC,MAAUvmC,EAAE,KAAK,OAAO/P,GAAiB,QAAduF,EAAEvF,EAAEq6G,YAAoB,OAAOsgB,GAAGp1H,KAAKwK,EAAE/P,GAAGA,EAAEA,EAAE66G,QAAY,QAAJ76G,EAAE+P,IAAYA,EAAEvK,EAAE8wC,MAAM9wC,EAAE8wC,MAAM,OAAOvmC,EAAE/P,EAAE66G,QAAQ76G,EAAE66G,QAAQ,MAAMmpB,GAAGx+H,GAAE,EAAGuK,EAAE/P,EAAEgW,GAAG,MAAM,IAAK,YAA6B,IAAjBhW,EAAE,KAAK+P,EAAEvK,EAAE8wC,MAAU9wC,EAAE8wC,MAAM,KAAK,OAAOvmC,GAAG,CAAe,GAAG,QAAjBxK,EAAEwK,EAAEsqG,YAAuB,OAAOsgB,GAAGp1H,GAAG,CAACC,EAAE8wC,MAAMvmC,EAAE,KAAK,CAACxK,EAAEwK,EAAE8qG,QAAQ9qG,EAAE8qG,QAAQ76G,EAAEA,EAAE+P,EAAEA,EAAExK,CAAC,CAACy+H,GAAGx+H,GAAE,EAAGxF,EAAE,KAAKgW,GAAG,MAAM,IAAK,WAAWguH,GAAGx+H,GAAE,EAAG,KAAK,UAAK,GAAQ,MAAM,QAAQA,EAAEi1G,cAAc,KAAK,OAAOj1G,EAAE8wC,KAAK,CAC7d,SAAS+rF,GAAG98H,EAAEC,GAAG,KAAY,EAAPA,EAAE6R,OAAS,OAAO9R,IAAIA,EAAE80G,UAAU,KAAK70G,EAAE60G,UAAU,KAAK70G,EAAE+0G,OAAO,EAAE,CAAC,SAASinB,GAAGj8H,EAAEC,EAAExF,GAAyD,GAAtD,OAAOuF,IAAIC,EAAEgwH,aAAajwH,EAAEiwH,cAAc8B,IAAI9xH,EAAEkwH,MAAS,KAAK11H,EAAEwF,EAAE8vH,YAAY,OAAO,KAAK,GAAG,OAAO/vH,GAAGC,EAAE8wC,QAAQ/wC,EAAE+wC,MAAM,MAAM7pC,MAAMG,EAAE,MAAM,GAAG,OAAOpH,EAAE8wC,MAAM,CAA4C,IAAjCt2C,EAAEw5H,GAAZj0H,EAAEC,EAAE8wC,MAAa/wC,EAAEwuH,cAAcvuH,EAAE8wC,MAAMt2C,EAAMA,EAAEs6G,OAAO90G,EAAE,OAAOD,EAAEs1G,SAASt1G,EAAEA,EAAEs1G,SAAQ76G,EAAEA,EAAE66G,QAAQ2e,GAAGj0H,EAAEA,EAAEwuH,eAAgBzZ,OAAO90G,EAAExF,EAAE66G,QAAQ,IAAI,CAAC,OAAOr1G,EAAE8wC,KAAK,CAO9a,SAASguF,GAAG/+H,EAAEC,GAAG,IAAIguH,GAAE,OAAOjuH,EAAE6+H,UAAU,IAAK,SAAS5+H,EAAED,EAAEmgG,KAAK,IAAI,IAAI1lG,EAAE,KAAK,OAAOwF,GAAG,OAAOA,EAAE60G,YAAYr6G,EAAEwF,GAAGA,EAAEA,EAAEq1G,QAAQ,OAAO76G,EAAEuF,EAAEmgG,KAAK,KAAK1lG,EAAE66G,QAAQ,KAAK,MAAM,IAAK,YAAY76G,EAAEuF,EAAEmgG,KAAK,IAAI,IAAIplG,EAAE,KAAK,OAAON,GAAG,OAAOA,EAAEq6G,YAAY/5G,EAAEN,GAAGA,EAAEA,EAAE66G,QAAQ,OAAOv6G,EAAEkF,GAAG,OAAOD,EAAEmgG,KAAKngG,EAAEmgG,KAAK,KAAKngG,EAAEmgG,KAAKmV,QAAQ,KAAKv6G,EAAEu6G,QAAQ,KAAK,CAC5U,SAAS0pB,GAAEh/H,GAAG,IAAIC,EAAE,OAAOD,EAAE80G,WAAW90G,EAAE80G,UAAU/jE,QAAQ/wC,EAAE+wC,MAAMt2C,EAAE,EAAEM,EAAE,EAAE,GAAGkF,EAAE,IAAI,IAAIuK,EAAExK,EAAE+wC,MAAM,OAAOvmC,GAAG/P,GAAG+P,EAAE2lH,MAAM3lH,EAAEulH,WAAWh1H,GAAkB,SAAfyP,EAAE+zH,aAAsBxjI,GAAW,SAARyP,EAAEwqG,MAAexqG,EAAEuqG,OAAO/0G,EAAEwK,EAAEA,EAAE8qG,aAAa,IAAI9qG,EAAExK,EAAE+wC,MAAM,OAAOvmC,GAAG/P,GAAG+P,EAAE2lH,MAAM3lH,EAAEulH,WAAWh1H,GAAGyP,EAAE+zH,aAAaxjI,GAAGyP,EAAEwqG,MAAMxqG,EAAEuqG,OAAO/0G,EAAEwK,EAAEA,EAAE8qG,QAAyC,OAAjCt1G,EAAEu+H,cAAcxjI,EAAEiF,EAAE+vH,WAAWt1H,EAASwF,CAAC,CAC7V,SAASg/H,GAAGj/H,EAAEC,EAAExF,GAAG,IAAIM,EAAEkF,EAAEuuH,aAAmB,OAANV,GAAG7tH,GAAUA,EAAE3D,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,KAAK,EAAE,KAAK,GAAG,OAAO0iI,GAAE/+H,GAAG,KAAK,KAAK,EAUtD,KAAK,GAAG,OAAOmsH,GAAGnsH,EAAEyG,OAAO4lH,KAAK0S,GAAE/+H,GAAG,KAVqD,KAAK,EAA2Q,OAAzQlF,EAAEkF,EAAEyzG,UAAUshB,KAAKtJ,GAAEI,IAAIJ,GAAEG,IAAG0J,KAAKx6H,EAAEqiI,iBAAiBriI,EAAEwhC,QAAQxhC,EAAEqiI,eAAeriI,EAAEqiI,eAAe,MAAS,OAAOp9H,GAAG,OAAOA,EAAE+wC,QAAMg+E,GAAG9uH,GAAGA,EAAE+0G,OAAO,EAAE,OAAOh1G,GAAGA,EAAEk1G,cAAc6E,cAAc,KAAa,IAAR95G,EAAE+0G,SAAa/0G,EAAE+0G,OAAO,KAAK,OAAOkZ,KAAKgR,GAAGhR,IAAIA,GAAG,QAAOqP,GAAGv9H,EAAEC,GAAG++H,GAAE/+H,GAAU,KAAK,KAAK,EAAEi1H,GAAGj1H,GAAG,IAAIuK,EAAEqqH,GAAGD,GAAG3wH,SAC7e,GAATxJ,EAAEwF,EAAEyG,KAAQ,OAAO1G,GAAG,MAAMC,EAAEyzG,UAAU8pB,GAAGx9H,EAAEC,EAAExF,EAAEM,EAAEyP,GAAGxK,EAAEy7D,MAAMx7D,EAAEw7D,MAAMx7D,EAAE+0G,OAAO,IAAI/0G,EAAE+0G,OAAO,aAAa,CAAC,IAAIj6G,EAAE,CAAC,GAAG,OAAOkF,EAAEyzG,UAAU,MAAMxsG,MAAMG,EAAE,MAAW,OAAL23H,GAAE/+H,GAAU,IAAI,CAAkB,GAAjBD,EAAE60H,GAAGH,GAAGzwH,SAAY8qH,GAAG9uH,GAAG,CAAClF,EAAEkF,EAAEyzG,UAAUj5G,EAAEwF,EAAEyG,KAAK,IAAI+J,EAAExQ,EAAE+uH,cAA+C,OAAjCj0H,EAAEowH,IAAIlrH,EAAElF,EAAEqwH,IAAI36G,EAAEzQ,EAAE,KAAY,EAAPC,EAAE6R,MAAerX,GAAG,IAAK,SAAS8tH,GAAE,SAASxtH,GAAGwtH,GAAE,QAAQxtH,GAAG,MAAM,IAAK,SAAS,IAAK,SAAS,IAAK,QAAQwtH,GAAE,OAAOxtH,GAAG,MAAM,IAAK,QAAQ,IAAK,QAAQ,IAAIyP,EAAE,EAAEA,EAAE29G,GAAGnuH,OAAOwQ,IAAI+9G,GAAEJ,GAAG39G,GAAGzP,GAAG,MAAM,IAAK,SAASwtH,GAAE,QAAQxtH,GAAG,MAAM,IAAK,MAAM,IAAK,QAAQ,IAAK,OAAOwtH,GAAE,QACnhBxtH,GAAGwtH,GAAE,OAAOxtH,GAAG,MAAM,IAAK,UAAUwtH,GAAE,SAASxtH,GAAG,MAAM,IAAK,QAAQuyG,EAAGvyG,EAAE0V,GAAG83G,GAAE,UAAUxtH,GAAG,MAAM,IAAK,SAASA,EAAEqyG,cAAc,CAAC+xB,cAAc1uH,EAAE2uH,UAAU7W,GAAE,UAAUxtH,GAAG,MAAM,IAAK,WAAW6nB,GAAG7nB,EAAE0V,GAAG83G,GAAE,UAAUxtH,GAAkB,IAAI,IAAI6tG,KAAvBkK,GAAGr4G,EAAEgW,GAAGjG,EAAE,KAAkBiG,EAAE,GAAGA,EAAE1F,eAAe69F,GAAG,CAAC,IAAIpuE,EAAE/pB,EAAEm4F,GAAG,aAAaA,EAAE,kBAAkBpuE,EAAEz/B,EAAE43B,cAAc6H,KAAI,IAAK/pB,EAAE4uH,0BAA0BnV,GAAGnvH,EAAE43B,YAAY6H,EAAEx6B,GAAGwK,EAAE,CAAC,WAAWgwB,IAAI,kBAAkBA,GAAGz/B,EAAE43B,cAAc,GAAG6H,KAAI,IAAK/pB,EAAE4uH,0BAA0BnV,GAAGnvH,EAAE43B,YAC1e6H,EAAEx6B,GAAGwK,EAAE,CAAC,WAAW,GAAGgwB,IAAI4tE,EAAGr9F,eAAe69F,IAAI,MAAMpuE,GAAG,aAAaouE,GAAG2f,GAAE,SAASxtH,EAAE,CAAC,OAAON,GAAG,IAAK,QAAQ6xG,EAAGvxG,GAAG6lB,EAAG7lB,EAAE0V,GAAE,GAAI,MAAM,IAAK,WAAW67F,EAAGvxG,GAAGszG,GAAGtzG,GAAG,MAAM,IAAK,SAAS,IAAK,SAAS,MAAM,QAAQ,oBAAoB0V,EAAE6uH,UAAUvkI,EAAEwkI,QAAQpV,IAAIpvH,EAAEyP,EAAEvK,EAAE6wH,YAAY/1H,EAAE,OAAOA,IAAIkF,EAAE+0G,OAAO,EAAE,KAAK,CAACpM,EAAE,IAAIp+F,EAAEooE,SAASpoE,EAAEA,EAAEojG,cAAc,iCAAiC5tG,IAAIA,EAAEsuG,GAAG7zG,IAAI,iCAAiCuF,EAAE,WAAWvF,IAAGuF,EAAE4oG,EAAE5iG,cAAc,QAAS2oG,UAAU,qBAAuB3uG,EAAEA,EAAEkxB,YAAYlxB,EAAE4uG,aAC/f,kBAAkB7zG,EAAEi4G,GAAGhzG,EAAE4oG,EAAE5iG,cAAcvL,EAAE,CAACu4G,GAAGj4G,EAAEi4G,MAAMhzG,EAAE4oG,EAAE5iG,cAAcvL,GAAG,WAAWA,IAAImuG,EAAE5oG,EAAEjF,EAAEqkI,SAASx2B,EAAEw2B,UAAS,EAAGrkI,EAAEg4B,OAAO61E,EAAE71E,KAAKh4B,EAAEg4B,QAAQ/yB,EAAE4oG,EAAE42B,gBAAgBx/H,EAAEvF,GAAGuF,EAAEmrH,IAAIlrH,EAAED,EAAEorH,IAAIrwH,EAAEuiI,GAAGt9H,EAAEC,GAAE,GAAG,GAAIA,EAAEyzG,UAAU1zG,EAAEA,EAAE,CAAW,OAAV4oG,EAAEmK,GAAGt4G,EAAEM,GAAUN,GAAG,IAAK,SAAS8tH,GAAE,SAASvoH,GAAGuoH,GAAE,QAAQvoH,GAAGwK,EAAEzP,EAAE,MAAM,IAAK,SAAS,IAAK,SAAS,IAAK,QAAQwtH,GAAE,OAAOvoH,GAAGwK,EAAEzP,EAAE,MAAM,IAAK,QAAQ,IAAK,QAAQ,IAAIyP,EAAE,EAAEA,EAAE29G,GAAGnuH,OAAOwQ,IAAI+9G,GAAEJ,GAAG39G,GAAGxK,GAAGwK,EAAEzP,EAAE,MAAM,IAAK,SAASwtH,GAAE,QAAQvoH,GAAGwK,EAAEzP,EAAE,MAAM,IAAK,MAAM,IAAK,QAAQ,IAAK,OAAOwtH,GAAE,QAClfvoH,GAAGuoH,GAAE,OAAOvoH,GAAGwK,EAAEzP,EAAE,MAAM,IAAK,UAAUwtH,GAAE,SAASvoH,GAAGwK,EAAEzP,EAAE,MAAM,IAAK,QAAQuyG,EAAGttG,EAAEjF,GAAGyP,EAAE0iG,EAAGltG,EAAEjF,GAAGwtH,GAAE,UAAUvoH,GAAG,MAAM,IAAK,SAAiL,QAAQwK,EAAEzP,QAAxK,IAAK,SAASiF,EAAEotG,cAAc,CAAC+xB,cAAcpkI,EAAEqkI,UAAU50H,EAAE0gG,EAAE,CAAC,EAAEnwG,EAAE,CAAC0L,WAAM,IAAS8hH,GAAE,UAAUvoH,GAAG,MAAM,IAAK,WAAW4iB,GAAG5iB,EAAEjF,GAAGyP,EAAE0jG,GAAGluG,EAAEjF,GAAGwtH,GAAE,UAAUvoH,GAAiC,IAAIyQ,KAAhBqiG,GAAGr4G,EAAE+P,GAAGgwB,EAAEhwB,EAAa,GAAGgwB,EAAEzvB,eAAe0F,GAAG,CAAC,IAAIpB,EAAEmrB,EAAE/pB,GAAG,UAAUA,EAAEshG,GAAG/xG,EAAEqP,GAAG,4BAA4BoB,EAAuB,OAApBpB,EAAEA,EAAEA,EAAEk7G,YAAO,IAAgB9b,GAAGzuG,EAAEqP,GAAI,aAAaoB,EAAE,kBAAkBpB,GAAG,aAC7e5U,GAAG,KAAK4U,IAAI0/F,GAAG/uG,EAAEqP,GAAG,kBAAkBA,GAAG0/F,GAAG/uG,EAAE,GAAGqP,GAAG,mCAAmCoB,GAAG,6BAA6BA,GAAG,cAAcA,IAAI23F,EAAGr9F,eAAe0F,GAAG,MAAMpB,GAAG,aAAaoB,GAAG83G,GAAE,SAASvoH,GAAG,MAAMqP,GAAGk6F,EAAGvpG,EAAEyQ,EAAEpB,EAAEu5F,GAAG,CAAC,OAAOnuG,GAAG,IAAK,QAAQ6xG,EAAGtsG,GAAG4gB,EAAG5gB,EAAEjF,GAAE,GAAI,MAAM,IAAK,WAAWuxG,EAAGtsG,GAAGquG,GAAGruG,GAAG,MAAM,IAAK,SAAS,MAAMjF,EAAE0L,OAAOzG,EAAE4pG,aAAa,QAAQ,GAAGuC,EAAGpxG,EAAE0L,QAAQ,MAAM,IAAK,SAASzG,EAAEo/H,WAAWrkI,EAAEqkI,SAAmB,OAAV3uH,EAAE1V,EAAE0L,OAAcqnG,GAAG9tG,IAAIjF,EAAEqkI,SAAS3uH,GAAE,GAAI,MAAM1V,EAAEk2F,cAAc6c,GAAG9tG,IAAIjF,EAAEqkI,SAASrkI,EAAEk2F,cAClf,GAAI,MAAM,QAAQ,oBAAoBzmF,EAAE80H,UAAUt/H,EAAEu/H,QAAQpV,IAAI,OAAO1vH,GAAG,IAAK,SAAS,IAAK,QAAQ,IAAK,SAAS,IAAK,WAAWM,IAAIA,EAAE0kI,UAAU,MAAMz/H,EAAE,IAAK,MAAMjF,GAAE,EAAG,MAAMiF,EAAE,QAAQjF,GAAE,EAAG,CAACA,IAAIkF,EAAE+0G,OAAO,EAAE,CAAC,OAAO/0G,EAAEw7D,MAAMx7D,EAAE+0G,OAAO,IAAI/0G,EAAE+0G,OAAO,QAAQ,CAAM,OAALgqB,GAAE/+H,GAAU,KAAK,KAAK,EAAE,GAAGD,GAAG,MAAMC,EAAEyzG,UAAU+pB,GAAGz9H,EAAEC,EAAED,EAAEgvH,cAAcj0H,OAAO,CAAC,GAAG,kBAAkBA,GAAG,OAAOkF,EAAEyzG,UAAU,MAAMxsG,MAAMG,EAAE,MAAsC,GAAhC5M,EAAEo6H,GAAGD,GAAG3wH,SAAS4wH,GAAGH,GAAGzwH,SAAY8qH,GAAG9uH,GAAG,CAAyC,GAAxClF,EAAEkF,EAAEyzG,UAAUj5G,EAAEwF,EAAE+uH,cAAcj0H,EAAEowH,IAAIlrH,GAAKwQ,EAAE1V,EAAEk0G,YAAYx0G,IAC/e,QADofuF,EACvf+tH,IAAY,OAAO/tH,EAAE1D,KAAK,KAAK,EAAE4tH,GAAGnvH,EAAEk0G,UAAUx0G,EAAE,KAAY,EAAPuF,EAAE8R,OAAS,MAAM,KAAK,GAAE,IAAK9R,EAAEgvH,cAAcqQ,0BAA0BnV,GAAGnvH,EAAEk0G,UAAUx0G,EAAE,KAAY,EAAPuF,EAAE8R,OAASrB,IAAIxQ,EAAE+0G,OAAO,EAAE,MAAMj6G,GAAG,IAAIN,EAAEm4E,SAASn4E,EAAEA,EAAEmzG,eAAe8xB,eAAe3kI,IAAKowH,IAAIlrH,EAAEA,EAAEyzG,UAAU34G,CAAC,CAAM,OAALikI,GAAE/+H,GAAU,KAAK,KAAK,GAA0B,GAAvByrH,GAAEyJ,IAAGp6H,EAAEkF,EAAEi1G,cAAiB,OAAOl1G,GAAG,OAAOA,EAAEk1G,eAAe,OAAOl1G,EAAEk1G,cAAcC,WAAW,CAAC,GAAG8Y,IAAG,OAAOD,IAAI,KAAY,EAAP/tH,EAAE6R,OAAS,KAAa,IAAR7R,EAAE+0G,OAAWia,KAAKC,KAAKjvH,EAAE+0G,OAAO,MAAMvkG,GAAE,OAAQ,GAAGA,EAAEs+G,GAAG9uH,GAAG,OAAOlF,GAAG,OAAOA,EAAEo6G,WAAW,CAAC,GAAG,OAC5fn1G,EAAE,CAAC,IAAIyQ,EAAE,MAAMvJ,MAAMG,EAAE,MAAqD,KAA7BoJ,EAAE,QAApBA,EAAExQ,EAAEi1G,eAAyBzkG,EAAE0kG,WAAW,MAAW,MAAMjuG,MAAMG,EAAE,MAAMoJ,EAAE06G,IAAIlrH,CAAC,MAAMivH,KAAK,KAAa,IAARjvH,EAAE+0G,SAAa/0G,EAAEi1G,cAAc,MAAMj1G,EAAE+0G,OAAO,EAAEgqB,GAAE/+H,GAAGwQ,GAAE,CAAE,MAAM,OAAOy9G,KAAKgR,GAAGhR,IAAIA,GAAG,MAAMz9G,GAAE,EAAG,IAAIA,EAAE,OAAe,MAARxQ,EAAE+0G,MAAY/0G,EAAE,IAAI,CAAC,OAAG,KAAa,IAARA,EAAE+0G,QAAkB/0G,EAAEkwH,MAAM11H,EAAEwF,KAAElF,EAAE,OAAOA,MAAO,OAAOiF,GAAG,OAAOA,EAAEk1G,gBAAgBn6G,IAAIkF,EAAE8wC,MAAMikE,OAAO,KAAK,KAAY,EAAP/0G,EAAE6R,QAAU,OAAO9R,GAAG,KAAe,EAAVm1H,GAAElxH,SAAW,IAAI07H,KAAIA,GAAE,GAAGxB,OAAO,OAAOl+H,EAAE6wH,cAAc7wH,EAAE+0G,OAAO,GAAGgqB,GAAE/+H,GAAU,MAAK,KAAK,EAAE,OAAO+0H,KACrfuI,GAAGv9H,EAAEC,GAAG,OAAOD,GAAG4oH,GAAG3oH,EAAEyzG,UAAUsG,eAAeglB,GAAE/+H,GAAG,KAAK,KAAK,GAAG,OAAO2vH,GAAG3vH,EAAEyG,KAAKqlG,UAAUizB,GAAE/+H,GAAG,KAA+C,KAAK,GAA0B,GAAvByrH,GAAEyJ,IAAwB,QAArB1kH,EAAExQ,EAAEi1G,eAA0B,OAAO8pB,GAAE/+H,GAAG,KAAuC,GAAlClF,EAAE,KAAa,IAARkF,EAAE+0G,OAA4B,QAAjBpM,EAAEn4F,EAAEkuH,WAAsB,GAAG5jI,EAAEgkI,GAAGtuH,GAAE,OAAQ,CAAC,GAAG,IAAIkvH,IAAG,OAAO3/H,GAAG,KAAa,IAARA,EAAEg1G,OAAW,IAAIh1G,EAAEC,EAAE8wC,MAAM,OAAO/wC,GAAG,CAAS,GAAG,QAAX4oG,EAAEwsB,GAAGp1H,IAAe,CAAmG,IAAlGC,EAAE+0G,OAAO,IAAI+pB,GAAGtuH,GAAE,GAAoB,QAAhB1V,EAAE6tG,EAAEkoB,eAAuB7wH,EAAE6wH,YAAY/1H,EAAEkF,EAAE+0G,OAAO,GAAG/0G,EAAEs+H,aAAa,EAAExjI,EAAEN,EAAMA,EAAEwF,EAAE8wC,MAAM,OAAOt2C,GAAOuF,EAAEjF,GAAN0V,EAAEhW,GAAQu6G,OAAO,SAC/d,QAAdpM,EAAEn4F,EAAEqkG,YAAoBrkG,EAAEs/G,WAAW,EAAEt/G,EAAE0/G,MAAMnwH,EAAEyQ,EAAEsgC,MAAM,KAAKtgC,EAAE8tH,aAAa,EAAE9tH,EAAEu+G,cAAc,KAAKv+G,EAAEykG,cAAc,KAAKzkG,EAAEqgH,YAAY,KAAKrgH,EAAEw/G,aAAa,KAAKx/G,EAAEijG,UAAU,OAAOjjG,EAAEs/G,WAAWnnB,EAAEmnB,WAAWt/G,EAAE0/G,MAAMvnB,EAAEunB,MAAM1/G,EAAEsgC,MAAM63D,EAAE73D,MAAMtgC,EAAE8tH,aAAa,EAAE9tH,EAAE69G,UAAU,KAAK79G,EAAEu+G,cAAcpmB,EAAEomB,cAAcv+G,EAAEykG,cAActM,EAAEsM,cAAczkG,EAAEqgH,YAAYloB,EAAEkoB,YAAYrgH,EAAE/J,KAAKkiG,EAAEliG,KAAK1G,EAAE4oG,EAAEqnB,aAAax/G,EAAEw/G,aAAa,OAAOjwH,EAAE,KAAK,CAACmwH,MAAMnwH,EAAEmwH,MAAMD,aAAalwH,EAAEkwH,eAAez1H,EAAEA,EAAE66G,QAA2B,OAAnBqW,GAAEwJ,GAAY,EAAVA,GAAElxH,QAAU,GAAUhE,EAAE8wC,KAAK,CAAC/wC,EAClgBA,EAAEs1G,OAAO,CAAC,OAAO7kG,EAAE0vF,MAAM8V,KAAI2pB,KAAK3/H,EAAE+0G,OAAO,IAAIj6G,GAAE,EAAGgkI,GAAGtuH,GAAE,GAAIxQ,EAAEkwH,MAAM,QAAQ,KAAK,CAAC,IAAIp1H,EAAE,GAAW,QAARiF,EAAEo1H,GAAGxsB,KAAa,GAAG3oG,EAAE+0G,OAAO,IAAIj6G,GAAE,EAAmB,QAAhBN,EAAEuF,EAAE8wH,eAAuB7wH,EAAE6wH,YAAYr2H,EAAEwF,EAAE+0G,OAAO,GAAG+pB,GAAGtuH,GAAE,GAAI,OAAOA,EAAE0vF,MAAM,WAAW1vF,EAAEouH,WAAWj2B,EAAEkM,YAAYmZ,GAAE,OAAO+Q,GAAE/+H,GAAG,UAAU,EAAEg2G,KAAIxlG,EAAEmuH,mBAAmBgB,IAAI,aAAanlI,IAAIwF,EAAE+0G,OAAO,IAAIj6G,GAAE,EAAGgkI,GAAGtuH,GAAE,GAAIxQ,EAAEkwH,MAAM,SAAS1/G,EAAEiuH,aAAa91B,EAAE0M,QAAQr1G,EAAE8wC,MAAM9wC,EAAE8wC,MAAM63D,IAAa,QAATnuG,EAAEgW,EAAE6iD,MAAc74D,EAAE66G,QAAQ1M,EAAE3oG,EAAE8wC,MAAM63D,EAAEn4F,EAAE6iD,KAAKs1C,EAAE,CAAC,OAAG,OAAOn4F,EAAE0vF,MAAYlgG,EAAEwQ,EAAE0vF,KAAK1vF,EAAEkuH,UAC9e1+H,EAAEwQ,EAAE0vF,KAAKlgG,EAAEq1G,QAAQ7kG,EAAEmuH,mBAAmB3oB,KAAIh2G,EAAEq1G,QAAQ,KAAK76G,EAAE06H,GAAElxH,QAAQ0nH,GAAEwJ,GAAEp6H,EAAI,EAAFN,EAAI,EAAI,EAAFA,GAAKwF,IAAE++H,GAAE/+H,GAAU,MAAK,KAAK,GAAG,KAAK,GAAG,OAAO4/H,KAAK9kI,EAAE,OAAOkF,EAAEi1G,cAAc,OAAOl1G,GAAG,OAAOA,EAAEk1G,gBAAgBn6G,IAAIkF,EAAE+0G,OAAO,MAAMj6G,GAAG,KAAY,EAAPkF,EAAE6R,MAAQ,KAAQ,WAAH6qH,MAAiBqC,GAAE/+H,GAAkB,EAAfA,EAAEs+H,eAAiBt+H,EAAE+0G,OAAO,OAAOgqB,GAAE/+H,GAAG,KAAK,KAAK,GAAe,KAAK,GAAG,OAAO,KAAK,MAAMiH,MAAMG,EAAE,IAAIpH,EAAE3D,KAAM,CAClX,SAASwjI,GAAG9/H,EAAEC,GAAS,OAAN6tH,GAAG7tH,GAAUA,EAAE3D,KAAK,KAAK,EAAE,OAAO8vH,GAAGnsH,EAAEyG,OAAO4lH,KAAiB,OAAZtsH,EAAEC,EAAE+0G,QAAe/0G,EAAE+0G,OAAS,MAAHh1G,EAAS,IAAIC,GAAG,KAAK,KAAK,EAAE,OAAO+0H,KAAKtJ,GAAEI,IAAIJ,GAAEG,IAAG0J,KAAe,KAAO,OAAjBv1H,EAAEC,EAAE+0G,SAAqB,KAAO,IAAFh1G,IAAQC,EAAE+0G,OAAS,MAAHh1G,EAAS,IAAIC,GAAG,KAAK,KAAK,EAAE,OAAOi1H,GAAGj1H,GAAG,KAAK,KAAK,GAA0B,GAAvByrH,GAAEyJ,IAAwB,QAArBn1H,EAAEC,EAAEi1G,gBAA2B,OAAOl1G,EAAEm1G,WAAW,CAAC,GAAG,OAAOl1G,EAAE60G,UAAU,MAAM5tG,MAAMG,EAAE,MAAM6nH,IAAI,CAAW,OAAS,OAAnBlvH,EAAEC,EAAE+0G,QAAsB/0G,EAAE+0G,OAAS,MAAHh1G,EAAS,IAAIC,GAAG,KAAK,KAAK,GAAG,OAAOyrH,GAAEyJ,IAAG,KAAK,KAAK,EAAE,OAAOH,KAAK,KAAK,KAAK,GAAG,OAAOpF,GAAG3vH,EAAEyG,KAAKqlG,UAAU,KAAK,KAAK,GAAG,KAAK,GAAG,OAAO8zB,KAC1gB,KAAyB,QAAQ,OAAO,KAAK,CArB7CvC,GAAG,SAASt9H,EAAEC,GAAG,IAAI,IAAIxF,EAAEwF,EAAE8wC,MAAM,OAAOt2C,GAAG,CAAC,GAAG,IAAIA,EAAE6B,KAAK,IAAI7B,EAAE6B,IAAI0D,EAAEkG,YAAYzL,EAAEi5G,gBAAgB,GAAG,IAAIj5G,EAAE6B,KAAK,OAAO7B,EAAEs2C,MAAM,CAACt2C,EAAEs2C,MAAMgkE,OAAOt6G,EAAEA,EAAEA,EAAEs2C,MAAM,QAAQ,CAAC,GAAGt2C,IAAIwF,EAAE,MAAM,KAAK,OAAOxF,EAAE66G,SAAS,CAAC,GAAG,OAAO76G,EAAEs6G,QAAQt6G,EAAEs6G,SAAS90G,EAAE,OAAOxF,EAAEA,EAAEs6G,MAAM,CAACt6G,EAAE66G,QAAQP,OAAOt6G,EAAEs6G,OAAOt6G,EAAEA,EAAE66G,OAAO,CAAC,EAAEioB,GAAG,WAAW,EACxTC,GAAG,SAASx9H,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAExK,EAAEgvH,cAAc,GAAGxkH,IAAIzP,EAAE,CAACiF,EAAEC,EAAEyzG,UAAUmhB,GAAGH,GAAGzwH,SAAS,IAA4R2kG,EAAxRn4F,EAAE,KAAK,OAAOhW,GAAG,IAAK,QAAQ+P,EAAE0iG,EAAGltG,EAAEwK,GAAGzP,EAAEmyG,EAAGltG,EAAEjF,GAAG0V,EAAE,GAAG,MAAM,IAAK,SAASjG,EAAE0gG,EAAE,CAAC,EAAE1gG,EAAE,CAAC/D,WAAM,IAAS1L,EAAEmwG,EAAE,CAAC,EAAEnwG,EAAE,CAAC0L,WAAM,IAASgK,EAAE,GAAG,MAAM,IAAK,WAAWjG,EAAE0jG,GAAGluG,EAAEwK,GAAGzP,EAAEmzG,GAAGluG,EAAEjF,GAAG0V,EAAE,GAAG,MAAM,QAAQ,oBAAoBjG,EAAE80H,SAAS,oBAAoBvkI,EAAEukI,UAAUt/H,EAAEu/H,QAAQpV,IAAyB,IAAI1e,KAAzBqH,GAAGr4G,EAAEM,GAASN,EAAE,KAAc+P,EAAE,IAAIzP,EAAEgQ,eAAe0gG,IAAIjhG,EAAEO,eAAe0gG,IAAI,MAAMjhG,EAAEihG,GAAG,GAAG,UAAUA,EAAE,CAAC,IAAIjxE,EAAEhwB,EAAEihG,GAAG,IAAI7C,KAAKpuE,EAAEA,EAAEzvB,eAAe69F,KACjfnuG,IAAIA,EAAE,CAAC,GAAGA,EAAEmuG,GAAG,GAAG,KAAK,4BAA4B6C,GAAG,aAAaA,GAAG,mCAAmCA,GAAG,6BAA6BA,GAAG,cAAcA,IAAIrD,EAAGr9F,eAAe0gG,GAAGh7F,IAAIA,EAAE,KAAKA,EAAEA,GAAG,IAAI9R,KAAK8sG,EAAE,OAAO,IAAIA,KAAK1wG,EAAE,CAAC,IAAIsU,EAAEtU,EAAE0wG,GAAyB,GAAtBjxE,EAAE,MAAMhwB,EAAEA,EAAEihG,QAAG,EAAU1wG,EAAEgQ,eAAe0gG,IAAIp8F,IAAImrB,IAAI,MAAMnrB,GAAG,MAAMmrB,GAAG,GAAG,UAAUixE,EAAE,GAAGjxE,EAAE,CAAC,IAAIouE,KAAKpuE,GAAGA,EAAEzvB,eAAe69F,IAAIv5F,GAAGA,EAAEtE,eAAe69F,KAAKnuG,IAAIA,EAAE,CAAC,GAAGA,EAAEmuG,GAAG,IAAI,IAAIA,KAAKv5F,EAAEA,EAAEtE,eAAe69F,IAAIpuE,EAAEouE,KAAKv5F,EAAEu5F,KAAKnuG,IAAIA,EAAE,CAAC,GAAGA,EAAEmuG,GAAGv5F,EAAEu5F,GAAG,MAAMnuG,IAAIgW,IAAIA,EAAE,IAAIA,EAAE9R,KAAK8sG,EACpfhxG,IAAIA,EAAE4U,MAAM,4BAA4Bo8F,GAAGp8F,EAAEA,EAAEA,EAAEk7G,YAAO,EAAO/vF,EAAEA,EAAEA,EAAE+vF,YAAO,EAAO,MAAMl7G,GAAGmrB,IAAInrB,IAAIoB,EAAEA,GAAG,IAAI9R,KAAK8sG,EAAEp8F,IAAI,aAAao8F,EAAE,kBAAkBp8F,GAAG,kBAAkBA,IAAIoB,EAAEA,GAAG,IAAI9R,KAAK8sG,EAAE,GAAGp8F,GAAG,mCAAmCo8F,GAAG,6BAA6BA,IAAIrD,EAAGr9F,eAAe0gG,IAAI,MAAMp8F,GAAG,aAAao8F,GAAG8c,GAAE,SAASvoH,GAAGyQ,GAAG+pB,IAAInrB,IAAIoB,EAAE,MAAMA,EAAEA,GAAG,IAAI9R,KAAK8sG,EAAEp8F,GAAG,CAAC5U,IAAIgW,EAAEA,GAAG,IAAI9R,KAAK,QAAQlE,GAAG,IAAIgxG,EAAEh7F,GAAKxQ,EAAE6wH,YAAYrlB,KAAExrG,EAAE+0G,OAAO,EAAC,CAAC,EAAEyoB,GAAG,SAASz9H,EAAEC,EAAExF,EAAEM,GAAGN,IAAIM,IAAIkF,EAAE+0G,OAAO,EAAE,EAkBlb,IAAI+qB,IAAG,EAAGC,IAAE,EAAGC,GAAG,oBAAoBC,QAAQA,QAAQrrH,IAAIsrH,GAAE,KAAK,SAASC,GAAGpgI,EAAEC,GAAG,IAAIxF,EAAEuF,EAAEy7D,IAAI,GAAG,OAAOhhE,EAAE,GAAG,oBAAoBA,EAAE,IAAIA,EAAE,KAAK,CAAC,MAAMM,GAAGwV,GAAEvQ,EAAEC,EAAElF,EAAE,MAAMN,EAAEwJ,QAAQ,IAAI,CAAC,SAASo8H,GAAGrgI,EAAEC,EAAExF,GAAG,IAAIA,GAAG,CAAC,MAAMM,GAAGwV,GAAEvQ,EAAEC,EAAElF,EAAE,CAAC,CAAC,IAAIulI,IAAG,EAIxR,SAASC,GAAGvgI,EAAEC,EAAExF,GAAG,IAAIM,EAAEkF,EAAE6wH,YAAyC,GAAG,QAAhC/1H,EAAE,OAAOA,EAAEA,EAAEg9H,WAAW,MAAiB,CAAC,IAAIvtH,EAAEzP,EAAEA,EAAEo1C,KAAK,EAAE,CAAC,IAAI3lC,EAAElO,IAAI0D,KAAKA,EAAE,CAAC,IAAIyQ,EAAEjG,EAAE6tH,QAAQ7tH,EAAE6tH,aAAQ,OAAO,IAAS5nH,GAAG4vH,GAAGpgI,EAAExF,EAAEgW,EAAE,CAACjG,EAAEA,EAAE2lC,IAAI,OAAO3lC,IAAIzP,EAAE,CAAC,CAAC,SAASylI,GAAGxgI,EAAEC,GAAgD,GAAG,QAAhCA,EAAE,QAAlBA,EAAEA,EAAE6wH,aAAuB7wH,EAAE83H,WAAW,MAAiB,CAAC,IAAIt9H,EAAEwF,EAAEA,EAAEkwC,KAAK,EAAE,CAAC,IAAI11C,EAAE6B,IAAI0D,KAAKA,EAAE,CAAC,IAAIjF,EAAEN,EAAEiT,OAAOjT,EAAE49H,QAAQt9H,GAAG,CAACN,EAAEA,EAAE01C,IAAI,OAAO11C,IAAIwF,EAAE,CAAC,CAAC,SAASwgI,GAAGzgI,GAAG,IAAIC,EAAED,EAAEy7D,IAAI,GAAG,OAAOx7D,EAAE,CAAC,IAAIxF,EAAEuF,EAAE0zG,UAAiB1zG,EAAE1D,IAA8B0D,EAAEvF,EAAE,oBAAoBwF,EAAEA,EAAED,GAAGC,EAAEgE,QAAQjE,CAAC,CAAC,CAClf,SAAS0gI,GAAG1gI,GAAG,IAAIC,EAAED,EAAE80G,UAAU,OAAO70G,IAAID,EAAE80G,UAAU,KAAK4rB,GAAGzgI,IAAID,EAAE+wC,MAAM,KAAK/wC,EAAEsuH,UAAU,KAAKtuH,EAAEs1G,QAAQ,KAAK,IAAIt1G,EAAE1D,MAAoB,QAAd2D,EAAED,EAAE0zG,oBAA4BzzG,EAAEkrH,WAAWlrH,EAAEmrH,WAAWnrH,EAAEuoH,WAAWvoH,EAAEorH,WAAWprH,EAAEqrH,MAAMtrH,EAAE0zG,UAAU,KAAK1zG,EAAE+0G,OAAO,KAAK/0G,EAAEiwH,aAAa,KAAKjwH,EAAEgvH,cAAc,KAAKhvH,EAAEk1G,cAAc,KAAKl1G,EAAEwuH,aAAa,KAAKxuH,EAAE0zG,UAAU,KAAK1zG,EAAE8wH,YAAY,IAAI,CAAC,SAAS6P,GAAG3gI,GAAG,OAAO,IAAIA,EAAE1D,KAAK,IAAI0D,EAAE1D,KAAK,IAAI0D,EAAE1D,GAAG,CACna,SAASskI,GAAG5gI,GAAGA,EAAE,OAAO,CAAC,KAAK,OAAOA,EAAEs1G,SAAS,CAAC,GAAG,OAAOt1G,EAAE+0G,QAAQ4rB,GAAG3gI,EAAE+0G,QAAQ,OAAO,KAAK/0G,EAAEA,EAAE+0G,MAAM,CAA2B,IAA1B/0G,EAAEs1G,QAAQP,OAAO/0G,EAAE+0G,OAAW/0G,EAAEA,EAAEs1G,QAAQ,IAAIt1G,EAAE1D,KAAK,IAAI0D,EAAE1D,KAAK,KAAK0D,EAAE1D,KAAK,CAAC,GAAW,EAAR0D,EAAEg1G,MAAQ,SAASh1G,EAAE,GAAG,OAAOA,EAAE+wC,OAAO,IAAI/wC,EAAE1D,IAAI,SAAS0D,EAAOA,EAAE+wC,MAAMgkE,OAAO/0G,EAAEA,EAAEA,EAAE+wC,KAAK,CAAC,KAAa,EAAR/wC,EAAEg1G,OAAS,OAAOh1G,EAAE0zG,SAAS,CAAC,CACzT,SAASmtB,GAAG7gI,EAAEC,EAAExF,GAAG,IAAIM,EAAEiF,EAAE1D,IAAI,GAAG,IAAIvB,GAAG,IAAIA,EAAEiF,EAAEA,EAAE0zG,UAAUzzG,EAAE,IAAIxF,EAAEm4E,SAASn4E,EAAE05B,WAAW2sG,aAAa9gI,EAAEC,GAAGxF,EAAEqmI,aAAa9gI,EAAEC,IAAI,IAAIxF,EAAEm4E,UAAU3yE,EAAExF,EAAE05B,YAAa2sG,aAAa9gI,EAAEvF,IAAKwF,EAAExF,GAAIyL,YAAYlG,GAA4B,QAAxBvF,EAAEA,EAAEsmI,2BAA8B,IAAStmI,GAAG,OAAOwF,EAAEs/H,UAAUt/H,EAAEs/H,QAAQpV,UAAU,GAAG,IAAIpvH,GAAc,QAAViF,EAAEA,EAAE+wC,OAAgB,IAAI8vF,GAAG7gI,EAAEC,EAAExF,GAAGuF,EAAEA,EAAEs1G,QAAQ,OAAOt1G,GAAG6gI,GAAG7gI,EAAEC,EAAExF,GAAGuF,EAAEA,EAAEs1G,OAAO,CAC1X,SAAS0rB,GAAGhhI,EAAEC,EAAExF,GAAG,IAAIM,EAAEiF,EAAE1D,IAAI,GAAG,IAAIvB,GAAG,IAAIA,EAAEiF,EAAEA,EAAE0zG,UAAUzzG,EAAExF,EAAEqmI,aAAa9gI,EAAEC,GAAGxF,EAAEyL,YAAYlG,QAAQ,GAAG,IAAIjF,GAAc,QAAViF,EAAEA,EAAE+wC,OAAgB,IAAIiwF,GAAGhhI,EAAEC,EAAExF,GAAGuF,EAAEA,EAAEs1G,QAAQ,OAAOt1G,GAAGghI,GAAGhhI,EAAEC,EAAExF,GAAGuF,EAAEA,EAAEs1G,OAAO,CAAC,IAAI2rB,GAAE,KAAKC,IAAG,EAAG,SAASC,GAAGnhI,EAAEC,EAAExF,GAAG,IAAIA,EAAEA,EAAEs2C,MAAM,OAAOt2C,GAAG2mI,GAAGphI,EAAEC,EAAExF,GAAGA,EAAEA,EAAE66G,OAAO,CACnR,SAAS8rB,GAAGphI,EAAEC,EAAExF,GAAG,GAAGu8G,IAAI,oBAAoBA,GAAGqqB,qBAAqB,IAAIrqB,GAAGqqB,qBAAqBtqB,GAAGt8G,EAAE,CAAC,MAAM+/B,GAAG,CAAC,OAAO//B,EAAE6B,KAAK,KAAK,EAAE0jI,IAAGI,GAAG3lI,EAAEwF,GAAG,KAAK,EAAE,IAAIlF,EAAEkmI,GAAEz2H,EAAE02H,GAAGD,GAAE,KAAKE,GAAGnhI,EAAEC,EAAExF,GAAOymI,GAAG12H,EAAE,QAATy2H,GAAElmI,KAAkBmmI,IAAIlhI,EAAEihI,GAAExmI,EAAEA,EAAEi5G,UAAU,IAAI1zG,EAAE4yE,SAAS5yE,EAAEm0B,WAAWjD,YAAYz2B,GAAGuF,EAAEkxB,YAAYz2B,IAAIwmI,GAAE/vG,YAAYz2B,EAAEi5G,YAAY,MAAM,KAAK,GAAG,OAAOutB,KAAIC,IAAIlhI,EAAEihI,GAAExmI,EAAEA,EAAEi5G,UAAU,IAAI1zG,EAAE4yE,SAASk4C,GAAG9qH,EAAEm0B,WAAW15B,GAAG,IAAIuF,EAAE4yE,UAAUk4C,GAAG9qH,EAAEvF,GAAG8/G,GAAGv6G,IAAI8qH,GAAGmW,GAAExmI,EAAEi5G,YAAY,MAAM,KAAK,EAAE34G,EAAEkmI,GAAEz2H,EAAE02H,GAAGD,GAAExmI,EAAEi5G,UAAUsG,cAAcknB,IAAG,EAClfC,GAAGnhI,EAAEC,EAAExF,GAAGwmI,GAAElmI,EAAEmmI,GAAG12H,EAAE,MAAM,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,IAAIw1H,KAAoB,QAAhBjlI,EAAEN,EAAEq2H,cAAsC,QAAf/1H,EAAEA,EAAEg9H,aAAsB,CAACvtH,EAAEzP,EAAEA,EAAEo1C,KAAK,EAAE,CAAC,IAAI1/B,EAAEjG,EAAEo+F,EAAEn4F,EAAE4nH,QAAQ5nH,EAAEA,EAAEnU,SAAI,IAASssG,IAAI,KAAO,EAAFn4F,IAAe,KAAO,EAAFA,KAAf4vH,GAAG5lI,EAAEwF,EAAE2oG,GAAyBp+F,EAAEA,EAAE2lC,IAAI,OAAO3lC,IAAIzP,EAAE,CAAComI,GAAGnhI,EAAEC,EAAExF,GAAG,MAAM,KAAK,EAAE,IAAIulI,KAAII,GAAG3lI,EAAEwF,GAAiB,oBAAdlF,EAAEN,EAAEi5G,WAAgC4tB,sBAAsB,IAAIvmI,EAAEkX,MAAMxX,EAAEu0H,cAAcj0H,EAAEiI,MAAMvI,EAAEy6G,cAAcn6G,EAAEumI,sBAAsB,CAAC,MAAM9mG,GAAGjqB,GAAE9V,EAAEwF,EAAEu6B,EAAE,CAAC2mG,GAAGnhI,EAAEC,EAAExF,GAAG,MAAM,KAAK,GAAG0mI,GAAGnhI,EAAEC,EAAExF,GAAG,MAAM,KAAK,GAAU,EAAPA,EAAEqX,MAAQkuH,IAAGjlI,EAAEilI,KAAI,OAChfvlI,EAAEy6G,cAAcisB,GAAGnhI,EAAEC,EAAExF,GAAGulI,GAAEjlI,GAAGomI,GAAGnhI,EAAEC,EAAExF,GAAG,MAAM,QAAQ0mI,GAAGnhI,EAAEC,EAAExF,GAAG,CAAC,SAAS8mI,GAAGvhI,GAAG,IAAIC,EAAED,EAAE8wH,YAAY,GAAG,OAAO7wH,EAAE,CAACD,EAAE8wH,YAAY,KAAK,IAAIr2H,EAAEuF,EAAE0zG,UAAU,OAAOj5G,IAAIA,EAAEuF,EAAE0zG,UAAU,IAAIusB,IAAIhgI,EAAE+D,SAAQ,SAAS/D,GAAG,IAAIlF,EAAEymI,GAAGx7G,KAAK,KAAKhmB,EAAEC,GAAGxF,EAAEsY,IAAI9S,KAAKxF,EAAEqa,IAAI7U,GAAGA,EAAE4a,KAAK9f,EAAEA,GAAG,GAAE,CAAC,CACzQ,SAAS0mI,GAAGzhI,EAAEC,GAAG,IAAIxF,EAAEwF,EAAEquH,UAAU,GAAG,OAAO7zH,EAAE,IAAI,IAAIM,EAAE,EAAEA,EAAEN,EAAET,OAAOe,IAAI,CAAC,IAAIyP,EAAE/P,EAAEM,GAAG,IAAI,IAAI0V,EAAEzQ,EAAE4oG,EAAE3oG,EAAEu6B,EAAEouE,EAAE5oG,EAAE,KAAK,OAAOw6B,GAAG,CAAC,OAAOA,EAAEl+B,KAAK,KAAK,EAAE2kI,GAAEzmG,EAAEk5E,UAAUwtB,IAAG,EAAG,MAAMlhI,EAAE,KAAK,EAA4C,KAAK,EAAEihI,GAAEzmG,EAAEk5E,UAAUsG,cAAcknB,IAAG,EAAG,MAAMlhI,EAAEw6B,EAAEA,EAAEu6E,MAAM,CAAC,GAAG,OAAOksB,GAAE,MAAM/5H,MAAMG,EAAE,MAAM+5H,GAAG3wH,EAAEm4F,EAAEp+F,GAAGy2H,GAAE,KAAKC,IAAG,EAAG,IAAI7xH,EAAE7E,EAAEsqG,UAAU,OAAOzlG,IAAIA,EAAE0lG,OAAO,MAAMvqG,EAAEuqG,OAAO,IAAI,CAAC,MAAMtJ,GAAGl7F,GAAE/F,EAAEvK,EAAEwrG,EAAE,CAAC,CAAC,GAAkB,MAAfxrG,EAAEs+H,aAAmB,IAAIt+H,EAAEA,EAAE8wC,MAAM,OAAO9wC,GAAGyhI,GAAGzhI,EAAED,GAAGC,EAAEA,EAAEq1G,OAAO,CACje,SAASosB,GAAG1hI,EAAEC,GAAG,IAAIxF,EAAEuF,EAAE80G,UAAU/5G,EAAEiF,EAAEg1G,MAAM,OAAOh1G,EAAE1D,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAiB,GAAdmlI,GAAGxhI,EAAED,GAAG2hI,GAAG3hI,GAAQ,EAAFjF,EAAI,CAAC,IAAIwlI,GAAG,EAAEvgI,EAAEA,EAAE+0G,QAAQyrB,GAAG,EAAExgI,EAAE,CAAC,MAAMwQ,GAAGD,GAAEvQ,EAAEA,EAAE+0G,OAAOvkG,EAAE,CAAC,IAAI+vH,GAAG,EAAEvgI,EAAEA,EAAE+0G,OAAO,CAAC,MAAMvkG,GAAGD,GAAEvQ,EAAEA,EAAE+0G,OAAOvkG,EAAE,CAAC,CAAC,MAAM,KAAK,EAAEixH,GAAGxhI,EAAED,GAAG2hI,GAAG3hI,GAAK,IAAFjF,GAAO,OAAON,GAAG2lI,GAAG3lI,EAAEA,EAAEs6G,QAAQ,MAAM,KAAK,EAAgD,GAA9C0sB,GAAGxhI,EAAED,GAAG2hI,GAAG3hI,GAAK,IAAFjF,GAAO,OAAON,GAAG2lI,GAAG3lI,EAAEA,EAAEs6G,QAAmB,GAAR/0G,EAAEg1G,MAAS,CAAC,IAAIxqG,EAAExK,EAAE0zG,UAAU,IAAI3E,GAAGvkG,EAAE,GAAG,CAAC,MAAMgG,GAAGD,GAAEvQ,EAAEA,EAAE+0G,OAAOvkG,EAAE,CAAC,CAAC,GAAK,EAAFzV,GAAoB,OAAdyP,EAAExK,EAAE0zG,WAAmB,CAAC,IAAIjjG,EAAEzQ,EAAEgvH,cAAcpmB,EAAE,OAAOnuG,EAAEA,EAAEu0H,cAAcv+G,EAAE+pB,EAAEx6B,EAAE0G,KAAK2I,EAAErP,EAAE8wH,YACje,GAAnB9wH,EAAE8wH,YAAY,KAAQ,OAAOzhH,EAAE,IAAI,UAAUmrB,GAAG,UAAU/pB,EAAE/J,MAAM,MAAM+J,EAAEvW,MAAMuzG,EAAGjjG,EAAEiG,GAAGsiG,GAAGv4E,EAAEouE,GAAG,IAAI6C,EAAEsH,GAAGv4E,EAAE/pB,GAAG,IAAIm4F,EAAE,EAAEA,EAAEv5F,EAAErV,OAAO4uG,GAAG,EAAE,CAAC,IAAItzE,EAAEjmB,EAAEu5F,GAAG1mE,EAAE7yB,EAAEu5F,EAAE,GAAG,UAAUtzE,EAAEy8E,GAAGvnG,EAAE03B,GAAG,4BAA4B5M,EAAEm5E,GAAGjkG,EAAE03B,GAAG,aAAa5M,EAAEy5E,GAAGvkG,EAAE03B,GAAGqnE,EAAG/+F,EAAE8qB,EAAE4M,EAAEupE,EAAE,CAAC,OAAOjxE,GAAG,IAAK,QAAQkzE,EAAGljG,EAAEiG,GAAG,MAAM,IAAK,WAAW29F,GAAG5jG,EAAEiG,GAAG,MAAM,IAAK,SAAS,IAAIqxB,EAAEt3B,EAAE4iG,cAAc+xB,YAAY30H,EAAE4iG,cAAc+xB,cAAc1uH,EAAE2uH,SAAS,IAAItN,EAAErhH,EAAEhK,MAAM,MAAMqrH,EAAEhkB,GAAGtjG,IAAIiG,EAAE2uH,SAAStN,GAAE,GAAIhwF,MAAMrxB,EAAE2uH,WAAW,MAAM3uH,EAAEwgF,aAAa6c,GAAGtjG,IAAIiG,EAAE2uH,SACnf3uH,EAAEwgF,cAAa,GAAI6c,GAAGtjG,IAAIiG,EAAE2uH,SAAS3uH,EAAE2uH,SAAS,GAAG,IAAG,IAAK50H,EAAE4gH,IAAI36G,CAAC,CAAC,MAAMD,GAAGD,GAAEvQ,EAAEA,EAAE+0G,OAAOvkG,EAAE,CAAC,CAAC,MAAM,KAAK,EAAgB,GAAdixH,GAAGxhI,EAAED,GAAG2hI,GAAG3hI,GAAQ,EAAFjF,EAAI,CAAC,GAAG,OAAOiF,EAAE0zG,UAAU,MAAMxsG,MAAMG,EAAE,MAAMmD,EAAExK,EAAE0zG,UAAUjjG,EAAEzQ,EAAEgvH,cAAc,IAAIxkH,EAAEykG,UAAUx+F,CAAC,CAAC,MAAMD,GAAGD,GAAEvQ,EAAEA,EAAE+0G,OAAOvkG,EAAE,CAAC,CAAC,MAAM,KAAK,EAAgB,GAAdixH,GAAGxhI,EAAED,GAAG2hI,GAAG3hI,GAAQ,EAAFjF,GAAK,OAAON,GAAGA,EAAEy6G,cAAc6E,aAAa,IAAIQ,GAAGt6G,EAAE+5G,cAAc,CAAC,MAAMxpG,GAAGD,GAAEvQ,EAAEA,EAAE+0G,OAAOvkG,EAAE,CAAC,MAAM,KAAK,EAG4G,QAAQixH,GAAGxhI,EACnfD,GAAG2hI,GAAG3hI,SAJ4Y,KAAK,GAAGyhI,GAAGxhI,EAAED,GAAG2hI,GAAG3hI,GAAqB,MAAlBwK,EAAExK,EAAE+wC,OAAQikE,QAAavkG,EAAE,OAAOjG,EAAE0qG,cAAc1qG,EAAEkpG,UAAUkuB,SAASnxH,GAAGA,GAClf,OAAOjG,EAAEsqG,WAAW,OAAOtqG,EAAEsqG,UAAUI,gBAAgB2sB,GAAG5rB,OAAQ,EAAFl7G,GAAKwmI,GAAGvhI,GAAG,MAAM,KAAK,GAAsF,GAAnFs1B,EAAE,OAAO76B,GAAG,OAAOA,EAAEy6G,cAAqB,EAAPl1G,EAAE8R,MAAQkuH,IAAGv0B,EAAEu0B,KAAI1qG,EAAEmsG,GAAGxhI,EAAED,GAAGggI,GAAEv0B,GAAGg2B,GAAGxhI,EAAED,GAAG2hI,GAAG3hI,GAAQ,KAAFjF,EAAO,CAA0B,GAAzB0wG,EAAE,OAAOzrG,EAAEk1G,eAAkBl1G,EAAE0zG,UAAUkuB,SAASn2B,KAAKn2E,GAAG,KAAY,EAAPt1B,EAAE8R,MAAQ,IAAIquH,GAAEngI,EAAEs1B,EAAEt1B,EAAE+wC,MAAM,OAAOzb,GAAG,CAAC,IAAI4M,EAAEi+F,GAAE7qG,EAAE,OAAO6qG,IAAG,CAAe,OAAVrO,GAAJhwF,EAAEq+F,IAAMpvF,MAAajP,EAAExlC,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,KAAK,GAAGikI,GAAG,EAAEz+F,EAAEA,EAAEizE,QAAQ,MAAM,KAAK,EAAEqrB,GAAGt+F,EAAEA,EAAEizE,QAAQ,IAAInkG,EAAEkxB,EAAE4xE,UAAU,GAAG,oBAAoB9iG,EAAE0wH,qBAAqB,CAACvmI,EAAE+mC,EAAErnC,EAAEqnC,EAAEizE,OAAO,IAAI90G,EAAElF,EAAE6V,EAAEqB,MACpfhS,EAAE+uH,cAAcp+G,EAAE5N,MAAM/C,EAAEi1G,cAActkG,EAAE0wH,sBAAsB,CAAC,MAAM9wH,GAAGD,GAAExV,EAAEN,EAAE+V,EAAE,CAAC,CAAC,MAAM,KAAK,EAAE4vH,GAAGt+F,EAAEA,EAAEizE,QAAQ,MAAM,KAAK,GAAG,GAAG,OAAOjzE,EAAEozE,cAAc,CAAC4sB,GAAG5/F,GAAG,QAAQ,EAAE,OAAO4vF,GAAGA,EAAE/c,OAAOjzE,EAAEq+F,GAAErO,GAAGgQ,GAAG5/F,EAAE,CAAC5M,EAAEA,EAAEggF,OAAO,CAACt1G,EAAE,IAAIs1B,EAAE,KAAK4M,EAAEliC,IAAI,CAAC,GAAG,IAAIkiC,EAAE5lC,KAAK,GAAG,OAAOg5B,EAAE,CAACA,EAAE4M,EAAE,IAAI13B,EAAE03B,EAAEwxE,UAAUjI,EAAa,oBAAVh7F,EAAEjG,EAAEknB,OAA4BsgF,YAAYvhG,EAAEuhG,YAAY,UAAU,OAAO,aAAavhG,EAAEkhB,QAAQ,QAAS6I,EAAE0H,EAAEwxE,UAAkC9K,OAAE,KAA1Bv5F,EAAE6yB,EAAE8sF,cAAct9F,QAAoB,OAAOriB,GAAGA,EAAEtE,eAAe,WAAWsE,EAAEsiB,QAAQ,KAAK6I,EAAE9I,MAAMC,QACzfmgF,GAAG,UAAUlJ,GAAG,CAAC,MAAMp4F,GAAGD,GAAEvQ,EAAEA,EAAE+0G,OAAOvkG,EAAE,CAAC,OAAO,GAAG,IAAI0xB,EAAE5lC,KAAK,GAAG,OAAOg5B,EAAE,IAAI4M,EAAEwxE,UAAUzE,UAAUxD,EAAE,GAAGvpE,EAAE8sF,aAAa,CAAC,MAAMx+G,GAAGD,GAAEvQ,EAAEA,EAAE+0G,OAAOvkG,EAAE,OAAO,IAAI,KAAK0xB,EAAE5lC,KAAK,KAAK4lC,EAAE5lC,KAAK,OAAO4lC,EAAEgzE,eAAehzE,IAAIliC,IAAI,OAAOkiC,EAAE6O,MAAM,CAAC7O,EAAE6O,MAAMgkE,OAAO7yE,EAAEA,EAAEA,EAAE6O,MAAM,QAAQ,CAAC,GAAG7O,IAAIliC,EAAE,MAAMA,EAAE,KAAK,OAAOkiC,EAAEozE,SAAS,CAAC,GAAG,OAAOpzE,EAAE6yE,QAAQ7yE,EAAE6yE,SAAS/0G,EAAE,MAAMA,EAAEs1B,IAAI4M,IAAI5M,EAAE,MAAM4M,EAAEA,EAAE6yE,MAAM,CAACz/E,IAAI4M,IAAI5M,EAAE,MAAM4M,EAAEozE,QAAQP,OAAO7yE,EAAE6yE,OAAO7yE,EAAEA,EAAEozE,OAAO,CAAC,CAAC,MAAM,KAAK,GAAGmsB,GAAGxhI,EAAED,GAAG2hI,GAAG3hI,GAAK,EAAFjF,GAAKwmI,GAAGvhI,GAAS,KAAK,IACtd,CAAC,SAAS2hI,GAAG3hI,GAAG,IAAIC,EAAED,EAAEg1G,MAAM,GAAK,EAAF/0G,EAAI,CAAC,IAAID,EAAE,CAAC,IAAI,IAAIvF,EAAEuF,EAAE+0G,OAAO,OAAOt6G,GAAG,CAAC,GAAGkmI,GAAGlmI,GAAG,CAAC,IAAIM,EAAEN,EAAE,MAAMuF,CAAC,CAACvF,EAAEA,EAAEs6G,MAAM,CAAC,MAAM7tG,MAAMG,EAAE,KAAM,CAAC,OAAOtM,EAAEuB,KAAK,KAAK,EAAE,IAAIkO,EAAEzP,EAAE24G,UAAkB,GAAR34G,EAAEi6G,QAAWjG,GAAGvkG,EAAE,IAAIzP,EAAEi6G,QAAQ,IAAgBgsB,GAAGhhI,EAAT4gI,GAAG5gI,GAAUwK,GAAG,MAAM,KAAK,EAAE,KAAK,EAAE,IAAIo+F,EAAE7tG,EAAE24G,UAAUsG,cAAsB6mB,GAAG7gI,EAAT4gI,GAAG5gI,GAAU4oG,GAAG,MAAM,QAAQ,MAAM1hG,MAAMG,EAAE,MAAO,CAAC,MAAMgI,GAAGkB,GAAEvQ,EAAEA,EAAE+0G,OAAO1lG,EAAE,CAACrP,EAAEg1G,QAAQ,CAAC,CAAG,KAAF/0G,IAASD,EAAEg1G,QAAQ,KAAK,CAAC,SAAS+sB,GAAG/hI,EAAEC,EAAExF,GAAG0lI,GAAEngI,EAAEgiI,GAAGhiI,EAAEC,EAAExF,EAAE,CACvb,SAASunI,GAAGhiI,EAAEC,EAAExF,GAAG,IAAI,IAAIM,EAAE,KAAY,EAAPiF,EAAE8R,MAAQ,OAAOquH,IAAG,CAAC,IAAI31H,EAAE21H,GAAE1vH,EAAEjG,EAAEumC,MAAM,GAAG,KAAKvmC,EAAElO,KAAKvB,EAAE,CAAC,IAAI6tG,EAAE,OAAOp+F,EAAE0qG,eAAe6qB,GAAG,IAAIn3B,EAAE,CAAC,IAAIpuE,EAAEhwB,EAAEsqG,UAAUzlG,EAAE,OAAOmrB,GAAG,OAAOA,EAAE06E,eAAe8qB,GAAExlG,EAAEulG,GAAG,IAAIt0B,EAAEu0B,GAAO,GAALD,GAAGn3B,GAAMo3B,GAAE3wH,KAAKo8F,EAAE,IAAI00B,GAAE31H,EAAE,OAAO21H,IAAO9wH,GAAJu5F,EAAEu3B,IAAMpvF,MAAM,KAAK63D,EAAEtsG,KAAK,OAAOssG,EAAEsM,cAAc+sB,GAAGz3H,GAAG,OAAO6E,GAAGA,EAAE0lG,OAAOnM,EAAEu3B,GAAE9wH,GAAG4yH,GAAGz3H,GAAG,KAAK,OAAOiG,GAAG0vH,GAAE1vH,EAAEuxH,GAAGvxH,EAAExQ,EAAExF,GAAGgW,EAAEA,EAAE6kG,QAAQ6qB,GAAE31H,EAAEu1H,GAAGvlG,EAAEwlG,GAAEv0B,CAAC,CAACy2B,GAAGliI,EAAM,MAAM,KAAoB,KAAfwK,EAAE+zH,eAAoB,OAAO9tH,GAAGA,EAAEskG,OAAOvqG,EAAE21H,GAAE1vH,GAAGyxH,GAAGliI,EAAM,CAAC,CACvc,SAASkiI,GAAGliI,GAAG,KAAK,OAAOmgI,IAAG,CAAC,IAAIlgI,EAAEkgI,GAAE,GAAG,KAAa,KAARlgI,EAAE+0G,OAAY,CAAC,IAAIv6G,EAAEwF,EAAE60G,UAAU,IAAI,GAAG,KAAa,KAAR70G,EAAE+0G,OAAY,OAAO/0G,EAAE3D,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG0jI,IAAGQ,GAAG,EAAEvgI,GAAG,MAAM,KAAK,EAAE,IAAIlF,EAAEkF,EAAEyzG,UAAU,GAAW,EAARzzG,EAAE+0G,QAAUgrB,GAAE,GAAG,OAAOvlI,EAAEM,EAAE24H,wBAAwB,CAAC,IAAIlpH,EAAEvK,EAAEouH,cAAcpuH,EAAEyG,KAAKjM,EAAEu0H,cAAcK,GAAGpvH,EAAEyG,KAAKjM,EAAEu0H,eAAej0H,EAAEkiI,mBAAmBzyH,EAAE/P,EAAEy6G,cAAcn6G,EAAEonI,oCAAoC,CAAC,IAAI1xH,EAAExQ,EAAE6wH,YAAY,OAAOrgH,GAAGuhH,GAAG/xH,EAAEwQ,EAAE1V,GAAG,MAAM,KAAK,EAAE,IAAI6tG,EAAE3oG,EAAE6wH,YAAY,GAAG,OAAOloB,EAAE,CAAQ,GAAPnuG,EAAE,KAAQ,OAAOwF,EAAE8wC,MAAM,OAAO9wC,EAAE8wC,MAAMz0C,KAAK,KAAK,EACvf,KAAK,EAAE7B,EAAEwF,EAAE8wC,MAAM2iE,UAAUse,GAAG/xH,EAAE2oG,EAAEnuG,EAAE,CAAC,MAAM,KAAK,EAAE,IAAI+/B,EAAEv6B,EAAEyzG,UAAU,GAAG,OAAOj5G,GAAW,EAARwF,EAAE+0G,MAAQ,CAACv6G,EAAE+/B,EAAE,IAAInrB,EAAEpP,EAAE+uH,cAAc,OAAO/uH,EAAEyG,MAAM,IAAK,SAAS,IAAK,QAAQ,IAAK,SAAS,IAAK,WAAW2I,EAAEowH,WAAWhlI,EAAEgsH,QAAQ,MAAM,IAAK,MAAMp3G,EAAEoiB,MAAMh3B,EAAEg3B,IAAIpiB,EAAEoiB,KAAK,CAAC,MAAM,KAAK,EAAQ,KAAK,EAAQ,KAAK,GAAyJ,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,KAAK,GAAG,MAAhM,KAAK,GAAG,GAAG,OAAOxxB,EAAEi1G,cAAc,CAAC,IAAIzJ,EAAExrG,EAAE60G,UAAU,GAAG,OAAOrJ,EAAE,CAAC,IAAIn2E,EAAEm2E,EAAEyJ,cAAc,GAAG,OAAO5/E,EAAE,CAAC,IAAI4M,EAAE5M,EAAE6/E,WAAW,OAAOjzE,GAAGq4E,GAAGr4E,EAAE,CAAC,CAAC,CAAC,MAC5c,QAAQ,MAAMh7B,MAAMG,EAAE,MAAO24H,IAAW,IAAR//H,EAAE+0G,OAAWyrB,GAAGxgI,EAAE,CAAC,MAAM6hC,GAAGvxB,GAAEtQ,EAAEA,EAAE80G,OAAOjzE,EAAE,CAAC,CAAC,GAAG7hC,IAAID,EAAE,CAACmgI,GAAE,KAAK,KAAK,CAAa,GAAG,QAAf1lI,EAAEwF,EAAEq1G,SAAoB,CAAC76G,EAAEs6G,OAAO90G,EAAE80G,OAAOorB,GAAE1lI,EAAE,KAAK,CAAC0lI,GAAElgI,EAAE80G,MAAM,CAAC,CAAC,SAAS+sB,GAAG9hI,GAAG,KAAK,OAAOmgI,IAAG,CAAC,IAAIlgI,EAAEkgI,GAAE,GAAGlgI,IAAID,EAAE,CAACmgI,GAAE,KAAK,KAAK,CAAC,IAAI1lI,EAAEwF,EAAEq1G,QAAQ,GAAG,OAAO76G,EAAE,CAACA,EAAEs6G,OAAO90G,EAAE80G,OAAOorB,GAAE1lI,EAAE,KAAK,CAAC0lI,GAAElgI,EAAE80G,MAAM,CAAC,CACvS,SAASktB,GAAGjiI,GAAG,KAAK,OAAOmgI,IAAG,CAAC,IAAIlgI,EAAEkgI,GAAE,IAAI,OAAOlgI,EAAE3D,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAG,IAAI7B,EAAEwF,EAAE80G,OAAO,IAAIyrB,GAAG,EAAEvgI,EAAE,CAAC,MAAMoP,GAAGkB,GAAEtQ,EAAExF,EAAE4U,EAAE,CAAC,MAAM,KAAK,EAAE,IAAItU,EAAEkF,EAAEyzG,UAAU,GAAG,oBAAoB34G,EAAE24H,kBAAkB,CAAC,IAAIlpH,EAAEvK,EAAE80G,OAAO,IAAIh6G,EAAE24H,mBAAmB,CAAC,MAAMrkH,GAAGkB,GAAEtQ,EAAEuK,EAAE6E,EAAE,CAAC,CAAC,IAAIoB,EAAExQ,EAAE80G,OAAO,IAAI0rB,GAAGxgI,EAAE,CAAC,MAAMoP,GAAGkB,GAAEtQ,EAAEwQ,EAAEpB,EAAE,CAAC,MAAM,KAAK,EAAE,IAAIu5F,EAAE3oG,EAAE80G,OAAO,IAAI0rB,GAAGxgI,EAAE,CAAC,MAAMoP,GAAGkB,GAAEtQ,EAAE2oG,EAAEv5F,EAAE,EAAE,CAAC,MAAMA,GAAGkB,GAAEtQ,EAAEA,EAAE80G,OAAO1lG,EAAE,CAAC,GAAGpP,IAAID,EAAE,CAACmgI,GAAE,KAAK,KAAK,CAAC,IAAI3lG,EAAEv6B,EAAEq1G,QAAQ,GAAG,OAAO96E,EAAE,CAACA,EAAEu6E,OAAO90G,EAAE80G,OAAOorB,GAAE3lG,EAAE,KAAK,CAAC2lG,GAAElgI,EAAE80G,MAAM,CAAC,CAC7d,IAwBkNqtB,GAxB9MC,GAAGx6G,KAAKoyD,KAAKqoD,GAAGv4B,EAAG2rB,uBAAuBpzD,GAAGynC,EAAG+xB,kBAAkByG,GAAGx4B,EAAG0Q,wBAAwBiX,GAAE,EAAEmG,GAAE,KAAK2K,GAAE,KAAKC,GAAE,EAAE9F,GAAG,EAAED,GAAGjR,GAAG,GAAGkU,GAAE,EAAE+C,GAAG,KAAK3Q,GAAG,EAAE4Q,GAAG,EAAEC,GAAG,EAAEC,GAAG,KAAKC,GAAG,KAAKjB,GAAG,EAAEjC,GAAGh4G,IAASm7G,GAAG,KAAK9H,IAAG,EAAGC,GAAG,KAAKI,GAAG,KAAK0H,IAAG,EAAGC,GAAG,KAAKC,GAAG,EAAEC,GAAG,EAAEC,GAAG,KAAKC,IAAI,EAAEC,GAAG,EAAE,SAAS9Q,KAAI,OAAO,KAAO,EAAFd,IAAKzb,MAAK,IAAIotB,GAAGA,GAAGA,GAAGptB,IAAG,CAChU,SAASwc,GAAGzyH,GAAG,OAAG,KAAY,EAAPA,EAAE8R,MAAe,EAAK,KAAO,EAAF4/G,KAAM,IAAI+Q,GAASA,IAAGA,GAAK,OAAOrT,GAAGxU,YAAkB,IAAI0oB,KAAKA,GAAGtrB,MAAMsrB,IAAU,KAAPtjI,EAAEq4G,IAAkBr4G,EAAiBA,OAAE,KAAjBA,EAAEnE,OAAO4kB,OAAmB,GAAGy6F,GAAGl7G,EAAE0G,KAAc,CAAC,SAASgsH,GAAG1yH,EAAEC,EAAExF,EAAEM,GAAG,GAAG,GAAGooI,GAAG,MAAMA,GAAG,EAAEC,GAAG,KAAKl8H,MAAMG,EAAE,MAAM6wG,GAAGl4G,EAAEvF,EAAEM,GAAM,KAAO,EAAF22H,KAAM1xH,IAAI63H,KAAE73H,IAAI63H,KAAI,KAAO,EAAFnG,MAAOiR,IAAIloI,GAAG,IAAIklI,IAAG4D,GAAGvjI,EAAEyiI,KAAIe,GAAGxjI,EAAEjF,GAAG,IAAIN,GAAG,IAAIi3H,IAAG,KAAY,EAAPzxH,EAAE6R,QAAU8tH,GAAG3pB,KAAI,IAAI6W,IAAIG,MAAK,CAC1Y,SAASuW,GAAGxjI,EAAEC,GAAG,IAAIxF,EAAEuF,EAAEyjI,cA5MzB,SAAYzjI,EAAEC,GAAG,IAAI,IAAIxF,EAAEuF,EAAE03G,eAAe38G,EAAEiF,EAAE23G,YAAYntG,EAAExK,EAAE0jI,gBAAgBjzH,EAAEzQ,EAAEy3G,aAAa,EAAEhnG,GAAG,CAAC,IAAIm4F,EAAE,GAAGqO,GAAGxmG,GAAG+pB,EAAE,GAAGouE,EAAEv5F,EAAE7E,EAAEo+F,IAAO,IAAIv5F,EAAM,KAAKmrB,EAAE//B,IAAI,KAAK+/B,EAAEz/B,KAAGyP,EAAEo+F,GAAGkP,GAAGt9E,EAAEv6B,IAAQoP,GAAGpP,IAAID,EAAE2jI,cAAcnpG,GAAG/pB,IAAI+pB,CAAC,CAAC,CA4MnLopG,CAAG5jI,EAAEC,GAAG,IAAIlF,EAAEy8G,GAAGx3G,EAAEA,IAAI63H,GAAE4K,GAAE,GAAG,GAAG,IAAI1nI,EAAE,OAAON,GAAGk7G,GAAGl7G,GAAGuF,EAAEyjI,aAAa,KAAKzjI,EAAE6jI,iBAAiB,OAAO,GAAG5jI,EAAElF,GAAGA,EAAEiF,EAAE6jI,mBAAmB5jI,EAAE,CAAgB,GAAf,MAAMxF,GAAGk7G,GAAGl7G,GAAM,IAAIwF,EAAE,IAAID,EAAE1D,IA7IsJ,SAAY0D,GAAG8sH,IAAG,EAAGE,GAAGhtH,EAAE,CA6I5K8jI,CAAGC,GAAG/9G,KAAK,KAAKhmB,IAAIgtH,GAAG+W,GAAG/9G,KAAK,KAAKhmB,IAAI2qH,IAAG,WAAW,KAAO,EAAF+G,KAAMzE,IAAI,IAAGxyH,EAAE,SAAS,CAAC,OAAO69G,GAAGv9G,IAAI,KAAK,EAAEN,EAAE47G,GAAG,MAAM,KAAK,EAAE57G,EAAE87G,GAAG,MAAM,KAAK,GAAwC,QAAQ97G,EAAEg8G,SAApC,KAAK,UAAUh8G,EAAEo8G,GAAsBp8G,EAAEupI,GAAGvpI,EAAEwpI,GAAGj+G,KAAK,KAAKhmB,GAAG,CAACA,EAAE6jI,iBAAiB5jI,EAAED,EAAEyjI,aAAahpI,CAAC,CAAC,CAC7c,SAASwpI,GAAGjkI,EAAEC,GAAc,GAAXojI,IAAI,EAAEC,GAAG,EAAK,KAAO,EAAF5R,IAAK,MAAMxqH,MAAMG,EAAE,MAAM,IAAI5M,EAAEuF,EAAEyjI,aAAa,GAAGS,MAAMlkI,EAAEyjI,eAAehpI,EAAE,OAAO,KAAK,IAAIM,EAAEy8G,GAAGx3G,EAAEA,IAAI63H,GAAE4K,GAAE,GAAG,GAAG,IAAI1nI,EAAE,OAAO,KAAK,GAAG,KAAO,GAAFA,IAAO,KAAKA,EAAEiF,EAAE2jI,eAAe1jI,EAAEA,EAAEkkI,GAAGnkI,EAAEjF,OAAO,CAACkF,EAAElF,EAAE,IAAIyP,EAAEknH,GAAEA,IAAG,EAAE,IAAIjhH,EAAE2zH,KAAgD,IAAxCvM,KAAI73H,GAAGyiI,KAAIxiI,IAAE8iI,GAAG,KAAKnD,GAAG3pB,KAAI,IAAIouB,GAAGrkI,EAAEC,UAAUqkI,KAAK,KAAK,CAAC,MAAM9pG,GAAG+pG,GAAGvkI,EAAEw6B,EAAE,CAAUm1F,KAAK2S,GAAGr+H,QAAQwM,EAAEihH,GAAElnH,EAAE,OAAOg4H,GAAEviI,EAAE,GAAG43H,GAAE,KAAK4K,GAAE,EAAExiI,EAAE0/H,GAAE,CAAC,GAAG,IAAI1/H,EAAE,CAAyC,GAAxC,IAAIA,IAAY,KAARuK,EAAEutG,GAAG/3G,MAAWjF,EAAEyP,EAAEvK,EAAEukI,GAAGxkI,EAAEwK,KAAQ,IAAIvK,EAAE,MAAMxF,EAAEioI,GAAG2B,GAAGrkI,EAAE,GAAGujI,GAAGvjI,EAAEjF,GAAGyoI,GAAGxjI,EAAEi2G,MAAKx7G,EAAE,GAAG,IAAIwF,EAAEsjI,GAAGvjI,EAAEjF,OAChf,CAAuB,GAAtByP,EAAExK,EAAEiE,QAAQ6wG,UAAa,KAAO,GAAF/5G,KAGnC,SAAYiF,GAAG,IAAI,IAAIC,EAAED,IAAI,CAAC,GAAW,MAARC,EAAE+0G,MAAY,CAAC,IAAIv6G,EAAEwF,EAAE6wH,YAAY,GAAG,OAAOr2H,GAAe,QAAXA,EAAEA,EAAEu9H,QAAiB,IAAI,IAAIj9H,EAAE,EAAEA,EAAEN,EAAET,OAAOe,IAAI,CAAC,IAAIyP,EAAE/P,EAAEM,GAAG0V,EAAEjG,EAAEktH,YAAYltH,EAAEA,EAAE/D,MAAM,IAAI,IAAIi+G,GAAGj0G,IAAIjG,GAAG,OAAM,CAAE,CAAC,MAAMo+F,GAAG,OAAM,CAAE,CAAC,CAAC,CAAW,GAAVnuG,EAAEwF,EAAE8wC,MAAwB,MAAf9wC,EAAEs+H,cAAoB,OAAO9jI,EAAEA,EAAEs6G,OAAO90G,EAAEA,EAAExF,MAAM,CAAC,GAAGwF,IAAID,EAAE,MAAM,KAAK,OAAOC,EAAEq1G,SAAS,CAAC,GAAG,OAAOr1G,EAAE80G,QAAQ90G,EAAE80G,SAAS/0G,EAAE,OAAM,EAAGC,EAAEA,EAAE80G,MAAM,CAAC90G,EAAEq1G,QAAQP,OAAO90G,EAAE80G,OAAO90G,EAAEA,EAAEq1G,OAAO,CAAC,CAAC,OAAM,CAAE,CAHvXmvB,CAAGj6H,KAAe,KAAVvK,EAAEkkI,GAAGnkI,EAAEjF,MAAmB,KAAR0V,EAAEsnG,GAAG/3G,MAAWjF,EAAE0V,EAAExQ,EAAEukI,GAAGxkI,EAAEyQ,KAAK,IAAIxQ,GAAG,MAAMxF,EAAEioI,GAAG2B,GAAGrkI,EAAE,GAAGujI,GAAGvjI,EAAEjF,GAAGyoI,GAAGxjI,EAAEi2G,MAAKx7G,EAAqC,OAAnCuF,EAAE0kI,aAAal6H,EAAExK,EAAE2kI,cAAc5pI,EAASkF,GAAG,KAAK,EAAE,KAAK,EAAE,MAAMiH,MAAMG,EAAE,MAAM,KAAK,EAC8B,KAAK,EAAEu9H,GAAG5kI,EAAE8iI,GAAGC,IAAI,MAD7B,KAAK,EAAU,GAARQ,GAAGvjI,EAAEjF,IAAS,UAAFA,KAAeA,GAAiB,IAAbkF,EAAE4hI,GAAG,IAAI5rB,MAAU,CAAC,GAAG,IAAIuB,GAAGx3G,EAAE,GAAG,MAAyB,KAAnBwK,EAAExK,EAAE03G,gBAAqB38G,KAAKA,EAAE,CAACy3H,KAAIxyH,EAAE23G,aAAa33G,EAAE03G,eAAeltG,EAAE,KAAK,CAACxK,EAAE6kI,cAAcra,GAAGoa,GAAG5+G,KAAK,KAAKhmB,EAAE8iI,GAAGC,IAAI9iI,GAAG,KAAK,CAAC2kI,GAAG5kI,EAAE8iI,GAAGC,IAAI,MAAM,KAAK,EAAU,GAARQ,GAAGvjI,EAAEjF,IAAS,QAAFA,KAC9eA,EAAE,MAAqB,IAAfkF,EAAED,EAAEm4G,WAAe3tG,GAAG,EAAE,EAAEzP,GAAG,CAAC,IAAI6tG,EAAE,GAAGqO,GAAGl8G,GAAG0V,EAAE,GAAGm4F,GAAEA,EAAE3oG,EAAE2oG,IAAKp+F,IAAIA,EAAEo+F,GAAG7tG,IAAI0V,CAAC,CAAqG,GAApG1V,EAAEyP,EAAqG,IAA3FzP,GAAG,KAAXA,EAAEk7G,KAAIl7G,GAAW,IAAI,IAAIA,EAAE,IAAI,KAAKA,EAAE,KAAK,KAAKA,EAAE,KAAK,IAAIA,EAAE,IAAI,KAAKA,EAAE,KAAK,KAAKsnI,GAAGtnI,EAAE,OAAOA,GAAU,CAACiF,EAAE6kI,cAAcra,GAAGoa,GAAG5+G,KAAK,KAAKhmB,EAAE8iI,GAAGC,IAAIhoI,GAAG,KAAK,CAAC6pI,GAAG5kI,EAAE8iI,GAAGC,IAAI,MAA+B,QAAQ,MAAM77H,MAAMG,EAAE,MAAO,CAAC,CAAW,OAAVm8H,GAAGxjI,EAAEi2G,MAAYj2G,EAAEyjI,eAAehpI,EAAEwpI,GAAGj+G,KAAK,KAAKhmB,GAAG,IAAI,CACrX,SAASwkI,GAAGxkI,EAAEC,GAAG,IAAIxF,EAAEooI,GAA2G,OAAxG7iI,EAAEiE,QAAQixG,cAAc6E,eAAesqB,GAAGrkI,EAAEC,GAAG+0G,OAAO,KAAe,KAAVh1G,EAAEmkI,GAAGnkI,EAAEC,MAAWA,EAAE6iI,GAAGA,GAAGroI,EAAE,OAAOwF,GAAGi/H,GAAGj/H,IAAWD,CAAC,CAAC,SAASk/H,GAAGl/H,GAAG,OAAO8iI,GAAGA,GAAG9iI,EAAE8iI,GAAGnkI,KAAK4a,MAAMupH,GAAG9iI,EAAE,CAE5L,SAASujI,GAAGvjI,EAAEC,GAAuD,IAApDA,IAAI2iI,GAAG3iI,IAAI0iI,GAAG3iI,EAAE03G,gBAAgBz3G,EAAED,EAAE23G,cAAc13G,EAAMD,EAAEA,EAAE0jI,gBAAgB,EAAEzjI,GAAG,CAAC,IAAIxF,EAAE,GAAGw8G,GAAGh3G,GAAGlF,EAAE,GAAGN,EAAEuF,EAAEvF,IAAI,EAAEwF,IAAIlF,CAAC,CAAC,CAAC,SAASgpI,GAAG/jI,GAAG,GAAG,KAAO,EAAF0xH,IAAK,MAAMxqH,MAAMG,EAAE,MAAM68H,KAAK,IAAIjkI,EAAEu3G,GAAGx3G,EAAE,GAAG,GAAG,KAAO,EAAFC,GAAK,OAAOujI,GAAGxjI,EAAEi2G,MAAK,KAAK,IAAIx7G,EAAE0pI,GAAGnkI,EAAEC,GAAG,GAAG,IAAID,EAAE1D,KAAK,IAAI7B,EAAE,CAAC,IAAIM,EAAEg9G,GAAG/3G,GAAG,IAAIjF,IAAIkF,EAAElF,EAAEN,EAAE+pI,GAAGxkI,EAAEjF,GAAG,CAAC,GAAG,IAAIN,EAAE,MAAMA,EAAEioI,GAAG2B,GAAGrkI,EAAE,GAAGujI,GAAGvjI,EAAEC,GAAGujI,GAAGxjI,EAAEi2G,MAAKx7G,EAAE,GAAG,IAAIA,EAAE,MAAMyM,MAAMG,EAAE,MAAiF,OAA3ErH,EAAE0kI,aAAa1kI,EAAEiE,QAAQ6wG,UAAU90G,EAAE2kI,cAAc1kI,EAAE2kI,GAAG5kI,EAAE8iI,GAAGC,IAAIS,GAAGxjI,EAAEi2G,MAAY,IAAI,CACvd,SAAS6uB,GAAG9kI,EAAEC,GAAG,IAAIxF,EAAEi3H,GAAEA,IAAG,EAAE,IAAI,OAAO1xH,EAAEC,EAAE,CAAC,QAAY,KAAJyxH,GAAEj3H,KAAUmlI,GAAG3pB,KAAI,IAAI6W,IAAIG,KAAK,CAAC,CAAC,SAAS8X,GAAG/kI,GAAG,OAAOijI,IAAI,IAAIA,GAAG3mI,KAAK,KAAO,EAAFo1H,KAAMwS,KAAK,IAAIjkI,EAAEyxH,GAAEA,IAAG,EAAE,IAAIj3H,EAAE8nI,GAAG3nB,WAAW7/G,EAAEs9G,GAAE,IAAI,GAAGkqB,GAAG3nB,WAAW,KAAKvC,GAAE,EAAEr4G,EAAE,OAAOA,GAAG,CAAC,QAAQq4G,GAAEt9G,EAAEwnI,GAAG3nB,WAAWngH,EAAM,KAAO,GAAXi3H,GAAEzxH,KAAagtH,IAAI,CAAC,CAAC,SAAS4S,KAAKlD,GAAGD,GAAGz4H,QAAQynH,GAAEgR,GAAG,CAChT,SAAS2H,GAAGrkI,EAAEC,GAAGD,EAAE0kI,aAAa,KAAK1kI,EAAE2kI,cAAc,EAAE,IAAIlqI,EAAEuF,EAAE6kI,cAAiD,IAAlC,IAAIpqI,IAAIuF,EAAE6kI,eAAe,EAAEpa,GAAGhwH,IAAO,OAAO+nI,GAAE,IAAI/nI,EAAE+nI,GAAEztB,OAAO,OAAOt6G,GAAG,CAAC,IAAIM,EAAEN,EAAQ,OAANqzH,GAAG/yH,GAAUA,EAAEuB,KAAK,KAAK,EAA6B,QAA3BvB,EAAEA,EAAE2L,KAAK2lH,yBAA4B,IAAStxH,GAAGuxH,KAAK,MAAM,KAAK,EAAE0I,KAAKtJ,GAAEI,IAAIJ,GAAEG,IAAG0J,KAAK,MAAM,KAAK,EAAEL,GAAGn6H,GAAG,MAAM,KAAK,EAAEi6H,KAAK,MAAM,KAAK,GAAc,KAAK,GAAGtJ,GAAEyJ,IAAG,MAAM,KAAK,GAAGvF,GAAG70H,EAAE2L,KAAKqlG,UAAU,MAAM,KAAK,GAAG,KAAK,GAAG8zB,KAAKplI,EAAEA,EAAEs6G,MAAM,CAAqE,GAApE8iB,GAAE73H,EAAEwiI,GAAExiI,EAAEi0H,GAAGj0H,EAAEiE,QAAQ,MAAMw+H,GAAE9F,GAAG18H,EAAE0/H,GAAE,EAAE+C,GAAG,KAAKE,GAAGD,GAAG5Q,GAAG,EAAE+Q,GAAGD,GAAG,KAAQ,OAAOtS,GAAG,CAAC,IAAItwH,EAC1f,EAAEA,EAAEswH,GAAGv2H,OAAOiG,IAAI,GAA2B,QAAhBlF,GAARN,EAAE81H,GAAGtwH,IAAOywH,aAAqB,CAACj2H,EAAEi2H,YAAY,KAAK,IAAIlmH,EAAEzP,EAAEo1C,KAAK1/B,EAAEhW,EAAE02H,QAAQ,GAAG,OAAO1gH,EAAE,CAAC,IAAIm4F,EAAEn4F,EAAE0/B,KAAK1/B,EAAE0/B,KAAK3lC,EAAEzP,EAAEo1C,KAAKy4D,CAAC,CAACnuG,EAAE02H,QAAQp2H,CAAC,CAACw1H,GAAG,IAAI,CAAC,OAAOvwH,CAAC,CAC3K,SAASukI,GAAGvkI,EAAEC,GAAG,OAAE,CAAC,IAAIxF,EAAE+nI,GAAE,IAAuB,GAAnB7S,KAAK8F,GAAGxxH,QAAQyyH,GAAMV,GAAG,CAAC,IAAI,IAAIj7H,EAAE86H,GAAE3gB,cAAc,OAAOn6G,GAAG,CAAC,IAAIyP,EAAEzP,EAAE88D,MAAM,OAAOrtD,IAAIA,EAAE2mH,QAAQ,MAAMp2H,EAAEA,EAAEo1C,IAAI,CAAC6lF,IAAG,CAAE,CAA4C,GAA3CJ,GAAG,EAAEG,GAAED,GAAED,GAAE,KAAKI,IAAG,EAAGC,GAAG,EAAE5zD,GAAGr+D,QAAQ,KAAQ,OAAOxJ,GAAG,OAAOA,EAAEs6G,OAAO,CAAC4qB,GAAE,EAAE+C,GAAGziI,EAAEuiI,GAAE,KAAK,KAAK,CAACxiI,EAAE,CAAC,IAAIyQ,EAAEzQ,EAAE4oG,EAAEnuG,EAAEs6G,OAAOv6E,EAAE//B,EAAE4U,EAAEpP,EAAqB,GAAnBA,EAAEwiI,GAAEjoG,EAAEw6E,OAAO,MAAS,OAAO3lG,GAAG,kBAAkBA,GAAG,oBAAoBA,EAAEwL,KAAK,CAAC,IAAI4wF,EAAEp8F,EAAEimB,EAAEkF,EAAE0H,EAAE5M,EAAEh5B,IAAI,GAAG,KAAY,EAAPg5B,EAAExjB,QAAU,IAAIowB,GAAG,KAAKA,GAAG,KAAKA,GAAG,CAAC,IAAIJ,EAAExM,EAAEw/E,UAAUhzE,GAAGxM,EAAEw7F,YAAYhvF,EAAEgvF,YAAYx7F,EAAE4/E,cAAcpzE,EAAEozE,cACxe5/E,EAAE66F,MAAMruF,EAAEquF,QAAQ76F,EAAEw7F,YAAY,KAAKx7F,EAAE4/E,cAAc,KAAK,CAAC,IAAI4c,EAAE6J,GAAG/yB,GAAG,GAAG,OAAOkpB,EAAE,CAACA,EAAE9c,QAAQ,IAAI4mB,GAAG9J,EAAElpB,EAAEpuE,EAAE/pB,EAAExQ,GAAU,EAAP6xH,EAAEhgH,MAAQ0pH,GAAG/qH,EAAEg7F,EAAExrG,GAAOoP,EAAEo8F,EAAE,IAAI76F,GAAZ3Q,EAAE6xH,GAAchB,YAAY,GAAG,OAAOlgH,EAAE,CAAC,IAAIJ,EAAE,IAAIqE,IAAIrE,EAAEsE,IAAIzF,GAAGpP,EAAE6wH,YAAYtgH,CAAC,MAAMI,EAAEkE,IAAIzF,GAAG,MAAMrP,CAAC,CAAM,GAAG,KAAO,EAAFC,GAAK,CAACu7H,GAAG/qH,EAAEg7F,EAAExrG,GAAGk+H,KAAK,MAAMn+H,CAAC,CAACqP,EAAEnI,MAAMG,EAAE,KAAM,MAAM,GAAG4mH,IAAU,EAAPzzF,EAAE1oB,KAAO,CAAC,IAAIi3G,EAAE4S,GAAG/yB,GAAG,GAAG,OAAOmgB,EAAE,CAAC,KAAa,MAARA,EAAE/T,SAAe+T,EAAE/T,OAAO,KAAK4mB,GAAG7S,EAAEngB,EAAEpuE,EAAE/pB,EAAExQ,GAAGkvH,GAAGyL,GAAGvrH,EAAEmrB,IAAI,MAAMx6B,CAAC,CAAC,CAACyQ,EAAEpB,EAAEurH,GAAGvrH,EAAEmrB,GAAG,IAAImlG,KAAIA,GAAE,GAAG,OAAOkD,GAAGA,GAAG,CAACpyH,GAAGoyH,GAAGlkI,KAAK8R,GAAGA,EAAEm4F,EAAE,EAAE,CAAC,OAAOn4F,EAAEnU,KAAK,KAAK,EAAEmU,EAAEukG,OAAO,MACpf/0G,IAAIA,EAAEwQ,EAAE0/G,OAAOlwH,EAAkB2xH,GAAGnhH,EAAbuqH,GAAGvqH,EAAEpB,EAAEpP,IAAW,MAAMD,EAAE,KAAK,EAAEw6B,EAAEnrB,EAAE,IAAI45G,EAAEx4G,EAAE/J,KAAKiD,EAAE8G,EAAEijG,UAAU,GAAG,KAAa,IAARjjG,EAAEukG,SAAa,oBAAoBiU,EAAEmS,0BAA0B,OAAOzxH,GAAG,oBAAoBA,EAAE0xH,oBAAoB,OAAOC,KAAKA,GAAGvoH,IAAIpJ,KAAK,CAAC8G,EAAEukG,OAAO,MAAM/0G,IAAIA,EAAEwQ,EAAE0/G,OAAOlwH,EAAkB2xH,GAAGnhH,EAAb0qH,GAAG1qH,EAAE+pB,EAAEv6B,IAAW,MAAMD,CAAC,EAAEyQ,EAAEA,EAAEskG,MAAM,OAAO,OAAOtkG,EAAE,CAACu0H,GAAGvqI,EAAE,CAAC,MAAM+uH,GAAIvpH,EAAEupH,EAAGgZ,KAAI/nI,GAAG,OAAOA,IAAI+nI,GAAE/nI,EAAEA,EAAEs6G,QAAQ,QAAQ,CAAC,KAAK,CAAS,CAAC,SAASqvB,KAAK,IAAIpkI,EAAEsiI,GAAGr+H,QAAsB,OAAdq+H,GAAGr+H,QAAQyyH,GAAU,OAAO12H,EAAE02H,GAAG12H,CAAC,CACrd,SAASm+H,KAAQ,IAAIwB,IAAG,IAAIA,IAAG,IAAIA,KAAEA,GAAE,GAAE,OAAO9H,IAAG,KAAQ,UAAH9F,KAAe,KAAQ,UAAH4Q,KAAeY,GAAG1L,GAAE4K,GAAE,CAAC,SAAS0B,GAAGnkI,EAAEC,GAAG,IAAIxF,EAAEi3H,GAAEA,IAAG,EAAE,IAAI32H,EAAEqpI,KAAqC,IAA7BvM,KAAI73H,GAAGyiI,KAAIxiI,IAAE8iI,GAAG,KAAKsB,GAAGrkI,EAAEC,UAAUglI,KAAK,KAAK,CAAC,MAAMz6H,GAAG+5H,GAAGvkI,EAAEwK,EAAE,CAAgC,GAAtBmlH,KAAK+B,GAAEj3H,EAAE6nI,GAAGr+H,QAAQlJ,EAAK,OAAOynI,GAAE,MAAMt7H,MAAMG,EAAE,MAAiB,OAAXwwH,GAAE,KAAK4K,GAAE,EAAS9C,EAAC,CAAC,SAASsF,KAAK,KAAK,OAAOzC,IAAG0C,GAAG1C,GAAE,CAAC,SAAS8B,KAAK,KAAK,OAAO9B,KAAI3sB,MAAMqvB,GAAG1C,GAAE,CAAC,SAAS0C,GAAGllI,GAAG,IAAIC,EAAEmiI,GAAGpiI,EAAE80G,UAAU90G,EAAE28H,IAAI38H,EAAEgvH,cAAchvH,EAAEwuH,aAAa,OAAOvuH,EAAE+kI,GAAGhlI,GAAGwiI,GAAEviI,EAAEqiE,GAAGr+D,QAAQ,IAAI,CAC1d,SAAS+gI,GAAGhlI,GAAG,IAAIC,EAAED,EAAE,EAAE,CAAC,IAAIvF,EAAEwF,EAAE60G,UAAqB,GAAX90G,EAAEC,EAAE80G,OAAU,KAAa,MAAR90G,EAAE+0G,QAAc,GAAgB,QAAbv6G,EAAEwkI,GAAGxkI,EAAEwF,EAAE08H,KAAkB,YAAJ6F,GAAE/nI,OAAc,CAAW,GAAG,QAAbA,EAAEqlI,GAAGrlI,EAAEwF,IAAmC,OAAnBxF,EAAEu6G,OAAO,WAAMwtB,GAAE/nI,GAAS,GAAG,OAAOuF,EAAmE,OAAX2/H,GAAE,OAAE6C,GAAE,MAA5DxiI,EAAEg1G,OAAO,MAAMh1G,EAAEu+H,aAAa,EAAEv+H,EAAEsuH,UAAU,IAA4B,CAAa,GAAG,QAAfruH,EAAEA,EAAEq1G,SAAyB,YAAJktB,GAAEviI,GAASuiI,GAAEviI,EAAED,CAAC,OAAO,OAAOC,GAAG,IAAI0/H,KAAIA,GAAE,EAAE,CAAC,SAASiF,GAAG5kI,EAAEC,EAAExF,GAAG,IAAIM,EAAEs9G,GAAE7tG,EAAE+3H,GAAG3nB,WAAW,IAAI2nB,GAAG3nB,WAAW,KAAKvC,GAAE,EAC3Y,SAAYr4G,EAAEC,EAAExF,EAAEM,GAAG,GAAGmpI,WAAW,OAAOjB,IAAI,GAAG,KAAO,EAAFvR,IAAK,MAAMxqH,MAAMG,EAAE,MAAM5M,EAAEuF,EAAE0kI,aAAa,IAAIl6H,EAAExK,EAAE2kI,cAAc,GAAG,OAAOlqI,EAAE,OAAO,KAA2C,GAAtCuF,EAAE0kI,aAAa,KAAK1kI,EAAE2kI,cAAc,EAAKlqI,IAAIuF,EAAEiE,QAAQ,MAAMiD,MAAMG,EAAE,MAAMrH,EAAEyjI,aAAa,KAAKzjI,EAAE6jI,iBAAiB,EAAE,IAAIpzH,EAAEhW,EAAE01H,MAAM11H,EAAEs1H,WAA8J,GA1NtT,SAAY/vH,EAAEC,GAAG,IAAIxF,EAAEuF,EAAEy3G,cAAcx3G,EAAED,EAAEy3G,aAAax3G,EAAED,EAAE03G,eAAe,EAAE13G,EAAE23G,YAAY,EAAE33G,EAAE2jI,cAAc1jI,EAAED,EAAEmlI,kBAAkBllI,EAAED,EAAE43G,gBAAgB33G,EAAEA,EAAED,EAAE63G,cAAc,IAAI98G,EAAEiF,EAAEm4G,WAAW,IAAIn4G,EAAEA,EAAE0jI,gBAAgB,EAAEjpI,GAAG,CAAC,IAAI+P,EAAE,GAAGysG,GAAGx8G,GAAGgW,EAAE,GAAGjG,EAAEvK,EAAEuK,GAAG,EAAEzP,EAAEyP,IAAI,EAAExK,EAAEwK,IAAI,EAAE/P,IAAIgW,CAAC,CAAC,CA0N5G20H,CAAGplI,EAAEyQ,GAAGzQ,IAAI63H,KAAI2K,GAAE3K,GAAE,KAAK4K,GAAE,GAAG,KAAoB,KAAfhoI,EAAE8jI,eAAoB,KAAa,KAAR9jI,EAAEu6G,QAAaguB,KAAKA,IAAG,EAAGgB,GAAGvtB,IAAG,WAAgB,OAALytB,KAAY,IAAI,KAAIzzH,EAAE,KAAa,MAARhW,EAAEu6G,OAAgB,KAAoB,MAAfv6G,EAAE8jI,eAAqB9tH,EAAE,CAACA,EAAE8xH,GAAG3nB,WAAW2nB,GAAG3nB,WAAW,KAChf,IAAIhS,EAAEyP,GAAEA,GAAE,EAAE,IAAI79E,EAAEk3F,GAAEA,IAAG,EAAEpvD,GAAGr+D,QAAQ,KA1CpC,SAAYjE,EAAEC,GAAgB,GAAbmqH,GAAG1P,GAAayK,GAAVnlH,EAAEilH,MAAc,CAAC,GAAG,mBAAmBjlH,EAAE,IAAIvF,EAAE,CAAC21B,MAAMpwB,EAAEylH,eAAev9C,IAAIloE,EAAE0lH,mBAAmB1lH,EAAE,CAA8C,IAAIjF,GAAjDN,GAAGA,EAAEuF,EAAE4tG,gBAAgBnzG,EAAE4pE,aAAaxoE,QAAe8pH,cAAclrH,EAAEkrH,eAAe,GAAG5qH,GAAG,IAAIA,EAAE6qH,WAAW,CAACnrH,EAAEM,EAAE8qH,WAAW,IAAIr7G,EAAEzP,EAAE+qH,aAAar1G,EAAE1V,EAAEgrH,UAAUhrH,EAAEA,EAAEirH,YAAY,IAAIvrH,EAAEm4E,SAASniE,EAAEmiE,QAAQ,CAAC,MAAMs2C,GAAGzuH,EAAE,KAAK,MAAMuF,CAAC,CAAC,IAAI4oG,EAAE,EAAEpuE,GAAG,EAAEnrB,GAAG,EAAEo8F,EAAE,EAAEn2E,EAAE,EAAE4M,EAAEliC,EAAE8hC,EAAE,KAAK7hC,EAAE,OAAO,CAAC,IAAI,IAAI6xH,EAAK5vF,IAAIznC,GAAG,IAAI+P,GAAG,IAAI03B,EAAE0wC,WAAWp4C,EAAEouE,EAAEp+F,GAAG03B,IAAIzxB,GAAG,IAAI1V,GAAG,IAAImnC,EAAE0wC,WAAWvjE,EAAEu5F,EAAE7tG,GAAG,IAAImnC,EAAE0wC,WAAWg2B,GACnf1mE,EAAE+sE,UAAUj1G,QAAW,QAAQ83H,EAAE5vF,EAAE0sE,aAAkB9sE,EAAEI,EAAEA,EAAE4vF,EAAE,OAAO,CAAC,GAAG5vF,IAAIliC,EAAE,MAAMC,EAA8C,GAA5C6hC,IAAIrnC,KAAKgxG,IAAIjhG,IAAIgwB,EAAEouE,GAAG9mE,IAAIrxB,KAAK6kB,IAAIv6B,IAAIsU,EAAEu5F,GAAM,QAAQkpB,EAAE5vF,EAAE4iF,aAAa,MAAUhjF,GAAJI,EAAEJ,GAAM3N,UAAU,CAAC+N,EAAE4vF,CAAC,CAACr3H,GAAG,IAAI+/B,IAAI,IAAInrB,EAAE,KAAK,CAAC+gB,MAAMoK,EAAE0tC,IAAI74D,EAAE,MAAM5U,EAAE,IAAI,CAACA,EAAEA,GAAG,CAAC21B,MAAM,EAAE83C,IAAI,EAAE,MAAMztE,EAAE,KAA+C,IAA1C4vH,GAAG,CAAC/E,YAAYtlH,EAAEulH,eAAe9qH,GAAGigH,IAAG,EAAOylB,GAAElgI,EAAE,OAAOkgI,IAAG,GAAOngI,GAAJC,EAAEkgI,IAAMpvF,MAAM,KAAoB,KAAf9wC,EAAEs+H,eAAoB,OAAOv+H,EAAEA,EAAE+0G,OAAO90G,EAAEkgI,GAAEngI,OAAO,KAAK,OAAOmgI,IAAG,CAAClgI,EAAEkgI,GAAE,IAAI,IAAIvvH,EAAE3Q,EAAE60G,UAAU,GAAG,KAAa,KAAR70G,EAAE+0G,OAAY,OAAO/0G,EAAE3D,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GACvK,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,GAAG,MAA3W,KAAK,EAAE,GAAG,OAAOsU,EAAE,CAAC,IAAIJ,EAAEI,EAAEo+G,cAAcjG,EAAEn4G,EAAEskG,cAAc8T,EAAE/oH,EAAEyzG,UAAUuV,EAAED,EAAEuK,wBAAwBtzH,EAAEouH,cAAcpuH,EAAEyG,KAAK8J,EAAE6+G,GAAGpvH,EAAEyG,KAAK8J,GAAGu4G,GAAGC,EAAEmZ,oCAAoClZ,CAAC,CAAC,MAAM,KAAK,EAAE,IAAIt/G,EAAE1J,EAAEyzG,UAAUsG,cAAc,IAAIrwG,EAAEipE,SAASjpE,EAAEgpB,YAAY,GAAG,IAAIhpB,EAAEipE,UAAUjpE,EAAE67G,iBAAiB77G,EAAEunB,YAAYvnB,EAAE67G,iBAAiB,MAAyC,QAAQ,MAAMt+G,MAAMG,EAAE,MAAO,CAAC,MAAM6hH,GAAG34G,GAAEtQ,EAAEA,EAAE80G,OAAOmU,EAAE,CAAa,GAAG,QAAflpH,EAAEC,EAAEq1G,SAAoB,CAACt1G,EAAE+0G,OAAO90G,EAAE80G,OAAOorB,GAAEngI,EAAE,KAAK,CAACmgI,GAAElgI,EAAE80G,MAAM,CAACnkG,EAAE0vH,GAAGA,IAAG,CAAW,CAwCld+E,CAAGrlI,EAAEvF,GAAGinI,GAAGjnI,EAAEuF,GAAGqlH,GAAGgF,IAAI3P,KAAK0P,GAAGC,GAAGD,GAAG,KAAKpqH,EAAEiE,QAAQxJ,EAAEsnI,GAAGtnI,EAAEuF,EAAEwK,GAAGurG,KAAK2b,GAAEl3F,EAAE69E,GAAEzP,EAAE25B,GAAG3nB,WAAWnqG,CAAC,MAAMzQ,EAAEiE,QAAQxJ,EAAsF,GAApFuoI,KAAKA,IAAG,EAAGC,GAAGjjI,EAAEkjI,GAAG14H,GAAGiG,EAAEzQ,EAAEy3G,aAAa,IAAIhnG,IAAI6qH,GAAG,MAjOmJ,SAAYt7H,GAAG,GAAGg3G,IAAI,oBAAoBA,GAAGsuB,kBAAkB,IAAItuB,GAAGsuB,kBAAkBvuB,GAAG/2G,OAAE,EAAO,OAAuB,IAAhBA,EAAEiE,QAAQ+wG,OAAW,CAAC,MAAM/0G,GAAG,CAAC,CAiOxRslI,CAAG9qI,EAAEi5G,WAAa8vB,GAAGxjI,EAAEi2G,MAAQ,OAAOh2G,EAAE,IAAIlF,EAAEiF,EAAEwlI,mBAAmB/qI,EAAE,EAAEA,EAAEwF,EAAEjG,OAAOS,IAAI+P,EAAEvK,EAAExF,GAAGM,EAAEyP,EAAE/D,MAAM,CAAC80H,eAAe/wH,EAAEqe,MAAM/X,OAAOtG,EAAEsG,SAAS,GAAGmqH,GAAG,MAAMA,IAAG,EAAGj7H,EAAEk7H,GAAGA,GAAG,KAAKl7H,EAAE,KAAQ,EAAHkjI,KAAO,IAAIljI,EAAE1D,KAAK4nI,KAAKzzH,EAAEzQ,EAAEy3G,aAAa,KAAO,EAAFhnG,GAAKzQ,IAAIojI,GAAGD,MAAMA,GAAG,EAAEC,GAAGpjI,GAAGmjI,GAAG,EAAElW,IAAgB,CAFxFwY,CAAGzlI,EAAEC,EAAExF,EAAEM,EAAE,CAAC,QAAQwnI,GAAG3nB,WAAWpwG,EAAE6tG,GAAEt9G,CAAC,CAAC,OAAO,IAAI,CAGhc,SAASmpI,KAAK,GAAG,OAAOjB,GAAG,CAAC,IAAIjjI,EAAEs4G,GAAG4qB,IAAIjjI,EAAEsiI,GAAG3nB,WAAWngH,EAAE49G,GAAE,IAAmC,GAA/BkqB,GAAG3nB,WAAW,KAAKvC,GAAE,GAAGr4G,EAAE,GAAGA,EAAK,OAAOijI,GAAG,IAAIloI,GAAE,MAAO,CAAmB,GAAlBiF,EAAEijI,GAAGA,GAAG,KAAKC,GAAG,EAAK,KAAO,EAAFxR,IAAK,MAAMxqH,MAAMG,EAAE,MAAM,IAAImD,EAAEknH,GAAO,IAALA,IAAG,EAAMyO,GAAEngI,EAAEiE,QAAQ,OAAOk8H,IAAG,CAAC,IAAI1vH,EAAE0vH,GAAEv3B,EAAEn4F,EAAEsgC,MAAM,GAAG,KAAa,GAARovF,GAAEnrB,OAAU,CAAC,IAAIx6E,EAAE/pB,EAAE69G,UAAU,GAAG,OAAO9zF,EAAE,CAAC,IAAI,IAAInrB,EAAE,EAAEA,EAAEmrB,EAAExgC,OAAOqV,IAAI,CAAC,IAAIo8F,EAAEjxE,EAAEnrB,GAAG,IAAI8wH,GAAE10B,EAAE,OAAO00B,IAAG,CAAC,IAAI7qG,EAAE6qG,GAAE,OAAO7qG,EAAEh5B,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAGikI,GAAG,EAAEjrG,EAAE7kB,GAAG,IAAIyxB,EAAE5M,EAAEyb,MAAM,GAAG,OAAO7O,EAAEA,EAAE6yE,OAAOz/E,EAAE6qG,GAAEj+F,OAAO,KAAK,OAAOi+F,IAAG,CAAK,IAAIr+F,GAARxM,EAAE6qG,IAAU7qB,QAAQwc,EAAEx8F,EAAEy/E,OAAa,GAAN2rB,GAAGprG,GAAMA,IACnfm2E,EAAE,CAAC00B,GAAE,KAAK,KAAK,CAAC,GAAG,OAAOr+F,EAAE,CAACA,EAAEizE,OAAO+c,EAAEqO,GAAEr+F,EAAE,KAAK,CAACq+F,GAAErO,CAAC,CAAC,CAAC,CAAC,IAAIlhH,EAAEH,EAAEqkG,UAAU,GAAG,OAAOlkG,EAAE,CAAC,IAAIJ,EAAEI,EAAEmgC,MAAM,GAAG,OAAOvgC,EAAE,CAACI,EAAEmgC,MAAM,KAAK,EAAE,CAAC,IAAIg4E,EAAEv4G,EAAE8kG,QAAQ9kG,EAAE8kG,QAAQ,KAAK9kG,EAAEu4G,CAAC,OAAO,OAAOv4G,EAAE,CAAC,CAAC2vH,GAAE1vH,CAAC,CAAC,CAAC,GAAG,KAAoB,KAAfA,EAAE8tH,eAAoB,OAAO31B,EAAEA,EAAEmM,OAAOtkG,EAAE0vH,GAAEv3B,OAAO3oG,EAAE,KAAK,OAAOkgI,IAAG,CAAK,GAAG,KAAa,MAApB1vH,EAAE0vH,IAAYnrB,OAAY,OAAOvkG,EAAEnU,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAGikI,GAAG,EAAE9vH,EAAEA,EAAEskG,QAAQ,IAAIiU,EAAEv4G,EAAE6kG,QAAQ,GAAG,OAAO0T,EAAE,CAACA,EAAEjU,OAAOtkG,EAAEskG,OAAOorB,GAAEnX,EAAE,MAAM/oH,CAAC,CAACkgI,GAAE1vH,EAAEskG,MAAM,CAAC,CAAC,IAAIkU,EAAEjpH,EAAEiE,QAAQ,IAAIk8H,GAAElX,EAAE,OAAOkX,IAAG,CAAK,IAAIx2H,GAARi/F,EAAEu3B,IAAUpvF,MAAM,GAAG,KAAoB,KAAf63D,EAAE21B,eAAoB,OAClf50H,EAAEA,EAAEorG,OAAOnM,EAAEu3B,GAAEx2H,OAAO1J,EAAE,IAAI2oG,EAAEqgB,EAAE,OAAOkX,IAAG,CAAK,GAAG,KAAa,MAApB3lG,EAAE2lG,IAAYnrB,OAAY,IAAI,OAAOx6E,EAAEl+B,KAAK,KAAK,EAAE,KAAK,GAAG,KAAK,GAAGkkI,GAAG,EAAEhmG,GAAG,CAAC,MAAMgvF,GAAIj5G,GAAEiqB,EAAEA,EAAEu6E,OAAOyU,EAAG,CAAC,GAAGhvF,IAAIouE,EAAE,CAACu3B,GAAE,KAAK,MAAMlgI,CAAC,CAAC,IAAIipH,EAAE1uF,EAAE86E,QAAQ,GAAG,OAAO4T,EAAE,CAACA,EAAEnU,OAAOv6E,EAAEu6E,OAAOorB,GAAEjX,EAAE,MAAMjpH,CAAC,CAACkgI,GAAE3lG,EAAEu6E,MAAM,CAAC,CAAU,GAAT2c,GAAElnH,EAAEyiH,KAAQjW,IAAI,oBAAoBA,GAAG0uB,sBAAsB,IAAI1uB,GAAG0uB,sBAAsB3uB,GAAG/2G,EAAE,CAAC,MAAMwpH,GAAI,CAACzuH,GAAE,CAAE,CAAC,OAAOA,CAAC,CAAC,QAAQs9G,GAAE59G,EAAE8nI,GAAG3nB,WAAW36G,CAAC,CAAC,CAAC,OAAM,CAAE,CAAC,SAAS0lI,GAAG3lI,EAAEC,EAAExF,GAAyBuF,EAAEyxH,GAAGzxH,EAAjBC,EAAE+6H,GAAGh7H,EAAfC,EAAE26H,GAAGngI,EAAEwF,GAAY,GAAY,GAAGA,EAAEuyH,KAAI,OAAOxyH,IAAIk4G,GAAGl4G,EAAE,EAAEC,GAAGujI,GAAGxjI,EAAEC,GAAG,CACze,SAASsQ,GAAEvQ,EAAEC,EAAExF,GAAG,GAAG,IAAIuF,EAAE1D,IAAIqpI,GAAG3lI,EAAEA,EAAEvF,QAAQ,KAAK,OAAOwF,GAAG,CAAC,GAAG,IAAIA,EAAE3D,IAAI,CAACqpI,GAAG1lI,EAAED,EAAEvF,GAAG,KAAK,CAAM,GAAG,IAAIwF,EAAE3D,IAAI,CAAC,IAAIvB,EAAEkF,EAAEyzG,UAAU,GAAG,oBAAoBzzG,EAAEyG,KAAK00H,0BAA0B,oBAAoBrgI,EAAEsgI,oBAAoB,OAAOC,KAAKA,GAAGvoH,IAAIhY,IAAI,CAAuBkF,EAAEwxH,GAAGxxH,EAAjBD,EAAEm7H,GAAGl7H,EAAfD,EAAE46H,GAAGngI,EAAEuF,GAAY,GAAY,GAAGA,EAAEwyH,KAAI,OAAOvyH,IAAIi4G,GAAGj4G,EAAE,EAAED,GAAGwjI,GAAGvjI,EAAED,IAAI,KAAK,CAAC,CAACC,EAAEA,EAAE80G,MAAM,CAAC,CACnV,SAAS2mB,GAAG17H,EAAEC,EAAExF,GAAG,IAAIM,EAAEiF,EAAEy7H,UAAU,OAAO1gI,GAAGA,EAAEiZ,OAAO/T,GAAGA,EAAEuyH,KAAIxyH,EAAE23G,aAAa33G,EAAE03G,eAAej9G,EAAEo9H,KAAI73H,IAAIyiI,GAAEhoI,KAAKA,IAAI,IAAIklI,IAAG,IAAIA,KAAM,UAAF8C,MAAeA,IAAG,IAAIxsB,KAAI4rB,GAAGwC,GAAGrkI,EAAE,GAAG4iI,IAAInoI,GAAG+oI,GAAGxjI,EAAEC,EAAE,CAAC,SAAS2lI,GAAG5lI,EAAEC,GAAG,IAAIA,IAAI,KAAY,EAAPD,EAAE8R,MAAQ7R,EAAE,GAAGA,EAAEq3G,GAAU,KAAQ,WAAfA,KAAK,MAAuBA,GAAG,WAAW,IAAI78G,EAAE+3H,KAAc,QAAVxyH,EAAE2wH,GAAG3wH,EAAEC,MAAci4G,GAAGl4G,EAAEC,EAAExF,GAAG+oI,GAAGxjI,EAAEvF,GAAG,CAAC,SAAS2jI,GAAGp+H,GAAG,IAAIC,EAAED,EAAEk1G,cAAcz6G,EAAE,EAAE,OAAOwF,IAAIxF,EAAEwF,EAAE0uH,WAAWiX,GAAG5lI,EAAEvF,EAAE,CACjZ,SAAS+mI,GAAGxhI,EAAEC,GAAG,IAAIxF,EAAE,EAAE,OAAOuF,EAAE1D,KAAK,KAAK,GAAG,IAAIvB,EAAEiF,EAAE0zG,UAAclpG,EAAExK,EAAEk1G,cAAc,OAAO1qG,IAAI/P,EAAE+P,EAAEmkH,WAAW,MAAM,KAAK,GAAG5zH,EAAEiF,EAAE0zG,UAAU,MAAM,QAAQ,MAAMxsG,MAAMG,EAAE,MAAO,OAAOtM,GAAGA,EAAEiZ,OAAO/T,GAAG2lI,GAAG5lI,EAAEvF,EAAE,CAQqK,SAASupI,GAAGhkI,EAAEC,GAAG,OAAOw1G,GAAGz1G,EAAEC,EAAE,CACjZ,SAAS4lI,GAAG7lI,EAAEC,EAAExF,EAAEM,GAAG+M,KAAKxL,IAAI0D,EAAE8H,KAAK7I,IAAIxE,EAAEqN,KAAKwtG,QAAQxtG,KAAKipC,MAAMjpC,KAAKitG,OAAOjtG,KAAK4rG,UAAU5rG,KAAKpB,KAAKoB,KAAKumH,YAAY,KAAKvmH,KAAK2T,MAAM,EAAE3T,KAAK2zD,IAAI,KAAK3zD,KAAK0mH,aAAavuH,EAAE6H,KAAKmoH,aAAanoH,KAAKotG,cAAcptG,KAAKgpH,YAAYhpH,KAAKknH,cAAc,KAAKlnH,KAAKgK,KAAK/W,EAAE+M,KAAKy2H,aAAaz2H,KAAKktG,MAAM,EAAEltG,KAAKwmH,UAAU,KAAKxmH,KAAKioH,WAAWjoH,KAAKqoH,MAAM,EAAEroH,KAAKgtG,UAAU,IAAI,CAAC,SAASsZ,GAAGpuH,EAAEC,EAAExF,EAAEM,GAAG,OAAO,IAAI8qI,GAAG7lI,EAAEC,EAAExF,EAAEM,EAAE,CAAC,SAASohI,GAAGn8H,GAAiB,UAAdA,EAAEA,EAAEuN,aAAuBvN,EAAE8lI,iBAAiB,CAEpd,SAAS7R,GAAGj0H,EAAEC,GAAG,IAAIxF,EAAEuF,EAAE80G,UACuB,OADb,OAAOr6G,IAAGA,EAAE2zH,GAAGpuH,EAAE1D,IAAI2D,EAAED,EAAEf,IAAIe,EAAE8R,OAAQu8G,YAAYruH,EAAEquH,YAAY5zH,EAAEiM,KAAK1G,EAAE0G,KAAKjM,EAAEi5G,UAAU1zG,EAAE0zG,UAAUj5G,EAAEq6G,UAAU90G,EAAEA,EAAE80G,UAAUr6G,IAAIA,EAAE+zH,aAAavuH,EAAExF,EAAEiM,KAAK1G,EAAE0G,KAAKjM,EAAEu6G,MAAM,EAAEv6G,EAAE8jI,aAAa,EAAE9jI,EAAE6zH,UAAU,MAAM7zH,EAAEu6G,MAAc,SAARh1G,EAAEg1G,MAAev6G,EAAEs1H,WAAW/vH,EAAE+vH,WAAWt1H,EAAE01H,MAAMnwH,EAAEmwH,MAAM11H,EAAEs2C,MAAM/wC,EAAE+wC,MAAMt2C,EAAEu0H,cAAchvH,EAAEgvH,cAAcv0H,EAAEy6G,cAAcl1G,EAAEk1G,cAAcz6G,EAAEq2H,YAAY9wH,EAAE8wH,YAAY7wH,EAAED,EAAEiwH,aAAax1H,EAAEw1H,aAAa,OAAOhwH,EAAE,KAAK,CAACkwH,MAAMlwH,EAAEkwH,MAAMD,aAAajwH,EAAEiwH,cAC/ez1H,EAAE66G,QAAQt1G,EAAEs1G,QAAQ76G,EAAEghB,MAAMzb,EAAEyb,MAAMhhB,EAAEghE,IAAIz7D,EAAEy7D,IAAWhhE,CAAC,CACxD,SAAS05H,GAAGn0H,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,GAAG,IAAIm4F,EAAE,EAAM,GAAJ7tG,EAAEiF,EAAK,oBAAoBA,EAAEm8H,GAAGn8H,KAAK4oG,EAAE,QAAQ,GAAG,kBAAkB5oG,EAAE4oG,EAAE,OAAO5oG,EAAE,OAAOA,GAAG,KAAKoqG,EAAG,OAAOkqB,GAAG75H,EAAEq4C,SAAStoC,EAAEiG,EAAExQ,GAAG,KAAKoqG,EAAGzB,EAAE,EAAEp+F,GAAG,EAAE,MAAM,KAAK8/F,EAAG,OAAOtqG,EAAEouH,GAAG,GAAG3zH,EAAEwF,EAAI,EAAFuK,IAAO6jH,YAAY/jB,EAAGtqG,EAAEmwH,MAAM1/G,EAAEzQ,EAAE,KAAK0qG,EAAG,OAAO1qG,EAAEouH,GAAG,GAAG3zH,EAAEwF,EAAEuK,IAAK6jH,YAAY3jB,EAAG1qG,EAAEmwH,MAAM1/G,EAAEzQ,EAAE,KAAK2qG,EAAG,OAAO3qG,EAAEouH,GAAG,GAAG3zH,EAAEwF,EAAEuK,IAAK6jH,YAAY1jB,EAAG3qG,EAAEmwH,MAAM1/G,EAAEzQ,EAAE,KAAK8qG,EAAG,OAAOgzB,GAAGrjI,EAAE+P,EAAEiG,EAAExQ,GAAG,QAAQ,GAAG,kBAAkBD,GAAG,OAAOA,EAAE,OAAOA,EAAE8rG,UAAU,KAAKvB,EAAG3B,EAAE,GAAG,MAAM5oG,EAAE,KAAKwqG,EAAG5B,EAAE,EAAE,MAAM5oG,EAAE,KAAKyqG,EAAG7B,EAAE,GACpf,MAAM5oG,EAAE,KAAK4qG,EAAGhC,EAAE,GAAG,MAAM5oG,EAAE,KAAK6qG,EAAGjC,EAAE,GAAG7tG,EAAE,KAAK,MAAMiF,EAAE,MAAMkH,MAAMG,EAAE,IAAI,MAAMrH,EAAEA,SAASA,EAAE,KAAuD,OAAjDC,EAAEmuH,GAAGxlB,EAAEnuG,EAAEwF,EAAEuK,IAAK6jH,YAAYruH,EAAEC,EAAEyG,KAAK3L,EAAEkF,EAAEkwH,MAAM1/G,EAASxQ,CAAC,CAAC,SAASq0H,GAAGt0H,EAAEC,EAAExF,EAAEM,GAA2B,OAAxBiF,EAAEouH,GAAG,EAAEpuH,EAAEjF,EAAEkF,IAAKkwH,MAAM11H,EAASuF,CAAC,CAAC,SAAS89H,GAAG99H,EAAEC,EAAExF,EAAEM,GAAuE,OAApEiF,EAAEouH,GAAG,GAAGpuH,EAAEjF,EAAEkF,IAAKouH,YAAYvjB,EAAG9qG,EAAEmwH,MAAM11H,EAAEuF,EAAE0zG,UAAU,CAACkuB,UAAS,GAAW5hI,CAAC,CAAC,SAASk0H,GAAGl0H,EAAEC,EAAExF,GAA8B,OAA3BuF,EAAEouH,GAAG,EAAEpuH,EAAE,KAAKC,IAAKkwH,MAAM11H,EAASuF,CAAC,CAC5W,SAASq0H,GAAGr0H,EAAEC,EAAExF,GAA8J,OAA3JwF,EAAEmuH,GAAG,EAAE,OAAOpuH,EAAE8yC,SAAS9yC,EAAE8yC,SAAS,GAAG9yC,EAAEf,IAAIgB,IAAKkwH,MAAM11H,EAAEwF,EAAEyzG,UAAU,CAACsG,cAAch6G,EAAEg6G,cAAc+rB,gBAAgB,KAAK3R,eAAep0H,EAAEo0H,gBAAuBn0H,CAAC,CACtL,SAAS+lI,GAAGhmI,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG1C,KAAKxL,IAAI2D,EAAE6H,KAAKkyG,cAAch6G,EAAE8H,KAAK48H,aAAa58H,KAAK2zH,UAAU3zH,KAAK7D,QAAQ6D,KAAKi+H,gBAAgB,KAAKj+H,KAAK+8H,eAAe,EAAE/8H,KAAK27H,aAAa37H,KAAKs1H,eAAet1H,KAAKy0B,QAAQ,KAAKz0B,KAAK+7H,iBAAiB,EAAE/7H,KAAKqwG,WAAWF,GAAG,GAAGnwG,KAAK47H,gBAAgBzrB,IAAI,GAAGnwG,KAAK8vG,eAAe9vG,KAAK68H,cAAc78H,KAAKq9H,iBAAiBr9H,KAAK67H,aAAa77H,KAAK6vG,YAAY7vG,KAAK4vG,eAAe5vG,KAAK2vG,aAAa,EAAE3vG,KAAK+vG,cAAcI,GAAG,GAAGnwG,KAAK6yH,iBAAiB5/H,EAAE+M,KAAK09H,mBAAmBh7H,EAAE1C,KAAKm+H,gCAC/e,IAAI,CAAC,SAASC,GAAGlmI,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,EAAEm4F,EAAEpuE,EAAEnrB,GAAgN,OAA7MrP,EAAE,IAAIgmI,GAAGhmI,EAAEC,EAAExF,EAAE+/B,EAAEnrB,GAAG,IAAIpP,GAAGA,EAAE,GAAE,IAAKwQ,IAAIxQ,GAAG,IAAIA,EAAE,EAAEwQ,EAAE29G,GAAG,EAAE,KAAK,KAAKnuH,GAAGD,EAAEiE,QAAQwM,EAAEA,EAAEijG,UAAU1zG,EAAEyQ,EAAEykG,cAAc,CAACmR,QAAQtrH,EAAEg/G,aAAat/G,EAAE2uD,MAAM,KAAKqzE,YAAY,KAAK0J,0BAA0B,MAAMtV,GAAGpgH,GAAUzQ,CAAC,CACzP,SAASomI,GAAGpmI,GAAG,IAAIA,EAAE,OAAO4rH,GAAuB5rH,EAAE,CAAC,GAAG60G,GAA1B70G,EAAEA,EAAEsyH,mBAA8BtyH,GAAG,IAAIA,EAAE1D,IAAI,MAAM4K,MAAMG,EAAE,MAAM,IAAIpH,EAAED,EAAE,EAAE,CAAC,OAAOC,EAAE3D,KAAK,KAAK,EAAE2D,EAAEA,EAAEyzG,UAAUn3E,QAAQ,MAAMv8B,EAAE,KAAK,EAAE,GAAGosH,GAAGnsH,EAAEyG,MAAM,CAACzG,EAAEA,EAAEyzG,UAAUiZ,0CAA0C,MAAM3sH,CAAC,EAAEC,EAAEA,EAAE80G,MAAM,OAAO,OAAO90G,GAAG,MAAMiH,MAAMG,EAAE,KAAM,CAAC,GAAG,IAAIrH,EAAE1D,IAAI,CAAC,IAAI7B,EAAEuF,EAAE0G,KAAK,GAAG0lH,GAAG3xH,GAAG,OAAO+xH,GAAGxsH,EAAEvF,EAAEwF,EAAE,CAAC,OAAOA,CAAC,CACpW,SAASomI,GAAGrmI,EAAEC,EAAExF,EAAEM,EAAEyP,EAAEiG,EAAEm4F,EAAEpuE,EAAEnrB,GAAwK,OAArKrP,EAAEkmI,GAAGzrI,EAAEM,GAAE,EAAGiF,EAAEwK,EAAEiG,EAAEm4F,EAAEpuE,EAAEnrB,IAAKktB,QAAQ6pG,GAAG,MAAM3rI,EAAEuF,EAAEiE,SAAsBwM,EAAE6gH,GAAhBv2H,EAAEy3H,KAAIhoH,EAAEioH,GAAGh4H,KAAeiH,cAAS,IAASzB,GAAG,OAAOA,EAAEA,EAAE,KAAKwxH,GAAGh3H,EAAEgW,EAAEjG,GAAGxK,EAAEiE,QAAQksH,MAAM3lH,EAAE0tG,GAAGl4G,EAAEwK,EAAEzP,GAAGyoI,GAAGxjI,EAAEjF,GAAUiF,CAAC,CAAC,SAASsmI,GAAGtmI,EAAEC,EAAExF,EAAEM,GAAG,IAAIyP,EAAEvK,EAAEgE,QAAQwM,EAAE+hH,KAAI5pB,EAAE6pB,GAAGjoH,GAAsL,OAAnL/P,EAAE2rI,GAAG3rI,GAAG,OAAOwF,EAAEs8B,QAAQt8B,EAAEs8B,QAAQ9hC,EAAEwF,EAAEm9H,eAAe3iI,GAAEwF,EAAEqxH,GAAG7gH,EAAEm4F,IAAK1lG,QAAQ,CAACmjH,QAAQrmH,GAAuB,QAApBjF,OAAE,IAASA,EAAE,KAAKA,KAAakF,EAAEyB,SAAS3G,GAAe,QAAZiF,EAAEyxH,GAAGjnH,EAAEvK,EAAE2oG,MAAc8pB,GAAG1yH,EAAEwK,EAAEo+F,EAAEn4F,GAAGkhH,GAAG3xH,EAAEwK,EAAEo+F,IAAWA,CAAC,CAC3b,SAAS29B,GAAGvmI,GAAe,OAAZA,EAAEA,EAAEiE,SAAc8sC,OAAyB/wC,EAAE+wC,MAAMz0C,IAAoD0D,EAAE+wC,MAAM2iE,WAAhF,IAA0F,CAAC,SAAS8yB,GAAGxmI,EAAEC,GAAqB,GAAG,QAArBD,EAAEA,EAAEk1G,gBAA2B,OAAOl1G,EAAEm1G,WAAW,CAAC,IAAI16G,EAAEuF,EAAE2uH,UAAU3uH,EAAE2uH,UAAU,IAAIl0H,GAAGA,EAAEwF,EAAExF,EAAEwF,CAAC,CAAC,CAAC,SAASwmI,GAAGzmI,EAAEC,GAAGumI,GAAGxmI,EAAEC,IAAID,EAAEA,EAAE80G,YAAY0xB,GAAGxmI,EAAEC,EAAE,CAnB7SmiI,GAAG,SAASpiI,EAAEC,EAAExF,GAAG,GAAG,OAAOuF,EAAE,GAAGA,EAAEgvH,gBAAgB/uH,EAAEuuH,cAAc1C,GAAG7nH,QAAQmsH,IAAG,MAAO,CAAC,GAAG,KAAKpwH,EAAEmwH,MAAM11H,IAAI,KAAa,IAARwF,EAAE+0G,OAAW,OAAOob,IAAG,EAzE1I,SAAYpwH,EAAEC,EAAExF,GAAG,OAAOwF,EAAE3D,KAAK,KAAK,EAAE6gI,GAAGl9H,GAAGivH,KAAK,MAAM,KAAK,EAAE+F,GAAGh1H,GAAG,MAAM,KAAK,EAAEmsH,GAAGnsH,EAAEyG,OAAOgmH,GAAGzsH,GAAG,MAAM,KAAK,EAAE60H,GAAG70H,EAAEA,EAAEyzG,UAAUsG,eAAe,MAAM,KAAK,GAAG,IAAIj/G,EAAEkF,EAAEyG,KAAKqlG,SAASvhG,EAAEvK,EAAE+uH,cAAcvoH,MAAMklH,GAAE4D,GAAGx0H,EAAE80H,eAAe90H,EAAE80H,cAAcrlH,EAAE,MAAM,KAAK,GAAqB,GAAG,QAArBzP,EAAEkF,EAAEi1G,eAA2B,OAAG,OAAOn6G,EAAEo6G,YAAkBwW,GAAEwJ,GAAY,EAAVA,GAAElxH,SAAWhE,EAAE+0G,OAAO,IAAI,MAAQ,KAAKv6G,EAAEwF,EAAE8wC,MAAMg/E,YAAmB6N,GAAG59H,EAAEC,EAAExF,IAAGkxH,GAAEwJ,GAAY,EAAVA,GAAElxH,SAA8B,QAAnBjE,EAAEi8H,GAAGj8H,EAAEC,EAAExF,IAAmBuF,EAAEs1G,QAAQ,MAAKqW,GAAEwJ,GAAY,EAAVA,GAAElxH,SAAW,MAAM,KAAK,GAC7d,GADgelJ,EAAE,KAAKN,EACrfwF,EAAE8vH,YAAe,KAAa,IAAR/vH,EAAEg1G,OAAW,CAAC,GAAGj6G,EAAE,OAAO+jI,GAAG9+H,EAAEC,EAAExF,GAAGwF,EAAE+0G,OAAO,GAAG,CAA6F,GAA1E,QAAlBxqG,EAAEvK,EAAEi1G,iBAAyB1qG,EAAEm0H,UAAU,KAAKn0H,EAAE21F,KAAK,KAAK31F,EAAEutH,WAAW,MAAMpM,GAAEwJ,GAAEA,GAAElxH,SAAYlJ,EAAE,MAAW,OAAO,KAAK,KAAK,GAAG,KAAK,GAAG,OAAOkF,EAAEkwH,MAAM,EAAEmM,GAAGt8H,EAAEC,EAAExF,GAAG,OAAOwhI,GAAGj8H,EAAEC,EAAExF,EAAE,CAwE7GisI,CAAG1mI,EAAEC,EAAExF,GAAG21H,GAAG,KAAa,OAARpwH,EAAEg1G,MAAmB,MAAMob,IAAG,EAAGnC,IAAG,KAAa,QAARhuH,EAAE+0G,QAAgB4Y,GAAG3tH,EAAEotH,GAAGptH,EAAEwb,OAAiB,OAAVxb,EAAEkwH,MAAM,EAASlwH,EAAE3D,KAAK,KAAK,EAAE,IAAIvB,EAAEkF,EAAEyG,KAAKo2H,GAAG98H,EAAEC,GAAGD,EAAEC,EAAEuuH,aAAa,IAAIhkH,EAAEwhH,GAAG/rH,EAAE4rH,GAAE5nH,SAAS+rH,GAAG/vH,EAAExF,GAAG+P,EAAE8rH,GAAG,KAAKr2H,EAAElF,EAAEiF,EAAEwK,EAAE/P,GAAG,IAAIgW,EAAEkmH,KACvI,OAD4I12H,EAAE+0G,OAAO,EAAE,kBAAkBxqG,GAAG,OAAOA,GAAG,oBAAoBA,EAAEohG,aAAQ,IAASphG,EAAEshG,UAAU7rG,EAAE3D,IAAI,EAAE2D,EAAEi1G,cAAc,KAAKj1G,EAAE6wH,YAC1e,KAAK1E,GAAGrxH,IAAI0V,GAAE,EAAGi8G,GAAGzsH,IAAIwQ,GAAE,EAAGxQ,EAAEi1G,cAAc,OAAO1qG,EAAExH,YAAO,IAASwH,EAAExH,MAAMwH,EAAExH,MAAM,KAAK6tH,GAAG5wH,GAAGuK,EAAEohF,QAAQwmC,GAAGnyH,EAAEyzG,UAAUlpG,EAAEA,EAAE8nH,gBAAgBryH,EAAEozH,GAAGpzH,EAAElF,EAAEiF,EAAEvF,GAAGwF,EAAEi9H,GAAG,KAAKj9H,EAAElF,GAAE,EAAG0V,EAAEhW,KAAKwF,EAAE3D,IAAI,EAAE2xH,IAAGx9G,GAAGo9G,GAAG5tH,GAAG87H,GAAG,KAAK97H,EAAEuK,EAAE/P,GAAGwF,EAAEA,EAAE8wC,OAAc9wC,EAAE,KAAK,GAAGlF,EAAEkF,EAAEouH,YAAYruH,EAAE,CAAqF,OAApF88H,GAAG98H,EAAEC,GAAGD,EAAEC,EAAEuuH,aAAuBzzH,GAAVyP,EAAEzP,EAAEkxG,OAAUlxG,EAAEixG,UAAU/rG,EAAEyG,KAAK3L,EAAEyP,EAAEvK,EAAE3D,IAQtU,SAAY0D,GAAG,GAAG,oBAAoBA,EAAE,OAAOm8H,GAAGn8H,GAAG,EAAE,EAAE,QAAG,IAASA,GAAG,OAAOA,EAAE,CAAc,IAAbA,EAAEA,EAAE8rG,YAAgBrB,EAAG,OAAO,GAAG,GAAGzqG,IAAI4qG,EAAG,OAAO,EAAE,CAAC,OAAO,CAAC,CAR2L+7B,CAAG5rI,GAAGiF,EAAEqvH,GAAGt0H,EAAEiF,GAAUwK,GAAG,KAAK,EAAEvK,EAAEo8H,GAAG,KAAKp8H,EAAElF,EAAEiF,EAAEvF,GAAG,MAAMuF,EAAE,KAAK,EAAEC,EAAE48H,GAAG,KAAK58H,EAAElF,EAAEiF,EAAEvF,GAAG,MAAMuF,EAAE,KAAK,GAAGC,EAAE+7H,GAAG,KAAK/7H,EAAElF,EAAEiF,EAAEvF,GAAG,MAAMuF,EAAE,KAAK,GAAGC,EAAEi8H,GAAG,KAAKj8H,EAAElF,EAAEs0H,GAAGt0H,EAAE2L,KAAK1G,GAAGvF,GAAG,MAAMuF,EAAE,MAAMkH,MAAMG,EAAE,IACvgBtM,EAAE,IAAK,CAAC,OAAOkF,EAAE,KAAK,EAAE,OAAOlF,EAAEkF,EAAEyG,KAAK8D,EAAEvK,EAAEuuH,aAA2C6N,GAAGr8H,EAAEC,EAAElF,EAArCyP,EAAEvK,EAAEouH,cAActzH,EAAEyP,EAAE6kH,GAAGt0H,EAAEyP,GAAc/P,GAAG,KAAK,EAAE,OAAOM,EAAEkF,EAAEyG,KAAK8D,EAAEvK,EAAEuuH,aAA2CqO,GAAG78H,EAAEC,EAAElF,EAArCyP,EAAEvK,EAAEouH,cAActzH,EAAEyP,EAAE6kH,GAAGt0H,EAAEyP,GAAc/P,GAAG,KAAK,EAAEuF,EAAE,CAAO,GAANm9H,GAAGl9H,GAAM,OAAOD,EAAE,MAAMkH,MAAMG,EAAE,MAAMtM,EAAEkF,EAAEuuH,aAA+BhkH,GAAlBiG,EAAExQ,EAAEi1G,eAAkBmR,QAAQgL,GAAGrxH,EAAEC,GAAG4xH,GAAG5xH,EAAElF,EAAE,KAAKN,GAAG,IAAImuG,EAAE3oG,EAAEi1G,cAA0B,GAAZn6G,EAAE6tG,EAAEyd,QAAW51G,EAAEspG,aAAY,CAAC,GAAGtpG,EAAE,CAAC41G,QAAQtrH,EAAEg/G,cAAa,EAAG3wD,MAAMw/C,EAAEx/C,MAAM+8E,0BAA0Bv9B,EAAEu9B,0BAA0B1J,YAAY7zB,EAAE6zB,aAAax8H,EAAE6wH,YAAYC,UAChftgH,EAAExQ,EAAEi1G,cAAczkG,EAAU,IAARxQ,EAAE+0G,MAAU,CAAuB/0G,EAAEo9H,GAAGr9H,EAAEC,EAAElF,EAAEN,EAAjC+P,EAAEowH,GAAG1zH,MAAMG,EAAE,MAAMpH,IAAmB,MAAMD,CAAC,CAAM,GAAGjF,IAAIyP,EAAE,CAAuBvK,EAAEo9H,GAAGr9H,EAAEC,EAAElF,EAAEN,EAAjC+P,EAAEowH,GAAG1zH,MAAMG,EAAE,MAAMpH,IAAmB,MAAMD,CAAC,CAAM,IAAIguH,GAAGjD,GAAG9qH,EAAEyzG,UAAUsG,cAAcpL,YAAYmf,GAAG9tH,EAAEguH,IAAE,EAAGC,GAAG,KAAKzzH,EAAE+5H,GAAGv0H,EAAE,KAAKlF,EAAEN,GAAGwF,EAAE8wC,MAAMt2C,EAAEA,GAAGA,EAAEu6G,OAAe,EAATv6G,EAAEu6G,MAAS,KAAKv6G,EAAEA,EAAE66G,OAAQ,KAAI,CAAM,GAAL4Z,KAAQn0H,IAAIyP,EAAE,CAACvK,EAAEg8H,GAAGj8H,EAAEC,EAAExF,GAAG,MAAMuF,CAAC,CAAC+7H,GAAG/7H,EAAEC,EAAElF,EAAEN,EAAE,CAACwF,EAAEA,EAAE8wC,KAAK,CAAC,OAAO9wC,EAAE,KAAK,EAAE,OAAOg1H,GAAGh1H,GAAG,OAAOD,GAAG6uH,GAAG5uH,GAAGlF,EAAEkF,EAAEyG,KAAK8D,EAAEvK,EAAEuuH,aAAa/9G,EAAE,OAAOzQ,EAAEA,EAAEgvH,cAAc,KAAKpmB,EAAEp+F,EAAEsoC,SAASw3E,GAAGvvH,EAAEyP,GAAGo+F,EAAE,KAAK,OAAOn4F,GAAG65G,GAAGvvH,EAAE0V,KAAKxQ,EAAE+0G,OAAO,IACnf4nB,GAAG58H,EAAEC,GAAG87H,GAAG/7H,EAAEC,EAAE2oG,EAAEnuG,GAAGwF,EAAE8wC,MAAM,KAAK,EAAE,OAAO,OAAO/wC,GAAG6uH,GAAG5uH,GAAG,KAAK,KAAK,GAAG,OAAO29H,GAAG59H,EAAEC,EAAExF,GAAG,KAAK,EAAE,OAAOq6H,GAAG70H,EAAEA,EAAEyzG,UAAUsG,eAAej/G,EAAEkF,EAAEuuH,aAAa,OAAOxuH,EAAEC,EAAE8wC,MAAMwjF,GAAGt0H,EAAE,KAAKlF,EAAEN,GAAGshI,GAAG/7H,EAAEC,EAAElF,EAAEN,GAAGwF,EAAE8wC,MAAM,KAAK,GAAG,OAAOh2C,EAAEkF,EAAEyG,KAAK8D,EAAEvK,EAAEuuH,aAA2CwN,GAAGh8H,EAAEC,EAAElF,EAArCyP,EAAEvK,EAAEouH,cAActzH,EAAEyP,EAAE6kH,GAAGt0H,EAAEyP,GAAc/P,GAAG,KAAK,EAAE,OAAOshI,GAAG/7H,EAAEC,EAAEA,EAAEuuH,aAAa/zH,GAAGwF,EAAE8wC,MAAM,KAAK,EAAmD,KAAK,GAAG,OAAOgrF,GAAG/7H,EAAEC,EAAEA,EAAEuuH,aAAa17E,SAASr4C,GAAGwF,EAAE8wC,MAAM,KAAK,GAAG/wC,EAAE,CACxZ,GADyZjF,EAAEkF,EAAEyG,KAAKqlG,SAASvhG,EAAEvK,EAAEuuH,aAAa/9G,EAAExQ,EAAE+uH,cAClfpmB,EAAEp+F,EAAE/D,MAAMklH,GAAE4D,GAAGx0H,EAAE80H,eAAe90H,EAAE80H,cAAcjnB,EAAK,OAAOn4F,EAAE,GAAGi0G,GAAGj0G,EAAEhK,MAAMmiG,IAAI,GAAGn4F,EAAEqiC,WAAWtoC,EAAEsoC,WAAWg5E,GAAG7nH,QAAQ,CAAChE,EAAEg8H,GAAGj8H,EAAEC,EAAExF,GAAG,MAAMuF,CAAC,OAAO,IAAc,QAAVyQ,EAAExQ,EAAE8wC,SAAiBtgC,EAAEskG,OAAO90G,GAAG,OAAOwQ,GAAG,CAAC,IAAI+pB,EAAE/pB,EAAEw/G,aAAa,GAAG,OAAOz1F,EAAE,CAACouE,EAAEn4F,EAAEsgC,MAAM,IAAI,IAAI1hC,EAAEmrB,EAAE01F,aAAa,OAAO7gH,GAAG,CAAC,GAAGA,EAAEktB,UAAUxhC,EAAE,CAAC,GAAG,IAAI0V,EAAEnU,IAAI,EAAC+S,EAAEiiH,IAAI,EAAE72H,GAAGA,IAAK6B,IAAI,EAAE,IAAImvG,EAAEh7F,EAAEqgH,YAAY,GAAG,OAAOrlB,EAAE,CAAY,IAAIn2E,GAAfm2E,EAAEA,EAAEylB,QAAeC,QAAQ,OAAO77F,EAAEjmB,EAAE8gC,KAAK9gC,GAAGA,EAAE8gC,KAAK7a,EAAE6a,KAAK7a,EAAE6a,KAAK9gC,GAAGo8F,EAAE0lB,QAAQ9hH,CAAC,CAAC,CAACoB,EAAE0/G,OAAO11H,EAAgB,QAAd4U,EAAEoB,EAAEqkG,aAAqBzlG,EAAE8gH,OAAO11H,GAAGq1H,GAAGr/G,EAAEskG,OAClft6G,EAAEwF,GAAGu6B,EAAE21F,OAAO11H,EAAE,KAAK,CAAC4U,EAAEA,EAAE8gC,IAAI,CAAC,MAAM,GAAG,KAAK1/B,EAAEnU,IAAIssG,EAAEn4F,EAAE/J,OAAOzG,EAAEyG,KAAK,KAAK+J,EAAEsgC,WAAW,GAAG,KAAKtgC,EAAEnU,IAAI,CAAY,GAAG,QAAdssG,EAAEn4F,EAAEskG,QAAmB,MAAM7tG,MAAMG,EAAE,MAAMuhG,EAAEunB,OAAO11H,EAAgB,QAAd+/B,EAAEouE,EAAEkM,aAAqBt6E,EAAE21F,OAAO11H,GAAGq1H,GAAGlnB,EAAEnuG,EAAEwF,GAAG2oG,EAAEn4F,EAAE6kG,OAAO,MAAM1M,EAAEn4F,EAAEsgC,MAAM,GAAG,OAAO63D,EAAEA,EAAEmM,OAAOtkG,OAAO,IAAIm4F,EAAEn4F,EAAE,OAAOm4F,GAAG,CAAC,GAAGA,IAAI3oG,EAAE,CAAC2oG,EAAE,KAAK,KAAK,CAAa,GAAG,QAAfn4F,EAAEm4F,EAAE0M,SAAoB,CAAC7kG,EAAEskG,OAAOnM,EAAEmM,OAAOnM,EAAEn4F,EAAE,KAAK,CAACm4F,EAAEA,EAAEmM,MAAM,CAACtkG,EAAEm4F,CAAC,CAACmzB,GAAG/7H,EAAEC,EAAEuK,EAAEsoC,SAASr4C,GAAGwF,EAAEA,EAAE8wC,KAAK,CAAC,OAAO9wC,EAAE,KAAK,EAAE,OAAOuK,EAAEvK,EAAEyG,KAAK3L,EAAEkF,EAAEuuH,aAAa17E,SAASk9E,GAAG/vH,EAAExF,GAAWM,EAAEA,EAAVyP,EAAE6lH,GAAG7lH,IAAUvK,EAAE+0G,OAAO,EAAE+mB,GAAG/7H,EAAEC,EAAElF,EAAEN,GACpfwF,EAAE8wC,MAAM,KAAK,GAAG,OAAgBvmC,EAAE6kH,GAAXt0H,EAAEkF,EAAEyG,KAAYzG,EAAEuuH,cAA6B0N,GAAGl8H,EAAEC,EAAElF,EAAtByP,EAAE6kH,GAAGt0H,EAAE2L,KAAK8D,GAAc/P,GAAG,KAAK,GAAG,OAAO2hI,GAAGp8H,EAAEC,EAAEA,EAAEyG,KAAKzG,EAAEuuH,aAAa/zH,GAAG,KAAK,GAAG,OAAOM,EAAEkF,EAAEyG,KAAK8D,EAAEvK,EAAEuuH,aAAahkH,EAAEvK,EAAEouH,cAActzH,EAAEyP,EAAE6kH,GAAGt0H,EAAEyP,GAAGsyH,GAAG98H,EAAEC,GAAGA,EAAE3D,IAAI,EAAE8vH,GAAGrxH,IAAIiF,GAAE,EAAG0sH,GAAGzsH,IAAID,GAAE,EAAGgwH,GAAG/vH,EAAExF,GAAGu4H,GAAG/yH,EAAElF,EAAEyP,GAAG6oH,GAAGpzH,EAAElF,EAAEyP,EAAE/P,GAAGyiI,GAAG,KAAKj9H,EAAElF,GAAE,EAAGiF,EAAEvF,GAAG,KAAK,GAAG,OAAOqkI,GAAG9+H,EAAEC,EAAExF,GAAG,KAAK,GAAG,OAAO6hI,GAAGt8H,EAAEC,EAAExF,GAAG,MAAMyM,MAAMG,EAAE,IAAIpH,EAAE3D,KAAM,EAYxC,IAAIsqI,GAAG,oBAAoBC,YAAYA,YAAY,SAAS7mI,GAAGhD,QAAQyN,MAAMzK,EAAE,EAAE,SAAS8mI,GAAG9mI,GAAG8H,KAAKi/H,cAAc/mI,CAAC,CACjI,SAAS6pC,GAAG7pC,GAAG8H,KAAKi/H,cAAc/mI,CAAC,CAC5J,SAASgnI,GAAGhnI,GAAG,SAASA,GAAG,IAAIA,EAAE4yE,UAAU,IAAI5yE,EAAE4yE,UAAU,KAAK5yE,EAAE4yE,SAAS,CAAC,SAASq0D,GAAGjnI,GAAG,SAASA,GAAG,IAAIA,EAAE4yE,UAAU,IAAI5yE,EAAE4yE,UAAU,KAAK5yE,EAAE4yE,WAAW,IAAI5yE,EAAE4yE,UAAU,iCAAiC5yE,EAAEivG,WAAW,CAAC,SAASi4B,KAAK,CAExa,SAASC,GAAGnnI,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,IAAIiG,EAAEhW,EAAEsmI,oBAAoB,GAAGtwH,EAAE,CAAC,IAAIm4F,EAAEn4F,EAAE,GAAG,oBAAoBjG,EAAE,CAAC,IAAIgwB,EAAEhwB,EAAEA,EAAE,WAAW,IAAIxK,EAAEumI,GAAG39B,GAAGpuE,EAAE5rB,KAAK5O,EAAE,CAAC,CAACsmI,GAAGrmI,EAAE2oG,EAAE5oG,EAAEwK,EAAE,MAAMo+F,EADxJ,SAAY5oG,EAAEC,EAAExF,EAAEM,EAAEyP,GAAG,GAAGA,EAAE,CAAC,GAAG,oBAAoBzP,EAAE,CAAC,IAAI0V,EAAE1V,EAAEA,EAAE,WAAW,IAAIiF,EAAEumI,GAAG39B,GAAGn4F,EAAE7B,KAAK5O,EAAE,CAAC,CAAC,IAAI4oG,EAAEy9B,GAAGpmI,EAAElF,EAAEiF,EAAE,EAAE,MAAK,EAAG,EAAG,GAAGknI,IAAmF,OAA/ElnI,EAAE+gI,oBAAoBn4B,EAAE5oG,EAAEopH,IAAIxgB,EAAE3kG,QAAQ2kH,GAAG,IAAI5oH,EAAE4yE,SAAS5yE,EAAEm0B,WAAWn0B,GAAG+kI,KAAYn8B,CAAC,CAAC,KAAKp+F,EAAExK,EAAEgvG,WAAWhvG,EAAEkxB,YAAY1mB,GAAG,GAAG,oBAAoBzP,EAAE,CAAC,IAAIy/B,EAAEz/B,EAAEA,EAAE,WAAW,IAAIiF,EAAEumI,GAAGl3H,GAAGmrB,EAAE5rB,KAAK5O,EAAE,CAAC,CAAC,IAAIqP,EAAE62H,GAAGlmI,EAAE,GAAE,EAAG,KAAK,GAAK,EAAG,EAAG,GAAGknI,IAA0G,OAAtGlnI,EAAE+gI,oBAAoB1xH,EAAErP,EAAEopH,IAAI/5G,EAAEpL,QAAQ2kH,GAAG,IAAI5oH,EAAE4yE,SAAS5yE,EAAEm0B,WAAWn0B,GAAG+kI,IAAG,WAAWuB,GAAGrmI,EAAEoP,EAAE5U,EAAEM,EAAE,IAAUsU,CAAC,CACpU+3H,CAAG3sI,EAAEwF,EAAED,EAAEwK,EAAEzP,GAAG,OAAOwrI,GAAG39B,EAAE,CAHpL/+D,GAAGt8B,UAAUq+F,OAAOk7B,GAAGv5H,UAAUq+F,OAAO,SAAS5rG,GAAG,IAAIC,EAAE6H,KAAKi/H,cAAc,GAAG,OAAO9mI,EAAE,MAAMiH,MAAMG,EAAE,MAAMi/H,GAAGtmI,EAAEC,EAAE,KAAK,KAAK,EAAE4pC,GAAGt8B,UAAU85H,QAAQP,GAAGv5H,UAAU85H,QAAQ,WAAW,IAAIrnI,EAAE8H,KAAKi/H,cAAc,GAAG,OAAO/mI,EAAE,CAAC8H,KAAKi/H,cAAc,KAAK,IAAI9mI,EAAED,EAAEg6G,cAAc+qB,IAAG,WAAWuB,GAAG,KAAKtmI,EAAE,KAAK,KAAK,IAAGC,EAAEmpH,IAAI,IAAI,CAAC,EACzTv/E,GAAGt8B,UAAU+5H,2BAA2B,SAAStnI,GAAG,GAAGA,EAAE,CAAC,IAAIC,EAAEy4G,KAAK14G,EAAE,CAACy5G,UAAU,KAAK7uG,OAAO5K,EAAEgrC,SAAS/qC,GAAG,IAAI,IAAIxF,EAAE,EAAEA,EAAE0+G,GAAGn/G,QAAQ,IAAIiG,GAAGA,EAAEk5G,GAAG1+G,GAAGuwC,SAASvwC,KAAK0+G,GAAGt8E,OAAOpiC,EAAE,EAAEuF,GAAG,IAAIvF,GAAGo/G,GAAG75G,EAAE,CAAC,EAEXu4G,GAAG,SAASv4G,GAAG,OAAOA,EAAE1D,KAAK,KAAK,EAAE,IAAI2D,EAAED,EAAE0zG,UAAU,GAAGzzG,EAAEgE,QAAQixG,cAAc6E,aAAa,CAAC,IAAIt/G,EAAE88G,GAAGt3G,EAAEw3G,cAAc,IAAIh9G,IAAI29G,GAAGn4G,EAAI,EAAFxF,GAAK+oI,GAAGvjI,EAAEg2G,MAAK,KAAO,EAAFyb,MAAOkO,GAAG3pB,KAAI,IAAIgX,MAAM,CAAC,MAAM,KAAK,GAAG8X,IAAG,WAAW,IAAI9kI,EAAE0wH,GAAG3wH,EAAE,GAAG,GAAG,OAAOC,EAAE,CAAC,IAAIxF,EAAE+3H,KAAIE,GAAGzyH,EAAED,EAAE,EAAEvF,EAAE,CAAC,IAAGgsI,GAAGzmI,EAAE,GAAG,EAC/bw4G,GAAG,SAASx4G,GAAG,GAAG,KAAKA,EAAE1D,IAAI,CAAC,IAAI2D,EAAE0wH,GAAG3wH,EAAE,WAAW,GAAG,OAAOC,EAAayyH,GAAGzyH,EAAED,EAAE,UAAXwyH,MAAwBiU,GAAGzmI,EAAE,UAAU,CAAC,EAAEy4G,GAAG,SAASz4G,GAAG,GAAG,KAAKA,EAAE1D,IAAI,CAAC,IAAI2D,EAAEwyH,GAAGzyH,GAAGvF,EAAEk2H,GAAG3wH,EAAEC,GAAG,GAAG,OAAOxF,EAAai4H,GAAGj4H,EAAEuF,EAAEC,EAAXuyH,MAAgBiU,GAAGzmI,EAAEC,EAAE,CAAC,EAAEy4G,GAAG,WAAW,OAAOL,EAAC,EAAEM,GAAG,SAAS34G,EAAEC,GAAG,IAAIxF,EAAE49G,GAAE,IAAI,OAAOA,GAAEr4G,EAAEC,GAAG,CAAC,QAAQo4G,GAAE59G,CAAC,CAAC,EAClS44G,GAAG,SAASrzG,EAAEC,EAAExF,GAAG,OAAOwF,GAAG,IAAK,QAAyB,GAAjBytG,EAAG1tG,EAAEvF,GAAGwF,EAAExF,EAAEP,KAAQ,UAAUO,EAAEiM,MAAM,MAAMzG,EAAE,CAAC,IAAIxF,EAAEuF,EAAEvF,EAAE05B,YAAY15B,EAAEA,EAAE05B,WAAsF,IAA3E15B,EAAEA,EAAE8sI,iBAAiB,cAAchkI,KAAKC,UAAU,GAAGvD,GAAG,mBAAuBA,EAAE,EAAEA,EAAExF,EAAET,OAAOiG,IAAI,CAAC,IAAIlF,EAAEN,EAAEwF,GAAG,GAAGlF,IAAIiF,GAAGjF,EAAEgL,OAAO/F,EAAE+F,KAAK,CAAC,IAAIyE,EAAEmpG,GAAG54G,GAAG,IAAIyP,EAAE,MAAMtD,MAAMG,EAAE,KAAKylG,EAAG/xG,GAAG2yG,EAAG3yG,EAAEyP,EAAE,CAAC,CAAC,CAAC,MAAM,IAAK,WAAW4jG,GAAGpuG,EAAEvF,GAAG,MAAM,IAAK,SAAmB,OAAVwF,EAAExF,EAAEgM,QAAeqnG,GAAG9tG,IAAIvF,EAAE2kI,SAASn/H,GAAE,GAAI,EAAE6zG,GAAGgxB,GAAG/wB,GAAGgxB,GACpa,IAAIyC,GAAG,CAACC,uBAAsB,EAAGC,OAAO,CAACj0B,GAAGmQ,GAAGjQ,GAAGC,GAAGC,GAAGixB,KAAK6C,GAAG,CAACC,wBAAwB9tB,GAAG+tB,WAAW,EAAE7rH,QAAQ,SAAS8rH,oBAAoB,aAC1IC,GAAG,CAACF,WAAWF,GAAGE,WAAW7rH,QAAQ2rH,GAAG3rH,QAAQ8rH,oBAAoBH,GAAGG,oBAAoBE,eAAeL,GAAGK,eAAeC,kBAAkB,KAAKC,4BAA4B,KAAKC,4BAA4B,KAAKC,cAAc,KAAKC,wBAAwB,KAAKC,wBAAwB,KAAKC,gBAAgB,KAAKC,mBAAmB,KAAKC,eAAe,KAAKC,qBAAqB3+B,EAAG2rB,uBAAuBiT,wBAAwB,SAAS3oI,GAAW,OAAO,QAAfA,EAAEq1G,GAAGr1G,IAAmB,KAAKA,EAAE0zG,SAAS,EAAEk0B,wBAAwBD,GAAGC,yBARjN,WAAc,OAAO,IAAI,EASpUgB,4BAA4B,KAAKC,gBAAgB,KAAKC,aAAa,KAAKC,kBAAkB,KAAKC,gBAAgB,KAAKC,kBAAkB,kCAAkC,GAAG,qBAAqBC,+BAA+B,CAAC,IAAIC,GAAGD,+BAA+B,IAAIC,GAAGC,YAAYD,GAAGE,cAAc,IAAItyB,GAAGoyB,GAAGG,OAAOvB,IAAI/wB,GAAGmyB,EAAE,CAAC,MAAMnpI,IAAG,CAAC,CAAC2yE,EAAQq3B,mDAAmDw9B,GAC9Y70D,EAAQ42D,aAAa,SAASvpI,EAAEC,GAAG,IAAIxF,EAAE,EAAEV,UAAUC,aAAQ,IAASD,UAAU,GAAGA,UAAU,GAAG,KAAK,IAAIitI,GAAG/mI,GAAG,MAAMiH,MAAMG,EAAE,MAAM,OAbuH,SAAYrH,EAAEC,EAAExF,GAAG,IAAIM,EAAE,EAAEhB,UAAUC,aAAQ,IAASD,UAAU,GAAGA,UAAU,GAAG,KAAK,MAAM,CAAC+xG,SAAS3B,EAAGlrG,IAAI,MAAMlE,EAAE,KAAK,GAAGA,EAAE+3C,SAAS9yC,EAAEg6G,cAAc/5G,EAAEm0H,eAAe35H,EAAE,CAa1R+uI,CAAGxpI,EAAEC,EAAE,KAAKxF,EAAE,EAAEk4E,EAAQ82D,WAAW,SAASzpI,EAAEC,GAAG,IAAI+mI,GAAGhnI,GAAG,MAAMkH,MAAMG,EAAE,MAAM,IAAI5M,GAAE,EAAGM,EAAE,GAAGyP,EAAEo8H,GAA4P,OAAzP,OAAO3mI,QAAG,IAASA,KAAI,IAAKA,EAAEypI,sBAAsBjvI,GAAE,QAAI,IAASwF,EAAE06H,mBAAmB5/H,EAAEkF,EAAE06H,uBAAkB,IAAS16H,EAAEulI,qBAAqBh7H,EAAEvK,EAAEulI,qBAAqBvlI,EAAEimI,GAAGlmI,EAAE,GAAE,EAAG,KAAK,EAAKvF,EAAE,EAAGM,EAAEyP,GAAGxK,EAAEopH,IAAInpH,EAAEgE,QAAQ2kH,GAAG,IAAI5oH,EAAE4yE,SAAS5yE,EAAEm0B,WAAWn0B,GAAU,IAAI8mI,GAAG7mI,EAAE,EACrf0yE,EAAQg3D,YAAY,SAAS3pI,GAAG,GAAG,MAAMA,EAAE,OAAO,KAAK,GAAG,IAAIA,EAAE4yE,SAAS,OAAO5yE,EAAE,IAAIC,EAAED,EAAEsyH,gBAAgB,QAAG,IAASryH,EAAE,CAAC,GAAG,oBAAoBD,EAAE4rG,OAAO,MAAM1kG,MAAMG,EAAE,MAAiC,MAA3BrH,EAAE1B,OAAOC,KAAKyB,GAAGkJ,KAAK,KAAWhC,MAAMG,EAAE,IAAIrH,GAAI,CAAqC,OAA5BA,EAAE,QAAVA,EAAEq1G,GAAGp1G,IAAc,KAAKD,EAAE0zG,SAAkB,EAAE/gC,EAAQi3D,UAAU,SAAS5pI,GAAG,OAAO+kI,GAAG/kI,EAAE,EAAE2yE,EAAQk3D,QAAQ,SAAS7pI,EAAEC,EAAExF,GAAG,IAAIwsI,GAAGhnI,GAAG,MAAMiH,MAAMG,EAAE,MAAM,OAAO8/H,GAAG,KAAKnnI,EAAEC,GAAE,EAAGxF,EAAE,EAC/Yk4E,EAAQm3D,YAAY,SAAS9pI,EAAEC,EAAExF,GAAG,IAAIusI,GAAGhnI,GAAG,MAAMkH,MAAMG,EAAE,MAAM,IAAItM,EAAE,MAAMN,GAAGA,EAAEsvI,iBAAiB,KAAKv/H,GAAE,EAAGiG,EAAE,GAAGm4F,EAAEg+B,GAAyO,GAAtO,OAAOnsI,QAAG,IAASA,KAAI,IAAKA,EAAEivI,sBAAsBl/H,GAAE,QAAI,IAAS/P,EAAEkgI,mBAAmBlqH,EAAEhW,EAAEkgI,uBAAkB,IAASlgI,EAAE+qI,qBAAqB58B,EAAEnuG,EAAE+qI,qBAAqBvlI,EAAEomI,GAAGpmI,EAAE,KAAKD,EAAE,EAAE,MAAMvF,EAAEA,EAAE,KAAK+P,EAAE,EAAGiG,EAAEm4F,GAAG5oG,EAAEopH,IAAInpH,EAAEgE,QAAQ2kH,GAAG5oH,GAAMjF,EAAE,IAAIiF,EAAE,EAAEA,EAAEjF,EAAEf,OAAOgG,IAA2BwK,GAAhBA,GAAP/P,EAAEM,EAAEiF,IAAOgqI,aAAgBvvI,EAAEwvI,SAAS,MAAMhqI,EAAEgmI,gCAAgChmI,EAAEgmI,gCAAgC,CAACxrI,EAAE+P,GAAGvK,EAAEgmI,gCAAgCtnI,KAAKlE,EACvhB+P,GAAG,OAAO,IAAIq/B,GAAG5pC,EAAE,EAAE0yE,EAAQi5B,OAAO,SAAS5rG,EAAEC,EAAExF,GAAG,IAAIwsI,GAAGhnI,GAAG,MAAMiH,MAAMG,EAAE,MAAM,OAAO8/H,GAAG,KAAKnnI,EAAEC,GAAE,EAAGxF,EAAE,EAAEk4E,EAAQu3D,uBAAuB,SAASlqI,GAAG,IAAIinI,GAAGjnI,GAAG,MAAMkH,MAAMG,EAAE,KAAK,QAAOrH,EAAE+gI,sBAAqBgE,IAAG,WAAWoC,GAAG,KAAK,KAAKnnI,GAAE,GAAG,WAAWA,EAAE+gI,oBAAoB,KAAK/gI,EAAEopH,IAAI,IAAI,GAAE,KAAG,EAAM,EAAEz2C,EAAQw3D,wBAAwBrF,GAC/UnyD,EAAQy3D,oCAAoC,SAASpqI,EAAEC,EAAExF,EAAEM,GAAG,IAAIksI,GAAGxsI,GAAG,MAAMyM,MAAMG,EAAE,MAAM,GAAG,MAAMrH,QAAG,IAASA,EAAEsyH,gBAAgB,MAAMprH,MAAMG,EAAE,KAAK,OAAO8/H,GAAGnnI,EAAEC,EAAExF,GAAE,EAAGM,EAAE,EAAE43E,EAAQ32D,QAAQ,8DChU7L,IAAIsZ,EAAI69C,EAAQ,MAEdR,EAAQ82D,WAAan0G,EAAEm0G,WACvB92D,EAAQm3D,YAAcx0G,EAAEw0G,0CCH1B,SAASO,IAEP,GAC4C,qBAAnCnB,gCAC4C,oBAA5CA,+BAA+BmB,SAcxC,IAEEnB,+BAA+BmB,SAASA,EAC1C,CAAE,MAAO1sE,GAGP3gE,QAAQyN,MAAMkzD,EAChB,CACF,CAKE0sE,GACAv3D,EAAOH,QAAU,EAAjBG,4dCuL8C,IAAIj+D,IAAI,CACtD,oCACA,sBACA,8ICgBF,IACEhZ,OAAOyuI,qBAHT,GAIC,CAAC,MAAO9/H,GACP,CA0IiE,IAAIgI,IAkCvE,MACM+3H,GAAsBC,IAAAA,EAAAA,EAAAA,EAAAA,EAAAA,KAAsB,iBAE5BC,IAAAA,EAAAA,EAAAA,EAAAA,EAAAA,KAAmB,WAEvBD,IAAAA,EAAAA,EAAAA,EAAAA,EAAAA,KAAY,MAmVxB,SAAUE,EAAaC,GAKR,IALS,SAC5BllE,EAAQ,SACR3yB,EAAQ,OACR83F,EAAM,OACN/uI,GACmB8uI,EACfE,EAAaL,EAAAA,SACS,MAAtBK,EAAW5mI,UACb4mI,EAAW5mI,SAAUm/D,EAAAA,EAAAA,IAAqB,CAAEvnE,SAAQyoE,UAAU,KAGhE,IAAIC,EAAUsmE,EAAW5mI,SACpBjB,EAAO8nI,GAAgBN,EAAAA,SAAe,CACzCvnI,OAAQshE,EAAQthE,OAChB1H,SAAUgpE,EAAQhpE,YAEhB,mBAAEwvI,GAAuBH,GAAU,CAAC,EACpCI,EAAWR,EAAAA,aACZS,IACCF,GAAsBR,EAClBA,GAAoB,IAAMO,EAAaG,KACvCH,EAAaG,EAAS,GAE5B,CAACH,EAAcC,IAKjB,OAFAP,EAAAA,iBAAsB,IAAMjmE,EAAQliC,OAAO2oG,IAAW,CAACzmE,EAASymE,IAG9DR,EAAAA,cAACU,EAAAA,GAAM,CACLzlE,SAAUA,EACV3yB,SAAUA,EACVv3C,SAAUyH,EAAMzH,SAChB4vI,eAAgBnoI,EAAMC,OACtB6J,UAAWy3D,EACXqmE,OAAQA,GAGd,CAqHA,MAAMQ,EACc,qBAAXvvI,QACoB,qBAApBA,OAAOxB,UAC2B,qBAAlCwB,OAAOxB,SAAS2L,cAEnBqlI,EAAqB,gCAKdC,EAAOd,EAAAA,YAClB,SAAoBe,EAalB9vE,GAAG,IAKC+vE,GAjBJ,QACElM,EAAO,SACPmM,EAAQ,eACRC,EAAc,QACdphI,EAAO,MACPtH,EAAK,OACL4H,EAAM,GACNkvD,EAAE,mBACF6xE,EAAkB,wBAClBC,GAEDL,EADItkE,EAAI4kE,EAAAN,EAAAO,IAIL,SAAErmE,GAAa+kE,EAAAA,WAAiBuB,EAAAA,IAIhCC,GAAa,EAEjB,GAAkB,kBAAPlyE,GAAmBuxE,EAAmBr+H,KAAK8sD,KAEpD0xE,EAAe1xE,EAGXsxE,GACF,IACE,IAAIa,EAAa,IAAIpnE,IAAIhpE,OAAON,SAASq1B,MACrCs7G,EAAYpyE,EAAG2M,WAAW,MAC1B,IAAI5B,IAAIonE,EAAW1uI,SAAWu8D,GAC9B,IAAI+K,IAAI/K,GACRn8B,GAAO+nC,EAAAA,EAAAA,IAAcwmE,EAAU1wI,SAAUiqE,GAEzCymE,EAAUj3G,SAAWg3G,EAAWh3G,QAAkB,MAAR0I,EAE5Cm8B,EAAKn8B,EAAOuuG,EAAUtwI,OAASswI,EAAU1wG,KAEzCwwG,GAAa,EAEf,MAAOxhI,GAOR,CAKL,IAAIomB,GAAOu7G,EAAAA,EAAAA,IAAQryE,EAAI,CAAE2xE,aAErBW,EA0YF,SACJtyE,EAAMuyE,GAeA,IAdN,OACEzhI,EACAN,QAASgiI,EAAW,MACpBtpI,EAAK,mBACL2oI,EAAkB,SAClBF,EAAQ,wBACRG,cAQE,CAAC,EAACS,EAEFE,GAAWC,EAAAA,EAAAA,MACXjxI,GAAWkxI,EAAAA,EAAAA,MACX9uG,GAAO+uG,EAAAA,EAAAA,IAAgB5yE,EAAI,CAAE2xE,aAEjC,OAAOjB,EAAAA,aACJ/pH,IACC,GD90CU,SACdA,EACA7V,GAEA,OACmB,IAAjB6V,EAAMy9F,UACJtzG,GAAqB,UAAXA,KAVhB,SAAyB6V,GACvB,SAAUA,EAAMs9F,SAAWt9F,EAAMq9F,QAAUr9F,EAAMm9F,SAAWn9F,EAAMo9F,SACpE,CASK8uB,CAAgBlsH,EAErB,CCq0CUmsH,CAAuBnsH,EAAO7V,GAAS,CACzC6V,EAAM27F,iBAIN,IAAI9xG,OACcrQ,IAAhBqyI,EACIA,GACA7oE,EAAAA,EAAAA,IAAWloE,MAAckoE,EAAAA,EAAAA,IAAW9lC,GAE1C4uG,EAASzyE,EAAI,CACXxvD,UACAtH,QACA2oI,qBACAF,WACAG,2BAEH,IAEH,CACErwI,EACAgxI,EACA5uG,EACA2uG,EACAtpI,EACA4H,EACAkvD,EACA6xE,EACAF,EACAG,GAGN,CAlc0BiB,CAAoB/yE,EAAI,CAC5CxvD,UACAtH,QACA4H,SACA+gI,qBACAF,WACAG,4BAWF,OAEEpB,EAAAA,cAAA,IAAA3mE,EAAA,GACMoD,EAAI,CACRr2C,KAAM46G,GAAgB56G,EACtB0uG,QAAS0M,GAAcN,EAAiBpM,EAd5C,SACE7+G,GAEI6+G,GAASA,EAAQ7+G,GAChBA,EAAMw7F,kBACTmwB,EAAgB3rH,EAEpB,EAQIg7C,IAAKA,EACL7wD,OAAQA,IAGd,IAsUF,IAAKkiI,EAQAC,GARL,SAAKD,GACHA,EAAA,4CACAA,EAAA,sBACAA,EAAA,oCACAA,EAAA,wBACAA,EAAA,+CACD,EAND,CAAKA,IAAAA,EAMJ,KAED,SAAKC,GACHA,EAAA,wBACAA,EAAA,0BACAA,EAAA,2CACD,CAJD,CAAKA,IAAAA,EAIJ,+YC5uCM,MAAMC,EACXxC,EAAAA,cAAoD,MAK/C,MAAMyC,EAAyBzC,EAAAA,cAEpC,MA8CK,MAAM0C,EAAoB1C,EAAAA,cAC/B,MAYK,MAAM2C,EAAkB3C,EAAAA,cAC7B,YAaW4C,EAAe5C,EAAAA,cAAwC,CAClE6C,OAAQ,KACR73F,QAAS,GACT83F,aAAa,IAOR,MAAMC,EAAoB/C,EAAAA,cAAyB,MCpHnD,SAAS2B,EACdryE,EAAMuyE,GAEE,IADR,SAAEZ,QAA8C,IAAAY,EAAG,CAAC,EAACA,EAGnDmB,MADFC,EAAAA,EAAAA,KAAU,GAOV,IAAI,SAAEhoE,EAAQ,UAAE34D,GAAc09H,EAAAA,WAAiB0C,IAC3C,KAAE1xG,EAAI,SAAEhgC,EAAQ,OAAEI,GAAW8wI,EAAgB5yE,EAAI,CAAE2xE,aAEnDiC,EAAiBlyI,EAWrB,MALiB,MAAbiqE,IACFioE,EACe,MAAblyI,EAAmBiqE,GAAWiB,EAAAA,EAAAA,IAAU,CAACjB,EAAUjqE,KAGhDsR,EAAUq3D,WAAW,CAAE3oE,SAAUkyI,EAAgB9xI,SAAQ4/B,QAClE,CAOO,SAASgyG,IACd,OAA4C,MAArChD,EAAAA,WAAiB2C,EAC1B,CAYO,SAASV,IAQd,OANEe,MADFC,EAAAA,EAAAA,KAAU,GAOHjD,EAAAA,WAAiB2C,GAAiB5xI,QAC3C,CAkDA,SAASoyI,EACPhgC,GAEe68B,EAAAA,WAAiB0C,GAAmBU,QAKjDpD,EAAAA,gBAAsB78B,EAE1B,CAQO,SAAS6+B,IACd,IAAI,YAAEc,GAAgB9C,EAAAA,WAAiB4C,GAGvC,OAAOE,EAo3BT,WACE,IAAI,OAAEO,GAAWC,EAAqBhB,EAAeiB,mBACjD1oH,EAAK2oH,EAAkBjB,EAAoBgB,mBAE3CE,EAAYzD,EAAAA,QAAa,GAsB7B,OArBAmD,GAA0B,KACxBM,EAAUhqI,SAAU,CAAI,IAGOumI,EAAAA,aAC/B,SAAC1wE,EAAiBtmD,QAAwB,IAAxBA,IAAAA,EAA2B,CAAC,GAKvCy6H,EAAUhqI,UAEG,kBAAP61D,EACT+zE,EAAOtB,SAASzyE,GAEhB+zE,EAAOtB,SAASzyE,EAAE+J,EAAA,CAAIqqE,YAAa7oH,GAAO7R,IAE9C,GACA,CAACq6H,EAAQxoH,GAIb,CA/4BuB8oH,GAGvB,WAEIX,MADFC,EAAAA,EAAAA,KAAU,GAOV,IAAIW,EAAoB5D,EAAAA,WAAiBwC,IACrC,SAAEvnE,EAAQ,OAAEmlE,EAAM,UAAE99H,GAAc09H,EAAAA,WAAiB0C,IACnD,QAAE13F,GAAYg1F,EAAAA,WAAiB4C,IAC7B5xI,SAAUouE,GAAqB6iE,IAEjC4B,EAAqB9qI,KAAKC,WAC5B8qI,EAAAA,EAAAA,IAAoB94F,EAASo1F,EAAOrhE,uBAGlC0kE,EAAYzD,EAAAA,QAAa,GAqD7B,OApDAmD,GAA0B,KACxBM,EAAUhqI,SAAU,CAAI,IAGOumI,EAAAA,aAC/B,SAAC1wE,EAAiBtmD,GAKhB,QALwC,IAAxBA,IAAAA,EAA2B,CAAC,IAKvCy6H,EAAUhqI,QAAS,OAExB,GAAkB,kBAAP61D,EAET,YADAhtD,EAAUs4D,GAAGtL,GAIf,IAAIn8B,GAAO8rC,EAAAA,EAAAA,IACT3P,EACAv2D,KAAKO,MAAMuqI,GACXzkE,EACqB,SAArBp2D,EAAQi4H,UASe,MAArB2C,GAA0C,MAAb3oE,IAC/B9nC,EAAKniC,SACe,MAAlBmiC,EAAKniC,SACDiqE,GACAiB,EAAAA,EAAAA,IAAU,CAACjB,EAAU9nC,EAAKniC,aAG/BgY,EAAQlJ,QAAUwC,EAAUxC,QAAUwC,EAAUnO,MACjDg/B,EACAnqB,EAAQxQ,MACRwQ,EAEJ,GACA,CACEiyD,EACA34D,EACAuhI,EACAzkE,EACAwkE,GAKN,CA1E6CG,EAC7C,CA2EA,MAAMC,EAAgBhE,EAAAA,cAA6B,MAiC5C,SAASiE,IAKd,IAAI,QAAEj5F,GAAYg1F,EAAAA,WAAiB4C,GAC/BsB,EAAal5F,EAAQA,EAAQx7C,OAAS,GAC1C,OAAO00I,EAAcA,EAAW1iH,OAAiB,CAAC,CACpD,CAOO,SAAS0gH,EACd5yE,EAAM60E,GAEA,IADN,SAAElD,QAA8C,IAAAkD,EAAG,CAAC,EAACA,GAEjD,OAAE/D,GAAWJ,EAAAA,WAAiB0C,IAC9B,QAAE13F,GAAYg1F,EAAAA,WAAiB4C,IAC7B5xI,SAAUouE,GAAqB6iE,IACjC4B,EAAqB9qI,KAAKC,WAC5B8qI,EAAAA,EAAAA,IAAoB94F,EAASo1F,EAAOrhE,uBAGtC,OAAOihE,EAAAA,SACL,KACE/gE,EAAAA,EAAAA,IACE3P,EACAv2D,KAAKO,MAAMuqI,GACXzkE,EACa,SAAb6hE,IAEJ,CAAC3xE,EAAIu0E,EAAoBzkE,EAAkB6hE,GAE/C,CAkBO,SAASmD,EACdrpE,EACAC,EACAqpE,EACAjE,GAGE4C,MADFC,EAAAA,EAAAA,KAAU,GAOV,IAAI,UAAE3gI,GAAc09H,EAAAA,WAAiB0C,IAC/B13F,QAASs5F,GAAkBtE,EAAAA,WAAiB4C,GAC9CsB,EAAaI,EAAcA,EAAc90I,OAAS,GAClD+0I,EAAeL,EAAaA,EAAW1iH,OAAS,CAAC,EAEjDgjH,GADiBN,GAAaA,EAAWlzI,SACpBkzI,EAAaA,EAAWrmE,aAAe,KAC9CqmE,GAAcA,EAAWnoE,MAqC3C,IAEIhrE,EAFA0zI,EAAsBxC,IAG1B,GAAIjnE,EAAa,KAAA0pE,EACf,IAAIC,EACqB,kBAAhB3pE,GAA2B1B,EAAAA,EAAAA,IAAU0B,GAAeA,EAGpC,MAAvBwpE,IAC4B,OADFE,EACxBC,EAAkB3zI,eAAQ,EAA1B0zI,EAA4BzoE,WAAWuoE,MAF3CvB,EAAAA,EAAAA,KAAU,GASVlyI,EAAW4zI,CACb,MACE5zI,EAAW0zI,EAGb,IAAIzzI,EAAWD,EAASC,UAAY,IAEhC2sE,EAAoB3sE,EACxB,GAA2B,MAAvBwzI,EAA4B,CAe9B,IAAII,EAAiBJ,EAAmB1kI,QAAQ,MAAO,IAAI/P,MAAM,KAEjE4tE,EAAoB,IADL3sE,EAAS8O,QAAQ,MAAO,IAAI/P,MAAM,KACdkE,MAAM2wI,EAAep1I,QAAQkP,KAAK,IACvE,CAEA,IAAIssC,GAAU8vB,EAAAA,EAAAA,IAAYC,EAAQ,CAAE/pE,SAAU2sE,IAmB9C,IAAIknE,EAAkBC,EACpB95F,GACEA,EAAQ50C,KAAK6K,GACXnN,OAAOugB,OAAO,CAAC,EAAGpT,EAAO,CACvBugB,OAAQ1tB,OAAOugB,OAAO,CAAC,EAAGkwH,EAActjI,EAAMugB,QAC9CxwB,UAAUkrE,EAAAA,EAAAA,IAAU,CAClBsoE,EAEAliI,EAAUi4D,eACNj4D,EAAUi4D,eAAet5D,EAAMjQ,UAAUA,SACzCiQ,EAAMjQ,WAEZ6sE,aACyB,MAAvB58D,EAAM48D,aACF2mE,GACAtoE,EAAAA,EAAAA,IAAU,CACRsoE,EAEAliI,EAAUi4D,eACNj4D,EAAUi4D,eAAet5D,EAAM48D,cAAc7sE,SAC7CiQ,EAAM48D,mBAIxBymE,EACAD,EACAjE,GAMF,OAAIplE,GAAe6pE,EAEf7E,EAAAA,cAAC2C,EAAgB/6H,SAAQ,CACvB3L,MAAO,CACLlL,SAAQsoE,EAAA,CACNroE,SAAU,IACVI,OAAQ,GACR4/B,KAAM,GACNx4B,MAAO,KACP/D,IAAK,WACF1D,GAEL4vI,eAAgBjoE,EAAAA,GAAesB,MAGhC6qE,GAKAA,CACT,CAEA,SAASE,IACP,IAAI9kI,EAybC,WAAkC,IAAA+kI,EACvC,IAAI/kI,EAAQ+/H,EAAAA,WAAiB+C,GACzBvqI,EAAQysI,EAAmB1C,EAAoB2C,eAC/CC,EAAU3B,EAAkBjB,EAAoB2C,eAIpD,QAAcz1I,IAAVwQ,EACF,OAAOA,EAIT,OAAO,OAAP+kI,EAAOxsI,EAAM6K,aAAN,EAAA2hI,EAAeG,EACxB,CAtccC,GACR5oI,GAAU2jE,EAAAA,EAAAA,IAAqBlgE,GAC5BA,EAAMu4B,OAAU,IAAAv4B,EAAMmgE,WACzBngE,aAAiBvD,MACjBuD,EAAMzD,QACNzD,KAAKC,UAAUiH,GACfoe,EAAQpe,aAAiBvD,MAAQuD,EAAMoe,MAAQ,KAC/CgnH,EAAY,yBACZC,EAAY,CAAEC,QAAS,SAAUC,gBAAiBH,GAsBtD,OACErF,EAAAA,cAAAA,EAAAA,SAAA,KACEA,EAAAA,cAAI,2CACJA,EAAAA,cAAA,MAAI94G,MAAO,CAAEu+G,UAAW,WAAajpI,GACpC6hB,EAAQ2hH,EAAAA,cAAA,OAAK94G,MAAOo+G,GAAYjnH,GAAe,KAvBtC,KA2BhB,CAEA,MAAMqnH,EAAsB1F,EAAAA,cAAC+E,EAAqB,MAgB3C,MAAMY,UAA4B3F,EAAAA,UAIvCtgI,WAAAA,CAAY+H,GACV5E,MAAM4E,GACNnK,KAAK9E,MAAQ,CACXzH,SAAU0W,EAAM1W,SAChB60I,aAAcn+H,EAAMm+H,aACpB3lI,MAAOwH,EAAMxH,MAEjB,CAEA,+BAAO2wH,CAAyB3wH,GAC9B,MAAO,CAAEA,MAAOA,EAClB,CAEA,+BAAO6oH,CACLrhH,EACAjP,GAUA,OACEA,EAAMzH,WAAa0W,EAAM1W,UACD,SAAvByH,EAAMotI,cAAkD,SAAvBn+H,EAAMm+H,aAEjC,CACL3lI,MAAOwH,EAAMxH,MACblP,SAAU0W,EAAM1W,SAChB60I,aAAcn+H,EAAMm+H,cAQjB,CACL3lI,WAAuBxQ,IAAhBgY,EAAMxH,MAAsBwH,EAAMxH,MAAQzH,EAAMyH,MACvDlP,SAAUyH,EAAMzH,SAChB60I,aAAcn+H,EAAMm+H,cAAgBptI,EAAMotI,aAE9C,CAEA/U,iBAAAA,CAAkB5wH,EAAY4lI,GAC5BrzI,QAAQyN,MACN,wDACAA,EACA4lI,EAEJ,CAEAzkC,MAAAA,GACE,YAA4B3xG,IAArB6N,KAAK9E,MAAMyH,MAChB+/H,EAAAA,cAAC4C,EAAah7H,SAAQ,CAAC3L,MAAOqB,KAAKmK,MAAMq+H,cACvC9F,EAAAA,cAAC+C,EAAkBn7H,SAAQ,CACzB3L,MAAOqB,KAAK9E,MAAMyH,MAClBqoC,SAAUhrC,KAAKmK,MAAMK,aAIzBxK,KAAKmK,MAAM6gC,QAEf,EASF,SAASy9F,EAAar7H,GAAwD,IAAvD,aAAEo7H,EAAY,MAAE7kI,EAAK,SAAEqnC,GAA8B59B,EACtEk5H,EAAoB5D,EAAAA,WAAiBwC,GAazC,OAREoB,GACAA,EAAkBR,QAClBQ,EAAkBoC,gBACjB/kI,EAAM86D,MAAMkqE,cAAgBhlI,EAAM86D,MAAMmqE,iBAEzCtC,EAAkBoC,cAAcG,2BAA6BllI,EAAM86D,MAAMlhD,IAIzEmlH,EAAAA,cAAC4C,EAAah7H,SAAQ,CAAC3L,MAAO6pI,GAC3Bx9F,EAGP,CAEO,SAASw8F,EACd95F,EACAs5F,EACAD,EACAjE,GAC2B,IAAAgG,EAC3B,QAJ2B,IAA3B9B,IAAAA,EAA8B,SACc,IAA5CD,IAAAA,EAA+C,WACX,IAApCjE,IAAAA,EAAuC,MAExB,MAAXp1F,EAAiB,KAAAq7F,EACnB,GAAmB,OAAnBA,EAAIhC,KAAAgC,EAAiBhjI,OAKnB,OAAO,KAFP2nC,EAAUq5F,EAAgBr5F,OAI9B,CAEA,IAAI65F,EAAkB75F,EAGlB3nC,EAAS,OAAH+iI,EAAG/B,QAAA,EAAA+B,EAAiB/iI,OAC9B,GAAc,MAAVA,EAAgB,CAClB,IAAIijI,EAAazB,EAAgBntF,WAC9B5sB,GAAMA,EAAEixC,MAAMlhD,KAAM,MAAAxX,OAAA,EAAAA,EAASynB,EAAEixC,MAAMlhD,OAGtCyrH,GAAc,IADhBrD,EAAAA,EAAAA,KAAU,GAMV4B,EAAkBA,EAAgB5wI,MAChC,EACAopB,KAAKG,IAAIqnH,EAAgBr1I,OAAQ82I,EAAa,GAElD,CAIA,IAAIC,GAAiB,EACjBC,GAAiB,EACrB,GAAInC,GAAmBjE,GAAUA,EAAOqG,oBACtC,IAAK,IAAIz2I,EAAI,EAAGA,EAAI60I,EAAgBr1I,OAAQQ,IAAK,CAC/C,IAAIiR,EAAQ4jI,EAAgB70I,GAM5B,IAJIiR,EAAM86D,MAAM2qE,iBAAmBzlI,EAAM86D,MAAM4qE,0BAC7CH,EAAgBx2I,GAGdiR,EAAM86D,MAAMlhD,GAAI,CAClB,IAAI,WAAE+rH,EAAU,OAAEvjI,GAAWghI,EACzBwC,EACF5lI,EAAM86D,MAAM1jE,aACmB5I,IAA/Bm3I,EAAW3lI,EAAM86D,MAAMlhD,OACrBxX,QAAqC5T,IAA3B4T,EAAOpC,EAAM86D,MAAMlhD,KACjC,GAAI5Z,EAAM86D,MAAM+qE,MAAQD,EAAkB,CAIxCN,GAAiB,EAEf1B,EADE2B,GAAiB,EACD3B,EAAgB5wI,MAAM,EAAGuyI,EAAgB,GAEzC,CAAC3B,EAAgB,IAErC,KACF,CACF,CACF,CAGF,OAAOA,EAAgBhrC,aAAY,CAACgpC,EAAQ5hI,EAAOgQ,KAEjD,IAAIhR,EACA8mI,GAA8B,EAC9Bd,EAAuC,KACvCU,EAAiD,KA0VzD,IAAqBlyI,EAzVb4vI,IACFpkI,EAAQoD,GAAUpC,EAAM86D,MAAMlhD,GAAKxX,EAAOpC,EAAM86D,MAAMlhD,SAAMprB,EAC5Dw2I,EAAehlI,EAAM86D,MAAMkqE,cAAgBP,EAEvCa,IACEC,EAAgB,GAAe,IAAVv1H,GAoVZxc,EAlVT,kBACA,GAkVIuyI,EAAcvyI,KAC1BuyI,EAAcvyI,IAAO,GAhVfsyI,GAA8B,EAC9BJ,EAAyB,MAChBH,IAAkBv1H,IAC3B81H,GAA8B,EAC9BJ,EAAyB1lI,EAAM86D,MAAM4qE,wBAA0B,QAKrE,IAAI37F,EAAUs5F,EAAc/kF,OAAOslF,EAAgB5wI,MAAM,EAAGgd,EAAQ,IAChEg2H,EAAcA,KAChB,IAAI3+F,EAkBJ,OAhBEA,EADEroC,EACSgmI,EACFc,EACEJ,EACF1lI,EAAM86D,MAAMh1D,UAOVi5H,EAAAA,cAAC/+H,EAAM86D,MAAMh1D,UAAS,MACxB9F,EAAM86D,MAAM8/C,QACV56G,EAAM86D,MAAM8/C,QAEZgnB,EAGX7C,EAAAA,cAAC+F,EAAa,CACZ9kI,MAAOA,EACP6kI,aAAc,CACZjD,SACA73F,UACA83F,YAAgC,MAAnBuB,GAEf/7F,SAAUA,GACV,EAMN,OAAO+7F,IACJpjI,EAAM86D,MAAMmqE,eAAiBjlI,EAAM86D,MAAMkqE,cAA0B,IAAVh1H,GAC1D+uH,EAAAA,cAAC2F,EAAmB,CAClB50I,SAAUszI,EAAgBtzI,SAC1B60I,aAAcvB,EAAgBuB,aAC9B99H,UAAWm+H,EACXhmI,MAAOA,EACPqoC,SAAU2+F,IACVnB,aAAc,CAAEjD,OAAQ,KAAM73F,UAAS83F,aAAa,KAGtDmE,GACD,GACA,KACL,CAAC,IAEI3E,EAAc,SAAdA,GAAc,OAAdA,EAAc,wBAAdA,EAAc,gCAAdA,EAAc,gCAAdA,CAAc,EAAdA,GAAc,IAMdC,EAAmB,SAAnBA,GAAmB,OAAnBA,EAAmB,wBAAnBA,EAAmB,8BAAnBA,EAAmB,8BAAnBA,EAAmB,8BAAnBA,EAAmB,8BAAnBA,EAAmB,wCAAnBA,EAAmB,wBAAnBA,EAAmB,gCAAnBA,EAAmB,gCAAnBA,EAAmB,wBAAnBA,CAAmB,EAAnBA,GAAmB,IAmBxB,SAASe,EAAqB4D,GAC5B,IAAIC,EAAMnH,EAAAA,WAAiBwC,GAE3B,OADU2E,IAAVlE,EAAAA,EAAAA,KAAU,GACHkE,CACT,CAEA,SAASlC,EAAmBiC,GAC1B,IAAI1uI,EAAQwnI,EAAAA,WAAiByC,GAE7B,OADUjqI,IAAVyqI,EAAAA,EAAAA,KAAU,GACHzqI,CACT,CASA,SAASgrI,EAAkB0D,GACzB,IAAInrE,EARN,WACE,IAAIA,EAAQikE,EAAAA,WAAiB4C,GAE7B,OADU7mE,IAAVknE,EAAAA,EAAAA,KAAU,GACHlnE,CACT,CAIcqrE,GACRC,EAAYtrE,EAAM/wB,QAAQ+wB,EAAM/wB,QAAQx7C,OAAS,GAKrD,OAHE63I,EAAUtrE,MAAMlhD,KADlBooH,EAAAA,EAAAA,KAAU,GAIHoE,EAAUtrE,MAAMlhD,EACzB,CA4NA,MAAMmsH,EAAyC,CAAC,GCj/BpBhH,IAAAA,EAAAA,EAAAA,EAAAA,EAAAA,KAAsB,gBA+L3C,SAASsH,EAAQnH,GAKA,IALC,GACvB7wE,EAAE,QACFxvD,EAAO,MACPtH,EAAK,SACLyoI,GACcd,EAEZ6C,MADFC,EAAAA,EAAAA,KAAU,GAOV,IAAI,OAAE7C,EAAQgD,OAAQmE,GAAavH,EAAAA,WAAiB0C,IAShD,QAAE13F,GAAYg1F,EAAAA,WAAiB4C,IAC7B5xI,SAAUouE,GAAqB6iE,IACjCF,EAAWC,IAIX7uG,GAAO8rC,EAAAA,EAAAA,IACT3P,GACAw0E,EAAAA,EAAAA,IAAoB94F,EAASo1F,EAAOrhE,sBACpCK,EACa,SAAb6hE,GAEEuG,EAAWzuI,KAAKC,UAAUm6B,GAO9B,OALA6sG,EAAAA,WACE,IAAM+B,EAAShpI,KAAKO,MAAMkuI,GAAW,CAAE1nI,UAAStH,QAAOyoI,cACvD,CAACc,EAAUyF,EAAUvG,EAAUnhI,EAAStH,IAGnC,IACT,CAWO,SAASivI,EAAOhgI,GACrB,ODxDK,SAAmBsqB,GACxB,IAAI8wG,EAAS7C,EAAAA,WAAiB4C,GAAcC,OAC5C,OAAIA,EAEA7C,EAAAA,cAACgE,EAAcp8H,SAAQ,CAAC3L,MAAO81B,GAAU8wG,GAGtCA,CACT,CCgDS6E,CAAUjgI,EAAMsqB,QACzB,CAmDO,SAAS41G,EAAMC,IACpB3E,EAAAA,EAAAA,KAAU,EAKZ,CAqBO,SAASvC,EAAMmH,GAQqB,IAPzC5sE,SAAU6sE,EAAe,IAAG,SAC5Bx/F,EAAW,KACXv3C,SAAUg3I,EAAY,eACtBpH,EAAiBjoE,EAAAA,GAAesB,IAAG,UACnC13D,EACA8gI,OAAQ4E,GAAa,EAAK,OAC1B5H,GACYyH,EAET7E,MADHC,EAAAA,EAAAA,KAAU,GAQV,IAAIhoE,EAAW6sE,EAAahoI,QAAQ,OAAQ,KACxCmoI,EAAoBjI,EAAAA,SACtB,KAAM,CACJ/kE,WACA34D,YACA8gI,OAAQ4E,EACR5H,OAAM/mE,EAAA,CACJ0F,sBAAsB,GACnBqhE,MAGP,CAACnlE,EAAUmlE,EAAQ99H,EAAW0lI,IAGJ,kBAAjBD,IACTA,GAAezuE,EAAAA,EAAAA,IAAUyuE,IAG3B,IAAI,SACF/2I,EAAW,IAAG,OACdI,EAAS,GAAE,KACX4/B,EAAO,GAAE,MACTx4B,EAAQ,KAAI,IACZ/D,EAAM,WACJszI,EAEAG,EAAkBlI,EAAAA,SAAc,KAClC,IAAImI,GAAmBjtE,EAAAA,EAAAA,IAAclqE,EAAUiqE,GAE/C,OAAwB,MAApBktE,EACK,KAGF,CACLp3I,SAAU,CACRC,SAAUm3I,EACV/2I,SACA4/B,OACAx4B,QACA/D,OAEFksI,iBACD,GACA,CAAC1lE,EAAUjqE,EAAUI,EAAQ4/B,EAAMx4B,EAAO/D,EAAKksI,IASlD,OAAuB,MAAnBuH,EACK,KAIPlI,EAAAA,cAAC0C,EAAkB96H,SAAQ,CAAC3L,MAAOgsI,GACjCjI,EAAAA,cAAC2C,EAAgB/6H,SAAQ,CAAC0gC,SAAUA,EAAUrsC,MAAOisI,IAG3D,CAaO,SAASE,EAAMC,GAGqB,IAHpB,SACrB//F,EAAQ,SACRv3C,GACYs3I,EACZ,ODpKOjE,ECoKUkE,EAAyBhgG,GAAWv3C,EACvD,CAuC4B,IAAImR,SAAQ,SAEP89H,EAAAA,UAkH1B,SAASsI,EACdhgG,EACAiqB,QAAoB,IAApBA,IAAAA,EAAuB,IAEvB,IAAIwI,EAAwB,GA6D5B,OA3DAilE,EAAAA,SAAexmI,QAAQ8uC,GAAU,CAACuzE,EAAS5qG,KACzC,IAAK+uH,EAAAA,eAAqBnkB,GAGxB,OAGF,IAAIljE,EAAW,IAAI4Z,EAAYthD,GAE/B,GAAI4qG,EAAQ3/G,OAAS8jI,EAAAA,SAMnB,YAJAjlE,EAAO5mE,KAAK4a,MACVgsD,EACAutE,EAAyBzsB,EAAQp0G,MAAM6gC,SAAUqQ,IAMnDkjE,EAAQ3/G,OAASyrI,IADnB1E,EAAAA,EAAAA,KAAU,GAQPpnB,EAAQp0G,MAAMwJ,OAAU4qG,EAAQp0G,MAAM6gC,WADzC26F,EAAAA,EAAAA,KAAU,GAKV,IAAIlnE,EAAqB,CACvBlhD,GAAIghG,EAAQp0G,MAAMoT,IAAM89B,EAASj6C,KAAK,KACtCs9D,cAAe6/C,EAAQp0G,MAAMu0D,cAC7B6/C,QAASA,EAAQp0G,MAAMo0G,QACvB90G,UAAW80G,EAAQp0G,MAAMV,UACzBkK,MAAO4qG,EAAQp0G,MAAMwJ,MACrBkiB,KAAM0oF,EAAQp0G,MAAM0rB,KACpB96B,OAAQwjH,EAAQp0G,MAAMpP,OACtBI,OAAQojH,EAAQp0G,MAAMhP,OACtBwtI,aAAcpqB,EAAQp0G,MAAMw+H,aAC5BC,cAAerqB,EAAQp0G,MAAMy+H,cAC7BqC,iBACiC,MAA/B1sB,EAAQp0G,MAAMy+H,eACgB,MAA9BrqB,EAAQp0G,MAAMw+H,aAChBuC,iBAAkB3sB,EAAQp0G,MAAM+gI,iBAChCC,OAAQ5sB,EAAQp0G,MAAMghI,OACtB3B,KAAMjrB,EAAQp0G,MAAMq/H,MAGlBjrB,EAAQp0G,MAAM6gC,WAChByzB,EAAMzzB,SAAWggG,EACfzsB,EAAQp0G,MAAM6gC,SACdqQ,IAIJoiB,EAAO5mE,KAAK4nE,EAAM,IAGbhB,CACT,+BC/sBa,IAAI90D,EAAE0iE,EAAQ,MAAS9jE,EAAE27D,OAAOk/B,IAAI,iBAAiBuB,EAAEzgC,OAAOk/B,IAAI,kBAAkB50E,EAAEh3B,OAAOiP,UAAUxC,eAAe6F,EAAEH,EAAEu5F,mDAAmD8xB,kBAAkBz0H,EAAE,CAACpI,KAAI,EAAGw8D,KAAI,EAAGy3E,QAAO,EAAGC,UAAS,GAChP,SAASjxG,EAAEznC,EAAEuF,EAAE4oG,GAAG,IAAI3oG,EAAElF,EAAE,CAAC,EAAEyP,EAAE,KAAKgwB,EAAE,KAAiF,IAAIv6B,UAAhF,IAAS2oG,IAAIp+F,EAAE,GAAGo+F,QAAG,IAAS5oG,EAAEf,MAAMuL,EAAE,GAAGxK,EAAEf,UAAK,IAASe,EAAEy7D,MAAMjhC,EAAEx6B,EAAEy7D,KAAcz7D,EAAEs1B,EAAE1mB,KAAK5O,EAAEC,KAAKoH,EAAE0D,eAAe9K,KAAKlF,EAAEkF,GAAGD,EAAEC,IAAI,GAAGxF,GAAGA,EAAE60H,aAAa,IAAIrvH,KAAKD,EAAEvF,EAAE60H,kBAAe,IAASv0H,EAAEkF,KAAKlF,EAAEkF,GAAGD,EAAEC,IAAI,MAAM,CAAC6rG,SAASz8F,EAAE3I,KAAKjM,EAAEwE,IAAIuL,EAAEixD,IAAIjhC,EAAEvoB,MAAMlX,EAAE64H,OAAOhjH,EAAE3M,QAAQ,CAAC0uE,EAAQygE,SAAS3nC,EAAE94B,EAAQ0gE,IAAInxG,EAAEywC,EAAQ2gE,KAAKpxG,6BCD7V,IAAIupE,EAAEzgC,OAAOk/B,IAAI,iBAAiBt5F,EAAEo6D,OAAOk/B,IAAI,gBAAgB7iG,EAAE2jE,OAAOk/B,IAAI,kBAAkBhoE,EAAE8oC,OAAOk/B,IAAI,qBAAqBpoE,EAAEkpC,OAAOk/B,IAAI,kBAAkB15F,EAAEw6D,OAAOk/B,IAAI,kBAAkBvgG,EAAEqhE,OAAOk/B,IAAI,iBAAiB1iF,EAAEwjD,OAAOk/B,IAAI,qBAAqB+e,EAAEj+C,OAAOk/B,IAAI,kBAAkB8e,EAAEh+C,OAAOk/B,IAAI,cAAc4nB,EAAE9mD,OAAOk/B,IAAI,cAAcd,EAAEp+B,OAAOh5B,SACzW,IAAIikE,EAAE,CAACoc,UAAU,WAAW,OAAM,CAAE,EAAEO,mBAAmB,WAAW,EAAED,oBAAoB,WAAW,EAAEJ,gBAAgB,WAAW,GAAGla,EAAE/5G,OAAOugB,OAAO0pG,EAAE,CAAC,EAAE,SAASmD,EAAE1rH,EAAEC,EAAEuK,GAAG1C,KAAKmK,MAAMjS,EAAE8H,KAAKy0B,QAAQt8B,EAAE6H,KAAKoqH,KAAK3J,EAAEzgH,KAAK8jF,QAAQphF,GAAGyrG,CAAC,CACwI,SAASiT,IAAI,CAAyB,SAASyC,EAAE3rH,EAAEC,EAAEuK,GAAG1C,KAAKmK,MAAMjS,EAAE8H,KAAKy0B,QAAQt8B,EAAE6H,KAAKoqH,KAAK3J,EAAEzgH,KAAK8jF,QAAQphF,GAAGyrG,CAAC,CADxPyV,EAAEn+G,UAAUu4H,iBAAiB,CAAC,EACpQpa,EAAEn+G,UAAUy9H,SAAS,SAAShrI,EAAEC,GAAG,GAAG,kBAAkBD,GAAG,oBAAoBA,GAAG,MAAMA,EAAE,MAAMkH,MAAM,yHAAyHY,KAAK8jF,QAAQ2mC,gBAAgBzqH,KAAK9H,EAAEC,EAAE,WAAW,EAAEyrH,EAAEn+G,UAAUgmI,YAAY,SAASvzI,GAAG8H,KAAK8jF,QAAQgnC,mBAAmB9qH,KAAK9H,EAAE,cAAc,EAAgBkpH,EAAE37G,UAAUm+G,EAAEn+G,UAAsF,IAAIs+G,EAAEF,EAAEp+G,UAAU,IAAI27G,EACrf2C,EAAE3hH,YAAYyhH,EAAEtT,EAAEwT,EAAEH,EAAEn+G,WAAWs+G,EAAEkH,sBAAqB,EAAG,IAAI9E,EAAE7lH,MAAMC,QAAQ0gH,EAAEzqH,OAAOiP,UAAUxC,eAAe2mH,EAAE,CAACztH,QAAQ,MAAMuuH,EAAE,CAACvzH,KAAI,EAAGw8D,KAAI,EAAGy3E,QAAO,EAAGC,UAAS,GACtK,SAAShe,EAAEn1H,EAAEC,EAAEuK,GAAG,IAAIzP,EAAEN,EAAE,CAAC,EAAE4U,EAAE,KAAKmrB,EAAE,KAAK,GAAG,MAAMv6B,EAAE,IAAIlF,UAAK,IAASkF,EAAEw7D,MAAMjhC,EAAEv6B,EAAEw7D,UAAK,IAASx7D,EAAEhB,MAAMoQ,EAAE,GAAGpP,EAAEhB,KAAKgB,EAAE8oH,EAAEn6G,KAAK3O,EAAElF,KAAKy3H,EAAEznH,eAAehQ,KAAKN,EAAEM,GAAGkF,EAAElF,IAAI,IAAI6tG,EAAE7uG,UAAUC,OAAO,EAAE,GAAG,IAAI4uG,EAAEnuG,EAAEq4C,SAAStoC,OAAO,GAAG,EAAEo+F,EAAE,CAAC,IAAI,IAAIn4F,EAAErI,MAAMwgG,GAAGtzE,EAAE,EAAEA,EAAEszE,EAAEtzE,IAAI7kB,EAAE6kB,GAAGv7B,UAAUu7B,EAAE,GAAG76B,EAAEq4C,SAASriC,CAAC,CAAC,GAAGzQ,GAAGA,EAAEsvH,aAAa,IAAIv0H,KAAK6tG,EAAE5oG,EAAEsvH,kBAAe,IAAS70H,EAAEM,KAAKN,EAAEM,GAAG6tG,EAAE7tG,IAAI,MAAM,CAAC+wG,SAASL,EAAE/kG,KAAK1G,EAAEf,IAAIoQ,EAAEosD,IAAIjhC,EAAEvoB,MAAMxX,EAAEm5H,OAAOlC,EAAEztH,QAAQ,CAChV,SAAS6xH,EAAE91H,GAAG,MAAM,kBAAkBA,GAAG,OAAOA,GAAGA,EAAE8rG,WAAWL,CAAC,CAAoG,IAAIsqB,EAAE,OAAO,SAASK,EAAEp2H,EAAEC,GAAG,MAAM,kBAAkBD,GAAG,OAAOA,GAAG,MAAMA,EAAEf,IAA7K,SAAgBe,GAAG,IAAIC,EAAE,CAAC,IAAI,KAAK,IAAI,MAAM,MAAM,IAAID,EAAEsK,QAAQ,SAAQ,SAAStK,GAAG,OAAOC,EAAED,EAAE,GAAE,CAA+E+hG,CAAO,GAAG/hG,EAAEf,KAAKgB,EAAEykB,SAAS,GAAG,CAC/W,SAASmzG,EAAE73H,EAAEC,EAAEuK,EAAEzP,EAAEN,GAAG,IAAI4U,SAASrP,EAAK,cAAcqP,GAAG,YAAYA,IAAErP,EAAE,MAAK,IAAIw6B,GAAE,EAAG,GAAG,OAAOx6B,EAAEw6B,GAAE,OAAQ,OAAOnrB,GAAG,IAAK,SAAS,IAAK,SAASmrB,GAAE,EAAG,MAAM,IAAK,SAAS,OAAOx6B,EAAE8rG,UAAU,KAAKL,EAAE,KAAK76F,EAAE4pB,GAAE,GAAI,GAAGA,EAAE,OAAW//B,EAAEA,EAAN+/B,EAAEx6B,GAASA,EAAE,KAAKjF,EAAE,IAAIq7H,EAAE57F,EAAE,GAAGz/B,EAAEkzH,EAAExzH,IAAI+P,EAAE,GAAG,MAAMxK,IAAIwK,EAAExK,EAAEsK,QAAQyrH,EAAE,OAAO,KAAK8B,EAAEp9H,EAAEwF,EAAEuK,EAAE,IAAG,SAASxK,GAAG,OAAOA,CAAC,KAAI,MAAMvF,IAAIq7H,EAAEr7H,KAAKA,EADnW,SAAWuF,EAAEC,GAAG,MAAM,CAAC6rG,SAASL,EAAE/kG,KAAK1G,EAAE0G,KAAKzH,IAAIgB,EAAEw7D,IAAIz7D,EAAEy7D,IAAIxpD,MAAMjS,EAAEiS,MAAM2hH,OAAO5zH,EAAE4zH,OAAO,CACyQiC,CAAEp7H,EAAE+P,IAAI/P,EAAEwE,KAAKu7B,GAAGA,EAAEv7B,MAAMxE,EAAEwE,IAAI,IAAI,GAAGxE,EAAEwE,KAAKqL,QAAQyrH,EAAE,OAAO,KAAK/1H,IAAIC,EAAEtB,KAAKlE,IAAI,EAAyB,GAAvB+/B,EAAE,EAAEz/B,EAAE,KAAKA,EAAE,IAAIA,EAAE,IAAOkzH,EAAEjuH,GAAG,IAAI,IAAI4oG,EAAE,EAAEA,EAAE5oG,EAAEhG,OAAO4uG,IAAI,CAC/e,IAAIn4F,EAAE1V,EAAEq7H,EADwe/mH,EACrfrP,EAAE4oG,GAAeA,GAAGpuE,GAAGq9F,EAAExoH,EAAEpP,EAAEuK,EAAEiG,EAAEhW,EAAE,MAAM,GAAGgW,EAPsU,SAAWzQ,GAAG,OAAG,OAAOA,GAAG,kBAAkBA,EAAS,KAAsC,oBAAjCA,EAAEopG,GAAGppG,EAAEopG,IAAIppG,EAAE,eAA0CA,EAAE,IAAI,CAO5bkrG,CAAElrG,GAAG,oBAAoByQ,EAAE,IAAIzQ,EAAEyQ,EAAE7B,KAAK5O,GAAG4oG,EAAE,IAAIv5F,EAAErP,EAAEmwC,QAAQt2B,MAA6B2gB,GAAGq9F,EAA1BxoH,EAAEA,EAAE5I,MAA0BxG,EAAEuK,EAAtBiG,EAAE1V,EAAEq7H,EAAE/mH,EAAEu5F,KAAkBnuG,QAAQ,GAAG,WAAW4U,EAAE,MAAMpP,EAAEuJ,OAAOxJ,GAAGkH,MAAM,mDAAmD,oBAAoBjH,EAAE,qBAAqB3B,OAAOC,KAAKyB,GAAGkJ,KAAK,MAAM,IAAIjJ,GAAG,6EAA6E,OAAOu6B,CAAC,CACzZ,SAASwkG,EAAEh/H,EAAEC,EAAEuK,GAAG,GAAG,MAAMxK,EAAE,OAAOA,EAAE,IAAIjF,EAAE,GAAGN,EAAE,EAAmD,OAAjDo9H,EAAE73H,EAAEjF,EAAE,GAAG,IAAG,SAASiF,GAAG,OAAOC,EAAE2O,KAAKpE,EAAExK,EAAEvF,IAAI,IAAUM,CAAC,CAAC,SAAS4kI,EAAE3/H,GAAG,IAAI,IAAIA,EAAEwzI,QAAQ,CAAC,IAAIvzI,EAAED,EAAEyzI,SAAQxzI,EAAEA,KAAM4a,MAAK,SAAS5a,GAAM,IAAID,EAAEwzI,UAAU,IAAIxzI,EAAEwzI,UAAQxzI,EAAEwzI,QAAQ,EAAExzI,EAAEyzI,QAAQxzI,EAAC,IAAE,SAASA,GAAM,IAAID,EAAEwzI,UAAU,IAAIxzI,EAAEwzI,UAAQxzI,EAAEwzI,QAAQ,EAAExzI,EAAEyzI,QAAQxzI,EAAC,KAAI,IAAID,EAAEwzI,UAAUxzI,EAAEwzI,QAAQ,EAAExzI,EAAEyzI,QAAQxzI,EAAE,CAAC,GAAG,IAAID,EAAEwzI,QAAQ,OAAOxzI,EAAEyzI,QAAQC,QAAQ,MAAM1zI,EAAEyzI,OAAQ,CAC5Z,IAAIzT,EAAE,CAAC/7H,QAAQ,MAAMk8H,EAAE,CAACvlB,WAAW,MAAMrqG,EAAE,CAACmlH,uBAAuBsK,EAAEvlB,wBAAwB0lB,EAAErE,kBAAkBpK,GAAG/+C,EAAQghE,SAAS,CAAC/yI,IAAIo+H,EAAEh7H,QAAQ,SAAShE,EAAEC,EAAEuK,GAAGw0H,EAAEh/H,GAAE,WAAWC,EAAEsZ,MAAMzR,KAAK/N,UAAU,GAAEyQ,EAAE,EAAE3G,MAAM,SAAS7D,GAAG,IAAIC,EAAE,EAAuB,OAArB++H,EAAEh/H,GAAE,WAAWC,GAAG,IAAUA,CAAC,EAAE65F,QAAQ,SAAS95F,GAAG,OAAOg/H,EAAEh/H,GAAE,SAASA,GAAG,OAAOA,CAAC,KAAI,EAAE,EAAE4zI,KAAK,SAAS5zI,GAAG,IAAI81H,EAAE91H,GAAG,MAAMkH,MAAM,yEAAyE,OAAOlH,CAAC,GAAG2yE,EAAQphE,UAAUm6G,EAAE/4C,EAAQygE,SAAS/rI,EACnesrE,EAAQkhE,SAAS/xG,EAAE6wC,EAAQmhE,cAAcnoB,EAAEh5C,EAAQohE,WAAW7xG,EAAEywC,EAAQqhE,SAAS/qB,EAAEt2C,EAAQq3B,mDAAmDz5F,EAC9IoiE,EAAQshE,aAAa,SAASj0I,EAAEC,EAAEuK,GAAG,GAAG,OAAOxK,QAAG,IAASA,EAAE,MAAMkH,MAAM,iFAAiFlH,EAAE,KAAK,IAAIjF,EAAEs9G,EAAE,CAAC,EAAEr4G,EAAEiS,OAAOxX,EAAEuF,EAAEf,IAAIoQ,EAAErP,EAAEy7D,IAAIjhC,EAAEx6B,EAAE4zH,OAAO,GAAG,MAAM3zH,EAAE,CAAoE,QAAnE,IAASA,EAAEw7D,MAAMpsD,EAAEpP,EAAEw7D,IAAIjhC,EAAEk3F,EAAEztH,cAAS,IAAShE,EAAEhB,MAAMxE,EAAE,GAAGwF,EAAEhB,KAAQe,EAAE0G,MAAM1G,EAAE0G,KAAK4oH,aAAa,IAAI1mB,EAAE5oG,EAAE0G,KAAK4oH,aAAa,IAAI7+G,KAAKxQ,EAAE8oH,EAAEn6G,KAAK3O,EAAEwQ,KAAK+hH,EAAEznH,eAAe0F,KAAK1V,EAAE0V,QAAG,IAASxQ,EAAEwQ,SAAI,IAASm4F,EAAEA,EAAEn4F,GAAGxQ,EAAEwQ,GAAG,CAAC,IAAIA,EAAE1W,UAAUC,OAAO,EAAE,GAAG,IAAIyW,EAAE1V,EAAE+3C,SAAStoC,OAAO,GAAG,EAAEiG,EAAE,CAACm4F,EAAExgG,MAAMqI,GACrf,IAAI,IAAI6kB,EAAE,EAAEA,EAAE7kB,EAAE6kB,IAAIszE,EAAEtzE,GAAGv7B,UAAUu7B,EAAE,GAAGv6B,EAAE+3C,SAAS81D,CAAC,CAAC,MAAM,CAACkD,SAASL,EAAE/kG,KAAK1G,EAAE0G,KAAKzH,IAAIxE,EAAEghE,IAAIpsD,EAAE4C,MAAMlX,EAAE64H,OAAOp5F,EAAE,EAAEm4C,EAAQuhE,cAAc,SAASl0I,GAAqK,OAAlKA,EAAE,CAAC8rG,SAASniG,EAAEkmH,cAAc7vH,EAAEm0I,eAAen0I,EAAEo0I,aAAa,EAAEhiI,SAAS,KAAKiiI,SAAS,KAAKC,cAAc,KAAKC,YAAY,OAAQniI,SAAS,CAAC05F,SAASt7F,EAAEu7F,SAAS/rG,GAAUA,EAAEq0I,SAASr0I,CAAC,EAAE2yE,EAAQ3sE,cAAcmvH,EAAExiD,EAAQ6hE,cAAc,SAASx0I,GAAG,IAAIC,EAAEk1H,EAAEnvG,KAAK,KAAKhmB,GAAY,OAATC,EAAEyG,KAAK1G,EAASC,CAAC,EAAE0yE,EAAQ8hE,UAAU,WAAW,MAAM,CAACxwI,QAAQ,KAAK,EAC9d0uE,EAAQ+hE,WAAW,SAAS10I,GAAG,MAAM,CAAC8rG,SAAStkF,EAAEokF,OAAO5rG,EAAE,EAAE2yE,EAAQgiE,eAAe7e,EAAEnjD,EAAQ2+D,KAAK,SAAStxI,GAAG,MAAM,CAAC8rG,SAASgmB,EAAE9lB,SAAS,CAACwnC,SAAS,EAAEC,QAAQzzI,GAAGisG,MAAM0zB,EAAE,EAAEhtD,EAAQ7J,KAAK,SAAS9oE,EAAEC,GAAG,MAAM,CAAC6rG,SAASkd,EAAEtiH,KAAK1G,EAAE8mC,aAAQ,IAAS7mC,EAAE,KAAKA,EAAE,EAAE0yE,EAAQiiE,gBAAgB,SAAS50I,GAAG,IAAIC,EAAEkgI,EAAEvlB,WAAWulB,EAAEvlB,WAAW,CAAC,EAAE,IAAI56G,GAAG,CAAC,QAAQmgI,EAAEvlB,WAAW36G,CAAC,CAAC,EAAE0yE,EAAQkiE,aAAa,WAAW,MAAM3tI,MAAM,2DAA4D,EAC1cyrE,EAAQ+mD,YAAY,SAAS15H,EAAEC,GAAG,OAAO+/H,EAAE/7H,QAAQy1H,YAAY15H,EAAEC,EAAE,EAAE0yE,EAAQgnD,WAAW,SAAS35H,GAAG,OAAOggI,EAAE/7H,QAAQ01H,WAAW35H,EAAE,EAAE2yE,EAAQynD,cAAc,WAAW,EAAEznD,EAAQ0nD,iBAAiB,SAASr6H,GAAG,OAAOggI,EAAE/7H,QAAQo2H,iBAAiBr6H,EAAE,EAAE2yE,EAAQinD,UAAU,SAAS55H,EAAEC,GAAG,OAAO+/H,EAAE/7H,QAAQ21H,UAAU55H,EAAEC,EAAE,EAAE0yE,EAAQ8nD,MAAM,WAAW,OAAOuF,EAAE/7H,QAAQw2H,OAAO,EAAE9nD,EAAQknD,oBAAoB,SAAS75H,EAAEC,EAAEuK,GAAG,OAAOw1H,EAAE/7H,QAAQ41H,oBAAoB75H,EAAEC,EAAEuK,EAAE,EAC7bmoE,EAAQmnD,mBAAmB,SAAS95H,EAAEC,GAAG,OAAO+/H,EAAE/7H,QAAQ61H,mBAAmB95H,EAAEC,EAAE,EAAE0yE,EAAQonD,gBAAgB,SAAS/5H,EAAEC,GAAG,OAAO+/H,EAAE/7H,QAAQ81H,gBAAgB/5H,EAAEC,EAAE,EAAE0yE,EAAQqnD,QAAQ,SAASh6H,EAAEC,GAAG,OAAO+/H,EAAE/7H,QAAQ+1H,QAAQh6H,EAAEC,EAAE,EAAE0yE,EAAQsnD,WAAW,SAASj6H,EAAEC,EAAEuK,GAAG,OAAOw1H,EAAE/7H,QAAQg2H,WAAWj6H,EAAEC,EAAEuK,EAAE,EAAEmoE,EAAQunD,OAAO,SAASl6H,GAAG,OAAOggI,EAAE/7H,QAAQi2H,OAAOl6H,EAAE,EAAE2yE,EAAQwnD,SAAS,SAASn6H,GAAG,OAAOggI,EAAE/7H,QAAQk2H,SAASn6H,EAAE,EAAE2yE,EAAQ6nD,qBAAqB,SAASx6H,EAAEC,EAAEuK,GAAG,OAAOw1H,EAAE/7H,QAAQu2H,qBAAqBx6H,EAAEC,EAAEuK,EAAE,EAC/emoE,EAAQ2nD,cAAc,WAAW,OAAO0F,EAAE/7H,QAAQq2H,eAAe,EAAE3nD,EAAQ32D,QAAQ,sCCtBjF82D,EAAOH,QAAU,EAAjBG,kCCAAA,EAAOH,QAAU,EAAjBG,iCCMW,SAASriE,EAAEzQ,EAAEC,GAAG,IAAIxF,EAAEuF,EAAEhG,OAAOgG,EAAErB,KAAKsB,GAAGD,EAAE,KAAK,EAAEvF,GAAG,CAAC,IAAIM,EAAEN,EAAE,IAAI,EAAE+P,EAAExK,EAAEjF,GAAG,KAAG,EAAE6tG,EAAEp+F,EAAEvK,IAA0B,MAAMD,EAA7BA,EAAEjF,GAAGkF,EAAED,EAAEvF,GAAG+P,EAAE/P,EAAEM,CAAc,CAAC,CAAC,SAASy/B,EAAEx6B,GAAG,OAAO,IAAIA,EAAEhG,OAAO,KAAKgG,EAAE,EAAE,CAAC,SAASqP,EAAErP,GAAG,GAAG,IAAIA,EAAEhG,OAAO,OAAO,KAAK,IAAIiG,EAAED,EAAE,GAAGvF,EAAEuF,EAAE+iB,MAAM,GAAGtoB,IAAIwF,EAAE,CAACD,EAAE,GAAGvF,EAAEuF,EAAE,IAAI,IAAIjF,EAAE,EAAEyP,EAAExK,EAAEhG,OAAOivH,EAAEz+G,IAAI,EAAEzP,EAAEkuH,GAAG,CAAC,IAAI3zF,EAAE,GAAGv6B,EAAE,GAAG,EAAEs9G,EAAEr4G,EAAEs1B,GAAG1kB,EAAE0kB,EAAE,EAAE0zF,EAAEhpH,EAAE4Q,GAAG,GAAG,EAAEg4F,EAAEyP,EAAE59G,GAAGmW,EAAEpG,GAAG,EAAEo+F,EAAEogB,EAAE3Q,IAAIr4G,EAAEjF,GAAGiuH,EAAEhpH,EAAE4Q,GAAGnW,EAAEM,EAAE6V,IAAI5Q,EAAEjF,GAAGs9G,EAAEr4G,EAAEs1B,GAAG76B,EAAEM,EAAEu6B,OAAQ,MAAG1kB,EAAEpG,GAAG,EAAEo+F,EAAEogB,EAAEvuH,IAA0B,MAAMuF,EAA7BA,EAAEjF,GAAGiuH,EAAEhpH,EAAE4Q,GAAGnW,EAAEM,EAAE6V,CAAc,EAAC,CAAC,OAAO3Q,CAAC,CAC3c,SAAS2oG,EAAE5oG,EAAEC,GAAG,IAAIxF,EAAEuF,EAAE80I,UAAU70I,EAAE60I,UAAU,OAAO,IAAIr6I,EAAEA,EAAEuF,EAAEqlB,GAAGplB,EAAEolB,EAAE,CAAC,GAAG,kBAAkB0vH,aAAa,oBAAoBA,YAAYx+H,IAAI,CAAC,IAAIk1F,EAAEspC,YAAYpiE,EAAQujC,aAAa,WAAW,OAAOzK,EAAEl1F,KAAK,CAAC,KAAK,CAAC,IAAIlP,EAAErM,KAAKknC,EAAE76B,EAAEkP,MAAMo8D,EAAQujC,aAAa,WAAW,OAAO7uG,EAAEkP,MAAM2rB,CAAC,CAAC,CAAC,IAAIJ,EAAE,GAAGtxB,EAAE,GAAG7G,EAAE,EAAE6d,EAAE,KAAKsqG,EAAE,EAAE1oB,GAAE,EAAG8B,GAAE,EAAG+K,GAAE,EAAGsS,EAAE,oBAAoB3mH,WAAWA,WAAW,KAAK8pH,EAAE,oBAAoB/7F,aAAaA,aAAa,KAAKu5F,EAAE,qBAAqB8rB,aAAaA,aAAa,KACnT,SAASrpB,EAAE3rH,GAAG,IAAI,IAAIC,EAAEu6B,EAAEhqB,GAAG,OAAOvQ,GAAG,CAAC,GAAG,OAAOA,EAAEyB,SAAS2N,EAAEmB,OAAQ,MAAGvQ,EAAEg1I,WAAWj1I,GAAgD,MAA9CqP,EAAEmB,GAAGvQ,EAAE60I,UAAU70I,EAAEi1I,eAAezkI,EAAEqxB,EAAE7hC,EAAa,CAACA,EAAEu6B,EAAEhqB,EAAE,CAAC,CAAC,SAASq7G,EAAE7rH,GAAa,GAAVi2G,GAAE,EAAG0V,EAAE3rH,IAAOkrG,EAAE,GAAG,OAAO1wE,EAAEsH,GAAGopE,GAAE,EAAG+iB,EAAElF,OAAO,CAAC,IAAI9oH,EAAEu6B,EAAEhqB,GAAG,OAAOvQ,GAAGyxH,EAAE7F,EAAE5rH,EAAEg1I,UAAUj1I,EAAE,CAAC,CACra,SAAS+oH,EAAE/oH,EAAEC,GAAGirG,GAAE,EAAG+K,IAAIA,GAAE,EAAGyV,EAAE8G,GAAGA,GAAG,GAAGppB,GAAE,EAAG,IAAI3uG,EAAEq3H,EAAE,IAAS,IAALnG,EAAE1rH,GAAOunB,EAAEgT,EAAEsH,GAAG,OAAOta,MAAMA,EAAE0tH,eAAej1I,IAAID,IAAIm1H,MAAM,CAAC,IAAIp6H,EAAEysB,EAAE9lB,SAAS,GAAG,oBAAoB3G,EAAE,CAACysB,EAAE9lB,SAAS,KAAKowH,EAAEtqG,EAAE2tH,cAAc,IAAI3qI,EAAEzP,EAAEysB,EAAE0tH,gBAAgBj1I,GAAGA,EAAE0yE,EAAQujC,eAAe,oBAAoB1rG,EAAEgd,EAAE9lB,SAAS8I,EAAEgd,IAAIgT,EAAEsH,IAAIzyB,EAAEyyB,GAAG6pF,EAAE1rH,EAAE,MAAMoP,EAAEyyB,GAAGta,EAAEgT,EAAEsH,EAAE,CAAC,GAAG,OAAOta,EAAE,IAAIyhG,GAAE,MAAO,CAAC,IAAI3zF,EAAEkF,EAAEhqB,GAAG,OAAO8kB,GAAGo8F,EAAE7F,EAAEv2F,EAAE2/G,UAAUh1I,GAAGgpH,GAAE,CAAE,CAAC,OAAOA,CAAC,CAAC,QAAQzhG,EAAE,KAAKsqG,EAAEr3H,EAAE2uG,GAAE,CAAE,CAAC,CAD1a,qBAAqBt8F,gBAAW,IAASA,UAAUsoI,iBAAY,IAAStoI,UAAUsoI,WAAWC,gBAAgBvoI,UAAUsoI,WAAWC,eAAervH,KAAKlZ,UAAUsoI,YAC2Q,IACzPpW,EAD6PnJ,GAAE,EAAGC,EAAE,KAAKtD,GAAG,EAAEuD,EAAE,EAAEK,GAAG,EACvc,SAASjB,IAAI,QAAOxiD,EAAQujC,eAAekgB,EAAEL,EAAO,CAAC,SAAS8B,IAAI,GAAG,OAAO/B,EAAE,CAAC,IAAI91H,EAAE2yE,EAAQujC,eAAekgB,EAAEp2H,EAAE,IAAIC,GAAE,EAAG,IAAIA,EAAE61H,GAAE,EAAG91H,EAAE,CAAC,QAAQC,EAAE++H,KAAKnJ,GAAE,EAAGC,EAAE,KAAK,CAAC,MAAMD,GAAE,CAAE,CAAO,GAAG,oBAAoB3M,EAAE8V,EAAE,WAAW9V,EAAE2O,EAAE,OAAO,GAAG,qBAAqByd,eAAe,CAAC,IAAI3V,EAAE,IAAI2V,eAAetV,EAAEL,EAAE4V,MAAM5V,EAAE6V,MAAMngH,UAAUwiG,EAAEmH,EAAE,WAAWgB,EAAEyV,YAAY,KAAK,CAAC,MAAMzW,EAAE,WAAWzW,EAAEsP,EAAE,EAAE,EAAE,SAAS5J,EAAEjuH,GAAG81H,EAAE91H,EAAE61H,IAAIA,GAAE,EAAGmJ,IAAI,CAAC,SAAStN,EAAE1xH,EAAEC,GAAGuyH,EAAEjK,GAAE,WAAWvoH,EAAE2yE,EAAQujC,eAAe,GAAEj2G,EAAE,CAC5d0yE,EAAQmkC,sBAAsB,EAAEnkC,EAAQ2jC,2BAA2B,EAAE3jC,EAAQikC,qBAAqB,EAAEjkC,EAAQ+jC,wBAAwB,EAAE/jC,EAAQ+iE,mBAAmB,KAAK/iE,EAAQ6jC,8BAA8B,EAAE7jC,EAAQijC,wBAAwB,SAAS51G,GAAGA,EAAE0B,SAAS,IAAI,EAAEixE,EAAQgjE,2BAA2B,WAAWzqC,GAAG9B,IAAI8B,GAAE,EAAG+iB,EAAElF,GAAG,EAC1Up2C,EAAQijE,wBAAwB,SAAS51I,GAAG,EAAEA,GAAG,IAAIA,EAAEhD,QAAQyN,MAAM,mHAAmHsrH,EAAE,EAAE/1H,EAAE6nB,KAAKI,MAAM,IAAIjoB,GAAG,CAAC,EAAE2yE,EAAQyjC,iCAAiC,WAAW,OAAO0b,CAAC,EAAEn/C,EAAQkjE,8BAA8B,WAAW,OAAOr7G,EAAEsH,EAAE,EAAE6wC,EAAQmjE,cAAc,SAAS91I,GAAG,OAAO8xH,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,IAAI7xH,EAAE,EAAE,MAAM,QAAQA,EAAE6xH,EAAE,IAAIr3H,EAAEq3H,EAAEA,EAAE7xH,EAAE,IAAI,OAAOD,GAAG,CAAC,QAAQ8xH,EAAEr3H,CAAC,CAAC,EAAEk4E,EAAQojE,wBAAwB,WAAW,EAC9fpjE,EAAQqjC,sBAAsB,WAAW,EAAErjC,EAAQqjE,yBAAyB,SAASh2I,EAAEC,GAAG,OAAOD,GAAG,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,KAAK,EAAE,MAAM,QAAQA,EAAE,EAAE,IAAIvF,EAAEq3H,EAAEA,EAAE9xH,EAAE,IAAI,OAAOC,GAAG,CAAC,QAAQ6xH,EAAEr3H,CAAC,CAAC,EAChMk4E,EAAQ+iC,0BAA0B,SAAS11G,EAAEC,EAAExF,GAAG,IAAIM,EAAE43E,EAAQujC,eAA8F,OAA/E,kBAAkBz7G,GAAG,OAAOA,EAAaA,EAAE,kBAAZA,EAAEA,EAAEk+F,QAA6B,EAAEl+F,EAAEM,EAAEN,EAAEM,EAAGN,EAAEM,EAASiF,GAAG,KAAK,EAAE,IAAIwK,GAAG,EAAE,MAAM,KAAK,EAAEA,EAAE,IAAI,MAAM,KAAK,EAAEA,EAAE,WAAW,MAAM,KAAK,EAAEA,EAAE,IAAI,MAAM,QAAQA,EAAE,IAAmN,OAAzMxK,EAAE,CAACqlB,GAAG1b,IAAIjI,SAASzB,EAAEk1I,cAAcn1I,EAAEi1I,UAAUx6I,EAAEy6I,eAAvD1qI,EAAE/P,EAAE+P,EAAoEsqI,WAAW,GAAGr6I,EAAEM,GAAGiF,EAAE80I,UAAUr6I,EAAEgW,EAAED,EAAExQ,GAAG,OAAOw6B,EAAEsH,IAAI9hC,IAAIw6B,EAAEhqB,KAAKylG,GAAGyV,EAAE8G,GAAGA,GAAG,GAAGvc,GAAE,EAAGyb,EAAE7F,EAAEpxH,EAAEM,MAAMiF,EAAE80I,UAAUtqI,EAAEiG,EAAEqxB,EAAE9hC,GAAGkrG,GAAG9B,IAAI8B,GAAE,EAAG+iB,EAAElF,KAAY/oH,CAAC,EACne2yE,EAAQmjC,qBAAqBqf,EAAExiD,EAAQsjE,sBAAsB,SAASj2I,GAAG,IAAIC,EAAE6xH,EAAE,OAAO,WAAW,IAAIr3H,EAAEq3H,EAAEA,EAAE7xH,EAAE,IAAI,OAAOD,EAAEuZ,MAAMzR,KAAK/N,UAAU,CAAC,QAAQ+3H,EAAEr3H,CAAC,CAAC,CAAC,+BCf7Jq4E,EAAOH,QAAU,EAAjBG,mCCMW,IAAI81B,EAAEz1B,EAAQ,MAAwE,IAAI9rE,EAAE,oBAAoB/I,OAAO00G,GAAG10G,OAAO00G,GAA1G,SAAWhzG,EAAEC,GAAG,OAAOD,IAAIC,IAAI,IAAID,GAAG,EAAEA,IAAI,EAAEC,IAAID,IAAIA,GAAGC,IAAIA,CAAC,EAAiDiiC,EAAE0mE,EAAE4xB,qBAAqB14F,EAAE8mE,EAAEsxB,OAAO1pH,EAAEo4F,EAAEgxB,UAAUjwH,EAAEi/F,EAAEoxB,QAAQxyG,EAAEohF,EAAEwxB,cACrNznD,EAAQujE,iCAAiC,SAASl2I,EAAEC,EAAEuK,EAAEihG,EAAEjxE,GAAG,IAAI//B,EAAEqnC,EAAE,MAAM,GAAG,OAAOrnC,EAAEwJ,QAAQ,CAAC,IAAIwM,EAAE,CAAC0lI,UAAS,EAAG1vI,MAAM,MAAMhM,EAAEwJ,QAAQwM,CAAC,MAAMA,EAAEhW,EAAEwJ,QAAQxJ,EAAEkP,GAAE,WAAW,SAAS3J,EAAEA,GAAG,IAAIvF,EAAE,CAAiB,GAAhBA,GAAE,EAAGM,EAAEiF,EAAEA,EAAEyrG,EAAEzrG,QAAM,IAASw6B,GAAG/pB,EAAE0lI,SAAS,CAAC,IAAIl2I,EAAEwQ,EAAEhK,MAAM,GAAG+zB,EAAEv6B,EAAED,GAAG,OAAOqP,EAAEpP,CAAC,CAAC,OAAOoP,EAAErP,CAAC,CAAK,GAAJC,EAAEoP,EAAKhI,EAAEtM,EAAEiF,GAAG,OAAOC,EAAE,IAAIuK,EAAEihG,EAAEzrG,GAAG,YAAG,IAASw6B,GAAGA,EAAEv6B,EAAEuK,GAAUvK,GAAElF,EAAEiF,EAASqP,EAAE7E,EAAC,CAAC,IAASzP,EAAEsU,EAAP5U,GAAE,EAAO66B,OAAE,IAAS9qB,EAAE,KAAKA,EAAE,MAAM,CAAC,WAAW,OAAOxK,EAAEC,IAAI,EAAE,OAAOq1B,OAAE,EAAO,WAAW,OAAOt1B,EAAEs1B,IAAI,EAAE,GAAE,CAACr1B,EAAEuK,EAAEihG,EAAEjxE,IAAI,IAAIz/B,EAAEmnC,EAAEliC,EAAEvF,EAAE,GAAGA,EAAE,IACnc,OAAhD+V,GAAE,WAAWC,EAAE0lI,UAAS,EAAG1lI,EAAEhK,MAAM1L,CAAC,GAAE,CAACA,IAAIysB,EAAEzsB,GAAUA,CAAC,+BCRtD+3E,EAAOH,QAAU,EAAjBG,4ECmBK,SAASsjE,EACdp9H,GAGA,GAAoB,oBAATA,EACT,MAAM,IAAI/B,UAHZld,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAe,gDAAgDif,EAKjE,CAoDO,IAAMq9H,EAAiBz2I,GACrBwI,MAAMC,QAAQzI,GAAQA,EAAO,CAACA,GAUhC,SAAS02I,EAAgBC,GAC9B,MAAMtmB,EAAe7nH,MAAMC,QAAQkuI,EAAmB,IAClDA,EAAmB,GACnBA,EAOJ,OA9CK,SACLllG,GAEiC,IADjChnB,EAAAtwB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAe,6EAEf,IACGs3C,EAAM0mB,OAAOn4D,GAA+C,oBAATA,IACpD,CACA,MAAM42I,EAAYnlG,EACfzwC,KAAIhB,GACa,oBAATA,EACH,YAAYA,EAAK1F,MAAQ,qBAClB0F,IAEZsJ,KAAK,MACR,MAAM,IAAI+N,UAAU,GAAGoT,KAAgBmsH,KACzC,CACF,CAyBEC,CACExmB,EACA,kGAGKA,CACT,CC3FiCjlD,SAInB1sE,OAAO66E,eAAe,CAAC,GCNrC,IAOMu9D,EACe,qBAAZC,QACHA,QATN,MACEzsI,WAAAA,CAAoBzD,GAAA,KAAAA,MAAAA,CAAW,CAC/BmwI,KAAAA,GACE,OAAO9uI,KAAKrB,KACd,GA6JK,SAASowI,EACd79H,GAEA,IADAxF,EAAAzZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAmD,CAAC,EAEhD+8I,EA7GG,CACLpvH,EA7CiB,EA8CjBF,OAAG,EACHvpB,EAAG,KACHoJ,EAAG,MA0GL,MAAM,oBAAE0vI,GAAwBvjI,EAEhC,IAAIwjI,EAEAC,EAAe,EAEnB,SAASp+C,IACP,IAAIq+C,EAAYJ,EAChB,MAAM,OAAE98I,GAAWD,UACnB,IAAK,IAAIS,EAAI,EAAGixG,EAAIzxG,EAAQQ,EAAIixG,EAAGjxG,IAAK,CACtC,MAAMmrB,EAAM5rB,UAAUS,GACtB,GACiB,oBAARmrB,GACS,kBAARA,GAA4B,OAARA,EAC5B,CAEA,IAAIwxH,EAAcD,EAAUj5I,EACR,OAAhBk5I,IACFD,EAAUj5I,EAAIk5I,EAAc,IAAI/+H,SAElC,MAAMg/H,EAAaD,EAAYn7I,IAAI2pB,QAChB,IAAfyxH,GACFF,EApID,CACLxvH,EA7CiB,EA8CjBF,OAAG,EACHvpB,EAAG,KACHoJ,EAAG,MAiIG8vI,EAAYlkI,IAAI0S,EAAKuxH,IAErBA,EAAYE,CAEhB,KAAO,CAEL,IAAIC,EAAiBH,EAAU7vI,EACR,OAAnBgwI,IACFH,EAAU7vI,EAAIgwI,EAAiB,IAAI7kI,KAErC,MAAM8kI,EAAgBD,EAAer7I,IAAI2pB,QACnB,IAAlB2xH,GACFJ,EAjJD,CACLxvH,EA7CiB,EA8CjBF,OAAG,EACHvpB,EAAG,KACHoJ,EAAG,MA8IGgwI,EAAepkI,IAAI0S,EAAKuxH,IAExBA,EAAYI,CAEhB,CACF,CAEA,MAAMC,EAAiBL,EAEvB,IAAIp4I,EAYJ,GAlNe,IAwMXo4I,EAAUxvH,EACZ5oB,EAASo4I,EAAU1vH,GAGnB1oB,EAASka,EAAKO,MAAM,KAAMxf,WAC1Bk9I,KAGFM,EAAe7vH,EAhNA,EAkNXqvH,EAAqB,CACvB,MAAMS,EAAkBR,GAAYJ,WAAaI,EAE5B,MAAnBQ,GACAT,EAAoBS,EAAqC14I,KAEzDA,EAAS04I,EACQ,IAAjBP,GAAsBA,KAMxBD,EAFqB,kBAAXl4I,GAAkC,OAAXA,GACb,oBAAXA,EACmB,IAAI43I,EAAI53I,GAAUA,CAChD,CAEA,OADAy4I,EAAe/vH,EAAI1oB,EACZA,CACT,CAaA,OAXA+5F,EAAS4+C,WAAa,KACpBX,EA3LK,CACLpvH,EA7CiB,EA8CjBF,OAAG,EACHvpB,EAAG,KACHoJ,EAAG,MAwLHwxF,EAAS6+C,mBAAmB,EAG9B7+C,EAASo+C,aAAe,IAAMA,EAE9Bp+C,EAAS6+C,kBAAoB,KAC3BT,EAAe,CAAC,EAGXp+C,CACT,CCiBO,SAAS8+C,EAUdC,GAOA,QAAAnhI,EAAA1c,UAAAC,OANG69I,EAAA,IAAAzvI,MAAAqO,EAAA,EAAAA,EAAA,KAAAc,EAAA,EAAAA,EAAAd,EAAAc,IAAAsgI,EAAAtgI,EAAA,GAAAxd,UAAAwd,GAQH,MAAMugI,EAG0B,oBAArBF,EACP,CACEljD,QAASkjD,EACTG,eAAgBF,GAElBD,EAEEI,EAAiB,WAgBlB,QAAA1gI,EAAAvd,UAAAC,OAVAu8I,EAAA,IAAAnuI,MAAAkP,GAAAG,EAAA,EAAAA,EAAAH,EAAAG,IAAA8+H,EAAA9+H,GAAA1d,UAAA0d,GAWH,IAEIu/H,EAFAiB,EAAiB,EACjBC,EAA2B,EAM3BC,EAKA,CAAC,EAGDC,EAAa7B,EAAmBxzH,MAUV,kBAAfq1H,IACTD,EAAwBC,EAExBA,EAAa7B,EAAmBxzH,OAGlCqzH,EACEgC,EACA,qFAAqFA,MAKvF,MAAMC,EAAkB,IACnBP,KACAK,IAGC,QACJzjD,EAAA,eACAqjD,EAAiB,GAAC,YAClBO,EAAczB,EAAA,mBACd0B,EAAqB,GAAC,cACtBC,EAAgB,CAAC,GACfH,EAOEI,EAAsBpC,EAAc0B,GACpCW,EAA0BrC,EAAckC,GACxCtoB,EAAeqmB,EAAgBC,GAE/BoC,EAAqBjkD,GAAQ,WAIjC,OAHAujD,IAGQG,EAAgD7+H,MACtD,KACAxf,UAEJ,MAAM0+I,GAMN,MAAMG,EAAWN,GAAY,WAC3BJ,IAEA,MAAMW,EHpSL,SACL5oB,EACA6oB,GAEA,MAAMD,EAAuB,IACvB,OAAE7+I,GAAWi2H,EACnB,IAAK,IAAIz1H,EAAI,EAAGA,EAAIR,EAAQQ,IAG1Bq+I,EAAqBl6I,KAAKsxH,EAAaz1H,GAAG+e,MAAM,KAAMu/H,IAExD,OAAOD,CACT,CGwRmCE,CAC3B9oB,EACAl2H,WAmCF,OA9BAi9I,EAAa2B,EAAmBp/H,MAAM,KAAMs/H,GA8BrC7B,CACT,MAAM0B,GAON,OAAOp6I,OAAOugB,OAAO+5H,EAAU,CAC7BR,aACAO,qBACA1oB,eACAioB,yBAA0BA,IAAMA,EAChCc,8BAA+BA,KAC7Bd,EAA2B,CAAC,EAE9BlB,WAAYA,IAAMA,EAClBiB,eAAgBA,IAAMA,EACtBgB,oBAAqBA,KACnBhB,EAAiB,CAAC,EAEpBvjD,UACA4jD,eAOJ,EAMA,OAJAh6I,OAAOugB,OAAOm5H,EAAgB,CAC5BkB,UAAWA,IAAMlB,IAGZA,CAIT,CAWO,IAAMmB,EACKxB,EAAsBd,GC5E3BuC,EACX96I,OAAOugB,QACL,SAKEw6H,GAQG,IAPHC,EAAAv/I,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAGIo/I,GJpYH,SACL/+H,GAGA,GAAsB,kBAAXA,EACT,MAAM,IAAInD,UAHZld,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAe,+CAA+CqgB,EAKhE,CIkYMm/H,CACEF,EACA,gIACkEA,GAEpE,MAAMG,EAAoBl7I,OAAOC,KAAK86I,GAIhCI,EAAqBH,EAHNE,EAAkB54I,KACrC3B,GAAOo6I,EAAqBp6I,MAI5B,WAAoC,QAAAuY,EAAAzd,UAAAC,OAAhC6+I,EAAA,IAAAzwI,MAAAoP,GAAAG,EAAA,EAAAA,EAAAH,EAAAG,IAAAkhI,EAAAlhI,GAAA5d,UAAA4d,GACF,OAAOkhI,EAAqB94I,QAAO,CAAC25I,EAAajzI,EAAOgV,KACtDi+H,EAAYF,EAAkB/9H,IAAUhV,EACjCizI,IACN,CAAC,EACN,IAEF,OAAOD,CACT,GACA,CAAEP,UAAWA,IAAME,IC7bhB,SAASO,EAAuBxsI,GACrC,MAAO,yBAAyBA,6CAAgDA,kFAClF,CCJA,IACOysI,EAD8B,KAAwB,oBAAX5uE,QAAyBA,OAAO6uE,YAAc,eAA3D,GCE/BC,EAAeA,IAAMjyH,KAAKmI,SAAStL,SAAS,IAAI/pB,UAAU,GAAGJ,MAAM,IAAI2O,KAAK,KAM3E6wI,EALa,CAClBC,KAAM,eAA8BF,MACpCG,QAAS,kBAAiCH,MAC1CI,qBAAsBA,IAAM,+BAA+BJ,OCP9C,SAAR1xD,EAA+BnjF,GACpC,GAAmB,kBAARA,GAA4B,OAARA,EAAc,OAAO,EACpD,IAAIm3E,EAAQn3E,EACZ,KAAwC,OAAjC3G,OAAO66E,eAAeiD,IAC3BA,EAAQ99E,OAAO66E,eAAeiD,GAEhC,OAAO99E,OAAO66E,eAAel0E,KAASm3E,GAAwC,OAA/B99E,OAAO66E,eAAel0E,EACvE,CC8DO,SAASk1I,EAAoGC,EAAwCC,EAA4EC,GACtO,GAAuB,oBAAZF,EACT,MAAM,IAAIlzI,MAA8CyyI,EAAwB,IAElF,GAA8B,oBAAnBU,GAAqD,oBAAbC,GAA+C,oBAAbA,GAAmD,oBAAjBvgJ,UAAU,GAC/H,MAAM,IAAImN,MAA8CyyI,EAAyB,IAMnF,GAJ8B,oBAAnBU,GAAqD,qBAAbC,IACjDA,EAAYD,EACZA,OAAiB,GAEK,qBAAbC,EAA0B,CACnC,GAAwB,oBAAbA,EACT,MAAM,IAAIpzI,MAA8CyyI,EAAyB,IAEnF,OAAOW,EAASH,EAATG,CAAsBF,EAAUC,EACzC,CACA,IAAIE,EAAiBH,EACjBh2I,EAAgDi2I,EAChDG,EAAyD,IAAIhoI,IAC7DioI,EAAgBD,EAChBE,EAAoB,EACpBC,GAAgB,EASpB,SAASC,IACHH,IAAkBD,IACpBC,EAAgB,IAAIjoI,IACpBgoI,EAAiBx2I,SAAQ,CAAC0lB,EAAUzqB,KAClCw7I,EAAcxnI,IAAIhU,EAAKyqB,EAAS,IAGtC,CAOA,SAAStkB,IACP,GAAIu1I,EACF,MAAM,IAAIzzI,MAA8CyyI,EAAyB,IAEnF,OAAQv1I,CACV,CAyBA,SAASy2I,EAAUnxH,GACjB,GAAwB,oBAAbA,EACT,MAAM,IAAIxiB,MAA8CyyI,EAAyB,IAEnF,GAAIgB,EACF,MAAM,IAAIzzI,MAA8CyyI,EAAyB,IAEnF,IAAImB,GAAe,EACnBF,IACA,MAAMG,EAAaL,IAEnB,OADAD,EAAcxnI,IAAI8nI,EAAYrxH,GACvB,WACL,GAAKoxH,EAAL,CAGA,GAAIH,EACF,MAAM,IAAIzzI,MAA8CyyI,EAAyB,IAEnFmB,GAAe,EACfF,IACAH,EAAczmI,OAAO+mI,GACrBP,EAAmB,IAPnB,CAQF,CACF,CA2BA,SAASr1I,EAASlC,GAChB,IAAKmlF,EAAcnlF,GACjB,MAAM,IAAIiE,MAA8CyyI,EAAyB,IAEnF,GAA2B,qBAAhB12I,EAAOyD,KAChB,MAAM,IAAIQ,MAA8CyyI,EAAyB,IAEnF,GAA2B,kBAAhB12I,EAAOyD,KAChB,MAAM,IAAIQ,MAA8CyyI,EAA0B,KAEpF,GAAIgB,EACF,MAAM,IAAIzzI,MAA8CyyI,EAA0B,IAEpF,IACEgB,GAAgB,EAChBv2I,EAAem2I,EAAen2I,EAAcnB,EAC9C,CAAE,QACA03I,GAAgB,CAClB,CAKA,OAJkBH,EAAmBC,GAC3Bz2I,SAAQ0lB,IAChBA,GAAU,IAELzmB,CACT,CAoEAkC,EAAU,CACRuB,KAAMqzI,EAAYC,OASpB,MAPgB,CACd70I,WACA01I,YACAz1I,WACA41I,eAhEF,SAAwBC,GACtB,GAA2B,oBAAhBA,EACT,MAAM,IAAI/zI,MAA8CyyI,EAA0B,KAEpFY,EAAmBU,EAMnB91I,EAAU,CACRuB,KAAMqzI,EAAYE,SAEtB,EAoDE,CAACL,GA5CH,WACE,MAAMsB,EAAiBL,EACvB,MAAO,CASLA,SAAAA,CAAUM,GACR,GAAwB,kBAAbA,GAAsC,OAAbA,EAClC,MAAM,IAAIj0I,MAA8CyyI,EAA0B,KAEpF,SAASyB,IACP,MAAMC,EAAsBF,EACxBE,EAAmBlrG,MACrBkrG,EAAmBlrG,KAAK/qC,IAE5B,CACAg2I,IAEA,MAAO,CACLE,YAFkBJ,EAAeE,GAIrC,EACA,CAACxB,KACC,OAAO9xI,IACT,EAEJ,EAgBF,CCxOe,SAARyzI,EAAiCz4I,GAGtC,MAAM04I,EAAcl9I,OAAOC,KAAKuE,GAC1B24I,EAEF,CAAC,EACL,IAAK,IAAIjhJ,EAAI,EAAGA,EAAIghJ,EAAYxhJ,OAAQQ,IAAK,CAC3C,MAAMyE,EAAMu8I,EAAYhhJ,GACpBiB,EAKyB,oBAAlBqH,EAAS7D,KAClBw8I,EAAcx8I,GAAO6D,EAAS7D,GAElC,CACA,MAAMy8I,EAAmBp9I,OAAOC,KAAKk9I,GAIrC,IAMIE,EACJ,KAnEF,SAA4B74I,GAG1BxE,OAAOC,KAAKuE,GAAUkB,SAAQ/E,IAC5B,MAAMm7I,EAAUt3I,EAAS7D,GAIzB,GAA4B,qBAHPm7I,OAAQ,EAAW,CACtC1zI,KAAMqzI,EAAYC,OAGlB,MAAM,IAAI9yI,MAA8CyyI,EAAwB,KAElF,GAEO,qBAFIS,OAAQ,EAAW,CAC5B1zI,KAAMqzI,EAAYG,yBAElB,MAAM,IAAIhzI,MAA8CyyI,EAAyB,IACnF,GAEJ,CAmDIiC,CAAmBH,EACrB,CAAE,MAAOjxI,GACPmxI,EAAsBnxI,CACxB,CACA,OAAO,WAA8F,IAAzExH,EAAAjJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAqD,CAAC,EAAGkJ,EAAAlJ,UAAAC,OAAA,EAAAD,UAAA,QAAAE,EACnF,GAAI0hJ,EACF,MAAMA,EAQR,IAAIE,GAAa,EACjB,MAAMC,EAAyD,CAAC,EAChE,IAAK,IAAIthJ,EAAI,EAAGA,EAAIkhJ,EAAiB1hJ,OAAQQ,IAAK,CAChD,MAAMyE,EAAMy8I,EAAiBlhJ,GACvB4/I,EAAUqB,EAAcx8I,GACxB88I,EAAsB/4I,EAAM/D,GAC5B+8I,EAAkB5B,EAAQ2B,EAAqB94I,GACrD,GAA+B,qBAApB+4I,EAAiC,CACvB/4I,GAAUA,EAAOyD,KACpC,MAAM,IAAIQ,MAA8CyyI,EAAyB,IACnF,CACAmC,EAAU78I,GAAO+8I,EACjBH,EAAaA,GAAcG,IAAoBD,CACjD,CAEA,OADAF,EAAaA,GAAcH,EAAiB1hJ,SAAWsE,OAAOC,KAAKyE,GAAOhJ,OACnE6hJ,EAAaC,EAAY94I,CAClC,CACF,CCvGe,SAARi5I,IAA+C,QAAA3kI,EAAAvd,UAAAC,OAAnBi1F,EAAA,IAAA7mF,MAAAkP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAA03E,EAAA13E,GAAAxd,UAAAwd,GACjC,OAAqB,IAAjB03E,EAAMj1F,OAEI2rB,GAAWA,EAEJ,IAAjBspE,EAAMj1F,OACDi1F,EAAM,GAERA,EAAMlvF,QAAO,CAACC,EAAGC,IAAM,kBAAkBD,EAAEC,KAAElG,WAAS,GAC/D,CCnCA,SAASmiJ,EAAsBC,GAO7B,OANmBjnI,IAAA,IAAC,SAAE/P,EAAQ,SAAEC,GAAU8P,EAAA,OAAMi7B,GAAUltC,GAClC,oBAAXA,EACFA,EAAOkC,EAAUC,EAAU+2I,GAE7BhsG,EAAKltC,EACb,CAEH,CACA,IAAIm5I,EAAQF,IACRG,EAAoBH,ECuOXI,GChP+D,WAC1E,MAAMtE,EAAkBL,KAA8B59I,WAChDwiJ,EAA0Bj+I,OAAOugB,QAAO,WAC5C,MAAM+5H,EAAWZ,KAAej+I,WAE1ByiJ,EAAkB,SAAC/1I,GAAA,QAAAgQ,EAAA1c,UAAAC,OAAmBitE,EAAA,IAAA7+D,MAAAqO,EAAA,EAAAA,EAAA,KAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAAswD,EAAAtwD,EAAA,GAAA5c,UAAA4c,GAAA,OAAoBiiI,GAAS6D,EAAAA,EAAAA,IAAQh2I,IAASxC,EAAAA,EAAAA,IAAQwC,GAASA,KAAUwgE,EAAI,EAGzH,OADA3oE,OAAOugB,OAAO29H,EAAiB5D,GACvB4D,CACV,GAAG,CACDtD,UAAWA,IAAMqD,GAGrB,CASuCG,CAA+B7F,GD0NI,qBAAXh7I,QAA2BA,OAAe8gJ,qCAAwC9gJ,OAAe8gJ,qCAAuC,WACrM,GAAyB,IAArB5iJ,UAAUC,OACd,MAA4B,kBAAjBD,UAAU,GAAwBkiJ,EACtCA,EAAQ1iI,MAAM,KAAQxf,UAC/B,GAOsB,qBAAX8B,QAA2BA,OAAe+gJ,8BAAgC/gJ,OAAe+gJ,6BE5D7F,SAASC,EAAan2I,EAAco2I,GACzC,SAASC,IACP,GAAID,EAAe,CACjB,IAAIE,EAAWF,KAAc/iJ,WAE7B,IAAKijJ,EACH,MAAM,IAAI91I,MAA8CyyI,EAAwB,IAGlF,MAAO,CACLjzI,OACAxD,QAAS85I,EAAS95I,WACd,SAAU85I,GAAY,CACxB/2E,KAAM+2E,EAAS/2E,SAEb,UAAW+2E,GAAY,CACzBvyI,MAAOuyI,EAASvyI,OAGtB,CAEA,MAAO,CACL/D,OACAxD,QAAAnJ,UAAAC,QAAA,OAAAC,EAAAF,UAAA,GAEJ,CAQA,OANAgjJ,EAAcr4H,SAAW,IAAM,GAAGhe,IAElCq2I,EAAcr2I,KAAOA,EAErBq2I,EAActxI,MAASxI,GC9NV,SAAkBA,GAC/B,OAAOmlF,EAAcnlF,IAAW,SAAUA,GAA8D,kBAA5CA,EAAmCyD,IACjG,CD4NsEu2I,CAASh6I,IAAWA,EAAOyD,OAASA,EAEjGq2I,CACT,CE5LO,IAAMG,EAAN,MAAMC,UAAyD/0I,MAIpE8B,WAAAA,GACEmD,SAAMtT,WACNuE,OAAOgP,eAAexF,KAAMq1I,EAAM5vI,UACpC,CAEA,WAAYy9D,OAAOoyE,WACjB,OAAQD,CACV,CAMApzF,MAAAA,GAAsB,QAAAzyC,EAAAvd,UAAAC,OAAZqjJ,EAAA,IAAAj1I,MAAAkP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAA8lI,EAAA9lI,GAAAxd,UAAAwd,GACR,OAAOlK,MAAM08C,OAAOxwC,MAAMzR,KAAMu1I,EAClC,CAMAC,OAAAA,GAAuB,QAAA9lI,EAAAzd,UAAAC,OAAZqjJ,EAAA,IAAAj1I,MAAAoP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAA4lI,EAAA5lI,GAAA1d,UAAA0d,GACT,OAAmB,IAAf4lI,EAAIrjJ,QAAgBoO,MAAMC,QAAQg1I,EAAI,IACjC,IAAIF,KAASE,EAAI,GAAGtzF,OAAOjiD,OAG7B,IAAIq1I,KAASE,EAAItzF,OAAOjiD,MACjC,GAGK,SAASy1I,EAAmBvmI,GACjC,OAAOwmI,EAAAA,EAAAA,IAAYxmI,IAAOymI,EAAAA,EAAAA,IAAgBzmI,GAAK,SAAYA,CAC7D,CAqDO,SAAS0mI,EAA6B98I,EAAoB3B,EAAQ0+I,GACvE,GAAI/8I,EAAImS,IAAI9T,GAAM,CAChB,IAAIwH,EAAS7F,EAAI5E,IAAIiD,GAOrB,OALI0+I,EAAQjtI,SACVjK,EAAQk3I,EAAQjtI,OAAOjK,EAAOxH,EAAK2B,GACnCA,EAAIqS,IAAIhU,EAAKwH,IAGRA,CACT,CAEA,IAAKk3I,EAAQx0G,OAAQ,MAAM,IAAIjiC,MAA8CyyI,EAAwB,KACrG,MAAMiE,EAAWD,EAAQx0G,OAAOlqC,EAAK2B,GAErC,OADAA,EAAIqS,IAAIhU,EAAK2+I,GACNA,CACT,CCtGO,IAAMC,EAA4BA,IAAyC,SAA8BrqI,GAC9G,MAAM,MACJ4oI,GAAQ,EAAI,eACZ0B,GAAiB,EAAI,kBACrBC,GAAoB,EAAI,mBACxBC,GAAqB,GACnBxqI,GAAW,CAAC,EAChB,IAAIyqI,EAAkB,IAAIf,EA4C1B,OA1CId,IAlCgB,mBAmCJA,EACZ6B,EAAgBt/I,KAAKu/I,GAErBD,EAAgBt/I,KAAK09I,EAAkBD,EAAMD,iBAsCzC8B,CACV,EC7FaE,EAAmB,gBAW1BC,EAAwBp1H,GACpBq1H,IACNz8I,WAAWy8I,EAAQr1H,EAAQ,EAMzBs1H,EAAwB,qBAAXziJ,QAA0BA,OAAO0iJ,sBAAwB1iJ,OAAO0iJ,sBAAwBH,EAAqB,ICRnHI,EAAyDC,GAEvC,SAA6BjrI,GAC1D,MAAM,UACJkrI,GAAY,GACVlrI,GAAW,CAAC,EAChB,IAAImrI,EAAgB,IAAIzB,EAAuBuB,GAM/C,OAJIC,GACFC,EAAchgJ,KDkCe,eAAC6U,EAAAzZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAA4B,CAC5D2M,KAAM,OACR,OAAqBypC,GAAQ,WAC3B,MAAM30B,EAAQ20B,KAAKp2C,WACnB,IAAI6kJ,GAAY,EACZC,GAA0B,EAC1BC,GAAqB,EACzB,MAAMxiH,EAAY,IAAIznB,IAChBkqI,EAAiC,SAAjBvrI,EAAQ9M,KAAkBkkH,eAAkC,QAAjBp3G,EAAQ9M,KAAiB43I,EAAuB,aAAjB9qI,EAAQ9M,KAAsB8M,EAAQwrI,kBAAoBZ,EAAqB5qI,EAAQwV,SAEjLi2H,EAAkBA,KAGtBH,GAAqB,EAEjBD,IACFA,GAA0B,EAC1BviH,EAAUt4B,SAAQynG,GAAKA,MACzB,EAGF,OAAOntG,OAAOugB,OAAO,CAAC,EAAGrD,EAAO,CAG9Bq/H,SAAAA,CAAUqE,GAKR,MAEM5D,EAAc9/H,EAAMq/H,WAFesE,IAAMP,GAAaM,MAI5D,OADA5iH,EAAUxnB,IAAIoqI,GACP,KACL5D,IACAh/G,EAAUtoB,OAAOkrI,EAAS,CAE9B,EAIA/5I,QAAAA,CAASlC,GACP,IAwBE,OArBA27I,GAAa37I,GAAQgjE,OAAOk4E,GAG5BU,GAA2BD,EAEvBC,IAIGC,IACHA,GAAqB,EACrBC,EAAcE,KAUXzjI,EAAMrW,SAASlC,EACxB,CAAE,QAEA27I,GAAY,CACd,CACF,GAGJ,EC5GuBQ,CAAuC,kBAAdV,EAAyBA,OAAY,IAG3EC,CACV,ECRMU,GAAgB5jJ,EAsEf,SAAS6jJ,EAEY9rI,GAC1B,MAAM+rI,EAAuB1B,KACvB,QACJzD,EAAU,WACVoF,EAAA,SACAC,GAAW,EAAI,eACfpF,EAAiB,UACjBqF,GACElsI,GAAW,CAAC,EAChB,IAAImsI,EAcAC,EAZJ,GAAuB,oBAAZxF,EACTuF,EAAcvF,MACT,KAAIyF,EAAczF,GAGvB,MAAM,IAAIlzI,MAA8CyyI,EAAwB,IAFhFgG,EAAgBpE,EAAgBnB,EAGlC,CAEA,IAAKiF,GAAiBG,GAAoC,oBAAfA,EACzC,MAAM,IAAIt4I,MAA8CyyI,EAAyB,IAKnF,GAA0B,oBAAf6F,GAGT,GAFAI,EAAkBJ,EAAWD,IAExBF,IAAkBj3I,MAAMC,QAAQu3I,GACnC,MAAM,IAAI14I,MAA8CyyI,EAAyB,SAGnFiG,EAAkBL,IAGpB,IAAKF,GAAiBO,EAAgBrlI,MAAM3a,GAA8B,oBAATA,IAC/D,MAAM,IAAIsH,MAA8CyyI,EAAyB,IAGnF,IAAImG,EAAeC,EAEfN,IACFK,EAAexD,EAAoB,CAEjC0D,OAAQX,KACgB,kBAAbI,GAAyBA,KAIxC,MAAMhB,EC/FO,WAA2E,QAAAjnI,EAAAzd,UAAAC,OAA/CimJ,EAAA,IAAA73I,MAAAoP,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAAwoI,EAAAxoI,GAAA1d,UAAA0d,GACzC,OAAOyoI,GAAe,CAAC9F,EAASC,KAC9B,MAAM7+H,EAAQ0kI,EAAY9F,EAASC,GACnC,IAAIl1I,EAAqBA,KACvB,MAAM,IAAI+B,MAA8CyyI,EAAwB,IAAoI,EAEtN,MAAMwG,EAA+B,CACnC/6I,SAAUoW,EAAMpW,SAChBD,SAAU,SAAClC,GAAA,QAAAyU,EAAA3d,UAAAC,OAAW0c,EAAA,IAAAtO,MAAAsP,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAAjB,EAAAiB,EAAA,GAAA5d,UAAA4d,GAAA,OAASxS,EAASlC,KAAWyT,EAAI,GAEnD6/E,EAAQ0pD,EAAYr/I,KAAI4+I,GAAcA,EAAWW,KAEvD,OADAh7I,EAAW82I,KAA4B1lD,EAA5B0lD,CAAmCzgI,EAAMrW,UAC7C,IACFqW,EACHrW,WACD,CAEL,CD8E6Bi7I,IAAmBR,GACxCS,EAAsB7B,EAA4BC,GAExD,IAAKY,GAAiBK,GAAkC,oBAAdA,EACxC,MAAM,IAAIx4I,MAA8CyyI,EAAyB,IAGnF,IAAI2G,EAAsC,oBAAdZ,EAA2BA,EAAUW,GAAuBA,IAExF,IAAKhB,IAAkBj3I,MAAMC,QAAQi4I,GACnC,MAAM,IAAIp5I,MAA8CyyI,EAAyB,IAGnF,IAAK0F,GAAiBiB,EAAe/lI,MAAM3a,GAA8B,oBAATA,IAC9D,MAAM,IAAIsH,MAA8CyyI,EAAyB,IAG9E0F,IAAiBO,EAAgB5lJ,QAAWsmJ,EAAehxI,SAASmvI,IACvEzhJ,QAAQyN,MAAM,oIAIhB,OAAO0vI,EAAYwF,EAActF,EADYyF,KAAgBQ,GAE/D,CEjDO,SAASC,EAAiCC,GAC/C,MAAMC,EAAmC,CAAC,EACpCC,EAAwD,GAC9D,IAAIC,EACJ,MAAMC,EAAU,CACdC,OAAAA,CAAQC,EAAuD1G,GAgB7D,MAAM1zI,EAAsC,kBAAxBo6I,EAAmCA,EAAsBA,EAAoBp6I,KAEjG,IAAKA,EACH,MAAM,IAAIQ,MAA8CyyI,EAAyB,KAGnF,GAAIjzI,KAAQ+5I,EACV,MAAM,IAAIv5I,MAA8CyyI,EAAyB,KAInF,OADA8G,EAAW/5I,GAAQ0zI,EACZwG,CACT,EAEAG,WAAU,CAAIv4E,EAAuB4xE,KAOnCsG,EAAe/hJ,KAAK,CAClB6pE,UACA4xE,YAEKwG,GAGTI,eAAe5G,IAObuG,EAAqBvG,EACdwG,IAKX,OADAJ,EAAgBI,GACT,CAACH,EAAYC,EAAgBC,EACtC,CC5KA,IAMWM,EAAS,WAAe,IAC7B57H,EAAK,GAEL7qB,EAHeT,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAO,GAK1B,KAAOS,KAEL6qB,GAbc,mEAaoB,GAAhBwC,KAAKmI,SAAgB,GAGzC,OAAO3K,CACT,ECCA,IAAM67H,EAAkCl2E,OAAOk/B,IAAI,8BAmUnD,SAASi3C,EAAQ1iJ,EAAe2iJ,GAC9B,MAAO,GAAG3iJ,KAAS2iJ,GACrB,CAOO,SAASC,IAEgB,IAFC,SAC/BC,GACFvnJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAA4B,CAAC,EAC3B,MAAMwnJ,EAAMD,GAAUE,aAAaN,GACnC,OAAO,SAA4K1tI,GACjL,MAAM,KACJtZ,EAAA,YACAunJ,EAAgBvnJ,GACdsZ,EAEJ,IAAKtZ,EACH,MAAM,IAAIgN,MAA8CyyI,EAAwB,KASlF,MAAM72I,GAAwC,oBAArB0Q,EAAQ1Q,SAA0B0Q,EAAQ1Q,SAmRvE,WACE,SAAS0+I,EAAWE,EAAoDllJ,GACtE,MAAO,CACLmlJ,uBAAwB,aACxBD,oBACGllJ,EAEP,CAIA,OAFAglJ,EAAWtI,UAAY,IAAMsI,EAEtB,CACLpH,QAAQwH,GACCtjJ,OAAOugB,OAAO,CAGnB,CAAC+iI,EAAY1nJ,QACX,OAAO0nJ,KAAY7nJ,UACrB,GAEA6nJ,EAAY1nJ,MAAQ,CACpBynJ,uBAAwB,YAI5BE,gBAAe,CAACC,EAAS1H,KAChB,CACLuH,uBAAwB,qBACxBG,UACA1H,YAIJoH,aAEJ,CAtTgFO,IAAiCvuI,EAAQ1Q,WAAa,CAAC,EAC7Hk/I,EAAe1jJ,OAAOC,KAAKuE,GAC3By5B,EAAyC,CAC7C0lH,wBAAyB,CAAC,EAC1BC,wBAAyB,CAAC,EAC1BC,eAAgB,CAAC,EACjBC,cAAe,IAEXC,EAAuD,CAC3DxB,OAAAA,CAAQC,EAAuDwB,GAC7D,MAAM57I,EAAsC,kBAAxBo6I,EAAmCA,EAAsBA,EAAoBp6I,KAEjG,IAAKA,EACH,MAAM,IAAIQ,MAA8CyyI,EAAyB,KAGnF,GAAIjzI,KAAQ61B,EAAQ2lH,wBAClB,MAAM,IAAIh7I,MAA8CyyI,EAAyB,KAInF,OADAp9G,EAAQ2lH,wBAAwBx7I,GAAQ47I,EACjCD,CACT,EAEAtB,WAAU,CAACv4E,EAAS85E,KAClB/lH,EAAQ6lH,cAAczjJ,KAAK,CACzB6pE,UACA4xE,QAAAkI,IAEKD,GAGTE,aAAY,CAACC,EAAMzF,KACjBxgH,EAAQ4lH,eAAeK,GAAQzF,EACxBsF,GAGTI,kBAAiB,CAACD,EAAMF,KACtB/lH,EAAQ0lH,wBAAwBO,GAAQF,EACjCD,IAmBX,SAASK,IAOP,MAAOC,EAAgB,CAAC,EAAGjC,EAAiB,GAAIC,GAAmE,oBAA1BntI,EAAQmvI,cAA+BpC,EAA8B/sI,EAAQmvI,eAAiB,CAACnvI,EAAQmvI,eAC1LC,EAAoB,IAAKD,KAC1BpmH,EAAQ2lH,yBAEb,OC1TC,SAAmDx/I,EAA6BmgJ,GAOrF,IAEIC,GAFCrC,EAAYsC,EAAqBC,GAA2BzC,EAA8BsC,GAI/F,GAlFoB,oBAkFAngJ,EAClBogJ,EAAkBA,IAAMvF,EAAgB76I,SACnC,CACL,MAAMugJ,EAAqB1F,EAAgB76I,GAE3CogJ,EAAkBA,IAAMG,CAC1B,CAEA,SAAS7I,IAAmD,IAA3Cp3I,EAAAjJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAQ+oJ,IAAmB7/I,EAAAlJ,UAAAC,OAAA,EAAAD,UAAA,QAAAE,EACtCipJ,EAAe,CAACzC,EAAWx9I,EAAOyD,SAAUq8I,EAAoBz+I,QAAO86D,IAAA,IAAC,QAC1EoJ,GACFpJ,EAAA,OAAMoJ,EAAQvlE,EAAO,IAAErC,KAAIuiJ,IAAA,IACzB/I,QAAAkI,GACFa,EAAA,OAAMb,CAAO,KAMb,OAJ+C,IAA3CY,EAAa5+I,QAAO8+I,KAAQA,IAAIppJ,SAClCkpJ,EAAe,CAACF,IAGXE,EAAanjJ,QAAO,CAACsjJ,EAAezB,KACzC,GAAIA,EAAa,CACf,IAAI0B,EAAAA,EAAAA,IAAQD,GAAgB,CAI1B,MAEMvkJ,EAAS8iJ,EAFAyB,EAEmBpgJ,GAElC,YAAe,IAAXnE,EACKukJ,EAGDvkJ,CACV,CAAO,IAAKykJ,EAAAA,EAAAA,IAAYF,GAkBtB,OAAOG,EAAAA,EAAAA,IAAgBH,GAAgBI,GAC9B7B,EAAY6B,EAAOxgJ,KAnBU,CAGtC,MAAMnE,EAAS8iJ,EAAayB,EAAuBpgJ,GAEnD,QAAe,IAAXnE,EAAsB,CACxB,GAAsB,OAAlBukJ,EACF,OAAOA,EAGT,MAAM,IAAIn8I,MAA8CyyI,EAAyB,GACnF,CAEA,OAAQ76I,CACV,CAQF,CAEA,OAAOukJ,CAAA,GACNrgJ,EACL,CAGA,OADAo3I,EAAQ0I,gBAAkBA,EAClB1I,CACV,CD+OasJ,CAAclwI,EAAQ9Q,cAAck+I,IACzC,IAAK,IAAI3hJ,KAAO2jJ,EACdhC,EAAQC,QAAQ5hJ,EAAM2jJ,EAAkB3jJ,IAG1C,IAAK,IAAI0kJ,KAAMpnH,EAAQ6lH,cACrBxB,EAAQG,WAAW4C,EAAGn7E,QAASm7E,EAAGvJ,SAGpC,IAAK,IAAI9kH,KAAKorH,EACZE,EAAQG,WAAWzrH,EAAEkzC,QAASlzC,EAAE8kH,SAG9BuG,GACFC,EAAQI,eAAeL,EACzB,GAEJ,CA3CAqB,EAAah+I,SAAQ4/I,IACnB,MAAMC,EAAoB/gJ,EAAS8gJ,GAC7BE,EAAiC,CACrCF,cACAl9I,KAAMy6I,EAAQjnJ,EAAM0pJ,GACpBG,eAA4C,oBAArBvwI,EAAQ1Q,WAiSvC,SAAmD+gJ,GACjD,MAAoD,eAA7CA,EAAkBlC,sBAC3B,CAhSUqC,CAA0CH,GAqQpD,SAASlZ,EAIUsZ,EAGuD1nH,GAA+C,IACnHqlH,EACAsC,GATwC,KAC5Cx9I,EAAA,YACAk9I,EAAA,eACAG,GACFpZ,EAOE,GAAI,YAAasZ,EAAyB,CACxC,GAAIF,IAiBR,SAAmDF,GACjD,MAAoD,uBAA7CA,EAAkBlC,sBAC3B,CAnB2BwC,CAAmCF,GACxD,MAAM,IAAI/8I,MAA8CyyI,EAAyB,KAGnFiI,EAAcqC,EAAwB7J,QACtC8J,EAAkBD,EAAwBnC,OAC5C,MACEF,EAAcqC,EAGhB1nH,EAAQskH,QAAQn6I,EAAMk7I,GAAaa,kBAAkBmB,EAAahC,GAAaW,aAAaqB,EAAaM,EAAkBrH,EAAan2I,EAAMw9I,GAAmBrH,EAAan2I,GAChL,CAzRQ09I,CAAqCN,EAAgBD,EAAmBxB,GAmShF,SAAShQ,EAGUwR,EAA2EtnH,EAA+CglH,GAA2C,IAHvI,KAC/C76I,EAAA,YACAk9I,GACFvR,EACE,IAAKkP,EACH,MAAM,IAAIr6I,MAA8CyyI,EAAyB,KAGnF,MAAM,eACJ+H,EAAA,UACA2C,EAAA,QACAlzB,EAAA,SACAmzB,EAAA,QACAC,EAAA,QACA/wI,GACEqwI,EACEzH,EAAQmF,EAAI76I,EAAMg7I,EAAiBluI,GACzC+oB,EAAQgmH,aAAaqB,EAAaxH,GAE9BiI,GACF9nH,EAAQskH,QAAQzE,EAAMiI,UAAWA,GAG/BlzB,GACF50F,EAAQskH,QAAQzE,EAAMjrB,QAASA,GAG7BmzB,GACF/nH,EAAQskH,QAAQzE,EAAMkI,SAAUA,GAG9BC,GACFhoH,EAAQwkH,WAAW3E,EAAMmI,QAASA,GAGpChoH,EAAQkmH,kBAAkBmB,EAAa,CACrCS,UAAWA,GAAahyD,EACxB8+B,QAASA,GAAW9+B,EACpBiyD,SAAUA,GAAYjyD,EACtBkyD,QAASA,GAAWlyD,GAExB,CA9UQmyD,CAAiCV,EAAgBD,EAAmBxB,EAAgBd,EAGtF,IAiCF,MAAMkD,EAAczhJ,GAAiBA,EAE/B0hJ,EAAwB,IAAIlyI,IAElC,IAAImyI,EAEJ,SAASvK,EAAQp3I,EAA0BC,GAEzC,OADK0hJ,IAAUA,EAAWjC,KACnBiC,EAAS3hJ,EAAOC,EACzB,CAEA,SAAS6/I,IAEP,OADK6B,IAAUA,EAAWjC,KACnBiC,EAAS7B,iBAClB,CAEA,SAAS8B,EAAmEC,GAAwL,IAAvJC,EAAA/qJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAC3G,SAASgrJ,EAAY/hJ,GACnB,IAAIgiJ,EAAahiJ,EAAM6hJ,GAUvB,MAR0B,qBAAfG,GACLF,IACFE,EAAalC,KAMVkC,CACT,CAEA,SAASC,IAAkE,IAArDC,EAAAnrJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAyC0qJ,EAC7D,MAAMU,EAAgBzH,EAAQgH,EAAuBI,EAAU,CAC7D37G,OAAQA,IAAM,IAAI/wB,UAEpB,OAAQslI,EAAQyH,EAAeD,EAAa,CAC1C/7G,OAAQA,KACN,MAAMvoC,EAA0C,CAAC,EAEjD,IAAK,MAAO4hJ,EAAM5J,KAAat6I,OAAOwV,QAAQN,EAAQ4xI,WAAa,CAAC,GAClExkJ,EAAI4hJ,GAAQ6C,EAAazM,EAAUsM,EAAapC,EAAiBgC,GAGnE,OAAOlkJ,CAAA,GAGb,CAEA,MAAO,CACL6gJ,YAAAoD,EACAI,eAEA,aAAIG,GACF,OAAOH,EAAaF,EACtB,EAEAA,cAEJ,CAEA,MAAMtmJ,EAAkE,CACtEvE,OACAkgJ,UACAxzI,QAAU21B,EAAQ4lH,eAClBe,aAAe3mH,EAAQ0lH,wBACvBa,qBACG8B,EAAkBnD,GAErB6D,UAAAA,CAAWC,GAGH,IAFN9D,YAAa+D,KACVhpJ,GACLzC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAI,CAAC,EACH,MAAM0rJ,EAAiBD,GAAW/D,EAKlC,OAJA8D,EAAWjc,OAAO,CAChBmY,YAAagE,EACbrL,WACC59I,GACK,IAAKiC,KACRmmJ,EAAkBa,GAAgB,GAEzC,GAGF,OAAOhnJ,CACT,CACF,CAEA,SAAS4mJ,EAAyDzM,EAAasM,EAAwCpC,EAA8BgC,GACnJ,SAAS11D,EAAQs2D,GACf,IAAIV,EAAaE,EAAYQ,GAEH,qBAAfV,GACLF,IACFE,EAAalC,KAIjB,QAAA6C,EAAA5rJ,UAAAC,OATuC0c,EAAA,IAAAtO,MAAAu9I,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAAlvI,EAAAkvI,EAAA,GAAA7rJ,UAAA6rJ,GAWvC,OAAOhN,EAASoM,KAAetuI,EACjC,CAGA,OADA04E,EAAQy2D,UAAYjN,EACZxpD,CACV,CAWO,IAAM3sF,EAA6B4+I,IAyL1C,SAAShvD,IAAQ,CExvBjB,ICCayzD,EAAuGA,CAAC9sI,EAAe+sI,KAClI,GAAoB,oBAAT/sI,EACT,MAAM,IAAI9R,MAA8CyyI,EAAwB,IAClF,EC4CK,IChCL96H,OAAMA,GACJvgB,OAME0nJ,EAAO,qBAqFPC,EAA6BzyI,IACjC,IAAI,KACF9M,EAAA,cACAq2I,EAAA,QACAv0E,EAAA,UACAppB,EAAA,OACA8mG,GACE1yI,EAEJ,GAAI9M,EACF04C,EAAYy9F,EAAan2I,GAAM+E,WAC1B,GAAIsxI,EACTr2I,EAAOq2I,EAAer2I,KACtB04C,EAAY29F,EAActxI,WACrB,GAAI+8D,EACTppB,EAAYopB,OACP,IAAIppB,EAET,MAAM,IAAIl4C,MAA8CyyI,EAAwB,KAIlF,OADAmM,EAAeI,GACR,CACL9mG,YACA14C,OACAw/I,SACD,EAKUC,EAA2D7nJ,OAAOugB,QAAQrL,IACrF,MAAM,KACJ9M,EAAA,UACA04C,EAAA,OACA8mG,GACED,EAA0BzyI,GAY9B,MAVsC,CACpC6R,GAFS47H,IAGTiF,SACAx/I,OACA04C,YACA+xE,QAAS,IAAIt8G,IACbymI,YAAaA,KACX,MAAM,IAAIp0I,MAA8CyyI,EAAyB,IAAoC,EAGlH,GACN,CACDT,UAAWA,IAAMiN,IAwCNC,EAAgB9nJ,OAAOugB,OAAOg+H,EAAa,GAAGmJ,SAAY,CACrE9M,UAAWA,IAAMkN,IAWNC,GALoBxJ,EAAa,GAAGmJ,eAKjB1nJ,OAAOugB,OAAOg+H,EAAa,GAAGmJ,YAAe,CAC3E9M,UAAWA,IAAMmN,KC0BIr7E,OAAOk/B,IAAI,4BCvO3B,SAASyvC,EAAuBxsI,GACrC,MAAO,iCAAiCA,qDAAwDA,kFAClG,4ECJO,IAAMm5I,EAAyBt7E,OAAOk/B,IAAI,iBAUpCq8C,EAA2Bv7E,OAAOk/B,IAAI,mBAEtCs8C,EAA6Bx7E,OAAOk/B,IAAI,eCqB9C,SAASu8C,EAAIh8I,GAMnB,MAAM,IAAIvD,MACT,8BAA8BuD,2CAEhC,CClCO,IAAM0uE,EAAiB76E,OAAO66E,eAI9B,SAASsjE,EAAQh2I,GACvB,QAASA,KAAWA,EAAM+/I,EAC3B,CAIO,SAAShJ,EAAY/2I,GAC3B,QAAKA,IAEJ2hF,EAAc3hF,IACd2B,MAAMC,QAAQ5B,MACZA,EAAM8/I,MACN9/I,EAAMyD,cAAcq8I,IACtB7yE,EAAMjtE,IACNqtE,EAAMrtE,GAER,CAEA,IAAMmyE,EAAmBt6E,OAAOiP,UAAUrD,YAAYwa,WAE/C,SAAS0jE,EAAc3hF,GAC7B,IAAKA,GAA0B,kBAAVA,EAAoB,OAAO,EAChD,MAAM21E,EAAQjD,EAAe1yE,GAC7B,GAAc,OAAV21E,EACH,OAAO,EAER,MAAMmE,EACLjiF,OAAOyM,eAAe6D,KAAKwtE,EAAO,gBAAkBA,EAAMlyE,YAE3D,OAAIq2E,IAASjiF,QAGG,mBAARiiF,GACP9N,SAAS/tD,SAAS9V,KAAK2xE,KAAU3H,CAEnC,CAmBO,SAAStxD,EAAKriB,EAAUgrC,GACL,IAArBy2G,EAAYzhJ,GACfsmG,QAAQo7C,QAAQ1hJ,GAAKjB,SAAQ/E,IAC5BgxC,EAAKhxC,EAAKgG,EAAIhG,GAAMgG,EAAI,IAGzBA,EAAIjB,SAAQ,CAACk5E,EAAYzhE,IAAew0B,EAAKx0B,EAAOyhE,EAAOj4E,IAE7D,CAGO,SAASyhJ,EAAYh3I,GAC3B,MAAM1M,EAAgC0M,EAAM82I,GAC5C,OAAOxjJ,EACJA,EAAM4jJ,MACNx+I,MAAMC,QAAQqH,GAAK,EAEnBgkE,EAAMhkE,GAAK,EAEXokE,EAAMpkE,GAAK,GAGf,CAGO,SAASqD,EAAIrD,EAAY5E,GAC/B,OAA8B,IAAvB47I,EAAYh3I,GAChBA,EAAMqD,IAAIjI,GACVxM,OAAOiP,UAAUxC,eAAe6D,KAAKc,EAAO5E,EAChD,CASO,SAASmI,EAAIvD,EAAYm3I,EAA6BpgJ,GAC5D,MAAM+J,EAAIk2I,EAAYh3I,GAClB,IAAAc,EAAoBd,EAAMuD,IAAI4zI,EAAgBpgJ,GACzC,IAAA+J,EACRd,EAAMoF,IAAIrO,GACJiJ,EAAMm3I,GAAkBpgJ,CAChC,CAaO,SAASitE,EAAM9oE,GACrB,OAAOA,aAAkB4H,GAC1B,CAGO,SAASshE,EAAMlpE,GACrB,OAAOA,aAAkBiK,GAC1B,CAEO,SAASiyI,EAAO9jJ,GACtB,OAAOA,EAAM+jJ,OAAS/jJ,EAAMgkJ,KAC7B,CAGO,SAASC,EAAYriF,EAAWsiF,GACtC,GAAIxzE,EAAM9O,GACT,OAAO,IAAIpyD,IAAIoyD,GAEhB,GAAIkP,EAAMlP,GACT,OAAO,IAAI/vD,IAAI+vD,GAEhB,GAAIx8D,MAAMC,QAAQu8D,GAAO,OAAOx8D,MAAMmF,UAAU9O,MAAMmQ,KAAKg2D,GAE3D,IAAKsiF,GAAU9+D,EAAcxjB,GAAO,CACnC,IAAKuU,EAAevU,GAAO,CAC1B,MAAM3/D,EAAM3G,OAAOoP,OAAO,MAC1B,OAAOpP,OAAOugB,OAAO5Z,EAAK2/D,EAC3B,CACA,MAAO,IAAIA,EACZ,CAEA,MAAMuiF,EAAc7oJ,OAAO8oJ,0BAA0BxiF,UAC9CuiF,EAAYX,GACnB,IAAIjoJ,EAAOgtG,QAAQo7C,QAAQQ,GAC3B,IAAK,IAAI3sJ,EAAI,EAAGA,EAAI+D,EAAKvE,OAAQQ,IAAK,CACrC,MAAMyE,EAAWV,EAAK/D,GAChB6sJ,EAAOF,EAAYloJ,IACH,IAAlBooJ,EAAKC,WACRD,EAAKC,UAAW,EAChBD,EAAK56C,cAAe,IAKjB46C,EAAKrrJ,KAAOqrJ,EAAKp0I,OACpBk0I,EAAYloJ,GAAO,CAClBwtG,cAAc,EACd66C,UAAU,EACV56C,WAAY26C,EAAK36C,WACjBjmG,MAAOm+D,EAAK3lE,IAEf,CACA,OAAOX,OAAOoP,OAAOyrE,EAAevU,GAAOuiF,EAC5C,CAUO,SAASI,EAAUtiJ,GAAoC,IAA1BuiJ,EAAAztJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GACnC,OAAI0tJ,EAASxiJ,IAAQw3I,EAAQx3I,KAASu4I,EAAYv4I,KAC9CyhJ,EAAYzhJ,GAAO,IACtBA,EAAIgO,IAAMhO,EAAI6P,IAAM7P,EAAIs1C,MAAQt1C,EAAI+O,OAAS0zI,GAE9CppJ,OAAOipJ,OAAOtiJ,GACVuiJ,GAGHlpJ,OAAOwV,QAAQ7O,GAAKjB,SAAQkR,IAAA,IAAEjW,EAAKwH,GAAKyO,EAAA,OAAMqyI,EAAO9gJ,GAAO,EAAK,KARHxB,CAUhE,CAEA,SAASyiJ,IACRjB,EAAI,EACL,CAEO,SAASgB,EAASxiJ,GACxB,OAAO3G,OAAOmpJ,SAASxiJ,EACxB,CCtMA,ICYI0iJ,EDZEC,EAoBF,CAAC,EAIE,SAASC,EACfC,GAEA,MAAMC,EAASH,EAAQE,GAKvB,OAJKC,GACJtB,EAAI,GAGEsB,CACR,CCnBO,SAASC,IACf,OAAOL,CACR,CAiBO,SAASM,EACfC,EACAC,GAEIA,IACHN,EAAU,WACVK,EAAME,SAAW,GACjBF,EAAMG,gBAAkB,GACxBH,EAAMI,eAAiBH,EAEzB,CAEO,SAASI,EAAYL,GAC3BM,EAAWN,GACXA,EAAMO,QAAQzkJ,QAAQ0kJ,GAEtBR,EAAMO,QAAU,IACjB,CAEO,SAASD,EAAWN,GACtBA,IAAUP,IACbA,EAAeO,EAAMS,QAEvB,CAEO,SAASC,EAAWC,GAC1B,OAAQlB,EArCD,CACNc,QAAS,GACTE,QAmCkChB,EAlClCmB,OAkCgDD,EA/BhDE,gBAAgB,EAChBC,mBAAoB,EA+BtB,CAEA,SAASN,EAAYjF,GACpB,MAAMzgJ,EAAoBygJ,EAAM+C,GACtB,IAANxjJ,EAAM4jJ,OAAmC,IAAN5jJ,EAAM4jJ,MAC5C5jJ,EAAMimJ,UACFjmJ,EAAMkmJ,UAAW,CACvB,CC3DO,SAASC,EAAcrqJ,EAAaopJ,GAC1CA,EAAMc,mBAAqBd,EAAMO,QAAQzuJ,OACzC,MAAMovJ,EAAYlB,EAAMO,QAAS,GA4BjC,YA3B8B,IAAX3pJ,GAAwBA,IAAWsqJ,GAEjDA,EAAU5C,GAAa6C,YAC1Bd,EAAYL,GACZzB,EAAI,IAEDjJ,EAAY1+I,KAEfA,EAASwqJ,EAASpB,EAAOppJ,GACpBopJ,EAAMS,SAASY,EAAYrB,EAAOppJ,IAEpCopJ,EAAME,UACTP,EAAU,WAAW2B,4BACpBJ,EAAU5C,GAAaQ,MACvBloJ,EACAopJ,EAAME,SACNF,EAAMG,kBAKRvpJ,EAASwqJ,EAASpB,EAAOkB,EAAW,IAErCb,EAAYL,GACRA,EAAME,UACTF,EAAMI,eAAgBJ,EAAME,SAAUF,EAAMG,iBAEtCvpJ,IAAWwnJ,EAAUxnJ,OAAS,CACtC,CAEA,SAASwqJ,EAASG,EAAuBhjJ,EAAYk3B,GAEpD,GAAI8pH,EAAShhJ,GAAQ,OAAOA,EAE5B,MAAMzD,EAAoByD,EAAM+/I,GAEhC,IAAKxjJ,EAIJ,OAHAskB,EAAK7gB,GAAO,CAACxH,EAAKyqJ,IACjBC,EAAiBF,EAAWzmJ,EAAOyD,EAAOxH,EAAKyqJ,EAAY/rH,KAErDl3B,EAGR,GAAIzD,EAAM4mJ,SAAWH,EAAW,OAAOhjJ,EAEvC,IAAKzD,EAAMqmJ,UAEV,OADAE,EAAYE,EAAWzmJ,EAAMgkJ,OAAO,GAC7BhkJ,EAAMgkJ,MAGd,IAAKhkJ,EAAM6mJ,WAAY,CACtB7mJ,EAAM6mJ,YAAa,EACnB7mJ,EAAM4mJ,OAAOZ,qBACb,MAAMlqJ,EAASkE,EAAM+jJ,MAKrB,IAAI+C,EAAahrJ,EACbirJ,GAAQ,EACF,IAAN/mJ,EAAM4jJ,QACTkD,EAAa,IAAIj1I,IAAI/V,GACrBA,EAAOy7C,QACPwvG,GAAQ,GAETziI,EAAKwiI,GAAY,CAAC7qJ,EAAKyqJ,IACtBC,EAAiBF,EAAWzmJ,EAAOlE,EAAQG,EAAKyqJ,EAAY/rH,EAAMosH,KAGnER,EAAYE,EAAW3qJ,GAAQ,GAE3B6+B,GAAQ8rH,EAAUrB,UACrBP,EAAU,WAAWmC,iBACpBhnJ,EACA26B,EACA8rH,EAAUrB,SACVqB,EAAUpB,gBAGb,CACA,OAAOrlJ,EAAM+jJ,KACd,CAEA,SAAS4C,EACRF,EACAQ,EACAC,EACAp/I,EACA4+I,EACAS,EACAC,GAIA,GAAI3N,EAAQiN,GAAa,CACxB,MAQMz6I,EAAMq6I,EAASG,EAAWC,EAP/BS,GACAF,GACa,IAAbA,EAAarD,QACZ7zI,EAAKk3I,EAA8CI,UAAYv/I,GAC7Dq/I,EAAUpgG,OAAOj/C,QACjB,GAMJ,GAHAmI,EAAIi3I,EAAcp/I,EAAMmE,IAGpBwtI,EAAQxtI,GAEL,OADNw6I,EAAUV,gBAAiB,CAE7B,MAAWqB,GACVF,EAAap1I,IAAI40I,GAGlB,GAAIlM,EAAYkM,KAAgBjC,EAASiC,GAAa,CACrD,IAAKD,EAAUX,OAAOwB,aAAeb,EAAUT,mBAAqB,EAMnE,OAEDM,EAASG,EAAWC,GAKjBO,GAAgBA,EAAYL,OAAOjB,SACrB,kBAAT79I,IACPxM,OAAOiP,UAAU8rE,qBAAqBzqE,KAAKs7I,EAAcp/I,IAEzDy+I,EAAYE,EAAWC,EACzB,CACD,CAEA,SAASH,EAAYrB,EAAmBzhJ,GAA0B,IAAd+gJ,EAAAztJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,IAE9CmuJ,EAAMS,SAAWT,EAAMY,OAAOwB,aAAepC,EAAMa,gBACvDxB,EAAO9gJ,EAAO+gJ,EAEhB,CC/DO,IAAM+C,EAAwC,CACpDvuJ,GAAAA,CAAIgH,EAAO8H,GACV,GAAIA,IAAS07I,EAAa,OAAOxjJ,EAEjC,MAAM6H,EAASi8I,EAAO9jJ,GACtB,IAAK+P,EAAIlI,EAAQC,GAEhB,OAyIH,SAA2B9H,EAAmB6H,EAAaC,GAC1D,MAAMu8I,EAAOmD,EAAuB3/I,EAAQC,GAC5C,OAAOu8I,EACJ,UAAWA,EACVA,EAAK5gJ,MAGL4gJ,EAAKrrJ,KAAK4S,KAAK5L,EAAMynJ,aACtB,CACJ,CAlJUC,CAAkB1nJ,EAAO6H,EAAQC,GAEzC,MAAMrE,EAAQoE,EAAOC,GACrB,OAAI9H,EAAM6mJ,aAAerM,EAAY/2I,GAC7BA,EAIJA,IAAU8hC,EAAKvlC,EAAMgkJ,MAAOl8I,IAC/B6/I,EAAY3nJ,GACJA,EAAM+jJ,MAAOj8I,GAAe8/I,EAAYnkJ,EAAOzD,IAEjDyD,CACR,EACAsM,IAAG,CAAC/P,EAAO8H,IACHA,KAAQg8I,EAAO9jJ,GAEvB2jJ,QAAQ3jJ,GACAuoG,QAAQo7C,QAAQG,EAAO9jJ,IAE/BiQ,GAAAA,CACCjQ,EACA8H,EACArE,GAEA,MAAM4gJ,EAAOmD,EAAuB1D,EAAO9jJ,GAAQ8H,GACnD,GAAIu8I,GAAMp0I,IAIT,OADAo0I,EAAKp0I,IAAIrE,KAAK5L,EAAMynJ,OAAQhkJ,IACrB,EAER,IAAKzD,EAAMqmJ,UAAW,CAGrB,MAAMwB,EAAUtiH,EAAKu+G,EAAO9jJ,GAAQ8H,GAE9B1G,EAAiCymJ,IAAUrE,GACjD,GAAIpiJ,GAAgBA,EAAa4iJ,QAAUvgJ,EAG1C,OAFAzD,EAAM+jJ,MAAOj8I,GAAQrE,EACrBzD,EAAMqnJ,UAAUv/I,IAAQ,GACjB,EAER,KJjCgBk+G,EIiCTviH,MJjCiBqrH,EIiCV+4B,GJ9BF,IAAN7hC,GAAW,EAAIA,IAAM,EAAI8I,EAEzB9I,IAAMA,GAAK8I,IAAMA,UI4Bc,IAAVrrH,GAAuBsM,EAAI/P,EAAMgkJ,MAAOl8I,IAClE,OAAO,EACR6/I,EAAY3nJ,GACZ8nJ,EAAY9nJ,EACb,CJrCK,IAAYgmH,EAAQ8I,EIuCzB,OACE9uH,EAAM+jJ,MAAOj8I,KAAUrE,SAEZ,IAAVA,GAAuBqE,KAAQ9H,EAAM+jJ,QAEtCzgI,OAAO6P,MAAM1vB,IAAU6f,OAAO6P,MAAMnzB,EAAM+jJ,MAAOj8I,MAKnD9H,EAAM+jJ,MAAOj8I,GAAQrE,EACrBzD,EAAMqnJ,UAAUv/I,IAAQ,IAJhB,CAMT,EACAigJ,eAAc,CAAC/nJ,EAAO8H,UAEW,IAA5By9B,EAAKvlC,EAAMgkJ,MAAOl8I,IAAuBA,KAAQ9H,EAAMgkJ,OAC1DhkJ,EAAMqnJ,UAAUv/I,IAAQ,EACxB6/I,EAAY3nJ,GACZ8nJ,EAAY9nJ,WAGLA,EAAMqnJ,UAAUv/I,GAEpB9H,EAAM+jJ,cACF/jJ,EAAM+jJ,MAAMj8I,IAEb,GAIR0hG,wBAAAA,CAAyBxpG,EAAO8H,GAC/B,MAAMkgJ,EAAQlE,EAAO9jJ,GACfqkJ,EAAO97C,QAAQiB,yBAAyBw+C,EAAOlgJ,GACrD,OAAKu8I,EACE,CACNC,UAAU,EACV76C,aAAoB,IAANzpG,EAAM4jJ,OAAqC,WAAT97I,EAChD4hG,WAAY26C,EAAK36C,WACjBjmG,MAAOukJ,EAAMlgJ,IALIu8I,CAOnB,EACA1tE,cAAAA,GACC8sE,EAAI,GACL,EACAttE,eAAen2E,GACPm2E,EAAen2E,EAAMgkJ,OAE7B15I,cAAAA,GACCm5I,EAAI,GACL,GAOKwE,EAA8C,CAAC,EAyBrD,SAAS1iH,EAAKk7G,EAAgB34I,GAC7B,MAAM9H,EAAQygJ,EAAM+C,GAEpB,OADexjJ,EAAQ8jJ,EAAO9jJ,GAASygJ,GACzB34I,EACf,CAaA,SAAS0/I,EACR3/I,EACAC,GAGA,KAAMA,KAAQD,GAAS,OACvB,IAAIuxE,EAAQjD,EAAetuE,GAC3B,KAAOuxE,GAAO,CACb,MAAMirE,EAAO/oJ,OAAOkuG,yBAAyBpwB,EAAOtxE,GACpD,GAAIu8I,EAAM,OAAOA,EACjBjrE,EAAQjD,EAAeiD,EACxB,CAED,CAEO,SAAS0uE,EAAY9nJ,GACtBA,EAAMqmJ,YACVrmJ,EAAMqmJ,WAAY,EACdrmJ,EAAM2lJ,SACTmC,EAAY9nJ,EAAM2lJ,SAGrB,CAEO,SAASgC,EAAY3nJ,GAKtBA,EAAM+jJ,QACV/jJ,EAAM+jJ,MAAQE,EACbjkJ,EAAMgkJ,MACNhkJ,EAAM4mJ,OAAOd,OAAOoC,uBAGvB,CA5EA5jI,EAAKijI,GAAa,CAACtrJ,EAAK8P,KAEvBk8I,EAAWhsJ,GAAO,WAEjB,OADAlF,UAAU,GAAKA,UAAU,GAAG,GACrBgV,EAAGwK,MAAMzR,KAAM/N,UACvB,CAAC,IAEFkxJ,EAAWF,eAAiB,SAAS/nJ,EAAO8H,GAI3C,OAAOmgJ,EAAWh4I,IAAKrE,KAAK9G,KAAM9E,EAAO8H,OAAM,EAChD,EACAmgJ,EAAWh4I,IAAM,SAASjQ,EAAO8H,EAAMrE,GAOtC,OAAO8jJ,EAAYt3I,IAAKrE,KAAK9G,KAAM9E,EAAM,GAAI8H,EAAMrE,EAAOzD,EAAM,GACjE,ECtCO,SAAS4nJ,EACfnkJ,EACAmrD,GAGA,MAAM6xF,EAAiB/vE,EAAMjtE,GAC1BohJ,EAAU,UAAUsD,UAAU1kJ,EAAOmrD,GACrCkiB,EAAMrtE,GACNohJ,EAAU,UAAUuD,UAAU3kJ,EAAOmrD,GD3JlC,SACNgT,EACAhT,GAEA,MAAMvpD,EAAUD,MAAMC,QAAQu8D,GACxB5hE,EAAoB,CACzB4jJ,MAAOv+I,EAAA,IAEPuhJ,OAAQh4F,EAASA,EAAOg4F,OAAS5B,IAEjCqB,WAAW,EAEXQ,YAAY,EAEZQ,UAAW,CAAC,EAEZ1B,QAAS/2F,EAETo1F,MAAOpiF,EAEP6lF,OAAQ,KAER1D,MAAO,KAEPkC,QAAS,KACToC,WAAW,GASZ,IAAIzgJ,EAAY5H,EACZsoJ,EAA2Cf,EAC3CliJ,IACHuC,EAAS,CAAC5H,GACVsoJ,EAAQL,GAGT,MAAM,OAACM,EAAA,MAAQv2H,GAASxa,MAAMgxI,UAAU5gJ,EAAQ0gJ,GAGhD,OAFAtoJ,EAAMynJ,OAASz1H,EACfhyB,EAAMimJ,QAAUsC,EACTv2H,CACR,CC+GIy2H,CAAiBhlJ,EAAOmrD,GAI3B,OAFcA,EAASA,EAAOg4F,OAAS5B,KACjCS,QAAQ9pJ,KAAK8kJ,GACZA,CACR,CCtMO,SAASx/I,EAAQwC,GAEvB,OADKg2I,EAAQh2I,IAAQggJ,EAAI,IAClBiF,EAAYjlJ,EACpB,CAEA,SAASilJ,EAAYjlJ,GACpB,IAAK+2I,EAAY/2I,IAAUghJ,EAAShhJ,GAAQ,OAAOA,EACnD,MAAMzD,EAAgCyD,EAAM+/I,GAC5C,IAAI39G,EACJ,GAAI7lC,EAAO,CACV,IAAKA,EAAMqmJ,UAAW,OAAOrmJ,EAAMgkJ,MAEnChkJ,EAAM6mJ,YAAa,EACnBhhH,EAAOo+G,EAAYxgJ,EAAOzD,EAAM4mJ,OAAOd,OAAOoC,sBAC/C,MACCriH,EAAOo+G,EAAYxgJ,GAAO,GAS3B,OANA6gB,EAAKuhB,GAAM,CAAC5pC,EAAKyqJ,KAChBz2I,EAAI41B,EAAM5pC,EAAKysJ,EAAYhC,GAAY,IAEpC1mJ,IACHA,EAAM6mJ,YAAa,GAEbhhH,CACR,CChBA,IAAM8iH,EAAQ,IFUP,MAINzhJ,WAAAA,CAAY1N,GAAiE,IAAA+xB,EAAA,KAH7E,KAAA+7H,aAAuB,EACvB,KAAAY,uBAAiC,EA4BjC,KAAAU,QAAoB,CAAChnF,EAAWinF,EAAc1D,KAE7C,GAAoB,oBAATvjF,GAAyC,oBAAXinF,EAAuB,CAC/D,MAAMC,EAAcD,EACpBA,EAASjnF,EAET,MAAM35D,EAAOnD,KACb,OAAO,WAIL,IAFDikJ,EAAAhyJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAO+xJ,EAAA,QAAAx0I,EAAAvd,UAAAC,OACJ0c,EAAA,IAAAtO,MAAAkP,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAAb,EAAAa,EAAA,GAAAxd,UAAAwd,GAEH,OAAOtM,EAAK2gJ,QAAQG,GAAOtI,GAAmBoI,EAAOj9I,KAAK9G,KAAM27I,KAAU/sI,IAC3E,CACD,CAMA,IAAI5X,EAGJ,GAPsB,oBAAX+sJ,GAAuBpF,EAAI,QAChB,IAAlB0B,GAAwD,oBAAlBA,GACzC1B,EAAI,GAKDjJ,EAAY54E,GAAO,CACtB,MAAMsjF,EAAQU,EAAW9gJ,MACnBktB,EAAQ41H,EAAYhmF,OAAM,GAChC,IAAIonF,GAAW,EACf,IACCltJ,EAAS+sJ,EAAO72H,GAChBg3H,GAAW,CACZ,CAAE,QAEGA,EAAUzD,EAAYL,GACrBM,EAAWN,EACjB,CAEA,OADAD,EAAkBC,EAAOC,GAClBgB,EAAcrqJ,EAAQopJ,EAC9B,CAAO,IAAKtjF,GAAwB,kBAATA,EAAmB,CAK7C,GAJA9lE,EAAS+sJ,EAAOjnF,QACD,IAAX9lE,IAAsBA,EAAS8lE,GAC/B9lE,IAAWwnJ,IAASxnJ,OAAS,GAC7BgJ,KAAKwiJ,aAAa/C,EAAOzoJ,GAAQ,GACjCqpJ,EAAe,CAClB,MAAM9gJ,EAAa,GACb4kJ,EAAc,GACpBpE,EAAU,WAAW2B,4BAA4B5kF,EAAM9lE,EAAQuI,EAAG4kJ,GAClE9D,EAAc9gJ,EAAG4kJ,EAClB,CACA,OAAOntJ,CACR,CAAO2nJ,EAAI,EAAQ,EAGpB,KAAAyF,mBAA0C,CAACtnF,EAAWinF,KAErD,GAAoB,oBAATjnF,EACV,OAAO,SAAC5hE,GAAA,QAAAwU,EAAAzd,UAAAC,OAAe0c,EAAA,IAAAtO,MAAAoP,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAAf,EAAAe,EAAA,GAAA1d,UAAA0d,GAAA,OACtB8W,EAAK29H,mBAAmBlpJ,GAAQygJ,GAAe7+E,EAAK6+E,KAAU/sI,IAAK,EAGrE,IAAIy1I,EAAkBC,EAKtB,MAAO,CAJQtkJ,KAAK8jJ,QAAQhnF,EAAMinF,GAAQ,CAACxkJ,EAAY4kJ,KACtDE,EAAU9kJ,EACV+kJ,EAAiBH,CAAA,IAEFE,EAAUC,EAAgB,EAzFR,mBAAvB5vJ,GAAQ6vJ,YAClBvkJ,KAAKwkJ,cAAc9vJ,EAAQ6vJ,YACgB,mBAAjC7vJ,GAAQ+vJ,sBAClBzkJ,KAAK0kJ,wBAAwBhwJ,EAAQ+vJ,qBACvC,CAwFAE,WAAAA,CAAiC7nF,GAC3B44E,EAAY54E,IAAO6hF,EAAI,GACxBhK,EAAQ73E,KAAOA,EAAO3gE,EAAQ2gE,IAClC,MAAMsjF,EAAQU,EAAW9gJ,MACnBktB,EAAQ41H,EAAYhmF,OAAM,GAGhC,OAFA5vC,EAAMwxH,GAAa6E,WAAY,EAC/B7C,EAAWN,GACJlzH,CACR,CAEA03H,WAAAA,CACCjJ,EACA0E,GAEA,MAAMnlJ,EAAoBygJ,GAAUA,EAAc+C,GAC7CxjJ,GAAUA,EAAMqoJ,WAAW5E,EAAI,GACpC,MAAOmD,OAAQ1B,GAASllJ,EAExB,OADAilJ,EAAkBC,EAAOC,GAClBgB,OAAc,EAAWjB,EACjC,CAOAoE,aAAAA,CAAc7lJ,GACbqB,KAAKwiJ,YAAc7jJ,CACpB,CAOA+lJ,uBAAAA,CAAwB/lJ,GACvBqB,KAAKojJ,sBAAwBzkJ,CAC9B,CAEAkmJ,YAAAA,CAAkC/nF,EAASunF,GAG1C,IAAI3xJ,EACJ,IAAKA,EAAI2xJ,EAAQnyJ,OAAS,EAAGQ,GAAK,EAAGA,IAAK,CACzC,MAAMoyJ,EAAQT,EAAQ3xJ,GACtB,GAA0B,IAAtBoyJ,EAAMjvH,KAAK3jC,QAA6B,YAAb4yJ,EAAM17F,GAAkB,CACtD0T,EAAOgoF,EAAMnmJ,MACb,KACD,CACD,CAGIjM,GAAK,IACR2xJ,EAAUA,EAAQ1tJ,MAAMjE,EAAI,IAG7B,MAAMqyJ,EAAmBhF,EAAU,WAAWiF,cAC9C,OAAIrQ,EAAQ73E,GAEJioF,EAAiBjoF,EAAMunF,GAGxBrkJ,KAAK8jJ,QAAQhnF,GAAO6+E,GAC1BoJ,EAAiBpJ,EAAO0I,IAE1B,GEvJYP,EAAoBD,EAAMC,QAMgBD,EAAMO,mBAAmBlmI,KAC/E2lI,GAQ4BA,EAAMW,cAActmI,KAAK2lI,GAOfA,EAAMa,wBAAwBxmI,KAAK2lI,GAO9CA,EAAMgB,aAAa3mI,KAAK2lI,GAMzBA,EAAMc,YAAYzmI,KAAK2lI,GAUvBA,EAAMe,YAAY1mI,KAAK2lI,wGCtFrCnhB,EAGgCuiB,ECSvCC,EAAahiF,OAAOk/B,IAAI,uBACxB+iD,EAMkB,qBAAfC,WACHA,WAAA,CAC6F,EAGnG,SAASC,IACP,IAAK3iB,EAAM0J,cAAe,MAAO,CAAC,EAElC,MAAMkZ,EAAcH,EAAAD,KAAAC,EAAAD,GAAmB,IAAIx6I,KAI3C,IAAI66I,EAAcD,EAAWpxJ,IAAIwuI,EAAM0J,eAUvC,OATKmZ,IACHA,EAAc7iB,EAAM0J,cAClB,MAKFkZ,EAAWn6I,IAAIu3H,EAAM0J,cAAemZ,IAE/BA,CACT,CAEO,IAAMC,EAAkCH,IC5ClCI,EAAiBA,KAC5B,MAAM,IAAIrmJ,MAAM,wBAAwB,ECOnC,SAASsmJ,IAAoD,IAA7BjxH,EAAAxiC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAUuzJ,EAC/C,OAAO,WASL,OARqB9iB,EAAM7Q,WAAWp9F,EASxC,CACF,CAkBO,IAAMkxH,EAAgCD,IC+EzCtX,EAAmCqX,EAKjCG,EAA+BA,CAAC1tJ,EAAGC,IAAMD,IAAMC,EAQ9C,SAAS0tJ,IAKD,IAJbpxH,EAAAxiC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAGYuzJ,EAEZ,MAAMM,EACJrxH,IAAY+wH,EACRG,EACAD,EAAuBjxH,GAEvBsxH,EAAc,SAClBjV,GAIa,IAHbkV,EAAA/zJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAE4C,CAAC,EAE7C,MAAM,WAAEg0J,EAAaL,EAAA,cAAalV,EAAgB,CAAC,GAClB,oBAAxBsV,EACH,CAAEC,WAAYD,GACdA,EAeN,MAAM,MACJtyI,EAAA,aACAwyI,EAAA,eACAC,EAAA,eACAC,EAAA,sBACAC,GACEP,IAIEpR,GAFWhS,EAAMtQ,QAAO,GAENsQ,EAAM9Q,YAC5B,CACE,CAACkf,EAAS1+I,MAAM8I,GACG41I,EAAS51I,IA+D5B41I,EAAS1+I,MACX,CAAC0+I,EAAUsV,EAAgB1V,EAAc0V,kBAGrCE,EAAgBlY,EACpB8X,EAAaK,aACb7yI,EAAMpW,SACN6oJ,GAAkBzyI,EAAMpW,SACxBo3I,EACAuR,GAKF,OAFAvjB,EAAMpQ,cAAcg0B,GAEbA,CACT,EAMA,OAJA9vJ,OAAOugB,OAAOgvI,EAAa,CACzB3U,UAAWA,IAAM2U,IAGZA,CACT,CAyBO,IAAMS,EAA4BX,IC5RnCY,EAAqBvjF,OAAOk/B,IAAI,iBAChCskD,EAAoBxjF,OAAOk/B,IAAI,gBAC/BukD,EAAsBzjF,OAAOk/B,IAAI,kBACjCwkD,EAAyB1jF,OAAOk/B,IAAI,qBACpCykD,EAAsB3jF,OAAOk/B,IAAI,kBACjC0kD,EAAsB5jF,OAAOk/B,IAAI,kBACjC2kD,EAAqB7jF,OAAOk/B,IAAI,iBAChC4kD,EAA4B9jF,OAAOk/B,IAAI,wBACvC6kD,EAAyB/jF,OAAOk/B,IAAI,qBACpC8kD,EAAsBhkF,OAAOk/B,IAAI,kBACjC+kD,EAA2BjkF,OAAOk/B,IAAI,uBACtCglD,EAAkBlkF,OAAOk/B,IAAI,cAC7BilD,EAAkBnkF,OAAOk/B,IAAI,cAItBklD,GAHgBpkF,OAAOk/B,IAAI,mBACTl/B,OAAOk/B,IAAI,0BAEhB6kD,GACbM,EAAOH,EAsCpB,SAASI,EAAOl1I,GACd,GAAsB,kBAAXA,GAAkC,OAAXA,EAAiB,CACjD,MAAM0xF,EAAW1xF,EAAO0xF,SAExB,OAAQA,GACN,KAAKyiD,EAAoB,CACvB,MAAM7nJ,EAAO0T,EAAO1T,KAEpB,OAAQA,GACN,KAAK+nJ,EACL,KAAKE,EACL,KAAKD,EACL,KAAKM,EACL,KAAKC,EACH,OAAOvoJ,EAET,QAAS,CACP,MAAM6oJ,EAAe7oJ,GAAQA,EAAKolG,SAElC,OAAQyjD,GACN,KAAKT,EACL,KAAKD,EACL,KAAKE,EACL,KAAKI,EACL,KAAKD,EACL,KAAKN,EACH,OAAOW,EAET,QACE,OAAOzjD,EAEb,EAEJ,CAEA,KAAK0iD,EACH,OAAO1iD,EAGb,CAGF,CCtCO,SAAS0jD,EAOdC,EACAC,EACAC,EACAxqJ,EAAA+P,GAMA,IAEIlS,EACA4sJ,EACAC,EACAC,EACAC,GAXJ,eACEC,EAAA,iBACAC,EAAA,mBACAC,GACFh7I,EAEIi7I,GAAoB,EAiDxB,SAASC,EAAsBtU,EAAkBuU,GAC/C,MAAMC,GAAgBL,EAAiBI,EAAcT,GAC/CW,GAAgBP,EACpBlU,EACA94I,EACAqtJ,EACAT,GAKF,OAHA5sJ,EAAQ84I,EACR8T,EAAWS,EAEPC,GAAgBC,GA1CpBV,EAAaJ,EAAgBzsJ,EAAO4sJ,GAEhCF,EAAmBc,oBACrBV,EAAgBJ,EAAmBvqJ,EAAUyqJ,IAE/CG,EAAcJ,EAAWE,EAAYC,EAAeF,GAC7CG,GAqCHO,GAjCAb,EAAgBe,oBAClBX,EAAaJ,EAAgBzsJ,EAAO4sJ,IAElCF,EAAmBc,oBACrBV,EAAgBJ,EAAmBvqJ,EAAUyqJ,IAE/CG,EAAcJ,EAAWE,EAAYC,EAAeF,GAC7CG,GA2BHQ,EAxBN,WACE,MAAME,EAAiBhB,EAAgBzsJ,EAAO4sJ,GACxCc,GAAqBR,EAAmBO,EAAgBZ,GAM9D,OALAA,EAAaY,EAETC,IACFX,EAAcJ,EAAWE,EAAYC,EAAeF,IAE/CG,CACT,CAe2BY,GAClBZ,CACT,CAEA,OAAO,SACLjU,EACAuU,GAEA,OAAOF,EACHC,EAAsBtU,EAAWuU,IA/DrCrtJ,EAgEoB84I,EA/DpB8T,EA+D+BS,EA9D/BR,EAAaJ,EAAgBzsJ,EAAO4sJ,GACpCE,EAAgBJ,EAAmBvqJ,EAAUyqJ,GAC7CG,EAAcJ,EAAWE,EAAYC,EAAeF,GACpDO,GAAoB,EACbJ,EA2DT,CACF,CC7IO,SAASa,EAMdC,GAQA,OAAO,SAA8B1rJ,GACnC,MAAMilF,EAAWymE,EAAY1rJ,GAE7B,SAAS2rJ,IACP,OAAO1mE,CACT,CAEA,OADA0mE,EAAiBN,mBAAoB,EAC9BM,CACT,CACF,CAUO,SAASC,EAAqBC,GACnC,OAAOA,EAAWR,kBACdS,QAAQD,EAAWR,mBACG,IAAtBQ,EAAWh3J,MACjB,CAcO,SAASk3J,EACdF,EACA1iE,GAEA,OAAO,SACLnpF,EAAAg+I,GAEA,IADA,YAAEz3C,GAAYy3C,EAEd,MAAMnuH,EAAQ,SACZm8H,EACAvB,GAEA,OAAO56H,EAAMw7H,kBACTx7H,EAAMg8H,WAAWG,EAAiBvB,GAClC56H,EAAMg8H,WAAWG,OAAiB,EACxC,EAyBA,OAtBAn8H,EAAMw7H,mBAAoB,EAE1Bx7H,EAAMg8H,WAAa,SACjBG,EACAvB,GAEA56H,EAAMg8H,WAAaA,EACnBh8H,EAAMw7H,kBAAoBO,EAAqBC,GAC/C,IAAI/+I,EAAQ+iB,EAAMm8H,EAAiBvB,GAWnC,MATqB,oBAAV39I,IACT+iB,EAAMg8H,WAAa/+I,EACnB+iB,EAAMw7H,kBAAoBO,EAAqB9+I,GAC/CA,EAAQ+iB,EAAMm8H,EAAiBvB,IAM1B39I,CACT,EAEO+iB,CACT,CACF,CC3GO,SAASo8H,EAAwBzrI,EAAczrB,GACpD,MAAO,CACLiL,EACAqO,KAEA,MAAM,IAAItM,MACR,gCAAgCye,SAAWzrB,wCACzCsZ,EAAQ69I,wBAEX,CAEL,CCPO,SAASC,EAMdzB,EACAC,EACAF,GAGA,MAAO,IAAKA,KAAaC,KAAeC,EAC1C,CCjBO,SAASyB,EAAiB7vJ,GAC/BA,GACF,CCwFA,IAAM8vJ,EAAgB,CACpBnT,MAAAA,GAAU,EACVriJ,IAAKA,IAAM,IAGN,SAASy1J,EAAmBj2I,EAAYk2I,GAC7C,IAAIpW,EACAh/G,EAAgCk1H,EAGhCG,EAAsB,EAGtBC,GAAiB,EAsBrB,SAASC,IACH7D,EAAa8D,eACf9D,EAAa8D,eAEjB,CAMA,SAASC,IACPJ,IACKrW,IACHA,EAAcoW,EACVA,EAAUrD,aAAawD,GACvBr2I,EAAMq/H,UAAUgX,GAEpBv1H,EAjIN,WACE,IAAI0qC,EAAyB,KACzB1T,EAAwB,KAE5B,MAAO,CACL/Y,KAAAA,GACEysB,EAAQ,KACR1T,EAAO,IACT,EAEA+qF,MAAAA,GACEkT,GAAM,KACJ,IAAI7nI,EAAWs9C,EACf,KAAOt9C,GACLA,EAAShoB,WACTgoB,EAAWA,EAASymB,IACtB,GAEJ,EAEAn0C,GAAAA,GACE,MAAMsgC,EAAwB,GAC9B,IAAI5S,EAAWs9C,EACf,KAAOt9C,GACL4S,EAAU39B,KAAK+qB,GACfA,EAAWA,EAASymB,KAEtB,OAAO7T,CACT,EAEAu+G,SAAAA,CAAUn5I,GACR,IAAIo5I,GAAe,EAEnB,MAAMpxH,EAAsB4pC,EAAO,CACjC5xD,WACAyuC,KAAM,KACN6hH,KAAM1+F,GASR,OANI5pC,EAASsoI,KACXtoI,EAASsoI,KAAK7hH,KAAOzmB,EAErBs9C,EAAQt9C,EAGH,WACAoxH,GAA0B,OAAV9zE,IACrB8zE,GAAe,EAEXpxH,EAASymB,KACXzmB,EAASymB,KAAK6hH,KAAOtoI,EAASsoI,KAE9B1+F,EAAO5pC,EAASsoI,KAEdtoI,EAASsoI,KACXtoI,EAASsoI,KAAK7hH,KAAOzmB,EAASymB,KAE9B62B,EAAQt9C,EAASymB,KAErB,CACF,EAEJ,CAmEkB8hH,GAEhB,CAEA,SAASC,IACPP,IACIrW,GAAuC,IAAxBqW,IACjBrW,IACAA,OAAc,EACdh/G,EAAUie,QACVje,EAAYk1H,EAEhB,CAgBA,MAAMxD,EAA6B,CACjCK,aAlEF,SAAsB3kI,GACpBqoI,IAEA,MAAMI,EAAkB71H,EAAUu+G,UAAUnxH,GAG5C,IAAI0hC,GAAU,EACd,MAAO,KACAA,IACHA,GAAU,EACV+mG,IACAD,IACF,CAEJ,EAqDEE,iBAnDF,WACE91H,EAAU+hH,QACZ,EAkDEwT,sBACA/W,aA3CF,WACE,OAAO8W,CACT,EA0CEG,aAnBF,WACOH,IACHA,GAAiB,EACjBG,IAEJ,EAeEG,eAbF,WACMN,IACFA,GAAiB,EACjBM,IAEJ,EASEG,aAAcA,IAAM/1H,GAGtB,OAAO0xH,CACT,CC1KO,IAMMrgB,IALO,qBAAX9xI,QACoB,qBAApBA,OAAOxB,UAC2B,qBAAlCwB,OAAOxB,SAAS2L,eAIrBwkI,EAAMzQ,gBACNyQ,EAAM5Q,UCpBV,SAAS5mB,EAAGgW,EAAY8I,GACtB,OAAI9I,IAAM8I,EACK,IAAN9I,GAAiB,IAAN8I,GAAW,EAAI9I,IAAM,EAAI8I,EAEpC9I,IAAMA,GAAK8I,IAAMA,CAE5B,CAEe,SAARwgC,EAA8BC,EAAWC,GAC9C,GAAIx/C,EAAGu/C,EAAMC,GAAO,OAAO,EAE3B,GACkB,kBAATD,GACE,OAATA,GACgB,kBAATC,GACE,OAATA,EAEA,OAAO,EAGT,MAAMC,EAAQn0J,OAAOC,KAAKg0J,GACpBG,EAAQp0J,OAAOC,KAAKi0J,GAE1B,GAAIC,EAAMz4J,SAAW04J,EAAM14J,OAAQ,OAAO,EAE1C,IAAK,IAAIQ,EAAI,EAAGA,EAAIi4J,EAAMz4J,OAAQQ,IAChC,IACG8D,OAAOiP,UAAUxC,eAAe6D,KAAK4jJ,EAAMC,EAAMj4J,MACjDw4G,EAAGu/C,EAAKE,EAAMj4J,IAAKg4J,EAAKC,EAAMj4J,KAE/B,OAAO,EAIX,OAAO,CACT,CCxBA,IAAMm4J,EAAgB,CACpBtmC,mBAAmB,EACnB4G,aAAa,EACbhH,cAAc,EACdqD,cAAc,EACd5jB,aAAa,EACbknD,iBAAiB,EACjBx3B,0BAA0B,EAC1B9H,0BAA0B,EAC1Bu/B,QAAQ,EACRC,WAAW,EACXpsJ,MAAM,GAGFqsJ,EAAgB,CACpB74J,MAAM,EACNF,QAAQ,EACRuT,WAAW,EACXylJ,QAAQ,EACRC,QAAQ,EACRl5J,WAAW,EACXg2F,OAAO,GAWHmjE,EAAe,CACnBpnD,UAAU,EACVhlE,SAAS,EACTwoF,cAAc,EACd5jB,aAAa,EACbonD,WAAW,EACXpsJ,MAAM,GAGFysJ,EAAe,CACnB,CAAC/D,GAlByB,CAC1BtjD,UAAU,EACVF,QAAQ,EACR0jB,cAAc,EACd5jB,aAAa,EACbonD,WAAW,GAcX,CAACzD,GAAO6D,GAGV,SAASE,EAAW9gJ,GAElB,OToDOg9I,ESpDIh9I,KToDe48I,ESnDjBgE,EAIFC,EAAa7gJ,EAAoB,WAAMqgJ,CAChD,CAkBA,IAAMh5E,EAAiBr7E,OAAOq7E,eACxB05E,EAAsB/0J,OAAO+0J,oBAC7Bj5E,EAAwB97E,OAAO87E,sBAC/BoyB,EAA2BluG,OAAOkuG,yBAClCrzB,GAAiB76E,OAAO66E,eACxBm6E,GAAkBh1J,OAAOiP,UAEhB,SAARgmJ,GAMLC,EAAoBC,GACpB,GAA+B,kBAApBA,EAA8B,CAGvC,GAAIH,GAAiB,CACnB,MAAMI,EAAqBv6E,GAAes6E,GACtCC,GAAsBA,IAAuBJ,IAC/CC,GAAqBC,EAAiBE,EAE1C,CAEA,IAAIn1J,EAA4B80J,EAAoBI,GAEhDr5E,IACF77E,EAAOA,EAAKwrD,OAAOqwB,EAAsBq5E,KAG3C,MAAME,EAAgBP,EAAWI,GAC3BI,EAAgBR,EAAWK,GAEjC,IAAK,IAAIj5J,EAAI,EAAGA,EAAI+D,EAAKvE,SAAUQ,EAAG,CACpC,MAAMyE,EAAMV,EAAK/D,GACjB,IACGu4J,EAAc9zJ,MACb20J,IAAiBA,EAAc30J,OAC/B00J,IAAiBA,EAAc10J,IACjC,CACA,MAAM40J,EAAarnD,EAAyBinD,EAAiBx0J,GAC7D,IAEE06E,EAAe65E,EAAiBv0J,EAAK40J,EACvC,CAAE,MAAOrpJ,GAET,CACF,CACF,CACF,CAEA,OAAOgpJ,CACT,CC3FA,IAAIh5B,GAAuB+yB,EAOrBuG,GAAwB,CAAC,KAAM,MA2BrC,SAASC,GACPC,EACAC,EACAC,EACAC,EAEAC,EACAhC,GAGA4B,EAAiB/vJ,QAAUkwJ,EAC3BD,EAAkBjwJ,SAAU,EAGxBmwJ,EAA0BnwJ,UAC5BmwJ,EAA0BnwJ,QAAU,KACpCmuJ,IAEJ,CAiHA,SAASiC,GAAYr0J,EAAYC,GAC/B,OAAOD,IAAMC,CACf,CA+lBA,IAAOq0J,GAtXP,SAOE7E,EACAC,EACAC,GAgBS,IAfT,KAGE4E,EAAA,eACAvE,EAAiBqE,GAAA,iBACjBpE,EAAmBqC,EAAA,mBACnBpC,EAAqBoC,EAAA,oBACrBkC,EAAsBlC,EAAA,WAGtB5d,GAAa,EAAK,QAGlBn4G,EAAU+wH,GACZvzJ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAwD,CAAC,EAWzD,MAAM06J,EAAUl4H,EAEVm4H,EC7dD,SACLjF,GAEA,OAAQA,EAEuB,oBAApBA,EAEPyB,EAAmBzB,GACnB2B,EAAwB3B,EAAiB,mBAJzCmB,GAAuB,KAAM,CAAG,IAKtC,CDod8B+D,CAAuBlF,GAC7CmF,EE5dD,SACLlF,GAIA,OAAOA,GAAoD,kBAAvBA,EAChCkB,GAAwBzrJ,GCVf,SACbg9I,EACAh9I,GAEA,MAAM0vJ,EAA+C,CAAC,EAEtD,IAAK,MAAM51J,KAAOkjJ,EAAgB,CAChC,MAAMpF,EAAgBoF,EAAeljJ,GACR,oBAAlB89I,IACT8X,EAAoB51J,GAAO,kBAAakG,EAAS43I,KAAchjJ,WAAQ,EAE3E,CACA,OAAO86J,CACT,CDDQC,CAAmBpF,EAAoBvqJ,KAExCuqJ,EAI6B,oBAAvBA,EAEPwB,EAAmBxB,GACnB0B,EAAwB1B,EAAoB,sBAN5CkB,GAAwBzrJ,IAAA,CACtBA,cAMR,CF0ciC4vJ,CAA0BrF,GACnDsF,ENnaD,SAMLrF,GAEA,OAAQA,EAEkB,oBAAfA,EAtDN,SAMLA,GAQA,OAAO,SACLxqJ,EAAAwlI,GAEA,IAEIolB,GAHJ,YAAErkD,EAAA,oBAAa8oD,GAAoB7pB,EAE/BsqB,GAAa,EAGjB,OAAO,SACLpF,EACAC,EACAF,GAEA,MAAMsF,EAAkBvF,EAAWE,EAAYC,EAAeF,GAa9D,OAXIqF,EACGT,EAAoBU,EAAiBnF,KACxCA,EAAcmF,IAEhBD,GAAa,EACblF,EAAcmF,GAMTnF,CACT,CACF,CACF,CAaMoF,CAAmBxF,GACnByB,EAAwBzB,EAAY,cAHpC,IAAM2B,CAIZ,CMsZyB8D,CAAkBzF,GAEnC0F,EAA2BpE,QAAQxB,GA0UzC,OAvUE6F,IAeA,MAAMjE,EACJiE,EAAiB5pD,aAAe4pD,EAAiBp7J,MAAQ,YAErDwxG,EAAc,WAAW2lD,KAEzBkE,EAMF,CACFF,2BACA3pD,cACA2lD,uBACAiE,mBAEAZ,sBAEAE,yBACAI,iBACAhF,iBACAE,qBACAD,mBACAuE,uBAGF,SAASgB,EACPvjJ,GAEA,MAAOwjJ,EAAcC,EAAwBvB,GAC3C3pB,EAAMxQ,SAAQ,KAIZ,MAAQ07B,uBAAAC,KAA2BC,GAAiB3jJ,EACpD,MAAO,CAACA,EAAMsqB,QAASo5H,EAAwBC,EAAa,GAC3D,CAAC3jJ,IAEA4jJ,EAA0CrrB,EAAMxQ,SAAQ,IAGxCy6B,GAgBnB,CAACgB,EAAchB,IAGZqB,EAAetrB,EAAM7Q,WAAWk8B,GAKhCE,EACJ9E,QAAQh/I,EAAMuJ,QACdy1I,QAAQh/I,EAAMuJ,MAAOpW,WACrB6rJ,QAAQh/I,EAAMuJ,MAAOrW,UACjB6wJ,EACJ/E,QAAQ6E,IAAiB7E,QAAQ6E,EAAct6I,OAgBjD,MAAMA,EAAeu6I,EACjB9jJ,EAAMuJ,MACNs6I,EAAct6I,MAEZyyI,EAAiB+H,EACnBF,EAAc7H,eACdzyI,EAAMpW,SAEJ6wJ,EAAqBzrB,EAAMxQ,SAAQ,ITzYhC,SAOb70H,EAAAi6D,GAaA,IAZA,oBACEs1F,EAAA,uBACAE,EAAA,eACAI,KACGxhJ,GACL4rD,EAgBA,OAAOowF,EARiBkF,EAAoBvvJ,EAAUqO,GAC3BohJ,EAAuBzvJ,EAAUqO,GACzCwhJ,EAAe7vJ,EAAUqO,GAYOrO,EAAUqO,EAC/D,CSwWe0iJ,CAAuB16I,EAAMrW,SAAUowJ,IAC7C,CAAC/5I,KAEGwyI,EAAcoE,GAAoB5nB,EAAMxQ,SAAQ,KACrD,IAAKq7B,EAA0B,OAAOvB,GAItC,MAAMqC,EAAe1E,EACnBj2I,EACAu6I,OAAwB,EAAYD,EAAc9H,cAO9CoI,EACJD,EAAa/D,iBAAiBpsI,KAAKmwI,GAErC,MAAO,CAACA,EAAcC,EAAiB,GACtC,CAAC56I,EAAOu6I,EAAuBD,IAI5BO,EAAyB7rB,EAAMxQ,SAAQ,IACvC+7B,EAIKD,EAKF,IACFA,EACH9H,iBAED,CAAC+H,EAAuBD,EAAc9H,IAGnCiG,EAAiBzpB,EAAMtQ,SACvB85B,EAAmBxpB,EAAMtQ,OAAOi6B,GAChCC,EAA4B5pB,EAAMtQ,SAClCg6B,EAAoB1pB,EAAMtQ,QAAO,GAEjC7H,GADuBmY,EAAMtQ,QAAO,GACxBsQ,EAAMtQ,QAAO,IAEzBo8B,EAAkC9rB,EAAMtQ,SAE9CyT,GAA0B,KACxBtb,EAAUpuH,SAAU,EACb,KACLouH,EAAUpuH,SAAU,CAAK,IAE1B,IAEH,MAAMsyJ,EAA2B/rB,EAAMxQ,SAAQ,IAC5B4e,IAQbwb,EAA0BnwJ,SAC1BkwJ,IAAiBH,EAAiB/vJ,QAE3BmwJ,EAA0BnwJ,QAO5BgyJ,EAAmBz6I,EAAMpW,WAAY+uJ,IAG7C,CAAC34I,EAAO24I,IAMLqC,EAAoBhsB,EAAMxQ,SAAQ,IACnBy8B,GACZzI,EA7kBf,SACEqH,EACA75I,EACAwyI,EACAiI,EACAjC,EACAC,EACAC,EACA7hC,EACA+hC,EACAhC,EAEAsE,GAGA,IAAKrB,EAA0B,MAAO,OAGtC,IAAIsB,GAAiB,EACjBC,EAAgC,KAGpC,MAAMC,EAAkBA,KACtB,GAAIF,IAAmBtkC,EAAUpuH,QAG/B,OAIF,MAAM6yJ,EAAmBt7I,EAAMpW,WAE/B,IAAI2xJ,EAAetsJ,EACnB,IAGEssJ,EAAgBd,EACda,EACA9C,EAAiB/vJ,QAErB,CAAE,MAAOuG,GACPC,EAAQD,EACRosJ,EAAkBpsJ,CACpB,CAEKC,IACHmsJ,EAAkB,MAIhBG,IAAkB9C,EAAehwJ,QAC9BiwJ,EAAkBjwJ,SACrBmuJ,KAOF6B,EAAehwJ,QAAU8yJ,EACzB3C,EAA0BnwJ,QAAU8yJ,EACpC7C,EAAkBjwJ,SAAU,EAI5ByyJ,IACF,EA0BF,OAtBA1I,EAAa8D,cAAgB+E,EAC7B7I,EAAa+D,eAIb8E,IAE2BG,KAKzB,GAJAL,GAAiB,EACjB3I,EAAakE,iBACblE,EAAa8D,cAAgB,KAEzB8E,EAMF,MAAMA,CACR,CAIJ,CAofiBK,CACL5B,EACA75I,EACAwyI,EAEAiI,EACAjC,EACAC,EACAC,EACA7hC,EACA+hC,EACAhC,EACAqE,GAfO,QAoBV,CAACzI,IAjoBV,IACEkJ,EACAC,EACAlnC,EAyoBI,IAAImnC,EA3oBRF,EAkoBsCnD,GAjoBtCoD,EAioB2D,CACrDnD,EACAC,EACAC,EACAC,EACAC,EACAhC,GApoBNzkB,GAA0B,IAAMupB,KAAcC,IAAalnC,GAyoBvD,IACEmnC,EAAmB58B,GAEjBg8B,EAGAD,EACAtI,EACI,IAAMgI,EAAmBhI,IAAkBkG,GAC3CoC,EAER,CAAE,MAAO54F,GAQP,MAPI24F,EAAgCryJ,UAGhC05D,EACA32D,SAAW,4DAA4DsvJ,EAAgCryJ,QAAQ4kB,aAG7G80C,CACR,CAEAgwE,GAA0B,KACxB2oB,EAAgCryJ,aAAU,EAC1CmwJ,EAA0BnwJ,aAAU,EACpCgwJ,EAAehwJ,QAAUmzJ,CAAA,IAK3B,MAAMC,EAA2B7sB,EAAMxQ,SAAQ,IAG3CwQ,EAAAxkI,cAACsvJ,EAAA,IACK8B,EACJ37F,IAAKi6F,KAGR,CAACA,EAAwBJ,EAAkB8B,IAmB9C,OAfsB5sB,EAAMxQ,SAAQ,IAC9Bq7B,EAKA7qB,EAAAxkI,cAAC6vJ,EAAazjJ,SAAb,CAAsB3L,MAAO4vJ,GAC3BgB,GAKAA,GACN,CAACxB,EAAcwB,EAA0BhB,GAG9C,CAEA,MAOMiB,EAPW9sB,EAAM1hE,KAAK0sF,GAc5B,GAHA8B,EAAQhC,iBAAmBA,EAC3BgC,EAAQ5rD,YAAc8pD,EAAgB9pD,YAAcA,EAEhDgpC,EAAY,CACd,MAQM6iB,EARa/sB,EAAMkK,YAAW,SAClCziI,EACAwpD,GAGA,OAAO+uE,EAAAxkI,cAACsxJ,EAAA,IAAYrlJ,EAAOyjJ,uBAAwBj6F,GACrD,IAKA,OAFA87F,EAAU7rD,YAAcA,EACxB6rD,EAAUjC,iBAAmBA,EACR/B,GAAagE,EAAWjC,EAC/C,CAEA,OAAqB/B,GAAa+D,EAAShC,EAAiB,CAIhE,EI/sBA,IAAOkC,GAzCP,SAASnlB,GAOe,IAPiD,MACvE72H,EAAA,QACA+gB,EAAA,SACAuW,EAAA,YACA2kH,EAAA,eACAvJ,EAAiB,6BACjBC,EAAwB,QAC1B9b,EACE,MAAMyjB,EAAetrB,EAAMxQ,SAAQ,KACjC,MAAMg0B,EAAeyD,EAAmBj2I,GACxC,MAAO,CACLA,QACAwyI,eACAC,eAAgBwJ,EAAc,IAAMA,OAAc,EAClDvJ,iBACAC,wBACD,GACA,CAAC3yI,EAAOi8I,EAAavJ,EAAgBC,IAElC9K,EAAgB7Y,EAAMxQ,SAAQ,IAAMx+G,EAAMpW,YAAY,CAACoW,IAE7DmyH,GAA0B,KACxB,MAAM,aAAEqgB,GAAiB8H,EAOzB,OANA9H,EAAa8D,cAAgB9D,EAAaoE,iBAC1CpE,EAAa+D,eAET1O,IAAkB7nI,EAAMpW,YAC1B4oJ,EAAaoE,mBAER,KACLpE,EAAakE,iBACblE,EAAa8D,mBAAgB,EAC9B,GACA,CAACgE,EAAczS,IAElB,MAAMoR,EAAUl4H,GAAW+wH,EAG3B,OAAO9iB,EAAAxkI,cAACyuJ,EAAQriJ,SAAR,CAAiB3L,MAAOqvJ,GAAehjH,EACjD,ECfO,SAAS4kH,KASd,IAJAn7H,EAAAxiC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAGYuzJ,EAEZ,MAAMM,EACJrxH,IAAY+wH,EACRG,EAEAD,EAAuBjxH,GACvBo7H,EAAWC,KACf,MAAM,MAAEp8I,GAAUoyI,IAClB,OAAOpyI,CAAA,EAOT,OAJAld,OAAOugB,OAAO84I,EAAU,CACtBze,UAAWA,IAAMye,IAGZA,CACT,CAiBO,IAAMC,GAAyBF,KCjE/B,SAASG,KASd,IAJAt7H,EAAAxiC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAGYuzJ,EAEZ,MAAMqK,EACJp7H,IAAY+wH,EAAoBsK,GAAkBF,GAAgBn7H,GAE9Du7H,EAAcC,IACJJ,IACDxyJ,SAOf,OAJA7G,OAAOugB,OAAOi5I,EAAa,CACzB5e,UAAWA,IAAM4e,IAGZA,CACT,CAuBO,IjBkB+B/oJ,GiBlBzBgpJ,GAA4BF,KjBkBH9oJ,GkB9GhBipJ,EAAAA,iClB+GpB9hB,EAAmCnnI,GW7EHA,KAChCyrH,GAAuBzrH,CAAA,EOlCzBkpJ,CAAwBC,EAAAA,wBCXpBC,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBp+J,IAAjBq+J,EACH,OAAOA,EAAa3lF,QAGrB,IAAIG,EAASqlF,EAAyBE,GAAY,CACjDhzI,GAAIgzI,EACJE,QAAQ,EACR5lF,QAAS,CAAC,GAUX,OANA6lF,EAAoBH,GAAUzpJ,KAAKkkE,EAAOH,QAASG,EAAQA,EAAOH,QAASylF,GAG3EtlF,EAAOylF,QAAS,EAGTzlF,EAAOH,OACf,CAGAylF,EAAoB9iI,EAAIkjI,EC5BxBJ,EAAoBK,KAAO,CAAC,QCA5B,IAAIzlJ,EAAW,GACfolJ,EAAoBtiC,EAAI,CAACh3H,EAAQ45J,EAAU3pJ,EAAIi8B,KAC9C,IAAG0tH,EAAH,CAMA,IAAIC,EAAe/wI,IACnB,IAASptB,EAAI,EAAGA,EAAIwY,EAAShZ,OAAQQ,IAAK,CACrCk+J,EAAW1lJ,EAASxY,GAAG,GACvBuU,EAAKiE,EAASxY,GAAG,GACjBwwC,EAAWh4B,EAASxY,GAAG,GAE3B,IAJA,IAGI6pJ,GAAY,EACPrzI,EAAI,EAAGA,EAAI0nJ,EAAS1+J,OAAQgX,MACpB,EAAXg6B,GAAsB2tH,GAAgB3tH,IAAa1sC,OAAOC,KAAK65J,EAAoBtiC,GAAG/9D,OAAO94D,GAASm5J,EAAoBtiC,EAAE72H,GAAKy5J,EAAS1nJ,MAC9I0nJ,EAAS77H,OAAO7rB,IAAK,IAErBqzI,GAAY,EACTr5G,EAAW2tH,IAAcA,EAAe3tH,IAG7C,GAAGq5G,EAAW,CACbrxI,EAAS6pB,OAAOriC,IAAK,GACrB,IAAIsnC,EAAI/yB,SACE9U,IAAN6nC,IAAiBhjC,EAASgjC,EAC/B,CACD,CACA,OAAOhjC,CArBP,CAJCksC,EAAWA,GAAY,EACvB,IAAI,IAAIxwC,EAAIwY,EAAShZ,OAAQQ,EAAI,GAAKwY,EAASxY,EAAI,GAAG,GAAKwwC,EAAUxwC,IAAKwY,EAASxY,GAAKwY,EAASxY,EAAI,GACrGwY,EAASxY,GAAK,CAACk+J,EAAU3pJ,EAAIi8B,EAuBjB,MC5BdotH,EAAoBlvC,EAAI,CAAC,EACzBkvC,EAAoB1sC,EAAKktC,IACxBt6J,OAAOC,KAAK65J,EAAoBlvC,GAAGtoH,KAAK3B,IACvCm5J,EAAoBlvC,EAAEjqH,GAAK25J,EAAQ,GAClC,ECHHR,EAAoBxnJ,EAAKkiE,IACxB,IAAI+lF,EAAS/lF,GAAUA,EAAOgmF,WAC7B,IAAOhmF,EAAiB,QACxB,IAAM,EAEP,OADAslF,EAAoBr9J,EAAE89J,EAAQ,CAAE74J,EAAG64J,IAC5BA,CAAM,QCNd,IACIE,EADAC,EAAW16J,OAAO66E,eAAkBl0E,GAAS3G,OAAO66E,eAAel0E,GAASA,GAASA,EAAa,UAQtGmzJ,EAAoB5nJ,EAAI,SAAS/J,EAAOqL,GAEvC,GADU,EAAPA,IAAUrL,EAAQqB,KAAKrB,IAChB,EAAPqL,EAAU,OAAOrL,EACpB,GAAoB,kBAAVA,GAAsBA,EAAO,CACtC,GAAW,EAAPqL,GAAarL,EAAMqyJ,WAAY,OAAOryJ,EAC1C,GAAW,GAAPqL,GAAoC,oBAAfrL,EAAMoU,KAAqB,OAAOpU,CAC5D,CACA,IAAIwyJ,EAAK36J,OAAOoP,OAAO,MACvB0qJ,EAAoBt2H,EAAEm3H,GACtB,IAAIC,EAAM,CAAC,EACXH,EAAiBA,GAAkB,CAAC,KAAMC,EAAS,CAAC,GAAIA,EAAS,IAAKA,EAASA,IAC/E,IAAI,IAAI/0J,EAAiB,EAAP6N,GAAYrL,EAAyB,iBAAXxC,KAAyB80J,EAAen+J,QAAQqJ,GAAUA,EAAU+0J,EAAS/0J,GACxH3F,OAAO+0J,oBAAoBpvJ,GAASD,SAAS/E,GAASi6J,EAAIj6J,GAAO,IAAOwH,EAAMxH,KAI/E,OAFAi6J,EAAa,QAAI,IAAM,EACvBd,EAAoBr9J,EAAEk+J,EAAIC,GACnBD,CACR,MCxBAb,EAAoBr9J,EAAI,CAAC43E,EAASwmF,KACjC,IAAI,IAAIl6J,KAAOk6J,EACXf,EAAoBn6J,EAAEk7J,EAAYl6J,KAASm5J,EAAoBn6J,EAAE00E,EAAS1zE,IAC5EX,OAAOq7E,eAAehH,EAAS1zE,EAAK,CAAEytG,YAAY,EAAM1wG,IAAKm9J,EAAWl6J,IAE1E,ECNDm5J,EAAoB3nJ,EAAI,CAAC,EAGzB2nJ,EAAoB5tJ,EAAKouJ,GACjBlsJ,QAAQ0H,IAAI9V,OAAOC,KAAK65J,EAAoB3nJ,GAAG1Q,QAAO,CAACq5J,EAAUn6J,KACvEm5J,EAAoB3nJ,EAAExR,GAAK25J,EAASQ,GAC7BA,IACL,KCNJhB,EAAoBzuJ,EAAKivJ,GAEjB,aAAeA,EAAU,IAAM,CAAC,GAAK,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,YAAYA,GAAW,YCF7NR,EAAoBiB,SAAYT,GAExB,cAAgBA,EAAU,IAAM,CAAC,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,WAAW,IAAM,YAAYA,GAAW,aCH5KR,EAAoBxvD,EAAI,WACvB,GAA0B,kBAAfskD,WAAyB,OAAOA,WAC3C,IACC,OAAOplJ,MAAQ,IAAI2qE,SAAS,cAAb,EAChB,CAAE,MAAOjoE,GACR,GAAsB,kBAAX3O,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxBu8J,EAAoBn6J,EAAI,CAACgH,EAAK6F,IAAUxM,OAAOiP,UAAUxC,eAAe6D,KAAK3J,EAAK6F,SCAlF,IAAIwuJ,EAAa,CAAC,EACdC,EAAoB,cAExBnB,EAAoB3sD,EAAI,CAACj4E,EAAK3Z,EAAM5a,EAAK25J,KACxC,GAAGU,EAAW9lI,GAAQ8lI,EAAW9lI,GAAK70B,KAAKkb,OAA3C,CACA,IAAIsY,EAAQqnI,EACZ,QAAWv/J,IAARgF,EAEF,IADA,IAAIw6J,EAAUp/J,SAASq/J,qBAAqB,UACpCl/J,EAAI,EAAGA,EAAIi/J,EAAQz/J,OAAQQ,IAAK,CACvC,IAAIktB,EAAI+xI,EAAQj/J,GAChB,GAAGktB,EAAEiyI,aAAa,QAAUnmI,GAAO9L,EAAEiyI,aAAa,iBAAmBJ,EAAoBt6J,EAAK,CAAEkzB,EAASzK,EAAG,KAAO,CACpH,CAEGyK,IACHqnI,GAAa,GACbrnI,EAAS93B,SAAS2L,cAAc,WAEzB4zJ,QAAU,QACjBznI,EAAOnJ,QAAU,IACbovI,EAAoByB,IACvB1nI,EAAOy3E,aAAa,QAASwuD,EAAoByB,IAElD1nI,EAAOy3E,aAAa,eAAgB2vD,EAAoBt6J,GAExDkzB,EAAOV,IAAM+B,GAEd8lI,EAAW9lI,GAAO,CAAC3Z,GACnB,IAAIigJ,EAAmB,CAAC9H,EAAMvxI,KAE7B0R,EAAOxO,QAAUwO,EAAO6B,OAAS,KACjCrE,aAAa3G,GACb,IAAI+wI,EAAUT,EAAW9lI,GAIzB,UAHO8lI,EAAW9lI,GAClBrB,EAAOgC,YAAchC,EAAOgC,WAAWjD,YAAYiB,GACnD4nI,GAAWA,EAAQ/1J,SAAS+K,GAAQA,EAAG0R,KACpCuxI,EAAM,OAAOA,EAAKvxI,EAAM,EAExBuI,EAAUpnB,WAAWk4J,EAAiB9zI,KAAK,UAAM/rB,EAAW,CAAEyM,KAAM,UAAWkE,OAAQunB,IAAW,MACtGA,EAAOxO,QAAUm2I,EAAiB9zI,KAAK,KAAMmM,EAAOxO,SACpDwO,EAAO6B,OAAS8lI,EAAiB9zI,KAAK,KAAMmM,EAAO6B,QACnDwlI,GAAcn/J,SAAS86F,KAAKjvF,YAAYisB,EApCkB,CAoCX,MCvChDimI,EAAoBt2H,EAAK6wC,IACH,qBAAX3H,QAA0BA,OAAO0O,aAC1Cp7E,OAAOq7E,eAAehH,EAAS3H,OAAO0O,YAAa,CAAEjzE,MAAO,WAE7DnI,OAAOq7E,eAAehH,EAAS,aAAc,CAAElsE,OAAO,GAAO,ECL9D2xJ,EAAoB4B,IAAOlnF,IAC1BA,EAAOrI,MAAQ,GACVqI,EAAOhgC,WAAUggC,EAAOhgC,SAAW,IACjCggC,GCHRslF,EAAoB/wJ,EAAI,UCAxB,GAAwB,qBAAbhN,SAAX,CACA,IAkDI4/J,EAAkBrB,GACd,IAAIlsJ,SAAQ,CAACF,EAASD,KAC5B,IAAIqkB,EAAOwnI,EAAoBiB,SAAST,GACpCsB,EAAW9B,EAAoB/wJ,EAAIupB,EACvC,GAlBmB,EAACA,EAAMspI,KAE3B,IADA,IAAIC,EAAmB9/J,SAASq/J,qBAAqB,QAC7Cl/J,EAAI,EAAGA,EAAI2/J,EAAiBngK,OAAQQ,IAAK,CAChD,IACI4/J,GADA99J,EAAM69J,EAAiB3/J,IACRm/J,aAAa,cAAgBr9J,EAAIq9J,aAAa,QACjE,GAAe,eAAZr9J,EAAI+9J,MAAyBD,IAAaxpI,GAAQwpI,IAAaF,GAAW,OAAO59J,CACrF,CACA,IAAIg+J,EAAoBjgK,SAASq/J,qBAAqB,SACtD,IAAQl/J,EAAI,EAAGA,EAAI8/J,EAAkBtgK,OAAQQ,IAAK,CACjD,IAAI8B,EAEJ,IADI89J,GADA99J,EAAMg+J,EAAkB9/J,IACTm/J,aAAa,gBAChB/oI,GAAQwpI,IAAaF,EAAU,OAAO59J,CACvD,GAMIi+J,CAAe3pI,EAAMspI,GAAW,OAAO1tJ,IAtDrB,EAACosJ,EAASsB,EAAUM,EAAQhuJ,EAASD,KAC3D,IAAIkuJ,EAAUpgK,SAAS2L,cAAc,QAErCy0J,EAAQJ,IAAM,aACdI,EAAQ/zJ,KAAO,WACX0xJ,EAAoByB,KACvBY,EAAQC,MAAQtC,EAAoByB,IAmBrCY,EAAQ92I,QAAU82I,EAAQzmI,OAjBJvT,IAGrB,GADAg6I,EAAQ92I,QAAU82I,EAAQzmI,OAAS,KAChB,SAAfvT,EAAM/Z,KACT8F,QACM,CACN,IAAImuJ,EAAYl6I,GAASA,EAAM/Z,KAC3Bk0J,EAAWn6I,GAASA,EAAM7V,QAAU6V,EAAM7V,OAAOgmB,MAAQspI,EACzDv8F,EAAM,IAAIz2D,MAAM,qBAAuB0xJ,EAAU,cAAgB+B,EAAY,KAAOC,EAAW,KACnGj9F,EAAIzjE,KAAO,iBACXyjE,EAAIxwD,KAAO,wBACXwwD,EAAIj3D,KAAOi0J,EACXh9F,EAAIhjD,QAAUigJ,EACVH,EAAQtmI,YAAYsmI,EAAQtmI,WAAWjD,YAAYupI,GACvDluJ,EAAOoxD,EACR,GAGD88F,EAAQ7pI,KAAOspI,EAGXM,EACHA,EAAOrmI,WAAW2sG,aAAa25B,EAASD,EAAO11C,aAE/CzqH,SAAS86F,KAAKjvF,YAAYu0J,EAEb,EAqBbI,CAAiBjC,EAASsB,EAAU,KAAM1tJ,EAASD,EAAO,IAIxDuuJ,EAAqB,CACxB,IAAK,GAGN1C,EAAoB3nJ,EAAEsqJ,QAAU,CAACnC,EAASQ,KAEtC0B,EAAmBlC,GAAUQ,EAASz6J,KAAKm8J,EAAmBlC,IACzB,IAAhCkC,EAAmBlC,IAFX,CAAC,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,EAAE,IAAM,GAEhBA,IACtDQ,EAASz6J,KAAKm8J,EAAmBlC,GAAWqB,EAAerB,GAAS/9I,MAAK,KACxEigJ,EAAmBlC,GAAW,CAAC,IAC5BpuJ,IAEH,aADOswJ,EAAmBlC,GACpBpuJ,CAAC,IAET,EAKD4tJ,EAAoBlvC,EAAE6xC,QAAWnC,IAChC,KAAKR,EAAoBn6J,EAAE68J,EAAoBlC,SAA4C3+J,IAAhC6gK,EAAmBlC,MAA4B,iBAAiB5rJ,KAAK4rJ,GAAU,CACzIkC,EAAmBlC,GAAW,KAC9B,IAAIlmD,EAAOr4G,SAAS2L,cAAc,QAE9BoyJ,EAAoByB,IACvBnnD,EAAK9I,aAAa,QAASwuD,EAAoByB,IAEhDnnD,EAAK2nD,IAAM,WACX3nD,EAAKsoD,GAAK,QACVtoD,EAAK9hF,KAAOwnI,EAAoB/wJ,EAAI+wJ,EAAoBiB,SAAST,GACjEv+J,SAAS86F,KAAKjvF,YAAYwsG,EAC3B,EA3F0C,YCK3C,IAAIuoD,EAAkB,CACrB,IAAK,GAGN7C,EAAoB3nJ,EAAEO,EAAI,CAAC4nJ,EAASQ,KAElC,IAAI8B,EAAqB9C,EAAoBn6J,EAAEg9J,EAAiBrC,GAAWqC,EAAgBrC,QAAW3+J,EACtG,GAA0B,IAAvBihK,EAGF,GAAGA,EACF9B,EAASz6J,KAAKu8J,EAAmB,QAC3B,CAGL,IAAIzuJ,EAAU,IAAIC,SAAQ,CAACF,EAASD,IAAY2uJ,EAAqBD,EAAgBrC,GAAW,CAACpsJ,EAASD,KAC1G6sJ,EAASz6J,KAAKu8J,EAAmB,GAAKzuJ,GAGtC,IAAI+mB,EAAM4kI,EAAoB/wJ,EAAI+wJ,EAAoBzuJ,EAAEivJ,GAEpDnuJ,EAAQ,IAAIvD,MAgBhBkxJ,EAAoB3sD,EAAEj4E,GAfF/S,IACnB,GAAG23I,EAAoBn6J,EAAEg9J,EAAiBrC,KAEf,KAD1BsC,EAAqBD,EAAgBrC,MACRqC,EAAgBrC,QAAW3+J,GACrDihK,GAAoB,CACtB,IAAIP,EAAYl6I,IAAyB,SAAfA,EAAM/Z,KAAkB,UAAY+Z,EAAM/Z,MAChEy0J,EAAU16I,GAASA,EAAM7V,QAAU6V,EAAM7V,OAAO6mB,IACpDhnB,EAAMzD,QAAU,iBAAmB4xJ,EAAU,cAAgB+B,EAAY,KAAOQ,EAAU,IAC1F1wJ,EAAMvQ,KAAO,iBACbuQ,EAAM/D,KAAOi0J,EACblwJ,EAAMkQ,QAAUwgJ,EAChBD,EAAmB,GAAGzwJ,EACvB,CACD,GAEwC,SAAWmuJ,EAASA,EAE/D,CACD,EAGFR,EAAoBlvC,EAAEl4G,EAAK4nJ,IAC1B,IAAKR,EAAoBn6J,EAAEg9J,EAAiBrC,SAAyC3+J,IAA7BghK,EAAgBrC,GAAiC,CACxGqC,EAAgBrC,GAAW,KAC3B,IAAIlmD,EAAOr4G,SAAS2L,cAAc,QAE9BoyJ,EAAoByB,IACvBnnD,EAAK9I,aAAa,QAASwuD,EAAoByB,IAEhDnnD,EAAK2nD,IAAM,WACX3nD,EAAKsoD,GAAK,SACVtoD,EAAK9hF,KAAOwnI,EAAoB/wJ,EAAI+wJ,EAAoBzuJ,EAAEivJ,GAC1Dv+J,SAAS86F,KAAKjvF,YAAYwsG,EAC3B,GASD0lD,EAAoBtiC,EAAE9kH,EAAK4nJ,GAA0C,IAA7BqC,EAAgBrC,GAGxD,IAAIwC,EAAuB,CAACC,EAA4BrtJ,KACvD,IAKIqqJ,EAAUO,EALVF,EAAW1qJ,EAAK,GAChBstJ,EAActtJ,EAAK,GACnButJ,EAAUvtJ,EAAK,GAGIxT,EAAI,EAC3B,GAAGk+J,EAASn+I,MAAM8K,GAAgC,IAAxB41I,EAAgB51I,KAAa,CACtD,IAAIgzI,KAAYiD,EACZlD,EAAoBn6J,EAAEq9J,EAAajD,KACrCD,EAAoB9iI,EAAE+iI,GAAYiD,EAAYjD,IAGhD,GAAGkD,EAAS,IAAIz8J,EAASy8J,EAAQnD,EAClC,CAEA,IADGiD,GAA4BA,EAA2BrtJ,GACrDxT,EAAIk+J,EAAS1+J,OAAQQ,IACzBo+J,EAAUF,EAASl+J,GAChB49J,EAAoBn6J,EAAEg9J,EAAiBrC,IAAYqC,EAAgBrC,IACrEqC,EAAgBrC,GAAS,KAE1BqC,EAAgBrC,GAAW,EAE5B,OAAOR,EAAoBtiC,EAAEh3H,EAAO,EAGjC08J,EAAqBvwJ,KAA6B,uBAAIA,KAA6B,wBAAK,GAC5FuwJ,EAAmBx3J,QAAQo3J,EAAqBp1I,KAAK,KAAM,IAC3Dw1I,EAAmB78J,KAAOy8J,EAAqBp1I,KAAK,KAAMw1I,EAAmB78J,KAAKqnB,KAAKw1I,cCpGvF,IAAIC,EAAqB,CACxB,IAAO,CACN,GACA,IACA,IACA,IACA,IACA,IACA,IACA,MAGFrD,EAAoB3nJ,EAAEirJ,SAAW,CAAC9C,EAASQ,IAAc1sJ,QAAQ0H,IAAIglJ,GAAUv+I,MAAK,KACnF,IAAI8gJ,EAASF,EAAmB7C,GAChCxwJ,MAAMC,QAAQszJ,IAAWA,EAAO/6J,IAAIw3J,EAAoB1sC,EAAE,QCd3D0sC,EAAoBtiC,EAAE,EAAG,CAAC,MAAM,KAC/BsiC,EAAoB1sC,EAAE,KACtB0sC,EAAoB1sC,EAAE,IAAI,GACxB,+FCCH,SAAe4zB,EAAAA,EAAAA,IAAe,CAC5BlF,QAAS,CACP75I,KAAMiC,EAAAA,GACN+C,KAAMw7D,EAAAA,2DCGV,MAAM66F,GAAMtqB,EAAAA,EAAAA,OAAK,IAAM,wDAEjB3iG,EAAO87F,EAAAA,WAAoBpwI,SAASwhK,eAAe,SAUzDx5F,MAAM,gBACHxnD,MAAMwpB,GAAaA,EAASuO,SAC5B/3B,MAAM5L,IACL1N,aAAa8B,QAAQ,OAAW,OAAH4L,QAAG,IAAHA,OAAG,EAAHA,EAAKzI,YAClC,IAAIs1J,EAAY,GAEZC,GACFl6J,EAAAA,EAAAA,IAAqBoN,EAAI1I,OAAQ0I,EAAI+sJ,UAAW/sJ,EAAIzI,YACpD,uBACEy1J,GACFp6J,EAAAA,EAAAA,IAAqBoN,EAAI1I,OAAQ0I,EAAI+sJ,UAAW/sJ,EAAIzI,YACpD,iBAEFs1J,EAAUn9J,KAAKo9J,GACfD,EAAUn9J,KAAKs9J,GACfH,EAAUn9J,KAVA,qBAWVm9J,EAAUn9J,KAAK,gBAEf+N,QAAQ0H,IACN0nJ,EAAUl7J,KAAIsE,gBACKm9D,MAAM7uC,EAAK,CAC1BntB,OAAQ,SAEEusC,UAGb/3B,MAAMqhJ,KACL55J,EAAAA,EAAAA,GAAsB45J,EAAS,IAE/BvtH,EAAKi9D,QACHuwD,EAAAA,EAAAA,KAACnoB,EAAAA,SAAQ,CACPnW,UACEs+B,EAAAA,EAAAA,KAAA,OAAKC,UAAU,cAAatpH,UAC1BqpH,EAAAA,EAAAA,KAAA,OAAK1qI,IAAK,uBAAiD4qI,IAAI,kBAElEvpH,UAEDqpH,EAAAA,EAAAA,KAAC/pJ,EAAAA,GAAQ,CAACoJ,MAAOA,EAAMs3B,UACrBqpH,EAAAA,EAAAA,KAACzxB,EAAAA,GAAa,CAAA53F,UACZqpH,EAAAA,EAAAA,KAACP,EAAG,CACFp/J,OAAQyS,EACRqtJ,YAAYp9J,EAAAA,EAAAA,IAAiBg9J,EAAS,IACtCK,OAAQL,EAAS,GACjBl7F,MAAOk7F,EAAS,WAKzB,IAEFtvJ,OAAO+wD,IACN3gE,QAAQC,IAAI0gE,EAAI32D,QAAU,MAAQ22D,EAAI32D,QAAU,QAAQ,GACxD,IAEL4F,OAAO+wD,IACN3gE,QAAQC,IAAI0gE,EAAI32D,QAAU22D,EAAI32D,QAAU,QAAQ","sources":["libs/cookieManager.js","libs/helpers.js","libs/language.js","libs/messages.js","store/cartStore.js","../node_modules/@firebase/util/src/constants.ts","../node_modules/@firebase/util/src/assert.ts","../node_modules/@firebase/util/src/crypt.ts","../node_modules/@firebase/util/src/deepCopy.ts","../node_modules/@firebase/util/src/defaults.ts","../node_modules/@firebase/util/src/global.ts","../node_modules/@firebase/util/src/deferred.ts","../node_modules/@firebase/util/src/environment.ts","../node_modules/@firebase/util/src/errors.ts","../node_modules/@firebase/util/src/json.ts","../node_modules/@firebase/util/src/jwt.ts","../node_modules/@firebase/util/src/obj.ts","../node_modules/@firebase/util/src/sha1.ts","../node_modules/@firebase/util/src/validation.ts","../node_modules/@firebase/util/src/utf8.ts","../node_modules/@firebase/util/src/compat.ts","../node_modules/@firebase/component/src/component.ts","../node_modules/@firebase/component/src/constants.ts","../node_modules/@firebase/component/src/provider.ts","../node_modules/@firebase/component/src/component_container.ts","../node_modules/@firebase/logger/src/logger.ts","../node_modules/idb/build/wrap-idb-value.js","../node_modules/idb/build/index.js","../node_modules/@firebase/app/src/platformLoggerService.ts","../node_modules/@firebase/app/src/logger.ts","../node_modules/@firebase/app/src/constants.ts","../node_modules/@firebase/app/src/internal.ts","../node_modules/@firebase/app/src/errors.ts","../node_modules/@firebase/app/src/firebaseApp.ts","../node_modules/@firebase/app/src/api.ts","../node_modules/@firebase/app/src/indexeddb.ts","../node_modules/@firebase/app/src/heartbeatService.ts","../node_modules/@firebase/app/src/registerCoreComponents.ts","../node_modules/@firebase/app/src/index.ts","../node_modules/firebase/app/index.ts","../node_modules/@firebase/database/src/core/version.ts","../node_modules/@firebase/database/src/core/storage/DOMStorageWrapper.ts","../node_modules/@firebase/database/src/core/storage/MemoryStorage.ts","../node_modules/@firebase/database/src/core/storage/storage.ts","../node_modules/@firebase/database/src/core/util/util.ts","../node_modules/@firebase/database/src/core/AppCheckTokenProvider.ts","../node_modules/@firebase/database/src/core/AuthTokenProvider.ts","../node_modules/@firebase/database/src/realtime/Constants.ts","../node_modules/@firebase/database/src/core/RepoInfo.ts","../node_modules/@firebase/database/src/core/stats/StatsCollection.ts","../node_modules/@firebase/database/src/core/stats/StatsManager.ts","../node_modules/@firebase/database/src/realtime/polling/PacketReceiver.ts","../node_modules/@firebase/database/src/realtime/BrowserPollConnection.ts","../node_modules/@firebase/database/src/realtime/WebSocketConnection.ts","../node_modules/@firebase/database/src/realtime/TransportManager.ts","../node_modules/@firebase/database/src/realtime/Connection.ts","../node_modules/@firebase/database/src/core/ServerActions.ts","../node_modules/@firebase/database/src/core/util/EventEmitter.ts","../node_modules/@firebase/database/src/core/util/OnlineMonitor.ts","../node_modules/@firebase/database/src/core/util/Path.ts","../node_modules/@firebase/database/src/core/util/VisibilityMonitor.ts","../node_modules/@firebase/database/src/core/PersistentConnection.ts","../node_modules/@firebase/database/src/core/snap/Node.ts","../node_modules/@firebase/database/src/core/snap/indexes/Index.ts","../node_modules/@firebase/database/src/core/snap/indexes/KeyIndex.ts","../node_modules/@firebase/database/src/core/util/SortedMap.ts","../node_modules/@firebase/database/src/core/snap/comparators.ts","../node_modules/@firebase/database/src/core/snap/snap.ts","../node_modules/@firebase/database/src/core/snap/LeafNode.ts","../node_modules/@firebase/database/src/core/snap/indexes/PriorityIndex.ts","../node_modules/@firebase/database/src/core/snap/childSet.ts","../node_modules/@firebase/database/src/core/snap/IndexMap.ts","../node_modules/@firebase/database/src/core/snap/ChildrenNode.ts","../node_modules/@firebase/database/src/core/snap/nodeFromJSON.ts","../node_modules/@firebase/database/src/core/snap/indexes/PathIndex.ts","../node_modules/@firebase/database/src/core/snap/indexes/ValueIndex.ts","../node_modules/@firebase/database/src/core/view/Change.ts","../node_modules/@firebase/database/src/core/view/filter/IndexedFilter.ts","../node_modules/@firebase/database/src/core/view/filter/RangedFilter.ts","../node_modules/@firebase/database/src/core/view/filter/LimitedFilter.ts","../node_modules/@firebase/database/src/core/view/QueryParams.ts","../node_modules/@firebase/database/src/core/ReadonlyRestClient.ts","../node_modules/@firebase/util/src/query.ts","../node_modules/@firebase/database/src/core/SnapshotHolder.ts","../node_modules/@firebase/database/src/core/SparseSnapshotTree.ts","../node_modules/@firebase/database/src/core/stats/StatsListener.ts","../node_modules/@firebase/database/src/core/stats/StatsReporter.ts","../node_modules/@firebase/database/src/core/operation/Operation.ts","../node_modules/@firebase/database/src/core/operation/AckUserWrite.ts","../node_modules/@firebase/database/src/core/operation/ListenComplete.ts","../node_modules/@firebase/database/src/core/operation/Overwrite.ts","../node_modules/@firebase/database/src/core/operation/Merge.ts","../node_modules/@firebase/database/src/core/view/CacheNode.ts","../node_modules/@firebase/database/src/core/view/EventGenerator.ts","../node_modules/@firebase/database/src/core/view/ViewCache.ts","../node_modules/@firebase/database/src/core/util/ImmutableTree.ts","../node_modules/@firebase/database/src/core/CompoundWrite.ts","../node_modules/@firebase/database/src/core/WriteTree.ts","../node_modules/@firebase/database/src/core/view/ChildChangeAccumulator.ts","../node_modules/@firebase/database/src/core/view/CompleteChildSource.ts","../node_modules/@firebase/database/src/core/view/ViewProcessor.ts","../node_modules/@firebase/database/src/core/view/View.ts","../node_modules/@firebase/database/src/core/SyncPoint.ts","../node_modules/@firebase/database/src/core/SyncTree.ts","../node_modules/@firebase/database/src/core/util/ServerValues.ts","../node_modules/@firebase/database/src/core/util/Tree.ts","../node_modules/@firebase/database/src/core/util/validation.ts","../node_modules/@firebase/database/src/core/view/EventQueue.ts","../node_modules/@firebase/database/src/core/Repo.ts","../node_modules/@firebase/database/src/core/util/libs/parser.ts","../node_modules/@firebase/database/src/core/util/NextPushId.ts","../node_modules/@firebase/database/src/core/view/Event.ts","../node_modules/@firebase/database/src/core/view/EventRegistration.ts","../node_modules/@firebase/database/src/api/Reference_impl.ts","../node_modules/@firebase/database/src/api/Database.ts","../node_modules/@firebase/database/src/api/test_access.ts","../node_modules/@firebase/database/src/register.ts","../node_modules/@firebase/database/src/index.ts","libs/firebaseApi.js","../node_modules/@firebase/util/src/emulator.ts","store/siteStore.js","../node_modules/@remix-run/router/history.ts","../node_modules/@remix-run/router/utils.ts","../node_modules/@remix-run/router/router.ts","../node_modules/lodash/lodash.js","../node_modules/react-dom/cjs/react-dom.production.min.js","../node_modules/react-dom/client.js","../node_modules/react-dom/index.js","../node_modules/react-router-dom/dom.ts","../node_modules/react-router-dom/index.tsx","../node_modules/react-router/lib/context.ts","../node_modules/react-router/lib/hooks.tsx","../node_modules/react-router/lib/components.tsx","../node_modules/react/cjs/react-jsx-runtime.production.min.js","../node_modules/react/cjs/react.production.min.js","../node_modules/react/index.js","../node_modules/react/jsx-runtime.js","../node_modules/scheduler/cjs/scheduler.production.min.js","../node_modules/scheduler/index.js","../node_modules/use-sync-external-store/cjs/use-sync-external-store-with-selector.production.min.js","../node_modules/use-sync-external-store/with-selector.js","../node_modules/reselect/src/utils.ts","../node_modules/reselect/src/autotrackMemoize/proxy.ts","../node_modules/reselect/src/weakMapMemoize.ts","../node_modules/reselect/src/createSelectorCreator.ts","../node_modules/reselect/src/createStructuredSelector.ts","../node_modules/redux/src/utils/formatProdErrorMessage.ts","../node_modules/redux/src/utils/symbol-observable.ts","../node_modules/redux/src/utils/actionTypes.ts","../node_modules/redux/src/utils/isPlainObject.ts","../node_modules/redux/src/createStore.ts","../node_modules/redux/src/combineReducers.ts","../node_modules/redux/src/compose.ts","../node_modules/redux-thunk/dist/redux-thunk.mjs","../node_modules/@reduxjs/toolkit/src/devtoolsExtension.ts","../node_modules/@reduxjs/toolkit/src/createDraftSafeSelector.ts","../node_modules/@reduxjs/toolkit/src/createAction.ts","../node_modules/redux/src/utils/isAction.ts","../node_modules/@reduxjs/toolkit/src/utils.ts","../node_modules/@reduxjs/toolkit/src/getDefaultMiddleware.ts","../node_modules/@reduxjs/toolkit/src/autoBatchEnhancer.ts","../node_modules/@reduxjs/toolkit/src/getDefaultEnhancers.ts","../node_modules/@reduxjs/toolkit/src/configureStore.ts","../node_modules/redux/src/applyMiddleware.ts","../node_modules/@reduxjs/toolkit/src/mapBuilders.ts","../node_modules/@reduxjs/toolkit/src/nanoid.ts","../node_modules/@reduxjs/toolkit/src/createSlice.ts","../node_modules/@reduxjs/toolkit/src/createReducer.ts","../node_modules/@reduxjs/toolkit/src/listenerMiddleware/exceptions.ts","../node_modules/@reduxjs/toolkit/src/listenerMiddleware/utils.ts","../node_modules/@reduxjs/toolkit/src/listenerMiddleware/task.ts","../node_modules/@reduxjs/toolkit/src/listenerMiddleware/index.ts","../node_modules/@reduxjs/toolkit/src/combineSlices.ts","../node_modules/@reduxjs/toolkit/src/formatProdErrorMessage.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/utils/env.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/utils/errors.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/utils/common.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/utils/plugins.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/core/scope.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/core/finalize.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/core/proxy.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/core/immerClass.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/core/current.ts","../node_modules/@reduxjs/toolkit/node_modules/immer/src/immer.ts","../node_modules/react-redux/src/utils/react.ts","../node_modules/react-redux/src/components/Context.ts","../node_modules/react-redux/src/utils/useSyncExternalStore.ts","../node_modules/react-redux/src/hooks/useReduxContext.ts","../node_modules/react-redux/src/hooks/useSelector.ts","../node_modules/react-redux/src/utils/react-is.ts","../node_modules/react-redux/src/connect/selectorFactory.ts","../node_modules/react-redux/src/connect/wrapMapToProps.ts","../node_modules/react-redux/src/connect/invalidArgFactory.ts","../node_modules/react-redux/src/connect/mergeProps.ts","../node_modules/react-redux/src/utils/batch.ts","../node_modules/react-redux/src/utils/Subscription.ts","../node_modules/react-redux/src/utils/useIsomorphicLayoutEffect.ts","../node_modules/react-redux/src/utils/shallowEqual.ts","../node_modules/react-redux/src/utils/hoistStatics.ts","../node_modules/react-redux/src/components/connect.tsx","../node_modules/react-redux/src/connect/mapStateToProps.ts","../node_modules/react-redux/src/connect/mapDispatchToProps.ts","../node_modules/react-redux/src/utils/bindActionCreators.ts","../node_modules/react-redux/src/components/Provider.tsx","../node_modules/react-redux/src/hooks/useStore.ts","../node_modules/react-redux/src/hooks/useDispatch.ts","../node_modules/react-redux/src/index.ts","../webpack/bootstrap","../webpack/runtime/amd options","../webpack/runtime/chunk loaded","../webpack/runtime/chunk prefetch function","../webpack/runtime/compat get default export","../webpack/runtime/create fake namespace object","../webpack/runtime/define property getters","../webpack/runtime/ensure chunk","../webpack/runtime/get javascript chunk filename","../webpack/runtime/get mini-css chunk filename","../webpack/runtime/global","../webpack/runtime/hasOwnProperty shorthand","../webpack/runtime/load script","../webpack/runtime/make namespace object","../webpack/runtime/node module decorator","../webpack/runtime/publicPath","../webpack/runtime/css loading","../webpack/runtime/jsonp chunk loading","../webpack/runtime/chunk prefetch trigger","../webpack/runtime/startup prefetch","store/store.js","index.js"],"sourcesContent":["export function getCookieForm(cname, idiom = null) {\r\n  var name = cname + '=';\r\n  if (idiom !== null) name = cname + '-' + idiom + '=';\r\n  var decodedCookie = decodeURIComponent(document.cookie);\r\n  var ca = decodedCookie.split(';');\r\n  for (var i = 0; i < ca.length; i++) {\r\n    var c = ca[i];\r\n    while (c.charAt(0) === ' ') {\r\n      c = c.substring(1);\r\n    }\r\n    if (c.indexOf(name) === 0) {\r\n      return c.substring(name.length, c.length);\r\n    }\r\n  }\r\n  return '';\r\n}\r\nexport function setCookieForm(cname, cvalue, idiom = null) {\r\n  var d = new Date();\r\n  d.setTime(d.getTime() + 60 * 60 * 1000);\r\n  var expires = 'expires=' + d.toUTCString();\r\n  if (idiom !== null) cname = cname + '-' + idiom;\r\n  document.cookie = cname + '=' + cvalue + ';' + expires + ';path=/';\r\n}\r\nexport function deleteCookieForm(cname, idiom = null) {\r\n  var expires = 'expires=Thu, 21 Aug 2014 20:00:00 UTC';\r\n  if (idiom !== null) cname = cname + '-' + idiom;\r\n  document.cookie = cname + '=;' + expires + ';path=/';\r\n}\r\n","import _ from 'lodash';\r\nimport getTexto from './messages';\r\nimport { getLanguage } from './language';\r\n\r\nexport function isHome(location){\r\n \r\n  return location.pathname === process.env.PUBLIC_URL + '/' || location.pathname === process.env.PUBLIC_URL || location.pathname === process.env.PUBLIC_URL + '/index.html'\r\n}\r\n\r\nexport function backToTop() {\r\n  document.body.scrollTop = 0; // For Safari\r\n  document.documentElement.scrollTop = 0; // For Chrome, Firefox, IE and Opera\r\n}\r\nexport function getParamsFromUrl(variable) {\r\n  let search = window.location.search.substr(1);\r\n  var searchParams = new URLSearchParams(search);\r\n  return searchParams.get(variable);\r\n}\r\nexport function getAllParamsFromUrl() {\r\n  let search = window.location.search.substr(1);\r\n  var searchParams = new URLSearchParams(search);\r\n  return searchParams;\r\n}\r\n\r\nexport function setCookie(cname, cvalue, exdays) {\r\n  var d = new Date();\r\n  d.setTime(d.getTime() + exdays * 24 * 60 * 60 * 1000);\r\n  var expires = 'expires=' + d.toUTCString();\r\n  document.cookie = cname + '=' + cvalue + ';' + expires + ';path=/';\r\n}\r\nexport function isKsk(site) {\r\n  return site?.initialConfig?.WebSection === kskTag()//\"KSK\"\r\n}\r\nexport function isRentals(site) {\r\n  return site?.initialConfig?.WebSection === rentalsTag()//\"RENTAL\"\r\n}\r\nexport function isGifts(site) {\r\n  return site?.initialConfig?.WebSection === giftsTag()//\"SPGIFT\"\r\n}\r\nexport function kskTag() {\r\n  return \"KSK\"\r\n}\r\nexport function rentalsTag() {\r\n  return \"Rentals\"\r\n}\r\nexport function giftsTag() {\r\n  return \"SpecialGifts\"\r\n}\r\nexport function getWebSectionForEndpoint(webSection = \"KSK\"){\r\n  let tag = kskTag();\r\n  switch(webSection){\r\n    case \"KSK\":  tag = kskTag(); break;\r\n    case \"RENTAL\":  tag = rentalsTag(); break;\r\n    case \"SPGIFT\":  tag = giftsTag(); break;\r\n    default:  tag = kskTag();break\r\n  }\r\n\r\n  return tag;\r\n}\r\n// function getCookie(cname) {\r\n//   var name = cname + '=';\r\n//   var decodedCookie = decodeURIComponent(document.cookie);\r\n//   var ca = decodedCookie.split(';');\r\n//   for (var i = 0; i < ca.length; i++) {\r\n//     var c = ca[i];\r\n//     while (c.charAt(0) === ' ') {\r\n//       c = c.substring(1);\r\n//     }\r\n//     if (c.indexOf(name) === 0) {\r\n//       return c.substring(name.length, c.length);\r\n//     }\r\n//   }\r\n//   return '';\r\n// }\r\n\r\nexport function openModalForLogin(config, reduxLogin) {\r\n  var left = Screen.width / 2 - 400 / 2;\r\n  var top = Screen.height / 2 - 600 / 2;\r\n  var strWindowFeatures =\r\n    'menubar=no,location=no,resizable=no,scrollbars=yes,status=no,width=400,innerHeight=600,centerscreen=yes,chrome=yes, top=' +\r\n    top +\r\n    ', left=' +\r\n    left +\r\n    '';\r\n  window['output'] = function (userToken ) {\r\n    console.log(userToken);\r\n    reduxLogin(userToken);\r\n  };\r\n  \r\n  let idioma = getLanguage() ==\"en-US\"? \"en\": \"es\";\r\n  window.open(\r\n    config.urlToGetTokenToLogin +\r\n      '?Code=' +\r\n      config.codeToGetTokenToLogin +\r\n      '&Lang='+idioma+\r\n      '&ReturnUrl=' +\r\n      window.location.protocol +\r\n      '//' +\r\n      window.location.hostname +\r\n      (window.location.hostname === 'localhost' ? ':3000' : '') +\r\n      '/redirect.html',\r\n    'CNN_WindowName',\r\n    strWindowFeatures\r\n  );\r\n}\r\nexport function RetrieveRandomObjByCat(objects, cat, numberToRetrieve) {\r\n  let arrayItems = [];\r\n  let itents = 0;\r\n  let itemsFilteredByCat = _.filter(objects, function (o) {\r\n    return o.ItemExt.Group.SGroupCode === cat;\r\n  });\r\n  while (arrayItems.length < numberToRetrieve && itents < 1000) {\r\n    let number = _.random(0, Object.keys(itemsFilteredByCat).length);\r\n    let newArray = itemsFilteredByCat.slice(number, number + 1);\r\n    if (newArray.length > 0) {\r\n      if (\r\n        _.findIndex(arrayItems, function (o) {\r\n          return o.IItemID === newArray[0].IItemID;\r\n        }) === -1\r\n      ) {\r\n        arrayItems.push(...newArray);\r\n      }\r\n    }\r\n    itents++;\r\n  }\r\n  return arrayItems;\r\n}\r\n\r\nexport function openModalForRetrieveUser(config, reduxLogin) {\r\n  var left = Screen.width / 2 - 400 / 2;\r\n  var top = Screen.height / 2 - 600 / 2;\r\n  var strWindowFeatures =\r\n    'menubar=no,location=no,resizable=no,scrollbars=yes,status=no,width=400,innerHeight=600,centerscreen=yes,chrome=yes, top=' +\r\n    top +\r\n    ', left=' +\r\n    left +\r\n    '';\r\n  window['output'] = function (userToken) {\r\n    reduxLogin(userToken);\r\n  };\r\n  window.open(\r\n    config.urlToRetrieveTokenToLogin +\r\n      '?Code=' +\r\n      config.codeToGetTokenToLogin +\r\n      '&ReturnUrl=' +\r\n      window.location.protocol +\r\n      '//' +\r\n      window.location.hostname +\r\n      (window.location.hostname === 'localhost' ? ':3000' : '') +\r\n      '/redirect.html',\r\n    'CNN_WindowName',\r\n    strWindowFeatures\r\n  );\r\n}\r\n\r\nexport function removeCharactersFromText(str) {\r\n  let result = '';\r\n  for (let i = 0; i < str.length; i++) {\r\n    let char = str[i];\r\n    if (\r\n      (char === '*' && str[i + 1] === '*') ||\r\n      (char === '_' && str[i + 1] === '_')\r\n    ) {\r\n      i++;\r\n      continue;\r\n    }\r\n    result = result + char;\r\n  }\r\n  return result;\r\n}\r\nexport function getRichText(str) {\r\n  let result = '';\r\n  let key = '';\r\n  for (let i = 0; i < str.length; i++) {\r\n    let char = str[i];\r\n    if (char === '*' && str[i + 1] === '*' && key === '') {\r\n      result = result + '<strong>';\r\n      key = '*';\r\n      i++;\r\n      continue;\r\n    } else if (char === '*' && str[i + 1] === '*' && key === '*') {\r\n      result = result + '</strong>';\r\n      key = '';\r\n      i++;\r\n      continue;\r\n    }\r\n\r\n    if (char === '_' && str[i + 1] === '_' && key === '') {\r\n      result = result + '<span style=\"text-decoration: underline\">';\r\n      key = '_';\r\n      i++;\r\n      continue;\r\n    } else if (char === '_' && str[i + 1] === '_' && key === '_') {\r\n      result = result + '</span>';\r\n      key = '';\r\n      i++;\r\n      continue;\r\n    }\r\n    result = result + char;\r\n  }\r\n\r\n  return result;\r\n}\r\nexport function filterItemsByNew(items) {\r\n  let newResultItems = []; // adding all the items that have the YnNewItem node set to 1\r\n  items.forEach((item) => {\r\n    if (item.YnNewItem && item.YnNewItem === '1') {\r\n      newResultItems.unshift(item);\r\n    } else {\r\n      newResultItems.push(item);\r\n    }\r\n  });\r\n  return newResultItems;\r\n}\r\n\r\nexport function addOfferCategory(list) {\r\n  return [\r\n    {\r\n      ICategoryID: 'ALL',\r\n      SCategoryCode: 'ALL',\r\n      SCategoryDesc: getTexto('All Categories'),\r\n      LsGroup: [\r\n        {\r\n          IGroupID: 999999,\r\n          SGroupCode: 'ALL',\r\n          SGroupDesc: getTexto('All Categories'),\r\n        },\r\n      ],\r\n    },\r\n    ...list,\r\n    {\r\n      ICategoryID: 'OFFER',\r\n      SCategoryCode: 'OFFER',\r\n      SCategoryDesc: 'OFFERS',\r\n      LsGroup: [\r\n        {\r\n          IGroupID: 0,\r\n          SGroupCode: 'OFFER',\r\n          SGroupDesc: 'OFFERS',\r\n        },\r\n      ],\r\n    },\r\n  ];\r\n}\r\n\r\nexport function getOfferPriceDetails(item) {\r\n  let result = {\r\n    priceWDiscount: item.OfferDetail.reduce((a, b) => a.Price + b.Price),\r\n    price: item.OfferDetail.reduce(\r\n      (a, b) => a.Price - a.Discount + b.Price - b.Discount\r\n    ),\r\n    totalDiscount: item.OfferDetail.reduce((a, b) => a.Discount + b.Discount),\r\n  };\r\n  return result;\r\n}\r\n\r\nexport function getDetailsCart(cart) {\r\n  let result = {\r\n    subTotal: 0.0,\r\n    discount10: 0.0, \r\n    discountOffer: 0.0,\r\n    total: 0.0,\r\n  };\r\n  cart.map((item) => {\r\n    if (item.item.isOffer) {\r\n      result.subTotal +=\r\n        parseFloat(item.item.priceDetails.priceWDiscount).toFixed(2) *\r\n        parseFloat(item.totalItems);\r\n      result.discountOffer +=\r\n        parseFloat(item.item.priceDetails.totalDiscount).toFixed(2) *\r\n        parseFloat(item.totalItems);\r\n      result.total +=\r\n        parseFloat(item.item.priceDetails.price).toFixed(2) *\r\n        parseFloat(item.totalItems);\r\n    } else {\r\n      let priceItem =\r\n        parseFloat(item.item.DPrice).toFixed(2) * parseFloat(item.totalItems);\r\n      result.subTotal += priceItem;\r\n      result.discount10 += parseFloat(priceItem).toFixed(2) * getDiscountByTag();\r\n      result.total += priceItem * (1 - getDiscountByTag());\r\n    }\r\n    return true;\r\n  });\r\n  result['totalPrice'] = result.subTotal;\r\n\r\n  return result;\r\n}\r\n\r\nexport function thereIsDiscountByTag(webSection = localStorage.getItem('site') ? localStorage.getItem('site') : \"KSK\" ){\r\n  let discout = true;\r\n  switch(webSection){\r\n    case \"KSK\":  discout = true; break;\r\n    case \"RENTAL\":  discout = false; break;\r\n    case \"SPGIFT\":  discout = false; break;\r\n    default:  discout = false;break\r\n  }\r\n  return discout;\r\n}\r\nexport function getDiscountByTag(webSection = localStorage.getItem('site') ? localStorage.getItem('site') : \"KSK\" ){\r\n  let discout = 0.1;\r\n  switch(webSection){\r\n    case \"KSK\":  discout = 0.1; break;\r\n    case \"RENTAL\":  discout = 0.0; break;\r\n    case \"SPGIFT\":  discout = 0.0; break;\r\n    default:  discout = 0.0;break\r\n  }\r\n  return discout;\r\n}\r\n","import { setCookieForm, getCookieForm } from './cookieManager';\r\nimport {getWebSectionForEndpoint} from \"./helpers\"\r\nexport function SetLanguage(idiom = 'en-US', callback) {\r\n  setCookieForm('Language', idiom);\r\n  window.location.reload();\r\n  setTimeout(() => {\r\n    callback();\r\n  }, 100);\r\n}\r\nexport function getLanguage() {\r\n  return getCookieForm('Language') === '' ? 'en-US' : getCookieForm('Language');\r\n}\r\n\r\nexport function getLanguageEndpoints(domain, devDomain, webSection = 'KSK') {\r\n  let urlEndpoint = '';   \r\n  if (isDev()) {\r\n    //se agrega lenguaje\r\n    urlEndpoint += devDomain;\r\n    urlEndpoint +=\r\n      getCookieForm('Language') === ''\r\n        ? '/'\r\n        : getCookieForm('Language') === 'en-US'\r\n        ? '/'\r\n        : 'ES/';\r\n    urlEndpoint += getWebSectionForEndpoint(webSection) + '/';\r\n    urlEndpoint += 'Shopping';\r\n  } else {\r\n    urlEndpoint += domain;\r\n    urlEndpoint +=\r\n      getCookieForm('Language') === ''\r\n        ? '/'\r\n        : getCookieForm('Language') === 'en-US'\r\n        ? '/'\r\n        : '/es/';\r\n    urlEndpoint += 'RoyalMarket/';\r\n    urlEndpoint += getWebSectionForEndpoint(webSection) + '/';\r\n    urlEndpoint += 'Shopping';\r\n  }\r\n  return urlEndpoint;\r\n}\r\n\r\nexport function isDev() {\r\n  if (window.location.host === 'localhost:3000') {\r\n    return false;\r\n  } else {\r\n    return false;\r\n  }\r\n}\r\n\r\nexport function SetCurrency(cur) {\r\n  setCookieForm('Currency', cur);\r\n}\r\nexport function getCurrency() {\r\n  return getCookieForm('Currency') === '' ? 'MXN' : getCookieForm('Currency');\r\n}\r\n","import { getLanguage } from '../libs/language';\r\n\r\nvar textos = {};\r\n\r\nexport default function getTexto(textoInput) {\r\n  if (getLanguage() === 'en-US') {\r\n    return textoInput;\r\n  } else {\r\n    return textos[textoInput] !== undefined ? textos[textoInput] : textoInput;\r\n  }\r\n}\r\n\r\nexport function setTextToTraslateTool(textResp) {\r\n  textos = {};\r\n  textos = textResp;\r\n}\r\n","import { createSlice, current } from '@reduxjs/toolkit';\r\nimport { getDetailsCart, getWebSectionForEndpoint } from '../libs/helpers';\r\n\r\nexport const cartSlice = createSlice({\r\n  name: 'cart',\r\n  initialState: { itemsCart: [], isShowed: false, loader: false },\r\n  reducers: {\r\n    setLoader: (state, action) => {\r\n      return { ...state, loader: action.payload };\r\n    },\r\n    resetCartItems: (state, action) => {\r\n      let cartSite = localStorage.getItem('site');\r\n      localStorage.setItem(`cart-${cartSite}`, window.btoa(JSON.stringify([])));\r\n      return {\r\n        ...state,\r\n        itemsCart: [],\r\n        itemsCount: 0,\r\n        totalPrice: parseFloat(0.0).toFixed(1),\r\n      };\r\n    },\r\n    fetchCartItems: (state, action) => {\r\n      let iniConfig = action.payload;\r\n      let count = 0;\r\n      let itemsCart = [];\r\n\r\n      let cartSite = localStorage.getItem('site');\r\n      if (localStorage.getItem(`cart-${cartSite}`)) {\r\n        itemsCart = JSON.parse(window.atob(localStorage.getItem(`cart-${cartSite}`)));\r\n        itemsCart.forEach((item) => {\r\n          count = count + 1;\r\n        });\r\n      }\r\n      return {\r\n        ...current(state),\r\n        ini: iniConfig,\r\n        itemsCart: itemsCart,\r\n        itemsCount: count,\r\n        ...getDetailsCart(itemsCart),\r\n      };\r\n    },\r\n    deleteCartItem: (state, action) => {\r\n      let currentState = current(state);\r\n      let codeItem = action.payload;\r\n      let newArray = [];\r\n\r\n      newArray = currentState.itemsCart.filter(\r\n        (i) => i.item.SItemCode !== codeItem\r\n      );\r\n      let cartSite = localStorage.getItem('site');\r\n      localStorage.setItem(`cart-${cartSite}`, window.btoa(JSON.stringify(newArray)));\r\n      return {\r\n        ...currentState,\r\n        itemsCart: newArray,\r\n        itemsCount: newArray.length,\r\n        ...getDetailsCart(newArray),\r\n      };\r\n    },\r\n    setItemToCart: (state, action) => {\r\n      let currentState = current(state);\r\n      let newListItemsCart = [...currentState.itemsCart];\r\n      let newItemToCart = action.payload.item;\r\n      let Exist = false;\r\n\r\n      let newItems = newListItemsCart.map((item) => {\r\n        if (item.item.SItemCode === newItemToCart.SItemCode) {\r\n          Exist = true;\r\n          if (action.payload.onList === true) {\r\n            if (item.item.YnAllowFractionalSale === 1) {\r\n              let totalItems =\r\n                parseFloat(item.totalItems) +\r\n                parseFloat(action.payload.totalItems);\r\n              item = { ...item, totalItems: totalItems };\r\n            } else {\r\n              let totalItems =\r\n                item.totalItems + parseInt(action.payload.totalItems);\r\n              item = { ...item, totalItems: totalItems };\r\n            }\r\n          } else {\r\n            item = { ...item, totalItems: action.payload.totalItems };\r\n          }\r\n        }\r\n        return item;\r\n      });\r\n      newListItemsCart = newItems;\r\n      if (!Exist) {\r\n        newListItemsCart.push(action.payload);\r\n      }\r\n      let cartSite = localStorage.getItem('site');\r\n      localStorage.setItem(\r\n        `cart-${cartSite}`,\r\n        window.btoa(JSON.stringify(newListItemsCart))\r\n      );\r\n\r\n      return {\r\n        ...currentState,\r\n        itemsCart: newListItemsCart,\r\n        itemsCount: newListItemsCart.length,\r\n        ...getDetailsCart(newListItemsCart),\r\n      };\r\n    },\r\n  },\r\n});\r\n\r\nexport const setCartToSessionSync = (obj) => async (dispatch, getState) => {\r\n  dispatch(setLoader(true));\r\n\r\n  let paramForForm = JSON.stringify(obj);\r\n  let user = {};\r\n  if (getState().site.user !== undefined && getState().site.user !== null) {\r\n    user = JSON.stringify({\r\n      Email: getState().site.user.Email,\r\n      FullName: getState().site.user.fullName,\r\n      Name: getState().site.user.FName,\r\n      LastName: getState().site.user.LName1,\r\n    });\r\n  } else {\r\n    user = '';\r\n  }\r\n\r\n  var form = document.createElement('form');\r\n  document.body.appendChild(form);\r\n  var element1 = document.createElement('input');\r\n  var element2 = document.createElement('input');\r\n  form.method = 'POST';\r\n  form.action = `${getState().site.initialConfig.urlAPI}/RoyalMarket/${getWebSectionForEndpoint(\r\n    getState().site.initialConfig.WebSection\r\n  )}/Shopping/InformationPayV2`;\r\n  element1.value = paramForForm;\r\n  element1.name = 'Data';\r\n  element1.type = 'hidden';\r\n  element2.value = user;\r\n  element2.name = 'UserData';\r\n  element2.type = 'hidden';\r\n  form.appendChild(element1);\r\n  form.appendChild(element2);\r\n  dispatch(resetCartItems());\r\n  form.submit();\r\n};\r\n\r\nexport const {\r\n  fetchCartItems,\r\n  setItemToCart,\r\n  deleteCartItem,\r\n  setLoader,\r\n  resetCartItems,\r\n} = cartSlice.actions;\r\nexport const selectItemsCart = (state) => state.cart.itemsCart;\r\nexport default cartSlice.reducer;\r\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 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\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 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 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 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 * @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 * @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\nexport const DEFAULT_ENTRY_NAME = '[DEFAULT]';\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 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 type LogLevelString =\n  | 'debug'\n  | 'verbose'\n  | 'info'\n  | 'warn'\n  | 'error'\n  | 'silent';\n\nexport interface LogOptions {\n  level: LogLevelString;\n}\n\nexport type LogCallback = (callbackParams: LogCallbackParams) => void;\n\nexport interface LogCallbackParams {\n  level: LogLevelString;\n  message: string;\n  args: unknown[];\n  type: string;\n}\n\n/**\n * A container for all of the Logger instances\n */\nexport const instances: Logger[] = [];\n\n/**\n * The JS SDK supports 5 log levels and also allows a user the ability to\n * silence the logs altogether.\n *\n * The order is a follows:\n * DEBUG < VERBOSE < INFO < WARN < ERROR\n *\n * All of the log types above the current log level will be captured (i.e. if\n * you set the log level to `INFO`, errors will still be logged, but `DEBUG` and\n * `VERBOSE` logs will not)\n */\nexport enum LogLevel {\n  DEBUG,\n  VERBOSE,\n  INFO,\n  WARN,\n  ERROR,\n  SILENT\n}\n\nconst levelStringToEnum: { [key in LogLevelString]: LogLevel } = {\n  'debug': LogLevel.DEBUG,\n  'verbose': LogLevel.VERBOSE,\n  'info': LogLevel.INFO,\n  'warn': LogLevel.WARN,\n  'error': LogLevel.ERROR,\n  'silent': LogLevel.SILENT\n};\n\n/**\n * The default log level\n */\nconst defaultLogLevel: LogLevel = LogLevel.INFO;\n\n/**\n * We allow users the ability to pass their own log handler. We will pass the\n * type of log, the current log level, and any other arguments passed (i.e. the\n * messages that the user wants to log) to this function.\n */\nexport type LogHandler = (\n  loggerInstance: Logger,\n  logType: LogLevel,\n  ...args: unknown[]\n) => void;\n\n/**\n * By default, `console.debug` is not displayed in the developer console (in\n * chrome). To avoid forcing users to have to opt-in to these logs twice\n * (i.e. once for firebase, and once in the console), we are sending `DEBUG`\n * logs to the `console.log` function.\n */\nconst ConsoleMethod = {\n  [LogLevel.DEBUG]: 'log',\n  [LogLevel.VERBOSE]: 'log',\n  [LogLevel.INFO]: 'info',\n  [LogLevel.WARN]: 'warn',\n  [LogLevel.ERROR]: 'error'\n};\n\n/**\n * The default log handler will forward DEBUG, VERBOSE, INFO, WARN, and ERROR\n * messages on to their corresponding console counterparts (if the log method\n * is supported by the current log level)\n */\nconst defaultLogHandler: LogHandler = (instance, logType, ...args): void => {\n  if (logType < instance.logLevel) {\n    return;\n  }\n  const now = new Date().toISOString();\n  const method = ConsoleMethod[logType as keyof typeof ConsoleMethod];\n  if (method) {\n    console[method as 'log' | 'info' | 'warn' | 'error'](\n      `[${now}]  ${instance.name}:`,\n      ...args\n    );\n  } else {\n    throw new Error(\n      `Attempted to log a message with an invalid logType (value: ${logType})`\n    );\n  }\n};\n\nexport class Logger {\n  /**\n   * Gives you an instance of a Logger to capture messages according to\n   * Firebase's logging scheme.\n   *\n   * @param name The name that the logs will be associated with\n   */\n  constructor(public name: string) {\n    /**\n     * Capture the current instance for later use\n     */\n    instances.push(this);\n  }\n\n  /**\n   * The log level of the given Logger instance.\n   */\n  private _logLevel = defaultLogLevel;\n\n  get logLevel(): LogLevel {\n    return this._logLevel;\n  }\n\n  set logLevel(val: LogLevel) {\n    if (!(val in LogLevel)) {\n      throw new TypeError(`Invalid value \"${val}\" assigned to \\`logLevel\\``);\n    }\n    this._logLevel = val;\n  }\n\n  // Workaround for setter/getter having to be the same type.\n  setLogLevel(val: LogLevel | LogLevelString): void {\n    this._logLevel = typeof val === 'string' ? levelStringToEnum[val] : val;\n  }\n\n  /**\n   * The main (internal) log handler for the Logger instance.\n   * Can be set to a new function in internal package code but not by user.\n   */\n  private _logHandler: LogHandler = defaultLogHandler;\n  get logHandler(): LogHandler {\n    return this._logHandler;\n  }\n  set logHandler(val: LogHandler) {\n    if (typeof val !== 'function') {\n      throw new TypeError('Value assigned to `logHandler` must be a function');\n    }\n    this._logHandler = val;\n  }\n\n  /**\n   * The optional, additional, user-defined log handler for the Logger instance.\n   */\n  private _userLogHandler: LogHandler | null = null;\n  get userLogHandler(): LogHandler | null {\n    return this._userLogHandler;\n  }\n  set userLogHandler(val: LogHandler | null) {\n    this._userLogHandler = val;\n  }\n\n  /**\n   * The functions below are all based on the `console` interface\n   */\n\n  debug(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.DEBUG, ...args);\n    this._logHandler(this, LogLevel.DEBUG, ...args);\n  }\n  log(...args: unknown[]): void {\n    this._userLogHandler &&\n      this._userLogHandler(this, LogLevel.VERBOSE, ...args);\n    this._logHandler(this, LogLevel.VERBOSE, ...args);\n  }\n  info(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.INFO, ...args);\n    this._logHandler(this, LogLevel.INFO, ...args);\n  }\n  warn(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.WARN, ...args);\n    this._logHandler(this, LogLevel.WARN, ...args);\n  }\n  error(...args: unknown[]): void {\n    this._userLogHandler && this._userLogHandler(this, LogLevel.ERROR, ...args);\n    this._logHandler(this, LogLevel.ERROR, ...args);\n  }\n}\n\nexport function setLogLevel(level: LogLevelString | LogLevel): void {\n  instances.forEach(inst => {\n    inst.setLogLevel(level);\n  });\n}\n\nexport function setUserLogHandler(\n  logCallback: LogCallback | null,\n  options?: LogOptions\n): void {\n  for (const instance of instances) {\n    let customLogLevel: LogLevel | null = null;\n    if (options && options.level) {\n      customLogLevel = levelStringToEnum[options.level];\n    }\n    if (logCallback === null) {\n      instance.userLogHandler = null;\n    } else {\n      instance.userLogHandler = (\n        instance: Logger,\n        level: LogLevel,\n        ...args: unknown[]\n      ) => {\n        const message = args\n          .map(arg => {\n            if (arg == null) {\n              return null;\n            } else if (typeof arg === 'string') {\n              return arg;\n            } else if (typeof arg === 'number' || typeof arg === 'boolean') {\n              return arg.toString();\n            } else if (arg instanceof Error) {\n              return arg.message;\n            } else {\n              try {\n                return JSON.stringify(arg);\n              } catch (ignored) {\n                return null;\n              }\n            }\n          })\n          .filter(arg => arg)\n          .join(' ');\n        if (level >= (customLogLevel ?? instance.logLevel)) {\n          logCallback({\n            level: LogLevel[level].toLowerCase() as LogLevelString,\n            message,\n            args,\n            type: instance.name\n          });\n        }\n      };\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 dataconnectName } from '../../../packages/data-connect/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  [dataconnectName]: 'fire-data-connect',\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 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\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\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 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 * @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 * 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","import { initializeApp } from 'firebase/app';\r\n\r\nimport { getDatabase } from 'firebase/database';\r\n\r\nconst firebaseConfig = {\r\n  apiKey: 'AIzaSyAdKhSDpqKCSs1Pca4i4Ps_RPX3X4wLkUA',\r\n  authDomain: 'royalmarket.firebaseapp.com',\r\n  databaseURL: 'https://royalmarket-default-rtdb.firebaseio.com',\r\n  projectId: 'royalmarket',\r\n  storageBucket: 'royalmarket.appspot.com',\r\n  messagingSenderId: '725308466421',\r\n  appId: '1:725308466421:web:8602fa811ec5a533e351bc',\r\n};\r\n\r\ninitializeApp(firebaseConfig);\r\nvar db = getDatabase();\r\n\r\nexport function getDBConection() {\r\n  return db;\r\n}\r\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","import { createSlice } from '@reduxjs/toolkit';\r\nimport { getLanguage } from '../libs/language';\r\nimport { getDBConection } from '../libs/firebaseApi';\r\nimport { ref, get } from 'firebase/database';\r\nimport { setCookieForm, deleteCookieForm } from '../libs/cookieManager';\r\n\r\nexport const siteSlice = createSlice({\r\n  name: 'site',\r\n  initialState: {\r\n    items: [],\r\n    user: undefined,\r\n    language: getLanguage(),\r\n    qp: '',\r\n  },\r\n  reducers: {\r\n    setQP: (state, action) => {\r\n      let qp = action.payload;\r\n\r\n      return {\r\n        ...state,\r\n        qp: qp,\r\n      };\r\n    },\r\n    setItems: (state, action) => {\r\n      let newItems = action.payload ? action.payload : [];\r\n      return { ...state, items: newItems };\r\n    },\r\n    setUserGenesis: (state, action) => {\r\n      return state;\r\n    },\r\n    setConfigurationFetched: (state, action) => {\r\n      let config = action.payload;\r\n    \r\n      let lan = getLanguage();\r\n\r\n      if (lan === 'en-US') {\r\n\r\n        config.contenido = config.contenido.en;\r\n        \r\n      } else {\r\n        config.contenido = config.contenido.es;\r\n      }\r\n      return {\r\n        ...state,\r\n        configuration: { ...config, language: lan },\r\n      };\r\n    },\r\n    initConfig: (state, action) => {\r\n      return {\r\n        ...state,\r\n        initialConfig: action.payload,\r\n        user: null,\r\n      };\r\n    },\r\n    fetchUser: (state, action)=>{\r\n      console.log(\"fetchUser\");\r\n\r\n      if (localStorage.getItem('user') === \"null\" || localStorage.getItem('user') === null) {\r\n        console.log(\"No se ha encontrado ningún usuario en localStorage.\");\r\n        return {\r\n            ...state,\r\n        };\r\n    } else {\r\n        const user = localStorage.getItem('user');\r\n        console.log(\"Usuario encontrado en localStorage:\", user);\r\n        \r\n        try {\r\n            // Decodificando y parseando el usuario desde Base64\r\n            let user1 = JSON.parse(window.atob(user));\r\n            console.log(\"Usuario decodificado:\", user1);\r\n            \r\n            return {\r\n                ...state,\r\n                user: user1,\r\n            };\r\n        } catch (error) {\r\n            console.error(\"Error al decodificar el usuario desde localStorage:\", error);\r\n            return {\r\n                ...state,\r\n            };\r\n        }\r\n    }\r\n    \r\n    },\r\n    setUserFromGenesis: (state, action) => {\r\n      //guardamos el token en un cookie\r\n      \r\n      setCookieForm('user', action.payload.userToken, getLanguage());\r\n      //guardamos el user con el token en localstorage para evitar la llamada en cada recarga\r\n      \r\n      localStorage.setItem('user', window.btoa(JSON.stringify(action.payload)));\r\n      //seteamos el nuevo state de la aplicacion\r\n      return {\r\n        ...state,\r\n        user: action.payload,\r\n      };\r\n    },\r\n    logoutUser: (state, action) => {\r\n      deleteCookieForm('user', getLanguage());\r\n      localStorage.setItem('user', null);\r\n      return {\r\n        ...state,\r\n        user: undefined,\r\n      };\r\n    },\r\n  },\r\n});\r\n\r\nexport const fetchConfiguration = (site) => async (dispatch) => {\r\n  get(ref(getDBConection(), '/configuration/' + site))\r\n    .then((snapshot) => {\r\n      const data = snapshot.val();\r\n      dispatch(setConfigurationFetched(data));\r\n    })\r\n    .catch((error) => {\r\n      console.error(error);\r\n    });\r\n};\r\n\r\nexport const setUserFromGenesisAsync = (user) => async (dispatch, getState) => {\r\n  if (\r\n    localStorage.getItem('user') &&\r\n    localStorage.getItem('user') !== '' &&\r\n    localStorage.getItem('user') !== null &&\r\n    localStorage.getItem('user') !== 'null'\r\n  ) {\r\n    let User =JSON.parse( window.atob(localStorage.getItem('user')));\r\n    \r\n    \r\n    if (User.userToken === user) {\r\n      // llamamos a genesis si el usario no esta en localstorage\r\n      dispatch(setUserFromGenesis({ ...User, userToken: user }));\r\n    }\r\n  }\r\n\r\n  // \"loginUser\": \"2leJvJJFkiQ=\",\r\n  // \"loginPassword\": \"nlzufEFcsxzn5xsb6HFtGA==\",\r\n  let url = `${getState().site.initialConfig.urlLogin}?strUserName=2leJvJJFkiQ=&strPassword=nlzufEFcsxzn5xsb6HFtGA==&strToken=${user}`;\r\n\r\n\r\n  try {\r\n    let response = await fetch(url);\r\n    if (response.ok) {  // Verifica si la solicitud fue exitosa\r\n\r\n\r\n     \r\n      let text = await response.text();  //  como texto\r\n      let parser = new DOMParser();  // la instancia \r\n      let xmlDoc = parser.parseFromString(text, \"application/xml\");  // Parsear \r\n  \r\n      // Acceder a los datos dentro del XML y verificamos que el result sea 1\r\n      let intResult = xmlDoc.querySelector(\"intResult\").textContent;\r\n      let strResult = xmlDoc.querySelector(\"strResult\").textContent; \r\n        if(intResult===\"1\")\r\n        {\r\n          console.log(\"strResult:\", strResult); \r\n         // let pkPeopleID = xmlDoc.querySelector(\"pkPeopleID\").textContent;  \r\n          let pkPeopleID = xmlDoc.querySelector(\"pkPeopleID\").textContent.length > 0\r\n            ?  xmlDoc.querySelector(\"pkPeopleID\").textContent : '';\r\n          let FName = xmlDoc.querySelector(\"FName\").textContent; \r\n          //let MName = xmlDoc.querySelector(\"MName\").textContent; \r\n          let MName = xmlDoc.querySelector(\"MName\").textContent.length > 0\r\n              ? xmlDoc.querySelector(\"MName\").textContent : '';\r\n          let LName1 =xmlDoc.querySelector(\"LName1\").textContent.length > 0\r\n              ?  xmlDoc.querySelector(\"LName1\").textContent: '';\r\n          let LName2 = xmlDoc.querySelector(\"LName1\").textContent.length > 0\r\n                ? xmlDoc.querySelector(\"LName1\").textContent : '';\r\n          let fullName = xmlDoc.querySelector(\"fullName\").textContent.length > 0\r\n              ? xmlDoc.querySelector(\"fullName\").textContent : '';\r\n          let GuestType = xmlDoc.querySelector(\"GuestType\").textContent.length > 0\r\n              ? xmlDoc.querySelector(\"GuestType\").textContent : '';\r\n          let Email = xmlDoc.querySelector(\"Email\").textContent.length > 0\r\n              ? xmlDoc.querySelector(\"Email\").textContent : '';\r\n          let UserObject = {\r\n                pkPeopleID,\r\n                FName,\r\n                MName,\r\n                LName1,\r\n                LName2,\r\n                fullName,\r\n                GuestType,\r\n                Email,\r\n              };\r\n           \r\n          dispatch(setUserFromGenesis({ ...UserObject, userToken: user }));\r\n          //Fetichng the user´s last purchases [START]\r\n      \r\n       \r\n        \r\n        }\r\n      \r\n\r\n      } \r\n      \r\n      else {\r\n        console.error(\"Error en la solicitud:\", response.status);  // Maneja errores si la solicitud falla\r\n      }\r\n  \r\n\r\n    //window.xmlDoc = xmlDoc;\r\n    \r\n   /* if (xmlDoc.getElementsByTagName('intResult')[0]) {\r\n\r\n   \r\n      \r\n      if (xmlDoc.getElementsByTagName('intResult')[0].childNodes[0]) {\r\n        if (\r\n          parseInt(\r\n            xmlDoc.getElementsByTagName('intResult')[0].childNodes[0].nodeValue\r\n          ) === 1\r\n        ) {\r\n          let pkPeopleID =\r\n            xmlDoc.getElementsByTagName('pkPeopleID')[0].childNodes.length > 0\r\n              ? xmlDoc.getElementsByTagName('pkPeopleID')[0].childNodes[0]\r\n                  .nodeValue\r\n              : '';\r\n          let FName =\r\n            xmlDoc.getElementsByTagName('FName')[0].childNodes[0].nodeValue;\r\n          let MName =\r\n            xmlDoc.getElementsByTagName('MName')[0].childNodes.length > 0\r\n              ? xmlDoc.getElementsByTagName('MName')[0].childNodes[0].nodeValue\r\n              : '';\r\n          let LName1 =\r\n            xmlDoc.getElementsByTagName('LName1')[0].childNodes.length > 0\r\n              ? xmlDoc.getElementsByTagName('LName1')[0].childNodes[0].nodeValue\r\n              : '';\r\n          let LName2 =\r\n            xmlDoc.getElementsByTagName('LName2')[0].childNodes.length > 0\r\n              ? xmlDoc.getElementsByTagName('LName2')[0].childNodes[0].nodeValue\r\n              : '';\r\n\r\n          let fullName =\r\n            xmlDoc.getElementsByTagName('fullName')[0].childNodes.length > 0\r\n              ? xmlDoc.getElementsByTagName('fullName')[0].childNodes[0]\r\n                  .nodeValue\r\n              : '';\r\n          let GuestType =\r\n            xmlDoc.getElementsByTagName('GuestType')[0].childNodes.length > 0\r\n              ? xmlDoc.getElementsByTagName('GuestType')[0].childNodes[0]\r\n                  .nodeValue\r\n              : '';\r\n          let Email =\r\n            xmlDoc.getElementsByTagName('Email')[0].childNodes.length > 0\r\n              ? xmlDoc.getElementsByTagName('Email')[0].childNodes[0].nodeValue\r\n              : '';\r\n          let UserObject = {\r\n            pkPeopleID,\r\n            FName,\r\n            MName,\r\n            LName1,\r\n            LName2,\r\n            fullName,\r\n            GuestType,\r\n            Email,\r\n          };\r\n\r\n          dispatch(setUserFromGenesis({ ...UserObject, userToken: user }));\r\n\r\n          //Fetichng the user´s last purchases [START]\r\n          let urlShoppingHistory = `${getState().site.initialConfig.urlAPI}/${\r\n            getState().site.initialConfig.WebSection\r\n          }/Shopping/getItemRelated?iPeopleID=${pkPeopleID}`;\r\n          let lastPurchases = await fetch(urlShoppingHistory);\r\n          let purchasesResponse = lastPurchases.data;\r\n          let newUser = { ...UserObject, itemsHistory: purchasesResponse };\r\n          dispatch(setUserFromGenesis({ ...newUser, userToken: user }));\r\n          //Fetichng the user´s last purchases [FINAL]\r\n        }\r\n      }\r\n    }*/\r\n  } catch (error) {\r\n    dispatch(setUserFromGenesis({ data: error, user: user }));\r\n  }\r\n};\r\n\r\nexport const {\r\n  setItems,\r\n  setConfigurationFetched,\r\n  initConfig,\r\n  setUserFromGenesis,\r\n  logoutUser,\r\n  setQP,\r\n  fetchUser,\r\n} = siteSlice.actions;\r\n\r\n// in the slice file. For example: `useSelector((state) => state.counter.value)`\r\nexport const selectItems = (state) => state.site.items;\r\n\r\nexport default siteSlice.reducer;\r\n","////////////////////////////////////////////////////////////////////////////////\n//#region Types and Constants\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * Actions represent the type of change to a location value.\n */\nexport enum Action {\n  /**\n   * A POP indicates a change to an arbitrary index in the history stack, such\n   * as a back or forward navigation. It does not describe the direction of the\n   * navigation, only that the current index changed.\n   *\n   * Note: This is the default action for newly created history objects.\n   */\n  Pop = \"POP\",\n\n  /**\n   * A PUSH indicates a new entry being added to the history stack, such as when\n   * a link is clicked and a new page loads. When this happens, all subsequent\n   * entries in the stack are lost.\n   */\n  Push = \"PUSH\",\n\n  /**\n   * A REPLACE indicates the entry at the current index in the history stack\n   * being replaced by a new one.\n   */\n  Replace = \"REPLACE\",\n}\n\n/**\n * The pathname, search, and hash values of a URL.\n */\nexport interface Path {\n  /**\n   * A URL pathname, beginning with a /.\n   */\n  pathname: string;\n\n  /**\n   * A URL search string, beginning with a ?.\n   */\n  search: string;\n\n  /**\n   * A URL fragment identifier, beginning with a #.\n   */\n  hash: string;\n}\n\n// TODO: (v7) Change the Location generic default from `any` to `unknown` and\n// remove Remix `useLocation` wrapper.\n\n/**\n * An entry in a history stack. A location contains information about the\n * URL path, as well as possibly some arbitrary state and a key.\n */\nexport interface Location<State = any> extends Path {\n  /**\n   * A value of arbitrary data associated with this location.\n   */\n  state: State;\n\n  /**\n   * A unique string associated with this location. May be used to safely store\n   * and retrieve data in some other storage API, like `localStorage`.\n   *\n   * Note: This value is always \"default\" on the initial location.\n   */\n  key: string;\n}\n\n/**\n * A change to the current location.\n */\nexport interface Update {\n  /**\n   * The action that triggered the change.\n   */\n  action: Action;\n\n  /**\n   * The new location.\n   */\n  location: Location;\n\n  /**\n   * The delta between this location and the former location in the history stack\n   */\n  delta: number | null;\n}\n\n/**\n * A function that receives notifications about location changes.\n */\nexport interface Listener {\n  (update: Update): void;\n}\n\n/**\n * Describes a location that is the destination of some navigation, either via\n * `history.push` or `history.replace`. This may be either a URL or the pieces\n * of a URL path.\n */\nexport type To = string | Partial<Path>;\n\n/**\n * A history is an interface to the navigation stack. The history serves as the\n * source of truth for the current location, as well as provides a set of\n * methods that may be used to change it.\n *\n * It is similar to the DOM's `window.history` object, but with a smaller, more\n * focused API.\n */\nexport interface History {\n  /**\n   * The last action that modified the current location. This will always be\n   * Action.Pop when a history instance is first created. This value is mutable.\n   */\n  readonly action: Action;\n\n  /**\n   * The current location. This value is mutable.\n   */\n  readonly location: Location;\n\n  /**\n   * Returns a valid href for the given `to` value that may be used as\n   * the value of an <a href> attribute.\n   *\n   * @param to - The destination URL\n   */\n  createHref(to: To): string;\n\n  /**\n   * Returns a URL for the given `to` value\n   *\n   * @param to - The destination URL\n   */\n  createURL(to: To): URL;\n\n  /**\n   * Encode a location the same way window.history would do (no-op for memory\n   * history) so we ensure our PUSH/REPLACE navigations for data routers\n   * behave the same as POP\n   *\n   * @param to Unencoded path\n   */\n  encodeLocation(to: To): Path;\n\n  /**\n   * Pushes a new location onto the history stack, increasing its length by one.\n   * If there were any entries in the stack after the current one, they are\n   * lost.\n   *\n   * @param to - The new URL\n   * @param state - Data to associate with the new location\n   */\n  push(to: To, state?: any): void;\n\n  /**\n   * Replaces the current location in the history stack with a new one.  The\n   * location that was replaced will no longer be available.\n   *\n   * @param to - The new URL\n   * @param state - Data to associate with the new location\n   */\n  replace(to: To, state?: any): void;\n\n  /**\n   * Navigates `n` entries backward/forward in the history stack relative to the\n   * current index. For example, a \"back\" navigation would use go(-1).\n   *\n   * @param delta - The delta in the stack index\n   */\n  go(delta: number): void;\n\n  /**\n   * Sets up a listener that will be called whenever the current location\n   * changes.\n   *\n   * @param listener - A function that will be called when the location changes\n   * @returns unlisten - A function that may be used to stop listening\n   */\n  listen(listener: Listener): () => void;\n}\n\ntype HistoryState = {\n  usr: any;\n  key?: string;\n  idx: number;\n};\n\nconst PopStateEventType = \"popstate\";\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Memory History\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A user-supplied object that describes a location. Used when providing\n * entries to `createMemoryHistory` via its `initialEntries` option.\n */\nexport type InitialEntry = string | Partial<Location>;\n\nexport type MemoryHistoryOptions = {\n  initialEntries?: InitialEntry[];\n  initialIndex?: number;\n  v5Compat?: boolean;\n};\n\n/**\n * A memory history stores locations in memory. This is useful in stateful\n * environments where there is no web browser, such as node tests or React\n * Native.\n */\nexport interface MemoryHistory extends History {\n  /**\n   * The current index in the history stack.\n   */\n  readonly index: number;\n}\n\n/**\n * Memory history stores the current location in memory. It is designed for use\n * in stateful non-browser environments like tests and React Native.\n */\nexport function createMemoryHistory(\n  options: MemoryHistoryOptions = {}\n): MemoryHistory {\n  let { initialEntries = [\"/\"], initialIndex, v5Compat = false } = options;\n  let entries: Location[]; // Declare so we can access from createMemoryLocation\n  entries = initialEntries.map((entry, index) =>\n    createMemoryLocation(\n      entry,\n      typeof entry === \"string\" ? null : entry.state,\n      index === 0 ? \"default\" : undefined\n    )\n  );\n  let index = clampIndex(\n    initialIndex == null ? entries.length - 1 : initialIndex\n  );\n  let action = Action.Pop;\n  let listener: Listener | null = null;\n\n  function clampIndex(n: number): number {\n    return Math.min(Math.max(n, 0), entries.length - 1);\n  }\n  function getCurrentLocation(): Location {\n    return entries[index];\n  }\n  function createMemoryLocation(\n    to: To,\n    state: any = null,\n    key?: string\n  ): Location {\n    let location = createLocation(\n      entries ? getCurrentLocation().pathname : \"/\",\n      to,\n      state,\n      key\n    );\n    warning(\n      location.pathname.charAt(0) === \"/\",\n      `relative pathnames are not supported in memory history: ${JSON.stringify(\n        to\n      )}`\n    );\n    return location;\n  }\n\n  function createHref(to: To) {\n    return typeof to === \"string\" ? to : createPath(to);\n  }\n\n  let history: MemoryHistory = {\n    get index() {\n      return index;\n    },\n    get action() {\n      return action;\n    },\n    get location() {\n      return getCurrentLocation();\n    },\n    createHref,\n    createURL(to) {\n      return new URL(createHref(to), \"http://localhost\");\n    },\n    encodeLocation(to: To) {\n      let path = typeof to === \"string\" ? parsePath(to) : to;\n      return {\n        pathname: path.pathname || \"\",\n        search: path.search || \"\",\n        hash: path.hash || \"\",\n      };\n    },\n    push(to, state) {\n      action = Action.Push;\n      let nextLocation = createMemoryLocation(to, state);\n      index += 1;\n      entries.splice(index, entries.length, nextLocation);\n      if (v5Compat && listener) {\n        listener({ action, location: nextLocation, delta: 1 });\n      }\n    },\n    replace(to, state) {\n      action = Action.Replace;\n      let nextLocation = createMemoryLocation(to, state);\n      entries[index] = nextLocation;\n      if (v5Compat && listener) {\n        listener({ action, location: nextLocation, delta: 0 });\n      }\n    },\n    go(delta) {\n      action = Action.Pop;\n      let nextIndex = clampIndex(index + delta);\n      let nextLocation = entries[nextIndex];\n      index = nextIndex;\n      if (listener) {\n        listener({ action, location: nextLocation, delta });\n      }\n    },\n    listen(fn: Listener) {\n      listener = fn;\n      return () => {\n        listener = null;\n      };\n    },\n  };\n\n  return history;\n}\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Browser History\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A browser history stores the current location in regular URLs in a web\n * browser environment. This is the standard for most web apps and provides the\n * cleanest URLs the browser's address bar.\n *\n * @see https://github.com/remix-run/history/tree/main/docs/api-reference.md#browserhistory\n */\nexport interface BrowserHistory extends UrlHistory {}\n\nexport type BrowserHistoryOptions = UrlHistoryOptions;\n\n/**\n * Browser history stores the location in regular URLs. This is the standard for\n * most web apps, but it requires some configuration on the server to ensure you\n * serve the same app at multiple URLs.\n *\n * @see https://github.com/remix-run/history/tree/main/docs/api-reference.md#createbrowserhistory\n */\nexport function createBrowserHistory(\n  options: BrowserHistoryOptions = {}\n): BrowserHistory {\n  function createBrowserLocation(\n    window: Window,\n    globalHistory: Window[\"history\"]\n  ) {\n    let { pathname, search, hash } = window.location;\n    return createLocation(\n      \"\",\n      { pathname, search, hash },\n      // state defaults to `null` because `window.history.state` does\n      (globalHistory.state && globalHistory.state.usr) || null,\n      (globalHistory.state && globalHistory.state.key) || \"default\"\n    );\n  }\n\n  function createBrowserHref(window: Window, to: To) {\n    return typeof to === \"string\" ? to : createPath(to);\n  }\n\n  return getUrlBasedHistory(\n    createBrowserLocation,\n    createBrowserHref,\n    null,\n    options\n  );\n}\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Hash History\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A hash history stores the current location in the fragment identifier portion\n * of the URL in a web browser environment.\n *\n * This is ideal for apps that do not control the server for some reason\n * (because the fragment identifier is never sent to the server), including some\n * shared hosting environments that do not provide fine-grained controls over\n * which pages are served at which URLs.\n *\n * @see https://github.com/remix-run/history/tree/main/docs/api-reference.md#hashhistory\n */\nexport interface HashHistory extends UrlHistory {}\n\nexport type HashHistoryOptions = UrlHistoryOptions;\n\n/**\n * Hash history stores the location in window.location.hash. This makes it ideal\n * for situations where you don't want to send the location to the server for\n * some reason, either because you do cannot configure it or the URL space is\n * reserved for something else.\n *\n * @see https://github.com/remix-run/history/tree/main/docs/api-reference.md#createhashhistory\n */\nexport function createHashHistory(\n  options: HashHistoryOptions = {}\n): HashHistory {\n  function createHashLocation(\n    window: Window,\n    globalHistory: Window[\"history\"]\n  ) {\n    let {\n      pathname = \"/\",\n      search = \"\",\n      hash = \"\",\n    } = parsePath(window.location.hash.substr(1));\n\n    // Hash URL should always have a leading / just like window.location.pathname\n    // does, so if an app ends up at a route like /#something then we add a\n    // leading slash so all of our path-matching behaves the same as if it would\n    // in a browser router.  This is particularly important when there exists a\n    // root splat route (<Route path=\"*\">) since that matches internally against\n    // \"/*\" and we'd expect /#something to 404 in a hash router app.\n    if (!pathname.startsWith(\"/\") && !pathname.startsWith(\".\")) {\n      pathname = \"/\" + pathname;\n    }\n\n    return createLocation(\n      \"\",\n      { pathname, search, hash },\n      // state defaults to `null` because `window.history.state` does\n      (globalHistory.state && globalHistory.state.usr) || null,\n      (globalHistory.state && globalHistory.state.key) || \"default\"\n    );\n  }\n\n  function createHashHref(window: Window, to: To) {\n    let base = window.document.querySelector(\"base\");\n    let href = \"\";\n\n    if (base && base.getAttribute(\"href\")) {\n      let url = window.location.href;\n      let hashIndex = url.indexOf(\"#\");\n      href = hashIndex === -1 ? url : url.slice(0, hashIndex);\n    }\n\n    return href + \"#\" + (typeof to === \"string\" ? to : createPath(to));\n  }\n\n  function validateHashLocation(location: Location, to: To) {\n    warning(\n      location.pathname.charAt(0) === \"/\",\n      `relative pathnames are not supported in hash history.push(${JSON.stringify(\n        to\n      )})`\n    );\n  }\n\n  return getUrlBasedHistory(\n    createHashLocation,\n    createHashHref,\n    validateHashLocation,\n    options\n  );\n}\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region UTILS\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * @private\n */\nexport function invariant(value: boolean, message?: string): asserts value;\nexport function invariant<T>(\n  value: T | null | undefined,\n  message?: string\n): asserts value is T;\nexport function invariant(value: any, message?: string) {\n  if (value === false || value === null || typeof value === \"undefined\") {\n    throw new Error(message);\n  }\n}\n\nexport function warning(cond: any, message: string) {\n  if (!cond) {\n    // eslint-disable-next-line no-console\n    if (typeof console !== \"undefined\") console.warn(message);\n\n    try {\n      // Welcome to debugging history!\n      //\n      // This error is thrown as a convenience, so you can more easily\n      // find the source for a warning that appears in the console by\n      // enabling \"pause on exceptions\" in your JavaScript debugger.\n      throw new Error(message);\n      // eslint-disable-next-line no-empty\n    } catch (e) {}\n  }\n}\n\nfunction createKey() {\n  return Math.random().toString(36).substr(2, 8);\n}\n\n/**\n * For browser-based histories, we combine the state and key into an object\n */\nfunction getHistoryState(location: Location, index: number): HistoryState {\n  return {\n    usr: location.state,\n    key: location.key,\n    idx: index,\n  };\n}\n\n/**\n * Creates a Location object with a unique key from the given Path\n */\nexport function createLocation(\n  current: string | Location,\n  to: To,\n  state: any = null,\n  key?: string\n): Readonly<Location> {\n  let location: Readonly<Location> = {\n    pathname: typeof current === \"string\" ? current : current.pathname,\n    search: \"\",\n    hash: \"\",\n    ...(typeof to === \"string\" ? parsePath(to) : to),\n    state,\n    // TODO: This could be cleaned up.  push/replace should probably just take\n    // full Locations now and avoid the need to run through this flow at all\n    // But that's a pretty big refactor to the current test suite so going to\n    // keep as is for the time being and just let any incoming keys take precedence\n    key: (to && (to as Location).key) || key || createKey(),\n  };\n  return location;\n}\n\n/**\n * Creates a string URL path from the given pathname, search, and hash components.\n */\nexport function createPath({\n  pathname = \"/\",\n  search = \"\",\n  hash = \"\",\n}: Partial<Path>) {\n  if (search && search !== \"?\")\n    pathname += search.charAt(0) === \"?\" ? search : \"?\" + search;\n  if (hash && hash !== \"#\")\n    pathname += hash.charAt(0) === \"#\" ? hash : \"#\" + hash;\n  return pathname;\n}\n\n/**\n * Parses a string URL path into its separate pathname, search, and hash components.\n */\nexport function parsePath(path: string): Partial<Path> {\n  let parsedPath: Partial<Path> = {};\n\n  if (path) {\n    let hashIndex = path.indexOf(\"#\");\n    if (hashIndex >= 0) {\n      parsedPath.hash = path.substr(hashIndex);\n      path = path.substr(0, hashIndex);\n    }\n\n    let searchIndex = path.indexOf(\"?\");\n    if (searchIndex >= 0) {\n      parsedPath.search = path.substr(searchIndex);\n      path = path.substr(0, searchIndex);\n    }\n\n    if (path) {\n      parsedPath.pathname = path;\n    }\n  }\n\n  return parsedPath;\n}\n\nexport interface UrlHistory extends History {}\n\nexport type UrlHistoryOptions = {\n  window?: Window;\n  v5Compat?: boolean;\n};\n\nfunction getUrlBasedHistory(\n  getLocation: (window: Window, globalHistory: Window[\"history\"]) => Location,\n  createHref: (window: Window, to: To) => string,\n  validateLocation: ((location: Location, to: To) => void) | null,\n  options: UrlHistoryOptions = {}\n): UrlHistory {\n  let { window = document.defaultView!, v5Compat = false } = options;\n  let globalHistory = window.history;\n  let action = Action.Pop;\n  let listener: Listener | null = null;\n\n  let index = getIndex()!;\n  // Index should only be null when we initialize. If not, it's because the\n  // user called history.pushState or history.replaceState directly, in which\n  // case we should log a warning as it will result in bugs.\n  if (index == null) {\n    index = 0;\n    globalHistory.replaceState({ ...globalHistory.state, idx: index }, \"\");\n  }\n\n  function getIndex(): number {\n    let state = globalHistory.state || { idx: null };\n    return state.idx;\n  }\n\n  function handlePop() {\n    action = Action.Pop;\n    let nextIndex = getIndex();\n    let delta = nextIndex == null ? null : nextIndex - index;\n    index = nextIndex;\n    if (listener) {\n      listener({ action, location: history.location, delta });\n    }\n  }\n\n  function push(to: To, state?: any) {\n    action = Action.Push;\n    let location = createLocation(history.location, to, state);\n    if (validateLocation) validateLocation(location, to);\n\n    index = getIndex() + 1;\n    let historyState = getHistoryState(location, index);\n    let url = history.createHref(location);\n\n    // try...catch because iOS limits us to 100 pushState calls :/\n    try {\n      globalHistory.pushState(historyState, \"\", url);\n    } catch (error) {\n      // If the exception is because `state` can't be serialized, let that throw\n      // outwards just like a replace call would so the dev knows the cause\n      // https://html.spec.whatwg.org/multipage/nav-history-apis.html#shared-history-push/replace-state-steps\n      // https://html.spec.whatwg.org/multipage/structured-data.html#structuredserializeinternal\n      if (error instanceof DOMException && error.name === \"DataCloneError\") {\n        throw error;\n      }\n      // They are going to lose state here, but there is no real\n      // way to warn them about it since the page will refresh...\n      window.location.assign(url);\n    }\n\n    if (v5Compat && listener) {\n      listener({ action, location: history.location, delta: 1 });\n    }\n  }\n\n  function replace(to: To, state?: any) {\n    action = Action.Replace;\n    let location = createLocation(history.location, to, state);\n    if (validateLocation) validateLocation(location, to);\n\n    index = getIndex();\n    let historyState = getHistoryState(location, index);\n    let url = history.createHref(location);\n    globalHistory.replaceState(historyState, \"\", url);\n\n    if (v5Compat && listener) {\n      listener({ action, location: history.location, delta: 0 });\n    }\n  }\n\n  function createURL(to: To): URL {\n    // window.location.origin is \"null\" (the literal string value) in Firefox\n    // under certain conditions, notably when serving from a local HTML file\n    // See https://bugzilla.mozilla.org/show_bug.cgi?id=878297\n    let base =\n      window.location.origin !== \"null\"\n        ? window.location.origin\n        : window.location.href;\n\n    let href = typeof to === \"string\" ? to : createPath(to);\n    // Treating this as a full URL will strip any trailing spaces so we need to\n    // pre-encode them since they might be part of a matching splat param from\n    // an ancestor route\n    href = href.replace(/ $/, \"%20\");\n    invariant(\n      base,\n      `No window.location.(origin|href) available to create URL for href: ${href}`\n    );\n    return new URL(href, base);\n  }\n\n  let history: History = {\n    get action() {\n      return action;\n    },\n    get location() {\n      return getLocation(window, globalHistory);\n    },\n    listen(fn: Listener) {\n      if (listener) {\n        throw new Error(\"A history only accepts one active listener\");\n      }\n      window.addEventListener(PopStateEventType, handlePop);\n      listener = fn;\n\n      return () => {\n        window.removeEventListener(PopStateEventType, handlePop);\n        listener = null;\n      };\n    },\n    createHref(to) {\n      return createHref(window, to);\n    },\n    createURL,\n    encodeLocation(to) {\n      // Encode a Location the same way window.location would\n      let url = createURL(to);\n      return {\n        pathname: url.pathname,\n        search: url.search,\n        hash: url.hash,\n      };\n    },\n    push,\n    replace,\n    go(n) {\n      return globalHistory.go(n);\n    },\n  };\n\n  return history;\n}\n\n//#endregion\n","import type { Location, Path, To } from \"./history\";\nimport { invariant, parsePath, warning } from \"./history\";\n\n/**\n * Map of routeId -> data returned from a loader/action/error\n */\nexport interface RouteData {\n  [routeId: string]: any;\n}\n\nexport enum ResultType {\n  data = \"data\",\n  deferred = \"deferred\",\n  redirect = \"redirect\",\n  error = \"error\",\n}\n\n/**\n * Successful result from a loader or action\n */\nexport interface SuccessResult {\n  type: ResultType.data;\n  data: any;\n  statusCode?: number;\n  headers?: Headers;\n}\n\n/**\n * Successful defer() result from a loader or action\n */\nexport interface DeferredResult {\n  type: ResultType.deferred;\n  deferredData: DeferredData;\n  statusCode?: number;\n  headers?: Headers;\n}\n\n/**\n * Redirect result from a loader or action\n */\nexport interface RedirectResult {\n  type: ResultType.redirect;\n  status: number;\n  location: string;\n  revalidate: boolean;\n  reloadDocument?: boolean;\n}\n\n/**\n * Unsuccessful result from a loader or action\n */\nexport interface ErrorResult {\n  type: ResultType.error;\n  error: any;\n  headers?: Headers;\n}\n\n/**\n * Result from a loader or action - potentially successful or unsuccessful\n */\nexport type DataResult =\n  | SuccessResult\n  | DeferredResult\n  | RedirectResult\n  | ErrorResult;\n\ntype LowerCaseFormMethod = \"get\" | \"post\" | \"put\" | \"patch\" | \"delete\";\ntype UpperCaseFormMethod = Uppercase<LowerCaseFormMethod>;\n\n/**\n * Users can specify either lowercase or uppercase form methods on `<Form>`,\n * useSubmit(), `<fetcher.Form>`, etc.\n */\nexport type HTMLFormMethod = LowerCaseFormMethod | UpperCaseFormMethod;\n\n/**\n * Active navigation/fetcher form methods are exposed in lowercase on the\n * RouterState\n */\nexport type FormMethod = LowerCaseFormMethod;\nexport type MutationFormMethod = Exclude<FormMethod, \"get\">;\n\n/**\n * In v7, active navigation/fetcher form methods are exposed in uppercase on the\n * RouterState.  This is to align with the normalization done via fetch().\n */\nexport type V7_FormMethod = UpperCaseFormMethod;\nexport type V7_MutationFormMethod = Exclude<V7_FormMethod, \"GET\">;\n\nexport type FormEncType =\n  | \"application/x-www-form-urlencoded\"\n  | \"multipart/form-data\"\n  | \"application/json\"\n  | \"text/plain\";\n\n// Thanks https://github.com/sindresorhus/type-fest!\ntype JsonObject = { [Key in string]: JsonValue } & {\n  [Key in string]?: JsonValue | undefined;\n};\ntype JsonArray = JsonValue[] | readonly JsonValue[];\ntype JsonPrimitive = string | number | boolean | null;\ntype JsonValue = JsonPrimitive | JsonObject | JsonArray;\n\n/**\n * @private\n * Internal interface to pass around for action submissions, not intended for\n * external consumption\n */\nexport type Submission =\n  | {\n      formMethod: FormMethod | V7_FormMethod;\n      formAction: string;\n      formEncType: FormEncType;\n      formData: FormData;\n      json: undefined;\n      text: undefined;\n    }\n  | {\n      formMethod: FormMethod | V7_FormMethod;\n      formAction: string;\n      formEncType: FormEncType;\n      formData: undefined;\n      json: JsonValue;\n      text: undefined;\n    }\n  | {\n      formMethod: FormMethod | V7_FormMethod;\n      formAction: string;\n      formEncType: FormEncType;\n      formData: undefined;\n      json: undefined;\n      text: string;\n    };\n\n/**\n * @private\n * Arguments passed to route loader/action functions.  Same for now but we keep\n * this as a private implementation detail in case they diverge in the future.\n */\ninterface DataFunctionArgs<Context> {\n  request: Request;\n  params: Params;\n  context?: Context;\n}\n\n// TODO: (v7) Change the defaults from any to unknown in and remove Remix wrappers:\n//   ActionFunction, ActionFunctionArgs, LoaderFunction, LoaderFunctionArgs\n//   Also, make them a type alias instead of an interface\n\n/**\n * Arguments passed to loader functions\n */\nexport interface LoaderFunctionArgs<Context = any>\n  extends DataFunctionArgs<Context> {}\n\n/**\n * Arguments passed to action functions\n */\nexport interface ActionFunctionArgs<Context = any>\n  extends DataFunctionArgs<Context> {}\n\n/**\n * Loaders and actions can return anything except `undefined` (`null` is a\n * valid return value if there is no data to return).  Responses are preferred\n * and will ease any future migration to Remix\n */\ntype DataFunctionValue = Response | NonNullable<unknown> | null;\n\n/**\n * Route loader function signature\n */\nexport type LoaderFunction<Context = any> = {\n  (args: LoaderFunctionArgs<Context>):\n    | Promise<DataFunctionValue>\n    | DataFunctionValue;\n} & { hydrate?: boolean };\n\n/**\n * Route action function signature\n */\nexport interface ActionFunction<Context = any> {\n  (args: ActionFunctionArgs<Context>):\n    | Promise<DataFunctionValue>\n    | DataFunctionValue;\n}\n\n/**\n * Arguments passed to shouldRevalidate function\n */\nexport interface ShouldRevalidateFunctionArgs {\n  currentUrl: URL;\n  currentParams: AgnosticDataRouteMatch[\"params\"];\n  nextUrl: URL;\n  nextParams: AgnosticDataRouteMatch[\"params\"];\n  formMethod?: Submission[\"formMethod\"];\n  formAction?: Submission[\"formAction\"];\n  formEncType?: Submission[\"formEncType\"];\n  text?: Submission[\"text\"];\n  formData?: Submission[\"formData\"];\n  json?: Submission[\"json\"];\n  actionResult?: any;\n  defaultShouldRevalidate: boolean;\n}\n\n/**\n * Route shouldRevalidate function signature.  This runs after any submission\n * (navigation or fetcher), so we flatten the navigation/fetcher submission\n * onto the arguments.  It shouldn't matter whether it came from a navigation\n * or a fetcher, what really matters is the URLs and the formData since loaders\n * have to re-run based on the data models that were potentially mutated.\n */\nexport interface ShouldRevalidateFunction {\n  (args: ShouldRevalidateFunctionArgs): boolean;\n}\n\n/**\n * Function provided by the framework-aware layers to set `hasErrorBoundary`\n * from the framework-aware `errorElement` prop\n *\n * @deprecated Use `mapRouteProperties` instead\n */\nexport interface DetectErrorBoundaryFunction {\n  (route: AgnosticRouteObject): boolean;\n}\n\n/**\n * Function provided by the framework-aware layers to set any framework-specific\n * properties from framework-agnostic properties\n */\nexport interface MapRoutePropertiesFunction {\n  (route: AgnosticRouteObject): {\n    hasErrorBoundary: boolean;\n  } & Record<string, any>;\n}\n\n/**\n * Keys we cannot change from within a lazy() function. We spread all other keys\n * onto the route. Either they're meaningful to the router, or they'll get\n * ignored.\n */\nexport type ImmutableRouteKey =\n  | \"lazy\"\n  | \"caseSensitive\"\n  | \"path\"\n  | \"id\"\n  | \"index\"\n  | \"children\";\n\nexport const immutableRouteKeys = new Set<ImmutableRouteKey>([\n  \"lazy\",\n  \"caseSensitive\",\n  \"path\",\n  \"id\",\n  \"index\",\n  \"children\",\n]);\n\ntype RequireOne<T, Key = keyof T> = Exclude<\n  {\n    [K in keyof T]: K extends Key ? Omit<T, K> & Required<Pick<T, K>> : never;\n  }[keyof T],\n  undefined\n>;\n\n/**\n * lazy() function to load a route definition, which can add non-matching\n * related properties to a route\n */\nexport interface LazyRouteFunction<R extends AgnosticRouteObject> {\n  (): Promise<RequireOne<Omit<R, ImmutableRouteKey>>>;\n}\n\n/**\n * Base RouteObject with common props shared by all types of routes\n */\ntype AgnosticBaseRouteObject = {\n  caseSensitive?: boolean;\n  path?: string;\n  id?: string;\n  loader?: LoaderFunction;\n  action?: ActionFunction;\n  hasErrorBoundary?: boolean;\n  shouldRevalidate?: ShouldRevalidateFunction;\n  handle?: any;\n  lazy?: LazyRouteFunction<AgnosticBaseRouteObject>;\n};\n\n/**\n * Index routes must not have children\n */\nexport type AgnosticIndexRouteObject = AgnosticBaseRouteObject & {\n  children?: undefined;\n  index: true;\n};\n\n/**\n * Non-index routes may have children, but cannot have index\n */\nexport type AgnosticNonIndexRouteObject = AgnosticBaseRouteObject & {\n  children?: AgnosticRouteObject[];\n  index?: false;\n};\n\n/**\n * A route object represents a logical route, with (optionally) its child\n * routes organized in a tree-like structure.\n */\nexport type AgnosticRouteObject =\n  | AgnosticIndexRouteObject\n  | AgnosticNonIndexRouteObject;\n\nexport type AgnosticDataIndexRouteObject = AgnosticIndexRouteObject & {\n  id: string;\n};\n\nexport type AgnosticDataNonIndexRouteObject = AgnosticNonIndexRouteObject & {\n  children?: AgnosticDataRouteObject[];\n  id: string;\n};\n\n/**\n * A data route object, which is just a RouteObject with a required unique ID\n */\nexport type AgnosticDataRouteObject =\n  | AgnosticDataIndexRouteObject\n  | AgnosticDataNonIndexRouteObject;\n\nexport type RouteManifest = Record<string, AgnosticDataRouteObject | undefined>;\n\n// Recursive helper for finding path parameters in the absence of wildcards\ntype _PathParam<Path extends string> =\n  // split path into individual path segments\n  Path extends `${infer L}/${infer R}`\n    ? _PathParam<L> | _PathParam<R>\n    : // find params after `:`\n    Path extends `:${infer Param}`\n    ? Param extends `${infer Optional}?`\n      ? Optional\n      : Param\n    : // otherwise, there aren't any params present\n      never;\n\n/**\n * Examples:\n * \"/a/b/*\" -> \"*\"\n * \":a\" -> \"a\"\n * \"/a/:b\" -> \"b\"\n * \"/a/blahblahblah:b\" -> \"b\"\n * \"/:a/:b\" -> \"a\" | \"b\"\n * \"/:a/b/:c/*\" -> \"a\" | \"c\" | \"*\"\n */\nexport type PathParam<Path extends string> =\n  // check if path is just a wildcard\n  Path extends \"*\" | \"/*\"\n    ? \"*\"\n    : // look for wildcard at the end of the path\n    Path extends `${infer Rest}/*`\n    ? \"*\" | _PathParam<Rest>\n    : // look for params in the absence of wildcards\n      _PathParam<Path>;\n\n// Attempt to parse the given string segment. If it fails, then just return the\n// plain string type as a default fallback. Otherwise, return the union of the\n// parsed string literals that were referenced as dynamic segments in the route.\nexport type ParamParseKey<Segment extends string> =\n  // if you could not find path params, fallback to `string`\n  [PathParam<Segment>] extends [never] ? string : PathParam<Segment>;\n\n/**\n * The parameters that were parsed from the URL path.\n */\nexport type Params<Key extends string = string> = {\n  readonly [key in Key]: string | undefined;\n};\n\n/**\n * A RouteMatch contains info about how a route matched a URL.\n */\nexport interface AgnosticRouteMatch<\n  ParamKey extends string = string,\n  RouteObjectType extends AgnosticRouteObject = AgnosticRouteObject\n> {\n  /**\n   * The names and values of dynamic parameters in the URL.\n   */\n  params: Params<ParamKey>;\n  /**\n   * The portion of the URL pathname that was matched.\n   */\n  pathname: string;\n  /**\n   * The portion of the URL pathname that was matched before child routes.\n   */\n  pathnameBase: string;\n  /**\n   * The route object that was used to match.\n   */\n  route: RouteObjectType;\n}\n\nexport interface AgnosticDataRouteMatch\n  extends AgnosticRouteMatch<string, AgnosticDataRouteObject> {}\n\nfunction isIndexRoute(\n  route: AgnosticRouteObject\n): route is AgnosticIndexRouteObject {\n  return route.index === true;\n}\n\n// Walk the route tree generating unique IDs where necessary, so we are working\n// solely with AgnosticDataRouteObject's within the Router\nexport function convertRoutesToDataRoutes(\n  routes: AgnosticRouteObject[],\n  mapRouteProperties: MapRoutePropertiesFunction,\n  parentPath: number[] = [],\n  manifest: RouteManifest = {}\n): AgnosticDataRouteObject[] {\n  return routes.map((route, index) => {\n    let treePath = [...parentPath, index];\n    let id = typeof route.id === \"string\" ? route.id : treePath.join(\"-\");\n    invariant(\n      route.index !== true || !route.children,\n      `Cannot specify children on an index route`\n    );\n    invariant(\n      !manifest[id],\n      `Found a route id collision on id \"${id}\".  Route ` +\n        \"id's must be globally unique within Data Router usages\"\n    );\n\n    if (isIndexRoute(route)) {\n      let indexRoute: AgnosticDataIndexRouteObject = {\n        ...route,\n        ...mapRouteProperties(route),\n        id,\n      };\n      manifest[id] = indexRoute;\n      return indexRoute;\n    } else {\n      let pathOrLayoutRoute: AgnosticDataNonIndexRouteObject = {\n        ...route,\n        ...mapRouteProperties(route),\n        id,\n        children: undefined,\n      };\n      manifest[id] = pathOrLayoutRoute;\n\n      if (route.children) {\n        pathOrLayoutRoute.children = convertRoutesToDataRoutes(\n          route.children,\n          mapRouteProperties,\n          treePath,\n          manifest\n        );\n      }\n\n      return pathOrLayoutRoute;\n    }\n  });\n}\n\n/**\n * Matches the given routes to a location and returns the match data.\n *\n * @see https://reactrouter.com/utils/match-routes\n */\nexport function matchRoutes<\n  RouteObjectType extends AgnosticRouteObject = AgnosticRouteObject\n>(\n  routes: RouteObjectType[],\n  locationArg: Partial<Location> | string,\n  basename = \"/\"\n): AgnosticRouteMatch<string, RouteObjectType>[] | null {\n  let location =\n    typeof locationArg === \"string\" ? parsePath(locationArg) : locationArg;\n\n  let pathname = stripBasename(location.pathname || \"/\", basename);\n\n  if (pathname == null) {\n    return null;\n  }\n\n  let branches = flattenRoutes(routes);\n  rankRouteBranches(branches);\n\n  let matches = null;\n  for (let i = 0; matches == null && i < branches.length; ++i) {\n    // Incoming pathnames are generally encoded from either window.location\n    // or from router.navigate, but we want to match against the unencoded\n    // paths in the route definitions.  Memory router locations won't be\n    // encoded here but there also shouldn't be anything to decode so this\n    // should be a safe operation.  This avoids needing matchRoutes to be\n    // history-aware.\n    let decoded = decodePath(pathname);\n    matches = matchRouteBranch<string, RouteObjectType>(branches[i], decoded);\n  }\n\n  return matches;\n}\n\nexport interface UIMatch<Data = unknown, Handle = unknown> {\n  id: string;\n  pathname: string;\n  params: AgnosticRouteMatch[\"params\"];\n  data: Data;\n  handle: Handle;\n}\n\nexport function convertRouteMatchToUiMatch(\n  match: AgnosticDataRouteMatch,\n  loaderData: RouteData\n): UIMatch {\n  let { route, pathname, params } = match;\n  return {\n    id: route.id,\n    pathname,\n    params,\n    data: loaderData[route.id],\n    handle: route.handle,\n  };\n}\n\ninterface RouteMeta<\n  RouteObjectType extends AgnosticRouteObject = AgnosticRouteObject\n> {\n  relativePath: string;\n  caseSensitive: boolean;\n  childrenIndex: number;\n  route: RouteObjectType;\n}\n\ninterface RouteBranch<\n  RouteObjectType extends AgnosticRouteObject = AgnosticRouteObject\n> {\n  path: string;\n  score: number;\n  routesMeta: RouteMeta<RouteObjectType>[];\n}\n\nfunction flattenRoutes<\n  RouteObjectType extends AgnosticRouteObject = AgnosticRouteObject\n>(\n  routes: RouteObjectType[],\n  branches: RouteBranch<RouteObjectType>[] = [],\n  parentsMeta: RouteMeta<RouteObjectType>[] = [],\n  parentPath = \"\"\n): RouteBranch<RouteObjectType>[] {\n  let flattenRoute = (\n    route: RouteObjectType,\n    index: number,\n    relativePath?: string\n  ) => {\n    let meta: RouteMeta<RouteObjectType> = {\n      relativePath:\n        relativePath === undefined ? route.path || \"\" : relativePath,\n      caseSensitive: route.caseSensitive === true,\n      childrenIndex: index,\n      route,\n    };\n\n    if (meta.relativePath.startsWith(\"/\")) {\n      invariant(\n        meta.relativePath.startsWith(parentPath),\n        `Absolute route path \"${meta.relativePath}\" nested under path ` +\n          `\"${parentPath}\" is not valid. An absolute child route path ` +\n          `must start with the combined path of all its parent routes.`\n      );\n\n      meta.relativePath = meta.relativePath.slice(parentPath.length);\n    }\n\n    let path = joinPaths([parentPath, meta.relativePath]);\n    let routesMeta = parentsMeta.concat(meta);\n\n    // Add the children before adding this route to the array, so we traverse the\n    // route tree depth-first and child routes appear before their parents in\n    // the \"flattened\" version.\n    if (route.children && route.children.length > 0) {\n      invariant(\n        // Our types know better, but runtime JS may not!\n        // @ts-expect-error\n        route.index !== true,\n        `Index routes must not have child routes. Please remove ` +\n          `all child routes from route path \"${path}\".`\n      );\n\n      flattenRoutes(route.children, branches, routesMeta, path);\n    }\n\n    // Routes without a path shouldn't ever match by themselves unless they are\n    // index routes, so don't add them to the list of possible branches.\n    if (route.path == null && !route.index) {\n      return;\n    }\n\n    branches.push({\n      path,\n      score: computeScore(path, route.index),\n      routesMeta,\n    });\n  };\n  routes.forEach((route, index) => {\n    // coarse-grain check for optional params\n    if (route.path === \"\" || !route.path?.includes(\"?\")) {\n      flattenRoute(route, index);\n    } else {\n      for (let exploded of explodeOptionalSegments(route.path)) {\n        flattenRoute(route, index, exploded);\n      }\n    }\n  });\n\n  return branches;\n}\n\n/**\n * Computes all combinations of optional path segments for a given path,\n * excluding combinations that are ambiguous and of lower priority.\n *\n * For example, `/one/:two?/three/:four?/:five?` explodes to:\n * - `/one/three`\n * - `/one/:two/three`\n * - `/one/three/:four`\n * - `/one/three/:five`\n * - `/one/:two/three/:four`\n * - `/one/:two/three/:five`\n * - `/one/three/:four/:five`\n * - `/one/:two/three/:four/:five`\n */\nfunction explodeOptionalSegments(path: string): string[] {\n  let segments = path.split(\"/\");\n  if (segments.length === 0) return [];\n\n  let [first, ...rest] = segments;\n\n  // Optional path segments are denoted by a trailing `?`\n  let isOptional = first.endsWith(\"?\");\n  // Compute the corresponding required segment: `foo?` -> `foo`\n  let required = first.replace(/\\?$/, \"\");\n\n  if (rest.length === 0) {\n    // Intepret empty string as omitting an optional segment\n    // `[\"one\", \"\", \"three\"]` corresponds to omitting `:two` from `/one/:two?/three` -> `/one/three`\n    return isOptional ? [required, \"\"] : [required];\n  }\n\n  let restExploded = explodeOptionalSegments(rest.join(\"/\"));\n\n  let result: string[] = [];\n\n  // All child paths with the prefix.  Do this for all children before the\n  // optional version for all children, so we get consistent ordering where the\n  // parent optional aspect is preferred as required.  Otherwise, we can get\n  // child sections interspersed where deeper optional segments are higher than\n  // parent optional segments, where for example, /:two would explode _earlier_\n  // then /:one.  By always including the parent as required _for all children_\n  // first, we avoid this issue\n  result.push(\n    ...restExploded.map((subpath) =>\n      subpath === \"\" ? required : [required, subpath].join(\"/\")\n    )\n  );\n\n  // Then, if this is an optional value, add all child versions without\n  if (isOptional) {\n    result.push(...restExploded);\n  }\n\n  // for absolute paths, ensure `/` instead of empty segment\n  return result.map((exploded) =>\n    path.startsWith(\"/\") && exploded === \"\" ? \"/\" : exploded\n  );\n}\n\nfunction rankRouteBranches(branches: RouteBranch[]): void {\n  branches.sort((a, b) =>\n    a.score !== b.score\n      ? b.score - a.score // Higher score first\n      : compareIndexes(\n          a.routesMeta.map((meta) => meta.childrenIndex),\n          b.routesMeta.map((meta) => meta.childrenIndex)\n        )\n  );\n}\n\nconst paramRe = /^:[\\w-]+$/;\nconst dynamicSegmentValue = 3;\nconst indexRouteValue = 2;\nconst emptySegmentValue = 1;\nconst staticSegmentValue = 10;\nconst splatPenalty = -2;\nconst isSplat = (s: string) => s === \"*\";\n\nfunction computeScore(path: string, index: boolean | undefined): number {\n  let segments = path.split(\"/\");\n  let initialScore = segments.length;\n  if (segments.some(isSplat)) {\n    initialScore += splatPenalty;\n  }\n\n  if (index) {\n    initialScore += indexRouteValue;\n  }\n\n  return segments\n    .filter((s) => !isSplat(s))\n    .reduce(\n      (score, segment) =>\n        score +\n        (paramRe.test(segment)\n          ? dynamicSegmentValue\n          : segment === \"\"\n          ? emptySegmentValue\n          : staticSegmentValue),\n      initialScore\n    );\n}\n\nfunction compareIndexes(a: number[], b: number[]): number {\n  let siblings =\n    a.length === b.length && a.slice(0, -1).every((n, i) => n === b[i]);\n\n  return siblings\n    ? // If two routes are siblings, we should try to match the earlier sibling\n      // first. This allows people to have fine-grained control over the matching\n      // behavior by simply putting routes with identical paths in the order they\n      // want them tried.\n      a[a.length - 1] - b[b.length - 1]\n    : // Otherwise, it doesn't really make sense to rank non-siblings by index,\n      // so they sort equally.\n      0;\n}\n\nfunction matchRouteBranch<\n  ParamKey extends string = string,\n  RouteObjectType extends AgnosticRouteObject = AgnosticRouteObject\n>(\n  branch: RouteBranch<RouteObjectType>,\n  pathname: string\n): AgnosticRouteMatch<ParamKey, RouteObjectType>[] | null {\n  let { routesMeta } = branch;\n\n  let matchedParams = {};\n  let matchedPathname = \"/\";\n  let matches: AgnosticRouteMatch<ParamKey, RouteObjectType>[] = [];\n  for (let i = 0; i < routesMeta.length; ++i) {\n    let meta = routesMeta[i];\n    let end = i === routesMeta.length - 1;\n    let remainingPathname =\n      matchedPathname === \"/\"\n        ? pathname\n        : pathname.slice(matchedPathname.length) || \"/\";\n    let match = matchPath(\n      { path: meta.relativePath, caseSensitive: meta.caseSensitive, end },\n      remainingPathname\n    );\n\n    if (!match) return null;\n\n    Object.assign(matchedParams, match.params);\n\n    let route = meta.route;\n\n    matches.push({\n      // TODO: Can this as be avoided?\n      params: matchedParams as Params<ParamKey>,\n      pathname: joinPaths([matchedPathname, match.pathname]),\n      pathnameBase: normalizePathname(\n        joinPaths([matchedPathname, match.pathnameBase])\n      ),\n      route,\n    });\n\n    if (match.pathnameBase !== \"/\") {\n      matchedPathname = joinPaths([matchedPathname, match.pathnameBase]);\n    }\n  }\n\n  return matches;\n}\n\n/**\n * Returns a path with params interpolated.\n *\n * @see https://reactrouter.com/utils/generate-path\n */\nexport function generatePath<Path extends string>(\n  originalPath: Path,\n  params: {\n    [key in PathParam<Path>]: string | null;\n  } = {} as any\n): string {\n  let path: string = originalPath;\n  if (path.endsWith(\"*\") && path !== \"*\" && !path.endsWith(\"/*\")) {\n    warning(\n      false,\n      `Route path \"${path}\" will be treated as if it were ` +\n        `\"${path.replace(/\\*$/, \"/*\")}\" because the \\`*\\` character must ` +\n        `always follow a \\`/\\` in the pattern. To get rid of this warning, ` +\n        `please change the route path to \"${path.replace(/\\*$/, \"/*\")}\".`\n    );\n    path = path.replace(/\\*$/, \"/*\") as Path;\n  }\n\n  // ensure `/` is added at the beginning if the path is absolute\n  const prefix = path.startsWith(\"/\") ? \"/\" : \"\";\n\n  const stringify = (p: any) =>\n    p == null ? \"\" : typeof p === \"string\" ? p : String(p);\n\n  const segments = path\n    .split(/\\/+/)\n    .map((segment, index, array) => {\n      const isLastSegment = index === array.length - 1;\n\n      // only apply the splat if it's the last segment\n      if (isLastSegment && segment === \"*\") {\n        const star = \"*\" as PathParam<Path>;\n        // Apply the splat\n        return stringify(params[star]);\n      }\n\n      const keyMatch = segment.match(/^:([\\w-]+)(\\??)$/);\n      if (keyMatch) {\n        const [, key, optional] = keyMatch;\n        let param = params[key as PathParam<Path>];\n        invariant(optional === \"?\" || param != null, `Missing \":${key}\" param`);\n        return stringify(param);\n      }\n\n      // Remove any optional markers from optional static segments\n      return segment.replace(/\\?$/g, \"\");\n    })\n    // Remove empty segments\n    .filter((segment) => !!segment);\n\n  return prefix + segments.join(\"/\");\n}\n\n/**\n * A PathPattern is used to match on some portion of a URL pathname.\n */\nexport interface PathPattern<Path extends string = string> {\n  /**\n   * A string to match against a URL pathname. May contain `:id`-style segments\n   * to indicate placeholders for dynamic parameters. May also end with `/*` to\n   * indicate matching the rest of the URL pathname.\n   */\n  path: Path;\n  /**\n   * Should be `true` if the static portions of the `path` should be matched in\n   * the same case.\n   */\n  caseSensitive?: boolean;\n  /**\n   * Should be `true` if this pattern should match the entire URL pathname.\n   */\n  end?: boolean;\n}\n\n/**\n * A PathMatch contains info about how a PathPattern matched on a URL pathname.\n */\nexport interface PathMatch<ParamKey extends string = string> {\n  /**\n   * The names and values of dynamic parameters in the URL.\n   */\n  params: Params<ParamKey>;\n  /**\n   * The portion of the URL pathname that was matched.\n   */\n  pathname: string;\n  /**\n   * The portion of the URL pathname that was matched before child routes.\n   */\n  pathnameBase: string;\n  /**\n   * The pattern that was used to match.\n   */\n  pattern: PathPattern;\n}\n\ntype Mutable<T> = {\n  -readonly [P in keyof T]: T[P];\n};\n\n/**\n * Performs pattern matching on a URL pathname and returns information about\n * the match.\n *\n * @see https://reactrouter.com/utils/match-path\n */\nexport function matchPath<\n  ParamKey extends ParamParseKey<Path>,\n  Path extends string\n>(\n  pattern: PathPattern<Path> | Path,\n  pathname: string\n): PathMatch<ParamKey> | null {\n  if (typeof pattern === \"string\") {\n    pattern = { path: pattern, caseSensitive: false, end: true };\n  }\n\n  let [matcher, compiledParams] = compilePath(\n    pattern.path,\n    pattern.caseSensitive,\n    pattern.end\n  );\n\n  let match = pathname.match(matcher);\n  if (!match) return null;\n\n  let matchedPathname = match[0];\n  let pathnameBase = matchedPathname.replace(/(.)\\/+$/, \"$1\");\n  let captureGroups = match.slice(1);\n  let params: Params = compiledParams.reduce<Mutable<Params>>(\n    (memo, { paramName, isOptional }, index) => {\n      // We need to compute the pathnameBase here using the raw splat value\n      // instead of using params[\"*\"] later because it will be decoded then\n      if (paramName === \"*\") {\n        let splatValue = captureGroups[index] || \"\";\n        pathnameBase = matchedPathname\n          .slice(0, matchedPathname.length - splatValue.length)\n          .replace(/(.)\\/+$/, \"$1\");\n      }\n\n      const value = captureGroups[index];\n      if (isOptional && !value) {\n        memo[paramName] = undefined;\n      } else {\n        memo[paramName] = (value || \"\").replace(/%2F/g, \"/\");\n      }\n      return memo;\n    },\n    {}\n  );\n\n  return {\n    params,\n    pathname: matchedPathname,\n    pathnameBase,\n    pattern,\n  };\n}\n\ntype CompiledPathParam = { paramName: string; isOptional?: boolean };\n\nfunction compilePath(\n  path: string,\n  caseSensitive = false,\n  end = true\n): [RegExp, CompiledPathParam[]] {\n  warning(\n    path === \"*\" || !path.endsWith(\"*\") || path.endsWith(\"/*\"),\n    `Route path \"${path}\" will be treated as if it were ` +\n      `\"${path.replace(/\\*$/, \"/*\")}\" because the \\`*\\` character must ` +\n      `always follow a \\`/\\` in the pattern. To get rid of this warning, ` +\n      `please change the route path to \"${path.replace(/\\*$/, \"/*\")}\".`\n  );\n\n  let params: CompiledPathParam[] = [];\n  let regexpSource =\n    \"^\" +\n    path\n      .replace(/\\/*\\*?$/, \"\") // Ignore trailing / and /*, we'll handle it below\n      .replace(/^\\/*/, \"/\") // Make sure it has a leading /\n      .replace(/[\\\\.*+^${}|()[\\]]/g, \"\\\\$&\") // Escape special regex chars\n      .replace(\n        /\\/:([\\w-]+)(\\?)?/g,\n        (_: string, paramName: string, isOptional) => {\n          params.push({ paramName, isOptional: isOptional != null });\n          return isOptional ? \"/?([^\\\\/]+)?\" : \"/([^\\\\/]+)\";\n        }\n      );\n\n  if (path.endsWith(\"*\")) {\n    params.push({ paramName: \"*\" });\n    regexpSource +=\n      path === \"*\" || path === \"/*\"\n        ? \"(.*)$\" // Already matched the initial /, just match the rest\n        : \"(?:\\\\/(.+)|\\\\/*)$\"; // Don't include the / in params[\"*\"]\n  } else if (end) {\n    // When matching to the end, ignore trailing slashes\n    regexpSource += \"\\\\/*$\";\n  } else if (path !== \"\" && path !== \"/\") {\n    // If our path is non-empty and contains anything beyond an initial slash,\n    // then we have _some_ form of path in our regex, so we should expect to\n    // match only if we find the end of this path segment.  Look for an optional\n    // non-captured trailing slash (to match a portion of the URL) or the end\n    // of the path (if we've matched to the end).  We used to do this with a\n    // word boundary but that gives false positives on routes like\n    // /user-preferences since `-` counts as a word boundary.\n    regexpSource += \"(?:(?=\\\\/|$))\";\n  } else {\n    // Nothing to match for \"\" or \"/\"\n  }\n\n  let matcher = new RegExp(regexpSource, caseSensitive ? undefined : \"i\");\n\n  return [matcher, params];\n}\n\nfunction decodePath(value: string) {\n  try {\n    return value\n      .split(\"/\")\n      .map((v) => decodeURIComponent(v).replace(/\\//g, \"%2F\"))\n      .join(\"/\");\n  } catch (error) {\n    warning(\n      false,\n      `The URL path \"${value}\" could not be decoded because it is is a ` +\n        `malformed URL segment. This is probably due to a bad percent ` +\n        `encoding (${error}).`\n    );\n\n    return value;\n  }\n}\n\n/**\n * @private\n */\nexport function stripBasename(\n  pathname: string,\n  basename: string\n): string | null {\n  if (basename === \"/\") return pathname;\n\n  if (!pathname.toLowerCase().startsWith(basename.toLowerCase())) {\n    return null;\n  }\n\n  // We want to leave trailing slash behavior in the user's control, so if they\n  // specify a basename with a trailing slash, we should support it\n  let startIndex = basename.endsWith(\"/\")\n    ? basename.length - 1\n    : basename.length;\n  let nextChar = pathname.charAt(startIndex);\n  if (nextChar && nextChar !== \"/\") {\n    // pathname does not start with basename/\n    return null;\n  }\n\n  return pathname.slice(startIndex) || \"/\";\n}\n\n/**\n * Returns a resolved path object relative to the given pathname.\n *\n * @see https://reactrouter.com/utils/resolve-path\n */\nexport function resolvePath(to: To, fromPathname = \"/\"): Path {\n  let {\n    pathname: toPathname,\n    search = \"\",\n    hash = \"\",\n  } = typeof to === \"string\" ? parsePath(to) : to;\n\n  let pathname = toPathname\n    ? toPathname.startsWith(\"/\")\n      ? toPathname\n      : resolvePathname(toPathname, fromPathname)\n    : fromPathname;\n\n  return {\n    pathname,\n    search: normalizeSearch(search),\n    hash: normalizeHash(hash),\n  };\n}\n\nfunction resolvePathname(relativePath: string, fromPathname: string): string {\n  let segments = fromPathname.replace(/\\/+$/, \"\").split(\"/\");\n  let relativeSegments = relativePath.split(\"/\");\n\n  relativeSegments.forEach((segment) => {\n    if (segment === \"..\") {\n      // Keep the root \"\" segment so the pathname starts at /\n      if (segments.length > 1) segments.pop();\n    } else if (segment !== \".\") {\n      segments.push(segment);\n    }\n  });\n\n  return segments.length > 1 ? segments.join(\"/\") : \"/\";\n}\n\nfunction getInvalidPathError(\n  char: string,\n  field: string,\n  dest: string,\n  path: Partial<Path>\n) {\n  return (\n    `Cannot include a '${char}' character in a manually specified ` +\n    `\\`to.${field}\\` field [${JSON.stringify(\n      path\n    )}].  Please separate it out to the ` +\n    `\\`to.${dest}\\` field. Alternatively you may provide the full path as ` +\n    `a string in <Link to=\"...\"> and the router will parse it for you.`\n  );\n}\n\n/**\n * @private\n *\n * When processing relative navigation we want to ignore ancestor routes that\n * do not contribute to the path, such that index/pathless layout routes don't\n * interfere.\n *\n * For example, when moving a route element into an index route and/or a\n * pathless layout route, relative link behavior contained within should stay\n * the same.  Both of the following examples should link back to the root:\n *\n *   <Route path=\"/\">\n *     <Route path=\"accounts\" element={<Link to=\"..\"}>\n *   </Route>\n *\n *   <Route path=\"/\">\n *     <Route path=\"accounts\">\n *       <Route element={<AccountsLayout />}>       // <-- Does not contribute\n *         <Route index element={<Link to=\"..\"} />  // <-- Does not contribute\n *       </Route\n *     </Route>\n *   </Route>\n */\nexport function getPathContributingMatches<\n  T extends AgnosticRouteMatch = AgnosticRouteMatch\n>(matches: T[]) {\n  return matches.filter(\n    (match, index) =>\n      index === 0 || (match.route.path && match.route.path.length > 0)\n  );\n}\n\n// Return the array of pathnames for the current route matches - used to\n// generate the routePathnames input for resolveTo()\nexport function getResolveToMatches<\n  T extends AgnosticRouteMatch = AgnosticRouteMatch\n>(matches: T[], v7_relativeSplatPath: boolean) {\n  let pathMatches = getPathContributingMatches(matches);\n\n  // When v7_relativeSplatPath is enabled, use the full pathname for the leaf\n  // match so we include splat values for \".\" links.  See:\n  // https://github.com/remix-run/react-router/issues/11052#issuecomment-1836589329\n  if (v7_relativeSplatPath) {\n    return pathMatches.map((match, idx) =>\n      idx === matches.length - 1 ? match.pathname : match.pathnameBase\n    );\n  }\n\n  return pathMatches.map((match) => match.pathnameBase);\n}\n\n/**\n * @private\n */\nexport function resolveTo(\n  toArg: To,\n  routePathnames: string[],\n  locationPathname: string,\n  isPathRelative = false\n): Path {\n  let to: Partial<Path>;\n  if (typeof toArg === \"string\") {\n    to = parsePath(toArg);\n  } else {\n    to = { ...toArg };\n\n    invariant(\n      !to.pathname || !to.pathname.includes(\"?\"),\n      getInvalidPathError(\"?\", \"pathname\", \"search\", to)\n    );\n    invariant(\n      !to.pathname || !to.pathname.includes(\"#\"),\n      getInvalidPathError(\"#\", \"pathname\", \"hash\", to)\n    );\n    invariant(\n      !to.search || !to.search.includes(\"#\"),\n      getInvalidPathError(\"#\", \"search\", \"hash\", to)\n    );\n  }\n\n  let isEmptyPath = toArg === \"\" || to.pathname === \"\";\n  let toPathname = isEmptyPath ? \"/\" : to.pathname;\n\n  let from: string;\n\n  // Routing is relative to the current pathname if explicitly requested.\n  //\n  // If a pathname is explicitly provided in `to`, it should be relative to the\n  // route context. This is explained in `Note on `<Link to>` values` in our\n  // migration guide from v5 as a means of disambiguation between `to` values\n  // that begin with `/` and those that do not. However, this is problematic for\n  // `to` values that do not provide a pathname. `to` can simply be a search or\n  // hash string, in which case we should assume that the navigation is relative\n  // to the current location's pathname and *not* the route pathname.\n  if (toPathname == null) {\n    from = locationPathname;\n  } else {\n    let routePathnameIndex = routePathnames.length - 1;\n\n    // With relative=\"route\" (the default), each leading .. segment means\n    // \"go up one route\" instead of \"go up one URL segment\".  This is a key\n    // difference from how <a href> works and a major reason we call this a\n    // \"to\" value instead of a \"href\".\n    if (!isPathRelative && toPathname.startsWith(\"..\")) {\n      let toSegments = toPathname.split(\"/\");\n\n      while (toSegments[0] === \"..\") {\n        toSegments.shift();\n        routePathnameIndex -= 1;\n      }\n\n      to.pathname = toSegments.join(\"/\");\n    }\n\n    from = routePathnameIndex >= 0 ? routePathnames[routePathnameIndex] : \"/\";\n  }\n\n  let path = resolvePath(to, from);\n\n  // Ensure the pathname has a trailing slash if the original \"to\" had one\n  let hasExplicitTrailingSlash =\n    toPathname && toPathname !== \"/\" && toPathname.endsWith(\"/\");\n  // Or if this was a link to the current path which has a trailing slash\n  let hasCurrentTrailingSlash =\n    (isEmptyPath || toPathname === \".\") && locationPathname.endsWith(\"/\");\n  if (\n    !path.pathname.endsWith(\"/\") &&\n    (hasExplicitTrailingSlash || hasCurrentTrailingSlash)\n  ) {\n    path.pathname += \"/\";\n  }\n\n  return path;\n}\n\n/**\n * @private\n */\nexport function getToPathname(to: To): string | undefined {\n  // Empty strings should be treated the same as / paths\n  return to === \"\" || (to as Path).pathname === \"\"\n    ? \"/\"\n    : typeof to === \"string\"\n    ? parsePath(to).pathname\n    : to.pathname;\n}\n\n/**\n * @private\n */\nexport const joinPaths = (paths: string[]): string =>\n  paths.join(\"/\").replace(/\\/\\/+/g, \"/\");\n\n/**\n * @private\n */\nexport const normalizePathname = (pathname: string): string =>\n  pathname.replace(/\\/+$/, \"\").replace(/^\\/*/, \"/\");\n\n/**\n * @private\n */\nexport const normalizeSearch = (search: string): string =>\n  !search || search === \"?\"\n    ? \"\"\n    : search.startsWith(\"?\")\n    ? search\n    : \"?\" + search;\n\n/**\n * @private\n */\nexport const normalizeHash = (hash: string): string =>\n  !hash || hash === \"#\" ? \"\" : hash.startsWith(\"#\") ? hash : \"#\" + hash;\n\nexport type JsonFunction = <Data>(\n  data: Data,\n  init?: number | ResponseInit\n) => Response;\n\n/**\n * This is a shortcut for creating `application/json` responses. Converts `data`\n * to JSON and sets the `Content-Type` header.\n */\nexport const json: JsonFunction = (data, init = {}) => {\n  let responseInit = typeof init === \"number\" ? { status: init } : init;\n\n  let headers = new Headers(responseInit.headers);\n  if (!headers.has(\"Content-Type\")) {\n    headers.set(\"Content-Type\", \"application/json; charset=utf-8\");\n  }\n\n  return new Response(JSON.stringify(data), {\n    ...responseInit,\n    headers,\n  });\n};\n\nexport interface TrackedPromise extends Promise<any> {\n  _tracked?: boolean;\n  _data?: any;\n  _error?: any;\n}\n\nexport class AbortedDeferredError extends Error {}\n\nexport class DeferredData {\n  private pendingKeysSet: Set<string> = new Set<string>();\n  private controller: AbortController;\n  private abortPromise: Promise<void>;\n  private unlistenAbortSignal: () => void;\n  private subscribers: Set<(aborted: boolean, settledKey?: string) => void> =\n    new Set();\n  data: Record<string, unknown>;\n  init?: ResponseInit;\n  deferredKeys: string[] = [];\n\n  constructor(data: Record<string, unknown>, responseInit?: ResponseInit) {\n    invariant(\n      data && typeof data === \"object\" && !Array.isArray(data),\n      \"defer() only accepts plain objects\"\n    );\n\n    // Set up an AbortController + Promise we can race against to exit early\n    // cancellation\n    let reject: (e: AbortedDeferredError) => void;\n    this.abortPromise = new Promise((_, r) => (reject = r));\n    this.controller = new AbortController();\n    let onAbort = () =>\n      reject(new AbortedDeferredError(\"Deferred data aborted\"));\n    this.unlistenAbortSignal = () =>\n      this.controller.signal.removeEventListener(\"abort\", onAbort);\n    this.controller.signal.addEventListener(\"abort\", onAbort);\n\n    this.data = Object.entries(data).reduce(\n      (acc, [key, value]) =>\n        Object.assign(acc, {\n          [key]: this.trackPromise(key, value),\n        }),\n      {}\n    );\n\n    if (this.done) {\n      // All incoming values were resolved\n      this.unlistenAbortSignal();\n    }\n\n    this.init = responseInit;\n  }\n\n  private trackPromise(\n    key: string,\n    value: Promise<unknown> | unknown\n  ): TrackedPromise | unknown {\n    if (!(value instanceof Promise)) {\n      return value;\n    }\n\n    this.deferredKeys.push(key);\n    this.pendingKeysSet.add(key);\n\n    // We store a little wrapper promise that will be extended with\n    // _data/_error props upon resolve/reject\n    let promise: TrackedPromise = Promise.race([value, this.abortPromise]).then(\n      (data) => this.onSettle(promise, key, undefined, data as unknown),\n      (error) => this.onSettle(promise, key, error as unknown)\n    );\n\n    // Register rejection listeners to avoid uncaught promise rejections on\n    // errors or aborted deferred values\n    promise.catch(() => {});\n\n    Object.defineProperty(promise, \"_tracked\", { get: () => true });\n    return promise;\n  }\n\n  private onSettle(\n    promise: TrackedPromise,\n    key: string,\n    error: unknown,\n    data?: unknown\n  ): unknown {\n    if (\n      this.controller.signal.aborted &&\n      error instanceof AbortedDeferredError\n    ) {\n      this.unlistenAbortSignal();\n      Object.defineProperty(promise, \"_error\", { get: () => error });\n      return Promise.reject(error);\n    }\n\n    this.pendingKeysSet.delete(key);\n\n    if (this.done) {\n      // Nothing left to abort!\n      this.unlistenAbortSignal();\n    }\n\n    // If the promise was resolved/rejected with undefined, we'll throw an error as you\n    // should always resolve with a value or null\n    if (error === undefined && data === undefined) {\n      let undefinedError = new Error(\n        `Deferred data for key \"${key}\" resolved/rejected with \\`undefined\\`, ` +\n          `you must resolve/reject with a value or \\`null\\`.`\n      );\n      Object.defineProperty(promise, \"_error\", { get: () => undefinedError });\n      this.emit(false, key);\n      return Promise.reject(undefinedError);\n    }\n\n    if (data === undefined) {\n      Object.defineProperty(promise, \"_error\", { get: () => error });\n      this.emit(false, key);\n      return Promise.reject(error);\n    }\n\n    Object.defineProperty(promise, \"_data\", { get: () => data });\n    this.emit(false, key);\n    return data;\n  }\n\n  private emit(aborted: boolean, settledKey?: string) {\n    this.subscribers.forEach((subscriber) => subscriber(aborted, settledKey));\n  }\n\n  subscribe(fn: (aborted: boolean, settledKey?: string) => void) {\n    this.subscribers.add(fn);\n    return () => this.subscribers.delete(fn);\n  }\n\n  cancel() {\n    this.controller.abort();\n    this.pendingKeysSet.forEach((v, k) => this.pendingKeysSet.delete(k));\n    this.emit(true);\n  }\n\n  async resolveData(signal: AbortSignal) {\n    let aborted = false;\n    if (!this.done) {\n      let onAbort = () => this.cancel();\n      signal.addEventListener(\"abort\", onAbort);\n      aborted = await new Promise((resolve) => {\n        this.subscribe((aborted) => {\n          signal.removeEventListener(\"abort\", onAbort);\n          if (aborted || this.done) {\n            resolve(aborted);\n          }\n        });\n      });\n    }\n    return aborted;\n  }\n\n  get done() {\n    return this.pendingKeysSet.size === 0;\n  }\n\n  get unwrappedData() {\n    invariant(\n      this.data !== null && this.done,\n      \"Can only unwrap data on initialized and settled deferreds\"\n    );\n\n    return Object.entries(this.data).reduce(\n      (acc, [key, value]) =>\n        Object.assign(acc, {\n          [key]: unwrapTrackedPromise(value),\n        }),\n      {}\n    );\n  }\n\n  get pendingKeys() {\n    return Array.from(this.pendingKeysSet);\n  }\n}\n\nfunction isTrackedPromise(value: any): value is TrackedPromise {\n  return (\n    value instanceof Promise && (value as TrackedPromise)._tracked === true\n  );\n}\n\nfunction unwrapTrackedPromise(value: any) {\n  if (!isTrackedPromise(value)) {\n    return value;\n  }\n\n  if (value._error) {\n    throw value._error;\n  }\n  return value._data;\n}\n\nexport type DeferFunction = (\n  data: Record<string, unknown>,\n  init?: number | ResponseInit\n) => DeferredData;\n\nexport const defer: DeferFunction = (data, init = {}) => {\n  let responseInit = typeof init === \"number\" ? { status: init } : init;\n\n  return new DeferredData(data, responseInit);\n};\n\nexport type RedirectFunction = (\n  url: string,\n  init?: number | ResponseInit\n) => Response;\n\n/**\n * A redirect response. Sets the status code and the `Location` header.\n * Defaults to \"302 Found\".\n */\nexport const redirect: RedirectFunction = (url, init = 302) => {\n  let responseInit = init;\n  if (typeof responseInit === \"number\") {\n    responseInit = { status: responseInit };\n  } else if (typeof responseInit.status === \"undefined\") {\n    responseInit.status = 302;\n  }\n\n  let headers = new Headers(responseInit.headers);\n  headers.set(\"Location\", url);\n\n  return new Response(null, {\n    ...responseInit,\n    headers,\n  });\n};\n\n/**\n * A redirect response that will force a document reload to the new location.\n * Sets the status code and the `Location` header.\n * Defaults to \"302 Found\".\n */\nexport const redirectDocument: RedirectFunction = (url, init) => {\n  let response = redirect(url, init);\n  response.headers.set(\"X-Remix-Reload-Document\", \"true\");\n  return response;\n};\n\nexport type ErrorResponse = {\n  status: number;\n  statusText: string;\n  data: any;\n};\n\n/**\n * @private\n * Utility class we use to hold auto-unwrapped 4xx/5xx Response bodies\n *\n * We don't export the class for public use since it's an implementation\n * detail, but we export the interface above so folks can build their own\n * abstractions around instances via isRouteErrorResponse()\n */\nexport class ErrorResponseImpl implements ErrorResponse {\n  status: number;\n  statusText: string;\n  data: any;\n  private error?: Error;\n  private internal: boolean;\n\n  constructor(\n    status: number,\n    statusText: string | undefined,\n    data: any,\n    internal = false\n  ) {\n    this.status = status;\n    this.statusText = statusText || \"\";\n    this.internal = internal;\n    if (data instanceof Error) {\n      this.data = data.toString();\n      this.error = data;\n    } else {\n      this.data = data;\n    }\n  }\n}\n\n/**\n * Check if the given error is an ErrorResponse generated from a 4xx/5xx\n * Response thrown from an action/loader\n */\nexport function isRouteErrorResponse(error: any): error is ErrorResponse {\n  return (\n    error != null &&\n    typeof error.status === \"number\" &&\n    typeof error.statusText === \"string\" &&\n    typeof error.internal === \"boolean\" &&\n    \"data\" in error\n  );\n}\n","import type { History, Location, Path, To } from \"./history\";\nimport {\n  Action as HistoryAction,\n  createLocation,\n  createPath,\n  invariant,\n  parsePath,\n  warning,\n} from \"./history\";\nimport type {\n  ActionFunction,\n  AgnosticDataRouteMatch,\n  AgnosticDataRouteObject,\n  AgnosticRouteObject,\n  DataResult,\n  DeferredData,\n  DeferredResult,\n  DetectErrorBoundaryFunction,\n  ErrorResult,\n  FormEncType,\n  FormMethod,\n  HTMLFormMethod,\n  ImmutableRouteKey,\n  LoaderFunction,\n  MapRoutePropertiesFunction,\n  MutationFormMethod,\n  RedirectResult,\n  RouteData,\n  RouteManifest,\n  ShouldRevalidateFunctionArgs,\n  Submission,\n  SuccessResult,\n  UIMatch,\n  V7_FormMethod,\n  V7_MutationFormMethod,\n} from \"./utils\";\nimport {\n  ErrorResponseImpl,\n  ResultType,\n  convertRouteMatchToUiMatch,\n  convertRoutesToDataRoutes,\n  getPathContributingMatches,\n  getResolveToMatches,\n  immutableRouteKeys,\n  isRouteErrorResponse,\n  joinPaths,\n  matchRoutes,\n  resolveTo,\n  stripBasename,\n} from \"./utils\";\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Types and Constants\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * A Router instance manages all navigation and data loading/mutations\n */\nexport interface Router {\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Return the basename for the router\n   */\n  get basename(): RouterInit[\"basename\"];\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Return the future config for the router\n   */\n  get future(): FutureConfig;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Return the current state of the router\n   */\n  get state(): RouterState;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Return the routes for this router instance\n   */\n  get routes(): AgnosticDataRouteObject[];\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Return the window associated with the router\n   */\n  get window(): RouterInit[\"window\"];\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Initialize the router, including adding history listeners and kicking off\n   * initial data fetches.  Returns a function to cleanup listeners and abort\n   * any in-progress loads\n   */\n  initialize(): Router;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Subscribe to router.state updates\n   *\n   * @param fn function to call with the new state\n   */\n  subscribe(fn: RouterSubscriber): () => void;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Enable scroll restoration behavior in the router\n   *\n   * @param savedScrollPositions Object that will manage positions, in case\n   *                             it's being restored from sessionStorage\n   * @param getScrollPosition    Function to get the active Y scroll position\n   * @param getKey               Function to get the key to use for restoration\n   */\n  enableScrollRestoration(\n    savedScrollPositions: Record<string, number>,\n    getScrollPosition: GetScrollPositionFunction,\n    getKey?: GetScrollRestorationKeyFunction\n  ): () => void;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Navigate forward/backward in the history stack\n   * @param to Delta to move in the history stack\n   */\n  navigate(to: number): Promise<void>;\n\n  /**\n   * Navigate to the given path\n   * @param to Path to navigate to\n   * @param opts Navigation options (method, submission, etc.)\n   */\n  navigate(to: To | null, opts?: RouterNavigateOptions): Promise<void>;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Trigger a fetcher load/submission\n   *\n   * @param key     Fetcher key\n   * @param routeId Route that owns the fetcher\n   * @param href    href to fetch\n   * @param opts    Fetcher options, (method, submission, etc.)\n   */\n  fetch(\n    key: string,\n    routeId: string,\n    href: string | null,\n    opts?: RouterFetchOptions\n  ): void;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Trigger a revalidation of all current route loaders and fetcher loads\n   */\n  revalidate(): void;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Utility function to create an href for the given location\n   * @param location\n   */\n  createHref(location: Location | URL): string;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Utility function to URL encode a destination path according to the internal\n   * history implementation\n   * @param to\n   */\n  encodeLocation(to: To): Path;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Get/create a fetcher for the given key\n   * @param key\n   */\n  getFetcher<TData = any>(key: string): Fetcher<TData>;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Delete the fetcher for a given key\n   * @param key\n   */\n  deleteFetcher(key: string): void;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Cleanup listeners and abort any in-progress loads\n   */\n  dispose(): void;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Get a navigation blocker\n   * @param key The identifier for the blocker\n   * @param fn The blocker function implementation\n   */\n  getBlocker(key: string, fn: BlockerFunction): Blocker;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Delete a navigation blocker\n   * @param key The identifier for the blocker\n   */\n  deleteBlocker(key: string): void;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * HMR needs to pass in-flight route updates to React Router\n   * TODO: Replace this with granular route update APIs (addRoute, updateRoute, deleteRoute)\n   */\n  _internalSetRoutes(routes: AgnosticRouteObject[]): void;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Internal fetch AbortControllers accessed by unit tests\n   */\n  _internalFetchControllers: Map<string, AbortController>;\n\n  /**\n   * @internal\n   * PRIVATE - DO NOT USE\n   *\n   * Internal pending DeferredData instances accessed by unit tests\n   */\n  _internalActiveDeferreds: Map<string, DeferredData>;\n}\n\n/**\n * State maintained internally by the router.  During a navigation, all states\n * reflect the the \"old\" location unless otherwise noted.\n */\nexport interface RouterState {\n  /**\n   * The action of the most recent navigation\n   */\n  historyAction: HistoryAction;\n\n  /**\n   * The current location reflected by the router\n   */\n  location: Location;\n\n  /**\n   * The current set of route matches\n   */\n  matches: AgnosticDataRouteMatch[];\n\n  /**\n   * Tracks whether we've completed our initial data load\n   */\n  initialized: boolean;\n\n  /**\n   * Current scroll position we should start at for a new view\n   *  - number -> scroll position to restore to\n   *  - false -> do not restore scroll at all (used during submissions)\n   *  - null -> don't have a saved position, scroll to hash or top of page\n   */\n  restoreScrollPosition: number | false | null;\n\n  /**\n   * Indicate whether this navigation should skip resetting the scroll position\n   * if we are unable to restore the scroll position\n   */\n  preventScrollReset: boolean;\n\n  /**\n   * Tracks the state of the current navigation\n   */\n  navigation: Navigation;\n\n  /**\n   * Tracks any in-progress revalidations\n   */\n  revalidation: RevalidationState;\n\n  /**\n   * Data from the loaders for the current matches\n   */\n  loaderData: RouteData;\n\n  /**\n   * Data from the action for the current matches\n   */\n  actionData: RouteData | null;\n\n  /**\n   * Errors caught from loaders for the current matches\n   */\n  errors: RouteData | null;\n\n  /**\n   * Map of current fetchers\n   */\n  fetchers: Map<string, Fetcher>;\n\n  /**\n   * Map of current blockers\n   */\n  blockers: Map<string, Blocker>;\n}\n\n/**\n * Data that can be passed into hydrate a Router from SSR\n */\nexport type HydrationState = Partial<\n  Pick<RouterState, \"loaderData\" | \"actionData\" | \"errors\">\n>;\n\n/**\n * Future flags to toggle new feature behavior\n */\nexport interface FutureConfig {\n  v7_fetcherPersist: boolean;\n  v7_normalizeFormMethod: boolean;\n  v7_partialHydration: boolean;\n  v7_prependBasename: boolean;\n  v7_relativeSplatPath: boolean;\n}\n\n/**\n * Initialization options for createRouter\n */\nexport interface RouterInit {\n  routes: AgnosticRouteObject[];\n  history: History;\n  basename?: string;\n  /**\n   * @deprecated Use `mapRouteProperties` instead\n   */\n  detectErrorBoundary?: DetectErrorBoundaryFunction;\n  mapRouteProperties?: MapRoutePropertiesFunction;\n  future?: Partial<FutureConfig>;\n  hydrationData?: HydrationState;\n  window?: Window;\n}\n\n/**\n * State returned from a server-side query() call\n */\nexport interface StaticHandlerContext {\n  basename: Router[\"basename\"];\n  location: RouterState[\"location\"];\n  matches: RouterState[\"matches\"];\n  loaderData: RouterState[\"loaderData\"];\n  actionData: RouterState[\"actionData\"];\n  errors: RouterState[\"errors\"];\n  statusCode: number;\n  loaderHeaders: Record<string, Headers>;\n  actionHeaders: Record<string, Headers>;\n  activeDeferreds: Record<string, DeferredData> | null;\n  _deepestRenderedBoundaryId?: string | null;\n}\n\n/**\n * A StaticHandler instance manages a singular SSR navigation/fetch event\n */\nexport interface StaticHandler {\n  dataRoutes: AgnosticDataRouteObject[];\n  query(\n    request: Request,\n    opts?: { requestContext?: unknown }\n  ): Promise<StaticHandlerContext | Response>;\n  queryRoute(\n    request: Request,\n    opts?: { routeId?: string; requestContext?: unknown }\n  ): Promise<any>;\n}\n\ntype ViewTransitionOpts = {\n  currentLocation: Location;\n  nextLocation: Location;\n};\n\n/**\n * Subscriber function signature for changes to router state\n */\nexport interface RouterSubscriber {\n  (\n    state: RouterState,\n    opts: {\n      deletedFetchers: string[];\n      unstable_viewTransitionOpts?: ViewTransitionOpts;\n      unstable_flushSync: boolean;\n    }\n  ): void;\n}\n\n/**\n * Function signature for determining the key to be used in scroll restoration\n * for a given location\n */\nexport interface GetScrollRestorationKeyFunction {\n  (location: Location, matches: UIMatch[]): string | null;\n}\n\n/**\n * Function signature for determining the current scroll position\n */\nexport interface GetScrollPositionFunction {\n  (): number;\n}\n\nexport type RelativeRoutingType = \"route\" | \"path\";\n\n// Allowed for any navigation or fetch\ntype BaseNavigateOrFetchOptions = {\n  preventScrollReset?: boolean;\n  relative?: RelativeRoutingType;\n  unstable_flushSync?: boolean;\n};\n\n// Only allowed for navigations\ntype BaseNavigateOptions = BaseNavigateOrFetchOptions & {\n  replace?: boolean;\n  state?: any;\n  fromRouteId?: string;\n  unstable_viewTransition?: boolean;\n};\n\n// Only allowed for submission navigations\ntype BaseSubmissionOptions = {\n  formMethod?: HTMLFormMethod;\n  formEncType?: FormEncType;\n} & (\n  | { formData: FormData; body?: undefined }\n  | { formData?: undefined; body: any }\n);\n\n/**\n * Options for a navigate() call for a normal (non-submission) navigation\n */\ntype LinkNavigateOptions = BaseNavigateOptions;\n\n/**\n * Options for a navigate() call for a submission navigation\n */\ntype SubmissionNavigateOptions = BaseNavigateOptions & BaseSubmissionOptions;\n\n/**\n * Options to pass to navigate() for a navigation\n */\nexport type RouterNavigateOptions =\n  | LinkNavigateOptions\n  | SubmissionNavigateOptions;\n\n/**\n * Options for a fetch() load\n */\ntype LoadFetchOptions = BaseNavigateOrFetchOptions;\n\n/**\n * Options for a fetch() submission\n */\ntype SubmitFetchOptions = BaseNavigateOrFetchOptions & BaseSubmissionOptions;\n\n/**\n * Options to pass to fetch()\n */\nexport type RouterFetchOptions = LoadFetchOptions | SubmitFetchOptions;\n\n/**\n * Potential states for state.navigation\n */\nexport type NavigationStates = {\n  Idle: {\n    state: \"idle\";\n    location: undefined;\n    formMethod: undefined;\n    formAction: undefined;\n    formEncType: undefined;\n    formData: undefined;\n    json: undefined;\n    text: undefined;\n  };\n  Loading: {\n    state: \"loading\";\n    location: Location;\n    formMethod: Submission[\"formMethod\"] | undefined;\n    formAction: Submission[\"formAction\"] | undefined;\n    formEncType: Submission[\"formEncType\"] | undefined;\n    formData: Submission[\"formData\"] | undefined;\n    json: Submission[\"json\"] | undefined;\n    text: Submission[\"text\"] | undefined;\n  };\n  Submitting: {\n    state: \"submitting\";\n    location: Location;\n    formMethod: Submission[\"formMethod\"];\n    formAction: Submission[\"formAction\"];\n    formEncType: Submission[\"formEncType\"];\n    formData: Submission[\"formData\"];\n    json: Submission[\"json\"];\n    text: Submission[\"text\"];\n  };\n};\n\nexport type Navigation = NavigationStates[keyof NavigationStates];\n\nexport type RevalidationState = \"idle\" | \"loading\";\n\n/**\n * Potential states for fetchers\n */\ntype FetcherStates<TData = any> = {\n  Idle: {\n    state: \"idle\";\n    formMethod: undefined;\n    formAction: undefined;\n    formEncType: undefined;\n    text: undefined;\n    formData: undefined;\n    json: undefined;\n    data: TData | undefined;\n  };\n  Loading: {\n    state: \"loading\";\n    formMethod: Submission[\"formMethod\"] | undefined;\n    formAction: Submission[\"formAction\"] | undefined;\n    formEncType: Submission[\"formEncType\"] | undefined;\n    text: Submission[\"text\"] | undefined;\n    formData: Submission[\"formData\"] | undefined;\n    json: Submission[\"json\"] | undefined;\n    data: TData | undefined;\n  };\n  Submitting: {\n    state: \"submitting\";\n    formMethod: Submission[\"formMethod\"];\n    formAction: Submission[\"formAction\"];\n    formEncType: Submission[\"formEncType\"];\n    text: Submission[\"text\"];\n    formData: Submission[\"formData\"];\n    json: Submission[\"json\"];\n    data: TData | undefined;\n  };\n};\n\nexport type Fetcher<TData = any> =\n  FetcherStates<TData>[keyof FetcherStates<TData>];\n\ninterface BlockerBlocked {\n  state: \"blocked\";\n  reset(): void;\n  proceed(): void;\n  location: Location;\n}\n\ninterface BlockerUnblocked {\n  state: \"unblocked\";\n  reset: undefined;\n  proceed: undefined;\n  location: undefined;\n}\n\ninterface BlockerProceeding {\n  state: \"proceeding\";\n  reset: undefined;\n  proceed: undefined;\n  location: Location;\n}\n\nexport type Blocker = BlockerUnblocked | BlockerBlocked | BlockerProceeding;\n\nexport type BlockerFunction = (args: {\n  currentLocation: Location;\n  nextLocation: Location;\n  historyAction: HistoryAction;\n}) => boolean;\n\ninterface ShortCircuitable {\n  /**\n   * startNavigation does not need to complete the navigation because we\n   * redirected or got interrupted\n   */\n  shortCircuited?: boolean;\n}\n\ninterface HandleActionResult extends ShortCircuitable {\n  /**\n   * Error thrown from the current action, keyed by the route containing the\n   * error boundary to render the error.  To be committed to the state after\n   * loaders have completed\n   */\n  pendingActionError?: RouteData;\n  /**\n   * Data returned from the current action, keyed by the route owning the action.\n   * To be committed to the state after loaders have completed\n   */\n  pendingActionData?: RouteData;\n}\n\ninterface HandleLoadersResult extends ShortCircuitable {\n  /**\n   * loaderData returned from the current set of loaders\n   */\n  loaderData?: RouterState[\"loaderData\"];\n  /**\n   * errors thrown from the current set of loaders\n   */\n  errors?: RouterState[\"errors\"];\n}\n\n/**\n * Cached info for active fetcher.load() instances so they can participate\n * in revalidation\n */\ninterface FetchLoadMatch {\n  routeId: string;\n  path: string;\n}\n\n/**\n * Identified fetcher.load() calls that need to be revalidated\n */\ninterface RevalidatingFetcher extends FetchLoadMatch {\n  key: string;\n  match: AgnosticDataRouteMatch | null;\n  matches: AgnosticDataRouteMatch[] | null;\n  controller: AbortController | null;\n}\n\n/**\n * Wrapper object to allow us to throw any response out from callLoaderOrAction\n * for queryRouter while preserving whether or not it was thrown or returned\n * from the loader/action\n */\ninterface QueryRouteResponse {\n  type: ResultType.data | ResultType.error;\n  response: Response;\n}\n\nconst validMutationMethodsArr: MutationFormMethod[] = [\n  \"post\",\n  \"put\",\n  \"patch\",\n  \"delete\",\n];\nconst validMutationMethods = new Set<MutationFormMethod>(\n  validMutationMethodsArr\n);\n\nconst validRequestMethodsArr: FormMethod[] = [\n  \"get\",\n  ...validMutationMethodsArr,\n];\nconst validRequestMethods = new Set<FormMethod>(validRequestMethodsArr);\n\nconst redirectStatusCodes = new Set([301, 302, 303, 307, 308]);\nconst redirectPreserveMethodStatusCodes = new Set([307, 308]);\n\nexport const IDLE_NAVIGATION: NavigationStates[\"Idle\"] = {\n  state: \"idle\",\n  location: undefined,\n  formMethod: undefined,\n  formAction: undefined,\n  formEncType: undefined,\n  formData: undefined,\n  json: undefined,\n  text: undefined,\n};\n\nexport const IDLE_FETCHER: FetcherStates[\"Idle\"] = {\n  state: \"idle\",\n  data: undefined,\n  formMethod: undefined,\n  formAction: undefined,\n  formEncType: undefined,\n  formData: undefined,\n  json: undefined,\n  text: undefined,\n};\n\nexport const IDLE_BLOCKER: BlockerUnblocked = {\n  state: \"unblocked\",\n  proceed: undefined,\n  reset: undefined,\n  location: undefined,\n};\n\nconst ABSOLUTE_URL_REGEX = /^(?:[a-z][a-z0-9+.-]*:|\\/\\/)/i;\n\nconst defaultMapRouteProperties: MapRoutePropertiesFunction = (route) => ({\n  hasErrorBoundary: Boolean(route.hasErrorBoundary),\n});\n\nconst TRANSITIONS_STORAGE_KEY = \"remix-router-transitions\";\n\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region createRouter\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * Create a router and listen to history POP navigations\n */\nexport function createRouter(init: RouterInit): Router {\n  const routerWindow = init.window\n    ? init.window\n    : typeof window !== \"undefined\"\n    ? window\n    : undefined;\n  const isBrowser =\n    typeof routerWindow !== \"undefined\" &&\n    typeof routerWindow.document !== \"undefined\" &&\n    typeof routerWindow.document.createElement !== \"undefined\";\n  const isServer = !isBrowser;\n\n  invariant(\n    init.routes.length > 0,\n    \"You must provide a non-empty routes array to createRouter\"\n  );\n\n  let mapRouteProperties: MapRoutePropertiesFunction;\n  if (init.mapRouteProperties) {\n    mapRouteProperties = init.mapRouteProperties;\n  } else if (init.detectErrorBoundary) {\n    // If they are still using the deprecated version, wrap it with the new API\n    let detectErrorBoundary = init.detectErrorBoundary;\n    mapRouteProperties = (route) => ({\n      hasErrorBoundary: detectErrorBoundary(route),\n    });\n  } else {\n    mapRouteProperties = defaultMapRouteProperties;\n  }\n\n  // Routes keyed by ID\n  let manifest: RouteManifest = {};\n  // Routes in tree format for matching\n  let dataRoutes = convertRoutesToDataRoutes(\n    init.routes,\n    mapRouteProperties,\n    undefined,\n    manifest\n  );\n  let inFlightDataRoutes: AgnosticDataRouteObject[] | undefined;\n  let basename = init.basename || \"/\";\n  // Config driven behavior flags\n  let future: FutureConfig = {\n    v7_fetcherPersist: false,\n    v7_normalizeFormMethod: false,\n    v7_partialHydration: false,\n    v7_prependBasename: false,\n    v7_relativeSplatPath: false,\n    ...init.future,\n  };\n  // Cleanup function for history\n  let unlistenHistory: (() => void) | null = null;\n  // Externally-provided functions to call on all state changes\n  let subscribers = new Set<RouterSubscriber>();\n  // Externally-provided object to hold scroll restoration locations during routing\n  let savedScrollPositions: Record<string, number> | null = null;\n  // Externally-provided function to get scroll restoration keys\n  let getScrollRestorationKey: GetScrollRestorationKeyFunction | null = null;\n  // Externally-provided function to get current scroll position\n  let getScrollPosition: GetScrollPositionFunction | null = null;\n  // One-time flag to control the initial hydration scroll restoration.  Because\n  // we don't get the saved positions from <ScrollRestoration /> until _after_\n  // the initial render, we need to manually trigger a separate updateState to\n  // send along the restoreScrollPosition\n  // Set to true if we have `hydrationData` since we assume we were SSR'd and that\n  // SSR did the initial scroll restoration.\n  let initialScrollRestored = init.hydrationData != null;\n\n  let initialMatches = matchRoutes(dataRoutes, init.history.location, basename);\n  let initialErrors: RouteData | null = null;\n\n  if (initialMatches == null) {\n    // If we do not match a user-provided-route, fall back to the root\n    // to allow the error boundary to take over\n    let error = getInternalRouterError(404, {\n      pathname: init.history.location.pathname,\n    });\n    let { matches, route } = getShortCircuitMatches(dataRoutes);\n    initialMatches = matches;\n    initialErrors = { [route.id]: error };\n  }\n\n  let initialized: boolean;\n  let hasLazyRoutes = initialMatches.some((m) => m.route.lazy);\n  let hasLoaders = initialMatches.some((m) => m.route.loader);\n  if (hasLazyRoutes) {\n    // All initialMatches need to be loaded before we're ready.  If we have lazy\n    // functions around still then we'll need to run them in initialize()\n    initialized = false;\n  } else if (!hasLoaders) {\n    // If we've got no loaders to run, then we're good to go\n    initialized = true;\n  } else if (future.v7_partialHydration) {\n    // If partial hydration is enabled, we're initialized so long as we were\n    // provided with hydrationData for every route with a loader, and no loaders\n    // were marked for explicit hydration\n    let loaderData = init.hydrationData ? init.hydrationData.loaderData : null;\n    let errors = init.hydrationData ? init.hydrationData.errors : null;\n    let isRouteInitialized = (m: AgnosticDataRouteMatch) => {\n      // No loader, nothing to initialize\n      if (!m.route.loader) return true;\n      // Explicitly opting-in to running on hydration\n      if (m.route.loader.hydrate === true) return false;\n      // Otherwise, initialized if hydrated with data or an error\n      return (\n        (loaderData && loaderData[m.route.id] !== undefined) ||\n        (errors && errors[m.route.id] !== undefined)\n      );\n    };\n\n    // If errors exist, don't consider routes below the boundary\n    if (errors) {\n      let idx = initialMatches.findIndex(\n        (m) => errors![m.route.id] !== undefined\n      );\n      initialized = initialMatches.slice(0, idx + 1).every(isRouteInitialized);\n    } else {\n      initialized = initialMatches.every(isRouteInitialized);\n    }\n  } else {\n    // Without partial hydration - we're initialized if we were provided any\n    // hydrationData - which is expected to be complete\n    initialized = init.hydrationData != null;\n  }\n\n  let router: Router;\n  let state: RouterState = {\n    historyAction: init.history.action,\n    location: init.history.location,\n    matches: initialMatches,\n    initialized,\n    navigation: IDLE_NAVIGATION,\n    // Don't restore on initial updateState() if we were SSR'd\n    restoreScrollPosition: init.hydrationData != null ? false : null,\n    preventScrollReset: false,\n    revalidation: \"idle\",\n    loaderData: (init.hydrationData && init.hydrationData.loaderData) || {},\n    actionData: (init.hydrationData && init.hydrationData.actionData) || null,\n    errors: (init.hydrationData && init.hydrationData.errors) || initialErrors,\n    fetchers: new Map(),\n    blockers: new Map(),\n  };\n\n  // -- Stateful internal variables to manage navigations --\n  // Current navigation in progress (to be committed in completeNavigation)\n  let pendingAction: HistoryAction = HistoryAction.Pop;\n\n  // Should the current navigation prevent the scroll reset if scroll cannot\n  // be restored?\n  let pendingPreventScrollReset = false;\n\n  // AbortController for the active navigation\n  let pendingNavigationController: AbortController | null;\n\n  // Should the current navigation enable document.startViewTransition?\n  let pendingViewTransitionEnabled = false;\n\n  // Store applied view transitions so we can apply them on POP\n  let appliedViewTransitions: Map<string, Set<string>> = new Map<\n    string,\n    Set<string>\n  >();\n\n  // Cleanup function for persisting applied transitions to sessionStorage\n  let removePageHideEventListener: (() => void) | null = null;\n\n  // We use this to avoid touching history in completeNavigation if a\n  // revalidation is entirely uninterrupted\n  let isUninterruptedRevalidation = false;\n\n  // Use this internal flag to force revalidation of all loaders:\n  //  - submissions (completed or interrupted)\n  //  - useRevalidator()\n  //  - X-Remix-Revalidate (from redirect)\n  let isRevalidationRequired = false;\n\n  // Use this internal array to capture routes that require revalidation due\n  // to a cancelled deferred on action submission\n  let cancelledDeferredRoutes: string[] = [];\n\n  // Use this internal array to capture fetcher loads that were cancelled by an\n  // action navigation and require revalidation\n  let cancelledFetcherLoads: string[] = [];\n\n  // AbortControllers for any in-flight fetchers\n  let fetchControllers = new Map<string, AbortController>();\n\n  // Track loads based on the order in which they started\n  let incrementingLoadId = 0;\n\n  // Track the outstanding pending navigation data load to be compared against\n  // the globally incrementing load when a fetcher load lands after a completed\n  // navigation\n  let pendingNavigationLoadId = -1;\n\n  // Fetchers that triggered data reloads as a result of their actions\n  let fetchReloadIds = new Map<string, number>();\n\n  // Fetchers that triggered redirect navigations\n  let fetchRedirectIds = new Set<string>();\n\n  // Most recent href/match for fetcher.load calls for fetchers\n  let fetchLoadMatches = new Map<string, FetchLoadMatch>();\n\n  // Ref-count mounted fetchers so we know when it's ok to clean them up\n  let activeFetchers = new Map<string, number>();\n\n  // Fetchers that have requested a delete when using v7_fetcherPersist,\n  // they'll be officially removed after they return to idle\n  let deletedFetchers = new Set<string>();\n\n  // Store DeferredData instances for active route matches.  When a\n  // route loader returns defer() we stick one in here.  Then, when a nested\n  // promise resolves we update loaderData.  If a new navigation starts we\n  // cancel active deferreds for eliminated routes.\n  let activeDeferreds = new Map<string, DeferredData>();\n\n  // Store blocker functions in a separate Map outside of router state since\n  // we don't need to update UI state if they change\n  let blockerFunctions = new Map<string, BlockerFunction>();\n\n  // Flag to ignore the next history update, so we can revert the URL change on\n  // a POP navigation that was blocked by the user without touching router state\n  let ignoreNextHistoryUpdate = false;\n\n  // Initialize the router, all side effects should be kicked off from here.\n  // Implemented as a Fluent API for ease of:\n  //   let router = createRouter(init).initialize();\n  function initialize() {\n    // If history informs us of a POP navigation, start the navigation but do not update\n    // state.  We'll update our own state once the navigation completes\n    unlistenHistory = init.history.listen(\n      ({ action: historyAction, location, delta }) => {\n        // Ignore this event if it was just us resetting the URL from a\n        // blocked POP navigation\n        if (ignoreNextHistoryUpdate) {\n          ignoreNextHistoryUpdate = false;\n          return;\n        }\n\n        warning(\n          blockerFunctions.size === 0 || delta != null,\n          \"You are trying to use a blocker on a POP navigation to a location \" +\n            \"that was not created by @remix-run/router. This will fail silently in \" +\n            \"production. This can happen if you are navigating outside the router \" +\n            \"via `window.history.pushState`/`window.location.hash` instead of using \" +\n            \"router navigation APIs.  This can also happen if you are using \" +\n            \"createHashRouter and the user manually changes the URL.\"\n        );\n\n        let blockerKey = shouldBlockNavigation({\n          currentLocation: state.location,\n          nextLocation: location,\n          historyAction,\n        });\n\n        if (blockerKey && delta != null) {\n          // Restore the URL to match the current UI, but don't update router state\n          ignoreNextHistoryUpdate = true;\n          init.history.go(delta * -1);\n\n          // Put the blocker into a blocked state\n          updateBlocker(blockerKey, {\n            state: \"blocked\",\n            location,\n            proceed() {\n              updateBlocker(blockerKey!, {\n                state: \"proceeding\",\n                proceed: undefined,\n                reset: undefined,\n                location,\n              });\n              // Re-do the same POP navigation we just blocked\n              init.history.go(delta);\n            },\n            reset() {\n              let blockers = new Map(state.blockers);\n              blockers.set(blockerKey!, IDLE_BLOCKER);\n              updateState({ blockers });\n            },\n          });\n          return;\n        }\n\n        return startNavigation(historyAction, location);\n      }\n    );\n\n    if (isBrowser) {\n      // FIXME: This feels gross.  How can we cleanup the lines between\n      // scrollRestoration/appliedTransitions persistance?\n      restoreAppliedTransitions(routerWindow, appliedViewTransitions);\n      let _saveAppliedTransitions = () =>\n        persistAppliedTransitions(routerWindow, appliedViewTransitions);\n      routerWindow.addEventListener(\"pagehide\", _saveAppliedTransitions);\n      removePageHideEventListener = () =>\n        routerWindow.removeEventListener(\"pagehide\", _saveAppliedTransitions);\n    }\n\n    // Kick off initial data load if needed.  Use Pop to avoid modifying history\n    // Note we don't do any handling of lazy here.  For SPA's it'll get handled\n    // in the normal navigation flow.  For SSR it's expected that lazy modules are\n    // resolved prior to router creation since we can't go into a fallbackElement\n    // UI for SSR'd apps\n    if (!state.initialized) {\n      startNavigation(HistoryAction.Pop, state.location, {\n        initialHydration: true,\n      });\n    }\n\n    return router;\n  }\n\n  // Clean up a router and it's side effects\n  function dispose() {\n    if (unlistenHistory) {\n      unlistenHistory();\n    }\n    if (removePageHideEventListener) {\n      removePageHideEventListener();\n    }\n    subscribers.clear();\n    pendingNavigationController && pendingNavigationController.abort();\n    state.fetchers.forEach((_, key) => deleteFetcher(key));\n    state.blockers.forEach((_, key) => deleteBlocker(key));\n  }\n\n  // Subscribe to state updates for the router\n  function subscribe(fn: RouterSubscriber) {\n    subscribers.add(fn);\n    return () => subscribers.delete(fn);\n  }\n\n  // Update our state and notify the calling context of the change\n  function updateState(\n    newState: Partial<RouterState>,\n    opts: {\n      flushSync?: boolean;\n      viewTransitionOpts?: ViewTransitionOpts;\n    } = {}\n  ): void {\n    state = {\n      ...state,\n      ...newState,\n    };\n\n    // Prep fetcher cleanup so we can tell the UI which fetcher data entries\n    // can be removed\n    let completedFetchers: string[] = [];\n    let deletedFetchersKeys: string[] = [];\n\n    if (future.v7_fetcherPersist) {\n      state.fetchers.forEach((fetcher, key) => {\n        if (fetcher.state === \"idle\") {\n          if (deletedFetchers.has(key)) {\n            // Unmounted from the UI and can be totally removed\n            deletedFetchersKeys.push(key);\n          } else {\n            // Returned to idle but still mounted in the UI, so semi-remains for\n            // revalidations and such\n            completedFetchers.push(key);\n          }\n        }\n      });\n    }\n\n    // Iterate over a local copy so that if flushSync is used and we end up\n    // removing and adding a new subscriber due to the useCallback dependencies,\n    // we don't get ourselves into a loop calling the new subscriber immediately\n    [...subscribers].forEach((subscriber) =>\n      subscriber(state, {\n        deletedFetchers: deletedFetchersKeys,\n        unstable_viewTransitionOpts: opts.viewTransitionOpts,\n        unstable_flushSync: opts.flushSync === true,\n      })\n    );\n\n    // Remove idle fetchers from state since we only care about in-flight fetchers.\n    if (future.v7_fetcherPersist) {\n      completedFetchers.forEach((key) => state.fetchers.delete(key));\n      deletedFetchersKeys.forEach((key) => deleteFetcher(key));\n    }\n  }\n\n  // Complete a navigation returning the state.navigation back to the IDLE_NAVIGATION\n  // and setting state.[historyAction/location/matches] to the new route.\n  // - Location is a required param\n  // - Navigation will always be set to IDLE_NAVIGATION\n  // - Can pass any other state in newState\n  function completeNavigation(\n    location: Location,\n    newState: Partial<Omit<RouterState, \"action\" | \"location\" | \"navigation\">>,\n    { flushSync }: { flushSync?: boolean } = {}\n  ): void {\n    // Deduce if we're in a loading/actionReload state:\n    // - We have committed actionData in the store\n    // - The current navigation was a mutation submission\n    // - We're past the submitting state and into the loading state\n    // - The location being loaded is not the result of a redirect\n    let isActionReload =\n      state.actionData != null &&\n      state.navigation.formMethod != null &&\n      isMutationMethod(state.navigation.formMethod) &&\n      state.navigation.state === \"loading\" &&\n      location.state?._isRedirect !== true;\n\n    let actionData: RouteData | null;\n    if (newState.actionData) {\n      if (Object.keys(newState.actionData).length > 0) {\n        actionData = newState.actionData;\n      } else {\n        // Empty actionData -> clear prior actionData due to an action error\n        actionData = null;\n      }\n    } else if (isActionReload) {\n      // Keep the current data if we're wrapping up the action reload\n      actionData = state.actionData;\n    } else {\n      // Clear actionData on any other completed navigations\n      actionData = null;\n    }\n\n    // Always preserve any existing loaderData from re-used routes\n    let loaderData = newState.loaderData\n      ? mergeLoaderData(\n          state.loaderData,\n          newState.loaderData,\n          newState.matches || [],\n          newState.errors\n        )\n      : state.loaderData;\n\n    // On a successful navigation we can assume we got through all blockers\n    // so we can start fresh\n    let blockers = state.blockers;\n    if (blockers.size > 0) {\n      blockers = new Map(blockers);\n      blockers.forEach((_, k) => blockers.set(k, IDLE_BLOCKER));\n    }\n\n    // Always respect the user flag.  Otherwise don't reset on mutation\n    // submission navigations unless they redirect\n    let preventScrollReset =\n      pendingPreventScrollReset === true ||\n      (state.navigation.formMethod != null &&\n        isMutationMethod(state.navigation.formMethod) &&\n        location.state?._isRedirect !== true);\n\n    if (inFlightDataRoutes) {\n      dataRoutes = inFlightDataRoutes;\n      inFlightDataRoutes = undefined;\n    }\n\n    if (isUninterruptedRevalidation) {\n      // If this was an uninterrupted revalidation then do not touch history\n    } else if (pendingAction === HistoryAction.Pop) {\n      // Do nothing for POP - URL has already been updated\n    } else if (pendingAction === HistoryAction.Push) {\n      init.history.push(location, location.state);\n    } else if (pendingAction === HistoryAction.Replace) {\n      init.history.replace(location, location.state);\n    }\n\n    let viewTransitionOpts: ViewTransitionOpts | undefined;\n\n    // On POP, enable transitions if they were enabled on the original navigation\n    if (pendingAction === HistoryAction.Pop) {\n      // Forward takes precedence so they behave like the original navigation\n      let priorPaths = appliedViewTransitions.get(state.location.pathname);\n      if (priorPaths && priorPaths.has(location.pathname)) {\n        viewTransitionOpts = {\n          currentLocation: state.location,\n          nextLocation: location,\n        };\n      } else if (appliedViewTransitions.has(location.pathname)) {\n        // If we don't have a previous forward nav, assume we're popping back to\n        // the new location and enable if that location previously enabled\n        viewTransitionOpts = {\n          currentLocation: location,\n          nextLocation: state.location,\n        };\n      }\n    } else if (pendingViewTransitionEnabled) {\n      // Store the applied transition on PUSH/REPLACE\n      let toPaths = appliedViewTransitions.get(state.location.pathname);\n      if (toPaths) {\n        toPaths.add(location.pathname);\n      } else {\n        toPaths = new Set<string>([location.pathname]);\n        appliedViewTransitions.set(state.location.pathname, toPaths);\n      }\n      viewTransitionOpts = {\n        currentLocation: state.location,\n        nextLocation: location,\n      };\n    }\n\n    updateState(\n      {\n        ...newState, // matches, errors, fetchers go through as-is\n        actionData,\n        loaderData,\n        historyAction: pendingAction,\n        location,\n        initialized: true,\n        navigation: IDLE_NAVIGATION,\n        revalidation: \"idle\",\n        restoreScrollPosition: getSavedScrollPosition(\n          location,\n          newState.matches || state.matches\n        ),\n        preventScrollReset,\n        blockers,\n      },\n      {\n        viewTransitionOpts,\n        flushSync: flushSync === true,\n      }\n    );\n\n    // Reset stateful navigation vars\n    pendingAction = HistoryAction.Pop;\n    pendingPreventScrollReset = false;\n    pendingViewTransitionEnabled = false;\n    isUninterruptedRevalidation = false;\n    isRevalidationRequired = false;\n    cancelledDeferredRoutes = [];\n    cancelledFetcherLoads = [];\n  }\n\n  // Trigger a navigation event, which can either be a numerical POP or a PUSH\n  // replace with an optional submission\n  async function navigate(\n    to: number | To | null,\n    opts?: RouterNavigateOptions\n  ): Promise<void> {\n    if (typeof to === \"number\") {\n      init.history.go(to);\n      return;\n    }\n\n    let normalizedPath = normalizeTo(\n      state.location,\n      state.matches,\n      basename,\n      future.v7_prependBasename,\n      to,\n      future.v7_relativeSplatPath,\n      opts?.fromRouteId,\n      opts?.relative\n    );\n    let { path, submission, error } = normalizeNavigateOptions(\n      future.v7_normalizeFormMethod,\n      false,\n      normalizedPath,\n      opts\n    );\n\n    let currentLocation = state.location;\n    let nextLocation = createLocation(state.location, path, opts && opts.state);\n\n    // When using navigate as a PUSH/REPLACE we aren't reading an already-encoded\n    // URL from window.location, so we need to encode it here so the behavior\n    // remains the same as POP and non-data-router usages.  new URL() does all\n    // the same encoding we'd get from a history.pushState/window.location read\n    // without having to touch history\n    nextLocation = {\n      ...nextLocation,\n      ...init.history.encodeLocation(nextLocation),\n    };\n\n    let userReplace = opts && opts.replace != null ? opts.replace : undefined;\n\n    let historyAction = HistoryAction.Push;\n\n    if (userReplace === true) {\n      historyAction = HistoryAction.Replace;\n    } else if (userReplace === false) {\n      // no-op\n    } else if (\n      submission != null &&\n      isMutationMethod(submission.formMethod) &&\n      submission.formAction === state.location.pathname + state.location.search\n    ) {\n      // By default on submissions to the current location we REPLACE so that\n      // users don't have to double-click the back button to get to the prior\n      // location.  If the user redirects to a different location from the\n      // action/loader this will be ignored and the redirect will be a PUSH\n      historyAction = HistoryAction.Replace;\n    }\n\n    let preventScrollReset =\n      opts && \"preventScrollReset\" in opts\n        ? opts.preventScrollReset === true\n        : undefined;\n\n    let flushSync = (opts && opts.unstable_flushSync) === true;\n\n    let blockerKey = shouldBlockNavigation({\n      currentLocation,\n      nextLocation,\n      historyAction,\n    });\n\n    if (blockerKey) {\n      // Put the blocker into a blocked state\n      updateBlocker(blockerKey, {\n        state: \"blocked\",\n        location: nextLocation,\n        proceed() {\n          updateBlocker(blockerKey!, {\n            state: \"proceeding\",\n            proceed: undefined,\n            reset: undefined,\n            location: nextLocation,\n          });\n          // Send the same navigation through\n          navigate(to, opts);\n        },\n        reset() {\n          let blockers = new Map(state.blockers);\n          blockers.set(blockerKey!, IDLE_BLOCKER);\n          updateState({ blockers });\n        },\n      });\n      return;\n    }\n\n    return await startNavigation(historyAction, nextLocation, {\n      submission,\n      // Send through the formData serialization error if we have one so we can\n      // render at the right error boundary after we match routes\n      pendingError: error,\n      preventScrollReset,\n      replace: opts && opts.replace,\n      enableViewTransition: opts && opts.unstable_viewTransition,\n      flushSync,\n    });\n  }\n\n  // Revalidate all current loaders.  If a navigation is in progress or if this\n  // is interrupted by a navigation, allow this to \"succeed\" by calling all\n  // loaders during the next loader round\n  function revalidate() {\n    interruptActiveLoads();\n    updateState({ revalidation: \"loading\" });\n\n    // If we're currently submitting an action, we don't need to start a new\n    // navigation, we'll just let the follow up loader execution call all loaders\n    if (state.navigation.state === \"submitting\") {\n      return;\n    }\n\n    // If we're currently in an idle state, start a new navigation for the current\n    // action/location and mark it as uninterrupted, which will skip the history\n    // update in completeNavigation\n    if (state.navigation.state === \"idle\") {\n      startNavigation(state.historyAction, state.location, {\n        startUninterruptedRevalidation: true,\n      });\n      return;\n    }\n\n    // Otherwise, if we're currently in a loading state, just start a new\n    // navigation to the navigation.location but do not trigger an uninterrupted\n    // revalidation so that history correctly updates once the navigation completes\n    startNavigation(\n      pendingAction || state.historyAction,\n      state.navigation.location,\n      { overrideNavigation: state.navigation }\n    );\n  }\n\n  // Start a navigation to the given action/location.  Can optionally provide a\n  // overrideNavigation which will override the normalLoad in the case of a redirect\n  // navigation\n  async function startNavigation(\n    historyAction: HistoryAction,\n    location: Location,\n    opts?: {\n      initialHydration?: boolean;\n      submission?: Submission;\n      fetcherSubmission?: Submission;\n      overrideNavigation?: Navigation;\n      pendingError?: ErrorResponseImpl;\n      startUninterruptedRevalidation?: boolean;\n      preventScrollReset?: boolean;\n      replace?: boolean;\n      enableViewTransition?: boolean;\n      flushSync?: boolean;\n    }\n  ): Promise<void> {\n    // Abort any in-progress navigations and start a new one. Unset any ongoing\n    // uninterrupted revalidations unless told otherwise, since we want this\n    // new navigation to update history normally\n    pendingNavigationController && pendingNavigationController.abort();\n    pendingNavigationController = null;\n    pendingAction = historyAction;\n    isUninterruptedRevalidation =\n      (opts && opts.startUninterruptedRevalidation) === true;\n\n    // Save the current scroll position every time we start a new navigation,\n    // and track whether we should reset scroll on completion\n    saveScrollPosition(state.location, state.matches);\n    pendingPreventScrollReset = (opts && opts.preventScrollReset) === true;\n\n    pendingViewTransitionEnabled = (opts && opts.enableViewTransition) === true;\n\n    let routesToUse = inFlightDataRoutes || dataRoutes;\n    let loadingNavigation = opts && opts.overrideNavigation;\n    let matches = matchRoutes(routesToUse, location, basename);\n    let flushSync = (opts && opts.flushSync) === true;\n\n    // Short circuit with a 404 on the root error boundary if we match nothing\n    if (!matches) {\n      let error = getInternalRouterError(404, { pathname: location.pathname });\n      let { matches: notFoundMatches, route } =\n        getShortCircuitMatches(routesToUse);\n      // Cancel all pending deferred on 404s since we don't keep any routes\n      cancelActiveDeferreds();\n      completeNavigation(\n        location,\n        {\n          matches: notFoundMatches,\n          loaderData: {},\n          errors: {\n            [route.id]: error,\n          },\n        },\n        { flushSync }\n      );\n      return;\n    }\n\n    // Short circuit if it's only a hash change and not a revalidation or\n    // mutation submission.\n    //\n    // Ignore on initial page loads because since the initial load will always\n    // be \"same hash\".  For example, on /page#hash and submit a <Form method=\"post\">\n    // which will default to a navigation to /page\n    if (\n      state.initialized &&\n      !isRevalidationRequired &&\n      isHashChangeOnly(state.location, location) &&\n      !(opts && opts.submission && isMutationMethod(opts.submission.formMethod))\n    ) {\n      completeNavigation(location, { matches }, { flushSync });\n      return;\n    }\n\n    // Create a controller/Request for this navigation\n    pendingNavigationController = new AbortController();\n    let request = createClientSideRequest(\n      init.history,\n      location,\n      pendingNavigationController.signal,\n      opts && opts.submission\n    );\n    let pendingActionData: RouteData | undefined;\n    let pendingError: RouteData | undefined;\n\n    if (opts && opts.pendingError) {\n      // If we have a pendingError, it means the user attempted a GET submission\n      // with binary FormData so assign here and skip to handleLoaders.  That\n      // way we handle calling loaders above the boundary etc.  It's not really\n      // different from an actionError in that sense.\n      pendingError = {\n        [findNearestBoundary(matches).route.id]: opts.pendingError,\n      };\n    } else if (\n      opts &&\n      opts.submission &&\n      isMutationMethod(opts.submission.formMethod)\n    ) {\n      // Call action if we received an action submission\n      let actionOutput = await handleAction(\n        request,\n        location,\n        opts.submission,\n        matches,\n        { replace: opts.replace, flushSync }\n      );\n\n      if (actionOutput.shortCircuited) {\n        return;\n      }\n\n      pendingActionData = actionOutput.pendingActionData;\n      pendingError = actionOutput.pendingActionError;\n      loadingNavigation = getLoadingNavigation(location, opts.submission);\n      flushSync = false;\n\n      // Create a GET request for the loaders\n      request = new Request(request.url, { signal: request.signal });\n    }\n\n    // Call loaders\n    let { shortCircuited, loaderData, errors } = await handleLoaders(\n      request,\n      location,\n      matches,\n      loadingNavigation,\n      opts && opts.submission,\n      opts && opts.fetcherSubmission,\n      opts && opts.replace,\n      opts && opts.initialHydration === true,\n      flushSync,\n      pendingActionData,\n      pendingError\n    );\n\n    if (shortCircuited) {\n      return;\n    }\n\n    // Clean up now that the action/loaders have completed.  Don't clean up if\n    // we short circuited because pendingNavigationController will have already\n    // been assigned to a new controller for the next navigation\n    pendingNavigationController = null;\n\n    completeNavigation(location, {\n      matches,\n      ...(pendingActionData ? { actionData: pendingActionData } : {}),\n      loaderData,\n      errors,\n    });\n  }\n\n  // Call the action matched by the leaf route for this navigation and handle\n  // redirects/errors\n  async function handleAction(\n    request: Request,\n    location: Location,\n    submission: Submission,\n    matches: AgnosticDataRouteMatch[],\n    opts: { replace?: boolean; flushSync?: boolean } = {}\n  ): Promise<HandleActionResult> {\n    interruptActiveLoads();\n\n    // Put us in a submitting state\n    let navigation = getSubmittingNavigation(location, submission);\n    updateState({ navigation }, { flushSync: opts.flushSync === true });\n\n    // Call our action and get the result\n    let result: DataResult;\n    let actionMatch = getTargetMatch(matches, location);\n\n    if (!actionMatch.route.action && !actionMatch.route.lazy) {\n      result = {\n        type: ResultType.error,\n        error: getInternalRouterError(405, {\n          method: request.method,\n          pathname: location.pathname,\n          routeId: actionMatch.route.id,\n        }),\n      };\n    } else {\n      result = await callLoaderOrAction(\n        \"action\",\n        request,\n        actionMatch,\n        matches,\n        manifest,\n        mapRouteProperties,\n        basename,\n        future.v7_relativeSplatPath\n      );\n\n      if (request.signal.aborted) {\n        return { shortCircuited: true };\n      }\n    }\n\n    if (isRedirectResult(result)) {\n      let replace: boolean;\n      if (opts && opts.replace != null) {\n        replace = opts.replace;\n      } else {\n        // If the user didn't explicity indicate replace behavior, replace if\n        // we redirected to the exact same location we're currently at to avoid\n        // double back-buttons\n        replace =\n          result.location === state.location.pathname + state.location.search;\n      }\n      await startRedirectNavigation(state, result, { submission, replace });\n      return { shortCircuited: true };\n    }\n\n    if (isErrorResult(result)) {\n      // Store off the pending error - we use it to determine which loaders\n      // to call and will commit it when we complete the navigation\n      let boundaryMatch = findNearestBoundary(matches, actionMatch.route.id);\n\n      // By default, all submissions are REPLACE navigations, but if the\n      // action threw an error that'll be rendered in an errorElement, we fall\n      // back to PUSH so that the user can use the back button to get back to\n      // the pre-submission form location to try again\n      if ((opts && opts.replace) !== true) {\n        pendingAction = HistoryAction.Push;\n      }\n\n      return {\n        // Send back an empty object we can use to clear out any prior actionData\n        pendingActionData: {},\n        pendingActionError: { [boundaryMatch.route.id]: result.error },\n      };\n    }\n\n    if (isDeferredResult(result)) {\n      throw getInternalRouterError(400, { type: \"defer-action\" });\n    }\n\n    return {\n      pendingActionData: { [actionMatch.route.id]: result.data },\n    };\n  }\n\n  // Call all applicable loaders for the given matches, handling redirects,\n  // errors, etc.\n  async function handleLoaders(\n    request: Request,\n    location: Location,\n    matches: AgnosticDataRouteMatch[],\n    overrideNavigation?: Navigation,\n    submission?: Submission,\n    fetcherSubmission?: Submission,\n    replace?: boolean,\n    initialHydration?: boolean,\n    flushSync?: boolean,\n    pendingActionData?: RouteData,\n    pendingError?: RouteData\n  ): Promise<HandleLoadersResult> {\n    // Figure out the right navigation we want to use for data loading\n    let loadingNavigation =\n      overrideNavigation || getLoadingNavigation(location, submission);\n\n    // If this was a redirect from an action we don't have a \"submission\" but\n    // we have it on the loading navigation so use that if available\n    let activeSubmission =\n      submission ||\n      fetcherSubmission ||\n      getSubmissionFromNavigation(loadingNavigation);\n\n    let routesToUse = inFlightDataRoutes || dataRoutes;\n    let [matchesToLoad, revalidatingFetchers] = getMatchesToLoad(\n      init.history,\n      state,\n      matches,\n      activeSubmission,\n      location,\n      future.v7_partialHydration && initialHydration === true,\n      isRevalidationRequired,\n      cancelledDeferredRoutes,\n      cancelledFetcherLoads,\n      deletedFetchers,\n      fetchLoadMatches,\n      fetchRedirectIds,\n      routesToUse,\n      basename,\n      pendingActionData,\n      pendingError\n    );\n\n    // Cancel pending deferreds for no-longer-matched routes or routes we're\n    // about to reload.  Note that if this is an action reload we would have\n    // already cancelled all pending deferreds so this would be a no-op\n    cancelActiveDeferreds(\n      (routeId) =>\n        !(matches && matches.some((m) => m.route.id === routeId)) ||\n        (matchesToLoad && matchesToLoad.some((m) => m.route.id === routeId))\n    );\n\n    pendingNavigationLoadId = ++incrementingLoadId;\n\n    // Short circuit if we have no loaders to run\n    if (matchesToLoad.length === 0 && revalidatingFetchers.length === 0) {\n      let updatedFetchers = markFetchRedirectsDone();\n      completeNavigation(\n        location,\n        {\n          matches,\n          loaderData: {},\n          // Commit pending error if we're short circuiting\n          errors: pendingError || null,\n          ...(pendingActionData ? { actionData: pendingActionData } : {}),\n          ...(updatedFetchers ? { fetchers: new Map(state.fetchers) } : {}),\n        },\n        { flushSync }\n      );\n      return { shortCircuited: true };\n    }\n\n    // If this is an uninterrupted revalidation, we remain in our current idle\n    // state.  If not, we need to switch to our loading state and load data,\n    // preserving any new action data or existing action data (in the case of\n    // a revalidation interrupting an actionReload)\n    // If we have partialHydration enabled, then don't update the state for the\n    // initial data load since it's not a \"navigation\"\n    if (\n      !isUninterruptedRevalidation &&\n      (!future.v7_partialHydration || !initialHydration)\n    ) {\n      revalidatingFetchers.forEach((rf) => {\n        let fetcher = state.fetchers.get(rf.key);\n        let revalidatingFetcher = getLoadingFetcher(\n          undefined,\n          fetcher ? fetcher.data : undefined\n        );\n        state.fetchers.set(rf.key, revalidatingFetcher);\n      });\n      let actionData = pendingActionData || state.actionData;\n      updateState(\n        {\n          navigation: loadingNavigation,\n          ...(actionData\n            ? Object.keys(actionData).length === 0\n              ? { actionData: null }\n              : { actionData }\n            : {}),\n          ...(revalidatingFetchers.length > 0\n            ? { fetchers: new Map(state.fetchers) }\n            : {}),\n        },\n        {\n          flushSync,\n        }\n      );\n    }\n\n    revalidatingFetchers.forEach((rf) => {\n      if (fetchControllers.has(rf.key)) {\n        abortFetcher(rf.key);\n      }\n      if (rf.controller) {\n        // Fetchers use an independent AbortController so that aborting a fetcher\n        // (via deleteFetcher) does not abort the triggering navigation that\n        // triggered the revalidation\n        fetchControllers.set(rf.key, rf.controller);\n      }\n    });\n\n    // Proxy navigation abort through to revalidation fetchers\n    let abortPendingFetchRevalidations = () =>\n      revalidatingFetchers.forEach((f) => abortFetcher(f.key));\n    if (pendingNavigationController) {\n      pendingNavigationController.signal.addEventListener(\n        \"abort\",\n        abortPendingFetchRevalidations\n      );\n    }\n\n    let { results, loaderResults, fetcherResults } =\n      await callLoadersAndMaybeResolveData(\n        state.matches,\n        matches,\n        matchesToLoad,\n        revalidatingFetchers,\n        request\n      );\n\n    if (request.signal.aborted) {\n      return { shortCircuited: true };\n    }\n\n    // Clean up _after_ loaders have completed.  Don't clean up if we short\n    // circuited because fetchControllers would have been aborted and\n    // reassigned to new controllers for the next navigation\n    if (pendingNavigationController) {\n      pendingNavigationController.signal.removeEventListener(\n        \"abort\",\n        abortPendingFetchRevalidations\n      );\n    }\n    revalidatingFetchers.forEach((rf) => fetchControllers.delete(rf.key));\n\n    // If any loaders returned a redirect Response, start a new REPLACE navigation\n    let redirect = findRedirect(results);\n    if (redirect) {\n      if (redirect.idx >= matchesToLoad.length) {\n        // If this redirect came from a fetcher make sure we mark it in\n        // fetchRedirectIds so it doesn't get revalidated on the next set of\n        // loader executions\n        let fetcherKey =\n          revalidatingFetchers[redirect.idx - matchesToLoad.length].key;\n        fetchRedirectIds.add(fetcherKey);\n      }\n      await startRedirectNavigation(state, redirect.result, { replace });\n      return { shortCircuited: true };\n    }\n\n    // Process and commit output from loaders\n    let { loaderData, errors } = processLoaderData(\n      state,\n      matches,\n      matchesToLoad,\n      loaderResults,\n      pendingError,\n      revalidatingFetchers,\n      fetcherResults,\n      activeDeferreds\n    );\n\n    // Wire up subscribers to update loaderData as promises settle\n    activeDeferreds.forEach((deferredData, routeId) => {\n      deferredData.subscribe((aborted) => {\n        // Note: No need to updateState here since the TrackedPromise on\n        // loaderData is stable across resolve/reject\n        // Remove this instance if we were aborted or if promises have settled\n        if (aborted || deferredData.done) {\n          activeDeferreds.delete(routeId);\n        }\n      });\n    });\n\n    // During partial hydration, preserve SSR errors for routes that don't re-run\n    if (future.v7_partialHydration && initialHydration && state.errors) {\n      Object.entries(state.errors)\n        .filter(([id]) => !matchesToLoad.some((m) => m.route.id === id))\n        .forEach(([routeId, error]) => {\n          errors = Object.assign(errors || {}, { [routeId]: error });\n        });\n    }\n\n    let updatedFetchers = markFetchRedirectsDone();\n    let didAbortFetchLoads = abortStaleFetchLoads(pendingNavigationLoadId);\n    let shouldUpdateFetchers =\n      updatedFetchers || didAbortFetchLoads || revalidatingFetchers.length > 0;\n\n    return {\n      loaderData,\n      errors,\n      ...(shouldUpdateFetchers ? { fetchers: new Map(state.fetchers) } : {}),\n    };\n  }\n\n  // Trigger a fetcher load/submit for the given fetcher key\n  function fetch(\n    key: string,\n    routeId: string,\n    href: string | null,\n    opts?: RouterFetchOptions\n  ) {\n    if (isServer) {\n      throw new Error(\n        \"router.fetch() was called during the server render, but it shouldn't be. \" +\n          \"You are likely calling a useFetcher() method in the body of your component. \" +\n          \"Try moving it to a useEffect or a callback.\"\n      );\n    }\n\n    if (fetchControllers.has(key)) abortFetcher(key);\n    let flushSync = (opts && opts.unstable_flushSync) === true;\n\n    let routesToUse = inFlightDataRoutes || dataRoutes;\n    let normalizedPath = normalizeTo(\n      state.location,\n      state.matches,\n      basename,\n      future.v7_prependBasename,\n      href,\n      future.v7_relativeSplatPath,\n      routeId,\n      opts?.relative\n    );\n    let matches = matchRoutes(routesToUse, normalizedPath, basename);\n\n    if (!matches) {\n      setFetcherError(\n        key,\n        routeId,\n        getInternalRouterError(404, { pathname: normalizedPath }),\n        { flushSync }\n      );\n      return;\n    }\n\n    let { path, submission, error } = normalizeNavigateOptions(\n      future.v7_normalizeFormMethod,\n      true,\n      normalizedPath,\n      opts\n    );\n\n    if (error) {\n      setFetcherError(key, routeId, error, { flushSync });\n      return;\n    }\n\n    let match = getTargetMatch(matches, path);\n\n    pendingPreventScrollReset = (opts && opts.preventScrollReset) === true;\n\n    if (submission && isMutationMethod(submission.formMethod)) {\n      handleFetcherAction(\n        key,\n        routeId,\n        path,\n        match,\n        matches,\n        flushSync,\n        submission\n      );\n      return;\n    }\n\n    // Store off the match so we can call it's shouldRevalidate on subsequent\n    // revalidations\n    fetchLoadMatches.set(key, { routeId, path });\n    handleFetcherLoader(\n      key,\n      routeId,\n      path,\n      match,\n      matches,\n      flushSync,\n      submission\n    );\n  }\n\n  // Call the action for the matched fetcher.submit(), and then handle redirects,\n  // errors, and revalidation\n  async function handleFetcherAction(\n    key: string,\n    routeId: string,\n    path: string,\n    match: AgnosticDataRouteMatch,\n    requestMatches: AgnosticDataRouteMatch[],\n    flushSync: boolean,\n    submission: Submission\n  ) {\n    interruptActiveLoads();\n    fetchLoadMatches.delete(key);\n\n    if (!match.route.action && !match.route.lazy) {\n      let error = getInternalRouterError(405, {\n        method: submission.formMethod,\n        pathname: path,\n        routeId: routeId,\n      });\n      setFetcherError(key, routeId, error, { flushSync });\n      return;\n    }\n\n    // Put this fetcher into it's submitting state\n    let existingFetcher = state.fetchers.get(key);\n    updateFetcherState(key, getSubmittingFetcher(submission, existingFetcher), {\n      flushSync,\n    });\n\n    // Call the action for the fetcher\n    let abortController = new AbortController();\n    let fetchRequest = createClientSideRequest(\n      init.history,\n      path,\n      abortController.signal,\n      submission\n    );\n    fetchControllers.set(key, abortController);\n\n    let originatingLoadId = incrementingLoadId;\n    let actionResult = await callLoaderOrAction(\n      \"action\",\n      fetchRequest,\n      match,\n      requestMatches,\n      manifest,\n      mapRouteProperties,\n      basename,\n      future.v7_relativeSplatPath\n    );\n\n    if (fetchRequest.signal.aborted) {\n      // We can delete this so long as we weren't aborted by our own fetcher\n      // re-submit which would have put _new_ controller is in fetchControllers\n      if (fetchControllers.get(key) === abortController) {\n        fetchControllers.delete(key);\n      }\n      return;\n    }\n\n    // When using v7_fetcherPersist, we don't want errors bubbling up to the UI\n    // or redirects processed for unmounted fetchers so we just revert them to\n    // idle\n    if (future.v7_fetcherPersist && deletedFetchers.has(key)) {\n      if (isRedirectResult(actionResult) || isErrorResult(actionResult)) {\n        updateFetcherState(key, getDoneFetcher(undefined));\n        return;\n      }\n      // Let SuccessResult's fall through for revalidation\n    } else {\n      if (isRedirectResult(actionResult)) {\n        fetchControllers.delete(key);\n        if (pendingNavigationLoadId > originatingLoadId) {\n          // A new navigation was kicked off after our action started, so that\n          // should take precedence over this redirect navigation.  We already\n          // set isRevalidationRequired so all loaders for the new route should\n          // fire unless opted out via shouldRevalidate\n          updateFetcherState(key, getDoneFetcher(undefined));\n          return;\n        } else {\n          fetchRedirectIds.add(key);\n          updateFetcherState(key, getLoadingFetcher(submission));\n          return startRedirectNavigation(state, actionResult, {\n            fetcherSubmission: submission,\n          });\n        }\n      }\n\n      // Process any non-redirect errors thrown\n      if (isErrorResult(actionResult)) {\n        setFetcherError(key, routeId, actionResult.error);\n        return;\n      }\n    }\n\n    if (isDeferredResult(actionResult)) {\n      throw getInternalRouterError(400, { type: \"defer-action\" });\n    }\n\n    // Start the data load for current matches, or the next location if we're\n    // in the middle of a navigation\n    let nextLocation = state.navigation.location || state.location;\n    let revalidationRequest = createClientSideRequest(\n      init.history,\n      nextLocation,\n      abortController.signal\n    );\n    let routesToUse = inFlightDataRoutes || dataRoutes;\n    let matches =\n      state.navigation.state !== \"idle\"\n        ? matchRoutes(routesToUse, state.navigation.location, basename)\n        : state.matches;\n\n    invariant(matches, \"Didn't find any matches after fetcher action\");\n\n    let loadId = ++incrementingLoadId;\n    fetchReloadIds.set(key, loadId);\n\n    let loadFetcher = getLoadingFetcher(submission, actionResult.data);\n    state.fetchers.set(key, loadFetcher);\n\n    let [matchesToLoad, revalidatingFetchers] = getMatchesToLoad(\n      init.history,\n      state,\n      matches,\n      submission,\n      nextLocation,\n      false,\n      isRevalidationRequired,\n      cancelledDeferredRoutes,\n      cancelledFetcherLoads,\n      deletedFetchers,\n      fetchLoadMatches,\n      fetchRedirectIds,\n      routesToUse,\n      basename,\n      { [match.route.id]: actionResult.data },\n      undefined // No need to send through errors since we short circuit above\n    );\n\n    // Put all revalidating fetchers into the loading state, except for the\n    // current fetcher which we want to keep in it's current loading state which\n    // contains it's action submission info + action data\n    revalidatingFetchers\n      .filter((rf) => rf.key !== key)\n      .forEach((rf) => {\n        let staleKey = rf.key;\n        let existingFetcher = state.fetchers.get(staleKey);\n        let revalidatingFetcher = getLoadingFetcher(\n          undefined,\n          existingFetcher ? existingFetcher.data : undefined\n        );\n        state.fetchers.set(staleKey, revalidatingFetcher);\n        if (fetchControllers.has(staleKey)) {\n          abortFetcher(staleKey);\n        }\n        if (rf.controller) {\n          fetchControllers.set(staleKey, rf.controller);\n        }\n      });\n\n    updateState({ fetchers: new Map(state.fetchers) });\n\n    let abortPendingFetchRevalidations = () =>\n      revalidatingFetchers.forEach((rf) => abortFetcher(rf.key));\n\n    abortController.signal.addEventListener(\n      \"abort\",\n      abortPendingFetchRevalidations\n    );\n\n    let { results, loaderResults, fetcherResults } =\n      await callLoadersAndMaybeResolveData(\n        state.matches,\n        matches,\n        matchesToLoad,\n        revalidatingFetchers,\n        revalidationRequest\n      );\n\n    if (abortController.signal.aborted) {\n      return;\n    }\n\n    abortController.signal.removeEventListener(\n      \"abort\",\n      abortPendingFetchRevalidations\n    );\n\n    fetchReloadIds.delete(key);\n    fetchControllers.delete(key);\n    revalidatingFetchers.forEach((r) => fetchControllers.delete(r.key));\n\n    let redirect = findRedirect(results);\n    if (redirect) {\n      if (redirect.idx >= matchesToLoad.length) {\n        // If this redirect came from a fetcher make sure we mark it in\n        // fetchRedirectIds so it doesn't get revalidated on the next set of\n        // loader executions\n        let fetcherKey =\n          revalidatingFetchers[redirect.idx - matchesToLoad.length].key;\n        fetchRedirectIds.add(fetcherKey);\n      }\n      return startRedirectNavigation(state, redirect.result);\n    }\n\n    // Process and commit output from loaders\n    let { loaderData, errors } = processLoaderData(\n      state,\n      state.matches,\n      matchesToLoad,\n      loaderResults,\n      undefined,\n      revalidatingFetchers,\n      fetcherResults,\n      activeDeferreds\n    );\n\n    // Since we let revalidations complete even if the submitting fetcher was\n    // deleted, only put it back to idle if it hasn't been deleted\n    if (state.fetchers.has(key)) {\n      let doneFetcher = getDoneFetcher(actionResult.data);\n      state.fetchers.set(key, doneFetcher);\n    }\n\n    abortStaleFetchLoads(loadId);\n\n    // If we are currently in a navigation loading state and this fetcher is\n    // more recent than the navigation, we want the newer data so abort the\n    // navigation and complete it with the fetcher data\n    if (\n      state.navigation.state === \"loading\" &&\n      loadId > pendingNavigationLoadId\n    ) {\n      invariant(pendingAction, \"Expected pending action\");\n      pendingNavigationController && pendingNavigationController.abort();\n\n      completeNavigation(state.navigation.location, {\n        matches,\n        loaderData,\n        errors,\n        fetchers: new Map(state.fetchers),\n      });\n    } else {\n      // otherwise just update with the fetcher data, preserving any existing\n      // loaderData for loaders that did not need to reload.  We have to\n      // manually merge here since we aren't going through completeNavigation\n      updateState({\n        errors,\n        loaderData: mergeLoaderData(\n          state.loaderData,\n          loaderData,\n          matches,\n          errors\n        ),\n        fetchers: new Map(state.fetchers),\n      });\n      isRevalidationRequired = false;\n    }\n  }\n\n  // Call the matched loader for fetcher.load(), handling redirects, errors, etc.\n  async function handleFetcherLoader(\n    key: string,\n    routeId: string,\n    path: string,\n    match: AgnosticDataRouteMatch,\n    matches: AgnosticDataRouteMatch[],\n    flushSync: boolean,\n    submission?: Submission\n  ) {\n    let existingFetcher = state.fetchers.get(key);\n    updateFetcherState(\n      key,\n      getLoadingFetcher(\n        submission,\n        existingFetcher ? existingFetcher.data : undefined\n      ),\n      { flushSync }\n    );\n\n    // Call the loader for this fetcher route match\n    let abortController = new AbortController();\n    let fetchRequest = createClientSideRequest(\n      init.history,\n      path,\n      abortController.signal\n    );\n    fetchControllers.set(key, abortController);\n\n    let originatingLoadId = incrementingLoadId;\n    let result: DataResult = await callLoaderOrAction(\n      \"loader\",\n      fetchRequest,\n      match,\n      matches,\n      manifest,\n      mapRouteProperties,\n      basename,\n      future.v7_relativeSplatPath\n    );\n\n    // Deferred isn't supported for fetcher loads, await everything and treat it\n    // as a normal load.  resolveDeferredData will return undefined if this\n    // fetcher gets aborted, so we just leave result untouched and short circuit\n    // below if that happens\n    if (isDeferredResult(result)) {\n      result =\n        (await resolveDeferredData(result, fetchRequest.signal, true)) ||\n        result;\n    }\n\n    // We can delete this so long as we weren't aborted by our our own fetcher\n    // re-load which would have put _new_ controller is in fetchControllers\n    if (fetchControllers.get(key) === abortController) {\n      fetchControllers.delete(key);\n    }\n\n    if (fetchRequest.signal.aborted) {\n      return;\n    }\n\n    // We don't want errors bubbling up or redirects followed for unmounted\n    // fetchers, so short circuit here if it was removed from the UI\n    if (deletedFetchers.has(key)) {\n      updateFetcherState(key, getDoneFetcher(undefined));\n      return;\n    }\n\n    // If the loader threw a redirect Response, start a new REPLACE navigation\n    if (isRedirectResult(result)) {\n      if (pendingNavigationLoadId > originatingLoadId) {\n        // A new navigation was kicked off after our loader started, so that\n        // should take precedence over this redirect navigation\n        updateFetcherState(key, getDoneFetcher(undefined));\n        return;\n      } else {\n        fetchRedirectIds.add(key);\n        await startRedirectNavigation(state, result);\n        return;\n      }\n    }\n\n    // Process any non-redirect errors thrown\n    if (isErrorResult(result)) {\n      setFetcherError(key, routeId, result.error);\n      return;\n    }\n\n    invariant(!isDeferredResult(result), \"Unhandled fetcher deferred data\");\n\n    // Put the fetcher back into an idle state\n    updateFetcherState(key, getDoneFetcher(result.data));\n  }\n\n  /**\n   * Utility function to handle redirects returned from an action or loader.\n   * Normally, a redirect \"replaces\" the navigation that triggered it.  So, for\n   * example:\n   *\n   *  - user is on /a\n   *  - user clicks a link to /b\n   *  - loader for /b redirects to /c\n   *\n   * In a non-JS app the browser would track the in-flight navigation to /b and\n   * then replace it with /c when it encountered the redirect response.  In\n   * the end it would only ever update the URL bar with /c.\n   *\n   * In client-side routing using pushState/replaceState, we aim to emulate\n   * this behavior and we also do not update history until the end of the\n   * navigation (including processed redirects).  This means that we never\n   * actually touch history until we've processed redirects, so we just use\n   * the history action from the original navigation (PUSH or REPLACE).\n   */\n  async function startRedirectNavigation(\n    state: RouterState,\n    redirect: RedirectResult,\n    {\n      submission,\n      fetcherSubmission,\n      replace,\n    }: {\n      submission?: Submission;\n      fetcherSubmission?: Submission;\n      replace?: boolean;\n    } = {}\n  ) {\n    if (redirect.revalidate) {\n      isRevalidationRequired = true;\n    }\n\n    let redirectLocation = createLocation(state.location, redirect.location, {\n      _isRedirect: true,\n    });\n    invariant(\n      redirectLocation,\n      \"Expected a location on the redirect navigation\"\n    );\n\n    if (isBrowser) {\n      let isDocumentReload = false;\n\n      if (redirect.reloadDocument) {\n        // Hard reload if the response contained X-Remix-Reload-Document\n        isDocumentReload = true;\n      } else if (ABSOLUTE_URL_REGEX.test(redirect.location)) {\n        const url = init.history.createURL(redirect.location);\n        isDocumentReload =\n          // Hard reload if it's an absolute URL to a new origin\n          url.origin !== routerWindow.location.origin ||\n          // Hard reload if it's an absolute URL that does not match our basename\n          stripBasename(url.pathname, basename) == null;\n      }\n\n      if (isDocumentReload) {\n        if (replace) {\n          routerWindow.location.replace(redirect.location);\n        } else {\n          routerWindow.location.assign(redirect.location);\n        }\n        return;\n      }\n    }\n\n    // There's no need to abort on redirects, since we don't detect the\n    // redirect until the action/loaders have settled\n    pendingNavigationController = null;\n\n    let redirectHistoryAction =\n      replace === true ? HistoryAction.Replace : HistoryAction.Push;\n\n    // Use the incoming submission if provided, fallback on the active one in\n    // state.navigation\n    let { formMethod, formAction, formEncType } = state.navigation;\n    if (\n      !submission &&\n      !fetcherSubmission &&\n      formMethod &&\n      formAction &&\n      formEncType\n    ) {\n      submission = getSubmissionFromNavigation(state.navigation);\n    }\n\n    // If this was a 307/308 submission we want to preserve the HTTP method and\n    // re-submit the GET/POST/PUT/PATCH/DELETE as a submission navigation to the\n    // redirected location\n    let activeSubmission = submission || fetcherSubmission;\n    if (\n      redirectPreserveMethodStatusCodes.has(redirect.status) &&\n      activeSubmission &&\n      isMutationMethod(activeSubmission.formMethod)\n    ) {\n      await startNavigation(redirectHistoryAction, redirectLocation, {\n        submission: {\n          ...activeSubmission,\n          formAction: redirect.location,\n        },\n        // Preserve this flag across redirects\n        preventScrollReset: pendingPreventScrollReset,\n      });\n    } else {\n      // If we have a navigation submission, we will preserve it through the\n      // redirect navigation\n      let overrideNavigation = getLoadingNavigation(\n        redirectLocation,\n        submission\n      );\n      await startNavigation(redirectHistoryAction, redirectLocation, {\n        overrideNavigation,\n        // Send fetcher submissions through for shouldRevalidate\n        fetcherSubmission,\n        // Preserve this flag across redirects\n        preventScrollReset: pendingPreventScrollReset,\n      });\n    }\n  }\n\n  async function callLoadersAndMaybeResolveData(\n    currentMatches: AgnosticDataRouteMatch[],\n    matches: AgnosticDataRouteMatch[],\n    matchesToLoad: AgnosticDataRouteMatch[],\n    fetchersToLoad: RevalidatingFetcher[],\n    request: Request\n  ) {\n    // Call all navigation loaders and revalidating fetcher loaders in parallel,\n    // then slice off the results into separate arrays so we can handle them\n    // accordingly\n    let results = await Promise.all([\n      ...matchesToLoad.map((match) =>\n        callLoaderOrAction(\n          \"loader\",\n          request,\n          match,\n          matches,\n          manifest,\n          mapRouteProperties,\n          basename,\n          future.v7_relativeSplatPath\n        )\n      ),\n      ...fetchersToLoad.map((f) => {\n        if (f.matches && f.match && f.controller) {\n          return callLoaderOrAction(\n            \"loader\",\n            createClientSideRequest(init.history, f.path, f.controller.signal),\n            f.match,\n            f.matches,\n            manifest,\n            mapRouteProperties,\n            basename,\n            future.v7_relativeSplatPath\n          );\n        } else {\n          let error: ErrorResult = {\n            type: ResultType.error,\n            error: getInternalRouterError(404, { pathname: f.path }),\n          };\n          return error;\n        }\n      }),\n    ]);\n    let loaderResults = results.slice(0, matchesToLoad.length);\n    let fetcherResults = results.slice(matchesToLoad.length);\n\n    await Promise.all([\n      resolveDeferredResults(\n        currentMatches,\n        matchesToLoad,\n        loaderResults,\n        loaderResults.map(() => request.signal),\n        false,\n        state.loaderData\n      ),\n      resolveDeferredResults(\n        currentMatches,\n        fetchersToLoad.map((f) => f.match),\n        fetcherResults,\n        fetchersToLoad.map((f) => (f.controller ? f.controller.signal : null)),\n        true\n      ),\n    ]);\n\n    return { results, loaderResults, fetcherResults };\n  }\n\n  function interruptActiveLoads() {\n    // Every interruption triggers a revalidation\n    isRevalidationRequired = true;\n\n    // Cancel pending route-level deferreds and mark cancelled routes for\n    // revalidation\n    cancelledDeferredRoutes.push(...cancelActiveDeferreds());\n\n    // Abort in-flight fetcher loads\n    fetchLoadMatches.forEach((_, key) => {\n      if (fetchControllers.has(key)) {\n        cancelledFetcherLoads.push(key);\n        abortFetcher(key);\n      }\n    });\n  }\n\n  function updateFetcherState(\n    key: string,\n    fetcher: Fetcher,\n    opts: { flushSync?: boolean } = {}\n  ) {\n    state.fetchers.set(key, fetcher);\n    updateState(\n      { fetchers: new Map(state.fetchers) },\n      { flushSync: (opts && opts.flushSync) === true }\n    );\n  }\n\n  function setFetcherError(\n    key: string,\n    routeId: string,\n    error: any,\n    opts: { flushSync?: boolean } = {}\n  ) {\n    let boundaryMatch = findNearestBoundary(state.matches, routeId);\n    deleteFetcher(key);\n    updateState(\n      {\n        errors: {\n          [boundaryMatch.route.id]: error,\n        },\n        fetchers: new Map(state.fetchers),\n      },\n      { flushSync: (opts && opts.flushSync) === true }\n    );\n  }\n\n  function getFetcher<TData = any>(key: string): Fetcher<TData> {\n    if (future.v7_fetcherPersist) {\n      activeFetchers.set(key, (activeFetchers.get(key) || 0) + 1);\n      // If this fetcher was previously marked for deletion, unmark it since we\n      // have a new instance\n      if (deletedFetchers.has(key)) {\n        deletedFetchers.delete(key);\n      }\n    }\n    return state.fetchers.get(key) || IDLE_FETCHER;\n  }\n\n  function deleteFetcher(key: string): void {\n    let fetcher = state.fetchers.get(key);\n    // Don't abort the controller if this is a deletion of a fetcher.submit()\n    // in it's loading phase since - we don't want to abort the corresponding\n    // revalidation and want them to complete and land\n    if (\n      fetchControllers.has(key) &&\n      !(fetcher && fetcher.state === \"loading\" && fetchReloadIds.has(key))\n    ) {\n      abortFetcher(key);\n    }\n    fetchLoadMatches.delete(key);\n    fetchReloadIds.delete(key);\n    fetchRedirectIds.delete(key);\n    deletedFetchers.delete(key);\n    state.fetchers.delete(key);\n  }\n\n  function deleteFetcherAndUpdateState(key: string): void {\n    if (future.v7_fetcherPersist) {\n      let count = (activeFetchers.get(key) || 0) - 1;\n      if (count <= 0) {\n        activeFetchers.delete(key);\n        deletedFetchers.add(key);\n      } else {\n        activeFetchers.set(key, count);\n      }\n    } else {\n      deleteFetcher(key);\n    }\n    updateState({ fetchers: new Map(state.fetchers) });\n  }\n\n  function abortFetcher(key: string) {\n    let controller = fetchControllers.get(key);\n    invariant(controller, `Expected fetch controller: ${key}`);\n    controller.abort();\n    fetchControllers.delete(key);\n  }\n\n  function markFetchersDone(keys: string[]) {\n    for (let key of keys) {\n      let fetcher = getFetcher(key);\n      let doneFetcher = getDoneFetcher(fetcher.data);\n      state.fetchers.set(key, doneFetcher);\n    }\n  }\n\n  function markFetchRedirectsDone(): boolean {\n    let doneKeys = [];\n    let updatedFetchers = false;\n    for (let key of fetchRedirectIds) {\n      let fetcher = state.fetchers.get(key);\n      invariant(fetcher, `Expected fetcher: ${key}`);\n      if (fetcher.state === \"loading\") {\n        fetchRedirectIds.delete(key);\n        doneKeys.push(key);\n        updatedFetchers = true;\n      }\n    }\n    markFetchersDone(doneKeys);\n    return updatedFetchers;\n  }\n\n  function abortStaleFetchLoads(landedId: number): boolean {\n    let yeetedKeys = [];\n    for (let [key, id] of fetchReloadIds) {\n      if (id < landedId) {\n        let fetcher = state.fetchers.get(key);\n        invariant(fetcher, `Expected fetcher: ${key}`);\n        if (fetcher.state === \"loading\") {\n          abortFetcher(key);\n          fetchReloadIds.delete(key);\n          yeetedKeys.push(key);\n        }\n      }\n    }\n    markFetchersDone(yeetedKeys);\n    return yeetedKeys.length > 0;\n  }\n\n  function getBlocker(key: string, fn: BlockerFunction) {\n    let blocker: Blocker = state.blockers.get(key) || IDLE_BLOCKER;\n\n    if (blockerFunctions.get(key) !== fn) {\n      blockerFunctions.set(key, fn);\n    }\n\n    return blocker;\n  }\n\n  function deleteBlocker(key: string) {\n    state.blockers.delete(key);\n    blockerFunctions.delete(key);\n  }\n\n  // Utility function to update blockers, ensuring valid state transitions\n  function updateBlocker(key: string, newBlocker: Blocker) {\n    let blocker = state.blockers.get(key) || IDLE_BLOCKER;\n\n    // Poor mans state machine :)\n    // https://mermaid.live/edit#pako:eNqVkc9OwzAMxl8l8nnjAYrEtDIOHEBIgwvKJTReGy3_lDpIqO27k6awMG0XcrLlnz87nwdonESogKXXBuE79rq75XZO3-yHds0RJVuv70YrPlUrCEe2HfrORS3rubqZfuhtpg5C9wk5tZ4VKcRUq88q9Z8RS0-48cE1iHJkL0ugbHuFLus9L6spZy8nX9MP2CNdomVaposqu3fGayT8T8-jJQwhepo_UtpgBQaDEUom04dZhAN1aJBDlUKJBxE1ceB2Smj0Mln-IBW5AFU2dwUiktt_2Qaq2dBfaKdEup85UV7Yd-dKjlnkabl2Pvr0DTkTreM\n    invariant(\n      (blocker.state === \"unblocked\" && newBlocker.state === \"blocked\") ||\n        (blocker.state === \"blocked\" && newBlocker.state === \"blocked\") ||\n        (blocker.state === \"blocked\" && newBlocker.state === \"proceeding\") ||\n        (blocker.state === \"blocked\" && newBlocker.state === \"unblocked\") ||\n        (blocker.state === \"proceeding\" && newBlocker.state === \"unblocked\"),\n      `Invalid blocker state transition: ${blocker.state} -> ${newBlocker.state}`\n    );\n\n    let blockers = new Map(state.blockers);\n    blockers.set(key, newBlocker);\n    updateState({ blockers });\n  }\n\n  function shouldBlockNavigation({\n    currentLocation,\n    nextLocation,\n    historyAction,\n  }: {\n    currentLocation: Location;\n    nextLocation: Location;\n    historyAction: HistoryAction;\n  }): string | undefined {\n    if (blockerFunctions.size === 0) {\n      return;\n    }\n\n    // We ony support a single active blocker at the moment since we don't have\n    // any compelling use cases for multi-blocker yet\n    if (blockerFunctions.size > 1) {\n      warning(false, \"A router only supports one blocker at a time\");\n    }\n\n    let entries = Array.from(blockerFunctions.entries());\n    let [blockerKey, blockerFunction] = entries[entries.length - 1];\n    let blocker = state.blockers.get(blockerKey);\n\n    if (blocker && blocker.state === \"proceeding\") {\n      // If the blocker is currently proceeding, we don't need to re-check\n      // it and can let this navigation continue\n      return;\n    }\n\n    // At this point, we know we're unblocked/blocked so we need to check the\n    // user-provided blocker function\n    if (blockerFunction({ currentLocation, nextLocation, historyAction })) {\n      return blockerKey;\n    }\n  }\n\n  function cancelActiveDeferreds(\n    predicate?: (routeId: string) => boolean\n  ): string[] {\n    let cancelledRouteIds: string[] = [];\n    activeDeferreds.forEach((dfd, routeId) => {\n      if (!predicate || predicate(routeId)) {\n        // Cancel the deferred - but do not remove from activeDeferreds here -\n        // we rely on the subscribers to do that so our tests can assert proper\n        // cleanup via _internalActiveDeferreds\n        dfd.cancel();\n        cancelledRouteIds.push(routeId);\n        activeDeferreds.delete(routeId);\n      }\n    });\n    return cancelledRouteIds;\n  }\n\n  // Opt in to capturing and reporting scroll positions during navigations,\n  // used by the <ScrollRestoration> component\n  function enableScrollRestoration(\n    positions: Record<string, number>,\n    getPosition: GetScrollPositionFunction,\n    getKey?: GetScrollRestorationKeyFunction\n  ) {\n    savedScrollPositions = positions;\n    getScrollPosition = getPosition;\n    getScrollRestorationKey = getKey || null;\n\n    // Perform initial hydration scroll restoration, since we miss the boat on\n    // the initial updateState() because we've not yet rendered <ScrollRestoration/>\n    // and therefore have no savedScrollPositions available\n    if (!initialScrollRestored && state.navigation === IDLE_NAVIGATION) {\n      initialScrollRestored = true;\n      let y = getSavedScrollPosition(state.location, state.matches);\n      if (y != null) {\n        updateState({ restoreScrollPosition: y });\n      }\n    }\n\n    return () => {\n      savedScrollPositions = null;\n      getScrollPosition = null;\n      getScrollRestorationKey = null;\n    };\n  }\n\n  function getScrollKey(location: Location, matches: AgnosticDataRouteMatch[]) {\n    if (getScrollRestorationKey) {\n      let key = getScrollRestorationKey(\n        location,\n        matches.map((m) => convertRouteMatchToUiMatch(m, state.loaderData))\n      );\n      return key || location.key;\n    }\n    return location.key;\n  }\n\n  function saveScrollPosition(\n    location: Location,\n    matches: AgnosticDataRouteMatch[]\n  ): void {\n    if (savedScrollPositions && getScrollPosition) {\n      let key = getScrollKey(location, matches);\n      savedScrollPositions[key] = getScrollPosition();\n    }\n  }\n\n  function getSavedScrollPosition(\n    location: Location,\n    matches: AgnosticDataRouteMatch[]\n  ): number | null {\n    if (savedScrollPositions) {\n      let key = getScrollKey(location, matches);\n      let y = savedScrollPositions[key];\n      if (typeof y === \"number\") {\n        return y;\n      }\n    }\n    return null;\n  }\n\n  function _internalSetRoutes(newRoutes: AgnosticDataRouteObject[]) {\n    manifest = {};\n    inFlightDataRoutes = convertRoutesToDataRoutes(\n      newRoutes,\n      mapRouteProperties,\n      undefined,\n      manifest\n    );\n  }\n\n  router = {\n    get basename() {\n      return basename;\n    },\n    get future() {\n      return future;\n    },\n    get state() {\n      return state;\n    },\n    get routes() {\n      return dataRoutes;\n    },\n    get window() {\n      return routerWindow;\n    },\n    initialize,\n    subscribe,\n    enableScrollRestoration,\n    navigate,\n    fetch,\n    revalidate,\n    // Passthrough to history-aware createHref used by useHref so we get proper\n    // hash-aware URLs in DOM paths\n    createHref: (to: To) => init.history.createHref(to),\n    encodeLocation: (to: To) => init.history.encodeLocation(to),\n    getFetcher,\n    deleteFetcher: deleteFetcherAndUpdateState,\n    dispose,\n    getBlocker,\n    deleteBlocker,\n    _internalFetchControllers: fetchControllers,\n    _internalActiveDeferreds: activeDeferreds,\n    // TODO: Remove setRoutes, it's temporary to avoid dealing with\n    // updating the tree while validating the update algorithm.\n    _internalSetRoutes,\n  };\n\n  return router;\n}\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region createStaticHandler\n////////////////////////////////////////////////////////////////////////////////\n\nexport const UNSAFE_DEFERRED_SYMBOL = Symbol(\"deferred\");\n\n/**\n * Future flags to toggle new feature behavior\n */\nexport interface StaticHandlerFutureConfig {\n  v7_relativeSplatPath: boolean;\n  v7_throwAbortReason: boolean;\n}\n\nexport interface CreateStaticHandlerOptions {\n  basename?: string;\n  /**\n   * @deprecated Use `mapRouteProperties` instead\n   */\n  detectErrorBoundary?: DetectErrorBoundaryFunction;\n  mapRouteProperties?: MapRoutePropertiesFunction;\n  future?: Partial<StaticHandlerFutureConfig>;\n}\n\nexport function createStaticHandler(\n  routes: AgnosticRouteObject[],\n  opts?: CreateStaticHandlerOptions\n): StaticHandler {\n  invariant(\n    routes.length > 0,\n    \"You must provide a non-empty routes array to createStaticHandler\"\n  );\n\n  let manifest: RouteManifest = {};\n  let basename = (opts ? opts.basename : null) || \"/\";\n  let mapRouteProperties: MapRoutePropertiesFunction;\n  if (opts?.mapRouteProperties) {\n    mapRouteProperties = opts.mapRouteProperties;\n  } else if (opts?.detectErrorBoundary) {\n    // If they are still using the deprecated version, wrap it with the new API\n    let detectErrorBoundary = opts.detectErrorBoundary;\n    mapRouteProperties = (route) => ({\n      hasErrorBoundary: detectErrorBoundary(route),\n    });\n  } else {\n    mapRouteProperties = defaultMapRouteProperties;\n  }\n  // Config driven behavior flags\n  let future: StaticHandlerFutureConfig = {\n    v7_relativeSplatPath: false,\n    v7_throwAbortReason: false,\n    ...(opts ? opts.future : null),\n  };\n\n  let dataRoutes = convertRoutesToDataRoutes(\n    routes,\n    mapRouteProperties,\n    undefined,\n    manifest\n  );\n\n  /**\n   * The query() method is intended for document requests, in which we want to\n   * call an optional action and potentially multiple loaders for all nested\n   * routes.  It returns a StaticHandlerContext object, which is very similar\n   * to the router state (location, loaderData, actionData, errors, etc.) and\n   * also adds SSR-specific information such as the statusCode and headers\n   * from action/loaders Responses.\n   *\n   * It _should_ never throw and should report all errors through the\n   * returned context.errors object, properly associating errors to their error\n   * boundary.  Additionally, it tracks _deepestRenderedBoundaryId which can be\n   * used to emulate React error boundaries during SSr by performing a second\n   * pass only down to the boundaryId.\n   *\n   * The one exception where we do not return a StaticHandlerContext is when a\n   * redirect response is returned or thrown from any action/loader.  We\n   * propagate that out and return the raw Response so the HTTP server can\n   * return it directly.\n   */\n  async function query(\n    request: Request,\n    { requestContext }: { requestContext?: unknown } = {}\n  ): Promise<StaticHandlerContext | Response> {\n    let url = new URL(request.url);\n    let method = request.method;\n    let location = createLocation(\"\", createPath(url), null, \"default\");\n    let matches = matchRoutes(dataRoutes, location, basename);\n\n    // SSR supports HEAD requests while SPA doesn't\n    if (!isValidMethod(method) && method !== \"HEAD\") {\n      let error = getInternalRouterError(405, { method });\n      let { matches: methodNotAllowedMatches, route } =\n        getShortCircuitMatches(dataRoutes);\n      return {\n        basename,\n        location,\n        matches: methodNotAllowedMatches,\n        loaderData: {},\n        actionData: null,\n        errors: {\n          [route.id]: error,\n        },\n        statusCode: error.status,\n        loaderHeaders: {},\n        actionHeaders: {},\n        activeDeferreds: null,\n      };\n    } else if (!matches) {\n      let error = getInternalRouterError(404, { pathname: location.pathname });\n      let { matches: notFoundMatches, route } =\n        getShortCircuitMatches(dataRoutes);\n      return {\n        basename,\n        location,\n        matches: notFoundMatches,\n        loaderData: {},\n        actionData: null,\n        errors: {\n          [route.id]: error,\n        },\n        statusCode: error.status,\n        loaderHeaders: {},\n        actionHeaders: {},\n        activeDeferreds: null,\n      };\n    }\n\n    let result = await queryImpl(request, location, matches, requestContext);\n    if (isResponse(result)) {\n      return result;\n    }\n\n    // When returning StaticHandlerContext, we patch back in the location here\n    // since we need it for React Context.  But this helps keep our submit and\n    // loadRouteData operating on a Request instead of a Location\n    return { location, basename, ...result };\n  }\n\n  /**\n   * The queryRoute() method is intended for targeted route requests, either\n   * for fetch ?_data requests or resource route requests.  In this case, we\n   * are only ever calling a single action or loader, and we are returning the\n   * returned value directly.  In most cases, this will be a Response returned\n   * from the action/loader, but it may be a primitive or other value as well -\n   * and in such cases the calling context should handle that accordingly.\n   *\n   * We do respect the throw/return differentiation, so if an action/loader\n   * throws, then this method will throw the value.  This is important so we\n   * can do proper boundary identification in Remix where a thrown Response\n   * must go to the Catch Boundary but a returned Response is happy-path.\n   *\n   * One thing to note is that any Router-initiated Errors that make sense\n   * to associate with a status code will be thrown as an ErrorResponse\n   * instance which include the raw Error, such that the calling context can\n   * serialize the error as they see fit while including the proper response\n   * code.  Examples here are 404 and 405 errors that occur prior to reaching\n   * any user-defined loaders.\n   */\n  async function queryRoute(\n    request: Request,\n    {\n      routeId,\n      requestContext,\n    }: { requestContext?: unknown; routeId?: string } = {}\n  ): Promise<any> {\n    let url = new URL(request.url);\n    let method = request.method;\n    let location = createLocation(\"\", createPath(url), null, \"default\");\n    let matches = matchRoutes(dataRoutes, location, basename);\n\n    // SSR supports HEAD requests while SPA doesn't\n    if (!isValidMethod(method) && method !== \"HEAD\" && method !== \"OPTIONS\") {\n      throw getInternalRouterError(405, { method });\n    } else if (!matches) {\n      throw getInternalRouterError(404, { pathname: location.pathname });\n    }\n\n    let match = routeId\n      ? matches.find((m) => m.route.id === routeId)\n      : getTargetMatch(matches, location);\n\n    if (routeId && !match) {\n      throw getInternalRouterError(403, {\n        pathname: location.pathname,\n        routeId,\n      });\n    } else if (!match) {\n      // This should never hit I don't think?\n      throw getInternalRouterError(404, { pathname: location.pathname });\n    }\n\n    let result = await queryImpl(\n      request,\n      location,\n      matches,\n      requestContext,\n      match\n    );\n    if (isResponse(result)) {\n      return result;\n    }\n\n    let error = result.errors ? Object.values(result.errors)[0] : undefined;\n    if (error !== undefined) {\n      // If we got back result.errors, that means the loader/action threw\n      // _something_ that wasn't a Response, but it's not guaranteed/required\n      // to be an `instanceof Error` either, so we have to use throw here to\n      // preserve the \"error\" state outside of queryImpl.\n      throw error;\n    }\n\n    // Pick off the right state value to return\n    if (result.actionData) {\n      return Object.values(result.actionData)[0];\n    }\n\n    if (result.loaderData) {\n      let data = Object.values(result.loaderData)[0];\n      if (result.activeDeferreds?.[match.route.id]) {\n        data[UNSAFE_DEFERRED_SYMBOL] = result.activeDeferreds[match.route.id];\n      }\n      return data;\n    }\n\n    return undefined;\n  }\n\n  async function queryImpl(\n    request: Request,\n    location: Location,\n    matches: AgnosticDataRouteMatch[],\n    requestContext: unknown,\n    routeMatch?: AgnosticDataRouteMatch\n  ): Promise<Omit<StaticHandlerContext, \"location\" | \"basename\"> | Response> {\n    invariant(\n      request.signal,\n      \"query()/queryRoute() requests must contain an AbortController signal\"\n    );\n\n    try {\n      if (isMutationMethod(request.method.toLowerCase())) {\n        let result = await submit(\n          request,\n          matches,\n          routeMatch || getTargetMatch(matches, location),\n          requestContext,\n          routeMatch != null\n        );\n        return result;\n      }\n\n      let result = await loadRouteData(\n        request,\n        matches,\n        requestContext,\n        routeMatch\n      );\n      return isResponse(result)\n        ? result\n        : {\n            ...result,\n            actionData: null,\n            actionHeaders: {},\n          };\n    } catch (e) {\n      // If the user threw/returned a Response in callLoaderOrAction, we throw\n      // it to bail out and then return or throw here based on whether the user\n      // returned or threw\n      if (isQueryRouteResponse(e)) {\n        if (e.type === ResultType.error) {\n          throw e.response;\n        }\n        return e.response;\n      }\n      // Redirects are always returned since they don't propagate to catch\n      // boundaries\n      if (isRedirectResponse(e)) {\n        return e;\n      }\n      throw e;\n    }\n  }\n\n  async function submit(\n    request: Request,\n    matches: AgnosticDataRouteMatch[],\n    actionMatch: AgnosticDataRouteMatch,\n    requestContext: unknown,\n    isRouteRequest: boolean\n  ): Promise<Omit<StaticHandlerContext, \"location\" | \"basename\"> | Response> {\n    let result: DataResult;\n\n    if (!actionMatch.route.action && !actionMatch.route.lazy) {\n      let error = getInternalRouterError(405, {\n        method: request.method,\n        pathname: new URL(request.url).pathname,\n        routeId: actionMatch.route.id,\n      });\n      if (isRouteRequest) {\n        throw error;\n      }\n      result = {\n        type: ResultType.error,\n        error,\n      };\n    } else {\n      result = await callLoaderOrAction(\n        \"action\",\n        request,\n        actionMatch,\n        matches,\n        manifest,\n        mapRouteProperties,\n        basename,\n        future.v7_relativeSplatPath,\n        { isStaticRequest: true, isRouteRequest, requestContext }\n      );\n\n      if (request.signal.aborted) {\n        throwStaticHandlerAbortedError(request, isRouteRequest, future);\n      }\n    }\n\n    if (isRedirectResult(result)) {\n      // Uhhhh - this should never happen, we should always throw these from\n      // callLoaderOrAction, but the type narrowing here keeps TS happy and we\n      // can get back on the \"throw all redirect responses\" train here should\n      // this ever happen :/\n      throw new Response(null, {\n        status: result.status,\n        headers: {\n          Location: result.location,\n        },\n      });\n    }\n\n    if (isDeferredResult(result)) {\n      let error = getInternalRouterError(400, { type: \"defer-action\" });\n      if (isRouteRequest) {\n        throw error;\n      }\n      result = {\n        type: ResultType.error,\n        error,\n      };\n    }\n\n    if (isRouteRequest) {\n      // Note: This should only be non-Response values if we get here, since\n      // isRouteRequest should throw any Response received in callLoaderOrAction\n      if (isErrorResult(result)) {\n        throw result.error;\n      }\n\n      return {\n        matches: [actionMatch],\n        loaderData: {},\n        actionData: { [actionMatch.route.id]: result.data },\n        errors: null,\n        // Note: statusCode + headers are unused here since queryRoute will\n        // return the raw Response or value\n        statusCode: 200,\n        loaderHeaders: {},\n        actionHeaders: {},\n        activeDeferreds: null,\n      };\n    }\n\n    if (isErrorResult(result)) {\n      // Store off the pending error - we use it to determine which loaders\n      // to call and will commit it when we complete the navigation\n      let boundaryMatch = findNearestBoundary(matches, actionMatch.route.id);\n      let context = await loadRouteData(\n        request,\n        matches,\n        requestContext,\n        undefined,\n        {\n          [boundaryMatch.route.id]: result.error,\n        }\n      );\n\n      // action status codes take precedence over loader status codes\n      return {\n        ...context,\n        statusCode: isRouteErrorResponse(result.error)\n          ? result.error.status\n          : 500,\n        actionData: null,\n        actionHeaders: {\n          ...(result.headers ? { [actionMatch.route.id]: result.headers } : {}),\n        },\n      };\n    }\n\n    // Create a GET request for the loaders\n    let loaderRequest = new Request(request.url, {\n      headers: request.headers,\n      redirect: request.redirect,\n      signal: request.signal,\n    });\n    let context = await loadRouteData(loaderRequest, matches, requestContext);\n\n    return {\n      ...context,\n      // action status codes take precedence over loader status codes\n      ...(result.statusCode ? { statusCode: result.statusCode } : {}),\n      actionData: {\n        [actionMatch.route.id]: result.data,\n      },\n      actionHeaders: {\n        ...(result.headers ? { [actionMatch.route.id]: result.headers } : {}),\n      },\n    };\n  }\n\n  async function loadRouteData(\n    request: Request,\n    matches: AgnosticDataRouteMatch[],\n    requestContext: unknown,\n    routeMatch?: AgnosticDataRouteMatch,\n    pendingActionError?: RouteData\n  ): Promise<\n    | Omit<\n        StaticHandlerContext,\n        \"location\" | \"basename\" | \"actionData\" | \"actionHeaders\"\n      >\n    | Response\n  > {\n    let isRouteRequest = routeMatch != null;\n\n    // Short circuit if we have no loaders to run (queryRoute())\n    if (\n      isRouteRequest &&\n      !routeMatch?.route.loader &&\n      !routeMatch?.route.lazy\n    ) {\n      throw getInternalRouterError(400, {\n        method: request.method,\n        pathname: new URL(request.url).pathname,\n        routeId: routeMatch?.route.id,\n      });\n    }\n\n    let requestMatches = routeMatch\n      ? [routeMatch]\n      : getLoaderMatchesUntilBoundary(\n          matches,\n          Object.keys(pendingActionError || {})[0]\n        );\n    let matchesToLoad = requestMatches.filter(\n      (m) => m.route.loader || m.route.lazy\n    );\n\n    // Short circuit if we have no loaders to run (query())\n    if (matchesToLoad.length === 0) {\n      return {\n        matches,\n        // Add a null for all matched routes for proper revalidation on the client\n        loaderData: matches.reduce(\n          (acc, m) => Object.assign(acc, { [m.route.id]: null }),\n          {}\n        ),\n        errors: pendingActionError || null,\n        statusCode: 200,\n        loaderHeaders: {},\n        activeDeferreds: null,\n      };\n    }\n\n    let results = await Promise.all([\n      ...matchesToLoad.map((match) =>\n        callLoaderOrAction(\n          \"loader\",\n          request,\n          match,\n          matches,\n          manifest,\n          mapRouteProperties,\n          basename,\n          future.v7_relativeSplatPath,\n          { isStaticRequest: true, isRouteRequest, requestContext }\n        )\n      ),\n    ]);\n\n    if (request.signal.aborted) {\n      throwStaticHandlerAbortedError(request, isRouteRequest, future);\n    }\n\n    // Process and commit output from loaders\n    let activeDeferreds = new Map<string, DeferredData>();\n    let context = processRouteLoaderData(\n      matches,\n      matchesToLoad,\n      results,\n      pendingActionError,\n      activeDeferreds\n    );\n\n    // Add a null for any non-loader matches for proper revalidation on the client\n    let executedLoaders = new Set<string>(\n      matchesToLoad.map((match) => match.route.id)\n    );\n    matches.forEach((match) => {\n      if (!executedLoaders.has(match.route.id)) {\n        context.loaderData[match.route.id] = null;\n      }\n    });\n\n    return {\n      ...context,\n      matches,\n      activeDeferreds:\n        activeDeferreds.size > 0\n          ? Object.fromEntries(activeDeferreds.entries())\n          : null,\n    };\n  }\n\n  return {\n    dataRoutes,\n    query,\n    queryRoute,\n  };\n}\n\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Helpers\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n * Given an existing StaticHandlerContext and an error thrown at render time,\n * provide an updated StaticHandlerContext suitable for a second SSR render\n */\nexport function getStaticContextFromError(\n  routes: AgnosticDataRouteObject[],\n  context: StaticHandlerContext,\n  error: any\n) {\n  let newContext: StaticHandlerContext = {\n    ...context,\n    statusCode: isRouteErrorResponse(error) ? error.status : 500,\n    errors: {\n      [context._deepestRenderedBoundaryId || routes[0].id]: error,\n    },\n  };\n  return newContext;\n}\n\nfunction throwStaticHandlerAbortedError(\n  request: Request,\n  isRouteRequest: boolean,\n  future: StaticHandlerFutureConfig\n) {\n  if (future.v7_throwAbortReason && request.signal.reason !== undefined) {\n    throw request.signal.reason;\n  }\n\n  let method = isRouteRequest ? \"queryRoute\" : \"query\";\n  throw new Error(`${method}() call aborted: ${request.method} ${request.url}`);\n}\n\nfunction isSubmissionNavigation(\n  opts: BaseNavigateOrFetchOptions\n): opts is SubmissionNavigateOptions {\n  return (\n    opts != null &&\n    ((\"formData\" in opts && opts.formData != null) ||\n      (\"body\" in opts && opts.body !== undefined))\n  );\n}\n\nfunction normalizeTo(\n  location: Path,\n  matches: AgnosticDataRouteMatch[],\n  basename: string,\n  prependBasename: boolean,\n  to: To | null,\n  v7_relativeSplatPath: boolean,\n  fromRouteId?: string,\n  relative?: RelativeRoutingType\n) {\n  let contextualMatches: AgnosticDataRouteMatch[];\n  let activeRouteMatch: AgnosticDataRouteMatch | undefined;\n  if (fromRouteId) {\n    // Grab matches up to the calling route so our route-relative logic is\n    // relative to the correct source route\n    contextualMatches = [];\n    for (let match of matches) {\n      contextualMatches.push(match);\n      if (match.route.id === fromRouteId) {\n        activeRouteMatch = match;\n        break;\n      }\n    }\n  } else {\n    contextualMatches = matches;\n    activeRouteMatch = matches[matches.length - 1];\n  }\n\n  // Resolve the relative path\n  let path = resolveTo(\n    to ? to : \".\",\n    getResolveToMatches(contextualMatches, v7_relativeSplatPath),\n    stripBasename(location.pathname, basename) || location.pathname,\n    relative === \"path\"\n  );\n\n  // When `to` is not specified we inherit search/hash from the current\n  // location, unlike when to=\".\" and we just inherit the path.\n  // See https://github.com/remix-run/remix/issues/927\n  if (to == null) {\n    path.search = location.search;\n    path.hash = location.hash;\n  }\n\n  // Add an ?index param for matched index routes if we don't already have one\n  if (\n    (to == null || to === \"\" || to === \".\") &&\n    activeRouteMatch &&\n    activeRouteMatch.route.index &&\n    !hasNakedIndexQuery(path.search)\n  ) {\n    path.search = path.search\n      ? path.search.replace(/^\\?/, \"?index&\")\n      : \"?index\";\n  }\n\n  // If we're operating within a basename, prepend it to the pathname.  If\n  // this is a root navigation, then just use the raw basename which allows\n  // the basename to have full control over the presence of a trailing slash\n  // on root actions\n  if (prependBasename && basename !== \"/\") {\n    path.pathname =\n      path.pathname === \"/\" ? basename : joinPaths([basename, path.pathname]);\n  }\n\n  return createPath(path);\n}\n\n// Normalize navigation options by converting formMethod=GET formData objects to\n// URLSearchParams so they behave identically to links with query params\nfunction normalizeNavigateOptions(\n  normalizeFormMethod: boolean,\n  isFetcher: boolean,\n  path: string,\n  opts?: BaseNavigateOrFetchOptions\n): {\n  path: string;\n  submission?: Submission;\n  error?: ErrorResponseImpl;\n} {\n  // Return location verbatim on non-submission navigations\n  if (!opts || !isSubmissionNavigation(opts)) {\n    return { path };\n  }\n\n  if (opts.formMethod && !isValidMethod(opts.formMethod)) {\n    return {\n      path,\n      error: getInternalRouterError(405, { method: opts.formMethod }),\n    };\n  }\n\n  let getInvalidBodyError = () => ({\n    path,\n    error: getInternalRouterError(400, { type: \"invalid-body\" }),\n  });\n\n  // Create a Submission on non-GET navigations\n  let rawFormMethod = opts.formMethod || \"get\";\n  let formMethod = normalizeFormMethod\n    ? (rawFormMethod.toUpperCase() as V7_FormMethod)\n    : (rawFormMethod.toLowerCase() as FormMethod);\n  let formAction = stripHashFromPath(path);\n\n  if (opts.body !== undefined) {\n    if (opts.formEncType === \"text/plain\") {\n      // text only support POST/PUT/PATCH/DELETE submissions\n      if (!isMutationMethod(formMethod)) {\n        return getInvalidBodyError();\n      }\n\n      let text =\n        typeof opts.body === \"string\"\n          ? opts.body\n          : opts.body instanceof FormData ||\n            opts.body instanceof URLSearchParams\n          ? // https://html.spec.whatwg.org/multipage/form-control-infrastructure.html#plain-text-form-data\n            Array.from(opts.body.entries()).reduce(\n              (acc, [name, value]) => `${acc}${name}=${value}\\n`,\n              \"\"\n            )\n          : String(opts.body);\n\n      return {\n        path,\n        submission: {\n          formMethod,\n          formAction,\n          formEncType: opts.formEncType,\n          formData: undefined,\n          json: undefined,\n          text,\n        },\n      };\n    } else if (opts.formEncType === \"application/json\") {\n      // json only supports POST/PUT/PATCH/DELETE submissions\n      if (!isMutationMethod(formMethod)) {\n        return getInvalidBodyError();\n      }\n\n      try {\n        let json =\n          typeof opts.body === \"string\" ? JSON.parse(opts.body) : opts.body;\n\n        return {\n          path,\n          submission: {\n            formMethod,\n            formAction,\n            formEncType: opts.formEncType,\n            formData: undefined,\n            json,\n            text: undefined,\n          },\n        };\n      } catch (e) {\n        return getInvalidBodyError();\n      }\n    }\n  }\n\n  invariant(\n    typeof FormData === \"function\",\n    \"FormData is not available in this environment\"\n  );\n\n  let searchParams: URLSearchParams;\n  let formData: FormData;\n\n  if (opts.formData) {\n    searchParams = convertFormDataToSearchParams(opts.formData);\n    formData = opts.formData;\n  } else if (opts.body instanceof FormData) {\n    searchParams = convertFormDataToSearchParams(opts.body);\n    formData = opts.body;\n  } else if (opts.body instanceof URLSearchParams) {\n    searchParams = opts.body;\n    formData = convertSearchParamsToFormData(searchParams);\n  } else if (opts.body == null) {\n    searchParams = new URLSearchParams();\n    formData = new FormData();\n  } else {\n    try {\n      searchParams = new URLSearchParams(opts.body);\n      formData = convertSearchParamsToFormData(searchParams);\n    } catch (e) {\n      return getInvalidBodyError();\n    }\n  }\n\n  let submission: Submission = {\n    formMethod,\n    formAction,\n    formEncType:\n      (opts && opts.formEncType) || \"application/x-www-form-urlencoded\",\n    formData,\n    json: undefined,\n    text: undefined,\n  };\n\n  if (isMutationMethod(submission.formMethod)) {\n    return { path, submission };\n  }\n\n  // Flatten submission onto URLSearchParams for GET submissions\n  let parsedPath = parsePath(path);\n  // On GET navigation submissions we can drop the ?index param from the\n  // resulting location since all loaders will run.  But fetcher GET submissions\n  // only run a single loader so we need to preserve any incoming ?index params\n  if (isFetcher && parsedPath.search && hasNakedIndexQuery(parsedPath.search)) {\n    searchParams.append(\"index\", \"\");\n  }\n  parsedPath.search = `?${searchParams}`;\n\n  return { path: createPath(parsedPath), submission };\n}\n\n// Filter out all routes below any caught error as they aren't going to\n// render so we don't need to load them\nfunction getLoaderMatchesUntilBoundary(\n  matches: AgnosticDataRouteMatch[],\n  boundaryId?: string\n) {\n  let boundaryMatches = matches;\n  if (boundaryId) {\n    let index = matches.findIndex((m) => m.route.id === boundaryId);\n    if (index >= 0) {\n      boundaryMatches = matches.slice(0, index);\n    }\n  }\n  return boundaryMatches;\n}\n\nfunction getMatchesToLoad(\n  history: History,\n  state: RouterState,\n  matches: AgnosticDataRouteMatch[],\n  submission: Submission | undefined,\n  location: Location,\n  isInitialLoad: boolean,\n  isRevalidationRequired: boolean,\n  cancelledDeferredRoutes: string[],\n  cancelledFetcherLoads: string[],\n  deletedFetchers: Set<string>,\n  fetchLoadMatches: Map<string, FetchLoadMatch>,\n  fetchRedirectIds: Set<string>,\n  routesToUse: AgnosticDataRouteObject[],\n  basename: string | undefined,\n  pendingActionData?: RouteData,\n  pendingError?: RouteData\n): [AgnosticDataRouteMatch[], RevalidatingFetcher[]] {\n  let actionResult = pendingError\n    ? Object.values(pendingError)[0]\n    : pendingActionData\n    ? Object.values(pendingActionData)[0]\n    : undefined;\n\n  let currentUrl = history.createURL(state.location);\n  let nextUrl = history.createURL(location);\n\n  // Pick navigation matches that are net-new or qualify for revalidation\n  let boundaryId = pendingError ? Object.keys(pendingError)[0] : undefined;\n  let boundaryMatches = getLoaderMatchesUntilBoundary(matches, boundaryId);\n\n  let navigationMatches = boundaryMatches.filter((match, index) => {\n    let { route } = match;\n    if (route.lazy) {\n      // We haven't loaded this route yet so we don't know if it's got a loader!\n      return true;\n    }\n\n    if (route.loader == null) {\n      return false;\n    }\n\n    if (isInitialLoad) {\n      if (route.loader.hydrate) {\n        return true;\n      }\n      return (\n        state.loaderData[route.id] === undefined &&\n        // Don't re-run if the loader ran and threw an error\n        (!state.errors || state.errors[route.id] === undefined)\n      );\n    }\n\n    // Always call the loader on new route instances and pending defer cancellations\n    if (\n      isNewLoader(state.loaderData, state.matches[index], match) ||\n      cancelledDeferredRoutes.some((id) => id === match.route.id)\n    ) {\n      return true;\n    }\n\n    // This is the default implementation for when we revalidate.  If the route\n    // provides it's own implementation, then we give them full control but\n    // provide this value so they can leverage it if needed after they check\n    // their own specific use cases\n    let currentRouteMatch = state.matches[index];\n    let nextRouteMatch = match;\n\n    return shouldRevalidateLoader(match, {\n      currentUrl,\n      currentParams: currentRouteMatch.params,\n      nextUrl,\n      nextParams: nextRouteMatch.params,\n      ...submission,\n      actionResult,\n      defaultShouldRevalidate:\n        // Forced revalidation due to submission, useRevalidator, or X-Remix-Revalidate\n        isRevalidationRequired ||\n        // Clicked the same link, resubmitted a GET form\n        currentUrl.pathname + currentUrl.search ===\n          nextUrl.pathname + nextUrl.search ||\n        // Search params affect all loaders\n        currentUrl.search !== nextUrl.search ||\n        isNewRouteInstance(currentRouteMatch, nextRouteMatch),\n    });\n  });\n\n  // Pick fetcher.loads that need to be revalidated\n  let revalidatingFetchers: RevalidatingFetcher[] = [];\n  fetchLoadMatches.forEach((f, key) => {\n    // Don't revalidate:\n    //  - on initial load (shouldn't be any fetchers then anyway)\n    //  - if fetcher won't be present in the subsequent render\n    //    - no longer matches the URL (v7_fetcherPersist=false)\n    //    - was unmounted but persisted due to v7_fetcherPersist=true\n    if (\n      isInitialLoad ||\n      !matches.some((m) => m.route.id === f.routeId) ||\n      deletedFetchers.has(key)\n    ) {\n      return;\n    }\n\n    let fetcherMatches = matchRoutes(routesToUse, f.path, basename);\n\n    // If the fetcher path no longer matches, push it in with null matches so\n    // we can trigger a 404 in callLoadersAndMaybeResolveData.  Note this is\n    // currently only a use-case for Remix HMR where the route tree can change\n    // at runtime and remove a route previously loaded via a fetcher\n    if (!fetcherMatches) {\n      revalidatingFetchers.push({\n        key,\n        routeId: f.routeId,\n        path: f.path,\n        matches: null,\n        match: null,\n        controller: null,\n      });\n      return;\n    }\n\n    // Revalidating fetchers are decoupled from the route matches since they\n    // load from a static href.  They revalidate based on explicit revalidation\n    // (submission, useRevalidator, or X-Remix-Revalidate)\n    let fetcher = state.fetchers.get(key);\n    let fetcherMatch = getTargetMatch(fetcherMatches, f.path);\n\n    let shouldRevalidate = false;\n    if (fetchRedirectIds.has(key)) {\n      // Never trigger a revalidation of an actively redirecting fetcher\n      shouldRevalidate = false;\n    } else if (cancelledFetcherLoads.includes(key)) {\n      // Always revalidate if the fetcher was cancelled\n      shouldRevalidate = true;\n    } else if (\n      fetcher &&\n      fetcher.state !== \"idle\" &&\n      fetcher.data === undefined\n    ) {\n      // If the fetcher hasn't ever completed loading yet, then this isn't a\n      // revalidation, it would just be a brand new load if an explicit\n      // revalidation is required\n      shouldRevalidate = isRevalidationRequired;\n    } else {\n      // Otherwise fall back on any user-defined shouldRevalidate, defaulting\n      // to explicit revalidations only\n      shouldRevalidate = shouldRevalidateLoader(fetcherMatch, {\n        currentUrl,\n        currentParams: state.matches[state.matches.length - 1].params,\n        nextUrl,\n        nextParams: matches[matches.length - 1].params,\n        ...submission,\n        actionResult,\n        defaultShouldRevalidate: isRevalidationRequired,\n      });\n    }\n\n    if (shouldRevalidate) {\n      revalidatingFetchers.push({\n        key,\n        routeId: f.routeId,\n        path: f.path,\n        matches: fetcherMatches,\n        match: fetcherMatch,\n        controller: new AbortController(),\n      });\n    }\n  });\n\n  return [navigationMatches, revalidatingFetchers];\n}\n\nfunction isNewLoader(\n  currentLoaderData: RouteData,\n  currentMatch: AgnosticDataRouteMatch,\n  match: AgnosticDataRouteMatch\n) {\n  let isNew =\n    // [a] -> [a, b]\n    !currentMatch ||\n    // [a, b] -> [a, c]\n    match.route.id !== currentMatch.route.id;\n\n  // Handle the case that we don't have data for a re-used route, potentially\n  // from a prior error or from a cancelled pending deferred\n  let isMissingData = currentLoaderData[match.route.id] === undefined;\n\n  // Always load if this is a net-new route or we don't yet have data\n  return isNew || isMissingData;\n}\n\nfunction isNewRouteInstance(\n  currentMatch: AgnosticDataRouteMatch,\n  match: AgnosticDataRouteMatch\n) {\n  let currentPath = currentMatch.route.path;\n  return (\n    // param change for this match, /users/123 -> /users/456\n    currentMatch.pathname !== match.pathname ||\n    // splat param changed, which is not present in match.path\n    // e.g. /files/images/avatar.jpg -> files/finances.xls\n    (currentPath != null &&\n      currentPath.endsWith(\"*\") &&\n      currentMatch.params[\"*\"] !== match.params[\"*\"])\n  );\n}\n\nfunction shouldRevalidateLoader(\n  loaderMatch: AgnosticDataRouteMatch,\n  arg: ShouldRevalidateFunctionArgs\n) {\n  if (loaderMatch.route.shouldRevalidate) {\n    let routeChoice = loaderMatch.route.shouldRevalidate(arg);\n    if (typeof routeChoice === \"boolean\") {\n      return routeChoice;\n    }\n  }\n\n  return arg.defaultShouldRevalidate;\n}\n\n/**\n * Execute route.lazy() methods to lazily load route modules (loader, action,\n * shouldRevalidate) and update the routeManifest in place which shares objects\n * with dataRoutes so those get updated as well.\n */\nasync function loadLazyRouteModule(\n  route: AgnosticDataRouteObject,\n  mapRouteProperties: MapRoutePropertiesFunction,\n  manifest: RouteManifest\n) {\n  if (!route.lazy) {\n    return;\n  }\n\n  let lazyRoute = await route.lazy();\n\n  // If the lazy route function was executed and removed by another parallel\n  // call then we can return - first lazy() to finish wins because the return\n  // value of lazy is expected to be static\n  if (!route.lazy) {\n    return;\n  }\n\n  let routeToUpdate = manifest[route.id];\n  invariant(routeToUpdate, \"No route found in manifest\");\n\n  // Update the route in place.  This should be safe because there's no way\n  // we could yet be sitting on this route as we can't get there without\n  // resolving lazy() first.\n  //\n  // This is different than the HMR \"update\" use-case where we may actively be\n  // on the route being updated.  The main concern boils down to \"does this\n  // mutation affect any ongoing navigations or any current state.matches\n  // values?\".  If not, it should be safe to update in place.\n  let routeUpdates: Record<string, any> = {};\n  for (let lazyRouteProperty in lazyRoute) {\n    let staticRouteValue =\n      routeToUpdate[lazyRouteProperty as keyof typeof routeToUpdate];\n\n    let isPropertyStaticallyDefined =\n      staticRouteValue !== undefined &&\n      // This property isn't static since it should always be updated based\n      // on the route updates\n      lazyRouteProperty !== \"hasErrorBoundary\";\n\n    warning(\n      !isPropertyStaticallyDefined,\n      `Route \"${routeToUpdate.id}\" has a static property \"${lazyRouteProperty}\" ` +\n        `defined but its lazy function is also returning a value for this property. ` +\n        `The lazy route property \"${lazyRouteProperty}\" will be ignored.`\n    );\n\n    if (\n      !isPropertyStaticallyDefined &&\n      !immutableRouteKeys.has(lazyRouteProperty as ImmutableRouteKey)\n    ) {\n      routeUpdates[lazyRouteProperty] =\n        lazyRoute[lazyRouteProperty as keyof typeof lazyRoute];\n    }\n  }\n\n  // Mutate the route with the provided updates.  Do this first so we pass\n  // the updated version to mapRouteProperties\n  Object.assign(routeToUpdate, routeUpdates);\n\n  // Mutate the `hasErrorBoundary` property on the route based on the route\n  // updates and remove the `lazy` function so we don't resolve the lazy\n  // route again.\n  Object.assign(routeToUpdate, {\n    // To keep things framework agnostic, we use the provided\n    // `mapRouteProperties` (or wrapped `detectErrorBoundary`) function to\n    // set the framework-aware properties (`element`/`hasErrorBoundary`) since\n    // the logic will differ between frameworks.\n    ...mapRouteProperties(routeToUpdate),\n    lazy: undefined,\n  });\n}\n\nasync function callLoaderOrAction(\n  type: \"loader\" | \"action\",\n  request: Request,\n  match: AgnosticDataRouteMatch,\n  matches: AgnosticDataRouteMatch[],\n  manifest: RouteManifest,\n  mapRouteProperties: MapRoutePropertiesFunction,\n  basename: string,\n  v7_relativeSplatPath: boolean,\n  opts: {\n    isStaticRequest?: boolean;\n    isRouteRequest?: boolean;\n    requestContext?: unknown;\n  } = {}\n): Promise<DataResult> {\n  let resultType;\n  let result;\n  let onReject: (() => void) | undefined;\n\n  let runHandler = (handler: ActionFunction | LoaderFunction) => {\n    // Setup a promise we can race against so that abort signals short circuit\n    let reject: () => void;\n    let abortPromise = new Promise((_, r) => (reject = r));\n    onReject = () => reject();\n    request.signal.addEventListener(\"abort\", onReject);\n    return Promise.race([\n      handler({\n        request,\n        params: match.params,\n        context: opts.requestContext,\n      }),\n      abortPromise,\n    ]);\n  };\n\n  try {\n    let handler = match.route[type];\n\n    if (match.route.lazy) {\n      if (handler) {\n        // Run statically defined handler in parallel with lazy()\n        let handlerError;\n        let values = await Promise.all([\n          // If the handler throws, don't let it immediately bubble out,\n          // since we need to let the lazy() execution finish so we know if this\n          // route has a boundary that can handle the error\n          runHandler(handler).catch((e) => {\n            handlerError = e;\n          }),\n          loadLazyRouteModule(match.route, mapRouteProperties, manifest),\n        ]);\n        if (handlerError) {\n          throw handlerError;\n        }\n        result = values[0];\n      } else {\n        // Load lazy route module, then run any returned handler\n        await loadLazyRouteModule(match.route, mapRouteProperties, manifest);\n\n        handler = match.route[type];\n        if (handler) {\n          // Handler still run even if we got interrupted to maintain consistency\n          // with un-abortable behavior of handler execution on non-lazy or\n          // previously-lazy-loaded routes\n          result = await runHandler(handler);\n        } else if (type === \"action\") {\n          let url = new URL(request.url);\n          let pathname = url.pathname + url.search;\n          throw getInternalRouterError(405, {\n            method: request.method,\n            pathname,\n            routeId: match.route.id,\n          });\n        } else {\n          // lazy() route has no loader to run.  Short circuit here so we don't\n          // hit the invariant below that errors on returning undefined.\n          return { type: ResultType.data, data: undefined };\n        }\n      }\n    } else if (!handler) {\n      let url = new URL(request.url);\n      let pathname = url.pathname + url.search;\n      throw getInternalRouterError(404, {\n        pathname,\n      });\n    } else {\n      result = await runHandler(handler);\n    }\n\n    invariant(\n      result !== undefined,\n      `You defined ${type === \"action\" ? \"an action\" : \"a loader\"} for route ` +\n        `\"${match.route.id}\" but didn't return anything from your \\`${type}\\` ` +\n        `function. Please return a value or \\`null\\`.`\n    );\n  } catch (e) {\n    resultType = ResultType.error;\n    result = e;\n  } finally {\n    if (onReject) {\n      request.signal.removeEventListener(\"abort\", onReject);\n    }\n  }\n\n  if (isResponse(result)) {\n    let status = result.status;\n\n    // Process redirects\n    if (redirectStatusCodes.has(status)) {\n      let location = result.headers.get(\"Location\");\n      invariant(\n        location,\n        \"Redirects returned/thrown from loaders/actions must have a Location header\"\n      );\n\n      // Support relative routing in internal redirects\n      if (!ABSOLUTE_URL_REGEX.test(location)) {\n        location = normalizeTo(\n          new URL(request.url),\n          matches.slice(0, matches.indexOf(match) + 1),\n          basename,\n          true,\n          location,\n          v7_relativeSplatPath\n        );\n      } else if (!opts.isStaticRequest) {\n        // Strip off the protocol+origin for same-origin + same-basename absolute\n        // redirects. If this is a static request, we can let it go back to the\n        // browser as-is\n        let currentUrl = new URL(request.url);\n        let url = location.startsWith(\"//\")\n          ? new URL(currentUrl.protocol + location)\n          : new URL(location);\n        let isSameBasename = stripBasename(url.pathname, basename) != null;\n        if (url.origin === currentUrl.origin && isSameBasename) {\n          location = url.pathname + url.search + url.hash;\n        }\n      }\n\n      // Don't process redirects in the router during static requests requests.\n      // Instead, throw the Response and let the server handle it with an HTTP\n      // redirect.  We also update the Location header in place in this flow so\n      // basename and relative routing is taken into account\n      if (opts.isStaticRequest) {\n        result.headers.set(\"Location\", location);\n        throw result;\n      }\n\n      return {\n        type: ResultType.redirect,\n        status,\n        location,\n        revalidate: result.headers.get(\"X-Remix-Revalidate\") !== null,\n        reloadDocument: result.headers.get(\"X-Remix-Reload-Document\") !== null,\n      };\n    }\n\n    // For SSR single-route requests, we want to hand Responses back directly\n    // without unwrapping.  We do this with the QueryRouteResponse wrapper\n    // interface so we can know whether it was returned or thrown\n    if (opts.isRouteRequest) {\n      let queryRouteResponse: QueryRouteResponse = {\n        type:\n          resultType === ResultType.error ? ResultType.error : ResultType.data,\n        response: result,\n      };\n      throw queryRouteResponse;\n    }\n\n    let data: any;\n\n    try {\n      let contentType = result.headers.get(\"Content-Type\");\n      // Check between word boundaries instead of startsWith() due to the last\n      // paragraph of https://httpwg.org/specs/rfc9110.html#field.content-type\n      if (contentType && /\\bapplication\\/json\\b/.test(contentType)) {\n        if (result.body == null) {\n          data = null;\n        } else {\n          data = await result.json();\n        }\n      } else {\n        data = await result.text();\n      }\n    } catch (e) {\n      return { type: ResultType.error, error: e };\n    }\n\n    if (resultType === ResultType.error) {\n      return {\n        type: resultType,\n        error: new ErrorResponseImpl(status, result.statusText, data),\n        headers: result.headers,\n      };\n    }\n\n    return {\n      type: ResultType.data,\n      data,\n      statusCode: result.status,\n      headers: result.headers,\n    };\n  }\n\n  if (resultType === ResultType.error) {\n    return { type: resultType, error: result };\n  }\n\n  if (isDeferredData(result)) {\n    return {\n      type: ResultType.deferred,\n      deferredData: result,\n      statusCode: result.init?.status,\n      headers: result.init?.headers && new Headers(result.init.headers),\n    };\n  }\n\n  return { type: ResultType.data, data: result };\n}\n\n// Utility method for creating the Request instances for loaders/actions during\n// client-side navigations and fetches.  During SSR we will always have a\n// Request instance from the static handler (query/queryRoute)\nfunction createClientSideRequest(\n  history: History,\n  location: string | Location,\n  signal: AbortSignal,\n  submission?: Submission\n): Request {\n  let url = history.createURL(stripHashFromPath(location)).toString();\n  let init: RequestInit = { signal };\n\n  if (submission && isMutationMethod(submission.formMethod)) {\n    let { formMethod, formEncType } = submission;\n    // Didn't think we needed this but it turns out unlike other methods, patch\n    // won't be properly normalized to uppercase and results in a 405 error.\n    // See: https://fetch.spec.whatwg.org/#concept-method\n    init.method = formMethod.toUpperCase();\n\n    if (formEncType === \"application/json\") {\n      init.headers = new Headers({ \"Content-Type\": formEncType });\n      init.body = JSON.stringify(submission.json);\n    } else if (formEncType === \"text/plain\") {\n      // Content-Type is inferred (https://fetch.spec.whatwg.org/#dom-request)\n      init.body = submission.text;\n    } else if (\n      formEncType === \"application/x-www-form-urlencoded\" &&\n      submission.formData\n    ) {\n      // Content-Type is inferred (https://fetch.spec.whatwg.org/#dom-request)\n      init.body = convertFormDataToSearchParams(submission.formData);\n    } else {\n      // Content-Type is inferred (https://fetch.spec.whatwg.org/#dom-request)\n      init.body = submission.formData;\n    }\n  }\n\n  return new Request(url, init);\n}\n\nfunction convertFormDataToSearchParams(formData: FormData): URLSearchParams {\n  let searchParams = new URLSearchParams();\n\n  for (let [key, value] of formData.entries()) {\n    // https://html.spec.whatwg.org/multipage/form-control-infrastructure.html#converting-an-entry-list-to-a-list-of-name-value-pairs\n    searchParams.append(key, typeof value === \"string\" ? value : value.name);\n  }\n\n  return searchParams;\n}\n\nfunction convertSearchParamsToFormData(\n  searchParams: URLSearchParams\n): FormData {\n  let formData = new FormData();\n  for (let [key, value] of searchParams.entries()) {\n    formData.append(key, value);\n  }\n  return formData;\n}\n\nfunction processRouteLoaderData(\n  matches: AgnosticDataRouteMatch[],\n  matchesToLoad: AgnosticDataRouteMatch[],\n  results: DataResult[],\n  pendingError: RouteData | undefined,\n  activeDeferreds: Map<string, DeferredData>\n): {\n  loaderData: RouterState[\"loaderData\"];\n  errors: RouterState[\"errors\"] | null;\n  statusCode: number;\n  loaderHeaders: Record<string, Headers>;\n} {\n  // Fill in loaderData/errors from our loaders\n  let loaderData: RouterState[\"loaderData\"] = {};\n  let errors: RouterState[\"errors\"] | null = null;\n  let statusCode: number | undefined;\n  let foundError = false;\n  let loaderHeaders: Record<string, Headers> = {};\n\n  // Process loader results into state.loaderData/state.errors\n  results.forEach((result, index) => {\n    let id = matchesToLoad[index].route.id;\n    invariant(\n      !isRedirectResult(result),\n      \"Cannot handle redirect results in processLoaderData\"\n    );\n    if (isErrorResult(result)) {\n      // Look upwards from the matched route for the closest ancestor\n      // error boundary, defaulting to the root match\n      let boundaryMatch = findNearestBoundary(matches, id);\n      let error = result.error;\n      // If we have a pending action error, we report it at the highest-route\n      // that throws a loader error, and then clear it out to indicate that\n      // it was consumed\n      if (pendingError) {\n        error = Object.values(pendingError)[0];\n        pendingError = undefined;\n      }\n\n      errors = errors || {};\n\n      // Prefer higher error values if lower errors bubble to the same boundary\n      if (errors[boundaryMatch.route.id] == null) {\n        errors[boundaryMatch.route.id] = error;\n      }\n\n      // Clear our any prior loaderData for the throwing route\n      loaderData[id] = undefined;\n\n      // Once we find our first (highest) error, we set the status code and\n      // prevent deeper status codes from overriding\n      if (!foundError) {\n        foundError = true;\n        statusCode = isRouteErrorResponse(result.error)\n          ? result.error.status\n          : 500;\n      }\n      if (result.headers) {\n        loaderHeaders[id] = result.headers;\n      }\n    } else {\n      if (isDeferredResult(result)) {\n        activeDeferreds.set(id, result.deferredData);\n        loaderData[id] = result.deferredData.data;\n      } else {\n        loaderData[id] = result.data;\n      }\n\n      // Error status codes always override success status codes, but if all\n      // loaders are successful we take the deepest status code.\n      if (\n        result.statusCode != null &&\n        result.statusCode !== 200 &&\n        !foundError\n      ) {\n        statusCode = result.statusCode;\n      }\n      if (result.headers) {\n        loaderHeaders[id] = result.headers;\n      }\n    }\n  });\n\n  // If we didn't consume the pending action error (i.e., all loaders\n  // resolved), then consume it here.  Also clear out any loaderData for the\n  // throwing route\n  if (pendingError) {\n    errors = pendingError;\n    loaderData[Object.keys(pendingError)[0]] = undefined;\n  }\n\n  return {\n    loaderData,\n    errors,\n    statusCode: statusCode || 200,\n    loaderHeaders,\n  };\n}\n\nfunction processLoaderData(\n  state: RouterState,\n  matches: AgnosticDataRouteMatch[],\n  matchesToLoad: AgnosticDataRouteMatch[],\n  results: DataResult[],\n  pendingError: RouteData | undefined,\n  revalidatingFetchers: RevalidatingFetcher[],\n  fetcherResults: DataResult[],\n  activeDeferreds: Map<string, DeferredData>\n): {\n  loaderData: RouterState[\"loaderData\"];\n  errors?: RouterState[\"errors\"];\n} {\n  let { loaderData, errors } = processRouteLoaderData(\n    matches,\n    matchesToLoad,\n    results,\n    pendingError,\n    activeDeferreds\n  );\n\n  // Process results from our revalidating fetchers\n  for (let index = 0; index < revalidatingFetchers.length; index++) {\n    let { key, match, controller } = revalidatingFetchers[index];\n    invariant(\n      fetcherResults !== undefined && fetcherResults[index] !== undefined,\n      \"Did not find corresponding fetcher result\"\n    );\n    let result = fetcherResults[index];\n\n    // Process fetcher non-redirect errors\n    if (controller && controller.signal.aborted) {\n      // Nothing to do for aborted fetchers\n      continue;\n    } else if (isErrorResult(result)) {\n      let boundaryMatch = findNearestBoundary(state.matches, match?.route.id);\n      if (!(errors && errors[boundaryMatch.route.id])) {\n        errors = {\n          ...errors,\n          [boundaryMatch.route.id]: result.error,\n        };\n      }\n      state.fetchers.delete(key);\n    } else if (isRedirectResult(result)) {\n      // Should never get here, redirects should get processed above, but we\n      // keep this to type narrow to a success result in the else\n      invariant(false, \"Unhandled fetcher revalidation redirect\");\n    } else if (isDeferredResult(result)) {\n      // Should never get here, deferred data should be awaited for fetchers\n      // in resolveDeferredResults\n      invariant(false, \"Unhandled fetcher deferred data\");\n    } else {\n      let doneFetcher = getDoneFetcher(result.data);\n      state.fetchers.set(key, doneFetcher);\n    }\n  }\n\n  return { loaderData, errors };\n}\n\nfunction mergeLoaderData(\n  loaderData: RouteData,\n  newLoaderData: RouteData,\n  matches: AgnosticDataRouteMatch[],\n  errors: RouteData | null | undefined\n): RouteData {\n  let mergedLoaderData = { ...newLoaderData };\n  for (let match of matches) {\n    let id = match.route.id;\n    if (newLoaderData.hasOwnProperty(id)) {\n      if (newLoaderData[id] !== undefined) {\n        mergedLoaderData[id] = newLoaderData[id];\n      } else {\n        // No-op - this is so we ignore existing data if we have a key in the\n        // incoming object with an undefined value, which is how we unset a prior\n        // loaderData if we encounter a loader error\n      }\n    } else if (loaderData[id] !== undefined && match.route.loader) {\n      // Preserve existing keys not included in newLoaderData and where a loader\n      // wasn't removed by HMR\n      mergedLoaderData[id] = loaderData[id];\n    }\n\n    if (errors && errors.hasOwnProperty(id)) {\n      // Don't keep any loader data below the boundary\n      break;\n    }\n  }\n  return mergedLoaderData;\n}\n\n// Find the nearest error boundary, looking upwards from the leaf route (or the\n// route specified by routeId) for the closest ancestor error boundary,\n// defaulting to the root match\nfunction findNearestBoundary(\n  matches: AgnosticDataRouteMatch[],\n  routeId?: string\n): AgnosticDataRouteMatch {\n  let eligibleMatches = routeId\n    ? matches.slice(0, matches.findIndex((m) => m.route.id === routeId) + 1)\n    : [...matches];\n  return (\n    eligibleMatches.reverse().find((m) => m.route.hasErrorBoundary === true) ||\n    matches[0]\n  );\n}\n\nfunction getShortCircuitMatches(routes: AgnosticDataRouteObject[]): {\n  matches: AgnosticDataRouteMatch[];\n  route: AgnosticDataRouteObject;\n} {\n  // Prefer a root layout route if present, otherwise shim in a route object\n  let route =\n    routes.length === 1\n      ? routes[0]\n      : routes.find((r) => r.index || !r.path || r.path === \"/\") || {\n          id: `__shim-error-route__`,\n        };\n\n  return {\n    matches: [\n      {\n        params: {},\n        pathname: \"\",\n        pathnameBase: \"\",\n        route,\n      },\n    ],\n    route,\n  };\n}\n\nfunction getInternalRouterError(\n  status: number,\n  {\n    pathname,\n    routeId,\n    method,\n    type,\n  }: {\n    pathname?: string;\n    routeId?: string;\n    method?: string;\n    type?: \"defer-action\" | \"invalid-body\";\n  } = {}\n) {\n  let statusText = \"Unknown Server Error\";\n  let errorMessage = \"Unknown @remix-run/router error\";\n\n  if (status === 400) {\n    statusText = \"Bad Request\";\n    if (method && pathname && routeId) {\n      errorMessage =\n        `You made a ${method} request to \"${pathname}\" but ` +\n        `did not provide a \\`loader\\` for route \"${routeId}\", ` +\n        `so there is no way to handle the request.`;\n    } else if (type === \"defer-action\") {\n      errorMessage = \"defer() is not supported in actions\";\n    } else if (type === \"invalid-body\") {\n      errorMessage = \"Unable to encode submission body\";\n    }\n  } else if (status === 403) {\n    statusText = \"Forbidden\";\n    errorMessage = `Route \"${routeId}\" does not match URL \"${pathname}\"`;\n  } else if (status === 404) {\n    statusText = \"Not Found\";\n    errorMessage = `No route matches URL \"${pathname}\"`;\n  } else if (status === 405) {\n    statusText = \"Method Not Allowed\";\n    if (method && pathname && routeId) {\n      errorMessage =\n        `You made a ${method.toUpperCase()} request to \"${pathname}\" but ` +\n        `did not provide an \\`action\\` for route \"${routeId}\", ` +\n        `so there is no way to handle the request.`;\n    } else if (method) {\n      errorMessage = `Invalid request method \"${method.toUpperCase()}\"`;\n    }\n  }\n\n  return new ErrorResponseImpl(\n    status || 500,\n    statusText,\n    new Error(errorMessage),\n    true\n  );\n}\n\n// Find any returned redirect errors, starting from the lowest match\nfunction findRedirect(\n  results: DataResult[]\n): { result: RedirectResult; idx: number } | undefined {\n  for (let i = results.length - 1; i >= 0; i--) {\n    let result = results[i];\n    if (isRedirectResult(result)) {\n      return { result, idx: i };\n    }\n  }\n}\n\nfunction stripHashFromPath(path: To) {\n  let parsedPath = typeof path === \"string\" ? parsePath(path) : path;\n  return createPath({ ...parsedPath, hash: \"\" });\n}\n\nfunction isHashChangeOnly(a: Location, b: Location): boolean {\n  if (a.pathname !== b.pathname || a.search !== b.search) {\n    return false;\n  }\n\n  if (a.hash === \"\") {\n    // /page -> /page#hash\n    return b.hash !== \"\";\n  } else if (a.hash === b.hash) {\n    // /page#hash -> /page#hash\n    return true;\n  } else if (b.hash !== \"\") {\n    // /page#hash -> /page#other\n    return true;\n  }\n\n  // If the hash is removed the browser will re-perform a request to the server\n  // /page#hash -> /page\n  return false;\n}\n\nfunction isDeferredResult(result: DataResult): result is DeferredResult {\n  return result.type === ResultType.deferred;\n}\n\nfunction isErrorResult(result: DataResult): result is ErrorResult {\n  return result.type === ResultType.error;\n}\n\nfunction isRedirectResult(result?: DataResult): result is RedirectResult {\n  return (result && result.type) === ResultType.redirect;\n}\n\nexport function isDeferredData(value: any): value is DeferredData {\n  let deferred: DeferredData = value;\n  return (\n    deferred &&\n    typeof deferred === \"object\" &&\n    typeof deferred.data === \"object\" &&\n    typeof deferred.subscribe === \"function\" &&\n    typeof deferred.cancel === \"function\" &&\n    typeof deferred.resolveData === \"function\"\n  );\n}\n\nfunction isResponse(value: any): value is Response {\n  return (\n    value != null &&\n    typeof value.status === \"number\" &&\n    typeof value.statusText === \"string\" &&\n    typeof value.headers === \"object\" &&\n    typeof value.body !== \"undefined\"\n  );\n}\n\nfunction isRedirectResponse(result: any): result is Response {\n  if (!isResponse(result)) {\n    return false;\n  }\n\n  let status = result.status;\n  let location = result.headers.get(\"Location\");\n  return status >= 300 && status <= 399 && location != null;\n}\n\nfunction isQueryRouteResponse(obj: any): obj is QueryRouteResponse {\n  return (\n    obj &&\n    isResponse(obj.response) &&\n    (obj.type === ResultType.data || obj.type === ResultType.error)\n  );\n}\n\nfunction isValidMethod(method: string): method is FormMethod | V7_FormMethod {\n  return validRequestMethods.has(method.toLowerCase() as FormMethod);\n}\n\nfunction isMutationMethod(\n  method: string\n): method is MutationFormMethod | V7_MutationFormMethod {\n  return validMutationMethods.has(method.toLowerCase() as MutationFormMethod);\n}\n\nasync function resolveDeferredResults(\n  currentMatches: AgnosticDataRouteMatch[],\n  matchesToLoad: (AgnosticDataRouteMatch | null)[],\n  results: DataResult[],\n  signals: (AbortSignal | null)[],\n  isFetcher: boolean,\n  currentLoaderData?: RouteData\n) {\n  for (let index = 0; index < results.length; index++) {\n    let result = results[index];\n    let match = matchesToLoad[index];\n    // If we don't have a match, then we can have a deferred result to do\n    // anything with.  This is for revalidating fetchers where the route was\n    // removed during HMR\n    if (!match) {\n      continue;\n    }\n\n    let currentMatch = currentMatches.find(\n      (m) => m.route.id === match!.route.id\n    );\n    let isRevalidatingLoader =\n      currentMatch != null &&\n      !isNewRouteInstance(currentMatch, match) &&\n      (currentLoaderData && currentLoaderData[match.route.id]) !== undefined;\n\n    if (isDeferredResult(result) && (isFetcher || isRevalidatingLoader)) {\n      // Note: we do not have to touch activeDeferreds here since we race them\n      // against the signal in resolveDeferredData and they'll get aborted\n      // there if needed\n      let signal = signals[index];\n      invariant(\n        signal,\n        \"Expected an AbortSignal for revalidating fetcher deferred result\"\n      );\n      await resolveDeferredData(result, signal, isFetcher).then((result) => {\n        if (result) {\n          results[index] = result || results[index];\n        }\n      });\n    }\n  }\n}\n\nasync function resolveDeferredData(\n  result: DeferredResult,\n  signal: AbortSignal,\n  unwrap = false\n): Promise<SuccessResult | ErrorResult | undefined> {\n  let aborted = await result.deferredData.resolveData(signal);\n  if (aborted) {\n    return;\n  }\n\n  if (unwrap) {\n    try {\n      return {\n        type: ResultType.data,\n        data: result.deferredData.unwrappedData,\n      };\n    } catch (e) {\n      // Handle any TrackedPromise._error values encountered while unwrapping\n      return {\n        type: ResultType.error,\n        error: e,\n      };\n    }\n  }\n\n  return {\n    type: ResultType.data,\n    data: result.deferredData.data,\n  };\n}\n\nfunction hasNakedIndexQuery(search: string): boolean {\n  return new URLSearchParams(search).getAll(\"index\").some((v) => v === \"\");\n}\n\nfunction getTargetMatch(\n  matches: AgnosticDataRouteMatch[],\n  location: Location | string\n) {\n  let search =\n    typeof location === \"string\" ? parsePath(location).search : location.search;\n  if (\n    matches[matches.length - 1].route.index &&\n    hasNakedIndexQuery(search || \"\")\n  ) {\n    // Return the leaf index route when index is present\n    return matches[matches.length - 1];\n  }\n  // Otherwise grab the deepest \"path contributing\" match (ignoring index and\n  // pathless layout routes)\n  let pathMatches = getPathContributingMatches(matches);\n  return pathMatches[pathMatches.length - 1];\n}\n\nfunction getSubmissionFromNavigation(\n  navigation: Navigation\n): Submission | undefined {\n  let { formMethod, formAction, formEncType, text, formData, json } =\n    navigation;\n  if (!formMethod || !formAction || !formEncType) {\n    return;\n  }\n\n  if (text != null) {\n    return {\n      formMethod,\n      formAction,\n      formEncType,\n      formData: undefined,\n      json: undefined,\n      text,\n    };\n  } else if (formData != null) {\n    return {\n      formMethod,\n      formAction,\n      formEncType,\n      formData,\n      json: undefined,\n      text: undefined,\n    };\n  } else if (json !== undefined) {\n    return {\n      formMethod,\n      formAction,\n      formEncType,\n      formData: undefined,\n      json,\n      text: undefined,\n    };\n  }\n}\n\nfunction getLoadingNavigation(\n  location: Location,\n  submission?: Submission\n): NavigationStates[\"Loading\"] {\n  if (submission) {\n    let navigation: NavigationStates[\"Loading\"] = {\n      state: \"loading\",\n      location,\n      formMethod: submission.formMethod,\n      formAction: submission.formAction,\n      formEncType: submission.formEncType,\n      formData: submission.formData,\n      json: submission.json,\n      text: submission.text,\n    };\n    return navigation;\n  } else {\n    let navigation: NavigationStates[\"Loading\"] = {\n      state: \"loading\",\n      location,\n      formMethod: undefined,\n      formAction: undefined,\n      formEncType: undefined,\n      formData: undefined,\n      json: undefined,\n      text: undefined,\n    };\n    return navigation;\n  }\n}\n\nfunction getSubmittingNavigation(\n  location: Location,\n  submission: Submission\n): NavigationStates[\"Submitting\"] {\n  let navigation: NavigationStates[\"Submitting\"] = {\n    state: \"submitting\",\n    location,\n    formMethod: submission.formMethod,\n    formAction: submission.formAction,\n    formEncType: submission.formEncType,\n    formData: submission.formData,\n    json: submission.json,\n    text: submission.text,\n  };\n  return navigation;\n}\n\nfunction getLoadingFetcher(\n  submission?: Submission,\n  data?: Fetcher[\"data\"]\n): FetcherStates[\"Loading\"] {\n  if (submission) {\n    let fetcher: FetcherStates[\"Loading\"] = {\n      state: \"loading\",\n      formMethod: submission.formMethod,\n      formAction: submission.formAction,\n      formEncType: submission.formEncType,\n      formData: submission.formData,\n      json: submission.json,\n      text: submission.text,\n      data,\n    };\n    return fetcher;\n  } else {\n    let fetcher: FetcherStates[\"Loading\"] = {\n      state: \"loading\",\n      formMethod: undefined,\n      formAction: undefined,\n      formEncType: undefined,\n      formData: undefined,\n      json: undefined,\n      text: undefined,\n      data,\n    };\n    return fetcher;\n  }\n}\n\nfunction getSubmittingFetcher(\n  submission: Submission,\n  existingFetcher?: Fetcher\n): FetcherStates[\"Submitting\"] {\n  let fetcher: FetcherStates[\"Submitting\"] = {\n    state: \"submitting\",\n    formMethod: submission.formMethod,\n    formAction: submission.formAction,\n    formEncType: submission.formEncType,\n    formData: submission.formData,\n    json: submission.json,\n    text: submission.text,\n    data: existingFetcher ? existingFetcher.data : undefined,\n  };\n  return fetcher;\n}\n\nfunction getDoneFetcher(data: Fetcher[\"data\"]): FetcherStates[\"Idle\"] {\n  let fetcher: FetcherStates[\"Idle\"] = {\n    state: \"idle\",\n    formMethod: undefined,\n    formAction: undefined,\n    formEncType: undefined,\n    formData: undefined,\n    json: undefined,\n    text: undefined,\n    data,\n  };\n  return fetcher;\n}\n\nfunction restoreAppliedTransitions(\n  _window: Window,\n  transitions: Map<string, Set<string>>\n) {\n  try {\n    let sessionPositions = _window.sessionStorage.getItem(\n      TRANSITIONS_STORAGE_KEY\n    );\n    if (sessionPositions) {\n      let json = JSON.parse(sessionPositions);\n      for (let [k, v] of Object.entries(json || {})) {\n        if (v && Array.isArray(v)) {\n          transitions.set(k, new Set(v || []));\n        }\n      }\n    }\n  } catch (e) {\n    // no-op, use default empty object\n  }\n}\n\nfunction persistAppliedTransitions(\n  _window: Window,\n  transitions: Map<string, Set<string>>\n) {\n  if (transitions.size > 0) {\n    let json: Record<string, string[]> = {};\n    for (let [k, v] of transitions) {\n      json[k] = [...v];\n    }\n    try {\n      _window.sessionStorage.setItem(\n        TRANSITIONS_STORAGE_KEY,\n        JSON.stringify(json)\n      );\n    } catch (error) {\n      warning(\n        false,\n        `Failed to save applied view transitions in sessionStorage (${error}).`\n      );\n    }\n  }\n}\n\n//#endregion\n","/**\n * @license\n * Lodash <https://lodash.com/>\n * Copyright OpenJS Foundation and other contributors <https://openjsf.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n;(function() {\n\n  /** Used as a safe reference for `undefined` in pre-ES5 environments. */\n  var undefined;\n\n  /** Used as the semantic version number. */\n  var VERSION = '4.17.21';\n\n  /** Used as the size to enable large array optimizations. */\n  var LARGE_ARRAY_SIZE = 200;\n\n  /** Error message constants. */\n  var CORE_ERROR_TEXT = 'Unsupported core-js use. Try https://npms.io/search?q=ponyfill.',\n      FUNC_ERROR_TEXT = 'Expected a function',\n      INVALID_TEMPL_VAR_ERROR_TEXT = 'Invalid `variable` option passed into `_.template`';\n\n  /** Used to stand-in for `undefined` hash values. */\n  var HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n  /** Used as the maximum memoize cache size. */\n  var MAX_MEMOIZE_SIZE = 500;\n\n  /** Used as the internal argument placeholder. */\n  var PLACEHOLDER = '__lodash_placeholder__';\n\n  /** Used to compose bitmasks for cloning. */\n  var CLONE_DEEP_FLAG = 1,\n      CLONE_FLAT_FLAG = 2,\n      CLONE_SYMBOLS_FLAG = 4;\n\n  /** Used to compose bitmasks for value comparisons. */\n  var COMPARE_PARTIAL_FLAG = 1,\n      COMPARE_UNORDERED_FLAG = 2;\n\n  /** Used to compose bitmasks for function metadata. */\n  var WRAP_BIND_FLAG = 1,\n      WRAP_BIND_KEY_FLAG = 2,\n      WRAP_CURRY_BOUND_FLAG = 4,\n      WRAP_CURRY_FLAG = 8,\n      WRAP_CURRY_RIGHT_FLAG = 16,\n      WRAP_PARTIAL_FLAG = 32,\n      WRAP_PARTIAL_RIGHT_FLAG = 64,\n      WRAP_ARY_FLAG = 128,\n      WRAP_REARG_FLAG = 256,\n      WRAP_FLIP_FLAG = 512;\n\n  /** Used as default options for `_.truncate`. */\n  var DEFAULT_TRUNC_LENGTH = 30,\n      DEFAULT_TRUNC_OMISSION = '...';\n\n  /** Used to detect hot functions by number of calls within a span of milliseconds. */\n  var HOT_COUNT = 800,\n      HOT_SPAN = 16;\n\n  /** Used to indicate the type of lazy iteratees. */\n  var LAZY_FILTER_FLAG = 1,\n      LAZY_MAP_FLAG = 2,\n      LAZY_WHILE_FLAG = 3;\n\n  /** Used as references for various `Number` constants. */\n  var INFINITY = 1 / 0,\n      MAX_SAFE_INTEGER = 9007199254740991,\n      MAX_INTEGER = 1.7976931348623157e+308,\n      NAN = 0 / 0;\n\n  /** Used as references for the maximum length and index of an array. */\n  var MAX_ARRAY_LENGTH = 4294967295,\n      MAX_ARRAY_INDEX = MAX_ARRAY_LENGTH - 1,\n      HALF_MAX_ARRAY_LENGTH = MAX_ARRAY_LENGTH >>> 1;\n\n  /** Used to associate wrap methods with their bit flags. */\n  var wrapFlags = [\n    ['ary', WRAP_ARY_FLAG],\n    ['bind', WRAP_BIND_FLAG],\n    ['bindKey', WRAP_BIND_KEY_FLAG],\n    ['curry', WRAP_CURRY_FLAG],\n    ['curryRight', WRAP_CURRY_RIGHT_FLAG],\n    ['flip', WRAP_FLIP_FLAG],\n    ['partial', WRAP_PARTIAL_FLAG],\n    ['partialRight', WRAP_PARTIAL_RIGHT_FLAG],\n    ['rearg', WRAP_REARG_FLAG]\n  ];\n\n  /** `Object#toString` result references. */\n  var argsTag = '[object Arguments]',\n      arrayTag = '[object Array]',\n      asyncTag = '[object AsyncFunction]',\n      boolTag = '[object Boolean]',\n      dateTag = '[object Date]',\n      domExcTag = '[object DOMException]',\n      errorTag = '[object Error]',\n      funcTag = '[object Function]',\n      genTag = '[object GeneratorFunction]',\n      mapTag = '[object Map]',\n      numberTag = '[object Number]',\n      nullTag = '[object Null]',\n      objectTag = '[object Object]',\n      promiseTag = '[object Promise]',\n      proxyTag = '[object Proxy]',\n      regexpTag = '[object RegExp]',\n      setTag = '[object Set]',\n      stringTag = '[object String]',\n      symbolTag = '[object Symbol]',\n      undefinedTag = '[object Undefined]',\n      weakMapTag = '[object WeakMap]',\n      weakSetTag = '[object WeakSet]';\n\n  var arrayBufferTag = '[object ArrayBuffer]',\n      dataViewTag = '[object DataView]',\n      float32Tag = '[object Float32Array]',\n      float64Tag = '[object Float64Array]',\n      int8Tag = '[object Int8Array]',\n      int16Tag = '[object Int16Array]',\n      int32Tag = '[object Int32Array]',\n      uint8Tag = '[object Uint8Array]',\n      uint8ClampedTag = '[object Uint8ClampedArray]',\n      uint16Tag = '[object Uint16Array]',\n      uint32Tag = '[object Uint32Array]';\n\n  /** Used to match empty string literals in compiled template source. */\n  var reEmptyStringLeading = /\\b__p \\+= '';/g,\n      reEmptyStringMiddle = /\\b(__p \\+=) '' \\+/g,\n      reEmptyStringTrailing = /(__e\\(.*?\\)|\\b__t\\)) \\+\\n'';/g;\n\n  /** Used to match HTML entities and HTML characters. */\n  var reEscapedHtml = /&(?:amp|lt|gt|quot|#39);/g,\n      reUnescapedHtml = /[&<>\"']/g,\n      reHasEscapedHtml = RegExp(reEscapedHtml.source),\n      reHasUnescapedHtml = RegExp(reUnescapedHtml.source);\n\n  /** Used to match template delimiters. */\n  var reEscape = /<%-([\\s\\S]+?)%>/g,\n      reEvaluate = /<%([\\s\\S]+?)%>/g,\n      reInterpolate = /<%=([\\s\\S]+?)%>/g;\n\n  /** Used to match property names within property paths. */\n  var reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n      reIsPlainProp = /^\\w*$/,\n      rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n  /**\n   * Used to match `RegExp`\n   * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n   */\n  var reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g,\n      reHasRegExpChar = RegExp(reRegExpChar.source);\n\n  /** Used to match leading whitespace. */\n  var reTrimStart = /^\\s+/;\n\n  /** Used to match a single whitespace character. */\n  var reWhitespace = /\\s/;\n\n  /** Used to match wrap detail comments. */\n  var reWrapComment = /\\{(?:\\n\\/\\* \\[wrapped with .+\\] \\*\\/)?\\n?/,\n      reWrapDetails = /\\{\\n\\/\\* \\[wrapped with (.+)\\] \\*/,\n      reSplitDetails = /,? & /;\n\n  /** Used to match words composed of alphanumeric characters. */\n  var reAsciiWord = /[^\\x00-\\x2f\\x3a-\\x40\\x5b-\\x60\\x7b-\\x7f]+/g;\n\n  /**\n   * Used to validate the `validate` option in `_.template` variable.\n   *\n   * Forbids characters which could potentially change the meaning of the function argument definition:\n   * - \"(),\" (modification of function parameters)\n   * - \"=\" (default value)\n   * - \"[]{}\" (destructuring of function parameters)\n   * - \"/\" (beginning of a comment)\n   * - whitespace\n   */\n  var reForbiddenIdentifierChars = /[()=,{}\\[\\]\\/\\s]/;\n\n  /** Used to match backslashes in property paths. */\n  var reEscapeChar = /\\\\(\\\\)?/g;\n\n  /**\n   * Used to match\n   * [ES template delimiters](http://ecma-international.org/ecma-262/7.0/#sec-template-literal-lexical-components).\n   */\n  var reEsTemplate = /\\$\\{([^\\\\}]*(?:\\\\.[^\\\\}]*)*)\\}/g;\n\n  /** Used to match `RegExp` flags from their coerced string values. */\n  var reFlags = /\\w*$/;\n\n  /** Used to detect bad signed hexadecimal string values. */\n  var reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n  /** Used to detect binary string values. */\n  var reIsBinary = /^0b[01]+$/i;\n\n  /** Used to detect host constructors (Safari). */\n  var reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n  /** Used to detect octal string values. */\n  var reIsOctal = /^0o[0-7]+$/i;\n\n  /** Used to detect unsigned integer values. */\n  var reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n  /** Used to match Latin Unicode letters (excluding mathematical operators). */\n  var reLatin = /[\\xc0-\\xd6\\xd8-\\xf6\\xf8-\\xff\\u0100-\\u017f]/g;\n\n  /** Used to ensure capturing order of template delimiters. */\n  var reNoMatch = /($^)/;\n\n  /** Used to match unescaped characters in compiled string literals. */\n  var reUnescapedString = /['\\n\\r\\u2028\\u2029\\\\]/g;\n\n  /** Used to compose unicode character classes. */\n  var rsAstralRange = '\\\\ud800-\\\\udfff',\n      rsComboMarksRange = '\\\\u0300-\\\\u036f',\n      reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n      rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n      rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n      rsDingbatRange = '\\\\u2700-\\\\u27bf',\n      rsLowerRange = 'a-z\\\\xdf-\\\\xf6\\\\xf8-\\\\xff',\n      rsMathOpRange = '\\\\xac\\\\xb1\\\\xd7\\\\xf7',\n      rsNonCharRange = '\\\\x00-\\\\x2f\\\\x3a-\\\\x40\\\\x5b-\\\\x60\\\\x7b-\\\\xbf',\n      rsPunctuationRange = '\\\\u2000-\\\\u206f',\n      rsSpaceRange = ' \\\\t\\\\x0b\\\\f\\\\xa0\\\\ufeff\\\\n\\\\r\\\\u2028\\\\u2029\\\\u1680\\\\u180e\\\\u2000\\\\u2001\\\\u2002\\\\u2003\\\\u2004\\\\u2005\\\\u2006\\\\u2007\\\\u2008\\\\u2009\\\\u200a\\\\u202f\\\\u205f\\\\u3000',\n      rsUpperRange = 'A-Z\\\\xc0-\\\\xd6\\\\xd8-\\\\xde',\n      rsVarRange = '\\\\ufe0e\\\\ufe0f',\n      rsBreakRange = rsMathOpRange + rsNonCharRange + rsPunctuationRange + rsSpaceRange;\n\n  /** Used to compose unicode capture groups. */\n  var rsApos = \"['\\u2019]\",\n      rsAstral = '[' + rsAstralRange + ']',\n      rsBreak = '[' + rsBreakRange + ']',\n      rsCombo = '[' + rsComboRange + ']',\n      rsDigits = '\\\\d+',\n      rsDingbat = '[' + rsDingbatRange + ']',\n      rsLower = '[' + rsLowerRange + ']',\n      rsMisc = '[^' + rsAstralRange + rsBreakRange + rsDigits + rsDingbatRange + rsLowerRange + rsUpperRange + ']',\n      rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n      rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n      rsNonAstral = '[^' + rsAstralRange + ']',\n      rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n      rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n      rsUpper = '[' + rsUpperRange + ']',\n      rsZWJ = '\\\\u200d';\n\n  /** Used to compose unicode regexes. */\n  var rsMiscLower = '(?:' + rsLower + '|' + rsMisc + ')',\n      rsMiscUpper = '(?:' + rsUpper + '|' + rsMisc + ')',\n      rsOptContrLower = '(?:' + rsApos + '(?:d|ll|m|re|s|t|ve))?',\n      rsOptContrUpper = '(?:' + rsApos + '(?:D|LL|M|RE|S|T|VE))?',\n      reOptMod = rsModifier + '?',\n      rsOptVar = '[' + rsVarRange + ']?',\n      rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n      rsOrdLower = '\\\\d*(?:1st|2nd|3rd|(?![123])\\\\dth)(?=\\\\b|[A-Z_])',\n      rsOrdUpper = '\\\\d*(?:1ST|2ND|3RD|(?![123])\\\\dTH)(?=\\\\b|[a-z_])',\n      rsSeq = rsOptVar + reOptMod + rsOptJoin,\n      rsEmoji = '(?:' + [rsDingbat, rsRegional, rsSurrPair].join('|') + ')' + rsSeq,\n      rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n  /** Used to match apostrophes. */\n  var reApos = RegExp(rsApos, 'g');\n\n  /**\n   * Used to match [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks) and\n   * [combining diacritical marks for symbols](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks_for_Symbols).\n   */\n  var reComboMark = RegExp(rsCombo, 'g');\n\n  /** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\n  var reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n  /** Used to match complex or compound words. */\n  var reUnicodeWord = RegExp([\n    rsUpper + '?' + rsLower + '+' + rsOptContrLower + '(?=' + [rsBreak, rsUpper, '$'].join('|') + ')',\n    rsMiscUpper + '+' + rsOptContrUpper + '(?=' + [rsBreak, rsUpper + rsMiscLower, '$'].join('|') + ')',\n    rsUpper + '?' + rsMiscLower + '+' + rsOptContrLower,\n    rsUpper + '+' + rsOptContrUpper,\n    rsOrdUpper,\n    rsOrdLower,\n    rsDigits,\n    rsEmoji\n  ].join('|'), 'g');\n\n  /** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\n  var reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n  /** Used to detect strings that need a more robust regexp to match words. */\n  var reHasUnicodeWord = /[a-z][A-Z]|[A-Z]{2}[a-z]|[0-9][a-zA-Z]|[a-zA-Z][0-9]|[^a-zA-Z0-9 ]/;\n\n  /** Used to assign default `context` object properties. */\n  var contextProps = [\n    'Array', 'Buffer', 'DataView', 'Date', 'Error', 'Float32Array', 'Float64Array',\n    'Function', 'Int8Array', 'Int16Array', 'Int32Array', 'Map', 'Math', 'Object',\n    'Promise', 'RegExp', 'Set', 'String', 'Symbol', 'TypeError', 'Uint8Array',\n    'Uint8ClampedArray', 'Uint16Array', 'Uint32Array', 'WeakMap',\n    '_', 'clearTimeout', 'isFinite', 'parseInt', 'setTimeout'\n  ];\n\n  /** Used to make template sourceURLs easier to identify. */\n  var templateCounter = -1;\n\n  /** Used to identify `toStringTag` values of typed arrays. */\n  var typedArrayTags = {};\n  typedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\n  typedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\n  typedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\n  typedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\n  typedArrayTags[uint32Tag] = true;\n  typedArrayTags[argsTag] = typedArrayTags[arrayTag] =\n  typedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\n  typedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\n  typedArrayTags[errorTag] = typedArrayTags[funcTag] =\n  typedArrayTags[mapTag] = typedArrayTags[numberTag] =\n  typedArrayTags[objectTag] = typedArrayTags[regexpTag] =\n  typedArrayTags[setTag] = typedArrayTags[stringTag] =\n  typedArrayTags[weakMapTag] = false;\n\n  /** Used to identify `toStringTag` values supported by `_.clone`. */\n  var cloneableTags = {};\n  cloneableTags[argsTag] = cloneableTags[arrayTag] =\n  cloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\n  cloneableTags[boolTag] = cloneableTags[dateTag] =\n  cloneableTags[float32Tag] = cloneableTags[float64Tag] =\n  cloneableTags[int8Tag] = cloneableTags[int16Tag] =\n  cloneableTags[int32Tag] = cloneableTags[mapTag] =\n  cloneableTags[numberTag] = cloneableTags[objectTag] =\n  cloneableTags[regexpTag] = cloneableTags[setTag] =\n  cloneableTags[stringTag] = cloneableTags[symbolTag] =\n  cloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\n  cloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\n  cloneableTags[errorTag] = cloneableTags[funcTag] =\n  cloneableTags[weakMapTag] = false;\n\n  /** Used to map Latin Unicode letters to basic Latin letters. */\n  var deburredLetters = {\n    // Latin-1 Supplement block.\n    '\\xc0': 'A',  '\\xc1': 'A', '\\xc2': 'A', '\\xc3': 'A', '\\xc4': 'A', '\\xc5': 'A',\n    '\\xe0': 'a',  '\\xe1': 'a', '\\xe2': 'a', '\\xe3': 'a', '\\xe4': 'a', '\\xe5': 'a',\n    '\\xc7': 'C',  '\\xe7': 'c',\n    '\\xd0': 'D',  '\\xf0': 'd',\n    '\\xc8': 'E',  '\\xc9': 'E', '\\xca': 'E', '\\xcb': 'E',\n    '\\xe8': 'e',  '\\xe9': 'e', '\\xea': 'e', '\\xeb': 'e',\n    '\\xcc': 'I',  '\\xcd': 'I', '\\xce': 'I', '\\xcf': 'I',\n    '\\xec': 'i',  '\\xed': 'i', '\\xee': 'i', '\\xef': 'i',\n    '\\xd1': 'N',  '\\xf1': 'n',\n    '\\xd2': 'O',  '\\xd3': 'O', '\\xd4': 'O', '\\xd5': 'O', '\\xd6': 'O', '\\xd8': 'O',\n    '\\xf2': 'o',  '\\xf3': 'o', '\\xf4': 'o', '\\xf5': 'o', '\\xf6': 'o', '\\xf8': 'o',\n    '\\xd9': 'U',  '\\xda': 'U', '\\xdb': 'U', '\\xdc': 'U',\n    '\\xf9': 'u',  '\\xfa': 'u', '\\xfb': 'u', '\\xfc': 'u',\n    '\\xdd': 'Y',  '\\xfd': 'y', '\\xff': 'y',\n    '\\xc6': 'Ae', '\\xe6': 'ae',\n    '\\xde': 'Th', '\\xfe': 'th',\n    '\\xdf': 'ss',\n    // Latin Extended-A block.\n    '\\u0100': 'A',  '\\u0102': 'A', '\\u0104': 'A',\n    '\\u0101': 'a',  '\\u0103': 'a', '\\u0105': 'a',\n    '\\u0106': 'C',  '\\u0108': 'C', '\\u010a': 'C', '\\u010c': 'C',\n    '\\u0107': 'c',  '\\u0109': 'c', '\\u010b': 'c', '\\u010d': 'c',\n    '\\u010e': 'D',  '\\u0110': 'D', '\\u010f': 'd', '\\u0111': 'd',\n    '\\u0112': 'E',  '\\u0114': 'E', '\\u0116': 'E', '\\u0118': 'E', '\\u011a': 'E',\n    '\\u0113': 'e',  '\\u0115': 'e', '\\u0117': 'e', '\\u0119': 'e', '\\u011b': 'e',\n    '\\u011c': 'G',  '\\u011e': 'G', '\\u0120': 'G', '\\u0122': 'G',\n    '\\u011d': 'g',  '\\u011f': 'g', '\\u0121': 'g', '\\u0123': 'g',\n    '\\u0124': 'H',  '\\u0126': 'H', '\\u0125': 'h', '\\u0127': 'h',\n    '\\u0128': 'I',  '\\u012a': 'I', '\\u012c': 'I', '\\u012e': 'I', '\\u0130': 'I',\n    '\\u0129': 'i',  '\\u012b': 'i', '\\u012d': 'i', '\\u012f': 'i', '\\u0131': 'i',\n    '\\u0134': 'J',  '\\u0135': 'j',\n    '\\u0136': 'K',  '\\u0137': 'k', '\\u0138': 'k',\n    '\\u0139': 'L',  '\\u013b': 'L', '\\u013d': 'L', '\\u013f': 'L', '\\u0141': 'L',\n    '\\u013a': 'l',  '\\u013c': 'l', '\\u013e': 'l', '\\u0140': 'l', '\\u0142': 'l',\n    '\\u0143': 'N',  '\\u0145': 'N', '\\u0147': 'N', '\\u014a': 'N',\n    '\\u0144': 'n',  '\\u0146': 'n', '\\u0148': 'n', '\\u014b': 'n',\n    '\\u014c': 'O',  '\\u014e': 'O', '\\u0150': 'O',\n    '\\u014d': 'o',  '\\u014f': 'o', '\\u0151': 'o',\n    '\\u0154': 'R',  '\\u0156': 'R', '\\u0158': 'R',\n    '\\u0155': 'r',  '\\u0157': 'r', '\\u0159': 'r',\n    '\\u015a': 'S',  '\\u015c': 'S', '\\u015e': 'S', '\\u0160': 'S',\n    '\\u015b': 's',  '\\u015d': 's', '\\u015f': 's', '\\u0161': 's',\n    '\\u0162': 'T',  '\\u0164': 'T', '\\u0166': 'T',\n    '\\u0163': 't',  '\\u0165': 't', '\\u0167': 't',\n    '\\u0168': 'U',  '\\u016a': 'U', '\\u016c': 'U', '\\u016e': 'U', '\\u0170': 'U', '\\u0172': 'U',\n    '\\u0169': 'u',  '\\u016b': 'u', '\\u016d': 'u', '\\u016f': 'u', '\\u0171': 'u', '\\u0173': 'u',\n    '\\u0174': 'W',  '\\u0175': 'w',\n    '\\u0176': 'Y',  '\\u0177': 'y', '\\u0178': 'Y',\n    '\\u0179': 'Z',  '\\u017b': 'Z', '\\u017d': 'Z',\n    '\\u017a': 'z',  '\\u017c': 'z', '\\u017e': 'z',\n    '\\u0132': 'IJ', '\\u0133': 'ij',\n    '\\u0152': 'Oe', '\\u0153': 'oe',\n    '\\u0149': \"'n\", '\\u017f': 's'\n  };\n\n  /** Used to map characters to HTML entities. */\n  var htmlEscapes = {\n    '&': '&amp;',\n    '<': '&lt;',\n    '>': '&gt;',\n    '\"': '&quot;',\n    \"'\": '&#39;'\n  };\n\n  /** Used to map HTML entities to characters. */\n  var htmlUnescapes = {\n    '&amp;': '&',\n    '&lt;': '<',\n    '&gt;': '>',\n    '&quot;': '\"',\n    '&#39;': \"'\"\n  };\n\n  /** Used to escape characters for inclusion in compiled string literals. */\n  var stringEscapes = {\n    '\\\\': '\\\\',\n    \"'\": \"'\",\n    '\\n': 'n',\n    '\\r': 'r',\n    '\\u2028': 'u2028',\n    '\\u2029': 'u2029'\n  };\n\n  /** Built-in method references without a dependency on `root`. */\n  var freeParseFloat = parseFloat,\n      freeParseInt = parseInt;\n\n  /** Detect free variable `global` from Node.js. */\n  var freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n  /** Detect free variable `self`. */\n  var freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n  /** Used as a reference to the global object. */\n  var root = freeGlobal || freeSelf || Function('return this')();\n\n  /** Detect free variable `exports`. */\n  var freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n  /** Detect free variable `module`. */\n  var freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n  /** Detect the popular CommonJS extension `module.exports`. */\n  var moduleExports = freeModule && freeModule.exports === freeExports;\n\n  /** Detect free variable `process` from Node.js. */\n  var freeProcess = moduleExports && freeGlobal.process;\n\n  /** Used to access faster Node.js helpers. */\n  var nodeUtil = (function() {\n    try {\n      // Use `util.types` for Node.js 10+.\n      var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n      if (types) {\n        return types;\n      }\n\n      // Legacy `process.binding('util')` for Node.js < 10.\n      return freeProcess && freeProcess.binding && freeProcess.binding('util');\n    } catch (e) {}\n  }());\n\n  /* Node.js helper references. */\n  var nodeIsArrayBuffer = nodeUtil && nodeUtil.isArrayBuffer,\n      nodeIsDate = nodeUtil && nodeUtil.isDate,\n      nodeIsMap = nodeUtil && nodeUtil.isMap,\n      nodeIsRegExp = nodeUtil && nodeUtil.isRegExp,\n      nodeIsSet = nodeUtil && nodeUtil.isSet,\n      nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * A faster alternative to `Function#apply`, this function invokes `func`\n   * with the `this` binding of `thisArg` and the arguments of `args`.\n   *\n   * @private\n   * @param {Function} func The function to invoke.\n   * @param {*} thisArg The `this` binding of `func`.\n   * @param {Array} args The arguments to invoke `func` with.\n   * @returns {*} Returns the result of `func`.\n   */\n  function apply(func, thisArg, args) {\n    switch (args.length) {\n      case 0: return func.call(thisArg);\n      case 1: return func.call(thisArg, args[0]);\n      case 2: return func.call(thisArg, args[0], args[1]);\n      case 3: return func.call(thisArg, args[0], args[1], args[2]);\n    }\n    return func.apply(thisArg, args);\n  }\n\n  /**\n   * A specialized version of `baseAggregator` for arrays.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} setter The function to set `accumulator` values.\n   * @param {Function} iteratee The iteratee to transform keys.\n   * @param {Object} accumulator The initial aggregated object.\n   * @returns {Function} Returns `accumulator`.\n   */\n  function arrayAggregator(array, setter, iteratee, accumulator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      var value = array[index];\n      setter(accumulator, value, iteratee(value), array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.forEach` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEach(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (iteratee(array[index], index, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.forEachRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayEachRight(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n\n    while (length--) {\n      if (iteratee(array[length], length, array) === false) {\n        break;\n      }\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.every` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if all elements pass the predicate check,\n   *  else `false`.\n   */\n  function arrayEvery(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (!predicate(array[index], index, array)) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  /**\n   * A specialized version of `_.filter` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {Array} Returns the new filtered array.\n   */\n  function arrayFilter(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (predicate(value, index, array)) {\n        result[resIndex++] = value;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * A specialized version of `_.includes` for arrays without support for\n   * specifying an index to search from.\n   *\n   * @private\n   * @param {Array} [array] The array to inspect.\n   * @param {*} target The value to search for.\n   * @returns {boolean} Returns `true` if `target` is found, else `false`.\n   */\n  function arrayIncludes(array, value) {\n    var length = array == null ? 0 : array.length;\n    return !!length && baseIndexOf(array, value, 0) > -1;\n  }\n\n  /**\n   * This function is like `arrayIncludes` except that it accepts a comparator.\n   *\n   * @private\n   * @param {Array} [array] The array to inspect.\n   * @param {*} target The value to search for.\n   * @param {Function} comparator The comparator invoked per element.\n   * @returns {boolean} Returns `true` if `target` is found, else `false`.\n   */\n  function arrayIncludesWith(array, value, comparator) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (comparator(value, array[index])) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * A specialized version of `_.map` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the new mapped array.\n   */\n  function arrayMap(array, iteratee) {\n    var index = -1,\n        length = array == null ? 0 : array.length,\n        result = Array(length);\n\n    while (++index < length) {\n      result[index] = iteratee(array[index], index, array);\n    }\n    return result;\n  }\n\n  /**\n   * Appends the elements of `values` to `array`.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {Array} values The values to append.\n   * @returns {Array} Returns `array`.\n   */\n  function arrayPush(array, values) {\n    var index = -1,\n        length = values.length,\n        offset = array.length;\n\n    while (++index < length) {\n      array[offset + index] = values[index];\n    }\n    return array;\n  }\n\n  /**\n   * A specialized version of `_.reduce` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the first element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduce(array, iteratee, accumulator, initAccum) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    if (initAccum && length) {\n      accumulator = array[++index];\n    }\n    while (++index < length) {\n      accumulator = iteratee(accumulator, array[index], index, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.reduceRight` for arrays without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} [accumulator] The initial value.\n   * @param {boolean} [initAccum] Specify using the last element of `array` as\n   *  the initial value.\n   * @returns {*} Returns the accumulated value.\n   */\n  function arrayReduceRight(array, iteratee, accumulator, initAccum) {\n    var length = array == null ? 0 : array.length;\n    if (initAccum && length) {\n      accumulator = array[--length];\n    }\n    while (length--) {\n      accumulator = iteratee(accumulator, array[length], length, array);\n    }\n    return accumulator;\n  }\n\n  /**\n   * A specialized version of `_.some` for arrays without support for iteratee\n   * shorthands.\n   *\n   * @private\n   * @param {Array} [array] The array to iterate over.\n   * @param {Function} predicate The function invoked per iteration.\n   * @returns {boolean} Returns `true` if any element passes the predicate check,\n   *  else `false`.\n   */\n  function arraySome(array, predicate) {\n    var index = -1,\n        length = array == null ? 0 : array.length;\n\n    while (++index < length) {\n      if (predicate(array[index], index, array)) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  /**\n   * Gets the size of an ASCII `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  var asciiSize = baseProperty('length');\n\n  /**\n   * Converts an ASCII `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function asciiToArray(string) {\n    return string.split('');\n  }\n\n  /**\n   * Splits an ASCII `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function asciiWords(string) {\n    return string.match(reAsciiWord) || [];\n  }\n\n  /**\n   * The base implementation of methods like `_.findKey` and `_.findLastKey`,\n   * without support for iteratee shorthands, which iterates over `collection`\n   * using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the found element or its key, else `undefined`.\n   */\n  function baseFindKey(collection, predicate, eachFunc) {\n    var result;\n    eachFunc(collection, function(value, key, collection) {\n      if (predicate(value, key, collection)) {\n        result = key;\n        return false;\n      }\n    });\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.findIndex` and `_.findLastIndex` without\n   * support for iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {Function} predicate The function invoked per iteration.\n   * @param {number} fromIndex The index to search from.\n   * @param {boolean} [fromRight] Specify iterating from right to left.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseFindIndex(array, predicate, fromIndex, fromRight) {\n    var length = array.length,\n        index = fromIndex + (fromRight ? 1 : -1);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (predicate(array[index], index, array)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOf(array, value, fromIndex) {\n    return value === value\n      ? strictIndexOf(array, value, fromIndex)\n      : baseFindIndex(array, baseIsNaN, fromIndex);\n  }\n\n  /**\n   * This function is like `baseIndexOf` except that it accepts a comparator.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @param {Function} comparator The comparator invoked per element.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function baseIndexOfWith(array, value, fromIndex, comparator) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (comparator(array[index], value)) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * The base implementation of `_.isNaN` without support for number objects.\n   *\n   * @private\n   * @param {*} value The value to check.\n   * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n   */\n  function baseIsNaN(value) {\n    return value !== value;\n  }\n\n  /**\n   * The base implementation of `_.mean` and `_.meanBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the mean.\n   */\n  function baseMean(array, iteratee) {\n    var length = array == null ? 0 : array.length;\n    return length ? (baseSum(array, iteratee) / length) : NAN;\n  }\n\n  /**\n   * The base implementation of `_.property` without support for deep paths.\n   *\n   * @private\n   * @param {string} key The key of the property to get.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function baseProperty(key) {\n    return function(object) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.propertyOf` without support for deep paths.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @returns {Function} Returns the new accessor function.\n   */\n  function basePropertyOf(object) {\n    return function(key) {\n      return object == null ? undefined : object[key];\n    };\n  }\n\n  /**\n   * The base implementation of `_.reduce` and `_.reduceRight`, without support\n   * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n   *\n   * @private\n   * @param {Array|Object} collection The collection to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @param {*} accumulator The initial value.\n   * @param {boolean} initAccum Specify using the first or last element of\n   *  `collection` as the initial value.\n   * @param {Function} eachFunc The function to iterate over `collection`.\n   * @returns {*} Returns the accumulated value.\n   */\n  function baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n    eachFunc(collection, function(value, index, collection) {\n      accumulator = initAccum\n        ? (initAccum = false, value)\n        : iteratee(accumulator, value, index, collection);\n    });\n    return accumulator;\n  }\n\n  /**\n   * The base implementation of `_.sortBy` which uses `comparer` to define the\n   * sort order of `array` and replaces criteria objects with their corresponding\n   * values.\n   *\n   * @private\n   * @param {Array} array The array to sort.\n   * @param {Function} comparer The function to define sort order.\n   * @returns {Array} Returns `array`.\n   */\n  function baseSortBy(array, comparer) {\n    var length = array.length;\n\n    array.sort(comparer);\n    while (length--) {\n      array[length] = array[length].value;\n    }\n    return array;\n  }\n\n  /**\n   * The base implementation of `_.sum` and `_.sumBy` without support for\n   * iteratee shorthands.\n   *\n   * @private\n   * @param {Array} array The array to iterate over.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {number} Returns the sum.\n   */\n  function baseSum(array, iteratee) {\n    var result,\n        index = -1,\n        length = array.length;\n\n    while (++index < length) {\n      var current = iteratee(array[index]);\n      if (current !== undefined) {\n        result = result === undefined ? current : (result + current);\n      }\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.times` without support for iteratee shorthands\n   * or max array length checks.\n   *\n   * @private\n   * @param {number} n The number of times to invoke `iteratee`.\n   * @param {Function} iteratee The function invoked per iteration.\n   * @returns {Array} Returns the array of results.\n   */\n  function baseTimes(n, iteratee) {\n    var index = -1,\n        result = Array(n);\n\n    while (++index < n) {\n      result[index] = iteratee(index);\n    }\n    return result;\n  }\n\n  /**\n   * The base implementation of `_.toPairs` and `_.toPairsIn` which creates an array\n   * of key-value pairs for `object` corresponding to the property names of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the key-value pairs.\n   */\n  function baseToPairs(object, props) {\n    return arrayMap(props, function(key) {\n      return [key, object[key]];\n    });\n  }\n\n  /**\n   * The base implementation of `_.trim`.\n   *\n   * @private\n   * @param {string} string The string to trim.\n   * @returns {string} Returns the trimmed string.\n   */\n  function baseTrim(string) {\n    return string\n      ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n      : string;\n  }\n\n  /**\n   * The base implementation of `_.unary` without support for storing metadata.\n   *\n   * @private\n   * @param {Function} func The function to cap arguments for.\n   * @returns {Function} Returns the new capped function.\n   */\n  function baseUnary(func) {\n    return function(value) {\n      return func(value);\n    };\n  }\n\n  /**\n   * The base implementation of `_.values` and `_.valuesIn` which creates an\n   * array of `object` property values corresponding to the property names\n   * of `props`.\n   *\n   * @private\n   * @param {Object} object The object to query.\n   * @param {Array} props The property names to get values for.\n   * @returns {Object} Returns the array of property values.\n   */\n  function baseValues(object, props) {\n    return arrayMap(props, function(key) {\n      return object[key];\n    });\n  }\n\n  /**\n   * Checks if a `cache` value for `key` exists.\n   *\n   * @private\n   * @param {Object} cache The cache to query.\n   * @param {string} key The key of the entry to check.\n   * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n   */\n  function cacheHas(cache, key) {\n    return cache.has(key);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimStart` to get the index of the first string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the first unmatched string symbol.\n   */\n  function charsStartIndex(strSymbols, chrSymbols) {\n    var index = -1,\n        length = strSymbols.length;\n\n    while (++index < length && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last string symbol\n   * that is not found in the character symbols.\n   *\n   * @private\n   * @param {Array} strSymbols The string symbols to inspect.\n   * @param {Array} chrSymbols The character symbols to find.\n   * @returns {number} Returns the index of the last unmatched string symbol.\n   */\n  function charsEndIndex(strSymbols, chrSymbols) {\n    var index = strSymbols.length;\n\n    while (index-- && baseIndexOf(chrSymbols, strSymbols[index], 0) > -1) {}\n    return index;\n  }\n\n  /**\n   * Gets the number of `placeholder` occurrences in `array`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} placeholder The placeholder to search for.\n   * @returns {number} Returns the placeholder count.\n   */\n  function countHolders(array, placeholder) {\n    var length = array.length,\n        result = 0;\n\n    while (length--) {\n      if (array[length] === placeholder) {\n        ++result;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Used by `_.deburr` to convert Latin-1 Supplement and Latin Extended-A\n   * letters to basic Latin letters.\n   *\n   * @private\n   * @param {string} letter The matched letter to deburr.\n   * @returns {string} Returns the deburred letter.\n   */\n  var deburrLetter = basePropertyOf(deburredLetters);\n\n  /**\n   * Used by `_.escape` to convert characters to HTML entities.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  var escapeHtmlChar = basePropertyOf(htmlEscapes);\n\n  /**\n   * Used by `_.template` to escape characters for inclusion in compiled string literals.\n   *\n   * @private\n   * @param {string} chr The matched character to escape.\n   * @returns {string} Returns the escaped character.\n   */\n  function escapeStringChar(chr) {\n    return '\\\\' + stringEscapes[chr];\n  }\n\n  /**\n   * Gets the value at `key` of `object`.\n   *\n   * @private\n   * @param {Object} [object] The object to query.\n   * @param {string} key The key of the property to get.\n   * @returns {*} Returns the property value.\n   */\n  function getValue(object, key) {\n    return object == null ? undefined : object[key];\n  }\n\n  /**\n   * Checks if `string` contains Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n   */\n  function hasUnicode(string) {\n    return reHasUnicode.test(string);\n  }\n\n  /**\n   * Checks if `string` contains a word composed of Unicode symbols.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {boolean} Returns `true` if a word is found, else `false`.\n   */\n  function hasUnicodeWord(string) {\n    return reHasUnicodeWord.test(string);\n  }\n\n  /**\n   * Converts `iterator` to an array.\n   *\n   * @private\n   * @param {Object} iterator The iterator to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function iteratorToArray(iterator) {\n    var data,\n        result = [];\n\n    while (!(data = iterator.next()).done) {\n      result.push(data.value);\n    }\n    return result;\n  }\n\n  /**\n   * Converts `map` to its key-value pairs.\n   *\n   * @private\n   * @param {Object} map The map to convert.\n   * @returns {Array} Returns the key-value pairs.\n   */\n  function mapToArray(map) {\n    var index = -1,\n        result = Array(map.size);\n\n    map.forEach(function(value, key) {\n      result[++index] = [key, value];\n    });\n    return result;\n  }\n\n  /**\n   * Creates a unary function that invokes `func` with its argument transformed.\n   *\n   * @private\n   * @param {Function} func The function to wrap.\n   * @param {Function} transform The argument transform.\n   * @returns {Function} Returns the new function.\n   */\n  function overArg(func, transform) {\n    return function(arg) {\n      return func(transform(arg));\n    };\n  }\n\n  /**\n   * Replaces all `placeholder` elements in `array` with an internal placeholder\n   * and returns an array of their indexes.\n   *\n   * @private\n   * @param {Array} array The array to modify.\n   * @param {*} placeholder The placeholder to replace.\n   * @returns {Array} Returns the new array of placeholder indexes.\n   */\n  function replaceHolders(array, placeholder) {\n    var index = -1,\n        length = array.length,\n        resIndex = 0,\n        result = [];\n\n    while (++index < length) {\n      var value = array[index];\n      if (value === placeholder || value === PLACEHOLDER) {\n        array[index] = PLACEHOLDER;\n        result[resIndex++] = index;\n      }\n    }\n    return result;\n  }\n\n  /**\n   * Converts `set` to an array of its values.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the values.\n   */\n  function setToArray(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = value;\n    });\n    return result;\n  }\n\n  /**\n   * Converts `set` to its value-value pairs.\n   *\n   * @private\n   * @param {Object} set The set to convert.\n   * @returns {Array} Returns the value-value pairs.\n   */\n  function setToPairs(set) {\n    var index = -1,\n        result = Array(set.size);\n\n    set.forEach(function(value) {\n      result[++index] = [value, value];\n    });\n    return result;\n  }\n\n  /**\n   * A specialized version of `_.indexOf` which performs strict equality\n   * comparisons of values, i.e. `===`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function strictIndexOf(array, value, fromIndex) {\n    var index = fromIndex - 1,\n        length = array.length;\n\n    while (++index < length) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return -1;\n  }\n\n  /**\n   * A specialized version of `_.lastIndexOf` which performs strict equality\n   * comparisons of values, i.e. `===`.\n   *\n   * @private\n   * @param {Array} array The array to inspect.\n   * @param {*} value The value to search for.\n   * @param {number} fromIndex The index to search from.\n   * @returns {number} Returns the index of the matched value, else `-1`.\n   */\n  function strictLastIndexOf(array, value, fromIndex) {\n    var index = fromIndex + 1;\n    while (index--) {\n      if (array[index] === value) {\n        return index;\n      }\n    }\n    return index;\n  }\n\n  /**\n   * Gets the number of symbols in `string`.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {number} Returns the string size.\n   */\n  function stringSize(string) {\n    return hasUnicode(string)\n      ? unicodeSize(string)\n      : asciiSize(string);\n  }\n\n  /**\n   * Converts `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function stringToArray(string) {\n    return hasUnicode(string)\n      ? unicodeToArray(string)\n      : asciiToArray(string);\n  }\n\n  /**\n   * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n   * character of `string`.\n   *\n   * @private\n   * @param {string} string The string to inspect.\n   * @returns {number} Returns the index of the last non-whitespace character.\n   */\n  function trimmedEndIndex(string) {\n    var index = string.length;\n\n    while (index-- && reWhitespace.test(string.charAt(index))) {}\n    return index;\n  }\n\n  /**\n   * Used by `_.unescape` to convert HTML entities to characters.\n   *\n   * @private\n   * @param {string} chr The matched character to unescape.\n   * @returns {string} Returns the unescaped character.\n   */\n  var unescapeHtmlChar = basePropertyOf(htmlUnescapes);\n\n  /**\n   * Gets the size of a Unicode `string`.\n   *\n   * @private\n   * @param {string} string The string inspect.\n   * @returns {number} Returns the string size.\n   */\n  function unicodeSize(string) {\n    var result = reUnicode.lastIndex = 0;\n    while (reUnicode.test(string)) {\n      ++result;\n    }\n    return result;\n  }\n\n  /**\n   * Converts a Unicode `string` to an array.\n   *\n   * @private\n   * @param {string} string The string to convert.\n   * @returns {Array} Returns the converted array.\n   */\n  function unicodeToArray(string) {\n    return string.match(reUnicode) || [];\n  }\n\n  /**\n   * Splits a Unicode `string` into an array of its words.\n   *\n   * @private\n   * @param {string} The string to inspect.\n   * @returns {Array} Returns the words of `string`.\n   */\n  function unicodeWords(string) {\n    return string.match(reUnicodeWord) || [];\n  }\n\n  /*--------------------------------------------------------------------------*/\n\n  /**\n   * Create a new pristine `lodash` function using the `context` object.\n   *\n   * @static\n   * @memberOf _\n   * @since 1.1.0\n   * @category Util\n   * @param {Object} [context=root] The context object.\n   * @returns {Function} Returns a new `lodash` function.\n   * @example\n   *\n   * _.mixin({ 'foo': _.constant('foo') });\n   *\n   * var lodash = _.runInContext();\n   * lodash.mixin({ 'bar': lodash.constant('bar') });\n   *\n   * _.isFunction(_.foo);\n   * // => true\n   * _.isFunction(_.bar);\n   * // => false\n   *\n   * lodash.isFunction(lodash.foo);\n   * // => false\n   * lodash.isFunction(lodash.bar);\n   * // => true\n   *\n   * // Create a suped-up `defer` in Node.js.\n   * var defer = _.runInContext({ 'setTimeout': setImmediate }).defer;\n   */\n  var runInContext = (function runInContext(context) {\n    context = context == null ? root : _.defaults(root.Object(), context, _.pick(root, contextProps));\n\n    /** Built-in constructor references. */\n    var Array = context.Array,\n        Date = context.Date,\n        Error = context.Error,\n        Function = context.Function,\n        Math = context.Math,\n        Object = context.Object,\n        RegExp = context.RegExp,\n        String = context.String,\n        TypeError = context.TypeError;\n\n    /** Used for built-in method references. */\n    var arrayProto = Array.prototype,\n        funcProto = Function.prototype,\n        objectProto = Object.prototype;\n\n    /** Used to detect overreaching core-js shims. */\n    var coreJsData = context['__core-js_shared__'];\n\n    /** Used to resolve the decompiled source of functions. */\n    var funcToString = funcProto.toString;\n\n    /** Used to check objects for own properties. */\n    var hasOwnProperty = objectProto.hasOwnProperty;\n\n    /** Used to generate unique IDs. */\n    var idCounter = 0;\n\n    /** Used to detect methods masquerading as native. */\n    var maskSrcKey = (function() {\n      var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n      return uid ? ('Symbol(src)_1.' + uid) : '';\n    }());\n\n    /**\n     * Used to resolve the\n     * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n     * of values.\n     */\n    var nativeObjectToString = objectProto.toString;\n\n    /** Used to infer the `Object` constructor. */\n    var objectCtorString = funcToString.call(Object);\n\n    /** Used to restore the original `_` reference in `_.noConflict`. */\n    var oldDash = root._;\n\n    /** Used to detect if a method is native. */\n    var reIsNative = RegExp('^' +\n      funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n      .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n    );\n\n    /** Built-in value references. */\n    var Buffer = moduleExports ? context.Buffer : undefined,\n        Symbol = context.Symbol,\n        Uint8Array = context.Uint8Array,\n        allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined,\n        getPrototype = overArg(Object.getPrototypeOf, Object),\n        objectCreate = Object.create,\n        propertyIsEnumerable = objectProto.propertyIsEnumerable,\n        splice = arrayProto.splice,\n        spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined,\n        symIterator = Symbol ? Symbol.iterator : undefined,\n        symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n    var defineProperty = (function() {\n      try {\n        var func = getNative(Object, 'defineProperty');\n        func({}, '', {});\n        return func;\n      } catch (e) {}\n    }());\n\n    /** Mocked built-ins. */\n    var ctxClearTimeout = context.clearTimeout !== root.clearTimeout && context.clearTimeout,\n        ctxNow = Date && Date.now !== root.Date.now && Date.now,\n        ctxSetTimeout = context.setTimeout !== root.setTimeout && context.setTimeout;\n\n    /* Built-in method references for those with the same name as other `lodash` methods. */\n    var nativeCeil = Math.ceil,\n        nativeFloor = Math.floor,\n        nativeGetSymbols = Object.getOwnPropertySymbols,\n        nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n        nativeIsFinite = context.isFinite,\n        nativeJoin = arrayProto.join,\n        nativeKeys = overArg(Object.keys, Object),\n        nativeMax = Math.max,\n        nativeMin = Math.min,\n        nativeNow = Date.now,\n        nativeParseInt = context.parseInt,\n        nativeRandom = Math.random,\n        nativeReverse = arrayProto.reverse;\n\n    /* Built-in method references that are verified to be native. */\n    var DataView = getNative(context, 'DataView'),\n        Map = getNative(context, 'Map'),\n        Promise = getNative(context, 'Promise'),\n        Set = getNative(context, 'Set'),\n        WeakMap = getNative(context, 'WeakMap'),\n        nativeCreate = getNative(Object, 'create');\n\n    /** Used to store function metadata. */\n    var metaMap = WeakMap && new WeakMap;\n\n    /** Used to lookup unminified function names. */\n    var realNames = {};\n\n    /** Used to detect maps, sets, and weakmaps. */\n    var dataViewCtorString = toSource(DataView),\n        mapCtorString = toSource(Map),\n        promiseCtorString = toSource(Promise),\n        setCtorString = toSource(Set),\n        weakMapCtorString = toSource(WeakMap);\n\n    /** Used to convert symbols to primitives and strings. */\n    var symbolProto = Symbol ? Symbol.prototype : undefined,\n        symbolValueOf = symbolProto ? symbolProto.valueOf : undefined,\n        symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` object which wraps `value` to enable implicit method\n     * chain sequences. Methods that operate on and return arrays, collections,\n     * and functions can be chained together. Methods that retrieve a single value\n     * or may return a primitive value will automatically end the chain sequence\n     * and return the unwrapped value. Otherwise, the value must be unwrapped\n     * with `_#value`.\n     *\n     * Explicit chain sequences, which must be unwrapped with `_#value`, may be\n     * enabled using `_.chain`.\n     *\n     * The execution of chained methods is lazy, that is, it's deferred until\n     * `_#value` is implicitly or explicitly called.\n     *\n     * Lazy evaluation allows several methods to support shortcut fusion.\n     * Shortcut fusion is an optimization to merge iteratee calls; this avoids\n     * the creation of intermediate arrays and can greatly reduce the number of\n     * iteratee executions. Sections of a chain sequence qualify for shortcut\n     * fusion if the section is applied to an array and iteratees accept only\n     * one argument. The heuristic for whether a section qualifies for shortcut\n     * fusion is subject to change.\n     *\n     * Chaining is supported in custom builds as long as the `_#value` method is\n     * directly or indirectly included in the build.\n     *\n     * In addition to lodash methods, wrappers have `Array` and `String` methods.\n     *\n     * The wrapper `Array` methods are:\n     * `concat`, `join`, `pop`, `push`, `shift`, `sort`, `splice`, and `unshift`\n     *\n     * The wrapper `String` methods are:\n     * `replace` and `split`\n     *\n     * The wrapper methods that support shortcut fusion are:\n     * `at`, `compact`, `drop`, `dropRight`, `dropWhile`, `filter`, `find`,\n     * `findLast`, `head`, `initial`, `last`, `map`, `reject`, `reverse`, `slice`,\n     * `tail`, `take`, `takeRight`, `takeRightWhile`, `takeWhile`, and `toArray`\n     *\n     * The chainable wrapper methods are:\n     * `after`, `ary`, `assign`, `assignIn`, `assignInWith`, `assignWith`, `at`,\n     * `before`, `bind`, `bindAll`, `bindKey`, `castArray`, `chain`, `chunk`,\n     * `commit`, `compact`, `concat`, `conforms`, `constant`, `countBy`, `create`,\n     * `curry`, `debounce`, `defaults`, `defaultsDeep`, `defer`, `delay`,\n     * `difference`, `differenceBy`, `differenceWith`, `drop`, `dropRight`,\n     * `dropRightWhile`, `dropWhile`, `extend`, `extendWith`, `fill`, `filter`,\n     * `flatMap`, `flatMapDeep`, `flatMapDepth`, `flatten`, `flattenDeep`,\n     * `flattenDepth`, `flip`, `flow`, `flowRight`, `fromPairs`, `functions`,\n     * `functionsIn`, `groupBy`, `initial`, `intersection`, `intersectionBy`,\n     * `intersectionWith`, `invert`, `invertBy`, `invokeMap`, `iteratee`, `keyBy`,\n     * `keys`, `keysIn`, `map`, `mapKeys`, `mapValues`, `matches`, `matchesProperty`,\n     * `memoize`, `merge`, `mergeWith`, `method`, `methodOf`, `mixin`, `negate`,\n     * `nthArg`, `omit`, `omitBy`, `once`, `orderBy`, `over`, `overArgs`,\n     * `overEvery`, `overSome`, `partial`, `partialRight`, `partition`, `pick`,\n     * `pickBy`, `plant`, `property`, `propertyOf`, `pull`, `pullAll`, `pullAllBy`,\n     * `pullAllWith`, `pullAt`, `push`, `range`, `rangeRight`, `rearg`, `reject`,\n     * `remove`, `rest`, `reverse`, `sampleSize`, `set`, `setWith`, `shuffle`,\n     * `slice`, `sort`, `sortBy`, `splice`, `spread`, `tail`, `take`, `takeRight`,\n     * `takeRightWhile`, `takeWhile`, `tap`, `throttle`, `thru`, `toArray`,\n     * `toPairs`, `toPairsIn`, `toPath`, `toPlainObject`, `transform`, `unary`,\n     * `union`, `unionBy`, `unionWith`, `uniq`, `uniqBy`, `uniqWith`, `unset`,\n     * `unshift`, `unzip`, `unzipWith`, `update`, `updateWith`, `values`,\n     * `valuesIn`, `without`, `wrap`, `xor`, `xorBy`, `xorWith`, `zip`,\n     * `zipObject`, `zipObjectDeep`, and `zipWith`\n     *\n     * The wrapper methods that are **not** chainable by default are:\n     * `add`, `attempt`, `camelCase`, `capitalize`, `ceil`, `clamp`, `clone`,\n     * `cloneDeep`, `cloneDeepWith`, `cloneWith`, `conformsTo`, `deburr`,\n     * `defaultTo`, `divide`, `each`, `eachRight`, `endsWith`, `eq`, `escape`,\n     * `escapeRegExp`, `every`, `find`, `findIndex`, `findKey`, `findLast`,\n     * `findLastIndex`, `findLastKey`, `first`, `floor`, `forEach`, `forEachRight`,\n     * `forIn`, `forInRight`, `forOwn`, `forOwnRight`, `get`, `gt`, `gte`, `has`,\n     * `hasIn`, `head`, `identity`, `includes`, `indexOf`, `inRange`, `invoke`,\n     * `isArguments`, `isArray`, `isArrayBuffer`, `isArrayLike`, `isArrayLikeObject`,\n     * `isBoolean`, `isBuffer`, `isDate`, `isElement`, `isEmpty`, `isEqual`,\n     * `isEqualWith`, `isError`, `isFinite`, `isFunction`, `isInteger`, `isLength`,\n     * `isMap`, `isMatch`, `isMatchWith`, `isNaN`, `isNative`, `isNil`, `isNull`,\n     * `isNumber`, `isObject`, `isObjectLike`, `isPlainObject`, `isRegExp`,\n     * `isSafeInteger`, `isSet`, `isString`, `isUndefined`, `isTypedArray`,\n     * `isWeakMap`, `isWeakSet`, `join`, `kebabCase`, `last`, `lastIndexOf`,\n     * `lowerCase`, `lowerFirst`, `lt`, `lte`, `max`, `maxBy`, `mean`, `meanBy`,\n     * `min`, `minBy`, `multiply`, `noConflict`, `noop`, `now`, `nth`, `pad`,\n     * `padEnd`, `padStart`, `parseInt`, `pop`, `random`, `reduce`, `reduceRight`,\n     * `repeat`, `result`, `round`, `runInContext`, `sample`, `shift`, `size`,\n     * `snakeCase`, `some`, `sortedIndex`, `sortedIndexBy`, `sortedLastIndex`,\n     * `sortedLastIndexBy`, `startCase`, `startsWith`, `stubArray`, `stubFalse`,\n     * `stubObject`, `stubString`, `stubTrue`, `subtract`, `sum`, `sumBy`,\n     * `template`, `times`, `toFinite`, `toInteger`, `toJSON`, `toLength`,\n     * `toLower`, `toNumber`, `toSafeInteger`, `toString`, `toUpper`, `trim`,\n     * `trimEnd`, `trimStart`, `truncate`, `unescape`, `uniqueId`, `upperCase`,\n     * `upperFirst`, `value`, and `words`\n     *\n     * @name _\n     * @constructor\n     * @category Seq\n     * @param {*} value The value to wrap in a `lodash` instance.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2, 3]);\n     *\n     * // Returns an unwrapped value.\n     * wrapped.reduce(_.add);\n     * // => 6\n     *\n     * // Returns a wrapped value.\n     * var squares = wrapped.map(square);\n     *\n     * _.isArray(squares);\n     * // => false\n     *\n     * _.isArray(squares.value());\n     * // => true\n     */\n    function lodash(value) {\n      if (isObjectLike(value) && !isArray(value) && !(value instanceof LazyWrapper)) {\n        if (value instanceof LodashWrapper) {\n          return value;\n        }\n        if (hasOwnProperty.call(value, '__wrapped__')) {\n          return wrapperClone(value);\n        }\n      }\n      return new LodashWrapper(value);\n    }\n\n    /**\n     * The base implementation of `_.create` without support for assigning\n     * properties to the created object.\n     *\n     * @private\n     * @param {Object} proto The object to inherit from.\n     * @returns {Object} Returns the new object.\n     */\n    var baseCreate = (function() {\n      function object() {}\n      return function(proto) {\n        if (!isObject(proto)) {\n          return {};\n        }\n        if (objectCreate) {\n          return objectCreate(proto);\n        }\n        object.prototype = proto;\n        var result = new object;\n        object.prototype = undefined;\n        return result;\n      };\n    }());\n\n    /**\n     * The function whose prototype chain sequence wrappers inherit from.\n     *\n     * @private\n     */\n    function baseLodash() {\n      // No operation performed.\n    }\n\n    /**\n     * The base constructor for creating `lodash` wrapper objects.\n     *\n     * @private\n     * @param {*} value The value to wrap.\n     * @param {boolean} [chainAll] Enable explicit method chain sequences.\n     */\n    function LodashWrapper(value, chainAll) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__chain__ = !!chainAll;\n      this.__index__ = 0;\n      this.__values__ = undefined;\n    }\n\n    /**\n     * By default, the template delimiters used by lodash are like those in\n     * embedded Ruby (ERB) as well as ES2015 template strings. Change the\n     * following template settings to use alternative delimiters.\n     *\n     * @static\n     * @memberOf _\n     * @type {Object}\n     */\n    lodash.templateSettings = {\n\n      /**\n       * Used to detect `data` property values to be HTML-escaped.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'escape': reEscape,\n\n      /**\n       * Used to detect code to be evaluated.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'evaluate': reEvaluate,\n\n      /**\n       * Used to detect `data` property values to inject.\n       *\n       * @memberOf _.templateSettings\n       * @type {RegExp}\n       */\n      'interpolate': reInterpolate,\n\n      /**\n       * Used to reference the data object in the template text.\n       *\n       * @memberOf _.templateSettings\n       * @type {string}\n       */\n      'variable': '',\n\n      /**\n       * Used to import variables into the compiled template.\n       *\n       * @memberOf _.templateSettings\n       * @type {Object}\n       */\n      'imports': {\n\n        /**\n         * A reference to the `lodash` function.\n         *\n         * @memberOf _.templateSettings.imports\n         * @type {Function}\n         */\n        '_': lodash\n      }\n    };\n\n    // Ensure wrappers are instances of `baseLodash`.\n    lodash.prototype = baseLodash.prototype;\n    lodash.prototype.constructor = lodash;\n\n    LodashWrapper.prototype = baseCreate(baseLodash.prototype);\n    LodashWrapper.prototype.constructor = LodashWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a lazy wrapper object which wraps `value` to enable lazy evaluation.\n     *\n     * @private\n     * @constructor\n     * @param {*} value The value to wrap.\n     */\n    function LazyWrapper(value) {\n      this.__wrapped__ = value;\n      this.__actions__ = [];\n      this.__dir__ = 1;\n      this.__filtered__ = false;\n      this.__iteratees__ = [];\n      this.__takeCount__ = MAX_ARRAY_LENGTH;\n      this.__views__ = [];\n    }\n\n    /**\n     * Creates a clone of the lazy wrapper object.\n     *\n     * @private\n     * @name clone\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the cloned `LazyWrapper` object.\n     */\n    function lazyClone() {\n      var result = new LazyWrapper(this.__wrapped__);\n      result.__actions__ = copyArray(this.__actions__);\n      result.__dir__ = this.__dir__;\n      result.__filtered__ = this.__filtered__;\n      result.__iteratees__ = copyArray(this.__iteratees__);\n      result.__takeCount__ = this.__takeCount__;\n      result.__views__ = copyArray(this.__views__);\n      return result;\n    }\n\n    /**\n     * Reverses the direction of lazy iteration.\n     *\n     * @private\n     * @name reverse\n     * @memberOf LazyWrapper\n     * @returns {Object} Returns the new reversed `LazyWrapper` object.\n     */\n    function lazyReverse() {\n      if (this.__filtered__) {\n        var result = new LazyWrapper(this);\n        result.__dir__ = -1;\n        result.__filtered__ = true;\n      } else {\n        result = this.clone();\n        result.__dir__ *= -1;\n      }\n      return result;\n    }\n\n    /**\n     * Extracts the unwrapped value from its lazy wrapper.\n     *\n     * @private\n     * @name value\n     * @memberOf LazyWrapper\n     * @returns {*} Returns the unwrapped value.\n     */\n    function lazyValue() {\n      var array = this.__wrapped__.value(),\n          dir = this.__dir__,\n          isArr = isArray(array),\n          isRight = dir < 0,\n          arrLength = isArr ? array.length : 0,\n          view = getView(0, arrLength, this.__views__),\n          start = view.start,\n          end = view.end,\n          length = end - start,\n          index = isRight ? end : (start - 1),\n          iteratees = this.__iteratees__,\n          iterLength = iteratees.length,\n          resIndex = 0,\n          takeCount = nativeMin(length, this.__takeCount__);\n\n      if (!isArr || (!isRight && arrLength == length && takeCount == length)) {\n        return baseWrapperValue(array, this.__actions__);\n      }\n      var result = [];\n\n      outer:\n      while (length-- && resIndex < takeCount) {\n        index += dir;\n\n        var iterIndex = -1,\n            value = array[index];\n\n        while (++iterIndex < iterLength) {\n          var data = iteratees[iterIndex],\n              iteratee = data.iteratee,\n              type = data.type,\n              computed = iteratee(value);\n\n          if (type == LAZY_MAP_FLAG) {\n            value = computed;\n          } else if (!computed) {\n            if (type == LAZY_FILTER_FLAG) {\n              continue outer;\n            } else {\n              break outer;\n            }\n          }\n        }\n        result[resIndex++] = value;\n      }\n      return result;\n    }\n\n    // Ensure `LazyWrapper` is an instance of `baseLodash`.\n    LazyWrapper.prototype = baseCreate(baseLodash.prototype);\n    LazyWrapper.prototype.constructor = LazyWrapper;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a hash object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Hash(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the hash.\n     *\n     * @private\n     * @name clear\n     * @memberOf Hash\n     */\n    function hashClear() {\n      this.__data__ = nativeCreate ? nativeCreate(null) : {};\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the hash.\n     *\n     * @private\n     * @name delete\n     * @memberOf Hash\n     * @param {Object} hash The hash to modify.\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function hashDelete(key) {\n      var result = this.has(key) && delete this.__data__[key];\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the hash value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Hash\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function hashGet(key) {\n      var data = this.__data__;\n      if (nativeCreate) {\n        var result = data[key];\n        return result === HASH_UNDEFINED ? undefined : result;\n      }\n      return hasOwnProperty.call(data, key) ? data[key] : undefined;\n    }\n\n    /**\n     * Checks if a hash value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Hash\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function hashHas(key) {\n      var data = this.__data__;\n      return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n    }\n\n    /**\n     * Sets the hash `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Hash\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the hash instance.\n     */\n    function hashSet(key, value) {\n      var data = this.__data__;\n      this.size += this.has(key) ? 0 : 1;\n      data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n      return this;\n    }\n\n    // Add methods to `Hash`.\n    Hash.prototype.clear = hashClear;\n    Hash.prototype['delete'] = hashDelete;\n    Hash.prototype.get = hashGet;\n    Hash.prototype.has = hashHas;\n    Hash.prototype.set = hashSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an list cache object.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function ListCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the list cache.\n     *\n     * @private\n     * @name clear\n     * @memberOf ListCache\n     */\n    function listCacheClear() {\n      this.__data__ = [];\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the list cache.\n     *\n     * @private\n     * @name delete\n     * @memberOf ListCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function listCacheDelete(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        return false;\n      }\n      var lastIndex = data.length - 1;\n      if (index == lastIndex) {\n        data.pop();\n      } else {\n        splice.call(data, index, 1);\n      }\n      --this.size;\n      return true;\n    }\n\n    /**\n     * Gets the list cache value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf ListCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function listCacheGet(key) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      return index < 0 ? undefined : data[index][1];\n    }\n\n    /**\n     * Checks if a list cache value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf ListCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function listCacheHas(key) {\n      return assocIndexOf(this.__data__, key) > -1;\n    }\n\n    /**\n     * Sets the list cache `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf ListCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the list cache instance.\n     */\n    function listCacheSet(key, value) {\n      var data = this.__data__,\n          index = assocIndexOf(data, key);\n\n      if (index < 0) {\n        ++this.size;\n        data.push([key, value]);\n      } else {\n        data[index][1] = value;\n      }\n      return this;\n    }\n\n    // Add methods to `ListCache`.\n    ListCache.prototype.clear = listCacheClear;\n    ListCache.prototype['delete'] = listCacheDelete;\n    ListCache.prototype.get = listCacheGet;\n    ListCache.prototype.has = listCacheHas;\n    ListCache.prototype.set = listCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a map cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function MapCache(entries) {\n      var index = -1,\n          length = entries == null ? 0 : entries.length;\n\n      this.clear();\n      while (++index < length) {\n        var entry = entries[index];\n        this.set(entry[0], entry[1]);\n      }\n    }\n\n    /**\n     * Removes all key-value entries from the map.\n     *\n     * @private\n     * @name clear\n     * @memberOf MapCache\n     */\n    function mapCacheClear() {\n      this.size = 0;\n      this.__data__ = {\n        'hash': new Hash,\n        'map': new (Map || ListCache),\n        'string': new Hash\n      };\n    }\n\n    /**\n     * Removes `key` and its value from the map.\n     *\n     * @private\n     * @name delete\n     * @memberOf MapCache\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function mapCacheDelete(key) {\n      var result = getMapData(this, key)['delete'](key);\n      this.size -= result ? 1 : 0;\n      return result;\n    }\n\n    /**\n     * Gets the map value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf MapCache\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function mapCacheGet(key) {\n      return getMapData(this, key).get(key);\n    }\n\n    /**\n     * Checks if a map value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf MapCache\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function mapCacheHas(key) {\n      return getMapData(this, key).has(key);\n    }\n\n    /**\n     * Sets the map `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf MapCache\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the map cache instance.\n     */\n    function mapCacheSet(key, value) {\n      var data = getMapData(this, key),\n          size = data.size;\n\n      data.set(key, value);\n      this.size += data.size == size ? 0 : 1;\n      return this;\n    }\n\n    // Add methods to `MapCache`.\n    MapCache.prototype.clear = mapCacheClear;\n    MapCache.prototype['delete'] = mapCacheDelete;\n    MapCache.prototype.get = mapCacheGet;\n    MapCache.prototype.has = mapCacheHas;\n    MapCache.prototype.set = mapCacheSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     *\n     * Creates an array cache object to store unique values.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [values] The values to cache.\n     */\n    function SetCache(values) {\n      var index = -1,\n          length = values == null ? 0 : values.length;\n\n      this.__data__ = new MapCache;\n      while (++index < length) {\n        this.add(values[index]);\n      }\n    }\n\n    /**\n     * Adds `value` to the array cache.\n     *\n     * @private\n     * @name add\n     * @memberOf SetCache\n     * @alias push\n     * @param {*} value The value to cache.\n     * @returns {Object} Returns the cache instance.\n     */\n    function setCacheAdd(value) {\n      this.__data__.set(value, HASH_UNDEFINED);\n      return this;\n    }\n\n    /**\n     * Checks if `value` is in the array cache.\n     *\n     * @private\n     * @name has\n     * @memberOf SetCache\n     * @param {*} value The value to search for.\n     * @returns {number} Returns `true` if `value` is found, else `false`.\n     */\n    function setCacheHas(value) {\n      return this.__data__.has(value);\n    }\n\n    // Add methods to `SetCache`.\n    SetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\n    SetCache.prototype.has = setCacheHas;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a stack cache object to store key-value pairs.\n     *\n     * @private\n     * @constructor\n     * @param {Array} [entries] The key-value pairs to cache.\n     */\n    function Stack(entries) {\n      var data = this.__data__ = new ListCache(entries);\n      this.size = data.size;\n    }\n\n    /**\n     * Removes all key-value entries from the stack.\n     *\n     * @private\n     * @name clear\n     * @memberOf Stack\n     */\n    function stackClear() {\n      this.__data__ = new ListCache;\n      this.size = 0;\n    }\n\n    /**\n     * Removes `key` and its value from the stack.\n     *\n     * @private\n     * @name delete\n     * @memberOf Stack\n     * @param {string} key The key of the value to remove.\n     * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n     */\n    function stackDelete(key) {\n      var data = this.__data__,\n          result = data['delete'](key);\n\n      this.size = data.size;\n      return result;\n    }\n\n    /**\n     * Gets the stack value for `key`.\n     *\n     * @private\n     * @name get\n     * @memberOf Stack\n     * @param {string} key The key of the value to get.\n     * @returns {*} Returns the entry value.\n     */\n    function stackGet(key) {\n      return this.__data__.get(key);\n    }\n\n    /**\n     * Checks if a stack value for `key` exists.\n     *\n     * @private\n     * @name has\n     * @memberOf Stack\n     * @param {string} key The key of the entry to check.\n     * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n     */\n    function stackHas(key) {\n      return this.__data__.has(key);\n    }\n\n    /**\n     * Sets the stack `key` to `value`.\n     *\n     * @private\n     * @name set\n     * @memberOf Stack\n     * @param {string} key The key of the value to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns the stack cache instance.\n     */\n    function stackSet(key, value) {\n      var data = this.__data__;\n      if (data instanceof ListCache) {\n        var pairs = data.__data__;\n        if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n          pairs.push([key, value]);\n          this.size = ++data.size;\n          return this;\n        }\n        data = this.__data__ = new MapCache(pairs);\n      }\n      data.set(key, value);\n      this.size = data.size;\n      return this;\n    }\n\n    // Add methods to `Stack`.\n    Stack.prototype.clear = stackClear;\n    Stack.prototype['delete'] = stackDelete;\n    Stack.prototype.get = stackGet;\n    Stack.prototype.has = stackHas;\n    Stack.prototype.set = stackSet;\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of the enumerable property names of the array-like `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @param {boolean} inherited Specify returning inherited property names.\n     * @returns {Array} Returns the array of property names.\n     */\n    function arrayLikeKeys(value, inherited) {\n      var isArr = isArray(value),\n          isArg = !isArr && isArguments(value),\n          isBuff = !isArr && !isArg && isBuffer(value),\n          isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n          skipIndexes = isArr || isArg || isBuff || isType,\n          result = skipIndexes ? baseTimes(value.length, String) : [],\n          length = result.length;\n\n      for (var key in value) {\n        if ((inherited || hasOwnProperty.call(value, key)) &&\n            !(skipIndexes && (\n               // Safari 9 has enumerable `arguments.length` in strict mode.\n               key == 'length' ||\n               // Node.js 0.10 has enumerable non-index properties on buffers.\n               (isBuff && (key == 'offset' || key == 'parent')) ||\n               // PhantomJS 2 has enumerable non-index properties on typed arrays.\n               (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n               // Skip index properties.\n               isIndex(key, length)\n            ))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * A specialized version of `_.sample` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @returns {*} Returns the random element.\n     */\n    function arraySample(array) {\n      var length = array.length;\n      return length ? array[baseRandom(0, length - 1)] : undefined;\n    }\n\n    /**\n     * A specialized version of `_.sampleSize` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function arraySampleSize(array, n) {\n      return shuffleSelf(copyArray(array), baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * A specialized version of `_.shuffle` for arrays.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function arrayShuffle(array) {\n      return shuffleSelf(copyArray(array));\n    }\n\n    /**\n     * This function is like `assignValue` except that it doesn't assign\n     * `undefined` values.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function assignMergeValue(object, key, value) {\n      if ((value !== undefined && !eq(object[key], value)) ||\n          (value === undefined && !(key in object))) {\n        baseAssignValue(object, key, value);\n      }\n    }\n\n    /**\n     * Assigns `value` to `key` of `object` if the existing value is not equivalent\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function assignValue(object, key, value) {\n      var objValue = object[key];\n      if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n          (value === undefined && !(key in object))) {\n        baseAssignValue(object, key, value);\n      }\n    }\n\n    /**\n     * Gets the index at which the `key` is found in `array` of key-value pairs.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {*} key The key to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     */\n    function assocIndexOf(array, key) {\n      var length = array.length;\n      while (length--) {\n        if (eq(array[length][0], key)) {\n          return length;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * Aggregates elements of `collection` on `accumulator` with keys transformed\n     * by `iteratee` and values set by `setter`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform keys.\n     * @param {Object} accumulator The initial aggregated object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseAggregator(collection, setter, iteratee, accumulator) {\n      baseEach(collection, function(value, key, collection) {\n        setter(accumulator, value, iteratee(value), collection);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.assign` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssign(object, source) {\n      return object && copyObject(source, keys(source), object);\n    }\n\n    /**\n     * The base implementation of `_.assignIn` without support for multiple sources\n     * or `customizer` functions.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @returns {Object} Returns `object`.\n     */\n    function baseAssignIn(object, source) {\n      return object && copyObject(source, keysIn(source), object);\n    }\n\n    /**\n     * The base implementation of `assignValue` and `assignMergeValue` without\n     * value checks.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {string} key The key of the property to assign.\n     * @param {*} value The value to assign.\n     */\n    function baseAssignValue(object, key, value) {\n      if (key == '__proto__' && defineProperty) {\n        defineProperty(object, key, {\n          'configurable': true,\n          'enumerable': true,\n          'value': value,\n          'writable': true\n        });\n      } else {\n        object[key] = value;\n      }\n    }\n\n    /**\n     * The base implementation of `_.at` without support for individual paths.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Array} Returns the picked elements.\n     */\n    function baseAt(object, paths) {\n      var index = -1,\n          length = paths.length,\n          result = Array(length),\n          skip = object == null;\n\n      while (++index < length) {\n        result[index] = skip ? undefined : get(object, paths[index]);\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.clamp` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     */\n    function baseClamp(number, lower, upper) {\n      if (number === number) {\n        if (upper !== undefined) {\n          number = number <= upper ? number : upper;\n        }\n        if (lower !== undefined) {\n          number = number >= lower ? number : lower;\n        }\n      }\n      return number;\n    }\n\n    /**\n     * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n     * traversed objects.\n     *\n     * @private\n     * @param {*} value The value to clone.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Deep clone\n     *  2 - Flatten inherited properties\n     *  4 - Clone symbols\n     * @param {Function} [customizer] The function to customize cloning.\n     * @param {string} [key] The key of `value`.\n     * @param {Object} [object] The parent object of `value`.\n     * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n     * @returns {*} Returns the cloned value.\n     */\n    function baseClone(value, bitmask, customizer, key, object, stack) {\n      var result,\n          isDeep = bitmask & CLONE_DEEP_FLAG,\n          isFlat = bitmask & CLONE_FLAT_FLAG,\n          isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n      if (customizer) {\n        result = object ? customizer(value, key, object, stack) : customizer(value);\n      }\n      if (result !== undefined) {\n        return result;\n      }\n      if (!isObject(value)) {\n        return value;\n      }\n      var isArr = isArray(value);\n      if (isArr) {\n        result = initCloneArray(value);\n        if (!isDeep) {\n          return copyArray(value, result);\n        }\n      } else {\n        var tag = getTag(value),\n            isFunc = tag == funcTag || tag == genTag;\n\n        if (isBuffer(value)) {\n          return cloneBuffer(value, isDeep);\n        }\n        if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n          result = (isFlat || isFunc) ? {} : initCloneObject(value);\n          if (!isDeep) {\n            return isFlat\n              ? copySymbolsIn(value, baseAssignIn(result, value))\n              : copySymbols(value, baseAssign(result, value));\n          }\n        } else {\n          if (!cloneableTags[tag]) {\n            return object ? value : {};\n          }\n          result = initCloneByTag(value, tag, isDeep);\n        }\n      }\n      // Check for circular references and return its corresponding clone.\n      stack || (stack = new Stack);\n      var stacked = stack.get(value);\n      if (stacked) {\n        return stacked;\n      }\n      stack.set(value, result);\n\n      if (isSet(value)) {\n        value.forEach(function(subValue) {\n          result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n        });\n      } else if (isMap(value)) {\n        value.forEach(function(subValue, key) {\n          result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n        });\n      }\n\n      var keysFunc = isFull\n        ? (isFlat ? getAllKeysIn : getAllKeys)\n        : (isFlat ? keysIn : keys);\n\n      var props = isArr ? undefined : keysFunc(value);\n      arrayEach(props || value, function(subValue, key) {\n        if (props) {\n          key = subValue;\n          subValue = value[key];\n        }\n        // Recursively populate clone (susceptible to call stack limits).\n        assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.conforms` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseConforms(source) {\n      var props = keys(source);\n      return function(object) {\n        return baseConformsTo(object, source, props);\n      };\n    }\n\n    /**\n     * The base implementation of `_.conformsTo` which accepts `props` to check.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     */\n    function baseConformsTo(object, source, props) {\n      var length = props.length;\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (length--) {\n        var key = props[length],\n            predicate = source[key],\n            value = object[key];\n\n        if ((value === undefined && !(key in object)) || !predicate(value)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.delay` and `_.defer` which accepts `args`\n     * to provide to `func`.\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {Array} args The arguments to provide to `func`.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    function baseDelay(func, wait, args) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return setTimeout(function() { func.apply(undefined, args); }, wait);\n    }\n\n    /**\n     * The base implementation of methods like `_.difference` without support\n     * for excluding multiple arrays or iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Array} values The values to exclude.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     */\n    function baseDifference(array, values, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          isCommon = true,\n          length = array.length,\n          result = [],\n          valuesLength = values.length;\n\n      if (!length) {\n        return result;\n      }\n      if (iteratee) {\n        values = arrayMap(values, baseUnary(iteratee));\n      }\n      if (comparator) {\n        includes = arrayIncludesWith;\n        isCommon = false;\n      }\n      else if (values.length >= LARGE_ARRAY_SIZE) {\n        includes = cacheHas;\n        isCommon = false;\n        values = new SetCache(values);\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee == null ? value : iteratee(value);\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var valuesIndex = valuesLength;\n          while (valuesIndex--) {\n            if (values[valuesIndex] === computed) {\n              continue outer;\n            }\n          }\n          result.push(value);\n        }\n        else if (!includes(values, computed, comparator)) {\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.forEach` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEach = createBaseEach(baseForOwn);\n\n    /**\n     * The base implementation of `_.forEachRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     */\n    var baseEachRight = createBaseEach(baseForOwnRight, true);\n\n    /**\n     * The base implementation of `_.every` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`\n     */\n    function baseEvery(collection, predicate) {\n      var result = true;\n      baseEach(collection, function(value, index, collection) {\n        result = !!predicate(value, index, collection);\n        return result;\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of methods like `_.max` and `_.min` which accepts a\n     * `comparator` to determine the extremum value.\n     *\n     * @private\n     * @param {Array} array The array to iterate over.\n     * @param {Function} iteratee The iteratee invoked per iteration.\n     * @param {Function} comparator The comparator used to compare values.\n     * @returns {*} Returns the extremum value.\n     */\n    function baseExtremum(array, iteratee, comparator) {\n      var index = -1,\n          length = array.length;\n\n      while (++index < length) {\n        var value = array[index],\n            current = iteratee(value);\n\n        if (current != null && (computed === undefined\n              ? (current === current && !isSymbol(current))\n              : comparator(current, computed)\n            )) {\n          var computed = current,\n              result = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.fill` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     */\n    function baseFill(array, value, start, end) {\n      var length = array.length;\n\n      start = toInteger(start);\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = (end === undefined || end > length) ? length : toInteger(end);\n      if (end < 0) {\n        end += length;\n      }\n      end = start > end ? 0 : toLength(end);\n      while (start < end) {\n        array[start++] = value;\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.filter` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     */\n    function baseFilter(collection, predicate) {\n      var result = [];\n      baseEach(collection, function(value, index, collection) {\n        if (predicate(value, index, collection)) {\n          result.push(value);\n        }\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.flatten` with support for restricting flattening.\n     *\n     * @private\n     * @param {Array} array The array to flatten.\n     * @param {number} depth The maximum recursion depth.\n     * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n     * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n     * @param {Array} [result=[]] The initial result value.\n     * @returns {Array} Returns the new flattened array.\n     */\n    function baseFlatten(array, depth, predicate, isStrict, result) {\n      var index = -1,\n          length = array.length;\n\n      predicate || (predicate = isFlattenable);\n      result || (result = []);\n\n      while (++index < length) {\n        var value = array[index];\n        if (depth > 0 && predicate(value)) {\n          if (depth > 1) {\n            // Recursively flatten arrays (susceptible to call stack limits).\n            baseFlatten(value, depth - 1, predicate, isStrict, result);\n          } else {\n            arrayPush(result, value);\n          }\n        } else if (!isStrict) {\n          result[result.length] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `baseForOwn` which iterates over `object`\n     * properties returned by `keysFunc` and invokes `iteratee` for each property.\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseFor = createBaseFor();\n\n    /**\n     * This function is like `baseFor` except that it iterates over properties\n     * in the opposite order.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @returns {Object} Returns `object`.\n     */\n    var baseForRight = createBaseFor(true);\n\n    /**\n     * The base implementation of `_.forOwn` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwn(object, iteratee) {\n      return object && baseFor(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.forOwnRight` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     */\n    function baseForOwnRight(object, iteratee) {\n      return object && baseForRight(object, iteratee, keys);\n    }\n\n    /**\n     * The base implementation of `_.functions` which creates an array of\n     * `object` function property names filtered from `props`.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Array} props The property names to filter.\n     * @returns {Array} Returns the function names.\n     */\n    function baseFunctions(object, props) {\n      return arrayFilter(props, function(key) {\n        return isFunction(object[key]);\n      });\n    }\n\n    /**\n     * The base implementation of `_.get` without support for default values.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseGet(object, path) {\n      path = castPath(path, object);\n\n      var index = 0,\n          length = path.length;\n\n      while (object != null && index < length) {\n        object = object[toKey(path[index++])];\n      }\n      return (index && index == length) ? object : undefined;\n    }\n\n    /**\n     * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n     * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Function} keysFunc The function to get the keys of `object`.\n     * @param {Function} symbolsFunc The function to get the symbols of `object`.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function baseGetAllKeys(object, keysFunc, symbolsFunc) {\n      var result = keysFunc(object);\n      return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n    }\n\n    /**\n     * The base implementation of `getTag` without fallbacks for buggy environments.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    function baseGetTag(value) {\n      if (value == null) {\n        return value === undefined ? undefinedTag : nullTag;\n      }\n      return (symToStringTag && symToStringTag in Object(value))\n        ? getRawTag(value)\n        : objectToString(value);\n    }\n\n    /**\n     * The base implementation of `_.gt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     */\n    function baseGt(value, other) {\n      return value > other;\n    }\n\n    /**\n     * The base implementation of `_.has` without support for deep paths.\n     *\n     * @private\n     * @param {Object} [object] The object to query.\n     * @param {Array|string} key The key to check.\n     * @returns {boolean} Returns `true` if `key` exists, else `false`.\n     */\n    function baseHas(object, key) {\n      return object != null && hasOwnProperty.call(object, key);\n    }\n\n    /**\n     * The base implementation of `_.hasIn` without support for deep paths.\n     *\n     * @private\n     * @param {Object} [object] The object to query.\n     * @param {Array|string} key The key to check.\n     * @returns {boolean} Returns `true` if `key` exists, else `false`.\n     */\n    function baseHasIn(object, key) {\n      return object != null && key in Object(object);\n    }\n\n    /**\n     * The base implementation of `_.inRange` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {number} number The number to check.\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     */\n    function baseInRange(number, start, end) {\n      return number >= nativeMin(start, end) && number < nativeMax(start, end);\n    }\n\n    /**\n     * The base implementation of methods like `_.intersection`, without support\n     * for iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of shared values.\n     */\n    function baseIntersection(arrays, iteratee, comparator) {\n      var includes = comparator ? arrayIncludesWith : arrayIncludes,\n          length = arrays[0].length,\n          othLength = arrays.length,\n          othIndex = othLength,\n          caches = Array(othLength),\n          maxLength = Infinity,\n          result = [];\n\n      while (othIndex--) {\n        var array = arrays[othIndex];\n        if (othIndex && iteratee) {\n          array = arrayMap(array, baseUnary(iteratee));\n        }\n        maxLength = nativeMin(array.length, maxLength);\n        caches[othIndex] = !comparator && (iteratee || (length >= 120 && array.length >= 120))\n          ? new SetCache(othIndex && array)\n          : undefined;\n      }\n      array = arrays[0];\n\n      var index = -1,\n          seen = caches[0];\n\n      outer:\n      while (++index < length && result.length < maxLength) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (!(seen\n              ? cacheHas(seen, computed)\n              : includes(result, computed, comparator)\n            )) {\n          othIndex = othLength;\n          while (--othIndex) {\n            var cache = caches[othIndex];\n            if (!(cache\n                  ? cacheHas(cache, computed)\n                  : includes(arrays[othIndex], computed, comparator))\n                ) {\n              continue outer;\n            }\n          }\n          if (seen) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.invert` and `_.invertBy` which inverts\n     * `object` with values transformed by `iteratee` and set by `setter`.\n     *\n     * @private\n     * @param {Object} object The object to iterate over.\n     * @param {Function} setter The function to set `accumulator` values.\n     * @param {Function} iteratee The iteratee to transform values.\n     * @param {Object} accumulator The initial inverted object.\n     * @returns {Function} Returns `accumulator`.\n     */\n    function baseInverter(object, setter, iteratee, accumulator) {\n      baseForOwn(object, function(value, key, object) {\n        setter(accumulator, iteratee(value), key, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * The base implementation of `_.invoke` without support for individual\n     * method arguments.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {Array} args The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     */\n    function baseInvoke(object, path, args) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      var func = object == null ? object : object[toKey(last(path))];\n      return func == null ? undefined : apply(func, object, args);\n    }\n\n    /**\n     * The base implementation of `_.isArguments`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     */\n    function baseIsArguments(value) {\n      return isObjectLike(value) && baseGetTag(value) == argsTag;\n    }\n\n    /**\n     * The base implementation of `_.isArrayBuffer` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     */\n    function baseIsArrayBuffer(value) {\n      return isObjectLike(value) && baseGetTag(value) == arrayBufferTag;\n    }\n\n    /**\n     * The base implementation of `_.isDate` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     */\n    function baseIsDate(value) {\n      return isObjectLike(value) && baseGetTag(value) == dateTag;\n    }\n\n    /**\n     * The base implementation of `_.isEqual` which supports partial comparisons\n     * and tracks traversed objects.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {boolean} bitmask The bitmask flags.\n     *  1 - Unordered comparison\n     *  2 - Partial comparison\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     */\n    function baseIsEqual(value, other, bitmask, customizer, stack) {\n      if (value === other) {\n        return true;\n      }\n      if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n        return value !== value && other !== other;\n      }\n      return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n    }\n\n    /**\n     * A specialized version of `baseIsEqual` for arrays and objects which performs\n     * deep comparisons and tracks traversed objects enabling objects with circular\n     * references to be compared.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n      var objIsArr = isArray(object),\n          othIsArr = isArray(other),\n          objTag = objIsArr ? arrayTag : getTag(object),\n          othTag = othIsArr ? arrayTag : getTag(other);\n\n      objTag = objTag == argsTag ? objectTag : objTag;\n      othTag = othTag == argsTag ? objectTag : othTag;\n\n      var objIsObj = objTag == objectTag,\n          othIsObj = othTag == objectTag,\n          isSameTag = objTag == othTag;\n\n      if (isSameTag && isBuffer(object)) {\n        if (!isBuffer(other)) {\n          return false;\n        }\n        objIsArr = true;\n        objIsObj = false;\n      }\n      if (isSameTag && !objIsObj) {\n        stack || (stack = new Stack);\n        return (objIsArr || isTypedArray(object))\n          ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n          : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n      }\n      if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n        var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n            othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n        if (objIsWrapped || othIsWrapped) {\n          var objUnwrapped = objIsWrapped ? object.value() : object,\n              othUnwrapped = othIsWrapped ? other.value() : other;\n\n          stack || (stack = new Stack);\n          return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n        }\n      }\n      if (!isSameTag) {\n        return false;\n      }\n      stack || (stack = new Stack);\n      return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n    }\n\n    /**\n     * The base implementation of `_.isMap` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     */\n    function baseIsMap(value) {\n      return isObjectLike(value) && getTag(value) == mapTag;\n    }\n\n    /**\n     * The base implementation of `_.isMatch` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Array} matchData The property names, values, and compare flags to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     */\n    function baseIsMatch(object, source, matchData, customizer) {\n      var index = matchData.length,\n          length = index,\n          noCustomizer = !customizer;\n\n      if (object == null) {\n        return !length;\n      }\n      object = Object(object);\n      while (index--) {\n        var data = matchData[index];\n        if ((noCustomizer && data[2])\n              ? data[1] !== object[data[0]]\n              : !(data[0] in object)\n            ) {\n          return false;\n        }\n      }\n      while (++index < length) {\n        data = matchData[index];\n        var key = data[0],\n            objValue = object[key],\n            srcValue = data[1];\n\n        if (noCustomizer && data[2]) {\n          if (objValue === undefined && !(key in object)) {\n            return false;\n          }\n        } else {\n          var stack = new Stack;\n          if (customizer) {\n            var result = customizer(objValue, srcValue, key, object, source, stack);\n          }\n          if (!(result === undefined\n                ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n                : result\n              )) {\n            return false;\n          }\n        }\n      }\n      return true;\n    }\n\n    /**\n     * The base implementation of `_.isNative` without bad shim checks.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     */\n    function baseIsNative(value) {\n      if (!isObject(value) || isMasked(value)) {\n        return false;\n      }\n      var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n      return pattern.test(toSource(value));\n    }\n\n    /**\n     * The base implementation of `_.isRegExp` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     */\n    function baseIsRegExp(value) {\n      return isObjectLike(value) && baseGetTag(value) == regexpTag;\n    }\n\n    /**\n     * The base implementation of `_.isSet` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     */\n    function baseIsSet(value) {\n      return isObjectLike(value) && getTag(value) == setTag;\n    }\n\n    /**\n     * The base implementation of `_.isTypedArray` without Node.js optimizations.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     */\n    function baseIsTypedArray(value) {\n      return isObjectLike(value) &&\n        isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n    }\n\n    /**\n     * The base implementation of `_.iteratee`.\n     *\n     * @private\n     * @param {*} [value=_.identity] The value to convert to an iteratee.\n     * @returns {Function} Returns the iteratee.\n     */\n    function baseIteratee(value) {\n      // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n      // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n      if (typeof value == 'function') {\n        return value;\n      }\n      if (value == null) {\n        return identity;\n      }\n      if (typeof value == 'object') {\n        return isArray(value)\n          ? baseMatchesProperty(value[0], value[1])\n          : baseMatches(value);\n      }\n      return property(value);\n    }\n\n    /**\n     * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeys(object) {\n      if (!isPrototype(object)) {\n        return nativeKeys(object);\n      }\n      var result = [];\n      for (var key in Object(object)) {\n        if (hasOwnProperty.call(object, key) && key != 'constructor') {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function baseKeysIn(object) {\n      if (!isObject(object)) {\n        return nativeKeysIn(object);\n      }\n      var isProto = isPrototype(object),\n          result = [];\n\n      for (var key in object) {\n        if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.lt` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     */\n    function baseLt(value, other) {\n      return value < other;\n    }\n\n    /**\n     * The base implementation of `_.map` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} iteratee The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     */\n    function baseMap(collection, iteratee) {\n      var index = -1,\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value, key, collection) {\n        result[++index] = iteratee(value, key, collection);\n      });\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.matches` which doesn't clone `source`.\n     *\n     * @private\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatches(source) {\n      var matchData = getMatchData(source);\n      if (matchData.length == 1 && matchData[0][2]) {\n        return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n      }\n      return function(object) {\n        return object === source || baseIsMatch(object, source, matchData);\n      };\n    }\n\n    /**\n     * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n     *\n     * @private\n     * @param {string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function baseMatchesProperty(path, srcValue) {\n      if (isKey(path) && isStrictComparable(srcValue)) {\n        return matchesStrictComparable(toKey(path), srcValue);\n      }\n      return function(object) {\n        var objValue = get(object, path);\n        return (objValue === undefined && objValue === srcValue)\n          ? hasIn(object, path)\n          : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n      };\n    }\n\n    /**\n     * The base implementation of `_.merge` without support for multiple sources.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} [customizer] The function to customize merged values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMerge(object, source, srcIndex, customizer, stack) {\n      if (object === source) {\n        return;\n      }\n      baseFor(source, function(srcValue, key) {\n        stack || (stack = new Stack);\n        if (isObject(srcValue)) {\n          baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n        }\n        else {\n          var newValue = customizer\n            ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n            : undefined;\n\n          if (newValue === undefined) {\n            newValue = srcValue;\n          }\n          assignMergeValue(object, key, newValue);\n        }\n      }, keysIn);\n    }\n\n    /**\n     * A specialized version of `baseMerge` for arrays and objects which performs\n     * deep merges and tracks traversed objects enabling objects with circular\n     * references to be merged.\n     *\n     * @private\n     * @param {Object} object The destination object.\n     * @param {Object} source The source object.\n     * @param {string} key The key of the value to merge.\n     * @param {number} srcIndex The index of `source`.\n     * @param {Function} mergeFunc The function to merge values.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     */\n    function baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n      var objValue = safeGet(object, key),\n          srcValue = safeGet(source, key),\n          stacked = stack.get(srcValue);\n\n      if (stacked) {\n        assignMergeValue(object, key, stacked);\n        return;\n      }\n      var newValue = customizer\n        ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      var isCommon = newValue === undefined;\n\n      if (isCommon) {\n        var isArr = isArray(srcValue),\n            isBuff = !isArr && isBuffer(srcValue),\n            isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n        newValue = srcValue;\n        if (isArr || isBuff || isTyped) {\n          if (isArray(objValue)) {\n            newValue = objValue;\n          }\n          else if (isArrayLikeObject(objValue)) {\n            newValue = copyArray(objValue);\n          }\n          else if (isBuff) {\n            isCommon = false;\n            newValue = cloneBuffer(srcValue, true);\n          }\n          else if (isTyped) {\n            isCommon = false;\n            newValue = cloneTypedArray(srcValue, true);\n          }\n          else {\n            newValue = [];\n          }\n        }\n        else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n          newValue = objValue;\n          if (isArguments(objValue)) {\n            newValue = toPlainObject(objValue);\n          }\n          else if (!isObject(objValue) || isFunction(objValue)) {\n            newValue = initCloneObject(srcValue);\n          }\n        }\n        else {\n          isCommon = false;\n        }\n      }\n      if (isCommon) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, newValue);\n        mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n        stack['delete'](srcValue);\n      }\n      assignMergeValue(object, key, newValue);\n    }\n\n    /**\n     * The base implementation of `_.nth` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {number} n The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     */\n    function baseNth(array, n) {\n      var length = array.length;\n      if (!length) {\n        return;\n      }\n      n += n < 0 ? length : 0;\n      return isIndex(n, length) ? array[n] : undefined;\n    }\n\n    /**\n     * The base implementation of `_.orderBy` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n     * @param {string[]} orders The sort orders of `iteratees`.\n     * @returns {Array} Returns the new sorted array.\n     */\n    function baseOrderBy(collection, iteratees, orders) {\n      if (iteratees.length) {\n        iteratees = arrayMap(iteratees, function(iteratee) {\n          if (isArray(iteratee)) {\n            return function(value) {\n              return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n            }\n          }\n          return iteratee;\n        });\n      } else {\n        iteratees = [identity];\n      }\n\n      var index = -1;\n      iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n\n      var result = baseMap(collection, function(value, key, collection) {\n        var criteria = arrayMap(iteratees, function(iteratee) {\n          return iteratee(value);\n        });\n        return { 'criteria': criteria, 'index': ++index, 'value': value };\n      });\n\n      return baseSortBy(result, function(object, other) {\n        return compareMultiple(object, other, orders);\n      });\n    }\n\n    /**\n     * The base implementation of `_.pick` without support for individual\n     * property identifiers.\n     *\n     * @private\n     * @param {Object} object The source object.\n     * @param {string[]} paths The property paths to pick.\n     * @returns {Object} Returns the new object.\n     */\n    function basePick(object, paths) {\n      return basePickBy(object, paths, function(value, path) {\n        return hasIn(object, path);\n      });\n    }\n\n    /**\n     * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Object} object The source object.\n     * @param {string[]} paths The property paths to pick.\n     * @param {Function} predicate The function invoked per property.\n     * @returns {Object} Returns the new object.\n     */\n    function basePickBy(object, paths, predicate) {\n      var index = -1,\n          length = paths.length,\n          result = {};\n\n      while (++index < length) {\n        var path = paths[index],\n            value = baseGet(object, path);\n\n        if (predicate(value, path)) {\n          baseSet(result, castPath(path, object), value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseProperty` which supports deep paths.\n     *\n     * @private\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     */\n    function basePropertyDeep(path) {\n      return function(object) {\n        return baseGet(object, path);\n      };\n    }\n\n    /**\n     * The base implementation of `_.pullAllBy` without support for iteratee\n     * shorthands.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAll(array, values, iteratee, comparator) {\n      var indexOf = comparator ? baseIndexOfWith : baseIndexOf,\n          index = -1,\n          length = values.length,\n          seen = array;\n\n      if (array === values) {\n        values = copyArray(values);\n      }\n      if (iteratee) {\n        seen = arrayMap(array, baseUnary(iteratee));\n      }\n      while (++index < length) {\n        var fromIndex = 0,\n            value = values[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        while ((fromIndex = indexOf(seen, computed, fromIndex, comparator)) > -1) {\n          if (seen !== array) {\n            splice.call(seen, fromIndex, 1);\n          }\n          splice.call(array, fromIndex, 1);\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.pullAt` without support for individual\n     * indexes or capturing the removed elements.\n     *\n     * @private\n     * @param {Array} array The array to modify.\n     * @param {number[]} indexes The indexes of elements to remove.\n     * @returns {Array} Returns `array`.\n     */\n    function basePullAt(array, indexes) {\n      var length = array ? indexes.length : 0,\n          lastIndex = length - 1;\n\n      while (length--) {\n        var index = indexes[length];\n        if (length == lastIndex || index !== previous) {\n          var previous = index;\n          if (isIndex(index)) {\n            splice.call(array, index, 1);\n          } else {\n            baseUnset(array, index);\n          }\n        }\n      }\n      return array;\n    }\n\n    /**\n     * The base implementation of `_.random` without support for returning\n     * floating-point numbers.\n     *\n     * @private\n     * @param {number} lower The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the random number.\n     */\n    function baseRandom(lower, upper) {\n      return lower + nativeFloor(nativeRandom() * (upper - lower + 1));\n    }\n\n    /**\n     * The base implementation of `_.range` and `_.rangeRight` which doesn't\n     * coerce arguments.\n     *\n     * @private\n     * @param {number} start The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} step The value to increment or decrement by.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the range of numbers.\n     */\n    function baseRange(start, end, step, fromRight) {\n      var index = -1,\n          length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n          result = Array(length);\n\n      while (length--) {\n        result[fromRight ? length : ++index] = start;\n        start += step;\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.repeat` which doesn't coerce arguments.\n     *\n     * @private\n     * @param {string} string The string to repeat.\n     * @param {number} n The number of times to repeat the string.\n     * @returns {string} Returns the repeated string.\n     */\n    function baseRepeat(string, n) {\n      var result = '';\n      if (!string || n < 1 || n > MAX_SAFE_INTEGER) {\n        return result;\n      }\n      // Leverage the exponentiation by squaring algorithm for a faster repeat.\n      // See https://en.wikipedia.org/wiki/Exponentiation_by_squaring for more details.\n      do {\n        if (n % 2) {\n          result += string;\n        }\n        n = nativeFloor(n / 2);\n        if (n) {\n          string += string;\n        }\n      } while (n);\n\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     */\n    function baseRest(func, start) {\n      return setToString(overRest(func, start, identity), func + '');\n    }\n\n    /**\n     * The base implementation of `_.sample`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     */\n    function baseSample(collection) {\n      return arraySample(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.sampleSize` without param guards.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} n The number of elements to sample.\n     * @returns {Array} Returns the random elements.\n     */\n    function baseSampleSize(collection, n) {\n      var array = values(collection);\n      return shuffleSelf(array, baseClamp(n, 0, array.length));\n    }\n\n    /**\n     * The base implementation of `_.set`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseSet(object, path, value, customizer) {\n      if (!isObject(object)) {\n        return object;\n      }\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length,\n          lastIndex = length - 1,\n          nested = object;\n\n      while (nested != null && ++index < length) {\n        var key = toKey(path[index]),\n            newValue = value;\n\n        if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n          return object;\n        }\n\n        if (index != lastIndex) {\n          var objValue = nested[key];\n          newValue = customizer ? customizer(objValue, key, nested) : undefined;\n          if (newValue === undefined) {\n            newValue = isObject(objValue)\n              ? objValue\n              : (isIndex(path[index + 1]) ? [] : {});\n          }\n        }\n        assignValue(nested, key, newValue);\n        nested = nested[key];\n      }\n      return object;\n    }\n\n    /**\n     * The base implementation of `setData` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetData = !metaMap ? identity : function(func, data) {\n      metaMap.set(func, data);\n      return func;\n    };\n\n    /**\n     * The base implementation of `setToString` without support for hot loop shorting.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var baseSetToString = !defineProperty ? identity : function(func, string) {\n      return defineProperty(func, 'toString', {\n        'configurable': true,\n        'enumerable': false,\n        'value': constant(string),\n        'writable': true\n      });\n    };\n\n    /**\n     * The base implementation of `_.shuffle`.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     */\n    function baseShuffle(collection) {\n      return shuffleSelf(values(collection));\n    }\n\n    /**\n     * The base implementation of `_.slice` without an iteratee call guard.\n     *\n     * @private\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseSlice(array, start, end) {\n      var index = -1,\n          length = array.length;\n\n      if (start < 0) {\n        start = -start > length ? 0 : (length + start);\n      }\n      end = end > length ? length : end;\n      if (end < 0) {\n        end += length;\n      }\n      length = start > end ? 0 : ((end - start) >>> 0);\n      start >>>= 0;\n\n      var result = Array(length);\n      while (++index < length) {\n        result[index] = array[index + start];\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.some` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} predicate The function invoked per iteration.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     */\n    function baseSome(collection, predicate) {\n      var result;\n\n      baseEach(collection, function(value, index, collection) {\n        result = predicate(value, index, collection);\n        return !result;\n      });\n      return !!result;\n    }\n\n    /**\n     * The base implementation of `_.sortedIndex` and `_.sortedLastIndex` which\n     * performs a binary search of `array` to determine the index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndex(array, value, retHighest) {\n      var low = 0,\n          high = array == null ? low : array.length;\n\n      if (typeof value == 'number' && value === value && high <= HALF_MAX_ARRAY_LENGTH) {\n        while (low < high) {\n          var mid = (low + high) >>> 1,\n              computed = array[mid];\n\n          if (computed !== null && !isSymbol(computed) &&\n              (retHighest ? (computed <= value) : (computed < value))) {\n            low = mid + 1;\n          } else {\n            high = mid;\n          }\n        }\n        return high;\n      }\n      return baseSortedIndexBy(array, value, identity, retHighest);\n    }\n\n    /**\n     * The base implementation of `_.sortedIndexBy` and `_.sortedLastIndexBy`\n     * which invokes `iteratee` for `value` and each element of `array` to compute\n     * their sort ranking. The iteratee is invoked with one argument; (value).\n     *\n     * @private\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} iteratee The iteratee invoked per element.\n     * @param {boolean} [retHighest] Specify returning the highest qualified index.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     */\n    function baseSortedIndexBy(array, value, iteratee, retHighest) {\n      var low = 0,\n          high = array == null ? 0 : array.length;\n      if (high === 0) {\n        return 0;\n      }\n\n      value = iteratee(value);\n      var valIsNaN = value !== value,\n          valIsNull = value === null,\n          valIsSymbol = isSymbol(value),\n          valIsUndefined = value === undefined;\n\n      while (low < high) {\n        var mid = nativeFloor((low + high) / 2),\n            computed = iteratee(array[mid]),\n            othIsDefined = computed !== undefined,\n            othIsNull = computed === null,\n            othIsReflexive = computed === computed,\n            othIsSymbol = isSymbol(computed);\n\n        if (valIsNaN) {\n          var setLow = retHighest || othIsReflexive;\n        } else if (valIsUndefined) {\n          setLow = othIsReflexive && (retHighest || othIsDefined);\n        } else if (valIsNull) {\n          setLow = othIsReflexive && othIsDefined && (retHighest || !othIsNull);\n        } else if (valIsSymbol) {\n          setLow = othIsReflexive && othIsDefined && !othIsNull && (retHighest || !othIsSymbol);\n        } else if (othIsNull || othIsSymbol) {\n          setLow = false;\n        } else {\n          setLow = retHighest ? (computed <= value) : (computed < value);\n        }\n        if (setLow) {\n          low = mid + 1;\n        } else {\n          high = mid;\n        }\n      }\n      return nativeMin(high, MAX_ARRAY_INDEX);\n    }\n\n    /**\n     * The base implementation of `_.sortedUniq` and `_.sortedUniqBy` without\n     * support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseSortedUniq(array, iteratee) {\n      var index = -1,\n          length = array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        if (!index || !eq(computed, seen)) {\n          var seen = computed;\n          result[resIndex++] = value === 0 ? 0 : value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.toNumber` which doesn't ensure correct\n     * conversions of binary, hexadecimal, or octal string values.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     */\n    function baseToNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      return +value;\n    }\n\n    /**\n     * The base implementation of `_.toString` which doesn't convert nullish\n     * values to empty strings.\n     *\n     * @private\n     * @param {*} value The value to process.\n     * @returns {string} Returns the string.\n     */\n    function baseToString(value) {\n      // Exit early for strings to avoid a performance hit in some environments.\n      if (typeof value == 'string') {\n        return value;\n      }\n      if (isArray(value)) {\n        // Recursively convert values (susceptible to call stack limits).\n        return arrayMap(value, baseToString) + '';\n      }\n      if (isSymbol(value)) {\n        return symbolToString ? symbolToString.call(value) : '';\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     */\n    function baseUniq(array, iteratee, comparator) {\n      var index = -1,\n          includes = arrayIncludes,\n          length = array.length,\n          isCommon = true,\n          result = [],\n          seen = result;\n\n      if (comparator) {\n        isCommon = false;\n        includes = arrayIncludesWith;\n      }\n      else if (length >= LARGE_ARRAY_SIZE) {\n        var set = iteratee ? null : createSet(array);\n        if (set) {\n          return setToArray(set);\n        }\n        isCommon = false;\n        includes = cacheHas;\n        seen = new SetCache;\n      }\n      else {\n        seen = iteratee ? [] : result;\n      }\n      outer:\n      while (++index < length) {\n        var value = array[index],\n            computed = iteratee ? iteratee(value) : value;\n\n        value = (comparator || value !== 0) ? value : 0;\n        if (isCommon && computed === computed) {\n          var seenIndex = seen.length;\n          while (seenIndex--) {\n            if (seen[seenIndex] === computed) {\n              continue outer;\n            }\n          }\n          if (iteratee) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n        else if (!includes(seen, computed, comparator)) {\n          if (seen !== result) {\n            seen.push(computed);\n          }\n          result.push(value);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * The base implementation of `_.unset`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The property path to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     */\n    function baseUnset(object, path) {\n      path = castPath(path, object);\n      object = parent(object, path);\n      return object == null || delete object[toKey(last(path))];\n    }\n\n    /**\n     * The base implementation of `_.update`.\n     *\n     * @private\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to update.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize path creation.\n     * @returns {Object} Returns `object`.\n     */\n    function baseUpdate(object, path, updater, customizer) {\n      return baseSet(object, path, updater(baseGet(object, path)), customizer);\n    }\n\n    /**\n     * The base implementation of methods like `_.dropWhile` and `_.takeWhile`\n     * without support for iteratee shorthands.\n     *\n     * @private\n     * @param {Array} array The array to query.\n     * @param {Function} predicate The function invoked per iteration.\n     * @param {boolean} [isDrop] Specify dropping elements instead of taking them.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function baseWhile(array, predicate, isDrop, fromRight) {\n      var length = array.length,\n          index = fromRight ? length : -1;\n\n      while ((fromRight ? index-- : ++index < length) &&\n        predicate(array[index], index, array)) {}\n\n      return isDrop\n        ? baseSlice(array, (fromRight ? 0 : index), (fromRight ? index + 1 : length))\n        : baseSlice(array, (fromRight ? index + 1 : 0), (fromRight ? length : index));\n    }\n\n    /**\n     * The base implementation of `wrapperValue` which returns the result of\n     * performing a sequence of actions on the unwrapped `value`, where each\n     * successive action is supplied the return value of the previous.\n     *\n     * @private\n     * @param {*} value The unwrapped value.\n     * @param {Array} actions Actions to perform to resolve the unwrapped value.\n     * @returns {*} Returns the resolved value.\n     */\n    function baseWrapperValue(value, actions) {\n      var result = value;\n      if (result instanceof LazyWrapper) {\n        result = result.value();\n      }\n      return arrayReduce(actions, function(result, action) {\n        return action.func.apply(action.thisArg, arrayPush([result], action.args));\n      }, result);\n    }\n\n    /**\n     * The base implementation of methods like `_.xor`, without support for\n     * iteratee shorthands, that accepts an array of arrays to inspect.\n     *\n     * @private\n     * @param {Array} arrays The arrays to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of values.\n     */\n    function baseXor(arrays, iteratee, comparator) {\n      var length = arrays.length;\n      if (length < 2) {\n        return length ? baseUniq(arrays[0]) : [];\n      }\n      var index = -1,\n          result = Array(length);\n\n      while (++index < length) {\n        var array = arrays[index],\n            othIndex = -1;\n\n        while (++othIndex < length) {\n          if (othIndex != index) {\n            result[index] = baseDifference(result[index] || array, arrays[othIndex], iteratee, comparator);\n          }\n        }\n      }\n      return baseUniq(baseFlatten(result, 1), iteratee, comparator);\n    }\n\n    /**\n     * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n     *\n     * @private\n     * @param {Array} props The property identifiers.\n     * @param {Array} values The property values.\n     * @param {Function} assignFunc The function to assign values.\n     * @returns {Object} Returns the new object.\n     */\n    function baseZipObject(props, values, assignFunc) {\n      var index = -1,\n          length = props.length,\n          valsLength = values.length,\n          result = {};\n\n      while (++index < length) {\n        var value = index < valsLength ? values[index] : undefined;\n        assignFunc(result, props[index], value);\n      }\n      return result;\n    }\n\n    /**\n     * Casts `value` to an empty array if it's not an array like object.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Array|Object} Returns the cast array-like object.\n     */\n    function castArrayLikeObject(value) {\n      return isArrayLikeObject(value) ? value : [];\n    }\n\n    /**\n     * Casts `value` to `identity` if it's not a function.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {Function} Returns cast function.\n     */\n    function castFunction(value) {\n      return typeof value == 'function' ? value : identity;\n    }\n\n    /**\n     * Casts `value` to a path array if it's not one.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {Array} Returns the cast property path array.\n     */\n    function castPath(value, object) {\n      if (isArray(value)) {\n        return value;\n      }\n      return isKey(value, object) ? [value] : stringToPath(toString(value));\n    }\n\n    /**\n     * A `baseRest` alias which can be replaced with `identity` by module\n     * replacement plugins.\n     *\n     * @private\n     * @type {Function}\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    var castRest = baseRest;\n\n    /**\n     * Casts `array` to a slice if it's needed.\n     *\n     * @private\n     * @param {Array} array The array to inspect.\n     * @param {number} start The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the cast slice.\n     */\n    function castSlice(array, start, end) {\n      var length = array.length;\n      end = end === undefined ? length : end;\n      return (!start && end >= length) ? array : baseSlice(array, start, end);\n    }\n\n    /**\n     * A simple wrapper around the global [`clearTimeout`](https://mdn.io/clearTimeout).\n     *\n     * @private\n     * @param {number|Object} id The timer id or timeout object of the timer to clear.\n     */\n    var clearTimeout = ctxClearTimeout || function(id) {\n      return root.clearTimeout(id);\n    };\n\n    /**\n     * Creates a clone of  `buffer`.\n     *\n     * @private\n     * @param {Buffer} buffer The buffer to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Buffer} Returns the cloned buffer.\n     */\n    function cloneBuffer(buffer, isDeep) {\n      if (isDeep) {\n        return buffer.slice();\n      }\n      var length = buffer.length,\n          result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n      buffer.copy(result);\n      return result;\n    }\n\n    /**\n     * Creates a clone of `arrayBuffer`.\n     *\n     * @private\n     * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n     * @returns {ArrayBuffer} Returns the cloned array buffer.\n     */\n    function cloneArrayBuffer(arrayBuffer) {\n      var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n      new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n      return result;\n    }\n\n    /**\n     * Creates a clone of `dataView`.\n     *\n     * @private\n     * @param {Object} dataView The data view to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned data view.\n     */\n    function cloneDataView(dataView, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n      return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n    }\n\n    /**\n     * Creates a clone of `regexp`.\n     *\n     * @private\n     * @param {Object} regexp The regexp to clone.\n     * @returns {Object} Returns the cloned regexp.\n     */\n    function cloneRegExp(regexp) {\n      var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n      result.lastIndex = regexp.lastIndex;\n      return result;\n    }\n\n    /**\n     * Creates a clone of the `symbol` object.\n     *\n     * @private\n     * @param {Object} symbol The symbol object to clone.\n     * @returns {Object} Returns the cloned symbol object.\n     */\n    function cloneSymbol(symbol) {\n      return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n    }\n\n    /**\n     * Creates a clone of `typedArray`.\n     *\n     * @private\n     * @param {Object} typedArray The typed array to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the cloned typed array.\n     */\n    function cloneTypedArray(typedArray, isDeep) {\n      var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n      return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n    }\n\n    /**\n     * Compares values to sort them in ascending order.\n     *\n     * @private\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {number} Returns the sort order indicator for `value`.\n     */\n    function compareAscending(value, other) {\n      if (value !== other) {\n        var valIsDefined = value !== undefined,\n            valIsNull = value === null,\n            valIsReflexive = value === value,\n            valIsSymbol = isSymbol(value);\n\n        var othIsDefined = other !== undefined,\n            othIsNull = other === null,\n            othIsReflexive = other === other,\n            othIsSymbol = isSymbol(other);\n\n        if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n            (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n            (valIsNull && othIsDefined && othIsReflexive) ||\n            (!valIsDefined && othIsReflexive) ||\n            !valIsReflexive) {\n          return 1;\n        }\n        if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n            (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n            (othIsNull && valIsDefined && valIsReflexive) ||\n            (!othIsDefined && valIsReflexive) ||\n            !othIsReflexive) {\n          return -1;\n        }\n      }\n      return 0;\n    }\n\n    /**\n     * Used by `_.orderBy` to compare multiple properties of a value to another\n     * and stable sort them.\n     *\n     * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n     * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n     * of corresponding values.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {boolean[]|string[]} orders The order to sort by for each property.\n     * @returns {number} Returns the sort order indicator for `object`.\n     */\n    function compareMultiple(object, other, orders) {\n      var index = -1,\n          objCriteria = object.criteria,\n          othCriteria = other.criteria,\n          length = objCriteria.length,\n          ordersLength = orders.length;\n\n      while (++index < length) {\n        var result = compareAscending(objCriteria[index], othCriteria[index]);\n        if (result) {\n          if (index >= ordersLength) {\n            return result;\n          }\n          var order = orders[index];\n          return result * (order == 'desc' ? -1 : 1);\n        }\n      }\n      // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n      // that causes it, under certain circumstances, to provide the same value for\n      // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n      // for more details.\n      //\n      // This also ensures a stable sort in V8 and other engines.\n      // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n      return object.index - other.index;\n    }\n\n    /**\n     * Creates an array that is the composition of partially applied arguments,\n     * placeholders, and provided arguments into a single array of arguments.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to prepend to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgs(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersLength = holders.length,\n          leftIndex = -1,\n          leftLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(leftLength + rangeLength),\n          isUncurried = !isCurried;\n\n      while (++leftIndex < leftLength) {\n        result[leftIndex] = partials[leftIndex];\n      }\n      while (++argsIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[holders[argsIndex]] = args[argsIndex];\n        }\n      }\n      while (rangeLength--) {\n        result[leftIndex++] = args[argsIndex++];\n      }\n      return result;\n    }\n\n    /**\n     * This function is like `composeArgs` except that the arguments composition\n     * is tailored for `_.partialRight`.\n     *\n     * @private\n     * @param {Array} args The provided arguments.\n     * @param {Array} partials The arguments to append to those provided.\n     * @param {Array} holders The `partials` placeholder indexes.\n     * @params {boolean} [isCurried] Specify composing for a curried function.\n     * @returns {Array} Returns the new array of composed arguments.\n     */\n    function composeArgsRight(args, partials, holders, isCurried) {\n      var argsIndex = -1,\n          argsLength = args.length,\n          holdersIndex = -1,\n          holdersLength = holders.length,\n          rightIndex = -1,\n          rightLength = partials.length,\n          rangeLength = nativeMax(argsLength - holdersLength, 0),\n          result = Array(rangeLength + rightLength),\n          isUncurried = !isCurried;\n\n      while (++argsIndex < rangeLength) {\n        result[argsIndex] = args[argsIndex];\n      }\n      var offset = argsIndex;\n      while (++rightIndex < rightLength) {\n        result[offset + rightIndex] = partials[rightIndex];\n      }\n      while (++holdersIndex < holdersLength) {\n        if (isUncurried || argsIndex < argsLength) {\n          result[offset + holders[holdersIndex]] = args[argsIndex++];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Copies the values of `source` to `array`.\n     *\n     * @private\n     * @param {Array} source The array to copy values from.\n     * @param {Array} [array=[]] The array to copy values to.\n     * @returns {Array} Returns `array`.\n     */\n    function copyArray(source, array) {\n      var index = -1,\n          length = source.length;\n\n      array || (array = Array(length));\n      while (++index < length) {\n        array[index] = source[index];\n      }\n      return array;\n    }\n\n    /**\n     * Copies properties of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy properties from.\n     * @param {Array} props The property identifiers to copy.\n     * @param {Object} [object={}] The object to copy properties to.\n     * @param {Function} [customizer] The function to customize copied values.\n     * @returns {Object} Returns `object`.\n     */\n    function copyObject(source, props, object, customizer) {\n      var isNew = !object;\n      object || (object = {});\n\n      var index = -1,\n          length = props.length;\n\n      while (++index < length) {\n        var key = props[index];\n\n        var newValue = customizer\n          ? customizer(object[key], source[key], key, object, source)\n          : undefined;\n\n        if (newValue === undefined) {\n          newValue = source[key];\n        }\n        if (isNew) {\n          baseAssignValue(object, key, newValue);\n        } else {\n          assignValue(object, key, newValue);\n        }\n      }\n      return object;\n    }\n\n    /**\n     * Copies own symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbols(source, object) {\n      return copyObject(source, getSymbols(source), object);\n    }\n\n    /**\n     * Copies own and inherited symbols of `source` to `object`.\n     *\n     * @private\n     * @param {Object} source The object to copy symbols from.\n     * @param {Object} [object={}] The object to copy symbols to.\n     * @returns {Object} Returns `object`.\n     */\n    function copySymbolsIn(source, object) {\n      return copyObject(source, getSymbolsIn(source), object);\n    }\n\n    /**\n     * Creates a function like `_.groupBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} [initializer] The accumulator object initializer.\n     * @returns {Function} Returns the new aggregator function.\n     */\n    function createAggregator(setter, initializer) {\n      return function(collection, iteratee) {\n        var func = isArray(collection) ? arrayAggregator : baseAggregator,\n            accumulator = initializer ? initializer() : {};\n\n        return func(collection, setter, getIteratee(iteratee, 2), accumulator);\n      };\n    }\n\n    /**\n     * Creates a function like `_.assign`.\n     *\n     * @private\n     * @param {Function} assigner The function to assign values.\n     * @returns {Function} Returns the new assigner function.\n     */\n    function createAssigner(assigner) {\n      return baseRest(function(object, sources) {\n        var index = -1,\n            length = sources.length,\n            customizer = length > 1 ? sources[length - 1] : undefined,\n            guard = length > 2 ? sources[2] : undefined;\n\n        customizer = (assigner.length > 3 && typeof customizer == 'function')\n          ? (length--, customizer)\n          : undefined;\n\n        if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n          customizer = length < 3 ? undefined : customizer;\n          length = 1;\n        }\n        object = Object(object);\n        while (++index < length) {\n          var source = sources[index];\n          if (source) {\n            assigner(object, source, index, customizer);\n          }\n        }\n        return object;\n      });\n    }\n\n    /**\n     * Creates a `baseEach` or `baseEachRight` function.\n     *\n     * @private\n     * @param {Function} eachFunc The function to iterate over a collection.\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseEach(eachFunc, fromRight) {\n      return function(collection, iteratee) {\n        if (collection == null) {\n          return collection;\n        }\n        if (!isArrayLike(collection)) {\n          return eachFunc(collection, iteratee);\n        }\n        var length = collection.length,\n            index = fromRight ? length : -1,\n            iterable = Object(collection);\n\n        while ((fromRight ? index-- : ++index < length)) {\n          if (iteratee(iterable[index], index, iterable) === false) {\n            break;\n          }\n        }\n        return collection;\n      };\n    }\n\n    /**\n     * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new base function.\n     */\n    function createBaseFor(fromRight) {\n      return function(object, iteratee, keysFunc) {\n        var index = -1,\n            iterable = Object(object),\n            props = keysFunc(object),\n            length = props.length;\n\n        while (length--) {\n          var key = props[fromRight ? length : ++index];\n          if (iteratee(iterable[key], key, iterable) === false) {\n            break;\n          }\n        }\n        return object;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the optional `this`\n     * binding of `thisArg`.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createBind(func, bitmask, thisArg) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return fn.apply(isBind ? thisArg : this, arguments);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.lowerFirst`.\n     *\n     * @private\n     * @param {string} methodName The name of the `String` case method to use.\n     * @returns {Function} Returns the new case function.\n     */\n    function createCaseFirst(methodName) {\n      return function(string) {\n        string = toString(string);\n\n        var strSymbols = hasUnicode(string)\n          ? stringToArray(string)\n          : undefined;\n\n        var chr = strSymbols\n          ? strSymbols[0]\n          : string.charAt(0);\n\n        var trailing = strSymbols\n          ? castSlice(strSymbols, 1).join('')\n          : string.slice(1);\n\n        return chr[methodName]() + trailing;\n      };\n    }\n\n    /**\n     * Creates a function like `_.camelCase`.\n     *\n     * @private\n     * @param {Function} callback The function to combine each word.\n     * @returns {Function} Returns the new compounder function.\n     */\n    function createCompounder(callback) {\n      return function(string) {\n        return arrayReduce(words(deburr(string).replace(reApos, '')), callback, '');\n      };\n    }\n\n    /**\n     * Creates a function that produces an instance of `Ctor` regardless of\n     * whether it was invoked as part of a `new` expression or by `call` or `apply`.\n     *\n     * @private\n     * @param {Function} Ctor The constructor to wrap.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCtor(Ctor) {\n      return function() {\n        // Use a `switch` statement to work with class constructors. See\n        // http://ecma-international.org/ecma-262/7.0/#sec-ecmascript-function-objects-call-thisargument-argumentslist\n        // for more details.\n        var args = arguments;\n        switch (args.length) {\n          case 0: return new Ctor;\n          case 1: return new Ctor(args[0]);\n          case 2: return new Ctor(args[0], args[1]);\n          case 3: return new Ctor(args[0], args[1], args[2]);\n          case 4: return new Ctor(args[0], args[1], args[2], args[3]);\n          case 5: return new Ctor(args[0], args[1], args[2], args[3], args[4]);\n          case 6: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5]);\n          case 7: return new Ctor(args[0], args[1], args[2], args[3], args[4], args[5], args[6]);\n        }\n        var thisBinding = baseCreate(Ctor.prototype),\n            result = Ctor.apply(thisBinding, args);\n\n        // Mimic the constructor's `return` behavior.\n        // See https://es5.github.io/#x13.2.2 for more details.\n        return isObject(result) ? result : thisBinding;\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to enable currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {number} arity The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createCurry(func, bitmask, arity) {\n      var Ctor = createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length,\n            placeholder = getHolder(wrapper);\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        var holders = (length < 3 && args[0] !== placeholder && args[length - 1] !== placeholder)\n          ? []\n          : replaceHolders(args, placeholder);\n\n        length -= holders.length;\n        if (length < arity) {\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, undefined,\n            args, holders, undefined, undefined, arity - length);\n        }\n        var fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n        return apply(fn, this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.find` or `_.findLast` function.\n     *\n     * @private\n     * @param {Function} findIndexFunc The function to find the collection index.\n     * @returns {Function} Returns the new find function.\n     */\n    function createFind(findIndexFunc) {\n      return function(collection, predicate, fromIndex) {\n        var iterable = Object(collection);\n        if (!isArrayLike(collection)) {\n          var iteratee = getIteratee(predicate, 3);\n          collection = keys(collection);\n          predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n        }\n        var index = findIndexFunc(collection, predicate, fromIndex);\n        return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n      };\n    }\n\n    /**\n     * Creates a `_.flow` or `_.flowRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new flow function.\n     */\n    function createFlow(fromRight) {\n      return flatRest(function(funcs) {\n        var length = funcs.length,\n            index = length,\n            prereq = LodashWrapper.prototype.thru;\n\n        if (fromRight) {\n          funcs.reverse();\n        }\n        while (index--) {\n          var func = funcs[index];\n          if (typeof func != 'function') {\n            throw new TypeError(FUNC_ERROR_TEXT);\n          }\n          if (prereq && !wrapper && getFuncName(func) == 'wrapper') {\n            var wrapper = new LodashWrapper([], true);\n          }\n        }\n        index = wrapper ? index : length;\n        while (++index < length) {\n          func = funcs[index];\n\n          var funcName = getFuncName(func),\n              data = funcName == 'wrapper' ? getData(func) : undefined;\n\n          if (data && isLaziable(data[0]) &&\n                data[1] == (WRAP_ARY_FLAG | WRAP_CURRY_FLAG | WRAP_PARTIAL_FLAG | WRAP_REARG_FLAG) &&\n                !data[4].length && data[9] == 1\n              ) {\n            wrapper = wrapper[getFuncName(data[0])].apply(wrapper, data[3]);\n          } else {\n            wrapper = (func.length == 1 && isLaziable(func))\n              ? wrapper[funcName]()\n              : wrapper.thru(func);\n          }\n        }\n        return function() {\n          var args = arguments,\n              value = args[0];\n\n          if (wrapper && args.length == 1 && isArray(value)) {\n            return wrapper.plant(value).value();\n          }\n          var index = 0,\n              result = length ? funcs[index].apply(this, args) : value;\n\n          while (++index < length) {\n            result = funcs[index].call(this, result);\n          }\n          return result;\n        };\n      });\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with optional `this`\n     * binding of `thisArg`, partial application, and currying.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [partialsRight] The arguments to append to those provided\n     *  to the new function.\n     * @param {Array} [holdersRight] The `partialsRight` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createHybrid(func, bitmask, thisArg, partials, holders, partialsRight, holdersRight, argPos, ary, arity) {\n      var isAry = bitmask & WRAP_ARY_FLAG,\n          isBind = bitmask & WRAP_BIND_FLAG,\n          isBindKey = bitmask & WRAP_BIND_KEY_FLAG,\n          isCurried = bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG),\n          isFlip = bitmask & WRAP_FLIP_FLAG,\n          Ctor = isBindKey ? undefined : createCtor(func);\n\n      function wrapper() {\n        var length = arguments.length,\n            args = Array(length),\n            index = length;\n\n        while (index--) {\n          args[index] = arguments[index];\n        }\n        if (isCurried) {\n          var placeholder = getHolder(wrapper),\n              holdersCount = countHolders(args, placeholder);\n        }\n        if (partials) {\n          args = composeArgs(args, partials, holders, isCurried);\n        }\n        if (partialsRight) {\n          args = composeArgsRight(args, partialsRight, holdersRight, isCurried);\n        }\n        length -= holdersCount;\n        if (isCurried && length < arity) {\n          var newHolders = replaceHolders(args, placeholder);\n          return createRecurry(\n            func, bitmask, createHybrid, wrapper.placeholder, thisArg,\n            args, newHolders, argPos, ary, arity - length\n          );\n        }\n        var thisBinding = isBind ? thisArg : this,\n            fn = isBindKey ? thisBinding[func] : func;\n\n        length = args.length;\n        if (argPos) {\n          args = reorder(args, argPos);\n        } else if (isFlip && length > 1) {\n          args.reverse();\n        }\n        if (isAry && ary < length) {\n          args.length = ary;\n        }\n        if (this && this !== root && this instanceof wrapper) {\n          fn = Ctor || createCtor(fn);\n        }\n        return fn.apply(thisBinding, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a function like `_.invertBy`.\n     *\n     * @private\n     * @param {Function} setter The function to set accumulator values.\n     * @param {Function} toIteratee The function to resolve iteratees.\n     * @returns {Function} Returns the new inverter function.\n     */\n    function createInverter(setter, toIteratee) {\n      return function(object, iteratee) {\n        return baseInverter(object, setter, toIteratee(iteratee), {});\n      };\n    }\n\n    /**\n     * Creates a function that performs a mathematical operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @param {number} [defaultValue] The value used for `undefined` arguments.\n     * @returns {Function} Returns the new mathematical operation function.\n     */\n    function createMathOperation(operator, defaultValue) {\n      return function(value, other) {\n        var result;\n        if (value === undefined && other === undefined) {\n          return defaultValue;\n        }\n        if (value !== undefined) {\n          result = value;\n        }\n        if (other !== undefined) {\n          if (result === undefined) {\n            return other;\n          }\n          if (typeof value == 'string' || typeof other == 'string') {\n            value = baseToString(value);\n            other = baseToString(other);\n          } else {\n            value = baseToNumber(value);\n            other = baseToNumber(other);\n          }\n          result = operator(value, other);\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function like `_.over`.\n     *\n     * @private\n     * @param {Function} arrayFunc The function to iterate over iteratees.\n     * @returns {Function} Returns the new over function.\n     */\n    function createOver(arrayFunc) {\n      return flatRest(function(iteratees) {\n        iteratees = arrayMap(iteratees, baseUnary(getIteratee()));\n        return baseRest(function(args) {\n          var thisArg = this;\n          return arrayFunc(iteratees, function(iteratee) {\n            return apply(iteratee, thisArg, args);\n          });\n        });\n      });\n    }\n\n    /**\n     * Creates the padding for `string` based on `length`. The `chars` string\n     * is truncated if the number of characters exceeds `length`.\n     *\n     * @private\n     * @param {number} length The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padding for `string`.\n     */\n    function createPadding(length, chars) {\n      chars = chars === undefined ? ' ' : baseToString(chars);\n\n      var charsLength = chars.length;\n      if (charsLength < 2) {\n        return charsLength ? baseRepeat(chars, length) : chars;\n      }\n      var result = baseRepeat(chars, nativeCeil(length / stringSize(chars)));\n      return hasUnicode(chars)\n        ? castSlice(stringToArray(result), 0, length).join('')\n        : result.slice(0, length);\n    }\n\n    /**\n     * Creates a function that wraps `func` to invoke it with the `this` binding\n     * of `thisArg` and `partials` prepended to the arguments it receives.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {Array} partials The arguments to prepend to those provided to\n     *  the new function.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createPartial(func, bitmask, thisArg, partials) {\n      var isBind = bitmask & WRAP_BIND_FLAG,\n          Ctor = createCtor(func);\n\n      function wrapper() {\n        var argsIndex = -1,\n            argsLength = arguments.length,\n            leftIndex = -1,\n            leftLength = partials.length,\n            args = Array(leftLength + argsLength),\n            fn = (this && this !== root && this instanceof wrapper) ? Ctor : func;\n\n        while (++leftIndex < leftLength) {\n          args[leftIndex] = partials[leftIndex];\n        }\n        while (argsLength--) {\n          args[leftIndex++] = arguments[++argsIndex];\n        }\n        return apply(fn, isBind ? thisArg : this, args);\n      }\n      return wrapper;\n    }\n\n    /**\n     * Creates a `_.range` or `_.rangeRight` function.\n     *\n     * @private\n     * @param {boolean} [fromRight] Specify iterating from right to left.\n     * @returns {Function} Returns the new range function.\n     */\n    function createRange(fromRight) {\n      return function(start, end, step) {\n        if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n          end = step = undefined;\n        }\n        // Ensure the sign of `-0` is preserved.\n        start = toFinite(start);\n        if (end === undefined) {\n          end = start;\n          start = 0;\n        } else {\n          end = toFinite(end);\n        }\n        step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n        return baseRange(start, end, step, fromRight);\n      };\n    }\n\n    /**\n     * Creates a function that performs a relational operation on two values.\n     *\n     * @private\n     * @param {Function} operator The function to perform the operation.\n     * @returns {Function} Returns the new relational operation function.\n     */\n    function createRelationalOperation(operator) {\n      return function(value, other) {\n        if (!(typeof value == 'string' && typeof other == 'string')) {\n          value = toNumber(value);\n          other = toNumber(other);\n        }\n        return operator(value, other);\n      };\n    }\n\n    /**\n     * Creates a function that wraps `func` to continue currying.\n     *\n     * @private\n     * @param {Function} func The function to wrap.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @param {Function} wrapFunc The function to create the `func` wrapper.\n     * @param {*} placeholder The placeholder value.\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to prepend to those provided to\n     *  the new function.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createRecurry(func, bitmask, wrapFunc, placeholder, thisArg, partials, holders, argPos, ary, arity) {\n      var isCurry = bitmask & WRAP_CURRY_FLAG,\n          newHolders = isCurry ? holders : undefined,\n          newHoldersRight = isCurry ? undefined : holders,\n          newPartials = isCurry ? partials : undefined,\n          newPartialsRight = isCurry ? undefined : partials;\n\n      bitmask |= (isCurry ? WRAP_PARTIAL_FLAG : WRAP_PARTIAL_RIGHT_FLAG);\n      bitmask &= ~(isCurry ? WRAP_PARTIAL_RIGHT_FLAG : WRAP_PARTIAL_FLAG);\n\n      if (!(bitmask & WRAP_CURRY_BOUND_FLAG)) {\n        bitmask &= ~(WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG);\n      }\n      var newData = [\n        func, bitmask, thisArg, newPartials, newHolders, newPartialsRight,\n        newHoldersRight, argPos, ary, arity\n      ];\n\n      var result = wrapFunc.apply(undefined, newData);\n      if (isLaziable(func)) {\n        setData(result, newData);\n      }\n      result.placeholder = placeholder;\n      return setWrapToString(result, func, bitmask);\n    }\n\n    /**\n     * Creates a function like `_.round`.\n     *\n     * @private\n     * @param {string} methodName The name of the `Math` method to use when rounding.\n     * @returns {Function} Returns the new round function.\n     */\n    function createRound(methodName) {\n      var func = Math[methodName];\n      return function(number, precision) {\n        number = toNumber(number);\n        precision = precision == null ? 0 : nativeMin(toInteger(precision), 292);\n        if (precision && nativeIsFinite(number)) {\n          // Shift with exponential notation to avoid floating-point issues.\n          // See [MDN](https://mdn.io/round#Examples) for more details.\n          var pair = (toString(number) + 'e').split('e'),\n              value = func(pair[0] + 'e' + (+pair[1] + precision));\n\n          pair = (toString(value) + 'e').split('e');\n          return +(pair[0] + 'e' + (+pair[1] - precision));\n        }\n        return func(number);\n      };\n    }\n\n    /**\n     * Creates a set object of `values`.\n     *\n     * @private\n     * @param {Array} values The values to add to the set.\n     * @returns {Object} Returns the new set.\n     */\n    var createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n      return new Set(values);\n    };\n\n    /**\n     * Creates a `_.toPairs` or `_.toPairsIn` function.\n     *\n     * @private\n     * @param {Function} keysFunc The function to get the keys of a given object.\n     * @returns {Function} Returns the new pairs function.\n     */\n    function createToPairs(keysFunc) {\n      return function(object) {\n        var tag = getTag(object);\n        if (tag == mapTag) {\n          return mapToArray(object);\n        }\n        if (tag == setTag) {\n          return setToPairs(object);\n        }\n        return baseToPairs(object, keysFunc(object));\n      };\n    }\n\n    /**\n     * Creates a function that either curries or invokes `func` with optional\n     * `this` binding and partially applied arguments.\n     *\n     * @private\n     * @param {Function|string} func The function or method name to wrap.\n     * @param {number} bitmask The bitmask flags.\n     *    1 - `_.bind`\n     *    2 - `_.bindKey`\n     *    4 - `_.curry` or `_.curryRight` of a bound function\n     *    8 - `_.curry`\n     *   16 - `_.curryRight`\n     *   32 - `_.partial`\n     *   64 - `_.partialRight`\n     *  128 - `_.rearg`\n     *  256 - `_.ary`\n     *  512 - `_.flip`\n     * @param {*} [thisArg] The `this` binding of `func`.\n     * @param {Array} [partials] The arguments to be partially applied.\n     * @param {Array} [holders] The `partials` placeholder indexes.\n     * @param {Array} [argPos] The argument positions of the new function.\n     * @param {number} [ary] The arity cap of `func`.\n     * @param {number} [arity] The arity of `func`.\n     * @returns {Function} Returns the new wrapped function.\n     */\n    function createWrap(func, bitmask, thisArg, partials, holders, argPos, ary, arity) {\n      var isBindKey = bitmask & WRAP_BIND_KEY_FLAG;\n      if (!isBindKey && typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var length = partials ? partials.length : 0;\n      if (!length) {\n        bitmask &= ~(WRAP_PARTIAL_FLAG | WRAP_PARTIAL_RIGHT_FLAG);\n        partials = holders = undefined;\n      }\n      ary = ary === undefined ? ary : nativeMax(toInteger(ary), 0);\n      arity = arity === undefined ? arity : toInteger(arity);\n      length -= holders ? holders.length : 0;\n\n      if (bitmask & WRAP_PARTIAL_RIGHT_FLAG) {\n        var partialsRight = partials,\n            holdersRight = holders;\n\n        partials = holders = undefined;\n      }\n      var data = isBindKey ? undefined : getData(func);\n\n      var newData = [\n        func, bitmask, thisArg, partials, holders, partialsRight, holdersRight,\n        argPos, ary, arity\n      ];\n\n      if (data) {\n        mergeData(newData, data);\n      }\n      func = newData[0];\n      bitmask = newData[1];\n      thisArg = newData[2];\n      partials = newData[3];\n      holders = newData[4];\n      arity = newData[9] = newData[9] === undefined\n        ? (isBindKey ? 0 : func.length)\n        : nativeMax(newData[9] - length, 0);\n\n      if (!arity && bitmask & (WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG)) {\n        bitmask &= ~(WRAP_CURRY_FLAG | WRAP_CURRY_RIGHT_FLAG);\n      }\n      if (!bitmask || bitmask == WRAP_BIND_FLAG) {\n        var result = createBind(func, bitmask, thisArg);\n      } else if (bitmask == WRAP_CURRY_FLAG || bitmask == WRAP_CURRY_RIGHT_FLAG) {\n        result = createCurry(func, bitmask, arity);\n      } else if ((bitmask == WRAP_PARTIAL_FLAG || bitmask == (WRAP_BIND_FLAG | WRAP_PARTIAL_FLAG)) && !holders.length) {\n        result = createPartial(func, bitmask, thisArg, partials);\n      } else {\n        result = createHybrid.apply(undefined, newData);\n      }\n      var setter = data ? baseSetData : setData;\n      return setWrapToString(setter(result, newData), func, bitmask);\n    }\n\n    /**\n     * Used by `_.defaults` to customize its `_.assignIn` use to assign properties\n     * of source objects to the destination object for all destination properties\n     * that resolve to `undefined`.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to assign.\n     * @param {Object} object The parent object of `objValue`.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsAssignIn(objValue, srcValue, key, object) {\n      if (objValue === undefined ||\n          (eq(objValue, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        return srcValue;\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.defaultsDeep` to customize its `_.merge` use to merge source\n     * objects into destination objects that are passed thru.\n     *\n     * @private\n     * @param {*} objValue The destination value.\n     * @param {*} srcValue The source value.\n     * @param {string} key The key of the property to merge.\n     * @param {Object} object The parent object of `objValue`.\n     * @param {Object} source The parent object of `srcValue`.\n     * @param {Object} [stack] Tracks traversed source values and their merged\n     *  counterparts.\n     * @returns {*} Returns the value to assign.\n     */\n    function customDefaultsMerge(objValue, srcValue, key, object, source, stack) {\n      if (isObject(objValue) && isObject(srcValue)) {\n        // Recursively merge objects and arrays (susceptible to call stack limits).\n        stack.set(srcValue, objValue);\n        baseMerge(objValue, srcValue, undefined, customDefaultsMerge, stack);\n        stack['delete'](srcValue);\n      }\n      return objValue;\n    }\n\n    /**\n     * Used by `_.omit` to customize its `_.cloneDeep` use to only clone plain\n     * objects.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @param {string} key The key of the property to inspect.\n     * @returns {*} Returns the uncloned value or `undefined` to defer cloning to `_.cloneDeep`.\n     */\n    function customOmitClone(value) {\n      return isPlainObject(value) ? undefined : value;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for arrays with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Array} array The array to compare.\n     * @param {Array} other The other array to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `array` and `other` objects.\n     * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n     */\n    function equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          arrLength = array.length,\n          othLength = other.length;\n\n      if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n        return false;\n      }\n      // Check that cyclic values are equal.\n      var arrStacked = stack.get(array);\n      var othStacked = stack.get(other);\n      if (arrStacked && othStacked) {\n        return arrStacked == other && othStacked == array;\n      }\n      var index = -1,\n          result = true,\n          seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n      stack.set(array, other);\n      stack.set(other, array);\n\n      // Ignore non-index properties.\n      while (++index < arrLength) {\n        var arrValue = array[index],\n            othValue = other[index];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, arrValue, index, other, array, stack)\n            : customizer(arrValue, othValue, index, array, other, stack);\n        }\n        if (compared !== undefined) {\n          if (compared) {\n            continue;\n          }\n          result = false;\n          break;\n        }\n        // Recursively compare arrays (susceptible to call stack limits).\n        if (seen) {\n          if (!arraySome(other, function(othValue, othIndex) {\n                if (!cacheHas(seen, othIndex) &&\n                    (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n                  return seen.push(othIndex);\n                }\n              })) {\n            result = false;\n            break;\n          }\n        } else if (!(\n              arrValue === othValue ||\n                equalFunc(arrValue, othValue, bitmask, customizer, stack)\n            )) {\n          result = false;\n          break;\n        }\n      }\n      stack['delete'](array);\n      stack['delete'](other);\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for comparing objects of\n     * the same `toStringTag`.\n     *\n     * **Note:** This function only supports comparing values with tags of\n     * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {string} tag The `toStringTag` of the objects to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n      switch (tag) {\n        case dataViewTag:\n          if ((object.byteLength != other.byteLength) ||\n              (object.byteOffset != other.byteOffset)) {\n            return false;\n          }\n          object = object.buffer;\n          other = other.buffer;\n\n        case arrayBufferTag:\n          if ((object.byteLength != other.byteLength) ||\n              !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n            return false;\n          }\n          return true;\n\n        case boolTag:\n        case dateTag:\n        case numberTag:\n          // Coerce booleans to `1` or `0` and dates to milliseconds.\n          // Invalid dates are coerced to `NaN`.\n          return eq(+object, +other);\n\n        case errorTag:\n          return object.name == other.name && object.message == other.message;\n\n        case regexpTag:\n        case stringTag:\n          // Coerce regexes to strings and treat strings, primitives and objects,\n          // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n          // for more details.\n          return object == (other + '');\n\n        case mapTag:\n          var convert = mapToArray;\n\n        case setTag:\n          var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n          convert || (convert = setToArray);\n\n          if (object.size != other.size && !isPartial) {\n            return false;\n          }\n          // Assume cyclic values are equal.\n          var stacked = stack.get(object);\n          if (stacked) {\n            return stacked == other;\n          }\n          bitmask |= COMPARE_UNORDERED_FLAG;\n\n          // Recursively compare objects (susceptible to call stack limits).\n          stack.set(object, other);\n          var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n          stack['delete'](object);\n          return result;\n\n        case symbolTag:\n          if (symbolValueOf) {\n            return symbolValueOf.call(object) == symbolValueOf.call(other);\n          }\n      }\n      return false;\n    }\n\n    /**\n     * A specialized version of `baseIsEqualDeep` for objects with support for\n     * partial deep comparisons.\n     *\n     * @private\n     * @param {Object} object The object to compare.\n     * @param {Object} other The other object to compare.\n     * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n     * @param {Function} customizer The function to customize comparisons.\n     * @param {Function} equalFunc The function to determine equivalents of values.\n     * @param {Object} stack Tracks traversed `object` and `other` objects.\n     * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n     */\n    function equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n          objProps = getAllKeys(object),\n          objLength = objProps.length,\n          othProps = getAllKeys(other),\n          othLength = othProps.length;\n\n      if (objLength != othLength && !isPartial) {\n        return false;\n      }\n      var index = objLength;\n      while (index--) {\n        var key = objProps[index];\n        if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n          return false;\n        }\n      }\n      // Check that cyclic values are equal.\n      var objStacked = stack.get(object);\n      var othStacked = stack.get(other);\n      if (objStacked && othStacked) {\n        return objStacked == other && othStacked == object;\n      }\n      var result = true;\n      stack.set(object, other);\n      stack.set(other, object);\n\n      var skipCtor = isPartial;\n      while (++index < objLength) {\n        key = objProps[index];\n        var objValue = object[key],\n            othValue = other[key];\n\n        if (customizer) {\n          var compared = isPartial\n            ? customizer(othValue, objValue, key, other, object, stack)\n            : customizer(objValue, othValue, key, object, other, stack);\n        }\n        // Recursively compare objects (susceptible to call stack limits).\n        if (!(compared === undefined\n              ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n              : compared\n            )) {\n          result = false;\n          break;\n        }\n        skipCtor || (skipCtor = key == 'constructor');\n      }\n      if (result && !skipCtor) {\n        var objCtor = object.constructor,\n            othCtor = other.constructor;\n\n        // Non `Object` object instances with different constructors are not equal.\n        if (objCtor != othCtor &&\n            ('constructor' in object && 'constructor' in other) &&\n            !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n              typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n          result = false;\n        }\n      }\n      stack['delete'](object);\n      stack['delete'](other);\n      return result;\n    }\n\n    /**\n     * A specialized version of `baseRest` which flattens the rest array.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @returns {Function} Returns the new function.\n     */\n    function flatRest(func) {\n      return setToString(overRest(func, undefined, flatten), func + '');\n    }\n\n    /**\n     * Creates an array of own enumerable property names and symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeys(object) {\n      return baseGetAllKeys(object, keys, getSymbols);\n    }\n\n    /**\n     * Creates an array of own and inherited enumerable property names and\n     * symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names and symbols.\n     */\n    function getAllKeysIn(object) {\n      return baseGetAllKeys(object, keysIn, getSymbolsIn);\n    }\n\n    /**\n     * Gets metadata for `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {*} Returns the metadata for `func`.\n     */\n    var getData = !metaMap ? noop : function(func) {\n      return metaMap.get(func);\n    };\n\n    /**\n     * Gets the name of `func`.\n     *\n     * @private\n     * @param {Function} func The function to query.\n     * @returns {string} Returns the function name.\n     */\n    function getFuncName(func) {\n      var result = (func.name + ''),\n          array = realNames[result],\n          length = hasOwnProperty.call(realNames, result) ? array.length : 0;\n\n      while (length--) {\n        var data = array[length],\n            otherFunc = data.func;\n        if (otherFunc == null || otherFunc == func) {\n          return data.name;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Gets the argument placeholder value for `func`.\n     *\n     * @private\n     * @param {Function} func The function to inspect.\n     * @returns {*} Returns the placeholder value.\n     */\n    function getHolder(func) {\n      var object = hasOwnProperty.call(lodash, 'placeholder') ? lodash : func;\n      return object.placeholder;\n    }\n\n    /**\n     * Gets the appropriate \"iteratee\" function. If `_.iteratee` is customized,\n     * this function returns the custom method, otherwise it returns `baseIteratee`.\n     * If arguments are provided, the chosen function is invoked with them and\n     * its result is returned.\n     *\n     * @private\n     * @param {*} [value] The value to convert to an iteratee.\n     * @param {number} [arity] The arity of the created iteratee.\n     * @returns {Function} Returns the chosen function or its result.\n     */\n    function getIteratee() {\n      var result = lodash.iteratee || iteratee;\n      result = result === iteratee ? baseIteratee : result;\n      return arguments.length ? result(arguments[0], arguments[1]) : result;\n    }\n\n    /**\n     * Gets the data for `map`.\n     *\n     * @private\n     * @param {Object} map The map to query.\n     * @param {string} key The reference key.\n     * @returns {*} Returns the map data.\n     */\n    function getMapData(map, key) {\n      var data = map.__data__;\n      return isKeyable(key)\n        ? data[typeof key == 'string' ? 'string' : 'hash']\n        : data.map;\n    }\n\n    /**\n     * Gets the property names, values, and compare flags of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the match data of `object`.\n     */\n    function getMatchData(object) {\n      var result = keys(object),\n          length = result.length;\n\n      while (length--) {\n        var key = result[length],\n            value = object[key];\n\n        result[length] = [key, value, isStrictComparable(value)];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the native function at `key` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the method to get.\n     * @returns {*} Returns the function if it's native, else `undefined`.\n     */\n    function getNative(object, key) {\n      var value = getValue(object, key);\n      return baseIsNative(value) ? value : undefined;\n    }\n\n    /**\n     * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the raw `toStringTag`.\n     */\n    function getRawTag(value) {\n      var isOwn = hasOwnProperty.call(value, symToStringTag),\n          tag = value[symToStringTag];\n\n      try {\n        value[symToStringTag] = undefined;\n        var unmasked = true;\n      } catch (e) {}\n\n      var result = nativeObjectToString.call(value);\n      if (unmasked) {\n        if (isOwn) {\n          value[symToStringTag] = tag;\n        } else {\n          delete value[symToStringTag];\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array of the own enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n      if (object == null) {\n        return [];\n      }\n      object = Object(object);\n      return arrayFilter(nativeGetSymbols(object), function(symbol) {\n        return propertyIsEnumerable.call(object, symbol);\n      });\n    };\n\n    /**\n     * Creates an array of the own and inherited enumerable symbols of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of symbols.\n     */\n    var getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n      var result = [];\n      while (object) {\n        arrayPush(result, getSymbols(object));\n        object = getPrototype(object);\n      }\n      return result;\n    };\n\n    /**\n     * Gets the `toStringTag` of `value`.\n     *\n     * @private\n     * @param {*} value The value to query.\n     * @returns {string} Returns the `toStringTag`.\n     */\n    var getTag = baseGetTag;\n\n    // Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\n    if ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n        (Map && getTag(new Map) != mapTag) ||\n        (Promise && getTag(Promise.resolve()) != promiseTag) ||\n        (Set && getTag(new Set) != setTag) ||\n        (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n      getTag = function(value) {\n        var result = baseGetTag(value),\n            Ctor = result == objectTag ? value.constructor : undefined,\n            ctorString = Ctor ? toSource(Ctor) : '';\n\n        if (ctorString) {\n          switch (ctorString) {\n            case dataViewCtorString: return dataViewTag;\n            case mapCtorString: return mapTag;\n            case promiseCtorString: return promiseTag;\n            case setCtorString: return setTag;\n            case weakMapCtorString: return weakMapTag;\n          }\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Gets the view, applying any `transforms` to the `start` and `end` positions.\n     *\n     * @private\n     * @param {number} start The start of the view.\n     * @param {number} end The end of the view.\n     * @param {Array} transforms The transformations to apply to the view.\n     * @returns {Object} Returns an object containing the `start` and `end`\n     *  positions of the view.\n     */\n    function getView(start, end, transforms) {\n      var index = -1,\n          length = transforms.length;\n\n      while (++index < length) {\n        var data = transforms[index],\n            size = data.size;\n\n        switch (data.type) {\n          case 'drop':      start += size; break;\n          case 'dropRight': end -= size; break;\n          case 'take':      end = nativeMin(end, start + size); break;\n          case 'takeRight': start = nativeMax(start, end - size); break;\n        }\n      }\n      return { 'start': start, 'end': end };\n    }\n\n    /**\n     * Extracts wrapper details from the `source` body comment.\n     *\n     * @private\n     * @param {string} source The source to inspect.\n     * @returns {Array} Returns the wrapper details.\n     */\n    function getWrapDetails(source) {\n      var match = source.match(reWrapDetails);\n      return match ? match[1].split(reSplitDetails) : [];\n    }\n\n    /**\n     * Checks if `path` exists on `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @param {Function} hasFunc The function to check properties.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     */\n    function hasPath(object, path, hasFunc) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length,\n          result = false;\n\n      while (++index < length) {\n        var key = toKey(path[index]);\n        if (!(result = object != null && hasFunc(object, key))) {\n          break;\n        }\n        object = object[key];\n      }\n      if (result || ++index != length) {\n        return result;\n      }\n      length = object == null ? 0 : object.length;\n      return !!length && isLength(length) && isIndex(key, length) &&\n        (isArray(object) || isArguments(object));\n    }\n\n    /**\n     * Initializes an array clone.\n     *\n     * @private\n     * @param {Array} array The array to clone.\n     * @returns {Array} Returns the initialized clone.\n     */\n    function initCloneArray(array) {\n      var length = array.length,\n          result = new array.constructor(length);\n\n      // Add properties assigned by `RegExp#exec`.\n      if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n        result.index = array.index;\n        result.input = array.input;\n      }\n      return result;\n    }\n\n    /**\n     * Initializes an object clone.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneObject(object) {\n      return (typeof object.constructor == 'function' && !isPrototype(object))\n        ? baseCreate(getPrototype(object))\n        : {};\n    }\n\n    /**\n     * Initializes an object clone based on its `toStringTag`.\n     *\n     * **Note:** This function only supports cloning values with tags of\n     * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n     *\n     * @private\n     * @param {Object} object The object to clone.\n     * @param {string} tag The `toStringTag` of the object to clone.\n     * @param {boolean} [isDeep] Specify a deep clone.\n     * @returns {Object} Returns the initialized clone.\n     */\n    function initCloneByTag(object, tag, isDeep) {\n      var Ctor = object.constructor;\n      switch (tag) {\n        case arrayBufferTag:\n          return cloneArrayBuffer(object);\n\n        case boolTag:\n        case dateTag:\n          return new Ctor(+object);\n\n        case dataViewTag:\n          return cloneDataView(object, isDeep);\n\n        case float32Tag: case float64Tag:\n        case int8Tag: case int16Tag: case int32Tag:\n        case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n          return cloneTypedArray(object, isDeep);\n\n        case mapTag:\n          return new Ctor;\n\n        case numberTag:\n        case stringTag:\n          return new Ctor(object);\n\n        case regexpTag:\n          return cloneRegExp(object);\n\n        case setTag:\n          return new Ctor;\n\n        case symbolTag:\n          return cloneSymbol(object);\n      }\n    }\n\n    /**\n     * Inserts wrapper `details` in a comment at the top of the `source` body.\n     *\n     * @private\n     * @param {string} source The source to modify.\n     * @returns {Array} details The details to insert.\n     * @returns {string} Returns the modified source.\n     */\n    function insertWrapDetails(source, details) {\n      var length = details.length;\n      if (!length) {\n        return source;\n      }\n      var lastIndex = length - 1;\n      details[lastIndex] = (length > 1 ? '& ' : '') + details[lastIndex];\n      details = details.join(length > 2 ? ', ' : ' ');\n      return source.replace(reWrapComment, '{\\n/* [wrapped with ' + details + '] */\\n');\n    }\n\n    /**\n     * Checks if `value` is a flattenable `arguments` object or array.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n     */\n    function isFlattenable(value) {\n      return isArray(value) || isArguments(value) ||\n        !!(spreadableSymbol && value && value[spreadableSymbol]);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like index.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n     * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n     */\n    function isIndex(value, length) {\n      var type = typeof value;\n      length = length == null ? MAX_SAFE_INTEGER : length;\n\n      return !!length &&\n        (type == 'number' ||\n          (type != 'symbol' && reIsUint.test(value))) &&\n            (value > -1 && value % 1 == 0 && value < length);\n    }\n\n    /**\n     * Checks if the given arguments are from an iteratee call.\n     *\n     * @private\n     * @param {*} value The potential iteratee value argument.\n     * @param {*} index The potential iteratee index or key argument.\n     * @param {*} object The potential iteratee object argument.\n     * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n     *  else `false`.\n     */\n    function isIterateeCall(value, index, object) {\n      if (!isObject(object)) {\n        return false;\n      }\n      var type = typeof index;\n      if (type == 'number'\n            ? (isArrayLike(object) && isIndex(index, object.length))\n            : (type == 'string' && index in object)\n          ) {\n        return eq(object[index], value);\n      }\n      return false;\n    }\n\n    /**\n     * Checks if `value` is a property name and not a property path.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @param {Object} [object] The object to query keys on.\n     * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n     */\n    function isKey(value, object) {\n      if (isArray(value)) {\n        return false;\n      }\n      var type = typeof value;\n      if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n          value == null || isSymbol(value)) {\n        return true;\n      }\n      return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n        (object != null && value in Object(object));\n    }\n\n    /**\n     * Checks if `value` is suitable for use as unique object key.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n     */\n    function isKeyable(value) {\n      var type = typeof value;\n      return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n        ? (value !== '__proto__')\n        : (value === null);\n    }\n\n    /**\n     * Checks if `func` has a lazy counterpart.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` has a lazy counterpart,\n     *  else `false`.\n     */\n    function isLaziable(func) {\n      var funcName = getFuncName(func),\n          other = lodash[funcName];\n\n      if (typeof other != 'function' || !(funcName in LazyWrapper.prototype)) {\n        return false;\n      }\n      if (func === other) {\n        return true;\n      }\n      var data = getData(other);\n      return !!data && func === data[0];\n    }\n\n    /**\n     * Checks if `func` has its source masked.\n     *\n     * @private\n     * @param {Function} func The function to check.\n     * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n     */\n    function isMasked(func) {\n      return !!maskSrcKey && (maskSrcKey in func);\n    }\n\n    /**\n     * Checks if `func` is capable of being masked.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `func` is maskable, else `false`.\n     */\n    var isMaskable = coreJsData ? isFunction : stubFalse;\n\n    /**\n     * Checks if `value` is likely a prototype object.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n     */\n    function isPrototype(value) {\n      var Ctor = value && value.constructor,\n          proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n      return value === proto;\n    }\n\n    /**\n     * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` if suitable for strict\n     *  equality comparisons, else `false`.\n     */\n    function isStrictComparable(value) {\n      return value === value && !isObject(value);\n    }\n\n    /**\n     * A specialized version of `matchesProperty` for source values suitable\n     * for strict equality comparisons, i.e. `===`.\n     *\n     * @private\n     * @param {string} key The key of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     */\n    function matchesStrictComparable(key, srcValue) {\n      return function(object) {\n        if (object == null) {\n          return false;\n        }\n        return object[key] === srcValue &&\n          (srcValue !== undefined || (key in Object(object)));\n      };\n    }\n\n    /**\n     * A specialized version of `_.memoize` which clears the memoized function's\n     * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n     *\n     * @private\n     * @param {Function} func The function to have its output memoized.\n     * @returns {Function} Returns the new memoized function.\n     */\n    function memoizeCapped(func) {\n      var result = memoize(func, function(key) {\n        if (cache.size === MAX_MEMOIZE_SIZE) {\n          cache.clear();\n        }\n        return key;\n      });\n\n      var cache = result.cache;\n      return result;\n    }\n\n    /**\n     * Merges the function metadata of `source` into `data`.\n     *\n     * Merging metadata reduces the number of wrappers used to invoke a function.\n     * This is possible because methods like `_.bind`, `_.curry`, and `_.partial`\n     * may be applied regardless of execution order. Methods like `_.ary` and\n     * `_.rearg` modify function arguments, making the order in which they are\n     * executed important, preventing the merging of metadata. However, we make\n     * an exception for a safe combined case where curried functions have `_.ary`\n     * and or `_.rearg` applied.\n     *\n     * @private\n     * @param {Array} data The destination metadata.\n     * @param {Array} source The source metadata.\n     * @returns {Array} Returns `data`.\n     */\n    function mergeData(data, source) {\n      var bitmask = data[1],\n          srcBitmask = source[1],\n          newBitmask = bitmask | srcBitmask,\n          isCommon = newBitmask < (WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG | WRAP_ARY_FLAG);\n\n      var isCombo =\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_CURRY_FLAG)) ||\n        ((srcBitmask == WRAP_ARY_FLAG) && (bitmask == WRAP_REARG_FLAG) && (data[7].length <= source[8])) ||\n        ((srcBitmask == (WRAP_ARY_FLAG | WRAP_REARG_FLAG)) && (source[7].length <= source[8]) && (bitmask == WRAP_CURRY_FLAG));\n\n      // Exit early if metadata can't be merged.\n      if (!(isCommon || isCombo)) {\n        return data;\n      }\n      // Use source `thisArg` if available.\n      if (srcBitmask & WRAP_BIND_FLAG) {\n        data[2] = source[2];\n        // Set when currying a bound function.\n        newBitmask |= bitmask & WRAP_BIND_FLAG ? 0 : WRAP_CURRY_BOUND_FLAG;\n      }\n      // Compose partial arguments.\n      var value = source[3];\n      if (value) {\n        var partials = data[3];\n        data[3] = partials ? composeArgs(partials, value, source[4]) : value;\n        data[4] = partials ? replaceHolders(data[3], PLACEHOLDER) : source[4];\n      }\n      // Compose partial right arguments.\n      value = source[5];\n      if (value) {\n        partials = data[5];\n        data[5] = partials ? composeArgsRight(partials, value, source[6]) : value;\n        data[6] = partials ? replaceHolders(data[5], PLACEHOLDER) : source[6];\n      }\n      // Use source `argPos` if available.\n      value = source[7];\n      if (value) {\n        data[7] = value;\n      }\n      // Use source `ary` if it's smaller.\n      if (srcBitmask & WRAP_ARY_FLAG) {\n        data[8] = data[8] == null ? source[8] : nativeMin(data[8], source[8]);\n      }\n      // Use source `arity` if one is not provided.\n      if (data[9] == null) {\n        data[9] = source[9];\n      }\n      // Use source `func` and merge bitmasks.\n      data[0] = source[0];\n      data[1] = newBitmask;\n\n      return data;\n    }\n\n    /**\n     * This function is like\n     * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * except that it includes inherited enumerable properties.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     */\n    function nativeKeysIn(object) {\n      var result = [];\n      if (object != null) {\n        for (var key in Object(object)) {\n          result.push(key);\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a string using `Object.prototype.toString`.\n     *\n     * @private\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     */\n    function objectToString(value) {\n      return nativeObjectToString.call(value);\n    }\n\n    /**\n     * A specialized version of `baseRest` which transforms the rest array.\n     *\n     * @private\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @param {Function} transform The rest array transform.\n     * @returns {Function} Returns the new function.\n     */\n    function overRest(func, start, transform) {\n      start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n      return function() {\n        var args = arguments,\n            index = -1,\n            length = nativeMax(args.length - start, 0),\n            array = Array(length);\n\n        while (++index < length) {\n          array[index] = args[start + index];\n        }\n        index = -1;\n        var otherArgs = Array(start + 1);\n        while (++index < start) {\n          otherArgs[index] = args[index];\n        }\n        otherArgs[start] = transform(array);\n        return apply(func, this, otherArgs);\n      };\n    }\n\n    /**\n     * Gets the parent value at `path` of `object`.\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {Array} path The path to get the parent value of.\n     * @returns {*} Returns the parent value.\n     */\n    function parent(object, path) {\n      return path.length < 2 ? object : baseGet(object, baseSlice(path, 0, -1));\n    }\n\n    /**\n     * Reorder `array` according to the specified indexes where the element at\n     * the first index is assigned as the first element, the element at\n     * the second index is assigned as the second element, and so on.\n     *\n     * @private\n     * @param {Array} array The array to reorder.\n     * @param {Array} indexes The arranged array indexes.\n     * @returns {Array} Returns `array`.\n     */\n    function reorder(array, indexes) {\n      var arrLength = array.length,\n          length = nativeMin(indexes.length, arrLength),\n          oldArray = copyArray(array);\n\n      while (length--) {\n        var index = indexes[length];\n        array[length] = isIndex(index, arrLength) ? oldArray[index] : undefined;\n      }\n      return array;\n    }\n\n    /**\n     * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n     *\n     * @private\n     * @param {Object} object The object to query.\n     * @param {string} key The key of the property to get.\n     * @returns {*} Returns the property value.\n     */\n    function safeGet(object, key) {\n      if (key === 'constructor' && typeof object[key] === 'function') {\n        return;\n      }\n\n      if (key == '__proto__') {\n        return;\n      }\n\n      return object[key];\n    }\n\n    /**\n     * Sets metadata for `func`.\n     *\n     * **Note:** If this function becomes hot, i.e. is invoked a lot in a short\n     * period of time, it will trip its breaker and transition to an identity\n     * function to avoid garbage collection pauses in V8. See\n     * [V8 issue 2070](https://bugs.chromium.org/p/v8/issues/detail?id=2070)\n     * for more details.\n     *\n     * @private\n     * @param {Function} func The function to associate metadata with.\n     * @param {*} data The metadata.\n     * @returns {Function} Returns `func`.\n     */\n    var setData = shortOut(baseSetData);\n\n    /**\n     * A simple wrapper around the global [`setTimeout`](https://mdn.io/setTimeout).\n     *\n     * @private\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @returns {number|Object} Returns the timer id or timeout object.\n     */\n    var setTimeout = ctxSetTimeout || function(func, wait) {\n      return root.setTimeout(func, wait);\n    };\n\n    /**\n     * Sets the `toString` method of `func` to return `string`.\n     *\n     * @private\n     * @param {Function} func The function to modify.\n     * @param {Function} string The `toString` result.\n     * @returns {Function} Returns `func`.\n     */\n    var setToString = shortOut(baseSetToString);\n\n    /**\n     * Sets the `toString` method of `wrapper` to mimic the source of `reference`\n     * with wrapper details in a comment at the top of the source body.\n     *\n     * @private\n     * @param {Function} wrapper The function to modify.\n     * @param {Function} reference The reference function.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Function} Returns `wrapper`.\n     */\n    function setWrapToString(wrapper, reference, bitmask) {\n      var source = (reference + '');\n      return setToString(wrapper, insertWrapDetails(source, updateWrapDetails(getWrapDetails(source), bitmask)));\n    }\n\n    /**\n     * Creates a function that'll short out and invoke `identity` instead\n     * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n     * milliseconds.\n     *\n     * @private\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new shortable function.\n     */\n    function shortOut(func) {\n      var count = 0,\n          lastCalled = 0;\n\n      return function() {\n        var stamp = nativeNow(),\n            remaining = HOT_SPAN - (stamp - lastCalled);\n\n        lastCalled = stamp;\n        if (remaining > 0) {\n          if (++count >= HOT_COUNT) {\n            return arguments[0];\n          }\n        } else {\n          count = 0;\n        }\n        return func.apply(undefined, arguments);\n      };\n    }\n\n    /**\n     * A specialized version of `_.shuffle` which mutates and sets the size of `array`.\n     *\n     * @private\n     * @param {Array} array The array to shuffle.\n     * @param {number} [size=array.length] The size of `array`.\n     * @returns {Array} Returns `array`.\n     */\n    function shuffleSelf(array, size) {\n      var index = -1,\n          length = array.length,\n          lastIndex = length - 1;\n\n      size = size === undefined ? length : size;\n      while (++index < size) {\n        var rand = baseRandom(index, lastIndex),\n            value = array[rand];\n\n        array[rand] = array[index];\n        array[index] = value;\n      }\n      array.length = size;\n      return array;\n    }\n\n    /**\n     * Converts `string` to a property path array.\n     *\n     * @private\n     * @param {string} string The string to convert.\n     * @returns {Array} Returns the property path array.\n     */\n    var stringToPath = memoizeCapped(function(string) {\n      var result = [];\n      if (string.charCodeAt(0) === 46 /* . */) {\n        result.push('');\n      }\n      string.replace(rePropName, function(match, number, quote, subString) {\n        result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n      });\n      return result;\n    });\n\n    /**\n     * Converts `value` to a string key if it's not a string or symbol.\n     *\n     * @private\n     * @param {*} value The value to inspect.\n     * @returns {string|symbol} Returns the key.\n     */\n    function toKey(value) {\n      if (typeof value == 'string' || isSymbol(value)) {\n        return value;\n      }\n      var result = (value + '');\n      return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n    }\n\n    /**\n     * Converts `func` to its source code.\n     *\n     * @private\n     * @param {Function} func The function to convert.\n     * @returns {string} Returns the source code.\n     */\n    function toSource(func) {\n      if (func != null) {\n        try {\n          return funcToString.call(func);\n        } catch (e) {}\n        try {\n          return (func + '');\n        } catch (e) {}\n      }\n      return '';\n    }\n\n    /**\n     * Updates wrapper `details` based on `bitmask` flags.\n     *\n     * @private\n     * @returns {Array} details The details to modify.\n     * @param {number} bitmask The bitmask flags. See `createWrap` for more details.\n     * @returns {Array} Returns `details`.\n     */\n    function updateWrapDetails(details, bitmask) {\n      arrayEach(wrapFlags, function(pair) {\n        var value = '_.' + pair[0];\n        if ((bitmask & pair[1]) && !arrayIncludes(details, value)) {\n          details.push(value);\n        }\n      });\n      return details.sort();\n    }\n\n    /**\n     * Creates a clone of `wrapper`.\n     *\n     * @private\n     * @param {Object} wrapper The wrapper to clone.\n     * @returns {Object} Returns the cloned wrapper.\n     */\n    function wrapperClone(wrapper) {\n      if (wrapper instanceof LazyWrapper) {\n        return wrapper.clone();\n      }\n      var result = new LodashWrapper(wrapper.__wrapped__, wrapper.__chain__);\n      result.__actions__ = copyArray(wrapper.__actions__);\n      result.__index__  = wrapper.__index__;\n      result.__values__ = wrapper.__values__;\n      return result;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an array of elements split into groups the length of `size`.\n     * If `array` can't be split evenly, the final chunk will be the remaining\n     * elements.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to process.\n     * @param {number} [size=1] The length of each chunk\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the new array of chunks.\n     * @example\n     *\n     * _.chunk(['a', 'b', 'c', 'd'], 2);\n     * // => [['a', 'b'], ['c', 'd']]\n     *\n     * _.chunk(['a', 'b', 'c', 'd'], 3);\n     * // => [['a', 'b', 'c'], ['d']]\n     */\n    function chunk(array, size, guard) {\n      if ((guard ? isIterateeCall(array, size, guard) : size === undefined)) {\n        size = 1;\n      } else {\n        size = nativeMax(toInteger(size), 0);\n      }\n      var length = array == null ? 0 : array.length;\n      if (!length || size < 1) {\n        return [];\n      }\n      var index = 0,\n          resIndex = 0,\n          result = Array(nativeCeil(length / size));\n\n      while (index < length) {\n        result[resIndex++] = baseSlice(array, index, (index += size));\n      }\n      return result;\n    }\n\n    /**\n     * Creates an array with all falsey values removed. The values `false`, `null`,\n     * `0`, `\"\"`, `undefined`, and `NaN` are falsey.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to compact.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.compact([0, 1, false, 2, '', 3]);\n     * // => [1, 2, 3]\n     */\n    function compact(array) {\n      var index = -1,\n          length = array == null ? 0 : array.length,\n          resIndex = 0,\n          result = [];\n\n      while (++index < length) {\n        var value = array[index];\n        if (value) {\n          result[resIndex++] = value;\n        }\n      }\n      return result;\n    }\n\n    /**\n     * Creates a new array concatenating `array` with any additional arrays\n     * and/or values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to concatenate.\n     * @param {...*} [values] The values to concatenate.\n     * @returns {Array} Returns the new concatenated array.\n     * @example\n     *\n     * var array = [1];\n     * var other = _.concat(array, 2, [3], [[4]]);\n     *\n     * console.log(other);\n     * // => [1, 2, 3, [4]]\n     *\n     * console.log(array);\n     * // => [1]\n     */\n    function concat() {\n      var length = arguments.length;\n      if (!length) {\n        return [];\n      }\n      var args = Array(length - 1),\n          array = arguments[0],\n          index = length;\n\n      while (index--) {\n        args[index - 1] = arguments[index];\n      }\n      return arrayPush(isArray(array) ? copyArray(array) : [array], baseFlatten(args, 1));\n    }\n\n    /**\n     * Creates an array of `array` values not included in the other given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * **Note:** Unlike `_.pullAll`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.without, _.xor\n     * @example\n     *\n     * _.difference([2, 1], [2, 3]);\n     * // => [1]\n     */\n    var difference = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `iteratee` which\n     * is invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * **Note:** Unlike `_.pullAllBy`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.differenceBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.differenceBy([{ 'x': 2 }, { 'x': 1 }], [{ 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var differenceBy = baseRest(function(array, values) {\n      var iteratee = last(values);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.difference` except that it accepts `comparator`\n     * which is invoked to compare elements of `array` to `values`. The order and\n     * references of result values are determined by the first array. The comparator\n     * is invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.pullAllWith`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...Array} [values] The values to exclude.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     *\n     * _.differenceWith(objects, [{ 'x': 1, 'y': 2 }], _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }]\n     */\n    var differenceWith = baseRest(function(array, values) {\n      var comparator = last(values);\n      if (isArrayLikeObject(comparator)) {\n        comparator = undefined;\n      }\n      return isArrayLikeObject(array)\n        ? baseDifference(array, baseFlatten(values, 1, isArrayLikeObject, true), undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.drop([1, 2, 3]);\n     * // => [2, 3]\n     *\n     * _.drop([1, 2, 3], 2);\n     * // => [3]\n     *\n     * _.drop([1, 2, 3], 5);\n     * // => []\n     *\n     * _.drop([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function drop(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements dropped from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to drop.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.dropRight([1, 2, 3]);\n     * // => [1, 2]\n     *\n     * _.dropRight([1, 2, 3], 2);\n     * // => [1]\n     *\n     * _.dropRight([1, 2, 3], 5);\n     * // => []\n     *\n     * _.dropRight([1, 2, 3], 0);\n     * // => [1, 2, 3]\n     */\n    function dropRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the end.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.dropRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropRightWhile(users, ['active', false]);\n     * // => objects for ['barney']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropRightWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` excluding elements dropped from the beginning.\n     * Elements are dropped until `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.dropWhile(users, function(o) { return !o.active; });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.dropWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.dropWhile(users, ['active', false]);\n     * // => objects for ['pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.dropWhile(users, 'active');\n     * // => objects for ['barney', 'fred', 'pebbles']\n     */\n    function dropWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), true)\n        : [];\n    }\n\n    /**\n     * Fills elements of `array` with `value` from `start` up to, but not\n     * including, `end`.\n     *\n     * **Note:** This method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Array\n     * @param {Array} array The array to fill.\n     * @param {*} value The value to fill `array` with.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.fill(array, 'a');\n     * console.log(array);\n     * // => ['a', 'a', 'a']\n     *\n     * _.fill(Array(3), 2);\n     * // => [2, 2, 2]\n     *\n     * _.fill([4, 6, 8, 10], '*', 1, 3);\n     * // => [4, '*', '*', 10]\n     */\n    function fill(array, value, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (start && typeof start != 'number' && isIterateeCall(array, value, start)) {\n        start = 0;\n        end = length;\n      }\n      return baseFill(array, value, start, end);\n    }\n\n    /**\n     * This method is like `_.find` except that it returns the index of the first\n     * element `predicate` returns truthy for instead of the element itself.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the found element, else `-1`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.findIndex(users, function(o) { return o.user == 'barney'; });\n     * // => 0\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findIndex(users, { 'user': 'fred', 'active': false });\n     * // => 1\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findIndex(users, ['active', false]);\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findIndex(users, 'active');\n     * // => 2\n     */\n    function findIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = fromIndex == null ? 0 : toInteger(fromIndex);\n      if (index < 0) {\n        index = nativeMax(length + index, 0);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index);\n    }\n\n    /**\n     * This method is like `_.findIndex` except that it iterates over elements\n     * of `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the found element, else `-1`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.findLastIndex(users, function(o) { return o.user == 'pebbles'; });\n     * // => 2\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastIndex(users, { 'user': 'barney', 'active': true });\n     * // => 0\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastIndex(users, ['active', false]);\n     * // => 2\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastIndex(users, 'active');\n     * // => 0\n     */\n    function findLastIndex(array, predicate, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length - 1;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = fromIndex < 0\n          ? nativeMax(length + index, 0)\n          : nativeMin(index, length - 1);\n      }\n      return baseFindIndex(array, getIteratee(predicate, 3), index, true);\n    }\n\n    /**\n     * Flattens `array` a single level deep.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flatten([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, [3, [4]], 5]\n     */\n    function flatten(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, 1) : [];\n    }\n\n    /**\n     * Recursively flattens `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * _.flattenDeep([1, [2, [3, [4]], 5]]);\n     * // => [1, 2, 3, 4, 5]\n     */\n    function flattenDeep(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseFlatten(array, INFINITY) : [];\n    }\n\n    /**\n     * Recursively flatten `array` up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Array\n     * @param {Array} array The array to flatten.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * var array = [1, [2, [3, [4]], 5]];\n     *\n     * _.flattenDepth(array, 1);\n     * // => [1, 2, [3, [4]], 5]\n     *\n     * _.flattenDepth(array, 2);\n     * // => [1, 2, 3, [4], 5]\n     */\n    function flattenDepth(array, depth) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(array, depth);\n    }\n\n    /**\n     * The inverse of `_.toPairs`; this method returns an object composed\n     * from key-value `pairs`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} pairs The key-value pairs.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.fromPairs([['a', 1], ['b', 2]]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function fromPairs(pairs) {\n      var index = -1,\n          length = pairs == null ? 0 : pairs.length,\n          result = {};\n\n      while (++index < length) {\n        var pair = pairs[index];\n        result[pair[0]] = pair[1];\n      }\n      return result;\n    }\n\n    /**\n     * Gets the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias first\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the first element of `array`.\n     * @example\n     *\n     * _.head([1, 2, 3]);\n     * // => 1\n     *\n     * _.head([]);\n     * // => undefined\n     */\n    function head(array) {\n      return (array && array.length) ? array[0] : undefined;\n    }\n\n    /**\n     * Gets the index at which the first occurrence of `value` is found in `array`\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. If `fromIndex` is negative, it's used as the\n     * offset from the end of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.indexOf([1, 2, 1, 2], 2);\n     * // => 1\n     *\n     * // Search from the `fromIndex`.\n     * _.indexOf([1, 2, 1, 2], 2, 2);\n     * // => 3\n     */\n    function indexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = fromIndex == null ? 0 : toInteger(fromIndex);\n      if (index < 0) {\n        index = nativeMax(length + index, 0);\n      }\n      return baseIndexOf(array, value, index);\n    }\n\n    /**\n     * Gets all but the last element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.initial([1, 2, 3]);\n     * // => [1, 2]\n     */\n    function initial(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 0, -1) : [];\n    }\n\n    /**\n     * Creates an array of unique values that are included in all given arrays\n     * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons. The order and references of result values are\n     * determined by the first array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersection([2, 1], [2, 3]);\n     * // => [2]\n     */\n    var intersection = baseRest(function(arrays) {\n      var mapped = arrayMap(arrays, castArrayLikeObject);\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped)\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `iteratee`\n     * which is invoked for each element of each `arrays` to generate the criterion\n     * by which they're compared. The order and references of result values are\n     * determined by the first array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * _.intersectionBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [2.1]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.intersectionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }]\n     */\n    var intersectionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      if (iteratee === last(mapped)) {\n        iteratee = undefined;\n      } else {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, getIteratee(iteratee, 2))\n        : [];\n    });\n\n    /**\n     * This method is like `_.intersection` except that it accepts `comparator`\n     * which is invoked to compare elements of `arrays`. The order and references\n     * of result values are determined by the first array. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of intersecting values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.intersectionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }]\n     */\n    var intersectionWith = baseRest(function(arrays) {\n      var comparator = last(arrays),\n          mapped = arrayMap(arrays, castArrayLikeObject);\n\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      if (comparator) {\n        mapped.pop();\n      }\n      return (mapped.length && mapped[0] === arrays[0])\n        ? baseIntersection(mapped, undefined, comparator)\n        : [];\n    });\n\n    /**\n     * Converts all elements in `array` into a string separated by `separator`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to convert.\n     * @param {string} [separator=','] The element separator.\n     * @returns {string} Returns the joined string.\n     * @example\n     *\n     * _.join(['a', 'b', 'c'], '~');\n     * // => 'a~b~c'\n     */\n    function join(array, separator) {\n      return array == null ? '' : nativeJoin.call(array, separator);\n    }\n\n    /**\n     * Gets the last element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {*} Returns the last element of `array`.\n     * @example\n     *\n     * _.last([1, 2, 3]);\n     * // => 3\n     */\n    function last(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? array[length - 1] : undefined;\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it iterates over elements of\n     * `array` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=array.length-1] The index to search from.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.lastIndexOf([1, 2, 1, 2], 2);\n     * // => 3\n     *\n     * // Search from the `fromIndex`.\n     * _.lastIndexOf([1, 2, 1, 2], 2, 2);\n     * // => 1\n     */\n    function lastIndexOf(array, value, fromIndex) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return -1;\n      }\n      var index = length;\n      if (fromIndex !== undefined) {\n        index = toInteger(fromIndex);\n        index = index < 0 ? nativeMax(length + index, 0) : nativeMin(index, length - 1);\n      }\n      return value === value\n        ? strictLastIndexOf(array, value, index)\n        : baseFindIndex(array, baseIsNaN, index, true);\n    }\n\n    /**\n     * Gets the element at index `n` of `array`. If `n` is negative, the nth\n     * element from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.11.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=0] The index of the element to return.\n     * @returns {*} Returns the nth element of `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     *\n     * _.nth(array, 1);\n     * // => 'b'\n     *\n     * _.nth(array, -2);\n     * // => 'c';\n     */\n    function nth(array, n) {\n      return (array && array.length) ? baseNth(array, toInteger(n)) : undefined;\n    }\n\n    /**\n     * Removes all given values from `array` using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.without`, this method mutates `array`. Use `_.remove`\n     * to remove elements from an array by predicate.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...*} [values] The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pull(array, 'a', 'c');\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    var pull = baseRest(pullAll);\n\n    /**\n     * This method is like `_.pull` except that it accepts an array of values to remove.\n     *\n     * **Note:** Unlike `_.difference`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'a', 'b', 'c'];\n     *\n     * _.pullAll(array, ['a', 'c']);\n     * console.log(array);\n     * // => ['b', 'b']\n     */\n    function pullAll(array, values) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values)\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `iteratee` which is\n     * invoked for each element of `array` and `values` to generate the criterion\n     * by which they're compared. The iteratee is invoked with one argument: (value).\n     *\n     * **Note:** Unlike `_.differenceBy`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1 }, { 'x': 2 }, { 'x': 3 }, { 'x': 1 }];\n     *\n     * _.pullAllBy(array, [{ 'x': 1 }, { 'x': 3 }], 'x');\n     * console.log(array);\n     * // => [{ 'x': 2 }]\n     */\n    function pullAllBy(array, values, iteratee) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, getIteratee(iteratee, 2))\n        : array;\n    }\n\n    /**\n     * This method is like `_.pullAll` except that it accepts `comparator` which\n     * is invoked to compare elements of `array` to `values`. The comparator is\n     * invoked with two arguments: (arrVal, othVal).\n     *\n     * **Note:** Unlike `_.differenceWith`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Array} values The values to remove.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [{ 'x': 1, 'y': 2 }, { 'x': 3, 'y': 4 }, { 'x': 5, 'y': 6 }];\n     *\n     * _.pullAllWith(array, [{ 'x': 3, 'y': 4 }], _.isEqual);\n     * console.log(array);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 5, 'y': 6 }]\n     */\n    function pullAllWith(array, values, comparator) {\n      return (array && array.length && values && values.length)\n        ? basePullAll(array, values, undefined, comparator)\n        : array;\n    }\n\n    /**\n     * Removes elements from `array` corresponding to `indexes` and returns an\n     * array of removed elements.\n     *\n     * **Note:** Unlike `_.at`, this method mutates `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {...(number|number[])} [indexes] The indexes of elements to remove.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = ['a', 'b', 'c', 'd'];\n     * var pulled = _.pullAt(array, [1, 3]);\n     *\n     * console.log(array);\n     * // => ['a', 'c']\n     *\n     * console.log(pulled);\n     * // => ['b', 'd']\n     */\n    var pullAt = flatRest(function(array, indexes) {\n      var length = array == null ? 0 : array.length,\n          result = baseAt(array, indexes);\n\n      basePullAt(array, arrayMap(indexes, function(index) {\n        return isIndex(index, length) ? +index : index;\n      }).sort(compareAscending));\n\n      return result;\n    });\n\n    /**\n     * Removes all elements from `array` that `predicate` returns truthy for\n     * and returns an array of the removed elements. The predicate is invoked\n     * with three arguments: (value, index, array).\n     *\n     * **Note:** Unlike `_.filter`, this method mutates `array`. Use `_.pull`\n     * to pull elements from an array by value.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new array of removed elements.\n     * @example\n     *\n     * var array = [1, 2, 3, 4];\n     * var evens = _.remove(array, function(n) {\n     *   return n % 2 == 0;\n     * });\n     *\n     * console.log(array);\n     * // => [1, 3]\n     *\n     * console.log(evens);\n     * // => [2, 4]\n     */\n    function remove(array, predicate) {\n      var result = [];\n      if (!(array && array.length)) {\n        return result;\n      }\n      var index = -1,\n          indexes = [],\n          length = array.length;\n\n      predicate = getIteratee(predicate, 3);\n      while (++index < length) {\n        var value = array[index];\n        if (predicate(value, index, array)) {\n          result.push(value);\n          indexes.push(index);\n        }\n      }\n      basePullAt(array, indexes);\n      return result;\n    }\n\n    /**\n     * Reverses `array` so that the first element becomes the last, the second\n     * element becomes the second to last, and so on.\n     *\n     * **Note:** This method mutates `array` and is based on\n     * [`Array#reverse`](https://mdn.io/Array/reverse).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to modify.\n     * @returns {Array} Returns `array`.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _.reverse(array);\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function reverse(array) {\n      return array == null ? array : nativeReverse.call(array);\n    }\n\n    /**\n     * Creates a slice of `array` from `start` up to, but not including, `end`.\n     *\n     * **Note:** This method is used instead of\n     * [`Array#slice`](https://mdn.io/Array/slice) to ensure dense arrays are\n     * returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to slice.\n     * @param {number} [start=0] The start position.\n     * @param {number} [end=array.length] The end position.\n     * @returns {Array} Returns the slice of `array`.\n     */\n    function slice(array, start, end) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      if (end && typeof end != 'number' && isIterateeCall(array, start, end)) {\n        start = 0;\n        end = length;\n      }\n      else {\n        start = start == null ? 0 : toInteger(start);\n        end = end === undefined ? length : toInteger(end);\n      }\n      return baseSlice(array, start, end);\n    }\n\n    /**\n     * Uses a binary search to determine the lowest index at which `value`\n     * should be inserted into `array` in order to maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedIndex([30, 50], 40);\n     * // => 1\n     */\n    function sortedIndex(array, value) {\n      return baseSortedIndex(array, value);\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 0\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 0\n     */\n    function sortedIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * This method is like `_.indexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 1\n     */\n    function sortedIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value);\n        if (index < length && eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.sortedIndex` except that it returns the highest\n     * index at which `value` should be inserted into `array` in order to\n     * maintain its sort order.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * _.sortedLastIndex([4, 5, 5, 5, 6], 5);\n     * // => 4\n     */\n    function sortedLastIndex(array, value) {\n      return baseSortedIndex(array, value, true);\n    }\n\n    /**\n     * This method is like `_.sortedLastIndex` except that it accepts `iteratee`\n     * which is invoked for `value` and each element of `array` to compute their\n     * sort ranking. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The sorted array to inspect.\n     * @param {*} value The value to evaluate.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the index at which `value` should be inserted\n     *  into `array`.\n     * @example\n     *\n     * var objects = [{ 'x': 4 }, { 'x': 5 }];\n     *\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, function(o) { return o.x; });\n     * // => 1\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sortedLastIndexBy(objects, { 'x': 4 }, 'x');\n     * // => 1\n     */\n    function sortedLastIndexBy(array, value, iteratee) {\n      return baseSortedIndexBy(array, value, getIteratee(iteratee, 2), true);\n    }\n\n    /**\n     * This method is like `_.lastIndexOf` except that it performs a binary\n     * search on a sorted `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {*} value The value to search for.\n     * @returns {number} Returns the index of the matched value, else `-1`.\n     * @example\n     *\n     * _.sortedLastIndexOf([4, 5, 5, 5, 6], 5);\n     * // => 3\n     */\n    function sortedLastIndexOf(array, value) {\n      var length = array == null ? 0 : array.length;\n      if (length) {\n        var index = baseSortedIndex(array, value, true) - 1;\n        if (eq(array[index], value)) {\n          return index;\n        }\n      }\n      return -1;\n    }\n\n    /**\n     * This method is like `_.uniq` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniq([1, 1, 2]);\n     * // => [1, 2]\n     */\n    function sortedUniq(array) {\n      return (array && array.length)\n        ? baseSortedUniq(array)\n        : [];\n    }\n\n    /**\n     * This method is like `_.uniqBy` except that it's designed and optimized\n     * for sorted arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.sortedUniqBy([1.1, 1.2, 2.3, 2.4], Math.floor);\n     * // => [1.1, 2.3]\n     */\n    function sortedUniqBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSortedUniq(array, getIteratee(iteratee, 2))\n        : [];\n    }\n\n    /**\n     * Gets all but the first element of `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.tail([1, 2, 3]);\n     * // => [2, 3]\n     */\n    function tail(array) {\n      var length = array == null ? 0 : array.length;\n      return length ? baseSlice(array, 1, length) : [];\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the beginning.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.take([1, 2, 3]);\n     * // => [1]\n     *\n     * _.take([1, 2, 3], 2);\n     * // => [1, 2]\n     *\n     * _.take([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.take([1, 2, 3], 0);\n     * // => []\n     */\n    function take(array, n, guard) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      return baseSlice(array, 0, n < 0 ? 0 : n);\n    }\n\n    /**\n     * Creates a slice of `array` with `n` elements taken from the end.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {number} [n=1] The number of elements to take.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * _.takeRight([1, 2, 3]);\n     * // => [3]\n     *\n     * _.takeRight([1, 2, 3], 2);\n     * // => [2, 3]\n     *\n     * _.takeRight([1, 2, 3], 5);\n     * // => [1, 2, 3]\n     *\n     * _.takeRight([1, 2, 3], 0);\n     * // => []\n     */\n    function takeRight(array, n, guard) {\n      var length = array == null ? 0 : array.length;\n      if (!length) {\n        return [];\n      }\n      n = (guard || n === undefined) ? 1 : toInteger(n);\n      n = length - n;\n      return baseSlice(array, n < 0 ? 0 : n, length);\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the end. Elements are\n     * taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': true },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': false }\n     * ];\n     *\n     * _.takeRightWhile(users, function(o) { return !o.active; });\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeRightWhile(users, { 'user': 'pebbles', 'active': false });\n     * // => objects for ['pebbles']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeRightWhile(users, ['active', false]);\n     * // => objects for ['fred', 'pebbles']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeRightWhile(users, 'active');\n     * // => []\n     */\n    function takeRightWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3), false, true)\n        : [];\n    }\n\n    /**\n     * Creates a slice of `array` with elements taken from the beginning. Elements\n     * are taken until `predicate` returns falsey. The predicate is invoked with\n     * three arguments: (value, index, array).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Array\n     * @param {Array} array The array to query.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the slice of `array`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'active': false },\n     *   { 'user': 'fred',    'active': false },\n     *   { 'user': 'pebbles', 'active': true }\n     * ];\n     *\n     * _.takeWhile(users, function(o) { return !o.active; });\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.takeWhile(users, { 'user': 'barney', 'active': false });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.takeWhile(users, ['active', false]);\n     * // => objects for ['barney', 'fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.takeWhile(users, 'active');\n     * // => []\n     */\n    function takeWhile(array, predicate) {\n      return (array && array.length)\n        ? baseWhile(array, getIteratee(predicate, 3))\n        : [];\n    }\n\n    /**\n     * Creates an array of unique values, in order, from all given arrays using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.union([2], [1, 2]);\n     * // => [2, 1]\n     */\n    var union = baseRest(function(arrays) {\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which uniqueness is computed. Result values are chosen from the first\n     * array in which the value occurs. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * _.unionBy([2.1], [1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.unionBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    var unionBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.union` except that it accepts `comparator` which\n     * is invoked to compare elements of `arrays`. Result values are chosen from\n     * the first array in which the value occurs. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of combined values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.unionWith(objects, others, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var unionWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true), undefined, comparator);\n    });\n\n    /**\n     * Creates a duplicate-free version of an array, using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons, in which only the first occurrence of each element\n     * is kept. The order of result values is determined by the order they occur\n     * in the array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniq([2, 1, 2]);\n     * // => [2, 1]\n     */\n    function uniq(array) {\n      return (array && array.length) ? baseUniq(array) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * uniqueness is computed. The order of result values is determined by the\n     * order they occur in the array. The iteratee is invoked with one argument:\n     * (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * _.uniqBy([2.1, 1.2, 2.3], Math.floor);\n     * // => [2.1, 1.2]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.uniqBy([{ 'x': 1 }, { 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 1 }, { 'x': 2 }]\n     */\n    function uniqBy(array, iteratee) {\n      return (array && array.length) ? baseUniq(array, getIteratee(iteratee, 2)) : [];\n    }\n\n    /**\n     * This method is like `_.uniq` except that it accepts `comparator` which\n     * is invoked to compare elements of `array`. The order of result values is\n     * determined by the order they occur in the array.The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new duplicate free array.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.uniqWith(objects, _.isEqual);\n     * // => [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }]\n     */\n    function uniqWith(array, comparator) {\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return (array && array.length) ? baseUniq(array, undefined, comparator) : [];\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts an array of grouped\n     * elements and creates an array regrouping the elements to their pre-zip\n     * configuration.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.2.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     *\n     * _.unzip(zipped);\n     * // => [['a', 'b'], [1, 2], [true, false]]\n     */\n    function unzip(array) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var length = 0;\n      array = arrayFilter(array, function(group) {\n        if (isArrayLikeObject(group)) {\n          length = nativeMax(group.length, length);\n          return true;\n        }\n      });\n      return baseTimes(length, function(index) {\n        return arrayMap(array, baseProperty(index));\n      });\n    }\n\n    /**\n     * This method is like `_.unzip` except that it accepts `iteratee` to specify\n     * how regrouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {Array} array The array of grouped elements to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  regrouped values.\n     * @returns {Array} Returns the new array of regrouped elements.\n     * @example\n     *\n     * var zipped = _.zip([1, 2], [10, 20], [100, 200]);\n     * // => [[1, 10, 100], [2, 20, 200]]\n     *\n     * _.unzipWith(zipped, _.add);\n     * // => [3, 30, 300]\n     */\n    function unzipWith(array, iteratee) {\n      if (!(array && array.length)) {\n        return [];\n      }\n      var result = unzip(array);\n      if (iteratee == null) {\n        return result;\n      }\n      return arrayMap(result, function(group) {\n        return apply(iteratee, undefined, group);\n      });\n    }\n\n    /**\n     * Creates an array excluding all given values using\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * for equality comparisons.\n     *\n     * **Note:** Unlike `_.pull`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {Array} array The array to inspect.\n     * @param {...*} [values] The values to exclude.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.xor\n     * @example\n     *\n     * _.without([2, 1, 2, 3], 1, 2);\n     * // => [3]\n     */\n    var without = baseRest(function(array, values) {\n      return isArrayLikeObject(array)\n        ? baseDifference(array, values)\n        : [];\n    });\n\n    /**\n     * Creates an array of unique values that is the\n     * [symmetric difference](https://en.wikipedia.org/wiki/Symmetric_difference)\n     * of the given arrays. The order of result values is determined by the order\n     * they occur in the arrays.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @returns {Array} Returns the new array of filtered values.\n     * @see _.difference, _.without\n     * @example\n     *\n     * _.xor([2, 1], [2, 3]);\n     * // => [1, 3]\n     */\n    var xor = baseRest(function(arrays) {\n      return baseXor(arrayFilter(arrays, isArrayLikeObject));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `iteratee` which is\n     * invoked for each element of each `arrays` to generate the criterion by\n     * which by which they're compared. The order of result values is determined\n     * by the order they occur in the arrays. The iteratee is invoked with one\n     * argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * _.xorBy([2.1, 1.2], [2.3, 3.4], Math.floor);\n     * // => [1.2, 3.4]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.xorBy([{ 'x': 1 }], [{ 'x': 2 }, { 'x': 1 }], 'x');\n     * // => [{ 'x': 2 }]\n     */\n    var xorBy = baseRest(function(arrays) {\n      var iteratee = last(arrays);\n      if (isArrayLikeObject(iteratee)) {\n        iteratee = undefined;\n      }\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), getIteratee(iteratee, 2));\n    });\n\n    /**\n     * This method is like `_.xor` except that it accepts `comparator` which is\n     * invoked to compare elements of `arrays`. The order of result values is\n     * determined by the order they occur in the arrays. The comparator is invoked\n     * with two arguments: (arrVal, othVal).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to inspect.\n     * @param {Function} [comparator] The comparator invoked per element.\n     * @returns {Array} Returns the new array of filtered values.\n     * @example\n     *\n     * var objects = [{ 'x': 1, 'y': 2 }, { 'x': 2, 'y': 1 }];\n     * var others = [{ 'x': 1, 'y': 1 }, { 'x': 1, 'y': 2 }];\n     *\n     * _.xorWith(objects, others, _.isEqual);\n     * // => [{ 'x': 2, 'y': 1 }, { 'x': 1, 'y': 1 }]\n     */\n    var xorWith = baseRest(function(arrays) {\n      var comparator = last(arrays);\n      comparator = typeof comparator == 'function' ? comparator : undefined;\n      return baseXor(arrayFilter(arrays, isArrayLikeObject), undefined, comparator);\n    });\n\n    /**\n     * Creates an array of grouped elements, the first of which contains the\n     * first elements of the given arrays, the second of which contains the\n     * second elements of the given arrays, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zip(['a', 'b'], [1, 2], [true, false]);\n     * // => [['a', 1, true], ['b', 2, false]]\n     */\n    var zip = baseRest(unzip);\n\n    /**\n     * This method is like `_.fromPairs` except that it accepts two arrays,\n     * one of property identifiers and one of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.4.0\n     * @category Array\n     * @param {Array} [props=[]] The property identifiers.\n     * @param {Array} [values=[]] The property values.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.zipObject(['a', 'b'], [1, 2]);\n     * // => { 'a': 1, 'b': 2 }\n     */\n    function zipObject(props, values) {\n      return baseZipObject(props || [], values || [], assignValue);\n    }\n\n    /**\n     * This method is like `_.zipObject` except that it supports property paths.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Array\n     * @param {Array} [props=[]] The property identifiers.\n     * @param {Array} [values=[]] The property values.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * _.zipObjectDeep(['a.b[0].c', 'a.b[1].d'], [1, 2]);\n     * // => { 'a': { 'b': [{ 'c': 1 }, { 'd': 2 }] } }\n     */\n    function zipObjectDeep(props, values) {\n      return baseZipObject(props || [], values || [], baseSet);\n    }\n\n    /**\n     * This method is like `_.zip` except that it accepts `iteratee` to specify\n     * how grouped values should be combined. The iteratee is invoked with the\n     * elements of each group: (...group).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Array\n     * @param {...Array} [arrays] The arrays to process.\n     * @param {Function} [iteratee=_.identity] The function to combine\n     *  grouped values.\n     * @returns {Array} Returns the new array of grouped elements.\n     * @example\n     *\n     * _.zipWith([1, 2], [10, 20], [100, 200], function(a, b, c) {\n     *   return a + b + c;\n     * });\n     * // => [111, 222]\n     */\n    var zipWith = baseRest(function(arrays) {\n      var length = arrays.length,\n          iteratee = length > 1 ? arrays[length - 1] : undefined;\n\n      iteratee = typeof iteratee == 'function' ? (arrays.pop(), iteratee) : undefined;\n      return unzipWith(arrays, iteratee);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates a `lodash` wrapper instance that wraps `value` with explicit method\n     * chain sequences enabled. The result of such sequences must be unwrapped\n     * with `_#value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Seq\n     * @param {*} value The value to wrap.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36 },\n     *   { 'user': 'fred',    'age': 40 },\n     *   { 'user': 'pebbles', 'age': 1 }\n     * ];\n     *\n     * var youngest = _\n     *   .chain(users)\n     *   .sortBy('age')\n     *   .map(function(o) {\n     *     return o.user + ' is ' + o.age;\n     *   })\n     *   .head()\n     *   .value();\n     * // => 'pebbles is 1'\n     */\n    function chain(value) {\n      var result = lodash(value);\n      result.__chain__ = true;\n      return result;\n    }\n\n    /**\n     * This method invokes `interceptor` and returns `value`. The interceptor\n     * is invoked with one argument; (value). The purpose of this method is to\n     * \"tap into\" a method chain sequence in order to modify intermediate results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * _([1, 2, 3])\n     *  .tap(function(array) {\n     *    // Mutate input array.\n     *    array.pop();\n     *  })\n     *  .reverse()\n     *  .value();\n     * // => [2, 1]\n     */\n    function tap(value, interceptor) {\n      interceptor(value);\n      return value;\n    }\n\n    /**\n     * This method is like `_.tap` except that it returns the result of `interceptor`.\n     * The purpose of this method is to \"pass thru\" values replacing intermediate\n     * results in a method chain sequence.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Seq\n     * @param {*} value The value to provide to `interceptor`.\n     * @param {Function} interceptor The function to invoke.\n     * @returns {*} Returns the result of `interceptor`.\n     * @example\n     *\n     * _('  abc  ')\n     *  .chain()\n     *  .trim()\n     *  .thru(function(value) {\n     *    return [value];\n     *  })\n     *  .value();\n     * // => ['abc']\n     */\n    function thru(value, interceptor) {\n      return interceptor(value);\n    }\n\n    /**\n     * This method is the wrapper version of `_.at`.\n     *\n     * @name at\n     * @memberOf _\n     * @since 1.0.0\n     * @category Seq\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _(object).at(['a[0].b.c', 'a[1]']).value();\n     * // => [3, 4]\n     */\n    var wrapperAt = flatRest(function(paths) {\n      var length = paths.length,\n          start = length ? paths[0] : 0,\n          value = this.__wrapped__,\n          interceptor = function(object) { return baseAt(object, paths); };\n\n      if (length > 1 || this.__actions__.length ||\n          !(value instanceof LazyWrapper) || !isIndex(start)) {\n        return this.thru(interceptor);\n      }\n      value = value.slice(start, +start + (length ? 1 : 0));\n      value.__actions__.push({\n        'func': thru,\n        'args': [interceptor],\n        'thisArg': undefined\n      });\n      return new LodashWrapper(value, this.__chain__).thru(function(array) {\n        if (length && !array.length) {\n          array.push(undefined);\n        }\n        return array;\n      });\n    });\n\n    /**\n     * Creates a `lodash` wrapper instance with explicit method chain sequences enabled.\n     *\n     * @name chain\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 40 }\n     * ];\n     *\n     * // A sequence without explicit chaining.\n     * _(users).head();\n     * // => { 'user': 'barney', 'age': 36 }\n     *\n     * // A sequence with explicit chaining.\n     * _(users)\n     *   .chain()\n     *   .head()\n     *   .pick('user')\n     *   .value();\n     * // => { 'user': 'barney' }\n     */\n    function wrapperChain() {\n      return chain(this);\n    }\n\n    /**\n     * Executes the chain sequence and returns the wrapped result.\n     *\n     * @name commit\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2];\n     * var wrapped = _(array).push(3);\n     *\n     * console.log(array);\n     * // => [1, 2]\n     *\n     * wrapped = wrapped.commit();\n     * console.log(array);\n     * // => [1, 2, 3]\n     *\n     * wrapped.last();\n     * // => 3\n     *\n     * console.log(array);\n     * // => [1, 2, 3]\n     */\n    function wrapperCommit() {\n      return new LodashWrapper(this.value(), this.__chain__);\n    }\n\n    /**\n     * Gets the next value on a wrapped object following the\n     * [iterator protocol](https://mdn.io/iteration_protocols#iterator).\n     *\n     * @name next\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the next iterator value.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 1 }\n     *\n     * wrapped.next();\n     * // => { 'done': false, 'value': 2 }\n     *\n     * wrapped.next();\n     * // => { 'done': true, 'value': undefined }\n     */\n    function wrapperNext() {\n      if (this.__values__ === undefined) {\n        this.__values__ = toArray(this.value());\n      }\n      var done = this.__index__ >= this.__values__.length,\n          value = done ? undefined : this.__values__[this.__index__++];\n\n      return { 'done': done, 'value': value };\n    }\n\n    /**\n     * Enables the wrapper to be iterable.\n     *\n     * @name Symbol.iterator\n     * @memberOf _\n     * @since 4.0.0\n     * @category Seq\n     * @returns {Object} Returns the wrapper object.\n     * @example\n     *\n     * var wrapped = _([1, 2]);\n     *\n     * wrapped[Symbol.iterator]() === wrapped;\n     * // => true\n     *\n     * Array.from(wrapped);\n     * // => [1, 2]\n     */\n    function wrapperToIterator() {\n      return this;\n    }\n\n    /**\n     * Creates a clone of the chain sequence planting `value` as the wrapped value.\n     *\n     * @name plant\n     * @memberOf _\n     * @since 3.2.0\n     * @category Seq\n     * @param {*} value The value to plant.\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var wrapped = _([1, 2]).map(square);\n     * var other = wrapped.plant([3, 4]);\n     *\n     * other.value();\n     * // => [9, 16]\n     *\n     * wrapped.value();\n     * // => [1, 4]\n     */\n    function wrapperPlant(value) {\n      var result,\n          parent = this;\n\n      while (parent instanceof baseLodash) {\n        var clone = wrapperClone(parent);\n        clone.__index__ = 0;\n        clone.__values__ = undefined;\n        if (result) {\n          previous.__wrapped__ = clone;\n        } else {\n          result = clone;\n        }\n        var previous = clone;\n        parent = parent.__wrapped__;\n      }\n      previous.__wrapped__ = value;\n      return result;\n    }\n\n    /**\n     * This method is the wrapper version of `_.reverse`.\n     *\n     * **Note:** This method mutates the wrapped array.\n     *\n     * @name reverse\n     * @memberOf _\n     * @since 0.1.0\n     * @category Seq\n     * @returns {Object} Returns the new `lodash` wrapper instance.\n     * @example\n     *\n     * var array = [1, 2, 3];\n     *\n     * _(array).reverse().value()\n     * // => [3, 2, 1]\n     *\n     * console.log(array);\n     * // => [3, 2, 1]\n     */\n    function wrapperReverse() {\n      var value = this.__wrapped__;\n      if (value instanceof LazyWrapper) {\n        var wrapped = value;\n        if (this.__actions__.length) {\n          wrapped = new LazyWrapper(this);\n        }\n        wrapped = wrapped.reverse();\n        wrapped.__actions__.push({\n          'func': thru,\n          'args': [reverse],\n          'thisArg': undefined\n        });\n        return new LodashWrapper(wrapped, this.__chain__);\n      }\n      return this.thru(reverse);\n    }\n\n    /**\n     * Executes the chain sequence to resolve the unwrapped value.\n     *\n     * @name value\n     * @memberOf _\n     * @since 0.1.0\n     * @alias toJSON, valueOf\n     * @category Seq\n     * @returns {*} Returns the resolved unwrapped value.\n     * @example\n     *\n     * _([1, 2, 3]).value();\n     * // => [1, 2, 3]\n     */\n    function wrapperValue() {\n      return baseWrapperValue(this.__wrapped__, this.__actions__);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the number of times the key was returned by `iteratee`. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.countBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': 1, '6': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.countBy(['one', 'two', 'three'], 'length');\n     * // => { '3': 2, '5': 1 }\n     */\n    var countBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        ++result[key];\n      } else {\n        baseAssignValue(result, key, 1);\n      }\n    });\n\n    /**\n     * Checks if `predicate` returns truthy for **all** elements of `collection`.\n     * Iteration is stopped once `predicate` returns falsey. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * **Note:** This method returns `true` for\n     * [empty collections](https://en.wikipedia.org/wiki/Empty_set) because\n     * [everything is true](https://en.wikipedia.org/wiki/Vacuous_truth) of\n     * elements of empty collections.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if all elements pass the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.every([true, 1, null, 'yes'], Boolean);\n     * // => false\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.every(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.every(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.every(users, 'active');\n     * // => false\n     */\n    function every(collection, predicate, guard) {\n      var func = isArray(collection) ? arrayEvery : baseEvery;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning an array of all elements\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * **Note:** Unlike `_.remove`, this method returns a new array.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.reject\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * _.filter(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, { 'age': 36, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.filter(users, 'active');\n     * // => objects for ['barney']\n     *\n     * // Combining several predicates using `_.overEvery` or `_.overSome`.\n     * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n     * // => objects for ['fred', 'barney']\n     */\n    function filter(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Iterates over elements of `collection`, returning the first element\n     * `predicate` returns truthy for. The predicate is invoked with three\n     * arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': true },\n     *   { 'user': 'fred',    'age': 40, 'active': false },\n     *   { 'user': 'pebbles', 'age': 1,  'active': true }\n     * ];\n     *\n     * _.find(users, function(o) { return o.age < 40; });\n     * // => object for 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.find(users, { 'age': 1, 'active': true });\n     * // => object for 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.find(users, ['active', false]);\n     * // => object for 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.find(users, 'active');\n     * // => object for 'barney'\n     */\n    var find = createFind(findIndex);\n\n    /**\n     * This method is like `_.find` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param {number} [fromIndex=collection.length-1] The index to search from.\n     * @returns {*} Returns the matched element, else `undefined`.\n     * @example\n     *\n     * _.findLast([1, 2, 3, 4], function(n) {\n     *   return n % 2 == 1;\n     * });\n     * // => 3\n     */\n    var findLast = createFind(findLastIndex);\n\n    /**\n     * Creates a flattened array of values by running each element in `collection`\n     * thru `iteratee` and flattening the mapped results. The iteratee is invoked\n     * with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [n, n];\n     * }\n     *\n     * _.flatMap([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMap(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), 1);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDeep([1, 2], duplicate);\n     * // => [1, 1, 2, 2]\n     */\n    function flatMapDeep(collection, iteratee) {\n      return baseFlatten(map(collection, iteratee), INFINITY);\n    }\n\n    /**\n     * This method is like `_.flatMap` except that it recursively flattens the\n     * mapped results up to `depth` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {number} [depth=1] The maximum recursion depth.\n     * @returns {Array} Returns the new flattened array.\n     * @example\n     *\n     * function duplicate(n) {\n     *   return [[[n, n]]];\n     * }\n     *\n     * _.flatMapDepth([1, 2], duplicate, 2);\n     * // => [[1, 1], [2, 2]]\n     */\n    function flatMapDepth(collection, iteratee, depth) {\n      depth = depth === undefined ? 1 : toInteger(depth);\n      return baseFlatten(map(collection, iteratee), depth);\n    }\n\n    /**\n     * Iterates over elements of `collection` and invokes `iteratee` for each element.\n     * The iteratee is invoked with three arguments: (value, index|key, collection).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n     * property are iterated like arrays. To avoid this behavior use `_.forIn`\n     * or `_.forOwn` for object iteration.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @alias each\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEachRight\n     * @example\n     *\n     * _.forEach([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `1` then `2`.\n     *\n     * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forEach(collection, iteratee) {\n      var func = isArray(collection) ? arrayEach : baseEach;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forEach` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @alias eachRight\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array|Object} Returns `collection`.\n     * @see _.forEach\n     * @example\n     *\n     * _.forEachRight([1, 2], function(value) {\n     *   console.log(value);\n     * });\n     * // => Logs `2` then `1`.\n     */\n    function forEachRight(collection, iteratee) {\n      var func = isArray(collection) ? arrayEachRight : baseEachRight;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The order of grouped values\n     * is determined by the order they occur in `collection`. The corresponding\n     * value of each key is an array of elements responsible for generating the\n     * key. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * _.groupBy([6.1, 4.2, 6.3], Math.floor);\n     * // => { '4': [4.2], '6': [6.1, 6.3] }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.groupBy(['one', 'two', 'three'], 'length');\n     * // => { '3': ['one', 'two'], '5': ['three'] }\n     */\n    var groupBy = createAggregator(function(result, value, key) {\n      if (hasOwnProperty.call(result, key)) {\n        result[key].push(value);\n      } else {\n        baseAssignValue(result, key, [value]);\n      }\n    });\n\n    /**\n     * Checks if `value` is in `collection`. If `collection` is a string, it's\n     * checked for a substring of `value`, otherwise\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * is used for equality comparisons. If `fromIndex` is negative, it's used as\n     * the offset from the end of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @param {*} value The value to search for.\n     * @param {number} [fromIndex=0] The index to search from.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {boolean} Returns `true` if `value` is found, else `false`.\n     * @example\n     *\n     * _.includes([1, 2, 3], 1);\n     * // => true\n     *\n     * _.includes([1, 2, 3], 1, 2);\n     * // => false\n     *\n     * _.includes({ 'a': 1, 'b': 2 }, 1);\n     * // => true\n     *\n     * _.includes('abcd', 'bc');\n     * // => true\n     */\n    function includes(collection, value, fromIndex, guard) {\n      collection = isArrayLike(collection) ? collection : values(collection);\n      fromIndex = (fromIndex && !guard) ? toInteger(fromIndex) : 0;\n\n      var length = collection.length;\n      if (fromIndex < 0) {\n        fromIndex = nativeMax(length + fromIndex, 0);\n      }\n      return isString(collection)\n        ? (fromIndex <= length && collection.indexOf(value, fromIndex) > -1)\n        : (!!length && baseIndexOf(collection, value, fromIndex) > -1);\n    }\n\n    /**\n     * Invokes the method at `path` of each element in `collection`, returning\n     * an array of the results of each invoked method. Any additional arguments\n     * are provided to each invoked method. If `path` is a function, it's invoked\n     * for, and `this` bound to, each element in `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array|Function|string} path The path of the method to invoke or\n     *  the function invoked per iteration.\n     * @param {...*} [args] The arguments to invoke each method with.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.invokeMap([[5, 1, 7], [3, 2, 1]], 'sort');\n     * // => [[1, 5, 7], [1, 2, 3]]\n     *\n     * _.invokeMap([123, 456], String.prototype.split, '');\n     * // => [['1', '2', '3'], ['4', '5', '6']]\n     */\n    var invokeMap = baseRest(function(collection, path, args) {\n      var index = -1,\n          isFunc = typeof path == 'function',\n          result = isArrayLike(collection) ? Array(collection.length) : [];\n\n      baseEach(collection, function(value) {\n        result[++index] = isFunc ? apply(path, value, args) : baseInvoke(value, path, args);\n      });\n      return result;\n    });\n\n    /**\n     * Creates an object composed of keys generated from the results of running\n     * each element of `collection` thru `iteratee`. The corresponding value of\n     * each key is the last element responsible for generating the key. The\n     * iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee to transform keys.\n     * @returns {Object} Returns the composed aggregate object.\n     * @example\n     *\n     * var array = [\n     *   { 'dir': 'left', 'code': 97 },\n     *   { 'dir': 'right', 'code': 100 }\n     * ];\n     *\n     * _.keyBy(array, function(o) {\n     *   return String.fromCharCode(o.code);\n     * });\n     * // => { 'a': { 'dir': 'left', 'code': 97 }, 'd': { 'dir': 'right', 'code': 100 } }\n     *\n     * _.keyBy(array, 'dir');\n     * // => { 'left': { 'dir': 'left', 'code': 97 }, 'right': { 'dir': 'right', 'code': 100 } }\n     */\n    var keyBy = createAggregator(function(result, value, key) {\n      baseAssignValue(result, key, value);\n    });\n\n    /**\n     * Creates an array of values by running each element in `collection` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n     *\n     * The guarded methods are:\n     * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n     * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n     * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n     * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new mapped array.\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * _.map([4, 8], square);\n     * // => [16, 64]\n     *\n     * _.map({ 'a': 4, 'b': 8 }, square);\n     * // => [16, 64] (iteration order is not guaranteed)\n     *\n     * var users = [\n     *   { 'user': 'barney' },\n     *   { 'user': 'fred' }\n     * ];\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, 'user');\n     * // => ['barney', 'fred']\n     */\n    function map(collection, iteratee) {\n      var func = isArray(collection) ? arrayMap : baseMap;\n      return func(collection, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.sortBy` except that it allows specifying the sort\n     * orders of the iteratees to sort by. If `orders` is unspecified, all values\n     * are sorted in ascending order. Otherwise, specify an order of \"desc\" for\n     * descending or \"asc\" for ascending sort order of corresponding values.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Array[]|Function[]|Object[]|string[]} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @param {string[]} [orders] The sort orders of `iteratees`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.reduce`.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 34 },\n     *   { 'user': 'fred',   'age': 40 },\n     *   { 'user': 'barney', 'age': 36 }\n     * ];\n     *\n     * // Sort by `user` in ascending order and by `age` in descending order.\n     * _.orderBy(users, ['user', 'age'], ['asc', 'desc']);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 40]]\n     */\n    function orderBy(collection, iteratees, orders, guard) {\n      if (collection == null) {\n        return [];\n      }\n      if (!isArray(iteratees)) {\n        iteratees = iteratees == null ? [] : [iteratees];\n      }\n      orders = guard ? undefined : orders;\n      if (!isArray(orders)) {\n        orders = orders == null ? [] : [orders];\n      }\n      return baseOrderBy(collection, iteratees, orders);\n    }\n\n    /**\n     * Creates an array of elements split into two groups, the first of which\n     * contains elements `predicate` returns truthy for, the second of which\n     * contains elements `predicate` returns falsey for. The predicate is\n     * invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of grouped elements.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney',  'age': 36, 'active': false },\n     *   { 'user': 'fred',    'age': 40, 'active': true },\n     *   { 'user': 'pebbles', 'age': 1,  'active': false }\n     * ];\n     *\n     * _.partition(users, function(o) { return o.active; });\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.partition(users, { 'age': 1, 'active': false });\n     * // => objects for [['pebbles'], ['barney', 'fred']]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.partition(users, ['active', false]);\n     * // => objects for [['barney', 'pebbles'], ['fred']]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.partition(users, 'active');\n     * // => objects for [['fred'], ['barney', 'pebbles']]\n     */\n    var partition = createAggregator(function(result, value, key) {\n      result[key ? 0 : 1].push(value);\n    }, function() { return [[], []]; });\n\n    /**\n     * Reduces `collection` to a value which is the accumulated result of running\n     * each element in `collection` thru `iteratee`, where each successive\n     * invocation is supplied the return value of the previous. If `accumulator`\n     * is not given, the first element of `collection` is used as the initial\n     * value. The iteratee is invoked with four arguments:\n     * (accumulator, value, index|key, collection).\n     *\n     * Many lodash methods are guarded to work as iteratees for methods like\n     * `_.reduce`, `_.reduceRight`, and `_.transform`.\n     *\n     * The guarded methods are:\n     * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n     * and `sortBy`\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduceRight\n     * @example\n     *\n     * _.reduce([1, 2], function(sum, n) {\n     *   return sum + n;\n     * }, 0);\n     * // => 3\n     *\n     * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     *   return result;\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n     */\n    function reduce(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduce : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n    }\n\n    /**\n     * This method is like `_.reduce` except that it iterates over elements of\n     * `collection` from right to left.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The initial value.\n     * @returns {*} Returns the accumulated value.\n     * @see _.reduce\n     * @example\n     *\n     * var array = [[0, 1], [2, 3], [4, 5]];\n     *\n     * _.reduceRight(array, function(flattened, other) {\n     *   return flattened.concat(other);\n     * }, []);\n     * // => [4, 5, 2, 3, 0, 1]\n     */\n    function reduceRight(collection, iteratee, accumulator) {\n      var func = isArray(collection) ? arrayReduceRight : baseReduce,\n          initAccum = arguments.length < 3;\n\n      return func(collection, getIteratee(iteratee, 4), accumulator, initAccum, baseEachRight);\n    }\n\n    /**\n     * The opposite of `_.filter`; this method returns the elements of `collection`\n     * that `predicate` does **not** return truthy for.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the new filtered array.\n     * @see _.filter\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': false },\n     *   { 'user': 'fred',   'age': 40, 'active': true }\n     * ];\n     *\n     * _.reject(users, function(o) { return !o.active; });\n     * // => objects for ['fred']\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.reject(users, { 'age': 40, 'active': true });\n     * // => objects for ['barney']\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.reject(users, ['active', false]);\n     * // => objects for ['fred']\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.reject(users, 'active');\n     * // => objects for ['barney']\n     */\n    function reject(collection, predicate) {\n      var func = isArray(collection) ? arrayFilter : baseFilter;\n      return func(collection, negate(getIteratee(predicate, 3)));\n    }\n\n    /**\n     * Gets a random element from `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @returns {*} Returns the random element.\n     * @example\n     *\n     * _.sample([1, 2, 3, 4]);\n     * // => 2\n     */\n    function sample(collection) {\n      var func = isArray(collection) ? arraySample : baseSample;\n      return func(collection);\n    }\n\n    /**\n     * Gets `n` random elements at unique keys from `collection` up to the\n     * size of `collection`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to sample.\n     * @param {number} [n=1] The number of elements to sample.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the random elements.\n     * @example\n     *\n     * _.sampleSize([1, 2, 3], 2);\n     * // => [3, 1]\n     *\n     * _.sampleSize([1, 2, 3], 4);\n     * // => [2, 3, 1]\n     */\n    function sampleSize(collection, n, guard) {\n      if ((guard ? isIterateeCall(collection, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      var func = isArray(collection) ? arraySampleSize : baseSampleSize;\n      return func(collection, n);\n    }\n\n    /**\n     * Creates an array of shuffled values, using a version of the\n     * [Fisher-Yates shuffle](https://en.wikipedia.org/wiki/Fisher-Yates_shuffle).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to shuffle.\n     * @returns {Array} Returns the new shuffled array.\n     * @example\n     *\n     * _.shuffle([1, 2, 3, 4]);\n     * // => [4, 1, 3, 2]\n     */\n    function shuffle(collection) {\n      var func = isArray(collection) ? arrayShuffle : baseShuffle;\n      return func(collection);\n    }\n\n    /**\n     * Gets the size of `collection` by returning its length for array-like\n     * values or the number of own enumerable string keyed properties for objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object|string} collection The collection to inspect.\n     * @returns {number} Returns the collection size.\n     * @example\n     *\n     * _.size([1, 2, 3]);\n     * // => 3\n     *\n     * _.size({ 'a': 1, 'b': 2 });\n     * // => 2\n     *\n     * _.size('pebbles');\n     * // => 7\n     */\n    function size(collection) {\n      if (collection == null) {\n        return 0;\n      }\n      if (isArrayLike(collection)) {\n        return isString(collection) ? stringSize(collection) : collection.length;\n      }\n      var tag = getTag(collection);\n      if (tag == mapTag || tag == setTag) {\n        return collection.size;\n      }\n      return baseKeys(collection).length;\n    }\n\n    /**\n     * Checks if `predicate` returns truthy for **any** element of `collection`.\n     * Iteration is stopped once `predicate` returns truthy. The predicate is\n     * invoked with three arguments: (value, index|key, collection).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {boolean} Returns `true` if any element passes the predicate check,\n     *  else `false`.\n     * @example\n     *\n     * _.some([null, 0, 'yes', false], Boolean);\n     * // => true\n     *\n     * var users = [\n     *   { 'user': 'barney', 'active': true },\n     *   { 'user': 'fred',   'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.some(users, { 'user': 'barney', 'active': false });\n     * // => false\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.some(users, ['active', false]);\n     * // => true\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.some(users, 'active');\n     * // => true\n     */\n    function some(collection, predicate, guard) {\n      var func = isArray(collection) ? arraySome : baseSome;\n      if (guard && isIterateeCall(collection, predicate, guard)) {\n        predicate = undefined;\n      }\n      return func(collection, getIteratee(predicate, 3));\n    }\n\n    /**\n     * Creates an array of elements, sorted in ascending order by the results of\n     * running each element in a collection thru each iteratee. This method\n     * performs a stable sort, that is, it preserves the original sort order of\n     * equal elements. The iteratees are invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Collection\n     * @param {Array|Object} collection The collection to iterate over.\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to sort by.\n     * @returns {Array} Returns the new sorted array.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'fred',   'age': 48 },\n     *   { 'user': 'barney', 'age': 36 },\n     *   { 'user': 'fred',   'age': 30 },\n     *   { 'user': 'barney', 'age': 34 }\n     * ];\n     *\n     * _.sortBy(users, [function(o) { return o.user; }]);\n     * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n     *\n     * _.sortBy(users, ['user', 'age']);\n     * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n     */\n    var sortBy = baseRest(function(collection, iteratees) {\n      if (collection == null) {\n        return [];\n      }\n      var length = iteratees.length;\n      if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n        iteratees = [];\n      } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n        iteratees = [iteratees[0]];\n      }\n      return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n    });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Gets the timestamp of the number of milliseconds that have elapsed since\n     * the Unix epoch (1 January 1970 00:00:00 UTC).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Date\n     * @returns {number} Returns the timestamp.\n     * @example\n     *\n     * _.defer(function(stamp) {\n     *   console.log(_.now() - stamp);\n     * }, _.now());\n     * // => Logs the number of milliseconds it took for the deferred invocation.\n     */\n    var now = ctxNow || function() {\n      return root.Date.now();\n    };\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The opposite of `_.before`; this method creates a function that invokes\n     * `func` once it's called `n` or more times.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {number} n The number of calls before `func` is invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var saves = ['profile', 'settings'];\n     *\n     * var done = _.after(saves.length, function() {\n     *   console.log('done saving!');\n     * });\n     *\n     * _.forEach(saves, function(type) {\n     *   asyncSave({ 'type': type, 'complete': done });\n     * });\n     * // => Logs 'done saving!' after the two async saves have completed.\n     */\n    function after(n, func) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n < 1) {\n          return func.apply(this, arguments);\n        }\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func`, with up to `n` arguments,\n     * ignoring any additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @param {number} [n=func.length] The arity cap.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.ary(parseInt, 1));\n     * // => [6, 8, 10]\n     */\n    function ary(func, n, guard) {\n      n = guard ? undefined : n;\n      n = (func && n == null) ? func.length : n;\n      return createWrap(func, WRAP_ARY_FLAG, undefined, undefined, undefined, undefined, n);\n    }\n\n    /**\n     * Creates a function that invokes `func`, with the `this` binding and arguments\n     * of the created function, while it's called less than `n` times. Subsequent\n     * calls to the created function return the result of the last `func` invocation.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {number} n The number of calls at which `func` is no longer invoked.\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * jQuery(element).on('click', _.before(5, addContactToList));\n     * // => Allows adding up to 4 contacts to the list.\n     */\n    function before(n, func) {\n      var result;\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      n = toInteger(n);\n      return function() {\n        if (--n > 0) {\n          result = func.apply(this, arguments);\n        }\n        if (n <= 1) {\n          func = undefined;\n        }\n        return result;\n      };\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of `thisArg`\n     * and `partials` prepended to the arguments it receives.\n     *\n     * The `_.bind.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** Unlike native `Function#bind`, this method doesn't set the \"length\"\n     * property of bound functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to bind.\n     * @param {*} thisArg The `this` binding of `func`.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * function greet(greeting, punctuation) {\n     *   return greeting + ' ' + this.user + punctuation;\n     * }\n     *\n     * var object = { 'user': 'fred' };\n     *\n     * var bound = _.bind(greet, object, 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bind(greet, object, _, '!');\n     * bound('hi');\n     * // => 'hi fred!'\n     */\n    var bind = baseRest(function(func, thisArg, partials) {\n      var bitmask = WRAP_BIND_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bind));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(func, bitmask, thisArg, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes the method at `object[key]` with `partials`\n     * prepended to the arguments it receives.\n     *\n     * This method differs from `_.bind` by allowing bound functions to reference\n     * methods that may be redefined or don't yet exist. See\n     * [Peter Michaux's article](http://peter.michaux.ca/articles/lazy-function-definition-pattern)\n     * for more details.\n     *\n     * The `_.bindKey.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Function\n     * @param {Object} object The object to invoke the method on.\n     * @param {string} key The key of the method.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new bound function.\n     * @example\n     *\n     * var object = {\n     *   'user': 'fred',\n     *   'greet': function(greeting, punctuation) {\n     *     return greeting + ' ' + this.user + punctuation;\n     *   }\n     * };\n     *\n     * var bound = _.bindKey(object, 'greet', 'hi');\n     * bound('!');\n     * // => 'hi fred!'\n     *\n     * object.greet = function(greeting, punctuation) {\n     *   return greeting + 'ya ' + this.user + punctuation;\n     * };\n     *\n     * bound('!');\n     * // => 'hiya fred!'\n     *\n     * // Bound with placeholders.\n     * var bound = _.bindKey(object, 'greet', _, '!');\n     * bound('hi');\n     * // => 'hiya fred!'\n     */\n    var bindKey = baseRest(function(object, key, partials) {\n      var bitmask = WRAP_BIND_FLAG | WRAP_BIND_KEY_FLAG;\n      if (partials.length) {\n        var holders = replaceHolders(partials, getHolder(bindKey));\n        bitmask |= WRAP_PARTIAL_FLAG;\n      }\n      return createWrap(key, bitmask, object, partials, holders);\n    });\n\n    /**\n     * Creates a function that accepts arguments of `func` and either invokes\n     * `func` returning its result, if at least `arity` number of arguments have\n     * been provided, or returns a function that accepts the remaining `func`\n     * arguments, and so on. The arity of `func` may be specified if `func.length`\n     * is not sufficient.\n     *\n     * The `_.curry.placeholder` value, which defaults to `_` in monolithic builds,\n     * may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curry(abc);\n     *\n     * curried(1)(2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2)(3);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(1)(_, 3)(2);\n     * // => [1, 2, 3]\n     */\n    function curry(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curry.placeholder;\n      return result;\n    }\n\n    /**\n     * This method is like `_.curry` except that arguments are applied to `func`\n     * in the manner of `_.partialRight` instead of `_.partial`.\n     *\n     * The `_.curryRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for provided arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of curried functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to curry.\n     * @param {number} [arity=func.length] The arity of `func`.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the new curried function.\n     * @example\n     *\n     * var abc = function(a, b, c) {\n     *   return [a, b, c];\n     * };\n     *\n     * var curried = _.curryRight(abc);\n     *\n     * curried(3)(2)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(2, 3)(1);\n     * // => [1, 2, 3]\n     *\n     * curried(1, 2, 3);\n     * // => [1, 2, 3]\n     *\n     * // Curried with placeholders.\n     * curried(3)(1, _)(2);\n     * // => [1, 2, 3]\n     */\n    function curryRight(func, arity, guard) {\n      arity = guard ? undefined : arity;\n      var result = createWrap(func, WRAP_CURRY_RIGHT_FLAG, undefined, undefined, undefined, undefined, undefined, arity);\n      result.placeholder = curryRight.placeholder;\n      return result;\n    }\n\n    /**\n     * Creates a debounced function that delays invoking `func` until after `wait`\n     * milliseconds have elapsed since the last time the debounced function was\n     * invoked. The debounced function comes with a `cancel` method to cancel\n     * delayed `func` invocations and a `flush` method to immediately invoke them.\n     * Provide `options` to indicate whether `func` should be invoked on the\n     * leading and/or trailing edge of the `wait` timeout. The `func` is invoked\n     * with the last arguments provided to the debounced function. Subsequent\n     * calls to the debounced function return the result of the last `func`\n     * invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the debounced function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.debounce` and `_.throttle`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to debounce.\n     * @param {number} [wait=0] The number of milliseconds to delay.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=false]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {number} [options.maxWait]\n     *  The maximum time `func` is allowed to be delayed before it's invoked.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new debounced function.\n     * @example\n     *\n     * // Avoid costly calculations while the window size is in flux.\n     * jQuery(window).on('resize', _.debounce(calculateLayout, 150));\n     *\n     * // Invoke `sendMail` when clicked, debouncing subsequent calls.\n     * jQuery(element).on('click', _.debounce(sendMail, 300, {\n     *   'leading': true,\n     *   'trailing': false\n     * }));\n     *\n     * // Ensure `batchLog` is invoked once after 1 second of debounced calls.\n     * var debounced = _.debounce(batchLog, 250, { 'maxWait': 1000 });\n     * var source = new EventSource('/stream');\n     * jQuery(source).on('message', debounced);\n     *\n     * // Cancel the trailing debounced invocation.\n     * jQuery(window).on('popstate', debounced.cancel);\n     */\n    function debounce(func, wait, options) {\n      var lastArgs,\n          lastThis,\n          maxWait,\n          result,\n          timerId,\n          lastCallTime,\n          lastInvokeTime = 0,\n          leading = false,\n          maxing = false,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      wait = toNumber(wait) || 0;\n      if (isObject(options)) {\n        leading = !!options.leading;\n        maxing = 'maxWait' in options;\n        maxWait = maxing ? nativeMax(toNumber(options.maxWait) || 0, wait) : maxWait;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n\n      function invokeFunc(time) {\n        var args = lastArgs,\n            thisArg = lastThis;\n\n        lastArgs = lastThis = undefined;\n        lastInvokeTime = time;\n        result = func.apply(thisArg, args);\n        return result;\n      }\n\n      function leadingEdge(time) {\n        // Reset any `maxWait` timer.\n        lastInvokeTime = time;\n        // Start the timer for the trailing edge.\n        timerId = setTimeout(timerExpired, wait);\n        // Invoke the leading edge.\n        return leading ? invokeFunc(time) : result;\n      }\n\n      function remainingWait(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime,\n            timeWaiting = wait - timeSinceLastCall;\n\n        return maxing\n          ? nativeMin(timeWaiting, maxWait - timeSinceLastInvoke)\n          : timeWaiting;\n      }\n\n      function shouldInvoke(time) {\n        var timeSinceLastCall = time - lastCallTime,\n            timeSinceLastInvoke = time - lastInvokeTime;\n\n        // Either this is the first call, activity has stopped and we're at the\n        // trailing edge, the system time has gone backwards and we're treating\n        // it as the trailing edge, or we've hit the `maxWait` limit.\n        return (lastCallTime === undefined || (timeSinceLastCall >= wait) ||\n          (timeSinceLastCall < 0) || (maxing && timeSinceLastInvoke >= maxWait));\n      }\n\n      function timerExpired() {\n        var time = now();\n        if (shouldInvoke(time)) {\n          return trailingEdge(time);\n        }\n        // Restart the timer.\n        timerId = setTimeout(timerExpired, remainingWait(time));\n      }\n\n      function trailingEdge(time) {\n        timerId = undefined;\n\n        // Only invoke if we have `lastArgs` which means `func` has been\n        // debounced at least once.\n        if (trailing && lastArgs) {\n          return invokeFunc(time);\n        }\n        lastArgs = lastThis = undefined;\n        return result;\n      }\n\n      function cancel() {\n        if (timerId !== undefined) {\n          clearTimeout(timerId);\n        }\n        lastInvokeTime = 0;\n        lastArgs = lastCallTime = lastThis = timerId = undefined;\n      }\n\n      function flush() {\n        return timerId === undefined ? result : trailingEdge(now());\n      }\n\n      function debounced() {\n        var time = now(),\n            isInvoking = shouldInvoke(time);\n\n        lastArgs = arguments;\n        lastThis = this;\n        lastCallTime = time;\n\n        if (isInvoking) {\n          if (timerId === undefined) {\n            return leadingEdge(lastCallTime);\n          }\n          if (maxing) {\n            // Handle invocations in a tight loop.\n            clearTimeout(timerId);\n            timerId = setTimeout(timerExpired, wait);\n            return invokeFunc(lastCallTime);\n          }\n        }\n        if (timerId === undefined) {\n          timerId = setTimeout(timerExpired, wait);\n        }\n        return result;\n      }\n      debounced.cancel = cancel;\n      debounced.flush = flush;\n      return debounced;\n    }\n\n    /**\n     * Defers invoking the `func` until the current call stack has cleared. Any\n     * additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to defer.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.defer(function(text) {\n     *   console.log(text);\n     * }, 'deferred');\n     * // => Logs 'deferred' after one millisecond.\n     */\n    var defer = baseRest(function(func, args) {\n      return baseDelay(func, 1, args);\n    });\n\n    /**\n     * Invokes `func` after `wait` milliseconds. Any additional arguments are\n     * provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to delay.\n     * @param {number} wait The number of milliseconds to delay invocation.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {number} Returns the timer id.\n     * @example\n     *\n     * _.delay(function(text) {\n     *   console.log(text);\n     * }, 1000, 'later');\n     * // => Logs 'later' after one second.\n     */\n    var delay = baseRest(function(func, wait, args) {\n      return baseDelay(func, toNumber(wait) || 0, args);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments reversed.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to flip arguments for.\n     * @returns {Function} Returns the new flipped function.\n     * @example\n     *\n     * var flipped = _.flip(function() {\n     *   return _.toArray(arguments);\n     * });\n     *\n     * flipped('a', 'b', 'c', 'd');\n     * // => ['d', 'c', 'b', 'a']\n     */\n    function flip(func) {\n      return createWrap(func, WRAP_FLIP_FLAG);\n    }\n\n    /**\n     * Creates a function that memoizes the result of `func`. If `resolver` is\n     * provided, it determines the cache key for storing the result based on the\n     * arguments provided to the memoized function. By default, the first argument\n     * provided to the memoized function is used as the map cache key. The `func`\n     * is invoked with the `this` binding of the memoized function.\n     *\n     * **Note:** The cache is exposed as the `cache` property on the memoized\n     * function. Its creation may be customized by replacing the `_.memoize.Cache`\n     * constructor with one whose instances implement the\n     * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n     * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to have its output memoized.\n     * @param {Function} [resolver] The function to resolve the cache key.\n     * @returns {Function} Returns the new memoized function.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     * var other = { 'c': 3, 'd': 4 };\n     *\n     * var values = _.memoize(_.values);\n     * values(object);\n     * // => [1, 2]\n     *\n     * values(other);\n     * // => [3, 4]\n     *\n     * object.a = 2;\n     * values(object);\n     * // => [1, 2]\n     *\n     * // Modify the result cache.\n     * values.cache.set(object, ['a', 'b']);\n     * values(object);\n     * // => ['a', 'b']\n     *\n     * // Replace `_.memoize.Cache`.\n     * _.memoize.Cache = WeakMap;\n     */\n    function memoize(func, resolver) {\n      if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      var memoized = function() {\n        var args = arguments,\n            key = resolver ? resolver.apply(this, args) : args[0],\n            cache = memoized.cache;\n\n        if (cache.has(key)) {\n          return cache.get(key);\n        }\n        var result = func.apply(this, args);\n        memoized.cache = cache.set(key, result) || cache;\n        return result;\n      };\n      memoized.cache = new (memoize.Cache || MapCache);\n      return memoized;\n    }\n\n    // Expose `MapCache`.\n    memoize.Cache = MapCache;\n\n    /**\n     * Creates a function that negates the result of the predicate `func`. The\n     * `func` predicate is invoked with the `this` binding and arguments of the\n     * created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} predicate The predicate to negate.\n     * @returns {Function} Returns the new negated function.\n     * @example\n     *\n     * function isEven(n) {\n     *   return n % 2 == 0;\n     * }\n     *\n     * _.filter([1, 2, 3, 4, 5, 6], _.negate(isEven));\n     * // => [1, 3, 5]\n     */\n    function negate(predicate) {\n      if (typeof predicate != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      return function() {\n        var args = arguments;\n        switch (args.length) {\n          case 0: return !predicate.call(this);\n          case 1: return !predicate.call(this, args[0]);\n          case 2: return !predicate.call(this, args[0], args[1]);\n          case 3: return !predicate.call(this, args[0], args[1], args[2]);\n        }\n        return !predicate.apply(this, args);\n      };\n    }\n\n    /**\n     * Creates a function that is restricted to invoking `func` once. Repeat calls\n     * to the function return the value of the first invocation. The `func` is\n     * invoked with the `this` binding and arguments of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to restrict.\n     * @returns {Function} Returns the new restricted function.\n     * @example\n     *\n     * var initialize = _.once(createApplication);\n     * initialize();\n     * initialize();\n     * // => `createApplication` is invoked once\n     */\n    function once(func) {\n      return before(2, func);\n    }\n\n    /**\n     * Creates a function that invokes `func` with its arguments transformed.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Function\n     * @param {Function} func The function to wrap.\n     * @param {...(Function|Function[])} [transforms=[_.identity]]\n     *  The argument transforms.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * function doubled(n) {\n     *   return n * 2;\n     * }\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var func = _.overArgs(function(x, y) {\n     *   return [x, y];\n     * }, [square, doubled]);\n     *\n     * func(9, 3);\n     * // => [81, 6]\n     *\n     * func(10, 5);\n     * // => [100, 10]\n     */\n    var overArgs = castRest(function(func, transforms) {\n      transforms = (transforms.length == 1 && isArray(transforms[0]))\n        ? arrayMap(transforms[0], baseUnary(getIteratee()))\n        : arrayMap(baseFlatten(transforms, 1), baseUnary(getIteratee()));\n\n      var funcsLength = transforms.length;\n      return baseRest(function(args) {\n        var index = -1,\n            length = nativeMin(args.length, funcsLength);\n\n        while (++index < length) {\n          args[index] = transforms[index].call(this, args[index]);\n        }\n        return apply(func, this, args);\n      });\n    });\n\n    /**\n     * Creates a function that invokes `func` with `partials` prepended to the\n     * arguments it receives. This method is like `_.bind` except it does **not**\n     * alter the `this` binding.\n     *\n     * The `_.partial.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.2.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var sayHelloTo = _.partial(greet, 'hello');\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     *\n     * // Partially applied with placeholders.\n     * var greetFred = _.partial(greet, _, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     */\n    var partial = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partial));\n      return createWrap(func, WRAP_PARTIAL_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * This method is like `_.partial` except that partially applied arguments\n     * are appended to the arguments it receives.\n     *\n     * The `_.partialRight.placeholder` value, which defaults to `_` in monolithic\n     * builds, may be used as a placeholder for partially applied arguments.\n     *\n     * **Note:** This method doesn't set the \"length\" property of partially\n     * applied functions.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Function\n     * @param {Function} func The function to partially apply arguments to.\n     * @param {...*} [partials] The arguments to be partially applied.\n     * @returns {Function} Returns the new partially applied function.\n     * @example\n     *\n     * function greet(greeting, name) {\n     *   return greeting + ' ' + name;\n     * }\n     *\n     * var greetFred = _.partialRight(greet, 'fred');\n     * greetFred('hi');\n     * // => 'hi fred'\n     *\n     * // Partially applied with placeholders.\n     * var sayHelloTo = _.partialRight(greet, 'hello', _);\n     * sayHelloTo('fred');\n     * // => 'hello fred'\n     */\n    var partialRight = baseRest(function(func, partials) {\n      var holders = replaceHolders(partials, getHolder(partialRight));\n      return createWrap(func, WRAP_PARTIAL_RIGHT_FLAG, undefined, partials, holders);\n    });\n\n    /**\n     * Creates a function that invokes `func` with arguments arranged according\n     * to the specified `indexes` where the argument value at the first index is\n     * provided as the first argument, the argument value at the second index is\n     * provided as the second argument, and so on.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Function\n     * @param {Function} func The function to rearrange arguments for.\n     * @param {...(number|number[])} indexes The arranged argument indexes.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var rearged = _.rearg(function(a, b, c) {\n     *   return [a, b, c];\n     * }, [2, 0, 1]);\n     *\n     * rearged('b', 'c', 'a')\n     * // => ['a', 'b', 'c']\n     */\n    var rearg = flatRest(function(func, indexes) {\n      return createWrap(func, WRAP_REARG_FLAG, undefined, undefined, undefined, indexes);\n    });\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * created function and arguments from `start` and beyond provided as\n     * an array.\n     *\n     * **Note:** This method is based on the\n     * [rest parameter](https://mdn.io/rest_parameters).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to apply a rest parameter to.\n     * @param {number} [start=func.length-1] The start position of the rest parameter.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.rest(function(what, names) {\n     *   return what + ' ' + _.initial(names).join(', ') +\n     *     (_.size(names) > 1 ? ', & ' : '') + _.last(names);\n     * });\n     *\n     * say('hello', 'fred', 'barney', 'pebbles');\n     * // => 'hello fred, barney, & pebbles'\n     */\n    function rest(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start === undefined ? start : toInteger(start);\n      return baseRest(func, start);\n    }\n\n    /**\n     * Creates a function that invokes `func` with the `this` binding of the\n     * create function and an array of arguments much like\n     * [`Function#apply`](http://www.ecma-international.org/ecma-262/7.0/#sec-function.prototype.apply).\n     *\n     * **Note:** This method is based on the\n     * [spread operator](https://mdn.io/spread_operator).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Function\n     * @param {Function} func The function to spread arguments over.\n     * @param {number} [start=0] The start position of the spread.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var say = _.spread(function(who, what) {\n     *   return who + ' says ' + what;\n     * });\n     *\n     * say(['fred', 'hello']);\n     * // => 'fred says hello'\n     *\n     * var numbers = Promise.all([\n     *   Promise.resolve(40),\n     *   Promise.resolve(36)\n     * ]);\n     *\n     * numbers.then(_.spread(function(x, y) {\n     *   return x + y;\n     * }));\n     * // => a Promise of 76\n     */\n    function spread(func, start) {\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      start = start == null ? 0 : nativeMax(toInteger(start), 0);\n      return baseRest(function(args) {\n        var array = args[start],\n            otherArgs = castSlice(args, 0, start);\n\n        if (array) {\n          arrayPush(otherArgs, array);\n        }\n        return apply(func, this, otherArgs);\n      });\n    }\n\n    /**\n     * Creates a throttled function that only invokes `func` at most once per\n     * every `wait` milliseconds. The throttled function comes with a `cancel`\n     * method to cancel delayed `func` invocations and a `flush` method to\n     * immediately invoke them. Provide `options` to indicate whether `func`\n     * should be invoked on the leading and/or trailing edge of the `wait`\n     * timeout. The `func` is invoked with the last arguments provided to the\n     * throttled function. Subsequent calls to the throttled function return the\n     * result of the last `func` invocation.\n     *\n     * **Note:** If `leading` and `trailing` options are `true`, `func` is\n     * invoked on the trailing edge of the timeout only if the throttled function\n     * is invoked more than once during the `wait` timeout.\n     *\n     * If `wait` is `0` and `leading` is `false`, `func` invocation is deferred\n     * until to the next tick, similar to `setTimeout` with a timeout of `0`.\n     *\n     * See [David Corbacho's article](https://css-tricks.com/debouncing-throttling-explained-examples/)\n     * for details over the differences between `_.throttle` and `_.debounce`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {Function} func The function to throttle.\n     * @param {number} [wait=0] The number of milliseconds to throttle invocations to.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.leading=true]\n     *  Specify invoking on the leading edge of the timeout.\n     * @param {boolean} [options.trailing=true]\n     *  Specify invoking on the trailing edge of the timeout.\n     * @returns {Function} Returns the new throttled function.\n     * @example\n     *\n     * // Avoid excessively updating the position while scrolling.\n     * jQuery(window).on('scroll', _.throttle(updatePosition, 100));\n     *\n     * // Invoke `renewToken` when the click event is fired, but not more than once every 5 minutes.\n     * var throttled = _.throttle(renewToken, 300000, { 'trailing': false });\n     * jQuery(element).on('click', throttled);\n     *\n     * // Cancel the trailing throttled invocation.\n     * jQuery(window).on('popstate', throttled.cancel);\n     */\n    function throttle(func, wait, options) {\n      var leading = true,\n          trailing = true;\n\n      if (typeof func != 'function') {\n        throw new TypeError(FUNC_ERROR_TEXT);\n      }\n      if (isObject(options)) {\n        leading = 'leading' in options ? !!options.leading : leading;\n        trailing = 'trailing' in options ? !!options.trailing : trailing;\n      }\n      return debounce(func, wait, {\n        'leading': leading,\n        'maxWait': wait,\n        'trailing': trailing\n      });\n    }\n\n    /**\n     * Creates a function that accepts up to one argument, ignoring any\n     * additional arguments.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Function\n     * @param {Function} func The function to cap arguments for.\n     * @returns {Function} Returns the new capped function.\n     * @example\n     *\n     * _.map(['6', '8', '10'], _.unary(parseInt));\n     * // => [6, 8, 10]\n     */\n    function unary(func) {\n      return ary(func, 1);\n    }\n\n    /**\n     * Creates a function that provides `value` to `wrapper` as its first\n     * argument. Any additional arguments provided to the function are appended\n     * to those provided to the `wrapper`. The wrapper is invoked with the `this`\n     * binding of the created function.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Function\n     * @param {*} value The value to wrap.\n     * @param {Function} [wrapper=identity] The wrapper function.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var p = _.wrap(_.escape, function(func, text) {\n     *   return '<p>' + func(text) + '</p>';\n     * });\n     *\n     * p('fred, barney, & pebbles');\n     * // => '<p>fred, barney, &amp; pebbles</p>'\n     */\n    function wrap(value, wrapper) {\n      return partial(castFunction(wrapper), value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Casts `value` as an array if it's not one.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.4.0\n     * @category Lang\n     * @param {*} value The value to inspect.\n     * @returns {Array} Returns the cast array.\n     * @example\n     *\n     * _.castArray(1);\n     * // => [1]\n     *\n     * _.castArray({ 'a': 1 });\n     * // => [{ 'a': 1 }]\n     *\n     * _.castArray('abc');\n     * // => ['abc']\n     *\n     * _.castArray(null);\n     * // => [null]\n     *\n     * _.castArray(undefined);\n     * // => [undefined]\n     *\n     * _.castArray();\n     * // => []\n     *\n     * var array = [1, 2, 3];\n     * console.log(_.castArray(array) === array);\n     * // => true\n     */\n    function castArray() {\n      if (!arguments.length) {\n        return [];\n      }\n      var value = arguments[0];\n      return isArray(value) ? value : [value];\n    }\n\n    /**\n     * Creates a shallow clone of `value`.\n     *\n     * **Note:** This method is loosely based on the\n     * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n     * and supports cloning arrays, array buffers, booleans, date objects, maps,\n     * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n     * arrays. The own enumerable properties of `arguments` objects are cloned\n     * as plain objects. An empty object is returned for uncloneable values such\n     * as error objects, functions, DOM nodes, and WeakMaps.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeep\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var shallow = _.clone(objects);\n     * console.log(shallow[0] === objects[0]);\n     * // => true\n     */\n    function clone(value) {\n      return baseClone(value, CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.clone` except that it accepts `customizer` which\n     * is invoked to produce the cloned value. If `customizer` returns `undefined`,\n     * cloning is handled by the method instead. The `customizer` is invoked with\n     * up to four arguments; (value [, index|key, object, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the cloned value.\n     * @see _.cloneDeepWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(false);\n     *   }\n     * }\n     *\n     * var el = _.cloneWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 0\n     */\n    function cloneWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * This method is like `_.clone` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.clone\n     * @example\n     *\n     * var objects = [{ 'a': 1 }, { 'b': 2 }];\n     *\n     * var deep = _.cloneDeep(objects);\n     * console.log(deep[0] === objects[0]);\n     * // => false\n     */\n    function cloneDeep(value) {\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n    }\n\n    /**\n     * This method is like `_.cloneWith` except that it recursively clones `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to recursively clone.\n     * @param {Function} [customizer] The function to customize cloning.\n     * @returns {*} Returns the deep cloned value.\n     * @see _.cloneWith\n     * @example\n     *\n     * function customizer(value) {\n     *   if (_.isElement(value)) {\n     *     return value.cloneNode(true);\n     *   }\n     * }\n     *\n     * var el = _.cloneDeepWith(document.body, customizer);\n     *\n     * console.log(el === document.body);\n     * // => false\n     * console.log(el.nodeName);\n     * // => 'BODY'\n     * console.log(el.childNodes.length);\n     * // => 20\n     */\n    function cloneDeepWith(value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG, customizer);\n    }\n\n    /**\n     * Checks if `object` conforms to `source` by invoking the predicate\n     * properties of `source` with the corresponding property values of `object`.\n     *\n     * **Note:** This method is equivalent to `_.conforms` when `source` is\n     * partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {boolean} Returns `true` if `object` conforms, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 1; } });\n     * // => true\n     *\n     * _.conformsTo(object, { 'b': function(n) { return n > 2; } });\n     * // => false\n     */\n    function conformsTo(object, source) {\n      return source == null || baseConformsTo(object, source, keys(source));\n    }\n\n    /**\n     * Performs a\n     * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n     * comparison between two values to determine if they are equivalent.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.eq(object, object);\n     * // => true\n     *\n     * _.eq(object, other);\n     * // => false\n     *\n     * _.eq('a', 'a');\n     * // => true\n     *\n     * _.eq('a', Object('a'));\n     * // => false\n     *\n     * _.eq(NaN, NaN);\n     * // => true\n     */\n    function eq(value, other) {\n      return value === other || (value !== value && other !== other);\n    }\n\n    /**\n     * Checks if `value` is greater than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than `other`,\n     *  else `false`.\n     * @see _.lt\n     * @example\n     *\n     * _.gt(3, 1);\n     * // => true\n     *\n     * _.gt(3, 3);\n     * // => false\n     *\n     * _.gt(1, 3);\n     * // => false\n     */\n    var gt = createRelationalOperation(baseGt);\n\n    /**\n     * Checks if `value` is greater than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is greater than or equal to\n     *  `other`, else `false`.\n     * @see _.lte\n     * @example\n     *\n     * _.gte(3, 1);\n     * // => true\n     *\n     * _.gte(3, 3);\n     * // => true\n     *\n     * _.gte(1, 3);\n     * // => false\n     */\n    var gte = createRelationalOperation(function(value, other) {\n      return value >= other;\n    });\n\n    /**\n     * Checks if `value` is likely an `arguments` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArguments(function() { return arguments; }());\n     * // => true\n     *\n     * _.isArguments([1, 2, 3]);\n     * // => false\n     */\n    var isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n      return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n        !propertyIsEnumerable.call(value, 'callee');\n    };\n\n    /**\n     * Checks if `value` is classified as an `Array` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n     * @example\n     *\n     * _.isArray([1, 2, 3]);\n     * // => true\n     *\n     * _.isArray(document.body.children);\n     * // => false\n     *\n     * _.isArray('abc');\n     * // => false\n     *\n     * _.isArray(_.noop);\n     * // => false\n     */\n    var isArray = Array.isArray;\n\n    /**\n     * Checks if `value` is classified as an `ArrayBuffer` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array buffer, else `false`.\n     * @example\n     *\n     * _.isArrayBuffer(new ArrayBuffer(2));\n     * // => true\n     *\n     * _.isArrayBuffer(new Array(2));\n     * // => false\n     */\n    var isArrayBuffer = nodeIsArrayBuffer ? baseUnary(nodeIsArrayBuffer) : baseIsArrayBuffer;\n\n    /**\n     * Checks if `value` is array-like. A value is considered array-like if it's\n     * not a function and has a `value.length` that's an integer greater than or\n     * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n     * @example\n     *\n     * _.isArrayLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLike(document.body.children);\n     * // => true\n     *\n     * _.isArrayLike('abc');\n     * // => true\n     *\n     * _.isArrayLike(_.noop);\n     * // => false\n     */\n    function isArrayLike(value) {\n      return value != null && isLength(value.length) && !isFunction(value);\n    }\n\n    /**\n     * This method is like `_.isArrayLike` except that it also checks if `value`\n     * is an object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an array-like object,\n     *  else `false`.\n     * @example\n     *\n     * _.isArrayLikeObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isArrayLikeObject(document.body.children);\n     * // => true\n     *\n     * _.isArrayLikeObject('abc');\n     * // => false\n     *\n     * _.isArrayLikeObject(_.noop);\n     * // => false\n     */\n    function isArrayLikeObject(value) {\n      return isObjectLike(value) && isArrayLike(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a boolean primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a boolean, else `false`.\n     * @example\n     *\n     * _.isBoolean(false);\n     * // => true\n     *\n     * _.isBoolean(null);\n     * // => false\n     */\n    function isBoolean(value) {\n      return value === true || value === false ||\n        (isObjectLike(value) && baseGetTag(value) == boolTag);\n    }\n\n    /**\n     * Checks if `value` is a buffer.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n     * @example\n     *\n     * _.isBuffer(new Buffer(2));\n     * // => true\n     *\n     * _.isBuffer(new Uint8Array(2));\n     * // => false\n     */\n    var isBuffer = nativeIsBuffer || stubFalse;\n\n    /**\n     * Checks if `value` is classified as a `Date` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a date object, else `false`.\n     * @example\n     *\n     * _.isDate(new Date);\n     * // => true\n     *\n     * _.isDate('Mon April 23 2012');\n     * // => false\n     */\n    var isDate = nodeIsDate ? baseUnary(nodeIsDate) : baseIsDate;\n\n    /**\n     * Checks if `value` is likely a DOM element.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a DOM element, else `false`.\n     * @example\n     *\n     * _.isElement(document.body);\n     * // => true\n     *\n     * _.isElement('<body>');\n     * // => false\n     */\n    function isElement(value) {\n      return isObjectLike(value) && value.nodeType === 1 && !isPlainObject(value);\n    }\n\n    /**\n     * Checks if `value` is an empty object, collection, map, or set.\n     *\n     * Objects are considered empty if they have no own enumerable string keyed\n     * properties.\n     *\n     * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n     * jQuery-like collections are considered empty if they have a `length` of `0`.\n     * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n     * @example\n     *\n     * _.isEmpty(null);\n     * // => true\n     *\n     * _.isEmpty(true);\n     * // => true\n     *\n     * _.isEmpty(1);\n     * // => true\n     *\n     * _.isEmpty([1, 2, 3]);\n     * // => false\n     *\n     * _.isEmpty({ 'a': 1 });\n     * // => false\n     */\n    function isEmpty(value) {\n      if (value == null) {\n        return true;\n      }\n      if (isArrayLike(value) &&\n          (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n            isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n        return !value.length;\n      }\n      var tag = getTag(value);\n      if (tag == mapTag || tag == setTag) {\n        return !value.size;\n      }\n      if (isPrototype(value)) {\n        return !baseKeys(value).length;\n      }\n      for (var key in value) {\n        if (hasOwnProperty.call(value, key)) {\n          return false;\n        }\n      }\n      return true;\n    }\n\n    /**\n     * Performs a deep comparison between two values to determine if they are\n     * equivalent.\n     *\n     * **Note:** This method supports comparing arrays, array buffers, booleans,\n     * date objects, error objects, maps, numbers, `Object` objects, regexes,\n     * sets, strings, symbols, and typed arrays. `Object` objects are compared\n     * by their own, not inherited, enumerable properties. Functions and DOM\n     * nodes are compared by strict equality, i.e. `===`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     * var other = { 'a': 1 };\n     *\n     * _.isEqual(object, other);\n     * // => true\n     *\n     * object === other;\n     * // => false\n     */\n    function isEqual(value, other) {\n      return baseIsEqual(value, other);\n    }\n\n    /**\n     * This method is like `_.isEqual` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with up to\n     * six arguments: (objValue, othValue [, index|key, object, other, stack]).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, othValue) {\n     *   if (isGreeting(objValue) && isGreeting(othValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var array = ['hello', 'goodbye'];\n     * var other = ['hi', 'goodbye'];\n     *\n     * _.isEqualWith(array, other, customizer);\n     * // => true\n     */\n    function isEqualWith(value, other, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      var result = customizer ? customizer(value, other) : undefined;\n      return result === undefined ? baseIsEqual(value, other, undefined, customizer) : !!result;\n    }\n\n    /**\n     * Checks if `value` is an `Error`, `EvalError`, `RangeError`, `ReferenceError`,\n     * `SyntaxError`, `TypeError`, or `URIError` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an error object, else `false`.\n     * @example\n     *\n     * _.isError(new Error);\n     * // => true\n     *\n     * _.isError(Error);\n     * // => false\n     */\n    function isError(value) {\n      if (!isObjectLike(value)) {\n        return false;\n      }\n      var tag = baseGetTag(value);\n      return tag == errorTag || tag == domExcTag ||\n        (typeof value.message == 'string' && typeof value.name == 'string' && !isPlainObject(value));\n    }\n\n    /**\n     * Checks if `value` is a finite primitive number.\n     *\n     * **Note:** This method is based on\n     * [`Number.isFinite`](https://mdn.io/Number/isFinite).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a finite number, else `false`.\n     * @example\n     *\n     * _.isFinite(3);\n     * // => true\n     *\n     * _.isFinite(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isFinite(Infinity);\n     * // => false\n     *\n     * _.isFinite('3');\n     * // => false\n     */\n    function isFinite(value) {\n      return typeof value == 'number' && nativeIsFinite(value);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Function` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n     * @example\n     *\n     * _.isFunction(_);\n     * // => true\n     *\n     * _.isFunction(/abc/);\n     * // => false\n     */\n    function isFunction(value) {\n      if (!isObject(value)) {\n        return false;\n      }\n      // The use of `Object#toString` avoids issues with the `typeof` operator\n      // in Safari 9 which returns 'object' for typed arrays and other constructors.\n      var tag = baseGetTag(value);\n      return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n    }\n\n    /**\n     * Checks if `value` is an integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isInteger`](https://mdn.io/Number/isInteger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an integer, else `false`.\n     * @example\n     *\n     * _.isInteger(3);\n     * // => true\n     *\n     * _.isInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isInteger(Infinity);\n     * // => false\n     *\n     * _.isInteger('3');\n     * // => false\n     */\n    function isInteger(value) {\n      return typeof value == 'number' && value == toInteger(value);\n    }\n\n    /**\n     * Checks if `value` is a valid array-like length.\n     *\n     * **Note:** This method is loosely based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n     * @example\n     *\n     * _.isLength(3);\n     * // => true\n     *\n     * _.isLength(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isLength(Infinity);\n     * // => false\n     *\n     * _.isLength('3');\n     * // => false\n     */\n    function isLength(value) {\n      return typeof value == 'number' &&\n        value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is the\n     * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n     * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n     * @example\n     *\n     * _.isObject({});\n     * // => true\n     *\n     * _.isObject([1, 2, 3]);\n     * // => true\n     *\n     * _.isObject(_.noop);\n     * // => true\n     *\n     * _.isObject(null);\n     * // => false\n     */\n    function isObject(value) {\n      var type = typeof value;\n      return value != null && (type == 'object' || type == 'function');\n    }\n\n    /**\n     * Checks if `value` is object-like. A value is object-like if it's not `null`\n     * and has a `typeof` result of \"object\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n     * @example\n     *\n     * _.isObjectLike({});\n     * // => true\n     *\n     * _.isObjectLike([1, 2, 3]);\n     * // => true\n     *\n     * _.isObjectLike(_.noop);\n     * // => false\n     *\n     * _.isObjectLike(null);\n     * // => false\n     */\n    function isObjectLike(value) {\n      return value != null && typeof value == 'object';\n    }\n\n    /**\n     * Checks if `value` is classified as a `Map` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n     * @example\n     *\n     * _.isMap(new Map);\n     * // => true\n     *\n     * _.isMap(new WeakMap);\n     * // => false\n     */\n    var isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\n    /**\n     * Performs a partial deep comparison between `object` and `source` to\n     * determine if `object` contains equivalent property values.\n     *\n     * **Note:** This method is equivalent to `_.matches` when `source` is\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2 };\n     *\n     * _.isMatch(object, { 'b': 2 });\n     * // => true\n     *\n     * _.isMatch(object, { 'b': 1 });\n     * // => false\n     */\n    function isMatch(object, source) {\n      return object === source || baseIsMatch(object, source, getMatchData(source));\n    }\n\n    /**\n     * This method is like `_.isMatch` except that it accepts `customizer` which\n     * is invoked to compare values. If `customizer` returns `undefined`, comparisons\n     * are handled by the method instead. The `customizer` is invoked with five\n     * arguments: (objValue, srcValue, index|key, object, source).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {Object} object The object to inspect.\n     * @param {Object} source The object of property values to match.\n     * @param {Function} [customizer] The function to customize comparisons.\n     * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n     * @example\n     *\n     * function isGreeting(value) {\n     *   return /^h(?:i|ello)$/.test(value);\n     * }\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (isGreeting(objValue) && isGreeting(srcValue)) {\n     *     return true;\n     *   }\n     * }\n     *\n     * var object = { 'greeting': 'hello' };\n     * var source = { 'greeting': 'hi' };\n     *\n     * _.isMatchWith(object, source, customizer);\n     * // => true\n     */\n    function isMatchWith(object, source, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return baseIsMatch(object, source, getMatchData(source), customizer);\n    }\n\n    /**\n     * Checks if `value` is `NaN`.\n     *\n     * **Note:** This method is based on\n     * [`Number.isNaN`](https://mdn.io/Number/isNaN) and is not the same as\n     * global [`isNaN`](https://mdn.io/isNaN) which returns `true` for\n     * `undefined` and other non-number values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n     * @example\n     *\n     * _.isNaN(NaN);\n     * // => true\n     *\n     * _.isNaN(new Number(NaN));\n     * // => true\n     *\n     * isNaN(undefined);\n     * // => true\n     *\n     * _.isNaN(undefined);\n     * // => false\n     */\n    function isNaN(value) {\n      // An `NaN` primitive is the only value that is not equal to itself.\n      // Perform the `toStringTag` check first to avoid errors with some\n      // ActiveX objects in IE.\n      return isNumber(value) && value != +value;\n    }\n\n    /**\n     * Checks if `value` is a pristine native function.\n     *\n     * **Note:** This method can't reliably detect native functions in the presence\n     * of the core-js package because core-js circumvents this kind of detection.\n     * Despite multiple requests, the core-js maintainer has made it clear: any\n     * attempt to fix the detection will be obstructed. As a result, we're left\n     * with little choice but to throw an error. Unfortunately, this also affects\n     * packages, like [babel-polyfill](https://www.npmjs.com/package/babel-polyfill),\n     * which rely on core-js.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a native function,\n     *  else `false`.\n     * @example\n     *\n     * _.isNative(Array.prototype.push);\n     * // => true\n     *\n     * _.isNative(_);\n     * // => false\n     */\n    function isNative(value) {\n      if (isMaskable(value)) {\n        throw new Error(CORE_ERROR_TEXT);\n      }\n      return baseIsNative(value);\n    }\n\n    /**\n     * Checks if `value` is `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `null`, else `false`.\n     * @example\n     *\n     * _.isNull(null);\n     * // => true\n     *\n     * _.isNull(void 0);\n     * // => false\n     */\n    function isNull(value) {\n      return value === null;\n    }\n\n    /**\n     * Checks if `value` is `null` or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is nullish, else `false`.\n     * @example\n     *\n     * _.isNil(null);\n     * // => true\n     *\n     * _.isNil(void 0);\n     * // => true\n     *\n     * _.isNil(NaN);\n     * // => false\n     */\n    function isNil(value) {\n      return value == null;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Number` primitive or object.\n     *\n     * **Note:** To exclude `Infinity`, `-Infinity`, and `NaN`, which are\n     * classified as numbers, use the `_.isFinite` method.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a number, else `false`.\n     * @example\n     *\n     * _.isNumber(3);\n     * // => true\n     *\n     * _.isNumber(Number.MIN_VALUE);\n     * // => true\n     *\n     * _.isNumber(Infinity);\n     * // => true\n     *\n     * _.isNumber('3');\n     * // => false\n     */\n    function isNumber(value) {\n      return typeof value == 'number' ||\n        (isObjectLike(value) && baseGetTag(value) == numberTag);\n    }\n\n    /**\n     * Checks if `value` is a plain object, that is, an object created by the\n     * `Object` constructor or one with a `[[Prototype]]` of `null`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.8.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * _.isPlainObject(new Foo);\n     * // => false\n     *\n     * _.isPlainObject([1, 2, 3]);\n     * // => false\n     *\n     * _.isPlainObject({ 'x': 0, 'y': 0 });\n     * // => true\n     *\n     * _.isPlainObject(Object.create(null));\n     * // => true\n     */\n    function isPlainObject(value) {\n      if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n        return false;\n      }\n      var proto = getPrototype(value);\n      if (proto === null) {\n        return true;\n      }\n      var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n      return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n        funcToString.call(Ctor) == objectCtorString;\n    }\n\n    /**\n     * Checks if `value` is classified as a `RegExp` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.1.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a regexp, else `false`.\n     * @example\n     *\n     * _.isRegExp(/abc/);\n     * // => true\n     *\n     * _.isRegExp('/abc/');\n     * // => false\n     */\n    var isRegExp = nodeIsRegExp ? baseUnary(nodeIsRegExp) : baseIsRegExp;\n\n    /**\n     * Checks if `value` is a safe integer. An integer is safe if it's an IEEE-754\n     * double precision number which isn't the result of a rounded unsafe integer.\n     *\n     * **Note:** This method is based on\n     * [`Number.isSafeInteger`](https://mdn.io/Number/isSafeInteger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a safe integer, else `false`.\n     * @example\n     *\n     * _.isSafeInteger(3);\n     * // => true\n     *\n     * _.isSafeInteger(Number.MIN_VALUE);\n     * // => false\n     *\n     * _.isSafeInteger(Infinity);\n     * // => false\n     *\n     * _.isSafeInteger('3');\n     * // => false\n     */\n    function isSafeInteger(value) {\n      return isInteger(value) && value >= -MAX_SAFE_INTEGER && value <= MAX_SAFE_INTEGER;\n    }\n\n    /**\n     * Checks if `value` is classified as a `Set` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n     * @example\n     *\n     * _.isSet(new Set);\n     * // => true\n     *\n     * _.isSet(new WeakSet);\n     * // => false\n     */\n    var isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\n    /**\n     * Checks if `value` is classified as a `String` primitive or object.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n     * @example\n     *\n     * _.isString('abc');\n     * // => true\n     *\n     * _.isString(1);\n     * // => false\n     */\n    function isString(value) {\n      return typeof value == 'string' ||\n        (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a `Symbol` primitive or object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n     * @example\n     *\n     * _.isSymbol(Symbol.iterator);\n     * // => true\n     *\n     * _.isSymbol('abc');\n     * // => false\n     */\n    function isSymbol(value) {\n      return typeof value == 'symbol' ||\n        (isObjectLike(value) && baseGetTag(value) == symbolTag);\n    }\n\n    /**\n     * Checks if `value` is classified as a typed array.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n     * @example\n     *\n     * _.isTypedArray(new Uint8Array);\n     * // => true\n     *\n     * _.isTypedArray([]);\n     * // => false\n     */\n    var isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n    /**\n     * Checks if `value` is `undefined`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n     * @example\n     *\n     * _.isUndefined(void 0);\n     * // => true\n     *\n     * _.isUndefined(null);\n     * // => false\n     */\n    function isUndefined(value) {\n      return value === undefined;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakMap` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a weak map, else `false`.\n     * @example\n     *\n     * _.isWeakMap(new WeakMap);\n     * // => true\n     *\n     * _.isWeakMap(new Map);\n     * // => false\n     */\n    function isWeakMap(value) {\n      return isObjectLike(value) && getTag(value) == weakMapTag;\n    }\n\n    /**\n     * Checks if `value` is classified as a `WeakSet` object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.3.0\n     * @category Lang\n     * @param {*} value The value to check.\n     * @returns {boolean} Returns `true` if `value` is a weak set, else `false`.\n     * @example\n     *\n     * _.isWeakSet(new WeakSet);\n     * // => true\n     *\n     * _.isWeakSet(new Set);\n     * // => false\n     */\n    function isWeakSet(value) {\n      return isObjectLike(value) && baseGetTag(value) == weakSetTag;\n    }\n\n    /**\n     * Checks if `value` is less than `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than `other`,\n     *  else `false`.\n     * @see _.gt\n     * @example\n     *\n     * _.lt(1, 3);\n     * // => true\n     *\n     * _.lt(3, 3);\n     * // => false\n     *\n     * _.lt(3, 1);\n     * // => false\n     */\n    var lt = createRelationalOperation(baseLt);\n\n    /**\n     * Checks if `value` is less than or equal to `other`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.9.0\n     * @category Lang\n     * @param {*} value The value to compare.\n     * @param {*} other The other value to compare.\n     * @returns {boolean} Returns `true` if `value` is less than or equal to\n     *  `other`, else `false`.\n     * @see _.gte\n     * @example\n     *\n     * _.lte(1, 3);\n     * // => true\n     *\n     * _.lte(3, 3);\n     * // => true\n     *\n     * _.lte(3, 1);\n     * // => false\n     */\n    var lte = createRelationalOperation(function(value, other) {\n      return value <= other;\n    });\n\n    /**\n     * Converts `value` to an array.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the converted array.\n     * @example\n     *\n     * _.toArray({ 'a': 1, 'b': 2 });\n     * // => [1, 2]\n     *\n     * _.toArray('abc');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toArray(1);\n     * // => []\n     *\n     * _.toArray(null);\n     * // => []\n     */\n    function toArray(value) {\n      if (!value) {\n        return [];\n      }\n      if (isArrayLike(value)) {\n        return isString(value) ? stringToArray(value) : copyArray(value);\n      }\n      if (symIterator && value[symIterator]) {\n        return iteratorToArray(value[symIterator]());\n      }\n      var tag = getTag(value),\n          func = tag == mapTag ? mapToArray : (tag == setTag ? setToArray : values);\n\n      return func(value);\n    }\n\n    /**\n     * Converts `value` to a finite number.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.12.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted number.\n     * @example\n     *\n     * _.toFinite(3.2);\n     * // => 3.2\n     *\n     * _.toFinite(Number.MIN_VALUE);\n     * // => 5e-324\n     *\n     * _.toFinite(Infinity);\n     * // => 1.7976931348623157e+308\n     *\n     * _.toFinite('3.2');\n     * // => 3.2\n     */\n    function toFinite(value) {\n      if (!value) {\n        return value === 0 ? value : 0;\n      }\n      value = toNumber(value);\n      if (value === INFINITY || value === -INFINITY) {\n        var sign = (value < 0 ? -1 : 1);\n        return sign * MAX_INTEGER;\n      }\n      return value === value ? value : 0;\n    }\n\n    /**\n     * Converts `value` to an integer.\n     *\n     * **Note:** This method is loosely based on\n     * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toInteger(3.2);\n     * // => 3\n     *\n     * _.toInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toInteger(Infinity);\n     * // => 1.7976931348623157e+308\n     *\n     * _.toInteger('3.2');\n     * // => 3\n     */\n    function toInteger(value) {\n      var result = toFinite(value),\n          remainder = result % 1;\n\n      return result === result ? (remainder ? result - remainder : result) : 0;\n    }\n\n    /**\n     * Converts `value` to an integer suitable for use as the length of an\n     * array-like object.\n     *\n     * **Note:** This method is based on\n     * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toLength(3.2);\n     * // => 3\n     *\n     * _.toLength(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toLength(Infinity);\n     * // => 4294967295\n     *\n     * _.toLength('3.2');\n     * // => 3\n     */\n    function toLength(value) {\n      return value ? baseClamp(toInteger(value), 0, MAX_ARRAY_LENGTH) : 0;\n    }\n\n    /**\n     * Converts `value` to a number.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to process.\n     * @returns {number} Returns the number.\n     * @example\n     *\n     * _.toNumber(3.2);\n     * // => 3.2\n     *\n     * _.toNumber(Number.MIN_VALUE);\n     * // => 5e-324\n     *\n     * _.toNumber(Infinity);\n     * // => Infinity\n     *\n     * _.toNumber('3.2');\n     * // => 3.2\n     */\n    function toNumber(value) {\n      if (typeof value == 'number') {\n        return value;\n      }\n      if (isSymbol(value)) {\n        return NAN;\n      }\n      if (isObject(value)) {\n        var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n        value = isObject(other) ? (other + '') : other;\n      }\n      if (typeof value != 'string') {\n        return value === 0 ? value : +value;\n      }\n      value = baseTrim(value);\n      var isBinary = reIsBinary.test(value);\n      return (isBinary || reIsOctal.test(value))\n        ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n        : (reIsBadHex.test(value) ? NAN : +value);\n    }\n\n    /**\n     * Converts `value` to a plain object flattening inherited enumerable string\n     * keyed properties of `value` to own properties of the plain object.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {Object} Returns the converted plain object.\n     * @example\n     *\n     * function Foo() {\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.assign({ 'a': 1 }, new Foo);\n     * // => { 'a': 1, 'b': 2 }\n     *\n     * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n     * // => { 'a': 1, 'b': 2, 'c': 3 }\n     */\n    function toPlainObject(value) {\n      return copyObject(value, keysIn(value));\n    }\n\n    /**\n     * Converts `value` to a safe integer. A safe integer can be compared and\n     * represented correctly.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.toSafeInteger(3.2);\n     * // => 3\n     *\n     * _.toSafeInteger(Number.MIN_VALUE);\n     * // => 0\n     *\n     * _.toSafeInteger(Infinity);\n     * // => 9007199254740991\n     *\n     * _.toSafeInteger('3.2');\n     * // => 3\n     */\n    function toSafeInteger(value) {\n      return value\n        ? baseClamp(toInteger(value), -MAX_SAFE_INTEGER, MAX_SAFE_INTEGER)\n        : (value === 0 ? value : 0);\n    }\n\n    /**\n     * Converts `value` to a string. An empty string is returned for `null`\n     * and `undefined` values. The sign of `-0` is preserved.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Lang\n     * @param {*} value The value to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.toString(null);\n     * // => ''\n     *\n     * _.toString(-0);\n     * // => '-0'\n     *\n     * _.toString([1, 2, 3]);\n     * // => '1,2,3'\n     */\n    function toString(value) {\n      return value == null ? '' : baseToString(value);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Assigns own enumerable string keyed properties of source objects to the\n     * destination object. Source objects are applied from left to right.\n     * Subsequent sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object` and is loosely based on\n     * [`Object.assign`](https://mdn.io/Object/assign).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assignIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assign({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var assign = createAssigner(function(object, source) {\n      if (isPrototype(source) || isArrayLike(source)) {\n        copyObject(source, keys(source), object);\n        return;\n      }\n      for (var key in source) {\n        if (hasOwnProperty.call(source, key)) {\n          assignValue(object, key, source[key]);\n        }\n      }\n    });\n\n    /**\n     * This method is like `_.assign` except that it iterates over own and\n     * inherited source properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extend\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.assign\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     * }\n     *\n     * function Bar() {\n     *   this.c = 3;\n     * }\n     *\n     * Foo.prototype.b = 2;\n     * Bar.prototype.d = 4;\n     *\n     * _.assignIn({ 'a': 0 }, new Foo, new Bar);\n     * // => { 'a': 1, 'b': 2, 'c': 3, 'd': 4 }\n     */\n    var assignIn = createAssigner(function(object, source) {\n      copyObject(source, keysIn(source), object);\n    });\n\n    /**\n     * This method is like `_.assignIn` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias extendWith\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignInWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignInWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keysIn(source), object, customizer);\n    });\n\n    /**\n     * This method is like `_.assign` except that it accepts `customizer`\n     * which is invoked to produce the assigned values. If `customizer` returns\n     * `undefined`, assignment is handled by the method instead. The `customizer`\n     * is invoked with five arguments: (objValue, srcValue, key, object, source).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @see _.assignInWith\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   return _.isUndefined(objValue) ? srcValue : objValue;\n     * }\n     *\n     * var defaults = _.partialRight(_.assignWith, customizer);\n     *\n     * defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var assignWith = createAssigner(function(object, source, srcIndex, customizer) {\n      copyObject(source, keys(source), object, customizer);\n    });\n\n    /**\n     * Creates an array of values corresponding to `paths` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Array} Returns the picked values.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }, 4] };\n     *\n     * _.at(object, ['a[0].b.c', 'a[1]']);\n     * // => [3, 4]\n     */\n    var at = flatRest(baseAt);\n\n    /**\n     * Creates an object that inherits from the `prototype` object. If a\n     * `properties` object is given, its own enumerable string keyed properties\n     * are assigned to the created object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Object\n     * @param {Object} prototype The object to inherit from.\n     * @param {Object} [properties] The properties to assign to the object.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * function Shape() {\n     *   this.x = 0;\n     *   this.y = 0;\n     * }\n     *\n     * function Circle() {\n     *   Shape.call(this);\n     * }\n     *\n     * Circle.prototype = _.create(Shape.prototype, {\n     *   'constructor': Circle\n     * });\n     *\n     * var circle = new Circle;\n     * circle instanceof Circle;\n     * // => true\n     *\n     * circle instanceof Shape;\n     * // => true\n     */\n    function create(prototype, properties) {\n      var result = baseCreate(prototype);\n      return properties == null ? result : baseAssign(result, properties);\n    }\n\n    /**\n     * Assigns own and inherited enumerable string keyed properties of source\n     * objects to the destination object for all destination properties that\n     * resolve to `undefined`. Source objects are applied from left to right.\n     * Once a property is set, additional values of the same property are ignored.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaultsDeep\n     * @example\n     *\n     * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n     * // => { 'a': 1, 'b': 2 }\n     */\n    var defaults = baseRest(function(object, sources) {\n      object = Object(object);\n\n      var index = -1;\n      var length = sources.length;\n      var guard = length > 2 ? sources[2] : undefined;\n\n      if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n        length = 1;\n      }\n\n      while (++index < length) {\n        var source = sources[index];\n        var props = keysIn(source);\n        var propsIndex = -1;\n        var propsLength = props.length;\n\n        while (++propsIndex < propsLength) {\n          var key = props[propsIndex];\n          var value = object[key];\n\n          if (value === undefined ||\n              (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n            object[key] = source[key];\n          }\n        }\n      }\n\n      return object;\n    });\n\n    /**\n     * This method is like `_.defaults` except that it recursively assigns\n     * default properties.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @see _.defaults\n     * @example\n     *\n     * _.defaultsDeep({ 'a': { 'b': 2 } }, { 'a': { 'b': 1, 'c': 3 } });\n     * // => { 'a': { 'b': 2, 'c': 3 } }\n     */\n    var defaultsDeep = baseRest(function(args) {\n      args.push(undefined, customDefaultsMerge);\n      return apply(mergeWith, undefined, args);\n    });\n\n    /**\n     * This method is like `_.find` except that it returns the key of the first\n     * element `predicate` returns truthy for instead of the element itself.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findKey(users, function(o) { return o.age < 40; });\n     * // => 'barney' (iteration order is not guaranteed)\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findKey(users, { 'age': 1, 'active': true });\n     * // => 'pebbles'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findKey(users, 'active');\n     * // => 'barney'\n     */\n    function findKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwn);\n    }\n\n    /**\n     * This method is like `_.findKey` except that it iterates over elements of\n     * a collection in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @param {Function} [predicate=_.identity] The function invoked per iteration.\n     * @returns {string|undefined} Returns the key of the matched element,\n     *  else `undefined`.\n     * @example\n     *\n     * var users = {\n     *   'barney':  { 'age': 36, 'active': true },\n     *   'fred':    { 'age': 40, 'active': false },\n     *   'pebbles': { 'age': 1,  'active': true }\n     * };\n     *\n     * _.findLastKey(users, function(o) { return o.age < 40; });\n     * // => returns 'pebbles' assuming `_.findKey` returns 'barney'\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.findLastKey(users, { 'age': 36, 'active': true });\n     * // => 'barney'\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.findLastKey(users, ['active', false]);\n     * // => 'fred'\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.findLastKey(users, 'active');\n     * // => 'pebbles'\n     */\n    function findLastKey(object, predicate) {\n      return baseFindKey(object, getIteratee(predicate, 3), baseForOwnRight);\n    }\n\n    /**\n     * Iterates over own and inherited enumerable string keyed properties of an\n     * object and invokes `iteratee` for each property. The iteratee is invoked\n     * with three arguments: (value, key, object). Iteratee functions may exit\n     * iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forInRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forIn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n     */\n    function forIn(object, iteratee) {\n      return object == null\n        ? object\n        : baseFor(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * This method is like `_.forIn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forInRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'c', 'b', then 'a' assuming `_.forIn` logs 'a', 'b', then 'c'.\n     */\n    function forInRight(object, iteratee) {\n      return object == null\n        ? object\n        : baseForRight(object, getIteratee(iteratee, 3), keysIn);\n    }\n\n    /**\n     * Iterates over own enumerable string keyed properties of an object and\n     * invokes `iteratee` for each property. The iteratee is invoked with three\n     * arguments: (value, key, object). Iteratee functions may exit iteration\n     * early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwnRight\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwn(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n     */\n    function forOwn(object, iteratee) {\n      return object && baseForOwn(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * This method is like `_.forOwn` except that it iterates over properties of\n     * `object` in the opposite order.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.0.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns `object`.\n     * @see _.forOwn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.forOwnRight(new Foo, function(value, key) {\n     *   console.log(key);\n     * });\n     * // => Logs 'b' then 'a' assuming `_.forOwn` logs 'a' then 'b'.\n     */\n    function forOwnRight(object, iteratee) {\n      return object && baseForOwnRight(object, getIteratee(iteratee, 3));\n    }\n\n    /**\n     * Creates an array of function property names from own enumerable properties\n     * of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functionsIn\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functions(new Foo);\n     * // => ['a', 'b']\n     */\n    function functions(object) {\n      return object == null ? [] : baseFunctions(object, keys(object));\n    }\n\n    /**\n     * Creates an array of function property names from own and inherited\n     * enumerable properties of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to inspect.\n     * @returns {Array} Returns the function names.\n     * @see _.functions\n     * @example\n     *\n     * function Foo() {\n     *   this.a = _.constant('a');\n     *   this.b = _.constant('b');\n     * }\n     *\n     * Foo.prototype.c = _.constant('c');\n     *\n     * _.functionsIn(new Foo);\n     * // => ['a', 'b', 'c']\n     */\n    function functionsIn(object) {\n      return object == null ? [] : baseFunctions(object, keysIn(object));\n    }\n\n    /**\n     * Gets the value at `path` of `object`. If the resolved value is\n     * `undefined`, the `defaultValue` is returned in its place.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.get(object, 'a[0].b.c');\n     * // => 3\n     *\n     * _.get(object, ['a', '0', 'b', 'c']);\n     * // => 3\n     *\n     * _.get(object, 'a.b.c', 'default');\n     * // => 'default'\n     */\n    function get(object, path, defaultValue) {\n      var result = object == null ? undefined : baseGet(object, path);\n      return result === undefined ? defaultValue : result;\n    }\n\n    /**\n     * Checks if `path` is a direct property of `object`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     * @example\n     *\n     * var object = { 'a': { 'b': 2 } };\n     * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.has(object, 'a');\n     * // => true\n     *\n     * _.has(object, 'a.b');\n     * // => true\n     *\n     * _.has(object, ['a', 'b']);\n     * // => true\n     *\n     * _.has(other, 'a');\n     * // => false\n     */\n    function has(object, path) {\n      return object != null && hasPath(object, path, baseHas);\n    }\n\n    /**\n     * Checks if `path` is a direct or inherited property of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path to check.\n     * @returns {boolean} Returns `true` if `path` exists, else `false`.\n     * @example\n     *\n     * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n     *\n     * _.hasIn(object, 'a');\n     * // => true\n     *\n     * _.hasIn(object, 'a.b');\n     * // => true\n     *\n     * _.hasIn(object, ['a', 'b']);\n     * // => true\n     *\n     * _.hasIn(object, 'b');\n     * // => false\n     */\n    function hasIn(object, path) {\n      return object != null && hasPath(object, path, baseHasIn);\n    }\n\n    /**\n     * Creates an object composed of the inverted keys and values of `object`.\n     * If `object` contains duplicate values, subsequent values overwrite\n     * property assignments of previous values.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invert(object);\n     * // => { '1': 'c', '2': 'b' }\n     */\n    var invert = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      result[value] = key;\n    }, constant(identity));\n\n    /**\n     * This method is like `_.invert` except that the inverted object is generated\n     * from the results of running each element of `object` thru `iteratee`. The\n     * corresponding inverted value of each inverted key is an array of keys\n     * responsible for generating the inverted value. The iteratee is invoked\n     * with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.1.0\n     * @category Object\n     * @param {Object} object The object to invert.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {Object} Returns the new inverted object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': 2, 'c': 1 };\n     *\n     * _.invertBy(object);\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     *\n     * _.invertBy(object, function(value) {\n     *   return 'group' + value;\n     * });\n     * // => { 'group1': ['a', 'c'], 'group2': ['b'] }\n     */\n    var invertBy = createInverter(function(result, value, key) {\n      if (value != null &&\n          typeof value.toString != 'function') {\n        value = nativeObjectToString.call(value);\n      }\n\n      if (hasOwnProperty.call(result, value)) {\n        result[value].push(key);\n      } else {\n        result[value] = [key];\n      }\n    }, getIteratee);\n\n    /**\n     * Invokes the method at `path` of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {*} Returns the result of the invoked method.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': [1, 2, 3, 4] } }] };\n     *\n     * _.invoke(object, 'a[0].b.c.slice', 1, 3);\n     * // => [2, 3]\n     */\n    var invoke = baseRest(baseInvoke);\n\n    /**\n     * Creates an array of the own enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects. See the\n     * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n     * for more details.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keys(new Foo);\n     * // => ['a', 'b'] (iteration order is not guaranteed)\n     *\n     * _.keys('hi');\n     * // => ['0', '1']\n     */\n    function keys(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable property names of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property names.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.keysIn(new Foo);\n     * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n     */\n    function keysIn(object) {\n      return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n    }\n\n    /**\n     * The opposite of `_.mapValues`; this method creates an object with the\n     * same values as `object` and keys generated by running each own enumerable\n     * string keyed property of `object` thru `iteratee`. The iteratee is invoked\n     * with three arguments: (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.8.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapValues\n     * @example\n     *\n     * _.mapKeys({ 'a': 1, 'b': 2 }, function(value, key) {\n     *   return key + value;\n     * });\n     * // => { 'a1': 1, 'b2': 2 }\n     */\n    function mapKeys(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, iteratee(value, key, object), value);\n      });\n      return result;\n    }\n\n    /**\n     * Creates an object with the same keys as `object` and values generated\n     * by running each own enumerable string keyed property of `object` thru\n     * `iteratee`. The iteratee is invoked with three arguments:\n     * (value, key, object).\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Object} Returns the new mapped object.\n     * @see _.mapKeys\n     * @example\n     *\n     * var users = {\n     *   'fred':    { 'user': 'fred',    'age': 40 },\n     *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n     * };\n     *\n     * _.mapValues(users, function(o) { return o.age; });\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.mapValues(users, 'age');\n     * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n     */\n    function mapValues(object, iteratee) {\n      var result = {};\n      iteratee = getIteratee(iteratee, 3);\n\n      baseForOwn(object, function(value, key, object) {\n        baseAssignValue(result, key, iteratee(value, key, object));\n      });\n      return result;\n    }\n\n    /**\n     * This method is like `_.assign` except that it recursively merges own and\n     * inherited enumerable string keyed properties of source objects into the\n     * destination object. Source properties that resolve to `undefined` are\n     * skipped if a destination value exists. Array and plain object properties\n     * are merged recursively. Other objects and value types are overridden by\n     * assignment. Source objects are applied from left to right. Subsequent\n     * sources overwrite property assignments of previous sources.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.5.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} [sources] The source objects.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {\n     *   'a': [{ 'b': 2 }, { 'd': 4 }]\n     * };\n     *\n     * var other = {\n     *   'a': [{ 'c': 3 }, { 'e': 5 }]\n     * };\n     *\n     * _.merge(object, other);\n     * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n     */\n    var merge = createAssigner(function(object, source, srcIndex) {\n      baseMerge(object, source, srcIndex);\n    });\n\n    /**\n     * This method is like `_.merge` except that it accepts `customizer` which\n     * is invoked to produce the merged values of the destination and source\n     * properties. If `customizer` returns `undefined`, merging is handled by the\n     * method instead. The `customizer` is invoked with six arguments:\n     * (objValue, srcValue, key, object, source, stack).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The destination object.\n     * @param {...Object} sources The source objects.\n     * @param {Function} customizer The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * function customizer(objValue, srcValue) {\n     *   if (_.isArray(objValue)) {\n     *     return objValue.concat(srcValue);\n     *   }\n     * }\n     *\n     * var object = { 'a': [1], 'b': [2] };\n     * var other = { 'a': [3], 'b': [4] };\n     *\n     * _.mergeWith(object, other, customizer);\n     * // => { 'a': [1, 3], 'b': [2, 4] }\n     */\n    var mergeWith = createAssigner(function(object, source, srcIndex, customizer) {\n      baseMerge(object, source, srcIndex, customizer);\n    });\n\n    /**\n     * The opposite of `_.pick`; this method creates an object composed of the\n     * own and inherited enumerable property paths of `object` that are not omitted.\n     *\n     * **Note:** This method is considerably slower than `_.pick`.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {...(string|string[])} [paths] The property paths to omit.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omit(object, ['a', 'c']);\n     * // => { 'b': '2' }\n     */\n    var omit = flatRest(function(object, paths) {\n      var result = {};\n      if (object == null) {\n        return result;\n      }\n      var isDeep = false;\n      paths = arrayMap(paths, function(path) {\n        path = castPath(path, object);\n        isDeep || (isDeep = path.length > 1);\n        return path;\n      });\n      copyObject(object, getAllKeysIn(object), result);\n      if (isDeep) {\n        result = baseClone(result, CLONE_DEEP_FLAG | CLONE_FLAT_FLAG | CLONE_SYMBOLS_FLAG, customOmitClone);\n      }\n      var length = paths.length;\n      while (length--) {\n        baseUnset(result, paths[length]);\n      }\n      return result;\n    });\n\n    /**\n     * The opposite of `_.pickBy`; this method creates an object composed of\n     * the own and inherited enumerable string keyed properties of `object` that\n     * `predicate` doesn't return truthy for. The predicate is invoked with two\n     * arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.omitBy(object, _.isNumber);\n     * // => { 'b': '2' }\n     */\n    function omitBy(object, predicate) {\n      return pickBy(object, negate(getIteratee(predicate)));\n    }\n\n    /**\n     * Creates an object composed of the picked `object` properties.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {...(string|string[])} [paths] The property paths to pick.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pick(object, ['a', 'c']);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    var pick = flatRest(function(object, paths) {\n      return object == null ? {} : basePick(object, paths);\n    });\n\n    /**\n     * Creates an object composed of the `object` properties `predicate` returns\n     * truthy for. The predicate is invoked with two arguments: (value, key).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The source object.\n     * @param {Function} [predicate=_.identity] The function invoked per property.\n     * @returns {Object} Returns the new object.\n     * @example\n     *\n     * var object = { 'a': 1, 'b': '2', 'c': 3 };\n     *\n     * _.pickBy(object, _.isNumber);\n     * // => { 'a': 1, 'c': 3 }\n     */\n    function pickBy(object, predicate) {\n      if (object == null) {\n        return {};\n      }\n      var props = arrayMap(getAllKeysIn(object), function(prop) {\n        return [prop];\n      });\n      predicate = getIteratee(predicate);\n      return basePickBy(object, props, function(value, path) {\n        return predicate(value, path[0]);\n      });\n    }\n\n    /**\n     * This method is like `_.get` except that if the resolved value is a\n     * function it's invoked with the `this` binding of its parent object and\n     * its result is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @param {Array|string} path The path of the property to resolve.\n     * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c1': 3, 'c2': _.constant(4) } }] };\n     *\n     * _.result(object, 'a[0].b.c1');\n     * // => 3\n     *\n     * _.result(object, 'a[0].b.c2');\n     * // => 4\n     *\n     * _.result(object, 'a[0].b.c3', 'default');\n     * // => 'default'\n     *\n     * _.result(object, 'a[0].b.c3', _.constant('default'));\n     * // => 'default'\n     */\n    function result(object, path, defaultValue) {\n      path = castPath(path, object);\n\n      var index = -1,\n          length = path.length;\n\n      // Ensure the loop is entered when path is empty.\n      if (!length) {\n        length = 1;\n        object = undefined;\n      }\n      while (++index < length) {\n        var value = object == null ? undefined : object[toKey(path[index])];\n        if (value === undefined) {\n          index = length;\n          value = defaultValue;\n        }\n        object = isFunction(value) ? value.call(object) : value;\n      }\n      return object;\n    }\n\n    /**\n     * Sets the value at `path` of `object`. If a portion of `path` doesn't exist,\n     * it's created. Arrays are created for missing index properties while objects\n     * are created for all other missing properties. Use `_.setWith` to customize\n     * `path` creation.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.set(object, 'a[0].b.c', 4);\n     * console.log(object.a[0].b.c);\n     * // => 4\n     *\n     * _.set(object, ['x', '0', 'y', 'z'], 5);\n     * console.log(object.x[0].y.z);\n     * // => 5\n     */\n    function set(object, path, value) {\n      return object == null ? object : baseSet(object, path, value);\n    }\n\n    /**\n     * This method is like `_.set` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {*} value The value to set.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.setWith(object, '[0][1]', 'a', Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function setWith(object, path, value, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseSet(object, path, value, customizer);\n    }\n\n    /**\n     * Creates an array of own enumerable string keyed-value pairs for `object`\n     * which can be consumed by `_.fromPairs`. If `object` is a map or set, its\n     * entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entries\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairs(new Foo);\n     * // => [['a', 1], ['b', 2]] (iteration order is not guaranteed)\n     */\n    var toPairs = createToPairs(keys);\n\n    /**\n     * Creates an array of own and inherited enumerable string keyed-value pairs\n     * for `object` which can be consumed by `_.fromPairs`. If `object` is a map\n     * or set, its entries are returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @alias entriesIn\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the key-value pairs.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.toPairsIn(new Foo);\n     * // => [['a', 1], ['b', 2], ['c', 3]] (iteration order is not guaranteed)\n     */\n    var toPairsIn = createToPairs(keysIn);\n\n    /**\n     * An alternative to `_.reduce`; this method transforms `object` to a new\n     * `accumulator` object which is the result of running each of its own\n     * enumerable string keyed properties thru `iteratee`, with each invocation\n     * potentially mutating the `accumulator` object. If `accumulator` is not\n     * provided, a new object with the same `[[Prototype]]` will be used. The\n     * iteratee is invoked with four arguments: (accumulator, value, key, object).\n     * Iteratee functions may exit iteration early by explicitly returning `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.3.0\n     * @category Object\n     * @param {Object} object The object to iterate over.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @param {*} [accumulator] The custom accumulator value.\n     * @returns {*} Returns the accumulated value.\n     * @example\n     *\n     * _.transform([2, 3, 4], function(result, n) {\n     *   result.push(n *= n);\n     *   return n % 2 == 0;\n     * }, []);\n     * // => [4, 9]\n     *\n     * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n     *   (result[value] || (result[value] = [])).push(key);\n     * }, {});\n     * // => { '1': ['a', 'c'], '2': ['b'] }\n     */\n    function transform(object, iteratee, accumulator) {\n      var isArr = isArray(object),\n          isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n      iteratee = getIteratee(iteratee, 4);\n      if (accumulator == null) {\n        var Ctor = object && object.constructor;\n        if (isArrLike) {\n          accumulator = isArr ? new Ctor : [];\n        }\n        else if (isObject(object)) {\n          accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n        }\n        else {\n          accumulator = {};\n        }\n      }\n      (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n        return iteratee(accumulator, value, index, object);\n      });\n      return accumulator;\n    }\n\n    /**\n     * Removes the property at `path` of `object`.\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to unset.\n     * @returns {boolean} Returns `true` if the property is deleted, else `false`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 7 } }] };\n     * _.unset(object, 'a[0].b.c');\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     *\n     * _.unset(object, ['a', '0', 'b', 'c']);\n     * // => true\n     *\n     * console.log(object);\n     * // => { 'a': [{ 'b': {} }] };\n     */\n    function unset(object, path) {\n      return object == null ? true : baseUnset(object, path);\n    }\n\n    /**\n     * This method is like `_.set` except that accepts `updater` to produce the\n     * value to set. Use `_.updateWith` to customize `path` creation. The `updater`\n     * is invoked with one argument: (value).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n     *\n     * _.update(object, 'a[0].b.c', function(n) { return n * n; });\n     * console.log(object.a[0].b.c);\n     * // => 9\n     *\n     * _.update(object, 'x[0].y.z', function(n) { return n ? n + 1 : 0; });\n     * console.log(object.x[0].y.z);\n     * // => 0\n     */\n    function update(object, path, updater) {\n      return object == null ? object : baseUpdate(object, path, castFunction(updater));\n    }\n\n    /**\n     * This method is like `_.update` except that it accepts `customizer` which is\n     * invoked to produce the objects of `path`.  If `customizer` returns `undefined`\n     * path creation is handled by the method instead. The `customizer` is invoked\n     * with three arguments: (nsValue, key, nsObject).\n     *\n     * **Note:** This method mutates `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.6.0\n     * @category Object\n     * @param {Object} object The object to modify.\n     * @param {Array|string} path The path of the property to set.\n     * @param {Function} updater The function to produce the updated value.\n     * @param {Function} [customizer] The function to customize assigned values.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var object = {};\n     *\n     * _.updateWith(object, '[0][1]', _.constant('a'), Object);\n     * // => { '0': { '1': 'a' } }\n     */\n    function updateWith(object, path, updater, customizer) {\n      customizer = typeof customizer == 'function' ? customizer : undefined;\n      return object == null ? object : baseUpdate(object, path, castFunction(updater), customizer);\n    }\n\n    /**\n     * Creates an array of the own enumerable string keyed property values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.values(new Foo);\n     * // => [1, 2] (iteration order is not guaranteed)\n     *\n     * _.values('hi');\n     * // => ['h', 'i']\n     */\n    function values(object) {\n      return object == null ? [] : baseValues(object, keys(object));\n    }\n\n    /**\n     * Creates an array of the own and inherited enumerable string keyed property\n     * values of `object`.\n     *\n     * **Note:** Non-object values are coerced to objects.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Object\n     * @param {Object} object The object to query.\n     * @returns {Array} Returns the array of property values.\n     * @example\n     *\n     * function Foo() {\n     *   this.a = 1;\n     *   this.b = 2;\n     * }\n     *\n     * Foo.prototype.c = 3;\n     *\n     * _.valuesIn(new Foo);\n     * // => [1, 2, 3] (iteration order is not guaranteed)\n     */\n    function valuesIn(object) {\n      return object == null ? [] : baseValues(object, keysIn(object));\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Clamps `number` within the inclusive `lower` and `upper` bounds.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Number\n     * @param {number} number The number to clamp.\n     * @param {number} [lower] The lower bound.\n     * @param {number} upper The upper bound.\n     * @returns {number} Returns the clamped number.\n     * @example\n     *\n     * _.clamp(-10, -5, 5);\n     * // => -5\n     *\n     * _.clamp(10, -5, 5);\n     * // => 5\n     */\n    function clamp(number, lower, upper) {\n      if (upper === undefined) {\n        upper = lower;\n        lower = undefined;\n      }\n      if (upper !== undefined) {\n        upper = toNumber(upper);\n        upper = upper === upper ? upper : 0;\n      }\n      if (lower !== undefined) {\n        lower = toNumber(lower);\n        lower = lower === lower ? lower : 0;\n      }\n      return baseClamp(toNumber(number), lower, upper);\n    }\n\n    /**\n     * Checks if `n` is between `start` and up to, but not including, `end`. If\n     * `end` is not specified, it's set to `start` with `start` then set to `0`.\n     * If `start` is greater than `end` the params are swapped to support\n     * negative ranges.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.3.0\n     * @category Number\n     * @param {number} number The number to check.\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @returns {boolean} Returns `true` if `number` is in the range, else `false`.\n     * @see _.range, _.rangeRight\n     * @example\n     *\n     * _.inRange(3, 2, 4);\n     * // => true\n     *\n     * _.inRange(4, 8);\n     * // => true\n     *\n     * _.inRange(4, 2);\n     * // => false\n     *\n     * _.inRange(2, 2);\n     * // => false\n     *\n     * _.inRange(1.2, 2);\n     * // => true\n     *\n     * _.inRange(5.2, 4);\n     * // => false\n     *\n     * _.inRange(-3, -2, -6);\n     * // => true\n     */\n    function inRange(number, start, end) {\n      start = toFinite(start);\n      if (end === undefined) {\n        end = start;\n        start = 0;\n      } else {\n        end = toFinite(end);\n      }\n      number = toNumber(number);\n      return baseInRange(number, start, end);\n    }\n\n    /**\n     * Produces a random number between the inclusive `lower` and `upper` bounds.\n     * If only one argument is provided a number between `0` and the given number\n     * is returned. If `floating` is `true`, or either `lower` or `upper` are\n     * floats, a floating-point number is returned instead of an integer.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @memberOf _\n     * @since 0.7.0\n     * @category Number\n     * @param {number} [lower=0] The lower bound.\n     * @param {number} [upper=1] The upper bound.\n     * @param {boolean} [floating] Specify returning a floating-point number.\n     * @returns {number} Returns the random number.\n     * @example\n     *\n     * _.random(0, 5);\n     * // => an integer between 0 and 5\n     *\n     * _.random(5);\n     * // => also an integer between 0 and 5\n     *\n     * _.random(5, true);\n     * // => a floating-point number between 0 and 5\n     *\n     * _.random(1.2, 5.2);\n     * // => a floating-point number between 1.2 and 5.2\n     */\n    function random(lower, upper, floating) {\n      if (floating && typeof floating != 'boolean' && isIterateeCall(lower, upper, floating)) {\n        upper = floating = undefined;\n      }\n      if (floating === undefined) {\n        if (typeof upper == 'boolean') {\n          floating = upper;\n          upper = undefined;\n        }\n        else if (typeof lower == 'boolean') {\n          floating = lower;\n          lower = undefined;\n        }\n      }\n      if (lower === undefined && upper === undefined) {\n        lower = 0;\n        upper = 1;\n      }\n      else {\n        lower = toFinite(lower);\n        if (upper === undefined) {\n          upper = lower;\n          lower = 0;\n        } else {\n          upper = toFinite(upper);\n        }\n      }\n      if (lower > upper) {\n        var temp = lower;\n        lower = upper;\n        upper = temp;\n      }\n      if (floating || lower % 1 || upper % 1) {\n        var rand = nativeRandom();\n        return nativeMin(lower + (rand * (upper - lower + freeParseFloat('1e-' + ((rand + '').length - 1)))), upper);\n      }\n      return baseRandom(lower, upper);\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Converts `string` to [camel case](https://en.wikipedia.org/wiki/CamelCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the camel cased string.\n     * @example\n     *\n     * _.camelCase('Foo Bar');\n     * // => 'fooBar'\n     *\n     * _.camelCase('--foo-bar--');\n     * // => 'fooBar'\n     *\n     * _.camelCase('__FOO_BAR__');\n     * // => 'fooBar'\n     */\n    var camelCase = createCompounder(function(result, word, index) {\n      word = word.toLowerCase();\n      return result + (index ? capitalize(word) : word);\n    });\n\n    /**\n     * Converts the first character of `string` to upper case and the remaining\n     * to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to capitalize.\n     * @returns {string} Returns the capitalized string.\n     * @example\n     *\n     * _.capitalize('FRED');\n     * // => 'Fred'\n     */\n    function capitalize(string) {\n      return upperFirst(toString(string).toLowerCase());\n    }\n\n    /**\n     * Deburrs `string` by converting\n     * [Latin-1 Supplement](https://en.wikipedia.org/wiki/Latin-1_Supplement_(Unicode_block)#Character_table)\n     * and [Latin Extended-A](https://en.wikipedia.org/wiki/Latin_Extended-A)\n     * letters to basic Latin letters and removing\n     * [combining diacritical marks](https://en.wikipedia.org/wiki/Combining_Diacritical_Marks).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to deburr.\n     * @returns {string} Returns the deburred string.\n     * @example\n     *\n     * _.deburr('déjà vu');\n     * // => 'deja vu'\n     */\n    function deburr(string) {\n      string = toString(string);\n      return string && string.replace(reLatin, deburrLetter).replace(reComboMark, '');\n    }\n\n    /**\n     * Checks if `string` ends with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=string.length] The position to search up to.\n     * @returns {boolean} Returns `true` if `string` ends with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.endsWith('abc', 'c');\n     * // => true\n     *\n     * _.endsWith('abc', 'b');\n     * // => false\n     *\n     * _.endsWith('abc', 'b', 2);\n     * // => true\n     */\n    function endsWith(string, target, position) {\n      string = toString(string);\n      target = baseToString(target);\n\n      var length = string.length;\n      position = position === undefined\n        ? length\n        : baseClamp(toInteger(position), 0, length);\n\n      var end = position;\n      position -= target.length;\n      return position >= 0 && string.slice(position, end) == target;\n    }\n\n    /**\n     * Converts the characters \"&\", \"<\", \">\", '\"', and \"'\" in `string` to their\n     * corresponding HTML entities.\n     *\n     * **Note:** No other characters are escaped. To escape additional\n     * characters use a third-party library like [_he_](https://mths.be/he).\n     *\n     * Though the \">\" character is escaped for symmetry, characters like\n     * \">\" and \"/\" don't need escaping in HTML and have no special meaning\n     * unless they're part of a tag or unquoted attribute value. See\n     * [Mathias Bynens's article](https://mathiasbynens.be/notes/ambiguous-ampersands)\n     * (under \"semi-related fun fact\") for more details.\n     *\n     * When working with HTML you should always\n     * [quote attribute values](http://wonko.com/post/html-escaping) to reduce\n     * XSS vectors.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escape('fred, barney, & pebbles');\n     * // => 'fred, barney, &amp; pebbles'\n     */\n    function escape(string) {\n      string = toString(string);\n      return (string && reHasUnescapedHtml.test(string))\n        ? string.replace(reUnescapedHtml, escapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Escapes the `RegExp` special characters \"^\", \"$\", \"\\\", \".\", \"*\", \"+\",\n     * \"?\", \"(\", \")\", \"[\", \"]\", \"{\", \"}\", and \"|\" in `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to escape.\n     * @returns {string} Returns the escaped string.\n     * @example\n     *\n     * _.escapeRegExp('[lodash](https://lodash.com/)');\n     * // => '\\[lodash\\]\\(https://lodash\\.com/\\)'\n     */\n    function escapeRegExp(string) {\n      string = toString(string);\n      return (string && reHasRegExpChar.test(string))\n        ? string.replace(reRegExpChar, '\\\\$&')\n        : string;\n    }\n\n    /**\n     * Converts `string` to\n     * [kebab case](https://en.wikipedia.org/wiki/Letter_case#Special_case_styles).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the kebab cased string.\n     * @example\n     *\n     * _.kebabCase('Foo Bar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('fooBar');\n     * // => 'foo-bar'\n     *\n     * _.kebabCase('__FOO_BAR__');\n     * // => 'foo-bar'\n     */\n    var kebabCase = createCompounder(function(result, word, index) {\n      return result + (index ? '-' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts `string`, as space separated words, to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.lowerCase('--Foo-Bar--');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('fooBar');\n     * // => 'foo bar'\n     *\n     * _.lowerCase('__FOO_BAR__');\n     * // => 'foo bar'\n     */\n    var lowerCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Converts the first character of `string` to lower case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.lowerFirst('Fred');\n     * // => 'fred'\n     *\n     * _.lowerFirst('FRED');\n     * // => 'fRED'\n     */\n    var lowerFirst = createCaseFirst('toLowerCase');\n\n    /**\n     * Pads `string` on the left and right sides if it's shorter than `length`.\n     * Padding characters are truncated if they can't be evenly divided by `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.pad('abc', 8);\n     * // => '  abc   '\n     *\n     * _.pad('abc', 8, '_-');\n     * // => '_-abc_-_'\n     *\n     * _.pad('abc', 3);\n     * // => 'abc'\n     */\n    function pad(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      if (!length || strLength >= length) {\n        return string;\n      }\n      var mid = (length - strLength) / 2;\n      return (\n        createPadding(nativeFloor(mid), chars) +\n        string +\n        createPadding(nativeCeil(mid), chars)\n      );\n    }\n\n    /**\n     * Pads `string` on the right side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padEnd('abc', 6);\n     * // => 'abc   '\n     *\n     * _.padEnd('abc', 6, '_-');\n     * // => 'abc_-_'\n     *\n     * _.padEnd('abc', 3);\n     * // => 'abc'\n     */\n    function padEnd(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (string + createPadding(length - strLength, chars))\n        : string;\n    }\n\n    /**\n     * Pads `string` on the left side if it's shorter than `length`. Padding\n     * characters are truncated if they exceed `length`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to pad.\n     * @param {number} [length=0] The padding length.\n     * @param {string} [chars=' '] The string used as padding.\n     * @returns {string} Returns the padded string.\n     * @example\n     *\n     * _.padStart('abc', 6);\n     * // => '   abc'\n     *\n     * _.padStart('abc', 6, '_-');\n     * // => '_-_abc'\n     *\n     * _.padStart('abc', 3);\n     * // => 'abc'\n     */\n    function padStart(string, length, chars) {\n      string = toString(string);\n      length = toInteger(length);\n\n      var strLength = length ? stringSize(string) : 0;\n      return (length && strLength < length)\n        ? (createPadding(length - strLength, chars) + string)\n        : string;\n    }\n\n    /**\n     * Converts `string` to an integer of the specified radix. If `radix` is\n     * `undefined` or `0`, a `radix` of `10` is used unless `value` is a\n     * hexadecimal, in which case a `radix` of `16` is used.\n     *\n     * **Note:** This method aligns with the\n     * [ES5 implementation](https://es5.github.io/#x15.1.2.2) of `parseInt`.\n     *\n     * @static\n     * @memberOf _\n     * @since 1.1.0\n     * @category String\n     * @param {string} string The string to convert.\n     * @param {number} [radix=10] The radix to interpret `value` by.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {number} Returns the converted integer.\n     * @example\n     *\n     * _.parseInt('08');\n     * // => 8\n     *\n     * _.map(['6', '08', '10'], _.parseInt);\n     * // => [6, 8, 10]\n     */\n    function parseInt(string, radix, guard) {\n      if (guard || radix == null) {\n        radix = 0;\n      } else if (radix) {\n        radix = +radix;\n      }\n      return nativeParseInt(toString(string).replace(reTrimStart, ''), radix || 0);\n    }\n\n    /**\n     * Repeats the given string `n` times.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to repeat.\n     * @param {number} [n=1] The number of times to repeat the string.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the repeated string.\n     * @example\n     *\n     * _.repeat('*', 3);\n     * // => '***'\n     *\n     * _.repeat('abc', 2);\n     * // => 'abcabc'\n     *\n     * _.repeat('abc', 0);\n     * // => ''\n     */\n    function repeat(string, n, guard) {\n      if ((guard ? isIterateeCall(string, n, guard) : n === undefined)) {\n        n = 1;\n      } else {\n        n = toInteger(n);\n      }\n      return baseRepeat(toString(string), n);\n    }\n\n    /**\n     * Replaces matches for `pattern` in `string` with `replacement`.\n     *\n     * **Note:** This method is based on\n     * [`String#replace`](https://mdn.io/String/replace).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to modify.\n     * @param {RegExp|string} pattern The pattern to replace.\n     * @param {Function|string} replacement The match replacement.\n     * @returns {string} Returns the modified string.\n     * @example\n     *\n     * _.replace('Hi Fred', 'Fred', 'Barney');\n     * // => 'Hi Barney'\n     */\n    function replace() {\n      var args = arguments,\n          string = toString(args[0]);\n\n      return args.length < 3 ? string : string.replace(args[1], args[2]);\n    }\n\n    /**\n     * Converts `string` to\n     * [snake case](https://en.wikipedia.org/wiki/Snake_case).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the snake cased string.\n     * @example\n     *\n     * _.snakeCase('Foo Bar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('fooBar');\n     * // => 'foo_bar'\n     *\n     * _.snakeCase('--FOO-BAR--');\n     * // => 'foo_bar'\n     */\n    var snakeCase = createCompounder(function(result, word, index) {\n      return result + (index ? '_' : '') + word.toLowerCase();\n    });\n\n    /**\n     * Splits `string` by `separator`.\n     *\n     * **Note:** This method is based on\n     * [`String#split`](https://mdn.io/String/split).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to split.\n     * @param {RegExp|string} separator The separator pattern to split by.\n     * @param {number} [limit] The length to truncate results to.\n     * @returns {Array} Returns the string segments.\n     * @example\n     *\n     * _.split('a-b-c', '-', 2);\n     * // => ['a', 'b']\n     */\n    function split(string, separator, limit) {\n      if (limit && typeof limit != 'number' && isIterateeCall(string, separator, limit)) {\n        separator = limit = undefined;\n      }\n      limit = limit === undefined ? MAX_ARRAY_LENGTH : limit >>> 0;\n      if (!limit) {\n        return [];\n      }\n      string = toString(string);\n      if (string && (\n            typeof separator == 'string' ||\n            (separator != null && !isRegExp(separator))\n          )) {\n        separator = baseToString(separator);\n        if (!separator && hasUnicode(string)) {\n          return castSlice(stringToArray(string), 0, limit);\n        }\n      }\n      return string.split(separator, limit);\n    }\n\n    /**\n     * Converts `string` to\n     * [start case](https://en.wikipedia.org/wiki/Letter_case#Stylistic_or_specialised_usage).\n     *\n     * @static\n     * @memberOf _\n     * @since 3.1.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the start cased string.\n     * @example\n     *\n     * _.startCase('--foo-bar--');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('fooBar');\n     * // => 'Foo Bar'\n     *\n     * _.startCase('__FOO_BAR__');\n     * // => 'FOO BAR'\n     */\n    var startCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + upperFirst(word);\n    });\n\n    /**\n     * Checks if `string` starts with the given target string.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {string} [target] The string to search for.\n     * @param {number} [position=0] The position to search from.\n     * @returns {boolean} Returns `true` if `string` starts with `target`,\n     *  else `false`.\n     * @example\n     *\n     * _.startsWith('abc', 'a');\n     * // => true\n     *\n     * _.startsWith('abc', 'b');\n     * // => false\n     *\n     * _.startsWith('abc', 'b', 1);\n     * // => true\n     */\n    function startsWith(string, target, position) {\n      string = toString(string);\n      position = position == null\n        ? 0\n        : baseClamp(toInteger(position), 0, string.length);\n\n      target = baseToString(target);\n      return string.slice(position, position + target.length) == target;\n    }\n\n    /**\n     * Creates a compiled template function that can interpolate data properties\n     * in \"interpolate\" delimiters, HTML-escape interpolated data properties in\n     * \"escape\" delimiters, and execute JavaScript in \"evaluate\" delimiters. Data\n     * properties may be accessed as free variables in the template. If a setting\n     * object is given, it takes precedence over `_.templateSettings` values.\n     *\n     * **Note:** In the development build `_.template` utilizes\n     * [sourceURLs](http://www.html5rocks.com/en/tutorials/developertools/sourcemaps/#toc-sourceurl)\n     * for easier debugging.\n     *\n     * For more information on precompiling templates see\n     * [lodash's custom builds documentation](https://lodash.com/custom-builds).\n     *\n     * For more information on Chrome extension sandboxes see\n     * [Chrome's extensions documentation](https://developer.chrome.com/extensions/sandboxingEval).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category String\n     * @param {string} [string=''] The template string.\n     * @param {Object} [options={}] The options object.\n     * @param {RegExp} [options.escape=_.templateSettings.escape]\n     *  The HTML \"escape\" delimiter.\n     * @param {RegExp} [options.evaluate=_.templateSettings.evaluate]\n     *  The \"evaluate\" delimiter.\n     * @param {Object} [options.imports=_.templateSettings.imports]\n     *  An object to import into the template as free variables.\n     * @param {RegExp} [options.interpolate=_.templateSettings.interpolate]\n     *  The \"interpolate\" delimiter.\n     * @param {string} [options.sourceURL='lodash.templateSources[n]']\n     *  The sourceURL of the compiled template.\n     * @param {string} [options.variable='obj']\n     *  The data object variable name.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Function} Returns the compiled template function.\n     * @example\n     *\n     * // Use the \"interpolate\" delimiter to create a compiled template.\n     * var compiled = _.template('hello <%= user %>!');\n     * compiled({ 'user': 'fred' });\n     * // => 'hello fred!'\n     *\n     * // Use the HTML \"escape\" delimiter to escape data property values.\n     * var compiled = _.template('<b><%- value %></b>');\n     * compiled({ 'value': '<script>' });\n     * // => '<b>&lt;script&gt;</b>'\n     *\n     * // Use the \"evaluate\" delimiter to execute JavaScript and generate HTML.\n     * var compiled = _.template('<% _.forEach(users, function(user) { %><li><%- user %></li><% }); %>');\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the internal `print` function in \"evaluate\" delimiters.\n     * var compiled = _.template('<% print(\"hello \" + user); %>!');\n     * compiled({ 'user': 'barney' });\n     * // => 'hello barney!'\n     *\n     * // Use the ES template literal delimiter as an \"interpolate\" delimiter.\n     * // Disable support by replacing the \"interpolate\" delimiter.\n     * var compiled = _.template('hello ${ user }!');\n     * compiled({ 'user': 'pebbles' });\n     * // => 'hello pebbles!'\n     *\n     * // Use backslashes to treat delimiters as plain text.\n     * var compiled = _.template('<%= \"\\\\<%- value %\\\\>\" %>');\n     * compiled({ 'value': 'ignored' });\n     * // => '<%- value %>'\n     *\n     * // Use the `imports` option to import `jQuery` as `jq`.\n     * var text = '<% jq.each(users, function(user) { %><li><%- user %></li><% }); %>';\n     * var compiled = _.template(text, { 'imports': { 'jq': jQuery } });\n     * compiled({ 'users': ['fred', 'barney'] });\n     * // => '<li>fred</li><li>barney</li>'\n     *\n     * // Use the `sourceURL` option to specify a custom sourceURL for the template.\n     * var compiled = _.template('hello <%= user %>!', { 'sourceURL': '/basic/greeting.jst' });\n     * compiled(data);\n     * // => Find the source of \"greeting.jst\" under the Sources tab or Resources panel of the web inspector.\n     *\n     * // Use the `variable` option to ensure a with-statement isn't used in the compiled template.\n     * var compiled = _.template('hi <%= data.user %>!', { 'variable': 'data' });\n     * compiled.source;\n     * // => function(data) {\n     * //   var __t, __p = '';\n     * //   __p += 'hi ' + ((__t = ( data.user )) == null ? '' : __t) + '!';\n     * //   return __p;\n     * // }\n     *\n     * // Use custom template delimiters.\n     * _.templateSettings.interpolate = /{{([\\s\\S]+?)}}/g;\n     * var compiled = _.template('hello {{ user }}!');\n     * compiled({ 'user': 'mustache' });\n     * // => 'hello mustache!'\n     *\n     * // Use the `source` property to inline compiled templates for meaningful\n     * // line numbers in error messages and stack traces.\n     * fs.writeFileSync(path.join(process.cwd(), 'jst.js'), '\\\n     *   var JST = {\\\n     *     \"main\": ' + _.template(mainText).source + '\\\n     *   };\\\n     * ');\n     */\n    function template(string, options, guard) {\n      // Based on John Resig's `tmpl` implementation\n      // (http://ejohn.org/blog/javascript-micro-templating/)\n      // and Laura Doktorova's doT.js (https://github.com/olado/doT).\n      var settings = lodash.templateSettings;\n\n      if (guard && isIterateeCall(string, options, guard)) {\n        options = undefined;\n      }\n      string = toString(string);\n      options = assignInWith({}, options, settings, customDefaultsAssignIn);\n\n      var imports = assignInWith({}, options.imports, settings.imports, customDefaultsAssignIn),\n          importsKeys = keys(imports),\n          importsValues = baseValues(imports, importsKeys);\n\n      var isEscaping,\n          isEvaluating,\n          index = 0,\n          interpolate = options.interpolate || reNoMatch,\n          source = \"__p += '\";\n\n      // Compile the regexp to match each delimiter.\n      var reDelimiters = RegExp(\n        (options.escape || reNoMatch).source + '|' +\n        interpolate.source + '|' +\n        (interpolate === reInterpolate ? reEsTemplate : reNoMatch).source + '|' +\n        (options.evaluate || reNoMatch).source + '|$'\n      , 'g');\n\n      // Use a sourceURL for easier debugging.\n      // The sourceURL gets injected into the source that's eval-ed, so be careful\n      // to normalize all kinds of whitespace, so e.g. newlines (and unicode versions of it) can't sneak in\n      // and escape the comment, thus injecting code that gets evaled.\n      var sourceURL = '//# sourceURL=' +\n        (hasOwnProperty.call(options, 'sourceURL')\n          ? (options.sourceURL + '').replace(/\\s/g, ' ')\n          : ('lodash.templateSources[' + (++templateCounter) + ']')\n        ) + '\\n';\n\n      string.replace(reDelimiters, function(match, escapeValue, interpolateValue, esTemplateValue, evaluateValue, offset) {\n        interpolateValue || (interpolateValue = esTemplateValue);\n\n        // Escape characters that can't be included in string literals.\n        source += string.slice(index, offset).replace(reUnescapedString, escapeStringChar);\n\n        // Replace delimiters with snippets.\n        if (escapeValue) {\n          isEscaping = true;\n          source += \"' +\\n__e(\" + escapeValue + \") +\\n'\";\n        }\n        if (evaluateValue) {\n          isEvaluating = true;\n          source += \"';\\n\" + evaluateValue + \";\\n__p += '\";\n        }\n        if (interpolateValue) {\n          source += \"' +\\n((__t = (\" + interpolateValue + \")) == null ? '' : __t) +\\n'\";\n        }\n        index = offset + match.length;\n\n        // The JS engine embedded in Adobe products needs `match` returned in\n        // order to produce the correct `offset` value.\n        return match;\n      });\n\n      source += \"';\\n\";\n\n      // If `variable` is not specified wrap a with-statement around the generated\n      // code to add the data object to the top of the scope chain.\n      var variable = hasOwnProperty.call(options, 'variable') && options.variable;\n      if (!variable) {\n        source = 'with (obj) {\\n' + source + '\\n}\\n';\n      }\n      // Throw an error if a forbidden character was found in `variable`, to prevent\n      // potential command injection attacks.\n      else if (reForbiddenIdentifierChars.test(variable)) {\n        throw new Error(INVALID_TEMPL_VAR_ERROR_TEXT);\n      }\n\n      // Cleanup code by stripping empty strings.\n      source = (isEvaluating ? source.replace(reEmptyStringLeading, '') : source)\n        .replace(reEmptyStringMiddle, '$1')\n        .replace(reEmptyStringTrailing, '$1;');\n\n      // Frame code as the function body.\n      source = 'function(' + (variable || 'obj') + ') {\\n' +\n        (variable\n          ? ''\n          : 'obj || (obj = {});\\n'\n        ) +\n        \"var __t, __p = ''\" +\n        (isEscaping\n           ? ', __e = _.escape'\n           : ''\n        ) +\n        (isEvaluating\n          ? ', __j = Array.prototype.join;\\n' +\n            \"function print() { __p += __j.call(arguments, '') }\\n\"\n          : ';\\n'\n        ) +\n        source +\n        'return __p\\n}';\n\n      var result = attempt(function() {\n        return Function(importsKeys, sourceURL + 'return ' + source)\n          .apply(undefined, importsValues);\n      });\n\n      // Provide the compiled function's source by its `toString` method or\n      // the `source` property as a convenience for inlining compiled templates.\n      result.source = source;\n      if (isError(result)) {\n        throw result;\n      }\n      return result;\n    }\n\n    /**\n     * Converts `string`, as a whole, to lower case just like\n     * [String#toLowerCase](https://mdn.io/toLowerCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the lower cased string.\n     * @example\n     *\n     * _.toLower('--Foo-Bar--');\n     * // => '--foo-bar--'\n     *\n     * _.toLower('fooBar');\n     * // => 'foobar'\n     *\n     * _.toLower('__FOO_BAR__');\n     * // => '__foo_bar__'\n     */\n    function toLower(value) {\n      return toString(value).toLowerCase();\n    }\n\n    /**\n     * Converts `string`, as a whole, to upper case just like\n     * [String#toUpperCase](https://mdn.io/toUpperCase).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.toUpper('--foo-bar--');\n     * // => '--FOO-BAR--'\n     *\n     * _.toUpper('fooBar');\n     * // => 'FOOBAR'\n     *\n     * _.toUpper('__foo_bar__');\n     * // => '__FOO_BAR__'\n     */\n    function toUpper(value) {\n      return toString(value).toUpperCase();\n    }\n\n    /**\n     * Removes leading and trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trim('  abc  ');\n     * // => 'abc'\n     *\n     * _.trim('-_-abc-_-', '_-');\n     * // => 'abc'\n     *\n     * _.map(['  foo  ', '  bar  '], _.trim);\n     * // => ['foo', 'bar']\n     */\n    function trim(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return baseTrim(string);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          chrSymbols = stringToArray(chars),\n          start = charsStartIndex(strSymbols, chrSymbols),\n          end = charsEndIndex(strSymbols, chrSymbols) + 1;\n\n      return castSlice(strSymbols, start, end).join('');\n    }\n\n    /**\n     * Removes trailing whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimEnd('  abc  ');\n     * // => '  abc'\n     *\n     * _.trimEnd('-_-abc-_-', '_-');\n     * // => '-_-abc'\n     */\n    function trimEnd(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.slice(0, trimmedEndIndex(string) + 1);\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          end = charsEndIndex(strSymbols, stringToArray(chars)) + 1;\n\n      return castSlice(strSymbols, 0, end).join('');\n    }\n\n    /**\n     * Removes leading whitespace or specified characters from `string`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to trim.\n     * @param {string} [chars=whitespace] The characters to trim.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {string} Returns the trimmed string.\n     * @example\n     *\n     * _.trimStart('  abc  ');\n     * // => 'abc  '\n     *\n     * _.trimStart('-_-abc-_-', '_-');\n     * // => 'abc-_-'\n     */\n    function trimStart(string, chars, guard) {\n      string = toString(string);\n      if (string && (guard || chars === undefined)) {\n        return string.replace(reTrimStart, '');\n      }\n      if (!string || !(chars = baseToString(chars))) {\n        return string;\n      }\n      var strSymbols = stringToArray(string),\n          start = charsStartIndex(strSymbols, stringToArray(chars));\n\n      return castSlice(strSymbols, start).join('');\n    }\n\n    /**\n     * Truncates `string` if it's longer than the given maximum string length.\n     * The last characters of the truncated string are replaced with the omission\n     * string which defaults to \"...\".\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to truncate.\n     * @param {Object} [options={}] The options object.\n     * @param {number} [options.length=30] The maximum string length.\n     * @param {string} [options.omission='...'] The string to indicate text is omitted.\n     * @param {RegExp|string} [options.separator] The separator pattern to truncate to.\n     * @returns {string} Returns the truncated string.\n     * @example\n     *\n     * _.truncate('hi-diddly-ho there, neighborino');\n     * // => 'hi-diddly-ho there, neighbo...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': ' '\n     * });\n     * // => 'hi-diddly-ho there,...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'length': 24,\n     *   'separator': /,? +/\n     * });\n     * // => 'hi-diddly-ho there...'\n     *\n     * _.truncate('hi-diddly-ho there, neighborino', {\n     *   'omission': ' [...]'\n     * });\n     * // => 'hi-diddly-ho there, neig [...]'\n     */\n    function truncate(string, options) {\n      var length = DEFAULT_TRUNC_LENGTH,\n          omission = DEFAULT_TRUNC_OMISSION;\n\n      if (isObject(options)) {\n        var separator = 'separator' in options ? options.separator : separator;\n        length = 'length' in options ? toInteger(options.length) : length;\n        omission = 'omission' in options ? baseToString(options.omission) : omission;\n      }\n      string = toString(string);\n\n      var strLength = string.length;\n      if (hasUnicode(string)) {\n        var strSymbols = stringToArray(string);\n        strLength = strSymbols.length;\n      }\n      if (length >= strLength) {\n        return string;\n      }\n      var end = length - stringSize(omission);\n      if (end < 1) {\n        return omission;\n      }\n      var result = strSymbols\n        ? castSlice(strSymbols, 0, end).join('')\n        : string.slice(0, end);\n\n      if (separator === undefined) {\n        return result + omission;\n      }\n      if (strSymbols) {\n        end += (result.length - end);\n      }\n      if (isRegExp(separator)) {\n        if (string.slice(end).search(separator)) {\n          var match,\n              substring = result;\n\n          if (!separator.global) {\n            separator = RegExp(separator.source, toString(reFlags.exec(separator)) + 'g');\n          }\n          separator.lastIndex = 0;\n          while ((match = separator.exec(substring))) {\n            var newEnd = match.index;\n          }\n          result = result.slice(0, newEnd === undefined ? end : newEnd);\n        }\n      } else if (string.indexOf(baseToString(separator), end) != end) {\n        var index = result.lastIndexOf(separator);\n        if (index > -1) {\n          result = result.slice(0, index);\n        }\n      }\n      return result + omission;\n    }\n\n    /**\n     * The inverse of `_.escape`; this method converts the HTML entities\n     * `&amp;`, `&lt;`, `&gt;`, `&quot;`, and `&#39;` in `string` to\n     * their corresponding characters.\n     *\n     * **Note:** No other HTML entities are unescaped. To unescape additional\n     * HTML entities use a third-party library like [_he_](https://mths.be/he).\n     *\n     * @static\n     * @memberOf _\n     * @since 0.6.0\n     * @category String\n     * @param {string} [string=''] The string to unescape.\n     * @returns {string} Returns the unescaped string.\n     * @example\n     *\n     * _.unescape('fred, barney, &amp; pebbles');\n     * // => 'fred, barney, & pebbles'\n     */\n    function unescape(string) {\n      string = toString(string);\n      return (string && reHasEscapedHtml.test(string))\n        ? string.replace(reEscapedHtml, unescapeHtmlChar)\n        : string;\n    }\n\n    /**\n     * Converts `string`, as space separated words, to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the upper cased string.\n     * @example\n     *\n     * _.upperCase('--foo-bar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('fooBar');\n     * // => 'FOO BAR'\n     *\n     * _.upperCase('__foo_bar__');\n     * // => 'FOO BAR'\n     */\n    var upperCase = createCompounder(function(result, word, index) {\n      return result + (index ? ' ' : '') + word.toUpperCase();\n    });\n\n    /**\n     * Converts the first character of `string` to upper case.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category String\n     * @param {string} [string=''] The string to convert.\n     * @returns {string} Returns the converted string.\n     * @example\n     *\n     * _.upperFirst('fred');\n     * // => 'Fred'\n     *\n     * _.upperFirst('FRED');\n     * // => 'FRED'\n     */\n    var upperFirst = createCaseFirst('toUpperCase');\n\n    /**\n     * Splits `string` into an array of its words.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category String\n     * @param {string} [string=''] The string to inspect.\n     * @param {RegExp|string} [pattern] The pattern to match words.\n     * @param- {Object} [guard] Enables use as an iteratee for methods like `_.map`.\n     * @returns {Array} Returns the words of `string`.\n     * @example\n     *\n     * _.words('fred, barney, & pebbles');\n     * // => ['fred', 'barney', 'pebbles']\n     *\n     * _.words('fred, barney, & pebbles', /[^, ]+/g);\n     * // => ['fred', 'barney', '&', 'pebbles']\n     */\n    function words(string, pattern, guard) {\n      string = toString(string);\n      pattern = guard ? undefined : pattern;\n\n      if (pattern === undefined) {\n        return hasUnicodeWord(string) ? unicodeWords(string) : asciiWords(string);\n      }\n      return string.match(pattern) || [];\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Attempts to invoke `func`, returning either the result or the caught error\n     * object. Any additional arguments are provided to `func` when it's invoked.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Function} func The function to attempt.\n     * @param {...*} [args] The arguments to invoke `func` with.\n     * @returns {*} Returns the `func` result or error object.\n     * @example\n     *\n     * // Avoid throwing errors for invalid selectors.\n     * var elements = _.attempt(function(selector) {\n     *   return document.querySelectorAll(selector);\n     * }, '>_>');\n     *\n     * if (_.isError(elements)) {\n     *   elements = [];\n     * }\n     */\n    var attempt = baseRest(function(func, args) {\n      try {\n        return apply(func, undefined, args);\n      } catch (e) {\n        return isError(e) ? e : new Error(e);\n      }\n    });\n\n    /**\n     * Binds methods of an object to the object itself, overwriting the existing\n     * method.\n     *\n     * **Note:** This method doesn't set the \"length\" property of bound functions.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Object} object The object to bind and assign the bound methods to.\n     * @param {...(string|string[])} methodNames The object method names to bind.\n     * @returns {Object} Returns `object`.\n     * @example\n     *\n     * var view = {\n     *   'label': 'docs',\n     *   'click': function() {\n     *     console.log('clicked ' + this.label);\n     *   }\n     * };\n     *\n     * _.bindAll(view, ['click']);\n     * jQuery(element).on('click', view.click);\n     * // => Logs 'clicked docs' when clicked.\n     */\n    var bindAll = flatRest(function(object, methodNames) {\n      arrayEach(methodNames, function(key) {\n        key = toKey(key);\n        baseAssignValue(object, key, bind(object[key], object));\n      });\n      return object;\n    });\n\n    /**\n     * Creates a function that iterates over `pairs` and invokes the corresponding\n     * function of the first predicate to return truthy. The predicate-function\n     * pairs are invoked with the `this` binding and arguments of the created\n     * function.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Array} pairs The predicate-function pairs.\n     * @returns {Function} Returns the new composite function.\n     * @example\n     *\n     * var func = _.cond([\n     *   [_.matches({ 'a': 1 }),           _.constant('matches A')],\n     *   [_.conforms({ 'b': _.isNumber }), _.constant('matches B')],\n     *   [_.stubTrue,                      _.constant('no match')]\n     * ]);\n     *\n     * func({ 'a': 1, 'b': 2 });\n     * // => 'matches A'\n     *\n     * func({ 'a': 0, 'b': 1 });\n     * // => 'matches B'\n     *\n     * func({ 'a': '1', 'b': '2' });\n     * // => 'no match'\n     */\n    function cond(pairs) {\n      var length = pairs == null ? 0 : pairs.length,\n          toIteratee = getIteratee();\n\n      pairs = !length ? [] : arrayMap(pairs, function(pair) {\n        if (typeof pair[1] != 'function') {\n          throw new TypeError(FUNC_ERROR_TEXT);\n        }\n        return [toIteratee(pair[0]), pair[1]];\n      });\n\n      return baseRest(function(args) {\n        var index = -1;\n        while (++index < length) {\n          var pair = pairs[index];\n          if (apply(pair[0], this, args)) {\n            return apply(pair[1], this, args);\n          }\n        }\n      });\n    }\n\n    /**\n     * Creates a function that invokes the predicate properties of `source` with\n     * the corresponding property values of a given object, returning `true` if\n     * all predicates return truthy, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.conformsTo` with\n     * `source` partially applied.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {Object} source The object of property predicates to conform to.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 2, 'b': 1 },\n     *   { 'a': 1, 'b': 2 }\n     * ];\n     *\n     * _.filter(objects, _.conforms({ 'b': function(n) { return n > 1; } }));\n     * // => [{ 'a': 1, 'b': 2 }]\n     */\n    function conforms(source) {\n      return baseConforms(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that returns `value`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {*} value The value to return from the new function.\n     * @returns {Function} Returns the new constant function.\n     * @example\n     *\n     * var objects = _.times(2, _.constant({ 'a': 1 }));\n     *\n     * console.log(objects);\n     * // => [{ 'a': 1 }, { 'a': 1 }]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => true\n     */\n    function constant(value) {\n      return function() {\n        return value;\n      };\n    }\n\n    /**\n     * Checks `value` to determine whether a default value should be returned in\n     * its place. The `defaultValue` is returned if `value` is `NaN`, `null`,\n     * or `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.14.0\n     * @category Util\n     * @param {*} value The value to check.\n     * @param {*} defaultValue The default value.\n     * @returns {*} Returns the resolved value.\n     * @example\n     *\n     * _.defaultTo(1, 10);\n     * // => 1\n     *\n     * _.defaultTo(undefined, 10);\n     * // => 10\n     */\n    function defaultTo(value, defaultValue) {\n      return (value == null || value !== value) ? defaultValue : value;\n    }\n\n    /**\n     * Creates a function that returns the result of invoking the given functions\n     * with the `this` binding of the created function, where each successive\n     * invocation is supplied the return value of the previous.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flowRight\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flow([_.add, square]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flow = createFlow();\n\n    /**\n     * This method is like `_.flow` except that it creates a function that\n     * invokes the given functions from right to left.\n     *\n     * @static\n     * @since 3.0.0\n     * @memberOf _\n     * @category Util\n     * @param {...(Function|Function[])} [funcs] The functions to invoke.\n     * @returns {Function} Returns the new composite function.\n     * @see _.flow\n     * @example\n     *\n     * function square(n) {\n     *   return n * n;\n     * }\n     *\n     * var addSquare = _.flowRight([square, _.add]);\n     * addSquare(1, 2);\n     * // => 9\n     */\n    var flowRight = createFlow(true);\n\n    /**\n     * This method returns the first argument it receives.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {*} value Any value.\n     * @returns {*} Returns `value`.\n     * @example\n     *\n     * var object = { 'a': 1 };\n     *\n     * console.log(_.identity(object) === object);\n     * // => true\n     */\n    function identity(value) {\n      return value;\n    }\n\n    /**\n     * Creates a function that invokes `func` with the arguments of the created\n     * function. If `func` is a property name, the created function returns the\n     * property value for a given element. If `func` is an array or object, the\n     * created function returns `true` for elements that contain the equivalent\n     * source properties, otherwise it returns `false`.\n     *\n     * @static\n     * @since 4.0.0\n     * @memberOf _\n     * @category Util\n     * @param {*} [func=_.identity] The value to convert to a callback.\n     * @returns {Function} Returns the callback.\n     * @example\n     *\n     * var users = [\n     *   { 'user': 'barney', 'age': 36, 'active': true },\n     *   { 'user': 'fred',   'age': 40, 'active': false }\n     * ];\n     *\n     * // The `_.matches` iteratee shorthand.\n     * _.filter(users, _.iteratee({ 'user': 'barney', 'active': true }));\n     * // => [{ 'user': 'barney', 'age': 36, 'active': true }]\n     *\n     * // The `_.matchesProperty` iteratee shorthand.\n     * _.filter(users, _.iteratee(['user', 'fred']));\n     * // => [{ 'user': 'fred', 'age': 40 }]\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.map(users, _.iteratee('user'));\n     * // => ['barney', 'fred']\n     *\n     * // Create custom iteratee shorthands.\n     * _.iteratee = _.wrap(_.iteratee, function(iteratee, func) {\n     *   return !_.isRegExp(func) ? iteratee(func) : function(string) {\n     *     return func.test(string);\n     *   };\n     * });\n     *\n     * _.filter(['abc', 'def'], /ef/);\n     * // => ['def']\n     */\n    function iteratee(func) {\n      return baseIteratee(typeof func == 'function' ? func : baseClone(func, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between a given\n     * object and `source`, returning `true` if the given object has equivalent\n     * property values, else `false`.\n     *\n     * **Note:** The created function is equivalent to `_.isMatch` with `source`\n     * partially applied.\n     *\n     * Partial comparisons will match empty array and empty object `source`\n     * values against any array or object value, respectively. See `_.isEqual`\n     * for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} source The object of property values to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.filter(objects, _.matches({ 'a': 4, 'c': 6 }));\n     * // => [{ 'a': 4, 'b': 5, 'c': 6 }]\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matches({ 'a': 1 }), _.matches({ 'a': 4 })]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matches(source) {\n      return baseMatches(baseClone(source, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that performs a partial deep comparison between the\n     * value at `path` of a given object to `srcValue`, returning `true` if the\n     * object value is equivalent, else `false`.\n     *\n     * **Note:** Partial comparisons will match empty array and empty object\n     * `srcValue` values against any array or object value, respectively. See\n     * `_.isEqual` for a list of supported value comparisons.\n     *\n     * **Note:** Multiple values can be checked by combining several matchers\n     * using `_.overSome`\n     *\n     * @static\n     * @memberOf _\n     * @since 3.2.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @param {*} srcValue The value to match.\n     * @returns {Function} Returns the new spec function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': 1, 'b': 2, 'c': 3 },\n     *   { 'a': 4, 'b': 5, 'c': 6 }\n     * ];\n     *\n     * _.find(objects, _.matchesProperty('a', 4));\n     * // => { 'a': 4, 'b': 5, 'c': 6 }\n     *\n     * // Checking for several possible values\n     * _.filter(objects, _.overSome([_.matchesProperty('a', 1), _.matchesProperty('a', 4)]));\n     * // => [{ 'a': 1, 'b': 2, 'c': 3 }, { 'a': 4, 'b': 5, 'c': 6 }]\n     */\n    function matchesProperty(path, srcValue) {\n      return baseMatchesProperty(path, baseClone(srcValue, CLONE_DEEP_FLAG));\n    }\n\n    /**\n     * Creates a function that invokes the method at `path` of a given object.\n     * Any additional arguments are provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Array|string} path The path of the method to invoke.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': _.constant(2) } },\n     *   { 'a': { 'b': _.constant(1) } }\n     * ];\n     *\n     * _.map(objects, _.method('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(objects, _.method(['a', 'b']));\n     * // => [2, 1]\n     */\n    var method = baseRest(function(path, args) {\n      return function(object) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * The opposite of `_.method`; this method creates a function that invokes\n     * the method at a given path of `object`. Any additional arguments are\n     * provided to the invoked method.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.7.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @param {...*} [args] The arguments to invoke the method with.\n     * @returns {Function} Returns the new invoker function.\n     * @example\n     *\n     * var array = _.times(3, _.constant),\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.methodOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.methodOf(object));\n     * // => [2, 0]\n     */\n    var methodOf = baseRest(function(object, args) {\n      return function(path) {\n        return baseInvoke(object, path, args);\n      };\n    });\n\n    /**\n     * Adds all own enumerable string keyed function properties of a source\n     * object to the destination object. If `object` is a function, then methods\n     * are added to its prototype as well.\n     *\n     * **Note:** Use `_.runInContext` to create a pristine `lodash` function to\n     * avoid conflicts caused by modifying the original.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {Function|Object} [object=lodash] The destination object.\n     * @param {Object} source The object of functions to add.\n     * @param {Object} [options={}] The options object.\n     * @param {boolean} [options.chain=true] Specify whether mixins are chainable.\n     * @returns {Function|Object} Returns `object`.\n     * @example\n     *\n     * function vowels(string) {\n     *   return _.filter(string, function(v) {\n     *     return /[aeiou]/i.test(v);\n     *   });\n     * }\n     *\n     * _.mixin({ 'vowels': vowels });\n     * _.vowels('fred');\n     * // => ['e']\n     *\n     * _('fred').vowels().value();\n     * // => ['e']\n     *\n     * _.mixin({ 'vowels': vowels }, { 'chain': false });\n     * _('fred').vowels();\n     * // => ['e']\n     */\n    function mixin(object, source, options) {\n      var props = keys(source),\n          methodNames = baseFunctions(source, props);\n\n      if (options == null &&\n          !(isObject(source) && (methodNames.length || !props.length))) {\n        options = source;\n        source = object;\n        object = this;\n        methodNames = baseFunctions(source, keys(source));\n      }\n      var chain = !(isObject(options) && 'chain' in options) || !!options.chain,\n          isFunc = isFunction(object);\n\n      arrayEach(methodNames, function(methodName) {\n        var func = source[methodName];\n        object[methodName] = func;\n        if (isFunc) {\n          object.prototype[methodName] = function() {\n            var chainAll = this.__chain__;\n            if (chain || chainAll) {\n              var result = object(this.__wrapped__),\n                  actions = result.__actions__ = copyArray(this.__actions__);\n\n              actions.push({ 'func': func, 'args': arguments, 'thisArg': object });\n              result.__chain__ = chainAll;\n              return result;\n            }\n            return func.apply(object, arrayPush([this.value()], arguments));\n          };\n        }\n      });\n\n      return object;\n    }\n\n    /**\n     * Reverts the `_` variable to its previous value and returns a reference to\n     * the `lodash` function.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @returns {Function} Returns the `lodash` function.\n     * @example\n     *\n     * var lodash = _.noConflict();\n     */\n    function noConflict() {\n      if (root._ === this) {\n        root._ = oldDash;\n      }\n      return this;\n    }\n\n    /**\n     * This method returns `undefined`.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.3.0\n     * @category Util\n     * @example\n     *\n     * _.times(2, _.noop);\n     * // => [undefined, undefined]\n     */\n    function noop() {\n      // No operation performed.\n    }\n\n    /**\n     * Creates a function that gets the argument at index `n`. If `n` is negative,\n     * the nth argument from the end is returned.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [n=0] The index of the argument to return.\n     * @returns {Function} Returns the new pass-thru function.\n     * @example\n     *\n     * var func = _.nthArg(1);\n     * func('a', 'b', 'c', 'd');\n     * // => 'b'\n     *\n     * var func = _.nthArg(-2);\n     * func('a', 'b', 'c', 'd');\n     * // => 'c'\n     */\n    function nthArg(n) {\n      n = toInteger(n);\n      return baseRest(function(args) {\n        return baseNth(args, n);\n      });\n    }\n\n    /**\n     * Creates a function that invokes `iteratees` with the arguments it receives\n     * and returns their results.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [iteratees=[_.identity]]\n     *  The iteratees to invoke.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.over([Math.max, Math.min]);\n     *\n     * func(1, 2, 3, 4);\n     * // => [4, 1]\n     */\n    var over = createOver(arrayMap);\n\n    /**\n     * Creates a function that checks if **all** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overEvery([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => false\n     *\n     * func(NaN);\n     * // => false\n     */\n    var overEvery = createOver(arrayEvery);\n\n    /**\n     * Creates a function that checks if **any** of the `predicates` return\n     * truthy when invoked with the arguments it receives.\n     *\n     * Following shorthands are possible for providing predicates.\n     * Pass an `Object` and it will be used as an parameter for `_.matches` to create the predicate.\n     * Pass an `Array` of parameters for `_.matchesProperty` and the predicate will be created using them.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {...(Function|Function[])} [predicates=[_.identity]]\n     *  The predicates to check.\n     * @returns {Function} Returns the new function.\n     * @example\n     *\n     * var func = _.overSome([Boolean, isFinite]);\n     *\n     * func('1');\n     * // => true\n     *\n     * func(null);\n     * // => true\n     *\n     * func(NaN);\n     * // => false\n     *\n     * var matchesFunc = _.overSome([{ 'a': 1 }, { 'a': 2 }])\n     * var matchesPropertyFunc = _.overSome([['a', 1], ['a', 2]])\n     */\n    var overSome = createOver(arraySome);\n\n    /**\n     * Creates a function that returns the value at `path` of a given object.\n     *\n     * @static\n     * @memberOf _\n     * @since 2.4.0\n     * @category Util\n     * @param {Array|string} path The path of the property to get.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var objects = [\n     *   { 'a': { 'b': 2 } },\n     *   { 'a': { 'b': 1 } }\n     * ];\n     *\n     * _.map(objects, _.property('a.b'));\n     * // => [2, 1]\n     *\n     * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n     * // => [1, 2]\n     */\n    function property(path) {\n      return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n    }\n\n    /**\n     * The opposite of `_.property`; this method creates a function that returns\n     * the value at a given path of `object`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.0.0\n     * @category Util\n     * @param {Object} object The object to query.\n     * @returns {Function} Returns the new accessor function.\n     * @example\n     *\n     * var array = [0, 1, 2],\n     *     object = { 'a': array, 'b': array, 'c': array };\n     *\n     * _.map(['a[2]', 'c[0]'], _.propertyOf(object));\n     * // => [2, 0]\n     *\n     * _.map([['a', '2'], ['c', '0']], _.propertyOf(object));\n     * // => [2, 0]\n     */\n    function propertyOf(object) {\n      return function(path) {\n        return object == null ? undefined : baseGet(object, path);\n      };\n    }\n\n    /**\n     * Creates an array of numbers (positive and/or negative) progressing from\n     * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n     * `start` is specified without an `end` or `step`. If `end` is not specified,\n     * it's set to `start` with `start` then set to `0`.\n     *\n     * **Note:** JavaScript follows the IEEE-754 standard for resolving\n     * floating-point values which can produce unexpected results.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.rangeRight\n     * @example\n     *\n     * _.range(4);\n     * // => [0, 1, 2, 3]\n     *\n     * _.range(-4);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 5);\n     * // => [1, 2, 3, 4]\n     *\n     * _.range(0, 20, 5);\n     * // => [0, 5, 10, 15]\n     *\n     * _.range(0, -4, -1);\n     * // => [0, -1, -2, -3]\n     *\n     * _.range(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.range(0);\n     * // => []\n     */\n    var range = createRange();\n\n    /**\n     * This method is like `_.range` except that it populates values in\n     * descending order.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {number} [start=0] The start of the range.\n     * @param {number} end The end of the range.\n     * @param {number} [step=1] The value to increment or decrement by.\n     * @returns {Array} Returns the range of numbers.\n     * @see _.inRange, _.range\n     * @example\n     *\n     * _.rangeRight(4);\n     * // => [3, 2, 1, 0]\n     *\n     * _.rangeRight(-4);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 5);\n     * // => [4, 3, 2, 1]\n     *\n     * _.rangeRight(0, 20, 5);\n     * // => [15, 10, 5, 0]\n     *\n     * _.rangeRight(0, -4, -1);\n     * // => [-3, -2, -1, 0]\n     *\n     * _.rangeRight(1, 4, 0);\n     * // => [1, 1, 1]\n     *\n     * _.rangeRight(0);\n     * // => []\n     */\n    var rangeRight = createRange(true);\n\n    /**\n     * This method returns a new empty array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Array} Returns the new empty array.\n     * @example\n     *\n     * var arrays = _.times(2, _.stubArray);\n     *\n     * console.log(arrays);\n     * // => [[], []]\n     *\n     * console.log(arrays[0] === arrays[1]);\n     * // => false\n     */\n    function stubArray() {\n      return [];\n    }\n\n    /**\n     * This method returns `false`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `false`.\n     * @example\n     *\n     * _.times(2, _.stubFalse);\n     * // => [false, false]\n     */\n    function stubFalse() {\n      return false;\n    }\n\n    /**\n     * This method returns a new empty object.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {Object} Returns the new empty object.\n     * @example\n     *\n     * var objects = _.times(2, _.stubObject);\n     *\n     * console.log(objects);\n     * // => [{}, {}]\n     *\n     * console.log(objects[0] === objects[1]);\n     * // => false\n     */\n    function stubObject() {\n      return {};\n    }\n\n    /**\n     * This method returns an empty string.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {string} Returns the empty string.\n     * @example\n     *\n     * _.times(2, _.stubString);\n     * // => ['', '']\n     */\n    function stubString() {\n      return '';\n    }\n\n    /**\n     * This method returns `true`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.13.0\n     * @category Util\n     * @returns {boolean} Returns `true`.\n     * @example\n     *\n     * _.times(2, _.stubTrue);\n     * // => [true, true]\n     */\n    function stubTrue() {\n      return true;\n    }\n\n    /**\n     * Invokes the iteratee `n` times, returning an array of the results of\n     * each invocation. The iteratee is invoked with one argument; (index).\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {number} n The number of times to invoke `iteratee`.\n     * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n     * @returns {Array} Returns the array of results.\n     * @example\n     *\n     * _.times(3, String);\n     * // => ['0', '1', '2']\n     *\n     *  _.times(4, _.constant(0));\n     * // => [0, 0, 0, 0]\n     */\n    function times(n, iteratee) {\n      n = toInteger(n);\n      if (n < 1 || n > MAX_SAFE_INTEGER) {\n        return [];\n      }\n      var index = MAX_ARRAY_LENGTH,\n          length = nativeMin(n, MAX_ARRAY_LENGTH);\n\n      iteratee = getIteratee(iteratee);\n      n -= MAX_ARRAY_LENGTH;\n\n      var result = baseTimes(length, iteratee);\n      while (++index < n) {\n        iteratee(index);\n      }\n      return result;\n    }\n\n    /**\n     * Converts `value` to a property path array.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Util\n     * @param {*} value The value to convert.\n     * @returns {Array} Returns the new property path array.\n     * @example\n     *\n     * _.toPath('a.b.c');\n     * // => ['a', 'b', 'c']\n     *\n     * _.toPath('a[0].b.c');\n     * // => ['a', '0', 'b', 'c']\n     */\n    function toPath(value) {\n      if (isArray(value)) {\n        return arrayMap(value, toKey);\n      }\n      return isSymbol(value) ? [value] : copyArray(stringToPath(toString(value)));\n    }\n\n    /**\n     * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Util\n     * @param {string} [prefix=''] The value to prefix the ID with.\n     * @returns {string} Returns the unique ID.\n     * @example\n     *\n     * _.uniqueId('contact_');\n     * // => 'contact_104'\n     *\n     * _.uniqueId();\n     * // => '105'\n     */\n    function uniqueId(prefix) {\n      var id = ++idCounter;\n      return toString(prefix) + id;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * Adds two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {number} augend The first number in an addition.\n     * @param {number} addend The second number in an addition.\n     * @returns {number} Returns the total.\n     * @example\n     *\n     * _.add(6, 4);\n     * // => 10\n     */\n    var add = createMathOperation(function(augend, addend) {\n      return augend + addend;\n    }, 0);\n\n    /**\n     * Computes `number` rounded up to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round up.\n     * @param {number} [precision=0] The precision to round up to.\n     * @returns {number} Returns the rounded up number.\n     * @example\n     *\n     * _.ceil(4.006);\n     * // => 5\n     *\n     * _.ceil(6.004, 2);\n     * // => 6.01\n     *\n     * _.ceil(6040, -2);\n     * // => 6100\n     */\n    var ceil = createRound('ceil');\n\n    /**\n     * Divide two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} dividend The first number in a division.\n     * @param {number} divisor The second number in a division.\n     * @returns {number} Returns the quotient.\n     * @example\n     *\n     * _.divide(6, 4);\n     * // => 1.5\n     */\n    var divide = createMathOperation(function(dividend, divisor) {\n      return dividend / divisor;\n    }, 1);\n\n    /**\n     * Computes `number` rounded down to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round down.\n     * @param {number} [precision=0] The precision to round down to.\n     * @returns {number} Returns the rounded down number.\n     * @example\n     *\n     * _.floor(4.006);\n     * // => 4\n     *\n     * _.floor(0.046, 2);\n     * // => 0.04\n     *\n     * _.floor(4060, -2);\n     * // => 4000\n     */\n    var floor = createRound('floor');\n\n    /**\n     * Computes the maximum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * _.max([4, 2, 8, 6]);\n     * // => 8\n     *\n     * _.max([]);\n     * // => undefined\n     */\n    function max(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseGt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.max` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the maximum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.maxBy(objects, function(o) { return o.n; });\n     * // => { 'n': 2 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.maxBy(objects, 'n');\n     * // => { 'n': 2 }\n     */\n    function maxBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseGt)\n        : undefined;\n    }\n\n    /**\n     * Computes the mean of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * _.mean([4, 2, 8, 6]);\n     * // => 5\n     */\n    function mean(array) {\n      return baseMean(array, identity);\n    }\n\n    /**\n     * This method is like `_.mean` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be averaged.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the mean.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.meanBy(objects, function(o) { return o.n; });\n     * // => 5\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.meanBy(objects, 'n');\n     * // => 5\n     */\n    function meanBy(array, iteratee) {\n      return baseMean(array, getIteratee(iteratee, 2));\n    }\n\n    /**\n     * Computes the minimum value of `array`. If `array` is empty or falsey,\n     * `undefined` is returned.\n     *\n     * @static\n     * @since 0.1.0\n     * @memberOf _\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * _.min([4, 2, 8, 6]);\n     * // => 2\n     *\n     * _.min([]);\n     * // => undefined\n     */\n    function min(array) {\n      return (array && array.length)\n        ? baseExtremum(array, identity, baseLt)\n        : undefined;\n    }\n\n    /**\n     * This method is like `_.min` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the criterion by which\n     * the value is ranked. The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {*} Returns the minimum value.\n     * @example\n     *\n     * var objects = [{ 'n': 1 }, { 'n': 2 }];\n     *\n     * _.minBy(objects, function(o) { return o.n; });\n     * // => { 'n': 1 }\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.minBy(objects, 'n');\n     * // => { 'n': 1 }\n     */\n    function minBy(array, iteratee) {\n      return (array && array.length)\n        ? baseExtremum(array, getIteratee(iteratee, 2), baseLt)\n        : undefined;\n    }\n\n    /**\n     * Multiply two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.7.0\n     * @category Math\n     * @param {number} multiplier The first number in a multiplication.\n     * @param {number} multiplicand The second number in a multiplication.\n     * @returns {number} Returns the product.\n     * @example\n     *\n     * _.multiply(6, 4);\n     * // => 24\n     */\n    var multiply = createMathOperation(function(multiplier, multiplicand) {\n      return multiplier * multiplicand;\n    }, 1);\n\n    /**\n     * Computes `number` rounded to `precision`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.10.0\n     * @category Math\n     * @param {number} number The number to round.\n     * @param {number} [precision=0] The precision to round to.\n     * @returns {number} Returns the rounded number.\n     * @example\n     *\n     * _.round(4.006);\n     * // => 4\n     *\n     * _.round(4.006, 2);\n     * // => 4.01\n     *\n     * _.round(4060, -2);\n     * // => 4100\n     */\n    var round = createRound('round');\n\n    /**\n     * Subtract two numbers.\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {number} minuend The first number in a subtraction.\n     * @param {number} subtrahend The second number in a subtraction.\n     * @returns {number} Returns the difference.\n     * @example\n     *\n     * _.subtract(6, 4);\n     * // => 2\n     */\n    var subtract = createMathOperation(function(minuend, subtrahend) {\n      return minuend - subtrahend;\n    }, 0);\n\n    /**\n     * Computes the sum of the values in `array`.\n     *\n     * @static\n     * @memberOf _\n     * @since 3.4.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * _.sum([4, 2, 8, 6]);\n     * // => 20\n     */\n    function sum(array) {\n      return (array && array.length)\n        ? baseSum(array, identity)\n        : 0;\n    }\n\n    /**\n     * This method is like `_.sum` except that it accepts `iteratee` which is\n     * invoked for each element in `array` to generate the value to be summed.\n     * The iteratee is invoked with one argument: (value).\n     *\n     * @static\n     * @memberOf _\n     * @since 4.0.0\n     * @category Math\n     * @param {Array} array The array to iterate over.\n     * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n     * @returns {number} Returns the sum.\n     * @example\n     *\n     * var objects = [{ 'n': 4 }, { 'n': 2 }, { 'n': 8 }, { 'n': 6 }];\n     *\n     * _.sumBy(objects, function(o) { return o.n; });\n     * // => 20\n     *\n     * // The `_.property` iteratee shorthand.\n     * _.sumBy(objects, 'n');\n     * // => 20\n     */\n    function sumBy(array, iteratee) {\n      return (array && array.length)\n        ? baseSum(array, getIteratee(iteratee, 2))\n        : 0;\n    }\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return wrapped values in chain sequences.\n    lodash.after = after;\n    lodash.ary = ary;\n    lodash.assign = assign;\n    lodash.assignIn = assignIn;\n    lodash.assignInWith = assignInWith;\n    lodash.assignWith = assignWith;\n    lodash.at = at;\n    lodash.before = before;\n    lodash.bind = bind;\n    lodash.bindAll = bindAll;\n    lodash.bindKey = bindKey;\n    lodash.castArray = castArray;\n    lodash.chain = chain;\n    lodash.chunk = chunk;\n    lodash.compact = compact;\n    lodash.concat = concat;\n    lodash.cond = cond;\n    lodash.conforms = conforms;\n    lodash.constant = constant;\n    lodash.countBy = countBy;\n    lodash.create = create;\n    lodash.curry = curry;\n    lodash.curryRight = curryRight;\n    lodash.debounce = debounce;\n    lodash.defaults = defaults;\n    lodash.defaultsDeep = defaultsDeep;\n    lodash.defer = defer;\n    lodash.delay = delay;\n    lodash.difference = difference;\n    lodash.differenceBy = differenceBy;\n    lodash.differenceWith = differenceWith;\n    lodash.drop = drop;\n    lodash.dropRight = dropRight;\n    lodash.dropRightWhile = dropRightWhile;\n    lodash.dropWhile = dropWhile;\n    lodash.fill = fill;\n    lodash.filter = filter;\n    lodash.flatMap = flatMap;\n    lodash.flatMapDeep = flatMapDeep;\n    lodash.flatMapDepth = flatMapDepth;\n    lodash.flatten = flatten;\n    lodash.flattenDeep = flattenDeep;\n    lodash.flattenDepth = flattenDepth;\n    lodash.flip = flip;\n    lodash.flow = flow;\n    lodash.flowRight = flowRight;\n    lodash.fromPairs = fromPairs;\n    lodash.functions = functions;\n    lodash.functionsIn = functionsIn;\n    lodash.groupBy = groupBy;\n    lodash.initial = initial;\n    lodash.intersection = intersection;\n    lodash.intersectionBy = intersectionBy;\n    lodash.intersectionWith = intersectionWith;\n    lodash.invert = invert;\n    lodash.invertBy = invertBy;\n    lodash.invokeMap = invokeMap;\n    lodash.iteratee = iteratee;\n    lodash.keyBy = keyBy;\n    lodash.keys = keys;\n    lodash.keysIn = keysIn;\n    lodash.map = map;\n    lodash.mapKeys = mapKeys;\n    lodash.mapValues = mapValues;\n    lodash.matches = matches;\n    lodash.matchesProperty = matchesProperty;\n    lodash.memoize = memoize;\n    lodash.merge = merge;\n    lodash.mergeWith = mergeWith;\n    lodash.method = method;\n    lodash.methodOf = methodOf;\n    lodash.mixin = mixin;\n    lodash.negate = negate;\n    lodash.nthArg = nthArg;\n    lodash.omit = omit;\n    lodash.omitBy = omitBy;\n    lodash.once = once;\n    lodash.orderBy = orderBy;\n    lodash.over = over;\n    lodash.overArgs = overArgs;\n    lodash.overEvery = overEvery;\n    lodash.overSome = overSome;\n    lodash.partial = partial;\n    lodash.partialRight = partialRight;\n    lodash.partition = partition;\n    lodash.pick = pick;\n    lodash.pickBy = pickBy;\n    lodash.property = property;\n    lodash.propertyOf = propertyOf;\n    lodash.pull = pull;\n    lodash.pullAll = pullAll;\n    lodash.pullAllBy = pullAllBy;\n    lodash.pullAllWith = pullAllWith;\n    lodash.pullAt = pullAt;\n    lodash.range = range;\n    lodash.rangeRight = rangeRight;\n    lodash.rearg = rearg;\n    lodash.reject = reject;\n    lodash.remove = remove;\n    lodash.rest = rest;\n    lodash.reverse = reverse;\n    lodash.sampleSize = sampleSize;\n    lodash.set = set;\n    lodash.setWith = setWith;\n    lodash.shuffle = shuffle;\n    lodash.slice = slice;\n    lodash.sortBy = sortBy;\n    lodash.sortedUniq = sortedUniq;\n    lodash.sortedUniqBy = sortedUniqBy;\n    lodash.split = split;\n    lodash.spread = spread;\n    lodash.tail = tail;\n    lodash.take = take;\n    lodash.takeRight = takeRight;\n    lodash.takeRightWhile = takeRightWhile;\n    lodash.takeWhile = takeWhile;\n    lodash.tap = tap;\n    lodash.throttle = throttle;\n    lodash.thru = thru;\n    lodash.toArray = toArray;\n    lodash.toPairs = toPairs;\n    lodash.toPairsIn = toPairsIn;\n    lodash.toPath = toPath;\n    lodash.toPlainObject = toPlainObject;\n    lodash.transform = transform;\n    lodash.unary = unary;\n    lodash.union = union;\n    lodash.unionBy = unionBy;\n    lodash.unionWith = unionWith;\n    lodash.uniq = uniq;\n    lodash.uniqBy = uniqBy;\n    lodash.uniqWith = uniqWith;\n    lodash.unset = unset;\n    lodash.unzip = unzip;\n    lodash.unzipWith = unzipWith;\n    lodash.update = update;\n    lodash.updateWith = updateWith;\n    lodash.values = values;\n    lodash.valuesIn = valuesIn;\n    lodash.without = without;\n    lodash.words = words;\n    lodash.wrap = wrap;\n    lodash.xor = xor;\n    lodash.xorBy = xorBy;\n    lodash.xorWith = xorWith;\n    lodash.zip = zip;\n    lodash.zipObject = zipObject;\n    lodash.zipObjectDeep = zipObjectDeep;\n    lodash.zipWith = zipWith;\n\n    // Add aliases.\n    lodash.entries = toPairs;\n    lodash.entriesIn = toPairsIn;\n    lodash.extend = assignIn;\n    lodash.extendWith = assignInWith;\n\n    // Add methods to `lodash.prototype`.\n    mixin(lodash, lodash);\n\n    /*------------------------------------------------------------------------*/\n\n    // Add methods that return unwrapped values in chain sequences.\n    lodash.add = add;\n    lodash.attempt = attempt;\n    lodash.camelCase = camelCase;\n    lodash.capitalize = capitalize;\n    lodash.ceil = ceil;\n    lodash.clamp = clamp;\n    lodash.clone = clone;\n    lodash.cloneDeep = cloneDeep;\n    lodash.cloneDeepWith = cloneDeepWith;\n    lodash.cloneWith = cloneWith;\n    lodash.conformsTo = conformsTo;\n    lodash.deburr = deburr;\n    lodash.defaultTo = defaultTo;\n    lodash.divide = divide;\n    lodash.endsWith = endsWith;\n    lodash.eq = eq;\n    lodash.escape = escape;\n    lodash.escapeRegExp = escapeRegExp;\n    lodash.every = every;\n    lodash.find = find;\n    lodash.findIndex = findIndex;\n    lodash.findKey = findKey;\n    lodash.findLast = findLast;\n    lodash.findLastIndex = findLastIndex;\n    lodash.findLastKey = findLastKey;\n    lodash.floor = floor;\n    lodash.forEach = forEach;\n    lodash.forEachRight = forEachRight;\n    lodash.forIn = forIn;\n    lodash.forInRight = forInRight;\n    lodash.forOwn = forOwn;\n    lodash.forOwnRight = forOwnRight;\n    lodash.get = get;\n    lodash.gt = gt;\n    lodash.gte = gte;\n    lodash.has = has;\n    lodash.hasIn = hasIn;\n    lodash.head = head;\n    lodash.identity = identity;\n    lodash.includes = includes;\n    lodash.indexOf = indexOf;\n    lodash.inRange = inRange;\n    lodash.invoke = invoke;\n    lodash.isArguments = isArguments;\n    lodash.isArray = isArray;\n    lodash.isArrayBuffer = isArrayBuffer;\n    lodash.isArrayLike = isArrayLike;\n    lodash.isArrayLikeObject = isArrayLikeObject;\n    lodash.isBoolean = isBoolean;\n    lodash.isBuffer = isBuffer;\n    lodash.isDate = isDate;\n    lodash.isElement = isElement;\n    lodash.isEmpty = isEmpty;\n    lodash.isEqual = isEqual;\n    lodash.isEqualWith = isEqualWith;\n    lodash.isError = isError;\n    lodash.isFinite = isFinite;\n    lodash.isFunction = isFunction;\n    lodash.isInteger = isInteger;\n    lodash.isLength = isLength;\n    lodash.isMap = isMap;\n    lodash.isMatch = isMatch;\n    lodash.isMatchWith = isMatchWith;\n    lodash.isNaN = isNaN;\n    lodash.isNative = isNative;\n    lodash.isNil = isNil;\n    lodash.isNull = isNull;\n    lodash.isNumber = isNumber;\n    lodash.isObject = isObject;\n    lodash.isObjectLike = isObjectLike;\n    lodash.isPlainObject = isPlainObject;\n    lodash.isRegExp = isRegExp;\n    lodash.isSafeInteger = isSafeInteger;\n    lodash.isSet = isSet;\n    lodash.isString = isString;\n    lodash.isSymbol = isSymbol;\n    lodash.isTypedArray = isTypedArray;\n    lodash.isUndefined = isUndefined;\n    lodash.isWeakMap = isWeakMap;\n    lodash.isWeakSet = isWeakSet;\n    lodash.join = join;\n    lodash.kebabCase = kebabCase;\n    lodash.last = last;\n    lodash.lastIndexOf = lastIndexOf;\n    lodash.lowerCase = lowerCase;\n    lodash.lowerFirst = lowerFirst;\n    lodash.lt = lt;\n    lodash.lte = lte;\n    lodash.max = max;\n    lodash.maxBy = maxBy;\n    lodash.mean = mean;\n    lodash.meanBy = meanBy;\n    lodash.min = min;\n    lodash.minBy = minBy;\n    lodash.stubArray = stubArray;\n    lodash.stubFalse = stubFalse;\n    lodash.stubObject = stubObject;\n    lodash.stubString = stubString;\n    lodash.stubTrue = stubTrue;\n    lodash.multiply = multiply;\n    lodash.nth = nth;\n    lodash.noConflict = noConflict;\n    lodash.noop = noop;\n    lodash.now = now;\n    lodash.pad = pad;\n    lodash.padEnd = padEnd;\n    lodash.padStart = padStart;\n    lodash.parseInt = parseInt;\n    lodash.random = random;\n    lodash.reduce = reduce;\n    lodash.reduceRight = reduceRight;\n    lodash.repeat = repeat;\n    lodash.replace = replace;\n    lodash.result = result;\n    lodash.round = round;\n    lodash.runInContext = runInContext;\n    lodash.sample = sample;\n    lodash.size = size;\n    lodash.snakeCase = snakeCase;\n    lodash.some = some;\n    lodash.sortedIndex = sortedIndex;\n    lodash.sortedIndexBy = sortedIndexBy;\n    lodash.sortedIndexOf = sortedIndexOf;\n    lodash.sortedLastIndex = sortedLastIndex;\n    lodash.sortedLastIndexBy = sortedLastIndexBy;\n    lodash.sortedLastIndexOf = sortedLastIndexOf;\n    lodash.startCase = startCase;\n    lodash.startsWith = startsWith;\n    lodash.subtract = subtract;\n    lodash.sum = sum;\n    lodash.sumBy = sumBy;\n    lodash.template = template;\n    lodash.times = times;\n    lodash.toFinite = toFinite;\n    lodash.toInteger = toInteger;\n    lodash.toLength = toLength;\n    lodash.toLower = toLower;\n    lodash.toNumber = toNumber;\n    lodash.toSafeInteger = toSafeInteger;\n    lodash.toString = toString;\n    lodash.toUpper = toUpper;\n    lodash.trim = trim;\n    lodash.trimEnd = trimEnd;\n    lodash.trimStart = trimStart;\n    lodash.truncate = truncate;\n    lodash.unescape = unescape;\n    lodash.uniqueId = uniqueId;\n    lodash.upperCase = upperCase;\n    lodash.upperFirst = upperFirst;\n\n    // Add aliases.\n    lodash.each = forEach;\n    lodash.eachRight = forEachRight;\n    lodash.first = head;\n\n    mixin(lodash, (function() {\n      var source = {};\n      baseForOwn(lodash, function(func, methodName) {\n        if (!hasOwnProperty.call(lodash.prototype, methodName)) {\n          source[methodName] = func;\n        }\n      });\n      return source;\n    }()), { 'chain': false });\n\n    /*------------------------------------------------------------------------*/\n\n    /**\n     * The semantic version number.\n     *\n     * @static\n     * @memberOf _\n     * @type {string}\n     */\n    lodash.VERSION = VERSION;\n\n    // Assign default placeholders.\n    arrayEach(['bind', 'bindKey', 'curry', 'curryRight', 'partial', 'partialRight'], function(methodName) {\n      lodash[methodName].placeholder = lodash;\n    });\n\n    // Add `LazyWrapper` methods for `_.drop` and `_.take` variants.\n    arrayEach(['drop', 'take'], function(methodName, index) {\n      LazyWrapper.prototype[methodName] = function(n) {\n        n = n === undefined ? 1 : nativeMax(toInteger(n), 0);\n\n        var result = (this.__filtered__ && !index)\n          ? new LazyWrapper(this)\n          : this.clone();\n\n        if (result.__filtered__) {\n          result.__takeCount__ = nativeMin(n, result.__takeCount__);\n        } else {\n          result.__views__.push({\n            'size': nativeMin(n, MAX_ARRAY_LENGTH),\n            'type': methodName + (result.__dir__ < 0 ? 'Right' : '')\n          });\n        }\n        return result;\n      };\n\n      LazyWrapper.prototype[methodName + 'Right'] = function(n) {\n        return this.reverse()[methodName](n).reverse();\n      };\n    });\n\n    // Add `LazyWrapper` methods that accept an `iteratee` value.\n    arrayEach(['filter', 'map', 'takeWhile'], function(methodName, index) {\n      var type = index + 1,\n          isFilter = type == LAZY_FILTER_FLAG || type == LAZY_WHILE_FLAG;\n\n      LazyWrapper.prototype[methodName] = function(iteratee) {\n        var result = this.clone();\n        result.__iteratees__.push({\n          'iteratee': getIteratee(iteratee, 3),\n          'type': type\n        });\n        result.__filtered__ = result.__filtered__ || isFilter;\n        return result;\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.head` and `_.last`.\n    arrayEach(['head', 'last'], function(methodName, index) {\n      var takeName = 'take' + (index ? 'Right' : '');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this[takeName](1).value()[0];\n      };\n    });\n\n    // Add `LazyWrapper` methods for `_.initial` and `_.tail`.\n    arrayEach(['initial', 'tail'], function(methodName, index) {\n      var dropName = 'drop' + (index ? '' : 'Right');\n\n      LazyWrapper.prototype[methodName] = function() {\n        return this.__filtered__ ? new LazyWrapper(this) : this[dropName](1);\n      };\n    });\n\n    LazyWrapper.prototype.compact = function() {\n      return this.filter(identity);\n    };\n\n    LazyWrapper.prototype.find = function(predicate) {\n      return this.filter(predicate).head();\n    };\n\n    LazyWrapper.prototype.findLast = function(predicate) {\n      return this.reverse().find(predicate);\n    };\n\n    LazyWrapper.prototype.invokeMap = baseRest(function(path, args) {\n      if (typeof path == 'function') {\n        return new LazyWrapper(this);\n      }\n      return this.map(function(value) {\n        return baseInvoke(value, path, args);\n      });\n    });\n\n    LazyWrapper.prototype.reject = function(predicate) {\n      return this.filter(negate(getIteratee(predicate)));\n    };\n\n    LazyWrapper.prototype.slice = function(start, end) {\n      start = toInteger(start);\n\n      var result = this;\n      if (result.__filtered__ && (start > 0 || end < 0)) {\n        return new LazyWrapper(result);\n      }\n      if (start < 0) {\n        result = result.takeRight(-start);\n      } else if (start) {\n        result = result.drop(start);\n      }\n      if (end !== undefined) {\n        end = toInteger(end);\n        result = end < 0 ? result.dropRight(-end) : result.take(end - start);\n      }\n      return result;\n    };\n\n    LazyWrapper.prototype.takeRightWhile = function(predicate) {\n      return this.reverse().takeWhile(predicate).reverse();\n    };\n\n    LazyWrapper.prototype.toArray = function() {\n      return this.take(MAX_ARRAY_LENGTH);\n    };\n\n    // Add `LazyWrapper` methods to `lodash.prototype`.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var checkIteratee = /^(?:filter|find|map|reject)|While$/.test(methodName),\n          isTaker = /^(?:head|last)$/.test(methodName),\n          lodashFunc = lodash[isTaker ? ('take' + (methodName == 'last' ? 'Right' : '')) : methodName],\n          retUnwrapped = isTaker || /^find/.test(methodName);\n\n      if (!lodashFunc) {\n        return;\n      }\n      lodash.prototype[methodName] = function() {\n        var value = this.__wrapped__,\n            args = isTaker ? [1] : arguments,\n            isLazy = value instanceof LazyWrapper,\n            iteratee = args[0],\n            useLazy = isLazy || isArray(value);\n\n        var interceptor = function(value) {\n          var result = lodashFunc.apply(lodash, arrayPush([value], args));\n          return (isTaker && chainAll) ? result[0] : result;\n        };\n\n        if (useLazy && checkIteratee && typeof iteratee == 'function' && iteratee.length != 1) {\n          // Avoid lazy use if the iteratee has a \"length\" value other than `1`.\n          isLazy = useLazy = false;\n        }\n        var chainAll = this.__chain__,\n            isHybrid = !!this.__actions__.length,\n            isUnwrapped = retUnwrapped && !chainAll,\n            onlyLazy = isLazy && !isHybrid;\n\n        if (!retUnwrapped && useLazy) {\n          value = onlyLazy ? value : new LazyWrapper(this);\n          var result = func.apply(value, args);\n          result.__actions__.push({ 'func': thru, 'args': [interceptor], 'thisArg': undefined });\n          return new LodashWrapper(result, chainAll);\n        }\n        if (isUnwrapped && onlyLazy) {\n          return func.apply(this, args);\n        }\n        result = this.thru(interceptor);\n        return isUnwrapped ? (isTaker ? result.value()[0] : result.value()) : result;\n      };\n    });\n\n    // Add `Array` methods to `lodash.prototype`.\n    arrayEach(['pop', 'push', 'shift', 'sort', 'splice', 'unshift'], function(methodName) {\n      var func = arrayProto[methodName],\n          chainName = /^(?:push|sort|unshift)$/.test(methodName) ? 'tap' : 'thru',\n          retUnwrapped = /^(?:pop|shift)$/.test(methodName);\n\n      lodash.prototype[methodName] = function() {\n        var args = arguments;\n        if (retUnwrapped && !this.__chain__) {\n          var value = this.value();\n          return func.apply(isArray(value) ? value : [], args);\n        }\n        return this[chainName](function(value) {\n          return func.apply(isArray(value) ? value : [], args);\n        });\n      };\n    });\n\n    // Map minified method names to their real names.\n    baseForOwn(LazyWrapper.prototype, function(func, methodName) {\n      var lodashFunc = lodash[methodName];\n      if (lodashFunc) {\n        var key = lodashFunc.name + '';\n        if (!hasOwnProperty.call(realNames, key)) {\n          realNames[key] = [];\n        }\n        realNames[key].push({ 'name': methodName, 'func': lodashFunc });\n      }\n    });\n\n    realNames[createHybrid(undefined, WRAP_BIND_KEY_FLAG).name] = [{\n      'name': 'wrapper',\n      'func': undefined\n    }];\n\n    // Add methods to `LazyWrapper`.\n    LazyWrapper.prototype.clone = lazyClone;\n    LazyWrapper.prototype.reverse = lazyReverse;\n    LazyWrapper.prototype.value = lazyValue;\n\n    // Add chain sequence methods to the `lodash` wrapper.\n    lodash.prototype.at = wrapperAt;\n    lodash.prototype.chain = wrapperChain;\n    lodash.prototype.commit = wrapperCommit;\n    lodash.prototype.next = wrapperNext;\n    lodash.prototype.plant = wrapperPlant;\n    lodash.prototype.reverse = wrapperReverse;\n    lodash.prototype.toJSON = lodash.prototype.valueOf = lodash.prototype.value = wrapperValue;\n\n    // Add lazy aliases.\n    lodash.prototype.first = lodash.prototype.head;\n\n    if (symIterator) {\n      lodash.prototype[symIterator] = wrapperToIterator;\n    }\n    return lodash;\n  });\n\n  /*--------------------------------------------------------------------------*/\n\n  // Export lodash.\n  var _ = runInContext();\n\n  // Some AMD build optimizers, like r.js, check for condition patterns like:\n  if (typeof define == 'function' && typeof define.amd == 'object' && define.amd) {\n    // Expose Lodash on the global object to prevent errors when Lodash is\n    // loaded by a script tag in the presence of an AMD loader.\n    // See http://requirejs.org/docs/errors.html#mismatch for more details.\n    // Use `_.noConflict` to remove Lodash from the global object.\n    root._ = _;\n\n    // Define as an anonymous module so, through path mapping, it can be\n    // referenced as the \"underscore\" module.\n    define(function() {\n      return _;\n    });\n  }\n  // Check for `exports` after `define` in case a build optimizer adds it.\n  else if (freeModule) {\n    // Export for Node.js.\n    (freeModule.exports = _)._ = _;\n    // Export for CommonJS support.\n    freeExports._ = _;\n  }\n  else {\n    // Export to the global object.\n    root._ = _;\n  }\n}.call(this));\n","/**\n * @license React\n * react-dom.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n/*\n Modernizr 3.0.0pre (Custom Build) | MIT\n*/\n'use strict';var aa=require(\"react\"),ca=require(\"scheduler\");function p(a){for(var b=\"https://reactjs.org/docs/error-decoder.html?invariant=\"+a,c=1;c<arguments.length;c++)b+=\"&args[]=\"+encodeURIComponent(arguments[c]);return\"Minified React error #\"+a+\"; visit \"+b+\" for the full message or use the non-minified dev environment for full errors and additional helpful warnings.\"}var da=new Set,ea={};function fa(a,b){ha(a,b);ha(a+\"Capture\",b)}\nfunction ha(a,b){ea[a]=b;for(a=0;a<b.length;a++)da.add(b[a])}\nvar ia=!(\"undefined\"===typeof window||\"undefined\"===typeof window.document||\"undefined\"===typeof window.document.createElement),ja=Object.prototype.hasOwnProperty,ka=/^[:A-Z_a-z\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF\\u0370-\\u037D\\u037F-\\u1FFF\\u200C-\\u200D\\u2070-\\u218F\\u2C00-\\u2FEF\\u3001-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFFD][:A-Z_a-z\\u00C0-\\u00D6\\u00D8-\\u00F6\\u00F8-\\u02FF\\u0370-\\u037D\\u037F-\\u1FFF\\u200C-\\u200D\\u2070-\\u218F\\u2C00-\\u2FEF\\u3001-\\uD7FF\\uF900-\\uFDCF\\uFDF0-\\uFFFD\\-.0-9\\u00B7\\u0300-\\u036F\\u203F-\\u2040]*$/,la=\n{},ma={};function oa(a){if(ja.call(ma,a))return!0;if(ja.call(la,a))return!1;if(ka.test(a))return ma[a]=!0;la[a]=!0;return!1}function pa(a,b,c,d){if(null!==c&&0===c.type)return!1;switch(typeof b){case \"function\":case \"symbol\":return!0;case \"boolean\":if(d)return!1;if(null!==c)return!c.acceptsBooleans;a=a.toLowerCase().slice(0,5);return\"data-\"!==a&&\"aria-\"!==a;default:return!1}}\nfunction qa(a,b,c,d){if(null===b||\"undefined\"===typeof b||pa(a,b,c,d))return!0;if(d)return!1;if(null!==c)switch(c.type){case 3:return!b;case 4:return!1===b;case 5:return isNaN(b);case 6:return isNaN(b)||1>b}return!1}function v(a,b,c,d,e,f,g){this.acceptsBooleans=2===b||3===b||4===b;this.attributeName=d;this.attributeNamespace=e;this.mustUseProperty=c;this.propertyName=a;this.type=b;this.sanitizeURL=f;this.removeEmptyString=g}var z={};\n\"children dangerouslySetInnerHTML defaultValue defaultChecked innerHTML suppressContentEditableWarning suppressHydrationWarning style\".split(\" \").forEach(function(a){z[a]=new v(a,0,!1,a,null,!1,!1)});[[\"acceptCharset\",\"accept-charset\"],[\"className\",\"class\"],[\"htmlFor\",\"for\"],[\"httpEquiv\",\"http-equiv\"]].forEach(function(a){var b=a[0];z[b]=new v(b,1,!1,a[1],null,!1,!1)});[\"contentEditable\",\"draggable\",\"spellCheck\",\"value\"].forEach(function(a){z[a]=new v(a,2,!1,a.toLowerCase(),null,!1,!1)});\n[\"autoReverse\",\"externalResourcesRequired\",\"focusable\",\"preserveAlpha\"].forEach(function(a){z[a]=new v(a,2,!1,a,null,!1,!1)});\"allowFullScreen async autoFocus autoPlay controls default defer disabled disablePictureInPicture disableRemotePlayback formNoValidate hidden loop noModule noValidate open playsInline readOnly required reversed scoped seamless itemScope\".split(\" \").forEach(function(a){z[a]=new v(a,3,!1,a.toLowerCase(),null,!1,!1)});\n[\"checked\",\"multiple\",\"muted\",\"selected\"].forEach(function(a){z[a]=new v(a,3,!0,a,null,!1,!1)});[\"capture\",\"download\"].forEach(function(a){z[a]=new v(a,4,!1,a,null,!1,!1)});[\"cols\",\"rows\",\"size\",\"span\"].forEach(function(a){z[a]=new v(a,6,!1,a,null,!1,!1)});[\"rowSpan\",\"start\"].forEach(function(a){z[a]=new v(a,5,!1,a.toLowerCase(),null,!1,!1)});var ra=/[\\-:]([a-z])/g;function sa(a){return a[1].toUpperCase()}\n\"accent-height alignment-baseline arabic-form baseline-shift cap-height clip-path clip-rule color-interpolation color-interpolation-filters color-profile color-rendering dominant-baseline enable-background fill-opacity fill-rule flood-color flood-opacity font-family font-size font-size-adjust font-stretch font-style font-variant font-weight glyph-name glyph-orientation-horizontal glyph-orientation-vertical horiz-adv-x horiz-origin-x image-rendering letter-spacing lighting-color marker-end marker-mid marker-start overline-position overline-thickness paint-order panose-1 pointer-events rendering-intent shape-rendering stop-color stop-opacity strikethrough-position strikethrough-thickness stroke-dasharray stroke-dashoffset stroke-linecap stroke-linejoin stroke-miterlimit stroke-opacity stroke-width text-anchor text-decoration text-rendering underline-position underline-thickness unicode-bidi unicode-range units-per-em v-alphabetic v-hanging v-ideographic v-mathematical vector-effect vert-adv-y vert-origin-x vert-origin-y word-spacing writing-mode xmlns:xlink x-height\".split(\" \").forEach(function(a){var b=a.replace(ra,\nsa);z[b]=new v(b,1,!1,a,null,!1,!1)});\"xlink:actuate xlink:arcrole xlink:role xlink:show xlink:title xlink:type\".split(\" \").forEach(function(a){var b=a.replace(ra,sa);z[b]=new v(b,1,!1,a,\"http://www.w3.org/1999/xlink\",!1,!1)});[\"xml:base\",\"xml:lang\",\"xml:space\"].forEach(function(a){var b=a.replace(ra,sa);z[b]=new v(b,1,!1,a,\"http://www.w3.org/XML/1998/namespace\",!1,!1)});[\"tabIndex\",\"crossOrigin\"].forEach(function(a){z[a]=new v(a,1,!1,a.toLowerCase(),null,!1,!1)});\nz.xlinkHref=new v(\"xlinkHref\",1,!1,\"xlink:href\",\"http://www.w3.org/1999/xlink\",!0,!1);[\"src\",\"href\",\"action\",\"formAction\"].forEach(function(a){z[a]=new v(a,1,!1,a.toLowerCase(),null,!0,!0)});\nfunction ta(a,b,c,d){var e=z.hasOwnProperty(b)?z[b]:null;if(null!==e?0!==e.type:d||!(2<b.length)||\"o\"!==b[0]&&\"O\"!==b[0]||\"n\"!==b[1]&&\"N\"!==b[1])qa(b,c,e,d)&&(c=null),d||null===e?oa(b)&&(null===c?a.removeAttribute(b):a.setAttribute(b,\"\"+c)):e.mustUseProperty?a[e.propertyName]=null===c?3===e.type?!1:\"\":c:(b=e.attributeName,d=e.attributeNamespace,null===c?a.removeAttribute(b):(e=e.type,c=3===e||4===e&&!0===c?\"\":\"\"+c,d?a.setAttributeNS(d,b,c):a.setAttribute(b,c)))}\nvar ua=aa.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED,va=Symbol.for(\"react.element\"),wa=Symbol.for(\"react.portal\"),ya=Symbol.for(\"react.fragment\"),za=Symbol.for(\"react.strict_mode\"),Aa=Symbol.for(\"react.profiler\"),Ba=Symbol.for(\"react.provider\"),Ca=Symbol.for(\"react.context\"),Da=Symbol.for(\"react.forward_ref\"),Ea=Symbol.for(\"react.suspense\"),Fa=Symbol.for(\"react.suspense_list\"),Ga=Symbol.for(\"react.memo\"),Ha=Symbol.for(\"react.lazy\");Symbol.for(\"react.scope\");Symbol.for(\"react.debug_trace_mode\");\nvar Ia=Symbol.for(\"react.offscreen\");Symbol.for(\"react.legacy_hidden\");Symbol.for(\"react.cache\");Symbol.for(\"react.tracing_marker\");var Ja=Symbol.iterator;function Ka(a){if(null===a||\"object\"!==typeof a)return null;a=Ja&&a[Ja]||a[\"@@iterator\"];return\"function\"===typeof a?a:null}var A=Object.assign,La;function Ma(a){if(void 0===La)try{throw Error();}catch(c){var b=c.stack.trim().match(/\\n( *(at )?)/);La=b&&b[1]||\"\"}return\"\\n\"+La+a}var Na=!1;\nfunction Oa(a,b){if(!a||Na)return\"\";Na=!0;var c=Error.prepareStackTrace;Error.prepareStackTrace=void 0;try{if(b)if(b=function(){throw Error();},Object.defineProperty(b.prototype,\"props\",{set:function(){throw Error();}}),\"object\"===typeof Reflect&&Reflect.construct){try{Reflect.construct(b,[])}catch(l){var d=l}Reflect.construct(a,[],b)}else{try{b.call()}catch(l){d=l}a.call(b.prototype)}else{try{throw Error();}catch(l){d=l}a()}}catch(l){if(l&&d&&\"string\"===typeof l.stack){for(var e=l.stack.split(\"\\n\"),\nf=d.stack.split(\"\\n\"),g=e.length-1,h=f.length-1;1<=g&&0<=h&&e[g]!==f[h];)h--;for(;1<=g&&0<=h;g--,h--)if(e[g]!==f[h]){if(1!==g||1!==h){do if(g--,h--,0>h||e[g]!==f[h]){var k=\"\\n\"+e[g].replace(\" at new \",\" at \");a.displayName&&k.includes(\"<anonymous>\")&&(k=k.replace(\"<anonymous>\",a.displayName));return k}while(1<=g&&0<=h)}break}}}finally{Na=!1,Error.prepareStackTrace=c}return(a=a?a.displayName||a.name:\"\")?Ma(a):\"\"}\nfunction Pa(a){switch(a.tag){case 5:return Ma(a.type);case 16:return Ma(\"Lazy\");case 13:return Ma(\"Suspense\");case 19:return Ma(\"SuspenseList\");case 0:case 2:case 15:return a=Oa(a.type,!1),a;case 11:return a=Oa(a.type.render,!1),a;case 1:return a=Oa(a.type,!0),a;default:return\"\"}}\nfunction Qa(a){if(null==a)return null;if(\"function\"===typeof a)return a.displayName||a.name||null;if(\"string\"===typeof a)return a;switch(a){case ya:return\"Fragment\";case wa:return\"Portal\";case Aa:return\"Profiler\";case za:return\"StrictMode\";case Ea:return\"Suspense\";case Fa:return\"SuspenseList\"}if(\"object\"===typeof a)switch(a.$$typeof){case Ca:return(a.displayName||\"Context\")+\".Consumer\";case Ba:return(a._context.displayName||\"Context\")+\".Provider\";case Da:var b=a.render;a=a.displayName;a||(a=b.displayName||\nb.name||\"\",a=\"\"!==a?\"ForwardRef(\"+a+\")\":\"ForwardRef\");return a;case Ga:return b=a.displayName||null,null!==b?b:Qa(a.type)||\"Memo\";case Ha:b=a._payload;a=a._init;try{return Qa(a(b))}catch(c){}}return null}\nfunction Ra(a){var b=a.type;switch(a.tag){case 24:return\"Cache\";case 9:return(b.displayName||\"Context\")+\".Consumer\";case 10:return(b._context.displayName||\"Context\")+\".Provider\";case 18:return\"DehydratedFragment\";case 11:return a=b.render,a=a.displayName||a.name||\"\",b.displayName||(\"\"!==a?\"ForwardRef(\"+a+\")\":\"ForwardRef\");case 7:return\"Fragment\";case 5:return b;case 4:return\"Portal\";case 3:return\"Root\";case 6:return\"Text\";case 16:return Qa(b);case 8:return b===za?\"StrictMode\":\"Mode\";case 22:return\"Offscreen\";\ncase 12:return\"Profiler\";case 21:return\"Scope\";case 13:return\"Suspense\";case 19:return\"SuspenseList\";case 25:return\"TracingMarker\";case 1:case 0:case 17:case 2:case 14:case 15:if(\"function\"===typeof b)return b.displayName||b.name||null;if(\"string\"===typeof b)return b}return null}function Sa(a){switch(typeof a){case \"boolean\":case \"number\":case \"string\":case \"undefined\":return a;case \"object\":return a;default:return\"\"}}\nfunction Ta(a){var b=a.type;return(a=a.nodeName)&&\"input\"===a.toLowerCase()&&(\"checkbox\"===b||\"radio\"===b)}\nfunction Ua(a){var b=Ta(a)?\"checked\":\"value\",c=Object.getOwnPropertyDescriptor(a.constructor.prototype,b),d=\"\"+a[b];if(!a.hasOwnProperty(b)&&\"undefined\"!==typeof c&&\"function\"===typeof c.get&&\"function\"===typeof c.set){var e=c.get,f=c.set;Object.defineProperty(a,b,{configurable:!0,get:function(){return e.call(this)},set:function(a){d=\"\"+a;f.call(this,a)}});Object.defineProperty(a,b,{enumerable:c.enumerable});return{getValue:function(){return d},setValue:function(a){d=\"\"+a},stopTracking:function(){a._valueTracker=\nnull;delete a[b]}}}}function Va(a){a._valueTracker||(a._valueTracker=Ua(a))}function Wa(a){if(!a)return!1;var b=a._valueTracker;if(!b)return!0;var c=b.getValue();var d=\"\";a&&(d=Ta(a)?a.checked?\"true\":\"false\":a.value);a=d;return a!==c?(b.setValue(a),!0):!1}function Xa(a){a=a||(\"undefined\"!==typeof document?document:void 0);if(\"undefined\"===typeof a)return null;try{return a.activeElement||a.body}catch(b){return a.body}}\nfunction Ya(a,b){var c=b.checked;return A({},b,{defaultChecked:void 0,defaultValue:void 0,value:void 0,checked:null!=c?c:a._wrapperState.initialChecked})}function Za(a,b){var c=null==b.defaultValue?\"\":b.defaultValue,d=null!=b.checked?b.checked:b.defaultChecked;c=Sa(null!=b.value?b.value:c);a._wrapperState={initialChecked:d,initialValue:c,controlled:\"checkbox\"===b.type||\"radio\"===b.type?null!=b.checked:null!=b.value}}function ab(a,b){b=b.checked;null!=b&&ta(a,\"checked\",b,!1)}\nfunction bb(a,b){ab(a,b);var c=Sa(b.value),d=b.type;if(null!=c)if(\"number\"===d){if(0===c&&\"\"===a.value||a.value!=c)a.value=\"\"+c}else a.value!==\"\"+c&&(a.value=\"\"+c);else if(\"submit\"===d||\"reset\"===d){a.removeAttribute(\"value\");return}b.hasOwnProperty(\"value\")?cb(a,b.type,c):b.hasOwnProperty(\"defaultValue\")&&cb(a,b.type,Sa(b.defaultValue));null==b.checked&&null!=b.defaultChecked&&(a.defaultChecked=!!b.defaultChecked)}\nfunction db(a,b,c){if(b.hasOwnProperty(\"value\")||b.hasOwnProperty(\"defaultValue\")){var d=b.type;if(!(\"submit\"!==d&&\"reset\"!==d||void 0!==b.value&&null!==b.value))return;b=\"\"+a._wrapperState.initialValue;c||b===a.value||(a.value=b);a.defaultValue=b}c=a.name;\"\"!==c&&(a.name=\"\");a.defaultChecked=!!a._wrapperState.initialChecked;\"\"!==c&&(a.name=c)}\nfunction cb(a,b,c){if(\"number\"!==b||Xa(a.ownerDocument)!==a)null==c?a.defaultValue=\"\"+a._wrapperState.initialValue:a.defaultValue!==\"\"+c&&(a.defaultValue=\"\"+c)}var eb=Array.isArray;\nfunction fb(a,b,c,d){a=a.options;if(b){b={};for(var e=0;e<c.length;e++)b[\"$\"+c[e]]=!0;for(c=0;c<a.length;c++)e=b.hasOwnProperty(\"$\"+a[c].value),a[c].selected!==e&&(a[c].selected=e),e&&d&&(a[c].defaultSelected=!0)}else{c=\"\"+Sa(c);b=null;for(e=0;e<a.length;e++){if(a[e].value===c){a[e].selected=!0;d&&(a[e].defaultSelected=!0);return}null!==b||a[e].disabled||(b=a[e])}null!==b&&(b.selected=!0)}}\nfunction gb(a,b){if(null!=b.dangerouslySetInnerHTML)throw Error(p(91));return A({},b,{value:void 0,defaultValue:void 0,children:\"\"+a._wrapperState.initialValue})}function hb(a,b){var c=b.value;if(null==c){c=b.children;b=b.defaultValue;if(null!=c){if(null!=b)throw Error(p(92));if(eb(c)){if(1<c.length)throw Error(p(93));c=c[0]}b=c}null==b&&(b=\"\");c=b}a._wrapperState={initialValue:Sa(c)}}\nfunction ib(a,b){var c=Sa(b.value),d=Sa(b.defaultValue);null!=c&&(c=\"\"+c,c!==a.value&&(a.value=c),null==b.defaultValue&&a.defaultValue!==c&&(a.defaultValue=c));null!=d&&(a.defaultValue=\"\"+d)}function jb(a){var b=a.textContent;b===a._wrapperState.initialValue&&\"\"!==b&&null!==b&&(a.value=b)}function kb(a){switch(a){case \"svg\":return\"http://www.w3.org/2000/svg\";case \"math\":return\"http://www.w3.org/1998/Math/MathML\";default:return\"http://www.w3.org/1999/xhtml\"}}\nfunction lb(a,b){return null==a||\"http://www.w3.org/1999/xhtml\"===a?kb(b):\"http://www.w3.org/2000/svg\"===a&&\"foreignObject\"===b?\"http://www.w3.org/1999/xhtml\":a}\nvar mb,nb=function(a){return\"undefined\"!==typeof MSApp&&MSApp.execUnsafeLocalFunction?function(b,c,d,e){MSApp.execUnsafeLocalFunction(function(){return a(b,c,d,e)})}:a}(function(a,b){if(\"http://www.w3.org/2000/svg\"!==a.namespaceURI||\"innerHTML\"in a)a.innerHTML=b;else{mb=mb||document.createElement(\"div\");mb.innerHTML=\"<svg>\"+b.valueOf().toString()+\"</svg>\";for(b=mb.firstChild;a.firstChild;)a.removeChild(a.firstChild);for(;b.firstChild;)a.appendChild(b.firstChild)}});\nfunction ob(a,b){if(b){var c=a.firstChild;if(c&&c===a.lastChild&&3===c.nodeType){c.nodeValue=b;return}}a.textContent=b}\nvar pb={animationIterationCount:!0,aspectRatio:!0,borderImageOutset:!0,borderImageSlice:!0,borderImageWidth:!0,boxFlex:!0,boxFlexGroup:!0,boxOrdinalGroup:!0,columnCount:!0,columns:!0,flex:!0,flexGrow:!0,flexPositive:!0,flexShrink:!0,flexNegative:!0,flexOrder:!0,gridArea:!0,gridRow:!0,gridRowEnd:!0,gridRowSpan:!0,gridRowStart:!0,gridColumn:!0,gridColumnEnd:!0,gridColumnSpan:!0,gridColumnStart:!0,fontWeight:!0,lineClamp:!0,lineHeight:!0,opacity:!0,order:!0,orphans:!0,tabSize:!0,widows:!0,zIndex:!0,\nzoom:!0,fillOpacity:!0,floodOpacity:!0,stopOpacity:!0,strokeDasharray:!0,strokeDashoffset:!0,strokeMiterlimit:!0,strokeOpacity:!0,strokeWidth:!0},qb=[\"Webkit\",\"ms\",\"Moz\",\"O\"];Object.keys(pb).forEach(function(a){qb.forEach(function(b){b=b+a.charAt(0).toUpperCase()+a.substring(1);pb[b]=pb[a]})});function rb(a,b,c){return null==b||\"boolean\"===typeof b||\"\"===b?\"\":c||\"number\"!==typeof b||0===b||pb.hasOwnProperty(a)&&pb[a]?(\"\"+b).trim():b+\"px\"}\nfunction sb(a,b){a=a.style;for(var c in b)if(b.hasOwnProperty(c)){var d=0===c.indexOf(\"--\"),e=rb(c,b[c],d);\"float\"===c&&(c=\"cssFloat\");d?a.setProperty(c,e):a[c]=e}}var tb=A({menuitem:!0},{area:!0,base:!0,br:!0,col:!0,embed:!0,hr:!0,img:!0,input:!0,keygen:!0,link:!0,meta:!0,param:!0,source:!0,track:!0,wbr:!0});\nfunction ub(a,b){if(b){if(tb[a]&&(null!=b.children||null!=b.dangerouslySetInnerHTML))throw Error(p(137,a));if(null!=b.dangerouslySetInnerHTML){if(null!=b.children)throw Error(p(60));if(\"object\"!==typeof b.dangerouslySetInnerHTML||!(\"__html\"in b.dangerouslySetInnerHTML))throw Error(p(61));}if(null!=b.style&&\"object\"!==typeof b.style)throw Error(p(62));}}\nfunction vb(a,b){if(-1===a.indexOf(\"-\"))return\"string\"===typeof b.is;switch(a){case \"annotation-xml\":case \"color-profile\":case \"font-face\":case \"font-face-src\":case \"font-face-uri\":case \"font-face-format\":case \"font-face-name\":case \"missing-glyph\":return!1;default:return!0}}var wb=null;function xb(a){a=a.target||a.srcElement||window;a.correspondingUseElement&&(a=a.correspondingUseElement);return 3===a.nodeType?a.parentNode:a}var yb=null,zb=null,Ab=null;\nfunction Bb(a){if(a=Cb(a)){if(\"function\"!==typeof yb)throw Error(p(280));var b=a.stateNode;b&&(b=Db(b),yb(a.stateNode,a.type,b))}}function Eb(a){zb?Ab?Ab.push(a):Ab=[a]:zb=a}function Fb(){if(zb){var a=zb,b=Ab;Ab=zb=null;Bb(a);if(b)for(a=0;a<b.length;a++)Bb(b[a])}}function Gb(a,b){return a(b)}function Hb(){}var Ib=!1;function Jb(a,b,c){if(Ib)return a(b,c);Ib=!0;try{return Gb(a,b,c)}finally{if(Ib=!1,null!==zb||null!==Ab)Hb(),Fb()}}\nfunction Kb(a,b){var c=a.stateNode;if(null===c)return null;var d=Db(c);if(null===d)return null;c=d[b];a:switch(b){case \"onClick\":case \"onClickCapture\":case \"onDoubleClick\":case \"onDoubleClickCapture\":case \"onMouseDown\":case \"onMouseDownCapture\":case \"onMouseMove\":case \"onMouseMoveCapture\":case \"onMouseUp\":case \"onMouseUpCapture\":case \"onMouseEnter\":(d=!d.disabled)||(a=a.type,d=!(\"button\"===a||\"input\"===a||\"select\"===a||\"textarea\"===a));a=!d;break a;default:a=!1}if(a)return null;if(c&&\"function\"!==\ntypeof c)throw Error(p(231,b,typeof c));return c}var Lb=!1;if(ia)try{var Mb={};Object.defineProperty(Mb,\"passive\",{get:function(){Lb=!0}});window.addEventListener(\"test\",Mb,Mb);window.removeEventListener(\"test\",Mb,Mb)}catch(a){Lb=!1}function Nb(a,b,c,d,e,f,g,h,k){var l=Array.prototype.slice.call(arguments,3);try{b.apply(c,l)}catch(m){this.onError(m)}}var Ob=!1,Pb=null,Qb=!1,Rb=null,Sb={onError:function(a){Ob=!0;Pb=a}};function Tb(a,b,c,d,e,f,g,h,k){Ob=!1;Pb=null;Nb.apply(Sb,arguments)}\nfunction Ub(a,b,c,d,e,f,g,h,k){Tb.apply(this,arguments);if(Ob){if(Ob){var l=Pb;Ob=!1;Pb=null}else throw Error(p(198));Qb||(Qb=!0,Rb=l)}}function Vb(a){var b=a,c=a;if(a.alternate)for(;b.return;)b=b.return;else{a=b;do b=a,0!==(b.flags&4098)&&(c=b.return),a=b.return;while(a)}return 3===b.tag?c:null}function Wb(a){if(13===a.tag){var b=a.memoizedState;null===b&&(a=a.alternate,null!==a&&(b=a.memoizedState));if(null!==b)return b.dehydrated}return null}function Xb(a){if(Vb(a)!==a)throw Error(p(188));}\nfunction Yb(a){var b=a.alternate;if(!b){b=Vb(a);if(null===b)throw Error(p(188));return b!==a?null:a}for(var c=a,d=b;;){var e=c.return;if(null===e)break;var f=e.alternate;if(null===f){d=e.return;if(null!==d){c=d;continue}break}if(e.child===f.child){for(f=e.child;f;){if(f===c)return Xb(e),a;if(f===d)return Xb(e),b;f=f.sibling}throw Error(p(188));}if(c.return!==d.return)c=e,d=f;else{for(var g=!1,h=e.child;h;){if(h===c){g=!0;c=e;d=f;break}if(h===d){g=!0;d=e;c=f;break}h=h.sibling}if(!g){for(h=f.child;h;){if(h===\nc){g=!0;c=f;d=e;break}if(h===d){g=!0;d=f;c=e;break}h=h.sibling}if(!g)throw Error(p(189));}}if(c.alternate!==d)throw Error(p(190));}if(3!==c.tag)throw Error(p(188));return c.stateNode.current===c?a:b}function Zb(a){a=Yb(a);return null!==a?$b(a):null}function $b(a){if(5===a.tag||6===a.tag)return a;for(a=a.child;null!==a;){var b=$b(a);if(null!==b)return b;a=a.sibling}return null}\nvar ac=ca.unstable_scheduleCallback,bc=ca.unstable_cancelCallback,cc=ca.unstable_shouldYield,dc=ca.unstable_requestPaint,B=ca.unstable_now,ec=ca.unstable_getCurrentPriorityLevel,fc=ca.unstable_ImmediatePriority,gc=ca.unstable_UserBlockingPriority,hc=ca.unstable_NormalPriority,ic=ca.unstable_LowPriority,jc=ca.unstable_IdlePriority,kc=null,lc=null;function mc(a){if(lc&&\"function\"===typeof lc.onCommitFiberRoot)try{lc.onCommitFiberRoot(kc,a,void 0,128===(a.current.flags&128))}catch(b){}}\nvar oc=Math.clz32?Math.clz32:nc,pc=Math.log,qc=Math.LN2;function nc(a){a>>>=0;return 0===a?32:31-(pc(a)/qc|0)|0}var rc=64,sc=4194304;\nfunction tc(a){switch(a&-a){case 1:return 1;case 2:return 2;case 4:return 4;case 8:return 8;case 16:return 16;case 32:return 32;case 64:case 128:case 256:case 512:case 1024:case 2048:case 4096:case 8192:case 16384:case 32768:case 65536:case 131072:case 262144:case 524288:case 1048576:case 2097152:return a&4194240;case 4194304:case 8388608:case 16777216:case 33554432:case 67108864:return a&130023424;case 134217728:return 134217728;case 268435456:return 268435456;case 536870912:return 536870912;case 1073741824:return 1073741824;\ndefault:return a}}function uc(a,b){var c=a.pendingLanes;if(0===c)return 0;var d=0,e=a.suspendedLanes,f=a.pingedLanes,g=c&268435455;if(0!==g){var h=g&~e;0!==h?d=tc(h):(f&=g,0!==f&&(d=tc(f)))}else g=c&~e,0!==g?d=tc(g):0!==f&&(d=tc(f));if(0===d)return 0;if(0!==b&&b!==d&&0===(b&e)&&(e=d&-d,f=b&-b,e>=f||16===e&&0!==(f&4194240)))return b;0!==(d&4)&&(d|=c&16);b=a.entangledLanes;if(0!==b)for(a=a.entanglements,b&=d;0<b;)c=31-oc(b),e=1<<c,d|=a[c],b&=~e;return d}\nfunction vc(a,b){switch(a){case 1:case 2:case 4:return b+250;case 8:case 16:case 32:case 64:case 128:case 256:case 512:case 1024:case 2048:case 4096:case 8192:case 16384:case 32768:case 65536:case 131072:case 262144:case 524288:case 1048576:case 2097152:return b+5E3;case 4194304:case 8388608:case 16777216:case 33554432:case 67108864:return-1;case 134217728:case 268435456:case 536870912:case 1073741824:return-1;default:return-1}}\nfunction wc(a,b){for(var c=a.suspendedLanes,d=a.pingedLanes,e=a.expirationTimes,f=a.pendingLanes;0<f;){var g=31-oc(f),h=1<<g,k=e[g];if(-1===k){if(0===(h&c)||0!==(h&d))e[g]=vc(h,b)}else k<=b&&(a.expiredLanes|=h);f&=~h}}function xc(a){a=a.pendingLanes&-1073741825;return 0!==a?a:a&1073741824?1073741824:0}function yc(){var a=rc;rc<<=1;0===(rc&4194240)&&(rc=64);return a}function zc(a){for(var b=[],c=0;31>c;c++)b.push(a);return b}\nfunction Ac(a,b,c){a.pendingLanes|=b;536870912!==b&&(a.suspendedLanes=0,a.pingedLanes=0);a=a.eventTimes;b=31-oc(b);a[b]=c}function Bc(a,b){var c=a.pendingLanes&~b;a.pendingLanes=b;a.suspendedLanes=0;a.pingedLanes=0;a.expiredLanes&=b;a.mutableReadLanes&=b;a.entangledLanes&=b;b=a.entanglements;var d=a.eventTimes;for(a=a.expirationTimes;0<c;){var e=31-oc(c),f=1<<e;b[e]=0;d[e]=-1;a[e]=-1;c&=~f}}\nfunction Cc(a,b){var c=a.entangledLanes|=b;for(a=a.entanglements;c;){var d=31-oc(c),e=1<<d;e&b|a[d]&b&&(a[d]|=b);c&=~e}}var C=0;function Dc(a){a&=-a;return 1<a?4<a?0!==(a&268435455)?16:536870912:4:1}var Ec,Fc,Gc,Hc,Ic,Jc=!1,Kc=[],Lc=null,Mc=null,Nc=null,Oc=new Map,Pc=new Map,Qc=[],Rc=\"mousedown mouseup touchcancel touchend touchstart auxclick dblclick pointercancel pointerdown pointerup dragend dragstart drop compositionend compositionstart keydown keypress keyup input textInput copy cut paste click change contextmenu reset submit\".split(\" \");\nfunction Sc(a,b){switch(a){case \"focusin\":case \"focusout\":Lc=null;break;case \"dragenter\":case \"dragleave\":Mc=null;break;case \"mouseover\":case \"mouseout\":Nc=null;break;case \"pointerover\":case \"pointerout\":Oc.delete(b.pointerId);break;case \"gotpointercapture\":case \"lostpointercapture\":Pc.delete(b.pointerId)}}\nfunction Tc(a,b,c,d,e,f){if(null===a||a.nativeEvent!==f)return a={blockedOn:b,domEventName:c,eventSystemFlags:d,nativeEvent:f,targetContainers:[e]},null!==b&&(b=Cb(b),null!==b&&Fc(b)),a;a.eventSystemFlags|=d;b=a.targetContainers;null!==e&&-1===b.indexOf(e)&&b.push(e);return a}\nfunction Uc(a,b,c,d,e){switch(b){case \"focusin\":return Lc=Tc(Lc,a,b,c,d,e),!0;case \"dragenter\":return Mc=Tc(Mc,a,b,c,d,e),!0;case \"mouseover\":return Nc=Tc(Nc,a,b,c,d,e),!0;case \"pointerover\":var f=e.pointerId;Oc.set(f,Tc(Oc.get(f)||null,a,b,c,d,e));return!0;case \"gotpointercapture\":return f=e.pointerId,Pc.set(f,Tc(Pc.get(f)||null,a,b,c,d,e)),!0}return!1}\nfunction Vc(a){var b=Wc(a.target);if(null!==b){var c=Vb(b);if(null!==c)if(b=c.tag,13===b){if(b=Wb(c),null!==b){a.blockedOn=b;Ic(a.priority,function(){Gc(c)});return}}else if(3===b&&c.stateNode.current.memoizedState.isDehydrated){a.blockedOn=3===c.tag?c.stateNode.containerInfo:null;return}}a.blockedOn=null}\nfunction Xc(a){if(null!==a.blockedOn)return!1;for(var b=a.targetContainers;0<b.length;){var c=Yc(a.domEventName,a.eventSystemFlags,b[0],a.nativeEvent);if(null===c){c=a.nativeEvent;var d=new c.constructor(c.type,c);wb=d;c.target.dispatchEvent(d);wb=null}else return b=Cb(c),null!==b&&Fc(b),a.blockedOn=c,!1;b.shift()}return!0}function Zc(a,b,c){Xc(a)&&c.delete(b)}function $c(){Jc=!1;null!==Lc&&Xc(Lc)&&(Lc=null);null!==Mc&&Xc(Mc)&&(Mc=null);null!==Nc&&Xc(Nc)&&(Nc=null);Oc.forEach(Zc);Pc.forEach(Zc)}\nfunction ad(a,b){a.blockedOn===b&&(a.blockedOn=null,Jc||(Jc=!0,ca.unstable_scheduleCallback(ca.unstable_NormalPriority,$c)))}\nfunction bd(a){function b(b){return ad(b,a)}if(0<Kc.length){ad(Kc[0],a);for(var c=1;c<Kc.length;c++){var d=Kc[c];d.blockedOn===a&&(d.blockedOn=null)}}null!==Lc&&ad(Lc,a);null!==Mc&&ad(Mc,a);null!==Nc&&ad(Nc,a);Oc.forEach(b);Pc.forEach(b);for(c=0;c<Qc.length;c++)d=Qc[c],d.blockedOn===a&&(d.blockedOn=null);for(;0<Qc.length&&(c=Qc[0],null===c.blockedOn);)Vc(c),null===c.blockedOn&&Qc.shift()}var cd=ua.ReactCurrentBatchConfig,dd=!0;\nfunction ed(a,b,c,d){var e=C,f=cd.transition;cd.transition=null;try{C=1,fd(a,b,c,d)}finally{C=e,cd.transition=f}}function gd(a,b,c,d){var e=C,f=cd.transition;cd.transition=null;try{C=4,fd(a,b,c,d)}finally{C=e,cd.transition=f}}\nfunction fd(a,b,c,d){if(dd){var e=Yc(a,b,c,d);if(null===e)hd(a,b,d,id,c),Sc(a,d);else if(Uc(e,a,b,c,d))d.stopPropagation();else if(Sc(a,d),b&4&&-1<Rc.indexOf(a)){for(;null!==e;){var f=Cb(e);null!==f&&Ec(f);f=Yc(a,b,c,d);null===f&&hd(a,b,d,id,c);if(f===e)break;e=f}null!==e&&d.stopPropagation()}else hd(a,b,d,null,c)}}var id=null;\nfunction Yc(a,b,c,d){id=null;a=xb(d);a=Wc(a);if(null!==a)if(b=Vb(a),null===b)a=null;else if(c=b.tag,13===c){a=Wb(b);if(null!==a)return a;a=null}else if(3===c){if(b.stateNode.current.memoizedState.isDehydrated)return 3===b.tag?b.stateNode.containerInfo:null;a=null}else b!==a&&(a=null);id=a;return null}\nfunction jd(a){switch(a){case \"cancel\":case \"click\":case \"close\":case \"contextmenu\":case \"copy\":case \"cut\":case \"auxclick\":case \"dblclick\":case \"dragend\":case \"dragstart\":case \"drop\":case \"focusin\":case \"focusout\":case \"input\":case \"invalid\":case \"keydown\":case \"keypress\":case \"keyup\":case \"mousedown\":case \"mouseup\":case \"paste\":case \"pause\":case \"play\":case \"pointercancel\":case \"pointerdown\":case \"pointerup\":case \"ratechange\":case \"reset\":case \"resize\":case \"seeked\":case \"submit\":case \"touchcancel\":case \"touchend\":case \"touchstart\":case \"volumechange\":case \"change\":case \"selectionchange\":case \"textInput\":case \"compositionstart\":case \"compositionend\":case \"compositionupdate\":case \"beforeblur\":case \"afterblur\":case \"beforeinput\":case \"blur\":case \"fullscreenchange\":case \"focus\":case \"hashchange\":case \"popstate\":case \"select\":case \"selectstart\":return 1;case \"drag\":case \"dragenter\":case \"dragexit\":case \"dragleave\":case \"dragover\":case \"mousemove\":case \"mouseout\":case \"mouseover\":case \"pointermove\":case \"pointerout\":case \"pointerover\":case \"scroll\":case \"toggle\":case \"touchmove\":case \"wheel\":case \"mouseenter\":case \"mouseleave\":case \"pointerenter\":case \"pointerleave\":return 4;\ncase \"message\":switch(ec()){case fc:return 1;case gc:return 4;case hc:case ic:return 16;case jc:return 536870912;default:return 16}default:return 16}}var kd=null,ld=null,md=null;function nd(){if(md)return md;var a,b=ld,c=b.length,d,e=\"value\"in kd?kd.value:kd.textContent,f=e.length;for(a=0;a<c&&b[a]===e[a];a++);var g=c-a;for(d=1;d<=g&&b[c-d]===e[f-d];d++);return md=e.slice(a,1<d?1-d:void 0)}\nfunction od(a){var b=a.keyCode;\"charCode\"in a?(a=a.charCode,0===a&&13===b&&(a=13)):a=b;10===a&&(a=13);return 32<=a||13===a?a:0}function pd(){return!0}function qd(){return!1}\nfunction rd(a){function b(b,d,e,f,g){this._reactName=b;this._targetInst=e;this.type=d;this.nativeEvent=f;this.target=g;this.currentTarget=null;for(var c in a)a.hasOwnProperty(c)&&(b=a[c],this[c]=b?b(f):f[c]);this.isDefaultPrevented=(null!=f.defaultPrevented?f.defaultPrevented:!1===f.returnValue)?pd:qd;this.isPropagationStopped=qd;return this}A(b.prototype,{preventDefault:function(){this.defaultPrevented=!0;var a=this.nativeEvent;a&&(a.preventDefault?a.preventDefault():\"unknown\"!==typeof a.returnValue&&\n(a.returnValue=!1),this.isDefaultPrevented=pd)},stopPropagation:function(){var a=this.nativeEvent;a&&(a.stopPropagation?a.stopPropagation():\"unknown\"!==typeof a.cancelBubble&&(a.cancelBubble=!0),this.isPropagationStopped=pd)},persist:function(){},isPersistent:pd});return b}\nvar sd={eventPhase:0,bubbles:0,cancelable:0,timeStamp:function(a){return a.timeStamp||Date.now()},defaultPrevented:0,isTrusted:0},td=rd(sd),ud=A({},sd,{view:0,detail:0}),vd=rd(ud),wd,xd,yd,Ad=A({},ud,{screenX:0,screenY:0,clientX:0,clientY:0,pageX:0,pageY:0,ctrlKey:0,shiftKey:0,altKey:0,metaKey:0,getModifierState:zd,button:0,buttons:0,relatedTarget:function(a){return void 0===a.relatedTarget?a.fromElement===a.srcElement?a.toElement:a.fromElement:a.relatedTarget},movementX:function(a){if(\"movementX\"in\na)return a.movementX;a!==yd&&(yd&&\"mousemove\"===a.type?(wd=a.screenX-yd.screenX,xd=a.screenY-yd.screenY):xd=wd=0,yd=a);return wd},movementY:function(a){return\"movementY\"in a?a.movementY:xd}}),Bd=rd(Ad),Cd=A({},Ad,{dataTransfer:0}),Dd=rd(Cd),Ed=A({},ud,{relatedTarget:0}),Fd=rd(Ed),Gd=A({},sd,{animationName:0,elapsedTime:0,pseudoElement:0}),Hd=rd(Gd),Id=A({},sd,{clipboardData:function(a){return\"clipboardData\"in a?a.clipboardData:window.clipboardData}}),Jd=rd(Id),Kd=A({},sd,{data:0}),Ld=rd(Kd),Md={Esc:\"Escape\",\nSpacebar:\" \",Left:\"ArrowLeft\",Up:\"ArrowUp\",Right:\"ArrowRight\",Down:\"ArrowDown\",Del:\"Delete\",Win:\"OS\",Menu:\"ContextMenu\",Apps:\"ContextMenu\",Scroll:\"ScrollLock\",MozPrintableKey:\"Unidentified\"},Nd={8:\"Backspace\",9:\"Tab\",12:\"Clear\",13:\"Enter\",16:\"Shift\",17:\"Control\",18:\"Alt\",19:\"Pause\",20:\"CapsLock\",27:\"Escape\",32:\" \",33:\"PageUp\",34:\"PageDown\",35:\"End\",36:\"Home\",37:\"ArrowLeft\",38:\"ArrowUp\",39:\"ArrowRight\",40:\"ArrowDown\",45:\"Insert\",46:\"Delete\",112:\"F1\",113:\"F2\",114:\"F3\",115:\"F4\",116:\"F5\",117:\"F6\",118:\"F7\",\n119:\"F8\",120:\"F9\",121:\"F10\",122:\"F11\",123:\"F12\",144:\"NumLock\",145:\"ScrollLock\",224:\"Meta\"},Od={Alt:\"altKey\",Control:\"ctrlKey\",Meta:\"metaKey\",Shift:\"shiftKey\"};function Pd(a){var b=this.nativeEvent;return b.getModifierState?b.getModifierState(a):(a=Od[a])?!!b[a]:!1}function zd(){return Pd}\nvar Qd=A({},ud,{key:function(a){if(a.key){var b=Md[a.key]||a.key;if(\"Unidentified\"!==b)return b}return\"keypress\"===a.type?(a=od(a),13===a?\"Enter\":String.fromCharCode(a)):\"keydown\"===a.type||\"keyup\"===a.type?Nd[a.keyCode]||\"Unidentified\":\"\"},code:0,location:0,ctrlKey:0,shiftKey:0,altKey:0,metaKey:0,repeat:0,locale:0,getModifierState:zd,charCode:function(a){return\"keypress\"===a.type?od(a):0},keyCode:function(a){return\"keydown\"===a.type||\"keyup\"===a.type?a.keyCode:0},which:function(a){return\"keypress\"===\na.type?od(a):\"keydown\"===a.type||\"keyup\"===a.type?a.keyCode:0}}),Rd=rd(Qd),Sd=A({},Ad,{pointerId:0,width:0,height:0,pressure:0,tangentialPressure:0,tiltX:0,tiltY:0,twist:0,pointerType:0,isPrimary:0}),Td=rd(Sd),Ud=A({},ud,{touches:0,targetTouches:0,changedTouches:0,altKey:0,metaKey:0,ctrlKey:0,shiftKey:0,getModifierState:zd}),Vd=rd(Ud),Wd=A({},sd,{propertyName:0,elapsedTime:0,pseudoElement:0}),Xd=rd(Wd),Yd=A({},Ad,{deltaX:function(a){return\"deltaX\"in a?a.deltaX:\"wheelDeltaX\"in a?-a.wheelDeltaX:0},\ndeltaY:function(a){return\"deltaY\"in a?a.deltaY:\"wheelDeltaY\"in a?-a.wheelDeltaY:\"wheelDelta\"in a?-a.wheelDelta:0},deltaZ:0,deltaMode:0}),Zd=rd(Yd),$d=[9,13,27,32],ae=ia&&\"CompositionEvent\"in window,be=null;ia&&\"documentMode\"in document&&(be=document.documentMode);var ce=ia&&\"TextEvent\"in window&&!be,de=ia&&(!ae||be&&8<be&&11>=be),ee=String.fromCharCode(32),fe=!1;\nfunction ge(a,b){switch(a){case \"keyup\":return-1!==$d.indexOf(b.keyCode);case \"keydown\":return 229!==b.keyCode;case \"keypress\":case \"mousedown\":case \"focusout\":return!0;default:return!1}}function he(a){a=a.detail;return\"object\"===typeof a&&\"data\"in a?a.data:null}var ie=!1;function je(a,b){switch(a){case \"compositionend\":return he(b);case \"keypress\":if(32!==b.which)return null;fe=!0;return ee;case \"textInput\":return a=b.data,a===ee&&fe?null:a;default:return null}}\nfunction ke(a,b){if(ie)return\"compositionend\"===a||!ae&&ge(a,b)?(a=nd(),md=ld=kd=null,ie=!1,a):null;switch(a){case \"paste\":return null;case \"keypress\":if(!(b.ctrlKey||b.altKey||b.metaKey)||b.ctrlKey&&b.altKey){if(b.char&&1<b.char.length)return b.char;if(b.which)return String.fromCharCode(b.which)}return null;case \"compositionend\":return de&&\"ko\"!==b.locale?null:b.data;default:return null}}\nvar le={color:!0,date:!0,datetime:!0,\"datetime-local\":!0,email:!0,month:!0,number:!0,password:!0,range:!0,search:!0,tel:!0,text:!0,time:!0,url:!0,week:!0};function me(a){var b=a&&a.nodeName&&a.nodeName.toLowerCase();return\"input\"===b?!!le[a.type]:\"textarea\"===b?!0:!1}function ne(a,b,c,d){Eb(d);b=oe(b,\"onChange\");0<b.length&&(c=new td(\"onChange\",\"change\",null,c,d),a.push({event:c,listeners:b}))}var pe=null,qe=null;function re(a){se(a,0)}function te(a){var b=ue(a);if(Wa(b))return a}\nfunction ve(a,b){if(\"change\"===a)return b}var we=!1;if(ia){var xe;if(ia){var ye=\"oninput\"in document;if(!ye){var ze=document.createElement(\"div\");ze.setAttribute(\"oninput\",\"return;\");ye=\"function\"===typeof ze.oninput}xe=ye}else xe=!1;we=xe&&(!document.documentMode||9<document.documentMode)}function Ae(){pe&&(pe.detachEvent(\"onpropertychange\",Be),qe=pe=null)}function Be(a){if(\"value\"===a.propertyName&&te(qe)){var b=[];ne(b,qe,a,xb(a));Jb(re,b)}}\nfunction Ce(a,b,c){\"focusin\"===a?(Ae(),pe=b,qe=c,pe.attachEvent(\"onpropertychange\",Be)):\"focusout\"===a&&Ae()}function De(a){if(\"selectionchange\"===a||\"keyup\"===a||\"keydown\"===a)return te(qe)}function Ee(a,b){if(\"click\"===a)return te(b)}function Fe(a,b){if(\"input\"===a||\"change\"===a)return te(b)}function Ge(a,b){return a===b&&(0!==a||1/a===1/b)||a!==a&&b!==b}var He=\"function\"===typeof Object.is?Object.is:Ge;\nfunction Ie(a,b){if(He(a,b))return!0;if(\"object\"!==typeof a||null===a||\"object\"!==typeof b||null===b)return!1;var c=Object.keys(a),d=Object.keys(b);if(c.length!==d.length)return!1;for(d=0;d<c.length;d++){var e=c[d];if(!ja.call(b,e)||!He(a[e],b[e]))return!1}return!0}function Je(a){for(;a&&a.firstChild;)a=a.firstChild;return a}\nfunction Ke(a,b){var c=Je(a);a=0;for(var d;c;){if(3===c.nodeType){d=a+c.textContent.length;if(a<=b&&d>=b)return{node:c,offset:b-a};a=d}a:{for(;c;){if(c.nextSibling){c=c.nextSibling;break a}c=c.parentNode}c=void 0}c=Je(c)}}function Le(a,b){return a&&b?a===b?!0:a&&3===a.nodeType?!1:b&&3===b.nodeType?Le(a,b.parentNode):\"contains\"in a?a.contains(b):a.compareDocumentPosition?!!(a.compareDocumentPosition(b)&16):!1:!1}\nfunction Me(){for(var a=window,b=Xa();b instanceof a.HTMLIFrameElement;){try{var c=\"string\"===typeof b.contentWindow.location.href}catch(d){c=!1}if(c)a=b.contentWindow;else break;b=Xa(a.document)}return b}function Ne(a){var b=a&&a.nodeName&&a.nodeName.toLowerCase();return b&&(\"input\"===b&&(\"text\"===a.type||\"search\"===a.type||\"tel\"===a.type||\"url\"===a.type||\"password\"===a.type)||\"textarea\"===b||\"true\"===a.contentEditable)}\nfunction Oe(a){var b=Me(),c=a.focusedElem,d=a.selectionRange;if(b!==c&&c&&c.ownerDocument&&Le(c.ownerDocument.documentElement,c)){if(null!==d&&Ne(c))if(b=d.start,a=d.end,void 0===a&&(a=b),\"selectionStart\"in c)c.selectionStart=b,c.selectionEnd=Math.min(a,c.value.length);else if(a=(b=c.ownerDocument||document)&&b.defaultView||window,a.getSelection){a=a.getSelection();var e=c.textContent.length,f=Math.min(d.start,e);d=void 0===d.end?f:Math.min(d.end,e);!a.extend&&f>d&&(e=d,d=f,f=e);e=Ke(c,f);var g=Ke(c,\nd);e&&g&&(1!==a.rangeCount||a.anchorNode!==e.node||a.anchorOffset!==e.offset||a.focusNode!==g.node||a.focusOffset!==g.offset)&&(b=b.createRange(),b.setStart(e.node,e.offset),a.removeAllRanges(),f>d?(a.addRange(b),a.extend(g.node,g.offset)):(b.setEnd(g.node,g.offset),a.addRange(b)))}b=[];for(a=c;a=a.parentNode;)1===a.nodeType&&b.push({element:a,left:a.scrollLeft,top:a.scrollTop});\"function\"===typeof c.focus&&c.focus();for(c=0;c<b.length;c++)a=b[c],a.element.scrollLeft=a.left,a.element.scrollTop=a.top}}\nvar Pe=ia&&\"documentMode\"in document&&11>=document.documentMode,Qe=null,Re=null,Se=null,Te=!1;\nfunction Ue(a,b,c){var d=c.window===c?c.document:9===c.nodeType?c:c.ownerDocument;Te||null==Qe||Qe!==Xa(d)||(d=Qe,\"selectionStart\"in d&&Ne(d)?d={start:d.selectionStart,end:d.selectionEnd}:(d=(d.ownerDocument&&d.ownerDocument.defaultView||window).getSelection(),d={anchorNode:d.anchorNode,anchorOffset:d.anchorOffset,focusNode:d.focusNode,focusOffset:d.focusOffset}),Se&&Ie(Se,d)||(Se=d,d=oe(Re,\"onSelect\"),0<d.length&&(b=new td(\"onSelect\",\"select\",null,b,c),a.push({event:b,listeners:d}),b.target=Qe)))}\nfunction Ve(a,b){var c={};c[a.toLowerCase()]=b.toLowerCase();c[\"Webkit\"+a]=\"webkit\"+b;c[\"Moz\"+a]=\"moz\"+b;return c}var We={animationend:Ve(\"Animation\",\"AnimationEnd\"),animationiteration:Ve(\"Animation\",\"AnimationIteration\"),animationstart:Ve(\"Animation\",\"AnimationStart\"),transitionend:Ve(\"Transition\",\"TransitionEnd\")},Xe={},Ye={};\nia&&(Ye=document.createElement(\"div\").style,\"AnimationEvent\"in window||(delete We.animationend.animation,delete We.animationiteration.animation,delete We.animationstart.animation),\"TransitionEvent\"in window||delete We.transitionend.transition);function Ze(a){if(Xe[a])return Xe[a];if(!We[a])return a;var b=We[a],c;for(c in b)if(b.hasOwnProperty(c)&&c in Ye)return Xe[a]=b[c];return a}var $e=Ze(\"animationend\"),af=Ze(\"animationiteration\"),bf=Ze(\"animationstart\"),cf=Ze(\"transitionend\"),df=new Map,ef=\"abort auxClick cancel canPlay canPlayThrough click close contextMenu copy cut drag dragEnd dragEnter dragExit dragLeave dragOver dragStart drop durationChange emptied encrypted ended error gotPointerCapture input invalid keyDown keyPress keyUp load loadedData loadedMetadata loadStart lostPointerCapture mouseDown mouseMove mouseOut mouseOver mouseUp paste pause play playing pointerCancel pointerDown pointerMove pointerOut pointerOver pointerUp progress rateChange reset resize seeked seeking stalled submit suspend timeUpdate touchCancel touchEnd touchStart volumeChange scroll toggle touchMove waiting wheel\".split(\" \");\nfunction ff(a,b){df.set(a,b);fa(b,[a])}for(var gf=0;gf<ef.length;gf++){var hf=ef[gf],jf=hf.toLowerCase(),kf=hf[0].toUpperCase()+hf.slice(1);ff(jf,\"on\"+kf)}ff($e,\"onAnimationEnd\");ff(af,\"onAnimationIteration\");ff(bf,\"onAnimationStart\");ff(\"dblclick\",\"onDoubleClick\");ff(\"focusin\",\"onFocus\");ff(\"focusout\",\"onBlur\");ff(cf,\"onTransitionEnd\");ha(\"onMouseEnter\",[\"mouseout\",\"mouseover\"]);ha(\"onMouseLeave\",[\"mouseout\",\"mouseover\"]);ha(\"onPointerEnter\",[\"pointerout\",\"pointerover\"]);\nha(\"onPointerLeave\",[\"pointerout\",\"pointerover\"]);fa(\"onChange\",\"change click focusin focusout input keydown keyup selectionchange\".split(\" \"));fa(\"onSelect\",\"focusout contextmenu dragend focusin keydown keyup mousedown mouseup selectionchange\".split(\" \"));fa(\"onBeforeInput\",[\"compositionend\",\"keypress\",\"textInput\",\"paste\"]);fa(\"onCompositionEnd\",\"compositionend focusout keydown keypress keyup mousedown\".split(\" \"));fa(\"onCompositionStart\",\"compositionstart focusout keydown keypress keyup mousedown\".split(\" \"));\nfa(\"onCompositionUpdate\",\"compositionupdate focusout keydown keypress keyup mousedown\".split(\" \"));var lf=\"abort canplay canplaythrough durationchange emptied encrypted ended error loadeddata loadedmetadata loadstart pause play playing progress ratechange resize seeked seeking stalled suspend timeupdate volumechange waiting\".split(\" \"),mf=new Set(\"cancel close invalid load scroll toggle\".split(\" \").concat(lf));\nfunction nf(a,b,c){var d=a.type||\"unknown-event\";a.currentTarget=c;Ub(d,b,void 0,a);a.currentTarget=null}\nfunction se(a,b){b=0!==(b&4);for(var c=0;c<a.length;c++){var d=a[c],e=d.event;d=d.listeners;a:{var f=void 0;if(b)for(var g=d.length-1;0<=g;g--){var h=d[g],k=h.instance,l=h.currentTarget;h=h.listener;if(k!==f&&e.isPropagationStopped())break a;nf(e,h,l);f=k}else for(g=0;g<d.length;g++){h=d[g];k=h.instance;l=h.currentTarget;h=h.listener;if(k!==f&&e.isPropagationStopped())break a;nf(e,h,l);f=k}}}if(Qb)throw a=Rb,Qb=!1,Rb=null,a;}\nfunction D(a,b){var c=b[of];void 0===c&&(c=b[of]=new Set);var d=a+\"__bubble\";c.has(d)||(pf(b,a,2,!1),c.add(d))}function qf(a,b,c){var d=0;b&&(d|=4);pf(c,a,d,b)}var rf=\"_reactListening\"+Math.random().toString(36).slice(2);function sf(a){if(!a[rf]){a[rf]=!0;da.forEach(function(b){\"selectionchange\"!==b&&(mf.has(b)||qf(b,!1,a),qf(b,!0,a))});var b=9===a.nodeType?a:a.ownerDocument;null===b||b[rf]||(b[rf]=!0,qf(\"selectionchange\",!1,b))}}\nfunction pf(a,b,c,d){switch(jd(b)){case 1:var e=ed;break;case 4:e=gd;break;default:e=fd}c=e.bind(null,b,c,a);e=void 0;!Lb||\"touchstart\"!==b&&\"touchmove\"!==b&&\"wheel\"!==b||(e=!0);d?void 0!==e?a.addEventListener(b,c,{capture:!0,passive:e}):a.addEventListener(b,c,!0):void 0!==e?a.addEventListener(b,c,{passive:e}):a.addEventListener(b,c,!1)}\nfunction hd(a,b,c,d,e){var f=d;if(0===(b&1)&&0===(b&2)&&null!==d)a:for(;;){if(null===d)return;var g=d.tag;if(3===g||4===g){var h=d.stateNode.containerInfo;if(h===e||8===h.nodeType&&h.parentNode===e)break;if(4===g)for(g=d.return;null!==g;){var k=g.tag;if(3===k||4===k)if(k=g.stateNode.containerInfo,k===e||8===k.nodeType&&k.parentNode===e)return;g=g.return}for(;null!==h;){g=Wc(h);if(null===g)return;k=g.tag;if(5===k||6===k){d=f=g;continue a}h=h.parentNode}}d=d.return}Jb(function(){var d=f,e=xb(c),g=[];\na:{var h=df.get(a);if(void 0!==h){var k=td,n=a;switch(a){case \"keypress\":if(0===od(c))break a;case \"keydown\":case \"keyup\":k=Rd;break;case \"focusin\":n=\"focus\";k=Fd;break;case \"focusout\":n=\"blur\";k=Fd;break;case \"beforeblur\":case \"afterblur\":k=Fd;break;case \"click\":if(2===c.button)break a;case \"auxclick\":case \"dblclick\":case \"mousedown\":case \"mousemove\":case \"mouseup\":case \"mouseout\":case \"mouseover\":case \"contextmenu\":k=Bd;break;case \"drag\":case \"dragend\":case \"dragenter\":case \"dragexit\":case \"dragleave\":case \"dragover\":case \"dragstart\":case \"drop\":k=\nDd;break;case \"touchcancel\":case \"touchend\":case \"touchmove\":case \"touchstart\":k=Vd;break;case $e:case af:case bf:k=Hd;break;case cf:k=Xd;break;case \"scroll\":k=vd;break;case \"wheel\":k=Zd;break;case \"copy\":case \"cut\":case \"paste\":k=Jd;break;case \"gotpointercapture\":case \"lostpointercapture\":case \"pointercancel\":case \"pointerdown\":case \"pointermove\":case \"pointerout\":case \"pointerover\":case \"pointerup\":k=Td}var t=0!==(b&4),J=!t&&\"scroll\"===a,x=t?null!==h?h+\"Capture\":null:h;t=[];for(var w=d,u;null!==\nw;){u=w;var F=u.stateNode;5===u.tag&&null!==F&&(u=F,null!==x&&(F=Kb(w,x),null!=F&&t.push(tf(w,F,u))));if(J)break;w=w.return}0<t.length&&(h=new k(h,n,null,c,e),g.push({event:h,listeners:t}))}}if(0===(b&7)){a:{h=\"mouseover\"===a||\"pointerover\"===a;k=\"mouseout\"===a||\"pointerout\"===a;if(h&&c!==wb&&(n=c.relatedTarget||c.fromElement)&&(Wc(n)||n[uf]))break a;if(k||h){h=e.window===e?e:(h=e.ownerDocument)?h.defaultView||h.parentWindow:window;if(k){if(n=c.relatedTarget||c.toElement,k=d,n=n?Wc(n):null,null!==\nn&&(J=Vb(n),n!==J||5!==n.tag&&6!==n.tag))n=null}else k=null,n=d;if(k!==n){t=Bd;F=\"onMouseLeave\";x=\"onMouseEnter\";w=\"mouse\";if(\"pointerout\"===a||\"pointerover\"===a)t=Td,F=\"onPointerLeave\",x=\"onPointerEnter\",w=\"pointer\";J=null==k?h:ue(k);u=null==n?h:ue(n);h=new t(F,w+\"leave\",k,c,e);h.target=J;h.relatedTarget=u;F=null;Wc(e)===d&&(t=new t(x,w+\"enter\",n,c,e),t.target=u,t.relatedTarget=J,F=t);J=F;if(k&&n)b:{t=k;x=n;w=0;for(u=t;u;u=vf(u))w++;u=0;for(F=x;F;F=vf(F))u++;for(;0<w-u;)t=vf(t),w--;for(;0<u-w;)x=\nvf(x),u--;for(;w--;){if(t===x||null!==x&&t===x.alternate)break b;t=vf(t);x=vf(x)}t=null}else t=null;null!==k&&wf(g,h,k,t,!1);null!==n&&null!==J&&wf(g,J,n,t,!0)}}}a:{h=d?ue(d):window;k=h.nodeName&&h.nodeName.toLowerCase();if(\"select\"===k||\"input\"===k&&\"file\"===h.type)var na=ve;else if(me(h))if(we)na=Fe;else{na=De;var xa=Ce}else(k=h.nodeName)&&\"input\"===k.toLowerCase()&&(\"checkbox\"===h.type||\"radio\"===h.type)&&(na=Ee);if(na&&(na=na(a,d))){ne(g,na,c,e);break a}xa&&xa(a,h,d);\"focusout\"===a&&(xa=h._wrapperState)&&\nxa.controlled&&\"number\"===h.type&&cb(h,\"number\",h.value)}xa=d?ue(d):window;switch(a){case \"focusin\":if(me(xa)||\"true\"===xa.contentEditable)Qe=xa,Re=d,Se=null;break;case \"focusout\":Se=Re=Qe=null;break;case \"mousedown\":Te=!0;break;case \"contextmenu\":case \"mouseup\":case \"dragend\":Te=!1;Ue(g,c,e);break;case \"selectionchange\":if(Pe)break;case \"keydown\":case \"keyup\":Ue(g,c,e)}var $a;if(ae)b:{switch(a){case \"compositionstart\":var ba=\"onCompositionStart\";break b;case \"compositionend\":ba=\"onCompositionEnd\";\nbreak b;case \"compositionupdate\":ba=\"onCompositionUpdate\";break b}ba=void 0}else ie?ge(a,c)&&(ba=\"onCompositionEnd\"):\"keydown\"===a&&229===c.keyCode&&(ba=\"onCompositionStart\");ba&&(de&&\"ko\"!==c.locale&&(ie||\"onCompositionStart\"!==ba?\"onCompositionEnd\"===ba&&ie&&($a=nd()):(kd=e,ld=\"value\"in kd?kd.value:kd.textContent,ie=!0)),xa=oe(d,ba),0<xa.length&&(ba=new Ld(ba,a,null,c,e),g.push({event:ba,listeners:xa}),$a?ba.data=$a:($a=he(c),null!==$a&&(ba.data=$a))));if($a=ce?je(a,c):ke(a,c))d=oe(d,\"onBeforeInput\"),\n0<d.length&&(e=new Ld(\"onBeforeInput\",\"beforeinput\",null,c,e),g.push({event:e,listeners:d}),e.data=$a)}se(g,b)})}function tf(a,b,c){return{instance:a,listener:b,currentTarget:c}}function oe(a,b){for(var c=b+\"Capture\",d=[];null!==a;){var e=a,f=e.stateNode;5===e.tag&&null!==f&&(e=f,f=Kb(a,c),null!=f&&d.unshift(tf(a,f,e)),f=Kb(a,b),null!=f&&d.push(tf(a,f,e)));a=a.return}return d}function vf(a){if(null===a)return null;do a=a.return;while(a&&5!==a.tag);return a?a:null}\nfunction wf(a,b,c,d,e){for(var f=b._reactName,g=[];null!==c&&c!==d;){var h=c,k=h.alternate,l=h.stateNode;if(null!==k&&k===d)break;5===h.tag&&null!==l&&(h=l,e?(k=Kb(c,f),null!=k&&g.unshift(tf(c,k,h))):e||(k=Kb(c,f),null!=k&&g.push(tf(c,k,h))));c=c.return}0!==g.length&&a.push({event:b,listeners:g})}var xf=/\\r\\n?/g,yf=/\\u0000|\\uFFFD/g;function zf(a){return(\"string\"===typeof a?a:\"\"+a).replace(xf,\"\\n\").replace(yf,\"\")}function Af(a,b,c){b=zf(b);if(zf(a)!==b&&c)throw Error(p(425));}function Bf(){}\nvar Cf=null,Df=null;function Ef(a,b){return\"textarea\"===a||\"noscript\"===a||\"string\"===typeof b.children||\"number\"===typeof b.children||\"object\"===typeof b.dangerouslySetInnerHTML&&null!==b.dangerouslySetInnerHTML&&null!=b.dangerouslySetInnerHTML.__html}\nvar Ff=\"function\"===typeof setTimeout?setTimeout:void 0,Gf=\"function\"===typeof clearTimeout?clearTimeout:void 0,Hf=\"function\"===typeof Promise?Promise:void 0,Jf=\"function\"===typeof queueMicrotask?queueMicrotask:\"undefined\"!==typeof Hf?function(a){return Hf.resolve(null).then(a).catch(If)}:Ff;function If(a){setTimeout(function(){throw a;})}\nfunction Kf(a,b){var c=b,d=0;do{var e=c.nextSibling;a.removeChild(c);if(e&&8===e.nodeType)if(c=e.data,\"/$\"===c){if(0===d){a.removeChild(e);bd(b);return}d--}else\"$\"!==c&&\"$?\"!==c&&\"$!\"!==c||d++;c=e}while(c);bd(b)}function Lf(a){for(;null!=a;a=a.nextSibling){var b=a.nodeType;if(1===b||3===b)break;if(8===b){b=a.data;if(\"$\"===b||\"$!\"===b||\"$?\"===b)break;if(\"/$\"===b)return null}}return a}\nfunction Mf(a){a=a.previousSibling;for(var b=0;a;){if(8===a.nodeType){var c=a.data;if(\"$\"===c||\"$!\"===c||\"$?\"===c){if(0===b)return a;b--}else\"/$\"===c&&b++}a=a.previousSibling}return null}var Nf=Math.random().toString(36).slice(2),Of=\"__reactFiber$\"+Nf,Pf=\"__reactProps$\"+Nf,uf=\"__reactContainer$\"+Nf,of=\"__reactEvents$\"+Nf,Qf=\"__reactListeners$\"+Nf,Rf=\"__reactHandles$\"+Nf;\nfunction Wc(a){var b=a[Of];if(b)return b;for(var c=a.parentNode;c;){if(b=c[uf]||c[Of]){c=b.alternate;if(null!==b.child||null!==c&&null!==c.child)for(a=Mf(a);null!==a;){if(c=a[Of])return c;a=Mf(a)}return b}a=c;c=a.parentNode}return null}function Cb(a){a=a[Of]||a[uf];return!a||5!==a.tag&&6!==a.tag&&13!==a.tag&&3!==a.tag?null:a}function ue(a){if(5===a.tag||6===a.tag)return a.stateNode;throw Error(p(33));}function Db(a){return a[Pf]||null}var Sf=[],Tf=-1;function Uf(a){return{current:a}}\nfunction E(a){0>Tf||(a.current=Sf[Tf],Sf[Tf]=null,Tf--)}function G(a,b){Tf++;Sf[Tf]=a.current;a.current=b}var Vf={},H=Uf(Vf),Wf=Uf(!1),Xf=Vf;function Yf(a,b){var c=a.type.contextTypes;if(!c)return Vf;var d=a.stateNode;if(d&&d.__reactInternalMemoizedUnmaskedChildContext===b)return d.__reactInternalMemoizedMaskedChildContext;var e={},f;for(f in c)e[f]=b[f];d&&(a=a.stateNode,a.__reactInternalMemoizedUnmaskedChildContext=b,a.__reactInternalMemoizedMaskedChildContext=e);return e}\nfunction Zf(a){a=a.childContextTypes;return null!==a&&void 0!==a}function $f(){E(Wf);E(H)}function ag(a,b,c){if(H.current!==Vf)throw Error(p(168));G(H,b);G(Wf,c)}function bg(a,b,c){var d=a.stateNode;b=b.childContextTypes;if(\"function\"!==typeof d.getChildContext)return c;d=d.getChildContext();for(var e in d)if(!(e in b))throw Error(p(108,Ra(a)||\"Unknown\",e));return A({},c,d)}\nfunction cg(a){a=(a=a.stateNode)&&a.__reactInternalMemoizedMergedChildContext||Vf;Xf=H.current;G(H,a);G(Wf,Wf.current);return!0}function dg(a,b,c){var d=a.stateNode;if(!d)throw Error(p(169));c?(a=bg(a,b,Xf),d.__reactInternalMemoizedMergedChildContext=a,E(Wf),E(H),G(H,a)):E(Wf);G(Wf,c)}var eg=null,fg=!1,gg=!1;function hg(a){null===eg?eg=[a]:eg.push(a)}function ig(a){fg=!0;hg(a)}\nfunction jg(){if(!gg&&null!==eg){gg=!0;var a=0,b=C;try{var c=eg;for(C=1;a<c.length;a++){var d=c[a];do d=d(!0);while(null!==d)}eg=null;fg=!1}catch(e){throw null!==eg&&(eg=eg.slice(a+1)),ac(fc,jg),e;}finally{C=b,gg=!1}}return null}var kg=[],lg=0,mg=null,ng=0,og=[],pg=0,qg=null,rg=1,sg=\"\";function tg(a,b){kg[lg++]=ng;kg[lg++]=mg;mg=a;ng=b}\nfunction ug(a,b,c){og[pg++]=rg;og[pg++]=sg;og[pg++]=qg;qg=a;var d=rg;a=sg;var e=32-oc(d)-1;d&=~(1<<e);c+=1;var f=32-oc(b)+e;if(30<f){var g=e-e%5;f=(d&(1<<g)-1).toString(32);d>>=g;e-=g;rg=1<<32-oc(b)+e|c<<e|d;sg=f+a}else rg=1<<f|c<<e|d,sg=a}function vg(a){null!==a.return&&(tg(a,1),ug(a,1,0))}function wg(a){for(;a===mg;)mg=kg[--lg],kg[lg]=null,ng=kg[--lg],kg[lg]=null;for(;a===qg;)qg=og[--pg],og[pg]=null,sg=og[--pg],og[pg]=null,rg=og[--pg],og[pg]=null}var xg=null,yg=null,I=!1,zg=null;\nfunction Ag(a,b){var c=Bg(5,null,null,0);c.elementType=\"DELETED\";c.stateNode=b;c.return=a;b=a.deletions;null===b?(a.deletions=[c],a.flags|=16):b.push(c)}\nfunction Cg(a,b){switch(a.tag){case 5:var c=a.type;b=1!==b.nodeType||c.toLowerCase()!==b.nodeName.toLowerCase()?null:b;return null!==b?(a.stateNode=b,xg=a,yg=Lf(b.firstChild),!0):!1;case 6:return b=\"\"===a.pendingProps||3!==b.nodeType?null:b,null!==b?(a.stateNode=b,xg=a,yg=null,!0):!1;case 13:return b=8!==b.nodeType?null:b,null!==b?(c=null!==qg?{id:rg,overflow:sg}:null,a.memoizedState={dehydrated:b,treeContext:c,retryLane:1073741824},c=Bg(18,null,null,0),c.stateNode=b,c.return=a,a.child=c,xg=a,yg=\nnull,!0):!1;default:return!1}}function Dg(a){return 0!==(a.mode&1)&&0===(a.flags&128)}function Eg(a){if(I){var b=yg;if(b){var c=b;if(!Cg(a,b)){if(Dg(a))throw Error(p(418));b=Lf(c.nextSibling);var d=xg;b&&Cg(a,b)?Ag(d,c):(a.flags=a.flags&-4097|2,I=!1,xg=a)}}else{if(Dg(a))throw Error(p(418));a.flags=a.flags&-4097|2;I=!1;xg=a}}}function Fg(a){for(a=a.return;null!==a&&5!==a.tag&&3!==a.tag&&13!==a.tag;)a=a.return;xg=a}\nfunction Gg(a){if(a!==xg)return!1;if(!I)return Fg(a),I=!0,!1;var b;(b=3!==a.tag)&&!(b=5!==a.tag)&&(b=a.type,b=\"head\"!==b&&\"body\"!==b&&!Ef(a.type,a.memoizedProps));if(b&&(b=yg)){if(Dg(a))throw Hg(),Error(p(418));for(;b;)Ag(a,b),b=Lf(b.nextSibling)}Fg(a);if(13===a.tag){a=a.memoizedState;a=null!==a?a.dehydrated:null;if(!a)throw Error(p(317));a:{a=a.nextSibling;for(b=0;a;){if(8===a.nodeType){var c=a.data;if(\"/$\"===c){if(0===b){yg=Lf(a.nextSibling);break a}b--}else\"$\"!==c&&\"$!\"!==c&&\"$?\"!==c||b++}a=a.nextSibling}yg=\nnull}}else yg=xg?Lf(a.stateNode.nextSibling):null;return!0}function Hg(){for(var a=yg;a;)a=Lf(a.nextSibling)}function Ig(){yg=xg=null;I=!1}function Jg(a){null===zg?zg=[a]:zg.push(a)}var Kg=ua.ReactCurrentBatchConfig;function Lg(a,b){if(a&&a.defaultProps){b=A({},b);a=a.defaultProps;for(var c in a)void 0===b[c]&&(b[c]=a[c]);return b}return b}var Mg=Uf(null),Ng=null,Og=null,Pg=null;function Qg(){Pg=Og=Ng=null}function Rg(a){var b=Mg.current;E(Mg);a._currentValue=b}\nfunction Sg(a,b,c){for(;null!==a;){var d=a.alternate;(a.childLanes&b)!==b?(a.childLanes|=b,null!==d&&(d.childLanes|=b)):null!==d&&(d.childLanes&b)!==b&&(d.childLanes|=b);if(a===c)break;a=a.return}}function Tg(a,b){Ng=a;Pg=Og=null;a=a.dependencies;null!==a&&null!==a.firstContext&&(0!==(a.lanes&b)&&(Ug=!0),a.firstContext=null)}\nfunction Vg(a){var b=a._currentValue;if(Pg!==a)if(a={context:a,memoizedValue:b,next:null},null===Og){if(null===Ng)throw Error(p(308));Og=a;Ng.dependencies={lanes:0,firstContext:a}}else Og=Og.next=a;return b}var Wg=null;function Xg(a){null===Wg?Wg=[a]:Wg.push(a)}function Yg(a,b,c,d){var e=b.interleaved;null===e?(c.next=c,Xg(b)):(c.next=e.next,e.next=c);b.interleaved=c;return Zg(a,d)}\nfunction Zg(a,b){a.lanes|=b;var c=a.alternate;null!==c&&(c.lanes|=b);c=a;for(a=a.return;null!==a;)a.childLanes|=b,c=a.alternate,null!==c&&(c.childLanes|=b),c=a,a=a.return;return 3===c.tag?c.stateNode:null}var $g=!1;function ah(a){a.updateQueue={baseState:a.memoizedState,firstBaseUpdate:null,lastBaseUpdate:null,shared:{pending:null,interleaved:null,lanes:0},effects:null}}\nfunction bh(a,b){a=a.updateQueue;b.updateQueue===a&&(b.updateQueue={baseState:a.baseState,firstBaseUpdate:a.firstBaseUpdate,lastBaseUpdate:a.lastBaseUpdate,shared:a.shared,effects:a.effects})}function ch(a,b){return{eventTime:a,lane:b,tag:0,payload:null,callback:null,next:null}}\nfunction dh(a,b,c){var d=a.updateQueue;if(null===d)return null;d=d.shared;if(0!==(K&2)){var e=d.pending;null===e?b.next=b:(b.next=e.next,e.next=b);d.pending=b;return Zg(a,c)}e=d.interleaved;null===e?(b.next=b,Xg(d)):(b.next=e.next,e.next=b);d.interleaved=b;return Zg(a,c)}function eh(a,b,c){b=b.updateQueue;if(null!==b&&(b=b.shared,0!==(c&4194240))){var d=b.lanes;d&=a.pendingLanes;c|=d;b.lanes=c;Cc(a,c)}}\nfunction fh(a,b){var c=a.updateQueue,d=a.alternate;if(null!==d&&(d=d.updateQueue,c===d)){var e=null,f=null;c=c.firstBaseUpdate;if(null!==c){do{var g={eventTime:c.eventTime,lane:c.lane,tag:c.tag,payload:c.payload,callback:c.callback,next:null};null===f?e=f=g:f=f.next=g;c=c.next}while(null!==c);null===f?e=f=b:f=f.next=b}else e=f=b;c={baseState:d.baseState,firstBaseUpdate:e,lastBaseUpdate:f,shared:d.shared,effects:d.effects};a.updateQueue=c;return}a=c.lastBaseUpdate;null===a?c.firstBaseUpdate=b:a.next=\nb;c.lastBaseUpdate=b}\nfunction gh(a,b,c,d){var e=a.updateQueue;$g=!1;var f=e.firstBaseUpdate,g=e.lastBaseUpdate,h=e.shared.pending;if(null!==h){e.shared.pending=null;var k=h,l=k.next;k.next=null;null===g?f=l:g.next=l;g=k;var m=a.alternate;null!==m&&(m=m.updateQueue,h=m.lastBaseUpdate,h!==g&&(null===h?m.firstBaseUpdate=l:h.next=l,m.lastBaseUpdate=k))}if(null!==f){var q=e.baseState;g=0;m=l=k=null;h=f;do{var r=h.lane,y=h.eventTime;if((d&r)===r){null!==m&&(m=m.next={eventTime:y,lane:0,tag:h.tag,payload:h.payload,callback:h.callback,\nnext:null});a:{var n=a,t=h;r=b;y=c;switch(t.tag){case 1:n=t.payload;if(\"function\"===typeof n){q=n.call(y,q,r);break a}q=n;break a;case 3:n.flags=n.flags&-65537|128;case 0:n=t.payload;r=\"function\"===typeof n?n.call(y,q,r):n;if(null===r||void 0===r)break a;q=A({},q,r);break a;case 2:$g=!0}}null!==h.callback&&0!==h.lane&&(a.flags|=64,r=e.effects,null===r?e.effects=[h]:r.push(h))}else y={eventTime:y,lane:r,tag:h.tag,payload:h.payload,callback:h.callback,next:null},null===m?(l=m=y,k=q):m=m.next=y,g|=r;\nh=h.next;if(null===h)if(h=e.shared.pending,null===h)break;else r=h,h=r.next,r.next=null,e.lastBaseUpdate=r,e.shared.pending=null}while(1);null===m&&(k=q);e.baseState=k;e.firstBaseUpdate=l;e.lastBaseUpdate=m;b=e.shared.interleaved;if(null!==b){e=b;do g|=e.lane,e=e.next;while(e!==b)}else null===f&&(e.shared.lanes=0);hh|=g;a.lanes=g;a.memoizedState=q}}\nfunction ih(a,b,c){a=b.effects;b.effects=null;if(null!==a)for(b=0;b<a.length;b++){var d=a[b],e=d.callback;if(null!==e){d.callback=null;d=c;if(\"function\"!==typeof e)throw Error(p(191,e));e.call(d)}}}var jh=(new aa.Component).refs;function kh(a,b,c,d){b=a.memoizedState;c=c(d,b);c=null===c||void 0===c?b:A({},b,c);a.memoizedState=c;0===a.lanes&&(a.updateQueue.baseState=c)}\nvar nh={isMounted:function(a){return(a=a._reactInternals)?Vb(a)===a:!1},enqueueSetState:function(a,b,c){a=a._reactInternals;var d=L(),e=lh(a),f=ch(d,e);f.payload=b;void 0!==c&&null!==c&&(f.callback=c);b=dh(a,f,e);null!==b&&(mh(b,a,e,d),eh(b,a,e))},enqueueReplaceState:function(a,b,c){a=a._reactInternals;var d=L(),e=lh(a),f=ch(d,e);f.tag=1;f.payload=b;void 0!==c&&null!==c&&(f.callback=c);b=dh(a,f,e);null!==b&&(mh(b,a,e,d),eh(b,a,e))},enqueueForceUpdate:function(a,b){a=a._reactInternals;var c=L(),d=\nlh(a),e=ch(c,d);e.tag=2;void 0!==b&&null!==b&&(e.callback=b);b=dh(a,e,d);null!==b&&(mh(b,a,d,c),eh(b,a,d))}};function oh(a,b,c,d,e,f,g){a=a.stateNode;return\"function\"===typeof a.shouldComponentUpdate?a.shouldComponentUpdate(d,f,g):b.prototype&&b.prototype.isPureReactComponent?!Ie(c,d)||!Ie(e,f):!0}\nfunction ph(a,b,c){var d=!1,e=Vf;var f=b.contextType;\"object\"===typeof f&&null!==f?f=Vg(f):(e=Zf(b)?Xf:H.current,d=b.contextTypes,f=(d=null!==d&&void 0!==d)?Yf(a,e):Vf);b=new b(c,f);a.memoizedState=null!==b.state&&void 0!==b.state?b.state:null;b.updater=nh;a.stateNode=b;b._reactInternals=a;d&&(a=a.stateNode,a.__reactInternalMemoizedUnmaskedChildContext=e,a.__reactInternalMemoizedMaskedChildContext=f);return b}\nfunction qh(a,b,c,d){a=b.state;\"function\"===typeof b.componentWillReceiveProps&&b.componentWillReceiveProps(c,d);\"function\"===typeof b.UNSAFE_componentWillReceiveProps&&b.UNSAFE_componentWillReceiveProps(c,d);b.state!==a&&nh.enqueueReplaceState(b,b.state,null)}\nfunction rh(a,b,c,d){var e=a.stateNode;e.props=c;e.state=a.memoizedState;e.refs=jh;ah(a);var f=b.contextType;\"object\"===typeof f&&null!==f?e.context=Vg(f):(f=Zf(b)?Xf:H.current,e.context=Yf(a,f));e.state=a.memoizedState;f=b.getDerivedStateFromProps;\"function\"===typeof f&&(kh(a,b,f,c),e.state=a.memoizedState);\"function\"===typeof b.getDerivedStateFromProps||\"function\"===typeof e.getSnapshotBeforeUpdate||\"function\"!==typeof e.UNSAFE_componentWillMount&&\"function\"!==typeof e.componentWillMount||(b=e.state,\n\"function\"===typeof e.componentWillMount&&e.componentWillMount(),\"function\"===typeof e.UNSAFE_componentWillMount&&e.UNSAFE_componentWillMount(),b!==e.state&&nh.enqueueReplaceState(e,e.state,null),gh(a,c,e,d),e.state=a.memoizedState);\"function\"===typeof e.componentDidMount&&(a.flags|=4194308)}\nfunction sh(a,b,c){a=c.ref;if(null!==a&&\"function\"!==typeof a&&\"object\"!==typeof a){if(c._owner){c=c._owner;if(c){if(1!==c.tag)throw Error(p(309));var d=c.stateNode}if(!d)throw Error(p(147,a));var e=d,f=\"\"+a;if(null!==b&&null!==b.ref&&\"function\"===typeof b.ref&&b.ref._stringRef===f)return b.ref;b=function(a){var b=e.refs;b===jh&&(b=e.refs={});null===a?delete b[f]:b[f]=a};b._stringRef=f;return b}if(\"string\"!==typeof a)throw Error(p(284));if(!c._owner)throw Error(p(290,a));}return a}\nfunction th(a,b){a=Object.prototype.toString.call(b);throw Error(p(31,\"[object Object]\"===a?\"object with keys {\"+Object.keys(b).join(\", \")+\"}\":a));}function uh(a){var b=a._init;return b(a._payload)}\nfunction vh(a){function b(b,c){if(a){var d=b.deletions;null===d?(b.deletions=[c],b.flags|=16):d.push(c)}}function c(c,d){if(!a)return null;for(;null!==d;)b(c,d),d=d.sibling;return null}function d(a,b){for(a=new Map;null!==b;)null!==b.key?a.set(b.key,b):a.set(b.index,b),b=b.sibling;return a}function e(a,b){a=wh(a,b);a.index=0;a.sibling=null;return a}function f(b,c,d){b.index=d;if(!a)return b.flags|=1048576,c;d=b.alternate;if(null!==d)return d=d.index,d<c?(b.flags|=2,c):d;b.flags|=2;return c}function g(b){a&&\nnull===b.alternate&&(b.flags|=2);return b}function h(a,b,c,d){if(null===b||6!==b.tag)return b=xh(c,a.mode,d),b.return=a,b;b=e(b,c);b.return=a;return b}function k(a,b,c,d){var f=c.type;if(f===ya)return m(a,b,c.props.children,d,c.key);if(null!==b&&(b.elementType===f||\"object\"===typeof f&&null!==f&&f.$$typeof===Ha&&uh(f)===b.type))return d=e(b,c.props),d.ref=sh(a,b,c),d.return=a,d;d=yh(c.type,c.key,c.props,null,a.mode,d);d.ref=sh(a,b,c);d.return=a;return d}function l(a,b,c,d){if(null===b||4!==b.tag||\nb.stateNode.containerInfo!==c.containerInfo||b.stateNode.implementation!==c.implementation)return b=zh(c,a.mode,d),b.return=a,b;b=e(b,c.children||[]);b.return=a;return b}function m(a,b,c,d,f){if(null===b||7!==b.tag)return b=Ah(c,a.mode,d,f),b.return=a,b;b=e(b,c);b.return=a;return b}function q(a,b,c){if(\"string\"===typeof b&&\"\"!==b||\"number\"===typeof b)return b=xh(\"\"+b,a.mode,c),b.return=a,b;if(\"object\"===typeof b&&null!==b){switch(b.$$typeof){case va:return c=yh(b.type,b.key,b.props,null,a.mode,c),\nc.ref=sh(a,null,b),c.return=a,c;case wa:return b=zh(b,a.mode,c),b.return=a,b;case Ha:var d=b._init;return q(a,d(b._payload),c)}if(eb(b)||Ka(b))return b=Ah(b,a.mode,c,null),b.return=a,b;th(a,b)}return null}function r(a,b,c,d){var e=null!==b?b.key:null;if(\"string\"===typeof c&&\"\"!==c||\"number\"===typeof c)return null!==e?null:h(a,b,\"\"+c,d);if(\"object\"===typeof c&&null!==c){switch(c.$$typeof){case va:return c.key===e?k(a,b,c,d):null;case wa:return c.key===e?l(a,b,c,d):null;case Ha:return e=c._init,r(a,\nb,e(c._payload),d)}if(eb(c)||Ka(c))return null!==e?null:m(a,b,c,d,null);th(a,c)}return null}function y(a,b,c,d,e){if(\"string\"===typeof d&&\"\"!==d||\"number\"===typeof d)return a=a.get(c)||null,h(b,a,\"\"+d,e);if(\"object\"===typeof d&&null!==d){switch(d.$$typeof){case va:return a=a.get(null===d.key?c:d.key)||null,k(b,a,d,e);case wa:return a=a.get(null===d.key?c:d.key)||null,l(b,a,d,e);case Ha:var f=d._init;return y(a,b,c,f(d._payload),e)}if(eb(d)||Ka(d))return a=a.get(c)||null,m(b,a,d,e,null);th(b,d)}return null}\nfunction n(e,g,h,k){for(var l=null,m=null,u=g,w=g=0,x=null;null!==u&&w<h.length;w++){u.index>w?(x=u,u=null):x=u.sibling;var n=r(e,u,h[w],k);if(null===n){null===u&&(u=x);break}a&&u&&null===n.alternate&&b(e,u);g=f(n,g,w);null===m?l=n:m.sibling=n;m=n;u=x}if(w===h.length)return c(e,u),I&&tg(e,w),l;if(null===u){for(;w<h.length;w++)u=q(e,h[w],k),null!==u&&(g=f(u,g,w),null===m?l=u:m.sibling=u,m=u);I&&tg(e,w);return l}for(u=d(e,u);w<h.length;w++)x=y(u,e,w,h[w],k),null!==x&&(a&&null!==x.alternate&&u.delete(null===\nx.key?w:x.key),g=f(x,g,w),null===m?l=x:m.sibling=x,m=x);a&&u.forEach(function(a){return b(e,a)});I&&tg(e,w);return l}function t(e,g,h,k){var l=Ka(h);if(\"function\"!==typeof l)throw Error(p(150));h=l.call(h);if(null==h)throw Error(p(151));for(var u=l=null,m=g,w=g=0,x=null,n=h.next();null!==m&&!n.done;w++,n=h.next()){m.index>w?(x=m,m=null):x=m.sibling;var t=r(e,m,n.value,k);if(null===t){null===m&&(m=x);break}a&&m&&null===t.alternate&&b(e,m);g=f(t,g,w);null===u?l=t:u.sibling=t;u=t;m=x}if(n.done)return c(e,\nm),I&&tg(e,w),l;if(null===m){for(;!n.done;w++,n=h.next())n=q(e,n.value,k),null!==n&&(g=f(n,g,w),null===u?l=n:u.sibling=n,u=n);I&&tg(e,w);return l}for(m=d(e,m);!n.done;w++,n=h.next())n=y(m,e,w,n.value,k),null!==n&&(a&&null!==n.alternate&&m.delete(null===n.key?w:n.key),g=f(n,g,w),null===u?l=n:u.sibling=n,u=n);a&&m.forEach(function(a){return b(e,a)});I&&tg(e,w);return l}function J(a,d,f,h){\"object\"===typeof f&&null!==f&&f.type===ya&&null===f.key&&(f=f.props.children);if(\"object\"===typeof f&&null!==f){switch(f.$$typeof){case va:a:{for(var k=\nf.key,l=d;null!==l;){if(l.key===k){k=f.type;if(k===ya){if(7===l.tag){c(a,l.sibling);d=e(l,f.props.children);d.return=a;a=d;break a}}else if(l.elementType===k||\"object\"===typeof k&&null!==k&&k.$$typeof===Ha&&uh(k)===l.type){c(a,l.sibling);d=e(l,f.props);d.ref=sh(a,l,f);d.return=a;a=d;break a}c(a,l);break}else b(a,l);l=l.sibling}f.type===ya?(d=Ah(f.props.children,a.mode,h,f.key),d.return=a,a=d):(h=yh(f.type,f.key,f.props,null,a.mode,h),h.ref=sh(a,d,f),h.return=a,a=h)}return g(a);case wa:a:{for(l=f.key;null!==\nd;){if(d.key===l)if(4===d.tag&&d.stateNode.containerInfo===f.containerInfo&&d.stateNode.implementation===f.implementation){c(a,d.sibling);d=e(d,f.children||[]);d.return=a;a=d;break a}else{c(a,d);break}else b(a,d);d=d.sibling}d=zh(f,a.mode,h);d.return=a;a=d}return g(a);case Ha:return l=f._init,J(a,d,l(f._payload),h)}if(eb(f))return n(a,d,f,h);if(Ka(f))return t(a,d,f,h);th(a,f)}return\"string\"===typeof f&&\"\"!==f||\"number\"===typeof f?(f=\"\"+f,null!==d&&6===d.tag?(c(a,d.sibling),d=e(d,f),d.return=a,a=d):\n(c(a,d),d=xh(f,a.mode,h),d.return=a,a=d),g(a)):c(a,d)}return J}var Bh=vh(!0),Ch=vh(!1),Dh={},Eh=Uf(Dh),Fh=Uf(Dh),Gh=Uf(Dh);function Hh(a){if(a===Dh)throw Error(p(174));return a}function Ih(a,b){G(Gh,b);G(Fh,a);G(Eh,Dh);a=b.nodeType;switch(a){case 9:case 11:b=(b=b.documentElement)?b.namespaceURI:lb(null,\"\");break;default:a=8===a?b.parentNode:b,b=a.namespaceURI||null,a=a.tagName,b=lb(b,a)}E(Eh);G(Eh,b)}function Jh(){E(Eh);E(Fh);E(Gh)}\nfunction Kh(a){Hh(Gh.current);var b=Hh(Eh.current);var c=lb(b,a.type);b!==c&&(G(Fh,a),G(Eh,c))}function Lh(a){Fh.current===a&&(E(Eh),E(Fh))}var M=Uf(0);\nfunction Mh(a){for(var b=a;null!==b;){if(13===b.tag){var c=b.memoizedState;if(null!==c&&(c=c.dehydrated,null===c||\"$?\"===c.data||\"$!\"===c.data))return b}else if(19===b.tag&&void 0!==b.memoizedProps.revealOrder){if(0!==(b.flags&128))return b}else if(null!==b.child){b.child.return=b;b=b.child;continue}if(b===a)break;for(;null===b.sibling;){if(null===b.return||b.return===a)return null;b=b.return}b.sibling.return=b.return;b=b.sibling}return null}var Nh=[];\nfunction Oh(){for(var a=0;a<Nh.length;a++)Nh[a]._workInProgressVersionPrimary=null;Nh.length=0}var Ph=ua.ReactCurrentDispatcher,Qh=ua.ReactCurrentBatchConfig,Rh=0,N=null,O=null,P=null,Sh=!1,Th=!1,Uh=0,Vh=0;function Q(){throw Error(p(321));}function Wh(a,b){if(null===b)return!1;for(var c=0;c<b.length&&c<a.length;c++)if(!He(a[c],b[c]))return!1;return!0}\nfunction Xh(a,b,c,d,e,f){Rh=f;N=b;b.memoizedState=null;b.updateQueue=null;b.lanes=0;Ph.current=null===a||null===a.memoizedState?Yh:Zh;a=c(d,e);if(Th){f=0;do{Th=!1;Uh=0;if(25<=f)throw Error(p(301));f+=1;P=O=null;b.updateQueue=null;Ph.current=$h;a=c(d,e)}while(Th)}Ph.current=ai;b=null!==O&&null!==O.next;Rh=0;P=O=N=null;Sh=!1;if(b)throw Error(p(300));return a}function bi(){var a=0!==Uh;Uh=0;return a}\nfunction ci(){var a={memoizedState:null,baseState:null,baseQueue:null,queue:null,next:null};null===P?N.memoizedState=P=a:P=P.next=a;return P}function di(){if(null===O){var a=N.alternate;a=null!==a?a.memoizedState:null}else a=O.next;var b=null===P?N.memoizedState:P.next;if(null!==b)P=b,O=a;else{if(null===a)throw Error(p(310));O=a;a={memoizedState:O.memoizedState,baseState:O.baseState,baseQueue:O.baseQueue,queue:O.queue,next:null};null===P?N.memoizedState=P=a:P=P.next=a}return P}\nfunction ei(a,b){return\"function\"===typeof b?b(a):b}\nfunction fi(a){var b=di(),c=b.queue;if(null===c)throw Error(p(311));c.lastRenderedReducer=a;var d=O,e=d.baseQueue,f=c.pending;if(null!==f){if(null!==e){var g=e.next;e.next=f.next;f.next=g}d.baseQueue=e=f;c.pending=null}if(null!==e){f=e.next;d=d.baseState;var h=g=null,k=null,l=f;do{var m=l.lane;if((Rh&m)===m)null!==k&&(k=k.next={lane:0,action:l.action,hasEagerState:l.hasEagerState,eagerState:l.eagerState,next:null}),d=l.hasEagerState?l.eagerState:a(d,l.action);else{var q={lane:m,action:l.action,hasEagerState:l.hasEagerState,\neagerState:l.eagerState,next:null};null===k?(h=k=q,g=d):k=k.next=q;N.lanes|=m;hh|=m}l=l.next}while(null!==l&&l!==f);null===k?g=d:k.next=h;He(d,b.memoizedState)||(Ug=!0);b.memoizedState=d;b.baseState=g;b.baseQueue=k;c.lastRenderedState=d}a=c.interleaved;if(null!==a){e=a;do f=e.lane,N.lanes|=f,hh|=f,e=e.next;while(e!==a)}else null===e&&(c.lanes=0);return[b.memoizedState,c.dispatch]}\nfunction gi(a){var b=di(),c=b.queue;if(null===c)throw Error(p(311));c.lastRenderedReducer=a;var d=c.dispatch,e=c.pending,f=b.memoizedState;if(null!==e){c.pending=null;var g=e=e.next;do f=a(f,g.action),g=g.next;while(g!==e);He(f,b.memoizedState)||(Ug=!0);b.memoizedState=f;null===b.baseQueue&&(b.baseState=f);c.lastRenderedState=f}return[f,d]}function hi(){}\nfunction ii(a,b){var c=N,d=di(),e=b(),f=!He(d.memoizedState,e);f&&(d.memoizedState=e,Ug=!0);d=d.queue;ji(ki.bind(null,c,d,a),[a]);if(d.getSnapshot!==b||f||null!==P&&P.memoizedState.tag&1){c.flags|=2048;li(9,mi.bind(null,c,d,e,b),void 0,null);if(null===R)throw Error(p(349));0!==(Rh&30)||ni(c,b,e)}return e}function ni(a,b,c){a.flags|=16384;a={getSnapshot:b,value:c};b=N.updateQueue;null===b?(b={lastEffect:null,stores:null},N.updateQueue=b,b.stores=[a]):(c=b.stores,null===c?b.stores=[a]:c.push(a))}\nfunction mi(a,b,c,d){b.value=c;b.getSnapshot=d;oi(b)&&pi(a)}function ki(a,b,c){return c(function(){oi(b)&&pi(a)})}function oi(a){var b=a.getSnapshot;a=a.value;try{var c=b();return!He(a,c)}catch(d){return!0}}function pi(a){var b=Zg(a,1);null!==b&&mh(b,a,1,-1)}\nfunction qi(a){var b=ci();\"function\"===typeof a&&(a=a());b.memoizedState=b.baseState=a;a={pending:null,interleaved:null,lanes:0,dispatch:null,lastRenderedReducer:ei,lastRenderedState:a};b.queue=a;a=a.dispatch=ri.bind(null,N,a);return[b.memoizedState,a]}\nfunction li(a,b,c,d){a={tag:a,create:b,destroy:c,deps:d,next:null};b=N.updateQueue;null===b?(b={lastEffect:null,stores:null},N.updateQueue=b,b.lastEffect=a.next=a):(c=b.lastEffect,null===c?b.lastEffect=a.next=a:(d=c.next,c.next=a,a.next=d,b.lastEffect=a));return a}function si(){return di().memoizedState}function ti(a,b,c,d){var e=ci();N.flags|=a;e.memoizedState=li(1|b,c,void 0,void 0===d?null:d)}\nfunction ui(a,b,c,d){var e=di();d=void 0===d?null:d;var f=void 0;if(null!==O){var g=O.memoizedState;f=g.destroy;if(null!==d&&Wh(d,g.deps)){e.memoizedState=li(b,c,f,d);return}}N.flags|=a;e.memoizedState=li(1|b,c,f,d)}function vi(a,b){return ti(8390656,8,a,b)}function ji(a,b){return ui(2048,8,a,b)}function wi(a,b){return ui(4,2,a,b)}function xi(a,b){return ui(4,4,a,b)}\nfunction yi(a,b){if(\"function\"===typeof b)return a=a(),b(a),function(){b(null)};if(null!==b&&void 0!==b)return a=a(),b.current=a,function(){b.current=null}}function zi(a,b,c){c=null!==c&&void 0!==c?c.concat([a]):null;return ui(4,4,yi.bind(null,b,a),c)}function Ai(){}function Bi(a,b){var c=di();b=void 0===b?null:b;var d=c.memoizedState;if(null!==d&&null!==b&&Wh(b,d[1]))return d[0];c.memoizedState=[a,b];return a}\nfunction Ci(a,b){var c=di();b=void 0===b?null:b;var d=c.memoizedState;if(null!==d&&null!==b&&Wh(b,d[1]))return d[0];a=a();c.memoizedState=[a,b];return a}function Di(a,b,c){if(0===(Rh&21))return a.baseState&&(a.baseState=!1,Ug=!0),a.memoizedState=c;He(c,b)||(c=yc(),N.lanes|=c,hh|=c,a.baseState=!0);return b}function Ei(a,b){var c=C;C=0!==c&&4>c?c:4;a(!0);var d=Qh.transition;Qh.transition={};try{a(!1),b()}finally{C=c,Qh.transition=d}}function Fi(){return di().memoizedState}\nfunction Gi(a,b,c){var d=lh(a);c={lane:d,action:c,hasEagerState:!1,eagerState:null,next:null};if(Hi(a))Ii(b,c);else if(c=Yg(a,b,c,d),null!==c){var e=L();mh(c,a,d,e);Ji(c,b,d)}}\nfunction ri(a,b,c){var d=lh(a),e={lane:d,action:c,hasEagerState:!1,eagerState:null,next:null};if(Hi(a))Ii(b,e);else{var f=a.alternate;if(0===a.lanes&&(null===f||0===f.lanes)&&(f=b.lastRenderedReducer,null!==f))try{var g=b.lastRenderedState,h=f(g,c);e.hasEagerState=!0;e.eagerState=h;if(He(h,g)){var k=b.interleaved;null===k?(e.next=e,Xg(b)):(e.next=k.next,k.next=e);b.interleaved=e;return}}catch(l){}finally{}c=Yg(a,b,e,d);null!==c&&(e=L(),mh(c,a,d,e),Ji(c,b,d))}}\nfunction Hi(a){var b=a.alternate;return a===N||null!==b&&b===N}function Ii(a,b){Th=Sh=!0;var c=a.pending;null===c?b.next=b:(b.next=c.next,c.next=b);a.pending=b}function Ji(a,b,c){if(0!==(c&4194240)){var d=b.lanes;d&=a.pendingLanes;c|=d;b.lanes=c;Cc(a,c)}}\nvar ai={readContext:Vg,useCallback:Q,useContext:Q,useEffect:Q,useImperativeHandle:Q,useInsertionEffect:Q,useLayoutEffect:Q,useMemo:Q,useReducer:Q,useRef:Q,useState:Q,useDebugValue:Q,useDeferredValue:Q,useTransition:Q,useMutableSource:Q,useSyncExternalStore:Q,useId:Q,unstable_isNewReconciler:!1},Yh={readContext:Vg,useCallback:function(a,b){ci().memoizedState=[a,void 0===b?null:b];return a},useContext:Vg,useEffect:vi,useImperativeHandle:function(a,b,c){c=null!==c&&void 0!==c?c.concat([a]):null;return ti(4194308,\n4,yi.bind(null,b,a),c)},useLayoutEffect:function(a,b){return ti(4194308,4,a,b)},useInsertionEffect:function(a,b){return ti(4,2,a,b)},useMemo:function(a,b){var c=ci();b=void 0===b?null:b;a=a();c.memoizedState=[a,b];return a},useReducer:function(a,b,c){var d=ci();b=void 0!==c?c(b):b;d.memoizedState=d.baseState=b;a={pending:null,interleaved:null,lanes:0,dispatch:null,lastRenderedReducer:a,lastRenderedState:b};d.queue=a;a=a.dispatch=Gi.bind(null,N,a);return[d.memoizedState,a]},useRef:function(a){var b=\nci();a={current:a};return b.memoizedState=a},useState:qi,useDebugValue:Ai,useDeferredValue:function(a){return ci().memoizedState=a},useTransition:function(){var a=qi(!1),b=a[0];a=Ei.bind(null,a[1]);ci().memoizedState=a;return[b,a]},useMutableSource:function(){},useSyncExternalStore:function(a,b,c){var d=N,e=ci();if(I){if(void 0===c)throw Error(p(407));c=c()}else{c=b();if(null===R)throw Error(p(349));0!==(Rh&30)||ni(d,b,c)}e.memoizedState=c;var f={value:c,getSnapshot:b};e.queue=f;vi(ki.bind(null,d,\nf,a),[a]);d.flags|=2048;li(9,mi.bind(null,d,f,c,b),void 0,null);return c},useId:function(){var a=ci(),b=R.identifierPrefix;if(I){var c=sg;var d=rg;c=(d&~(1<<32-oc(d)-1)).toString(32)+c;b=\":\"+b+\"R\"+c;c=Uh++;0<c&&(b+=\"H\"+c.toString(32));b+=\":\"}else c=Vh++,b=\":\"+b+\"r\"+c.toString(32)+\":\";return a.memoizedState=b},unstable_isNewReconciler:!1},Zh={readContext:Vg,useCallback:Bi,useContext:Vg,useEffect:ji,useImperativeHandle:zi,useInsertionEffect:wi,useLayoutEffect:xi,useMemo:Ci,useReducer:fi,useRef:si,useState:function(){return fi(ei)},\nuseDebugValue:Ai,useDeferredValue:function(a){var b=di();return Di(b,O.memoizedState,a)},useTransition:function(){var a=fi(ei)[0],b=di().memoizedState;return[a,b]},useMutableSource:hi,useSyncExternalStore:ii,useId:Fi,unstable_isNewReconciler:!1},$h={readContext:Vg,useCallback:Bi,useContext:Vg,useEffect:ji,useImperativeHandle:zi,useInsertionEffect:wi,useLayoutEffect:xi,useMemo:Ci,useReducer:gi,useRef:si,useState:function(){return gi(ei)},useDebugValue:Ai,useDeferredValue:function(a){var b=di();return null===\nO?b.memoizedState=a:Di(b,O.memoizedState,a)},useTransition:function(){var a=gi(ei)[0],b=di().memoizedState;return[a,b]},useMutableSource:hi,useSyncExternalStore:ii,useId:Fi,unstable_isNewReconciler:!1};function Ki(a,b){try{var c=\"\",d=b;do c+=Pa(d),d=d.return;while(d);var e=c}catch(f){e=\"\\nError generating stack: \"+f.message+\"\\n\"+f.stack}return{value:a,source:b,stack:e,digest:null}}function Li(a,b,c){return{value:a,source:null,stack:null!=c?c:null,digest:null!=b?b:null}}\nfunction Mi(a,b){try{console.error(b.value)}catch(c){setTimeout(function(){throw c;})}}var Ni=\"function\"===typeof WeakMap?WeakMap:Map;function Oi(a,b,c){c=ch(-1,c);c.tag=3;c.payload={element:null};var d=b.value;c.callback=function(){Pi||(Pi=!0,Qi=d);Mi(a,b)};return c}\nfunction Ri(a,b,c){c=ch(-1,c);c.tag=3;var d=a.type.getDerivedStateFromError;if(\"function\"===typeof d){var e=b.value;c.payload=function(){return d(e)};c.callback=function(){Mi(a,b)}}var f=a.stateNode;null!==f&&\"function\"===typeof f.componentDidCatch&&(c.callback=function(){Mi(a,b);\"function\"!==typeof d&&(null===Si?Si=new Set([this]):Si.add(this));var c=b.stack;this.componentDidCatch(b.value,{componentStack:null!==c?c:\"\"})});return c}\nfunction Ti(a,b,c){var d=a.pingCache;if(null===d){d=a.pingCache=new Ni;var e=new Set;d.set(b,e)}else e=d.get(b),void 0===e&&(e=new Set,d.set(b,e));e.has(c)||(e.add(c),a=Ui.bind(null,a,b,c),b.then(a,a))}function Vi(a){do{var b;if(b=13===a.tag)b=a.memoizedState,b=null!==b?null!==b.dehydrated?!0:!1:!0;if(b)return a;a=a.return}while(null!==a);return null}\nfunction Wi(a,b,c,d,e){if(0===(a.mode&1))return a===b?a.flags|=65536:(a.flags|=128,c.flags|=131072,c.flags&=-52805,1===c.tag&&(null===c.alternate?c.tag=17:(b=ch(-1,1),b.tag=2,dh(c,b,1))),c.lanes|=1),a;a.flags|=65536;a.lanes=e;return a}var Xi=ua.ReactCurrentOwner,Ug=!1;function Yi(a,b,c,d){b.child=null===a?Ch(b,null,c,d):Bh(b,a.child,c,d)}\nfunction Zi(a,b,c,d,e){c=c.render;var f=b.ref;Tg(b,e);d=Xh(a,b,c,d,f,e);c=bi();if(null!==a&&!Ug)return b.updateQueue=a.updateQueue,b.flags&=-2053,a.lanes&=~e,$i(a,b,e);I&&c&&vg(b);b.flags|=1;Yi(a,b,d,e);return b.child}\nfunction aj(a,b,c,d,e){if(null===a){var f=c.type;if(\"function\"===typeof f&&!bj(f)&&void 0===f.defaultProps&&null===c.compare&&void 0===c.defaultProps)return b.tag=15,b.type=f,cj(a,b,f,d,e);a=yh(c.type,null,d,b,b.mode,e);a.ref=b.ref;a.return=b;return b.child=a}f=a.child;if(0===(a.lanes&e)){var g=f.memoizedProps;c=c.compare;c=null!==c?c:Ie;if(c(g,d)&&a.ref===b.ref)return $i(a,b,e)}b.flags|=1;a=wh(f,d);a.ref=b.ref;a.return=b;return b.child=a}\nfunction cj(a,b,c,d,e){if(null!==a){var f=a.memoizedProps;if(Ie(f,d)&&a.ref===b.ref)if(Ug=!1,b.pendingProps=d=f,0!==(a.lanes&e))0!==(a.flags&131072)&&(Ug=!0);else return b.lanes=a.lanes,$i(a,b,e)}return dj(a,b,c,d,e)}\nfunction ej(a,b,c){var d=b.pendingProps,e=d.children,f=null!==a?a.memoizedState:null;if(\"hidden\"===d.mode)if(0===(b.mode&1))b.memoizedState={baseLanes:0,cachePool:null,transitions:null},G(fj,gj),gj|=c;else{if(0===(c&1073741824))return a=null!==f?f.baseLanes|c:c,b.lanes=b.childLanes=1073741824,b.memoizedState={baseLanes:a,cachePool:null,transitions:null},b.updateQueue=null,G(fj,gj),gj|=a,null;b.memoizedState={baseLanes:0,cachePool:null,transitions:null};d=null!==f?f.baseLanes:c;G(fj,gj);gj|=d}else null!==\nf?(d=f.baseLanes|c,b.memoizedState=null):d=c,G(fj,gj),gj|=d;Yi(a,b,e,c);return b.child}function hj(a,b){var c=b.ref;if(null===a&&null!==c||null!==a&&a.ref!==c)b.flags|=512,b.flags|=2097152}function dj(a,b,c,d,e){var f=Zf(c)?Xf:H.current;f=Yf(b,f);Tg(b,e);c=Xh(a,b,c,d,f,e);d=bi();if(null!==a&&!Ug)return b.updateQueue=a.updateQueue,b.flags&=-2053,a.lanes&=~e,$i(a,b,e);I&&d&&vg(b);b.flags|=1;Yi(a,b,c,e);return b.child}\nfunction ij(a,b,c,d,e){if(Zf(c)){var f=!0;cg(b)}else f=!1;Tg(b,e);if(null===b.stateNode)jj(a,b),ph(b,c,d),rh(b,c,d,e),d=!0;else if(null===a){var g=b.stateNode,h=b.memoizedProps;g.props=h;var k=g.context,l=c.contextType;\"object\"===typeof l&&null!==l?l=Vg(l):(l=Zf(c)?Xf:H.current,l=Yf(b,l));var m=c.getDerivedStateFromProps,q=\"function\"===typeof m||\"function\"===typeof g.getSnapshotBeforeUpdate;q||\"function\"!==typeof g.UNSAFE_componentWillReceiveProps&&\"function\"!==typeof g.componentWillReceiveProps||\n(h!==d||k!==l)&&qh(b,g,d,l);$g=!1;var r=b.memoizedState;g.state=r;gh(b,d,g,e);k=b.memoizedState;h!==d||r!==k||Wf.current||$g?(\"function\"===typeof m&&(kh(b,c,m,d),k=b.memoizedState),(h=$g||oh(b,c,h,d,r,k,l))?(q||\"function\"!==typeof g.UNSAFE_componentWillMount&&\"function\"!==typeof g.componentWillMount||(\"function\"===typeof g.componentWillMount&&g.componentWillMount(),\"function\"===typeof g.UNSAFE_componentWillMount&&g.UNSAFE_componentWillMount()),\"function\"===typeof g.componentDidMount&&(b.flags|=4194308)):\n(\"function\"===typeof g.componentDidMount&&(b.flags|=4194308),b.memoizedProps=d,b.memoizedState=k),g.props=d,g.state=k,g.context=l,d=h):(\"function\"===typeof g.componentDidMount&&(b.flags|=4194308),d=!1)}else{g=b.stateNode;bh(a,b);h=b.memoizedProps;l=b.type===b.elementType?h:Lg(b.type,h);g.props=l;q=b.pendingProps;r=g.context;k=c.contextType;\"object\"===typeof k&&null!==k?k=Vg(k):(k=Zf(c)?Xf:H.current,k=Yf(b,k));var y=c.getDerivedStateFromProps;(m=\"function\"===typeof y||\"function\"===typeof g.getSnapshotBeforeUpdate)||\n\"function\"!==typeof g.UNSAFE_componentWillReceiveProps&&\"function\"!==typeof g.componentWillReceiveProps||(h!==q||r!==k)&&qh(b,g,d,k);$g=!1;r=b.memoizedState;g.state=r;gh(b,d,g,e);var n=b.memoizedState;h!==q||r!==n||Wf.current||$g?(\"function\"===typeof y&&(kh(b,c,y,d),n=b.memoizedState),(l=$g||oh(b,c,l,d,r,n,k)||!1)?(m||\"function\"!==typeof g.UNSAFE_componentWillUpdate&&\"function\"!==typeof g.componentWillUpdate||(\"function\"===typeof g.componentWillUpdate&&g.componentWillUpdate(d,n,k),\"function\"===typeof g.UNSAFE_componentWillUpdate&&\ng.UNSAFE_componentWillUpdate(d,n,k)),\"function\"===typeof g.componentDidUpdate&&(b.flags|=4),\"function\"===typeof g.getSnapshotBeforeUpdate&&(b.flags|=1024)):(\"function\"!==typeof g.componentDidUpdate||h===a.memoizedProps&&r===a.memoizedState||(b.flags|=4),\"function\"!==typeof g.getSnapshotBeforeUpdate||h===a.memoizedProps&&r===a.memoizedState||(b.flags|=1024),b.memoizedProps=d,b.memoizedState=n),g.props=d,g.state=n,g.context=k,d=l):(\"function\"!==typeof g.componentDidUpdate||h===a.memoizedProps&&r===\na.memoizedState||(b.flags|=4),\"function\"!==typeof g.getSnapshotBeforeUpdate||h===a.memoizedProps&&r===a.memoizedState||(b.flags|=1024),d=!1)}return kj(a,b,c,d,f,e)}\nfunction kj(a,b,c,d,e,f){hj(a,b);var g=0!==(b.flags&128);if(!d&&!g)return e&&dg(b,c,!1),$i(a,b,f);d=b.stateNode;Xi.current=b;var h=g&&\"function\"!==typeof c.getDerivedStateFromError?null:d.render();b.flags|=1;null!==a&&g?(b.child=Bh(b,a.child,null,f),b.child=Bh(b,null,h,f)):Yi(a,b,h,f);b.memoizedState=d.state;e&&dg(b,c,!0);return b.child}function lj(a){var b=a.stateNode;b.pendingContext?ag(a,b.pendingContext,b.pendingContext!==b.context):b.context&&ag(a,b.context,!1);Ih(a,b.containerInfo)}\nfunction mj(a,b,c,d,e){Ig();Jg(e);b.flags|=256;Yi(a,b,c,d);return b.child}var nj={dehydrated:null,treeContext:null,retryLane:0};function oj(a){return{baseLanes:a,cachePool:null,transitions:null}}\nfunction pj(a,b,c){var d=b.pendingProps,e=M.current,f=!1,g=0!==(b.flags&128),h;(h=g)||(h=null!==a&&null===a.memoizedState?!1:0!==(e&2));if(h)f=!0,b.flags&=-129;else if(null===a||null!==a.memoizedState)e|=1;G(M,e&1);if(null===a){Eg(b);a=b.memoizedState;if(null!==a&&(a=a.dehydrated,null!==a))return 0===(b.mode&1)?b.lanes=1:\"$!\"===a.data?b.lanes=8:b.lanes=1073741824,null;g=d.children;a=d.fallback;return f?(d=b.mode,f=b.child,g={mode:\"hidden\",children:g},0===(d&1)&&null!==f?(f.childLanes=0,f.pendingProps=\ng):f=qj(g,d,0,null),a=Ah(a,d,c,null),f.return=b,a.return=b,f.sibling=a,b.child=f,b.child.memoizedState=oj(c),b.memoizedState=nj,a):rj(b,g)}e=a.memoizedState;if(null!==e&&(h=e.dehydrated,null!==h))return sj(a,b,g,d,h,e,c);if(f){f=d.fallback;g=b.mode;e=a.child;h=e.sibling;var k={mode:\"hidden\",children:d.children};0===(g&1)&&b.child!==e?(d=b.child,d.childLanes=0,d.pendingProps=k,b.deletions=null):(d=wh(e,k),d.subtreeFlags=e.subtreeFlags&14680064);null!==h?f=wh(h,f):(f=Ah(f,g,c,null),f.flags|=2);f.return=\nb;d.return=b;d.sibling=f;b.child=d;d=f;f=b.child;g=a.child.memoizedState;g=null===g?oj(c):{baseLanes:g.baseLanes|c,cachePool:null,transitions:g.transitions};f.memoizedState=g;f.childLanes=a.childLanes&~c;b.memoizedState=nj;return d}f=a.child;a=f.sibling;d=wh(f,{mode:\"visible\",children:d.children});0===(b.mode&1)&&(d.lanes=c);d.return=b;d.sibling=null;null!==a&&(c=b.deletions,null===c?(b.deletions=[a],b.flags|=16):c.push(a));b.child=d;b.memoizedState=null;return d}\nfunction rj(a,b){b=qj({mode:\"visible\",children:b},a.mode,0,null);b.return=a;return a.child=b}function tj(a,b,c,d){null!==d&&Jg(d);Bh(b,a.child,null,c);a=rj(b,b.pendingProps.children);a.flags|=2;b.memoizedState=null;return a}\nfunction sj(a,b,c,d,e,f,g){if(c){if(b.flags&256)return b.flags&=-257,d=Li(Error(p(422))),tj(a,b,g,d);if(null!==b.memoizedState)return b.child=a.child,b.flags|=128,null;f=d.fallback;e=b.mode;d=qj({mode:\"visible\",children:d.children},e,0,null);f=Ah(f,e,g,null);f.flags|=2;d.return=b;f.return=b;d.sibling=f;b.child=d;0!==(b.mode&1)&&Bh(b,a.child,null,g);b.child.memoizedState=oj(g);b.memoizedState=nj;return f}if(0===(b.mode&1))return tj(a,b,g,null);if(\"$!\"===e.data){d=e.nextSibling&&e.nextSibling.dataset;\nif(d)var h=d.dgst;d=h;f=Error(p(419));d=Li(f,d,void 0);return tj(a,b,g,d)}h=0!==(g&a.childLanes);if(Ug||h){d=R;if(null!==d){switch(g&-g){case 4:e=2;break;case 16:e=8;break;case 64:case 128:case 256:case 512:case 1024:case 2048:case 4096:case 8192:case 16384:case 32768:case 65536:case 131072:case 262144:case 524288:case 1048576:case 2097152:case 4194304:case 8388608:case 16777216:case 33554432:case 67108864:e=32;break;case 536870912:e=268435456;break;default:e=0}e=0!==(e&(d.suspendedLanes|g))?0:e;\n0!==e&&e!==f.retryLane&&(f.retryLane=e,Zg(a,e),mh(d,a,e,-1))}uj();d=Li(Error(p(421)));return tj(a,b,g,d)}if(\"$?\"===e.data)return b.flags|=128,b.child=a.child,b=vj.bind(null,a),e._reactRetry=b,null;a=f.treeContext;yg=Lf(e.nextSibling);xg=b;I=!0;zg=null;null!==a&&(og[pg++]=rg,og[pg++]=sg,og[pg++]=qg,rg=a.id,sg=a.overflow,qg=b);b=rj(b,d.children);b.flags|=4096;return b}function wj(a,b,c){a.lanes|=b;var d=a.alternate;null!==d&&(d.lanes|=b);Sg(a.return,b,c)}\nfunction xj(a,b,c,d,e){var f=a.memoizedState;null===f?a.memoizedState={isBackwards:b,rendering:null,renderingStartTime:0,last:d,tail:c,tailMode:e}:(f.isBackwards=b,f.rendering=null,f.renderingStartTime=0,f.last=d,f.tail=c,f.tailMode=e)}\nfunction yj(a,b,c){var d=b.pendingProps,e=d.revealOrder,f=d.tail;Yi(a,b,d.children,c);d=M.current;if(0!==(d&2))d=d&1|2,b.flags|=128;else{if(null!==a&&0!==(a.flags&128))a:for(a=b.child;null!==a;){if(13===a.tag)null!==a.memoizedState&&wj(a,c,b);else if(19===a.tag)wj(a,c,b);else if(null!==a.child){a.child.return=a;a=a.child;continue}if(a===b)break a;for(;null===a.sibling;){if(null===a.return||a.return===b)break a;a=a.return}a.sibling.return=a.return;a=a.sibling}d&=1}G(M,d);if(0===(b.mode&1))b.memoizedState=\nnull;else switch(e){case \"forwards\":c=b.child;for(e=null;null!==c;)a=c.alternate,null!==a&&null===Mh(a)&&(e=c),c=c.sibling;c=e;null===c?(e=b.child,b.child=null):(e=c.sibling,c.sibling=null);xj(b,!1,e,c,f);break;case \"backwards\":c=null;e=b.child;for(b.child=null;null!==e;){a=e.alternate;if(null!==a&&null===Mh(a)){b.child=e;break}a=e.sibling;e.sibling=c;c=e;e=a}xj(b,!0,c,null,f);break;case \"together\":xj(b,!1,null,null,void 0);break;default:b.memoizedState=null}return b.child}\nfunction jj(a,b){0===(b.mode&1)&&null!==a&&(a.alternate=null,b.alternate=null,b.flags|=2)}function $i(a,b,c){null!==a&&(b.dependencies=a.dependencies);hh|=b.lanes;if(0===(c&b.childLanes))return null;if(null!==a&&b.child!==a.child)throw Error(p(153));if(null!==b.child){a=b.child;c=wh(a,a.pendingProps);b.child=c;for(c.return=b;null!==a.sibling;)a=a.sibling,c=c.sibling=wh(a,a.pendingProps),c.return=b;c.sibling=null}return b.child}\nfunction zj(a,b,c){switch(b.tag){case 3:lj(b);Ig();break;case 5:Kh(b);break;case 1:Zf(b.type)&&cg(b);break;case 4:Ih(b,b.stateNode.containerInfo);break;case 10:var d=b.type._context,e=b.memoizedProps.value;G(Mg,d._currentValue);d._currentValue=e;break;case 13:d=b.memoizedState;if(null!==d){if(null!==d.dehydrated)return G(M,M.current&1),b.flags|=128,null;if(0!==(c&b.child.childLanes))return pj(a,b,c);G(M,M.current&1);a=$i(a,b,c);return null!==a?a.sibling:null}G(M,M.current&1);break;case 19:d=0!==(c&\nb.childLanes);if(0!==(a.flags&128)){if(d)return yj(a,b,c);b.flags|=128}e=b.memoizedState;null!==e&&(e.rendering=null,e.tail=null,e.lastEffect=null);G(M,M.current);if(d)break;else return null;case 22:case 23:return b.lanes=0,ej(a,b,c)}return $i(a,b,c)}var Aj,Bj,Cj,Dj;\nAj=function(a,b){for(var c=b.child;null!==c;){if(5===c.tag||6===c.tag)a.appendChild(c.stateNode);else if(4!==c.tag&&null!==c.child){c.child.return=c;c=c.child;continue}if(c===b)break;for(;null===c.sibling;){if(null===c.return||c.return===b)return;c=c.return}c.sibling.return=c.return;c=c.sibling}};Bj=function(){};\nCj=function(a,b,c,d){var e=a.memoizedProps;if(e!==d){a=b.stateNode;Hh(Eh.current);var f=null;switch(c){case \"input\":e=Ya(a,e);d=Ya(a,d);f=[];break;case \"select\":e=A({},e,{value:void 0});d=A({},d,{value:void 0});f=[];break;case \"textarea\":e=gb(a,e);d=gb(a,d);f=[];break;default:\"function\"!==typeof e.onClick&&\"function\"===typeof d.onClick&&(a.onclick=Bf)}ub(c,d);var g;c=null;for(l in e)if(!d.hasOwnProperty(l)&&e.hasOwnProperty(l)&&null!=e[l])if(\"style\"===l){var h=e[l];for(g in h)h.hasOwnProperty(g)&&\n(c||(c={}),c[g]=\"\")}else\"dangerouslySetInnerHTML\"!==l&&\"children\"!==l&&\"suppressContentEditableWarning\"!==l&&\"suppressHydrationWarning\"!==l&&\"autoFocus\"!==l&&(ea.hasOwnProperty(l)?f||(f=[]):(f=f||[]).push(l,null));for(l in d){var k=d[l];h=null!=e?e[l]:void 0;if(d.hasOwnProperty(l)&&k!==h&&(null!=k||null!=h))if(\"style\"===l)if(h){for(g in h)!h.hasOwnProperty(g)||k&&k.hasOwnProperty(g)||(c||(c={}),c[g]=\"\");for(g in k)k.hasOwnProperty(g)&&h[g]!==k[g]&&(c||(c={}),c[g]=k[g])}else c||(f||(f=[]),f.push(l,\nc)),c=k;else\"dangerouslySetInnerHTML\"===l?(k=k?k.__html:void 0,h=h?h.__html:void 0,null!=k&&h!==k&&(f=f||[]).push(l,k)):\"children\"===l?\"string\"!==typeof k&&\"number\"!==typeof k||(f=f||[]).push(l,\"\"+k):\"suppressContentEditableWarning\"!==l&&\"suppressHydrationWarning\"!==l&&(ea.hasOwnProperty(l)?(null!=k&&\"onScroll\"===l&&D(\"scroll\",a),f||h===k||(f=[])):(f=f||[]).push(l,k))}c&&(f=f||[]).push(\"style\",c);var l=f;if(b.updateQueue=l)b.flags|=4}};Dj=function(a,b,c,d){c!==d&&(b.flags|=4)};\nfunction Ej(a,b){if(!I)switch(a.tailMode){case \"hidden\":b=a.tail;for(var c=null;null!==b;)null!==b.alternate&&(c=b),b=b.sibling;null===c?a.tail=null:c.sibling=null;break;case \"collapsed\":c=a.tail;for(var d=null;null!==c;)null!==c.alternate&&(d=c),c=c.sibling;null===d?b||null===a.tail?a.tail=null:a.tail.sibling=null:d.sibling=null}}\nfunction S(a){var b=null!==a.alternate&&a.alternate.child===a.child,c=0,d=0;if(b)for(var e=a.child;null!==e;)c|=e.lanes|e.childLanes,d|=e.subtreeFlags&14680064,d|=e.flags&14680064,e.return=a,e=e.sibling;else for(e=a.child;null!==e;)c|=e.lanes|e.childLanes,d|=e.subtreeFlags,d|=e.flags,e.return=a,e=e.sibling;a.subtreeFlags|=d;a.childLanes=c;return b}\nfunction Fj(a,b,c){var d=b.pendingProps;wg(b);switch(b.tag){case 2:case 16:case 15:case 0:case 11:case 7:case 8:case 12:case 9:case 14:return S(b),null;case 1:return Zf(b.type)&&$f(),S(b),null;case 3:d=b.stateNode;Jh();E(Wf);E(H);Oh();d.pendingContext&&(d.context=d.pendingContext,d.pendingContext=null);if(null===a||null===a.child)Gg(b)?b.flags|=4:null===a||a.memoizedState.isDehydrated&&0===(b.flags&256)||(b.flags|=1024,null!==zg&&(Gj(zg),zg=null));Bj(a,b);S(b);return null;case 5:Lh(b);var e=Hh(Gh.current);\nc=b.type;if(null!==a&&null!=b.stateNode)Cj(a,b,c,d,e),a.ref!==b.ref&&(b.flags|=512,b.flags|=2097152);else{if(!d){if(null===b.stateNode)throw Error(p(166));S(b);return null}a=Hh(Eh.current);if(Gg(b)){d=b.stateNode;c=b.type;var f=b.memoizedProps;d[Of]=b;d[Pf]=f;a=0!==(b.mode&1);switch(c){case \"dialog\":D(\"cancel\",d);D(\"close\",d);break;case \"iframe\":case \"object\":case \"embed\":D(\"load\",d);break;case \"video\":case \"audio\":for(e=0;e<lf.length;e++)D(lf[e],d);break;case \"source\":D(\"error\",d);break;case \"img\":case \"image\":case \"link\":D(\"error\",\nd);D(\"load\",d);break;case \"details\":D(\"toggle\",d);break;case \"input\":Za(d,f);D(\"invalid\",d);break;case \"select\":d._wrapperState={wasMultiple:!!f.multiple};D(\"invalid\",d);break;case \"textarea\":hb(d,f),D(\"invalid\",d)}ub(c,f);e=null;for(var g in f)if(f.hasOwnProperty(g)){var h=f[g];\"children\"===g?\"string\"===typeof h?d.textContent!==h&&(!0!==f.suppressHydrationWarning&&Af(d.textContent,h,a),e=[\"children\",h]):\"number\"===typeof h&&d.textContent!==\"\"+h&&(!0!==f.suppressHydrationWarning&&Af(d.textContent,\nh,a),e=[\"children\",\"\"+h]):ea.hasOwnProperty(g)&&null!=h&&\"onScroll\"===g&&D(\"scroll\",d)}switch(c){case \"input\":Va(d);db(d,f,!0);break;case \"textarea\":Va(d);jb(d);break;case \"select\":case \"option\":break;default:\"function\"===typeof f.onClick&&(d.onclick=Bf)}d=e;b.updateQueue=d;null!==d&&(b.flags|=4)}else{g=9===e.nodeType?e:e.ownerDocument;\"http://www.w3.org/1999/xhtml\"===a&&(a=kb(c));\"http://www.w3.org/1999/xhtml\"===a?\"script\"===c?(a=g.createElement(\"div\"),a.innerHTML=\"<script>\\x3c/script>\",a=a.removeChild(a.firstChild)):\n\"string\"===typeof d.is?a=g.createElement(c,{is:d.is}):(a=g.createElement(c),\"select\"===c&&(g=a,d.multiple?g.multiple=!0:d.size&&(g.size=d.size))):a=g.createElementNS(a,c);a[Of]=b;a[Pf]=d;Aj(a,b,!1,!1);b.stateNode=a;a:{g=vb(c,d);switch(c){case \"dialog\":D(\"cancel\",a);D(\"close\",a);e=d;break;case \"iframe\":case \"object\":case \"embed\":D(\"load\",a);e=d;break;case \"video\":case \"audio\":for(e=0;e<lf.length;e++)D(lf[e],a);e=d;break;case \"source\":D(\"error\",a);e=d;break;case \"img\":case \"image\":case \"link\":D(\"error\",\na);D(\"load\",a);e=d;break;case \"details\":D(\"toggle\",a);e=d;break;case \"input\":Za(a,d);e=Ya(a,d);D(\"invalid\",a);break;case \"option\":e=d;break;case \"select\":a._wrapperState={wasMultiple:!!d.multiple};e=A({},d,{value:void 0});D(\"invalid\",a);break;case \"textarea\":hb(a,d);e=gb(a,d);D(\"invalid\",a);break;default:e=d}ub(c,e);h=e;for(f in h)if(h.hasOwnProperty(f)){var k=h[f];\"style\"===f?sb(a,k):\"dangerouslySetInnerHTML\"===f?(k=k?k.__html:void 0,null!=k&&nb(a,k)):\"children\"===f?\"string\"===typeof k?(\"textarea\"!==\nc||\"\"!==k)&&ob(a,k):\"number\"===typeof k&&ob(a,\"\"+k):\"suppressContentEditableWarning\"!==f&&\"suppressHydrationWarning\"!==f&&\"autoFocus\"!==f&&(ea.hasOwnProperty(f)?null!=k&&\"onScroll\"===f&&D(\"scroll\",a):null!=k&&ta(a,f,k,g))}switch(c){case \"input\":Va(a);db(a,d,!1);break;case \"textarea\":Va(a);jb(a);break;case \"option\":null!=d.value&&a.setAttribute(\"value\",\"\"+Sa(d.value));break;case \"select\":a.multiple=!!d.multiple;f=d.value;null!=f?fb(a,!!d.multiple,f,!1):null!=d.defaultValue&&fb(a,!!d.multiple,d.defaultValue,\n!0);break;default:\"function\"===typeof e.onClick&&(a.onclick=Bf)}switch(c){case \"button\":case \"input\":case \"select\":case \"textarea\":d=!!d.autoFocus;break a;case \"img\":d=!0;break a;default:d=!1}}d&&(b.flags|=4)}null!==b.ref&&(b.flags|=512,b.flags|=2097152)}S(b);return null;case 6:if(a&&null!=b.stateNode)Dj(a,b,a.memoizedProps,d);else{if(\"string\"!==typeof d&&null===b.stateNode)throw Error(p(166));c=Hh(Gh.current);Hh(Eh.current);if(Gg(b)){d=b.stateNode;c=b.memoizedProps;d[Of]=b;if(f=d.nodeValue!==c)if(a=\nxg,null!==a)switch(a.tag){case 3:Af(d.nodeValue,c,0!==(a.mode&1));break;case 5:!0!==a.memoizedProps.suppressHydrationWarning&&Af(d.nodeValue,c,0!==(a.mode&1))}f&&(b.flags|=4)}else d=(9===c.nodeType?c:c.ownerDocument).createTextNode(d),d[Of]=b,b.stateNode=d}S(b);return null;case 13:E(M);d=b.memoizedState;if(null===a||null!==a.memoizedState&&null!==a.memoizedState.dehydrated){if(I&&null!==yg&&0!==(b.mode&1)&&0===(b.flags&128))Hg(),Ig(),b.flags|=98560,f=!1;else if(f=Gg(b),null!==d&&null!==d.dehydrated){if(null===\na){if(!f)throw Error(p(318));f=b.memoizedState;f=null!==f?f.dehydrated:null;if(!f)throw Error(p(317));f[Of]=b}else Ig(),0===(b.flags&128)&&(b.memoizedState=null),b.flags|=4;S(b);f=!1}else null!==zg&&(Gj(zg),zg=null),f=!0;if(!f)return b.flags&65536?b:null}if(0!==(b.flags&128))return b.lanes=c,b;d=null!==d;d!==(null!==a&&null!==a.memoizedState)&&d&&(b.child.flags|=8192,0!==(b.mode&1)&&(null===a||0!==(M.current&1)?0===T&&(T=3):uj()));null!==b.updateQueue&&(b.flags|=4);S(b);return null;case 4:return Jh(),\nBj(a,b),null===a&&sf(b.stateNode.containerInfo),S(b),null;case 10:return Rg(b.type._context),S(b),null;case 17:return Zf(b.type)&&$f(),S(b),null;case 19:E(M);f=b.memoizedState;if(null===f)return S(b),null;d=0!==(b.flags&128);g=f.rendering;if(null===g)if(d)Ej(f,!1);else{if(0!==T||null!==a&&0!==(a.flags&128))for(a=b.child;null!==a;){g=Mh(a);if(null!==g){b.flags|=128;Ej(f,!1);d=g.updateQueue;null!==d&&(b.updateQueue=d,b.flags|=4);b.subtreeFlags=0;d=c;for(c=b.child;null!==c;)f=c,a=d,f.flags&=14680066,\ng=f.alternate,null===g?(f.childLanes=0,f.lanes=a,f.child=null,f.subtreeFlags=0,f.memoizedProps=null,f.memoizedState=null,f.updateQueue=null,f.dependencies=null,f.stateNode=null):(f.childLanes=g.childLanes,f.lanes=g.lanes,f.child=g.child,f.subtreeFlags=0,f.deletions=null,f.memoizedProps=g.memoizedProps,f.memoizedState=g.memoizedState,f.updateQueue=g.updateQueue,f.type=g.type,a=g.dependencies,f.dependencies=null===a?null:{lanes:a.lanes,firstContext:a.firstContext}),c=c.sibling;G(M,M.current&1|2);return b.child}a=\na.sibling}null!==f.tail&&B()>Hj&&(b.flags|=128,d=!0,Ej(f,!1),b.lanes=4194304)}else{if(!d)if(a=Mh(g),null!==a){if(b.flags|=128,d=!0,c=a.updateQueue,null!==c&&(b.updateQueue=c,b.flags|=4),Ej(f,!0),null===f.tail&&\"hidden\"===f.tailMode&&!g.alternate&&!I)return S(b),null}else 2*B()-f.renderingStartTime>Hj&&1073741824!==c&&(b.flags|=128,d=!0,Ej(f,!1),b.lanes=4194304);f.isBackwards?(g.sibling=b.child,b.child=g):(c=f.last,null!==c?c.sibling=g:b.child=g,f.last=g)}if(null!==f.tail)return b=f.tail,f.rendering=\nb,f.tail=b.sibling,f.renderingStartTime=B(),b.sibling=null,c=M.current,G(M,d?c&1|2:c&1),b;S(b);return null;case 22:case 23:return Ij(),d=null!==b.memoizedState,null!==a&&null!==a.memoizedState!==d&&(b.flags|=8192),d&&0!==(b.mode&1)?0!==(gj&1073741824)&&(S(b),b.subtreeFlags&6&&(b.flags|=8192)):S(b),null;case 24:return null;case 25:return null}throw Error(p(156,b.tag));}\nfunction Jj(a,b){wg(b);switch(b.tag){case 1:return Zf(b.type)&&$f(),a=b.flags,a&65536?(b.flags=a&-65537|128,b):null;case 3:return Jh(),E(Wf),E(H),Oh(),a=b.flags,0!==(a&65536)&&0===(a&128)?(b.flags=a&-65537|128,b):null;case 5:return Lh(b),null;case 13:E(M);a=b.memoizedState;if(null!==a&&null!==a.dehydrated){if(null===b.alternate)throw Error(p(340));Ig()}a=b.flags;return a&65536?(b.flags=a&-65537|128,b):null;case 19:return E(M),null;case 4:return Jh(),null;case 10:return Rg(b.type._context),null;case 22:case 23:return Ij(),\nnull;case 24:return null;default:return null}}var Kj=!1,U=!1,Lj=\"function\"===typeof WeakSet?WeakSet:Set,V=null;function Mj(a,b){var c=a.ref;if(null!==c)if(\"function\"===typeof c)try{c(null)}catch(d){W(a,b,d)}else c.current=null}function Nj(a,b,c){try{c()}catch(d){W(a,b,d)}}var Oj=!1;\nfunction Pj(a,b){Cf=dd;a=Me();if(Ne(a)){if(\"selectionStart\"in a)var c={start:a.selectionStart,end:a.selectionEnd};else a:{c=(c=a.ownerDocument)&&c.defaultView||window;var d=c.getSelection&&c.getSelection();if(d&&0!==d.rangeCount){c=d.anchorNode;var e=d.anchorOffset,f=d.focusNode;d=d.focusOffset;try{c.nodeType,f.nodeType}catch(F){c=null;break a}var g=0,h=-1,k=-1,l=0,m=0,q=a,r=null;b:for(;;){for(var y;;){q!==c||0!==e&&3!==q.nodeType||(h=g+e);q!==f||0!==d&&3!==q.nodeType||(k=g+d);3===q.nodeType&&(g+=\nq.nodeValue.length);if(null===(y=q.firstChild))break;r=q;q=y}for(;;){if(q===a)break b;r===c&&++l===e&&(h=g);r===f&&++m===d&&(k=g);if(null!==(y=q.nextSibling))break;q=r;r=q.parentNode}q=y}c=-1===h||-1===k?null:{start:h,end:k}}else c=null}c=c||{start:0,end:0}}else c=null;Df={focusedElem:a,selectionRange:c};dd=!1;for(V=b;null!==V;)if(b=V,a=b.child,0!==(b.subtreeFlags&1028)&&null!==a)a.return=b,V=a;else for(;null!==V;){b=V;try{var n=b.alternate;if(0!==(b.flags&1024))switch(b.tag){case 0:case 11:case 15:break;\ncase 1:if(null!==n){var t=n.memoizedProps,J=n.memoizedState,x=b.stateNode,w=x.getSnapshotBeforeUpdate(b.elementType===b.type?t:Lg(b.type,t),J);x.__reactInternalSnapshotBeforeUpdate=w}break;case 3:var u=b.stateNode.containerInfo;1===u.nodeType?u.textContent=\"\":9===u.nodeType&&u.documentElement&&u.removeChild(u.documentElement);break;case 5:case 6:case 4:case 17:break;default:throw Error(p(163));}}catch(F){W(b,b.return,F)}a=b.sibling;if(null!==a){a.return=b.return;V=a;break}V=b.return}n=Oj;Oj=!1;return n}\nfunction Qj(a,b,c){var d=b.updateQueue;d=null!==d?d.lastEffect:null;if(null!==d){var e=d=d.next;do{if((e.tag&a)===a){var f=e.destroy;e.destroy=void 0;void 0!==f&&Nj(b,c,f)}e=e.next}while(e!==d)}}function Rj(a,b){b=b.updateQueue;b=null!==b?b.lastEffect:null;if(null!==b){var c=b=b.next;do{if((c.tag&a)===a){var d=c.create;c.destroy=d()}c=c.next}while(c!==b)}}function Sj(a){var b=a.ref;if(null!==b){var c=a.stateNode;switch(a.tag){case 5:a=c;break;default:a=c}\"function\"===typeof b?b(a):b.current=a}}\nfunction Tj(a){var b=a.alternate;null!==b&&(a.alternate=null,Tj(b));a.child=null;a.deletions=null;a.sibling=null;5===a.tag&&(b=a.stateNode,null!==b&&(delete b[Of],delete b[Pf],delete b[of],delete b[Qf],delete b[Rf]));a.stateNode=null;a.return=null;a.dependencies=null;a.memoizedProps=null;a.memoizedState=null;a.pendingProps=null;a.stateNode=null;a.updateQueue=null}function Uj(a){return 5===a.tag||3===a.tag||4===a.tag}\nfunction Vj(a){a:for(;;){for(;null===a.sibling;){if(null===a.return||Uj(a.return))return null;a=a.return}a.sibling.return=a.return;for(a=a.sibling;5!==a.tag&&6!==a.tag&&18!==a.tag;){if(a.flags&2)continue a;if(null===a.child||4===a.tag)continue a;else a.child.return=a,a=a.child}if(!(a.flags&2))return a.stateNode}}\nfunction Wj(a,b,c){var d=a.tag;if(5===d||6===d)a=a.stateNode,b?8===c.nodeType?c.parentNode.insertBefore(a,b):c.insertBefore(a,b):(8===c.nodeType?(b=c.parentNode,b.insertBefore(a,c)):(b=c,b.appendChild(a)),c=c._reactRootContainer,null!==c&&void 0!==c||null!==b.onclick||(b.onclick=Bf));else if(4!==d&&(a=a.child,null!==a))for(Wj(a,b,c),a=a.sibling;null!==a;)Wj(a,b,c),a=a.sibling}\nfunction Xj(a,b,c){var d=a.tag;if(5===d||6===d)a=a.stateNode,b?c.insertBefore(a,b):c.appendChild(a);else if(4!==d&&(a=a.child,null!==a))for(Xj(a,b,c),a=a.sibling;null!==a;)Xj(a,b,c),a=a.sibling}var X=null,Yj=!1;function Zj(a,b,c){for(c=c.child;null!==c;)ak(a,b,c),c=c.sibling}\nfunction ak(a,b,c){if(lc&&\"function\"===typeof lc.onCommitFiberUnmount)try{lc.onCommitFiberUnmount(kc,c)}catch(h){}switch(c.tag){case 5:U||Mj(c,b);case 6:var d=X,e=Yj;X=null;Zj(a,b,c);X=d;Yj=e;null!==X&&(Yj?(a=X,c=c.stateNode,8===a.nodeType?a.parentNode.removeChild(c):a.removeChild(c)):X.removeChild(c.stateNode));break;case 18:null!==X&&(Yj?(a=X,c=c.stateNode,8===a.nodeType?Kf(a.parentNode,c):1===a.nodeType&&Kf(a,c),bd(a)):Kf(X,c.stateNode));break;case 4:d=X;e=Yj;X=c.stateNode.containerInfo;Yj=!0;\nZj(a,b,c);X=d;Yj=e;break;case 0:case 11:case 14:case 15:if(!U&&(d=c.updateQueue,null!==d&&(d=d.lastEffect,null!==d))){e=d=d.next;do{var f=e,g=f.destroy;f=f.tag;void 0!==g&&(0!==(f&2)?Nj(c,b,g):0!==(f&4)&&Nj(c,b,g));e=e.next}while(e!==d)}Zj(a,b,c);break;case 1:if(!U&&(Mj(c,b),d=c.stateNode,\"function\"===typeof d.componentWillUnmount))try{d.props=c.memoizedProps,d.state=c.memoizedState,d.componentWillUnmount()}catch(h){W(c,b,h)}Zj(a,b,c);break;case 21:Zj(a,b,c);break;case 22:c.mode&1?(U=(d=U)||null!==\nc.memoizedState,Zj(a,b,c),U=d):Zj(a,b,c);break;default:Zj(a,b,c)}}function bk(a){var b=a.updateQueue;if(null!==b){a.updateQueue=null;var c=a.stateNode;null===c&&(c=a.stateNode=new Lj);b.forEach(function(b){var d=ck.bind(null,a,b);c.has(b)||(c.add(b),b.then(d,d))})}}\nfunction dk(a,b){var c=b.deletions;if(null!==c)for(var d=0;d<c.length;d++){var e=c[d];try{var f=a,g=b,h=g;a:for(;null!==h;){switch(h.tag){case 5:X=h.stateNode;Yj=!1;break a;case 3:X=h.stateNode.containerInfo;Yj=!0;break a;case 4:X=h.stateNode.containerInfo;Yj=!0;break a}h=h.return}if(null===X)throw Error(p(160));ak(f,g,e);X=null;Yj=!1;var k=e.alternate;null!==k&&(k.return=null);e.return=null}catch(l){W(e,b,l)}}if(b.subtreeFlags&12854)for(b=b.child;null!==b;)ek(b,a),b=b.sibling}\nfunction ek(a,b){var c=a.alternate,d=a.flags;switch(a.tag){case 0:case 11:case 14:case 15:dk(b,a);fk(a);if(d&4){try{Qj(3,a,a.return),Rj(3,a)}catch(t){W(a,a.return,t)}try{Qj(5,a,a.return)}catch(t){W(a,a.return,t)}}break;case 1:dk(b,a);fk(a);d&512&&null!==c&&Mj(c,c.return);break;case 5:dk(b,a);fk(a);d&512&&null!==c&&Mj(c,c.return);if(a.flags&32){var e=a.stateNode;try{ob(e,\"\")}catch(t){W(a,a.return,t)}}if(d&4&&(e=a.stateNode,null!=e)){var f=a.memoizedProps,g=null!==c?c.memoizedProps:f,h=a.type,k=a.updateQueue;\na.updateQueue=null;if(null!==k)try{\"input\"===h&&\"radio\"===f.type&&null!=f.name&&ab(e,f);vb(h,g);var l=vb(h,f);for(g=0;g<k.length;g+=2){var m=k[g],q=k[g+1];\"style\"===m?sb(e,q):\"dangerouslySetInnerHTML\"===m?nb(e,q):\"children\"===m?ob(e,q):ta(e,m,q,l)}switch(h){case \"input\":bb(e,f);break;case \"textarea\":ib(e,f);break;case \"select\":var r=e._wrapperState.wasMultiple;e._wrapperState.wasMultiple=!!f.multiple;var y=f.value;null!=y?fb(e,!!f.multiple,y,!1):r!==!!f.multiple&&(null!=f.defaultValue?fb(e,!!f.multiple,\nf.defaultValue,!0):fb(e,!!f.multiple,f.multiple?[]:\"\",!1))}e[Pf]=f}catch(t){W(a,a.return,t)}}break;case 6:dk(b,a);fk(a);if(d&4){if(null===a.stateNode)throw Error(p(162));e=a.stateNode;f=a.memoizedProps;try{e.nodeValue=f}catch(t){W(a,a.return,t)}}break;case 3:dk(b,a);fk(a);if(d&4&&null!==c&&c.memoizedState.isDehydrated)try{bd(b.containerInfo)}catch(t){W(a,a.return,t)}break;case 4:dk(b,a);fk(a);break;case 13:dk(b,a);fk(a);e=a.child;e.flags&8192&&(f=null!==e.memoizedState,e.stateNode.isHidden=f,!f||\nnull!==e.alternate&&null!==e.alternate.memoizedState||(gk=B()));d&4&&bk(a);break;case 22:m=null!==c&&null!==c.memoizedState;a.mode&1?(U=(l=U)||m,dk(b,a),U=l):dk(b,a);fk(a);if(d&8192){l=null!==a.memoizedState;if((a.stateNode.isHidden=l)&&!m&&0!==(a.mode&1))for(V=a,m=a.child;null!==m;){for(q=V=m;null!==V;){r=V;y=r.child;switch(r.tag){case 0:case 11:case 14:case 15:Qj(4,r,r.return);break;case 1:Mj(r,r.return);var n=r.stateNode;if(\"function\"===typeof n.componentWillUnmount){d=r;c=r.return;try{b=d,n.props=\nb.memoizedProps,n.state=b.memoizedState,n.componentWillUnmount()}catch(t){W(d,c,t)}}break;case 5:Mj(r,r.return);break;case 22:if(null!==r.memoizedState){hk(q);continue}}null!==y?(y.return=r,V=y):hk(q)}m=m.sibling}a:for(m=null,q=a;;){if(5===q.tag){if(null===m){m=q;try{e=q.stateNode,l?(f=e.style,\"function\"===typeof f.setProperty?f.setProperty(\"display\",\"none\",\"important\"):f.display=\"none\"):(h=q.stateNode,k=q.memoizedProps.style,g=void 0!==k&&null!==k&&k.hasOwnProperty(\"display\")?k.display:null,h.style.display=\nrb(\"display\",g))}catch(t){W(a,a.return,t)}}}else if(6===q.tag){if(null===m)try{q.stateNode.nodeValue=l?\"\":q.memoizedProps}catch(t){W(a,a.return,t)}}else if((22!==q.tag&&23!==q.tag||null===q.memoizedState||q===a)&&null!==q.child){q.child.return=q;q=q.child;continue}if(q===a)break a;for(;null===q.sibling;){if(null===q.return||q.return===a)break a;m===q&&(m=null);q=q.return}m===q&&(m=null);q.sibling.return=q.return;q=q.sibling}}break;case 19:dk(b,a);fk(a);d&4&&bk(a);break;case 21:break;default:dk(b,\na),fk(a)}}function fk(a){var b=a.flags;if(b&2){try{a:{for(var c=a.return;null!==c;){if(Uj(c)){var d=c;break a}c=c.return}throw Error(p(160));}switch(d.tag){case 5:var e=d.stateNode;d.flags&32&&(ob(e,\"\"),d.flags&=-33);var f=Vj(a);Xj(a,f,e);break;case 3:case 4:var g=d.stateNode.containerInfo,h=Vj(a);Wj(a,h,g);break;default:throw Error(p(161));}}catch(k){W(a,a.return,k)}a.flags&=-3}b&4096&&(a.flags&=-4097)}function ik(a,b,c){V=a;jk(a,b,c)}\nfunction jk(a,b,c){for(var d=0!==(a.mode&1);null!==V;){var e=V,f=e.child;if(22===e.tag&&d){var g=null!==e.memoizedState||Kj;if(!g){var h=e.alternate,k=null!==h&&null!==h.memoizedState||U;h=Kj;var l=U;Kj=g;if((U=k)&&!l)for(V=e;null!==V;)g=V,k=g.child,22===g.tag&&null!==g.memoizedState?kk(e):null!==k?(k.return=g,V=k):kk(e);for(;null!==f;)V=f,jk(f,b,c),f=f.sibling;V=e;Kj=h;U=l}lk(a,b,c)}else 0!==(e.subtreeFlags&8772)&&null!==f?(f.return=e,V=f):lk(a,b,c)}}\nfunction lk(a){for(;null!==V;){var b=V;if(0!==(b.flags&8772)){var c=b.alternate;try{if(0!==(b.flags&8772))switch(b.tag){case 0:case 11:case 15:U||Rj(5,b);break;case 1:var d=b.stateNode;if(b.flags&4&&!U)if(null===c)d.componentDidMount();else{var e=b.elementType===b.type?c.memoizedProps:Lg(b.type,c.memoizedProps);d.componentDidUpdate(e,c.memoizedState,d.__reactInternalSnapshotBeforeUpdate)}var f=b.updateQueue;null!==f&&ih(b,f,d);break;case 3:var g=b.updateQueue;if(null!==g){c=null;if(null!==b.child)switch(b.child.tag){case 5:c=\nb.child.stateNode;break;case 1:c=b.child.stateNode}ih(b,g,c)}break;case 5:var h=b.stateNode;if(null===c&&b.flags&4){c=h;var k=b.memoizedProps;switch(b.type){case \"button\":case \"input\":case \"select\":case \"textarea\":k.autoFocus&&c.focus();break;case \"img\":k.src&&(c.src=k.src)}}break;case 6:break;case 4:break;case 12:break;case 13:if(null===b.memoizedState){var l=b.alternate;if(null!==l){var m=l.memoizedState;if(null!==m){var q=m.dehydrated;null!==q&&bd(q)}}}break;case 19:case 17:case 21:case 22:case 23:case 25:break;\ndefault:throw Error(p(163));}U||b.flags&512&&Sj(b)}catch(r){W(b,b.return,r)}}if(b===a){V=null;break}c=b.sibling;if(null!==c){c.return=b.return;V=c;break}V=b.return}}function hk(a){for(;null!==V;){var b=V;if(b===a){V=null;break}var c=b.sibling;if(null!==c){c.return=b.return;V=c;break}V=b.return}}\nfunction kk(a){for(;null!==V;){var b=V;try{switch(b.tag){case 0:case 11:case 15:var c=b.return;try{Rj(4,b)}catch(k){W(b,c,k)}break;case 1:var d=b.stateNode;if(\"function\"===typeof d.componentDidMount){var e=b.return;try{d.componentDidMount()}catch(k){W(b,e,k)}}var f=b.return;try{Sj(b)}catch(k){W(b,f,k)}break;case 5:var g=b.return;try{Sj(b)}catch(k){W(b,g,k)}}}catch(k){W(b,b.return,k)}if(b===a){V=null;break}var h=b.sibling;if(null!==h){h.return=b.return;V=h;break}V=b.return}}\nvar mk=Math.ceil,nk=ua.ReactCurrentDispatcher,ok=ua.ReactCurrentOwner,pk=ua.ReactCurrentBatchConfig,K=0,R=null,Y=null,Z=0,gj=0,fj=Uf(0),T=0,qk=null,hh=0,rk=0,sk=0,tk=null,uk=null,gk=0,Hj=Infinity,vk=null,Pi=!1,Qi=null,Si=null,wk=!1,xk=null,yk=0,zk=0,Ak=null,Bk=-1,Ck=0;function L(){return 0!==(K&6)?B():-1!==Bk?Bk:Bk=B()}\nfunction lh(a){if(0===(a.mode&1))return 1;if(0!==(K&2)&&0!==Z)return Z&-Z;if(null!==Kg.transition)return 0===Ck&&(Ck=yc()),Ck;a=C;if(0!==a)return a;a=window.event;a=void 0===a?16:jd(a.type);return a}function mh(a,b,c,d){if(50<zk)throw zk=0,Ak=null,Error(p(185));Ac(a,c,d);if(0===(K&2)||a!==R)a===R&&(0===(K&2)&&(rk|=c),4===T&&Dk(a,Z)),Ek(a,d),1===c&&0===K&&0===(b.mode&1)&&(Hj=B()+500,fg&&jg())}\nfunction Ek(a,b){var c=a.callbackNode;wc(a,b);var d=uc(a,a===R?Z:0);if(0===d)null!==c&&bc(c),a.callbackNode=null,a.callbackPriority=0;else if(b=d&-d,a.callbackPriority!==b){null!=c&&bc(c);if(1===b)0===a.tag?ig(Fk.bind(null,a)):hg(Fk.bind(null,a)),Jf(function(){0===(K&6)&&jg()}),c=null;else{switch(Dc(d)){case 1:c=fc;break;case 4:c=gc;break;case 16:c=hc;break;case 536870912:c=jc;break;default:c=hc}c=Gk(c,Hk.bind(null,a))}a.callbackPriority=b;a.callbackNode=c}}\nfunction Hk(a,b){Bk=-1;Ck=0;if(0!==(K&6))throw Error(p(327));var c=a.callbackNode;if(Ik()&&a.callbackNode!==c)return null;var d=uc(a,a===R?Z:0);if(0===d)return null;if(0!==(d&30)||0!==(d&a.expiredLanes)||b)b=Jk(a,d);else{b=d;var e=K;K|=2;var f=Kk();if(R!==a||Z!==b)vk=null,Hj=B()+500,Lk(a,b);do try{Mk();break}catch(h){Nk(a,h)}while(1);Qg();nk.current=f;K=e;null!==Y?b=0:(R=null,Z=0,b=T)}if(0!==b){2===b&&(e=xc(a),0!==e&&(d=e,b=Ok(a,e)));if(1===b)throw c=qk,Lk(a,0),Dk(a,d),Ek(a,B()),c;if(6===b)Dk(a,d);\nelse{e=a.current.alternate;if(0===(d&30)&&!Pk(e)&&(b=Jk(a,d),2===b&&(f=xc(a),0!==f&&(d=f,b=Ok(a,f))),1===b))throw c=qk,Lk(a,0),Dk(a,d),Ek(a,B()),c;a.finishedWork=e;a.finishedLanes=d;switch(b){case 0:case 1:throw Error(p(345));case 2:Qk(a,uk,vk);break;case 3:Dk(a,d);if((d&130023424)===d&&(b=gk+500-B(),10<b)){if(0!==uc(a,0))break;e=a.suspendedLanes;if((e&d)!==d){L();a.pingedLanes|=a.suspendedLanes&e;break}a.timeoutHandle=Ff(Qk.bind(null,a,uk,vk),b);break}Qk(a,uk,vk);break;case 4:Dk(a,d);if((d&4194240)===\nd)break;b=a.eventTimes;for(e=-1;0<d;){var g=31-oc(d);f=1<<g;g=b[g];g>e&&(e=g);d&=~f}d=e;d=B()-d;d=(120>d?120:480>d?480:1080>d?1080:1920>d?1920:3E3>d?3E3:4320>d?4320:1960*mk(d/1960))-d;if(10<d){a.timeoutHandle=Ff(Qk.bind(null,a,uk,vk),d);break}Qk(a,uk,vk);break;case 5:Qk(a,uk,vk);break;default:throw Error(p(329));}}}Ek(a,B());return a.callbackNode===c?Hk.bind(null,a):null}\nfunction Ok(a,b){var c=tk;a.current.memoizedState.isDehydrated&&(Lk(a,b).flags|=256);a=Jk(a,b);2!==a&&(b=uk,uk=c,null!==b&&Gj(b));return a}function Gj(a){null===uk?uk=a:uk.push.apply(uk,a)}\nfunction Pk(a){for(var b=a;;){if(b.flags&16384){var c=b.updateQueue;if(null!==c&&(c=c.stores,null!==c))for(var d=0;d<c.length;d++){var e=c[d],f=e.getSnapshot;e=e.value;try{if(!He(f(),e))return!1}catch(g){return!1}}}c=b.child;if(b.subtreeFlags&16384&&null!==c)c.return=b,b=c;else{if(b===a)break;for(;null===b.sibling;){if(null===b.return||b.return===a)return!0;b=b.return}b.sibling.return=b.return;b=b.sibling}}return!0}\nfunction Dk(a,b){b&=~sk;b&=~rk;a.suspendedLanes|=b;a.pingedLanes&=~b;for(a=a.expirationTimes;0<b;){var c=31-oc(b),d=1<<c;a[c]=-1;b&=~d}}function Fk(a){if(0!==(K&6))throw Error(p(327));Ik();var b=uc(a,0);if(0===(b&1))return Ek(a,B()),null;var c=Jk(a,b);if(0!==a.tag&&2===c){var d=xc(a);0!==d&&(b=d,c=Ok(a,d))}if(1===c)throw c=qk,Lk(a,0),Dk(a,b),Ek(a,B()),c;if(6===c)throw Error(p(345));a.finishedWork=a.current.alternate;a.finishedLanes=b;Qk(a,uk,vk);Ek(a,B());return null}\nfunction Rk(a,b){var c=K;K|=1;try{return a(b)}finally{K=c,0===K&&(Hj=B()+500,fg&&jg())}}function Sk(a){null!==xk&&0===xk.tag&&0===(K&6)&&Ik();var b=K;K|=1;var c=pk.transition,d=C;try{if(pk.transition=null,C=1,a)return a()}finally{C=d,pk.transition=c,K=b,0===(K&6)&&jg()}}function Ij(){gj=fj.current;E(fj)}\nfunction Lk(a,b){a.finishedWork=null;a.finishedLanes=0;var c=a.timeoutHandle;-1!==c&&(a.timeoutHandle=-1,Gf(c));if(null!==Y)for(c=Y.return;null!==c;){var d=c;wg(d);switch(d.tag){case 1:d=d.type.childContextTypes;null!==d&&void 0!==d&&$f();break;case 3:Jh();E(Wf);E(H);Oh();break;case 5:Lh(d);break;case 4:Jh();break;case 13:E(M);break;case 19:E(M);break;case 10:Rg(d.type._context);break;case 22:case 23:Ij()}c=c.return}R=a;Y=a=wh(a.current,null);Z=gj=b;T=0;qk=null;sk=rk=hh=0;uk=tk=null;if(null!==Wg){for(b=\n0;b<Wg.length;b++)if(c=Wg[b],d=c.interleaved,null!==d){c.interleaved=null;var e=d.next,f=c.pending;if(null!==f){var g=f.next;f.next=e;d.next=g}c.pending=d}Wg=null}return a}\nfunction Nk(a,b){do{var c=Y;try{Qg();Ph.current=ai;if(Sh){for(var d=N.memoizedState;null!==d;){var e=d.queue;null!==e&&(e.pending=null);d=d.next}Sh=!1}Rh=0;P=O=N=null;Th=!1;Uh=0;ok.current=null;if(null===c||null===c.return){T=1;qk=b;Y=null;break}a:{var f=a,g=c.return,h=c,k=b;b=Z;h.flags|=32768;if(null!==k&&\"object\"===typeof k&&\"function\"===typeof k.then){var l=k,m=h,q=m.tag;if(0===(m.mode&1)&&(0===q||11===q||15===q)){var r=m.alternate;r?(m.updateQueue=r.updateQueue,m.memoizedState=r.memoizedState,\nm.lanes=r.lanes):(m.updateQueue=null,m.memoizedState=null)}var y=Vi(g);if(null!==y){y.flags&=-257;Wi(y,g,h,f,b);y.mode&1&&Ti(f,l,b);b=y;k=l;var n=b.updateQueue;if(null===n){var t=new Set;t.add(k);b.updateQueue=t}else n.add(k);break a}else{if(0===(b&1)){Ti(f,l,b);uj();break a}k=Error(p(426))}}else if(I&&h.mode&1){var J=Vi(g);if(null!==J){0===(J.flags&65536)&&(J.flags|=256);Wi(J,g,h,f,b);Jg(Ki(k,h));break a}}f=k=Ki(k,h);4!==T&&(T=2);null===tk?tk=[f]:tk.push(f);f=g;do{switch(f.tag){case 3:f.flags|=65536;\nb&=-b;f.lanes|=b;var x=Oi(f,k,b);fh(f,x);break a;case 1:h=k;var w=f.type,u=f.stateNode;if(0===(f.flags&128)&&(\"function\"===typeof w.getDerivedStateFromError||null!==u&&\"function\"===typeof u.componentDidCatch&&(null===Si||!Si.has(u)))){f.flags|=65536;b&=-b;f.lanes|=b;var F=Ri(f,h,b);fh(f,F);break a}}f=f.return}while(null!==f)}Tk(c)}catch(na){b=na;Y===c&&null!==c&&(Y=c=c.return);continue}break}while(1)}function Kk(){var a=nk.current;nk.current=ai;return null===a?ai:a}\nfunction uj(){if(0===T||3===T||2===T)T=4;null===R||0===(hh&268435455)&&0===(rk&268435455)||Dk(R,Z)}function Jk(a,b){var c=K;K|=2;var d=Kk();if(R!==a||Z!==b)vk=null,Lk(a,b);do try{Uk();break}catch(e){Nk(a,e)}while(1);Qg();K=c;nk.current=d;if(null!==Y)throw Error(p(261));R=null;Z=0;return T}function Uk(){for(;null!==Y;)Vk(Y)}function Mk(){for(;null!==Y&&!cc();)Vk(Y)}function Vk(a){var b=Wk(a.alternate,a,gj);a.memoizedProps=a.pendingProps;null===b?Tk(a):Y=b;ok.current=null}\nfunction Tk(a){var b=a;do{var c=b.alternate;a=b.return;if(0===(b.flags&32768)){if(c=Fj(c,b,gj),null!==c){Y=c;return}}else{c=Jj(c,b);if(null!==c){c.flags&=32767;Y=c;return}if(null!==a)a.flags|=32768,a.subtreeFlags=0,a.deletions=null;else{T=6;Y=null;return}}b=b.sibling;if(null!==b){Y=b;return}Y=b=a}while(null!==b);0===T&&(T=5)}function Qk(a,b,c){var d=C,e=pk.transition;try{pk.transition=null,C=1,Xk(a,b,c,d)}finally{pk.transition=e,C=d}return null}\nfunction Xk(a,b,c,d){do Ik();while(null!==xk);if(0!==(K&6))throw Error(p(327));c=a.finishedWork;var e=a.finishedLanes;if(null===c)return null;a.finishedWork=null;a.finishedLanes=0;if(c===a.current)throw Error(p(177));a.callbackNode=null;a.callbackPriority=0;var f=c.lanes|c.childLanes;Bc(a,f);a===R&&(Y=R=null,Z=0);0===(c.subtreeFlags&2064)&&0===(c.flags&2064)||wk||(wk=!0,Gk(hc,function(){Ik();return null}));f=0!==(c.flags&15990);if(0!==(c.subtreeFlags&15990)||f){f=pk.transition;pk.transition=null;\nvar g=C;C=1;var h=K;K|=4;ok.current=null;Pj(a,c);ek(c,a);Oe(Df);dd=!!Cf;Df=Cf=null;a.current=c;ik(c,a,e);dc();K=h;C=g;pk.transition=f}else a.current=c;wk&&(wk=!1,xk=a,yk=e);f=a.pendingLanes;0===f&&(Si=null);mc(c.stateNode,d);Ek(a,B());if(null!==b)for(d=a.onRecoverableError,c=0;c<b.length;c++)e=b[c],d(e.value,{componentStack:e.stack,digest:e.digest});if(Pi)throw Pi=!1,a=Qi,Qi=null,a;0!==(yk&1)&&0!==a.tag&&Ik();f=a.pendingLanes;0!==(f&1)?a===Ak?zk++:(zk=0,Ak=a):zk=0;jg();return null}\nfunction Ik(){if(null!==xk){var a=Dc(yk),b=pk.transition,c=C;try{pk.transition=null;C=16>a?16:a;if(null===xk)var d=!1;else{a=xk;xk=null;yk=0;if(0!==(K&6))throw Error(p(331));var e=K;K|=4;for(V=a.current;null!==V;){var f=V,g=f.child;if(0!==(V.flags&16)){var h=f.deletions;if(null!==h){for(var k=0;k<h.length;k++){var l=h[k];for(V=l;null!==V;){var m=V;switch(m.tag){case 0:case 11:case 15:Qj(8,m,f)}var q=m.child;if(null!==q)q.return=m,V=q;else for(;null!==V;){m=V;var r=m.sibling,y=m.return;Tj(m);if(m===\nl){V=null;break}if(null!==r){r.return=y;V=r;break}V=y}}}var n=f.alternate;if(null!==n){var t=n.child;if(null!==t){n.child=null;do{var J=t.sibling;t.sibling=null;t=J}while(null!==t)}}V=f}}if(0!==(f.subtreeFlags&2064)&&null!==g)g.return=f,V=g;else b:for(;null!==V;){f=V;if(0!==(f.flags&2048))switch(f.tag){case 0:case 11:case 15:Qj(9,f,f.return)}var x=f.sibling;if(null!==x){x.return=f.return;V=x;break b}V=f.return}}var w=a.current;for(V=w;null!==V;){g=V;var u=g.child;if(0!==(g.subtreeFlags&2064)&&null!==\nu)u.return=g,V=u;else b:for(g=w;null!==V;){h=V;if(0!==(h.flags&2048))try{switch(h.tag){case 0:case 11:case 15:Rj(9,h)}}catch(na){W(h,h.return,na)}if(h===g){V=null;break b}var F=h.sibling;if(null!==F){F.return=h.return;V=F;break b}V=h.return}}K=e;jg();if(lc&&\"function\"===typeof lc.onPostCommitFiberRoot)try{lc.onPostCommitFiberRoot(kc,a)}catch(na){}d=!0}return d}finally{C=c,pk.transition=b}}return!1}function Yk(a,b,c){b=Ki(c,b);b=Oi(a,b,1);a=dh(a,b,1);b=L();null!==a&&(Ac(a,1,b),Ek(a,b))}\nfunction W(a,b,c){if(3===a.tag)Yk(a,a,c);else for(;null!==b;){if(3===b.tag){Yk(b,a,c);break}else if(1===b.tag){var d=b.stateNode;if(\"function\"===typeof b.type.getDerivedStateFromError||\"function\"===typeof d.componentDidCatch&&(null===Si||!Si.has(d))){a=Ki(c,a);a=Ri(b,a,1);b=dh(b,a,1);a=L();null!==b&&(Ac(b,1,a),Ek(b,a));break}}b=b.return}}\nfunction Ui(a,b,c){var d=a.pingCache;null!==d&&d.delete(b);b=L();a.pingedLanes|=a.suspendedLanes&c;R===a&&(Z&c)===c&&(4===T||3===T&&(Z&130023424)===Z&&500>B()-gk?Lk(a,0):sk|=c);Ek(a,b)}function Zk(a,b){0===b&&(0===(a.mode&1)?b=1:(b=sc,sc<<=1,0===(sc&130023424)&&(sc=4194304)));var c=L();a=Zg(a,b);null!==a&&(Ac(a,b,c),Ek(a,c))}function vj(a){var b=a.memoizedState,c=0;null!==b&&(c=b.retryLane);Zk(a,c)}\nfunction ck(a,b){var c=0;switch(a.tag){case 13:var d=a.stateNode;var e=a.memoizedState;null!==e&&(c=e.retryLane);break;case 19:d=a.stateNode;break;default:throw Error(p(314));}null!==d&&d.delete(b);Zk(a,c)}var Wk;\nWk=function(a,b,c){if(null!==a)if(a.memoizedProps!==b.pendingProps||Wf.current)Ug=!0;else{if(0===(a.lanes&c)&&0===(b.flags&128))return Ug=!1,zj(a,b,c);Ug=0!==(a.flags&131072)?!0:!1}else Ug=!1,I&&0!==(b.flags&1048576)&&ug(b,ng,b.index);b.lanes=0;switch(b.tag){case 2:var d=b.type;jj(a,b);a=b.pendingProps;var e=Yf(b,H.current);Tg(b,c);e=Xh(null,b,d,a,e,c);var f=bi();b.flags|=1;\"object\"===typeof e&&null!==e&&\"function\"===typeof e.render&&void 0===e.$$typeof?(b.tag=1,b.memoizedState=null,b.updateQueue=\nnull,Zf(d)?(f=!0,cg(b)):f=!1,b.memoizedState=null!==e.state&&void 0!==e.state?e.state:null,ah(b),e.updater=nh,b.stateNode=e,e._reactInternals=b,rh(b,d,a,c),b=kj(null,b,d,!0,f,c)):(b.tag=0,I&&f&&vg(b),Yi(null,b,e,c),b=b.child);return b;case 16:d=b.elementType;a:{jj(a,b);a=b.pendingProps;e=d._init;d=e(d._payload);b.type=d;e=b.tag=$k(d);a=Lg(d,a);switch(e){case 0:b=dj(null,b,d,a,c);break a;case 1:b=ij(null,b,d,a,c);break a;case 11:b=Zi(null,b,d,a,c);break a;case 14:b=aj(null,b,d,Lg(d.type,a),c);break a}throw Error(p(306,\nd,\"\"));}return b;case 0:return d=b.type,e=b.pendingProps,e=b.elementType===d?e:Lg(d,e),dj(a,b,d,e,c);case 1:return d=b.type,e=b.pendingProps,e=b.elementType===d?e:Lg(d,e),ij(a,b,d,e,c);case 3:a:{lj(b);if(null===a)throw Error(p(387));d=b.pendingProps;f=b.memoizedState;e=f.element;bh(a,b);gh(b,d,null,c);var g=b.memoizedState;d=g.element;if(f.isDehydrated)if(f={element:d,isDehydrated:!1,cache:g.cache,pendingSuspenseBoundaries:g.pendingSuspenseBoundaries,transitions:g.transitions},b.updateQueue.baseState=\nf,b.memoizedState=f,b.flags&256){e=Ki(Error(p(423)),b);b=mj(a,b,d,c,e);break a}else if(d!==e){e=Ki(Error(p(424)),b);b=mj(a,b,d,c,e);break a}else for(yg=Lf(b.stateNode.containerInfo.firstChild),xg=b,I=!0,zg=null,c=Ch(b,null,d,c),b.child=c;c;)c.flags=c.flags&-3|4096,c=c.sibling;else{Ig();if(d===e){b=$i(a,b,c);break a}Yi(a,b,d,c)}b=b.child}return b;case 5:return Kh(b),null===a&&Eg(b),d=b.type,e=b.pendingProps,f=null!==a?a.memoizedProps:null,g=e.children,Ef(d,e)?g=null:null!==f&&Ef(d,f)&&(b.flags|=32),\nhj(a,b),Yi(a,b,g,c),b.child;case 6:return null===a&&Eg(b),null;case 13:return pj(a,b,c);case 4:return Ih(b,b.stateNode.containerInfo),d=b.pendingProps,null===a?b.child=Bh(b,null,d,c):Yi(a,b,d,c),b.child;case 11:return d=b.type,e=b.pendingProps,e=b.elementType===d?e:Lg(d,e),Zi(a,b,d,e,c);case 7:return Yi(a,b,b.pendingProps,c),b.child;case 8:return Yi(a,b,b.pendingProps.children,c),b.child;case 12:return Yi(a,b,b.pendingProps.children,c),b.child;case 10:a:{d=b.type._context;e=b.pendingProps;f=b.memoizedProps;\ng=e.value;G(Mg,d._currentValue);d._currentValue=g;if(null!==f)if(He(f.value,g)){if(f.children===e.children&&!Wf.current){b=$i(a,b,c);break a}}else for(f=b.child,null!==f&&(f.return=b);null!==f;){var h=f.dependencies;if(null!==h){g=f.child;for(var k=h.firstContext;null!==k;){if(k.context===d){if(1===f.tag){k=ch(-1,c&-c);k.tag=2;var l=f.updateQueue;if(null!==l){l=l.shared;var m=l.pending;null===m?k.next=k:(k.next=m.next,m.next=k);l.pending=k}}f.lanes|=c;k=f.alternate;null!==k&&(k.lanes|=c);Sg(f.return,\nc,b);h.lanes|=c;break}k=k.next}}else if(10===f.tag)g=f.type===b.type?null:f.child;else if(18===f.tag){g=f.return;if(null===g)throw Error(p(341));g.lanes|=c;h=g.alternate;null!==h&&(h.lanes|=c);Sg(g,c,b);g=f.sibling}else g=f.child;if(null!==g)g.return=f;else for(g=f;null!==g;){if(g===b){g=null;break}f=g.sibling;if(null!==f){f.return=g.return;g=f;break}g=g.return}f=g}Yi(a,b,e.children,c);b=b.child}return b;case 9:return e=b.type,d=b.pendingProps.children,Tg(b,c),e=Vg(e),d=d(e),b.flags|=1,Yi(a,b,d,c),\nb.child;case 14:return d=b.type,e=Lg(d,b.pendingProps),e=Lg(d.type,e),aj(a,b,d,e,c);case 15:return cj(a,b,b.type,b.pendingProps,c);case 17:return d=b.type,e=b.pendingProps,e=b.elementType===d?e:Lg(d,e),jj(a,b),b.tag=1,Zf(d)?(a=!0,cg(b)):a=!1,Tg(b,c),ph(b,d,e),rh(b,d,e,c),kj(null,b,d,!0,a,c);case 19:return yj(a,b,c);case 22:return ej(a,b,c)}throw Error(p(156,b.tag));};function Gk(a,b){return ac(a,b)}\nfunction al(a,b,c,d){this.tag=a;this.key=c;this.sibling=this.child=this.return=this.stateNode=this.type=this.elementType=null;this.index=0;this.ref=null;this.pendingProps=b;this.dependencies=this.memoizedState=this.updateQueue=this.memoizedProps=null;this.mode=d;this.subtreeFlags=this.flags=0;this.deletions=null;this.childLanes=this.lanes=0;this.alternate=null}function Bg(a,b,c,d){return new al(a,b,c,d)}function bj(a){a=a.prototype;return!(!a||!a.isReactComponent)}\nfunction $k(a){if(\"function\"===typeof a)return bj(a)?1:0;if(void 0!==a&&null!==a){a=a.$$typeof;if(a===Da)return 11;if(a===Ga)return 14}return 2}\nfunction wh(a,b){var c=a.alternate;null===c?(c=Bg(a.tag,b,a.key,a.mode),c.elementType=a.elementType,c.type=a.type,c.stateNode=a.stateNode,c.alternate=a,a.alternate=c):(c.pendingProps=b,c.type=a.type,c.flags=0,c.subtreeFlags=0,c.deletions=null);c.flags=a.flags&14680064;c.childLanes=a.childLanes;c.lanes=a.lanes;c.child=a.child;c.memoizedProps=a.memoizedProps;c.memoizedState=a.memoizedState;c.updateQueue=a.updateQueue;b=a.dependencies;c.dependencies=null===b?null:{lanes:b.lanes,firstContext:b.firstContext};\nc.sibling=a.sibling;c.index=a.index;c.ref=a.ref;return c}\nfunction yh(a,b,c,d,e,f){var g=2;d=a;if(\"function\"===typeof a)bj(a)&&(g=1);else if(\"string\"===typeof a)g=5;else a:switch(a){case ya:return Ah(c.children,e,f,b);case za:g=8;e|=8;break;case Aa:return a=Bg(12,c,b,e|2),a.elementType=Aa,a.lanes=f,a;case Ea:return a=Bg(13,c,b,e),a.elementType=Ea,a.lanes=f,a;case Fa:return a=Bg(19,c,b,e),a.elementType=Fa,a.lanes=f,a;case Ia:return qj(c,e,f,b);default:if(\"object\"===typeof a&&null!==a)switch(a.$$typeof){case Ba:g=10;break a;case Ca:g=9;break a;case Da:g=11;\nbreak a;case Ga:g=14;break a;case Ha:g=16;d=null;break a}throw Error(p(130,null==a?a:typeof a,\"\"));}b=Bg(g,c,b,e);b.elementType=a;b.type=d;b.lanes=f;return b}function Ah(a,b,c,d){a=Bg(7,a,d,b);a.lanes=c;return a}function qj(a,b,c,d){a=Bg(22,a,d,b);a.elementType=Ia;a.lanes=c;a.stateNode={isHidden:!1};return a}function xh(a,b,c){a=Bg(6,a,null,b);a.lanes=c;return a}\nfunction zh(a,b,c){b=Bg(4,null!==a.children?a.children:[],a.key,b);b.lanes=c;b.stateNode={containerInfo:a.containerInfo,pendingChildren:null,implementation:a.implementation};return b}\nfunction bl(a,b,c,d,e){this.tag=b;this.containerInfo=a;this.finishedWork=this.pingCache=this.current=this.pendingChildren=null;this.timeoutHandle=-1;this.callbackNode=this.pendingContext=this.context=null;this.callbackPriority=0;this.eventTimes=zc(0);this.expirationTimes=zc(-1);this.entangledLanes=this.finishedLanes=this.mutableReadLanes=this.expiredLanes=this.pingedLanes=this.suspendedLanes=this.pendingLanes=0;this.entanglements=zc(0);this.identifierPrefix=d;this.onRecoverableError=e;this.mutableSourceEagerHydrationData=\nnull}function cl(a,b,c,d,e,f,g,h,k){a=new bl(a,b,c,h,k);1===b?(b=1,!0===f&&(b|=8)):b=0;f=Bg(3,null,null,b);a.current=f;f.stateNode=a;f.memoizedState={element:d,isDehydrated:c,cache:null,transitions:null,pendingSuspenseBoundaries:null};ah(f);return a}function dl(a,b,c){var d=3<arguments.length&&void 0!==arguments[3]?arguments[3]:null;return{$$typeof:wa,key:null==d?null:\"\"+d,children:a,containerInfo:b,implementation:c}}\nfunction el(a){if(!a)return Vf;a=a._reactInternals;a:{if(Vb(a)!==a||1!==a.tag)throw Error(p(170));var b=a;do{switch(b.tag){case 3:b=b.stateNode.context;break a;case 1:if(Zf(b.type)){b=b.stateNode.__reactInternalMemoizedMergedChildContext;break a}}b=b.return}while(null!==b);throw Error(p(171));}if(1===a.tag){var c=a.type;if(Zf(c))return bg(a,c,b)}return b}\nfunction fl(a,b,c,d,e,f,g,h,k){a=cl(c,d,!0,a,e,f,g,h,k);a.context=el(null);c=a.current;d=L();e=lh(c);f=ch(d,e);f.callback=void 0!==b&&null!==b?b:null;dh(c,f,e);a.current.lanes=e;Ac(a,e,d);Ek(a,d);return a}function gl(a,b,c,d){var e=b.current,f=L(),g=lh(e);c=el(c);null===b.context?b.context=c:b.pendingContext=c;b=ch(f,g);b.payload={element:a};d=void 0===d?null:d;null!==d&&(b.callback=d);a=dh(e,b,g);null!==a&&(mh(a,e,g,f),eh(a,e,g));return g}\nfunction hl(a){a=a.current;if(!a.child)return null;switch(a.child.tag){case 5:return a.child.stateNode;default:return a.child.stateNode}}function il(a,b){a=a.memoizedState;if(null!==a&&null!==a.dehydrated){var c=a.retryLane;a.retryLane=0!==c&&c<b?c:b}}function jl(a,b){il(a,b);(a=a.alternate)&&il(a,b)}function kl(){return null}var ll=\"function\"===typeof reportError?reportError:function(a){console.error(a)};function ml(a){this._internalRoot=a}\nnl.prototype.render=ml.prototype.render=function(a){var b=this._internalRoot;if(null===b)throw Error(p(409));gl(a,b,null,null)};nl.prototype.unmount=ml.prototype.unmount=function(){var a=this._internalRoot;if(null!==a){this._internalRoot=null;var b=a.containerInfo;Sk(function(){gl(null,a,null,null)});b[uf]=null}};function nl(a){this._internalRoot=a}\nnl.prototype.unstable_scheduleHydration=function(a){if(a){var b=Hc();a={blockedOn:null,target:a,priority:b};for(var c=0;c<Qc.length&&0!==b&&b<Qc[c].priority;c++);Qc.splice(c,0,a);0===c&&Vc(a)}};function ol(a){return!(!a||1!==a.nodeType&&9!==a.nodeType&&11!==a.nodeType)}function pl(a){return!(!a||1!==a.nodeType&&9!==a.nodeType&&11!==a.nodeType&&(8!==a.nodeType||\" react-mount-point-unstable \"!==a.nodeValue))}function ql(){}\nfunction rl(a,b,c,d,e){if(e){if(\"function\"===typeof d){var f=d;d=function(){var a=hl(g);f.call(a)}}var g=fl(b,d,a,0,null,!1,!1,\"\",ql);a._reactRootContainer=g;a[uf]=g.current;sf(8===a.nodeType?a.parentNode:a);Sk();return g}for(;e=a.lastChild;)a.removeChild(e);if(\"function\"===typeof d){var h=d;d=function(){var a=hl(k);h.call(a)}}var k=cl(a,0,!1,null,null,!1,!1,\"\",ql);a._reactRootContainer=k;a[uf]=k.current;sf(8===a.nodeType?a.parentNode:a);Sk(function(){gl(b,k,c,d)});return k}\nfunction sl(a,b,c,d,e){var f=c._reactRootContainer;if(f){var g=f;if(\"function\"===typeof e){var h=e;e=function(){var a=hl(g);h.call(a)}}gl(b,g,a,e)}else g=rl(c,b,a,e,d);return hl(g)}Ec=function(a){switch(a.tag){case 3:var b=a.stateNode;if(b.current.memoizedState.isDehydrated){var c=tc(b.pendingLanes);0!==c&&(Cc(b,c|1),Ek(b,B()),0===(K&6)&&(Hj=B()+500,jg()))}break;case 13:Sk(function(){var b=Zg(a,1);if(null!==b){var c=L();mh(b,a,1,c)}}),jl(a,1)}};\nFc=function(a){if(13===a.tag){var b=Zg(a,134217728);if(null!==b){var c=L();mh(b,a,134217728,c)}jl(a,134217728)}};Gc=function(a){if(13===a.tag){var b=lh(a),c=Zg(a,b);if(null!==c){var d=L();mh(c,a,b,d)}jl(a,b)}};Hc=function(){return C};Ic=function(a,b){var c=C;try{return C=a,b()}finally{C=c}};\nyb=function(a,b,c){switch(b){case \"input\":bb(a,c);b=c.name;if(\"radio\"===c.type&&null!=b){for(c=a;c.parentNode;)c=c.parentNode;c=c.querySelectorAll(\"input[name=\"+JSON.stringify(\"\"+b)+'][type=\"radio\"]');for(b=0;b<c.length;b++){var d=c[b];if(d!==a&&d.form===a.form){var e=Db(d);if(!e)throw Error(p(90));Wa(d);bb(d,e)}}}break;case \"textarea\":ib(a,c);break;case \"select\":b=c.value,null!=b&&fb(a,!!c.multiple,b,!1)}};Gb=Rk;Hb=Sk;\nvar tl={usingClientEntryPoint:!1,Events:[Cb,ue,Db,Eb,Fb,Rk]},ul={findFiberByHostInstance:Wc,bundleType:0,version:\"18.2.0\",rendererPackageName:\"react-dom\"};\nvar vl={bundleType:ul.bundleType,version:ul.version,rendererPackageName:ul.rendererPackageName,rendererConfig:ul.rendererConfig,overrideHookState:null,overrideHookStateDeletePath:null,overrideHookStateRenamePath:null,overrideProps:null,overridePropsDeletePath:null,overridePropsRenamePath:null,setErrorHandler:null,setSuspenseHandler:null,scheduleUpdate:null,currentDispatcherRef:ua.ReactCurrentDispatcher,findHostInstanceByFiber:function(a){a=Zb(a);return null===a?null:a.stateNode},findFiberByHostInstance:ul.findFiberByHostInstance||\nkl,findHostInstancesForRefresh:null,scheduleRefresh:null,scheduleRoot:null,setRefreshHandler:null,getCurrentFiber:null,reconcilerVersion:\"18.2.0-next-9e3b772b8-20220608\"};if(\"undefined\"!==typeof __REACT_DEVTOOLS_GLOBAL_HOOK__){var wl=__REACT_DEVTOOLS_GLOBAL_HOOK__;if(!wl.isDisabled&&wl.supportsFiber)try{kc=wl.inject(vl),lc=wl}catch(a){}}exports.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED=tl;\nexports.createPortal=function(a,b){var c=2<arguments.length&&void 0!==arguments[2]?arguments[2]:null;if(!ol(b))throw Error(p(200));return dl(a,b,null,c)};exports.createRoot=function(a,b){if(!ol(a))throw Error(p(299));var c=!1,d=\"\",e=ll;null!==b&&void 0!==b&&(!0===b.unstable_strictMode&&(c=!0),void 0!==b.identifierPrefix&&(d=b.identifierPrefix),void 0!==b.onRecoverableError&&(e=b.onRecoverableError));b=cl(a,1,!1,null,null,c,!1,d,e);a[uf]=b.current;sf(8===a.nodeType?a.parentNode:a);return new ml(b)};\nexports.findDOMNode=function(a){if(null==a)return null;if(1===a.nodeType)return a;var b=a._reactInternals;if(void 0===b){if(\"function\"===typeof a.render)throw Error(p(188));a=Object.keys(a).join(\",\");throw Error(p(268,a));}a=Zb(b);a=null===a?null:a.stateNode;return a};exports.flushSync=function(a){return Sk(a)};exports.hydrate=function(a,b,c){if(!pl(b))throw Error(p(200));return sl(null,a,b,!0,c)};\nexports.hydrateRoot=function(a,b,c){if(!ol(a))throw Error(p(405));var d=null!=c&&c.hydratedSources||null,e=!1,f=\"\",g=ll;null!==c&&void 0!==c&&(!0===c.unstable_strictMode&&(e=!0),void 0!==c.identifierPrefix&&(f=c.identifierPrefix),void 0!==c.onRecoverableError&&(g=c.onRecoverableError));b=fl(b,null,a,1,null!=c?c:null,e,!1,f,g);a[uf]=b.current;sf(a);if(d)for(a=0;a<d.length;a++)c=d[a],e=c._getVersion,e=e(c._source),null==b.mutableSourceEagerHydrationData?b.mutableSourceEagerHydrationData=[c,e]:b.mutableSourceEagerHydrationData.push(c,\ne);return new nl(b)};exports.render=function(a,b,c){if(!pl(b))throw Error(p(200));return sl(null,a,b,!1,c)};exports.unmountComponentAtNode=function(a){if(!pl(a))throw Error(p(40));return a._reactRootContainer?(Sk(function(){sl(null,null,a,!1,function(){a._reactRootContainer=null;a[uf]=null})}),!0):!1};exports.unstable_batchedUpdates=Rk;\nexports.unstable_renderSubtreeIntoContainer=function(a,b,c,d){if(!pl(c))throw Error(p(200));if(null==a||void 0===a._reactInternals)throw Error(p(38));return sl(a,b,c,!1,d)};exports.version=\"18.2.0-next-9e3b772b8-20220608\";\n","'use strict';\n\nvar m = require('react-dom');\nif (process.env.NODE_ENV === 'production') {\n  exports.createRoot = m.createRoot;\n  exports.hydrateRoot = m.hydrateRoot;\n} else {\n  var i = m.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED;\n  exports.createRoot = function(c, o) {\n    i.usingClientEntryPoint = true;\n    try {\n      return m.createRoot(c, o);\n    } finally {\n      i.usingClientEntryPoint = false;\n    }\n  };\n  exports.hydrateRoot = function(c, h, o) {\n    i.usingClientEntryPoint = true;\n    try {\n      return m.hydrateRoot(c, h, o);\n    } finally {\n      i.usingClientEntryPoint = false;\n    }\n  };\n}\n","'use strict';\n\nfunction checkDCE() {\n  /* global __REACT_DEVTOOLS_GLOBAL_HOOK__ */\n  if (\n    typeof __REACT_DEVTOOLS_GLOBAL_HOOK__ === 'undefined' ||\n    typeof __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE !== 'function'\n  ) {\n    return;\n  }\n  if (process.env.NODE_ENV !== 'production') {\n    // This branch is unreachable because this function is only called\n    // in production, but the condition is true only in development.\n    // Therefore if the branch is still here, dead code elimination wasn't\n    // properly applied.\n    // Don't change the message. React DevTools relies on it. Also make sure\n    // this message doesn't occur elsewhere in this function, or it will cause\n    // a false positive.\n    throw new Error('^_^');\n  }\n  try {\n    // Verify that the code above has been dead code eliminated (DCE'd).\n    __REACT_DEVTOOLS_GLOBAL_HOOK__.checkDCE(checkDCE);\n  } catch (err) {\n    // DevTools shouldn't crash React, no matter what.\n    // We should still report in case we break this code.\n    console.error(err);\n  }\n}\n\nif (process.env.NODE_ENV === 'production') {\n  // DCE check should happen before ReactDOM bundle executes so that\n  // DevTools can report bad minification during injection.\n  checkDCE();\n  module.exports = require('./cjs/react-dom.production.min.js');\n} else {\n  module.exports = require('./cjs/react-dom.development.js');\n}\n","import type {\n  FormEncType,\n  HTMLFormMethod,\n  RelativeRoutingType,\n} from \"@remix-run/router\";\nimport { stripBasename, UNSAFE_warning as warning } from \"@remix-run/router\";\n\nexport const defaultMethod: HTMLFormMethod = \"get\";\nconst defaultEncType: FormEncType = \"application/x-www-form-urlencoded\";\n\nexport function isHtmlElement(object: any): object is HTMLElement {\n  return object != null && typeof object.tagName === \"string\";\n}\n\nexport function isButtonElement(object: any): object is HTMLButtonElement {\n  return isHtmlElement(object) && object.tagName.toLowerCase() === \"button\";\n}\n\nexport function isFormElement(object: any): object is HTMLFormElement {\n  return isHtmlElement(object) && object.tagName.toLowerCase() === \"form\";\n}\n\nexport function isInputElement(object: any): object is HTMLInputElement {\n  return isHtmlElement(object) && object.tagName.toLowerCase() === \"input\";\n}\n\ntype LimitedMouseEvent = Pick<\n  MouseEvent,\n  \"button\" | \"metaKey\" | \"altKey\" | \"ctrlKey\" | \"shiftKey\"\n>;\n\nfunction isModifiedEvent(event: LimitedMouseEvent) {\n  return !!(event.metaKey || event.altKey || event.ctrlKey || event.shiftKey);\n}\n\nexport function shouldProcessLinkClick(\n  event: LimitedMouseEvent,\n  target?: string\n) {\n  return (\n    event.button === 0 && // Ignore everything but left clicks\n    (!target || target === \"_self\") && // Let browser handle \"target=_blank\" etc.\n    !isModifiedEvent(event) // Ignore clicks with modifier keys\n  );\n}\n\nexport type ParamKeyValuePair = [string, string];\n\nexport type URLSearchParamsInit =\n  | string\n  | ParamKeyValuePair[]\n  | Record<string, string | string[]>\n  | URLSearchParams;\n\n/**\n * Creates a URLSearchParams object using the given initializer.\n *\n * This is identical to `new URLSearchParams(init)` except it also\n * supports arrays as values in the object form of the initializer\n * instead of just strings. This is convenient when you need multiple\n * values for a given key, but don't want to use an array initializer.\n *\n * For example, instead of:\n *\n *   let searchParams = new URLSearchParams([\n *     ['sort', 'name'],\n *     ['sort', 'price']\n *   ]);\n *\n * you can do:\n *\n *   let searchParams = createSearchParams({\n *     sort: ['name', 'price']\n *   });\n */\nexport function createSearchParams(\n  init: URLSearchParamsInit = \"\"\n): URLSearchParams {\n  return new URLSearchParams(\n    typeof init === \"string\" ||\n    Array.isArray(init) ||\n    init instanceof URLSearchParams\n      ? init\n      : Object.keys(init).reduce((memo, key) => {\n          let value = init[key];\n          return memo.concat(\n            Array.isArray(value) ? value.map((v) => [key, v]) : [[key, value]]\n          );\n        }, [] as ParamKeyValuePair[])\n  );\n}\n\nexport function getSearchParamsForLocation(\n  locationSearch: string,\n  defaultSearchParams: URLSearchParams | null\n) {\n  let searchParams = createSearchParams(locationSearch);\n\n  if (defaultSearchParams) {\n    // Use `defaultSearchParams.forEach(...)` here instead of iterating of\n    // `defaultSearchParams.keys()` to work-around a bug in Firefox related to\n    // web extensions. Relevant Bugzilla tickets:\n    // https://bugzilla.mozilla.org/show_bug.cgi?id=1414602\n    // https://bugzilla.mozilla.org/show_bug.cgi?id=1023984\n    defaultSearchParams.forEach((_, key) => {\n      if (!searchParams.has(key)) {\n        defaultSearchParams.getAll(key).forEach((value) => {\n          searchParams.append(key, value);\n        });\n      }\n    });\n  }\n\n  return searchParams;\n}\n\n// Thanks https://github.com/sindresorhus/type-fest!\ntype JsonObject = { [Key in string]: JsonValue } & {\n  [Key in string]?: JsonValue | undefined;\n};\ntype JsonArray = JsonValue[] | readonly JsonValue[];\ntype JsonPrimitive = string | number | boolean | null;\ntype JsonValue = JsonPrimitive | JsonObject | JsonArray;\n\nexport type SubmitTarget =\n  | HTMLFormElement\n  | HTMLButtonElement\n  | HTMLInputElement\n  | FormData\n  | URLSearchParams\n  | JsonValue\n  | null;\n\n// One-time check for submitter support\nlet _formDataSupportsSubmitter: boolean | null = null;\n\nfunction isFormDataSubmitterSupported() {\n  if (_formDataSupportsSubmitter === null) {\n    try {\n      new FormData(\n        document.createElement(\"form\"),\n        // @ts-expect-error if FormData supports the submitter parameter, this will throw\n        0\n      );\n      _formDataSupportsSubmitter = false;\n    } catch (e) {\n      _formDataSupportsSubmitter = true;\n    }\n  }\n  return _formDataSupportsSubmitter;\n}\n\nexport interface SubmitOptions {\n  /**\n   * The HTTP method used to submit the form. Overrides `<form method>`.\n   * Defaults to \"GET\".\n   */\n  method?: HTMLFormMethod;\n\n  /**\n   * The action URL path used to submit the form. Overrides `<form action>`.\n   * Defaults to the path of the current route.\n   */\n  action?: string;\n\n  /**\n   * The encoding used to submit the form. Overrides `<form encType>`.\n   * Defaults to \"application/x-www-form-urlencoded\".\n   */\n  encType?: FormEncType;\n\n  /**\n   * Indicate a specific fetcherKey to use when using navigate=false\n   */\n  fetcherKey?: string;\n\n  /**\n   * navigate=false will use a fetcher instead of a navigation\n   */\n  navigate?: boolean;\n\n  /**\n   * Set `true` to replace the current entry in the browser's history stack\n   * instead of creating a new one (i.e. stay on \"the same page\"). Defaults\n   * to `false`.\n   */\n  replace?: boolean;\n\n  /**\n   * State object to add to the history stack entry for this navigation\n   */\n  state?: any;\n\n  /**\n   * Determines whether the form action is relative to the route hierarchy or\n   * the pathname.  Use this if you want to opt out of navigating the route\n   * hierarchy and want to instead route based on /-delimited URL segments\n   */\n  relative?: RelativeRoutingType;\n\n  /**\n   * In browser-based environments, prevent resetting scroll after this\n   * navigation when using the <ScrollRestoration> component\n   */\n  preventScrollReset?: boolean;\n\n  /**\n   * Enable flushSync for this navigation's state updates\n   */\n  unstable_flushSync?: boolean;\n\n  /**\n   * Enable view transitions on this submission navigation\n   */\n  unstable_viewTransition?: boolean;\n}\n\nconst supportedFormEncTypes: Set<FormEncType> = new Set([\n  \"application/x-www-form-urlencoded\",\n  \"multipart/form-data\",\n  \"text/plain\",\n]);\n\nfunction getFormEncType(encType: string | null) {\n  if (encType != null && !supportedFormEncTypes.has(encType as FormEncType)) {\n    warning(\n      false,\n      `\"${encType}\" is not a valid \\`encType\\` for \\`<Form>\\`/\\`<fetcher.Form>\\` ` +\n        `and will default to \"${defaultEncType}\"`\n    );\n\n    return null;\n  }\n  return encType;\n}\n\nexport function getFormSubmissionInfo(\n  target: SubmitTarget,\n  basename: string\n): {\n  action: string | null;\n  method: string;\n  encType: string;\n  formData: FormData | undefined;\n  body: any;\n} {\n  let method: string;\n  let action: string | null;\n  let encType: string;\n  let formData: FormData | undefined;\n  let body: any;\n\n  if (isFormElement(target)) {\n    // When grabbing the action from the element, it will have had the basename\n    // prefixed to ensure non-JS scenarios work, so strip it since we'll\n    // re-prefix in the router\n    let attr = target.getAttribute(\"action\");\n    action = attr ? stripBasename(attr, basename) : null;\n    method = target.getAttribute(\"method\") || defaultMethod;\n    encType = getFormEncType(target.getAttribute(\"enctype\")) || defaultEncType;\n\n    formData = new FormData(target);\n  } else if (\n    isButtonElement(target) ||\n    (isInputElement(target) &&\n      (target.type === \"submit\" || target.type === \"image\"))\n  ) {\n    let form = target.form;\n\n    if (form == null) {\n      throw new Error(\n        `Cannot submit a <button> or <input type=\"submit\"> without a <form>`\n      );\n    }\n\n    // <button>/<input type=\"submit\"> may override attributes of <form>\n\n    // When grabbing the action from the element, it will have had the basename\n    // prefixed to ensure non-JS scenarios work, so strip it since we'll\n    // re-prefix in the router\n    let attr = target.getAttribute(\"formaction\") || form.getAttribute(\"action\");\n    action = attr ? stripBasename(attr, basename) : null;\n\n    method =\n      target.getAttribute(\"formmethod\") ||\n      form.getAttribute(\"method\") ||\n      defaultMethod;\n    encType =\n      getFormEncType(target.getAttribute(\"formenctype\")) ||\n      getFormEncType(form.getAttribute(\"enctype\")) ||\n      defaultEncType;\n\n    // Build a FormData object populated from a form and submitter\n    formData = new FormData(form, target);\n\n    // If this browser doesn't support the `FormData(el, submitter)` format,\n    // then tack on the submitter value at the end.  This is a lightweight\n    // solution that is not 100% spec compliant.  For complete support in older\n    // browsers, consider using the `formdata-submitter-polyfill` package\n    if (!isFormDataSubmitterSupported()) {\n      let { name, type, value } = target;\n      if (type === \"image\") {\n        let prefix = name ? `${name}.` : \"\";\n        formData.append(`${prefix}x`, \"0\");\n        formData.append(`${prefix}y`, \"0\");\n      } else if (name) {\n        formData.append(name, value);\n      }\n    }\n  } else if (isHtmlElement(target)) {\n    throw new Error(\n      `Cannot submit element that is not <form>, <button>, or ` +\n        `<input type=\"submit|image\">`\n    );\n  } else {\n    method = defaultMethod;\n    action = null;\n    encType = defaultEncType;\n    body = target;\n  }\n\n  // Send body for <Form encType=\"text/plain\" so we encode it into text\n  if (formData && encType === \"text/plain\") {\n    body = formData;\n    formData = undefined;\n  }\n\n  return { action, method: method.toLowerCase(), encType, formData, body };\n}\n","/**\n * NOTE: If you refactor this to split up the modules into separate files,\n * you'll need to update the rollup config for react-router-dom-v5-compat.\n */\nimport * as React from \"react\";\nimport * as ReactDOM from \"react-dom\";\nimport type {\n  DataRouteObject,\n  FutureConfig,\n  Location,\n  NavigateOptions,\n  NavigationType,\n  Navigator,\n  RelativeRoutingType,\n  RouteObject,\n  RouterProviderProps,\n  To,\n} from \"react-router\";\nimport {\n  Router,\n  createPath,\n  useHref,\n  useLocation,\n  useMatches,\n  useNavigate,\n  useNavigation,\n  useResolvedPath,\n  useBlocker,\n  UNSAFE_DataRouterContext as DataRouterContext,\n  UNSAFE_DataRouterStateContext as DataRouterStateContext,\n  UNSAFE_NavigationContext as NavigationContext,\n  UNSAFE_RouteContext as RouteContext,\n  UNSAFE_mapRouteProperties as mapRouteProperties,\n  UNSAFE_useRouteId as useRouteId,\n  UNSAFE_useRoutesImpl as useRoutesImpl,\n} from \"react-router\";\nimport type {\n  BrowserHistory,\n  Fetcher,\n  FormEncType,\n  FormMethod,\n  FutureConfig as RouterFutureConfig,\n  GetScrollRestorationKeyFunction,\n  HashHistory,\n  History,\n  HTMLFormMethod,\n  HydrationState,\n  Router as RemixRouter,\n  V7_FormMethod,\n  RouterState,\n  RouterSubscriber,\n  BlockerFunction,\n} from \"@remix-run/router\";\nimport {\n  createRouter,\n  createBrowserHistory,\n  createHashHistory,\n  joinPaths,\n  stripBasename,\n  UNSAFE_ErrorResponseImpl as ErrorResponseImpl,\n  UNSAFE_invariant as invariant,\n  UNSAFE_warning as warning,\n  matchPath,\n  IDLE_FETCHER,\n} from \"@remix-run/router\";\n\nimport type {\n  SubmitOptions,\n  ParamKeyValuePair,\n  URLSearchParamsInit,\n  SubmitTarget,\n} from \"./dom\";\nimport {\n  createSearchParams,\n  defaultMethod,\n  getFormSubmissionInfo,\n  getSearchParamsForLocation,\n  shouldProcessLinkClick,\n} from \"./dom\";\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Re-exports\n////////////////////////////////////////////////////////////////////////////////\n\nexport type {\n  FormEncType,\n  FormMethod,\n  GetScrollRestorationKeyFunction,\n  ParamKeyValuePair,\n  SubmitOptions,\n  URLSearchParamsInit,\n  V7_FormMethod,\n};\nexport { createSearchParams };\n\n// Note: Keep in sync with react-router exports!\nexport type {\n  ActionFunction,\n  ActionFunctionArgs,\n  AwaitProps,\n  Blocker,\n  BlockerFunction,\n  DataRouteMatch,\n  DataRouteObject,\n  ErrorResponse,\n  Fetcher,\n  FutureConfig,\n  Hash,\n  IndexRouteObject,\n  IndexRouteProps,\n  JsonFunction,\n  LazyRouteFunction,\n  LayoutRouteProps,\n  LoaderFunction,\n  LoaderFunctionArgs,\n  Location,\n  MemoryRouterProps,\n  NavigateFunction,\n  NavigateOptions,\n  NavigateProps,\n  Navigation,\n  Navigator,\n  NonIndexRouteObject,\n  OutletProps,\n  Params,\n  ParamParseKey,\n  Path,\n  PathMatch,\n  Pathname,\n  PathParam,\n  PathPattern,\n  PathRouteProps,\n  RedirectFunction,\n  RelativeRoutingType,\n  RouteMatch,\n  RouteObject,\n  RouteProps,\n  RouterProps,\n  RouterProviderProps,\n  RoutesProps,\n  Search,\n  ShouldRevalidateFunction,\n  ShouldRevalidateFunctionArgs,\n  To,\n  UIMatch,\n} from \"react-router\";\nexport {\n  AbortedDeferredError,\n  Await,\n  MemoryRouter,\n  Navigate,\n  NavigationType,\n  Outlet,\n  Route,\n  Router,\n  Routes,\n  createMemoryRouter,\n  createPath,\n  createRoutesFromChildren,\n  createRoutesFromElements,\n  defer,\n  isRouteErrorResponse,\n  generatePath,\n  json,\n  matchPath,\n  matchRoutes,\n  parsePath,\n  redirect,\n  redirectDocument,\n  renderMatches,\n  resolvePath,\n  useActionData,\n  useAsyncError,\n  useAsyncValue,\n  useBlocker,\n  useHref,\n  useInRouterContext,\n  useLoaderData,\n  useLocation,\n  useMatch,\n  useMatches,\n  useNavigate,\n  useNavigation,\n  useNavigationType,\n  useOutlet,\n  useOutletContext,\n  useParams,\n  useResolvedPath,\n  useRevalidator,\n  useRouteError,\n  useRouteLoaderData,\n  useRoutes,\n} from \"react-router\";\n\n///////////////////////////////////////////////////////////////////////////////\n// DANGER! PLEASE READ ME!\n// We provide these exports as an escape hatch in the event that you need any\n// routing data that we don't provide an explicit API for. With that said, we\n// want to cover your use case if we can, so if you feel the need to use these\n// we want to hear from you. Let us know what you're building and we'll do our\n// best to make sure we can support you!\n//\n// We consider these exports an implementation detail and do not guarantee\n// against any breaking changes, regardless of the semver release. Use with\n// extreme caution and only if you understand the consequences. Godspeed.\n///////////////////////////////////////////////////////////////////////////////\n\n/** @internal */\nexport {\n  UNSAFE_DataRouterContext,\n  UNSAFE_DataRouterStateContext,\n  UNSAFE_NavigationContext,\n  UNSAFE_LocationContext,\n  UNSAFE_RouteContext,\n  UNSAFE_useRouteId,\n} from \"react-router\";\n//#endregion\n\ndeclare global {\n  var __staticRouterHydrationData: HydrationState | undefined;\n  var __reactRouterVersion: string;\n  interface Document {\n    startViewTransition(cb: () => Promise<void> | void): ViewTransition;\n  }\n}\n\n// HEY YOU! DON'T TOUCH THIS VARIABLE!\n//\n// It is replaced with the proper version at build time via a babel plugin in\n// the rollup config.\n//\n// Export a global property onto the window for React Router detection by the\n// Core Web Vitals Technology Report.  This way they can configure the `wappalyzer`\n// to detect and properly classify live websites as being built with React Router:\n// https://github.com/HTTPArchive/wappalyzer/blob/main/src/technologies/r.json\nconst REACT_ROUTER_VERSION = \"0\";\ntry {\n  window.__reactRouterVersion = REACT_ROUTER_VERSION;\n} catch (e) {\n  // no-op\n}\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Routers\n////////////////////////////////////////////////////////////////////////////////\n\ninterface DOMRouterOpts {\n  basename?: string;\n  future?: Partial<Omit<RouterFutureConfig, \"v7_prependBasename\">>;\n  hydrationData?: HydrationState;\n  window?: Window;\n}\n\nexport function createBrowserRouter(\n  routes: RouteObject[],\n  opts?: DOMRouterOpts\n): RemixRouter {\n  return createRouter({\n    basename: opts?.basename,\n    future: {\n      ...opts?.future,\n      v7_prependBasename: true,\n    },\n    history: createBrowserHistory({ window: opts?.window }),\n    hydrationData: opts?.hydrationData || parseHydrationData(),\n    routes,\n    mapRouteProperties,\n    window: opts?.window,\n  }).initialize();\n}\n\nexport function createHashRouter(\n  routes: RouteObject[],\n  opts?: DOMRouterOpts\n): RemixRouter {\n  return createRouter({\n    basename: opts?.basename,\n    future: {\n      ...opts?.future,\n      v7_prependBasename: true,\n    },\n    history: createHashHistory({ window: opts?.window }),\n    hydrationData: opts?.hydrationData || parseHydrationData(),\n    routes,\n    mapRouteProperties,\n    window: opts?.window,\n  }).initialize();\n}\n\nfunction parseHydrationData(): HydrationState | undefined {\n  let state = window?.__staticRouterHydrationData;\n  if (state && state.errors) {\n    state = {\n      ...state,\n      errors: deserializeErrors(state.errors),\n    };\n  }\n  return state;\n}\n\nfunction deserializeErrors(\n  errors: RemixRouter[\"state\"][\"errors\"]\n): RemixRouter[\"state\"][\"errors\"] {\n  if (!errors) return null;\n  let entries = Object.entries(errors);\n  let serialized: RemixRouter[\"state\"][\"errors\"] = {};\n  for (let [key, val] of entries) {\n    // Hey you!  If you change this, please change the corresponding logic in\n    // serializeErrors in react-router-dom/server.tsx :)\n    if (val && val.__type === \"RouteErrorResponse\") {\n      serialized[key] = new ErrorResponseImpl(\n        val.status,\n        val.statusText,\n        val.data,\n        val.internal === true\n      );\n    } else if (val && val.__type === \"Error\") {\n      // Attempt to reconstruct the right type of Error (i.e., ReferenceError)\n      if (val.__subType) {\n        let ErrorConstructor = window[val.__subType];\n        if (typeof ErrorConstructor === \"function\") {\n          try {\n            // @ts-expect-error\n            let error = new ErrorConstructor(val.message);\n            // Wipe away the client-side stack trace.  Nothing to fill it in with\n            // because we don't serialize SSR stack traces for security reasons\n            error.stack = \"\";\n            serialized[key] = error;\n          } catch (e) {\n            // no-op - fall through and create a normal Error\n          }\n        }\n      }\n\n      if (serialized[key] == null) {\n        let error = new Error(val.message);\n        // Wipe away the client-side stack trace.  Nothing to fill it in with\n        // because we don't serialize SSR stack traces for security reasons\n        error.stack = \"\";\n        serialized[key] = error;\n      }\n    } else {\n      serialized[key] = val;\n    }\n  }\n  return serialized;\n}\n\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Contexts\n////////////////////////////////////////////////////////////////////////////////\n\ntype ViewTransitionContextObject =\n  | {\n      isTransitioning: false;\n    }\n  | {\n      isTransitioning: true;\n      flushSync: boolean;\n      currentLocation: Location;\n      nextLocation: Location;\n    };\n\nconst ViewTransitionContext = React.createContext<ViewTransitionContextObject>({\n  isTransitioning: false,\n});\nif (__DEV__) {\n  ViewTransitionContext.displayName = \"ViewTransition\";\n}\n\nexport { ViewTransitionContext as UNSAFE_ViewTransitionContext };\n\n// TODO: (v7) Change the useFetcher data from `any` to `unknown`\ntype FetchersContextObject = Map<string, any>;\n\nconst FetchersContext = React.createContext<FetchersContextObject>(new Map());\nif (__DEV__) {\n  FetchersContext.displayName = \"Fetchers\";\n}\n\nexport { FetchersContext as UNSAFE_FetchersContext };\n\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Components\n////////////////////////////////////////////////////////////////////////////////\n\n/**\n  Webpack + React 17 fails to compile on any of the following because webpack\n  complains that `startTransition` doesn't exist in `React`:\n  * import { startTransition } from \"react\"\n  * import * as React from from \"react\";\n    \"startTransition\" in React ? React.startTransition(() => setState()) : setState()\n  * import * as React from from \"react\";\n    \"startTransition\" in React ? React[\"startTransition\"](() => setState()) : setState()\n\n  Moving it to a constant such as the following solves the Webpack/React 17 issue:\n  * import * as React from from \"react\";\n    const START_TRANSITION = \"startTransition\";\n    START_TRANSITION in React ? React[START_TRANSITION](() => setState()) : setState()\n\n  However, that introduces webpack/terser minification issues in production builds\n  in React 18 where minification/obfuscation ends up removing the call of\n  React.startTransition entirely from the first half of the ternary.  Grabbing\n  this exported reference once up front resolves that issue.\n\n  See https://github.com/remix-run/react-router/issues/10579\n*/\nconst START_TRANSITION = \"startTransition\";\nconst startTransitionImpl = React[START_TRANSITION];\nconst FLUSH_SYNC = \"flushSync\";\nconst flushSyncImpl = ReactDOM[FLUSH_SYNC];\nconst USE_ID = \"useId\";\nconst useIdImpl = React[USE_ID];\n\nfunction startTransitionSafe(cb: () => void) {\n  if (startTransitionImpl) {\n    startTransitionImpl(cb);\n  } else {\n    cb();\n  }\n}\n\nfunction flushSyncSafe(cb: () => void) {\n  if (flushSyncImpl) {\n    flushSyncImpl(cb);\n  } else {\n    cb();\n  }\n}\n\ninterface ViewTransition {\n  finished: Promise<void>;\n  ready: Promise<void>;\n  updateCallbackDone: Promise<void>;\n  skipTransition(): void;\n}\n\nclass Deferred<T> {\n  status: \"pending\" | \"resolved\" | \"rejected\" = \"pending\";\n  promise: Promise<T>;\n  // @ts-expect-error - no initializer\n  resolve: (value: T) => void;\n  // @ts-expect-error - no initializer\n  reject: (reason?: unknown) => void;\n  constructor() {\n    this.promise = new Promise((resolve, reject) => {\n      this.resolve = (value) => {\n        if (this.status === \"pending\") {\n          this.status = \"resolved\";\n          resolve(value);\n        }\n      };\n      this.reject = (reason) => {\n        if (this.status === \"pending\") {\n          this.status = \"rejected\";\n          reject(reason);\n        }\n      };\n    });\n  }\n}\n\n/**\n * Given a Remix Router instance, render the appropriate UI\n */\nexport function RouterProvider({\n  fallbackElement,\n  router,\n  future,\n}: RouterProviderProps): React.ReactElement {\n  let [state, setStateImpl] = React.useState(router.state);\n  let [pendingState, setPendingState] = React.useState<RouterState>();\n  let [vtContext, setVtContext] = React.useState<ViewTransitionContextObject>({\n    isTransitioning: false,\n  });\n  let [renderDfd, setRenderDfd] = React.useState<Deferred<void>>();\n  let [transition, setTransition] = React.useState<ViewTransition>();\n  let [interruption, setInterruption] = React.useState<{\n    state: RouterState;\n    currentLocation: Location;\n    nextLocation: Location;\n  }>();\n  let fetcherData = React.useRef<Map<string, any>>(new Map());\n  let { v7_startTransition } = future || {};\n\n  let optInStartTransition = React.useCallback(\n    (cb: () => void) => {\n      if (v7_startTransition) {\n        startTransitionSafe(cb);\n      } else {\n        cb();\n      }\n    },\n    [v7_startTransition]\n  );\n\n  let setState = React.useCallback<RouterSubscriber>(\n    (\n      newState: RouterState,\n      {\n        deletedFetchers,\n        unstable_flushSync: flushSync,\n        unstable_viewTransitionOpts: viewTransitionOpts,\n      }\n    ) => {\n      deletedFetchers.forEach((key) => fetcherData.current.delete(key));\n      newState.fetchers.forEach((fetcher, key) => {\n        if (fetcher.data !== undefined) {\n          fetcherData.current.set(key, fetcher.data);\n        }\n      });\n\n      let isViewTransitionUnavailable =\n        router.window == null ||\n        typeof router.window.document.startViewTransition !== \"function\";\n\n      // If this isn't a view transition or it's not available in this browser,\n      // just update and be done with it\n      if (!viewTransitionOpts || isViewTransitionUnavailable) {\n        if (flushSync) {\n          flushSyncSafe(() => setStateImpl(newState));\n        } else {\n          optInStartTransition(() => setStateImpl(newState));\n        }\n        return;\n      }\n\n      // flushSync + startViewTransition\n      if (flushSync) {\n        // Flush through the context to mark DOM elements as transition=ing\n        flushSyncSafe(() => {\n          // Cancel any pending transitions\n          if (transition) {\n            renderDfd && renderDfd.resolve();\n            transition.skipTransition();\n          }\n          setVtContext({\n            isTransitioning: true,\n            flushSync: true,\n            currentLocation: viewTransitionOpts.currentLocation,\n            nextLocation: viewTransitionOpts.nextLocation,\n          });\n        });\n\n        // Update the DOM\n        let t = router.window!.document.startViewTransition(() => {\n          flushSyncSafe(() => setStateImpl(newState));\n        });\n\n        // Clean up after the animation completes\n        t.finished.finally(() => {\n          flushSyncSafe(() => {\n            setRenderDfd(undefined);\n            setTransition(undefined);\n            setPendingState(undefined);\n            setVtContext({ isTransitioning: false });\n          });\n        });\n\n        flushSyncSafe(() => setTransition(t));\n        return;\n      }\n\n      // startTransition + startViewTransition\n      if (transition) {\n        // Interrupting an in-progress transition, cancel and let everything flush\n        // out, and then kick off a new transition from the interruption state\n        renderDfd && renderDfd.resolve();\n        transition.skipTransition();\n        setInterruption({\n          state: newState,\n          currentLocation: viewTransitionOpts.currentLocation,\n          nextLocation: viewTransitionOpts.nextLocation,\n        });\n      } else {\n        // Completed navigation update with opted-in view transitions, let 'er rip\n        setPendingState(newState);\n        setVtContext({\n          isTransitioning: true,\n          flushSync: false,\n          currentLocation: viewTransitionOpts.currentLocation,\n          nextLocation: viewTransitionOpts.nextLocation,\n        });\n      }\n    },\n    [router.window, transition, renderDfd, fetcherData, optInStartTransition]\n  );\n\n  // Need to use a layout effect here so we are subscribed early enough to\n  // pick up on any render-driven redirects/navigations (useEffect/<Navigate>)\n  React.useLayoutEffect(() => router.subscribe(setState), [router, setState]);\n\n  // When we start a view transition, create a Deferred we can use for the\n  // eventual \"completed\" render\n  React.useEffect(() => {\n    if (vtContext.isTransitioning && !vtContext.flushSync) {\n      setRenderDfd(new Deferred<void>());\n    }\n  }, [vtContext]);\n\n  // Once the deferred is created, kick off startViewTransition() to update the\n  // DOM and then wait on the Deferred to resolve (indicating the DOM update has\n  // happened)\n  React.useEffect(() => {\n    if (renderDfd && pendingState && router.window) {\n      let newState = pendingState;\n      let renderPromise = renderDfd.promise;\n      let transition = router.window.document.startViewTransition(async () => {\n        optInStartTransition(() => setStateImpl(newState));\n        await renderPromise;\n      });\n      transition.finished.finally(() => {\n        setRenderDfd(undefined);\n        setTransition(undefined);\n        setPendingState(undefined);\n        setVtContext({ isTransitioning: false });\n      });\n      setTransition(transition);\n    }\n  }, [optInStartTransition, pendingState, renderDfd, router.window]);\n\n  // When the new location finally renders and is committed to the DOM, this\n  // effect will run to resolve the transition\n  React.useEffect(() => {\n    if (\n      renderDfd &&\n      pendingState &&\n      state.location.key === pendingState.location.key\n    ) {\n      renderDfd.resolve();\n    }\n  }, [renderDfd, transition, state.location, pendingState]);\n\n  // If we get interrupted with a new navigation during a transition, we skip\n  // the active transition, let it cleanup, then kick it off again here\n  React.useEffect(() => {\n    if (!vtContext.isTransitioning && interruption) {\n      setPendingState(interruption.state);\n      setVtContext({\n        isTransitioning: true,\n        flushSync: false,\n        currentLocation: interruption.currentLocation,\n        nextLocation: interruption.nextLocation,\n      });\n      setInterruption(undefined);\n    }\n  }, [vtContext.isTransitioning, interruption]);\n\n  React.useEffect(() => {\n    warning(\n      fallbackElement == null || !router.future.v7_partialHydration,\n      \"`<RouterProvider fallbackElement>` is deprecated when using \" +\n        \"`v7_partialHydration`, use a `HydrateFallback` component instead\"\n    );\n    // Only log this once on initial mount\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n  }, []);\n\n  let navigator = React.useMemo((): Navigator => {\n    return {\n      createHref: router.createHref,\n      encodeLocation: router.encodeLocation,\n      go: (n) => router.navigate(n),\n      push: (to, state, opts) =>\n        router.navigate(to, {\n          state,\n          preventScrollReset: opts?.preventScrollReset,\n        }),\n      replace: (to, state, opts) =>\n        router.navigate(to, {\n          replace: true,\n          state,\n          preventScrollReset: opts?.preventScrollReset,\n        }),\n    };\n  }, [router]);\n\n  let basename = router.basename || \"/\";\n\n  let dataRouterContext = React.useMemo(\n    () => ({\n      router,\n      navigator,\n      static: false,\n      basename,\n    }),\n    [router, navigator, basename]\n  );\n\n  // The fragment and {null} here are important!  We need them to keep React 18's\n  // useId happy when we are server-rendering since we may have a <script> here\n  // containing the hydrated server-side staticContext (from StaticRouterProvider).\n  // useId relies on the component tree structure to generate deterministic id's\n  // so we need to ensure it remains the same on the client even though\n  // we don't need the <script> tag\n  return (\n    <>\n      <DataRouterContext.Provider value={dataRouterContext}>\n        <DataRouterStateContext.Provider value={state}>\n          <FetchersContext.Provider value={fetcherData.current}>\n            <ViewTransitionContext.Provider value={vtContext}>\n              <Router\n                basename={basename}\n                location={state.location}\n                navigationType={state.historyAction}\n                navigator={navigator}\n                future={{\n                  v7_relativeSplatPath: router.future.v7_relativeSplatPath,\n                }}\n              >\n                {state.initialized || router.future.v7_partialHydration ? (\n                  <DataRoutes\n                    routes={router.routes}\n                    future={router.future}\n                    state={state}\n                  />\n                ) : (\n                  fallbackElement\n                )}\n              </Router>\n            </ViewTransitionContext.Provider>\n          </FetchersContext.Provider>\n        </DataRouterStateContext.Provider>\n      </DataRouterContext.Provider>\n      {null}\n    </>\n  );\n}\n\nfunction DataRoutes({\n  routes,\n  future,\n  state,\n}: {\n  routes: DataRouteObject[];\n  future: RemixRouter[\"future\"];\n  state: RouterState;\n}): React.ReactElement | null {\n  return useRoutesImpl(routes, undefined, state, future);\n}\n\nexport interface BrowserRouterProps {\n  basename?: string;\n  children?: React.ReactNode;\n  future?: Partial<FutureConfig>;\n  window?: Window;\n}\n\n/**\n * A `<Router>` for use in web browsers. Provides the cleanest URLs.\n */\nexport function BrowserRouter({\n  basename,\n  children,\n  future,\n  window,\n}: BrowserRouterProps) {\n  let historyRef = React.useRef<BrowserHistory>();\n  if (historyRef.current == null) {\n    historyRef.current = createBrowserHistory({ window, v5Compat: true });\n  }\n\n  let history = historyRef.current;\n  let [state, setStateImpl] = React.useState({\n    action: history.action,\n    location: history.location,\n  });\n  let { v7_startTransition } = future || {};\n  let setState = React.useCallback(\n    (newState: { action: NavigationType; location: Location }) => {\n      v7_startTransition && startTransitionImpl\n        ? startTransitionImpl(() => setStateImpl(newState))\n        : setStateImpl(newState);\n    },\n    [setStateImpl, v7_startTransition]\n  );\n\n  React.useLayoutEffect(() => history.listen(setState), [history, setState]);\n\n  return (\n    <Router\n      basename={basename}\n      children={children}\n      location={state.location}\n      navigationType={state.action}\n      navigator={history}\n      future={future}\n    />\n  );\n}\n\nexport interface HashRouterProps {\n  basename?: string;\n  children?: React.ReactNode;\n  future?: Partial<FutureConfig>;\n  window?: Window;\n}\n\n/**\n * A `<Router>` for use in web browsers. Stores the location in the hash\n * portion of the URL so it is not sent to the server.\n */\nexport function HashRouter({\n  basename,\n  children,\n  future,\n  window,\n}: HashRouterProps) {\n  let historyRef = React.useRef<HashHistory>();\n  if (historyRef.current == null) {\n    historyRef.current = createHashHistory({ window, v5Compat: true });\n  }\n\n  let history = historyRef.current;\n  let [state, setStateImpl] = React.useState({\n    action: history.action,\n    location: history.location,\n  });\n  let { v7_startTransition } = future || {};\n  let setState = React.useCallback(\n    (newState: { action: NavigationType; location: Location }) => {\n      v7_startTransition && startTransitionImpl\n        ? startTransitionImpl(() => setStateImpl(newState))\n        : setStateImpl(newState);\n    },\n    [setStateImpl, v7_startTransition]\n  );\n\n  React.useLayoutEffect(() => history.listen(setState), [history, setState]);\n\n  return (\n    <Router\n      basename={basename}\n      children={children}\n      location={state.location}\n      navigationType={state.action}\n      navigator={history}\n      future={future}\n    />\n  );\n}\n\nexport interface HistoryRouterProps {\n  basename?: string;\n  children?: React.ReactNode;\n  future?: FutureConfig;\n  history: History;\n}\n\n/**\n * A `<Router>` that accepts a pre-instantiated history object. It's important\n * to note that using your own history object is highly discouraged and may add\n * two versions of the history library to your bundles unless you use the same\n * version of the history library that React Router uses internally.\n */\nfunction HistoryRouter({\n  basename,\n  children,\n  future,\n  history,\n}: HistoryRouterProps) {\n  let [state, setStateImpl] = React.useState({\n    action: history.action,\n    location: history.location,\n  });\n  let { v7_startTransition } = future || {};\n  let setState = React.useCallback(\n    (newState: { action: NavigationType; location: Location }) => {\n      v7_startTransition && startTransitionImpl\n        ? startTransitionImpl(() => setStateImpl(newState))\n        : setStateImpl(newState);\n    },\n    [setStateImpl, v7_startTransition]\n  );\n\n  React.useLayoutEffect(() => history.listen(setState), [history, setState]);\n\n  return (\n    <Router\n      basename={basename}\n      children={children}\n      location={state.location}\n      navigationType={state.action}\n      navigator={history}\n      future={future}\n    />\n  );\n}\n\nif (__DEV__) {\n  HistoryRouter.displayName = \"unstable_HistoryRouter\";\n}\n\nexport { HistoryRouter as unstable_HistoryRouter };\n\nexport interface LinkProps\n  extends Omit<React.AnchorHTMLAttributes<HTMLAnchorElement>, \"href\"> {\n  reloadDocument?: boolean;\n  replace?: boolean;\n  state?: any;\n  preventScrollReset?: boolean;\n  relative?: RelativeRoutingType;\n  to: To;\n  unstable_viewTransition?: boolean;\n}\n\nconst isBrowser =\n  typeof window !== \"undefined\" &&\n  typeof window.document !== \"undefined\" &&\n  typeof window.document.createElement !== \"undefined\";\n\nconst ABSOLUTE_URL_REGEX = /^(?:[a-z][a-z0-9+.-]*:|\\/\\/)/i;\n\n/**\n * The public API for rendering a history-aware `<a>`.\n */\nexport const Link = React.forwardRef<HTMLAnchorElement, LinkProps>(\n  function LinkWithRef(\n    {\n      onClick,\n      relative,\n      reloadDocument,\n      replace,\n      state,\n      target,\n      to,\n      preventScrollReset,\n      unstable_viewTransition,\n      ...rest\n    },\n    ref\n  ) {\n    let { basename } = React.useContext(NavigationContext);\n\n    // Rendered into <a href> for absolute URLs\n    let absoluteHref;\n    let isExternal = false;\n\n    if (typeof to === \"string\" && ABSOLUTE_URL_REGEX.test(to)) {\n      // Render the absolute href server- and client-side\n      absoluteHref = to;\n\n      // Only check for external origins client-side\n      if (isBrowser) {\n        try {\n          let currentUrl = new URL(window.location.href);\n          let targetUrl = to.startsWith(\"//\")\n            ? new URL(currentUrl.protocol + to)\n            : new URL(to);\n          let path = stripBasename(targetUrl.pathname, basename);\n\n          if (targetUrl.origin === currentUrl.origin && path != null) {\n            // Strip the protocol/origin/basename for same-origin absolute URLs\n            to = path + targetUrl.search + targetUrl.hash;\n          } else {\n            isExternal = true;\n          }\n        } catch (e) {\n          // We can't do external URL detection without a valid URL\n          warning(\n            false,\n            `<Link to=\"${to}\"> contains an invalid URL which will probably break ` +\n              `when clicked - please update to a valid URL path.`\n          );\n        }\n      }\n    }\n\n    // Rendered into <a href> for relative URLs\n    let href = useHref(to, { relative });\n\n    let internalOnClick = useLinkClickHandler(to, {\n      replace,\n      state,\n      target,\n      preventScrollReset,\n      relative,\n      unstable_viewTransition,\n    });\n    function handleClick(\n      event: React.MouseEvent<HTMLAnchorElement, MouseEvent>\n    ) {\n      if (onClick) onClick(event);\n      if (!event.defaultPrevented) {\n        internalOnClick(event);\n      }\n    }\n\n    return (\n      // eslint-disable-next-line jsx-a11y/anchor-has-content\n      <a\n        {...rest}\n        href={absoluteHref || href}\n        onClick={isExternal || reloadDocument ? onClick : handleClick}\n        ref={ref}\n        target={target}\n      />\n    );\n  }\n);\n\nif (__DEV__) {\n  Link.displayName = \"Link\";\n}\n\ntype NavLinkRenderProps = {\n  isActive: boolean;\n  isPending: boolean;\n  isTransitioning: boolean;\n};\n\nexport interface NavLinkProps\n  extends Omit<LinkProps, \"className\" | \"style\" | \"children\"> {\n  children?: React.ReactNode | ((props: NavLinkRenderProps) => React.ReactNode);\n  caseSensitive?: boolean;\n  className?: string | ((props: NavLinkRenderProps) => string | undefined);\n  end?: boolean;\n  style?:\n    | React.CSSProperties\n    | ((props: NavLinkRenderProps) => React.CSSProperties | undefined);\n}\n\n/**\n * A `<Link>` wrapper that knows if it's \"active\" or not.\n */\nexport const NavLink = React.forwardRef<HTMLAnchorElement, NavLinkProps>(\n  function NavLinkWithRef(\n    {\n      \"aria-current\": ariaCurrentProp = \"page\",\n      caseSensitive = false,\n      className: classNameProp = \"\",\n      end = false,\n      style: styleProp,\n      to,\n      unstable_viewTransition,\n      children,\n      ...rest\n    },\n    ref\n  ) {\n    let path = useResolvedPath(to, { relative: rest.relative });\n    let location = useLocation();\n    let routerState = React.useContext(DataRouterStateContext);\n    let { navigator, basename } = React.useContext(NavigationContext);\n    let isTransitioning =\n      routerState != null &&\n      // Conditional usage is OK here because the usage of a data router is static\n      // eslint-disable-next-line react-hooks/rules-of-hooks\n      useViewTransitionState(path) &&\n      unstable_viewTransition === true;\n\n    let toPathname = navigator.encodeLocation\n      ? navigator.encodeLocation(path).pathname\n      : path.pathname;\n    let locationPathname = location.pathname;\n    let nextLocationPathname =\n      routerState && routerState.navigation && routerState.navigation.location\n        ? routerState.navigation.location.pathname\n        : null;\n\n    if (!caseSensitive) {\n      locationPathname = locationPathname.toLowerCase();\n      nextLocationPathname = nextLocationPathname\n        ? nextLocationPathname.toLowerCase()\n        : null;\n      toPathname = toPathname.toLowerCase();\n    }\n\n    if (nextLocationPathname && basename) {\n      nextLocationPathname =\n        stripBasename(nextLocationPathname, basename) || nextLocationPathname;\n    }\n\n    // If the `to` has a trailing slash, look at that exact spot.  Otherwise,\n    // we're looking for a slash _after_ what's in `to`.  For example:\n    //\n    // <NavLink to=\"/users\"> and <NavLink to=\"/users/\">\n    // both want to look for a / at index 6 to match URL `/users/matt`\n    const endSlashPosition =\n      toPathname !== \"/\" && toPathname.endsWith(\"/\")\n        ? toPathname.length - 1\n        : toPathname.length;\n    let isActive =\n      locationPathname === toPathname ||\n      (!end &&\n        locationPathname.startsWith(toPathname) &&\n        locationPathname.charAt(endSlashPosition) === \"/\");\n\n    let isPending =\n      nextLocationPathname != null &&\n      (nextLocationPathname === toPathname ||\n        (!end &&\n          nextLocationPathname.startsWith(toPathname) &&\n          nextLocationPathname.charAt(toPathname.length) === \"/\"));\n\n    let renderProps = {\n      isActive,\n      isPending,\n      isTransitioning,\n    };\n\n    let ariaCurrent = isActive ? ariaCurrentProp : undefined;\n\n    let className: string | undefined;\n    if (typeof classNameProp === \"function\") {\n      className = classNameProp(renderProps);\n    } else {\n      // If the className prop is not a function, we use a default `active`\n      // class for <NavLink />s that are active. In v5 `active` was the default\n      // value for `activeClassName`, but we are removing that API and can still\n      // use the old default behavior for a cleaner upgrade path and keep the\n      // simple styling rules working as they currently do.\n      className = [\n        classNameProp,\n        isActive ? \"active\" : null,\n        isPending ? \"pending\" : null,\n        isTransitioning ? \"transitioning\" : null,\n      ]\n        .filter(Boolean)\n        .join(\" \");\n    }\n\n    let style =\n      typeof styleProp === \"function\" ? styleProp(renderProps) : styleProp;\n\n    return (\n      <Link\n        {...rest}\n        aria-current={ariaCurrent}\n        className={className}\n        ref={ref}\n        style={style}\n        to={to}\n        unstable_viewTransition={unstable_viewTransition}\n      >\n        {typeof children === \"function\" ? children(renderProps) : children}\n      </Link>\n    );\n  }\n);\n\nif (__DEV__) {\n  NavLink.displayName = \"NavLink\";\n}\n\nexport interface FetcherFormProps\n  extends React.FormHTMLAttributes<HTMLFormElement> {\n  /**\n   * The HTTP verb to use when the form is submit. Supports \"get\", \"post\",\n   * \"put\", \"delete\", \"patch\".\n   */\n  method?: HTMLFormMethod;\n\n  /**\n   * `<form encType>` - enhancing beyond the normal string type and limiting\n   * to the built-in browser supported values\n   */\n  encType?:\n    | \"application/x-www-form-urlencoded\"\n    | \"multipart/form-data\"\n    | \"text/plain\";\n\n  /**\n   * Normal `<form action>` but supports React Router's relative paths.\n   */\n  action?: string;\n\n  /**\n   * Determines whether the form action is relative to the route hierarchy or\n   * the pathname.  Use this if you want to opt out of navigating the route\n   * hierarchy and want to instead route based on /-delimited URL segments\n   */\n  relative?: RelativeRoutingType;\n\n  /**\n   * Prevent the scroll position from resetting to the top of the viewport on\n   * completion of the navigation when using the <ScrollRestoration> component\n   */\n  preventScrollReset?: boolean;\n\n  /**\n   * A function to call when the form is submitted. If you call\n   * `event.preventDefault()` then this form will not do anything.\n   */\n  onSubmit?: React.FormEventHandler<HTMLFormElement>;\n}\n\nexport interface FormProps extends FetcherFormProps {\n  /**\n   * Indicate a specific fetcherKey to use when using navigate=false\n   */\n  fetcherKey?: string;\n\n  /**\n   * navigate=false will use a fetcher instead of a navigation\n   */\n  navigate?: boolean;\n\n  /**\n   * Forces a full document navigation instead of a fetch.\n   */\n  reloadDocument?: boolean;\n\n  /**\n   * Replaces the current entry in the browser history stack when the form\n   * navigates. Use this if you don't want the user to be able to click \"back\"\n   * to the page with the form on it.\n   */\n  replace?: boolean;\n\n  /**\n   * State object to add to the history stack entry for this navigation\n   */\n  state?: any;\n\n  /**\n   * Enable view transitions on this Form navigation\n   */\n  unstable_viewTransition?: boolean;\n}\n\ntype HTMLSubmitEvent = React.BaseSyntheticEvent<\n  SubmitEvent,\n  Event,\n  HTMLFormElement\n>;\n\ntype HTMLFormSubmitter = HTMLButtonElement | HTMLInputElement;\n\n/**\n * A `@remix-run/router`-aware `<form>`. It behaves like a normal form except\n * that the interaction with the server is with `fetch` instead of new document\n * requests, allowing components to add nicer UX to the page as the form is\n * submitted and returns with data.\n */\nexport const Form = React.forwardRef<HTMLFormElement, FormProps>(\n  (\n    {\n      fetcherKey,\n      navigate,\n      reloadDocument,\n      replace,\n      state,\n      method = defaultMethod,\n      action,\n      onSubmit,\n      relative,\n      preventScrollReset,\n      unstable_viewTransition,\n      ...props\n    },\n    forwardedRef\n  ) => {\n    let submit = useSubmit();\n    let formAction = useFormAction(action, { relative });\n    let formMethod: HTMLFormMethod =\n      method.toLowerCase() === \"get\" ? \"get\" : \"post\";\n\n    let submitHandler: React.FormEventHandler<HTMLFormElement> = (event) => {\n      onSubmit && onSubmit(event);\n      if (event.defaultPrevented) return;\n      event.preventDefault();\n\n      let submitter = (event as unknown as HTMLSubmitEvent).nativeEvent\n        .submitter as HTMLFormSubmitter | null;\n\n      let submitMethod =\n        (submitter?.getAttribute(\"formmethod\") as HTMLFormMethod | undefined) ||\n        method;\n\n      submit(submitter || event.currentTarget, {\n        fetcherKey,\n        method: submitMethod,\n        navigate,\n        replace,\n        state,\n        relative,\n        preventScrollReset,\n        unstable_viewTransition,\n      });\n    };\n\n    return (\n      <form\n        ref={forwardedRef}\n        method={formMethod}\n        action={formAction}\n        onSubmit={reloadDocument ? onSubmit : submitHandler}\n        {...props}\n      />\n    );\n  }\n);\n\nif (__DEV__) {\n  Form.displayName = \"Form\";\n}\n\nexport interface ScrollRestorationProps {\n  getKey?: GetScrollRestorationKeyFunction;\n  storageKey?: string;\n}\n\n/**\n * This component will emulate the browser's scroll restoration on location\n * changes.\n */\nexport function ScrollRestoration({\n  getKey,\n  storageKey,\n}: ScrollRestorationProps) {\n  useScrollRestoration({ getKey, storageKey });\n  return null;\n}\n\nif (__DEV__) {\n  ScrollRestoration.displayName = \"ScrollRestoration\";\n}\n//#endregion\n\n////////////////////////////////////////////////////////////////////////////////\n//#region Hooks\n////////////////////////////////////////////////////////////////////////////////\n\nenum DataRouterHook {\n  UseScrollRestoration = \"useScrollRestoration\",\n  UseSubmit = \"useSubmit\",\n  UseSubmitFetcher = \"useSubmitFetcher\",\n  UseFetcher = \"useFetcher\",\n  useViewTransitionState = \"useViewTransitionState\",\n}\n\nenum DataRouterStateHook {\n  UseFetcher = \"useFetcher\",\n  UseFetchers = \"useFetchers\",\n  UseScrollRestoration = \"useScrollRestoration\",\n}\n\n// Internal hooks\n\nfunction getDataRouterConsoleError(\n  hookName: DataRouterHook | DataRouterStateHook\n) {\n  return `${hookName} must be used within a data router.  See https://reactrouter.com/routers/picking-a-router.`;\n}\n\nfunction useDataRouterContext(hookName: DataRouterHook) {\n  let ctx = React.useContext(DataRouterContext);\n  invariant(ctx, getDataRouterConsoleError(hookName));\n  return ctx;\n}\n\nfunction useDataRouterState(hookName: DataRouterStateHook) {\n  let state = React.useContext(DataRouterStateContext);\n  invariant(state, getDataRouterConsoleError(hookName));\n  return state;\n}\n\n// External hooks\n\n/**\n * Handles the click behavior for router `<Link>` components. This is useful if\n * you need to create custom `<Link>` components with the same click behavior we\n * use in our exported `<Link>`.\n */\nexport function useLinkClickHandler<E extends Element = HTMLAnchorElement>(\n  to: To,\n  {\n    target,\n    replace: replaceProp,\n    state,\n    preventScrollReset,\n    relative,\n    unstable_viewTransition,\n  }: {\n    target?: React.HTMLAttributeAnchorTarget;\n    replace?: boolean;\n    state?: any;\n    preventScrollReset?: boolean;\n    relative?: RelativeRoutingType;\n    unstable_viewTransition?: boolean;\n  } = {}\n): (event: React.MouseEvent<E, MouseEvent>) => void {\n  let navigate = useNavigate();\n  let location = useLocation();\n  let path = useResolvedPath(to, { relative });\n\n  return React.useCallback(\n    (event: React.MouseEvent<E, MouseEvent>) => {\n      if (shouldProcessLinkClick(event, target)) {\n        event.preventDefault();\n\n        // If the URL hasn't changed, a regular <a> will do a replace instead of\n        // a push, so do the same here unless the replace prop is explicitly set\n        let replace =\n          replaceProp !== undefined\n            ? replaceProp\n            : createPath(location) === createPath(path);\n\n        navigate(to, {\n          replace,\n          state,\n          preventScrollReset,\n          relative,\n          unstable_viewTransition,\n        });\n      }\n    },\n    [\n      location,\n      navigate,\n      path,\n      replaceProp,\n      state,\n      target,\n      to,\n      preventScrollReset,\n      relative,\n      unstable_viewTransition,\n    ]\n  );\n}\n\n/**\n * A convenient wrapper for reading and writing search parameters via the\n * URLSearchParams interface.\n */\nexport function useSearchParams(\n  defaultInit?: URLSearchParamsInit\n): [URLSearchParams, SetURLSearchParams] {\n  warning(\n    typeof URLSearchParams !== \"undefined\",\n    `You cannot use the \\`useSearchParams\\` hook in a browser that does not ` +\n      `support the URLSearchParams API. If you need to support Internet ` +\n      `Explorer 11, we recommend you load a polyfill such as ` +\n      `https://github.com/ungap/url-search-params\\n\\n` +\n      `If you're unsure how to load polyfills, we recommend you check out ` +\n      `https://polyfill.io/v3/ which provides some recommendations about how ` +\n      `to load polyfills only for users that need them, instead of for every ` +\n      `user.`\n  );\n\n  let defaultSearchParamsRef = React.useRef(createSearchParams(defaultInit));\n  let hasSetSearchParamsRef = React.useRef(false);\n\n  let location = useLocation();\n  let searchParams = React.useMemo(\n    () =>\n      // Only merge in the defaults if we haven't yet called setSearchParams.\n      // Once we call that we want those to take precedence, otherwise you can't\n      // remove a param with setSearchParams({}) if it has an initial value\n      getSearchParamsForLocation(\n        location.search,\n        hasSetSearchParamsRef.current ? null : defaultSearchParamsRef.current\n      ),\n    [location.search]\n  );\n\n  let navigate = useNavigate();\n  let setSearchParams = React.useCallback<SetURLSearchParams>(\n    (nextInit, navigateOptions) => {\n      const newSearchParams = createSearchParams(\n        typeof nextInit === \"function\" ? nextInit(searchParams) : nextInit\n      );\n      hasSetSearchParamsRef.current = true;\n      navigate(\"?\" + newSearchParams, navigateOptions);\n    },\n    [navigate, searchParams]\n  );\n\n  return [searchParams, setSearchParams];\n}\n\nexport type SetURLSearchParams = (\n  nextInit?:\n    | URLSearchParamsInit\n    | ((prev: URLSearchParams) => URLSearchParamsInit),\n  navigateOpts?: NavigateOptions\n) => void;\n\n/**\n * Submits a HTML `<form>` to the server without reloading the page.\n */\nexport interface SubmitFunction {\n  (\n    /**\n     * Specifies the `<form>` to be submitted to the server, a specific\n     * `<button>` or `<input type=\"submit\">` to use to submit the form, or some\n     * arbitrary data to submit.\n     *\n     * Note: When using a `<button>` its `name` and `value` will also be\n     * included in the form data that is submitted.\n     */\n    target: SubmitTarget,\n\n    /**\n     * Options that override the `<form>`'s own attributes. Required when\n     * submitting arbitrary data without a backing `<form>`.\n     */\n    options?: SubmitOptions\n  ): void;\n}\n\n/**\n * Submits a fetcher `<form>` to the server without reloading the page.\n */\nexport interface FetcherSubmitFunction {\n  (\n    target: SubmitTarget,\n    // Fetchers cannot replace or set state because they are not navigation events\n    options?: Omit<SubmitOptions, \"replace\" | \"state\">\n  ): void;\n}\n\nfunction validateClientSideSubmission() {\n  if (typeof document === \"undefined\") {\n    throw new Error(\n      \"You are calling submit during the server render. \" +\n        \"Try calling submit within a `useEffect` or callback instead.\"\n    );\n  }\n}\n\nlet fetcherId = 0;\nlet getUniqueFetcherId = () => `__${String(++fetcherId)}__`;\n\n/**\n * Returns a function that may be used to programmatically submit a form (or\n * some arbitrary data) to the server.\n */\nexport function useSubmit(): SubmitFunction {\n  let { router } = useDataRouterContext(DataRouterHook.UseSubmit);\n  let { basename } = React.useContext(NavigationContext);\n  let currentRouteId = useRouteId();\n\n  return React.useCallback<SubmitFunction>(\n    (target, options = {}) => {\n      validateClientSideSubmission();\n\n      let { action, method, encType, formData, body } = getFormSubmissionInfo(\n        target,\n        basename\n      );\n\n      if (options.navigate === false) {\n        let key = options.fetcherKey || getUniqueFetcherId();\n        router.fetch(key, currentRouteId, options.action || action, {\n          preventScrollReset: options.preventScrollReset,\n          formData,\n          body,\n          formMethod: options.method || (method as HTMLFormMethod),\n          formEncType: options.encType || (encType as FormEncType),\n          unstable_flushSync: options.unstable_flushSync,\n        });\n      } else {\n        router.navigate(options.action || action, {\n          preventScrollReset: options.preventScrollReset,\n          formData,\n          body,\n          formMethod: options.method || (method as HTMLFormMethod),\n          formEncType: options.encType || (encType as FormEncType),\n          replace: options.replace,\n          state: options.state,\n          fromRouteId: currentRouteId,\n          unstable_flushSync: options.unstable_flushSync,\n          unstable_viewTransition: options.unstable_viewTransition,\n        });\n      }\n    },\n    [router, basename, currentRouteId]\n  );\n}\n\n// v7: Eventually we should deprecate this entirely in favor of using the\n// router method directly?\nexport function useFormAction(\n  action?: string,\n  { relative }: { relative?: RelativeRoutingType } = {}\n): string {\n  let { basename } = React.useContext(NavigationContext);\n  let routeContext = React.useContext(RouteContext);\n  invariant(routeContext, \"useFormAction must be used inside a RouteContext\");\n\n  let [match] = routeContext.matches.slice(-1);\n  // Shallow clone path so we can modify it below, otherwise we modify the\n  // object referenced by useMemo inside useResolvedPath\n  let path = { ...useResolvedPath(action ? action : \".\", { relative }) };\n\n  // If no action was specified, browsers will persist current search params\n  // when determining the path, so match that behavior\n  // https://github.com/remix-run/remix/issues/927\n  let location = useLocation();\n  if (action == null) {\n    // Safe to write to this directly here since if action was undefined, we\n    // would have called useResolvedPath(\".\") which will never include a search\n    path.search = location.search;\n\n    // When grabbing search params from the URL, remove any included ?index param\n    // since it might not apply to our contextual route.  We add it back based\n    // on match.route.index below\n    let params = new URLSearchParams(path.search);\n    if (params.has(\"index\") && params.get(\"index\") === \"\") {\n      params.delete(\"index\");\n      path.search = params.toString() ? `?${params.toString()}` : \"\";\n    }\n  }\n\n  if ((!action || action === \".\") && match.route.index) {\n    path.search = path.search\n      ? path.search.replace(/^\\?/, \"?index&\")\n      : \"?index\";\n  }\n\n  // If we're operating within a basename, prepend it to the pathname prior\n  // to creating the form action.  If this is a root navigation, then just use\n  // the raw basename which allows the basename to have full control over the\n  // presence of a trailing slash on root actions\n  if (basename !== \"/\") {\n    path.pathname =\n      path.pathname === \"/\" ? basename : joinPaths([basename, path.pathname]);\n  }\n\n  return createPath(path);\n}\n\nexport type FetcherWithComponents<TData> = Fetcher<TData> & {\n  Form: React.ForwardRefExoticComponent<\n    FetcherFormProps & React.RefAttributes<HTMLFormElement>\n  >;\n  submit: FetcherSubmitFunction;\n  load: (href: string, opts?: { unstable_flushSync?: boolean }) => void;\n};\n\n// TODO: (v7) Change the useFetcher generic default from `any` to `unknown`\n\n/**\n * Interacts with route loaders and actions without causing a navigation. Great\n * for any interaction that stays on the same page.\n */\nexport function useFetcher<TData = any>({\n  key,\n}: { key?: string } = {}): FetcherWithComponents<TData> {\n  let { router } = useDataRouterContext(DataRouterHook.UseFetcher);\n  let state = useDataRouterState(DataRouterStateHook.UseFetcher);\n  let fetcherData = React.useContext(FetchersContext);\n  let route = React.useContext(RouteContext);\n  let routeId = route.matches[route.matches.length - 1]?.route.id;\n\n  invariant(fetcherData, `useFetcher must be used inside a FetchersContext`);\n  invariant(route, `useFetcher must be used inside a RouteContext`);\n  invariant(\n    routeId != null,\n    `useFetcher can only be used on routes that contain a unique \"id\"`\n  );\n\n  // Fetcher key handling\n  // OK to call conditionally to feature detect `useId`\n  // eslint-disable-next-line react-hooks/rules-of-hooks\n  let defaultKey = useIdImpl ? useIdImpl() : \"\";\n  let [fetcherKey, setFetcherKey] = React.useState<string>(key || defaultKey);\n  if (key && key !== fetcherKey) {\n    setFetcherKey(key);\n  } else if (!fetcherKey) {\n    // We will only fall through here when `useId` is not available\n    setFetcherKey(getUniqueFetcherId());\n  }\n\n  // Registration/cleanup\n  React.useEffect(() => {\n    router.getFetcher(fetcherKey);\n    return () => {\n      // Tell the router we've unmounted - if v7_fetcherPersist is enabled this\n      // will not delete immediately but instead queue up a delete after the\n      // fetcher returns to an `idle` state\n      router.deleteFetcher(fetcherKey);\n    };\n  }, [router, fetcherKey]);\n\n  // Fetcher additions\n  let load = React.useCallback(\n    (href: string, opts?: { unstable_flushSync?: boolean }) => {\n      invariant(routeId, \"No routeId available for fetcher.load()\");\n      router.fetch(fetcherKey, routeId, href, opts);\n    },\n    [fetcherKey, routeId, router]\n  );\n\n  let submitImpl = useSubmit();\n  let submit = React.useCallback<FetcherSubmitFunction>(\n    (target, opts) => {\n      submitImpl(target, {\n        ...opts,\n        navigate: false,\n        fetcherKey,\n      });\n    },\n    [fetcherKey, submitImpl]\n  );\n\n  let FetcherForm = React.useMemo(() => {\n    let FetcherForm = React.forwardRef<HTMLFormElement, FetcherFormProps>(\n      (props, ref) => {\n        return (\n          <Form {...props} navigate={false} fetcherKey={fetcherKey} ref={ref} />\n        );\n      }\n    );\n    if (__DEV__) {\n      FetcherForm.displayName = \"fetcher.Form\";\n    }\n    return FetcherForm;\n  }, [fetcherKey]);\n\n  // Exposed FetcherWithComponents\n  let fetcher = state.fetchers.get(fetcherKey) || IDLE_FETCHER;\n  let data = fetcherData.get(fetcherKey);\n  let fetcherWithComponents = React.useMemo(\n    () => ({\n      Form: FetcherForm,\n      submit,\n      load,\n      ...fetcher,\n      data,\n    }),\n    [FetcherForm, submit, load, fetcher, data]\n  );\n\n  return fetcherWithComponents;\n}\n\n/**\n * Provides all fetchers currently on the page. Useful for layouts and parent\n * routes that need to provide pending/optimistic UI regarding the fetch.\n */\nexport function useFetchers(): (Fetcher & { key: string })[] {\n  let state = useDataRouterState(DataRouterStateHook.UseFetchers);\n  return Array.from(state.fetchers.entries()).map(([key, fetcher]) => ({\n    ...fetcher,\n    key,\n  }));\n}\n\nconst SCROLL_RESTORATION_STORAGE_KEY = \"react-router-scroll-positions\";\nlet savedScrollPositions: Record<string, number> = {};\n\n/**\n * When rendered inside a RouterProvider, will restore scroll positions on navigations\n */\nfunction useScrollRestoration({\n  getKey,\n  storageKey,\n}: {\n  getKey?: GetScrollRestorationKeyFunction;\n  storageKey?: string;\n} = {}) {\n  let { router } = useDataRouterContext(DataRouterHook.UseScrollRestoration);\n  let { restoreScrollPosition, preventScrollReset } = useDataRouterState(\n    DataRouterStateHook.UseScrollRestoration\n  );\n  let { basename } = React.useContext(NavigationContext);\n  let location = useLocation();\n  let matches = useMatches();\n  let navigation = useNavigation();\n\n  // Trigger manual scroll restoration while we're active\n  React.useEffect(() => {\n    window.history.scrollRestoration = \"manual\";\n    return () => {\n      window.history.scrollRestoration = \"auto\";\n    };\n  }, []);\n\n  // Save positions on pagehide\n  usePageHide(\n    React.useCallback(() => {\n      if (navigation.state === \"idle\") {\n        let key = (getKey ? getKey(location, matches) : null) || location.key;\n        savedScrollPositions[key] = window.scrollY;\n      }\n      try {\n        sessionStorage.setItem(\n          storageKey || SCROLL_RESTORATION_STORAGE_KEY,\n          JSON.stringify(savedScrollPositions)\n        );\n      } catch (error) {\n        warning(\n          false,\n          `Failed to save scroll positions in sessionStorage, <ScrollRestoration /> will not work properly (${error}).`\n        );\n      }\n      window.history.scrollRestoration = \"auto\";\n    }, [storageKey, getKey, navigation.state, location, matches])\n  );\n\n  // Read in any saved scroll locations\n  if (typeof document !== \"undefined\") {\n    // eslint-disable-next-line react-hooks/rules-of-hooks\n    React.useLayoutEffect(() => {\n      try {\n        let sessionPositions = sessionStorage.getItem(\n          storageKey || SCROLL_RESTORATION_STORAGE_KEY\n        );\n        if (sessionPositions) {\n          savedScrollPositions = JSON.parse(sessionPositions);\n        }\n      } catch (e) {\n        // no-op, use default empty object\n      }\n    }, [storageKey]);\n\n    // Enable scroll restoration in the router\n    // eslint-disable-next-line react-hooks/rules-of-hooks\n    React.useLayoutEffect(() => {\n      let getKeyWithoutBasename: GetScrollRestorationKeyFunction | undefined =\n        getKey && basename !== \"/\"\n          ? (location, matches) =>\n              getKey(\n                // Strip the basename to match useLocation()\n                {\n                  ...location,\n                  pathname:\n                    stripBasename(location.pathname, basename) ||\n                    location.pathname,\n                },\n                matches\n              )\n          : getKey;\n      let disableScrollRestoration = router?.enableScrollRestoration(\n        savedScrollPositions,\n        () => window.scrollY,\n        getKeyWithoutBasename\n      );\n      return () => disableScrollRestoration && disableScrollRestoration();\n    }, [router, basename, getKey]);\n\n    // Restore scrolling when state.restoreScrollPosition changes\n    // eslint-disable-next-line react-hooks/rules-of-hooks\n    React.useLayoutEffect(() => {\n      // Explicit false means don't do anything (used for submissions)\n      if (restoreScrollPosition === false) {\n        return;\n      }\n\n      // been here before, scroll to it\n      if (typeof restoreScrollPosition === \"number\") {\n        window.scrollTo(0, restoreScrollPosition);\n        return;\n      }\n\n      // try to scroll to the hash\n      if (location.hash) {\n        let el = document.getElementById(\n          decodeURIComponent(location.hash.slice(1))\n        );\n        if (el) {\n          el.scrollIntoView();\n          return;\n        }\n      }\n\n      // Don't reset if this navigation opted out\n      if (preventScrollReset === true) {\n        return;\n      }\n\n      // otherwise go to the top on new locations\n      window.scrollTo(0, 0);\n    }, [location, restoreScrollPosition, preventScrollReset]);\n  }\n}\n\nexport { useScrollRestoration as UNSAFE_useScrollRestoration };\n\n/**\n * Setup a callback to be fired on the window's `beforeunload` event. This is\n * useful for saving some data to `window.localStorage` just before the page\n * refreshes.\n *\n * Note: The `callback` argument should be a function created with\n * `React.useCallback()`.\n */\nexport function useBeforeUnload(\n  callback: (event: BeforeUnloadEvent) => any,\n  options?: { capture?: boolean }\n): void {\n  let { capture } = options || {};\n  React.useEffect(() => {\n    let opts = capture != null ? { capture } : undefined;\n    window.addEventListener(\"beforeunload\", callback, opts);\n    return () => {\n      window.removeEventListener(\"beforeunload\", callback, opts);\n    };\n  }, [callback, capture]);\n}\n\n/**\n * Setup a callback to be fired on the window's `pagehide` event. This is\n * useful for saving some data to `window.localStorage` just before the page\n * refreshes.  This event is better supported than beforeunload across browsers.\n *\n * Note: The `callback` argument should be a function created with\n * `React.useCallback()`.\n */\nfunction usePageHide(\n  callback: (event: PageTransitionEvent) => any,\n  options?: { capture?: boolean }\n): void {\n  let { capture } = options || {};\n  React.useEffect(() => {\n    let opts = capture != null ? { capture } : undefined;\n    window.addEventListener(\"pagehide\", callback, opts);\n    return () => {\n      window.removeEventListener(\"pagehide\", callback, opts);\n    };\n  }, [callback, capture]);\n}\n\n/**\n * Wrapper around useBlocker to show a window.confirm prompt to users instead\n * of building a custom UI with useBlocker.\n *\n * Warning: This has *a lot of rough edges* and behaves very differently (and\n * very incorrectly in some cases) across browsers if user click addition\n * back/forward navigations while the confirm is open.  Use at your own risk.\n */\nfunction usePrompt({\n  when,\n  message,\n}: {\n  when: boolean | BlockerFunction;\n  message: string;\n}) {\n  let blocker = useBlocker(when);\n\n  React.useEffect(() => {\n    if (blocker.state === \"blocked\") {\n      let proceed = window.confirm(message);\n      if (proceed) {\n        // This timeout is needed to avoid a weird \"race\" on POP navigations\n        // between the `window.history` revert navigation and the result of\n        // `window.confirm`\n        setTimeout(blocker.proceed, 0);\n      } else {\n        blocker.reset();\n      }\n    }\n  }, [blocker, message]);\n\n  React.useEffect(() => {\n    if (blocker.state === \"blocked\" && !when) {\n      blocker.reset();\n    }\n  }, [blocker, when]);\n}\n\nexport { usePrompt as unstable_usePrompt };\n\n/**\n * Return a boolean indicating if there is an active view transition to the\n * given href.  You can use this value to render CSS classes or viewTransitionName\n * styles onto your elements\n *\n * @param href The destination href\n * @param [opts.relative] Relative routing type (\"route\" | \"path\")\n */\nfunction useViewTransitionState(\n  to: To,\n  opts: { relative?: RelativeRoutingType } = {}\n) {\n  let vtContext = React.useContext(ViewTransitionContext);\n\n  invariant(\n    vtContext != null,\n    \"`unstable_useViewTransitionState` must be used within `react-router-dom`'s `RouterProvider`.  \" +\n      \"Did you accidentally import `RouterProvider` from `react-router`?\"\n  );\n\n  let { basename } = useDataRouterContext(\n    DataRouterHook.useViewTransitionState\n  );\n  let path = useResolvedPath(to, { relative: opts.relative });\n  if (!vtContext.isTransitioning) {\n    return false;\n  }\n\n  let currentPath =\n    stripBasename(vtContext.currentLocation.pathname, basename) ||\n    vtContext.currentLocation.pathname;\n  let nextPath =\n    stripBasename(vtContext.nextLocation.pathname, basename) ||\n    vtContext.nextLocation.pathname;\n\n  // Transition is active if we're going to or coming from the indicated\n  // destination.  This ensures that other PUSH navigations that reverse\n  // an indicated transition apply.  I.e., on the list view you have:\n  //\n  //   <NavLink to=\"/details/1\" unstable_viewTransition>\n  //\n  // If you click the breadcrumb back to the list view:\n  //\n  //   <NavLink to=\"/list\" unstable_viewTransition>\n  //\n  // We should apply the transition because it's indicated as active going\n  // from /list -> /details/1 and therefore should be active on the reverse\n  // (even though this isn't strictly a POP reverse)\n  return (\n    matchPath(path.pathname, nextPath) != null ||\n    matchPath(path.pathname, currentPath) != null\n  );\n}\n\nexport { useViewTransitionState as unstable_useViewTransitionState };\n\n//#endregion\n","import * as React from \"react\";\nimport type {\n  AgnosticIndexRouteObject,\n  AgnosticNonIndexRouteObject,\n  AgnosticRouteMatch,\n  History,\n  LazyRouteFunction,\n  Location,\n  Action as NavigationType,\n  RelativeRoutingType,\n  Router,\n  StaticHandlerContext,\n  To,\n  TrackedPromise,\n} from \"@remix-run/router\";\n\n// Create react-specific types from the agnostic types in @remix-run/router to\n// export from react-router\nexport interface IndexRouteObject {\n  caseSensitive?: AgnosticIndexRouteObject[\"caseSensitive\"];\n  path?: AgnosticIndexRouteObject[\"path\"];\n  id?: AgnosticIndexRouteObject[\"id\"];\n  loader?: AgnosticIndexRouteObject[\"loader\"];\n  action?: AgnosticIndexRouteObject[\"action\"];\n  hasErrorBoundary?: AgnosticIndexRouteObject[\"hasErrorBoundary\"];\n  shouldRevalidate?: AgnosticIndexRouteObject[\"shouldRevalidate\"];\n  handle?: AgnosticIndexRouteObject[\"handle\"];\n  index: true;\n  children?: undefined;\n  element?: React.ReactNode | null;\n  hydrateFallbackElement?: React.ReactNode | null;\n  errorElement?: React.ReactNode | null;\n  Component?: React.ComponentType | null;\n  HydrateFallback?: React.ComponentType | null;\n  ErrorBoundary?: React.ComponentType | null;\n  lazy?: LazyRouteFunction<RouteObject>;\n}\n\nexport interface NonIndexRouteObject {\n  caseSensitive?: AgnosticNonIndexRouteObject[\"caseSensitive\"];\n  path?: AgnosticNonIndexRouteObject[\"path\"];\n  id?: AgnosticNonIndexRouteObject[\"id\"];\n  loader?: AgnosticNonIndexRouteObject[\"loader\"];\n  action?: AgnosticNonIndexRouteObject[\"action\"];\n  hasErrorBoundary?: AgnosticNonIndexRouteObject[\"hasErrorBoundary\"];\n  shouldRevalidate?: AgnosticNonIndexRouteObject[\"shouldRevalidate\"];\n  handle?: AgnosticNonIndexRouteObject[\"handle\"];\n  index?: false;\n  children?: RouteObject[];\n  element?: React.ReactNode | null;\n  hydrateFallbackElement?: React.ReactNode | null;\n  errorElement?: React.ReactNode | null;\n  Component?: React.ComponentType | null;\n  HydrateFallback?: React.ComponentType | null;\n  ErrorBoundary?: React.ComponentType | null;\n  lazy?: LazyRouteFunction<RouteObject>;\n}\n\nexport type RouteObject = IndexRouteObject | NonIndexRouteObject;\n\nexport type DataRouteObject = RouteObject & {\n  children?: DataRouteObject[];\n  id: string;\n};\n\nexport interface RouteMatch<\n  ParamKey extends string = string,\n  RouteObjectType extends RouteObject = RouteObject\n> extends AgnosticRouteMatch<ParamKey, RouteObjectType> {}\n\nexport interface DataRouteMatch extends RouteMatch<string, DataRouteObject> {}\n\nexport interface DataRouterContextObject\n  // Omit `future` since those can be pulled from the `router`\n  // `NavigationContext` needs future since it doesn't have a `router` in all cases\n  extends Omit<NavigationContextObject, \"future\"> {\n  router: Router;\n  staticContext?: StaticHandlerContext;\n}\n\nexport const DataRouterContext =\n  React.createContext<DataRouterContextObject | null>(null);\nif (__DEV__) {\n  DataRouterContext.displayName = \"DataRouter\";\n}\n\nexport const DataRouterStateContext = React.createContext<\n  Router[\"state\"] | null\n>(null);\nif (__DEV__) {\n  DataRouterStateContext.displayName = \"DataRouterState\";\n}\n\nexport const AwaitContext = React.createContext<TrackedPromise | null>(null);\nif (__DEV__) {\n  AwaitContext.displayName = \"Await\";\n}\n\nexport interface NavigateOptions {\n  replace?: boolean;\n  state?: any;\n  preventScrollReset?: boolean;\n  relative?: RelativeRoutingType;\n  unstable_flushSync?: boolean;\n  unstable_viewTransition?: boolean;\n}\n\n/**\n * A Navigator is a \"location changer\"; it's how you get to different locations.\n *\n * Every history instance conforms to the Navigator interface, but the\n * distinction is useful primarily when it comes to the low-level `<Router>` API\n * where both the location and a navigator must be provided separately in order\n * to avoid \"tearing\" that may occur in a suspense-enabled app if the action\n * and/or location were to be read directly from the history instance.\n */\nexport interface Navigator {\n  createHref: History[\"createHref\"];\n  // Optional for backwards-compat with Router/HistoryRouter usage (edge case)\n  encodeLocation?: History[\"encodeLocation\"];\n  go: History[\"go\"];\n  push(to: To, state?: any, opts?: NavigateOptions): void;\n  replace(to: To, state?: any, opts?: NavigateOptions): void;\n}\n\ninterface NavigationContextObject {\n  basename: string;\n  navigator: Navigator;\n  static: boolean;\n  future: {\n    v7_relativeSplatPath: boolean;\n  };\n}\n\nexport const NavigationContext = React.createContext<NavigationContextObject>(\n  null!\n);\n\nif (__DEV__) {\n  NavigationContext.displayName = \"Navigation\";\n}\n\ninterface LocationContextObject {\n  location: Location;\n  navigationType: NavigationType;\n}\n\nexport const LocationContext = React.createContext<LocationContextObject>(\n  null!\n);\n\nif (__DEV__) {\n  LocationContext.displayName = \"Location\";\n}\n\nexport interface RouteContextObject {\n  outlet: React.ReactElement | null;\n  matches: RouteMatch[];\n  isDataRoute: boolean;\n}\n\nexport const RouteContext = React.createContext<RouteContextObject>({\n  outlet: null,\n  matches: [],\n  isDataRoute: false,\n});\n\nif (__DEV__) {\n  RouteContext.displayName = \"Route\";\n}\n\nexport const RouteErrorContext = React.createContext<any>(null);\n\nif (__DEV__) {\n  RouteErrorContext.displayName = \"RouteError\";\n}\n","import * as React from \"react\";\nimport type {\n  Blocker,\n  BlockerFunction,\n  Location,\n  ParamParseKey,\n  Params,\n  Path,\n  PathMatch,\n  PathPattern,\n  RelativeRoutingType,\n  Router as RemixRouter,\n  RevalidationState,\n  To,\n  UIMatch,\n} from \"@remix-run/router\";\nimport {\n  IDLE_BLOCKER,\n  Action as NavigationType,\n  UNSAFE_convertRouteMatchToUiMatch as convertRouteMatchToUiMatch,\n  UNSAFE_getResolveToMatches as getResolveToMatches,\n  UNSAFE_invariant as invariant,\n  isRouteErrorResponse,\n  joinPaths,\n  matchPath,\n  matchRoutes,\n  parsePath,\n  resolveTo,\n  stripBasename,\n  UNSAFE_warning as warning,\n} from \"@remix-run/router\";\n\nimport type {\n  DataRouteMatch,\n  NavigateOptions,\n  RouteContextObject,\n  RouteMatch,\n  RouteObject,\n} from \"./context\";\nimport {\n  AwaitContext,\n  DataRouterContext,\n  DataRouterStateContext,\n  LocationContext,\n  NavigationContext,\n  RouteContext,\n  RouteErrorContext,\n} from \"./context\";\n\n/**\n * Returns the full href for the given \"to\" value. This is useful for building\n * custom links that are also accessible and preserve right-click behavior.\n *\n * @see https://reactrouter.com/hooks/use-href\n */\nexport function useHref(\n  to: To,\n  { relative }: { relative?: RelativeRoutingType } = {}\n): string {\n  invariant(\n    useInRouterContext(),\n    // TODO: This error is probably because they somehow have 2 versions of the\n    // router loaded. We can help them understand how to avoid that.\n    `useHref() may be used only in the context of a <Router> component.`\n  );\n\n  let { basename, navigator } = React.useContext(NavigationContext);\n  let { hash, pathname, search } = useResolvedPath(to, { relative });\n\n  let joinedPathname = pathname;\n\n  // If we're operating within a basename, prepend it to the pathname prior\n  // to creating the href.  If this is a root navigation, then just use the raw\n  // basename which allows the basename to have full control over the presence\n  // of a trailing slash on root links\n  if (basename !== \"/\") {\n    joinedPathname =\n      pathname === \"/\" ? basename : joinPaths([basename, pathname]);\n  }\n\n  return navigator.createHref({ pathname: joinedPathname, search, hash });\n}\n\n/**\n * Returns true if this component is a descendant of a `<Router>`.\n *\n * @see https://reactrouter.com/hooks/use-in-router-context\n */\nexport function useInRouterContext(): boolean {\n  return React.useContext(LocationContext) != null;\n}\n\n/**\n * Returns the current location object, which represents the current URL in web\n * browsers.\n *\n * Note: If you're using this it may mean you're doing some of your own\n * \"routing\" in your app, and we'd like to know what your use case is. We may\n * be able to provide something higher-level to better suit your needs.\n *\n * @see https://reactrouter.com/hooks/use-location\n */\nexport function useLocation(): Location {\n  invariant(\n    useInRouterContext(),\n    // TODO: This error is probably because they somehow have 2 versions of the\n    // router loaded. We can help them understand how to avoid that.\n    `useLocation() may be used only in the context of a <Router> component.`\n  );\n\n  return React.useContext(LocationContext).location;\n}\n\n/**\n * Returns the current navigation action which describes how the router came to\n * the current location, either by a pop, push, or replace on the history stack.\n *\n * @see https://reactrouter.com/hooks/use-navigation-type\n */\nexport function useNavigationType(): NavigationType {\n  return React.useContext(LocationContext).navigationType;\n}\n\n/**\n * Returns a PathMatch object if the given pattern matches the current URL.\n * This is useful for components that need to know \"active\" state, e.g.\n * `<NavLink>`.\n *\n * @see https://reactrouter.com/hooks/use-match\n */\nexport function useMatch<\n  ParamKey extends ParamParseKey<Path>,\n  Path extends string\n>(pattern: PathPattern<Path> | Path): PathMatch<ParamKey> | null {\n  invariant(\n    useInRouterContext(),\n    // TODO: This error is probably because they somehow have 2 versions of the\n    // router loaded. We can help them understand how to avoid that.\n    `useMatch() may be used only in the context of a <Router> component.`\n  );\n\n  let { pathname } = useLocation();\n  return React.useMemo(\n    () => matchPath<ParamKey, Path>(pattern, pathname),\n    [pathname, pattern]\n  );\n}\n\n/**\n * The interface for the navigate() function returned from useNavigate().\n */\nexport interface NavigateFunction {\n  (to: To, options?: NavigateOptions): void;\n  (delta: number): void;\n}\n\nconst navigateEffectWarning =\n  `You should call navigate() in a React.useEffect(), not when ` +\n  `your component is first rendered.`;\n\n// Mute warnings for calls to useNavigate in SSR environments\nfunction useIsomorphicLayoutEffect(\n  cb: Parameters<typeof React.useLayoutEffect>[0]\n) {\n  let isStatic = React.useContext(NavigationContext).static;\n  if (!isStatic) {\n    // We should be able to get rid of this once react 18.3 is released\n    // See: https://github.com/facebook/react/pull/26395\n    // eslint-disable-next-line react-hooks/rules-of-hooks\n    React.useLayoutEffect(cb);\n  }\n}\n\n/**\n * Returns an imperative method for changing the location. Used by `<Link>`s, but\n * may also be used by other elements to change the location.\n *\n * @see https://reactrouter.com/hooks/use-navigate\n */\nexport function useNavigate(): NavigateFunction {\n  let { isDataRoute } = React.useContext(RouteContext);\n  // Conditional usage is OK here because the usage of a data router is static\n  // eslint-disable-next-line react-hooks/rules-of-hooks\n  return isDataRoute ? useNavigateStable() : useNavigateUnstable();\n}\n\nfunction useNavigateUnstable(): NavigateFunction {\n  invariant(\n    useInRouterContext(),\n    // TODO: This error is probably because they somehow have 2 versions of the\n    // router loaded. We can help them understand how to avoid that.\n    `useNavigate() may be used only in the context of a <Router> component.`\n  );\n\n  let dataRouterContext = React.useContext(DataRouterContext);\n  let { basename, future, navigator } = React.useContext(NavigationContext);\n  let { matches } = React.useContext(RouteContext);\n  let { pathname: locationPathname } = useLocation();\n\n  let routePathnamesJson = JSON.stringify(\n    getResolveToMatches(matches, future.v7_relativeSplatPath)\n  );\n\n  let activeRef = React.useRef(false);\n  useIsomorphicLayoutEffect(() => {\n    activeRef.current = true;\n  });\n\n  let navigate: NavigateFunction = React.useCallback(\n    (to: To | number, options: NavigateOptions = {}) => {\n      warning(activeRef.current, navigateEffectWarning);\n\n      // Short circuit here since if this happens on first render the navigate\n      // is useless because we haven't wired up our history listener yet\n      if (!activeRef.current) return;\n\n      if (typeof to === \"number\") {\n        navigator.go(to);\n        return;\n      }\n\n      let path = resolveTo(\n        to,\n        JSON.parse(routePathnamesJson),\n        locationPathname,\n        options.relative === \"path\"\n      );\n\n      // If we're operating within a basename, prepend it to the pathname prior\n      // to handing off to history (but only if we're not in a data router,\n      // otherwise it'll prepend the basename inside of the router).\n      // If this is a root navigation, then we navigate to the raw basename\n      // which allows the basename to have full control over the presence of a\n      // trailing slash on root links\n      if (dataRouterContext == null && basename !== \"/\") {\n        path.pathname =\n          path.pathname === \"/\"\n            ? basename\n            : joinPaths([basename, path.pathname]);\n      }\n\n      (!!options.replace ? navigator.replace : navigator.push)(\n        path,\n        options.state,\n        options\n      );\n    },\n    [\n      basename,\n      navigator,\n      routePathnamesJson,\n      locationPathname,\n      dataRouterContext,\n    ]\n  );\n\n  return navigate;\n}\n\nconst OutletContext = React.createContext<unknown>(null);\n\n/**\n * Returns the context (if provided) for the child route at this level of the route\n * hierarchy.\n * @see https://reactrouter.com/hooks/use-outlet-context\n */\nexport function useOutletContext<Context = unknown>(): Context {\n  return React.useContext(OutletContext) as Context;\n}\n\n/**\n * Returns the element for the child route at this level of the route\n * hierarchy. Used internally by `<Outlet>` to render child routes.\n *\n * @see https://reactrouter.com/hooks/use-outlet\n */\nexport function useOutlet(context?: unknown): React.ReactElement | null {\n  let outlet = React.useContext(RouteContext).outlet;\n  if (outlet) {\n    return (\n      <OutletContext.Provider value={context}>{outlet}</OutletContext.Provider>\n    );\n  }\n  return outlet;\n}\n\n/**\n * Returns an object of key/value pairs of the dynamic params from the current\n * URL that were matched by the route path.\n *\n * @see https://reactrouter.com/hooks/use-params\n */\nexport function useParams<\n  ParamsOrKey extends string | Record<string, string | undefined> = string\n>(): Readonly<\n  [ParamsOrKey] extends [string] ? Params<ParamsOrKey> : Partial<ParamsOrKey>\n> {\n  let { matches } = React.useContext(RouteContext);\n  let routeMatch = matches[matches.length - 1];\n  return routeMatch ? (routeMatch.params as any) : {};\n}\n\n/**\n * Resolves the pathname of the given `to` value against the current location.\n *\n * @see https://reactrouter.com/hooks/use-resolved-path\n */\nexport function useResolvedPath(\n  to: To,\n  { relative }: { relative?: RelativeRoutingType } = {}\n): Path {\n  let { future } = React.useContext(NavigationContext);\n  let { matches } = React.useContext(RouteContext);\n  let { pathname: locationPathname } = useLocation();\n  let routePathnamesJson = JSON.stringify(\n    getResolveToMatches(matches, future.v7_relativeSplatPath)\n  );\n\n  return React.useMemo(\n    () =>\n      resolveTo(\n        to,\n        JSON.parse(routePathnamesJson),\n        locationPathname,\n        relative === \"path\"\n      ),\n    [to, routePathnamesJson, locationPathname, relative]\n  );\n}\n\n/**\n * Returns the element of the route that matched the current location, prepared\n * with the correct context to render the remainder of the route tree. Route\n * elements in the tree must render an `<Outlet>` to render their child route's\n * element.\n *\n * @see https://reactrouter.com/hooks/use-routes\n */\nexport function useRoutes(\n  routes: RouteObject[],\n  locationArg?: Partial<Location> | string\n): React.ReactElement | null {\n  return useRoutesImpl(routes, locationArg);\n}\n\n// Internal implementation with accept optional param for RouterProvider usage\nexport function useRoutesImpl(\n  routes: RouteObject[],\n  locationArg?: Partial<Location> | string,\n  dataRouterState?: RemixRouter[\"state\"],\n  future?: RemixRouter[\"future\"]\n): React.ReactElement | null {\n  invariant(\n    useInRouterContext(),\n    // TODO: This error is probably because they somehow have 2 versions of the\n    // router loaded. We can help them understand how to avoid that.\n    `useRoutes() may be used only in the context of a <Router> component.`\n  );\n\n  let { navigator } = React.useContext(NavigationContext);\n  let { matches: parentMatches } = React.useContext(RouteContext);\n  let routeMatch = parentMatches[parentMatches.length - 1];\n  let parentParams = routeMatch ? routeMatch.params : {};\n  let parentPathname = routeMatch ? routeMatch.pathname : \"/\";\n  let parentPathnameBase = routeMatch ? routeMatch.pathnameBase : \"/\";\n  let parentRoute = routeMatch && routeMatch.route;\n\n  if (__DEV__) {\n    // You won't get a warning about 2 different <Routes> under a <Route>\n    // without a trailing *, but this is a best-effort warning anyway since we\n    // cannot even give the warning unless they land at the parent route.\n    //\n    // Example:\n    //\n    // <Routes>\n    //   {/* This route path MUST end with /* because otherwise\n    //       it will never match /blog/post/123 */}\n    //   <Route path=\"blog\" element={<Blog />} />\n    //   <Route path=\"blog/feed\" element={<BlogFeed />} />\n    // </Routes>\n    //\n    // function Blog() {\n    //   return (\n    //     <Routes>\n    //       <Route path=\"post/:id\" element={<Post />} />\n    //     </Routes>\n    //   );\n    // }\n    let parentPath = (parentRoute && parentRoute.path) || \"\";\n    warningOnce(\n      parentPathname,\n      !parentRoute || parentPath.endsWith(\"*\"),\n      `You rendered descendant <Routes> (or called \\`useRoutes()\\`) at ` +\n        `\"${parentPathname}\" (under <Route path=\"${parentPath}\">) but the ` +\n        `parent route path has no trailing \"*\". This means if you navigate ` +\n        `deeper, the parent won't match anymore and therefore the child ` +\n        `routes will never render.\\n\\n` +\n        `Please change the parent <Route path=\"${parentPath}\"> to <Route ` +\n        `path=\"${parentPath === \"/\" ? \"*\" : `${parentPath}/*`}\">.`\n    );\n  }\n\n  let locationFromContext = useLocation();\n\n  let location;\n  if (locationArg) {\n    let parsedLocationArg =\n      typeof locationArg === \"string\" ? parsePath(locationArg) : locationArg;\n\n    invariant(\n      parentPathnameBase === \"/\" ||\n        parsedLocationArg.pathname?.startsWith(parentPathnameBase),\n      `When overriding the location using \\`<Routes location>\\` or \\`useRoutes(routes, location)\\`, ` +\n        `the location pathname must begin with the portion of the URL pathname that was ` +\n        `matched by all parent routes. The current pathname base is \"${parentPathnameBase}\" ` +\n        `but pathname \"${parsedLocationArg.pathname}\" was given in the \\`location\\` prop.`\n    );\n\n    location = parsedLocationArg;\n  } else {\n    location = locationFromContext;\n  }\n\n  let pathname = location.pathname || \"/\";\n\n  let remainingPathname = pathname;\n  if (parentPathnameBase !== \"/\") {\n    // Determine the remaining pathname by removing the # of URL segments the\n    // parentPathnameBase has, instead of removing based on character count.\n    // This is because we can't guarantee that incoming/outgoing encodings/\n    // decodings will match exactly.\n    // We decode paths before matching on a per-segment basis with\n    // decodeURIComponent(), but we re-encode pathnames via `new URL()` so they\n    // match what `window.location.pathname` would reflect.  Those don't 100%\n    // align when it comes to encoded URI characters such as % and &.\n    //\n    // So we may end up with:\n    //   pathname:           \"/descendant/a%25b/match\"\n    //   parentPathnameBase: \"/descendant/a%b\"\n    //\n    // And the direct substring removal approach won't work :/\n    let parentSegments = parentPathnameBase.replace(/^\\//, \"\").split(\"/\");\n    let segments = pathname.replace(/^\\//, \"\").split(\"/\");\n    remainingPathname = \"/\" + segments.slice(parentSegments.length).join(\"/\");\n  }\n\n  let matches = matchRoutes(routes, { pathname: remainingPathname });\n\n  if (__DEV__) {\n    warning(\n      parentRoute || matches != null,\n      `No routes matched location \"${location.pathname}${location.search}${location.hash}\" `\n    );\n\n    warning(\n      matches == null ||\n        matches[matches.length - 1].route.element !== undefined ||\n        matches[matches.length - 1].route.Component !== undefined ||\n        matches[matches.length - 1].route.lazy !== undefined,\n      `Matched leaf route at location \"${location.pathname}${location.search}${location.hash}\" ` +\n        `does not have an element or Component. This means it will render an <Outlet /> with a ` +\n        `null value by default resulting in an \"empty\" page.`\n    );\n  }\n\n  let renderedMatches = _renderMatches(\n    matches &&\n      matches.map((match) =>\n        Object.assign({}, match, {\n          params: Object.assign({}, parentParams, match.params),\n          pathname: joinPaths([\n            parentPathnameBase,\n            // Re-encode pathnames that were decoded inside matchRoutes\n            navigator.encodeLocation\n              ? navigator.encodeLocation(match.pathname).pathname\n              : match.pathname,\n          ]),\n          pathnameBase:\n            match.pathnameBase === \"/\"\n              ? parentPathnameBase\n              : joinPaths([\n                  parentPathnameBase,\n                  // Re-encode pathnames that were decoded inside matchRoutes\n                  navigator.encodeLocation\n                    ? navigator.encodeLocation(match.pathnameBase).pathname\n                    : match.pathnameBase,\n                ]),\n        })\n      ),\n    parentMatches,\n    dataRouterState,\n    future\n  );\n\n  // When a user passes in a `locationArg`, the associated routes need to\n  // be wrapped in a new `LocationContext.Provider` in order for `useLocation`\n  // to use the scoped location instead of the global location.\n  if (locationArg && renderedMatches) {\n    return (\n      <LocationContext.Provider\n        value={{\n          location: {\n            pathname: \"/\",\n            search: \"\",\n            hash: \"\",\n            state: null,\n            key: \"default\",\n            ...location,\n          },\n          navigationType: NavigationType.Pop,\n        }}\n      >\n        {renderedMatches}\n      </LocationContext.Provider>\n    );\n  }\n\n  return renderedMatches;\n}\n\nfunction DefaultErrorComponent() {\n  let error = useRouteError();\n  let message = isRouteErrorResponse(error)\n    ? `${error.status} ${error.statusText}`\n    : error instanceof Error\n    ? error.message\n    : JSON.stringify(error);\n  let stack = error instanceof Error ? error.stack : null;\n  let lightgrey = \"rgba(200,200,200, 0.5)\";\n  let preStyles = { padding: \"0.5rem\", backgroundColor: lightgrey };\n  let codeStyles = { padding: \"2px 4px\", backgroundColor: lightgrey };\n\n  let devInfo = null;\n  if (__DEV__) {\n    console.error(\n      \"Error handled by React Router default ErrorBoundary:\",\n      error\n    );\n\n    devInfo = (\n      <>\n        <p>💿 Hey developer 👋</p>\n        <p>\n          You can provide a way better UX than this when your app throws errors\n          by providing your own <code style={codeStyles}>ErrorBoundary</code> or{\" \"}\n          <code style={codeStyles}>errorElement</code> prop on your route.\n        </p>\n      </>\n    );\n  }\n\n  return (\n    <>\n      <h2>Unexpected Application Error!</h2>\n      <h3 style={{ fontStyle: \"italic\" }}>{message}</h3>\n      {stack ? <pre style={preStyles}>{stack}</pre> : null}\n      {devInfo}\n    </>\n  );\n}\n\nconst defaultErrorElement = <DefaultErrorComponent />;\n\ntype RenderErrorBoundaryProps = React.PropsWithChildren<{\n  location: Location;\n  revalidation: RevalidationState;\n  error: any;\n  component: React.ReactNode;\n  routeContext: RouteContextObject;\n}>;\n\ntype RenderErrorBoundaryState = {\n  location: Location;\n  revalidation: RevalidationState;\n  error: any;\n};\n\nexport class RenderErrorBoundary extends React.Component<\n  RenderErrorBoundaryProps,\n  RenderErrorBoundaryState\n> {\n  constructor(props: RenderErrorBoundaryProps) {\n    super(props);\n    this.state = {\n      location: props.location,\n      revalidation: props.revalidation,\n      error: props.error,\n    };\n  }\n\n  static getDerivedStateFromError(error: any) {\n    return { error: error };\n  }\n\n  static getDerivedStateFromProps(\n    props: RenderErrorBoundaryProps,\n    state: RenderErrorBoundaryState\n  ) {\n    // When we get into an error state, the user will likely click \"back\" to the\n    // previous page that didn't have an error. Because this wraps the entire\n    // application, that will have no effect--the error page continues to display.\n    // This gives us a mechanism to recover from the error when the location changes.\n    //\n    // Whether we're in an error state or not, we update the location in state\n    // so that when we are in an error state, it gets reset when a new location\n    // comes in and the user recovers from the error.\n    if (\n      state.location !== props.location ||\n      (state.revalidation !== \"idle\" && props.revalidation === \"idle\")\n    ) {\n      return {\n        error: props.error,\n        location: props.location,\n        revalidation: props.revalidation,\n      };\n    }\n\n    // If we're not changing locations, preserve the location but still surface\n    // any new errors that may come through. We retain the existing error, we do\n    // this because the error provided from the app state may be cleared without\n    // the location changing.\n    return {\n      error: props.error !== undefined ? props.error : state.error,\n      location: state.location,\n      revalidation: props.revalidation || state.revalidation,\n    };\n  }\n\n  componentDidCatch(error: any, errorInfo: any) {\n    console.error(\n      \"React Router caught the following error during render\",\n      error,\n      errorInfo\n    );\n  }\n\n  render() {\n    return this.state.error !== undefined ? (\n      <RouteContext.Provider value={this.props.routeContext}>\n        <RouteErrorContext.Provider\n          value={this.state.error}\n          children={this.props.component}\n        />\n      </RouteContext.Provider>\n    ) : (\n      this.props.children\n    );\n  }\n}\n\ninterface RenderedRouteProps {\n  routeContext: RouteContextObject;\n  match: RouteMatch<string, RouteObject>;\n  children: React.ReactNode | null;\n}\n\nfunction RenderedRoute({ routeContext, match, children }: RenderedRouteProps) {\n  let dataRouterContext = React.useContext(DataRouterContext);\n\n  // Track how deep we got in our render pass to emulate SSR componentDidCatch\n  // in a DataStaticRouter\n  if (\n    dataRouterContext &&\n    dataRouterContext.static &&\n    dataRouterContext.staticContext &&\n    (match.route.errorElement || match.route.ErrorBoundary)\n  ) {\n    dataRouterContext.staticContext._deepestRenderedBoundaryId = match.route.id;\n  }\n\n  return (\n    <RouteContext.Provider value={routeContext}>\n      {children}\n    </RouteContext.Provider>\n  );\n}\n\nexport function _renderMatches(\n  matches: RouteMatch[] | null,\n  parentMatches: RouteMatch[] = [],\n  dataRouterState: RemixRouter[\"state\"] | null = null,\n  future: RemixRouter[\"future\"] | null = null\n): React.ReactElement | null {\n  if (matches == null) {\n    if (dataRouterState?.errors) {\n      // Don't bail if we have data router errors so we can render them in the\n      // boundary.  Use the pre-matched (or shimmed) matches\n      matches = dataRouterState.matches as DataRouteMatch[];\n    } else {\n      return null;\n    }\n  }\n\n  let renderedMatches = matches;\n\n  // If we have data errors, trim matches to the highest error boundary\n  let errors = dataRouterState?.errors;\n  if (errors != null) {\n    let errorIndex = renderedMatches.findIndex(\n      (m) => m.route.id && errors?.[m.route.id]\n    );\n    invariant(\n      errorIndex >= 0,\n      `Could not find a matching route for errors on route IDs: ${Object.keys(\n        errors\n      ).join(\",\")}`\n    );\n    renderedMatches = renderedMatches.slice(\n      0,\n      Math.min(renderedMatches.length, errorIndex + 1)\n    );\n  }\n\n  // If we're in a partial hydration mode, detect if we need to render down to\n  // a given HydrateFallback while we load the rest of the hydration data\n  let renderFallback = false;\n  let fallbackIndex = -1;\n  if (dataRouterState && future && future.v7_partialHydration) {\n    for (let i = 0; i < renderedMatches.length; i++) {\n      let match = renderedMatches[i];\n      // Track the deepest fallback up until the first route without data\n      if (match.route.HydrateFallback || match.route.hydrateFallbackElement) {\n        fallbackIndex = i;\n      }\n\n      if (match.route.id) {\n        let { loaderData, errors } = dataRouterState;\n        let needsToRunLoader =\n          match.route.loader &&\n          loaderData[match.route.id] === undefined &&\n          (!errors || errors[match.route.id] === undefined);\n        if (match.route.lazy || needsToRunLoader) {\n          // We found the first route that's not ready to render (waiting on\n          // lazy, or has a loader that hasn't run yet).  Flag that we need to\n          // render a fallback and render up until the appropriate fallback\n          renderFallback = true;\n          if (fallbackIndex >= 0) {\n            renderedMatches = renderedMatches.slice(0, fallbackIndex + 1);\n          } else {\n            renderedMatches = [renderedMatches[0]];\n          }\n          break;\n        }\n      }\n    }\n  }\n\n  return renderedMatches.reduceRight((outlet, match, index) => {\n    // Only data routers handle errors/fallbacks\n    let error: any;\n    let shouldRenderHydrateFallback = false;\n    let errorElement: React.ReactNode | null = null;\n    let hydrateFallbackElement: React.ReactNode | null = null;\n    if (dataRouterState) {\n      error = errors && match.route.id ? errors[match.route.id] : undefined;\n      errorElement = match.route.errorElement || defaultErrorElement;\n\n      if (renderFallback) {\n        if (fallbackIndex < 0 && index === 0) {\n          warningOnce(\n            \"route-fallback\",\n            false,\n            \"No `HydrateFallback` element provided to render during initial hydration\"\n          );\n          shouldRenderHydrateFallback = true;\n          hydrateFallbackElement = null;\n        } else if (fallbackIndex === index) {\n          shouldRenderHydrateFallback = true;\n          hydrateFallbackElement = match.route.hydrateFallbackElement || null;\n        }\n      }\n    }\n\n    let matches = parentMatches.concat(renderedMatches.slice(0, index + 1));\n    let getChildren = () => {\n      let children: React.ReactNode;\n      if (error) {\n        children = errorElement;\n      } else if (shouldRenderHydrateFallback) {\n        children = hydrateFallbackElement;\n      } else if (match.route.Component) {\n        // Note: This is a de-optimized path since React won't re-use the\n        // ReactElement since it's identity changes with each new\n        // React.createElement call.  We keep this so folks can use\n        // `<Route Component={...}>` in `<Routes>` but generally `Component`\n        // usage is only advised in `RouterProvider` when we can convert it to\n        // `element` ahead of time.\n        children = <match.route.Component />;\n      } else if (match.route.element) {\n        children = match.route.element;\n      } else {\n        children = outlet;\n      }\n      return (\n        <RenderedRoute\n          match={match}\n          routeContext={{\n            outlet,\n            matches,\n            isDataRoute: dataRouterState != null,\n          }}\n          children={children}\n        />\n      );\n    };\n    // Only wrap in an error boundary within data router usages when we have an\n    // ErrorBoundary/errorElement on this route.  Otherwise let it bubble up to\n    // an ancestor ErrorBoundary/errorElement\n    return dataRouterState &&\n      (match.route.ErrorBoundary || match.route.errorElement || index === 0) ? (\n      <RenderErrorBoundary\n        location={dataRouterState.location}\n        revalidation={dataRouterState.revalidation}\n        component={errorElement}\n        error={error}\n        children={getChildren()}\n        routeContext={{ outlet: null, matches, isDataRoute: true }}\n      />\n    ) : (\n      getChildren()\n    );\n  }, null as React.ReactElement | null);\n}\n\nenum DataRouterHook {\n  UseBlocker = \"useBlocker\",\n  UseRevalidator = \"useRevalidator\",\n  UseNavigateStable = \"useNavigate\",\n}\n\nenum DataRouterStateHook {\n  UseBlocker = \"useBlocker\",\n  UseLoaderData = \"useLoaderData\",\n  UseActionData = \"useActionData\",\n  UseRouteError = \"useRouteError\",\n  UseNavigation = \"useNavigation\",\n  UseRouteLoaderData = \"useRouteLoaderData\",\n  UseMatches = \"useMatches\",\n  UseRevalidator = \"useRevalidator\",\n  UseNavigateStable = \"useNavigate\",\n  UseRouteId = \"useRouteId\",\n}\n\nfunction getDataRouterConsoleError(\n  hookName: DataRouterHook | DataRouterStateHook\n) {\n  return `${hookName} must be used within a data router.  See https://reactrouter.com/routers/picking-a-router.`;\n}\n\nfunction useDataRouterContext(hookName: DataRouterHook) {\n  let ctx = React.useContext(DataRouterContext);\n  invariant(ctx, getDataRouterConsoleError(hookName));\n  return ctx;\n}\n\nfunction useDataRouterState(hookName: DataRouterStateHook) {\n  let state = React.useContext(DataRouterStateContext);\n  invariant(state, getDataRouterConsoleError(hookName));\n  return state;\n}\n\nfunction useRouteContext(hookName: DataRouterStateHook) {\n  let route = React.useContext(RouteContext);\n  invariant(route, getDataRouterConsoleError(hookName));\n  return route;\n}\n\n// Internal version with hookName-aware debugging\nfunction useCurrentRouteId(hookName: DataRouterStateHook) {\n  let route = useRouteContext(hookName);\n  let thisRoute = route.matches[route.matches.length - 1];\n  invariant(\n    thisRoute.route.id,\n    `${hookName} can only be used on routes that contain a unique \"id\"`\n  );\n  return thisRoute.route.id;\n}\n\n/**\n * Returns the ID for the nearest contextual route\n */\nexport function useRouteId() {\n  return useCurrentRouteId(DataRouterStateHook.UseRouteId);\n}\n\n/**\n * Returns the current navigation, defaulting to an \"idle\" navigation when\n * no navigation is in progress\n */\nexport function useNavigation() {\n  let state = useDataRouterState(DataRouterStateHook.UseNavigation);\n  return state.navigation;\n}\n\n/**\n * Returns a revalidate function for manually triggering revalidation, as well\n * as the current state of any manual revalidations\n */\nexport function useRevalidator() {\n  let dataRouterContext = useDataRouterContext(DataRouterHook.UseRevalidator);\n  let state = useDataRouterState(DataRouterStateHook.UseRevalidator);\n  return React.useMemo(\n    () => ({\n      revalidate: dataRouterContext.router.revalidate,\n      state: state.revalidation,\n    }),\n    [dataRouterContext.router.revalidate, state.revalidation]\n  );\n}\n\n/**\n * Returns the active route matches, useful for accessing loaderData for\n * parent/child routes or the route \"handle\" property\n */\nexport function useMatches(): UIMatch[] {\n  let { matches, loaderData } = useDataRouterState(\n    DataRouterStateHook.UseMatches\n  );\n  return React.useMemo(\n    () => matches.map((m) => convertRouteMatchToUiMatch(m, loaderData)),\n    [matches, loaderData]\n  );\n}\n\n/**\n * Returns the loader data for the nearest ancestor Route loader\n */\nexport function useLoaderData(): unknown {\n  let state = useDataRouterState(DataRouterStateHook.UseLoaderData);\n  let routeId = useCurrentRouteId(DataRouterStateHook.UseLoaderData);\n\n  if (state.errors && state.errors[routeId] != null) {\n    console.error(\n      `You cannot \\`useLoaderData\\` in an errorElement (routeId: ${routeId})`\n    );\n    return undefined;\n  }\n  return state.loaderData[routeId];\n}\n\n/**\n * Returns the loaderData for the given routeId\n */\nexport function useRouteLoaderData(routeId: string): unknown {\n  let state = useDataRouterState(DataRouterStateHook.UseRouteLoaderData);\n  return state.loaderData[routeId];\n}\n\n/**\n * Returns the action data for the nearest ancestor Route action\n */\nexport function useActionData(): unknown {\n  let state = useDataRouterState(DataRouterStateHook.UseActionData);\n  let routeId = useCurrentRouteId(DataRouterStateHook.UseLoaderData);\n  return state.actionData ? state.actionData[routeId] : undefined;\n}\n\n/**\n * Returns the nearest ancestor Route error, which could be a loader/action\n * error or a render error.  This is intended to be called from your\n * ErrorBoundary/errorElement to display a proper error message.\n */\nexport function useRouteError(): unknown {\n  let error = React.useContext(RouteErrorContext);\n  let state = useDataRouterState(DataRouterStateHook.UseRouteError);\n  let routeId = useCurrentRouteId(DataRouterStateHook.UseRouteError);\n\n  // If this was a render error, we put it in a RouteError context inside\n  // of RenderErrorBoundary\n  if (error !== undefined) {\n    return error;\n  }\n\n  // Otherwise look for errors from our data router state\n  return state.errors?.[routeId];\n}\n\n/**\n * Returns the happy-path data from the nearest ancestor `<Await />` value\n */\nexport function useAsyncValue(): unknown {\n  let value = React.useContext(AwaitContext);\n  return value?._data;\n}\n\n/**\n * Returns the error from the nearest ancestor `<Await />` value\n */\nexport function useAsyncError(): unknown {\n  let value = React.useContext(AwaitContext);\n  return value?._error;\n}\n\nlet blockerId = 0;\n\n/**\n * Allow the application to block navigations within the SPA and present the\n * user a confirmation dialog to confirm the navigation.  Mostly used to avoid\n * using half-filled form data.  This does not handle hard-reloads or\n * cross-origin navigations.\n */\nexport function useBlocker(shouldBlock: boolean | BlockerFunction): Blocker {\n  let { router, basename } = useDataRouterContext(DataRouterHook.UseBlocker);\n  let state = useDataRouterState(DataRouterStateHook.UseBlocker);\n\n  let [blockerKey, setBlockerKey] = React.useState(\"\");\n  let blockerFunction = React.useCallback<BlockerFunction>(\n    (arg) => {\n      if (typeof shouldBlock !== \"function\") {\n        return !!shouldBlock;\n      }\n      if (basename === \"/\") {\n        return shouldBlock(arg);\n      }\n\n      // If they provided us a function and we've got an active basename, strip\n      // it from the locations we expose to the user to match the behavior of\n      // useLocation\n      let { currentLocation, nextLocation, historyAction } = arg;\n      return shouldBlock({\n        currentLocation: {\n          ...currentLocation,\n          pathname:\n            stripBasename(currentLocation.pathname, basename) ||\n            currentLocation.pathname,\n        },\n        nextLocation: {\n          ...nextLocation,\n          pathname:\n            stripBasename(nextLocation.pathname, basename) ||\n            nextLocation.pathname,\n        },\n        historyAction,\n      });\n    },\n    [basename, shouldBlock]\n  );\n\n  // This effect is in charge of blocker key assignment and deletion (which is\n  // tightly coupled to the key)\n  React.useEffect(() => {\n    let key = String(++blockerId);\n    setBlockerKey(key);\n    return () => router.deleteBlocker(key);\n  }, [router]);\n\n  // This effect handles assigning the blockerFunction.  This is to handle\n  // unstable blocker function identities, and happens only after the prior\n  // effect so we don't get an orphaned blockerFunction in the router with a\n  // key of \"\".  Until then we just have the IDLE_BLOCKER.\n  React.useEffect(() => {\n    if (blockerKey !== \"\") {\n      router.getBlocker(blockerKey, blockerFunction);\n    }\n  }, [router, blockerKey, blockerFunction]);\n\n  // Prefer the blocker from `state` not `router.state` since DataRouterContext\n  // is memoized so this ensures we update on blocker state updates\n  return blockerKey && state.blockers.has(blockerKey)\n    ? state.blockers.get(blockerKey)!\n    : IDLE_BLOCKER;\n}\n\n/**\n * Stable version of useNavigate that is used when we are in the context of\n * a RouterProvider.\n */\nfunction useNavigateStable(): NavigateFunction {\n  let { router } = useDataRouterContext(DataRouterHook.UseNavigateStable);\n  let id = useCurrentRouteId(DataRouterStateHook.UseNavigateStable);\n\n  let activeRef = React.useRef(false);\n  useIsomorphicLayoutEffect(() => {\n    activeRef.current = true;\n  });\n\n  let navigate: NavigateFunction = React.useCallback(\n    (to: To | number, options: NavigateOptions = {}) => {\n      warning(activeRef.current, navigateEffectWarning);\n\n      // Short circuit here since if this happens on first render the navigate\n      // is useless because we haven't wired up our router subscriber yet\n      if (!activeRef.current) return;\n\n      if (typeof to === \"number\") {\n        router.navigate(to);\n      } else {\n        router.navigate(to, { fromRouteId: id, ...options });\n      }\n    },\n    [router, id]\n  );\n\n  return navigate;\n}\n\nconst alreadyWarned: Record<string, boolean> = {};\n\nfunction warningOnce(key: string, cond: boolean, message: string) {\n  if (!cond && !alreadyWarned[key]) {\n    alreadyWarned[key] = true;\n    warning(false, message);\n  }\n}\n","import type {\n  InitialEntry,\n  LazyRouteFunction,\n  Location,\n  MemoryHistory,\n  RelativeRoutingType,\n  Router as RemixRouter,\n  RouterState,\n  RouterSubscriber,\n  To,\n  TrackedPromise,\n} from \"@remix-run/router\";\nimport {\n  AbortedDeferredError,\n  Action as NavigationType,\n  createMemoryHistory,\n  UNSAFE_getResolveToMatches as getResolveToMatches,\n  UNSAFE_invariant as invariant,\n  parsePath,\n  resolveTo,\n  stripBasename,\n  UNSAFE_warning as warning,\n} from \"@remix-run/router\";\nimport * as React from \"react\";\n\nimport type {\n  DataRouteObject,\n  IndexRouteObject,\n  Navigator,\n  NonIndexRouteObject,\n  RouteMatch,\n  RouteObject,\n} from \"./context\";\nimport {\n  AwaitContext,\n  DataRouterContext,\n  DataRouterStateContext,\n  LocationContext,\n  NavigationContext,\n  RouteContext,\n} from \"./context\";\nimport {\n  _renderMatches,\n  useAsyncValue,\n  useInRouterContext,\n  useLocation,\n  useNavigate,\n  useOutlet,\n  useRoutes,\n  useRoutesImpl,\n} from \"./hooks\";\n\nexport interface FutureConfig {\n  v7_relativeSplatPath: boolean;\n  v7_startTransition: boolean;\n}\n\nexport interface RouterProviderProps {\n  fallbackElement?: React.ReactNode;\n  router: RemixRouter;\n  // Only accept future flags relevant to rendering behavior\n  // routing flags should be accessed via router.future\n  future?: Partial<Pick<FutureConfig, \"v7_startTransition\">>;\n}\n\n/**\n  Webpack + React 17 fails to compile on any of the following because webpack\n  complains that `startTransition` doesn't exist in `React`:\n  * import { startTransition } from \"react\"\n  * import * as React from from \"react\";\n    \"startTransition\" in React ? React.startTransition(() => setState()) : setState()\n  * import * as React from from \"react\";\n    \"startTransition\" in React ? React[\"startTransition\"](() => setState()) : setState()\n\n  Moving it to a constant such as the following solves the Webpack/React 17 issue:\n  * import * as React from from \"react\";\n    const START_TRANSITION = \"startTransition\";\n    START_TRANSITION in React ? React[START_TRANSITION](() => setState()) : setState()\n\n  However, that introduces webpack/terser minification issues in production builds\n  in React 18 where minification/obfuscation ends up removing the call of\n  React.startTransition entirely from the first half of the ternary.  Grabbing\n  this exported reference once up front resolves that issue.\n\n  See https://github.com/remix-run/react-router/issues/10579\n*/\nconst START_TRANSITION = \"startTransition\";\nconst startTransitionImpl = React[START_TRANSITION];\n\n/**\n * Given a Remix Router instance, render the appropriate UI\n */\nexport function RouterProvider({\n  fallbackElement,\n  router,\n  future,\n}: RouterProviderProps): React.ReactElement {\n  let [state, setStateImpl] = React.useState(router.state);\n  let { v7_startTransition } = future || {};\n\n  let setState = React.useCallback<RouterSubscriber>(\n    (newState: RouterState) => {\n      if (v7_startTransition && startTransitionImpl) {\n        startTransitionImpl(() => setStateImpl(newState));\n      } else {\n        setStateImpl(newState);\n      }\n    },\n    [setStateImpl, v7_startTransition]\n  );\n\n  // Need to use a layout effect here so we are subscribed early enough to\n  // pick up on any render-driven redirects/navigations (useEffect/<Navigate>)\n  React.useLayoutEffect(() => router.subscribe(setState), [router, setState]);\n\n  React.useEffect(() => {\n    warning(\n      fallbackElement == null || !router.future.v7_partialHydration,\n      \"`<RouterProvider fallbackElement>` is deprecated when using \" +\n        \"`v7_partialHydration`, use a `HydrateFallback` component instead\"\n    );\n    // Only log this once on initial mount\n    // eslint-disable-next-line react-hooks/exhaustive-deps\n  }, []);\n\n  let navigator = React.useMemo((): Navigator => {\n    return {\n      createHref: router.createHref,\n      encodeLocation: router.encodeLocation,\n      go: (n) => router.navigate(n),\n      push: (to, state, opts) =>\n        router.navigate(to, {\n          state,\n          preventScrollReset: opts?.preventScrollReset,\n        }),\n      replace: (to, state, opts) =>\n        router.navigate(to, {\n          replace: true,\n          state,\n          preventScrollReset: opts?.preventScrollReset,\n        }),\n    };\n  }, [router]);\n\n  let basename = router.basename || \"/\";\n\n  let dataRouterContext = React.useMemo(\n    () => ({\n      router,\n      navigator,\n      static: false,\n      basename,\n    }),\n    [router, navigator, basename]\n  );\n\n  // The fragment and {null} here are important!  We need them to keep React 18's\n  // useId happy when we are server-rendering since we may have a <script> here\n  // containing the hydrated server-side staticContext (from StaticRouterProvider).\n  // useId relies on the component tree structure to generate deterministic id's\n  // so we need to ensure it remains the same on the client even though\n  // we don't need the <script> tag\n  return (\n    <>\n      <DataRouterContext.Provider value={dataRouterContext}>\n        <DataRouterStateContext.Provider value={state}>\n          <Router\n            basename={basename}\n            location={state.location}\n            navigationType={state.historyAction}\n            navigator={navigator}\n            future={{\n              v7_relativeSplatPath: router.future.v7_relativeSplatPath,\n            }}\n          >\n            {state.initialized || router.future.v7_partialHydration ? (\n              <DataRoutes\n                routes={router.routes}\n                future={router.future}\n                state={state}\n              />\n            ) : (\n              fallbackElement\n            )}\n          </Router>\n        </DataRouterStateContext.Provider>\n      </DataRouterContext.Provider>\n      {null}\n    </>\n  );\n}\n\nfunction DataRoutes({\n  routes,\n  future,\n  state,\n}: {\n  routes: DataRouteObject[];\n  future: RemixRouter[\"future\"];\n  state: RouterState;\n}): React.ReactElement | null {\n  return useRoutesImpl(routes, undefined, state, future);\n}\n\nexport interface MemoryRouterProps {\n  basename?: string;\n  children?: React.ReactNode;\n  initialEntries?: InitialEntry[];\n  initialIndex?: number;\n  future?: Partial<FutureConfig>;\n}\n\n/**\n * A `<Router>` that stores all entries in memory.\n *\n * @see https://reactrouter.com/router-components/memory-router\n */\nexport function MemoryRouter({\n  basename,\n  children,\n  initialEntries,\n  initialIndex,\n  future,\n}: MemoryRouterProps): React.ReactElement {\n  let historyRef = React.useRef<MemoryHistory>();\n  if (historyRef.current == null) {\n    historyRef.current = createMemoryHistory({\n      initialEntries,\n      initialIndex,\n      v5Compat: true,\n    });\n  }\n\n  let history = historyRef.current;\n  let [state, setStateImpl] = React.useState({\n    action: history.action,\n    location: history.location,\n  });\n  let { v7_startTransition } = future || {};\n  let setState = React.useCallback(\n    (newState: { action: NavigationType; location: Location }) => {\n      v7_startTransition && startTransitionImpl\n        ? startTransitionImpl(() => setStateImpl(newState))\n        : setStateImpl(newState);\n    },\n    [setStateImpl, v7_startTransition]\n  );\n\n  React.useLayoutEffect(() => history.listen(setState), [history, setState]);\n\n  return (\n    <Router\n      basename={basename}\n      children={children}\n      location={state.location}\n      navigationType={state.action}\n      navigator={history}\n      future={future}\n    />\n  );\n}\n\nexport interface NavigateProps {\n  to: To;\n  replace?: boolean;\n  state?: any;\n  relative?: RelativeRoutingType;\n}\n\n/**\n * Changes the current location.\n *\n * Note: This API is mostly useful in React.Component subclasses that are not\n * able to use hooks. In functional components, we recommend you use the\n * `useNavigate` hook instead.\n *\n * @see https://reactrouter.com/components/navigate\n */\nexport function Navigate({\n  to,\n  replace,\n  state,\n  relative,\n}: NavigateProps): null {\n  invariant(\n    useInRouterContext(),\n    // TODO: This error is probably because they somehow have 2 versions of\n    // the router loaded. We can help them understand how to avoid that.\n    `<Navigate> may be used only in the context of a <Router> component.`\n  );\n\n  let { future, static: isStatic } = React.useContext(NavigationContext);\n\n  warning(\n    !isStatic,\n    `<Navigate> must not be used on the initial render in a <StaticRouter>. ` +\n      `This is a no-op, but you should modify your code so the <Navigate> is ` +\n      `only ever rendered in response to some user interaction or state change.`\n  );\n\n  let { matches } = React.useContext(RouteContext);\n  let { pathname: locationPathname } = useLocation();\n  let navigate = useNavigate();\n\n  // Resolve the path outside of the effect so that when effects run twice in\n  // StrictMode they navigate to the same place\n  let path = resolveTo(\n    to,\n    getResolveToMatches(matches, future.v7_relativeSplatPath),\n    locationPathname,\n    relative === \"path\"\n  );\n  let jsonPath = JSON.stringify(path);\n\n  React.useEffect(\n    () => navigate(JSON.parse(jsonPath), { replace, state, relative }),\n    [navigate, jsonPath, relative, replace, state]\n  );\n\n  return null;\n}\n\nexport interface OutletProps {\n  context?: unknown;\n}\n\n/**\n * Renders the child route's element, if there is one.\n *\n * @see https://reactrouter.com/components/outlet\n */\nexport function Outlet(props: OutletProps): React.ReactElement | null {\n  return useOutlet(props.context);\n}\n\nexport interface PathRouteProps {\n  caseSensitive?: NonIndexRouteObject[\"caseSensitive\"];\n  path?: NonIndexRouteObject[\"path\"];\n  id?: NonIndexRouteObject[\"id\"];\n  lazy?: LazyRouteFunction<NonIndexRouteObject>;\n  loader?: NonIndexRouteObject[\"loader\"];\n  action?: NonIndexRouteObject[\"action\"];\n  hasErrorBoundary?: NonIndexRouteObject[\"hasErrorBoundary\"];\n  shouldRevalidate?: NonIndexRouteObject[\"shouldRevalidate\"];\n  handle?: NonIndexRouteObject[\"handle\"];\n  index?: false;\n  children?: React.ReactNode;\n  element?: React.ReactNode | null;\n  hydrateFallbackElement?: React.ReactNode | null;\n  errorElement?: React.ReactNode | null;\n  Component?: React.ComponentType | null;\n  HydrateFallback?: React.ComponentType | null;\n  ErrorBoundary?: React.ComponentType | null;\n}\n\nexport interface LayoutRouteProps extends PathRouteProps {}\n\nexport interface IndexRouteProps {\n  caseSensitive?: IndexRouteObject[\"caseSensitive\"];\n  path?: IndexRouteObject[\"path\"];\n  id?: IndexRouteObject[\"id\"];\n  lazy?: LazyRouteFunction<IndexRouteObject>;\n  loader?: IndexRouteObject[\"loader\"];\n  action?: IndexRouteObject[\"action\"];\n  hasErrorBoundary?: IndexRouteObject[\"hasErrorBoundary\"];\n  shouldRevalidate?: IndexRouteObject[\"shouldRevalidate\"];\n  handle?: IndexRouteObject[\"handle\"];\n  index: true;\n  children?: undefined;\n  element?: React.ReactNode | null;\n  hydrateFallbackElement?: React.ReactNode | null;\n  errorElement?: React.ReactNode | null;\n  Component?: React.ComponentType | null;\n  HydrateFallback?: React.ComponentType | null;\n  ErrorBoundary?: React.ComponentType | null;\n}\n\nexport type RouteProps = PathRouteProps | LayoutRouteProps | IndexRouteProps;\n\n/**\n * Declares an element that should be rendered at a certain URL path.\n *\n * @see https://reactrouter.com/components/route\n */\nexport function Route(_props: RouteProps): React.ReactElement | null {\n  invariant(\n    false,\n    `A <Route> is only ever to be used as the child of <Routes> element, ` +\n      `never rendered directly. Please wrap your <Route> in a <Routes>.`\n  );\n}\n\nexport interface RouterProps {\n  basename?: string;\n  children?: React.ReactNode;\n  location: Partial<Location> | string;\n  navigationType?: NavigationType;\n  navigator: Navigator;\n  static?: boolean;\n  future?: Partial<Pick<FutureConfig, \"v7_relativeSplatPath\">>;\n}\n\n/**\n * Provides location context for the rest of the app.\n *\n * Note: You usually won't render a `<Router>` directly. Instead, you'll render a\n * router that is more specific to your environment such as a `<BrowserRouter>`\n * in web browsers or a `<StaticRouter>` for server rendering.\n *\n * @see https://reactrouter.com/router-components/router\n */\nexport function Router({\n  basename: basenameProp = \"/\",\n  children = null,\n  location: locationProp,\n  navigationType = NavigationType.Pop,\n  navigator,\n  static: staticProp = false,\n  future,\n}: RouterProps): React.ReactElement | null {\n  invariant(\n    !useInRouterContext(),\n    `You cannot render a <Router> inside another <Router>.` +\n      ` You should never have more than one in your app.`\n  );\n\n  // Preserve trailing slashes on basename, so we can let the user control\n  // the enforcement of trailing slashes throughout the app\n  let basename = basenameProp.replace(/^\\/*/, \"/\");\n  let navigationContext = React.useMemo(\n    () => ({\n      basename,\n      navigator,\n      static: staticProp,\n      future: {\n        v7_relativeSplatPath: false,\n        ...future,\n      },\n    }),\n    [basename, future, navigator, staticProp]\n  );\n\n  if (typeof locationProp === \"string\") {\n    locationProp = parsePath(locationProp);\n  }\n\n  let {\n    pathname = \"/\",\n    search = \"\",\n    hash = \"\",\n    state = null,\n    key = \"default\",\n  } = locationProp;\n\n  let locationContext = React.useMemo(() => {\n    let trailingPathname = stripBasename(pathname, basename);\n\n    if (trailingPathname == null) {\n      return null;\n    }\n\n    return {\n      location: {\n        pathname: trailingPathname,\n        search,\n        hash,\n        state,\n        key,\n      },\n      navigationType,\n    };\n  }, [basename, pathname, search, hash, state, key, navigationType]);\n\n  warning(\n    locationContext != null,\n    `<Router basename=\"${basename}\"> is not able to match the URL ` +\n      `\"${pathname}${search}${hash}\" because it does not start with the ` +\n      `basename, so the <Router> won't render anything.`\n  );\n\n  if (locationContext == null) {\n    return null;\n  }\n\n  return (\n    <NavigationContext.Provider value={navigationContext}>\n      <LocationContext.Provider children={children} value={locationContext} />\n    </NavigationContext.Provider>\n  );\n}\n\nexport interface RoutesProps {\n  children?: React.ReactNode;\n  location?: Partial<Location> | string;\n}\n\n/**\n * A container for a nested tree of `<Route>` elements that renders the branch\n * that best matches the current location.\n *\n * @see https://reactrouter.com/components/routes\n */\nexport function Routes({\n  children,\n  location,\n}: RoutesProps): React.ReactElement | null {\n  return useRoutes(createRoutesFromChildren(children), location);\n}\n\nexport interface AwaitResolveRenderFunction {\n  (data: Awaited<any>): React.ReactNode;\n}\n\nexport interface AwaitProps {\n  children: React.ReactNode | AwaitResolveRenderFunction;\n  errorElement?: React.ReactNode;\n  resolve: TrackedPromise | any;\n}\n\n/**\n * Component to use for rendering lazily loaded data from returning defer()\n * in a loader function\n */\nexport function Await({ children, errorElement, resolve }: AwaitProps) {\n  return (\n    <AwaitErrorBoundary resolve={resolve} errorElement={errorElement}>\n      <ResolveAwait>{children}</ResolveAwait>\n    </AwaitErrorBoundary>\n  );\n}\n\ntype AwaitErrorBoundaryProps = React.PropsWithChildren<{\n  errorElement?: React.ReactNode;\n  resolve: TrackedPromise | any;\n}>;\n\ntype AwaitErrorBoundaryState = {\n  error: any;\n};\n\nenum AwaitRenderStatus {\n  pending,\n  success,\n  error,\n}\n\nconst neverSettledPromise = new Promise(() => {});\n\nclass AwaitErrorBoundary extends React.Component<\n  AwaitErrorBoundaryProps,\n  AwaitErrorBoundaryState\n> {\n  constructor(props: AwaitErrorBoundaryProps) {\n    super(props);\n    this.state = { error: null };\n  }\n\n  static getDerivedStateFromError(error: any) {\n    return { error };\n  }\n\n  componentDidCatch(error: any, errorInfo: any) {\n    console.error(\n      \"<Await> caught the following error during render\",\n      error,\n      errorInfo\n    );\n  }\n\n  render() {\n    let { children, errorElement, resolve } = this.props;\n\n    let promise: TrackedPromise | null = null;\n    let status: AwaitRenderStatus = AwaitRenderStatus.pending;\n\n    if (!(resolve instanceof Promise)) {\n      // Didn't get a promise - provide as a resolved promise\n      status = AwaitRenderStatus.success;\n      promise = Promise.resolve();\n      Object.defineProperty(promise, \"_tracked\", { get: () => true });\n      Object.defineProperty(promise, \"_data\", { get: () => resolve });\n    } else if (this.state.error) {\n      // Caught a render error, provide it as a rejected promise\n      status = AwaitRenderStatus.error;\n      let renderError = this.state.error;\n      promise = Promise.reject().catch(() => {}); // Avoid unhandled rejection warnings\n      Object.defineProperty(promise, \"_tracked\", { get: () => true });\n      Object.defineProperty(promise, \"_error\", { get: () => renderError });\n    } else if ((resolve as TrackedPromise)._tracked) {\n      // Already tracked promise - check contents\n      promise = resolve;\n      status =\n        promise._error !== undefined\n          ? AwaitRenderStatus.error\n          : promise._data !== undefined\n          ? AwaitRenderStatus.success\n          : AwaitRenderStatus.pending;\n    } else {\n      // Raw (untracked) promise - track it\n      status = AwaitRenderStatus.pending;\n      Object.defineProperty(resolve, \"_tracked\", { get: () => true });\n      promise = resolve.then(\n        (data: any) =>\n          Object.defineProperty(resolve, \"_data\", { get: () => data }),\n        (error: any) =>\n          Object.defineProperty(resolve, \"_error\", { get: () => error })\n      );\n    }\n\n    if (\n      status === AwaitRenderStatus.error &&\n      promise._error instanceof AbortedDeferredError\n    ) {\n      // Freeze the UI by throwing a never resolved promise\n      throw neverSettledPromise;\n    }\n\n    if (status === AwaitRenderStatus.error && !errorElement) {\n      // No errorElement, throw to the nearest route-level error boundary\n      throw promise._error;\n    }\n\n    if (status === AwaitRenderStatus.error) {\n      // Render via our errorElement\n      return <AwaitContext.Provider value={promise} children={errorElement} />;\n    }\n\n    if (status === AwaitRenderStatus.success) {\n      // Render children with resolved value\n      return <AwaitContext.Provider value={promise} children={children} />;\n    }\n\n    // Throw to the suspense boundary\n    throw promise;\n  }\n}\n\n/**\n * @private\n * Indirection to leverage useAsyncValue for a render-prop API on `<Await>`\n */\nfunction ResolveAwait({\n  children,\n}: {\n  children: React.ReactNode | AwaitResolveRenderFunction;\n}) {\n  let data = useAsyncValue();\n  let toRender = typeof children === \"function\" ? children(data) : children;\n  return <>{toRender}</>;\n}\n\n///////////////////////////////////////////////////////////////////////////////\n// UTILS\n///////////////////////////////////////////////////////////////////////////////\n\n/**\n * Creates a route config from a React \"children\" object, which is usually\n * either a `<Route>` element or an array of them. Used internally by\n * `<Routes>` to create a route config from its children.\n *\n * @see https://reactrouter.com/utils/create-routes-from-children\n */\nexport function createRoutesFromChildren(\n  children: React.ReactNode,\n  parentPath: number[] = []\n): RouteObject[] {\n  let routes: RouteObject[] = [];\n\n  React.Children.forEach(children, (element, index) => {\n    if (!React.isValidElement(element)) {\n      // Ignore non-elements. This allows people to more easily inline\n      // conditionals in their route config.\n      return;\n    }\n\n    let treePath = [...parentPath, index];\n\n    if (element.type === React.Fragment) {\n      // Transparently support React.Fragment and its children.\n      routes.push.apply(\n        routes,\n        createRoutesFromChildren(element.props.children, treePath)\n      );\n      return;\n    }\n\n    invariant(\n      element.type === Route,\n      `[${\n        typeof element.type === \"string\" ? element.type : element.type.name\n      }] is not a <Route> component. All component children of <Routes> must be a <Route> or <React.Fragment>`\n    );\n\n    invariant(\n      !element.props.index || !element.props.children,\n      \"An index route cannot have child routes.\"\n    );\n\n    let route: RouteObject = {\n      id: element.props.id || treePath.join(\"-\"),\n      caseSensitive: element.props.caseSensitive,\n      element: element.props.element,\n      Component: element.props.Component,\n      index: element.props.index,\n      path: element.props.path,\n      loader: element.props.loader,\n      action: element.props.action,\n      errorElement: element.props.errorElement,\n      ErrorBoundary: element.props.ErrorBoundary,\n      hasErrorBoundary:\n        element.props.ErrorBoundary != null ||\n        element.props.errorElement != null,\n      shouldRevalidate: element.props.shouldRevalidate,\n      handle: element.props.handle,\n      lazy: element.props.lazy,\n    };\n\n    if (element.props.children) {\n      route.children = createRoutesFromChildren(\n        element.props.children,\n        treePath\n      );\n    }\n\n    routes.push(route);\n  });\n\n  return routes;\n}\n\n/**\n * Renders the result of `matchRoutes()` into a React element.\n */\nexport function renderMatches(\n  matches: RouteMatch[] | null\n): React.ReactElement | null {\n  return _renderMatches(matches);\n}\n","/**\n * @license React\n * react-jsx-runtime.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n'use strict';var f=require(\"react\"),k=Symbol.for(\"react.element\"),l=Symbol.for(\"react.fragment\"),m=Object.prototype.hasOwnProperty,n=f.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED.ReactCurrentOwner,p={key:!0,ref:!0,__self:!0,__source:!0};\nfunction q(c,a,g){var b,d={},e=null,h=null;void 0!==g&&(e=\"\"+g);void 0!==a.key&&(e=\"\"+a.key);void 0!==a.ref&&(h=a.ref);for(b in a)m.call(a,b)&&!p.hasOwnProperty(b)&&(d[b]=a[b]);if(c&&c.defaultProps)for(b in a=c.defaultProps,a)void 0===d[b]&&(d[b]=a[b]);return{$$typeof:k,type:c,key:e,ref:h,props:d,_owner:n.current}}exports.Fragment=l;exports.jsx=q;exports.jsxs=q;\n","/**\n * @license React\n * react.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n'use strict';var l=Symbol.for(\"react.element\"),n=Symbol.for(\"react.portal\"),p=Symbol.for(\"react.fragment\"),q=Symbol.for(\"react.strict_mode\"),r=Symbol.for(\"react.profiler\"),t=Symbol.for(\"react.provider\"),u=Symbol.for(\"react.context\"),v=Symbol.for(\"react.forward_ref\"),w=Symbol.for(\"react.suspense\"),x=Symbol.for(\"react.memo\"),y=Symbol.for(\"react.lazy\"),z=Symbol.iterator;function A(a){if(null===a||\"object\"!==typeof a)return null;a=z&&a[z]||a[\"@@iterator\"];return\"function\"===typeof a?a:null}\nvar B={isMounted:function(){return!1},enqueueForceUpdate:function(){},enqueueReplaceState:function(){},enqueueSetState:function(){}},C=Object.assign,D={};function E(a,b,e){this.props=a;this.context=b;this.refs=D;this.updater=e||B}E.prototype.isReactComponent={};\nE.prototype.setState=function(a,b){if(\"object\"!==typeof a&&\"function\"!==typeof a&&null!=a)throw Error(\"setState(...): takes an object of state variables to update or a function which returns an object of state variables.\");this.updater.enqueueSetState(this,a,b,\"setState\")};E.prototype.forceUpdate=function(a){this.updater.enqueueForceUpdate(this,a,\"forceUpdate\")};function F(){}F.prototype=E.prototype;function G(a,b,e){this.props=a;this.context=b;this.refs=D;this.updater=e||B}var H=G.prototype=new F;\nH.constructor=G;C(H,E.prototype);H.isPureReactComponent=!0;var I=Array.isArray,J=Object.prototype.hasOwnProperty,K={current:null},L={key:!0,ref:!0,__self:!0,__source:!0};\nfunction M(a,b,e){var d,c={},k=null,h=null;if(null!=b)for(d in void 0!==b.ref&&(h=b.ref),void 0!==b.key&&(k=\"\"+b.key),b)J.call(b,d)&&!L.hasOwnProperty(d)&&(c[d]=b[d]);var g=arguments.length-2;if(1===g)c.children=e;else if(1<g){for(var f=Array(g),m=0;m<g;m++)f[m]=arguments[m+2];c.children=f}if(a&&a.defaultProps)for(d in g=a.defaultProps,g)void 0===c[d]&&(c[d]=g[d]);return{$$typeof:l,type:a,key:k,ref:h,props:c,_owner:K.current}}\nfunction N(a,b){return{$$typeof:l,type:a.type,key:b,ref:a.ref,props:a.props,_owner:a._owner}}function O(a){return\"object\"===typeof a&&null!==a&&a.$$typeof===l}function escape(a){var b={\"=\":\"=0\",\":\":\"=2\"};return\"$\"+a.replace(/[=:]/g,function(a){return b[a]})}var P=/\\/+/g;function Q(a,b){return\"object\"===typeof a&&null!==a&&null!=a.key?escape(\"\"+a.key):b.toString(36)}\nfunction R(a,b,e,d,c){var k=typeof a;if(\"undefined\"===k||\"boolean\"===k)a=null;var h=!1;if(null===a)h=!0;else switch(k){case \"string\":case \"number\":h=!0;break;case \"object\":switch(a.$$typeof){case l:case n:h=!0}}if(h)return h=a,c=c(h),a=\"\"===d?\".\"+Q(h,0):d,I(c)?(e=\"\",null!=a&&(e=a.replace(P,\"$&/\")+\"/\"),R(c,b,e,\"\",function(a){return a})):null!=c&&(O(c)&&(c=N(c,e+(!c.key||h&&h.key===c.key?\"\":(\"\"+c.key).replace(P,\"$&/\")+\"/\")+a)),b.push(c)),1;h=0;d=\"\"===d?\".\":d+\":\";if(I(a))for(var g=0;g<a.length;g++){k=\na[g];var f=d+Q(k,g);h+=R(k,b,e,f,c)}else if(f=A(a),\"function\"===typeof f)for(a=f.call(a),g=0;!(k=a.next()).done;)k=k.value,f=d+Q(k,g++),h+=R(k,b,e,f,c);else if(\"object\"===k)throw b=String(a),Error(\"Objects are not valid as a React child (found: \"+(\"[object Object]\"===b?\"object with keys {\"+Object.keys(a).join(\", \")+\"}\":b)+\"). If you meant to render a collection of children, use an array instead.\");return h}\nfunction S(a,b,e){if(null==a)return a;var d=[],c=0;R(a,d,\"\",\"\",function(a){return b.call(e,a,c++)});return d}function T(a){if(-1===a._status){var b=a._result;b=b();b.then(function(b){if(0===a._status||-1===a._status)a._status=1,a._result=b},function(b){if(0===a._status||-1===a._status)a._status=2,a._result=b});-1===a._status&&(a._status=0,a._result=b)}if(1===a._status)return a._result.default;throw a._result;}\nvar U={current:null},V={transition:null},W={ReactCurrentDispatcher:U,ReactCurrentBatchConfig:V,ReactCurrentOwner:K};exports.Children={map:S,forEach:function(a,b,e){S(a,function(){b.apply(this,arguments)},e)},count:function(a){var b=0;S(a,function(){b++});return b},toArray:function(a){return S(a,function(a){return a})||[]},only:function(a){if(!O(a))throw Error(\"React.Children.only expected to receive a single React element child.\");return a}};exports.Component=E;exports.Fragment=p;\nexports.Profiler=r;exports.PureComponent=G;exports.StrictMode=q;exports.Suspense=w;exports.__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED=W;\nexports.cloneElement=function(a,b,e){if(null===a||void 0===a)throw Error(\"React.cloneElement(...): The argument must be a React element, but you passed \"+a+\".\");var d=C({},a.props),c=a.key,k=a.ref,h=a._owner;if(null!=b){void 0!==b.ref&&(k=b.ref,h=K.current);void 0!==b.key&&(c=\"\"+b.key);if(a.type&&a.type.defaultProps)var g=a.type.defaultProps;for(f in b)J.call(b,f)&&!L.hasOwnProperty(f)&&(d[f]=void 0===b[f]&&void 0!==g?g[f]:b[f])}var f=arguments.length-2;if(1===f)d.children=e;else if(1<f){g=Array(f);\nfor(var m=0;m<f;m++)g[m]=arguments[m+2];d.children=g}return{$$typeof:l,type:a.type,key:c,ref:k,props:d,_owner:h}};exports.createContext=function(a){a={$$typeof:u,_currentValue:a,_currentValue2:a,_threadCount:0,Provider:null,Consumer:null,_defaultValue:null,_globalName:null};a.Provider={$$typeof:t,_context:a};return a.Consumer=a};exports.createElement=M;exports.createFactory=function(a){var b=M.bind(null,a);b.type=a;return b};exports.createRef=function(){return{current:null}};\nexports.forwardRef=function(a){return{$$typeof:v,render:a}};exports.isValidElement=O;exports.lazy=function(a){return{$$typeof:y,_payload:{_status:-1,_result:a},_init:T}};exports.memo=function(a,b){return{$$typeof:x,type:a,compare:void 0===b?null:b}};exports.startTransition=function(a){var b=V.transition;V.transition={};try{a()}finally{V.transition=b}};exports.unstable_act=function(){throw Error(\"act(...) is not supported in production builds of React.\");};\nexports.useCallback=function(a,b){return U.current.useCallback(a,b)};exports.useContext=function(a){return U.current.useContext(a)};exports.useDebugValue=function(){};exports.useDeferredValue=function(a){return U.current.useDeferredValue(a)};exports.useEffect=function(a,b){return U.current.useEffect(a,b)};exports.useId=function(){return U.current.useId()};exports.useImperativeHandle=function(a,b,e){return U.current.useImperativeHandle(a,b,e)};\nexports.useInsertionEffect=function(a,b){return U.current.useInsertionEffect(a,b)};exports.useLayoutEffect=function(a,b){return U.current.useLayoutEffect(a,b)};exports.useMemo=function(a,b){return U.current.useMemo(a,b)};exports.useReducer=function(a,b,e){return U.current.useReducer(a,b,e)};exports.useRef=function(a){return U.current.useRef(a)};exports.useState=function(a){return U.current.useState(a)};exports.useSyncExternalStore=function(a,b,e){return U.current.useSyncExternalStore(a,b,e)};\nexports.useTransition=function(){return U.current.useTransition()};exports.version=\"18.2.0\";\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/react.production.min.js');\n} else {\n  module.exports = require('./cjs/react.development.js');\n}\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/react-jsx-runtime.production.min.js');\n} else {\n  module.exports = require('./cjs/react-jsx-runtime.development.js');\n}\n","/**\n * @license React\n * scheduler.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n'use strict';function f(a,b){var c=a.length;a.push(b);a:for(;0<c;){var d=c-1>>>1,e=a[d];if(0<g(e,b))a[d]=b,a[c]=e,c=d;else break a}}function h(a){return 0===a.length?null:a[0]}function k(a){if(0===a.length)return null;var b=a[0],c=a.pop();if(c!==b){a[0]=c;a:for(var d=0,e=a.length,w=e>>>1;d<w;){var m=2*(d+1)-1,C=a[m],n=m+1,x=a[n];if(0>g(C,c))n<e&&0>g(x,C)?(a[d]=x,a[n]=c,d=n):(a[d]=C,a[m]=c,d=m);else if(n<e&&0>g(x,c))a[d]=x,a[n]=c,d=n;else break a}}return b}\nfunction g(a,b){var c=a.sortIndex-b.sortIndex;return 0!==c?c:a.id-b.id}if(\"object\"===typeof performance&&\"function\"===typeof performance.now){var l=performance;exports.unstable_now=function(){return l.now()}}else{var p=Date,q=p.now();exports.unstable_now=function(){return p.now()-q}}var r=[],t=[],u=1,v=null,y=3,z=!1,A=!1,B=!1,D=\"function\"===typeof setTimeout?setTimeout:null,E=\"function\"===typeof clearTimeout?clearTimeout:null,F=\"undefined\"!==typeof setImmediate?setImmediate:null;\n\"undefined\"!==typeof navigator&&void 0!==navigator.scheduling&&void 0!==navigator.scheduling.isInputPending&&navigator.scheduling.isInputPending.bind(navigator.scheduling);function G(a){for(var b=h(t);null!==b;){if(null===b.callback)k(t);else if(b.startTime<=a)k(t),b.sortIndex=b.expirationTime,f(r,b);else break;b=h(t)}}function H(a){B=!1;G(a);if(!A)if(null!==h(r))A=!0,I(J);else{var b=h(t);null!==b&&K(H,b.startTime-a)}}\nfunction J(a,b){A=!1;B&&(B=!1,E(L),L=-1);z=!0;var c=y;try{G(b);for(v=h(r);null!==v&&(!(v.expirationTime>b)||a&&!M());){var d=v.callback;if(\"function\"===typeof d){v.callback=null;y=v.priorityLevel;var e=d(v.expirationTime<=b);b=exports.unstable_now();\"function\"===typeof e?v.callback=e:v===h(r)&&k(r);G(b)}else k(r);v=h(r)}if(null!==v)var w=!0;else{var m=h(t);null!==m&&K(H,m.startTime-b);w=!1}return w}finally{v=null,y=c,z=!1}}var N=!1,O=null,L=-1,P=5,Q=-1;\nfunction M(){return exports.unstable_now()-Q<P?!1:!0}function R(){if(null!==O){var a=exports.unstable_now();Q=a;var b=!0;try{b=O(!0,a)}finally{b?S():(N=!1,O=null)}}else N=!1}var S;if(\"function\"===typeof F)S=function(){F(R)};else if(\"undefined\"!==typeof MessageChannel){var T=new MessageChannel,U=T.port2;T.port1.onmessage=R;S=function(){U.postMessage(null)}}else S=function(){D(R,0)};function I(a){O=a;N||(N=!0,S())}function K(a,b){L=D(function(){a(exports.unstable_now())},b)}\nexports.unstable_IdlePriority=5;exports.unstable_ImmediatePriority=1;exports.unstable_LowPriority=4;exports.unstable_NormalPriority=3;exports.unstable_Profiling=null;exports.unstable_UserBlockingPriority=2;exports.unstable_cancelCallback=function(a){a.callback=null};exports.unstable_continueExecution=function(){A||z||(A=!0,I(J))};\nexports.unstable_forceFrameRate=function(a){0>a||125<a?console.error(\"forceFrameRate takes a positive int between 0 and 125, forcing frame rates higher than 125 fps is not supported\"):P=0<a?Math.floor(1E3/a):5};exports.unstable_getCurrentPriorityLevel=function(){return y};exports.unstable_getFirstCallbackNode=function(){return h(r)};exports.unstable_next=function(a){switch(y){case 1:case 2:case 3:var b=3;break;default:b=y}var c=y;y=b;try{return a()}finally{y=c}};exports.unstable_pauseExecution=function(){};\nexports.unstable_requestPaint=function(){};exports.unstable_runWithPriority=function(a,b){switch(a){case 1:case 2:case 3:case 4:case 5:break;default:a=3}var c=y;y=a;try{return b()}finally{y=c}};\nexports.unstable_scheduleCallback=function(a,b,c){var d=exports.unstable_now();\"object\"===typeof c&&null!==c?(c=c.delay,c=\"number\"===typeof c&&0<c?d+c:d):c=d;switch(a){case 1:var e=-1;break;case 2:e=250;break;case 5:e=1073741823;break;case 4:e=1E4;break;default:e=5E3}e=c+e;a={id:u++,callback:b,priorityLevel:a,startTime:c,expirationTime:e,sortIndex:-1};c>d?(a.sortIndex=c,f(t,a),null===h(r)&&a===h(t)&&(B?(E(L),L=-1):B=!0,K(H,c-d))):(a.sortIndex=e,f(r,a),A||z||(A=!0,I(J)));return a};\nexports.unstable_shouldYield=M;exports.unstable_wrapCallback=function(a){var b=y;return function(){var c=y;y=b;try{return a.apply(this,arguments)}finally{y=c}}};\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/scheduler.production.min.js');\n} else {\n  module.exports = require('./cjs/scheduler.development.js');\n}\n","/**\n * @license React\n * use-sync-external-store-with-selector.production.min.js\n *\n * Copyright (c) Facebook, Inc. and its affiliates.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n'use strict';var g=require(\"react\");function n(a,b){return a===b&&(0!==a||1/a===1/b)||a!==a&&b!==b}var p=\"function\"===typeof Object.is?Object.is:n,q=g.useSyncExternalStore,r=g.useRef,t=g.useEffect,u=g.useMemo,v=g.useDebugValue;\nexports.useSyncExternalStoreWithSelector=function(a,b,e,l,h){var c=r(null);if(null===c.current){var f={hasValue:!1,value:null};c.current=f}else f=c.current;c=u(function(){function a(a){if(!c){c=!0;d=a;a=l(a);if(void 0!==h&&f.hasValue){var b=f.value;if(h(b,a))return k=b}return k=a}b=k;if(p(d,a))return b;var e=l(a);if(void 0!==h&&h(b,e))return b;d=a;return k=e}var c=!1,d,k,m=void 0===e?null:e;return[function(){return a(b())},null===m?void 0:function(){return a(m())}]},[b,e,l,h]);var d=q(a,c[0],c[1]);\nt(function(){f.hasValue=!0;f.value=d},[d]);v(d);return d};\n","'use strict';\n\nif (process.env.NODE_ENV === 'production') {\n  module.exports = require('./cjs/use-sync-external-store-with-selector.production.min.js');\n} else {\n  module.exports = require('./cjs/use-sync-external-store-with-selector.development.js');\n}\n","import { runIdentityFunctionCheck } from './devModeChecks/identityFunctionCheck'\nimport { runInputStabilityCheck } from './devModeChecks/inputStabilityCheck'\nimport { globalDevModeChecks } from './devModeChecks/setGlobalDevModeChecks'\n// eslint-disable-next-line @typescript-eslint/consistent-type-imports\nimport type {\n  DevModeChecks,\n  Selector,\n  SelectorArray,\n  DevModeChecksExecutionInfo\n} from './types'\n\nexport const NOT_FOUND = 'NOT_FOUND'\nexport type NOT_FOUND_TYPE = typeof NOT_FOUND\n\n/**\n * Assert that the provided value is a function. If the assertion fails,\n * a `TypeError` is thrown with an optional custom error message.\n *\n * @param func - The value to be checked.\n * @param  errorMessage - An optional custom error message to use if the assertion fails.\n * @throws A `TypeError` if the assertion fails.\n */\nexport function assertIsFunction<FunctionType extends Function>(\n  func: unknown,\n  errorMessage = `expected a function, instead received ${typeof func}`\n): asserts func is FunctionType {\n  if (typeof func !== 'function') {\n    throw new TypeError(errorMessage)\n  }\n}\n\n/**\n * Assert that the provided value is an object. If the assertion fails,\n * a `TypeError` is thrown with an optional custom error message.\n *\n * @param object - The value to be checked.\n * @param  errorMessage - An optional custom error message to use if the assertion fails.\n * @throws A `TypeError` if the assertion fails.\n */\nexport function assertIsObject<ObjectType extends Record<string, unknown>>(\n  object: unknown,\n  errorMessage = `expected an object, instead received ${typeof object}`\n): asserts object is ObjectType {\n  if (typeof object !== 'object') {\n    throw new TypeError(errorMessage)\n  }\n}\n\n/**\n * Assert that the provided array is an array of functions. If the assertion fails,\n * a `TypeError` is thrown with an optional custom error message.\n *\n * @param array - The array to be checked.\n * @param  errorMessage - An optional custom error message to use if the assertion fails.\n * @throws A `TypeError` if the assertion fails.\n */\nexport function assertIsArrayOfFunctions<FunctionType extends Function>(\n  array: unknown[],\n  errorMessage = `expected all items to be functions, instead received the following types: `\n): asserts array is FunctionType[] {\n  if (\n    !array.every((item): item is FunctionType => typeof item === 'function')\n  ) {\n    const itemTypes = array\n      .map(item =>\n        typeof item === 'function'\n          ? `function ${item.name || 'unnamed'}()`\n          : typeof item\n      )\n      .join(', ')\n    throw new TypeError(`${errorMessage}[${itemTypes}]`)\n  }\n}\n\n/**\n * Ensure that the input is an array. If it's already an array, it's returned as is.\n * If it's not an array, it will be wrapped in a new array.\n *\n * @param item - The item to be checked.\n * @returns An array containing the input item. If the input is already an array, it's returned without modification.\n */\nexport const ensureIsArray = (item: unknown) => {\n  return Array.isArray(item) ? item : [item]\n}\n\n/**\n * Extracts the \"dependencies\" / \"input selectors\" from the arguments of `createSelector`.\n *\n * @param createSelectorArgs - Arguments passed to `createSelector` as an array.\n * @returns An array of \"input selectors\" / \"dependencies\".\n * @throws A `TypeError` if any of the input selectors is not function.\n */\nexport function getDependencies(createSelectorArgs: unknown[]) {\n  const dependencies = Array.isArray(createSelectorArgs[0])\n    ? createSelectorArgs[0]\n    : createSelectorArgs\n\n  assertIsArrayOfFunctions<Selector>(\n    dependencies,\n    `createSelector expects all input-selectors to be functions, but received the following types: `\n  )\n\n  return dependencies as SelectorArray\n}\n\n/**\n * Runs each input selector and returns their collective results as an array.\n *\n * @param dependencies - An array of \"dependencies\" or \"input selectors\".\n * @param inputSelectorArgs - An array of arguments being passed to the input selectors.\n * @returns An array of input selector results.\n */\nexport function collectInputSelectorResults(\n  dependencies: SelectorArray,\n  inputSelectorArgs: unknown[] | IArguments\n) {\n  const inputSelectorResults = []\n  const { length } = dependencies\n  for (let i = 0; i < length; i++) {\n    // @ts-ignore\n    // apply arguments instead of spreading and mutate a local list of params for performance.\n    inputSelectorResults.push(dependencies[i].apply(null, inputSelectorArgs))\n  }\n  return inputSelectorResults\n}\n\n/**\n * Retrieves execution information for development mode checks.\n *\n * @param devModeChecks - Custom Settings for development mode checks. These settings will override the global defaults.\n * @param firstRun - Indicates whether it is the first time the selector has run.\n * @returns  An object containing the execution information for each development mode check.\n */\nexport const getDevModeChecksExecutionInfo = (\n  firstRun: boolean,\n  devModeChecks: Partial<DevModeChecks>\n) => {\n  const { identityFunctionCheck, inputStabilityCheck } = {\n    ...globalDevModeChecks,\n    ...devModeChecks\n  }\n  return {\n    identityFunctionCheck: {\n      shouldRun:\n        identityFunctionCheck === 'always' ||\n        (identityFunctionCheck === 'once' && firstRun),\n      run: runIdentityFunctionCheck\n    },\n    inputStabilityCheck: {\n      shouldRun:\n        inputStabilityCheck === 'always' ||\n        (inputStabilityCheck === 'once' && firstRun),\n      run: runInputStabilityCheck\n    }\n  } satisfies DevModeChecksExecutionInfo\n}\n","// Original source:\n// - https://github.com/simonihmig/tracked-redux/blob/master/packages/tracked-redux/src/-private/proxy.ts\n\nimport type { Node, Tag } from './tracking'\nimport {\n  consumeCollection,\n  consumeTag,\n  createTag,\n  dirtyCollection,\n  dirtyTag\n} from './tracking'\n\nexport const REDUX_PROXY_LABEL = Symbol()\n\nlet nextId = 0\n\nconst proto = Object.getPrototypeOf({})\n\nclass ObjectTreeNode<T extends Record<string, unknown>> implements Node<T> {\n  proxy: T = new Proxy(this, objectProxyHandler) as unknown as T\n  tag = createTag()\n  tags = {} as Record<string, Tag>\n  children = {} as Record<string, Node>\n  collectionTag = null\n  id = nextId++\n\n  constructor(public value: T) {\n    this.value = value\n    this.tag.value = value\n  }\n}\n\nconst objectProxyHandler = {\n  get(node: Node, key: string | symbol): unknown {\n    function calculateResult() {\n      const { value } = node\n\n      const childValue = Reflect.get(value, key)\n\n      if (typeof key === 'symbol') {\n        return childValue\n      }\n\n      if (key in proto) {\n        return childValue\n      }\n\n      if (typeof childValue === 'object' && childValue !== null) {\n        let childNode = node.children[key]\n\n        if (childNode === undefined) {\n          childNode = node.children[key] = createNode(childValue)\n        }\n\n        if (childNode.tag) {\n          consumeTag(childNode.tag)\n        }\n\n        return childNode.proxy\n      } else {\n        let tag = node.tags[key]\n\n        if (tag === undefined) {\n          tag = node.tags[key] = createTag()\n          tag.value = childValue\n        }\n\n        consumeTag(tag)\n\n        return childValue\n      }\n    }\n    const res = calculateResult()\n    return res\n  },\n\n  ownKeys(node: Node): ArrayLike<string | symbol> {\n    consumeCollection(node)\n    return Reflect.ownKeys(node.value)\n  },\n\n  getOwnPropertyDescriptor(\n    node: Node,\n    prop: string | symbol\n  ): PropertyDescriptor | undefined {\n    return Reflect.getOwnPropertyDescriptor(node.value, prop)\n  },\n\n  has(node: Node, prop: string | symbol): boolean {\n    return Reflect.has(node.value, prop)\n  }\n}\n\nclass ArrayTreeNode<T extends Array<unknown>> implements Node<T> {\n  proxy: T = new Proxy([this], arrayProxyHandler) as unknown as T\n  tag = createTag()\n  tags = {}\n  children = {}\n  collectionTag = null\n  id = nextId++\n\n  constructor(public value: T) {\n    this.value = value\n    this.tag.value = value\n  }\n}\n\nconst arrayProxyHandler = {\n  get([node]: [Node], key: string | symbol): unknown {\n    if (key === 'length') {\n      consumeCollection(node)\n    }\n\n    return objectProxyHandler.get(node, key)\n  },\n\n  ownKeys([node]: [Node]): ArrayLike<string | symbol> {\n    return objectProxyHandler.ownKeys(node)\n  },\n\n  getOwnPropertyDescriptor(\n    [node]: [Node],\n    prop: string | symbol\n  ): PropertyDescriptor | undefined {\n    return objectProxyHandler.getOwnPropertyDescriptor(node, prop)\n  },\n\n  has([node]: [Node], prop: string | symbol): boolean {\n    return objectProxyHandler.has(node, prop)\n  }\n}\n\nexport function createNode<T extends Array<unknown> | Record<string, unknown>>(\n  value: T\n): Node<T> {\n  if (Array.isArray(value)) {\n    return new ArrayTreeNode(value)\n  }\n\n  return new ObjectTreeNode(value) as Node<T>\n}\n\nconst keysMap = new WeakMap<\n  Array<unknown> | Record<string, unknown>,\n  Set<string>\n>()\n\nexport function updateNode<T extends Array<unknown> | Record<string, unknown>>(\n  node: Node<T>,\n  newValue: T\n): void {\n  const { value, tags, children } = node\n\n  node.value = newValue\n\n  if (\n    Array.isArray(value) &&\n    Array.isArray(newValue) &&\n    value.length !== newValue.length\n  ) {\n    dirtyCollection(node)\n  } else {\n    if (value !== newValue) {\n      let oldKeysSize = 0\n      let newKeysSize = 0\n      let anyKeysAdded = false\n\n      for (const _key in value) {\n        oldKeysSize++\n      }\n\n      for (const key in newValue) {\n        newKeysSize++\n        if (!(key in value)) {\n          anyKeysAdded = true\n          break\n        }\n      }\n\n      const isDifferent = anyKeysAdded || oldKeysSize !== newKeysSize\n\n      if (isDifferent) {\n        dirtyCollection(node)\n      }\n    }\n  }\n\n  for (const key in tags) {\n    const childValue = (value as Record<string, unknown>)[key]\n    const newChildValue = (newValue as Record<string, unknown>)[key]\n\n    if (childValue !== newChildValue) {\n      dirtyCollection(node)\n      dirtyTag(tags[key], newChildValue)\n    }\n\n    if (typeof newChildValue === 'object' && newChildValue !== null) {\n      delete tags[key]\n    }\n  }\n\n  for (const key in children) {\n    const childNode = children[key]\n    const newChildValue = (newValue as Record<string, unknown>)[key]\n\n    const childValue = childNode.value\n\n    if (childValue === newChildValue) {\n      continue\n    } else if (typeof newChildValue === 'object' && newChildValue !== null) {\n      updateNode(childNode, newChildValue as Record<string, unknown>)\n    } else {\n      deleteNode(childNode)\n      delete children[key]\n    }\n  }\n}\n\nfunction deleteNode(node: Node): void {\n  if (node.tag) {\n    dirtyTag(node.tag, null)\n  }\n  dirtyCollection(node)\n  for (const key in node.tags) {\n    dirtyTag(node.tags[key], null)\n  }\n  for (const key in node.children) {\n    deleteNode(node.children[key])\n  }\n}\n","// Original source:\n// - https://github.com/facebook/react/blob/0b974418c9a56f6c560298560265dcf4b65784bc/packages/react/src/ReactCache.js\n\nimport type {\n  AnyFunction,\n  DefaultMemoizeFields,\n  EqualityFn,\n  Simplify\n} from './types'\n\nclass StrongRef<T> {\n  constructor(private value: T) {}\n  deref() {\n    return this.value\n  }\n}\n\nconst Ref =\n  typeof WeakRef !== 'undefined'\n    ? WeakRef\n    : (StrongRef as unknown as typeof WeakRef)\n\nconst UNTERMINATED = 0\nconst TERMINATED = 1\n\ninterface UnterminatedCacheNode<T> {\n  /**\n   * Status, represents whether the cached computation returned a value or threw an error.\n   */\n  s: 0\n  /**\n   * Value, either the cached result or an error, depending on status.\n   */\n  v: void\n  /**\n   * Object cache, a `WeakMap` where non-primitive arguments are stored.\n   */\n  o: null | WeakMap<Function | Object, CacheNode<T>>\n  /**\n   * Primitive cache, a regular Map where primitive arguments are stored.\n   */\n  p: null | Map<string | number | null | void | symbol | boolean, CacheNode<T>>\n}\n\ninterface TerminatedCacheNode<T> {\n  /**\n   * Status, represents whether the cached computation returned a value or threw an error.\n   */\n  s: 1\n  /**\n   * Value, either the cached result or an error, depending on status.\n   */\n  v: T\n  /**\n   * Object cache, a `WeakMap` where non-primitive arguments are stored.\n   */\n  o: null | WeakMap<Function | Object, CacheNode<T>>\n  /**\n   * Primitive cache, a regular `Map` where primitive arguments are stored.\n   */\n  p: null | Map<string | number | null | void | symbol | boolean, CacheNode<T>>\n}\n\ntype CacheNode<T> = TerminatedCacheNode<T> | UnterminatedCacheNode<T>\n\nfunction createCacheNode<T>(): CacheNode<T> {\n  return {\n    s: UNTERMINATED,\n    v: undefined,\n    o: null,\n    p: null\n  }\n}\n\n/**\n * Configuration options for a memoization function utilizing `WeakMap` for\n * its caching mechanism.\n *\n * @template Result - The type of the return value of the memoized function.\n *\n * @since 5.0.0\n * @public\n */\nexport interface WeakMapMemoizeOptions<Result = any> {\n  /**\n   * If provided, used to compare a newly generated output value against previous values in the cache.\n   * If a match is found, the old value is returned. This addresses the common\n   * ```ts\n   * todos.map(todo => todo.id)\n   * ```\n   * use case, where an update to another field in the original data causes a recalculation\n   * due to changed references, but the output is still effectively the same.\n   *\n   * @since 5.0.0\n   */\n  resultEqualityCheck?: EqualityFn<Result>\n}\n\n/**\n * Creates a tree of `WeakMap`-based cache nodes based on the identity of the\n * arguments it's been called with (in this case, the extracted values from your input selectors).\n * This allows `weakMapMemoize` to have an effectively infinite cache size.\n * Cache results will be kept in memory as long as references to the arguments still exist,\n * and then cleared out as the arguments are garbage-collected.\n *\n * __Design Tradeoffs for `weakMapMemoize`:__\n * - Pros:\n *   - It has an effectively infinite cache size, but you have no control over\n *   how long values are kept in cache as it's based on garbage collection and `WeakMap`s.\n * - Cons:\n *   - There's currently no way to alter the argument comparisons.\n *   They're based on strict reference equality.\n *   - It's roughly the same speed as `lruMemoize`, although likely a fraction slower.\n *\n * __Use Cases for `weakMapMemoize`:__\n * - This memoizer is likely best used for cases where you need to call the\n * same selector instance with many different arguments, such as a single\n * selector instance that is used in a list item component and called with\n * item IDs like:\n *   ```ts\n *   useSelector(state => selectSomeData(state, props.category))\n *   ```\n * @param func - The function to be memoized.\n * @returns A memoized function with a `.clearCache()` method attached.\n *\n * @example\n * <caption>Using `createSelector`</caption>\n * ```ts\n * import { createSelector, weakMapMemoize } from 'reselect'\n *\n * interface RootState {\n *   items: { id: number; category: string; name: string }[]\n * }\n *\n * const selectItemsByCategory = createSelector(\n *   [\n *     (state: RootState) => state.items,\n *     (state: RootState, category: string) => category\n *   ],\n *   (items, category) => items.filter(item => item.category === category),\n *   {\n *     memoize: weakMapMemoize,\n *     argsMemoize: weakMapMemoize\n *   }\n * )\n * ```\n *\n * @example\n * <caption>Using `createSelectorCreator`</caption>\n * ```ts\n * import { createSelectorCreator, weakMapMemoize } from 'reselect'\n *\n * const createSelectorWeakMap = createSelectorCreator({ memoize: weakMapMemoize, argsMemoize: weakMapMemoize })\n *\n * const selectItemsByCategory = createSelectorWeakMap(\n *   [\n *     (state: RootState) => state.items,\n *     (state: RootState, category: string) => category\n *   ],\n *   (items, category) => items.filter(item => item.category === category)\n * )\n * ```\n *\n * @template Func - The type of the function that is memoized.\n *\n * @see {@link https://reselect.js.org/api/weakMapMemoize `weakMapMemoize`}\n *\n * @since 5.0.0\n * @public\n * @experimental\n */\nexport function weakMapMemoize<Func extends AnyFunction>(\n  func: Func,\n  options: WeakMapMemoizeOptions<ReturnType<Func>> = {}\n) {\n  let fnNode = createCacheNode()\n  const { resultEqualityCheck } = options\n\n  let lastResult: WeakRef<object> | undefined\n\n  let resultsCount = 0\n\n  function memoized() {\n    let cacheNode = fnNode\n    const { length } = arguments\n    for (let i = 0, l = length; i < l; i++) {\n      const arg = arguments[i]\n      if (\n        typeof arg === 'function' ||\n        (typeof arg === 'object' && arg !== null)\n      ) {\n        // Objects go into a WeakMap\n        let objectCache = cacheNode.o\n        if (objectCache === null) {\n          cacheNode.o = objectCache = new WeakMap()\n        }\n        const objectNode = objectCache.get(arg)\n        if (objectNode === undefined) {\n          cacheNode = createCacheNode()\n          objectCache.set(arg, cacheNode)\n        } else {\n          cacheNode = objectNode\n        }\n      } else {\n        // Primitives go into a regular Map\n        let primitiveCache = cacheNode.p\n        if (primitiveCache === null) {\n          cacheNode.p = primitiveCache = new Map()\n        }\n        const primitiveNode = primitiveCache.get(arg)\n        if (primitiveNode === undefined) {\n          cacheNode = createCacheNode()\n          primitiveCache.set(arg, cacheNode)\n        } else {\n          cacheNode = primitiveNode\n        }\n      }\n    }\n\n    const terminatedNode = cacheNode as unknown as TerminatedCacheNode<any>\n\n    let result\n\n    if (cacheNode.s === TERMINATED) {\n      result = cacheNode.v\n    } else {\n      // Allow errors to propagate\n      result = func.apply(null, arguments as unknown as any[])\n      resultsCount++\n    }\n\n    terminatedNode.s = TERMINATED\n\n    if (resultEqualityCheck) {\n      const lastResultValue = lastResult?.deref?.() ?? lastResult\n      if (\n        lastResultValue != null &&\n        resultEqualityCheck(lastResultValue as ReturnType<Func>, result)\n      ) {\n        result = lastResultValue\n        resultsCount !== 0 && resultsCount--\n      }\n\n      const needsWeakRef =\n        (typeof result === 'object' && result !== null) ||\n        typeof result === 'function'\n      lastResult = needsWeakRef ? new Ref(result) : result\n    }\n    terminatedNode.v = result\n    return result\n  }\n\n  memoized.clearCache = () => {\n    fnNode = createCacheNode()\n    memoized.resetResultsCount()\n  }\n\n  memoized.resultsCount = () => resultsCount\n\n  memoized.resetResultsCount = () => {\n    resultsCount = 0\n  }\n\n  return memoized as Func & Simplify<DefaultMemoizeFields>\n}\n","import { weakMapMemoize } from './weakMapMemoize'\n\nimport type {\n  Combiner,\n  CreateSelectorOptions,\n  DropFirstParameter,\n  ExtractMemoizerFields,\n  GetParamsFromSelectors,\n  GetStateFromSelectors,\n  InterruptRecursion,\n  OutputSelector,\n  Selector,\n  SelectorArray,\n  SetRequired,\n  Simplify,\n  UnknownMemoizer\n} from './types'\n\nimport {\n  assertIsFunction,\n  collectInputSelectorResults,\n  ensureIsArray,\n  getDependencies,\n  getDevModeChecksExecutionInfo\n} from './utils'\n\n/**\n * An instance of `createSelector`, customized with a given memoize implementation.\n *\n * @template MemoizeFunction - The type of the memoize function that is used to memoize the `resultFunc` inside `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`).\n * @template ArgsMemoizeFunction - The type of the optional memoize function that is used to memoize the arguments passed into the output selector generated by `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`). If none is explicitly provided, `weakMapMemoize` will be used.\n * @template StateType - The type of state that the selectors created with this selector creator will operate on.\n *\n * @public\n */\nexport interface CreateSelectorFunction<\n  MemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize,\n  ArgsMemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize,\n  StateType = any\n> {\n  /**\n   * Creates a memoized selector function.\n   *\n   * @param createSelectorArgs - An arbitrary number of input selectors as separate inline arguments and a `combiner` function.\n   * @returns A memoized output selector.\n   *\n   * @template InputSelectors - The type of the input selectors as an array.\n   * @template Result - The return type of the `combiner` as well as the output selector.\n   * @template OverrideMemoizeFunction - The type of the optional `memoize` function that could be passed into the options object to override the original `memoize` function that was initially passed into `createSelectorCreator`.\n   * @template OverrideArgsMemoizeFunction - The type of the optional `argsMemoize` function that could be passed into the options object to override the original `argsMemoize` function that was initially passed into `createSelectorCreator`.\n   *\n   * @see {@link https://reselect.js.org/api/createselector `createSelector`}\n   */\n  <InputSelectors extends SelectorArray<StateType>, Result>(\n    ...createSelectorArgs: [\n      ...inputSelectors: InputSelectors,\n      combiner: Combiner<InputSelectors, Result>\n    ]\n  ): OutputSelector<\n    InputSelectors,\n    Result,\n    MemoizeFunction,\n    ArgsMemoizeFunction\n  > &\n    InterruptRecursion\n\n  /**\n   * Creates a memoized selector function.\n   *\n   * @param createSelectorArgs - An arbitrary number of input selectors as separate inline arguments, a `combiner` function and an `options` object.\n   * @returns A memoized output selector.\n   *\n   * @template InputSelectors - The type of the input selectors as an array.\n   * @template Result - The return type of the `combiner` as well as the output selector.\n   * @template OverrideMemoizeFunction - The type of the optional `memoize` function that could be passed into the options object to override the original `memoize` function that was initially passed into `createSelectorCreator`.\n   * @template OverrideArgsMemoizeFunction - The type of the optional `argsMemoize` function that could be passed into the options object to override the original `argsMemoize` function that was initially passed into `createSelectorCreator`.\n   *\n   * @see {@link https://reselect.js.org/api/createselector `createSelector`}\n   */\n  <\n    InputSelectors extends SelectorArray<StateType>,\n    Result,\n    OverrideMemoizeFunction extends UnknownMemoizer = MemoizeFunction,\n    OverrideArgsMemoizeFunction extends UnknownMemoizer = ArgsMemoizeFunction\n  >(\n    ...createSelectorArgs: [\n      ...inputSelectors: InputSelectors,\n      combiner: Combiner<InputSelectors, Result>,\n      createSelectorOptions: Simplify<\n        CreateSelectorOptions<\n          MemoizeFunction,\n          ArgsMemoizeFunction,\n          OverrideMemoizeFunction,\n          OverrideArgsMemoizeFunction\n        >\n      >\n    ]\n  ): OutputSelector<\n    InputSelectors,\n    Result,\n    OverrideMemoizeFunction,\n    OverrideArgsMemoizeFunction\n  > &\n    InterruptRecursion\n\n  /**\n   * Creates a memoized selector function.\n   *\n   * @param inputSelectors - An array of input selectors.\n   * @param combiner - A function that Combines the input selectors and returns an output selector. Otherwise known as the result function.\n   * @param createSelectorOptions - An optional options object that allows for further customization per selector.\n   * @returns A memoized output selector.\n   *\n   * @template InputSelectors - The type of the input selectors array.\n   * @template Result - The return type of the `combiner` as well as the output selector.\n   * @template OverrideMemoizeFunction - The type of the optional `memoize` function that could be passed into the options object to override the original `memoize` function that was initially passed into `createSelectorCreator`.\n   * @template OverrideArgsMemoizeFunction - The type of the optional `argsMemoize` function that could be passed into the options object to override the original `argsMemoize` function that was initially passed into `createSelectorCreator`.\n   *\n   * @see {@link https://reselect.js.org/api/createselector `createSelector`}\n   */\n  <\n    InputSelectors extends SelectorArray<StateType>,\n    Result,\n    OverrideMemoizeFunction extends UnknownMemoizer = MemoizeFunction,\n    OverrideArgsMemoizeFunction extends UnknownMemoizer = ArgsMemoizeFunction\n  >(\n    inputSelectors: [...InputSelectors],\n    combiner: Combiner<InputSelectors, Result>,\n    createSelectorOptions?: Simplify<\n      CreateSelectorOptions<\n        MemoizeFunction,\n        ArgsMemoizeFunction,\n        OverrideMemoizeFunction,\n        OverrideArgsMemoizeFunction\n      >\n    >\n  ): OutputSelector<\n    InputSelectors,\n    Result,\n    OverrideMemoizeFunction,\n    OverrideArgsMemoizeFunction\n  > &\n    InterruptRecursion\n\n  /**\n   * Creates a \"pre-typed\" version of {@linkcode createSelector createSelector}\n   * where the `state` type is predefined.\n   *\n   * This allows you to set the `state` type once, eliminating the need to\n   * specify it with every {@linkcode createSelector createSelector} call.\n   *\n   * @returns A pre-typed `createSelector` with the state type already defined.\n   *\n   * @example\n   * ```ts\n   * import { createSelector } from 'reselect'\n   *\n   * export interface RootState {\n   *   todos: { id: number; completed: boolean }[]\n   *   alerts: { id: number; read: boolean }[]\n   * }\n   *\n   * export const createAppSelector = createSelector.withTypes<RootState>()\n   *\n   * const selectTodoIds = createAppSelector(\n   *   [\n   *     // Type of `state` is set to `RootState`, no need to manually set the type\n   *     state => state.todos\n   *   ],\n   *   todos => todos.map(({ id }) => id)\n   * )\n   * ```\n   * @template OverrideStateType - The specific type of state used by all selectors created with this selector creator.\n   *\n   * @see {@link https://reselect.js.org/api/createselector#defining-a-pre-typed-createselector `createSelector.withTypes`}\n   *\n   * @since 5.1.0\n   */\n  withTypes: <OverrideStateType extends StateType>() => CreateSelectorFunction<\n    MemoizeFunction,\n    ArgsMemoizeFunction,\n    OverrideStateType\n  >\n}\n\n/**\n * Creates a selector creator function with the specified memoization function\n * and options for customizing memoization behavior.\n *\n * @param options - An options object containing the `memoize` function responsible for memoizing the `resultFunc` inside `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`). It also provides additional options for customizing memoization. While the `memoize` property is mandatory, the rest are optional.\n * @returns A customized `createSelector` function.\n *\n * @example\n * ```ts\n * const customCreateSelector = createSelectorCreator({\n *   memoize: customMemoize, // Function to be used to memoize `resultFunc`\n *   memoizeOptions: [memoizeOption1, memoizeOption2], // Options passed to `customMemoize` as the second argument onwards\n *   argsMemoize: customArgsMemoize, // Function to be used to memoize the selector's arguments\n *   argsMemoizeOptions: [argsMemoizeOption1, argsMemoizeOption2] // Options passed to `customArgsMemoize` as the second argument onwards\n * })\n *\n * const customSelector = customCreateSelector(\n *   [inputSelector1, inputSelector2],\n *   resultFunc // `resultFunc` will be passed as the first argument to `customMemoize`\n * )\n *\n * customSelector(\n *   ...selectorArgs // Will be memoized by `customArgsMemoize`\n * )\n * ```\n *\n * @template MemoizeFunction - The type of the memoize function that is used to memoize the `resultFunc` inside `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`).\n * @template ArgsMemoizeFunction - The type of the optional memoize function that is used to memoize the arguments passed into the output selector generated by `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`). If none is explicitly provided, `weakMapMemoize` will be used.\n *\n * @see {@link https://reselect.js.org/api/createSelectorCreator#using-options-since-500 `createSelectorCreator`}\n *\n * @since 5.0.0\n * @public\n */\nexport function createSelectorCreator<\n  MemoizeFunction extends UnknownMemoizer,\n  ArgsMemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize\n>(\n  options: Simplify<\n    SetRequired<\n      CreateSelectorOptions<\n        typeof weakMapMemoize,\n        typeof weakMapMemoize,\n        MemoizeFunction,\n        ArgsMemoizeFunction\n      >,\n      'memoize'\n    >\n  >\n): CreateSelectorFunction<MemoizeFunction, ArgsMemoizeFunction>\n\n/**\n * Creates a selector creator function with the specified memoization function\n * and options for customizing memoization behavior.\n *\n * @param memoize - The `memoize` function responsible for memoizing the `resultFunc` inside `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`).\n * @param memoizeOptionsFromArgs - Optional configuration options for the memoization function. These options are then passed to the memoize function as the second argument onwards.\n * @returns A customized `createSelector` function.\n *\n * @example\n * ```ts\n * const customCreateSelector = createSelectorCreator(customMemoize, // Function to be used to memoize `resultFunc`\n *   option1, // Will be passed as second argument to `customMemoize`\n *   option2, // Will be passed as third argument to `customMemoize`\n *   option3 // Will be passed as fourth argument to `customMemoize`\n * )\n *\n * const customSelector = customCreateSelector(\n *   [inputSelector1, inputSelector2],\n *   resultFunc // `resultFunc` will be passed as the first argument to `customMemoize`\n * )\n * ```\n *\n * @template MemoizeFunction - The type of the memoize function that is used to memoize the `resultFunc` inside `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`).\n *\n * @see {@link https://reselect.js.org/api/createSelectorCreator#using-memoize-and-memoizeoptions `createSelectorCreator`}\n *\n * @public\n */\nexport function createSelectorCreator<MemoizeFunction extends UnknownMemoizer>(\n  memoize: MemoizeFunction,\n  ...memoizeOptionsFromArgs: DropFirstParameter<MemoizeFunction>\n): CreateSelectorFunction<MemoizeFunction>\n\n/**\n * Creates a selector creator function with the specified memoization\n * function and options for customizing memoization behavior.\n *\n * @param memoizeOrOptions - Either A `memoize` function or an `options` object containing the `memoize` function.\n * @param memoizeOptionsFromArgs - Optional configuration options for the memoization function. These options are then passed to the memoize function as the second argument onwards.\n * @returns A customized `createSelector` function.\n *\n * @template MemoizeFunction - The type of the memoize function that is used to memoize the `resultFunc` inside `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`).\n * @template ArgsMemoizeFunction - The type of the optional memoize function that is used to memoize the arguments passed into the output selector generated by `createSelector` (e.g., `lruMemoize` or `weakMapMemoize`). If none is explicitly provided, `weakMapMemoize` will be used.\n * @template MemoizeOrOptions - The type of the first argument. It can either be a `memoize` function or an `options` object containing the `memoize` function.\n */\nexport function createSelectorCreator<\n  MemoizeFunction extends UnknownMemoizer,\n  ArgsMemoizeFunction extends UnknownMemoizer,\n  MemoizeOrOptions extends\n    | MemoizeFunction\n    | SetRequired<\n        CreateSelectorOptions<MemoizeFunction, ArgsMemoizeFunction>,\n        'memoize'\n      >\n>(\n  memoizeOrOptions: MemoizeOrOptions,\n  ...memoizeOptionsFromArgs: MemoizeOrOptions extends SetRequired<\n    CreateSelectorOptions<MemoizeFunction, ArgsMemoizeFunction>,\n    'memoize'\n  >\n    ? never\n    : DropFirstParameter<MemoizeFunction>\n) {\n  /** options initially passed into `createSelectorCreator`. */\n  const createSelectorCreatorOptions: SetRequired<\n    CreateSelectorOptions<MemoizeFunction, ArgsMemoizeFunction>,\n    'memoize'\n  > = typeof memoizeOrOptions === 'function'\n    ? {\n        memoize: memoizeOrOptions as MemoizeFunction,\n        memoizeOptions: memoizeOptionsFromArgs\n      }\n    : memoizeOrOptions\n\n  const createSelector = <\n    InputSelectors extends SelectorArray,\n    Result,\n    OverrideMemoizeFunction extends UnknownMemoizer = MemoizeFunction,\n    OverrideArgsMemoizeFunction extends UnknownMemoizer = ArgsMemoizeFunction\n  >(\n    ...createSelectorArgs: [\n      ...inputSelectors: [...InputSelectors],\n      combiner: Combiner<InputSelectors, Result>,\n      createSelectorOptions?: CreateSelectorOptions<\n        MemoizeFunction,\n        ArgsMemoizeFunction,\n        OverrideMemoizeFunction,\n        OverrideArgsMemoizeFunction\n      >\n    ]\n  ) => {\n    let recomputations = 0\n    let dependencyRecomputations = 0\n    let lastResult: Result\n\n    // Due to the intricacies of rest params, we can't do an optional arg after `...createSelectorArgs`.\n    // So, start by declaring the default value here.\n    // (And yes, the words 'memoize' and 'options' appear too many times in this next sequence.)\n    let directlyPassedOptions: CreateSelectorOptions<\n      MemoizeFunction,\n      ArgsMemoizeFunction,\n      OverrideMemoizeFunction,\n      OverrideArgsMemoizeFunction\n    > = {}\n\n    // Normally, the result func or \"combiner\" is the last arg\n    let resultFunc = createSelectorArgs.pop() as\n      | Combiner<InputSelectors, Result>\n      | CreateSelectorOptions<\n          MemoizeFunction,\n          ArgsMemoizeFunction,\n          OverrideMemoizeFunction,\n          OverrideArgsMemoizeFunction\n        >\n\n    // If the result func is actually an _object_, assume it's our options object\n    if (typeof resultFunc === 'object') {\n      directlyPassedOptions = resultFunc\n      // and pop the real result func off\n      resultFunc = createSelectorArgs.pop() as Combiner<InputSelectors, Result>\n    }\n\n    assertIsFunction(\n      resultFunc,\n      `createSelector expects an output function after the inputs, but received: [${typeof resultFunc}]`\n    )\n\n    // Determine which set of options we're using. Prefer options passed directly,\n    // but fall back to options given to `createSelectorCreator`.\n    const combinedOptions = {\n      ...createSelectorCreatorOptions,\n      ...directlyPassedOptions\n    }\n\n    const {\n      memoize,\n      memoizeOptions = [],\n      argsMemoize = weakMapMemoize,\n      argsMemoizeOptions = [],\n      devModeChecks = {}\n    } = combinedOptions\n\n    // Simplifying assumption: it's unlikely that the first options arg of the provided memoizer\n    // is an array. In most libs I've looked at, it's an equality function or options object.\n    // Based on that, if `memoizeOptions` _is_ an array, we assume it's a full\n    // user-provided array of options. Otherwise, it must be just the _first_ arg, and so\n    // we wrap it in an array so we can apply it.\n    const finalMemoizeOptions = ensureIsArray(memoizeOptions)\n    const finalArgsMemoizeOptions = ensureIsArray(argsMemoizeOptions)\n    const dependencies = getDependencies(createSelectorArgs) as InputSelectors\n\n    const memoizedResultFunc = memoize(function recomputationWrapper() {\n      recomputations++\n      // apply arguments instead of spreading for performance.\n      // @ts-ignore\n      return (resultFunc as Combiner<InputSelectors, Result>).apply(\n        null,\n        arguments\n      )\n    }, ...finalMemoizeOptions) as Combiner<InputSelectors, Result> &\n      ExtractMemoizerFields<OverrideMemoizeFunction>\n\n    let firstRun = true\n\n    // If a selector is called with the exact same arguments we don't need to traverse our dependencies again.\n    const selector = argsMemoize(function dependenciesChecker() {\n      dependencyRecomputations++\n      /** Return values of input selectors which the `resultFunc` takes as arguments. */\n      const inputSelectorResults = collectInputSelectorResults(\n        dependencies,\n        arguments\n      )\n\n      // apply arguments instead of spreading for performance.\n      // @ts-ignore\n      lastResult = memoizedResultFunc.apply(null, inputSelectorResults)\n\n      if (process.env.NODE_ENV !== 'production') {\n        const { identityFunctionCheck, inputStabilityCheck } =\n          getDevModeChecksExecutionInfo(firstRun, devModeChecks)\n        if (identityFunctionCheck.shouldRun) {\n          identityFunctionCheck.run(\n            resultFunc as Combiner<InputSelectors, Result>,\n            inputSelectorResults,\n            lastResult\n          )\n        }\n\n        if (inputStabilityCheck.shouldRun) {\n          // make a second copy of the params, to check if we got the same results\n          const inputSelectorResultsCopy = collectInputSelectorResults(\n            dependencies,\n            arguments\n          )\n\n          inputStabilityCheck.run(\n            { inputSelectorResults, inputSelectorResultsCopy },\n            { memoize, memoizeOptions: finalMemoizeOptions },\n            arguments\n          )\n        }\n\n        if (firstRun) firstRun = false\n      }\n\n      return lastResult\n    }, ...finalArgsMemoizeOptions) as unknown as Selector<\n      GetStateFromSelectors<InputSelectors>,\n      Result,\n      GetParamsFromSelectors<InputSelectors>\n    > &\n      ExtractMemoizerFields<OverrideArgsMemoizeFunction>\n\n    return Object.assign(selector, {\n      resultFunc,\n      memoizedResultFunc,\n      dependencies,\n      dependencyRecomputations: () => dependencyRecomputations,\n      resetDependencyRecomputations: () => {\n        dependencyRecomputations = 0\n      },\n      lastResult: () => lastResult,\n      recomputations: () => recomputations,\n      resetRecomputations: () => {\n        recomputations = 0\n      },\n      memoize,\n      argsMemoize\n    }) as OutputSelector<\n      InputSelectors,\n      Result,\n      OverrideMemoizeFunction,\n      OverrideArgsMemoizeFunction\n    >\n  }\n\n  Object.assign(createSelector, {\n    withTypes: () => createSelector\n  })\n\n  return createSelector as CreateSelectorFunction<\n    MemoizeFunction,\n    ArgsMemoizeFunction\n  >\n}\n\n/**\n * Accepts one or more \"input selectors\" (either as separate arguments or a single array),\n * a single \"result function\" / \"combiner\", and an optional options object, and\n * generates a memoized selector function.\n *\n * @see {@link https://reselect.js.org/api/createSelector `createSelector`}\n *\n * @public\n */\nexport const createSelector =\n  /* #__PURE__ */ createSelectorCreator(weakMapMemoize)\n","import { createSelector } from './createSelectorCreator'\n\nimport type { CreateSelectorFunction } from './createSelectorCreator'\nimport type {\n  InterruptRecursion,\n  ObjectValuesToTuple,\n  OutputSelector,\n  Selector,\n  Simplify,\n  UnknownMemoizer\n} from './types'\nimport { assertIsObject } from './utils'\nimport type { weakMapMemoize } from './weakMapMemoize'\n\n/**\n * Represents a mapping of selectors to their return types.\n *\n * @template TObject - An object type where each property is a selector function.\n *\n * @public\n */\nexport type SelectorResultsMap<TObject extends SelectorsObject> = {\n  [Key in keyof TObject]: ReturnType<TObject[Key]>\n}\n\n/**\n * Represents a mapping of selectors for each key in a given root state.\n *\n * This type is a utility that takes a root state object type and\n * generates a corresponding set of selectors. Each selector is associated\n * with a key in the root state, allowing for the selection\n * of specific parts of the state.\n *\n * @template RootState - The type of the root state object.\n *\n * @since 5.0.0\n * @public\n */\nexport type RootStateSelectors<RootState = any> = {\n  [Key in keyof RootState]: Selector<RootState, RootState[Key], []>\n}\n\n/**\n * @deprecated Please use {@linkcode StructuredSelectorCreator.withTypes createStructuredSelector.withTypes<RootState>()} instead. This type will be removed in the future.\n * @template RootState - The type of the root state object.\n *\n * @since 5.0.0\n * @public\n */\nexport type TypedStructuredSelectorCreator<RootState = any> =\n  /**\n   * A convenience function that simplifies returning an object\n   * made up of selector results.\n   *\n   * @param inputSelectorsObject - A key value pair consisting of input selectors.\n   * @param selectorCreator - A custom selector creator function. It defaults to `createSelector`.\n   * @returns A memoized structured selector.\n   *\n   * @example\n   * <caption>Modern Use Case</caption>\n   * ```ts\n   * import { createSelector, createStructuredSelector } from 'reselect'\n   *\n   * interface RootState {\n   *   todos: {\n   *     id: number\n   *     completed: boolean\n   *     title: string\n   *     description: string\n   *   }[]\n   *   alerts: { id: number; read: boolean }[]\n   * }\n   *\n   * // This:\n   * const structuredSelector = createStructuredSelector(\n   *   {\n   *     todos: (state: RootState) => state.todos,\n   *     alerts: (state: RootState) => state.alerts,\n   *     todoById: (state: RootState, id: number) => state.todos[id]\n   *   },\n   *   createSelector\n   * )\n   *\n   * // Is essentially the same as this:\n   * const selector = createSelector(\n   *   [\n   *     (state: RootState) => state.todos,\n   *     (state: RootState) => state.alerts,\n   *     (state: RootState, id: number) => state.todos[id]\n   *   ],\n   *   (todos, alerts, todoById) => {\n   *     return {\n   *       todos,\n   *       alerts,\n   *       todoById\n   *     }\n   *   }\n   * )\n   * ```\n   *\n   * @example\n   * <caption>In your component:</caption>\n   * ```tsx\n   * import type { RootState } from 'createStructuredSelector/modernUseCase'\n   * import { structuredSelector } from 'createStructuredSelector/modernUseCase'\n   * import type { FC } from 'react'\n   * import { useSelector } from 'react-redux'\n   *\n   * interface Props {\n   *   id: number\n   * }\n   *\n   * const MyComponent: FC<Props> = ({ id }) => {\n   *   const { todos, alerts, todoById } = useSelector((state: RootState) =>\n   *     structuredSelector(state, id)\n   *   )\n   *\n   *   return (\n   *     <div>\n   *       Next to do is:\n   *       <h2>{todoById.title}</h2>\n   *       <p>Description: {todoById.description}</p>\n   *       <ul>\n   *         <h3>All other to dos:</h3>\n   *         {todos.map(todo => (\n   *           <li key={todo.id}>{todo.title}</li>\n   *         ))}\n   *       </ul>\n   *     </div>\n   *   )\n   * }\n   * ```\n   *\n   * @example\n   * <caption>Simple Use Case</caption>\n   * ```ts\n   * const selectA = state => state.a\n   * const selectB = state => state.b\n   *\n   * // The result function in the following selector\n   * // is simply building an object from the input selectors\n   * const structuredSelector = createSelector(selectA, selectB, (a, b) => ({\n   *   a,\n   *   b\n   * }))\n   *\n   * const result = structuredSelector({ a: 1, b: 2 }) // will produce { x: 1, y: 2 }\n   * ```\n   *\n   * @template InputSelectorsObject - The shape of the input selectors object.\n   * @template MemoizeFunction - The type of the memoize function that is used to create the structured selector. It defaults to `weakMapMemoize`.\n   * @template ArgsMemoizeFunction - The type of the of the memoize function that is used to memoize the arguments passed into the generated structured selector. It defaults to `weakMapMemoize`.\n   *\n   * @see {@link https://reselect.js.org/api/createStructuredSelector `createStructuredSelector`}\n   */\n  <\n    InputSelectorsObject extends RootStateSelectors<RootState> = RootStateSelectors<RootState>,\n    MemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize,\n    ArgsMemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize\n  >(\n    inputSelectorsObject: InputSelectorsObject,\n    selectorCreator?: CreateSelectorFunction<\n      MemoizeFunction,\n      ArgsMemoizeFunction\n    >\n  ) => OutputSelector<\n    ObjectValuesToTuple<InputSelectorsObject>,\n    Simplify<SelectorResultsMap<InputSelectorsObject>>,\n    MemoizeFunction,\n    ArgsMemoizeFunction\n  > &\n    InterruptRecursion\n\n/**\n * Represents an object where each property is a selector function.\n *\n * @template StateType - The type of state that all the selectors operate on.\n *\n * @public\n */\nexport type SelectorsObject<StateType = any> = Record<\n  string,\n  Selector<StateType>\n>\n\n/**\n * It provides a way to create structured selectors.\n * The structured selector can take multiple input selectors\n * and map their output to an object with specific keys.\n *\n * @template StateType - The type of state that the structured selectors created with this structured selector creator will operate on.\n *\n * @see {@link https://reselect.js.org/api/createStructuredSelector `createStructuredSelector`}\n *\n * @public\n */\nexport interface StructuredSelectorCreator<StateType = any> {\n  /**\n   * A convenience function that simplifies returning an object\n   * made up of selector results.\n   *\n   * @param inputSelectorsObject - A key value pair consisting of input selectors.\n   * @param selectorCreator - A custom selector creator function. It defaults to `createSelector`.\n   * @returns A memoized structured selector.\n   *\n   * @example\n   * <caption>Modern Use Case</caption>\n   * ```ts\n   * import { createSelector, createStructuredSelector } from 'reselect'\n   *\n   * interface RootState {\n   *   todos: {\n   *     id: number\n   *     completed: boolean\n   *     title: string\n   *     description: string\n   *   }[]\n   *   alerts: { id: number; read: boolean }[]\n   * }\n   *\n   * // This:\n   * const structuredSelector = createStructuredSelector(\n   *   {\n   *     todos: (state: RootState) => state.todos,\n   *     alerts: (state: RootState) => state.alerts,\n   *     todoById: (state: RootState, id: number) => state.todos[id]\n   *   },\n   *   createSelector\n   * )\n   *\n   * // Is essentially the same as this:\n   * const selector = createSelector(\n   *   [\n   *     (state: RootState) => state.todos,\n   *     (state: RootState) => state.alerts,\n   *     (state: RootState, id: number) => state.todos[id]\n   *   ],\n   *   (todos, alerts, todoById) => {\n   *     return {\n   *       todos,\n   *       alerts,\n   *       todoById\n   *     }\n   *   }\n   * )\n   * ```\n   *\n   * @example\n   * <caption>In your component:</caption>\n   * ```tsx\n   * import type { RootState } from 'createStructuredSelector/modernUseCase'\n   * import { structuredSelector } from 'createStructuredSelector/modernUseCase'\n   * import type { FC } from 'react'\n   * import { useSelector } from 'react-redux'\n   *\n   * interface Props {\n   *   id: number\n   * }\n   *\n   * const MyComponent: FC<Props> = ({ id }) => {\n   *   const { todos, alerts, todoById } = useSelector((state: RootState) =>\n   *     structuredSelector(state, id)\n   *   )\n   *\n   *   return (\n   *     <div>\n   *       Next to do is:\n   *       <h2>{todoById.title}</h2>\n   *       <p>Description: {todoById.description}</p>\n   *       <ul>\n   *         <h3>All other to dos:</h3>\n   *         {todos.map(todo => (\n   *           <li key={todo.id}>{todo.title}</li>\n   *         ))}\n   *       </ul>\n   *     </div>\n   *   )\n   * }\n   * ```\n   *\n   * @example\n   * <caption>Simple Use Case</caption>\n   * ```ts\n   * const selectA = state => state.a\n   * const selectB = state => state.b\n   *\n   * // The result function in the following selector\n   * // is simply building an object from the input selectors\n   * const structuredSelector = createSelector(selectA, selectB, (a, b) => ({\n   *   a,\n   *   b\n   * }))\n   *\n   * const result = structuredSelector({ a: 1, b: 2 }) // will produce { x: 1, y: 2 }\n   * ```\n   *\n   * @template InputSelectorsObject - The shape of the input selectors object.\n   * @template MemoizeFunction - The type of the memoize function that is used to create the structured selector. It defaults to `weakMapMemoize`.\n   * @template ArgsMemoizeFunction - The type of the of the memoize function that is used to memoize the arguments passed into the generated structured selector. It defaults to `weakMapMemoize`.\n   *\n   * @see {@link https://reselect.js.org/api/createStructuredSelector `createStructuredSelector`}\n   */\n  <\n    InputSelectorsObject extends SelectorsObject<StateType>,\n    MemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize,\n    ArgsMemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize\n  >(\n    inputSelectorsObject: InputSelectorsObject,\n    selectorCreator?: CreateSelectorFunction<\n      MemoizeFunction,\n      ArgsMemoizeFunction\n    >\n  ): OutputSelector<\n    ObjectValuesToTuple<InputSelectorsObject>,\n    Simplify<SelectorResultsMap<InputSelectorsObject>>,\n    MemoizeFunction,\n    ArgsMemoizeFunction\n  > &\n    InterruptRecursion\n\n  /**\n   * Creates a \"pre-typed\" version of\n   * {@linkcode createStructuredSelector createStructuredSelector}\n   * where the `state` type is predefined.\n   *\n   * This allows you to set the `state` type once, eliminating the need to\n   * specify it with every\n   * {@linkcode createStructuredSelector createStructuredSelector} call.\n   *\n   * @returns A pre-typed `createStructuredSelector` with the state type already defined.\n   *\n   * @example\n   * ```ts\n   * import { createStructuredSelector } from 'reselect'\n   *\n   * export interface RootState {\n   *   todos: { id: number; completed: boolean }[]\n   *   alerts: { id: number; read: boolean }[]\n   * }\n   *\n   * export const createStructuredAppSelector =\n   *   createStructuredSelector.withTypes<RootState>()\n   *\n   * const structuredAppSelector = createStructuredAppSelector({\n   *   // Type of `state` is set to `RootState`, no need to manually set the type\n   *   todos: state => state.todos,\n   *   alerts: state => state.alerts,\n   *   todoById: (state, id: number) => state.todos[id]\n   * })\n   *\n   * ```\n   * @template OverrideStateType - The specific type of state used by all structured selectors created with this structured selector creator.\n   *\n   * @see {@link https://reselect.js.org/api/createstructuredselector#defining-a-pre-typed-createstructuredselector `createSelector.withTypes`}\n   *\n   * @since 5.1.0\n   */\n  withTypes: <\n    OverrideStateType extends StateType\n  >() => StructuredSelectorCreator<OverrideStateType>\n}\n\n/**\n * A convenience function that simplifies returning an object\n * made up of selector results.\n *\n * @param inputSelectorsObject - A key value pair consisting of input selectors.\n * @param selectorCreator - A custom selector creator function. It defaults to `createSelector`.\n * @returns A memoized structured selector.\n *\n * @example\n * <caption>Modern Use Case</caption>\n * ```ts\n * import { createSelector, createStructuredSelector } from 'reselect'\n *\n * interface RootState {\n *   todos: {\n *     id: number\n *     completed: boolean\n *     title: string\n *     description: string\n *   }[]\n *   alerts: { id: number; read: boolean }[]\n * }\n *\n * // This:\n * const structuredSelector = createStructuredSelector(\n *   {\n *     todos: (state: RootState) => state.todos,\n *     alerts: (state: RootState) => state.alerts,\n *     todoById: (state: RootState, id: number) => state.todos[id]\n *   },\n *   createSelector\n * )\n *\n * // Is essentially the same as this:\n * const selector = createSelector(\n *   [\n *     (state: RootState) => state.todos,\n *     (state: RootState) => state.alerts,\n *     (state: RootState, id: number) => state.todos[id]\n *   ],\n *   (todos, alerts, todoById) => {\n *     return {\n *       todos,\n *       alerts,\n *       todoById\n *     }\n *   }\n * )\n * ```\n *\n * @see {@link https://reselect.js.org/api/createStructuredSelector `createStructuredSelector`}\n *\n * @public\n */\nexport const createStructuredSelector: StructuredSelectorCreator =\n  Object.assign(\n    <\n      InputSelectorsObject extends SelectorsObject,\n      MemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize,\n      ArgsMemoizeFunction extends UnknownMemoizer = typeof weakMapMemoize\n    >(\n      inputSelectorsObject: InputSelectorsObject,\n      selectorCreator: CreateSelectorFunction<\n        MemoizeFunction,\n        ArgsMemoizeFunction\n      > = createSelector as CreateSelectorFunction<\n        MemoizeFunction,\n        ArgsMemoizeFunction\n      >\n    ) => {\n      assertIsObject(\n        inputSelectorsObject,\n        'createStructuredSelector expects first argument to be an object ' +\n          `where each property is a selector, instead received a ${typeof inputSelectorsObject}`\n      )\n      const inputSelectorKeys = Object.keys(inputSelectorsObject)\n      const dependencies = inputSelectorKeys.map(\n        key => inputSelectorsObject[key]\n      )\n      const structuredSelector = selectorCreator(\n        dependencies,\n        (...inputSelectorResults: any[]) => {\n          return inputSelectorResults.reduce((composition, value, index) => {\n            composition[inputSelectorKeys[index]] = value\n            return composition\n          }, {})\n        }\n      )\n      return structuredSelector\n    },\n    { withTypes: () => createStructuredSelector }\n  ) as StructuredSelectorCreator\n","/**\n * Adapted from React: https://github.com/facebook/react/blob/master/packages/shared/formatProdErrorMessage.js\n *\n * Do not require this module directly! Use normal throw error calls. These messages will be replaced with error codes\n * during build.\n * @param {number} code\n */\nexport function formatProdErrorMessage(code: number) {\n  return `Minified Redux error #${code}; visit https://redux.js.org/Errors?code=${code} for the full message or ` + 'use the non-minified dev environment for full errors. ';\n}","declare global {\n  interface SymbolConstructor {\n    readonly observable: symbol;\n  }\n}\nconst $$observable = /* #__PURE__ */(() => typeof Symbol === 'function' && Symbol.observable || '@@observable')();\nexport default $$observable;","/**\n * These are private action types reserved by Redux.\n * For any unknown actions, you must return the current state.\n * If the current state is undefined, you must return the initial state.\n * Do not reference these action types directly in your code.\n */\n\nconst randomString = () => Math.random().toString(36).substring(7).split('').join('.');\nconst ActionTypes = {\n  INIT: `@@redux/INIT${/* #__PURE__ */randomString()}`,\n  REPLACE: `@@redux/REPLACE${/* #__PURE__ */randomString()}`,\n  PROBE_UNKNOWN_ACTION: () => `@@redux/PROBE_UNKNOWN_ACTION${randomString()}`\n};\nexport default ActionTypes;","/**\n * @param obj The object to inspect.\n * @returns True if the argument appears to be a plain object.\n */\nexport default function isPlainObject(obj: any): obj is object {\n  if (typeof obj !== 'object' || obj === null) return false;\n  let proto = obj;\n  while (Object.getPrototypeOf(proto) !== null) {\n    proto = Object.getPrototypeOf(proto);\n  }\n  return Object.getPrototypeOf(obj) === proto || Object.getPrototypeOf(obj) === null;\n}","import { formatProdErrorMessage as _formatProdErrorMessage13 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage12 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage11 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage10 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage9 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage8 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage7 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage6 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage5 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage4 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage3 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage2 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage } from \"src/utils/formatProdErrorMessage\";\nimport $$observable from './utils/symbol-observable';\nimport { Store, StoreEnhancer, Dispatch, Observer, ListenerCallback, UnknownIfNonSpecific } from './types/store';\nimport { Action } from './types/actions';\nimport { Reducer } from './types/reducers';\nimport ActionTypes from './utils/actionTypes';\nimport isPlainObject from './utils/isPlainObject';\nimport { kindOf } from './utils/kindOf';\n\n/**\n * @deprecated\n *\n * **We recommend using the `configureStore` method\n * of the `@reduxjs/toolkit` package**, which replaces `createStore`.\n *\n * Redux Toolkit is our recommended approach for writing Redux logic today,\n * including store setup, reducers, data fetching, and more.\n *\n * **For more details, please read this Redux docs page:**\n * **https://redux.js.org/introduction/why-rtk-is-redux-today**\n *\n * `configureStore` from Redux Toolkit is an improved version of `createStore` that\n * simplifies setup and helps avoid common bugs.\n *\n * You should not be using the `redux` core package by itself today, except for learning purposes.\n * The `createStore` method from the core `redux` package will not be removed, but we encourage\n * all users to migrate to using Redux Toolkit for all Redux code.\n *\n * If you want to use `createStore` without this visual deprecation warning, use\n * the `legacy_createStore` import instead:\n *\n * `import { legacy_createStore as createStore} from 'redux'`\n *\n */\nexport function createStore<S, A extends Action, Ext extends {} = {}, StateExt extends {} = {}>(reducer: Reducer<S, A>, enhancer?: StoreEnhancer<Ext, StateExt>): Store<S, A, UnknownIfNonSpecific<StateExt>> & Ext;\n/**\n * @deprecated\n *\n * **We recommend using the `configureStore` method\n * of the `@reduxjs/toolkit` package**, which replaces `createStore`.\n *\n * Redux Toolkit is our recommended approach for writing Redux logic today,\n * including store setup, reducers, data fetching, and more.\n *\n * **For more details, please read this Redux docs page:**\n * **https://redux.js.org/introduction/why-rtk-is-redux-today**\n *\n * `configureStore` from Redux Toolkit is an improved version of `createStore` that\n * simplifies setup and helps avoid common bugs.\n *\n * You should not be using the `redux` core package by itself today, except for learning purposes.\n * The `createStore` method from the core `redux` package will not be removed, but we encourage\n * all users to migrate to using Redux Toolkit for all Redux code.\n *\n * If you want to use `createStore` without this visual deprecation warning, use\n * the `legacy_createStore` import instead:\n *\n * `import { legacy_createStore as createStore} from 'redux'`\n *\n */\nexport function createStore<S, A extends Action, Ext extends {} = {}, StateExt extends {} = {}, PreloadedState = S>(reducer: Reducer<S, A, PreloadedState>, preloadedState?: PreloadedState | undefined, enhancer?: StoreEnhancer<Ext, StateExt>): Store<S, A, UnknownIfNonSpecific<StateExt>> & Ext;\nexport function createStore<S, A extends Action, Ext extends {} = {}, StateExt extends {} = {}, PreloadedState = S>(reducer: Reducer<S, A, PreloadedState>, preloadedState?: PreloadedState | StoreEnhancer<Ext, StateExt> | undefined, enhancer?: StoreEnhancer<Ext, StateExt>): Store<S, A, UnknownIfNonSpecific<StateExt>> & Ext {\n  if (typeof reducer !== 'function') {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(2) : `Expected the root reducer to be a function. Instead, received: '${kindOf(reducer)}'`);\n  }\n  if (typeof preloadedState === 'function' && typeof enhancer === 'function' || typeof enhancer === 'function' && typeof arguments[3] === 'function') {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage2(0) : 'It looks like you are passing several store enhancers to ' + 'createStore(). This is not supported. Instead, compose them ' + 'together to a single function. See https://redux.js.org/tutorials/fundamentals/part-4-store#creating-a-store-with-enhancers for an example.');\n  }\n  if (typeof preloadedState === 'function' && typeof enhancer === 'undefined') {\n    enhancer = (preloadedState as StoreEnhancer<Ext, StateExt>);\n    preloadedState = undefined;\n  }\n  if (typeof enhancer !== 'undefined') {\n    if (typeof enhancer !== 'function') {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage3(1) : `Expected the enhancer to be a function. Instead, received: '${kindOf(enhancer)}'`);\n    }\n    return enhancer(createStore)(reducer, (preloadedState as PreloadedState | undefined));\n  }\n  let currentReducer = reducer;\n  let currentState: S | PreloadedState | undefined = (preloadedState as PreloadedState | undefined);\n  let currentListeners: Map<number, ListenerCallback> | null = new Map();\n  let nextListeners = currentListeners;\n  let listenerIdCounter = 0;\n  let isDispatching = false;\n\n  /**\n   * This makes a shallow copy of currentListeners so we can use\n   * nextListeners as a temporary list while dispatching.\n   *\n   * This prevents any bugs around consumers calling\n   * subscribe/unsubscribe in the middle of a dispatch.\n   */\n  function ensureCanMutateNextListeners() {\n    if (nextListeners === currentListeners) {\n      nextListeners = new Map();\n      currentListeners.forEach((listener, key) => {\n        nextListeners.set(key, listener);\n      });\n    }\n  }\n\n  /**\n   * Reads the state tree managed by the store.\n   *\n   * @returns The current state tree of your application.\n   */\n  function getState(): S {\n    if (isDispatching) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage4(3) : 'You may not call store.getState() while the reducer is executing. ' + 'The reducer has already received the state as an argument. ' + 'Pass it down from the top reducer instead of reading it from the store.');\n    }\n    return (currentState as S);\n  }\n\n  /**\n   * Adds a change listener. It will be called any time an action is dispatched,\n   * and some part of the state tree may potentially have changed. You may then\n   * call `getState()` to read the current state tree inside the callback.\n   *\n   * You may call `dispatch()` from a change listener, with the following\n   * caveats:\n   *\n   * 1. The subscriptions are snapshotted just before every `dispatch()` call.\n   * If you subscribe or unsubscribe while the listeners are being invoked, this\n   * will not have any effect on the `dispatch()` that is currently in progress.\n   * However, the next `dispatch()` call, whether nested or not, will use a more\n   * recent snapshot of the subscription list.\n   *\n   * 2. The listener should not expect to see all state changes, as the state\n   * might have been updated multiple times during a nested `dispatch()` before\n   * the listener is called. It is, however, guaranteed that all subscribers\n   * registered before the `dispatch()` started will be called with the latest\n   * state by the time it exits.\n   *\n   * @param listener A callback to be invoked on every dispatch.\n   * @returns A function to remove this change listener.\n   */\n  function subscribe(listener: () => void) {\n    if (typeof listener !== 'function') {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage5(4) : `Expected the listener to be a function. Instead, received: '${kindOf(listener)}'`);\n    }\n    if (isDispatching) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage6(5) : 'You may not call store.subscribe() while the reducer is executing. ' + 'If you would like to be notified after the store has been updated, subscribe from a ' + 'component and invoke store.getState() in the callback to access the latest state. ' + 'See https://redux.js.org/api/store#subscribelistener for more details.');\n    }\n    let isSubscribed = true;\n    ensureCanMutateNextListeners();\n    const listenerId = listenerIdCounter++;\n    nextListeners.set(listenerId, listener);\n    return function unsubscribe() {\n      if (!isSubscribed) {\n        return;\n      }\n      if (isDispatching) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage7(6) : 'You may not unsubscribe from a store listener while the reducer is executing. ' + 'See https://redux.js.org/api/store#subscribelistener for more details.');\n      }\n      isSubscribed = false;\n      ensureCanMutateNextListeners();\n      nextListeners.delete(listenerId);\n      currentListeners = null;\n    };\n  }\n\n  /**\n   * Dispatches an action. It is the only way to trigger a state change.\n   *\n   * The `reducer` function, used to create the store, will be called with the\n   * current state tree and the given `action`. Its return value will\n   * be considered the **next** state of the tree, and the change listeners\n   * will be notified.\n   *\n   * The base implementation only supports plain object actions. If you want to\n   * dispatch a Promise, an Observable, a thunk, or something else, you need to\n   * wrap your store creating function into the corresponding middleware. For\n   * example, see the documentation for the `redux-thunk` package. Even the\n   * middleware will eventually dispatch plain object actions using this method.\n   *\n   * @param action A plain object representing “what changed”. It is\n   * a good idea to keep actions serializable so you can record and replay user\n   * sessions, or use the time travelling `redux-devtools`. An action must have\n   * a `type` property which may not be `undefined`. It is a good idea to use\n   * string constants for action types.\n   *\n   * @returns For convenience, the same action object you dispatched.\n   *\n   * Note that, if you use a custom middleware, it may wrap `dispatch()` to\n   * return something else (for example, a Promise you can await).\n   */\n  function dispatch(action: A) {\n    if (!isPlainObject(action)) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage8(7) : `Actions must be plain objects. Instead, the actual type was: '${kindOf(action)}'. You may need to add middleware to your store setup to handle dispatching other values, such as 'redux-thunk' to handle dispatching functions. See https://redux.js.org/tutorials/fundamentals/part-4-store#middleware and https://redux.js.org/tutorials/fundamentals/part-6-async-logic#using-the-redux-thunk-middleware for examples.`);\n    }\n    if (typeof action.type === 'undefined') {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage9(8) : 'Actions may not have an undefined \"type\" property. You may have misspelled an action type string constant.');\n    }\n    if (typeof action.type !== 'string') {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage10(17) : `Action \"type\" property must be a string. Instead, the actual type was: '${kindOf(action.type)}'. Value was: '${action.type}' (stringified)`);\n    }\n    if (isDispatching) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage11(9) : 'Reducers may not dispatch actions.');\n    }\n    try {\n      isDispatching = true;\n      currentState = currentReducer(currentState, action);\n    } finally {\n      isDispatching = false;\n    }\n    const listeners = currentListeners = nextListeners;\n    listeners.forEach(listener => {\n      listener();\n    });\n    return action;\n  }\n\n  /**\n   * Replaces the reducer currently used by the store to calculate the state.\n   *\n   * You might need this if your app implements code splitting and you want to\n   * load some of the reducers dynamically. You might also need this if you\n   * implement a hot reloading mechanism for Redux.\n   *\n   * @param nextReducer The reducer for the store to use instead.\n   */\n  function replaceReducer(nextReducer: Reducer<S, A>): void {\n    if (typeof nextReducer !== 'function') {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage12(10) : `Expected the nextReducer to be a function. Instead, received: '${kindOf(nextReducer)}`);\n    }\n    currentReducer = ((nextReducer as unknown) as Reducer<S, A, PreloadedState>);\n\n    // This action has a similar effect to ActionTypes.INIT.\n    // Any reducers that existed in both the new and old rootReducer\n    // will receive the previous state. This effectively populates\n    // the new state tree with any relevant data from the old one.\n    dispatch(({\n      type: ActionTypes.REPLACE\n    } as A));\n  }\n\n  /**\n   * Interoperability point for observable/reactive libraries.\n   * @returns A minimal observable of state changes.\n   * For more information, see the observable proposal:\n   * https://github.com/tc39/proposal-observable\n   */\n  function observable() {\n    const outerSubscribe = subscribe;\n    return {\n      /**\n       * The minimal observable subscription method.\n       * @param observer Any object that can be used as an observer.\n       * The observer object should have a `next` method.\n       * @returns An object with an `unsubscribe` method that can\n       * be used to unsubscribe the observable from the store, and prevent further\n       * emission of values from the observable.\n       */\n      subscribe(observer: unknown) {\n        if (typeof observer !== 'object' || observer === null) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage13(11) : `Expected the observer to be an object. Instead, received: '${kindOf(observer)}'`);\n        }\n        function observeState() {\n          const observerAsObserver = (observer as Observer<S>);\n          if (observerAsObserver.next) {\n            observerAsObserver.next(getState());\n          }\n        }\n        observeState();\n        const unsubscribe = outerSubscribe(observeState);\n        return {\n          unsubscribe\n        };\n      },\n      [$$observable]() {\n        return this;\n      }\n    };\n  }\n\n  // When a store is created, an \"INIT\" action is dispatched so that every\n  // reducer returns their initial state. This effectively populates\n  // the initial state tree.\n  dispatch(({\n    type: ActionTypes.INIT\n  } as A));\n  const store = (({\n    dispatch: (dispatch as Dispatch<A>),\n    subscribe,\n    getState,\n    replaceReducer,\n    [$$observable]: observable\n  } as unknown) as Store<S, A, StateExt> & Ext);\n  return store;\n}\n\n/**\n * Creates a Redux store that holds the state tree.\n *\n * **We recommend using `configureStore` from the\n * `@reduxjs/toolkit` package**, which replaces `createStore`:\n * **https://redux.js.org/introduction/why-rtk-is-redux-today**\n *\n * The only way to change the data in the store is to call `dispatch()` on it.\n *\n * There should only be a single store in your app. To specify how different\n * parts of the state tree respond to actions, you may combine several reducers\n * into a single reducer function by using `combineReducers`.\n *\n * @param {Function} reducer A function that returns the next state tree, given\n * the current state tree and the action to handle.\n *\n * @param {any} [preloadedState] The initial state. You may optionally specify it\n * to hydrate the state from the server in universal apps, or to restore a\n * previously serialized user session.\n * If you use `combineReducers` to produce the root reducer function, this must be\n * an object with the same shape as `combineReducers` keys.\n *\n * @param {Function} [enhancer] The store enhancer. You may optionally specify it\n * to enhance the store with third-party capabilities such as middleware,\n * time travel, persistence, etc. The only store enhancer that ships with Redux\n * is `applyMiddleware()`.\n *\n * @returns {Store} A Redux store that lets you read the state, dispatch actions\n * and subscribe to changes.\n */\nexport function legacy_createStore<S, A extends Action, Ext extends {} = {}, StateExt extends {} = {}>(reducer: Reducer<S, A>, enhancer?: StoreEnhancer<Ext, StateExt>): Store<S, A, UnknownIfNonSpecific<StateExt>> & Ext;\n/**\n * Creates a Redux store that holds the state tree.\n *\n * **We recommend using `configureStore` from the\n * `@reduxjs/toolkit` package**, which replaces `createStore`:\n * **https://redux.js.org/introduction/why-rtk-is-redux-today**\n *\n * The only way to change the data in the store is to call `dispatch()` on it.\n *\n * There should only be a single store in your app. To specify how different\n * parts of the state tree respond to actions, you may combine several reducers\n * into a single reducer function by using `combineReducers`.\n *\n * @param {Function} reducer A function that returns the next state tree, given\n * the current state tree and the action to handle.\n *\n * @param {any} [preloadedState] The initial state. You may optionally specify it\n * to hydrate the state from the server in universal apps, or to restore a\n * previously serialized user session.\n * If you use `combineReducers` to produce the root reducer function, this must be\n * an object with the same shape as `combineReducers` keys.\n *\n * @param {Function} [enhancer] The store enhancer. You may optionally specify it\n * to enhance the store with third-party capabilities such as middleware,\n * time travel, persistence, etc. The only store enhancer that ships with Redux\n * is `applyMiddleware()`.\n *\n * @returns {Store} A Redux store that lets you read the state, dispatch actions\n * and subscribe to changes.\n */\nexport function legacy_createStore<S, A extends Action, Ext extends {} = {}, StateExt extends {} = {}, PreloadedState = S>(reducer: Reducer<S, A, PreloadedState>, preloadedState?: PreloadedState | undefined, enhancer?: StoreEnhancer<Ext, StateExt>): Store<S, A, UnknownIfNonSpecific<StateExt>> & Ext;\nexport function legacy_createStore<S, A extends Action, Ext extends {} = {}, StateExt extends {} = {}, PreloadedState = S>(reducer: Reducer<S, A>, preloadedState?: PreloadedState | StoreEnhancer<Ext, StateExt> | undefined, enhancer?: StoreEnhancer<Ext, StateExt>): Store<S, A, UnknownIfNonSpecific<StateExt>> & Ext {\n  return createStore(reducer, (preloadedState as any), enhancer);\n}","import { formatProdErrorMessage as _formatProdErrorMessage3 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage2 } from \"src/utils/formatProdErrorMessage\";\nimport { formatProdErrorMessage as _formatProdErrorMessage } from \"src/utils/formatProdErrorMessage\";\nimport { Action } from './types/actions';\nimport { ActionFromReducersMapObject, PreloadedStateShapeFromReducersMapObject, Reducer, StateFromReducersMapObject } from './types/reducers';\nimport ActionTypes from './utils/actionTypes';\nimport isPlainObject from './utils/isPlainObject';\nimport warning from './utils/warning';\nimport { kindOf } from './utils/kindOf';\nfunction getUnexpectedStateShapeWarningMessage(inputState: object, reducers: {\n  [key: string]: Reducer<any, any, any>;\n}, action: Action, unexpectedKeyCache: {\n  [key: string]: true;\n}) {\n  const reducerKeys = Object.keys(reducers);\n  const argumentName = action && action.type === ActionTypes.INIT ? 'preloadedState argument passed to createStore' : 'previous state received by the reducer';\n  if (reducerKeys.length === 0) {\n    return 'Store does not have a valid reducer. Make sure the argument passed ' + 'to combineReducers is an object whose values are reducers.';\n  }\n  if (!isPlainObject(inputState)) {\n    return `The ${argumentName} has unexpected type of \"${kindOf(inputState)}\". Expected argument to be an object with the following ` + `keys: \"${reducerKeys.join('\", \"')}\"`;\n  }\n  const unexpectedKeys = Object.keys(inputState).filter(key => !reducers.hasOwnProperty(key) && !unexpectedKeyCache[key]);\n  unexpectedKeys.forEach(key => {\n    unexpectedKeyCache[key] = true;\n  });\n  if (action && action.type === ActionTypes.REPLACE) return;\n  if (unexpectedKeys.length > 0) {\n    return `Unexpected ${unexpectedKeys.length > 1 ? 'keys' : 'key'} ` + `\"${unexpectedKeys.join('\", \"')}\" found in ${argumentName}. ` + `Expected to find one of the known reducer keys instead: ` + `\"${reducerKeys.join('\", \"')}\". Unexpected keys will be ignored.`;\n  }\n}\nfunction assertReducerShape(reducers: {\n  [key: string]: Reducer<any, any, any>;\n}) {\n  Object.keys(reducers).forEach(key => {\n    const reducer = reducers[key];\n    const initialState = reducer(undefined, {\n      type: ActionTypes.INIT\n    });\n    if (typeof initialState === 'undefined') {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(12) : `The slice reducer for key \"${key}\" returned undefined during initialization. ` + `If the state passed to the reducer is undefined, you must ` + `explicitly return the initial state. The initial state may ` + `not be undefined. If you don't want to set a value for this reducer, ` + `you can use null instead of undefined.`);\n    }\n    if (typeof reducer(undefined, {\n      type: ActionTypes.PROBE_UNKNOWN_ACTION()\n    }) === 'undefined') {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage2(13) : `The slice reducer for key \"${key}\" returned undefined when probed with a random type. ` + `Don't try to handle '${ActionTypes.INIT}' or other actions in \"redux/*\" ` + `namespace. They are considered private. Instead, you must return the ` + `current state for any unknown actions, unless it is undefined, ` + `in which case you must return the initial state, regardless of the ` + `action type. The initial state may not be undefined, but can be null.`);\n    }\n  });\n}\n\n/**\n * Turns an object whose values are different reducer functions, into a single\n * reducer function. It will call every child reducer, and gather their results\n * into a single state object, whose keys correspond to the keys of the passed\n * reducer functions.\n *\n * @template S Combined state object type.\n *\n * @param reducers An object whose values correspond to different reducer\n *   functions that need to be combined into one. One handy way to obtain it\n *   is to use `import * as reducers` syntax. The reducers may never\n *   return undefined for any action. Instead, they should return their\n *   initial state if the state passed to them was undefined, and the current\n *   state for any unrecognized action.\n *\n * @returns A reducer function that invokes every reducer inside the passed\n *   object, and builds a state object with the same shape.\n */\nexport default function combineReducers<M>(reducers: M): M[keyof M] extends Reducer<any, any, any> | undefined ? Reducer<StateFromReducersMapObject<M>, ActionFromReducersMapObject<M>, Partial<PreloadedStateShapeFromReducersMapObject<M>>> : never;\nexport default function combineReducers(reducers: {\n  [key: string]: Reducer<any, any, any>;\n}) {\n  const reducerKeys = Object.keys(reducers);\n  const finalReducers: {\n    [key: string]: Reducer<any, any, any>;\n  } = {};\n  for (let i = 0; i < reducerKeys.length; i++) {\n    const key = reducerKeys[i];\n    if (process.env.NODE_ENV !== 'production') {\n      if (typeof reducers[key] === 'undefined') {\n        warning(`No reducer provided for key \"${key}\"`);\n      }\n    }\n    if (typeof reducers[key] === 'function') {\n      finalReducers[key] = reducers[key];\n    }\n  }\n  const finalReducerKeys = Object.keys(finalReducers);\n\n  // This is used to make sure we don't warn about the same\n  // keys multiple times.\n  let unexpectedKeyCache: {\n    [key: string]: true;\n  };\n  if (process.env.NODE_ENV !== 'production') {\n    unexpectedKeyCache = {};\n  }\n  let shapeAssertionError: unknown;\n  try {\n    assertReducerShape(finalReducers);\n  } catch (e) {\n    shapeAssertionError = e;\n  }\n  return function combination(state: StateFromReducersMapObject<typeof reducers> = {}, action: Action) {\n    if (shapeAssertionError) {\n      throw shapeAssertionError;\n    }\n    if (process.env.NODE_ENV !== 'production') {\n      const warningMessage = getUnexpectedStateShapeWarningMessage(state, finalReducers, action, unexpectedKeyCache);\n      if (warningMessage) {\n        warning(warningMessage);\n      }\n    }\n    let hasChanged = false;\n    const nextState: StateFromReducersMapObject<typeof reducers> = {};\n    for (let i = 0; i < finalReducerKeys.length; i++) {\n      const key = finalReducerKeys[i];\n      const reducer = finalReducers[key];\n      const previousStateForKey = state[key];\n      const nextStateForKey = reducer(previousStateForKey, action);\n      if (typeof nextStateForKey === 'undefined') {\n        const actionType = action && action.type;\n        throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage3(14) : `When called with an action of type ${actionType ? `\"${String(actionType)}\"` : '(unknown type)'}, the slice reducer for key \"${key}\" returned undefined. ` + `To ignore an action, you must explicitly return the previous state. ` + `If you want this reducer to hold no value, you can return null instead of undefined.`);\n      }\n      nextState[key] = nextStateForKey;\n      hasChanged = hasChanged || nextStateForKey !== previousStateForKey;\n    }\n    hasChanged = hasChanged || finalReducerKeys.length !== Object.keys(state).length;\n    return hasChanged ? nextState : state;\n  };\n}","type Func<T extends any[], R> = (...a: T) => R;\n\n/**\n * Composes single-argument functions from right to left. The rightmost\n * function can take multiple arguments as it provides the signature for the\n * resulting composite function.\n *\n * @param funcs The functions to compose.\n * @returns A function obtained by composing the argument functions from right\n *   to left. For example, `compose(f, g, h)` is identical to doing\n *   `(...args) => f(g(h(...args)))`.\n */\nexport default function compose(): <R>(a: R) => R;\nexport default function compose<F extends Function>(f: F): F;\n\n/* two functions */\nexport default function compose<A, T extends any[], R>(f1: (a: A) => R, f2: Func<T, A>): Func<T, R>;\n\n/* three functions */\nexport default function compose<A, B, T extends any[], R>(f1: (b: B) => R, f2: (a: A) => B, f3: Func<T, A>): Func<T, R>;\n\n/* four functions */\nexport default function compose<A, B, C, T extends any[], R>(f1: (c: C) => R, f2: (b: B) => C, f3: (a: A) => B, f4: Func<T, A>): Func<T, R>;\n\n/* rest */\nexport default function compose<R>(f1: (a: any) => R, ...funcs: Function[]): (...args: any[]) => R;\nexport default function compose<R>(...funcs: Function[]): (...args: any[]) => R;\nexport default function compose(...funcs: Function[]) {\n  if (funcs.length === 0) {\n    // infer the argument type so it is usable in inference down the line\n    return <T,>(arg: T) => arg;\n  }\n  if (funcs.length === 1) {\n    return funcs[0];\n  }\n  return funcs.reduce((a, b) => (...args: any) => a(b(...args)));\n}","// src/index.ts\nfunction createThunkMiddleware(extraArgument) {\n  const middleware = ({ dispatch, getState }) => (next) => (action) => {\n    if (typeof action === \"function\") {\n      return action(dispatch, getState, extraArgument);\n    }\n    return next(action);\n  };\n  return middleware;\n}\nvar thunk = createThunkMiddleware();\nvar withExtraArgument = createThunkMiddleware;\nexport {\n  thunk,\n  withExtraArgument\n};\n","import type { Action, ActionCreator, StoreEnhancer } from 'redux';\nimport { compose } from 'redux';\n/**\r\n * @public\r\n */\n\nexport interface DevToolsEnhancerOptions {\n  /**\r\n   * the instance name to be showed on the monitor page. Default value is `document.title`.\r\n   * If not specified and there's no document title, it will consist of `tabId` and `instanceId`.\r\n   */\n  name?: string;\n  /**\r\n   * action creators functions to be available in the Dispatcher.\r\n   */\n\n  actionCreators?: ActionCreator<any>[] | {\n    [key: string]: ActionCreator<any>;\n  };\n  /**\r\n   * if more than one action is dispatched in the indicated interval, all new actions will be collected and sent at once.\r\n   * It is the joint between performance and speed. When set to `0`, all actions will be sent instantly.\r\n   * Set it to a higher value when experiencing perf issues (also `maxAge` to a lower value).\r\n   *\r\n   * @default 500 ms.\r\n   */\n\n  latency?: number;\n  /**\r\n   * (> 1) - maximum allowed actions to be stored in the history tree. The oldest actions are removed once maxAge is reached. It's critical for performance.\r\n   *\r\n   * @default 50\r\n   */\n\n  maxAge?: number;\n  /**\r\n   * Customizes how actions and state are serialized and deserialized. Can be a boolean or object. If given a boolean, the behavior is the same as if you\r\n   * were to pass an object and specify `options` as a boolean. Giving an object allows fine-grained customization using the `replacer` and `reviver`\r\n   * functions.\r\n   */\n\n  serialize?: boolean | {\n    /**\r\n     * - `undefined` - will use regular `JSON.stringify` to send data (it's the fast mode).\r\n     * - `false` - will handle also circular references.\r\n     * - `true` - will handle also date, regex, undefined, error objects, symbols, maps, sets and functions.\r\n     * - object, which contains `date`, `regex`, `undefined`, `error`, `symbol`, `map`, `set` and `function` keys.\r\n     *   For each of them you can indicate if to include (by setting as `true`).\r\n     *   For `function` key you can also specify a custom function which handles serialization.\r\n     *   See [`jsan`](https://github.com/kolodny/jsan) for more details.\r\n     */\n    options?: undefined | boolean | {\n      date?: true;\n      regex?: true;\n      undefined?: true;\n      error?: true;\n      symbol?: true;\n      map?: true;\n      set?: true;\n      function?: true | ((fn: (...args: any[]) => any) => string);\n    };\n    /**\r\n     * [JSON replacer function](https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/JSON/stringify#The_replacer_parameter) used for both actions and states stringify.\r\n     * In addition, you can specify a data type by adding a [`__serializedType__`](https://github.com/zalmoxisus/remotedev-serialize/blob/master/helpers/index.js#L4)\r\n     * key. So you can deserialize it back while importing or persisting data.\r\n     * Moreover, it will also [show a nice preview showing the provided custom type](https://cloud.githubusercontent.com/assets/7957859/21814330/a17d556a-d761-11e6-85ef-159dd12f36c5.png):\r\n     */\n\n    replacer?: (key: string, value: unknown) => any;\n    /**\r\n     * [JSON `reviver` function](https://developer.mozilla.org/en/docs/Web/JavaScript/Reference/Global_Objects/JSON/parse#Using_the_reviver_parameter)\r\n     * used for parsing the imported actions and states. See [`remotedev-serialize`](https://github.com/zalmoxisus/remotedev-serialize/blob/master/immutable/serialize.js#L8-L41)\r\n     * as an example on how to serialize special data types and get them back.\r\n     */\n\n    reviver?: (key: string, value: unknown) => any;\n    /**\r\n     * Automatically serialize/deserialize immutablejs via [remotedev-serialize](https://github.com/zalmoxisus/remotedev-serialize).\r\n     * Just pass the Immutable library. It will support all ImmutableJS structures. You can even export them into a file and get them back.\r\n     * The only exception is `Record` class, for which you should pass this in addition the references to your classes in `refs`.\r\n     */\n\n    immutable?: any;\n    /**\r\n     * ImmutableJS `Record` classes used to make possible restore its instances back when importing, persisting...\r\n     */\n\n    refs?: any;\n  };\n  /**\r\n   * function which takes `action` object and id number as arguments, and should return `action` object back.\r\n   */\n\n  actionSanitizer?: <A extends Action>(action: A, id: number) => A;\n  /**\r\n   * function which takes `state` object and index as arguments, and should return `state` object back.\r\n   */\n\n  stateSanitizer?: <S>(state: S, index: number) => S;\n  /**\r\n   * *string or array of strings as regex* - actions types to be hidden / shown in the monitors (while passed to the reducers).\r\n   * If `actionsAllowlist` specified, `actionsDenylist` is ignored.\r\n   */\n\n  actionsDenylist?: string | string[];\n  /**\r\n   * *string or array of strings as regex* - actions types to be hidden / shown in the monitors (while passed to the reducers).\r\n   * If `actionsAllowlist` specified, `actionsDenylist` is ignored.\r\n   */\n\n  actionsAllowlist?: string | string[];\n  /**\r\n   * called for every action before sending, takes `state` and `action` object, and returns `true` in case it allows sending the current data to the monitor.\r\n   * Use it as a more advanced version of `actionsDenylist`/`actionsAllowlist` parameters.\r\n   */\n\n  predicate?: <S, A extends Action>(state: S, action: A) => boolean;\n  /**\r\n   * if specified as `false`, it will not record the changes till clicking on `Start recording` button.\r\n   * Available only for Redux enhancer, for others use `autoPause`.\r\n   *\r\n   * @default true\r\n   */\n\n  shouldRecordChanges?: boolean;\n  /**\r\n   * if specified, whenever clicking on `Pause recording` button and there are actions in the history log, will add this action type.\r\n   * If not specified, will commit when paused. Available only for Redux enhancer.\r\n   *\r\n   * @default \"@@PAUSED\"\"\r\n   */\n\n  pauseActionType?: string;\n  /**\r\n   * auto pauses when the extension’s window is not opened, and so has zero impact on your app when not in use.\r\n   * Not available for Redux enhancer (as it already does it but storing the data to be sent).\r\n   *\r\n   * @default false\r\n   */\n\n  autoPause?: boolean;\n  /**\r\n   * if specified as `true`, it will not allow any non-monitor actions to be dispatched till clicking on `Unlock changes` button.\r\n   * Available only for Redux enhancer.\r\n   *\r\n   * @default false\r\n   */\n\n  shouldStartLocked?: boolean;\n  /**\r\n   * if set to `false`, will not recompute the states on hot reloading (or on replacing the reducers). Available only for Redux enhancer.\r\n   *\r\n   * @default true\r\n   */\n\n  shouldHotReload?: boolean;\n  /**\r\n   * if specified as `true`, whenever there's an exception in reducers, the monitors will show the error message, and next actions will not be dispatched.\r\n   *\r\n   * @default false\r\n   */\n\n  shouldCatchErrors?: boolean;\n  /**\r\n   * If you want to restrict the extension, specify the features you allow.\r\n   * If not specified, all of the features are enabled. When set as an object, only those included as `true` will be allowed.\r\n   * Note that except `true`/`false`, `import` and `export` can be set as `custom` (which is by default for Redux enhancer), meaning that the importing/exporting occurs on the client side.\r\n   * Otherwise, you'll get/set the data right from the monitor part.\r\n   */\n\n  features?: {\n    /**\r\n     * start/pause recording of dispatched actions\r\n     */\n    pause?: boolean;\n    /**\r\n     * lock/unlock dispatching actions and side effects\r\n     */\n\n    lock?: boolean;\n    /**\r\n     * persist states on page reloading\r\n     */\n\n    persist?: boolean;\n    /**\r\n     * export history of actions in a file\r\n     */\n\n    export?: boolean | 'custom';\n    /**\r\n     * import history of actions from a file\r\n     */\n\n    import?: boolean | 'custom';\n    /**\r\n     * jump back and forth (time travelling)\r\n     */\n\n    jump?: boolean;\n    /**\r\n     * skip (cancel) actions\r\n     */\n\n    skip?: boolean;\n    /**\r\n     * drag and drop actions in the history list\r\n     */\n\n    reorder?: boolean;\n    /**\r\n     * dispatch custom actions or action creators\r\n     */\n\n    dispatch?: boolean;\n    /**\r\n     * generate tests for the selected actions\r\n     */\n\n    test?: boolean;\n  };\n  /**\r\n   * Set to true or a stacktrace-returning function to record call stack traces for dispatched actions.\r\n   * Defaults to false.\r\n   */\n\n  trace?: boolean | (<A extends Action>(action: A) => string);\n  /**\r\n   * The maximum number of stack trace entries to record per action. Defaults to 10.\r\n   */\n\n  traceLimit?: number;\n}\ntype Compose = typeof compose;\ninterface ComposeWithDevTools {\n  (options: DevToolsEnhancerOptions): Compose;\n  <StoreExt extends {}>(...funcs: StoreEnhancer<StoreExt>[]): StoreEnhancer<StoreExt>;\n}\n/**\r\n * @public\r\n */\n\nexport const composeWithDevTools: ComposeWithDevTools = typeof window !== 'undefined' && (window as any).__REDUX_DEVTOOLS_EXTENSION_COMPOSE__ ? (window as any).__REDUX_DEVTOOLS_EXTENSION_COMPOSE__ : function () {\n  if (arguments.length === 0) return undefined;\n  if (typeof arguments[0] === 'object') return compose;\n  return compose.apply(null, ((arguments as any) as Function[]));\n};\n/**\r\n * @public\r\n */\n\nexport const devToolsEnhancer: {\n  (options: DevToolsEnhancerOptions): StoreEnhancer<any>;\n} = typeof window !== 'undefined' && (window as any).__REDUX_DEVTOOLS_EXTENSION__ ? (window as any).__REDUX_DEVTOOLS_EXTENSION__ : function () {\n  return function (noop) {\n    return noop;\n  };\n};","import { current, isDraft } from 'immer';\nimport { createSelectorCreator, weakMapMemoize } from 'reselect';\nexport const createDraftSafeSelectorCreator: typeof createSelectorCreator = (...args: unknown[]) => {\n  const createSelector = (createSelectorCreator as any)(...args);\n  const createDraftSafeSelector = Object.assign((...args: unknown[]) => {\n    const selector = createSelector(...args);\n\n    const wrappedSelector = (value: unknown, ...rest: unknown[]) => selector(isDraft(value) ? current(value) : value, ...rest);\n\n    Object.assign(wrappedSelector, selector);\n    return (wrappedSelector as any);\n  }, {\n    withTypes: () => createDraftSafeSelector\n  });\n  return createDraftSafeSelector;\n};\n/**\r\n * \"Draft-Safe\" version of `reselect`'s `createSelector`:\r\n * If an `immer`-drafted object is passed into the resulting selector's first argument,\r\n * the selector will act on the current draft value, instead of returning a cached value\r\n * that might be possibly outdated if the draft has been modified since.\r\n * @public\r\n */\n\nexport const createDraftSafeSelector = createDraftSafeSelectorCreator(weakMapMemoize);","import { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport { isAction } from 'redux';\nimport type { IsUnknownOrNonInferrable, IfMaybeUndefined, IfVoid, IsAny } from './tsHelpers';\nimport { hasMatchFunction } from './tsHelpers';\n/**\r\n * An action with a string type and an associated payload. This is the\r\n * type of action returned by `createAction()` action creators.\r\n *\r\n * @template P The type of the action's payload.\r\n * @template T the type used for the action type.\r\n * @template M The type of the action's meta (optional)\r\n * @template E The type of the action's error (optional)\r\n *\r\n * @public\r\n */\n\nexport type PayloadAction<P = void, T extends string = string, M = never, E = never> = {\n  payload: P;\n  type: T;\n} & ([M] extends [never] ? {} : {\n  meta: M;\n}) & ([E] extends [never] ? {} : {\n  error: E;\n});\n/**\r\n * A \"prepare\" method to be used as the second parameter of `createAction`.\r\n * Takes any number of arguments and returns a Flux Standard Action without\r\n * type (will be added later) that *must* contain a payload (might be undefined).\r\n *\r\n * @public\r\n */\n\nexport type PrepareAction<P> = ((...args: any[]) => {\n  payload: P;\n}) | ((...args: any[]) => {\n  payload: P;\n  meta: any;\n}) | ((...args: any[]) => {\n  payload: P;\n  error: any;\n}) | ((...args: any[]) => {\n  payload: P;\n  meta: any;\n  error: any;\n});\n/**\r\n * Internal version of `ActionCreatorWithPreparedPayload`. Not to be used externally.\r\n *\r\n * @internal\r\n */\n\nexport type _ActionCreatorWithPreparedPayload<PA extends PrepareAction<any> | void, T extends string = string> = PA extends PrepareAction<infer P> ? ActionCreatorWithPreparedPayload<Parameters<PA>, P, T, ReturnType<PA> extends {\n  error: infer E;\n} ? E : never, ReturnType<PA> extends {\n  meta: infer M;\n} ? M : never> : void;\n/**\r\n * Basic type for all action creators.\r\n *\r\n * @inheritdoc {redux#ActionCreator}\r\n */\n\nexport interface BaseActionCreator<P, T extends string, M = never, E = never> {\n  type: T;\n  match: (action: unknown) => action is PayloadAction<P, T, M, E>;\n}\n/**\r\n * An action creator that takes multiple arguments that are passed\r\n * to a `PrepareAction` method to create the final Action.\r\n * @typeParam Args arguments for the action creator function\r\n * @typeParam P `payload` type\r\n * @typeParam T `type` name\r\n * @typeParam E optional `error` type\r\n * @typeParam M optional `meta` type\r\n *\r\n * @inheritdoc {redux#ActionCreator}\r\n *\r\n * @public\r\n */\n\nexport interface ActionCreatorWithPreparedPayload<Args extends unknown[], P, T extends string = string, E = never, M = never> extends BaseActionCreator<P, T, M, E> {\n  /**\r\n   * Calling this {@link redux#ActionCreator} with `Args` will return\r\n   * an Action with a payload of type `P` and (depending on the `PrepareAction`\r\n   * method used) a `meta`- and `error` property of types `M` and `E` respectively.\r\n   */\n  (...args: Args): PayloadAction<P, T, M, E>;\n}\n/**\r\n * An action creator of type `T` that takes an optional payload of type `P`.\r\n *\r\n * @inheritdoc {redux#ActionCreator}\r\n *\r\n * @public\r\n */\n\nexport interface ActionCreatorWithOptionalPayload<P, T extends string = string> extends BaseActionCreator<P, T> {\n  /**\r\n   * Calling this {@link redux#ActionCreator} with an argument will\r\n   * return a {@link PayloadAction} of type `T` with a payload of `P`.\r\n   * Calling it without an argument will return a PayloadAction with a payload of `undefined`.\r\n   */\n  (payload?: P): PayloadAction<P, T>;\n}\n/**\r\n * An action creator of type `T` that takes no payload.\r\n *\r\n * @inheritdoc {redux#ActionCreator}\r\n *\r\n * @public\r\n */\n\nexport interface ActionCreatorWithoutPayload<T extends string = string> extends BaseActionCreator<undefined, T> {\n  /**\r\n   * Calling this {@link redux#ActionCreator} will\r\n   * return a {@link PayloadAction} of type `T` with a payload of `undefined`\r\n   */\n  (noArgument: void): PayloadAction<undefined, T>;\n}\n/**\r\n * An action creator of type `T` that requires a payload of type P.\r\n *\r\n * @inheritdoc {redux#ActionCreator}\r\n *\r\n * @public\r\n */\n\nexport interface ActionCreatorWithPayload<P, T extends string = string> extends BaseActionCreator<P, T> {\n  /**\r\n   * Calling this {@link redux#ActionCreator} with an argument will\r\n   * return a {@link PayloadAction} of type `T` with a payload of `P`\r\n   */\n  (payload: P): PayloadAction<P, T>;\n}\n/**\r\n * An action creator of type `T` whose `payload` type could not be inferred. Accepts everything as `payload`.\r\n *\r\n * @inheritdoc {redux#ActionCreator}\r\n *\r\n * @public\r\n */\n\nexport interface ActionCreatorWithNonInferrablePayload<T extends string = string> extends BaseActionCreator<unknown, T> {\n  /**\r\n   * Calling this {@link redux#ActionCreator} with an argument will\r\n   * return a {@link PayloadAction} of type `T` with a payload\r\n   * of exactly the type of the argument.\r\n   */\n  <PT extends unknown>(payload: PT): PayloadAction<PT, T>;\n}\n/**\r\n * An action creator that produces actions with a `payload` attribute.\r\n *\r\n * @typeParam P the `payload` type\r\n * @typeParam T the `type` of the resulting action\r\n * @typeParam PA if the resulting action is preprocessed by a `prepare` method, the signature of said method.\r\n *\r\n * @public\r\n */\n\nexport type PayloadActionCreator<P = void, T extends string = string, PA extends PrepareAction<P> | void = void> = IfPrepareActionMethodProvided<PA, _ActionCreatorWithPreparedPayload<PA, T>, // else\nIsAny<P, ActionCreatorWithPayload<any, T>, IsUnknownOrNonInferrable<P, ActionCreatorWithNonInferrablePayload<T>, // else\nIfVoid<P, ActionCreatorWithoutPayload<T>, // else\nIfMaybeUndefined<P, ActionCreatorWithOptionalPayload<P, T>, // else\nActionCreatorWithPayload<P, T>>>>>>;\n/**\r\n * A utility function to create an action creator for the given action type\r\n * string. The action creator accepts a single argument, which will be included\r\n * in the action object as a field called payload. The action creator function\r\n * will also have its toString() overridden so that it returns the action type.\r\n *\r\n * @param type The action type to use for created actions.\r\n * @param prepare (optional) a method that takes any number of arguments and returns { payload } or { payload, meta }.\r\n *                If this is given, the resulting action creator will pass its arguments to this method to calculate payload & meta.\r\n *\r\n * @public\r\n */\n\nexport function createAction<P = void, T extends string = string>(type: T): PayloadActionCreator<P, T>;\n/**\r\n * A utility function to create an action creator for the given action type\r\n * string. The action creator accepts a single argument, which will be included\r\n * in the action object as a field called payload. The action creator function\r\n * will also have its toString() overridden so that it returns the action type.\r\n *\r\n * @param type The action type to use for created actions.\r\n * @param prepare (optional) a method that takes any number of arguments and returns { payload } or { payload, meta }.\r\n *                If this is given, the resulting action creator will pass its arguments to this method to calculate payload & meta.\r\n *\r\n * @public\r\n */\n\nexport function createAction<PA extends PrepareAction<any>, T extends string = string>(type: T, prepareAction: PA): PayloadActionCreator<ReturnType<PA>['payload'], T, PA>;\nexport function createAction(type: string, prepareAction?: Function): any {\n  function actionCreator(...args: any[]) {\n    if (prepareAction) {\n      let prepared = prepareAction(...args);\n\n      if (!prepared) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(0) : 'prepareAction did not return an object');\n      }\n\n      return {\n        type,\n        payload: prepared.payload,\n        ...('meta' in prepared && {\n          meta: prepared.meta\n        }),\n        ...('error' in prepared && {\n          error: prepared.error\n        })\n      };\n    }\n\n    return {\n      type,\n      payload: args[0]\n    };\n  }\n\n  actionCreator.toString = () => `${type}`;\n\n  actionCreator.type = type;\n\n  actionCreator.match = (action: unknown): action is PayloadAction => isAction(action) && action.type === type;\n\n  return actionCreator;\n}\n/**\r\n * Returns true if value is an RTK-like action creator, with a static type property and match method.\r\n */\n\nexport function isActionCreator(action: unknown): action is BaseActionCreator<unknown, string> & Function {\n  return typeof action === 'function' && 'type' in action && // hasMatchFunction only wants Matchers but I don't see the point in rewriting it\n  hasMatchFunction((action as any));\n}\n/**\r\n * Returns true if value is an action with a string type and valid Flux Standard Action keys.\r\n */\n\nexport function isFSA(action: unknown): action is {\n  type: string;\n  payload?: unknown;\n  error?: unknown;\n  meta?: unknown;\n} {\n  return isAction(action) && Object.keys(action).every(isValidKey);\n}\n\nfunction isValidKey(key: string) {\n  return ['type', 'payload', 'error', 'meta'].indexOf(key) > -1;\n} // helper types for more readable typings\n\n\ntype IfPrepareActionMethodProvided<PA extends PrepareAction<any> | void, True, False> = PA extends (...args: any[]) => any ? True : False;","import { Action } from '../types/actions';\nimport isPlainObject from './isPlainObject';\nexport default function isAction(action: unknown): action is Action<string> {\n  return isPlainObject(action) && 'type' in action && typeof (action as Record<'type', unknown>).type === 'string';\n}","import { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport { produce as createNextState, isDraftable } from 'immer';\nimport type { Middleware, StoreEnhancer } from 'redux';\nexport function getTimeMeasureUtils(maxDelay: number, fnName: string) {\n  let elapsed = 0;\n  return {\n    measureTime<T>(fn: () => T): T {\n      const started = Date.now();\n\n      try {\n        return fn();\n      } finally {\n        const finished = Date.now();\n        elapsed += finished - started;\n      }\n    },\n\n    warnIfExceeded() {\n      if (elapsed > maxDelay) {\n        console.warn(`${fnName} took ${elapsed}ms, which is more than the warning threshold of ${maxDelay}ms. \nIf your state or actions are very large, you may want to disable the middleware as it might cause too much of a slowdown in development mode. See https://redux-toolkit.js.org/api/getDefaultMiddleware for instructions.\nIt is disabled in production builds, so you don't need to worry about that.`);\n      }\n    }\n\n  };\n}\nexport function delay(ms: number) {\n  return new Promise(resolve => setTimeout(resolve, ms));\n}\nexport function find<T>(iterable: Iterable<T>, comparator: (item: T) => boolean): T | undefined {\n  for (const entry of iterable) {\n    if (comparator(entry)) {\n      return entry;\n    }\n  }\n\n  return undefined;\n}\nexport class Tuple<Items extends ReadonlyArray<unknown> = []> extends Array<Items[number]> {\n  constructor(length: number);\n  constructor(...items: Items);\n\n  constructor(...items: any[]) {\n    super(...items);\n    Object.setPrototypeOf(this, Tuple.prototype);\n  }\n\n  static get [Symbol.species]() {\n    return (Tuple as any);\n  }\n\n  concat<AdditionalItems extends ReadonlyArray<unknown>>(items: Tuple<AdditionalItems>): Tuple<[...Items, ...AdditionalItems]>;\n  concat<AdditionalItems extends ReadonlyArray<unknown>>(items: AdditionalItems): Tuple<[...Items, ...AdditionalItems]>;\n  concat<AdditionalItems extends ReadonlyArray<unknown>>(...items: AdditionalItems): Tuple<[...Items, ...AdditionalItems]>;\n\n  concat(...arr: any[]) {\n    return super.concat.apply(this, arr);\n  }\n\n  prepend<AdditionalItems extends ReadonlyArray<unknown>>(items: Tuple<AdditionalItems>): Tuple<[...AdditionalItems, ...Items]>;\n  prepend<AdditionalItems extends ReadonlyArray<unknown>>(items: AdditionalItems): Tuple<[...AdditionalItems, ...Items]>;\n  prepend<AdditionalItems extends ReadonlyArray<unknown>>(...items: AdditionalItems): Tuple<[...AdditionalItems, ...Items]>;\n\n  prepend(...arr: any[]) {\n    if (arr.length === 1 && Array.isArray(arr[0])) {\n      return new Tuple(...arr[0].concat(this));\n    }\n\n    return new Tuple(...arr.concat(this));\n  }\n\n}\nexport function freezeDraftable<T>(val: T) {\n  return isDraftable(val) ? createNextState(val, () => {}) : val;\n}\ninterface WeakMapEmplaceHandler<K extends object, V> {\n  /**\r\n   * Will be called to get value, if no value is currently in map.\r\n   */\n  insert?(key: K, map: WeakMap<K, V>): V;\n  /**\r\n   * Will be called to update a value, if one exists already.\r\n   */\n\n  update?(previous: V, key: K, map: WeakMap<K, V>): V;\n}\ninterface MapEmplaceHandler<K, V> {\n  /**\r\n   * Will be called to get value, if no value is currently in map.\r\n   */\n  insert?(key: K, map: Map<K, V>): V;\n  /**\r\n   * Will be called to update a value, if one exists already.\r\n   */\n\n  update?(previous: V, key: K, map: Map<K, V>): V;\n}\nexport function emplace<K, V>(map: Map<K, V>, key: K, handler: MapEmplaceHandler<K, V>): V;\nexport function emplace<K extends object, V>(map: WeakMap<K, V>, key: K, handler: WeakMapEmplaceHandler<K, V>): V;\n/**\r\n * Allow inserting a new value, or updating an existing one\r\n * @throws if called for a key with no current value and no `insert` handler is provided\r\n * @returns current value in map (after insertion/updating)\r\n * ```ts\r\n * // return current value if already in map, otherwise initialise to 0 and return that\r\n * const num = emplace(map, key, {\r\n *   insert: () => 0\r\n * })\r\n *\r\n * // increase current value by one if already in map, otherwise initialise to 0\r\n * const num = emplace(map, key, {\r\n *   update: (n) => n + 1,\r\n *   insert: () => 0,\r\n * })\r\n *\r\n * // only update if value's already in the map - and increase it by one\r\n * if (map.has(key)) {\r\n *   const num = emplace(map, key, {\r\n *     update: (n) => n + 1,\r\n *   })\r\n * }\r\n * ```\r\n *\r\n * @remarks\r\n * Based on https://github.com/tc39/proposal-upsert currently in Stage 2 - maybe in a few years we'll be able to replace this with direct method calls\r\n */\n\nexport function emplace<K extends object, V>(map: WeakMap<K, V>, key: K, handler: WeakMapEmplaceHandler<K, V>): V {\n  if (map.has(key)) {\n    let value = (map.get(key) as V);\n\n    if (handler.update) {\n      value = handler.update(value, key, map);\n      map.set(key, value);\n    }\n\n    return value;\n  }\n\n  if (!handler.insert) throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(10) : 'No insert provided for key not already in map');\n  const inserted = handler.insert(key, map);\n  map.set(key, inserted);\n  return inserted;\n}","import type { Middleware, UnknownAction } from 'redux';\nimport type { ThunkMiddleware } from 'redux-thunk';\nimport { thunk as thunkMiddleware, withExtraArgument } from 'redux-thunk';\nimport type { ActionCreatorInvariantMiddlewareOptions } from './actionCreatorInvariantMiddleware';\nimport { createActionCreatorInvariantMiddleware } from './actionCreatorInvariantMiddleware';\nimport type { ImmutableStateInvariantMiddlewareOptions } from './immutableStateInvariantMiddleware';\n/* PROD_START_REMOVE_UMD */\n\nimport { createImmutableStateInvariantMiddleware } from './immutableStateInvariantMiddleware';\n/* PROD_STOP_REMOVE_UMD */\n\nimport type { SerializableStateInvariantMiddlewareOptions } from './serializableStateInvariantMiddleware';\nimport { createSerializableStateInvariantMiddleware } from './serializableStateInvariantMiddleware';\nimport type { ExcludeFromTuple } from './tsHelpers';\nimport { Tuple } from './utils';\n\nfunction isBoolean(x: any): x is boolean {\n  return typeof x === 'boolean';\n}\n\ninterface ThunkOptions<E = any> {\n  extraArgument: E;\n}\ninterface GetDefaultMiddlewareOptions {\n  thunk?: boolean | ThunkOptions;\n  immutableCheck?: boolean | ImmutableStateInvariantMiddlewareOptions;\n  serializableCheck?: boolean | SerializableStateInvariantMiddlewareOptions;\n  actionCreatorCheck?: boolean | ActionCreatorInvariantMiddlewareOptions;\n}\nexport type ThunkMiddlewareFor<S, O extends GetDefaultMiddlewareOptions = {}> = O extends {\n  thunk: false;\n} ? never : O extends {\n  thunk: {\n    extraArgument: infer E;\n  };\n} ? ThunkMiddleware<S, UnknownAction, E> : ThunkMiddleware<S, UnknownAction>;\nexport type GetDefaultMiddleware<S = any> = <O extends GetDefaultMiddlewareOptions = {\n  thunk: true;\n  immutableCheck: true;\n  serializableCheck: true;\n  actionCreatorCheck: true;\n}>(options?: O) => Tuple<ExcludeFromTuple<[ThunkMiddlewareFor<S, O>], never>>;\nexport const buildGetDefaultMiddleware = <S = any,>(): GetDefaultMiddleware<S> => function getDefaultMiddleware(options) {\n  const {\n    thunk = true,\n    immutableCheck = true,\n    serializableCheck = true,\n    actionCreatorCheck = true\n  } = options ?? {};\n  let middlewareArray = new Tuple<Middleware[]>();\n\n  if (thunk) {\n    if (isBoolean(thunk)) {\n      middlewareArray.push(thunkMiddleware);\n    } else {\n      middlewareArray.push(withExtraArgument(thunk.extraArgument));\n    }\n  }\n\n  if (process.env.NODE_ENV !== 'production') {\n    if (immutableCheck) {\n      /* PROD_START_REMOVE_UMD */\n      let immutableOptions: ImmutableStateInvariantMiddlewareOptions = {};\n\n      if (!isBoolean(immutableCheck)) {\n        immutableOptions = immutableCheck;\n      }\n\n      middlewareArray.unshift(createImmutableStateInvariantMiddleware(immutableOptions));\n      /* PROD_STOP_REMOVE_UMD */\n    }\n\n    if (serializableCheck) {\n      let serializableOptions: SerializableStateInvariantMiddlewareOptions = {};\n\n      if (!isBoolean(serializableCheck)) {\n        serializableOptions = serializableCheck;\n      }\n\n      middlewareArray.push(createSerializableStateInvariantMiddleware(serializableOptions));\n    }\n\n    if (actionCreatorCheck) {\n      let actionCreatorOptions: ActionCreatorInvariantMiddlewareOptions = {};\n\n      if (!isBoolean(actionCreatorCheck)) {\n        actionCreatorOptions = actionCreatorCheck;\n      }\n\n      middlewareArray.unshift(createActionCreatorInvariantMiddleware(actionCreatorOptions));\n    }\n  }\n\n  return (middlewareArray as any);\n};","import type { StoreEnhancer } from 'redux';\nexport const SHOULD_AUTOBATCH = 'RTK_autoBatch';\nexport const prepareAutoBatched = <T,>() => (payload: T): {\n  payload: T;\n  meta: unknown;\n} => ({\n  payload,\n  meta: {\n    [SHOULD_AUTOBATCH]: true\n  }\n});\n\nconst createQueueWithTimer = (timeout: number) => {\n  return (notify: () => void) => {\n    setTimeout(notify, timeout);\n  };\n}; // requestAnimationFrame won't exist in SSR environments.\n// Fall back to a vague approximation just to keep from erroring.\n\n\nconst rAF = typeof window !== 'undefined' && window.requestAnimationFrame ? window.requestAnimationFrame : createQueueWithTimer(10);\nexport type AutoBatchOptions = {\n  type: 'tick';\n} | {\n  type: 'timer';\n  timeout: number;\n} | {\n  type: 'raf';\n} | {\n  type: 'callback';\n  queueNotification: (notify: () => void) => void;\n};\n/**\r\n * A Redux store enhancer that watches for \"low-priority\" actions, and delays\r\n * notifying subscribers until either the queued callback executes or the\r\n * next \"standard-priority\" action is dispatched.\r\n *\r\n * This allows dispatching multiple \"low-priority\" actions in a row with only\r\n * a single subscriber notification to the UI after the sequence of actions\r\n * is finished, thus improving UI re-render performance.\r\n *\r\n * Watches for actions with the `action.meta[SHOULD_AUTOBATCH]` attribute.\r\n * This can be added to `action.meta` manually, or by using the\r\n * `prepareAutoBatched` helper.\r\n *\r\n * By default, it will queue a notification for the end of the event loop tick.\r\n * However, you can pass several other options to configure the behavior:\r\n * - `{type: 'tick'}`: queues using `queueMicrotask`\r\n * - `{type: 'timer, timeout: number}`: queues using `setTimeout`\r\n * - `{type: 'raf'}`: queues using `requestAnimationFrame` (default)\r\n * - `{type: 'callback', queueNotification: (notify: () => void) => void}`: lets you provide your own callback\r\n *\r\n *\r\n */\n\nexport const autoBatchEnhancer = (options: AutoBatchOptions = {\n  type: 'raf'\n}): StoreEnhancer => next => (...args) => {\n  const store = next(...args);\n  let notifying = true;\n  let shouldNotifyAtEndOfTick = false;\n  let notificationQueued = false;\n  const listeners = new Set<() => void>();\n  const queueCallback = options.type === 'tick' ? queueMicrotask : options.type === 'raf' ? rAF : options.type === 'callback' ? options.queueNotification : createQueueWithTimer(options.timeout);\n\n  const notifyListeners = () => {\n    // We're running at the end of the event loop tick.\n    // Run the real listener callbacks to actually update the UI.\n    notificationQueued = false;\n\n    if (shouldNotifyAtEndOfTick) {\n      shouldNotifyAtEndOfTick = false;\n      listeners.forEach(l => l());\n    }\n  };\n\n  return Object.assign({}, store, {\n    // Override the base `store.subscribe` method to keep original listeners\n    // from running if we're delaying notifications\n    subscribe(listener: () => void) {\n      // Each wrapped listener will only call the real listener if\n      // the `notifying` flag is currently active when it's called.\n      // This lets the base store work as normal, while the actual UI\n      // update becomes controlled by this enhancer.\n      const wrappedListener: typeof listener = () => notifying && listener();\n\n      const unsubscribe = store.subscribe(wrappedListener);\n      listeners.add(listener);\n      return () => {\n        unsubscribe();\n        listeners.delete(listener);\n      };\n    },\n\n    // Override the base `store.dispatch` method so that we can check actions\n    // for the `shouldAutoBatch` flag and determine if batching is active\n    dispatch(action: any) {\n      try {\n        // If the action does _not_ have the `shouldAutoBatch` flag,\n        // we resume/continue normal notify-after-each-dispatch behavior\n        notifying = !action?.meta?.[SHOULD_AUTOBATCH]; // If a `notifyListeners` microtask was queued, you can't cancel it.\n        // Instead, we set a flag so that it's a no-op when it does run\n\n        shouldNotifyAtEndOfTick = !notifying;\n\n        if (shouldNotifyAtEndOfTick) {\n          // We've seen at least 1 action with `SHOULD_AUTOBATCH`. Try to queue\n          // a microtask to notify listeners at the end of the event loop tick.\n          // Make sure we only enqueue this _once_ per tick.\n          if (!notificationQueued) {\n            notificationQueued = true;\n            queueCallback(notifyListeners);\n          }\n        } // Go ahead and process the action as usual, including reducers.\n        // If normal notification behavior is enabled, the store will notify\n        // all of its own listeners, and the wrapper callbacks above will\n        // see `notifying` is true and pass on to the real listener callbacks.\n        // If we're \"batching\" behavior, then the wrapped callbacks will\n        // bail out, causing the base store notification behavior to be no-ops.\n\n\n        return store.dispatch(action);\n      } finally {\n        // Assume we're back to normal behavior after each action\n        notifying = true;\n      }\n    }\n\n  });\n};","import type { StoreEnhancer } from 'redux';\nimport type { AutoBatchOptions } from './autoBatchEnhancer';\nimport { autoBatchEnhancer } from './autoBatchEnhancer';\nimport { Tuple } from './utils';\nimport type { Middlewares } from './configureStore';\nimport type { ExtractDispatchExtensions } from './tsHelpers';\ntype GetDefaultEnhancersOptions = {\n  autoBatch?: boolean | AutoBatchOptions;\n};\nexport type GetDefaultEnhancers<M extends Middlewares<any>> = (options?: GetDefaultEnhancersOptions) => Tuple<[StoreEnhancer<{\n  dispatch: ExtractDispatchExtensions<M>;\n}>]>;\nexport const buildGetDefaultEnhancers = <M extends Middlewares<any>,>(middlewareEnhancer: StoreEnhancer<{\n  dispatch: ExtractDispatchExtensions<M>;\n}>): GetDefaultEnhancers<M> => function getDefaultEnhancers(options) {\n  const {\n    autoBatch = true\n  } = options ?? {};\n  let enhancerArray = new Tuple<StoreEnhancer[]>(middlewareEnhancer);\n\n  if (autoBatch) {\n    enhancerArray.push(autoBatchEnhancer(typeof autoBatch === 'object' ? autoBatch : undefined));\n  }\n\n  return (enhancerArray as any);\n};","import { formatProdErrorMessage as _formatProdErrorMessage7 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage6 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage5 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage4 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage3 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage2 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport type { Reducer, ReducersMapObject, Middleware, Action, StoreEnhancer, Store, UnknownAction } from 'redux';\nimport { applyMiddleware, createStore, compose, combineReducers, isPlainObject } from 'redux';\nimport type { DevToolsEnhancerOptions as DevToolsOptions } from './devtoolsExtension';\nimport { composeWithDevTools } from './devtoolsExtension';\nimport type { ThunkMiddlewareFor, GetDefaultMiddleware } from './getDefaultMiddleware';\nimport { buildGetDefaultMiddleware } from './getDefaultMiddleware';\nimport type { ExtractDispatchExtensions, ExtractStoreExtensions, ExtractStateExtensions, UnknownIfNonSpecific } from './tsHelpers';\nimport type { Tuple } from './utils';\nimport type { GetDefaultEnhancers } from './getDefaultEnhancers';\nimport { buildGetDefaultEnhancers } from './getDefaultEnhancers';\nconst IS_PRODUCTION = process.env.NODE_ENV === 'production';\n/**\r\n * Options for `configureStore()`.\r\n *\r\n * @public\r\n */\n\nexport interface ConfigureStoreOptions<S = any, A extends Action = UnknownAction, M extends Tuple<Middlewares<S>> = Tuple<Middlewares<S>>, E extends Tuple<Enhancers> = Tuple<Enhancers>, P = S> {\n  /**\r\n   * A single reducer function that will be used as the root reducer, or an\r\n   * object of slice reducers that will be passed to `combineReducers()`.\r\n   */\n  reducer: Reducer<S, A, P> | ReducersMapObject<S, A, P>;\n  /**\r\n   * An array of Redux middleware to install, or a callback receiving `getDefaultMiddleware` and returning a Tuple of middleware.\r\n   * If not supplied, defaults to the set of middleware returned by `getDefaultMiddleware()`.\r\n   *\r\n   * @example `middleware: (gDM) => gDM().concat(logger, apiMiddleware, yourCustomMiddleware)`\r\n   * @see https://redux-toolkit.js.org/api/getDefaultMiddleware#intended-usage\r\n   */\n\n  middleware?: (getDefaultMiddleware: GetDefaultMiddleware<S>) => M;\n  /**\r\n   * Whether to enable Redux DevTools integration. Defaults to `true`.\r\n   *\r\n   * Additional configuration can be done by passing Redux DevTools options\r\n   */\n\n  devTools?: boolean | DevToolsOptions;\n  /**\r\n   * The initial state, same as Redux's createStore.\r\n   * You may optionally specify it to hydrate the state\r\n   * from the server in universal apps, or to restore a previously serialized\r\n   * user session. If you use `combineReducers()` to produce the root reducer\r\n   * function (either directly or indirectly by passing an object as `reducer`),\r\n   * this must be an object with the same shape as the reducer map keys.\r\n   */\n  // we infer here, and instead complain if the reducer doesn't match\n\n  preloadedState?: P;\n  /**\r\n   * The store enhancers to apply. See Redux's `createStore()`.\r\n   * All enhancers will be included before the DevTools Extension enhancer.\r\n   * If you need to customize the order of enhancers, supply a callback\r\n   * function that will receive a `getDefaultEnhancers` function that returns a Tuple,\r\n   * and should return a Tuple of enhancers (such as `getDefaultEnhancers().concat(offline)`).\r\n   * If you only need to add middleware, you can use the `middleware` parameter instead.\r\n   */\n\n  enhancers?: (getDefaultEnhancers: GetDefaultEnhancers<M>) => E;\n}\nexport type Middlewares<S> = ReadonlyArray<Middleware<{}, S>>;\ntype Enhancers = ReadonlyArray<StoreEnhancer>;\n/**\r\n * A Redux store returned by `configureStore()`. Supports dispatching\r\n * side-effectful _thunks_ in addition to plain actions.\r\n *\r\n * @public\r\n */\n\nexport type EnhancedStore<S = any, A extends Action = UnknownAction, E extends Enhancers = Enhancers> = ExtractStoreExtensions<E> & Store<S, A, UnknownIfNonSpecific<ExtractStateExtensions<E>>>;\n/**\r\n * A friendly abstraction over the standard Redux `createStore()` function.\r\n *\r\n * @param options The store configuration.\r\n * @returns A configured Redux store.\r\n *\r\n * @public\r\n */\n\nexport function configureStore<S = any, A extends Action = UnknownAction, M extends Tuple<Middlewares<S>> = Tuple<[ThunkMiddlewareFor<S>]>, E extends Tuple<Enhancers> = Tuple<[StoreEnhancer<{\n  dispatch: ExtractDispatchExtensions<M>;\n}>, StoreEnhancer]>, P = S>(options: ConfigureStoreOptions<S, A, M, E, P>): EnhancedStore<S, A, E> {\n  const getDefaultMiddleware = buildGetDefaultMiddleware<S>();\n  const {\n    reducer = undefined,\n    middleware,\n    devTools = true,\n    preloadedState = undefined,\n    enhancers = undefined\n  } = options || {};\n  let rootReducer: Reducer<S, A, P>;\n\n  if (typeof reducer === 'function') {\n    rootReducer = reducer;\n  } else if (isPlainObject(reducer)) {\n    rootReducer = ((combineReducers(reducer) as unknown) as Reducer<S, A, P>);\n  } else {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(1) : '`reducer` is a required argument, and must be a function or an object of functions that can be passed to combineReducers');\n  }\n\n  if (!IS_PRODUCTION && middleware && typeof middleware !== 'function') {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage2(2) : '`middleware` field must be a callback');\n  }\n\n  let finalMiddleware: Tuple<Middlewares<S>>;\n\n  if (typeof middleware === 'function') {\n    finalMiddleware = middleware(getDefaultMiddleware);\n\n    if (!IS_PRODUCTION && !Array.isArray(finalMiddleware)) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage3(3) : 'when using a middleware builder function, an array of middleware must be returned');\n    }\n  } else {\n    finalMiddleware = getDefaultMiddleware();\n  }\n\n  if (!IS_PRODUCTION && finalMiddleware.some((item: any) => typeof item !== 'function')) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage4(4) : 'each middleware provided to configureStore must be a function');\n  }\n\n  let finalCompose = compose;\n\n  if (devTools) {\n    finalCompose = composeWithDevTools({\n      // Enable capture of stack traces for dispatched Redux actions\n      trace: !IS_PRODUCTION,\n      ...(typeof devTools === 'object' && devTools)\n    });\n  }\n\n  const middlewareEnhancer = applyMiddleware(...finalMiddleware);\n  const getDefaultEnhancers = buildGetDefaultEnhancers<M>(middlewareEnhancer);\n\n  if (!IS_PRODUCTION && enhancers && typeof enhancers !== 'function') {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage5(5) : '`enhancers` field must be a callback');\n  }\n\n  let storeEnhancers = typeof enhancers === 'function' ? enhancers(getDefaultEnhancers) : getDefaultEnhancers();\n\n  if (!IS_PRODUCTION && !Array.isArray(storeEnhancers)) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage6(6) : '`enhancers` callback must return an array');\n  }\n\n  if (!IS_PRODUCTION && storeEnhancers.some((item: any) => typeof item !== 'function')) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage7(7) : 'each enhancer provided to configureStore must be a function');\n  }\n\n  if (!IS_PRODUCTION && finalMiddleware.length && !storeEnhancers.includes(middlewareEnhancer)) {\n    console.error('middlewares were provided, but middleware enhancer was not included in final enhancers - make sure to call `getDefaultEnhancers`');\n  }\n\n  const composedEnhancer: StoreEnhancer<any> = finalCompose(...storeEnhancers);\n  return createStore(rootReducer, (preloadedState as P), composedEnhancer);\n}","import { formatProdErrorMessage as _formatProdErrorMessage } from \"src/utils/formatProdErrorMessage\";\nimport compose from './compose';\nimport { Middleware, MiddlewareAPI } from './types/middleware';\nimport { StoreEnhancer, Dispatch } from './types/store';\n\n/**\n * Creates a store enhancer that applies middleware to the dispatch method\n * of the Redux store. This is handy for a variety of tasks, such as expressing\n * asynchronous actions in a concise manner, or logging every action payload.\n *\n * See `redux-thunk` package as an example of the Redux middleware.\n *\n * Because middleware is potentially asynchronous, this should be the first\n * store enhancer in the composition chain.\n *\n * Note that each middleware will be given the `dispatch` and `getState` functions\n * as named arguments.\n *\n * @param middlewares The middleware chain to be applied.\n * @returns A store enhancer applying the middleware.\n *\n * @template Ext Dispatch signature added by a middleware.\n * @template S The type of the state supported by a middleware.\n */\nexport default function applyMiddleware(): StoreEnhancer;\nexport default function applyMiddleware<Ext1, S>(middleware1: Middleware<Ext1, S, any>): StoreEnhancer<{\n  dispatch: Ext1;\n}>;\nexport default function applyMiddleware<Ext1, Ext2, S>(middleware1: Middleware<Ext1, S, any>, middleware2: Middleware<Ext2, S, any>): StoreEnhancer<{\n  dispatch: Ext1 & Ext2;\n}>;\nexport default function applyMiddleware<Ext1, Ext2, Ext3, S>(middleware1: Middleware<Ext1, S, any>, middleware2: Middleware<Ext2, S, any>, middleware3: Middleware<Ext3, S, any>): StoreEnhancer<{\n  dispatch: Ext1 & Ext2 & Ext3;\n}>;\nexport default function applyMiddleware<Ext1, Ext2, Ext3, Ext4, S>(middleware1: Middleware<Ext1, S, any>, middleware2: Middleware<Ext2, S, any>, middleware3: Middleware<Ext3, S, any>, middleware4: Middleware<Ext4, S, any>): StoreEnhancer<{\n  dispatch: Ext1 & Ext2 & Ext3 & Ext4;\n}>;\nexport default function applyMiddleware<Ext1, Ext2, Ext3, Ext4, Ext5, S>(middleware1: Middleware<Ext1, S, any>, middleware2: Middleware<Ext2, S, any>, middleware3: Middleware<Ext3, S, any>, middleware4: Middleware<Ext4, S, any>, middleware5: Middleware<Ext5, S, any>): StoreEnhancer<{\n  dispatch: Ext1 & Ext2 & Ext3 & Ext4 & Ext5;\n}>;\nexport default function applyMiddleware<Ext, S = any>(...middlewares: Middleware<any, S, any>[]): StoreEnhancer<{\n  dispatch: Ext;\n}>;\nexport default function applyMiddleware(...middlewares: Middleware[]): StoreEnhancer<any> {\n  return createStore => (reducer, preloadedState) => {\n    const store = createStore(reducer, preloadedState);\n    let dispatch: Dispatch = () => {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(15) : 'Dispatching while constructing your middleware is not allowed. ' + 'Other middleware would not be applied to this dispatch.');\n    };\n    const middlewareAPI: MiddlewareAPI = {\n      getState: store.getState,\n      dispatch: (action, ...args) => dispatch(action, ...args)\n    };\n    const chain = middlewares.map(middleware => middleware(middlewareAPI));\n    dispatch = compose<typeof dispatch>(...chain)(store.dispatch);\n    return {\n      ...store,\n      dispatch\n    };\n  };\n}","import { formatProdErrorMessage as _formatProdErrorMessage6 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage5 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage4 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage3 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage2 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport type { Action } from 'redux';\nimport type { CaseReducer, CaseReducers, ActionMatcherDescriptionCollection } from './createReducer';\nimport type { TypeGuard } from './tsHelpers';\nexport interface TypedActionCreator<Type extends string> {\n  (...args: any[]): Action<Type>;\n  type: Type;\n}\n/**\r\n * A builder for an action <-> reducer map.\r\n *\r\n * @public\r\n */\n\nexport interface ActionReducerMapBuilder<State> {\n  /**\r\n   * Adds a case reducer to handle a single exact action type.\r\n   * @remarks\r\n   * All calls to `builder.addCase` must come before any calls to `builder.addMatcher` or `builder.addDefaultCase`.\r\n   * @param actionCreator - Either a plain action type string, or an action creator generated by [`createAction`](./createAction) that can be used to determine the action type.\r\n   * @param reducer - The actual case reducer function.\r\n   */\n  addCase<ActionCreator extends TypedActionCreator<string>>(actionCreator: ActionCreator, reducer: CaseReducer<State, ReturnType<ActionCreator>>): ActionReducerMapBuilder<State>;\n  /**\r\n   * Adds a case reducer to handle a single exact action type.\r\n   * @remarks\r\n   * All calls to `builder.addCase` must come before any calls to `builder.addMatcher` or `builder.addDefaultCase`.\r\n   * @param actionCreator - Either a plain action type string, or an action creator generated by [`createAction`](./createAction) that can be used to determine the action type.\r\n   * @param reducer - The actual case reducer function.\r\n   */\n\n  addCase<Type extends string, A extends Action<Type>>(type: Type, reducer: CaseReducer<State, A>): ActionReducerMapBuilder<State>;\n  /**\r\n   * Allows you to match your incoming actions against your own filter function instead of only the `action.type` property.\r\n   * @remarks\r\n   * If multiple matcher reducers match, all of them will be executed in the order\r\n   * they were defined in - even if a case reducer already matched.\r\n   * All calls to `builder.addMatcher` must come after any calls to `builder.addCase` and before any calls to `builder.addDefaultCase`.\r\n   * @param matcher - A matcher function. In TypeScript, this should be a [type predicate](https://www.typescriptlang.org/docs/handbook/2/narrowing.html#using-type-predicates)\r\n   *   function\r\n   * @param reducer - The actual case reducer function.\r\n   *\r\n   * @example\r\n  ```ts\r\n  import {\r\n  createAction,\r\n  createReducer,\r\n  AsyncThunk,\r\n  UnknownAction,\r\n  } from \"@reduxjs/toolkit\";\r\n  type GenericAsyncThunk = AsyncThunk<unknown, unknown, any>;\r\n  type PendingAction = ReturnType<GenericAsyncThunk[\"pending\"]>;\r\n  type RejectedAction = ReturnType<GenericAsyncThunk[\"rejected\"]>;\r\n  type FulfilledAction = ReturnType<GenericAsyncThunk[\"fulfilled\"]>;\r\n  const initialState: Record<string, string> = {};\r\n  const resetAction = createAction(\"reset-tracked-loading-state\");\r\n  function isPendingAction(action: UnknownAction): action is PendingAction {\r\n  return typeof action.type === \"string\" && action.type.endsWith(\"/pending\");\r\n  }\r\n  const reducer = createReducer(initialState, (builder) => {\r\n  builder\r\n    .addCase(resetAction, () => initialState)\r\n    // matcher can be defined outside as a type predicate function\r\n    .addMatcher(isPendingAction, (state, action) => {\r\n      state[action.meta.requestId] = \"pending\";\r\n    })\r\n    .addMatcher(\r\n      // matcher can be defined inline as a type predicate function\r\n      (action): action is RejectedAction => action.type.endsWith(\"/rejected\"),\r\n      (state, action) => {\r\n        state[action.meta.requestId] = \"rejected\";\r\n      }\r\n    )\r\n    // matcher can just return boolean and the matcher can receive a generic argument\r\n    .addMatcher<FulfilledAction>(\r\n      (action) => action.type.endsWith(\"/fulfilled\"),\r\n      (state, action) => {\r\n        state[action.meta.requestId] = \"fulfilled\";\r\n      }\r\n    );\r\n  });\r\n  ```\r\n   */\n\n  addMatcher<A>(matcher: TypeGuard<A> | ((action: any) => boolean), reducer: CaseReducer<State, A extends Action ? A : A & Action>): Omit<ActionReducerMapBuilder<State>, 'addCase'>;\n  /**\r\n   * Adds a \"default case\" reducer that is executed if no case reducer and no matcher\r\n   * reducer was executed for this action.\r\n   * @param reducer - The fallback \"default case\" reducer function.\r\n   *\r\n   * @example\r\n  ```ts\r\n  import { createReducer } from '@reduxjs/toolkit'\r\n  const initialState = { otherActions: 0 }\r\n  const reducer = createReducer(initialState, builder => {\r\n  builder\r\n    // .addCase(...)\r\n    // .addMatcher(...)\r\n    .addDefaultCase((state, action) => {\r\n      state.otherActions++\r\n    })\r\n  })\r\n  ```\r\n   */\n\n  addDefaultCase(reducer: CaseReducer<State, Action>): {};\n}\nexport function executeReducerBuilderCallback<S>(builderCallback: (builder: ActionReducerMapBuilder<S>) => void): [CaseReducers<S, any>, ActionMatcherDescriptionCollection<S>, CaseReducer<S, Action> | undefined] {\n  const actionsMap: CaseReducers<S, any> = {};\n  const actionMatchers: ActionMatcherDescriptionCollection<S> = [];\n  let defaultCaseReducer: CaseReducer<S, Action> | undefined;\n  const builder = {\n    addCase(typeOrActionCreator: string | TypedActionCreator<any>, reducer: CaseReducer<S>) {\n      if (process.env.NODE_ENV !== 'production') {\n        /*\r\n         to keep the definition by the user in line with actual behavior,\r\n         we enforce `addCase` to always be called before calling `addMatcher`\r\n         as matching cases take precedence over matchers\r\n         */\n        if (actionMatchers.length > 0) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(26) : '`builder.addCase` should only be called before calling `builder.addMatcher`');\n        }\n\n        if (defaultCaseReducer) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage2(27) : '`builder.addCase` should only be called before calling `builder.addDefaultCase`');\n        }\n      }\n\n      const type = typeof typeOrActionCreator === 'string' ? typeOrActionCreator : typeOrActionCreator.type;\n\n      if (!type) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage3(28) : '`builder.addCase` cannot be called with an empty action type');\n      }\n\n      if (type in actionsMap) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage4(29) : '`builder.addCase` cannot be called with two reducers for the same action type ' + `'${type}'`);\n      }\n\n      actionsMap[type] = reducer;\n      return builder;\n    },\n\n    addMatcher<A>(matcher: TypeGuard<A>, reducer: CaseReducer<S, A extends Action ? A : A & Action>) {\n      if (process.env.NODE_ENV !== 'production') {\n        if (defaultCaseReducer) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage5(30) : '`builder.addMatcher` should only be called before calling `builder.addDefaultCase`');\n        }\n      }\n\n      actionMatchers.push({\n        matcher,\n        reducer\n      });\n      return builder;\n    },\n\n    addDefaultCase(reducer: CaseReducer<S, Action>) {\n      if (process.env.NODE_ENV !== 'production') {\n        if (defaultCaseReducer) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage6(31) : '`builder.addDefaultCase` can only be called once');\n        }\n      }\n\n      defaultCaseReducer = reducer;\n      return builder;\n    }\n\n  };\n  builderCallback(builder);\n  return [actionsMap, actionMatchers, defaultCaseReducer];\n}","// Borrowed from https://github.com/ai/nanoid/blob/3.0.2/non-secure/index.js\n// This alphabet uses `A-Za-z0-9_-` symbols. A genetic algorithm helped\n// optimize the gzip compression for this alphabet.\nlet urlAlphabet = 'ModuleSymbhasOwnPr-0123456789ABCDEFGHNRVfgctiUvz_KqYTJkLxpZXIjQW';\n/**\r\n *\r\n * @public\r\n */\n\nexport let nanoid = (size = 21) => {\n  let id = ''; // A compact alternative for `for (var i = 0; i < step; i++)`.\n\n  let i = size;\n\n  while (i--) {\n    // `| 0` is more compact and faster than `Math.floor()`.\n    id += urlAlphabet[Math.random() * 64 | 0];\n  }\n\n  return id;\n};","import { formatProdErrorMessage as _formatProdErrorMessage8 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage7 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage6 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage5 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage4 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage3 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage2 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport type { Action, UnknownAction, Reducer } from 'redux';\nimport type { Selector } from 'reselect';\nimport type { ActionCreatorWithoutPayload, PayloadAction, PayloadActionCreator, PrepareAction, _ActionCreatorWithPreparedPayload } from './createAction';\nimport { createAction } from './createAction';\nimport type { ActionMatcherDescriptionCollection, CaseReducer, ReducerWithInitialState } from './createReducer';\nimport { createReducer } from './createReducer';\nimport type { ActionReducerMapBuilder, TypedActionCreator } from './mapBuilders';\nimport { executeReducerBuilderCallback } from './mapBuilders';\nimport type { Id, Tail, TypeGuard } from './tsHelpers';\nimport type { InjectConfig } from './combineSlices';\nimport type { AsyncThunk, AsyncThunkConfig, AsyncThunkOptions, AsyncThunkPayloadCreator, OverrideThunkApiConfigs } from './createAsyncThunk';\nimport { createAsyncThunk as _createAsyncThunk } from './createAsyncThunk';\nimport { emplace } from './utils';\nconst asyncThunkSymbol = /* @__PURE__ */Symbol.for('rtk-slice-createasyncthunk'); // type is annotated because it's too long to infer\n\nexport const asyncThunkCreator: {\n  [asyncThunkSymbol]: typeof _createAsyncThunk;\n} = {\n  [asyncThunkSymbol]: _createAsyncThunk\n};\ninterface InjectIntoConfig<NewReducerPath extends string> extends InjectConfig {\n  reducerPath?: NewReducerPath;\n}\n/**\r\n * The return value of `createSlice`\r\n *\r\n * @public\r\n */\n\nexport interface Slice<State = any, CaseReducers extends SliceCaseReducers<State> = SliceCaseReducers<State>, Name extends string = string, ReducerPath extends string = Name, Selectors extends SliceSelectors<State> = SliceSelectors<State>> {\n  /**\r\n   * The slice name.\r\n   */\n  name: Name;\n  /**\r\n   *  The slice reducer path.\r\n   */\n\n  reducerPath: ReducerPath;\n  /**\r\n   * The slice's reducer.\r\n   */\n\n  reducer: Reducer<State>;\n  /**\r\n   * Action creators for the types of actions that are handled by the slice\r\n   * reducer.\r\n   */\n\n  actions: CaseReducerActions<CaseReducers, Name>;\n  /**\r\n   * The individual case reducer functions that were passed in the `reducers` parameter.\r\n   * This enables reuse and testing if they were defined inline when calling `createSlice`.\r\n   */\n\n  caseReducers: SliceDefinedCaseReducers<CaseReducers>;\n  /**\r\n   * Provides access to the initial state value given to the slice.\r\n   * If a lazy state initializer was provided, it will be called and a fresh value returned.\r\n   */\n\n  getInitialState: () => State;\n  /**\r\n   * Get localised slice selectors (expects to be called with *just* the slice's state as the first parameter)\r\n   */\n\n  getSelectors(): Id<SliceDefinedSelectors<State, Selectors, State>>;\n  /**\r\n   * Get globalised slice selectors (`selectState` callback is expected to receive first parameter and return slice state)\r\n   */\n\n  getSelectors<RootState>(selectState: (rootState: RootState) => State): Id<SliceDefinedSelectors<State, Selectors, RootState>>;\n  /**\r\n   * Selectors that assume the slice's state is `rootState[slice.reducerPath]` (which is usually the case)\r\n   *\r\n   * Equivalent to `slice.getSelectors((state: RootState) => state[slice.reducerPath])`.\r\n   */\n\n  get selectors(): Id<SliceDefinedSelectors<State, Selectors, { [K in ReducerPath]: State }>>;\n  /**\r\n   * Inject slice into provided reducer (return value from `combineSlices`), and return injected slice.\r\n   */\n\n  injectInto<NewReducerPath extends string = ReducerPath>(this: this, injectable: {\n    inject: (slice: {\n      reducerPath: string;\n      reducer: Reducer;\n    }, config?: InjectConfig) => void;\n  }, config?: InjectIntoConfig<NewReducerPath>): InjectedSlice<State, CaseReducers, Name, NewReducerPath, Selectors>;\n  /**\r\n   * Select the slice state, using the slice's current reducerPath.\r\n   *\r\n   * Will throw an error if slice is not found.\r\n   */\n\n  selectSlice(state: { [K in ReducerPath]: State }): State;\n}\n/**\r\n * A slice after being called with `injectInto(reducer)`.\r\n *\r\n * Selectors can now be called with an `undefined` value, in which case they use the slice's initial state.\r\n */\n\ninterface InjectedSlice<State = any, CaseReducers extends SliceCaseReducers<State> = SliceCaseReducers<State>, Name extends string = string, ReducerPath extends string = Name, Selectors extends SliceSelectors<State> = SliceSelectors<State>> extends Omit<Slice<State, CaseReducers, Name, ReducerPath, Selectors>, 'getSelectors' | 'selectors'> {\n  /**\r\n   * Get localised slice selectors (expects to be called with *just* the slice's state as the first parameter)\r\n   */\n  getSelectors(): Id<SliceDefinedSelectors<State, Selectors, State | undefined>>;\n  /**\r\n   * Get globalised slice selectors (`selectState` callback is expected to receive first parameter and return slice state)\r\n   */\n\n  getSelectors<RootState>(selectState: (rootState: RootState) => State | undefined): Id<SliceDefinedSelectors<State, Selectors, RootState>>;\n  /**\r\n   * Selectors that assume the slice's state is `rootState[slice.name]` (which is usually the case)\r\n   *\r\n   * Equivalent to `slice.getSelectors((state: RootState) => state[slice.name])`.\r\n   */\n\n  get selectors(): Id<SliceDefinedSelectors<State, Selectors, { [K in ReducerPath]?: State | undefined }>>;\n  /**\r\n   * Select the slice state, using the slice's current reducerPath.\r\n   *\r\n   * Returns initial state if slice is not found.\r\n   */\n\n  selectSlice(state: { [K in ReducerPath]?: State | undefined }): State;\n}\n/**\r\n * Options for `createSlice()`.\r\n *\r\n * @public\r\n */\n\nexport interface CreateSliceOptions<State = any, CR extends SliceCaseReducers<State> = SliceCaseReducers<State>, Name extends string = string, ReducerPath extends string = Name, Selectors extends SliceSelectors<State> = SliceSelectors<State>> {\n  /**\r\n   * The slice's name. Used to namespace the generated action types.\r\n   */\n  name: Name;\n  /**\r\n   * The slice's reducer path. Used when injecting into a combined slice reducer.\r\n   */\n\n  reducerPath?: ReducerPath;\n  /**\r\n   * The initial state that should be used when the reducer is called the first time. This may also be a \"lazy initializer\" function, which should return an initial state value when called. This will be used whenever the reducer is called with `undefined` as its state value, and is primarily useful for cases like reading initial state from `localStorage`.\r\n   */\n\n  initialState: State | (() => State);\n  /**\r\n   * A mapping from action types to action-type-specific *case reducer*\r\n   * functions. For every action type, a matching action creator will be\r\n   * generated using `createAction()`.\r\n   */\n\n  reducers: ValidateSliceCaseReducers<State, CR> | ((creators: ReducerCreators<State>) => CR);\n  /**\r\n   * A callback that receives a *builder* object to define\r\n   * case reducers via calls to `builder.addCase(actionCreatorOrType, reducer)`.\r\n   * \r\n   * \r\n   * @example\r\n  ```ts\r\n  import { createAction, createSlice, Action } from '@reduxjs/toolkit'\r\n  const incrementBy = createAction<number>('incrementBy')\r\n  const decrement = createAction('decrement')\r\n  interface RejectedAction extends Action {\r\n  error: Error\r\n  }\r\n  function isRejectedAction(action: Action): action is RejectedAction {\r\n  return action.type.endsWith('rejected')\r\n  }\r\n  createSlice({\r\n  name: 'counter',\r\n  initialState: 0,\r\n  reducers: {},\r\n  extraReducers: builder => {\r\n    builder\r\n      .addCase(incrementBy, (state, action) => {\r\n        // action is inferred correctly here if using TS\r\n      })\r\n      // You can chain calls, or have separate `builder.addCase()` lines each time\r\n      .addCase(decrement, (state, action) => {})\r\n      // You can match a range of action types\r\n      .addMatcher(\r\n        isRejectedAction,\r\n        // `action` will be inferred as a RejectedAction due to isRejectedAction being defined as a type guard\r\n        (state, action) => {}\r\n      )\r\n      // and provide a default case if no other handlers matched\r\n      .addDefaultCase((state, action) => {})\r\n    }\r\n  })\r\n  ```\r\n   */\n\n  extraReducers?: (builder: ActionReducerMapBuilder<State>) => void;\n  /**\r\n   * A map of selectors that receive the slice's state and any additional arguments, and return a result.\r\n   */\n\n  selectors?: Selectors;\n}\nexport enum ReducerType {\n  reducer = 'reducer',\n  reducerWithPrepare = 'reducerWithPrepare',\n  asyncThunk = 'asyncThunk',\n}\ninterface ReducerDefinition<T extends ReducerType = ReducerType> {\n  _reducerDefinitionType: T;\n}\nexport interface CaseReducerDefinition<S = any, A extends Action = UnknownAction> extends CaseReducer<S, A>, ReducerDefinition<ReducerType.reducer> {}\n/**\r\n * A CaseReducer with a `prepare` method.\r\n *\r\n * @public\r\n */\n\nexport type CaseReducerWithPrepare<State, Action extends PayloadAction> = {\n  reducer: CaseReducer<State, Action>;\n  prepare: PrepareAction<Action['payload']>;\n};\nexport interface CaseReducerWithPrepareDefinition<State, Action extends PayloadAction> extends CaseReducerWithPrepare<State, Action>, ReducerDefinition<ReducerType.reducerWithPrepare> {}\nexport interface AsyncThunkSliceReducerConfig<State, ThunkArg extends any, Returned = unknown, ThunkApiConfig extends AsyncThunkConfig = {}> {\n  pending?: CaseReducer<State, ReturnType<AsyncThunk<Returned, ThunkArg, ThunkApiConfig>['pending']>>;\n  rejected?: CaseReducer<State, ReturnType<AsyncThunk<Returned, ThunkArg, ThunkApiConfig>['rejected']>>;\n  fulfilled?: CaseReducer<State, ReturnType<AsyncThunk<Returned, ThunkArg, ThunkApiConfig>['fulfilled']>>;\n  settled?: CaseReducer<State, ReturnType<AsyncThunk<Returned, ThunkArg, ThunkApiConfig>['rejected' | 'fulfilled']>>;\n  options?: AsyncThunkOptions<ThunkArg, ThunkApiConfig>;\n}\nexport interface AsyncThunkSliceReducerDefinition<State, ThunkArg extends any, Returned = unknown, ThunkApiConfig extends AsyncThunkConfig = {}> extends AsyncThunkSliceReducerConfig<State, ThunkArg, Returned, ThunkApiConfig>, ReducerDefinition<ReducerType.asyncThunk> {\n  payloadCreator: AsyncThunkPayloadCreator<Returned, ThunkArg, ThunkApiConfig>;\n}\n/**\r\n * Providing these as part of the config would cause circular types, so we disallow passing them\r\n */\n\ntype PreventCircular<ThunkApiConfig> = { [K in keyof ThunkApiConfig]: K extends 'state' | 'dispatch' ? never : ThunkApiConfig[K] };\ninterface AsyncThunkCreator<State, CurriedThunkApiConfig extends PreventCircular<AsyncThunkConfig> = PreventCircular<AsyncThunkConfig>> {\n  <Returned, ThunkArg = void>(payloadCreator: AsyncThunkPayloadCreator<Returned, ThunkArg, CurriedThunkApiConfig>, config?: AsyncThunkSliceReducerConfig<State, ThunkArg, Returned, CurriedThunkApiConfig>): AsyncThunkSliceReducerDefinition<State, ThunkArg, Returned, CurriedThunkApiConfig>;\n  <Returned, ThunkArg, ThunkApiConfig extends PreventCircular<AsyncThunkConfig> = {}>(payloadCreator: AsyncThunkPayloadCreator<Returned, ThunkArg, ThunkApiConfig>, config?: AsyncThunkSliceReducerConfig<State, ThunkArg, Returned, ThunkApiConfig>): AsyncThunkSliceReducerDefinition<State, ThunkArg, Returned, ThunkApiConfig>;\n  withTypes<ThunkApiConfig extends PreventCircular<AsyncThunkConfig>>(): AsyncThunkCreator<State, OverrideThunkApiConfigs<CurriedThunkApiConfig, ThunkApiConfig>>;\n}\nexport interface ReducerCreators<State> {\n  reducer(caseReducer: CaseReducer<State, PayloadAction>): CaseReducerDefinition<State, PayloadAction>;\n  reducer<Payload>(caseReducer: CaseReducer<State, PayloadAction<Payload>>): CaseReducerDefinition<State, PayloadAction<Payload>>;\n  asyncThunk: AsyncThunkCreator<State>;\n  preparedReducer<Prepare extends PrepareAction<any>>(prepare: Prepare, reducer: CaseReducer<State, ReturnType<_ActionCreatorWithPreparedPayload<Prepare>>>): {\n    _reducerDefinitionType: ReducerType.reducerWithPrepare;\n    prepare: Prepare;\n    reducer: CaseReducer<State, ReturnType<_ActionCreatorWithPreparedPayload<Prepare>>>;\n  };\n}\n/**\r\n * The type describing a slice's `reducers` option.\r\n *\r\n * @public\r\n */\n\nexport type SliceCaseReducers<State> = Record<string, CaseReducerDefinition<State, PayloadAction<any>> | CaseReducerWithPrepareDefinition<State, PayloadAction<any, string, any, any>> | AsyncThunkSliceReducerDefinition<State, any, any, any>> | Record<string, CaseReducer<State, PayloadAction<any>> | CaseReducerWithPrepare<State, PayloadAction<any, string, any, any>>>;\n/**\r\n * The type describing a slice's `selectors` option.\r\n */\n\nexport type SliceSelectors<State> = {\n  [K: string]: (sliceState: State, ...args: any[]) => any;\n};\ntype SliceActionType<SliceName extends string, ActionName extends keyof any> = ActionName extends string | number ? `${SliceName}/${ActionName}` : string;\n/**\r\n * Derives the slice's `actions` property from the `reducers` options\r\n *\r\n * @public\r\n */\n\nexport type CaseReducerActions<CaseReducers extends SliceCaseReducers<any>, SliceName extends string> = { [Type in keyof CaseReducers]: CaseReducers[Type] extends infer Definition ? Definition extends {\n  prepare: any;\n} ? ActionCreatorForCaseReducerWithPrepare<Definition, SliceActionType<SliceName, Type>> : Definition extends AsyncThunkSliceReducerDefinition<any, infer ThunkArg, infer Returned, infer ThunkApiConfig> ? AsyncThunk<Returned, ThunkArg, ThunkApiConfig> : Definition extends {\n  reducer: any;\n} ? ActionCreatorForCaseReducer<Definition['reducer'], SliceActionType<SliceName, Type>> : ActionCreatorForCaseReducer<Definition, SliceActionType<SliceName, Type>> : never };\n/**\r\n * Get a `PayloadActionCreator` type for a passed `CaseReducerWithPrepare`\r\n *\r\n * @internal\r\n */\n\ntype ActionCreatorForCaseReducerWithPrepare<CR extends {\n  prepare: any;\n}, Type extends string> = _ActionCreatorWithPreparedPayload<CR['prepare'], Type>;\n/**\r\n * Get a `PayloadActionCreator` type for a passed `CaseReducer`\r\n *\r\n * @internal\r\n */\n\ntype ActionCreatorForCaseReducer<CR, Type extends string> = CR extends (state: any, action: infer Action) => any ? Action extends {\n  payload: infer P;\n} ? PayloadActionCreator<P, Type> : ActionCreatorWithoutPayload<Type> : ActionCreatorWithoutPayload<Type>;\n/**\r\n * Extracts the CaseReducers out of a `reducers` object, even if they are\r\n * tested into a `CaseReducerWithPrepare`.\r\n *\r\n * @internal\r\n */\n\ntype SliceDefinedCaseReducers<CaseReducers extends SliceCaseReducers<any>> = { [Type in keyof CaseReducers]: CaseReducers[Type] extends infer Definition ? Definition extends AsyncThunkSliceReducerDefinition<any, any, any, any> ? Id<Pick<Required<Definition>, 'fulfilled' | 'rejected' | 'pending' | 'settled'>> : Definition extends {\n  reducer: infer Reducer;\n} ? Reducer : Definition : never };\ntype RemappedSelector<S extends Selector, NewState> = S extends Selector<any, infer R, infer P> ? Selector<NewState, R, P> & {\n  unwrapped: S;\n} : never;\n/**\r\n * Extracts the final selector type from the `selectors` object.\r\n *\r\n * Removes the `string` index signature from the default value.\r\n */\n\ntype SliceDefinedSelectors<State, Selectors extends SliceSelectors<State>, RootState> = { [K in keyof Selectors as string extends K ? never : K]: RemappedSelector<Selectors[K], RootState> };\n/**\r\n * Used on a SliceCaseReducers object.\r\n * Ensures that if a CaseReducer is a `CaseReducerWithPrepare`, that\r\n * the `reducer` and the `prepare` function use the same type of `payload`.\r\n *\r\n * Might do additional such checks in the future.\r\n *\r\n * This type is only ever useful if you want to write your own wrapper around\r\n * `createSlice`. Please don't use it otherwise!\r\n *\r\n * @public\r\n */\n\nexport type ValidateSliceCaseReducers<S, ACR extends SliceCaseReducers<S>> = ACR & { [T in keyof ACR]: ACR[T] extends {\n  reducer(s: S, action?: infer A): any;\n} ? {\n  prepare(...a: never[]): Omit<A, 'type'>;\n} : {} };\n\nfunction getType(slice: string, actionKey: string): string {\n  return `${slice}/${actionKey}`;\n}\n\ninterface BuildCreateSliceConfig {\n  creators?: {\n    asyncThunk?: typeof asyncThunkCreator;\n  };\n}\nexport function buildCreateSlice({\n  creators\n}: BuildCreateSliceConfig = {}) {\n  const cAT = creators?.asyncThunk?.[asyncThunkSymbol];\n  return function createSlice<State, CaseReducers extends SliceCaseReducers<State>, Name extends string, Selectors extends SliceSelectors<State>, ReducerPath extends string = Name>(options: CreateSliceOptions<State, CaseReducers, Name, ReducerPath, Selectors>): Slice<State, CaseReducers, Name, ReducerPath, Selectors> {\n    const {\n      name,\n      reducerPath = ((name as unknown) as ReducerPath)\n    } = options;\n\n    if (!name) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(11) : '`name` is a required option for createSlice');\n    }\n\n    if (typeof process !== 'undefined' && process.env.NODE_ENV === 'development') {\n      if (options.initialState === undefined) {\n        console.error('You must provide an `initialState` value that is not `undefined`. You may have misspelled `initialState`');\n      }\n    }\n\n    const reducers = (typeof options.reducers === 'function' ? options.reducers(buildReducerCreators<State>()) : options.reducers) || {};\n    const reducerNames = Object.keys(reducers);\n    const context: ReducerHandlingContext<State> = {\n      sliceCaseReducersByName: {},\n      sliceCaseReducersByType: {},\n      actionCreators: {},\n      sliceMatchers: []\n    };\n    const contextMethods: ReducerHandlingContextMethods<State> = {\n      addCase(typeOrActionCreator: string | TypedActionCreator<any>, reducer: CaseReducer<State>) {\n        const type = typeof typeOrActionCreator === 'string' ? typeOrActionCreator : typeOrActionCreator.type;\n\n        if (!type) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage2(12) : '`context.addCase` cannot be called with an empty action type');\n        }\n\n        if (type in context.sliceCaseReducersByType) {\n          throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage3(13) : '`context.addCase` cannot be called with two reducers for the same action type: ' + type);\n        }\n\n        context.sliceCaseReducersByType[type] = reducer;\n        return contextMethods;\n      },\n\n      addMatcher(matcher, reducer) {\n        context.sliceMatchers.push({\n          matcher,\n          reducer\n        });\n        return contextMethods;\n      },\n\n      exposeAction(name, actionCreator) {\n        context.actionCreators[name] = actionCreator;\n        return contextMethods;\n      },\n\n      exposeCaseReducer(name, reducer) {\n        context.sliceCaseReducersByName[name] = reducer;\n        return contextMethods;\n      }\n\n    };\n    reducerNames.forEach(reducerName => {\n      const reducerDefinition = reducers[reducerName];\n      const reducerDetails: ReducerDetails = {\n        reducerName,\n        type: getType(name, reducerName),\n        createNotation: typeof options.reducers === 'function'\n      };\n\n      if (isAsyncThunkSliceReducerDefinition<State>(reducerDefinition)) {\n        handleThunkCaseReducerDefinition(reducerDetails, reducerDefinition, contextMethods, cAT);\n      } else {\n        handleNormalReducerDefinition<State>(reducerDetails, reducerDefinition, contextMethods);\n      }\n    });\n\n    function buildReducer() {\n      if (process.env.NODE_ENV !== 'production') {\n        if (typeof options.extraReducers === 'object') {\n          throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage4(14) : \"The object notation for `createSlice.extraReducers` has been removed. Please use the 'builder callback' notation instead: https://redux-toolkit.js.org/api/createSlice\");\n        }\n      }\n\n      const [extraReducers = {}, actionMatchers = [], defaultCaseReducer = undefined] = typeof options.extraReducers === 'function' ? executeReducerBuilderCallback(options.extraReducers) : [options.extraReducers];\n      const finalCaseReducers = { ...extraReducers,\n        ...context.sliceCaseReducersByType\n      };\n      return createReducer(options.initialState, builder => {\n        for (let key in finalCaseReducers) {\n          builder.addCase(key, (finalCaseReducers[key] as CaseReducer<any>));\n        }\n\n        for (let sM of context.sliceMatchers) {\n          builder.addMatcher(sM.matcher, sM.reducer);\n        }\n\n        for (let m of actionMatchers) {\n          builder.addMatcher(m.matcher, m.reducer);\n        }\n\n        if (defaultCaseReducer) {\n          builder.addDefaultCase(defaultCaseReducer);\n        }\n      });\n    }\n\n    const selectSelf = (state: State) => state;\n\n    const injectedSelectorCache = new Map<boolean, WeakMap<(rootState: any) => State | undefined, Record<string, (rootState: any) => any>>>();\n\n    let _reducer: ReducerWithInitialState<State>;\n\n    function reducer(state: State | undefined, action: UnknownAction) {\n      if (!_reducer) _reducer = buildReducer();\n      return _reducer(state, action);\n    }\n\n    function getInitialState() {\n      if (!_reducer) _reducer = buildReducer();\n      return _reducer.getInitialState();\n    }\n\n    function makeSelectorProps<CurrentReducerPath extends string = ReducerPath>(reducerPath: CurrentReducerPath, injected = false): Pick<Slice<State, CaseReducers, Name, CurrentReducerPath, Selectors>, 'getSelectors' | 'selectors' | 'selectSlice' | 'reducerPath'> {\n      function selectSlice(state: { [K in CurrentReducerPath]: State }) {\n        let sliceState = state[reducerPath];\n\n        if (typeof sliceState === 'undefined') {\n          if (injected) {\n            sliceState = getInitialState();\n          } else if (process.env.NODE_ENV !== 'production') {\n            throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage5(15) : 'selectSlice returned undefined for an uninjected slice reducer');\n          }\n        }\n\n        return sliceState;\n      }\n\n      function getSelectors(selectState: (rootState: any) => State = selectSelf) {\n        const selectorCache = emplace(injectedSelectorCache, injected, {\n          insert: () => new WeakMap()\n        });\n        return (emplace(selectorCache, selectState, {\n          insert: () => {\n            const map: Record<string, Selector<any, any>> = {};\n\n            for (const [name, selector] of Object.entries(options.selectors ?? {})) {\n              map[name] = wrapSelector(selector, selectState, getInitialState, injected);\n            }\n\n            return map;\n          }\n        }) as any);\n      }\n\n      return {\n        reducerPath,\n        getSelectors,\n\n        get selectors() {\n          return getSelectors(selectSlice);\n        },\n\n        selectSlice\n      };\n    }\n\n    const slice: Slice<State, CaseReducers, Name, ReducerPath, Selectors> = {\n      name,\n      reducer,\n      actions: (context.actionCreators as any),\n      caseReducers: (context.sliceCaseReducersByName as any),\n      getInitialState,\n      ...makeSelectorProps(reducerPath),\n\n      injectInto(injectable, {\n        reducerPath: pathOpt,\n        ...config\n      } = {}) {\n        const newReducerPath = pathOpt ?? reducerPath;\n        injectable.inject({\n          reducerPath: newReducerPath,\n          reducer\n        }, config);\n        return ({ ...slice,\n          ...makeSelectorProps(newReducerPath, true)\n        } as any);\n      }\n\n    };\n    return slice;\n  };\n}\n\nfunction wrapSelector<State, NewState, S extends Selector<State>>(selector: S, selectState: Selector<NewState, State>, getInitialState: () => State, injected?: boolean) {\n  function wrapper(rootState: NewState, ...args: any[]) {\n    let sliceState = selectState(rootState);\n\n    if (typeof sliceState === 'undefined') {\n      if (injected) {\n        sliceState = getInitialState();\n      } else if (process.env.NODE_ENV !== 'production') {\n        throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage6(16) : 'selectState returned undefined for an uninjected slice reducer');\n      }\n    }\n\n    return selector(sliceState, ...args);\n  }\n\n  wrapper.unwrapped = selector;\n  return (wrapper as RemappedSelector<S, NewState>);\n}\n/**\r\n * A function that accepts an initial state, an object full of reducer\r\n * functions, and a \"slice name\", and automatically generates\r\n * action creators and action types that correspond to the\r\n * reducers and state.\r\n *\r\n * @public\r\n */\n\n\nexport const createSlice = /* @__PURE__ */buildCreateSlice();\ninterface ReducerHandlingContext<State> {\n  sliceCaseReducersByName: Record<string, CaseReducer<State, any> | Pick<AsyncThunkSliceReducerDefinition<State, any, any, any>, 'fulfilled' | 'rejected' | 'pending' | 'settled'>>;\n  sliceCaseReducersByType: Record<string, CaseReducer<State, any>>;\n  sliceMatchers: ActionMatcherDescriptionCollection<State>;\n  actionCreators: Record<string, Function>;\n}\ninterface ReducerHandlingContextMethods<State> {\n  /**\r\n   * Adds a case reducer to handle a single action type.\r\n   * @param actionCreator - Either a plain action type string, or an action creator generated by [`createAction`](./createAction) that can be used to determine the action type.\r\n   * @param reducer - The actual case reducer function.\r\n   */\n  addCase<ActionCreator extends TypedActionCreator<string>>(actionCreator: ActionCreator, reducer: CaseReducer<State, ReturnType<ActionCreator>>): ReducerHandlingContextMethods<State>;\n  /**\r\n   * Adds a case reducer to handle a single action type.\r\n   * @param actionCreator - Either a plain action type string, or an action creator generated by [`createAction`](./createAction) that can be used to determine the action type.\r\n   * @param reducer - The actual case reducer function.\r\n   */\n\n  addCase<Type extends string, A extends Action<Type>>(type: Type, reducer: CaseReducer<State, A>): ReducerHandlingContextMethods<State>;\n  /**\r\n   * Allows you to match incoming actions against your own filter function instead of only the `action.type` property.\r\n   * @remarks\r\n   * If multiple matcher reducers match, all of them will be executed in the order\r\n   * they were defined in - even if a case reducer already matched.\r\n   * All calls to `builder.addMatcher` must come after any calls to `builder.addCase` and before any calls to `builder.addDefaultCase`.\r\n   * @param matcher - A matcher function. In TypeScript, this should be a [type predicate](https://www.typescriptlang.org/docs/handbook/2/narrowing.html#using-type-predicates)\r\n   *   function\r\n   * @param reducer - The actual case reducer function.\r\n   *\r\n   */\n\n  addMatcher<A>(matcher: TypeGuard<A>, reducer: CaseReducer<State, A extends Action ? A : A & Action>): ReducerHandlingContextMethods<State>;\n  /**\r\n   * Add an action to be exposed under the final `slice.actions` key.\r\n   * @param name The key to be exposed as.\r\n   * @param actionCreator The action to expose.\r\n   * @example\r\n   * context.exposeAction(\"addPost\", createAction<Post>(\"addPost\"));\r\n   *\r\n   * export const { addPost } = slice.actions\r\n   *\r\n   * dispatch(addPost(post))\r\n   */\n\n  exposeAction(name: string, actionCreator: Function): ReducerHandlingContextMethods<State>;\n  /**\r\n   * Add a case reducer to be exposed under the final `slice.caseReducers` key.\r\n   * @param name The key to be exposed as.\r\n   * @param reducer The reducer to expose.\r\n   * @example\r\n   * context.exposeCaseReducer(\"addPost\", (state, action: PayloadAction<Post>) => {\r\n   *   state.push(action.payload)\r\n   * })\r\n   *\r\n   * slice.caseReducers.addPost([], addPost(post))\r\n   */\n\n  exposeCaseReducer(name: string, reducer: CaseReducer<State, any> | Pick<AsyncThunkSliceReducerDefinition<State, any, any, any>, 'fulfilled' | 'rejected' | 'pending' | 'settled'>): ReducerHandlingContextMethods<State>;\n}\ninterface ReducerDetails {\n  /** The key the reducer was defined under */\n  reducerName: string;\n  /** The predefined action type, i.e. `${slice.name}/${reducerName}` */\n\n  type: string;\n  /** Whether create. notation was used when defining reducers */\n\n  createNotation: boolean;\n}\n\nfunction buildReducerCreators<State>(): ReducerCreators<State> {\n  function asyncThunk(payloadCreator: AsyncThunkPayloadCreator<any, any>, config: AsyncThunkSliceReducerConfig<State, any>): AsyncThunkSliceReducerDefinition<State, any> {\n    return {\n      _reducerDefinitionType: ReducerType.asyncThunk,\n      payloadCreator,\n      ...config\n    };\n  }\n\n  asyncThunk.withTypes = () => asyncThunk;\n\n  return {\n    reducer(caseReducer: CaseReducer<State, any>) {\n      return Object.assign({\n        // hack so the wrapping function has the same name as the original\n        // we need to create a wrapper so the `reducerDefinitionType` is not assigned to the original\n        [caseReducer.name](...args: Parameters<typeof caseReducer>) {\n          return caseReducer(...args);\n        }\n\n      }[caseReducer.name], ({\n        _reducerDefinitionType: ReducerType.reducer\n      } as const));\n    },\n\n    preparedReducer(prepare, reducer) {\n      return {\n        _reducerDefinitionType: ReducerType.reducerWithPrepare,\n        prepare,\n        reducer\n      };\n    },\n\n    asyncThunk: (asyncThunk as any)\n  };\n}\n\nfunction handleNormalReducerDefinition<State>({\n  type,\n  reducerName,\n  createNotation\n}: ReducerDetails, maybeReducerWithPrepare: CaseReducer<State, {\n  payload: any;\n  type: string;\n}> | CaseReducerWithPrepare<State, PayloadAction<any, string, any, any>>, context: ReducerHandlingContextMethods<State>) {\n  let caseReducer: CaseReducer<State, any>;\n  let prepareCallback: PrepareAction<any> | undefined;\n\n  if ('reducer' in maybeReducerWithPrepare) {\n    if (createNotation && !isCaseReducerWithPrepareDefinition(maybeReducerWithPrepare)) {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage7(17) : 'Please use the `create.preparedReducer` notation for prepared action creators with the `create` notation.');\n    }\n\n    caseReducer = maybeReducerWithPrepare.reducer;\n    prepareCallback = maybeReducerWithPrepare.prepare;\n  } else {\n    caseReducer = maybeReducerWithPrepare;\n  }\n\n  context.addCase(type, caseReducer).exposeCaseReducer(reducerName, caseReducer).exposeAction(reducerName, prepareCallback ? createAction(type, prepareCallback) : createAction(type));\n}\n\nfunction isAsyncThunkSliceReducerDefinition<State>(reducerDefinition: any): reducerDefinition is AsyncThunkSliceReducerDefinition<State, any, any, any> {\n  return reducerDefinition._reducerDefinitionType === ReducerType.asyncThunk;\n}\n\nfunction isCaseReducerWithPrepareDefinition<State>(reducerDefinition: any): reducerDefinition is CaseReducerWithPrepareDefinition<State, any> {\n  return reducerDefinition._reducerDefinitionType === ReducerType.reducerWithPrepare;\n}\n\nfunction handleThunkCaseReducerDefinition<State>({\n  type,\n  reducerName\n}: ReducerDetails, reducerDefinition: AsyncThunkSliceReducerDefinition<State, any, any, any>, context: ReducerHandlingContextMethods<State>, cAT: typeof _createAsyncThunk | undefined) {\n  if (!cAT) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage8(18) : 'Cannot use `create.asyncThunk` in the built-in `createSlice`. ' + 'Use `buildCreateSlice({ creators: { asyncThunk: asyncThunkCreator } })` to create a customised version of `createSlice`.');\n  }\n\n  const {\n    payloadCreator,\n    fulfilled,\n    pending,\n    rejected,\n    settled,\n    options\n  } = reducerDefinition;\n  const thunk = cAT(type, payloadCreator, (options as any));\n  context.exposeAction(reducerName, thunk);\n\n  if (fulfilled) {\n    context.addCase(thunk.fulfilled, fulfilled);\n  }\n\n  if (pending) {\n    context.addCase(thunk.pending, pending);\n  }\n\n  if (rejected) {\n    context.addCase(thunk.rejected, rejected);\n  }\n\n  if (settled) {\n    context.addMatcher(thunk.settled, settled);\n  }\n\n  context.exposeCaseReducer(reducerName, {\n    fulfilled: fulfilled || noop,\n    pending: pending || noop,\n    rejected: rejected || noop,\n    settled: settled || noop\n  });\n}\n\nfunction noop() {}","import { formatProdErrorMessage as _formatProdErrorMessage2 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport type { Draft } from 'immer';\nimport { produce as createNextState, isDraft, isDraftable } from 'immer';\nimport type { Action, Reducer, UnknownAction } from 'redux';\nimport type { ActionReducerMapBuilder } from './mapBuilders';\nimport { executeReducerBuilderCallback } from './mapBuilders';\nimport type { NoInfer, TypeGuard } from './tsHelpers';\nimport { freezeDraftable } from './utils';\n/**\r\n * Defines a mapping from action types to corresponding action object shapes.\r\n *\r\n * @deprecated This should not be used manually - it is only used for internal\r\n *             inference purposes and should not have any further value.\r\n *             It might be removed in the future.\r\n * @public\r\n */\n\nexport type Actions<T extends keyof any = string> = Record<T, Action>;\nexport type ActionMatcherDescription<S, A extends Action> = {\n  matcher: TypeGuard<A>;\n  reducer: CaseReducer<S, NoInfer<A>>;\n};\nexport type ReadonlyActionMatcherDescriptionCollection<S> = ReadonlyArray<ActionMatcherDescription<S, any>>;\nexport type ActionMatcherDescriptionCollection<S> = Array<ActionMatcherDescription<S, any>>;\n/**\r\n * A *case reducer* is a reducer function for a specific action type. Case\r\n * reducers can be composed to full reducers using `createReducer()`.\r\n *\r\n * Unlike a normal Redux reducer, a case reducer is never called with an\r\n * `undefined` state to determine the initial state. Instead, the initial\r\n * state is explicitly specified as an argument to `createReducer()`.\r\n *\r\n * In addition, a case reducer can choose to mutate the passed-in `state`\r\n * value directly instead of returning a new state. This does not actually\r\n * cause the store state to be mutated directly; instead, thanks to\r\n * [immer](https://github.com/mweststrate/immer), the mutations are\r\n * translated to copy operations that result in a new state.\r\n *\r\n * @public\r\n */\n\nexport type CaseReducer<S = any, A extends Action = UnknownAction> = (state: Draft<S>, action: A) => NoInfer<S> | void | Draft<NoInfer<S>>;\n/**\r\n * A mapping from action types to case reducers for `createReducer()`.\r\n *\r\n * @deprecated This should not be used manually - it is only used\r\n *             for internal inference purposes and using it manually\r\n *             would lead to type erasure.\r\n *             It might be removed in the future.\r\n * @public\r\n */\n\nexport type CaseReducers<S, AS extends Actions> = { [T in keyof AS]: AS[T] extends Action ? CaseReducer<S, AS[T]> : void };\nexport type NotFunction<T> = T extends Function ? never : T;\n\nfunction isStateFunction<S>(x: unknown): x is () => S {\n  return typeof x === 'function';\n}\n\nexport type ReducerWithInitialState<S extends NotFunction<any>> = Reducer<S> & {\n  getInitialState: () => S;\n};\n/**\r\n * A utility function that allows defining a reducer as a mapping from action\r\n * type to *case reducer* functions that handle these action types. The\r\n * reducer's initial state is passed as the first argument.\r\n *\r\n * @remarks\r\n * The body of every case reducer is implicitly wrapped with a call to\r\n * `produce()` from the [immer](https://github.com/mweststrate/immer) library.\r\n * This means that rather than returning a new state object, you can also\r\n * mutate the passed-in state object directly; these mutations will then be\r\n * automatically and efficiently translated into copies, giving you both\r\n * convenience and immutability.\r\n *\r\n * @overloadSummary\r\n * This function accepts a callback that receives a `builder` object as its argument.\r\n * That builder provides `addCase`, `addMatcher` and `addDefaultCase` functions that may be\r\n * called to define what actions this reducer will handle.\r\n *\r\n * @param initialState - `State | (() => State)`: The initial state that should be used when the reducer is called the first time. This may also be a \"lazy initializer\" function, which should return an initial state value when called. This will be used whenever the reducer is called with `undefined` as its state value, and is primarily useful for cases like reading initial state from `localStorage`.\r\n * @param builderCallback - `(builder: Builder) => void` A callback that receives a *builder* object to define\r\n *   case reducers via calls to `builder.addCase(actionCreatorOrType, reducer)`.\r\n * @example\r\n```ts\r\nimport {\r\n  createAction,\r\n  createReducer,\r\n  UnknownAction,\r\n  PayloadAction,\r\n} from \"@reduxjs/toolkit\";\r\n\r\nconst increment = createAction<number>(\"increment\");\r\nconst decrement = createAction<number>(\"decrement\");\r\n\r\nfunction isActionWithNumberPayload(\r\n  action: UnknownAction\r\n): action is PayloadAction<number> {\r\n  return typeof action.payload === \"number\";\r\n}\r\n\r\nconst reducer = createReducer(\r\n  {\r\n    counter: 0,\r\n    sumOfNumberPayloads: 0,\r\n    unhandledActions: 0,\r\n  },\r\n  (builder) => {\r\n    builder\r\n      .addCase(increment, (state, action) => {\r\n        // action is inferred correctly here\r\n        state.counter += action.payload;\r\n      })\r\n      // You can chain calls, or have separate `builder.addCase()` lines each time\r\n      .addCase(decrement, (state, action) => {\r\n        state.counter -= action.payload;\r\n      })\r\n      // You can apply a \"matcher function\" to incoming actions\r\n      .addMatcher(isActionWithNumberPayload, (state, action) => {})\r\n      // and provide a default case if no other handlers matched\r\n      .addDefaultCase((state, action) => {});\r\n  }\r\n);\r\n```\r\n * @public\r\n */\n\nexport function createReducer<S extends NotFunction<any>>(initialState: S | (() => S), mapOrBuilderCallback: (builder: ActionReducerMapBuilder<S>) => void): ReducerWithInitialState<S> {\n  if (process.env.NODE_ENV !== 'production') {\n    if (typeof mapOrBuilderCallback === 'object') {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(8) : \"The object notation for `createReducer` has been removed. Please use the 'builder callback' notation instead: https://redux-toolkit.js.org/api/createReducer\");\n    }\n  }\n\n  let [actionsMap, finalActionMatchers, finalDefaultCaseReducer] = executeReducerBuilderCallback(mapOrBuilderCallback); // Ensure the initial state gets frozen either way (if draftable)\n\n  let getInitialState: () => S;\n\n  if (isStateFunction(initialState)) {\n    getInitialState = () => freezeDraftable(initialState());\n  } else {\n    const frozenInitialState = freezeDraftable(initialState);\n\n    getInitialState = () => frozenInitialState;\n  }\n\n  function reducer(state = getInitialState(), action: any): S {\n    let caseReducers = [actionsMap[action.type], ...finalActionMatchers.filter(({\n      matcher\n    }) => matcher(action)).map(({\n      reducer\n    }) => reducer)];\n\n    if (caseReducers.filter(cr => !!cr).length === 0) {\n      caseReducers = [finalDefaultCaseReducer];\n    }\n\n    return caseReducers.reduce((previousState, caseReducer): S => {\n      if (caseReducer) {\n        if (isDraft(previousState)) {\n          // If it's already a draft, we must already be inside a `createNextState` call,\n          // likely because this is being wrapped in `createReducer`, `createSlice`, or nested\n          // inside an existing draft. It's safe to just pass the draft to the mutator.\n          const draft = (previousState as Draft<S>); // We can assume this is already a draft\n\n          const result = caseReducer(draft, action);\n\n          if (result === undefined) {\n            return previousState;\n          }\n\n          return (result as S);\n        } else if (!isDraftable(previousState)) {\n          // If state is not draftable (ex: a primitive, such as 0), we want to directly\n          // return the caseReducer func and not wrap it with produce.\n          const result = caseReducer((previousState as any), action);\n\n          if (result === undefined) {\n            if (previousState === null) {\n              return previousState;\n            }\n\n            throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage2(9) : 'A case reducer on a non-draftable value must not return undefined');\n          }\n\n          return (result as S);\n        } else {\n          // @ts-ignore createNextState() produces an Immutable<Draft<S>> rather\n          // than an Immutable<S>, and TypeScript cannot find out how to reconcile\n          // these two types.\n          return createNextState(previousState, (draft: Draft<S>) => {\n            return caseReducer(draft, action);\n          });\n        }\n      }\n\n      return previousState;\n    }, state);\n  }\n\n  reducer.getInitialState = getInitialState;\n  return (reducer as ReducerWithInitialState<S>);\n}","import type { SerializedError } from '@reduxjs/toolkit';\nconst task = 'task';\nconst listener = 'listener';\nconst completed = 'completed';\nconst cancelled = 'cancelled';\n/* TaskAbortError error codes  */\n\nexport const taskCancelled = (`task-${cancelled}` as const);\nexport const taskCompleted = (`task-${completed}` as const);\nexport const listenerCancelled = (`${listener}-${cancelled}` as const);\nexport const listenerCompleted = (`${listener}-${completed}` as const);\nexport class TaskAbortError implements SerializedError {\n  name = 'TaskAbortError';\n  message: string;\n\n  constructor(public code: string | undefined) {\n    this.message = `${task} ${cancelled} (reason: ${code})`;\n  }\n\n}","import { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport type { AbortSignalWithReason } from './types';\nexport const assertFunction: (func: unknown, expected: string) => asserts func is (...args: unknown[]) => unknown = (func: unknown, expected: string) => {\n  if (typeof func !== 'function') {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(32) : `${expected} is not a function`);\n  }\n};\nexport const noop = () => {};\nexport const catchRejection = <T,>(promise: Promise<T>, onError = noop): Promise<T> => {\n  promise.catch(onError);\n  return promise;\n};\nexport const addAbortSignalListener = (abortSignal: AbortSignal, callback: (evt: Event) => void) => {\n  abortSignal.addEventListener('abort', callback, {\n    once: true\n  });\n  return () => abortSignal.removeEventListener('abort', callback);\n};\n/**\r\n * Calls `abortController.abort(reason)` and patches `signal.reason`.\r\n * if it is not supported.\r\n *\r\n * At the time of writing `signal.reason` is available in FF chrome, edge node 17 and deno.\r\n * @param abortController\r\n * @param reason\r\n * @returns\r\n * @see https://developer.mozilla.org/en-US/docs/Web/API/AbortSignal/reason\r\n */\n\nexport const abortControllerWithReason = <T,>(abortController: AbortController, reason: T): void => {\n  type Consumer<T> = (val: T) => void;\n  const signal = (abortController.signal as AbortSignalWithReason<T>);\n\n  if (signal.aborted) {\n    return;\n  } // Patch `reason` if necessary.\n  // - We use defineProperty here because reason is a getter of `AbortSignal.__proto__`.\n  // - We need to patch 'reason' before calling `.abort()` because listeners to the 'abort'\n  // event are are notified immediately.\n\n\n  if (!('reason' in signal)) {\n    Object.defineProperty(signal, 'reason', {\n      enumerable: true,\n      value: reason,\n      configurable: true,\n      writable: true\n    });\n  }\n\n  ;\n  (abortController.abort as Consumer<typeof reason>)(reason);\n};","import { TaskAbortError } from './exceptions';\nimport type { AbortSignalWithReason, TaskResult } from './types';\nimport { addAbortSignalListener, catchRejection, noop } from './utils';\n/**\r\n * Synchronously raises {@link TaskAbortError} if the task tied to the input `signal` has been cancelled.\r\n * @param signal\r\n * @param reason\r\n * @see {TaskAbortError}\r\n */\n\nexport const validateActive = (signal: AbortSignal): void => {\n  if (signal.aborted) {\n    const {\n      reason\n    } = (signal as AbortSignalWithReason<string>);\n    throw new TaskAbortError(reason);\n  }\n};\n/**\r\n * Generates a race between the promise(s) and the AbortSignal\r\n * This avoids `Promise.race()`-related memory leaks:\r\n * https://github.com/nodejs/node/issues/17469#issuecomment-349794909\r\n */\n\nexport function raceWithSignal<T>(signal: AbortSignalWithReason<string>, promise: Promise<T>): Promise<T> {\n  let cleanup = noop;\n  return new Promise<T>((resolve, reject) => {\n    const notifyRejection = () => reject(new TaskAbortError(signal.reason));\n\n    if (signal.aborted) {\n      notifyRejection();\n      return;\n    }\n\n    cleanup = addAbortSignalListener(signal, notifyRejection);\n    promise.finally(() => cleanup()).then(resolve, reject);\n  }).finally(() => {\n    // after this point, replace `cleanup` with a noop, so there is no reference to `signal` any more\n    cleanup = noop;\n  });\n}\n/**\r\n * Runs a task and returns promise that resolves to {@link TaskResult}.\r\n * Second argument is an optional `cleanUp` function that always runs after task.\r\n *\r\n * **Note:** `runTask` runs the executor in the next microtask.\r\n * @returns\r\n */\n\nexport const runTask = async <T,>(task: () => Promise<T>, cleanUp?: () => void): Promise<TaskResult<T>> => {\n  try {\n    await Promise.resolve();\n    const value = await task();\n    return {\n      status: 'ok',\n      value\n    };\n  } catch (error: any) {\n    return {\n      status: error instanceof TaskAbortError ? 'cancelled' : 'rejected',\n      error\n    };\n  } finally {\n    cleanUp?.();\n  }\n};\n/**\r\n * Given an input `AbortSignal` and a promise returns another promise that resolves\r\n * as soon the input promise is provided or rejects as soon as\r\n * `AbortSignal.abort` is `true`.\r\n * @param signal\r\n * @returns\r\n */\n\nexport const createPause = <T,>(signal: AbortSignal) => {\n  return (promise: Promise<T>): Promise<T> => {\n    return catchRejection(raceWithSignal(signal, promise).then(output => {\n      validateActive(signal);\n      return output;\n    }));\n  };\n};\n/**\r\n * Given an input `AbortSignal` and `timeoutMs` returns a promise that resolves\r\n * after `timeoutMs` or rejects as soon as `AbortSignal.abort` is `true`.\r\n * @param signal\r\n * @returns\r\n */\n\nexport const createDelay = (signal: AbortSignal) => {\n  const pause = createPause<void>(signal);\n  return (timeoutMs: number): Promise<void> => {\n    return pause(new Promise<void>(resolve => setTimeout(resolve, timeoutMs)));\n  };\n};","import { formatProdErrorMessage as _formatProdErrorMessage3 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage2 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport type { Action, Dispatch, MiddlewareAPI, UnknownAction } from 'redux';\nimport { isAction } from 'redux';\nimport type { ThunkDispatch } from 'redux-thunk';\nimport { createAction } from '../createAction';\nimport { nanoid } from '../nanoid';\nimport { find } from '../utils';\nimport { TaskAbortError, listenerCancelled, listenerCompleted, taskCancelled, taskCompleted } from './exceptions';\nimport { createDelay, createPause, raceWithSignal, runTask, validateActive } from './task';\nimport type { AbortSignalWithReason, AddListenerOverloads, AnyListenerPredicate, CreateListenerMiddlewareOptions, FallbackAddListenerOptions, ForkOptions, ForkedTask, ForkedTaskExecutor, ListenerEntry, ListenerErrorHandler, ListenerErrorInfo, ListenerMiddleware, ListenerMiddlewareInstance, TakePattern, TaskResult, TypedAddListener, TypedCreateListenerEntry, TypedRemoveListener, UnsubscribeListener, UnsubscribeListenerOptions } from './types';\nimport { abortControllerWithReason, addAbortSignalListener, assertFunction, catchRejection, noop } from './utils';\nexport { TaskAbortError } from './exceptions';\nexport type { AsyncTaskExecutor, CreateListenerMiddlewareOptions, ForkedTask, ForkedTaskAPI, ForkedTaskExecutor, ListenerEffect, ListenerEffectAPI, ListenerErrorHandler, ListenerMiddleware, ListenerMiddlewareInstance, SyncTaskExecutor, TaskCancelled, TaskRejected, TaskResolved, TaskResult, TypedAddListener, TypedRemoveListener, TypedStartListening, TypedStopListening, UnsubscribeListener, UnsubscribeListenerOptions } from './types'; //Overly-aggressive byte-shaving\n\nconst {\n  assign\n} = Object;\n/**\r\n * @internal\r\n */\n\nconst INTERNAL_NIL_TOKEN = ({} as const);\nconst alm = ('listenerMiddleware' as const);\n\nconst createFork = (parentAbortSignal: AbortSignalWithReason<unknown>, parentBlockingPromises: Promise<any>[]) => {\n  const linkControllers = (controller: AbortController) => addAbortSignalListener(parentAbortSignal, () => abortControllerWithReason(controller, parentAbortSignal.reason));\n\n  return <T,>(taskExecutor: ForkedTaskExecutor<T>, opts?: ForkOptions): ForkedTask<T> => {\n    assertFunction(taskExecutor, 'taskExecutor');\n    const childAbortController = new AbortController();\n    linkControllers(childAbortController);\n    const result = runTask<T>(async (): Promise<T> => {\n      validateActive(parentAbortSignal);\n      validateActive(childAbortController.signal);\n      const result = (await taskExecutor({\n        pause: createPause(childAbortController.signal),\n        delay: createDelay(childAbortController.signal),\n        signal: childAbortController.signal\n      }) as T);\n      validateActive(childAbortController.signal);\n      return result;\n    }, () => abortControllerWithReason(childAbortController, taskCompleted));\n\n    if (opts?.autoJoin) {\n      parentBlockingPromises.push(result.catch(noop));\n    }\n\n    return {\n      result: createPause<TaskResult<T>>(parentAbortSignal)(result),\n\n      cancel() {\n        abortControllerWithReason(childAbortController, taskCancelled);\n      }\n\n    };\n  };\n};\n\nconst createTakePattern = <S,>(startListening: AddListenerOverloads<UnsubscribeListener, S, Dispatch>, signal: AbortSignal): TakePattern<S> => {\n  /**\r\n   * A function that takes a ListenerPredicate and an optional timeout,\r\n   * and resolves when either the predicate returns `true` based on an action\r\n   * state combination or when the timeout expires.\r\n   * If the parent listener is canceled while waiting, this will throw a\r\n   * TaskAbortError.\r\n   */\n  const take = async <P extends AnyListenerPredicate<S>,>(predicate: P, timeout: number | undefined) => {\n    validateActive(signal); // Placeholder unsubscribe function until the listener is added\n\n    let unsubscribe: UnsubscribeListener = () => {};\n\n    const tuplePromise = new Promise<[Action, S, S]>((resolve, reject) => {\n      // Inside the Promise, we synchronously add the listener.\n      let stopListening = startListening({\n        predicate: (predicate as any),\n        effect: (action, listenerApi): void => {\n          // One-shot listener that cleans up as soon as the predicate passes\n          listenerApi.unsubscribe(); // Resolve the promise with the same arguments the predicate saw\n\n          resolve([action, listenerApi.getState(), listenerApi.getOriginalState()]);\n        }\n      });\n\n      unsubscribe = () => {\n        stopListening();\n        reject();\n      };\n    });\n    const promises: (Promise<null> | Promise<[Action, S, S]>)[] = [tuplePromise];\n\n    if (timeout != null) {\n      promises.push(new Promise<null>(resolve => setTimeout(resolve, timeout, null)));\n    }\n\n    try {\n      const output = await raceWithSignal(signal, Promise.race(promises));\n      validateActive(signal);\n      return output;\n    } finally {\n      // Always clean up the listener\n      unsubscribe();\n    }\n  };\n\n  return (((predicate: AnyListenerPredicate<S>, timeout: number | undefined) => catchRejection(take(predicate, timeout))) as TakePattern<S>);\n};\n\nconst getListenerEntryPropsFrom = (options: FallbackAddListenerOptions) => {\n  let {\n    type,\n    actionCreator,\n    matcher,\n    predicate,\n    effect\n  } = options;\n\n  if (type) {\n    predicate = createAction(type).match;\n  } else if (actionCreator) {\n    type = actionCreator!.type;\n    predicate = actionCreator.match;\n  } else if (matcher) {\n    predicate = matcher;\n  } else if (predicate) {// pass\n  } else {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(21) : 'Creating or removing a listener requires one of the known fields for matching an action');\n  }\n\n  assertFunction(effect, 'options.listener');\n  return {\n    predicate,\n    type,\n    effect\n  };\n};\n/** Accepts the possible options for creating a listener, and returns a formatted listener entry */\n\n\nexport const createListenerEntry: TypedCreateListenerEntry<unknown> = ((Object.assign((options: FallbackAddListenerOptions) => {\n  const {\n    type,\n    predicate,\n    effect\n  } = getListenerEntryPropsFrom(options);\n  const id = nanoid();\n  const entry: ListenerEntry<unknown> = {\n    id,\n    effect,\n    type,\n    predicate,\n    pending: new Set<AbortController>(),\n    unsubscribe: () => {\n      throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage2(22) : 'Unsubscribe not initialized');\n    }\n  };\n  return entry;\n}, {\n  withTypes: () => createListenerEntry\n}) as unknown) as TypedCreateListenerEntry<unknown>);\n\nconst cancelActiveListeners = (entry: ListenerEntry<unknown, Dispatch<UnknownAction>>) => {\n  entry.pending.forEach(controller => {\n    abortControllerWithReason(controller, listenerCancelled);\n  });\n};\n\nconst createClearListenerMiddleware = (listenerMap: Map<string, ListenerEntry>) => {\n  return () => {\n    listenerMap.forEach(cancelActiveListeners);\n    listenerMap.clear();\n  };\n};\n/**\r\n * Safely reports errors to the `errorHandler` provided.\r\n * Errors that occur inside `errorHandler` are notified in a new task.\r\n * Inspired by [rxjs reportUnhandledError](https://github.com/ReactiveX/rxjs/blob/6fafcf53dc9e557439b25debaeadfd224b245a66/src/internal/util/reportUnhandledError.ts)\r\n * @param errorHandler\r\n * @param errorToNotify\r\n */\n\n\nconst safelyNotifyError = (errorHandler: ListenerErrorHandler, errorToNotify: unknown, errorInfo: ListenerErrorInfo): void => {\n  try {\n    errorHandler(errorToNotify, errorInfo);\n  } catch (errorHandlerError) {\n    // We cannot let an error raised here block the listener queue.\n    // The error raised here will be picked up by `window.onerror`, `process.on('error')` etc...\n    setTimeout(() => {\n      throw errorHandlerError;\n    }, 0);\n  }\n};\n/**\r\n * @public\r\n */\n\n\nexport const addListener = ((Object.assign(createAction(`${alm}/add`), {\n  withTypes: () => addListener\n}) as unknown) as TypedAddListener<unknown>);\n/**\r\n * @public\r\n */\n\nexport const clearAllListeners = createAction(`${alm}/removeAll`);\n/**\r\n * @public\r\n */\n\nexport const removeListener = ((Object.assign(createAction(`${alm}/remove`), {\n  withTypes: () => removeListener\n}) as unknown) as TypedRemoveListener<unknown>);\n\nconst defaultErrorHandler: ListenerErrorHandler = (...args: unknown[]) => {\n  console.error(`${alm}/error`, ...args);\n};\n/**\r\n * @public\r\n */\n\n\nexport const createListenerMiddleware = <StateType = unknown, DispatchType extends Dispatch<Action> = ThunkDispatch<StateType, unknown, UnknownAction>, ExtraArgument = unknown>(middlewareOptions: CreateListenerMiddlewareOptions<ExtraArgument> = {}) => {\n  const listenerMap = new Map<string, ListenerEntry>();\n  const {\n    extra,\n    onError = defaultErrorHandler\n  } = middlewareOptions;\n  assertFunction(onError, 'onError');\n\n  const insertEntry = (entry: ListenerEntry) => {\n    entry.unsubscribe = () => listenerMap.delete(entry!.id);\n\n    listenerMap.set(entry.id, entry);\n    return (cancelOptions?: UnsubscribeListenerOptions) => {\n      entry.unsubscribe();\n\n      if (cancelOptions?.cancelActive) {\n        cancelActiveListeners(entry);\n      }\n    };\n  };\n\n  const startListening = (((options: FallbackAddListenerOptions) => {\n    let entry = find(Array.from(listenerMap.values()), existingEntry => existingEntry.effect === options.effect);\n\n    if (!entry) {\n      entry = createListenerEntry((options as any));\n    }\n\n    return insertEntry(entry);\n  }) as AddListenerOverloads<any>);\n  Object.assign(startListening, {\n    withTypes: () => startListening\n  });\n\n  const stopListening = (options: FallbackAddListenerOptions & UnsubscribeListenerOptions): boolean => {\n    const {\n      type,\n      effect,\n      predicate\n    } = getListenerEntryPropsFrom(options);\n    const entry = find(Array.from(listenerMap.values()), entry => {\n      const matchPredicateOrType = typeof type === 'string' ? entry.type === type : entry.predicate === predicate;\n      return matchPredicateOrType && entry.effect === effect;\n    });\n\n    if (entry) {\n      entry.unsubscribe();\n\n      if (options.cancelActive) {\n        cancelActiveListeners(entry);\n      }\n    }\n\n    return !!entry;\n  };\n\n  Object.assign(stopListening, {\n    withTypes: () => stopListening\n  });\n\n  const notifyListener = async (entry: ListenerEntry<unknown, Dispatch<UnknownAction>>, action: unknown, api: MiddlewareAPI, getOriginalState: () => StateType) => {\n    const internalTaskController = new AbortController();\n    const take = createTakePattern((startListening as AddListenerOverloads<any>), internalTaskController.signal);\n    const autoJoinPromises: Promise<any>[] = [];\n\n    try {\n      entry.pending.add(internalTaskController);\n      await Promise.resolve(entry.effect(action, // Use assign() rather than ... to avoid extra helper functions added to bundle\n      assign({}, api, {\n        getOriginalState,\n        condition: (predicate: AnyListenerPredicate<any>, timeout?: number) => take(predicate, timeout).then(Boolean),\n        take,\n        delay: createDelay(internalTaskController.signal),\n        pause: createPause<any>(internalTaskController.signal),\n        extra,\n        signal: internalTaskController.signal,\n        fork: createFork(internalTaskController.signal, autoJoinPromises),\n        unsubscribe: entry.unsubscribe,\n        subscribe: () => {\n          listenerMap.set(entry.id, entry);\n        },\n        cancelActiveListeners: () => {\n          entry.pending.forEach((controller, _, set) => {\n            if (controller !== internalTaskController) {\n              abortControllerWithReason(controller, listenerCancelled);\n              set.delete(controller);\n            }\n          });\n        },\n        cancel: () => {\n          abortControllerWithReason(internalTaskController, listenerCancelled);\n          entry.pending.delete(internalTaskController);\n        },\n        throwIfCancelled: () => {\n          validateActive(internalTaskController.signal);\n        }\n      })));\n    } catch (listenerError) {\n      if (!(listenerError instanceof TaskAbortError)) {\n        safelyNotifyError(onError, listenerError, {\n          raisedBy: 'effect'\n        });\n      }\n    } finally {\n      await Promise.all(autoJoinPromises);\n      abortControllerWithReason(internalTaskController, listenerCompleted); // Notify that the task has completed\n\n      entry.pending.delete(internalTaskController);\n    }\n  };\n\n  const clearListenerMiddleware = createClearListenerMiddleware(listenerMap);\n\n  const middleware: ListenerMiddleware<StateType, DispatchType, ExtraArgument> = api => next => action => {\n    if (!isAction(action)) {\n      // we only want to notify listeners for action objects\n      return next(action);\n    }\n\n    if (addListener.match(action)) {\n      return startListening((action.payload as any));\n    }\n\n    if (clearAllListeners.match(action)) {\n      clearListenerMiddleware();\n      return;\n    }\n\n    if (removeListener.match(action)) {\n      return stopListening(action.payload);\n    } // Need to get this state _before_ the reducer processes the action\n\n\n    let originalState: StateType | typeof INTERNAL_NIL_TOKEN = api.getState(); // `getOriginalState` can only be called synchronously.\n    // @see https://github.com/reduxjs/redux-toolkit/discussions/1648#discussioncomment-1932820\n\n    const getOriginalState = (): StateType => {\n      if (originalState === INTERNAL_NIL_TOKEN) {\n        throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage3(23) : `${alm}: getOriginalState can only be called synchronously`);\n      }\n\n      return (originalState as StateType);\n    };\n\n    let result: unknown;\n\n    try {\n      // Actually forward the action to the reducer before we handle listeners\n      result = next(action);\n\n      if (listenerMap.size > 0) {\n        const currentState = api.getState(); // Work around ESBuild+TS transpilation issue\n\n        const listenerEntries = Array.from(listenerMap.values());\n\n        for (const entry of listenerEntries) {\n          let runListener = false;\n\n          try {\n            runListener = entry.predicate(action, currentState, originalState);\n          } catch (predicateError) {\n            runListener = false;\n            safelyNotifyError(onError, predicateError, {\n              raisedBy: 'predicate'\n            });\n          }\n\n          if (!runListener) {\n            continue;\n          }\n\n          notifyListener(entry, action, api, getOriginalState);\n        }\n      }\n    } finally {\n      // Remove `originalState` store from this scope.\n      originalState = INTERNAL_NIL_TOKEN;\n    }\n\n    return result;\n  };\n\n  return ({\n    middleware,\n    startListening,\n    stopListening,\n    clearListeners: clearListenerMiddleware\n  } as ListenerMiddlewareInstance<StateType, DispatchType, ExtraArgument>);\n};","import { formatProdErrorMessage as _formatProdErrorMessage2 } from \"@reduxjs/toolkit\";\nimport { formatProdErrorMessage as _formatProdErrorMessage } from \"@reduxjs/toolkit\";\nimport type { UnknownAction, Reducer, StateFromReducersMapObject } from 'redux';\nimport { combineReducers } from 'redux';\nimport { nanoid } from './nanoid';\nimport type { Id, NonUndefined, Tail, UnionToIntersection, WithOptionalProp } from './tsHelpers';\nimport { emplace } from './utils';\ntype SliceLike<ReducerPath extends string, State> = {\n  reducerPath: ReducerPath;\n  reducer: Reducer<State>;\n};\ntype AnySliceLike = SliceLike<string, any>;\ntype SliceLikeReducerPath<A extends AnySliceLike> = A extends SliceLike<infer ReducerPath, any> ? ReducerPath : never;\ntype SliceLikeState<A extends AnySliceLike> = A extends SliceLike<any, infer State> ? State : never;\nexport type WithSlice<A extends AnySliceLike> = { [Path in SliceLikeReducerPath<A>]: SliceLikeState<A> };\ntype ReducerMap = Record<string, Reducer>;\ntype ExistingSliceLike<DeclaredState> = { [ReducerPath in keyof DeclaredState]: SliceLike<ReducerPath & string, NonUndefined<DeclaredState[ReducerPath]>> }[keyof DeclaredState];\nexport type InjectConfig = {\n  /**\r\n   * Allow replacing reducer with a different reference. Normally, an error will be thrown if a different reducer instance to the one already injected is used.\r\n   */\n  overrideExisting?: boolean;\n};\n/**\r\n * A reducer that allows for slices/reducers to be injected after initialisation.\r\n */\n\nexport interface CombinedSliceReducer<InitialState, DeclaredState = InitialState> extends Reducer<DeclaredState, UnknownAction, Partial<DeclaredState>> {\n  /**\r\n   * Provide a type for slices that will be injected lazily.\r\n   *\r\n   * One way to do this would be with interface merging:\r\n   * ```ts\r\n   *\r\n   * export interface LazyLoadedSlices {}\r\n   *\r\n   * export const rootReducer = combineSlices(stringSlice).withLazyLoadedSlices<LazyLoadedSlices>();\r\n   *\r\n   * // elsewhere\r\n   *\r\n   * declare module './reducer' {\r\n   *   export interface LazyLoadedSlices extends WithSlice<typeof booleanSlice> {}\r\n   * }\r\n   *\r\n   * const withBoolean = rootReducer.inject(booleanSlice);\r\n   *\r\n   * // elsewhere again\r\n   *\r\n   * declare module './reducer' {\r\n   *   export interface LazyLoadedSlices {\r\n   *     customName: CustomState\r\n   *   }\r\n   * }\r\n   *\r\n   * const withCustom = rootReducer.inject({ reducerPath: \"customName\", reducer: customSlice.reducer })\r\n   * ```\r\n   */\n  withLazyLoadedSlices<Lazy = {}>(): CombinedSliceReducer<InitialState, Id<DeclaredState & Partial<Lazy>>>;\n  /**\r\n   * Inject a slice.\r\n   *\r\n   * Accepts an individual slice, RTKQ API instance, or a \"slice-like\" { reducerPath, reducer } object.\r\n   *\r\n   * ```ts\r\n   * rootReducer.inject(booleanSlice)\r\n   * rootReducer.inject(baseApi)\r\n   * rootReducer.inject({ reducerPath: 'boolean' as const, reducer: newReducer }, { overrideExisting: true })\r\n   * ```\r\n   *\r\n   */\n\n  inject<Sl extends Id<ExistingSliceLike<DeclaredState>>>(slice: Sl, config?: InjectConfig): CombinedSliceReducer<InitialState, Id<DeclaredState & WithSlice<Sl>>>;\n  /**\r\n   * Inject a slice.\r\n   *\r\n   * Accepts an individual slice, RTKQ API instance, or a \"slice-like\" { reducerPath, reducer } object.\r\n   *\r\n   * ```ts\r\n   * rootReducer.inject(booleanSlice)\r\n   * rootReducer.inject(baseApi)\r\n   * rootReducer.inject({ reducerPath: 'boolean' as const, reducer: newReducer }, { overrideExisting: true })\r\n   * ```\r\n   *\r\n   */\n\n  inject<ReducerPath extends string, State>(slice: SliceLike<ReducerPath, State & (ReducerPath extends keyof DeclaredState ? never : State)>, config?: InjectConfig): CombinedSliceReducer<InitialState, Id<DeclaredState & WithSlice<SliceLike<ReducerPath, State>>>>;\n  /**\r\n   * Create a selector that guarantees that the slices injected will have a defined value when selector is run.\r\n   *\r\n   * ```ts\r\n   * const selectBooleanWithoutInjection = (state: RootState) => state.boolean;\r\n   * //                                                                ^? boolean | undefined\r\n   *\r\n   * const selectBoolean = rootReducer.inject(booleanSlice).selector((state) => {\r\n   *   // if action hasn't been dispatched since slice was injected, this would usually be undefined\r\n   *   // however selector() uses a Proxy around the first parameter to ensure that it evaluates to the initial state instead, if undefined\r\n   *   return state.boolean;\r\n   *   //           ^? boolean\r\n   * })\r\n   * ```\r\n   *\r\n   * If the reducer is nested inside the root state, a selectState callback can be passed to retrieve the reducer's state.\r\n   *\r\n   * ```ts\r\n   *\r\n   * export interface LazyLoadedSlices {};\r\n   *\r\n   * export const innerReducer = combineSlices(stringSlice).withLazyLoadedSlices<LazyLoadedSlices>();\r\n   *\r\n   * export const rootReducer = combineSlices({ inner: innerReducer });\r\n   *\r\n   * export type RootState = ReturnType<typeof rootReducer>;\r\n   *\r\n   * // elsewhere\r\n   *\r\n   * declare module \"./reducer.ts\" {\r\n   *  export interface LazyLoadedSlices extends WithSlice<typeof booleanSlice> {}\r\n   * }\r\n   *\r\n   * const withBool = innerReducer.inject(booleanSlice);\r\n   *\r\n   * const selectBoolean = withBool.selector(\r\n   *   (state) => state.boolean,\r\n   *   (rootState: RootState) => state.inner\r\n   * );\r\n   * //    now expects to be passed RootState instead of innerReducer state\r\n   *\r\n   * ```\r\n   *\r\n   * Value passed to selectorFn will be a Proxy - use selector.original(proxy) to get original state value (useful for debugging)\r\n   *\r\n   * ```ts\r\n   * const injectedReducer = rootReducer.inject(booleanSlice);\r\n   * const selectBoolean = injectedReducer.selector((state) => {\r\n   *   console.log(injectedReducer.selector.original(state).boolean) // possibly undefined\r\n   *   return state.boolean\r\n   * })\r\n   * ```\r\n   */\n\n  selector: {\n    /**\r\n     * Create a selector that guarantees that the slices injected will have a defined value when selector is run.\r\n     *\r\n     * ```ts\r\n     * const selectBooleanWithoutInjection = (state: RootState) => state.boolean;\r\n     * //                                                                ^? boolean | undefined\r\n     *\r\n     * const selectBoolean = rootReducer.inject(booleanSlice).selector((state) => {\r\n     *   // if action hasn't been dispatched since slice was injected, this would usually be undefined\r\n     *   // however selector() uses a Proxy around the first parameter to ensure that it evaluates to the initial state instead, if undefined\r\n     *   return state.boolean;\r\n     *   //           ^? boolean\r\n     * })\r\n     * ```\r\n     *\r\n     * Value passed to selectorFn will be a Proxy - use selector.original(proxy) to get original state value (useful for debugging)\r\n     *\r\n     * ```ts\r\n     * const injectedReducer = rootReducer.inject(booleanSlice);\r\n     * const selectBoolean = injectedReducer.selector((state) => {\r\n     *   console.log(injectedReducer.selector.original(state).boolean) // undefined\r\n     *   return state.boolean\r\n     * })\r\n     * ```\r\n     */\n    <Selector extends (state: DeclaredState, ...args: any[]) => unknown>(selectorFn: Selector): (state: WithOptionalProp<Parameters<Selector>[0], Exclude<keyof DeclaredState, keyof InitialState>>, ...args: Tail<Parameters<Selector>>) => ReturnType<Selector>;\n    /**\r\n     * Create a selector that guarantees that the slices injected will have a defined value when selector is run.\r\n     *\r\n     * ```ts\r\n     * const selectBooleanWithoutInjection = (state: RootState) => state.boolean;\r\n     * //                                                                ^? boolean | undefined\r\n     *\r\n     * const selectBoolean = rootReducer.inject(booleanSlice).selector((state) => {\r\n     *   // if action hasn't been dispatched since slice was injected, this would usually be undefined\r\n     *   // however selector() uses a Proxy around the first parameter to ensure that it evaluates to the initial state instead, if undefined\r\n     *   return state.boolean;\r\n     *   //           ^? boolean\r\n     * })\r\n     * ```\r\n     *\r\n     * If the reducer is nested inside the root state, a selectState callback can be passed to retrieve the reducer's state.\r\n     *\r\n     * ```ts\r\n     *\r\n     * interface LazyLoadedSlices {};\r\n     *\r\n     * const innerReducer = combineSlices(stringSlice).withLazyLoadedSlices<LazyLoadedSlices>();\r\n     *\r\n     * const rootReducer = combineSlices({ inner: innerReducer });\r\n     *\r\n     * type RootState = ReturnType<typeof rootReducer>;\r\n     *\r\n     * // elsewhere\r\n     *\r\n     * declare module \"./reducer.ts\" {\r\n     *  interface LazyLoadedSlices extends WithSlice<typeof booleanSlice> {}\r\n     * }\r\n     *\r\n     * const withBool = innerReducer.inject(booleanSlice);\r\n     *\r\n     * const selectBoolean = withBool.selector(\r\n     *   (state) => state.boolean,\r\n     *   (rootState: RootState) => state.inner\r\n     * );\r\n     * //    now expects to be passed RootState instead of innerReducer state\r\n     *\r\n     * ```\r\n     *\r\n     * Value passed to selectorFn will be a Proxy - use selector.original(proxy) to get original state value (useful for debugging)\r\n     *\r\n     * ```ts\r\n     * const injectedReducer = rootReducer.inject(booleanSlice);\r\n     * const selectBoolean = injectedReducer.selector((state) => {\r\n     *   console.log(injectedReducer.selector.original(state).boolean) // possibly undefined\r\n     *   return state.boolean\r\n     * })\r\n     * ```\r\n     */\n\n    <Selector extends (state: DeclaredState, ...args: any[]) => unknown, RootState>(selectorFn: Selector, selectState: (rootState: RootState, ...args: Tail<Parameters<Selector>>) => WithOptionalProp<Parameters<Selector>[0], Exclude<keyof DeclaredState, keyof InitialState>>): (state: RootState, ...args: Tail<Parameters<Selector>>) => ReturnType<Selector>;\n    /**\r\n     * Returns the unproxied state. Useful for debugging.\r\n     * @param state state Proxy, that ensures injected reducers have value\r\n     * @returns original, unproxied state\r\n     * @throws if value passed is not a state Proxy\r\n     */\n\n    original: (state: DeclaredState) => InitialState & Partial<DeclaredState>;\n  };\n}\ntype InitialState<Slices extends Array<AnySliceLike | ReducerMap>> = UnionToIntersection<Slices[number] extends infer Slice ? Slice extends AnySliceLike ? WithSlice<Slice> : StateFromReducersMapObject<Slice> : never>;\n\nconst isSliceLike = (maybeSliceLike: AnySliceLike | ReducerMap): maybeSliceLike is AnySliceLike => 'reducerPath' in maybeSliceLike && typeof maybeSliceLike.reducerPath === 'string';\n\nconst getReducers = (slices: Array<AnySliceLike | ReducerMap>) => slices.flatMap(sliceOrMap => isSliceLike(sliceOrMap) ? [([sliceOrMap.reducerPath, sliceOrMap.reducer] as const)] : Object.entries(sliceOrMap));\n\nconst ORIGINAL_STATE = Symbol.for('rtk-state-proxy-original');\n\nconst isStateProxy = (value: any) => !!value && !!value[ORIGINAL_STATE];\n\nconst stateProxyMap = new WeakMap<object, object>();\n\nconst createStateProxy = <State extends object,>(state: State, reducerMap: Partial<Record<string, Reducer>>) => (emplace(stateProxyMap, state, {\n  insert: () => new Proxy(state, {\n    get: (target, prop, receiver) => {\n      if (prop === ORIGINAL_STATE) return target;\n      const result = Reflect.get(target, prop, receiver);\n\n      if (typeof result === 'undefined') {\n        const reducer = reducerMap[prop.toString()];\n\n        if (reducer) {\n          // ensure action type is random, to prevent reducer treating it differently\n          const reducerResult = reducer(undefined, {\n            type: nanoid()\n          });\n\n          if (typeof reducerResult === 'undefined') {\n            throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage(24) : `The slice reducer for key \"${prop.toString()}\" returned undefined when called for selector(). ` + `If the state passed to the reducer is undefined, you must ` + `explicitly return the initial state. The initial state may ` + `not be undefined. If you don't want to set a value for this reducer, ` + `you can use null instead of undefined.`);\n          }\n\n          return reducerResult;\n        }\n      }\n\n      return result;\n    }\n  })\n}) as State);\n\nconst original = (state: any) => {\n  if (!isStateProxy(state)) {\n    throw new Error(process.env.NODE_ENV === \"production\" ? _formatProdErrorMessage2(25) : 'original must be used on state Proxy');\n  }\n\n  return state[ORIGINAL_STATE];\n};\n\nconst noopReducer: Reducer<Record<string, any>> = (state = {}) => state;\n\nexport function combineSlices<Slices extends Array<AnySliceLike | ReducerMap>>(...slices: Slices): CombinedSliceReducer<Id<InitialState<Slices>>> {\n  const reducerMap = Object.fromEntries<Reducer>(getReducers(slices));\n\n  const getReducer = () => Object.keys(reducerMap).length ? combineReducers(reducerMap) : noopReducer;\n\n  let reducer = getReducer();\n\n  function combinedReducer(state: Record<string, unknown>, action: UnknownAction) {\n    return reducer(state, action);\n  }\n\n  combinedReducer.withLazyLoadedSlices = () => combinedReducer;\n\n  const inject = (slice: AnySliceLike, config: InjectConfig = {}): typeof combinedReducer => {\n    const {\n      reducerPath,\n      reducer: reducerToInject\n    } = slice;\n    const currentReducer = reducerMap[reducerPath];\n\n    if (!config.overrideExisting && currentReducer && currentReducer !== reducerToInject) {\n      if (typeof process !== 'undefined' && process.env.NODE_ENV === 'development') {\n        console.error(`called \\`inject\\` to override already-existing reducer ${reducerPath} without specifying \\`overrideExisting: true\\``);\n      }\n\n      return combinedReducer;\n    }\n\n    reducerMap[reducerPath] = reducerToInject;\n    reducer = getReducer();\n    return combinedReducer;\n  };\n\n  const selector = Object.assign(function makeSelector<State extends object, RootState, Args extends any[]>(selectorFn: (state: State, ...args: Args) => any, selectState?: (rootState: RootState, ...args: Args) => State) {\n    return function selector(state: State, ...args: Args) {\n      return selectorFn(createStateProxy(selectState ? selectState((state as any), ...args) : state, reducerMap), ...args);\n    };\n  }, {\n    original\n  });\n  return (Object.assign(combinedReducer, {\n    inject,\n    selector\n  }) as any);\n}","/**\r\n * Adapted from React: https://github.com/facebook/react/blob/master/packages/shared/formatProdErrorMessage.js\r\n *\r\n * Do not require this module directly! Use normal throw error calls. These messages will be replaced with error codes\r\n * during build.\r\n * @param {number} code\r\n */\nexport function formatProdErrorMessage(code: number) {\n  return `Minified Redux Toolkit error #${code}; visit https://redux-toolkit.js.org/Errors?code=${code} for the full message or ` + 'use the non-minified dev environment for full errors. ';\n}","// Should be no imports here!\n\n/**\n * The sentinel value returned by producers to replace the draft with undefined.\n */\nexport const NOTHING: unique symbol = Symbol.for(\"immer-nothing\")\n\n/**\n * To let Immer treat your class instances as plain immutable objects\n * (albeit with a custom prototype), you must define either an instance property\n * or a static property on each of your custom classes.\n *\n * Otherwise, your class instance will never be drafted, which means it won't be\n * safe to mutate in a produce callback.\n */\nexport const DRAFTABLE: unique symbol = Symbol.for(\"immer-draftable\")\n\nexport const DRAFT_STATE: unique symbol = Symbol.for(\"immer-state\")\n","export const errors =\n\tprocess.env.NODE_ENV !== \"production\"\n\t\t? [\n\t\t\t\t// All error codes, starting by 0:\n\t\t\t\tfunction(plugin: string) {\n\t\t\t\t\treturn `The plugin for '${plugin}' has not been loaded into Immer. To enable the plugin, import and call \\`enable${plugin}()\\` when initializing your application.`\n\t\t\t\t},\n\t\t\t\tfunction(thing: string) {\n\t\t\t\t\treturn `produce can only be called on things that are draftable: plain objects, arrays, Map, Set or classes that are marked with '[immerable]: true'. Got '${thing}'`\n\t\t\t\t},\n\t\t\t\t\"This object has been frozen and should not be mutated\",\n\t\t\t\tfunction(data: any) {\n\t\t\t\t\treturn (\n\t\t\t\t\t\t\"Cannot use a proxy that has been revoked. Did you pass an object from inside an immer function to an async process? \" +\n\t\t\t\t\t\tdata\n\t\t\t\t\t)\n\t\t\t\t},\n\t\t\t\t\"An immer producer returned a new value *and* modified its draft. Either return a new value *or* modify the draft.\",\n\t\t\t\t\"Immer forbids circular references\",\n\t\t\t\t\"The first or second argument to `produce` must be a function\",\n\t\t\t\t\"The third argument to `produce` must be a function or undefined\",\n\t\t\t\t\"First argument to `createDraft` must be a plain object, an array, or an immerable object\",\n\t\t\t\t\"First argument to `finishDraft` must be a draft returned by `createDraft`\",\n\t\t\t\tfunction(thing: string) {\n\t\t\t\t\treturn `'current' expects a draft, got: ${thing}`\n\t\t\t\t},\n\t\t\t\t\"Object.defineProperty() cannot be used on an Immer draft\",\n\t\t\t\t\"Object.setPrototypeOf() cannot be used on an Immer draft\",\n\t\t\t\t\"Immer only supports deleting array indices\",\n\t\t\t\t\"Immer only supports setting array indices and the 'length' property\",\n\t\t\t\tfunction(thing: string) {\n\t\t\t\t\treturn `'original' expects a draft, got: ${thing}`\n\t\t\t\t}\n\t\t\t\t// Note: if more errors are added, the errorOffset in Patches.ts should be increased\n\t\t\t\t// See Patches.ts for additional errors\n\t\t  ]\n\t\t: []\n\nexport function die(error: number, ...args: any[]): never {\n\tif (process.env.NODE_ENV !== \"production\") {\n\t\tconst e = errors[error]\n\t\tconst msg = typeof e === \"function\" ? e.apply(null, args as any) : e\n\t\tthrow new Error(`[Immer] ${msg}`)\n\t}\n\tthrow new Error(\n\t\t`[Immer] minified error nr: ${error}. Full error at: https://bit.ly/3cXEKWf`\n\t)\n}\n","import {\n\tDRAFT_STATE,\n\tDRAFTABLE,\n\tObjectish,\n\tDrafted,\n\tAnyObject,\n\tAnyMap,\n\tAnySet,\n\tImmerState,\n\tArchType,\n\tdie\n} from \"../internal\"\n\nexport const getPrototypeOf = Object.getPrototypeOf\n\n/** Returns true if the given value is an Immer draft */\n/*#__PURE__*/\nexport function isDraft(value: any): boolean {\n\treturn !!value && !!value[DRAFT_STATE]\n}\n\n/** Returns true if the given value can be drafted by Immer */\n/*#__PURE__*/\nexport function isDraftable(value: any): boolean {\n\tif (!value) return false\n\treturn (\n\t\tisPlainObject(value) ||\n\t\tArray.isArray(value) ||\n\t\t!!value[DRAFTABLE] ||\n\t\t!!value.constructor?.[DRAFTABLE] ||\n\t\tisMap(value) ||\n\t\tisSet(value)\n\t)\n}\n\nconst objectCtorString = Object.prototype.constructor.toString()\n/*#__PURE__*/\nexport function isPlainObject(value: any): boolean {\n\tif (!value || typeof value !== \"object\") return false\n\tconst proto = getPrototypeOf(value)\n\tif (proto === null) {\n\t\treturn true\n\t}\n\tconst Ctor =\n\t\tObject.hasOwnProperty.call(proto, \"constructor\") && proto.constructor\n\n\tif (Ctor === Object) return true\n\n\treturn (\n\t\ttypeof Ctor == \"function\" &&\n\t\tFunction.toString.call(Ctor) === objectCtorString\n\t)\n}\n\n/** Get the underlying object that is represented by the given draft */\n/*#__PURE__*/\nexport function original<T>(value: T): T | undefined\nexport function original(value: Drafted<any>): any {\n\tif (!isDraft(value)) die(15, value)\n\treturn value[DRAFT_STATE].base_\n}\n\n/**\n * Each iterates a map, set or array.\n * Or, if any other kind of of object all it's own properties.\n * Regardless whether they are enumerable or symbols\n */\nexport function each<T extends Objectish>(\n\tobj: T,\n\titer: (key: string | number, value: any, source: T) => void\n): void\nexport function each(obj: any, iter: any) {\n\tif (getArchtype(obj) === ArchType.Object) {\n\t\tReflect.ownKeys(obj).forEach(key => {\n\t\t\titer(key, obj[key], obj)\n\t\t})\n\t} else {\n\t\tobj.forEach((entry: any, index: any) => iter(index, entry, obj))\n\t}\n}\n\n/*#__PURE__*/\nexport function getArchtype(thing: any): ArchType {\n\tconst state: undefined | ImmerState = thing[DRAFT_STATE]\n\treturn state\n\t\t? state.type_\n\t\t: Array.isArray(thing)\n\t\t? ArchType.Array\n\t\t: isMap(thing)\n\t\t? ArchType.Map\n\t\t: isSet(thing)\n\t\t? ArchType.Set\n\t\t: ArchType.Object\n}\n\n/*#__PURE__*/\nexport function has(thing: any, prop: PropertyKey): boolean {\n\treturn getArchtype(thing) === ArchType.Map\n\t\t? thing.has(prop)\n\t\t: Object.prototype.hasOwnProperty.call(thing, prop)\n}\n\n/*#__PURE__*/\nexport function get(thing: AnyMap | AnyObject, prop: PropertyKey): any {\n\t// @ts-ignore\n\treturn getArchtype(thing) === ArchType.Map ? thing.get(prop) : thing[prop]\n}\n\n/*#__PURE__*/\nexport function set(thing: any, propOrOldValue: PropertyKey, value: any) {\n\tconst t = getArchtype(thing)\n\tif (t === ArchType.Map) thing.set(propOrOldValue, value)\n\telse if (t === ArchType.Set) {\n\t\tthing.add(value)\n\t} else thing[propOrOldValue] = value\n}\n\n/*#__PURE__*/\nexport function is(x: any, y: any): boolean {\n\t// From: https://github.com/facebook/fbjs/blob/c69904a511b900266935168223063dd8772dfc40/packages/fbjs/src/core/shallowEqual.js\n\tif (x === y) {\n\t\treturn x !== 0 || 1 / x === 1 / y\n\t} else {\n\t\treturn x !== x && y !== y\n\t}\n}\n\n/*#__PURE__*/\nexport function isMap(target: any): target is AnyMap {\n\treturn target instanceof Map\n}\n\n/*#__PURE__*/\nexport function isSet(target: any): target is AnySet {\n\treturn target instanceof Set\n}\n/*#__PURE__*/\nexport function latest(state: ImmerState): any {\n\treturn state.copy_ || state.base_\n}\n\n/*#__PURE__*/\nexport function shallowCopy(base: any, strict: boolean) {\n\tif (isMap(base)) {\n\t\treturn new Map(base)\n\t}\n\tif (isSet(base)) {\n\t\treturn new Set(base)\n\t}\n\tif (Array.isArray(base)) return Array.prototype.slice.call(base)\n\n\tif (!strict && isPlainObject(base)) {\n\t\tif (!getPrototypeOf(base)) {\n\t\t\tconst obj = Object.create(null)\n\t\t\treturn Object.assign(obj, base)\n\t\t}\n\t\treturn {...base}\n\t}\n\n\tconst descriptors = Object.getOwnPropertyDescriptors(base)\n\tdelete descriptors[DRAFT_STATE as any]\n\tlet keys = Reflect.ownKeys(descriptors)\n\tfor (let i = 0; i < keys.length; i++) {\n\t\tconst key: any = keys[i]\n\t\tconst desc = descriptors[key]\n\t\tif (desc.writable === false) {\n\t\t\tdesc.writable = true\n\t\t\tdesc.configurable = true\n\t\t}\n\t\t// like object.assign, we will read any _own_, get/set accessors. This helps in dealing\n\t\t// with libraries that trap values, like mobx or vue\n\t\t// unlike object.assign, non-enumerables will be copied as well\n\t\tif (desc.get || desc.set)\n\t\t\tdescriptors[key] = {\n\t\t\t\tconfigurable: true,\n\t\t\t\twritable: true, // could live with !!desc.set as well here...\n\t\t\t\tenumerable: desc.enumerable,\n\t\t\t\tvalue: base[key]\n\t\t\t}\n\t}\n\treturn Object.create(getPrototypeOf(base), descriptors)\n}\n\n/**\n * Freezes draftable objects. Returns the original object.\n * By default freezes shallowly, but if the second argument is `true` it will freeze recursively.\n *\n * @param obj\n * @param deep\n */\nexport function freeze<T>(obj: T, deep?: boolean): T\nexport function freeze<T>(obj: any, deep: boolean = false): T {\n\tif (isFrozen(obj) || isDraft(obj) || !isDraftable(obj)) return obj\n\tif (getArchtype(obj) > 1 /* Map or Set */) {\n\t\tobj.set = obj.add = obj.clear = obj.delete = dontMutateFrozenCollections as any\n\t}\n\tObject.freeze(obj)\n\tif (deep)\n\t\t// See #590, don't recurse into non-enumerable / Symbol properties when freezing\n\t\t// So use Object.entries (only string-like, enumerables) instead of each()\n\t\tObject.entries(obj).forEach(([key, value]) => freeze(value, true))\n\treturn obj\n}\n\nfunction dontMutateFrozenCollections() {\n\tdie(2)\n}\n\nexport function isFrozen(obj: any): boolean {\n\treturn Object.isFrozen(obj)\n}\n","import {\n\tImmerState,\n\tPatch,\n\tDrafted,\n\tImmerBaseState,\n\tAnyMap,\n\tAnySet,\n\tArchType,\n\tdie\n} from \"../internal\"\n\n/** Plugin utilities */\nconst plugins: {\n\tPatches?: {\n\t\tgeneratePatches_(\n\t\t\tstate: ImmerState,\n\t\t\tbasePath: PatchPath,\n\t\t\tpatches: Patch[],\n\t\t\tinversePatches: Patch[]\n\t\t): void\n\t\tgenerateReplacementPatches_(\n\t\t\tbase: any,\n\t\t\treplacement: any,\n\t\t\tpatches: Patch[],\n\t\t\tinversePatches: Patch[]\n\t\t): void\n\t\tapplyPatches_<T>(draft: T, patches: Patch[]): T\n\t}\n\tMapSet?: {\n\t\tproxyMap_<T extends AnyMap>(target: T, parent?: ImmerState): T\n\t\tproxySet_<T extends AnySet>(target: T, parent?: ImmerState): T\n\t}\n} = {}\n\ntype Plugins = typeof plugins\n\nexport function getPlugin<K extends keyof Plugins>(\n\tpluginKey: K\n): Exclude<Plugins[K], undefined> {\n\tconst plugin = plugins[pluginKey]\n\tif (!plugin) {\n\t\tdie(0, pluginKey)\n\t}\n\t// @ts-ignore\n\treturn plugin\n}\n\nexport function loadPlugin<K extends keyof Plugins>(\n\tpluginKey: K,\n\timplementation: Plugins[K]\n): void {\n\tif (!plugins[pluginKey]) plugins[pluginKey] = implementation\n}\n/** Map / Set plugin */\n\nexport interface MapState extends ImmerBaseState {\n\ttype_: ArchType.Map\n\tcopy_: AnyMap | undefined\n\tassigned_: Map<any, boolean> | undefined\n\tbase_: AnyMap\n\trevoked_: boolean\n\tdraft_: Drafted<AnyMap, MapState>\n}\n\nexport interface SetState extends ImmerBaseState {\n\ttype_: ArchType.Set\n\tcopy_: AnySet | undefined\n\tbase_: AnySet\n\tdrafts_: Map<any, Drafted> // maps the original value to the draft value in the new set\n\trevoked_: boolean\n\tdraft_: Drafted<AnySet, SetState>\n}\n\n/** Patches plugin */\n\nexport type PatchPath = (string | number)[]\n","import {\n\tPatch,\n\tPatchListener,\n\tDrafted,\n\tImmer,\n\tDRAFT_STATE,\n\tImmerState,\n\tArchType,\n\tgetPlugin\n} from \"../internal\"\n\n/** Each scope represents a `produce` call. */\n\nexport interface ImmerScope {\n\tpatches_?: Patch[]\n\tinversePatches_?: Patch[]\n\tcanAutoFreeze_: boolean\n\tdrafts_: any[]\n\tparent_?: ImmerScope\n\tpatchListener_?: PatchListener\n\timmer_: Immer\n\tunfinalizedDrafts_: number\n}\n\nlet currentScope: ImmerScope | undefined\n\nexport function getCurrentScope() {\n\treturn currentScope!\n}\n\nfunction createScope(\n\tparent_: ImmerScope | undefined,\n\timmer_: Immer\n): ImmerScope {\n\treturn {\n\t\tdrafts_: [],\n\t\tparent_,\n\t\timmer_,\n\t\t// Whenever the modified draft contains a draft from another scope, we\n\t\t// need to prevent auto-freezing so the unowned draft can be finalized.\n\t\tcanAutoFreeze_: true,\n\t\tunfinalizedDrafts_: 0\n\t}\n}\n\nexport function usePatchesInScope(\n\tscope: ImmerScope,\n\tpatchListener?: PatchListener\n) {\n\tif (patchListener) {\n\t\tgetPlugin(\"Patches\") // assert we have the plugin\n\t\tscope.patches_ = []\n\t\tscope.inversePatches_ = []\n\t\tscope.patchListener_ = patchListener\n\t}\n}\n\nexport function revokeScope(scope: ImmerScope) {\n\tleaveScope(scope)\n\tscope.drafts_.forEach(revokeDraft)\n\t// @ts-ignore\n\tscope.drafts_ = null\n}\n\nexport function leaveScope(scope: ImmerScope) {\n\tif (scope === currentScope) {\n\t\tcurrentScope = scope.parent_\n\t}\n}\n\nexport function enterScope(immer: Immer) {\n\treturn (currentScope = createScope(currentScope, immer))\n}\n\nfunction revokeDraft(draft: Drafted) {\n\tconst state: ImmerState = draft[DRAFT_STATE]\n\tif (state.type_ === ArchType.Object || state.type_ === ArchType.Array)\n\t\tstate.revoke_()\n\telse state.revoked_ = true\n}\n","import {\n\tImmerScope,\n\tDRAFT_STATE,\n\tisDraftable,\n\tNOTHING,\n\tPatchPath,\n\teach,\n\thas,\n\tfreeze,\n\tImmerState,\n\tisDraft,\n\tSetState,\n\tset,\n\tArchType,\n\tgetPlugin,\n\tdie,\n\trevokeScope,\n\tisFrozen\n} from \"../internal\"\n\nexport function processResult(result: any, scope: ImmerScope) {\n\tscope.unfinalizedDrafts_ = scope.drafts_.length\n\tconst baseDraft = scope.drafts_![0]\n\tconst isReplaced = result !== undefined && result !== baseDraft\n\tif (isReplaced) {\n\t\tif (baseDraft[DRAFT_STATE].modified_) {\n\t\t\trevokeScope(scope)\n\t\t\tdie(4)\n\t\t}\n\t\tif (isDraftable(result)) {\n\t\t\t// Finalize the result in case it contains (or is) a subset of the draft.\n\t\t\tresult = finalize(scope, result)\n\t\t\tif (!scope.parent_) maybeFreeze(scope, result)\n\t\t}\n\t\tif (scope.patches_) {\n\t\t\tgetPlugin(\"Patches\").generateReplacementPatches_(\n\t\t\t\tbaseDraft[DRAFT_STATE].base_,\n\t\t\t\tresult,\n\t\t\t\tscope.patches_,\n\t\t\t\tscope.inversePatches_!\n\t\t\t)\n\t\t}\n\t} else {\n\t\t// Finalize the base draft.\n\t\tresult = finalize(scope, baseDraft, [])\n\t}\n\trevokeScope(scope)\n\tif (scope.patches_) {\n\t\tscope.patchListener_!(scope.patches_, scope.inversePatches_!)\n\t}\n\treturn result !== NOTHING ? result : undefined\n}\n\nfunction finalize(rootScope: ImmerScope, value: any, path?: PatchPath) {\n\t// Don't recurse in tho recursive data structures\n\tif (isFrozen(value)) return value\n\n\tconst state: ImmerState = value[DRAFT_STATE]\n\t// A plain object, might need freezing, might contain drafts\n\tif (!state) {\n\t\teach(value, (key, childValue) =>\n\t\t\tfinalizeProperty(rootScope, state, value, key, childValue, path)\n\t\t)\n\t\treturn value\n\t}\n\t// Never finalize drafts owned by another scope.\n\tif (state.scope_ !== rootScope) return value\n\t// Unmodified draft, return the (frozen) original\n\tif (!state.modified_) {\n\t\tmaybeFreeze(rootScope, state.base_, true)\n\t\treturn state.base_\n\t}\n\t// Not finalized yet, let's do that now\n\tif (!state.finalized_) {\n\t\tstate.finalized_ = true\n\t\tstate.scope_.unfinalizedDrafts_--\n\t\tconst result = state.copy_\n\t\t// Finalize all children of the copy\n\t\t// For sets we clone before iterating, otherwise we can get in endless loop due to modifying during iteration, see #628\n\t\t// To preserve insertion order in all cases we then clear the set\n\t\t// And we let finalizeProperty know it needs to re-add non-draft children back to the target\n\t\tlet resultEach = result\n\t\tlet isSet = false\n\t\tif (state.type_ === ArchType.Set) {\n\t\t\tresultEach = new Set(result)\n\t\t\tresult.clear()\n\t\t\tisSet = true\n\t\t}\n\t\teach(resultEach, (key, childValue) =>\n\t\t\tfinalizeProperty(rootScope, state, result, key, childValue, path, isSet)\n\t\t)\n\t\t// everything inside is frozen, we can freeze here\n\t\tmaybeFreeze(rootScope, result, false)\n\t\t// first time finalizing, let's create those patches\n\t\tif (path && rootScope.patches_) {\n\t\t\tgetPlugin(\"Patches\").generatePatches_(\n\t\t\t\tstate,\n\t\t\t\tpath,\n\t\t\t\trootScope.patches_,\n\t\t\t\trootScope.inversePatches_!\n\t\t\t)\n\t\t}\n\t}\n\treturn state.copy_\n}\n\nfunction finalizeProperty(\n\trootScope: ImmerScope,\n\tparentState: undefined | ImmerState,\n\ttargetObject: any,\n\tprop: string | number,\n\tchildValue: any,\n\trootPath?: PatchPath,\n\ttargetIsSet?: boolean\n) {\n\tif (process.env.NODE_ENV !== \"production\" && childValue === targetObject)\n\t\tdie(5)\n\tif (isDraft(childValue)) {\n\t\tconst path =\n\t\t\trootPath &&\n\t\t\tparentState &&\n\t\t\tparentState!.type_ !== ArchType.Set && // Set objects are atomic since they have no keys.\n\t\t\t!has((parentState as Exclude<ImmerState, SetState>).assigned_!, prop) // Skip deep patches for assigned keys.\n\t\t\t\t? rootPath!.concat(prop)\n\t\t\t\t: undefined\n\t\t// Drafts owned by `scope` are finalized here.\n\t\tconst res = finalize(rootScope, childValue, path)\n\t\tset(targetObject, prop, res)\n\t\t// Drafts from another scope must prevented to be frozen\n\t\t// if we got a draft back from finalize, we're in a nested produce and shouldn't freeze\n\t\tif (isDraft(res)) {\n\t\t\trootScope.canAutoFreeze_ = false\n\t\t} else return\n\t} else if (targetIsSet) {\n\t\ttargetObject.add(childValue)\n\t}\n\t// Search new objects for unfinalized drafts. Frozen objects should never contain drafts.\n\tif (isDraftable(childValue) && !isFrozen(childValue)) {\n\t\tif (!rootScope.immer_.autoFreeze_ && rootScope.unfinalizedDrafts_ < 1) {\n\t\t\t// optimization: if an object is not a draft, and we don't have to\n\t\t\t// deepfreeze everything, and we are sure that no drafts are left in the remaining object\n\t\t\t// cause we saw and finalized all drafts already; we can stop visiting the rest of the tree.\n\t\t\t// This benefits especially adding large data tree's without further processing.\n\t\t\t// See add-data.js perf test\n\t\t\treturn\n\t\t}\n\t\tfinalize(rootScope, childValue)\n\t\t// Immer deep freezes plain objects, so if there is no parent state, we freeze as well\n\t\t// Per #590, we never freeze symbolic properties. Just to make sure don't accidentally interfere\n\t\t// with other frameworks.\n\t\tif (\n\t\t\t(!parentState || !parentState.scope_.parent_) &&\n\t\t\ttypeof prop !== \"symbol\" &&\n\t\t\tObject.prototype.propertyIsEnumerable.call(targetObject, prop)\n\t\t)\n\t\t\tmaybeFreeze(rootScope, childValue)\n\t}\n}\n\nfunction maybeFreeze(scope: ImmerScope, value: any, deep = false) {\n\t// we never freeze for a non-root scope; as it would prevent pruning for drafts inside wrapping objects\n\tif (!scope.parent_ && scope.immer_.autoFreeze_ && scope.canAutoFreeze_) {\n\t\tfreeze(value, deep)\n\t}\n}\n","import {\n\teach,\n\thas,\n\tis,\n\tisDraftable,\n\tshallowCopy,\n\tlatest,\n\tImmerBaseState,\n\tImmerState,\n\tDrafted,\n\tAnyObject,\n\tAnyArray,\n\tObjectish,\n\tgetCurrentScope,\n\tgetPrototypeOf,\n\tDRAFT_STATE,\n\tdie,\n\tcreateProxy,\n\tArchType,\n\tImmerScope\n} from \"../internal\"\n\ninterface ProxyBaseState extends ImmerBaseState {\n\tassigned_: {\n\t\t[property: string]: boolean\n\t}\n\tparent_?: ImmerState\n\trevoke_(): void\n}\n\nexport interface ProxyObjectState extends ProxyBaseState {\n\ttype_: ArchType.Object\n\tbase_: any\n\tcopy_: any\n\tdraft_: Drafted<AnyObject, ProxyObjectState>\n}\n\nexport interface ProxyArrayState extends ProxyBaseState {\n\ttype_: ArchType.Array\n\tbase_: AnyArray\n\tcopy_: AnyArray | null\n\tdraft_: Drafted<AnyArray, ProxyArrayState>\n}\n\ntype ProxyState = ProxyObjectState | ProxyArrayState\n\n/**\n * Returns a new draft of the `base` object.\n *\n * The second argument is the parent draft-state (used internally).\n */\nexport function createProxyProxy<T extends Objectish>(\n\tbase: T,\n\tparent?: ImmerState\n): Drafted<T, ProxyState> {\n\tconst isArray = Array.isArray(base)\n\tconst state: ProxyState = {\n\t\ttype_: isArray ? ArchType.Array : (ArchType.Object as any),\n\t\t// Track which produce call this is associated with.\n\t\tscope_: parent ? parent.scope_ : getCurrentScope()!,\n\t\t// True for both shallow and deep changes.\n\t\tmodified_: false,\n\t\t// Used during finalization.\n\t\tfinalized_: false,\n\t\t// Track which properties have been assigned (true) or deleted (false).\n\t\tassigned_: {},\n\t\t// The parent draft state.\n\t\tparent_: parent,\n\t\t// The base state.\n\t\tbase_: base,\n\t\t// The base proxy.\n\t\tdraft_: null as any, // set below\n\t\t// The base copy with any updated values.\n\t\tcopy_: null,\n\t\t// Called by the `produce` function.\n\t\trevoke_: null as any,\n\t\tisManual_: false\n\t}\n\n\t// the traps must target something, a bit like the 'real' base.\n\t// but also, we need to be able to determine from the target what the relevant state is\n\t// (to avoid creating traps per instance to capture the state in closure,\n\t// and to avoid creating weird hidden properties as well)\n\t// So the trick is to use 'state' as the actual 'target'! (and make sure we intercept everything)\n\t// Note that in the case of an array, we put the state in an array to have better Reflect defaults ootb\n\tlet target: T = state as any\n\tlet traps: ProxyHandler<object | Array<any>> = objectTraps\n\tif (isArray) {\n\t\ttarget = [state] as any\n\t\ttraps = arrayTraps\n\t}\n\n\tconst {revoke, proxy} = Proxy.revocable(target, traps)\n\tstate.draft_ = proxy as any\n\tstate.revoke_ = revoke\n\treturn proxy as any\n}\n\n/**\n * Object drafts\n */\nexport const objectTraps: ProxyHandler<ProxyState> = {\n\tget(state, prop) {\n\t\tif (prop === DRAFT_STATE) return state\n\n\t\tconst source = latest(state)\n\t\tif (!has(source, prop)) {\n\t\t\t// non-existing or non-own property...\n\t\t\treturn readPropFromProto(state, source, prop)\n\t\t}\n\t\tconst value = source[prop]\n\t\tif (state.finalized_ || !isDraftable(value)) {\n\t\t\treturn value\n\t\t}\n\t\t// Check for existing draft in modified state.\n\t\t// Assigned values are never drafted. This catches any drafts we created, too.\n\t\tif (value === peek(state.base_, prop)) {\n\t\t\tprepareCopy(state)\n\t\t\treturn (state.copy_![prop as any] = createProxy(value, state))\n\t\t}\n\t\treturn value\n\t},\n\thas(state, prop) {\n\t\treturn prop in latest(state)\n\t},\n\townKeys(state) {\n\t\treturn Reflect.ownKeys(latest(state))\n\t},\n\tset(\n\t\tstate: ProxyObjectState,\n\t\tprop: string /* strictly not, but helps TS */,\n\t\tvalue\n\t) {\n\t\tconst desc = getDescriptorFromProto(latest(state), prop)\n\t\tif (desc?.set) {\n\t\t\t// special case: if this write is captured by a setter, we have\n\t\t\t// to trigger it with the correct context\n\t\t\tdesc.set.call(state.draft_, value)\n\t\t\treturn true\n\t\t}\n\t\tif (!state.modified_) {\n\t\t\t// the last check is because we need to be able to distinguish setting a non-existing to undefined (which is a change)\n\t\t\t// from setting an existing property with value undefined to undefined (which is not a change)\n\t\t\tconst current = peek(latest(state), prop)\n\t\t\t// special case, if we assigning the original value to a draft, we can ignore the assignment\n\t\t\tconst currentState: ProxyObjectState = current?.[DRAFT_STATE]\n\t\t\tif (currentState && currentState.base_ === value) {\n\t\t\t\tstate.copy_![prop] = value\n\t\t\t\tstate.assigned_[prop] = false\n\t\t\t\treturn true\n\t\t\t}\n\t\t\tif (is(value, current) && (value !== undefined || has(state.base_, prop)))\n\t\t\t\treturn true\n\t\t\tprepareCopy(state)\n\t\t\tmarkChanged(state)\n\t\t}\n\n\t\tif (\n\t\t\t(state.copy_![prop] === value &&\n\t\t\t\t// special case: handle new props with value 'undefined'\n\t\t\t\t(value !== undefined || prop in state.copy_)) ||\n\t\t\t// special case: NaN\n\t\t\t(Number.isNaN(value) && Number.isNaN(state.copy_![prop]))\n\t\t)\n\t\t\treturn true\n\n\t\t// @ts-ignore\n\t\tstate.copy_![prop] = value\n\t\tstate.assigned_[prop] = true\n\t\treturn true\n\t},\n\tdeleteProperty(state, prop: string) {\n\t\t// The `undefined` check is a fast path for pre-existing keys.\n\t\tif (peek(state.base_, prop) !== undefined || prop in state.base_) {\n\t\t\tstate.assigned_[prop] = false\n\t\t\tprepareCopy(state)\n\t\t\tmarkChanged(state)\n\t\t} else {\n\t\t\t// if an originally not assigned property was deleted\n\t\t\tdelete state.assigned_[prop]\n\t\t}\n\t\tif (state.copy_) {\n\t\t\tdelete state.copy_[prop]\n\t\t}\n\t\treturn true\n\t},\n\t// Note: We never coerce `desc.value` into an Immer draft, because we can't make\n\t// the same guarantee in ES5 mode.\n\tgetOwnPropertyDescriptor(state, prop) {\n\t\tconst owner = latest(state)\n\t\tconst desc = Reflect.getOwnPropertyDescriptor(owner, prop)\n\t\tif (!desc) return desc\n\t\treturn {\n\t\t\twritable: true,\n\t\t\tconfigurable: state.type_ !== ArchType.Array || prop !== \"length\",\n\t\t\tenumerable: desc.enumerable,\n\t\t\tvalue: owner[prop]\n\t\t}\n\t},\n\tdefineProperty() {\n\t\tdie(11)\n\t},\n\tgetPrototypeOf(state) {\n\t\treturn getPrototypeOf(state.base_)\n\t},\n\tsetPrototypeOf() {\n\t\tdie(12)\n\t}\n}\n\n/**\n * Array drafts\n */\n\nconst arrayTraps: ProxyHandler<[ProxyArrayState]> = {}\neach(objectTraps, (key, fn) => {\n\t// @ts-ignore\n\tarrayTraps[key] = function() {\n\t\targuments[0] = arguments[0][0]\n\t\treturn fn.apply(this, arguments)\n\t}\n})\narrayTraps.deleteProperty = function(state, prop) {\n\tif (process.env.NODE_ENV !== \"production\" && isNaN(parseInt(prop as any)))\n\t\tdie(13)\n\t// @ts-ignore\n\treturn arrayTraps.set!.call(this, state, prop, undefined)\n}\narrayTraps.set = function(state, prop, value) {\n\tif (\n\t\tprocess.env.NODE_ENV !== \"production\" &&\n\t\tprop !== \"length\" &&\n\t\tisNaN(parseInt(prop as any))\n\t)\n\t\tdie(14)\n\treturn objectTraps.set!.call(this, state[0], prop, value, state[0])\n}\n\n// Access a property without creating an Immer draft.\nfunction peek(draft: Drafted, prop: PropertyKey) {\n\tconst state = draft[DRAFT_STATE]\n\tconst source = state ? latest(state) : draft\n\treturn source[prop]\n}\n\nfunction readPropFromProto(state: ImmerState, source: any, prop: PropertyKey) {\n\tconst desc = getDescriptorFromProto(source, prop)\n\treturn desc\n\t\t? `value` in desc\n\t\t\t? desc.value\n\t\t\t: // This is a very special case, if the prop is a getter defined by the\n\t\t\t  // prototype, we should invoke it with the draft as context!\n\t\t\t  desc.get?.call(state.draft_)\n\t\t: undefined\n}\n\nfunction getDescriptorFromProto(\n\tsource: any,\n\tprop: PropertyKey\n): PropertyDescriptor | undefined {\n\t// 'in' checks proto!\n\tif (!(prop in source)) return undefined\n\tlet proto = getPrototypeOf(source)\n\twhile (proto) {\n\t\tconst desc = Object.getOwnPropertyDescriptor(proto, prop)\n\t\tif (desc) return desc\n\t\tproto = getPrototypeOf(proto)\n\t}\n\treturn undefined\n}\n\nexport function markChanged(state: ImmerState) {\n\tif (!state.modified_) {\n\t\tstate.modified_ = true\n\t\tif (state.parent_) {\n\t\t\tmarkChanged(state.parent_)\n\t\t}\n\t}\n}\n\nexport function prepareCopy(state: {\n\tbase_: any\n\tcopy_: any\n\tscope_: ImmerScope\n}) {\n\tif (!state.copy_) {\n\t\tstate.copy_ = shallowCopy(\n\t\t\tstate.base_,\n\t\t\tstate.scope_.immer_.useStrictShallowCopy_\n\t\t)\n\t}\n}\n","import {\n\tIProduceWithPatches,\n\tIProduce,\n\tImmerState,\n\tDrafted,\n\tisDraftable,\n\tprocessResult,\n\tPatch,\n\tObjectish,\n\tDRAFT_STATE,\n\tDraft,\n\tPatchListener,\n\tisDraft,\n\tisMap,\n\tisSet,\n\tcreateProxyProxy,\n\tgetPlugin,\n\tdie,\n\tenterScope,\n\trevokeScope,\n\tleaveScope,\n\tusePatchesInScope,\n\tgetCurrentScope,\n\tNOTHING,\n\tfreeze,\n\tcurrent\n} from \"../internal\"\n\ninterface ProducersFns {\n\tproduce: IProduce\n\tproduceWithPatches: IProduceWithPatches\n}\n\nexport class Immer implements ProducersFns {\n\tautoFreeze_: boolean = true\n\tuseStrictShallowCopy_: boolean = false\n\n\tconstructor(config?: {autoFreeze?: boolean; useStrictShallowCopy?: boolean}) {\n\t\tif (typeof config?.autoFreeze === \"boolean\")\n\t\t\tthis.setAutoFreeze(config!.autoFreeze)\n\t\tif (typeof config?.useStrictShallowCopy === \"boolean\")\n\t\t\tthis.setUseStrictShallowCopy(config!.useStrictShallowCopy)\n\t}\n\n\t/**\n\t * The `produce` function takes a value and a \"recipe function\" (whose\n\t * return value often depends on the base state). The recipe function is\n\t * free to mutate its first argument however it wants. All mutations are\n\t * only ever applied to a __copy__ of the base state.\n\t *\n\t * Pass only a function to create a \"curried producer\" which relieves you\n\t * from passing the recipe function every time.\n\t *\n\t * Only plain objects and arrays are made mutable. All other objects are\n\t * considered uncopyable.\n\t *\n\t * Note: This function is __bound__ to its `Immer` instance.\n\t *\n\t * @param {any} base - the initial state\n\t * @param {Function} recipe - function that receives a proxy of the base state as first argument and which can be freely modified\n\t * @param {Function} patchListener - optional function that will be called with all the patches produced here\n\t * @returns {any} a new state, or the initial state if nothing was modified\n\t */\n\tproduce: IProduce = (base: any, recipe?: any, patchListener?: any) => {\n\t\t// curried invocation\n\t\tif (typeof base === \"function\" && typeof recipe !== \"function\") {\n\t\t\tconst defaultBase = recipe\n\t\t\trecipe = base\n\n\t\t\tconst self = this\n\t\t\treturn function curriedProduce(\n\t\t\t\tthis: any,\n\t\t\t\tbase = defaultBase,\n\t\t\t\t...args: any[]\n\t\t\t) {\n\t\t\t\treturn self.produce(base, (draft: Drafted) => recipe.call(this, draft, ...args)) // prettier-ignore\n\t\t\t}\n\t\t}\n\n\t\tif (typeof recipe !== \"function\") die(6)\n\t\tif (patchListener !== undefined && typeof patchListener !== \"function\")\n\t\t\tdie(7)\n\n\t\tlet result\n\n\t\t// Only plain objects, arrays, and \"immerable classes\" are drafted.\n\t\tif (isDraftable(base)) {\n\t\t\tconst scope = enterScope(this)\n\t\t\tconst proxy = createProxy(base, undefined)\n\t\t\tlet hasError = true\n\t\t\ttry {\n\t\t\t\tresult = recipe(proxy)\n\t\t\t\thasError = false\n\t\t\t} finally {\n\t\t\t\t// finally instead of catch + rethrow better preserves original stack\n\t\t\t\tif (hasError) revokeScope(scope)\n\t\t\t\telse leaveScope(scope)\n\t\t\t}\n\t\t\tusePatchesInScope(scope, patchListener)\n\t\t\treturn processResult(result, scope)\n\t\t} else if (!base || typeof base !== \"object\") {\n\t\t\tresult = recipe(base)\n\t\t\tif (result === undefined) result = base\n\t\t\tif (result === NOTHING) result = undefined\n\t\t\tif (this.autoFreeze_) freeze(result, true)\n\t\t\tif (patchListener) {\n\t\t\t\tconst p: Patch[] = []\n\t\t\t\tconst ip: Patch[] = []\n\t\t\t\tgetPlugin(\"Patches\").generateReplacementPatches_(base, result, p, ip)\n\t\t\t\tpatchListener(p, ip)\n\t\t\t}\n\t\t\treturn result\n\t\t} else die(1, base)\n\t}\n\n\tproduceWithPatches: IProduceWithPatches = (base: any, recipe?: any): any => {\n\t\t// curried invocation\n\t\tif (typeof base === \"function\") {\n\t\t\treturn (state: any, ...args: any[]) =>\n\t\t\t\tthis.produceWithPatches(state, (draft: any) => base(draft, ...args))\n\t\t}\n\n\t\tlet patches: Patch[], inversePatches: Patch[]\n\t\tconst result = this.produce(base, recipe, (p: Patch[], ip: Patch[]) => {\n\t\t\tpatches = p\n\t\t\tinversePatches = ip\n\t\t})\n\t\treturn [result, patches!, inversePatches!]\n\t}\n\n\tcreateDraft<T extends Objectish>(base: T): Draft<T> {\n\t\tif (!isDraftable(base)) die(8)\n\t\tif (isDraft(base)) base = current(base)\n\t\tconst scope = enterScope(this)\n\t\tconst proxy = createProxy(base, undefined)\n\t\tproxy[DRAFT_STATE].isManual_ = true\n\t\tleaveScope(scope)\n\t\treturn proxy as any\n\t}\n\n\tfinishDraft<D extends Draft<any>>(\n\t\tdraft: D,\n\t\tpatchListener?: PatchListener\n\t): D extends Draft<infer T> ? T : never {\n\t\tconst state: ImmerState = draft && (draft as any)[DRAFT_STATE]\n\t\tif (!state || !state.isManual_) die(9)\n\t\tconst {scope_: scope} = state\n\t\tusePatchesInScope(scope, patchListener)\n\t\treturn processResult(undefined, scope)\n\t}\n\n\t/**\n\t * Pass true to automatically freeze all copies created by Immer.\n\t *\n\t * By default, auto-freezing is enabled.\n\t */\n\tsetAutoFreeze(value: boolean) {\n\t\tthis.autoFreeze_ = value\n\t}\n\n\t/**\n\t * Pass true to enable strict shallow copy.\n\t *\n\t * By default, immer does not copy the object descriptors such as getter, setter and non-enumrable properties.\n\t */\n\tsetUseStrictShallowCopy(value: boolean) {\n\t\tthis.useStrictShallowCopy_ = value\n\t}\n\n\tapplyPatches<T extends Objectish>(base: T, patches: Patch[]): T {\n\t\t// If a patch replaces the entire state, take that replacement as base\n\t\t// before applying patches\n\t\tlet i: number\n\t\tfor (i = patches.length - 1; i >= 0; i--) {\n\t\t\tconst patch = patches[i]\n\t\t\tif (patch.path.length === 0 && patch.op === \"replace\") {\n\t\t\t\tbase = patch.value\n\t\t\t\tbreak\n\t\t\t}\n\t\t}\n\t\t// If there was a patch that replaced the entire state, start from the\n\t\t// patch after that.\n\t\tif (i > -1) {\n\t\t\tpatches = patches.slice(i + 1)\n\t\t}\n\n\t\tconst applyPatchesImpl = getPlugin(\"Patches\").applyPatches_\n\t\tif (isDraft(base)) {\n\t\t\t// N.B: never hits if some patch a replacement, patches are never drafts\n\t\t\treturn applyPatchesImpl(base, patches)\n\t\t}\n\t\t// Otherwise, produce a copy of the base state.\n\t\treturn this.produce(base, (draft: Drafted) =>\n\t\t\tapplyPatchesImpl(draft, patches)\n\t\t)\n\t}\n}\n\nexport function createProxy<T extends Objectish>(\n\tvalue: T,\n\tparent?: ImmerState\n): Drafted<T, ImmerState> {\n\t// precondition: createProxy should be guarded by isDraftable, so we know we can safely draft\n\tconst draft: Drafted = isMap(value)\n\t\t? getPlugin(\"MapSet\").proxyMap_(value, parent)\n\t\t: isSet(value)\n\t\t? getPlugin(\"MapSet\").proxySet_(value, parent)\n\t\t: createProxyProxy(value, parent)\n\n\tconst scope = parent ? parent.scope_ : getCurrentScope()\n\tscope.drafts_.push(draft)\n\treturn draft\n}\n","import {\n\tdie,\n\tisDraft,\n\tshallowCopy,\n\teach,\n\tDRAFT_STATE,\n\tset,\n\tImmerState,\n\tisDraftable,\n\tisFrozen\n} from \"../internal\"\n\n/** Takes a snapshot of the current state of a draft and finalizes it (but without freezing). This is a great utility to print the current state during debugging (no Proxies in the way). The output of current can also be safely leaked outside the producer. */\nexport function current<T>(value: T): T\nexport function current(value: any): any {\n\tif (!isDraft(value)) die(10, value)\n\treturn currentImpl(value)\n}\n\nfunction currentImpl(value: any): any {\n\tif (!isDraftable(value) || isFrozen(value)) return value\n\tconst state: ImmerState | undefined = value[DRAFT_STATE]\n\tlet copy: any\n\tif (state) {\n\t\tif (!state.modified_) return state.base_\n\t\t// Optimization: avoid generating new drafts during copying\n\t\tstate.finalized_ = true\n\t\tcopy = shallowCopy(value, state.scope_.immer_.useStrictShallowCopy_)\n\t} else {\n\t\tcopy = shallowCopy(value, true)\n\t}\n\t// recurse\n\teach(copy, (key, childValue) => {\n\t\tset(copy, key, currentImpl(childValue))\n\t})\n\tif (state) {\n\t\tstate.finalized_ = false\n\t}\n\treturn copy\n}\n","import {\n\tIProduce,\n\tIProduceWithPatches,\n\tImmer,\n\tDraft,\n\tImmutable\n} from \"./internal\"\n\nexport {\n\tDraft,\n\tImmutable,\n\tPatch,\n\tPatchListener,\n\toriginal,\n\tcurrent,\n\tisDraft,\n\tisDraftable,\n\tNOTHING as nothing,\n\tDRAFTABLE as immerable,\n\tfreeze,\n\tObjectish\n} from \"./internal\"\n\nconst immer = new Immer()\n\n/**\n * The `produce` function takes a value and a \"recipe function\" (whose\n * return value often depends on the base state). The recipe function is\n * free to mutate its first argument however it wants. All mutations are\n * only ever applied to a __copy__ of the base state.\n *\n * Pass only a function to create a \"curried producer\" which relieves you\n * from passing the recipe function every time.\n *\n * Only plain objects and arrays are made mutable. All other objects are\n * considered uncopyable.\n *\n * Note: This function is __bound__ to its `Immer` instance.\n *\n * @param {any} base - the initial state\n * @param {Function} producer - function that receives a proxy of the base state as first argument and which can be freely modified\n * @param {Function} patchListener - optional function that will be called with all the patches produced here\n * @returns {any} a new state, or the initial state if nothing was modified\n */\nexport const produce: IProduce = immer.produce\n\n/**\n * Like `produce`, but `produceWithPatches` always returns a tuple\n * [nextState, patches, inversePatches] (instead of just the next state)\n */\nexport const produceWithPatches: IProduceWithPatches = immer.produceWithPatches.bind(\n\timmer\n)\n\n/**\n * Pass true to automatically freeze all copies created by Immer.\n *\n * Always freeze by default, even in production mode\n */\nexport const setAutoFreeze = immer.setAutoFreeze.bind(immer)\n\n/**\n * Pass true to enable strict shallow copy.\n *\n * By default, immer does not copy the object descriptors such as getter, setter and non-enumrable properties.\n */\nexport const setUseStrictShallowCopy = immer.setUseStrictShallowCopy.bind(immer)\n\n/**\n * Apply an array of Immer patches to the first argument.\n *\n * This function is a producer, which means copy-on-write is in effect.\n */\nexport const applyPatches = immer.applyPatches.bind(immer)\n\n/**\n * Create an Immer draft from the given base state, which may be a draft itself.\n * The draft can be modified until you finalize it with the `finishDraft` function.\n */\nexport const createDraft = immer.createDraft.bind(immer)\n\n/**\n * Finalize an Immer draft from a `createDraft` call, returning the base state\n * (if no changes were made) or a modified copy. The draft must *not* be\n * mutated afterwards.\n *\n * Pass a function as the 2nd argument to generate Immer patches based on the\n * changes that were made.\n */\nexport const finishDraft = immer.finishDraft.bind(immer)\n\n/**\n * This function is actually a no-op, but can be used to cast an immutable type\n * to an draft type and make TypeScript happy\n *\n * @param value\n */\nexport function castDraft<T>(value: T): Draft<T> {\n\treturn value as any\n}\n\n/**\n * This function is actually a no-op, but can be used to cast a mutable type\n * to an immutable type and make TypeScript happy\n * @param value\n */\nexport function castImmutable<T>(value: T): Immutable<T> {\n\treturn value as any\n}\n\nexport {Immer}\n\nexport {enablePatches} from \"./plugins/patches\"\nexport {enableMapSet} from \"./plugins/mapset\"\n","import * as ReactOriginal from 'react'\nimport type * as ReactNamespace from 'react'\n\nexport const React: typeof ReactNamespace =\n  // prettier-ignore\n  // @ts-ignore\n  'default' in ReactOriginal ? ReactOriginal['default'] : ReactOriginal as any\n","import type { Context } from 'react'\nimport { React } from '../utils/react'\nimport type { Action, Store, UnknownAction } from 'redux'\nimport type { Subscription } from '../utils/Subscription'\nimport type { ProviderProps } from './Provider'\n\nexport interface ReactReduxContextValue<\n  SS = any,\n  A extends Action<string> = UnknownAction\n> extends Pick<ProviderProps, 'stabilityCheck' | 'identityFunctionCheck'> {\n  store: Store<SS, A>\n  subscription: Subscription\n  getServerState?: () => SS\n}\n\nconst ContextKey = Symbol.for(`react-redux-context`)\nconst gT: {\n  [ContextKey]?: Map<\n    typeof React.createContext,\n    Context<ReactReduxContextValue | null>\n  >\n} = (\n  typeof globalThis !== 'undefined'\n    ? globalThis\n    : /* fall back to a per-module scope (pre-8.1 behaviour) if `globalThis` is not available */ {}\n) as any\n\nfunction getContext(): Context<ReactReduxContextValue | null> {\n  if (!React.createContext) return {} as any\n\n  const contextMap = (gT[ContextKey] ??= new Map<\n    typeof React.createContext,\n    Context<ReactReduxContextValue | null>\n  >())\n  let realContext = contextMap.get(React.createContext)\n  if (!realContext) {\n    realContext = React.createContext<ReactReduxContextValue | null>(\n      null as any,\n    )\n    if (process.env.NODE_ENV !== 'production') {\n      realContext.displayName = 'ReactRedux'\n    }\n    contextMap.set(React.createContext, realContext)\n  }\n  return realContext\n}\n\nexport const ReactReduxContext = /*#__PURE__*/ getContext()\n\nexport type ReactReduxContextInstance = typeof ReactReduxContext\n\nexport default ReactReduxContext\n","import type { useSyncExternalStore } from 'use-sync-external-store'\nimport type { useSyncExternalStoreWithSelector } from 'use-sync-external-store/with-selector'\n\nexport const notInitialized = () => {\n  throw new Error('uSES not initialized!')\n}\n\nexport type uSES = typeof useSyncExternalStore\nexport type uSESWS = typeof useSyncExternalStoreWithSelector\n","import { React } from '../utils/react'\nimport { ReactReduxContext } from '../components/Context'\nimport type { ReactReduxContextValue } from '../components/Context'\n\n/**\n * Hook factory, which creates a `useReduxContext` hook bound to a given context. This is a low-level\n * hook that you should usually not need to call directly.\n *\n * @param {React.Context} [context=ReactReduxContext] Context passed to your `<Provider>`.\n * @returns {Function} A `useReduxContext` hook bound to the specified context.\n */\nexport function createReduxContextHook(context = ReactReduxContext) {\n  return function useReduxContext(): ReactReduxContextValue {\n    const contextValue = React.useContext(context)\n\n    if (process.env.NODE_ENV !== 'production' && !contextValue) {\n      throw new Error(\n        'could not find react-redux context value; please ensure the component is wrapped in a <Provider>',\n      )\n    }\n\n    return contextValue!\n  }\n}\n\n/**\n * A hook to access the value of the `ReactReduxContext`. This is a low-level\n * hook that you should usually not need to call directly.\n *\n * @returns {any} the value of the `ReactReduxContext`\n *\n * @example\n *\n * import React from 'react'\n * import { useReduxContext } from 'react-redux'\n *\n * export const CounterComponent = () => {\n *   const { store } = useReduxContext()\n *   return <div>{store.getState()}</div>\n * }\n */\nexport const useReduxContext = /*#__PURE__*/ createReduxContextHook()\n","//import * as React from 'react'\nimport { React } from '../utils/react'\n\nimport type { ReactReduxContextValue } from '../components/Context'\nimport { ReactReduxContext } from '../components/Context'\nimport type { EqualityFn, NoInfer } from '../types'\nimport type { uSESWS } from '../utils/useSyncExternalStore'\nimport { notInitialized } from '../utils/useSyncExternalStore'\nimport {\n  createReduxContextHook,\n  useReduxContext as useDefaultReduxContext,\n} from './useReduxContext'\n\n/**\n * The frequency of development mode checks.\n *\n * @since 8.1.0\n * @internal\n */\nexport type DevModeCheckFrequency = 'never' | 'once' | 'always'\n\n/**\n * Represents the configuration for development mode checks.\n *\n * @since 9.0.0\n * @internal\n */\nexport interface DevModeChecks {\n  /**\n   * Overrides the global stability check for the selector.\n   * - `once` - Run only the first time the selector is called.\n   * - `always` - Run every time the selector is called.\n   * - `never` - Never run the stability check.\n   *\n   * @default 'once'\n   *\n   * @since 8.1.0\n   */\n  stabilityCheck: DevModeCheckFrequency\n\n  /**\n   * Overrides the global identity function check for the selector.\n   * - `once` - Run only the first time the selector is called.\n   * - `always` - Run every time the selector is called.\n   * - `never` - Never run the identity function check.\n   *\n   * **Note**: Previously referred to as `noopCheck`.\n   *\n   * @default 'once'\n   *\n   * @since 9.0.0\n   */\n  identityFunctionCheck: DevModeCheckFrequency\n}\n\nexport interface UseSelectorOptions<Selected = unknown> {\n  equalityFn?: EqualityFn<Selected>\n\n  /**\n   * `useSelector` performs additional checks in development mode to help\n   * identify and warn about potential issues in selector behavior. This\n   * option allows you to customize the behavior of these checks per selector.\n   *\n   * @since 9.0.0\n   */\n  devModeChecks?: Partial<DevModeChecks>\n}\n\n/**\n * Represents a custom hook that allows you to extract data from the\n * Redux store state, using a selector function. The selector function\n * takes the current state as an argument and returns a part of the state\n * or some derived data. The hook also supports an optional equality\n * function or options object to customize its behavior.\n *\n * @template StateType - The specific type of state this hook operates on.\n *\n * @public\n */\nexport interface UseSelector<StateType = unknown> {\n  /**\n   * A function that takes a selector function as its first argument.\n   * The selector function is responsible for selecting a part of\n   * the Redux store's state or computing derived data.\n   *\n   * @param selector - A function that receives the current state and returns a part of the state or some derived data.\n   * @param equalityFnOrOptions - An optional equality function or options object for customizing the behavior of the selector.\n   * @returns The selected part of the state or derived data.\n   *\n   * @template TState - The specific type of state this hook operates on.\n   * @template Selected - The type of the value that the selector function will return.\n   */\n  <TState extends StateType = StateType, Selected = unknown>(\n    selector: (state: TState) => Selected,\n    equalityFnOrOptions?: EqualityFn<Selected> | UseSelectorOptions<Selected>\n  ): Selected\n\n  /**\n   * Creates a \"pre-typed\" version of {@linkcode useSelector useSelector}\n   * where the `state` type is predefined.\n   *\n   * This allows you to set the `state` type once, eliminating the need to\n   * specify it with every {@linkcode useSelector useSelector} call.\n   *\n   * @returns A pre-typed `useSelector` with the state type already defined.\n   *\n   * @example\n   * ```ts\n   * export const useAppSelector = useSelector.withTypes<RootState>()\n   * ```\n   *\n   * @template OverrideStateType - The specific type of state this hook operates on.\n   *\n   * @since 9.1.0\n   */\n  withTypes: <\n    OverrideStateType extends StateType\n  >() => UseSelector<OverrideStateType>\n}\n\nlet useSyncExternalStoreWithSelector = notInitialized as uSESWS\nexport const initializeUseSelector = (fn: uSESWS) => {\n  useSyncExternalStoreWithSelector = fn\n}\n\nconst refEquality: EqualityFn<any> = (a, b) => a === b\n\n/**\n * Hook factory, which creates a `useSelector` hook bound to a given context.\n *\n * @param {React.Context} [context=ReactReduxContext] Context passed to your `<Provider>`.\n * @returns {Function} A `useSelector` hook bound to the specified context.\n */\nexport function createSelectorHook(\n  context: React.Context<ReactReduxContextValue<\n    any,\n    any\n  > | null> = ReactReduxContext,\n): UseSelector {\n  const useReduxContext =\n    context === ReactReduxContext\n      ? useDefaultReduxContext\n      : createReduxContextHook(context)\n\n  const useSelector = <TState, Selected extends unknown>(\n    selector: (state: TState) => Selected,\n    equalityFnOrOptions:\n      | EqualityFn<NoInfer<Selected>>\n      | UseSelectorOptions<NoInfer<Selected>> = {}\n  ): Selected => {\n    const { equalityFn = refEquality, devModeChecks = {} } =\n      typeof equalityFnOrOptions === 'function'\n        ? { equalityFn: equalityFnOrOptions }\n        : equalityFnOrOptions\n    if (process.env.NODE_ENV !== 'production') {\n      if (!selector) {\n        throw new Error(`You must pass a selector to useSelector`)\n      }\n      if (typeof selector !== 'function') {\n        throw new Error(`You must pass a function as a selector to useSelector`)\n      }\n      if (typeof equalityFn !== 'function') {\n        throw new Error(\n          `You must pass a function as an equality function to useSelector`,\n        )\n      }\n    }\n\n    const {\n      store,\n      subscription,\n      getServerState,\n      stabilityCheck,\n      identityFunctionCheck,\n    } = useReduxContext()\n\n    const firstRun = React.useRef(true)\n\n    const wrappedSelector = React.useCallback<typeof selector>(\n      {\n        [selector.name](state: TState) {\n          const selected = selector(state)\n          if (process.env.NODE_ENV !== 'production') {\n            const {\n              identityFunctionCheck: finalIdentityFunctionCheck,\n              stabilityCheck: finalStabilityCheck,\n            } = {\n              stabilityCheck,\n              identityFunctionCheck,\n              ...devModeChecks,\n            }\n            if (\n              finalStabilityCheck === 'always' ||\n              (finalStabilityCheck === 'once' && firstRun.current)\n            ) {\n              const toCompare = selector(state)\n              if (!equalityFn(selected, toCompare)) {\n                let stack: string | undefined = undefined\n                try {\n                  throw new Error()\n                } catch (e) {\n                  // eslint-disable-next-line no-extra-semi\n                  ;({ stack } = e as Error)\n                }\n                console.warn(\n                  'Selector ' +\n                    (selector.name || 'unknown') +\n                    ' returned a different result when called with the same parameters. This can lead to unnecessary rerenders.' +\n                    '\\nSelectors that return a new reference (such as an object or an array) should be memoized: https://redux.js.org/usage/deriving-data-selectors#optimizing-selectors-with-memoization',\n                  {\n                    state,\n                    selected,\n                    selected2: toCompare,\n                    stack,\n                  },\n                )\n              }\n            }\n            if (\n              finalIdentityFunctionCheck === 'always' ||\n              (finalIdentityFunctionCheck === 'once' && firstRun.current)\n            ) {\n              // @ts-ignore\n              if (selected === state) {\n                let stack: string | undefined = undefined\n                try {\n                  throw new Error()\n                } catch (e) {\n                  // eslint-disable-next-line no-extra-semi\n                  ;({ stack } = e as Error)\n                }\n                console.warn(\n                  'Selector ' +\n                    (selector.name || 'unknown') +\n                    ' returned the root state when called. This can lead to unnecessary rerenders.' +\n                    '\\nSelectors that return the entire state are almost certainly a mistake, as they will cause a rerender whenever *anything* in state changes.',\n                  { stack },\n                )\n              }\n            }\n            if (firstRun.current) firstRun.current = false\n          }\n          return selected\n        },\n      }[selector.name],\n      [selector, stabilityCheck, devModeChecks.stabilityCheck],\n    )\n\n    const selectedState = useSyncExternalStoreWithSelector(\n      subscription.addNestedSub,\n      store.getState,\n      getServerState || store.getState,\n      wrappedSelector,\n      equalityFn,\n    )\n\n    React.useDebugValue(selectedState)\n\n    return selectedState\n  }\n\n  Object.assign(useSelector, {\n    withTypes: () => useSelector,\n  })\n\n  return useSelector as UseSelector\n}\n\n/**\n * A hook to access the redux store's state. This hook takes a selector function\n * as an argument. The selector is called with the store state.\n *\n * This hook takes an optional equality comparison function as the second parameter\n * that allows you to customize the way the selected state is compared to determine\n * whether the component needs to be re-rendered.\n *\n * @param {Function} selector the selector function\n * @param {Function=} equalityFn the function that will be used to determine equality\n *\n * @returns {any} the selected state\n *\n * @example\n *\n * import React from 'react'\n * import { useSelector } from 'react-redux'\n *\n * export const CounterComponent = () => {\n *   const counter = useSelector(state => state.counter)\n *   return <div>{counter}</div>\n * }\n */\nexport const useSelector = /*#__PURE__*/ createSelectorHook()\n","import type { ElementType, MemoExoticComponent, ReactElement } from 'react'\n\n// Directly ported from:\n// https://unpkg.com/browse/react-is@18.3.0-canary-ee68446ff-20231115/cjs/react-is.production.js\n// It's very possible this could change in the future, but given that\n// we only use these in `connect`, this is a low priority.\n\nconst REACT_ELEMENT_TYPE = Symbol.for('react.element')\nconst REACT_PORTAL_TYPE = Symbol.for('react.portal')\nconst REACT_FRAGMENT_TYPE = Symbol.for('react.fragment')\nconst REACT_STRICT_MODE_TYPE = Symbol.for('react.strict_mode')\nconst REACT_PROFILER_TYPE = Symbol.for('react.profiler')\nconst REACT_PROVIDER_TYPE = Symbol.for('react.provider')\nconst REACT_CONTEXT_TYPE = Symbol.for('react.context')\nconst REACT_SERVER_CONTEXT_TYPE = Symbol.for('react.server_context')\nconst REACT_FORWARD_REF_TYPE = Symbol.for('react.forward_ref')\nconst REACT_SUSPENSE_TYPE = Symbol.for('react.suspense')\nconst REACT_SUSPENSE_LIST_TYPE = Symbol.for('react.suspense_list')\nconst REACT_MEMO_TYPE = Symbol.for('react.memo')\nconst REACT_LAZY_TYPE = Symbol.for('react.lazy')\nconst REACT_OFFSCREEN_TYPE = Symbol.for('react.offscreen')\nconst REACT_CLIENT_REFERENCE = Symbol.for('react.client.reference')\n\nexport const ForwardRef = REACT_FORWARD_REF_TYPE\nexport const Memo = REACT_MEMO_TYPE\n\nexport function isValidElementType(type: any): type is ElementType {\n  if (typeof type === 'string' || typeof type === 'function') {\n    return true\n  } // Note: typeof might be other than 'symbol' or 'number' (e.g. if it's a polyfill).\n\n  if (\n    type === REACT_FRAGMENT_TYPE ||\n    type === REACT_PROFILER_TYPE ||\n    type === REACT_STRICT_MODE_TYPE ||\n    type === REACT_SUSPENSE_TYPE ||\n    type === REACT_SUSPENSE_LIST_TYPE ||\n    type === REACT_OFFSCREEN_TYPE\n  ) {\n    return true\n  }\n\n  if (typeof type === 'object' && type !== null) {\n    if (\n      type.$$typeof === REACT_LAZY_TYPE ||\n      type.$$typeof === REACT_MEMO_TYPE ||\n      type.$$typeof === REACT_PROVIDER_TYPE ||\n      type.$$typeof === REACT_CONTEXT_TYPE ||\n      type.$$typeof === REACT_FORWARD_REF_TYPE || // This needs to include all possible module reference object\n      // types supported by any Flight configuration anywhere since\n      // we don't know which Flight build this will end up being used\n      // with.\n      type.$$typeof === REACT_CLIENT_REFERENCE ||\n      type.getModuleId !== undefined\n    ) {\n      return true\n    }\n  }\n\n  return false\n}\n\nfunction typeOf(object: any): symbol | undefined {\n  if (typeof object === 'object' && object !== null) {\n    const $$typeof = object.$$typeof\n\n    switch ($$typeof) {\n      case REACT_ELEMENT_TYPE: {\n        const type = object.type\n\n        switch (type) {\n          case REACT_FRAGMENT_TYPE:\n          case REACT_PROFILER_TYPE:\n          case REACT_STRICT_MODE_TYPE:\n          case REACT_SUSPENSE_TYPE:\n          case REACT_SUSPENSE_LIST_TYPE:\n            return type\n\n          default: {\n            const $$typeofType = type && type.$$typeof\n\n            switch ($$typeofType) {\n              case REACT_SERVER_CONTEXT_TYPE:\n              case REACT_CONTEXT_TYPE:\n              case REACT_FORWARD_REF_TYPE:\n              case REACT_LAZY_TYPE:\n              case REACT_MEMO_TYPE:\n              case REACT_PROVIDER_TYPE:\n                return $$typeofType\n\n              default:\n                return $$typeof\n            }\n          }\n        }\n      }\n\n      case REACT_PORTAL_TYPE: {\n        return $$typeof\n      }\n    }\n  }\n\n  return undefined\n}\n\nexport function isContextConsumer(object: any): object is ReactElement {\n  return typeOf(object) === REACT_CONTEXT_TYPE\n}\n\nexport function isMemo(object: any): object is MemoExoticComponent<any> {\n  return typeOf(object) === REACT_MEMO_TYPE\n}\n","import type { Dispatch, Action } from 'redux'\nimport type { ComponentType } from 'react'\nimport verifySubselectors from './verifySubselectors'\nimport type { EqualityFn, ExtendedEqualityFn } from '../types'\n\nexport type SelectorFactory<S, TProps, TOwnProps, TFactoryOptions> = (\n  dispatch: Dispatch<Action<string>>,\n  factoryOptions: TFactoryOptions\n) => Selector<S, TProps, TOwnProps>\n\nexport type Selector<S, TProps, TOwnProps = null> = TOwnProps extends\n  | null\n  | undefined\n  ? (state: S) => TProps\n  : (state: S, ownProps: TOwnProps) => TProps\n\nexport type MapStateToProps<TStateProps, TOwnProps, State> = (\n  state: State,\n  ownProps: TOwnProps\n) => TStateProps\n\nexport type MapStateToPropsFactory<TStateProps, TOwnProps, State> = (\n  initialState: State,\n  ownProps: TOwnProps\n) => MapStateToProps<TStateProps, TOwnProps, State>\n\nexport type MapStateToPropsParam<TStateProps, TOwnProps, State> =\n  | MapStateToPropsFactory<TStateProps, TOwnProps, State>\n  | MapStateToProps<TStateProps, TOwnProps, State>\n  | null\n  | undefined\n\nexport type MapDispatchToPropsFunction<TDispatchProps, TOwnProps> = (\n  dispatch: Dispatch<Action<string>>,\n  ownProps: TOwnProps\n) => TDispatchProps\n\nexport type MapDispatchToProps<TDispatchProps, TOwnProps> =\n  | MapDispatchToPropsFunction<TDispatchProps, TOwnProps>\n  | TDispatchProps\n\nexport type MapDispatchToPropsFactory<TDispatchProps, TOwnProps> = (\n  dispatch: Dispatch<Action<string>>,\n  ownProps: TOwnProps\n) => MapDispatchToPropsFunction<TDispatchProps, TOwnProps>\n\nexport type MapDispatchToPropsParam<TDispatchProps, TOwnProps> =\n  | MapDispatchToPropsFactory<TDispatchProps, TOwnProps>\n  | MapDispatchToProps<TDispatchProps, TOwnProps>\n\nexport type MapDispatchToPropsNonObject<TDispatchProps, TOwnProps> =\n  | MapDispatchToPropsFactory<TDispatchProps, TOwnProps>\n  | MapDispatchToPropsFunction<TDispatchProps, TOwnProps>\n\nexport type MergeProps<TStateProps, TDispatchProps, TOwnProps, TMergedProps> = (\n  stateProps: TStateProps,\n  dispatchProps: TDispatchProps,\n  ownProps: TOwnProps\n) => TMergedProps\n\ninterface PureSelectorFactoryComparisonOptions<TStateProps, TOwnProps, State> {\n  readonly areStatesEqual: ExtendedEqualityFn<State, TOwnProps>\n  readonly areStatePropsEqual: EqualityFn<TStateProps>\n  readonly areOwnPropsEqual: EqualityFn<TOwnProps>\n}\n\nexport function pureFinalPropsSelectorFactory<\n  TStateProps,\n  TOwnProps,\n  TDispatchProps,\n  TMergedProps,\n  State\n>(\n  mapStateToProps: WrappedMapStateToProps<TStateProps, TOwnProps, State>,\n  mapDispatchToProps: WrappedMapDispatchToProps<TDispatchProps, TOwnProps>,\n  mergeProps: MergeProps<TStateProps, TDispatchProps, TOwnProps, TMergedProps>,\n  dispatch: Dispatch<Action<string>>,\n  {\n    areStatesEqual,\n    areOwnPropsEqual,\n    areStatePropsEqual,\n  }: PureSelectorFactoryComparisonOptions<TStateProps, TOwnProps, State>,\n) {\n  let hasRunAtLeastOnce = false\n  let state: State\n  let ownProps: TOwnProps\n  let stateProps: TStateProps\n  let dispatchProps: TDispatchProps\n  let mergedProps: TMergedProps\n\n  function handleFirstCall(firstState: State, firstOwnProps: TOwnProps) {\n    state = firstState\n    ownProps = firstOwnProps\n    stateProps = mapStateToProps(state, ownProps)\n    dispatchProps = mapDispatchToProps(dispatch, ownProps)\n    mergedProps = mergeProps(stateProps, dispatchProps, ownProps)\n    hasRunAtLeastOnce = true\n    return mergedProps\n  }\n\n  function handleNewPropsAndNewState() {\n    stateProps = mapStateToProps(state, ownProps)\n\n    if (mapDispatchToProps.dependsOnOwnProps)\n      dispatchProps = mapDispatchToProps(dispatch, ownProps)\n\n    mergedProps = mergeProps(stateProps, dispatchProps, ownProps)\n    return mergedProps\n  }\n\n  function handleNewProps() {\n    if (mapStateToProps.dependsOnOwnProps)\n      stateProps = mapStateToProps(state, ownProps)\n\n    if (mapDispatchToProps.dependsOnOwnProps)\n      dispatchProps = mapDispatchToProps(dispatch, ownProps)\n\n    mergedProps = mergeProps(stateProps, dispatchProps, ownProps)\n    return mergedProps\n  }\n\n  function handleNewState() {\n    const nextStateProps = mapStateToProps(state, ownProps)\n    const statePropsChanged = !areStatePropsEqual(nextStateProps, stateProps)\n    stateProps = nextStateProps\n\n    if (statePropsChanged)\n      mergedProps = mergeProps(stateProps, dispatchProps, ownProps)\n\n    return mergedProps\n  }\n\n  function handleSubsequentCalls(nextState: State, nextOwnProps: TOwnProps) {\n    const propsChanged = !areOwnPropsEqual(nextOwnProps, ownProps)\n    const stateChanged = !areStatesEqual(\n      nextState,\n      state,\n      nextOwnProps,\n      ownProps,\n    )\n    state = nextState\n    ownProps = nextOwnProps\n\n    if (propsChanged && stateChanged) return handleNewPropsAndNewState()\n    if (propsChanged) return handleNewProps()\n    if (stateChanged) return handleNewState()\n    return mergedProps\n  }\n\n  return function pureFinalPropsSelector(\n    nextState: State,\n    nextOwnProps: TOwnProps,\n  ) {\n    return hasRunAtLeastOnce\n      ? handleSubsequentCalls(nextState, nextOwnProps)\n      : handleFirstCall(nextState, nextOwnProps)\n  }\n}\n\ninterface WrappedMapStateToProps<TStateProps, TOwnProps, State> {\n  (state: State, ownProps: TOwnProps): TStateProps\n  readonly dependsOnOwnProps: boolean\n}\n\ninterface WrappedMapDispatchToProps<TDispatchProps, TOwnProps> {\n  (dispatch: Dispatch<Action<string>>, ownProps: TOwnProps): TDispatchProps\n  readonly dependsOnOwnProps: boolean\n}\n\nexport interface InitOptions<TStateProps, TOwnProps, TMergedProps, State>\n  extends PureSelectorFactoryComparisonOptions<TStateProps, TOwnProps, State> {\n  readonly shouldHandleStateChanges: boolean\n  readonly displayName: string\n  readonly wrappedComponentName: string\n  readonly WrappedComponent: ComponentType<TOwnProps>\n  readonly areMergedPropsEqual: EqualityFn<TMergedProps>\n}\n\nexport interface SelectorFactoryOptions<\n  TStateProps,\n  TOwnProps,\n  TDispatchProps,\n  TMergedProps,\n  State\n> extends InitOptions<TStateProps, TOwnProps, TMergedProps, State> {\n  readonly initMapStateToProps: (\n    dispatch: Dispatch<Action<string>>,\n    options: InitOptions<TStateProps, TOwnProps, TMergedProps, State>\n  ) => WrappedMapStateToProps<TStateProps, TOwnProps, State>\n  readonly initMapDispatchToProps: (\n    dispatch: Dispatch<Action<string>>,\n    options: InitOptions<TStateProps, TOwnProps, TMergedProps, State>\n  ) => WrappedMapDispatchToProps<TDispatchProps, TOwnProps>\n  readonly initMergeProps: (\n    dispatch: Dispatch<Action<string>>,\n    options: InitOptions<TStateProps, TOwnProps, TMergedProps, State>\n  ) => MergeProps<TStateProps, TDispatchProps, TOwnProps, TMergedProps>\n}\n\n// TODO: Add more comments\n\n// The selector returned by selectorFactory will memoize its results,\n// allowing connect's shouldComponentUpdate to return false if final\n// props have not changed.\n\nexport default function finalPropsSelectorFactory<\n  TStateProps,\n  TOwnProps,\n  TDispatchProps,\n  TMergedProps,\n  State\n>(\n  dispatch: Dispatch<Action<string>>,\n  {\n    initMapStateToProps,\n    initMapDispatchToProps,\n    initMergeProps,\n    ...options\n  }: SelectorFactoryOptions<\n    TStateProps,\n    TOwnProps,\n    TDispatchProps,\n    TMergedProps,\n    State\n  >,\n) {\n  const mapStateToProps = initMapStateToProps(dispatch, options)\n  const mapDispatchToProps = initMapDispatchToProps(dispatch, options)\n  const mergeProps = initMergeProps(dispatch, options)\n\n  if (process.env.NODE_ENV !== 'production') {\n    verifySubselectors(mapStateToProps, mapDispatchToProps, mergeProps)\n  }\n\n  return pureFinalPropsSelectorFactory<\n    TStateProps,\n    TOwnProps,\n    TDispatchProps,\n    TMergedProps,\n    State\n  >(mapStateToProps, mapDispatchToProps, mergeProps, dispatch, options)\n}\n","import type { ActionCreatorsMapObject, Dispatch, ActionCreator } from 'redux'\n\nimport type { FixTypeLater } from '../types'\nimport verifyPlainObject from '../utils/verifyPlainObject'\n\ntype AnyState = { [key: string]: any }\ntype StateOrDispatch<S extends AnyState = AnyState> = S | Dispatch\n\ntype AnyProps = { [key: string]: any }\n\nexport type MapToProps<P extends AnyProps = AnyProps> = {\n  // eslint-disable-next-line no-unused-vars\n  (stateOrDispatch: StateOrDispatch, ownProps?: P): FixTypeLater\n  dependsOnOwnProps?: boolean\n}\n\nexport function wrapMapToPropsConstant(\n  // * Note:\n  //  It seems that the dispatch argument\n  //  could be a dispatch function in some cases (ex: whenMapDispatchToPropsIsMissing)\n  //  and a state object in some others (ex: whenMapStateToPropsIsMissing)\n  // eslint-disable-next-line no-unused-vars\n  getConstant: (dispatch: Dispatch) =>\n    | {\n        dispatch?: Dispatch\n        dependsOnOwnProps?: boolean\n      }\n    | ActionCreatorsMapObject\n    | ActionCreator<any>,\n) {\n  return function initConstantSelector(dispatch: Dispatch) {\n    const constant = getConstant(dispatch)\n\n    function constantSelector() {\n      return constant\n    }\n    constantSelector.dependsOnOwnProps = false\n    return constantSelector\n  }\n}\n\n// dependsOnOwnProps is used by createMapToPropsProxy to determine whether to pass props as args\n// to the mapToProps function being wrapped. It is also used by makePurePropsSelector to determine\n// whether mapToProps needs to be invoked when props have changed.\n//\n// A length of one signals that mapToProps does not depend on props from the parent component.\n// A length of zero is assumed to mean mapToProps is getting args via arguments or ...args and\n// therefore not reporting its length accurately..\n// TODO Can this get pulled out so that we can subscribe directly to the store if we don't need ownProps?\nexport function getDependsOnOwnProps(mapToProps: MapToProps) {\n  return mapToProps.dependsOnOwnProps\n    ? Boolean(mapToProps.dependsOnOwnProps)\n    : mapToProps.length !== 1\n}\n\n// Used by whenMapStateToPropsIsFunction and whenMapDispatchToPropsIsFunction,\n// this function wraps mapToProps in a proxy function which does several things:\n//\n//  * Detects whether the mapToProps function being called depends on props, which\n//    is used by selectorFactory to decide if it should reinvoke on props changes.\n//\n//  * On first call, handles mapToProps if returns another function, and treats that\n//    new function as the true mapToProps for subsequent calls.\n//\n//  * On first call, verifies the first result is a plain object, in order to warn\n//    the developer that their mapToProps function is not returning a valid result.\n//\nexport function wrapMapToPropsFunc<P extends AnyProps = AnyProps>(\n  mapToProps: MapToProps,\n  methodName: string,\n) {\n  return function initProxySelector(\n    dispatch: Dispatch,\n    { displayName }: { displayName: string },\n  ) {\n    const proxy = function mapToPropsProxy(\n      stateOrDispatch: StateOrDispatch,\n      ownProps?: P,\n    ): MapToProps {\n      return proxy.dependsOnOwnProps\n        ? proxy.mapToProps(stateOrDispatch, ownProps)\n        : proxy.mapToProps(stateOrDispatch, undefined)\n    }\n\n    // allow detectFactoryAndVerify to get ownProps\n    proxy.dependsOnOwnProps = true\n\n    proxy.mapToProps = function detectFactoryAndVerify(\n      stateOrDispatch: StateOrDispatch,\n      ownProps?: P,\n    ): MapToProps {\n      proxy.mapToProps = mapToProps\n      proxy.dependsOnOwnProps = getDependsOnOwnProps(mapToProps)\n      let props = proxy(stateOrDispatch, ownProps)\n\n      if (typeof props === 'function') {\n        proxy.mapToProps = props\n        proxy.dependsOnOwnProps = getDependsOnOwnProps(props)\n        props = proxy(stateOrDispatch, ownProps)\n      }\n\n      if (process.env.NODE_ENV !== 'production')\n        verifyPlainObject(props, displayName, methodName)\n\n      return props\n    }\n\n    return proxy\n  }\n}\n","import type { Action, Dispatch } from 'redux'\n\nexport function createInvalidArgFactory(arg: unknown, name: string) {\n  return (\n    dispatch: Dispatch<Action<string>>,\n    options: { readonly wrappedComponentName: string },\n  ) => {\n    throw new Error(\n      `Invalid value of type ${typeof arg} for ${name} argument when connecting component ${\n        options.wrappedComponentName\n      }.`,\n    )\n  }\n}\n","import type { Action, Dispatch } from 'redux'\nimport verifyPlainObject from '../utils/verifyPlainObject'\nimport { createInvalidArgFactory } from './invalidArgFactory'\nimport type { MergeProps } from './selectorFactory'\nimport type { EqualityFn } from '../types'\n\nexport function defaultMergeProps<\n  TStateProps,\n  TDispatchProps,\n  TOwnProps,\n  TMergedProps\n>(\n  stateProps: TStateProps,\n  dispatchProps: TDispatchProps,\n  ownProps: TOwnProps,\n): TMergedProps {\n  // @ts-ignore\n  return { ...ownProps, ...stateProps, ...dispatchProps }\n}\n\nexport function wrapMergePropsFunc<\n  TStateProps,\n  TDispatchProps,\n  TOwnProps,\n  TMergedProps\n>(\n  mergeProps: MergeProps<TStateProps, TDispatchProps, TOwnProps, TMergedProps>,\n): (\n  dispatch: Dispatch<Action<string>>,\n  options: {\n    readonly displayName: string\n    readonly areMergedPropsEqual: EqualityFn<TMergedProps>\n  }\n) => MergeProps<TStateProps, TDispatchProps, TOwnProps, TMergedProps> {\n  return function initMergePropsProxy(\n    dispatch,\n    { displayName, areMergedPropsEqual },\n  ) {\n    let hasRunOnce = false\n    let mergedProps: TMergedProps\n\n    return function mergePropsProxy(\n      stateProps: TStateProps,\n      dispatchProps: TDispatchProps,\n      ownProps: TOwnProps,\n    ) {\n      const nextMergedProps = mergeProps(stateProps, dispatchProps, ownProps)\n\n      if (hasRunOnce) {\n        if (!areMergedPropsEqual(nextMergedProps, mergedProps))\n          mergedProps = nextMergedProps\n      } else {\n        hasRunOnce = true\n        mergedProps = nextMergedProps\n\n        if (process.env.NODE_ENV !== 'production')\n          verifyPlainObject(mergedProps, displayName, 'mergeProps')\n      }\n\n      return mergedProps\n    }\n  }\n}\n\nexport function mergePropsFactory<\n  TStateProps,\n  TDispatchProps,\n  TOwnProps,\n  TMergedProps\n>(\n  mergeProps?: MergeProps<TStateProps, TDispatchProps, TOwnProps, TMergedProps>,\n) {\n  return !mergeProps\n    ? () => defaultMergeProps\n    : typeof mergeProps === 'function'\n    ? wrapMergePropsFunc(mergeProps)\n    : createInvalidArgFactory(mergeProps, 'mergeProps')\n}\n","// Default to a dummy \"batch\" implementation that just runs the callback\nexport function defaultNoopBatch(callback: () => void) {\n  callback()\n}\n","import { defaultNoopBatch as batch } from './batch'\n\n// encapsulates the subscription logic for connecting a component to the redux store, as\n// well as nesting subscriptions of descendant components, so that we can ensure the\n// ancestor components re-render before descendants\n\ntype VoidFunc = () => void\n\ntype Listener = {\n  callback: VoidFunc\n  next: Listener | null\n  prev: Listener | null\n}\n\nfunction createListenerCollection() {\n  let first: Listener | null = null\n  let last: Listener | null = null\n\n  return {\n    clear() {\n      first = null\n      last = null\n    },\n\n    notify() {\n      batch(() => {\n        let listener = first\n        while (listener) {\n          listener.callback()\n          listener = listener.next\n        }\n      })\n    },\n\n    get() {\n      const listeners: Listener[] = []\n      let listener = first\n      while (listener) {\n        listeners.push(listener)\n        listener = listener.next\n      }\n      return listeners\n    },\n\n    subscribe(callback: () => void) {\n      let isSubscribed = true\n\n      const listener: Listener = (last = {\n        callback,\n        next: null,\n        prev: last,\n      })\n\n      if (listener.prev) {\n        listener.prev.next = listener\n      } else {\n        first = listener\n      }\n\n      return function unsubscribe() {\n        if (!isSubscribed || first === null) return\n        isSubscribed = false\n\n        if (listener.next) {\n          listener.next.prev = listener.prev\n        } else {\n          last = listener.prev\n        }\n        if (listener.prev) {\n          listener.prev.next = listener.next\n        } else {\n          first = listener.next\n        }\n      }\n    },\n  }\n}\n\ntype ListenerCollection = ReturnType<typeof createListenerCollection>\n\nexport interface Subscription {\n  addNestedSub: (listener: VoidFunc) => VoidFunc\n  notifyNestedSubs: VoidFunc\n  handleChangeWrapper: VoidFunc\n  isSubscribed: () => boolean\n  onStateChange?: VoidFunc | null\n  trySubscribe: VoidFunc\n  tryUnsubscribe: VoidFunc\n  getListeners: () => ListenerCollection\n}\n\nconst nullListeners = {\n  notify() {},\n  get: () => [],\n} as unknown as ListenerCollection\n\nexport function createSubscription(store: any, parentSub?: Subscription) {\n  let unsubscribe: VoidFunc | undefined\n  let listeners: ListenerCollection = nullListeners\n\n  // Reasons to keep the subscription active\n  let subscriptionsAmount = 0\n\n  // Is this specific subscription subscribed (or only nested ones?)\n  let selfSubscribed = false\n\n  function addNestedSub(listener: () => void) {\n    trySubscribe()\n\n    const cleanupListener = listeners.subscribe(listener)\n\n    // cleanup nested sub\n    let removed = false\n    return () => {\n      if (!removed) {\n        removed = true\n        cleanupListener()\n        tryUnsubscribe()\n      }\n    }\n  }\n\n  function notifyNestedSubs() {\n    listeners.notify()\n  }\n\n  function handleChangeWrapper() {\n    if (subscription.onStateChange) {\n      subscription.onStateChange()\n    }\n  }\n\n  function isSubscribed() {\n    return selfSubscribed\n  }\n\n  function trySubscribe() {\n    subscriptionsAmount++\n    if (!unsubscribe) {\n      unsubscribe = parentSub\n        ? parentSub.addNestedSub(handleChangeWrapper)\n        : store.subscribe(handleChangeWrapper)\n\n      listeners = createListenerCollection()\n    }\n  }\n\n  function tryUnsubscribe() {\n    subscriptionsAmount--\n    if (unsubscribe && subscriptionsAmount === 0) {\n      unsubscribe()\n      unsubscribe = undefined\n      listeners.clear()\n      listeners = nullListeners\n    }\n  }\n\n  function trySubscribeSelf() {\n    if (!selfSubscribed) {\n      selfSubscribed = true\n      trySubscribe()\n    }\n  }\n\n  function tryUnsubscribeSelf() {\n    if (selfSubscribed) {\n      selfSubscribed = false\n      tryUnsubscribe()\n    }\n  }\n\n  const subscription: Subscription = {\n    addNestedSub,\n    notifyNestedSubs,\n    handleChangeWrapper,\n    isSubscribed,\n    trySubscribe: trySubscribeSelf,\n    tryUnsubscribe: tryUnsubscribeSelf,\n    getListeners: () => listeners,\n  }\n\n  return subscription\n}\n","import { React } from '../utils/react'\n\n// React currently throws a warning when using useLayoutEffect on the server.\n// To get around it, we can conditionally useEffect on the server (no-op) and\n// useLayoutEffect in the browser. We need useLayoutEffect to ensure the store\n// subscription callback always has the selector from the latest render commit\n// available, otherwise a store update may happen between render and the effect,\n// which may cause missed updates; we also must ensure the store subscription\n// is created synchronously, otherwise a store update may occur before the\n// subscription is created and an inconsistent state may be observed\n\n// Matches logic in React's `shared/ExecutionEnvironment` file\nexport const canUseDOM = !!(\n  typeof window !== 'undefined' &&\n  typeof window.document !== 'undefined' &&\n  typeof window.document.createElement !== 'undefined'\n)\n\nexport const useIsomorphicLayoutEffect = canUseDOM\n  ? React.useLayoutEffect\n  : React.useEffect\n","function is(x: unknown, y: unknown) {\n  if (x === y) {\n    return x !== 0 || y !== 0 || 1 / x === 1 / y\n  } else {\n    return x !== x && y !== y\n  }\n}\n\nexport default function shallowEqual(objA: any, objB: any) {\n  if (is(objA, objB)) return true\n\n  if (\n    typeof objA !== 'object' ||\n    objA === null ||\n    typeof objB !== 'object' ||\n    objB === null\n  ) {\n    return false\n  }\n\n  const keysA = Object.keys(objA)\n  const keysB = Object.keys(objB)\n\n  if (keysA.length !== keysB.length) return false\n\n  for (let i = 0; i < keysA.length; i++) {\n    if (\n      !Object.prototype.hasOwnProperty.call(objB, keysA[i]) ||\n      !is(objA[keysA[i]], objB[keysA[i]])\n    ) {\n      return false\n    }\n  }\n\n  return true\n}\n","// Copied directly from:\n// https://github.com/mridgway/hoist-non-react-statics/blob/main/src/index.js\n// https://unpkg.com/browse/@types/hoist-non-react-statics@3.3.1/index.d.ts\n\n/**\n * Copyright 2015, Yahoo! Inc.\n * Copyrights licensed under the New BSD License. See the accompanying LICENSE file for terms.\n */\nimport type * as React from 'react'\nimport { ForwardRef, Memo, isMemo } from '../utils/react-is'\n\nconst REACT_STATICS = {\n  childContextTypes: true,\n  contextType: true,\n  contextTypes: true,\n  defaultProps: true,\n  displayName: true,\n  getDefaultProps: true,\n  getDerivedStateFromError: true,\n  getDerivedStateFromProps: true,\n  mixins: true,\n  propTypes: true,\n  type: true,\n} as const\n\nconst KNOWN_STATICS = {\n  name: true,\n  length: true,\n  prototype: true,\n  caller: true,\n  callee: true,\n  arguments: true,\n  arity: true,\n} as const\n\nconst FORWARD_REF_STATICS = {\n  $$typeof: true,\n  render: true,\n  defaultProps: true,\n  displayName: true,\n  propTypes: true,\n} as const\n\nconst MEMO_STATICS = {\n  $$typeof: true,\n  compare: true,\n  defaultProps: true,\n  displayName: true,\n  propTypes: true,\n  type: true,\n} as const\n\nconst TYPE_STATICS = {\n  [ForwardRef]: FORWARD_REF_STATICS,\n  [Memo]: MEMO_STATICS,\n} as const\n\nfunction getStatics(component: any) {\n  // React v16.11 and below\n  if (isMemo(component)) {\n    return MEMO_STATICS\n  }\n\n  // React v16.12 and above\n  return TYPE_STATICS[component['$$typeof']] || REACT_STATICS\n}\n\nexport type NonReactStatics<\n  S extends React.ComponentType<any>,\n  C extends {\n    [key: string]: true\n  } = {}\n> = {\n  [key in Exclude<\n    keyof S,\n    S extends React.MemoExoticComponent<any>\n      ? keyof typeof MEMO_STATICS | keyof C\n      : S extends React.ForwardRefExoticComponent<any>\n      ? keyof typeof FORWARD_REF_STATICS | keyof C\n      : keyof typeof REACT_STATICS | keyof typeof KNOWN_STATICS | keyof C\n  >]: S[key]\n}\n\nconst defineProperty = Object.defineProperty\nconst getOwnPropertyNames = Object.getOwnPropertyNames\nconst getOwnPropertySymbols = Object.getOwnPropertySymbols\nconst getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor\nconst getPrototypeOf = Object.getPrototypeOf\nconst objectPrototype = Object.prototype\n\nexport default function hoistNonReactStatics<\n  T extends React.ComponentType<any>,\n  S extends React.ComponentType<any>,\n  C extends {\n    [key: string]: true\n  } = {}\n>(targetComponent: T, sourceComponent: S): T & NonReactStatics<S, C> {\n  if (typeof sourceComponent !== 'string') {\n    // don't hoist over string (html) components\n\n    if (objectPrototype) {\n      const inheritedComponent = getPrototypeOf(sourceComponent)\n      if (inheritedComponent && inheritedComponent !== objectPrototype) {\n        hoistNonReactStatics(targetComponent, inheritedComponent)\n      }\n    }\n\n    let keys: (string | symbol)[] = getOwnPropertyNames(sourceComponent)\n\n    if (getOwnPropertySymbols) {\n      keys = keys.concat(getOwnPropertySymbols(sourceComponent))\n    }\n\n    const targetStatics = getStatics(targetComponent)\n    const sourceStatics = getStatics(sourceComponent)\n\n    for (let i = 0; i < keys.length; ++i) {\n      const key = keys[i]\n      if (\n        !KNOWN_STATICS[key as keyof typeof KNOWN_STATICS] &&\n        !(sourceStatics && sourceStatics[key as keyof typeof sourceStatics]) &&\n        !(targetStatics && targetStatics[key as keyof typeof targetStatics])\n      ) {\n        const descriptor = getOwnPropertyDescriptor(sourceComponent, key)\n        try {\n          // Avoid failures from read-only properties\n          defineProperty(targetComponent, key, descriptor!)\n        } catch (e) {\n          // ignore\n        }\n      }\n    }\n  }\n\n  return targetComponent as any\n}\n","/* eslint-disable valid-jsdoc, @typescript-eslint/no-unused-vars */\nimport type { ComponentType } from 'react'\nimport { React } from '../utils/react'\nimport { isValidElementType, isContextConsumer } from '../utils/react-is'\n\nimport type { Store } from 'redux'\n\nimport type {\n  ConnectedComponent,\n  InferableComponentEnhancer,\n  InferableComponentEnhancerWithProps,\n  ResolveThunks,\n  DispatchProp,\n  ConnectPropsMaybeWithoutContext,\n} from '../types'\n\nimport type {\n  MapStateToPropsParam,\n  MapDispatchToPropsParam,\n  MergeProps,\n  MapDispatchToPropsNonObject,\n  SelectorFactoryOptions,\n} from '../connect/selectorFactory'\nimport defaultSelectorFactory from '../connect/selectorFactory'\nimport { mapDispatchToPropsFactory } from '../connect/mapDispatchToProps'\nimport { mapStateToPropsFactory } from '../connect/mapStateToProps'\nimport { mergePropsFactory } from '../connect/mergeProps'\n\nimport type { Subscription } from '../utils/Subscription'\nimport { createSubscription } from '../utils/Subscription'\nimport { useIsomorphicLayoutEffect } from '../utils/useIsomorphicLayoutEffect'\nimport shallowEqual from '../utils/shallowEqual'\nimport hoistStatics from '../utils/hoistStatics'\nimport warning from '../utils/warning'\n\nimport type {\n  ReactReduxContextValue,\n  ReactReduxContextInstance,\n} from './Context'\nimport { ReactReduxContext } from './Context'\n\nimport type { uSES } from '../utils/useSyncExternalStore'\nimport { notInitialized } from '../utils/useSyncExternalStore'\n\nlet useSyncExternalStore = notInitialized as uSES\nexport const initializeConnect = (fn: uSES) => {\n  useSyncExternalStore = fn\n}\n\n// Define some constant arrays just to avoid re-creating these\nconst EMPTY_ARRAY: [unknown, number] = [null, 0]\nconst NO_SUBSCRIPTION_ARRAY = [null, null]\n\n// Attempts to stringify whatever not-really-a-component value we were given\n// for logging in an error message\nconst stringifyComponent = (Comp: unknown) => {\n  try {\n    return JSON.stringify(Comp)\n  } catch (err) {\n    return String(Comp)\n  }\n}\n\ntype EffectFunc = (...args: any[]) => void | ReturnType<React.EffectCallback>\n\n// This is \"just\" a `useLayoutEffect`, but with two modifications:\n// - we need to fall back to `useEffect` in SSR to avoid annoying warnings\n// - we extract this to a separate function to avoid closing over values\n//   and causing memory leaks\nfunction useIsomorphicLayoutEffectWithArgs(\n  effectFunc: EffectFunc,\n  effectArgs: any[],\n  dependencies?: React.DependencyList,\n) {\n  useIsomorphicLayoutEffect(() => effectFunc(...effectArgs), dependencies)\n}\n\n// Effect callback, extracted: assign the latest props values to refs for later usage\nfunction captureWrapperProps(\n  lastWrapperProps: React.MutableRefObject<unknown>,\n  lastChildProps: React.MutableRefObject<unknown>,\n  renderIsScheduled: React.MutableRefObject<boolean>,\n  wrapperProps: unknown,\n  // actualChildProps: unknown,\n  childPropsFromStoreUpdate: React.MutableRefObject<unknown>,\n  notifyNestedSubs: () => void,\n) {\n  // We want to capture the wrapper props and child props we used for later comparisons\n  lastWrapperProps.current = wrapperProps\n  renderIsScheduled.current = false\n\n  // If the render was from a store update, clear out that reference and cascade the subscriber update\n  if (childPropsFromStoreUpdate.current) {\n    childPropsFromStoreUpdate.current = null\n    notifyNestedSubs()\n  }\n}\n\n// Effect callback, extracted: subscribe to the Redux store or nearest connected ancestor,\n// check for updates after dispatched actions, and trigger re-renders.\nfunction subscribeUpdates(\n  shouldHandleStateChanges: boolean,\n  store: Store,\n  subscription: Subscription,\n  childPropsSelector: (state: unknown, props: unknown) => unknown,\n  lastWrapperProps: React.MutableRefObject<unknown>,\n  lastChildProps: React.MutableRefObject<unknown>,\n  renderIsScheduled: React.MutableRefObject<boolean>,\n  isMounted: React.MutableRefObject<boolean>,\n  childPropsFromStoreUpdate: React.MutableRefObject<unknown>,\n  notifyNestedSubs: () => void,\n  // forceComponentUpdateDispatch: React.Dispatch<any>,\n  additionalSubscribeListener: () => void,\n) {\n  // If we're not subscribed to the store, nothing to do here\n  if (!shouldHandleStateChanges) return () => {}\n\n  // Capture values for checking if and when this component unmounts\n  let didUnsubscribe = false\n  let lastThrownError: Error | null = null\n\n  // We'll run this callback every time a store subscription update propagates to this component\n  const checkForUpdates = () => {\n    if (didUnsubscribe || !isMounted.current) {\n      // Don't run stale listeners.\n      // Redux doesn't guarantee unsubscriptions happen until next dispatch.\n      return\n    }\n\n    // TODO We're currently calling getState ourselves here, rather than letting `uSES` do it\n    const latestStoreState = store.getState()\n\n    let newChildProps, error\n    try {\n      // Actually run the selector with the most recent store state and wrapper props\n      // to determine what the child props should be\n      newChildProps = childPropsSelector(\n        latestStoreState,\n        lastWrapperProps.current,\n      )\n    } catch (e) {\n      error = e\n      lastThrownError = e as Error | null\n    }\n\n    if (!error) {\n      lastThrownError = null\n    }\n\n    // If the child props haven't changed, nothing to do here - cascade the subscription update\n    if (newChildProps === lastChildProps.current) {\n      if (!renderIsScheduled.current) {\n        notifyNestedSubs()\n      }\n    } else {\n      // Save references to the new child props.  Note that we track the \"child props from store update\"\n      // as a ref instead of a useState/useReducer because we need a way to determine if that value has\n      // been processed.  If this went into useState/useReducer, we couldn't clear out the value without\n      // forcing another re-render, which we don't want.\n      lastChildProps.current = newChildProps\n      childPropsFromStoreUpdate.current = newChildProps\n      renderIsScheduled.current = true\n\n      // TODO This is hacky and not how `uSES` is meant to be used\n      // Trigger the React `useSyncExternalStore` subscriber\n      additionalSubscribeListener()\n    }\n  }\n\n  // Actually subscribe to the nearest connected ancestor (or store)\n  subscription.onStateChange = checkForUpdates\n  subscription.trySubscribe()\n\n  // Pull data from the store after first render in case the store has\n  // changed since we began.\n  checkForUpdates()\n\n  const unsubscribeWrapper = () => {\n    didUnsubscribe = true\n    subscription.tryUnsubscribe()\n    subscription.onStateChange = null\n\n    if (lastThrownError) {\n      // It's possible that we caught an error due to a bad mapState function, but the\n      // parent re-rendered without this component and we're about to unmount.\n      // This shouldn't happen as long as we do top-down subscriptions correctly, but\n      // if we ever do those wrong, this throw will surface the error in our tests.\n      // In that case, throw the error from here so it doesn't get lost.\n      throw lastThrownError\n    }\n  }\n\n  return unsubscribeWrapper\n}\n\n// Reducer initial state creation for our update reducer\nconst initStateUpdates = () => EMPTY_ARRAY\n\nexport interface ConnectProps {\n  /** A custom Context instance that the component can use to access the store from an alternate Provider using that same Context instance */\n  context?: ReactReduxContextInstance\n  /** A Redux store instance to be used for subscriptions instead of the store from a Provider */\n  store?: Store\n}\n\ninterface InternalConnectProps extends ConnectProps {\n  reactReduxForwardedRef?: React.ForwardedRef<unknown>\n}\n\nfunction strictEqual(a: unknown, b: unknown) {\n  return a === b\n}\n\n/**\n * Infers the type of props that a connector will inject into a component.\n */\nexport type ConnectedProps<TConnector> =\n  TConnector extends InferableComponentEnhancerWithProps<\n    infer TInjectedProps,\n    any\n  >\n    ? unknown extends TInjectedProps\n      ? TConnector extends InferableComponentEnhancer<infer TInjectedProps>\n        ? TInjectedProps\n        : never\n      : TInjectedProps\n    : never\n\nexport interface ConnectOptions<\n  State = unknown,\n  TStateProps = {},\n  TOwnProps = {},\n  TMergedProps = {}\n> {\n  forwardRef?: boolean\n  context?: typeof ReactReduxContext\n  areStatesEqual?: (\n    nextState: State,\n    prevState: State,\n    nextOwnProps: TOwnProps,\n    prevOwnProps: TOwnProps\n  ) => boolean\n\n  areOwnPropsEqual?: (\n    nextOwnProps: TOwnProps,\n    prevOwnProps: TOwnProps\n  ) => boolean\n\n  areStatePropsEqual?: (\n    nextStateProps: TStateProps,\n    prevStateProps: TStateProps\n  ) => boolean\n  areMergedPropsEqual?: (\n    nextMergedProps: TMergedProps,\n    prevMergedProps: TMergedProps\n  ) => boolean\n}\n\n/**\n * Connects a React component to a Redux store.\n *\n * - Without arguments, just wraps the component, without changing the behavior / props\n *\n * - If 2 params are passed (3rd param, mergeProps, is skipped), default behavior\n * is to override ownProps (as stated in the docs), so what remains is everything that's\n * not a state or dispatch prop\n *\n * - When 3rd param is passed, we don't know if ownProps propagate and whether they\n * should be valid component props, because it depends on mergeProps implementation.\n * As such, it is the user's responsibility to extend ownProps interface from state or\n * dispatch props or both when applicable\n *\n * @param mapStateToProps\n * @param mapDispatchToProps\n * @param mergeProps\n * @param options\n */\nexport interface Connect<DefaultState = unknown> {\n  // tslint:disable:no-unnecessary-generics\n  (): InferableComponentEnhancer<DispatchProp>\n\n  /** mapState only */\n  <TStateProps = {}, no_dispatch = {}, TOwnProps = {}, State = DefaultState>(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>\n  ): InferableComponentEnhancerWithProps<TStateProps & DispatchProp, TOwnProps>\n\n  /** mapDispatch only (as a function) */\n  <no_state = {}, TDispatchProps = {}, TOwnProps = {}>(\n    mapStateToProps: null | undefined,\n    mapDispatchToProps: MapDispatchToPropsNonObject<TDispatchProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<TDispatchProps, TOwnProps>\n\n  /** mapDispatch only (as an object) */\n  <no_state = {}, TDispatchProps = {}, TOwnProps = {}>(\n    mapStateToProps: null | undefined,\n    mapDispatchToProps: MapDispatchToPropsParam<TDispatchProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<\n    ResolveThunks<TDispatchProps>,\n    TOwnProps\n  >\n\n  /** mapState and mapDispatch (as a function)*/\n  <TStateProps = {}, TDispatchProps = {}, TOwnProps = {}, State = DefaultState>(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n    mapDispatchToProps: MapDispatchToPropsNonObject<TDispatchProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<\n    TStateProps & TDispatchProps,\n    TOwnProps\n  >\n\n  /** mapState and mapDispatch (nullish) */\n  <TStateProps = {}, TDispatchProps = {}, TOwnProps = {}, State = DefaultState>(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n    mapDispatchToProps: null | undefined\n  ): InferableComponentEnhancerWithProps<TStateProps, TOwnProps>\n\n  /** mapState and mapDispatch (as an object) */\n  <TStateProps = {}, TDispatchProps = {}, TOwnProps = {}, State = DefaultState>(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n    mapDispatchToProps: MapDispatchToPropsParam<TDispatchProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<\n    TStateProps & ResolveThunks<TDispatchProps>,\n    TOwnProps\n  >\n\n  /** mergeProps only */\n  <no_state = {}, no_dispatch = {}, TOwnProps = {}, TMergedProps = {}>(\n    mapStateToProps: null | undefined,\n    mapDispatchToProps: null | undefined,\n    mergeProps: MergeProps<undefined, DispatchProp, TOwnProps, TMergedProps>\n  ): InferableComponentEnhancerWithProps<TMergedProps, TOwnProps>\n\n  /** mapState and mergeProps */\n  <\n    TStateProps = {},\n    no_dispatch = {},\n    TOwnProps = {},\n    TMergedProps = {},\n    State = DefaultState\n  >(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n    mapDispatchToProps: null | undefined,\n    mergeProps: MergeProps<TStateProps, DispatchProp, TOwnProps, TMergedProps>\n  ): InferableComponentEnhancerWithProps<TMergedProps, TOwnProps>\n\n  /** mapDispatch (as a object) and mergeProps */\n  <no_state = {}, TDispatchProps = {}, TOwnProps = {}, TMergedProps = {}>(\n    mapStateToProps: null | undefined,\n    mapDispatchToProps: MapDispatchToPropsParam<TDispatchProps, TOwnProps>,\n    mergeProps: MergeProps<undefined, TDispatchProps, TOwnProps, TMergedProps>\n  ): InferableComponentEnhancerWithProps<TMergedProps, TOwnProps>\n\n  /** mapState and options */\n  <TStateProps = {}, no_dispatch = {}, TOwnProps = {}, State = DefaultState>(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n    mapDispatchToProps: null | undefined,\n    mergeProps: null | undefined,\n    options: ConnectOptions<State, TStateProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<DispatchProp & TStateProps, TOwnProps>\n\n  /** mapDispatch (as a function) and options */\n  <TStateProps = {}, TDispatchProps = {}, TOwnProps = {}>(\n    mapStateToProps: null | undefined,\n    mapDispatchToProps: MapDispatchToPropsNonObject<TDispatchProps, TOwnProps>,\n    mergeProps: null | undefined,\n    options: ConnectOptions<{}, TStateProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<TDispatchProps, TOwnProps>\n\n  /** mapDispatch (as an object) and options*/\n  <TStateProps = {}, TDispatchProps = {}, TOwnProps = {}>(\n    mapStateToProps: null | undefined,\n    mapDispatchToProps: MapDispatchToPropsParam<TDispatchProps, TOwnProps>,\n    mergeProps: null | undefined,\n    options: ConnectOptions<{}, TStateProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<\n    ResolveThunks<TDispatchProps>,\n    TOwnProps\n  >\n\n  /** mapState,  mapDispatch (as a function), and options */\n  <TStateProps = {}, TDispatchProps = {}, TOwnProps = {}, State = DefaultState>(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n    mapDispatchToProps: MapDispatchToPropsNonObject<TDispatchProps, TOwnProps>,\n    mergeProps: null | undefined,\n    options: ConnectOptions<State, TStateProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<\n    TStateProps & TDispatchProps,\n    TOwnProps\n  >\n\n  /** mapState,  mapDispatch (as an object), and options */\n  <TStateProps = {}, TDispatchProps = {}, TOwnProps = {}, State = DefaultState>(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n    mapDispatchToProps: MapDispatchToPropsParam<TDispatchProps, TOwnProps>,\n    mergeProps: null | undefined,\n    options: ConnectOptions<State, TStateProps, TOwnProps>\n  ): InferableComponentEnhancerWithProps<\n    TStateProps & ResolveThunks<TDispatchProps>,\n    TOwnProps\n  >\n\n  /** mapState, mapDispatch, mergeProps, and options */\n  <\n    TStateProps = {},\n    TDispatchProps = {},\n    TOwnProps = {},\n    TMergedProps = {},\n    State = DefaultState\n  >(\n    mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n    mapDispatchToProps: MapDispatchToPropsParam<TDispatchProps, TOwnProps>,\n    mergeProps: MergeProps<\n      TStateProps,\n      TDispatchProps,\n      TOwnProps,\n      TMergedProps\n    >,\n    options?: ConnectOptions<State, TStateProps, TOwnProps, TMergedProps>\n  ): InferableComponentEnhancerWithProps<TMergedProps, TOwnProps>\n  // tslint:enable:no-unnecessary-generics\n}\n\nlet hasWarnedAboutDeprecatedPureOption = false\n\n/**\n * Connects a React component to a Redux store.\n *\n * - Without arguments, just wraps the component, without changing the behavior / props\n *\n * - If 2 params are passed (3rd param, mergeProps, is skipped), default behavior\n * is to override ownProps (as stated in the docs), so what remains is everything that's\n * not a state or dispatch prop\n *\n * - When 3rd param is passed, we don't know if ownProps propagate and whether they\n * should be valid component props, because it depends on mergeProps implementation.\n * As such, it is the user's responsibility to extend ownProps interface from state or\n * dispatch props or both when applicable\n *\n * @param mapStateToProps A function that extracts values from state\n * @param mapDispatchToProps Setup for dispatching actions\n * @param mergeProps Optional callback to merge state and dispatch props together\n * @param options Options for configuring the connection\n *\n */\nfunction connect<\n  TStateProps = {},\n  TDispatchProps = {},\n  TOwnProps = {},\n  TMergedProps = {},\n  State = unknown\n>(\n  mapStateToProps?: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n  mapDispatchToProps?: MapDispatchToPropsParam<TDispatchProps, TOwnProps>,\n  mergeProps?: MergeProps<TStateProps, TDispatchProps, TOwnProps, TMergedProps>,\n  {\n    // The `pure` option has been removed, so TS doesn't like us destructuring this to check its existence.\n    // @ts-ignore\n    pure,\n    areStatesEqual = strictEqual,\n    areOwnPropsEqual = shallowEqual,\n    areStatePropsEqual = shallowEqual,\n    areMergedPropsEqual = shallowEqual,\n\n    // use React's forwardRef to expose a ref of the wrapped component\n    forwardRef = false,\n\n    // the context consumer to use\n    context = ReactReduxContext,\n  }: ConnectOptions<unknown, unknown, unknown, unknown> = {},\n): unknown {\n  if (process.env.NODE_ENV !== 'production') {\n    if (pure !== undefined && !hasWarnedAboutDeprecatedPureOption) {\n      hasWarnedAboutDeprecatedPureOption = true\n      warning(\n        'The `pure` option has been removed. `connect` is now always a \"pure/memoized\" component',\n      )\n    }\n  }\n\n  const Context = context\n\n  const initMapStateToProps = mapStateToPropsFactory(mapStateToProps)\n  const initMapDispatchToProps = mapDispatchToPropsFactory(mapDispatchToProps)\n  const initMergeProps = mergePropsFactory(mergeProps)\n\n  const shouldHandleStateChanges = Boolean(mapStateToProps)\n\n  const wrapWithConnect = <TProps,>(\n    WrappedComponent: ComponentType<TProps>,\n  ) => {\n    type WrappedComponentProps = TProps &\n      ConnectPropsMaybeWithoutContext<TProps>\n\n    if (process.env.NODE_ENV !== 'production') {\n      const isValid = /*#__PURE__*/ isValidElementType(WrappedComponent)\n      if (!isValid)\n        throw new Error(\n          `You must pass a component to the function returned by connect. Instead received ${stringifyComponent(\n            WrappedComponent,\n          )}`,\n        )\n    }\n\n    const wrappedComponentName =\n      WrappedComponent.displayName || WrappedComponent.name || 'Component'\n\n    const displayName = `Connect(${wrappedComponentName})`\n\n    const selectorFactoryOptions: SelectorFactoryOptions<\n      any,\n      any,\n      any,\n      any,\n      State\n    > = {\n      shouldHandleStateChanges,\n      displayName,\n      wrappedComponentName,\n      WrappedComponent,\n      // @ts-ignore\n      initMapStateToProps,\n      // @ts-ignore\n      initMapDispatchToProps,\n      initMergeProps,\n      areStatesEqual,\n      areStatePropsEqual,\n      areOwnPropsEqual,\n      areMergedPropsEqual,\n    }\n\n    function ConnectFunction<TOwnProps>(\n      props: InternalConnectProps & TOwnProps,\n    ) {\n      const [propsContext, reactReduxForwardedRef, wrapperProps] =\n        React.useMemo(() => {\n          // Distinguish between actual \"data\" props that were passed to the wrapper component,\n          // and values needed to control behavior (forwarded refs, alternate context instances).\n          // To maintain the wrapperProps object reference, memoize this destructuring.\n          const { reactReduxForwardedRef, ...wrapperProps } = props\n          return [props.context, reactReduxForwardedRef, wrapperProps]\n        }, [props])\n\n      const ContextToUse: ReactReduxContextInstance = React.useMemo(() => {\n        // Users may optionally pass in a custom context instance to use instead of our ReactReduxContext.\n        // Memoize the check that determines which context instance we should use.\n        let ResultContext = Context\n        if (propsContext?.Consumer) {\n          if (process.env.NODE_ENV !== 'production') {\n            const isValid = /*#__PURE__*/ isContextConsumer(\n              // @ts-ignore\n              <propsContext.Consumer />,\n            )\n            if (!isValid) {\n              throw new Error(\n                'You must pass a valid React context consumer as `props.context`',\n              )\n            }\n            ResultContext = propsContext\n          }\n        }\n        return ResultContext\n      }, [propsContext, Context])\n\n      // Retrieve the store and ancestor subscription via context, if available\n      const contextValue = React.useContext(ContextToUse)\n\n      // The store _must_ exist as either a prop or in context.\n      // We'll check to see if it _looks_ like a Redux store first.\n      // This allows us to pass through a `store` prop that is just a plain value.\n      const didStoreComeFromProps =\n        Boolean(props.store) &&\n        Boolean(props.store!.getState) &&\n        Boolean(props.store!.dispatch)\n      const didStoreComeFromContext =\n        Boolean(contextValue) && Boolean(contextValue!.store)\n\n      if (\n        process.env.NODE_ENV !== 'production' &&\n        !didStoreComeFromProps &&\n        !didStoreComeFromContext\n      ) {\n        throw new Error(\n          `Could not find \"store\" in the context of ` +\n            `\"${displayName}\". Either wrap the root component in a <Provider>, ` +\n            `or pass a custom React context provider to <Provider> and the corresponding ` +\n            `React context consumer to ${displayName} in connect options.`,\n        )\n      }\n\n      // Based on the previous check, one of these must be true\n      const store: Store = didStoreComeFromProps\n        ? props.store!\n        : contextValue!.store\n\n      const getServerState = didStoreComeFromContext\n        ? contextValue!.getServerState\n        : store.getState\n\n      const childPropsSelector = React.useMemo(() => {\n        // The child props selector needs the store reference as an input.\n        // Re-create this selector whenever the store changes.\n        return defaultSelectorFactory(store.dispatch, selectorFactoryOptions)\n      }, [store])\n\n      const [subscription, notifyNestedSubs] = React.useMemo(() => {\n        if (!shouldHandleStateChanges) return NO_SUBSCRIPTION_ARRAY\n\n        // This Subscription's source should match where store came from: props vs. context. A component\n        // connected to the store via props shouldn't use subscription from context, or vice versa.\n        const subscription = createSubscription(\n          store,\n          didStoreComeFromProps ? undefined : contextValue!.subscription,\n        )\n\n        // `notifyNestedSubs` is duplicated to handle the case where the component is unmounted in\n        // the middle of the notification loop, where `subscription` will then be null. This can\n        // probably be avoided if Subscription's listeners logic is changed to not call listeners\n        // that have been unsubscribed in the  middle of the notification loop.\n        const notifyNestedSubs =\n          subscription.notifyNestedSubs.bind(subscription)\n\n        return [subscription, notifyNestedSubs]\n      }, [store, didStoreComeFromProps, contextValue])\n\n      // Determine what {store, subscription} value should be put into nested context, if necessary,\n      // and memoize that value to avoid unnecessary context updates.\n      const overriddenContextValue = React.useMemo(() => {\n        if (didStoreComeFromProps) {\n          // This component is directly subscribed to a store from props.\n          // We don't want descendants reading from this store - pass down whatever\n          // the existing context value is from the nearest connected ancestor.\n          return contextValue!\n        }\n\n        // Otherwise, put this component's subscription instance into context, so that\n        // connected descendants won't update until after this component is done\n        return {\n          ...contextValue,\n          subscription,\n        } as ReactReduxContextValue\n      }, [didStoreComeFromProps, contextValue, subscription])\n\n      // Set up refs to coordinate values between the subscription effect and the render logic\n      const lastChildProps = React.useRef<unknown>()\n      const lastWrapperProps = React.useRef(wrapperProps)\n      const childPropsFromStoreUpdate = React.useRef<unknown>()\n      const renderIsScheduled = React.useRef(false)\n      const isProcessingDispatch = React.useRef(false)\n      const isMounted = React.useRef(false)\n\n      const latestSubscriptionCallbackError = React.useRef<Error>()\n\n      useIsomorphicLayoutEffect(() => {\n        isMounted.current = true\n        return () => {\n          isMounted.current = false\n        }\n      }, [])\n\n      const actualChildPropsSelector = React.useMemo(() => {\n        const selector = () => {\n          // Tricky logic here:\n          // - This render may have been triggered by a Redux store update that produced new child props\n          // - However, we may have gotten new wrapper props after that\n          // If we have new child props, and the same wrapper props, we know we should use the new child props as-is.\n          // But, if we have new wrapper props, those might change the child props, so we have to recalculate things.\n          // So, we'll use the child props from store update only if the wrapper props are the same as last time.\n          if (\n            childPropsFromStoreUpdate.current &&\n            wrapperProps === lastWrapperProps.current\n          ) {\n            return childPropsFromStoreUpdate.current\n          }\n\n          // TODO We're reading the store directly in render() here. Bad idea?\n          // This will likely cause Bad Things (TM) to happen in Concurrent Mode.\n          // Note that we do this because on renders _not_ caused by store updates, we need the latest store state\n          // to determine what the child props should be.\n          return childPropsSelector(store.getState(), wrapperProps)\n        }\n        return selector\n      }, [store, wrapperProps])\n\n      // We need this to execute synchronously every time we re-render. However, React warns\n      // about useLayoutEffect in SSR, so we try to detect environment and fall back to\n      // just useEffect instead to avoid the warning, since neither will run anyway.\n\n      const subscribeForReact = React.useMemo(() => {\n        const subscribe = (reactListener: () => void) => {\n          if (!subscription) {\n            return () => {}\n          }\n\n          return subscribeUpdates(\n            shouldHandleStateChanges,\n            store,\n            subscription,\n            // @ts-ignore\n            childPropsSelector,\n            lastWrapperProps,\n            lastChildProps,\n            renderIsScheduled,\n            isMounted,\n            childPropsFromStoreUpdate,\n            notifyNestedSubs,\n            reactListener,\n          )\n        }\n\n        return subscribe\n      }, [subscription])\n\n      useIsomorphicLayoutEffectWithArgs(captureWrapperProps, [\n        lastWrapperProps,\n        lastChildProps,\n        renderIsScheduled,\n        wrapperProps,\n        childPropsFromStoreUpdate,\n        notifyNestedSubs,\n      ])\n\n      let actualChildProps: Record<string, unknown>\n\n      try {\n        actualChildProps = useSyncExternalStore(\n          // TODO We're passing through a big wrapper that does a bunch of extra side effects besides subscribing\n          subscribeForReact,\n          // TODO This is incredibly hacky. We've already processed the store update and calculated new child props,\n          // TODO and we're just passing that through so it triggers a re-render for us rather than relying on `uSES`.\n          actualChildPropsSelector,\n          getServerState\n            ? () => childPropsSelector(getServerState(), wrapperProps)\n            : actualChildPropsSelector,\n        )\n      } catch (err) {\n        if (latestSubscriptionCallbackError.current) {\n          // eslint-disable-next-line no-extra-semi\n          ;(\n            err as Error\n          ).message += `\\nThe error may be correlated with this previous error:\\n${latestSubscriptionCallbackError.current.stack}\\n\\n`\n        }\n\n        throw err\n      }\n\n      useIsomorphicLayoutEffect(() => {\n        latestSubscriptionCallbackError.current = undefined\n        childPropsFromStoreUpdate.current = undefined\n        lastChildProps.current = actualChildProps\n      })\n\n      // Now that all that's done, we can finally try to actually render the child component.\n      // We memoize the elements for the rendered child component as an optimization.\n      const renderedWrappedComponent = React.useMemo(() => {\n        return (\n          // @ts-ignore\n          <WrappedComponent\n            {...actualChildProps}\n            ref={reactReduxForwardedRef}\n          />\n        )\n      }, [reactReduxForwardedRef, WrappedComponent, actualChildProps])\n\n      // If React sees the exact same element reference as last time, it bails out of re-rendering\n      // that child, same as if it was wrapped in React.memo() or returned false from shouldComponentUpdate.\n      const renderedChild = React.useMemo(() => {\n        if (shouldHandleStateChanges) {\n          // If this component is subscribed to store updates, we need to pass its own\n          // subscription instance down to our descendants. That means rendering the same\n          // Context instance, and putting a different value into the context.\n          return (\n            <ContextToUse.Provider value={overriddenContextValue}>\n              {renderedWrappedComponent}\n            </ContextToUse.Provider>\n          )\n        }\n\n        return renderedWrappedComponent\n      }, [ContextToUse, renderedWrappedComponent, overriddenContextValue])\n\n      return renderedChild\n    }\n\n    const _Connect = React.memo(ConnectFunction)\n\n    type ConnectedWrapperComponent = typeof _Connect & {\n      WrappedComponent: typeof WrappedComponent\n    }\n\n    // Add a hacky cast to get the right output type\n    const Connect = _Connect as unknown as ConnectedComponent<\n      typeof WrappedComponent,\n      WrappedComponentProps\n    >\n    Connect.WrappedComponent = WrappedComponent\n    Connect.displayName = ConnectFunction.displayName = displayName\n\n    if (forwardRef) {\n      const _forwarded = React.forwardRef(function forwardConnectRef(\n        props,\n        ref,\n      ) {\n        // @ts-ignore\n        return <Connect {...props} reactReduxForwardedRef={ref} />\n      })\n\n      const forwarded = _forwarded as ConnectedWrapperComponent\n      forwarded.displayName = displayName\n      forwarded.WrappedComponent = WrappedComponent\n      return /*#__PURE__*/ hoistStatics(forwarded, WrappedComponent)\n    }\n\n    return /*#__PURE__*/ hoistStatics(Connect, WrappedComponent)\n  }\n\n  return wrapWithConnect\n}\n\nexport default connect as Connect\n","import { wrapMapToPropsConstant, wrapMapToPropsFunc } from './wrapMapToProps'\nimport { createInvalidArgFactory } from './invalidArgFactory'\nimport type { MapStateToPropsParam } from './selectorFactory'\n\nexport function mapStateToPropsFactory<TStateProps, TOwnProps, State>(\n  mapStateToProps: MapStateToPropsParam<TStateProps, TOwnProps, State>,\n) {\n  return !mapStateToProps\n    ? wrapMapToPropsConstant(() => ({}))\n    : typeof mapStateToProps === 'function'\n    ? // @ts-ignore\n      wrapMapToPropsFunc(mapStateToProps, 'mapStateToProps')\n    : createInvalidArgFactory(mapStateToProps, 'mapStateToProps')\n}\n","import type { Action, Dispatch } from 'redux'\nimport bindActionCreators from '../utils/bindActionCreators'\nimport { wrapMapToPropsConstant, wrapMapToPropsFunc } from './wrapMapToProps'\nimport { createInvalidArgFactory } from './invalidArgFactory'\nimport type { MapDispatchToPropsParam } from './selectorFactory'\n\nexport function mapDispatchToPropsFactory<TDispatchProps, TOwnProps>(\n  mapDispatchToProps:\n    | MapDispatchToPropsParam<TDispatchProps, TOwnProps>\n    | undefined,\n) {\n  return mapDispatchToProps && typeof mapDispatchToProps === 'object'\n    ? wrapMapToPropsConstant((dispatch: Dispatch<Action<string>>) =>\n        // @ts-ignore\n        bindActionCreators(mapDispatchToProps, dispatch),\n      )\n    : !mapDispatchToProps\n    ? wrapMapToPropsConstant((dispatch: Dispatch<Action<string>>) => ({\n        dispatch,\n      }))\n    : typeof mapDispatchToProps === 'function'\n    ? // @ts-ignore\n      wrapMapToPropsFunc(mapDispatchToProps, 'mapDispatchToProps')\n    : createInvalidArgFactory(mapDispatchToProps, 'mapDispatchToProps')\n}\n","import type { ActionCreatorsMapObject, Dispatch } from 'redux'\n\nexport default function bindActionCreators(\n  actionCreators: ActionCreatorsMapObject,\n  dispatch: Dispatch,\n): ActionCreatorsMapObject {\n  const boundActionCreators: ActionCreatorsMapObject = {}\n\n  for (const key in actionCreators) {\n    const actionCreator = actionCreators[key]\n    if (typeof actionCreator === 'function') {\n      boundActionCreators[key] = (...args) => dispatch(actionCreator(...args))\n    }\n  }\n  return boundActionCreators\n}\n","import type { Context, ReactNode } from 'react'\nimport { React } from '../utils/react'\nimport type { Action, Store, UnknownAction } from 'redux'\nimport type { DevModeCheckFrequency } from '../hooks/useSelector'\nimport { createSubscription } from '../utils/Subscription'\nimport { useIsomorphicLayoutEffect } from '../utils/useIsomorphicLayoutEffect'\nimport type { ReactReduxContextValue } from './Context'\nimport { ReactReduxContext } from './Context'\n\nexport interface ProviderProps<\n  A extends Action<string> = UnknownAction,\n  S = unknown\n> {\n  /**\n   * The single Redux store in your application.\n   */\n  store: Store<S, A>\n\n  /**\n   * An optional server state snapshot. Will be used during initial hydration render if available, to ensure that the UI output is consistent with the HTML generated on the server.\n   */\n  serverState?: S\n\n  /**\n   * Optional context to be used internally in react-redux. Use React.createContext() to create a context to be used.\n   * If this is used, you'll need to customize `connect` by supplying the same context provided to the Provider.\n   * Set the initial value to null, and the hooks will error\n   * if this is not overwritten by Provider.\n   */\n  context?: Context<ReactReduxContextValue<S, A> | null>\n\n  /**\n   * Determines the frequency of stability checks for all selectors.\n   * This setting overrides the global configuration for\n   * the `useSelector` stability check, allowing you to specify how often\n   * these checks should occur in development mode.\n   *\n   * @since 8.1.0\n   */\n  stabilityCheck?: DevModeCheckFrequency\n\n  /**\n   * Determines the frequency of identity function checks for all selectors.\n   * This setting overrides the global configuration for\n   * the `useSelector` identity function check, allowing you to specify how often\n   * these checks should occur in development mode.\n   *\n   * **Note**: Previously referred to as `noopCheck`.\n   *\n   * @since 9.0.0\n   */\n  identityFunctionCheck?: DevModeCheckFrequency\n\n  children: ReactNode\n}\n\nfunction Provider<A extends Action<string> = UnknownAction, S = unknown>({\n  store,\n  context,\n  children,\n  serverState,\n  stabilityCheck = 'once',\n  identityFunctionCheck = 'once',\n}: ProviderProps<A, S>) {\n  const contextValue = React.useMemo(() => {\n    const subscription = createSubscription(store)\n    return {\n      store,\n      subscription,\n      getServerState: serverState ? () => serverState : undefined,\n      stabilityCheck,\n      identityFunctionCheck,\n    }\n  }, [store, serverState, stabilityCheck, identityFunctionCheck])\n\n  const previousState = React.useMemo(() => store.getState(), [store])\n\n  useIsomorphicLayoutEffect(() => {\n    const { subscription } = contextValue\n    subscription.onStateChange = subscription.notifyNestedSubs\n    subscription.trySubscribe()\n\n    if (previousState !== store.getState()) {\n      subscription.notifyNestedSubs()\n    }\n    return () => {\n      subscription.tryUnsubscribe()\n      subscription.onStateChange = undefined\n    }\n  }, [contextValue, previousState])\n\n  const Context = context || ReactReduxContext\n\n  // @ts-ignore 'AnyAction' is assignable to the constraint of type 'A', but 'A' could be instantiated with a different subtype\n  return <Context.Provider value={contextValue}>{children}</Context.Provider>\n}\n\nexport default Provider\n","import type { Context } from 'react'\nimport type { Action, Store } from 'redux'\nimport type { ReactReduxContextValue } from '../components/Context'\nimport { ReactReduxContext } from '../components/Context'\nimport {\n  createReduxContextHook,\n  useReduxContext as useDefaultReduxContext,\n} from './useReduxContext'\n\n/**\n * Represents a type that extracts the action type from a given Redux store.\n *\n * @template StoreType - The specific type of the Redux store.\n *\n * @since 9.1.0\n * @internal\n */\nexport type ExtractStoreActionType<StoreType extends Store> =\n  StoreType extends Store<any, infer ActionType> ? ActionType : never\n\n/**\n * Represents a custom hook that provides access to the Redux store.\n *\n * @template StoreType - The specific type of the Redux store that gets returned.\n *\n * @since 9.1.0\n * @public\n */\nexport interface UseStore<StoreType extends Store> {\n  /**\n   * Returns the Redux store instance.\n   *\n   * @returns The Redux store instance.\n   */\n  (): StoreType\n\n  /**\n   * Returns the Redux store instance with specific state and action types.\n   *\n   * @returns The Redux store with the specified state and action types.\n   *\n   * @template StateType - The specific type of the state used in the store.\n   * @template ActionType - The specific type of the actions used in the store.\n   */\n  <\n    StateType extends ReturnType<StoreType['getState']> = ReturnType<\n      StoreType['getState']\n    >,\n    ActionType extends Action = ExtractStoreActionType<Store>\n  >(): Store<StateType, ActionType>\n\n  /**\n   * Creates a \"pre-typed\" version of {@linkcode useStore useStore}\n   * where the type of the Redux `store` is predefined.\n   *\n   * This allows you to set the `store` type once, eliminating the need to\n   * specify it with every {@linkcode useStore useStore} call.\n   *\n   * @returns A pre-typed `useStore` with the store type already defined.\n   *\n   * @example\n   * ```ts\n   * export const useAppStore = useStore.withTypes<AppStore>()\n   * ```\n   *\n   * @template OverrideStoreType - The specific type of the Redux store that gets returned.\n   *\n   * @since 9.1.0\n   */\n  withTypes: <\n    OverrideStoreType extends StoreType\n  >() => UseStore<OverrideStoreType>\n}\n\n/**\n * Hook factory, which creates a `useStore` hook bound to a given context.\n *\n * @param {React.Context} [context=ReactReduxContext] Context passed to your `<Provider>`.\n * @returns {Function} A `useStore` hook bound to the specified context.\n */\nexport function createStoreHook<\n  StateType = unknown,\n  ActionType extends Action = Action\n>(\n  // @ts-ignore\n  context?: Context<ReactReduxContextValue<\n    StateType,\n    ActionType\n  > | null> = ReactReduxContext\n) {\n  const useReduxContext =\n    context === ReactReduxContext\n      ? useDefaultReduxContext\n      : // @ts-ignore\n        createReduxContextHook(context)\n  const useStore = () => {\n    const { store } = useReduxContext()\n    return store\n  }\n\n  Object.assign(useStore, {\n    withTypes: () => useStore,\n  })\n\n  return useStore as UseStore<Store<StateType, ActionType>>\n}\n\n/**\n * A hook to access the redux store.\n *\n * @returns {any} the redux store\n *\n * @example\n *\n * import React from 'react'\n * import { useStore } from 'react-redux'\n *\n * export const ExampleComponent = () => {\n *   const store = useStore()\n *   return <div>{store.getState()}</div>\n * }\n */\nexport const useStore = /*#__PURE__*/ createStoreHook()\n","import type { Context } from 'react'\nimport type { Action, Dispatch, UnknownAction } from 'redux'\n\nimport type { ReactReduxContextValue } from '../components/Context'\nimport { ReactReduxContext } from '../components/Context'\nimport { createStoreHook, useStore as useDefaultStore } from './useStore'\n\n/**\n * Represents a custom hook that provides a dispatch function\n * from the Redux store.\n *\n * @template DispatchType - The specific type of the dispatch function.\n *\n * @since 9.1.0\n * @public\n */\nexport interface UseDispatch<\n  DispatchType extends Dispatch<UnknownAction> = Dispatch<UnknownAction>\n> {\n  /**\n   * Returns the dispatch function from the Redux store.\n   *\n   * @returns The dispatch function from the Redux store.\n   *\n   * @template AppDispatch - The specific type of the dispatch function.\n   */\n  <AppDispatch extends DispatchType = DispatchType>(): AppDispatch\n\n  /**\n   * Creates a \"pre-typed\" version of {@linkcode useDispatch useDispatch}\n   * where the type of the `dispatch` function is predefined.\n   *\n   * This allows you to set the `dispatch` type once, eliminating the need to\n   * specify it with every {@linkcode useDispatch useDispatch} call.\n   *\n   * @returns A pre-typed `useDispatch` with the dispatch type already defined.\n   *\n   * @example\n   * ```ts\n   * export const useAppDispatch = useDispatch.withTypes<AppDispatch>()\n   * ```\n   *\n   * @template OverrideDispatchType - The specific type of the dispatch function.\n   *\n   * @since 9.1.0\n   */\n  withTypes: <\n    OverrideDispatchType extends DispatchType\n  >() => UseDispatch<OverrideDispatchType>\n}\n\n/**\n * Hook factory, which creates a `useDispatch` hook bound to a given context.\n *\n * @param {React.Context} [context=ReactReduxContext] Context passed to your `<Provider>`.\n * @returns {Function} A `useDispatch` hook bound to the specified context.\n */\nexport function createDispatchHook<\n  StateType = unknown,\n  ActionType extends Action = UnknownAction\n>(\n  // @ts-ignore\n  context?: Context<ReactReduxContextValue<\n    StateType,\n    ActionType\n  > | null> = ReactReduxContext\n) {\n  const useStore =\n    context === ReactReduxContext ? useDefaultStore : createStoreHook(context)\n\n  const useDispatch = () => {\n    const store = useStore()\n    return store.dispatch\n  }\n\n  Object.assign(useDispatch, {\n    withTypes: () => useDispatch,\n  })\n\n  return useDispatch as UseDispatch<Dispatch<ActionType>>\n}\n\n/**\n * A hook to access the redux `dispatch` function.\n *\n * @returns {any|function} redux store's `dispatch` function\n *\n * @example\n *\n * import React, { useCallback } from 'react'\n * import { useDispatch } from 'react-redux'\n *\n * export const CounterComponent = ({ value }) => {\n *   const dispatch = useDispatch()\n *   const increaseCounter = useCallback(() => dispatch({ type: 'increase-counter' }), [])\n *   return (\n *     <div>\n *       <span>{value}</span>\n *       <button onClick={increaseCounter}>Increase counter</button>\n *     </div>\n *   )\n * }\n */\nexport const useDispatch = /*#__PURE__*/ createDispatchHook()\n","// The primary entry point assumes we are working with React 18, and thus have\n// useSyncExternalStore available. We can import that directly from React itself.\n// The useSyncExternalStoreWithSelector has to be imported, but we can use the\n// non-shim version. This shaves off the byte size of the shim.\n\nimport * as React from 'react'\nimport { useSyncExternalStoreWithSelector } from 'use-sync-external-store/with-selector.js'\n\nimport { initializeUseSelector } from './hooks/useSelector'\nimport { initializeConnect } from './components/connect'\n\ninitializeUseSelector(useSyncExternalStoreWithSelector)\ninitializeConnect(React.useSyncExternalStore)\n\nexport * from './exports'\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\tid: moduleId,\n\t\tloaded: false,\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId].call(module.exports, module, module.exports, __webpack_require__);\n\n\t// Flag the module as loaded\n\tmodule.loaded = true;\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n// expose the modules object (__webpack_modules__)\n__webpack_require__.m = __webpack_modules__;\n\n","__webpack_require__.amdO = {};","var deferred = [];\n__webpack_require__.O = (result, chunkIds, fn, priority) => {\n\tif(chunkIds) {\n\t\tpriority = priority || 0;\n\t\tfor(var i = deferred.length; i > 0 && deferred[i - 1][2] > priority; i--) deferred[i] = deferred[i - 1];\n\t\tdeferred[i] = [chunkIds, fn, priority];\n\t\treturn;\n\t}\n\tvar notFulfilled = Infinity;\n\tfor (var i = 0; i < deferred.length; i++) {\n\t\tvar chunkIds = deferred[i][0];\n\t\tvar fn = deferred[i][1];\n\t\tvar priority = deferred[i][2];\n\t\tvar fulfilled = true;\n\t\tfor (var j = 0; j < chunkIds.length; j++) {\n\t\t\tif ((priority & 1 === 0 || notFulfilled >= priority) && Object.keys(__webpack_require__.O).every((key) => (__webpack_require__.O[key](chunkIds[j])))) {\n\t\t\t\tchunkIds.splice(j--, 1);\n\t\t\t} else {\n\t\t\t\tfulfilled = false;\n\t\t\t\tif(priority < notFulfilled) notFulfilled = priority;\n\t\t\t}\n\t\t}\n\t\tif(fulfilled) {\n\t\t\tdeferred.splice(i--, 1)\n\t\t\tvar r = fn();\n\t\t\tif (r !== undefined) result = r;\n\t\t}\n\t}\n\treturn result;\n};","__webpack_require__.F = {};\n__webpack_require__.E = (chunkId) => {\n\tObject.keys(__webpack_require__.F).map((key) => {\n\t\t__webpack_require__.F[key](chunkId);\n\t});\n}","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","var getProto = Object.getPrototypeOf ? (obj) => (Object.getPrototypeOf(obj)) : (obj) => (obj.__proto__);\nvar leafPrototypes;\n// create a fake namespace object\n// mode & 1: value is a module id, require it\n// mode & 2: merge all properties of value into the ns\n// mode & 4: return value when already ns object\n// mode & 16: return value when it's Promise-like\n// mode & 8|1: behave like require\n__webpack_require__.t = function(value, mode) {\n\tif(mode & 1) value = this(value);\n\tif(mode & 8) return value;\n\tif(typeof value === 'object' && value) {\n\t\tif((mode & 4) && value.__esModule) return value;\n\t\tif((mode & 16) && typeof value.then === 'function') return value;\n\t}\n\tvar ns = Object.create(null);\n\t__webpack_require__.r(ns);\n\tvar def = {};\n\tleafPrototypes = leafPrototypes || [null, getProto({}), getProto([]), getProto(getProto)];\n\tfor(var current = mode & 2 && value; typeof current == 'object' && !~leafPrototypes.indexOf(current); current = getProto(current)) {\n\t\tObject.getOwnPropertyNames(current).forEach((key) => (def[key] = () => (value[key])));\n\t}\n\tdef['default'] = () => (value);\n\t__webpack_require__.d(ns, def);\n\treturn ns;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.f = {};\n// This file contains only the entry chunk.\n// The chunk loading function for additional chunks\n__webpack_require__.e = (chunkId) => {\n\treturn Promise.all(Object.keys(__webpack_require__.f).reduce((promises, key) => {\n\t\t__webpack_require__.f[key](chunkId, promises);\n\t\treturn promises;\n\t}, []));\n};","// This function allow to reference async chunks\n__webpack_require__.u = (chunkId) => {\n\t// return url for filenames based on template\n\treturn \"static/js/\" + chunkId + \".\" + {\"97\":\"66cdfd4d\",\"142\":\"407b78db\",\"250\":\"727ebbcf\",\"295\":\"19025044\",\"298\":\"b307d8c3\",\"606\":\"22c07577\",\"734\":\"355aa776\",\"797\":\"a7baf758\",\"958\":\"ed898b91\",\"966\":\"fb8a6245\"}[chunkId] + \".chunk.js\";\n};","// This function allow to reference async chunks\n__webpack_require__.miniCssF = (chunkId) => {\n\t// return url for filenames based on template\n\treturn \"static/css/\" + chunkId + \".\" + {\"142\":\"84525941\",\"295\":\"2dbc1ecf\",\"606\":\"8882e9f1\",\"734\":\"5fc1cadc\",\"797\":\"d2ae60de\",\"958\":\"5fc1cadc\",\"966\":\"2dbc1ecf\"}[chunkId] + \".chunk.css\";\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","var inProgress = {};\nvar dataWebpackPrefix = \"market2024:\";\n// loadScript function to load a script via script tag\n__webpack_require__.l = (url, done, key, chunkId) => {\n\tif(inProgress[url]) { inProgress[url].push(done); return; }\n\tvar script, needAttach;\n\tif(key !== undefined) {\n\t\tvar scripts = document.getElementsByTagName(\"script\");\n\t\tfor(var i = 0; i < scripts.length; i++) {\n\t\t\tvar s = scripts[i];\n\t\t\tif(s.getAttribute(\"src\") == url || s.getAttribute(\"data-webpack\") == dataWebpackPrefix + key) { script = s; break; }\n\t\t}\n\t}\n\tif(!script) {\n\t\tneedAttach = true;\n\t\tscript = document.createElement('script');\n\n\t\tscript.charset = 'utf-8';\n\t\tscript.timeout = 120;\n\t\tif (__webpack_require__.nc) {\n\t\t\tscript.setAttribute(\"nonce\", __webpack_require__.nc);\n\t\t}\n\t\tscript.setAttribute(\"data-webpack\", dataWebpackPrefix + key);\n\n\t\tscript.src = url;\n\t}\n\tinProgress[url] = [done];\n\tvar onScriptComplete = (prev, event) => {\n\t\t// avoid mem leaks in IE.\n\t\tscript.onerror = script.onload = null;\n\t\tclearTimeout(timeout);\n\t\tvar doneFns = inProgress[url];\n\t\tdelete inProgress[url];\n\t\tscript.parentNode && script.parentNode.removeChild(script);\n\t\tdoneFns && doneFns.forEach((fn) => (fn(event)));\n\t\tif(prev) return prev(event);\n\t}\n\tvar timeout = setTimeout(onScriptComplete.bind(null, undefined, { type: 'timeout', target: script }), 120000);\n\tscript.onerror = onScriptComplete.bind(null, script.onerror);\n\tscript.onload = onScriptComplete.bind(null, script.onload);\n\tneedAttach && document.head.appendChild(script);\n};","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","__webpack_require__.p = \"/\";","if (typeof document === \"undefined\") return;\nvar createStylesheet = (chunkId, fullhref, oldTag, resolve, reject) => {\n\tvar linkTag = document.createElement(\"link\");\n\n\tlinkTag.rel = \"stylesheet\";\n\tlinkTag.type = \"text/css\";\n\tif (__webpack_require__.nc) {\n\t\tlinkTag.nonce = __webpack_require__.nc;\n\t}\n\tvar onLinkComplete = (event) => {\n\t\t// avoid mem leaks.\n\t\tlinkTag.onerror = linkTag.onload = null;\n\t\tif (event.type === 'load') {\n\t\t\tresolve();\n\t\t} else {\n\t\t\tvar errorType = event && event.type;\n\t\t\tvar realHref = event && event.target && event.target.href || fullhref;\n\t\t\tvar err = new Error(\"Loading CSS chunk \" + chunkId + \" failed.\\n(\" + errorType + \": \" + realHref + \")\");\n\t\t\terr.name = \"ChunkLoadError\";\n\t\t\terr.code = \"CSS_CHUNK_LOAD_FAILED\";\n\t\t\terr.type = errorType;\n\t\t\terr.request = realHref;\n\t\t\tif (linkTag.parentNode) linkTag.parentNode.removeChild(linkTag)\n\t\t\treject(err);\n\t\t}\n\t}\n\tlinkTag.onerror = linkTag.onload = onLinkComplete;\n\tlinkTag.href = fullhref;\n\n\n\tif (oldTag) {\n\t\toldTag.parentNode.insertBefore(linkTag, oldTag.nextSibling);\n\t} else {\n\t\tdocument.head.appendChild(linkTag);\n\t}\n\treturn linkTag;\n};\nvar findStylesheet = (href, fullhref) => {\n\tvar existingLinkTags = document.getElementsByTagName(\"link\");\n\tfor(var i = 0; i < existingLinkTags.length; i++) {\n\t\tvar tag = existingLinkTags[i];\n\t\tvar dataHref = tag.getAttribute(\"data-href\") || tag.getAttribute(\"href\");\n\t\tif(tag.rel === \"stylesheet\" && (dataHref === href || dataHref === fullhref)) return tag;\n\t}\n\tvar existingStyleTags = document.getElementsByTagName(\"style\");\n\tfor(var i = 0; i < existingStyleTags.length; i++) {\n\t\tvar tag = existingStyleTags[i];\n\t\tvar dataHref = tag.getAttribute(\"data-href\");\n\t\tif(dataHref === href || dataHref === fullhref) return tag;\n\t}\n};\nvar loadStylesheet = (chunkId) => {\n\treturn new Promise((resolve, reject) => {\n\t\tvar href = __webpack_require__.miniCssF(chunkId);\n\t\tvar fullhref = __webpack_require__.p + href;\n\t\tif(findStylesheet(href, fullhref)) return resolve();\n\t\tcreateStylesheet(chunkId, fullhref, null, resolve, reject);\n\t});\n}\n// object to store loaded CSS chunks\nvar installedCssChunks = {\n\t792: 0\n};\n\n__webpack_require__.f.miniCss = (chunkId, promises) => {\n\tvar cssChunks = {\"142\":1,\"295\":1,\"606\":1,\"734\":1,\"797\":1,\"958\":1,\"966\":1};\n\tif(installedCssChunks[chunkId]) promises.push(installedCssChunks[chunkId]);\n\telse if(installedCssChunks[chunkId] !== 0 && cssChunks[chunkId]) {\n\t\tpromises.push(installedCssChunks[chunkId] = loadStylesheet(chunkId).then(() => {\n\t\t\tinstalledCssChunks[chunkId] = 0;\n\t\t}, (e) => {\n\t\t\tdelete installedCssChunks[chunkId];\n\t\t\tthrow e;\n\t\t}));\n\t}\n};\n\n// no hmr\n\n__webpack_require__.F.miniCss = (chunkId) => {\n\tif((!__webpack_require__.o(installedCssChunks, chunkId) || installedCssChunks[chunkId] === undefined) && !/^(250|298|97)$/.test(chunkId)) {\n\t\tinstalledCssChunks[chunkId] = null;\n\t\tvar link = document.createElement('link');\n\n\t\tif (__webpack_require__.nc) {\n\t\t\tlink.setAttribute(\"nonce\", __webpack_require__.nc);\n\t\t}\n\t\tlink.rel = \"prefetch\";\n\t\tlink.as = \"style\";\n\t\tlink.href = __webpack_require__.p + __webpack_require__.miniCssF(chunkId);\n\t\tdocument.head.appendChild(link);\n\t}\n};\n\n// no preloaded","// no baseURI\n\n// object to store loaded and loading chunks\n// undefined = chunk not loaded, null = chunk preloaded/prefetched\n// [resolve, reject, Promise] = chunk loading, 0 = chunk loaded\nvar installedChunks = {\n\t792: 0\n};\n\n__webpack_require__.f.j = (chunkId, promises) => {\n\t\t// JSONP chunk loading for javascript\n\t\tvar installedChunkData = __webpack_require__.o(installedChunks, chunkId) ? installedChunks[chunkId] : undefined;\n\t\tif(installedChunkData !== 0) { // 0 means \"already installed\".\n\n\t\t\t// a Promise means \"currently loading\".\n\t\t\tif(installedChunkData) {\n\t\t\t\tpromises.push(installedChunkData[2]);\n\t\t\t} else {\n\t\t\t\tif(true) { // all chunks have JS\n\t\t\t\t\t// setup Promise in chunk cache\n\t\t\t\t\tvar promise = new Promise((resolve, reject) => (installedChunkData = installedChunks[chunkId] = [resolve, reject]));\n\t\t\t\t\tpromises.push(installedChunkData[2] = promise);\n\n\t\t\t\t\t// start chunk loading\n\t\t\t\t\tvar url = __webpack_require__.p + __webpack_require__.u(chunkId);\n\t\t\t\t\t// create error before stack unwound to get useful stacktrace later\n\t\t\t\t\tvar error = new Error();\n\t\t\t\t\tvar loadingEnded = (event) => {\n\t\t\t\t\t\tif(__webpack_require__.o(installedChunks, chunkId)) {\n\t\t\t\t\t\t\tinstalledChunkData = installedChunks[chunkId];\n\t\t\t\t\t\t\tif(installedChunkData !== 0) installedChunks[chunkId] = undefined;\n\t\t\t\t\t\t\tif(installedChunkData) {\n\t\t\t\t\t\t\t\tvar errorType = event && (event.type === 'load' ? 'missing' : event.type);\n\t\t\t\t\t\t\t\tvar realSrc = event && event.target && event.target.src;\n\t\t\t\t\t\t\t\terror.message = 'Loading chunk ' + chunkId + ' failed.\\n(' + errorType + ': ' + realSrc + ')';\n\t\t\t\t\t\t\t\terror.name = 'ChunkLoadError';\n\t\t\t\t\t\t\t\terror.type = errorType;\n\t\t\t\t\t\t\t\terror.request = realSrc;\n\t\t\t\t\t\t\t\tinstalledChunkData[1](error);\n\t\t\t\t\t\t\t}\n\t\t\t\t\t\t}\n\t\t\t\t\t};\n\t\t\t\t\t__webpack_require__.l(url, loadingEnded, \"chunk-\" + chunkId, chunkId);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n};\n\n__webpack_require__.F.j = (chunkId) => {\n\tif((!__webpack_require__.o(installedChunks, chunkId) || installedChunks[chunkId] === undefined) && true) {\n\t\tinstalledChunks[chunkId] = null;\n\t\tvar link = document.createElement('link');\n\n\t\tif (__webpack_require__.nc) {\n\t\t\tlink.setAttribute(\"nonce\", __webpack_require__.nc);\n\t\t}\n\t\tlink.rel = \"prefetch\";\n\t\tlink.as = \"script\";\n\t\tlink.href = __webpack_require__.p + __webpack_require__.u(chunkId);\n\t\tdocument.head.appendChild(link);\n\t}\n};\n\n// no preloaded\n\n// no HMR\n\n// no HMR manifest\n\n__webpack_require__.O.j = (chunkId) => (installedChunks[chunkId] === 0);\n\n// install a JSONP callback for chunk loading\nvar webpackJsonpCallback = (parentChunkLoadingFunction, data) => {\n\tvar chunkIds = data[0];\n\tvar moreModules = data[1];\n\tvar runtime = data[2];\n\t// add \"moreModules\" to the modules object,\n\t// then flag all \"chunkIds\" as loaded and fire callback\n\tvar moduleId, chunkId, i = 0;\n\tif(chunkIds.some((id) => (installedChunks[id] !== 0))) {\n\t\tfor(moduleId in moreModules) {\n\t\t\tif(__webpack_require__.o(moreModules, moduleId)) {\n\t\t\t\t__webpack_require__.m[moduleId] = moreModules[moduleId];\n\t\t\t}\n\t\t}\n\t\tif(runtime) var result = runtime(__webpack_require__);\n\t}\n\tif(parentChunkLoadingFunction) parentChunkLoadingFunction(data);\n\tfor(;i < chunkIds.length; i++) {\n\t\tchunkId = chunkIds[i];\n\t\tif(__webpack_require__.o(installedChunks, chunkId) && installedChunks[chunkId]) {\n\t\t\tinstalledChunks[chunkId][0]();\n\t\t}\n\t\tinstalledChunks[chunkId] = 0;\n\t}\n\treturn __webpack_require__.O(result);\n}\n\nvar chunkLoadingGlobal = self[\"webpackChunkmarket2024\"] = self[\"webpackChunkmarket2024\"] || [];\nchunkLoadingGlobal.forEach(webpackJsonpCallback.bind(null, 0));\nchunkLoadingGlobal.push = webpackJsonpCallback.bind(null, chunkLoadingGlobal.push.bind(chunkLoadingGlobal));","var chunkToChildrenMap = {\n\t\"606\": [\n\t\t97,\n\t\t298,\n\t\t958,\n\t\t295,\n\t\t966,\n\t\t797,\n\t\t734,\n\t\t250\n\t]\n};\n__webpack_require__.f.prefetch = (chunkId, promises) => (Promise.all(promises).then(() => {\n\tvar chunks = chunkToChildrenMap[chunkId];\n\tArray.isArray(chunks) && chunks.map(__webpack_require__.E);\n}));","__webpack_require__.O(0, [792], () => {\n\t__webpack_require__.E(142);\n\t__webpack_require__.E(606);\n}, 5);","import { configureStore } from '@reduxjs/toolkit';\r\nimport cartSlice from './cartStore';\r\nimport siteSlice from './siteStore';\r\n\r\nexport default configureStore({\r\n  reducer: {\r\n    cart: cartSlice,\r\n    site: siteSlice,\r\n  },\r\n});\r\n","import React, { lazy, Suspense } from 'react';\r\nimport ReactDOM from 'react-dom/client';\r\nimport { Provider } from 'react-redux';\r\nimport './index.css';\r\nimport store from './store/store.js';\r\nimport { addOfferCategory } from './libs/helpers.js';\r\nimport { BrowserRouter } from 'react-router-dom';\r\nimport { getLanguageEndpoints } from './libs/language';\r\nimport { setTextToTraslateTool } from './libs/messages.js';\r\n\r\nconst App = lazy(() => import(/* webpackPrefetch: true */ './App.js'));\r\n\r\nconst root = ReactDOM.createRoot(document.getElementById('root'));\r\n\r\n// root.render(\r\n//   <div className='loadingSite'>\r\n//     <img src={`${process.env.PUBLIC_URL}/img/logo_market.png`} alt='Logo market' />\r\n//   </div>\r\n// )\r\n\r\n\r\n\r\nfetch(`${process.env.PUBLIC_URL}/config.json`)\r\n  .then((response) => response.json())\r\n  .then((res) => {   \r\n    localStorage.setItem('site', res?.WebSection);\r\n    let petitions = [];\r\n    let zero =`${process.env.PUBLIC_URL}/traslations.json`;\r\n    let one =\r\n      getLanguageEndpoints(res.urlAPI, res.urlAPIDev, res.WebSection) +\r\n      '/getCatalogItemsJson'; //webservices\r\n    let two =\r\n      getLanguageEndpoints(res.urlAPI, res.urlAPIDev, res.WebSection) +\r\n      '/getCategories'; //webservices\r\n\r\n    petitions.push(one);\r\n    petitions.push(two);\r\n    petitions.push(zero);\r\n    petitions.push(`${process.env.PUBLIC_URL}/offers.json`);\r\n\r\n    Promise.all(\r\n      petitions.map(async (url) => {\r\n        let resp = await fetch(url, {\r\n          method: 'get',\r\n        });\r\n        return resp.json();\r\n      })\r\n    )\r\n      .then((resArray) => {\r\n        setTextToTraslateTool(resArray[2]);\r\n        //falta agregar es state inicial de la app\r\n        root.render(\r\n          <Suspense\r\n            fallback={\r\n              <div className='loadingSite'>\r\n                <img src={`${process.env.PUBLIC_URL}/img/logo_market.png`} alt='Logo market' />\r\n              </div>\r\n            }\r\n          >\r\n            <Provider store={store}>\r\n              <BrowserRouter>\r\n                <App\r\n                  config={res}\r\n                  categories={addOfferCategory(resArray[1])} //Webservices\r\n                  offers={resArray[3]}\r\n                  items={resArray[0]}\r\n                />\r\n              </BrowserRouter>\r\n            </Provider>\r\n          </Suspense>\r\n        );\r\n      })\r\n      .catch((err) => {\r\n        console.log(err.message ? '2: ' + err.message : 'Error');\r\n      });\r\n  })\r\n  .catch((err) => {\r\n    console.log(err.message ? err.message : 'Error');\r\n  });\r\n"],"names":["getCookieForm","cname","idiom","arguments","length","undefined","name","ca","decodeURIComponent","document","cookie","split","i","c","charAt","substring","indexOf","setCookieForm","cvalue","d","Date","setTime","getTime","expires","toUTCString","deleteCookieForm","isHome","location","pathname","process","getParamsFromUrl","variable","search","window","substr","URLSearchParams","get","getAllParamsFromUrl","kskTag","rentalsTag","giftsTag","getWebSectionForEndpoint","tag","openModalForLogin","config","reduxLogin","left","Screen","width","strWindowFeatures","height","userToken","console","log","idioma","getLanguage","open","urlToGetTokenToLogin","codeToGetTokenToLogin","protocol","hostname","RetrieveRandomObjByCat","objects","cat","numberToRetrieve","arrayItems","itents","itemsFilteredByCat","_","o","ItemExt","Group","SGroupCode","number","Object","keys","newArray","slice","IItemID","push","removeCharactersFromText","str","result","char","getRichText","key","addOfferCategory","list","ICategoryID","SCategoryCode","SCategoryDesc","getTexto","LsGroup","IGroupID","SGroupDesc","getOfferPriceDetails","item","priceWDiscount","OfferDetail","reduce","a","b","Price","price","Discount","totalDiscount","getDetailsCart","cart","subTotal","discount10","discountOffer","total","map","isOffer","parseFloat","priceDetails","toFixed","totalItems","priceItem","DPrice","getDiscountByTag","thereIsDiscountByTag","discout","localStorage","getItem","SetLanguage","callback","reload","setTimeout","getLanguageEndpoints","domain","devDomain","webSection","urlEndpoint","host","getCurrency","textos","textoInput","setTextToTraslateTool","textResp","cartSlice","createSlice","initialState","itemsCart","isShowed","loader","reducers","setLoader","state","action","payload","resetCartItems","cartSite","setItem","btoa","JSON","stringify","itemsCount","totalPrice","fetchCartItems","iniConfig","count","parse","atob","forEach","current","ini","deleteCartItem","currentState","codeItem","filter","SItemCode","setItemToCart","newListItemsCart","newItemToCart","Exist","newItems","onList","YnAllowFractionalSale","parseInt","setCartToSessionSync","obj","async","dispatch","getState","paramForForm","user","site","Email","FullName","fullName","Name","FName","LastName","LName1","form","createElement","body","appendChild","element1","element2","method","initialConfig","urlAPI","WebSection","value","type","submit","actions","CONSTANTS","assert","assertion","message","assertionError","Error","stringToByteArray$1","out","p","charCodeAt","base64","byteToCharMap_","charToByteMap_","byteToCharMapWebSafe_","charToByteMapWebSafe_","ENCODED_VALS_BASE","ENCODED_VALS","this","ENCODED_VALS_WEBSAFE","HAS_NATIVE_SUPPORT","encodeByteArray","input","webSafe","Array","isArray","init_","byteToCharMap","output","byte1","haveByte2","byte2","haveByte3","byte3","outByte1","outByte2","outByte3","outByte4","join","encodeString","decodeString","bytes","pos","c1","String","fromCharCode","c2","u","c3","byteArrayToString","decodeStringToByteArray","charToByteMap","byte4","DecodeBase64StringError","constructor","base64Encode","utf8Bytes","base64urlEncodeWithoutPadding","replace","base64Decode","e","error","deepCopy","deepExtend","target","source","prop","hasOwnProperty","getDefaultsFromGlobal","self","global","getGlobal","__FIREBASE_DEFAULTS__","getDefaults","getDefaultsFromEnvVariable","defaultsJsonString","getDefaultsFromCookie","match","decoded","info","getDefaultEmulatorHostnameAndPort","productName","_a","_b","emulatorHosts","getDefaultEmulatorHost","separatorIndex","lastIndexOf","port","getDefaultAppConfig","Deferred","reject","resolve","promise","Promise","wrapCallback","catch","getUA","navigator","isMobileCordova","test","isNodeSdk","FirebaseError","code","customData","super","setPrototypeOf","prototype","captureStackTrace","ErrorFactory","create","service","serviceName","errors","fullCode","template","data","PATTERN","replaceTemplate","fullMessage","jsonEval","decode","token","header","claims","signature","parts","contains","call","safeGet","isEmpty","fn","contextObj","res","deepEqual","aKeys","bKeys","k","includes","aProp","bProp","isObject","thing","Sha1","chain_","buf_","W_","pad_","inbuf_","total_","blockSize","reset","compress_","buf","offset","W","t","f","update","lengthMinusBlock","n","inbuf","digest","totalBits","j","errorPrefix","fnName","argName","stringLength","getModularInstance","_delegate","Component","instanceFactory","multipleInstances","serviceProps","instantiationMode","onInstanceCreated","setInstantiationMode","mode","setMultipleInstances","setServiceProps","props","setInstanceCreatedCallback","DEFAULT_ENTRY_NAME","Provider","container","component","instances","Map","instancesDeferred","instancesOptions","onInitCallbacks","identifier","normalizedIdentifier","normalizeInstanceIdentifier","has","deferred","set","isInitialized","shouldAutoInitialize","instance","getOrInitializeService","instanceIdentifier","getImmediate","options","optional","getComponent","setComponent","isComponentEager","instanceDeferred","entries","clearInstance","delete","services","from","values","all","INTERNAL","_delete","isComponentSet","getOptions","initialize","opts","onInit","existingCallbacks","Set","add","existingInstance","invokeOnInitCallbacks","callbacks","_ref","ComponentContainer","providers","addComponent","provider","getProvider","addOrOverwriteComponent","getProviders","LogLevel","levelStringToEnum","DEBUG","VERBOSE","INFO","WARN","ERROR","SILENT","defaultLogLevel","ConsoleMethod","defaultLogHandler","logType","logLevel","now","toISOString","_len","args","_key","Logger","_logLevel","_logHandler","_userLogHandler","val","TypeError","setLogLevel","logHandler","userLogHandler","debug","_len2","_key2","_len3","_key3","_len4","_key4","warn","_len5","_key5","_len6","_key6","idbProxyableTypes","cursorAdvanceMethods","cursorRequestMap","WeakMap","transactionDoneMap","transactionStoreNamesMap","transformCache","reverseTransformCache","idbProxyTraps","receiver","IDBTransaction","objectStoreNames","objectStore","wrap","wrapFunction","func","IDBDatabase","transaction","IDBCursor","advance","continue","continuePrimaryKey","apply","unwrap","storeNames","tx","sort","transformCachableValue","done","unlisten","removeEventListener","complete","DOMException","addEventListener","cacheDonePromiseForTransaction","object","IDBObjectStore","IDBIndex","some","Proxy","instanceOfAny","IDBRequest","request","success","then","promisifyRequest","newValue","readMethods","writeMethods","cachedMethods","getMethod","targetFuncName","useIndex","isWrite","storeName","store","index","shift","oldTraps","PlatformLoggerServiceImpl","getPlatformInfoString","isVersionServiceProvider","library","version","logString","logger","PLATFORM_LOG_STRING","name$q","name$p","name$n","name$o","name$l","name$m","name$k","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","app","_registerComponent","componentName","serverApp","_getProvider","heartbeatController","triggerHeartbeat","ERROR_FACTORY","FirebaseAppImpl","_isDeleted","_options","assign","_config","_name","_automaticDataCollectionEnabled","automaticDataCollectionEnabled","_container","checkDestroyed","isDeleted","appName","initializeApp","rawConfig","existingApp","newApp","registerVersion","libraryKeyOrName","variant","libraryMismatch","versionMismatch","warning","STORE_NAME","dbPromise","getDbPromise","blocked","upgrade","blocking","terminated","indexedDB","openPromise","event","oldVersion","newVersion","db","openDB","createObjectStore","originalErrorMessage","writeHeartbeatsToIndexedDB","heartbeatObject","put","computeKey","idbGetError","appId","HeartbeatServiceImpl","_heartbeatsCache","_storage","HeartbeatStorageImpl","_heartbeatsCachePromise","read","agent","date","getUTCDateString","heartbeats","lastSentHeartbeatDate","singleDateHeartbeat","hbTimestamp","valueOf","overwrite","getHeartbeatsHeader","heartbeatsToSend","unsentEntries","heartbeatsCache","maxSize","heartbeatEntry","find","hb","dates","countBytes","pop","extractHeartbeatsForHeader","headerString","_canUseIndexedDBPromise","runIndexedDBEnvironmentCheck","isIndexedDBAvailable","preExist","DB_CHECK_NAME","onsuccess","close","deleteDatabase","onupgradeneeded","onerror","idbHeartbeatObject","readHeartbeatsFromIndexedDB","heartbeatsObject","existingHeartbeatsObject","version$1","SDK_VERSION","setSDKVersion","DOMStorageWrapper","domStorage_","prefix_","removeItem","prefixedName_","storedVal","remove","toString","MemoryStorage","cache_","isInMemoryStorage","createStoragefor","domStorageName","domStorage","PersistentStorage","SessionStorage","logClient","LUIDGenerator","id","sha1","high","stringToByteArray","sha1Bytes","buildLogMessage_","arg","firstLog_","enableLogging$1","logger_","persistent","bind","varArgs","logWrapper","prefix","fatal","isInvalidJSONNumber","Number","POSITIVE_INFINITY","NEGATIVE_INFINITY","MIN_NAME","MAX_NAME","nameCompare","aAsInt","tryParseInt","bAsInt","stringCompare","requireKey","ObjectToUniqueKey","splitStringBySize","segsize","len","dataSegs","each","doubleToIEEE754String","v","bias","s","ln","Infinity","Math","abs","pow","min","floor","LN2","round","bits","reverse","hexByteString","hexByte","toLowerCase","INTEGER_REGEXP_","RegExp","intVal","exceptionGuard","stack","setTimeoutNonBlocking","time","timeout","Deno","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","FORGE_DOMAIN_RE","APP_CHECK_TOKEN_PARAM","WEBSOCKET","LONG_POLLING","RepoInfo","secure","namespace","webSocketOnly","nodeAdmin","persistenceKey","includeNamespaceInQueryParams","isUsingEmulator","_host","_domain","internalHost","isCacheableHost","isCustomHost","newHost","toURLString","query","repoInfoConnectionURL","repoInfo","params","connURL","repoInfoNeedsQueryParam","pairs","StatsCollection","counters_","incrementCounter","amount","collections","reporters","statsManagerGetCollection","hashString","PacketReceiver","onMessage_","pendingResponses","currentResponseNum","closeAfterResponse","onClose","closeAfter","responseNum","handleResponse","requestNum","toProcess","FIREBASE_LONGPOLL_START_PARAM","BrowserPollConnection","connId","applicationId","appCheckToken","authToken","transportSessionId","lastSessionId","bytesSent","bytesReceived","everConnected_","log_","stats_","urlFn","onMessage","onDisconnect","_this","curSegmentNum","onDisconnect_","myPacketOrderer","isClosed_","connectTimeoutTimer_","onClosed_","readyState","called","wrappedFn","attachEvent","executeWhenDOMReady","scriptTagHolder","FirebaseIFrameScriptHolder","command","arg1","arg2","arg3","arg4","incrementIncomingBytes_","clearTimeout","password","sendNewPolls","pN","urlParams","random","uniqueCallbackIdentifier","connectURL","addTag","start","startLongPoll","addDisconnectPingFrame","forceAllow","forceAllow_","forceDisallow","forceDisallow_","isAvailable","href","Windows","UI","markConnectionHealthy","shutdown_","myDisconnFrame","removeChild","send","dataStr","base64data","MAX_URL_DATA_SIZE","enqueueSegment","pw","src","style","display","commandCB","onMessageCB","outstandingRequests","pendingSegs","currentSerial","myIFrame","createIFrame_","script","iframeContents","doc","write","iframe","contentWindow","contentDocument","alive","textContent","myID","myPW","newRequest_","size","theURL","curDataString","theSeg","seg","ts","addLongPollTag_","segnum","totalsegs","url","serial","doNewRequest","keepaliveTimeout","readyStateCB","loadCB","doNodeLongPoll","newScript","onload","onreadystatechange","rstate","parentNode","WebSocketImpl","MozWebSocket","WebSocket","WebSocketConnection","keepaliveTimer","frames","totalFrames","connectionURL_","device","headers","platform","env","proxy","origin","mySock","onopen","onclose","onmessage","m","handleIncomingFrame","isOldAndroid","userAgent","oldAndroidRegex","oldAndroidMatch","previouslyFailed","appendFrame_","fullMess","jsonMess","handleNewFrameCount_","frameCount","extractFrameCount_","isNaN","mess","resetKeepAlive","remainingData","sendString_","clearInterval","setInterval","responsesRequiredToBeHealthy","healthyTimeout","TransportManager","initTransports_","ALL_TRANSPORTS","IS_TRANSPORT_INITIALIZED","globalTransportInitialized_","isWebSocketsAvailable","isSkipPollConnection","transports_","transports","transport","initialTransport","upgradeTransport","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","h","onHandshake_","onConnectionShutdown_","onReset_","sendPingOnPrimaryIfNecessary_","handshake","timestamp","sessionId","onConnectionEstablished_","tryStartUpgrade_","startUpgrade_","closeConnections_","reason","ServerActions","pathString","onComplete","hash","merge","refreshAuthToken","refreshAppCheckToken","onDisconnectPut","onDisconnectMerge","onDisconnectCancel","reportStats","stats","EventEmitter","allowedEvents_","listeners_","trigger","eventType","listeners","context","on","validateEventType_","eventData","getInitialEvent","off","splice","et","OnlineMonitor","online_","getInstance","currentlyOnline","Path","pathOrString","pieceNum","pieces_","copyTo","pieceNum_","newEmptyPath","pathGetFront","path","pathGetLength","pathPopFront","pathGetBack","pathSlice","begin","pathParent","pieces","pathChild","childPathObj","childPieces","pathIsEmpty","newRelativePath","outerPath","innerPath","outer","inner","pathEquals","other","pathContains","ValidationPath","errorPrefix_","parts_","byteLength_","max","validationPathCheckValid","validationPath","validationPathToErrorString","VisibilityMonitor","hidden","visibilityChange","visible_","visible","RECONNECT_MIN_DELAY","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_","onResponse","curReqNum","r","initConnection_","outstandingGet","_path","q","_queryObject","sendGet_","listen","currentHashFn","queryId","_queryIdentifier","_queryParams","isDefault","loadsAllData","listenSpec","hashFn","sendListen_","req","status","warnOnListenWarnings_","removeListen_","warnings","indexSpec","getIndex","indexPath","tryAuth","reduceReconnectDelayIfAdminCredential_","credential","isAdmin","tryAppCheck","authMethod","isValidFormat","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_","timeSinceLastConnectAttempt","reconnectDelay","onDataMessage","onReady","nextConnectionId_","canceled","connection","closeFn","sendRequestFn","interrupt","resume","delta","serverTimeOffset","normalizedPathString","statusCode","explanation","queries","clientName","NamedNode","node","Wrap","Index","getCompare","compare","indexedValueChanged","oldNode","newNode","oldWrapped","newWrapped","minPost","MIN","__EMPTY_NODE","KeyIndex","isDefinedOn","maxPost","makePost","indexValue","KEY_INDEX","SortedMapIterator","startKey","comparator","isReverse_","resultGenerator_","nodeStack_","cmp","right","getNext","hasNext","peek","LLRBNode","color","RED","SortedMap","EMPTY_NODE","copy","inorderTraversal","reverseTraversal","min_","minKey","maxKey","insert","fixUp_","removeMin_","isRed_","moveRedLeft_","smallest","rotateRight_","moveRedRight_","rotateLeft_","colorFlip_","nl","nr","checkMaxDepth_","blackDepth","check_","BLACK","comparator_","root_","getPredecessorKey","rightParent","getIterator","resultGenerator","getIteratorFrom","getReverseIteratorFrom","getReverseIterator","NAME_ONLY_COMPARATOR","NAME_COMPARATOR","MAX_NODE$2","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","PRIORITY_INDEX","aPriority","bPriority","indexCmp","LOG_2","Base12Num","num","current_","mask","bits_","nextBitIsOne","buildChildSet","childList","keyFn","mapSortFn","buildBalancedTree","low","namedNode","middle","root","base12","buildPennant","chunkSize","childTree","attachPennant","pennant","isOne","buildFrom12Array","_defaultIndexMap","fallbackObject","IndexMap","indexes_","indexSet_","Default","indexKey","sortedMap","hasIndex","indexDefinition","addIndex","existingChildren","sawIndexedValue","iter","newIndex","next","indexName","newIndexSet","newIndexes","addToIndexes","indexedChildren","existingSnap","newChildren","removeFromIndexes","ChildrenNode","children_","indexMap_","child","newIndexMap","newPriority","newImmediateChild","numKeys","allIntegerKeys","array","childHash","idx","resolveIndex_","predecessor","getFirstChildName","getFirstChild","getLastChildName","getLastChild","wrappedNode","startPost","iterator","endPost","MAX_NODE","otherChildrenNode","thisIter","otherIter","thisCurrent","otherCurrent","defineProperties","MAX","setMaxNode","nodeFromJSON","json","childData","children","childrenHavePriority","childSet","sortedChildSet","setNodeFromJSON","PathIndex","indexPath_","extractChild","snap","aChild","bChild","valueNode","VALUE_INDEX","changeValue","snapshotNode","changeChildAdded","changeChildRemoved","changeChildChanged","oldSnap","IndexedFilter","index_","newChild","affectedPath","optChangeAccumulator","oldChild","trackChildChange","updateFullNode","newSnap","filtersNodes","getIndexedFilter","RangedFilter","indexedFilter_","startPost_","getStartPost_","endPost_","getEndPost_","startIsInclusive_","startAfterSet_","endIsInclusive_","endBeforeSet_","getStartPost","getEndPost","matches","isWithinStart","isWithinEnd","filtered","hasStart","startName","getIndexStartName","getIndexStartValue","hasEnd","endName","getIndexEndName","getIndexEndValue","LimitedFilter","withinDirectionalStart","reverse_","withinEndPost","withinStartPost","withinDirectionalEnd","compareRes","rangedFilter_","limit_","getLimit","isViewFromLeft","fullLimitUpdateChild_","childKey","childSnap","changeAccumulator","oldEventCache","newChildNamedNode","windowBoundary","inRange","oldChildSnap","nextChild","getChildAfterChild","compareNext","newEventCache","QueryParams","limitSet_","startSet_","startNameSet_","endSet_","endNameSet_","viewFrom_","indexStartValue_","indexStartName_","indexEndValue_","indexEndName_","hasLimit","hasAnchoredLimit","queryParamsToRestQueryStringParameters","queryParams","qs","orderBy","startParam","endParam","queryParamsGetQueryObject","viewFrom","ReadonlyRestClient","listens_","getListenId_","listenId","thisListen","queryStringParameters","restRequest_","querystringParams","arrayVal","encodeURIComponent","querystring","xhr","XMLHttpRequest","responseText","SnapshotHolder","rootNode_","getNode","updateSnapshot","newSnapshotNode","newSparseSnapshotTree","sparseSnapshotTreeRemember","sparseSnapshotTree","clear","sparseSnapshotTreeForEachTree","prefixPath","tree","sparseSnapshotTreeForEachChild","StatsListener","collection_","last_","newStats","stat","StatsReporter","collection","server_","statsToReport_","statsListener_","reportStats_","reportedStats","haveStatsToReport","OperationType","newOperationSourceServerTaggedQuery","fromUser","fromServer","tagged","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_","eventGeneratorGenerateEventsForType","eventGenerator","events","changes","registrations","eventCache","filteredChanges","change","aWrapped","bWrapped","eventGeneratorCompareChanges","materializedChange","prevName","eventGeneratorMaterializeSingleChange","registration","respondsTo","createEvent","newViewCache","serverCache","viewCacheUpdateEventSnap","viewCache","eventSnap","viewCacheUpdateServerSnap","serverSnap","viewCacheGetCompleteEventSnap","viewCacheGetCompleteServerSnap","emptyChildrenSingleton","ImmutableTree","fromObject","childPath","findRootMostMatchingPathAndValue","relativePath","predicate","childExistingPathAndValue","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","writeTreeRemoveWrite","writeId","allWrites","findIndex","writeToRemove","removedWriteWasVisible","removedWriteOverlapsWithOtherWrites","currentWrite","writeTreeRecordContainsPath_","visibleWrites","writeTreeLayerTree_","writeTreeDefaultFilter_","lastWriteId","writeTreeResetTree_","writeRecord","writes","treeRoot","writePath","deepNode","writeTreeCalcCompleteEventCache","treePath","completeServerCache","writeIdsToExclude","includeHiddenWrites","subMerge","writeTreeRefCalcCompleteEventCache","writeTreeRef","writeTreeRefCalcCompleteEventChildren","completeServerChildren","completeChildren","topLevelSet","writeTreeCalcCompleteEventChildren","writeTreeRefCalcEventCacheAfterServerOverwrite","existingEventSnap","existingServerSnap","childMerge","writeTreeCalcEventCacheAfterServerOverwrite","writeTreeRefShadowingWrite","writeTreeShadowingWrite","writeTreeRefCalcIndexedSlice","completeServerData","toIterate","nodes","writeTreeCalcIndexedSlice","writeTreeRefCalcCompleteChild","existingServerCache","writeTreeCalcCompleteChild","writeTreeRefChild","ChildChangeAccumulator","changeMap","oldChange","oldType","getChanges","NO_COMPLETE_CHILD_SOURCE","getCompleteChild","WriteTreeCompleteChildSource","writes_","viewCache_","optCompleteServerCache_","serverNode","viewProcessorApplyOperation","viewProcessor","oldViewCache","operation","writesCache","completeCache","accumulator","filterServerNode","viewProcessorApplyUserOverwrite","viewProcessorApplyServerOverwrite","changedChildren","curViewCache","viewProcessorCacheHasChild","viewProcessorApplyUserMerge","viewProcessorApplyServerMerge","ackUserWrite","serverChildren","viewProcessorRevertUserWrite","ackPath","mergePath","serverCachePath","viewProcessorAckUserWrite","oldServerNode","viewProcessorGenerateEventCacheAfterServerEvent","viewProcessorListenComplete","isLeafOrEmpty","oldCompleteSnap","viewProcessorMaybeAddValueEvent","changePath","oldEventSnap","completeEventChildren","completeNode","oldEventNode","updatedPriority","childChangePath","newEventChild","eventChildUpdate","changedSnap","oldServerSnap","newServerCache","serverFilter","newServerNode","viewProcessorApplyMerge","viewMergeTree","childMergeTree","isUnknownDeepMerge","View","initialViewCache","eventRegistrations_","indexFilter","processor_","newViewProcessor","initialServerCache","initialEventCache","eventGenerator_","viewGetCompleteServerCache","view","cache","viewIsEmpty","viewRemoveEventRegistration","eventRegistration","cancelError","cancelEvents","maybeEvent","createCancelEvent","remaining","existing","hasAnyCallback","concat","viewApplyOperation","viewGenerateEventsForChanges_","eventRegistrations","moves","eventGeneratorGenerateEventsForChanges","referenceConstructor$1","referenceConstructor","SyncPoint","views","syncPointApplyOperation","syncPoint","optCompleteServerCache","syncPointGetView","serverCacheComplete","eventCacheComplete","syncPointAddEventRegistration","viewAddEventRegistration","initialChanges","viewGetInitialEvents","syncPointRemoveEventRegistration","removed","hadCompleteView","syncPointHasCompleteView","viewQueryId","_repo","syncPointGetQueryViews","syncPointGetCompleteServerCache","syncPointViewForQuery","syncPointGetCompleteView","syncPointViewExistsForQuery","syncTreeNextQueryTag_","SyncTree","listenProvider_","syncPointTree_","pendingWriteTree_","tagToQueryMap","queryToTagMap","syncTreeApplyUserOverwrite","syncTree","newData","writeTreeAddOverwrite","syncTreeApplyOperationToSyncPoints_","syncTreeAckUserWrite","record","writeTreeGetWrite","syncTreeApplyServerOverwrite","syncTreeRemoveEventRegistration","skipListenerDedup","maybeSyncPoint","removedAndEvents","removingDefault","covered","parentSyncPoint","newViews","maybeChildSyncPoint","childMap","childViews","syncTreeCollectDistinctViewsForSubTree_","newQuery","syncTreeCreateListenerForView_","startListening","syncTreeQueryForListening_","syncTreeTagForQuery","defaultTag","stopListening","queryToRemove","tagToRemove","syncTreeMakeQueryKey_","removedQuery","removedQueryKey","removedQueryTag","syncTreeRemoveTags_","syncTreeApplyTaggedQueryOverwrite","queryKey","syncTreeQueryKeyForTag_","syncTreeParseQueryKey_","queryPath","syncTreeApplyTaggedOperation_","syncTreeAddEventRegistration","skipSetupListener","foundAncestorDefaultView","pathToSyncPoint","sp","childSyncPoint","viewAlreadyExists","queriesToStop","childQueries","queryToStop","syncTreeSetupListener_","syncTreeCalcCompleteEventCache","syncTreeGetServerValue","serverCacheNode","viewGetCompleteNode","syncTreeApplyOperationHelper_","syncPointTree","syncTreeApplyOperationDescendantsHelper_","childOperation","childServerCache","childWritesCache","viewGetServerCache","syncTreeApplyTaggedListenComplete","syncTreeApplyListenComplete","toUpperCase","errorForServerCode","splitIndex","ExistingValueProvider","DeferredValueProvider","syncTree_","path_","resolveDeferredLeafValue","existingVal","serverValues","resolveScalarDeferredValue","resolveComplexDeferredValue","op","unused","existingNode","resolveDeferredValueTree","resolveDeferredValue","resolveDeferredValueSnapshot","rawPri","leafNode","childrenNode","Tree","parent","childCount","treeSubTree","pathObj","treeGetValue","treeSetValue","treeUpdateParents","treeHasChildren","treeForEachChild","treeForEachDescendant","includeSelf","childrenFirst","treeGetPath","childEmpty","treeIsEmpty","childExists","treeUpdateChild","INVALID_KEY_REGEX_","INVALID_PATH_REGEX_","MAX_LEAF_SIZE_","isValidKey","isValidPathString","validateFirebaseData","hasDotValue","hasActualChild","validationPathPush","last","validationPathPop","validatePathString","argumentName","validateUrl","parsedUrl","isValidRootPathString","EventQueue","eventLists_","recursionDepth_","eventQueueQueueEvents","eventQueue","eventDataList","currList","getPath","eventQueueRaiseEventsForChangedPath","changedPath","eventQueueRaiseQueuedEventsMatchingPredicate","eventPath","sentAll","eventList","eventListRaise","eventFn","getEventRunner","INTERRUPT_REASON","Repo","forceRestClient_","appCheckProvider_","dataUpdateCount","eventQueue_","nextWriteId_","interceptServerDataCallback_","transactionQueueTree_","persistentConnection_","repoStart","repo","authOverride","isMerge","repoOnDataUpdate","repoOnConnectStatus","connectStatus","repoUpdateInfo","repoOnServerInfoUpdate","statsReporter_","creatorFunction","statsManagerGetOrCreateReporter","infoData_","infoSyncTree_","infoEvents","serverSyncTree_","repoServerTime","repoGenerateServerValues","taggedChildren","raw","changeTree","syncTreeApplyTaggedQueryMerge","taggedSnap","syncTreeApplyServerMerge","repoRerunTransactions","repoLog","resolvedOnDisconnectTree","resolved","repoAbortTransactions","repoRunOnDisconnectEvents","repoGetNextWriteId","repoInterrupt","_key7","repoGetLatestState","excludeSets","repoSendReadyTransactions","repoPruneCompletedTransactionsBelowNode","queue","repoBuildTransactionQueue","every","setsToIgnore","txn","currentWriteId","latestState","snapToSend","latestHash","retryCount","currentOutputSnapshotRaw","dataToSend","pathToSend","currentOutputSnapshotResolved","unwatcher","abortReason","repoSendTransactionQueue","rootMostTransactionNode","repoGetAncestorTransactionNode","txnsToRerun","abortTransaction","currentNode","currentInputSnapshot","newDataNode","oldWriteId","newNodeResolved","applyLocally","repoRerunTransactionQueue","transactionNode","transactionQueue","repoAggregateTransactionQueuesForNode","order","nodeQueue","to","treeForEachAncestor","repoAbortTransactionsOnNode","lastSent","parseRepoInfo","dataURL","parseDatabaseURL","scheme","subdomain","colonInd","slashInd","questionMarkInd","pathStringDecoded","piece","decodePath","queryString","results","segment","kv","decodeQuery","hostWithoutPort","dotInd","PUSH_CHARS","lastPushTime","lastRandChars","DataEvent","snapshot","ref","getEventType","exportVal","CancelEvent","CallbackContext","snapshotCallback","cancelCallback","onValue","expDataSnapshot","previousChildName","onCancel","hasCancelCallback","userCallback","QueryImpl","_orderByCalled","ReferenceImpl","isEqual","sameRepo","samePath","sameQueryIdentifier","toJSON","pathToUrlEncodedString","parentPath","DataSnapshot","_node","_index","childRef","exists","hasChildren","_checkNotDeleted","_root","callbackContext","ValueEventRegistration","cached","err","repoGetValue","syncPointSetReferenceConstructor","syncTreeSetReferenceConstructor","repos","useRestClient","repoManagerDatabaseFromApp","authProvider","dbUrl","databaseURL","projectId","isEmulator","dbEmulatorHost","authTokenProvider","appRepos","repoManagerCreateRepo","Database","_repoInternal","_instanceStarted","_rootInternal","repoManagerDeleteRepo","apiName","simpleListen","echo","onEcho","_ref2","registerDatabase","apiKey","authDomain","storageBucket","messagingSenderId","getApp","emulator","tokenProvider","mockUserToken","uid","project","iat","sub","user_id","iss","aud","exp","auth_time","firebase","sign_in_provider","identities","alg","createMockUserToken","repoManagerApplyEmulatorSettings","connectDatabaseEmulator","getDatabase","siteSlice","items","language","qp","setQP","setItems","setUserGenesis","setConfigurationFetched","lan","contenido","en","es","configuration","initConfig","fetchUser","user1","setUserFromGenesis","logoutUser","fetchConfiguration","setUserFromGenesisAsync","User","urlLogin","fetch","ok","text","xmlDoc","DOMParser","parseFromString","intResult","querySelector","strResult","pkPeopleID","MName","LName2","GuestType","Action","PopStateEventType","createBrowserHistory","getUrlBasedHistory","globalHistory","createLocation","usr","createPath","invariant","cond","getHistoryState","_extends","parsePath","parsedPath","hashIndex","searchIndex","getLocation","createHref","validateLocation","defaultView","v5Compat","history","Pop","handlePop","nextIndex","createURL","base","URL","replaceState","encodeLocation","Push","historyState","pushState","Replace","go","ResultType","matchRoutes","routes","locationArg","basename","stripBasename","branches","flattenRoutes","score","siblings","compareIndexes","routesMeta","meta","childrenIndex","rankRouteBranches","matchRouteBranch","parentsMeta","flattenRoute","route","caseSensitive","startsWith","joinPaths","computeScore","_route$path","exploded","explodeOptionalSegments","segments","first","rest","isOptional","endsWith","required","restExploded","subpath","paramRe","dynamicSegmentValue","indexRouteValue","emptySegmentValue","staticSegmentValue","splatPenalty","isSplat","initialScore","branch","matchedParams","matchedPathname","end","remainingPathname","matchPath","pathnameBase","normalizePathname","pattern","matcher","compiledParams","regexpSource","paramName","compilePath","captureGroups","memo","splatValue","startIndex","nextChar","getInvalidPathError","field","dest","getPathContributingMatches","getResolveToMatches","v7_relativeSplatPath","pathMatches","resolveTo","toArg","routePathnames","locationPathname","isPathRelative","isEmptyPath","toPathname","routePathnameIndex","toSegments","fromPathname","resolvePathname","normalizeSearch","normalizeHash","resolvePath","hasExplicitTrailingSlash","hasCurrentTrailingSlash","paths","AbortedDeferredError","isRouteErrorResponse","statusText","internal","validMutationMethodsArr","validRequestMethodsArr","Symbol","FUNC_ERROR_TEXT","HASH_UNDEFINED","PLACEHOLDER","WRAP_CURRY_RIGHT_FLAG","WRAP_PARTIAL_FLAG","WRAP_PARTIAL_RIGHT_FLAG","WRAP_ARY_FLAG","WRAP_REARG_FLAG","INFINITY","MAX_SAFE_INTEGER","NAN","MAX_ARRAY_LENGTH","wrapFlags","argsTag","arrayTag","boolTag","dateTag","errorTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reEmptyStringLeading","reEmptyStringMiddle","reEmptyStringTrailing","reEscapedHtml","reUnescapedHtml","reHasEscapedHtml","reHasUnescapedHtml","reEscape","reEvaluate","reInterpolate","reIsDeepProp","reIsPlainProp","rePropName","reRegExpChar","reHasRegExpChar","reTrimStart","reWhitespace","reWrapComment","reWrapDetails","reSplitDetails","reAsciiWord","reForbiddenIdentifierChars","reEscapeChar","reEsTemplate","reFlags","reIsBadHex","reIsBinary","reIsHostCtor","reIsOctal","reIsUint","reLatin","reNoMatch","reUnescapedString","rsAstralRange","rsComboRange","rsComboMarksRange","rsDingbatRange","rsLowerRange","rsUpperRange","rsVarRange","rsBreakRange","rsMathOpRange","rsApos","rsAstral","rsBreak","rsCombo","rsDigits","rsDingbat","rsLower","rsMisc","rsFitz","rsNonAstral","rsRegional","rsSurrPair","rsUpper","rsZWJ","rsMiscLower","rsMiscUpper","rsOptContrLower","rsOptContrUpper","reOptMod","rsOptVar","rsSeq","rsEmoji","rsSymbol","reApos","reComboMark","reUnicode","reUnicodeWord","reHasUnicode","reHasUnicodeWord","contextProps","templateCounter","typedArrayTags","cloneableTags","stringEscapes","freeParseFloat","freeParseInt","freeGlobal","freeSelf","Function","freeExports","exports","nodeType","freeModule","module","moduleExports","freeProcess","nodeUtil","types","require","binding","nodeIsArrayBuffer","isArrayBuffer","nodeIsDate","isDate","nodeIsMap","isMap","nodeIsRegExp","isRegExp","nodeIsSet","isSet","nodeIsTypedArray","isTypedArray","thisArg","arrayAggregator","setter","iteratee","arrayEach","arrayEachRight","arrayEvery","arrayFilter","resIndex","arrayIncludes","baseIndexOf","arrayIncludesWith","arrayMap","arrayPush","arrayReduce","initAccum","arrayReduceRight","arraySome","asciiSize","baseProperty","baseFindKey","eachFunc","baseFindIndex","fromIndex","fromRight","strictIndexOf","baseIsNaN","baseIndexOfWith","baseMean","baseSum","basePropertyOf","baseReduce","baseTimes","baseTrim","string","trimmedEndIndex","baseUnary","baseValues","cacheHas","charsStartIndex","strSymbols","chrSymbols","charsEndIndex","deburrLetter","escapeHtmlChar","escapeStringChar","chr","hasUnicode","mapToArray","overArg","transform","replaceHolders","placeholder","setToArray","setToPairs","stringSize","lastIndex","unicodeSize","stringToArray","unicodeToArray","asciiToArray","unescapeHtmlChar","runInContext","defaults","pick","arrayProto","funcProto","objectProto","coreJsData","funcToString","idCounter","maskSrcKey","exec","IE_PROTO","nativeObjectToString","objectCtorString","oldDash","reIsNative","Buffer","Uint8Array","allocUnsafe","getPrototype","getPrototypeOf","objectCreate","propertyIsEnumerable","spreadableSymbol","isConcatSpreadable","symIterator","symToStringTag","toStringTag","defineProperty","getNative","ctxClearTimeout","ctxNow","ctxSetTimeout","nativeCeil","ceil","nativeFloor","nativeGetSymbols","getOwnPropertySymbols","nativeIsBuffer","isBuffer","nativeIsFinite","isFinite","nativeJoin","nativeKeys","nativeMax","nativeMin","nativeNow","nativeParseInt","nativeRandom","nativeReverse","DataView","nativeCreate","metaMap","realNames","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","symbolToString","lodash","isObjectLike","LazyWrapper","LodashWrapper","wrapperClone","baseCreate","proto","baseLodash","chainAll","__wrapped__","__actions__","__chain__","__index__","__values__","__dir__","__filtered__","__iteratees__","__takeCount__","__views__","Hash","entry","ListCache","MapCache","SetCache","__data__","Stack","arrayLikeKeys","inherited","isArr","isArg","isArguments","isBuff","isType","skipIndexes","isIndex","arraySample","baseRandom","arraySampleSize","shuffleSelf","copyArray","baseClamp","arrayShuffle","assignMergeValue","eq","baseAssignValue","assignValue","objValue","assocIndexOf","baseAggregator","baseEach","baseAssign","copyObject","baseAt","skip","lower","upper","baseClone","bitmask","customizer","isDeep","isFlat","isFull","initCloneArray","getTag","isFunc","cloneBuffer","initCloneObject","getSymbolsIn","copySymbolsIn","keysIn","baseAssignIn","getSymbols","copySymbols","Ctor","cloneArrayBuffer","dataView","buffer","byteOffset","byteLength","cloneDataView","cloneTypedArray","regexp","cloneRegExp","symbol","initCloneByTag","stacked","subValue","getAllKeysIn","getAllKeys","baseConformsTo","baseDelay","wait","baseDifference","isCommon","valuesLength","computed","valuesIndex","templateSettings","getMapData","LARGE_ARRAY_SIZE","createBaseEach","baseForOwn","baseEachRight","baseForOwnRight","baseEvery","baseExtremum","isSymbol","baseFilter","baseFlatten","depth","isStrict","isFlattenable","baseFor","createBaseFor","baseForRight","baseFunctions","isFunction","baseGet","castPath","toKey","baseGetAllKeys","keysFunc","symbolsFunc","baseGetTag","isOwn","unmasked","getRawTag","objectToString","baseGt","baseHas","baseHasIn","baseIntersection","arrays","othLength","othIndex","caches","maxLength","seen","baseInvoke","baseIsArguments","baseIsEqual","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","convert","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","othProps","objStacked","othStacked","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","baseIsMatch","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","baseIsNative","baseIteratee","identity","baseMatchesProperty","baseMatches","property","baseKeys","isPrototype","baseKeysIn","nativeKeysIn","isProto","baseLt","baseMap","isArrayLike","getMatchData","matchesStrictComparable","isKey","isStrictComparable","hasIn","baseMerge","srcIndex","mergeFunc","isTyped","isArrayLikeObject","isPlainObject","toPlainObject","baseMergeDeep","baseNth","baseOrderBy","iteratees","orders","getIteratee","criteria","comparer","baseSortBy","objCriteria","othCriteria","ordersLength","compareAscending","compareMultiple","basePickBy","baseSet","basePullAll","basePullAt","indexes","previous","baseUnset","baseRepeat","baseRest","setToString","overRest","baseSample","baseSampleSize","nested","baseSetData","baseSetToString","constant","baseShuffle","baseSlice","baseSome","baseSortedIndex","retHighest","mid","baseSortedIndexBy","valIsNaN","valIsNull","valIsSymbol","valIsUndefined","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","setLow","baseSortedUniq","baseToNumber","baseToString","baseUniq","createSet","seenIndex","baseUpdate","updater","baseWhile","isDrop","baseWrapperValue","baseXor","baseZipObject","assignFunc","valsLength","castArrayLikeObject","castFunction","stringToPath","castRest","castSlice","arrayBuffer","typedArray","valIsDefined","valIsReflexive","composeArgs","partials","holders","isCurried","argsIndex","argsLength","holdersLength","leftIndex","leftLength","rangeLength","isUncurried","composeArgsRight","holdersIndex","rightIndex","rightLength","isNew","createAggregator","initializer","createAssigner","assigner","sources","guard","isIterateeCall","iterable","createCaseFirst","methodName","trailing","createCompounder","words","deburr","createCtor","thisBinding","createFind","findIndexFunc","createFlow","flatRest","funcs","prereq","thru","wrapper","getFuncName","funcName","getData","isLaziable","plant","createHybrid","partialsRight","holdersRight","argPos","ary","arity","isAry","isBind","isBindKey","isFlip","getHolder","holdersCount","countHolders","newHolders","createRecurry","arrLength","oldArray","reorder","createInverter","toIteratee","baseInverter","createMathOperation","operator","defaultValue","createOver","arrayFunc","createPadding","chars","charsLength","createRange","step","toFinite","baseRange","createRelationalOperation","toNumber","wrapFunc","isCurry","setData","setWrapToString","createRound","precision","toInteger","pair","noop","createToPairs","baseToPairs","createWrap","srcBitmask","newBitmask","isCombo","mergeData","createCurry","createPartial","createBind","customDefaultsAssignIn","customDefaultsMerge","customOmitClone","arrStacked","arrValue","flatten","otherFunc","isKeyable","stubArray","hasPath","hasFunc","isLength","ArrayBuffer","ctorString","isMaskable","stubFalse","otherArgs","shortOut","reference","details","insertWrapDetails","updateWrapDetails","getWrapDetails","lastCalled","stamp","rand","memoize","memoizeCapped","quote","subString","clone","difference","differenceBy","differenceWith","findLastIndex","head","intersection","mapped","intersectionBy","intersectionWith","pull","pullAll","pullAt","union","unionBy","unionWith","unzip","group","unzipWith","without","xor","xorBy","xorWith","zip","zipWith","chain","interceptor","wrapperAt","countBy","findLast","forEachRight","groupBy","invokeMap","keyBy","partition","sortBy","before","bindKey","WRAP_BIND_FLAG","debounce","lastArgs","lastThis","maxWait","timerId","lastCallTime","lastInvokeTime","leading","maxing","invokeFunc","shouldInvoke","timeSinceLastCall","timerExpired","trailingEdge","timeWaiting","remainingWait","debounced","isInvoking","leadingEdge","cancel","flush","defer","delay","resolver","memoized","Cache","negate","overArgs","transforms","funcsLength","partial","partialRight","rearg","gt","gte","isError","isInteger","isNumber","isString","lt","lte","toArray","iteratorToArray","remainder","toLength","isBinary","assignIn","assignInWith","assignWith","at","propsIndex","propsLength","defaultsDeep","mergeWith","invert","invertBy","invoke","omit","CLONE_DEEP_FLAG","basePick","pickBy","toPairs","toPairsIn","camelCase","word","capitalize","upperFirst","kebabCase","lowerCase","lowerFirst","snakeCase","startCase","upperCase","hasUnicodeWord","unicodeWords","asciiWords","attempt","bindAll","methodNames","flow","flowRight","methodOf","mixin","over","overEvery","overSome","basePropertyDeep","range","rangeRight","augend","addend","divide","dividend","divisor","multiply","multiplier","multiplicand","subtract","minuend","subtrahend","after","castArray","chunk","compact","conforms","baseConforms","properties","curry","curryRight","drop","dropRight","dropRightWhile","dropWhile","fill","baseFill","flatMap","flatMapDeep","flatMapDepth","flattenDeep","flattenDepth","flip","fromPairs","functions","functionsIn","initial","mapKeys","mapValues","matchesProperty","nthArg","omitBy","once","propertyOf","pullAllBy","pullAllWith","sampleSize","setWith","shuffle","sortedUniq","sortedUniqBy","separator","limit","spread","tail","take","takeRight","takeRightWhile","takeWhile","tap","throttle","toPath","isArrLike","unary","uniq","uniqBy","uniqWith","unset","updateWith","valuesIn","zipObject","zipObjectDeep","entriesIn","extend","extendWith","clamp","cloneDeep","cloneDeepWith","cloneWith","conformsTo","defaultTo","position","escape","escapeRegExp","findKey","findLastKey","forIn","forInRight","forOwn","forOwnRight","baseInRange","isBoolean","isElement","isEqualWith","isMatch","isMatchWith","isNative","isNil","isNull","isSafeInteger","isUndefined","isWeakMap","isWeakSet","strictLastIndexOf","maxBy","mean","meanBy","minBy","stubObject","stubString","stubTrue","nth","noConflict","pad","strLength","padEnd","padStart","radix","floating","temp","reduceRight","repeat","sample","sortedIndex","sortedIndexBy","sortedIndexOf","sortedLastIndex","sortedLastIndexBy","sortedLastIndexOf","sum","sumBy","settings","isEscaping","isEvaluating","imports","importsKeys","importsValues","interpolate","reDelimiters","evaluate","sourceURL","escapeValue","interpolateValue","esTemplateValue","evaluateValue","times","toLower","toSafeInteger","toUpper","trim","trimEnd","trimStart","truncate","omission","newEnd","unescape","uniqueId","eachRight","VERSION","isFilter","takeName","dropName","checkIteratee","isTaker","lodashFunc","retUnwrapped","isLazy","useLazy","isHybrid","isUnwrapped","onlyLazy","chainName","dir","isRight","getView","iterLength","takeCount","iterIndex","commit","wrapped","define","aa","da","ea","fa","ha","ia","ja","ka","la","ma","g","acceptsBooleans","attributeName","attributeNamespace","mustUseProperty","propertyName","sanitizeURL","removeEmptyString","z","ra","sa","ta","pa","qa","oa","removeAttribute","setAttribute","setAttributeNS","xlinkHref","ua","__SECRET_INTERNALS_DO_NOT_USE_OR_YOU_WILL_BE_FIRED","va","for","wa","ya","za","Aa","Ba","Ca","Da","Ea","Fa","Ga","Ha","Ia","Ja","Ka","La","A","Ma","Na","Oa","prepareStackTrace","Reflect","construct","l","displayName","Pa","render","Qa","$$typeof","_context","_payload","_init","Ra","Sa","Ta","nodeName","Va","_valueTracker","getOwnPropertyDescriptor","configurable","enumerable","setValue","stopTracking","Ua","Wa","checked","Xa","activeElement","Ya","defaultChecked","_wrapperState","initialChecked","Za","initialValue","controlled","ab","bb","cb","ownerDocument","eb","fb","selected","defaultSelected","disabled","gb","dangerouslySetInnerHTML","ib","jb","kb","lb","mb","nb","namespaceURI","innerHTML","firstChild","MSApp","execUnsafeLocalFunction","ob","lastChild","nodeValue","pb","animationIterationCount","aspectRatio","borderImageOutset","borderImageSlice","borderImageWidth","boxFlex","boxFlexGroup","boxOrdinalGroup","columnCount","columns","flex","flexGrow","flexPositive","flexShrink","flexNegative","flexOrder","gridArea","gridRow","gridRowEnd","gridRowSpan","gridRowStart","gridColumn","gridColumnEnd","gridColumnSpan","gridColumnStart","fontWeight","lineClamp","lineHeight","opacity","orphans","tabSize","widows","zIndex","zoom","fillOpacity","floodOpacity","stopOpacity","strokeDasharray","strokeDashoffset","strokeMiterlimit","strokeOpacity","strokeWidth","qb","rb","sb","setProperty","tb","menuitem","area","br","col","embed","hr","img","keygen","link","param","track","wbr","ub","vb","is","wb","xb","srcElement","correspondingUseElement","yb","zb","Ab","Bb","Cb","stateNode","Db","Eb","Fb","Gb","Hb","Ib","Jb","Kb","Lb","Mb","Nb","onError","Ob","Pb","Qb","Rb","Sb","Tb","Vb","alternate","return","flags","Wb","memoizedState","dehydrated","Xb","Zb","sibling","Yb","$b","ac","unstable_scheduleCallback","bc","unstable_cancelCallback","cc","unstable_shouldYield","dc","unstable_requestPaint","B","unstable_now","ec","unstable_getCurrentPriorityLevel","fc","unstable_ImmediatePriority","gc","unstable_UserBlockingPriority","hc","unstable_NormalPriority","ic","unstable_LowPriority","jc","unstable_IdlePriority","kc","lc","oc","clz32","pc","qc","rc","sc","tc","uc","pendingLanes","suspendedLanes","pingedLanes","entangledLanes","entanglements","vc","xc","yc","zc","Ac","eventTimes","Cc","C","Dc","Ec","Fc","Gc","Hc","Ic","Jc","Kc","Lc","Mc","Nc","Oc","Pc","Qc","Rc","Sc","pointerId","Tc","nativeEvent","blockedOn","domEventName","eventSystemFlags","targetContainers","Vc","Wc","isDehydrated","containerInfo","Xc","Yc","dispatchEvent","Zc","$c","ad","bd","cd","ReactCurrentBatchConfig","dd","ed","transition","fd","gd","hd","Uc","stopPropagation","jd","kd","ld","md","nd","od","keyCode","charCode","pd","qd","rd","_reactName","_targetInst","currentTarget","isDefaultPrevented","defaultPrevented","returnValue","isPropagationStopped","preventDefault","cancelBubble","persist","isPersistent","wd","xd","yd","sd","eventPhase","bubbles","cancelable","timeStamp","isTrusted","td","ud","detail","vd","Ad","screenX","screenY","clientX","clientY","pageX","pageY","ctrlKey","shiftKey","altKey","metaKey","getModifierState","zd","button","buttons","relatedTarget","fromElement","toElement","movementX","movementY","Bd","Dd","dataTransfer","Fd","Hd","animationName","elapsedTime","pseudoElement","Id","clipboardData","Jd","Ld","Md","Esc","Spacebar","Left","Up","Right","Down","Del","Win","Menu","Apps","Scroll","MozPrintableKey","Nd","Od","Alt","Control","Meta","Shift","Pd","Qd","locale","which","Rd","Td","pressure","tangentialPressure","tiltX","tiltY","twist","pointerType","isPrimary","Vd","touches","targetTouches","changedTouches","Xd","Yd","deltaX","wheelDeltaX","deltaY","wheelDeltaY","wheelDelta","deltaZ","deltaMode","Zd","$d","ae","be","documentMode","ce","de","ee","fe","ge","he","ie","le","datetime","email","month","tel","week","me","ne","oe","pe","qe","re","se","te","ue","ve","we","xe","ye","ze","oninput","Ae","detachEvent","Be","Ce","De","Ee","Fe","He","Ie","Je","Ke","nextSibling","Le","compareDocumentPosition","Me","HTMLIFrameElement","Ne","contentEditable","Oe","focusedElem","selectionRange","documentElement","selectionStart","selectionEnd","getSelection","rangeCount","anchorNode","anchorOffset","focusNode","focusOffset","setStart","removeAllRanges","addRange","setEnd","element","scrollLeft","top","scrollTop","focus","Pe","Qe","Re","Se","Te","Ue","Ve","We","animationend","animationiteration","animationstart","transitionend","Xe","Ye","Ze","animation","$e","af","bf","cf","df","ef","ff","gf","hf","lf","mf","nf","Ub","D","of","pf","qf","rf","sf","capture","passive","J","x","w","F","tf","uf","parentWindow","vf","wf","na","xa","$a","ba","je","ke","unshift","xf","yf","zf","Af","Bf","Cf","Df","Ef","__html","Ff","Gf","Hf","Jf","queueMicrotask","If","Kf","Lf","Mf","previousSibling","Nf","Of","Pf","Qf","Rf","Sf","Tf","Uf","E","G","Vf","H","Wf","Xf","Yf","contextTypes","__reactInternalMemoizedUnmaskedChildContext","__reactInternalMemoizedMaskedChildContext","Zf","childContextTypes","$f","ag","bg","getChildContext","cg","__reactInternalMemoizedMergedChildContext","dg","eg","fg","gg","hg","jg","kg","lg","mg","ng","og","pg","qg","rg","sg","tg","ug","vg","wg","xg","yg","I","zg","Ag","Bg","elementType","deletions","Cg","pendingProps","overflow","treeContext","retryLane","Dg","Eg","Fg","Gg","memoizedProps","Hg","Ig","Jg","Kg","Lg","defaultProps","Mg","Ng","Og","Pg","Qg","Rg","_currentValue","Sg","childLanes","Tg","dependencies","firstContext","lanes","Ug","Vg","memoizedValue","Wg","Xg","Yg","interleaved","Zg","$g","ah","updateQueue","baseState","firstBaseUpdate","lastBaseUpdate","shared","pending","effects","bh","ch","eventTime","lane","dh","K","eh","fh","gh","y","hh","ih","jh","refs","kh","nh","isMounted","_reactInternals","enqueueSetState","L","lh","mh","enqueueReplaceState","enqueueForceUpdate","oh","shouldComponentUpdate","isPureReactComponent","ph","contextType","qh","componentWillReceiveProps","UNSAFE_componentWillReceiveProps","rh","getDerivedStateFromProps","getSnapshotBeforeUpdate","UNSAFE_componentWillMount","componentWillMount","componentDidMount","sh","_owner","_stringRef","th","uh","vh","wh","xh","yh","implementation","zh","Ah","Bh","Ch","Dh","Eh","Fh","Gh","Hh","Ih","tagName","Jh","Kh","Lh","M","Mh","revealOrder","Nh","Oh","_workInProgressVersionPrimary","Ph","ReactCurrentDispatcher","Qh","Rh","N","O","P","Sh","Th","Uh","Vh","Q","Wh","Xh","Yh","Zh","$h","ai","bi","ci","baseQueue","di","ei","fi","lastRenderedReducer","hasEagerState","eagerState","lastRenderedState","gi","hi","ii","ji","ki","getSnapshot","li","mi","R","ni","lastEffect","stores","oi","pi","qi","ri","destroy","deps","si","ti","ui","vi","wi","xi","yi","zi","Ai","Bi","Ci","Di","Ei","Fi","Gi","Hi","Ii","Ji","readContext","useCallback","useContext","useEffect","useImperativeHandle","useInsertionEffect","useLayoutEffect","useMemo","useReducer","useRef","useState","useDebugValue","useDeferredValue","useTransition","useMutableSource","useSyncExternalStore","useId","unstable_isNewReconciler","identifierPrefix","Ki","Li","Mi","Ni","Oi","Pi","Qi","Ri","getDerivedStateFromError","componentDidCatch","Si","componentStack","Ti","pingCache","Ui","Vi","Wi","Xi","ReactCurrentOwner","Yi","Zi","$i","aj","bj","cj","dj","ej","baseLanes","cachePool","transitions","fj","gj","hj","ij","jj","UNSAFE_componentWillUpdate","componentWillUpdate","componentDidUpdate","kj","lj","pendingContext","mj","Aj","Bj","Cj","Dj","nj","oj","pj","fallback","qj","rj","tj","dataset","dgst","uj","vj","_reactRetry","sj","subtreeFlags","wj","xj","isBackwards","rendering","renderingStartTime","tailMode","yj","Ej","S","Fj","Gj","wasMultiple","multiple","suppressHydrationWarning","onClick","onclick","createElementNS","autoFocus","createTextNode","T","Hj","Ij","Jj","Kj","U","Lj","WeakSet","V","Mj","Nj","Oj","Qj","Rj","Sj","Tj","Uj","Vj","Wj","insertBefore","_reactRootContainer","Xj","X","Yj","Zj","ak","onCommitFiberUnmount","componentWillUnmount","bk","ck","dk","ek","fk","isHidden","gk","hk","ik","jk","kk","lk","__reactInternalSnapshotBeforeUpdate","Wk","mk","nk","pk","Y","Z","qk","rk","sk","tk","uk","vk","wk","xk","yk","zk","Ak","Bk","Ck","Dk","Ek","callbackNode","expirationTimes","expiredLanes","wc","callbackPriority","ig","Fk","Gk","Hk","Ik","Jk","Kk","Lk","Mk","Nk","Ok","Pk","finishedWork","finishedLanes","Qk","timeoutHandle","Rk","Sk","Tk","Uk","Vk","mutableReadLanes","Bc","Pj","onCommitFiberRoot","mc","onRecoverableError","Xk","onPostCommitFiberRoot","Yk","Zk","al","isReactComponent","pendingChildren","bl","mutableSourceEagerHydrationData","cl","pendingSuspenseBoundaries","el","fl","gl","hl","il","jl","zj","$k","ll","reportError","ml","_internalRoot","ol","pl","ql","sl","rl","unmount","unstable_scheduleHydration","querySelectorAll","tl","usingClientEntryPoint","Events","ul","findFiberByHostInstance","bundleType","rendererPackageName","vl","rendererConfig","overrideHookState","overrideHookStateDeletePath","overrideHookStateRenamePath","overrideProps","overridePropsDeletePath","overridePropsRenamePath","setErrorHandler","setSuspenseHandler","scheduleUpdate","currentDispatcherRef","findHostInstanceByFiber","findHostInstancesForRefresh","scheduleRefresh","scheduleRoot","setRefreshHandler","getCurrentFiber","reconcilerVersion","__REACT_DEVTOOLS_GLOBAL_HOOK__","wl","isDisabled","supportsFiber","inject","createPortal","dl","createRoot","unstable_strictMode","findDOMNode","flushSync","hydrate","hydrateRoot","hydratedSources","_getVersion","_source","unmountComponentAtNode","unstable_batchedUpdates","unstable_renderSubtreeIntoContainer","checkDCE","__reactRouterVersion","startTransitionImpl","React","ReactDOM","BrowserRouter","_ref4","future","historyRef","setStateImpl","v7_startTransition","setState","newState","Router","navigationType","isBrowser","ABSOLUTE_URL_REGEX","Link","_ref7","absoluteHref","relative","reloadDocument","preventScrollReset","unstable_viewTransition","_objectWithoutPropertiesLoose","_excluded","UNSAFE_NavigationContext","isExternal","currentUrl","targetUrl","useHref","internalOnClick","_temp","replaceProp","navigate","useNavigate","useLocation","useResolvedPath","isModifiedEvent","shouldProcessLinkClick","useLinkClickHandler","DataRouterHook","DataRouterStateHook","DataRouterContext","DataRouterStateContext","NavigationContext","LocationContext","RouteContext","outlet","isDataRoute","RouteErrorContext","useInRouterContext","UNSAFE_invariant","joinedPathname","useIsomorphicLayoutEffect","static","router","useDataRouterContext","UseNavigateStable","useCurrentRouteId","activeRef","fromRouteId","useNavigateStable","dataRouterContext","routePathnamesJson","UNSAFE_getResolveToMatches","useNavigateUnstable","OutletContext","useParams","routeMatch","_temp2","useRoutesImpl","dataRouterState","parentMatches","parentParams","parentPathnameBase","locationFromContext","_parsedLocationArg$pa","parsedLocationArg","parentSegments","renderedMatches","_renderMatches","DefaultErrorComponent","_state$errors","useDataRouterState","UseRouteError","routeId","useRouteError","lightgrey","preStyles","padding","backgroundColor","fontStyle","defaultErrorElement","RenderErrorBoundary","revalidation","errorInfo","routeContext","RenderedRoute","staticContext","errorElement","ErrorBoundary","_deepestRenderedBoundaryId","_dataRouterState2","_dataRouterState","errorIndex","renderFallback","fallbackIndex","v7_partialHydration","HydrateFallback","hydrateFallbackElement","loaderData","needsToRunLoader","lazy","shouldRenderHydrateFallback","alreadyWarned","getChildren","hookName","ctx","useRouteContext","thisRoute","Navigate","isStatic","jsonPath","Outlet","useOutlet","Route","_props","_ref5","basenameProp","locationProp","staticProp","navigationContext","locationContext","trailingPathname","Routes","_ref6","createRoutesFromChildren","hasErrorBoundary","shouldRevalidate","handle","__self","__source","Fragment","jsx","jsxs","forceUpdate","_status","_result","default","Children","only","Profiler","PureComponent","StrictMode","Suspense","cloneElement","createContext","_currentValue2","_threadCount","Consumer","_defaultValue","_globalName","createFactory","createRef","forwardRef","isValidElement","startTransition","unstable_act","sortIndex","performance","setImmediate","startTime","expirationTime","priorityLevel","scheduling","isInputPending","MessageChannel","port2","port1","postMessage","unstable_Profiling","unstable_continueExecution","unstable_forceFrameRate","unstable_getFirstCallbackNode","unstable_next","unstable_pauseExecution","unstable_runWithPriority","unstable_wrapCallback","useSyncExternalStoreWithSelector","hasValue","assertIsFunction","ensureIsArray","getDependencies","createSelectorArgs","itemTypes","assertIsArrayOfFunctions","Ref","WeakRef","deref","weakMapMemoize","fnNode","resultEqualityCheck","lastResult","resultsCount","cacheNode","objectCache","objectNode","primitiveCache","primitiveNode","terminatedNode","lastResultValue","clearCache","resetResultsCount","createSelectorCreator","memoizeOrOptions","memoizeOptionsFromArgs","createSelectorCreatorOptions","memoizeOptions","createSelector2","recomputations","dependencyRecomputations","directlyPassedOptions","resultFunc","combinedOptions","argsMemoize","argsMemoizeOptions","devModeChecks","finalMemoizeOptions","finalArgsMemoizeOptions","memoizedResultFunc","selector","inputSelectorResults","inputSelectorArgs","collectInputSelectorResults","resetDependencyRecomputations","resetRecomputations","withTypes","createSelector","createStructuredSelector","inputSelectorsObject","selectorCreator","assertIsObject","inputSelectorKeys","structuredSelector","composition","formatProdErrorMessage","symbol_observable_default","observable","randomString","actionTypes_default","INIT","REPLACE","PROBE_UNKNOWN_ACTION","createStore","reducer","preloadedState","enhancer","currentReducer","currentListeners","nextListeners","listenerIdCounter","isDispatching","ensureCanMutateNextListeners","subscribe","isSubscribed","listenerId","replaceReducer","nextReducer","outerSubscribe","observer","observeState","observerAsObserver","unsubscribe","combineReducers","reducerKeys","finalReducers","finalReducerKeys","shapeAssertionError","assertReducerShape","hasChanged","nextState","previousStateForKey","nextStateForKey","compose","createThunkMiddleware","extraArgument","thunk","withExtraArgument","composeWithDevTools","createDraftSafeSelector2","wrappedSelector","isDraft","createDraftSafeSelectorCreator","__REDUX_DEVTOOLS_EXTENSION_COMPOSE__","__REDUX_DEVTOOLS_EXTENSION__","createAction","prepareAction","actionCreator","prepared","isAction","Tuple","_Tuple","species","arr","prepend","freezeDraftable","isDraftable","createNextState","emplace","handler","inserted","buildGetDefaultMiddleware","immutableCheck","serializableCheck","actionCreatorCheck","middlewareArray","thunkMiddleware","SHOULD_AUTOBATCH","createQueueWithTimer","notify","rAF","requestAnimationFrame","buildGetDefaultEnhancers","middlewareEnhancer","autoBatch","enhancerArray","notifying","shouldNotifyAtEndOfTick","notificationQueued","queueCallback","queueNotification","notifyListeners","listener2","wrappedListener","autoBatchEnhancer","IS_PRODUCTION","configureStore","getDefaultMiddleware","middleware","devTools","enhancers","rootReducer","finalMiddleware","isPlainObject2","finalCompose","compose2","trace","middlewares","createStore2","middlewareAPI","applyMiddleware","getDefaultEnhancers","storeEnhancers","executeReducerBuilderCallback","builderCallback","actionsMap","actionMatchers","defaultCaseReducer","builder","addCase","typeOrActionCreator","addMatcher","addDefaultCase","nanoid","asyncThunkSymbol","getType","actionKey","buildCreateSlice","creators","cAT","asyncThunk","reducerPath","payloadCreator","_reducerDefinitionType","caseReducer","preparedReducer","prepare","buildReducerCreators","reducerNames","sliceCaseReducersByName","sliceCaseReducersByType","actionCreators","sliceMatchers","contextMethods","reducer2","exposeAction","name2","exposeCaseReducer","buildReducer","extraReducers","finalCaseReducers","mapOrBuilderCallback","getInitialState","finalActionMatchers","finalDefaultCaseReducer","frozenInitialState","caseReducers","_ref3","cr","previousState","isDraft2","isDraftable2","createNextState2","draft","createReducer","sM","reducerName","reducerDefinition","reducerDetails","createNotation","isAsyncThunkSliceReducerDefinition","maybeReducerWithPrepare","prepareCallback","isCaseReducerWithPrepareDefinition","handleNormalReducerDefinition","fulfilled","rejected","settled","handleThunkCaseReducerDefinition","selectSelf","injectedSelectorCache","_reducer","makeSelectorProps","reducerPath2","injected","selectSlice","sliceState","getSelectors","selectState","selectorCache","selectors","wrapSelector","injectInto","injectable","pathOpt","newReducerPath","rootState","_len11","_key11","unwrapped","assertFunction","expected","alm","getListenerEntryPropsFrom","effect","createListenerEntry","addListener","removeListener","NOTHING","DRAFTABLE","DRAFT_STATE","die","getArchtype","ownKeys","type_","propOrOldValue","latest","copy_","base_","shallowCopy","strict","descriptors","getOwnPropertyDescriptors","desc","writable","freeze","deep","isFrozen","dontMutateFrozenCollections","currentScope","plugins","getPlugin","pluginKey","plugin","getCurrentScope","usePatchesInScope","scope","patchListener","patches_","inversePatches_","patchListener_","revokeScope","leaveScope","drafts_","revokeDraft","parent_","enterScope","immer2","immer_","canAutoFreeze_","unfinalizedDrafts_","revoke_","revoked_","processResult","baseDraft","modified_","finalize","maybeFreeze","generateReplacementPatches_","rootScope","childValue","finalizeProperty","scope_","finalized_","resultEach","isSet2","generatePatches_","parentState","targetObject","rootPath","targetIsSet","assigned_","autoFreeze_","objectTraps","getDescriptorFromProto","draft_","readPropFromProto","prepareCopy","createProxy","current2","markChanged","deleteProperty","owner","arrayTraps","useStrictShallowCopy_","proxyMap_","proxySet_","isManual_","traps","revoke","revocable","createProxyProxy","currentImpl","immer","produce","recipe","defaultBase","base2","hasError","ip","produceWithPatches","patches","inversePatches","autoFreeze","setAutoFreeze","useStrictShallowCopy","setUseStrictShallowCopy","createDraft","finishDraft","applyPatches","patch","applyPatchesImpl","applyPatches_","ReactOriginal","ContextKey","gT","globalThis","getContext","contextMap","realContext","ReactReduxContext","notInitialized","createReduxContextHook","useReduxContext","refEquality","createSelectorHook","useReduxContext2","useSelector2","equalityFnOrOptions","equalityFn","subscription","getServerState","stabilityCheck","identityFunctionCheck","selectedState","addNestedSub","useSelector","REACT_ELEMENT_TYPE","REACT_PORTAL_TYPE","REACT_FRAGMENT_TYPE","REACT_STRICT_MODE_TYPE","REACT_PROFILER_TYPE","REACT_PROVIDER_TYPE","REACT_CONTEXT_TYPE","REACT_SERVER_CONTEXT_TYPE","REACT_FORWARD_REF_TYPE","REACT_SUSPENSE_TYPE","REACT_SUSPENSE_LIST_TYPE","REACT_MEMO_TYPE","REACT_LAZY_TYPE","ForwardRef","Memo","typeOf","$$typeofType","pureFinalPropsSelectorFactory","mapStateToProps","mapDispatchToProps","mergeProps","ownProps","stateProps","dispatchProps","mergedProps","areStatesEqual","areOwnPropsEqual","areStatePropsEqual","hasRunAtLeastOnce","handleSubsequentCalls","nextOwnProps","propsChanged","stateChanged","dependsOnOwnProps","nextStateProps","statePropsChanged","handleNewState","wrapMapToPropsConstant","getConstant","constantSelector","getDependsOnOwnProps","mapToProps","Boolean","wrapMapToPropsFunc","stateOrDispatch","createInvalidArgFactory","wrappedComponentName","defaultMergeProps","defaultNoopBatch","nullListeners","createSubscription","parentSub","subscriptionsAmount","selfSubscribed","handleChangeWrapper","onStateChange","trySubscribe","prev","createListenerCollection","tryUnsubscribe","cleanupListener","notifyNestedSubs","getListeners","shallowEqual","objA","objB","keysA","keysB","REACT_STATICS","getDefaultProps","mixins","propTypes","KNOWN_STATICS","caller","callee","MEMO_STATICS","TYPE_STATICS","getStatics","getOwnPropertyNames","objectPrototype","hoistNonReactStatics","targetComponent","sourceComponent","inheritedComponent","targetStatics","sourceStatics","descriptor","NO_SUBSCRIPTION_ARRAY","captureWrapperProps","lastWrapperProps","lastChildProps","renderIsScheduled","wrapperProps","childPropsFromStoreUpdate","strictEqual","connect_default","pure","areMergedPropsEqual","Context","initMapStateToProps","mapStateToPropsFactory","initMapDispatchToProps","boundActionCreators","bindActionCreators","mapDispatchToPropsFactory","initMergeProps","hasRunOnce","nextMergedProps","wrapMergePropsFunc","mergePropsFactory","shouldHandleStateChanges","WrappedComponent","selectorFactoryOptions","ConnectFunction","propsContext","reactReduxForwardedRef","reactReduxForwardedRef2","wrapperProps2","ContextToUse","contextValue","didStoreComeFromProps","didStoreComeFromContext","childPropsSelector","finalPropsSelectorFactory","subscription2","notifyNestedSubs2","overriddenContextValue","latestSubscriptionCallbackError","actualChildPropsSelector","subscribeForReact","reactListener","additionalSubscribeListener","didUnsubscribe","lastThrownError","checkForUpdates","latestStoreState","newChildProps","unsubscribeWrapper","subscribeUpdates","effectFunc","effectArgs","actualChildProps","renderedWrappedComponent","Connect","forwarded","Provider_default","serverState","createStoreHook","useStore2","useStore","createDispatchHook","useDispatch2","useDispatch","useSyncExternalStoreWithSelector2","initializeConnect","React2","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","loaded","__webpack_modules__","amdO","chunkIds","notFulfilled","chunkId","getter","__esModule","leafPrototypes","getProto","ns","def","definition","promises","miniCssF","inProgress","dataWebpackPrefix","needAttach","scripts","getElementsByTagName","getAttribute","charset","nc","onScriptComplete","doneFns","nmd","loadStylesheet","fullhref","existingLinkTags","dataHref","rel","existingStyleTags","findStylesheet","oldTag","linkTag","nonce","errorType","realHref","createStylesheet","installedCssChunks","miniCss","as","installedChunks","installedChunkData","realSrc","webpackJsonpCallback","parentChunkLoadingFunction","moreModules","runtime","chunkLoadingGlobal","chunkToChildrenMap","prefetch","chunks","App","getElementById","petitions","one","urlAPIDev","two","resArray","_jsx","className","alt","categories","offers"],"sourceRoot":""}