{"mappings":"ikBA2BUA,EAAQC,EAAQC,YAEjBC,EAAKC,GACZ,IAgDIC,EAhDAC,EAAKC,KAAMC,GAgDXH,EAAI,WAEG,SAASI,GAClBA,EAAOC,OAAOD,GACd,IAAK,IAAIE,EAAI,EAAGA,EAAIF,EAAKG,OAAQD,IAAK,CAEpC,IAAIE,EAAI,oBADRR,GAAKI,EAAKK,WAAWH,IAGrBE,GADAR,EAAIQ,IAAM,EAGVR,GADAQ,GAAKR,KACK,EAEVA,GAAS,YADTQ,GAAKR,GAGP,OAAmB,wBAAXA,IAAM,KA5DhBC,EAAGS,KAAO,WACR,IAAIC,EAAI,QAAUV,EAAGW,GAAY,uBAAPX,EAAGY,EAG7B,OAFAZ,EAAGW,GAAKX,EAAGa,GACXb,EAAGa,GAAKb,EAAGc,GACJd,EAAGc,GAAKJ,GAAKV,EAAGY,EAAQ,EAAJF,IAI7BV,EAAGY,EAAI,EACPZ,EAAGW,GAAKT,EAAK,KACbF,EAAGa,GAAKX,EAAK,KACbF,EAAGc,GAAKZ,EAAK,KACbF,EAAGW,IAAMT,EAAKJ,GACVE,EAAGW,GAAK,IAAKX,EAAGW,IAAM,GAC1BX,EAAGa,IAAMX,EAAKJ,GACVE,EAAGa,GAAK,IAAKb,EAAGa,IAAM,GAC1Bb,EAAGc,IAAMZ,EAAKJ,GACVE,EAAGc,GAAK,IAAKd,EAAGc,IAAM,GAC1BZ,EAAO,cAGAa,EAAKC,EAAGN,GAKf,OAJAA,EAAEE,EAAII,EAAEJ,EACRF,EAAEC,GAAKK,EAAEL,GACTD,EAAEG,GAAKG,EAAEH,GACTH,EAAEI,GAAKE,EAAEF,GACFJ,WAGAO,EAAKnB,EAAMoB,GAClB,IAAIC,EAAK,IAAItB,EAAKC,GACdsB,EAAQF,GAAQA,EAAKE,MACrBC,EAAOF,EAAGV,KAUd,OATAY,EAAKC,MAAQ,WAAa,OAAoB,WAAZH,EAAGV,OAAwB,GAC7DY,EAAKE,OAAS,WACZ,OAAOF,IAAmC,uBAAhB,QAATA,IAAoB,IAEvCA,EAAKG,MAAQH,EACTD,IACmB,iBAAVA,GAAoBL,EAAKK,EAAOD,GAC3CE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,MAErCE,EAyBL1B,GAAUA,EAAO8B,QACnB9B,EAAO8B,QAAUR,EACRrB,GAAUA,EAAO8B,IAC1B9B,GAAO,WAAa,OAAOqB,KAE3BhB,KAAK0B,KAAOV,GAIZhB,EAC+BN,EACZ,mBAAXC,QAAyBA,uDC3GzBF,EAAQC,EAAQC,YAEjBgC,EAAO9B,GACd,IAAIE,EAAKC,KAAM4B,EAAU,GAEzB7B,EAAG8B,EAAI,EACP9B,EAAG+B,EAAI,EACP/B,EAAGgC,EAAI,EACPhC,EAAGiC,EAAI,EAGPjC,EAAGS,KAAO,WACR,IAAIC,EAAIV,EAAG8B,EAAK9B,EAAG8B,GAAK,GAIxB,OAHA9B,EAAG8B,EAAI9B,EAAG+B,EACV/B,EAAG+B,EAAI/B,EAAGgC,EACVhC,EAAGgC,EAAIhC,EAAGiC,EACHjC,EAAGiC,GAAMjC,EAAGiC,IAAM,GAAMvB,EAAKA,IAAM,GAGxCZ,KAAiB,EAAPA,GAEZE,EAAG8B,EAAIhC,EAGP+B,GAAW/B,EAIb,IAAK,IAAIoC,EAAI,EAAGA,EAAIL,EAAQvB,OAAS,GAAI4B,IACvClC,EAAG8B,GAA6B,EAAxBD,EAAQrB,WAAW0B,GAC3BlC,EAAGS,gBAIEM,EAAKC,EAAGN,GAKf,OAJAA,EAAEoB,EAAId,EAAEc,EACRpB,EAAEqB,EAAIf,EAAEe,EACRrB,EAAEsB,EAAIhB,EAAEgB,EACRtB,EAAEuB,EAAIjB,EAAEiB,EACDvB,WAGAO,EAAKnB,EAAMoB,GAClB,IAAIC,EAAK,IAAIS,EAAO9B,GAChBsB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGV,SAAW,GAAK,YAenD,OAdAY,EAAKE,OAAS,cAEV,IAEIY,IAFMhB,EAAGV,SAAW,KACbU,EAAGV,SAAW,GAAK,YACF,cACV,IAAX0B,GACT,OAAOA,GAETd,EAAKC,MAAQH,EAAGV,KAChBY,EAAKG,MAAQH,EACTD,IACmB,iBAAVA,GAAoBL,EAAKK,EAAOD,GAC3CE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,MAErCE,EAGL1B,GAAUA,EAAO8B,QACnB9B,EAAO8B,QAAUR,EACRrB,GAAUA,EAAO8B,IAC1B9B,GAAO,WAAa,OAAOqB,KAE3BhB,KAAKmC,OAASnB,GAIdhB,EAC+BN,EACZ,mBAAXC,QAAyBA,uDC1EzBF,EAAQC,EAAQC,YAEjBgC,EAAO9B,GACd,IAAIE,EAAKC,KAAM4B,EAAU,GAGzB7B,EAAGS,KAAO,WACR,IAAIC,EAAKV,EAAG8B,EAAK9B,EAAG8B,IAAM,EAE1B,OADA9B,EAAG8B,EAAI9B,EAAG+B,EAAG/B,EAAG+B,EAAI/B,EAAGgC,EAAGhC,EAAGgC,EAAIhC,EAAGiC,EAAGjC,EAAGiC,EAAIjC,EAAGqC,GACzCrC,EAAGsC,EAAKtC,EAAGsC,EAAI,OAAS,IAC5BtC,EAAGqC,EAAKrC,EAAGqC,EAAKrC,EAAGqC,GAAK,EAAO3B,EAAKA,GAAK,GAAO,GAGtDV,EAAG8B,EAAI,EACP9B,EAAG+B,EAAI,EACP/B,EAAGgC,EAAI,EACPhC,EAAGiC,EAAI,EACPjC,EAAGqC,EAAI,EAEHvC,KAAiB,EAAPA,GAEZE,EAAG8B,EAAIhC,EAGP+B,GAAW/B,EAIb,IAAK,IAAIoC,EAAI,EAAGA,EAAIL,EAAQvB,OAAS,GAAI4B,IACvClC,EAAG8B,GAA6B,EAAxBD,EAAQrB,WAAW0B,GACvBA,GAAKL,EAAQvB,SACfN,EAAGsC,EAAItC,EAAG8B,GAAK,GAAK9B,EAAG8B,IAAM,GAE/B9B,EAAGS,gBAIEM,EAAKC,EAAGN,GAOf,OANAA,EAAEoB,EAAId,EAAEc,EACRpB,EAAEqB,EAAIf,EAAEe,EACRrB,EAAEsB,EAAIhB,EAAEgB,EACRtB,EAAEuB,EAAIjB,EAAEiB,EACRvB,EAAE2B,EAAIrB,EAAEqB,EACR3B,EAAE4B,EAAItB,EAAEsB,EACD5B,WAGAO,EAAKnB,EAAMoB,GAClB,IAAIC,EAAK,IAAIS,EAAO9B,GAChBsB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGV,SAAW,GAAK,YAenD,OAdAY,EAAKE,OAAS,cAEV,IAEIY,IAFMhB,EAAGV,SAAW,KACbU,EAAGV,SAAW,GAAK,YACF,cACV,IAAX0B,GACT,OAAOA,GAETd,EAAKC,MAAQH,EAAGV,KAChBY,EAAKG,MAAQH,EACTD,IACmB,iBAAVA,GAAoBL,EAAKK,EAAOD,GAC3CE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,MAErCE,EAGL1B,GAAUA,EAAO8B,QACnB9B,EAAO8B,QAAUR,EACRrB,GAAUA,EAAO8B,IAC1B9B,GAAO,WAAa,OAAOqB,KAE3BhB,KAAKsC,OAAStB,GAIdhB,EAC+BN,EACZ,mBAAXC,QAAyBA,uDC7EzBF,EAAQC,EAAQC,YAEjBgC,EAAOY,GACd,IAAIC,EAAKxC,KAGTwC,EAAGhC,KAAO,WAER,IAAwBC,EAAG2B,EAAvBK,EAAID,EAAGX,EAAGzB,EAAIoC,EAAGpC,EAQrB,OAPAK,EAAIgC,EAAErC,GAAoBgC,GAAhB3B,GAAMA,IAAM,GAAaA,GAAK,GACpB2B,IAApB3B,EAAIgC,EAAGrC,EAAI,EAAK,IAAcK,IAAM,GAChB2B,IAApB3B,EAAIgC,EAAGrC,EAAI,EAAK,IAAcK,IAAM,EAChB2B,IAApB3B,EAAIgC,EAAGrC,EAAI,EAAK,IAAcK,GAAK,EACnCA,EAAIgC,EAAGrC,EAAI,EAAK,GAAuBgC,IAAnB3B,GAASA,GAAK,IAAeA,GAAK,EACtDgC,EAAErC,GAAKgC,EACPI,EAAGpC,EAAKA,EAAI,EAAK,EACVgC,YAGKrC,EAAIF,GAChB,IAAI6C,EAAMD,EAAI,GAEd,GAAI5C,KAAiB,EAAPA,GAER4C,EAAE,GAAK5C,OAIX,IADAA,EAAO,GAAKA,EACP6C,EAAI,EAAGA,EAAI7C,EAAKQ,SAAUqC,EAC7BD,EAAM,EAAJC,GAAUD,EAAM,EAAJC,IAAU,GACnB7C,EAAKU,WAAWmC,GAAKD,EAAGC,EAAI,EAAK,IAAM,QAIzCD,EAAEpC,OAAS,GAAGoC,EAAEE,KAAK,GAC5B,IAAKD,EAAI,EAAGA,EAAI,GAAc,IAATD,EAAEC,KAAYA,GAOnC,IANS,GAALA,EAAYD,EAAE,IAAK,EAAaA,EAAEC,GAEtC3C,EAAG8B,EAAIY,EACP1C,EAAGK,EAAI,EAGFsC,EAAI,IAAKA,EAAI,IAAKA,EACrB3C,EAAGS,OAIPoC,CAAKJ,EAAID,YAGFzB,EAAKC,EAAGN,GAGf,OAFAA,EAAEoB,EAAId,EAAEc,EAAEgB,QACVpC,EAAEL,EAAIW,EAAEX,EACDK,WAGAO,EAAKnB,EAAMoB,GACN,MAARpB,IAAcA,GAAS,IAAIiD,MAC/B,IAAI5B,EAAK,IAAIS,EAAO9B,GAChBsB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGV,SAAW,GAAK,YAenD,OAdAY,EAAKE,OAAS,cAEV,IAEIY,IAFMhB,EAAGV,SAAW,KACbU,EAAGV,SAAW,GAAK,YACF,cACV,IAAX0B,GACT,OAAOA,GAETd,EAAKC,MAAQH,EAAGV,KAChBY,EAAKG,MAAQH,EACTD,IACEA,EAAMU,GAAGf,EAAKK,EAAOD,GACzBE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,MAErCE,EAGL1B,GAAUA,EAAO8B,QACnB9B,EAAO8B,QAAUR,EACRrB,GAAUA,EAAO8B,IAC1B9B,GAAO,WAAa,OAAOqB,KAE3BhB,KAAK+C,UAAY/B,GAIjBhB,EAC+BN,EACZ,mBAAXC,QAAyBA,uDCrEzBF,EAAQC,EAAQC,YAEjBgC,EAAOY,GACd,IAAIC,EAAKxC,KAGTwC,EAAGhC,KAAO,WACR,IACwBC,EAAG2B,EADvBJ,EAAIQ,EAAGR,EACPS,EAAID,EAAGC,EAAGrC,EAAIoC,EAAGpC,EAcrB,OAZAoC,EAAGR,EAAIA,EAAKA,EAAI,WAAc,EAE9BI,EAAIK,EAAGrC,EAAI,GAAM,KACjBK,EAAIgC,EAAErC,EAAMA,EAAI,EAAK,KACrBgC,GAAKA,GAAK,GACV3B,GAAKA,GAAK,GACV2B,GAAKA,IAAM,GACX3B,GAAKA,IAAM,GAEX2B,EAAIK,EAAErC,GAAKgC,EAAI3B,EACf+B,EAAGpC,EAAIA,EAECgC,GAAKJ,EAAKA,IAAM,IAAQ,YAGpBjC,EAAIF,GAChB,IAAIY,EAAG2B,EAAGhC,EAAGsC,EAAGV,EAAGS,EAAI,GAAIO,EAAQ,IAYnC,IAXInD,KAAiB,EAAPA,IAEZuC,EAAIvC,EACJA,EAAO,OAGPA,GAAc,KACduC,EAAI,EACJY,EAAQC,KAAKC,IAAIF,EAAOnD,EAAKQ,SAG1BD,EAAI,EAAGsC,GAAI,GAAKA,EAAIM,IAASN,EAE5B7C,IAAMuC,GAAKvC,EAAKU,YAAYmC,EAAI,IAAM7C,EAAKQ,SAErC,IAANqC,IAASV,EAAII,GACjBA,GAAKA,GAAK,GACVA,GAAKA,IAAM,GACXA,GAAKA,GAAK,EACVA,GAAKA,IAAM,GACPM,GAAK,IACPV,EAAKA,EAAI,WAAc,EAEvB5B,EAAK,IADLK,EAAKgC,EAAM,IAAJC,IAAaN,EAAIJ,GACT5B,EAAI,EAAI,GAW3B,IAPIA,GAAK,MACPqC,EAA+B,KAA5B5C,GAAQA,EAAKQ,QAAU,KAAY,GAKxCD,EAAI,IACCsC,EAAI,IAASA,EAAI,IAAKA,EACzBN,EAAIK,EAAGrC,EAAI,GAAM,KACjBK,EAAIgC,EAAErC,EAAMA,EAAI,EAAK,KACrBgC,GAAKA,GAAK,GACV3B,GAAKA,GAAK,GACV2B,GAAKA,IAAM,GACX3B,GAAKA,IAAM,GACXgC,EAAErC,GAAKgC,EAAI3B,EAGbV,EAAGiC,EAAIA,EACPjC,EAAG0C,EAAIA,EACP1C,EAAGK,EAAIA,EAGTwC,CAAKJ,EAAID,YAGFzB,EAAKC,EAAGN,GAIf,OAHAA,EAAEL,EAAIW,EAAEX,EACRK,EAAEuB,EAAIjB,EAAEiB,EACRvB,EAAEgC,EAAI1B,EAAE0B,EAAEI,QACHpC,WAGAO,EAAKnB,EAAMoB,GACN,MAARpB,IAAcA,GAAS,IAAIiD,MAC/B,IAAI5B,EAAK,IAAIS,EAAO9B,GAChBsB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGV,SAAW,GAAK,YAenD,OAdAY,EAAKE,OAAS,cAEV,IAEIY,IAFMhB,EAAGV,SAAW,KACbU,EAAGV,SAAW,GAAK,YACF,cACV,IAAX0B,GACT,OAAOA,GAETd,EAAKC,MAAQH,EAAGV,KAChBY,EAAKG,MAAQH,EACTD,IACEA,EAAMsB,GAAG3B,EAAKK,EAAOD,GACzBE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,MAErCE,EAGL1B,GAAUA,EAAO8B,QACnB9B,EAAO8B,QAAUR,EACRrB,GAAUA,EAAO8B,IAC1B9B,GAAO,WAAa,OAAOqB,KAE3BhB,KAAKmD,QAAUnC,GAIfhB,EAC+BN,EACZ,mBAAXC,QAAyBA,uDC5IzBF,EAAQC,EAAQC,YAEjBgC,EAAO9B,GACd,IAAIE,EAAKC,KAAM4B,EAAU,GAGzB7B,EAAGS,KAAO,WACR,IAAI4C,EAAIrD,EAAGqD,EAAGzC,EAAIZ,EAAGY,EAAG0B,EAAItC,EAAGsC,EAAGgB,EAAItD,EAAGsD,EAQzC,OAPAD,EAAKA,GAAK,GAAOA,IAAM,EAAKzC,EAC5BA,EAAKA,EAAI0B,EAAK,EACdA,EAAKA,GAAK,GAAOA,IAAM,EAAKgB,EAC5BA,EAAKA,EAAID,EAAK,EACdrD,EAAGqD,EAAIA,EAAKA,GAAK,GAAOA,IAAM,GAAMzC,EACpCZ,EAAGY,EAAIA,EAAKA,EAAI0B,EAAK,EACrBtC,EAAGsC,EAAKA,GAAK,GAAO1B,IAAM,GAAM0C,EACzBtD,EAAGsD,EAAKA,EAAID,EAAK,GAmB1BrD,EAAGsD,EAAI,EACPtD,EAAGqD,EAAI,EACPrD,EAAGY,GAAI,WACPZ,EAAGsC,EAAI,WAEHxC,IAASoD,KAAKK,MAAMzD,IAEtBE,EAAGsD,EAAKxD,EAAO,WAAe,EAC9BE,EAAGqD,EAAW,EAAPvD,GAGP+B,GAAW/B,EAIb,IAAK,IAAIoC,EAAI,EAAGA,EAAIL,EAAQvB,OAAS,GAAI4B,IACvClC,EAAGqD,GAA6B,EAAxBxB,EAAQrB,WAAW0B,GAC3BlC,EAAGS,gBAIEM,EAAKC,EAAGN,GAKf,OAJAA,EAAE4C,EAAItC,EAAEsC,EACR5C,EAAE2C,EAAIrC,EAAEqC,EACR3C,EAAEE,EAAII,EAAEJ,EACRF,EAAE4B,EAAItB,EAAEsB,EACD5B,WAGAO,EAAKnB,EAAMoB,GAClB,IAAIC,EAAK,IAAIS,EAAO9B,GAChBsB,EAAQF,GAAQA,EAAKE,MACrBC,EAAO,WAAa,OAAQF,EAAGV,SAAW,GAAK,YAenD,OAdAY,EAAKE,OAAS,cAEV,IAEIY,IAFMhB,EAAGV,SAAW,KACbU,EAAGV,SAAW,GAAK,YACF,cACV,IAAX0B,GACT,OAAOA,GAETd,EAAKC,MAAQH,EAAGV,KAChBY,EAAKG,MAAQH,EACTD,IACmB,iBAAVA,GAAoBL,EAAKK,EAAOD,GAC3CE,EAAKD,MAAQ,WAAa,OAAOL,EAAKI,EAAI,MAErCE,EAGL1B,GAAUA,EAAO8B,QACnB9B,EAAO8B,QAAUR,EACRrB,GAAUA,EAAO8B,IAC1B9B,GAAO,WAAa,OAAOqB,KAE3BhB,KAAKuD,OAASvC,GAIdhB,EAC+BN,EACZ,mBAAXC,QAAyBA,2DC5FjC,SAASF,GAGT,IAEI+D,EAFAC,EAAKC,OAAOC,UACZC,EAASH,EAAGI,eAEZC,EAA4B,mBAAXC,OAAwBA,OAAS,GAClDC,EAAiBF,EAAQG,UAAY,aACrCC,EAAsBJ,EAAQK,eAAiB,kBAC/CC,EAAoBN,EAAQO,aAAe,gBAG3CC,EAAU7E,EAAO8E,mBACrB,GAAID,EAIAE,EAAiBF,MAJrB,EAaAA,EAAU7E,EAAO8E,mBAAgCC,GAczCC,KAAOA,EAoBf,IAAIC,EAAyB,iBACzBC,EAAyB,iBACzBC,EAAoB,YACpBC,EAAoB,YAIpBC,EAAmB,GAYnBC,EAAoB,GACxBA,EAAkBf,GAAkB,WAClC,OAAOhE,MAGT,IAAIgF,EAAWtB,OAAOuB,eAClBC,EAA0BF,GAAYA,EAASA,EAASG,EAAO,MAC/DD,GACAA,IAA4BzB,GAC5BG,EAAOwB,KAAKF,EAAyBlB,KAGvCe,EAAoBG,GAGtB,IAAIG,EAAKC,EAA2B3B,UAClC4B,EAAU5B,UAAYD,OAAO8B,OAAOT,GACtCU,EAAkB9B,UAAY0B,EAAGK,YAAcJ,EAC/CA,EAA2BI,YAAcD,EACzCH,EAA2BlB,GACzBqB,EAAkBE,YAAc,oBAYlCrB,EAAQsB,oBAAsB,SAASC,GACrC,IAAIC,EAAyB,mBAAXD,GAAyBA,EAAOH,YAClD,QAAOI,IACHA,IAASL,GAG2B,uBAAnCK,EAAKH,aAAeG,EAAKC,QAIhCzB,EAAQ0B,KAAO,SAASH,GAUtB,OATInC,OAAOuC,eACTvC,OAAOuC,eAAeJ,EAAQP,IAE9BO,EAAOK,UAAYZ,EACblB,KAAqByB,IACzBA,EAAOzB,GAAqB,sBAGhCyB,EAAOlC,UAAYD,OAAO8B,OAAOH,GAC1BQ,GAOTvB,EAAQ6B,MAAQ,SAASC,GACvB,MAAO,CAAEC,QAASD,IAsEpBE,EAAsBC,EAAc5C,WACpC4C,EAAc5C,UAAUO,GAAuB,WAC7C,OAAOlE,MAETsE,EAAQiC,cAAgBA,EAKxBjC,EAAQkC,MAAQ,SAASC,EAASC,EAASC,EAAMC,GAC/C,IAAIC,EAAO,IAAIN,EACb9B,EAAKgC,EAASC,EAASC,EAAMC,IAG/B,OAAOtC,EAAQsB,oBAAoBc,GAC/BG,EACAA,EAAKrG,OAAOsG,MAAK,SAAS5E,GACxB,OAAOA,EAAO6E,KAAO7E,EAAO8E,MAAQH,EAAKrG,WAsKjD8F,EAAsBjB,GAEtBA,EAAGjB,GAAqB,YAOxBiB,EAAGrB,GAAkB,WACnB,OAAOhE,MAGTqF,EAAG4B,SAAW,WACZ,MAAO,sBAkCT3C,EAAQ4C,KAAO,SAASC,GACtB,IAAID,EAAO,GACX,IAAK,IAAIE,KAAOD,EACdD,EAAKvE,KAAKyE,GAMZ,OAJAF,EAAKG,UAIE,SAAS7G,SACP0G,EAAK7G,QAAQ,CAClB,IAAIiH,EAAMJ,EAAKK,MACf,GAAID,KAAOH,EAGT,OAFA3G,EAAKwG,MAAQM,EACb9G,EAAKuG,MAAO,EACLvG,EAQX,OADAA,EAAKuG,MAAO,EACLvG,IAsCX8D,EAAQa,OAASA,EAMjBqC,EAAQ7D,UAAY,CAClB+B,YAAa8B,EAEbC,MAAO,SAASC,GAcd,GAbA1H,KAAK2H,KAAO,EACZ3H,KAAKQ,KAAO,EAGZR,KAAK4H,KAAO5H,KAAK6H,MAAQrE,EACzBxD,KAAK+G,MAAO,EACZ/G,KAAK8H,SAAW,KAEhB9H,KAAK+H,OAAS,OACd/H,KAAKoG,IAAM5C,EAEXxD,KAAKgI,WAAWC,QAAQC,IAEnBR,EACH,IAAK,IAAI3B,KAAQ/F,KAEQ,MAAnB+F,EAAKoC,OAAO,IACZvE,EAAOwB,KAAKpF,KAAM+F,KACjBqC,OAAOrC,EAAKlD,MAAM,MACrB7C,KAAK+F,GAAQvC,IAMrB6E,KAAM,WACJrI,KAAK+G,MAAO,EAEZ,IACIuB,EADYtI,KAAKgI,WAAW,GACLO,WAC3B,GAAwB,UAApBD,EAAWE,KACb,MAAMF,EAAWlC,IAGnB,OAAOpG,KAAKyI,MAGdC,kBAAmB,SAASC,GAC1B,GAAI3I,KAAK+G,KACP,MAAM4B,EAGR,IAAIC,EAAU5I,cACL6I,EAAOC,EAAKC,GAYnB,OAXAC,EAAOR,KAAO,QACdQ,EAAO5C,IAAMuC,EACbC,EAAQpI,KAAOsI,EAEXC,IAGFH,EAAQb,OAAS,OACjBa,EAAQxC,IAAM5C,KAGNuF,EAGZ,IAAK,IAAI3I,EAAIJ,KAAKgI,WAAW3H,OAAS,EAAGD,GAAK,IAAKA,EAAG,CACpD,IAAI6I,EAAQjJ,KAAKgI,WAAW5H,GACxB4I,EAASC,EAAMV,WAEnB,GAAqB,SAAjBU,EAAMC,OAIR,OAAOL,EAAO,OAGhB,GAAII,EAAMC,QAAUlJ,KAAK2H,KAAM,CAC7B,IAAIwB,EAAWvF,EAAOwB,KAAK6D,EAAO,YAC9BG,EAAaxF,EAAOwB,KAAK6D,EAAO,cAEpC,GAAIE,GAAYC,EAAY,CAC1B,GAAIpJ,KAAK2H,KAAOsB,EAAMI,SACpB,OAAOR,EAAOI,EAAMI,UAAU,GACzB,GAAIrJ,KAAK2H,KAAOsB,EAAMK,WAC3B,OAAOT,EAAOI,EAAMK,iBAGjB,GAAIH,GACT,GAAInJ,KAAK2H,KAAOsB,EAAMI,SACpB,OAAOR,EAAOI,EAAMI,UAAU,OAG3B,CAAA,IAAID,EAMT,MAAM,IAAIG,MAAM,0CALhB,GAAIvJ,KAAK2H,KAAOsB,EAAMK,WACpB,OAAOT,EAAOI,EAAMK,gBAU9BE,OAAQ,SAAShB,EAAMpC,GACrB,IAAK,IAAIhG,EAAIJ,KAAKgI,WAAW3H,OAAS,EAAGD,GAAK,IAAKA,EAAG,CACpD,IAAI6I,EAAQjJ,KAAKgI,WAAW5H,GAC5B,GAAI6I,EAAMC,QAAUlJ,KAAK2H,MACrB/D,EAAOwB,KAAK6D,EAAO,eACnBjJ,KAAK2H,KAAOsB,EAAMK,WAAY,CAChC,IAAIG,EAAeR,EACnB,OAIAQ,IACU,UAATjB,GACS,aAATA,IACDiB,EAAaP,QAAU9C,GACvBA,GAAOqD,EAAaH,aAGtBG,EAAe,MAGjB,IAAIT,EAASS,EAAeA,EAAalB,WAAa,GAItD,OAHAS,EAAOR,KAAOA,EACdQ,EAAO5C,IAAMA,EAETqD,GACFzJ,KAAK+H,OAAS,OACd/H,KAAKQ,KAAOiJ,EAAaH,WAClBxE,GAGF9E,KAAK0J,SAASV,IAGvBU,SAAU,SAASV,EAAQW,GACzB,GAAoB,UAAhBX,EAAOR,KACT,MAAMQ,EAAO5C,IAcf,MAXoB,UAAhB4C,EAAOR,MACS,aAAhBQ,EAAOR,KACTxI,KAAKQ,KAAOwI,EAAO5C,IACM,WAAhB4C,EAAOR,MAChBxI,KAAKyI,KAAOzI,KAAKoG,IAAM4C,EAAO5C,IAC9BpG,KAAK+H,OAAS,SACd/H,KAAKQ,KAAO,OACa,WAAhBwI,EAAOR,MAAqBmB,IACrC3J,KAAKQ,KAAOmJ,GAGP7E,GAGT8E,OAAQ,SAASN,GACf,IAAK,IAAIlJ,EAAIJ,KAAKgI,WAAW3H,OAAS,EAAGD,GAAK,IAAKA,EAAG,CACpD,IAAI6I,EAAQjJ,KAAKgI,WAAW5H,GAC5B,GAAI6I,EAAMK,aAAeA,EAGvB,OAFAtJ,KAAK0J,SAAST,EAAMV,WAAYU,EAAMU,UACtCzB,EAAce,GACPnE,IAKb+E,MAAS,SAASX,GAChB,IAAK,IAAI9I,EAAIJ,KAAKgI,WAAW3H,OAAS,EAAGD,GAAK,IAAKA,EAAG,CACpD,IAAI6I,EAAQjJ,KAAKgI,WAAW5H,GAC5B,GAAI6I,EAAMC,SAAWA,EAAQ,CAC3B,IAAIF,EAASC,EAAMV,WACnB,GAAoB,UAAhBS,EAAOR,KAAkB,CAC3B,IAAIsB,EAASd,EAAO5C,IACpB8B,EAAce,GAEhB,OAAOa,GAMX,MAAM,IAAIP,MAAM,0BAGlBQ,cAAe,SAASC,EAAUC,EAAYC,GAa5C,OAZAlK,KAAK8H,SAAW,CACd7D,SAAUkB,EAAO6E,GACjBC,WAAYA,EACZC,QAASA,GAGS,SAAhBlK,KAAK+H,SAGP/H,KAAKoG,IAAM5C,GAGNsB,aAnqBFL,EAAKgC,EAASC,EAASC,EAAMC,GAEpC,IAAIuD,EAAiBzD,GAAWA,EAAQ/C,qBAAqB4B,EAAYmB,EAAUnB,EAC/E6E,EAAY1G,OAAO8B,OAAO2E,EAAexG,WACzCiF,EAAU,IAAIpB,EAAQZ,GAAe,IAMzC,OAFAwD,EAAUC,iBAkMc5D,EAASE,EAAMiC,GACvC,IAAIzH,EAAQuD,EAEZ,OAAO,SAAgBqD,EAAQ3B,GAC7B,GAAIjF,IAAUyD,EACZ,MAAM,IAAI2E,MAAM,gCAGlB,GAAIpI,IAAU0D,EAAmB,CAC/B,GAAe,UAAXkD,EACF,MAAM3B,EAKR,OAAOkE,QAGT1B,EAAQb,OAASA,EACjBa,EAAQxC,IAAMA,IAED,CACX,IAAI0B,EAAWc,EAAQd,SACvB,GAAIA,EAAU,CACZ,IAAIyC,EAAiBC,EAAoB1C,EAAUc,GACnD,GAAI2B,EAAgB,CAClB,GAAIA,IAAmBzF,EAAkB,SACzC,OAAOyF,GAIX,GAAuB,SAAnB3B,EAAQb,OAGVa,EAAQhB,KAAOgB,EAAQf,MAAQe,EAAQxC,SAElC,GAAuB,UAAnBwC,EAAQb,OAAoB,CACrC,GAAI5G,IAAUuD,EAEZ,MADAvD,EAAQ0D,EACF+D,EAAQxC,IAGhBwC,EAAQF,kBAAkBE,EAAQxC,SAEN,WAAnBwC,EAAQb,QACjBa,EAAQY,OAAO,SAAUZ,EAAQxC,KAGnCjF,EAAQyD,EAER,IAAIoE,EAASyB,EAAShE,EAASE,EAAMiC,GACrC,GAAoB,WAAhBI,EAAOR,KAAmB,CAO5B,GAJArH,EAAQyH,EAAQ7B,KACZlC,EACAF,EAEAqE,EAAO5C,MAAQtB,EACjB,SAGF,MAAO,CACLkC,MAAOgC,EAAO5C,IACdW,KAAM6B,EAAQ7B,MAGS,UAAhBiC,EAAOR,OAChBrH,EAAQ0D,EAGR+D,EAAQb,OAAS,QACjBa,EAAQxC,IAAM4C,EAAO5C,OA1QPsE,CAAiBjE,EAASE,EAAMiC,GAE7CwB,WAcAK,EAASE,EAAIC,EAAKxE,GACzB,IACE,MAAO,CAAEoC,KAAM,SAAUpC,IAAKuE,EAAGvF,KAAKwF,EAAKxE,IAC3C,MAAOyE,GACP,MAAO,CAAErC,KAAM,QAASpC,IAAKyE,aAiBxBtF,cACAE,cACAH,cA4BAgB,EAAsB3C,GAC7B,CAAC,OAAQ,QAAS,UAAUsE,SAAQ,SAASF,GAC3CpE,EAAUoE,GAAU,SAAS3B,GAC3B,OAAOpG,KAAKqK,QAAQtC,EAAQ3B,gBAoCzBG,EAAc6D,YACZU,EAAO/C,EAAQ3B,EAAK2E,EAASC,GACpC,IAAIhC,EAASyB,EAASL,EAAUrC,GAASqC,EAAWhE,GACpD,GAAoB,UAAhB4C,EAAOR,KAEJ,CACL,IAAItG,EAAS8G,EAAO5C,IAChB6E,EAAQ/I,EAAO8E,MACnB,OAAIiE,GACiB,iBAAVA,GACPrH,EAAOwB,KAAK6F,EAAO,WACdC,QAAQH,QAAQE,EAAM5E,SAASS,MAAK,SAASE,GAClD8D,EAAO,OAAQ9D,EAAO+D,EAASC,MAC9B,SAASH,GACVC,EAAO,QAASD,EAAKE,EAASC,MAI3BE,QAAQH,QAAQE,GAAOnE,MAAK,SAASqE,GAI1CjJ,EAAO8E,MAAQmE,EACfJ,EAAQ7I,MACP,SAASkJ,GAGV,OAAON,EAAO,QAASM,EAAOL,EAASC,MAvBzCA,EAAOhC,EAAO5C,KA4BlB,IAAIiF,EAgCJrL,KAAKqK,iBA9BYtC,EAAQ3B,YACdkF,IACP,OAAO,IAAIJ,SAAQ,SAASH,EAASC,GACnCF,EAAO/C,EAAQ3B,EAAK2E,EAASC,MAIjC,OAAOK,EAaLA,EAAkBA,EAAgBvE,KAChCwE,EAGAA,GACEA,cA+GDd,EAAoB1C,EAAUc,GACrC,IAAIb,EAASD,EAAS7D,SAAS2E,EAAQb,QACvC,GAAIA,IAAWvE,EAAW,CAKxB,GAFAoF,EAAQd,SAAW,KAEI,UAAnBc,EAAQb,OAAoB,CAC9B,GAAID,EAAS7D,SAASsH,SAGpB3C,EAAQb,OAAS,SACjBa,EAAQxC,IAAM5C,EACdgH,EAAoB1C,EAAUc,GAEP,UAAnBA,EAAQb,QAGV,OAAOjD,EAIX8D,EAAQb,OAAS,QACjBa,EAAQxC,IAAM,IAAIoF,UAChB,kDAGJ,OAAO1G,EAGT,IAAIkE,EAASyB,EAAS1C,EAAQD,EAAS7D,SAAU2E,EAAQxC,KAEzD,GAAoB,UAAhB4C,EAAOR,KAIT,OAHAI,EAAQb,OAAS,QACjBa,EAAQxC,IAAM4C,EAAO5C,IACrBwC,EAAQd,SAAW,KACZhD,EAGT,IAAI2G,EAAOzC,EAAO5C,IAElB,OAAMqF,EAOFA,EAAK1E,MAGP6B,EAAQd,EAASmC,YAAcwB,EAAKzE,MAGpC4B,EAAQpI,KAAOsH,EAASoC,QAQD,WAAnBtB,EAAQb,SACVa,EAAQb,OAAS,OACjBa,EAAQxC,IAAM5C,GAUlBoF,EAAQd,SAAW,KACZhD,GANE2G,GA3BP7C,EAAQb,OAAS,QACjBa,EAAQxC,IAAM,IAAIoF,UAAU,oCAC5B5C,EAAQd,SAAW,KACZhD,YAoDF4G,EAAaC,GACpB,IAAI1C,EAAQ,CAAEC,OAAQyC,EAAK,IAEvB,KAAKA,IACP1C,EAAMI,SAAWsC,EAAK,IAGpB,KAAKA,IACP1C,EAAMK,WAAaqC,EAAK,GACxB1C,EAAMU,SAAWgC,EAAK,IAGxB3L,KAAKgI,WAAWrF,KAAKsG,YAGdf,EAAce,GACrB,IAAID,EAASC,EAAMV,YAAc,GACjCS,EAAOR,KAAO,gBACPQ,EAAO5C,IACd6C,EAAMV,WAAaS,WAGZxB,EAAQZ,GAIf5G,KAAKgI,WAAa,CAAC,CAAEkB,OAAQ,SAC7BtC,EAAYqB,QAAQyD,EAAc1L,MAClCA,KAAKyH,OAAM,YA8BJtC,EAAO6E,GACd,GAAIA,EAAU,CACZ,IAAI4B,EAAiB5B,EAAShG,GAC9B,GAAI4H,EACF,OAAOA,EAAexG,KAAK4E,GAG7B,GAA6B,mBAAlBA,EAASxJ,KAClB,OAAOwJ,EAGT,IAAK5B,MAAM4B,EAAS3J,QAAS,CAC3B,IAAID,GAAI,EAAIyL,EAAO,SAASrL,WACjBJ,EAAI4J,EAAS3J,WAChBuD,EAAOwB,KAAK4E,EAAU5J,GAGxB,OAFAI,EAAKwG,MAAQgD,EAAS5J,GACtBI,EAAKuG,MAAO,EACLvG,EAOX,OAHAA,EAAKwG,MAAQxD,EACbhD,EAAKuG,MAAO,EAELvG,GAGT,OAAOqL,EAAKrL,KAAOqL,GAKvB,MAAO,CAAErL,KAAM8J,YAIRA,IACP,MAAO,CAAEtD,MAAOxD,EAAWuD,MAAM,IAxfnC,CAssBC,WACC,OAAO/G,MAAyB,iBAAT2G,MAAqBA,KAD7C,IAEOmF,SAAS,cAATA,sGC5sBMC,EAAaC,EAAyBC,GACnD,GAAID,EAAOE,MAAQ,EAAI,EACpB,MAAM,IAAI3C,MAAM,mDAGnB,IAAI4C,EAAsCzI,OAAO0I,YAC9C1I,OAAO2I,QAAQJ,GAAUK,KAAG,EAAGvG,EAAMwG,KAC3B,CACJxG,kBAES,IAAImF,SAASH,GAAYyB,WAAWzB,EAAS,IAAOiB,EAAOS,WACjEF,SAaRG,EAAUlG,UACX,IAAK,IAAIvE,EAAI,EAAGA,EAAI+J,EAAOW,MAAQ,EAAG1K,UAC7BkK,EAAKS,SAGbC,EAASrG,UACV,IAAK,IAAIvE,EAAI,EAAGA,EAAI+J,EAAOW,MAAQ,EAAG1K,UAC7BkK,EAAKW,QAGbC,EAAUvG,UACX,IAAK,IAAIvE,EAAI,EAAGA,EAAI+J,EAAOE,MAAQ,EAAGjK,IAC/BA,EAAI,SACCkK,EAAKa,aAERN,UACAP,EAAKa,aACLH,KAGRI,EAAQzG,UACT,IAAK,IAAIvE,EAAI,EAAGA,EAAI+J,EAAOE,MAAOjK,UACzBkK,EAAKe,MAGV1G,oBAhCCA,iBACC2F,EAAKe,WACLf,EAAKW,aACLX,EAAKW,aACLX,EAAKW,aACLX,EAAKe,MA4BLtK,WAEGuJ,EAAKS,cACLG,UACAZ,EAAKW,aACLG,KAIZE;;;;;;;;;;;;;;iFCxCD,SAES1N,EAAQ2N,EAAMC,GAKzB,IAQIC,EARAC,EAAQ,IAIRC,EAAaH,EAAKI,IAAIF,EAHb,GAITG,EAAeL,EAAKI,IAAI,EAHf,IAITE,EAA0B,EAAfD,EACXE,EAAOL,aAOFM,EAAWtL,EAAMuL,EAASC,GACjC,IAAIzG,EAAM,GAIN0G,EAAYC,EAAOC,GAHvBJ,EAAsB,GAAXA,EAAmB,CAAEK,SAAS,GAAUL,GAAW,IAIpDK,QAAU,CAAC5L,EAAM6L,EAAShB,IACzB,MAAR7K,aA+IH,IACE,IAAI8L,EAQJ,OAPIf,IAAee,EAAMf,EAAWgB,aAElCD,EAAMA,EAAId,IAEVc,EAAM,IAAIE,WAAWhB,IACpB9N,EAAO+O,QAAU/O,EAAOgP,UAAUC,gBAAgBL,IAE9CD,EAASC,GAChB,MAAOM,GACP,IAAIC,EAAUnP,EAAOoP,UACjBC,EAAUF,GAAWA,EAAQE,QACjC,MAAO,EAAE,IAAIhM,KAAMrD,EAAQqP,EAASrP,EAAOsP,OAAQX,EAAShB,KA5J3C4B,GAAazM,EAAM,GAAI+E,GAGtC2H,EAAO,IAAIC,EAAK5H,GAIhB6H,EAAO,eACT,IAAIrP,EAAImP,EAAKG,EA5BJ,GA6BL/M,EAAImL,EACJ3L,EAAI,EACD/B,EAAI4N,GACT5N,GAAKA,EAAI+B,GAAK0L,EACdlL,GAAKkL,EACL1L,EAAIoN,EAAKG,EAAE,QAENtP,GAAK6N,GACV7N,GAAK,EACLuC,GAAK,EACLR,KAAO,EAET,OAAQ/B,EAAI+B,GAAKQ,GAWnB,OARA8M,EAAK9N,MAAQ,WAAa,OAAmB,EAAZ4N,EAAKG,EAAE,IACxCD,EAAK5N,MAAQ,WAAa,OAAO0N,EAAKG,EAAE,GAAK,YAC7CD,EAAK7N,OAAS6N,EAGdlB,EAAOG,EAASa,EAAKI,GAAIjC,IAGjBU,EAAQwB,MAAQvB,GACpB,SAAS3M,EAAMvB,EAAM0P,EAAcpO,GAUjC,OATIA,IAEEA,EAAMkO,GAAKvO,EAAKK,EAAO8N,GAE3B7N,EAAKD,MAAQ,WAAa,OAAOL,EAAKmO,EAAM,MAK1CM,GAAgBlC,EAAY,OAAIjM,EAAavB,GAIrCuB,IAElB+N,EACAnB,EACA,WAAYF,EAAUA,EAAQrO,OAAUO,MAAQqN,EAChDS,EAAQ3M,gBAaD+N,EAAK5H,GACZ,IAAIkI,EAAGC,EAASnI,EAAIjH,OAChBN,EAAKC,KAAM0P,EAAI,EAAGC,EAAI5P,EAAGK,EAAIL,EAAG2C,EAAI,EAAG9B,EAAIb,EAAGsP,EAAI,OAGjDI,IAAUnI,EAAM,CAACmI,MAGfC,EAAInC,GACT3M,EAAE8O,GAAKA,IAET,IAAKA,EAAI,EAAGA,EAAInC,EAAOmC,IACrB9O,EAAE8O,GAAK9O,EAAE+O,EAAI/B,EAAQ+B,EAAIrI,EAAIoI,EAAID,IAAWD,EAAI5O,EAAE8O,KAClD9O,EAAE+O,GAAKH,GAIRzP,EAAGqP,EAAI,SAASQ,OAEf,IAAInP,EAAGoP,EAAI,EACPzP,EAAIL,EAAGK,EAAGsC,EAAI3C,EAAG2C,EAAGoN,EAAI/P,EAAGsP,EACxBO,KACLnP,EAAIqP,EAAE1P,EAAIwN,EAAQxN,EAAI,GACtByP,EAAIA,EAAItC,EAAQuC,EAAElC,GAASkC,EAAE1P,GAAK0P,EAAEpN,EAAIkL,EAAQlL,EAAIjC,KAAQqP,EAAEpN,GAAKjC,IAGrE,OADAV,EAAGK,EAAIA,EAAGL,EAAG2C,EAAIA,EACVmN,IAINtC,YAOIzM,EAAKC,EAAGN,GAIf,OAHAA,EAAEL,EAAIW,EAAEX,EACRK,EAAEiC,EAAI3B,EAAE2B,EACRjC,EAAE4O,EAAItO,EAAEsO,EAAExM,QACHpC,WAOAyN,EAAQtD,EAAKmF,GACpB,IAAqCC,EAAjC9N,EAAS,GAAI+N,SAAcrF,EAC/B,GAAImF,GAAgB,UAAPE,EACX,IAAKD,KAAQpF,EACX,IAAM1I,EAAOS,KAAKuL,EAAQtD,EAAIoF,GAAOD,EAAQ,IAAO,MAAOpB,IAG/D,OAAQzM,EAAO7B,OAAS6B,EAAgB,UAAP+N,EAAkBrF,EAAMA,EAAM,cAQxDqD,EAAOpO,EAAMyH,OACpB,IAA4B4I,EAAxBC,EAAatQ,EAAO,GAAW6C,EAAI,EAChCA,EAAIyN,EAAW9P,QACpBiH,EAAIsG,EAAOlL,GACTkL,GAASsC,GAAyB,GAAhB5I,EAAIsG,EAAOlL,IAAWyN,EAAW5P,WAAWmC,KAElE,OAAO0L,EAAS9G,YA8BT8G,EAAS/K,GAChB,OAAOlD,OAAOiQ,aAAaC,MAAM,EAAGhN,GAgBtC,GANA4K,EAAOZ,EAAKiD,SAAUlD,GAMamD,EAAgB,CACjDA,EAAiB1C,EAEjB,IACEP,EAAakD,EAAA,SACb,MAAOC,SACmB,mBAAX9Q,QAAyBA,OAAO8B,IACjD9B,QAAO,WAAa,OAAOkO,KAG3BR,EAAqB,WAAIQ,EA3NzB,CAmOiB,oBAATlH,KAAwBA,KAAO4J,EACvC,GACAtN,MCvMFsN,EAAG7O,KAAOgP,EACVH,EAAGpO,OAASwO,EACZJ,EAAGjO,OAASsO,EACZL,EAAGxN,UAAY8N,EACfN,EAAGpN,QAAU2N,EACbP,EAAGhN,OAASwN,EAEZC,EAAiBT,EClCuB,IAAAU,EAAA,SAAAC,EAAAC,UAAEF,EAACvN,OAAAuC,gBAAA,CACrCC,UAAa,cAClBkL,OAAA,SAAA/O,EAAAe,GAEUf,EAAA6D,UAAA9C,IACP,SAAAf,EAAAe,GACI,IAAK,IAAIiO,KAAIjO,EAAOA,EAAAS,eAAawN,KAAQhP,EAACgP,GAAMjO,EAACiO,MAERH,EAACC,aAE1CG,EAAQjP,EAAAe,GAEZ,SAAOmO,IACVvR,KAAA0F,YAAArD,EAFG4O,EAAC5O,EAAAe,GAKDf,EAAAsB,UAAS,OAAAP,EAAAM,OAAA8B,OAAApC,IAAAmO,EAAA5N,UAAAP,EAAAO,UAAA,IAAA4N,YA6BsFC,EAAAC,EAAAC,EAAAC,EAAAvH,cACCuH,IAAAA,EAAAzG,WAAA,SAAAH,EAAAC,GAAC,SAAC4G,EAAA5K,OACtE6K,EAAOzH,EAAO5J,KAAQwG,IAAgE,MAAA2H,GACxG3D,EAAS2D,aAIPmD,EAAA9K,GACJ,IAAU6K,EAAAzH,EAAA,MAAApD,IAAQ,MAAA2H,GAAiB3D,EAAO2D,IAA+B,SAAQkD,EAAA3P,OAP5E8E,EAOiF9E,EAAI6E,KAAAgE,EAAA7I,EAAA8E,QAPrFA,EAOqF9E,EAAA8E,MAPhEA,aAAE2K,EAAA3K,EAAA,IAAA2K,GAAA,SAAA5G,KAAK/D,OAOyDF,KAAA8K,EAAAE,MAEzF1H,EAASA,EAAAiG,MAAAoB,EAAAC,GAAA,KAAAlR,sBAAqCiR,EAAAM,WAK/CtR,EAAI2O,WAL+C,EAAGxH,KAAC,WAAG,GAAA,EAAAnH,EAAA,GAAA,MAAAA,EAAA,UACpDA,EAAE,SAEL,OACH,eACsBX,mBAAgBsC,GAAA,gBAGlC4P,cAAS,IAACxG,UAAK,0DAAkB/K,EAAM,EAAFuR,EAAE,GAAAlQ,EAAA,OAAAkQ,EAAA,GAAAlQ,EAAA,SAAArB,EAAAqB,EAAA,SAAArB,EAAA2E,KAAAtD,GAAA,GAAAA,EAAAtB,SAAAC,EAAAA,EAAA2E,KAAAtD,EAAAkQ,EAAA,KAAAjL,KAAA,OAAAtG,iBAAGuR,EAAM,CAAO,OACvDvR,EAAAuG,UAAoB,SAAU,EAAM,KAAA,EAACvG,EAACuR,EAAE,MACxC,KAAK,EAAqB,OAAlBC,EAAEC,QAAuB,CAAOlL,MAAQgL,EAAA,6BAE+DlQ,EAACkQ,EAAA,GAC5GA,EAAI,CAAyD,GAAwB,cACrF,IAAsCC,EAACE,IAAK5K,aAAUA,uBACtD,KAAK9G,EAAKwR,EAACG,MAAK3R,EAAMA,EAAAJ,OAAI,GAAAI,EAAAA,EAAAJ,OAAA,KAAA,IAAA2R,EAAA,IAAA,IAAAA,EAAA,IAAA,CAACC,EAAE,EAAc,SAAuB,GAAC,IAAAD,EAAA,MAAAvR,GAAAuR,EAAA,GAAAvR,EAAA,IAAAuR,EAAA,GAAAvR,EAAA,IAAA,CAC/DwR,EAAEC,MAAMF,EAAI,GACd,iCAEAC,EAAIC,MAAQzR,EAAE,GACfA,EAAAuR,EAAO,MAAI,GAAAvR,GAAAwR,EAAAC,MAAAzR,EAAA,GAAA,CAACwR,EAAAC,MAAAzR,EAAA,GAAOwR,EAAAE,IAAAxP,KAAAqP,GAAa,MAAavR,EAAA,IAAAwR,EAAAE,IAAA5K,MAC9C0K,EAACG,KAAE7K,MAAqB,SAAgCyK,EAAID,EAAM3M,KAAAqM,EAAAQ,GAAE,MAAAtD,GACnFqD,EAAA,CAvBW,EAAOrD,GAAmC7M,EAAA,EAAa,QAAmEf,EAAON,EAAI,EAwBpJ,GAAA,EAAAuR,EAAA,GAAA,MAAAA,EAAA,SAEe,CACNhL,MAAKgL,EAAA,GAAWA,EAAE,QAAI,EACpBjL,MAAG,GAtBoC8K,CAAA,CACvC/R,EACIsC,KAwBZ,OAAQgN,EAAE,CACb5O,KAAA6R,EAAA,SAEeA,EAAA,GACR9G,OAAU8G,EAAC,IACM,mBAAdtO,SAAeqL,EAAArL,OAAAE,UAAA,WAClB,OAAKjE,OACLoP,EAMR,SAACkD,EAAAC,SAEe,mBAAAxO,QAAAA,OAAOE,SAAOuO,EAAA1C,GAAAyC,EAAAzC,GAAA1P,EAAA,EAC1B,GAAIoS,EAAC,OAASA,EAACpN,KAAMmN,GACrB,GAAEA,GAAc,iBAAAA,EAAAlS,OAAA,MAAA,CACZG,KAAM,kBACL+R,GAAAnS,GAAAmS,EAAAlS,SAAAkS,OAAA,GACQ,CAENvL,MAAQuL,GAAAA,EAAAnS,KAAM2G,MAAAwL,WAEjB,IAAK/G,UAAAsE,EAAA,0BAAA,4CAEJ2C,EACQF,EAAAzS,SAAgB,mBAARiE,QAAawO,EAAAxO,OAAAE,cAAGuO,EAAA,OAAAD,EACrC,IAAC1C,EAAAlB,EAAAvO,EAAAoS,EAAApN,KAAAmN,GAAAG,EAAA,GACD,IACH,WAAA,IAAA5S,GAAAA,KAAA,MAAA+P,EAAAzP,EAAAI,QAAAuG,MAAA2L,EAAA/P,KAAAkN,EAAA7I,aAEeoE,GACPuD,EAAI,CAEFvD,MAAEA,WAIJ,IACQyE,IAAMA,EAAC9I,OAAUyL,EAAIpS,EAAS,SAAGoS,EAC1CpN,KAAKhF,GAEH,QACT,GAAAuO,EAAA,MAAAA,EAAAvD,OAIA,OAAAsH,WAGQC,IACL,IAAI,IAAID,EAAA,GAAStS,EAAC,EAAMA,EAAAwS,UAASvS,OAAUD,IAAMsS,EAAMA,EAACG,OAAKJ,EAAAG,UAAAxS,yBAqBoCmS,cAAEpO,cAAO,MAAA,IAAAqH,UAAA,4CAAEpL,IAADmS,EAACxO,OAAAI,wBAAMkO,EAAMvS,GAAIM,EAAAN,GAAAyS,EAAAzS,IAAA,SAAAsC,GAFpH,OAAK,IAAM8I,SAAM,SAAUH,EAAAC,aAKvBD,EAAAC,EAAA3I,EAAAyQ,GACR5H,QAAOH,QAAA+H,GAAAhM,MAAkB,SAAO1E,GAAgC2I,EAAU,CAAE/D,MAAA5E,EAAmB2E,KAAM1E,MAE5G2I,IARsI+H,CAAGhI,EAAaC,GAA/B5I,EAAAmQ,EAAGzS,GAAIsC,IAA6B2E,KAAO3E,EAAA4E,WAW/J,OAAOwL,EAAIA,EAAApN,KAAImN,IAAAA,EAAsBD,EAAAC,GAAAnS,EAAA,GAClCiS,EAAC,QAAUA,EAAA,SAAAA,EAAA,UAAAjS,EAAA2D,OAAAI,eAAA,WAAC,OAAAnE,MACbI,YC7LU4S,EAAWhM,GACzB,MAAwB,mBAAVA,WCIAiM,EAAoBC,GAClC,IAKMC,EAAWD,GALF,SAACE,GACd7J,MAAMnE,KAAKgO,GACXA,EAASC,OAAQ,IAAI9J,OAAQ8J,SAM/B,OAFAF,EAASxP,UAAYD,OAAO8B,OAAO+D,MAAM5F,WACzCwP,EAASxP,UAAU+B,YAAcyN,EAC1BA,ECLF,IAAMG,EAA+CL,GAC1D,SAACM,GACC,OAAA,SAA4CC,GAC1CD,EAAOvT,MACPA,KAAKyT,QAAUD,EACRA,EAAOnT,OAAM,4CACxBmT,EAAOlH,KAAI,SAACzB,EAAKzK,GAAM,OAAGA,EAAI,EAAC,KAAKyK,EAAI5D,cAAcyM,KAAK,QACnD,GACJ1T,KAAK+F,KAAO,sBACZ/F,KAAKwT,OAASA,eCjBJG,EAAaC,EAA6BC,GACxD,GAAID,EAAK,CACP,IAAME,EAAQF,EAAIG,QAAQF,GAC1B,GAAKC,GAASF,EAAII,OAAOF,EAAO,ICQpC,IAAAG,EAAA,oBAyBEA,EAAoBC,GAAAlU,KAAAkU,gBAAAA,EAdblU,KAAAmU,QAAS,EAERnU,KAAAoU,WAAmD,KAMnDpU,KAAAqU,WAAoD,KAjBzC,IACXC,EA+KV,OAjJEL,EAAAtQ,UAAA4Q,YAAA,uBACMf,EAEJ,IAAKxT,KAAKmU,OAAQ,CAChBnU,KAAKmU,QAAS,EAGN,IAAAC,EAAepU,KAAIoU,WAC3B,GAAIhD,MAAMoD,QAAQJ,OAChB,IAAqB,IAAAK,EAAAnC,EAAA8B,GAAUM,EAAAD,EAAAjU,QAAAkU,EAAA3N,KAAA2N,EAAAD,EAAAjU,OAAE,CAAhBkU,EAAA1N,MACR2N,OAAO3U,6GAGhBoU,MAAAA,GAAAA,EAAYO,OAAO3U,MAGb,IAAAkU,EAAoBlU,KAAIkU,gBAChC,GAAIlB,EAAWkB,GACb,IACEA,IACA,MAAOvF,GACP6E,EAAS7E,aAAa2E,EAAsB3E,EAAE6E,OAAS,CAAC7E,GAIpD,IAAA0F,EAAerU,KAAIqU,WAC3B,GAAIA,EAAY,CACdrU,KAAKqU,WAAa,SAClB,IAAuB,IAAAO,EAAAtC,EAAA+B,GAAUQ,EAAAD,EAAApU,QAAAqU,EAAA9N,KAAA8N,EAAAD,EAAApU,OAAE,CAA9B,IAAMsU,EAAQD,EAAA7N,MACjB,IACE+N,EAAaD,GACb,MAAOjK,GACP2I,EAASA,MAAAA,EAAAA,EAAU,GACf3I,aAAeyI,EACjBE,EAAMb,EAAOa,EAAW3I,EAAI2I,QAE5BA,EAAO7Q,KAAKkI,uGAMpB,GAAI2I,EACF,MAAM,IAAIF,EAAoBE,KAuBpCS,EAAAtQ,UAAAqR,IAAA,SAAIC,SAGF,GAAIA,GAAYA,IAAajV,KAC3B,GAAIA,KAAKmU,OAGPY,EAAaE,OACR,CACL,GAAIA,aAAoBhB,EAAc,CAGpC,GAAIgB,EAASd,QAAUc,EAASC,WAAWlV,MACzC,OAEFiV,EAASE,WAAWnV,OAErBA,KAAKqU,WAA4B,QAAlBe,EAAGpV,KAAKqU,kBAAU,IAAAe,EAAAA,EAAI,IAAIzS,KAAKsS,KAU7ChB,EAAAtQ,UAAAuR,WAAR,SAAmBG,GACT,IAAAjB,EAAepU,KAAIoU,WAC3B,OAAOA,IAAeiB,GAAWjE,MAAMoD,QAAQJ,IAAeA,EAAWkB,SAASD,IAU5EpB,EAAAtQ,UAAAwR,WAAR,SAAmBE,GACT,IAAAjB,EAAepU,KAAIoU,WAC3BpU,KAAKoU,WAAahD,MAAMoD,QAAQJ,IAAeA,EAAWzR,KAAK0S,GAASjB,GAAcA,EAAa,CAACA,EAAYiB,GAAUA,GAOpHpB,EAAAtQ,UAAA4R,cAAR,SAAsBF,GACZ,IAAAjB,EAAepU,KAAIoU,WACvBA,IAAeiB,EACjBrV,KAAKoU,WAAa,KACThD,MAAMoD,QAAQJ,IACvBT,EAAUS,EAAYiB,IAkB1BpB,EAAAtQ,UAAAgR,OAAA,SAAOM,GACG,IAAAZ,EAAerU,KAAIqU,WAC3BA,GAAcV,EAAUU,EAAYY,GAEhCA,aAAoBhB,GACtBgB,EAASM,cAAcvV,OA7KbiU,EAAAuB,QACNlB,EAAQ,IAAIL,GACZE,QAAS,EACRG,GA6KXL,EAlLA,GAoLawB,EAAqBxB,EAAauB,eAE/BE,EAAe1O,GAC7B,OACEA,aAAiBiN,GAChBjN,GAAS,WAAYA,GAASgM,EAAWhM,EAAM2N,SAAW3B,EAAWhM,EAAMgO,MAAQhC,EAAWhM,EAAMuN,sBAIhGQ,EAAaE,GAChBjC,EAAWiC,GACbA,IAEAA,EAASV,cC3MN,IAAMoB,EAAS,CAUpBC,iBAAkB,KAYlBC,sBAAuB,KAUvB3K,aAAS1H,EAcTsS,uCAAuC,EAgBvCC,0BAA0B,GCvDfC,EAAmC,CAG9CxJ,WAAA,WAAW,IAAA,IAAAyJ,EAAA,GAAAC,EAAA,EAAAA,EAAAtD,UAAAvS,OAAA6V,IAAAD,EAAAC,GAAAtD,UAAAsD,GACD,IAAApO,EAAakO,EAAelO,SACpC,QAAQA,MAAAA,OAAQ,EAARA,EAAU0E,aAAcA,YAAW6D,WAAA,EAAAsC,EAAIsD,KAEjDE,aAAY,SAACtN,GACH,IAAAf,EAAakO,EAAelO,SACpC,QAAQA,MAAAA,OAAQ,EAARA,EAAUqO,eAAgBA,cAActN,IAElDf,cAAUtE,YCbI4S,EAAqBvL,GACnCmL,EAAgBxJ,YAAW,WACjB,IAAAoJ,EAAqBD,EAAMC,iBACnC,IAAIA,EAKF,MAAM/K,EAHN+K,EAAiB/K,eCjBPwL,KCOT,IAAMC,EAA+BC,EAAmB,SAAK/S,OAAWA,YA0B/D+S,EAAmBC,EAAuBxP,EAAYoE,GACpE,MAAO,CACLoL,KAAIA,EACJxP,MAAKA,EACLoE,MAAKA,GClBT,IAAAqL,EAAA,SAAAlD,YAwBEkD,EAAYC,GAAZ,IAAAC,EACEpD,EAAAnO,KAAApF,OAAOA,YAPC2W,EAAAC,WAAqB,EAQzBF,GACFC,EAAKD,YAAcA,EAGfhB,EAAegB,IACjBA,EAAY1B,IAAI2B,IAGlBA,EAAKD,YAAcG,IAsEzB,OAxGmCvF,EAAAmF,EAAAlD,GAc1BkD,EAAAjR,OAAP,SAAiBhF,EAAwB4K,EAA2B1B,GAClE,OAAO,IAAIoN,EAAetW,EAAM4K,EAAO1B,IA8BzC+M,EAAA9S,UAAAnD,KAAA,SAAKwG,GACChH,KAAK4W,UACPG,WD3C8B/P,GAClC,OAAOuP,EAAmB,IAAKvP,OAAOxD,GC0CRwT,CAAiBhQ,GAAQhH,MAEnDA,KAAKiX,MAAMjQ,IAWfyP,EAAA9S,UAAAyH,MAAA,SAAMP,GACA7K,KAAK4W,UACPG,EDlEGR,EAAmB,SAAK/S,ECkEiBqH,GAAM7K,OAElDA,KAAK4W,WAAY,EACjB5W,KAAKkX,OAAOrM,KAUhB4L,EAAA9S,UAAA+F,SAAA,WACM1J,KAAK4W,UACPG,EAA0BT,EAAuBtW,OAEjDA,KAAK4W,WAAY,EACjB5W,KAAKmX,cAITV,EAAA9S,UAAA4Q,YAAA,WACOvU,KAAKmU,SACRnU,KAAK4W,WAAY,EACjBrD,EAAA5P,UAAM4Q,YAAWnP,KAAApF,QAIXyW,EAAA9S,UAAAsT,MAAV,SAAgBjQ,GACdhH,KAAK0W,YAAYlW,KAAKwG,IAGdyP,EAAA9S,UAAAuT,OAAV,SAAiBrM,GACf7K,KAAK0W,YAAYtL,MAAMP,GACvB7K,KAAKuU,eAGGkC,EAAA9S,UAAAwT,UAAV,WACEnX,KAAK0W,YAAYhN,WACjB1J,KAAKuU,eAETkC,EAxGA,CAAmCxC,GA0GnC6C,EAAA,SAAAvD,YACEuD,EACEM,EACAhM,EACA1B,GAHF,IAAAiN,EAKEpD,EAAAnO,KAAApF,OAAOA,KAKP,GADA2W,EAAKD,YAAcG,GACdO,GAAkBhM,GAAS1B,IAAa0N,IAAmBP,EAAgB,CAI9E,IAAIrW,OAAI,EACR,GAAIwS,EAAWoE,GACb5W,EAAO4W,OACF,GAAIA,EAAgB,CAOzB,IAAIC,EADD7W,EAA0B4W,EAAc5W,KAAlC4K,EAAoBgM,EAAchM,MAA3B1B,EAAa0N,EAAc1N,SAEvCiN,GAAQhB,EAAOI,0BAIjBsB,EAAU3T,OAAO8B,OAAO4R,IAChB7C,YAAc,WAAM,OAAAoC,EAAKpC,eAEjC8C,EAAUD,EAEZ5W,EAAOA,MAAAA,OAAI,EAAJA,EAAM8W,KAAKD,GAClBjM,EAAQA,MAAAA,OAAK,EAALA,EAAOkM,KAAKD,GACpB3N,EAAWA,MAAAA,OAAQ,EAARA,EAAU4N,KAAKD,GAK5BV,EAAKD,YAAc,CACjBlW,KAAMA,GAAQ6V,EACdjL,MAAOA,GAASmM,EAChB7N,SAAUA,GAAY2M,YAI9B,OAjDuC/E,EAAAwF,EAAAvD,GAiDvCuD,EAjDA,CAAuCL,YAyD9Bc,EAAoB1M,GAE3B,GAAI8K,EAAOG,sCACT,MAAMjL,EAERuL,EAAqBvL,YAQdkM,EAA0BS,EAA2CC,GACpE,IAAA5B,EAA0BF,EAAME,sBACxCA,GAAyBG,EAAgBxJ,YAAW,WAAM,OAAAqJ,EAAsB2B,EAAcC,MAQzF,IAAMZ,EAA0C,CACrD1C,QAAQ,EACR3T,KAAM6V,EACNjL,MAAOmM,EACP7N,SAAU2M,GC/MCqB,EAAuC,mBAAX3T,QAAyBA,OAAO4T,YAAe,wBCHxEC,EAAY/V,GAC1B,OAAOA,WCqBOgW,EAAoBC,GAClC,OAAmB,IAAfA,EAAIzX,OACCuX,EAGU,IAAfE,EAAIzX,OACCyX,EAAI,GAGN,SAAeC,GACpB,OAAOD,EAAIE,QAAO,SAACrQ,EAAWgD,GAA4B,OAAAA,EAAGhD,KAAOoQ,ICdxE,IAAAE,EAAA,oBAcEA,EAAYC,GACNA,IACFlY,KAAKmY,WAAaD,GAmbxB,OAtZYD,EAAAtU,UAAAyU,KAAV,SAAkBC,GAChB,IAAMV,EAAa,IAAIM,EAGvB,OAFAN,EAAWW,OAAStY,KACpB2X,EAAWU,SAAWA,EACfV,GAwITM,EAAAtU,UAAAuU,UAAA,SACEd,EACAhM,EACA1B,GAEA,IAsRqB1C,EAtRfyQ,GAsRezQ,EAtRWoQ,IAuRjBpQ,aAAiByP,YALbzP,GACrB,OAAOA,GAASgM,EAAWhM,EAAMxG,OAASwS,EAAWhM,EAAMoE,QAAU4H,EAAWhM,EAAM0C,UAIpC6O,CAAWvR,IAAU0O,EAAe1O,GAvRlCoQ,EAAiB,IAAIN,EAAeM,EAAgBhM,EAAO1B,GASrG2O,EAAqBrY,KAAbqY,SAAEC,EAAWtY,KAALsY,OASxB,OARAb,EAAWzC,IACTqD,EACIA,EAASjT,KAAKqS,EAAYa,GAC1BA,GAAU3C,EAAOG,sCACjB9V,KAAKmY,WAAWV,GAChBzX,KAAKwY,cAAcf,IAGlBA,GAICQ,EAAAtU,UAAA6U,cAAV,SAAwBC,GACtB,IACE,OAAOzY,KAAKmY,WAAWM,GACvB,MAAO5N,GACP,GAAI8K,EAAOG,sCACT,MAAMjL,EAER4N,EAAKrN,MAAMP,KA+DfoN,EAAAtU,UAAAsE,QAAA,SAAQzH,EAA0BkY,GAAlC,IAAA/B,EAAA3W,KAGE,OAAO,IAFP0Y,EAAcC,EAAeD,KAEA,SAAC3N,EAASC,GAGrC,IAAI4N,EACJA,EAAejC,EAAKuB,WAClB,SAAClR,GACC,IACExG,EAAKwG,GACL,MAAO6D,GACPG,EAAOH,GACP+N,MAAAA,GAAAA,EAAcrE,iBAGlBvJ,EACAD,OAMIkN,EAAAtU,UAAAwU,WAAV,SAAqBV,SACnB,OAAkB,QAAlBrC,EAAOpV,KAAKsY,cAAM,IAAAlD,OAAA,EAAAA,EAAE8C,UAAUT,IAQhCQ,EAAAtU,UAAC+T,GAAD,WACE,OAAO1X,MA6FTiY,EAAAtU,UAAAkV,KAAA,WAAK,IAAA,IAAAC,EAAA,GAAA5C,EAAA,EAAAA,EAAAtD,UAAAvS,OAAA6V,IAAA4C,EAAA5C,GAAAtD,UAAAsD,GACH,OAAO4C,EAAWzY,OAASwX,EAAciB,EAAdjB,CAA0B7X,MAAQA,MA8B/DiY,EAAAtU,UAAAoV,UAAA,SAAUL,GAAV,IAAA/B,EAAA3W,KAGE,OAAO,IAFP0Y,EAAcC,EAAeD,KAEN,SAAC3N,EAASC,GAC/B,IAAIhE,EACJ2P,EAAKuB,WACH,SAACrW,GAAS,OAACmF,EAAQnF,KACnB,SAACgJ,GAAa,OAAAG,EAAOH,MACrB,WAAM,OAAAE,EAAQ/D,UAhabiR,EAAAzS,OAAkC,SAAI0S,GAC3C,OAAO,IAAID,EAAcC,IAma7BD,EAncA,YA4cSU,EAAeD,SACtB,OAAoC,QAApCtD,EAAOsD,MAAAA,EAAAA,EAAe/C,EAAOzK,eAAO,IAAAkK,EAAAA,EAAIlK,QC7cnC,IAAM8N,EAAuD/F,GAClE,SAACM,GACC,OAAA,WACEA,EAAOvT,MACPA,KAAK+F,KAAO,0BACZ/F,KAAKyT,QAAU,0BCPrBwF,EAAA,SAAA1F,YAqBE0F,IAAA,IAAAtC,EAEEpD,EAAAnO,KAAApF,OAAOA,YAtBT2W,EAAAuC,UAA2B,GAE3BvC,EAAAxC,QAAS,EAETwC,EAAAC,WAAY,EAEZD,EAAAwC,UAAW,EAEXxC,EAAAyC,YAAmB,OA0GrB,OAnHgC9H,EAAA2H,EAAA1F,GA0B9B0F,EAAAtV,UAAAyU,KAAA,SAAQC,GACN,IAAMgB,EAAU,IAAIC,EAAiBtZ,KAAMA,MAE3C,OADAqZ,EAAQhB,SAAWA,EACZgB,GAGCJ,EAAAtV,UAAA4V,eAAV,WACE,GAAIvZ,KAAKmU,OACP,MAAM,IAAI6E,GAIdC,EAAAtV,UAAAnD,KAAA,SAAKwG,WAEH,GADAhH,KAAKuZ,kBACAvZ,KAAK4W,UAAW,CACnB,IAAM9V,EAAOd,KAAKkZ,UAAUrW,YAC5B,IAAuB,IAAA2W,EAAAlH,EAAAxR,GAAI2Y,EAAAD,EAAAhZ,QAAAiZ,EAAA1S,KAAA0S,EAAAD,EAAAhZ,OAAE,CAAViZ,EAAAzS,MACRxG,KAAKwG,wGAKpBiS,EAAAtV,UAAAyH,MAAA,SAAMP,GAEJ,GADA7K,KAAKuZ,kBACAvZ,KAAK4W,UAAW,CACnB5W,KAAKmZ,SAAWnZ,KAAK4W,WAAY,EACjC5W,KAAKoZ,YAAcvO,MACX,IAAAqO,EAAclZ,KAAIkZ,UACnBA,EAAU7Y,QACf6Y,EAAUQ,QAAStO,MAAMP,KAK/BoO,EAAAtV,UAAA+F,SAAA,WAEE,GADA1J,KAAKuZ,kBACAvZ,KAAK4W,UAAW,CACnB5W,KAAK4W,WAAY,MACT,IAAAsC,EAAclZ,KAAIkZ,UACnBA,EAAU7Y,QACf6Y,EAAUQ,QAAShQ,aAKzBuP,EAAAtV,UAAA4Q,YAAA,WACEvU,KAAK4W,UAAY5W,KAAKmU,QAAS,EAC/BnU,KAAKkZ,UAAY,MAITD,EAAAtV,UAAA6U,cAAV,SAAwBf,GAEtB,OADAzX,KAAKuZ,iBACEhG,EAAA5P,UAAM6U,cAAapT,KAAApF,KAACyX,IAInBwB,EAAAtV,UAAAwU,WAAV,SAAqBV,GAGnB,OAFAzX,KAAKuZ,iBACLvZ,KAAK2Z,wBAAwBlC,GACtBzX,KAAK4Z,gBAAgBnC,IAGpBwB,EAAAtV,UAAAiW,gBAAV,SAA0BnC,GAA1B,IAAAd,EAAA3W,KACQoV,EAAqCpV,KAAnCmZ,EAAQ/D,EAAA+D,SAAEvC,EAASxB,EAAAwB,UAAEsC,EAAS9D,EAAA8D,UACtC,OAAOC,GAAYvC,EACfnB,GACCyD,EAAUvW,KAAK8U,GAAa,IAAIxD,GAAa,WAAM,OAAAN,EAAUgD,EAAKuC,UAAWzB,QAG1EwB,EAAAtV,UAAAgW,wBAAV,SAAkClC,GAC1B,IAAArC,EAAuCpV,KAArCmZ,EAAQ/D,EAAA+D,SAAEC,EAAWhE,EAAAgE,YAAExC,EAASxB,EAAAwB,UACpCuC,EACF1B,EAAWrM,MAAMgO,GACRxC,GACTa,EAAW/N,YASfuP,EAAAtV,UAAAkW,aAAA,WACE,IAAMlC,EAAkB,IAAIM,EAE5B,OADAN,EAAWW,OAAStY,KACb2X,GAhGFsB,EAAAzT,OAAkC,SAAIkR,EAA0B4B,GACrE,OAAO,IAAIgB,EAAoB5C,EAAa4B,IAiGhDW,EAnHA,CAAgChB,GAwHhCqB,EAAA,SAAA/F,YACE+F,EAAsB5C,EAA2B4B,GAAjD,IAAA3B,EACEpD,EAAAnO,KAAApF,OAAOA,YADa2W,EAAAD,YAAAA,EAEpBC,EAAK2B,OAASA,IAmBlB,OAtByChH,EAAAgI,EAAA/F,GAMvC+F,EAAA3V,UAAAnD,KAAA,SAAKwG,WACmB,QAAtB8S,EAAgB,QAAhB1E,EAAApV,KAAK0W,mBAAW,IAAAtB,OAAA,EAAAA,EAAE5U,YAAI,IAAAsZ,GAAAA,EAAA1U,KAAAgQ,EAAGpO,IAG3BsS,EAAA3V,UAAAyH,MAAA,SAAMP,WACmB,QAAvBiP,EAAgB,QAAhB1E,EAAApV,KAAK0W,mBAAW,IAAAtB,OAAA,EAAAA,EAAEhK,aAAK,IAAA0O,GAAAA,EAAA1U,KAAAgQ,EAAGvK,IAG5ByO,EAAA3V,UAAA+F,SAAA,mBAC4B,QAA1BoQ,EAAgB,QAAhB1E,EAAApV,KAAK0W,mBAAW,IAAAtB,OAAA,EAAAA,EAAE1L,gBAAQ,IAAAoQ,GAAAA,EAAA1U,KAAAgQ,IAI5BkE,EAAA3V,UAAAwU,WAAA,SAAWV,WACT,OAAwC,QAAxCqC,EAAkB,QAAlB1E,EAAOpV,KAAKsY,cAAM,IAAAlD,OAAA,EAAAA,EAAE8C,UAAUT,UAAU,IAAAqC,EAAAA,EAAKrE,GAEjD6D,EAtBA,CAAyCL,YCvHzBc,EACdnX,GAEA,OAAO,SAAC0V,GACN,YAZoBA,GACtB,OAAOtF,EAAWsF,MAAAA,OAAM,EAANA,EAAQF,MAWpB4B,CAAQ1B,GACV,OAAOA,EAAOF,MAAK,SAA+B6B,GAChD,IACE,OAAOrX,EAAKqX,EAAcja,MAC1B,MAAO6K,GACP7K,KAAKoL,MAAMP,OAIjB,MAAM,IAAIW,UAAU,2CCvBxB,IAAA0O,EAAA,SAAA3G,YAaE2G,EACExD,EACAyD,EACAC,EACAC,EACQC,GALV,IAAA3D,EAOEpD,EAAAnO,KAAApF,KAAM0W,IAAY1W,YAFV2W,EAAA2D,cAAAA,EAGJH,IACFxD,EAAKM,MAAQ,SAAUjQ,GACrB,IACEmT,EAAOnT,GACP,MAAO6D,GACP7K,KAAK0W,YAAYtL,MAAMP,MAIzBuP,IACFzD,EAAKO,OAAS,SAAUrM,GACtB,IACEuP,EAAQvP,GACR,MAAO0P,GAEPva,KAAK0W,YAAYtL,MAAMmP,GAGzBva,KAAKuU,gBAGL8F,IACF1D,EAAKQ,UAAY,WACf,IACEkD,IACA,MAAOxP,GAEP7K,KAAK0W,YAAYtL,MAAMP,GAGzB7K,KAAKuU,kBAUb,OA7D2CjD,EAAA4I,EAAA3G,GAwDzC2G,EAAAvW,UAAA4Q,YAAA,kBAEGvU,KAAKmU,SAA4B,QAAtBiB,EAAIpV,KAAKsa,qBAAa,IAAAlF,GAAAA,EAAAhQ,KAAlBpF,OAChBuT,EAAA5P,UAAM4Q,YAAWnP,KAAApF,OAErBka,EA7DA,CAA2CzD,YCmC3B+D,EAAUC,EAAyChJ,GACjE,OAAOsI,GAAQ,SAACzB,EAAQb,GAEtB,IAAI3D,EAAQ,EAGZwE,EAAOJ,UACL,IAAIgC,EAAmBzC,GAAY,SAACzQ,GAGlCyQ,EAAWjX,KAAKia,EAAQrV,KAAKqM,EAASzK,EAAO8M,aCpD9C,IAAM4G,EAAe,SAAI7Y,GAA8B,OAAAA,GAAyB,iBAAbA,EAAExB,QAAoC,mBAANwB,YCM1F8Y,GAAU3T,GACxB,OAAOgM,EAAWhM,MAAAA,OAAK,EAALA,EAAOF,MCCpB,IAAM8T,GAPW,mBAAX7W,QAA0BA,OAAOE,SAIrCF,OAAOE,SAHL,sBCEK4W,GAAiB9C,EAAqB+C,GACpD,OAAO,IAAI7C,GAAc,SAACR,GAExB,IAAIrX,EAAI,EAER,OAAO0a,EAAUC,UAAS,WACpB3a,IAAM2X,EAAM1X,OAGdoX,EAAW/N,YAIX+N,EAAWjX,KAAKuX,EAAM3X,MAIjBqX,EAAWtD,QACdnU,KAAK+a,2BCjBCC,GAAoBjD,GAClC,OAAO/E,EAAW+E,EAAML,aCFVuD,GAAWlD,GACzB,OAAO/E,EAAW+E,MAAAA,OAAK,EAALA,EAAQ6C,cCFZM,GAAmBtQ,GACjC,OAAO7G,OAAOI,eAAiB6O,EAAWpI,MAAAA,OAAG,EAAHA,EAAM7G,OAAOI,yBCEzCgX,GAAiCpD,GAE/C,OAAO,IAAIvM,UACT,iBACY,OAAVuM,GAAmC,iBAAVA,EAAqB,oBAAsB,IAAIA,EAAK,KAAG,qHCmHtEqD,GAAarD,GAC3B,GAAIA,aAAiBE,EACnB,OAAOF,EAET,GAAa,MAATA,EAAe,CACjB,GAAIiD,GAAoBjD,GACtB,OAuB4BnN,EAvBCmN,EAwB1B,IAAIE,GAAW,SAACR,GACrB,IAAM4D,EAAMzQ,EAAI8M,KAChB,GAAI1E,EAAWqI,EAAInD,WACjB,OAAOmD,EAAInD,UAAUT,GAGvB,MAAM,IAAIjM,UAAU,qEA5BpB,GAAIkP,EAAY3C,GACd,OAAOuD,GAAcvD,GAEvB,GAAI4C,GAAU5C,GACZ,OAqDkBwD,EArDCxD,EAsDhB,IAAIE,GAAW,SAACR,GACrB8D,EACGzU,MACC,SAACE,GACMyQ,EAAWtD,SACdsD,EAAWjX,KAAKwG,GAChByQ,EAAW/N,eAGf,SAACmB,GAAa,OAAA4M,EAAWrM,MAAMP,MAEhC/D,KAAK,KAAMsP,MA/Dd,GAAI8E,GAAgBnD,GAClB,OA2FwByD,EA3FCzD,EA4FtB,IAAIE,GAAW,SAACR,aAKC+D,EAAiC/D,yIAC/BgE,EAAAC,EAAAF,+EAATxU,EAAK2U,EAAA3U,MACpByQ,EAAWjX,KAAKwG,qSAElByQ,EAAW/N,uBARTkS,CAAQJ,EAAe/D,GAAY5N,OAAM,SAACgB,GAAQ,OAAA4M,EAAWrM,MAAMP,SA3FnE,GAAIoQ,GAAWlD,GACb,OA+DmB/N,EA/DC+N,EAgEjB,IAAIE,GAAW,SAACR,OACrB,IAAMxT,EAAY+F,EAAiB4Q,OAE3BnD,EAAWtD,QAAQ,CAInB,IAAAiB,EAAkBnR,EAASzD,OAAzBuG,EAAIqO,EAAArO,KAAEC,EAAKoO,EAAApO,MACfD,EAKF0Q,EAAW/N,WAEX+N,EAAWjX,KAAKwG,GAKpB,OAAO,WAAM,OAAAgM,EAAW/O,MAAAA,OAAQ,EAARA,EAAUsH,SAAWtH,EAASsH,iBArBjCvB,EAyBKwR,EAzCND,EApCU3Q,EAPhC,MAAMuQ,GAAiCpD,YAyBzBuD,GAAiBO,GAC/B,OAAO,IAAI5D,GAAW,SAACR,GAUrB,IAAK,IAAIrX,EAAI,EAAGA,EAAIyb,EAAMxb,SAAWoX,EAAWtD,OAAQ/T,IACtDqX,EAAWjX,KAAKqb,EAAMzb,IAExBqX,EAAW/N,uBCzGCoS,GACdrB,EACAsB,EACAC,GAEA,YAFA,IAAAA,IAAAA,EAAAC,EAAAA,GAEIjJ,EAAW+I,GAEND,IAAS,SAACzY,EAAGjD,GAAM,OAAAoa,GAAI,SAACpX,EAAQ8Y,GAAe,OAAAH,EAAe1Y,EAAGD,EAAGhD,EAAG8b,KAApD1B,CAAyDY,GAAUX,EAAQpX,EAAGjD,OAAM4b,IAC3E,iBAAnBD,IAChBC,EAAaD,GAGRhC,GAAQ,SAACzB,EAAQb,GAAe,gBCxEvCa,EACAb,EACAgD,EACAuB,EACAG,EACAC,EACAC,EACAC,GAGA,IAAIC,EAAc,GAEdC,EAAS,EAET1I,EAAQ,EAER2I,GAAa,EAKXC,EAAgB,YAIhBD,GAAeF,EAAOlc,QAAWmc,GACnC/E,EAAW/N,YAKTiT,EAAY,SAAC3V,GAAa,OAACwV,EAASR,EAAaY,EAAW5V,GAASuV,EAAO5Z,KAAKqE,IAEjF4V,EAAa,SAAC5V,GAIlBoV,GAAU3E,EAAWjX,KAAKwG,GAI1BwV,IAGApB,GAAUX,EAAQzT,EAAO8M,MAAUoE,UACjC,IAAIgC,EACFzC,GACA,SAACoF,GAGCV,MAAAA,GAAAA,EAAeU,GAEXT,EAGFO,EAAUE,GAGVpF,EAAWjX,KAAKqc,UAIpBrZ,GACA,WAIEgZ,yBAME,IAAMM,EAAgBP,EAAO7C,QAI7B2C,EAAoB5E,EAAWzC,IAAIqH,EAAkBtB,UAAS,WAAM,OAAA6B,EAAWE,OAAmBF,EAAWE,IALxGP,EAAOlc,QAAUmc,EAASR,OAQjCU,SAuBR,OAhBApE,EAAOJ,UACL,IAAIgC,EACFzC,EACAkF,OAEAnZ,GACA,WAEEiZ,GAAa,EACbC,QAOC,WAELH,EAAS,KACTD,MAAAA,GAAAA,KDlCqCS,CAAezE,EAAQb,EAAYgD,EAASuB,OAM9E,IEhGCgB,GAAY5L,MAAKoD,iBAUTyI,GAAuBtS,GACnC,OAAO6P,GAAI,SAAAvE,GAAQ,gBATItL,EAA6BsL,GACpD,OAAO+G,GAAQ/G,GAAQtL,EAAE0F,WAAA,EAAAsC,EAAIsD,IAAQtL,EAAGsL,GAQrBiH,CAAYvS,EAAIsL,MCLvC,IAAMkH,GAA0B,CAAC,cAAe,kBAC1CC,GAAqB,CAAC,mBAAoB,uBAC1CC,GAAgB,CAAC,KAAM,gBAkLbC,GACdC,EACAC,EACA1P,EACAiO,GAOA,GALI/I,EAAWlF,KAEbiO,EAAiBjO,EACjBA,OAAUtK,GAERuY,EAEF,OAAOuB,GAAaC,EAAQC,EAAW1P,GAA6C+K,KAAKoE,GAAiBlB,IAUtG,IC/M6BhE,EAAqB+C,ED+MlD1F,EAAA3C,WA8Ee8K,GACrB,OAAOvK,EAAWuK,EAAOE,mBAAqBzK,EAAWuK,EAAOG,qBA7E9DC,CAAcJ,GACVH,GAAmB9Q,KAAI,SAACsR,GAAe,OAAA,SAACC,GAAiB,OAAAN,EAAOK,GAAYJ,EAAWK,EAAS/P,gBAyDvEyP,GAC/B,OAAOvK,EAAWuK,EAAOO,cAAgB9K,EAAWuK,EAAOQ,gBAxDvDC,CAAwBT,GACtBJ,GAAwB7Q,IAAI2R,GAAwBV,EAAQC,aA+DjCD,GACjC,OAAOvK,EAAWuK,EAAOW,KAAOlL,EAAWuK,EAAOY,KA/D5CC,CAA0Bb,GAC1BF,GAAc/Q,IAAI2R,GAAwBV,EAAQC,IAClD,GAAE,GATDxI,EAAGI,EAAA,GAAET,EAAMS,EAAA,GAgBlB,OAAKJ,GACC0F,EAAY6C,GACPzB,IAAS,SAACuC,GAAmB,OAAAf,GAAUe,EAAWb,EAAW1P,KAA7DgO,ECjOwB/D,EDkOXwF,ECjOjBzC,EAAYD,GAAc9C,EAAO+C,GAAaQ,GAAcvD,KDsO5D,IAAIE,GAAc,SAACR,GAGxB,IAAKzC,EAIH,MAAM,IAAIxJ,UAAU,wBAKtB,IAAMqS,EAAU,WAAC,IAAA,IAAA5H,EAAA,GAAAC,EAAA,EAAAA,EAAAtD,UAAAvS,OAAA6V,IAAAD,EAAAC,GAAAtD,UAAAsD,GAAmB,OAAAuB,EAAWjX,KAAK,EAAIyV,EAAK5V,OAAS4V,EAAOA,EAAK,KAIlF,OAFAjB,EAAI6I,GAEG,WAAM,OAAAlJ,EAAQkJ,gBAWhBI,GAAwBV,EAAaC,GAC5C,OAAO,SAACI,GAAuB,OAAA,SAACC,GAAiB,OAAAN,EAAOK,GAAYJ,EAAWK,KEtQ1E,IAAIS,GAAa,CACrBC,EACAC,KAEA,IAAM3c,EAAG4c,EAAO3c,EAAG4c,GAAUH,EAC7B,OAAOnN,MAAMuN,KAAK,CAAEte,OAAQqe,IAAO,CAAGzM,EAAGnQ,IAC/BsP,MAAMuN,KAAK,CAAEte,OAAQoe,IAAO,CAAGxM,EAAGpQ,IAAM2c,EAAa,GAAE1c,IAAGD,SCJ5D+c,GAAYC,IACpB,OAAQA,GACL,IAAK,OACF,MAAO,CAAEhd,GAAG,EAAIC,EAAG,GACtB,IAAK,QACF,MAAO,CAAED,EAAG,EAAGC,EAAG,GACrB,IAAK,KACF,MAAO,CAAED,EAAG,EAAGC,GAAG,GACrB,IAAK,OACF,MAAO,CAAED,EAAG,EAAGC,EAAG,KCwChBgd,GAAuB3d,IAC/B,IAAI4d,EAAyC,GAEzChf,EAAoB,CACrBif,KAAI,IACM7d,EAEV8d,MAAMjY,GACH7F,EAAQ6F,EAER+X,EAAe9W,SAASwP,IACrBA,EAAWzQ,OAGjBkR,UAAUT,IACPsH,EAAepc,KAAK8U,GAEd,KACH,IAAI3D,EAAQiL,EAAehL,QAAQ0D,GAC/B3D,GAAQ,GACTiL,EAAe/K,OAAOF,EAAO,KAItCoL,OAAOzH,GACJA,EAAWtW,GACXpB,EAAGmY,UAAUT,IAEhB0H,aACGJ,EAAe/K,OAAO,EAAG+K,EAAe1e,UAI9C,OAAON,GCpFCqf,GAAS,CAAI/b,EAASD,IACvBC,EAAExB,IAAMuB,EAAEvB,GAAKwB,EAAEvB,IAAMsB,EAAEtB,EAGxBud,GAAO,CAAIhc,EAASD,KACrB,CACJvB,EAAGwB,EAAExB,EAAIuB,EAAEvB,EACXC,EAAGuB,EAAEvB,EAAIsB,EAAEtB,ICTNwd,GAAG,CAAIjc,EAAWD,KAAgBC,EAAID,EAAKA,GAAKA,ECmBhDmc,GAAiBvP,IACzB,IAoBIwP,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,EACAC,GA5BCC,OAACA,EAAMC,SAAEA,EAAQC,cAAEA,EAAeC,aAAcC,EAAOC,SAAEA,GAAatQ,EACvEuQ,ECrBgB,CAAIN,IACxB,IAAIM,EAAMN,EAAOO,WAAW,MAC5B,GAAY,OAARD,EACD,MAAM,IAAIhX,MAEb,OAAOgX,GDgBGE,CAAaR,GAGnBS,EAAU,IAAKL,GACfM,EAAOrC,GAA6B4B,GAAWU,GAChDxB,GAAUwB,EAAKF,GACV,CACG,CACGlY,KAAM,OACNmW,KAAM,UACNkC,GAAI,YAGV,KAEJ9O,EAAoB,GAEpB+O,EAAyB,CAAEjf,EAAG,EAAGC,EAAG,GA2DpCif,EAAgB,KAEjBR,EAAIS,UE7FS,OF8FbT,EAAIU,SAAS,EAAG,EAAGhB,EAAO1S,MAAO0S,EAAOiB,QAGxC,IAAIrf,EAAI,EACJC,EAAI,EACJE,EAAI+d,EACJzf,EAAI0f,EACmB,SAAvBM,EAASa,YACVtf,GAzDc,EA0DdG,GAAK,GAEmB,SAAvBse,EAASc,YACVtf,GA5Dc,EA6DdxB,GAAK,GAERigB,EAAIS,UEhHa,OFiHjBT,EAAIU,SAASpf,EAAGC,EAAGE,EAAG1B,IAGrB+gB,EAAU,KACXV,EAAK1Y,SAAO,CAAEqZ,EAAMC,KACjBD,EAAKrZ,SAAO,CAAEuZ,EAAQC,KACnBC,EAAaF,EAAQ,CAAE1f,EAAGyf,EAAI1f,EAAG4f,WAKtCC,EAAY,CAAIF,EAAuBG,KACxC,IAAI9f,EA7Ea,EA6EO2d,EAAamC,EAAK9f,EACtCC,EA7Ea,EA6EO0d,EAAamC,EAAK7f,GAGrC6f,EAAK9f,EAAI8f,EAAK7f,GAAK,GAAK,EAC1Bye,EAAIS,UEhIS,OFkIbT,EAAIS,UEjIM,OFmIbT,EAAIU,SAASpf,EAAGC,EAAG0d,EAAYA,GAE/BgC,EAAOvZ,SAAS2Z,IACQ,SAAjBA,EAAQpZ,KACTqZ,EAAWF,IAEXG,EAAWH,EAAMC,EAAQjD,MACzBmD,EAAWH,EAAMC,EAAQf,IACJ,SAAjBe,EAAQpZ,MACTuZ,EAAWJ,QAMnBE,EAAcF,IACf,IAAI9f,EAAI2d,EAAamC,EAAK9f,EAAIie,EAC1Bhe,EAAI0d,EAAamC,EAAK7f,EAAIge,EAE9BS,EAAIS,UE1JS,OF2JbT,EAAIU,SAASpf,EAAGC,EAAG+d,EAAUA,IAQ5BiC,EAAU,CAAIlB,EAAWgB,KAC1B,IAAI/f,EAnHa,EAmHO2d,EAAaoB,EAAI/e,EAAI6d,EACzC5d,EAnHa,EAmHO0d,EAAaoB,EAAI9e,EAAI4d,EACzC1d,EAAIyd,EACJnf,EAAImf,EAEQ,YAAZmC,IACmB,QAAZA,GACRthB,GAAKof,EACL5d,GAAK4d,GACe,WAAZkC,EACRthB,GAAKof,EACe,SAAZkC,GACR5f,GAAK0d,EACL7d,GAAK6d,GACe,UAAZkC,IACR5f,GAAK0d,IAGRa,EAAIS,UEpLQ,UFqLZT,EAAIU,SAASpf,EAAGC,EAAGE,EAAG1B,IAGrByhB,EAAcnB,IACf,IAAI/e,EA1Ia,EA0IO2d,EAAaoB,EAAI/e,EAAI+d,EACzC9d,EA1Ia,EA0IO0d,EAAaoB,EAAI9e,EAAI8d,EACzC5d,EAAI2d,EACJrf,EAAIqf,EACRY,EAAIS,UE/LS,OFgMbT,EAAIU,SAASpf,EAAGC,EAAGE,EAAG1B,IAGrB0hB,EAAeC,IAChB,GAAIA,EAAMC,WAAa,EACpB,OAEH3B,EAAIS,UEnMS,OFoMbT,EAAIU,SAASlB,EAAgB,EAAGE,EAAO1S,MAAO0S,EAAOiB,QAErD,IAAIrf,EAAIke,EAAiB,GAKzBQ,EAAI4B,KAAI,qDACR5B,EAAIS,UAAY,QAChBT,EAAI6B,YAAc,QAElBC,EAAW,GAAIJ,EAAMK,YAAa,GAAEzgB,IAR5B,KASR,IAAI0gB,EAAQtf,KAAKC,IAAI8c,EAAc,GAAIle,IACnCqe,GACDkC,EAAW,GAAIJ,EAAMC,YAAa,GAAErgB,EAAGC,EAAGygB,KAI5CF,EAAW,CAAIG,EAAc5B,KAC9BL,EAAIkC,UAAY,EAChBlC,EAAImC,WAAWF,EAAM5B,EAAI/e,EAAG+e,EAAI9e,GAChCye,EAAIoC,SAASH,EAAM5B,EAAI/e,EAAG+e,EAAI9e,IAwGjC,MAAO,KAlGIqK,IAGR,IAAIyW,EAFJ7Q,EAAKpP,KAAKwJ,GAKPyW,EADe,SAAdzW,EAAK3D,KACO6W,GAAQqB,EAAS9B,GAASzS,EAAK0S,YAE/B1S,EAAKuK,YAGrB,IAAImM,EAAalC,EAAKD,EAAQ5e,GAAG4e,EAAQ7e,GACrCihB,EAAgBnC,EAAKiC,EAAW9gB,GAAG8gB,EAAW/gB,GAE9CkhB,EJrNW,cADElE,EIsNG1S,EAAK0S,WJpNlB,UAdK,CAAIA,IACnB,OAAQA,GACL,IAAK,KACF,MAAO,MACV,IAAK,OACF,MAAO,SACV,IAAK,OACL,IAAK,QACF,OAAOA,IAQHmE,CAAQnE,GAJF,IAAIA,EIuNjB,IAAIoE,EJlMY,CAAIF,GACV,YAATA,EACMA,EAfQ,CAAIA,IACtB,OAAQA,GACL,IAAK,MACF,MAAO,SACV,IAAK,SACF,MAAO,MACV,IAAK,OACF,MAAO,QACV,IAAK,QACF,MAAO,SAQHG,CAAWH,GI8LCI,CAAYJ,GAE3BK,EAAcP,EAAWhgB,OAAM,GAAI,GACd,SAArBugB,EAAY5a,MAAwC,SAArB4a,EAAY5a,OAC5C4a,EAAYvC,GAAKkC,GAEK,SAArBK,EAAY5a,OACX4a,EAAoB5a,KAAO,QAGhCsa,EAAcngB,KAAK,CAChB6F,KAAM,OACNmW,KAAMsE,EACNpC,GAAI,YAGPa,EAAamB,EAAYnC,GACzBgB,EAAaoB,EAAeF,GAE5BlC,EAAUkC,UAGH,KACP,IAKIS,EALAlX,EAAO4F,EAAK2H,QAChB,QAAalW,IAAT2I,EACD,MAAM,IAAI5C,MAMV8Z,EADe,SAAdlX,EAAK3D,KACO6W,GAAQgB,EAASzB,GAASzS,EAAK0S,YAE/B1S,EAAKuK,YAGrB,IAAI4M,EAAa3C,EAAKN,EAAQve,GAAGue,EAAQxe,GACrC0hB,EAAgB5C,EAAK0C,EAAWvhB,GAAGuhB,EAAWxhB,GAElDyhB,EAAW5J,QAEX,IAAI8J,EAAiBD,EAAc1gB,OAAM,GAAI,QACtBW,IAAnBggB,EACDC,QAAQC,IAAI,gBAAiBH,GACG,SAAxBC,EAAehb,OACvBgb,EAAe7E,KAAO,WAGzB+C,EAAa4B,EAAYjD,GACzBqB,EAAa6B,EAAeF,GAE5BhD,EAAUgD,gBAGG,CAAI9E,EAAY0D,KAlPhB,CAAI0B,IACjB,IAAIC,EAAa,CACd/hB,EAAGoB,KAAKC,IAAIygB,EAAO9hB,EAJD,GAIwB,KAC1CC,EAAGmB,KAAKC,IAAIygB,EAAO7hB,EANH,GAMwB,KAGvC+hB,EACED,EAAW/hB,EAbQ,IAaoB,EADzCgiB,EAEED,EAAW9hB,EAAI,EAMlB0d,EAHCqE,EAAc3D,EAASpe,EAAI+hB,EAAc3D,EAASre,EAGtC,EAAIoB,KAAKK,MAAMugB,GAAe,EAAI3D,EAASpe,IAI3C,EAAImB,KAAKK,MAAMugB,GAAe,EAAI3D,EAASre,IAG3D4d,EAAiB,EAAIxc,KAAK6gB,KAAKtE,EAAa,EAAI,GAChDE,EAAaF,EAAa,EAAIC,EAAiB,EAC/CE,EAAW,EAAI1c,KAAK6gB,KAAKrE,EAAiB,GAC1CG,EAAaJ,EAAa,EAAIG,EAAW,EACzCE,EAAW,EAAI5c,KAAK6gB,KAAMtE,EAAa,EAAK,IAC5CM,EAAaN,EAAa,EAAIK,EAAW,EAEzCE,EAAiBG,EAASre,EAAI2d,EAAa,EAC3CQ,EAAcE,EAASpe,EAAI0d,EAAa,EAExCS,EAAOiB,OAAS0C,EAAW9hB,EAC3Bme,EAAO1S,MAAQqW,EAAW/hB,GAmN1BkiB,CAAaxF,GAhNA,CAAI0D,IACjBlB,IACAM,IACAW,EAAYC,IA8MZ+B,CAAa/B,gBAIGA,IAChBD,EAAYC,eAIGgC,IACf,IAAIC,EAAOpD,EACPqD,EAAaxD,EAAKuD,EAAKpiB,GAAGoiB,EAAKriB,GAC/BuiB,EAAazD,EAAKsD,EAAKniB,GAAGmiB,EAAKpiB,GAEnC,IAAK,IAAII,EAAIkiB,EAAW9jB,OAAS,EAAG4B,GAAK,EAAGA,IACd,SAAvBkiB,EAAWliB,GAAGuG,MACf2b,EAAWnQ,OAAO/R,EAAG,GAI3BmiB,EAAWzhB,KAAK,CAAE6F,KAAM,SAExBkZ,EAAayC,EAAYD,GACzBxC,EAAa0C,EAAYH,GACzBnD,EAAmBmD,KG/TdI,GAAW,KACnB,IAAIC,ECoByB,CAC7BC,IAEA,IAAKC,QAACA,EAAOC,WAAEA,GAAeF,EAG1BG,EAAyB,GACzBC,EAAuB,GAEvBC,EAAY,CAAIC,EAAqBC,IAA0BC,IAChE,IAAIzd,EAAM,GAAKyd,EAAGN,GACd5G,EAAUiH,EAAWxd,QACT9D,IAAZqa,IACDA,IACMkH,EAAGC,QAAUD,EAAGE,SAAWF,EAAGG,UACjCH,EAAGI,mBAKRC,EAAgBR,EAAa,EAAQF,GACrCW,EAAcT,EAAa,EAAMD,GAarC,OAXAH,EAAQ/G,iBAAiB,UAAW2H,GAAe,GACnDZ,EAAQ/G,iBAAiB,QAAS4H,GAAa,GAUxC,CACJC,UAAS,CAAGhe,EAAayG,KACtB,QAA0BvK,IAAtBkhB,EAAapd,GACd,MAAM,IAAIiC,MAAK,kBAAmBjC,0BAIrC,OAFAod,EAAapd,GAAOyG,EAEb,CACJ4G,OAAM,YACI+P,EAAapd,MAK7Bie,QAAO,CAAGje,EAAayG,KACpB,QAAwBvK,IAApBmhB,EAAWrd,GACZ,MAAM,IAAIiC,MAAK,kBAAmBjC,wBAIrC,OAFAqd,EAAWrd,GAAOyG,EAEX,CACJ4G,OAAM,YACIgQ,EAAWrd,MAK3Bke,OAASxV,IACN,IAAK1I,IAACA,EAAGme,QAAEA,EAAOC,MAAEA,GAAU1V,EAC9B,QAA0BxM,IAAtBkhB,EAAapd,GACd,MAAM,IAAIiC,MAAK,kBAAmBjC,0BAErC,QAAwB9D,IAApBmhB,EAAWrd,GACZ,MAAM,IAAIiC,MAAK,kBAAmBjC,wBAMrC,OAHAod,EAAapd,GAAOme,EACpBd,EAAWrd,GAAOoe,EAEX,CACJ/Q,OAAM,YACI+P,EAAapd,UACbqd,EAAWrd,gBAlDjB,KAEVod,EAAe,GACfC,EAAa,GACbH,EAAQ9G,oBAAoB,UAAW0H,GAAe,GACtDZ,EAAQ9G,oBAAoB,QAAS2H,GAAa,MDnDtCM,CAAsB,CAClCnB,QAASoB,SAASC,gBAClBpB,WAAY,QAGXqB,EET2B,GAAKtB,QAACA,MACrC,IAAIuB,EAAcC,GAGZA,EAAMC,UAAU,IAAMD,EAAME,eAAeD,UAAU,IAAMD,EAI7DG,EAAQ,EACRC,EAAQ,EAERC,EAAoBC,IACrB,IAAIL,EAAUF,EAAWO,GAEzBH,EAAQF,EAAQM,QAChBH,EAAQH,EAAQO,SAGfC,EAAmBH,IACpB,IAAKH,IAAUC,EACZ,OAGH,IAAIH,EAAUF,EAAWO,GAErBI,EAAWT,EAAQM,QACnBI,EAAWV,EAAQO,QAEnBI,EAAKT,EAAQO,EACbG,EAAKT,EAAQO,EAENC,GAAM,EAAIC,GAAM,EAEhB,OAIP5jB,KAAK6jB,IAAIF,GAAM3jB,KAAK6jB,IAAID,GAErBD,EAAK,EACNG,EAAUja,KAAKtM,OAEfumB,EAAUna,MAAMpM,OAGfqmB,EAAK,EACNE,EAAU7Z,GAAG1M,OAEbumB,EAAU/Z,KAAKxM,OAIrB2lB,EAAQO,EACRN,EAAQO,IAGPK,GAAc,EACdC,EAAmBlC,IACpBiC,GAAc,EACdX,EAAiBtB,IAGhBmC,EAAmBnC,IAChBiC,GACDP,EAAgB1B,IAIlBoC,EAAa,KACdH,GAAc,GAGjBxC,EAAQ/G,iBAAiB,aAAc4I,GAAkB,GACzD7B,EAAQ/G,iBAAiB,YAAagJ,GAAiB,GACvDjC,EAAQ/G,iBAAiB,YAAawJ,GAAiB,GACvDzC,EAAQ/G,iBAAiB,YAAayJ,GAAiB,GACvD1C,EAAQ/G,iBAAiB,UAAW0J,GAAe,GAEnD,IAQIJ,EAAY,CACbja,KAAM,IAAImM,EACVrM,MAAO,IAAIqM,EACX/L,GAAI,IAAI+L,EACRjM,KAAM,IAAIiM,GAQb,MALS,WACN8N,YAhBU,KACVvC,EAAQ9G,oBAAoB,aAAc2I,GAAkB,GAC5D7B,EAAQ9G,oBAAoB,YAAa+I,GAAiB,GAC1DjC,EAAQ9G,oBAAoB,YAAauJ,GAAiB,GAC1DzC,EAAQ9G,oBAAoB,YAAawJ,GAAiB,GAC1D1C,EAAQ9G,oBAAoB,UAAWyJ,GAAe,MF1EjCC,CAAwB,CAC7C5C,QAASoB,SAASC,kBAGjBwB,EAAc,CAAIC,EAAmBC,IAC/B,IAAItP,GAAkBR,IAC1B,IAAI1J,EAAQ,IAAS0J,EAAWjX,OAC5BgnB,EAAOD,EAAMrP,UAAUnK,GACvB0Z,EAAWH,EAAQhb,KAAKhF,GAClBgd,EAASgB,UAAUhe,EAAKyG,KAElC,MAAM,KACH0Z,EAASxf,SAASyf,IACfA,EAAK/S,YAER6S,EAAK7S,OAAO6S,OAKjBG,EAAe7B,EAAkBiB,UASrC,MAAO,WAPsC,CAC1C7Z,GAAIma,EAAe,CAAC,UAAW,IAAK,KAAMM,EAAaza,IACvDJ,KAAMua,EAAe,CAAC,YAAa,IAAK,KAAMM,EAAa7a,MAC3DE,KAAMqa,EAAe,CAAC,YAAa,IAAK,KAAMM,EAAa3a,MAC3DJ,MAAOya,EAAe,CAAC,aAAc,IAAK,KAAMM,EAAa/a,QAK7Dgb,UAAS,KACNtD,EAASsD,YACT9B,EAAkB8B,sBG5C3BC,GAAiBC,KAAKC,MAAM,8lBCArB,ICoBIC,GAAW,CACnBC,EACAC,KAEA,IAAIC,EAAY,GAEZC,EAAYH,EAASI,OAAOC,MAAM,KAAKzlB,MAAM,GA6CjD,OAxBAulB,EAAUngB,SAASsgB,IAChB,IAAIjhB,EACAkhB,EACAxhB,EACAuhB,EAAMjT,SAAS,OACdhO,KAAQkhB,GAAaD,EAAMD,MAAM,KACnCthB,EAAQwhB,EAAU9U,KAAK,KAClBtL,MAAMpB,KACRA,GAASA,KAGZM,EAAMihB,EACNvhB,GAAQ,GAGXmhB,EAAO7gB,GAAON,KAGjBtD,OAAOwD,KAAKghB,GAAejgB,SAASX,IAC3BA,KAAO6gB,IACVA,EAAO7gB,GAAO4gB,EAAc5gB,GAvCzB,EACN0E,EACAyc,KAEA,IAAIC,EAAgB,GAYpB,OAVAhlB,OAAOwD,KAAKuhB,GAAexgB,SAASX,IAE9BohB,EAAcphB,GADbA,KAAO0E,EACS,IAAUA,EAAO1E,GAEjB,CAAKqhB,EAAOF,IACnBA,EAAcnhB,GAAKqhB,MAK5BD,GAuB6BrV,CAAM8U,EAAQD,QAI9CC,YChDDS,GACNC,EACAC,EAAqE,GACrEC,EAAsB,IAEtB,IAAIC,EAAOpD,SAASqD,cAAiBJ,GAcrC,OAZAnlB,OAAO2I,QAAQyc,GAAW7gB,SAAO,EAAGlC,EAAMiB,WACpBxD,IAAfwlB,EAAKjjB,GACNijB,EAAKjjB,GAAQiB,EAEbgiB,EAAKE,aAAanjB,EAAMiB,MAI9B+hB,EAAS9gB,SAASkhB,IACfH,EAAKI,YAAYD,MAGbH,ECxCH,IA6CIK,GAAoBtjB,IAC5B,IAAIua,EAiBJ,GAdWva,EAAKujB,MAAK,+BAClBhJ,EAAW,CAAEa,UAAW,OAAQC,UAAW,QACnCrb,EAAKujB,MAAK,WAClBhJ,EAAW,CAAEa,UAAW,OAAQC,UAAW,QACnCrb,EAAKujB,MAAK,4BAClBhJ,EAAW,CAAEa,UAAW,UAAWC,UAAW,WACtCrb,EAAKujB,MAAK,oBAClBhJ,EAAW,CAAEa,UAAW,OAAQC,UAAW,WACnCrb,EAAKujB,MAAK,sBAClBhJ,EAAW,CAAEa,UAAW,OAAQC,UAAW,WACnCrb,EAAKujB,MAAK,qBAClBhJ,EAAW,CAAEa,UAAW,OAAQC,UAAW,cAG7B5d,IAAb8c,EAWJ,OAPIva,EAAKujB,MAAK,kBACXhJ,EAAW,CACRa,UAAWb,EAASc,UACpBA,UAAWd,EAASa,YAInBb,GC5DNiJ,GAAavZ,IACd,IAAKiY,SAACA,GAAajY,EAEfhE,EAASgc,GAA6BC,EAAU,CACjDuB,KAAI,IAAQ,EACZjL,KAAI,IAAQ,EACZrS,MAAK,EAAIqS,KAACA,KAAWA,IACrB5R,MAAK,EAAI4R,KAACA,KAAWtb,KAAKK,MAAM,IAAMib,KACtC1e,KAAI,ICvBAoD,KAAKqN,SACRrJ,SAAS,IACTpE,MAAM,GACN4mB,cDqBDtJ,cAAa,KAAQ,EACrBG,SAAQ,IAAQ,YAChBoJ,kBAAiB,EAAIpJ,SAACA,KAAe+I,GAAiB/I,MAAaa,WAAa,OAChFwI,kBAAiB,EAAIrJ,SAACA,KAAe+I,GAAiB/I,MAAac,WAAa,OAChFwI,GAAE,IAAQ,OACVnd,QAAO,IAAQ,KAKlB,OAFAgX,QAAQhY,KAAI,SAAUO,EAAOnM,QAEtBmM,GAGC6d,GAAQ7Z,IAChB,IAAK4V,SAACA,GAAa5V,EACfhE,EAASud,GAAUvZ,GAEnBiQ,EAAS2I,GAAE,UACf3I,EAAO1S,MAAQ,IACf0S,EAAOiB,OAAS,IAEhB,IAAI4I,EAASlB,GAAE,IAAK,CACjBmB,WJ/CyBC,EI+CGnC,GAAAoC,WJ9CzB,YAAaD,+9CADK,IAAIA,EVmGU,IAAIrS,EcnC1C,OAdAiO,EAAS7T,KAAKmY,OACXtB,GAAE,KAAM,CACLuB,YAAavE,EAASwE,MACtBC,UAAW,WAEdzB,GAAE,MAAO,GAAI,CAAC3I,IACd6J,GAQI,QACJ7J,SACAjU,cdiCuC2L,EcxCkB2F,GAAUqG,OAAQ,UdyC9E2G,IAEA,IAAIvqB,EAAK+e,GAAiBwL,KAI1B,OAFA3S,EAAWO,WAAS,IAAOnY,EAAGkf,MAAMqL,OAE7BvqB,Kc/C+E,KAAA,CACnF+B,EAAG6hB,OAAO4G,YACV1oB,EAAG8hB,OAAO6G,iBEpDDhkB,WLDQ,CAAIyhB,IACxB,IAAIwC,EAAexC,EAASyC,KAAKC,QAAO,SAAW,IAEnD,GAAIF,EAAanV,SAAS,KAAM,MAAM,IAAI/L,MAM1C,GAJI0e,EAASyC,OAASD,GACnBxC,EAAS0C,QAAQF,GAGhBxC,EAASyC,KAAKpV,SAAS,KAAM,MAAM,IAAI/L,OKP3CqhB,CAAa3C,UAEb,IAAKhI,OAACA,EAAMjU,OAAEA,EAAM6e,WAAEA,GAAehB,GAAK,UAAEjE,kBAAUqC,WAElD3X,EAASwa,EAAA9Z,EAAA,CAAWhF,EAAOnM,MAE3BkY,EAAQsM,KAERnE,EAAW,CACZre,EAAGmK,EAAOW,MACV7K,EAAGkK,EAAOE,OAGToU,EAAW,CACZa,UAAWnV,EAAO0d,kBAClBtI,UAAWpV,EAAO2d,mBAGjBoB,ECnBgB,CAAI/a,IACxB,IAAMwZ,KAAMwB,EAAU9K,SAAEA,EAAQI,SAAEA,EAAQhQ,OAAEA,GAAWN,EAEnDib,EAAmB/K,EAASre,EAAIqe,EAASpe,EAEzC6e,EAAOrC,GAAc4B,GAAQ,IAAQ,IAErCgL,EAAiB,CAClBnZ,KAAM,CAAC,CAAElQ,EAAG,EAAGC,EAAG,KAGrB6e,EAAKuK,EAAOnZ,KAAK,GAAGjQ,GAAGopB,EAAOnZ,KAAK,GAAGlQ,KAEtC,IAMIoiB,EANAkH,EAAc,IAAIlS,EAClBmS,EAAc,IAAInS,EAClBgJ,EAA2BnD,GAAiB,CAC7CoD,WAAW,EACXI,UAAW,IAGV+I,EAAY,EAQZlf,EAAQ0S,IAET,IAAIyM,EAAQ1M,GAASC,GAEjB0M,EAAUlM,GAAQ6L,EAAOnZ,KAAKlP,OAAM,GAAI,GAAIyoB,IAC3CxpB,EAACA,EAACD,EAAEA,GAAM0pB,EACXC,GAAU,EAKd,IAAKC,EAAS3pB,GAAI,CACf,GAA2B,SAAvBwe,EAASc,UACV,OAEAoK,GAAU,EAEVD,EAAQzpB,EAAIwd,GAAIxd,EAAGoe,EAASpe,GACD,YAAvBwe,EAASc,YACVmK,EAAQ1pB,EAAIqe,EAASre,EAAI,EAAIA,GAItC,IAAK6pB,EAAS7pB,GAAI,CACf,GAA2B,SAAvBye,EAASa,UACV,OAEAqK,GAAU,EAEVD,EAAQ1pB,EAAIyd,GAAIzd,EAAGqe,EAASre,GACD,YAAvBye,EAASa,YACVoK,EAAQzpB,EAAIoe,EAASpe,EAAI,EAAIA,GAKtC,GAAI6e,EAAK4K,EAAQzpB,GAAGypB,EAAQ1pB,GAAK,EAC9B,OAIH,IAAI8pB,EAAUvM,GAAU6E,EAAKjF,OAAQuM,GAsBrC,GAnBA5K,EAAK4K,EAAQzpB,GAAGypB,EAAQ1pB,IAAM,EAC9BqpB,EAAOnZ,KAAKpP,KAAK4oB,GAEbC,GACD/H,QAAQC,IAAI6H,GAEZJ,EAAY3qB,KAAK,CACdgI,KAAM,iBACNqW,EACAnI,YAAa6U,KAGhBJ,EAAY3qB,KAAK,CACdgI,KAAM,iBACNqW,KAKD8M,EAAS,CACX,IAAIC,EAAOV,EAAOnZ,KAAK,GACvB4O,EAAKiL,EAAK9pB,GAAG8pB,EAAK/pB,IAAM,EACxBqpB,EAAOnZ,KAAK2H,QACZ0R,EAAY5qB,OAIf,GAAImrB,EAAS,CACV,IAAI/K,EAAMiL,SACEroB,IAARod,GACDqD,EAAKhF,MAAM2B,GAKjBqB,EAAMhD,MAAM,CACTiD,UAAWD,EAAMjD,OAAOkD,UAAY,EACpCI,UAAWL,EAAMjD,OAAOsD,YAAaqJ,IAGpCA,GAAWT,EAAOnZ,KAAK1R,SAAW4qB,GACnCxH,QAAQhY,KAAK,cAAewW,EAAMjD,OAAOkD,YAI3C2J,EAAgB,IACbR,EAAYL,GACbK,IACOS,KAGHC,IAGND,EAAmB,KACpB,IAAIE,EAAOd,EAAOnZ,KAAKlP,OAAM,GAAI,GAC7BopB,EAA6B,CAAC,QAAS,OAAQ,OAAQ,MAC5C,IAAXD,EAAKnqB,GAAWmqB,EAAKlqB,EAAI,IAC1BmqB,EAAgB,CAAC,KAAM,SAG1B,IAKIC,EALUD,EAAc3f,KAAKuS,GACpBQ,GAAQ2M,EAAMpN,GAASC,MAITsN,OAAOC,GAC9BC,EAAaH,EAAaC,QAAM,EAAGtqB,EAACA,KAAQA,EAAI,IACpD,OAAIwqB,EAAWhsB,OAAS,EACdgsB,EAAW,GACVH,EAAa7rB,OAAS,EACvB6rB,EAAa,GAEhBH,KAGNA,EAAkB,KACnB,IAAIO,EAAcrB,EAAmBC,EAAOnZ,KAAK1R,OACjD,GAAoB,IAAhBisB,EACD,OAGH,IACIC,EADAzY,EAAQ7Q,KAAKK,MAAMgN,IAAWgc,GAAeA,EAG7C1c,EAAQ,EAgBZ,IAfc+Q,EAAK6L,MAAI,CAAElL,EAAMC,IAC5BD,EAAKkL,MAAI,CAAEhL,EAAQC,KACF,GAAVD,GAED5R,IAECA,EAAQkE,IAETyY,EAAe,CAAEzqB,EAAGyf,EAAI1f,EAAG4f,IACpB,cAMiBje,IAAjB+oB,EACb,MAAM,IAAIhjB,MAGb,OAAOgjB,GAGNH,EAASxL,GACH6K,EAAS7K,EAAI9e,IAAM4pB,EAAS9K,EAAI/e,IAA6B,IAAvB8e,EAAKC,EAAI9e,GAAG8e,EAAI/e,GAG5D6pB,EAAY7pB,GACN,GAAKA,GAAKA,EAAIqe,EAASre,EAG7B4pB,EAAY3pB,GACN,GAAKA,GAAKA,EAAIoe,EAASpe,EA4BjC,OAjBAmiB,EAAOnF,GAAiB+M,KAEP,CACd7W,IAAKmW,EACLxW,OAAQyW,QACRnJ,OACAgC,UAdQ,IACDiH,EAAOnZ,KAAK,aAGT,KACV5F,EAAK,UAYLA,KAAM,CACHW,KAAI,IAAQX,EAAK,QACjBS,MAAK,IAAQT,EAAK,SAClBe,GAAE,IAAQf,EAAK,MACfa,KAAI,IAAQb,EAAK,WDlMVsgB,CAAa,CACvBjD,KAAMxd,EAAOwd,cACbtJ,SACA5P,WACAgQ,IE5BY,CAAOvI,GACfrU,OAAO2I,QAAQ0L,GF8BtB2U,CAAQ3U,EAAMgP,WAAW9e,SAAO,EAAGlC,EAAM4R,MACtCA,EAAWO,UAAU6S,EAAO5e,KAAKpG,OAGpC,IAAI4mB,EAAUpN,GAAc,QACzBU,WACAC,EACAC,cAAenU,EAAOmU,cACtBC,aAAc2K,EAAO6B,mBACrBtM,IAIHyK,EAAO/V,IAAIkD,UAAUyU,EAAQ3X,KAC7B+V,EAAOpW,OAAOuD,UAAUyU,EAAQhY,QAChCoW,EAAO9G,KAAK/E,OAAOyN,EAAQE,YAC3B9B,EAAO9I,MAAM/C,OAAOyN,EAAQG,aAE5BjC,EAAW3L,QAAQX,GAASoO,EAAQI,aAAaxO,EAAMwM,EAAO9I,MAAMjD,UAEpE+L,EAAOiC,YAEW,SAAdhhB,EAAO4d,IACR7d,EAAaC,EAAQ+e,EAAO5e,OGtDlC8gB","sources":["node_modules/seedrandom/lib/alea.js","node_modules/seedrandom/lib/xor128.js","node_modules/seedrandom/lib/xorwow.js","node_modules/seedrandom/lib/xorshift7.js","node_modules/seedrandom/lib/xor4096.js","node_modules/seedrandom/lib/tychei.js","node_modules/regenerator-runtime/runtime.js","src/ai/loopAi.ts","node_modules/seedrandom/seedrandom.js","node_modules/seedrandom/index.js","node_modules/tslib/tslib.es6.js","node_modules/rxjs/src/internal/util/isFunction.ts","node_modules/rxjs/src/internal/util/createErrorClass.ts","node_modules/rxjs/src/internal/util/UnsubscriptionError.ts","node_modules/rxjs/src/internal/util/arrRemove.ts","node_modules/rxjs/src/internal/Subscription.ts","node_modules/rxjs/src/internal/config.ts","node_modules/rxjs/src/internal/scheduler/timeoutProvider.ts","node_modules/rxjs/src/internal/util/reportUnhandledError.ts","node_modules/rxjs/src/internal/util/noop.ts","node_modules/rxjs/src/internal/NotificationFactories.ts","node_modules/rxjs/src/internal/Subscriber.ts","node_modules/rxjs/src/internal/symbol/observable.ts","node_modules/rxjs/src/internal/util/identity.ts","node_modules/rxjs/src/internal/util/pipe.ts","node_modules/rxjs/src/internal/Observable.ts","node_modules/rxjs/src/internal/util/ObjectUnsubscribedError.ts","node_modules/rxjs/src/internal/Subject.ts","node_modules/rxjs/src/internal/util/lift.ts","node_modules/rxjs/src/internal/operators/OperatorSubscriber.ts","node_modules/rxjs/src/internal/operators/map.ts","node_modules/rxjs/src/internal/util/isArrayLike.ts","node_modules/rxjs/src/internal/util/isPromise.ts","node_modules/rxjs/src/internal/symbol/iterator.ts","node_modules/rxjs/src/internal/scheduled/scheduleArray.ts","node_modules/rxjs/src/internal/util/isInteropObservable.ts","node_modules/rxjs/src/internal/util/isIterable.ts","node_modules/rxjs/src/internal/util/isAsyncIterable.ts","node_modules/rxjs/src/internal/util/throwUnobservableError.ts","node_modules/rxjs/src/internal/observable/from.ts","node_modules/rxjs/src/internal/operators/mergeMap.ts","node_modules/rxjs/src/internal/operators/mergeInternals.ts","node_modules/rxjs/src/internal/util/mapOneOrManyArgs.ts","node_modules/rxjs/src/internal/observable/fromEvent.ts","node_modules/rxjs/src/internal/observable/fromArray.ts","src/util/array2d.ts","src/util/direction.ts","src/util/noisyState.ts","src/util/pair.ts","src/util/mod.ts","src/display/display.ts","src/util/getContext2d.ts","src/display/color.ts","src/input/input.ts","src/input/keyboardManager.ts","src/input/fingerMoveManager.ts","package.json","src/lib/githubCorner.ts","src/util/urlParam.ts","src/page/lib/hyper.ts","src/util/topology.ts","src/page/init.ts","src/util/randomSeed.ts","src/main.ts","src/core/engine.ts","src/util/entries.ts","src/start.ts"],"sourcesContent":["// A port of an algorithm by Johannes Baagøe <baagoe@baagoe.com>, 2010\n// http://baagoe.com/en/RandomMusings/javascript/\n// https://github.com/nquinlan/better-random-numbers-for-javascript-mirror\n// Original work is under MIT license -\n\n// Copyright (C) 2010 by Johannes Baagøe <baagoe@baagoe.org>\n//\n// Permission is hereby granted, free of charge, to any person obtaining a copy\n// of this software and associated documentation files (the \"Software\"), to deal\n// in the Software without restriction, including without limitation the rights\n// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n// copies of the Software, and to permit persons to whom the Software is\n// furnished to do so, subject to the following conditions:\n//\n// The above copyright notice and this permission notice shall be included in\n// all copies or substantial portions of the Software.\n//\n// THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\n// THE SOFTWARE.\n\n\n\n(function(global, module, define) {\n\nfunction Alea(seed) {\n  var me = this, mash = Mash();\n\n  me.next = function() {\n    var t = 2091639 * me.s0 + me.c * 2.3283064365386963e-10; // 2^-32\n    me.s0 = me.s1;\n    me.s1 = me.s2;\n    return me.s2 = t - (me.c = t | 0);\n  };\n\n  // Apply the seeding algorithm from Baagoe.\n  me.c = 1;\n  me.s0 = mash(' ');\n  me.s1 = mash(' ');\n  me.s2 = mash(' ');\n  me.s0 -= mash(seed);\n  if (me.s0 < 0) { me.s0 += 1; }\n  me.s1 -= mash(seed);\n  if (me.s1 < 0) { me.s1 += 1; }\n  me.s2 -= mash(seed);\n  if (me.s2 < 0) { me.s2 += 1; }\n  mash = null;\n}\n\nfunction copy(f, t) {\n  t.c = f.c;\n  t.s0 = f.s0;\n  t.s1 = f.s1;\n  t.s2 = f.s2;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new Alea(seed),\n      state = opts && opts.state,\n      prng = xg.next;\n  prng.int32 = function() { return (xg.next() * 0x100000000) | 0; }\n  prng.double = function() {\n    return prng() + (prng() * 0x200000 | 0) * 1.1102230246251565e-16; // 2^-53\n  };\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nfunction Mash() {\n  var n = 0xefc8249d;\n\n  var mash = function(data) {\n    data = String(data);\n    for (var i = 0; i < data.length; i++) {\n      n += data.charCodeAt(i);\n      var h = 0.02519603282416938 * n;\n      n = h >>> 0;\n      h -= n;\n      h *= n;\n      n = h >>> 0;\n      h -= n;\n      n += h * 0x100000000; // 2^32\n    }\n    return (n >>> 0) * 2.3283064365386963e-10; // 2^-32\n  };\n\n  return mash;\n}\n\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.alea = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","// A Javascript implementaion of the \"xor128\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n\n  // Set up generator function.\n  me.next = function() {\n    var t = me.x ^ (me.x << 11);\n    me.x = me.y;\n    me.y = me.z;\n    me.z = me.w;\n    return me.w ^= (me.w >>> 19) ^ t ^ (t >>> 8);\n  };\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor128 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","// A Javascript implementaion of the \"xorwow\" prng algorithm by\n// George Marsaglia.  See http://www.jstatsoft.org/v08/i14/paper\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var t = (me.x ^ (me.x >>> 2));\n    me.x = me.y; me.y = me.z; me.z = me.w; me.w = me.v;\n    return (me.d = (me.d + 362437 | 0)) +\n       (me.v = (me.v ^ (me.v << 4)) ^ (t ^ (t << 1))) | 0;\n  };\n\n  me.x = 0;\n  me.y = 0;\n  me.z = 0;\n  me.w = 0;\n  me.v = 0;\n\n  if (seed === (seed | 0)) {\n    // Integer seed.\n    me.x = seed;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 64; k++) {\n    me.x ^= strseed.charCodeAt(k) | 0;\n    if (k == strseed.length) {\n      me.d = me.x << 10 ^ me.x >>> 4;\n    }\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.x = f.x;\n  t.y = f.y;\n  t.z = f.z;\n  t.w = f.w;\n  t.v = f.v;\n  t.d = f.d;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorwow = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","// A Javascript implementaion of the \"xorshift7\" algorithm by\n// François Panneton and Pierre L'ecuyer:\n// \"On the Xorgshift Random Number Generators\"\n// http://saluc.engr.uconn.edu/refs/crypto/rng/panneton05onthexorshift.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    // Update xor generator.\n    var X = me.x, i = me.i, t, v, w;\n    t = X[i]; t ^= (t >>> 7); v = t ^ (t << 24);\n    t = X[(i + 1) & 7]; v ^= t ^ (t >>> 10);\n    t = X[(i + 3) & 7]; v ^= t ^ (t >>> 3);\n    t = X[(i + 4) & 7]; v ^= t ^ (t << 7);\n    t = X[(i + 7) & 7]; t = t ^ (t << 13); v ^= t ^ (t << 9);\n    X[i] = v;\n    me.i = (i + 1) & 7;\n    return v;\n  };\n\n  function init(me, seed) {\n    var j, w, X = [];\n\n    if (seed === (seed | 0)) {\n      // Seed state array using a 32-bit integer.\n      w = X[0] = seed;\n    } else {\n      // Seed state using a string.\n      seed = '' + seed;\n      for (j = 0; j < seed.length; ++j) {\n        X[j & 7] = (X[j & 7] << 15) ^\n            (seed.charCodeAt(j) + X[(j + 1) & 7] << 13);\n      }\n    }\n    // Enforce an array length of 8, not all zeroes.\n    while (X.length < 8) X.push(0);\n    for (j = 0; j < 8 && X[j] === 0; ++j);\n    if (j == 8) w = X[7] = -1; else w = X[j];\n\n    me.x = X;\n    me.i = 0;\n\n    // Discard an initial 256 values.\n    for (j = 256; j > 0; --j) {\n      me.next();\n    }\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.x = f.x.slice();\n  t.i = f.i;\n  return t;\n}\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.x) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xorshift7 = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n","// A Javascript implementaion of Richard Brent's Xorgens xor4096 algorithm.\n//\n// This fast non-cryptographic random number generator is designed for\n// use in Monte-Carlo algorithms. It combines a long-period xorshift\n// generator with a Weyl generator, and it passes all common batteries\n// of stasticial tests for randomness while consuming only a few nanoseconds\n// for each prng generated.  For background on the generator, see Brent's\n// paper: \"Some long-period random number generators using shifts and xors.\"\n// http://arxiv.org/pdf/1004.3115v1.pdf\n//\n// Usage:\n//\n// var xor4096 = require('xor4096');\n// random = xor4096(1);                        // Seed with int32 or string.\n// assert.equal(random(), 0.1520436450538547); // (0, 1) range, 53 bits.\n// assert.equal(random.int32(), 1806534897);   // signed int32, 32 bits.\n//\n// For nonzero numeric keys, this impelementation provides a sequence\n// identical to that by Brent's xorgens 3 implementaion in C.  This\n// implementation also provides for initalizing the generator with\n// string seeds, or for saving and restoring the state of the generator.\n//\n// On Chrome, this prng benchmarks about 2.1 times slower than\n// Javascript's built-in Math.random().\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this;\n\n  // Set up generator function.\n  me.next = function() {\n    var w = me.w,\n        X = me.X, i = me.i, t, v;\n    // Update Weyl generator.\n    me.w = w = (w + 0x61c88647) | 0;\n    // Update xor generator.\n    v = X[(i + 34) & 127];\n    t = X[i = ((i + 1) & 127)];\n    v ^= v << 13;\n    t ^= t << 17;\n    v ^= v >>> 15;\n    t ^= t >>> 12;\n    // Update Xor generator array state.\n    v = X[i] = v ^ t;\n    me.i = i;\n    // Result is the combination.\n    return (v + (w ^ (w >>> 16))) | 0;\n  };\n\n  function init(me, seed) {\n    var t, v, i, j, w, X = [], limit = 128;\n    if (seed === (seed | 0)) {\n      // Numeric seeds initialize v, which is used to generates X.\n      v = seed;\n      seed = null;\n    } else {\n      // String seeds are mixed into v and X one character at a time.\n      seed = seed + '\\0';\n      v = 0;\n      limit = Math.max(limit, seed.length);\n    }\n    // Initialize circular array and weyl value.\n    for (i = 0, j = -32; j < limit; ++j) {\n      // Put the unicode characters into the array, and shuffle them.\n      if (seed) v ^= seed.charCodeAt((j + 32) % seed.length);\n      // After 32 shuffles, take v as the starting w value.\n      if (j === 0) w = v;\n      v ^= v << 10;\n      v ^= v >>> 15;\n      v ^= v << 4;\n      v ^= v >>> 13;\n      if (j >= 0) {\n        w = (w + 0x61c88647) | 0;     // Weyl.\n        t = (X[j & 127] ^= (v + w));  // Combine xor and weyl to init array.\n        i = (0 == t) ? i + 1 : 0;     // Count zeroes.\n      }\n    }\n    // We have detected all zeroes; make the key nonzero.\n    if (i >= 128) {\n      X[(seed && seed.length || 0) & 127] = -1;\n    }\n    // Run the generator 512 times to further mix the state before using it.\n    // Factoring this as a function slows the main generator, so it is just\n    // unrolled here.  The weyl generator is not advanced while warming up.\n    i = 127;\n    for (j = 4 * 128; j > 0; --j) {\n      v = X[(i + 34) & 127];\n      t = X[i = ((i + 1) & 127)];\n      v ^= v << 13;\n      t ^= t << 17;\n      v ^= v >>> 15;\n      t ^= t >>> 12;\n      X[i] = v ^ t;\n    }\n    // Storing state as object members is faster than using closure variables.\n    me.w = w;\n    me.X = X;\n    me.i = i;\n  }\n\n  init(me, seed);\n}\n\nfunction copy(f, t) {\n  t.i = f.i;\n  t.w = f.w;\n  t.X = f.X.slice();\n  return t;\n};\n\nfunction impl(seed, opts) {\n  if (seed == null) seed = +(new Date);\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (state.X) copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.xor4096 = impl;\n}\n\n})(\n  this,                                     // window object or global\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n","// A Javascript implementaion of the \"Tyche-i\" prng algorithm by\n// Samuel Neves and Filipe Araujo.\n// See https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n\n(function(global, module, define) {\n\nfunction XorGen(seed) {\n  var me = this, strseed = '';\n\n  // Set up generator function.\n  me.next = function() {\n    var b = me.b, c = me.c, d = me.d, a = me.a;\n    b = (b << 25) ^ (b >>> 7) ^ c;\n    c = (c - d) | 0;\n    d = (d << 24) ^ (d >>> 8) ^ a;\n    a = (a - b) | 0;\n    me.b = b = (b << 20) ^ (b >>> 12) ^ c;\n    me.c = c = (c - d) | 0;\n    me.d = (d << 16) ^ (c >>> 16) ^ a;\n    return me.a = (a - b) | 0;\n  };\n\n  /* The following is non-inverted tyche, which has better internal\n   * bit diffusion, but which is about 25% slower than tyche-i in JS.\n  me.next = function() {\n    var a = me.a, b = me.b, c = me.c, d = me.d;\n    a = (me.a + me.b | 0) >>> 0;\n    d = me.d ^ a; d = d << 16 ^ d >>> 16;\n    c = me.c + d | 0;\n    b = me.b ^ c; b = b << 12 ^ d >>> 20;\n    me.a = a = a + b | 0;\n    d = d ^ a; me.d = d = d << 8 ^ d >>> 24;\n    me.c = c = c + d | 0;\n    b = b ^ c;\n    return me.b = (b << 7 ^ b >>> 25);\n  }\n  */\n\n  me.a = 0;\n  me.b = 0;\n  me.c = 2654435769 | 0;\n  me.d = 1367130551;\n\n  if (seed === Math.floor(seed)) {\n    // Integer seed.\n    me.a = (seed / 0x100000000) | 0;\n    me.b = seed | 0;\n  } else {\n    // String seed.\n    strseed += seed;\n  }\n\n  // Mix in string seed, then discard an initial batch of 64 values.\n  for (var k = 0; k < strseed.length + 20; k++) {\n    me.b ^= strseed.charCodeAt(k) | 0;\n    me.next();\n  }\n}\n\nfunction copy(f, t) {\n  t.a = f.a;\n  t.b = f.b;\n  t.c = f.c;\n  t.d = f.d;\n  return t;\n};\n\nfunction impl(seed, opts) {\n  var xg = new XorGen(seed),\n      state = opts && opts.state,\n      prng = function() { return (xg.next() >>> 0) / 0x100000000; };\n  prng.double = function() {\n    do {\n      var top = xg.next() >>> 11,\n          bot = (xg.next() >>> 0) / 0x100000000,\n          result = (top + bot) / (1 << 21);\n    } while (result === 0);\n    return result;\n  };\n  prng.int32 = xg.next;\n  prng.quick = prng;\n  if (state) {\n    if (typeof(state) == 'object') copy(state, xg);\n    prng.state = function() { return copy(xg, {}); }\n  }\n  return prng;\n}\n\nif (module && module.exports) {\n  module.exports = impl;\n} else if (define && define.amd) {\n  define(function() { return impl; });\n} else {\n  this.tychei = impl;\n}\n\n})(\n  this,\n  (typeof module) == 'object' && module,    // present in node.js\n  (typeof define) == 'function' && define   // present with an AMD loader\n);\n\n\n","/**\n * Copyright (c) 2014-present, Facebook, Inc.\n *\n * This source code is licensed under the MIT license found in the\n * LICENSE file in the root directory of this source tree.\n */\n\n!(function(global) {\n  \"use strict\";\n\n  var Op = Object.prototype;\n  var hasOwn = Op.hasOwnProperty;\n  var undefined; // More compressible than void 0.\n  var $Symbol = typeof Symbol === \"function\" ? Symbol : {};\n  var iteratorSymbol = $Symbol.iterator || \"@@iterator\";\n  var asyncIteratorSymbol = $Symbol.asyncIterator || \"@@asyncIterator\";\n  var toStringTagSymbol = $Symbol.toStringTag || \"@@toStringTag\";\n\n  var inModule = typeof module === \"object\";\n  var runtime = global.regeneratorRuntime;\n  if (runtime) {\n    if (inModule) {\n      // If regeneratorRuntime is defined globally and we're in a module,\n      // make the exports object identical to regeneratorRuntime.\n      module.exports = runtime;\n    }\n    // Don't bother evaluating the rest of this file if the runtime was\n    // already defined globally.\n    return;\n  }\n\n  // Define the runtime globally (as expected by generated code) as either\n  // module.exports (if we're in a module) or a new, empty object.\n  runtime = global.regeneratorRuntime = inModule ? module.exports : {};\n\n  function wrap(innerFn, outerFn, self, tryLocsList) {\n    // If outerFn provided and outerFn.prototype is a Generator, then outerFn.prototype instanceof Generator.\n    var protoGenerator = outerFn && outerFn.prototype instanceof Generator ? outerFn : Generator;\n    var generator = Object.create(protoGenerator.prototype);\n    var context = new Context(tryLocsList || []);\n\n    // The ._invoke method unifies the implementations of the .next,\n    // .throw, and .return methods.\n    generator._invoke = makeInvokeMethod(innerFn, self, context);\n\n    return generator;\n  }\n  runtime.wrap = wrap;\n\n  // Try/catch helper to minimize deoptimizations. Returns a completion\n  // record like context.tryEntries[i].completion. This interface could\n  // have been (and was previously) designed to take a closure to be\n  // invoked without arguments, but in all the cases we care about we\n  // already have an existing method we want to call, so there's no need\n  // to create a new function object. We can even get away with assuming\n  // the method takes exactly one argument, since that happens to be true\n  // in every case, so we don't have to touch the arguments object. The\n  // only additional allocation required is the completion record, which\n  // has a stable shape and so hopefully should be cheap to allocate.\n  function tryCatch(fn, obj, arg) {\n    try {\n      return { type: \"normal\", arg: fn.call(obj, arg) };\n    } catch (err) {\n      return { type: \"throw\", arg: err };\n    }\n  }\n\n  var GenStateSuspendedStart = \"suspendedStart\";\n  var GenStateSuspendedYield = \"suspendedYield\";\n  var GenStateExecuting = \"executing\";\n  var GenStateCompleted = \"completed\";\n\n  // Returning this object from the innerFn has the same effect as\n  // breaking out of the dispatch switch statement.\n  var ContinueSentinel = {};\n\n  // Dummy constructor functions that we use as the .constructor and\n  // .constructor.prototype properties for functions that return Generator\n  // objects. For full spec compliance, you may wish to configure your\n  // minifier not to mangle the names of these two functions.\n  function Generator() {}\n  function GeneratorFunction() {}\n  function GeneratorFunctionPrototype() {}\n\n  // This is a polyfill for %IteratorPrototype% for environments that\n  // don't natively support it.\n  var IteratorPrototype = {};\n  IteratorPrototype[iteratorSymbol] = function () {\n    return this;\n  };\n\n  var getProto = Object.getPrototypeOf;\n  var NativeIteratorPrototype = getProto && getProto(getProto(values([])));\n  if (NativeIteratorPrototype &&\n      NativeIteratorPrototype !== Op &&\n      hasOwn.call(NativeIteratorPrototype, iteratorSymbol)) {\n    // This environment has a native %IteratorPrototype%; use it instead\n    // of the polyfill.\n    IteratorPrototype = NativeIteratorPrototype;\n  }\n\n  var Gp = GeneratorFunctionPrototype.prototype =\n    Generator.prototype = Object.create(IteratorPrototype);\n  GeneratorFunction.prototype = Gp.constructor = GeneratorFunctionPrototype;\n  GeneratorFunctionPrototype.constructor = GeneratorFunction;\n  GeneratorFunctionPrototype[toStringTagSymbol] =\n    GeneratorFunction.displayName = \"GeneratorFunction\";\n\n  // Helper for defining the .next, .throw, and .return methods of the\n  // Iterator interface in terms of a single ._invoke method.\n  function defineIteratorMethods(prototype) {\n    [\"next\", \"throw\", \"return\"].forEach(function(method) {\n      prototype[method] = function(arg) {\n        return this._invoke(method, arg);\n      };\n    });\n  }\n\n  runtime.isGeneratorFunction = function(genFun) {\n    var ctor = typeof genFun === \"function\" && genFun.constructor;\n    return ctor\n      ? ctor === GeneratorFunction ||\n        // For the native GeneratorFunction constructor, the best we can\n        // do is to check its .name property.\n        (ctor.displayName || ctor.name) === \"GeneratorFunction\"\n      : false;\n  };\n\n  runtime.mark = function(genFun) {\n    if (Object.setPrototypeOf) {\n      Object.setPrototypeOf(genFun, GeneratorFunctionPrototype);\n    } else {\n      genFun.__proto__ = GeneratorFunctionPrototype;\n      if (!(toStringTagSymbol in genFun)) {\n        genFun[toStringTagSymbol] = \"GeneratorFunction\";\n      }\n    }\n    genFun.prototype = Object.create(Gp);\n    return genFun;\n  };\n\n  // Within the body of any async function, `await x` is transformed to\n  // `yield regeneratorRuntime.awrap(x)`, so that the runtime can test\n  // `hasOwn.call(value, \"__await\")` to determine if the yielded value is\n  // meant to be awaited.\n  runtime.awrap = function(arg) {\n    return { __await: arg };\n  };\n\n  function AsyncIterator(generator) {\n    function invoke(method, arg, resolve, reject) {\n      var record = tryCatch(generator[method], generator, arg);\n      if (record.type === \"throw\") {\n        reject(record.arg);\n      } else {\n        var result = record.arg;\n        var value = result.value;\n        if (value &&\n            typeof value === \"object\" &&\n            hasOwn.call(value, \"__await\")) {\n          return Promise.resolve(value.__await).then(function(value) {\n            invoke(\"next\", value, resolve, reject);\n          }, function(err) {\n            invoke(\"throw\", err, resolve, reject);\n          });\n        }\n\n        return Promise.resolve(value).then(function(unwrapped) {\n          // When a yielded Promise is resolved, its final value becomes\n          // the .value of the Promise<{value,done}> result for the\n          // current iteration.\n          result.value = unwrapped;\n          resolve(result);\n        }, function(error) {\n          // If a rejected Promise was yielded, throw the rejection back\n          // into the async generator function so it can be handled there.\n          return invoke(\"throw\", error, resolve, reject);\n        });\n      }\n    }\n\n    var previousPromise;\n\n    function enqueue(method, arg) {\n      function callInvokeWithMethodAndArg() {\n        return new Promise(function(resolve, reject) {\n          invoke(method, arg, resolve, reject);\n        });\n      }\n\n      return previousPromise =\n        // If enqueue has been called before, then we want to wait until\n        // all previous Promises have been resolved before calling invoke,\n        // so that results are always delivered in the correct order. If\n        // enqueue has not been called before, then it is important to\n        // call invoke immediately, without waiting on a callback to fire,\n        // so that the async generator function has the opportunity to do\n        // any necessary setup in a predictable way. This predictability\n        // is why the Promise constructor synchronously invokes its\n        // executor callback, and why async functions synchronously\n        // execute code before the first await. Since we implement simple\n        // async functions in terms of async generators, it is especially\n        // important to get this right, even though it requires care.\n        previousPromise ? previousPromise.then(\n          callInvokeWithMethodAndArg,\n          // Avoid propagating failures to Promises returned by later\n          // invocations of the iterator.\n          callInvokeWithMethodAndArg\n        ) : callInvokeWithMethodAndArg();\n    }\n\n    // Define the unified helper method that is used to implement .next,\n    // .throw, and .return (see defineIteratorMethods).\n    this._invoke = enqueue;\n  }\n\n  defineIteratorMethods(AsyncIterator.prototype);\n  AsyncIterator.prototype[asyncIteratorSymbol] = function () {\n    return this;\n  };\n  runtime.AsyncIterator = AsyncIterator;\n\n  // Note that simple async functions are implemented on top of\n  // AsyncIterator objects; they just return a Promise for the value of\n  // the final result produced by the iterator.\n  runtime.async = function(innerFn, outerFn, self, tryLocsList) {\n    var iter = new AsyncIterator(\n      wrap(innerFn, outerFn, self, tryLocsList)\n    );\n\n    return runtime.isGeneratorFunction(outerFn)\n      ? iter // If outerFn is a generator, return the full iterator.\n      : iter.next().then(function(result) {\n          return result.done ? result.value : iter.next();\n        });\n  };\n\n  function makeInvokeMethod(innerFn, self, context) {\n    var state = GenStateSuspendedStart;\n\n    return function invoke(method, arg) {\n      if (state === GenStateExecuting) {\n        throw new Error(\"Generator is already running\");\n      }\n\n      if (state === GenStateCompleted) {\n        if (method === \"throw\") {\n          throw arg;\n        }\n\n        // Be forgiving, per 25.3.3.3.3 of the spec:\n        // https://people.mozilla.org/~jorendorff/es6-draft.html#sec-generatorresume\n        return doneResult();\n      }\n\n      context.method = method;\n      context.arg = arg;\n\n      while (true) {\n        var delegate = context.delegate;\n        if (delegate) {\n          var delegateResult = maybeInvokeDelegate(delegate, context);\n          if (delegateResult) {\n            if (delegateResult === ContinueSentinel) continue;\n            return delegateResult;\n          }\n        }\n\n        if (context.method === \"next\") {\n          // Setting context._sent for legacy support of Babel's\n          // function.sent implementation.\n          context.sent = context._sent = context.arg;\n\n        } else if (context.method === \"throw\") {\n          if (state === GenStateSuspendedStart) {\n            state = GenStateCompleted;\n            throw context.arg;\n          }\n\n          context.dispatchException(context.arg);\n\n        } else if (context.method === \"return\") {\n          context.abrupt(\"return\", context.arg);\n        }\n\n        state = GenStateExecuting;\n\n        var record = tryCatch(innerFn, self, context);\n        if (record.type === \"normal\") {\n          // If an exception is thrown from innerFn, we leave state ===\n          // GenStateExecuting and loop back for another invocation.\n          state = context.done\n            ? GenStateCompleted\n            : GenStateSuspendedYield;\n\n          if (record.arg === ContinueSentinel) {\n            continue;\n          }\n\n          return {\n            value: record.arg,\n            done: context.done\n          };\n\n        } else if (record.type === \"throw\") {\n          state = GenStateCompleted;\n          // Dispatch the exception by looping back around to the\n          // context.dispatchException(context.arg) call above.\n          context.method = \"throw\";\n          context.arg = record.arg;\n        }\n      }\n    };\n  }\n\n  // Call delegate.iterator[context.method](context.arg) and handle the\n  // result, either by returning a { value, done } result from the\n  // delegate iterator, or by modifying context.method and context.arg,\n  // setting context.delegate to null, and returning the ContinueSentinel.\n  function maybeInvokeDelegate(delegate, context) {\n    var method = delegate.iterator[context.method];\n    if (method === undefined) {\n      // A .throw or .return when the delegate iterator has no .throw\n      // method always terminates the yield* loop.\n      context.delegate = null;\n\n      if (context.method === \"throw\") {\n        if (delegate.iterator.return) {\n          // If the delegate iterator has a return method, give it a\n          // chance to clean up.\n          context.method = \"return\";\n          context.arg = undefined;\n          maybeInvokeDelegate(delegate, context);\n\n          if (context.method === \"throw\") {\n            // If maybeInvokeDelegate(context) changed context.method from\n            // \"return\" to \"throw\", let that override the TypeError below.\n            return ContinueSentinel;\n          }\n        }\n\n        context.method = \"throw\";\n        context.arg = new TypeError(\n          \"The iterator does not provide a 'throw' method\");\n      }\n\n      return ContinueSentinel;\n    }\n\n    var record = tryCatch(method, delegate.iterator, context.arg);\n\n    if (record.type === \"throw\") {\n      context.method = \"throw\";\n      context.arg = record.arg;\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    var info = record.arg;\n\n    if (! info) {\n      context.method = \"throw\";\n      context.arg = new TypeError(\"iterator result is not an object\");\n      context.delegate = null;\n      return ContinueSentinel;\n    }\n\n    if (info.done) {\n      // Assign the result of the finished delegate to the temporary\n      // variable specified by delegate.resultName (see delegateYield).\n      context[delegate.resultName] = info.value;\n\n      // Resume execution at the desired location (see delegateYield).\n      context.next = delegate.nextLoc;\n\n      // If context.method was \"throw\" but the delegate handled the\n      // exception, let the outer generator proceed normally. If\n      // context.method was \"next\", forget context.arg since it has been\n      // \"consumed\" by the delegate iterator. If context.method was\n      // \"return\", allow the original .return call to continue in the\n      // outer generator.\n      if (context.method !== \"return\") {\n        context.method = \"next\";\n        context.arg = undefined;\n      }\n\n    } else {\n      // Re-yield the result returned by the delegate method.\n      return info;\n    }\n\n    // The delegate iterator is finished, so forget it and continue with\n    // the outer generator.\n    context.delegate = null;\n    return ContinueSentinel;\n  }\n\n  // Define Generator.prototype.{next,throw,return} in terms of the\n  // unified ._invoke helper method.\n  defineIteratorMethods(Gp);\n\n  Gp[toStringTagSymbol] = \"Generator\";\n\n  // A Generator should always return itself as the iterator object when the\n  // @@iterator function is called on it. Some browsers' implementations of the\n  // iterator prototype chain incorrectly implement this, causing the Generator\n  // object to not be returned from this call. This ensures that doesn't happen.\n  // See https://github.com/facebook/regenerator/issues/274 for more details.\n  Gp[iteratorSymbol] = function() {\n    return this;\n  };\n\n  Gp.toString = function() {\n    return \"[object Generator]\";\n  };\n\n  function pushTryEntry(locs) {\n    var entry = { tryLoc: locs[0] };\n\n    if (1 in locs) {\n      entry.catchLoc = locs[1];\n    }\n\n    if (2 in locs) {\n      entry.finallyLoc = locs[2];\n      entry.afterLoc = locs[3];\n    }\n\n    this.tryEntries.push(entry);\n  }\n\n  function resetTryEntry(entry) {\n    var record = entry.completion || {};\n    record.type = \"normal\";\n    delete record.arg;\n    entry.completion = record;\n  }\n\n  function Context(tryLocsList) {\n    // The root entry object (effectively a try statement without a catch\n    // or a finally block) gives us a place to store values thrown from\n    // locations where there is no enclosing try statement.\n    this.tryEntries = [{ tryLoc: \"root\" }];\n    tryLocsList.forEach(pushTryEntry, this);\n    this.reset(true);\n  }\n\n  runtime.keys = function(object) {\n    var keys = [];\n    for (var key in object) {\n      keys.push(key);\n    }\n    keys.reverse();\n\n    // Rather than returning an object with a next method, we keep\n    // things simple and return the next function itself.\n    return function next() {\n      while (keys.length) {\n        var key = keys.pop();\n        if (key in object) {\n          next.value = key;\n          next.done = false;\n          return next;\n        }\n      }\n\n      // To avoid creating an additional object, we just hang the .value\n      // and .done properties off the next function object itself. This\n      // also ensures that the minifier will not anonymize the function.\n      next.done = true;\n      return next;\n    };\n  };\n\n  function values(iterable) {\n    if (iterable) {\n      var iteratorMethod = iterable[iteratorSymbol];\n      if (iteratorMethod) {\n        return iteratorMethod.call(iterable);\n      }\n\n      if (typeof iterable.next === \"function\") {\n        return iterable;\n      }\n\n      if (!isNaN(iterable.length)) {\n        var i = -1, next = function next() {\n          while (++i < iterable.length) {\n            if (hasOwn.call(iterable, i)) {\n              next.value = iterable[i];\n              next.done = false;\n              return next;\n            }\n          }\n\n          next.value = undefined;\n          next.done = true;\n\n          return next;\n        };\n\n        return next.next = next;\n      }\n    }\n\n    // Return an iterator with no values.\n    return { next: doneResult };\n  }\n  runtime.values = values;\n\n  function doneResult() {\n    return { value: undefined, done: true };\n  }\n\n  Context.prototype = {\n    constructor: Context,\n\n    reset: function(skipTempReset) {\n      this.prev = 0;\n      this.next = 0;\n      // Resetting context._sent for legacy support of Babel's\n      // function.sent implementation.\n      this.sent = this._sent = undefined;\n      this.done = false;\n      this.delegate = null;\n\n      this.method = \"next\";\n      this.arg = undefined;\n\n      this.tryEntries.forEach(resetTryEntry);\n\n      if (!skipTempReset) {\n        for (var name in this) {\n          // Not sure about the optimal order of these conditions:\n          if (name.charAt(0) === \"t\" &&\n              hasOwn.call(this, name) &&\n              !isNaN(+name.slice(1))) {\n            this[name] = undefined;\n          }\n        }\n      }\n    },\n\n    stop: function() {\n      this.done = true;\n\n      var rootEntry = this.tryEntries[0];\n      var rootRecord = rootEntry.completion;\n      if (rootRecord.type === \"throw\") {\n        throw rootRecord.arg;\n      }\n\n      return this.rval;\n    },\n\n    dispatchException: function(exception) {\n      if (this.done) {\n        throw exception;\n      }\n\n      var context = this;\n      function handle(loc, caught) {\n        record.type = \"throw\";\n        record.arg = exception;\n        context.next = loc;\n\n        if (caught) {\n          // If the dispatched exception was caught by a catch block,\n          // then let that catch block handle the exception normally.\n          context.method = \"next\";\n          context.arg = undefined;\n        }\n\n        return !! caught;\n      }\n\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        var record = entry.completion;\n\n        if (entry.tryLoc === \"root\") {\n          // Exception thrown outside of any try block that could handle\n          // it, so set the completion value of the entire function to\n          // throw the exception.\n          return handle(\"end\");\n        }\n\n        if (entry.tryLoc <= this.prev) {\n          var hasCatch = hasOwn.call(entry, \"catchLoc\");\n          var hasFinally = hasOwn.call(entry, \"finallyLoc\");\n\n          if (hasCatch && hasFinally) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            } else if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else if (hasCatch) {\n            if (this.prev < entry.catchLoc) {\n              return handle(entry.catchLoc, true);\n            }\n\n          } else if (hasFinally) {\n            if (this.prev < entry.finallyLoc) {\n              return handle(entry.finallyLoc);\n            }\n\n          } else {\n            throw new Error(\"try statement without catch or finally\");\n          }\n        }\n      }\n    },\n\n    abrupt: function(type, arg) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc <= this.prev &&\n            hasOwn.call(entry, \"finallyLoc\") &&\n            this.prev < entry.finallyLoc) {\n          var finallyEntry = entry;\n          break;\n        }\n      }\n\n      if (finallyEntry &&\n          (type === \"break\" ||\n           type === \"continue\") &&\n          finallyEntry.tryLoc <= arg &&\n          arg <= finallyEntry.finallyLoc) {\n        // Ignore the finally entry if control is not jumping to a\n        // location outside the try/catch block.\n        finallyEntry = null;\n      }\n\n      var record = finallyEntry ? finallyEntry.completion : {};\n      record.type = type;\n      record.arg = arg;\n\n      if (finallyEntry) {\n        this.method = \"next\";\n        this.next = finallyEntry.finallyLoc;\n        return ContinueSentinel;\n      }\n\n      return this.complete(record);\n    },\n\n    complete: function(record, afterLoc) {\n      if (record.type === \"throw\") {\n        throw record.arg;\n      }\n\n      if (record.type === \"break\" ||\n          record.type === \"continue\") {\n        this.next = record.arg;\n      } else if (record.type === \"return\") {\n        this.rval = this.arg = record.arg;\n        this.method = \"return\";\n        this.next = \"end\";\n      } else if (record.type === \"normal\" && afterLoc) {\n        this.next = afterLoc;\n      }\n\n      return ContinueSentinel;\n    },\n\n    finish: function(finallyLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.finallyLoc === finallyLoc) {\n          this.complete(entry.completion, entry.afterLoc);\n          resetTryEntry(entry);\n          return ContinueSentinel;\n        }\n      }\n    },\n\n    \"catch\": function(tryLoc) {\n      for (var i = this.tryEntries.length - 1; i >= 0; --i) {\n        var entry = this.tryEntries[i];\n        if (entry.tryLoc === tryLoc) {\n          var record = entry.completion;\n          if (record.type === \"throw\") {\n            var thrown = record.arg;\n            resetTryEntry(entry);\n          }\n          return thrown;\n        }\n      }\n\n      // The context.catch method must only be called with a location\n      // argument that corresponds to a known catch block.\n      throw new Error(\"illegal catch attempt\");\n    },\n\n    delegateYield: function(iterable, resultName, nextLoc) {\n      this.delegate = {\n        iterator: values(iterable),\n        resultName: resultName,\n        nextLoc: nextLoc\n      };\n\n      if (this.method === \"next\") {\n        // Deliberately forget the last sent value so that we don't\n        // accidentally pass it on to the delegate.\n        this.arg = undefined;\n      }\n\n      return ContinueSentinel;\n    }\n  };\n})(\n  // In sloppy mode, unbound `this` refers to the global object, fallback to\n  // Function constructor if we're in global strict mode. That is sadly a form\n  // of indirect eval which violates Content Security Policy.\n  (function() {\n    return this || (typeof self === \"object\" && self);\n  })() || Function(\"return this\")()\n);\n","import { Directive } from '../type/snakepony'\nimport { SnakeponyConfig } from '../type/snakeponyConfig'\n\nexport function createLoopAi(config: SnakeponyConfig, fastMove: Directive<() => any>) {\n   if (config.sizeY % 2 > 0) {\n      throw new Error('the height of the board must be a multiple of 2')\n   }\n\n   let move: Directive<() => Promise<any>> = Object.fromEntries(\n      Object.entries(fastMove).map(([name, moveFunction]) => {\n         return [\n            name,\n            async () => {\n               await new Promise((resolve) => setTimeout(resolve, 1000 / config.aiSpeed))\n               moveFunction()\n            },\n         ]\n      }),\n   ) as any\n\n   let init = async () => {\n      await move.up()\n      await move.left()\n      await move.left()\n      await move.left()\n      await move.up()\n   }\n   let rightWidth = async () => {\n      for (let k = 0; k < config.sizeX - 2; k++) {\n         await move.right()\n      }\n   }\n   let leftWidth = async () => {\n      for (let k = 0; k < config.sizeX - 2; k++) {\n         await move.left()\n      }\n   }\n   let downZigZag = async () => {\n      for (let k = 0; k < config.sizeY / 2; k++) {\n         if (k > 0) {\n            await move.down()\n         }\n         await rightWidth()\n         await move.down()\n         await leftWidth()\n      }\n   }\n   let upHeight = async () => {\n      for (let k = 0; k < config.sizeY; k++) {\n         await move.up()\n      }\n   }\n   let run = async () => {\n      await init()\n      while (true) {\n         await move.right()\n         await downZigZag()\n         await move.left()\n         await upHeight()\n      }\n   }\n\n   run()\n}\n","/*\nCopyright 2019 David Bau.\n\nPermission is hereby granted, free of charge, to any person obtaining\na copy of this software and associated documentation files (the\n\"Software\"), to deal in the Software without restriction, including\nwithout limitation the rights to use, copy, modify, merge, publish,\ndistribute, sublicense, and/or sell copies of the Software, and to\npermit persons to whom the Software is furnished to do so, subject to\nthe following conditions:\n\nThe above copyright notice and this permission notice shall be\nincluded in all copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND,\nEXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF\nMERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT.\nIN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY\nCLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT,\nTORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE\nSOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.\n\n*/\n\n(function (global, pool, math) {\n//\n// The following constants are related to IEEE 754 limits.\n//\n\nvar width = 256,        // each RC4 output is 0 <= x < 256\n    chunks = 6,         // at least six RC4 outputs for each double\n    digits = 52,        // there are 52 significant digits in a double\n    rngname = 'random', // rngname: name for Math.random and Math.seedrandom\n    startdenom = math.pow(width, chunks),\n    significance = math.pow(2, digits),\n    overflow = significance * 2,\n    mask = width - 1,\n    nodecrypto;         // node.js crypto module, initialized at the bottom.\n\n//\n// seedrandom()\n// This is the seedrandom function described above.\n//\nfunction seedrandom(seed, options, callback) {\n  var key = [];\n  options = (options == true) ? { entropy: true } : (options || {});\n\n  // Flatten the seed string or build one from local entropy if needed.\n  var shortseed = mixkey(flatten(\n    options.entropy ? [seed, tostring(pool)] :\n    (seed == null) ? autoseed() : seed, 3), key);\n\n  // Use the seed to initialize an ARC4 generator.\n  var arc4 = new ARC4(key);\n\n  // This function returns a random double in [0, 1) that contains\n  // randomness in every bit of the mantissa of the IEEE 754 value.\n  var prng = function() {\n    var n = arc4.g(chunks),             // Start with a numerator n < 2 ^ 48\n        d = startdenom,                 //   and denominator d = 2 ^ 48.\n        x = 0;                          //   and no 'extra last byte'.\n    while (n < significance) {          // Fill up all significant digits by\n      n = (n + x) * width;              //   shifting numerator and\n      d *= width;                       //   denominator and generating a\n      x = arc4.g(1);                    //   new least-significant-byte.\n    }\n    while (n >= overflow) {             // To avoid rounding up, before adding\n      n /= 2;                           //   last byte, shift everything\n      d /= 2;                           //   right using integer math until\n      x >>>= 1;                         //   we have exactly the desired bits.\n    }\n    return (n + x) / d;                 // Form the number within [0, 1).\n  };\n\n  prng.int32 = function() { return arc4.g(4) | 0; }\n  prng.quick = function() { return arc4.g(4) / 0x100000000; }\n  prng.double = prng;\n\n  // Mix the randomness into accumulated entropy.\n  mixkey(tostring(arc4.S), pool);\n\n  // Calling convention: what to return as a function of prng, seed, is_math.\n  return (options.pass || callback ||\n      function(prng, seed, is_math_call, state) {\n        if (state) {\n          // Load the arc4 state from the given state if it has an S array.\n          if (state.S) { copy(state, arc4); }\n          // Only provide the .state method if requested via options.state.\n          prng.state = function() { return copy(arc4, {}); }\n        }\n\n        // If called as a method of Math (Math.seedrandom()), mutate\n        // Math.random because that is how seedrandom.js has worked since v1.0.\n        if (is_math_call) { math[rngname] = prng; return seed; }\n\n        // Otherwise, it is a newer calling convention, so return the\n        // prng directly.\n        else return prng;\n      })(\n  prng,\n  shortseed,\n  'global' in options ? options.global : (this == math),\n  options.state);\n}\n\n//\n// ARC4\n//\n// An ARC4 implementation.  The constructor takes a key in the form of\n// an array of at most (width) integers that should be 0 <= x < (width).\n//\n// The g(count) method returns a pseudorandom integer that concatenates\n// the next (count) outputs from ARC4.  Its return value is a number x\n// that is in the range 0 <= x < (width ^ count).\n//\nfunction ARC4(key) {\n  var t, keylen = key.length,\n      me = this, i = 0, j = me.i = me.j = 0, s = me.S = [];\n\n  // The empty key [] is treated as [0].\n  if (!keylen) { key = [keylen++]; }\n\n  // Set up S using the standard key scheduling algorithm.\n  while (i < width) {\n    s[i] = i++;\n  }\n  for (i = 0; i < width; i++) {\n    s[i] = s[j = mask & (j + key[i % keylen] + (t = s[i]))];\n    s[j] = t;\n  }\n\n  // The \"g\" method returns the next (count) outputs as one number.\n  (me.g = function(count) {\n    // Using instance members instead of closure state nearly doubles speed.\n    var t, r = 0,\n        i = me.i, j = me.j, s = me.S;\n    while (count--) {\n      t = s[i = mask & (i + 1)];\n      r = r * width + s[mask & ((s[i] = s[j = mask & (j + t)]) + (s[j] = t))];\n    }\n    me.i = i; me.j = j;\n    return r;\n    // For robust unpredictability, the function call below automatically\n    // discards an initial batch of values.  This is called RC4-drop[256].\n    // See http://google.com/search?q=rsa+fluhrer+response&btnI\n  })(width);\n}\n\n//\n// copy()\n// Copies internal state of ARC4 to or from a plain object.\n//\nfunction copy(f, t) {\n  t.i = f.i;\n  t.j = f.j;\n  t.S = f.S.slice();\n  return t;\n};\n\n//\n// flatten()\n// Converts an object tree to nested arrays of strings.\n//\nfunction flatten(obj, depth) {\n  var result = [], typ = (typeof obj), prop;\n  if (depth && typ == 'object') {\n    for (prop in obj) {\n      try { result.push(flatten(obj[prop], depth - 1)); } catch (e) {}\n    }\n  }\n  return (result.length ? result : typ == 'string' ? obj : obj + '\\0');\n}\n\n//\n// mixkey()\n// Mixes a string seed into a key that is an array of integers, and\n// returns a shortened string seed that is equivalent to the result key.\n//\nfunction mixkey(seed, key) {\n  var stringseed = seed + '', smear, j = 0;\n  while (j < stringseed.length) {\n    key[mask & j] =\n      mask & ((smear ^= key[mask & j] * 19) + stringseed.charCodeAt(j++));\n  }\n  return tostring(key);\n}\n\n//\n// autoseed()\n// Returns an object for autoseeding, using window.crypto and Node crypto\n// module if available.\n//\nfunction autoseed() {\n  try {\n    var out;\n    if (nodecrypto && (out = nodecrypto.randomBytes)) {\n      // The use of 'out' to remember randomBytes makes tight minified code.\n      out = out(width);\n    } else {\n      out = new Uint8Array(width);\n      (global.crypto || global.msCrypto).getRandomValues(out);\n    }\n    return tostring(out);\n  } catch (e) {\n    var browser = global.navigator,\n        plugins = browser && browser.plugins;\n    return [+new Date, global, plugins, global.screen, tostring(pool)];\n  }\n}\n\n//\n// tostring()\n// Converts an array of charcodes to a string\n//\nfunction tostring(a) {\n  return String.fromCharCode.apply(0, a);\n}\n\n//\n// When seedrandom.js is loaded, we immediately mix a few bits\n// from the built-in RNG into the entropy pool.  Because we do\n// not want to interfere with deterministic PRNG state later,\n// seedrandom will not call math.random on its own again after\n// initialization.\n//\nmixkey(math.random(), pool);\n\n//\n// Nodejs and AMD support: export the implementation as a module using\n// either convention.\n//\nif ((typeof module) == 'object' && module.exports) {\n  module.exports = seedrandom;\n  // When in node.js, try using crypto package for autoseeding.\n  try {\n    nodecrypto = require('crypto');\n  } catch (ex) {}\n} else if ((typeof define) == 'function' && define.amd) {\n  define(function() { return seedrandom; });\n} else {\n  // When included as a plain script, set up Math.seedrandom global.\n  math['seed' + rngname] = seedrandom;\n}\n\n\n// End anonymous scope, and pass initial values.\n})(\n  // global: `self` in browsers (including strict mode and web workers),\n  // otherwise `this` in Node and other environments\n  (typeof self !== 'undefined') ? self : this,\n  [],     // pool: entropy pool starts empty\n  Math    // math: package containing random, pow, and seedrandom\n);\n","// A library of seedable RNGs implemented in Javascript.\n//\n// Usage:\n//\n// var seedrandom = require('seedrandom');\n// var random = seedrandom(1); // or any seed.\n// var x = random();       // 0 <= x < 1.  Every bit is random.\n// var x = random.quick(); // 0 <= x < 1.  32 bits of randomness.\n\n// alea, a 53-bit multiply-with-carry generator by Johannes Baagøe.\n// Period: ~2^116\n// Reported to pass all BigCrush tests.\nvar alea = require('./lib/alea');\n\n// xor128, a pure xor-shift generator by George Marsaglia.\n// Period: 2^128-1.\n// Reported to fail: MatrixRank and LinearComp.\nvar xor128 = require('./lib/xor128');\n\n// xorwow, George Marsaglia's 160-bit xor-shift combined plus weyl.\n// Period: 2^192-2^32\n// Reported to fail: CollisionOver, SimpPoker, and LinearComp.\nvar xorwow = require('./lib/xorwow');\n\n// xorshift7, by François Panneton and Pierre L'ecuyer, takes\n// a different approach: it adds robustness by allowing more shifts\n// than Marsaglia's original three.  It is a 7-shift generator\n// with 256 bits, that passes BigCrush with no systmatic failures.\n// Period 2^256-1.\n// No systematic BigCrush failures reported.\nvar xorshift7 = require('./lib/xorshift7');\n\n// xor4096, by Richard Brent, is a 4096-bit xor-shift with a\n// very long period that also adds a Weyl generator. It also passes\n// BigCrush with no systematic failures.  Its long period may\n// be useful if you have many generators and need to avoid\n// collisions.\n// Period: 2^4128-2^32.\n// No systematic BigCrush failures reported.\nvar xor4096 = require('./lib/xor4096');\n\n// Tyche-i, by Samuel Neves and Filipe Araujo, is a bit-shifting random\n// number generator derived from ChaCha, a modern stream cipher.\n// https://eden.dei.uc.pt/~sneves/pubs/2011-snfa2.pdf\n// Period: ~2^127\n// No systematic BigCrush failures reported.\nvar tychei = require('./lib/tychei');\n\n// The original ARC4-based prng included in this library.\n// Period: ~2^1600\nvar sr = require('./seedrandom');\n\nsr.alea = alea;\nsr.xor128 = xor128;\nsr.xorwow = xorwow;\nsr.xorshift7 = xorshift7;\nsr.xor4096 = xor4096;\nsr.tychei = tychei;\n\nmodule.exports = sr;\n","/*! *****************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (b.hasOwnProperty(p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (_) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport function __createBinding(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n}\r\n\r\nexport function __exportStar(m, exports) {\r\n    for (var p in m) if (p !== \"default\" && !exports.hasOwnProperty(p)) exports[p] = m[p];\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n};\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (Object.hasOwnProperty.call(mod, k)) result[k] = mod[k];\r\n    result.default = mod;\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, privateMap) {\r\n    if (!privateMap.has(receiver)) {\r\n        throw new TypeError(\"attempted to get private field on non-instance\");\r\n    }\r\n    return privateMap.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, privateMap, value) {\r\n    if (!privateMap.has(receiver)) {\r\n        throw new TypeError(\"attempted to set private field on non-instance\");\r\n    }\r\n    privateMap.set(receiver, value);\r\n    return value;\r\n}\r\n","/** @prettier */\n\n/**\n * Returns true if the object is a function.\n * @param value The value to check\n */\nexport function isFunction(value: any): value is (...args: any[]) => any {\n  return typeof value === 'function';\n}\n","/** @prettier */\n\n/**\n * Used to create Error subclasses until the community moves away from ES5.\n *\n * This is because compiling from TypeScript down to ES5 has issues with subclassing Errors\n * as well as other built-in types: https://github.com/Microsoft/TypeScript/issues/12123\n *\n * @param createImpl A factory function to create the actual constructor implementation. The returned\n * function should be a named function that calls `_super` internally.\n */\nexport function createErrorClass<T>(createImpl: (_super: any) => any): T {\n  const _super = (instance: any) => {\n    Error.call(instance);\n    instance.stack = new Error().stack;\n  };\n\n  const ctorFunc = createImpl(_super);\n  ctorFunc.prototype = Object.create(Error.prototype);\n  ctorFunc.prototype.constructor = ctorFunc;\n  return ctorFunc;\n}\n","/** @prettier */\nimport { createErrorClass } from './createErrorClass';\n\nexport interface UnsubscriptionError extends Error {\n  readonly errors: any[];\n}\n\nexport interface UnsubscriptionErrorCtor {\n  new (errors: any[]): UnsubscriptionError;\n}\n\n/**\n * An error thrown when one or more errors have occurred during the\n * `unsubscribe` of a {@link Subscription}.\n */\nexport const UnsubscriptionError: UnsubscriptionErrorCtor = createErrorClass(\n  (_super) =>\n    function UnsubscriptionErrorImpl(this: any, errors: (Error | string)[]) {\n      _super(this);\n      this.message = errors\n        ? `${errors.length} errors occurred during unsubscription:\n${errors.map((err, i) => `${i + 1}) ${err.toString()}`).join('\\n  ')}`\n        : '';\n      this.name = 'UnsubscriptionError';\n      this.errors = errors;\n    }\n);\n","/** @prettier */\n\n/**\n * Removes an item from an array, mutating it.\n * @param arr The array to remove the item from\n * @param item The item to remove\n */\nexport function arrRemove<T>(arr: T[] | undefined | null, item: T) {\n  if (arr) {\n    const index = arr.indexOf(item);\n    0 <= index && arr.splice(index, 1);\n  }\n}\n","/** @prettier */\nimport { isFunction } from './util/isFunction';\nimport { UnsubscriptionError } from './util/UnsubscriptionError';\nimport { SubscriptionLike, TeardownLogic, Unsubscribable } from './types';\nimport { arrRemove } from './util/arrRemove';\n\n/**\n * Represents a disposable resource, such as the execution of an Observable. A\n * Subscription has one important method, `unsubscribe`, that takes no argument\n * and just disposes the resource held by the subscription.\n *\n * Additionally, subscriptions may be grouped together through the `add()`\n * method, which will attach a child Subscription to the current Subscription.\n * When a Subscription is unsubscribed, all its children (and its grandchildren)\n * will be unsubscribed as well.\n *\n * @class Subscription\n */\nexport class Subscription implements SubscriptionLike {\n  /** @nocollapse */\n  public static EMPTY = (() => {\n    const empty = new Subscription();\n    empty.closed = true;\n    return empty;\n  })();\n\n  /**\n   * A flag to indicate whether this Subscription has already been unsubscribed.\n   */\n  public closed = false;\n\n  private _parentage: Subscription[] | Subscription | null = null;\n\n  /**\n   * The list of registered teardowns to execute upon unsubscription. Adding and removing from this\n   * list occurs in the {@link add} and {@link remove} methods.\n   */\n  private _teardowns: Exclude<TeardownLogic, void>[] | null = null;\n\n  /**\n   * @param initialTeardown A function executed first as part of the teardown\n   * process that is kicked off when {@link unsubscribe} is called.\n   */\n  constructor(private initialTeardown?: () => void) {}\n\n  /**\n   * Disposes the resources held by the subscription. May, for instance, cancel\n   * an ongoing Observable execution or cancel any other type of work that\n   * started when the Subscription was created.\n   * @return {void}\n   */\n  unsubscribe(): void {\n    let errors: any[] | undefined;\n\n    if (!this.closed) {\n      this.closed = true;\n\n      // Remove this from it's parents.\n      const { _parentage } = this;\n      if (Array.isArray(_parentage)) {\n        for (const parent of _parentage) {\n          parent.remove(this);\n        }\n      } else {\n        _parentage?.remove(this);\n      }\n\n      const { initialTeardown } = this;\n      if (isFunction(initialTeardown)) {\n        try {\n          initialTeardown();\n        } catch (e) {\n          errors = e instanceof UnsubscriptionError ? e.errors : [e];\n        }\n      }\n\n      const { _teardowns } = this;\n      if (_teardowns) {\n        this._teardowns = null;\n        for (const teardown of _teardowns) {\n          try {\n            execTeardown(teardown);\n          } catch (err) {\n            errors = errors ?? [];\n            if (err instanceof UnsubscriptionError) {\n              errors = [...errors, ...err.errors];\n            } else {\n              errors.push(err);\n            }\n          }\n        }\n      }\n\n      if (errors) {\n        throw new UnsubscriptionError(errors);\n      }\n    }\n  }\n\n  /**\n   * Adds a teardown to this subscription, so that teardown will be unsubscribed/called\n   * when this subscription is unsubscribed. If this subscription is already {@link closed},\n   * because it has already been unsubscribed, then whatever teardown is passed to it\n   * will automatically be executed (unless the teardown itself is also a closed subscription).\n   *\n   * Closed Subscriptions cannot be added as teardowns to any subscription. Adding a closed\n   * subscription to a any subscription will result in no operation. (A noop).\n   *\n   * Adding a subscription to itself, or adding `null` or `undefined` will not perform any\n   * operation at all. (A noop).\n   *\n   * `Subscription` instances that are added to this instance will automatically remove themselves\n   * if they are unsubscribed. Functions and {@link Unsubscribable} objects that you wish to remove\n   * will need to be removed manually with {@link remove}\n   *\n   * @param teardown The teardown logic to add to this subscription.\n   */\n  add(teardown: TeardownLogic): void {\n    // Only add the teardown if it's not undefined\n    // and don't add a subscription to itself.\n    if (teardown && teardown !== this) {\n      if (this.closed) {\n        // If this subscription is already closed,\n        // execute whatever teardown is handed to it automatically.\n        execTeardown(teardown);\n      } else {\n        if (teardown instanceof Subscription) {\n          // We don't add closed subscriptions, and we don't add the same subscription\n          // twice. Subscription unsubscribe is idempotent.\n          if (teardown.closed || teardown._hasParent(this)) {\n            return;\n          }\n          teardown._addParent(this);\n        }\n        (this._teardowns = this._teardowns ?? []).push(teardown);\n      }\n    }\n  }\n\n  /**\n   * Checks to see if a this subscription already has a particular parent.\n   * This will signal that this subscription has already been added to the parent in question.\n   * @param parent the parent to check for\n   */\n  private _hasParent(parent: Subscription) {\n    const { _parentage } = this;\n    return _parentage === parent || (Array.isArray(_parentage) && _parentage.includes(parent));\n  }\n\n  /**\n   * Adds a parent to this subscription so it can be removed from the parent if it\n   * unsubscribes on it's own.\n   *\n   * NOTE: THIS ASSUMES THAT {@link _hasParent} HAS ALREADY BEEN CHECKED.\n   * @param parent The parent subscription to add\n   */\n  private _addParent(parent: Subscription) {\n    const { _parentage } = this;\n    this._parentage = Array.isArray(_parentage) ? (_parentage.push(parent), _parentage) : _parentage ? [_parentage, parent] : parent;\n  }\n\n  /**\n   * Called on a child when it is removed via {@link remove}.\n   * @param parent The parent to remove\n   */\n  private _removeParent(parent: Subscription) {\n    const { _parentage } = this;\n    if (_parentage === parent) {\n      this._parentage = null;\n    } else if (Array.isArray(_parentage)) {\n      arrRemove(_parentage, parent);\n    }\n  }\n\n  /**\n   * Removes a teardown from this subscription that was previously added with the {@link add} method.\n   *\n   * Note that `Subscription` instances, when unsubscribed, will automatically remove themselves\n   * from every other `Subscription` they have been added to. This means that using the `remove` method\n   * is not a common thing and should be used thoughtfully.\n   *\n   * If you add the same teardown instance of a function or an unsubscribable object to a `Subcription` instance\n   * more than once, you will need to call `remove` the same number of times to remove all instances.\n   *\n   * All teardown instances are removed to free up memory upon unsubscription.\n   *\n   * @param teardown The teardown to remove from this subscription\n   */\n  remove(teardown: Exclude<TeardownLogic, void>): void {\n    const { _teardowns } = this;\n    _teardowns && arrRemove(_teardowns, teardown);\n\n    if (teardown instanceof Subscription) {\n      teardown._removeParent(this);\n    }\n  }\n}\n\nexport const EMPTY_SUBSCRIPTION = Subscription.EMPTY;\n\nexport function isSubscription(value: any): value is Subscription {\n  return (\n    value instanceof Subscription ||\n    (value && 'closed' in value && isFunction(value.remove) && isFunction(value.add) && isFunction(value.unsubscribe))\n  );\n}\n\nfunction execTeardown(teardown: Unsubscribable | (() => void)) {\n  if (isFunction(teardown)) {\n    teardown();\n  } else {\n    teardown.unsubscribe();\n  }\n}\n","/** @prettier */\nimport { Subscriber } from './Subscriber';\nimport { ObservableNotification } from './types';\n\n/**\n * The global configuration object for RxJS, used to configure things\n * like what Promise constructor should used to create Promises\n */\nexport const config = {\n  /**\n   * A registration point for unhandled errors from RxJS. These are errors that\n   * cannot were not handled by consuming code in the usual subscription path. For\n   * example, if you have this configured, and you subscribe to an observable without\n   * providing an error handler, errors from that subscription will end up here. This\n   * will _always_ be called asynchronously on another job in the runtime. This is because\n   * we do not want errors thrown in this user-configured handler to interfere with the\n   * behavior of the library.\n   */\n  onUnhandledError: null as ((err: any) => void) | null,\n\n  /**\n   * A registration point for notifications that cannot be sent to subscribers because they\n   * have completed, errored or have been explicitly unsubscribed. By default, next, complete\n   * and error notifications sent to stopped subscribers are noops. However, sometimes callers\n   * might want a different behavior. For example, with sources that attempt to report errors\n   * to stopped subscribers, a caller can configure RxJS to throw an unhandled error instead.\n   * This will _always_ be called asynchronously on another job in the runtime. This is because\n   * we do not want errors thrown in this user-configured handler to interfere with the\n   * behavior of the library.\n   */\n  onStoppedNotification: null as ((notification: ObservableNotification<any>, subscriber: Subscriber<any>) => void) | null,\n\n  /**\n   * The promise constructor used by default for methods such as\n   * {@link toPromise} and {@link forEach}\n   *\n   * @deprecated remove in v8. RxJS will no longer support this sort of injection of a\n   * Promise constructor. If you need a Promise implementation other than native promises,\n   * please polyfill/patch Promises as you see appropriate.\n   */\n  Promise: undefined as PromiseConstructorLike | undefined,\n\n  /**\n   * If true, turns on synchronous error rethrowing, which is a deprecated behavior\n   * in v6 and higher. This behavior enables bad patterns like wrapping a subscribe\n   * call in a try/catch block. It also enables producer interference, a nasty bug\n   * where a multicast can be broken for all observers by a downstream consumer with\n   * an unhandled error. DO NOT USE THIS FLAG UNLESS IT'S NEEDED TO BY TIME\n   * FOR MIGRATION REASONS.\n   *\n   * @deprecated remove in v8. As of version 8, RxJS will no longer support synchronous throwing\n   * of unhandled errors. All errors will be thrown on a separate call stack to prevent bad\n   * behaviors described above.\n   */\n  useDeprecatedSynchronousErrorHandling: false,\n\n  /**\n   * If true, enables an as-of-yet undocumented feature from v5: The ability to access\n   * `unsubscribe()` via `this` context in `next` functions created in observers passed\n   * to `subscribe`.\n   *\n   * This is being removed because the performance was severely problematic, and it could also cause\n   * issues when types other than POJOs are passed to subscribe as subscribers, as they will likely have\n   * their `this` context overwritten.\n   *\n   * @deprecated remove in v8. As of version 8, RxJS will no longer support altering the\n   * context of next functions provided as part of an observer to Subscribe. Instead,\n   * you will have access to a subscription or a signal or token that will allow you to do things like\n   * unsubscribe and test closed status.\n   */\n  useDeprecatedNextContext: false,\n};\n","/** @prettier */\ntype SetTimeoutFunction = (handler: () => void, timeout?: number, ...args: any[]) => number;\ntype ClearTimeoutFunction = (handle: number) => void;\n\ninterface TimeoutProvider {\n  setTimeout: SetTimeoutFunction;\n  clearTimeout: ClearTimeoutFunction;\n  delegate:\n    | {\n        setTimeout: SetTimeoutFunction;\n        clearTimeout: ClearTimeoutFunction;\n      }\n    | undefined;\n}\n\nexport const timeoutProvider: TimeoutProvider = {\n  // When accessing the delegate, use the variable rather than `this` so that\n  // the functions can be called without being bound to the provider.\n  setTimeout(...args) {\n    const { delegate } = timeoutProvider;\n    return (delegate?.setTimeout || setTimeout)(...args);\n  },\n  clearTimeout(handle) {\n    const { delegate } = timeoutProvider;\n    return (delegate?.clearTimeout || clearTimeout)(handle);\n  },\n  delegate: undefined,\n};\n","/** @prettier */\nimport { config } from '../config';\nimport { timeoutProvider } from '../scheduler/timeoutProvider';\n\n/**\n * Handles an error on another job either with the user-configured {@link onUnhandledError},\n * or by throwing it on that new job so it can be picked up by `window.onerror`, `process.on('error')`, etc.\n *\n * This should be called whenever there is an error that is out-of-band with the subscription\n * or when an error hits a terminal boundary of the subscription and no error handler was provided.\n *\n * @param err the error to report\n */\nexport function reportUnhandledError(err: any) {\n  timeoutProvider.setTimeout(() => {\n    const { onUnhandledError } = config;\n    if (onUnhandledError) {\n      // Execute the user-configured error handler.\n      onUnhandledError(err);\n    } else {\n      // Throw so it is picked up by the runtime's uncaught error mechanism.\n      throw err;\n    }\n  });\n}\n","/* tslint:disable:no-empty */\nexport function noop() { }\n","/** @prettier */\nimport { CompleteNotification, NextNotification, ErrorNotification } from './types';\n\n/**\n * A completion object optimized for memory use and created to be the\n * same \"shape\" as other notifications in v8.\n * @internal\n */\nexport const COMPLETE_NOTIFICATION = (() => createNotification('C', undefined, undefined) as CompleteNotification)();\n\n/**\n * Internal use only. Creates an optimized error notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function errorNotification(error: any): ErrorNotification {\n  return createNotification('E', undefined, error) as any;\n}\n\n/**\n * Internal use only. Creates an optimized next notification that is the same \"shape\"\n * as other notifications.\n * @internal\n */\nexport function nextNotification<T>(value: T) {\n  return createNotification('N', value, undefined) as NextNotification<T>;\n}\n\n/**\n * Ensures that all notifications created internally have the same \"shape\" in v8.\n *\n * TODO: This is only exported to support a crazy legacy test in `groupBy`.\n * @internal\n */\nexport function createNotification(kind: 'N' | 'E' | 'C', value: any, error: any) {\n  return {\n    kind,\n    value,\n    error,\n  };\n}\n","/** @prettier */\nimport { isFunction } from './util/isFunction';\nimport { Observer, PartialObserver, ObservableNotification } from './types';\nimport { isSubscription, Subscription } from './Subscription';\nimport { config } from './config';\nimport { reportUnhandledError } from './util/reportUnhandledError';\nimport { noop } from './util/noop';\nimport { nextNotification, errorNotification, COMPLETE_NOTIFICATION } from './NotificationFactories';\nimport { timeoutProvider } from './scheduler/timeoutProvider';\n\n/**\n * Implements the {@link Observer} interface and extends the\n * {@link Subscription} class. While the {@link Observer} is the public API for\n * consuming the values of an {@link Observable}, all Observers get converted to\n * a Subscriber, in order to provide Subscription-like capabilities such as\n * `unsubscribe`. Subscriber is a common type in RxJS, and crucial for\n * implementing operators, but it is rarely used as a public API.\n *\n * @class Subscriber<T>\n */\nexport class Subscriber<T> extends Subscription implements Observer<T> {\n  /**\n   * A static factory for a Subscriber, given a (potentially partial) definition\n   * of an Observer.\n   * @param next The `next` callback of an Observer.\n   * @param error The `error` callback of an\n   * Observer.\n   * @param complete The `complete` callback of an\n   * Observer.\n   * @return A Subscriber wrapping the (partially defined)\n   * Observer represented by the given arguments.\n   * @nocollapse\n   * @deprecated Do not use. Will be removed in v8. There is no replacement for this method, and there is no reason to be creating instances of `Subscriber` directly. If you have a specific use case, please file an issue.\n   */\n  static create<T>(next?: (x?: T) => void, error?: (e?: any) => void, complete?: () => void): Subscriber<T> {\n    return new SafeSubscriber(next, error, complete);\n  }\n\n  protected isStopped: boolean = false;\n  protected destination: Subscriber<any> | Observer<any>; // this `any` is the escape hatch to erase extra type param (e.g. R)\n\n  /**\n   * @deprecated Do not use directly. There is no reason to directly create an instance of Subscriber. This type is exported for typings reasons.\n   */\n  constructor(destination?: Subscriber<any> | Observer<any>) {\n    super();\n    if (destination) {\n      this.destination = destination;\n      // Automatically chain subscriptions together here.\n      // if destination is a Subscription, then it is a Subscriber.\n      if (isSubscription(destination)) {\n        destination.add(this);\n      }\n    } else {\n      this.destination = EMPTY_OBSERVER;\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive notifications of type `next` from\n   * the Observable, with a value. The Observable may call this method 0 or more\n   * times.\n   * @param {T} [value] The `next` value.\n   * @return {void}\n   */\n  next(value?: T): void {\n    if (this.isStopped) {\n      handleStoppedNotification(nextNotification(value), this);\n    } else {\n      this._next(value!);\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive notifications of type `error` from\n   * the Observable, with an attached `Error`. Notifies the Observer that\n   * the Observable has experienced an error condition.\n   * @param {any} [err] The `error` exception.\n   * @return {void}\n   */\n  error(err?: any): void {\n    if (this.isStopped) {\n      handleStoppedNotification(errorNotification(err), this);\n    } else {\n      this.isStopped = true;\n      this._error(err);\n    }\n  }\n\n  /**\n   * The {@link Observer} callback to receive a valueless notification of type\n   * `complete` from the Observable. Notifies the Observer that the Observable\n   * has finished sending push-based notifications.\n   * @return {void}\n   */\n  complete(): void {\n    if (this.isStopped) {\n      handleStoppedNotification(COMPLETE_NOTIFICATION, this);\n    } else {\n      this.isStopped = true;\n      this._complete();\n    }\n  }\n\n  unsubscribe(): void {\n    if (!this.closed) {\n      this.isStopped = true;\n      super.unsubscribe();\n    }\n  }\n\n  protected _next(value: T): void {\n    this.destination.next(value);\n  }\n\n  protected _error(err: any): void {\n    this.destination.error(err);\n    this.unsubscribe();\n  }\n\n  protected _complete(): void {\n    this.destination.complete();\n    this.unsubscribe();\n  }\n}\n\nexport class SafeSubscriber<T> extends Subscriber<T> {\n  constructor(\n    observerOrNext?: PartialObserver<T> | ((value: T) => void) | null,\n    error?: ((e?: any) => void) | null,\n    complete?: (() => void) | null\n  ) {\n    super();\n\n    // If we don't have arguments, or the observer passed is already EMPTY_OBSERVER,\n    // use EMPTY_OBSERVER. This is just to save a little on object allocations.\n    this.destination = EMPTY_OBSERVER;\n    if ((observerOrNext || error || complete) && observerOrNext !== EMPTY_OBSERVER) {\n      // We've got either functions or an observer to deal with\n      // let's figure that out here.\n\n      let next: ((value: T) => void) | undefined;\n      if (isFunction(observerOrNext)) {\n        next = observerOrNext;\n      } else if (observerOrNext) {\n        // Even if it's an observer, we have to pull the handlers off and\n        // capture the owner object as the context. That is because we're\n        // going to put them all in a new destination with ensured methods\n        // for `next`, `error`, and `complete`. That's part of what makes this\n        // the \"Safe\" Subscriber.\n        ({ next, error, complete } = observerOrNext);\n        let context: any;\n        if (this && config.useDeprecatedNextContext) {\n          // This is a deprecated path that made `this.unsubscribe()` available in\n          // next handler functions passed to subscribe. This only exists behind a flag\n          // now, as it is *very* slow.\n          context = Object.create(observerOrNext);\n          context.unsubscribe = () => this.unsubscribe();\n        } else {\n          context = observerOrNext;\n        }\n        next = next?.bind(context);\n        error = error?.bind(context);\n        complete = complete?.bind(context);\n      }\n\n      // Once we set the destination, the superclass `Subscriber` will\n      // do it's magic in the `_next`, `_error`, and `_complete` methods.\n      this.destination = {\n        next: next || noop,\n        error: error || defaultErrorHandler,\n        complete: complete || noop,\n      };\n    }\n  }\n}\n\n/**\n * An error handler used when no error handler was supplied\n * to the SafeSubscriber -- meaning no error handler was supplied\n * do the `subscribe` call on our observable.\n * @param err The error to handle\n */\nfunction defaultErrorHandler(err: any) {\n  // TODO: Remove in v8.\n  if (config.useDeprecatedSynchronousErrorHandling) {\n    throw err;\n  }\n  reportUnhandledError(err);\n}\n\n/**\n * A handler for notifications that cannot be sent to a stopped subscriber.\n * @param notification The notification being sent\n * @param subscriber The stopped subscriber\n */\nfunction handleStoppedNotification(notification: ObservableNotification<any>, subscriber: Subscriber<any>) {\n  const { onStoppedNotification } = config;\n  onStoppedNotification && timeoutProvider.setTimeout(() => onStoppedNotification(notification, subscriber));\n}\n\n/**\n * The observer used as a stub for subscriptions where the user did not\n * pass any arguments to `subscribe`. Comes with the default error handling\n * behavior.\n */\nexport const EMPTY_OBSERVER: Readonly<Observer<any>> = {\n  closed: true,\n  next: noop,\n  error: defaultErrorHandler,\n  complete: noop,\n};\n","/** @prettier */\n\n/** Symbol.observable or a string \"@@observable\". Used for interop */\nexport const observable = (() => (typeof Symbol === 'function' && Symbol.observable) || '@@observable')();\n","export function identity<T>(x: T): T {\n  return x;\n}\n","import { identity } from './identity';\nimport { UnaryFunction } from '../types';\n\n/* tslint:disable:max-line-length */\nexport function pipe<T>(): UnaryFunction<T, T>;\nexport function pipe<T, A>(fn1: UnaryFunction<T, A>): UnaryFunction<T, A>;\nexport function pipe<T, A, B>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>): UnaryFunction<T, B>;\nexport function pipe<T, A, B, C>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>): UnaryFunction<T, C>;\nexport function pipe<T, A, B, C, D>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>, fn4: UnaryFunction<C, D>): UnaryFunction<T, D>;\nexport function pipe<T, A, B, C, D, E>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>, fn4: UnaryFunction<C, D>, fn5: UnaryFunction<D, E>): UnaryFunction<T, E>;\nexport function pipe<T, A, B, C, D, E, F>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>, fn4: UnaryFunction<C, D>, fn5: UnaryFunction<D, E>, fn6: UnaryFunction<E, F>): UnaryFunction<T, F>;\nexport function pipe<T, A, B, C, D, E, F, G>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>, fn4: UnaryFunction<C, D>, fn5: UnaryFunction<D, E>, fn6: UnaryFunction<E, F>, fn7: UnaryFunction<F, G>): UnaryFunction<T, G>;\nexport function pipe<T, A, B, C, D, E, F, G, H>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>, fn4: UnaryFunction<C, D>, fn5: UnaryFunction<D, E>, fn6: UnaryFunction<E, F>, fn7: UnaryFunction<F, G>, fn8: UnaryFunction<G, H>): UnaryFunction<T, H>;\nexport function pipe<T, A, B, C, D, E, F, G, H, I>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>, fn4: UnaryFunction<C, D>, fn5: UnaryFunction<D, E>, fn6: UnaryFunction<E, F>, fn7: UnaryFunction<F, G>, fn8: UnaryFunction<G, H>, fn9: UnaryFunction<H, I>): UnaryFunction<T, I>;\nexport function pipe<T, A, B, C, D, E, F, G, H, I>(fn1: UnaryFunction<T, A>, fn2: UnaryFunction<A, B>, fn3: UnaryFunction<B, C>, fn4: UnaryFunction<C, D>, fn5: UnaryFunction<D, E>, fn6: UnaryFunction<E, F>, fn7: UnaryFunction<F, G>, fn8: UnaryFunction<G, H>, fn9: UnaryFunction<H, I>, ...fns: UnaryFunction<any, any>[]): UnaryFunction<T, {}>;\n/* tslint:enable:max-line-length */\n\nexport function pipe(...fns: Array<UnaryFunction<any, any>>): UnaryFunction<any, any> {\n  return pipeFromArray(fns);\n}\n\n/** @internal */\nexport function pipeFromArray<T, R>(fns: Array<UnaryFunction<T, R>>): UnaryFunction<T, R> {\n  if (fns.length === 0) {\n    return identity as UnaryFunction<any, any>;\n  }\n\n  if (fns.length === 1) {\n    return fns[0];\n  }\n\n  return function piped(input: T): R {\n    return fns.reduce((prev: any, fn: UnaryFunction<T, R>) => fn(prev), input as any);\n  };\n}\n","/**\n * @prettier\n */\nimport { Operator } from './Operator';\nimport { SafeSubscriber, Subscriber } from './Subscriber';\nimport { isSubscription, Subscription } from './Subscription';\nimport { TeardownLogic, OperatorFunction, PartialObserver, Subscribable, Observer } from './types';\nimport { observable as Symbol_observable } from './symbol/observable';\nimport { pipeFromArray } from './util/pipe';\nimport { config } from './config';\nimport { isFunction } from './util/isFunction';\n\n/**\n * A representation of any set of values over any amount of time. This is the most basic building block\n * of RxJS.\n *\n * @class Observable<T>\n */\nexport class Observable<T> implements Subscribable<T> {\n  /** @deprecated This is an internal implementation detail, do not use. */\n  protected source: Observable<any> | undefined;\n\n  /** @deprecated This is an internal implementation detail, do not use. */\n  protected operator: Operator<any, T> | undefined;\n\n  /**\n   * @constructor\n   * @param {Function} subscribe the function that is called when the Observable is\n   * initially subscribed to. This function is given a Subscriber, to which new values\n   * can be `next`ed, or an `error` method can be called to raise an error, or\n   * `complete` can be called to notify of a successful completion.\n   */\n  constructor(subscribe?: (this: Observable<T>, subscriber: Subscriber<T>) => TeardownLogic) {\n    if (subscribe) {\n      this._subscribe = subscribe;\n    }\n  }\n\n  // HACK: Since TypeScript inherits static properties too, we have to\n  // fight against TypeScript here so Subject can have a different static create signature\n  /**\n   * Creates a new cold Observable by calling the Observable constructor\n   * @owner Observable\n   * @method create\n   * @param {Function} subscribe? the subscriber function to be passed to the Observable constructor\n   * @return {Observable} a new cold observable\n   * @nocollapse\n   * @deprecated use new Observable() instead\n   */\n  static create: (...args: any[]) => any = <T>(subscribe?: (subscriber: Subscriber<T>) => TeardownLogic) => {\n    return new Observable<T>(subscribe);\n  };\n\n  /**\n   * Creates a new Observable, with this Observable instance as the source, and the passed\n   * operator defined as the new observable's operator.\n   * @method lift\n   * @param operator the operator defining the operation to take on the observable\n   * @return a new observable with the Operator applied\n   * @deprecated This is an internal implementation detail, do not use directly. If you have implemented an operator\n   * using `lift`, it is recommended that you create an operator by simply returning `new Observable()` directly.\n   * See \"Creating new operators from scratch\" section here: https://rxjs.dev/guide/operators\n   */\n  protected lift<R>(operator?: Operator<T, R>): Observable<R> {\n    const observable = new Observable<R>();\n    observable.source = this;\n    observable.operator = operator;\n    return observable;\n  }\n\n  subscribe(observer?: PartialObserver<T>): Subscription;\n  /** @deprecated Use an observer instead of a complete callback */\n  subscribe(next: null | undefined, error: null | undefined, complete: () => void): Subscription;\n  /** @deprecated Use an observer instead of an error callback */\n  subscribe(next: null | undefined, error: (error: any) => void, complete?: () => void): Subscription;\n  /** @deprecated Use an observer instead of a complete callback */\n  subscribe(next: (value: T) => void, error: null | undefined, complete: () => void): Subscription;\n  subscribe(next?: (value: T) => void, error?: (error: any) => void, complete?: () => void): Subscription;\n  /**\n   * Invokes an execution of an Observable and registers Observer handlers for notifications it will emit.\n   *\n   * <span class=\"informal\">Use it when you have all these Observables, but still nothing is happening.</span>\n   *\n   * `subscribe` is not a regular operator, but a method that calls Observable's internal `subscribe` function. It\n   * might be for example a function that you passed to Observable's constructor, but most of the time it is\n   * a library implementation, which defines what will be emitted by an Observable, and when it be will emitted. This means\n   * that calling `subscribe` is actually the moment when Observable starts its work, not when it is created, as it is often\n   * the thought.\n   *\n   * Apart from starting the execution of an Observable, this method allows you to listen for values\n   * that an Observable emits, as well as for when it completes or errors. You can achieve this in two\n   * of the following ways.\n   *\n   * The first way is creating an object that implements {@link Observer} interface. It should have methods\n   * defined by that interface, but note that it should be just a regular JavaScript object, which you can create\n   * yourself in any way you want (ES6 class, classic function constructor, object literal etc.). In particular do\n   * not attempt to use any RxJS implementation details to create Observers - you don't need them. Remember also\n   * that your object does not have to implement all methods. If you find yourself creating a method that doesn't\n   * do anything, you can simply omit it. Note however, if the `error` method is not provided, all errors will\n   * be left uncaught.\n   *\n   * The second way is to give up on Observer object altogether and simply provide callback functions in place of its methods.\n   * This means you can provide three functions as arguments to `subscribe`, where the first function is equivalent\n   * of a `next` method, the second of an `error` method and the third of a `complete` method. Just as in case of Observer,\n   * if you do not need to listen for something, you can omit a function, preferably by passing `undefined` or `null`,\n   * since `subscribe` recognizes these functions by where they were placed in function call. When it comes\n   * to `error` function, just as before, if not provided, errors emitted by an Observable will be thrown.\n   *\n   * Whichever style of calling `subscribe` you use, in both cases it returns a Subscription object.\n   * This object allows you to call `unsubscribe` on it, which in turn will stop the work that an Observable does and will clean\n   * up all resources that an Observable used. Note that cancelling a subscription will not call `complete` callback\n   * provided to `subscribe` function, which is reserved for a regular completion signal that comes from an Observable.\n   *\n   * Remember that callbacks provided to `subscribe` are not guaranteed to be called asynchronously.\n   * It is an Observable itself that decides when these functions will be called. For example {@link of}\n   * by default emits all its values synchronously. Always check documentation for how given Observable\n   * will behave when subscribed and if its default behavior can be modified with a `scheduler`.\n   *\n   * ## Example\n   * ### Subscribe with an Observer\n   * ```ts\n   * import { of } from 'rxjs';\n   *\n   * const sumObserver = {\n   *   sum: 0,\n   *   next(value) {\n   *     console.log('Adding: ' + value);\n   *     this.sum = this.sum + value;\n   *   },\n   *   error() {\n   *     // We actually could just remove this method,\n   *     // since we do not really care about errors right now.\n   *   },\n   *   complete() {\n   *     console.log('Sum equals: ' + this.sum);\n   *   }\n   * };\n   *\n   * of(1, 2, 3) // Synchronously emits 1, 2, 3 and then completes.\n   *   .subscribe(sumObserver);\n   *\n   * // Logs:\n   * // \"Adding: 1\"\n   * // \"Adding: 2\"\n   * // \"Adding: 3\"\n   * // \"Sum equals: 6\"\n   * ```\n   *\n   * ### Subscribe with functions\n   * ```ts\n   * import { of } from 'rxjs'\n   *\n   * let sum = 0;\n   *\n   * of(1, 2, 3).subscribe(\n   *   value => {\n   *     console.log('Adding: ' + value);\n   *     sum = sum + value;\n   *   },\n   *   undefined,\n   *   () => console.log('Sum equals: ' + sum)\n   * );\n   *\n   * // Logs:\n   * // \"Adding: 1\"\n   * // \"Adding: 2\"\n   * // \"Adding: 3\"\n   * // \"Sum equals: 6\"\n   * ```\n   *\n   * ### Cancel a subscription\n   * ```ts\n   * import { interval } from 'rxjs';\n   *\n   * const subscription = interval(1000).subscribe(\n   *   num => console.log(num),\n   *   undefined,\n   *   () => {\n   *     // Will not be called, even when cancelling subscription.\n   *     console.log('completed!');\n   *   }\n   * );\n   *\n   * setTimeout(() => {\n   *   subscription.unsubscribe();\n   *   console.log('unsubscribed!');\n   * }, 2500);\n   *\n   * // Logs:\n   * // 0 after 1s\n   * // 1 after 2s\n   * // \"unsubscribed!\" after 2.5s\n   * ```\n   *\n   * @param {Observer|Function} observerOrNext (optional) Either an observer with methods to be called,\n   *  or the first of three possible handlers, which is the handler for each value emitted from the subscribed\n   *  Observable.\n   * @param {Function} error (optional) A handler for a terminal event resulting from an error. If no error handler is provided,\n   *  the error will be thrown as unhandled.\n   * @param {Function} complete (optional) A handler for a terminal event resulting from successful completion.\n   * @return {ISubscription} a subscription reference to the registered handlers\n   * @method subscribe\n   */\n  subscribe(\n    observerOrNext?: PartialObserver<T> | ((value: T) => void) | null,\n    error?: ((error: any) => void) | null,\n    complete?: (() => void) | null\n  ): Subscription {\n    const subscriber = isSubscriber(observerOrNext) ? observerOrNext : new SafeSubscriber(observerOrNext, error, complete);\n\n    // If we have an operator, it's the result of a lift, and we let the lift\n    // mechanism do the subscription for us in the operator call. Otherwise,\n    // if we have a source, it's a trusted observable we own, and we can call\n    // the _subscribe without wrapping it in a try/catch. If we are supposed to\n    // use the deprecated sync error handling, then we don't need the try/catch either\n    // otherwise, it may be from a user-made observable instance, and we want to\n    // wrap it in a try/catch so we can handle errors appropriately.\n    const { operator, source } = this;\n    subscriber.add(\n      operator\n        ? operator.call(subscriber, source)\n        : source || config.useDeprecatedSynchronousErrorHandling\n        ? this._subscribe(subscriber)\n        : this._trySubscribe(subscriber)\n    );\n\n    return subscriber;\n  }\n\n  /** @deprecated This is an internal implementation detail, do not use. */\n  protected _trySubscribe(sink: Subscriber<T>): TeardownLogic {\n    try {\n      return this._subscribe(sink);\n    } catch (err) {\n      if (config.useDeprecatedSynchronousErrorHandling) {\n        throw err;\n      }\n      sink.error(err);\n    }\n  }\n\n  /**\n   * Used as a NON-CANCELLABLE means of subscribing to an observable, for use with\n   * APIs that expect promises, like `async/await`. You cannot unsubscribe from this.\n   *\n   * **WARNING**: Only use this with observables you *know* will complete. If the source\n   * observable does not complete, you will end up with a promise that is hung up, and\n   * potentially all of the state of an async function hanging out in memory. To avoid\n   * this situation, look into adding something like {@link timeout}, {@link take},\n   * {@link takeWhile}, or {@link takeUntil} amongst others.\n   *\n   * ### Example:\n   *\n   * ```ts\n   * import { interval } from 'rxjs';\n   * import { take } from 'rxjs/operators';\n   *\n   * const source$ = interval(1000).pipe(take(4));\n   *\n   * async function getTotal() {\n   *    let total = 0;\n   *\n   *    await source$.forEach(value => {\n   *      total += value;\n   *      console.log('observable -> ', value);\n   *    });\n   *\n   *    return total;\n   * }\n   *\n   * getTotal().then(\n   *    total => console.log('Total:', total)\n   * )\n   *\n   * // Expected:\n   * // \"observable -> 0\"\n   * // \"observable -> 1\"\n   * // \"observable -> 2\"\n   * // \"observable -> 3\"\n   * // \"Total: 6\"\n   * ```\n   * @param next a handler for each value emitted by the observable\n   * @return a promise that either resolves on observable completion or\n   *  rejects with the handled error\n   */\n  forEach(next: (value: T) => void): Promise<void>;\n\n  /**\n   * @param next a handler for each value emitted by the observable\n   * @param promiseCtor a constructor function used to instantiate the Promise\n   * @return a promise that either resolves on observable completion or\n   *  rejects with the handled error\n   * @deprecated remove in v8. Passing a Promise constructor will no longer be available\n   * in upcoming versions of RxJS. This is because it adds weight to the library, for very\n   * little benefit. If you need this functionality, it is recommended that you either\n   * polyfill Promise, or you create an adapter to convert the returned native promise\n   * to whatever promise implementation you wanted.\n   */\n  forEach(next: (value: T) => void, promiseCtor: PromiseConstructorLike): Promise<void>;\n\n  forEach(next: (value: T) => void, promiseCtor?: PromiseConstructorLike): Promise<void> {\n    promiseCtor = getPromiseCtor(promiseCtor);\n\n    return new promiseCtor<void>((resolve, reject) => {\n      // Must be declared in a separate statement to avoid a ReferenceError when\n      // accessing subscription below in the closure due to Temporal Dead Zone.\n      let subscription: Subscription;\n      subscription = this.subscribe(\n        (value) => {\n          try {\n            next(value);\n          } catch (err) {\n            reject(err);\n            subscription?.unsubscribe();\n          }\n        },\n        reject,\n        resolve\n      );\n    }) as Promise<void>;\n  }\n\n  /** @internal This is an internal implementation detail, do not use. */\n  protected _subscribe(subscriber: Subscriber<any>): TeardownLogic {\n    return this.source?.subscribe(subscriber);\n  }\n\n  /**\n   * An interop point defined by the es7-observable spec https://github.com/zenparsing/es-observable\n   * @method Symbol.observable\n   * @return {Observable} this instance of the observable\n   */\n  [Symbol_observable]() {\n    return this;\n  }\n\n  /* tslint:disable:max-line-length */\n  pipe(): Observable<T>;\n  pipe<A>(op1: OperatorFunction<T, A>): Observable<A>;\n  pipe<A, B>(op1: OperatorFunction<T, A>, op2: OperatorFunction<A, B>): Observable<B>;\n  pipe<A, B, C>(op1: OperatorFunction<T, A>, op2: OperatorFunction<A, B>, op3: OperatorFunction<B, C>): Observable<C>;\n  pipe<A, B, C, D>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>\n  ): Observable<D>;\n  pipe<A, B, C, D, E>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>\n  ): Observable<E>;\n  pipe<A, B, C, D, E, F>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>\n  ): Observable<F>;\n  pipe<A, B, C, D, E, F, G>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>\n  ): Observable<G>;\n  pipe<A, B, C, D, E, F, G, H>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>\n  ): Observable<H>;\n  pipe<A, B, C, D, E, F, G, H, I>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>,\n    op9: OperatorFunction<H, I>\n  ): Observable<I>;\n  pipe<A, B, C, D, E, F, G, H, I>(\n    op1: OperatorFunction<T, A>,\n    op2: OperatorFunction<A, B>,\n    op3: OperatorFunction<B, C>,\n    op4: OperatorFunction<C, D>,\n    op5: OperatorFunction<D, E>,\n    op6: OperatorFunction<E, F>,\n    op7: OperatorFunction<F, G>,\n    op8: OperatorFunction<G, H>,\n    op9: OperatorFunction<H, I>,\n    ...operations: OperatorFunction<any, any>[]\n  ): Observable<unknown>;\n  /* tslint:enable:max-line-length */\n\n  /**\n   * Used to stitch together functional operators into a chain.\n   * @method pipe\n   * @return {Observable} the Observable result of all of the operators having\n   * been called in the order they were passed in.\n   *\n   * ### Example\n   * ```ts\n   * import { interval } from 'rxjs';\n   * import { map, filter, scan } from 'rxjs/operators';\n   *\n   * interval(1000)\n   *   .pipe(\n   *     filter(x => x % 2 === 0),\n   *     map(x => x + x),\n   *     scan((acc, x) => acc + x)\n   *   )\n   *   .subscribe(x => console.log(x))\n   * ```\n   */\n  pipe(...operations: OperatorFunction<any, any>[]): Observable<any> {\n    return operations.length ? pipeFromArray(operations)(this) : this;\n  }\n\n  /* tslint:disable:max-line-length */\n  /** @deprecated Deprecated use {@link firstValueFrom} or {@link lastValueFrom} instead */\n  toPromise(): Promise<T | undefined>;\n  /** @deprecated Deprecated use {@link firstValueFrom} or {@link lastValueFrom} instead */\n  toPromise(PromiseCtor: typeof Promise): Promise<T | undefined>;\n  /** @deprecated Deprecated use {@link firstValueFrom} or {@link lastValueFrom} instead */\n  toPromise(PromiseCtor: PromiseConstructorLike): Promise<T | undefined>;\n  /* tslint:enable:max-line-length */\n\n  /**\n   * Subscribe to this Observable and get a Promise resolving on\n   * `complete` with the last emission (if any).\n   *\n   * **WARNING**: Only use this with observables you *know* will complete. If the source\n   * observable does not complete, you will end up with a promise that is hung up, and\n   * potentially all of the state of an async function hanging out in memory. To avoid\n   * this situation, look into adding something like {@link timeout}, {@link take},\n   * {@link takeWhile}, or {@link takeUntil} amongst others.\n   *\n   * @method toPromise\n   * @param [promiseCtor] a constructor function used to instantiate\n   * the Promise\n   * @return A Promise that resolves with the last value emit, or\n   * rejects on an error. If there were no emissions, Promise\n   * resolves with undefined.\n   * @deprecated Deprecated use {@link firstValueFrom} or {@link lastValueFrom} instead\n   */\n  toPromise(promiseCtor?: PromiseConstructorLike): Promise<T | undefined> {\n    promiseCtor = getPromiseCtor(promiseCtor);\n\n    return new promiseCtor((resolve, reject) => {\n      let value: T | undefined;\n      this.subscribe(\n        (x: T) => (value = x),\n        (err: any) => reject(err),\n        () => resolve(value)\n      );\n    }) as Promise<T | undefined>;\n  }\n}\n\n/**\n * Decides between a passed promise constructor from consuming code,\n * A default configured promise constructor, and the native promise\n * constructor and returns it. If nothing can be found, it will throw\n * an error.\n * @param promiseCtor The optional promise constructor to passed by consuming code\n */\nfunction getPromiseCtor(promiseCtor: PromiseConstructorLike | undefined) {\n  return promiseCtor ?? config.Promise ?? Promise;\n}\n\nfunction isObserver<T>(value: any): value is Observer<T> {\n  return value && isFunction(value.next) && isFunction(value.error) && isFunction(value.complete);\n}\n\nfunction isSubscriber<T>(value: any): value is Subscriber<T> {\n  return (value && value instanceof Subscriber) || (isObserver(value) && isSubscription(value));\n}\n","/** @prettier */\nimport { createErrorClass } from './createErrorClass';\n\nexport interface ObjectUnsubscribedError extends Error {}\n\nexport interface ObjectUnsubscribedErrorCtor {\n  new (): ObjectUnsubscribedError;\n}\n\n/**\n * An error thrown when an action is invalid because the object has been\n * unsubscribed.\n *\n * @see {@link Subject}\n * @see {@link BehaviorSubject}\n *\n * @class ObjectUnsubscribedError\n */\nexport const ObjectUnsubscribedError: ObjectUnsubscribedErrorCtor = createErrorClass(\n  (_super) =>\n    function ObjectUnsubscribedErrorImpl(this: any) {\n      _super(this);\n      this.name = 'ObjectUnsubscribedError';\n      this.message = 'object unsubscribed';\n    }\n);\n","/** @prettier */\nimport { Operator } from './Operator';\nimport { Observable } from './Observable';\nimport { Subscriber } from './Subscriber';\nimport { Subscription, EMPTY_SUBSCRIPTION } from './Subscription';\nimport { Observer, SubscriptionLike, TeardownLogic } from './types';\nimport { ObjectUnsubscribedError } from './util/ObjectUnsubscribedError';\nimport { arrRemove } from './util/arrRemove';\n\n/**\n * A Subject is a special type of Observable that allows values to be\n * multicasted to many Observers. Subjects are like EventEmitters.\n *\n * Every Subject is an Observable and an Observer. You can subscribe to a\n * Subject, and you can call next to feed values as well as error and complete.\n */\nexport class Subject<T> extends Observable<T> implements SubscriptionLike {\n  observers: Observer<T>[] = [];\n\n  closed = false;\n\n  isStopped = false;\n\n  hasError = false;\n\n  thrownError: any = null;\n\n  /**\n   * Creates a \"subject\" by basically gluing an observer to an observable.\n   *\n   * @nocollapse\n   * @deprecated Recommended you do not use, will be removed at some point in the future. Plans for replacement still under discussion.\n   */\n  static create: (...args: any[]) => any = <T>(destination: Observer<T>, source: Observable<T>): AnonymousSubject<T> => {\n    return new AnonymousSubject<T>(destination, source);\n  };\n\n  constructor() {\n    // NOTE: This must be here to obscure Observable's constructor.\n    super();\n  }\n\n  lift<R>(operator: Operator<T, R>): Observable<R> {\n    const subject = new AnonymousSubject(this, this);\n    subject.operator = operator as any;\n    return subject as any;\n  }\n\n  protected _throwIfClosed() {\n    if (this.closed) {\n      throw new ObjectUnsubscribedError();\n    }\n  }\n\n  next(value: T) {\n    this._throwIfClosed();\n    if (!this.isStopped) {\n      const copy = this.observers.slice();\n      for (const observer of copy) {\n        observer.next(value);\n      }\n    }\n  }\n\n  error(err: any) {\n    this._throwIfClosed();\n    if (!this.isStopped) {\n      this.hasError = this.isStopped = true;\n      this.thrownError = err;\n      const { observers } = this;\n      while (observers.length) {\n        observers.shift()!.error(err);\n      }\n    }\n  }\n\n  complete() {\n    this._throwIfClosed();\n    if (!this.isStopped) {\n      this.isStopped = true;\n      const { observers } = this;\n      while (observers.length) {\n        observers.shift()!.complete();\n      }\n    }\n  }\n\n  unsubscribe() {\n    this.isStopped = this.closed = true;\n    this.observers = null!;\n  }\n\n  /** @deprecated This is an internal implementation detail, do not use. */\n  protected _trySubscribe(subscriber: Subscriber<T>): TeardownLogic {\n    this._throwIfClosed();\n    return super._trySubscribe(subscriber);\n  }\n\n  /** @deprecated This is an internal implementation detail, do not use. */\n  protected _subscribe(subscriber: Subscriber<T>): Subscription {\n    this._throwIfClosed();\n    this._checkFinalizedStatuses(subscriber);\n    return this._innerSubscribe(subscriber);\n  }\n\n  protected _innerSubscribe(subscriber: Subscriber<any>) {\n    const { hasError, isStopped, observers } = this;\n    return hasError || isStopped\n      ? EMPTY_SUBSCRIPTION\n      : (observers.push(subscriber), new Subscription(() => arrRemove(this.observers, subscriber)));\n  }\n\n  protected _checkFinalizedStatuses(subscriber: Subscriber<any>) {\n    const { hasError, thrownError, isStopped } = this;\n    if (hasError) {\n      subscriber.error(thrownError);\n    } else if (isStopped) {\n      subscriber.complete();\n    }\n  }\n  /**\n   * Creates a new Observable with this Subject as the source. You can do this\n   * to create customize Observer-side logic of the Subject and conceal it from\n   * code that uses the Observable.\n   * @return {Observable} Observable that the Subject casts to\n   */\n  asObservable(): Observable<T> {\n    const observable: any = new Observable<T>();\n    observable.source = this;\n    return observable;\n  }\n}\n\n/**\n * @class AnonymousSubject<T>\n */\nexport class AnonymousSubject<T> extends Subject<T> {\n  constructor(protected destination?: Observer<T>, source?: Observable<T>) {\n    super();\n    this.source = source;\n  }\n\n  next(value: T) {\n    this.destination?.next?.(value);\n  }\n\n  error(err: any) {\n    this.destination?.error?.(err);\n  }\n\n  complete() {\n    this.destination?.complete?.();\n  }\n\n  /** @deprecated This is an internal implementation detail, do not use. */\n  _subscribe(subscriber: Subscriber<T>): Subscription {\n    return this.source?.subscribe(subscriber) ?? EMPTY_SUBSCRIPTION;\n  }\n}\n","/** @prettier */\nimport { Observable } from '../Observable';\nimport { Subscriber } from '../Subscriber';\nimport { OperatorFunction } from '../types';\nimport { isFunction } from './isFunction';\n\n/**\n * Used to determine if an object is an Observable with a lift function.\n */\nexport function hasLift(source: any): source is { lift: InstanceType<typeof Observable>['lift'] } {\n  return isFunction(source?.lift);\n}\n\n/**\n * Creates an `OperatorFunction`. Used to define operators throughout the library in a concise way.\n * @param init The logic to connect the liftedSource to the subscriber at the moment of subscription.\n */\nexport function operate<T, R>(\n  init: (liftedSource: Observable<T>, subscriber: Subscriber<R>) => (() => void) | void\n): OperatorFunction<T, R> {\n  return (source: Observable<T>) => {\n    if (hasLift(source)) {\n      return source.lift(function (this: Subscriber<R>, liftedSource: Observable<T>) {\n        try {\n          return init(liftedSource, this);\n        } catch (err) {\n          this.error(err);\n        }\n      });\n    }\n    throw new TypeError('Unable to lift unknown Observable type');\n  };\n}\n","/** @prettier */\nimport { Subscriber } from '../Subscriber';\n\n/**\n * A generic helper for allowing operators to be created with a Subscriber and\n * use closures to capture neceessary state from the operator function itself.\n */\nexport class OperatorSubscriber<T> extends Subscriber<T> {\n  /**\n   * Creates an instance of an `OperatorSubscriber`.\n   * @param destination The downstream subscriber.\n   * @param onNext Handles next values, only called if this subscriber is not stopped or closed. Any\n   * error that occurs in this function is caught and sent to the `error` method of this subscriber.\n   * @param onError Handles errors from the subscription, any errors that occur in this handler are caught\n   * and send to the `destination` error handler.\n   * @param onComplete Handles completion notification from the subscription. Any errors that occur in\n   * this handler are sent to the `destination` error handler.\n   * @param onUnsubscribe Additional teardown logic here. This will only be called on teardown if the\n   * subscriber itself is not already closed. Called before any additional teardown logic is called.\n   */\n  constructor(\n    destination: Subscriber<any>,\n    onNext?: (value: T) => void,\n    onError?: (err: any) => void,\n    onComplete?: () => void,\n    private onUnsubscribe?: () => void\n  ) {\n    super(destination);\n    if (onNext) {\n      this._next = function (value: T) {\n        try {\n          onNext(value);\n        } catch (err) {\n          this.destination.error(err);\n        }\n      };\n    }\n    if (onError) {\n      this._error = function (err) {\n        try {\n          onError(err);\n        } catch (err) {\n          // Send any errors that occur down stream.\n          this.destination.error(err);\n        }\n        // Ensure teardown.\n        this.unsubscribe();\n      };\n    }\n    if (onComplete) {\n      this._complete = function () {\n        try {\n          onComplete();\n        } catch (err) {\n          // Send any errors that occur down stream.\n          this.destination.error(err);\n        }\n        // Ensure teardown.\n        this.unsubscribe();\n      };\n    }\n  }\n\n  unsubscribe() {\n    // Execute additional teardown if we have any and we didn't already do so.\n    !this.closed && this.onUnsubscribe?.();\n    super.unsubscribe();\n  }\n}\n","/** @prettier */\nimport { OperatorFunction } from '../types';\nimport { operate } from '../util/lift';\nimport { OperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * Applies a given `project` function to each value emitted by the source\n * Observable, and emits the resulting values as an Observable.\n *\n * <span class=\"informal\">Like [Array.prototype.map()](https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Array/map),\n * it passes each source value through a transformation function to get\n * corresponding output values.</span>\n *\n * ![](map.png)\n *\n * Similar to the well known `Array.prototype.map` function, this operator\n * applies a projection to each value and emits that projection in the output\n * Observable.\n *\n * ## Example\n * Map every click to the clientX position of that click\n * ```ts\n * import { fromEvent } from 'rxjs';\n * import { map } from 'rxjs/operators';\n *\n * const clicks = fromEvent(document, 'click');\n * const positions = clicks.pipe(map(ev => ev.clientX));\n * positions.subscribe(x => console.log(x));\n * ```\n *\n * @see {@link mapTo}\n * @see {@link pluck}\n *\n * @param {function(value: T, index: number): R} project The function to apply\n * to each `value` emitted by the source Observable. The `index` parameter is\n * the number `i` for the i-th emission that has happened since the\n * subscription, starting from the number `0`.\n * @param {any} [thisArg] An optional argument to define what `this` is in the\n * `project` function.\n * @return {Observable<R>} An Observable that emits the values from the source\n * Observable transformed by the given `project` function.\n */\nexport function map<T, R>(project: (value: T, index: number) => R, thisArg?: any): OperatorFunction<T, R> {\n  return operate((source, subscriber) => {\n    // The index of the value from the source. Used with projection.\n    let index = 0;\n    // Subscribe to the source, all errors and completions are sent along\n    // to the consumer.\n    source.subscribe(\n      new OperatorSubscriber(subscriber, (value: T) => {\n        // Call the projection function with the appropriate this context,\n        // and send the resulting value to the consumer.\n        subscriber.next(project.call(thisArg, value, index++));\n      })\n    );\n  });\n}\n","export const isArrayLike = (<T>(x: any): x is ArrayLike<T> => x && typeof x.length === 'number' && typeof x !== 'function');","import { isFunction } from \"./isFunction\";\n\n/**\n * Tests to see if the object is \"thennable\".\n * @param value the object to test\n */\nexport function isPromise(value: any): value is PromiseLike<any> {\n  return isFunction(value?.then);\n}\n","export function getSymbolIterator(): symbol {\n  if (typeof Symbol !== 'function' || !Symbol.iterator) {\n    return '@@iterator' as any;\n  }\n\n  return Symbol.iterator;\n}\n\nexport const iterator = getSymbolIterator();\n\n/**\n * @deprecated use {@link iterator} instead\n */\nexport const $$iterator = iterator;\n","/** @prettier */\nimport { Observable } from '../Observable';\nimport { SchedulerLike } from '../types';\n\nexport function scheduleArray<T>(input: ArrayLike<T>, scheduler: SchedulerLike) {\n  return new Observable<T>((subscriber) => {\n    // The current array index.\n    let i = 0;\n    // Start iterating over the array like on a schedule.\n    return scheduler.schedule(function () {\n      if (i === input.length) {\n        // If we have hit the end of the array like in the\n        // previous job, we can complete.\n        subscriber.complete();\n      } else {\n        // Otherwise let's next the value at the current index,\n        // then increment our index.\n        subscriber.next(input[i++]);\n        // If the last emission didn't cause us to close the subscriber\n        // (via take or some side effect), reschedule the job and we'll\n        // make another pass.\n        if (!subscriber.closed) {\n          this.schedule();\n        }\n      }\n    });\n  });\n}\n","import { InteropObservable } from '../types';\nimport { observable as Symbol_observable } from '../symbol/observable';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being Observable (but not necessary an Rx Observable) */\nexport function isInteropObservable(input: any): input is InteropObservable<any> {\n  return isFunction(input[Symbol_observable]);\n}\n","import { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { isFunction } from './isFunction';\n\n/** Identifies an input as being an Iterable */\nexport function isIterable(input: any): input is Iterable<any> {\n  return isFunction(input?.[Symbol_iterator]);\n}\n","/** @prettier */\nimport { isFunction } from './isFunction';\n\nexport function isAsyncIterable<T>(obj: any): obj is AsyncIterable<T> {\n  return Symbol.asyncIterator && isFunction(obj?.[Symbol.asyncIterator]);\n}\n","/** @prettier */\n\n/**\n * Creates the TypeError to throw if an invalid object is passed to `from` or `scheduled`.\n * @param input The object that was passed.\n */\nexport function createInvalidObservableTypeError(input: any) {\n  // TODO: We should create error codes that can be looked up, so this can be less verbose.\n  return new TypeError(\n    `You provided ${\n      input !== null && typeof input === 'object' ? 'an invalid object' : `'${input}'`\n    } where a stream was expected. You can provide an Observable, Promise, Array, AsyncIterable, or Iterable.`\n  );\n}\n","/** @prettier */\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isPromise } from '../util/isPromise';\nimport { iterator as Symbol_iterator } from '../symbol/iterator';\nimport { observable as Symbol_observable } from '../symbol/observable';\nimport { Subscriber } from '../Subscriber';\n\nimport { Observable } from '../Observable';\nimport { ObservableInput, SchedulerLike, ObservedValueOf } from '../types';\nimport { scheduled } from '../scheduled/scheduled';\nimport { isFunction } from '../util/isFunction';\nimport { reportUnhandledError } from '../util/reportUnhandledError';\nimport { isInteropObservable } from '../util/isInteropObservable';\nimport { isAsyncIterable } from '../util/isAsyncIterable';\nimport { createInvalidObservableTypeError } from '../util/throwUnobservableError';\nimport { isIterable } from '../util/isIterable';\n\nexport function from<O extends ObservableInput<any>>(input: O): Observable<ObservedValueOf<O>>;\n/** @deprecated The scheduler argument is deprecated, use scheduled. Details: https://rxjs.dev/deprecations/scheduler-argument */\nexport function from<O extends ObservableInput<any>>(input: O, scheduler: SchedulerLike): Observable<ObservedValueOf<O>>;\n\n/**\n * Creates an Observable from an Array, an array-like object, a Promise, an iterable object, or an Observable-like object.\n *\n * <span class=\"informal\">Converts almost anything to an Observable.</span>\n *\n * ![](from.png)\n *\n * `from` converts various other objects and data types into Observables. It also converts a Promise, an array-like, or an\n * <a href=\"https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Iteration_protocols#iterable\" target=\"_blank\">iterable</a>\n * object into an Observable that emits the items in that promise, array, or iterable. A String, in this context, is treated\n * as an array of characters. Observable-like objects (contains a function named with the ES2015 Symbol for Observable) can also be\n * converted through this operator.\n *\n * ## Examples\n *\n * ### Converts an array to an Observable\n *\n * ```ts\n * import { from } from 'rxjs';\n *\n * const array = [10, 20, 30];\n * const result = from(array);\n *\n * result.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 10\n * // 20\n * // 30\n * ```\n *\n * ---\n *\n * ### Convert an infinite iterable (from a generator) to an Observable\n *\n * ```ts\n * import { from } from 'rxjs';\n * import { take } from 'rxjs/operators';\n *\n * function* generateDoubles(seed) {\n *    let i = seed;\n *    while (true) {\n *      yield i;\n *      i = 2 * i; // double it\n *    }\n * }\n *\n * const iterator = generateDoubles(3);\n * const result = from(iterator).pipe(take(10));\n *\n * result.subscribe(x => console.log(x));\n *\n * // Logs:\n * // 3\n * // 6\n * // 12\n * // 24\n * // 48\n * // 96\n * // 192\n * // 384\n * // 768\n * // 1536\n * ```\n *\n * ---\n *\n * ### With async scheduler\n *\n * ```ts\n * import { from, asyncScheduler } from 'rxjs';\n *\n * console.log('start');\n *\n * const array = [10, 20, 30];\n * const result = from(array, asyncScheduler);\n *\n * result.subscribe(x => console.log(x));\n *\n * console.log('end');\n *\n * // Logs:\n * // start\n * // end\n * // 10\n * // 20\n * // 30\n * ```\n *\n * @see {@link fromEvent}\n * @see {@link fromEventPattern}\n *\n * @param {ObservableInput<T>} A subscription object, a Promise, an Observable-like,\n * an Array, an iterable, or an array-like object to be converted.\n * @param {SchedulerLike} An optional {@link SchedulerLike} on which to schedule the emission of values.\n * @return {Observable<T>}\n */\nexport function from<T>(input: ObservableInput<T>, scheduler?: SchedulerLike): Observable<T> {\n  return scheduler ? scheduled(input, scheduler) : innerFrom(input);\n}\n\n// TODO: Use this throughout the library, rather than the `from` above, to avoid\n// the unnecessary scheduling check and reduce bundled sizes of operators that use `from`.\n// TODO: Eventually, this just becomes `from`, as we don't have the deprecated scheduled path anymore.\nexport function innerFrom<T>(input: ObservableInput<T>): Observable<T> {\n  if (input instanceof Observable) {\n    return input;\n  }\n  if (input != null) {\n    if (isInteropObservable(input)) {\n      return fromInteropObservable(input);\n    }\n    if (isArrayLike(input)) {\n      return fromArrayLike(input);\n    }\n    if (isPromise(input)) {\n      return fromPromise(input);\n    }\n    if (isAsyncIterable(input)) {\n      return fromAsyncIterable(input);\n    }\n    if (isIterable(input)) {\n      return fromIterable(input);\n    }\n  }\n\n  throw createInvalidObservableTypeError(input);\n}\n\n/**\n * Creates an RxJS Observable from an object that implements `Symbol.observable`.\n * @param obj An object that properly implements `Symbol.observable`.\n */\nfunction fromInteropObservable<T>(obj: any) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    const obs = obj[Symbol_observable]();\n    if (isFunction(obs.subscribe)) {\n      return obs.subscribe(subscriber);\n    }\n    // Should be caught by observable subscribe function error handling.\n    throw new TypeError('Provided object does not correctly implement Symbol.observable');\n  });\n}\n\n/**\n * Synchronously emits the values of an array like and completes.\n * This is exported because there are creation functions and operators that need to\n * make direct use of the same logic, and there's no reason to make them run through\n * `from` conditionals because we *know* they're dealing with an array.\n * @param array The array to emit values from\n */\nexport function fromArrayLike<T>(array: ArrayLike<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    // Loop over the array and emit each value. Note two things here:\n    // 1. We're making sure that the subscriber is not closed on each loop.\n    //    This is so we don't continue looping over a very large array after\n    //    something like a `take`, `takeWhile`, or other synchronous unsubscription\n    //    has already unsubscribed.\n    // 2. In this form, reentrant code can alter that array we're looping over.\n    //    This is a known issue, but considered an edge case. The alternative would\n    //    be to copy the array before executing the loop, but this has\n    //    performance implications.\n    for (let i = 0; i < array.length && !subscriber.closed; i++) {\n      subscriber.next(array[i]);\n    }\n    subscriber.complete();\n  });\n}\n\nfunction fromPromise<T>(promise: PromiseLike<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    promise\n      .then(\n        (value) => {\n          if (!subscriber.closed) {\n            subscriber.next(value);\n            subscriber.complete();\n          }\n        },\n        (err: any) => subscriber.error(err)\n      )\n      .then(null, reportUnhandledError);\n  });\n}\n\nfunction fromIterable<T>(iterable: Iterable<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    const iterator = (iterable as any)[Symbol_iterator]();\n\n    while (!subscriber.closed) {\n      // Note that any error thrown in the iterator here\n      // will be caught by the subscribe call in `Observable`,\n      // and sent to the consumer via `subscriber.error`.\n      const { done, value } = iterator.next();\n      if (done) {\n        // If we're done, just complete. This will set\n        // subscriber.closed to `true` and kill the loop.\n        // We don't next values from an \"done\" iterator result.\n        // This is to mirror the behavior of JavaScripts `for..of`.\n        subscriber.complete();\n      } else {\n        subscriber.next(value);\n      }\n    }\n\n    // Finalize the iterator if it happens to be a Generator\n    return () => isFunction(iterator?.return) && iterator.return();\n  });\n}\n\nfunction fromAsyncIterable<T>(asyncIterable: AsyncIterable<T>) {\n  return new Observable((subscriber: Subscriber<T>) => {\n    process(asyncIterable, subscriber).catch((err) => subscriber.error(err));\n  });\n}\n\nasync function process<T>(asyncIterable: AsyncIterable<T>, subscriber: Subscriber<T>) {\n  for await (const value of asyncIterable) {\n    subscriber.next(value);\n  }\n  subscriber.complete();\n}\n","/** @prettier */\nimport { ObservableInput, OperatorFunction, ObservedValueOf } from '../types';\nimport { map } from './map';\nimport { innerFrom } from '../observable/from';\nimport { operate } from '../util/lift';\nimport { mergeInternals } from './mergeInternals';\nimport { isFunction } from '../util/isFunction';\n\n/* tslint:disable:max-line-length */\nexport function mergeMap<T, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  concurrent?: number\n): OperatorFunction<T, ObservedValueOf<O>>;\n/** @deprecated resultSelector no longer supported, use inner map instead */\nexport function mergeMap<T, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector: undefined,\n  concurrent?: number\n): OperatorFunction<T, ObservedValueOf<O>>;\n/** @deprecated resultSelector no longer supported, use inner map instead */\nexport function mergeMap<T, R, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector: (outerValue: T, innerValue: ObservedValueOf<O>, outerIndex: number, innerIndex: number) => R,\n  concurrent?: number\n): OperatorFunction<T, R>;\n/* tslint:enable:max-line-length */\n\n/**\n * Projects each source value to an Observable which is merged in the output\n * Observable.\n *\n * <span class=\"informal\">Maps each value to an Observable, then flattens all of\n * these inner Observables using {@link mergeAll}.</span>\n *\n * ![](mergeMap.png)\n *\n * Returns an Observable that emits items based on applying a function that you\n * supply to each item emitted by the source Observable, where that function\n * returns an Observable, and then merging those resulting Observables and\n * emitting the results of this merger.\n *\n * ## Example\n * Map and flatten each letter to an Observable ticking every 1 second\n * ```ts\n * import { of, interval } from 'rxjs';\n * import { mergeMap, map } from 'rxjs/operators';\n *\n * const letters = of('a', 'b', 'c');\n * const result = letters.pipe(\n *   mergeMap(x => interval(1000).pipe(map(i => x+i))),\n * );\n * result.subscribe(x => console.log(x));\n *\n * // Results in the following:\n * // a0\n * // b0\n * // c0\n * // a1\n * // b1\n * // c1\n * // continues to list a,b,c with respective ascending integers\n * ```\n *\n * @see {@link concatMap}\n * @see {@link exhaustMap}\n * @see {@link merge}\n * @see {@link mergeAll}\n * @see {@link mergeMapTo}\n * @see {@link mergeScan}\n * @see {@link switchMap}\n *\n * @param {function(value: T, ?index: number): ObservableInput} project A function\n * that, when applied to an item emitted by the source Observable, returns an\n * Observable.\n * @param {number} [concurrent=Infinity] Maximum number of input\n * Observables being subscribed to concurrently.\n * @return {Observable} An Observable that emits the result of applying the\n * projection function (and the optional deprecated `resultSelector`) to each item\n * emitted by the source Observable and merging the results of the Observables\n * obtained from this transformation.\n */\nexport function mergeMap<T, R, O extends ObservableInput<any>>(\n  project: (value: T, index: number) => O,\n  resultSelector?: ((outerValue: T, innerValue: ObservedValueOf<O>, outerIndex: number, innerIndex: number) => R) | number,\n  concurrent: number = Infinity\n): OperatorFunction<T, ObservedValueOf<O> | R> {\n  if (isFunction(resultSelector)) {\n    // DEPRECATED PATH\n    return mergeMap((a, i) => map((b: any, ii: number) => resultSelector(a, b, i, ii))(innerFrom(project(a, i))), concurrent);\n  } else if (typeof resultSelector === 'number') {\n    concurrent = resultSelector;\n  }\n\n  return operate((source, subscriber) => mergeInternals(source, subscriber, project, concurrent));\n}\n\n/**\n * @deprecated renamed. Use {@link mergeMap}.\n */\nexport const flatMap = mergeMap;\n","/** @prettier */\nimport { Observable } from '../Observable';\nimport { innerFrom } from '../observable/from';\nimport { Subscriber } from '../Subscriber';\nimport { ObservableInput, SchedulerLike } from '../types';\nimport { OperatorSubscriber } from './OperatorSubscriber';\n\n/**\n * A process embodying the general \"merge\" strategy. This is used in\n * `mergeMap` and `mergeScan` because the logic is otherwise nearly identical.\n * @param source The original source observable\n * @param subscriber The consumer subscriber\n * @param project The projection function to get our inner sources\n * @param concurrent The number of concurrent inner subscriptions\n * @param onBeforeNext Additional logic to apply before nexting to our consumer\n * @param expand If `true` this will perform an \"expand\" strategy, which differs only\n * in that it recurses, and the inner subscription must be schedule-able.\n * @param innerSubScheduler A scheduler to use to schedule inner subscriptions,\n * this is to support the expand strategy, mostly, and should be deprecated\n */\nexport function mergeInternals<T, R>(\n  source: Observable<T>,\n  subscriber: Subscriber<R>,\n  project: (value: T, index: number) => ObservableInput<R>,\n  concurrent: number,\n  onBeforeNext?: (innerValue: R) => void,\n  expand?: boolean,\n  innerSubScheduler?: SchedulerLike,\n  additionalTeardown?: () => void\n) {\n  // Buffered values, in the event of going over our concurrency limit\n  let buffer: T[] = [];\n  // The number of active inner subscriptions.\n  let active = 0;\n  // An index to pass to our accumulator function\n  let index = 0;\n  // Whether or not the outer source has completed.\n  let isComplete = false;\n\n  /**\n   * Checks to see if we can complete our result or not.\n   */\n  const checkComplete = () => {\n    // If the outer has completed, and nothing is left in the buffer,\n    // and we don't have any active inner subscriptions, then we can\n    // Emit the state and complete.\n    if (isComplete && !buffer.length && !active) {\n      subscriber.complete();\n    }\n  };\n\n  // If we're under our concurrency limit, just start the inner subscription, otherwise buffer and wait.\n  const outerNext = (value: T) => (active < concurrent ? doInnerSub(value) : buffer.push(value));\n\n  const doInnerSub = (value: T) => {\n    // If we're expanding, we need to emit the outer values and the inner values\n    // as the inners will \"become outers\" in a way as they are recursively fed\n    // back to the projection mechanism.\n    expand && subscriber.next(value as any);\n\n    // Increment the number of active subscriptions so we can track it\n    // against our concurrency limit later.\n    active++;\n\n    // Start our inner subscription.\n    innerFrom(project(value, index++)).subscribe(\n      new OperatorSubscriber(\n        subscriber,\n        (innerValue) => {\n          // `mergeScan` has additional handling here. For example\n          // taking the inner value and updating state.\n          onBeforeNext?.(innerValue);\n\n          if (expand) {\n            // If we're expanding, then just recurse back to our outer\n            // handler. It will emit the value first thing.\n            outerNext(innerValue as any);\n          } else {\n            // Otherwise, emit the inner value.\n            subscriber.next(innerValue);\n          }\n        },\n        // Errors are passed to the destination.\n        undefined,\n        () => {\n          // INNER SOURCE COMPLETE\n          // Decrement the active count to ensure that the next time\n          // we try to call `doInnerSub`, the number is accurate.\n          active--;\n          // If we have more values in the buffer, try to process those\n          // Note that this call will increment `active` ahead of the\n          // next conditional, if there were any more inner subscriptions\n          // to start.\n          while (buffer.length && active < concurrent) {\n            const bufferedValue = buffer.shift()!;\n            // Particularly for `expand`, we need to check to see if a scheduler was provided\n            // for when we want to start our inner subscription. Otherwise, we just start\n            // are next inner subscription.\n            innerSubScheduler ? subscriber.add(innerSubScheduler.schedule(() => doInnerSub(bufferedValue))) : doInnerSub(bufferedValue);\n          }\n          // Check to see if we can complete, and complete if so.\n          checkComplete();\n        }\n      )\n    );\n  };\n\n  // Subscribe to our source observable.\n  source.subscribe(\n    new OperatorSubscriber(\n      subscriber,\n      outerNext,\n      // Errors are passed through\n      undefined,\n      () => {\n        // Outer completed, make a note of it, and check to see if we can complete everything.\n        isComplete = true;\n        checkComplete();\n      }\n    )\n  );\n\n  // Additional teardown (for when the destination is torn down).\n  // Other teardown is added implicitly via subscription above.\n  return () => {\n    // Ensure buffered values are released.\n    buffer = null!;\n    additionalTeardown?.();\n  };\n}\n","import { OperatorFunction } from \"../types\";\nimport { map } from \"../operators/map\";\n\nconst { isArray } = Array;\n\nfunction callOrApply<T, R>(fn: ((...values: T[]) => R), args: T|T[]): R {\n    return isArray(args) ? fn(...args) : fn(args);\n}\n\n/**\n * Used in several -- mostly deprecated -- situations where we need to \n * apply a list of arguments or a single argument to a result selector.\n */\nexport function mapOneOrManyArgs<T, R>(fn: ((...values: T[]) => R)): OperatorFunction<T|T[], R> {\n    return map(args => callOrApply(fn, args))\n}","/** @prettier */\nimport { Observable } from '../Observable';\nimport { mergeMap } from '../operators/mergeMap';\nimport { isArrayLike } from '../util/isArrayLike';\nimport { isFunction } from '../util/isFunction';\nimport { mapOneOrManyArgs } from '../util/mapOneOrManyArgs';\nimport { internalFromArray } from './fromArray';\n\n// These constants are used to create handler registry functions using array mapping below.\nconst nodeEventEmitterMethods = ['addListener', 'removeListener'] as const;\nconst eventTargetMethods = ['addEventListener', 'removeEventListener'] as const;\nconst jqueryMethods = ['on', 'off'] as const;\n\nexport interface NodeStyleEventEmitter {\n  addListener: (eventName: string | symbol, handler: NodeEventHandler) => this;\n  removeListener: (eventName: string | symbol, handler: NodeEventHandler) => this;\n}\n\nexport type NodeEventHandler = (...args: any[]) => void;\n\n// For APIs that implement `addListener` and `removeListener` methods that may\n// not use the same arguments or return EventEmitter values\n// such as React Native\nexport interface NodeCompatibleEventEmitter {\n  addListener: (eventName: string, handler: NodeEventHandler) => void | {};\n  removeListener: (eventName: string, handler: NodeEventHandler) => void | {};\n}\n\n// Use handler types like those in @types/jquery. See:\n// https://github.com/DefinitelyTyped/DefinitelyTyped/blob/847731ba1d7fa6db6b911c0e43aa0afe596e7723/types/jquery/misc.d.ts#L6395\nexport interface JQueryStyleEventEmitter<TContext, T> {\n  on: (eventName: string, handler: (this: TContext, t: T, ...args: any[]) => any) => void;\n  off: (eventName: string, handler: (this: TContext, t: T, ...args: any[]) => any) => void;\n}\n\nexport interface HasEventTargetAddRemove<E> {\n  addEventListener(type: string, listener: ((evt: E) => void) | null, options?: boolean | AddEventListenerOptions): void;\n  removeEventListener(type: string, listener?: ((evt: E) => void) | null, options?: EventListenerOptions | boolean): void;\n}\n\nexport type EventTargetLike<T> =\n  | HasEventTargetAddRemove<T>\n  | NodeStyleEventEmitter\n  | NodeCompatibleEventEmitter\n  | JQueryStyleEventEmitter<any, T>;\n\nexport type FromEventTarget<T> = EventTargetLike<T> | ArrayLike<EventTargetLike<T>>;\n\nexport interface EventListenerOptions {\n  capture?: boolean;\n  passive?: boolean;\n  once?: boolean;\n}\n\nexport interface AddEventListenerOptions extends EventListenerOptions {\n  once?: boolean;\n  passive?: boolean;\n}\n\nexport function fromEvent<T>(target: FromEventTarget<T>, eventName: string): Observable<T>;\n/** @deprecated resultSelector no longer supported, pipe to map instead */\nexport function fromEvent<T>(target: FromEventTarget<T>, eventName: string, resultSelector?: (...args: any[]) => T): Observable<T>;\nexport function fromEvent<T>(target: FromEventTarget<T>, eventName: string, options?: EventListenerOptions): Observable<T>;\n/** @deprecated resultSelector no longer supported, pipe to map instead */\nexport function fromEvent<T>(\n  target: FromEventTarget<T>,\n  eventName: string,\n  options: EventListenerOptions,\n  resultSelector: (...args: any[]) => T\n): Observable<T>;\n\n/**\n * Creates an Observable that emits events of a specific type coming from the\n * given event target.\n *\n * <span class=\"informal\">Creates an Observable from DOM events, or Node.js\n * EventEmitter events or others.</span>\n *\n * ![](fromEvent.png)\n *\n * `fromEvent` accepts as a first argument event target, which is an object with methods\n * for registering event handler functions. As a second argument it takes string that indicates\n * type of event we want to listen for. `fromEvent` supports selected types of event targets,\n * which are described in detail below. If your event target does not match any of the ones listed,\n * you should use {@link fromEventPattern}, which can be used on arbitrary APIs.\n * When it comes to APIs supported by `fromEvent`, their methods for adding and removing event\n * handler functions have different names, but they all accept a string describing event type\n * and function itself, which will be called whenever said event happens.\n *\n * Every time resulting Observable is subscribed, event handler function will be registered\n * to event target on given event type. When that event fires, value\n * passed as a first argument to registered function will be emitted by output Observable.\n * When Observable is unsubscribed, function will be unregistered from event target.\n *\n * Note that if event target calls registered function with more than one argument, second\n * and following arguments will not appear in resulting stream. In order to get access to them,\n * you can pass to `fromEvent` optional project function, which will be called with all arguments\n * passed to event handler. Output Observable will then emit value returned by project function,\n * instead of the usual value.\n *\n * Remember that event targets listed below are checked via duck typing. It means that\n * no matter what kind of object you have and no matter what environment you work in,\n * you can safely use `fromEvent` on that object if it exposes described methods (provided\n * of course they behave as was described above). So for example if Node.js library exposes\n * event target which has the same method names as DOM EventTarget, `fromEvent` is still\n * a good choice.\n *\n * If the API you use is more callback then event handler oriented (subscribed\n * callback function fires only once and thus there is no need to manually\n * unregister it), you should use {@link bindCallback} or {@link bindNodeCallback}\n * instead.\n *\n * `fromEvent` supports following types of event targets:\n *\n * **DOM EventTarget**\n *\n * This is an object with `addEventListener` and `removeEventListener` methods.\n *\n * In the browser, `addEventListener` accepts - apart from event type string and event\n * handler function arguments - optional third parameter, which is either an object or boolean,\n * both used for additional configuration how and when passed function will be called. When\n * `fromEvent` is used with event target of that type, you can provide this values\n * as third parameter as well.\n *\n * **Node.js EventEmitter**\n *\n * An object with `addListener` and `removeListener` methods.\n *\n * **JQuery-style event target**\n *\n * An object with `on` and `off` methods\n *\n * **DOM NodeList**\n *\n * List of DOM Nodes, returned for example by `document.querySelectorAll` or `Node.childNodes`.\n *\n * Although this collection is not event target in itself, `fromEvent` will iterate over all Nodes\n * it contains and install event handler function in every of them. When returned Observable\n * is unsubscribed, function will be removed from all Nodes.\n *\n * **DOM HtmlCollection**\n *\n * Just as in case of NodeList it is a collection of DOM nodes. Here as well event handler function is\n * installed and removed in each of elements.\n *\n *\n * ## Examples\n * ### Emits clicks happening on the DOM document\n * ```ts\n * import { fromEvent } from 'rxjs';\n *\n * const clicks = fromEvent(document, 'click');\n * clicks.subscribe(x => console.log(x));\n *\n * // Results in:\n * // MouseEvent object logged to console every time a click\n * // occurs on the document.\n * ```\n *\n * ### Use addEventListener with capture option\n * ```ts\n * import { fromEvent } from 'rxjs';\n *\n * const clicksInDocument = fromEvent(document, 'click', true); // note optional configuration parameter\n *                                                              // which will be passed to addEventListener\n * const clicksInDiv = fromEvent(someDivInDocument, 'click');\n *\n * clicksInDocument.subscribe(() => console.log('document'));\n * clicksInDiv.subscribe(() => console.log('div'));\n *\n * // By default events bubble UP in DOM tree, so normally\n * // when we would click on div in document\n * // \"div\" would be logged first and then \"document\".\n * // Since we specified optional `capture` option, document\n * // will catch event when it goes DOWN DOM tree, so console\n * // will log \"document\" and then \"div\".\n * ```\n *\n * @see {@link bindCallback}\n * @see {@link bindNodeCallback}\n * @see {@link fromEventPattern}\n *\n * @param {FromEventTarget<T>} target The DOM EventTarget, Node.js\n * EventEmitter, JQuery-like event target, NodeList or HTMLCollection to attach the event handler to.\n * @param {string} eventName The event name of interest, being emitted by the\n * `target`.\n * @param {EventListenerOptions} [options] Options to pass through to addEventListener\n * @return {Observable<T>}\n */\nexport function fromEvent<T>(\n  target: any,\n  eventName: string,\n  options?: EventListenerOptions | ((...args: any[]) => T),\n  resultSelector?: (...args: any[]) => T\n): Observable<T> {\n  if (isFunction(options)) {\n    // DEPRECATED PATH\n    resultSelector = options;\n    options = undefined;\n  }\n  if (resultSelector) {\n    // DEPRECATED PATH\n    return fromEvent<T>(target, eventName, options as EventListenerOptions | undefined).pipe(mapOneOrManyArgs(resultSelector));\n  }\n\n  // Figure out our add and remove methods. In order to do this,\n  // we are going to analyze the target in a preferred order, if\n  // the target matches a given signature, we take the two \"add\" and \"remove\"\n  // method names and apply them to a map to create opposite versions of the\n  // same function. This is because they all operate in duplicate pairs,\n  // `addListener(name, handler)`, `removeListener(name, handler)`, for example.\n  // The call only differs by method name, as to whether or not you're adding or removing.\n  const [add, remove] =\n    // If it is an EventTarget, we need to use a slightly different method than the other two patterns.\n    isEventTarget(target)\n      ? eventTargetMethods.map((methodName) => (handler: any) => target[methodName](eventName, handler, options as EventListenerOptions))\n      : // In all other cases, the call pattern is identical with the exception of the method names.\n      isNodeStyleEventEmitter(target)\n      ? nodeEventEmitterMethods.map(toCommonHandlerRegistry(target, eventName))\n      : isJQueryStyleEventEmitter(target)\n      ? jqueryMethods.map(toCommonHandlerRegistry(target, eventName))\n      : [];\n\n  // If add is falsy, it's because we didn't match a pattern above.\n  // Check to see if it is an ArrayLike, because if it is, we want to\n  // try to apply fromEvent to all of it's items. We do this check last,\n  // because there are may be some types that are both ArrayLike *and* implement\n  // event registry points, and we'd rather delegate to that when possible.\n  if (!add) {\n    if (isArrayLike(target)) {\n      return mergeMap((subTarget: any) => fromEvent(subTarget, eventName, options as EventListenerOptions))(\n        internalFromArray(target)\n      ) as Observable<T>;\n    }\n  }\n\n  return new Observable<T>((subscriber) => {\n    // If add is falsy and we made it here, it's because we didn't\n    // match any valid target objects above.\n    if (!add) {\n      // TODO: We should probably discuss if throwing this at subscription-time\n      // is appropriate. It seems like it would be better (and easier to debug)\n      // to throw this when `fromEvent()` is called.\n      throw new TypeError('Invalid event target');\n    }\n    // The handler we are going to register. Forwards the event object, by itself, or\n    // an array of arguments to the event handler, if there is more than one argument,\n    // to the consumer.\n    const handler = (...args: any[]) => subscriber.next(1 < args.length ? args : args[0]);\n    // Do the work of adding the handler to the target.\n    add(handler);\n    // When we teardown, we want to remove the handler and free up memory.\n    return () => remove!(handler);\n  });\n}\n\n/**\n * Used to create `add` and `remove` functions to register and unregister event handlers\n * from a target in the most common handler pattern, where there are only two arguments.\n * (e.g.  `on(name, fn)`, `off(name, fn)`, `addListener(name, fn)`, or `removeListener(name, fn)`)\n * @param target The target we're calling methods on\n * @param eventName The event name for the event we're creating register or unregister functions for\n */\nfunction toCommonHandlerRegistry(target: any, eventName: string) {\n  return (methodName: string) => (handler: any) => target[methodName](eventName, handler);\n}\n\n/**\n * Checks to see if the target implements the required node-style EventEmitter methods\n * for adding and removing event handlers.\n * @param target the object to check\n */\nfunction isNodeStyleEventEmitter(target: any): target is NodeStyleEventEmitter {\n  return isFunction(target.addListener) && isFunction(target.removeListener);\n}\n\n/**\n * Checks to see if the target implements the required jQuery-style EventEmitter methods\n * for adding and removing event handlers.\n * @param target the object to check\n */\nfunction isJQueryStyleEventEmitter(target: any): target is JQueryStyleEventEmitter<any, any> {\n  return isFunction(target.on) && isFunction(target.off);\n}\n\n/**\n * Checks to see if the target implements the required EventTarget methods\n * for adding and removing event handlers.\n * @param target the object to check\n */\nfunction isEventTarget(target: any): target is HasEventTargetAddRemove<any> {\n  return isFunction(target.addEventListener) && isFunction(target.removeEventListener);\n}\n","/** @prettier */\nimport { SchedulerLike } from '../types';\nimport { scheduleArray } from '../scheduled/scheduleArray';\nimport { fromArrayLike } from './from';\n\nexport function internalFromArray<T>(input: ArrayLike<T>, scheduler?: SchedulerLike) {\n  return scheduler ? scheduleArray(input, scheduler) : fromArrayLike(input);\n}\n","import { Pair } from '../type/snakepony'\n\nexport let createArray2d = <T>(\n   size: Pair,\n   fillFunction: (pos: Pair) => T,\n): T[][] => {\n   let { x: sizex, y: sizey } = size\n   return Array.from({ length: sizey }, (_, y) => {\n      return Array.from({ length: sizex }, (_, x) => fillFunction({ y, x }))\n   })\n}\n","import { Direction, Pair, Side, JumpDirection, Side5 } from '../type/snakepony'\n\nexport let directionAll: Direction[] = ['up', 'down', 'left', 'right']\n\nexport let getDelta = (direction: Direction): Pair => {\n   switch (direction) {\n      case 'left':\n         return { x: -1, y: 0 }\n      case 'right':\n         return { x: 1, y: 0 }\n      case 'up':\n         return { x: 0, y: -1 }\n      case 'down':\n         return { x: 0, y: 1 }\n   }\n}\n\nexport let getSide = (direction: Direction): Side => {\n   switch (direction) {\n      case 'up':\n         return 'top'\n      case 'down':\n         return 'bottom'\n      case 'left':\n      case 'right':\n         return direction\n   }\n}\n\nexport let getSide5 = (direction: JumpDirection): Side5 => {\n   if (direction === 'in-place') {\n      return 'nowhere'\n   } else {\n      return getSide(direction)\n   }\n}\n\nexport let getReverse = (side: Side): Side => {\n   switch (side) {\n      case 'top':\n         return 'bottom'\n      case 'bottom':\n         return 'top'\n      case 'left':\n         return 'right'\n      case 'right':\n         return 'left'\n   }\n}\n\nexport let getReverse5 = (side: Side5): Side5 => {\n   if (side === 'nowhere') {\n      return side\n   } else {\n      return getReverse(side)\n   }\n}\n","import { Observable } from 'rxjs'\n\n/**\n * NoisyState\n *\n * A state atom that can be observed\n */\nexport interface NoisyState<T> {\n   /**\n    * read\n    *\n    * obtain the content of the atom\n    */\n   read(): T\n   /**\n    * write\n    *\n    * update the content of the atom\n    *\n    * @param value the new value\n    */\n   write(value: T): void\n   /**\n    * subscribe\n    *\n    * Will receive any new value written to the state. Note: the\n    * internal value, returned by `.read()`, is updated before the\n    * subscribers are woken up. This ensures the coherence between the\n    * provided value and the value of `.read()`.\n    */\n   subscribe(subscriber: (value: T) => void): void\n   /**\n    * attach\n    *\n    * Like subscribe, but the callback function will be run once before\n    * the method returns.\n    */\n   attach(subscriber: (value: T) => void): void\n   /**\n    * disposeAll\n    *\n    * Remove all subscribers\n    */\n   disposeAll(): void\n}\n\n/**\n * createNoisyState\n *\n * Create a NoisyState, with the given state as initial value.\n *\n * @param state the inital value\n */\nexport let createNoisyState = <T>(state: T) => {\n   let subscriberList: ((value: T) => void)[] = []\n\n   let me: NoisyState<T> = {\n      read() {\n         return state\n      },\n      write(value: T) {\n         state = value\n\n         subscriberList.forEach((subscriber) => {\n            subscriber(value)\n         })\n      },\n      subscribe(subscriber) {\n         subscriberList.push(subscriber)\n\n         return () => {\n            let index = subscriberList.indexOf(subscriber)\n            if (index > -1) {\n               subscriberList.splice(index, 1)\n            }\n         }\n      },\n      attach(subscriber) {\n         subscriber(state)\n         me.subscribe(subscriber)\n      },\n      disposeAll() {\n         subscriberList.splice(0, subscriberList.length)\n      },\n   }\n\n   return me\n}\n\n/**\n * createNoisyStateWithObservable\n *\n * Great if the target noisyState value can easily be obtained by a function.\n * The refresh signal is taken from an observable.\n *\n * @param observable observable, used as a scheduler\n * @param getter The function run each time the observable fires, to\n * produce the new value of the NoisyState\n */\nexport let createNoisyStateWithObservable = (observable: Observable<any>) => <T>(\n   getter: () => T,\n) => {\n   let me = createNoisyState(getter())\n\n   observable.subscribe(() => me.write(getter()))\n\n   return me\n}\n","import { Pair } from '../type/snakepony'\n\nexport let pairEqual = (a: Pair, b: Pair) => {\n   return a.x === b.x && a.y === b.y\n}\n\nexport let pairAdd = (a: Pair, b: Pair) => {\n   return {\n      x: a.x + b.x,\n      y: a.y + b.y,\n   }\n}\n\nexport let pairScale = (a: Pair, r: number) => {\n   return {\n      x: a.x * r,\n      y: a.y * r,\n   }\n}\n","export let mod = (a: number, b: number) => ((a % b) + b) % b\n","import {\n   BodyPattern,\n   Display,\n   DisplayProp,\n   DisplaySquare,\n   Move,\n   Pair,\n   Score,\n   Side5,\n} from '../type/snakepony'\nimport { createArray2d } from '../util/array2d'\nimport { getDelta, getReverse5, getSide5 } from '../util/direction'\nimport { getContext2d } from '../util/getContext2d'\nimport { pairAdd, pairEqual } from '../util/pair'\nimport { black, lightGrey, white, darkCoal, purple, coal } from './color'\n\n// Display state - Body\nexport type DisplayBody = Move[]\n\nexport let createDisplay = (prop: DisplayProp): Display => {\n   let { canvas, gridSize, showMoveCount, tailPosition: tailPos, topology } = prop\n   let ctx = getContext2d(canvas)\n\n   // State\n   let headPos = { ...tailPos }\n   let grid = createArray2d<DisplaySquare>(gridSize, (pos) =>\n      pairEqual(pos, headPos)\n         ? [\n              {\n                 type: 'body',\n                 from: 'nowhere',\n                 to: 'nowhere',\n              },\n           ]\n         : [],\n   )\n   let body: DisplayBody = []\n\n   let lastFoodPosition: Pair = { x: 0, y: 0 }\n\n   let squareSize: number\n   let bodyThickeness: number\n   let bodyOffset: number\n   let headSize: number\n   let headOffset: number\n   let foodSize: number\n   let foodOffset: number\n   let boardRightSide: number\n   let boardBottom: number\n\n   let GAME_RIGHT_SIDE_PANEL = 120\n   let GAME_BORDER_X = 1\n   let GAME_BORDER_Y = 1\n   let PAGE_TOP_OFFSET = 80\n   let PAGE_RIGHT_OFFSET = 24\n\n   let resizeLayout = (window: Pair) => {\n      let canvasSize = {\n         x: Math.max(window.x - PAGE_RIGHT_OFFSET, 64 + GAME_RIGHT_SIDE_PANEL),\n         y: Math.max(window.y - PAGE_TOP_OFFSET, 64),\n      }\n\n      let available = {\n         x: canvasSize.x - GAME_RIGHT_SIDE_PANEL - 2 * GAME_BORDER_X,\n         y: canvasSize.y - 2 * GAME_BORDER_Y,\n      }\n\n      if (available.x * gridSize.y > available.y * gridSize.x) {\n         // The constraint is vertical space\n         // Size is decided according to available.y\n         squareSize = 2 * Math.floor(available.y / (2 * gridSize.y))\n      } else {\n         // The constraint is horizontal space\n         // Size is decided according to available.x\n         squareSize = 2 * Math.floor(available.x / (2 * gridSize.x))\n      }\n\n      bodyThickeness = 2 * Math.ceil(squareSize / 2 / 5)\n      bodyOffset = squareSize / 2 - bodyThickeness / 2\n      headSize = 2 * Math.ceil(bodyThickeness / 4)\n      headOffset = squareSize / 2 - headSize / 2\n      foodSize = 2 * Math.ceil((squareSize / 2) * 0.7)\n      foodOffset = squareSize / 2 - foodSize / 2\n\n      boardRightSide = gridSize.x * squareSize + 2 * GAME_BORDER_X\n      boardBottom = gridSize.y * squareSize + 2 * GAME_BORDER_Y\n\n      canvas.height = canvasSize.y\n      canvas.width = canvasSize.x\n   }\n\n   let renderScreen = (score: Score) => {\n      renderBackground()\n      renderGrid()\n      renderScore(score)\n   }\n\n   let renderBackground = () => {\n      // Black base\n      ctx.fillStyle = black\n      ctx.fillRect(0, 0, canvas.width, canvas.height)\n\n      // Grey Border\n      let x = 0\n      let y = 0\n      let w = boardRightSide\n      let h = boardBottom\n      if (topology.leftRight !== 'wall') {\n         x += GAME_BORDER_X\n         w -= 2 * GAME_BORDER_X\n      }\n      if (topology.topBottom !== 'wall') {\n         y += GAME_BORDER_Y\n         h -= 2 * GAME_BORDER_Y\n      }\n      ctx.fillStyle = lightGrey\n      ctx.fillRect(x, y, w, h)\n   }\n\n   let renderGrid = () => {\n      grid.forEach((line, ky) => {\n         line.forEach((square, kx) => {\n            renderSquare(square, { y: ky, x: kx })\n         })\n      })\n   }\n\n   let renderSquare = (square: DisplaySquare, pair: Pair) => {\n      let x = GAME_BORDER_X + squareSize * pair.x\n      let y = GAME_BORDER_Y + squareSize * pair.y\n\n      // Square background\n      if ((pair.x + pair.y) % 2 == 0) {\n         ctx.fillStyle = darkCoal\n      } else {\n         ctx.fillStyle = black\n      }\n      ctx.fillRect(x, y, squareSize, squareSize)\n\n      square.forEach((pattern) => {\n         if (pattern.type === 'food') {\n            renderFood(pair)\n         } else {\n            renderBody(pair, pattern.from)\n            renderBody(pair, pattern.to)\n            if (pattern.type === 'head') {\n               renderHead(pair)\n            }\n         }\n      })\n   }\n\n   let renderFood = (pair: Pair) => {\n      let x = squareSize * pair.x + foodOffset\n      let y = squareSize * pair.y + foodOffset\n\n      ctx.fillStyle = white\n      ctx.fillRect(x, y, foodSize, foodSize)\n   }\n\n   /**\n    * renderBody -- render a piece of body of the snake\n    * @param pos where to render the pattern\n    * @param pattern what to render\n    */\n   let renderBody = (pos: Pair, pattern: Side5) => {\n      let x = GAME_BORDER_X + squareSize * pos.x + bodyOffset\n      let y = GAME_BORDER_Y + squareSize * pos.y + bodyOffset\n      let w = bodyThickeness\n      let h = bodyThickeness\n\n      if (pattern === 'nowhere') {\n      } else if (pattern === 'top') {\n         h += bodyOffset\n         y -= bodyOffset\n      } else if (pattern === 'bottom') {\n         h += bodyOffset\n      } else if (pattern === 'left') {\n         w += bodyOffset\n         x -= bodyOffset\n      } else if (pattern === 'right') {\n         w += bodyOffset\n      }\n\n      ctx.fillStyle = coal\n      ctx.fillRect(x, y, w, h)\n   }\n\n   let renderHead = (pos: Pair) => {\n      let x = GAME_BORDER_X + squareSize * pos.x + headOffset\n      let y = GAME_BORDER_Y + squareSize * pos.y + headOffset\n      let w = headSize\n      let h = headSize\n      ctx.fillStyle = white\n      ctx.fillRect(x, y, w, h)\n   }\n\n   let renderScore = (score: Score) => {\n      if (score.moveCount <= 0) {\n         return\n      }\n      ctx.fillStyle = black\n      ctx.fillRect(boardRightSide, 0, canvas.width, canvas.height)\n\n      let x = boardRightSide + 30\n      let y = 50\n      let scale = 1\n\n      let FONT_FAMILY = \"SquareFont, 'Courier New', Courier, monospace\"\n      ctx.font = `${32 * scale}px ${FONT_FAMILY}`\n      ctx.fillStyle = 'white'\n      ctx.strokeStyle = 'black'\n\n      displayText(`${score.snakeSize}`, { x, y })\n      let yMove = Math.max(boardBottom - 60, y + 48)\n      if (showMoveCount) {\n         displayText(`${score.moveCount}`, { x, y: yMove })\n      }\n   }\n\n   let displayText = (text: string, pos: Pair) => {\n      ctx.lineWidth = 5\n      ctx.strokeText(text, pos.x, pos.y)\n      ctx.fillText(text, pos.x, pos.y)\n   }\n\n   //\n   // Subscriptions\n   //\n   let add = (move: Move): void => {\n      body.push(move)\n\n      let newHeadPos: Pair\n\n      if (move.type === 'walk') {\n         newHeadPos = pairAdd(headPos, getDelta(move.direction))\n      } else {\n         newHeadPos = move.destination\n      }\n\n      let headSquare = grid[headPos.y][headPos.x]\n      let newHeadSquare = grid[newHeadPos.y][newHeadPos.x]\n\n      let side = getSide5(move.direction)\n      let reversedSide = getReverse5(side)\n\n      let headPattern = headSquare.slice(-1)[0]\n      if (headPattern.type === 'body' || headPattern.type === 'head') {\n         headPattern.to = side\n      }\n      if (headPattern.type === 'head') {\n         ;(headPattern as any).type = 'body'\n      }\n\n      newHeadSquare.push({\n         type: 'head',\n         from: reversedSide,\n         to: 'nowhere',\n      })\n\n      renderSquare(headSquare, headPos)\n      renderSquare(newHeadSquare, newHeadPos)\n\n      headPos = newHeadPos\n   }\n\n   let remove = () => {\n      let move = body.shift()\n      if (move === undefined) {\n         throw new Error()\n      }\n\n      let newTailPos: Pair\n\n      if (move.type === 'walk') {\n         newTailPos = pairAdd(tailPos, getDelta(move.direction))\n      } else {\n         newTailPos = move.destination\n      }\n\n      let tailSquare = grid[tailPos.y][tailPos.x]\n      let newTailSquare = grid[newTailPos.y][newTailPos.x]\n\n      tailSquare.shift()\n\n      let newTailPattern = newTailSquare.slice(-1)[0]\n      if (newTailPattern === undefined) {\n         console.log('newTailSquare', newTailSquare)\n      } else if (newTailPattern.type === 'body') {\n         newTailPattern.from = 'nowhere'\n      }\n\n      renderSquare(tailSquare, tailPos)\n      renderSquare(newTailSquare, newTailPos)\n\n      tailPos = newTailPos\n   }\n\n   let resizeScreen = (size: Pair, score: Score): void => {\n      resizeLayout(size)\n      renderScreen(score)\n   }\n\n   // Score\n   let handleScore = (score: Score): void => {\n      renderScore(score)\n   }\n\n   // Food\n   let handleFood = (food) => {\n      let last = lastFoodPosition\n      let lastSquare = grid[last.y][last.x]\n      let foodSquare = grid[food.y][food.x]\n\n      for (let k = lastSquare.length - 1; k >= 0; k--) {\n         if (lastSquare[k].type === 'food') {\n            lastSquare.splice(k, 1)\n         }\n      }\n\n      foodSquare.push({ type: 'food' })\n\n      renderSquare(lastSquare, last)\n      renderSquare(foodSquare, food)\n      lastFoodPosition = food\n   }\n\n   return {\n      add,\n      remove,\n      resizeScreen,\n      handleScore,\n      handleFood,\n   }\n}\n","export let getContext2d = (canvas: HTMLCanvasElement) => {\n   let ctx = canvas.getContext('2d')\n   if (ctx === null) {\n      throw new Error()\n   }\n   return ctx\n}\n","export let purple = '#98A'\n\nexport let white = '#FFF'\nexport let lightGrey = '#AAA'\nexport let coal = '#404050'\nexport let darkCoal = '#222'\nexport let black = '#000'\n","import { Observable, Subject } from 'rxjs'\nimport { PonyInput, Directive } from '../type/snakepony'\nimport { createKeyboardManager } from './keyboardManager'\nimport { createFingerMoveManager } from './fingerMoveManager'\n\nexport let createInput = (): PonyInput => {\n   let keyboard = createKeyboardManager({\n      element: document.documentElement,\n      evPropName: 'key',\n   })\n\n   let fingerMoveManager = createFingerMoveManager({\n      element: document.documentElement,\n   })\n\n   let makeObservable = (keyList: string[], swipe: Subject) => {\n      return new Observable<void>((subscriber) => {\n         let callback = () => subscriber.next()\n         let subS = swipe.subscribe(callback)\n         let subKList = keyList.map((key) => {\n            return keyboard.onKeydown(key, callback)\n         })\n         return () => {\n            subKList.forEach((subK) => {\n               subK.remove()\n            })\n            subS.remove(subS)\n         }\n      })\n   }\n\n   let fmmDirective = fingerMoveManager.directive\n\n   let directive: Directive<Observable<void>> = {\n      up: makeObservable(['ArrowUp', 'e', 'k'], fmmDirective.up),\n      left: makeObservable(['ArrowLeft', 's', 'h'], fmmDirective.left),\n      down: makeObservable(['ArrowDown', 'd', 'j'], fmmDirective.down),\n      right: makeObservable(['ArrowRight', 'f', 'l'], fmmDirective.right),\n   }\n\n   return {\n      directive,\n      removeAll: () => {\n         keyboard.removeAll()\n         fingerMoveManager.removeAll()\n      },\n   }\n}\n","// https://github.com/mathieucaroff/cellular-automaton-explorer-1d/blob/7cb4e7360f/src/display/keyboardManager.ts\n//\n// with:\n// - me.onKeyup added\n// - me.removeAll improved\n\nexport interface WithRemover {\n   remove: () => void\n}\n\nexport interface KeyboardManagerProp {\n   element: Element\n   evPropName: keyof KeyboardEvent\n}\n\nexport interface KeyboardManager {\n   onKeydown: (key: string, callback: () => void) => WithRemover\n   onKeyup: (key: string, callback: () => void) => WithRemover\n   onBoth: (prop: {\n      key: string\n      keydown: () => void\n      keyup: () => void\n   }) => WithRemover\n   removeAll: () => void\n}\n\nexport let createKeyboardManager = (\n   prop: KeyboardManagerProp,\n): KeyboardManager => {\n   let { element, evPropName } = prop\n\n   type EventMap = Record<string, (() => void) | undefined>\n   let onKeydownMap: EventMap = {}\n   let onKeyupMap: EventMap = {}\n\n   let eventHandler = (closureName: string, onEventMap: EventMap) => (ev) => {\n      let key = '' + ev[evPropName]\n      let handler = onEventMap[key]\n      if (handler !== undefined) {\n         handler()\n         if (!(ev.altKey || ev.ctrlKey || ev.shiftKey)) {\n            ev.preventDefault()\n         }\n      }\n   }\n\n   let handleKeydown = eventHandler('down', onKeydownMap)\n   let handleKeyup = eventHandler('up', onKeyupMap)\n\n   element.addEventListener('keydown', handleKeydown, true)\n   element.addEventListener('keyup', handleKeyup, true)\n\n   let removeAll = () => {\n      // untested // TODO?\n      onKeydownMap = {}\n      onKeyupMap = {}\n      element.removeEventListener('keydown', handleKeydown, true)\n      element.removeEventListener('keyup', handleKeyup, true)\n   }\n\n   return {\n      onKeydown: (key: string, callback: () => void) => {\n         if (onKeydownMap[key] !== undefined) {\n            throw new Error(`keyboard event ${key}(down) assigned twice`)\n         }\n         onKeydownMap[key] = callback\n\n         return {\n            remove: () => {\n               delete onKeydownMap[key]\n            },\n         }\n      },\n\n      onKeyup: (key: string, callback: () => void) => {\n         if (onKeyupMap[key] !== undefined) {\n            throw new Error(`keyboard event ${key}(up) assigned twice`)\n         }\n         onKeyupMap[key] = callback\n\n         return {\n            remove: () => {\n               delete onKeyupMap[key]\n            },\n         }\n      },\n\n      onBoth: (prop) => {\n         let { key, keydown, keyup } = prop\n         if (onKeydownMap[key] !== undefined) {\n            throw new Error(`keyboard event ${key}(down) assigned twice`)\n         }\n         if (onKeyupMap[key] !== undefined) {\n            throw new Error(`keyboard event ${key}(up) assigned twice`)\n         }\n\n         onKeydownMap[key] = keydown\n         onKeyupMap[key] = keyup\n\n         return {\n            remove: () => {\n               delete onKeydownMap[key]\n               delete onKeyupMap[key]\n            },\n         }\n      },\n\n      removeAll,\n   }\n}\n","import { Subject } from 'rxjs'\n\nexport let createFingerMoveManager = ({ element }) => {\n   let getTouches = (event: any): MouseEvent => {\n      return (\n         // browser API ?? jQuery\n         event.touches?.[0] ?? event.originalEvent?.touches?.[0] ?? event\n      )\n   }\n\n   let xDown = 0\n   let yDown = 0\n\n   let handleTouchStart = (evt) => {\n      let touches = getTouches(evt)\n\n      xDown = touches.clientX\n      yDown = touches.clientY\n   }\n\n   let handleTouchMove = (evt) => {\n      if (!xDown || !yDown) {\n         return\n      }\n\n      let touches = getTouches(evt)\n\n      let currentX = touches.clientX\n      let currentY = touches.clientY\n\n      let dx = xDown - currentX\n      let dy = yDown - currentY\n\n      let dist = dx ** 2 + dy ** 2\n\n      if (dist < 80 ** 2) {\n         return\n      }\n\n      if (Math.abs(dx) > Math.abs(dy)) {\n         /*most significant*/\n         if (dx > 0) {\n            directive.left.next()\n         } else {\n            directive.right.next()\n         }\n      } else {\n         if (dy > 0) {\n            directive.up.next()\n         } else {\n            directive.down.next()\n         }\n      }\n\n      xDown = currentX\n      yDown = currentY\n   }\n\n   let mouseIsDown = false\n   let handleMouseDown = (ev: Event) => {\n      mouseIsDown = true\n      handleTouchStart(ev)\n   }\n\n   let handleMouseMove = (ev) => {\n      if (mouseIsDown) {\n         handleTouchMove(ev)\n      }\n   }\n\n   let handleMouseUp = () => {\n      mouseIsDown = false\n   }\n\n   element.addEventListener('touchstart', handleTouchStart, false)\n   element.addEventListener('touchmove', handleTouchMove, false)\n   element.addEventListener('mousedown', handleMouseDown, false)\n   element.addEventListener('mousemove', handleMouseMove, false)\n   element.addEventListener('mouseup', handleMouseUp, false)\n\n   let removeAll = () => {\n      element.removeEventListener('touchstart', handleTouchStart, false)\n      element.removeEventListener('touchmove', handleTouchMove, false)\n      element.removeEventListener('mousedown', handleMouseDown, false)\n      element.removeEventListener('mousemove', handleMouseMove, false)\n      element.removeEventListener('mouseup', handleMouseUp, false)\n   }\n\n   let directive = {\n      left: new Subject<void>(),\n      right: new Subject<void>(),\n      up: new Subject<void>(),\n      down: new Subject<void>(),\n   }\n\n   let me = {\n      directive,\n      removeAll,\n   }\n\n   return me\n}\n","{\n   \"name\": \"snakepony\",\n   \"description\": \"A simple snake game HTML5-canvas TS game with ponies\",\n   \"repository\": \"https://github.com/mathieucaroff/snakepony\",\n   \"license\": \"CC0-1.0\",\n   \"version\": \"1.0.0\",\n   \"scripts\": {\n      \"build\": \"parcel build src/index.html --dist-dir public\",\n      \"mcabuild\": \"parcel build src/index.html --public-url snake.d\",\n      \"serve\": \"parcel serve src/index.html\"\n   },\n   \"devDependencies\": {\n      \"@types/node\": \"^13.9.1\",\n      \"@types/seedrandom\": \"^2.4.28\",\n      \"parcel\": \"^2.2.1\",\n      \"prettier\": \"^2.0.5\",\n      \"ts-node\": \"^8.6.2\",\n      \"typescript\": \"4.5.5\"\n   },\n   \"dependencies\": {\n      \"@ui5/webcomponents\": \"^1.0.0-rc.7\",\n      \"rxjs\": \"^7.0.0-beta.0\",\n      \"seedrandom\": \"^3.0.5\"\n   }\n}\n","export let githubCornerHTML = (repositoryUrl: string) => {\n   return `<a href=\"${repositoryUrl}\" class=\"github-corner\" aria-label=\"View source on GitHub\"><svg width=\"80\" height=\"80\" viewBox=\"0 0 250 250\" style=\"fill:#fff; color:#151513; position: absolute; top: 0; border: 0; right: 0;\" aria-hidden=\"true\"><path d=\"M0,0 L115,115 L130,115 L142,142 L250,250 L250,0 Z\"></path><path d=\"M128.3,109.0 C113.8,99.7 119.0,89.6 119.0,89.6 C122.0,82.7 120.5,78.6 120.5,78.6 C119.2,72.0 123.4,76.3 123.4,76.3 C127.3,80.9 125.5,87.3 125.5,87.3 C122.9,97.6 130.6,101.9 134.4,103.2\" fill=\"currentColor\" style=\"transform-origin: 130px 106px;\" class=\"octo-arm\"></path><path d=\"M115.0,115.0 C114.9,115.1 118.7,116.5 119.8,115.4 L133.7,101.6 C136.9,99.2 139.9,98.4 142.2,98.6 C133.8,88.0 127.5,74.4 143.8,58.0 C148.5,53.4 154.0,51.2 159.7,51.0 C160.3,49.4 163.2,43.6 171.4,40.1 C171.4,40.1 176.1,42.5 178.8,56.2 C183.1,58.6 187.2,61.8 190.9,65.4 C194.5,69.0 197.7,73.2 200.1,77.6 C213.8,80.2 216.3,84.9 216.3,84.9 C212.7,93.1 206.9,96.0 205.4,96.6 C205.1,102.4 203.0,107.8 198.3,112.5 C181.9,128.9 168.3,122.5 157.7,114.1 C157.9,116.9 156.7,120.9 152.7,124.9 L141.0,136.5 C139.8,137.7 141.6,141.9 141.8,141.8 Z\" fill=\"currentColor\" class=\"octo-body\"></path></svg></a><style>.github-corner:hover .octo-arm{animation:octocat-wave 560ms ease-in-out}@keyframes octocat-wave{0%,100%{transform:rotate(0)}20%,60%{transform:rotate(-25deg)}40%,80%{transform:rotate(10deg)}}@media (max-width:500px){.github-corner:hover .octo-arm{animation:none}.github-corner .octo-arm{animation:octocat-wave 560ms ease-in-out}}</style>`\n}\n","export type DefaultConfigObject<T> = {\n   [K in keyof T]: (param: Indirect<T>) => T[K]\n}\n\nexport type Indirect<T> = {\n   [K in keyof T]: () => T[K]\n}\n\nexport let spacelessURL = (location: Location) => {\n   let spaceLessURL = location.href.replace(/ |%20/g, '')\n\n   if (spaceLessURL.includes(' ')) throw new Error()\n\n   if (location.href !== spaceLessURL) {\n      location.replace(spaceLessURL)\n   }\n\n   if (location.href.includes(' ')) throw new Error()\n}\n\nexport let getUrlParam = <T>(\n   location: Location,\n   defaultConfig: DefaultConfigObject<T>,\n) => {\n   let config: T = {} as any\n\n   let pieceList = location.search.split('?').slice(1)\n\n   let stack = (\n      config: T,\n      defaultConfig: DefaultConfigObject<T>,\n   ): Indirect<T> => {\n      let stackedConfig = {} as Indirect<T>\n\n      Object.keys(defaultConfig).forEach((key) => {\n         if (key in config) {\n            stackedConfig[key] = () => config[key]\n         } else {\n            stackedConfig[key] = (conf = defaultConfig) => {\n               return defaultConfig[key](conf)\n            }\n         }\n      })\n\n      return stackedConfig\n   }\n\n   pieceList.forEach((piece) => {\n      let key: string\n      let valueList: string[]\n      let value\n      if (piece.includes('=')) {\n         ;[key, ...valueList] = piece.split('=')\n         value = valueList.join('=')\n         if (!isNaN(value)) {\n            value = +value\n         }\n      } else {\n         key = piece\n         value = true\n      }\n\n      config[key] = value\n   })\n\n   Object.keys(defaultConfig).forEach((key) => {\n      if (!(key in config)) {\n         config[key] = defaultConfig[key](stack(config, defaultConfig))\n      }\n   })\n\n   return config\n}\n","// function create()\n// from\n// https://github.com/mathieucaroff/xadom/blob/37570300c7/src/util/xaUtil.ts\n\n/**\n * create an HTML Element\n *\n * @param name The html name of the element to create\n * @param attribute An object associating keys to values for the created element\n * @param children An array of children elements\n */\nfunction h<K extends keyof HTMLElementTagNameMap>(\n   name: K,\n   attribute?: Partial<HTMLElementTagNameMap[K]> & Record<string, any>,\n   children?: Element[],\n): HTMLElementTagNameMap[K]\n\nfunction h<T extends Element = HTMLElement>(\n   name: string,\n   attribute?: Record<string, any>,\n   children?: Element[],\n): T\n\nfunction h<K extends keyof HTMLElementTagNameMap>(\n   name: K,\n   attribute: Partial<HTMLElementTagNameMap[K]> & Record<string, any> = {},\n   children: Element[] = [],\n) {\n   let elem = document.createElement<K>(name)\n\n   Object.entries(attribute).forEach(([name, value]) => {\n      if (elem[name] !== undefined) {\n         elem[name] = value\n      } else {\n         elem.setAttribute(name, value)\n      }\n   })\n\n   children.forEach((child) => {\n      elem.appendChild(child)\n   })\n\n   return elem\n}\n\nexport { h }\n","import { Topology2D } from '../type/snakepony'\n\nexport let getTopologyName = (topology: Topology2D) => {\n   let border = 0\n   let loop = 0\n   let crossed = 0\n\n   let topology1DArray = Object.values(topology)\n\n   if (topology1DArray.length !== 2) {\n      throw new Error()\n   }\n\n   topology1DArray.forEach((value) => {\n      switch (value) {\n         case 'wall':\n            return border++\n         case 'loop':\n            return loop++\n         case 'crossed':\n            return crossed++\n      }\n   })\n\n   if (false) {\n   } else if (border == 2) {\n      return 'rectangle'\n   } else if (loop == 2) {\n      return 'torus'\n   } else if (crossed == 2) {\n      return 'projective' // 'real projective plan'\n   } else if (border == 0) {\n      // => loop == 1 && crossed == 1\n      return 'klein' // 'klein bottle'\n   } else if (loop == 0) {\n      // => _\n      return 'mobius' // 'möbius strip'\n   } else if (crossed == 0) {\n      // => _\n      return 'ribbon'\n   } else {\n      throw new Error()\n   }\n}\n\nexport type TopologyName = ReturnType<typeof getTopologyName>\n\nexport let topologyFromName = (name: string): Topology2D | undefined => {\n   let topology: Topology2D | undefined = undefined\n\n   if (false) {\n   } else if (name.match(/\\b(rect|square|normal|wall)/)) {\n      topology = { leftRight: 'wall', topBottom: 'wall' }\n   } else if (name.match(/\\btorus/)) {\n      topology = { leftRight: 'loop', topBottom: 'loop' }\n   } else if (name.match(/\\b(real|projective|plan)/)) {\n      topology = { leftRight: 'crossed', topBottom: 'crossed' }\n   } else if (name.match(/\\b(klein|bottle)/)) {\n      topology = { leftRight: 'loop', topBottom: 'crossed' }\n   } else if (name.match(/\\b(m..?bius|strip)/)) {\n      topology = { leftRight: 'wall', topBottom: 'crossed' }\n   } else if (name.match(/\\b(ribbon|loop)/)) {\n      topology = { leftRight: 'wall', topBottom: 'loop' }\n   }\n\n   if (topology === undefined) {\n      return\n   }\n\n   if (name.match(/\\b(long|alt)/)) {\n      topology = {\n         leftRight: topology.topBottom,\n         topBottom: topology.leftRight,\n      }\n   }\n\n   return topology\n}\n","import { fromEvent } from 'rxjs'\nimport { repository } from '../../package.json'\nimport { githubCornerHTML } from '../lib/githubCorner'\nimport { SnakeponyConfig } from '../type/snakeponyConfig'\nimport { createNoisyStateWithObservable } from '../util/noisyState'\nimport { randomSeed } from '../util/randomSeed'\nimport { getUrlParam } from '../util/urlParam'\nimport { h } from './lib/hyper'\nimport { ScreenSize } from '../type/snakepony'\nimport { topologyFromName } from '../util/topology'\n\ninterface InitProp {\n   document: Document\n   location: Location\n}\n\nlet getConfig = (prop: InitProp) => {\n   let { location } = prop\n\n   let config = getUrlParam<SnakeponyConfig>(location, {\n      feed: () => 1,\n      size: () => 8,\n      sizeY: ({ size }) => size(),\n      sizeX: ({ size }) => Math.floor(1.5 * size()),\n      seed: () => randomSeed(),\n      showMoveCount: () => false,\n      topology: () => 'rectangle',\n      topologyLeftRight: ({ topology }) => topologyFromName(topology())?.leftRight ?? 'wall',\n      topologyTopBottom: ({ topology }) => topologyFromName(topology())?.topBottom ?? 'wall',\n      ai: () => 'none',\n      aiSpeed: () => 10,\n   })\n\n   console.info(`?seed=${config.seed}`)\n\n   return config\n}\n\nexport let init = (prop: InitProp) => {\n   let { document } = prop\n   let config = getConfig(prop)\n\n   let canvas = h('canvas')\n   canvas.width = 800\n   canvas.height = 600\n\n   let corner = h('i', {\n      innerHTML: githubCornerHTML(repository),\n   })\n\n   document.body.append(\n      h('h1', {\n         textContent: document.title,\n         className: 'inline',\n      }),\n      h('div', {}, [canvas]),\n      corner,\n   )\n\n   let screenSize: ScreenSize = createNoisyStateWithObservable(fromEvent(window, 'resize'))(() => ({\n      y: window.innerHeight,\n      x: window.innerWidth,\n   }))\n\n   return {\n      canvas,\n      config,\n      screenSize,\n   }\n}\n","export let randomSeed = () => {\n   return Math.random()\n      .toString(36)\n      .slice(2)\n      .toUpperCase()\n}\n","import { default as seedrandom } from 'seedrandom'\nimport { createLoopAi } from './ai/loopAi'\nimport { createEngine } from './core/engine'\nimport { createDisplay } from './display/display'\nimport { createInput } from './input/input'\nimport { init } from './page/init'\nimport { entries } from './util/entries'\nimport { spacelessURL } from './util/urlParam'\n\nexport let main = async () => {\n   spacelessURL(location)\n\n   let { canvas, config, screenSize } = init({ document, location })\n\n   let random = seedrandom(config.seed)\n\n   let input = createInput()\n\n   let gridSize = {\n      x: config.sizeX,\n      y: config.sizeY,\n   }\n\n   let topology = {\n      leftRight: config.topologyLeftRight,\n      topBottom: config.topologyTopBottom,\n   }\n\n   let engine = createEngine({\n      feed: config.feed,\n      gridSize,\n      random,\n      topology,\n   })\n\n   entries(input.directive).forEach(([name, observable]) => {\n      observable.subscribe(engine.move[name])\n   })\n\n   let display = createDisplay({\n      canvas,\n      gridSize,\n      showMoveCount: config.showMoveCount,\n      tailPosition: engine.getTail(),\n      topology,\n   })\n\n   // Connecting modules\n   engine.add.subscribe(display.add)\n   engine.remove.subscribe(display.remove)\n   engine.food.attach(display.handleFood)\n   engine.score.attach(display.handleScore)\n\n   screenSize.attach((size) => display.resizeScreen(size, engine.score.read()))\n\n   engine.flushInit()\n\n   if (config.ai === 'loop') {\n      createLoopAi(config, engine.move)\n   }\n}\n","import { Subject } from 'rxjs'\n\nimport { Direction, Engine, EngineProp, Move, Pair, Player, Score } from '../type/snakepony'\nimport { createArray2d } from '../util/array2d'\nimport { getDelta } from '../util/direction'\nimport { createNoisyState, NoisyState } from '../util/noisyState'\nimport { pairAdd, pairEqual } from '../util/pair'\nimport { mod } from '../util/mod'\n\nexport let createEngine = (prop: EngineProp) => {\n   let { feed: feedTarget, gridSize, topology, random } = prop\n\n   let gridSquareNumber = gridSize.x * gridSize.y\n\n   let grid = createArray2d(gridSize, () => 0)\n\n   let player: Player = {\n      body: [{ x: 2, y: 2 }],\n   }\n\n   grid[player.body[0].y][player.body[0].x]++\n\n   let headSubject = new Subject<Move>()\n   let tailSubject = new Subject<void>()\n   let score: NoisyState<Score> = createNoisyState({\n      moveCount: -1,\n      snakeSize: 1,\n   })\n   let food: NoisyState<Pair>\n   let feedCount = 0\n\n   /**\n    * move\n    * Let the player do a move\n    *\n    * @param direction\n    */\n   let move = (direction: Direction) => {\n      //  The delta Pair that leads the player to an odd wall\n      let delta = getDelta(direction)\n\n      let newHead = pairAdd(player.body.slice(-1)[0], delta)\n      let { y, x } = newHead\n      let jumping = false\n\n      // // collision // //\n      // self collision\n      // top-bottom border\n      if (!inboundY(y)) {\n         if (topology.topBottom === 'wall') {\n            return\n         } else {\n            jumping = true\n\n            newHead.y = mod(y, gridSize.y)\n            if (topology.topBottom === 'crossed') {\n               newHead.x = gridSize.x - 1 - x\n            }\n         }\n      }\n      if (!inboundX(x)) {\n         if (topology.leftRight === 'wall') {\n            return\n         } else {\n            jumping = true\n\n            newHead.x = mod(x, gridSize.x)\n            if (topology.leftRight === 'crossed') {\n               newHead.y = gridSize.y - 1 - y\n            }\n         }\n      }\n\n      if (grid[newHead.y][newHead.x] > 0) {\n         return\n      }\n\n      // food\n      let scoring = pairEqual(food.read(), newHead)\n\n      // moving head\n      grid[newHead.y][newHead.x] += 1\n      player.body.push(newHead)\n\n      if (jumping) {\n         console.log(newHead)\n\n         headSubject.next({\n            type: 'jump',\n            direction,\n            destination: newHead,\n         })\n      } else {\n         headSubject.next({\n            type: 'walk',\n            direction,\n         })\n      }\n\n      // moving tail\n      if (!scoring) {\n         let tail = player.body[0]\n         grid[tail.y][tail.x] -= 1\n         player.body.shift()\n         tailSubject.next()\n      }\n\n      // moving the food\n      if (scoring) {\n         let pos = nextFoodPosition()\n         if (pos !== undefined) {\n            food.write(pos)\n         }\n      }\n\n      // update the score\n      score.write({\n         moveCount: score.read().moveCount + 1,\n         snakeSize: score.read().snakeSize + +scoring,\n      })\n\n      if (scoring && player.body.length === gridSquareNumber) {\n         console.info('move count:', score.read().moveCount)\n      }\n   }\n\n   let nextFoodPosition = (): Pair | undefined => {\n      if (feedCount < feedTarget) {\n         feedCount++\n         return feedingFoodPosition()\n      }\n\n      return randomFoodPosition()\n   }\n\n   let feedingFoodPosition = (): Pair | undefined => {\n      let head = player.body.slice(-1)[0]\n      let directionList: Direction[] = ['right', 'left', 'down', 'up']\n      if (head.x === 0 && head.y > 0) {\n         directionList = ['up', 'down']\n      }\n\n      let posList = directionList.map((direction) => {\n         let pos = pairAdd(head, getDelta(direction))\n         return pos\n      })\n\n      let availablePos = posList.filter(valid)\n      let nonLeftPos = availablePos.filter(({ x }) => x > 0)\n      if (nonLeftPos.length > 0) {\n         return nonLeftPos[0]\n      } else if (availablePos.length > 0) {\n         return availablePos[0]\n      }\n      return randomFoodPosition()\n   }\n\n   let randomFoodPosition = (): Pair | undefined => {\n      let optionCount = gridSquareNumber - player.body.length\n      if (optionCount === 0) {\n         return undefined\n      }\n\n      let index = Math.floor(random() * optionCount) % optionCount\n      let foodPosition: any\n\n      let count = 0\n      let reached = grid.some((line, ky) =>\n         line.some((square, kx) => {\n            if (square == 0) {\n               // Counting empty squares\n               count++\n            }\n            if (count > index) {\n               // Until one reaches index\n               foodPosition = { y: ky, x: kx }\n               return true\n            }\n            return false\n         }),\n      )\n\n      if (!reached || foodPosition === undefined) {\n         throw new Error() // Impossible in theory\n      }\n\n      return foodPosition\n   }\n\n   let valid = (pos: Pair) => {\n      return inboundY(pos.y) && inboundX(pos.x) && grid[pos.y][pos.x] === 0\n   }\n\n   let inboundX = (x: number) => {\n      return 0 <= x && x < gridSize.x\n   }\n\n   let inboundY = (y: number) => {\n      return 0 <= y && y < gridSize.y\n   }\n\n   let getTail = () => {\n      return player.body[0]\n   }\n\n   let flushInit = () => {\n      move('right')\n   }\n\n   food = createNoisyState(nextFoodPosition()!)\n\n   let me: Engine = {\n      add: headSubject,\n      remove: tailSubject,\n      score,\n      food,\n      getTail,\n      flushInit,\n      move: {\n         left: () => move('left'),\n         right: () => move('right'),\n         up: () => move('up'),\n         down: () => move('down'),\n      },\n   }\n\n   return me\n}\n","export type Entries<T> = {\n   [K in keyof T]: [K, T[K]]\n}[keyof T][]\n\nexport let entries = <T>(input: T) => {\n   return Object.entries(input) as Entries<T>\n}\n","// https://github.com/parcel-bundler/parcel/issues/1762#issuecomment-519631755\nimport 'regenerator-runtime/runtime';\nimport { main } from './main';\n\nmain();\n"],"names":["global","module","define","Alea","seed","n","me","this","mash","data","String","i","length","h","charCodeAt","next","t","s0","c","s1","s2","copy","f","impl","opts","xg","state","prng","int32","double","quick","exports","amd","alea","XorGen","strseed","x","y","z","w","k","result","xor128","v","d","xorwow","seed1","me1","X","j","push","init","slice","Date","xorshift7","limit","Math","max","xor4096","b","a","floor","tychei","undefined","Op","Object","prototype","hasOwn","hasOwnProperty","$Symbol","Symbol","iteratorSymbol","iterator","asyncIteratorSymbol","asyncIterator","toStringTagSymbol","toStringTag","runtime","regeneratorRuntime","$7238a34a955809b2$exports","wrap","GenStateSuspendedStart","GenStateSuspendedYield","GenStateExecuting","GenStateCompleted","ContinueSentinel","IteratorPrototype","getProto","getPrototypeOf","NativeIteratorPrototype","values","call","Gp","GeneratorFunctionPrototype","Generator","create","GeneratorFunction","constructor","displayName","isGeneratorFunction","genFun","ctor","name","mark","setPrototypeOf","__proto__","awrap","arg","__await","defineIteratorMethods","AsyncIterator","async","innerFn","outerFn","self","tryLocsList","iter","then","done","value","toString","keys","object","key1","reverse","key","pop","Context","reset","skipTempReset","prev","sent","_sent","delegate","method","tryEntries","forEach","resetTryEntry","charAt","isNaN","stop","rootRecord","completion","type","rval","dispatchException","exception","context","handle","loc","caught","record","entry","tryLoc","hasCatch","hasFinally","catchLoc","finallyLoc","Error","abrupt","finallyEntry","complete","afterLoc","finish","catch","thrown","delegateYield","iterable","resultName","nextLoc","protoGenerator","generator","_invoke","doneResult","delegateResult","maybeInvokeDelegate","tryCatch","makeInvokeMethod","fn","obj","err","invoke","resolve","reject","value1","Promise","unwrapped","error","previousPromise","callInvokeWithMethodAndArg","return","TypeError","info","pushTryEntry","locs","iteratorMethod","next1","Function","$21cf45e1956bd119$export$2ad9dd0e62c9963","config","fastMove","sizeY","move","fromEntries","entries","map","moveFunction","setTimeout","aiSpeed","rightWidth","sizeX","right","leftWidth","left","downZigZag","down","upHeight","up","run","pool","math","nodecrypto","width","startdenom","pow","significance","overflow","mask","seedrandom","options","callback","shortseed","mixkey","flatten","entropy","tostring","out","randomBytes","Uint8Array","crypto","msCrypto","getRandomValues","e","browser","navigator","plugins","screen","autoseed","arc4","ARC4","prng1","g","S","pass","is_math_call","t1","keylen","i1","j1","count","r","s","depth","prop","typ","smear","stringseed","fromCharCode","apply","random","$d7e73366feb50558$exports","parcelRequire","ex","$cmoHh","$euRi5","$hDsEw","$3J2Zm","$6Px8M","$lDm0S","$2725bdcb11510985$exports","$5c96a02c592fcff1$var$extendStatics","d1","b1","Array","p","$5c96a02c592fcff1$export$a8ba968b8961cb8a","__","$5c96a02c592fcff1$export$1050f835b63b671e","thisArg","_arguments","P","fulfilled","step","rejected","body","op","_","label","ops","trys","verb","$5c96a02c592fcff1$export$19a8beecd37a4c45","o","m","$5c96a02c592fcff1$export$8d051b38c9118094","ar","$5c96a02c592fcff1$export$afc72e2116322959","arguments","concat","v1","settle","$c1aa42b0603892d6$export$f6e2535fb5126e54","$ebe567a061bc80f6$export$128a15b65d1b6041","createImpl","ctorFunc","instance","stack","$f587043ffd615a90$export$c9648b76fd580c34","_super","errors","message","join","$2b94c03d07e501cc$export$dae3f38077fc36c0","arr","item","index","indexOf","splice","$8343668acd7c4a9b$export$f55210826850c514","initialTeardown","closed","_parentage","_teardowns","empty","unsubscribe","isArray","_parentage_1","_parentage_1_1","remove","_teardowns_1","_teardowns_1_1","teardown_1","$8343668acd7c4a9b$var$execTeardown","add","teardown","_hasParent","_addParent","_a","parent","includes","_removeParent","EMPTY","$8343668acd7c4a9b$export$610f9c3ca1a38dd8","$8343668acd7c4a9b$export$4f9221cbada3c4fc","$ca336efb1b4fb564$export$e506a1d27d1eaa20","onUnhandledError","onStoppedNotification","useDeprecatedSynchronousErrorHandling","useDeprecatedNextContext","$c07b5bfa3b9d4401$export$365aa6bd3c788e3d","args","_i","clearTimeout","$18eb28ff53cc4943$export$ebf645db02d3e99f","$528e75db69787807$export$8793edee2d425525","$0ba077a4cdfd9739$export$b7f97edb34bc1f87","$0ba077a4cdfd9739$export$9c8f6e8d39c60cf3","kind","$cf8ce74b80455e9f$export$60959659b2c22881","destination","_this","isStopped","$cf8ce74b80455e9f$export$88d395d20619a0af","$cf8ce74b80455e9f$export$94eeb6a328cab6c7","$cf8ce74b80455e9f$var$handleStoppedNotification","$0ba077a4cdfd9739$export$ff9346b0d1d30313","_next","_error","_complete","observerOrNext","context_1","bind","$cf8ce74b80455e9f$var$defaultErrorHandler","notification","subscriber","$eaf29fccbded6ed3$export$5ab46cbf6120b33a","observable","$7569c528cdd9d182$export$f0954fd7d5368655","$0f1e8e2d1fe93adf$export$71f88a61afaa14d7","fns","input","reduce","$4f562137a990678a$export$77cea355fa80b5f4","subscribe","_subscribe","lift","operator","source","$4f562137a990678a$var$isObserver","_trySubscribe","sink","promiseCtor","$4f562137a990678a$var$getPromiseCtor","subscription","pipe","operations","toPromise","$43504509ae7aa03d$export$f708eee25634bc80","$2d63f5ffe6ca8602$export$b6bbab5a9b109038","observers","hasError","thrownError","subject","$2d63f5ffe6ca8602$export$155189cde295587d","_throwIfClosed","copy_1","copy_1_1","shift","_checkFinalizedStatuses","_innerSubscribe","asObservable","_b","$992c4a42843eb1d0$export$871731df685d7753","$992c4a42843eb1d0$export$ebec8610810318c5","liftedSource","$3868f035248205c1$export$8fbbf0c4d80268e5","onNext","onError","onComplete","onUnsubscribe","err1","$9853a79d111e4e33$export$871de8747c9eaa88","project","$8821cb8787de9fb5$export$1e2f57719e155213","$9dcf7896928e75dd$export$4369c812aac99591","$0b89b4d4fb8bd3fd$export$6f58e2338da23f4d","$0ce5b91768be0a6d$export$b34673931371729a","scheduler","schedule","$0539b51af1903d0a$export$48c0cddbc99c45c2","$b8a13650b96f19ab$export$9652023d9040757","$7c74d6a5e2273447$export$edb10ab8dd75a915","$d63b3f5b704e6de4$export$7cbe71b9fa263484","$2fe2b696577919a5$export$6a9cfa3ebc765910","obs","$2fe2b696577919a5$export$4cb2acdbcda2c253","promise","asyncIterable","asyncIterable_1","$5c96a02c592fcff1$export$e3b29a3d6162315f","asyncIterable_1_1","$2fe2b696577919a5$var$process","array","$46964ba1b403cbfc$export$6b9f6c0d32c093f9","resultSelector","concurrent","Infinity","ii","onBeforeNext","expand","innerSubScheduler","additionalTeardown","buffer","active","isComplete","checkComplete","outerNext","doInnerSub","innerValue","bufferedValue","$9cbbbba4f565a378$export$600918ebaa9e0a1b","$e6cd63efe08c02de$var$isArray","$e6cd63efe08c02de$export$559affaa48f4288d","$e6cd63efe08c02de$var$callOrApply","$f65a851e0b190f66$var$nodeEventEmitterMethods","$f65a851e0b190f66$var$eventTargetMethods","$f65a851e0b190f66$var$jqueryMethods","$f65a851e0b190f66$export$a36e16046ae8f1bb","target","eventName","addEventListener","removeEventListener","$f65a851e0b190f66$var$isEventTarget","methodName","handler","addListener","removeListener","$f65a851e0b190f66$var$isNodeStyleEventEmitter","$f65a851e0b190f66$var$toCommonHandlerRegistry","on","off","$f65a851e0b190f66$var$isJQueryStyleEventEmitter","subTarget","$23f4931dce2b2382$export$29b6a97e6108bb8c","size","fillFunction","sizex","sizey","from","$d94f34763c85c462$export$693f861392be013b","direction","$dd7f0244e23b05f6$export$d0a9cd5a88c04e7c","subscriberList","read","write","attach","disposeAll","$1a196dc67116b847$export$b2d4a3a92f6476d4","$1a196dc67116b847$export$5af2835478688415","$9562acb571a1e828$export$842a2cf37af977e1","$76596671fee4e156$export$630b3f7014e81311","squareSize","bodyThickeness","bodyOffset","headSize","headOffset","foodSize","foodOffset","boardRightSide","boardBottom","canvas","gridSize","showMoveCount","tailPosition","tailPos","topology","ctx","getContext","$8b2d6df9c8354615$export$860b0424cb04a816","headPos","grid","pos","to","lastFoodPosition","renderBackground","fillStyle","fillRect","height","leftRight","topBottom","renderGrid","line","ky","square","kx","renderSquare","pair","pattern","renderFood","renderBody","renderHead","renderScore","score","moveCount","font","strokeStyle","displayText","snakeSize","yMove","text","lineWidth","strokeText","fillText","newHeadPos","headSquare","newHeadSquare","side","$d94f34763c85c462$export$3c915306cb7fc97a","reversedSide","$d94f34763c85c462$export$bc8c0d2937d38185","$d94f34763c85c462$export$ea71587c79ab5341","headPattern","newTailPos","tailSquare","newTailSquare","newTailPattern","console","log","window","canvasSize","available","ceil","resizeLayout","renderScreen","food","last","lastSquare","foodSquare","$78f078b7cc50459e$export$d80fffb1deb3b97e","keyboard","prop1","element","evPropName","onKeydownMap","onKeyupMap","eventHandler","closureName","onEventMap","ev","altKey","ctrlKey","shiftKey","preventDefault","handleKeydown","handleKeyup","onKeydown","onKeyup","onBoth","keydown","keyup","$ce9271695b6d1aba$export$289502818b8df325","document","documentElement","fingerMoveManager","getTouches","event","touches","originalEvent","xDown","yDown","handleTouchStart","evt","clientX","clientY","handleTouchMove","currentX","currentY","dx","dy","abs","directive","mouseIsDown","handleMouseDown","handleMouseMove","handleMouseUp","$980b4aacfe31969f$export$35cb6e3890086077","makeObservable","keyList","swipe","subS","subKList","subK","fmmDirective","removeAll","$8f13b60c0ee5b277$exports","JSON","parse","$864ea5d16c681f72$export$95fb6d2a52edc159","location","defaultConfig1","config1","pieceList","search","split","piece","valueList","defaultConfig","stackedConfig","conf","$22abcde661ea95b1$export$dda1d9f60106f0e9","name1","attribute","children","elem","createElement","setAttribute","child","appendChild","$5aa459ef79e2e0eb$export$9bf682d1e06fd6ea","match","$15cdec2ac6ae6cc6$var$getConfig","feed","toUpperCase","topologyLeftRight","topologyTopBottom","ai","$15cdec2ac6ae6cc6$export$2cd8252107eb640b","corner","innerHTML","repositoryUrl","repository","append","textContent","title","className","getter","innerHeight","innerWidth","spaceLessURL","href","replace","$864ea5d16c681f72$export$9536f3c38aae61ee","screenSize","$parcel$interopDefault","engine","feedTarget","gridSquareNumber","player","headSubject","tailSubject","feedCount","delta","newHead","jumping","inboundY","inboundX","scoring","tail","nextFoodPosition","feedingFoodPosition","randomFoodPosition","head","directionList","availablePos","filter","valid","nonLeftPos","optionCount","foodPosition","some","$5e4887ab0f41b4f0$export$3f0b0800cb866b8e","$fe0761e99156ab08$export$3e9f948b41964866","display","getTail","handleFood","handleScore","resizeScreen","flushInit","$ad2bcec7a0192558$export$f22da7240b7add18"],"version":3,"file":"index.09da53c8.js.map"}