{"version":3,"file":"quill.core.js","mappings":";CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAe,MAAID,IAEnBD,EAAY,MAAIC,GACjB,CATD,CASGK,MAAM,WACT,2MCKA,MAAMC,UAAcC,EAAAA,UAClBC,MAAmD,CAAC,EAEpDC,KAAAA,GAIE,OAHwB,MAApBC,KAAKF,MAAMC,QACbC,KAAKF,MAAMC,MAsKjB,SAAoBE,GAAgC,IAAfC,IAAMC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,KAAAA,UAAA,GACzC,OAAOF,EACJK,YAAYC,EAAAA,UACZC,QAAO,CAACT,EAAOU,IACQ,IAAlBA,EAAKL,SACAL,EAEFA,EAAMW,OAAOD,EAAKE,QAASC,EAAcH,EAAM,CAAC,EAAGP,KACzD,IAAIW,MACNH,OAAO,KAAME,EAAcX,GAChC,CAhLyBa,CAAWd,OAEzBA,KAAKF,MAAMC,KACpB,CAEAgB,QAAAA,CAASC,EAAeZ,GACtBa,MAAMF,SAASC,EAAOZ,GACtBJ,KAAKF,MAAQ,CAAC,CAChB,CAEAoB,QAAAA,CAASF,EAAeZ,EAAgBe,EAAcR,GAChDP,GAAU,IACVJ,KAAKoB,OAAOC,MAAMF,EAAMG,EAAAA,MAAMC,OAC5BP,EAAQZ,IAAWJ,KAAKI,UAC1BJ,KAAKwB,OAAOL,EAAMR,GAGpBM,MAAMC,SACJF,EACAS,KAAKC,IAAItB,EAAQJ,KAAKI,SAAWY,EAAQ,GACzCG,EACAR,GAGJX,KAAKF,MAAQ,CAAC,EAChB,CAEA6B,QAAAA,CAASX,EAAeL,EAAeiB,GACrC,GAAW,MAAPA,EAGF,OAFAX,MAAMU,SAASX,EAAOL,EAAOiB,QAC7B5B,KAAKF,MAAQ,CAAC,GAGhB,GAAqB,IAAjBa,EAAMP,OAAc,OACxB,MAAMyB,EAAQlB,EAAMmB,MAAM,MACpBC,EAAOF,EAAMG,QACfD,EAAK3B,OAAS,IACZY,EAAQhB,KAAKI,SAAW,GAA2B,MAAtBJ,KAAKiC,SAASC,KAC7CjB,MAAMU,SAASF,KAAKC,IAAIV,EAAOhB,KAAKI,SAAW,GAAI2B,GAEnD/B,KAAKiC,SAASC,KAAKP,SAAS3B,KAAKiC,SAASC,KAAK9B,SAAU2B,GAE3D/B,KAAKF,MAAQ,CAAC,GAIhB,IAAIqC,EAAqBnC,KACzB6B,EAAMrB,QAAO,CAAC4B,EAAWC,KAEvBF,EAAQA,EAAML,MAAMM,GAAW,GAC/BD,EAAMR,SAAS,EAAGU,GACXA,EAAKjC,SACXY,EAAQe,EAAK3B,OAClB,CAEAkC,YAAAA,CAAarC,EAAYsC,GACvB,MAAM,KAAEC,GAASxC,KAAKiC,SACtBhB,MAAMqB,aAAarC,EAAMsC,GACrBC,aAAgBC,EAAAA,GAClBD,EAAKE,SAEP1C,KAAKF,MAAQ,CAAC,CAChB,CAEAM,MAAAA,GAIE,OAHyB,MAArBJ,KAAKF,MAAMM,SACbJ,KAAKF,MAAMM,OAASa,MAAMb,SAzET,GA2EZJ,KAAKF,MAAMM,MACpB,CAEAuC,YAAAA,CAAaC,EAAgBL,GAE3BtB,MAAM0B,aAAaC,EAAQL,GAC3BvC,KAAKF,MAAQ,CAAC,CAChB,CAEA+C,QAAAA,CAASC,GACP7B,MAAM4B,SAASC,GACf9C,KAAKF,MAAQ,CAAC,CAChB,CAEAiD,IAAAA,CAAK/B,GACH,OAAOC,MAAM8B,KAAK/B,GAAO,EAC3B,CAEAgC,WAAAA,CAAYC,GACVhC,MAAM+B,YAAYC,GAClBjD,KAAKF,MAAQ,CAAC,CAChB,CAEAgC,KAAAA,CAAMd,GAAgE,IAAjDkC,EAA0B/C,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAC7C,GAAI+C,IAAoB,IAAVlC,GAAeA,GAAShB,KAAKI,SAnGxB,GAmGoD,CACrE,MAAM+C,EAAQnD,KAAKmD,QACnB,OAAc,IAAVnC,GACFhB,KAAKoD,OAAOd,aAAaa,EAAOnD,MACzBA,OAGTA,KAAKoD,OAAOd,aAAaa,EAAOnD,KAAKqD,MAC9BF,EACT,CACA,MAAME,EAAOpC,MAAMa,MAAMd,EAAOkC,GAEhC,OADAlD,KAAKF,MAAQ,CAAC,EACPuD,CACT,EAEFzD,EAAM0D,SAAW,QACjB1D,EAAM2D,QAAU,IAChB3D,EAAM4D,aAAef,EAAAA,EACrB7C,EAAM6D,gBAAkB,CAAChB,EAAAA,EAAOiB,EAAAA,EAAQC,EAAAA,UAAWC,EAAAA,GAEnD,MAAMC,UAAmBF,EAAAA,UAIvBG,MAAAA,GACE7C,MAAM6C,SACN9D,KAAK+D,WAAa,IAAIC,EAAAA,gBAAgBhE,KAAKiE,QAC7C,CAEAlE,KAAAA,GACE,OAAO,IAAIc,MAAQH,OAAOV,KAAKW,QAAS,IACnCX,KAAKkE,aACLlE,KAAK+D,WAAWI,UAEvB,CAEA3C,MAAAA,CAAOL,EAAcR,GACnB,MAAMyD,EAAYpE,KAAKoB,OAAOC,MAAMF,EAAMG,EAAAA,MAAM+C,iBAC/B,MAAbD,GAEFpE,KAAK+D,WAAWK,UAAUA,EAAWzD,EAEzC,CAEAO,QAAAA,CAASF,EAAeZ,EAAgBe,EAAcR,GACpDX,KAAKwB,OAAOL,EAAMR,EACpB,CAEAgB,QAAAA,CAASX,EAAeL,EAAeiB,GACrC,GAAW,MAAPA,EAEF,YADAX,MAAMU,SAASX,EAAOL,EAAOiB,GAG/B,MAAMC,EAAQlB,EAAMmB,MAAM,MACpBC,EAAOF,EAAMyC,MACbC,EAAS1C,EAAM2C,KAAKnC,IACxB,MAAMF,EAAQnC,KAAKoB,OAAOqD,OAAO7E,EAAM0D,UAEvC,OADAnB,EAAMR,SAAS,EAAGU,GACXF,CAAK,IAERI,EAAMvC,KAAK8B,MAAMd,GACvBuD,EAAOG,SAASvC,IAEdnC,KAAKoD,OAAOd,aAAaH,EAAOI,EAAI,IAElCR,GAEF/B,KAAKoD,OAAOd,aAAatC,KAAKoB,OAAOqD,OAAO,OAAQ1C,GAAOQ,EAE/D,EAiBF,SAAS3B,EACPX,GAGyB,IAFzBiE,EAAgC/D,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EACpCD,IAAMC,UAAAC,OAAA,QAAAC,IAAAF,UAAA,KAAAA,UAAA,GAEN,OAAY,MAARF,EAAqBiE,GACrB,YAAajE,GAAgC,mBAAjBA,EAAKiE,UACnCA,EAAU,IACLA,KACAjE,EAAKiE,WAENhE,UAEKgE,EAAQ,eAIF,MAAfjE,EAAKmD,QAC4B,WAAjCnD,EAAKmD,OAAOuB,QAAQrB,UACpBrD,EAAKmD,OAAOuB,QAAQC,QAAU3E,EAAK0E,QAAQC,MAEpCV,EAEFtD,EAAcX,EAAKmD,OAAQc,EAAShE,GAC7C,CAvCA2D,EAAWe,MAAQtD,EAAAA,MAAMuD,4DCrLzB,MAAMpC,UAAckB,EAAAA,UAClB,YAAOhD,GAEP,CAEAkC,QAAAA,IACM7C,KAAK8E,MAAQ9E,KAAKqD,OACpBrD,KAAK0C,QAET,CAEAtC,MAAAA,GACE,OAAO,CACT,CAEAO,KAAAA,GACE,MAAO,EACT,EAEF8B,EAAMa,SAAW,QACjBb,EAAMc,QAAU,KAEhB,sDCtBA,MAAMwB,UAAkBC,EAAAA,eAExB,iECEA,MAAMC,UAAetB,EAAAA,UACnBuB,gBAAkB,SAClBA,iBAAmB,YACnBA,eAAiB,OACjBA,gBAAkB,SAElB,YAAOvE,GAEP,CAMAwE,WAAAA,CAAY/D,EAAoB6C,EAAsBmB,GACpDnE,MAAMG,EAAQ6C,GACdjE,KAAKoF,UAAYA,EACjBpF,KAAKqF,SAAWC,SAASC,eAAeN,EAAOO,UAC/CxF,KAAKiE,QAAQwB,YAAYzF,KAAKqF,UAC9BrF,KAAK0F,YAAc,CACrB,CAEAC,MAAAA,GAEqB,MAAf3F,KAAKoD,QAAgBpD,KAAKoD,OAAOJ,YAAYhD,KACnD,CAEAwB,MAAAA,CAAOL,EAAcR,GACnB,GAAyB,IAArBX,KAAK0F,YAEP,YADAzE,MAAMO,OAAOL,EAAMR,GAKrB,IAAIiC,EAAwB5C,KACxBgB,EAAQ,EACZ,KAAiB,MAAV4B,GAAkBA,EAAO+B,QAAQC,QAAUtD,EAAAA,MAAMuD,YACtD7D,GAAS4B,EAAOgD,OAAOhD,EAAOQ,QAC9BR,EAASA,EAAOQ,OAEJ,MAAVR,IACF5C,KAAK0F,YAAcT,EAAOO,SAASpF,OAEnCwC,EAAOC,WACPD,EAAO1B,SAASF,EAAOiE,EAAOO,SAASpF,OAAQe,EAAMR,GACrDX,KAAK0F,YAAc,EAEvB,CAEA1E,KAAAA,CAAM6E,EAAYD,GAChB,OAAIC,IAAS7F,KAAKqF,SAAiB,EAC5BpE,MAAMD,MAAM6E,EAAMD,EAC3B,CAEAxF,MAAAA,GACE,OAAOJ,KAAK0F,WACd,CAEAI,QAAAA,GACE,MAAO,CAAC9F,KAAKqF,SAAUrF,KAAKqF,SAASU,KAAK3F,OAC5C,CAEAsC,MAAAA,GACEzB,MAAMyB,SAEN1C,KAAKoD,OAAS,IAChB,CAEA4C,OAAAA,GACE,GAAIhG,KAAKoF,UAAUa,WAA4B,MAAfjG,KAAKoD,OAAgB,OAAO,KAC5D,MAAM8C,EAAQlG,KAAKoF,UAAUe,iBAG7B,KAC4B,MAA1BnG,KAAKiE,QAAQmC,WACbpG,KAAKiE,QAAQmC,YAAcpG,KAAKqF,UAGhCrF,KAAKiE,QAAQoC,WAAW/D,aACtBtC,KAAKiE,QAAQmC,UACbpG,KAAKiE,SAIT,MAAMqC,EAAetG,KAAK8E,gBAAgBlB,EAAAA,EAAW5D,KAAK8E,KAAO,KAC3DyB,EAAiBD,EAAeA,EAAalG,SAAW,EACxDoG,EAAexG,KAAKqD,gBAAgBO,EAAAA,EAAW5D,KAAKqD,KAAO,KAE3DoD,EAAWD,EAAeA,EAAazE,KAAO,IAC9C,SAAEsD,GAAarF,KAEf0G,EAAUrB,EAASU,KAAKjE,MAAMmD,EAAOO,UAAUmB,KAAK,IAO1D,IAAIC,EACJ,GAPAvB,EAASU,KAAOd,EAAOO,SAOnBc,EACFM,EAAiBN,GACbI,GAAWF,KACbF,EAAa3E,SAAS2E,EAAalG,SAAUsG,EAAUD,GACnDD,GACFA,EAAa9D,eAGZ,GAAI8D,EACTI,EAAiBJ,EACjBA,EAAa7E,SAAS,EAAG+E,OACpB,CACL,MAAMG,EAAcvB,SAASC,eAAemB,GAC5CE,EAAiB5G,KAAKoB,OAAOqD,OAAOoC,GACpC7G,KAAKoD,OAAOd,aAAasE,EAAgB5G,KAC3C,CAGA,GADAA,KAAK0C,SACDwD,EAAO,CAET,MAAMY,EAAcA,CAACjB,EAAYD,IAC3BU,GAAgBT,IAASS,EAAarC,QACjC2B,EAELC,IAASR,EACJkB,EAAiBX,EAAS,EAE/BY,GAAgBX,IAASW,EAAavC,QACjCsC,EAAiBG,EAAQtG,OAASwF,EAEpC,KAGHmB,EAAQD,EAAYZ,EAAMa,MAAMlB,KAAMK,EAAMa,MAAMnB,QAClDoB,EAAMF,EAAYZ,EAAMc,IAAInB,KAAMK,EAAMc,IAAIpB,QAClD,GAAc,OAAVmB,GAA0B,OAARC,EACpB,MAAO,CACLC,UAAWL,EAAe3C,QAC1BiD,YAAaH,EACbI,QAASP,EAAe3C,QACxBmD,UAAWJ,EAGjB,CACA,OAAO,IACT,CAEAK,MAAAA,CAAOC,EAA6BxE,GAClC,GACEwE,EAAUC,MAAMC,GAEM,kBAAlBA,EAASC,MAA4BD,EAAS5E,SAAW5C,KAAKqF,WAGlE,CACA,MAAMa,EAAQlG,KAAKgG,UACfE,IAAOpD,EAAQoD,MAAQA,EAC7B,CACF,CAYArD,QAAAA,CAASC,GAEP7B,MAAM4B,SAASC,GAEf,IAAI,OAAEM,GAAWpD,KACjB,KAAOoD,GAAQ,CACb,GAA+B,MAA3BA,EAAOa,QAAQV,QAAiB,CAClCvD,KAAK0F,YAAcT,EAAOO,SAASpF,OAEnCgD,EAAOsE,QAAQ1H,KAAK4F,OAAOxC,GAASpD,KAAKI,UAAUuH,SACnD3H,KAAK0F,YAAc,EACnB,KACF,CACAtC,EAASA,EAAOA,MAClB,CACF,CAEAzC,KAAAA,GACE,MAAO,EACT,EAGF,gECjMA,MAAMiH,EAAa,SASnB,MAAMC,UAAclE,EAAAA,UAKlBwB,WAAAA,CAAY/D,EAAoByE,GAC9B5E,MAAMG,EAAQyE,GACd7F,KAAK8H,YAAcxC,SAASyC,cAAc,QAC1C/H,KAAK8H,YAAYE,aAAa,kBAAmB,SACjDC,MAAMC,KAAKlI,KAAKiE,QAAQkE,YAAYzD,SAAS0D,IAC3CpI,KAAK8H,YAAYrC,YAAY2C,EAAU,IAEzCpI,KAAKqI,UAAY/C,SAASC,eAAeqC,GACzC5H,KAAKsI,WAAahD,SAASC,eAAeqC,GAC1C5H,KAAKiE,QAAQwB,YAAYzF,KAAKqI,WAC9BrI,KAAKiE,QAAQwB,YAAYzF,KAAK8H,aAC9B9H,KAAKiE,QAAQwB,YAAYzF,KAAKsI,WAChC,CAEAtH,KAAAA,CAAM6E,EAAYD,GAChB,OAAIC,IAAS7F,KAAKqI,UAAkB,EAChCxC,IAAS7F,KAAKsI,WAAmB,EAC9BrH,MAAMD,MAAM6E,EAAMD,EAC3B,CAEAI,OAAAA,CAAQH,GACN,IACIR,EADAa,EAAkC,KAEtC,MAAMnE,EAAO8D,EAAKE,KAAKjE,MAAM8F,GAAYjB,KAAK,IAC9C,GAAId,IAAS7F,KAAKqI,UAChB,GAAIrI,KAAK8E,gBAAgBlB,EAAAA,EAAU,CACjC,MAAM2E,EAAavI,KAAK8E,KAAK1E,SAC7BJ,KAAK8E,KAAKnD,SAAS4G,EAAYxG,GAC/BmE,EAAQ,CACNe,UAAWjH,KAAK8E,KAAKb,QACrBiD,YAAaqB,EAAaxG,EAAK3B,OAEnC,MACEiF,EAAWC,SAASC,eAAexD,GACnC/B,KAAKoD,OAAOd,aAAatC,KAAKoB,OAAOqD,OAAOY,GAAWrF,MACvDkG,EAAQ,CACNe,UAAW5B,EACX6B,YAAanF,EAAK3B,aAGbyF,IAAS7F,KAAKsI,aACnBtI,KAAKqD,gBAAgBO,EAAAA,GACvB5D,KAAKqD,KAAK1B,SAAS,EAAGI,GACtBmE,EAAQ,CACNe,UAAWjH,KAAKqD,KAAKY,QACrBiD,YAAanF,EAAK3B,UAGpBiF,EAAWC,SAASC,eAAexD,GAEnC/B,KAAKoD,OAAOd,aAAatC,KAAKoB,OAAOqD,OAAOY,GAAWrF,KAAKqD,MAC5D6C,EAAQ,CACNe,UAAW5B,EACX6B,YAAanF,EAAK3B,UAKxB,OADAyF,EAAKE,KAAO6B,EACL1B,CACT,CAEAmB,MAAAA,CAAOC,EAA6BxE,GAClCwE,EAAU5C,SAAS8C,IACjB,GACoB,kBAAlBA,EAASC,OACRD,EAAS5E,SAAW5C,KAAKqI,WACxBb,EAAS5E,SAAW5C,KAAKsI,YAC3B,CACA,MAAMpC,EAAQlG,KAAKgG,QAAQwB,EAAS5E,QAChCsD,IAAOpD,EAAQoD,MAAQA,EAC7B,IAEJ,EAGF,2ECxFA,MAAMxC,UAAe8E,EAAAA,WACnBtD,uBAA4C,CAACxB,EAAQjB,EAAAA,EAAOkB,EAAAA,UAAW8E,EAAAA,GAEvEvD,aAAe,CACb,SACA,SACA,OACA,YACA,SACA,SACA,OACA,SACA,QAGF,cAAOwD,CAAQ/I,EAAcgJ,GAC3B,MAAMC,EAAYlF,EAAOmF,MAAMC,QAAQnJ,GACjCoJ,EAAarF,EAAOmF,MAAMC,QAAQH,GACxC,OAAIC,GAAa,GAAKG,GAAc,EAC3BH,EAAYG,EAEjBpJ,IAASgJ,EACJ,EAELhJ,EAAOgJ,GACD,EAEH,CACT,CAEAzH,QAAAA,CAASF,EAAeZ,EAAgBe,EAAcR,GACpD,GACE+C,EAAOgF,QAAQ1I,KAAK2E,QAAQrB,SAAUnC,GAAQ,GAC9CnB,KAAKoB,OAAOC,MAAMF,EAAMG,EAAAA,MAAM0H,MAC9B,CACA,MAAM/I,EAAOD,KAAK0H,QAAQ1G,EAAOZ,GAC7BO,GACFV,EAAKgJ,KAAK9H,EAAMR,EAEpB,MACEM,MAAMC,SAASF,EAAOZ,EAAQe,EAAMR,EAExC,CAEAkC,QAAAA,CAASC,GAEP,GADA7B,MAAM4B,SAASC,GAEb9C,KAAKoD,kBAAkBM,GACvBA,EAAOgF,QAAQ1I,KAAK2E,QAAQrB,SAAUtD,KAAKoD,OAAOuB,QAAQrB,UAAY,EACtE,CACA,MAAMF,EAASpD,KAAKoD,OAAOsE,QAAQ1H,KAAK4F,SAAU5F,KAAKI,UAEvDJ,KAAK2C,aAAaS,GAClBA,EAAO6F,KAAKjJ,KACd,CACF,EAGF,8GC7DA,MAAMyI,UAAa7E,EAAAA,UAEnB,SAASsF,EAAWnH,GAClB,OAAOA,EAAKoH,QAAQ,YAAaC,IAEW,CACxC,IAAK,QACL,IAAK,OACL,IAAK,OACL,IAAK,SACL,IAAK,SAEUA,KAErB,6FCZA,MAAMC,GAAQC,UAAAA,GAAO,gBACN,CAAC,kBAAmB,YAAa,UAAW,SAEpD5E,SAAS6E,IACdjE,SAASkE,iBAAiBD,GAAW,WAAa,QAAAE,EAAAtJ,UAAAC,OAATsJ,EAAI,IAAAzB,MAAAwB,GAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAJD,EAAIC,GAAAxJ,UAAAwJ,GAC3C1B,MAAMC,KAAK5C,SAASsE,iBAAiB,kBAAkBlF,SAASmB,IAC9D,MAAMgE,EAAQC,EAAAA,EAAUC,IAAIlE,GACxBgE,GAASA,EAAMG,SACjBH,EAAMG,QAAQC,aAAaP,EAC7B,GAEJ,GAAE,IA2DJ,MAxDA,cAAsBQ,EACpBhF,cAAgB,CACdiF,cAAe,gBACfC,qBAAsB,uBACtBC,kBAAmB,oBACnBC,oBAAqB,sBACrBC,gBAAiB,kBACjBC,cAAe,gBACfC,oBAAqB,sBACrBC,iBAAkB,mBAClBC,YAAa,cACbC,yBAA0B,2BAC1BC,kBAAmB,oBACnBC,uBAAwB,yBACxBC,gBAAiB,mBAGnB7F,eAAiB,CACf8F,IAAK,MACLC,OAAQ,SACRC,KAAM,QAKR/F,WAAAA,GACElE,QACAjB,KAAKmL,aAAe,CAAC,EACrBnL,KAAKoL,GAAG,QAAS/B,EAAMgC,MACzB,CAEAC,IAAAA,GAAkC,QAAAC,EAAApL,UAAAC,OAA1BsJ,EAAI,IAAAzB,MAAAsD,GAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJ9B,EAAI8B,GAAArL,UAAAqL,GAGV,OAFAnC,EAAMoC,IAAIC,KAAKrC,KAAUK,GAElBzI,MAAMqK,QAAQ5B,EACvB,CAEAO,SAAAA,CAAU0B,GAAkC,QAAAC,EAAAzL,UAAAC,OAAjBsJ,EAAI,IAAAzB,MAAA2D,EAAA,EAAAA,EAAA,KAAAC,EAAA,EAAAA,EAAAD,EAAAC,IAAJnC,EAAImC,EAAA,GAAA1L,UAAA0L,IAC5B7L,KAAKmL,aAAaQ,EAAMlE,OAAS,IAAI/C,SAAQoH,IAAuB,IAAtB,KAAEjG,EAAI,QAAEkG,GAASD,GAC1DH,EAAM/I,SAAWiD,GAAQA,EAAKmG,SAASL,EAAM/I,UAC/CmJ,EAAQJ,KAAUjC,EACpB,GAEJ,CAEAuC,SAAAA,CAAU1C,EAAmB1D,EAAYkG,GAClC/L,KAAKmL,aAAa5B,KACrBvJ,KAAKmL,aAAa5B,GAAa,IAEjCvJ,KAAKmL,aAAa5B,GAAW2C,KAAK,CAAErG,OAAMkG,WAC5C,oCClEF,QAAmBI,yCCFnB,MAAMC,EAAS,CAAC,QAAS,OAAQ,MAAO,QAExC,IAAIC,EAA4B,OAEhC,SAAShD,EAAMiD,GACb,GAAID,GACED,EAAOtD,QAAQwD,IAAWF,EAAOtD,QAAQuD,GAAQ,SAAA5C,EAAAtJ,UAAAC,OAFnBsJ,EAAI,IAAAzB,MAAAwB,EAAA,EAAAA,EAAA,KAAAE,EAAA,EAAAA,EAAAF,EAAAE,IAAJD,EAAIC,EAAA,GAAAxJ,UAAAwJ,GAGpC4C,QAAQD,MAAW5C,EACrB,CAEJ,CAEA,SAAS8C,EACPC,GAEA,OAAOL,EAAO5L,QACZ,CAAC8I,EAAQgD,KACPhD,EAAOgD,GAAUjD,EAAMqD,KAAKH,QAASD,EAAQG,GACtCnD,IAET,CAAC,EAEL,CAEAkD,EAAUH,MAASM,IACjBN,EAAQM,CAAQ,EAElBtD,EAAMgD,MAAQG,EAAUH,MAExB,uCClBA,IATA,MACEnH,gBAAkB,CAAC,EAEnBC,WAAAA,CACY0E,GAEV,IADU+C,EAAmBzM,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAAC,KADxB0J,MAAAA,EAAY,KACZ+C,QAAAA,CACT,wLCGL,MAAMC,EAAQ,WA0Td,SAASC,EACPC,EACAC,EACAC,GAEA,GAAqB,IAAjBF,EAAM3M,OAAc,CACtB,MAAO8M,GAAUC,EAAYF,EAAM3I,OACnC,OAAI0I,GAAc,EACR,UAASE,KAEX,UAASA,KAAUJ,EAAgB,GAAIE,EAAa,EAAGC,IACjE,CACA,OAAO,MAAEhK,EAAK,OAAE2C,EAAM,OAAExF,EAAM,OAAEgN,EAAM,KAAE3F,MAAW4F,GAAQN,GACpDO,EAAKlJ,GAAa+I,EAAY1F,GACrC,GAAI2F,EAASJ,EAEX,OADAC,EAAMf,KAAKzE,GACP2F,IAAWJ,EAAa,EAClB,IAAGM,QAAUlJ,KAAamJ,EAChCtK,EACA2C,EACAxF,KACE0M,EAAgBO,EAAMD,EAAQH,KAE5B,IAAGK,SAAWR,EAAgBC,EAAOC,EAAa,EAAGC,KAE/D,MAAMO,EAAeP,EAAMA,EAAM7M,OAAS,GAC1C,GAAIgN,IAAWJ,GAAcvF,IAAS+F,EACpC,MAAQ,WAAUpJ,KAAamJ,EAC7BtK,EACA2C,EACAxF,KACE0M,EAAgBO,EAAMD,EAAQH,KAEpC,MAAOC,GAAUC,EAAYF,EAAM3I,OACnC,MAAQ,UAAS4I,KAAUJ,EAAgBC,EAAOC,EAAa,EAAGC,IACpE,CAEA,SAASM,EACPtN,EACAe,EACAZ,GAEQ,IADRqN,EAAMtN,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAEN,GAAI,SAAUF,GAA6B,mBAAdA,EAAKyN,KAChC,OAAOzN,EAAKyN,KAAK1M,EAAOZ,GAE1B,GAAIH,aAAgB2D,EAAAA,EAClB,OAAOsF,EAAAA,EAAAA,GAAWjJ,EAAKU,QAAQgN,MAAM3M,EAAOA,EAAQZ,IAEtD,GAAIH,aAAgB2N,EAAAA,WAAY,CAE9B,GAA8B,mBAA1B3N,EAAK0E,QAAQrB,SAA+B,CAC9C,MAAMyJ,EAAe,GAcrB,OAbA9M,EAAKgC,SAAS4L,UAAU7M,EAAOZ,GAAQ,CAAC6C,EAAO2C,EAAQkI,KACrD,MAAM5J,EACJ,YAAajB,GAAkC,mBAAlBA,EAAMiB,QAC/BjB,EAAMiB,UACN,CAAC,EACP6I,EAAMb,KAAK,CACTjJ,QACA2C,SACAxF,OAAQ0N,EACRV,OAAQlJ,EAAQkJ,QAAU,EAC1B3F,KAAMvD,EAAQ6J,MACd,IAEGjB,EAAgBC,GAAQ,EAAG,GACpC,CACA,MAAMiB,EAAkB,GAIxB,GAHA/N,EAAKgC,SAAS4L,UAAU7M,EAAOZ,GAAQ,CAAC6C,EAAO2C,EAAQkI,KACrDE,EAAM9B,KAAKqB,EAAYtK,EAAO2C,EAAQkI,GAAa,IAEjDL,GAAoC,SAA1BxN,EAAK0E,QAAQrB,SACzB,OAAO0K,EAAMrH,KAAK,IAEpB,MAAM,UAAEsH,EAAS,UAAEC,GAAcjO,EAAKgE,SAC/B8C,EAAOC,GAAOiH,EAAUnM,MAAO,IAAGoM,MAEzC,MAAc,WAAVnH,EACM,0CAAyCiH,EAAMrH,KAAK,OAAOK,IAE7D,GAAED,KAASiH,EAAMrH,KAAK,OAAOK,GACvC,CACA,OAAO/G,EAAKgE,mBAAmBkK,QAAUlO,EAAKgE,QAAQgK,UAAY,EACpE,CAEA,SAASG,EACPlK,EACAmK,GAEA,OAAOC,OAAOC,KAAKF,GAAU7N,QAC3B,CAACgO,EAAQrN,KACP,GAAqB,MAAjB+C,EAAQ/C,GAAe,OAAOqN,EAClC,MAAMC,EAAgBJ,EAASlN,GAa/B,OAZIsN,IAAkBvK,EAAQ/C,GAC5BqN,EAAOrN,GAAQsN,EACNxG,MAAMyG,QAAQD,GACnBA,EAAc3F,QAAQ5E,EAAQ/C,IAAS,EACzCqN,EAAOrN,GAAQsN,EAAcE,OAAO,CAACzK,EAAQ/C,KAG7CqN,EAAOrN,GAAQsN,EAGjBD,EAAOrN,GAAQ,CAACsN,EAAevK,EAAQ/C,IAElCqN,CAAM,GAEf,CAAC,EAEL,CAEA,SAASrB,EAAY1F,GACnB,MAAM6F,EAAe,YAAT7F,EAAqB,KAAO,KACxC,OAAQA,GACN,IAAK,UACH,MAAO,CAAC6F,EAAK,wBACf,IAAK,YACH,MAAO,CAACA,EAAK,0BACf,QACE,MAAO,CAACA,EAAK,IAEnB,CAEA,SAASsB,EAAe7O,GACtB,OAAOA,EAAMS,QAAO,CAACqO,EAAiBC,KACpC,GAAyB,iBAAdA,EAAGpO,OAAqB,CACjC,MAAMqB,EAAO+M,EAAGpO,OAAOyI,QAAQ,QAAS,MAAMA,QAAQ,MAAO,MAC7D,OAAO0F,EAAgBnO,OAAOqB,EAAM+M,EAAG/K,WACzC,CACA,OAAO8K,EAAgB3C,KAAK4C,EAAG,GAC9B,IAAIjO,KACT,CAEA,SAASkO,EAAUjD,EAA2BkD,GAAgB,IAA1C,MAAEhO,EAAK,OAAEZ,GAAe0L,EAC1C,OAAO,IAAImD,EAAAA,EAAMjO,EAAQgO,EAAQ5O,EACnC,CAmBA,MA9cA,MAIE+E,WAAAA,CAAY/D,GACVpB,KAAKoB,OAASA,EACdpB,KAAKD,MAAQC,KAAKkP,UACpB,CAEAC,UAAAA,CAAWpP,GACTC,KAAKoB,OAAOiG,SACZ,IAAI+H,EAAepP,KAAKoB,OAAOhB,SAC/BJ,KAAKoB,OAAOiO,aACZ,MAAMR,EAAkBD,EAAe7O,GACjCuP,EAAc,IAAIzO,KAyFxB,OAsVJ,SAAsB0O,GACpB,MAAMzN,EAAc,GAapB,OAZAyN,EAAI7K,SAASoK,IACc,iBAAdA,EAAGpO,OACEoO,EAAGpO,OAAOoB,MAAM,MACxB4C,SAAQ,CAACrC,EAAMrB,KACfA,GAAOc,EAAMoK,KAAK,CAAExL,OAAQ,KAAMqD,WAAY+K,EAAG/K,aACjD1B,GAAMP,EAAMoK,KAAK,CAAExL,OAAQ2B,EAAM0B,WAAY+K,EAAG/K,YAAa,IAGnEjC,EAAMoK,KAAK4C,EACb,IAGKhN,CACT,CA7b0B0N,CAAaX,EAAgBU,IAAI5B,SACzCnN,QAAO,CAACQ,EAAO8N,KAC3B,MAAM1O,EAASqP,EAAAA,GAAGrP,OAAO0O,GACzB,IAAI/K,EAAa+K,EAAG/K,YAAc,CAAC,EAC/B2L,GAA6B,EAC7BC,GAA4B,EAChC,GAAiB,MAAbb,EAAGpO,OAAgB,CAErB,GADA4O,EAAYM,OAAOxP,GACM,iBAAd0O,EAAGpO,OAAqB,CACjC,MAAMqB,EAAO+M,EAAGpO,OAChBiP,GACG5N,EAAK8N,SAAS,QACdT,GAAgBpO,KACbhB,KAAKoB,OAAO0O,WAAWjM,EAAAA,GAAY7C,GAAO,IAChDhB,KAAKoB,OAAOO,SAASX,EAAOe,GAC5B,MAAOM,EAAMuD,GAAU5F,KAAKoB,OAAOiB,KAAKrB,GACxC,IAAIkD,GAAU6L,EAAAA,EAAAA,GAAM,CAAC,GAAGnP,EAAAA,EAAAA,IAAcyB,IACtC,GAAIA,aAAgBzC,EAAAA,GAAO,CACzB,MAAOa,GAAQ4B,EAAKyN,WAAWvP,EAAAA,SAAUqF,GACrCnF,IACFyD,GAAU6L,EAAAA,EAAAA,GAAM7L,GAAStD,EAAAA,EAAAA,IAAcH,IAE3C,CACAsD,EAAaiM,EAAAA,aAAaC,KAAK/L,EAASH,IAAe,CAAC,CAC1D,MAAO,GAAyB,iBAAd+K,EAAGpO,OAAqB,CACxC,MAAMwP,EAAM5B,OAAOC,KAAKO,EAAGpO,QAAQ,GACnC,GAAW,MAAPwP,EAAa,OAAOlP,EACxB,MAAMmP,EAAwD,MAAxCnQ,KAAKoB,OAAOC,MAAM6O,EAAK5O,EAAAA,MAAM8O,QACnD,GAAID,GAEAf,GAAgBpO,GACdhB,KAAKoB,OAAO0O,WAAWjM,EAAAA,GAAY7C,GAAO,MAE5C2O,GAA4B,QAEzB,GAAI3O,EAAQ,EAAG,CACpB,MAAOP,EAAMmF,GAAU5F,KAAKoB,OAAO0O,WAAWvP,EAAAA,SAAUS,EAAQ,GAC5DP,aAAgBmD,EAAAA,EAEG,OADRnD,EAAKE,QACTiF,KACP8J,GAA6B,GAG/BjP,aAAgBkD,EAAAA,WAChBlD,EAAKkE,QAAQC,QAAUtD,EAAAA,MAAM+O,cAE7BX,GAA6B,EAEjC,CAGA,GAFA1P,KAAKoB,OAAOO,SAASX,EAAOkP,EAAKpB,EAAGpO,OAAOwP,IAEvCC,EAAe,CACjB,MAAO1P,GAAQT,KAAKoB,OAAO0O,WAAWvP,EAAAA,SAAUS,GAChD,GAAIP,EAAM,CACR,MAAMyD,GAAU6L,EAAAA,EAAAA,GAAM,CAAC,GAAGnP,EAAAA,EAAAA,IAAcH,IACxCsD,EAAaiM,EAAAA,aAAaC,KAAK/L,EAASH,IAAe,CAAC,CAC1D,CACF,CACF,CACAqL,GAAgBhP,CAClB,MAGE,GAFAkP,EAAYpD,KAAK4C,GAEC,OAAdA,EAAGc,QAAwC,iBAAdd,EAAGc,OAAqB,CACvD,MAAMM,EAAM5B,OAAOC,KAAKO,EAAGc,QAAQ,GACnC,GAAW,MAAPM,EAAa,OAAOlP,EACxBhB,KAAKoB,OAAOkP,cAActP,EAAOkP,EAAKpB,EAAGc,OAAOM,GAClD,CAEF5B,OAAOC,KAAKxK,GAAYW,SAASvD,IAC/BnB,KAAKoB,OAAOF,SAASF,EAAOZ,EAAQe,EAAM4C,EAAW5C,GAAM,IAE7D,MAAMoP,EAAkBb,EAA6B,EAAI,EACnDc,EAAcb,EAA4B,EAAI,EAIpD,OAHAP,GAAgBmB,EAAkBC,EAClClB,EAAYM,OAAOW,GACnBjB,EAAYmB,OAAOD,GACZxP,EAAQZ,EAASmQ,EAAkBC,CAAW,GACpD,GACHlB,EAAY9O,QAAO,CAACQ,EAAO8N,IACA,iBAAdA,EAAG2B,QACZzQ,KAAKoB,OAAOL,SAASC,EAAO8N,EAAG2B,QACxBzP,GAEFA,EAAQyO,EAAAA,GAAGrP,OAAO0O,IACxB,GACH9O,KAAKoB,OAAOsP,WACZ1Q,KAAKoB,OAAOyB,WACL7C,KAAKqH,OAAOwH,EACrB,CAEA8B,UAAAA,CAAW3P,EAAeZ,GAExB,OADAJ,KAAKoB,OAAOL,SAASC,EAAOZ,GACrBJ,KAAKqH,QAAO,IAAIxG,MAAQ+O,OAAO5O,GAAOyP,OAAOrQ,GACtD,CAEAwQ,UAAAA,CACE5P,EACAZ,GAEO,IADP8D,EAAgC/D,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEpCH,KAAKoB,OAAOiG,SACZiH,OAAOC,KAAKrK,GAASQ,SAASlD,IAC5BxB,KAAKoB,OAAOS,MAAMb,EAAOS,KAAKoP,IAAIzQ,EAAQ,IAAIsE,SAASrC,IACrDA,EAAKb,OAAOA,EAAQ0C,EAAQ1C,GAAQ,GACpC,IAEJxB,KAAKoB,OAAOyB,WACZ,MAAM9C,GAAQ,IAAIc,MAAQ+O,OAAO5O,GAAO4O,OAAOxP,GAAQ0Q,EAAAA,EAAAA,GAAU5M,IACjE,OAAOlE,KAAKqH,OAAOtH,EACrB,CAEAgR,UAAAA,CACE/P,EACAZ,GAEO,IADP8D,EAAgC/D,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEpCmO,OAAOC,KAAKrK,GAASQ,SAASlD,IAC5BxB,KAAKoB,OAAOF,SAASF,EAAOZ,EAAQoB,EAAQ0C,EAAQ1C,GAAQ,IAE9D,MAAMzB,GAAQ,IAAIc,MAAQ+O,OAAO5O,GAAO4O,OAAOxP,GAAQ0Q,EAAAA,EAAAA,GAAU5M,IACjE,OAAOlE,KAAKqH,OAAOtH,EACrB,CAEAiR,WAAAA,CAAYhQ,EAAeZ,GACzB,OAAOJ,KAAKD,MAAM4N,MAAM3M,EAAOA,EAAQZ,EACzC,CAEA8O,QAAAA,GACE,OAAOlP,KAAKoB,OAAOS,QAAQrB,QAAO,CAACT,EAAOsC,IACjCtC,EAAM4O,OAAOtM,EAAKtC,UACxB,IAAIc,KACT,CAEAoQ,SAAAA,CAAUjQ,GAAoD,IAArCZ,EAAMD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EAC5B0B,EAAgC,GAChCqP,EAAqB,GACV,IAAX9Q,EACFJ,KAAKoB,OAAO2B,KAAK/B,GAAO0D,SAAS3B,IAC/B,MAAO9C,GAAQ8C,EACX9C,aAAgBL,EAAAA,GAClBiC,EAAMqK,KAAKjM,GACFA,aAAgBM,EAAAA,UACzB2Q,EAAOhF,KAAKjM,EACd,KAGF4B,EAAQ7B,KAAKoB,OAAOS,MAAMb,EAAOZ,GACjC8Q,EAASlR,KAAKoB,OAAOd,YAAYC,EAAAA,SAAUS,EAAOZ,IAEpD,MAAO+Q,EAAaC,GAAe,CAACvP,EAAOqP,GAAQ1M,KAAK6M,IACtD,MAAMpR,EAAOoR,EAAMrP,QACnB,GAAY,MAAR/B,EAAc,MAAO,CAAC,EAC1B,IAAIiE,GAAUtD,EAAAA,EAAAA,IAAcX,GAC5B,KAAOqO,OAAOC,KAAKrK,GAAS9D,OAAS,GAAG,CACtC,MAAMH,EAAOoR,EAAMrP,QACnB,GAAY,MAAR/B,EAAc,OAAOiE,EACzBA,EAAUkK,GAAexN,EAAAA,EAAAA,IAAcX,GAAOiE,EAChD,CACA,OAAOA,CAAO,IAEhB,MAAO,IAAKiN,KAAgBC,EAC9B,CAEAE,OAAAA,CAAQtQ,EAAeZ,GACrB,MAAOiC,EAAMkP,GAAcvR,KAAKoB,OAAOiB,KAAKrB,GAC5C,GAAIqB,EAAM,CACR,MAAMmP,EAAanP,EAAKjC,SAExB,OADqBiC,EAAKjC,UAAYmR,EAAanR,IACd,IAAfmR,GAAoBnR,IAAWoR,GAC5CjE,EAAYlL,EAAMkP,EAAYnR,GAAQ,GAExCmN,EAAYvN,KAAKoB,OAAQJ,EAAOZ,GAAQ,EACjD,CACA,MAAO,EACT,CAEAqR,OAAAA,CAAQzQ,EAAeZ,GACrB,OAAOJ,KAAKgR,YAAYhQ,EAAOZ,GAC5BF,QAAQ4O,GAA4B,iBAAdA,EAAGpO,SACzB8D,KAAKsK,GAAOA,EAAGpO,SACfiG,KAAK,GACV,CAEA+K,cAAAA,CAAe1Q,EAAe2Q,GAC5B,MAAM9C,EAAkBD,EAAe+C,GACjCC,GAAS,IAAI/Q,MAAQ+O,OAAO5O,GAAO2N,OAAOE,GAEhD,OADA7O,KAAKoB,OAAOsQ,eAAe1Q,EAAO6N,GAC3B7O,KAAKqH,OAAOuK,EACrB,CAEAC,WAAAA,CAAY7Q,EAAe8Q,EAAenR,GAExC,OADAX,KAAKoB,OAAOO,SAASX,EAAO8Q,EAAOnR,GAC5BX,KAAKqH,QAAO,IAAIxG,MAAQ+O,OAAO5O,GAAON,OAAO,CAAE,CAACoR,GAAQnR,IACjE,CAEAoR,UAAAA,CACE/Q,EACAe,GAEO,IADPmC,EAAgC/D,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAOpC,OALA4B,EAAOA,EAAKoH,QAAQ,QAAS,MAAMA,QAAQ,MAAO,MAClDnJ,KAAKoB,OAAOO,SAASX,EAAOe,GAC5BuM,OAAOC,KAAKrK,GAASQ,SAASlD,IAC5BxB,KAAKoB,OAAOF,SAASF,EAAOe,EAAK3B,OAAQoB,EAAQ0C,EAAQ1C,GAAQ,IAE5DxB,KAAKqH,QACV,IAAIxG,MAAQ+O,OAAO5O,GAAON,OAAOqB,GAAM+O,EAAAA,EAAAA,GAAU5M,IAErD,CAEA8N,OAAAA,GACE,GAAoC,IAAhChS,KAAKoB,OAAOa,SAAS7B,OAAc,OAAO,EAC9C,GAAIJ,KAAKoB,OAAOa,SAAS7B,OAAS,EAAG,OAAO,EAC5C,MAAMH,EAAOD,KAAKoB,OAAOa,SAASO,KAClC,GAAIvC,GAAM0E,QAAQrB,WAAa1D,EAAAA,GAAM0D,SAAU,OAAO,EACtD,MAAMnB,EAAQlC,EACd,QAAIkC,EAAMF,SAAS7B,OAAS,IACrB+B,EAAMF,SAASO,gBAAgBC,EAAAA,CACxC,CAEAwP,YAAAA,CAAajR,EAAeZ,GAC1B,MAAM2B,EAAO/B,KAAKyR,QAAQzQ,EAAOZ,IAC1BiC,EAAMuD,GAAU5F,KAAKoB,OAAOiB,KAAKrB,EAAQZ,GAChD,IAAI8R,EAAe,EACfC,EAAS,IAAItR,KACL,MAARwB,IACF6P,EAAe7P,EAAKjC,SAAWwF,EAC/BuM,EAAS9P,EACNtC,QACA4N,MAAM/H,EAAQA,EAASsM,EAAe,GACtCxR,OAAO,OAEZ,MACMuP,EADWjQ,KAAKgR,YAAYhQ,EAAOZ,EAAS8R,GAC5BjC,MAAK,IAAIpP,MAAQH,OAAOqB,GAAM4M,OAAOwD,IACrDpS,GAAQ,IAAIc,MAAQ+O,OAAO5O,GAAO2N,OAAOsB,GAC/C,OAAOjQ,KAAKmP,WAAWpP,EACzB,CAEAsH,MAAAA,CACEuK,GAGO,IAFPtK,EAA2BnH,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,GAC9BiS,EAAwCjS,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,QAAGE,EAE3C,MAAMgS,EAAWrS,KAAKD,MACtB,GACuB,IAArBuH,EAAUlH,QACY,kBAAtBkH,EAAU,GAAGG,MAEbH,EAAU,GAAG1E,OAAOmD,KAAKuM,MAAMzF,IAC/B7M,KAAKoB,OAAOmR,KAAKjL,EAAU,GAAG1E,QAC9B,CAEA,MAAM4P,EAAWxS,KAAKoB,OAAOmR,KAAKjL,EAAU,GAAG1E,QACzCsB,GAAUtD,EAAAA,EAAAA,IAAc4R,GACxBxR,EAAQwR,EAAS5M,OAAO5F,KAAKoB,QAE7BqR,EAAWnL,EAAU,GAAGmL,SAAStJ,QAAQuJ,EAAAA,EAAWlN,SAAU,IAC9DmN,GAAU,IAAI9R,MAAQH,OAAO+R,GAE7B/L,GAAU,IAAI7F,MAAQH,OAAO8R,EAAS7R,SACtCiS,EAAwBR,GAAiB,CAC7CS,SAAU9D,EAAWqD,EAAcS,UAAW7R,GAC9C8R,SAAU/D,EAAWqD,EAAcU,UAAW9R,IAKhD4Q,GAHkB,IAAI/Q,MACnB+O,OAAO5O,GACP2N,OAAOgE,EAAQ1C,KAAKvJ,EAASkM,IACbpS,QAAO,CAACT,EAAO+O,IAC5BA,EAAGpO,OACEX,EAAMW,OAAOoO,EAAGpO,OAAQwD,GAE1BnE,EAAMmM,KAAK4C,IACjB,IAAIjO,MACPb,KAAKD,MAAQsS,EAASU,QAAQnB,EAChC,MACE5R,KAAKD,MAAQC,KAAKkP,WACb0C,IAAWoB,EAAAA,EAAAA,GAAQX,EAASU,QAAQnB,GAAS5R,KAAKD,SACrD6R,EAASS,EAASpC,KAAKjQ,KAAKD,MAAOqS,IAGvC,OAAOR,CACT,oDCpQF,EAnDA,MACEqB,aAAc,EAEd9N,WAAAA,CACU/D,EACA4I,GACR,KAFQ5I,OAAAA,EAAc,KACd4I,QAAAA,EAERhK,KAAKkT,gBACP,CAEQA,cAAAA,GACNlT,KAAKoB,OAAO6C,QAAQuF,iBAAiB,oBAAqBmC,IACnD3L,KAAKiT,aACRjT,KAAKmT,uBAAuBxH,EAC9B,IAGF3L,KAAKoB,OAAO6C,QAAQuF,iBAAiB,kBAAmBmC,IAClD3L,KAAKiT,aAIPG,gBAAe,KACbpT,KAAKqT,qBAAqB1H,EAAM,GAEpC,GAEJ,CAEQwH,sBAAAA,CAAuBxH,GAC7B,MAAM1L,EACJ0L,EAAM/I,kBAAkB0Q,KACpBtT,KAAKoB,OAAOmR,KAAK5G,EAAM/I,QAAQ,GAC/B,MAEF3C,GAAUA,aAAgB4H,EAAAA,IAC5B7H,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAO5I,yBAA0Be,GAC3D3L,KAAKoB,OAAOiO,aACZrP,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAO3I,kBAAmBc,GACpD3L,KAAKiT,aAAc,EAEvB,CAEQI,oBAAAA,CAAqB1H,GAC3B3L,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAO1I,uBAAwBa,GACzD3L,KAAKoB,OAAOsP,WACZ1Q,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAOzI,gBAAiBY,GAClD3L,KAAKiT,aAAc,CACrB,aC7CF,MAGMQ,EAAkBC,IACtB,MAAMC,EAAOD,EAAQE,wBACfC,EACH,gBAAiBH,GAChBjS,KAAKqS,IAAIH,EAAKI,OAAUL,EAAwBM,aAClD,EACIC,EACH,iBAAkBP,GACjBjS,KAAKqS,IAAIH,EAAKO,QAAWR,EAAwBS,cACnD,EACF,MAAO,CACLC,IAAKT,EAAKS,IACVC,MAAOV,EAAKW,KAAOZ,EAAQa,YAAcV,EACzCW,OAAQb,EAAKS,IAAMV,EAAQe,aAAeR,EAC1CK,KAAMX,EAAKW,KACZ,EAGGI,EAAqB/T,IACzB,MAAMgU,EAASC,SAASjU,EAAO,IAC/B,OAAOkU,OAAOC,MAAMH,GAAU,EAAIA,CAAM,EAKpCI,EAAoBA,CACxBC,EACAC,EACAC,EACAC,EACAC,EACAC,IAEIL,EAAcE,GAAeD,EAAYE,EACpC,EAGLH,EAAcE,IACPA,EAAcF,EAAcI,GAGnCH,EAAYE,EACPF,EAAYD,EAAcG,EAAYD,EACzCF,EAAcI,EAAqBF,EACnCD,EAAYE,EAAYE,EAEvB,ECtDT,MACMC,EAAe,CAAC,QAAS,QAAS,SAAU,SAAU,SAAU,QCwBtE,MAAMjM,GAAQC,EAAAA,EAAAA,GAAO,SAEfiM,EAAiB,IAAIC,EAAAA,SAC3BA,EAAAA,WAAqBC,QAAU,QAsB/B,MAAMC,EACJxQ,gBAAkB,CAChByQ,OAAQ,KACRC,QAAS,CACPC,WAAW,EACXC,UAAU,EACVC,SAAS,EACTC,UAAU,GAEZC,YAAa,GACbC,UAAU,EACVC,SAAUZ,EACVa,MAAO,WAETlR,cAAgBqO,EAAAA,EAAQC,OACxBtO,eAAiBqO,EAAAA,EAAQ8C,QACzBnR,eAAgE,wCAEhEA,eAA0C,CACxCnF,MAAOc,IACPyV,UAAWd,EACX,cAAee,EAAAA,EACf,aAAcC,EAAAA,GAGhB,YAAOnN,CAAMoN,IACG,IAAVA,IACFA,EAAQ,OAEVnN,EAAAA,EAAO+C,MAAMoK,EACf,CAEA,WAAOlE,CAAK1M,GAA4B,IAAhB6Q,EAAMvW,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAC5B,OAAO2J,EAAAA,EAAUC,IAAIlE,IAAS0P,EAAehD,KAAK1M,EAAM6Q,EAC1D,CAOA,aAAOC,CAAOxV,GAIZ,OAH0B,MAAtBnB,KAAK4W,QAAQzV,IACfkI,EAAMgC,MAAO,iBAAgBlK,sCAExBnB,KAAK4W,QAAQzV,EACtB,CAEA,eAAO0V,CACL9T,EAKAH,GAEA,IADAkU,EAAS3W,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAET,GAAoB,iBAAT4C,EAAmB,CAC5B,MAAM5B,EAAO,aAAc4B,EAAOA,EAAKgU,SAAWhU,EAAKO,SACnC,iBAATnC,EAGTnB,KAAK6W,SAAU,WAAU1V,IAAQ4B,EAAMH,GAEvC0L,OAAOC,KAAKxL,GAAM2B,SAASwL,IAEzBlQ,KAAK6W,SAAS3G,EAAKnN,EAAKmN,GAAMtN,EAAO,GAG3C,MAC4B,MAAtB5C,KAAK4W,QAAQ7T,IAAkB+T,GACjCzN,EAAM2N,KAAM,eAAcjU,SAAaH,GAEzC5C,KAAK4W,QAAQ7T,GAAQH,GAElBG,EAAKkU,WAAW,WAAalU,EAAKkU,WAAW,cAC9CrU,GACkB,kBAAXA,GAEa,aAApBA,EAAOU,UAEPiS,EAAesB,SAASjU,GAGK,mBAApBA,EAAOiU,UAEhBjU,EAAOiU,SAAStB,EAGtB,CAmBApQ,WAAAA,CAAY+R,GAAwD,IAAvBtK,EAAgBzM,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAG/D,GAFAH,KAAK4M,QA4kBT,SACEuK,EACAvK,GAEA,MAAMsK,EAAYE,EAAgBD,GAClC,IAAKD,EACH,MAAM,IAAIG,MAAM,2BAGlB,MAEMjB,GADHxJ,EAAQwJ,OAASxJ,EAAQwJ,QAAUV,EAAM4B,SAASlB,MAEjDI,EAAAA,EACAd,EAAMiB,OAAQ,UAAS/J,EAAQwJ,SACnC,IAAKA,EACH,MAAM,IAAIiB,MAAO,iBAAgBzK,EAAQwJ,+BAG3C,MAAQR,QAAS2B,KAAwBC,GAAkB9B,EAAM4B,UACzD1B,QAAS6B,KAAwBC,GAAkBtB,EAAMkB,SAE3D1B,GAAsC7F,EAAAA,EAAAA,GAC1C,CAAC,EACD4H,EAAmBJ,GACnBI,EAAmBF,GACnBE,EAAmB/K,EAAQgJ,UAIhB,MAAXA,GACAA,EAAQgC,SACRhC,EAAQgC,QAAQzS,cAAgBmJ,SAEhCsH,EAAQgC,QAAU,CAChBV,UAAWtB,EAAQgC,UAIvB,MAAMC,EAAS,IAAKL,KAAkBE,KAAkB9K,GAExD,IAAIuJ,EAAWvJ,EAAQuJ,SAWvB,OAVIA,EACEvJ,EAAQ1I,SACVmF,EAAM2N,KAAK,6DAGbb,EAAWvJ,EAAQ1I,QDtxBW4T,EAChC5T,EACA6T,EACA1O,KAEA,MAAM8M,EAAW,IAAI6B,EAAAA,SA4BrB,OA3BA1C,EAAa5Q,SAASvD,IACpB,MAAM8W,EAAWF,EAAe1W,MAAMF,GAClC8W,GAAU9B,EAASU,SAASoB,EAAS,IAG3C/T,EAAQQ,SAASvD,IACf,IAAIK,EAASuW,EAAe1W,MAAMF,GAC7BK,GACH6H,EAAMgC,MACH,oBAAmBlK,qEAGxB,IAAI+W,EAAa,EACjB,KAAO1W,GAKL,GAJA2U,EAASU,SAASrV,GAClBA,EAAS,aAAcA,EAASA,EAAO2W,mBAAqB,KAAO,KAEnED,GAAc,EACVA,EA3BsB,IA2BgB,CACxC7O,EAAMgC,MACH,0DAAyDlK,MAE5D,KACF,CACF,IAGKgV,CAAQ,ECsvBT2B,CAA0BlL,EAAQ1I,QAAS2T,EAAO1B,SAAU9M,GAC5DwO,EAAO1B,SAGN,IACF0B,EACH1B,WACAe,YACAd,QACAR,QAAStH,OAAO8J,QAAQxC,GAASpV,QAC/B,CAAC6X,EAAmBC,KAAoB,IAAjBnX,EAAMR,GAAM2X,EACjC,IAAK3X,EAAO,OAAO0X,EAEnB,MAAME,EAAc7C,EAAMiB,OAAQ,WAAUxV,KAC5C,OAAmB,MAAfoX,GACFlP,EAAMgC,MACH,eAAclK,6CAEVkX,GAEF,IACFA,EAEH,CAAClX,IAAO4O,EAAAA,EAAAA,GAAM,CAAC,EAAGwI,EAAYjB,UAAY,CAAC,EAAG3W,GAC/C,GAEH,CAAC,GAEHgV,OAAQyB,EAAgBS,EAAOlC,QAEnC,CAzpBmB6C,CAAatB,EAAWtK,GACvC5M,KAAKkX,UAAYlX,KAAK4M,QAAQsK,UACR,MAAlBlX,KAAKkX,UAEP,YADA7N,EAAMgC,MAAM,0BAA2B6L,GAGrClX,KAAK4M,QAAQvD,OACfqM,EAAMrM,MAAMrJ,KAAK4M,QAAQvD,OAE3B,MAAMqE,EAAO1N,KAAKkX,UAAUhJ,UAAUuK,OACtCzY,KAAKkX,UAAUwB,UAAUC,IAAI,gBAC7B3Y,KAAKkX,UAAUhJ,UAAY,GAC3BpE,EAAAA,EAAU8O,IAAI5Y,KAAKkX,UAAWlX,MAC9BA,KAAKX,KAAOW,KAAK6Y,aAAa,aAC9B7Y,KAAKX,KAAKqZ,UAAUC,IAAI,YACxB3Y,KAAKgK,QAAU,IAAIuJ,EAAAA,EACnB,MAAMuF,EAAiBtD,EAAAA,WAAqBlS,SACtCyV,EAAa/Y,KAAK4M,QAAQuJ,SAAS9U,MAAMyX,GAC/C,IAAKC,KAAgB,aAAcA,GACjC,MAAM,IAAI1B,MACP,oCAAmCyB,WAiDxC,GA9CA9Y,KAAKoB,OAAS,IAAI2X,EAAW/Y,KAAK4M,QAAQuJ,SAAUnW,KAAKX,KAAM,CAC7D2K,QAAShK,KAAKgK,UAEhBhK,KAAKgZ,OAAS,IAAIC,EAAOjZ,KAAKoB,QAC9BpB,KAAKoF,UAAY,IAAI8T,EAAAA,EAAUlZ,KAAKoB,OAAQpB,KAAKgK,SACjDhK,KAAKmZ,YAAc,IAAIC,EAAYpZ,KAAKoB,OAAQpB,KAAKgK,SACrDhK,KAAKoW,MAAQ,IAAIpW,KAAK4M,QAAQwJ,MAAMpW,KAAMA,KAAK4M,SAC/C5M,KAAK8V,SAAW9V,KAAKoW,MAAMiD,UAAU,YACrCrZ,KAAK6V,UAAY7V,KAAKoW,MAAMiD,UAAU,aACtCrZ,KAAK+V,QAAU/V,KAAKoW,MAAMiD,UAAU,WACpCrZ,KAAKgW,SAAWhW,KAAKoW,MAAMiD,UAAU,YACrCrZ,KAAKoW,MAAMiD,UAAU,SACrBrZ,KAAKoW,MAAMiD,UAAU,UACrBrZ,KAAKoW,MAAMkD,OACXtZ,KAAKgK,QAAQoB,GAAGmI,EAAAA,EAAQC,OAAOrJ,eAAgB1C,IACzCA,IAAS8L,EAAAA,EAAQC,OAAO7I,aAC1B3K,KAAKX,KAAKqZ,UAAUa,OAAO,WAAYvZ,KAAKgZ,OAAOhH,UACrD,IAEFhS,KAAKgK,QAAQoB,GAAGmI,EAAAA,EAAQC,OAAOhJ,eAAe,CAACgP,EAAQlS,KACrD,MAAMuL,EAAW7S,KAAKoF,UAAUqU,WACzB3G,GAAY9S,KAAKoF,UAAUsU,WAC5BtH,EACJS,GAAYC,EAAW,CAAED,WAAUC,iBAAazS,EAClDsZ,EAAOjO,KACL1L,MACA,IAAMA,KAAKgZ,OAAO3R,OAAO,KAAMC,EAAW8K,IAC1CoH,EACD,IAEHxZ,KAAKgK,QAAQoB,GAAGmI,EAAAA,EAAQC,OAAO/I,qBAAqB,CAACxK,EAAMF,KACzD,MAAM8S,EAAW7S,KAAKoF,UAAUqU,WACzB3G,GAAY9S,KAAKoF,UAAUsU,WAC5BtH,EACJS,GAAYC,EAAW,CAAED,WAAUC,iBAAazS,EAClDsZ,EAAOjO,KACL1L,MACA,KACE,MAAM4R,GAAS,IAAI/Q,MAChB+O,OAAO3P,EAAK2F,OAAO5F,OACnB4P,OAAO,CAAE,CAAC3P,EAAK0E,QAAQrB,UAAWvD,IACrC,OAAOC,KAAKgZ,OAAO3R,OAAOuK,EAAQ,GAAIQ,EAAc,GAEtDsD,EAAMW,QAAQnL,KACf,IAECwC,EAAM,CACR,MAAMiE,EAAW3R,KAAK6V,UAAU+D,QAAQ,CACtClM,KAAO,GAAEA,eACT3L,KAAM,OAER/B,KAAK6Z,YAAYlI,EACnB,CACA3R,KAAK+V,QAAQ+D,QACT9Z,KAAK4M,QAAQqJ,aACfjW,KAAKX,KAAK2I,aAAa,mBAAoBhI,KAAK4M,QAAQqJ,aAEtDjW,KAAK4M,QAAQsJ,UACflW,KAAK+Z,UAEP/Z,KAAKga,oBAAqB,CAC5B,CAIAnB,YAAAA,CACE3B,GAE8B,IAD9B+C,EAAoB9Z,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,KAEvB,GAAyB,iBAAd+W,EAAwB,CACjC,MAAMgD,EAAYhD,GAClBA,EAAY5R,SAASyC,cAAc,QACzB2Q,UAAUC,IAAIuB,EAC1B,CAEA,OADAla,KAAKkX,UAAU5U,aAAa4U,EAAW+C,GAChC/C,CACT,CAEAiD,IAAAA,GACEna,KAAKoF,UAAUgV,SAAS,KAC1B,CAIAzJ,UAAAA,CACE3P,EACAZ,EACAoZ,GAIA,OADCxY,EAAOZ,EAAO,CAAGoZ,GAAUa,EAASrZ,EAAOZ,EAAQoZ,GAC7CG,EAAOjO,KACZ1L,MACA,IACSA,KAAKgZ,OAAOrI,WAAW3P,EAAOZ,IAEvCoZ,EACAxY,GACC,EAAIZ,EAET,CAEA2Z,OAAAA,GACE/Z,KAAKsa,QAAO,EACd,CAEAC,YAAAA,CAAgBC,GACdxa,KAAKga,oBAAqB,EAC1B,MAAMrZ,EAAQ6Z,IAEd,OADAxa,KAAKga,oBAAqB,EACnBrZ,CACT,CAEA2Z,MAAAA,GAAuB,IAAhBG,IAAOta,UAAAC,OAAA,QAAAC,IAAAF,UAAA,KAAAA,UAAA,GACZH,KAAKoB,OAAOkZ,OAAOG,GACnBza,KAAKkX,UAAUwB,UAAUa,OAAO,eAAgBkB,EAClD,CAEAC,KAAAA,GAAiD,IAA3C9N,EAAoCzM,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAC5CH,KAAKoF,UAAUsV,QACV9N,EAAQ+N,eACX3a,KAAK4a,yBAET,CAEApZ,MAAAA,CACEL,EACAR,GAEA,IADA6Y,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGoT,EAAAA,EAAQ8C,QAAQrL,IAExC,OAAO2O,EAAOjO,KACZ1L,MACA,KACE,MAAMkG,EAAQlG,KAAK6a,cAAa,GAChC,IAAIjJ,EAAS,IAAI/Q,KACjB,GAAa,MAATqF,EAAe,OAAO0L,EAC1B,GAAI5R,KAAKoB,OAAOC,MAAMF,EAAMqU,EAAAA,MAAgBjU,OAC1CqQ,EAAS5R,KAAKgZ,OAAOpI,WAAW1K,EAAMlF,MAAOkF,EAAM9F,OAAQ,CACzD,CAACe,GAAOR,QAEL,IAAqB,IAAjBuF,EAAM9F,OAEf,OADAJ,KAAKoF,UAAU5D,OAAOL,EAAMR,GACrBiR,EAEPA,EAAS5R,KAAKgZ,OAAOjI,WAAW7K,EAAMlF,MAAOkF,EAAM9F,OAAQ,CACzD,CAACe,GAAOR,GAEZ,CAEA,OADAX,KAAK8a,aAAa5U,EAAOqN,EAAAA,EAAQ8C,QAAQpL,QAClC2G,CAAM,GAEf4H,EAEJ,CAeA5I,UAAAA,CACE5P,EACAZ,EACAe,EACAR,EACA6Y,GAEA,IAAItV,EAUJ,OARClD,EAAOZ,EAAQ8D,EAASsV,GAAUa,EACjCrZ,EACAZ,EAEAe,EACAR,EACA6Y,GAEKG,EAAOjO,KACZ1L,MACA,IACSA,KAAKgZ,OAAOpI,WAAW5P,EAAOZ,EAAQ8D,IAE/CsV,EACAxY,EACA,EAEJ,CAeA+P,UAAAA,CACE/P,EACAZ,EACAe,EACAR,EACA6Y,GAEA,IAAItV,EAUJ,OARClD,EAAOZ,EAAQ8D,EAASsV,GAAUa,EAEjCrZ,EACAZ,EACAe,EACAR,EACA6Y,GAEKG,EAAOjO,KACZ1L,MACA,IACSA,KAAKgZ,OAAOjI,WAAW/P,EAAOZ,EAAQ8D,IAE/CsV,EACAxY,EACA,EAEJ,CAEA+Z,SAAAA,CAAU/Z,GAAkD,IAA3BZ,EAAMD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EACpCwV,EAAwB,KAM5B,GAJEA,EADmB,iBAAV3U,EACAhB,KAAKoF,UAAU2V,UAAU/Z,EAAOZ,GAEhCJ,KAAKoF,UAAU2V,UAAU/Z,EAAMA,MAAOA,EAAMZ,SAElDuV,EAAQ,OAAO,KACpB,MAAMqF,EAAkBhb,KAAKkX,UAAUtD,wBACvC,MAAO,CACLY,OAAQmB,EAAOnB,OAASwG,EAAgB5G,IACxCF,OAAQyB,EAAOzB,OACfI,KAAMqB,EAAOrB,KAAO0G,EAAgB1G,KACpCD,MAAOsB,EAAOtB,MAAQ2G,EAAgB1G,KACtCF,IAAKuB,EAAOvB,IAAM4G,EAAgB5G,IAClCL,MAAO4B,EAAO5B,MAElB,CAEA/C,WAAAA,GAA0D,IAA9ChQ,EAAKb,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EAAGC,EAAMD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGH,KAAKib,YAAcja,EAEjD,OADCA,EAAOZ,GAAUia,EAASrZ,EAAOZ,GAC3BJ,KAAKgZ,OAAOhI,YAAYhQ,EAAOZ,EACxC,CAMA6Q,SAAAA,GAGiC,IAF/BjQ,EAAiDb,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGH,KAAK6a,cAAa,GACtEza,EAAMD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EAET,MAAqB,iBAAVa,EACFhB,KAAKgZ,OAAO/H,UAAUjQ,EAAOZ,GAE/BJ,KAAKgZ,OAAO/H,UAAUjQ,EAAMA,MAAOA,EAAMZ,OAClD,CAEA8a,QAAAA,CAASjb,GACP,OAAOA,EAAK2F,OAAO5F,KAAKoB,OAC1B,CAEA6Z,SAAAA,GACE,OAAOjb,KAAKoB,OAAOhB,QACrB,CAEA+a,OAAAA,CAAQna,GACN,OAAOhB,KAAKoB,OAAOX,KAAKO,EAC1B,CAEAoa,OAAAA,CAAQpa,GACN,OAAOhB,KAAKoB,OAAOiB,KAAKrB,EAC1B,CAIAqa,QAAAA,GAG0B,IAFxBra,EAAiDb,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EACpDC,EAAMD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG0U,OAAOyG,UAEhB,MAAqB,iBAAVta,EACFhB,KAAKoB,OAAOS,MAAMb,EAAMA,MAAOA,EAAMZ,QAEvCJ,KAAKoB,OAAOS,MAAMb,EAAOZ,EAClC,CAEAmb,SAAAA,CAAUpa,GACR,OAAOnB,KAAKoW,MAAMR,QAAQzU,EAC5B,CAIA0Z,YAAAA,GAGE,OAHgB1a,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,IACLH,KAAK0a,QAChB1a,KAAKqH,SACErH,KAAKoF,UAAUsU,WAAW,EACnC,CAIA8B,eAAAA,GAGE,IAFAxa,EAAiDb,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EACpDC,EAAeD,UAAAC,OAAA,EAAAD,UAAA,QAAAE,EAOf,MALqB,iBAAVW,IACTZ,EAASA,GAAUJ,KAAKib,YAAcja,IAGvCA,EAAOZ,GAAUia,EAASrZ,EAAOZ,GAC3BJ,KAAKgZ,OAAO1H,QAAQtQ,EAAOZ,EACpC,CAIAqR,OAAAA,GAGU,IAFRzQ,EAAiDb,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EACpDC,EAAeD,UAAAC,OAAA,EAAAD,UAAA,QAAAE,EAOf,MALqB,iBAAVW,IACTZ,EAASA,GAAUJ,KAAKib,YAAcja,IAGvCA,EAAOZ,GAAUia,EAASrZ,EAAOZ,GAC3BJ,KAAKgZ,OAAOvH,QAAQzQ,EAAOZ,EACpC,CAEAqb,QAAAA,GACE,OAAOzb,KAAKoF,UAAUqW,UACxB,CAEA5J,WAAAA,CACE7Q,EACA8Q,EACAnR,GAEA,IADA6Y,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGuV,EAAMW,QAAQrL,IAEtC,OAAO2O,EAAOjO,KACZ1L,MACA,IACSA,KAAKgZ,OAAOnH,YAAY7Q,EAAO8Q,EAAOnR,IAE/C6Y,EACAxY,EAEJ,CAgBA+Q,UAAAA,CACE/Q,EACAe,EACAZ,EACAR,EACA6Y,GAEA,IAAItV,EAIJ,OADClD,EAAM,CAAGkD,EAASsV,GAAUa,EAASrZ,EAAO,EAAGG,EAAMR,EAAO6Y,GACtDG,EAAOjO,KACZ1L,MACA,IACSA,KAAKgZ,OAAOjH,WAAW/Q,EAAOe,EAAMmC,IAE7CsV,EACAxY,EACAe,EAAK3B,OAET,CAEAsb,SAAAA,GACE,OAAO1b,KAAKoB,OAAOsa,WACrB,CAEAC,GAAAA,GACE,OAAO3b,KAAKgK,QAAQ2R,OAAIxb,UAC1B,CA6BAiL,EAAAA,GACE,OAAOpL,KAAKgK,QAAQoB,MAAGjL,UACzB,CAEAyb,IAAAA,GACE,OAAO5b,KAAKgK,QAAQ4R,QAAKzb,UAC3B,CAEA8R,YAAAA,GACE,MAAOjR,EAAOZ,EAAO,CAAGoZ,GAAUa,KAASla,WAC3C,OAAOwZ,EAAOjO,KACZ1L,MACA,IACSA,KAAKgZ,OAAO/G,aAAajR,EAAOZ,IAEzCoZ,EACAxY,EAEJ,CAEA6a,kBAAAA,CAAmBlI,GFnkBMkI,EAACxc,EAAmByc,KAC7C,MAAMxW,EAAWjG,EAAK0c,cAEtB,IAAIpI,EAAOmI,EAEPE,EAA0B3c,EAC9B,KAAO2c,GAAS,CACd,MAAMC,EAA0BD,IAAY1W,EAAS4W,KAC/CC,EAAWF,EACb,CACE7H,IAAK,EACLC,MACE+H,OAAOC,gBAAgBtI,OACvBzO,EAASgX,gBAAgB/H,YAC3BC,OACE4H,OAAOC,gBAAgBnI,QACvB5O,EAASgX,gBAAgB7H,aAC3BH,KAAM,GAERb,EAAeuI,GAEbO,EAAQC,iBAAiBR,GACzBS,EAAkB1H,EACtBpB,EAAKW,KACLX,EAAKU,MACL8H,EAAS7H,KACT6H,EAAS9H,MACTK,EAAkB6H,EAAMG,mBACxBhI,EAAkB6H,EAAMI,qBAEpBC,EAAkB7H,EACtBpB,EAAKS,IACLT,EAAKa,OACL2H,EAAS/H,IACT+H,EAAS3H,OACTE,EAAkB6H,EAAMM,kBACxBnI,EAAkB6H,EAAMO,sBAE1B,GAAIL,GAAmBG,EACrB,GAAIX,EACF3W,EAASyX,aAAaC,SAASP,EAAiBG,OAC3C,CACL,MAAM,WAAEK,EAAU,UAAEC,GAAclB,EAC9BY,IACFZ,EAAQkB,WAAaN,GAEnBH,IACFT,EAAQiB,YAAcR,GAExB,MAAMU,EAAenB,EAAQiB,WAAaA,EACpCG,EAAcpB,EAAQkB,UAAYA,EACxCvJ,EAAO,CACLW,KAAMX,EAAKW,KAAO6I,EAClB/I,IAAKT,EAAKS,IAAMgJ,EAChB/I,MAAOV,EAAKU,MAAQ8I,EACpB3I,OAAQb,EAAKa,OAAS4I,EAE1B,CAGFpB,EACEC,GAAqC,UAAnBM,EAAMzW,SACpB,MAlHgB4N,EAmHCsI,GAlHjBqB,eAAkB3J,EAAQ4J,cAA6BC,MAAQ,IAmHvE,CApHwB7J,KAoHxB,EEogBEmI,CAAmB7b,KAAKX,KAAMsU,EAChC,CAKA6J,cAAAA,GACEjR,QAAQyK,KACN,0IAEFhX,KAAK4a,yBACP,CAMAA,uBAAAA,GACE,MAAM1U,EAAQlG,KAAKoF,UAAUqU,UACvB9D,EAASzP,GAASlG,KAAKoF,UAAU2V,UAAU7U,EAAMlF,MAAOkF,EAAM9F,QAChEuV,GACF3V,KAAK6b,mBAAmBlG,EAE5B,CAEAkE,WAAAA,CACE9Z,GAEA,IADAyZ,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGoT,EAAAA,EAAQ8C,QAAQrL,IAExC,OAAO2O,EAAOjO,KACZ1L,MACA,KACED,EAAQ,IAAIc,IAAJ,CAAUd,GAClB,MAAMK,EAASJ,KAAKib,YAEdwC,EAAUzd,KAAKgZ,OAAOrI,WAAW,EAAGvQ,GACpCsd,EAAU1d,KAAKgZ,OAAOtH,eAAe,EAAG3R,GAExC4d,EAAU3d,KAAKgZ,OAAOrI,WAAW3Q,KAAKib,YAAc,EAAG,GAC7D,OAAOwC,EAAQ1K,QAAQ2K,GAAS3K,QAAQ4K,EAAQ,GAElDnE,EAEJ,CAKAsB,YAAAA,CACE9Z,EACAZ,EACAoZ,GAEa,MAATxY,EAEFhB,KAAKoF,UAAUgV,SAAS,KAAMha,GAAUsV,EAAMW,QAAQrL,OAGrDhK,EAAOZ,EAAO,CAAGoZ,GAAUa,EAASrZ,EAAOZ,EAAQoZ,GACpDxZ,KAAKoF,UAAUgV,SAAS,IAAInL,EAAAA,EAAMxN,KAAKoP,IAAI,EAAG7P,GAAQZ,GAASoZ,GAC3DA,IAAWjG,EAAAA,EAAQ8C,QAAQpL,QAC7BjL,KAAK4a,0BAGX,CAEAgD,OAAAA,CAAQ7b,GAA2D,IAA7CyX,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGoT,EAAAA,EAAQ8C,QAAQrL,IAC5D,MAAMjL,GAAQ,IAAIc,MAAQH,OAAOqB,GACjC,OAAO/B,KAAK6Z,YAAY9Z,EAAOyZ,EACjC,CAEAnS,MAAAA,GAAqD,IAA9CmS,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGoT,EAAAA,EAAQ8C,QAAQnL,KAC7C,MAAM0G,EAAS5R,KAAKoB,OAAOiG,OAAOmS,GAGlC,OAFAxZ,KAAKoF,UAAUiC,OAAOmS,GAEf5H,CACT,CAEAiM,cAAAA,CACE9d,GAEA,IADAyZ,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGoT,EAAAA,EAAQ8C,QAAQrL,IAExC,OAAO2O,EAAOjO,KACZ1L,MACA,KACED,EAAQ,IAAIc,IAAJ,CAAUd,GACXC,KAAKgZ,OAAO7J,WAAWpP,KAEhCyZ,GACA,EAEJ,EAGF,SAASpC,EAAgB0G,GACvB,MAA2B,iBAAbA,EACVxY,SAASyY,cAA2BD,GACpCA,CACN,CAEA,SAASnG,EAAmBE,GAC1B,OAAOvJ,OAAO8J,QAAQP,GAAU,CAAC,GAAGrX,QAClC,CAACwd,EAAQlS,KAAA,IAAGoE,EAAKvP,GAAMmL,EAAA,MAAM,IACxBkS,EACH,CAAC9N,IAAgB,IAAVvP,EAAiB,CAAC,EAAIA,EAC9B,GACD,CAAC,EAEL,CAmFA,SAASgZ,EACPa,EACAhB,EACAxY,EACAgB,GAEA,IACGhC,KAAK0b,aACNlC,IAAWjG,EAAAA,EAAQ8C,QAAQnL,OAC1BlL,KAAKga,mBAEN,OAAO,IAAInZ,KAEb,IAAIqF,EAAiB,MAATlF,EAAgB,KAAOhB,KAAK6a,eACxC,MAAMxI,EAAWrS,KAAKgZ,OAAOjZ,MACvB6R,EAAS4I,IAaf,GAZa,MAATtU,KACY,IAAVlF,IACFA,EAAQkF,EAAMlF,OAEH,MAATgB,EACFkE,EAAQ6I,EAAW7I,EAAO0L,EAAQ4H,GACf,IAAVxX,IAETkE,EAAQ6I,EAAW7I,EAAOlF,EAAOgB,EAAOwX,IAE1CxZ,KAAK8a,aAAa5U,EAAOqN,EAAAA,EAAQ8C,QAAQpL,SAEvC2G,EAAOxR,SAAW,EAAG,CACvB,MAAMsJ,EAAO,CAAC6J,EAAAA,EAAQC,OAAO7I,YAAaiH,EAAQS,EAAUmH,GAC5DxZ,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAOrJ,iBAAkBT,GAC/C8P,IAAWjG,EAAAA,EAAQ8C,QAAQpL,QAC7BjL,KAAKgK,QAAQsB,QAAQ5B,EAEzB,CACA,OAAOkI,CACT,CAuCA,SAASyI,EACPrZ,EACAZ,EACAe,EACAR,EACA6Y,GAEA,IAAItV,EAAmC,CAAC,EA2CxC,MAzC2B,iBAAhBlD,EAAMA,OAA8C,iBAAjBA,EAAMZ,OAE5B,iBAAXA,GAEToZ,EAAS7Y,EACTA,EAAQQ,EACRA,EAAOf,EAEPA,EAASY,EAAMZ,OAEfY,EAAQA,EAAMA,QAGdZ,EAASY,EAAMZ,OAEfY,EAAQA,EAAMA,OAEW,iBAAXZ,IAEhBoZ,EAAS7Y,EACTA,EAAQQ,EACRA,EAAOf,EACPA,EAAS,GAGS,iBAATe,GAET+C,EAAU/C,EAEVqY,EAAS7Y,GACgB,iBAATQ,IACH,MAATR,EACFuD,EAAQ/C,GAAQR,EAGhB6Y,EAASrY,GAMN,CAACH,EAAOZ,EAAQ8D,EAFvBsV,EAASA,GAAUjG,EAAAA,EAAQ8C,QAAQrL,IAGrC,CASA,SAAS+D,EACP7I,EACAlF,EACAid,EACAzE,GAEA,MAAMpZ,EAAmC,iBAAnB6d,EAA8BA,EAAiB,EACrE,GAAa,MAAT/X,EAAe,OAAO,KAC1B,IAAIa,EACAC,EAmBJ,OAjBIhG,GAA4C,mBAA5BA,EAAMkd,mBACvBnX,EAAOC,GAAO,CAACd,EAAMlF,MAAOkF,EAAMlF,MAAQkF,EAAM9F,QAAQoE,KAAK2Z,GAE5Dnd,EAAMkd,kBAAkBC,EAAK3E,IAAWjG,EAAAA,EAAQ8C,QAAQnL,SAGzDnE,EAAOC,GAAO,CAACd,EAAMlF,MAAOkF,EAAMlF,MAAQkF,EAAM9F,QAAQoE,KAAK2Z,GAExDA,EAAMnd,GAAUmd,IAAQnd,GAASwY,IAAWjG,EAAAA,EAAQ8C,QAAQnL,KACvDiT,EACL/d,GAAU,EACL+d,EAAM/d,EAGRqB,KAAKoP,IAAI7P,EAAOmd,EAAM/d,KAG1B,IAAI6O,EAAAA,EAAMlI,EAAOC,EAAMD,EAChC,wIC19BA,MAAMsC,GAAQC,UAAAA,GAAO,mBAsBrB,MAAM2F,EACJ9J,WAAAA,CACSnE,GAEP,IADOZ,EAAMD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EAAC,KADVa,MAAAA,EAAa,KACbZ,OAAAA,CACN,EAGL,MAAM8Y,EAYJ/T,WAAAA,CAAY/D,EAAgB4I,GAC1BhK,KAAKgK,QAAUA,EACfhK,KAAKoB,OAASA,EACdpB,KAAKiG,WAAY,EACjBjG,KAAKoe,WAAY,EACjBpe,KAAKX,KAAOW,KAAKoB,OAAO6C,QAExBjE,KAAKqe,OAASre,KAAKoB,OAAOqD,OAAO,SAAUzE,MAE3CA,KAAKse,WAAa,IAAIrP,EAAM,EAAG,GAC/BjP,KAAKyZ,UAAYzZ,KAAKse,WACtBte,KAAKue,WAAa,KAClBve,KAAKwe,oBACLxe,KAAKye,iBACLze,KAAKgK,QAAQiC,UAAU,kBAAmB3G,UAAU,KAC7CtF,KAAKoe,WAAcpe,KAAKiG,WAC3ByY,WAAW1e,KAAKqH,OAAOqF,KAAK1M,KAAMuT,EAAAA,EAAQ8C,QAAQnL,MAAO,EAC3D,IAEFlL,KAAKgK,QAAQoB,GAAGmI,EAAAA,EAAQC,OAAOpJ,sBAAsB,KACnD,IAAKpK,KAAKyb,WAAY,OACtB,MAAMkD,EAAS3e,KAAKmG,iBACN,MAAVwY,GACAA,EAAO5X,MAAMlB,OAAS7F,KAAKqe,OAAOhZ,UACtCrF,KAAKgK,QAAQ4R,KACXrI,EAAAA,EAAQC,OAAOhJ,eACf,CAACgP,EAAQlS,KACP,IAEItH,KAAKX,KAAK2M,SAAS2S,EAAO5X,MAAMlB,OAChC7F,KAAKX,KAAK2M,SAAS2S,EAAO3X,IAAInB,OAE9B7F,KAAK4e,eACHD,EAAO5X,MAAMlB,KACb8Y,EAAO5X,MAAMnB,OACb+Y,EAAO3X,IAAInB,KACX8Y,EAAO3X,IAAIpB,QAGf,MAAMiZ,EAAoBvX,EAAUC,MACjCC,GACmB,kBAAlBA,EAASC,MACS,cAAlBD,EAASC,MACU,eAAlBD,EAASC,MACRD,EAAS5E,SAAW5C,KAAKX,OAE/BW,KAAKqH,OAAOwX,EAAoBtL,EAAAA,EAAQ8C,QAAQpL,OAASuO,EAC3D,CAAE,MAAOsF,GACP,IAGL,IAEH9e,KAAKgK,QAAQoB,GAAGmI,EAAAA,EAAQC,OAAOjJ,iBAAiB,CAACjD,EAAWxE,KAC1D,GAAIA,EAAQoD,MAAO,CACjB,MAAM,UAAEe,EAAS,YAAEC,EAAW,QAAEC,EAAO,UAAEC,GAActE,EAAQoD,MAC/DlG,KAAK4e,eAAe3X,EAAWC,EAAaC,EAASC,GACrDpH,KAAKqH,OAAOkM,EAAAA,EAAQ8C,QAAQpL,OAC9B,KAEFjL,KAAKqH,OAAOkM,EAAAA,EAAQ8C,QAAQpL,OAC9B,CAEAuT,iBAAAA,GACExe,KAAKgK,QAAQoB,GAAGmI,EAAAA,EAAQC,OAAO5I,0BAA0B,KACvD5K,KAAKiG,WAAY,CAAI,IAEvBjG,KAAKgK,QAAQoB,GAAGmI,EAAAA,EAAQC,OAAOzI,iBAAiB,KAE9C,GADA/K,KAAKiG,WAAY,EACbjG,KAAKqe,OAAOjb,OAAQ,CACtB,MAAM8C,EAAQlG,KAAKqe,OAAOrY,UAC1B,IAAKE,EAAO,OACZwY,YAAW,KACT1e,KAAK4e,eACH1Y,EAAMe,UACNf,EAAMgB,YACNhB,EAAMiB,QACNjB,EAAMkB,UACP,GACA,EACL,IAEJ,CAEAqX,cAAAA,GACEze,KAAKgK,QAAQiC,UAAU,YAAa3G,SAAS4W,MAAM,KACjDlc,KAAKoe,WAAY,CAAI,IAEvBpe,KAAKgK,QAAQiC,UAAU,UAAW3G,SAAS4W,MAAM,KAC/Clc,KAAKoe,WAAY,EACjBpe,KAAKqH,OAAOkM,EAAAA,EAAQ8C,QAAQnL,KAAK,GAErC,CAEAwP,KAAAA,GACM1a,KAAKyb,aACTzb,KAAKX,KAAKqb,MAAM,CAAEC,eAAe,IACjC3a,KAAKoa,SAASpa,KAAKse,YACrB,CAEA9c,MAAAA,CAAOA,EAAgBb,GACrBX,KAAKoB,OAAOiG,SACZ,MAAM0X,EAAc/e,KAAKmG,iBACzB,GACiB,MAAf4Y,GACCA,EAAYJ,OAAOK,YACpBhf,KAAKoB,OAAOC,MAAMG,EAAQF,EAAAA,MAAMC,OAHlC,CAMA,GAAIwd,EAAYhY,MAAMlB,OAAS7F,KAAKqe,OAAOhZ,SAAU,CACnD,MAAMpF,EAAOD,KAAKoB,OAAOmR,KAAKwM,EAAYhY,MAAMlB,MAAM,GACtD,GAAY,MAAR5F,EAAc,OAElB,GAAIA,aAAgBM,EAAAA,SAAU,CAC5B,MAAM0e,EAAQhf,EAAK6B,MAAMid,EAAYhY,MAAMnB,QAE3C3F,EAAKmD,OAAOd,aAAatC,KAAKqe,OAAQY,EACxC,MAEEhf,EAAKqC,aAAatC,KAAKqe,OAAQU,EAAYhY,MAAMlB,MAEnD7F,KAAKqe,OAAOva,QACd,CACA9D,KAAKqe,OAAO7c,OAAOA,EAAQb,GAC3BX,KAAKoB,OAAOyB,WACZ7C,KAAK4e,eAAe5e,KAAKqe,OAAOhZ,SAAUrF,KAAKqe,OAAOhZ,SAASU,KAAK3F,QACpEJ,KAAKqH,QAlBG,CAmBV,CAEA0T,SAAAA,CAAU/Z,GAA2B,IAAZZ,EAAMD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EAChC,MAAMiP,EAAepP,KAAKoB,OAAOhB,SAGjC,IAAIyF,EAFJ7E,EAAQS,KAAKC,IAAIV,EAAOoO,EAAe,GACvChP,EAASqB,KAAKC,IAAIV,EAAQZ,EAAQgP,EAAe,GAAKpO,EAEtD,IAAKP,EAAMmF,GAAU5F,KAAKoB,OAAOX,KAAKO,GACtC,GAAY,MAARP,EAAc,OAAO,KACzB,GAAIL,EAAS,GAAKwF,IAAWnF,EAAKL,SAAU,CAC1C,MAAOiD,GAAQrD,KAAKoB,OAAOX,KAAKO,EAAQ,GACxC,GAAIqC,EAAM,CACR,MAAOhB,GAAQrC,KAAKoB,OAAOiB,KAAKrB,IACzBke,GAAYlf,KAAKoB,OAAOiB,KAAKrB,EAAQ,GACxCqB,IAAS6c,IACXze,EAAO4C,EACPuC,EAAS,EAEb,CACF,EACCC,EAAMD,GAAUnF,EAAKqF,SAASF,GAAQ,GACvC,MAAMM,EAAQZ,SAAS6Z,cACvB,GAAI/e,EAAS,EAGX,OAFA8F,EAAMkZ,SAASvZ,EAAMD,IACpBnF,EAAMmF,GAAU5F,KAAKoB,OAAOX,KAAKO,EAAQZ,GAC9B,MAARK,EAAqB,OACxBoF,EAAMD,GAAUnF,EAAKqF,SAASF,GAAQ,GACvCM,EAAMmZ,OAAOxZ,EAAMD,GACZM,EAAM0N,yBAEf,IACID,EADA2L,EAAyB,OAE7B,GAAIzZ,aAAgB4C,KAAM,CAMxB,IAAK5C,EAAKE,KAAK3F,OACb,OAAO,KAELwF,EAASC,EAAKE,KAAK3F,QACrB8F,EAAMkZ,SAASvZ,EAAMD,GACrBM,EAAMmZ,OAAOxZ,EAAMD,EAAS,KAE5BM,EAAMkZ,SAASvZ,EAAMD,EAAS,GAC9BM,EAAMmZ,OAAOxZ,EAAMD,GACnB0Z,EAAO,SAET3L,EAAOzN,EAAM0N,uBACf,KAAO,CACL,KAAMnT,EAAKwD,mBAAmBkK,SAAU,OAAO,KAC/CwF,EAAOlT,EAAKwD,QAAQ2P,wBAChBhO,EAAS,IAAG0Z,EAAO,QACzB,CACA,MAAO,CACL9K,OAAQb,EAAKS,IAAMT,EAAKO,OACxBA,OAAQP,EAAKO,OACbI,KAAMX,EAAK2L,GACXjL,MAAOV,EAAK2L,GACZlL,IAAKT,EAAKS,IACVL,MAAO,EAEX,CAEA5N,cAAAA,GACE,MAAMf,EAAYE,SAASuV,eAC3B,GAAiB,MAAbzV,GAAqBA,EAAUma,YAAc,EAAG,OAAO,KAC3D,MAAMR,EAAc3Z,EAAUoa,WAAW,GACzC,GAAmB,MAAfT,EAAqB,OAAO,KAChC,MAAM7Y,EAAQlG,KAAKyf,gBAAgBV,GAEnC,OADA1V,EAAMqW,KAAK,iBAAkBxZ,GACtBA,CACT,CAEAwT,QAAAA,GACE,MAAMra,EAAOW,KAAKoB,OAAO6C,QACzB,GAAI,gBAAiB5E,IAASA,EAAKsgB,YAGjC,MAAO,CAAC,KAAM,MAEhB,MAAMC,EAAa5f,KAAKmG,iBACxB,OAAkB,MAAdyZ,EAA2B,CAAC,KAAM,MAE/B,CADO5f,KAAK6f,kBAAkBD,GACtBA,EACjB,CAEAnE,QAAAA,GACE,OACEnW,SAASwa,gBAAkB9f,KAAKX,MACL,MAA1BiG,SAASwa,eACR9T,EAAShM,KAAKX,KAAMiG,SAASwa,cAEnC,CAEAD,iBAAAA,CAAkB3Z,GAChB,MAAM6Z,EAA8B,CAClC,CAAC7Z,EAAMa,MAAMlB,KAAMK,EAAMa,MAAMnB,SAE5BM,EAAMyY,OAAOK,WAChBe,EAAU7T,KAAK,CAAChG,EAAMc,IAAInB,KAAMK,EAAMc,IAAIpB,SAE5C,MAAMoa,EAAUD,EAAUvb,KAAKsB,IAC7B,MAAOD,EAAMD,GAAUE,EACjB7F,EAAOD,KAAKoB,OAAOmR,KAAK1M,GAAM,GAE9B7E,EAAQf,EAAK2F,OAAO5F,KAAKoB,QAC/B,OAAe,IAAXwE,EACK5E,EAELf,aAAgBM,EAAAA,SACXS,EAAQf,EAAKe,MAAM6E,EAAMD,GAG3B5E,EAAQf,EAAKG,QAAQ,IAExB4G,EAAMvF,KAAKC,IAAID,KAAKoP,OAAOmP,GAAUhgB,KAAKoB,OAAOhB,SAAW,GAC5D2G,EAAQtF,KAAKC,IAAIsF,KAAQgZ,GAC/B,OAAO,IAAI/Q,EAAMlI,EAAOC,EAAMD,EAChC,CAEA0Y,eAAAA,CAAgBV,GACd,IACG/S,EAAShM,KAAKX,KAAM0f,EAAYkB,kBAC/BlB,EAAYC,YAAchT,EAAShM,KAAKX,KAAM0f,EAAYmB,cAE5D,OAAO,KAET,MAAMha,EAAQ,CACZa,MAAO,CACLlB,KAAMkZ,EAAYkB,eAClBra,OAAQmZ,EAAY7X,aAEtBF,IAAK,CAAEnB,KAAMkZ,EAAYmB,aAActa,OAAQmZ,EAAY3X,WAC3DuX,OAAQI,GA2BV,MAzBA,CAAC7Y,EAAMa,MAAOb,EAAMc,KAAKtC,SAASoB,IAChC,IAAI,KAAED,EAAI,OAAED,GAAWE,EACvB,OAASD,aAAgB4C,OAAS5C,EAAKsC,WAAW/H,OAAS,GACzD,GAAIyF,EAAKsC,WAAW/H,OAASwF,EAC3BC,EAAOA,EAAKsC,WAAWvC,GACvBA,EAAS,MACJ,IAAIC,EAAKsC,WAAW/H,SAAWwF,EAapC,MAXAC,EAAOA,EAAKO,UAEVR,EADEC,aAAgB4C,KACT5C,EAAKE,KAAK3F,OACVyF,EAAKsC,WAAW/H,OAAS,EAEzByF,EAAKsC,WAAW/H,OAGhByF,EAAKsC,WAAW/H,OAAS,CAItC,CAEF0F,EAASD,KAAOA,EAChBC,EAASF,OAASA,CAAM,IAEnBM,CACT,CAEAia,aAAAA,CAAcja,GACZ,MAAMkJ,EAAepP,KAAKoB,OAAOhB,SAE3BggB,EAAcA,CAClBpf,EACAqf,KAEArf,EAAQS,KAAKC,IAAI0N,EAAe,EAAGpO,GACnC,MAAOP,EAAM6f,GAActgB,KAAKoB,OAAOX,KAAKO,GAC5C,OAAOP,EAAOA,EAAKqF,SAASwa,EAAYD,GAAa,CAAC,MAAO,EAAE,EAEjE,MAAO,IACFD,EAAYla,EAAMlF,OAAO,MACzBof,EAAYla,EAAMlF,MAAQkF,EAAM9F,QAAQ,GAE/C,CAEAwe,cAAAA,CACE3X,EACAC,GAIA,IAHAC,EAAOhH,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG8G,EACVG,EAASjH,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG+G,EACZhE,EAAK/C,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAGL,GADAkJ,EAAMqW,KAAK,iBAAkBzY,EAAWC,EAAaC,EAASC,GAE/C,MAAbH,IACyB,MAAxBjH,KAAKX,KAAKgH,YACe,MAAxBY,EAAUZ,YAEY,MAAtBc,EAAQd,YAEV,OAEF,MAAMjB,EAAYE,SAASuV,eAC3B,GAAiB,MAAbzV,EACJ,GAAiB,MAAb6B,EAAmB,CAChBjH,KAAKyb,YAAYzb,KAAKX,KAAKqb,MAAM,CAAEC,eAAe,IACvD,MAAM,OAAEgE,GAAW3e,KAAKmG,kBAAoB,CAAC,EAC7C,GACY,MAAVwY,GACAzb,GACA+D,IAAc0X,EAAOsB,gBACrB/Y,IAAgByX,EAAOzX,aACvBC,IAAYwX,EAAOuB,cACnB9Y,IAAcuX,EAAOvX,UACrB,CACIH,aAAqBkH,SAAiC,OAAtBlH,EAAU1D,UAE5C2D,EAAce,MAAMC,KAAKjB,EAAUZ,WAAW8B,YAAYW,QACxD7B,GAEFA,EAAYA,EAAUZ,YAEpBc,aAAmBgH,SAA+B,OAApBhH,EAAQ5D,UAExC6D,EAAYa,MAAMC,KAAKf,EAAQd,WAAW8B,YAAYW,QACpD3B,GAEFA,EAAUA,EAAQd,YAEpB,MAAMH,EAAQZ,SAAS6Z,cAEvBjZ,EAAMkZ,SAASnY,EAAWC,GAE1BhB,EAAMmZ,OAAOlY,EAASC,GACtBhC,EAAUmb,kBACVnb,EAAUob,SAASta,EACrB,CACF,MACEd,EAAUmb,kBACVvgB,KAAKX,KAAK8a,MAEd,CAIAC,QAAAA,CACElU,GAGM,IAFNhD,EAA8B/C,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GAC9BqZ,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGoT,EAAAA,EAAQ8C,QAAQrL,IAOxC,GALqB,iBAAV9H,IACTsW,EAAStW,EACTA,GAAQ,GAEVmG,EAAMqW,KAAK,WAAYxZ,GACV,MAATA,EAAe,CACjB,MAAMwD,EAAO1J,KAAKmgB,cAAcja,GAChClG,KAAK4e,kBAAkBlV,EAAMxG,EAC/B,MACElD,KAAK4e,eAAe,MAEtB5e,KAAKqH,OAAOmS,EACd,CAEAnS,MAAAA,GAAqD,IAA9CmS,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGoT,EAAAA,EAAQ8C,QAAQnL,KAC7C,MAAM2H,EAAW7S,KAAKyZ,WACfA,EAAWsF,GAAe/e,KAAK0Z,WAMtC,GALA1Z,KAAKyZ,UAAYA,EACjBzZ,KAAKue,WAAaQ,EACI,MAAlB/e,KAAKyZ,YACPzZ,KAAKse,WAAate,KAAKyZ,aAEpBzG,EAAAA,EAAAA,GAAQH,EAAU7S,KAAKyZ,WAAY,CACtC,IACGzZ,KAAKiG,WACS,MAAf8Y,GACAA,EAAYJ,OAAOK,WACnBD,EAAYhY,MAAMlB,OAAS7F,KAAKqe,OAAOhZ,SACvC,CACA,MAAMa,EAAQlG,KAAKqe,OAAOrY,UACtBE,GACFlG,KAAK4e,eACH1Y,EAAMe,UACNf,EAAMgB,YACNhB,EAAMiB,QACNjB,EAAMkB,UAGZ,CACA,MAAMsC,EAAO,CACX6J,EAAAA,EAAQC,OAAO9I,kBACfoG,EAAAA,EAAAA,GAAU9Q,KAAKyZ,YACf3I,EAAAA,EAAAA,GAAU+B,GACV2G,GAEFxZ,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAOrJ,iBAAkBT,GAC/C8P,IAAWjG,EAAAA,EAAQ8C,QAAQpL,QAC7BjL,KAAKgK,QAAQsB,QAAQ5B,EAEzB,CACF,EAGF,SAASsC,EAAS5I,EAAc0M,GAC9B,IAEEA,EAAWzJ,UACb,CAAE,MAAOoa,GACP,OAAO,CACT,CACA,OAAOrd,EAAO4I,SAAS8D,EACzB,mCCvdA,MAAM0G,EACJtR,gBAAgC,CAC9B0Q,QAAS,CAAC,GAGZ1Q,cAAgB,CACdwb,QAASlK,GAGXZ,QAAmC,CAAC,EAEpCzQ,WAAAA,CACY0E,EACA+C,GACV,KAFU/C,MAAAA,EAAY,KACZ+C,QAAAA,CACT,CAEH0M,IAAAA,GACEhL,OAAOC,KAAKvO,KAAK4M,QAAQgJ,SAASlR,SAASvD,IACf,MAAtBnB,KAAK4V,QAAQzU,IACfnB,KAAKqZ,UAAUlY,EACjB,GAEJ,CAOAkY,SAAAA,CAAUlY,GAER,MAAMwf,EAAc3gB,KAAK6J,MAAM1E,YAAYwR,OAAQ,WAAUxV,KAK7D,OAJAnB,KAAK4V,QAAQzU,GAAQ,IAAIwf,EACvB3gB,KAAK6J,MACL7J,KAAK4M,QAAQgJ,QAAQzU,IAAS,CAAC,GAE1BnB,KAAK4V,QAAQzU,EACtB,EAQF,gHCxDA,MAAM0W,EAAS,CACbjT,MAAOtD,EAAAA,MAAMC,MACbqf,UAAW,CAAC,QAAS,SAAU,YAG3BC,EAAiB,IAAIC,EAAAA,WAAW,QAAS,QAASjJ,GAElDkJ,GADa,IAAIC,EAAAA,gBAAgB,QAAS,WAAYnJ,GACzC,IAAIoJ,EAAAA,gBAAgB,QAAS,aAAcpJ,+FCNtC,IAAImJ,EAAAA,gBAAgB,aAAc,QAAS,CACjEpc,MAAOtD,EAAAA,MAAM8O,SADf,MAGM8Q,EAAkB,IAAIC,EAAAA,GAAgB,aAAc,mBAAoB,CAC5Evc,MAAOtD,EAAAA,MAAM8O,sJCCf,MAAMgR,UAA2Brc,EAAAA,EAC/B,aAAON,CAAO9D,GACZ,MAAMsD,EAAUhD,MAAMwD,OAAO9D,GAE7B,OADAsD,EAAQ+D,aAAa,aAAc,SAC5B/D,CACT,CAEAod,IAAAA,CAAKrgB,EAAeZ,GAClB,OACEJ,KAAKiC,SAEFuC,KAAKvB,GAAWA,EAAM7C,UAAY,EAAI,GAAK6C,EAAMgB,QAAQqd,YACzD3a,KAAK,MACLgH,MAAM3M,EAAOA,EAAQZ,EAE5B,CAEAsN,IAAAA,CAAK1M,EAAeZ,GAGlB,MAAQ,WAAS8I,EAAAA,EAAAA,GAAWlJ,KAAKqhB,KAAKrgB,EAAOZ,aAC/C,EAGF,MAAMmhB,UAAkB3hB,EAAAA,GACtBsF,WAAa,KAEb,eAAO2R,GACLnB,EAAAA,GAAMmB,SAASuK,EACjB,EAGF,MAAMI,UAAa9d,EAAAA,GACnB8d,EAAKle,SAAW,OAChBke,EAAKje,QAAU,OAEfge,EAAUje,SAAW,aACrBie,EAAUrH,UAAY,gBACtBqH,EAAUhe,QAAU,MACpB6d,EAAmB9d,SAAW,uBAC9B8d,EAAmBlH,UAAY,0BAC/BkH,EAAmB7d,QAAU,MAE7B6d,EAAmB3d,gBAAkB,CAAC8d,GAEtCA,EAAU9d,gBAAkB,CAACG,EAAAA,EAAUnB,EAAAA,EAAOwC,EAAAA,GAC9Csc,EAAUpJ,kBAAoBiJ,4GCpD9B,MAAMD,UAAwBF,EAAAA,gBAC5BtgB,KAAAA,CAAMsD,GACJ,IAAItD,EAAQM,MAAMN,MAAMsD,GACxB,OAAKtD,EAAMsW,WAAW,SACtBtW,EAAQA,EAAMwI,QAAQ,UAAW,IAAIA,QAAQ,UAAW,IAKhD,IAJIxI,EACTmB,MAAM,KACN0C,KAAKid,GAAe,KAAI7M,SAAS6M,EAAW,IAAIC,SAAS,MAAM/T,OAAO,KACtEhH,KAAK,OAL8BhG,CAOxC,EAGiB,IAAIqgB,EAAAA,gBAAgB,QAAS,WAAY,CAC1Dpc,MAAOtD,EAAAA,MAAM8O,SADf,MAGMuR,EAAa,IAAIR,EAAgB,QAAS,QAAS,CACvDvc,MAAOtD,EAAAA,MAAM8O,mHCjBf,MAAMyH,EAAS,CACbjT,MAAOtD,EAAAA,MAAMC,MACbqf,UAAW,CAAC,QAGRgB,EAAqB,IAAId,EAAAA,WAAW,YAAa,MAAOjJ,GAExDgK,GADiB,IAAIb,EAAAA,gBAAgB,YAAa,eAAgBnJ,GACjD,IAAIoJ,EAAAA,gBAAgB,YAAa,YAAapJ,qFCPrE,MAAMA,EAAS,CACbjT,MAAOtD,EAAAA,MAAM8O,OACbwQ,UAAW,CAAC,QAAS,cAGL,IAAII,EAAAA,gBAAgB,OAAQ,UAAWnJ,GAEzD,MAAMiK,UAA4Bb,EAAAA,gBAChCtgB,KAAAA,CAAMkF,GACJ,OAAO5E,MAAMN,MAAMkF,GAAMsD,QAAQ,QAAS,GAC5C,EAGF,MAAM4Y,EAAY,IAAID,EAAoB,OAAQ,cAAejK,mFCb/C,IAAImJ,EAAAA,gBAAgB,OAAQ,UAAW,CACvDpc,MAAOtD,EAAAA,MAAM8O,OACbwQ,UAAW,CAAC,QAAS,QAAS,UAFhC,MAIMoB,EAAY,IAAIf,EAAAA,gBAAgB,OAAQ,YAAa,CACzDrc,MAAOtD,EAAAA,MAAM8O,OACbwQ,UAAW,CAAC,OAAQ,OAAQ,qOCR9B,MAAMqB,EAAqB,wBACrBC,EAAgB,CAAC,IAAK,KAAM,MAE5BC,EAAkBzO,GACfA,GAAWwO,EAAcE,SAAS1O,EAAQnQ,SCJ7C8e,EAAe,0BACfC,EAAW,4BACXC,EAAe,gCCCfC,EAAc,CDsFL,SAAmBC,GAG9B,0CADAA,EAAInG,gBAAgBoG,aAAa,YA/DVD,KACzB,MAAME,EAAU1a,MAAMC,KAAKua,EAAI7Y,iBAAiB,sBAC1CkV,EAAqB,GACrB8D,EAAoB,GAC1BD,EAAQje,SAASmB,KACOA,EAAK6c,aAAa,UAAY,IAAIpQ,MAAM+P,GAE5DvD,EAAQ5S,KAAKrG,GAEb+c,EAAO1W,KAAKrG,EACd,IAIFiZ,EAAQpa,SAASmB,GAASA,EAAKQ,YAAYrD,YAAY6C,KAIvD,MAAM6H,EAAO+U,EAAInG,gBAAgBpO,UAC3B2U,EAAYD,EACfpe,KAAKkP,GA5CYoP,EAACpP,EAAkBhG,KACvC,MAAM6O,EAAQ7I,EAAQgP,aAAa,SAC7BK,EAAUxG,GAAOjK,MAAMgQ,GAC7B,IAAKS,EACH,OAAO,KAET,MAAMC,EAAKnO,OAAOkO,EAAQ,IAEpBE,EAAc1G,GAAOjK,MAAMiQ,GAC3BnV,EAAS6V,EAAcpO,OAAOoO,EAAY,IAAM,EAEhDC,EAAa,IAAIC,OACpB,UAASH,UAAW5V,uDACrB,KAEIgW,EAAY1V,EAAK4E,MAAM4Q,GAG7B,MAAO,CAAEF,KAAI5V,SAAQ3F,KAFR2b,GAA8B,WAAjBA,EAAU,GAAkB,SAAW,UAEtC1P,UAAS,EA0BhBoP,CAAcpP,EAAShG,KACxCxN,QAAQmjB,GAAWA,IAEtB,KAAOR,EAAUziB,QAAQ,CACvB,MAAMkjB,EAAiB,GAEvB,IAAItH,EAAU6G,EAAU7gB,QAExB,KAAOga,GACLsH,EAAepX,KAAK8P,GACpBA,EACE6G,EAAUziB,QACVyiB,EAAU,IAAInP,UAAYsI,EAAQtI,QAAQ6P,oBAE1CV,EAAU,GAAGG,KAAOhH,EAAQgH,GACxBH,EAAU7gB,QACV,KAGR,MAAMwhB,EAAKle,SAASyC,cAAc,MAClCub,EAAe5e,SAAS+e,IACtB,MAAMC,EAAKpe,SAASyC,cAAc,MAClC2b,EAAG1b,aAAa,YAAayb,EAAShc,MAClCgc,EAASrW,OAAS,GACpBsW,EAAG1b,aAAa,QAAU,cAAYyb,EAASrW,OAAS,IAE1DsW,EAAGxV,UAAYuV,EAAS/P,QAAQxF,UAChCsV,EAAG/d,YAAYie,EAAG,IAGpB,MAAMhQ,EAAU4P,EAAe,IAAI5P,SAC7B,WAAErN,GAAeqN,GAAW,CAAC,EAC/BA,GACFrN,GAAYsd,aAAaH,EAAI9P,GAE/B4P,EAAe3V,MAAM,GAAGjJ,SAAQoH,IAAoB,IAAjB4H,QAAS+M,GAAG3U,EAC7CzF,GAAYrD,YAAYyd,EAAE,GAE9B,GAQEmD,CAAkBnB,EAEtB,EDnEe,SAAmBA,GAC5BA,EAAI1E,cAAc,iCAXK0E,KAC3Bxa,MAAMC,KAAKua,EAAI7Y,iBAAiB,4BAC7B1J,QAAQ2F,GAASA,EAAK6c,aAAa,UAAUpQ,MAAM2P,KACnDvd,SAASmB,IACR,MAAMge,EAAWpB,EAAIqB,yBACrBD,EAASE,UAAUle,EAAKsC,YACxBtC,EAAKQ,YAAYsd,aAAaE,EAAUhe,EAAK,GAC7C,EAKFme,CAAoBvB,GAxBKA,KAC3Bxa,MAAMC,KAAKua,EAAI7Y,iBAAiB,OAC7B1J,QACE+jB,GACC9B,EAAe8B,EAAGC,yBAClB/B,EAAe8B,EAAGV,sBAErB7e,SAASuf,IACRA,EAAG5d,YAAYrD,YAAYihB,EAAG,GAC9B,EAgBFE,CAAoB1B,GAExB,GGRA,MAAMpZ,GAAQC,EAAAA,EAAAA,GAAO,mBAKf8a,EAA0C,CAC9C,CAAC9Q,KAAK+Q,UA2jBR,SAAmBxe,EAAmB9F,EAAcqB,GAElD,IAAIW,EAAO8D,EAAKE,KAEhB,GAAoC,QAAhCF,EAAKwX,eAAe9Z,QACtB,OAAOxD,EAAMW,OAAOqB,EAAK0W,QAE3B,IAAK6L,EAAMze,GAAO,CAChB,GACyB,IAAvB9D,EAAK0W,OAAOrY,QACZ2B,EAAKqgB,SAAS,QAjRpB,SAAiCvc,EAAmBzE,GAClD,OACEyE,EAAKqe,wBACLre,EAAK0d,qBACJgB,EAAO1e,EAAKqe,uBAAwB9iB,KACpCmjB,EAAO1e,EAAK0d,mBAAoBniB,EAErC,CA2QOojB,CAAwB3e,EAAMzE,GAE/B,OAAOrB,EAET,MAAM0kB,EAAWA,CAACC,EAAmBpS,KACnC,MAAMqS,EAAWrS,EAAMnJ,QAAQ,aAAc,IAC7C,OAAOwb,EAASvkB,OAAS,GAAKskB,EAAW,IAAMC,CAAQ,EAEzD5iB,EAAOA,EAAKoH,QAAQ,QAAS,KAAKA,QAAQ,MAAO,KACjDpH,EAAOA,EAAKoH,QAAQ,SAAUsb,EAAS/X,KAAK+X,GAAU,KAE3B,MAAxB5e,EAAK+e,iBACkB,MAAtB/e,EAAKwX,eACLkH,EAAO1e,EAAKwX,cAAejc,IAC5ByE,EAAK+e,2BAA2BzW,SAC/BoW,EAAO1e,EAAK+e,gBAAiBxjB,MAE/BW,EAAOA,EAAKoH,QAAQ,OAAQsb,EAAS/X,KAAK+X,GAAU,MAG/B,MAApB5e,EAAKgf,aACkB,MAAtBhf,EAAKwX,eACLkH,EAAO1e,EAAKwX,cAAejc,IAC5ByE,EAAKgf,uBAAuB1W,SAAWoW,EAAO1e,EAAKgf,YAAazjB,MAEjEW,EAAOA,EAAKoH,QAAQ,OAAQsb,EAAS/X,KAAK+X,GAAU,IAExD,CACA,OAAO1kB,EAAMW,OAAOqB,EACtB,GAlmBE,CAACuR,KAAK+Q,UAAWS,GACjB,CAAC,KAwbH,SAAoBjf,EAAY9F,GAI9B,OAHKglB,EAAchlB,EAAO,OACxBA,EAAMW,OAAO,MAERX,CACT,GA5bE,CAACuT,KAAK0R,aAAcF,GACpB,CAACxR,KAAK0R,aAmZR,SAAmBnf,EAAY9F,EAAcqB,GAC3C,MAAMkR,EAAQlR,EAAOC,MAAMwE,GAC3B,GAAa,MAATyM,EAAe,OAAOvS,EAE1B,GAAIuS,EAAM2S,qBAAqBthB,EAAAA,UAAW,CACxC,MAAMmO,EAAQ,CAAC,EAETnR,EAAQ2R,EAAM3R,MAAMkF,GAC1B,GAAa,MAATlF,EAIF,OAFAmR,EAAMQ,EAAMhP,UAAY3C,GAEjB,IAAIE,MAAQH,OAAOoR,EAAOQ,EAAMpO,QAAQ2B,EAAMzE,GAEzD,MAKE,GAHIkR,EAAM2S,qBAAqBplB,EAAAA,YAAcklB,EAAchlB,EAAO,OAChEA,EAAMW,OAAO,MAGb,aAAc4R,GACd,YAAaA,GACY,mBAAlBA,EAAMpO,QAEb,OAAOghB,EACLnlB,EACAuS,EAAMhP,SACNgP,EAAMpO,QAAQ2B,EAAMzE,GACpBA,GAIN,OAAOrB,CACT,GAnbE,CAACuT,KAAK0R,aAmXR,SAAyBnf,EAAmB9F,EAAcqB,GACxD,MAAM2C,EAAa+c,EAAAA,WAAWvS,KAAK1I,GAC7Bsf,EAAUnE,EAAAA,gBAAgBzS,KAAK1I,GAC/Buf,EAASnE,EAAAA,gBAAgB1S,KAAK1I,GAC9B3B,EAA8C,CAAC,EAqBrD,OApBAH,EACG4K,OAAOwW,GACPxW,OAAOyW,GACP1gB,SAASvD,IACR,IAAIkkB,EAAOjkB,EAAOC,MAAMF,EAAMG,EAAAA,MAAMgkB,WACxB,MAARD,IACFnhB,EAAQmhB,EAAKtO,UAAYsO,EAAK1kB,MAAMkF,GAChC3B,EAAQmhB,EAAKtO,aAEnBsO,EAAOE,EAAsBpkB,GACjB,MAARkkB,GAAiBA,EAAKtO,WAAa5V,GAAQkkB,EAAKG,UAAYrkB,IAC9D+C,EAAQmhB,EAAKtO,UAAYsO,EAAK1kB,MAAMkF,SAASxF,GAE/CglB,EAAOI,EAAkBtkB,GACb,MAARkkB,GAAiBA,EAAKtO,WAAa5V,GAAQkkB,EAAKG,UAAYrkB,IAC9DkkB,EAAOI,EAAkBtkB,GACzB+C,EAAQmhB,EAAKtO,UAAYsO,EAAK1kB,MAAMkF,SAASxF,GAC/C,IAGGiO,OAAO8J,QAAQlU,GAAS1D,QAC7B,CAACklB,EAAQC,KAAA,IAAGxkB,EAAMR,GAAMglB,EAAA,OAAKT,EAAYQ,EAAUvkB,EAAMR,EAAOS,EAAO,GACvErB,EAEJ,GA/YE,CAACuT,KAAK0R,aAqgBR,SAAqBnf,EAAmB9F,EAAcqB,GACpD,MAAM8C,EAAmC,CAAC,EACpCqY,EAAsC1W,EAAK0W,OAAS,CAAC,EAsB3D,MArBwB,WAApBA,EAAMqJ,YACR1hB,EAAQ2hB,QAAS,GAEU,cAAzBtJ,EAAMuJ,iBACR5hB,EAAQ6hB,WAAY,GAEO,iBAAzBxJ,EAAMuJ,iBACR5hB,EAAQ8hB,QAAS,IAGjBzJ,EAAM0J,YAAYhP,WAAW,SAE7BrC,SAAS2H,EAAM0J,WAAY,KAAO,OAElC/hB,EAAQgiB,MAAO,GAEjBnmB,EAAQuO,OAAO8J,QAAQlU,GAAS1D,QAC9B,CAACklB,EAAQS,KAAA,IAAGhlB,EAAMR,GAAMwlB,EAAA,OAAKjB,EAAYQ,EAAUvkB,EAAMR,EAAOS,EAAO,GACvErB,GAGEqmB,WAAW7J,EAAM8J,YAAc,GAAK,GAE/B,IAAIxlB,MAAQH,OAAO,MAAMiO,OAAO5O,GAElCA,CACT,GAjiBE,CAAC,KAucH,SAAqB8F,EAAY9F,EAAcqB,GAC7C,MAAMkR,EAAQlR,EAAOC,MAAMwE,GAC3B,GACW,MAATyM,GAEmB,SAAnBA,EAAMhP,WACLyhB,EAAchlB,EAAO,MAEtB,OAAOA,EAET,IAAIqN,GAAU,EACVhK,EAASyC,EAAKQ,WAClB,KAAiB,MAAVjD,GAED,CAAC,KAAM,MAAMgf,SAAShf,EAAOG,WAC/B6J,GAAU,GAEZhK,EAASA,EAAOiD,WAElB,OAAI+G,GAAU,EAAUrN,EACjBA,EAAMS,QAAO,CAAC8lB,EAAUxX,IACzBA,EAAG/K,YAA8C,iBAAzB+K,EAAG/K,WAAWqJ,OACjCkZ,EAASpa,KAAK4C,GAGhBwX,EAAS5lB,OAAOoO,EAAGpO,OAAQ,CAAE0M,YAAY0B,EAAG/K,YAAc,CAAC,KACjE,IAAIlD,KACT,GAjeE,CAAC,SAmeH,SAAmBgF,EAAY9F,EAAcqB,GAG3C,OAAO8jB,EAAYnlB,EAAO,OADI,OAAjB8F,EAAKtC,QAAmB,UAAY,SACTnC,EAC1C,GAteE,CAAC,MAwbH,SAAwByE,EAAY9F,EAAcqB,GAChD,MAAMkR,EAAQlR,EAAOC,MAAM,cAK3B,OAAO6jB,EAAYnlB,EAAO,cAHxBuS,KAAS,YAAaA,IAAkC,mBAAlBA,EAAMpO,SACxCoO,EAAMpO,QAAQ2B,EAAMzE,GAEwBA,EACpD,GA9bE,CAAC,KAgiBH,SACEyE,EACA9F,EACAqB,GAEA,MAAMmlB,EAC4B,UAAhC1gB,EAAKwX,eAAe9Z,QAChBsC,EAAKwX,cACLxX,EAAKwX,eAAeA,cAC1B,OAAa,MAATkJ,EAGKrB,EAAYnlB,EAAO,QAFbkI,MAAMC,KAAKqe,EAAM3c,iBAAiB,OAC9Bd,QAAQjD,GAAQ,EACOzE,GAEnCrB,CACT,GA9iBE,CAAC,IAAKymB,EAAiB,SACvB,CAAC,IAAKA,EAAiB,WACvB,CAAC,SAAUA,EAAiB,WAC5B,CAAC,QA4bH,WACE,OAAO,IAAI3lB,IACb,IA3bM0kB,EAAwB,CAAC1E,EAAAA,GAAgBe,EAAAA,IAAoBphB,QACjE,CAACimB,EAAkCpB,KACjCoB,EAAKpB,EAAKG,SAAWH,EACdoB,IAET,CAAC,GAGGhB,EAAoB,CACxB1E,EAAAA,GACAG,EAAAA,EACAS,EAAAA,GACAE,EAAAA,GACAE,EAAAA,EACAC,EAAAA,GACAxhB,QAAO,CAACimB,EAAkCpB,KAC1CoB,EAAKpB,EAAKG,SAAWH,EACdoB,IACN,CAAC,GAMJ,MAAMC,UAAkBnQ,EAAAA,EAKtBpR,WAAAA,CAAY0E,EAAc+C,GACxB3L,MAAM4I,EAAO+C,GACb5M,KAAK6J,MAAMxK,KAAKmK,iBAAiB,QAASiX,GACxCzgB,KAAK2mB,cAAclG,GAAG,KAExBzgB,KAAK6J,MAAMxK,KAAKmK,iBAAiB,OAAQiX,GAAMzgB,KAAK2mB,cAAclG,GAAG,KACrEzgB,KAAK6J,MAAMxK,KAAKmK,iBAAiB,QAASxJ,KAAK4mB,eAAela,KAAK1M,OACnEA,KAAK6mB,SAAW,GAEhBzC,EAAiBzV,OAAO3O,KAAK4M,QAAQia,UAAUniB,SAC7CoH,IAAyB,IAAvBgS,EAAUgJ,GAAQhb,EAClB9L,KAAK+mB,WAAWjJ,EAAUgJ,EAAQ,GAGxC,CAEAC,UAAAA,CAAWjJ,EAAoBgJ,GAC7B9mB,KAAK6mB,SAAS3a,KAAK,CAAC4R,EAAUgJ,GAChC,CAEAlN,OAAAA,CAAOtB,GAGL,IAFA,KAAE5K,EAAI,KAAE3L,GAAwCuW,EAChDpU,EAAgC/D,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEpC,GAAI+D,EAAQqd,EAAAA,GAAUje,UACpB,OAAO,IAAIzC,MAAQH,OAAOqB,GAAQ,GAAI,CACpC,CAACwf,EAAAA,GAAUje,UAAWY,EAAQqd,EAAAA,GAAUje,YAG5C,IAAKoK,EACH,OAAO,IAAI7M,MAAQH,OAAOqB,GAAQ,GAAImC,GAExC,MAAMnE,EAAQC,KAAKuN,YAAYG,GAE/B,OACEqX,EAAchlB,EAAO,QAC0B,MAA9CA,EAAMwP,IAAIxP,EAAMwP,IAAInP,OAAS,GAAG2D,YAAsBG,EAAQqiB,OAExDxmB,EAAMgT,SAAQ,IAAIlS,MAAQ+O,OAAO7P,EAAMK,SAAW,GAAGqQ,OAAO,IAE9D1Q,CACT,CAEUinB,aAAAA,CAAcvE,GDpHKA,KACzBA,EAAInG,iBACNkG,EAAY9d,SAASuiB,IACnBA,EAAUxE,EAAI,GAElB,ECgHEyE,CAAsBzE,EACxB,CAEUlV,WAAAA,CAAYG,GACpB,MAAM+U,GAAM,IAAI0E,WAAYC,gBAAgB1Z,EAAM,aAClD1N,KAAKgnB,cAAcvE,GACnB,MAAMvL,EAAYuL,EAAIvG,KAChBmL,EAAc,IAAIlb,SACjBmb,EAAiBC,GAAgBvnB,KAAKwnB,gBAC3CtQ,EACAmQ,GAEF,OAAOI,EACLznB,KAAK6J,MAAMzI,OACX8V,EACAoQ,EACAC,EACAF,EAEJ,CAQAK,oBAAAA,CACE1mB,EACA0M,GAEA,IADA8L,EAAqBrZ,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAGuV,EAAAA,GAAMW,QAAQrL,IAEtC,GAAqB,iBAAVhK,EAAoB,CAC7B,MAAMjB,EAAQC,KAAK4Z,QAAQ,CAAElM,KAAM1M,EAAOe,KAAM,KAEhD/B,KAAK6J,MAAMgQ,YAAY9Z,EAAO2N,GAC9B1N,KAAK6J,MAAMiR,aAAa,EAAGpF,EAAAA,GAAMW,QAAQpL,OAC3C,KAAO,CACL,MAAM0c,EAAQ3nB,KAAK4Z,QAAQ,CAAElM,OAAM3L,KAAM,KACzC/B,KAAK6J,MAAMgU,gBACT,IAAIhd,MAAQ+O,OAAO5O,GAAO2N,OAAOgZ,GACjCnO,GAEFxZ,KAAK6J,MAAMiR,aAAa9Z,EAAQ2mB,EAAMvnB,SAAUsV,EAAAA,GAAMW,QAAQpL,OAChE,CACF,CAEA0b,aAAAA,CAAclG,GAAkC,IAAfmH,EAAKznB,UAAAC,OAAA,QAAAC,IAAAF,UAAA,IAAAA,UAAA,GACpC,GAAIsgB,EAAEoH,iBAAkB,OACxBpH,EAAEqH,iBACF,MAAO5hB,GAASlG,KAAK6J,MAAMzE,UAAUsU,WACrC,GAAa,MAATxT,EAAe,OACnB,MAAM,KAAEwH,EAAI,KAAE3L,GAAS/B,KAAK+nB,OAAO7hB,EAAO0hB,GAC1CnH,EAAEuH,eAAeC,QAAQ,aAAclmB,GACvC0e,EAAEuH,eAAeC,QAAQ,YAAava,GAClCka,IACFM,EAAAA,EAAAA,IAAY,CAAEhiB,QAAO2D,MAAO7J,KAAK6J,OAErC,CAEA+c,cAAAA,CAAenG,GACb,GAAIA,EAAEoH,mBAAqB7nB,KAAK6J,MAAM6R,YAAa,OACnD+E,EAAEqH,iBACF,MAAM5hB,EAAQlG,KAAK6J,MAAMgR,cAAa,GACtC,GAAa,MAAT3U,EAAe,OACnB,MAAMwH,EAAO+S,EAAEuH,eAAeG,QAAQ,aAChCpmB,EAAO0e,EAAEuH,eAAeG,QAAQ,cAChCC,EAAQngB,MAAMC,KAAKuY,EAAEuH,eAAeI,OAAS,IACnD,IAAK1a,GAAQ0a,EAAMhoB,OAAS,EAC1BJ,KAAK6J,MAAMmM,SAASqS,OAAOniB,EAAOkiB,OADpC,CAIA,GAAI1a,GAAQ0a,EAAMhoB,OAAS,EAAG,CAC5B,MAAMqiB,GAAM,IAAI0E,WAAYC,gBAAgB1Z,EAAM,aAClD,GACiC,IAA/B+U,EAAIvG,KAAKoM,mBAC+B,QAAxC7F,EAAIvG,KAAKqM,mBAAmBhlB,QAG5B,YADAvD,KAAK6J,MAAMmM,SAASqS,OAAOniB,EAAOkiB,EAGtC,CACApoB,KAAKwoB,QAAQtiB,EAAO,CAAEwH,OAAM3L,QAX5B,CAYF,CAGAgmB,MAAAA,CAAO7hB,GACL,MAAMnE,EAAO/B,KAAK6J,MAAM4H,QAAQvL,GAEhC,MAAO,CAAEwH,KADI1N,KAAK6J,MAAM2R,gBAAgBtV,GACzBnE,OACjB,CAEAymB,OAAAA,CAAQtiB,EAAYuiB,GAAoD,IAAlD,KAAE1mB,EAAI,KAAE2L,GAAwC+a,EACpE,MAAMvkB,EAAUlE,KAAK6J,MAAMoH,UAAU/K,EAAMlF,OACrC0nB,EAAc1oB,KAAK4Z,QAAQ,CAAE7X,OAAM2L,QAAQxJ,GACjDmF,EAAMoC,IAAI,UAAWid,EAAa,CAAE3mB,OAAM2L,SAC1C,MAAM3N,GAAQ,IAAIc,MACf+O,OAAO1J,EAAMlF,OACbyP,OAAOvK,EAAM9F,QACbuO,OAAO+Z,GACV1oB,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAE/ClL,KAAK6J,MAAMiR,aACT/a,EAAMK,SAAW8F,EAAM9F,OACvBsV,EAAAA,GAAMW,QAAQpL,QAEhBjL,KAAK6J,MAAM+Q,yBACb,CAEA4M,eAAAA,CAAgBtQ,EAAoBmQ,GAClC,MAAMC,EAA6B,GAC7BC,EAA0B,GAsBhC,OArBAvnB,KAAK6mB,SAASniB,SAASikB,IACrB,MAAO7K,EAAUgJ,GAAW6B,EAC5B,OAAQ7K,GACN,KAAKxK,KAAK+Q,UACRkD,EAAarb,KAAK4a,GAClB,MACF,KAAKxT,KAAK0R,aACRsC,EAAgBpb,KAAK4a,GACrB,MACF,QACE7e,MAAMC,KAAKgP,EAAUtN,iBAAiBkU,IAAWpZ,SAASmB,IACxD,GAAIwhB,EAAYuB,IAAI/iB,GAAO,CACzB,MAAMgjB,EAAUxB,EAAYtd,IAAIlE,GAChCgjB,GAAS3c,KAAK4a,EAChB,MACEO,EAAYzO,IAAI/S,EAAM,CAACihB,GACzB,IAGN,IAEK,CAACQ,EAAiBC,EAC3B,EAMF,SAASrC,EACPnlB,EACAyB,EACAb,EACAS,GAEA,OAAKA,EAAOC,MAAMG,GAIXzB,EAAMS,QAAO,CAACklB,EAAU5W,KAC7B,GAAIA,EAAG/K,YAAc+K,EAAG/K,WAAWvC,GACjC,OAAOkkB,EAASxZ,KAAK4C,GAEvB,MAAM5K,EAAUvD,EAAQ,CAAE,CAACa,GAASb,GAAU,CAAC,EAE/C,OAAO+kB,EAAShlB,OAAOoO,EAAGpO,OAAQ,IAAKwD,KAAY4K,EAAG/K,YAAa,GAClE,IAAIlD,MAVEd,CAWX,CAEA,SAASglB,EAAchlB,EAAcgC,GACnC,IAAI+mB,EAAU,GACd,IACE,IAAIC,EAAIhpB,EAAMwP,IAAInP,OAAS,EAC3B2oB,GAAK,GAAKD,EAAQ1oB,OAAS2B,EAAK3B,SAC9B2oB,EACF,CACA,MAAMja,EAAK/O,EAAMwP,IAAIwZ,GACrB,GAAyB,iBAAdja,EAAGpO,OAAqB,MACnCooB,EAAUha,EAAGpO,OAASooB,CACxB,CACA,OAAOA,EAAQnb,OAAO,EAAI5L,EAAK3B,UAAY2B,CAC7C,CAEA,SAASwiB,EAAO1e,EAAYzE,GAC1B,KAAMyE,aAAgBsI,SAAU,OAAO,EACvC,MAAMmE,EAAQlR,EAAOC,MAAMwE,GAE3B,QAAIyM,GAASA,EAAM2S,qBAAqBthB,EAAAA,YAEjC,CACL,UACA,UACA,aACA,SACA,KACA,MACA,KACA,KACA,WACA,aACA,SACA,SACA,OACA,KACA,KACA,KACA,KACA,KACA,KACA,SACA,SACA,KACA,OACA,MACA,KACA,SACA,IACA,MACA,UACA,QACA,KACA,KACA,KACA,SACAye,SAASvc,EAAKtC,QAAQylB,cAC1B,CAhFAtC,EAAUpP,SAAW,CACnBuP,SAAU,IA0FZ,MAAMoC,EAAW,IAAI9c,QACrB,SAASmY,EAAMze,GACb,OAAY,MAARA,IACCojB,EAASL,IAAI/iB,KAEK,QAAjBA,EAAKtC,QACP0lB,EAASrQ,IAAI/S,GAAM,GAEnBojB,EAASrQ,IAAI/S,EAAMye,EAAMze,EAAKQ,cAG3B4iB,EAASlf,IAAIlE,GACtB,CAEA,SAAS4hB,EACPrmB,EACAyE,EACAyhB,EACAC,EACAF,GAGA,OAAIxhB,EAAKqjB,WAAarjB,EAAKwe,UAClBkD,EAAa/mB,QAAO,CAACT,EAAc+mB,IACjCA,EAAQjhB,EAAM9F,EAAOqB,IAC3B,IAAIP,MAELgF,EAAKqjB,WAAarjB,EAAKmf,aAClB/c,MAAMC,KAAKrC,EAAKsC,YAAc,IAAI3H,QAAO,CAACT,EAAOqI,KACtD,IAAI+gB,EAAgB1B,EAClBrmB,EACAgH,EACAkf,EACAC,EACAF,GAaF,OAXIjf,EAAU8gB,WAAarjB,EAAKmf,eAC9BmE,EAAgB7B,EAAgB9mB,QAAO,CAAC4oB,EAActC,IAC7CA,EAAQ1e,EAA0BghB,EAAchoB,IACtD+nB,GACHA,GAAiB9B,EAAYtd,IAAI3B,IAAc,IAAI5H,QACjD,CAAC4oB,EAActC,IACNA,EAAQ1e,EAAWghB,EAAchoB,IAE1C+nB,IAGGppB,EAAM4O,OAAOwa,EAAc,GACjC,IAAItoB,MAEF,IAAIA,IACb,CAEA,SAAS2lB,EAAiBhlB,GACxB,MAAO,CAAC6nB,EAAgBtpB,EAAcqB,IAC7B8jB,EAAYnlB,EAAOyB,GAAQ,EAAMJ,EAE5C,CA2HA,SAAS0jB,EAAajf,EAAY9F,EAAcqB,GAC9C,IAAK2jB,EAAchlB,EAAO,MAAO,CAC/B,GACEwkB,EAAO1e,EAAMzE,KACZyE,EAAKsC,WAAW/H,OAAS,GAAKyF,aAAgByjB,sBAE/C,OAAOvpB,EAAMW,OAAO,MAEtB,GAAIX,EAAMK,SAAW,GAAKyF,EAAKgf,YAAa,CAC1C,IAAIA,EAA2Bhf,EAAKgf,YACpC,KAAsB,MAAfA,GAAqB,CAC1B,GAAIN,EAAOM,EAAazjB,GACtB,OAAOrB,EAAMW,OAAO,MAEtB,MAAM4R,EAAQlR,EAAOC,MAAMwjB,GAE3B,GAAIvS,GAASA,EAAM2S,qBAAqBphB,EAAAA,GACtC,OAAO9D,EAAMW,OAAO,MAEtBmkB,EAAcA,EAAY0E,UAC5B,CACF,CACF,CACA,OAAOxpB,CACT,iLC/hBA,MAAMsJ,GAAQC,EAAAA,EAAAA,GAAO,kBAEfkgB,EAAW,OAAOC,KAAKC,UAAUC,UAAY,UAAY,UA+C/D,MAAMC,UAAiBrT,EAAAA,EAGrB,YAAOjE,CAAMuX,EAAoBC,GAC/B,OACG,CAAC,SAAU,UAAW,UAAW,YAAsBviB,MAAM2I,KACnD4Z,EAAQ5Z,KAAS2Z,EAAI3Z,IAAyB,OAAjB4Z,EAAQ5Z,OAK3C4Z,EAAQ5Z,MAAQ2Z,EAAI3Z,KAAO4Z,EAAQ5Z,MAAQ2Z,EAAIE,MACxD,CAIA5kB,WAAAA,CAAY0E,EAAc+C,GACxB3L,MAAM4I,EAAO+C,GACb5M,KAAKgqB,SAAW,CAAC,EAEjB1b,OAAOC,KAAKvO,KAAK4M,QAAQod,UAAUtlB,SAASvD,IAEtCnB,KAAK4M,QAAQod,SAAS7oB,IAExBnB,KAAKiqB,WAAWjqB,KAAK4M,QAAQod,SAAS7oB,GACxC,IAEFnB,KAAKiqB,WAAW,CAAE/Z,IAAK,QAASga,SAAU,MAAQlqB,KAAKmqB,aACvDnqB,KAAKiqB,WACH,CAAE/Z,IAAK,QAASka,QAAS,KAAMC,QAAS,KAAMC,OAAQ,OACtD,SAEE,WAAWb,KAAKC,UAAUa,YAE5BvqB,KAAKiqB,WACH,CAAE/Z,IAAK,aACP,CAAE8O,WAAW,GACbhf,KAAKwqB,iBAEPxqB,KAAKiqB,WACH,CAAE/Z,IAAK,UACP,CAAE8O,WAAW,GACbhf,KAAKyqB,gBAGPzqB,KAAKiqB,WACH,CAAE/Z,IAAK,aACP,CAAE8O,WAAW,EAAM0L,OAAQ,QAC3B1qB,KAAKwqB,iBAEPxqB,KAAKiqB,WACH,CAAE/Z,IAAK,UACP,CAAE8O,WAAW,EAAM7M,OAAQ,QAC3BnS,KAAKyqB,eAGTzqB,KAAKiqB,WACH,CAAE/Z,IAAK,aACP,CAAE8O,WAAW,GACbhf,KAAK2qB,mBAEP3qB,KAAKiqB,WACH,CAAE/Z,IAAK,UACP,CAAE8O,WAAW,GACbhf,KAAK2qB,mBAEP3qB,KAAKiqB,WACH,CACE/Z,IAAK,YACLoa,OAAQ,KACRD,QAAS,KACTD,QAAS,KACTF,SAAU,MAEZ,CAAElL,WAAW,EAAMpZ,OAAQ,GAC3B5F,KAAKwqB,iBAEPxqB,KAAK4qB,QACP,CAEAX,UAAAA,CACEY,GAOA,IANA/nB,EAEmD3C,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EACvD4L,EAEmD5L,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAEvD,MAAM2pB,EAsnBV,SAAmBA,GACjB,GAAuB,iBAAZA,GAA2C,iBAAZA,EACxCA,EAAU,CAAE5Z,IAAK4Z,OACZ,IAAuB,iBAAZA,EAGhB,OAAO,KAFPA,GAAUhZ,EAAAA,EAAAA,GAAUgZ,EAGtB,CAKA,OAJIA,EAAQgB,WACVhB,EAAQN,GAAYM,EAAQgB,gBACrBhB,EAAQgB,UAEVhB,CACT,CAnoBoB7C,CAAU4D,GACX,MAAXf,GAImB,mBAAZhnB,IACTA,EAAU,CAAEiJ,QAASjJ,IAEA,mBAAZiJ,IACTA,EAAU,CAAEA,aAED9D,MAAMyG,QAAQob,EAAQ5Z,KAAO4Z,EAAQ5Z,IAAM,CAAC4Z,EAAQ5Z,MAC5DxL,SAASwL,IACZ,MAAM6a,EAAgB,IACjBjB,EACH5Z,SACGpN,KACAiJ,GAEL/L,KAAKgqB,SAASe,EAAc7a,KAAOlQ,KAAKgqB,SAASe,EAAc7a,MAAQ,GACvElQ,KAAKgqB,SAASe,EAAc7a,KAAKhE,KAAK6e,EAAc,KAlBpD1hB,EAAM2N,KAAK,4CAA6C8S,EAoB5D,CAEAc,MAAAA,GACE5qB,KAAK6J,MAAMxK,KAAKmK,iBAAiB,WAAYqgB,IAC3C,GAAIA,EAAIhC,kBAAoBgC,EAAI5W,YAAa,OAC7C,MAGM4V,GAHY7oB,KAAKgqB,SAASH,EAAI3Z,MAAQ,IAAIvB,OAC9C3O,KAAKgqB,SAASH,EAAIE,QAAU,IAEL7pB,QAAQ4pB,GAC/BF,EAAStX,MAAMuX,EAAKC,KAEtB,GAAuB,IAAnBjB,EAAQzoB,OAAc,OAE1B,MAAMH,EAAOyV,EAAAA,GAAMnD,KAAKsX,EAAIjnB,QAAQ,GACpC,GAAI3C,GAAQA,EAAKmB,SAAWpB,KAAK6J,MAAMzI,OAAQ,OAC/C,MAAM8E,EAAQlG,KAAK6J,MAAMgR,eACzB,GAAa,MAAT3U,IAAkBlG,KAAK6J,MAAM4R,WAAY,OAC7C,MAAOpZ,EAAMuD,GAAU5F,KAAK6J,MAAMuR,QAAQlV,EAAMlF,QACzCgqB,EAAWC,GAAejrB,KAAK6J,MAAMsR,QAAQjV,EAAMlF,QACnDkqB,EAASC,GACG,IAAjBjlB,EAAM9F,OACF,CAAC4qB,EAAWC,GACZjrB,KAAK6J,MAAMsR,QAAQjV,EAAMlF,MAAQkF,EAAM9F,QACvCgrB,EACJJ,aAAqBpnB,EAAAA,SACjBonB,EAAUrqB,QAAQgN,MAAM,EAAGsd,GAC3B,GACAI,EACJH,aAAmBtnB,EAAAA,SAAWsnB,EAAQvqB,QAAQgN,MAAMwd,GAAa,GAC7DG,EAAa,CACjBtM,UAA4B,IAAjB9Y,EAAM9F,OAEjBmrB,MAAwB,IAAjBrlB,EAAM9F,QAAgBiC,EAAKjC,UAAY,EAC9CoB,OAAQxB,KAAK6J,MAAMoH,UAAU/K,GAC7B7D,OACAuD,SACA8kB,OAAQU,EACRjZ,OAAQkZ,EACR1f,MAAOke,GAEShB,EAAQthB,MAAMuiB,IAC9B,GACuB,MAArBA,EAAQ9K,WACR8K,EAAQ9K,YAAcsM,EAAWtM,UAEjC,OAAO,EAET,GAAqB,MAAjB8K,EAAQyB,OAAiBzB,EAAQyB,QAAUD,EAAWC,MACxD,OAAO,EAET,GAAsB,MAAlBzB,EAAQlkB,QAAkBkkB,EAAQlkB,SAAW0lB,EAAW1lB,OAC1D,OAAO,EAET,GAAIqC,MAAMyG,QAAQob,EAAQtoB,SAExB,GAAIsoB,EAAQtoB,OAAOgqB,OAAOrqB,GAAoC,MAA3BmqB,EAAW9pB,OAAOL,KACnD,OAAO,OAEJ,GAA8B,iBAAnB2oB,EAAQtoB,SAGrB8M,OAAOC,KAAKub,EAAQtoB,QAAQgqB,OAAOrqB,IAEL,IAAzB2oB,EAAQtoB,OAAOL,GACiB,MAA3BmqB,EAAW9pB,OAAOL,IAEE,IAAzB2oB,EAAQtoB,OAAOL,GACiB,MAA3BmqB,EAAW9pB,OAAOL,IAEpB6R,EAAAA,EAAAA,GAAQ8W,EAAQtoB,OAAOL,GAAOmqB,EAAW9pB,OAAOL,MAGzD,OAAO,EAGX,QAAsB,MAAlB2oB,EAAQY,SAAmBZ,EAAQY,OAAOjB,KAAK6B,EAAWZ,SAGxC,MAAlBZ,EAAQ3X,SAAmB2X,EAAQ3X,OAAOsX,KAAK6B,EAAWnZ,UAII,IAA3D2X,EAAQ/d,QAAQL,KAAK1L,KAAMkG,EAAOolB,EAAYxB,GAAiB,KAGtED,EAAI/B,gBACN,GAEJ,CAEA0C,eAAAA,CAAgBtkB,EAAcpD,GAE5B,MAAM1C,EAAS,kCAAkCqpB,KAAK3mB,EAAQ4nB,QAC1D,EACA,EACJ,GAAoB,IAAhBxkB,EAAMlF,OAAehB,KAAK6J,MAAMoR,aAAe,EAAG,OACtD,IAAI/W,EAAU,CAAC,EACf,MAAO7B,GAAQrC,KAAK6J,MAAMuR,QAAQlV,EAAMlF,OACxC,IAAIjB,GAAQ,IAAIc,MAAQ+O,OAAO1J,EAAMlF,MAAQZ,GAAQqQ,OAAOrQ,GAC5D,GAAuB,IAAnB0C,EAAQ8C,OAAc,CAExB,MAAOd,GAAQ9E,KAAK6J,MAAMuR,QAAQlV,EAAMlF,MAAQ,GAChD,GAAI8D,KAE0B,UAA1BA,EAAKH,QAAQrB,UAAwBwB,EAAK1E,UAAY,GAClC,CAEpB,MAAMqrB,EAAappB,EAAK6B,UAClBwnB,EAAc1rB,KAAK6J,MAAMoH,UAAU/K,EAAMlF,MAAQ,EAAG,GAE1D,GADAkD,EAAU8L,EAAAA,aAAaC,KAAKwb,EAAYC,IAAgB,CAAC,EACrDpd,OAAOC,KAAKrK,GAAS9D,OAAS,EAAG,CAEnC,MAAMurB,GAAc,IAAI9qB,MAErB+O,OAAO1J,EAAMlF,MAAQqB,EAAKjC,SAAW,GACrCwP,OAAO,EAAG1L,GACbnE,EAAQA,EAAMgT,QAAQ4Y,EACxB,CACF,CAEJ,CACA3rB,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAM6Q,OACb,CAEA+P,YAAAA,CAAavkB,EAAcpD,GAEzB,MAAM1C,EAAS,kCAAkCqpB,KAAK3mB,EAAQqP,QAC1D,EACA,EACJ,GAAIjM,EAAMlF,OAAShB,KAAK6J,MAAMoR,YAAc7a,EAAQ,OACpD,IAAI8D,EAAU,CAAC,EACf,MAAO7B,GAAQrC,KAAK6J,MAAMuR,QAAQlV,EAAMlF,OACxC,IAAIjB,GAAQ,IAAIc,MAAQ+O,OAAO1J,EAAMlF,OAAOyP,OAAOrQ,GAEnD,GAAI0C,EAAQ8C,QAAUvD,EAAKjC,SAAW,EAAG,CACvC,MAAOiD,GAAQrD,KAAK6J,MAAMuR,QAAQlV,EAAMlF,MAAQ,GAChD,GAAIqC,EAAM,CAER,MAAMooB,EAAappB,EAAK6B,UAClB0nB,EAAc5rB,KAAK6J,MAAMoH,UAAU/K,EAAMlF,MAAO,GACtDkD,EAAU8L,EAAAA,aAAaC,KAAKwb,EAAYG,IAAgB,CAAC,EACrDtd,OAAOC,KAAKrK,GAAS9D,OAAS,IAChCL,EAAQA,EAAM6P,OAAOvM,EAAKjD,SAAW,GAAGwP,OAAO,EAAG1L,GAEtD,CACF,CACAlE,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAM6Q,OACb,CAEAiQ,iBAAAA,CAAkBzkB,GAChBgiB,EAAY,CAAEhiB,QAAO2D,MAAO7J,KAAK6J,QACjC7J,KAAK6J,MAAM6Q,OACb,CAEAyP,WAAAA,CAAYjkB,EAAcpD,GACxB,MAAMqO,EAAc7C,OAAOC,KAAKzL,EAAQtB,QAAQhB,QAC9C,CAAC0D,EAAkC1C,KAE/BxB,KAAK6J,MAAMzI,OAAOC,MAAMG,EAAQF,EAAAA,MAAMC,SACrC0G,MAAMyG,QAAQ5L,EAAQtB,OAAOA,MAE9B0C,EAAQ1C,GAAUsB,EAAQtB,OAAOA,IAE5B0C,IAET,CAAC,GAEGnE,GAAQ,IAAIc,MACf+O,OAAO1J,EAAMlF,OACbyP,OAAOvK,EAAM9F,QACbM,OAAO,KAAMyQ,GAChBnR,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQ,EAAG0U,EAAAA,GAAMW,QAAQpL,QACvDjL,KAAK6J,MAAM6Q,OACb,EAGF,MAAMmR,EAAkC,CACtC7B,SAAU,CACR9D,KAAM4F,EAAkB,QACxBjG,OAAQiG,EAAkB,UAC1B/F,UAAW+F,EAAkB,aAC7B1e,OAAQ,CAEN8C,IAAK,MACL1O,OAAQ,CAAC,aAAc,SAAU,QACjCuK,OAAAA,CAAQ7F,EAAOpD,GACb,SAAIA,EAAQkc,WAAgC,IAAnBlc,EAAQ8C,UACjC5F,KAAK6J,MAAMrI,OAAO,SAAU,KAAMkU,EAAAA,GAAMW,QAAQnL,OACzC,EACT,GAEF6gB,QAAS,CACP7b,IAAK,MACLga,UAAU,EACV1oB,OAAQ,CAAC,aAAc,SAAU,QAEjCuK,OAAAA,CAAQ7F,EAAOpD,GACb,SAAIA,EAAQkc,WAAgC,IAAnBlc,EAAQ8C,UACjC5F,KAAK6J,MAAMrI,OAAO,SAAU,KAAMkU,EAAAA,GAAMW,QAAQnL,OACzC,EACT,GAEF,oBAAqB,CACnBgF,IAAK,YACL8O,WAAW,EACXkL,SAAU,KACVE,QAAS,KACTC,QAAS,KACTC,OAAQ,KACR9oB,OAAQ,CAAC,SAAU,QACnBoE,OAAQ,EACRmG,OAAAA,CAAQ7F,EAAOpD,GACgB,MAAzBA,EAAQtB,OAAO4L,OACjBpN,KAAK6J,MAAMrI,OAAO,SAAU,KAAMkU,EAAAA,GAAMW,QAAQnL,MAChB,MAAvBpI,EAAQtB,OAAOuM,MACxB/N,KAAK6J,MAAMrI,OAAO,QAAQ,EAAOkU,EAAAA,GAAMW,QAAQnL,KAEnD,GAEF,oBAAqB8gB,GAAqB,GAC1C,qBAAsBA,GAAqB,GAC3C,aAAc,CACZ9b,IAAK,MACLga,UAAU,EACVlL,WAAW,EACX0L,OAAQ,MACR3e,OAAAA,CAAQ7F,GACNlG,KAAK6J,MAAM8G,WAAWzK,EAAMlF,MAAQ,EAAG,EAAG0U,EAAAA,GAAMW,QAAQnL,KAC1D,GAEF+gB,IAAK,CACH/b,IAAK,MACLnE,OAAAA,CAAQ7F,EAAOpD,GACb,GAAIA,EAAQtB,OAAO+kB,MAAO,OAAO,EACjCvmB,KAAK6J,MAAMkM,QAAQmW,SACnB,MAAMnsB,GAAQ,IAAIc,MACf+O,OAAO1J,EAAMlF,OACbyP,OAAOvK,EAAM9F,QACbM,OAAO,MAIV,OAHAV,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAMkM,QAAQmW,SACnBlsB,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQ,EAAG0U,EAAAA,GAAMW,QAAQpL,SAChD,CACT,GAEF,yBAA0B,CACxBiF,IAAK,QACL8O,WAAW,EACXxd,OAAQ,CAAC,cACT+pB,OAAO,EACPxf,OAAAA,GACE/L,KAAK6J,MAAMrI,OAAO,cAAc,EAAOkU,EAAAA,GAAMW,QAAQnL,KACvD,GAEF,mBAAoB,CAClBgF,IAAK,QACL8O,WAAW,EACXxd,OAAQ,CAAC,QACT+pB,OAAO,EACPxf,OAAAA,CAAQ7F,EAAOpD,GACb,MAAMoB,EAAmC,CAAE6J,MAAM,GAC7CjL,EAAQtB,OAAO4L,SACjBlJ,EAAQkJ,QAAS,GAEnBpN,KAAK6J,MAAM+G,WACT1K,EAAMlF,MACNkF,EAAM9F,OACN8D,EACAwR,EAAAA,GAAMW,QAAQnL,KAElB,GAEF,kBAAmB,CACjBgF,IAAK,QACL8O,WAAW,EACXxd,OAAQ,CAAEuM,KAAM,WAChBhC,OAAAA,CAAQ7F,GACN,MAAO7D,EAAMuD,GAAU5F,KAAK6J,MAAMuR,QAAQlV,EAAMlF,OAC1CkD,EAAU,IAEX7B,EAAK6B,UACR6J,KAAM,WAEFhO,GAAQ,IAAIc,MACf+O,OAAO1J,EAAMlF,OACbN,OAAO,KAAMwD,GAEb0L,OAAOvN,EAAKjC,SAAWwF,EAAS,GAChCgK,OAAO,EAAG,CAAE7B,KAAM,cACrB/N,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQ,EAAG0U,EAAAA,GAAMW,QAAQpL,QACvDjL,KAAK6J,MAAM+Q,yBACb,GAEF,eAAgB,CACd1K,IAAK,QACL8O,WAAW,EACXxd,OAAQ,CAAC,UACT2Q,OAAQ,KACRpG,OAAAA,CAAQ7F,EAAOpD,GACb,MAAOT,EAAMuD,GAAU5F,KAAK6J,MAAMuR,QAAQlV,EAAMlF,OAC1CjB,GAAQ,IAAIc,MACf+O,OAAO1J,EAAMlF,OACbN,OAAO,KAAMoC,EAAQtB,QAErBoO,OAAOvN,EAAKjC,SAAWwF,EAAS,GAChCgK,OAAO,EAAG,CAAEuc,OAAQ,OACvBnsB,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQ,EAAG0U,EAAAA,GAAMW,QAAQpL,QACvDjL,KAAK6J,MAAM+Q,yBACb,GAEF,kBAAmB,CACjB1K,IAAK,YACL1O,OAAQ,CAAC,SACTwd,WAAW,EACXpZ,OAAQ,EACRmG,OAAAA,GAAW,GAEb,eAAgB,CACdmE,IAAK,SACL1O,OAAQ,CAAC,SACTwd,WAAW,EACX7M,OAAQ,KACRpG,OAAAA,GAAW,GAEb,cAAe,CACbmE,IAAK,QACLga,SAAU,KACV1oB,OAAQ,CAAC,SACTuK,OAAAA,CAAQ7F,GACN,MAAM1G,EAASQ,KAAK6J,MAAM0R,UAAU,SACpC,GAAI/b,EAAQ,CAEV,MAAO+mB,EAAO6F,EAAKC,EAAMzmB,GAAUpG,EAAO8sB,SAASpmB,GAC7ClE,EA6ShB,SAAmBuqB,EAAiBH,EAAWC,EAAYzmB,GACzD,OAAgB,MAAZwmB,EAAItnB,MAA4B,MAAZsnB,EAAI/oB,KACT,MAAbgpB,EAAKvnB,MAA6B,MAAbunB,EAAKhpB,KACV,IAAXuC,GAAgB,EAAI,EAET,MAAbymB,EAAKvnB,MAAgB,EAAI,EAElB,MAAZsnB,EAAItnB,MACE,EAEM,MAAZsnB,EAAI/oB,KACC,EAEF,IACT,CA3TwBmpB,CAAUjG,EAAO6F,EAAKC,EAAMzmB,GAC1C,GAAa,MAAT5D,EAAe,OACnB,IAAIhB,EAAQulB,EAAM3gB,SAClB,GAAI5D,EAAQ,EAAG,CACb,MAAMjC,GAAQ,IAAIc,MAAQ+O,OAAO5O,GAAON,OAAO,MAC/CV,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAMiR,aACT5U,EAAMlF,MAAQ,EACdkF,EAAM9F,OACNsV,EAAAA,GAAMW,QAAQpL,OAElB,MAAO,GAAIjJ,EAAQ,EAAG,CACpBhB,GAASulB,EAAMnmB,SACf,MAAML,GAAQ,IAAIc,MAAQ+O,OAAO5O,GAAON,OAAO,MAC/CV,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAMiR,aAAa9Z,EAAO0U,EAAAA,GAAMW,QAAQnL,KAC/C,CACF,CACF,GAEF,YAAa,CACXgF,IAAK,MACLga,SAAU,KACV1oB,OAAQ,CAAC,SACTuK,OAAAA,CAAQ7F,EAAOpD,GACb,MAAM,MAAE6I,EAAOtJ,KAAMgqB,GAASvpB,EACxB8C,EAASymB,EAAKzmB,OAAO5F,KAAK6J,MAAMzI,QAClCuK,EAAMue,SACRlqB,KAAK6J,MAAMiR,aAAalV,EAAS,EAAG8P,EAAAA,GAAMW,QAAQnL,MAElDlL,KAAK6J,MAAMiR,aAAalV,EAASymB,EAAKjsB,SAAUsV,EAAAA,GAAMW,QAAQnL,KAElE,GAEF,gBAAiB,CACfgF,IAAK,IACLga,SAAU,KACVlL,WAAW,EACXxd,OAAQ,CACN,cAAc,EACdirB,YAAY,EACZlG,OAAO,GAETmE,OAAQ,kCACR3e,OAAAA,CAAQ7F,EAAOpD,GACb,GAAuC,MAAnC9C,KAAK6J,MAAMzI,OAAOC,MAAM,QAAiB,OAAO,EACpD,MAAM,OAAEjB,GAAW0C,EAAQ4nB,QACpBroB,EAAMuD,GAAU5F,KAAK6J,MAAMuR,QAAQlV,EAAMlF,OAChD,GAAI4E,EAASxF,EAAQ,OAAO,EAC5B,IAAIO,EACJ,OAAQmC,EAAQ4nB,OAAOjS,QACrB,IAAK,KACL,IAAK,MACH9X,EAAQ,YACR,MACF,IAAK,MACHA,EAAQ,UACR,MACF,IAAK,IACL,IAAK,IACHA,EAAQ,SACR,MACF,QACEA,EAAQ,UAEZX,KAAK6J,MAAMkI,WAAW7L,EAAMlF,MAAO,IAAK0U,EAAAA,GAAMW,QAAQnL,MACtDlL,KAAK6J,MAAMkM,QAAQmW,SACnB,MAAMnsB,GAAQ,IAAIc,MACf+O,OAAO1J,EAAMlF,MAAQ4E,GACrB6K,OAAOrQ,EAAS,GAEhBwP,OAAOvN,EAAKjC,SAAW,EAAIwF,GAC3BgK,OAAO,EAAG,CAAE7B,KAAMpN,IAIrB,OAHAX,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAMkM,QAAQmW,SACnBlsB,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQZ,EAAQsV,EAAAA,GAAMW,QAAQpL,SACrD,CACT,GAEF,YAAa,CACXiF,IAAK,QACL8O,WAAW,EACXxd,OAAQ,CAAC,cACTkpB,OAAQ,KACRvY,OAAQ,QACRpG,OAAAA,CAAQ7F,GACN,MAAO7D,EAAMuD,GAAU5F,KAAK6J,MAAMuR,QAAQlV,EAAMlF,OAChD,IAAI0rB,EAAW,EACXC,EAAMtqB,EACV,KACS,MAAPsqB,GACAA,EAAIvsB,UAAY,GAChBusB,EAAIzoB,UAAU,eAMd,GAHAyoB,EAAMA,EAAI7nB,KACV4nB,GAAY,EAERA,GAAY,EAAG,CACjB,MAAM3sB,GAAQ,IAAIc,MAEf+O,OAAO1J,EAAMlF,MAAQqB,EAAKjC,SAAWwF,EAAS,GAC9CgK,OAAO,EAAG,CAAE,aAAc,OAC1Ba,OAAO,GAGV,OAFAzQ,KAAK6J,MAAMgU,eAAe9d,EAAO2V,EAAAA,GAAMW,QAAQnL,MAC/ClL,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQ,EAAG0U,EAAAA,GAAMW,QAAQpL,SAChD,CACT,CAEF,OAAO,CACT,GAEF,aAAc2hB,EAAsB,aAAa,GACjD,mBAAoBA,EAAsB,aAAa,GACvD,cAAeA,EAAsB,cAAc,GACnD,oBAAqBA,EAAsB,cAAc,GACzD,aAAcC,GAAsB,GACpC,WAAYA,GAAsB,KAMtC,SAASb,EAAqB5e,GAC5B,MAAO,CACL8C,IAAK,MACLga,UAAW9c,EACX5L,OAAQ,CAAE,cAAc,GACxBuK,OAAAA,CAAQ7F,EAAK4F,GAAa,IAAX,MAAEH,GAAOG,EACtB,MAAMyV,EAAYvhB,KAAK6J,MAAMzI,OAAOC,MAAM,eAEpC,IAAEyrB,GAAQvL,EAChB,GAAqB,IAAjBrb,EAAM9F,SAAiBuL,EAAMue,SAG/B,OAFAlqB,KAAK6J,MAAMkI,WAAW7L,EAAMlF,MAAO8rB,EAAKpX,EAAAA,GAAMW,QAAQnL,WACtDlL,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQ8rB,EAAI1sB,OAAQsV,EAAAA,GAAMW,QAAQpL,QAIlE,MAAMpJ,EACa,IAAjBqE,EAAM9F,OACFJ,KAAK6J,MAAMwR,SAASnV,EAAMlF,MAAO,GACjChB,KAAK6J,MAAMwR,SAASnV,GAC1B,IAAI,MAAElF,EAAK,OAAEZ,GAAW8F,EACxBrE,EAAM6C,SAAQ,CAACrC,EAAM0mB,KACf3b,GACF/K,EAAKV,SAAS,EAAGmrB,GACP,IAAN/D,EACF/nB,GAAS8rB,EAAI1sB,OAEbA,GAAU0sB,EAAI1sB,QAGPiC,EAAK4B,QAAQ8oB,YAAY9V,WAAW6V,KAC7CzqB,EAAKtB,SAAS,EAAG+rB,EAAI1sB,QACX,IAAN2oB,EACF/nB,GAAS8rB,EAAI1sB,OAEbA,GAAU0sB,EAAI1sB,OAElB,IAEFJ,KAAK6J,MAAMxC,OAAOqO,EAAAA,GAAMW,QAAQnL,MAChClL,KAAK6J,MAAMiR,aAAa9Z,EAAOZ,EAAQsV,EAAAA,GAAMW,QAAQpL,OACvD,EAEJ,CAEA,SAAS2hB,EACP1c,EACAga,GAGA,MAAO,CACLha,MACAga,WACAI,OAAQ,KACR,CALoB,cAARpa,EAAsB,SAAW,UAKpC,KACTnE,OAAAA,CAAQ7F,GACN,IAAI,MAAElF,GAAUkF,EACJ,eAARgK,IACFlP,GAASkF,EAAM9F,OAAS,GAE1B,MAAOK,GAAQT,KAAK6J,MAAMsR,QAAQna,GAClC,QAAMP,aAAgBkD,EAAAA,YACV,cAARuM,EACEga,EACFlqB,KAAK6J,MAAMiR,aACT5U,EAAMlF,MAAQ,EACdkF,EAAM9F,OAAS,EACfsV,EAAAA,GAAMW,QAAQnL,MAGhBlL,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQ,EAAG0U,EAAAA,GAAMW,QAAQnL,MAEhDgf,EACTlqB,KAAK6J,MAAMiR,aACT5U,EAAMlF,MACNkF,EAAM9F,OAAS,EACfsV,EAAAA,GAAMW,QAAQnL,MAGhBlL,KAAK6J,MAAMiR,aACT5U,EAAMlF,MAAQkF,EAAM9F,OAAS,EAC7BsV,EAAAA,GAAMW,QAAQnL,MAGX,GACT,EAEJ,CAEA,SAAS4gB,EAAkBtqB,GACzB,MAAO,CACL0O,IAAK1O,EAAO,GACZspB,UAAU,EACV/e,OAAAA,CAAQ7F,EAAOpD,GACb9C,KAAK6J,MAAMrI,OAAOA,GAASsB,EAAQtB,OAAOA,GAASkU,EAAAA,GAAMW,QAAQnL,KACnE,EAEJ,CAEA,SAAS2hB,EAAsBG,GAC7B,MAAO,CACL9c,IAAK8c,EAAK,UAAY,YACtBhO,WAAW,EACXxd,OAAQ,CAAC,SACTuK,OAAAA,CAAQ7F,EAAOpD,GAEb,MAAMoN,EAAM8c,EAAK,OAAS,OACpBX,EAAOvpB,EAAQT,KACf4qB,EAAYZ,EAAKjpB,OAAO8M,GAC9B,GAAiB,MAAb+c,GACF,GAAmC,cAA/BA,EAAUtoB,QAAQrB,SAA0B,CAE9C,IAAI4pB,EAAaD,EAAUhrB,SAASO,KAChCmqB,EAAMN,EACV,KAAmB,MAAZM,EAAI7nB,MAET6nB,EAAMA,EAAI7nB,KACVooB,EAAaA,EAAW7pB,KAE1B,MAAMrC,EACJksB,EAAWtnB,OAAO5F,KAAK6J,MAAMzI,QAC7BK,KAAKC,IAAIoB,EAAQ8C,OAAQsnB,EAAW9sB,SAAW,GACjDJ,KAAK6J,MAAMiR,aAAa9Z,EAAO,EAAG0U,EAAAA,GAAMW,QAAQnL,KAClD,MACK,CAEL,MAAMiiB,EAAad,EAAK9F,QAAQrW,GACd,MAAdid,IACEH,EACFhtB,KAAK6J,MAAMiR,aACTqS,EAAWvnB,OAAO5F,KAAK6J,MAAMzI,QAAU+rB,EAAW/sB,SAAW,EAC7D,EACAsV,EAAAA,GAAMW,QAAQnL,MAGhBlL,KAAK6J,MAAMiR,aACTqS,EAAWvnB,OAAO5F,KAAK6J,MAAMzI,QAC7B,EACAsU,EAAAA,GAAMW,QAAQnL,MAItB,CACA,OAAO,CACT,EAEJ,CAkBA,SAASgd,EAAW5P,GAAmD,IAAlD,MAAEzO,EAAK,MAAE3D,GAAuCoS,EACnE,MAAMzW,EAAQgI,EAAMwR,SAASnV,GAC7B,IAAIhC,EAAU,CAAC,EACf,GAAIrC,EAAMzB,OAAS,EAAG,CACpB,MAAMgtB,EAAevrB,EAAM,GAAGqC,UACxBmpB,EAAcxrB,EAAMA,EAAMzB,OAAS,GAAG8D,UAC5CA,EAAU8L,EAAAA,aAAaC,KAAKod,EAAaD,IAAiB,CAAC,CAC7D,CACAvjB,EAAM8G,WAAWzK,EAAOwP,EAAAA,GAAMW,QAAQnL,MAClCoD,OAAOC,KAAKrK,GAAS9D,OAAS,GAChCyJ,EAAM+G,WAAW1K,EAAMlF,MAAO,EAAGkD,EAASwR,EAAAA,GAAMW,QAAQnL,MAE1DrB,EAAMiR,aAAa5U,EAAMlF,MAAO0U,EAAAA,GAAMW,QAAQpL,OAChD,CAlLA2e,EAAStS,SAAWuU,iCCnnBpB,IAAIjD,EAAMta,OAAO2W,UAAUqI,eACvB5C,EAAS,IASb,SAAS6C,IAAU,CA4BnB,SAASC,EAAGC,EAAI3qB,EAAS8Y,GACvB5b,KAAKytB,GAAKA,EACVztB,KAAK8C,QAAUA,EACf9C,KAAK4b,KAAOA,IAAQ,CACtB,CAaA,SAAS8R,EAAY1jB,EAAS2B,EAAO8hB,EAAI3qB,EAAS8Y,GAChD,GAAkB,mBAAP6R,EACT,MAAM,IAAIE,UAAU,mCAGtB,IAAIC,EAAW,IAAIJ,EAAGC,EAAI3qB,GAAWkH,EAAS4R,GAC1CiO,EAAMa,EAASA,EAAS/e,EAAQA,EAMpC,OAJK3B,EAAQ6jB,QAAQhE,GACX7f,EAAQ6jB,QAAQhE,GAAK4D,GAC1BzjB,EAAQ6jB,QAAQhE,GAAO,CAAC7f,EAAQ6jB,QAAQhE,GAAM+D,GADhB5jB,EAAQ6jB,QAAQhE,GAAK3d,KAAK0hB,IADlC5jB,EAAQ6jB,QAAQhE,GAAO+D,EAAU5jB,EAAQ8jB,gBAI7D9jB,CACT,CASA,SAAS+jB,EAAW/jB,EAAS6f,GACI,KAAzB7f,EAAQ8jB,aAAoB9jB,EAAQ6jB,QAAU,IAAIN,SAC5CvjB,EAAQ6jB,QAAQhE,EAC9B,CASA,SAAS3f,IACPlK,KAAK6tB,QAAU,IAAIN,EACnBvtB,KAAK8tB,aAAe,CACtB,CAzEIxf,OAAO7J,SACT8oB,EAAOtI,UAAY3W,OAAO7J,OAAO,OAM5B,IAAI8oB,GAASS,YAAWtD,GAAS,IA2ExCxgB,EAAa+a,UAAUgJ,WAAa,WAClC,IACIza,EACArS,EAFA+sB,EAAQ,GAIZ,GAA0B,IAAtBluB,KAAK8tB,aAAoB,OAAOI,EAEpC,IAAK/sB,KAASqS,EAASxT,KAAK6tB,QACtBjF,EAAIld,KAAK8H,EAAQrS,IAAO+sB,EAAMhiB,KAAKwe,EAASvpB,EAAKwM,MAAM,GAAKxM,GAGlE,OAAImN,OAAO6f,sBACFD,EAAMvf,OAAOL,OAAO6f,sBAAsB3a,IAG5C0a,CACT,EASAhkB,EAAa+a,UAAUmJ,UAAY,SAAmBziB,GACpD,IAAIke,EAAMa,EAASA,EAAS/e,EAAQA,EAChC0iB,EAAWruB,KAAK6tB,QAAQhE,GAE5B,IAAKwE,EAAU,MAAO,GACtB,GAAIA,EAASZ,GAAI,MAAO,CAACY,EAASZ,IAElC,IAAK,IAAI1E,EAAI,EAAGuF,EAAID,EAASjuB,OAAQmuB,EAAK,IAAItmB,MAAMqmB,GAAIvF,EAAIuF,EAAGvF,IAC7DwF,EAAGxF,GAAKsF,EAAStF,GAAG0E,GAGtB,OAAOc,CACT,EASArkB,EAAa+a,UAAUuJ,cAAgB,SAAuB7iB,GAC5D,IAAIke,EAAMa,EAASA,EAAS/e,EAAQA,EAChCyiB,EAAYpuB,KAAK6tB,QAAQhE,GAE7B,OAAKuE,EACDA,EAAUX,GAAW,EAClBW,EAAUhuB,OAFM,CAGzB,EASA8J,EAAa+a,UAAU3Z,KAAO,SAAcK,EAAO8iB,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,IAAIhF,EAAMa,EAASA,EAAS/e,EAAQA,EAEpC,IAAK3L,KAAK6tB,QAAQhE,GAAM,OAAO,EAE/B,IAEIngB,EACAqf,EAHAqF,EAAYpuB,KAAK6tB,QAAQhE,GACzBiF,EAAM3uB,UAAUC,OAIpB,GAAIguB,EAAUX,GAAI,CAGhB,OAFIW,EAAUxS,MAAM5b,KAAK+uB,eAAepjB,EAAOyiB,EAAUX,QAAIptB,GAAW,GAEhEyuB,GACN,KAAK,EAAG,OAAOV,EAAUX,GAAG/hB,KAAK0iB,EAAUtrB,UAAU,EACrD,KAAK,EAAG,OAAOsrB,EAAUX,GAAG/hB,KAAK0iB,EAAUtrB,QAAS2rB,IAAK,EACzD,KAAK,EAAG,OAAOL,EAAUX,GAAG/hB,KAAK0iB,EAAUtrB,QAAS2rB,EAAIC,IAAK,EAC7D,KAAK,EAAG,OAAON,EAAUX,GAAG/hB,KAAK0iB,EAAUtrB,QAAS2rB,EAAIC,EAAIC,IAAK,EACjE,KAAK,EAAG,OAAOP,EAAUX,GAAG/hB,KAAK0iB,EAAUtrB,QAAS2rB,EAAIC,EAAIC,EAAIC,IAAK,EACrE,KAAK,EAAG,OAAOR,EAAUX,GAAG/hB,KAAK0iB,EAAUtrB,QAAS2rB,EAAIC,EAAIC,EAAIC,EAAIC,IAAK,EAG3E,IAAK9F,EAAI,EAAGrf,EAAO,IAAIzB,MAAM6mB,EAAK,GAAI/F,EAAI+F,EAAK/F,IAC7Crf,EAAKqf,EAAI,GAAK5oB,UAAU4oB,GAG1BqF,EAAUX,GAAGuB,MAAMZ,EAAUtrB,QAAS4G,EACxC,KAAO,CACL,IACIulB,EADA7uB,EAASguB,EAAUhuB,OAGvB,IAAK2oB,EAAI,EAAGA,EAAI3oB,EAAQ2oB,IAGtB,OAFIqF,EAAUrF,GAAGnN,MAAM5b,KAAK+uB,eAAepjB,EAAOyiB,EAAUrF,GAAG0E,QAAIptB,GAAW,GAEtEyuB,GACN,KAAK,EAAGV,EAAUrF,GAAG0E,GAAG/hB,KAAK0iB,EAAUrF,GAAGjmB,SAAU,MACpD,KAAK,EAAGsrB,EAAUrF,GAAG0E,GAAG/hB,KAAK0iB,EAAUrF,GAAGjmB,QAAS2rB,GAAK,MACxD,KAAK,EAAGL,EAAUrF,GAAG0E,GAAG/hB,KAAK0iB,EAAUrF,GAAGjmB,QAAS2rB,EAAIC,GAAK,MAC5D,KAAK,EAAGN,EAAUrF,GAAG0E,GAAG/hB,KAAK0iB,EAAUrF,GAAGjmB,QAAS2rB,EAAIC,EAAIC,GAAK,MAChE,QACE,IAAKjlB,EAAM,IAAKulB,EAAI,EAAGvlB,EAAO,IAAIzB,MAAM6mB,EAAK,GAAIG,EAAIH,EAAKG,IACxDvlB,EAAKulB,EAAI,GAAK9uB,UAAU8uB,GAG1Bb,EAAUrF,GAAG0E,GAAGuB,MAAMZ,EAAUrF,GAAGjmB,QAAS4G,GAGpD,CAEA,OAAO,CACT,EAWAQ,EAAa+a,UAAU7Z,GAAK,SAAYO,EAAO8hB,EAAI3qB,GACjD,OAAO4qB,EAAY1tB,KAAM2L,EAAO8hB,EAAI3qB,GAAS,EAC/C,EAWAoH,EAAa+a,UAAUrJ,KAAO,SAAcjQ,EAAO8hB,EAAI3qB,GACrD,OAAO4qB,EAAY1tB,KAAM2L,EAAO8hB,EAAI3qB,GAAS,EAC/C,EAYAoH,EAAa+a,UAAU8J,eAAiB,SAAwBpjB,EAAO8hB,EAAI3qB,EAAS8Y,GAClF,IAAIiO,EAAMa,EAASA,EAAS/e,EAAQA,EAEpC,IAAK3L,KAAK6tB,QAAQhE,GAAM,OAAO7pB,KAC/B,IAAKytB,EAEH,OADAM,EAAW/tB,KAAM6pB,GACV7pB,KAGT,IAAIouB,EAAYpuB,KAAK6tB,QAAQhE,GAE7B,GAAIuE,EAAUX,GAEVW,EAAUX,KAAOA,GACf7R,IAAQwS,EAAUxS,MAClB9Y,GAAWsrB,EAAUtrB,UAAYA,GAEnCirB,EAAW/tB,KAAM6pB,OAEd,CACL,IAAK,IAAId,EAAI,EAAGvV,EAAS,GAAIpT,EAASguB,EAAUhuB,OAAQ2oB,EAAI3oB,EAAQ2oB,KAEhEqF,EAAUrF,GAAG0E,KAAOA,GACnB7R,IAASwS,EAAUrF,GAAGnN,MACtB9Y,GAAWsrB,EAAUrF,GAAGjmB,UAAYA,IAErC0Q,EAAOtH,KAAKkiB,EAAUrF,IAOtBvV,EAAOpT,OAAQJ,KAAK6tB,QAAQhE,GAAyB,IAAlBrW,EAAOpT,OAAeoT,EAAO,GAAKA,EACpEua,EAAW/tB,KAAM6pB,EACxB,CAEA,OAAO7pB,IACT,EASAkK,EAAa+a,UAAUiK,mBAAqB,SAA4BvjB,GACtE,IAAIke,EAUJ,OARIle,GACFke,EAAMa,EAASA,EAAS/e,EAAQA,EAC5B3L,KAAK6tB,QAAQhE,IAAMkE,EAAW/tB,KAAM6pB,KAExC7pB,KAAK6tB,QAAU,IAAIN,EACnBvtB,KAAK8tB,aAAe,GAGf9tB,IACT,EAKAkK,EAAa+a,UAAUtJ,IAAMzR,EAAa+a,UAAU8J,eACpD7kB,EAAa+a,UAAUyI,YAAcxjB,EAAa+a,UAAU7Z,GAK5DlB,EAAailB,SAAWzE,EAKxBxgB,EAAaA,aAAeA,EAM1B1K,EAAOD,QAAU2K,oBChTnB,IAAIklB,GAAe,EACfC,EAAc,EACdC,EAAa,EAWjB,SAASC,EAAUC,EAAOC,EAAOC,EAAYC,EAASC,GAEpD,GAAIJ,IAAUC,EACZ,OAAID,EACK,CAAC,CAACF,EAAYE,IAEhB,GAGT,GAAkB,MAAdE,EAAoB,CACtB,IAAIG,EAy9BR,SAA+Bld,EAASjM,EAASgpB,GAE/C,IAAI7c,EACoB,iBAAf6c,EACH,CAAE1uB,MAAO0uB,EAAYtvB,OAAQ,GAC7BsvB,EAAW7c,SACbC,EAAiC,iBAAf4c,EAA0B,KAAOA,EAAW5c,SAK9Dgd,EAAYnd,EAAQvS,OACpB2vB,EAAYrpB,EAAQtG,OACxB,GAAwB,IAApByS,EAASzS,SAA8B,OAAb0S,GAAyC,IAApBA,EAAS1S,QAAe,CAEzE,IAAI4vB,EAAYnd,EAAS7R,MACrBivB,EAAYtd,EAAQhF,MAAM,EAAGqiB,GAC7BE,EAAWvd,EAAQhF,MAAMqiB,GACzBG,EAAiBrd,EAAWA,EAAS9R,MAAQ,KAG3CovB,EAAYJ,EAAYD,EAAYD,EACxC,IAAuB,OAAnBK,GAA2BA,IAAmBC,MAG9CA,EAAY,GAAKA,EAAYL,GAAjC,CAGA,IAAIM,EAAY3pB,EAAQiH,MAAM,EAAGyiB,GAEjC,IADIE,EAAW5pB,EAAQiH,MAAMyiB,MACZF,EAAjB,CAGA,IAAIK,EAAe9uB,KAAKC,IAAIsuB,EAAWI,GAGvC,IAFII,EAAYP,EAAUtiB,MAAM,EAAG4iB,OAC/BE,EAAYJ,EAAU1iB,MAAM,EAAG4iB,IAMnC,OAAOG,EAAiBF,EAFRP,EAAUtiB,MAAM4iB,GAChBF,EAAU1iB,MAAM4iB,GACyBL,EATzD,CALA,CAkBA,GAAuB,OAAnBC,GAA2BA,IAAmBH,EAAlD,CAGA,IAAI3R,EAAS2R,EAETM,GADAD,EAAY3pB,EAAQiH,MAAM,EAAG0Q,GAClB3X,EAAQiH,MAAM0Q,IAC7B,GAAIgS,IAAcJ,EAAlB,CAGA,IAAI/d,EAAezQ,KAAKC,IAAIouB,EAAYzR,EAAQ0R,EAAY1R,GAG5D,IAFIsS,EAAYT,EAASviB,MAAMuiB,EAAS9vB,OAAS8R,OAC7C0e,EAAYN,EAAS3iB,MAAM2iB,EAASlwB,OAAS8R,IAMjD,OAAOwe,EAAiBT,EAFRC,EAASviB,MAAM,EAAGuiB,EAAS9vB,OAAS8R,GACpCoe,EAAS3iB,MAAM,EAAG2iB,EAASlwB,OAAS8R,GACKye,EATzD,CANA,CAiBJ,CACA,GAAI9d,EAASzS,OAAS,GAAK0S,GAAgC,IAApBA,EAAS1S,OAAc,CAG1D,IAAIowB,EAAY7d,EAAQhF,MAAM,EAAGkF,EAAS7R,OACtC2vB,EAAYhe,EAAQhF,MAAMkF,EAAS7R,MAAQ6R,EAASzS,QAGxD,KAAI2vB,GAFAQ,EAAeC,EAAUpwB,SACzB8R,EAAeye,EAAUvwB,SAC7B,CAGA,IAAIqwB,EAAY/pB,EAAQiH,MAAM,EAAG4iB,GAC7BK,EAAYlqB,EAAQiH,MAAMoiB,EAAY7d,GAC1C,GAAIse,IAAcC,GAAaE,IAAcC,EAK7C,OAAOF,EAAiBF,EAFR7d,EAAQhF,MAAM4iB,EAAcT,EAAY5d,GACxCxL,EAAQiH,MAAM4iB,EAAcR,EAAY7d,GACCye,EARzD,CAUJ,CAEA,OAAO,IACT,CAhjCmBE,CAAsBrB,EAAOC,EAAOC,GACnD,GAAIG,EACF,OAAOA,CAEX,CAGA,IAAIiB,EAAeC,EAAkBvB,EAAOC,GACxCuB,EAAexB,EAAMyB,UAAU,EAAGH,GAKtCA,EAAeI,EAJf1B,EAAQA,EAAMyB,UAAUH,GACxBrB,EAAQA,EAAMwB,UAAUH,IAIxB,IAAIK,EAAe3B,EAAMyB,UAAUzB,EAAMpvB,OAAS0wB,GAK9CM,EAuBN,SAAuB5B,EAAOC,GAC5B,IAAI2B,EAEJ,IAAK5B,EAEH,MAAO,CAAC,CAACH,EAAaI,IAGxB,IAAKA,EAEH,MAAO,CAAC,CAACL,EAAaI,IAGxB,IAAI6B,EAAW7B,EAAMpvB,OAASqvB,EAAMrvB,OAASovB,EAAQC,EACjD6B,EAAY9B,EAAMpvB,OAASqvB,EAAMrvB,OAASqvB,EAAQD,EAClDzG,EAAIsI,EAASvoB,QAAQwoB,GACzB,IAAW,IAAPvI,EAWF,OATAqI,EAAQ,CACN,CAAC/B,EAAagC,EAASJ,UAAU,EAAGlI,IACpC,CAACuG,EAAYgC,GACb,CAACjC,EAAagC,EAASJ,UAAUlI,EAAIuI,EAAUlxB,UAG7CovB,EAAMpvB,OAASqvB,EAAMrvB,SACvBgxB,EAAM,GAAG,GAAKA,EAAM,GAAG,GAAKhC,GAEvBgC,EAGT,GAAyB,IAArBE,EAAUlxB,OAGZ,MAAO,CACL,CAACgvB,EAAaI,GACd,CAACH,EAAaI,IAKlB,IAAI8B,EA2SN,SAAyB/B,EAAOC,GAC9B,IAAI4B,EAAW7B,EAAMpvB,OAASqvB,EAAMrvB,OAASovB,EAAQC,EACjD6B,EAAY9B,EAAMpvB,OAASqvB,EAAMrvB,OAASqvB,EAAQD,EACtD,GAAI6B,EAASjxB,OAAS,GAAwB,EAAnBkxB,EAAUlxB,OAAaixB,EAASjxB,OACzD,OAAO,KAeT,SAASoxB,EAAiBH,EAAUC,EAAWvI,GAM7C,IAJA,IAGI0I,EAAiBC,EAAiBC,EAAkBC,EAHpDC,EAAOR,EAASJ,UAAUlI,EAAGA,EAAItnB,KAAKqwB,MAAMT,EAASjxB,OAAS,IAC9D6uB,GAAK,EACL8C,EAAc,IAE+B,KAAzC9C,EAAIqC,EAAUxoB,QAAQ+oB,EAAM5C,EAAI,KAAY,CAClD,IAAIsB,EAAeQ,EACjBM,EAASJ,UAAUlI,GACnBuI,EAAUL,UAAUhC,IAElB/c,EAAegf,EACjBG,EAASJ,UAAU,EAAGlI,GACtBuI,EAAUL,UAAU,EAAGhC,IAErB8C,EAAY3xB,OAAS8R,EAAeqe,IACtCwB,EACET,EAAUL,UAAUhC,EAAI/c,EAAc+c,GACtCqC,EAAUL,UAAUhC,EAAGA,EAAIsB,GAC7BkB,EAAkBJ,EAASJ,UAAU,EAAGlI,EAAI7W,GAC5Cwf,EAAkBL,EAASJ,UAAUlI,EAAIwH,GACzCoB,EAAmBL,EAAUL,UAAU,EAAGhC,EAAI/c,GAC9C0f,EAAmBN,EAAUL,UAAUhC,EAAIsB,GAE/C,CACA,OAAyB,EAArBwB,EAAY3xB,QAAcixB,EAASjxB,OAC9B,CACLqxB,EACAC,EACAC,EACAC,EACAG,GAGK,IAEX,CAGA,IAWIR,EAaAS,EAASC,EAASC,EAASC,EAxB3BC,EAAMZ,EACRH,EACAC,EACA7vB,KAAK4wB,KAAKhB,EAASjxB,OAAS,IAG1BkyB,EAAMd,EACRH,EACAC,EACA7vB,KAAK4wB,KAAKhB,EAASjxB,OAAS,IAG9B,OAAKgyB,GAAQE,GAQXf,EANUe,EAEAF,GAILA,EAAI,GAAGhyB,OAASkyB,EAAI,GAAGlyB,OAASgyB,EAHhCE,EAFAF,EAUH5C,EAAMpvB,OAASqvB,EAAMrvB,QACvB4xB,EAAUT,EAAG,GACbU,EAAUV,EAAG,GACbW,EAAUX,EAAG,GACbY,EAAUZ,EAAG,KAEbW,EAAUX,EAAG,GACbY,EAAUZ,EAAG,GACbS,EAAUT,EAAG,GACbU,EAAUV,EAAG,IAGR,CAACS,EAASC,EAASC,EAASC,EADlBZ,EAAG,KAvBX,IAyBX,CA3YWgB,CAAgB/C,EAAOC,GAChC,GAAI8B,EAAI,CAEN,IAAIS,EAAUT,EAAG,GACbU,EAAUV,EAAG,GACbW,EAAUX,EAAG,GACbY,EAAUZ,EAAG,GACbiB,EAAajB,EAAG,GAEhBkB,EAAUlD,EAAUyC,EAASE,GAC7BQ,EAAUnD,EAAU0C,EAASE,GAEjC,OAAOM,EAAQ9jB,OAAO,CAAC,CAAC2gB,EAAYkD,IAAcE,EACpD,CAEA,OAYF,SAAsBlD,EAAOC,GAW3B,IATA,IAAIkD,EAAenD,EAAMpvB,OACrBwyB,EAAenD,EAAMrvB,OACrByyB,EAAQpxB,KAAK4wB,MAAMM,EAAeC,GAAgB,GAClDE,EAAWD,EACXE,EAAW,EAAIF,EACfG,EAAK,IAAI/qB,MAAM8qB,GACfE,EAAK,IAAIhrB,MAAM8qB,GAGVG,EAAI,EAAGA,EAAIH,EAAUG,IAC5BF,EAAGE,IAAM,EACTD,EAAGC,IAAM,EAEXF,EAAGF,EAAW,GAAK,EACnBG,EAAGH,EAAW,GAAK,EAWnB,IAVA,IAAI/yB,EAAQ4yB,EAAeC,EAGvBO,EAAQpzB,EAAQ,GAAM,EAGtBqzB,EAAU,EACVC,EAAQ,EACRC,EAAU,EACVC,EAAQ,EACHC,EAAI,EAAGA,EAAIX,EAAOW,IAAK,CAE9B,IAAK,IAAIC,GAAMD,EAAIJ,EAASK,GAAMD,EAAIH,EAAOI,GAAM,EAAG,CASpD,IARA,IAAIC,EAAYZ,EAAWW,EAOvBE,GAJFC,EADEH,KAAQD,GAAMC,IAAOD,GAAKR,EAAGU,EAAY,GAAKV,EAAGU,EAAY,GAC1DV,EAAGU,EAAY,GAEfV,EAAGU,EAAY,GAAK,GAEbD,EAEZG,EAAKjB,GACLgB,EAAKf,GACLpD,EAAMqE,OAAOD,KAAQnE,EAAMoE,OAAOF,IAElCC,IACAD,IAGF,GADAX,EAAGU,GAAaE,EACZA,EAAKjB,EAEPU,GAAS,OACJ,GAAIM,EAAKf,EAEdQ,GAAW,OACN,GAAID,IACLW,EAAYhB,EAAW/yB,EAAQ0zB,IAClB,GAAKK,EAAYf,IAA+B,IAAnBE,EAAGa,IAG3CF,IADAG,EAAKpB,EAAeM,EAAGa,IAGzB,OAAOE,EAAkBxE,EAAOC,EAAOmE,EAAID,EAInD,CAGA,IAAK,IAAIM,GAAMT,EAAIF,EAASW,GAAMT,EAAID,EAAOU,GAAM,EAAG,CASpD,IARA,IACIF,EADAD,EAAYhB,EAAWmB,EAOvBC,GAJFH,EADEE,KAAQT,GAAMS,IAAOT,GAAKP,EAAGa,EAAY,GAAKb,EAAGa,EAAY,GAC1Db,EAAGa,EAAY,GAEfb,EAAGa,EAAY,GAAK,GAEbG,EAEZF,EAAKpB,GACLuB,EAAKtB,GACLpD,EAAMqE,OAAOlB,EAAeoB,EAAK,KAC/BtE,EAAMoE,OAAOjB,EAAesB,EAAK,IAEnCH,IACAG,IAGF,GADAjB,EAAGa,GAAaC,EACZA,EAAKpB,EAEPY,GAAS,OACJ,GAAIW,EAAKtB,EAEdU,GAAW,OACN,IAAKH,EAAO,CAGf,IAAIS,EADN,IADIF,EAAYZ,EAAW/yB,EAAQk0B,IAClB,GAAKP,EAAYX,IAA+B,IAAnBC,EAAGU,GAK/C,GAHIC,EAAKb,GADLc,EAAKZ,EAAGU,IACaA,EAGrBE,IADJG,EAAKpB,EAAeoB,GAGlB,OAAOC,EAAkBxE,EAAOC,EAAOmE,EAAID,EAGjD,CACF,CACF,CAGA,MAAO,CACL,CAACvE,EAAaI,GACd,CAACH,EAAaI,GAElB,CA7HS0E,CAAa3E,EAAOC,EAC7B,CA/Ec2E,CAJZ5E,EAAQA,EAAMyB,UAAU,EAAGzB,EAAMpvB,OAAS0wB,GAC1CrB,EAAQA,EAAMwB,UAAU,EAAGxB,EAAMrvB,OAAS0wB,IAgB1C,OAVIE,GACFI,EAAMiD,QAAQ,CAAC/E,EAAY0B,IAEzBG,GACFC,EAAMllB,KAAK,CAACojB,EAAY6B,IAE1BmD,EAAkBlD,EAAOxB,GACrBD,GAscN,SAA8ByB,GAc5B,IAbA,IAAImD,GAAU,EACVC,EAAa,GACbC,EAAmB,EAEnBC,EAAe,KAEfC,EAAU,EAEVC,EAAqB,EACrBC,EAAoB,EAEpBC,EAAqB,EACrBC,EAAoB,EACjBJ,EAAUvD,EAAMhxB,QACjBgxB,EAAMuD,GAAS,IAAMrF,GAEvBkF,EAAWC,KAAsBE,EACjCC,EAAqBE,EACrBD,EAAoBE,EACpBD,EAAqB,EACrBC,EAAoB,EACpBL,EAAetD,EAAMuD,GAAS,KAG1BvD,EAAMuD,GAAS,IAAMtF,EACvByF,GAAsB1D,EAAMuD,GAAS,GAAGv0B,OAExC20B,GAAqB3D,EAAMuD,GAAS,GAAGv0B,OAKvCs0B,GACAA,EAAat0B,QACXqB,KAAKoP,IAAI+jB,EAAoBC,IAC/BH,EAAat0B,QAAUqB,KAAKoP,IAAIikB,EAAoBC,KAGpD3D,EAAM4D,OAAOR,EAAWC,EAAmB,GAAI,EAAG,CAChDrF,EACAsF,IAGFtD,EAAMoD,EAAWC,EAAmB,GAAK,GAAG,GAAKpF,EAEjDoF,IAGAE,IADAF,EAC6B,EAAID,EAAWC,EAAmB,IAAM,EACrEG,EAAqB,EACrBC,EAAoB,EACpBC,EAAqB,EACrBC,EAAoB,EACpBL,EAAe,KACfH,GAAU,IAGdI,IAgBF,IAZIJ,GACFD,EAAkBlD,GA4EtB,SAAsCA,GAWpC,SAAS6D,EAA2BC,EAAKC,GACvC,IAAKD,IAAQC,EAEX,OAAO,EAQT,IAAIC,EAAQF,EAAIrB,OAAOqB,EAAI90B,OAAS,GAChCi1B,EAAQF,EAAItB,OAAO,GACnByB,EAAmBF,EAAM9iB,MAAMijB,GAC/BC,EAAmBH,EAAM/iB,MAAMijB,GAC/BE,EAAcH,GAAoBF,EAAM9iB,MAAMojB,GAC9CC,EAAcH,GAAoBH,EAAM/iB,MAAMojB,GAC9CE,EAAaH,GAAeL,EAAM9iB,MAAMujB,GACxCC,EAAaH,GAAeN,EAAM/iB,MAAMujB,GACxCE,EAAaH,GAAcV,EAAI5iB,MAAM0jB,GACrCC,EAAaH,GAAcX,EAAI7iB,MAAM4jB,GAEzC,OAAIH,GAAcE,EAET,EACEL,GAAcE,EAEhB,EACER,IAAqBG,GAAeE,EAEtC,EACEF,GAAeE,EAEjB,EACEL,GAAoBE,EAEtB,EAEF,CACT,CAIA,IAFA,IAAIb,EAAU,EAEPA,EAAUvD,EAAMhxB,OAAS,GAAG,CACjC,GACEgxB,EAAMuD,EAAU,GAAG,IAAMrF,GACzB8B,EAAMuD,EAAU,GAAG,IAAMrF,EACzB,CAEA,IAAI6G,EAAY/E,EAAMuD,EAAU,GAAG,GAC/ByB,EAAOhF,EAAMuD,GAAS,GACtB0B,EAAYjF,EAAMuD,EAAU,GAAG,GAG/B2B,EAAepF,EAAkBiF,EAAWC,GAChD,GAAIE,EAAc,CAChB,IAAIC,EAAeH,EAAKnF,UAAUmF,EAAKh2B,OAASk2B,GAChDH,EAAYA,EAAUlF,UAAU,EAAGkF,EAAU/1B,OAASk2B,GACtDF,EAAOG,EAAeH,EAAKnF,UAAU,EAAGmF,EAAKh2B,OAASk2B,GACtDD,EAAYE,EAAeF,CAC7B,CASA,IANA,IAAIG,EAAgBL,EAChBM,EAAWL,EACXM,EAAgBL,EAChBM,EACF1B,EAA2BkB,EAAWC,GACtCnB,EAA2BmB,EAAMC,GAC5BD,EAAKvC,OAAO,KAAOwC,EAAUxC,OAAO,IAAI,CAC7CsC,GAAaC,EAAKvC,OAAO,GACzBuC,EAAOA,EAAKnF,UAAU,GAAKoF,EAAUxC,OAAO,GAC5CwC,EAAYA,EAAUpF,UAAU,GAChC,IAAI2F,EACF3B,EAA2BkB,EAAWC,GACtCnB,EAA2BmB,EAAMC,GAE/BO,GAASD,IACXA,EAAYC,EACZJ,EAAgBL,EAChBM,EAAWL,EACXM,EAAgBL,EAEpB,CAEIjF,EAAMuD,EAAU,GAAG,IAAM6B,IAEvBA,EACFpF,EAAMuD,EAAU,GAAG,GAAK6B,GAExBpF,EAAM4D,OAAOL,EAAU,EAAG,GAC1BA,KAEFvD,EAAMuD,GAAS,GAAK8B,EAChBC,EACFtF,EAAMuD,EAAU,GAAG,GAAK+B,GAExBtF,EAAM4D,OAAOL,EAAU,EAAG,GAC1BA,KAGN,CACAA,GACF,CACF,CA7LEkC,CAA6BzF,GAQ7BuD,EAAU,EACHA,EAAUvD,EAAMhxB,QAAQ,CAC7B,GACEgxB,EAAMuD,EAAU,GAAG,IAAMvF,GACzBgC,EAAMuD,GAAS,IAAMtF,EACrB,CACA,IAAIyH,EAAW1F,EAAMuD,EAAU,GAAG,GAC9BoC,EAAY3F,EAAMuD,GAAS,GAC3BqC,EAAkBC,EAAoBH,EAAUC,GAChDG,EAAkBD,EAAoBF,EAAWD,GACjDE,GAAmBE,GAEnBF,GAAmBF,EAAS12B,OAAS,GACrC42B,GAAmBD,EAAU32B,OAAS,KAGtCgxB,EAAM4D,OAAOL,EAAS,EAAG,CACvBrF,EACAyH,EAAU9F,UAAU,EAAG+F,KAEzB5F,EAAMuD,EAAU,GAAG,GAAKmC,EAAS7F,UAC/B,EACA6F,EAAS12B,OAAS42B,GAEpB5F,EAAMuD,EAAU,GAAG,GAAKoC,EAAU9F,UAAU+F,GAC5CrC,MAIAuC,GAAmBJ,EAAS12B,OAAS,GACrC82B,GAAmBH,EAAU32B,OAAS,KAItCgxB,EAAM4D,OAAOL,EAAS,EAAG,CACvBrF,EACAwH,EAAS7F,UAAU,EAAGiG,KAExB9F,EAAMuD,EAAU,GAAG,GAAKtF,EACxB+B,EAAMuD,EAAU,GAAG,GAAKoC,EAAU9F,UAChC,EACA8F,EAAU32B,OAAS82B,GAErB9F,EAAMuD,EAAU,GAAG,GAAKvF,EACxBgC,EAAMuD,EAAU,GAAG,GAAKmC,EAAS7F,UAAUiG,GAC3CvC,KAGJA,GACF,CACAA,GACF,CACF,CAlkBIwC,CAAqB/F,GAEhBA,CACT,CAwMA,SAAS4C,EAAkBxE,EAAOC,EAAOyD,EAAGkE,GAC1C,IAAIC,EAAS7H,EAAMyB,UAAU,EAAGiC,GAC5BoE,EAAS7H,EAAMwB,UAAU,EAAGmG,GAC5BG,EAAS/H,EAAMyB,UAAUiC,GACzBsE,EAAS/H,EAAMwB,UAAUmG,GAGzBhG,EAAQ7B,EAAU8H,EAAQC,GAC1BG,EAASlI,EAAUgI,EAAQC,GAE/B,OAAOpG,EAAMziB,OAAO8oB,EACtB,CASA,SAAS1G,EAAkBvB,EAAOC,GAEhC,IAAKD,IAAUC,GAASD,EAAMqE,OAAO,KAAOpE,EAAMoE,OAAO,GACvD,OAAO,EAQT,IAJA,IAAI6D,EAAa,EACbC,EAAal2B,KAAKC,IAAI8tB,EAAMpvB,OAAQqvB,EAAMrvB,QAC1Cw3B,EAAaD,EACbE,EAAe,EACZH,EAAaE,GAEhBpI,EAAMyB,UAAU4G,EAAcD,IAC9BnI,EAAMwB,UAAU4G,EAAcD,GAG9BC,EADAH,EAAaE,EAGbD,EAAaC,EAEfA,EAAan2B,KAAKqwB,OAAO6F,EAAaD,GAAc,EAAIA,GAO1D,OAJII,EAAwBtI,EAAMuI,WAAWH,EAAa,KACxDA,IAGKA,CACT,CAUA,SAASX,EAAoBzH,EAAOC,GAElC,IAAIkD,EAAenD,EAAMpvB,OACrBwyB,EAAenD,EAAMrvB,OAEzB,GAAoB,GAAhBuyB,GAAqC,GAAhBC,EACvB,OAAO,EAGLD,EAAeC,EACjBpD,EAAQA,EAAMyB,UAAU0B,EAAeC,GAC9BD,EAAeC,IACxBnD,EAAQA,EAAMwB,UAAU,EAAG0B,IAE7B,IAAIqF,EAAcv2B,KAAKC,IAAIixB,EAAcC,GAEzC,GAAIpD,GAASC,EACX,OAAOuI,EAQT,IAFA,IAAIC,EAAO,EACP73B,EAAS,IACA,CACX,IAAI83B,EAAU1I,EAAMyB,UAAU+G,EAAc53B,GACxC+3B,EAAQ1I,EAAM3mB,QAAQovB,GAC1B,IAAc,GAAVC,EACF,OAAOF,EAET73B,GAAU+3B,EAEC,GAATA,GACA3I,EAAMyB,UAAU+G,EAAc53B,IAAWqvB,EAAMwB,UAAU,EAAG7wB,KAE5D63B,EAAO73B,EACPA,IAEJ,CACF,CAQA,SAAS8wB,EAAkB1B,EAAOC,GAEhC,IAAKD,IAAUC,GAASD,EAAM7hB,OAAO,KAAO8hB,EAAM9hB,OAAO,GACvD,OAAO,EAQT,IAJA,IAAI+pB,EAAa,EACbC,EAAal2B,KAAKC,IAAI8tB,EAAMpvB,OAAQqvB,EAAMrvB,QAC1Cw3B,EAAaD,EACbS,EAAa,EACVV,EAAaE,GAEhBpI,EAAMyB,UAAUzB,EAAMpvB,OAASw3B,EAAYpI,EAAMpvB,OAASg4B,IAC1D3I,EAAMwB,UAAUxB,EAAMrvB,OAASw3B,EAAYnI,EAAMrvB,OAASg4B,GAG1DA,EADAV,EAAaE,EAGbD,EAAaC,EAEfA,EAAan2B,KAAKqwB,OAAO6F,EAAaD,GAAc,EAAIA,GAO1D,OAJIW,EAAsB7I,EAAMuI,WAAWvI,EAAMpvB,OAASw3B,KACxDA,IAGKA,CACT,CAiPA,IAAIrC,EAAwB,eACxBG,EAAmB,KACnBG,EAAkB,SAClBG,EAAqB,WACrBE,EAAuB,cAmI3B,SAAS5B,EAAkBlD,EAAOkH,GAChClH,EAAMllB,KAAK,CAACojB,EAAY,KAOxB,IANA,IAKIwB,EALA6D,EAAU,EACV4D,EAAe,EACfC,EAAe,EACfC,EAAc,GACdC,EAAc,GAEX/D,EAAUvD,EAAMhxB,QACrB,GAAIu0B,EAAUvD,EAAMhxB,OAAS,IAAMgxB,EAAMuD,GAAS,GAChDvD,EAAM4D,OAAOL,EAAS,QAGxB,OAAQvD,EAAMuD,GAAS,IACrB,KAAKtF,EACHmJ,IACAE,GAAetH,EAAMuD,GAAS,GAC9BA,IACA,MACF,KAAKvF,EACHmJ,IACAE,GAAerH,EAAMuD,GAAS,GAC9BA,IACA,MACF,KAAKrF,EACH,IAAIqJ,EAAoBhE,EAAU6D,EAAeD,EAAe,EAChE,GAAID,EAAa,CAWf,GACEK,GAAqB,GACrBC,EAAqBxH,EAAMuH,GAAmB,IAC9C,CACA,IAAIE,EAAQzH,EAAMuH,GAAmB,GAAGhrB,OAAO,GAO/C,GANAyjB,EAAMuH,GAAmB,GAAKvH,EAAMuH,GAAmB,GAAGhrB,MACxD,GACC,GAEH8qB,EAAcI,EAAQJ,EACtBC,EAAcG,EAAQH,GACjBtH,EAAMuH,GAAmB,GAAI,CAEhCvH,EAAM4D,OAAO2D,EAAmB,GAChChE,IACA,IAAImE,EAAIH,EAAoB,EACxBvH,EAAM0H,IAAM1H,EAAM0H,GAAG,KAAOzJ,IAC9BmJ,IACAE,EAActH,EAAM0H,GAAG,GAAKJ,EAC5BI,KAEE1H,EAAM0H,IAAM1H,EAAM0H,GAAG,KAAO1J,IAC9BmJ,IACAE,EAAcrH,EAAM0H,GAAG,GAAKL,EAC5BK,KAEFH,EAAoBG,CACtB,CACF,CACIC,EAAqB3H,EAAMuD,GAAS,MAClCkE,EAAQzH,EAAMuD,GAAS,GAAGd,OAAO,GACrCzC,EAAMuD,GAAS,GAAKvD,EAAMuD,GAAS,GAAGhnB,MAAM,GAC5C8qB,GAAeI,EACfH,GAAeG,EAEnB,CACA,GAAIlE,EAAUvD,EAAMhxB,OAAS,IAAMgxB,EAAMuD,GAAS,GAAI,CAEpDvD,EAAM4D,OAAOL,EAAS,GACtB,KACF,CACA,GAAI8D,EAAYr4B,OAAS,GAAKs4B,EAAYt4B,OAAS,EAAG,CAEhDq4B,EAAYr4B,OAAS,GAAKs4B,EAAYt4B,OAAS,IAG5B,KADrB0wB,EAAeC,EAAkB2H,EAAaD,MAExCE,GAAqB,EACvBvH,EAAMuH,GAAmB,IAAMD,EAAYzH,UACzC,EACAH,IAGFM,EAAM4D,OAAO,EAAG,EAAG,CACjB1F,EACAoJ,EAAYzH,UAAU,EAAGH,KAE3B6D,KAEF+D,EAAcA,EAAYzH,UAAUH,GACpC2H,EAAcA,EAAYxH,UAAUH,IAIjB,KADrBA,EAAeI,EAAkBwH,EAAaD,MAE5CrH,EAAMuD,GAAS,GACb+D,EAAYzH,UAAUyH,EAAYt4B,OAAS0wB,GAC3CM,EAAMuD,GAAS,GACjB+D,EAAcA,EAAYzH,UACxB,EACAyH,EAAYt4B,OAAS0wB,GAEvB2H,EAAcA,EAAYxH,UACxB,EACAwH,EAAYr4B,OAAS0wB,KAK3B,IAAIkI,EAAIR,EAAeD,EACI,IAAvBE,EAAYr4B,QAAuC,IAAvBs4B,EAAYt4B,QAC1CgxB,EAAM4D,OAAOL,EAAUqE,EAAGA,GAC1BrE,GAAoBqE,GACY,IAAvBP,EAAYr4B,QACrBgxB,EAAM4D,OAAOL,EAAUqE,EAAGA,EAAG,CAAC3J,EAAaqJ,IAC3C/D,EAAUA,EAAUqE,EAAI,GACQ,IAAvBN,EAAYt4B,QACrBgxB,EAAM4D,OAAOL,EAAUqE,EAAGA,EAAG,CAAC5J,EAAaqJ,IAC3C9D,EAAUA,EAAUqE,EAAI,IAExB5H,EAAM4D,OACJL,EAAUqE,EACVA,EACA,CAAC5J,EAAaqJ,GACd,CAACpJ,EAAaqJ,IAEhB/D,EAAUA,EAAUqE,EAAI,EAE5B,CACgB,IAAZrE,GAAiBvD,EAAMuD,EAAU,GAAG,KAAOrF,GAE7C8B,EAAMuD,EAAU,GAAG,IAAMvD,EAAMuD,GAAS,GACxCvD,EAAM4D,OAAOL,EAAS,IAEtBA,IAEF6D,EAAe,EACfD,EAAe,EACfE,EAAc,GACdC,EAAc,GAIe,KAA/BtH,EAAMA,EAAMhxB,OAAS,GAAG,IAC1BgxB,EAAM9sB,MAMR,IAAIiwB,GAAU,EAGd,IAFAI,EAAU,EAEHA,EAAUvD,EAAMhxB,OAAS,GAE5BgxB,EAAMuD,EAAU,GAAG,KAAOrF,GAC1B8B,EAAMuD,EAAU,GAAG,KAAOrF,IAIxB8B,EAAMuD,GAAS,GAAG1D,UAChBG,EAAMuD,GAAS,GAAGv0B,OAASgxB,EAAMuD,EAAU,GAAG,GAAGv0B,UAC7CgxB,EAAMuD,EAAU,GAAG,IAGzBvD,EAAMuD,GAAS,GACbvD,EAAMuD,EAAU,GAAG,GACnBvD,EAAMuD,GAAS,GAAG1D,UAChB,EACAG,EAAMuD,GAAS,GAAGv0B,OAASgxB,EAAMuD,EAAU,GAAG,GAAGv0B,QAErDgxB,EAAMuD,EAAU,GAAG,GAAKvD,EAAMuD,EAAU,GAAG,GAAKvD,EAAMuD,EAAU,GAAG,GACnEvD,EAAM4D,OAAOL,EAAU,EAAG,GAC1BJ,GAAU,GAEVnD,EAAMuD,GAAS,GAAG1D,UAAU,EAAGG,EAAMuD,EAAU,GAAG,GAAGv0B,SACrDgxB,EAAMuD,EAAU,GAAG,KAGnBvD,EAAMuD,EAAU,GAAG,IAAMvD,EAAMuD,EAAU,GAAG,GAC5CvD,EAAMuD,GAAS,GACbvD,EAAMuD,GAAS,GAAG1D,UAAUG,EAAMuD,EAAU,GAAG,GAAGv0B,QAClDgxB,EAAMuD,EAAU,GAAG,GACrBvD,EAAM4D,OAAOL,EAAU,EAAG,GAC1BJ,GAAU,IAGdI,IAGEJ,GACFD,EAAkBlD,EAAOkH,EAE7B,CAEA,SAASR,EAAwBmB,GAC/B,OAAOA,GAAY,OAAUA,GAAY,KAC3C,CAEA,SAASZ,EAAsBY,GAC7B,OAAOA,GAAY,OAAUA,GAAY,KAC3C,CAEA,SAASF,EAAqBG,GAC5B,OAAOb,EAAsBa,EAAInB,WAAW,GAC9C,CAEA,SAASa,EAAqBM,GAC5B,OAAOpB,EAAwBoB,EAAInB,WAAWmB,EAAI94B,OAAS,GAC7D,CAYA,SAASswB,EAAiByI,EAAQC,EAAWC,EAAWpa,GACtD,OAAI2Z,EAAqBO,IAAWJ,EAAqB9Z,GAChD,KAZX,SAA6Bqa,GAE3B,IADA,IAAIC,EAAM,GACDxQ,EAAI,EAAGA,EAAIuQ,EAAOl5B,OAAQ2oB,IAC7BuQ,EAAOvQ,GAAG,GAAG3oB,OAAS,GACxBm5B,EAAIrtB,KAAKotB,EAAOvQ,IAGpB,OAAOwQ,CACT,CAMSC,CAAoB,CACzB,CAAClK,EAAY6J,GACb,CAAC/J,EAAagK,GACd,CAAC/J,EAAagK,GACd,CAAC/J,EAAYrQ,IAEjB,CA2FA,SAAShP,EAAKuf,EAAOC,EAAOC,EAAYC,GAGtC,OAAOJ,EAAUC,EAAOC,EAAOC,EAAYC,GAAS,EACtD,CAEA1f,EAAKwpB,OAASpK,EACdpf,EAAKypB,OAAStK,EACdnf,EAAK0pB,MAAQrK,EAEb9vB,EAAOD,QAAU0Q,mCCvmCjB,IAGI2pB,EAAiB,4BAGjBC,EAAmB,iBAGnBC,EAAU,qBAEVC,EAAU,mBACVC,EAAU,gBAEVC,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAa,mBACbC,EAAY,kBACZC,EAAS,eACTC,EAAY,kBACZC,EAAY,kBACZC,EAAa,mBAEbC,EAAiB,uBACjBC,EAAc,oBACdC,EAAa,wBACbC,EAAa,wBACbC,EAAU,qBACVC,EAAW,sBACXC,EAAW,sBACXC,EAAW,sBACXC,EAAkB,6BAClBC,EAAY,uBACZC,EAAY,uBASZC,EAAU,OAGVC,EAAe,8BAGfC,EAAW,mBAGXC,EAAgB,CAAC,EACrBA,EAAc5B,GAAW4B,EA7CV,kBA8CfA,EAAcd,GAAkBc,EAAcb,GAC9Ca,EAAc3B,GAAW2B,EAAc1B,GACvC0B,EAAcZ,GAAcY,EAAcX,GAC1CW,EAAcV,GAAWU,EAAcT,GACvCS,EAAcR,GAAYQ,EAAcvB,GACxCuB,EAActB,GAAasB,EAAcrB,GACzCqB,EAAcnB,GAAamB,EAAclB,GACzCkB,EAAcjB,GAAaiB,EAAchB,GACzCgB,EAAcP,GAAYO,EAAcN,GACxCM,EAAcL,GAAaK,EAAcJ,IAAa,EACtDI,EArDe,kBAqDWA,EAAczB,GACxCyB,EAAcf,IAAc,EAG5B,IAAIgB,EAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAOttB,SAAWA,QAAU,EAAAstB,EAGhFC,EAA0B,iBAARl8B,MAAoBA,MAAQA,KAAK2O,SAAWA,QAAU3O,KAGxEN,EAAOs8B,GAAcE,GAAYC,SAAS,cAATA,GAGjCC,EAA4Cx8B,IAAYA,EAAQ2pB,UAAY3pB,EAG5Ey8B,EAAaD,GAA4Cv8B,IAAWA,EAAO0pB,UAAY1pB,EAGvFy8B,EAAgBD,GAAcA,EAAWz8B,UAAYw8B,EAUzD,SAASG,EAAY13B,EAAKmkB,GAGxB,OADAnkB,EAAIoU,IAAI+P,EAAK,GAAIA,EAAK,IACfnkB,CACT,CAUA,SAAS23B,EAAYvjB,EAAKjY,GAGxB,OADAiY,EAAID,IAAIhY,GACDiY,CACT,CAsDA,SAASwjB,EAAYC,EAAOC,EAAUC,EAAaC,GACjD,IAAIx7B,GAAS,EACTZ,EAASi8B,EAAQA,EAAMj8B,OAAS,EAKpC,IAHIo8B,GAAap8B,IACfm8B,EAAcF,IAAQr7B,MAEfA,EAAQZ,GACfm8B,EAAcD,EAASC,EAAaF,EAAMr7B,GAAQA,EAAOq7B,GAE3D,OAAOE,CACT,CAwCA,SAASE,EAAa97B,GAGpB,IAAI+7B,GAAS,EACb,GAAa,MAAT/7B,GAA0C,mBAAlBA,EAAM+gB,SAChC,IACEgb,KAAY/7B,EAAQ,GACtB,CAAE,MAAO8f,GAAI,CAEf,OAAOic,CACT,CASA,SAASC,EAAWn4B,GAClB,IAAIxD,GAAS,EACT07B,EAASz0B,MAAMzD,EAAIo4B,MAKvB,OAHAp4B,EAAIE,SAAQ,SAAS/D,EAAOuP,GAC1BwsB,IAAS17B,GAAS,CAACkP,EAAKvP,EAC1B,IACO+7B,CACT,CAUA,SAASG,EAAQC,EAAMC,GACrB,OAAO,SAASC,GACd,OAAOF,EAAKC,EAAUC,GACxB,CACF,CASA,SAASC,EAAWrkB,GAClB,IAAI5X,GAAS,EACT07B,EAASz0B,MAAM2Q,EAAIgkB,MAKvB,OAHAhkB,EAAIlU,SAAQ,SAAS/D,GACnB+7B,IAAS17B,GAASL,CACpB,IACO+7B,CACT,CAGA,IASMQ,EATFC,EAAal1B,MAAMgd,UACnBmY,EAAYtB,SAAS7W,UACrBoY,EAAc/uB,OAAO2W,UAGrBqY,EAAaj+B,EAAK,sBAGlBk+B,GACEL,EAAM,SAASM,KAAKF,GAAcA,EAAW/uB,MAAQ+uB,EAAW/uB,KAAKkvB,UAAY,KACvE,iBAAmBP,EAAO,GAItCQ,EAAeN,EAAU1b,SAGzB4L,GAAiB+P,EAAY/P,eAO7BqQ,GAAiBN,EAAY3b,SAG7Bkc,GAAaza,OAAO,IACtBua,EAAahyB,KAAK4hB,IAAgBnkB,QAzQjB,sBAyQuC,QACvDA,QAAQ,yDAA0D,SAAW,KAI5E00B,GAAS5B,EAAgB58B,EAAKw+B,YAASx9B,EACvCy9B,GAASz+B,EAAKy+B,OACdC,GAAa1+B,EAAK0+B,WAClBC,GAAenB,EAAQvuB,OAAO2vB,eAAgB3vB,QAC9C4vB,GAAe5vB,OAAO7J,OACtB05B,GAAuBd,EAAYc,qBACnCnJ,GAASmI,EAAWnI,OAGpBoJ,GAAmB9vB,OAAO6f,sBAC1BkQ,GAAiBR,GAASA,GAAOS,cAAWj+B,EAC5Ck+B,GAAa1B,EAAQvuB,OAAOC,KAAMD,QAGlCkwB,GAAWC,GAAUp/B,EAAM,YAC3Bq/B,GAAMD,GAAUp/B,EAAM,OACtBs/B,GAAUF,GAAUp/B,EAAM,WAC1Bu/B,GAAMH,GAAUp/B,EAAM,OACtB8M,GAAUsyB,GAAUp/B,EAAM,WAC1Bw/B,GAAeJ,GAAUnwB,OAAQ,UAGjCwwB,GAAqBC,GAASP,IAC9BQ,GAAgBD,GAASL,IACzBO,GAAoBF,GAASJ,IAC7BO,GAAgBH,GAASH,IACzBO,GAAoBJ,GAAS5yB,IAG7BizB,GAActB,GAASA,GAAO7Y,eAAY5kB,EAC1Cg/B,GAAgBD,GAAcA,GAAYE,aAAUj/B,EASxD,SAASk/B,GAAKnnB,GACZ,IAAIpX,GAAS,EACTZ,EAASgY,EAAUA,EAAQhY,OAAS,EAGxC,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAyFA,SAASC,GAAUrnB,GACjB,IAAIpX,GAAS,EACTZ,EAASgY,EAAUA,EAAQhY,OAAS,EAGxC,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAuGA,SAASE,GAAStnB,GAChB,IAAIpX,GAAS,EACTZ,EAASgY,EAAUA,EAAQhY,OAAS,EAGxC,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAqFA,SAASG,GAAMvnB,GACbpY,KAAK4/B,SAAW,IAAIH,GAAUrnB,EAChC,CAwHA,SAASynB,GAAYC,EAAQ5vB,EAAKvP,GAChC,IAAIo/B,EAAWD,EAAO5vB,GAChBod,GAAe5hB,KAAKo0B,EAAQ5vB,IAAQ8vB,GAAGD,EAAUp/B,UACxCN,IAAVM,GAAyBuP,KAAO4vB,KACnCA,EAAO5vB,GAAOvP,EAElB,CAUA,SAASs/B,GAAa5D,EAAOnsB,GAE3B,IADA,IAAI9P,EAASi8B,EAAMj8B,OACZA,KACL,GAAI4/B,GAAG3D,EAAMj8B,GAAQ,GAAI8P,GACvB,OAAO9P,EAGX,OAAQ,CACV,CA6BA,SAAS8/B,GAAUv/B,EAAOw/B,EAAQC,EAAQC,EAAYnwB,EAAK4vB,EAAQQ,GACjE,IAAI5D,EAIJ,GAHI2D,IACF3D,EAASoD,EAASO,EAAW1/B,EAAOuP,EAAK4vB,EAAQQ,GAASD,EAAW1/B,SAExDN,IAAXq8B,EACF,OAAOA,EAET,IAAK6D,GAAS5/B,GACZ,OAAOA,EAET,IAAI6/B,EAAQ9xB,GAAQ/N,GACpB,GAAI6/B,GAEF,GADA9D,EA2XJ,SAAwBL,GACtB,IAAIj8B,EAASi8B,EAAMj8B,OACfs8B,EAASL,EAAMl3B,YAAY/E,GAO/B,OAJIA,GAA6B,iBAAZi8B,EAAM,IAAkB/O,GAAe5hB,KAAK2wB,EAAO,WACtEK,EAAO17B,MAAQq7B,EAAMr7B,MACrB07B,EAAO+D,MAAQpE,EAAMoE,OAEhB/D,CACT,CArYagE,CAAe//B,IACnBw/B,EACH,OA6ON,SAAmB3mB,EAAQ6iB,GACzB,IAAIr7B,GAAS,EACTZ,EAASoZ,EAAOpZ,OAGpB,IADAi8B,IAAUA,EAAQp0B,MAAM7H,MACfY,EAAQZ,GACfi8B,EAAMr7B,GAASwY,EAAOxY,GAExB,OAAOq7B,CACT,CAtPasE,CAAUhgC,EAAO+7B,OAErB,CACL,IAAIpvB,EAAMszB,GAAOjgC,GACbkgC,EAASvzB,GAAO2sB,GAAW3sB,GAAO4sB,EAEtC,GAAIoE,GAAS39B,GACX,OA0HN,SAAqBmgC,EAAQX,GAC3B,GAAIA,EACF,OAAOW,EAAOnzB,QAEhB,IAAI+uB,EAAS,IAAIoE,EAAO37B,YAAY27B,EAAO1gC,QAE3C,OADA0gC,EAAOC,KAAKrE,GACLA,CACT,CAjIasE,CAAYrgC,EAAOw/B,GAE5B,GAAI7yB,GAAO+sB,GAAa/sB,GAAOwsB,GAAY+G,IAAWf,EAAS,CAC7D,GAAIrD,EAAa97B,GACf,OAAOm/B,EAASn/B,EAAQ,CAAC,EAG3B,GADA+7B,EA+XN,SAAyBoD,GACvB,MAAqC,mBAAtBA,EAAO36B,aAA8B87B,GAAYnB,GAE5D,CAAC,EAxVES,GADWW,EAwVHlD,GAAa8B,IAvVH5B,GAAagD,GAAS,CAAC,EADlD,IAAoBA,CA0VpB,CAnYeC,CAAgBN,EAAS,CAAC,EAAIlgC,IAClCw/B,EACH,OA6QR,SAAqB3mB,EAAQsmB,GAC3B,OAAOsB,GAAW5nB,EAAQ6nB,GAAW7nB,GAASsmB,EAChD,CA/QewB,CAAY3gC,EAhD3B,SAAoBm/B,EAAQtmB,GAC1B,OAAOsmB,GAAUsB,GAAW5nB,EAAQjL,GAAKiL,GAASsmB,EACpD,CA8CkCyB,CAAW7E,EAAQ/7B,GAEjD,KAAO,CACL,IAAK+6B,EAAcpuB,GACjB,OAAOwyB,EAASn/B,EAAQ,CAAC,EAE3B+7B,EA0YN,SAAwBoD,EAAQxyB,EAAKk0B,EAAWrB,GAC9C,IA5MmBsB,EA4MfC,EAAO5B,EAAO36B,YAClB,OAAQmI,GACN,KAAKstB,EACH,OAAO+G,GAAiB7B,GAE1B,KAAK/F,EACL,KAAKC,EACH,OAAO,IAAI0H,GAAM5B,GAEnB,KAAKjF,EACH,OA3QN,SAAuB+G,EAAUzB,GAC/B,IAAIW,EAASX,EAASwB,GAAiBC,EAASd,QAAUc,EAASd,OACnE,OAAO,IAAIc,EAASz8B,YAAY27B,EAAQc,EAASC,WAAYD,EAASE,WACxE,CAwQaC,CAAcjC,EAAQK,GAE/B,KAAKrF,EAAY,KAAKC,EACtB,KAAKC,EAAS,KAAKC,EAAU,KAAKC,EAClC,KAAKC,EAAU,KAAKC,EAAiB,KAAKC,EAAW,KAAKC,EACxD,OA/MN,SAAyB0G,EAAY7B,GACnC,IAAIW,EAASX,EAASwB,GAAiBK,EAAWlB,QAAUkB,EAAWlB,OACvE,OAAO,IAAIkB,EAAW78B,YAAY27B,EAAQkB,EAAWH,WAAYG,EAAW5hC,OAC9E,CA4Ma6hC,CAAgBnC,EAAQK,GAEjC,KAAKhG,EACH,OArQN,SAAkB31B,EAAK27B,EAAQqB,GAE7B,OAAOpF,EADK+D,EAASqB,EAAU7E,EAAWn4B,IAAM,GAAQm4B,EAAWn4B,GACzC03B,EAAa,IAAI13B,EAAIW,YACjD,CAkQa+8B,CAASpC,EAAQK,EAAQqB,GAElC,KAAKpH,EACL,KAAKK,EACH,OAAO,IAAIiH,EAAK5B,GAElB,KAAKvF,EACH,OAhQN,SAAqB4H,GACnB,IAAIzF,EAAS,IAAIyF,EAAOh9B,YAAYg9B,EAAO3oB,OAAQ+hB,EAAQiC,KAAK2E,IAEhE,OADAzF,EAAO0F,UAAYD,EAAOC,UACnB1F,CACT,CA4Pa2F,CAAYvC,GAErB,KAAKtF,EACH,OApPN,SAAkB5hB,EAAKunB,EAAQqB,GAE7B,OAAOpF,EADK+D,EAASqB,EAAUvE,EAAWrkB,IAAM,GAAQqkB,EAAWrkB,GACzCujB,EAAa,IAAIvjB,EAAIzT,YACjD,CAiPam9B,CAASxC,EAAQK,EAAQqB,GAElC,KAAK9G,EACH,OA3Oe+G,EA2OI3B,EA1OhBT,GAAgB/wB,OAAO+wB,GAAc3zB,KAAK+1B,IAAW,CAAC,EA4O/D,CA5aec,CAAe5hC,EAAO2M,EAAK4yB,GAAWC,EACjD,CACF,CAEAG,IAAUA,EAAQ,IAAIX,IACtB,IAAI6C,EAAUlC,EAAMv2B,IAAIpJ,GACxB,GAAI6hC,EACF,OAAOA,EAIT,GAFAlC,EAAM1nB,IAAIjY,EAAO+7B,IAEZ8D,EACH,IAAIiC,EAAQrC,EAsQhB,SAAoBN,GAClB,OAnOF,SAAwBA,EAAQ4C,EAAUC,GACxC,IAAIjG,EAASgG,EAAS5C,GACtB,OAAOpxB,GAAQoxB,GAAUpD,EApwB3B,SAAmBL,EAAOl4B,GAKxB,IAJA,IAAInD,GAAS,EACTZ,EAAS+D,EAAO/D,OAChBwF,EAASy2B,EAAMj8B,SAEVY,EAAQZ,GACfi8B,EAAMz2B,EAAS5E,GAASmD,EAAOnD,GAEjC,OAAOq7B,CACT,CA2vBoCuG,CAAUlG,EAAQiG,EAAY7C,GAClE,CAgOS+C,CAAe/C,EAAQvxB,GAAM8yB,GACtC,CAxQyByB,CAAWniC,GAAS4N,GAAK5N,GAUhD,OA5vBF,SAAmB07B,EAAOC,GAIxB,IAHA,IAAIt7B,GAAS,EACTZ,EAASi8B,EAAQA,EAAMj8B,OAAS,IAE3BY,EAAQZ,IAC8B,IAAzCk8B,EAASD,EAAMr7B,GAAQA,KAK/B,CA0uBE+hC,CAAUN,GAAS9hC,GAAO,SAASqiC,EAAU9yB,GACvCuyB,IAEFO,EAAWriC,EADXuP,EAAM8yB,IAIRnD,GAAYnD,EAAQxsB,EAAKgwB,GAAU8C,EAAU7C,EAAQC,EAAQC,EAAYnwB,EAAKvP,EAAO2/B,GACvF,IACO5D,CACT,CAqGA,SAASiF,GAAiBsB,GACxB,IAAIvG,EAAS,IAAIuG,EAAY99B,YAAY89B,EAAYnB,YAErD,OADA,IAAI/D,GAAWrB,GAAQ9jB,IAAI,IAAImlB,GAAWkF,IACnCvG,CACT,CA6GA,SAAS0E,GAAW5nB,EAAQipB,EAAO3C,EAAQO,GACzCP,IAAWA,EAAS,CAAC,GAKrB,IAHA,IAAI9+B,GAAS,EACTZ,EAASqiC,EAAMriC,SAEVY,EAAQZ,GAAQ,CACvB,IAAI8P,EAAMuyB,EAAMzhC,GAEZkiC,EAAW7C,EACXA,EAAWP,EAAO5vB,GAAMsJ,EAAOtJ,GAAMA,EAAK4vB,EAAQtmB,QAClDnZ,EAEJw/B,GAAYC,EAAQ5vB,OAAkB7P,IAAb6iC,EAAyB1pB,EAAOtJ,GAAOgzB,EAClE,CACA,OAAOpD,CACT,CAiCA,SAASqD,GAAW3+B,EAAK0L,GACvB,IAqKiBvP,EACb8G,EAtKA1B,EAAOvB,EAAIo7B,SACf,OAsKgB,WADZn4B,SADa9G,EApKAuP,KAsKmB,UAARzI,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV9G,EACU,OAAVA,GAvKDoF,EAAmB,iBAAPmK,EAAkB,SAAW,QACzCnK,EAAKvB,GACX,CAUA,SAASi6B,GAAUqB,EAAQ5vB,GACzB,IAAIvP,EAj8BN,SAAkBm/B,EAAQ5vB,GACxB,OAAiB,MAAV4vB,OAAiBz/B,EAAYy/B,EAAO5vB,EAC7C,CA+7BckzB,CAAStD,EAAQ5vB,GAC7B,OAvOF,SAAsBvP,GACpB,SAAK4/B,GAAS5/B,KAyYEm8B,EAzYiBn8B,EA0YxB48B,GAAeA,KAAcT,MAvYvBuG,GAAW1iC,IAAU87B,EAAa97B,GAAUi9B,GAAapC,GACzD/R,KAAKsV,GAASp+B,IAqY/B,IAAkBm8B,CApYlB,CAiOSwG,CAAa3iC,GAASA,OAAQN,CACvC,CA9tBAk/B,GAAKta,UAAUnL,MAnEf,WACE9Z,KAAK4/B,SAAWf,GAAeA,GAAa,MAAQ,CAAC,CACvD,EAkEAU,GAAKta,UAAkB,OAtDvB,SAAoB/U,GAClB,OAAOlQ,KAAK4oB,IAAI1Y,WAAelQ,KAAK4/B,SAAS1vB,EAC/C,EAqDAqvB,GAAKta,UAAUlb,IA1Cf,SAAiBmG,GACf,IAAInK,EAAO/F,KAAK4/B,SAChB,GAAIf,GAAc,CAChB,IAAInC,EAAS32B,EAAKmK,GAClB,OAAOwsB,IAAW9C,OAAiBv5B,EAAYq8B,CACjD,CACA,OAAOpP,GAAe5hB,KAAK3F,EAAMmK,GAAOnK,EAAKmK,QAAO7P,CACtD,EAoCAk/B,GAAKta,UAAU2D,IAzBf,SAAiB1Y,GACf,IAAInK,EAAO/F,KAAK4/B,SAChB,OAAOf,QAA6Bx+B,IAAd0F,EAAKmK,GAAqBod,GAAe5hB,KAAK3F,EAAMmK,EAC5E,EAuBAqvB,GAAKta,UAAUrM,IAXf,SAAiB1I,EAAKvP,GAGpB,OAFWX,KAAK4/B,SACX1vB,GAAQ2uB,SAA0Bx+B,IAAVM,EAAuBi5B,EAAiBj5B,EAC9DX,IACT,EAmHAy/B,GAAUxa,UAAUnL,MAjFpB,WACE9Z,KAAK4/B,SAAW,EAClB,EAgFAH,GAAUxa,UAAkB,OArE5B,SAAyB/U,GACvB,IAAInK,EAAO/F,KAAK4/B,SACZ5+B,EAAQi/B,GAAal6B,EAAMmK,GAE/B,QAAIlP,EAAQ,IAIRA,GADY+E,EAAK3F,OAAS,EAE5B2F,EAAKzB,MAEL0wB,GAAOtpB,KAAK3F,EAAM/E,EAAO,GAEpB,GACT,EAwDAy+B,GAAUxa,UAAUlb,IA7CpB,SAAsBmG,GACpB,IAAInK,EAAO/F,KAAK4/B,SACZ5+B,EAAQi/B,GAAal6B,EAAMmK,GAE/B,OAAOlP,EAAQ,OAAIX,EAAY0F,EAAK/E,GAAO,EAC7C,EAyCAy+B,GAAUxa,UAAU2D,IA9BpB,SAAsB1Y,GACpB,OAAO+vB,GAAajgC,KAAK4/B,SAAU1vB,IAAQ,CAC7C,EA6BAuvB,GAAUxa,UAAUrM,IAjBpB,SAAsB1I,EAAKvP,GACzB,IAAIoF,EAAO/F,KAAK4/B,SACZ5+B,EAAQi/B,GAAal6B,EAAMmK,GAO/B,OALIlP,EAAQ,EACV+E,EAAKmG,KAAK,CAACgE,EAAKvP,IAEhBoF,EAAK/E,GAAO,GAAKL,EAEZX,IACT,EAiGA0/B,GAASza,UAAUnL,MA/DnB,WACE9Z,KAAK4/B,SAAW,CACd,KAAQ,IAAIL,GACZ,IAAO,IAAKb,IAAOe,IACnB,OAAU,IAAIF,GAElB,EA0DAG,GAASza,UAAkB,OA/C3B,SAAwB/U,GACtB,OAAOizB,GAAWnjC,KAAMkQ,GAAa,OAAEA,EACzC,EA8CAwvB,GAASza,UAAUlb,IAnCnB,SAAqBmG,GACnB,OAAOizB,GAAWnjC,KAAMkQ,GAAKnG,IAAImG,EACnC,EAkCAwvB,GAASza,UAAU2D,IAvBnB,SAAqB1Y,GACnB,OAAOizB,GAAWnjC,KAAMkQ,GAAK0Y,IAAI1Y,EACnC,EAsBAwvB,GAASza,UAAUrM,IAVnB,SAAqB1I,EAAKvP,GAExB,OADAwiC,GAAWnjC,KAAMkQ,GAAK0I,IAAI1I,EAAKvP,GACxBX,IACT,EA+FA2/B,GAAM1a,UAAUnL,MApEhB,WACE9Z,KAAK4/B,SAAW,IAAIH,EACtB,EAmEAE,GAAM1a,UAAkB,OAxDxB,SAAqB/U,GACnB,OAAOlQ,KAAK4/B,SAAiB,OAAE1vB,EACjC,EAuDAyvB,GAAM1a,UAAUlb,IA5ChB,SAAkBmG,GAChB,OAAOlQ,KAAK4/B,SAAS71B,IAAImG,EAC3B,EA2CAyvB,GAAM1a,UAAU2D,IAhChB,SAAkB1Y,GAChB,OAAOlQ,KAAK4/B,SAAShX,IAAI1Y,EAC3B,EA+BAyvB,GAAM1a,UAAUrM,IAnBhB,SAAkB1I,EAAKvP,GACrB,IAAIb,EAAQE,KAAK4/B,SACjB,GAAI9/B,aAAiB2/B,GAAW,CAC9B,IAAI8D,EAAQzjC,EAAM8/B,SAClB,IAAKlB,IAAQ6E,EAAMnjC,OAASojC,IAE1B,OADAD,EAAMr3B,KAAK,CAACgE,EAAKvP,IACVX,KAETF,EAAQE,KAAK4/B,SAAW,IAAIF,GAAS6D,EACvC,CAEA,OADAzjC,EAAM8Y,IAAI1I,EAAKvP,GACRX,IACT,EAgcA,IAAIqhC,GAAajD,GAAmBvB,EAAQuB,GAAkB9vB,QAyhB9D,WACE,MAAO,EACT,EAlhBIsyB,GAtQJ,SAAoBjgC,GAClB,OAAOg9B,GAAejyB,KAAK/K,EAC7B,EAwXA,SAAS8iC,GAAQ9iC,EAAOP,GAEtB,SADAA,EAAmB,MAAVA,EAAiBy5B,EAAmBz5B,KAE1B,iBAATO,GAAqB86B,EAAShS,KAAK9oB,KAC1CA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQP,CAC7C,CAkCA,SAAS6gC,GAAYtgC,GACnB,IAAI+gC,EAAO/gC,GAASA,EAAMwE,YAG1B,OAAOxE,KAFqB,mBAAR+gC,GAAsBA,EAAKzc,WAAcoY,EAG/D,CASA,SAAS0B,GAASjC,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOY,EAAahyB,KAAKoxB,EAC3B,CAAE,MAAOrc,GAAI,CACb,IACE,OAAQqc,EAAO,EACjB,CAAE,MAAOrc,GAAI,CACf,CACA,MAAO,EACT,CAwDA,SAASuf,GAAGr/B,EAAOgI,GACjB,OAAOhI,IAAUgI,GAAUhI,GAAUA,GAASgI,GAAUA,CAC1D,EAzOK61B,IAAYoC,GAAO,IAAIpC,GAAS,IAAIkF,YAAY,MAAQ7I,GACxD6D,IAAOkC,GAAO,IAAIlC,KAAQvE,GAC1BwE,IAAWiC,GAAOjC,GAAQgF,YAAcrJ,GACxCsE,IAAOgC,GAAO,IAAIhC,KAAQpE,GAC1BruB,IAAWy0B,GAAO,IAAIz0B,KAAYwuB,KACrCiG,GAAS,SAASjgC,GAChB,IAAI+7B,EAASiB,GAAejyB,KAAK/K,GAC7B+gC,EAAOhF,GAAUrC,EAAY15B,EAAMwE,iBAAc9E,EACjDujC,EAAalC,EAAO3C,GAAS2C,QAAQrhC,EAEzC,GAAIujC,EACF,OAAQA,GACN,KAAK9E,GAAoB,OAAOjE,EAChC,KAAKmE,GAAe,OAAO7E,EAC3B,KAAK8E,GAAmB,OAAO3E,EAC/B,KAAK4E,GAAe,OAAO1E,EAC3B,KAAK2E,GAAmB,OAAOxE,EAGnC,OAAO+B,CACT,GAsQF,IAAIhuB,GAAUzG,MAAMyG,QA2BpB,SAASm1B,GAAYljC,GACnB,OAAgB,MAATA,GAqGT,SAAkBA,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASk5B,CAC7C,CAxG0BiK,CAASnjC,EAAMP,UAAYijC,GAAW1iC,EAChE,CAgDA,IAAI29B,GAAWD,IAsLf,WACE,OAAO,CACT,EArKA,SAASgF,GAAW1iC,GAGlB,IAAI2M,EAAMizB,GAAS5/B,GAASg9B,GAAejyB,KAAK/K,GAAS,GACzD,OAAO2M,GAAO2sB,GAAW3sB,GAAO4sB,CAClC,CA0DA,SAASqG,GAAS5/B,GAChB,IAAI8G,SAAc9G,EAClB,QAASA,IAAkB,UAAR8G,GAA4B,YAARA,EACzC,CA0DA,SAAS8G,GAAKuxB,GACZ,OAAO+D,GAAY/D,GAn7BrB,SAAuBn/B,EAAOojC,GAG5B,IAAIrH,EAAUhuB,GAAQ/N,IAsrBxB,SAAqBA,GAEnB,OAmFF,SAA2BA,GACzB,OAmIF,SAAsBA,GACpB,QAASA,GAAyB,iBAATA,CAC3B,CArISqjC,CAAarjC,IAAUkjC,GAAYljC,EAC5C,CArFSsjC,CAAkBtjC,IAAU2sB,GAAe5hB,KAAK/K,EAAO,aAC1Dw9B,GAAqBzyB,KAAK/K,EAAO,WAAag9B,GAAejyB,KAAK/K,IAAUm5B,EAClF,CA1rBkCoK,CAAYvjC,GAljB9C,SAAmBq4B,EAAGsD,GAIpB,IAHA,IAAIt7B,GAAS,EACT07B,EAASz0B,MAAM+wB,KAEVh4B,EAAQg4B,GACf0D,EAAO17B,GAASs7B,EAASt7B,GAE3B,OAAO07B,CACT,CA2iBMyH,CAAUxjC,EAAMP,OAAQgkC,QACxB,GAEAhkC,EAASs8B,EAAOt8B,OAChBikC,IAAgBjkC,EAEpB,IAAK,IAAI8P,KAAOvP,GACTojC,IAAazW,GAAe5hB,KAAK/K,EAAOuP,IACvCm0B,IAAuB,UAAPn0B,GAAmBuzB,GAAQvzB,EAAK9P,KACpDs8B,EAAOxwB,KAAKgE,GAGhB,OAAOwsB,CACT,CAk6B+B4H,CAAcxE,GAtuB7C,SAAkBA,GAChB,IAAKmB,GAAYnB,GACf,OAAOvB,GAAWuB,GAEpB,IAAIpD,EAAS,GACb,IAAK,IAAIxsB,KAAO5B,OAAOwxB,GACjBxS,GAAe5hB,KAAKo0B,EAAQ5vB,IAAe,eAAPA,GACtCwsB,EAAOxwB,KAAKgE,GAGhB,OAAOwsB,CACT,CA2tBuD6H,CAASzE,EAChE,CAyCAtgC,EAAOD,QA9VP,SAAmBoB,GACjB,OAAOu/B,GAAUv/B,GAAO,GAAM,EAChC,mCC72CA,IAGIi5B,EAAiB,4BAGjB4K,EAAuB,EACvBC,EAAyB,EAGzB5K,EAAmB,iBAGnBC,EAAU,qBACV4K,EAAW,iBACXC,EAAW,yBACX5K,EAAU,mBACVC,EAAU,gBACV4K,EAAW,iBACX3K,EAAU,oBACVC,EAAS,6BACTC,EAAS,eACTC,EAAY,kBACZyK,EAAU,gBACVxK,EAAY,kBACZC,EAAa,mBACbwK,EAAW,iBACXvK,EAAY,kBACZC,EAAS,eACTC,EAAY,kBAEZsK,EAAe,qBACfpK,EAAa,mBAEbC,EAAiB,uBACjBC,EAAc,oBAkBdW,EAAe,8BAGfC,EAAW,mBAGXuJ,EAAiB,CAAC,EACtBA,EAxBiB,yBAwBYA,EAvBZ,yBAwBjBA,EAvBc,sBAuBYA,EAtBX,uBAuBfA,EAtBe,uBAsBYA,EArBZ,uBAsBfA,EArBsB,8BAqBYA,EApBlB,wBAqBhBA,EApBgB,yBAoBY,EAC5BA,EAAelL,GAAWkL,EAAeN,GACzCM,EAAepK,GAAkBoK,EAAejL,GAChDiL,EAAenK,GAAemK,EAAehL,GAC7CgL,EAAeJ,GAAYI,EAAe/K,GAC1C+K,EAAe7K,GAAU6K,EAAe5K,GACxC4K,EAAe3K,GAAa2K,EAAezK,GAC3CyK,EAAexK,GAAUwK,EAAevK,GACxCuK,EAAerK,IAAc,EAG7B,IAAIgB,EAA8B,iBAAV,EAAAC,GAAsB,EAAAA,GAAU,EAAAA,EAAOttB,SAAWA,QAAU,EAAAstB,EAGhFC,EAA0B,iBAARl8B,MAAoBA,MAAQA,KAAK2O,SAAWA,QAAU3O,KAGxEN,EAAOs8B,GAAcE,GAAYC,SAAS,cAATA,GAGjCC,EAA4Cx8B,IAAYA,EAAQ2pB,UAAY3pB,EAG5Ey8B,EAAaD,GAA4Cv8B,IAAWA,EAAO0pB,UAAY1pB,EAGvFy8B,EAAgBD,GAAcA,EAAWz8B,UAAYw8B,EAGrDkJ,EAAchJ,GAAiBN,EAAWuJ,QAG1CC,EAAY,WACd,IACE,OAAOF,GAAeA,EAAYnb,SAAWmb,EAAYnb,QAAQ,OACnE,CAAE,MAAOrJ,GAAI,CACf,CAJe,GAOX2kB,EAAmBD,GAAYA,EAASE,aAuD5C,SAASC,EAAUjJ,EAAOkJ,GAIxB,IAHA,IAAIvkC,GAAS,EACTZ,EAAkB,MAATi8B,EAAgB,EAAIA,EAAMj8B,SAE9BY,EAAQZ,GACf,GAAImlC,EAAUlJ,EAAMr7B,GAAQA,EAAOq7B,GACjC,OAAO,EAGX,OAAO,CACT,CAiEA,SAASM,EAAWn4B,GAClB,IAAIxD,GAAS,EACT07B,EAASz0B,MAAMzD,EAAIo4B,MAKvB,OAHAp4B,EAAIE,SAAQ,SAAS/D,EAAOuP,GAC1BwsB,IAAS17B,GAAS,CAACkP,EAAKvP,EAC1B,IACO+7B,CACT,CAuBA,SAASO,EAAWrkB,GAClB,IAAI5X,GAAS,EACT07B,EAASz0B,MAAM2Q,EAAIgkB,MAKvB,OAHAhkB,EAAIlU,SAAQ,SAAS/D,GACnB+7B,IAAS17B,GAASL,CACpB,IACO+7B,CACT,CAGA,IAeMQ,EAvCWJ,EAAMC,EAwBnBI,EAAal1B,MAAMgd,UACnBmY,EAAYtB,SAAS7W,UACrBoY,EAAc/uB,OAAO2W,UAGrBqY,EAAaj+B,EAAK,sBAGlBq+B,EAAeN,EAAU1b,SAGzB4L,EAAiB+P,EAAY/P,eAG7BiQ,GACEL,EAAM,SAASM,KAAKF,GAAcA,EAAW/uB,MAAQ+uB,EAAW/uB,KAAKkvB,UAAY,KACvE,iBAAmBP,EAAO,GAQtCsI,EAAuBnI,EAAY3b,SAGnCkc,GAAaza,OAAO,IACtBua,EAAahyB,KAAK4hB,GAAgBnkB,QA7PjB,sBA6PuC,QACvDA,QAAQ,yDAA0D,SAAW,KAI5E00B,GAAS5B,EAAgB58B,EAAKw+B,YAASx9B,EACvCy9B,GAASz+B,EAAKy+B,OACdC,GAAa1+B,EAAK0+B,WAClBI,GAAuBd,EAAYc,qBACnCnJ,GAASmI,EAAWnI,OACpByQ,GAAiB3H,GAASA,GAAO4H,iBAAcrlC,EAG/C+9B,GAAmB9vB,OAAO6f,sBAC1BkQ,GAAiBR,GAASA,GAAOS,cAAWj+B,EAC5Ck+B,IAnEazB,EAmEQxuB,OAAOC,KAnETwuB,EAmEezuB,OAlE7B,SAAS0uB,GACd,OAAOF,EAAKC,EAAUC,GACxB,GAmEEwB,GAAWC,GAAUp/B,EAAM,YAC3Bq/B,GAAMD,GAAUp/B,EAAM,OACtBs/B,GAAUF,GAAUp/B,EAAM,WAC1Bu/B,GAAMH,GAAUp/B,EAAM,OACtB8M,GAAUsyB,GAAUp/B,EAAM,WAC1Bw/B,GAAeJ,GAAUnwB,OAAQ,UAGjCwwB,GAAqBC,GAASP,IAC9BQ,GAAgBD,GAASL,IACzBO,GAAoBF,GAASJ,IAC7BO,GAAgBH,GAASH,IACzBO,GAAoBJ,GAAS5yB,IAG7BizB,GAActB,GAASA,GAAO7Y,eAAY5kB,EAC1Cg/B,GAAgBD,GAAcA,GAAYE,aAAUj/B,EASxD,SAASk/B,GAAKnnB,GACZ,IAAIpX,GAAS,EACTZ,EAAoB,MAAXgY,EAAkB,EAAIA,EAAQhY,OAG3C,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CA6FA,SAASC,GAAUrnB,GACjB,IAAIpX,GAAS,EACTZ,EAAoB,MAAXgY,EAAkB,EAAIA,EAAQhY,OAG3C,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CA0GA,SAASE,GAAStnB,GAChB,IAAIpX,GAAS,EACTZ,EAAoB,MAAXgY,EAAkB,EAAIA,EAAQhY,OAG3C,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CA6FA,SAASmG,GAASxhC,GAChB,IAAInD,GAAS,EACTZ,EAAmB,MAAV+D,EAAiB,EAAIA,EAAO/D,OAGzC,IADAJ,KAAK4/B,SAAW,IAAIF,KACX1+B,EAAQZ,GACfJ,KAAK2Y,IAAIxU,EAAOnD,GAEpB,CAyCA,SAAS2+B,GAAMvnB,GACb,IAAIrS,EAAO/F,KAAK4/B,SAAW,IAAIH,GAAUrnB,GACzCpY,KAAK48B,KAAO72B,EAAK62B,IACnB,CAqIA,SAASqD,GAAa5D,EAAOnsB,GAE3B,IADA,IAAI9P,EAASi8B,EAAMj8B,OACZA,KACL,GAAI4/B,GAAG3D,EAAMj8B,GAAQ,GAAI8P,GACvB,OAAO9P,EAGX,OAAQ,CACV,CAyBA,SAASwlC,GAAWjlC,GAClB,OAAa,MAATA,OACeN,IAAVM,EAAsBokC,EAAeF,EAEtCY,IAAkBA,MAAkBn3B,OAAO3N,GA0arD,SAAmBA,GACjB,IAAIklC,EAAQvY,EAAe5hB,KAAK/K,EAAO8kC,IACnCn4B,EAAM3M,EAAM8kC,IAEhB,IACE9kC,EAAM8kC,SAAkBplC,EACxB,IAAIylC,GAAW,CACjB,CAAE,MAAOrlB,GAAI,CAEb,IAAIic,EAAS8I,EAAqB95B,KAAK/K,GAQvC,OAPImlC,IACED,EACFllC,EAAM8kC,IAAkBn4B,SAEjB3M,EAAM8kC,KAGV/I,CACT,CA3bMqJ,CAAUplC,GA4iBhB,SAAwBA,GACtB,OAAO6kC,EAAqB95B,KAAK/K,EACnC,CA7iBMg9B,CAAeh9B,EACrB,CASA,SAASqlC,GAAgBrlC,GACvB,OAAOqjC,GAAarjC,IAAUilC,GAAWjlC,IAAUm5B,CACrD,CAgBA,SAASmM,GAAYtlC,EAAOgI,EAAOu9B,EAAS7F,EAAYC,GACtD,OAAI3/B,IAAUgI,IAGD,MAAThI,GAA0B,MAATgI,IAAmBq7B,GAAarjC,KAAWqjC,GAAar7B,GACpEhI,GAAUA,GAASgI,GAAUA,EAmBxC,SAAyBm3B,EAAQn3B,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GACtE,IAAI8F,EAAW13B,GAAQoxB,GACnBuG,EAAW33B,GAAQ/F,GACnB29B,EAASF,EAAW1B,EAAW9D,GAAOd,GACtCyG,EAASF,EAAW3B,EAAW9D,GAAOj4B,GAKtC69B,GAHJF,EAASA,GAAUxM,EAAUO,EAAYiM,IAGhBjM,EACrBoM,GAHJF,EAASA,GAAUzM,EAAUO,EAAYkM,IAGhBlM,EACrBqM,EAAYJ,GAAUC,EAE1B,GAAIG,GAAapI,GAASwB,GAAS,CACjC,IAAKxB,GAAS31B,GACZ,OAAO,EAETy9B,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAEhB,OADAlG,IAAUA,EAAQ,IAAIX,IACdyG,GAAYf,GAAavF,GAC7B6G,GAAY7G,EAAQn3B,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GAiKnE,SAAoBR,EAAQn3B,EAAO2E,EAAK44B,EAAS7F,EAAY8F,EAAW7F,GACtE,OAAQhzB,GACN,KAAKutB,EACH,GAAKiF,EAAOgC,YAAcn5B,EAAMm5B,YAC3BhC,EAAO+B,YAAcl5B,EAAMk5B,WAC9B,OAAO,EAET/B,EAASA,EAAOgB,OAChBn4B,EAAQA,EAAMm4B,OAEhB,KAAKlG,EACH,QAAKkF,EAAOgC,YAAcn5B,EAAMm5B,aAC3BqE,EAAU,IAAIpI,GAAW+B,GAAS,IAAI/B,GAAWp1B,KAKxD,KAAKoxB,EACL,KAAKC,EACL,KAAKI,EAGH,OAAO4F,IAAIF,GAASn3B,GAEtB,KAAKi8B,EACH,OAAO9E,EAAO3+B,MAAQwH,EAAMxH,MAAQ2+B,EAAO8G,SAAWj+B,EAAMi+B,QAE9D,KAAKrM,EACL,KAAKE,EAIH,OAAOqF,GAAWn3B,EAAQ,GAE5B,KAAKwxB,EACH,IAAIvgB,EAAU+iB,EAEhB,KAAKnC,EACH,IAAIqM,EAAYX,EAAU1B,EAG1B,GAFA5qB,IAAYA,EAAUqjB,GAElB6C,EAAOlD,MAAQj0B,EAAMi0B,OAASiK,EAChC,OAAO,EAGT,IAAIrE,EAAUlC,EAAMv2B,IAAI+1B,GACxB,GAAI0C,EACF,OAAOA,GAAW75B,EAEpBu9B,GAAWzB,EAGXnE,EAAM1nB,IAAIknB,EAAQn3B,GAClB,IAAI+zB,EAASiK,GAAY/sB,EAAQkmB,GAASlmB,EAAQjR,GAAQu9B,EAAS7F,EAAY8F,EAAW7F,GAE1F,OADAA,EAAc,OAAER,GACTpD,EAET,IAhoCY,kBAioCV,GAAI2C,GACF,OAAOA,GAAc3zB,KAAKo0B,IAAWT,GAAc3zB,KAAK/C,GAG9D,OAAO,CACT,CA/NQm+B,CAAWhH,EAAQn3B,EAAO29B,EAAQJ,EAAS7F,EAAY8F,EAAW7F,GAExE,KAAM4F,EAAU1B,GAAuB,CACrC,IAAIuC,EAAeP,GAAYlZ,EAAe5hB,KAAKo0B,EAAQ,eACvDkH,EAAeP,GAAYnZ,EAAe5hB,KAAK/C,EAAO,eAE1D,GAAIo+B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAejH,EAAOn/B,QAAUm/B,EAC/CoH,EAAeF,EAAer+B,EAAMhI,QAAUgI,EAGlD,OADA23B,IAAUA,EAAQ,IAAIX,IACfwG,EAAUc,EAAcC,EAAchB,EAAS7F,EAAYC,EACpE,CACF,CACA,QAAKoG,IAGLpG,IAAUA,EAAQ,IAAIX,IA6NxB,SAAsBG,EAAQn3B,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GACnE,IAAIuG,EAAYX,EAAU1B,EACtB2C,EAAWrE,GAAWhD,GACtBsH,EAAYD,EAAS/mC,OAIzB,GAAIgnC,GAHWtE,GAAWn6B,GACDvI,SAEMymC,EAC7B,OAAO,EAGT,IADA,IAAI7lC,EAAQomC,EACLpmC,KAAS,CACd,IAAIkP,EAAMi3B,EAASnmC,GACnB,KAAM6lC,EAAY32B,KAAOvH,EAAQ2kB,EAAe5hB,KAAK/C,EAAOuH,IAC1D,OAAO,CAEX,CAEA,IAAIsyB,EAAUlC,EAAMv2B,IAAI+1B,GACxB,GAAI0C,GAAWlC,EAAMv2B,IAAIpB,GACvB,OAAO65B,GAAW75B,EAEpB,IAAI+zB,GAAS,EACb4D,EAAM1nB,IAAIknB,EAAQn3B,GAClB23B,EAAM1nB,IAAIjQ,EAAOm3B,GAGjB,IADA,IAAIuH,EAAWR,IACN7lC,EAAQomC,GAAW,CAE1B,IAAIrH,EAAWD,EADf5vB,EAAMi3B,EAASnmC,IAEXsmC,EAAW3+B,EAAMuH,GAErB,GAAImwB,EACF,IAAIkH,EAAWV,EACXxG,EAAWiH,EAAUvH,EAAU7vB,EAAKvH,EAAOm3B,EAAQQ,GACnDD,EAAWN,EAAUuH,EAAUp3B,EAAK4vB,EAAQn3B,EAAO23B,GAGzD,UAAmBjgC,IAAbknC,EACGxH,IAAauH,GAAYnB,EAAUpG,EAAUuH,EAAUpB,EAAS7F,EAAYC,GAC7EiH,GACD,CACL7K,GAAS,EACT,KACF,CACA2K,IAAaA,EAAkB,eAAPn3B,EAC1B,CACA,GAAIwsB,IAAW2K,EAAU,CACvB,IAAIG,EAAU1H,EAAO36B,YACjBsiC,EAAU9+B,EAAMxD,YAGhBqiC,GAAWC,KACV,gBAAiB3H,MAAU,gBAAiBn3B,IACzB,mBAAX6+B,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD/K,GAAS,EAEb,CAGA,OAFA4D,EAAc,OAAER,GAChBQ,EAAc,OAAE33B,GACT+zB,CACT,CA1RSgL,CAAa5H,EAAQn3B,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GACrE,CA5DSqH,CAAgBhnC,EAAOgI,EAAOu9B,EAAS7F,EAAY4F,GAAa3F,GACzE,CA0HA,SAASqG,GAAYtK,EAAO1zB,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GACjE,IAAIuG,EAAYX,EAAU1B,EACtBoD,EAAYvL,EAAMj8B,OAClBynC,EAAYl/B,EAAMvI,OAEtB,GAAIwnC,GAAaC,KAAehB,GAAagB,EAAYD,GACvD,OAAO,EAGT,IAAIpF,EAAUlC,EAAMv2B,IAAIsyB,GACxB,GAAImG,GAAWlC,EAAMv2B,IAAIpB,GACvB,OAAO65B,GAAW75B,EAEpB,IAAI3H,GAAS,EACT07B,GAAS,EACToL,EAAQ5B,EAAUzB,EAA0B,IAAIkB,QAAWtlC,EAM/D,IAJAigC,EAAM1nB,IAAIyjB,EAAO1zB,GACjB23B,EAAM1nB,IAAIjQ,EAAO0zB,KAGRr7B,EAAQ4mC,GAAW,CAC1B,IAAIG,EAAW1L,EAAMr7B,GACjBsmC,EAAW3+B,EAAM3H,GAErB,GAAIq/B,EACF,IAAIkH,EAAWV,EACXxG,EAAWiH,EAAUS,EAAU/mC,EAAO2H,EAAO0zB,EAAOiE,GACpDD,EAAW0H,EAAUT,EAAUtmC,EAAOq7B,EAAO1zB,EAAO23B,GAE1D,QAAiBjgC,IAAbknC,EAAwB,CAC1B,GAAIA,EACF,SAEF7K,GAAS,EACT,KACF,CAEA,GAAIoL,GACF,IAAKxC,EAAU38B,GAAO,SAAS2+B,EAAUU,GACnC,GA72Ba93B,EA62BO83B,GAANF,EA52BXlf,IAAI1Y,KA62BF63B,IAAaT,GAAYnB,EAAU4B,EAAUT,EAAUpB,EAAS7F,EAAYC,IAC/E,OAAOwH,EAAK57B,KAAK87B,GA/2B/B,IAAyB93B,CAi3Bf,IAAI,CACNwsB,GAAS,EACT,KACF,OACK,GACDqL,IAAaT,IACXnB,EAAU4B,EAAUT,EAAUpB,EAAS7F,EAAYC,GACpD,CACL5D,GAAS,EACT,KACF,CACF,CAGA,OAFA4D,EAAc,OAAEjE,GAChBiE,EAAc,OAAE33B,GACT+zB,CACT,CAwKA,SAASoG,GAAWhD,GAClB,OApZF,SAAwBA,EAAQ4C,EAAUC,GACxC,IAAIjG,EAASgG,EAAS5C,GACtB,OAAOpxB,GAAQoxB,GAAUpD,EAhuB3B,SAAmBL,EAAOl4B,GAKxB,IAJA,IAAInD,GAAS,EACTZ,EAAS+D,EAAO/D,OAChBwF,EAASy2B,EAAMj8B,SAEVY,EAAQZ,GACfi8B,EAAMz2B,EAAS5E,GAASmD,EAAOnD,GAEjC,OAAOq7B,CACT,CAutBoCuG,CAAUlG,EAAQiG,EAAY7C,GAClE,CAiZS+C,CAAe/C,EAAQvxB,GAAM8yB,GACtC,CAUA,SAAS8B,GAAW3+B,EAAK0L,GACvB,IAsHiBvP,EACb8G,EAvHA1B,EAAOvB,EAAIo7B,SACf,OAuHgB,WADZn4B,SADa9G,EArHAuP,KAuHmB,UAARzI,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV9G,EACU,OAAVA,GAxHDoF,EAAmB,iBAAPmK,EAAkB,SAAW,QACzCnK,EAAKvB,GACX,CAUA,SAASi6B,GAAUqB,EAAQ5vB,GACzB,IAAIvP,EAxjCN,SAAkBm/B,EAAQ5vB,GACxB,OAAiB,MAAV4vB,OAAiBz/B,EAAYy/B,EAAO5vB,EAC7C,CAsjCckzB,CAAStD,EAAQ5vB,GAC7B,OArTF,SAAsBvP,GACpB,SAAK4/B,GAAS5/B,IAwahB,SAAkBm8B,GAChB,QAASS,GAAeA,KAAcT,CACxC,CA1a0BmL,CAAStnC,MAGnB0iC,GAAW1iC,GAASi9B,GAAapC,GAChC/R,KAAKsV,GAASp+B,GAC/B,CA+SS2iC,CAAa3iC,GAASA,OAAQN,CACvC,CAr2BAk/B,GAAKta,UAAUnL,MAvEf,WACE9Z,KAAK4/B,SAAWf,GAAeA,GAAa,MAAQ,CAAC,EACrD7+B,KAAK48B,KAAO,CACd,EAqEA2C,GAAKta,UAAkB,OAzDvB,SAAoB/U,GAClB,IAAIwsB,EAAS18B,KAAK4oB,IAAI1Y,WAAelQ,KAAK4/B,SAAS1vB,GAEnD,OADAlQ,KAAK48B,MAAQF,EAAS,EAAI,EACnBA,CACT,EAsDA6C,GAAKta,UAAUlb,IA3Cf,SAAiBmG,GACf,IAAInK,EAAO/F,KAAK4/B,SAChB,GAAIf,GAAc,CAChB,IAAInC,EAAS32B,EAAKmK,GAClB,OAAOwsB,IAAW9C,OAAiBv5B,EAAYq8B,CACjD,CACA,OAAOpP,EAAe5hB,KAAK3F,EAAMmK,GAAOnK,EAAKmK,QAAO7P,CACtD,EAqCAk/B,GAAKta,UAAU2D,IA1Bf,SAAiB1Y,GACf,IAAInK,EAAO/F,KAAK4/B,SAChB,OAAOf,QAA8Bx+B,IAAd0F,EAAKmK,GAAsBod,EAAe5hB,KAAK3F,EAAMmK,EAC9E,EAwBAqvB,GAAKta,UAAUrM,IAZf,SAAiB1I,EAAKvP,GACpB,IAAIoF,EAAO/F,KAAK4/B,SAGhB,OAFA5/B,KAAK48B,MAAQ58B,KAAK4oB,IAAI1Y,GAAO,EAAI,EACjCnK,EAAKmK,GAAQ2uB,SAA0Bx+B,IAAVM,EAAuBi5B,EAAiBj5B,EAC9DX,IACT,EAsHAy/B,GAAUxa,UAAUnL,MApFpB,WACE9Z,KAAK4/B,SAAW,GAChB5/B,KAAK48B,KAAO,CACd,EAkFA6C,GAAUxa,UAAkB,OAvE5B,SAAyB/U,GACvB,IAAInK,EAAO/F,KAAK4/B,SACZ5+B,EAAQi/B,GAAal6B,EAAMmK,GAE/B,QAAIlP,EAAQ,IAIRA,GADY+E,EAAK3F,OAAS,EAE5B2F,EAAKzB,MAEL0wB,GAAOtpB,KAAK3F,EAAM/E,EAAO,KAEzBhB,KAAK48B,KACA,GACT,EAyDA6C,GAAUxa,UAAUlb,IA9CpB,SAAsBmG,GACpB,IAAInK,EAAO/F,KAAK4/B,SACZ5+B,EAAQi/B,GAAal6B,EAAMmK,GAE/B,OAAOlP,EAAQ,OAAIX,EAAY0F,EAAK/E,GAAO,EAC7C,EA0CAy+B,GAAUxa,UAAU2D,IA/BpB,SAAsB1Y,GACpB,OAAO+vB,GAAajgC,KAAK4/B,SAAU1vB,IAAQ,CAC7C,EA8BAuvB,GAAUxa,UAAUrM,IAlBpB,SAAsB1I,EAAKvP,GACzB,IAAIoF,EAAO/F,KAAK4/B,SACZ5+B,EAAQi/B,GAAal6B,EAAMmK,GAQ/B,OANIlP,EAAQ,KACRhB,KAAK48B,KACP72B,EAAKmG,KAAK,CAACgE,EAAKvP,KAEhBoF,EAAK/E,GAAO,GAAKL,EAEZX,IACT,EAwGA0/B,GAASza,UAAUnL,MAtEnB,WACE9Z,KAAK48B,KAAO,EACZ58B,KAAK4/B,SAAW,CACd,KAAQ,IAAIL,GACZ,IAAO,IAAKb,IAAOe,IACnB,OAAU,IAAIF,GAElB,EAgEAG,GAASza,UAAkB,OArD3B,SAAwB/U,GACtB,IAAIwsB,EAASyG,GAAWnjC,KAAMkQ,GAAa,OAAEA,GAE7C,OADAlQ,KAAK48B,MAAQF,EAAS,EAAI,EACnBA,CACT,EAkDAgD,GAASza,UAAUlb,IAvCnB,SAAqBmG,GACnB,OAAOizB,GAAWnjC,KAAMkQ,GAAKnG,IAAImG,EACnC,EAsCAwvB,GAASza,UAAU2D,IA3BnB,SAAqB1Y,GACnB,OAAOizB,GAAWnjC,KAAMkQ,GAAK0Y,IAAI1Y,EACnC,EA0BAwvB,GAASza,UAAUrM,IAdnB,SAAqB1I,EAAKvP,GACxB,IAAIoF,EAAOo9B,GAAWnjC,KAAMkQ,GACxB0sB,EAAO72B,EAAK62B,KAIhB,OAFA72B,EAAK6S,IAAI1I,EAAKvP,GACdX,KAAK48B,MAAQ72B,EAAK62B,MAAQA,EAAO,EAAI,EAC9B58B,IACT,EAwDA2lC,GAAS1gB,UAAUtM,IAAMgtB,GAAS1gB,UAAU/Y,KAnB5C,SAAqBvL,GAEnB,OADAX,KAAK4/B,SAAShnB,IAAIjY,EAAOi5B,GAClB55B,IACT,EAiBA2lC,GAAS1gB,UAAU2D,IANnB,SAAqBjoB,GACnB,OAAOX,KAAK4/B,SAAShX,IAAIjoB,EAC3B,EAoGAg/B,GAAM1a,UAAUnL,MA3EhB,WACE9Z,KAAK4/B,SAAW,IAAIH,GACpBz/B,KAAK48B,KAAO,CACd,EAyEA+C,GAAM1a,UAAkB,OA9DxB,SAAqB/U,GACnB,IAAInK,EAAO/F,KAAK4/B,SACZlD,EAAS32B,EAAa,OAAEmK,GAG5B,OADAlQ,KAAK48B,KAAO72B,EAAK62B,KACVF,CACT,EAyDAiD,GAAM1a,UAAUlb,IA9ChB,SAAkBmG,GAChB,OAAOlQ,KAAK4/B,SAAS71B,IAAImG,EAC3B,EA6CAyvB,GAAM1a,UAAU2D,IAlChB,SAAkB1Y,GAChB,OAAOlQ,KAAK4/B,SAAShX,IAAI1Y,EAC3B,EAiCAyvB,GAAM1a,UAAUrM,IArBhB,SAAkB1I,EAAKvP,GACrB,IAAIoF,EAAO/F,KAAK4/B,SAChB,GAAI75B,aAAgB05B,GAAW,CAC7B,IAAI8D,EAAQx9B,EAAK65B,SACjB,IAAKlB,IAAQ6E,EAAMnjC,OAASojC,IAG1B,OAFAD,EAAMr3B,KAAK,CAACgE,EAAKvP,IACjBX,KAAK48B,OAAS72B,EAAK62B,KACZ58B,KAET+F,EAAO/F,KAAK4/B,SAAW,IAAIF,GAAS6D,EACtC,CAGA,OAFAx9B,EAAK6S,IAAI1I,EAAKvP,GACdX,KAAK48B,KAAO72B,EAAK62B,KACV58B,IACT,EA8hBA,IAAIqhC,GAAcjD,GAA+B,SAAS0B,GACxD,OAAc,MAAVA,EACK,IAETA,EAASxxB,OAAOwxB,GA9sClB,SAAqBzD,EAAOkJ,GAM1B,IALA,IAAIvkC,GAAS,EACTZ,EAAkB,MAATi8B,EAAgB,EAAIA,EAAMj8B,OACnC8nC,EAAW,EACXxL,EAAS,KAEJ17B,EAAQZ,GAAQ,CACvB,IAAIO,EAAQ07B,EAAMr7B,GAwsCkCygC,EAvsCtC9gC,EAwsCPw9B,GAAqBzyB,KAAKo0B,EAAQ2B,KAvsCvC/E,EAAOwL,KAAcvnC,EAEzB,CAosC6C,IAAS8gC,EAnsCtD,OAAO/E,CACT,CAksCSyL,CAAY/J,GAAiB0B,IAGtC,EAodA,WACE,MAAO,EACT,EA7cIc,GAASgF,GAkCb,SAASnC,GAAQ9iC,EAAOP,GAEtB,SADAA,EAAmB,MAAVA,EAAiBy5B,EAAmBz5B,KAE1B,iBAATO,GAAqB86B,EAAShS,KAAK9oB,KAC1CA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQP,CAC7C,CA2DA,SAAS2+B,GAASjC,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOY,EAAahyB,KAAKoxB,EAC3B,CAAE,MAAOrc,GAAI,CACb,IACE,OAAQqc,EAAO,EACjB,CAAE,MAAOrc,GAAI,CACf,CACA,MAAO,EACT,CAkCA,SAASuf,GAAGr/B,EAAOgI,GACjB,OAAOhI,IAAUgI,GAAUhI,GAAUA,GAASgI,GAAUA,CAC1D,EA7IK61B,IAAYoC,GAAO,IAAIpC,GAAS,IAAIkF,YAAY,MAAQ7I,GACxD6D,IAAOkC,GAAO,IAAIlC,KAAQvE,GAC1BwE,IAAWiC,GAAOjC,GAAQgF,YAAcrJ,GACxCsE,IAAOgC,GAAO,IAAIhC,KAAQpE,GAC1BruB,IAAWy0B,GAAO,IAAIz0B,KAAYwuB,KACrCiG,GAAS,SAASjgC,GAChB,IAAI+7B,EAASkJ,GAAWjlC,GACpB+gC,EAAOhF,GAAUrC,EAAY15B,EAAMwE,iBAAc9E,EACjDujC,EAAalC,EAAO3C,GAAS2C,GAAQ,GAEzC,GAAIkC,EACF,OAAQA,GACN,KAAK9E,GAAoB,OAAOjE,EAChC,KAAKmE,GAAe,OAAO7E,EAC3B,KAAK8E,GAAmB,OAAO3E,EAC/B,KAAK4E,GAAe,OAAO1E,EAC3B,KAAK2E,GAAmB,OAAOxE,EAGnC,OAAO+B,CACT,GA6IF,IAAIwH,GAAc8B,GAAgB,WAAa,OAAO7lC,SAAW,CAA/B,IAAsC6lC,GAAkB,SAASrlC,GACjG,OAAOqjC,GAAarjC,IAAU2sB,EAAe5hB,KAAK/K,EAAO,YACtDw9B,GAAqBzyB,KAAK/K,EAAO,SACtC,EAyBI+N,GAAUzG,MAAMyG,QAgDhB4vB,GAAWD,IA4Of,WACE,OAAO,CACT,EA3LA,SAASgF,GAAW1iC,GAClB,IAAK4/B,GAAS5/B,GACZ,OAAO,EAIT,IAAI2M,EAAMs4B,GAAWjlC,GACrB,OAAO2M,GAAO2sB,GAAW3sB,GAAO4sB,GAAU5sB,GAAOq3B,GAAYr3B,GAAOw3B,CACtE,CA4BA,SAAShB,GAASnjC,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GAASk5B,CAC7C,CA2BA,SAAS0G,GAAS5/B,GAChB,IAAI8G,SAAc9G,EAClB,OAAgB,MAATA,IAA0B,UAAR8G,GAA4B,YAARA,EAC/C,CA0BA,SAASu8B,GAAarjC,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,CAmBA,IAAI0kC,GAAeD,EAhiDnB,SAAmBtI,GACjB,OAAO,SAASn8B,GACd,OAAOm8B,EAAKn8B,EACd,CACF,CA4hDsCynC,CAAUhD,GAnvBhD,SAA0BzkC,GACxB,OAAOqjC,GAAarjC,IAClBmjC,GAASnjC,EAAMP,WAAa4kC,EAAeY,GAAWjlC,GAC1D,EA8wBA,SAAS4N,GAAKuxB,GACZ,OA1NgB,OADGn/B,EA2NAm/B,IA1NKgE,GAASnjC,EAAMP,UAAYijC,GAAW1iC,GA1vBhE,SAAuBA,EAAOojC,GAC5B,IAAIvD,EAAQ9xB,GAAQ/N,GAChB0nC,GAAS7H,GAAS0D,GAAYvjC,GAC9B2nC,GAAU9H,IAAU6H,GAAS/J,GAAS39B,GACtC4nC,GAAU/H,IAAU6H,IAAUC,GAAUjD,GAAa1kC,GACrD0jC,EAAc7D,GAAS6H,GAASC,GAAUC,EAC1C7L,EAAS2H,EAloBf,SAAmBrL,EAAGsD,GAIpB,IAHA,IAAIt7B,GAAS,EACT07B,EAASz0B,MAAM+wB,KAEVh4B,EAAQg4B,GACf0D,EAAO17B,GAASs7B,EAASt7B,GAE3B,OAAO07B,CACT,CA0nB6ByH,CAAUxjC,EAAMP,OAAQgkC,QAAU,GACzDhkC,EAASs8B,EAAOt8B,OAEpB,IAAK,IAAI8P,KAAOvP,GACTojC,IAAazW,EAAe5hB,KAAK/K,EAAOuP,IACvCm0B,IAEQ,UAAPn0B,GAECo4B,IAAkB,UAAPp4B,GAA0B,UAAPA,IAE9Bq4B,IAAkB,UAAPr4B,GAA0B,cAAPA,GAA8B,cAAPA,IAEtDuzB,GAAQvzB,EAAK9P,KAElBs8B,EAAOxwB,KAAKgE,GAGhB,OAAOwsB,CACT,CA27B+B4H,CAAcxE,GAtwB7C,SAAkBA,GAChB,GAyZI4B,GADe/gC,EAxZFm/B,IAyZGn/B,EAAMwE,YAGnBxE,KAFqB,mBAAR+gC,GAAsBA,EAAKzc,WAAcoY,GAzZ3D,OAAOkB,GAAWuB,GAuZtB,IAAqBn/B,EACf+gC,EAtZAhF,EAAS,GACb,IAAK,IAAIxsB,KAAO5B,OAAOwxB,GACjBxS,EAAe5hB,KAAKo0B,EAAQ5vB,IAAe,eAAPA,GACtCwsB,EAAOxwB,KAAKgE,GAGhB,OAAOwsB,CACT,CA2vBuD6H,CAASzE,GA3NhE,IAAqBn/B,CA4NrB,CAyCAnB,EAAOD,QAlNP,SAAiBoB,EAAOgI,GACtB,OAAOs9B,GAAYtlC,EAAOgI,EAC5B,sFCvmDA,gBACA,UAMA,IAAUqH,GAAV,SAAUA,GACQ,EAAA+C,QAAhB,SACEy1B,EAAkB,CAAC,EACnBC,EAAkB,CAAC,EACnBC,GAAW,GAEM,iBAANF,IACTA,EAAI,CAAC,GAEU,iBAANC,IACTA,EAAI,CAAC,GAEP,IAAI1kC,EAAa+M,EAAU23B,GACtBC,IACH3kC,EAAauK,OAAOC,KAAKxK,GAAYvD,QAAqB,CAACugC,EAAM7wB,KACxC,MAAnBnM,EAAWmM,KACb6wB,EAAK7wB,GAAOnM,EAAWmM,IAElB6wB,IACN,CAAC,IAEN,IAAK,MAAM7wB,KAAOs4B,OACDnoC,IAAXmoC,EAAEt4B,SAAiC7P,IAAXooC,EAAEv4B,KAC5BnM,EAAWmM,GAAOs4B,EAAEt4B,IAGxB,OAAO5B,OAAOC,KAAKxK,GAAY3D,OAAS,EAAI2D,OAAa1D,CAC3D,EAEgB,EAAA4P,KAAhB,SACEu4B,EAAkB,CAAC,EACnBC,EAAkB,CAAC,GAEF,iBAAND,IACTA,EAAI,CAAC,GAEU,iBAANC,IACTA,EAAI,CAAC,GAEP,MAAM1kC,EAAauK,OAAOC,KAAKi6B,GAC5B75B,OAAOL,OAAOC,KAAKk6B,IACnBjoC,QAAqB,CAACmoC,EAAOz4B,KACvB8C,EAAQw1B,EAAEt4B,GAAMu4B,EAAEv4B,MACrBy4B,EAAMz4B,QAAkB7P,IAAXooC,EAAEv4B,GAAqB,KAAOu4B,EAAEv4B,IAExCy4B,IACN,CAAC,GACN,OAAOr6B,OAAOC,KAAKxK,GAAY3D,OAAS,EAAI2D,OAAa1D,CAC3D,EAEgB,EAAAuoC,OAAhB,SACEvjB,EAAqB,CAAC,EACtBwjB,EAAqB,CAAC,GAEtBxjB,EAAOA,GAAQ,CAAC,EAChB,MAAMyjB,EAAex6B,OAAOC,KAAKs6B,GAAMroC,QAAqB,CAACimB,EAAMvW,KAC7D24B,EAAK34B,KAASmV,EAAKnV,SAAsB7P,IAAdglB,EAAKnV,KAClCuW,EAAKvW,GAAO24B,EAAK34B,IAEZuW,IACN,CAAC,GACJ,OAAOnY,OAAOC,KAAK8W,GAAM7kB,QAAqB,CAACimB,EAAMvW,KAC/CmV,EAAKnV,KAAS24B,EAAK34B,SAAsB7P,IAAdwoC,EAAK34B,KAClCuW,EAAKvW,GAAO,MAEPuW,IACNqiB,EACL,EAEgB,EAAA/L,UAAhB,SACEyL,EACAC,EACAM,GAAW,GAEX,GAAiB,iBAANP,EACT,OAAOC,EAET,GAAiB,iBAANA,EACT,OAEF,IAAKM,EACH,OAAON,EAET,MAAM1kC,EAAauK,OAAOC,KAAKk6B,GAAGjoC,QAAqB,CAACmoC,EAAOz4B,UAC9C7P,IAAXmoC,EAAEt4B,KACJy4B,EAAMz4B,GAAOu4B,EAAEv4B,IAEVy4B,IACN,CAAC,GACJ,OAAOr6B,OAAOC,KAAKxK,GAAY3D,OAAS,EAAI2D,OAAa1D,CAC3D,CACD,CA3FD,CAAU2P,IAAAA,EAAY,KA6FtB,UAAeA,8HCpGf,gBACA,UACA,UACA,UAojByB,EAAAA,aApjBlB,UACP,gBAmjBS,EAAAP,GAnjBF,UACP,gBAkjBa,EAAAu5B,WAljBN,UAEP,MAAMC,EAAiB7E,OAAO8E,aAAa,GAQrCC,EAAsB,CAC1BX,EACAC,KAEA,GAAiB,iBAAND,GAAwB,OAANA,EAC3B,MAAM,IAAInxB,MAAM,0BAA0BmxB,GAE5C,GAAiB,iBAANC,GAAwB,OAANA,EAC3B,MAAM,IAAIpxB,MAAM,0BAA0BoxB,GAE5C,MAAMW,EAAY96B,OAAOC,KAAKi6B,GAAG,GACjC,IAAKY,GAAaA,IAAc96B,OAAOC,KAAKk6B,GAAG,GAC7C,MAAM,IAAIpxB,MACR,4BAA4B+xB,QAAgB96B,OAAOC,KAAKk6B,GAAG,MAG/D,MAAO,CAACW,EAAWZ,EAAEY,GAAYX,EAAEW,GAAW,EAGhD,MAAMvoC,EAuBJ,WAAAsE,CAAYoK,GAENtH,MAAMyG,QAAQa,GAChBvP,KAAKuP,IAAMA,EACK,MAAPA,GAAetH,MAAMyG,QAAQa,EAAIA,KAC1CvP,KAAKuP,IAAMA,EAAIA,IAEfvP,KAAKuP,IAAM,EAEf,CA1BA,oBAAO85B,CAAiBD,EAAmBr9B,GACzC/L,KAAKquB,SAAS+a,GAAar9B,CAC7B,CAEA,sBAAOu9B,CAAgBF,UACdppC,KAAKquB,SAAS+a,EACvB,CAEQ,iBAAOG,CAAWH,GACxB,MAAMr9B,EAAU/L,KAAKquB,SAAS+a,GAC9B,IAAKr9B,EACH,MAAM,IAAIsL,MAAM,+BAA+B+xB,MAEjD,OAAOr9B,CACT,CAcA,MAAArL,CACEs8B,EACAj5B,GAEA,MAAMylC,EAAY,CAAC,EACnB,MAAmB,iBAARxM,GAAmC,IAAfA,EAAI58B,OAC1BJ,MAETwpC,EAAM9oC,OAASs8B,EAEC,MAAdj5B,GACsB,iBAAfA,GACPuK,OAAOC,KAAKxK,GAAY3D,OAAS,IAEjCopC,EAAMzlC,WAAaA,GAEd/D,KAAKkM,KAAKs9B,GACnB,CAEA,OAAOppC,GACL,OAAIA,GAAU,EACLJ,KAEFA,KAAKkM,KAAK,CAAEuE,OAAQrQ,GAC7B,CAEA,MAAAwP,CACExP,EACA2D,GAEA,GAAsB,iBAAX3D,GAAuBA,GAAU,EAC1C,OAAOJ,KAET,MAAMwpC,EAAY,CAAE55B,OAAQxP,GAQ5B,OANgB,MAAd2D,GACsB,iBAAfA,GACPuK,OAAOC,KAAKxK,GAAY3D,OAAS,IAEjCopC,EAAMzlC,WAAaA,GAEd/D,KAAKkM,KAAKs9B,EACnB,CAEA,IAAAt9B,CAAKs9B,GACH,IAAIxoC,EAAQhB,KAAKuP,IAAInP,OACjBqpC,EAASzpC,KAAKuP,IAAIvO,EAAQ,GAE9B,GADAwoC,EAAQ14B,EAAU04B,GACI,iBAAXC,EAAqB,CAC9B,GAC0B,iBAAjBD,EAAM/4B,QACY,iBAAlBg5B,EAAOh5B,OAGd,OADAzQ,KAAKuP,IAAIvO,EAAQ,GAAK,CAAEyP,OAAQg5B,EAAOh5B,OAAS+4B,EAAM/4B,QAC/CzQ,KAIT,GAA6B,iBAAlBypC,EAAOh5B,QAAuC,MAAhB+4B,EAAM9oC,SAC7CM,GAAS,EACTyoC,EAASzpC,KAAKuP,IAAIvO,EAAQ,GACJ,iBAAXyoC,GAET,OADAzpC,KAAKuP,IAAI8kB,QAAQmV,GACVxpC,KAGX,GAAIgT,EAAQw2B,EAAMzlC,WAAY0lC,EAAO1lC,YAAa,CAChD,GAC0B,iBAAjBylC,EAAM9oC,QACY,iBAAlB+oC,EAAO/oC,OAMd,OAJAV,KAAKuP,IAAIvO,EAAQ,GAAK,CAAEN,OAAQ+oC,EAAO/oC,OAAS8oC,EAAM9oC,QACtB,iBAArB8oC,EAAMzlC,aACf/D,KAAKuP,IAAIvO,EAAQ,GAAG+C,WAAaylC,EAAMzlC,YAElC/D,KACF,GACmB,iBAAjBwpC,EAAM55B,QACY,iBAAlB65B,EAAO75B,OAMd,OAJA5P,KAAKuP,IAAIvO,EAAQ,GAAK,CAAE4O,OAAQ65B,EAAO75B,OAAS45B,EAAM55B,QACtB,iBAArB45B,EAAMzlC,aACf/D,KAAKuP,IAAIvO,EAAQ,GAAG+C,WAAaylC,EAAMzlC,YAElC/D,MASb,OALIgB,IAAUhB,KAAKuP,IAAInP,OACrBJ,KAAKuP,IAAIrD,KAAKs9B,GAEdxpC,KAAKuP,IAAIylB,OAAOh0B,EAAO,EAAGwoC,GAErBxpC,IACT,CAEA,IAAA0pC,GACE,MAAMD,EAASzpC,KAAKuP,IAAIvP,KAAKuP,IAAInP,OAAS,GAI1C,OAHIqpC,GAAmC,iBAAlBA,EAAO75B,SAAwB65B,EAAO1lC,YACzD/D,KAAKuP,IAAIjL,MAEJtE,IACT,CAEA,MAAAE,CAAOqlC,GACL,OAAOvlC,KAAKuP,IAAIrP,OAAOqlC,EACzB,CAEA,OAAA7gC,CAAQ6gC,GACNvlC,KAAKuP,IAAI7K,QAAQ6gC,EACnB,CAEA,GAAA/gC,CAAO+gC,GACL,OAAOvlC,KAAKuP,IAAI/K,IAAI+gC,EACtB,CAEA,SAAAoE,CAAUpE,GACR,MAAMqE,EAAe,GACfC,EAAe,GAKrB,OAJA7pC,KAAK0E,SAASoK,KACGy2B,EAAUz2B,GAAM86B,EAASC,GACjC39B,KAAK4C,EAAG,IAEV,CAAC86B,EAAQC,EAClB,CAEA,MAAArpC,CACE+kC,EACAuE,GAEA,OAAO9pC,KAAKuP,IAAI/O,OAAO+kC,EAAWuE,EACpC,CAEA,YAAAC,GACE,OAAO/pC,KAAKQ,QAAO,CAACJ,EAAQ4pC,IACtBA,EAAKtpC,OACAN,EAAS,UAAGA,OAAO4pC,GACjBA,EAAKv5B,OACPrQ,EAAS4pC,EAAKv5B,OAEhBrQ,GACN,EACL,CAEA,MAAAA,GACE,OAAOJ,KAAKQ,QAAO,CAACJ,EAAQ4pC,IACnB5pC,EAAS,UAAGA,OAAO4pC,IACzB,EACL,CAEA,KAAAr8B,CAAM5G,EAAQ,EAAGC,EAAMijC,KACrB,MAAM16B,EAAM,GACN26B,EAAO,IAAI,UAAWlqC,KAAKuP,KACjC,IAAIvO,EAAQ,EACZ,KAAOA,EAAQgG,GAAOkjC,EAAKC,WAAW,CACpC,IAAIC,EACAppC,EAAQ+F,EACVqjC,EAASF,EAAK7mC,KAAK0D,EAAQ/F,IAE3BopC,EAASF,EAAK7mC,KAAK2D,EAAMhG,GACzBuO,EAAIrD,KAAKk+B,IAEXppC,GAAS,UAAGZ,OAAOgqC,GAErB,OAAO,IAAIvpC,EAAM0O,EACnB,CAEA,OAAAwD,CAAQpK,GACN,MAAM0hC,EAAW,IAAI,UAAWrqC,KAAKuP,KAC/B+6B,EAAY,IAAI,UAAW3hC,EAAM4G,KACjCA,EAAM,GACNg7B,EAAaD,EAAUE,OAC7B,GACgB,MAAdD,GAC6B,iBAAtBA,EAAW36B,QACO,MAAzB26B,EAAWxmC,WACX,CACA,IAAI0mC,EAAYF,EAAW36B,OAC3B,KAC0B,WAAxBy6B,EAASK,YACTL,EAASM,cAAgBF,GAEzBA,GAAaJ,EAASM,aACtBp7B,EAAIrD,KAAKm+B,EAAShnC,QAEhBknC,EAAW36B,OAAS66B,EAAY,GAClCH,EAAUjnC,KAAKknC,EAAW36B,OAAS66B,GAGvC,MAAM1qC,EAAQ,IAAIc,EAAM0O,GACxB,KAAO86B,EAASF,WAAaG,EAAUH,WACrC,GAA6B,WAAzBG,EAAUI,WACZ3qC,EAAMmM,KAAKo+B,EAAUjnC,aAChB,GAA4B,WAAxBgnC,EAASK,WAClB3qC,EAAMmM,KAAKm+B,EAAShnC,YACf,CACL,MAAMjD,EAASqB,KAAKC,IAAI2oC,EAASM,aAAcL,EAAUK,cACnDC,EAASP,EAAShnC,KAAKjD,GACvByqC,EAAUP,EAAUjnC,KAAKjD,GAC/B,GAAIyqC,EAAQj7B,OAAQ,CAClB,MAAM45B,EAAY,CAAC,EACnB,GAA6B,iBAAlBoB,EAAOh7B,OAChB45B,EAAM55B,OACsB,iBAAnBi7B,EAAQj7B,OAAsBxP,EAASyqC,EAAQj7B,YAExD,GAA8B,iBAAnBi7B,EAAQj7B,OACI,MAAjBg7B,EAAOh7B,OACT45B,EAAM9oC,OAASkqC,EAAOlqC,OAEtB8oC,EAAM55B,OAASg7B,EAAOh7B,WAEnB,CACL,MAAMk7B,EAA0B,MAAjBF,EAAOh7B,OAAiB,SAAW,UAC3Cw5B,EAAW2B,EAAUC,GAAa7B,EACvCyB,EAAOE,GACPD,EAAQj7B,QAEJ7D,EAAUlL,EAAM0oC,WAAWH,GACjCI,EAAMsB,GAAU,CACd,CAAC1B,GAAYr9B,EAAQgH,QACnBg4B,EACAC,EACW,WAAXF,IAMR,MAAM/mC,EAAa,UAAagP,QAC9B63B,EAAO7mC,WACP8mC,EAAQ9mC,WACiB,iBAAlB6mC,EAAOh7B,QAQhB,GANI7L,IACFylC,EAAMzlC,WAAaA,GAErBhE,EAAMmM,KAAKs9B,IAIRc,EAAUH,WACXn3B,EAAQjT,EAAMwP,IAAIxP,EAAMwP,IAAInP,OAAS,GAAIopC,GACzC,CACA,MAAMn8B,EAAO,IAAIxM,EAAMwpC,EAASh9B,QAChC,OAAOtN,EAAM4O,OAAOtB,GAAMq8B,YAMF,iBAAnBmB,EAAQp6B,SACW,iBAAlBm6B,EAAOh7B,QACa,iBAAlBg7B,EAAOh7B,QAAyC,OAAlBg7B,EAAOh7B,SAE/C7P,EAAMmM,KAAK2+B,GAIjB,OAAO9qC,EAAM2pC,MACf,CAEA,MAAA/6B,CAAOhG,GACL,MAAM5I,EAAQ,IAAIc,EAAMb,KAAKuP,IAAI5B,SAKjC,OAJIhF,EAAM4G,IAAInP,OAAS,IACrBL,EAAMmM,KAAKvD,EAAM4G,IAAI,IACrBxP,EAAMwP,IAAMxP,EAAMwP,IAAIZ,OAAOhG,EAAM4G,IAAI5B,MAAM,KAExC5N,CACT,CAEA,IAAAkQ,CAAKtH,EAAc0V,GACjB,GAAIre,KAAKuP,MAAQ5G,EAAM4G,IACrB,OAAO,IAAI1O,EAEb,MAAMoqC,EAAU,CAACjrC,KAAM2I,GAAOnE,KAAKzE,GAC1BA,EACJyE,KAAKsK,IACJ,GAAiB,MAAbA,EAAGpO,OACL,MAA4B,iBAAdoO,EAAGpO,OAAsBoO,EAAGpO,OAASuoC,EAGrD,MAAM,IAAI5xB,MAAM,kBADHtX,IAAU4I,EAAQ,KAAO,QACI,gBAAgB,IAE3DhC,KAAK,MAEJukC,EAAW,IAAIrqC,EACfsqC,EAAal7B,EAAKg7B,EAAQ,GAAIA,EAAQ,GAAI5sB,GAAQ,GAClDgsB,EAAW,IAAI,UAAWrqC,KAAKuP,KAC/B+6B,EAAY,IAAI,UAAW3hC,EAAM4G,KAoCvC,OAnCA47B,EAAWzmC,SAAS+c,IAClB,IAAIrhB,EAASqhB,EAAU,GAAGrhB,OAC1B,KAAOA,EAAS,GAAG,CACjB,IAAIgrC,EAAW,EACf,OAAQ3pB,EAAU,IAChB,KAAKxR,EAAKwpB,OACR2R,EAAW3pC,KAAKC,IAAI4oC,EAAUK,aAAcvqC,GAC5C8qC,EAASh/B,KAAKo+B,EAAUjnC,KAAK+nC,IAC7B,MACF,KAAKn7B,EAAKypB,OACR0R,EAAW3pC,KAAKC,IAAItB,EAAQiqC,EAASM,cACrCN,EAAShnC,KAAK+nC,GACdF,EAASz6B,OAAO26B,GAChB,MACF,KAAKn7B,EAAK0pB,MACRyR,EAAW3pC,KAAKC,IACd2oC,EAASM,aACTL,EAAUK,aACVvqC,GAEF,MAAMwqC,EAASP,EAAShnC,KAAK+nC,GACvBP,EAAUP,EAAUjnC,KAAK+nC,GAC3Bp4B,EAAQ43B,EAAOlqC,OAAQmqC,EAAQnqC,QACjCwqC,EAASt7B,OACPw7B,EACA,UAAan7B,KAAK26B,EAAO7mC,WAAY8mC,EAAQ9mC,aAG/CmnC,EAASh/B,KAAK2+B,GAASp6B,OAAO26B,GAIpChrC,GAAUgrC,MAGPF,EAASxB,MAClB,CAEA,QAAA2B,CACE9F,EAKA+F,EAAU,MAEV,MAAMpB,EAAO,IAAI,UAAWlqC,KAAKuP,KACjC,IAAIlN,EAAO,IAAIxB,EACXkoB,EAAI,EACR,KAAOmhB,EAAKC,WAAW,CACrB,GAAwB,WAApBD,EAAKQ,WACP,OAEF,MAAME,EAASV,EAAKM,OACdzjC,EAAQ,UAAG3G,OAAOwqC,GAAUV,EAAKS,aACjC3pC,EACqB,iBAAlB4pC,EAAOlqC,OACVkqC,EAAOlqC,OAAOoI,QAAQwiC,EAASvkC,GAASA,GACvC,EACP,GAAI/F,EAAQ,EACVqB,EAAK6J,KAAKg+B,EAAK7mC,aACV,GAAIrC,EAAQ,EACjBqB,EAAK6J,KAAKg+B,EAAK7mC,KAAKrC,QACf,CACL,IAA0D,IAAtDukC,EAAUljC,EAAM6nC,EAAK7mC,KAAK,GAAGU,YAAc,CAAC,EAAGglB,GACjD,OAEFA,GAAK,EACL1mB,EAAO,IAAIxB,GAGXwB,EAAKjC,SAAW,GAClBmlC,EAAUljC,EAAM,CAAC,EAAG0mB,EAExB,CAEA,MAAA6f,CAAOC,GACL,MAAM0C,EAAW,IAAI1qC,EAqCrB,OApCAb,KAAKQ,QAAO,CAACgrC,EAAW18B,KACtB,GAAIA,EAAGpO,OACL6qC,EAAS96B,OAAO,UAAGrQ,OAAO0O,QACrB,IAAyB,iBAAdA,EAAGc,QAAwC,MAAjBd,EAAG/K,WAE7C,OADAwnC,EAAS37B,OAAOd,EAAGc,QACZ47B,EAAY18B,EAAGc,OACjB,GAAId,EAAG2B,QAA+B,iBAAd3B,EAAGc,OAAqB,CACrD,MAAMxP,EAAU0O,EAAG2B,QAAU3B,EAAGc,OAYhC,OAXci5B,EAAKl7B,MAAM69B,EAAWA,EAAYprC,GAC1CsE,SAAS+mC,IACT38B,EAAG2B,OACL86B,EAASr/B,KAAKu/B,GACL38B,EAAGc,QAAUd,EAAG/K,YACzBwnC,EAAS37B,OACP,UAAGxP,OAAOqrC,GACV,UAAa7C,OAAO95B,EAAG/K,WAAY0nC,EAAO1nC,gBAIzCynC,EAAYprC,EACd,GAAyB,iBAAd0O,EAAGc,QAAqC,OAAdd,EAAGc,OAAiB,CAC9D,MAAMjC,EAAQk7B,EAAKl7B,MAAM69B,EAAWA,EAAY,GAC1CC,EAAS,IAAI,UAAW99B,EAAM4B,KAAKlM,QAClC+lC,EAAWsC,EAAQC,GAAcxC,EACtCr6B,EAAGc,OACH67B,EAAO/qC,QAEHqL,EAAUlL,EAAM0oC,WAAWH,GAKjC,OAJAmC,EAAS37B,OACP,CAAE,CAACw5B,GAAYr9B,EAAQ68B,OAAO8C,EAAQC,IACtC,UAAa/C,OAAO95B,EAAG/K,WAAY0nC,EAAO1nC,aAErCynC,EAAY,GAErB,OAAOA,CAAS,GACf,GACID,EAAS7B,MAClB,CAIA,SAAA3M,CAAUC,EAAqB+L,GAAW,GAExC,GADAA,IAAaA,EACM,iBAAR/L,EACT,OAAOh9B,KAAKke,kBAAkB8e,EAAK+L,GAErC,MAAMpgC,EAAeq0B,EACfqN,EAAW,IAAI,UAAWrqC,KAAKuP,KAC/B+6B,EAAY,IAAI,UAAW3hC,EAAM4G,KACjCxP,EAAQ,IAAIc,EAClB,KAAOwpC,EAASF,WAAaG,EAAUH,WACrC,GAC0B,WAAxBE,EAASK,aACR3B,GAAqC,WAAzBuB,EAAUI,WAGlB,GAA6B,WAAzBJ,EAAUI,WACnB3qC,EAAMmM,KAAKo+B,EAAUjnC,YAChB,CACL,MAAMjD,EAASqB,KAAKC,IAAI2oC,EAASM,aAAcL,EAAUK,cACnDC,EAASP,EAAShnC,KAAKjD,GACvByqC,EAAUP,EAAUjnC,KAAKjD,GAC/B,GAAIwqC,EAAOn6B,OAET,SACK,GAAIo6B,EAAQp6B,OACjB1Q,EAAMmM,KAAK2+B,OACN,CACL,MAAME,EAAWH,EAAOh7B,OAClBo7B,EAAYH,EAAQj7B,OAC1B,IAAIg8B,EACmB,iBAAdZ,GAAwC,OAAdA,EAC7BA,EACA5qC,EACN,GACsB,iBAAb2qC,GACM,OAAbA,GACqB,iBAAdC,GACO,OAAdA,EACA,CACA,MAAM5B,EAAY96B,OAAOC,KAAKw8B,GAAU,GACxC,GAAI3B,IAAc96B,OAAOC,KAAKy8B,GAAW,GAAI,CAC3C,MAAMj/B,EAAUlL,EAAM0oC,WAAWH,GAC7Br9B,IACF6/B,EAAkB,CAChB,CAACxC,GAAYr9B,EAAQgxB,UACnBgO,EAAS3B,GACT4B,EAAU5B,GACVL,MAQVhpC,EAAM6P,OACJg8B,EACA,UAAa7O,UACX6N,EAAO7mC,WACP8mC,EAAQ9mC,WACRglC,UA9CNhpC,EAAM6P,OAAO,UAAGxP,OAAOiqC,EAAShnC,SAoDpC,OAAOtD,EAAM2pC,MACf,CAEA,iBAAAxrB,CAAkBld,EAAe+nC,GAAW,GAC1CA,IAAaA,EACb,MAAMsB,EAAW,IAAI,UAAWrqC,KAAKuP,KACrC,IAAI3J,EAAS,EACb,KAAOykC,EAASF,WAAavkC,GAAU5E,GAAO,CAC5C,MAAMZ,EAASiqC,EAASM,aAClBkB,EAAWxB,EAASK,WAC1BL,EAAShnC,OACQ,WAAbwoC,GAGoB,WAAbA,IAA0BjmC,EAAS5E,IAAU+nC,KACtD/nC,GAASZ,GAEXwF,GAAUxF,GALRY,GAASS,KAAKC,IAAItB,EAAQY,EAAQ4E,GAOtC,OAAO5E,CACT,EA/gBO,EAAAyO,GAAK,UACL,EAAAu5B,WAAa,UACb,EAAAh5B,aAAe,UACP,EAAAqe,SAA2D,CAAC,EA+gB7E,UAAextB,EAKbrB,EAAOD,QAAUsB,EACjBrB,EAAOD,QAAP,QAAyBsB,mCChjB3B,IAAU4O,mDAAV,SAAUA,GACQ,EAAArP,OAAhB,SAAuB0O,GACrB,MAAyB,iBAAdA,EAAG2B,OACL3B,EAAG2B,OACoB,iBAAd3B,EAAGc,OACZd,EAAGc,OACoB,iBAAdd,EAAGc,QAAqC,OAAdd,EAAGc,OACtC,EAEqB,iBAAdd,EAAGpO,OAAsBoO,EAAGpO,OAAON,OAAS,CAE9D,CACD,CAZD,CAAUqP,IAAAA,EAAE,KAcZ,UAAeA,sFCzBf,gBAEA,gBAKE,WAAAtK,CAAYoK,GACVvP,KAAKuP,IAAMA,EACXvP,KAAKgB,MAAQ,EACbhB,KAAK4F,OAAS,CAChB,CAEA,OAAAukC,GACE,OAAOnqC,KAAK2qC,aAAeV,GAC7B,CAEA,IAAA5mC,CAAKjD,GACEA,IACHA,EAAS6pC,KAEX,MAAMG,EAASpqC,KAAKuP,IAAIvP,KAAKgB,OAC7B,GAAIopC,EAAQ,CACV,MAAMxkC,EAAS5F,KAAK4F,OACdwlC,EAAW,UAAGhrC,OAAOgqC,GAQ3B,GAPIhqC,GAAUgrC,EAAWxlC,GACvBxF,EAASgrC,EAAWxlC,EACpB5F,KAAKgB,OAAS,EACdhB,KAAK4F,OAAS,GAEd5F,KAAK4F,QAAUxF,EAEY,iBAAlBgqC,EAAO35B,OAChB,MAAO,CAAEA,OAAQrQ,GACZ,CACL,MAAM0rC,EAAY,CAAC,EAkBnB,OAjBI1B,EAAOrmC,aACT+nC,EAAM/nC,WAAaqmC,EAAOrmC,YAEC,iBAAlBqmC,EAAOx6B,OAChBk8B,EAAMl8B,OAASxP,EAEU,iBAAlBgqC,EAAOx6B,QACI,OAAlBw6B,EAAOx6B,OAGPk8B,EAAMl8B,OAASw6B,EAAOx6B,OACY,iBAAlBw6B,EAAO1pC,OACvBorC,EAAMprC,OAAS0pC,EAAO1pC,OAAOqrC,OAAOnmC,EAAQxF,GAG5C0rC,EAAMprC,OAAS0pC,EAAO1pC,OAEjBorC,GAGT,MAAO,CAAEl8B,OAAQq6B,IAErB,CAEA,IAAAO,GACE,OAAOxqC,KAAKuP,IAAIvP,KAAKgB,MACvB,CAEA,UAAA2pC,GACE,OAAI3qC,KAAKuP,IAAIvP,KAAKgB,OAET,UAAGZ,OAAOJ,KAAKuP,IAAIvP,KAAKgB,QAAUhB,KAAK4F,OAEvCqkC,GAEX,CAEA,QAAAS,GACE,MAAM57B,EAAK9O,KAAKuP,IAAIvP,KAAKgB,OACzB,OAAI8N,EACuB,iBAAdA,EAAG2B,OACL,SAEc,iBAAd3B,EAAGc,QACY,iBAAdd,EAAGc,QAAqC,OAAdd,EAAGc,OAE9B,SAEA,SAGJ,QACT,CAEA,IAAAvC,GACE,GAAKrN,KAAKmqC,UAEH,IAAoB,IAAhBnqC,KAAK4F,OACd,OAAO5F,KAAKuP,IAAI5B,MAAM3N,KAAKgB,OACtB,CACL,MAAM4E,EAAS5F,KAAK4F,OACd5E,EAAQhB,KAAKgB,MACbqC,EAAOrD,KAAKqD,OACZgK,EAAOrN,KAAKuP,IAAI5B,MAAM3N,KAAKgB,OAGjC,OAFAhB,KAAK4F,OAASA,EACd5F,KAAKgB,MAAQA,EACN,CAACqC,GAAMsL,OAAOtB,IAVrB,MAAO,EAYX,sEC5FF,cCQA,EAVA,SAAsBgvB,EAAOnsB,GAE3B,IADA,IAAI9P,EAASi8B,EAAMj8B,OACZA,KACL,IAAI,EAAA4/B,EAAA,GAAG3D,EAAMj8B,GAAQ,GAAI8P,GACvB,OAAO9P,EAGX,OAAQ,CACV,ECZI40B,EAHa/sB,MAAMgd,UAGC+P,OCOxB,SAASyK,EAAUrnB,GACjB,IAAIpX,GAAS,EACTZ,EAAoB,MAAXgY,EAAkB,EAAIA,EAAQhY,OAG3C,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGAC,EAAUxa,UAAUnL,MHlBpB,WACE9Z,KAAK4/B,SAAW,GAChB5/B,KAAK48B,KAAO,CACd,EGgBA6C,EAAUxa,UAAkB,ODT5B,SAAyB/U,GACvB,IAAInK,EAAO/F,KAAK4/B,SACZ5+B,EAAQ,EAAa+E,EAAMmK,GAE/B,QAAIlP,EAAQ,IAIRA,GADY+E,EAAK3F,OAAS,EAE5B2F,EAAKzB,MAEL0wB,EAAOtpB,KAAK3F,EAAM/E,EAAO,KAEzBhB,KAAK48B,KACA,GACT,ECLA6C,EAAUxa,UAAUlb,IChBpB,SAAsBmG,GACpB,IAAInK,EAAO/F,KAAK4/B,SACZ5+B,EAAQ,EAAa+E,EAAMmK,GAE/B,OAAOlP,EAAQ,OAAIX,EAAY0F,EAAK/E,GAAO,EAC7C,EDYAy+B,EAAUxa,UAAU2D,IEjBpB,SAAsB1Y,GACpB,OAAO,EAAalQ,KAAK4/B,SAAU1vB,IAAQ,CAC7C,EFgBAuvB,EAAUxa,UAAUrM,IGjBpB,SAAsB1I,EAAKvP,GACzB,IAAIoF,EAAO/F,KAAK4/B,SACZ5+B,EAAQ,EAAa+E,EAAMmK,GAQ/B,OANIlP,EAAQ,KACRhB,KAAK48B,KACP72B,EAAKmG,KAAK,CAACgE,EAAKvP,KAEhBoF,EAAK/E,GAAO,GAAKL,EAEZX,IACT,EHQA,mEI3BI0+B,GAAM,OAAU,IAAM,OAE1B,6ECDA,GAFmB,aAAUpwB,OAAQ,UCMjC,EAHcA,OAAO2W,UAGQqI,eCH7B,EAHchf,OAAO2W,UAGQqI,eCOjC,SAASiS,EAAKnnB,GACZ,IAAIpX,GAAS,EACTZ,EAAoB,MAAXgY,EAAkB,EAAIA,EAAQhY,OAG3C,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGAD,EAAKta,UAAUnL,MChBf,WACE9Z,KAAK4/B,SAAW,EAAe,EAAa,MAAQ,CAAC,EACrD5/B,KAAK48B,KAAO,CACd,EDcA2C,EAAKta,UAAkB,OEhBvB,SAAoB/U,GAClB,IAAIwsB,EAAS18B,KAAK4oB,IAAI1Y,WAAelQ,KAAK4/B,SAAS1vB,GAEnD,OADAlQ,KAAK48B,MAAQF,EAAS,EAAI,EACnBA,CACT,EFaA6C,EAAKta,UAAUlb,IFPf,SAAiBmG,GACf,IAAInK,EAAO/F,KAAK4/B,SAChB,GAAI,EAAc,CAChB,IAAIlD,EAAS32B,EAAKmK,GAClB,MArBiB,8BAqBVwsB,OAA4Br8B,EAAYq8B,CACjD,CACA,OAAO,EAAehxB,KAAK3F,EAAMmK,GAAOnK,EAAKmK,QAAO7P,CACtD,EECAk/B,EAAKta,UAAU2D,IDXf,SAAiB1Y,GACf,IAAInK,EAAO/F,KAAK4/B,SAChB,OAAO,OAA8Bv/B,IAAd0F,EAAKmK,GAAsB,EAAexE,KAAK3F,EAAMmK,EAC9E,ECSAqvB,EAAKta,UAAUrM,IGdf,SAAiB1I,EAAKvP,GACpB,IAAIoF,EAAO/F,KAAK4/B,SAGhB,OAFA5/B,KAAK48B,MAAQ58B,KAAK4oB,IAAI1Y,GAAO,EAAI,EACjCnK,EAAKmK,GAAQ,QAA0B7P,IAAVM,EAfV,4BAekDA,EAC9DX,IACT,EHWA,4BIdA,EAPA,SAAoBwE,EAAK0L,GACvB,ICJiBvP,EACb8G,EDGA1B,EAAOvB,EAAIo7B,SACf,OCHgB,WADZn4B,SADa9G,EDKAuP,KCHmB,UAARzI,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAV9G,EACU,OAAVA,GDEDoF,EAAmB,iBAAPmK,EAAkB,SAAW,QACzCnK,EAAKvB,GACX,EEFA,SAASk7B,EAAStnB,GAChB,IAAIpX,GAAS,EACTZ,EAAoB,MAAXgY,EAAkB,EAAIA,EAAQhY,OAG3C,IADAJ,KAAK8Z,UACI9Y,EAAQZ,GAAQ,CACvB,IAAIo/B,EAAQpnB,EAAQpX,GACpBhB,KAAK4Y,IAAI4mB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGAE,EAASza,UAAUnL,MCdnB,WACE9Z,KAAK48B,KAAO,EACZ58B,KAAK4/B,SAAW,CACd,KAAQ,IAAI,EACZ,IAAO,IAAK,KAAO,KACnB,OAAU,IAAI,EAElB,EDQAF,EAASza,UAAkB,OEf3B,SAAwB/U,GACtB,IAAIwsB,EAAS,EAAW18B,KAAMkQ,GAAa,OAAEA,GAE7C,OADAlQ,KAAK48B,MAAQF,EAAS,EAAI,EACnBA,CACT,EFYAgD,EAASza,UAAUlb,IGhBnB,SAAqBmG,GACnB,OAAO,EAAWlQ,KAAMkQ,GAAKnG,IAAImG,EACnC,EHeAwvB,EAASza,UAAU2D,IIjBnB,SAAqB1Y,GACnB,OAAO,EAAWlQ,KAAMkQ,GAAK0Y,IAAI1Y,EACnC,EJgBAwvB,EAASza,UAAUrM,IKjBnB,SAAqB1I,EAAKvP,GACxB,IAAIoF,EAAO,EAAW/F,KAAMkQ,GACxB0sB,EAAO72B,EAAK62B,KAIhB,OAFA72B,EAAK6S,IAAI1I,EAAKvP,GACdX,KAAK48B,MAAQ72B,EAAK62B,MAAQA,EAAO,EAAI,EAC9B58B,IACT,ELYA,6GMjBA,SAAS2/B,EAAMvnB,GACb,IAAIrS,EAAO/F,KAAK4/B,SAAW,IAAI,IAAUxnB,GACzCpY,KAAK48B,KAAO72B,EAAK62B,IACnB,CAGA+C,EAAM1a,UAAUnL,MCXhB,WACE9Z,KAAK4/B,SAAW,IAAI,IACpB5/B,KAAK48B,KAAO,CACd,EDSA+C,EAAM1a,UAAkB,OEZxB,SAAqB/U,GACnB,IAAInK,EAAO/F,KAAK4/B,SACZlD,EAAS32B,EAAa,OAAEmK,GAG5B,OADAlQ,KAAK48B,KAAO72B,EAAK62B,KACVF,CACT,EFOAiD,EAAM1a,UAAUlb,IGbhB,SAAkBmG,GAChB,OAAOlQ,KAAK4/B,SAAS71B,IAAImG,EAC3B,EHYAyvB,EAAM1a,UAAU2D,IIdhB,SAAkB1Y,GAChB,OAAOlQ,KAAK4/B,SAAShX,IAAI1Y,EAC3B,EJaAyvB,EAAM1a,UAAUrM,IKPhB,SAAkB1I,EAAKvP,GACrB,IAAIoF,EAAO/F,KAAK4/B,SAChB,GAAI75B,aAAgB,IAAW,CAC7B,IAAIw9B,EAAQx9B,EAAK65B,SACjB,IAAK,KAAQ2D,EAAMnjC,OAASojC,IAG1B,OAFAD,EAAMr3B,KAAK,CAACgE,EAAKvP,IACjBX,KAAK48B,OAAS72B,EAAK62B,KACZ58B,KAET+F,EAAO/F,KAAK4/B,SAAW,IAAI,IAAS2D,EACtC,CAGA,OAFAx9B,EAAK6S,IAAI1I,EAAKvP,GACdX,KAAK48B,KAAO72B,EAAK62B,KACV58B,IACT,ELLA,8CMvBI89B,UAAS,EAAKA,OAElB,6CCFIC,UAAa,EAAKA,WAEtB,yECcA,oDCRI,EAHczvB,OAAO2W,UAGQqI,eAqCjC,EA3BA,SAAuB3sB,EAAOojC,GAC5B,IAAIvD,GAAQ,EAAA9xB,EAAA,GAAQ/N,GAChB0nC,GAAS7H,IAAS,EAAA0D,EAAA,GAAYvjC,GAC9B2nC,GAAU9H,IAAU6H,IAAS,EAAA/J,EAAA,GAAS39B,GACtC4nC,GAAU/H,IAAU6H,IAAUC,IAAU,EAAAjD,EAAA,GAAa1kC,GACrD0jC,EAAc7D,GAAS6H,GAASC,GAAUC,EAC1C7L,EAAS2H,EDlBf,SAAmBrL,EAAGsD,GAIpB,IAHA,IAAIt7B,GAAS,EACT07B,EAASz0B,MAAM+wB,KAEVh4B,EAAQg4B,GACf0D,EAAO17B,GAASs7B,EAASt7B,GAE3B,OAAO07B,CACT,CCU6B,CAAU/7B,EAAMP,OAAQgkC,QAAU,GACzDhkC,EAASs8B,EAAOt8B,OAEpB,IAAK,IAAI8P,KAAOvP,GACTojC,IAAa,EAAer4B,KAAK/K,EAAOuP,IACvCm0B,IAEQ,UAAPn0B,GAECo4B,IAAkB,UAAPp4B,GAA0B,UAAPA,IAE9Bq4B,IAAkB,UAAPr4B,GAA0B,cAAPA,GAA8B,cAAPA,KAEtD,OAAQA,EAAK9P,KAElBs8B,EAAOxwB,KAAKgE,GAGhB,OAAOwsB,CACT,kCC3BA,IAXA,SAAmBL,EAAOl4B,GAKxB,IAJA,IAAInD,GAAS,EACTZ,EAAS+D,EAAO/D,OAChBwF,EAASy2B,EAAMj8B,SAEVY,EAAQZ,GACfi8B,EAAMz2B,EAAS5E,GAASmD,EAAOnD,GAEjC,OAAOq7B,CACT,6DCVI/O,EAHchf,OAAO2W,UAGQqI,eAoBjC,IARA,SAAqBwS,EAAQ5vB,EAAKvP,GAChC,IAAIo/B,EAAWD,EAAO5vB,GAChBod,EAAe5hB,KAAKo0B,EAAQ5vB,KAAQ,OAAG6vB,EAAUp/B,UACxCN,IAAVM,GAAyBuP,KAAO4vB,KACnC,OAAgBA,EAAQ5vB,EAAKvP,EAEjC,mDCDA,IAbA,SAAyBm/B,EAAQ5vB,EAAKvP,GACzB,aAAPuP,GAAsB,KACxB,OAAe4vB,EAAQ5vB,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASvP,EACT,UAAY,IAGdm/B,EAAO5vB,GAAOvP,CAElB,2DCHA,IALA,SAAwBm/B,EAAQ4C,EAAUC,GACxC,IAAIjG,EAASgG,EAAS5C,GACtB,OAAO,OAAQA,GAAUpD,GAAS,OAAUA,EAAQiG,EAAY7C,GAClE,kFCdIzC,EAAc/uB,OAAO2W,UAGrB,EAAiBoY,EAAY/P,eAO7BkY,EAAuBnI,EAAY3b,SAGnC+jB,EAAiB,IAAS,IAAOC,iBAAcrlC,ECR/C,EAPciO,OAAO2W,UAOcvD,SCCnC,EAAiB,IAAS,IAAOgkB,iBAAcrlC,EAkBnD,EATA,SAAoBM,GAClB,OAAa,MAATA,OACeN,IAAVM,EAdQ,qBADL,gBAiBJ,GAAkB,KAAkB2N,OAAO3N,GFGrD,SAAmBA,GACjB,IAAIklC,EAAQ,EAAen6B,KAAK/K,EAAO8kC,GACnCn4B,EAAM3M,EAAM8kC,GAEhB,IACE9kC,EAAM8kC,QAAkBplC,EACxB,IAAIylC,GAAW,CACjB,CAAE,MAAOrlB,GAAI,CAEb,IAAIic,EAAS8I,EAAqB95B,KAAK/K,GAQvC,OAPImlC,IACED,EACFllC,EAAM8kC,GAAkBn4B,SAEjB3M,EAAM8kC,IAGV/I,CACT,CEpBM,CAAU/7B,GDNhB,SAAwBA,GACtB,OAAO,EAAqB+K,KAAK/K,EACnC,CCKM,CAAeA,EACrB,mCCZA,IANA,SAAmBm8B,GACjB,OAAO,SAASn8B,GACd,OAAOm8B,EAAKn8B,EACd,CACF,mDCIA,IANA,SAA0BsiC,GACxB,IAAIvG,EAAS,IAAIuG,EAAY99B,YAAY89B,EAAYnB,YAErD,OADA,IAAI,IAAWpF,GAAQ9jB,IAAI,IAAI,IAAWqqB,IACnCvG,CACT,mDCVIX,EAAgC,iBAAXx8B,SAAuBA,UAAYA,QAAQ2pB,UAAY3pB,QAG5Ey8B,EAAaD,GAAgC,iBAAVv8B,QAAsBA,SAAWA,OAAO0pB,UAAY1pB,OAMvFq+B,EAHgB7B,GAAcA,EAAWz8B,UAAYw8B,EAG5B,IAAK8B,YAASx9B,EACvC2rC,EAAcnO,EAASA,EAAOmO,iBAAc3rC,EAqBhD,IAXA,SAAqBygC,EAAQX,GAC3B,GAAIA,EACF,OAAOW,EAAOnzB,QAEhB,IAAIvN,EAAS0gC,EAAO1gC,OAChBs8B,EAASsP,EAAcA,EAAY5rC,GAAU,IAAI0gC,EAAO37B,YAAY/E,GAGxE,OADA0gC,EAAOC,KAAKrE,GACLA,CACT,mDCjBA,IALA,SAAyBsF,EAAY7B,GACnC,IAAIW,EAASX,GAAS,OAAiB6B,EAAWlB,QAAUkB,EAAWlB,OACvE,OAAO,IAAIkB,EAAW78B,YAAY27B,EAAQkB,EAAWH,WAAYG,EAAW5hC,OAC9E,mCCMA,IAXA,SAAmBoZ,EAAQ6iB,GACzB,IAAIr7B,GAAS,EACTZ,EAASoZ,EAAOpZ,OAGpB,IADAi8B,IAAUA,EAAQp0B,MAAM7H,MACfY,EAAQZ,GACfi8B,EAAMr7B,GAASwY,EAAOxY,GAExB,OAAOq7B,CACT,6DCsBA,IA1BA,SAAoB7iB,EAAQipB,EAAO3C,EAAQO,GACzC,IAAI4L,GAASnM,EACbA,IAAWA,EAAS,CAAC,GAKrB,IAHA,IAAI9+B,GAAS,EACTZ,EAASqiC,EAAMriC,SAEVY,EAAQZ,GAAQ,CACvB,IAAI8P,EAAMuyB,EAAMzhC,GAEZkiC,EAAW7C,EACXA,EAAWP,EAAO5vB,GAAMsJ,EAAOtJ,GAAMA,EAAK4vB,EAAQtmB,QAClDnZ,OAEaA,IAAb6iC,IACFA,EAAW1pB,EAAOtJ,IAEhB+7B,GACF,OAAgBnM,EAAQ5vB,EAAKgzB,IAE7B,OAAYpD,EAAQ5vB,EAAKgzB,EAE7B,CACA,OAAOpD,CACT,mDCnCIoM,EAAkB,WACpB,IACE,IAAIpP,GAAO,OAAUxuB,OAAQ,kBAE7B,OADAwuB,EAAK,CAAC,EAAG,GAAI,CAAC,GACPA,CACT,CAAE,MAAOrc,GAAI,CACf,CANqB,GAQrB,uCCTA,IAAIkb,EAA8B,iBAAVwQ,QAAsBA,QAAUA,OAAO79B,SAAWA,QAAU69B,OAEpF,2ECYA,IAJA,SAAoBrM,GAClB,OAAO,OAAeA,EAAQ,IAAM,IACtC,yECTM5C,YCCN,UAFiB,EAAK,sBDAlBK,GACEL,EAAM,SAASM,KAAK,GAAc,EAAWjvB,MAAQ,EAAWA,KAAKkvB,UAAY,KACvE,iBAAmBP,EAAO,sBEOtC1B,EAAe,8BAGf4B,EAAYtB,SAAS7W,UACrBoY,EAAc/uB,OAAO2W,UAGrByY,EAAeN,EAAU1b,SAGzB,EAAiB2b,EAAY/P,eAG7BsQ,EAAaza,OAAO,IACtBua,EAAahyB,KAAK,GAAgBvC,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,KAmBhF,EARA,SAAsBxI,GACpB,UAAK,EAAA4/B,EAAA,GAAS5/B,KFxBEm8B,EEwBiBn8B,EFvBxB48B,GAAeA,KAAcT,OE0BxB,EAAAuG,EAAA,GAAW1iC,GAASi9B,EAAapC,GAChC/R,MAAK,OAAS9oB,IF5B/B,IAAkBm8B,CE6BlB,EC5BA,EALA,SAAmBgD,EAAQ5vB,GACzB,IAAIvP,ECJN,SAAkBm/B,EAAQ5vB,GACxB,OAAiB,MAAV4vB,OAAiBz/B,EAAYy/B,EAAO5vB,EAC7C,CDEc,CAAS4vB,EAAQ5vB,GAC7B,OAAO,EAAavP,GAASA,OAAQN,CACvC,yCEXI29B,GAAe,aAAQ1vB,OAAO2vB,eAAgB3vB,QAElD,yECmBA,cCjBI6vB,EAHc7vB,OAAO2W,UAGckZ,qBAGnCC,EAAmB9vB,OAAO6f,sBAmB9B,EAVkBiQ,EAA+B,SAAS0B,GACxD,OAAc,MAAVA,EACK,IAETA,EAASxxB,OAAOwxB,GDdlB,SAAqBzD,EAAOkJ,GAM1B,IALA,IAAIvkC,GAAS,EACTZ,EAAkB,MAATi8B,EAAgB,EAAIA,EAAMj8B,OACnC8nC,EAAW,EACXxL,EAAS,KAEJ17B,EAAQZ,GAAQ,CACvB,IAAIO,EAAQ07B,EAAMr7B,GACdukC,EAAU5kC,EAAOK,EAAOq7B,KAC1BK,EAAOwL,KAAcvnC,EAEzB,CACA,OAAO+7B,CACT,CCES,CAAY0B,EAAiB0B,IAAS,SAAS2B,GACpD,OAAOtD,EAAqBzyB,KAAKo0B,EAAQ2B,EAC3C,IACF,EARqC2K,EAAA,6FCbrC,GAFe,OAAU,IAAM,sBCE/B,GAFc,OAAU,IAAM,WCE9B,GAFU,OAAU,IAAM,OCE1B,GAFc,OAAU,IAAM,+BCK1BjS,EAAS,eAETG,EAAa,mBACbE,EAAS,eACTG,EAAa,mBAEbE,EAAc,oBAGdiE,GAAqB,OAAS,GAC9BE,GAAgB,OAAS,KACzBC,GAAoB,OAAS,GAC7BC,GAAgB,OAAS,GACzBC,GAAoB,OAAS,GAS7ByB,EAAS,KAGR,GAAYA,EAAO,IAAI,EAAS,IAAI8C,YAAY,MAAQ7I,GACxD,KAAO+F,EAAO,IAAI,MAAQzG,GAC1B,GAAWyG,EAAO,EAAQ+C,YAAcrJ,GACxC,GAAOsG,EAAO,IAAI,IAAQpG,GAC1B,GAAWoG,EAAO,IAAI,IAAYjG,KACrCiG,EAAS,SAASjgC,GAChB,IAAI+7B,GAAS,OAAW/7B,GACpB+gC,EA/BQ,mBA+BDhF,EAAsB/7B,EAAMwE,iBAAc9E,EACjDujC,EAAalC,GAAO,OAASA,GAAQ,GAEzC,GAAIkC,EACF,OAAQA,GACN,KAAK9E,EAAoB,OAAOjE,EAChC,KAAKmE,EAAe,OAAO7E,EAC3B,KAAK8E,EAAmB,OAAO3E,EAC/B,KAAK4E,EAAe,OAAO1E,EAC3B,KAAK2E,EAAmB,OAAOxE,EAGnC,OAAO+B,CACT,GAGF,wFCtDIwB,EAAe5vB,OAAO7J,OA0B1B,EAhBkB,WAChB,SAASq7B,IAAU,CACnB,OAAO,SAASoB,GACd,KAAK,EAAAX,EAAA,GAASW,GACZ,MAAO,CAAC,EAEV,GAAIhD,EACF,OAAOA,EAAagD,GAEtBpB,EAAO7a,UAAYic,EACnB,IAAIxE,EAAS,IAAIoD,EAEjB,OADAA,EAAO7a,eAAY5kB,EACZq8B,CACT,CACF,CAdiB,sBCIjB,EANA,SAAyBoD,GACvB,MAAqC,mBAAtBA,EAAO36B,cAA8B,OAAY26B,GAE5D,CAAC,EADD,GAAW,OAAaA,GAE9B,mCCdA,IAGIrE,EAAW,mBAoBf,IAVA,SAAiB96B,EAAOP,GACtB,IAAIqH,SAAc9G,EAGlB,SAFAP,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAARqH,GACU,UAARA,GAAoBg0B,EAAShS,KAAK9oB,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQP,CACjD,kCCrBA,IAAIi9B,EAAc/uB,OAAO2W,UAgBzB,IAPA,SAAqBtkB,GACnB,IAAI+gC,EAAO/gC,GAASA,EAAMwE,YAG1B,OAAOxE,KAFqB,mBAAR+gC,GAAsBA,EAAKzc,WAAcoY,EAG/D,mDCZItB,EAAgC,iBAAXx8B,SAAuBA,UAAYA,QAAQ2pB,UAAY3pB,QAG5Ey8B,EAAaD,GAAgC,iBAAVv8B,QAAsBA,SAAWA,OAAO0pB,UAAY1pB,OAMvFylC,EAHgBjJ,GAAcA,EAAWz8B,UAAYw8B,GAGtB,IAAWmJ,QAG1CC,EAAY,WACd,IAIE,OAFYnJ,GAAcA,EAAWqQ,SAAWrQ,EAAWqQ,QAAQ,QAAQp/B,OAOpEg4B,GAAeA,EAAYnb,SAAWmb,EAAYnb,QAAQ,OACnE,CAAE,MAAOrJ,GAAI,CACf,CAZe,GAcf,uCCfA,IANA,SAAiBqc,EAAMC,GACrB,OAAO,SAASC,GACd,OAAOF,EAAKC,EAAUC,GACxB,CACF,mDCTInB,EAA0B,iBAARl8B,MAAoBA,MAAQA,KAAK2O,SAAWA,QAAU3O,KAGxEN,EAAO,KAAcw8B,GAAYC,SAAS,cAATA,GAErC,uCCPA,IAGI4B,EAHY5B,SAAS7W,UAGIvD,SAqB7B,IAZA,SAAkBob,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAOY,EAAahyB,KAAKoxB,EAC3B,CAAE,MAAOrc,GAAI,CACb,IACE,OAAQqc,EAAO,EACjB,CAAE,MAAOrc,GAAI,CACf,CACA,MAAO,EACT,sLCCA,EAlBuBnS,OAAO6f,sBASqB,SAAS2R,GAE1D,IADA,IAAIpD,EAAS,GACNoD,IACL,OAAUpD,GAAQ,OAAWoD,IAC7BA,GAAS,OAAaA,GAExB,OAAOpD,CACT,EAPuC0P,EAAA,sBCCvC,EAJA,SAAsBtM,GACpB,OAAO,OAAeA,EAAQwM,EAAA,EAAQ,EACxC,YCVI,EAHch+B,OAAO2W,UAGQqI,yBCH7BiO,EAAU,gBCEV6D,EAAc,IAAS,IAAOna,eAAY5kB,EAC1Cg/B,EAAgBD,EAAcA,EAAYE,aAAUj/B,YCwExD,EApCA,SAAwBy/B,EAAQxyB,EAAK6yB,GACnC,ID5BmBsB,EDHAU,EACfzF,EE8BAgF,EAAO5B,EAAO36B,YAClB,OAAQmI,GACN,IA3BiB,uBA4Bf,OAAO,OAAiBwyB,GAE1B,IAvCU,mBAwCV,IAvCU,gBAwCR,OAAO,IAAI4B,GAAM5B,GAEnB,IAjCc,oBAkCZ,OCzCN,SAAuB8B,EAAUzB,GAC/B,IAAIW,EAASX,GAAS,OAAiByB,EAASd,QAAUc,EAASd,OACnE,OAAO,IAAIc,EAASz8B,YAAY27B,EAAQc,EAASC,WAAYD,EAASE,WACxE,CDsCa,CAAchC,EAAQK,GAE/B,IAnCa,wBAmCI,IAlCJ,wBAmCb,IAlCU,qBAkCI,IAjCH,sBAiCkB,IAhClB,sBAiCX,IAhCW,sBAgCI,IA/BG,6BA+BmB,IA9BzB,uBA8ByC,IA7BzC,uBA8BV,OAAO,OAAgBL,EAAQK,GAEjC,IAjDS,eA2DT,IAxDS,eAyDP,OAAO,IAAIuB,EARb,IAnDY,kBAoDZ,IAjDY,kBAkDV,OAAO,IAAIA,EAAK5B,GAElB,IAtDY,kBAuDV,OFvDApD,EAAS,IADMyF,EEwDIrC,GFvDC36B,YAAYg9B,EAAO3oB,OAAQ+hB,EAAQiC,KAAK2E,KACzDC,UAAYD,EAAOC,UACnB1F,EE0DL,IAzDY,kBA0DV,OD3De+E,EC2DI3B,ED1DhBT,EAAgB/wB,OAAO+wB,EAAc3zB,KAAK+1B,IAAW,CAAC,EC4D/D,4DErEI8K,EAAY,KAAY,IAASC,MAqBrC,EAFYD,GAAY,OAAUA,GCXlC,SAAmB5rC,GACjB,OAAO,EAAAqjC,EAAA,GAAarjC,IAVT,iBAUmB,OAAOA,EACvC,WCVI8rC,EAAY,KAAY,IAASC,MAqBrC,EAFYD,GAAY,OAAUA,GCXlC,SAAmB9rC,GACjB,OAAO,EAAAqjC,EAAA,GAAarjC,IAVT,iBAUmB,OAAOA,EACvC,ECcIm5B,EAAU,qBAKVG,EAAU,oBAIVI,EAAY,kBAoBZqB,EAAgB,CAAC,EACrBA,EAAc5B,GAAW4B,EA7BV,kBA8BfA,EAfqB,wBAeWA,EAdd,qBAelBA,EA9Bc,oBA8BWA,EA7BX,iBA8BdA,EAfiB,yBAeWA,EAdX,yBAejBA,EAdc,sBAcWA,EAbV,uBAcfA,EAbe,uBAaWA,EA5Bb,gBA6BbA,EA5BgB,mBA4BWA,EAAcrB,GACzCqB,EA3BgB,mBA2BWA,EA1Bd,gBA2BbA,EA1BgB,mBA0BWA,EAzBX,mBA0BhBA,EAhBe,uBAgBWA,EAfJ,8BAgBtBA,EAfgB,wBAeWA,EAdX,yBAcsC,EACtDA,EArCe,kBAqCWA,EAAczB,GACxCyB,EA5BiB,qBA4BW,EA8F5B,MA5EA,SAASwE,EAAUv/B,EAAOulC,EAAS7F,EAAYnwB,EAAK4vB,EAAQQ,GAC1D,IAAI5D,EACAyD,EAnEgB,EAmEP+F,EACTyG,EAnEgB,EAmEPzG,EACT9F,EAnEmB,EAmEV8F,EAKb,GAHI7F,IACF3D,EAASoD,EAASO,EAAW1/B,EAAOuP,EAAK4vB,EAAQQ,GAASD,EAAW1/B,SAExDN,IAAXq8B,EACF,OAAOA,EAET,KAAK,EAAA6D,EAAA,GAAS5/B,GACZ,OAAOA,EAET,IAAI6/B,GAAQ,EAAA9xB,EAAA,GAAQ/N,GACpB,GAAI6/B,GAEF,GADA9D,ET7FJ,SAAwBL,GACtB,IAAIj8B,EAASi8B,EAAMj8B,OACfs8B,EAAS,IAAIL,EAAMl3B,YAAY/E,GAOnC,OAJIA,GAA6B,iBAAZi8B,EAAM,IAAkB,EAAe3wB,KAAK2wB,EAAO,WACtEK,EAAO17B,MAAQq7B,EAAMr7B,MACrB07B,EAAO+D,MAAQpE,EAAMoE,OAEhB/D,CACT,CSmFa,CAAe/7B,IACnBw/B,EACH,OAAO,OAAUx/B,EAAO+7B,OAErB,CACL,IAAIpvB,GAAM,OAAO3M,GACbkgC,EAASvzB,GAAO2sB,GA7EX,8BA6EsB3sB,EAE/B,IAAI,EAAAgxB,EAAA,GAAS39B,GACX,OAAO,OAAYA,EAAOw/B,GAE5B,GAAI7yB,GAAO+sB,GAAa/sB,GAAOwsB,GAAY+G,IAAWf,GAEpD,GADApD,EAAUiQ,GAAU9L,EAAU,CAAC,GAAI,OAAgBlgC,IAC9Cw/B,EACH,OAAOwM,EC7Gf,SAAuBnzB,EAAQsmB,GAC7B,OAAO,OAAWtmB,EAAQ,EAAaA,GAASsmB,EAClD,CD4GY,CAAcn/B,EE7G1B,SAAsBm/B,EAAQtmB,GAC5B,OAAOsmB,IAAU,OAAWtmB,GAAQ,EAAA8yB,EAAA,GAAO9yB,GAASsmB,EACtD,CF2GiC,CAAapD,EAAQ/7B,IG9GtD,SAAqB6Y,EAAQsmB,GAC3B,OAAO,OAAWtmB,GAAQ,OAAWA,GAASsmB,EAChD,CH6GY,CAAYn/B,EI9GxB,SAAoBm/B,EAAQtmB,GAC1B,OAAOsmB,IAAU,OAAWtmB,GAAQ,EAAAjL,EAAA,GAAKiL,GAASsmB,EACpD,CJ4G+B,CAAWpD,EAAQ/7B,QAEvC,CACL,IAAK+6B,EAAcpuB,GACjB,OAAOwyB,EAASn/B,EAAQ,CAAC,EAE3B+7B,EAAS,EAAe/7B,EAAO2M,EAAK6yB,EACtC,CACF,CAEAG,IAAUA,EAAQ,IAAI,KACtB,IAAIkC,EAAUlC,EAAMv2B,IAAIpJ,GACxB,GAAI6hC,EACF,OAAOA,EAETlC,EAAM1nB,IAAIjY,EAAO+7B,GAEb,EAAM/7B,GACRA,EAAM+D,SAAQ,SAASs+B,GACrBtG,EAAO/jB,IAAIunB,EAAU8C,EAAUkD,EAAS7F,EAAY2C,EAAUriC,EAAO2/B,GACvE,IACS,EAAM3/B,IACfA,EAAM+D,SAAQ,SAASs+B,EAAU9yB,GAC/BwsB,EAAO9jB,IAAI1I,EAAKgwB,EAAU8C,EAAUkD,EAAS7F,EAAYnwB,EAAKvP,EAAO2/B,GACvE,IAGF,IAAIoC,EAAWtC,EACVuM,EAAS,EAAe,IACxBA,EAASL,EAAA,EAAS/9B,EAAA,EAEnBk0B,EAAQjC,OAAQngC,EAAYqiC,EAAS/hC,GASzC,OKzJF,SAAmB07B,EAAOC,GAIxB,IAHA,IAAIt7B,GAAS,EACTZ,EAAkB,MAATi8B,EAAgB,EAAIA,EAAMj8B,SAE9BY,EAAQZ,IAC8B,IAAzCk8B,EAASD,EAAMr7B,GAAQA,EAAOq7B,KAKtC,CLuIE,CAAUoG,GAAS9hC,GAAO,SAASqiC,EAAU9yB,GACvCuyB,IAEFO,EAAWriC,EADXuP,EAAM8yB,KAIR,OAAYtG,EAAQxsB,EAAKgwB,EAAU8C,EAAUkD,EAAS7F,EAAYnwB,EAAKvP,EAAO2/B,GAChF,IACO5D,CACT,EMvIA,EAJA,SAAmB/7B,GACjB,OAAO,EAAUA,EAAO,EAC1B,mCCUA,IAJA,SAAYA,EAAOgI,GACjB,OAAOhI,IAAUgI,GAAUhI,GAAUA,GAASgI,GAAUA,CAC1D,6FCjBA,EAJA,SAAyBhI,GACvB,OAAO,EAAAqjC,EAAA,GAAarjC,IAVR,uBAUkB,OAAWA,EAC3C,ECXI08B,EAAc/uB,OAAO2W,UAGrB,EAAiBoY,EAAY/P,eAG7B6Q,EAAuBd,EAAYc,qBAoBnC+F,EAAc,EAAgB,WAAa,OAAO/jC,SAAW,CAA/B,IAAsC,EAAkB,SAASQ,GACjG,OAAO,EAAAqjC,EAAA,GAAarjC,IAAU,EAAe+K,KAAK/K,EAAO,YACtDw9B,EAAqBzyB,KAAK/K,EAAO,SACtC,EAEA,oCCZA,IAAI+N,EAAUzG,MAAMyG,QAEpB,iECOA,IAJA,SAAqB/N,GACnB,OAAgB,MAATA,IAAiB,OAASA,EAAMP,WAAY,OAAWO,EAChE,kFC1BIo7B,EAAgC,iBAAXx8B,SAAuBA,UAAYA,QAAQ2pB,UAAY3pB,QAG5Ey8B,EAAaD,GAAgC,iBAAVv8B,QAAsBA,SAAWA,OAAO0pB,UAAY1pB,OAMvFq+B,EAHgB7B,GAAcA,EAAWz8B,UAAYw8B,EAG5B,IAAK8B,YAASx9B,EAwB3C,GArBqBw9B,EAASA,EAAOS,cAAWj+B,ICHhD,WACE,OAAO,CACT,6FCHA,SAASslC,EAASxhC,GAChB,IAAInD,GAAS,EACTZ,EAAmB,MAAV+D,EAAiB,EAAIA,EAAO/D,OAGzC,IADAJ,KAAK4/B,SAAW,IAAI,MACX5+B,EAAQZ,GACfJ,KAAK2Y,IAAIxU,EAAOnD,GAEpB,CAGA2kC,EAAS1gB,UAAUtM,IAAMgtB,EAAS1gB,UAAU/Y,KCV5C,SAAqBvL,GAEnB,OADAX,KAAK4/B,SAAShnB,IAAIjY,EAbC,6BAcZX,IACT,EDQA2lC,EAAS1gB,UAAU2D,IEfnB,SAAqBjoB,GACnB,OAAOX,KAAK4/B,SAAShX,IAAIjoB,EAC3B,EFeA,QGJA,EAZA,SAAmB07B,EAAOkJ,GAIxB,IAHA,IAAIvkC,GAAS,EACTZ,EAAkB,MAATi8B,EAAgB,EAAIA,EAAMj8B,SAE9BY,EAAQZ,GACf,GAAImlC,EAAUlJ,EAAMr7B,GAAQA,EAAOq7B,GACjC,OAAO,EAGX,OAAO,CACT,EC+DA,EA9DA,SAAqBA,EAAO1zB,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GACjE,IAAIuG,EAjBqB,EAiBTX,EACZ0B,EAAYvL,EAAMj8B,OAClBynC,EAAYl/B,EAAMvI,OAEtB,GAAIwnC,GAAaC,KAAehB,GAAagB,EAAYD,GACvD,OAAO,EAGT,IAAIgF,EAAatM,EAAMv2B,IAAIsyB,GACvBwQ,EAAavM,EAAMv2B,IAAIpB,GAC3B,GAAIikC,GAAcC,EAChB,OAAOD,GAAcjkC,GAASkkC,GAAcxQ,EAE9C,IAAIr7B,GAAS,EACT07B,GAAS,EACToL,EA/BuB,EA+Bf5B,EAAoC,IAAI,OAAW7lC,EAM/D,IAJAigC,EAAM1nB,IAAIyjB,EAAO1zB,GACjB23B,EAAM1nB,IAAIjQ,EAAO0zB,KAGRr7B,EAAQ4mC,GAAW,CAC1B,IAAIG,EAAW1L,EAAMr7B,GACjBsmC,EAAW3+B,EAAM3H,GAErB,GAAIq/B,EACF,IAAIkH,EAAWV,EACXxG,EAAWiH,EAAUS,EAAU/mC,EAAO2H,EAAO0zB,EAAOiE,GACpDD,EAAW0H,EAAUT,EAAUtmC,EAAOq7B,EAAO1zB,EAAO23B,GAE1D,QAAiBjgC,IAAbknC,EAAwB,CAC1B,GAAIA,EACF,SAEF7K,GAAS,EACT,KACF,CAEA,GAAIoL,GACF,IAAK,EAAUn/B,GAAO,SAAS2+B,EAAUU,GACnC,GCtDa93B,EDsDO83B,GAANF,ECrDXlf,IAAI1Y,KDsDF63B,IAAaT,GAAYnB,EAAU4B,EAAUT,EAAUpB,EAAS7F,EAAYC,IAC/E,OAAOwH,EAAK57B,KAAK87B,GCxD/B,IAAyB93B,CD0Df,IAAI,CACNwsB,GAAS,EACT,KACF,OACK,GACDqL,IAAaT,IACXnB,EAAU4B,EAAUT,EAAUpB,EAAS7F,EAAYC,GACpD,CACL5D,GAAS,EACT,KACF,CACF,CAGA,OAFA4D,EAAc,OAAEjE,GAChBiE,EAAc,OAAE33B,GACT+zB,CACT,+BEhEA,EAVA,SAAoBl4B,GAClB,IAAIxD,GAAS,EACT07B,EAASz0B,MAAMzD,EAAIo4B,MAKvB,OAHAp4B,EAAIE,SAAQ,SAAS/D,EAAOuP,GAC1BwsB,IAAS17B,GAAS,CAACkP,EAAKvP,EAC1B,IACO+7B,CACT,ECEA,EAVA,SAAoB9jB,GAClB,IAAI5X,GAAS,EACT07B,EAASz0B,MAAM2Q,EAAIgkB,MAKvB,OAHAhkB,EAAIlU,SAAQ,SAAS/D,GACnB+7B,IAAS17B,GAASL,CACpB,IACO+7B,CACT,ECWI0C,EAAc,IAAS,IAAOna,eAAY5kB,EAC1Cg/B,EAAgBD,EAAcA,EAAYE,aAAUj/B,YClBpD,EAHciO,OAAO2W,UAGQqI,qDCI7BwM,EAAU,qBACV4K,EAAW,iBACXrK,EAAY,kBAMZ,EAHc/rB,OAAO2W,UAGQqI,eA6DjC,EA7CA,SAAyBwS,EAAQn3B,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GACtE,IAAI8F,GAAW,EAAA13B,EAAA,GAAQoxB,GACnBuG,GAAW,EAAA33B,EAAA,GAAQ/F,GACnB29B,EAASF,EAAW1B,GAAW,OAAO5E,GACtCyG,EAASF,EAAW3B,GAAW,OAAO/7B,GAKtC69B,GAHJF,EAASA,GAAUxM,EAAUO,EAAYiM,IAGhBjM,EACrBoM,GAHJF,EAASA,GAAUzM,EAAUO,EAAYkM,IAGhBlM,EACrBqM,EAAYJ,GAAUC,EAE1B,GAAIG,IAAa,EAAApI,EAAA,GAASwB,GAAS,CACjC,KAAK,EAAAxB,EAAA,GAAS31B,GACZ,OAAO,EAETy9B,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAEhB,OADAlG,IAAUA,EAAQ,IAAI,KACd8F,IAAY,EAAAf,EAAA,GAAavF,GAC7B,EAAYA,EAAQn3B,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GFdnE,SAAoBR,EAAQn3B,EAAO2E,EAAK44B,EAAS7F,EAAY8F,EAAW7F,GACtE,OAAQhzB,GACN,IAzBc,oBA0BZ,GAAKwyB,EAAOgC,YAAcn5B,EAAMm5B,YAC3BhC,EAAO+B,YAAcl5B,EAAMk5B,WAC9B,OAAO,EAET/B,EAASA,EAAOgB,OAChBn4B,EAAQA,EAAMm4B,OAEhB,IAlCiB,uBAmCf,QAAKhB,EAAOgC,YAAcn5B,EAAMm5B,aAC3BqE,EAAU,IAAI,IAAWrG,GAAS,IAAI,IAAWn3B,KAKxD,IAnDU,mBAoDV,IAnDU,gBAoDV,IAjDY,kBAoDV,OAAO,EAAAq3B,EAAA,IAAIF,GAASn3B,GAEtB,IAxDW,iBAyDT,OAAOm3B,EAAO3+B,MAAQwH,EAAMxH,MAAQ2+B,EAAO8G,SAAWj+B,EAAMi+B,QAE9D,IAxDY,kBAyDZ,IAvDY,kBA2DV,OAAO9G,GAAWn3B,EAAQ,GAE5B,IAjES,eAkEP,IAAIiR,EAAU,EAEhB,IAjES,eAkEP,IAAIitB,EA5EiB,EA4ELX,EAGhB,GAFAtsB,IAAYA,EAAU,GAElBkmB,EAAOlD,MAAQj0B,EAAMi0B,OAASiK,EAChC,OAAO,EAGT,IAAIrE,EAAUlC,EAAMv2B,IAAI+1B,GACxB,GAAI0C,EACF,OAAOA,GAAW75B,EAEpBu9B,GAtFuB,EAyFvB5F,EAAM1nB,IAAIknB,EAAQn3B,GAClB,IAAI+zB,EAAS,EAAY9iB,EAAQkmB,GAASlmB,EAAQjR,GAAQu9B,EAAS7F,EAAY8F,EAAW7F,GAE1F,OADAA,EAAc,OAAER,GACTpD,EAET,IAnFY,kBAoFV,GAAI2C,EACF,OAAOA,EAAc3zB,KAAKo0B,IAAWT,EAAc3zB,KAAK/C,GAG9D,OAAO,CACT,CEhDQ,CAAWm3B,EAAQn3B,EAAO29B,EAAQJ,EAAS7F,EAAY8F,EAAW7F,GAExE,KArDyB,EAqDnB4F,GAAiC,CACrC,IAAIa,EAAeP,GAAY,EAAe96B,KAAKo0B,EAAQ,eACvDkH,EAAeP,GAAY,EAAe/6B,KAAK/C,EAAO,eAE1D,GAAIo+B,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAejH,EAAOn/B,QAAUm/B,EAC/CoH,EAAeF,EAAer+B,EAAMhI,QAAUgI,EAGlD,OADA23B,IAAUA,EAAQ,IAAI,KACf6F,EAAUc,EAAcC,EAAchB,EAAS7F,EAAYC,EACpE,CACF,CACA,QAAKoG,IAGLpG,IAAUA,EAAQ,IAAI,KDtDxB,SAAsBR,EAAQn3B,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GACnE,IAAIuG,EAtBqB,EAsBTX,EACZiB,GAAW,OAAWrH,GACtBsH,EAAYD,EAAS/mC,OAIzB,GAAIgnC,IAHW,OAAWz+B,GACDvI,SAEMymC,EAC7B,OAAO,EAGT,IADA,IAAI7lC,EAAQomC,EACLpmC,KAAS,CACd,IAAIkP,EAAMi3B,EAASnmC,GACnB,KAAM6lC,EAAY32B,KAAOvH,EAAQ,EAAe+C,KAAK/C,EAAOuH,IAC1D,OAAO,CAEX,CAEA,IAAI48B,EAAaxM,EAAMv2B,IAAI+1B,GACvB+M,EAAavM,EAAMv2B,IAAIpB,GAC3B,GAAImkC,GAAcD,EAChB,OAAOC,GAAcnkC,GAASkkC,GAAc/M,EAE9C,IAAIpD,GAAS,EACb4D,EAAM1nB,IAAIknB,EAAQn3B,GAClB23B,EAAM1nB,IAAIjQ,EAAOm3B,GAGjB,IADA,IAAIuH,EAAWR,IACN7lC,EAAQomC,GAAW,CAE1B,IAAIrH,EAAWD,EADf5vB,EAAMi3B,EAASnmC,IAEXsmC,EAAW3+B,EAAMuH,GAErB,GAAImwB,EACF,IAAIkH,EAAWV,EACXxG,EAAWiH,EAAUvH,EAAU7vB,EAAKvH,EAAOm3B,EAAQQ,GACnDD,EAAWN,EAAUuH,EAAUp3B,EAAK4vB,EAAQn3B,EAAO23B,GAGzD,UAAmBjgC,IAAbknC,EACGxH,IAAauH,GAAYnB,EAAUpG,EAAUuH,EAAUpB,EAAS7F,EAAYC,GAC7EiH,GACD,CACL7K,GAAS,EACT,KACF,CACA2K,IAAaA,EAAkB,eAAPn3B,EAC1B,CACA,GAAIwsB,IAAW2K,EAAU,CACvB,IAAIG,EAAU1H,EAAO36B,YACjBsiC,EAAU9+B,EAAMxD,YAGhBqiC,GAAWC,KACV,gBAAiB3H,MAAU,gBAAiBn3B,IACzB,mBAAX6+B,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD/K,GAAS,EAEb,CAGA,OAFA4D,EAAc,OAAER,GAChBQ,EAAc,OAAE33B,GACT+zB,CACT,CCRS,CAAaoD,EAAQn3B,EAAOu9B,EAAS7F,EAAY8F,EAAW7F,GACrE,YCrDA,EAVA,SAAS2F,EAAYtlC,EAAOgI,EAAOu9B,EAAS7F,EAAYC,GACtD,OAAI3/B,IAAUgI,IAGD,MAAThI,GAA0B,MAATgI,KAAmB,EAAAq7B,EAAA,GAAarjC,MAAW,EAAAqjC,EAAA,GAAar7B,GACpEhI,GAAUA,GAASgI,GAAUA,EAE/B,EAAgBhI,EAAOgI,EAAOu9B,EAAS7F,EAAY4F,EAAa3F,GACzE,ECSA,EAJA,SAAiB3/B,EAAOgI,GACtB,OAAO,EAAYhI,EAAOgI,EAC5B,4DCIA,IAVA,SAAoBhI,GAClB,KAAK,OAASA,GACZ,OAAO,EAIT,IAAI2M,GAAM,OAAW3M,GACrB,MA5BY,qBA4BL2M,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,CAC/D,mCCAA,IALA,SAAkB3M,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,gBA+BvB,kCCFA,IALA,SAAkBA,GAChB,IAAI8G,SAAc9G,EAClB,OAAgB,MAATA,IAA0B,UAAR8G,GAA4B,YAARA,EAC/C,mCCAA,IAJA,SAAsB9G,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,uGCMIqkC,EAAiB,CAAC,EACtBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7B,wBCtDII,EAAmB,KAAY,IAASC,aAqB5C,EAFmBD,GAAmB,OAAUA,GD8BhD,SAA0BzkC,GACxB,OAAO,EAAAqjC,EAAA,GAAarjC,KAClB,EAAAmjC,EAAA,GAASnjC,EAAMP,WAAa4kC,GAAe,OAAWrkC,GAC1D,4FEpDA,GAFiB,aAAQ2N,OAAOC,KAAMD,QCIlC,EAHcA,OAAO2W,UAGQqI,yBC6BjC,EAJA,SAAcwS,GACZ,OAAO,EAAA+D,EAAA,GAAY/D,IAAU,OAAcA,GDjB7C,SAAkBA,GAChB,KAAK,OAAYA,GACf,OAAO,EAAWA,GAEpB,IAAIpD,EAAS,GACb,IAAK,IAAIxsB,KAAO5B,OAAOwxB,GACjB,EAAep0B,KAAKo0B,EAAQ5vB,IAAe,eAAPA,GACtCwsB,EAAOxwB,KAAKgE,GAGhB,OAAOwsB,CACT,CCMuD,CAASoD,EAChE,qGC1BI,EAHcxxB,OAAO2W,UAGQqI,eAwBjC,EAfA,SAAoBwS,GAClB,KAAK,EAAAS,EAAA,GAAST,GACZ,OCVJ,SAAsBA,GACpB,IAAIpD,EAAS,GACb,GAAc,MAAVoD,EACF,IAAK,IAAI5vB,KAAO5B,OAAOwxB,GACrBpD,EAAOxwB,KAAKgE,GAGhB,OAAOwsB,CACT,CDEW,CAAaoD,GAEtB,IAAIiN,GAAU,OAAYjN,GACtBpD,EAAS,GAEb,IAAK,IAAIxsB,KAAO4vB,GACD,eAAP5vB,IAAyB68B,GAAY,EAAerhC,KAAKo0B,EAAQ5vB,KACrEwsB,EAAOxwB,KAAKgE,GAGhB,OAAOwsB,CACT,YECA,EAJA,SAAgBoD,GACd,OAAO,EAAA+D,EAAA,GAAY/D,IAAU,OAAcA,GAAQ,GAAQ,EAAWA,EACxE,yECbkBhD,EACZkQ,EACAC,ECRkBC,gCCSxB,EAPA,SAA0BpN,EAAQ5vB,EAAKvP,SACtBN,IAAVM,KAAwB,EAAAq/B,EAAA,GAAGF,EAAO5vB,GAAMvP,SAC9BN,IAAVM,KAAyBuP,KAAO4vB,MACnC,OAAgBA,EAAQ5vB,EAAKvP,EAEjC,ECFA,ECPS,SAASm/B,EAAQxD,EAAUoG,GAMhC,IALA,IAAI1hC,GAAS,EACTmsC,EAAW7+B,OAAOwxB,GAClB2C,EAAQC,EAAS5C,GACjB1/B,EAASqiC,EAAMriC,OAEZA,KAAU,CACf,IAAI8P,EAAMuyB,IAA6BzhC,GACvC,IAA+C,IAA3Cs7B,EAAS6Q,EAASj9B,GAAMA,EAAKi9B,GAC/B,KAEJ,CACA,OAAOrN,CACT,iICbE1C,EAAYtB,SAAS7W,UACrBoY,EAAc/uB,OAAO2W,UAGrByY,EAAeN,EAAU1b,SAGzB,EAAiB2b,EAAY/P,eAG7B8f,EAAmB1P,EAAahyB,KAAK4C,kBCEzC,EAZA,SAAiBwxB,EAAQ5vB,GACvB,IAAY,gBAARA,GAAgD,mBAAhB4vB,EAAO5vB,KAIhC,aAAPA,EAIJ,OAAO4vB,EAAO5vB,EAChB,sBC2EA,EA9DA,SAAuB4vB,EAAQtmB,EAAQtJ,EAAKm9B,EAAUC,EAAWjN,EAAYC,GAC3E,ICJyB3/B,EDIrBo/B,EAAW,EAAQD,EAAQ5vB,GAC3Bq9B,EAAW,EAAQ/zB,EAAQtJ,GAC3BsyB,EAAUlC,EAAMv2B,IAAIwjC,GAExB,GAAI/K,EACF,EAAiB1C,EAAQ5vB,EAAKsyB,OADhC,CAIA,IAAIU,EAAW7C,EACXA,EAAWN,EAAUwN,EAAWr9B,EAAM,GAAK4vB,EAAQtmB,EAAQ8mB,QAC3DjgC,EAEAmtC,OAAwBntC,IAAb6iC,EAEf,GAAIsK,EAAU,CACZ,IAAIhN,GAAQ,EAAA9xB,EAAA,GAAQ6+B,GAChBjF,GAAU9H,IAAS,EAAAlC,EAAA,GAASiP,GAC5BE,GAAWjN,IAAU8H,IAAU,EAAAjD,EAAA,GAAakI,GAEhDrK,EAAWqK,EACP/M,GAAS8H,GAAUmF,GACjB,EAAA/+B,EAAA,GAAQqxB,GACVmD,EAAWnD,GC1BQp/B,ED4BMo/B,GC3BxB,EAAAiE,EAAA,GAAarjC,KAAU,EAAAkjC,EAAA,GAAYljC,GD4BpCuiC,GAAW,OAAUnD,GAEduI,GACPkF,GAAW,EACXtK,GAAW,OAAYqK,GAAU,IAE1BE,GACPD,GAAW,EACXtK,GAAW,OAAgBqK,GAAU,IAGrCrK,EAAW,IFpBnB,SAAuBviC,GACrB,KAAK,EAAAqjC,EAAA,GAAarjC,IA5CJ,oBA4Cc,OAAWA,GACrC,OAAO,EAET,IAAIugC,GAAQ,OAAavgC,GACzB,GAAc,OAAVugC,EACF,OAAO,EAET,IAAIQ,EAAO,EAAeh2B,KAAKw1B,EAAO,gBAAkBA,EAAM/7B,YAC9D,MAAsB,mBAARu8B,GAAsBA,aAAgBA,GAClDhE,EAAahyB,KAAKg2B,IAAS0L,CAC/B,CEYa,CAAcG,KAAa,EAAArJ,EAAA,GAAYqJ,IAC9CrK,EAAWnD,GACP,EAAAmE,EAAA,GAAYnE,GACdmD,EE/CR,SAAuBviC,GACrB,OAAO,OAAWA,GAAO,EAAA2rC,EAAA,GAAO3rC,GAClC,CF6CmB,CAAco/B,IAEjB,EAAAQ,EAAA,GAASR,MAAa,EAAAsD,EAAA,GAAWtD,KACzCmD,GAAW,OAAgBqK,KAI7BC,GAAW,CAEf,CACIA,IAEFlN,EAAM1nB,IAAI20B,EAAUrK,GACpBoK,EAAUpK,EAAUqK,EAAUF,EAAUhN,EAAYC,GACpDA,EAAc,OAAEiN,IAElB,EAAiBzN,EAAQ5vB,EAAKgzB,EAnD9B,CAoDF,EGlDA,EAtBA,SAASwK,EAAU5N,EAAQtmB,EAAQ6zB,EAAUhN,EAAYC,GACnDR,IAAWtmB,GAGf,EAAQA,GAAQ,SAAS+zB,EAAUr9B,GAEjC,GADAowB,IAAUA,EAAQ,IAAI,MAClB,EAAAC,EAAA,GAASgN,GACX,EAAczN,EAAQtmB,EAAQtJ,EAAKm9B,EAAUK,EAAWrN,EAAYC,OAEjE,CACH,IAAI4C,EAAW7C,EACXA,EAAW,EAAQP,EAAQ5vB,GAAMq9B,EAAWr9B,EAAM,GAAK4vB,EAAQtmB,EAAQ8mB,QACvEjgC,OAEaA,IAAb6iC,IACFA,EAAWqK,GAEb,EAAiBzN,EAAQ5vB,EAAKgzB,EAChC,CACF,GAAGoJ,EAAA,EACL,ECnBA,EAJA,SAAkB3rC,GAChB,OAAOA,CACT,ECfIgtC,EAAYlsC,KAAKoP,cCkBrB,EATuB,IAA4B,SAASisB,EAAM8Q,GAChE,OAAO,OAAe9Q,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,OCGcn8B,EDHIitC,ECIb,WACL,OAAOjtC,CACT,GDLE,UAAY,ICEhB,IAAkBA,CDAlB,EAPwC,EbPpCktC,EAAYC,KAAKC,IeQrB,GfGkBjR,EeLS,EfMrBkQ,EAAQ,EACRC,EAAa,EAEV,WACL,IAAIe,EAAQH,IACRI,EApBO,IAoBiBD,EAAQf,GAGpC,GADAA,EAAae,EACTC,EAAY,GACd,KAAMjB,GAzBI,IA0BR,OAAO7sC,UAAU,QAGnB6sC,EAAQ,EAEV,OAAOlQ,EAAK9N,WAAM3uB,EAAWF,UAC/B,GgBjBF,EAJA,SAAkB28B,EAAM/1B,GACtB,OAAO,EJCT,SAAkB+1B,EAAM/1B,EAAOg2B,GAE7B,OADAh2B,EAAQ4mC,OAAoBttC,IAAV0G,EAAuB+1B,EAAK18B,OAAS,EAAK2G,EAAO,GAC5D,WAML,IALA,IAAI2C,EAAOvJ,UACPa,GAAS,EACTZ,EAASutC,EAAUjkC,EAAKtJ,OAAS2G,EAAO,GACxCs1B,EAAQp0B,MAAM7H,KAETY,EAAQZ,GACfi8B,EAAMr7B,GAAS0I,EAAK3C,EAAQ/F,GAE9BA,GAAS,EAET,IADA,IAAIktC,EAAYjmC,MAAMlB,EAAQ,KACrB/F,EAAQ+F,GACfmnC,EAAUltC,GAAS0I,EAAK1I,GAG1B,OADAktC,EAAUnnC,GAASg2B,EAAUV,GKpBjC,SAAeS,EAAMqR,EAASzkC,GAC5B,OAAQA,EAAKtJ,QACX,KAAK,EAAG,OAAO08B,EAAKpxB,KAAKyiC,GACzB,KAAK,EAAG,OAAOrR,EAAKpxB,KAAKyiC,EAASzkC,EAAK,IACvC,KAAK,EAAG,OAAOozB,EAAKpxB,KAAKyiC,EAASzkC,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOozB,EAAKpxB,KAAKyiC,EAASzkC,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOozB,EAAK9N,MAAMmf,EAASzkC,EAC7B,CLaW,CAAMozB,EAAM98B,KAAMkuC,EAC3B,CACF,CIpBqB,CAASpR,EAAM/1B,EAAO,GAAW+1B,EAAO,GAC7D,YEwBA,GjB5BwBoQ,EiBwBG,SAASpN,EAAQtmB,EAAQ6zB,GAClD,EAAUvN,EAAQtmB,EAAQ6zB,EAC5B,EjBzBS,GAAS,SAASvN,EAAQzpB,GAC/B,IAAIrV,GAAS,EACTZ,EAASiW,EAAQjW,OACjBigC,EAAajgC,EAAS,EAAIiW,EAAQjW,EAAS,QAAKC,EAChD+tC,EAAQhuC,EAAS,EAAIiW,EAAQ,QAAKhW,EAWtC,IATAggC,EAAc6M,EAAS9sC,OAAS,GAA0B,mBAAdigC,GACvCjgC,IAAUigC,QACXhgC,EAEA+tC,GkBNR,SAAwBztC,EAAOK,EAAO8+B,GACpC,KAAK,EAAAS,EAAA,GAAST,GACZ,OAAO,EAET,IAAIr4B,SAAczG,EAClB,SAAY,UAARyG,GACK,EAAAo8B,EAAA,GAAY/D,KAAW,OAAQ9+B,EAAO8+B,EAAO1/B,QACrC,UAARqH,GAAoBzG,KAAS8+B,KAE7B,EAAAE,EAAA,GAAGF,EAAO9+B,GAAQL,EAG7B,ClBNiB,CAAe0V,EAAQ,GAAIA,EAAQ,GAAI+3B,KAClD/N,EAAajgC,EAAS,OAAIC,EAAYggC,EACtCjgC,EAAS,GAEX0/B,EAASxxB,OAAOwxB,KACP9+B,EAAQZ,GAAQ,CACvB,IAAIoZ,EAASnD,EAAQrV,GACjBwY,GACF0zB,EAASpN,EAAQtmB,EAAQxY,EAE7B,CACA,OAAO8+B,CACT,sCmBXF,IAJA,WACE,MAAO,EACT,0fCpBK,IAAAx+B,EAAAA,CAAAA,IACHA,EAAAA,EAAA+sC,KAAQ,GAAR,OACA/sC,EAAAA,EAAAgtC,MAAU,IAAV,QAEAhtC,EAAAA,EAAAgkB,UAAa,IAAb,YACAhkB,EAAAA,EAAA0H,KAAQ,IAAR,OACA1H,EAAAA,EAAA8O,OAAU,GAAV,SACA9O,EAAAA,EAAAC,MAAS,IAAT,QAEAD,EAAAA,EAAAuD,WAAa,IAAb,aACAvD,EAAAA,EAAA+O,YAAc,GAAd,cACA/O,EAAAA,EAAA+C,gBAAkB,GAAlB,kBACA/C,EAAAA,EAAAitC,iBAAmB,GAAnB,mBAEAjtC,EAAAA,EAAAktC,IAAM,IAAN,MAdGltC,GAAAA,CAAAA,GAAA,ICOL,MAAqBwf,EAQnB,WAAA3b,CACkB4R,EACAyO,EAChB5Y,EAA6B,CAAC,GAFd,KAAAmK,SAAAA,EACA,KAAAyO,QAAAA,EAGV,MAAAipB,EAAentC,EAAM+sC,KAAO/sC,EAAMgkB,UACnC,KAAA1gB,MACc,MAAjBgI,EAAQhI,MAEHgI,EAAQhI,MAAQtD,EAAMgtC,MAASG,EAChCntC,EAAMgkB,UACa,MAArB1Y,EAAQgU,YACV5gB,KAAK4gB,UAAYhU,EAAQgU,UAE7B,CArBA,WAAcrS,CAAK1I,GACV,OAAAoC,MAAMC,KAAKrC,EAAK9B,YAAYS,KAAKkqC,GAAeA,EAAKvtC,MAC9D,CAqBO,GAAAwX,CAAI9S,EAAmBlF,GAC5B,QAAKX,KAAK2uC,OAAO9oC,EAAMlF,KAGlBkF,EAAAmC,aAAahI,KAAKwlB,QAAS7kB,IACzB,EACT,CAEO,MAAAguC,CAAOtlB,EAAoB1oB,GAC5B,OAAkB,MAAlBX,KAAK4gB,YAGY,iBAAVjgB,EACFX,KAAK4gB,UAAU9X,QAAQnI,EAAMwI,QAAQ,QAAS,MAAQ,EAEtDnJ,KAAK4gB,UAAU9X,QAAQnI,IAAU,EAE5C,CAEO,MAAA+B,CAAOmD,GACPA,EAAA+oC,gBAAgB5uC,KAAKwlB,QAC5B,CAEO,KAAA7kB,CAAMkF,GACX,MAAMlF,EAAQkF,EAAK6c,aAAa1iB,KAAKwlB,SACrC,OAAIxlB,KAAK2uC,OAAO9oC,EAAMlF,IAAUA,EACvBA,EAEF,EACT,EC5DF,MAAqBkuC,UAAuBx3B,MAK1C,WAAAlS,CAAYyhC,GAEV3lC,MADA2lC,EAAU,eAAiBA,GAE3B5mC,KAAK4mC,QAAUA,EACV,KAAAzlC,KAAOnB,KAAKmF,YAAYhE,IAC/B,ECOF,MAAqB2tC,EAArB,MAAqBA,EAArB,cA0BE,KAAQ/qC,WAA4C,CAAC,EACrD,KAAQohB,QAA8C,CAAC,EACvD,KAAQ4pB,KAA2C,CAAC,EACpD,KAAQ9hC,MAA+C,CAAC,EA1BxD,WAAcsF,CAAK1M,EAAoB6Q,GAAS,GAC9C,GAAY,MAAR7Q,EACK,YAET,GAAI7F,KAAKqR,MAAMuX,IAAI/iB,GACjB,OAAO7F,KAAKqR,MAAMtH,IAAIlE,IAAS,KAEjC,GAAI6Q,EAAQ,CACV,IAAIrQ,EAA0B,KAC1B,IACFA,EAAaR,EAAKQ,UAAA,OAMX,WACT,CACO,OAAArG,KAAKuS,KAAKlM,EAAYqQ,EAC/B,CACO,WACT,CAOO,MAAAjS,CAAOrD,EAAcq/B,EAA8B9/B,GAClD,MAAA2R,EAAQtS,KAAKqB,MAAMo/B,GACzB,GAAa,MAATnuB,EACF,MAAM,IAAIu8B,EAAe,oBAAoBpO,UAE/C,MAAMuO,EAAY18B,EACZzM,EAEJ46B,aAAiBntB,MAAQmtB,EAAMvX,WAAa5V,KAAK+Q,UAC7Coc,EACAuO,EAAUvqC,OAAO9D,GAEjBV,EAAO,IAAI+uC,EAAU5tC,EAAQyE,EAAclF,GACjD,OAAAmuC,EAASz9B,MAAMuH,IAAI3Y,EAAKgE,QAAShE,GAC1BA,CACT,CAEO,IAAAsS,CAAK1M,EAAmB6Q,GAAS,GAC/B,OAAAo4B,EAASv8B,KAAK1M,EAAM6Q,EAC7B,CAEO,KAAArV,CACLA,EACAuD,EAAetD,EAAMktC,KAEjB,IAAAl8B,EAuBJ,MAtBqB,iBAAVjR,EACTiR,EAAQtS,KAAKiN,MAAM5L,IAAUrB,KAAK+D,WAAW1C,GAEpCA,aAAiBoH,MAAQpH,EAAM6nB,WAAa5V,KAAK+Q,UAC1D/R,EAAQtS,KAAKiN,MAAMlL,KACO,iBAAVV,EACZA,EAAQC,EAAMgtC,MAAQhtC,EAAMC,MAC9B+Q,EAAQtS,KAAKiN,MAAM9K,MACVd,EAAQC,EAAMgtC,MAAQhtC,EAAM8O,SACrCkC,EAAQtS,KAAKiN,MAAMgiC,QAEZ5tC,aAAiB8M,WACX9M,EAAMqhB,aAAa,UAAY,IAAI5gB,MAAM,OAClDyF,MAAMpG,IACFmR,EAAAtS,KAAKmlB,QAAQhkB,KACjBmR,KAKNA,EAAQA,GAAStS,KAAK+uC,KAAK1tC,EAAMkC,UAEtB,MAAT+O,EACK,KAGP,UAAWA,GACX1N,EAAQtD,EAAMgtC,MAAQh8B,EAAM1N,OAC5BA,EAAQtD,EAAM+sC,KAAO/7B,EAAM1N,MAEpB0N,EAEF,IACT,CAEO,QAAAuE,IAAYq4B,GACV,OAAAA,EAAY1qC,KAAK2qC,IACtB,MAAMC,EAAS,aAAcD,EACvBE,EAAS,aAAcF,EACzB,IAACC,IAAWC,EACR,UAAIR,EAAe,sBAChB,GAAAO,GAAkC,aAAxBD,EAAW7rC,SACxB,UAAIurC,EAAe,kCAE3B,MAAM3+B,EAAMk/B,EACRD,EAAW7rC,SACX+rC,EACAF,EAAWp4B,cACV,EACA,YAAA9J,MAAMiD,GAAOi/B,EAEdE,EACgC,iBAAvBF,EAAW3pB,UACf,KAAAzhB,WAAWorC,EAAW3pB,SAAW2pB,GAE/BC,IACLD,EAAWj1B,YACR,KAAAiL,QAAQgqB,EAAWj1B,WAAai1B,GAEnCA,EAAW5rC,UACT0E,MAAMyG,QAAQygC,EAAW5rC,SAC3B4rC,EAAW5rC,QAAU4rC,EAAW5rC,QAAQiB,KAAKjB,GACpCA,EAAQ+rC,gBAGNH,EAAA5rC,QAAU4rC,EAAW5rC,QAAQ+rC,eAEzBrnC,MAAMyG,QAAQygC,EAAW5rC,SACtC4rC,EAAW5rC,QACX,CAAC4rC,EAAW5rC,UACPmB,SAAS4I,KACM,MAAlBtN,KAAK+uC,KAAKzhC,IAAwC,MAAxB6hC,EAAWj1B,aAClC,KAAA60B,KAAKzhC,GAAO6hC,EAAAA,MAKlBA,CAAAA,GAEX,GAvIcL,EAAAz9B,MAAA,IAAYlF,QAD5B,IAAqB6L,EAArB82B,ECfA,SAASx8B,EAAMzM,EAAmB6kB,GAEhC,OADkB7kB,EAAK6c,aAAa,UAAY,IAE7C5gB,MAAM,OACN5B,QAAQiB,GAAwC,IAA/BA,EAAK2H,QAAQ,GAAG4hB,OACtC,CAEA,MAAM1J,UAAwBF,EAC5B,WAAcvS,CAAK1I,GACT,OAAAA,EAAK6c,aAAa,UAAY,IACnC5gB,MAAM,OACN0C,KAAKrD,GAASA,EAAKW,MAAM,KAAK6L,MAAM,GAAI,GAAGhH,KAAK,MACrD,CAEO,GAAAgS,CAAI9S,EAAmBlF,GAC5B,QAAKX,KAAK2uC,OAAO9oC,EAAMlF,KAGvBX,KAAK0C,OAAOmD,GACZA,EAAK6S,UAAUC,IAAI,GAAG3Y,KAAKwlB,WAAW7kB,MAC/B,EACT,CAEO,MAAA+B,CAAOmD,GACIyM,EAAMzM,EAAM7F,KAAKwlB,SACzB9gB,SAASvD,IACV0E,EAAA6S,UAAUhW,OAAOvB,EAAK,IAEC,IAA1B0E,EAAK6S,UAAUtY,QACjByF,EAAK+oC,gBAAgB,QAEzB,CAEO,KAAAjuC,CAAMkF,GAEX,MAAMlF,GADS2R,EAAMzM,EAAM7F,KAAKwlB,SAAS,IAAM,IAC1B7X,MAAM3N,KAAKwlB,QAAQplB,OAAS,GACjD,OAAOJ,KAAK2uC,OAAO9oC,EAAMlF,GAASA,EAAQ,EAC5C,ECrCF,SAAS4uC,EAASpuC,GACV,MAAA6M,EAAQ7M,EAAKW,MAAM,KACnBuL,EAAOW,EACVL,MAAM,GACNnJ,KAAKgrC,GAAiBA,EAAK,GAAGF,cAAgBE,EAAK7hC,MAAM,KACzDhH,KAAK,IACD,OAAAqH,EAAM,GAAKX,CACpB,CAEA,MAAM4T,UAAwBH,EAC5B,WAAcvS,CAAK1I,GACT,OAAAA,EAAK6c,aAAa,UAAY,IAAI5gB,MAAM,KAAK0C,KAAK7D,GAC5CA,EAAMmB,MAAM,KACb,GAAG2W,QAElB,CAEO,GAAAE,CAAI9S,EAAmBlF,GAC5B,QAAKX,KAAK2uC,OAAO9oC,EAAMlF,KAIvBkF,EAAK0W,MAAMgzB,EAASvvC,KAAKwlB,UAAY7kB,GAC9B,EACT,CAEO,MAAA+B,CAAOmD,GAEZA,EAAK0W,MAAMgzB,EAASvvC,KAAKwlB,UAAY,GAChC3f,EAAK6c,aAAa,UACrB7c,EAAK+oC,gBAAgB,QAEzB,CAEO,KAAAjuC,CAAMkF,GAEX,MAAMlF,EAAQkF,EAAK0W,MAAMgzB,EAASvvC,KAAKwlB,UACvC,OAAOxlB,KAAK2uC,OAAO9oC,EAAMlF,GAASA,EAAQ,EAC5C,ECjCF,MAAMqD,EAIJ,WAAAmB,CAAYlB,GAHZ,KAAQF,WAA4C,CAAC,EAInD/D,KAAKiE,QAAUA,EACfjE,KAAKyvC,OACP,CAEO,SAAArrC,CAAUA,EAAuBzD,GAElCA,EACEyD,EAAUuU,IAAI3Y,KAAKiE,QAAStD,KACO,MAAjCyD,EAAUzD,MAAMX,KAAKiE,SAClB,KAAAF,WAAWK,EAAU2S,UAAY3S,SAE/BpE,KAAK+D,WAAWK,EAAU2S,YAI3B3S,EAAA1B,OAAO1C,KAAKiE,gBACfjE,KAAK+D,WAAWK,EAAU2S,UAErC,CAEO,KAAA04B,GACLzvC,KAAK+D,WAAa,CAAC,EACnB,MAAM9D,EAAO+X,EAASzF,KAAKvS,KAAKiE,SAChC,GAAY,MAARhE,EACF,OAEF,MAAM8D,EAAa+c,EAAWvS,KAAKvO,KAAKiE,SAClCkhB,EAAUnE,EAAgBzS,KAAKvO,KAAKiE,SACpCmhB,EAASnE,EAAgB1S,KAAKvO,KAAKiE,SAEtCF,EAAA4K,OAAOwW,GACPxW,OAAOyW,GACP1gB,SAASvD,IACR,MAAMkkB,EAAOplB,EAAKmB,OAAOC,MAAMF,EAAMG,EAAMgkB,WACvCD,aAAgBvE,IACb,KAAA/c,WAAWshB,EAAKtO,UAAYsO,EAAAA,GAGzC,CAEO,IAAA0b,CAAKn+B,GACV0L,OAAOC,KAAKvO,KAAK+D,YAAYW,SAASwL,IACpC,MAAMvP,EAAQX,KAAK+D,WAAWmM,GAAKvP,MAAMX,KAAKiE,SACvCrB,EAAApB,OAAO0O,EAAKvP,EAAM,GAE7B,CAEO,IAAA+uC,CAAK9sC,GACV5C,KAAK+gC,KAAKn+B,GACV0L,OAAOC,KAAKvO,KAAK+D,YAAYW,SAASwL,IACpClQ,KAAK+D,WAAWmM,GAAKxN,OAAO1C,KAAKiE,QAAQ,IAE3CjE,KAAK+D,WAAa,CAAC,CACrB,CAEO,MAAAI,GACL,OAAOmK,OAAOC,KAAKvO,KAAK+D,YAAYvD,QAClC,CAACuD,EAAoC5C,KACxB4C,EAAA5C,GAAQnB,KAAK+D,WAAW5C,GAAMR,MAAMX,KAAKiE,SAC7CF,IAET,CAAC,EAEL,EChEF,MAAM4rC,EAAN,MA+CE,WAAAxqC,CACS/D,EACA6C,GADA,KAAA7C,OAAAA,EACA,KAAA6C,QAAAA,EAEE+T,EAAA3G,MAAMuH,IAAI3U,EAASjE,MAC5BA,KAAK8E,KAAO,KACZ9E,KAAKqD,KAAO,IACd,CA/CA,aAAcoB,CAAOmrC,GACf,GAAgB,MAAhB5vC,KAAKuD,QACD,UAAIsrC,EAAe,mCAEvB,IAAAhpC,EACAlF,EACJ,OAAIsH,MAAMyG,QAAQ1O,KAAKuD,UACG,iBAAbqsC,GACTjvC,EAAQivC,EAASN,cACb16B,SAASjU,EAAO,IAAI+gB,aAAe/gB,IAC7BA,EAAAiU,SAASjU,EAAO,MAEG,iBAAbivC,IACRjvC,EAAAivC,GAGR/pC,EADmB,iBAAVlF,EACF2E,SAASyC,cAAc/H,KAAKuD,QAAQ5C,EAAQ,IAC1CA,GAASX,KAAKuD,QAAQuF,QAAQnI,IAAU,EAC1C2E,SAASyC,cAAcpH,GAEvB2E,SAASyC,cAAc/H,KAAKuD,QAAQ,KAGtCsC,EAAAP,SAASyC,cAAc/H,KAAKuD,SAEjCvD,KAAKka,WACFrU,EAAA6S,UAAUC,IAAI3Y,KAAKka,WAEnBrU,CACT,CAQA,WAAIlB,GACF,OAAO3E,KAAKmF,WACd,CAUO,MAAArB,GAEP,CAEO,KAAAX,GACL,MAAMc,EAAUjE,KAAKiE,QAAQ4rC,WAAU,GAChC,OAAA7vC,KAAKoB,OAAOqD,OAAOR,EAC5B,CAEO,MAAA0B,GACc,MAAf3F,KAAKoD,QACF,KAAAA,OAAOJ,YAAYhD,MAEjBgY,EAAA3G,MAAMZ,OAAOzQ,KAAKiE,QAC7B,CAEO,QAAAlD,CAASC,EAAeZ,GAChBJ,KAAK0H,QAAQ1G,EAAOZ,GAC5BsC,QACP,CAEO,QAAAxB,CACLF,EACAZ,EACAe,EACAR,GAEA,MAAMV,EAAOD,KAAK0H,QAAQ1G,EAAOZ,GAC7B,GAAuC,MAAvCJ,KAAKoB,OAAOC,MAAMF,EAAMG,EAAM0H,OAAiBrI,EAC5CV,EAAAgJ,KAAK9H,EAAMR,QAAK,GACgC,MAA5CX,KAAKoB,OAAOC,MAAMF,EAAMG,EAAMgkB,WAAoB,CAC3D,MAAMliB,EAASpD,KAAKoB,OAAOqD,OAAOzE,KAAK2E,QAAQC,OAE/C3E,EAAKgJ,KAAK7F,GACHA,EAAA5B,OAAOL,EAAMR,EACtB,CACF,CAEO,QAAAgB,CAASX,EAAeL,EAAeiB,GAC5C,MAAM3B,EACG,MAAP2B,EACI5B,KAAKoB,OAAOqD,OAAO,OAAQ9D,GAC3BX,KAAKoB,OAAOqD,OAAO9D,EAAOiB,GAC1BW,EAAMvC,KAAK8B,MAAMd,GACvBhB,KAAKoD,OAAOd,aAAarC,EAAMsC,QAAO,EACxC,CAEO,OAAAmF,CAAQ1G,EAAeZ,GACtB,MAAAwC,EAAS5C,KAAK8B,MAAMd,GAC1B,GAAc,MAAV4B,EACI,UAAIyU,MAAM,6BAElB,OAAAzU,EAAOd,MAAM1B,GACNwC,CACT,CAEO,MAAAxC,GACE,QACT,CAEO,MAAAwF,CAAOvG,EAAaW,KAAKoD,QAC9B,OAAmB,MAAfpD,KAAKoD,QAAkBpD,OAASX,EAC3B,EAEFW,KAAKoD,OAAOnB,SAAS2D,OAAO5F,MAAQA,KAAKoD,OAAOwC,OAAOvG,EAChE,CAEO,QAAAwD,CAASitC,GAEZ9vC,KAAK2E,QAAQwT,qBACXnY,KAAKoD,kBAAkBpD,KAAK2E,QAAQwT,oBAEtCnY,KAAKiJ,KAAKjJ,KAAK2E,QAAQwT,kBAAkB7U,SAE7C,CAEO,MAAAZ,GAC0B,MAA3B1C,KAAKiE,QAAQoC,YACfrG,KAAKiE,QAAQoC,WAAWrD,YAAYhD,KAAKiE,SAE3CjE,KAAK2F,QACP,CAEO,WAAAoqC,CAAY5uC,EAAqBR,GAChC,MAAAqvC,EACY,iBAAT7uC,EAAoBnB,KAAKoB,OAAOqD,OAAOtD,EAAMR,GAASQ,EAC3D,OAAe,MAAfnB,KAAKoD,SACPpD,KAAKoD,OAAOd,aAAa0tC,EAAahwC,KAAKqD,WAAQ,GACnDrD,KAAK0C,UAEAstC,CACT,CAEO,KAAAluC,CAAMd,EAAeivC,GACnB,OAAU,IAAVjvC,EAAchB,KAAOA,KAAKqD,IACnC,CAEO,MAAAgE,CACL6oC,EACAJ,GAGF,CAEO,IAAA7mC,CAAK9H,EAAuBR,GAC3B,MAAAwvC,EACY,iBAAThvC,EACFnB,KAAKoB,OAAOqD,OAAOtD,EAAMR,GAC1BQ,EAIF,GAHe,MAAfnB,KAAKoD,QACPpD,KAAKoD,OAAOd,aAAa6tC,EAASnwC,KAAKqD,WAAQ,GAEd,mBAAxB8sC,EAAQ1qC,YACjB,MAAM,IAAIopC,EAAe,eAAe1tC,KAE1C,OAAAgvC,EAAQ1qC,YAAYzF,MACbmwC,CACT,GA5KAR,EAAcrsC,SAAW,WAD3B,IAAM8sC,EAANT,ECPA,MAAMU,EAAN,cAAuBD,EAQrB,YAAczvC,CAAM2vC,GACX,QACT,CAMO,KAAAtvC,CAAM6E,EAAYD,GAErB,OAAA5F,KAAKiE,UAAY4B,GACjB7F,KAAKiE,QAAQssC,wBAAwB1qC,GACnCyN,KAAKk9B,+BAEA/uC,KAAKC,IAAIkE,EAAQ,IAElB,CACV,CAMO,QAAAE,CAAS9E,EAAeyvC,GAE7B,IAAI7qC,EADuBqC,MAAMC,KAAKlI,KAAKoD,OAAOa,QAAQkE,YAClCW,QAAQ9I,KAAKiE,SACrC,OAAIjD,EAAQ,IACA4E,GAAA,GAEL,CAAC5F,KAAKoD,OAAOa,QAAS2B,EAC/B,CAOO,KAAAjF,GACE,OACL,CAACX,KAAK2E,QAAQrB,UAAWtD,KAAK2E,QAAQhE,MAAMX,KAAKiE,WAAY,EAEjE,GAhDAosC,EAAczrC,MAAQtD,EAAM+O,YAD9B,IAAM9P,EAAN8vC,ECFA,MAAMK,EAKJ,WAAAvrC,GACEnF,KAAKwC,KAAO,KACZxC,KAAKkC,KAAO,KACZlC,KAAKI,OAAS,CAChB,CAEO,MAAA2jB,IAAU4sB,GAEX,GADJ3wC,KAAKsC,aAAaquC,EAAM,GAAI,MACxBA,EAAMvwC,OAAS,EAAG,CACd,MAAAiN,EAAOsjC,EAAMhjC,MAAM,GACpB,KAAAoW,UAAU1W,EACjB,CACF,CAEO,EAAAujC,CAAG5vC,GACF,MAAAqC,EAAOrD,KAAK6wC,WAClB,IAAIlkB,EAAMtpB,IACH,KAAAspB,GAAO3rB,EAAQ,GACXA,GAAA,EACT2rB,EAAMtpB,IAED,OAAAspB,CACT,CAEO,QAAA3gB,CAASnG,GACR,MAAAxC,EAAOrD,KAAK6wC,WAClB,IAAIlkB,EAAMtpB,IACV,KAAOspB,GAAK,CACV,GAAIA,IAAQ9mB,EACH,SAET8mB,EAAMtpB,GACR,CACO,QACT,CAEO,OAAAyF,CAAQjD,GACP,MAAAxC,EAAOrD,KAAK6wC,WAClB,IAAIlkB,EAAMtpB,IACNrC,EAAQ,EACZ,KAAO2rB,GAAK,CACV,GAAIA,IAAQ9mB,EACH,OAAA7E,EAEAA,GAAA,EACT2rB,EAAMtpB,GACR,CACO,QACT,CAEO,YAAAf,CAAauD,EAAgBoU,GACtB,MAARpU,IAGJ7F,KAAK0C,OAAOmD,GACZA,EAAKxC,KAAO4W,EACG,MAAXA,GACFpU,EAAKf,KAAOmV,EAAQnV,KACA,MAAhBmV,EAAQnV,OACVmV,EAAQnV,KAAKzB,KAAOwC,GAEtBoU,EAAQnV,KAAOe,EACXoU,IAAYja,KAAKwC,OACnBxC,KAAKwC,KAAOqD,IAEQ,MAAb7F,KAAKkC,MACdlC,KAAKkC,KAAKmB,KAAOwC,EACjBA,EAAKf,KAAO9E,KAAKkC,KACjBlC,KAAKkC,KAAO2D,IAEZA,EAAKf,KAAO,KACP,KAAAtC,KAAOxC,KAAKkC,KAAO2D,GAE1B7F,KAAKI,QAAU,EACjB,CAEO,MAAAwF,CAAOhD,GACZ,IAAI5B,EAAQ,EACR2rB,EAAM3sB,KAAKwC,KACf,KAAc,MAAPmqB,GAAa,CAClB,GAAIA,IAAQ/pB,EACH,OAAA5B,EAETA,GAAS2rB,EAAIvsB,SACbusB,EAAMA,EAAItpB,IACZ,CACO,QACT,CAEO,MAAAX,CAAOmD,GACP7F,KAAKgM,SAASnG,KAGF,MAAbA,EAAKf,OACFe,EAAAf,KAAKzB,KAAOwC,EAAKxC,MAEP,MAAbwC,EAAKxC,OACFwC,EAAAxC,KAAKyB,KAAOe,EAAKf,MAEpBe,IAAS7F,KAAKwC,OAChBxC,KAAKwC,KAAOqD,EAAKxC,MAEfwC,IAAS7F,KAAKkC,OAChBlC,KAAKkC,KAAO2D,EAAKf,MAEnB9E,KAAKI,QAAU,EACjB,CAEO,QAAAywC,CAASC,EAAoB9wC,KAAKwC,MAEvC,MAAO,KACL,MAAM+2B,EAAMuX,EACZ,OAAe,MAAXA,IACFA,EAAUA,EAAQztC,MAEbk2B,CAAAA,CAEX,CAEO,IAAAhnB,CAAKvR,EAAeqf,GAAY,GAC/B,MAAAhd,EAAOrD,KAAK6wC,WAClB,IAAIlkB,EAAMtpB,IACV,KAAOspB,GAAK,CACJ,MAAAvsB,EAASusB,EAAIvsB,SACnB,GACEY,EAAQZ,GACPigB,GACCrf,IAAUZ,IACG,MAAZusB,EAAItpB,MAAsC,IAAtBspB,EAAItpB,KAAKjD,UAEzB,OAACusB,EAAK3rB,GAENA,GAAAZ,EACTusB,EAAMtpB,GACR,CACO,OAAC,KAAM,EAChB,CAEO,OAAAqB,CAAQqsC,GACP,MAAA1tC,EAAOrD,KAAK6wC,WAClB,IAAIlkB,EAAMtpB,IACV,KAAOspB,GACLokB,EAASpkB,GACTA,EAAMtpB,GAEV,CAEO,SAAAwK,CACL7M,EACAZ,EACA2wC,GAEA,GAAI3wC,GAAU,EACZ,OAEF,MAAO6G,EAAWrB,GAAU5F,KAAKuS,KAAKvR,GACtC,IAAIgwC,EAAWhwC,EAAQ4E,EACjB,MAAAvC,EAAOrD,KAAK6wC,SAAS5pC,GAC3B,IAAI0lB,EAAMtpB,IACH,KAAAspB,GAAOqkB,EAAWhwC,EAAQZ,GAAQ,CACjC,MAAA6wC,EAAYtkB,EAAIvsB,SAClBY,EAAQgwC,EACVD,EACEpkB,EACA3rB,EAAQgwC,EACRvvC,KAAKC,IAAItB,EAAQ4wC,EAAWC,EAAYjwC,IAGjC+vC,EAAApkB,EAAK,EAAGlrB,KAAKC,IAAIuvC,EAAWjwC,EAAQZ,EAAS4wC,IAE5CA,GAAAC,EACZtkB,EAAMtpB,GACR,CACF,CAEO,GAAAmB,CAAIusC,GACT,OAAO/wC,KAAKQ,QAAO,CAACimB,EAAWkG,KACxBlG,EAAAva,KAAK6kC,EAASpkB,IACZlG,IACN,GACL,CAEO,MAAAjmB,CAAUuwC,EAAkCtqB,GAC3C,MAAApjB,EAAOrD,KAAK6wC,WAClB,IAAIlkB,EAAMtpB,IACV,KAAOspB,GACElG,EAAAsqB,EAAStqB,EAAMkG,GACtBA,EAAMtpB,IAED,OAAAojB,CACT,EC/LF,SAASyqB,EAAiBrrC,EAAYzE,GAC9B,MAAA+2B,EAAQ/2B,EAAOmR,KAAK1M,GACtB,GAAAsyB,EAAc,OAAAA,EACd,IACK,OAAA/2B,EAAOqD,OAAOoB,EAAI,OAEzB,MAAM5F,EAAOmB,EAAOqD,OAAOnD,EAAM8O,QACjC,OAAAnI,MAAMC,KAAKrC,EAAKsC,YAAYzD,SAASzB,IAC9BhD,EAAAgE,QAAQwB,YAAYxC,EAAM,IAE7B4C,EAAKQ,YACPR,EAAKQ,WAAWsd,aAAa1jB,EAAKgE,QAAS4B,GAE7C5F,EAAK6D,SACE7D,CACT,CACF,CAEA,MAAMkxC,EAAN,MAAMA,UAAmBf,EAgBvB,WAAAjrC,CAAY/D,EAAc6C,GACxBhD,MAAMG,EAAQ6C,GAHhB,KAAOmtC,OAA6B,KAIlCpxC,KAAKyvC,OACP,CAEO,WAAAhqC,CAAYkD,GACjB3I,KAAKsC,aAAaqG,EACpB,CAEO,MAAA7E,GACL7C,MAAM6C,SACD,KAAA7B,SAASyC,SAASzB,IACrBA,EAAMa,QAAQ,GAElB,CAEO,QAAAutC,CAASxrC,GACK,MAAf7F,KAAKoxC,QACPpxC,KAAKoxC,OAAO1uC,SAEd1C,KAAKoxC,OAASvrC,EACVsrC,EAAW17B,SACbzV,KAAKoxC,OAAO14B,UAAUC,IAAIw4B,EAAW17B,SAElC,KAAA27B,OAAOppC,aAAa,kBAAmB,SAC5ChI,KAAKiE,QAAQ3B,aAAatC,KAAKoxC,OAAQpxC,KAAKiE,QAAQslB,WACtD,CAKO,KAAAkmB,GACA,KAAAxtC,SAAW,IAAIyuC,EAEpBzoC,MAAMC,KAAKlI,KAAKiE,QAAQkE,YACrBjI,QAAQ2F,GAAeA,IAAS7F,KAAKoxC,SACrCE,UACA5sC,SAASmB,IACJ,IACF,MAAM5C,EAAQiuC,EAAiBrrC,EAAM7F,KAAKoB,QAC1CpB,KAAKsC,aAAaW,EAAOjD,KAAKiC,SAASO,WAAQ,EAAS,OACjD+uC,GACP,GAAIA,aAAe1C,EACjB,OAEM,MAAA0C,CAEV,IAEN,CAEO,QAAAxwC,CAASC,EAAeZ,GAC7B,GAAc,IAAVY,GAAeZ,IAAWJ,KAAKI,SACjC,OAAOJ,KAAK0C,SAEd1C,KAAKiC,SAAS4L,UAAU7M,EAAOZ,GAAQ,CAAC6C,EAAO2C,EAAQkI,KAC/C7K,EAAAlC,SAAS6E,EAAQkI,EAAY,GAEvC,CAUO,UAAAgC,CAAW0hC,EAAexwC,EAAQ,GACvC,MAAOiC,EAAO2C,GAAU5F,KAAKiC,SAASsQ,KAAKvR,GAExC,OAAqB,MAArBwwC,EAASluC,UAAoBkuC,EAASvuC,IACjB,MAArBuuC,EAASluC,UAAoBL,aAAiBuuC,EAExC,CAACvuC,EAAc2C,GACb3C,aAAiBkuC,EACnBluC,EAAM6M,WAAW0hC,EAAU5rC,GAE3B,CAAC,MAAO,EAEnB,CAYO,WAAAtF,CACLkxC,EACAxwC,EAAQ,EACRZ,EAAiByU,OAAOyG,WAExB,IAAIhb,EAAsB,GACtBmxC,EAAarxC,EACjB,OAAAJ,KAAKiC,SAAS4L,UACZ7M,EACAZ,GACA,CAAC6C,EAAayuC,EAAoB5jC,MAER,MAArB0jC,EAASluC,UAAoBkuC,EAASvuC,IACjB,MAArBuuC,EAASluC,UAAoBL,aAAiBuuC,IAE/ClxC,EAAY4L,KAAKjJ,GAEfA,aAAiBkuC,IACnB7wC,EAAcA,EAAYqO,OACxB1L,EAAM3C,YAAYkxC,EAAUE,EAAYD,KAG9BA,GAAA3jC,CAAAA,IAGXxN,CACT,CAEO,MAAAqF,GACA,KAAA1D,SAASyC,SAASzB,IACrBA,EAAM0C,QAAQ,IAEhB1E,MAAM0E,QACR,CAEO,sBAAAgsC,GACL,IAAIC,GAAO,EACN,KAAA3vC,SAASyC,SAASzB,IACjB2uC,GAGY5xC,KAAK2E,QAAQlB,gBAAgB8D,MAC1C3F,GAAyBqB,aAAiBrB,MAKzCqB,EAAM0B,QAAQC,QAAUtD,EAAMuD,YACd,MAAd5B,EAAMI,MACRrD,KAAK6xC,WAAW5uC,GAEA,MAAdA,EAAM6B,MACH,KAAA+sC,WAAW5uC,EAAM6B,MAExB7B,EAAMG,OAAOuE,SACNiqC,GAAA,GACE3uC,aAAiBkuC,EAC1BluC,EAAM0E,SAEN1E,EAAMP,SAAO,GAGnB,CAEO,QAAAxB,CACLF,EACAZ,EACAe,EACAR,GAEAX,KAAKiC,SAAS4L,UAAU7M,EAAOZ,GAAQ,CAAC6C,EAAO2C,EAAQkI,KACrD7K,EAAM/B,SAAS0E,EAAQkI,EAAa3M,EAAMR,EAAM,GAEpD,CAEO,QAAAgB,CAASX,EAAeL,EAAeiB,GAC5C,MAAOqB,EAAO2C,GAAU5F,KAAKiC,SAASsQ,KAAKvR,GAC3C,GAAIiC,EACIA,EAAAtB,SAASiE,EAAQjF,EAAOiB,OACzB,CACL,MAAM3B,EACG,MAAP2B,EACI5B,KAAKoB,OAAOqD,OAAO,OAAQ9D,GAC3BX,KAAKoB,OAAOqD,OAAO9D,EAAOiB,GAChC5B,KAAKyF,YAAYxF,EACnB,CACF,CAEO,YAAAqC,CAAawvC,EAAiBC,GACX,MAApBD,EAAU1uC,QACF0uC,EAAA1uC,OAAOnB,SAASS,OAAOovC,GAEnC,IAAIE,EAA0B,KAC9BhyC,KAAKiC,SAASK,aAAawvC,EAAWC,GAAW,MACjDD,EAAU1uC,OAASpD,KACJ,MAAX+xC,IACFC,EAAaD,EAAQ9tC,UAGrBjE,KAAKiE,QAAQoC,aAAeyrC,EAAU7tC,SACtCjE,KAAKiE,QAAQ4gB,cAAgBmtB,IAE7BhyC,KAAKiE,QAAQ3B,aAAawvC,EAAU7tC,QAAS+tC,GAE/CF,EAAUhuC,QACZ,CAEO,MAAA1D,GACL,OAAOJ,KAAKiC,SAASzB,QAAO,CAACimB,EAAMxjB,IAC1BwjB,EAAOxjB,EAAM7C,UACnB,EACL,CAEO,YAAAuC,CAAasvC,EAAsBh4B,GACnC,KAAAhY,SAASyC,SAASzB,IACRgvC,EAAA3vC,aAAaW,EAAOgX,EAAQ,GAE7C,CAEO,QAAApX,CAASC,GAMV,GALJ7B,MAAM4B,SAASC,GACf9C,KAAK2xC,yBACc,MAAf3xC,KAAKoxC,QAAkBpxC,KAAKoxC,SAAWpxC,KAAKiE,QAAQslB,YACtDvpB,KAAKiE,QAAQ3B,aAAatC,KAAKoxC,OAAQpxC,KAAKiE,QAAQslB,YAEzB,IAAzBvpB,KAAKiC,SAAS7B,OACZ,GAA6B,MAA7BJ,KAAK2E,QAAQnB,aAAsB,CACrC,MAAMP,EAAQjD,KAAKoB,OAAOqD,OAAOzE,KAAK2E,QAAQnB,aAAaF,UAC3DtD,KAAKyF,YAAYxC,EAAK,MAItBjD,KAAK0C,QAGX,CAEO,IAAAK,CAAK/B,EAAeqf,GAAY,GAC/B,MAACpd,EAAO2C,GAAU5F,KAAKiC,SAASsQ,KAAKvR,EAAOqf,GAC5Cva,EAA6B,CAAC,CAAC9F,KAAMgB,IAC3C,OAAIiC,aAAiBkuC,EACZrrC,EAAS6I,OAAO1L,EAAMF,KAAK6C,EAAQya,KACxB,MAATpd,GACT6C,EAASoG,KAAK,CAACjJ,EAAO2C,IAEjBE,EACT,CAEO,WAAA9C,CAAYC,GACZ,KAAAhB,SAASS,OAAOO,EACvB,CAEO,WAAA8sC,CAAY5uC,EAAqBR,GAChC,MAAAqvC,EACY,iBAAT7uC,EAAoBnB,KAAKoB,OAAOqD,OAAOtD,EAAMR,GAASQ,EAC/D,OAAI6uC,aAAuBmB,GACzBnxC,KAAK2C,aAAaqtC,GAEb/uC,MAAM8uC,YAAYC,EAC3B,CAEO,KAAAluC,CAAMd,EAAekC,GAAQ,GAClC,IAAKA,EAAO,CACV,GAAc,IAAVlC,EACK,OAAAhB,KAEL,GAAAgB,IAAUhB,KAAKI,SACjB,OAAOJ,KAAKqD,IAEhB,CACM,MAAA4b,EAAQjf,KAAKmD,QACnB,OAAInD,KAAKoD,QACPpD,KAAKoD,OAAOd,aAAa2c,EAAOjf,KAAKqD,WAAQ,GAE1C,KAAApB,SAAS4L,UAAU7M,EAAOhB,KAAKI,UAAU,CAAC6C,EAAO2C,EAAQssC,KAC5D,MAAMpwC,EAAQmB,EAAMnB,MAAM8D,EAAQ1C,GACrB,MAATpB,GACFmd,EAAMxZ,YAAY3D,EAAM,IAGrBmd,CACT,CAEO,UAAA4yB,CAAW5uC,GACV,MAAAgc,EAAQjf,KAAKmD,QACZ,KAAc,MAAdF,EAAMI,MACL4b,EAAAxZ,YAAYxC,EAAMI,MAE1B,OAAIrD,KAAKoD,QACPpD,KAAKoD,OAAOd,aAAa2c,EAAOjf,KAAKqD,WAAQ,GAExC4b,CACT,CAEO,MAAAtX,GACD3H,KAAKoD,QACPpD,KAAK2C,aAAa3C,KAAKoD,OAAQpD,KAAKqD,WAAQ,GAE9CrD,KAAK0C,QACP,CAEO,MAAA2E,CACLC,EACAwoC,GAEA,MAAMqC,EAAqB,GACrBC,EAAuB,GACnB9qC,EAAA5C,SAAS8C,IACbA,EAAS5E,SAAW5C,KAAKiE,SAA6B,cAAlBuD,EAASC,OACpC0qC,EAAAjmC,QAAQ1E,EAAS2qC,YACfC,EAAAlmC,QAAQ1E,EAAS4qC,cAAY,IAGjCA,EAAA1tC,SAASmB,IAIpB,GACqB,MAAnBA,EAAKQ,YAEY,WAAjBR,EAAKtC,SACL+B,SAAS4W,KAAKq0B,wBAAwB1qC,GACpCyN,KAAKk9B,+BAEP,OAEF,MAAMvwC,EAAOD,KAAKoB,OAAOmR,KAAK1M,GAClB,MAAR5F,IAIyB,MAA3BA,EAAKgE,QAAQoC,YACbpG,EAAKgE,QAAQoC,aAAerG,KAAKiE,UAEjChE,EAAK0F,QAAQ,IAIdwsC,EAAAjyC,QAAQ2F,GACAA,EAAKQ,aAAerG,KAAKiE,SAAW4B,IAAS7F,KAAKoxC,SAE1DiB,MAAK,CAAC7J,EAAGC,IACJD,IAAMC,EACD,EAELD,EAAE+H,wBAAwB9H,GAAKn1B,KAAKg/B,4BAC/B,GAED,IAET5tC,SAASmB,IACR,IAAIksC,EAAuB,KACH,MAApBlsC,EAAKgf,cACPktB,EAAU/xC,KAAKoB,OAAOmR,KAAK1M,EAAKgf,cAElC,MAAM5kB,EAAOixC,EAAiBrrC,EAAM7F,KAAKoB,SACrCnB,EAAKoD,OAAS0uC,GAAwB,MAAb9xC,EAAKoD,QACb,MAAfpD,EAAKmD,QACFnD,EAAAmD,OAAOJ,YAAYhD,MAErB,KAAAsC,aAAarC,EAAM8xC,QAAW,GAAS,IAGlD/xC,KAAK2xC,wBACP,GA1WAR,EAAc17B,QAAU,GAV1B,IAAM7H,EAANujC,ECKA,MAAMoB,EAAN,MAAMA,UAAmB3kC,EA2BvB,WAAAzI,CAAY/D,EAAc6C,GACxBhD,MAAMG,EAAQ6C,GACdjE,KAAK+D,WAAa,IAAIC,EAAgBhE,KAAKiE,QAC7C,CAxBA,aAAOQ,CAAO9D,GACL,OAAAM,MAAMwD,OAAO9D,EACtB,CAEA,cAAcuD,CAAQD,EAAsB7C,GAC1C,MAAMkR,EAAQlR,EAAOC,MAAMkxC,EAAWjvC,UACtC,GACW,MAATgP,GACArO,EAAQV,UAAa+O,EAA0B/O,QAGtC,IAAwB,iBAAjBvD,KAAKuD,QACd,SACE,GAAA0E,MAAMyG,QAAQ1O,KAAKuD,SACrB,OAAAU,EAAQV,QAAQylB,cAG3B,CASO,MAAAxnB,CAAOL,EAAcR,GAC1B,GAAIQ,IAASnB,KAAK2E,QAAQrB,UAAa3C,EAQhC,CACL,MAAMa,EAASxB,KAAKoB,OAAOC,MAAMF,EAAMG,EAAM8O,QAC7C,GAAc,MAAV5O,EACF,OAEEA,aAAkBsf,EACf,KAAA/c,WAAWK,UAAU5C,EAAQb,GAElCA,IACCQ,IAASnB,KAAK2E,QAAQrB,UAAYtD,KAAKkE,UAAU/C,KAAUR,IAEvD,KAAAovC,YAAY5uC,EAAMR,EAE3B,MApBO,KAAAsB,SAASyC,SAASzB,IACfA,aAAiBsvC,IACrBtvC,EAAQA,EAAMgG,KAAKspC,EAAWjvC,UAAU,IAErC,KAAAS,WAAWg9B,KAAK99B,EAAoB,IAE3CjD,KAAK2H,QAeT,CAEO,OAAAzD,GACC,MAAAA,EAAUlE,KAAK+D,WAAWI,SAC1B3C,EAASxB,KAAK2E,QAAQT,QAAQlE,KAAKiE,QAASjE,KAAKoB,QACvD,OAAc,MAAVI,IACM0C,EAAAlE,KAAK2E,QAAQrB,UAAY9B,GAE5B0C,CACT,CAEO,QAAAhD,CACLF,EACAZ,EACAe,EACAR,GAG0B,MAAxBX,KAAKkE,UAAU/C,IACfnB,KAAKoB,OAAOC,MAAMF,EAAMG,EAAMgkB,WAEjBtlB,KAAK0H,QAAQ1G,EAAOZ,GAC5BoB,OAAOL,EAAMR,GAElBM,MAAMC,SAASF,EAAOZ,EAAQe,EAAMR,EAExC,CAEO,QAAAkC,CAASC,GACd7B,MAAM4B,SAASC,GACT,MAAAoB,EAAUlE,KAAKkE,UACrB,GAAoC,IAAhCoK,OAAOC,KAAKrK,GAAS9D,OACvB,OAAOJ,KAAK2H,SAEd,MAAMtE,EAAOrD,KAAKqD,KAEhBA,aAAgBkvC,GAChBlvC,EAAKyB,OAAS9E,MA3GpB,SACEwyC,EACAC,GAEI,GAAAnkC,OAAOC,KAAKikC,GAAMpyC,SAAWkO,OAAOC,KAAKkkC,GAAMryC,OAC1C,SAET,UAAWsyC,KAAQF,EACjB,GAAIA,EAAKE,KAAUD,EAAKC,GACf,SAGJ,QACT,CA+FM1/B,CAAQ9O,EAASb,EAAKa,aAEtBb,EAAKV,aAAa3C,MAClBqD,EAAKX,SAET,CAEO,WAAAqtC,CAAY5uC,EAAqBR,GACtC,MAAMqvC,EAAc/uC,MAAM8uC,YAAY5uC,EAAMR,GACvC,YAAAoD,WAAWg9B,KAAKiP,GACdA,CACT,CAEO,MAAA3oC,CACLC,EACAxE,GAEM,MAAAuE,OAAOC,EAAWxE,GACCwE,EAAUC,MAChCC,GACCA,EAAS5E,SAAW5C,KAAKiE,SAA6B,eAAlBuD,EAASC,QAG/CzH,KAAK+D,WAAW0rC,OAEpB,CAEO,IAAAxmC,CAAK9H,EAAuBR,GACjC,MAAMwvC,EAAUlvC,MAAMgI,KAAK9H,EAAMR,GACjC,OAAIwvC,aAAmBoC,GAChB,KAAAxuC,WAAW2rC,KAAKS,GAEhBA,CACT,GA7HcoC,EAAA9uC,gBAAqC,CAAC8uC,EAAYhyC,GAChEgyC,EAAcjvC,SAAW,SACzBivC,EAAc3tC,MAAQtD,EAAM+O,YAC5BkiC,EAAchvC,QAA6B,OAJ7C,IAAMiF,EAAN+pC,EChBA,MAAMI,EAAN,MAAMA,UAAkB/kC,EA8BtB,WAAAzI,CAAY/D,EAAc6C,GACxBhD,MAAMG,EAAQ6C,GACdjE,KAAK+D,WAAa,IAAIC,EAAgBhE,KAAKiE,QAC7C,CAvBA,aAAOQ,CAAO9D,GACL,OAAAM,MAAMwD,OAAO9D,EACtB,CAEA,cAAcuD,CAAQD,EAAsB7C,GAC1C,MAAMkR,EAAQlR,EAAOC,MAAMsxC,EAAUrvC,UACrC,GACW,MAATgP,GACArO,EAAQV,UAAa+O,EAA0B/O,QAGtC,IAAwB,iBAAjBvD,KAAKuD,QACd,SACE,GAAA0E,MAAMyG,QAAQ1O,KAAKuD,SACrB,OAAAU,EAAQV,QAAQylB,cAE3B,CASO,MAAAxnB,CAAOL,EAAcR,GAC1B,MAAMa,EAASxB,KAAKoB,OAAOC,MAAMF,EAAMG,EAAMC,OAC/B,MAAVC,IAEOA,aAAkBsf,EACtB,KAAA/c,WAAWK,UAAU5C,EAAQb,GACzBQ,IAASnB,KAAK2E,QAAQrB,UAAa3C,EAG5CA,IACCQ,IAASnB,KAAK2E,QAAQrB,UAAYtD,KAAKkE,UAAU/C,KAAUR,IAEvD,KAAAovC,YAAY5uC,EAAMR,GALlB,KAAAovC,YAAY4C,EAAUrvC,UAO/B,CAEO,OAAAY,GACC,MAAAA,EAAUlE,KAAK+D,WAAWI,SAC1B3C,EAASxB,KAAK2E,QAAQT,QAAQlE,KAAKiE,QAASjE,KAAKoB,QACvD,OAAc,MAAVI,IACM0C,EAAAlE,KAAK2E,QAAQrB,UAAY9B,GAE5B0C,CACT,CAEO,QAAAhD,CACLF,EACAZ,EACAe,EACAR,GAE4C,MAAxCX,KAAKoB,OAAOC,MAAMF,EAAMG,EAAMC,OAC3B,KAAAC,OAAOL,EAAMR,GAElBM,MAAMC,SAASF,EAAOZ,EAAQe,EAAMR,EAExC,CAEO,QAAAgB,CAASX,EAAeL,EAAeiB,GACxC,GAAO,MAAPA,GAAyD,MAA1C5B,KAAKoB,OAAOC,MAAMV,EAAOW,EAAM8O,QAE1C,MAAAzO,SAASX,EAAOL,EAAOiB,OACxB,CACC,MAAAqd,EAAQjf,KAAK8B,MAAMd,GACzB,GAAa,MAATie,EAII,UAAI5H,MAAM,8CAJC,CACjB,MAAMpX,EAAOD,KAAKoB,OAAOqD,OAAO9D,EAAOiB,GACjCqd,EAAA7b,OAAOd,aAAarC,EAAMgf,EAAK,CAIzC,CACF,CAEO,WAAA8wB,CAAY5uC,EAAqBR,GACtC,MAAMqvC,EAAc/uC,MAAM8uC,YAAY5uC,EAAMR,GACvC,YAAAoD,WAAWg9B,KAAKiP,GACdA,CACT,CAEO,MAAA3oC,CACLC,EACAxE,GAEM,MAAAuE,OAAOC,EAAWxE,GACCwE,EAAUC,MAChCC,GACCA,EAAS5E,SAAW5C,KAAKiE,SAA6B,eAAlBuD,EAASC,QAG/CzH,KAAK+D,WAAW0rC,OAEpB,GAzGAkD,EAAcrvC,SAAW,QACzBqvC,EAAc/tC,MAAQtD,EAAMuD,WAC5B8tC,EAAcpvC,QAA6B,IAC3CovC,EAAclvC,gBAAqC,CACjD+E,EACAmqC,EACApyC,GAPJ,IAAMV,EAAN8yC,ECTA,MAAMC,EAAN,cAA4BhlC,EAQnB,UAAAilC,GAEH,OAAc,OAAd7yC,KAAKqD,MAAiBrD,KAAKqD,KAAKsB,QAAQrB,WAAatD,KAAK2E,QAAQrB,QAEtE,CAEO,QAAAvC,CAASC,EAAeZ,GACvB,MAAAW,SAASC,EAAOZ,GACtBJ,KAAK2xC,wBACP,CAEO,QAAAzwC,CACLF,EACAZ,EACAe,EACAR,GAEAM,MAAMC,SAASF,EAAOZ,EAAQe,EAAMR,GACpCX,KAAK2xC,wBACP,CAEO,QAAAhwC,CAASX,EAAeL,EAAeiB,GACtC,MAAAD,SAASX,EAAOL,EAAOiB,GAC7B5B,KAAK2xC,wBACP,CAEO,QAAA9uC,CAASC,GACd7B,MAAM4B,SAASC,GACX9C,KAAKiC,SAAS7B,OAAS,GAAkB,MAAbJ,KAAKqD,MAAgBrD,KAAK6yC,eACnD,KAAAxvC,KAAKV,aAAa3C,MACvBA,KAAKqD,KAAKX,SAEd,GAvCAkwC,EAActvC,SAAW,YACzBsvC,EAAchuC,MAAQtD,EAAMuD,WAF9B,IAAMG,EAAN4tC,ECDA,MAAMjvC,UAAkBpD,EACtB,cAAc2D,CAAQosC,EAAuBwC,GAE7C,CAEO,MAAAtxC,CAAOL,EAAcR,GAI1BM,MAAMC,SAAS,EAAGlB,KAAKI,SAAUe,EAAMR,EACzC,CAEO,QAAAO,CACLF,EACAZ,EACAe,EACAR,GAEc,IAAVK,GAAeZ,IAAWJ,KAAKI,SAC5B,KAAAoB,OAAOL,EAAMR,GAElBM,MAAMC,SAASF,EAAOZ,EAAQe,EAAMR,EAExC,CAEO,OAAAuD,GACL,OAAOlE,KAAK2E,QAAQT,QAAQlE,KAAKiE,QAASjE,KAAKoB,OACjD,ECvBF,MAAM2xC,EAAkB,CACtBhvC,YAAY,EACZivC,eAAe,EACfC,uBAAuB,EACvBC,WAAW,EACXC,SAAS,GAKLC,EAAN,cAAyBxlC,EASvB,WAAAzI,CACSgR,EACPtQ,GAGA5E,MAAM,KAAM4E,GAJL,KAAAsQ,SAAAA,EAKPnW,KAAKoB,OAASpB,KACdA,KAAKyvC,QACLzvC,KAAKqzC,SAAW,IAAIC,kBAAkBhsC,IACpCtH,KAAKqH,OAAOC,EAAU,IAExBtH,KAAKqzC,SAASE,QAAQvzC,KAAKiE,QAAS8uC,GACpC/yC,KAAK8D,QACP,CAEO,MAAAW,CAAOg8B,EAA8B9/B,GAC1C,OAAOX,KAAKmW,SAAS1R,OAAOzE,KAAMygC,EAAO9/B,EAC3C,CAEO,IAAA4R,CAAK1M,EAAmB6Q,GAAS,GACtC,MAAMzW,EAAOD,KAAKmW,SAAS5D,KAAK1M,EAAM6Q,GACtC,OAAKzW,EAGDA,EAAKmB,SAAWpB,KACXC,EAEFyW,EAAS1W,KAAKuS,KAAKtS,EAAKmB,OAAO6C,QAAQoC,YAAY,GAAQ,KALzD,IAMX,CAEO,KAAAhF,CACLA,EACAuD,EAAetD,EAAMktC,KAErB,OAAOxuC,KAAKmW,SAAS9U,MAAMA,EAAOuD,EACpC,CAEO,QAAAiS,IAAYq4B,GACjB,OAAOlvC,KAAKmW,SAASU,YAAYq4B,EACnC,CAEO,KAAAO,GACc,MAAfzvC,KAAKoB,QAGTH,MAAMwuC,OACR,CAEO,MAAA9pC,GACL1E,MAAM0E,SACN3F,KAAKqzC,SAASG,YAChB,CAEO,QAAAzyC,CAASC,EAAeZ,GAC7BJ,KAAKqH,SACS,IAAVrG,GAAeZ,IAAWJ,KAAKI,SAC5B,KAAA6B,SAASyC,SAASzB,IACrBA,EAAMP,QAAQ,IAGV,MAAA3B,SAASC,EAAOZ,EAE1B,CAEO,QAAAc,CACLF,EACAZ,EACAe,EACAR,GAEAX,KAAKqH,SACLpG,MAAMC,SAASF,EAAOZ,EAAQe,EAAMR,EACtC,CAEO,QAAAgB,CAASX,EAAeL,EAAeiB,GAC5C5B,KAAKqH,SACC,MAAA1F,SAASX,EAAOL,EAAOiB,EAC/B,CAOO,QAAAiB,CAASyE,EAAiB,GAAIxE,EAAe,CAAC,GACnD7B,MAAM4B,SAASC,GACf,MAAM2wC,EAAe3wC,EAAQ2wC,cAAgB,IAAItnC,QAEjD,IAAIunC,EAAUzrC,MAAMC,KAAKlI,KAAKqzC,SAASM,eAGhC,KAAAD,EAAQtzC,OAAS,GACZkH,EAAA4E,KAAKwnC,EAAQpvC,OAEzB,MAAMsvC,EAAO,CAAC3zC,EAAmB4zC,GAAa,KAChC,MAAR5zC,GAAgBA,IAASD,MAGE,MAA3BC,EAAKgE,QAAQoC,aAGZotC,EAAa7qB,IAAI3oB,EAAKgE,UACzBwvC,EAAa76B,IAAI3Y,EAAKgE,QAAS,IAE7B4vC,GACFD,EAAK3zC,EAAKmD,QAAM,EAGdP,EAAY5C,IAEXwzC,EAAa7qB,IAAI3oB,EAAKgE,WAGvBhE,aAAgB2N,GACb3N,EAAAgC,SAASyC,QAAQ7B,GAEX4wC,EAAAhjC,OAAOxQ,EAAKgE,SACzBhE,EAAK4C,SAASC,GAAO,EAEvB,IAAImrC,EAAY3mC,EAChB,QAASyhB,EAAI,EAAGklB,EAAU7tC,OAAS,EAAG2oB,GAAK,EAAG,CAC5C,GAAIA,GApIsB,IAqIlB,UAAI1R,MAAM,mDA4BX,IA1BG42B,EAAAvpC,SAAS8C,IACjB,MAAMvH,EAAOD,KAAKuS,KAAK/K,EAAS5E,QAAQ,GAC5B,MAAR3C,IAGAA,EAAKgE,UAAYuD,EAAS5E,SACN,cAAlB4E,EAASC,MACXmsC,EAAK5zC,KAAKuS,KAAK/K,EAASod,iBAAiB,IACzC3c,MAAMC,KAAKV,EAAS2qC,YAAYztC,SAASmB,IACvC,MAAM5C,EAAQjD,KAAKuS,KAAK1M,GAAM,GAC9B+tC,EAAK3wC,GAAO,GACRA,aAAiB2K,GACb3K,EAAAhB,SAASyC,SAASovC,IACtBF,EAAKE,GAAY,EAAM,GACvB,KAGqB,eAAlBtsC,EAASC,MAClBmsC,EAAK3zC,EAAK6E,OAGd8uC,EAAK3zC,GAAI,IAEN,KAAAgC,SAASyC,QAAQ7B,GACtBorC,EAAYhmC,MAAMC,KAAKlI,KAAKqzC,SAASM,eACrCD,EAAUzF,EAAUtgC,QACb+lC,EAAQtzC,OAAS,GACZkH,EAAA4E,KAAKwnC,EAAQpvC,MAE3B,CACF,CAEO,MAAA+C,CACLC,EACAxE,EAAkC,CAAC,GAEvBwE,EAAAA,GAAatH,KAAKqzC,SAASM,cACjC,MAAAF,EAAAA,IAAmBtnC,QAEtB7E,EAAA9C,KAAKgD,IACJ,MAAMvH,EAAOD,KAAKuS,KAAK/K,EAAS5E,QAAQ,GACxC,OAAY,MAAR3C,EACK,KAELwzC,EAAa7qB,IAAI3oB,EAAKgE,UACxBwvC,EAAa1pC,IAAI9J,EAAKgE,SAASiI,KAAK1E,GAC7B,OAEPisC,EAAa76B,IAAI3Y,EAAKgE,QAAS,CAACuD,IACzBvH,EAAAA,IAGVyE,SAASzE,IACI,MAARA,GAAgBA,IAASD,MAAQyzC,EAAa7qB,IAAI3oB,EAAKgE,UACpDhE,EAAAoH,OAAOosC,EAAa1pC,IAAI9J,EAAKgE,UAAY,GAAInB,EAAQ,IAGhEA,EAAQ2wC,aAAeA,EACnBA,EAAa7qB,IAAI5oB,KAAKiE,UACxBhD,MAAMoG,OAAOosC,EAAa1pC,IAAI/J,KAAKiE,SAAUnB,GAE1C,KAAAD,SAASyE,EAAWxE,EAC3B,GAlMAswC,EAAc9vC,SAAW,SACzB8vC,EAAc5vC,aAAe3D,EACfuzC,EAAA3vC,gBAAqC,CAAC5D,EAAWmF,GAC/DouC,EAAcxuC,MAAQtD,EAAMuD,WAC5BuuC,EAAc7vC,QAAU,MAL1B,IAAMwV,EAANq6B,ECbA,MAAMW,EAAN,MAAMA,UAAiBxzC,EAerB,WAAA4E,CAAY/D,EAAcyE,GACxB5E,MAAMG,EAAQyE,GACd7F,KAAK+B,KAAO/B,KAAK2E,QAAQhE,MAAMX,KAAKiE,QACtC,CAdA,aAAcQ,CAAO9D,GACZ,OAAA2E,SAASC,eAAe5E,EACjC,CAEA,YAAcA,CAAMsD,GAClB,OAAOA,EAAQ8B,IACjB,CAUO,QAAAhF,CAASC,EAAeZ,GAC7BJ,KAAKiE,QAAQ8B,KAAO/F,KAAK+B,KACvB/B,KAAK+B,KAAK4L,MAAM,EAAG3M,GAAShB,KAAK+B,KAAK4L,MAAM3M,EAAQZ,EACxD,CAEO,KAAAY,CAAM6E,EAAYD,GACnB,OAAA5F,KAAKiE,UAAY4B,EACZD,GAED,CACV,CAEO,QAAAjE,CAASX,EAAeL,EAAeiB,GACjC,MAAPA,GACG,KAAAG,KAAO/B,KAAK+B,KAAK4L,MAAM,EAAG3M,GAASL,EAAQX,KAAK+B,KAAK4L,MAAM3M,GAC3D,KAAAiD,QAAQ8B,KAAO/F,KAAK+B,MAEnB,MAAAJ,SAASX,EAAOL,EAAOiB,EAEjC,CAEO,MAAAxB,GACL,OAAOJ,KAAK+B,KAAK3B,MACnB,CAEO,QAAAyC,CAASC,GACd7B,MAAM4B,SAASC,GACf9C,KAAK+B,KAAO/B,KAAK2E,QAAQhE,MAAMX,KAAKiE,SACX,IAArBjE,KAAK+B,KAAK3B,OACZJ,KAAK0C,SACI1C,KAAKqD,gBAAgB0wC,GAAY/zC,KAAKqD,KAAKyB,OAAS9E,OAC7DA,KAAK2B,SAAS3B,KAAKI,SAAWJ,KAAKqD,KAAkB1C,SACrDX,KAAKqD,KAAKX,SAEd,CAEO,QAAAoD,CAAS9E,EAAeyvC,GAAa,GACnC,OAACzwC,KAAKiE,QAASjD,EACxB,CAEO,KAAAc,CAAMd,EAAekC,GAAQ,GAClC,IAAKA,EAAO,CACV,GAAc,IAAVlC,EACK,OAAAhB,KAEL,GAAAgB,IAAUhB,KAAKI,SACjB,OAAOJ,KAAKqD,IAEhB,CACM,MAAA4b,EAAQjf,KAAKoB,OAAOqD,OAAOzE,KAAKiE,QAAQ+vC,UAAUhzC,IACxD,OAAAhB,KAAKoD,OAAOd,aAAa2c,EAAOjf,KAAKqD,WAAQ,GAC7CrD,KAAK+B,KAAO/B,KAAK2E,QAAQhE,MAAMX,KAAKiE,SAC7Bgb,CACT,CAEO,MAAA5X,CACLC,EACAwoC,GAGExoC,EAAUC,MAAMC,GAEM,kBAAlBA,EAASC,MAA4BD,EAAS5E,SAAW5C,KAAKiE,YAIlEjE,KAAK+B,KAAO/B,KAAK2E,QAAQhE,MAAMX,KAAKiE,SAExC,CAEO,KAAAtD,GACL,OAAOX,KAAK+B,IACd,GA3FAgyC,EAAuBzwC,SAAW,OAClCywC,EAAcnvC,MAAQtD,EAAM+O,YAF9B,IAAMzM,EAANmwC,ICHIE,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqB9zC,IAAjB+zC,EACH,OAAOA,EAAa70C,QAGrB,IAAIC,EAASy0C,EAAyBE,GAAY,CACjDnxB,GAAImxB,EACJE,QAAQ,EACR90C,QAAS,CAAC,GAUX,OANA+0C,EAAoBH,GAAU30C,EAAQA,EAAOD,QAAS20C,GAGtD10C,EAAO60C,QAAS,EAGT70C,EAAOD,OACf,CCxBA20C,EAAoBlb,EAAI,SAASx5B,GAChC,IAAI+0C,EAAS/0C,GAAUA,EAAOg1C,WAC7B,WAAa,OAAOh1C,EAAgB,OAAG,EACvC,WAAa,OAAOA,CAAQ,EAE7B,OADA00C,EAAoB1gB,EAAE+gB,EAAQ,CAAE/L,EAAG+L,IAC5BA,CACR,ECNAL,EAAoB1gB,EAAI,SAASj0B,EAAS4vC,GACzC,IAAI,IAAIj/B,KAAOi/B,EACX+E,EAAoBO,EAAEtF,EAAYj/B,KAASgkC,EAAoBO,EAAEl1C,EAAS2Q,IAC5E5B,OAAO49B,eAAe3sC,EAAS2Q,EAAK,CAAEwkC,YAAY,EAAM3qC,IAAKolC,EAAWj/B,IAG3E,ECPAgkC,EAAoBtY,EAAI,WACvB,GAA0B,iBAAf+Y,WAAyB,OAAOA,WAC3C,IACC,OAAO30C,MAAQ,IAAI87B,SAAS,cAAb,EAChB,CAAE,MAAOrb,GACR,GAAsB,iBAAXrE,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxB83B,EAAoBO,EAAI,SAASG,EAAKlC,GAAQ,OAAOpkC,OAAO2W,UAAUqI,eAAe5hB,KAAKkpC,EAAKlC,EAAO,ECCtGwB,EAAoBW,EAAI,SAASt1C,GACX,oBAAXu+B,QAA0BA,OAAO4H,aAC1Cp3B,OAAO49B,eAAe3sC,EAASu+B,OAAO4H,YAAa,CAAE/kC,MAAO,WAE7D2N,OAAO49B,eAAe3sC,EAAS,aAAc,CAAEoB,OAAO,GACvD,ECNAuzC,EAAoBY,IAAM,SAASt1C,GAGlC,OAFAA,EAAOu1C,MAAQ,GACVv1C,EAAOyC,WAAUzC,EAAOyC,SAAW,IACjCzC,CACR,+LCcA,SAAS+kB,EAAOtkB,GACd,OAAOA,aAAgBL,EAAAA,IAASK,aAAgB4D,EAAAA,EAClD,CAMA,SAASmxC,EAAY/0C,GACnB,MAAyD,mBAA1CA,EAAwBg1C,aACzC,CAEA,MAAMC,UAAen8B,EAAAA,WACnB7T,gBAAkB,SAClBA,iBAAmB,YACnBA,eAAiB,MACjBA,oBAAsBtF,EAAAA,GACtBsF,uBAAyB,CAACtF,EAAAA,GAAOiE,EAAAA,GAAYkB,EAAAA,GAK7CI,WAAAA,CACEgR,EACAlS,EAAuB6H,GAEvB,IADA,QAAE9B,GAA+B8B,EAEjC7K,MAAMkV,EAAUlS,GAChBjE,KAAKgK,QAAUA,EACfhK,KAAKm1C,OAAQ,EACbn1C,KAAK6C,WACL7C,KAAKsa,SACLta,KAAKiE,QAAQuF,iBAAiB,aAAciX,GAAMzgB,KAAKo1C,gBAAgB30B,IACzE,CAEApR,UAAAA,GACOpH,MAAMyG,QAAQ1O,KAAKm1C,SACtBn1C,KAAKm1C,MAAQ,GAEjB,CAEAzkC,QAAAA,GACE,IAAK1Q,KAAKm1C,MAAO,OACjB,MAAM7tC,EAAYtH,KAAKm1C,MACvBn1C,KAAKm1C,OAAQ,EACbn1C,KAAKqH,OAAOC,EACd,CAEA+tC,SAAAA,CAAUp1C,GACRD,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAOnJ,kBAAmBpK,EACtD,CAEAq1C,WAAAA,CAAYr1C,GACVD,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAOlJ,oBAAqBrK,EACxD,CAEAs1C,eAAAA,CAAgBt1C,EAAY2R,GAC1B5R,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAO/I,oBAAqBxK,EAAM2R,EAC9D,CAEA7Q,QAAAA,CAASC,EAAeZ,GACtB,MAAOo1C,EAAO5vC,GAAU5F,KAAKqC,KAAKrB,IAC3By0C,GAAQz1C,KAAKqC,KAAKrB,EAAQZ,GAEjC,GADAa,MAAMF,SAASC,EAAOZ,GACV,MAARq1C,GAAgBD,IAAUC,GAAQ7vC,EAAS,EAAG,CAChD,GAAI4vC,aAAiB3xC,EAAAA,IAAc4xC,aAAgB5xC,EAAAA,GAEjD,YADA7D,KAAK6C,WAGP,MAAMN,EACJkzC,EAAKxzC,SAASO,gBAAgBC,EAAAA,EAAQ,KAAOgzC,EAAKxzC,SAASO,KAE7DgzC,EAAM7yC,aAAa8yC,EAAMlzC,GAEzBizC,EAAM9yC,QACR,CACA1C,KAAK6C,UACP,CAEAyX,MAAAA,GAAuB,IAAhBG,IAAOta,UAAAC,OAAA,QAAAC,IAAAF,UAAA,KAAAA,UAAA,GACZH,KAAKiE,QAAQ+D,aAAa,kBAAmByS,EAAU,OAAS,QAClE,CAEAvZ,QAAAA,CAASF,EAAeZ,EAAgBoB,EAAgBb,GACtDM,MAAMC,SAASF,EAAOZ,EAAQoB,EAAQb,GACtCX,KAAK6C,UACP,CAEAlB,QAAAA,CAASX,EAAeL,EAAeiB,GACrC,GAAIZ,GAAShB,KAAKI,SAChB,GAAW,MAAPwB,GAAwD,MAAzC5B,KAAKoB,OAAOC,MAAMV,EAAOW,EAAAA,MAAMC,OAAgB,CAChE,MAAMtB,EAAOD,KAAKoB,OAAOqD,OAAOzE,KAAK2E,QAAQnB,aAAaF,UAC1DtD,KAAKyF,YAAYxF,GACN,MAAP2B,GAAejB,EAAMkP,SAAS,MAChC5P,EAAK0B,SAAS,EAAGhB,EAAMgN,MAAM,GAAI,GAAI/L,GAErC3B,EAAK0B,SAAS,EAAGhB,EAAOiB,EAE5B,KAAO,CACL,MAAMkQ,EAAQ9R,KAAKoB,OAAOqD,OAAO9D,EAAOiB,GACxC5B,KAAKyF,YAAYqM,EACnB,MAEA7Q,MAAMU,SAASX,EAAOL,EAAOiB,GAE/B5B,KAAK6C,UACP,CAEAP,YAAAA,CAAarC,EAAYsC,GACvB,GAAItC,EAAK0E,QAAQC,QAAUtD,EAAAA,MAAM+O,YAAa,CAC5C,MAAM8/B,EAAUnwC,KAAKoB,OAAOqD,OAC1BzE,KAAK2E,QAAQnB,aAAaF,UAE5B6sC,EAAQ1qC,YAAYxF,GACpBgB,MAAMqB,aAAa6tC,EAAS5tC,EAC9B,MACEtB,MAAMqB,aAAarC,EAAMsC,EAE7B,CAEAmP,cAAAA,CAAe1Q,EAAejB,GAC5B,MAAM21C,EAAe11C,KAAK21C,oBACxB51C,EAAM4O,QAAO,IAAI9N,MAAQH,OAAO,QAE5B+0C,EAAOC,EAAapxC,MAC1B,GAAY,MAARmxC,EAAc,OAElBz1C,KAAKqP,aAEL,MAAMmmC,EAAQE,EAAa1zC,QAC3B,GAAIwzC,EAAO,CACT,MAAMI,EACW,UAAfJ,EAAM/tC,OACoB,IAAzB+tC,EAAMz1C,MAAMK,WACTJ,KAAK8P,WAAWjM,EAAAA,GAAY7C,GAAO,IAAMA,EAAQhB,KAAKI,UACtDL,EACW,UAAfy1C,EAAM/tC,KACF+tC,EAAMz1C,OACN,IAAIc,MAAQH,OAAO,CAAE,CAAC80C,EAAMtlC,KAAMslC,EAAM70C,QAC9Ck1C,EAAqB71C,KAAMgB,EAAOjB,GAClC,MAAM+1C,EAAmC,UAAfN,EAAM/tC,KAAmB,EAAI,EACjDsuC,EAAe/0C,EAAQjB,EAAMK,SAAW01C,EAC1CF,GACF51C,KAAK2B,SAASo0C,EAAe,EAAG,MAGlC,MAAM7xC,GAAUtD,EAAAA,EAAAA,IAAcZ,KAAKqC,KAAKrB,GAAO,IACzC+C,EAAaiM,EAAAA,aAAaC,KAAK/L,EAASsxC,EAAMzxC,aAAe,CAAC,EACpEuK,OAAOC,KAAKxK,GAAYW,SAASvD,IAC/BnB,KAAKkB,SAAS60C,EAAe,EAAG,EAAG50C,EAAM4C,EAAW5C,GAAM,IAG5DH,EAAQ+0C,CACV,CAEA,IAAKhE,EAASiE,GAAiBh2C,KAAKiC,SAASsQ,KAAKvR,GAC9C00C,EAAat1C,SACX2xC,IACFA,EAAUA,EAAQjwC,MAAMk0C,GACxBA,EAAgB,GAGlBN,EAAahxC,SAASuxC,IACpB,GAAyB,UAArBA,EAAYxuC,KAKdouC,EAJc71C,KAAKk2C,YACjBD,EAAYlyC,WACZguC,QAAW1xC,GAEe,EAAG41C,EAAYl2C,WACtC,CACL,MAAMo2C,EAAan2C,KAAKyE,OACtBwxC,EAAY/lC,IACZ+lC,EAAYt1C,OAEdX,KAAKsC,aAAa6zC,EAAYpE,QAAW1xC,GACzCiO,OAAOC,KAAK0nC,EAAYlyC,YAAYW,SAASvD,IAC3Cg1C,EAAW30C,OAAOL,EAAM80C,EAAYlyC,WAAW5C,GAAM,GAEzD,MAIc,UAAds0C,EAAKhuC,MAAoBguC,EAAK11C,MAAMK,UAItCy1C,EAAqB71C,KAHN+xC,EACXA,EAAQnsC,OAAOmsC,EAAQ3wC,QAAU40C,EACjCh2C,KAAKI,SAC0Bq1C,EAAK11C,OAG1CC,KAAK0Q,WACL1Q,KAAK6C,UACP,CAEA6Y,SAAAA,GACE,MAAwD,SAAjD1b,KAAKiE,QAAQye,aAAa,kBACnC,CAEAjiB,IAAAA,CAAKO,GACH,MAAMy0C,EAAOz1C,KAAK+C,KAAK/B,GAAOsD,MAC9B,IAAKmxC,EACH,MAAO,CAAC,MAAO,GAGjB,MAAOx1C,EAAM2F,GAAU6vC,EACvB,OAAOx1C,aAAgBM,EAAAA,SAAW,CAACN,EAAM2F,GAAU,CAAC,MAAO,EAC7D,CAEAvD,IAAAA,CAAKrB,GACH,OAAIA,IAAUhB,KAAKI,SACVJ,KAAKqC,KAAKrB,EAAQ,GAGpBhB,KAAK8P,WAAWyU,EAAQvjB,EACjC,CAEAa,KAAAA,GAAoE,IAA9Db,EAAKb,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,EAAGC,EAAMD,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG0U,OAAOyG,UAC/B,MAAMD,EAAWA,CACfpb,EACAm2C,EACAC,KAEA,IAAIx0C,EAAgC,GAChC4vC,EAAa4E,EAajB,OAZAp2C,EAAKgC,SAAS4L,UACZuoC,EACAC,GACA,CAACpzC,EAAOyuC,EAAY5jC,KACdyW,EAAOthB,GACTpB,EAAMqK,KAAKjJ,GACFA,aAAiB+B,EAAAA,gBAC1BnD,EAAQA,EAAM8M,OAAO0M,EAASpY,EAAOyuC,EAAYD,KAEnDA,GAAc3jC,CAAW,IAGtBjM,CAAK,EAEd,OAAOwZ,EAASrb,KAAMgB,EAAOZ,EAC/B,CAOAyC,QAAAA,GAAuC,IAA9ByE,EAASnH,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,GAAI2C,EAAO3C,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,CAAC,EAC9BH,KAAKm1C,QACTl0C,MAAM4B,SAASyE,EAAWxE,GACtBwE,EAAUlH,OAAS,GACrBJ,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAOjJ,gBAAiBjD,EAAWxE,GAEjE,CAEAC,IAAAA,CAAK/B,GACH,OAAOC,MAAM8B,KAAK/B,GAAO2M,MAAM,EACjC,CAEAjL,MAAAA,GACE,CAKF2E,MAAAA,CAAOC,GACL,GAAItH,KAAKm1C,MAIP,YAHIltC,MAAMyG,QAAQpH,KAChBtH,KAAKm1C,MAAQn1C,KAAKm1C,MAAMxmC,OAAOrH,KAInC,IAAIkS,EAAwBjG,EAAAA,EAAQ8C,QAAQnL,KACnB,iBAAd5D,IACTkS,EAASlS,GAENW,MAAMyG,QAAQpH,KACjBA,EAAYtH,KAAKqzC,SAASM,gBAE5BrsC,EAAYA,EAAUpH,QAAOoY,IAAgB,IAAf,OAAE1V,GAAQ0V,EACtC,MAAMrY,EAAOD,KAAKuS,KAAK3P,GAAQ,GAC/B,OAAO3C,IAAS+0C,EAAY/0C,EAAK,KAErBG,OAAS,GACrBJ,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAOpJ,qBAAsBoP,EAAQlS,GAEjErG,MAAMoG,OAAOC,EAAUqH,OAAO,KAC1BrH,EAAUlH,OAAS,GACrBJ,KAAKgK,QAAQsB,KAAKiI,EAAAA,EAAQC,OAAOhJ,cAAegP,EAAQlS,EAE5D,CAEAgJ,aAAAA,CAActP,EAAekP,EAAa0B,GAGxC,MAAO3R,GAAQD,KAAK8P,YAAY24B,GAAYA,aAAa5kC,EAAAA,IAAY7C,GACjEf,GAAQA,EAAK0E,QAAQrB,WAAa4M,GAAO8kC,EAAY/0C,IACvDA,EAAKg1C,cAAcrjC,EAEvB,CAEUwjC,eAAAA,CAAgBzpC,GACxBA,EAAMmc,gBACR,CAEQ6tB,mBAAAA,CAAoB51C,GAC1B,MAAM21C,EAA8B,GAEpC,IAAIY,EAAoB,IAAIz1C,KAmD5B,OAlDAd,EAAM2E,SAASoK,IACb,MAAMpO,EAASoO,GAAIpO,OACnB,GAAKA,EACL,GAAsB,iBAAXA,EAAqB,CAC9B,MAAM61C,EAAW71C,EAAOoB,MAAM,MAC9By0C,EAAS5oC,MAAM,GAAI,GAAGjJ,SAAS3C,IAC7Bu0C,EAAkB51C,OAAOqB,EAAM+M,EAAG/K,YAClC2xC,EAAaxpC,KAAK,CAChBzE,KAAM,QACN1H,MAAOu2C,EACPvyC,WAAY+K,EAAG/K,YAAc,CAAC,IAEhCuyC,EAAoB,IAAIz1C,IAAO,IAEjC,MAAM40C,EAAOc,EAASA,EAASn2C,OAAS,GACpCq1C,GACFa,EAAkB51C,OAAO+0C,EAAM3mC,EAAG/K,WAEtC,KAAO,CACL,MAAMmM,EAAM5B,OAAOC,KAAK7N,GAAQ,GAChC,IAAKwP,EAAK,OACNlQ,KAAKqB,MAAM6O,EAAK5O,EAAAA,MAAM8O,QACxBkmC,EAAkBpqC,KAAK4C,IAEnBwnC,EAAkBl2C,UACpBs1C,EAAaxpC,KAAK,CAChBzE,KAAM,QACN1H,MAAOu2C,EACPvyC,WAAY,CAAC,IAGjBuyC,EAAoB,IAAIz1C,KACxB60C,EAAaxpC,KAAK,CAChBzE,KAAM,aACNyI,MACAvP,MAAOD,EAAOwP,GACdnM,WAAY+K,EAAG/K,YAAc,CAAC,IAGpC,KAGEuyC,EAAkBl2C,UACpBs1C,EAAaxpC,KAAK,CAChBzE,KAAM,QACN1H,MAAOu2C,EACPvyC,WAAY,CAAC,IAIV2xC,CACT,CAEQQ,WAAAA,CAAYnyC,EAA0BguC,GAC5C,IAAIzuC,EACJ,MAAMY,EAAwB,CAAC,EAE/BoK,OAAO8J,QAAQrU,GAAYW,SAAQ+jB,IAAkB,IAAhBvY,EAAKvP,GAAM8nB,EACmB,MAA7CzoB,KAAKqB,MAAM6O,EAAK5O,EAAAA,MAAMC,MAAQD,EAAAA,MAAM0H,MAEtD1F,EAAW4M,EAEXhM,EAAQgM,GAAOvP,CACjB,IAGF,MAAMwB,EAAQnC,KAAKyE,OACjBnB,GAAYtD,KAAK2E,QAAQnB,aAAaF,SACtCA,EAAWS,EAAWT,QAAYjD,GAGpCL,KAAKsC,aAAaH,EAAO4vC,QAAW1xC,GAEpC,MAAMD,EAAS+B,EAAM/B,SAKrB,OAJAkO,OAAO8J,QAAQlU,GAASQ,SAAQihB,IAAkB,IAAhBzV,EAAKvP,GAAMglB,EAC3CxjB,EAAMjB,SAAS,EAAGd,EAAQ8P,EAAKvP,EAAM,IAGhCwB,CACT,EAGF,SAAS0zC,EACPzyC,EACApC,EACAw1C,GAEAA,EAAeh2C,QAAO,CAACQ,EAAO8N,KAC5B,MAAM1O,EAASqP,EAAAA,GAAGrP,OAAO0O,GACzB,IAAI/K,EAAa+K,EAAG/K,YAAc,CAAC,EACnC,GAAiB,MAAb+K,EAAGpO,OACL,GAAyB,iBAAdoO,EAAGpO,OAAqB,CACjC,MAAMqB,EAAO+M,EAAGpO,OAChB0C,EAAOzB,SAASX,EAAOe,GACvB,MAAOtB,GAAQ2C,EAAO0M,WAAWvP,EAAAA,SAAUS,GACrCkD,GAAUtD,EAAAA,EAAAA,IAAcH,GAC9BsD,EAAaiM,EAAAA,aAAaC,KAAK/L,EAASH,IAAe,CAAC,CAC1D,MAAO,GAAyB,iBAAd+K,EAAGpO,OAAqB,CACxC,MAAMwP,EAAM5B,OAAOC,KAAKO,EAAGpO,QAAQ,GACnC,GAAW,MAAPwP,EAAa,OAAOlP,EAGxB,GAFAoC,EAAOzB,SAASX,EAAOkP,EAAKpB,EAAGpO,OAAOwP,IAC0B,MAA1C9M,EAAOhC,OAAOC,MAAM6O,EAAK5O,EAAAA,MAAM8O,QAClC,CACjB,MAAO3P,GAAQ2C,EAAO0M,WAAWvP,EAAAA,SAAUS,GACrCkD,GAAUtD,EAAAA,EAAAA,IAAcH,GAC9BsD,EAAaiM,EAAAA,aAAaC,KAAK/L,EAASH,IAAe,CAAC,CAC1D,CACF,CAKF,OAHAuK,OAAOC,KAAKxK,GAAYW,SAASwL,IAC/B9M,EAAOlC,SAASF,EAAOZ,EAAQ8P,EAAKnM,EAAWmM,GAAK,IAE/ClP,EAAQZ,CAAM,GACpBY,EACL,CAEA,qCClaA,MAAMy1C,UAAgBlgC,EAAAA,EAGpBmgC,aAAe,EACfC,cAAe,EACfrW,MAAe,CAAEsW,KAAM,GAAIC,KAAM,IACjCC,aAA6B,KAE7B3xC,WAAAA,CAAY0E,EAAc+C,GACxB3L,MAAM4I,EAAO+C,GACb5M,KAAK6J,MAAMuB,GACTsK,EAAAA,GAAMlC,OAAOrJ,eACb,CAACZ,EAAW5I,EAAO8R,EAAU+G,KACvBjQ,IAAcmM,EAAAA,GAAMlC,OAAO9I,iBACzB/J,GAAS6Y,IAAW9D,EAAAA,GAAMW,QAAQpL,SACpCjL,KAAK82C,aAAen2C,GAEb4I,IAAcmM,EAAAA,GAAMlC,OAAO7I,cAC/B3K,KAAK22C,eACH32C,KAAK4M,QAAQmqC,UAAYv9B,IAAW9D,EAAAA,GAAMW,QAAQnL,KAGrDlL,KAAK+8B,UAAUp8B,GAFfX,KAAKg3C,OAAOr2C,EAAO8R,IAMvBzS,KAAK82C,aAAeG,EAAej3C,KAAK82C,aAAcn2C,GACxD,IAIJX,KAAK6J,MAAMiM,SAASmU,WAClB,CAAE/Z,IAAK,IAAK4a,UAAU,GACtB9qB,KAAK42C,KAAKlqC,KAAK1M,OAEjBA,KAAK6J,MAAMiM,SAASmU,WAClB,CAAE/Z,IAAK,CAAC,IAAK,KAAM4a,UAAU,EAAMZ,UAAU,GAC7ClqB,KAAK62C,KAAKnqC,KAAK1M,OAEb,OAAOypB,KAAKC,UAAUC,WACxB3pB,KAAK6J,MAAMiM,SAASmU,WAClB,CAAE/Z,IAAK,IAAK4a,UAAU,GACtB9qB,KAAK62C,KAAKnqC,KAAK1M,OAInBA,KAAK6J,MAAMxK,KAAKmK,iBAAiB,eAAgBmC,IACvB,gBAApBA,EAAMurC,WACRl3C,KAAK42C,OACLjrC,EAAMmc,kBACuB,gBAApBnc,EAAMurC,YACfl3C,KAAK62C,OACLlrC,EAAMmc,iBACR,GAEJ,CAEAlW,MAAAA,CAAO4H,EAAyB29B,GAC9B,GAAkC,IAA9Bn3C,KAAKsgC,MAAM9mB,GAAQpZ,OAAc,OACrC,MAAMsuC,EAAO1uC,KAAKsgC,MAAM9mB,GAAQlV,MAChC,IAAKoqC,EAAM,OACX,MAAM7F,EAAO7oC,KAAK6J,MAAMmH,cAClBomC,EAAe1I,EAAK3uC,MAAM6oC,OAAOC,GACvC7oC,KAAKsgC,MAAM6W,GAAMjrC,KAAK,CACpBnM,MAAOq3C,EACPlxC,MAAO+wC,EAAevI,EAAKxoC,MAAOkxC,KAEpCp3C,KAAK02C,aAAe,EACpB12C,KAAK22C,cAAe,EACpB32C,KAAK6J,MAAMgU,eAAe6wB,EAAK3uC,MAAO2V,EAAAA,GAAMW,QAAQnL,MACpDlL,KAAK22C,cAAe,EAEpB32C,KAAKq3C,iBAAiB3I,EACxB,CAEA50B,KAAAA,GACE9Z,KAAKsgC,MAAQ,CAAEsW,KAAM,GAAIC,KAAM,GACjC,CAEA3qB,MAAAA,GACElsB,KAAK02C,aAAe,CACtB,CAEAM,MAAAA,CAAOM,EAAoBjlC,GACzB,GAA+B,IAA3BilC,EAAY/nC,IAAInP,OAAc,OAClCJ,KAAKsgC,MAAMuW,KAAO,GAClB,IAAIU,EAAYD,EAAY1O,OAAOv2B,GAC/BmlC,EAAYx3C,KAAK82C,aACrB,MAAMW,EAAY3J,KAAKC,MACvB,GAEE/tC,KAAK02C,aAAe12C,KAAK4M,QAAQ8qC,MAAQD,GACzCz3C,KAAKsgC,MAAMsW,KAAKx2C,OAAS,EACzB,CACA,MAAMsuC,EAAO1uC,KAAKsgC,MAAMsW,KAAKtyC,MACzBoqC,IACF6I,EAAYA,EAAUxkC,QAAQ27B,EAAK3uC,OACnCy3C,EAAY9I,EAAKxoC,MAErB,MACElG,KAAK02C,aAAee,EAEK,IAAvBF,EAAUn3C,WACdJ,KAAKsgC,MAAMsW,KAAK1qC,KAAK,CAAEnM,MAAOw3C,EAAWrxC,MAAOsxC,IAE5Cx3C,KAAKsgC,MAAMsW,KAAKx2C,OAASJ,KAAK4M,QAAQ+qC,UACxC33C,KAAKsgC,MAAMsW,KAAK50C,QAEpB,CAEA60C,IAAAA,GACE72C,KAAK4R,OAAO,OAAQ,OACtB,CAEAmrB,SAAAA,CAAUh9B,GACR63C,EAAe53C,KAAKsgC,MAAMsW,KAAM72C,GAChC63C,EAAe53C,KAAKsgC,MAAMuW,KAAM92C,EAClC,CAEA62C,IAAAA,GACE52C,KAAK4R,OAAO,OAAQ,OACtB,CAEUylC,gBAAAA,CAAiBQ,GACzB,GAAIA,EAAU3xC,MACZlG,KAAK6J,MAAMiR,aAAa+8B,EAAU3xC,MAAOwP,EAAAA,GAAMW,QAAQnL,UAClD,CACL,MAAMlK,EAwCZ,SAA4BI,EAAgBrB,GAC1C,MAAM+3C,EAAe/3C,EAAMS,QAAO,CAACJ,EAAQ0O,IAClC1O,GAAU0O,EAAG2B,QAAU,IAC7B,GACH,IAAIsnC,EAAch4C,EAAMK,SAAW03C,EAInC,OAtBF,SAA+B12C,EAAgBrB,GAC7C,MAAM0pC,EAAS1pC,EAAMwP,IAAIxP,EAAMwP,IAAInP,OAAS,GAC5C,OAAc,MAAVqpC,IACiB,MAAjBA,EAAO/oC,OACuB,iBAAlB+oC,EAAO/oC,QAAuB+oC,EAAO/oC,OAAOmP,SAAS,MAE5C,MAArB45B,EAAO1lC,YACFuK,OAAOC,KAAKk7B,EAAO1lC,YAAYwD,MAAM8d,GACA,MAAnCjkB,EAAOC,MAAMgkB,EAAM/jB,EAAAA,MAAMC,SAItC,CAOMy2C,CAAsB52C,EAAQrB,KAChCg4C,GAAe,GAEVA,CACT,CAjDoBE,CAAmBj4C,KAAK6J,MAAMzI,OAAQy2C,EAAU93C,OAC9DC,KAAK6J,MAAMiR,aAAa9Z,EAAO0U,EAAAA,GAAMW,QAAQnL,KAC/C,CACF,EAQF,SAAS0sC,EAAetX,EAAoBvgC,GAC1C,IAAIm4C,EAAcn4C,EAClB,IAAK,IAAIgpB,EAAIuX,EAAMlgC,OAAS,EAAG2oB,GAAK,EAAGA,GAAK,EAAG,CAC7C,MAAMovB,EAAU7X,EAAMvX,GACtBuX,EAAMvX,GAAK,CACThpB,MAAOm4C,EAAYnb,UAAUob,EAAQp4C,OAAO,GAC5CmG,MAAOiyC,EAAQjyC,OAAS+wC,EAAekB,EAAQjyC,MAAOgyC,IAExDA,EAAcC,EAAQp4C,MAAMg9B,UAAUmb,GACN,IAA5B5X,EAAMvX,GAAGhpB,MAAMK,UACjBkgC,EAAMtL,OAAOjM,EAAG,EAEpB,CACF,CA2BA,SAASkuB,EAAe/wC,EAAqBnG,GAC3C,IAAKmG,EAAO,OAAOA,EACnB,MAAMa,EAAQhH,EAAMme,kBAAkBhY,EAAMlF,OAE5C,MAAO,CAAEA,MAAO+F,EAAO3G,OADXL,EAAMme,kBAAkBhY,EAAMlF,MAAQkF,EAAM9F,QACnB2G,EACvC,CAnDA0vC,EAAQn/B,SAAW,CACjBogC,MAAO,IACPC,SAAU,IACVZ,UAAU,iBCnJZ,MAAMqB,UAAiB7hC,EAAAA,EAGrBpR,WAAAA,CAAY0E,EAAc+C,GACxB3L,MAAM4I,EAAO+C,GACb/C,EAAMxK,KAAKmK,iBAAiB,QAASiX,IACnCA,EAAEqH,iBACF,IAAInJ,EAAyD,KAC7D,GAAIrZ,SAAS+yC,oBACX15B,EAASrZ,SAAS+yC,oBAAoB53B,EAAE63B,QAAS73B,EAAE83B,cAE9C,GAAIjzC,SAASkzC,uBAAwB,CAE1C,MAAM1yC,EAAWR,SAASkzC,uBAAuB/3B,EAAE63B,QAAS73B,EAAE83B,SAC9D55B,EAASrZ,SAAS6Z,cAClBR,EAAOS,SAAStZ,EAAS2yC,WAAY3yC,EAASF,QAC9C+Y,EAAOU,OAAOvZ,EAAS2yC,WAAY3yC,EAASF,OAC9C,CAEA,MAAMga,EAAajB,GAAU9U,EAAMzE,UAAUqa,gBAAgBd,GAC7D,GAAIiB,EAAY,CACd,MAAM1Z,EAAQ2D,EAAMzE,UAAUya,kBAAkBD,GAC5Ca,EAAEi4B,cAActwB,OAClBpoB,KAAKqoB,OAAOniB,EAAOua,EAAEi4B,aAAatwB,MAEtC,IAEJ,CAEAC,MAAAA,CAAOniB,EAAckiB,GACnB,MAAMuwB,EAAkB,GACxB1wC,MAAMC,KAAKkgB,GAAO1jB,SAASk0C,IACrBA,GAAQ54C,KAAK4M,QAAQisC,WAAWz2B,SAASw2B,EAAKnxC,OAChDkxC,EAAQzsC,KAAK0sC,EACf,IAEED,EAAQv4C,OAAS,GAEnBJ,KAAK4M,QAAQb,QAAQL,KAAK1L,KAAMkG,EAAOyyC,EAE3C,EAGFP,EAAS9gC,SAAW,CAClBuhC,UAAW,CAAC,YAAa,cACzB9sC,OAAAA,CAAQ7F,EAAckiB,GACpB,MAAM0wB,EAAW1wB,EAAM5jB,KAAKo0C,GACnB,IAAIja,SAASgF,IAClB,MAAMoV,EAAS,IAAIC,WACnBD,EAAOE,OAAUx4B,IAEfkjB,EAAQljB,EAAE7d,OAAO85B,OAAO,EAE1Bqc,EAAOG,cAAcN,EAAK,MAG9Bja,QAAQwa,IAAIL,GAAUM,MAAMC,IAC1B,MAAMhyC,EAASgyC,EAAO74C,QAAO,CAACT,EAAcu5C,IACnCv5C,EAAMW,OAAO,CAAE44C,YACrB,IAAIz4C,MAAQ+O,OAAO1J,EAAMlF,OAAOyP,OAAOvK,EAAM9F,SAChDJ,KAAK6J,MAAMgU,eAAexW,EAAQkM,EAAAA,EAAQ8C,QAAQnL,MAClDlL,KAAK6J,MAAMiR,aACT5U,EAAMlF,MAAQq4C,EAAOj5C,OACrBmT,EAAAA,EAAQ8C,QAAQpL,OACjB,GAEL,GAGF,QC1EA,MAAMsuC,EAAe,CAAC,aAAc,yBAEpC,MAAMC,UAAcjjC,EAAAA,EAClBpR,WAAAA,CAAY0E,EAAc+C,GACxB3L,MAAM4I,EAAO+C,GAEb/C,EAAMxK,KAAKmK,iBAAiB,eAAgBmC,IAC1C3L,KAAKy5C,kBAAkB9tC,EAAM,IAK1B,WAAW8d,KAAKC,UAAUa,YAC7B1gB,EAAMuB,GAAGsK,EAAAA,GAAMlC,OAAO5I,0BAA0B,KAC9C5K,KAAKmT,wBAAwB,GAGnC,CAEQ+U,WAAAA,CAAYhiB,IAClBgiB,EAAAA,EAAAA,IAAY,CAAEhiB,QAAO2D,MAAO7J,KAAK6J,OACnC,CAEQ6vC,WAAAA,CAAYxzC,GAAyB,IAAXnE,EAAI5B,UAAAC,OAAA,QAAAC,IAAAF,UAAA,GAAAA,UAAA,GAAG,GACvC,GAAqB,IAAjB+F,EAAM9F,OAAc,OAAO,EAE/B,GAAI2B,EAAM,CAER,MAAMmC,EAAUlE,KAAK6J,MAAMoH,UAAU/K,EAAMlF,MAAO,GAClDhB,KAAKkoB,YAAYhiB,GACjBlG,KAAK6J,MAAMgU,gBACT,IAAIhd,MAAQ+O,OAAO1J,EAAMlF,OAAON,OAAOqB,EAAMmC,GAC7CwR,EAAAA,GAAMW,QAAQnL,KAElB,MACElL,KAAKkoB,YAAYhiB,GAInB,OADAlG,KAAK6J,MAAMiR,aAAa5U,EAAMlF,MAAQe,EAAK3B,OAAQ,EAAGsV,EAAAA,GAAMW,QAAQpL,SAC7D,CACT,CAEQwuC,iBAAAA,CAAkB9tC,GACxB,GACE3L,KAAK6J,MAAMsP,YAAYlG,aACvBtH,EAAMkc,mBACL0xB,EAAan3B,SAASzW,EAAMurC,WAE7B,OAGF,MAAMyC,EAAchuC,EAAMiuC,gBACtBjuC,EAAMiuC,kBAAkB,GACxB,KACJ,IAAKD,IAAyC,IAA1BA,EAAY36B,UAC9B,OAGF,MAAMjd,EAqBV,SAAoC4J,GAQlC,MAA0B,iBAAfA,EAAM5F,KACR4F,EAAM5F,KAEX4F,EAAM+sC,cAAczrC,MAAMmV,SAAS,cAC9BzW,EAAM+sC,aAAavwB,QAAQ,cAE7B,IACT,CApCiB0xB,CAA2BluC,GACxC,GAAY,MAAR5J,EACF,OAEF,MAAM6d,EAAa5f,KAAK6J,MAAMzE,UAAUqa,gBAAgBk6B,GAClDzzC,EAAQ0Z,EACV5f,KAAK6J,MAAMzE,UAAUya,kBAAkBD,GACvC,KACA1Z,GAASlG,KAAK05C,YAAYxzC,EAAOnE,IACnC4J,EAAMmc,gBAEV,CAEQ3U,sBAAAA,GACN,MAAMjN,EAAQlG,KAAK6J,MAAMgR,eACrB3U,GACFlG,KAAK05C,YAAYxzC,EAErB,EAoBF,QClGA,MAAM4zC,EAAQ,OAAOrwB,KAAKC,UAAUC,UAyBpC,MAAMowB,UAAexjC,EAAAA,EACnByjC,aAAc,EACdC,wBAA0B,EAE1B90C,WAAAA,CAAY0E,EAAc+C,GACxB3L,MAAM4I,EAAO+C,GAEb5M,KAAKk6C,kBACLl6C,KAAKm6C,2BACP,CAEQD,eAAAA,GACNl6C,KAAK6J,MAAMiM,SAASmU,WAAW,CAC7B/Z,IAAK,CAAC,YAAa,cACnBtK,OAAQ,EACRskB,SAAU,KACVne,OAAAA,CAAQ7F,EAAK4F,GAAmB,IAAjB,KAAEzJ,EAAI,MAAEsJ,GAAOG,EAC5B,KAAMzJ,aAAgBuL,EAAAA,YAAgBvL,EAAK+uC,QACzC,OAAO,EAGT,MAAMgJ,EAAwD,QAAhD59B,iBAAiBna,EAAK4B,SAAoB,UACxD,SACGm2C,GAAuB,eAAdzuC,EAAMuE,MACdkqC,GAAuB,cAAdzuC,EAAMuE,OAKnBlQ,KAAK6J,MAAMiR,aACT5U,EAAMlF,MAAQ,EACdkF,EAAM9F,QAAUuL,EAAMue,SAAW,EAAI,GACrCxU,EAAAA,GAAMW,QAAQnL,OAET,EACT,GAEJ,CAEQivC,yBAAAA,GACNn6C,KAAK6J,MAAMxK,KAAKmK,iBAAiB,WAAYmC,KACtCA,EAAMkc,kBA3DiBlc,IAEhB,cAAdA,EAAMuE,KACQ,eAAdvE,EAAMuE,KACQ,YAAdvE,EAAMuE,KACQ,cAAdvE,EAAMuE,KACQ,SAAdvE,EAAMuE,QAKJ4pC,GAAuB,MAAdnuC,EAAMuE,MAAiC,IAAlBvE,EAAM0e,SAgDLgwB,CAAyB1uC,IACtD3L,KAAKs6C,kCACP,GAEJ,CAQQA,gCAAAA,GACNt6C,KAAKi6C,wBAA0BnM,KAAKC,MA5EM,IA8EtC/tC,KAAKg6C,cACTh6C,KAAKg6C,aAAc,EAUnB10C,SAASkE,iBAAiB,mBARTokB,KACf5tB,KAAKg6C,aAAc,EAEflM,KAAKC,OAAS/tC,KAAKi6C,yBACrBj6C,KAAKu6C,uBACP,GAGqD,CACrD3+B,MAAM,IAEV,CAEQ2+B,qBAAAA,GACN,MAAMn1C,EAAYE,SAASuV,eAC3B,IAAKzV,EAAW,OAChB,MAAMc,EAAQd,EAAUoa,WAAW,GACnC,IAAwB,IAApBtZ,EAAM8Y,WAA4C,IAAtB9Y,EAAMgB,YAAmB,OAEzD,MAAM7E,EAAOrC,KAAK6J,MAAMzI,OAAOmR,KAAKrM,EAAM+Z,gBAC1C,KAAM5d,aAAgBuL,EAAAA,YAAgBvL,EAAK+uC,QAAQ,OAEnD,MAAMt+B,EAAWxN,SAAS6Z,cAC1BrM,EAAS0nC,cAAcn4C,EAAK+uC,QAC5Bt+B,EAAS2nC,YAAYp4C,EAAK+uC,QAC1BhsC,EAAUmb,kBACVnb,EAAUob,SAAS1N,EACrB,EAGF,QCjGA4C,EAAAA,GAAMmB,SAAS,CACb,cAAejX,EAAAA,GACf,oBAAqBiE,EAAAA,GACrB,cAAepB,EAAAA,EACf,kBAAmBsC,EAAAA,EACnB,eAAgBE,EAAAA,EAChB,cAAe4C,EAAAA,EACf,eAAgBnE,EAAAA,EAChB,eAAgBwxC,EAChB,aAActxC,EAAAA,EAEd,oBAAqB8iB,EAAAA,GACrB,kBAAmB+vB,EACnB,mBAAoB7sB,EAAAA,GACpB,mBAAoBwuB,EACpB,gBAAiBoB,EACjB,iBAAkBO,IAGpB,MAAerkC,EAAK,gBjN9BpB","sources":["webpack://Quill/webpack/universalModuleDefinition","webpack://Quill/./src/blots/block.ts","webpack://Quill/./src/blots/break.ts","webpack://Quill/./src/blots/container.ts","webpack://Quill/./src/blots/cursor.ts","webpack://Quill/./src/blots/embed.ts","webpack://Quill/./src/blots/inline.ts","webpack://Quill/./src/blots/text.ts","webpack://Quill/./src/core/emitter.ts","webpack://Quill/./src/core/instances.ts","webpack://Quill/./src/core/logger.ts","webpack://Quill/./src/core/module.ts","webpack://Quill/./src/core/editor.ts","webpack://Quill/./src/core/composition.ts","webpack://Quill/./src/core/utils/scrollRectIntoView.ts","webpack://Quill/./src/core/utils/createRegistryWithFormats.ts","webpack://Quill/./src/core/quill.ts","webpack://Quill/./src/core/selection.ts","webpack://Quill/./src/core/theme.ts","webpack://Quill/./src/formats/align.ts","webpack://Quill/./src/formats/background.ts","webpack://Quill/./src/formats/code.ts","webpack://Quill/./src/formats/color.ts","webpack://Quill/./src/formats/direction.ts","webpack://Quill/./src/formats/font.ts","webpack://Quill/./src/formats/size.ts","webpack://Quill/./src/modules/normalizeExternalHTML/normalizers/googleDocs.ts","webpack://Quill/./src/modules/normalizeExternalHTML/normalizers/msWord.ts","webpack://Quill/./src/modules/normalizeExternalHTML/index.ts","webpack://Quill/./src/modules/clipboard.ts","webpack://Quill/./src/modules/keyboard.ts","webpack://Quill/../../node_modules/eventemitter3/index.js","webpack://Quill/../../node_modules/fast-diff/diff.js","webpack://Quill/../../node_modules/lodash.clonedeep/index.js","webpack://Quill/../../node_modules/lodash.isequal/index.js","webpack://Quill/../../node_modules/quill-delta/src/AttributeMap.ts","webpack://Quill/../../node_modules/quill-delta/src/Delta.ts","webpack://Quill/../../node_modules/quill-delta/src/Op.ts","webpack://Quill/../../node_modules/quill-delta/src/OpIterator.ts","webpack://Quill/../../node_modules/lodash-es/_listCacheClear.js","webpack://Quill/../../node_modules/lodash-es/_assocIndexOf.js","webpack://Quill/../../node_modules/lodash-es/_listCacheDelete.js","webpack://Quill/../../node_modules/lodash-es/_ListCache.js","webpack://Quill/../../node_modules/lodash-es/_listCacheGet.js","webpack://Quill/../../node_modules/lodash-es/_listCacheHas.js","webpack://Quill/../../node_modules/lodash-es/_listCacheSet.js","webpack://Quill/../../node_modules/lodash-es/_Map.js","webpack://Quill/../../node_modules/lodash-es/_nativeCreate.js","webpack://Quill/../../node_modules/lodash-es/_hashGet.js","webpack://Quill/../../node_modules/lodash-es/_hashHas.js","webpack://Quill/../../node_modules/lodash-es/_Hash.js","webpack://Quill/../../node_modules/lodash-es/_hashClear.js","webpack://Quill/../../node_modules/lodash-es/_hashDelete.js","webpack://Quill/../../node_modules/lodash-es/_hashSet.js","webpack://Quill/../../node_modules/lodash-es/_getMapData.js","webpack://Quill/../../node_modules/lodash-es/_isKeyable.js","webpack://Quill/../../node_modules/lodash-es/_MapCache.js","webpack://Quill/../../node_modules/lodash-es/_mapCacheClear.js","webpack://Quill/../../node_modules/lodash-es/_mapCacheDelete.js","webpack://Quill/../../node_modules/lodash-es/_mapCacheGet.js","webpack://Quill/../../node_modules/lodash-es/_mapCacheHas.js","webpack://Quill/../../node_modules/lodash-es/_mapCacheSet.js","webpack://Quill/../../node_modules/lodash-es/_Stack.js","webpack://Quill/../../node_modules/lodash-es/_stackClear.js","webpack://Quill/../../node_modules/lodash-es/_stackDelete.js","webpack://Quill/../../node_modules/lodash-es/_stackGet.js","webpack://Quill/../../node_modules/lodash-es/_stackHas.js","webpack://Quill/../../node_modules/lodash-es/_stackSet.js","webpack://Quill/../../node_modules/lodash-es/_Symbol.js","webpack://Quill/../../node_modules/lodash-es/_Uint8Array.js","webpack://Quill/../../node_modules/lodash-es/_baseTimes.js","webpack://Quill/../../node_modules/lodash-es/_arrayLikeKeys.js","webpack://Quill/../../node_modules/lodash-es/_arrayPush.js","webpack://Quill/../../node_modules/lodash-es/_assignValue.js","webpack://Quill/../../node_modules/lodash-es/_baseAssignValue.js","webpack://Quill/../../node_modules/lodash-es/_baseGetAllKeys.js","webpack://Quill/../../node_modules/lodash-es/_getRawTag.js","webpack://Quill/../../node_modules/lodash-es/_objectToString.js","webpack://Quill/../../node_modules/lodash-es/_baseGetTag.js","webpack://Quill/../../node_modules/lodash-es/_baseUnary.js","webpack://Quill/../../node_modules/lodash-es/_cloneArrayBuffer.js","webpack://Quill/../../node_modules/lodash-es/_cloneBuffer.js","webpack://Quill/../../node_modules/lodash-es/_cloneTypedArray.js","webpack://Quill/../../node_modules/lodash-es/_copyArray.js","webpack://Quill/../../node_modules/lodash-es/_copyObject.js","webpack://Quill/../../node_modules/lodash-es/_defineProperty.js","webpack://Quill/../../node_modules/lodash-es/_freeGlobal.js","webpack://Quill/../../node_modules/lodash-es/_getAllKeys.js","webpack://Quill/../../node_modules/lodash-es/_isMasked.js","webpack://Quill/../../node_modules/lodash-es/_coreJsData.js","webpack://Quill/../../node_modules/lodash-es/_baseIsNative.js","webpack://Quill/../../node_modules/lodash-es/_getNative.js","webpack://Quill/../../node_modules/lodash-es/_getValue.js","webpack://Quill/../../node_modules/lodash-es/_getPrototype.js","webpack://Quill/../../node_modules/lodash-es/_arrayFilter.js","webpack://Quill/../../node_modules/lodash-es/_getSymbols.js","webpack://Quill/../../node_modules/lodash-es/_DataView.js","webpack://Quill/../../node_modules/lodash-es/_Promise.js","webpack://Quill/../../node_modules/lodash-es/_Set.js","webpack://Quill/../../node_modules/lodash-es/_WeakMap.js","webpack://Quill/../../node_modules/lodash-es/_getTag.js","webpack://Quill/../../node_modules/lodash-es/_baseCreate.js","webpack://Quill/../../node_modules/lodash-es/_initCloneObject.js","webpack://Quill/../../node_modules/lodash-es/_isIndex.js","webpack://Quill/../../node_modules/lodash-es/_isPrototype.js","webpack://Quill/../../node_modules/lodash-es/_nodeUtil.js","webpack://Quill/../../node_modules/lodash-es/_overArg.js","webpack://Quill/../../node_modules/lodash-es/_root.js","webpack://Quill/../../node_modules/lodash-es/_toSource.js","webpack://Quill/../../node_modules/lodash-es/_getSymbolsIn.js","webpack://Quill/../../node_modules/lodash-es/_getAllKeysIn.js","webpack://Quill/../../node_modules/lodash-es/_initCloneArray.js","webpack://Quill/../../node_modules/lodash-es/_cloneRegExp.js","webpack://Quill/../../node_modules/lodash-es/_cloneSymbol.js","webpack://Quill/../../node_modules/lodash-es/_initCloneByTag.js","webpack://Quill/../../node_modules/lodash-es/_cloneDataView.js","webpack://Quill/../../node_modules/lodash-es/isMap.js","webpack://Quill/../../node_modules/lodash-es/_baseIsMap.js","webpack://Quill/../../node_modules/lodash-es/isSet.js","webpack://Quill/../../node_modules/lodash-es/_baseIsSet.js","webpack://Quill/../../node_modules/lodash-es/_baseClone.js","webpack://Quill/../../node_modules/lodash-es/_copySymbolsIn.js","webpack://Quill/../../node_modules/lodash-es/_baseAssignIn.js","webpack://Quill/../../node_modules/lodash-es/_copySymbols.js","webpack://Quill/../../node_modules/lodash-es/_baseAssign.js","webpack://Quill/../../node_modules/lodash-es/_arrayEach.js","webpack://Quill/../../node_modules/lodash-es/cloneDeep.js","webpack://Quill/../../node_modules/lodash-es/eq.js","webpack://Quill/../../node_modules/lodash-es/_baseIsArguments.js","webpack://Quill/../../node_modules/lodash-es/isArguments.js","webpack://Quill/../../node_modules/lodash-es/isArray.js","webpack://Quill/../../node_modules/lodash-es/isArrayLike.js","webpack://Quill/../../node_modules/lodash-es/isBuffer.js","webpack://Quill/../../node_modules/lodash-es/stubFalse.js","webpack://Quill/../../node_modules/lodash-es/_SetCache.js","webpack://Quill/../../node_modules/lodash-es/_setCacheAdd.js","webpack://Quill/../../node_modules/lodash-es/_setCacheHas.js","webpack://Quill/../../node_modules/lodash-es/_arraySome.js","webpack://Quill/../../node_modules/lodash-es/_equalArrays.js","webpack://Quill/../../node_modules/lodash-es/_cacheHas.js","webpack://Quill/../../node_modules/lodash-es/_mapToArray.js","webpack://Quill/../../node_modules/lodash-es/_setToArray.js","webpack://Quill/../../node_modules/lodash-es/_equalByTag.js","webpack://Quill/../../node_modules/lodash-es/_equalObjects.js","webpack://Quill/../../node_modules/lodash-es/_baseIsEqualDeep.js","webpack://Quill/../../node_modules/lodash-es/_baseIsEqual.js","webpack://Quill/../../node_modules/lodash-es/isEqual.js","webpack://Quill/../../node_modules/lodash-es/isFunction.js","webpack://Quill/../../node_modules/lodash-es/isLength.js","webpack://Quill/../../node_modules/lodash-es/isObject.js","webpack://Quill/../../node_modules/lodash-es/isObjectLike.js","webpack://Quill/../../node_modules/lodash-es/_baseIsTypedArray.js","webpack://Quill/../../node_modules/lodash-es/isTypedArray.js","webpack://Quill/../../node_modules/lodash-es/_nativeKeys.js","webpack://Quill/../../node_modules/lodash-es/_baseKeys.js","webpack://Quill/../../node_modules/lodash-es/keys.js","webpack://Quill/../../node_modules/lodash-es/_baseKeysIn.js","webpack://Quill/../../node_modules/lodash-es/_nativeKeysIn.js","webpack://Quill/../../node_modules/lodash-es/keysIn.js","webpack://Quill/../../node_modules/lodash-es/_shortOut.js","webpack://Quill/../../node_modules/lodash-es/_createAssigner.js","webpack://Quill/../../node_modules/lodash-es/_assignMergeValue.js","webpack://Quill/../../node_modules/lodash-es/_baseFor.js","webpack://Quill/../../node_modules/lodash-es/_createBaseFor.js","webpack://Quill/../../node_modules/lodash-es/isPlainObject.js","webpack://Quill/../../node_modules/lodash-es/_safeGet.js","webpack://Quill/../../node_modules/lodash-es/_baseMergeDeep.js","webpack://Quill/../../node_modules/lodash-es/isArrayLikeObject.js","webpack://Quill/../../node_modules/lodash-es/toPlainObject.js","webpack://Quill/../../node_modules/lodash-es/_baseMerge.js","webpack://Quill/../../node_modules/lodash-es/identity.js","webpack://Quill/../../node_modules/lodash-es/_overRest.js","webpack://Quill/../../node_modules/lodash-es/_baseSetToString.js","webpack://Quill/../../node_modules/lodash-es/constant.js","webpack://Quill/../../node_modules/lodash-es/_setToString.js","webpack://Quill/../../node_modules/lodash-es/_baseRest.js","webpack://Quill/../../node_modules/lodash-es/_apply.js","webpack://Quill/../../node_modules/lodash-es/merge.js","webpack://Quill/../../node_modules/lodash-es/_isIterateeCall.js","webpack://Quill/../../node_modules/lodash-es/stubArray.js","webpack://Quill/../../node_modules/parchment/src/scope.ts","webpack://Quill/../../node_modules/parchment/src/attributor/attributor.ts","webpack://Quill/../../node_modules/parchment/src/error.ts","webpack://Quill/../../node_modules/parchment/src/registry.ts","webpack://Quill/../../node_modules/parchment/src/attributor/class.ts","webpack://Quill/../../node_modules/parchment/src/attributor/style.ts","webpack://Quill/../../node_modules/parchment/src/attributor/store.ts","webpack://Quill/../../node_modules/parchment/src/blot/abstract/shadow.ts","webpack://Quill/../../node_modules/parchment/src/blot/abstract/leaf.ts","webpack://Quill/../../node_modules/parchment/src/collection/linked-list.ts","webpack://Quill/../../node_modules/parchment/src/blot/abstract/parent.ts","webpack://Quill/../../node_modules/parchment/src/blot/inline.ts","webpack://Quill/../../node_modules/parchment/src/blot/block.ts","webpack://Quill/../../node_modules/parchment/src/blot/abstract/container.ts","webpack://Quill/../../node_modules/parchment/src/blot/embed.ts","webpack://Quill/../../node_modules/parchment/src/blot/scroll.ts","webpack://Quill/../../node_modules/parchment/src/blot/text.ts","webpack://Quill/webpack/bootstrap","webpack://Quill/webpack/runtime/compat get default export","webpack://Quill/webpack/runtime/define property getters","webpack://Quill/webpack/runtime/global","webpack://Quill/webpack/runtime/hasOwnProperty shorthand","webpack://Quill/webpack/runtime/make namespace object","webpack://Quill/webpack/runtime/node module decorator","webpack://Quill/./src/blots/scroll.ts","webpack://Quill/./src/modules/history.ts","webpack://Quill/./src/modules/uploader.ts","webpack://Quill/./src/modules/input.ts","webpack://Quill/./src/modules/uiNode.ts","webpack://Quill/./src/core.ts"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Quill\"] = factory();\n\telse\n\t\troot[\"Quill\"] = factory();\n})(self, function() {\nreturn ","import {\n  AttributorStore,\n  BlockBlot,\n  EmbedBlot,\n  LeafBlot,\n  Scope,\n} from 'parchment';\nimport type { Blot, Parent } from 'parchment';\nimport Delta from 'quill-delta';\nimport Break from './break.js';\nimport Inline from './inline.js';\nimport TextBlot from './text.js';\n\nconst NEWLINE_LENGTH = 1;\n\nclass Block extends BlockBlot {\n  cache: { delta?: Delta | null; length?: number } = {};\n\n  delta(): Delta {\n    if (this.cache.delta == null) {\n      this.cache.delta = blockDelta(this);\n    }\n    return this.cache.delta;\n  }\n\n  deleteAt(index: number, length: number) {\n    super.deleteAt(index, length);\n    this.cache = {};\n  }\n\n  formatAt(index: number, length: number, name: string, value: unknown) {\n    if (length <= 0) return;\n    if (this.scroll.query(name, Scope.BLOCK)) {\n      if (index + length === this.length()) {\n        this.format(name, value);\n      }\n    } else {\n      super.formatAt(\n        index,\n        Math.min(length, this.length() - index - 1),\n        name,\n        value,\n      );\n    }\n    this.cache = {};\n  }\n\n  insertAt(index: number, value: string, def?: unknown) {\n    if (def != null) {\n      super.insertAt(index, value, def);\n      this.cache = {};\n      return;\n    }\n    if (value.length === 0) return;\n    const lines = value.split('\\n');\n    const text = lines.shift() as string;\n    if (text.length > 0) {\n      if (index < this.length() - 1 || this.children.tail == null) {\n        super.insertAt(Math.min(index, this.length() - 1), text);\n      } else {\n        this.children.tail.insertAt(this.children.tail.length(), text);\n      }\n      this.cache = {};\n    }\n    // TODO: Fix this next time the file is edited.\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    let block: Blot | this = this;\n    lines.reduce((lineIndex, line) => {\n      // @ts-expect-error Fix me later\n      block = block.split(lineIndex, true);\n      block.insertAt(0, line);\n      return line.length;\n    }, index + text.length);\n  }\n\n  insertBefore(blot: Blot, ref?: Blot | null) {\n    const { head } = this.children;\n    super.insertBefore(blot, ref);\n    if (head instanceof Break) {\n      head.remove();\n    }\n    this.cache = {};\n  }\n\n  length() {\n    if (this.cache.length == null) {\n      this.cache.length = super.length() + NEWLINE_LENGTH;\n    }\n    return this.cache.length;\n  }\n\n  moveChildren(target: Parent, ref?: Blot | null) {\n    // @ts-expect-error Parchment types are wrong\n    super.moveChildren(target, ref);\n    this.cache = {};\n  }\n\n  optimize(context: { [key: string]: any }) {\n    super.optimize(context);\n    this.cache = {};\n  }\n\n  path(index: number) {\n    return super.path(index, true);\n  }\n\n  removeChild(child: Blot) {\n    super.removeChild(child);\n    this.cache = {};\n  }\n\n  split(index: number, force: boolean | undefined = false): Blot | null {\n    if (force && (index === 0 || index >= this.length() - NEWLINE_LENGTH)) {\n      const clone = this.clone();\n      if (index === 0) {\n        this.parent.insertBefore(clone, this);\n        return this;\n      }\n      // @ts-expect-error Fix me later\n      this.parent.insertBefore(clone, this.next);\n      return clone;\n    }\n    const next = super.split(index, force);\n    this.cache = {};\n    return next;\n  }\n}\nBlock.blotName = 'block';\nBlock.tagName = 'P';\nBlock.defaultChild = Break;\nBlock.allowedChildren = [Break, Inline, EmbedBlot, TextBlot];\n\nclass BlockEmbed extends EmbedBlot {\n  attributes: AttributorStore;\n  domNode: HTMLElement;\n\n  attach() {\n    super.attach();\n    this.attributes = new AttributorStore(this.domNode);\n  }\n\n  delta() {\n    return new Delta().insert(this.value(), {\n      ...this.formats(),\n      ...this.attributes.values(),\n    });\n  }\n\n  format(name: string, value: unknown) {\n    const attribute = this.scroll.query(name, Scope.BLOCK_ATTRIBUTE);\n    if (attribute != null) {\n      // @ts-expect-error TODO: Scroll#query() should return Attributor when scope is attribute\n      this.attributes.attribute(attribute, value);\n    }\n  }\n\n  formatAt(index: number, length: number, name: string, value: unknown) {\n    this.format(name, value);\n  }\n\n  insertAt(index: number, value: string, def?: unknown) {\n    if (def != null) {\n      super.insertAt(index, value, def);\n      return;\n    }\n    const lines = value.split('\\n');\n    const text = lines.pop();\n    const blocks = lines.map((line) => {\n      const block = this.scroll.create(Block.blotName);\n      block.insertAt(0, line);\n      return block;\n    });\n    const ref = this.split(index);\n    blocks.forEach((block) => {\n      // @ts-expect-error Fix me later\n      this.parent.insertBefore(block, ref);\n    });\n    if (text) {\n      // @ts-expect-error Fix me later\n      this.parent.insertBefore(this.scroll.create('text', text), ref);\n    }\n  }\n}\nBlockEmbed.scope = Scope.BLOCK_BLOT;\n// It is important for cursor behavior BlockEmbeds use tags that are block level elements\n\nfunction blockDelta(blot: BlockBlot, filter = true) {\n  return blot\n    .descendants(LeafBlot)\n    .reduce((delta, leaf) => {\n      if (leaf.length() === 0) {\n        return delta;\n      }\n      return delta.insert(leaf.value(), bubbleFormats(leaf, {}, filter));\n    }, new Delta())\n    .insert('\\n', bubbleFormats(blot));\n}\n\nfunction bubbleFormats(\n  blot: Blot | null,\n  formats: Record<string, unknown> = {},\n  filter = true,\n): Record<string, unknown> {\n  if (blot == null) return formats;\n  if ('formats' in blot && typeof blot.formats === 'function') {\n    formats = {\n      ...formats,\n      ...blot.formats(),\n    };\n    if (filter) {\n      // exclude syntax highlighting from deltas and getFormat()\n      delete formats['code-token'];\n    }\n  }\n  if (\n    blot.parent == null ||\n    blot.parent.statics.blotName === 'scroll' ||\n    blot.parent.statics.scope !== blot.statics.scope\n  ) {\n    return formats;\n  }\n  return bubbleFormats(blot.parent, formats, filter);\n}\n\nexport { blockDelta, bubbleFormats, BlockEmbed, Block as default };\n","import { EmbedBlot } from 'parchment';\n\nclass Break extends EmbedBlot {\n  static value() {\n    return undefined;\n  }\n\n  optimize() {\n    if (this.prev || this.next) {\n      this.remove();\n    }\n  }\n\n  length() {\n    return 0;\n  }\n\n  value() {\n    return '';\n  }\n}\nBreak.blotName = 'break';\nBreak.tagName = 'BR';\n\nexport default Break;\n","import { ContainerBlot } from 'parchment';\n\nclass Container extends ContainerBlot {}\n\nexport default Container;\n","import { EmbedBlot, Scope } from 'parchment';\nimport type { Parent, ScrollBlot } from 'parchment';\nimport type Selection from '../core/selection.js';\nimport TextBlot from './text.js';\nimport type { EmbedContextRange } from './embed.js';\n\nclass Cursor extends EmbedBlot {\n  static blotName = 'cursor';\n  static className = 'ql-cursor';\n  static tagName = 'span';\n  static CONTENTS = '\\uFEFF'; // Zero width no break space\n\n  static value() {\n    return undefined;\n  }\n\n  selection: Selection;\n  textNode: Text;\n  savedLength: number;\n\n  constructor(scroll: ScrollBlot, domNode: HTMLElement, selection: Selection) {\n    super(scroll, domNode);\n    this.selection = selection;\n    this.textNode = document.createTextNode(Cursor.CONTENTS);\n    this.domNode.appendChild(this.textNode);\n    this.savedLength = 0;\n  }\n\n  detach() {\n    // super.detach() will also clear domNode.__blot\n    if (this.parent != null) this.parent.removeChild(this);\n  }\n\n  format(name: string, value: unknown) {\n    if (this.savedLength !== 0) {\n      super.format(name, value);\n      return;\n    }\n    // TODO: Fix this next time the file is edited.\n    // eslint-disable-next-line @typescript-eslint/no-this-alias\n    let target: Parent | this = this;\n    let index = 0;\n    while (target != null && target.statics.scope !== Scope.BLOCK_BLOT) {\n      index += target.offset(target.parent);\n      target = target.parent;\n    }\n    if (target != null) {\n      this.savedLength = Cursor.CONTENTS.length;\n      // @ts-expect-error TODO: allow empty context in Parchment\n      target.optimize();\n      target.formatAt(index, Cursor.CONTENTS.length, name, value);\n      this.savedLength = 0;\n    }\n  }\n\n  index(node: Node, offset: number) {\n    if (node === this.textNode) return 0;\n    return super.index(node, offset);\n  }\n\n  length() {\n    return this.savedLength;\n  }\n\n  position(): [Text, number] {\n    return [this.textNode, this.textNode.data.length];\n  }\n\n  remove() {\n    super.remove();\n    // @ts-expect-error Fix me later\n    this.parent = null;\n  }\n\n  restore(): EmbedContextRange | null {\n    if (this.selection.composing || this.parent == null) return null;\n    const range = this.selection.getNativeRange();\n    // Browser may push down styles/nodes inside the cursor blot.\n    // https://dvcs.w3.org/hg/editing/raw-file/tip/editing.html#push-down-values\n    while (\n      this.domNode.lastChild != null &&\n      this.domNode.lastChild !== this.textNode\n    ) {\n      // @ts-expect-error Fix me later\n      this.domNode.parentNode.insertBefore(\n        this.domNode.lastChild,\n        this.domNode,\n      );\n    }\n\n    const prevTextBlot = this.prev instanceof TextBlot ? this.prev : null;\n    const prevTextLength = prevTextBlot ? prevTextBlot.length() : 0;\n    const nextTextBlot = this.next instanceof TextBlot ? this.next : null;\n    // @ts-expect-error TODO: make TextBlot.text public\n    const nextText = nextTextBlot ? nextTextBlot.text : '';\n    const { textNode } = this;\n    // take text from inside this blot and reset it\n    const newText = textNode.data.split(Cursor.CONTENTS).join('');\n    textNode.data = Cursor.CONTENTS;\n\n    // proactively merge TextBlots around cursor so that optimization\n    // doesn't lose the cursor.  the reason we are here in cursor.restore\n    // could be that the user clicked in prevTextBlot or nextTextBlot, or\n    // the user typed something.\n    let mergedTextBlot;\n    if (prevTextBlot) {\n      mergedTextBlot = prevTextBlot;\n      if (newText || nextTextBlot) {\n        prevTextBlot.insertAt(prevTextBlot.length(), newText + nextText);\n        if (nextTextBlot) {\n          nextTextBlot.remove();\n        }\n      }\n    } else if (nextTextBlot) {\n      mergedTextBlot = nextTextBlot;\n      nextTextBlot.insertAt(0, newText);\n    } else {\n      const newTextNode = document.createTextNode(newText);\n      mergedTextBlot = this.scroll.create(newTextNode);\n      this.parent.insertBefore(mergedTextBlot, this);\n    }\n\n    this.remove();\n    if (range) {\n      // calculate selection to restore\n      const remapOffset = (node: Node, offset: number) => {\n        if (prevTextBlot && node === prevTextBlot.domNode) {\n          return offset;\n        }\n        if (node === textNode) {\n          return prevTextLength + offset - 1;\n        }\n        if (nextTextBlot && node === nextTextBlot.domNode) {\n          return prevTextLength + newText.length + offset;\n        }\n        return null;\n      };\n\n      const start = remapOffset(range.start.node, range.start.offset);\n      const end = remapOffset(range.end.node, range.end.offset);\n      if (start !== null && end !== null) {\n        return {\n          startNode: mergedTextBlot.domNode,\n          startOffset: start,\n          endNode: mergedTextBlot.domNode,\n          endOffset: end,\n        };\n      }\n    }\n    return null;\n  }\n\n  update(mutations: MutationRecord[], context: Record<string, unknown>) {\n    if (\n      mutations.some((mutation) => {\n        return (\n          mutation.type === 'characterData' && mutation.target === this.textNode\n        );\n      })\n    ) {\n      const range = this.restore();\n      if (range) context.range = range;\n    }\n  }\n\n  // Avoid .ql-cursor being a descendant of `<a/>`.\n  // The reason is Safari pushes down `<a/>` on text insertion.\n  // That will cause DOM nodes not sync with the model.\n  //\n  // For example ({I} is the caret), given the markup:\n  //    <a><span class=\"ql-cursor\">\\uFEFF{I}</span></a>\n  // When typing a char \"x\", `<a/>` will be pushed down inside the `<span>` first:\n  //    <span class=\"ql-cursor\"><a>\\uFEFF{I}</a></span>\n  // And then \"x\" will be inserted after `<a/>`:\n  //    <span class=\"ql-cursor\"><a>\\uFEFF</a>d{I}</span>\n  optimize(context?: unknown) {\n    // @ts-expect-error Fix me later\n    super.optimize(context);\n\n    let { parent } = this;\n    while (parent) {\n      if (parent.domNode.tagName === 'A') {\n        this.savedLength = Cursor.CONTENTS.length;\n        // @ts-expect-error TODO: make isolate generic\n        parent.isolate(this.offset(parent), this.length()).unwrap();\n        this.savedLength = 0;\n        break;\n      }\n      parent = parent.parent;\n    }\n  }\n\n  value() {\n    return '';\n  }\n}\n\nexport default Cursor;\n","import type { ScrollBlot } from 'parchment';\nimport { EmbedBlot } from 'parchment';\nimport TextBlot from './text.js';\n\nconst GUARD_TEXT = '\\uFEFF';\n\nexport interface EmbedContextRange {\n  startNode: Node | Text;\n  startOffset: number;\n  endNode?: Node | Text;\n  endOffset?: number;\n}\n\nclass Embed extends EmbedBlot {\n  contentNode: HTMLSpanElement;\n  leftGuard: Text;\n  rightGuard: Text;\n\n  constructor(scroll: ScrollBlot, node: Node) {\n    super(scroll, node);\n    this.contentNode = document.createElement('span');\n    this.contentNode.setAttribute('contenteditable', 'false');\n    Array.from(this.domNode.childNodes).forEach((childNode) => {\n      this.contentNode.appendChild(childNode);\n    });\n    this.leftGuard = document.createTextNode(GUARD_TEXT);\n    this.rightGuard = document.createTextNode(GUARD_TEXT);\n    this.domNode.appendChild(this.leftGuard);\n    this.domNode.appendChild(this.contentNode);\n    this.domNode.appendChild(this.rightGuard);\n  }\n\n  index(node: Node, offset: number) {\n    if (node === this.leftGuard) return 0;\n    if (node === this.rightGuard) return 1;\n    return super.index(node, offset);\n  }\n\n  restore(node: Text): EmbedContextRange | null {\n    let range: EmbedContextRange | null = null;\n    let textNode: Text;\n    const text = node.data.split(GUARD_TEXT).join('');\n    if (node === this.leftGuard) {\n      if (this.prev instanceof TextBlot) {\n        const prevLength = this.prev.length();\n        this.prev.insertAt(prevLength, text);\n        range = {\n          startNode: this.prev.domNode,\n          startOffset: prevLength + text.length,\n        };\n      } else {\n        textNode = document.createTextNode(text);\n        this.parent.insertBefore(this.scroll.create(textNode), this);\n        range = {\n          startNode: textNode,\n          startOffset: text.length,\n        };\n      }\n    } else if (node === this.rightGuard) {\n      if (this.next instanceof TextBlot) {\n        this.next.insertAt(0, text);\n        range = {\n          startNode: this.next.domNode,\n          startOffset: text.length,\n        };\n      } else {\n        textNode = document.createTextNode(text);\n        // @ts-expect-error Fix me later\n        this.parent.insertBefore(this.scroll.create(textNode), this.next);\n        range = {\n          startNode: textNode,\n          startOffset: text.length,\n        };\n      }\n    }\n    node.data = GUARD_TEXT;\n    return range;\n  }\n\n  update(mutations: MutationRecord[], context: Record<string, unknown>) {\n    mutations.forEach((mutation) => {\n      if (\n        mutation.type === 'characterData' &&\n        (mutation.target === this.leftGuard ||\n          mutation.target === this.rightGuard)\n      ) {\n        const range = this.restore(mutation.target as Text);\n        if (range) context.range = range;\n      }\n    });\n  }\n}\n\nexport default Embed;\n","import { EmbedBlot, InlineBlot, Scope } from 'parchment';\nimport type { BlotConstructor } from 'parchment';\nimport Break from './break.js';\nimport Text from './text.js';\n\nclass Inline extends InlineBlot {\n  static allowedChildren: BlotConstructor[] = [Inline, Break, EmbedBlot, Text];\n  // Lower index means deeper in the DOM tree, since not found (-1) is for embeds\n  static order = [\n    'cursor',\n    'inline', // Must be lower\n    'link', // Chrome wants <a> to be lower\n    'underline',\n    'strike',\n    'italic',\n    'bold',\n    'script',\n    'code', // Must be higher\n  ];\n\n  static compare(self: string, other: string) {\n    const selfIndex = Inline.order.indexOf(self);\n    const otherIndex = Inline.order.indexOf(other);\n    if (selfIndex >= 0 || otherIndex >= 0) {\n      return selfIndex - otherIndex;\n    }\n    if (self === other) {\n      return 0;\n    }\n    if (self < other) {\n      return -1;\n    }\n    return 1;\n  }\n\n  formatAt(index: number, length: number, name: string, value: unknown) {\n    if (\n      Inline.compare(this.statics.blotName, name) < 0 &&\n      this.scroll.query(name, Scope.BLOT)\n    ) {\n      const blot = this.isolate(index, length);\n      if (value) {\n        blot.wrap(name, value);\n      }\n    } else {\n      super.formatAt(index, length, name, value);\n    }\n  }\n\n  optimize(context: { [key: string]: any }) {\n    super.optimize(context);\n    if (\n      this.parent instanceof Inline &&\n      Inline.compare(this.statics.blotName, this.parent.statics.blotName) > 0\n    ) {\n      const parent = this.parent.isolate(this.offset(), this.length());\n      // @ts-expect-error TODO: make isolate generic\n      this.moveChildren(parent);\n      parent.wrap(this);\n    }\n  }\n}\n\nexport default Inline;\n","import { TextBlot } from 'parchment';\n\nclass Text extends TextBlot {}\n\nfunction escapeText(text: string) {\n  return text.replace(/[&<>\"']/g, (s) => {\n    // https://lodash.com/docs#escape\n    const entityMap: Record<string, string> = {\n      '&': '&amp;',\n      '<': '&lt;',\n      '>': '&gt;',\n      '\"': '&quot;',\n      \"'\": '&#39;',\n    };\n    return entityMap[s];\n  });\n}\n\nexport { Text as default, escapeText };\n","import { EventEmitter } from 'eventemitter3';\nimport instances from './instances.js';\nimport logger from './logger.js';\n\nconst debug = logger('quill:events');\nconst EVENTS = ['selectionchange', 'mousedown', 'mouseup', 'click'];\n\nEVENTS.forEach((eventName) => {\n  document.addEventListener(eventName, (...args) => {\n    Array.from(document.querySelectorAll('.ql-container')).forEach((node) => {\n      const quill = instances.get(node);\n      if (quill && quill.emitter) {\n        quill.emitter.handleDOM(...args);\n      }\n    });\n  });\n});\n\nclass Emitter extends EventEmitter<string> {\n  static events = {\n    EDITOR_CHANGE: 'editor-change',\n    SCROLL_BEFORE_UPDATE: 'scroll-before-update',\n    SCROLL_BLOT_MOUNT: 'scroll-blot-mount',\n    SCROLL_BLOT_UNMOUNT: 'scroll-blot-unmount',\n    SCROLL_OPTIMIZE: 'scroll-optimize',\n    SCROLL_UPDATE: 'scroll-update',\n    SCROLL_EMBED_UPDATE: 'scroll-embed-update',\n    SELECTION_CHANGE: 'selection-change',\n    TEXT_CHANGE: 'text-change',\n    COMPOSITION_BEFORE_START: 'composition-before-start',\n    COMPOSITION_START: 'composition-start',\n    COMPOSITION_BEFORE_END: 'composition-before-end',\n    COMPOSITION_END: 'composition-end',\n  } as const;\n\n  static sources = {\n    API: 'api',\n    SILENT: 'silent',\n    USER: 'user',\n  } as const;\n\n  protected domListeners: Record<string, { node: Node; handler: Function }[]>;\n\n  constructor() {\n    super();\n    this.domListeners = {};\n    this.on('error', debug.error);\n  }\n\n  emit(...args: unknown[]): boolean {\n    debug.log.call(debug, ...args);\n    // @ts-expect-error\n    return super.emit(...args);\n  }\n\n  handleDOM(event: Event, ...args: unknown[]) {\n    (this.domListeners[event.type] || []).forEach(({ node, handler }) => {\n      if (event.target === node || node.contains(event.target as Node)) {\n        handler(event, ...args);\n      }\n    });\n  }\n\n  listenDOM(eventName: string, node: Node, handler: EventListener) {\n    if (!this.domListeners[eventName]) {\n      this.domListeners[eventName] = [];\n    }\n    this.domListeners[eventName].push({ node, handler });\n  }\n}\n\nexport type EmitterSource =\n  (typeof Emitter.sources)[keyof typeof Emitter.sources];\n\nexport default Emitter;\n","import type Quill from '../core.js';\n\nexport default new WeakMap<Node, Quill>();\n","const levels = ['error', 'warn', 'log', 'info'] as const;\nexport type DebugLevel = (typeof levels)[number];\nlet level: DebugLevel | false = 'warn';\n\nfunction debug(method: DebugLevel, ...args: unknown[]) {\n  if (level) {\n    if (levels.indexOf(method) <= levels.indexOf(level)) {\n      console[method](...args); // eslint-disable-line no-console\n    }\n  }\n}\n\nfunction namespace(\n  ns: string,\n): Record<DebugLevel, (...args: unknown[]) => void> {\n  return levels.reduce(\n    (logger, method) => {\n      logger[method] = debug.bind(console, method, ns);\n      return logger;\n    },\n    {} as Record<DebugLevel, (...args: unknown[]) => void>,\n  );\n}\n\nnamespace.level = (newLevel: DebugLevel | false) => {\n  level = newLevel;\n};\ndebug.level = namespace.level;\n\nexport default namespace;\n","import type Quill from './quill.js';\n\nabstract class Module<T extends {} = {}> {\n  static DEFAULTS = {};\n\n  constructor(\n    protected quill: Quill,\n    protected options: Partial<T> = {},\n  ) {}\n}\n\nexport default Module;\n","import { cloneDeep, isEqual, merge } from 'lodash-es';\nimport { LeafBlot, EmbedBlot, Scope, ParentBlot } from 'parchment';\nimport type { Blot } from 'parchment';\nimport Delta, { AttributeMap, Op } from 'quill-delta';\nimport Block, { BlockEmbed, bubbleFormats } from '../blots/block.js';\nimport Break from '../blots/break.js';\nimport CursorBlot from '../blots/cursor.js';\nimport type Scroll from '../blots/scroll.js';\nimport TextBlot, { escapeText } from '../blots/text.js';\nimport { Range } from './selection.js';\n\nconst ASCII = /^[ -~]*$/;\n\ntype SelectionInfo = {\n  newRange: Range;\n  oldRange: Range;\n};\n\nclass Editor {\n  scroll: Scroll;\n  delta: Delta;\n\n  constructor(scroll: Scroll) {\n    this.scroll = scroll;\n    this.delta = this.getDelta();\n  }\n\n  applyDelta(delta: Delta): Delta {\n    this.scroll.update();\n    let scrollLength = this.scroll.length();\n    this.scroll.batchStart();\n    const normalizedDelta = normalizeDelta(delta);\n    const deleteDelta = new Delta();\n    const normalizedOps = splitOpLines(normalizedDelta.ops.slice());\n    normalizedOps.reduce((index, op) => {\n      const length = Op.length(op);\n      let attributes = op.attributes || {};\n      let isImplicitNewlinePrepended = false;\n      let isImplicitNewlineAppended = false;\n      if (op.insert != null) {\n        deleteDelta.retain(length);\n        if (typeof op.insert === 'string') {\n          const text = op.insert;\n          isImplicitNewlineAppended =\n            !text.endsWith('\\n') &&\n            (scrollLength <= index ||\n              !!this.scroll.descendant(BlockEmbed, index)[0]);\n          this.scroll.insertAt(index, text);\n          const [line, offset] = this.scroll.line(index);\n          let formats = merge({}, bubbleFormats(line));\n          if (line instanceof Block) {\n            const [leaf] = line.descendant(LeafBlot, offset);\n            if (leaf) {\n              formats = merge(formats, bubbleFormats(leaf));\n            }\n          }\n          attributes = AttributeMap.diff(formats, attributes) || {};\n        } else if (typeof op.insert === 'object') {\n          const key = Object.keys(op.insert)[0]; // There should only be one key\n          if (key == null) return index;\n          const isInlineEmbed = this.scroll.query(key, Scope.INLINE) != null;\n          if (isInlineEmbed) {\n            if (\n              scrollLength <= index ||\n              !!this.scroll.descendant(BlockEmbed, index)[0]\n            ) {\n              isImplicitNewlineAppended = true;\n            }\n          } else if (index > 0) {\n            const [leaf, offset] = this.scroll.descendant(LeafBlot, index - 1);\n            if (leaf instanceof TextBlot) {\n              const text = leaf.value();\n              if (text[offset] !== '\\n') {\n                isImplicitNewlinePrepended = true;\n              }\n            } else if (\n              leaf instanceof EmbedBlot &&\n              leaf.statics.scope === Scope.INLINE_BLOT\n            ) {\n              isImplicitNewlinePrepended = true;\n            }\n          }\n          this.scroll.insertAt(index, key, op.insert[key]);\n\n          if (isInlineEmbed) {\n            const [leaf] = this.scroll.descendant(LeafBlot, index);\n            if (leaf) {\n              const formats = merge({}, bubbleFormats(leaf));\n              attributes = AttributeMap.diff(formats, attributes) || {};\n            }\n          }\n        }\n        scrollLength += length;\n      } else {\n        deleteDelta.push(op);\n\n        if (op.retain !== null && typeof op.retain === 'object') {\n          const key = Object.keys(op.retain)[0];\n          if (key == null) return index;\n          this.scroll.updateEmbedAt(index, key, op.retain[key]);\n        }\n      }\n      Object.keys(attributes).forEach((name) => {\n        this.scroll.formatAt(index, length, name, attributes[name]);\n      });\n      const prependedLength = isImplicitNewlinePrepended ? 1 : 0;\n      const addedLength = isImplicitNewlineAppended ? 1 : 0;\n      scrollLength += prependedLength + addedLength;\n      deleteDelta.retain(prependedLength);\n      deleteDelta.delete(addedLength);\n      return index + length + prependedLength + addedLength;\n    }, 0);\n    deleteDelta.reduce((index, op) => {\n      if (typeof op.delete === 'number') {\n        this.scroll.deleteAt(index, op.delete);\n        return index;\n      }\n      return index + Op.length(op);\n    }, 0);\n    this.scroll.batchEnd();\n    this.scroll.optimize();\n    return this.update(normalizedDelta);\n  }\n\n  deleteText(index: number, length: number): Delta {\n    this.scroll.deleteAt(index, length);\n    return this.update(new Delta().retain(index).delete(length));\n  }\n\n  formatLine(\n    index: number,\n    length: number,\n    formats: Record<string, unknown> = {},\n  ): Delta {\n    this.scroll.update();\n    Object.keys(formats).forEach((format) => {\n      this.scroll.lines(index, Math.max(length, 1)).forEach((line) => {\n        line.format(format, formats[format]);\n      });\n    });\n    this.scroll.optimize();\n    const delta = new Delta().retain(index).retain(length, cloneDeep(formats));\n    return this.update(delta);\n  }\n\n  formatText(\n    index: number,\n    length: number,\n    formats: Record<string, unknown> = {},\n  ): Delta {\n    Object.keys(formats).forEach((format) => {\n      this.scroll.formatAt(index, length, format, formats[format]);\n    });\n    const delta = new Delta().retain(index).retain(length, cloneDeep(formats));\n    return this.update(delta);\n  }\n\n  getContents(index: number, length: number): Delta {\n    return this.delta.slice(index, index + length);\n  }\n\n  getDelta(): Delta {\n    return this.scroll.lines().reduce((delta, line) => {\n      return delta.concat(line.delta());\n    }, new Delta());\n  }\n\n  getFormat(index: number, length = 0): Record<string, unknown> {\n    let lines: (Block | BlockEmbed)[] = [];\n    let leaves: LeafBlot[] = [];\n    if (length === 0) {\n      this.scroll.path(index).forEach((path) => {\n        const [blot] = path;\n        if (blot instanceof Block) {\n          lines.push(blot);\n        } else if (blot instanceof LeafBlot) {\n          leaves.push(blot);\n        }\n      });\n    } else {\n      lines = this.scroll.lines(index, length);\n      leaves = this.scroll.descendants(LeafBlot, index, length);\n    }\n    const [lineFormats, leafFormats] = [lines, leaves].map((blots) => {\n      const blot = blots.shift();\n      if (blot == null) return {};\n      let formats = bubbleFormats(blot);\n      while (Object.keys(formats).length > 0) {\n        const blot = blots.shift();\n        if (blot == null) return formats;\n        formats = combineFormats(bubbleFormats(blot), formats);\n      }\n      return formats;\n    });\n    return { ...lineFormats, ...leafFormats };\n  }\n\n  getHTML(index: number, length: number): string {\n    const [line, lineOffset] = this.scroll.line(index);\n    if (line) {\n      const lineLength = line.length();\n      const isWithinLine = line.length() >= lineOffset + length;\n      if (isWithinLine && !(lineOffset === 0 && length === lineLength)) {\n        return convertHTML(line, lineOffset, length, true);\n      }\n      return convertHTML(this.scroll, index, length, true);\n    }\n    return '';\n  }\n\n  getText(index: number, length: number): string {\n    return this.getContents(index, length)\n      .filter((op) => typeof op.insert === 'string')\n      .map((op) => op.insert)\n      .join('');\n  }\n\n  insertContents(index: number, contents: Delta): Delta {\n    const normalizedDelta = normalizeDelta(contents);\n    const change = new Delta().retain(index).concat(normalizedDelta);\n    this.scroll.insertContents(index, normalizedDelta);\n    return this.update(change);\n  }\n\n  insertEmbed(index: number, embed: string, value: unknown): Delta {\n    this.scroll.insertAt(index, embed, value);\n    return this.update(new Delta().retain(index).insert({ [embed]: value }));\n  }\n\n  insertText(\n    index: number,\n    text: string,\n    formats: Record<string, unknown> = {},\n  ): Delta {\n    text = text.replace(/\\r\\n/g, '\\n').replace(/\\r/g, '\\n');\n    this.scroll.insertAt(index, text);\n    Object.keys(formats).forEach((format) => {\n      this.scroll.formatAt(index, text.length, format, formats[format]);\n    });\n    return this.update(\n      new Delta().retain(index).insert(text, cloneDeep(formats)),\n    );\n  }\n\n  isBlank(): boolean {\n    if (this.scroll.children.length === 0) return true;\n    if (this.scroll.children.length > 1) return false;\n    const blot = this.scroll.children.head;\n    if (blot?.statics.blotName !== Block.blotName) return false;\n    const block = blot as Block;\n    if (block.children.length > 1) return false;\n    return block.children.head instanceof Break;\n  }\n\n  removeFormat(index: number, length: number): Delta {\n    const text = this.getText(index, length);\n    const [line, offset] = this.scroll.line(index + length);\n    let suffixLength = 0;\n    let suffix = new Delta();\n    if (line != null) {\n      suffixLength = line.length() - offset;\n      suffix = line\n        .delta()\n        .slice(offset, offset + suffixLength - 1)\n        .insert('\\n');\n    }\n    const contents = this.getContents(index, length + suffixLength);\n    const diff = contents.diff(new Delta().insert(text).concat(suffix));\n    const delta = new Delta().retain(index).concat(diff);\n    return this.applyDelta(delta);\n  }\n\n  update(\n    change: Delta | null,\n    mutations: MutationRecord[] = [],\n    selectionInfo: SelectionInfo | undefined = undefined,\n  ): Delta {\n    const oldDelta = this.delta;\n    if (\n      mutations.length === 1 &&\n      mutations[0].type === 'characterData' &&\n      // @ts-expect-error Fix me later\n      mutations[0].target.data.match(ASCII) &&\n      this.scroll.find(mutations[0].target)\n    ) {\n      // Optimization for character changes\n      const textBlot = this.scroll.find(mutations[0].target) as Blot;\n      const formats = bubbleFormats(textBlot);\n      const index = textBlot.offset(this.scroll);\n      // @ts-expect-error Fix me later\n      const oldValue = mutations[0].oldValue.replace(CursorBlot.CONTENTS, '');\n      const oldText = new Delta().insert(oldValue);\n      // @ts-expect-error\n      const newText = new Delta().insert(textBlot.value());\n      const relativeSelectionInfo = selectionInfo && {\n        oldRange: shiftRange(selectionInfo.oldRange, -index),\n        newRange: shiftRange(selectionInfo.newRange, -index),\n      };\n      const diffDelta = new Delta()\n        .retain(index)\n        .concat(oldText.diff(newText, relativeSelectionInfo));\n      change = diffDelta.reduce((delta, op) => {\n        if (op.insert) {\n          return delta.insert(op.insert, formats);\n        }\n        return delta.push(op);\n      }, new Delta());\n      this.delta = oldDelta.compose(change);\n    } else {\n      this.delta = this.getDelta();\n      if (!change || !isEqual(oldDelta.compose(change), this.delta)) {\n        change = oldDelta.diff(this.delta, selectionInfo);\n      }\n    }\n    return change;\n  }\n}\n\ninterface ListItem {\n  child: Blot;\n  offset: number;\n  length: number;\n  indent: number;\n  type: string;\n}\nfunction convertListHTML(\n  items: ListItem[],\n  lastIndent: number,\n  types: string[],\n): string {\n  if (items.length === 0) {\n    const [endTag] = getListType(types.pop());\n    if (lastIndent <= 0) {\n      return `</li></${endTag}>`;\n    }\n    return `</li></${endTag}>${convertListHTML([], lastIndent - 1, types)}`;\n  }\n  const [{ child, offset, length, indent, type }, ...rest] = items;\n  const [tag, attribute] = getListType(type);\n  if (indent > lastIndent) {\n    types.push(type);\n    if (indent === lastIndent + 1) {\n      return `<${tag}><li${attribute}>${convertHTML(\n        child,\n        offset,\n        length,\n      )}${convertListHTML(rest, indent, types)}`;\n    }\n    return `<${tag}><li>${convertListHTML(items, lastIndent + 1, types)}`;\n  }\n  const previousType = types[types.length - 1];\n  if (indent === lastIndent && type === previousType) {\n    return `</li><li${attribute}>${convertHTML(\n      child,\n      offset,\n      length,\n    )}${convertListHTML(rest, indent, types)}`;\n  }\n  const [endTag] = getListType(types.pop());\n  return `</li></${endTag}>${convertListHTML(items, lastIndent - 1, types)}`;\n}\n\nfunction convertHTML(\n  blot: Blot,\n  index: number,\n  length: number,\n  isRoot = false,\n): string {\n  if ('html' in blot && typeof blot.html === 'function') {\n    return blot.html(index, length);\n  }\n  if (blot instanceof TextBlot) {\n    return escapeText(blot.value().slice(index, index + length));\n  }\n  if (blot instanceof ParentBlot) {\n    // TODO fix API\n    if (blot.statics.blotName === 'list-container') {\n      const items: any[] = [];\n      blot.children.forEachAt(index, length, (child, offset, childLength) => {\n        const formats =\n          'formats' in child && typeof child.formats === 'function'\n            ? child.formats()\n            : {};\n        items.push({\n          child,\n          offset,\n          length: childLength,\n          indent: formats.indent || 0,\n          type: formats.list,\n        });\n      });\n      return convertListHTML(items, -1, []);\n    }\n    const parts: string[] = [];\n    blot.children.forEachAt(index, length, (child, offset, childLength) => {\n      parts.push(convertHTML(child, offset, childLength));\n    });\n    if (isRoot || blot.statics.blotName === 'list') {\n      return parts.join('');\n    }\n    const { outerHTML, innerHTML } = blot.domNode as Element;\n    const [start, end] = outerHTML.split(`>${innerHTML}<`);\n    // TODO cleanup\n    if (start === '<table') {\n      return `<table style=\"border: 1px solid #000;\">${parts.join('')}<${end}`;\n    }\n    return `${start}>${parts.join('')}<${end}`;\n  }\n  return blot.domNode instanceof Element ? blot.domNode.outerHTML : '';\n}\n\nfunction combineFormats(\n  formats: Record<string, unknown>,\n  combined: Record<string, unknown>,\n): Record<string, unknown> {\n  return Object.keys(combined).reduce(\n    (merged, name) => {\n      if (formats[name] == null) return merged;\n      const combinedValue = combined[name];\n      if (combinedValue === formats[name]) {\n        merged[name] = combinedValue;\n      } else if (Array.isArray(combinedValue)) {\n        if (combinedValue.indexOf(formats[name]) < 0) {\n          merged[name] = combinedValue.concat([formats[name]]);\n        } else {\n          // If style already exists, don't add to an array, but don't lose other styles\n          merged[name] = combinedValue;\n        }\n      } else {\n        merged[name] = [combinedValue, formats[name]];\n      }\n      return merged;\n    },\n    {} as Record<string, unknown>,\n  );\n}\n\nfunction getListType(type: string | undefined) {\n  const tag = type === 'ordered' ? 'ol' : 'ul';\n  switch (type) {\n    case 'checked':\n      return [tag, ' data-list=\"checked\"'];\n    case 'unchecked':\n      return [tag, ' data-list=\"unchecked\"'];\n    default:\n      return [tag, ''];\n  }\n}\n\nfunction normalizeDelta(delta: Delta) {\n  return delta.reduce((normalizedDelta, op) => {\n    if (typeof op.insert === 'string') {\n      const text = op.insert.replace(/\\r\\n/g, '\\n').replace(/\\r/g, '\\n');\n      return normalizedDelta.insert(text, op.attributes);\n    }\n    return normalizedDelta.push(op);\n  }, new Delta());\n}\n\nfunction shiftRange({ index, length }: Range, amount: number) {\n  return new Range(index + amount, length);\n}\n\nfunction splitOpLines(ops: Op[]) {\n  const split: Op[] = [];\n  ops.forEach((op) => {\n    if (typeof op.insert === 'string') {\n      const lines = op.insert.split('\\n');\n      lines.forEach((line, index) => {\n        if (index) split.push({ insert: '\\n', attributes: op.attributes });\n        if (line) split.push({ insert: line, attributes: op.attributes });\n      });\n    } else {\n      split.push(op);\n    }\n  });\n\n  return split;\n}\n\nexport default Editor;\n","import Embed from '../blots/embed.js';\nimport type Scroll from '../blots/scroll.js';\nimport Emitter from './emitter.js';\n\nclass Composition {\n  isComposing = false;\n\n  constructor(\n    private scroll: Scroll,\n    private emitter: Emitter,\n  ) {\n    this.setupListeners();\n  }\n\n  private setupListeners() {\n    this.scroll.domNode.addEventListener('compositionstart', (event) => {\n      if (!this.isComposing) {\n        this.handleCompositionStart(event);\n      }\n    });\n\n    this.scroll.domNode.addEventListener('compositionend', (event) => {\n      if (this.isComposing) {\n        // Webkit makes DOM changes after compositionend, so we use microtask to\n        // ensure the order.\n        // https://bugs.webkit.org/show_bug.cgi?id=31902\n        queueMicrotask(() => {\n          this.handleCompositionEnd(event);\n        });\n      }\n    });\n  }\n\n  private handleCompositionStart(event: CompositionEvent) {\n    const blot =\n      event.target instanceof Node\n        ? this.scroll.find(event.target, true)\n        : null;\n\n    if (blot && !(blot instanceof Embed)) {\n      this.emitter.emit(Emitter.events.COMPOSITION_BEFORE_START, event);\n      this.scroll.batchStart();\n      this.emitter.emit(Emitter.events.COMPOSITION_START, event);\n      this.isComposing = true;\n    }\n  }\n\n  private handleCompositionEnd(event: CompositionEvent) {\n    this.emitter.emit(Emitter.events.COMPOSITION_BEFORE_END, event);\n    this.scroll.batchEnd();\n    this.emitter.emit(Emitter.events.COMPOSITION_END, event);\n    this.isComposing = false;\n  }\n}\n\nexport default Composition;\n","export type Rect = {\n  top: number;\n  right: number;\n  bottom: number;\n  left: number;\n};\n\nconst getParentElement = (element: Node): Element | null =>\n  element.parentElement || (element.getRootNode() as ShadowRoot).host || null;\n\nconst getElementRect = (element: Element): Rect => {\n  const rect = element.getBoundingClientRect();\n  const scaleX =\n    ('offsetWidth' in element &&\n      Math.abs(rect.width) / (element as HTMLElement).offsetWidth) ||\n    1;\n  const scaleY =\n    ('offsetHeight' in element &&\n      Math.abs(rect.height) / (element as HTMLElement).offsetHeight) ||\n    1;\n  return {\n    top: rect.top,\n    right: rect.left + element.clientWidth * scaleX,\n    bottom: rect.top + element.clientHeight * scaleY,\n    left: rect.left,\n  };\n};\n\nconst paddingValueToInt = (value: string) => {\n  const number = parseInt(value, 10);\n  return Number.isNaN(number) ? 0 : number;\n};\n\n// Follow the steps described in https://www.w3.org/TR/cssom-view-1/#element-scrolling-members,\n// assuming that the scroll option is set to 'nearest'.\nconst getScrollDistance = (\n  targetStart: number,\n  targetEnd: number,\n  scrollStart: number,\n  scrollEnd: number,\n  scrollPaddingStart: number,\n  scrollPaddingEnd: number,\n) => {\n  if (targetStart < scrollStart && targetEnd > scrollEnd) {\n    return 0;\n  }\n\n  if (targetStart < scrollStart) {\n    return -(scrollStart - targetStart + scrollPaddingStart);\n  }\n\n  if (targetEnd > scrollEnd) {\n    return targetEnd - targetStart > scrollEnd - scrollStart\n      ? targetStart + scrollPaddingStart - scrollStart\n      : targetEnd - scrollEnd + scrollPaddingEnd;\n  }\n  return 0;\n};\n\nconst scrollRectIntoView = (root: HTMLElement, targetRect: Rect) => {\n  const document = root.ownerDocument;\n\n  let rect = targetRect;\n\n  let current: Element | null = root;\n  while (current) {\n    const isDocumentBody: boolean = current === document.body;\n    const bounding = isDocumentBody\n      ? {\n          top: 0,\n          right:\n            window.visualViewport?.width ??\n            document.documentElement.clientWidth,\n          bottom:\n            window.visualViewport?.height ??\n            document.documentElement.clientHeight,\n          left: 0,\n        }\n      : getElementRect(current);\n\n    const style = getComputedStyle(current);\n    const scrollDistanceX = getScrollDistance(\n      rect.left,\n      rect.right,\n      bounding.left,\n      bounding.right,\n      paddingValueToInt(style.scrollPaddingLeft),\n      paddingValueToInt(style.scrollPaddingRight),\n    );\n    const scrollDistanceY = getScrollDistance(\n      rect.top,\n      rect.bottom,\n      bounding.top,\n      bounding.bottom,\n      paddingValueToInt(style.scrollPaddingTop),\n      paddingValueToInt(style.scrollPaddingBottom),\n    );\n    if (scrollDistanceX || scrollDistanceY) {\n      if (isDocumentBody) {\n        document.defaultView?.scrollBy(scrollDistanceX, scrollDistanceY);\n      } else {\n        const { scrollLeft, scrollTop } = current;\n        if (scrollDistanceY) {\n          current.scrollTop += scrollDistanceY;\n        }\n        if (scrollDistanceX) {\n          current.scrollLeft += scrollDistanceX;\n        }\n        const scrolledLeft = current.scrollLeft - scrollLeft;\n        const scrolledTop = current.scrollTop - scrollTop;\n        rect = {\n          left: rect.left - scrolledLeft,\n          top: rect.top - scrolledTop,\n          right: rect.right - scrolledLeft,\n          bottom: rect.bottom - scrolledTop,\n        };\n      }\n    }\n\n    current =\n      isDocumentBody || style.position === 'fixed'\n        ? null\n        : getParentElement(current);\n  }\n};\n\nexport default scrollRectIntoView;\n","import { Registry } from 'parchment';\n\nconst MAX_REGISTER_ITERATIONS = 100;\nconst CORE_FORMATS = ['block', 'break', 'cursor', 'inline', 'scroll', 'text'];\n\nconst createRegistryWithFormats = (\n  formats: string[],\n  sourceRegistry: Registry,\n  debug: { error: (errorMessage: string) => void },\n) => {\n  const registry = new Registry();\n  CORE_FORMATS.forEach((name) => {\n    const coreBlot = sourceRegistry.query(name);\n    if (coreBlot) registry.register(coreBlot);\n  });\n\n  formats.forEach((name) => {\n    let format = sourceRegistry.query(name);\n    if (!format) {\n      debug.error(\n        `Cannot register \"${name}\" specified in \"formats\" config. Are you sure it was registered?`,\n      );\n    }\n    let iterations = 0;\n    while (format) {\n      registry.register(format);\n      format = 'blotName' in format ? format.requiredContainer ?? null : null;\n\n      iterations += 1;\n      if (iterations > MAX_REGISTER_ITERATIONS) {\n        debug.error(\n          `Cycle detected in registering blot requiredContainer: \"${name}\"`,\n        );\n        break;\n      }\n    }\n  });\n\n  return registry;\n};\n\nexport default createRegistryWithFormats;\n","import { merge } from 'lodash-es';\nimport * as Parchment from 'parchment';\nimport type { Op } from 'quill-delta';\nimport Delta from 'quill-delta';\nimport type { BlockEmbed } from '../blots/block.js';\nimport type Block from '../blots/block.js';\nimport type Scroll from '../blots/scroll.js';\nimport type Clipboard from '../modules/clipboard.js';\nimport type History from '../modules/history.js';\nimport type Keyboard from '../modules/keyboard.js';\nimport type Uploader from '../modules/uploader.js';\nimport Editor from './editor.js';\nimport Emitter from './emitter.js';\nimport type { EmitterSource } from './emitter.js';\nimport instances from './instances.js';\nimport logger from './logger.js';\nimport type { DebugLevel } from './logger.js';\nimport Module from './module.js';\nimport Selection, { Range } from './selection.js';\nimport type { Bounds } from './selection.js';\nimport Composition from './composition.js';\nimport Theme from './theme.js';\nimport type { ThemeConstructor } from './theme.js';\nimport scrollRectIntoView from './utils/scrollRectIntoView.js';\nimport type { Rect } from './utils/scrollRectIntoView.js';\nimport createRegistryWithFormats from './utils/createRegistryWithFormats.js';\n\nconst debug = logger('quill');\n\nconst globalRegistry = new Parchment.Registry();\nParchment.ParentBlot.uiClass = 'ql-ui';\n\ninterface Options {\n  theme?: string;\n  debug?: DebugLevel | boolean;\n  registry?: Parchment.Registry;\n  readOnly?: boolean;\n  placeholder?: string;\n  bounds?: HTMLElement | string | null;\n  modules?: Record<string, unknown>;\n  formats?: string[] | null;\n}\n\ninterface ExpandedOptions extends Omit<Options, 'theme' | 'formats'> {\n  theme: ThemeConstructor;\n  registry: Parchment.Registry;\n  container: HTMLElement;\n  modules: Record<string, unknown>;\n  bounds?: HTMLElement | null;\n  readOnly: boolean;\n}\n\nclass Quill {\n  static DEFAULTS = {\n    bounds: null,\n    modules: {\n      clipboard: true,\n      keyboard: true,\n      history: true,\n      uploader: true,\n    },\n    placeholder: '',\n    readOnly: false,\n    registry: globalRegistry,\n    theme: 'default',\n  } as const satisfies Partial<Options>;\n  static events = Emitter.events;\n  static sources = Emitter.sources;\n  static version = typeof QUILL_VERSION === 'undefined' ? 'dev' : QUILL_VERSION;\n\n  static imports: Record<string, unknown> = {\n    delta: Delta,\n    parchment: Parchment,\n    'core/module': Module,\n    'core/theme': Theme,\n  };\n\n  static debug(limit: DebugLevel | boolean) {\n    if (limit === true) {\n      limit = 'log';\n    }\n    logger.level(limit);\n  }\n\n  static find(node: Node, bubble = false) {\n    return instances.get(node) || globalRegistry.find(node, bubble);\n  }\n\n  static import(name: 'core/module'): typeof Module;\n  static import(name: `themes/${string}`): typeof Theme;\n  static import(name: 'parchment'): typeof Parchment;\n  static import(name: 'delta'): typeof Delta;\n  static import(name: string): unknown;\n  static import(name: string) {\n    if (this.imports[name] == null) {\n      debug.error(`Cannot import ${name}. Are you sure it was registered?`);\n    }\n    return this.imports[name];\n  }\n\n  static register(\n    path:\n      | string\n      | Parchment.BlotConstructor\n      | Parchment.Attributor\n      | Record<string, unknown>,\n    target?: Parchment.BlotConstructor | Parchment.Attributor | boolean,\n    overwrite = false,\n  ) {\n    if (typeof path !== 'string') {\n      const name = 'attrName' in path ? path.attrName : path.blotName;\n      if (typeof name === 'string') {\n        // register(Blot | Attributor, overwrite)\n        // @ts-expect-error\n        this.register(`formats/${name}`, path, target);\n      } else {\n        Object.keys(path).forEach((key) => {\n          // @ts-expect-error\n          this.register(key, path[key], target);\n        });\n      }\n    } else {\n      if (this.imports[path] != null && !overwrite) {\n        debug.warn(`Overwriting ${path} with`, target);\n      }\n      this.imports[path] = target;\n      if (\n        (path.startsWith('blots/') || path.startsWith('formats/')) &&\n        target &&\n        typeof target !== 'boolean' &&\n        // @ts-expect-error\n        target.blotName !== 'abstract'\n      ) {\n        globalRegistry.register(target);\n      }\n      // @ts-expect-error\n      if (typeof target.register === 'function') {\n        // @ts-expect-error\n        target.register(globalRegistry);\n      }\n    }\n  }\n\n  container: HTMLElement;\n  root: HTMLDivElement;\n  scroll: Scroll;\n  emitter: Emitter;\n  allowReadOnlyEdits: boolean;\n  editor: Editor;\n  composition: Composition;\n  selection: Selection;\n\n  theme: Theme;\n  keyboard: Keyboard;\n  clipboard: Clipboard;\n  history: History;\n  uploader: Uploader;\n\n  options: ExpandedOptions;\n\n  constructor(container: HTMLElement | string, options: Options = {}) {\n    this.options = expandConfig(container, options);\n    this.container = this.options.container;\n    if (this.container == null) {\n      debug.error('Invalid Quill container', container);\n      return;\n    }\n    if (this.options.debug) {\n      Quill.debug(this.options.debug);\n    }\n    const html = this.container.innerHTML.trim();\n    this.container.classList.add('ql-container');\n    this.container.innerHTML = '';\n    instances.set(this.container, this);\n    this.root = this.addContainer('ql-editor');\n    this.root.classList.add('ql-blank');\n    this.emitter = new Emitter();\n    const scrollBlotName = Parchment.ScrollBlot.blotName;\n    const ScrollBlot = this.options.registry.query(scrollBlotName);\n    if (!ScrollBlot || !('blotName' in ScrollBlot)) {\n      throw new Error(\n        `Cannot initialize Quill without \"${scrollBlotName}\" blot`,\n      );\n    }\n    this.scroll = new ScrollBlot(this.options.registry, this.root, {\n      emitter: this.emitter,\n    }) as Scroll;\n    this.editor = new Editor(this.scroll);\n    this.selection = new Selection(this.scroll, this.emitter);\n    this.composition = new Composition(this.scroll, this.emitter);\n    this.theme = new this.options.theme(this, this.options); // eslint-disable-line new-cap\n    this.keyboard = this.theme.addModule('keyboard');\n    this.clipboard = this.theme.addModule('clipboard');\n    this.history = this.theme.addModule('history');\n    this.uploader = this.theme.addModule('uploader');\n    this.theme.addModule('input');\n    this.theme.addModule('uiNode');\n    this.theme.init();\n    this.emitter.on(Emitter.events.EDITOR_CHANGE, (type) => {\n      if (type === Emitter.events.TEXT_CHANGE) {\n        this.root.classList.toggle('ql-blank', this.editor.isBlank());\n      }\n    });\n    this.emitter.on(Emitter.events.SCROLL_UPDATE, (source, mutations) => {\n      const oldRange = this.selection.lastRange;\n      const [newRange] = this.selection.getRange();\n      const selectionInfo =\n        oldRange && newRange ? { oldRange, newRange } : undefined;\n      modify.call(\n        this,\n        () => this.editor.update(null, mutations, selectionInfo),\n        source,\n      );\n    });\n    this.emitter.on(Emitter.events.SCROLL_EMBED_UPDATE, (blot, delta) => {\n      const oldRange = this.selection.lastRange;\n      const [newRange] = this.selection.getRange();\n      const selectionInfo =\n        oldRange && newRange ? { oldRange, newRange } : undefined;\n      modify.call(\n        this,\n        () => {\n          const change = new Delta()\n            .retain(blot.offset(this))\n            .retain({ [blot.statics.blotName]: delta });\n          return this.editor.update(change, [], selectionInfo);\n        },\n        Quill.sources.USER,\n      );\n    });\n    if (html) {\n      const contents = this.clipboard.convert({\n        html: `${html}<p><br></p>`,\n        text: '\\n',\n      });\n      this.setContents(contents);\n    }\n    this.history.clear();\n    if (this.options.placeholder) {\n      this.root.setAttribute('data-placeholder', this.options.placeholder);\n    }\n    if (this.options.readOnly) {\n      this.disable();\n    }\n    this.allowReadOnlyEdits = false;\n  }\n\n  addContainer(container: string, refNode?: Node | null): HTMLDivElement;\n  addContainer(container: HTMLElement, refNode?: Node | null): HTMLElement;\n  addContainer(\n    container: string | HTMLElement,\n    refNode: Node | null = null,\n  ): HTMLDivElement | HTMLElement {\n    if (typeof container === 'string') {\n      const className = container;\n      container = document.createElement('div');\n      container.classList.add(className);\n    }\n    this.container.insertBefore(container, refNode);\n    return container;\n  }\n\n  blur() {\n    this.selection.setRange(null);\n  }\n\n  deleteText(range: Range, source?: EmitterSource): Delta;\n  deleteText(index: number, length: number, source?: EmitterSource): Delta;\n  deleteText(\n    index: number | Range,\n    length?: number | EmitterSource,\n    source?: EmitterSource,\n  ): Delta {\n    // @ts-expect-error\n    [index, length, , source] = overload(index, length, source);\n    return modify.call(\n      this,\n      () => {\n        return this.editor.deleteText(index, length);\n      },\n      source,\n      index,\n      -1 * length,\n    );\n  }\n\n  disable() {\n    this.enable(false);\n  }\n\n  editReadOnly<T>(modifier: () => T): T {\n    this.allowReadOnlyEdits = true;\n    const value = modifier();\n    this.allowReadOnlyEdits = false;\n    return value;\n  }\n\n  enable(enabled = true) {\n    this.scroll.enable(enabled);\n    this.container.classList.toggle('ql-disabled', !enabled);\n  }\n\n  focus(options: { preventScroll?: boolean } = {}) {\n    this.selection.focus();\n    if (!options.preventScroll) {\n      this.scrollSelectionIntoView();\n    }\n  }\n\n  format(\n    name: string,\n    value: unknown,\n    source: EmitterSource = Emitter.sources.API,\n  ) {\n    return modify.call(\n      this,\n      () => {\n        const range = this.getSelection(true);\n        let change = new Delta();\n        if (range == null) return change;\n        if (this.scroll.query(name, Parchment.Scope.BLOCK)) {\n          change = this.editor.formatLine(range.index, range.length, {\n            [name]: value,\n          });\n        } else if (range.length === 0) {\n          this.selection.format(name, value);\n          return change;\n        } else {\n          change = this.editor.formatText(range.index, range.length, {\n            [name]: value,\n          });\n        }\n        this.setSelection(range, Emitter.sources.SILENT);\n        return change;\n      },\n      source,\n    );\n  }\n\n  formatLine(\n    index: number,\n    length: number,\n    formats: Record<string, unknown>,\n    source?: EmitterSource,\n  ): Delta;\n  formatLine(\n    index: number,\n    length: number,\n    name: string,\n    value?: unknown,\n    source?: EmitterSource,\n  ): Delta;\n  formatLine(\n    index: number,\n    length: number,\n    name: string | Record<string, unknown>,\n    value?: unknown | EmitterSource,\n    source?: EmitterSource,\n  ): Delta {\n    let formats: Record<string, unknown>;\n    // eslint-disable-next-line prefer-const\n    [index, length, formats, source] = overload(\n      index,\n      length,\n      // @ts-expect-error\n      name,\n      value,\n      source,\n    );\n    return modify.call(\n      this,\n      () => {\n        return this.editor.formatLine(index, length, formats);\n      },\n      source,\n      index,\n      0,\n    );\n  }\n\n  formatText(\n    range: { index: number; length: number },\n    name: string,\n    value: unknown,\n    source?: EmitterSource,\n  ): Delta;\n  formatText(\n    index: number,\n    length: number,\n    name: string,\n    value: unknown,\n    source: EmitterSource,\n  ): Delta;\n  formatText(\n    index: number | { index: number; length: number },\n    length: number | string,\n    name: string | unknown,\n    value?: unknown | EmitterSource,\n    source?: EmitterSource,\n  ): Delta {\n    let formats: Record<string, unknown>;\n    // eslint-disable-next-line prefer-const\n    [index, length, formats, source] = overload(\n      // @ts-expect-error\n      index,\n      length,\n      name,\n      value,\n      source,\n    );\n    return modify.call(\n      this,\n      () => {\n        return this.editor.formatText(index, length, formats);\n      },\n      source,\n      index,\n      0,\n    );\n  }\n\n  getBounds(index: number | Range, length = 0): Bounds | null {\n    let bounds: Bounds | null = null;\n    if (typeof index === 'number') {\n      bounds = this.selection.getBounds(index, length);\n    } else {\n      bounds = this.selection.getBounds(index.index, index.length);\n    }\n    if (!bounds) return null;\n    const containerBounds = this.container.getBoundingClientRect();\n    return {\n      bottom: bounds.bottom - containerBounds.top,\n      height: bounds.height,\n      left: bounds.left - containerBounds.left,\n      right: bounds.right - containerBounds.left,\n      top: bounds.top - containerBounds.top,\n      width: bounds.width,\n    };\n  }\n\n  getContents(index = 0, length = this.getLength() - index) {\n    [index, length] = overload(index, length);\n    return this.editor.getContents(index, length);\n  }\n\n  getFormat(index?: number, length?: number): { [format: string]: unknown };\n  getFormat(range?: { index: number; length: number }): {\n    [format: string]: unknown;\n  };\n  getFormat(\n    index: { index: number; length: number } | number = this.getSelection(true),\n    length = 0,\n  ): { [format: string]: unknown } {\n    if (typeof index === 'number') {\n      return this.editor.getFormat(index, length);\n    }\n    return this.editor.getFormat(index.index, index.length);\n  }\n\n  getIndex(blot: Parchment.Blot) {\n    return blot.offset(this.scroll);\n  }\n\n  getLength() {\n    return this.scroll.length();\n  }\n\n  getLeaf(index: number) {\n    return this.scroll.leaf(index);\n  }\n\n  getLine(index: number) {\n    return this.scroll.line(index);\n  }\n\n  getLines(range: { index: number; length: number }): (Block | BlockEmbed)[];\n  getLines(index?: number, length?: number): (Block | BlockEmbed)[];\n  getLines(\n    index: { index: number; length: number } | number = 0,\n    length = Number.MAX_VALUE,\n  ): (Block | BlockEmbed)[] {\n    if (typeof index !== 'number') {\n      return this.scroll.lines(index.index, index.length);\n    }\n    return this.scroll.lines(index, length);\n  }\n\n  getModule(name: string) {\n    return this.theme.modules[name];\n  }\n\n  getSelection(focus: true): Range;\n  getSelection(focus?: boolean): Range | null;\n  getSelection(focus = false): Range | null {\n    if (focus) this.focus();\n    this.update(); // Make sure we access getRange with editor in consistent state\n    return this.selection.getRange()[0];\n  }\n\n  getSemanticHTML(range: { index: number; length: number }): string;\n  getSemanticHTML(index?: number, length?: number): string;\n  getSemanticHTML(\n    index: { index: number; length: number } | number = 0,\n    length?: number,\n  ) {\n    if (typeof index === 'number') {\n      length = length ?? this.getLength() - index;\n    }\n    // @ts-expect-error\n    [index, length] = overload(index, length);\n    return this.editor.getHTML(index, length);\n  }\n\n  getText(range?: { index: number; length: number }): string;\n  getText(index?: number, length?: number): string;\n  getText(\n    index: { index: number; length: number } | number = 0,\n    length?: number,\n  ): string {\n    if (typeof index === 'number') {\n      length = length ?? this.getLength() - index;\n    }\n    // @ts-expect-error\n    [index, length] = overload(index, length);\n    return this.editor.getText(index, length);\n  }\n\n  hasFocus() {\n    return this.selection.hasFocus();\n  }\n\n  insertEmbed(\n    index: number,\n    embed: string,\n    value: unknown,\n    source: EmitterSource = Quill.sources.API,\n  ) {\n    return modify.call(\n      this,\n      () => {\n        return this.editor.insertEmbed(index, embed, value);\n      },\n      source,\n      index,\n    );\n  }\n\n  insertText(index: number, text: string, source: EmitterSource): Delta;\n  insertText(\n    index: number,\n    text: string,\n    formats: Record<string, unknown>,\n    source: EmitterSource,\n  ): Delta;\n  insertText(\n    index: number,\n    text: string,\n    name: string,\n    value: unknown,\n    source: EmitterSource,\n  ): Delta;\n  insertText(\n    index: number,\n    text: string,\n    name: string | Record<string, unknown> | EmitterSource,\n    value?: unknown,\n    source?: EmitterSource,\n  ): Delta {\n    let formats: Record<string, unknown>;\n    // eslint-disable-next-line prefer-const\n    // @ts-expect-error\n    [index, , formats, source] = overload(index, 0, name, value, source);\n    return modify.call(\n      this,\n      () => {\n        return this.editor.insertText(index, text, formats);\n      },\n      source,\n      index,\n      text.length,\n    );\n  }\n\n  isEnabled() {\n    return this.scroll.isEnabled();\n  }\n\n  off(...args: Parameters<(typeof Emitter)['prototype']['off']>) {\n    return this.emitter.off(...args);\n  }\n\n  on(\n    event: (typeof Emitter)['events']['TEXT_CHANGE'],\n    handler: (delta: Delta, oldContent: Delta, source: EmitterSource) => void,\n  ): Emitter;\n  on(\n    event: (typeof Emitter)['events']['SELECTION_CHANGE'],\n    handler: (range: Range, oldRange: Range, source: EmitterSource) => void,\n  ): Emitter;\n  on(\n    event: (typeof Emitter)['events']['EDITOR_CHANGE'],\n    handler: (\n      ...args:\n        | [\n            (typeof Emitter)['events']['TEXT_CHANGE'],\n            Delta,\n            Delta,\n            EmitterSource,\n          ]\n        | [\n            (typeof Emitter)['events']['SELECTION_CHANGE'],\n            Range,\n            Range,\n            EmitterSource,\n          ]\n    ) => void,\n  ): Emitter;\n  on(event: string, ...args: unknown[]): Emitter;\n  on(...args: Parameters<(typeof Emitter)['prototype']['on']>): Emitter {\n    return this.emitter.on(...args);\n  }\n\n  once(...args: Parameters<(typeof Emitter)['prototype']['once']>) {\n    return this.emitter.once(...args);\n  }\n\n  removeFormat(...args: Parameters<typeof overload>) {\n    const [index, length, , source] = overload(...args);\n    return modify.call(\n      this,\n      () => {\n        return this.editor.removeFormat(index, length);\n      },\n      source,\n      index,\n    );\n  }\n\n  scrollRectIntoView(rect: Rect) {\n    scrollRectIntoView(this.root, rect);\n  }\n\n  /**\n   * @deprecated Use Quill#scrollSelectionIntoView() instead.\n   */\n  scrollIntoView() {\n    console.warn(\n      'Quill#scrollIntoView() has been deprecated and will be removed in the near future. Please use Quill#scrollSelectionIntoView() instead.',\n    );\n    this.scrollSelectionIntoView();\n  }\n\n  /**\n   * Scroll the current selection into the visible area.\n   * If the selection is already visible, no scrolling will occur.\n   */\n  scrollSelectionIntoView() {\n    const range = this.selection.lastRange;\n    const bounds = range && this.selection.getBounds(range.index, range.length);\n    if (bounds) {\n      this.scrollRectIntoView(bounds);\n    }\n  }\n\n  setContents(\n    delta: Delta | Op[],\n    source: EmitterSource = Emitter.sources.API,\n  ) {\n    return modify.call(\n      this,\n      () => {\n        delta = new Delta(delta);\n        const length = this.getLength();\n        // Quill will set empty editor to \\n\n        const delete1 = this.editor.deleteText(0, length);\n        const applied = this.editor.insertContents(0, delta);\n        // Remove extra \\n from empty editor initialization\n        const delete2 = this.editor.deleteText(this.getLength() - 1, 1);\n        return delete1.compose(applied).compose(delete2);\n      },\n      source,\n    );\n  }\n  setSelection(range: Range | null, source?: EmitterSource): void;\n  setSelection(index: number, source?: EmitterSource): void;\n  setSelection(index: number, length?: number, source?: EmitterSource): void;\n  setSelection(index: number, source?: EmitterSource): void;\n  setSelection(\n    index: Range | null | number,\n    length?: EmitterSource | number,\n    source?: EmitterSource,\n  ): void {\n    if (index == null) {\n      // @ts-expect-error https://github.com/microsoft/TypeScript/issues/22609\n      this.selection.setRange(null, length || Quill.sources.API);\n    } else {\n      // @ts-expect-error\n      [index, length, , source] = overload(index, length, source);\n      this.selection.setRange(new Range(Math.max(0, index), length), source);\n      if (source !== Emitter.sources.SILENT) {\n        this.scrollSelectionIntoView();\n      }\n    }\n  }\n\n  setText(text: string, source: EmitterSource = Emitter.sources.API) {\n    const delta = new Delta().insert(text);\n    return this.setContents(delta, source);\n  }\n\n  update(source: EmitterSource = Emitter.sources.USER) {\n    const change = this.scroll.update(source); // Will update selection before selection.update() does if text changes\n    this.selection.update(source);\n    // TODO this is usually undefined\n    return change;\n  }\n\n  updateContents(\n    delta: Delta | Op[],\n    source: EmitterSource = Emitter.sources.API,\n  ) {\n    return modify.call(\n      this,\n      () => {\n        delta = new Delta(delta);\n        return this.editor.applyDelta(delta);\n      },\n      source,\n      true,\n    );\n  }\n}\n\nfunction resolveSelector(selector: string | HTMLElement | null | undefined) {\n  return typeof selector === 'string'\n    ? document.querySelector<HTMLElement>(selector)\n    : selector;\n}\n\nfunction expandModuleConfig(config: Record<string, unknown> | undefined) {\n  return Object.entries(config ?? {}).reduce(\n    (expanded, [key, value]) => ({\n      ...expanded,\n      [key]: value === true ? {} : value,\n    }),\n    {},\n  );\n}\n\nfunction expandConfig(\n  containerOrSelector: HTMLElement | string,\n  options: Options,\n): ExpandedOptions {\n  const container = resolveSelector(containerOrSelector);\n  if (!container) {\n    throw new Error('Invalid Quill container');\n  }\n\n  const shouldUseDefaultTheme =\n    !options.theme || options.theme === Quill.DEFAULTS.theme;\n  const theme = shouldUseDefaultTheme\n    ? Theme\n    : Quill.import(`themes/${options.theme}`);\n  if (!theme) {\n    throw new Error(`Invalid theme ${options.theme}. Did you register it?`);\n  }\n\n  const { modules: quillModuleDefaults, ...quillDefaults } = Quill.DEFAULTS;\n  const { modules: themeModuleDefaults, ...themeDefaults } = theme.DEFAULTS;\n\n  const modules: ExpandedOptions['modules'] = merge(\n    {},\n    expandModuleConfig(quillModuleDefaults),\n    expandModuleConfig(themeModuleDefaults),\n    expandModuleConfig(options.modules),\n  );\n  // Special case toolbar shorthand\n  if (\n    modules != null &&\n    modules.toolbar &&\n    modules.toolbar.constructor !== Object\n  ) {\n    modules.toolbar = {\n      container: modules.toolbar,\n    };\n  }\n\n  const config = { ...quillDefaults, ...themeDefaults, ...options };\n\n  let registry = options.registry;\n  if (registry) {\n    if (options.formats) {\n      debug.warn('Ignoring \"formats\" option because \"registry\" is specified');\n    }\n  } else {\n    registry = options.formats\n      ? createRegistryWithFormats(options.formats, config.registry, debug)\n      : config.registry;\n  }\n\n  return {\n    ...config,\n    registry,\n    container,\n    theme,\n    modules: Object.entries(modules).reduce(\n      (modulesWithDefaults, [name, value]) => {\n        if (!value) return modulesWithDefaults;\n\n        const moduleClass = Quill.import(`modules/${name}`);\n        if (moduleClass == null) {\n          debug.error(\n            `Cannot load ${name} module. Are you sure you registered it?`,\n          );\n          return modulesWithDefaults;\n        }\n        return {\n          ...modulesWithDefaults,\n          // @ts-expect-error\n          [name]: merge({}, moduleClass.DEFAULTS || {}, value),\n        };\n      },\n      {},\n    ),\n    bounds: resolveSelector(config.bounds),\n  };\n}\n\n// Handle selection preservation and TEXT_CHANGE emission\n// common to modification APIs\nfunction modify(\n  modifier: () => Delta,\n  source: EmitterSource,\n  index: number | boolean,\n  shift: number | null,\n) {\n  if (\n    !this.isEnabled() &&\n    source === Emitter.sources.USER &&\n    !this.allowReadOnlyEdits\n  ) {\n    return new Delta();\n  }\n  let range = index == null ? null : this.getSelection();\n  const oldDelta = this.editor.delta;\n  const change = modifier();\n  if (range != null) {\n    if (index === true) {\n      index = range.index; // eslint-disable-line prefer-destructuring\n    }\n    if (shift == null) {\n      range = shiftRange(range, change, source);\n    } else if (shift !== 0) {\n      // @ts-expect-error index should always be number\n      range = shiftRange(range, index, shift, source);\n    }\n    this.setSelection(range, Emitter.sources.SILENT);\n  }\n  if (change.length() > 0) {\n    const args = [Emitter.events.TEXT_CHANGE, change, oldDelta, source];\n    this.emitter.emit(Emitter.events.EDITOR_CHANGE, ...args);\n    if (source !== Emitter.sources.SILENT) {\n      this.emitter.emit(...args);\n    }\n  }\n  return change;\n}\n\ntype NormalizedIndexLength = [\n  number,\n  number,\n  Record<string, unknown>,\n  EmitterSource,\n];\nfunction overload(index: number, source?: EmitterSource): NormalizedIndexLength;\nfunction overload(\n  index: number,\n  length: number,\n  source?: EmitterSource,\n): NormalizedIndexLength;\nfunction overload(\n  index: number,\n  length: number,\n  format: string,\n  value: unknown,\n  source?: EmitterSource,\n): NormalizedIndexLength;\nfunction overload(\n  index: number,\n  length: number,\n  format: Record<string, unknown>,\n  source?: EmitterSource,\n): NormalizedIndexLength;\nfunction overload(range: Range, source?: EmitterSource): NormalizedIndexLength;\nfunction overload(\n  range: Range,\n  format: string,\n  value: unknown,\n  source?: EmitterSource,\n): NormalizedIndexLength;\nfunction overload(\n  range: Range,\n  format: Record<string, unknown>,\n  source?: EmitterSource,\n): NormalizedIndexLength;\nfunction overload(\n  index: Range | number,\n  length?: number | string | Record<string, unknown> | EmitterSource,\n  name?: string | unknown | Record<string, unknown> | EmitterSource,\n  value?: unknown | EmitterSource,\n  source?: EmitterSource,\n): NormalizedIndexLength {\n  let formats: Record<string, unknown> = {};\n  // @ts-expect-error\n  if (typeof index.index === 'number' && typeof index.length === 'number') {\n    // Allow for throwaway end (used by insertText/insertEmbed)\n    if (typeof length !== 'number') {\n      // @ts-expect-error\n      source = value;\n      value = name;\n      name = length;\n      // @ts-expect-error\n      length = index.length; // eslint-disable-line prefer-destructuring\n      // @ts-expect-error\n      index = index.index; // eslint-disable-line prefer-destructuring\n    } else {\n      // @ts-expect-error\n      length = index.length; // eslint-disable-line prefer-destructuring\n      // @ts-expect-error\n      index = index.index; // eslint-disable-line prefer-destructuring\n    }\n  } else if (typeof length !== 'number') {\n    // @ts-expect-error\n    source = value;\n    value = name;\n    name = length;\n    length = 0;\n  }\n  // Handle format being object, two format name/value strings or excluded\n  if (typeof name === 'object') {\n    // @ts-expect-error Fix me later\n    formats = name;\n    // @ts-expect-error\n    source = value;\n  } else if (typeof name === 'string') {\n    if (value != null) {\n      formats[name] = value;\n    } else {\n      // @ts-expect-error\n      source = name;\n    }\n  }\n  // Handle optional source\n  source = source || Emitter.sources.API;\n  // @ts-expect-error\n  return [index, length, formats, source];\n}\n\nfunction shiftRange(range: Range, change: Delta, source?: EmitterSource): Range;\nfunction shiftRange(\n  range: Range,\n  index: number,\n  length?: number,\n  source?: EmitterSource,\n): Range;\nfunction shiftRange(\n  range: Range,\n  index: number | Delta,\n  lengthOrSource?: number | EmitterSource,\n  source?: EmitterSource,\n) {\n  const length = typeof lengthOrSource === 'number' ? lengthOrSource : 0;\n  if (range == null) return null;\n  let start;\n  let end;\n  // @ts-expect-error -- TODO: add a better type guard around `index`\n  if (index && typeof index.transformPosition === 'function') {\n    [start, end] = [range.index, range.index + range.length].map((pos) =>\n      // @ts-expect-error -- TODO: add a better type guard around `index`\n      index.transformPosition(pos, source !== Emitter.sources.USER),\n    );\n  } else {\n    [start, end] = [range.index, range.index + range.length].map((pos) => {\n      // @ts-expect-error -- TODO: add a better type guard around `index`\n      if (pos < index || (pos === index && source === Emitter.sources.USER))\n        return pos;\n      if (length >= 0) {\n        return pos + length;\n      }\n      // @ts-expect-error -- TODO: add a better type guard around `index`\n      return Math.max(index, pos + length);\n    });\n  }\n  return new Range(start, end - start);\n}\n\nexport { globalRegistry, expandConfig, overload, Quill as default };\n","import { LeafBlot, Scope } from 'parchment';\nimport { cloneDeep, isEqual } from 'lodash-es';\nimport Emitter from './emitter.js';\nimport type { EmitterSource } from './emitter.js';\nimport logger from './logger.js';\nimport type Cursor from '../blots/cursor.js';\nimport type Scroll from '../blots/scroll.js';\n\nconst debug = logger('quill:selection');\n\ntype NativeRange = AbstractRange;\n\ninterface NormalizedRange {\n  start: {\n    node: NativeRange['startContainer'];\n    offset: NativeRange['startOffset'];\n  };\n  end: { node: NativeRange['endContainer']; offset: NativeRange['endOffset'] };\n  native: NativeRange;\n}\n\nexport interface Bounds {\n  bottom: number;\n  height: number;\n  left: number;\n  right: number;\n  top: number;\n  width: number;\n}\n\nclass Range {\n  constructor(\n    public index: number,\n    public length = 0,\n  ) {}\n}\n\nclass Selection {\n  scroll: Scroll;\n  emitter: Emitter;\n  composing: boolean;\n  mouseDown: boolean;\n\n  root: HTMLElement;\n  cursor: Cursor;\n  savedRange: Range;\n  lastRange: Range | null;\n  lastNative: NormalizedRange | null;\n\n  constructor(scroll: Scroll, emitter: Emitter) {\n    this.emitter = emitter;\n    this.scroll = scroll;\n    this.composing = false;\n    this.mouseDown = false;\n    this.root = this.scroll.domNode;\n    // @ts-expect-error\n    this.cursor = this.scroll.create('cursor', this);\n    // savedRange is last non-null range\n    this.savedRange = new Range(0, 0);\n    this.lastRange = this.savedRange;\n    this.lastNative = null;\n    this.handleComposition();\n    this.handleDragging();\n    this.emitter.listenDOM('selectionchange', document, () => {\n      if (!this.mouseDown && !this.composing) {\n        setTimeout(this.update.bind(this, Emitter.sources.USER), 1);\n      }\n    });\n    this.emitter.on(Emitter.events.SCROLL_BEFORE_UPDATE, () => {\n      if (!this.hasFocus()) return;\n      const native = this.getNativeRange();\n      if (native == null) return;\n      if (native.start.node === this.cursor.textNode) return; // cursor.restore() will handle\n      this.emitter.once(\n        Emitter.events.SCROLL_UPDATE,\n        (source, mutations: MutationRecord[]) => {\n          try {\n            if (\n              this.root.contains(native.start.node) &&\n              this.root.contains(native.end.node)\n            ) {\n              this.setNativeRange(\n                native.start.node,\n                native.start.offset,\n                native.end.node,\n                native.end.offset,\n              );\n            }\n            const triggeredByTyping = mutations.some(\n              (mutation) =>\n                mutation.type === 'characterData' ||\n                mutation.type === 'childList' ||\n                (mutation.type === 'attributes' &&\n                  mutation.target === this.root),\n            );\n            this.update(triggeredByTyping ? Emitter.sources.SILENT : source);\n          } catch (ignored) {\n            // ignore\n          }\n        },\n      );\n    });\n    this.emitter.on(Emitter.events.SCROLL_OPTIMIZE, (mutations, context) => {\n      if (context.range) {\n        const { startNode, startOffset, endNode, endOffset } = context.range;\n        this.setNativeRange(startNode, startOffset, endNode, endOffset);\n        this.update(Emitter.sources.SILENT);\n      }\n    });\n    this.update(Emitter.sources.SILENT);\n  }\n\n  handleComposition() {\n    this.emitter.on(Emitter.events.COMPOSITION_BEFORE_START, () => {\n      this.composing = true;\n    });\n    this.emitter.on(Emitter.events.COMPOSITION_END, () => {\n      this.composing = false;\n      if (this.cursor.parent) {\n        const range = this.cursor.restore();\n        if (!range) return;\n        setTimeout(() => {\n          this.setNativeRange(\n            range.startNode,\n            range.startOffset,\n            range.endNode,\n            range.endOffset,\n          );\n        }, 1);\n      }\n    });\n  }\n\n  handleDragging() {\n    this.emitter.listenDOM('mousedown', document.body, () => {\n      this.mouseDown = true;\n    });\n    this.emitter.listenDOM('mouseup', document.body, () => {\n      this.mouseDown = false;\n      this.update(Emitter.sources.USER);\n    });\n  }\n\n  focus() {\n    if (this.hasFocus()) return;\n    this.root.focus({ preventScroll: true });\n    this.setRange(this.savedRange);\n  }\n\n  format(format: string, value: unknown) {\n    this.scroll.update();\n    const nativeRange = this.getNativeRange();\n    if (\n      nativeRange == null ||\n      !nativeRange.native.collapsed ||\n      this.scroll.query(format, Scope.BLOCK)\n    )\n      return;\n    if (nativeRange.start.node !== this.cursor.textNode) {\n      const blot = this.scroll.find(nativeRange.start.node, false);\n      if (blot == null) return;\n      // TODO Give blot ability to not split\n      if (blot instanceof LeafBlot) {\n        const after = blot.split(nativeRange.start.offset);\n        // @ts-expect-error Fix me later\n        blot.parent.insertBefore(this.cursor, after);\n      } else {\n        // @ts-expect-error TODO: nativeRange.start.node doesn't seem to match function signature\n        blot.insertBefore(this.cursor, nativeRange.start.node); // Should never happen\n      }\n      this.cursor.attach();\n    }\n    this.cursor.format(format, value);\n    this.scroll.optimize();\n    this.setNativeRange(this.cursor.textNode, this.cursor.textNode.data.length);\n    this.update();\n  }\n\n  getBounds(index: number, length = 0) {\n    const scrollLength = this.scroll.length();\n    index = Math.min(index, scrollLength - 1);\n    length = Math.min(index + length, scrollLength - 1) - index;\n    let node: Node;\n    let [leaf, offset] = this.scroll.leaf(index);\n    if (leaf == null) return null;\n    if (length > 0 && offset === leaf.length()) {\n      const [next] = this.scroll.leaf(index + 1);\n      if (next) {\n        const [line] = this.scroll.line(index);\n        const [nextLine] = this.scroll.line(index + 1);\n        if (line === nextLine) {\n          leaf = next;\n          offset = 0;\n        }\n      }\n    }\n    [node, offset] = leaf.position(offset, true);\n    const range = document.createRange();\n    if (length > 0) {\n      range.setStart(node, offset);\n      [leaf, offset] = this.scroll.leaf(index + length);\n      if (leaf == null) return null;\n      [node, offset] = leaf.position(offset, true);\n      range.setEnd(node, offset);\n      return range.getBoundingClientRect();\n    }\n    let side: 'left' | 'right' = 'left';\n    let rect: DOMRect;\n    if (node instanceof Text) {\n      // Return null if the text node is empty because it is\n      // not able to get a useful client rect:\n      // https://github.com/w3c/csswg-drafts/issues/2514.\n      // Empty text nodes are most likely caused by TextBlot#optimize()\n      // not getting called when editor content changes.\n      if (!node.data.length) {\n        return null;\n      }\n      if (offset < node.data.length) {\n        range.setStart(node, offset);\n        range.setEnd(node, offset + 1);\n      } else {\n        range.setStart(node, offset - 1);\n        range.setEnd(node, offset);\n        side = 'right';\n      }\n      rect = range.getBoundingClientRect();\n    } else {\n      if (!(leaf.domNode instanceof Element)) return null;\n      rect = leaf.domNode.getBoundingClientRect();\n      if (offset > 0) side = 'right';\n    }\n    return {\n      bottom: rect.top + rect.height,\n      height: rect.height,\n      left: rect[side],\n      right: rect[side],\n      top: rect.top,\n      width: 0,\n    };\n  }\n\n  getNativeRange(): NormalizedRange | null {\n    const selection = document.getSelection();\n    if (selection == null || selection.rangeCount <= 0) return null;\n    const nativeRange = selection.getRangeAt(0);\n    if (nativeRange == null) return null;\n    const range = this.normalizeNative(nativeRange);\n    debug.info('getNativeRange', range);\n    return range;\n  }\n\n  getRange(): [Range, NormalizedRange] | [null, null] {\n    const root = this.scroll.domNode;\n    if ('isConnected' in root && !root.isConnected) {\n      // document.getSelection() forces layout on Blink, so we trend to\n      // not calling it.\n      return [null, null];\n    }\n    const normalized = this.getNativeRange();\n    if (normalized == null) return [null, null];\n    const range = this.normalizedToRange(normalized);\n    return [range, normalized];\n  }\n\n  hasFocus(): boolean {\n    return (\n      document.activeElement === this.root ||\n      (document.activeElement != null &&\n        contains(this.root, document.activeElement))\n    );\n  }\n\n  normalizedToRange(range: NormalizedRange) {\n    const positions: [Node, number][] = [\n      [range.start.node, range.start.offset],\n    ];\n    if (!range.native.collapsed) {\n      positions.push([range.end.node, range.end.offset]);\n    }\n    const indexes = positions.map((position) => {\n      const [node, offset] = position;\n      const blot = this.scroll.find(node, true);\n      // @ts-expect-error Fix me later\n      const index = blot.offset(this.scroll);\n      if (offset === 0) {\n        return index;\n      }\n      if (blot instanceof LeafBlot) {\n        return index + blot.index(node, offset);\n      }\n      // @ts-expect-error Fix me later\n      return index + blot.length();\n    });\n    const end = Math.min(Math.max(...indexes), this.scroll.length() - 1);\n    const start = Math.min(end, ...indexes);\n    return new Range(start, end - start);\n  }\n\n  normalizeNative(nativeRange: NativeRange) {\n    if (\n      !contains(this.root, nativeRange.startContainer) ||\n      (!nativeRange.collapsed && !contains(this.root, nativeRange.endContainer))\n    ) {\n      return null;\n    }\n    const range = {\n      start: {\n        node: nativeRange.startContainer,\n        offset: nativeRange.startOffset,\n      },\n      end: { node: nativeRange.endContainer, offset: nativeRange.endOffset },\n      native: nativeRange,\n    };\n    [range.start, range.end].forEach((position) => {\n      let { node, offset } = position;\n      while (!(node instanceof Text) && node.childNodes.length > 0) {\n        if (node.childNodes.length > offset) {\n          node = node.childNodes[offset];\n          offset = 0;\n        } else if (node.childNodes.length === offset) {\n          // @ts-expect-error Fix me later\n          node = node.lastChild;\n          if (node instanceof Text) {\n            offset = node.data.length;\n          } else if (node.childNodes.length > 0) {\n            // Container case\n            offset = node.childNodes.length;\n          } else {\n            // Embed case\n            offset = node.childNodes.length + 1;\n          }\n        } else {\n          break;\n        }\n      }\n      position.node = node;\n      position.offset = offset;\n    });\n    return range;\n  }\n\n  rangeToNative(range: Range): [Node | null, number, Node | null, number] {\n    const scrollLength = this.scroll.length();\n\n    const getPosition = (\n      index: number,\n      inclusive: boolean,\n    ): [Node | null, number] => {\n      index = Math.min(scrollLength - 1, index);\n      const [leaf, leafOffset] = this.scroll.leaf(index);\n      return leaf ? leaf.position(leafOffset, inclusive) : [null, -1];\n    };\n    return [\n      ...getPosition(range.index, false),\n      ...getPosition(range.index + range.length, true),\n    ];\n  }\n\n  setNativeRange(\n    startNode: Node | null,\n    startOffset?: number,\n    endNode = startNode,\n    endOffset = startOffset,\n    force = false,\n  ) {\n    debug.info('setNativeRange', startNode, startOffset, endNode, endOffset);\n    if (\n      startNode != null &&\n      (this.root.parentNode == null ||\n        startNode.parentNode == null ||\n        // @ts-expect-error Fix me later\n        endNode.parentNode == null)\n    ) {\n      return;\n    }\n    const selection = document.getSelection();\n    if (selection == null) return;\n    if (startNode != null) {\n      if (!this.hasFocus()) this.root.focus({ preventScroll: true });\n      const { native } = this.getNativeRange() || {};\n      if (\n        native == null ||\n        force ||\n        startNode !== native.startContainer ||\n        startOffset !== native.startOffset ||\n        endNode !== native.endContainer ||\n        endOffset !== native.endOffset\n      ) {\n        if (startNode instanceof Element && startNode.tagName === 'BR') {\n          // @ts-expect-error Fix me later\n          startOffset = Array.from(startNode.parentNode.childNodes).indexOf(\n            startNode,\n          );\n          startNode = startNode.parentNode;\n        }\n        if (endNode instanceof Element && endNode.tagName === 'BR') {\n          // @ts-expect-error Fix me later\n          endOffset = Array.from(endNode.parentNode.childNodes).indexOf(\n            endNode,\n          );\n          endNode = endNode.parentNode;\n        }\n        const range = document.createRange();\n        // @ts-expect-error Fix me later\n        range.setStart(startNode, startOffset);\n        // @ts-expect-error Fix me later\n        range.setEnd(endNode, endOffset);\n        selection.removeAllRanges();\n        selection.addRange(range);\n      }\n    } else {\n      selection.removeAllRanges();\n      this.root.blur();\n    }\n  }\n\n  setRange(range: Range | null, force: boolean, source?: EmitterSource): void;\n  setRange(range: Range | null, source?: EmitterSource): void;\n  setRange(\n    range: Range | null,\n    force: boolean | EmitterSource = false,\n    source: EmitterSource = Emitter.sources.API,\n  ): void {\n    if (typeof force === 'string') {\n      source = force;\n      force = false;\n    }\n    debug.info('setRange', range);\n    if (range != null) {\n      const args = this.rangeToNative(range);\n      this.setNativeRange(...args, force);\n    } else {\n      this.setNativeRange(null);\n    }\n    this.update(source);\n  }\n\n  update(source: EmitterSource = Emitter.sources.USER) {\n    const oldRange = this.lastRange;\n    const [lastRange, nativeRange] = this.getRange();\n    this.lastRange = lastRange;\n    this.lastNative = nativeRange;\n    if (this.lastRange != null) {\n      this.savedRange = this.lastRange;\n    }\n    if (!isEqual(oldRange, this.lastRange)) {\n      if (\n        !this.composing &&\n        nativeRange != null &&\n        nativeRange.native.collapsed &&\n        nativeRange.start.node !== this.cursor.textNode\n      ) {\n        const range = this.cursor.restore();\n        if (range) {\n          this.setNativeRange(\n            range.startNode,\n            range.startOffset,\n            range.endNode,\n            range.endOffset,\n          );\n        }\n      }\n      const args = [\n        Emitter.events.SELECTION_CHANGE,\n        cloneDeep(this.lastRange),\n        cloneDeep(oldRange),\n        source,\n      ];\n      this.emitter.emit(Emitter.events.EDITOR_CHANGE, ...args);\n      if (source !== Emitter.sources.SILENT) {\n        this.emitter.emit(...args);\n      }\n    }\n  }\n}\n\nfunction contains(parent: Node, descendant: Node) {\n  try {\n    // Firefox inserts inaccessible nodes around video elements\n    descendant.parentNode; // eslint-disable-line @typescript-eslint/no-unused-expressions\n  } catch (e) {\n    return false;\n  }\n  return parent.contains(descendant);\n}\n\nexport { Range, Selection as default };\n","import type Quill from '../core.js';\nimport type Clipboard from '../modules/clipboard.js';\nimport type History from '../modules/history.js';\nimport type Keyboard from '../modules/keyboard.js';\nimport type { ToolbarProps } from '../modules/toolbar.js';\nimport type Uploader from '../modules/uploader.js';\n\nexport interface ThemeOptions {\n  modules: Record<string, unknown> & {\n    toolbar?: null | ToolbarProps;\n  };\n}\n\nclass Theme {\n  static DEFAULTS: ThemeOptions = {\n    modules: {},\n  };\n\n  static themes = {\n    default: Theme,\n  };\n\n  modules: ThemeOptions['modules'] = {};\n\n  constructor(\n    protected quill: Quill,\n    protected options: ThemeOptions,\n  ) {}\n\n  init() {\n    Object.keys(this.options.modules).forEach((name) => {\n      if (this.modules[name] == null) {\n        this.addModule(name);\n      }\n    });\n  }\n\n  addModule(name: 'clipboard'): Clipboard;\n  addModule(name: 'keyboard'): Keyboard;\n  addModule(name: 'uploader'): Uploader;\n  addModule(name: 'history'): History;\n  addModule(name: string): unknown;\n  addModule(name: string) {\n    // @ts-expect-error\n    const ModuleClass = this.quill.constructor.import(`modules/${name}`);\n    this.modules[name] = new ModuleClass(\n      this.quill,\n      this.options.modules[name] || {},\n    );\n    return this.modules[name];\n  }\n}\n\nexport interface ThemeConstructor {\n  new (quill: Quill, options: unknown): Theme;\n  DEFAULTS: ThemeOptions;\n}\n\nexport default Theme;\n","import { Attributor, ClassAttributor, Scope, StyleAttributor } from 'parchment';\n\nconst config = {\n  scope: Scope.BLOCK,\n  whitelist: ['right', 'center', 'justify'],\n};\n\nconst AlignAttribute = new Attributor('align', 'align', config);\nconst AlignClass = new ClassAttributor('align', 'ql-align', config);\nconst AlignStyle = new StyleAttributor('align', 'text-align', config);\n\nexport { AlignAttribute, AlignClass, AlignStyle };\n","import { ClassAttributor, Scope } from 'parchment';\nimport { ColorAttributor } from './color.js';\n\nconst BackgroundClass = new ClassAttributor('background', 'ql-bg', {\n  scope: Scope.INLINE,\n});\nconst BackgroundStyle = new ColorAttributor('background', 'background-color', {\n  scope: Scope.INLINE,\n});\n\nexport { BackgroundClass, BackgroundStyle };\n","import Block from '../blots/block.js';\nimport Break from '../blots/break.js';\nimport Cursor from '../blots/cursor.js';\nimport Inline from '../blots/inline.js';\nimport TextBlot, { escapeText } from '../blots/text.js';\nimport Container from '../blots/container.js';\nimport Quill from '../core/quill.js';\n\nclass CodeBlockContainer extends Container {\n  static create(value: string) {\n    const domNode = super.create(value) as Element;\n    domNode.setAttribute('spellcheck', 'false');\n    return domNode;\n  }\n\n  code(index: number, length: number) {\n    return (\n      this.children\n        // @ts-expect-error\n        .map((child) => (child.length() <= 1 ? '' : child.domNode.innerText))\n        .join('\\n')\n        .slice(index, index + length)\n    );\n  }\n\n  html(index: number, length: number) {\n    // `\\n`s are needed in order to support empty lines at the beginning and the end.\n    // https://html.spec.whatwg.org/multipage/syntax.html#element-restrictions\n    return `<pre>\\n${escapeText(this.code(index, length))}\\n</pre>`;\n  }\n}\n\nclass CodeBlock extends Block {\n  static TAB = '  ';\n\n  static register() {\n    Quill.register(CodeBlockContainer);\n  }\n}\n\nclass Code extends Inline {}\nCode.blotName = 'code';\nCode.tagName = 'CODE';\n\nCodeBlock.blotName = 'code-block';\nCodeBlock.className = 'ql-code-block';\nCodeBlock.tagName = 'DIV';\nCodeBlockContainer.blotName = 'code-block-container';\nCodeBlockContainer.className = 'ql-code-block-container';\nCodeBlockContainer.tagName = 'DIV';\n\nCodeBlockContainer.allowedChildren = [CodeBlock];\n\nCodeBlock.allowedChildren = [TextBlot, Break, Cursor];\nCodeBlock.requiredContainer = CodeBlockContainer;\n\nexport { Code, CodeBlockContainer, CodeBlock as default };\n","import { ClassAttributor, Scope, StyleAttributor } from 'parchment';\n\nclass ColorAttributor extends StyleAttributor {\n  value(domNode: HTMLElement) {\n    let value = super.value(domNode) as string;\n    if (!value.startsWith('rgb(')) return value;\n    value = value.replace(/^[^\\d]+/, '').replace(/[^\\d]+$/, '');\n    const hex = value\n      .split(',')\n      .map((component) => `00${parseInt(component, 10).toString(16)}`.slice(-2))\n      .join('');\n    return `#${hex}`;\n  }\n}\n\nconst ColorClass = new ClassAttributor('color', 'ql-color', {\n  scope: Scope.INLINE,\n});\nconst ColorStyle = new ColorAttributor('color', 'color', {\n  scope: Scope.INLINE,\n});\n\nexport { ColorAttributor, ColorClass, ColorStyle };\n","import { Attributor, ClassAttributor, Scope, StyleAttributor } from 'parchment';\n\nconst config = {\n  scope: Scope.BLOCK,\n  whitelist: ['rtl'],\n};\n\nconst DirectionAttribute = new Attributor('direction', 'dir', config);\nconst DirectionClass = new ClassAttributor('direction', 'ql-direction', config);\nconst DirectionStyle = new StyleAttributor('direction', 'direction', config);\n\nexport { DirectionAttribute, DirectionClass, DirectionStyle };\n","import { ClassAttributor, Scope, StyleAttributor } from 'parchment';\n\nconst config = {\n  scope: Scope.INLINE,\n  whitelist: ['serif', 'monospace'],\n};\n\nconst FontClass = new ClassAttributor('font', 'ql-font', config);\n\nclass FontStyleAttributor extends StyleAttributor {\n  value(node: HTMLElement) {\n    return super.value(node).replace(/[\"']/g, '');\n  }\n}\n\nconst FontStyle = new FontStyleAttributor('font', 'font-family', config);\n\nexport { FontStyle, FontClass };\n","import { ClassAttributor, Scope, StyleAttributor } from 'parchment';\n\nconst SizeClass = new ClassAttributor('size', 'ql-size', {\n  scope: Scope.INLINE,\n  whitelist: ['small', 'large', 'huge'],\n});\nconst SizeStyle = new StyleAttributor('size', 'font-size', {\n  scope: Scope.INLINE,\n  whitelist: ['10px', '18px', '32px'],\n});\n\nexport { SizeClass, SizeStyle };\n","const normalWeightRegexp = /font-weight:\\s*normal/;\nconst blockTagNames = ['P', 'OL', 'UL'];\n\nconst isBlockElement = (element: Element | null) => {\n  return element && blockTagNames.includes(element.tagName);\n};\n\nconst normalizeEmptyLines = (doc: Document) => {\n  Array.from(doc.querySelectorAll('br'))\n    .filter(\n      (br) =>\n        isBlockElement(br.previousElementSibling) &&\n        isBlockElement(br.nextElementSibling),\n    )\n    .forEach((br) => {\n      br.parentNode?.removeChild(br);\n    });\n};\n\nconst normalizeFontWeight = (doc: Document) => {\n  Array.from(doc.querySelectorAll('b[style*=\"font-weight\"]'))\n    .filter((node) => node.getAttribute('style')?.match(normalWeightRegexp))\n    .forEach((node) => {\n      const fragment = doc.createDocumentFragment();\n      fragment.append(...node.childNodes);\n      node.parentNode?.replaceChild(fragment, node);\n    });\n};\n\nexport default function normalize(doc: Document) {\n  if (doc.querySelector('[id^=\"docs-internal-guid-\"]')) {\n    normalizeFontWeight(doc);\n    normalizeEmptyLines(doc);\n  }\n}\n","const ignoreRegexp = /\\bmso-list:[^;]*ignore/i;\nconst idRegexp = /\\bmso-list:[^;]*\\bl(\\d+)/i;\nconst indentRegexp = /\\bmso-list:[^;]*\\blevel(\\d+)/i;\n\nconst parseListItem = (element: Element, html: string) => {\n  const style = element.getAttribute('style');\n  const idMatch = style?.match(idRegexp);\n  if (!idMatch) {\n    return null;\n  }\n  const id = Number(idMatch[1]);\n\n  const indentMatch = style?.match(indentRegexp);\n  const indent = indentMatch ? Number(indentMatch[1]) : 1;\n\n  const typeRegexp = new RegExp(\n    `@list l${id}:level${indent}\\\\s*\\\\{[^\\\\}]*mso-level-number-format:\\\\s*([\\\\w-]+)`,\n    'i',\n  );\n  const typeMatch = html.match(typeRegexp);\n  const type = typeMatch && typeMatch[1] === 'bullet' ? 'bullet' : 'ordered';\n\n  return { id, indent, type, element };\n};\n\n// list items are represented as `p` tags with styles like `mso-list: l0 level1` where:\n// 1. \"0\" in \"l0\" means the list item id;\n// 2. \"1\" in \"level1\" means the indent level, starting from 1.\nconst normalizeListItem = (doc: Document) => {\n  const msoList = Array.from(doc.querySelectorAll('[style*=mso-list]'));\n  const ignored: Element[] = [];\n  const others: Element[] = [];\n  msoList.forEach((node) => {\n    const shouldIgnore = (node.getAttribute('style') || '').match(ignoreRegexp);\n    if (shouldIgnore) {\n      ignored.push(node);\n    } else {\n      others.push(node);\n    }\n  });\n\n  // Each list item contains a marker wrapped with \"mso-list: Ignore\".\n  ignored.forEach((node) => node.parentNode?.removeChild(node));\n\n  // The list stype is not defined inline with the tag, instead, it's in the\n  // style tag so we need to pass the html as a string.\n  const html = doc.documentElement.innerHTML;\n  const listItems = others\n    .map((element) => parseListItem(element, html))\n    .filter((parsed) => parsed);\n\n  while (listItems.length) {\n    const childListItems = [];\n\n    let current = listItems.shift();\n    // Group continuous items into the same group (aka \"ul\")\n    while (current) {\n      childListItems.push(current);\n      current =\n        listItems.length &&\n        listItems[0]?.element === current.element.nextElementSibling &&\n        // Different id means the next item doesn't belong to this group.\n        listItems[0].id === current.id\n          ? listItems.shift()\n          : null;\n    }\n\n    const ul = document.createElement('ul');\n    childListItems.forEach((listItem) => {\n      const li = document.createElement('li');\n      li.setAttribute('data-list', listItem.type);\n      if (listItem.indent > 1) {\n        li.setAttribute('class', `ql-indent-${listItem.indent - 1}`);\n      }\n      li.innerHTML = listItem.element.innerHTML;\n      ul.appendChild(li);\n    });\n\n    const element = childListItems[0]?.element;\n    const { parentNode } = element ?? {};\n    if (element) {\n      parentNode?.replaceChild(ul, element);\n    }\n    childListItems.slice(1).forEach(({ element: e }) => {\n      parentNode?.removeChild(e);\n    });\n  }\n};\n\nexport default function normalize(doc: Document) {\n  if (\n    doc.documentElement.getAttribute('xmlns:w') ===\n    'urn:schemas-microsoft-com:office:word'\n  ) {\n    normalizeListItem(doc);\n  }\n}\n","import googleDocs from './normalizers/googleDocs.js';\nimport msWord from './normalizers/msWord.js';\n\nconst NORMALIZERS = [msWord, googleDocs];\n\nconst normalizeExternalHTML = (doc: Document) => {\n  if (doc.documentElement) {\n    NORMALIZERS.forEach((normalize) => {\n      normalize(doc);\n    });\n  }\n};\n\nexport default normalizeExternalHTML;\n","import type { ScrollBlot } from 'parchment';\nimport {\n  Attributor,\n  BlockBlot,\n  ClassAttributor,\n  EmbedBlot,\n  Scope,\n  StyleAttributor,\n} from 'parchment';\nimport Delta from 'quill-delta';\nimport { BlockEmbed } from '../blots/block.js';\nimport type { EmitterSource } from '../core/emitter.js';\nimport logger from '../core/logger.js';\nimport Module from '../core/module.js';\nimport Quill from '../core/quill.js';\nimport type { Range } from '../core/selection.js';\nimport { AlignAttribute, AlignStyle } from '../formats/align.js';\nimport { BackgroundStyle } from '../formats/background.js';\nimport CodeBlock from '../formats/code.js';\nimport { ColorStyle } from '../formats/color.js';\nimport { DirectionAttribute, DirectionStyle } from '../formats/direction.js';\nimport { FontStyle } from '../formats/font.js';\nimport { SizeStyle } from '../formats/size.js';\nimport { deleteRange } from './keyboard.js';\nimport normalizeExternalHTML from './normalizeExternalHTML/index.js';\n\nconst debug = logger('quill:clipboard');\n\ntype Selector = string | Node['TEXT_NODE'] | Node['ELEMENT_NODE'];\ntype Matcher = (node: Node, delta: Delta, scroll: ScrollBlot) => Delta;\n\nconst CLIPBOARD_CONFIG: [Selector, Matcher][] = [\n  [Node.TEXT_NODE, matchText],\n  [Node.TEXT_NODE, matchNewline],\n  ['br', matchBreak],\n  [Node.ELEMENT_NODE, matchNewline],\n  [Node.ELEMENT_NODE, matchBlot],\n  [Node.ELEMENT_NODE, matchAttributor],\n  [Node.ELEMENT_NODE, matchStyles],\n  ['li', matchIndent],\n  ['ol, ul', matchList],\n  ['pre', matchCodeBlock],\n  ['tr', matchTable],\n  ['b', createMatchAlias('bold')],\n  ['i', createMatchAlias('italic')],\n  ['strike', createMatchAlias('strike')],\n  ['style', matchIgnore],\n];\n\nconst ATTRIBUTE_ATTRIBUTORS = [AlignAttribute, DirectionAttribute].reduce(\n  (memo: Record<string, Attributor>, attr) => {\n    memo[attr.keyName] = attr;\n    return memo;\n  },\n  {},\n);\n\nconst STYLE_ATTRIBUTORS = [\n  AlignStyle,\n  BackgroundStyle,\n  ColorStyle,\n  DirectionStyle,\n  FontStyle,\n  SizeStyle,\n].reduce((memo: Record<string, Attributor>, attr) => {\n  memo[attr.keyName] = attr;\n  return memo;\n}, {});\n\ninterface ClipboardOptions {\n  matchers: [Selector, Matcher][];\n}\n\nclass Clipboard extends Module<ClipboardOptions> {\n  static DEFAULTS: ClipboardOptions;\n\n  matchers: [Selector, Matcher][];\n\n  constructor(quill: Quill, options: Partial<ClipboardOptions>) {\n    super(quill, options);\n    this.quill.root.addEventListener('copy', (e) =>\n      this.onCaptureCopy(e, false),\n    );\n    this.quill.root.addEventListener('cut', (e) => this.onCaptureCopy(e, true));\n    this.quill.root.addEventListener('paste', this.onCapturePaste.bind(this));\n    this.matchers = [];\n    // @ts-expect-error Fix me later\n    CLIPBOARD_CONFIG.concat(this.options.matchers).forEach(\n      ([selector, matcher]) => {\n        this.addMatcher(selector, matcher);\n      },\n    );\n  }\n\n  addMatcher(selector: Selector, matcher: Matcher) {\n    this.matchers.push([selector, matcher]);\n  }\n\n  convert(\n    { html, text }: { html?: string; text?: string },\n    formats: Record<string, unknown> = {},\n  ) {\n    if (formats[CodeBlock.blotName]) {\n      return new Delta().insert(text || '', {\n        [CodeBlock.blotName]: formats[CodeBlock.blotName],\n      });\n    }\n    if (!html) {\n      return new Delta().insert(text || '', formats);\n    }\n    const delta = this.convertHTML(html);\n    // Remove trailing newline\n    if (\n      deltaEndsWith(delta, '\\n') &&\n      (delta.ops[delta.ops.length - 1].attributes == null || formats.table)\n    ) {\n      return delta.compose(new Delta().retain(delta.length() - 1).delete(1));\n    }\n    return delta;\n  }\n\n  protected normalizeHTML(doc: Document) {\n    normalizeExternalHTML(doc);\n  }\n\n  protected convertHTML(html: string) {\n    const doc = new DOMParser().parseFromString(html, 'text/html');\n    this.normalizeHTML(doc);\n    const container = doc.body;\n    const nodeMatches = new WeakMap();\n    const [elementMatchers, textMatchers] = this.prepareMatching(\n      container,\n      nodeMatches,\n    );\n    return traverse(\n      this.quill.scroll,\n      container,\n      elementMatchers,\n      textMatchers,\n      nodeMatches,\n    );\n  }\n\n  dangerouslyPasteHTML(html: string, source?: EmitterSource): void;\n  dangerouslyPasteHTML(\n    index: number,\n    html: string,\n    source?: EmitterSource,\n  ): void;\n  dangerouslyPasteHTML(\n    index: number | string,\n    html?: string,\n    source: EmitterSource = Quill.sources.API,\n  ) {\n    if (typeof index === 'string') {\n      const delta = this.convert({ html: index, text: '' });\n      // @ts-expect-error\n      this.quill.setContents(delta, html);\n      this.quill.setSelection(0, Quill.sources.SILENT);\n    } else {\n      const paste = this.convert({ html, text: '' });\n      this.quill.updateContents(\n        new Delta().retain(index).concat(paste),\n        source,\n      );\n      this.quill.setSelection(index + paste.length(), Quill.sources.SILENT);\n    }\n  }\n\n  onCaptureCopy(e: ClipboardEvent, isCut = false) {\n    if (e.defaultPrevented) return;\n    e.preventDefault();\n    const [range] = this.quill.selection.getRange();\n    if (range == null) return;\n    const { html, text } = this.onCopy(range, isCut);\n    e.clipboardData?.setData('text/plain', text);\n    e.clipboardData?.setData('text/html', html);\n    if (isCut) {\n      deleteRange({ range, quill: this.quill });\n    }\n  }\n\n  onCapturePaste(e: ClipboardEvent) {\n    if (e.defaultPrevented || !this.quill.isEnabled()) return;\n    e.preventDefault();\n    const range = this.quill.getSelection(true);\n    if (range == null) return;\n    const html = e.clipboardData?.getData('text/html');\n    const text = e.clipboardData?.getData('text/plain');\n    const files = Array.from(e.clipboardData?.files || []);\n    if (!html && files.length > 0) {\n      this.quill.uploader.upload(range, files);\n      return;\n    }\n    if (html && files.length > 0) {\n      const doc = new DOMParser().parseFromString(html, 'text/html');\n      if (\n        doc.body.childElementCount === 1 &&\n        doc.body.firstElementChild?.tagName === 'IMG'\n      ) {\n        this.quill.uploader.upload(range, files);\n        return;\n      }\n    }\n    this.onPaste(range, { html, text });\n  }\n\n  onCopy(range: Range, isCut: boolean): { html: string; text: string };\n  onCopy(range: Range) {\n    const text = this.quill.getText(range);\n    const html = this.quill.getSemanticHTML(range);\n    return { html, text };\n  }\n\n  onPaste(range: Range, { text, html }: { text?: string; html?: string }) {\n    const formats = this.quill.getFormat(range.index);\n    const pastedDelta = this.convert({ text, html }, formats);\n    debug.log('onPaste', pastedDelta, { text, html });\n    const delta = new Delta()\n      .retain(range.index)\n      .delete(range.length)\n      .concat(pastedDelta);\n    this.quill.updateContents(delta, Quill.sources.USER);\n    // range.length contributes to delta.length()\n    this.quill.setSelection(\n      delta.length() - range.length,\n      Quill.sources.SILENT,\n    );\n    this.quill.scrollSelectionIntoView();\n  }\n\n  prepareMatching(container: Element, nodeMatches: WeakMap<Node, Matcher[]>) {\n    const elementMatchers: Matcher[] = [];\n    const textMatchers: Matcher[] = [];\n    this.matchers.forEach((pair) => {\n      const [selector, matcher] = pair;\n      switch (selector) {\n        case Node.TEXT_NODE:\n          textMatchers.push(matcher);\n          break;\n        case Node.ELEMENT_NODE:\n          elementMatchers.push(matcher);\n          break;\n        default:\n          Array.from(container.querySelectorAll(selector)).forEach((node) => {\n            if (nodeMatches.has(node)) {\n              const matches = nodeMatches.get(node);\n              matches?.push(matcher);\n            } else {\n              nodeMatches.set(node, [matcher]);\n            }\n          });\n          break;\n      }\n    });\n    return [elementMatchers, textMatchers];\n  }\n}\nClipboard.DEFAULTS = {\n  matchers: [],\n};\n\nfunction applyFormat(\n  delta: Delta,\n  format: string,\n  value: unknown,\n  scroll: ScrollBlot,\n): Delta {\n  if (!scroll.query(format)) {\n    return delta;\n  }\n\n  return delta.reduce((newDelta, op) => {\n    if (op.attributes && op.attributes[format]) {\n      return newDelta.push(op);\n    }\n    const formats = value ? { [format]: value } : {};\n    // @ts-expect-error Fix me later\n    return newDelta.insert(op.insert, { ...formats, ...op.attributes });\n  }, new Delta());\n}\n\nfunction deltaEndsWith(delta: Delta, text: string) {\n  let endText = '';\n  for (\n    let i = delta.ops.length - 1;\n    i >= 0 && endText.length < text.length;\n    --i // eslint-disable-line no-plusplus\n  ) {\n    const op = delta.ops[i];\n    if (typeof op.insert !== 'string') break;\n    endText = op.insert + endText;\n  }\n  return endText.slice(-1 * text.length) === text;\n}\n\nfunction isLine(node: Node, scroll: ScrollBlot) {\n  if (!(node instanceof Element)) return false;\n  const match = scroll.query(node);\n  // @ts-expect-error\n  if (match && match.prototype instanceof EmbedBlot) return false;\n\n  return [\n    'address',\n    'article',\n    'blockquote',\n    'canvas',\n    'dd',\n    'div',\n    'dl',\n    'dt',\n    'fieldset',\n    'figcaption',\n    'figure',\n    'footer',\n    'form',\n    'h1',\n    'h2',\n    'h3',\n    'h4',\n    'h5',\n    'h6',\n    'header',\n    'iframe',\n    'li',\n    'main',\n    'nav',\n    'ol',\n    'output',\n    'p',\n    'pre',\n    'section',\n    'table',\n    'td',\n    'tr',\n    'ul',\n    'video',\n  ].includes(node.tagName.toLowerCase());\n}\n\nfunction isBetweenInlineElements(node: HTMLElement, scroll: ScrollBlot) {\n  return (\n    node.previousElementSibling &&\n    node.nextElementSibling &&\n    !isLine(node.previousElementSibling, scroll) &&\n    !isLine(node.nextElementSibling, scroll)\n  );\n}\n\nconst preNodes = new WeakMap();\nfunction isPre(node: Node | null) {\n  if (node == null) return false;\n  if (!preNodes.has(node)) {\n    // @ts-expect-error\n    if (node.tagName === 'PRE') {\n      preNodes.set(node, true);\n    } else {\n      preNodes.set(node, isPre(node.parentNode));\n    }\n  }\n  return preNodes.get(node);\n}\n\nfunction traverse(\n  scroll: ScrollBlot,\n  node: ChildNode,\n  elementMatchers: Matcher[],\n  textMatchers: Matcher[],\n  nodeMatches: WeakMap<Node, Matcher[]>,\n): Delta {\n  // Post-order\n  if (node.nodeType === node.TEXT_NODE) {\n    return textMatchers.reduce((delta: Delta, matcher) => {\n      return matcher(node, delta, scroll);\n    }, new Delta());\n  }\n  if (node.nodeType === node.ELEMENT_NODE) {\n    return Array.from(node.childNodes || []).reduce((delta, childNode) => {\n      let childrenDelta = traverse(\n        scroll,\n        childNode,\n        elementMatchers,\n        textMatchers,\n        nodeMatches,\n      );\n      if (childNode.nodeType === node.ELEMENT_NODE) {\n        childrenDelta = elementMatchers.reduce((reducedDelta, matcher) => {\n          return matcher(childNode as HTMLElement, reducedDelta, scroll);\n        }, childrenDelta);\n        childrenDelta = (nodeMatches.get(childNode) || []).reduce(\n          (reducedDelta, matcher) => {\n            return matcher(childNode, reducedDelta, scroll);\n          },\n          childrenDelta,\n        );\n      }\n      return delta.concat(childrenDelta);\n    }, new Delta());\n  }\n  return new Delta();\n}\n\nfunction createMatchAlias(format: string) {\n  return (_node: Element, delta: Delta, scroll: ScrollBlot) => {\n    return applyFormat(delta, format, true, scroll);\n  };\n}\n\nfunction matchAttributor(node: HTMLElement, delta: Delta, scroll: ScrollBlot) {\n  const attributes = Attributor.keys(node);\n  const classes = ClassAttributor.keys(node);\n  const styles = StyleAttributor.keys(node);\n  const formats: Record<string, string | undefined> = {};\n  attributes\n    .concat(classes)\n    .concat(styles)\n    .forEach((name) => {\n      let attr = scroll.query(name, Scope.ATTRIBUTE) as Attributor;\n      if (attr != null) {\n        formats[attr.attrName] = attr.value(node);\n        if (formats[attr.attrName]) return;\n      }\n      attr = ATTRIBUTE_ATTRIBUTORS[name];\n      if (attr != null && (attr.attrName === name || attr.keyName === name)) {\n        formats[attr.attrName] = attr.value(node) || undefined;\n      }\n      attr = STYLE_ATTRIBUTORS[name];\n      if (attr != null && (attr.attrName === name || attr.keyName === name)) {\n        attr = STYLE_ATTRIBUTORS[name];\n        formats[attr.attrName] = attr.value(node) || undefined;\n      }\n    });\n\n  return Object.entries(formats).reduce(\n    (newDelta, [name, value]) => applyFormat(newDelta, name, value, scroll),\n    delta,\n  );\n}\n\nfunction matchBlot(node: Node, delta: Delta, scroll: ScrollBlot) {\n  const match = scroll.query(node);\n  if (match == null) return delta;\n  // @ts-expect-error\n  if (match.prototype instanceof EmbedBlot) {\n    const embed = {};\n    // @ts-expect-error\n    const value = match.value(node);\n    if (value != null) {\n      // @ts-expect-error\n      embed[match.blotName] = value;\n      // @ts-expect-error\n      return new Delta().insert(embed, match.formats(node, scroll));\n    }\n  } else {\n    // @ts-expect-error\n    if (match.prototype instanceof BlockBlot && !deltaEndsWith(delta, '\\n')) {\n      delta.insert('\\n');\n    }\n    if (\n      'blotName' in match &&\n      'formats' in match &&\n      typeof match.formats === 'function'\n    ) {\n      return applyFormat(\n        delta,\n        match.blotName,\n        match.formats(node, scroll),\n        scroll,\n      );\n    }\n  }\n  return delta;\n}\n\nfunction matchBreak(node: Node, delta: Delta) {\n  if (!deltaEndsWith(delta, '\\n')) {\n    delta.insert('\\n');\n  }\n  return delta;\n}\n\nfunction matchCodeBlock(node: Node, delta: Delta, scroll: ScrollBlot) {\n  const match = scroll.query('code-block');\n  const language =\n    match && 'formats' in match && typeof match.formats === 'function'\n      ? match.formats(node, scroll)\n      : true;\n  return applyFormat(delta, 'code-block', language, scroll);\n}\n\nfunction matchIgnore() {\n  return new Delta();\n}\n\nfunction matchIndent(node: Node, delta: Delta, scroll: ScrollBlot) {\n  const match = scroll.query(node);\n  if (\n    match == null ||\n    // @ts-expect-error\n    match.blotName !== 'list' ||\n    !deltaEndsWith(delta, '\\n')\n  ) {\n    return delta;\n  }\n  let indent = -1;\n  let parent = node.parentNode;\n  while (parent != null) {\n    // @ts-expect-error\n    if (['OL', 'UL'].includes(parent.tagName)) {\n      indent += 1;\n    }\n    parent = parent.parentNode;\n  }\n  if (indent <= 0) return delta;\n  return delta.reduce((composed, op) => {\n    if (op.attributes && typeof op.attributes.indent === 'number') {\n      return composed.push(op);\n    }\n    // @ts-expect-error Fix me later\n    return composed.insert(op.insert, { indent, ...(op.attributes || {}) });\n  }, new Delta());\n}\n\nfunction matchList(node: Node, delta: Delta, scroll: ScrollBlot) {\n  // @ts-expect-error\n  const list = node.tagName === 'OL' ? 'ordered' : 'bullet';\n  return applyFormat(delta, 'list', list, scroll);\n}\n\nfunction matchNewline(node: Node, delta: Delta, scroll: ScrollBlot) {\n  if (!deltaEndsWith(delta, '\\n')) {\n    if (\n      isLine(node, scroll) &&\n      (node.childNodes.length > 0 || node instanceof HTMLParagraphElement)\n    ) {\n      return delta.insert('\\n');\n    }\n    if (delta.length() > 0 && node.nextSibling) {\n      let nextSibling: Node | null = node.nextSibling;\n      while (nextSibling != null) {\n        if (isLine(nextSibling, scroll)) {\n          return delta.insert('\\n');\n        }\n        const match = scroll.query(nextSibling);\n        // @ts-expect-error\n        if (match && match.prototype instanceof BlockEmbed) {\n          return delta.insert('\\n');\n        }\n        nextSibling = nextSibling.firstChild;\n      }\n    }\n  }\n  return delta;\n}\n\nfunction matchStyles(node: HTMLElement, delta: Delta, scroll: ScrollBlot) {\n  const formats: Record<string, unknown> = {};\n  const style: Partial<CSSStyleDeclaration> = node.style || {};\n  if (style.fontStyle === 'italic') {\n    formats.italic = true;\n  }\n  if (style.textDecoration === 'underline') {\n    formats.underline = true;\n  }\n  if (style.textDecoration === 'line-through') {\n    formats.strike = true;\n  }\n  if (\n    style.fontWeight?.startsWith('bold') ||\n    // @ts-expect-error Fix me later\n    parseInt(style.fontWeight, 10) >= 700\n  ) {\n    formats.bold = true;\n  }\n  delta = Object.entries(formats).reduce(\n    (newDelta, [name, value]) => applyFormat(newDelta, name, value, scroll),\n    delta,\n  );\n  // @ts-expect-error\n  if (parseFloat(style.textIndent || 0) > 0) {\n    // Could be 0.5in\n    return new Delta().insert('\\t').concat(delta);\n  }\n  return delta;\n}\n\nfunction matchTable(\n  node: HTMLTableRowElement,\n  delta: Delta,\n  scroll: ScrollBlot,\n) {\n  const table =\n    node.parentElement?.tagName === 'TABLE'\n      ? node.parentElement\n      : node.parentElement?.parentElement;\n  if (table != null) {\n    const rows = Array.from(table.querySelectorAll('tr'));\n    const row = rows.indexOf(node) + 1;\n    return applyFormat(delta, 'table', row, scroll);\n  }\n  return delta;\n}\n\nfunction matchText(node: HTMLElement, delta: Delta, scroll: ScrollBlot) {\n  // @ts-expect-error\n  let text = node.data;\n  // Word represents empty line with <o:p>&nbsp;</o:p>\n  if (node.parentElement?.tagName === 'O:P') {\n    return delta.insert(text.trim());\n  }\n  if (!isPre(node)) {\n    if (\n      text.trim().length === 0 &&\n      text.includes('\\n') &&\n      !isBetweenInlineElements(node, scroll)\n    ) {\n      return delta;\n    }\n    const replacer = (collapse: unknown, match: string) => {\n      const replaced = match.replace(/[^\\u00a0]/g, ''); // \\u00a0 is nbsp;\n      return replaced.length < 1 && collapse ? ' ' : replaced;\n    };\n    text = text.replace(/\\r\\n/g, ' ').replace(/\\n/g, ' ');\n    text = text.replace(/\\s\\s+/g, replacer.bind(replacer, true)); // collapse whitespace\n    if (\n      (node.previousSibling == null &&\n        node.parentElement != null &&\n        isLine(node.parentElement, scroll)) ||\n      (node.previousSibling instanceof Element &&\n        isLine(node.previousSibling, scroll))\n    ) {\n      text = text.replace(/^\\s+/, replacer.bind(replacer, false));\n    }\n    if (\n      (node.nextSibling == null &&\n        node.parentElement != null &&\n        isLine(node.parentElement, scroll)) ||\n      (node.nextSibling instanceof Element && isLine(node.nextSibling, scroll))\n    ) {\n      text = text.replace(/\\s+$/, replacer.bind(replacer, false));\n    }\n  }\n  return delta.insert(text);\n}\n\nexport {\n  Clipboard as default,\n  matchAttributor,\n  matchBlot,\n  matchNewline,\n  matchText,\n  traverse,\n};\n","import { cloneDeep, isEqual } from 'lodash-es';\nimport Delta, { AttributeMap } from 'quill-delta';\nimport { EmbedBlot, Scope, TextBlot } from 'parchment';\nimport type { Blot, BlockBlot } from 'parchment';\nimport Quill from '../core/quill.js';\nimport logger from '../core/logger.js';\nimport Module from '../core/module.js';\nimport type { BlockEmbed } from '../blots/block.js';\nimport type { Range } from '../core/selection.js';\n\nconst debug = logger('quill:keyboard');\n\nconst SHORTKEY = /Mac/i.test(navigator.platform) ? 'metaKey' : 'ctrlKey';\n\nexport interface Context {\n  collapsed: boolean;\n  empty: boolean;\n  offset: number;\n  prefix: string;\n  suffix: string;\n  format: Record<string, unknown>;\n  event: KeyboardEvent;\n  line: BlockEmbed | BlockBlot;\n}\n\ninterface BindingObject\n  extends Partial<Omit<Context, 'prefix' | 'suffix' | 'format'>> {\n  key: number | string | string[];\n  shortKey?: boolean | null;\n  shiftKey?: boolean | null;\n  altKey?: boolean | null;\n  metaKey?: boolean | null;\n  ctrlKey?: boolean | null;\n  prefix?: RegExp;\n  suffix?: RegExp;\n  format?: Record<string, unknown> | string[];\n  handler?: (\n    this: { quill: Quill },\n    range: Range,\n    curContext: Context,\n    // eslint-disable-next-line no-use-before-define\n    binding: NormalizedBinding,\n  ) => boolean | void;\n}\n\ntype Binding = BindingObject | string | number;\n\ninterface NormalizedBinding extends Omit<BindingObject, 'key' | 'shortKey'> {\n  key: string | number;\n}\n\ninterface KeyboardOptions {\n  bindings: Record<string, Binding>;\n}\n\ninterface KeyboardOptions {\n  bindings: Record<string, Binding>;\n}\n\nclass Keyboard extends Module<KeyboardOptions> {\n  static DEFAULTS: KeyboardOptions;\n\n  static match(evt: KeyboardEvent, binding: BindingObject) {\n    if (\n      (['altKey', 'ctrlKey', 'metaKey', 'shiftKey'] as const).some((key) => {\n        return !!binding[key] !== evt[key] && binding[key] !== null;\n      })\n    ) {\n      return false;\n    }\n    return binding.key === evt.key || binding.key === evt.which;\n  }\n\n  bindings: Record<string, NormalizedBinding[]>;\n\n  constructor(quill: Quill, options: Partial<KeyboardOptions>) {\n    super(quill, options);\n    this.bindings = {};\n    // @ts-expect-error Fix me later\n    Object.keys(this.options.bindings).forEach((name) => {\n      // @ts-expect-error Fix me later\n      if (this.options.bindings[name]) {\n        // @ts-expect-error Fix me later\n        this.addBinding(this.options.bindings[name]);\n      }\n    });\n    this.addBinding({ key: 'Enter', shiftKey: null }, this.handleEnter);\n    this.addBinding(\n      { key: 'Enter', metaKey: null, ctrlKey: null, altKey: null },\n      () => {},\n    );\n    if (/Firefox/i.test(navigator.userAgent)) {\n      // Need to handle delete and backspace for Firefox in the general case #1171\n      this.addBinding(\n        { key: 'Backspace' },\n        { collapsed: true },\n        this.handleBackspace,\n      );\n      this.addBinding(\n        { key: 'Delete' },\n        { collapsed: true },\n        this.handleDelete,\n      );\n    } else {\n      this.addBinding(\n        { key: 'Backspace' },\n        { collapsed: true, prefix: /^.?$/ },\n        this.handleBackspace,\n      );\n      this.addBinding(\n        { key: 'Delete' },\n        { collapsed: true, suffix: /^.?$/ },\n        this.handleDelete,\n      );\n    }\n    this.addBinding(\n      { key: 'Backspace' },\n      { collapsed: false },\n      this.handleDeleteRange,\n    );\n    this.addBinding(\n      { key: 'Delete' },\n      { collapsed: false },\n      this.handleDeleteRange,\n    );\n    this.addBinding(\n      {\n        key: 'Backspace',\n        altKey: null,\n        ctrlKey: null,\n        metaKey: null,\n        shiftKey: null,\n      },\n      { collapsed: true, offset: 0 },\n      this.handleBackspace,\n    );\n    this.listen();\n  }\n\n  addBinding(\n    keyBinding: Binding,\n    context:\n      | Required<BindingObject['handler']>\n      | Partial<Omit<BindingObject, 'key' | 'handler'>> = {},\n    handler:\n      | Required<BindingObject['handler']>\n      | Partial<Omit<BindingObject, 'key' | 'handler'>> = {},\n  ) {\n    const binding = normalize(keyBinding);\n    if (binding == null) {\n      debug.warn('Attempted to add invalid keyboard binding', binding);\n      return;\n    }\n    if (typeof context === 'function') {\n      context = { handler: context };\n    }\n    if (typeof handler === 'function') {\n      handler = { handler };\n    }\n    const keys = Array.isArray(binding.key) ? binding.key : [binding.key];\n    keys.forEach((key) => {\n      const singleBinding = {\n        ...binding,\n        key,\n        ...context,\n        ...handler,\n      };\n      this.bindings[singleBinding.key] = this.bindings[singleBinding.key] || [];\n      this.bindings[singleBinding.key].push(singleBinding);\n    });\n  }\n\n  listen() {\n    this.quill.root.addEventListener('keydown', (evt) => {\n      if (evt.defaultPrevented || evt.isComposing) return;\n      const bindings = (this.bindings[evt.key] || []).concat(\n        this.bindings[evt.which] || [],\n      );\n      const matches = bindings.filter((binding) =>\n        Keyboard.match(evt, binding),\n      );\n      if (matches.length === 0) return;\n      // @ts-expect-error\n      const blot = Quill.find(evt.target, true);\n      if (blot && blot.scroll !== this.quill.scroll) return;\n      const range = this.quill.getSelection();\n      if (range == null || !this.quill.hasFocus()) return;\n      const [line, offset] = this.quill.getLine(range.index);\n      const [leafStart, offsetStart] = this.quill.getLeaf(range.index);\n      const [leafEnd, offsetEnd] =\n        range.length === 0\n          ? [leafStart, offsetStart]\n          : this.quill.getLeaf(range.index + range.length);\n      const prefixText =\n        leafStart instanceof TextBlot\n          ? leafStart.value().slice(0, offsetStart)\n          : '';\n      const suffixText =\n        leafEnd instanceof TextBlot ? leafEnd.value().slice(offsetEnd) : '';\n      const curContext = {\n        collapsed: range.length === 0,\n        // @ts-expect-error Fix me later\n        empty: range.length === 0 && line.length() <= 1,\n        format: this.quill.getFormat(range),\n        line,\n        offset,\n        prefix: prefixText,\n        suffix: suffixText,\n        event: evt,\n      };\n      const prevented = matches.some((binding) => {\n        if (\n          binding.collapsed != null &&\n          binding.collapsed !== curContext.collapsed\n        ) {\n          return false;\n        }\n        if (binding.empty != null && binding.empty !== curContext.empty) {\n          return false;\n        }\n        if (binding.offset != null && binding.offset !== curContext.offset) {\n          return false;\n        }\n        if (Array.isArray(binding.format)) {\n          // any format is present\n          if (binding.format.every((name) => curContext.format[name] == null)) {\n            return false;\n          }\n        } else if (typeof binding.format === 'object') {\n          // all formats must match\n          if (\n            !Object.keys(binding.format).every((name) => {\n              // @ts-expect-error Fix me later\n              if (binding.format[name] === true)\n                return curContext.format[name] != null;\n              // @ts-expect-error Fix me later\n              if (binding.format[name] === false)\n                return curContext.format[name] == null;\n              // @ts-expect-error Fix me later\n              return isEqual(binding.format[name], curContext.format[name]);\n            })\n          ) {\n            return false;\n          }\n        }\n        if (binding.prefix != null && !binding.prefix.test(curContext.prefix)) {\n          return false;\n        }\n        if (binding.suffix != null && !binding.suffix.test(curContext.suffix)) {\n          return false;\n        }\n        // @ts-expect-error Fix me later\n        return binding.handler.call(this, range, curContext, binding) !== true;\n      });\n      if (prevented) {\n        evt.preventDefault();\n      }\n    });\n  }\n\n  handleBackspace(range: Range, context: Context) {\n    // Check for astral symbols\n    const length = /[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]$/.test(context.prefix)\n      ? 2\n      : 1;\n    if (range.index === 0 || this.quill.getLength() <= 1) return;\n    let formats = {};\n    const [line] = this.quill.getLine(range.index);\n    let delta = new Delta().retain(range.index - length).delete(length);\n    if (context.offset === 0) {\n      // Always deleting newline here, length always 1\n      const [prev] = this.quill.getLine(range.index - 1);\n      if (prev) {\n        const isPrevLineEmpty =\n          prev.statics.blotName === 'block' && prev.length() <= 1;\n        if (!isPrevLineEmpty) {\n          // @ts-expect-error Fix me later\n          const curFormats = line.formats();\n          const prevFormats = this.quill.getFormat(range.index - 1, 1);\n          formats = AttributeMap.diff(curFormats, prevFormats) || {};\n          if (Object.keys(formats).length > 0) {\n            // line.length() - 1 targets \\n in line, another -1 for newline being deleted\n            const formatDelta = new Delta()\n              // @ts-expect-error Fix me later\n              .retain(range.index + line.length() - 2)\n              .retain(1, formats);\n            delta = delta.compose(formatDelta);\n          }\n        }\n      }\n    }\n    this.quill.updateContents(delta, Quill.sources.USER);\n    this.quill.focus();\n  }\n\n  handleDelete(range: Range, context: Context) {\n    // Check for astral symbols\n    const length = /^[\\uD800-\\uDBFF][\\uDC00-\\uDFFF]/.test(context.suffix)\n      ? 2\n      : 1;\n    if (range.index >= this.quill.getLength() - length) return;\n    let formats = {};\n    const [line] = this.quill.getLine(range.index);\n    let delta = new Delta().retain(range.index).delete(length);\n    // @ts-expect-error Fix me later\n    if (context.offset >= line.length() - 1) {\n      const [next] = this.quill.getLine(range.index + 1);\n      if (next) {\n        // @ts-expect-error Fix me later\n        const curFormats = line.formats();\n        const nextFormats = this.quill.getFormat(range.index, 1);\n        formats = AttributeMap.diff(curFormats, nextFormats) || {};\n        if (Object.keys(formats).length > 0) {\n          delta = delta.retain(next.length() - 1).retain(1, formats);\n        }\n      }\n    }\n    this.quill.updateContents(delta, Quill.sources.USER);\n    this.quill.focus();\n  }\n\n  handleDeleteRange(range: Range) {\n    deleteRange({ range, quill: this.quill });\n    this.quill.focus();\n  }\n\n  handleEnter(range: Range, context: Context) {\n    const lineFormats = Object.keys(context.format).reduce(\n      (formats: Record<string, unknown>, format) => {\n        if (\n          this.quill.scroll.query(format, Scope.BLOCK) &&\n          !Array.isArray(context.format[format])\n        ) {\n          formats[format] = context.format[format];\n        }\n        return formats;\n      },\n      {},\n    );\n    const delta = new Delta()\n      .retain(range.index)\n      .delete(range.length)\n      .insert('\\n', lineFormats);\n    this.quill.updateContents(delta, Quill.sources.USER);\n    this.quill.setSelection(range.index + 1, Quill.sources.SILENT);\n    this.quill.focus();\n  }\n}\n\nconst defaultOptions: KeyboardOptions = {\n  bindings: {\n    bold: makeFormatHandler('bold'),\n    italic: makeFormatHandler('italic'),\n    underline: makeFormatHandler('underline'),\n    indent: {\n      // highlight tab or tab at beginning of list, indent or blockquote\n      key: 'Tab',\n      format: ['blockquote', 'indent', 'list'],\n      handler(range, context) {\n        if (context.collapsed && context.offset !== 0) return true;\n        this.quill.format('indent', '+1', Quill.sources.USER);\n        return false;\n      },\n    },\n    outdent: {\n      key: 'Tab',\n      shiftKey: true,\n      format: ['blockquote', 'indent', 'list'],\n      // highlight tab or tab at beginning of list, indent or blockquote\n      handler(range, context) {\n        if (context.collapsed && context.offset !== 0) return true;\n        this.quill.format('indent', '-1', Quill.sources.USER);\n        return false;\n      },\n    },\n    'outdent backspace': {\n      key: 'Backspace',\n      collapsed: true,\n      shiftKey: null,\n      metaKey: null,\n      ctrlKey: null,\n      altKey: null,\n      format: ['indent', 'list'],\n      offset: 0,\n      handler(range, context) {\n        if (context.format.indent != null) {\n          this.quill.format('indent', '-1', Quill.sources.USER);\n        } else if (context.format.list != null) {\n          this.quill.format('list', false, Quill.sources.USER);\n        }\n      },\n    },\n    'indent code-block': makeCodeBlockHandler(true),\n    'outdent code-block': makeCodeBlockHandler(false),\n    'remove tab': {\n      key: 'Tab',\n      shiftKey: true,\n      collapsed: true,\n      prefix: /\\t$/,\n      handler(range) {\n        this.quill.deleteText(range.index - 1, 1, Quill.sources.USER);\n      },\n    },\n    tab: {\n      key: 'Tab',\n      handler(range, context) {\n        if (context.format.table) return true;\n        this.quill.history.cutoff();\n        const delta = new Delta()\n          .retain(range.index)\n          .delete(range.length)\n          .insert('\\t');\n        this.quill.updateContents(delta, Quill.sources.USER);\n        this.quill.history.cutoff();\n        this.quill.setSelection(range.index + 1, Quill.sources.SILENT);\n        return false;\n      },\n    },\n    'blockquote empty enter': {\n      key: 'Enter',\n      collapsed: true,\n      format: ['blockquote'],\n      empty: true,\n      handler() {\n        this.quill.format('blockquote', false, Quill.sources.USER);\n      },\n    },\n    'list empty enter': {\n      key: 'Enter',\n      collapsed: true,\n      format: ['list'],\n      empty: true,\n      handler(range, context) {\n        const formats: Record<string, unknown> = { list: false };\n        if (context.format.indent) {\n          formats.indent = false;\n        }\n        this.quill.formatLine(\n          range.index,\n          range.length,\n          formats,\n          Quill.sources.USER,\n        );\n      },\n    },\n    'checklist enter': {\n      key: 'Enter',\n      collapsed: true,\n      format: { list: 'checked' },\n      handler(range) {\n        const [line, offset] = this.quill.getLine(range.index);\n        const formats = {\n          // @ts-expect-error Fix me later\n          ...line.formats(),\n          list: 'checked',\n        };\n        const delta = new Delta()\n          .retain(range.index)\n          .insert('\\n', formats)\n          // @ts-expect-error Fix me later\n          .retain(line.length() - offset - 1)\n          .retain(1, { list: 'unchecked' });\n        this.quill.updateContents(delta, Quill.sources.USER);\n        this.quill.setSelection(range.index + 1, Quill.sources.SILENT);\n        this.quill.scrollSelectionIntoView();\n      },\n    },\n    'header enter': {\n      key: 'Enter',\n      collapsed: true,\n      format: ['header'],\n      suffix: /^$/,\n      handler(range, context) {\n        const [line, offset] = this.quill.getLine(range.index);\n        const delta = new Delta()\n          .retain(range.index)\n          .insert('\\n', context.format)\n          // @ts-expect-error Fix me later\n          .retain(line.length() - offset - 1)\n          .retain(1, { header: null });\n        this.quill.updateContents(delta, Quill.sources.USER);\n        this.quill.setSelection(range.index + 1, Quill.sources.SILENT);\n        this.quill.scrollSelectionIntoView();\n      },\n    },\n    'table backspace': {\n      key: 'Backspace',\n      format: ['table'],\n      collapsed: true,\n      offset: 0,\n      handler() {},\n    },\n    'table delete': {\n      key: 'Delete',\n      format: ['table'],\n      collapsed: true,\n      suffix: /^$/,\n      handler() {},\n    },\n    'table enter': {\n      key: 'Enter',\n      shiftKey: null,\n      format: ['table'],\n      handler(range) {\n        const module = this.quill.getModule('table');\n        if (module) {\n          // @ts-expect-error\n          const [table, row, cell, offset] = module.getTable(range);\n          const shift = tableSide(table, row, cell, offset);\n          if (shift == null) return;\n          let index = table.offset();\n          if (shift < 0) {\n            const delta = new Delta().retain(index).insert('\\n');\n            this.quill.updateContents(delta, Quill.sources.USER);\n            this.quill.setSelection(\n              range.index + 1,\n              range.length,\n              Quill.sources.SILENT,\n            );\n          } else if (shift > 0) {\n            index += table.length();\n            const delta = new Delta().retain(index).insert('\\n');\n            this.quill.updateContents(delta, Quill.sources.USER);\n            this.quill.setSelection(index, Quill.sources.USER);\n          }\n        }\n      },\n    },\n    'table tab': {\n      key: 'Tab',\n      shiftKey: null,\n      format: ['table'],\n      handler(range, context) {\n        const { event, line: cell } = context;\n        const offset = cell.offset(this.quill.scroll);\n        if (event.shiftKey) {\n          this.quill.setSelection(offset - 1, Quill.sources.USER);\n        } else {\n          this.quill.setSelection(offset + cell.length(), Quill.sources.USER);\n        }\n      },\n    },\n    'list autofill': {\n      key: ' ',\n      shiftKey: null,\n      collapsed: true,\n      format: {\n        'code-block': false,\n        blockquote: false,\n        table: false,\n      },\n      prefix: /^\\s*?(\\d+\\.|-|\\*|\\[ ?\\]|\\[x\\])$/,\n      handler(range, context) {\n        if (this.quill.scroll.query('list') == null) return true;\n        const { length } = context.prefix;\n        const [line, offset] = this.quill.getLine(range.index);\n        if (offset > length) return true;\n        let value;\n        switch (context.prefix.trim()) {\n          case '[]':\n          case '[ ]':\n            value = 'unchecked';\n            break;\n          case '[x]':\n            value = 'checked';\n            break;\n          case '-':\n          case '*':\n            value = 'bullet';\n            break;\n          default:\n            value = 'ordered';\n        }\n        this.quill.insertText(range.index, ' ', Quill.sources.USER);\n        this.quill.history.cutoff();\n        const delta = new Delta()\n          .retain(range.index - offset)\n          .delete(length + 1)\n          // @ts-expect-error Fix me later\n          .retain(line.length() - 2 - offset)\n          .retain(1, { list: value });\n        this.quill.updateContents(delta, Quill.sources.USER);\n        this.quill.history.cutoff();\n        this.quill.setSelection(range.index - length, Quill.sources.SILENT);\n        return false;\n      },\n    },\n    'code exit': {\n      key: 'Enter',\n      collapsed: true,\n      format: ['code-block'],\n      prefix: /^$/,\n      suffix: /^\\s*$/,\n      handler(range) {\n        const [line, offset] = this.quill.getLine(range.index);\n        let numLines = 2;\n        let cur = line;\n        while (\n          cur != null &&\n          cur.length() <= 1 &&\n          cur.formats()['code-block']\n        ) {\n          // @ts-expect-error\n          cur = cur.prev;\n          numLines -= 1;\n          // Requisite prev lines are empty\n          if (numLines <= 0) {\n            const delta = new Delta()\n              // @ts-expect-error Fix me later\n              .retain(range.index + line.length() - offset - 2)\n              .retain(1, { 'code-block': null })\n              .delete(1);\n            this.quill.updateContents(delta, Quill.sources.USER);\n            this.quill.setSelection(range.index - 1, Quill.sources.SILENT);\n            return false;\n          }\n        }\n        return true;\n      },\n    },\n    'embed left': makeEmbedArrowHandler('ArrowLeft', false),\n    'embed left shift': makeEmbedArrowHandler('ArrowLeft', true),\n    'embed right': makeEmbedArrowHandler('ArrowRight', false),\n    'embed right shift': makeEmbedArrowHandler('ArrowRight', true),\n    'table down': makeTableArrowHandler(false),\n    'table up': makeTableArrowHandler(true),\n  },\n};\n\nKeyboard.DEFAULTS = defaultOptions;\n\nfunction makeCodeBlockHandler(indent: boolean): BindingObject {\n  return {\n    key: 'Tab',\n    shiftKey: !indent,\n    format: { 'code-block': true },\n    handler(range, { event }) {\n      const CodeBlock = this.quill.scroll.query('code-block');\n      // @ts-expect-error\n      const { TAB } = CodeBlock;\n      if (range.length === 0 && !event.shiftKey) {\n        this.quill.insertText(range.index, TAB, Quill.sources.USER);\n        this.quill.setSelection(range.index + TAB.length, Quill.sources.SILENT);\n        return;\n      }\n\n      const lines =\n        range.length === 0\n          ? this.quill.getLines(range.index, 1)\n          : this.quill.getLines(range);\n      let { index, length } = range;\n      lines.forEach((line, i) => {\n        if (indent) {\n          line.insertAt(0, TAB);\n          if (i === 0) {\n            index += TAB.length;\n          } else {\n            length += TAB.length;\n          }\n          // @ts-expect-error Fix me later\n        } else if (line.domNode.textContent.startsWith(TAB)) {\n          line.deleteAt(0, TAB.length);\n          if (i === 0) {\n            index -= TAB.length;\n          } else {\n            length -= TAB.length;\n          }\n        }\n      });\n      this.quill.update(Quill.sources.USER);\n      this.quill.setSelection(index, length, Quill.sources.SILENT);\n    },\n  };\n}\n\nfunction makeEmbedArrowHandler(\n  key: string,\n  shiftKey: boolean | null,\n): BindingObject {\n  const where = key === 'ArrowLeft' ? 'prefix' : 'suffix';\n  return {\n    key,\n    shiftKey,\n    altKey: null,\n    [where]: /^$/,\n    handler(range) {\n      let { index } = range;\n      if (key === 'ArrowRight') {\n        index += range.length + 1;\n      }\n      const [leaf] = this.quill.getLeaf(index);\n      if (!(leaf instanceof EmbedBlot)) return true;\n      if (key === 'ArrowLeft') {\n        if (shiftKey) {\n          this.quill.setSelection(\n            range.index - 1,\n            range.length + 1,\n            Quill.sources.USER,\n          );\n        } else {\n          this.quill.setSelection(range.index - 1, Quill.sources.USER);\n        }\n      } else if (shiftKey) {\n        this.quill.setSelection(\n          range.index,\n          range.length + 1,\n          Quill.sources.USER,\n        );\n      } else {\n        this.quill.setSelection(\n          range.index + range.length + 1,\n          Quill.sources.USER,\n        );\n      }\n      return false;\n    },\n  };\n}\n\nfunction makeFormatHandler(format: string): BindingObject {\n  return {\n    key: format[0],\n    shortKey: true,\n    handler(range, context) {\n      this.quill.format(format, !context.format[format], Quill.sources.USER);\n    },\n  };\n}\n\nfunction makeTableArrowHandler(up: boolean): BindingObject {\n  return {\n    key: up ? 'ArrowUp' : 'ArrowDown',\n    collapsed: true,\n    format: ['table'],\n    handler(range, context) {\n      // TODO move to table module\n      const key = up ? 'prev' : 'next';\n      const cell = context.line;\n      const targetRow = cell.parent[key];\n      if (targetRow != null) {\n        if (targetRow.statics.blotName === 'table-row') {\n          // @ts-expect-error\n          let targetCell = targetRow.children.head;\n          let cur = cell;\n          while (cur.prev != null) {\n            // @ts-expect-error\n            cur = cur.prev;\n            targetCell = targetCell.next;\n          }\n          const index =\n            targetCell.offset(this.quill.scroll) +\n            Math.min(context.offset, targetCell.length() - 1);\n          this.quill.setSelection(index, 0, Quill.sources.USER);\n        }\n      } else {\n        // @ts-expect-error\n        const targetLine = cell.table()[key];\n        if (targetLine != null) {\n          if (up) {\n            this.quill.setSelection(\n              targetLine.offset(this.quill.scroll) + targetLine.length() - 1,\n              0,\n              Quill.sources.USER,\n            );\n          } else {\n            this.quill.setSelection(\n              targetLine.offset(this.quill.scroll),\n              0,\n              Quill.sources.USER,\n            );\n          }\n        }\n      }\n      return false;\n    },\n  };\n}\n\nfunction normalize(binding: Binding): BindingObject | null {\n  if (typeof binding === 'string' || typeof binding === 'number') {\n    binding = { key: binding };\n  } else if (typeof binding === 'object') {\n    binding = cloneDeep(binding);\n  } else {\n    return null;\n  }\n  if (binding.shortKey) {\n    binding[SHORTKEY] = binding.shortKey;\n    delete binding.shortKey;\n  }\n  return binding;\n}\n\n// TODO: Move into quill.ts or editor.ts\nfunction deleteRange({ quill, range }: { quill: Quill; range: Range }) {\n  const lines = quill.getLines(range);\n  let formats = {};\n  if (lines.length > 1) {\n    const firstFormats = lines[0].formats();\n    const lastFormats = lines[lines.length - 1].formats();\n    formats = AttributeMap.diff(lastFormats, firstFormats) || {};\n  }\n  quill.deleteText(range, Quill.sources.USER);\n  if (Object.keys(formats).length > 0) {\n    quill.formatLine(range.index, 1, formats, Quill.sources.USER);\n  }\n  quill.setSelection(range.index, Quill.sources.SILENT);\n}\n\nfunction tableSide(_table: unknown, row: Blot, cell: Blot, offset: number) {\n  if (row.prev == null && row.next == null) {\n    if (cell.prev == null && cell.next == null) {\n      return offset === 0 ? -1 : 1;\n    }\n    return cell.prev == null ? -1 : 1;\n  }\n  if (row.prev == null) {\n    return -1;\n  }\n  if (row.next == null) {\n    return 1;\n  }\n  return null;\n}\n\nexport { Keyboard as default, SHORTKEY, normalize, deleteRange };\n","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n  module.exports = EventEmitter;\n}\n","/**\n * This library modifies the diff-patch-match library by Neil Fraser\n * by removing the patch and match functionality and certain advanced\n * options in the diff function. The original license is as follows:\n *\n * ===\n *\n * Diff Match and Patch\n *\n * Copyright 2006 Google Inc.\n * http://code.google.com/p/google-diff-match-patch/\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 * The data structure representing a diff is an array of tuples:\n * [[DIFF_DELETE, 'Hello'], [DIFF_INSERT, 'Goodbye'], [DIFF_EQUAL, ' world.']]\n * which means: delete 'Hello', add 'Goodbye' and keep ' world.'\n */\nvar DIFF_DELETE = -1;\nvar DIFF_INSERT = 1;\nvar DIFF_EQUAL = 0;\n\n/**\n * Find the differences between two texts.  Simplifies the problem by stripping\n * any common prefix or suffix off the texts before diffing.\n * @param {string} text1 Old string to be diffed.\n * @param {string} text2 New string to be diffed.\n * @param {Int|Object} [cursor_pos] Edit position in text1 or object with more info\n * @param {boolean} [cleanup] Apply semantic cleanup before returning.\n * @return {Array} Array of diff tuples.\n */\nfunction diff_main(text1, text2, cursor_pos, cleanup, _fix_unicode) {\n  // Check for equality\n  if (text1 === text2) {\n    if (text1) {\n      return [[DIFF_EQUAL, text1]];\n    }\n    return [];\n  }\n\n  if (cursor_pos != null) {\n    var editdiff = find_cursor_edit_diff(text1, text2, cursor_pos);\n    if (editdiff) {\n      return editdiff;\n    }\n  }\n\n  // Trim off common prefix (speedup).\n  var commonlength = diff_commonPrefix(text1, text2);\n  var commonprefix = text1.substring(0, commonlength);\n  text1 = text1.substring(commonlength);\n  text2 = text2.substring(commonlength);\n\n  // Trim off common suffix (speedup).\n  commonlength = diff_commonSuffix(text1, text2);\n  var commonsuffix = text1.substring(text1.length - commonlength);\n  text1 = text1.substring(0, text1.length - commonlength);\n  text2 = text2.substring(0, text2.length - commonlength);\n\n  // Compute the diff on the middle block.\n  var diffs = diff_compute_(text1, text2);\n\n  // Restore the prefix and suffix.\n  if (commonprefix) {\n    diffs.unshift([DIFF_EQUAL, commonprefix]);\n  }\n  if (commonsuffix) {\n    diffs.push([DIFF_EQUAL, commonsuffix]);\n  }\n  diff_cleanupMerge(diffs, _fix_unicode);\n  if (cleanup) {\n    diff_cleanupSemantic(diffs);\n  }\n  return diffs;\n}\n\n/**\n * Find the differences between two texts.  Assumes that the texts do not\n * have any common prefix or suffix.\n * @param {string} text1 Old string to be diffed.\n * @param {string} text2 New string to be diffed.\n * @return {Array} Array of diff tuples.\n */\nfunction diff_compute_(text1, text2) {\n  var diffs;\n\n  if (!text1) {\n    // Just add some text (speedup).\n    return [[DIFF_INSERT, text2]];\n  }\n\n  if (!text2) {\n    // Just delete some text (speedup).\n    return [[DIFF_DELETE, text1]];\n  }\n\n  var longtext = text1.length > text2.length ? text1 : text2;\n  var shorttext = text1.length > text2.length ? text2 : text1;\n  var i = longtext.indexOf(shorttext);\n  if (i !== -1) {\n    // Shorter text is inside the longer text (speedup).\n    diffs = [\n      [DIFF_INSERT, longtext.substring(0, i)],\n      [DIFF_EQUAL, shorttext],\n      [DIFF_INSERT, longtext.substring(i + shorttext.length)],\n    ];\n    // Swap insertions for deletions if diff is reversed.\n    if (text1.length > text2.length) {\n      diffs[0][0] = diffs[2][0] = DIFF_DELETE;\n    }\n    return diffs;\n  }\n\n  if (shorttext.length === 1) {\n    // Single character string.\n    // After the previous speedup, the character can't be an equality.\n    return [\n      [DIFF_DELETE, text1],\n      [DIFF_INSERT, text2],\n    ];\n  }\n\n  // Check to see if the problem can be split in two.\n  var hm = diff_halfMatch_(text1, text2);\n  if (hm) {\n    // A half-match was found, sort out the return data.\n    var text1_a = hm[0];\n    var text1_b = hm[1];\n    var text2_a = hm[2];\n    var text2_b = hm[3];\n    var mid_common = hm[4];\n    // Send both pairs off for separate processing.\n    var diffs_a = diff_main(text1_a, text2_a);\n    var diffs_b = diff_main(text1_b, text2_b);\n    // Merge the results.\n    return diffs_a.concat([[DIFF_EQUAL, mid_common]], diffs_b);\n  }\n\n  return diff_bisect_(text1, text2);\n}\n\n/**\n * Find the 'middle snake' of a diff, split the problem in two\n * and return the recursively constructed diff.\n * See Myers 1986 paper: An O(ND) Difference Algorithm and Its Variations.\n * @param {string} text1 Old string to be diffed.\n * @param {string} text2 New string to be diffed.\n * @return {Array} Array of diff tuples.\n * @private\n */\nfunction diff_bisect_(text1, text2) {\n  // Cache the text lengths to prevent multiple calls.\n  var text1_length = text1.length;\n  var text2_length = text2.length;\n  var max_d = Math.ceil((text1_length + text2_length) / 2);\n  var v_offset = max_d;\n  var v_length = 2 * max_d;\n  var v1 = new Array(v_length);\n  var v2 = new Array(v_length);\n  // Setting all elements to -1 is faster in Chrome & Firefox than mixing\n  // integers and undefined.\n  for (var x = 0; x < v_length; x++) {\n    v1[x] = -1;\n    v2[x] = -1;\n  }\n  v1[v_offset + 1] = 0;\n  v2[v_offset + 1] = 0;\n  var delta = text1_length - text2_length;\n  // If the total number of characters is odd, then the front path will collide\n  // with the reverse path.\n  var front = delta % 2 !== 0;\n  // Offsets for start and end of k loop.\n  // Prevents mapping of space beyond the grid.\n  var k1start = 0;\n  var k1end = 0;\n  var k2start = 0;\n  var k2end = 0;\n  for (var d = 0; d < max_d; d++) {\n    // Walk the front path one step.\n    for (var k1 = -d + k1start; k1 <= d - k1end; k1 += 2) {\n      var k1_offset = v_offset + k1;\n      var x1;\n      if (k1 === -d || (k1 !== d && v1[k1_offset - 1] < v1[k1_offset + 1])) {\n        x1 = v1[k1_offset + 1];\n      } else {\n        x1 = v1[k1_offset - 1] + 1;\n      }\n      var y1 = x1 - k1;\n      while (\n        x1 < text1_length &&\n        y1 < text2_length &&\n        text1.charAt(x1) === text2.charAt(y1)\n      ) {\n        x1++;\n        y1++;\n      }\n      v1[k1_offset] = x1;\n      if (x1 > text1_length) {\n        // Ran off the right of the graph.\n        k1end += 2;\n      } else if (y1 > text2_length) {\n        // Ran off the bottom of the graph.\n        k1start += 2;\n      } else if (front) {\n        var k2_offset = v_offset + delta - k1;\n        if (k2_offset >= 0 && k2_offset < v_length && v2[k2_offset] !== -1) {\n          // Mirror x2 onto top-left coordinate system.\n          var x2 = text1_length - v2[k2_offset];\n          if (x1 >= x2) {\n            // Overlap detected.\n            return diff_bisectSplit_(text1, text2, x1, y1);\n          }\n        }\n      }\n    }\n\n    // Walk the reverse path one step.\n    for (var k2 = -d + k2start; k2 <= d - k2end; k2 += 2) {\n      var k2_offset = v_offset + k2;\n      var x2;\n      if (k2 === -d || (k2 !== d && v2[k2_offset - 1] < v2[k2_offset + 1])) {\n        x2 = v2[k2_offset + 1];\n      } else {\n        x2 = v2[k2_offset - 1] + 1;\n      }\n      var y2 = x2 - k2;\n      while (\n        x2 < text1_length &&\n        y2 < text2_length &&\n        text1.charAt(text1_length - x2 - 1) ===\n          text2.charAt(text2_length - y2 - 1)\n      ) {\n        x2++;\n        y2++;\n      }\n      v2[k2_offset] = x2;\n      if (x2 > text1_length) {\n        // Ran off the left of the graph.\n        k2end += 2;\n      } else if (y2 > text2_length) {\n        // Ran off the top of the graph.\n        k2start += 2;\n      } else if (!front) {\n        var k1_offset = v_offset + delta - k2;\n        if (k1_offset >= 0 && k1_offset < v_length && v1[k1_offset] !== -1) {\n          var x1 = v1[k1_offset];\n          var y1 = v_offset + x1 - k1_offset;\n          // Mirror x2 onto top-left coordinate system.\n          x2 = text1_length - x2;\n          if (x1 >= x2) {\n            // Overlap detected.\n            return diff_bisectSplit_(text1, text2, x1, y1);\n          }\n        }\n      }\n    }\n  }\n  // Diff took too long and hit the deadline or\n  // number of diffs equals number of characters, no commonality at all.\n  return [\n    [DIFF_DELETE, text1],\n    [DIFF_INSERT, text2],\n  ];\n}\n\n/**\n * Given the location of the 'middle snake', split the diff in two parts\n * and recurse.\n * @param {string} text1 Old string to be diffed.\n * @param {string} text2 New string to be diffed.\n * @param {number} x Index of split point in text1.\n * @param {number} y Index of split point in text2.\n * @return {Array} Array of diff tuples.\n */\nfunction diff_bisectSplit_(text1, text2, x, y) {\n  var text1a = text1.substring(0, x);\n  var text2a = text2.substring(0, y);\n  var text1b = text1.substring(x);\n  var text2b = text2.substring(y);\n\n  // Compute both diffs serially.\n  var diffs = diff_main(text1a, text2a);\n  var diffsb = diff_main(text1b, text2b);\n\n  return diffs.concat(diffsb);\n}\n\n/**\n * Determine the common prefix of two strings.\n * @param {string} text1 First string.\n * @param {string} text2 Second string.\n * @return {number} The number of characters common to the start of each\n *     string.\n */\nfunction diff_commonPrefix(text1, text2) {\n  // Quick check for common null cases.\n  if (!text1 || !text2 || text1.charAt(0) !== text2.charAt(0)) {\n    return 0;\n  }\n  // Binary search.\n  // Performance analysis: http://neil.fraser.name/news/2007/10/09/\n  var pointermin = 0;\n  var pointermax = Math.min(text1.length, text2.length);\n  var pointermid = pointermax;\n  var pointerstart = 0;\n  while (pointermin < pointermid) {\n    if (\n      text1.substring(pointerstart, pointermid) ==\n      text2.substring(pointerstart, pointermid)\n    ) {\n      pointermin = pointermid;\n      pointerstart = pointermin;\n    } else {\n      pointermax = pointermid;\n    }\n    pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n  }\n\n  if (is_surrogate_pair_start(text1.charCodeAt(pointermid - 1))) {\n    pointermid--;\n  }\n\n  return pointermid;\n}\n\n/**\n * Determine if the suffix of one string is the prefix of another.\n * @param {string} text1 First string.\n * @param {string} text2 Second string.\n * @return {number} The number of characters common to the end of the first\n *     string and the start of the second string.\n * @private\n */\nfunction diff_commonOverlap_(text1, text2) {\n  // Cache the text lengths to prevent multiple calls.\n  var text1_length = text1.length;\n  var text2_length = text2.length;\n  // Eliminate the null case.\n  if (text1_length == 0 || text2_length == 0) {\n    return 0;\n  }\n  // Truncate the longer string.\n  if (text1_length > text2_length) {\n    text1 = text1.substring(text1_length - text2_length);\n  } else if (text1_length < text2_length) {\n    text2 = text2.substring(0, text1_length);\n  }\n  var text_length = Math.min(text1_length, text2_length);\n  // Quick check for the worst case.\n  if (text1 == text2) {\n    return text_length;\n  }\n\n  // Start by looking for a single character match\n  // and increase length until no match is found.\n  // Performance analysis: http://neil.fraser.name/news/2010/11/04/\n  var best = 0;\n  var length = 1;\n  while (true) {\n    var pattern = text1.substring(text_length - length);\n    var found = text2.indexOf(pattern);\n    if (found == -1) {\n      return best;\n    }\n    length += found;\n    if (\n      found == 0 ||\n      text1.substring(text_length - length) == text2.substring(0, length)\n    ) {\n      best = length;\n      length++;\n    }\n  }\n}\n\n/**\n * Determine the common suffix of two strings.\n * @param {string} text1 First string.\n * @param {string} text2 Second string.\n * @return {number} The number of characters common to the end of each string.\n */\nfunction diff_commonSuffix(text1, text2) {\n  // Quick check for common null cases.\n  if (!text1 || !text2 || text1.slice(-1) !== text2.slice(-1)) {\n    return 0;\n  }\n  // Binary search.\n  // Performance analysis: http://neil.fraser.name/news/2007/10/09/\n  var pointermin = 0;\n  var pointermax = Math.min(text1.length, text2.length);\n  var pointermid = pointermax;\n  var pointerend = 0;\n  while (pointermin < pointermid) {\n    if (\n      text1.substring(text1.length - pointermid, text1.length - pointerend) ==\n      text2.substring(text2.length - pointermid, text2.length - pointerend)\n    ) {\n      pointermin = pointermid;\n      pointerend = pointermin;\n    } else {\n      pointermax = pointermid;\n    }\n    pointermid = Math.floor((pointermax - pointermin) / 2 + pointermin);\n  }\n\n  if (is_surrogate_pair_end(text1.charCodeAt(text1.length - pointermid))) {\n    pointermid--;\n  }\n\n  return pointermid;\n}\n\n/**\n * Do the two texts share a substring which is at least half the length of the\n * longer text?\n * This speedup can produce non-minimal diffs.\n * @param {string} text1 First string.\n * @param {string} text2 Second string.\n * @return {Array.<string>} Five element Array, containing the prefix of\n *     text1, the suffix of text1, the prefix of text2, the suffix of\n *     text2 and the common middle.  Or null if there was no match.\n */\nfunction diff_halfMatch_(text1, text2) {\n  var longtext = text1.length > text2.length ? text1 : text2;\n  var shorttext = text1.length > text2.length ? text2 : text1;\n  if (longtext.length < 4 || shorttext.length * 2 < longtext.length) {\n    return null; // Pointless.\n  }\n\n  /**\n   * Does a substring of shorttext exist within longtext such that the substring\n   * is at least half the length of longtext?\n   * Closure, but does not reference any external variables.\n   * @param {string} longtext Longer string.\n   * @param {string} shorttext Shorter string.\n   * @param {number} i Start index of quarter length substring within longtext.\n   * @return {Array.<string>} Five element Array, containing the prefix of\n   *     longtext, the suffix of longtext, the prefix of shorttext, the suffix\n   *     of shorttext and the common middle.  Or null if there was no match.\n   * @private\n   */\n  function diff_halfMatchI_(longtext, shorttext, i) {\n    // Start with a 1/4 length substring at position i as a seed.\n    var seed = longtext.substring(i, i + Math.floor(longtext.length / 4));\n    var j = -1;\n    var best_common = \"\";\n    var best_longtext_a, best_longtext_b, best_shorttext_a, best_shorttext_b;\n    while ((j = shorttext.indexOf(seed, j + 1)) !== -1) {\n      var prefixLength = diff_commonPrefix(\n        longtext.substring(i),\n        shorttext.substring(j)\n      );\n      var suffixLength = diff_commonSuffix(\n        longtext.substring(0, i),\n        shorttext.substring(0, j)\n      );\n      if (best_common.length < suffixLength + prefixLength) {\n        best_common =\n          shorttext.substring(j - suffixLength, j) +\n          shorttext.substring(j, j + prefixLength);\n        best_longtext_a = longtext.substring(0, i - suffixLength);\n        best_longtext_b = longtext.substring(i + prefixLength);\n        best_shorttext_a = shorttext.substring(0, j - suffixLength);\n        best_shorttext_b = shorttext.substring(j + prefixLength);\n      }\n    }\n    if (best_common.length * 2 >= longtext.length) {\n      return [\n        best_longtext_a,\n        best_longtext_b,\n        best_shorttext_a,\n        best_shorttext_b,\n        best_common,\n      ];\n    } else {\n      return null;\n    }\n  }\n\n  // First check if the second quarter is the seed for a half-match.\n  var hm1 = diff_halfMatchI_(\n    longtext,\n    shorttext,\n    Math.ceil(longtext.length / 4)\n  );\n  // Check again based on the third quarter.\n  var hm2 = diff_halfMatchI_(\n    longtext,\n    shorttext,\n    Math.ceil(longtext.length / 2)\n  );\n  var hm;\n  if (!hm1 && !hm2) {\n    return null;\n  } else if (!hm2) {\n    hm = hm1;\n  } else if (!hm1) {\n    hm = hm2;\n  } else {\n    // Both matched.  Select the longest.\n    hm = hm1[4].length > hm2[4].length ? hm1 : hm2;\n  }\n\n  // A half-match was found, sort out the return data.\n  var text1_a, text1_b, text2_a, text2_b;\n  if (text1.length > text2.length) {\n    text1_a = hm[0];\n    text1_b = hm[1];\n    text2_a = hm[2];\n    text2_b = hm[3];\n  } else {\n    text2_a = hm[0];\n    text2_b = hm[1];\n    text1_a = hm[2];\n    text1_b = hm[3];\n  }\n  var mid_common = hm[4];\n  return [text1_a, text1_b, text2_a, text2_b, mid_common];\n}\n\n/**\n * Reduce the number of edits by eliminating semantically trivial equalities.\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\n */\nfunction diff_cleanupSemantic(diffs) {\n  var changes = false;\n  var equalities = []; // Stack of indices where equalities are found.\n  var equalitiesLength = 0; // Keeping our own length var is faster in JS.\n  /** @type {?string} */\n  var lastequality = null;\n  // Always equal to diffs[equalities[equalitiesLength - 1]][1]\n  var pointer = 0; // Index of current position.\n  // Number of characters that changed prior to the equality.\n  var length_insertions1 = 0;\n  var length_deletions1 = 0;\n  // Number of characters that changed after the equality.\n  var length_insertions2 = 0;\n  var length_deletions2 = 0;\n  while (pointer < diffs.length) {\n    if (diffs[pointer][0] == DIFF_EQUAL) {\n      // Equality found.\n      equalities[equalitiesLength++] = pointer;\n      length_insertions1 = length_insertions2;\n      length_deletions1 = length_deletions2;\n      length_insertions2 = 0;\n      length_deletions2 = 0;\n      lastequality = diffs[pointer][1];\n    } else {\n      // An insertion or deletion.\n      if (diffs[pointer][0] == DIFF_INSERT) {\n        length_insertions2 += diffs[pointer][1].length;\n      } else {\n        length_deletions2 += diffs[pointer][1].length;\n      }\n      // Eliminate an equality that is smaller or equal to the edits on both\n      // sides of it.\n      if (\n        lastequality &&\n        lastequality.length <=\n          Math.max(length_insertions1, length_deletions1) &&\n        lastequality.length <= Math.max(length_insertions2, length_deletions2)\n      ) {\n        // Duplicate record.\n        diffs.splice(equalities[equalitiesLength - 1], 0, [\n          DIFF_DELETE,\n          lastequality,\n        ]);\n        // Change second copy to insert.\n        diffs[equalities[equalitiesLength - 1] + 1][0] = DIFF_INSERT;\n        // Throw away the equality we just deleted.\n        equalitiesLength--;\n        // Throw away the previous equality (it needs to be reevaluated).\n        equalitiesLength--;\n        pointer = equalitiesLength > 0 ? equalities[equalitiesLength - 1] : -1;\n        length_insertions1 = 0; // Reset the counters.\n        length_deletions1 = 0;\n        length_insertions2 = 0;\n        length_deletions2 = 0;\n        lastequality = null;\n        changes = true;\n      }\n    }\n    pointer++;\n  }\n\n  // Normalize the diff.\n  if (changes) {\n    diff_cleanupMerge(diffs);\n  }\n  diff_cleanupSemanticLossless(diffs);\n\n  // Find any overlaps between deletions and insertions.\n  // e.g: <del>abcxxx</del><ins>xxxdef</ins>\n  //   -> <del>abc</del>xxx<ins>def</ins>\n  // e.g: <del>xxxabc</del><ins>defxxx</ins>\n  //   -> <ins>def</ins>xxx<del>abc</del>\n  // Only extract an overlap if it is as big as the edit ahead or behind it.\n  pointer = 1;\n  while (pointer < diffs.length) {\n    if (\n      diffs[pointer - 1][0] == DIFF_DELETE &&\n      diffs[pointer][0] == DIFF_INSERT\n    ) {\n      var deletion = diffs[pointer - 1][1];\n      var insertion = diffs[pointer][1];\n      var overlap_length1 = diff_commonOverlap_(deletion, insertion);\n      var overlap_length2 = diff_commonOverlap_(insertion, deletion);\n      if (overlap_length1 >= overlap_length2) {\n        if (\n          overlap_length1 >= deletion.length / 2 ||\n          overlap_length1 >= insertion.length / 2\n        ) {\n          // Overlap found.  Insert an equality and trim the surrounding edits.\n          diffs.splice(pointer, 0, [\n            DIFF_EQUAL,\n            insertion.substring(0, overlap_length1),\n          ]);\n          diffs[pointer - 1][1] = deletion.substring(\n            0,\n            deletion.length - overlap_length1\n          );\n          diffs[pointer + 1][1] = insertion.substring(overlap_length1);\n          pointer++;\n        }\n      } else {\n        if (\n          overlap_length2 >= deletion.length / 2 ||\n          overlap_length2 >= insertion.length / 2\n        ) {\n          // Reverse overlap found.\n          // Insert an equality and swap and trim the surrounding edits.\n          diffs.splice(pointer, 0, [\n            DIFF_EQUAL,\n            deletion.substring(0, overlap_length2),\n          ]);\n          diffs[pointer - 1][0] = DIFF_INSERT;\n          diffs[pointer - 1][1] = insertion.substring(\n            0,\n            insertion.length - overlap_length2\n          );\n          diffs[pointer + 1][0] = DIFF_DELETE;\n          diffs[pointer + 1][1] = deletion.substring(overlap_length2);\n          pointer++;\n        }\n      }\n      pointer++;\n    }\n    pointer++;\n  }\n}\n\nvar nonAlphaNumericRegex_ = /[^a-zA-Z0-9]/;\nvar whitespaceRegex_ = /\\s/;\nvar linebreakRegex_ = /[\\r\\n]/;\nvar blanklineEndRegex_ = /\\n\\r?\\n$/;\nvar blanklineStartRegex_ = /^\\r?\\n\\r?\\n/;\n\n/**\n * Look for single edits surrounded on both sides by equalities\n * which can be shifted sideways to align the edit to a word boundary.\n * e.g: The c<ins>at c</ins>ame. -> The <ins>cat </ins>came.\n * @param {!Array.<!diff_match_patch.Diff>} diffs Array of diff tuples.\n */\nfunction diff_cleanupSemanticLossless(diffs) {\n  /**\n   * Given two strings, compute a score representing whether the internal\n   * boundary falls on logical boundaries.\n   * Scores range from 6 (best) to 0 (worst).\n   * Closure, but does not reference any external variables.\n   * @param {string} one First string.\n   * @param {string} two Second string.\n   * @return {number} The score.\n   * @private\n   */\n  function diff_cleanupSemanticScore_(one, two) {\n    if (!one || !two) {\n      // Edges are the best.\n      return 6;\n    }\n\n    // Each port of this function behaves slightly differently due to\n    // subtle differences in each language's definition of things like\n    // 'whitespace'.  Since this function's purpose is largely cosmetic,\n    // the choice has been made to use each language's native features\n    // rather than force total conformity.\n    var char1 = one.charAt(one.length - 1);\n    var char2 = two.charAt(0);\n    var nonAlphaNumeric1 = char1.match(nonAlphaNumericRegex_);\n    var nonAlphaNumeric2 = char2.match(nonAlphaNumericRegex_);\n    var whitespace1 = nonAlphaNumeric1 && char1.match(whitespaceRegex_);\n    var whitespace2 = nonAlphaNumeric2 && char2.match(whitespaceRegex_);\n    var lineBreak1 = whitespace1 && char1.match(linebreakRegex_);\n    var lineBreak2 = whitespace2 && char2.match(linebreakRegex_);\n    var blankLine1 = lineBreak1 && one.match(blanklineEndRegex_);\n    var blankLine2 = lineBreak2 && two.match(blanklineStartRegex_);\n\n    if (blankLine1 || blankLine2) {\n      // Five points for blank lines.\n      return 5;\n    } else if (lineBreak1 || lineBreak2) {\n      // Four points for line breaks.\n      return 4;\n    } else if (nonAlphaNumeric1 && !whitespace1 && whitespace2) {\n      // Three points for end of sentences.\n      return 3;\n    } else if (whitespace1 || whitespace2) {\n      // Two points for whitespace.\n      return 2;\n    } else if (nonAlphaNumeric1 || nonAlphaNumeric2) {\n      // One point for non-alphanumeric.\n      return 1;\n    }\n    return 0;\n  }\n\n  var pointer = 1;\n  // Intentionally ignore the first and last element (don't need checking).\n  while (pointer < diffs.length - 1) {\n    if (\n      diffs[pointer - 1][0] == DIFF_EQUAL &&\n      diffs[pointer + 1][0] == DIFF_EQUAL\n    ) {\n      // This is a single edit surrounded by equalities.\n      var equality1 = diffs[pointer - 1][1];\n      var edit = diffs[pointer][1];\n      var equality2 = diffs[pointer + 1][1];\n\n      // First, shift the edit as far left as possible.\n      var commonOffset = diff_commonSuffix(equality1, edit);\n      if (commonOffset) {\n        var commonString = edit.substring(edit.length - commonOffset);\n        equality1 = equality1.substring(0, equality1.length - commonOffset);\n        edit = commonString + edit.substring(0, edit.length - commonOffset);\n        equality2 = commonString + equality2;\n      }\n\n      // Second, step character by character right, looking for the best fit.\n      var bestEquality1 = equality1;\n      var bestEdit = edit;\n      var bestEquality2 = equality2;\n      var bestScore =\n        diff_cleanupSemanticScore_(equality1, edit) +\n        diff_cleanupSemanticScore_(edit, equality2);\n      while (edit.charAt(0) === equality2.charAt(0)) {\n        equality1 += edit.charAt(0);\n        edit = edit.substring(1) + equality2.charAt(0);\n        equality2 = equality2.substring(1);\n        var score =\n          diff_cleanupSemanticScore_(equality1, edit) +\n          diff_cleanupSemanticScore_(edit, equality2);\n        // The >= encourages trailing rather than leading whitespace on edits.\n        if (score >= bestScore) {\n          bestScore = score;\n          bestEquality1 = equality1;\n          bestEdit = edit;\n          bestEquality2 = equality2;\n        }\n      }\n\n      if (diffs[pointer - 1][1] != bestEquality1) {\n        // We have an improvement, save it back to the diff.\n        if (bestEquality1) {\n          diffs[pointer - 1][1] = bestEquality1;\n        } else {\n          diffs.splice(pointer - 1, 1);\n          pointer--;\n        }\n        diffs[pointer][1] = bestEdit;\n        if (bestEquality2) {\n          diffs[pointer + 1][1] = bestEquality2;\n        } else {\n          diffs.splice(pointer + 1, 1);\n          pointer--;\n        }\n      }\n    }\n    pointer++;\n  }\n}\n\n/**\n * Reorder and merge like edit sections.  Merge equalities.\n * Any edit section can move as long as it doesn't cross an equality.\n * @param {Array} diffs Array of diff tuples.\n * @param {boolean} fix_unicode Whether to normalize to a unicode-correct diff\n */\nfunction diff_cleanupMerge(diffs, fix_unicode) {\n  diffs.push([DIFF_EQUAL, \"\"]); // Add a dummy entry at the end.\n  var pointer = 0;\n  var count_delete = 0;\n  var count_insert = 0;\n  var text_delete = \"\";\n  var text_insert = \"\";\n  var commonlength;\n  while (pointer < diffs.length) {\n    if (pointer < diffs.length - 1 && !diffs[pointer][1]) {\n      diffs.splice(pointer, 1);\n      continue;\n    }\n    switch (diffs[pointer][0]) {\n      case DIFF_INSERT:\n        count_insert++;\n        text_insert += diffs[pointer][1];\n        pointer++;\n        break;\n      case DIFF_DELETE:\n        count_delete++;\n        text_delete += diffs[pointer][1];\n        pointer++;\n        break;\n      case DIFF_EQUAL:\n        var previous_equality = pointer - count_insert - count_delete - 1;\n        if (fix_unicode) {\n          // prevent splitting of unicode surrogate pairs.  when fix_unicode is true,\n          // we assume that the old and new text in the diff are complete and correct\n          // unicode-encoded JS strings, but the tuple boundaries may fall between\n          // surrogate pairs.  we fix this by shaving off stray surrogates from the end\n          // of the previous equality and the beginning of this equality.  this may create\n          // empty equalities or a common prefix or suffix.  for example, if AB and AC are\n          // emojis, `[[0, 'A'], [-1, 'BA'], [0, 'C']]` would turn into deleting 'ABAC' and\n          // inserting 'AC', and then the common suffix 'AC' will be eliminated.  in this\n          // particular case, both equalities go away, we absorb any previous inequalities,\n          // and we keep scanning for the next equality before rewriting the tuples.\n          if (\n            previous_equality >= 0 &&\n            ends_with_pair_start(diffs[previous_equality][1])\n          ) {\n            var stray = diffs[previous_equality][1].slice(-1);\n            diffs[previous_equality][1] = diffs[previous_equality][1].slice(\n              0,\n              -1\n            );\n            text_delete = stray + text_delete;\n            text_insert = stray + text_insert;\n            if (!diffs[previous_equality][1]) {\n              // emptied out previous equality, so delete it and include previous delete/insert\n              diffs.splice(previous_equality, 1);\n              pointer--;\n              var k = previous_equality - 1;\n              if (diffs[k] && diffs[k][0] === DIFF_INSERT) {\n                count_insert++;\n                text_insert = diffs[k][1] + text_insert;\n                k--;\n              }\n              if (diffs[k] && diffs[k][0] === DIFF_DELETE) {\n                count_delete++;\n                text_delete = diffs[k][1] + text_delete;\n                k--;\n              }\n              previous_equality = k;\n            }\n          }\n          if (starts_with_pair_end(diffs[pointer][1])) {\n            var stray = diffs[pointer][1].charAt(0);\n            diffs[pointer][1] = diffs[pointer][1].slice(1);\n            text_delete += stray;\n            text_insert += stray;\n          }\n        }\n        if (pointer < diffs.length - 1 && !diffs[pointer][1]) {\n          // for empty equality not at end, wait for next equality\n          diffs.splice(pointer, 1);\n          break;\n        }\n        if (text_delete.length > 0 || text_insert.length > 0) {\n          // note that diff_commonPrefix and diff_commonSuffix are unicode-aware\n          if (text_delete.length > 0 && text_insert.length > 0) {\n            // Factor out any common prefixes.\n            commonlength = diff_commonPrefix(text_insert, text_delete);\n            if (commonlength !== 0) {\n              if (previous_equality >= 0) {\n                diffs[previous_equality][1] += text_insert.substring(\n                  0,\n                  commonlength\n                );\n              } else {\n                diffs.splice(0, 0, [\n                  DIFF_EQUAL,\n                  text_insert.substring(0, commonlength),\n                ]);\n                pointer++;\n              }\n              text_insert = text_insert.substring(commonlength);\n              text_delete = text_delete.substring(commonlength);\n            }\n            // Factor out any common suffixes.\n            commonlength = diff_commonSuffix(text_insert, text_delete);\n            if (commonlength !== 0) {\n              diffs[pointer][1] =\n                text_insert.substring(text_insert.length - commonlength) +\n                diffs[pointer][1];\n              text_insert = text_insert.substring(\n                0,\n                text_insert.length - commonlength\n              );\n              text_delete = text_delete.substring(\n                0,\n                text_delete.length - commonlength\n              );\n            }\n          }\n          // Delete the offending records and add the merged ones.\n          var n = count_insert + count_delete;\n          if (text_delete.length === 0 && text_insert.length === 0) {\n            diffs.splice(pointer - n, n);\n            pointer = pointer - n;\n          } else if (text_delete.length === 0) {\n            diffs.splice(pointer - n, n, [DIFF_INSERT, text_insert]);\n            pointer = pointer - n + 1;\n          } else if (text_insert.length === 0) {\n            diffs.splice(pointer - n, n, [DIFF_DELETE, text_delete]);\n            pointer = pointer - n + 1;\n          } else {\n            diffs.splice(\n              pointer - n,\n              n,\n              [DIFF_DELETE, text_delete],\n              [DIFF_INSERT, text_insert]\n            );\n            pointer = pointer - n + 2;\n          }\n        }\n        if (pointer !== 0 && diffs[pointer - 1][0] === DIFF_EQUAL) {\n          // Merge this equality with the previous one.\n          diffs[pointer - 1][1] += diffs[pointer][1];\n          diffs.splice(pointer, 1);\n        } else {\n          pointer++;\n        }\n        count_insert = 0;\n        count_delete = 0;\n        text_delete = \"\";\n        text_insert = \"\";\n        break;\n    }\n  }\n  if (diffs[diffs.length - 1][1] === \"\") {\n    diffs.pop(); // Remove the dummy entry at the end.\n  }\n\n  // Second pass: look for single edits surrounded on both sides by equalities\n  // which can be shifted sideways to eliminate an equality.\n  // e.g: A<ins>BA</ins>C -> <ins>AB</ins>AC\n  var changes = false;\n  pointer = 1;\n  // Intentionally ignore the first and last element (don't need checking).\n  while (pointer < diffs.length - 1) {\n    if (\n      diffs[pointer - 1][0] === DIFF_EQUAL &&\n      diffs[pointer + 1][0] === DIFF_EQUAL\n    ) {\n      // This is a single edit surrounded by equalities.\n      if (\n        diffs[pointer][1].substring(\n          diffs[pointer][1].length - diffs[pointer - 1][1].length\n        ) === diffs[pointer - 1][1]\n      ) {\n        // Shift the edit over the previous equality.\n        diffs[pointer][1] =\n          diffs[pointer - 1][1] +\n          diffs[pointer][1].substring(\n            0,\n            diffs[pointer][1].length - diffs[pointer - 1][1].length\n          );\n        diffs[pointer + 1][1] = diffs[pointer - 1][1] + diffs[pointer + 1][1];\n        diffs.splice(pointer - 1, 1);\n        changes = true;\n      } else if (\n        diffs[pointer][1].substring(0, diffs[pointer + 1][1].length) ==\n        diffs[pointer + 1][1]\n      ) {\n        // Shift the edit over the next equality.\n        diffs[pointer - 1][1] += diffs[pointer + 1][1];\n        diffs[pointer][1] =\n          diffs[pointer][1].substring(diffs[pointer + 1][1].length) +\n          diffs[pointer + 1][1];\n        diffs.splice(pointer + 1, 1);\n        changes = true;\n      }\n    }\n    pointer++;\n  }\n  // If shifts were made, the diff needs reordering and another shift sweep.\n  if (changes) {\n    diff_cleanupMerge(diffs, fix_unicode);\n  }\n}\n\nfunction is_surrogate_pair_start(charCode) {\n  return charCode >= 0xd800 && charCode <= 0xdbff;\n}\n\nfunction is_surrogate_pair_end(charCode) {\n  return charCode >= 0xdc00 && charCode <= 0xdfff;\n}\n\nfunction starts_with_pair_end(str) {\n  return is_surrogate_pair_end(str.charCodeAt(0));\n}\n\nfunction ends_with_pair_start(str) {\n  return is_surrogate_pair_start(str.charCodeAt(str.length - 1));\n}\n\nfunction remove_empty_tuples(tuples) {\n  var ret = [];\n  for (var i = 0; i < tuples.length; i++) {\n    if (tuples[i][1].length > 0) {\n      ret.push(tuples[i]);\n    }\n  }\n  return ret;\n}\n\nfunction make_edit_splice(before, oldMiddle, newMiddle, after) {\n  if (ends_with_pair_start(before) || starts_with_pair_end(after)) {\n    return null;\n  }\n  return remove_empty_tuples([\n    [DIFF_EQUAL, before],\n    [DIFF_DELETE, oldMiddle],\n    [DIFF_INSERT, newMiddle],\n    [DIFF_EQUAL, after],\n  ]);\n}\n\nfunction find_cursor_edit_diff(oldText, newText, cursor_pos) {\n  // note: this runs after equality check has ruled out exact equality\n  var oldRange =\n    typeof cursor_pos === \"number\"\n      ? { index: cursor_pos, length: 0 }\n      : cursor_pos.oldRange;\n  var newRange = typeof cursor_pos === \"number\" ? null : cursor_pos.newRange;\n  // take into account the old and new selection to generate the best diff\n  // possible for a text edit.  for example, a text change from \"xxx\" to \"xx\"\n  // could be a delete or forwards-delete of any one of the x's, or the\n  // result of selecting two of the x's and typing \"x\".\n  var oldLength = oldText.length;\n  var newLength = newText.length;\n  if (oldRange.length === 0 && (newRange === null || newRange.length === 0)) {\n    // see if we have an insert or delete before or after cursor\n    var oldCursor = oldRange.index;\n    var oldBefore = oldText.slice(0, oldCursor);\n    var oldAfter = oldText.slice(oldCursor);\n    var maybeNewCursor = newRange ? newRange.index : null;\n    editBefore: {\n      // is this an insert or delete right before oldCursor?\n      var newCursor = oldCursor + newLength - oldLength;\n      if (maybeNewCursor !== null && maybeNewCursor !== newCursor) {\n        break editBefore;\n      }\n      if (newCursor < 0 || newCursor > newLength) {\n        break editBefore;\n      }\n      var newBefore = newText.slice(0, newCursor);\n      var newAfter = newText.slice(newCursor);\n      if (newAfter !== oldAfter) {\n        break editBefore;\n      }\n      var prefixLength = Math.min(oldCursor, newCursor);\n      var oldPrefix = oldBefore.slice(0, prefixLength);\n      var newPrefix = newBefore.slice(0, prefixLength);\n      if (oldPrefix !== newPrefix) {\n        break editBefore;\n      }\n      var oldMiddle = oldBefore.slice(prefixLength);\n      var newMiddle = newBefore.slice(prefixLength);\n      return make_edit_splice(oldPrefix, oldMiddle, newMiddle, oldAfter);\n    }\n    editAfter: {\n      // is this an insert or delete right after oldCursor?\n      if (maybeNewCursor !== null && maybeNewCursor !== oldCursor) {\n        break editAfter;\n      }\n      var cursor = oldCursor;\n      var newBefore = newText.slice(0, cursor);\n      var newAfter = newText.slice(cursor);\n      if (newBefore !== oldBefore) {\n        break editAfter;\n      }\n      var suffixLength = Math.min(oldLength - cursor, newLength - cursor);\n      var oldSuffix = oldAfter.slice(oldAfter.length - suffixLength);\n      var newSuffix = newAfter.slice(newAfter.length - suffixLength);\n      if (oldSuffix !== newSuffix) {\n        break editAfter;\n      }\n      var oldMiddle = oldAfter.slice(0, oldAfter.length - suffixLength);\n      var newMiddle = newAfter.slice(0, newAfter.length - suffixLength);\n      return make_edit_splice(oldBefore, oldMiddle, newMiddle, oldSuffix);\n    }\n  }\n  if (oldRange.length > 0 && newRange && newRange.length === 0) {\n    replaceRange: {\n      // see if diff could be a splice of the old selection range\n      var oldPrefix = oldText.slice(0, oldRange.index);\n      var oldSuffix = oldText.slice(oldRange.index + oldRange.length);\n      var prefixLength = oldPrefix.length;\n      var suffixLength = oldSuffix.length;\n      if (newLength < prefixLength + suffixLength) {\n        break replaceRange;\n      }\n      var newPrefix = newText.slice(0, prefixLength);\n      var newSuffix = newText.slice(newLength - suffixLength);\n      if (oldPrefix !== newPrefix || oldSuffix !== newSuffix) {\n        break replaceRange;\n      }\n      var oldMiddle = oldText.slice(prefixLength, oldLength - suffixLength);\n      var newMiddle = newText.slice(prefixLength, newLength - suffixLength);\n      return make_edit_splice(oldPrefix, oldMiddle, newMiddle, oldSuffix);\n    }\n  }\n\n  return null;\n}\n\nfunction diff(text1, text2, cursor_pos, cleanup) {\n  // only pass fix_unicode=true at the top level, not when diff_main is\n  // recursively invoked\n  return diff_main(text1, text2, cursor_pos, cleanup, true);\n}\n\ndiff.INSERT = DIFF_INSERT;\ndiff.DELETE = DIFF_DELETE;\ndiff.EQUAL = DIFF_EQUAL;\n\nmodule.exports = diff;\n","/**\n * lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright jQuery Foundation and other contributors <https://jquery.org/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/**\n * Adds the key-value `pair` to `map`.\n *\n * @private\n * @param {Object} map The map to modify.\n * @param {Array} pair The key-value pair to add.\n * @returns {Object} Returns `map`.\n */\nfunction addMapEntry(map, pair) {\n  // Don't return `map.set` because it's not chainable in IE 11.\n  map.set(pair[0], pair[1]);\n  return map;\n}\n\n/**\n * Adds `value` to `set`.\n *\n * @private\n * @param {Object} set The set to modify.\n * @param {*} value The value to add.\n * @returns {Object} Returns `set`.\n */\nfunction addSetEntry(set, value) {\n  // Don't return `set.add` because it's not chainable in IE 11.\n  set.add(value);\n  return set;\n}\n\n/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array ? array.length : 0;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\n/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\n/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array ? array.length : 0;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\n/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\n/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\n/**\n * Checks if `value` is a host object in IE < 9.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a host object, else `false`.\n */\nfunction isHostObject(value) {\n  // Many host objects are `Object` objects that can coerce to strings\n  // despite having improperly defined `toString` methods.\n  var result = false;\n  if (value != null && typeof value.toString != 'function') {\n    try {\n      result = !!(value + '');\n    } catch (e) {}\n  }\n  return result;\n}\n\n/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\n/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype,\n    funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar objectToString = objectProto.toString;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    Symbol = root.Symbol,\n    Uint8Array = root.Uint8Array,\n    getPrototype = overArg(Object.getPrototypeOf, Object),\n    objectCreate = Object.create,\n    propertyIsEnumerable = objectProto.propertyIsEnumerable,\n    splice = arrayProto.splice;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols,\n    nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n    nativeKeys = overArg(Object.keys, Object);\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView'),\n    Map = getNative(root, 'Map'),\n    Promise = getNative(root, 'Promise'),\n    Set = getNative(root, 'Set'),\n    WeakMap = getNative(root, 'WeakMap'),\n    nativeCreate = getNative(Object, 'create');\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n}\n\n/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  return this.has(key) && delete this.__data__[key];\n}\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? data[key] !== undefined : hasOwnProperty.call(data, key);\n}\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n}\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  return true;\n}\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries ? entries.length : 0;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  return getMapData(this, key)['delete'](key);\n}\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  getMapData(this, key).set(key, value);\n  return this;\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  this.__data__ = new ListCache(entries);\n}\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n}\n\n/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  return this.__data__['delete'](key);\n}\n\n/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\n/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var cache = this.__data__;\n  if (cache instanceof ListCache) {\n    var pairs = cache.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      return this;\n    }\n    cache = this.__data__ = new MapCache(pairs);\n  }\n  cache.set(key, value);\n  return this;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  // Safari 9 makes `arguments.length` enumerable in strict mode.\n  var result = (isArray(value) || isArguments(value))\n    ? baseTimes(value.length, String)\n    : [];\n\n  var length = result.length,\n      skipIndexes = !!length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (key == 'length' || isIndex(key, length)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    object[key] = value;\n  }\n}\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\n/**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @param {boolean} [isFull] Specify a clone including symbols.\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\nfunction baseClone(value, isDeep, isFull, customizer, key, object, stack) {\n  var result;\n  if (customizer) {\n    result = object ? customizer(value, key, object, stack) : customizer(value);\n  }\n  if (result !== undefined) {\n    return result;\n  }\n  if (!isObject(value)) {\n    return value;\n  }\n  var isArr = isArray(value);\n  if (isArr) {\n    result = initCloneArray(value);\n    if (!isDeep) {\n      return copyArray(value, result);\n    }\n  } else {\n    var tag = getTag(value),\n        isFunc = tag == funcTag || tag == genTag;\n\n    if (isBuffer(value)) {\n      return cloneBuffer(value, isDeep);\n    }\n    if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n      if (isHostObject(value)) {\n        return object ? value : {};\n      }\n      result = initCloneObject(isFunc ? {} : value);\n      if (!isDeep) {\n        return copySymbols(value, baseAssign(result, value));\n      }\n    } else {\n      if (!cloneableTags[tag]) {\n        return object ? value : {};\n      }\n      result = initCloneByTag(value, tag, baseClone, isDeep);\n    }\n  }\n  // Check for circular references and return its corresponding clone.\n  stack || (stack = new Stack);\n  var stacked = stack.get(value);\n  if (stacked) {\n    return stacked;\n  }\n  stack.set(value, result);\n\n  if (!isArr) {\n    var props = isFull ? getAllKeys(value) : keys(value);\n  }\n  arrayEach(props || value, function(subValue, key) {\n    if (props) {\n      key = subValue;\n      subValue = value[key];\n    }\n    // Recursively populate clone (susceptible to call stack limits).\n    assignValue(result, key, baseClone(subValue, isDeep, isFull, customizer, key, value, stack));\n  });\n  return result;\n}\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} prototype The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nfunction baseCreate(proto) {\n  return isObject(proto) ? objectCreate(proto) : {};\n}\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\n/**\n * The base implementation of `getTag`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  return objectToString.call(value);\n}\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = (isFunction(value) || isHostObject(value)) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var result = new buffer.constructor(buffer.length);\n  buffer.copy(result);\n  return result;\n}\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\n/**\n * Creates a clone of `map`.\n *\n * @private\n * @param {Object} map The map to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned map.\n */\nfunction cloneMap(map, isDeep, cloneFunc) {\n  var array = isDeep ? cloneFunc(mapToArray(map), true) : mapToArray(map);\n  return arrayReduce(array, addMapEntry, new map.constructor);\n}\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n  var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n  result.lastIndex = regexp.lastIndex;\n  return result;\n}\n\n/**\n * Creates a clone of `set`.\n *\n * @private\n * @param {Object} set The set to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned set.\n */\nfunction cloneSet(set, isDeep, cloneFunc) {\n  var array = isDeep ? cloneFunc(setToArray(set), true) : setToArray(set);\n  return arrayReduce(array, addSetEntry, new set.constructor);\n}\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n  return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\n/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    assignValue(object, key, newValue === undefined ? source[key] : newValue);\n  }\n  return object;\n}\n\n/**\n * Copies own symbol properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbols(source, object) {\n  return copyObject(source, getSymbols(source), object);\n}\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\n/**\n * Creates an array of the own enumerable symbol properties of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = nativeGetSymbols ? overArg(nativeGetSymbols, Object) : stubArray;\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11,\n// for data views in Edge < 14, and promises in Node.js.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = objectToString.call(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : undefined;\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n  var length = array.length,\n      result = array.constructor(length);\n\n  // Add properties assigned by `RegExp#exec`.\n  if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n    result.index = array.index;\n    result.input = array.input;\n  }\n  return result;\n}\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\n/**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {Function} cloneFunc The function to clone values.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneByTag(object, tag, cloneFunc, isDeep) {\n  var Ctor = object.constructor;\n  switch (tag) {\n    case arrayBufferTag:\n      return cloneArrayBuffer(object);\n\n    case boolTag:\n    case dateTag:\n      return new Ctor(+object);\n\n    case dataViewTag:\n      return cloneDataView(object, isDeep);\n\n    case float32Tag: case float64Tag:\n    case int8Tag: case int16Tag: case int32Tag:\n    case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n      return cloneTypedArray(object, isDeep);\n\n    case mapTag:\n      return cloneMap(object, isDeep, cloneFunc);\n\n    case numberTag:\n    case stringTag:\n      return new Ctor(object);\n\n    case regexpTag:\n      return cloneRegExp(object);\n\n    case setTag:\n      return cloneSet(object, isDeep, cloneFunc);\n\n    case symbolTag:\n      return cloneSymbol(object);\n  }\n}\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  length = length == null ? MAX_SAFE_INTEGER : length;\n  return !!length &&\n    (typeof value == 'number' || reIsUint.test(value)) &&\n    (value > -1 && value % 1 == 0 && value < length);\n}\n\n/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to process.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, true, true);\n}\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nfunction isArguments(value) {\n  // Safari 8.1 makes `arguments.callee` enumerable in strict mode.\n  return isArrayLikeObject(value) && hasOwnProperty.call(value, 'callee') &&\n    (!propertyIsEnumerable.call(value, 'callee') || objectToString.call(value) == argsTag);\n}\n\n/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 8-9 which returns 'object' for typed array and other constructors.\n  var tag = isObject(value) ? objectToString.call(value) : '';\n  return tag == funcTag || tag == genTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return !!value && (type == 'object' || type == 'function');\n}\n\n/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return !!value && typeof value == 'object';\n}\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\n/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\n/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = cloneDeep;\n","/**\n * Lodash (Custom Build) <https://lodash.com/>\n * Build: `lodash modularize exports=\"npm\" -o ./`\n * Copyright JS Foundation and other contributors <https://js.foundation/>\n * Released under MIT license <https://lodash.com/license>\n * Based on Underscore.js 1.8.3 <http://underscorejs.org/LICENSE>\n * Copyright Jeremy Ashkenas, DocumentCloud and Investigative Reporters & Editors\n */\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    asyncTag = '[object AsyncFunction]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    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\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * 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 */\nfunction 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 * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\n/**\n * A specialized version of `_.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 */\nfunction 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 * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\n/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\n/**\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 */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\n/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\n/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\n/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\n/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype,\n    funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    Symbol = root.Symbol,\n    Uint8Array = root.Uint8Array,\n    propertyIsEnumerable = objectProto.propertyIsEnumerable,\n    splice = arrayProto.splice,\n    symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols,\n    nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined,\n    nativeKeys = overArg(Object.keys, Object);\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView'),\n    Map = getNative(root, 'Map'),\n    Promise = getNative(root, 'Promise'),\n    Set = getNative(root, 'Set'),\n    WeakMap = getNative(root, 'WeakMap'),\n    nativeCreate = getNative(Object, 'create');\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == 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 */\nfunction 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 */\nfunction 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 */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  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`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == 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 */\nfunction 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 */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --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 */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++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`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == 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 */\nfunction 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 */\nfunction 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 */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  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`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\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 */\nfunction 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 */\nfunction 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 */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  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 */\nfunction 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 */\nfunction 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 */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\n/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var 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`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  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 * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\n/**\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 */\nfunction 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 */\nfunction 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 `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\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 */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\n/**\n * 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 */\nfunction 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  // Assume cyclic values are equal.\n  var stacked = stack.get(array);\n  if (stacked && stack.get(other)) {\n    return stacked == other;\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 */\nfunction 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 */\nfunction 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  // Assume cyclic values are equal.\n  var stacked = stack.get(object);\n  if (stacked && stack.get(other)) {\n    return stacked == other;\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 * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\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 */\nvar 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 * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = 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 * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  length = length == null ? MAX_SAFE_INTEGER : length;\n  return !!length &&\n    (typeof value == 'number' || reIsUint.test(value)) &&\n    (value > -1 && value % 1 == 0 && value < length);\n}\n\n/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\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 */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\n/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar 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 */\nvar isArray = Array.isArray;\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\n/**\n * 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 */\nfunction isEqual(value, other) {\n  return baseIsEqual(value, other);\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 */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\n/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != 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 */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\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 */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\n/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\n/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = isEqual;\n","import cloneDeep = require('lodash.clonedeep');\nimport isEqual = require('lodash.isequal');\n\ninterface AttributeMap {\n  [key: string]: unknown;\n}\n\nnamespace AttributeMap {\n  export function compose(\n    a: AttributeMap = {},\n    b: AttributeMap = {},\n    keepNull = false,\n  ): AttributeMap | undefined {\n    if (typeof a !== 'object') {\n      a = {};\n    }\n    if (typeof b !== 'object') {\n      b = {};\n    }\n    let attributes = cloneDeep(b);\n    if (!keepNull) {\n      attributes = Object.keys(attributes).reduce<AttributeMap>((copy, key) => {\n        if (attributes[key] != null) {\n          copy[key] = attributes[key];\n        }\n        return copy;\n      }, {});\n    }\n    for (const key in a) {\n      if (a[key] !== undefined && b[key] === undefined) {\n        attributes[key] = a[key];\n      }\n    }\n    return Object.keys(attributes).length > 0 ? attributes : undefined;\n  }\n\n  export function diff(\n    a: AttributeMap = {},\n    b: AttributeMap = {},\n  ): AttributeMap | undefined {\n    if (typeof a !== 'object') {\n      a = {};\n    }\n    if (typeof b !== 'object') {\n      b = {};\n    }\n    const attributes = Object.keys(a)\n      .concat(Object.keys(b))\n      .reduce<AttributeMap>((attrs, key) => {\n        if (!isEqual(a[key], b[key])) {\n          attrs[key] = b[key] === undefined ? null : b[key];\n        }\n        return attrs;\n      }, {});\n    return Object.keys(attributes).length > 0 ? attributes : undefined;\n  }\n\n  export function invert(\n    attr: AttributeMap = {},\n    base: AttributeMap = {},\n  ): AttributeMap {\n    attr = attr || {};\n    const baseInverted = Object.keys(base).reduce<AttributeMap>((memo, key) => {\n      if (base[key] !== attr[key] && attr[key] !== undefined) {\n        memo[key] = base[key];\n      }\n      return memo;\n    }, {});\n    return Object.keys(attr).reduce<AttributeMap>((memo, key) => {\n      if (attr[key] !== base[key] && base[key] === undefined) {\n        memo[key] = null;\n      }\n      return memo;\n    }, baseInverted);\n  }\n\n  export function transform(\n    a: AttributeMap | undefined,\n    b: AttributeMap | undefined,\n    priority = false,\n  ): AttributeMap | undefined {\n    if (typeof a !== 'object') {\n      return b;\n    }\n    if (typeof b !== 'object') {\n      return undefined;\n    }\n    if (!priority) {\n      return b; // b simply overwrites us without priority\n    }\n    const attributes = Object.keys(b).reduce<AttributeMap>((attrs, key) => {\n      if (a[key] === undefined) {\n        attrs[key] = b[key]; // null is a valid value\n      }\n      return attrs;\n    }, {});\n    return Object.keys(attributes).length > 0 ? attributes : undefined;\n  }\n}\n\nexport default AttributeMap;\n","import * as diff from 'fast-diff';\nimport cloneDeep = require('lodash.clonedeep');\nimport isEqual = require('lodash.isequal');\nimport AttributeMap from './AttributeMap';\nimport Op from './Op';\nimport OpIterator from './OpIterator';\n\nconst NULL_CHARACTER = String.fromCharCode(0); // Placeholder char for embed in diff()\n\ninterface EmbedHandler<T> {\n  compose(a: T, b: T, keepNull: boolean): T;\n  invert(a: T, b: T): T;\n  transform(a: T, b: T, priority: boolean): T;\n}\n\nconst getEmbedTypeAndData = (\n  a: Op['insert'] | Op['retain'],\n  b: Op['insert'],\n): [string, unknown, unknown] => {\n  if (typeof a !== 'object' || a === null) {\n    throw new Error(`cannot retain a ${typeof a}`);\n  }\n  if (typeof b !== 'object' || b === null) {\n    throw new Error(`cannot retain a ${typeof b}`);\n  }\n  const embedType = Object.keys(a)[0];\n  if (!embedType || embedType !== Object.keys(b)[0]) {\n    throw new Error(\n      `embed types not matched: ${embedType} != ${Object.keys(b)[0]}`,\n    );\n  }\n  return [embedType, a[embedType], b[embedType]];\n};\n\nclass Delta {\n  static Op = Op;\n  static OpIterator = OpIterator;\n  static AttributeMap = AttributeMap;\n  private static handlers: { [embedType: string]: EmbedHandler<unknown> } = {};\n\n  static registerEmbed<T>(embedType: string, handler: EmbedHandler<T>): void {\n    this.handlers[embedType] = handler;\n  }\n\n  static unregisterEmbed(embedType: string): void {\n    delete this.handlers[embedType];\n  }\n\n  private static getHandler(embedType: string): EmbedHandler<unknown> {\n    const handler = this.handlers[embedType];\n    if (!handler) {\n      throw new Error(`no handlers for embed type \"${embedType}\"`);\n    }\n    return handler;\n  }\n\n  ops: Op[];\n  constructor(ops?: Op[] | { ops: Op[] }) {\n    // Assume we are given a well formed ops\n    if (Array.isArray(ops)) {\n      this.ops = ops;\n    } else if (ops != null && Array.isArray(ops.ops)) {\n      this.ops = ops.ops;\n    } else {\n      this.ops = [];\n    }\n  }\n\n  insert(\n    arg: string | Record<string, unknown>,\n    attributes?: AttributeMap | null,\n  ): this {\n    const newOp: Op = {};\n    if (typeof arg === 'string' && arg.length === 0) {\n      return this;\n    }\n    newOp.insert = arg;\n    if (\n      attributes != null &&\n      typeof attributes === 'object' &&\n      Object.keys(attributes).length > 0\n    ) {\n      newOp.attributes = attributes;\n    }\n    return this.push(newOp);\n  }\n\n  delete(length: number): this {\n    if (length <= 0) {\n      return this;\n    }\n    return this.push({ delete: length });\n  }\n\n  retain(\n    length: number | Record<string, unknown>,\n    attributes?: AttributeMap | null,\n  ): this {\n    if (typeof length === 'number' && length <= 0) {\n      return this;\n    }\n    const newOp: Op = { retain: length };\n    if (\n      attributes != null &&\n      typeof attributes === 'object' &&\n      Object.keys(attributes).length > 0\n    ) {\n      newOp.attributes = attributes;\n    }\n    return this.push(newOp);\n  }\n\n  push(newOp: Op): this {\n    let index = this.ops.length;\n    let lastOp = this.ops[index - 1];\n    newOp = cloneDeep(newOp);\n    if (typeof lastOp === 'object') {\n      if (\n        typeof newOp.delete === 'number' &&\n        typeof lastOp.delete === 'number'\n      ) {\n        this.ops[index - 1] = { delete: lastOp.delete + newOp.delete };\n        return this;\n      }\n      // Since it does not matter if we insert before or after deleting at the same index,\n      // always prefer to insert first\n      if (typeof lastOp.delete === 'number' && newOp.insert != null) {\n        index -= 1;\n        lastOp = this.ops[index - 1];\n        if (typeof lastOp !== 'object') {\n          this.ops.unshift(newOp);\n          return this;\n        }\n      }\n      if (isEqual(newOp.attributes, lastOp.attributes)) {\n        if (\n          typeof newOp.insert === 'string' &&\n          typeof lastOp.insert === 'string'\n        ) {\n          this.ops[index - 1] = { insert: lastOp.insert + newOp.insert };\n          if (typeof newOp.attributes === 'object') {\n            this.ops[index - 1].attributes = newOp.attributes;\n          }\n          return this;\n        } else if (\n          typeof newOp.retain === 'number' &&\n          typeof lastOp.retain === 'number'\n        ) {\n          this.ops[index - 1] = { retain: lastOp.retain + newOp.retain };\n          if (typeof newOp.attributes === 'object') {\n            this.ops[index - 1].attributes = newOp.attributes;\n          }\n          return this;\n        }\n      }\n    }\n    if (index === this.ops.length) {\n      this.ops.push(newOp);\n    } else {\n      this.ops.splice(index, 0, newOp);\n    }\n    return this;\n  }\n\n  chop(): this {\n    const lastOp = this.ops[this.ops.length - 1];\n    if (lastOp && typeof lastOp.retain === 'number' && !lastOp.attributes) {\n      this.ops.pop();\n    }\n    return this;\n  }\n\n  filter(predicate: (op: Op, index: number) => boolean): Op[] {\n    return this.ops.filter(predicate);\n  }\n\n  forEach(predicate: (op: Op, index: number) => void): void {\n    this.ops.forEach(predicate);\n  }\n\n  map<T>(predicate: (op: Op, index: number) => T): T[] {\n    return this.ops.map(predicate);\n  }\n\n  partition(predicate: (op: Op) => boolean): [Op[], Op[]] {\n    const passed: Op[] = [];\n    const failed: Op[] = [];\n    this.forEach((op) => {\n      const target = predicate(op) ? passed : failed;\n      target.push(op);\n    });\n    return [passed, failed];\n  }\n\n  reduce<T>(\n    predicate: (accum: T, curr: Op, index: number) => T,\n    initialValue: T,\n  ): T {\n    return this.ops.reduce(predicate, initialValue);\n  }\n\n  changeLength(): number {\n    return this.reduce((length, elem) => {\n      if (elem.insert) {\n        return length + Op.length(elem);\n      } else if (elem.delete) {\n        return length - elem.delete;\n      }\n      return length;\n    }, 0);\n  }\n\n  length(): number {\n    return this.reduce((length, elem) => {\n      return length + Op.length(elem);\n    }, 0);\n  }\n\n  slice(start = 0, end = Infinity): Delta {\n    const ops = [];\n    const iter = new OpIterator(this.ops);\n    let index = 0;\n    while (index < end && iter.hasNext()) {\n      let nextOp;\n      if (index < start) {\n        nextOp = iter.next(start - index);\n      } else {\n        nextOp = iter.next(end - index);\n        ops.push(nextOp);\n      }\n      index += Op.length(nextOp);\n    }\n    return new Delta(ops);\n  }\n\n  compose(other: Delta): Delta {\n    const thisIter = new OpIterator(this.ops);\n    const otherIter = new OpIterator(other.ops);\n    const ops = [];\n    const firstOther = otherIter.peek();\n    if (\n      firstOther != null &&\n      typeof firstOther.retain === 'number' &&\n      firstOther.attributes == null\n    ) {\n      let firstLeft = firstOther.retain;\n      while (\n        thisIter.peekType() === 'insert' &&\n        thisIter.peekLength() <= firstLeft\n      ) {\n        firstLeft -= thisIter.peekLength();\n        ops.push(thisIter.next());\n      }\n      if (firstOther.retain - firstLeft > 0) {\n        otherIter.next(firstOther.retain - firstLeft);\n      }\n    }\n    const delta = new Delta(ops);\n    while (thisIter.hasNext() || otherIter.hasNext()) {\n      if (otherIter.peekType() === 'insert') {\n        delta.push(otherIter.next());\n      } else if (thisIter.peekType() === 'delete') {\n        delta.push(thisIter.next());\n      } else {\n        const length = Math.min(thisIter.peekLength(), otherIter.peekLength());\n        const thisOp = thisIter.next(length);\n        const otherOp = otherIter.next(length);\n        if (otherOp.retain) {\n          const newOp: Op = {};\n          if (typeof thisOp.retain === 'number') {\n            newOp.retain =\n              typeof otherOp.retain === 'number' ? length : otherOp.retain;\n          } else {\n            if (typeof otherOp.retain === 'number') {\n              if (thisOp.retain == null) {\n                newOp.insert = thisOp.insert;\n              } else {\n                newOp.retain = thisOp.retain;\n              }\n            } else {\n              const action = thisOp.retain == null ? 'insert' : 'retain';\n              const [embedType, thisData, otherData] = getEmbedTypeAndData(\n                thisOp[action],\n                otherOp.retain,\n              );\n              const handler = Delta.getHandler(embedType);\n              newOp[action] = {\n                [embedType]: handler.compose(\n                  thisData,\n                  otherData,\n                  action === 'retain',\n                ),\n              };\n            }\n          }\n          // Preserve null when composing with a retain, otherwise remove it for inserts\n          const attributes = AttributeMap.compose(\n            thisOp.attributes,\n            otherOp.attributes,\n            typeof thisOp.retain === 'number',\n          );\n          if (attributes) {\n            newOp.attributes = attributes;\n          }\n          delta.push(newOp);\n\n          // Optimization if rest of other is just retain\n          if (\n            !otherIter.hasNext() &&\n            isEqual(delta.ops[delta.ops.length - 1], newOp)\n          ) {\n            const rest = new Delta(thisIter.rest());\n            return delta.concat(rest).chop();\n          }\n\n          // Other op should be delete, we could be an insert or retain\n          // Insert + delete cancels out\n        } else if (\n          typeof otherOp.delete === 'number' &&\n          (typeof thisOp.retain === 'number' ||\n            (typeof thisOp.retain === 'object' && thisOp.retain !== null))\n        ) {\n          delta.push(otherOp);\n        }\n      }\n    }\n    return delta.chop();\n  }\n\n  concat(other: Delta): Delta {\n    const delta = new Delta(this.ops.slice());\n    if (other.ops.length > 0) {\n      delta.push(other.ops[0]);\n      delta.ops = delta.ops.concat(other.ops.slice(1));\n    }\n    return delta;\n  }\n\n  diff(other: Delta, cursor?: number | diff.CursorInfo): Delta {\n    if (this.ops === other.ops) {\n      return new Delta();\n    }\n    const strings = [this, other].map((delta) => {\n      return delta\n        .map((op) => {\n          if (op.insert != null) {\n            return typeof op.insert === 'string' ? op.insert : NULL_CHARACTER;\n          }\n          const prep = delta === other ? 'on' : 'with';\n          throw new Error('diff() called ' + prep + ' non-document');\n        })\n        .join('');\n    });\n    const retDelta = new Delta();\n    const diffResult = diff(strings[0], strings[1], cursor, true);\n    const thisIter = new OpIterator(this.ops);\n    const otherIter = new OpIterator(other.ops);\n    diffResult.forEach((component: diff.Diff) => {\n      let length = component[1].length;\n      while (length > 0) {\n        let opLength = 0;\n        switch (component[0]) {\n          case diff.INSERT:\n            opLength = Math.min(otherIter.peekLength(), length);\n            retDelta.push(otherIter.next(opLength));\n            break;\n          case diff.DELETE:\n            opLength = Math.min(length, thisIter.peekLength());\n            thisIter.next(opLength);\n            retDelta.delete(opLength);\n            break;\n          case diff.EQUAL:\n            opLength = Math.min(\n              thisIter.peekLength(),\n              otherIter.peekLength(),\n              length,\n            );\n            const thisOp = thisIter.next(opLength);\n            const otherOp = otherIter.next(opLength);\n            if (isEqual(thisOp.insert, otherOp.insert)) {\n              retDelta.retain(\n                opLength,\n                AttributeMap.diff(thisOp.attributes, otherOp.attributes),\n              );\n            } else {\n              retDelta.push(otherOp).delete(opLength);\n            }\n            break;\n        }\n        length -= opLength;\n      }\n    });\n    return retDelta.chop();\n  }\n\n  eachLine(\n    predicate: (\n      line: Delta,\n      attributes: AttributeMap,\n      index: number,\n    ) => boolean | void,\n    newline = '\\n',\n  ): void {\n    const iter = new OpIterator(this.ops);\n    let line = new Delta();\n    let i = 0;\n    while (iter.hasNext()) {\n      if (iter.peekType() !== 'insert') {\n        return;\n      }\n      const thisOp = iter.peek();\n      const start = Op.length(thisOp) - iter.peekLength();\n      const index =\n        typeof thisOp.insert === 'string'\n          ? thisOp.insert.indexOf(newline, start) - start\n          : -1;\n      if (index < 0) {\n        line.push(iter.next());\n      } else if (index > 0) {\n        line.push(iter.next(index));\n      } else {\n        if (predicate(line, iter.next(1).attributes || {}, i) === false) {\n          return;\n        }\n        i += 1;\n        line = new Delta();\n      }\n    }\n    if (line.length() > 0) {\n      predicate(line, {}, i);\n    }\n  }\n\n  invert(base: Delta): Delta {\n    const inverted = new Delta();\n    this.reduce((baseIndex, op) => {\n      if (op.insert) {\n        inverted.delete(Op.length(op));\n      } else if (typeof op.retain === 'number' && op.attributes == null) {\n        inverted.retain(op.retain);\n        return baseIndex + op.retain;\n      } else if (op.delete || typeof op.retain === 'number') {\n        const length = (op.delete || op.retain) as number;\n        const slice = base.slice(baseIndex, baseIndex + length);\n        slice.forEach((baseOp) => {\n          if (op.delete) {\n            inverted.push(baseOp);\n          } else if (op.retain && op.attributes) {\n            inverted.retain(\n              Op.length(baseOp),\n              AttributeMap.invert(op.attributes, baseOp.attributes),\n            );\n          }\n        });\n        return baseIndex + length;\n      } else if (typeof op.retain === 'object' && op.retain !== null) {\n        const slice = base.slice(baseIndex, baseIndex + 1);\n        const baseOp = new OpIterator(slice.ops).next();\n        const [embedType, opData, baseOpData] = getEmbedTypeAndData(\n          op.retain,\n          baseOp.insert,\n        );\n        const handler = Delta.getHandler(embedType);\n        inverted.retain(\n          { [embedType]: handler.invert(opData, baseOpData) },\n          AttributeMap.invert(op.attributes, baseOp.attributes),\n        );\n        return baseIndex + 1;\n      }\n      return baseIndex;\n    }, 0);\n    return inverted.chop();\n  }\n\n  transform(index: number, priority?: boolean): number;\n  transform(other: Delta, priority?: boolean): Delta;\n  transform(arg: number | Delta, priority = false): typeof arg {\n    priority = !!priority;\n    if (typeof arg === 'number') {\n      return this.transformPosition(arg, priority);\n    }\n    const other: Delta = arg;\n    const thisIter = new OpIterator(this.ops);\n    const otherIter = new OpIterator(other.ops);\n    const delta = new Delta();\n    while (thisIter.hasNext() || otherIter.hasNext()) {\n      if (\n        thisIter.peekType() === 'insert' &&\n        (priority || otherIter.peekType() !== 'insert')\n      ) {\n        delta.retain(Op.length(thisIter.next()));\n      } else if (otherIter.peekType() === 'insert') {\n        delta.push(otherIter.next());\n      } else {\n        const length = Math.min(thisIter.peekLength(), otherIter.peekLength());\n        const thisOp = thisIter.next(length);\n        const otherOp = otherIter.next(length);\n        if (thisOp.delete) {\n          // Our delete either makes their delete redundant or removes their retain\n          continue;\n        } else if (otherOp.delete) {\n          delta.push(otherOp);\n        } else {\n          const thisData = thisOp.retain;\n          const otherData = otherOp.retain;\n          let transformedData: Op['retain'] =\n            typeof otherData === 'object' && otherData !== null\n              ? otherData\n              : length;\n          if (\n            typeof thisData === 'object' &&\n            thisData !== null &&\n            typeof otherData === 'object' &&\n            otherData !== null\n          ) {\n            const embedType = Object.keys(thisData)[0];\n            if (embedType === Object.keys(otherData)[0]) {\n              const handler = Delta.getHandler(embedType);\n              if (handler) {\n                transformedData = {\n                  [embedType]: handler.transform(\n                    thisData[embedType],\n                    otherData[embedType],\n                    priority,\n                  ),\n                };\n              }\n            }\n          }\n\n          // We retain either their retain or insert\n          delta.retain(\n            transformedData,\n            AttributeMap.transform(\n              thisOp.attributes,\n              otherOp.attributes,\n              priority,\n            ),\n          );\n        }\n      }\n    }\n    return delta.chop();\n  }\n\n  transformPosition(index: number, priority = false): number {\n    priority = !!priority;\n    const thisIter = new OpIterator(this.ops);\n    let offset = 0;\n    while (thisIter.hasNext() && offset <= index) {\n      const length = thisIter.peekLength();\n      const nextType = thisIter.peekType();\n      thisIter.next();\n      if (nextType === 'delete') {\n        index -= Math.min(length, index - offset);\n        continue;\n      } else if (nextType === 'insert' && (offset < index || !priority)) {\n        index += length;\n      }\n      offset += length;\n    }\n    return index;\n  }\n}\n\nexport default Delta;\n\nexport { Op, OpIterator, AttributeMap };\n\nif (typeof module === 'object') {\n  module.exports = Delta;\n  module.exports.default = Delta;\n}\n","import AttributeMap from './AttributeMap';\n\ninterface Op {\n  // only one property out of {insert, delete, retain} will be present\n  insert?: string | Record<string, unknown>;\n  delete?: number;\n  retain?: number | Record<string, unknown>;\n\n  attributes?: AttributeMap;\n}\n\nnamespace Op {\n  export function length(op: Op): number {\n    if (typeof op.delete === 'number') {\n      return op.delete;\n    } else if (typeof op.retain === 'number') {\n      return op.retain;\n    } else if (typeof op.retain === 'object' && op.retain !== null) {\n      return 1;\n    } else {\n      return typeof op.insert === 'string' ? op.insert.length : 1;\n    }\n  }\n}\n\nexport default Op;\n","import Op from './Op';\n\nexport default class Iterator {\n  ops: Op[];\n  index: number;\n  offset: number;\n\n  constructor(ops: Op[]) {\n    this.ops = ops;\n    this.index = 0;\n    this.offset = 0;\n  }\n\n  hasNext(): boolean {\n    return this.peekLength() < Infinity;\n  }\n\n  next(length?: number): Op {\n    if (!length) {\n      length = Infinity;\n    }\n    const nextOp = this.ops[this.index];\n    if (nextOp) {\n      const offset = this.offset;\n      const opLength = Op.length(nextOp);\n      if (length >= opLength - offset) {\n        length = opLength - offset;\n        this.index += 1;\n        this.offset = 0;\n      } else {\n        this.offset += length;\n      }\n      if (typeof nextOp.delete === 'number') {\n        return { delete: length };\n      } else {\n        const retOp: Op = {};\n        if (nextOp.attributes) {\n          retOp.attributes = nextOp.attributes;\n        }\n        if (typeof nextOp.retain === 'number') {\n          retOp.retain = length;\n        } else if (\n          typeof nextOp.retain === 'object' &&\n          nextOp.retain !== null\n        ) {\n          // offset should === 0, length should === 1\n          retOp.retain = nextOp.retain;\n        } else if (typeof nextOp.insert === 'string') {\n          retOp.insert = nextOp.insert.substr(offset, length);\n        } else {\n          // offset should === 0, length should === 1\n          retOp.insert = nextOp.insert;\n        }\n        return retOp;\n      }\n    } else {\n      return { retain: Infinity };\n    }\n  }\n\n  peek(): Op {\n    return this.ops[this.index];\n  }\n\n  peekLength(): number {\n    if (this.ops[this.index]) {\n      // Should never return 0 if our index is being managed correctly\n      return Op.length(this.ops[this.index]) - this.offset;\n    } else {\n      return Infinity;\n    }\n  }\n\n  peekType(): string {\n    const op = this.ops[this.index];\n    if (op) {\n      if (typeof op.delete === 'number') {\n        return 'delete';\n      } else if (\n        typeof op.retain === 'number' ||\n        (typeof op.retain === 'object' && op.retain !== null)\n      ) {\n        return 'retain';\n      } else {\n        return 'insert';\n      }\n    }\n    return 'retain';\n  }\n\n  rest(): Op[] {\n    if (!this.hasNext()) {\n      return [];\n    } else if (this.offset === 0) {\n      return this.ops.slice(this.index);\n    } else {\n      const offset = this.offset;\n      const index = this.index;\n      const next = this.next();\n      const rest = this.ops.slice(this.index);\n      this.offset = offset;\n      this.index = index;\n      return [next].concat(rest);\n    }\n  }\n}\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nexport default listCacheClear;\n","import eq from './eq.js';\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nexport default assocIndexOf;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nexport default listCacheDelete;\n","import listCacheClear from './_listCacheClear.js';\nimport listCacheDelete from './_listCacheDelete.js';\nimport listCacheGet from './_listCacheGet.js';\nimport listCacheHas from './_listCacheHas.js';\nimport listCacheSet from './_listCacheSet.js';\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == 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// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nexport default ListCache;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nexport default listCacheGet;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nexport default listCacheHas;\n","import assocIndexOf from './_assocIndexOf.js';\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nexport default listCacheSet;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nexport default Map;\n","import getNative from './_getNative.js';\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nexport default nativeCreate;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nexport default hashGet;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nexport default hashHas;\n","import hashClear from './_hashClear.js';\nimport hashDelete from './_hashDelete.js';\nimport hashGet from './_hashGet.js';\nimport hashHas from './_hashHas.js';\nimport hashSet from './_hashSet.js';\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == 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// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nexport default Hash;\n","import nativeCreate from './_nativeCreate.js';\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nexport default hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default hashDelete;\n","import nativeCreate from './_nativeCreate.js';\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nexport default hashSet;\n","import isKeyable from './_isKeyable.js';\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nexport default getMapData;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nexport default isKeyable;\n","import mapCacheClear from './_mapCacheClear.js';\nimport mapCacheDelete from './_mapCacheDelete.js';\nimport mapCacheGet from './_mapCacheGet.js';\nimport mapCacheHas from './_mapCacheHas.js';\nimport mapCacheSet from './_mapCacheSet.js';\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == 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// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nexport default MapCache;\n","import Hash from './_Hash.js';\nimport ListCache from './_ListCache.js';\nimport Map from './_Map.js';\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nexport default mapCacheClear;\n","import getMapData from './_getMapData.js';\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nexport default mapCacheDelete;\n","import getMapData from './_getMapData.js';\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nexport default mapCacheGet;\n","import getMapData from './_getMapData.js';\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nexport default mapCacheHas;\n","import getMapData from './_getMapData.js';\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  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\nexport default mapCacheSet;\n","import ListCache from './_ListCache.js';\nimport stackClear from './_stackClear.js';\nimport stackDelete from './_stackDelete.js';\nimport stackGet from './_stackGet.js';\nimport stackHas from './_stackHas.js';\nimport stackSet from './_stackSet.js';\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nexport default Stack;\n","import ListCache from './_ListCache.js';\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nexport default stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nexport default stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nexport default stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nexport default stackHas;\n","import ListCache from './_ListCache.js';\nimport Map from './_Map.js';\nimport MapCache from './_MapCache.js';\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var 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\nexport default stackSet;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nexport default Symbol;\n","import root from './_root.js';\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nexport default Uint8Array;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nexport default baseTimes;\n","import baseTimes from './_baseTimes.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isIndex from './_isIndex.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.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\nexport default arrayLikeKeys;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nexport default arrayPush;\n","import baseAssignValue from './_baseAssignValue.js';\nimport eq from './eq.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nexport default assignValue;\n","import defineProperty from './_defineProperty.js';\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 */\nfunction 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\nexport default baseAssignValue;\n","import arrayPush from './_arrayPush.js';\nimport isArray from './isArray.js';\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nexport default baseGetAllKeys;\n","import Symbol from './_Symbol.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\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\nexport default getRawTag;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nexport default objectToString;\n","import Symbol from './_Symbol.js';\nimport getRawTag from './_getRawTag.js';\nimport objectToString from './_objectToString.js';\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nexport default baseGetTag;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nexport default baseUnary;\n","import Uint8Array from './_Uint8Array.js';\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\nexport default cloneArrayBuffer;\n","import root from './_root.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\nexport default cloneBuffer;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nexport default cloneTypedArray;\n","/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\nexport default copyArray;\n","import assignValue from './_assignValue.js';\nimport baseAssignValue from './_baseAssignValue.js';\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  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\nexport default copyObject;\n","import getNative from './_getNative.js';\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nexport default defineProperty;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nexport default freeGlobal;\n","import baseGetAllKeys from './_baseGetAllKeys.js';\nimport getSymbols from './_getSymbols.js';\nimport keys from './keys.js';\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nexport default getAllKeys;\n","import coreJsData from './_coreJsData.js';\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nexport default isMasked;\n","import root from './_root.js';\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nexport default coreJsData;\n","import isFunction from './isFunction.js';\nimport isMasked from './_isMasked.js';\nimport isObject from './isObject.js';\nimport toSource from './_toSource.js';\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nexport default baseIsNative;\n","import baseIsNative from './_baseIsNative.js';\nimport getValue from './_getValue.js';\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nexport default getNative;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nexport default getValue;\n","import overArg from './_overArg.js';\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nexport default getPrototype;\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 */\nfunction 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\nexport default arrayFilter;\n","import arrayFilter from './_arrayFilter.js';\nimport stubArray from './stubArray.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\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 */\nvar 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\nexport default getSymbols;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nexport default DataView;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nexport default Promise;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nexport default Set;\n","import getNative from './_getNative.js';\nimport root from './_root.js';\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nexport default WeakMap;\n","import DataView from './_DataView.js';\nimport Map from './_Map.js';\nimport Promise from './_Promise.js';\nimport Set from './_Set.js';\nimport WeakMap from './_WeakMap.js';\nimport baseGetTag from './_baseGetTag.js';\nimport toSource from './_toSource.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = 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\nexport default getTag;\n","import isObject from './isObject.js';\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\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 */\nvar 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\nexport default baseCreate;\n","import baseCreate from './_baseCreate.js';\nimport getPrototype from './_getPrototype.js';\nimport isPrototype from './_isPrototype.js';\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\nexport default initCloneObject;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nexport default isIndex;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nexport default isPrototype;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && 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\nexport default nodeUtil;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nexport default overArg;\n","import freeGlobal from './_freeGlobal.js';\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nexport default root;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\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 */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nexport default toSource;\n","import arrayPush from './_arrayPush.js';\nimport getPrototype from './_getPrototype.js';\nimport getSymbols from './_getSymbols.js';\nimport stubArray from './stubArray.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\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 */\nvar 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\nexport default getSymbolsIn;\n","import baseGetAllKeys from './_baseGetAllKeys.js';\nimport getSymbolsIn from './_getSymbolsIn.js';\nimport keysIn from './keysIn.js';\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 */\nfunction getAllKeysIn(object) {\n  return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nexport default getAllKeysIn;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n  var length = array.length,\n      result = 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\nexport default initCloneArray;\n","/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n  var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n  result.lastIndex = regexp.lastIndex;\n  return result;\n}\n\nexport default cloneRegExp;\n","import Symbol from './_Symbol.js';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n  return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nexport default cloneSymbol;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\nimport cloneDataView from './_cloneDataView.js';\nimport cloneRegExp from './_cloneRegExp.js';\nimport cloneSymbol from './_cloneSymbol.js';\nimport cloneTypedArray from './_cloneTypedArray.js';\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * 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 */\nfunction 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\nexport default initCloneByTag;\n","import cloneArrayBuffer from './_cloneArrayBuffer.js';\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nexport default cloneDataView;\n","import baseIsMap from './_baseIsMap.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\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 */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nexport default isMap;\n","import getTag from './_getTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]';\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 */\nfunction baseIsMap(value) {\n  return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nexport default baseIsMap;\n","import baseIsSet from './_baseIsSet.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\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 */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nexport default isSet;\n","import getTag from './_getTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar setTag = '[object Set]';\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 */\nfunction baseIsSet(value) {\n  return isObjectLike(value) && getTag(value) == setTag;\n}\n\nexport default baseIsSet;\n","import Stack from './_Stack.js';\nimport arrayEach from './_arrayEach.js';\nimport assignValue from './_assignValue.js';\nimport baseAssign from './_baseAssign.js';\nimport baseAssignIn from './_baseAssignIn.js';\nimport cloneBuffer from './_cloneBuffer.js';\nimport copyArray from './_copyArray.js';\nimport copySymbols from './_copySymbols.js';\nimport copySymbolsIn from './_copySymbolsIn.js';\nimport getAllKeys from './_getAllKeys.js';\nimport getAllKeysIn from './_getAllKeysIn.js';\nimport getTag from './_getTag.js';\nimport initCloneArray from './_initCloneArray.js';\nimport initCloneByTag from './_initCloneByTag.js';\nimport initCloneObject from './_initCloneObject.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isMap from './isMap.js';\nimport isObject from './isObject.js';\nimport isSet from './isSet.js';\nimport keys from './keys.js';\nimport keysIn from './keysIn.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_FLAT_FLAG = 2,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/**\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 */\nfunction 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\nexport default baseClone;\n","import copyObject from './_copyObject.js';\nimport getSymbolsIn from './_getSymbolsIn.js';\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 */\nfunction copySymbolsIn(source, object) {\n  return copyObject(source, getSymbolsIn(source), object);\n}\n\nexport default copySymbolsIn;\n","import copyObject from './_copyObject.js';\nimport keysIn from './keysIn.js';\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 */\nfunction baseAssignIn(object, source) {\n  return object && copyObject(source, keysIn(source), object);\n}\n\nexport default baseAssignIn;\n","import copyObject from './_copyObject.js';\nimport getSymbols from './_getSymbols.js';\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 */\nfunction copySymbols(source, object) {\n  return copyObject(source, getSymbols(source), object);\n}\n\nexport default copySymbols;\n","import copyObject from './_copyObject.js';\nimport keys from './keys.js';\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\nexport default baseAssign;\n","/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nexport default arrayEach;\n","import baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nexport default cloneDeep;\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nexport default eq;\n","import baseGetTag from './_baseGetTag.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nexport default baseIsArguments;\n","import baseIsArguments from './_baseIsArguments.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nexport default isArguments;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nexport default isArray;\n","import isFunction from './isFunction.js';\nimport isLength from './isLength.js';\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nexport default isArrayLike;\n","import root from './_root.js';\nimport stubFalse from './stubFalse.js';\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nexport default isBuffer;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nexport default stubFalse;\n","import MapCache from './_MapCache.js';\nimport setCacheAdd from './_setCacheAdd.js';\nimport setCacheHas from './_setCacheHas.js';\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 */\nfunction 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// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nexport default SetCache;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\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 */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nexport default setCacheAdd;\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 */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nexport default setCacheHas;\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 */\nfunction 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\nexport default arraySome;\n","import SetCache from './_SetCache.js';\nimport arraySome from './_arraySome.js';\nimport cacheHas from './_cacheHas.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\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 */\nfunction 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\nexport default equalArrays;\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 */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nexport default cacheHas;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nexport default mapToArray;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nexport default setToArray;\n","import Symbol from './_Symbol.js';\nimport Uint8Array from './_Uint8Array.js';\nimport eq from './eq.js';\nimport equalArrays from './_equalArrays.js';\nimport mapToArray from './_mapToArray.js';\nimport setToArray from './_setToArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * 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 */\nfunction 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\nexport default equalByTag;\n","import getAllKeys from './_getAllKeys.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * 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 */\nfunction 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\nexport default equalObjects;\n","import Stack from './_Stack.js';\nimport equalArrays from './_equalArrays.js';\nimport equalByTag from './_equalByTag.js';\nimport equalObjects from './_equalObjects.js';\nimport getTag from './_getTag.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isTypedArray from './isTypedArray.js';\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * 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 */\nfunction 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\nexport default baseIsEqualDeep;\n","import baseIsEqualDeep from './_baseIsEqualDeep.js';\nimport isObjectLike from './isObjectLike.js';\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 */\nfunction 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\nexport default baseIsEqual;\n","import baseIsEqual from './_baseIsEqual.js';\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 */\nfunction isEqual(value, other) {\n  return baseIsEqual(value, other);\n}\n\nexport default isEqual;\n","import baseGetTag from './_baseGetTag.js';\nimport isObject from './isObject.js';\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nexport default isFunction;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nexport default isLength;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nexport default isObject;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nexport default isObjectLike;\n","import baseGetTag from './_baseGetTag.js';\nimport isLength from './isLength.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nexport default baseIsTypedArray;\n","import baseIsTypedArray from './_baseIsTypedArray.js';\nimport baseUnary from './_baseUnary.js';\nimport nodeUtil from './_nodeUtil.js';\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nexport default isTypedArray;\n","import overArg from './_overArg.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nexport default nativeKeys;\n","import isPrototype from './_isPrototype.js';\nimport nativeKeys from './_nativeKeys.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nexport default baseKeys;\n","import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeys from './_baseKeys.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nexport default keys;\n","import isObject from './isObject.js';\nimport isPrototype from './_isPrototype.js';\nimport nativeKeysIn from './_nativeKeysIn.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * 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 */\nfunction 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\nexport default baseKeysIn;\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 */\nfunction 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\nexport default nativeKeysIn;\n","import arrayLikeKeys from './_arrayLikeKeys.js';\nimport baseKeysIn from './_baseKeysIn.js';\nimport isArrayLike from './isArrayLike.js';\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 */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nexport default keysIn;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\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 */\nfunction 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\nexport default shortOut;\n","import baseRest from './_baseRest.js';\nimport isIterateeCall from './_isIterateeCall.js';\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 */\nfunction 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\nexport default createAssigner;\n","import baseAssignValue from './_baseAssignValue.js';\nimport eq from './eq.js';\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 */\nfunction 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\nexport default assignMergeValue;\n","import createBaseFor from './_createBaseFor.js';\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nexport default baseFor;\n","/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nexport default createBaseFor;\n","import baseGetTag from './_baseGetTag.js';\nimport getPrototype from './_getPrototype.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\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 */\nfunction 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\nexport default isPlainObject;\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 */\nfunction 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\nexport default safeGet;\n","import assignMergeValue from './_assignMergeValue.js';\nimport cloneBuffer from './_cloneBuffer.js';\nimport cloneTypedArray from './_cloneTypedArray.js';\nimport copyArray from './_copyArray.js';\nimport initCloneObject from './_initCloneObject.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\nimport isArrayLikeObject from './isArrayLikeObject.js';\nimport isBuffer from './isBuffer.js';\nimport isFunction from './isFunction.js';\nimport isObject from './isObject.js';\nimport isPlainObject from './isPlainObject.js';\nimport isTypedArray from './isTypedArray.js';\nimport safeGet from './_safeGet.js';\nimport toPlainObject from './toPlainObject.js';\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 */\nfunction 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\nexport default baseMergeDeep;\n","import isArrayLike from './isArrayLike.js';\nimport isObjectLike from './isObjectLike.js';\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nexport default isArrayLikeObject;\n","import copyObject from './_copyObject.js';\nimport keysIn from './keysIn.js';\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 */\nfunction toPlainObject(value) {\n  return copyObject(value, keysIn(value));\n}\n\nexport default toPlainObject;\n","import Stack from './_Stack.js';\nimport assignMergeValue from './_assignMergeValue.js';\nimport baseFor from './_baseFor.js';\nimport baseMergeDeep from './_baseMergeDeep.js';\nimport isObject from './isObject.js';\nimport keysIn from './keysIn.js';\nimport safeGet from './_safeGet.js';\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 */\nfunction 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\nexport default baseMerge;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nexport default identity;\n","import apply from './_apply.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\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 */\nfunction 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\nexport default overRest;\n","import constant from './constant.js';\nimport defineProperty from './_defineProperty.js';\nimport identity from './identity.js';\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 */\nvar 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\nexport default baseSetToString;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nexport default constant;\n","import baseSetToString from './_baseSetToString.js';\nimport shortOut from './_shortOut.js';\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 */\nvar setToString = shortOut(baseSetToString);\n\nexport default setToString;\n","import identity from './identity.js';\nimport overRest from './_overRest.js';\nimport setToString from './_setToString.js';\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 */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nexport default baseRest;\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 */\nfunction 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\nexport default apply;\n","import baseMerge from './_baseMerge.js';\nimport createAssigner from './_createAssigner.js';\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 */\nvar merge = createAssigner(function(object, source, srcIndex) {\n  baseMerge(object, source, srcIndex);\n});\n\nexport default merge;\n","import eq from './eq.js';\nimport isArrayLike from './isArrayLike.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\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 */\nfunction 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\nexport default isIterateeCall;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nexport default stubArray;\n","enum Scope {\n  TYPE = (1 << 2) - 1, // 0011 Lower two bits\n  LEVEL = ((1 << 2) - 1) << 2, // 1100 Higher two bits\n\n  ATTRIBUTE = (1 << 0) | LEVEL, // 1101\n  BLOT = (1 << 1) | LEVEL, // 1110\n  INLINE = (1 << 2) | TYPE, // 0111\n  BLOCK = (1 << 3) | TYPE, // 1011\n\n  BLOCK_BLOT = BLOCK & BLOT, // 1010\n  INLINE_BLOT = INLINE & BLOT, // 0110\n  BLOCK_ATTRIBUTE = BLOCK & ATTRIBUTE, // 1001\n  INLINE_ATTRIBUTE = INLINE & ATTRIBUTE, // 0101\n\n  ANY = TYPE | LEVEL,\n}\n\nexport default Scope;\n","import Scope from '../scope.js';\n\nexport interface AttributorOptions {\n  scope?: Scope;\n  whitelist?: string[];\n}\n\nexport default class Attributor {\n  public static keys(node: HTMLElement): string[] {\n    return Array.from(node.attributes).map((item: Attr) => item.name);\n  }\n\n  public scope: Scope;\n  public whitelist: string[] | undefined;\n\n  constructor(\n    public readonly attrName: string,\n    public readonly keyName: string,\n    options: AttributorOptions = {},\n  ) {\n    const attributeBit = Scope.TYPE & Scope.ATTRIBUTE;\n    this.scope =\n      options.scope != null\n        ? // Ignore type bits, force attribute bit\n          (options.scope & Scope.LEVEL) | attributeBit\n        : Scope.ATTRIBUTE;\n    if (options.whitelist != null) {\n      this.whitelist = options.whitelist;\n    }\n  }\n\n  public add(node: HTMLElement, value: any): boolean {\n    if (!this.canAdd(node, value)) {\n      return false;\n    }\n    node.setAttribute(this.keyName, value);\n    return true;\n  }\n\n  public canAdd(_node: HTMLElement, value: any): boolean {\n    if (this.whitelist == null) {\n      return true;\n    }\n    if (typeof value === 'string') {\n      return this.whitelist.indexOf(value.replace(/[\"']/g, '')) > -1;\n    } else {\n      return this.whitelist.indexOf(value) > -1;\n    }\n  }\n\n  public remove(node: HTMLElement): void {\n    node.removeAttribute(this.keyName);\n  }\n\n  public value(node: HTMLElement): any {\n    const value = node.getAttribute(this.keyName);\n    if (this.canAdd(node, value) && value) {\n      return value;\n    }\n    return '';\n  }\n}\n","export default class ParchmentError extends Error {\n  public message: string;\n  public name: string;\n  public stack!: string;\n\n  constructor(message: string) {\n    message = '[Parchment] ' + message;\n    super(message);\n    this.message = message;\n    this.name = this.constructor.name;\n  }\n}\n","import Attributor from './attributor/attributor.js';\nimport {\n  type Blot,\n  type BlotConstructor,\n  type Root,\n} from './blot/abstract/blot.js';\nimport ParchmentError from './error.js';\nimport Scope from './scope.js';\n\nexport type RegistryDefinition = Attributor | BlotConstructor;\n\nexport interface RegistryInterface {\n  create(scroll: Root, input: Node | string | Scope, value?: any): Blot;\n  query(query: string | Node | Scope, scope: Scope): RegistryDefinition | null;\n  register(...definitions: any[]): any;\n}\n\nexport default class Registry implements RegistryInterface {\n  public static blots = new WeakMap<Node, Blot>();\n\n  public static find(node?: Node | null, bubble = false): Blot | null {\n    if (node == null) {\n      return null;\n    }\n    if (this.blots.has(node)) {\n      return this.blots.get(node) || null;\n    }\n    if (bubble) {\n      let parentNode: Node | null = null;\n      try {\n        parentNode = node.parentNode;\n      } catch (err) {\n        // Probably hit a permission denied error.\n        // A known case is in Firefox, event targets can be anonymous DIVs\n        // inside an input element.\n        // https://bugzilla.mozilla.org/show_bug.cgi?id=208427\n        return null;\n      }\n      return this.find(parentNode, bubble);\n    }\n    return null;\n  }\n\n  private attributes: { [key: string]: Attributor } = {};\n  private classes: { [key: string]: BlotConstructor } = {};\n  private tags: { [key: string]: BlotConstructor } = {};\n  private types: { [key: string]: RegistryDefinition } = {};\n\n  public create(scroll: Root, input: Node | string | Scope, value?: any): Blot {\n    const match = this.query(input);\n    if (match == null) {\n      throw new ParchmentError(`Unable to create ${input} blot`);\n    }\n    const blotClass = match as BlotConstructor;\n    const node =\n      // @ts-expect-error Fix me later\n      input instanceof Node || input.nodeType === Node.TEXT_NODE\n        ? input\n        : blotClass.create(value);\n\n    const blot = new blotClass(scroll, node as Node, value);\n    Registry.blots.set(blot.domNode, blot);\n    return blot;\n  }\n\n  public find(node: Node | null, bubble = false): Blot | null {\n    return Registry.find(node, bubble);\n  }\n\n  public query(\n    query: string | Node | Scope,\n    scope: Scope = Scope.ANY,\n  ): RegistryDefinition | null {\n    let match;\n    if (typeof query === 'string') {\n      match = this.types[query] || this.attributes[query];\n      // @ts-expect-error Fix me later\n    } else if (query instanceof Text || query.nodeType === Node.TEXT_NODE) {\n      match = this.types.text;\n    } else if (typeof query === 'number') {\n      if (query & Scope.LEVEL & Scope.BLOCK) {\n        match = this.types.block;\n      } else if (query & Scope.LEVEL & Scope.INLINE) {\n        match = this.types.inline;\n      }\n    } else if (query instanceof Element) {\n      const names = (query.getAttribute('class') || '').split(/\\s+/);\n      names.some((name) => {\n        match = this.classes[name];\n        if (match) {\n          return true;\n        }\n        return false;\n      });\n      match = match || this.tags[query.tagName];\n    }\n    if (match == null) {\n      return null;\n    }\n    if (\n      'scope' in match &&\n      scope & Scope.LEVEL & match.scope &&\n      scope & Scope.TYPE & match.scope\n    ) {\n      return match;\n    }\n    return null;\n  }\n\n  public register(...definitions: RegistryDefinition[]): RegistryDefinition[] {\n    return definitions.map((definition) => {\n      const isBlot = 'blotName' in definition;\n      const isAttr = 'attrName' in definition;\n      if (!isBlot && !isAttr) {\n        throw new ParchmentError('Invalid definition');\n      } else if (isBlot && definition.blotName === 'abstract') {\n        throw new ParchmentError('Cannot register abstract class');\n      }\n      const key = isBlot\n        ? definition.blotName\n        : isAttr\n        ? definition.attrName\n        : (undefined as never); // already handled by above checks\n      this.types[key] = definition;\n\n      if (isAttr) {\n        if (typeof definition.keyName === 'string') {\n          this.attributes[definition.keyName] = definition;\n        }\n      } else if (isBlot) {\n        if (definition.className) {\n          this.classes[definition.className] = definition;\n        }\n        if (definition.tagName) {\n          if (Array.isArray(definition.tagName)) {\n            definition.tagName = definition.tagName.map((tagName: string) => {\n              return tagName.toUpperCase();\n            });\n          } else {\n            definition.tagName = definition.tagName.toUpperCase();\n          }\n          const tagNames = Array.isArray(definition.tagName)\n            ? definition.tagName\n            : [definition.tagName];\n          tagNames.forEach((tag: string) => {\n            if (this.tags[tag] == null || definition.className == null) {\n              this.tags[tag] = definition;\n            }\n          });\n        }\n      }\n      return definition;\n    });\n  }\n}\n","import Attributor from './attributor.js';\n\nfunction match(node: HTMLElement, prefix: string): string[] {\n  const className = node.getAttribute('class') || '';\n  return className\n    .split(/\\s+/)\n    .filter((name) => name.indexOf(`${prefix}-`) === 0);\n}\n\nclass ClassAttributor extends Attributor {\n  public static keys(node: HTMLElement): string[] {\n    return (node.getAttribute('class') || '')\n      .split(/\\s+/)\n      .map((name) => name.split('-').slice(0, -1).join('-'));\n  }\n\n  public add(node: HTMLElement, value: any): boolean {\n    if (!this.canAdd(node, value)) {\n      return false;\n    }\n    this.remove(node);\n    node.classList.add(`${this.keyName}-${value}`);\n    return true;\n  }\n\n  public remove(node: HTMLElement): void {\n    const matches = match(node, this.keyName);\n    matches.forEach((name) => {\n      node.classList.remove(name);\n    });\n    if (node.classList.length === 0) {\n      node.removeAttribute('class');\n    }\n  }\n\n  public value(node: HTMLElement): any {\n    const result = match(node, this.keyName)[0] || '';\n    const value = result.slice(this.keyName.length + 1); // +1 for hyphen\n    return this.canAdd(node, value) ? value : '';\n  }\n}\n\nexport default ClassAttributor;\n","import Attributor from './attributor.js';\n\nfunction camelize(name: string): string {\n  const parts = name.split('-');\n  const rest = parts\n    .slice(1)\n    .map((part: string) => part[0].toUpperCase() + part.slice(1))\n    .join('');\n  return parts[0] + rest;\n}\n\nclass StyleAttributor extends Attributor {\n  public static keys(node: HTMLElement): string[] {\n    return (node.getAttribute('style') || '').split(';').map((value) => {\n      const arr = value.split(':');\n      return arr[0].trim();\n    });\n  }\n\n  public add(node: HTMLElement, value: any): boolean {\n    if (!this.canAdd(node, value)) {\n      return false;\n    }\n    // @ts-expect-error Fix me later\n    node.style[camelize(this.keyName)] = value;\n    return true;\n  }\n\n  public remove(node: HTMLElement): void {\n    // @ts-expect-error Fix me later\n    node.style[camelize(this.keyName)] = '';\n    if (!node.getAttribute('style')) {\n      node.removeAttribute('style');\n    }\n  }\n\n  public value(node: HTMLElement): any {\n    // @ts-expect-error Fix me later\n    const value = node.style[camelize(this.keyName)];\n    return this.canAdd(node, value) ? value : '';\n  }\n}\n\nexport default StyleAttributor;\n","import type { Formattable } from '../blot/abstract/blot.js';\nimport Registry from '../registry.js';\nimport Scope from '../scope.js';\nimport Attributor from './attributor.js';\nimport ClassAttributor from './class.js';\nimport StyleAttributor from './style.js';\n\nclass AttributorStore {\n  private attributes: { [key: string]: Attributor } = {};\n  private domNode: HTMLElement;\n\n  constructor(domNode: HTMLElement) {\n    this.domNode = domNode;\n    this.build();\n  }\n\n  public attribute(attribute: Attributor, value: any): void {\n    // verb\n    if (value) {\n      if (attribute.add(this.domNode, value)) {\n        if (attribute.value(this.domNode) != null) {\n          this.attributes[attribute.attrName] = attribute;\n        } else {\n          delete this.attributes[attribute.attrName];\n        }\n      }\n    } else {\n      attribute.remove(this.domNode);\n      delete this.attributes[attribute.attrName];\n    }\n  }\n\n  public build(): void {\n    this.attributes = {};\n    const blot = Registry.find(this.domNode);\n    if (blot == null) {\n      return;\n    }\n    const attributes = Attributor.keys(this.domNode);\n    const classes = ClassAttributor.keys(this.domNode);\n    const styles = StyleAttributor.keys(this.domNode);\n    attributes\n      .concat(classes)\n      .concat(styles)\n      .forEach((name) => {\n        const attr = blot.scroll.query(name, Scope.ATTRIBUTE);\n        if (attr instanceof Attributor) {\n          this.attributes[attr.attrName] = attr;\n        }\n      });\n  }\n\n  public copy(target: Formattable): void {\n    Object.keys(this.attributes).forEach((key) => {\n      const value = this.attributes[key].value(this.domNode);\n      target.format(key, value);\n    });\n  }\n\n  public move(target: Formattable): void {\n    this.copy(target);\n    Object.keys(this.attributes).forEach((key) => {\n      this.attributes[key].remove(this.domNode);\n    });\n    this.attributes = {};\n  }\n\n  public values(): { [key: string]: any } {\n    return Object.keys(this.attributes).reduce(\n      (attributes: { [key: string]: any }, name: string) => {\n        attributes[name] = this.attributes[name].value(this.domNode);\n        return attributes;\n      },\n      {},\n    );\n  }\n}\n\nexport default AttributorStore;\n","import ParchmentError from '../../error.js';\nimport Registry from '../../registry.js';\nimport Scope from '../../scope.js';\nimport type {\n  Blot,\n  BlotConstructor,\n  Formattable,\n  Parent,\n  Root,\n} from './blot.js';\n\nclass ShadowBlot implements Blot {\n  public static blotName = 'abstract';\n  public static className: string;\n  public static requiredContainer: BlotConstructor;\n  public static scope: Scope;\n  public static tagName: string | string[];\n\n  public static create(rawValue?: unknown): Node {\n    if (this.tagName == null) {\n      throw new ParchmentError('Blot definition missing tagName');\n    }\n    let node: HTMLElement;\n    let value: string | number | undefined;\n    if (Array.isArray(this.tagName)) {\n      if (typeof rawValue === 'string') {\n        value = rawValue.toUpperCase();\n        if (parseInt(value, 10).toString() === value) {\n          value = parseInt(value, 10);\n        }\n      } else if (typeof rawValue === 'number') {\n        value = rawValue;\n      }\n      if (typeof value === 'number') {\n        node = document.createElement(this.tagName[value - 1]);\n      } else if (value && this.tagName.indexOf(value) > -1) {\n        node = document.createElement(value);\n      } else {\n        node = document.createElement(this.tagName[0]);\n      }\n    } else {\n      node = document.createElement(this.tagName);\n    }\n    if (this.className) {\n      node.classList.add(this.className);\n    }\n    return node;\n  }\n\n  public prev: Blot | null;\n  public next: Blot | null;\n  // @ts-expect-error Fix me later\n  public parent: Parent;\n\n  // Hack for accessing inherited static methods\n  get statics(): any {\n    return this.constructor;\n  }\n  constructor(\n    public scroll: Root,\n    public domNode: Node,\n  ) {\n    Registry.blots.set(domNode, this);\n    this.prev = null;\n    this.next = null;\n  }\n\n  public attach(): void {\n    // Nothing to do\n  }\n\n  public clone(): Blot {\n    const domNode = this.domNode.cloneNode(false);\n    return this.scroll.create(domNode);\n  }\n\n  public detach(): void {\n    if (this.parent != null) {\n      this.parent.removeChild(this);\n    }\n    Registry.blots.delete(this.domNode);\n  }\n\n  public deleteAt(index: number, length: number): void {\n    const blot = this.isolate(index, length);\n    blot.remove();\n  }\n\n  public formatAt(\n    index: number,\n    length: number,\n    name: string,\n    value: any,\n  ): void {\n    const blot = this.isolate(index, length);\n    if (this.scroll.query(name, Scope.BLOT) != null && value) {\n      blot.wrap(name, value);\n    } else if (this.scroll.query(name, Scope.ATTRIBUTE) != null) {\n      const parent = this.scroll.create(this.statics.scope) as Parent &\n        Formattable;\n      blot.wrap(parent);\n      parent.format(name, value);\n    }\n  }\n\n  public insertAt(index: number, value: string, def?: any): void {\n    const blot =\n      def == null\n        ? this.scroll.create('text', value)\n        : this.scroll.create(value, def);\n    const ref = this.split(index);\n    this.parent.insertBefore(blot, ref || undefined);\n  }\n\n  public isolate(index: number, length: number): Blot {\n    const target = this.split(index);\n    if (target == null) {\n      throw new Error('Attempt to isolate at end');\n    }\n    target.split(length);\n    return target;\n  }\n\n  public length(): number {\n    return 1;\n  }\n\n  public offset(root: Blot = this.parent): number {\n    if (this.parent == null || this === root) {\n      return 0;\n    }\n    return this.parent.children.offset(this) + this.parent.offset(root);\n  }\n\n  public optimize(_context?: { [key: string]: any }): void {\n    if (\n      this.statics.requiredContainer &&\n      !(this.parent instanceof this.statics.requiredContainer)\n    ) {\n      this.wrap(this.statics.requiredContainer.blotName);\n    }\n  }\n\n  public remove(): void {\n    if (this.domNode.parentNode != null) {\n      this.domNode.parentNode.removeChild(this.domNode);\n    }\n    this.detach();\n  }\n\n  public replaceWith(name: string | Blot, value?: any): Blot {\n    const replacement =\n      typeof name === 'string' ? this.scroll.create(name, value) : name;\n    if (this.parent != null) {\n      this.parent.insertBefore(replacement, this.next || undefined);\n      this.remove();\n    }\n    return replacement;\n  }\n\n  public split(index: number, _force?: boolean): Blot | null {\n    return index === 0 ? this : this.next;\n  }\n\n  public update(\n    _mutations: MutationRecord[],\n    _context: { [key: string]: any },\n  ): void {\n    // Nothing to do by default\n  }\n\n  public wrap(name: string | Parent, value?: any): Parent {\n    const wrapper =\n      typeof name === 'string'\n        ? (this.scroll.create(name, value) as Parent)\n        : name;\n    if (this.parent != null) {\n      this.parent.insertBefore(wrapper, this.next || undefined);\n    }\n    if (typeof wrapper.appendChild !== 'function') {\n      throw new ParchmentError(`Cannot wrap ${name}`);\n    }\n    wrapper.appendChild(this);\n    return wrapper;\n  }\n}\n\nexport default ShadowBlot;\n","import Scope from '../../scope.js';\nimport type { Leaf } from './blot.js';\nimport ShadowBlot from './shadow.js';\n\nclass LeafBlot extends ShadowBlot implements Leaf {\n  public static scope = Scope.INLINE_BLOT;\n\n  /**\n   * Returns the value represented by domNode if it is this Blot's type\n   * No checking that domNode can represent this Blot type is required so\n   * applications needing it should check externally before calling.\n   */\n  public static value(_domNode: Node): any {\n    return true;\n  }\n\n  /**\n   * Given location represented by node and offset from DOM Selection Range,\n   * return index to that location.\n   */\n  public index(node: Node, offset: number): number {\n    if (\n      this.domNode === node ||\n      this.domNode.compareDocumentPosition(node) &\n        Node.DOCUMENT_POSITION_CONTAINED_BY\n    ) {\n      return Math.min(offset, 1);\n    }\n    return -1;\n  }\n\n  /**\n   * Given index to location within blot, return node and offset representing\n   * that location, consumable by DOM Selection Range\n   */\n  public position(index: number, _inclusive?: boolean): [Node, number] {\n    const childNodes: Node[] = Array.from(this.parent.domNode.childNodes);\n    let offset = childNodes.indexOf(this.domNode);\n    if (index > 0) {\n      offset += 1;\n    }\n    return [this.parent.domNode, offset];\n  }\n\n  /**\n   * Return value represented by this blot\n   * Should not change without interaction from API or\n   * user change detectable by update()\n   */\n  public value(): any {\n    return {\n      [this.statics.blotName]: this.statics.value(this.domNode) || true,\n    };\n  }\n}\n\nexport default LeafBlot;\n","import type LinkedNode from './linked-node.js';\n\nclass LinkedList<T extends LinkedNode> {\n  public head: T | null;\n  public tail: T | null;\n  public length: number;\n\n  constructor() {\n    this.head = null;\n    this.tail = null;\n    this.length = 0;\n  }\n\n  public append(...nodes: T[]): void {\n    this.insertBefore(nodes[0], null);\n    if (nodes.length > 1) {\n      const rest = nodes.slice(1);\n      this.append(...rest);\n    }\n  }\n\n  public at(index: number): T | null {\n    const next = this.iterator();\n    let cur = next();\n    while (cur && index > 0) {\n      index -= 1;\n      cur = next();\n    }\n    return cur;\n  }\n\n  public contains(node: T): boolean {\n    const next = this.iterator();\n    let cur = next();\n    while (cur) {\n      if (cur === node) {\n        return true;\n      }\n      cur = next();\n    }\n    return false;\n  }\n\n  public indexOf(node: T): number {\n    const next = this.iterator();\n    let cur = next();\n    let index = 0;\n    while (cur) {\n      if (cur === node) {\n        return index;\n      }\n      index += 1;\n      cur = next();\n    }\n    return -1;\n  }\n\n  public insertBefore(node: T | null, refNode: T | null): void {\n    if (node == null) {\n      return;\n    }\n    this.remove(node);\n    node.next = refNode;\n    if (refNode != null) {\n      node.prev = refNode.prev;\n      if (refNode.prev != null) {\n        refNode.prev.next = node;\n      }\n      refNode.prev = node;\n      if (refNode === this.head) {\n        this.head = node;\n      }\n    } else if (this.tail != null) {\n      this.tail.next = node;\n      node.prev = this.tail;\n      this.tail = node;\n    } else {\n      node.prev = null;\n      this.head = this.tail = node;\n    }\n    this.length += 1;\n  }\n\n  public offset(target: T): number {\n    let index = 0;\n    let cur = this.head;\n    while (cur != null) {\n      if (cur === target) {\n        return index;\n      }\n      index += cur.length();\n      cur = cur.next as T;\n    }\n    return -1;\n  }\n\n  public remove(node: T): void {\n    if (!this.contains(node)) {\n      return;\n    }\n    if (node.prev != null) {\n      node.prev.next = node.next;\n    }\n    if (node.next != null) {\n      node.next.prev = node.prev;\n    }\n    if (node === this.head) {\n      this.head = node.next as T;\n    }\n    if (node === this.tail) {\n      this.tail = node.prev as T;\n    }\n    this.length -= 1;\n  }\n\n  public iterator(curNode: T | null = this.head): () => T | null {\n    // TODO use yield when we can\n    return (): T | null => {\n      const ret = curNode;\n      if (curNode != null) {\n        curNode = curNode.next as T;\n      }\n      return ret;\n    };\n  }\n\n  public find(index: number, inclusive = false): [T | null, number] {\n    const next = this.iterator();\n    let cur = next();\n    while (cur) {\n      const length = cur.length();\n      if (\n        index < length ||\n        (inclusive &&\n          index === length &&\n          (cur.next == null || cur.next.length() !== 0))\n      ) {\n        return [cur, index];\n      }\n      index -= length;\n      cur = next();\n    }\n    return [null, 0];\n  }\n\n  public forEach(callback: (cur: T) => void): void {\n    const next = this.iterator();\n    let cur = next();\n    while (cur) {\n      callback(cur);\n      cur = next();\n    }\n  }\n\n  public forEachAt(\n    index: number,\n    length: number,\n    callback: (cur: T, offset: number, length: number) => void,\n  ): void {\n    if (length <= 0) {\n      return;\n    }\n    const [startNode, offset] = this.find(index);\n    let curIndex = index - offset;\n    const next = this.iterator(startNode);\n    let cur = next();\n    while (cur && curIndex < index + length) {\n      const curLength = cur.length();\n      if (index > curIndex) {\n        callback(\n          cur,\n          index - curIndex,\n          Math.min(length, curIndex + curLength - index),\n        );\n      } else {\n        callback(cur, 0, Math.min(curLength, index + length - curIndex));\n      }\n      curIndex += curLength;\n      cur = next();\n    }\n  }\n\n  public map(callback: (cur: T) => any): any[] {\n    return this.reduce((memo: T[], cur: T) => {\n      memo.push(callback(cur));\n      return memo;\n    }, []);\n  }\n\n  public reduce<M>(callback: (memo: M, cur: T) => M, memo: M): M {\n    const next = this.iterator();\n    let cur = next();\n    while (cur) {\n      memo = callback(memo, cur);\n      cur = next();\n    }\n    return memo;\n  }\n}\n\nexport default LinkedList;\n","import LinkedList from '../../collection/linked-list.js';\nimport ParchmentError from '../../error.js';\nimport Scope from '../../scope.js';\nimport type { Blot, BlotConstructor, Parent, Root } from './blot.js';\nimport ShadowBlot from './shadow.js';\n\nfunction makeAttachedBlot(node: Node, scroll: Root): Blot {\n  const found = scroll.find(node);\n  if (found) return found;\n  try {\n    return scroll.create(node);\n  } catch (e) {\n    const blot = scroll.create(Scope.INLINE);\n    Array.from(node.childNodes).forEach((child: Node) => {\n      blot.domNode.appendChild(child);\n    });\n    if (node.parentNode) {\n      node.parentNode.replaceChild(blot.domNode, node);\n    }\n    blot.attach();\n    return blot;\n  }\n}\n\nclass ParentBlot extends ShadowBlot implements Parent {\n  /**\n   * Whitelist array of Blots that can be direct children.\n   */\n  public static allowedChildren?: BlotConstructor[];\n\n  /**\n   * Default child blot to be inserted if this blot becomes empty.\n   */\n  public static defaultChild?: BlotConstructor;\n  public static uiClass = '';\n\n  public children!: LinkedList<Blot>;\n  public domNode!: HTMLElement;\n  public uiNode: HTMLElement | null = null;\n\n  constructor(scroll: Root, domNode: Node) {\n    super(scroll, domNode);\n    this.build();\n  }\n\n  public appendChild(other: Blot): void {\n    this.insertBefore(other);\n  }\n\n  public attach(): void {\n    super.attach();\n    this.children.forEach((child) => {\n      child.attach();\n    });\n  }\n\n  public attachUI(node: HTMLElement): void {\n    if (this.uiNode != null) {\n      this.uiNode.remove();\n    }\n    this.uiNode = node;\n    if (ParentBlot.uiClass) {\n      this.uiNode.classList.add(ParentBlot.uiClass);\n    }\n    this.uiNode.setAttribute('contenteditable', 'false');\n    this.domNode.insertBefore(this.uiNode, this.domNode.firstChild);\n  }\n\n  /**\n   * Called during construction, should fill its own children LinkedList.\n   */\n  public build(): void {\n    this.children = new LinkedList<Blot>();\n    // Need to be reversed for if DOM nodes already in order\n    Array.from(this.domNode.childNodes)\n      .filter((node: Node) => node !== this.uiNode)\n      .reverse()\n      .forEach((node: Node) => {\n        try {\n          const child = makeAttachedBlot(node, this.scroll);\n          this.insertBefore(child, this.children.head || undefined);\n        } catch (err) {\n          if (err instanceof ParchmentError) {\n            return;\n          } else {\n            throw err;\n          }\n        }\n      });\n  }\n\n  public deleteAt(index: number, length: number): void {\n    if (index === 0 && length === this.length()) {\n      return this.remove();\n    }\n    this.children.forEachAt(index, length, (child, offset, childLength) => {\n      child.deleteAt(offset, childLength);\n    });\n  }\n\n  public descendant<T extends Blot>(\n    criteria: new (...args: any[]) => T,\n    index: number,\n  ): [T | null, number];\n  public descendant(\n    criteria: (blot: Blot) => boolean,\n    index: number,\n  ): [Blot | null, number];\n  public descendant(criteria: any, index = 0): [Blot | null, number] {\n    const [child, offset] = this.children.find(index);\n    if (\n      (criteria.blotName == null && criteria(child)) ||\n      (criteria.blotName != null && child instanceof criteria)\n    ) {\n      return [child as any, offset];\n    } else if (child instanceof ParentBlot) {\n      return child.descendant(criteria, offset);\n    } else {\n      return [null, -1];\n    }\n  }\n\n  public descendants<T extends Blot>(\n    criteria: new (...args: any[]) => T,\n    index?: number,\n    length?: number,\n  ): T[];\n  public descendants(\n    criteria: (blot: Blot) => boolean,\n    index?: number,\n    length?: number,\n  ): Blot[];\n  public descendants(\n    criteria: any,\n    index = 0,\n    length: number = Number.MAX_VALUE,\n  ): Blot[] {\n    let descendants: Blot[] = [];\n    let lengthLeft = length;\n    this.children.forEachAt(\n      index,\n      length,\n      (child: Blot, childIndex: number, childLength: number) => {\n        if (\n          (criteria.blotName == null && criteria(child)) ||\n          (criteria.blotName != null && child instanceof criteria)\n        ) {\n          descendants.push(child);\n        }\n        if (child instanceof ParentBlot) {\n          descendants = descendants.concat(\n            child.descendants(criteria, childIndex, lengthLeft),\n          );\n        }\n        lengthLeft -= childLength;\n      },\n    );\n    return descendants;\n  }\n\n  public detach(): void {\n    this.children.forEach((child) => {\n      child.detach();\n    });\n    super.detach();\n  }\n\n  public enforceAllowedChildren(): void {\n    let done = false;\n    this.children.forEach((child: Blot) => {\n      if (done) {\n        return;\n      }\n      const allowed = this.statics.allowedChildren.some(\n        (def: BlotConstructor) => child instanceof def,\n      );\n      if (allowed) {\n        return;\n      }\n      if (child.statics.scope === Scope.BLOCK_BLOT) {\n        if (child.next != null) {\n          this.splitAfter(child);\n        }\n        if (child.prev != null) {\n          this.splitAfter(child.prev);\n        }\n        child.parent.unwrap();\n        done = true;\n      } else if (child instanceof ParentBlot) {\n        child.unwrap();\n      } else {\n        child.remove();\n      }\n    });\n  }\n\n  public formatAt(\n    index: number,\n    length: number,\n    name: string,\n    value: any,\n  ): void {\n    this.children.forEachAt(index, length, (child, offset, childLength) => {\n      child.formatAt(offset, childLength, name, value);\n    });\n  }\n\n  public insertAt(index: number, value: string, def?: any): void {\n    const [child, offset] = this.children.find(index);\n    if (child) {\n      child.insertAt(offset, value, def);\n    } else {\n      const blot =\n        def == null\n          ? this.scroll.create('text', value)\n          : this.scroll.create(value, def);\n      this.appendChild(blot);\n    }\n  }\n\n  public insertBefore(childBlot: Blot, refBlot?: Blot | null): void {\n    if (childBlot.parent != null) {\n      childBlot.parent.children.remove(childBlot);\n    }\n    let refDomNode: Node | null = null;\n    this.children.insertBefore(childBlot, refBlot || null);\n    childBlot.parent = this;\n    if (refBlot != null) {\n      refDomNode = refBlot.domNode;\n    }\n    if (\n      this.domNode.parentNode !== childBlot.domNode ||\n      this.domNode.nextSibling !== refDomNode\n    ) {\n      this.domNode.insertBefore(childBlot.domNode, refDomNode);\n    }\n    childBlot.attach();\n  }\n\n  public length(): number {\n    return this.children.reduce((memo, child) => {\n      return memo + child.length();\n    }, 0);\n  }\n\n  public moveChildren(targetParent: Parent, refNode?: Blot): void {\n    this.children.forEach((child) => {\n      targetParent.insertBefore(child, refNode);\n    });\n  }\n\n  public optimize(context?: { [key: string]: any }): void {\n    super.optimize(context);\n    this.enforceAllowedChildren();\n    if (this.uiNode != null && this.uiNode !== this.domNode.firstChild) {\n      this.domNode.insertBefore(this.uiNode, this.domNode.firstChild);\n    }\n    if (this.children.length === 0) {\n      if (this.statics.defaultChild != null) {\n        const child = this.scroll.create(this.statics.defaultChild.blotName);\n        this.appendChild(child);\n        // TODO double check if necessary\n        // child.optimize(context);\n      } else {\n        this.remove();\n      }\n    }\n  }\n\n  public path(index: number, inclusive = false): [Blot, number][] {\n    const [child, offset] = this.children.find(index, inclusive);\n    const position: [Blot, number][] = [[this, index]];\n    if (child instanceof ParentBlot) {\n      return position.concat(child.path(offset, inclusive));\n    } else if (child != null) {\n      position.push([child, offset]);\n    }\n    return position;\n  }\n\n  public removeChild(child: Blot): void {\n    this.children.remove(child);\n  }\n\n  public replaceWith(name: string | Blot, value?: any): Blot {\n    const replacement =\n      typeof name === 'string' ? this.scroll.create(name, value) : name;\n    if (replacement instanceof ParentBlot) {\n      this.moveChildren(replacement);\n    }\n    return super.replaceWith(replacement);\n  }\n\n  public split(index: number, force = false): Blot | null {\n    if (!force) {\n      if (index === 0) {\n        return this;\n      }\n      if (index === this.length()) {\n        return this.next;\n      }\n    }\n    const after = this.clone() as ParentBlot;\n    if (this.parent) {\n      this.parent.insertBefore(after, this.next || undefined);\n    }\n    this.children.forEachAt(index, this.length(), (child, offset, _length) => {\n      const split = child.split(offset, force);\n      if (split != null) {\n        after.appendChild(split);\n      }\n    });\n    return after;\n  }\n\n  public splitAfter(child: Blot): Parent {\n    const after = this.clone() as ParentBlot;\n    while (child.next != null) {\n      after.appendChild(child.next);\n    }\n    if (this.parent) {\n      this.parent.insertBefore(after, this.next || undefined);\n    }\n    return after;\n  }\n\n  public unwrap(): void {\n    if (this.parent) {\n      this.moveChildren(this.parent, this.next || undefined);\n    }\n    this.remove();\n  }\n\n  public update(\n    mutations: MutationRecord[],\n    _context: { [key: string]: any },\n  ): void {\n    const addedNodes: Node[] = [];\n    const removedNodes: Node[] = [];\n    mutations.forEach((mutation) => {\n      if (mutation.target === this.domNode && mutation.type === 'childList') {\n        addedNodes.push(...mutation.addedNodes);\n        removedNodes.push(...mutation.removedNodes);\n      }\n    });\n    removedNodes.forEach((node: Node) => {\n      // Check node has actually been removed\n      // One exception is Chrome does not immediately remove IFRAMEs\n      // from DOM but MutationRecord is correct in its reported removal\n      if (\n        node.parentNode != null &&\n        // @ts-expect-error Fix me later\n        node.tagName !== 'IFRAME' &&\n        document.body.compareDocumentPosition(node) &\n          Node.DOCUMENT_POSITION_CONTAINED_BY\n      ) {\n        return;\n      }\n      const blot = this.scroll.find(node);\n      if (blot == null) {\n        return;\n      }\n      if (\n        blot.domNode.parentNode == null ||\n        blot.domNode.parentNode === this.domNode\n      ) {\n        blot.detach();\n      }\n    });\n    addedNodes\n      .filter((node) => {\n        return node.parentNode === this.domNode && node !== this.uiNode;\n      })\n      .sort((a, b) => {\n        if (a === b) {\n          return 0;\n        }\n        if (a.compareDocumentPosition(b) & Node.DOCUMENT_POSITION_FOLLOWING) {\n          return 1;\n        }\n        return -1;\n      })\n      .forEach((node) => {\n        let refBlot: Blot | null = null;\n        if (node.nextSibling != null) {\n          refBlot = this.scroll.find(node.nextSibling);\n        }\n        const blot = makeAttachedBlot(node, this.scroll);\n        if (blot.next !== refBlot || blot.next == null) {\n          if (blot.parent != null) {\n            blot.parent.removeChild(this);\n          }\n          this.insertBefore(blot, refBlot || undefined);\n        }\n      });\n    this.enforceAllowedChildren();\n  }\n}\n\nexport default ParentBlot;\n","import Attributor from '../attributor/attributor.js';\nimport AttributorStore from '../attributor/store.js';\nimport Scope from '../scope.js';\nimport type {\n  Blot,\n  BlotConstructor,\n  Formattable,\n  Parent,\n  Root,\n} from './abstract/blot.js';\nimport LeafBlot from './abstract/leaf.js';\nimport ParentBlot from './abstract/parent.js';\n\n// Shallow object comparison\nfunction isEqual(\n  obj1: Record<string, unknown>,\n  obj2: Record<string, unknown>,\n): boolean {\n  if (Object.keys(obj1).length !== Object.keys(obj2).length) {\n    return false;\n  }\n  for (const prop in obj1) {\n    if (obj1[prop] !== obj2[prop]) {\n      return false;\n    }\n  }\n  return true;\n}\n\nclass InlineBlot extends ParentBlot implements Formattable {\n  public static allowedChildren: BlotConstructor[] = [InlineBlot, LeafBlot];\n  public static blotName = 'inline';\n  public static scope = Scope.INLINE_BLOT;\n  public static tagName: string | string[] = 'SPAN';\n\n  static create(value?: unknown) {\n    return super.create(value) as HTMLElement;\n  }\n\n  public static formats(domNode: HTMLElement, scroll: Root): any {\n    const match = scroll.query(InlineBlot.blotName);\n    if (\n      match != null &&\n      domNode.tagName === (match as BlotConstructor).tagName\n    ) {\n      return undefined;\n    } else if (typeof this.tagName === 'string') {\n      return true;\n    } else if (Array.isArray(this.tagName)) {\n      return domNode.tagName.toLowerCase();\n    }\n    return undefined;\n  }\n\n  protected attributes: AttributorStore;\n\n  constructor(scroll: Root, domNode: Node) {\n    super(scroll, domNode);\n    this.attributes = new AttributorStore(this.domNode);\n  }\n\n  public format(name: string, value: any): void {\n    if (name === this.statics.blotName && !value) {\n      this.children.forEach((child) => {\n        if (!(child instanceof InlineBlot)) {\n          child = child.wrap(InlineBlot.blotName, true);\n        }\n        this.attributes.copy(child as InlineBlot);\n      });\n      this.unwrap();\n    } else {\n      const format = this.scroll.query(name, Scope.INLINE);\n      if (format == null) {\n        return;\n      }\n      if (format instanceof Attributor) {\n        this.attributes.attribute(format, value);\n      } else if (\n        value &&\n        (name !== this.statics.blotName || this.formats()[name] !== value)\n      ) {\n        this.replaceWith(name, value);\n      }\n    }\n  }\n\n  public formats(): { [index: string]: any } {\n    const formats = this.attributes.values();\n    const format = this.statics.formats(this.domNode, this.scroll);\n    if (format != null) {\n      formats[this.statics.blotName] = format;\n    }\n    return formats;\n  }\n\n  public formatAt(\n    index: number,\n    length: number,\n    name: string,\n    value: any,\n  ): void {\n    if (\n      this.formats()[name] != null ||\n      this.scroll.query(name, Scope.ATTRIBUTE)\n    ) {\n      const blot = this.isolate(index, length) as InlineBlot;\n      blot.format(name, value);\n    } else {\n      super.formatAt(index, length, name, value);\n    }\n  }\n\n  public optimize(context: { [key: string]: any }): void {\n    super.optimize(context);\n    const formats = this.formats();\n    if (Object.keys(formats).length === 0) {\n      return this.unwrap(); // unformatted span\n    }\n    const next = this.next;\n    if (\n      next instanceof InlineBlot &&\n      next.prev === this &&\n      isEqual(formats, next.formats())\n    ) {\n      next.moveChildren(this);\n      next.remove();\n    }\n  }\n\n  public replaceWith(name: string | Blot, value?: any): Blot {\n    const replacement = super.replaceWith(name, value) as InlineBlot;\n    this.attributes.copy(replacement);\n    return replacement;\n  }\n\n  public update(\n    mutations: MutationRecord[],\n    context: { [key: string]: any },\n  ): void {\n    super.update(mutations, context);\n    const attributeChanged = mutations.some(\n      (mutation) =>\n        mutation.target === this.domNode && mutation.type === 'attributes',\n    );\n    if (attributeChanged) {\n      this.attributes.build();\n    }\n  }\n\n  public wrap(name: string | Parent, value?: any): Parent {\n    const wrapper = super.wrap(name, value);\n    if (wrapper instanceof InlineBlot) {\n      this.attributes.move(wrapper);\n    }\n    return wrapper;\n  }\n}\n\nexport default InlineBlot;\n","import Attributor from '../attributor/attributor.js';\nimport AttributorStore from '../attributor/store.js';\nimport Scope from '../scope.js';\nimport type {\n  Blot,\n  BlotConstructor,\n  Formattable,\n  Root,\n} from './abstract/blot.js';\nimport LeafBlot from './abstract/leaf.js';\nimport ParentBlot from './abstract/parent.js';\nimport InlineBlot from './inline.js';\n\nclass BlockBlot extends ParentBlot implements Formattable {\n  public static blotName = 'block';\n  public static scope = Scope.BLOCK_BLOT;\n  public static tagName: string | string[] = 'P';\n  public static allowedChildren: BlotConstructor[] = [\n    InlineBlot,\n    BlockBlot,\n    LeafBlot,\n  ];\n\n  static create(value?: unknown) {\n    return super.create(value) as HTMLElement;\n  }\n\n  public static formats(domNode: HTMLElement, scroll: Root): any {\n    const match = scroll.query(BlockBlot.blotName);\n    if (\n      match != null &&\n      domNode.tagName === (match as BlotConstructor).tagName\n    ) {\n      return undefined;\n    } else if (typeof this.tagName === 'string') {\n      return true;\n    } else if (Array.isArray(this.tagName)) {\n      return domNode.tagName.toLowerCase();\n    }\n  }\n\n  protected attributes: AttributorStore;\n\n  constructor(scroll: Root, domNode: Node) {\n    super(scroll, domNode);\n    this.attributes = new AttributorStore(this.domNode);\n  }\n\n  public format(name: string, value: any): void {\n    const format = this.scroll.query(name, Scope.BLOCK);\n    if (format == null) {\n      return;\n    } else if (format instanceof Attributor) {\n      this.attributes.attribute(format, value);\n    } else if (name === this.statics.blotName && !value) {\n      this.replaceWith(BlockBlot.blotName);\n    } else if (\n      value &&\n      (name !== this.statics.blotName || this.formats()[name] !== value)\n    ) {\n      this.replaceWith(name, value);\n    }\n  }\n\n  public formats(): { [index: string]: any } {\n    const formats = this.attributes.values();\n    const format = this.statics.formats(this.domNode, this.scroll);\n    if (format != null) {\n      formats[this.statics.blotName] = format;\n    }\n    return formats;\n  }\n\n  public formatAt(\n    index: number,\n    length: number,\n    name: string,\n    value: any,\n  ): void {\n    if (this.scroll.query(name, Scope.BLOCK) != null) {\n      this.format(name, value);\n    } else {\n      super.formatAt(index, length, name, value);\n    }\n  }\n\n  public insertAt(index: number, value: string, def?: any): void {\n    if (def == null || this.scroll.query(value, Scope.INLINE) != null) {\n      // Insert text or inline\n      super.insertAt(index, value, def);\n    } else {\n      const after = this.split(index);\n      if (after != null) {\n        const blot = this.scroll.create(value, def);\n        after.parent.insertBefore(blot, after);\n      } else {\n        throw new Error('Attempt to insertAt after block boundaries');\n      }\n    }\n  }\n\n  public replaceWith(name: string | Blot, value?: any): Blot {\n    const replacement = super.replaceWith(name, value) as BlockBlot;\n    this.attributes.copy(replacement);\n    return replacement;\n  }\n\n  public update(\n    mutations: MutationRecord[],\n    context: { [key: string]: any },\n  ): void {\n    super.update(mutations, context);\n    const attributeChanged = mutations.some(\n      (mutation) =>\n        mutation.target === this.domNode && mutation.type === 'attributes',\n    );\n    if (attributeChanged) {\n      this.attributes.build();\n    }\n  }\n}\n\nexport default BlockBlot;\n","import Scope from '../../scope.js';\nimport BlockBlot from '../block.js';\nimport ParentBlot from './parent.js';\n\nclass ContainerBlot extends ParentBlot {\n  public static blotName = 'container';\n  public static scope = Scope.BLOCK_BLOT;\n  public static tagName: string | string[];\n\n  public prev!: BlockBlot | ContainerBlot | null;\n  public next!: BlockBlot | ContainerBlot | null;\n\n  public checkMerge(): boolean {\n    return (\n      this.next !== null && this.next.statics.blotName === this.statics.blotName\n    );\n  }\n\n  public deleteAt(index: number, length: number): void {\n    super.deleteAt(index, length);\n    this.enforceAllowedChildren();\n  }\n\n  public formatAt(\n    index: number,\n    length: number,\n    name: string,\n    value: any,\n  ): void {\n    super.formatAt(index, length, name, value);\n    this.enforceAllowedChildren();\n  }\n\n  public insertAt(index: number, value: string, def?: any): void {\n    super.insertAt(index, value, def);\n    this.enforceAllowedChildren();\n  }\n\n  public optimize(context: { [key: string]: any }): void {\n    super.optimize(context);\n    if (this.children.length > 0 && this.next != null && this.checkMerge()) {\n      this.next.moveChildren(this);\n      this.next.remove();\n    }\n  }\n}\n\nexport default ContainerBlot;\n","import type { Formattable, Root } from './abstract/blot.js';\nimport LeafBlot from './abstract/leaf.js';\n\nclass EmbedBlot extends LeafBlot implements Formattable {\n  public static formats(_domNode: HTMLElement, _scroll: Root): any {\n    return undefined;\n  }\n\n  public format(name: string, value: any): void {\n    // super.formatAt wraps, which is what we want in general,\n    // but this allows subclasses to overwrite for formats\n    // that just apply to particular embeds\n    super.formatAt(0, this.length(), name, value);\n  }\n\n  public formatAt(\n    index: number,\n    length: number,\n    name: string,\n    value: any,\n  ): void {\n    if (index === 0 && length === this.length()) {\n      this.format(name, value);\n    } else {\n      super.formatAt(index, length, name, value);\n    }\n  }\n\n  public formats(): { [index: string]: any } {\n    return this.statics.formats(this.domNode, this.scroll);\n  }\n}\n\nexport default EmbedBlot;\n","import Registry, { type RegistryDefinition } from '../registry.js';\nimport Scope from '../scope.js';\nimport type { Blot, BlotConstructor, Root } from './abstract/blot.js';\nimport ContainerBlot from './abstract/container.js';\nimport ParentBlot from './abstract/parent.js';\nimport BlockBlot from './block.js';\n\nconst OBSERVER_CONFIG = {\n  attributes: true,\n  characterData: true,\n  characterDataOldValue: true,\n  childList: true,\n  subtree: true,\n};\n\nconst MAX_OPTIMIZE_ITERATIONS = 100;\n\nclass ScrollBlot extends ParentBlot implements Root {\n  public static blotName = 'scroll';\n  public static defaultChild = BlockBlot;\n  public static allowedChildren: BlotConstructor[] = [BlockBlot, ContainerBlot];\n  public static scope = Scope.BLOCK_BLOT;\n  public static tagName = 'DIV';\n\n  public observer: MutationObserver;\n\n  constructor(\n    public registry: Registry,\n    node: HTMLDivElement,\n  ) {\n    // @ts-expect-error scroll is the root with no parent\n    super(null, node);\n    this.scroll = this;\n    this.build();\n    this.observer = new MutationObserver((mutations: MutationRecord[]) => {\n      this.update(mutations);\n    });\n    this.observer.observe(this.domNode, OBSERVER_CONFIG);\n    this.attach();\n  }\n\n  public create(input: Node | string | Scope, value?: any): Blot {\n    return this.registry.create(this, input, value);\n  }\n\n  public find(node: Node | null, bubble = false): Blot | null {\n    const blot = this.registry.find(node, bubble);\n    if (!blot) {\n      return null;\n    }\n    if (blot.scroll === this) {\n      return blot;\n    }\n    return bubble ? this.find(blot.scroll.domNode.parentNode, true) : null;\n  }\n\n  public query(\n    query: string | Node | Scope,\n    scope: Scope = Scope.ANY,\n  ): RegistryDefinition | null {\n    return this.registry.query(query, scope);\n  }\n\n  public register(...definitions: RegistryDefinition[]) {\n    return this.registry.register(...definitions);\n  }\n\n  public build(): void {\n    if (this.scroll == null) {\n      return;\n    }\n    super.build();\n  }\n\n  public detach(): void {\n    super.detach();\n    this.observer.disconnect();\n  }\n\n  public deleteAt(index: number, length: number): void {\n    this.update();\n    if (index === 0 && length === this.length()) {\n      this.children.forEach((child) => {\n        child.remove();\n      });\n    } else {\n      super.deleteAt(index, length);\n    }\n  }\n\n  public formatAt(\n    index: number,\n    length: number,\n    name: string,\n    value: any,\n  ): void {\n    this.update();\n    super.formatAt(index, length, name, value);\n  }\n\n  public insertAt(index: number, value: string, def?: any): void {\n    this.update();\n    super.insertAt(index, value, def);\n  }\n\n  public optimize(context?: { [key: string]: any }): void;\n  public optimize(\n    mutations: MutationRecord[],\n    context: { [key: string]: any },\n  ): void;\n  public optimize(mutations: any = [], context: any = {}): void {\n    super.optimize(context);\n    const mutationsMap = context.mutationsMap || new WeakMap();\n    // We must modify mutations directly, cannot make copy and then modify\n    let records = Array.from(this.observer.takeRecords());\n    // Array.push currently seems to be implemented by a non-tail recursive function\n    // so we cannot just mutations.push.apply(mutations, this.observer.takeRecords());\n    while (records.length > 0) {\n      mutations.push(records.pop());\n    }\n    const mark = (blot: Blot | null, markParent = true): void => {\n      if (blot == null || blot === this) {\n        return;\n      }\n      if (blot.domNode.parentNode == null) {\n        return;\n      }\n      if (!mutationsMap.has(blot.domNode)) {\n        mutationsMap.set(blot.domNode, []);\n      }\n      if (markParent) {\n        mark(blot.parent);\n      }\n    };\n    const optimize = (blot: Blot): void => {\n      // Post-order traversal\n      if (!mutationsMap.has(blot.domNode)) {\n        return;\n      }\n      if (blot instanceof ParentBlot) {\n        blot.children.forEach(optimize);\n      }\n      mutationsMap.delete(blot.domNode);\n      blot.optimize(context);\n    };\n    let remaining = mutations;\n    for (let i = 0; remaining.length > 0; i += 1) {\n      if (i >= MAX_OPTIMIZE_ITERATIONS) {\n        throw new Error('[Parchment] Maximum optimize iterations reached');\n      }\n      remaining.forEach((mutation: MutationRecord) => {\n        const blot = this.find(mutation.target, true);\n        if (blot == null) {\n          return;\n        }\n        if (blot.domNode === mutation.target) {\n          if (mutation.type === 'childList') {\n            mark(this.find(mutation.previousSibling, false));\n            Array.from(mutation.addedNodes).forEach((node: Node) => {\n              const child = this.find(node, false);\n              mark(child, false);\n              if (child instanceof ParentBlot) {\n                child.children.forEach((grandChild: Blot) => {\n                  mark(grandChild, false);\n                });\n              }\n            });\n          } else if (mutation.type === 'attributes') {\n            mark(blot.prev);\n          }\n        }\n        mark(blot);\n      });\n      this.children.forEach(optimize);\n      remaining = Array.from(this.observer.takeRecords());\n      records = remaining.slice();\n      while (records.length > 0) {\n        mutations.push(records.pop());\n      }\n    }\n  }\n\n  public update(\n    mutations?: MutationRecord[],\n    context: { [key: string]: any } = {},\n  ): void {\n    mutations = mutations || this.observer.takeRecords();\n    const mutationsMap = new WeakMap();\n    mutations\n      .map((mutation: MutationRecord) => {\n        const blot = this.find(mutation.target, true);\n        if (blot == null) {\n          return null;\n        }\n        if (mutationsMap.has(blot.domNode)) {\n          mutationsMap.get(blot.domNode).push(mutation);\n          return null;\n        } else {\n          mutationsMap.set(blot.domNode, [mutation]);\n          return blot;\n        }\n      })\n      .forEach((blot: Blot | null) => {\n        if (blot != null && blot !== this && mutationsMap.has(blot.domNode)) {\n          blot.update(mutationsMap.get(blot.domNode) || [], context);\n        }\n      });\n    context.mutationsMap = mutationsMap;\n    if (mutationsMap.has(this.domNode)) {\n      super.update(mutationsMap.get(this.domNode), context);\n    }\n    this.optimize(mutations, context);\n  }\n}\n\nexport default ScrollBlot;\n","import Scope from '../scope.js';\nimport type { Blot, Leaf, Root } from './abstract/blot.js';\nimport LeafBlot from './abstract/leaf.js';\n\nclass TextBlot extends LeafBlot implements Leaf {\n  public static readonly blotName = 'text';\n  public static scope = Scope.INLINE_BLOT;\n\n  public static create(value: string): Text {\n    return document.createTextNode(value);\n  }\n\n  public static value(domNode: Text): string {\n    return domNode.data;\n  }\n\n  public domNode!: Text;\n  protected text: string;\n\n  constructor(scroll: Root, node: Node) {\n    super(scroll, node);\n    this.text = this.statics.value(this.domNode);\n  }\n\n  public deleteAt(index: number, length: number): void {\n    this.domNode.data = this.text =\n      this.text.slice(0, index) + this.text.slice(index + length);\n  }\n\n  public index(node: Node, offset: number): number {\n    if (this.domNode === node) {\n      return offset;\n    }\n    return -1;\n  }\n\n  public insertAt(index: number, value: string, def?: any): void {\n    if (def == null) {\n      this.text = this.text.slice(0, index) + value + this.text.slice(index);\n      this.domNode.data = this.text;\n    } else {\n      super.insertAt(index, value, def);\n    }\n  }\n\n  public length(): number {\n    return this.text.length;\n  }\n\n  public optimize(context: { [key: string]: any }): void {\n    super.optimize(context);\n    this.text = this.statics.value(this.domNode);\n    if (this.text.length === 0) {\n      this.remove();\n    } else if (this.next instanceof TextBlot && this.next.prev === this) {\n      this.insertAt(this.length(), (this.next as TextBlot).value());\n      this.next.remove();\n    }\n  }\n\n  public position(index: number, _inclusive = false): [Node, number] {\n    return [this.domNode, index];\n  }\n\n  public split(index: number, force = false): Blot | null {\n    if (!force) {\n      if (index === 0) {\n        return this;\n      }\n      if (index === this.length()) {\n        return this.next;\n      }\n    }\n    const after = this.scroll.create(this.domNode.splitText(index));\n    this.parent.insertBefore(after, this.next || undefined);\n    this.text = this.statics.value(this.domNode);\n    return after;\n  }\n\n  public update(\n    mutations: MutationRecord[],\n    _context: { [key: string]: any },\n  ): void {\n    if (\n      mutations.some((mutation) => {\n        return (\n          mutation.type === 'characterData' && mutation.target === this.domNode\n        );\n      })\n    ) {\n      this.text = this.statics.value(this.domNode);\n    }\n  }\n\n  public value(): string {\n    return this.text;\n  }\n}\n\nexport default TextBlot;\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](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","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = function(module) {\n\tvar getter = module && module.__esModule ?\n\t\tfunction() { return module['default']; } :\n\t\tfunction() { return module; };\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = function(exports, definition) {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\n\t}\n})();","__webpack_require__.o = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); }","// define __esModule on exports\n__webpack_require__.r = function(exports) {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","__webpack_require__.nmd = function(module) {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","import { ContainerBlot, LeafBlot, Scope, ScrollBlot } from 'parchment';\nimport type { Blot, Parent, EmbedBlot, ParentBlot, Registry } from 'parchment';\nimport Delta, { AttributeMap, Op } from 'quill-delta';\nimport Emitter from '../core/emitter.js';\nimport type { EmitterSource } from '../core/emitter.js';\nimport Block, { BlockEmbed, bubbleFormats } from './block.js';\nimport Break from './break.js';\nimport Container from './container.js';\n\ntype RenderBlock =\n  | {\n      type: 'blockEmbed';\n      attributes: AttributeMap;\n      key: string;\n      value: unknown;\n    }\n  | { type: 'block'; attributes: AttributeMap; delta: Delta };\n\nfunction isLine(blot: unknown): blot is Block | BlockEmbed {\n  return blot instanceof Block || blot instanceof BlockEmbed;\n}\n\ninterface UpdatableEmbed {\n  updateContent(change: unknown): void;\n}\n\nfunction isUpdatable(blot: Blot): blot is Blot & UpdatableEmbed {\n  return typeof (blot as unknown as any).updateContent === 'function';\n}\n\nclass Scroll extends ScrollBlot {\n  static blotName = 'scroll';\n  static className = 'ql-editor';\n  static tagName = 'DIV';\n  static defaultChild = Block;\n  static allowedChildren = [Block, BlockEmbed, Container];\n\n  emitter: Emitter;\n  batch: false | MutationRecord[];\n\n  constructor(\n    registry: Registry,\n    domNode: HTMLDivElement,\n    { emitter }: { emitter: Emitter },\n  ) {\n    super(registry, domNode);\n    this.emitter = emitter;\n    this.batch = false;\n    this.optimize();\n    this.enable();\n    this.domNode.addEventListener('dragstart', (e) => this.handleDragStart(e));\n  }\n\n  batchStart() {\n    if (!Array.isArray(this.batch)) {\n      this.batch = [];\n    }\n  }\n\n  batchEnd() {\n    if (!this.batch) return;\n    const mutations = this.batch;\n    this.batch = false;\n    this.update(mutations);\n  }\n\n  emitMount(blot: Blot) {\n    this.emitter.emit(Emitter.events.SCROLL_BLOT_MOUNT, blot);\n  }\n\n  emitUnmount(blot: Blot) {\n    this.emitter.emit(Emitter.events.SCROLL_BLOT_UNMOUNT, blot);\n  }\n\n  emitEmbedUpdate(blot: Blot, change: unknown) {\n    this.emitter.emit(Emitter.events.SCROLL_EMBED_UPDATE, blot, change);\n  }\n\n  deleteAt(index: number, length: number) {\n    const [first, offset] = this.line(index);\n    const [last] = this.line(index + length);\n    super.deleteAt(index, length);\n    if (last != null && first !== last && offset > 0) {\n      if (first instanceof BlockEmbed || last instanceof BlockEmbed) {\n        this.optimize();\n        return;\n      }\n      const ref =\n        last.children.head instanceof Break ? null : last.children.head;\n      // @ts-expect-error\n      first.moveChildren(last, ref);\n      // @ts-expect-error\n      first.remove();\n    }\n    this.optimize();\n  }\n\n  enable(enabled = true) {\n    this.domNode.setAttribute('contenteditable', enabled ? 'true' : 'false');\n  }\n\n  formatAt(index: number, length: number, format: string, value: unknown) {\n    super.formatAt(index, length, format, value);\n    this.optimize();\n  }\n\n  insertAt(index: number, value: string, def?: unknown) {\n    if (index >= this.length()) {\n      if (def == null || this.scroll.query(value, Scope.BLOCK) == null) {\n        const blot = this.scroll.create(this.statics.defaultChild.blotName);\n        this.appendChild(blot);\n        if (def == null && value.endsWith('\\n')) {\n          blot.insertAt(0, value.slice(0, -1), def);\n        } else {\n          blot.insertAt(0, value, def);\n        }\n      } else {\n        const embed = this.scroll.create(value, def);\n        this.appendChild(embed);\n      }\n    } else {\n      super.insertAt(index, value, def);\n    }\n    this.optimize();\n  }\n\n  insertBefore(blot: Blot, ref?: Blot) {\n    if (blot.statics.scope === Scope.INLINE_BLOT) {\n      const wrapper = this.scroll.create(\n        this.statics.defaultChild.blotName,\n      ) as Parent;\n      wrapper.appendChild(blot);\n      super.insertBefore(wrapper, ref);\n    } else {\n      super.insertBefore(blot, ref);\n    }\n  }\n\n  insertContents(index: number, delta: Delta) {\n    const renderBlocks = this.deltaToRenderBlocks(\n      delta.concat(new Delta().insert('\\n')),\n    );\n    const last = renderBlocks.pop();\n    if (last == null) return;\n\n    this.batchStart();\n\n    const first = renderBlocks.shift();\n    if (first) {\n      const shouldInsertNewlineChar =\n        first.type === 'block' &&\n        (first.delta.length() === 0 ||\n          (!this.descendant(BlockEmbed, index)[0] && index < this.length()));\n      const delta =\n        first.type === 'block'\n          ? first.delta\n          : new Delta().insert({ [first.key]: first.value });\n      insertInlineContents(this, index, delta);\n      const newlineCharLength = first.type === 'block' ? 1 : 0;\n      const lineEndIndex = index + delta.length() + newlineCharLength;\n      if (shouldInsertNewlineChar) {\n        this.insertAt(lineEndIndex - 1, '\\n');\n      }\n\n      const formats = bubbleFormats(this.line(index)[0]);\n      const attributes = AttributeMap.diff(formats, first.attributes) || {};\n      Object.keys(attributes).forEach((name) => {\n        this.formatAt(lineEndIndex - 1, 1, name, attributes[name]);\n      });\n\n      index = lineEndIndex;\n    }\n\n    let [refBlot, refBlotOffset] = this.children.find(index);\n    if (renderBlocks.length) {\n      if (refBlot) {\n        refBlot = refBlot.split(refBlotOffset);\n        refBlotOffset = 0;\n      }\n\n      renderBlocks.forEach((renderBlock) => {\n        if (renderBlock.type === 'block') {\n          const block = this.createBlock(\n            renderBlock.attributes,\n            refBlot || undefined,\n          );\n          insertInlineContents(block, 0, renderBlock.delta);\n        } else {\n          const blockEmbed = this.create(\n            renderBlock.key,\n            renderBlock.value,\n          ) as EmbedBlot;\n          this.insertBefore(blockEmbed, refBlot || undefined);\n          Object.keys(renderBlock.attributes).forEach((name) => {\n            blockEmbed.format(name, renderBlock.attributes[name]);\n          });\n        }\n      });\n    }\n\n    if (last.type === 'block' && last.delta.length()) {\n      const offset = refBlot\n        ? refBlot.offset(refBlot.scroll) + refBlotOffset\n        : this.length();\n      insertInlineContents(this, offset, last.delta);\n    }\n\n    this.batchEnd();\n    this.optimize();\n  }\n\n  isEnabled() {\n    return this.domNode.getAttribute('contenteditable') === 'true';\n  }\n\n  leaf(index: number): [LeafBlot | null, number] {\n    const last = this.path(index).pop();\n    if (!last) {\n      return [null, -1];\n    }\n\n    const [blot, offset] = last;\n    return blot instanceof LeafBlot ? [blot, offset] : [null, -1];\n  }\n\n  line(index: number): [Block | BlockEmbed | null, number] {\n    if (index === this.length()) {\n      return this.line(index - 1);\n    }\n    // @ts-expect-error TODO: make descendant() generic\n    return this.descendant(isLine, index);\n  }\n\n  lines(index = 0, length = Number.MAX_VALUE): (Block | BlockEmbed)[] {\n    const getLines = (\n      blot: ParentBlot,\n      blotIndex: number,\n      blotLength: number,\n    ) => {\n      let lines: (Block | BlockEmbed)[] = [];\n      let lengthLeft = blotLength;\n      blot.children.forEachAt(\n        blotIndex,\n        blotLength,\n        (child, childIndex, childLength) => {\n          if (isLine(child)) {\n            lines.push(child);\n          } else if (child instanceof ContainerBlot) {\n            lines = lines.concat(getLines(child, childIndex, lengthLeft));\n          }\n          lengthLeft -= childLength;\n        },\n      );\n      return lines;\n    };\n    return getLines(this, index, length);\n  }\n\n  optimize(context?: { [key: string]: any }): void;\n  optimize(\n    mutations?: MutationRecord[],\n    context?: { [key: string]: any },\n  ): void;\n  optimize(mutations = [], context = {}) {\n    if (this.batch) return;\n    super.optimize(mutations, context);\n    if (mutations.length > 0) {\n      this.emitter.emit(Emitter.events.SCROLL_OPTIMIZE, mutations, context);\n    }\n  }\n\n  path(index: number) {\n    return super.path(index).slice(1); // Exclude self\n  }\n\n  remove() {\n    // Never remove self\n  }\n\n  update(source?: EmitterSource): void;\n  update(mutations?: MutationRecord[]): void;\n  update(mutations?: MutationRecord[] | EmitterSource): void {\n    if (this.batch) {\n      if (Array.isArray(mutations)) {\n        this.batch = this.batch.concat(mutations);\n      }\n      return;\n    }\n    let source: EmitterSource = Emitter.sources.USER;\n    if (typeof mutations === 'string') {\n      source = mutations;\n    }\n    if (!Array.isArray(mutations)) {\n      mutations = this.observer.takeRecords();\n    }\n    mutations = mutations.filter(({ target }) => {\n      const blot = this.find(target, true);\n      return blot && !isUpdatable(blot);\n    });\n    if (mutations.length > 0) {\n      this.emitter.emit(Emitter.events.SCROLL_BEFORE_UPDATE, source, mutations);\n    }\n    super.update(mutations.concat([])); // pass copy\n    if (mutations.length > 0) {\n      this.emitter.emit(Emitter.events.SCROLL_UPDATE, source, mutations);\n    }\n  }\n\n  updateEmbedAt(index: number, key: string, change: unknown) {\n    // Currently it only supports top-level embeds (BlockEmbed).\n    // We can update `ParentBlot` in parchment to support inline embeds.\n    const [blot] = this.descendant((b: Blot) => b instanceof BlockEmbed, index);\n    if (blot && blot.statics.blotName === key && isUpdatable(blot)) {\n      blot.updateContent(change);\n    }\n  }\n\n  protected handleDragStart(event: DragEvent) {\n    event.preventDefault();\n  }\n\n  private deltaToRenderBlocks(delta: Delta) {\n    const renderBlocks: RenderBlock[] = [];\n\n    let currentBlockDelta = new Delta();\n    delta.forEach((op) => {\n      const insert = op?.insert;\n      if (!insert) return;\n      if (typeof insert === 'string') {\n        const splitted = insert.split('\\n');\n        splitted.slice(0, -1).forEach((text) => {\n          currentBlockDelta.insert(text, op.attributes);\n          renderBlocks.push({\n            type: 'block',\n            delta: currentBlockDelta,\n            attributes: op.attributes ?? {},\n          });\n          currentBlockDelta = new Delta();\n        });\n        const last = splitted[splitted.length - 1];\n        if (last) {\n          currentBlockDelta.insert(last, op.attributes);\n        }\n      } else {\n        const key = Object.keys(insert)[0];\n        if (!key) return;\n        if (this.query(key, Scope.INLINE)) {\n          currentBlockDelta.push(op);\n        } else {\n          if (currentBlockDelta.length()) {\n            renderBlocks.push({\n              type: 'block',\n              delta: currentBlockDelta,\n              attributes: {},\n            });\n          }\n          currentBlockDelta = new Delta();\n          renderBlocks.push({\n            type: 'blockEmbed',\n            key,\n            value: insert[key],\n            attributes: op.attributes ?? {},\n          });\n        }\n      }\n    });\n\n    if (currentBlockDelta.length()) {\n      renderBlocks.push({\n        type: 'block',\n        delta: currentBlockDelta,\n        attributes: {},\n      });\n    }\n\n    return renderBlocks;\n  }\n\n  private createBlock(attributes: AttributeMap, refBlot?: Blot) {\n    let blotName: string | undefined;\n    const formats: AttributeMap = {};\n\n    Object.entries(attributes).forEach(([key, value]) => {\n      const isBlockBlot = this.query(key, Scope.BLOCK & Scope.BLOT) != null;\n      if (isBlockBlot) {\n        blotName = key;\n      } else {\n        formats[key] = value;\n      }\n    });\n\n    const block = this.create(\n      blotName || this.statics.defaultChild.blotName,\n      blotName ? attributes[blotName] : undefined,\n    ) as ParentBlot;\n\n    this.insertBefore(block, refBlot || undefined);\n\n    const length = block.length();\n    Object.entries(formats).forEach(([key, value]) => {\n      block.formatAt(0, length, key, value);\n    });\n\n    return block;\n  }\n}\n\nfunction insertInlineContents(\n  parent: ParentBlot,\n  index: number,\n  inlineContents: Delta,\n) {\n  inlineContents.reduce((index, op) => {\n    const length = Op.length(op);\n    let attributes = op.attributes || {};\n    if (op.insert != null) {\n      if (typeof op.insert === 'string') {\n        const text = op.insert;\n        parent.insertAt(index, text);\n        const [leaf] = parent.descendant(LeafBlot, index);\n        const formats = bubbleFormats(leaf);\n        attributes = AttributeMap.diff(formats, attributes) || {};\n      } else if (typeof op.insert === 'object') {\n        const key = Object.keys(op.insert)[0]; // There should only be one key\n        if (key == null) return index;\n        parent.insertAt(index, key, op.insert[key]);\n        const isInlineEmbed = parent.scroll.query(key, Scope.INLINE) != null;\n        if (isInlineEmbed) {\n          const [leaf] = parent.descendant(LeafBlot, index);\n          const formats = bubbleFormats(leaf);\n          attributes = AttributeMap.diff(formats, attributes) || {};\n        }\n      }\n    }\n    Object.keys(attributes).forEach((key) => {\n      parent.formatAt(index, length, key, attributes[key]);\n    });\n    return index + length;\n  }, index);\n}\n\nexport default Scroll;\n","import { Scope } from 'parchment';\nimport type Delta from 'quill-delta';\nimport Module from '../core/module.js';\nimport Quill from '../core/quill.js';\nimport type Scroll from '../blots/scroll.js';\nimport type { Range } from '../core/selection.js';\n\nexport interface HistoryOptions {\n  userOnly: boolean;\n  delay: number;\n  maxStack: number;\n}\n\nexport interface StackItem {\n  delta: Delta;\n  range: Range | null;\n}\n\ninterface Stack {\n  undo: StackItem[];\n  redo: StackItem[];\n}\n\nclass History extends Module<HistoryOptions> {\n  static DEFAULTS: HistoryOptions;\n\n  lastRecorded = 0;\n  ignoreChange = false;\n  stack: Stack = { undo: [], redo: [] };\n  currentRange: Range | null = null;\n\n  constructor(quill: Quill, options: Partial<HistoryOptions>) {\n    super(quill, options);\n    this.quill.on(\n      Quill.events.EDITOR_CHANGE,\n      (eventName, value, oldValue, source) => {\n        if (eventName === Quill.events.SELECTION_CHANGE) {\n          if (value && source !== Quill.sources.SILENT) {\n            this.currentRange = value;\n          }\n        } else if (eventName === Quill.events.TEXT_CHANGE) {\n          if (!this.ignoreChange) {\n            if (!this.options.userOnly || source === Quill.sources.USER) {\n              this.record(value, oldValue);\n            } else {\n              this.transform(value);\n            }\n          }\n\n          this.currentRange = transformRange(this.currentRange, value);\n        }\n      },\n    );\n\n    this.quill.keyboard.addBinding(\n      { key: 'z', shortKey: true },\n      this.undo.bind(this),\n    );\n    this.quill.keyboard.addBinding(\n      { key: ['z', 'Z'], shortKey: true, shiftKey: true },\n      this.redo.bind(this),\n    );\n    if (/Win/i.test(navigator.platform)) {\n      this.quill.keyboard.addBinding(\n        { key: 'y', shortKey: true },\n        this.redo.bind(this),\n      );\n    }\n\n    this.quill.root.addEventListener('beforeinput', (event) => {\n      if (event.inputType === 'historyUndo') {\n        this.undo();\n        event.preventDefault();\n      } else if (event.inputType === 'historyRedo') {\n        this.redo();\n        event.preventDefault();\n      }\n    });\n  }\n\n  change(source: 'undo' | 'redo', dest: 'redo' | 'undo') {\n    if (this.stack[source].length === 0) return;\n    const item = this.stack[source].pop();\n    if (!item) return;\n    const base = this.quill.getContents();\n    const inverseDelta = item.delta.invert(base);\n    this.stack[dest].push({\n      delta: inverseDelta,\n      range: transformRange(item.range, inverseDelta),\n    });\n    this.lastRecorded = 0;\n    this.ignoreChange = true;\n    this.quill.updateContents(item.delta, Quill.sources.USER);\n    this.ignoreChange = false;\n\n    this.restoreSelection(item);\n  }\n\n  clear() {\n    this.stack = { undo: [], redo: [] };\n  }\n\n  cutoff() {\n    this.lastRecorded = 0;\n  }\n\n  record(changeDelta: Delta, oldDelta: Delta) {\n    if (changeDelta.ops.length === 0) return;\n    this.stack.redo = [];\n    let undoDelta = changeDelta.invert(oldDelta);\n    let undoRange = this.currentRange;\n    const timestamp = Date.now();\n    if (\n      // @ts-expect-error Fix me later\n      this.lastRecorded + this.options.delay > timestamp &&\n      this.stack.undo.length > 0\n    ) {\n      const item = this.stack.undo.pop();\n      if (item) {\n        undoDelta = undoDelta.compose(item.delta);\n        undoRange = item.range;\n      }\n    } else {\n      this.lastRecorded = timestamp;\n    }\n    if (undoDelta.length() === 0) return;\n    this.stack.undo.push({ delta: undoDelta, range: undoRange });\n    // @ts-expect-error Fix me later\n    if (this.stack.undo.length > this.options.maxStack) {\n      this.stack.undo.shift();\n    }\n  }\n\n  redo() {\n    this.change('redo', 'undo');\n  }\n\n  transform(delta: Delta) {\n    transformStack(this.stack.undo, delta);\n    transformStack(this.stack.redo, delta);\n  }\n\n  undo() {\n    this.change('undo', 'redo');\n  }\n\n  protected restoreSelection(stackItem: StackItem) {\n    if (stackItem.range) {\n      this.quill.setSelection(stackItem.range, Quill.sources.USER);\n    } else {\n      const index = getLastChangeIndex(this.quill.scroll, stackItem.delta);\n      this.quill.setSelection(index, Quill.sources.USER);\n    }\n  }\n}\nHistory.DEFAULTS = {\n  delay: 1000,\n  maxStack: 100,\n  userOnly: false,\n};\n\nfunction transformStack(stack: StackItem[], delta: Delta) {\n  let remoteDelta = delta;\n  for (let i = stack.length - 1; i >= 0; i -= 1) {\n    const oldItem = stack[i];\n    stack[i] = {\n      delta: remoteDelta.transform(oldItem.delta, true),\n      range: oldItem.range && transformRange(oldItem.range, remoteDelta),\n    };\n    remoteDelta = oldItem.delta.transform(remoteDelta);\n    if (stack[i].delta.length() === 0) {\n      stack.splice(i, 1);\n    }\n  }\n}\n\nfunction endsWithNewlineChange(scroll: Scroll, delta: Delta) {\n  const lastOp = delta.ops[delta.ops.length - 1];\n  if (lastOp == null) return false;\n  if (lastOp.insert != null) {\n    return typeof lastOp.insert === 'string' && lastOp.insert.endsWith('\\n');\n  }\n  if (lastOp.attributes != null) {\n    return Object.keys(lastOp.attributes).some((attr) => {\n      return scroll.query(attr, Scope.BLOCK) != null;\n    });\n  }\n  return false;\n}\n\nfunction getLastChangeIndex(scroll: Scroll, delta: Delta) {\n  const deleteLength = delta.reduce((length, op) => {\n    return length + (op.delete || 0);\n  }, 0);\n  let changeIndex = delta.length() - deleteLength;\n  if (endsWithNewlineChange(scroll, delta)) {\n    changeIndex -= 1;\n  }\n  return changeIndex;\n}\n\nfunction transformRange(range: Range | null, delta: Delta) {\n  if (!range) return range;\n  const start = delta.transformPosition(range.index);\n  const end = delta.transformPosition(range.index + range.length);\n  return { index: start, length: end - start };\n}\n\nexport { History as default, getLastChangeIndex };\n","import Delta from 'quill-delta';\nimport type Quill from '../core/quill.js';\nimport Emitter from '../core/emitter.js';\nimport Module from '../core/module.js';\nimport type { Range } from '../core/selection.js';\n\ninterface UploaderOptions {\n  mimetypes: string[];\n  handler: (this: { quill: Quill }, range: Range, files: File[]) => void;\n}\n\nclass Uploader extends Module<UploaderOptions> {\n  static DEFAULTS: UploaderOptions;\n\n  constructor(quill: Quill, options: Partial<UploaderOptions>) {\n    super(quill, options);\n    quill.root.addEventListener('drop', (e) => {\n      e.preventDefault();\n      let native: ReturnType<typeof document.createRange> | null = null;\n      if (document.caretRangeFromPoint) {\n        native = document.caretRangeFromPoint(e.clientX, e.clientY);\n        // @ts-expect-error\n      } else if (document.caretPositionFromPoint) {\n        // @ts-expect-error\n        const position = document.caretPositionFromPoint(e.clientX, e.clientY);\n        native = document.createRange();\n        native.setStart(position.offsetNode, position.offset);\n        native.setEnd(position.offsetNode, position.offset);\n      }\n\n      const normalized = native && quill.selection.normalizeNative(native);\n      if (normalized) {\n        const range = quill.selection.normalizedToRange(normalized);\n        if (e.dataTransfer?.files) {\n          this.upload(range, e.dataTransfer.files);\n        }\n      }\n    });\n  }\n\n  upload(range: Range, files: FileList | File[]) {\n    const uploads: File[] = [];\n    Array.from(files).forEach((file) => {\n      if (file && this.options.mimetypes?.includes(file.type)) {\n        uploads.push(file);\n      }\n    });\n    if (uploads.length > 0) {\n      // @ts-expect-error Fix me later\n      this.options.handler.call(this, range, uploads);\n    }\n  }\n}\n\nUploader.DEFAULTS = {\n  mimetypes: ['image/png', 'image/jpeg'],\n  handler(range: Range, files: File[]) {\n    const promises = files.map((file) => {\n      return new Promise((resolve) => {\n        const reader = new FileReader();\n        reader.onload = (e) => {\n          // @ts-expect-error Fix me later\n          resolve(e.target.result);\n        };\n        reader.readAsDataURL(file);\n      });\n    });\n    Promise.all(promises).then((images) => {\n      const update = images.reduce((delta: Delta, image) => {\n        return delta.insert({ image });\n      }, new Delta().retain(range.index).delete(range.length)) as Delta;\n      this.quill.updateContents(update, Emitter.sources.USER);\n      this.quill.setSelection(\n        range.index + images.length,\n        Emitter.sources.SILENT,\n      );\n    });\n  },\n};\n\nexport default Uploader;\n","import Delta from 'quill-delta';\nimport Module from '../core/module.js';\nimport Quill from '../core/quill.js';\nimport type { Range } from '../core/selection.js';\nimport { deleteRange } from './keyboard.js';\n\nconst INSERT_TYPES = ['insertText', 'insertReplacementText'];\n\nclass Input extends Module {\n  constructor(quill: Quill, options: Record<string, never>) {\n    super(quill, options);\n\n    quill.root.addEventListener('beforeinput', (event) => {\n      this.handleBeforeInput(event);\n    });\n\n    // Gboard with English input on Android triggers `compositionstart` sometimes even\n    // users are not going to type anything.\n    if (!/Android/i.test(navigator.userAgent)) {\n      quill.on(Quill.events.COMPOSITION_BEFORE_START, () => {\n        this.handleCompositionStart();\n      });\n    }\n  }\n\n  private deleteRange(range: Range) {\n    deleteRange({ range, quill: this.quill });\n  }\n\n  private replaceText(range: Range, text = '') {\n    if (range.length === 0) return false;\n\n    if (text) {\n      // Follow the native behavior that inherits the formats of the first character\n      const formats = this.quill.getFormat(range.index, 1);\n      this.deleteRange(range);\n      this.quill.updateContents(\n        new Delta().retain(range.index).insert(text, formats),\n        Quill.sources.USER,\n      );\n    } else {\n      this.deleteRange(range);\n    }\n\n    this.quill.setSelection(range.index + text.length, 0, Quill.sources.SILENT);\n    return true;\n  }\n\n  private handleBeforeInput(event: InputEvent) {\n    if (\n      this.quill.composition.isComposing ||\n      event.defaultPrevented ||\n      !INSERT_TYPES.includes(event.inputType)\n    ) {\n      return;\n    }\n\n    const staticRange = event.getTargetRanges\n      ? event.getTargetRanges()[0]\n      : null;\n    if (!staticRange || staticRange.collapsed === true) {\n      return;\n    }\n\n    const text = getPlainTextFromInputEvent(event);\n    if (text == null) {\n      return;\n    }\n    const normalized = this.quill.selection.normalizeNative(staticRange);\n    const range = normalized\n      ? this.quill.selection.normalizedToRange(normalized)\n      : null;\n    if (range && this.replaceText(range, text)) {\n      event.preventDefault();\n    }\n  }\n\n  private handleCompositionStart() {\n    const range = this.quill.getSelection();\n    if (range) {\n      this.replaceText(range);\n    }\n  }\n}\n\nfunction getPlainTextFromInputEvent(event: InputEvent) {\n  // When `inputType` is \"insertText\":\n  // - `event.data` should be string (Safari uses `event.dataTransfer`).\n  // - `event.dataTransfer` should be null.\n  // When `inputType` is \"insertReplacementText\":\n  // - `event.data` should be null.\n  // - `event.dataTransfer` should contain \"text/plain\" data.\n\n  if (typeof event.data === 'string') {\n    return event.data;\n  }\n  if (event.dataTransfer?.types.includes('text/plain')) {\n    return event.dataTransfer.getData('text/plain');\n  }\n  return null;\n}\n\nexport default Input;\n","import { ParentBlot } from 'parchment';\nimport Module from '../core/module.js';\nimport Quill from '../core/quill.js';\n\nconst isMac = /Mac/i.test(navigator.platform);\n\n// Export for testing\nexport const TTL_FOR_VALID_SELECTION_CHANGE = 100;\n\n// A loose check to determine if the shortcut can move the caret before a UI node:\n// <ANY_PARENT>[CARET]<div class=\"ql-ui\"></div>[CONTENT]</ANY_PARENT>\nconst canMoveCaretBeforeUINode = (event: KeyboardEvent) => {\n  if (\n    event.key === 'ArrowLeft' ||\n    event.key === 'ArrowRight' || // RTL scripts or moving from the end of the previous line\n    event.key === 'ArrowUp' ||\n    event.key === 'ArrowDown' ||\n    event.key === 'Home'\n  ) {\n    return true;\n  }\n\n  if (isMac && event.key === 'a' && event.ctrlKey === true) {\n    return true;\n  }\n\n  return false;\n};\n\nclass UINode extends Module {\n  isListening = false;\n  selectionChangeDeadline = 0;\n\n  constructor(quill: Quill, options: Record<string, never>) {\n    super(quill, options);\n\n    this.handleArrowKeys();\n    this.handleNavigationShortcuts();\n  }\n\n  private handleArrowKeys() {\n    this.quill.keyboard.addBinding({\n      key: ['ArrowLeft', 'ArrowRight'],\n      offset: 0,\n      shiftKey: null,\n      handler(range, { line, event }) {\n        if (!(line instanceof ParentBlot) || !line.uiNode) {\n          return true;\n        }\n\n        const isRTL = getComputedStyle(line.domNode)['direction'] === 'rtl';\n        if (\n          (isRTL && event.key !== 'ArrowRight') ||\n          (!isRTL && event.key !== 'ArrowLeft')\n        ) {\n          return true;\n        }\n\n        this.quill.setSelection(\n          range.index - 1,\n          range.length + (event.shiftKey ? 1 : 0),\n          Quill.sources.USER,\n        );\n        return false;\n      },\n    });\n  }\n\n  private handleNavigationShortcuts() {\n    this.quill.root.addEventListener('keydown', (event) => {\n      if (!event.defaultPrevented && canMoveCaretBeforeUINode(event)) {\n        this.ensureListeningToSelectionChange();\n      }\n    });\n  }\n\n  /**\n   * We only listen to the `selectionchange` event when\n   * there is an intention of moving the caret to the beginning using shortcuts.\n   * This is primarily implemented to prevent infinite loops, as we are changing\n   * the selection within the handler of a `selectionchange` event.\n   */\n  private ensureListeningToSelectionChange() {\n    this.selectionChangeDeadline = Date.now() + TTL_FOR_VALID_SELECTION_CHANGE;\n\n    if (this.isListening) return;\n    this.isListening = true;\n\n    const listener = () => {\n      this.isListening = false;\n\n      if (Date.now() <= this.selectionChangeDeadline) {\n        this.handleSelectionChange();\n      }\n    };\n\n    document.addEventListener('selectionchange', listener, {\n      once: true,\n    });\n  }\n\n  private handleSelectionChange() {\n    const selection = document.getSelection();\n    if (!selection) return;\n    const range = selection.getRangeAt(0);\n    if (range.collapsed !== true || range.startOffset !== 0) return;\n\n    const line = this.quill.scroll.find(range.startContainer);\n    if (!(line instanceof ParentBlot) || !line.uiNode) return;\n\n    const newRange = document.createRange();\n    newRange.setStartAfter(line.uiNode);\n    newRange.setEndAfter(line.uiNode);\n    selection.removeAllRanges();\n    selection.addRange(newRange);\n  }\n}\n\nexport default UINode;\n","import Quill from './core/quill.js';\n\nimport Block, { BlockEmbed } from './blots/block.js';\nimport Break from './blots/break.js';\nimport Container from './blots/container.js';\nimport Cursor from './blots/cursor.js';\nimport Embed from './blots/embed.js';\nimport Inline from './blots/inline.js';\nimport Scroll from './blots/scroll.js';\nimport TextBlot from './blots/text.js';\n\nimport Clipboard from './modules/clipboard.js';\nimport History from './modules/history.js';\nimport Keyboard from './modules/keyboard.js';\nimport Uploader from './modules/uploader.js';\nimport Delta, { Op, OpIterator, AttributeMap } from 'quill-delta';\nimport Input from './modules/input.js';\nimport UINode from './modules/uiNode.js';\n\nexport { Delta, Op, OpIterator, AttributeMap };\n\nQuill.register({\n  'blots/block': Block,\n  'blots/block/embed': BlockEmbed,\n  'blots/break': Break,\n  'blots/container': Container,\n  'blots/cursor': Cursor,\n  'blots/embed': Embed,\n  'blots/inline': Inline,\n  'blots/scroll': Scroll,\n  'blots/text': TextBlot,\n\n  'modules/clipboard': Clipboard,\n  'modules/history': History,\n  'modules/keyboard': Keyboard,\n  'modules/uploader': Uploader,\n  'modules/input': Input,\n  'modules/uiNode': UINode,\n});\n\nexport default Quill;\n"],"names":["root","factory","exports","module","define","amd","self","Block","BlockBlot","cache","delta","this","blot","filter","arguments","length","undefined","descendants","LeafBlot","reduce","leaf","insert","value","bubbleFormats","Delta","blockDelta","deleteAt","index","super","formatAt","name","scroll","query","Scope","BLOCK","format","Math","min","insertAt","def","lines","split","text","shift","children","tail","block","lineIndex","line","insertBefore","ref","head","Break","remove","moveChildren","target","optimize","context","path","removeChild","child","force","clone","parent","next","blotName","tagName","defaultChild","allowedChildren","Inline","EmbedBlot","TextBlot","BlockEmbed","attach","attributes","AttributorStore","domNode","formats","values","attribute","BLOCK_ATTRIBUTE","pop","blocks","map","create","forEach","statics","scope","BLOCK_BLOT","prev","Container","ContainerBlot","Cursor","static","constructor","selection","textNode","document","createTextNode","CONTENTS","appendChild","savedLength","detach","offset","node","position","data","restore","composing","range","getNativeRange","lastChild","parentNode","prevTextBlot","prevTextLength","nextTextBlot","nextText","newText","join","mergedTextBlot","newTextNode","remapOffset","start","end","startNode","startOffset","endNode","endOffset","update","mutations","some","mutation","type","isolate","unwrap","GUARD_TEXT","Embed","contentNode","createElement","setAttribute","Array","from","childNodes","childNode","leftGuard","rightGuard","prevLength","InlineBlot","Text","compare","other","selfIndex","order","indexOf","otherIndex","BLOT","wrap","escapeText","replace","s","debug","logger","eventName","addEventListener","_len","args","_key","querySelectorAll","quill","instances","get","emitter","handleDOM","EventEmitter","EDITOR_CHANGE","SCROLL_BEFORE_UPDATE","SCROLL_BLOT_MOUNT","SCROLL_BLOT_UNMOUNT","SCROLL_OPTIMIZE","SCROLL_UPDATE","SCROLL_EMBED_UPDATE","SELECTION_CHANGE","TEXT_CHANGE","COMPOSITION_BEFORE_START","COMPOSITION_START","COMPOSITION_BEFORE_END","COMPOSITION_END","API","SILENT","USER","domListeners","on","error","emit","_len2","_key2","log","call","event","_len3","_key3","_ref","handler","contains","listenDOM","push","WeakMap","levels","level","method","console","namespace","ns","bind","newLevel","options","ASCII","convertListHTML","items","lastIndent","types","endTag","getListType","indent","rest","tag","convertHTML","previousType","isRoot","html","slice","ParentBlot","forEachAt","childLength","list","parts","outerHTML","innerHTML","Element","combineFormats","combined","Object","keys","merged","combinedValue","isArray","concat","normalizeDelta","normalizedDelta","op","shiftRange","amount","Range","getDelta","applyDelta","scrollLength","batchStart","deleteDelta","ops","splitOpLines","Op","isImplicitNewlinePrepended","isImplicitNewlineAppended","retain","endsWith","descendant","merge","AttributeMap","diff","key","isInlineEmbed","INLINE","INLINE_BLOT","updateEmbedAt","prependedLength","addedLength","delete","batchEnd","deleteText","formatLine","max","cloneDeep","formatText","getContents","getFormat","leaves","lineFormats","leafFormats","blots","getHTML","lineOffset","lineLength","getText","insertContents","contents","change","insertEmbed","embed","insertText","isBlank","removeFormat","suffixLength","suffix","selectionInfo","oldDelta","match","find","textBlot","oldValue","CursorBlot","oldText","relativeSelectionInfo","oldRange","newRange","compose","isEqual","isComposing","setupListeners","handleCompositionStart","queueMicrotask","handleCompositionEnd","Node","Emitter","events","getElementRect","element","rect","getBoundingClientRect","scaleX","abs","width","offsetWidth","scaleY","height","offsetHeight","top","right","left","clientWidth","bottom","clientHeight","paddingValueToInt","number","parseInt","Number","isNaN","getScrollDistance","targetStart","targetEnd","scrollStart","scrollEnd","scrollPaddingStart","scrollPaddingEnd","CORE_FORMATS","globalRegistry","Parchment","uiClass","Quill","bounds","modules","clipboard","keyboard","history","uploader","placeholder","readOnly","registry","theme","sources","parchment","Module","Theme","limit","bubble","import","imports","register","overwrite","attrName","warn","startsWith","container","containerOrSelector","resolveSelector","Error","DEFAULTS","quillModuleDefaults","quillDefaults","themeModuleDefaults","themeDefaults","expandModuleConfig","toolbar","config","createRegistryWithFormats","sourceRegistry","Registry","coreBlot","iterations","requiredContainer","entries","modulesWithDefaults","_ref2","moduleClass","expandConfig","trim","classList","add","set","addContainer","scrollBlotName","ScrollBlot","editor","Editor","Selection","composition","Composition","addModule","init","toggle","source","lastRange","getRange","modify","convert","setContents","clear","disable","allowReadOnlyEdits","refNode","className","blur","setRange","overload","enable","editReadOnly","modifier","enabled","focus","preventScroll","scrollSelectionIntoView","getSelection","setSelection","getBounds","containerBounds","getLength","getIndex","getLeaf","getLine","getLines","MAX_VALUE","getModule","getSemanticHTML","hasFocus","isEnabled","off","once","scrollRectIntoView","targetRect","ownerDocument","current","isDocumentBody","body","bounding","window","visualViewport","documentElement","style","getComputedStyle","scrollDistanceX","scrollPaddingLeft","scrollPaddingRight","scrollDistanceY","scrollPaddingTop","scrollPaddingBottom","defaultView","scrollBy","scrollLeft","scrollTop","scrolledLeft","scrolledTop","parentElement","getRootNode","host","scrollIntoView","delete1","applied","delete2","setText","updateContents","selector","querySelector","expanded","lengthOrSource","transformPosition","pos","mouseDown","cursor","savedRange","lastNative","handleComposition","handleDragging","setTimeout","native","setNativeRange","triggeredByTyping","ignored","nativeRange","collapsed","after","nextLine","createRange","setStart","setEnd","side","rangeCount","getRangeAt","normalizeNative","info","isConnected","normalized","normalizedToRange","activeElement","positions","indexes","startContainer","endContainer","rangeToNative","getPosition","inclusive","leafOffset","removeAllRanges","addRange","e","default","ModuleClass","whitelist","AlignAttribute","Attributor","AlignStyle","ClassAttributor","StyleAttributor","BackgroundStyle","ColorAttributor","CodeBlockContainer","code","innerText","CodeBlock","Code","component","toString","ColorStyle","DirectionAttribute","DirectionStyle","FontStyleAttributor","FontStyle","SizeStyle","normalWeightRegexp","blockTagNames","isBlockElement","includes","ignoreRegexp","idRegexp","indentRegexp","NORMALIZERS","doc","getAttribute","msoList","others","listItems","parseListItem","idMatch","id","indentMatch","typeRegexp","RegExp","typeMatch","parsed","childListItems","nextElementSibling","ul","listItem","li","replaceChild","normalizeListItem","fragment","createDocumentFragment","append","normalizeFontWeight","br","previousElementSibling","normalizeEmptyLines","CLIPBOARD_CONFIG","TEXT_NODE","isPre","isLine","isBetweenInlineElements","replacer","collapse","replaced","previousSibling","nextSibling","matchNewline","deltaEndsWith","ELEMENT_NODE","prototype","applyFormat","classes","styles","attr","ATTRIBUTE","ATTRIBUTE_ATTRIBUTORS","keyName","STYLE_ATTRIBUTORS","newDelta","_ref4","fontStyle","italic","textDecoration","underline","strike","fontWeight","bold","_ref5","parseFloat","textIndent","composed","table","createMatchAlias","memo","Clipboard","onCaptureCopy","onCapturePaste","matchers","matcher","addMatcher","normalizeHTML","normalize","normalizeExternalHTML","DOMParser","parseFromString","nodeMatches","elementMatchers","textMatchers","prepareMatching","traverse","dangerouslyPasteHTML","paste","isCut","defaultPrevented","preventDefault","onCopy","clipboardData","setData","deleteRange","getData","files","upload","childElementCount","firstElementChild","onPaste","_ref3","pastedDelta","pair","has","matches","endText","i","toLowerCase","preNodes","nodeType","childrenDelta","reducedDelta","_node","HTMLParagraphElement","firstChild","SHORTKEY","test","navigator","platform","Keyboard","evt","binding","which","bindings","addBinding","shiftKey","handleEnter","metaKey","ctrlKey","altKey","userAgent","handleBackspace","handleDelete","prefix","handleDeleteRange","listen","keyBinding","shortKey","singleBinding","leafStart","offsetStart","leafEnd","offsetEnd","prefixText","suffixText","curContext","empty","every","curFormats","prevFormats","formatDelta","nextFormats","defaultOptions","makeFormatHandler","outdent","makeCodeBlockHandler","tab","cutoff","header","row","cell","getTable","_table","tableSide","blockquote","numLines","cur","makeEmbedArrowHandler","makeTableArrowHandler","TAB","textContent","up","targetRow","targetCell","targetLine","firstFormats","lastFormats","hasOwnProperty","Events","EE","fn","addListener","TypeError","listener","_events","_eventsCount","clearEvent","__proto__","eventNames","names","getOwnPropertySymbols","listeners","handlers","l","ee","listenerCount","a1","a2","a3","a4","a5","len","removeListener","apply","j","removeAllListeners","prefixed","DIFF_DELETE","DIFF_INSERT","DIFF_EQUAL","diff_main","text1","text2","cursor_pos","cleanup","_fix_unicode","editdiff","oldLength","newLength","oldCursor","oldBefore","oldAfter","maybeNewCursor","newCursor","newBefore","newAfter","prefixLength","oldPrefix","newPrefix","make_edit_splice","oldSuffix","newSuffix","find_cursor_edit_diff","commonlength","diff_commonPrefix","commonprefix","substring","diff_commonSuffix","commonsuffix","diffs","longtext","shorttext","hm","diff_halfMatchI_","best_longtext_a","best_longtext_b","best_shorttext_a","best_shorttext_b","seed","floor","best_common","text1_a","text1_b","text2_a","text2_b","hm1","ceil","hm2","diff_halfMatch_","mid_common","diffs_a","diffs_b","text1_length","text2_length","max_d","v_offset","v_length","v1","v2","x","front","k1start","k1end","k2start","k2end","d","k1","k1_offset","y1","x1","charAt","k2_offset","x2","diff_bisectSplit_","k2","y2","diff_bisect_","diff_compute_","unshift","diff_cleanupMerge","changes","equalities","equalitiesLength","lastequality","pointer","length_insertions1","length_deletions1","length_insertions2","length_deletions2","splice","diff_cleanupSemanticScore_","one","two","char1","char2","nonAlphaNumeric1","nonAlphaNumericRegex_","nonAlphaNumeric2","whitespace1","whitespaceRegex_","whitespace2","lineBreak1","linebreakRegex_","lineBreak2","blankLine1","blanklineEndRegex_","blankLine2","blanklineStartRegex_","equality1","edit","equality2","commonOffset","commonString","bestEquality1","bestEdit","bestEquality2","bestScore","score","diff_cleanupSemanticLossless","deletion","insertion","overlap_length1","diff_commonOverlap_","overlap_length2","diff_cleanupSemantic","y","text1a","text2a","text1b","text2b","diffsb","pointermin","pointermax","pointermid","pointerstart","is_surrogate_pair_start","charCodeAt","text_length","best","pattern","found","pointerend","is_surrogate_pair_end","fix_unicode","count_delete","count_insert","text_delete","text_insert","previous_equality","ends_with_pair_start","stray","k","starts_with_pair_end","n","charCode","str","before","oldMiddle","newMiddle","tuples","ret","remove_empty_tuples","INSERT","DELETE","EQUAL","HASH_UNDEFINED","MAX_SAFE_INTEGER","argsTag","boolTag","dateTag","funcTag","genTag","mapTag","numberTag","objectTag","promiseTag","regexpTag","setTag","stringTag","symbolTag","weakMapTag","arrayBufferTag","dataViewTag","float32Tag","float64Tag","int8Tag","int16Tag","int32Tag","uint8Tag","uint8ClampedTag","uint16Tag","uint32Tag","reFlags","reIsHostCtor","reIsUint","cloneableTags","freeGlobal","g","freeSelf","Function","freeExports","freeModule","moduleExports","addMapEntry","addSetEntry","arrayReduce","array","iteratee","accumulator","initAccum","isHostObject","result","mapToArray","size","overArg","func","transform","arg","setToArray","uid","arrayProto","funcProto","objectProto","coreJsData","maskSrcKey","exec","IE_PROTO","funcToString","objectToString","reIsNative","Buffer","Symbol","Uint8Array","getPrototype","getPrototypeOf","objectCreate","propertyIsEnumerable","nativeGetSymbols","nativeIsBuffer","isBuffer","nativeKeys","DataView","getNative","Map","Promise","Set","nativeCreate","dataViewCtorString","toSource","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","symbolProto","symbolValueOf","valueOf","Hash","entry","ListCache","MapCache","Stack","__data__","assignValue","object","objValue","eq","assocIndexOf","baseClone","isDeep","isFull","customizer","stack","isObject","isArr","input","initCloneArray","copyArray","getTag","isFunc","buffer","copy","cloneBuffer","isPrototype","proto","initCloneObject","copyObject","getSymbols","copySymbols","baseAssign","cloneFunc","symbol","Ctor","cloneArrayBuffer","dataView","byteOffset","byteLength","cloneDataView","typedArray","cloneTypedArray","cloneMap","regexp","lastIndex","cloneRegExp","cloneSet","initCloneByTag","stacked","props","keysFunc","symbolsFunc","arrayPush","baseGetAllKeys","getAllKeys","arrayEach","subValue","arrayBuffer","newValue","getMapData","getValue","isFunction","baseIsNative","pairs","LARGE_ARRAY_SIZE","isIndex","ArrayBuffer","resolve","ctorString","isArrayLike","isLength","inherited","isObjectLike","isArrayLikeObject","isArguments","baseTimes","String","skipIndexes","arrayLikeKeys","baseKeys","COMPARE_PARTIAL_FLAG","COMPARE_UNORDERED_FLAG","arrayTag","asyncTag","errorTag","nullTag","proxyTag","undefinedTag","typedArrayTags","freeProcess","process","nodeUtil","nodeIsTypedArray","isTypedArray","arraySome","predicate","nativeObjectToString","symToStringTag","toStringTag","SetCache","baseGetTag","isOwn","unmasked","getRawTag","baseIsArguments","baseIsEqual","bitmask","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","equalArrays","message","isPartial","equalByTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","objProps","objLength","skipCtor","othValue","compared","objCtor","othCtor","equalObjects","baseIsEqualDeep","arrLength","othLength","seen","arrValue","othIndex","isMasked","resIndex","arrayFilter","baseUnary","isArg","isBuff","isType","a","b","keepNull","attrs","invert","base","baseInverted","priority","OpIterator","NULL_CHARACTER","fromCharCode","getEmbedTypeAndData","embedType","registerEmbed","unregisterEmbed","getHandler","newOp","lastOp","chop","partition","passed","failed","initialValue","changeLength","elem","Infinity","iter","hasNext","nextOp","thisIter","otherIter","firstOther","peek","firstLeft","peekType","peekLength","thisOp","otherOp","action","thisData","otherData","strings","retDelta","diffResult","opLength","eachLine","newline","inverted","baseIndex","baseOp","opData","baseOpData","transformedData","nextType","retOp","substr","allocUnsafe","isNew","defineProperty","global","stubArray","require","keysIn","nodeIsMap","isMap","nodeIsSet","isSet","isFlat","arrStacked","othStacked","objStacked","isProto","count","lastCalled","assigner","iterable","objectCtorString","srcIndex","mergeFunc","srcValue","isCommon","isTyped","baseMerge","nativeMax","string","nativeNow","Date","now","stamp","remaining","otherArgs","thisArg","guard","TYPE","LEVEL","INLINE_ATTRIBUTE","ANY","attributeBit","item","canAdd","removeAttribute","ParchmentError","_Registry","tags","blotClass","inline","definitions","definition","isBlot","isAttr","toUpperCase","camelize","part","build","move","_ShadowBlot","rawValue","cloneNode","_context","replaceWith","replacement","_force","_mutations","wrapper","ShadowBlot","_LeafBlot","_domNode","compareDocumentPosition","DOCUMENT_POSITION_CONTAINED_BY","_inclusive","LinkedList","nodes","at","iterator","curNode","callback","curIndex","curLength","makeAttachedBlot","_ParentBlot","uiNode","attachUI","reverse","err","criteria","lengthLeft","childIndex","enforceAllowedChildren","done","splitAfter","childBlot","refBlot","refDomNode","targetParent","_length","addedNodes","removedNodes","sort","DOCUMENT_POSITION_FOLLOWING","_InlineBlot","obj1","obj2","prop","_BlockBlot","_ContainerBlot","checkMerge","_scroll","OBSERVER_CONFIG","characterData","characterDataOldValue","childList","subtree","_ScrollBlot","observer","MutationObserver","observe","disconnect","mutationsMap","records","takeRecords","mark","markParent","grandChild","_TextBlot","splitText","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","loaded","__webpack_modules__","getter","__esModule","o","enumerable","globalThis","obj","r","nmd","paths","isUpdatable","updateContent","Scroll","batch","handleDragStart","emitMount","emitUnmount","emitEmbedUpdate","first","last","renderBlocks","deltaToRenderBlocks","shouldInsertNewlineChar","insertInlineContents","newlineCharLength","lineEndIndex","refBlotOffset","renderBlock","createBlock","blockEmbed","blotIndex","blotLength","currentBlockDelta","splitted","inlineContents","History","lastRecorded","ignoreChange","undo","redo","currentRange","userOnly","record","transformRange","inputType","dest","inverseDelta","restoreSelection","changeDelta","undoDelta","undoRange","timestamp","delay","maxStack","transformStack","stackItem","deleteLength","changeIndex","endsWithNewlineChange","getLastChangeIndex","remoteDelta","oldItem","Uploader","caretRangeFromPoint","clientX","clientY","caretPositionFromPoint","offsetNode","dataTransfer","uploads","file","mimetypes","promises","reader","FileReader","onload","readAsDataURL","all","then","images","image","INSERT_TYPES","Input","handleBeforeInput","replaceText","staticRange","getTargetRanges","getPlainTextFromInputEvent","isMac","UINode","isListening","selectionChangeDeadline","handleArrowKeys","handleNavigationShortcuts","isRTL","canMoveCaretBeforeUINode","ensureListeningToSelectionChange","handleSelectionChange","setStartAfter","setEndAfter"],"sourceRoot":""}