{"version":3,"file":"gmaps.js","mappings":";6gCAoBA,SAASA,EAAOC,EAAGC,GACf,IAAIC,EAAI,CAAC,EACT,IAAK,IAAIC,KAAKH,EAAOI,OAAOC,UAAUC,eAAeC,KAAKP,EAAGG,IAAMF,EAAEO,QAAQL,GAAK,IAC9ED,EAAEC,GAAKH,EAAEG,IACb,GAAS,MAALH,GAAqD,mBAAjCI,OAAOK,sBACtB,KAAIC,EAAI,EAAb,IAAgBP,EAAIC,OAAOK,sBAAsBT,GAAIU,EAAIP,EAAEQ,OAAQD,IAC3DT,EAAEO,QAAQL,EAAEO,IAAM,GAAKN,OAAOC,UAAUO,qBAAqBL,KAAKP,EAAGG,EAAEO,MACvER,EAAEC,EAAEO,IAAMV,EAAEG,EAAEO,IAF4B,CAItD,OAAOR,CACX,CAE2B,mBAApBW,iBAAiCA,gBAwBxC,MAAMC,EACF,gCAAOC,CAA0BC,GAC7B,OAAQC,OAAOC,KAAKC,SACwC,IAAxDH,EAAII,qBAAqBC,0BACjC,CACA,uBAAOC,CAAiBH,GACpB,OAAQF,OAAOC,KAAKC,QAChBA,aAAkBF,OAAOC,KAAKC,OAAOI,qBAC7C,CACA,aAAOC,CAAOL,EAAQH,GACdS,KAAKH,iBAAiBH,GACtBA,EAAOH,IAAMA,EAGbG,EAAOK,OAAOR,EAEtB,CACA,kBAAOU,CAAYP,GAEf,GAAIM,KAAKH,iBAAiBH,GAAS,CAC/B,GAAIA,EAAOQ,SAAU,CACjB,GAAIR,EAAOQ,oBAAoBV,OAAOC,KAAKU,OACvC,OAAOT,EAAOQ,SAGlB,GAAIE,OAAOC,SAASX,EAAOQ,SAASI,MAChCF,OAAOC,SAASX,EAAOQ,SAASK,KAChC,OAAO,IAAIf,OAAOC,KAAKU,OAAOT,EAAOQ,SAASI,IAAKZ,EAAOQ,SAASK,IAE3E,CAEA,OAAO,IAAIf,OAAOC,KAAKU,OAAO,KAClC,CACA,OAAOT,EAAOO,aAClB,CACA,iBAAOO,CAAWd,GACd,QAAIM,KAAKH,iBAAiBH,IAUnBA,EAAOc,YAClB,EAkBJ,MAAMC,EACF,WAAAC,EAAY,QAAEC,EAAO,SAAET,IACnBF,KAAKW,QAAU,GACXA,IACAX,KAAKW,QAAUA,GACfT,IACIA,aAAoBV,OAAOC,KAAKU,OAChCH,KAAKY,UAAYV,EAGjBF,KAAKY,UAAY,IAAIpB,OAAOC,KAAKU,OAAOD,GAGpD,CACA,UAAIW,GACA,GAA4B,IAAxBb,KAAKW,QAAQzB,SAAiBc,KAAKY,UACnC,OAEJ,MAAMC,EAAS,IAAIrB,OAAOC,KAAKqB,aAAad,KAAKY,UAAWZ,KAAKY,WACjE,IAAK,MAAMlB,KAAUM,KAAKW,QACtBE,EAAOE,OAAO1B,EAAYY,YAAYP,IAE1C,OAAOmB,CACX,CACA,YAAIX,GAEA,OAAOF,KAAKY,WAAaZ,KAAKa,OAAOG,WACzC,CAIA,SAAIC,GACA,OAAOjB,KAAKW,QAAQO,OAAQC,GAAM9B,EAAYmB,WAAWW,IAAIjC,MACjE,CAIA,IAAAkC,CAAK1B,GACDM,KAAKW,QAAQS,KAAK1B,EACtB,CAIA,SACQM,KAAKN,SACLL,EAAYU,OAAOC,KAAKN,OAAQ,MAChCM,KAAKN,YAAS2B,GAElBrB,KAAKW,QAAQzB,OAAS,CAC1B,EAyBJ,SAASoC,EAAcC,EAAOC,EAAU,oBACpC,GAAID,QACA,MAAME,MAAMD,EAEpB,CA0BA,MAAME,EAAgC,CAACnC,EAAKoC,EAAqBhB,EAASiB,KACtE,MAAMf,EAAStB,EAAIsC,YACnBP,EAAcT,GACd,MAAMiB,EAAoBC,EAA6BlB,EAAQc,EAAqBC,GACpF,OAAOjB,EAAQO,OAAQxB,GAAWoC,EAAkBE,SAAS3C,EAAYY,YAAYP,MAKnFqC,EAA+B,CAAClB,EAAQoB,EAAYC,KACtD,MAAM,UAAEC,EAAS,UAAEC,GAAcC,EAA0BxB,EAAQoB,GAC7DK,EAAsBC,EAAkB,CAAEJ,YAAWC,aAAaF,GACxE,OAAOM,EAA0BF,EAAqBL,IAKpDQ,EAAoB,CAAC5B,EAAQoB,EAAYS,KAC3C,MAAMC,EAAWZ,EAA6BlB,EAAQoB,EAAYS,GAC5DE,EAAKD,EAASE,eACdC,EAAKH,EAASI,eACpB,MAAO,CAACD,EAAGvC,MAAOuC,EAAGxC,MAAOsC,EAAGrC,MAAOqC,EAAGtC,QAOvC0C,EAAwB,CAACC,EAAIC,KAC/B,MACMC,GAASD,EAAG5C,IAAM2C,EAAG3C,KAAO8C,KAAKC,GAAM,IACvCC,GAASJ,EAAG3C,IAAM0C,EAAG1C,KAAO6C,KAAKC,GAAM,IACvCE,EAAUH,KAAKI,IAAIL,EAAO,GAC1BM,EAAUL,KAAKI,IAAIF,EAAO,GAC1BI,EAAIH,EAAUA,EAChBH,KAAKO,IAAKV,EAAG3C,IAAM8C,KAAKC,GAAM,KAC1BD,KAAKO,IAAKT,EAAG5C,IAAM8C,KAAKC,GAAM,KAC9BI,EACAA,EAER,OAXU,MAUA,EAAIL,KAAKQ,MAAMR,KAAKS,KAAKH,GAAIN,KAAKS,KAAK,EAAIH,MAQnDrB,EAA4B,CAACxB,EAAQoB,KACvC,MAAME,EAAYF,EAAW6B,qBAAqBjD,EAAOgC,gBACnDT,EAAYH,EAAW6B,qBAAqBjD,EAAOkC,gBAGzD,OAFAzB,EAAca,GACdb,EAAcc,GACP,CAAED,YAAWC,cAOlBG,EAAoB,EAAGJ,YAAWC,aAAaF,KACjDC,EAAU4B,GAAK7B,EACfC,EAAU6B,GAAK9B,EACfE,EAAU2B,GAAK7B,EACfE,EAAU4B,GAAK9B,EACR,CAAEC,YAAWC,cAKlBI,EAA4B,EAAGL,YAAWC,aAAaH,KACzD,MAAMa,EAAKb,EAAWgC,qBAAqB7B,GACrCQ,EAAKX,EAAWgC,qBAAqB9B,GAC3C,OAAO,IAAI3C,OAAOC,KAAKqB,aAAagC,EAAIF,IAqB5C,MAAMsB,EACF,WAAAxD,EAAY,QAAEyD,EAAU,KACpBnE,KAAKmE,QAAUA,CACnB,CAaA,IAAAC,EAAK,QAAEzD,IACH,OAAOyD,EAAKzD,EAChB,EAQJ,MAAM0D,UAAkCH,EACpC,WAAAxD,CAAY4D,GACR,IAAI,gBAAEC,EAAkB,IAAOD,EAC/BE,MAD6ClG,EAAOgG,EAAI,CAAC,qBAEzDtE,KAAKuE,gBAAkB,GACvBvE,KAAKuE,gBAAkBA,CAC3B,CACA,SAAAE,EAAU,QAAE9D,EAAO,IAAEpB,EAAG,oBAAEoC,IACtB,MAAM+C,EAAOnF,EAAIoF,UAEjB,OADArD,EAAcoD,GACVA,GAAQ1E,KAAKmE,QACN,CACHS,SAAU5E,KAAKoE,KAAK,CAChBzD,YAEJkE,SAAS,GAGV,CACHD,SAAU5E,KAAK8E,QAAQ,CACnBnE,QAASe,EAA8BnC,EAAKoC,EAAqBhB,EAASX,KAAKuE,iBAC/EhF,MACAoC,wBAGZ,EAKJ,MAAMyC,EAAQzD,GACOA,EAAQpB,IAAKG,GAAW,IAAIe,EAAQ,CACjDP,SAAUb,EAAYY,YAAYP,GAClCiB,QAAS,CAACjB,MA2BlB,MAAMqF,UAAsBV,EACxB,WAAA3D,CAAY4D,GACR,IAAI,YAAEU,EAAc,IAAK,SAAEC,EAAW,IAAOX,EAC7CE,MAD2DlG,EAAOgG,EAAI,CAAC,cAAe,cAEtFtE,KAAK4E,SAAW,GAChB5E,KAAKkF,MAAQ,CAAER,MAAO,GACtB1E,KAAKgF,YAAcA,EACnBhF,KAAKiF,SAAWA,CACpB,CACA,SAAAR,EAAU,QAAE9D,EAAO,IAAEpB,EAAG,oBAAEoC,IACtB,MAAM+C,EAAOnF,EAAIoF,UACjBrD,EAAcoD,GACd,MAAMS,EAAW,CAAET,QACnB,IAAIG,GAAU,EAMd,OALI7E,KAAKkF,MAAMR,MAAQ1E,KAAKmE,SAAWgB,EAAST,MAAQ1E,KAAKmE,UAEzDU,IAAW,IAAAO,WAAUpF,KAAKkF,MAAOC,IAErCnF,KAAKkF,MAAQC,EACTT,GAAQ1E,KAAKmE,QACN,CACHS,SAAU5E,KAAKoE,KAAK,CAAEzD,YACtBkE,WAGD,CACHD,SAAU5E,KAAK8E,QAAQ,CACnBnE,QAASe,EAA8BnC,EAAKoC,EAAqBhB,EAASX,KAAKuE,iBAC/EhF,MACAoC,wBAGZ,CACA,OAAAmD,EAAQ,QAAEnE,EAAO,IAAEpB,EAAG,oBAAEoC,IAKpB,OAJA3B,KAAK4E,SAAW,GAChBjE,EAAQ0E,QAAS3F,IACbM,KAAKsF,oBAAoB5F,EAAQH,EAAKoC,KAEnC3B,KAAK4E,QAChB,CACA,mBAAAU,CAAoB5F,EAAQH,EAAK0C,GAC7B,IAAI+C,EAAchF,KAAKgF,YACnBF,EAAU,KACd,IAAK,IAAI7F,EAAI,EAAGA,EAAIe,KAAK4E,SAAS1F,OAAQD,IAAK,CAC3C,MAAMsG,EAAYvF,KAAK4E,SAAS3F,GAChCqC,EAAciE,EAAU1E,QACxB,MAAM2E,EAAWxC,EAAsBuC,EAAU1E,OAAOG,YAAYyE,SAAUpG,EAAYY,YAAYP,GAAQ+F,UAC1GD,EAAWR,IACXA,EAAcQ,EACdV,EAAUS,EAElB,CACA,GAAIT,EAEA,GADAxD,EAAcwD,EAAQjE,QAClBkB,EAA6B+C,EAAQjE,OAAQoB,EAAYjC,KAAKiF,UAAUjD,SAAS3C,EAAYY,YAAYP,IACzGoF,EAAQ1D,KAAK1B,OAEZ,CACD,MAAMoF,EAAU,IAAIrE,EAAQ,CAAEE,QAAS,CAACjB,KACxCM,KAAK4E,SAASxD,KAAK0D,EACvB,KAEC,CACD,MAAMA,EAAU,IAAIrE,EAAQ,CAAEE,QAAS,CAACjB,KACxCM,KAAK4E,SAASxD,KAAK0D,EACvB,CACJ,EAqBJ,MAAMY,UAAsBxB,EACxB,WAAAxD,CAAY4D,GAERE,MADclG,EAAOgG,EAAI,IAE7B,CACA,SAAAG,EAAU,QAAE9D,EAAO,IAAEpB,EAAG,oBAAEoC,IACtB,MAAO,CACHiD,SAAU5E,KAAK8E,QAAQ,CAAEnE,UAASpB,MAAKoC,wBACvCkD,SAAS,EAEjB,CACA,OAAAC,CAAQa,GACJ,OAAO3F,KAAKoE,KAAKuB,EACrB,EAuBJ,MAAMC,UAA8B1B,EAChC,WAAAxD,CAAY4D,GACR,IAAI,QAAEH,EAAO,OAAE0B,EAAS,IAAOvB,EAAIwB,EAAUxH,EAAOgG,EAAI,CAAC,UAAW,WACpEE,MAAM,CAAEL,YACRnE,KAAKW,QAAU,GACfX,KAAK4E,SAAW,GAChB5E,KAAKkF,MAAQ,CAAER,MAAO,GACtB1E,KAAK+F,aAAe,IAAI,UAAapH,OAAOqH,OAAO,CAAE7B,QAASnE,KAAKmE,QAAS0B,UAAUC,GAC1F,CACA,SAAArB,CAAUkB,GACN,IAAId,GAAU,EACVH,EAAOiB,EAAMpG,IAAIoF,UACrBrD,EAAcoD,GACdA,EAAOtB,KAAK6C,MAAMvB,GAClB,MAAMQ,EAAQ,CAAER,KAAMA,GACtB,KAAK,IAAAU,WAAUO,EAAMhF,QAASX,KAAKW,SAAU,CACzCkE,GAAU,EAEV7E,KAAKW,QAAU,IAAIgF,EAAMhF,SACzB,MAAMuF,EAASlG,KAAKW,QAAQpB,IAAKG,IAC7B,MAAMQ,EAAWb,EAAYY,YAAYP,GAEzC,MAAO,CACHyG,KAAM,UACNC,SAAU,CAAED,KAAM,QAASE,YAHX,CAACnG,EAASK,MAAOL,EAASI,QAI1CgG,WAAY,CAAE5G,aAGtBM,KAAK+F,aAAaQ,KAAKL,EAC3B,CAQA,OAPKrB,IACG7E,KAAKkF,MAAMR,MAAQ1E,KAAKmE,SAAWe,EAAMR,MAAQ1E,KAAKmE,WACtDU,IAAW,IAAAO,WAAUpF,KAAKkF,MAAOA,IAGzClF,KAAKkF,MAAQA,EAEgB,IAAzBS,EAAMhF,QAAQzB,QACdc,KAAK4E,SAAW,GACT,CAAEA,SAAU5E,KAAK4E,SAAUC,aAElCA,IACA7E,KAAK4E,SAAW5E,KAAK8E,QAAQa,IAE1B,CAAEf,SAAU5E,KAAK4E,SAAUC,WACtC,CACA,OAAAC,EAAQ,IAAEvF,IACN,MAAMmF,EAAOnF,EAAIoF,UAEjB,OADArD,EAAcoD,GACP1E,KAAK+F,aACPS,YAAY,EAAE,KAAM,GAAI,IAAK,IAAKpD,KAAK6C,MAAMvB,IAC7CnF,IAAKkH,GAAYzG,KAAK0G,iBAAiBD,GAChD,CACA,gBAAAC,EAAmBN,UAAYC,aAAc9F,EAAKD,IAAO,WAAEgG,IACvD,GAAIA,EAAWxB,QACX,OAAO,IAAIrE,EAAQ,CACfE,QAASX,KAAK+F,aACTY,UAAUL,EAAWM,WAAYC,KACjCtH,IAAKuH,GAASA,EAAKR,WAAW5G,QACnCQ,SAAU,CAAEI,MAAKC,SAGzB,MAAMb,EAAS4G,EAAW5G,OAC1B,OAAO,IAAIe,EAAQ,CACfE,QAAS,CAACjB,GACVQ,SAAUb,EAAYY,YAAYP,IAE1C,EAuBJ,MAAMqH,UAAsC1C,EACxC,WAAA3D,CAAY4D,GACR,IAAI,QAAEH,EAAO,OAAE0B,EAAS,GAAE,gBAAEtB,EAAkB,IAAOD,EAAIwB,EAAUxH,EAAOgG,EAAI,CAAC,UAAW,SAAU,oBACpGE,MAAM,CAAEL,UAASI,oBACjBvE,KAAKW,QAAU,GACfX,KAAK4E,SAAW,GAChB5E,KAAK+F,aAAe,IAAI,UAAapH,OAAOqH,OAAO,CAAE7B,QAASnE,KAAKmE,QAAS0B,UAAUC,IACtF9F,KAAKkF,MAAQ,CAAER,MAAO,EAAGsC,KAAM,CAAC,EAAG,EAAG,EAAG,GAC7C,CACA,SAAAvC,CAAUkB,GACN,MAAMT,EAAQlF,KAAKiH,iBAAiBtB,GACpC,IAAId,IAAW,IAAAO,WAAUpF,KAAKkF,MAAOA,GACrC,KAAK,IAAAE,WAAUO,EAAMhF,QAASX,KAAKW,SAAU,CACzCkE,GAAU,EAEV7E,KAAKW,QAAU,IAAIgF,EAAMhF,SACzB,MAAMuF,EAASlG,KAAKW,QAAQpB,IAAKG,IAC7B,MAAMQ,EAAWb,EAAYY,YAAYP,GAEzC,MAAO,CACHyG,KAAM,UACNC,SAAU,CACND,KAAM,QACNE,YALY,CAACnG,EAASK,MAAOL,EAASI,QAO1CgG,WAAY,CAAE5G,aAGtBM,KAAK+F,aAAaQ,KAAKL,EAC3B,CAKA,OAJIrB,IACA7E,KAAK4E,SAAW5E,KAAK8E,QAAQa,GAC7B3F,KAAKkF,MAAQA,GAEV,CAAEN,SAAU5E,KAAK4E,SAAUC,UACtC,CACA,OAAAC,CAAQa,GAEJ,MAAMT,EAAQlF,KAAKiH,iBAAiBtB,GACpC,OAAO3F,KAAK+F,aACPS,YAAYtB,EAAM8B,KAAM9B,EAAMR,MAC9BnF,IAAKkH,GAAYzG,KAAK0G,iBAAiBD,GAChD,CACA,gBAAAC,EAAmBN,UAAYC,aAAc9F,EAAKD,IAAO,WAAEgG,IACvD,GAAIA,EAAWxB,QACX,OAAO,IAAIrE,EAAQ,CACfE,QAASX,KAAK+F,aACTY,UAAUL,EAAWM,WAAYC,KACjCtH,IAAKuH,GAASA,EAAKR,WAAW5G,QACnCQ,SAAU,CAAEI,MAAKC,SAGzB,MAAMb,EAAS4G,EAAW5G,OAC1B,OAAO,IAAIe,EAAQ,CACfE,QAAS,CAACjB,GACVQ,SAAUb,EAAYY,YAAYP,IAE1C,CACA,gBAAAuH,CAAiBtB,GACb,MAAMuB,EAAUvB,EAAMpG,IAAIoF,UACpBwC,EAAYxB,EAAMpG,IAAIsC,YAG5B,OAFAP,EAAc4F,GACd5F,EAAc6F,GACP,CACHzC,KAAMtB,KAAK6C,MAAMiB,GACjBF,KAAMvE,EAAkB0E,EAAWxB,EAAMhE,oBAAqB3B,KAAKuE,iBAE3E,EAqBJ,MAAM6C,EACF,WAAA1G,CAAYC,EAASiE,GACjB5E,KAAKW,QAAU,CAAE0G,IAAK1G,EAAQzB,QAC9B,MAAMoI,EAAsB1C,EAASrF,IAAKmE,GAAMA,EAAEzC,OAC5CsG,EAAmBD,EAAoBE,OAAO,CAAC9D,EAAG+D,IAAM/D,EAAI+D,EAAG,GACrEzH,KAAK4E,SAAW,CACZ3D,MAAO2D,EAAS1F,OAChByB,QAAS,CACL+G,KAAMH,EAAmB3C,EAAS1F,OAClCmI,IAAKE,EACLI,IAAKvE,KAAKuE,OAAOL,GACjBM,IAAKxE,KAAKwE,OAAON,IAG7B,EAEJ,MAAMO,EAuCF,MAAAC,EAAO,MAAE7G,EAAK,SAAEf,GAAY6H,EAAOxI,GAE/B,MAEMyI,EAAM,cAFE/G,EAAQmC,KAAKwE,IAAI,GAAIG,EAAMnD,SAASjE,QAAQ+G,MAAQ,UAAY,oYAMyDzG,mBAEjIgH,EAAQ,cAAchH,YAE5BiH,EAAS9H,OAAOZ,OAAOC,KAAK0I,OAAOC,YAAcnH,EACjD,GAAI5B,EAAYC,0BAA0BC,GAAM,CAE5C,MACM8I,GADS,IAAIC,WACEC,gBAAgBP,EAAK,iBAAiBQ,gBAC3DH,EAAMI,aAAa,YAAa,mBAChC,MAAMC,EAAiB,CACnBnJ,MACAW,WACAgI,SACAD,QACAU,QAASN,GAEb,OAAO,IAAI7I,OAAOC,KAAKC,OAAOI,sBAAsB4I,EACxD,CACA,MAAMA,EAAiB,CACnBxI,WACAgI,SACAD,QACAW,KAAM,CACFC,IAAK,6BAA6BC,KAAKd,KACvCe,OAAQ,IAAIvJ,OAAOC,KAAKuJ,MAAM,GAAI,MAG1C,OAAO,IAAIxJ,OAAOC,KAAK0I,OAAOO,EAClC,EAqCJ,MAAMO,EACF,WAAAvI,IAZJ,SAAgBwI,EAAOC,GAGnB,IAAK,IAAIC,KAAYD,EAAMvK,UACvBsK,EAAMtK,UAAUwK,GAAYD,EAAMvK,UAAUwK,EAEpD,CAYQrI,CAAOkI,EAAiBzJ,OAAOC,KAAK4J,YACxC,EAkBJ,IAAIC,GACJ,SAAWA,GACPA,EAAwC,iBAAI,kBAC5CA,EAAsC,eAAI,gBAC1CA,EAAqC,cAAI,QACzCA,EAAiC,UAAI,WACxC,CALD,CAKGA,IAA0BA,EAAwB,CAAC,IACtD,MAAMC,EAA+B,CAACC,EAAG1E,EAASvF,KAC1CuF,EAAQjE,QACRtB,EAAIkK,UAAU3E,EAAQjE,SAO9B,MAAM6I,UAAwBT,EAC1B,WAAAvI,EAAY,IAAEnB,EAAG,QAAEoB,EAAU,GAAE,iBAAEgJ,EAAmB,CAAC,EAAC,UAAEC,EAAY,IAAIhE,EAAsB+D,GAAiB,SAAEE,EAAW,IAAIhC,EAAiB,eAAEiC,EAAiBP,IAChK/E,QAEAxE,KAAKT,IAAM,KACXS,KAAK+J,aAAe,KACpB/J,KAAKW,QAAU,IAAIA,GACnBX,KAAK4E,SAAW,GAChB5E,KAAK4J,UAAYA,EACjB5J,KAAK6J,SAAWA,EAChB7J,KAAK8J,eAAiBA,EAClBvK,GACAS,KAAKD,OAAOR,EAEpB,CACA,SAAAyK,CAAUtK,EAAQuK,GACVjK,KAAKW,QAAQuJ,SAASxK,KAG1BM,KAAKW,QAAQS,KAAK1B,GACbuK,GACDjK,KAAK8H,SAEb,CACA,UAAAqC,CAAWxJ,EAASsJ,GAChBtJ,EAAQ0E,QAAS3F,IACbM,KAAKgK,UAAUtK,GAAQ,KAEtBuK,GACDjK,KAAK8H,QAEb,CACA,YAAAsC,CAAa1K,EAAQuK,GACjB,MAAMI,EAAQrK,KAAKW,QAAQ5B,QAAQW,GACnC,OAAe,IAAX2K,IAIJhL,EAAYU,OAAOL,EAAQ,MAC3BM,KAAKW,QAAQ2J,OAAOD,EAAO,GACtBJ,GACDjK,KAAK8H,UAEF,EACX,CACA,aAAAyC,CAAc5J,EAASsJ,GACnB,IAAIO,GAAU,EAOd,OANA7J,EAAQ0E,QAAS3F,IACb8K,EAAUxK,KAAKoK,aAAa1K,GAAQ,IAAS8K,IAE7CA,IAAYP,GACZjK,KAAK8H,SAEF0C,CACX,CACA,YAAAC,CAAaR,GACTjK,KAAKW,QAAQzB,OAAS,EACjB+K,GACDjK,KAAK8H,QAEb,CAIA,MAAAA,GACI,MAAMvI,EAAMS,KAAK0K,SACjB,GAAInL,aAAeC,OAAOC,KAAKkL,KAAOpL,EAAIqL,gBAAiB,CACvDpL,OAAOC,KAAKoL,MAAMC,QAAQ9K,KAAMsJ,EAAsByB,iBAAkB/K,MACxE,MAAM,SAAE4E,EAAQ,QAAEC,GAAY7E,KAAK4J,UAAUnF,UAAU,CACnD9D,QAASX,KAAKW,QACdpB,MACAoC,oBAAqB3B,KAAK4K,kBAG9B,GAAI/F,GAAsBxD,MAAXwD,EAAsB,CAIjC,MAAMmG,EAAe,IAAIC,IACzB,IAAK,MAAMnG,KAAWF,EACY,GAA1BE,EAAQnE,QAAQzB,QAChB8L,EAAaE,IAAIpG,EAAQnE,QAAQ,IAGzC,MAAMwK,EAAe,GAErB,IAAK,MAAMrG,KAAW9E,KAAK4E,SACD,MAAlBE,EAAQpF,SAGkB,GAA1BoF,EAAQnE,QAAQzB,OACX8L,EAAaI,IAAItG,EAAQpF,SAI1BL,EAAYU,OAAO+E,EAAQpF,OAAQ,MAKvCyL,EAAa/J,KAAK0D,EAAQpF,SAGlCM,KAAK4E,SAAWA,EAChB5E,KAAKqL,iBAELC,sBAAsB,IAAMH,EAAa9F,QAAS3F,GAAWL,EAAYU,OAAOL,EAAQ,OAC5F,CACAF,OAAOC,KAAKoL,MAAMC,QAAQ9K,KAAMsJ,EAAsBiC,eAAgBvL,KAC1E,CACJ,CACA,KAAAwL,GACI,MAAMjM,EAAMS,KAAK0K,SACjBpJ,EAAc/B,GACdS,KAAK+J,aAAexK,EAAIkM,YAAY,OAAQzL,KAAK8H,OAAO4D,KAAK1L,OAC7DA,KAAK8H,QACT,CACA,QAAA6D,GACQ3L,KAAK+J,cACLvK,OAAOC,KAAKoL,MAAMe,eAAe5L,KAAK+J,cAC1C/J,KAAK6L,OACT,CACA,KAAAA,GACI7L,KAAKW,QAAQ0E,QAAS3F,GAAWL,EAAYU,OAAOL,EAAQ,OAC5DM,KAAK4E,SAASS,QAASP,GAAYA,EAAQgH,UAC3C9L,KAAK4E,SAAW,EACpB,CACA,cAAAyG,GAEI,MAAMtD,EAAQ,IAAIX,EAAapH,KAAKW,QAASX,KAAK4E,UAC5CrF,EAAMS,KAAK0K,SACjB1K,KAAK4E,SAASS,QAASP,IACnB,GAA+B,IAA3BA,EAAQnE,QAAQzB,OAChB4F,EAAQpF,OAASoF,EAAQnE,QAAQ,QAOjC,GAHAmE,EAAQpF,OAASM,KAAK6J,SAAS/B,OAAOhD,EAASiD,EAAOxI,GAEtDuF,EAAQnE,QAAQ0E,QAAS3F,GAAWL,EAAYU,OAAOL,EAAQ,OAC3DM,KAAK8J,eAAgB,CAErB,MAAMiC,EAAuB1M,EAAYQ,iBAAiBiF,EAAQpF,QAC5D4J,EAAsB0C,UACtB1C,EAAsB2C,cAC5BnH,EAAQpF,OAAO+L,YAAYM,EAE1BlB,IACGrL,OAAOC,KAAKoL,MAAMC,QAAQ9K,KAAMsJ,EAAsB2C,cAAenH,GACrE9E,KAAK8J,eAAee,EAAO/F,EAASvF,IAE5C,CAEJF,EAAYU,OAAO+E,EAAQpF,OAAQH,IAE3C,E,8dCvgCJ,IAAI2M,EAAsBvN,OAAOuN,oBAAqBlN,EAAwBL,OAAOK,sBACjFH,EAAiBF,OAAOC,UAAUC,eAItC,SAASsN,EAAmBC,EAAaC,GACrC,OAAO,SAAiB3I,EAAG+D,EAAGvC,GAC1B,OAAOkH,EAAY1I,EAAG+D,EAAGvC,IAAUmH,EAAY3I,EAAG+D,EAAGvC,EACzD,CACJ,CAMA,SAASoH,EAAiBC,GACtB,OAAO,SAAoB7I,EAAG+D,EAAGvC,GAC7B,IAAKxB,IAAM+D,GAAkB,iBAAN/D,GAA+B,iBAAN+D,EAC5C,OAAO8E,EAAc7I,EAAG+D,EAAGvC,GAE/B,IAAIsH,EAAQtH,EAAMsH,MACdC,EAAUD,EAAME,IAAIhJ,GACpBiJ,EAAUH,EAAME,IAAIjF,GACxB,GAAIgF,GAAWE,EACX,OAAOF,IAAYhF,GAAKkF,IAAYjJ,EAExC8I,EAAMI,IAAIlJ,EAAG+D,GACb+E,EAAMI,IAAInF,EAAG/D,GACb,IAAImJ,EAASN,EAAc7I,EAAG+D,EAAGvC,GAGjC,OAFAsH,EAAMV,OAAOpI,GACb8I,EAAMV,OAAOrE,GACNoF,CACX,CACJ,CAWA,SAASC,EAAoBC,GACzB,OAAOb,EAAoBa,GAAQC,OAAOhO,EAAsB+N,GACpE,CAIA,IAAIE,EAEJtO,OAAOsO,QACH,SAAWF,EAAQ3D,GACf,OAAOvK,EAAeC,KAAKiO,EAAQ3D,EACtC,EAIL,SAAS8D,EAAmBxJ,EAAG+D,GAC3B,OAAO/D,IAAM+D,IAAO/D,IAAM+D,GAAK/D,GAAMA,GAAK+D,GAAMA,CACpD,CAEA,IAAI0F,EAAe,MACfC,EAAe,MACfC,EAAc,SACdC,EAA2B3O,OAAO2O,yBAA0BC,EAAO5O,OAAO4O,KAI9E,SAASC,EAAe9J,EAAG+D,EAAGvC,GAC1B,IAAImF,EAAQ3G,EAAExE,OACd,GAAIuI,EAAEvI,SAAWmL,EACb,OAAO,EAEX,KAAOA,KAAU,GACb,IAAKnF,EAAMuI,OAAO/J,EAAE2G,GAAQ5C,EAAE4C,GAAQA,EAAOA,EAAO3G,EAAG+D,EAAGvC,GACtD,OAAO,EAGf,OAAO,CACX,CAIA,SAASwI,EAAchK,EAAG+D,GACtB,OAAOyF,EAAmBxJ,EAAEiK,UAAWlG,EAAEkG,UAC7C,CAIA,SAASC,EAAelK,EAAG+D,GACvB,OAAQ/D,EAAEmK,OAASpG,EAAEoG,MACjBnK,EAAElC,UAAYiG,EAAEjG,SAChBkC,EAAEoK,QAAUrG,EAAEqG,OACdpK,EAAEqK,QAAUtG,EAAEsG,KACtB,CAIA,SAASC,EAAkBtK,EAAG+D,GAC1B,OAAO/D,IAAM+D,CACjB,CAIA,SAASwG,EAAavK,EAAG+D,EAAGvC,GACxB,IAAIgJ,EAAOxK,EAAEwK,KACb,GAAIA,IAASzG,EAAEyG,KACX,OAAO,EAEX,IAAKA,EACD,OAAO,EAQX,IANA,IAEIC,EACAC,EAHAC,EAAiB,IAAIC,MAAMJ,GAC3BK,EAAY7K,EAAE8K,UAGdnE,EAAQ,GAEJ8D,EAAUI,EAAUE,UACpBN,EAAQO,MADqB,CAQjC,IAJA,IAAIC,EAAYlH,EAAE+G,UACdI,GAAW,EACXC,EAAa,GAETT,EAAUO,EAAUF,UACpBL,EAAQM,MAGZ,GAAIL,EAAeQ,GACfA,QADJ,CAIA,IAAIC,EAASX,EAAQ5M,MACjBwN,EAASX,EAAQ7M,MACrB,GAAI2D,EAAMuI,OAAOqB,EAAO,GAAIC,EAAO,GAAI1E,EAAOwE,EAAYnL,EAAG+D,EAAGvC,IAC5DA,EAAMuI,OAAOqB,EAAO,GAAIC,EAAO,GAAID,EAAO,GAAIC,EAAO,GAAIrL,EAAG+D,EAAGvC,GAAQ,CACvE0J,EAAWP,EAAeQ,IAAc,EACxC,KACJ,CACAA,GARA,CAUJ,IAAKD,EACD,OAAO,EAEXvE,GACJ,CACA,OAAO,CACX,CAIA,IAAI2E,EAAkB9B,EAItB,SAAS+B,EAAgBvL,EAAG+D,EAAGvC,GAC3B,IAAIoB,EAAaiH,EAAK7J,GAClB2G,EAAQ/D,EAAWpH,OACvB,GAAIqO,EAAK9F,GAAGvI,SAAWmL,EACnB,OAAO,EAMX,KAAOA,KAAU,GACb,IAAK6E,EAAgBxL,EAAG+D,EAAGvC,EAAOoB,EAAW+D,IACzC,OAAO,EAGf,OAAO,CACX,CAIA,SAAS8E,EAAsBzL,EAAG+D,EAAGvC,GACjC,IAKIkE,EACAgG,EACAC,EAPA/I,EAAawG,EAAoBpJ,GACjC2G,EAAQ/D,EAAWpH,OACvB,GAAI4N,EAAoBrF,GAAGvI,SAAWmL,EAClC,OAAO,EASX,KAAOA,KAAU,GAAG,CAEhB,IAAK6E,EAAgBxL,EAAG+D,EAAGvC,EAD3BkE,EAAW9C,EAAW+D,IAElB,OAAO,EAIX,GAFA+E,EAAc9B,EAAyB5J,EAAG0F,GAC1CiG,EAAc/B,EAAyB7F,EAAG2B,IACrCgG,GAAeC,MACdD,IACGC,GACDD,EAAYE,eAAiBD,EAAYC,cACzCF,EAAYG,aAAeF,EAAYE,YACvCH,EAAYI,WAAaH,EAAYG,UACzC,OAAO,CAEf,CACA,OAAO,CACX,CAIA,SAASC,EAA0B/L,EAAG+D,GAClC,OAAOyF,EAAmBxJ,EAAEgM,UAAWjI,EAAEiI,UAC7C,CAIA,SAASC,EAAgBjM,EAAG+D,GACxB,OAAO/D,EAAEkM,SAAWnI,EAAEmI,QAAUlM,EAAEmM,QAAUpI,EAAEoI,KAClD,CAIA,SAASC,EAAapM,EAAG+D,EAAGvC,GACxB,IAAIgJ,EAAOxK,EAAEwK,KACb,GAAIA,IAASzG,EAAEyG,KACX,OAAO,EAEX,IAAKA,EACD,OAAO,EAOX,IALA,IAEIC,EACAC,EAHAC,EAAiB,IAAIC,MAAMJ,GAC3BK,EAAY7K,EAAEqM,UAIV5B,EAAUI,EAAUE,UACpBN,EAAQO,MADqB,CAQjC,IAJA,IAAIC,EAAYlH,EAAEsI,SACdnB,GAAW,EACXC,EAAa,GAETT,EAAUO,EAAUF,UACpBL,EAAQM,MADqB,CAIjC,IAAKL,EAAeQ,IAChB3J,EAAMuI,OAAOU,EAAQ5M,MAAO6M,EAAQ7M,MAAO4M,EAAQ5M,MAAO6M,EAAQ7M,MAAOmC,EAAG+D,EAAGvC,GAAQ,CACvF0J,EAAWP,EAAeQ,IAAc,EACxC,KACJ,CACAA,GACJ,CACA,IAAKD,EACD,OAAO,CAEf,CACA,OAAO,CACX,CAIA,SAASoB,EAAoBtM,EAAG+D,GAC5B,IAAI4C,EAAQ3G,EAAExE,OACd,GAAIuI,EAAEvI,SAAWmL,EACb,OAAO,EAEX,KAAOA,KAAU,GACb,GAAI3G,EAAE2G,KAAW5C,EAAE4C,GACf,OAAO,EAGf,OAAO,CACX,CAIA,SAAS4F,EAAavM,EAAG+D,GACrB,OAAQ/D,EAAEwM,WAAazI,EAAEyI,UACrBxM,EAAEyM,WAAa1I,EAAE0I,UACjBzM,EAAE0M,WAAa3I,EAAE2I,UACjB1M,EAAE2M,OAAS5I,EAAE4I,MACb3M,EAAE4M,OAAS7I,EAAE6I,MACb5M,EAAE6M,WAAa9I,EAAE8I,UACjB7M,EAAE8M,WAAa/I,EAAE+I,QACzB,CACA,SAAStB,EAAgBxL,EAAG+D,EAAGvC,EAAOkE,GAClC,QAAKA,IAAaiE,GACdjE,IAAagE,GACbhE,IAAa+D,IACZzJ,EAAE+M,WAAYhJ,EAAEgJ,WAGbxD,EAAOxF,EAAG2B,IACdlE,EAAMuI,OAAO/J,EAAE0F,GAAW3B,EAAE2B,GAAWA,EAAUA,EAAU1F,EAAG+D,EAAGvC,EACzE,CAEA,IAAIwL,EAAgB,qBAChBC,EAAc,mBACdC,EAAW,gBACXC,EAAY,iBACZC,EAAU,eACVC,EAAa,kBACbC,EAAa,kBACbC,EAAc,kBACdC,EAAU,eACVC,EAAa,kBACbC,EAAU,eACVC,EAAU/C,MAAM+C,QAChBC,EAAsC,oBAAhBC,aAA6D,mBAAvBA,YAAYC,OACtED,YAAYC,OACZ,KACFxL,EAASrH,OAAOqH,OAChByL,EAAS9S,OAAOC,UAAU8S,SAAS5S,KAAK4M,KAAK/M,OAAOC,UAAU8S,UAIlE,SAASC,EAAyBrN,GAC9B,IAAIkJ,EAAiBlJ,EAAGkJ,eAAgBE,EAAgBpJ,EAAGoJ,cAAeE,EAAiBtJ,EAAGsJ,eAAgBI,EAAoB1J,EAAG0J,kBAAmBC,EAAe3J,EAAG2J,aAAce,EAAkB1K,EAAG0K,gBAAiBC,EAAkB3K,EAAG2K,gBAAiBQ,EAA4BnL,EAAGmL,0BAA2BE,EAAkBrL,EAAGqL,gBAAiBG,EAAexL,EAAGwL,aAAcE,EAAsB1L,EAAG0L,oBAAqBC,EAAe3L,EAAG2L,aAAc2B,EAAwBtN,EAAGsN,sBAI7e,OAAO,SAAoBlO,EAAG+D,EAAGvC,GAE7B,GAAIxB,IAAM+D,EACN,OAAO,EAIX,GAAS,MAAL/D,GAAkB,MAAL+D,EACb,OAAO,EAEX,IAAItB,SAAczC,EAClB,GAAIyC,WAAgBsB,EAChB,OAAO,EAEX,GAAa,WAATtB,EACA,MAAa,WAATA,EACO6I,EAAgBtL,EAAG+D,EAAGvC,GAEpB,aAATiB,GACO6H,EAAkBtK,EAAG+D,EAAGvC,GAKvC,IAAIxE,EAAcgD,EAAEhD,YAWpB,GAAIA,IAAgB+G,EAAE/G,YAClB,OAAO,EAKX,GAAIA,IAAgB/B,OAChB,OAAOsQ,EAAgBvL,EAAG+D,EAAGvC,GAIjC,GAAImM,EAAQ3N,GACR,OAAO8J,EAAe9J,EAAG+D,EAAGvC,GAIhC,GAAoB,MAAhBoM,GAAwBA,EAAa5N,GACrC,OAAOsM,EAAoBtM,EAAG+D,EAAGvC,GAOrC,GAAIxE,IAAgBmR,KAChB,OAAOnE,EAAchK,EAAG+D,EAAGvC,GAE/B,GAAIxE,IAAgBoR,OAChB,OAAOnC,EAAgBjM,EAAG+D,EAAGvC,GAEjC,GAAIxE,IAAgBiK,IAChB,OAAOsD,EAAavK,EAAG+D,EAAGvC,GAE9B,GAAIxE,IAAgBuK,IAChB,OAAO6E,EAAapM,EAAG+D,EAAGvC,GAI9B,IA1Wa3D,EA0WTwQ,EAAMN,EAAO/N,GACjB,GAAIqO,IAAQnB,EACR,OAAOlD,EAAchK,EAAG+D,EAAGvC,GAI/B,GAAI6M,IAAQd,EACR,OAAOtB,EAAgBjM,EAAG+D,EAAGvC,GAEjC,GAAI6M,IAAQjB,EACR,OAAO7C,EAAavK,EAAG+D,EAAGvC,GAE9B,GAAI6M,IAAQb,EACR,OAAOpB,EAAapM,EAAG+D,EAAGvC,GAE9B,GAAI6M,IAAQf,EAIR,MAA0B,mBAAXtN,EAAEsO,MACK,mBAAXvK,EAAEuK,MACT/C,EAAgBvL,EAAG+D,EAAGvC,GAI9B,GAAI6M,IAAQX,EACR,OAAOnB,EAAavM,EAAG+D,EAAGvC,GAI9B,GAAI6M,IAAQlB,EACR,OAAOjD,EAAelK,EAAG+D,EAAGvC,GAGhC,GAAI6M,IAAQrB,EACR,OAAOzB,EAAgBvL,EAAG+D,EAAGvC,GAKjC,GAAI6M,IAAQpB,GAAeoB,IAAQhB,GAAcgB,IAAQZ,EACrD,OAAO1B,EAA0B/L,EAAG+D,EAAGvC,GAE3C,GAAI0M,EAAuB,CACvB,IAAIK,EAAuBL,EAAsBG,GACjD,IAAKE,EAAsB,CACvB,IAAIC,EAvZA,OADC3Q,EAwZsBmC,GAvZhBnC,EAAM4Q,OAAOC,kBAAe/Q,EAwZnC6Q,IACAD,EAAuBL,EAAsBM,GAErD,CAGA,GAAID,EACA,OAAOA,EAAqBvO,EAAG+D,EAAGvC,EAE1C,CAYA,OAAO,CACX,CACJ,CAiGA,IAAIE,EAAYiN,KAIZC,EAAkBD,GAAkB,CAAEE,QAAQ,IAI9CC,EAAoBH,GAAkB,CAAEI,UAAU,IAKlDC,EAA0BL,GAAkB,CAC5CI,UAAU,EACVF,QAAQ,IAKRI,EAAeN,GAAkB,CACjCO,yBAA0B,WAAc,OAAO1F,CAAoB,IAKnE2F,EAAqBR,GAAkB,CACvCE,QAAQ,EACRK,yBAA0B,WAAc,OAAO1F,CAAoB,IAKnE4F,EAAuBT,GAAkB,CACzCI,UAAU,EACVG,yBAA0B,WAAc,OAAO1F,CAAoB,IAMnE6F,EAA6BV,GAAkB,CAC/CI,UAAU,EACVG,yBAA0B,WAAc,OAAO1F,CAAoB,EACnEqF,QAAQ,IAUZ,SAASF,GAAkBvM,QACF,IAAjBA,IAAsBA,EAAU,CAAC,GACrC,IArGsCkN,EAqGlC1O,EAAKwB,EAAQ2M,SAAUA,OAAuB,IAAZnO,GAAwBA,EAAI2O,EAAiCnN,EAAQ8M,yBAA0BM,EAAcpN,EAAQoN,YAAaC,EAAKrN,EAAQyM,OAAQA,OAAqB,IAAZY,GAAwBA,EAC1NC,EAtJR,SAAwC9O,GACpC,IAAImO,EAAWnO,EAAGmO,SAAUY,EAAqB/O,EAAG+O,mBAAoBd,EAASjO,EAAGiO,OAChFa,EAAS,CACT5F,eAAgB+E,EACVpD,EACA3B,EACNE,cAAeA,EACfE,eAAgBA,EAChBI,kBAAmBA,EACnBC,aAAcsE,EACRpG,EAAmB8B,EAAckB,GACjClB,EACNe,gBAAiBA,EACjBC,gBAAiBsD,EACXpD,EACAF,EACNQ,0BAA2BA,EAC3BE,gBAAiBA,EACjBG,aAAcyC,EACRpG,EAAmB2D,EAAcX,GACjCW,EACNE,oBAAqBuC,EACfpD,EACAa,EACNC,aAAcA,EACd2B,2BAAuBvQ,GAK3B,GAHIgS,IACAD,EAASpN,EAAO,CAAC,EAAGoN,EAAQC,EAAmBD,KAE/CX,EAAU,CACV,IAAIa,EAAmBhH,EAAiB8G,EAAO5F,gBAC3C+F,EAAiBjH,EAAiB8G,EAAOnF,cACzCuF,EAAoBlH,EAAiB8G,EAAOnE,iBAC5CwE,EAAiBnH,EAAiB8G,EAAOtD,cAC7CsD,EAASpN,EAAO,CAAC,EAAGoN,EAAQ,CACxB5F,eAAgB8F,EAChBrF,aAAcsF,EACdtE,gBAAiBuE,EACjB1D,aAAc2D,GAEtB,CACA,OAAOL,CACX,CA2GiBM,CAA+B5N,GACxC6N,EAAahC,EAAyByB,GAI1C,OAnGJ,SAAuB9O,GACnB,IAAImO,EAAWnO,EAAGmO,SAAUkB,EAAarP,EAAGqP,WAAYT,EAAc5O,EAAG4O,YAAazF,EAASnJ,EAAGmJ,OAAQ8E,EAASjO,EAAGiO,OACtH,GAAIW,EACA,OAAO,SAAiBxP,EAAG+D,GACvB,IAAInD,EAAK4O,IAAeC,EAAK7O,EAAGkI,MAAOA,OAAoB,IAAZ2G,EAAgBV,EAAW,IAAImB,aAAYvS,EAAY8R,EAAIU,EAAOvP,EAAGuP,KACpH,OAAOF,EAAWjQ,EAAG+D,EAAG,CACpB+E,MAAOA,EACPiB,OAAQA,EACRoG,KAAMA,EACNtB,OAAQA,GAEhB,EAEJ,GAAIE,EACA,OAAO,SAAiB/O,EAAG+D,GACvB,OAAOkM,EAAWjQ,EAAG+D,EAAG,CACpB+E,MAAO,IAAIoH,QACXnG,OAAQA,EACRoG,UAAMxS,EACNkR,OAAQA,GAEhB,EAEJ,IAAIrN,EAAQ,CACRsH,WAAOnL,EACPoM,OAAQA,EACRoG,UAAMxS,EACNkR,OAAQA,GAEZ,OAAO,SAAiB7O,EAAG+D,GACvB,OAAOkM,EAAWjQ,EAAG+D,EAAGvC,EAC5B,CACJ,CAmEW4O,CAAc,CAAErB,SAAUA,EAAUkB,WAAYA,EAAYT,YAAaA,EAAazF,OAHhFwF,EACPA,EAA+BU,IAzGCX,EA0GCW,EAzGhC,SAAUjQ,EAAG+D,EAAGsM,EAAcC,EAAcC,EAAUC,EAAUhP,GACnE,OAAO8N,EAAQtP,EAAG+D,EAAGvC,EACzB,GAwG6GqN,OAAQA,GACzH,C,gGCpnBA,MAAM4B,EAAc,CAChBC,UAAWC,WAAYC,kBAAmBC,WAAYC,YACtDC,WAAYC,YAAaC,aAAcC,cAQ5B,MAAMC,EAMjB,WAAOC,CAAKC,GACR,KAAMA,aAAgBxD,aAClB,MAAM,IAAI9P,MAAM,4CAEpB,MAAOuT,EAAOC,GAAkB,IAAIZ,WAAWU,EAAM,EAAG,GACxD,GAAc,MAAVC,EACA,MAAM,IAAIvT,MAAM,kDAEpB,MAAMyT,EAAUD,GAAkB,EAClC,GAlBQ,IAkBJC,EACA,MAAM,IAAIzT,MAAM,QAAQyT,4BAE5B,MAAMC,EAAYhB,EAA6B,GAAjBc,GAC9B,IAAKE,EACD,MAAM,IAAI1T,MAAM,4BAEpB,MAAO2T,GAAY,IAAIZ,YAAYO,EAAM,EAAG,IACrCM,GAAY,IAAIX,YAAYK,EAAM,EAAG,GAE5C,OAAO,IAAIF,EAAOQ,EAAUD,EAAUD,EAAWJ,EACrD,CASA,WAAArU,CAAY2U,EAAUD,EAAW,GAAID,EAAYP,aAAcG,GAC3D,GAAIO,MAAMD,IAAaA,EAAW,EAAG,MAAM,IAAI5T,MAAM,+BAA+B4T,MAEpFrV,KAAKqV,UAAYA,EACjBrV,KAAKoV,SAAWhS,KAAKuE,IAAIvE,KAAKwE,KAAKwN,EAAU,GAAI,OACjDpV,KAAKmV,UAAYA,EACjBnV,KAAKuV,eAAiBF,EAAW,MAAQb,YAAcE,YAEvD,MAAMc,EAAiBrB,EAAYpV,QAAQiB,KAAKmV,WAC1CM,EAA4B,EAAXJ,EAAerV,KAAKmV,UAAUO,kBAC/CC,EAAcN,EAAWrV,KAAKuV,eAAeG,kBAC7CE,GAAa,EAAID,EAAc,GAAK,EAE1C,GAAIH,EAAiB,EACjB,MAAM,IAAI/T,MAAM,iCAAiC0T,MAGjDJ,GAASA,aAAgBxD,aACzBvR,KAAK+U,KAAOA,EACZ/U,KAAK6V,IAAM,IAAI7V,KAAKuV,eAAevV,KAAK+U,KAxDhC,EAwDmDM,GAC3DrV,KAAK8V,OAAS,IAAI9V,KAAKmV,UAAUnV,KAAK+U,KAzD9B,EAyDkDY,EAAcC,EAAsB,EAAXP,GACnFrV,KAAK+V,KAAkB,EAAXV,EACZrV,KAAKgW,WAAY,IAEjBhW,KAAK+U,KAAO,IAAIxD,YA7DR,EA6DkCkE,EAAiBE,EAAcC,GACzE5V,KAAK6V,IAAM,IAAI7V,KAAKuV,eAAevV,KAAK+U,KA9DhC,EA8DmDM,GAC3DrV,KAAK8V,OAAS,IAAI9V,KAAKmV,UAAUnV,KAAK+U,KA/D9B,EA+DkDY,EAAcC,EAAsB,EAAXP,GACnFrV,KAAK+V,KAAO,EACZ/V,KAAKgW,WAAY,EAGjB,IAAI3B,WAAWrU,KAAK+U,KAAM,EAAG,GAAGnI,IAAI,CAAC,IAAM,GAAiB4I,IAC5D,IAAIhB,YAAYxU,KAAK+U,KAAM,EAAG,GAAG,GAAKK,EACtC,IAAIV,YAAY1U,KAAK+U,KAAM,EAAG,GAAG,GAAKM,EAE9C,CAQA,GAAAnK,CAAInH,EAAGC,GACH,MAAMqG,EAAQrK,KAAK+V,MAAQ,EAI3B,OAHA/V,KAAK6V,IAAIxL,GAASA,EAClBrK,KAAK8V,OAAO9V,KAAK+V,QAAUhS,EAC3B/D,KAAK8V,OAAO9V,KAAK+V,QAAU/R,EACpBqG,CACX,CAKA,MAAA4L,GACI,MAAMC,EAAWlW,KAAK+V,MAAQ,EAC9B,GAAIG,IAAalW,KAAKqV,SAClB,MAAM,IAAI5T,MAAM,SAASyU,yBAAgClW,KAAKqV,aAMlE,OAHAc,EAAKnW,KAAK6V,IAAK7V,KAAK8V,OAAQ9V,KAAKoV,SAAU,EAAGpV,KAAKqV,SAAW,EAAG,GAEjErV,KAAKgW,WAAY,EACVhW,IACX,CAUA,KAAAoW,CAAMC,EAAMC,EAAMC,EAAMC,GACpB,IAAKxW,KAAKgW,UAAW,MAAM,IAAIvU,MAAM,+CAErC,MAAM,IAACoU,EAAG,OAAEC,EAAM,SAAEV,GAAYpV,KAC1B+N,EAAQ,CAAC,EAAG8H,EAAI3W,OAAS,EAAG,GAC5B2N,EAAS,GAGf,KAAOkB,EAAM7O,QAAQ,CACjB,MAAMuX,EAAO1I,EAAM2I,OAAS,EACtBC,EAAQ5I,EAAM2I,OAAS,EACvBE,EAAO7I,EAAM2I,OAAS,EAG5B,GAAIC,EAAQC,GAAQxB,EAAU,CAC1B,IAAK,IAAInW,EAAI2X,EAAM3X,GAAK0X,EAAO1X,IAAK,CAChC,MAAM8E,EAAI+R,EAAO,EAAI7W,GACf+E,EAAI8R,EAAO,EAAI7W,EAAI,GACrB8E,GAAKsS,GAAQtS,GAAKwS,GAAQvS,GAAKsS,GAAQtS,GAAKwS,GAAM3J,EAAOzL,KAAKyU,EAAI5W,GAC1E,CACA,QACJ,CAGA,MAAMkC,EAAKyV,EAAOD,GAAU,EAGtB5S,EAAI+R,EAAO,EAAI3U,GACf6C,EAAI8R,EAAO,EAAI3U,EAAI,GACrB4C,GAAKsS,GAAQtS,GAAKwS,GAAQvS,GAAKsS,GAAQtS,GAAKwS,GAAM3J,EAAOzL,KAAKyU,EAAI1U,KAGzD,IAATsV,EAAaJ,GAAQtS,EAAIuS,GAAQtS,KACjC+J,EAAM3M,KAAKwV,GACX7I,EAAM3M,KAAKD,EAAI,GACf4M,EAAM3M,KAAK,EAAIqV,KAEN,IAATA,EAAaF,GAAQxS,EAAIyS,GAAQxS,KACjC+J,EAAM3M,KAAKD,EAAI,GACf4M,EAAM3M,KAAKuV,GACX5I,EAAM3M,KAAK,EAAIqV,GAEvB,CAEA,OAAO5J,CACX,CASA,MAAAgK,CAAOC,EAAIC,EAAIC,GACX,IAAKhX,KAAKgW,UAAW,MAAM,IAAIvU,MAAM,+CAErC,MAAM,IAACoU,EAAG,OAAEC,EAAM,SAAEV,GAAYpV,KAC1B+N,EAAQ,CAAC,EAAG8H,EAAI3W,OAAS,EAAG,GAC5B2N,EAAS,GACToK,EAAKD,EAAIA,EAGf,KAAOjJ,EAAM7O,QAAQ,CACjB,MAAMuX,EAAO1I,EAAM2I,OAAS,EACtBC,EAAQ5I,EAAM2I,OAAS,EACvBE,EAAO7I,EAAM2I,OAAS,EAG5B,GAAIC,EAAQC,GAAQxB,EAAU,CAC1B,IAAK,IAAInW,EAAI2X,EAAM3X,GAAK0X,EAAO1X,IACvBiY,EAAOpB,EAAO,EAAI7W,GAAI6W,EAAO,EAAI7W,EAAI,GAAI6X,EAAIC,IAAOE,GAAIpK,EAAOzL,KAAKyU,EAAI5W,IAEhF,QACJ,CAGA,MAAMkC,EAAKyV,EAAOD,GAAU,EAGtB5S,EAAI+R,EAAO,EAAI3U,GACf6C,EAAI8R,EAAO,EAAI3U,EAAI,GACrB+V,EAAOnT,EAAGC,EAAG8S,EAAIC,IAAOE,GAAIpK,EAAOzL,KAAKyU,EAAI1U,KAGnC,IAATsV,EAAaK,EAAKE,GAAKjT,EAAIgT,EAAKC,GAAKhT,KACrC+J,EAAM3M,KAAKwV,GACX7I,EAAM3M,KAAKD,EAAI,GACf4M,EAAM3M,KAAK,EAAIqV,KAEN,IAATA,EAAaK,EAAKE,GAAKjT,EAAIgT,EAAKC,GAAKhT,KACrC+J,EAAM3M,KAAKD,EAAI,GACf4M,EAAM3M,KAAKuV,GACX5I,EAAM3M,KAAK,EAAIqV,GAEvB,CAEA,OAAO5J,CACX,EAWJ,SAASsJ,EAAKN,EAAKC,EAAQV,EAAUwB,EAAMD,EAAOF,GAC9C,GAAIE,EAAQC,GAAQxB,EAAU,OAE9B,MAAMjU,EAAKyV,EAAOD,GAAU,EAI5BQ,EAAOtB,EAAKC,EAAQ3U,EAAGyV,EAAMD,EAAOF,GAGpCN,EAAKN,EAAKC,EAAQV,EAAUwB,EAAMzV,EAAI,EAAG,EAAIsV,GAC7CN,EAAKN,EAAKC,EAAQV,EAAUjU,EAAI,EAAGwV,EAAO,EAAIF,EAClD,CAYA,SAASU,EAAOtB,EAAKC,EAAQsB,EAAGR,EAAMD,EAAOF,GAEzC,KAAOE,EAAQC,GAAM,CACjB,GAAID,EAAQC,EAAO,IAAK,CACpB,MAAMS,EAAIV,EAAQC,EAAO,EACnBzV,EAAIiW,EAAIR,EAAO,EACfU,EAAIlU,KAAKmU,IAAIF,GACb9Y,EAAI,GAAM6E,KAAKoU,IAAI,EAAIF,EAAI,GAC3BG,EAAK,GAAMrU,KAAKS,KAAKyT,EAAI/Y,GAAK8Y,EAAI9Y,GAAK8Y,IAAMlW,EAAIkW,EAAI,EAAI,GAAK,EAAI,GAGxEF,EAAOtB,EAAKC,EAAQsB,EAFJhU,KAAKwE,IAAIgP,EAAMxT,KAAKsU,MAAMN,EAAIjW,EAAI5C,EAAI8Y,EAAII,IACzCrU,KAAKuE,IAAIgP,EAAOvT,KAAKsU,MAAMN,GAAKC,EAAIlW,GAAK5C,EAAI8Y,EAAII,IACxBhB,EAC9C,CAEA,MAAMhY,EAAIqX,EAAO,EAAIsB,EAAIX,GACzB,IAAIxX,EAAI2X,EACJe,EAAIhB,EAKR,IAHAiB,EAAS/B,EAAKC,EAAQc,EAAMQ,GACxBtB,EAAO,EAAIa,EAAQF,GAAQhY,GAAGmZ,EAAS/B,EAAKC,EAAQc,EAAMD,GAEvD1X,EAAI0Y,GAAG,CAIV,IAHAC,EAAS/B,EAAKC,EAAQ7W,EAAG0Y,GACzB1Y,IACA0Y,IACO7B,EAAO,EAAI7W,EAAIwX,GAAQhY,GAAGQ,IACjC,KAAO6W,EAAO,EAAI6B,EAAIlB,GAAQhY,GAAGkZ,GACrC,CAEI7B,EAAO,EAAIc,EAAOH,KAAUhY,EAAGmZ,EAAS/B,EAAKC,EAAQc,EAAMe,IAE3DA,IACAC,EAAS/B,EAAKC,EAAQ6B,EAAGhB,IAGzBgB,GAAKP,IAAGR,EAAOe,EAAI,GACnBP,GAAKO,IAAGhB,EAAQgB,EAAI,EAC5B,CACJ,CAQA,SAASC,EAAS/B,EAAKC,EAAQ7W,EAAG0Y,GAC9BE,EAAKhC,EAAK5W,EAAG0Y,GACbE,EAAK/B,EAAQ,EAAI7W,EAAG,EAAI0Y,GACxBE,EAAK/B,EAAQ,EAAI7W,EAAI,EAAG,EAAI0Y,EAAI,EACpC,CAOA,SAASE,EAAKC,EAAK7Y,EAAG0Y,GAClB,MAAMI,EAAMD,EAAI7Y,GAChB6Y,EAAI7Y,GAAK6Y,EAAIH,GACbG,EAAIH,GAAKI,CACb,CAQA,SAASb,EAAOc,EAAIC,EAAIC,EAAIC,GACxB,MAAMC,EAAKJ,EAAKE,EACVG,EAAKJ,EAAKE,EAChB,OAAOC,EAAKA,EAAKC,EAAKA,CAC1B,C,gJCnUA,MAAMC,EAAiB,CACnBC,QAAS,EACTpU,QAAS,GACTqU,UAAW,EACX3S,OAAQ,GACR4S,OAAQ,IACRrD,SAAU,GACVmC,KAAK,EAGLmB,YAAY,EAGZlR,OAAQ,KAGRjI,IAAKoZ,GAASA,GAGZC,EAASxV,KAAKwV,SAAWb,EAAiD,IAAIpD,aAAa,GAAzD5Q,IAAQgU,EAAI,IAAMhU,EAAUgU,EAAI,KAA1C,IAACA,EAQhB,MAAMc,EACjB,WAAAnY,CAAYoF,GACR9F,KAAK8F,QAAUnH,OAAOqH,OAAOrH,OAAOma,OAAOR,GAAiBxS,GAC5D9F,KAAK+Y,MAAQ,IAAIzK,MAAMtO,KAAK8F,QAAQ3B,QAAU,GAC9CnE,KAAKgZ,OAAShZ,KAAK8F,QAAQ0B,OAAS,EAAI,EACxCxH,KAAKiZ,aAAe,EACxB,CAEA,IAAA1S,CAAKL,GACD,MAAM,IAACqR,EAAG,QAAEgB,EAAO,QAAEpU,GAAWnE,KAAK8F,QAEjCyR,GAAK2B,QAAQC,KAAK,cAEtB,MAAMC,EAAU,WAAalT,EAAOhH,gBAChCqY,GAAK2B,QAAQC,KAAKC,GAEtBpZ,KAAKkG,OAASA,EAGd,MAAM6O,EAAO,GAEb,IAAK,IAAI9V,EAAI,EAAGA,EAAIiH,EAAOhH,OAAQD,IAAK,CACpC,MAAMP,EAAIwH,EAAOjH,GACjB,IAAKP,EAAE0H,SAAU,SAEjB,MAAO7F,EAAKD,GAAO5B,EAAE0H,SAASC,YACxBtC,EAAI6U,EAAOS,EAAK9Y,IAChByD,EAAI4U,EAAOU,EAAKhZ,IAEtByU,EAAK3T,KACD2C,EAAGC,EACH6C,IACA5H,GACC,EACD,GAEAe,KAAK8F,QAAQ0B,QAAQuN,EAAK3T,KAAK,EACvC,CACA,IAAImY,EAAOvZ,KAAK+Y,MAAM5U,EAAU,GAAKnE,KAAKwZ,YAAYzE,GAElDwC,GAAK2B,QAAQO,QAAQL,GAIzB,IAAK,IAAI9B,EAAInT,EAASmT,GAAKiB,EAASjB,IAAK,CACrC,MAAMoC,GAAO7H,KAAK6H,MAGlBH,EAAOvZ,KAAK+Y,MAAMzB,GAAKtX,KAAKwZ,YAAYxZ,KAAK2Z,SAASJ,EAAMjC,IAExDC,GAAK2B,QAAQ3B,IAAI,2BAA4BD,EAAGiC,EAAKlE,UAAWxD,KAAK6H,MAAQA,EACrF,CAIA,OAFInC,GAAK2B,QAAQO,QAAQ,cAElBzZ,IACX,CAEA,WAAAwG,CAAYoT,EAAMlV,GACd,IAAImV,IAAWD,EAAK,GAAK,KAAO,IAAM,KAAO,IAAM,IACnD,MAAME,EAAS1W,KAAKwE,KAAK,GAAIxE,KAAKuE,IAAI,GAAIiS,EAAK,KAC/C,IAAIG,EAAqB,MAAZH,EAAK,GAAa,MAAQA,EAAK,GAAK,KAAO,IAAM,KAAO,IAAM,IAC3E,MAAMI,EAAS5W,KAAKwE,KAAK,GAAIxE,KAAKuE,IAAI,GAAIiS,EAAK,KAE/C,GAAIA,EAAK,GAAKA,EAAK,IAAM,IACrBC,GAAU,IACVE,EAAS,SACN,GAAIF,EAASE,EAAQ,CACxB,MAAME,EAAaja,KAAKwG,YAAY,CAACqT,EAAQC,EAAQ,IAAKE,GAAStV,GAC7DwV,EAAala,KAAKwG,YAAY,EAAE,IAAKsT,EAAQC,EAAQC,GAAStV,GACpE,OAAOuV,EAAWjN,OAAOkN,EAC7B,CAEA,MAAMX,EAAOvZ,KAAK+Y,MAAM/Y,KAAKma,WAAWzV,IAClCmR,EAAM0D,EAAKnD,MAAMiD,EAAKQ,GAASP,EAAKU,GAASX,EAAKU,GAAST,EAAKQ,IAChE/E,EAAOwE,EAAKxE,KACZnQ,EAAW,GACjB,IAAK,MAAMwV,KAAMvE,EAAK,CAClB,MAAMuB,EAAIpX,KAAKgZ,OAASoB,EACxBxV,EAASxD,KAAK2T,EAAKqC,EAlFZ,GAkF8B,EAAIiD,EAAetF,EAAMqC,EAAGpX,KAAKiZ,cAAgBjZ,KAAKkG,OAAO6O,EAAKqC,EApFjG,IAqFV,CACA,OAAOxS,CACX,CAEA,WAAA0V,CAAYC,GACR,MAAMC,EAAWxa,KAAKya,aAAaF,GAC7BG,EAAa1a,KAAK2a,eAAeJ,GACjCK,EAAW,oCAEXrB,EAAOvZ,KAAK+Y,MAAM2B,GACxB,IAAKnB,EAAM,MAAM,IAAI9X,MAAMmZ,GAE3B,MAAM7F,EAAOwE,EAAKxE,KAClB,GAAIyF,EAAWxa,KAAKgZ,QAAUjE,EAAK7V,OAAQ,MAAM,IAAIuC,MAAMmZ,GAE3D,MAAM5D,EAAIhX,KAAK8F,QAAQD,QAAU7F,KAAK8F,QAAQ2S,OAASrV,KAAKyX,IAAI,EAAGH,EAAa,IAC1E3W,EAAIgR,EAAKyF,EAAWxa,KAAKgZ,QACzBhV,EAAI+Q,EAAKyF,EAAWxa,KAAKgZ,OAAS,GAClCnD,EAAM0D,EAAK1C,OAAO9S,EAAGC,EAAGgT,GACxB8D,EAAW,GACjB,IAAK,MAAMV,KAAMvE,EAAK,CAClB,MAAMuB,EAAIgD,EAAKpa,KAAKgZ,OAChBjE,EAAKqC,EA1GC,KA0GsBmD,GAC5BO,EAAS1Z,KAAK2T,EAAKqC,EA1GhB,GA0GkC,EAAIiD,EAAetF,EAAMqC,EAAGpX,KAAKiZ,cAAgBjZ,KAAKkG,OAAO6O,EAAKqC,EA5GrG,IA8GV,CAEA,GAAwB,IAApB0D,EAAS5b,OAAc,MAAM,IAAIuC,MAAMmZ,GAE3C,OAAOE,CACX,CAEA,SAAAnU,CAAU4T,EAAWQ,EAAOC,GACxBD,EAAQA,GAAS,GACjBC,EAASA,GAAU,EAEnB,MAAMC,EAAS,GAGf,OAFAjb,KAAKkb,cAAcD,EAAQV,EAAWQ,EAAOC,EAAQ,GAE9CC,CACX,CAEA,OAAAE,CAAQ7D,EAAGvT,EAAGC,GACV,MAAMuV,EAAOvZ,KAAK+Y,MAAM/Y,KAAKma,WAAW7C,IAClC8D,EAAKhY,KAAKyX,IAAI,EAAGvD,IACjB,OAACmB,EAAM,OAAE5S,GAAU7F,KAAK8F,QACxBpH,EAAImH,EAAS4S,EACb4C,GAAOrX,EAAItF,GAAK0c,EAChBE,GAAUtX,EAAI,EAAItF,GAAK0c,EAEvBG,EAAO,CACTC,SAAU,IAkBd,OAfAxb,KAAKyb,iBACDlC,EAAKnD,OAAOrS,EAAIrF,GAAK0c,EAAIC,GAAMtX,EAAI,EAAIrF,GAAK0c,EAAIE,GAChD/B,EAAKxE,KAAMhR,EAAGC,EAAGoX,EAAIG,GAEf,IAANxX,GACA/D,KAAKyb,iBACDlC,EAAKnD,MAAM,EAAI1X,EAAI0c,EAAIC,EAAK,EAAGC,GAC/B/B,EAAKxE,KAAMqG,EAAIpX,EAAGoX,EAAIG,GAE1BxX,IAAMqX,EAAK,GACXpb,KAAKyb,iBACDlC,EAAKnD,MAAM,EAAGiF,EAAK3c,EAAI0c,EAAIE,GAC3B/B,EAAKxE,MAAO,EAAG/Q,EAAGoX,EAAIG,GAGvBA,EAAKC,SAAStc,OAASqc,EAAO,IACzC,CAEA,uBAAAG,CAAwBnB,GACpB,IAAIoB,EAAgB3b,KAAK2a,eAAeJ,GAAa,EACrD,KAAOoB,GAAiB3b,KAAK8F,QAAQ3B,SAAS,CAC1C,MAAM2W,EAAW9a,KAAKsa,YAAYC,GAElC,GADAoB,IACwB,IAApBb,EAAS5b,OAAc,MAC3Bqb,EAAYO,EAAS,GAAGxU,WAAWM,UACvC,CACA,OAAO+U,CACX,CAEA,aAAAT,CAAcrO,EAAQ0N,EAAWQ,EAAOC,EAAQY,GAC5C,MAAMd,EAAW9a,KAAKsa,YAAYC,GAElC,IAAK,MAAMsB,KAASf,EAAU,CAC1B,MAAMnC,EAAQkD,EAAMvV,WAkBpB,GAhBIqS,GAASA,EAAM7T,QACX8W,EAAUjD,EAAMmD,aAAed,EAE/BY,GAAWjD,EAAMmD,YAGjBF,EAAU5b,KAAKkb,cAAcrO,EAAQ8L,EAAM/R,WAAYmU,EAAOC,EAAQY,GAGnEA,EAAUZ,EAEjBY,IAGA/O,EAAOzL,KAAKya,GAEZhP,EAAO3N,SAAW6b,EAAO,KACjC,CAEA,OAAOa,CACX,CAEA,WAAApC,CAAYzE,GACR,MAAMwE,EAAO,IAAI,UAAOxE,EAAK7V,OAASc,KAAKgZ,OAAS,EAAGhZ,KAAK8F,QAAQsP,SAAUT,cAC9E,IAAK,IAAI1V,EAAI,EAAGA,EAAI8V,EAAK7V,OAAQD,GAAKe,KAAKgZ,OAAQO,EAAKrO,IAAI6J,EAAK9V,GAAI8V,EAAK9V,EAAI,IAG9E,OAFAsa,EAAKtD,SACLsD,EAAKxE,KAAOA,EACLwE,CACX,CAEA,gBAAAkC,CAAiB5F,EAAKd,EAAMhR,EAAGC,EAAGoX,EAAIG,GAClC,IAAK,MAAMtc,KAAK4W,EAAK,CACjB,MAAMuB,EAAInY,EAAIe,KAAKgZ,OACb+C,EAAYhH,EAAKqC,EA7MhB,GA6MkC,EAEzC,IAAI4E,EAAMC,EAAIC,EACd,GAAIH,EACAC,EAAOG,EAAqBpH,EAAMqC,EAAGpX,KAAKiZ,cAC1CgD,EAAKlH,EAAKqC,GACV8E,EAAKnH,EAAKqC,EAAI,OACX,CACH,MAAM1Y,EAAIsB,KAAKkG,OAAO6O,EAAKqC,EAvNzB,IAwNF4E,EAAOtd,EAAE4H,WACT,MAAO/F,EAAKD,GAAO5B,EAAE0H,SAASC,YAC9B4V,EAAK5C,EAAK9Y,GACV2b,EAAK5C,EAAKhZ,EACd,CAEA,MAAM8b,EAAI,CACNjW,KAAM,EACNC,SAAU,CAAC,CACPhD,KAAK6C,MAAMjG,KAAK8F,QAAQ2S,QAAUwD,EAAKb,EAAKrX,IAC5CX,KAAK6C,MAAMjG,KAAK8F,QAAQ2S,QAAUyD,EAAKd,EAAKpX,MAEhDgY,QAIJ,IAAI5B,EAGAA,EAFA2B,GAAa/b,KAAK8F,QAAQ4S,WAErB3D,EAAKqC,EA3OR,GA8OGpX,KAAKkG,OAAO6O,EAAKqC,EA9OpB,IA8OoCgD,QAG/B/Y,IAAP+Y,IAAkBgC,EAAEhC,GAAKA,GAE7BmB,EAAKC,SAASpa,KAAKgb,EACvB,CACJ,CAEA,UAAAjC,CAAW7C,GACP,OAAOlU,KAAKwE,IAAI5H,KAAK8F,QAAQyS,QAASnV,KAAKuE,IAAIvE,KAAKsU,OAAOJ,GAAItX,KAAK8F,QAAQ3B,QAAU,GAC1F,CAEA,QAAAwV,CAASJ,EAAM7U,GACX,MAAM,OAACmB,EAAM,OAAE4S,EAAM,OAAEjR,EAAM,UAAEgR,GAAaxY,KAAK8F,QAC3CkR,EAAInR,GAAU4S,EAASrV,KAAKyX,IAAI,EAAGnW,IACnCqQ,EAAOwE,EAAKxE,KACZsH,EAAW,GACXrD,EAAShZ,KAAKgZ,OAGpB,IAAK,IAAI/Z,EAAI,EAAGA,EAAI8V,EAAK7V,OAAQD,GAAK+Z,EAAQ,CAE1C,GAAIjE,EAAK9V,EAtQD,IAsQqByF,EAAM,SACnCqQ,EAAK9V,EAvQG,GAuQgByF,EAGxB,MAAMX,EAAIgR,EAAK9V,GACT+E,EAAI+Q,EAAK9V,EAAI,GACbqd,EAAc/C,EAAK1C,OAAO9B,EAAK9V,GAAI8V,EAAK9V,EAAI,GAAI+X,GAEhDuF,EAAkBxH,EAAK9V,EA3QtB,GA4QP,IAAIud,EAAYD,EAGhB,IAAK,MAAME,KAAcH,EAAa,CAClC,MAAMlF,EAAIqF,EAAazD,EAEnBjE,EAAKqC,EArRL,GAqRwB1S,IAAM8X,GAAazH,EAAKqC,EAlRjD,GAmRP,CAGA,GAAIoF,EAAYD,GAAmBC,GAAahE,EAAW,CACvD,IAGIkE,EAHAC,EAAK5Y,EAAIwY,EACTK,EAAK5Y,EAAIuY,EAGTM,GAAoB,EAGxB,MAAMzC,GAAOnb,EAAI+Z,GAAe,IAAMtU,EAAO,GAAK1E,KAAKkG,OAAOhH,OAE9D,IAAK,MAAMud,KAAcH,EAAa,CAClC,MAAMlF,EAAIqF,EAAazD,EAEvB,GAAIjE,EAAKqC,EAtST,IAsS6B1S,EAAM,SACnCqQ,EAAKqC,EAvSL,GAuSwB1S,EAExB,MAAMoY,EAAa/H,EAAKqC,EAtSzB,GAuSCuF,GAAM5H,EAAKqC,GAAK0F,EAChBF,GAAM7H,EAAKqC,EAAI,GAAK0F,EAEpB/H,EAAKqC,EA3SH,GA2SwBgD,EAEtB5S,IACKkV,IACDA,EAAoB1c,KAAK+c,KAAKhI,EAAM9V,GAAG,GACvC4d,EAAmB7c,KAAKiZ,aAAa/Z,OACrCc,KAAKiZ,aAAa7X,KAAKsb,IAE3BlV,EAAOkV,EAAmB1c,KAAK+c,KAAKhI,EAAMqC,IAElD,CAEArC,EAAK9V,EAvTC,GAuToBmb,EAC1BiC,EAASjb,KAAKub,EAAKH,EAAWI,EAAKJ,EAAW3V,IAAUuT,GAAK,EAAGoC,GAC5DhV,GAAQ6U,EAASjb,KAAKyb,EAE9B,KAAO,CACH,IAAK,IAAIlF,EAAI,EAAGA,EAAIqB,EAAQrB,IAAK0E,EAASjb,KAAK2T,EAAK9V,EAAI0Y,IAExD,GAAI6E,EAAY,EACZ,IAAK,MAAMC,KAAcH,EAAa,CAClC,MAAMlF,EAAIqF,EAAazD,EACvB,KAAIjE,EAAKqC,EAnUb,IAmUiC1S,GAA7B,CACAqQ,EAAKqC,EApUT,GAoU4B1S,EACxB,IAAK,IAAIiT,EAAI,EAAGA,EAAIqB,EAAQrB,IAAK0E,EAASjb,KAAK2T,EAAKqC,EAAIO,GAFb,CAG/C,CAER,CACJ,CAEA,OAAO0E,CACX,CAGA,YAAA5B,CAAaF,GACT,OAAQA,EAAYva,KAAKkG,OAAOhH,QAAW,CAC/C,CAGA,cAAAyb,CAAeJ,GACX,OAAQA,EAAYva,KAAKkG,OAAOhH,QAAU,EAC9C,CAEA,IAAA6d,CAAKhI,EAAM9V,EAAG+d,GACV,GAAIjI,EAAK9V,EAtVE,GAsVgB,EAAG,CAC1B,MAAM0Z,EAAQ3Y,KAAKiZ,aAAalE,EAAK9V,EAtV7B,IAuVR,OAAO+d,EAAQre,OAAOqH,OAAO,CAAC,EAAG2S,GAASA,CAC9C,CACA,MAAMsE,EAAWjd,KAAKkG,OAAO6O,EAAK9V,EA5VxB,IA4VwCqH,WAC5CuG,EAAS7M,KAAK8F,QAAQvG,IAAI0d,GAChC,OAAOD,GAASnQ,IAAWoQ,EAAWte,OAAOqH,OAAO,CAAC,EAAG6G,GAAUA,CACtE,EAGJ,SAASwN,EAAetF,EAAM9V,EAAGga,GAC7B,MAAO,CACH9S,KAAM,UACNiU,GAAIrF,EAAK9V,EArWC,GAsWVqH,WAAY6V,EAAqBpH,EAAM9V,EAAGga,GAC1C7S,SAAU,CACND,KAAM,QACNE,YAAa,EA+BXtC,EA/BiBgR,EAAK9V,GAgCb,KAAX8E,EAAI,KAhCyBmZ,EAAKnI,EAAK9V,EAAI,OA+BvD,IAAc8E,CA5Bd,CAEA,SAASoY,EAAqBpH,EAAM9V,EAAGga,GACnC,MAAMhY,EAAQ8T,EAAK9V,EA7WJ,GA8WTke,EACFlc,GAAS,IAAQ,GAAGmC,KAAK6C,MAAMhF,EAAQ,QACvCA,GAAS,IAAUmC,KAAK6C,MAAMhF,EAAQ,KAAO,GAA7B,IAAuCA,EACrDmc,EAAYrI,EAAK9V,EAhXP,GAiXVqH,GAA4B,IAAf8W,EAAmB,CAAC,EAAIze,OAAOqH,OAAO,CAAC,EAAGiT,EAAamE,IAC1E,OAAOze,OAAOqH,OAAOM,EAAY,CAC7BxB,SAAS,EACT8B,WAAYmO,EAAK9V,EAvXP,GAwXV6c,YAAa7a,EACboc,wBAAyBF,GAEjC,CAGA,SAAS9D,EAAK9Y,GACV,OAAOA,EAAM,IAAM,EACvB,CACA,SAAS+Y,EAAKhZ,GACV,MAAMkD,EAAMJ,KAAKI,IAAIlD,EAAM8C,KAAKC,GAAK,KAC/BW,EAAK,GAAM,IAAOZ,KAAKmU,KAAK,EAAI/T,IAAQ,EAAIA,IAAQJ,KAAKC,GAC/D,OAAOW,EAAI,EAAI,EAAIA,EAAI,EAAI,EAAIA,CACnC,CAMA,SAASkZ,EAAKlZ,GACV,MAAMsZ,GAAM,IAAU,IAAJtZ,GAAWZ,KAAKC,GAAK,IACvC,OAAO,IAAMD,KAAKma,KAAKna,KAAKoU,IAAI8F,IAAOla,KAAKC,GAAK,EACrD,C,GCtaIma,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBrc,IAAjBsc,EACH,OAAOA,EAAaC,QAGrB,QAAsCvc,IAAlCwc,EAAoBH,GAAyB,CAChD,IAAIlf,EAAI,IAAIiD,MAAM,uBAAyBic,EAAW,KAEtD,MADAlf,EAAEsf,KAAO,mBACHtf,CACP,CAEA,IAAIuf,EAASP,EAAyBE,GAAY,CAGjDE,QAAS,CAAC,GAOX,OAHAC,EAAoBH,GAAUK,EAAQA,EAAOH,QAASH,GAG/CM,EAAOH,OACf,CC3BAH,EAAoBO,EAAI,SAASJ,EAASK,GACzC,IAAI,IAAIC,KAAOD,EACXR,EAAoBU,EAAEF,EAAYC,KAAST,EAAoBU,EAAEP,EAASM,IAC5Evf,OAAOyf,eAAeR,EAASM,EAAK,CAAE3O,YAAY,EAAM7C,IAAKuR,EAAWC,IAG3E,ECPAT,EAAoBU,EAAI,SAASE,EAAKC,GAAQ,OAAO3f,OAAOC,UAAUC,eAAeC,KAAKuf,EAAKC,EAAO,ECCtGb,EAAoBzG,EAAI,SAAS4G,GACX,oBAAXzL,QAA0BA,OAAOC,aAC1CzT,OAAOyf,eAAeR,EAASzL,OAAOC,YAAa,CAAE7Q,MAAO,WAE7D5C,OAAOyf,eAAeR,EAAS,aAAc,CAAErc,OAAO,GACvD,E,qGCMAgd,OAAO7U,gBAAkB,EAAAA,e","sources":["webpack://ionian/./node_modules/@googlemaps/markerclusterer/dist/index.esm.mjs","webpack://ionian/./node_modules/fast-equals/dist/esm/index.mjs","webpack://ionian/./node_modules/kdbush/index.js","webpack://ionian/./node_modules/supercluster/index.js","webpack://ionian/webpack/bootstrap","webpack://ionian/webpack/runtime/define property getters","webpack://ionian/webpack/runtime/hasOwnProperty shorthand","webpack://ionian/webpack/runtime/make namespace object","webpack://ionian/./app/javascript/gmaps.js"],"sourcesContent":["import { deepEqual } from 'fast-equals';\nimport SuperCluster from 'supercluster';\n\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, SuppressedError, Symbol, Iterator */\r\n\r\n\r\nfunction __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\ntypeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\r\n    var e = new Error(message);\r\n    return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\r\n};\n\n/**\n * Copyright 2023 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * util class that creates a common set of convenience functions to wrap\n * shared behavior of Advanced Markers and Markers.\n */\nclass MarkerUtils {\n    static isAdvancedMarkerAvailable(map) {\n        return (google.maps.marker &&\n            map.getMapCapabilities().isAdvancedMarkersAvailable === true);\n    }\n    static isAdvancedMarker(marker) {\n        return (google.maps.marker &&\n            marker instanceof google.maps.marker.AdvancedMarkerElement);\n    }\n    static setMap(marker, map) {\n        if (this.isAdvancedMarker(marker)) {\n            marker.map = map;\n        }\n        else {\n            marker.setMap(map);\n        }\n    }\n    static getPosition(marker) {\n        // SuperClusterAlgorithm.calculate expects a LatLng instance so we fake it for Adv Markers\n        if (this.isAdvancedMarker(marker)) {\n            if (marker.position) {\n                if (marker.position instanceof google.maps.LatLng) {\n                    return marker.position;\n                }\n                // since we can't cast to LatLngLiteral for reasons =(\n                if (Number.isFinite(marker.position.lat) &&\n                    Number.isFinite(marker.position.lng)) {\n                    return new google.maps.LatLng(marker.position.lat, marker.position.lng);\n                }\n            }\n            // @ts-ignore\n            return new google.maps.LatLng(null);\n        }\n        return marker.getPosition();\n    }\n    static getVisible(marker) {\n        if (this.isAdvancedMarker(marker)) {\n            /**\n             * Always return true for Advanced Markers because the clusterer\n             * uses getVisible as a way to count legacy markers not as an actual\n             * indicator of visibility for some reason. Even when markers are hidden\n             * Marker.getVisible returns `true` and this is used to set the marker count\n             * on the cluster. See the behavior of Cluster.count\n             */\n            return true;\n        }\n        return marker.getVisible();\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nclass Cluster {\n    constructor({ markers, position }) {\n        this.markers = [];\n        if (markers)\n            this.markers = markers;\n        if (position) {\n            if (position instanceof google.maps.LatLng) {\n                this._position = position;\n            }\n            else {\n                this._position = new google.maps.LatLng(position);\n            }\n        }\n    }\n    get bounds() {\n        if (this.markers.length === 0 && !this._position) {\n            return;\n        }\n        const bounds = new google.maps.LatLngBounds(this._position, this._position);\n        for (const marker of this.markers) {\n            bounds.extend(MarkerUtils.getPosition(marker));\n        }\n        return bounds;\n    }\n    get position() {\n        // @ts-ignore\n        return this._position || this.bounds.getCenter();\n    }\n    /**\n     * Get the count of **visible** markers.\n     */\n    get count() {\n        return this.markers.filter((m) => MarkerUtils.getVisible(m)).length;\n    }\n    /**\n     * Add a marker to the cluster.\n     */\n    push(marker) {\n        this.markers.push(marker);\n    }\n    /**\n     * Cleanup references and remove marker from map.\n     */\n    delete() {\n        if (this.marker) {\n            MarkerUtils.setMap(this.marker, null);\n            this.marker = undefined;\n        }\n        this.markers.length = 0;\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A typescript assertion function used in cases where typescript has to be\n * convinced that the object in question can not be null.\n *\n * @param value\n * @param message\n */\nfunction assertNotNull(value, message = \"assertion failed\") {\n    if (value === null || value === undefined) {\n        throw Error(message);\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Returns the markers visible in a padded map viewport\n *\n * @param map\n * @param mapCanvasProjection\n * @param markers The list of marker to filter\n * @param viewportPaddingPixels The padding in pixel\n * @returns The list of markers in the padded viewport\n */\nconst filterMarkersToPaddedViewport = (map, mapCanvasProjection, markers, viewportPaddingPixels) => {\n    const bounds = map.getBounds();\n    assertNotNull(bounds);\n    const extendedMapBounds = extendBoundsToPaddedViewport(bounds, mapCanvasProjection, viewportPaddingPixels);\n    return markers.filter((marker) => extendedMapBounds.contains(MarkerUtils.getPosition(marker)));\n};\n/**\n * Extends bounds by a number of pixels in each direction\n */\nconst extendBoundsToPaddedViewport = (bounds, projection, numPixels) => {\n    const { northEast, southWest } = latLngBoundsToPixelBounds(bounds, projection);\n    const extendedPixelBounds = extendPixelBounds({ northEast, southWest }, numPixels);\n    return pixelBoundsToLatLngBounds(extendedPixelBounds, projection);\n};\n/**\n * Gets the extended bounds as a bbox [westLng, southLat, eastLng, northLat]\n */\nconst getPaddedViewport = (bounds, projection, pixels) => {\n    const extended = extendBoundsToPaddedViewport(bounds, projection, pixels);\n    const ne = extended.getNorthEast();\n    const sw = extended.getSouthWest();\n    return [sw.lng(), sw.lat(), ne.lng(), ne.lat()];\n};\n/**\n * Returns the distance between 2 positions.\n *\n * @hidden\n */\nconst distanceBetweenPoints = (p1, p2) => {\n    const R = 6371; // Radius of the Earth in km\n    const dLat = ((p2.lat - p1.lat) * Math.PI) / 180;\n    const dLon = ((p2.lng - p1.lng) * Math.PI) / 180;\n    const sinDLat = Math.sin(dLat / 2);\n    const sinDLon = Math.sin(dLon / 2);\n    const a = sinDLat * sinDLat +\n        Math.cos((p1.lat * Math.PI) / 180) *\n            Math.cos((p2.lat * Math.PI) / 180) *\n            sinDLon *\n            sinDLon;\n    const c = 2 * Math.atan2(Math.sqrt(a), Math.sqrt(1 - a));\n    return R * c;\n};\n/**\n * Converts a LatLng bound to pixels.\n *\n * @hidden\n */\nconst latLngBoundsToPixelBounds = (bounds, projection) => {\n    const northEast = projection.fromLatLngToDivPixel(bounds.getNorthEast());\n    const southWest = projection.fromLatLngToDivPixel(bounds.getSouthWest());\n    assertNotNull(northEast);\n    assertNotNull(southWest);\n    return { northEast, southWest };\n};\n/**\n * Extends a pixel bounds by numPixels in all directions.\n *\n * @hidden\n */\nconst extendPixelBounds = ({ northEast, southWest }, numPixels) => {\n    northEast.x += numPixels;\n    northEast.y -= numPixels;\n    southWest.x -= numPixels;\n    southWest.y += numPixels;\n    return { northEast, southWest };\n};\n/**\n * @hidden\n */\nconst pixelBoundsToLatLngBounds = ({ northEast, southWest }, projection) => {\n    const sw = projection.fromDivPixelToLatLng(southWest);\n    const ne = projection.fromDivPixelToLatLng(northEast);\n    return new google.maps.LatLngBounds(sw, ne);\n};\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * @hidden\n */\nclass AbstractAlgorithm {\n    constructor({ maxZoom = 16 }) {\n        this.maxZoom = maxZoom;\n    }\n    /**\n     * Helper function to bypass clustering based upon some map state such as\n     * zoom, number of markers, etc.\n     *\n     * ```typescript\n     *  cluster({markers, map}: AlgorithmInput): Cluster[] {\n     *    if (shouldBypassClustering(map)) {\n     *      return this.noop({markers})\n     *    }\n     * }\n     * ```\n     */\n    noop({ markers, }) {\n        return noop(markers);\n    }\n}\n/**\n * Abstract viewport algorithm proves a class to filter markers by a padded\n * viewport. This is a common optimization.\n *\n * @hidden\n */\nclass AbstractViewportAlgorithm extends AbstractAlgorithm {\n    constructor(_a) {\n        var { viewportPadding = 60 } = _a, options = __rest(_a, [\"viewportPadding\"]);\n        super(options);\n        this.viewportPadding = 60;\n        this.viewportPadding = viewportPadding;\n    }\n    calculate({ markers, map, mapCanvasProjection, }) {\n        const zoom = map.getZoom();\n        assertNotNull(zoom);\n        if (zoom >= this.maxZoom) {\n            return {\n                clusters: this.noop({\n                    markers,\n                }),\n                changed: false,\n            };\n        }\n        return {\n            clusters: this.cluster({\n                markers: filterMarkersToPaddedViewport(map, mapCanvasProjection, markers, this.viewportPadding),\n                map,\n                mapCanvasProjection,\n            }),\n        };\n    }\n}\n/**\n * @hidden\n */\nconst noop = (markers) => {\n    const clusters = markers.map((marker) => new Cluster({\n        position: MarkerUtils.getPosition(marker),\n        markers: [marker],\n    }));\n    return clusters;\n};\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * The default Grid algorithm historically used in Google Maps marker\n * clustering.\n *\n * The Grid algorithm does not implement caching and markers may flash as the\n * viewport changes. Instead use {@link SuperClusterAlgorithm}.\n */\nclass GridAlgorithm extends AbstractViewportAlgorithm {\n    constructor(_a) {\n        var { maxDistance = 40000, gridSize = 40 } = _a, options = __rest(_a, [\"maxDistance\", \"gridSize\"]);\n        super(options);\n        this.clusters = [];\n        this.state = { zoom: -1 };\n        this.maxDistance = maxDistance;\n        this.gridSize = gridSize;\n    }\n    calculate({ markers, map, mapCanvasProjection, }) {\n        const zoom = map.getZoom();\n        assertNotNull(zoom);\n        const newState = { zoom };\n        let changed = false;\n        if (this.state.zoom >= this.maxZoom && newState.zoom >= this.maxZoom) ;\n        else {\n            changed = !deepEqual(this.state, newState);\n        }\n        this.state = newState;\n        if (zoom >= this.maxZoom) {\n            return {\n                clusters: this.noop({ markers }),\n                changed,\n            };\n        }\n        return {\n            clusters: this.cluster({\n                markers: filterMarkersToPaddedViewport(map, mapCanvasProjection, markers, this.viewportPadding),\n                map,\n                mapCanvasProjection,\n            }),\n        };\n    }\n    cluster({ markers, map, mapCanvasProjection, }) {\n        this.clusters = [];\n        markers.forEach((marker) => {\n            this.addToClosestCluster(marker, map, mapCanvasProjection);\n        });\n        return this.clusters;\n    }\n    addToClosestCluster(marker, map, projection) {\n        let maxDistance = this.maxDistance; // Some large number\n        let cluster = null;\n        for (let i = 0; i < this.clusters.length; i++) {\n            const candidate = this.clusters[i];\n            assertNotNull(candidate.bounds);\n            const distance = distanceBetweenPoints(candidate.bounds.getCenter().toJSON(), MarkerUtils.getPosition(marker).toJSON());\n            if (distance < maxDistance) {\n                maxDistance = distance;\n                cluster = candidate;\n            }\n        }\n        if (cluster) {\n            assertNotNull(cluster.bounds);\n            if (extendBoundsToPaddedViewport(cluster.bounds, projection, this.gridSize).contains(MarkerUtils.getPosition(marker))) {\n                cluster.push(marker);\n            }\n            else {\n                const cluster = new Cluster({ markers: [marker] });\n                this.clusters.push(cluster);\n            }\n        }\n        else {\n            const cluster = new Cluster({ markers: [marker] });\n            this.clusters.push(cluster);\n        }\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Noop algorithm does not generate any clusters or filter markers by the an extended viewport.\n */\nclass NoopAlgorithm extends AbstractAlgorithm {\n    constructor(_a) {\n        var options = __rest(_a, []);\n        super(options);\n    }\n    calculate({ markers, map, mapCanvasProjection, }) {\n        return {\n            clusters: this.cluster({ markers, map, mapCanvasProjection }),\n            changed: false,\n        };\n    }\n    cluster(input) {\n        return this.noop(input);\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A very fast JavaScript algorithm for geospatial point clustering using KD trees.\n *\n * @see https://www.npmjs.com/package/supercluster for more information on options.\n */\nclass SuperClusterAlgorithm extends AbstractAlgorithm {\n    constructor(_a) {\n        var { maxZoom, radius = 60 } = _a, options = __rest(_a, [\"maxZoom\", \"radius\"]);\n        super({ maxZoom });\n        this.markers = [];\n        this.clusters = [];\n        this.state = { zoom: -1 };\n        this.superCluster = new SuperCluster(Object.assign({ maxZoom: this.maxZoom, radius }, options));\n    }\n    calculate(input) {\n        let changed = false;\n        let zoom = input.map.getZoom();\n        assertNotNull(zoom);\n        zoom = Math.round(zoom);\n        const state = { zoom: zoom };\n        if (!deepEqual(input.markers, this.markers)) {\n            changed = true;\n            // TODO use proxy to avoid copy?\n            this.markers = [...input.markers];\n            const points = this.markers.map((marker) => {\n                const position = MarkerUtils.getPosition(marker);\n                const coordinates = [position.lng(), position.lat()];\n                return {\n                    type: \"Feature\",\n                    geometry: { type: \"Point\", coordinates },\n                    properties: { marker },\n                };\n            });\n            this.superCluster.load(points);\n        }\n        if (!changed) {\n            if (this.state.zoom <= this.maxZoom || state.zoom <= this.maxZoom) {\n                changed = !deepEqual(this.state, state);\n            }\n        }\n        this.state = state;\n        // when input is empty, return right away\n        if (input.markers.length === 0) {\n            this.clusters = [];\n            return { clusters: this.clusters, changed };\n        }\n        if (changed) {\n            this.clusters = this.cluster(input);\n        }\n        return { clusters: this.clusters, changed };\n    }\n    cluster({ map }) {\n        const zoom = map.getZoom();\n        assertNotNull(zoom);\n        return this.superCluster\n            .getClusters([-180, -90, 180, 90], Math.round(zoom))\n            .map((feature) => this.transformCluster(feature));\n    }\n    transformCluster({ geometry: { coordinates: [lng, lat], }, properties, }) {\n        if (properties.cluster) {\n            return new Cluster({\n                markers: this.superCluster\n                    .getLeaves(properties.cluster_id, Infinity)\n                    .map((leaf) => leaf.properties.marker),\n                position: { lat, lng },\n            });\n        }\n        const marker = properties.marker;\n        return new Cluster({\n            markers: [marker],\n            position: MarkerUtils.getPosition(marker),\n        });\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * A very fast JavaScript algorithm for geospatial point clustering using KD trees.\n *\n * @see https://www.npmjs.com/package/supercluster for more information on options.\n */\nclass SuperClusterViewportAlgorithm extends AbstractViewportAlgorithm {\n    constructor(_a) {\n        var { maxZoom, radius = 60, viewportPadding = 60 } = _a, options = __rest(_a, [\"maxZoom\", \"radius\", \"viewportPadding\"]);\n        super({ maxZoom, viewportPadding });\n        this.markers = [];\n        this.clusters = [];\n        this.superCluster = new SuperCluster(Object.assign({ maxZoom: this.maxZoom, radius }, options));\n        this.state = { zoom: -1, view: [0, 0, 0, 0] };\n    }\n    calculate(input) {\n        const state = this.getViewportState(input);\n        let changed = !deepEqual(this.state, state);\n        if (!deepEqual(input.markers, this.markers)) {\n            changed = true;\n            // TODO use proxy to avoid copy?\n            this.markers = [...input.markers];\n            const points = this.markers.map((marker) => {\n                const position = MarkerUtils.getPosition(marker);\n                const coordinates = [position.lng(), position.lat()];\n                return {\n                    type: \"Feature\",\n                    geometry: {\n                        type: \"Point\",\n                        coordinates,\n                    },\n                    properties: { marker },\n                };\n            });\n            this.superCluster.load(points);\n        }\n        if (changed) {\n            this.clusters = this.cluster(input);\n            this.state = state;\n        }\n        return { clusters: this.clusters, changed };\n    }\n    cluster(input) {\n        /* recalculate new state because we can't use the cached version. */\n        const state = this.getViewportState(input);\n        return this.superCluster\n            .getClusters(state.view, state.zoom)\n            .map((feature) => this.transformCluster(feature));\n    }\n    transformCluster({ geometry: { coordinates: [lng, lat], }, properties, }) {\n        if (properties.cluster) {\n            return new Cluster({\n                markers: this.superCluster\n                    .getLeaves(properties.cluster_id, Infinity)\n                    .map((leaf) => leaf.properties.marker),\n                position: { lat, lng },\n            });\n        }\n        const marker = properties.marker;\n        return new Cluster({\n            markers: [marker],\n            position: MarkerUtils.getPosition(marker),\n        });\n    }\n    getViewportState(input) {\n        const mapZoom = input.map.getZoom();\n        const mapBounds = input.map.getBounds();\n        assertNotNull(mapZoom);\n        assertNotNull(mapBounds);\n        return {\n            zoom: Math.round(mapZoom),\n            view: getPaddedViewport(mapBounds, input.mapCanvasProjection, this.viewportPadding),\n        };\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Provides statistics on all clusters in the current render cycle for use in {@link Renderer.render}.\n */\nclass ClusterStats {\n    constructor(markers, clusters) {\n        this.markers = { sum: markers.length };\n        const clusterMarkerCounts = clusters.map((a) => a.count);\n        const clusterMarkerSum = clusterMarkerCounts.reduce((a, b) => a + b, 0);\n        this.clusters = {\n            count: clusters.length,\n            markers: {\n                mean: clusterMarkerSum / clusters.length,\n                sum: clusterMarkerSum,\n                min: Math.min(...clusterMarkerCounts),\n                max: Math.max(...clusterMarkerCounts),\n            },\n        };\n    }\n}\nclass DefaultRenderer {\n    /**\n     * The default render function for the library used by {@link MarkerClusterer}.\n     *\n     * Currently set to use the following:\n     *\n     * ```typescript\n     * // change color if this cluster has more markers than the mean cluster\n     * const color =\n     *   count > Math.max(10, stats.clusters.markers.mean)\n     *     ? \"#ff0000\"\n     *     : \"#0000ff\";\n     *\n     * // create svg url with fill color\n     * const svg = window.btoa(`\n     * <svg fill=\"${color}\" xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 240 240\">\n     *   <circle cx=\"120\" cy=\"120\" opacity=\".6\" r=\"70\" />\n     *   <circle cx=\"120\" cy=\"120\" opacity=\".3\" r=\"90\" />\n     *   <circle cx=\"120\" cy=\"120\" opacity=\".2\" r=\"110\" />\n     *   <circle cx=\"120\" cy=\"120\" opacity=\".1\" r=\"130\" />\n     * </svg>`);\n     *\n     * // create marker using svg icon\n     * return new google.maps.Marker({\n     *   position,\n     *   icon: {\n     *     url: `data:image/svg+xml;base64,${svg}`,\n     *     scaledSize: new google.maps.Size(45, 45),\n     *   },\n     *   label: {\n     *     text: String(count),\n     *     color: \"rgba(255,255,255,0.9)\",\n     *     fontSize: \"12px\",\n     *   },\n     *   // adjust zIndex to be above other markers\n     *   zIndex: 1000 + count,\n     * });\n     * ```\n     */\n    render({ count, position }, stats, map) {\n        // change color if this cluster has more markers than the mean cluster\n        const color = count > Math.max(10, stats.clusters.markers.mean) ? \"#ff0000\" : \"#0000ff\";\n        // create svg literal with fill color\n        const svg = `<svg fill=\"${color}\" xmlns=\"http://www.w3.org/2000/svg\" viewBox=\"0 0 240 240\" width=\"50\" height=\"50\">\n<circle cx=\"120\" cy=\"120\" opacity=\".6\" r=\"70\" />\n<circle cx=\"120\" cy=\"120\" opacity=\".3\" r=\"90\" />\n<circle cx=\"120\" cy=\"120\" opacity=\".2\" r=\"110\" />\n<text x=\"50%\" y=\"50%\" style=\"fill:#fff\" text-anchor=\"middle\" font-size=\"50\" dominant-baseline=\"middle\" font-family=\"roboto,arial,sans-serif\">${count}</text>\n</svg>`;\n        const title = `Cluster of ${count} markers`, \n        // adjust zIndex to be above other markers\n        zIndex = Number(google.maps.Marker.MAX_ZINDEX) + count;\n        if (MarkerUtils.isAdvancedMarkerAvailable(map)) {\n            // create cluster SVG element\n            const parser = new DOMParser();\n            const svgEl = parser.parseFromString(svg, \"image/svg+xml\").documentElement;\n            svgEl.setAttribute(\"transform\", \"translate(0 25)\");\n            const clusterOptions = {\n                map,\n                position,\n                zIndex,\n                title,\n                content: svgEl,\n            };\n            return new google.maps.marker.AdvancedMarkerElement(clusterOptions);\n        }\n        const clusterOptions = {\n            position,\n            zIndex,\n            title,\n            icon: {\n                url: `data:image/svg+xml;base64,${btoa(svg)}`,\n                anchor: new google.maps.Point(25, 25),\n            },\n        };\n        return new google.maps.Marker(clusterOptions);\n    }\n}\n\n/**\n * Copyright 2019 Google LLC. All Rights Reserved.\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\n/**\n * Extends an object's prototype by another's.\n *\n * @param type1 The Type to be extended.\n * @param type2 The Type to extend with.\n * @ignore\n */\n// eslint-disable-next-line @typescript-eslint/no-explicit-any\nfunction extend(type1, type2) {\n    /* istanbul ignore next */\n    // eslint-disable-next-line prefer-const\n    for (let property in type2.prototype) {\n        type1.prototype[property] = type2.prototype[property];\n    }\n}\n/**\n * @ignore\n */\n// eslint-disable-next-line @typescript-eslint/no-unsafe-declaration-merging\nclass OverlayViewSafe {\n    constructor() {\n        // MarkerClusterer implements google.maps.OverlayView interface. We use the\n        // extend function to extend MarkerClusterer with google.maps.OverlayView\n        // because it might not always be available when the code is defined so we\n        // look for it at the last possible moment. If it doesn't exist now then\n        // there is no point going ahead :)\n        extend(OverlayViewSafe, google.maps.OverlayView);\n    }\n}\n\n/**\n * Copyright 2021 Google LLC\n *\n * Licensed under the Apache License, Version 2.0 (the \"License\");\n * you may not use this file except in compliance with the License.\n * You may obtain a copy of the License at\n *\n *      http://www.apache.org/licenses/LICENSE-2.0\n *\n * Unless required by applicable law or agreed to in writing, software\n * distributed under the License is distributed on an \"AS IS\" BASIS,\n * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.\n * See the License for the specific language governing permissions and\n * limitations under the License.\n */\nvar MarkerClustererEvents;\n(function (MarkerClustererEvents) {\n    MarkerClustererEvents[\"CLUSTERING_BEGIN\"] = \"clusteringbegin\";\n    MarkerClustererEvents[\"CLUSTERING_END\"] = \"clusteringend\";\n    MarkerClustererEvents[\"CLUSTER_CLICK\"] = \"click\";\n    MarkerClustererEvents[\"GMP_CLICK\"] = \"gmp-click\";\n})(MarkerClustererEvents || (MarkerClustererEvents = {}));\nconst defaultOnClusterClickHandler = (_, cluster, map) => {\n    if (cluster.bounds)\n        map.fitBounds(cluster.bounds);\n};\n/**\n * MarkerClusterer creates and manages per-zoom-level clusters for large amounts\n * of markers. See {@link MarkerClustererOptions} for more details.\n *\n */\nclass MarkerClusterer extends OverlayViewSafe {\n    constructor({ map, markers = [], algorithmOptions = {}, algorithm = new SuperClusterAlgorithm(algorithmOptions), renderer = new DefaultRenderer(), onClusterClick = defaultOnClusterClickHandler, }) {\n        super();\n        /** @see {@link MarkerClustererOptions.map} */\n        this.map = null;\n        this.idleListener = null;\n        this.markers = [...markers];\n        this.clusters = [];\n        this.algorithm = algorithm;\n        this.renderer = renderer;\n        this.onClusterClick = onClusterClick;\n        if (map) {\n            this.setMap(map);\n        }\n    }\n    addMarker(marker, noDraw) {\n        if (this.markers.includes(marker)) {\n            return;\n        }\n        this.markers.push(marker);\n        if (!noDraw) {\n            this.render();\n        }\n    }\n    addMarkers(markers, noDraw) {\n        markers.forEach((marker) => {\n            this.addMarker(marker, true);\n        });\n        if (!noDraw) {\n            this.render();\n        }\n    }\n    removeMarker(marker, noDraw) {\n        const index = this.markers.indexOf(marker);\n        if (index === -1) {\n            // Marker is not in our list of markers, so do nothing:\n            return false;\n        }\n        MarkerUtils.setMap(marker, null);\n        this.markers.splice(index, 1); // Remove the marker from the list of managed markers\n        if (!noDraw) {\n            this.render();\n        }\n        return true;\n    }\n    removeMarkers(markers, noDraw) {\n        let removed = false;\n        markers.forEach((marker) => {\n            removed = this.removeMarker(marker, true) || removed;\n        });\n        if (removed && !noDraw) {\n            this.render();\n        }\n        return removed;\n    }\n    clearMarkers(noDraw) {\n        this.markers.length = 0;\n        if (!noDraw) {\n            this.render();\n        }\n    }\n    /**\n     * Recalculates and draws all the marker clusters.\n     */\n    render() {\n        const map = this.getMap();\n        if (map instanceof google.maps.Map && map.getProjection()) {\n            google.maps.event.trigger(this, MarkerClustererEvents.CLUSTERING_BEGIN, this);\n            const { clusters, changed } = this.algorithm.calculate({\n                markers: this.markers,\n                map,\n                mapCanvasProjection: this.getProjection(),\n            });\n            // Allow algorithms to return flag on whether the clusters/markers have changed.\n            if (changed || changed == undefined) {\n                // Accumulate the markers of the clusters composed of a single marker.\n                // Those clusters directly use the marker.\n                // Clusters with more than one markers use a group marker generated by a renderer.\n                const singleMarker = new Set();\n                for (const cluster of clusters) {\n                    if (cluster.markers.length == 1) {\n                        singleMarker.add(cluster.markers[0]);\n                    }\n                }\n                const groupMarkers = [];\n                // Iterate the clusters that are currently rendered.\n                for (const cluster of this.clusters) {\n                    if (cluster.marker == null) {\n                        continue;\n                    }\n                    if (cluster.markers.length == 1) {\n                        if (!singleMarker.has(cluster.marker)) {\n                            // The marker:\n                            // - was previously rendered because it is from a cluster with 1 marker,\n                            // - should no more be rendered as it is not in singleMarker.\n                            MarkerUtils.setMap(cluster.marker, null);\n                        }\n                    }\n                    else {\n                        // Delay the removal of old group markers to avoid flickering.\n                        groupMarkers.push(cluster.marker);\n                    }\n                }\n                this.clusters = clusters;\n                this.renderClusters();\n                // Delayed removal of the markers of the former groups.\n                requestAnimationFrame(() => groupMarkers.forEach((marker) => MarkerUtils.setMap(marker, null)));\n            }\n            google.maps.event.trigger(this, MarkerClustererEvents.CLUSTERING_END, this);\n        }\n    }\n    onAdd() {\n        const map = this.getMap();\n        assertNotNull(map);\n        this.idleListener = map.addListener(\"idle\", this.render.bind(this));\n        this.render();\n    }\n    onRemove() {\n        if (this.idleListener)\n            google.maps.event.removeListener(this.idleListener);\n        this.reset();\n    }\n    reset() {\n        this.markers.forEach((marker) => MarkerUtils.setMap(marker, null));\n        this.clusters.forEach((cluster) => cluster.delete());\n        this.clusters = [];\n    }\n    renderClusters() {\n        // Generate stats to pass to renderers.\n        const stats = new ClusterStats(this.markers, this.clusters);\n        const map = this.getMap();\n        this.clusters.forEach((cluster) => {\n            if (cluster.markers.length === 1) {\n                cluster.marker = cluster.markers[0];\n            }\n            else {\n                // Generate the marker to represent the group.\n                cluster.marker = this.renderer.render(cluster, stats, map);\n                // Make sure all individual markers are removed from the map.\n                cluster.markers.forEach((marker) => MarkerUtils.setMap(marker, null));\n                if (this.onClusterClick) {\n                    // legacy Marker uses 'click' events, whereas AdvancedMarkerElement uses 'gmp-click'\n                    const markerClickEventName = MarkerUtils.isAdvancedMarker(cluster.marker)\n                        ? MarkerClustererEvents.GMP_CLICK\n                        : MarkerClustererEvents.CLUSTER_CLICK;\n                    cluster.marker.addListener(markerClickEventName, \n                    /* istanbul ignore next */\n                    (event) => {\n                        google.maps.event.trigger(this, MarkerClustererEvents.CLUSTER_CLICK, cluster);\n                        this.onClusterClick(event, cluster, map);\n                    });\n                }\n            }\n            MarkerUtils.setMap(cluster.marker, map);\n        });\n    }\n}\n\nexport { AbstractAlgorithm, AbstractViewportAlgorithm, Cluster, ClusterStats, DefaultRenderer, GridAlgorithm, MarkerClusterer, MarkerClustererEvents, MarkerUtils, NoopAlgorithm, SuperClusterAlgorithm, SuperClusterViewportAlgorithm, defaultOnClusterClickHandler, distanceBetweenPoints, extendBoundsToPaddedViewport, extendPixelBounds, filterMarkersToPaddedViewport, getPaddedViewport, noop, pixelBoundsToLatLngBounds };\n//# sourceMappingURL=index.esm.mjs.map\n","var getOwnPropertyNames = Object.getOwnPropertyNames, getOwnPropertySymbols = Object.getOwnPropertySymbols;\nvar hasOwnProperty = Object.prototype.hasOwnProperty;\n/**\n * Combine two comparators into a single comparators.\n */\nfunction combineComparators(comparatorA, comparatorB) {\n    return function isEqual(a, b, state) {\n        return comparatorA(a, b, state) && comparatorB(a, b, state);\n    };\n}\n/**\n * Wrap the provided `areItemsEqual` method to manage the circular state, allowing\n * for circular references to be safely included in the comparison without creating\n * stack overflows.\n */\nfunction createIsCircular(areItemsEqual) {\n    return function isCircular(a, b, state) {\n        if (!a || !b || typeof a !== 'object' || typeof b !== 'object') {\n            return areItemsEqual(a, b, state);\n        }\n        var cache = state.cache;\n        var cachedA = cache.get(a);\n        var cachedB = cache.get(b);\n        if (cachedA && cachedB) {\n            return cachedA === b && cachedB === a;\n        }\n        cache.set(a, b);\n        cache.set(b, a);\n        var result = areItemsEqual(a, b, state);\n        cache.delete(a);\n        cache.delete(b);\n        return result;\n    };\n}\n/**\n * Get the `@@toStringTag` of the value, if it exists.\n */\nfunction getShortTag(value) {\n    return value != null ? value[Symbol.toStringTag] : undefined;\n}\n/**\n * Get the properties to strictly examine, which include both own properties that are\n * not enumerable and symbol properties.\n */\nfunction getStrictProperties(object) {\n    return getOwnPropertyNames(object).concat(getOwnPropertySymbols(object));\n}\n/**\n * Whether the object contains the property passed as an own property.\n */\nvar hasOwn = \n// eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\nObject.hasOwn ||\n    (function (object, property) {\n        return hasOwnProperty.call(object, property);\n    });\n/**\n * Whether the values passed are strictly equal or both NaN.\n */\nfunction sameValueZeroEqual(a, b) {\n    return a === b || (!a && !b && a !== a && b !== b);\n}\n\nvar PREACT_VNODE = '__v';\nvar PREACT_OWNER = '__o';\nvar REACT_OWNER = '_owner';\nvar getOwnPropertyDescriptor = Object.getOwnPropertyDescriptor, keys = Object.keys;\n/**\n * Whether the arrays are equal in value.\n */\nfunction areArraysEqual(a, b, state) {\n    var index = a.length;\n    if (b.length !== index) {\n        return false;\n    }\n    while (index-- > 0) {\n        if (!state.equals(a[index], b[index], index, index, a, b, state)) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the dates passed are equal in value.\n */\nfunction areDatesEqual(a, b) {\n    return sameValueZeroEqual(a.getTime(), b.getTime());\n}\n/**\n * Whether the errors passed are equal in value.\n */\nfunction areErrorsEqual(a, b) {\n    return (a.name === b.name &&\n        a.message === b.message &&\n        a.cause === b.cause &&\n        a.stack === b.stack);\n}\n/**\n * Whether the functions passed are equal in value.\n */\nfunction areFunctionsEqual(a, b) {\n    return a === b;\n}\n/**\n * Whether the `Map`s are equal in value.\n */\nfunction areMapsEqual(a, b, state) {\n    var size = a.size;\n    if (size !== b.size) {\n        return false;\n    }\n    if (!size) {\n        return true;\n    }\n    var matchedIndices = new Array(size);\n    var aIterable = a.entries();\n    var aResult;\n    var bResult;\n    var index = 0;\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n    while ((aResult = aIterable.next())) {\n        if (aResult.done) {\n            break;\n        }\n        var bIterable = b.entries();\n        var hasMatch = false;\n        var matchIndex = 0;\n        // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n        while ((bResult = bIterable.next())) {\n            if (bResult.done) {\n                break;\n            }\n            if (matchedIndices[matchIndex]) {\n                matchIndex++;\n                continue;\n            }\n            var aEntry = aResult.value;\n            var bEntry = bResult.value;\n            if (state.equals(aEntry[0], bEntry[0], index, matchIndex, a, b, state) &&\n                state.equals(aEntry[1], bEntry[1], aEntry[0], bEntry[0], a, b, state)) {\n                hasMatch = matchedIndices[matchIndex] = true;\n                break;\n            }\n            matchIndex++;\n        }\n        if (!hasMatch) {\n            return false;\n        }\n        index++;\n    }\n    return true;\n}\n/**\n * Whether the numbers are equal in value.\n */\nvar areNumbersEqual = sameValueZeroEqual;\n/**\n * Whether the objects are equal in value.\n */\nfunction areObjectsEqual(a, b, state) {\n    var properties = keys(a);\n    var index = properties.length;\n    if (keys(b).length !== index) {\n        return false;\n    }\n    // Decrementing `while` showed faster results than either incrementing or\n    // decrementing `for` loop and than an incrementing `while` loop. Declarative\n    // methods like `some` / `every` were not used to avoid incurring the garbage\n    // cost of anonymous callbacks.\n    while (index-- > 0) {\n        if (!isPropertyEqual(a, b, state, properties[index])) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the objects are equal in value with strict property checking.\n */\nfunction areObjectsEqualStrict(a, b, state) {\n    var properties = getStrictProperties(a);\n    var index = properties.length;\n    if (getStrictProperties(b).length !== index) {\n        return false;\n    }\n    var property;\n    var descriptorA;\n    var descriptorB;\n    // Decrementing `while` showed faster results than either incrementing or\n    // decrementing `for` loop and than an incrementing `while` loop. Declarative\n    // methods like `some` / `every` were not used to avoid incurring the garbage\n    // cost of anonymous callbacks.\n    while (index-- > 0) {\n        property = properties[index];\n        if (!isPropertyEqual(a, b, state, property)) {\n            return false;\n        }\n        descriptorA = getOwnPropertyDescriptor(a, property);\n        descriptorB = getOwnPropertyDescriptor(b, property);\n        if ((descriptorA || descriptorB) &&\n            (!descriptorA ||\n                !descriptorB ||\n                descriptorA.configurable !== descriptorB.configurable ||\n                descriptorA.enumerable !== descriptorB.enumerable ||\n                descriptorA.writable !== descriptorB.writable)) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the primitive wrappers passed are equal in value.\n */\nfunction arePrimitiveWrappersEqual(a, b) {\n    return sameValueZeroEqual(a.valueOf(), b.valueOf());\n}\n/**\n * Whether the regexps passed are equal in value.\n */\nfunction areRegExpsEqual(a, b) {\n    return a.source === b.source && a.flags === b.flags;\n}\n/**\n * Whether the `Set`s are equal in value.\n */\nfunction areSetsEqual(a, b, state) {\n    var size = a.size;\n    if (size !== b.size) {\n        return false;\n    }\n    if (!size) {\n        return true;\n    }\n    var matchedIndices = new Array(size);\n    var aIterable = a.values();\n    var aResult;\n    var bResult;\n    // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n    while ((aResult = aIterable.next())) {\n        if (aResult.done) {\n            break;\n        }\n        var bIterable = b.values();\n        var hasMatch = false;\n        var matchIndex = 0;\n        // eslint-disable-next-line @typescript-eslint/no-unnecessary-condition\n        while ((bResult = bIterable.next())) {\n            if (bResult.done) {\n                break;\n            }\n            if (!matchedIndices[matchIndex] &&\n                state.equals(aResult.value, bResult.value, aResult.value, bResult.value, a, b, state)) {\n                hasMatch = matchedIndices[matchIndex] = true;\n                break;\n            }\n            matchIndex++;\n        }\n        if (!hasMatch) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the TypedArray instances are equal in value.\n */\nfunction areTypedArraysEqual(a, b) {\n    var index = a.length;\n    if (b.length !== index) {\n        return false;\n    }\n    while (index-- > 0) {\n        if (a[index] !== b[index]) {\n            return false;\n        }\n    }\n    return true;\n}\n/**\n * Whether the URL instances are equal in value.\n */\nfunction areUrlsEqual(a, b) {\n    return (a.hostname === b.hostname &&\n        a.pathname === b.pathname &&\n        a.protocol === b.protocol &&\n        a.port === b.port &&\n        a.hash === b.hash &&\n        a.username === b.username &&\n        a.password === b.password);\n}\nfunction isPropertyEqual(a, b, state, property) {\n    if ((property === REACT_OWNER ||\n        property === PREACT_OWNER ||\n        property === PREACT_VNODE) &&\n        (a.$$typeof || b.$$typeof)) {\n        return true;\n    }\n    return (hasOwn(b, property) &&\n        state.equals(a[property], b[property], property, property, a, b, state));\n}\n\nvar ARGUMENTS_TAG = '[object Arguments]';\nvar BOOLEAN_TAG = '[object Boolean]';\nvar DATE_TAG = '[object Date]';\nvar ERROR_TAG = '[object Error]';\nvar MAP_TAG = '[object Map]';\nvar NUMBER_TAG = '[object Number]';\nvar OBJECT_TAG = '[object Object]';\nvar REG_EXP_TAG = '[object RegExp]';\nvar SET_TAG = '[object Set]';\nvar STRING_TAG = '[object String]';\nvar URL_TAG = '[object URL]';\nvar isArray = Array.isArray;\nvar isTypedArray = typeof ArrayBuffer !== 'undefined' && typeof ArrayBuffer.isView === 'function'\n    ? ArrayBuffer.isView\n    : null;\nvar assign = Object.assign;\nvar getTag = Object.prototype.toString.call.bind(Object.prototype.toString);\n/**\n * Create a comparator method based on the type-specific equality comparators passed.\n */\nfunction createEqualityComparator(_a) {\n    var areArraysEqual = _a.areArraysEqual, areDatesEqual = _a.areDatesEqual, areErrorsEqual = _a.areErrorsEqual, areFunctionsEqual = _a.areFunctionsEqual, areMapsEqual = _a.areMapsEqual, areNumbersEqual = _a.areNumbersEqual, areObjectsEqual = _a.areObjectsEqual, arePrimitiveWrappersEqual = _a.arePrimitiveWrappersEqual, areRegExpsEqual = _a.areRegExpsEqual, areSetsEqual = _a.areSetsEqual, areTypedArraysEqual = _a.areTypedArraysEqual, areUrlsEqual = _a.areUrlsEqual, unknownTagComparators = _a.unknownTagComparators;\n    /**\n     * compare the value of the two objects and return true if they are equivalent in values\n     */\n    return function comparator(a, b, state) {\n        // If the items are strictly equal, no need to do a value comparison.\n        if (a === b) {\n            return true;\n        }\n        // If either of the items are nullish and fail the strictly equal check\n        // above, then they must be unequal.\n        if (a == null || b == null) {\n            return false;\n        }\n        var type = typeof a;\n        if (type !== typeof b) {\n            return false;\n        }\n        if (type !== 'object') {\n            if (type === 'number') {\n                return areNumbersEqual(a, b, state);\n            }\n            if (type === 'function') {\n                return areFunctionsEqual(a, b, state);\n            }\n            // If a primitive value that is not strictly equal, it must be unequal.\n            return false;\n        }\n        var constructor = a.constructor;\n        // Checks are listed in order of commonality of use-case:\n        //   1. Common complex object types (plain object, array)\n        //   2. Common data values (date, regexp)\n        //   3. Less-common complex object types (map, set)\n        //   4. Less-common data values (promise, primitive wrappers)\n        // Inherently this is both subjective and assumptive, however\n        // when reviewing comparable libraries in the wild this order\n        // appears to be generally consistent.\n        // Constructors should match, otherwise there is potential for false positives\n        // between class and subclass or custom object and POJO.\n        if (constructor !== b.constructor) {\n            return false;\n        }\n        // `isPlainObject` only checks against the object's own realm. Cross-realm\n        // comparisons are rare, and will be handled in the ultimate fallback, so\n        // we can avoid capturing the string tag.\n        if (constructor === Object) {\n            return areObjectsEqual(a, b, state);\n        }\n        // `isArray()` works on subclasses and is cross-realm, so we can avoid capturing\n        // the string tag or doing an `instanceof` check.\n        if (isArray(a)) {\n            return areArraysEqual(a, b, state);\n        }\n        // `isTypedArray()` works on all possible TypedArray classes, so we can avoid\n        // capturing the string tag or comparing against all possible constructors.\n        if (isTypedArray != null && isTypedArray(a)) {\n            return areTypedArraysEqual(a, b, state);\n        }\n        // Try to fast-path equality checks for other complex object types in the\n        // same realm to avoid capturing the string tag. Strict equality is used\n        // instead of `instanceof` because it is more performant for the common\n        // use-case. If someone is subclassing a native class, it will be handled\n        // with the string tag comparison.\n        if (constructor === Date) {\n            return areDatesEqual(a, b, state);\n        }\n        if (constructor === RegExp) {\n            return areRegExpsEqual(a, b, state);\n        }\n        if (constructor === Map) {\n            return areMapsEqual(a, b, state);\n        }\n        if (constructor === Set) {\n            return areSetsEqual(a, b, state);\n        }\n        // Since this is a custom object, capture the string tag to determing its type.\n        // This is reasonably performant in modern environments like v8 and SpiderMonkey.\n        var tag = getTag(a);\n        if (tag === DATE_TAG) {\n            return areDatesEqual(a, b, state);\n        }\n        // For RegExp, the properties are not enumerable, and therefore will give false positives if\n        // tested like a standard object.\n        if (tag === REG_EXP_TAG) {\n            return areRegExpsEqual(a, b, state);\n        }\n        if (tag === MAP_TAG) {\n            return areMapsEqual(a, b, state);\n        }\n        if (tag === SET_TAG) {\n            return areSetsEqual(a, b, state);\n        }\n        if (tag === OBJECT_TAG) {\n            // The exception for value comparison is custom `Promise`-like class instances. These should\n            // be treated the same as standard `Promise` objects, which means strict equality, and if\n            // it reaches this point then that strict equality comparison has already failed.\n            return (typeof a.then !== 'function' &&\n                typeof b.then !== 'function' &&\n                areObjectsEqual(a, b, state));\n        }\n        // If a URL tag, it should be tested explicitly. Like RegExp, the properties are not\n        // enumerable, and therefore will give false positives if tested like a standard object.\n        if (tag === URL_TAG) {\n            return areUrlsEqual(a, b, state);\n        }\n        // If an error tag, it should be tested explicitly. Like RegExp, the properties are not\n        // enumerable, and therefore will give false positives if tested like a standard object.\n        if (tag === ERROR_TAG) {\n            return areErrorsEqual(a, b, state);\n        }\n        // If an arguments tag, it should be treated as a standard object.\n        if (tag === ARGUMENTS_TAG) {\n            return areObjectsEqual(a, b, state);\n        }\n        // As the penultimate fallback, check if the values passed are primitive wrappers. This\n        // is very rare in modern JS, which is why it is deprioritized compared to all other object\n        // types.\n        if (tag === BOOLEAN_TAG || tag === NUMBER_TAG || tag === STRING_TAG) {\n            return arePrimitiveWrappersEqual(a, b, state);\n        }\n        if (unknownTagComparators) {\n            var unknownTagComparator = unknownTagComparators[tag];\n            if (!unknownTagComparator) {\n                var shortTag = getShortTag(a);\n                if (shortTag) {\n                    unknownTagComparator = unknownTagComparators[shortTag];\n                }\n            }\n            // If the custom config has an unknown tag comparator that matches the captured tag or the\n            // @@toStringTag, it is the source of truth for whether the values are equal.\n            if (unknownTagComparator) {\n                return unknownTagComparator(a, b, state);\n            }\n        }\n        // If not matching any tags that require a specific type of comparison, then we hard-code false because\n        // the only thing remaining is strict equality, which has already been compared. This is for a few reasons:\n        //   - Certain types that cannot be introspected (e.g., `WeakMap`). For these types, this is the only\n        //     comparison that can be made.\n        //   - For types that can be introspected, but rarely have requirements to be compared\n        //     (`ArrayBuffer`, `DataView`, etc.), the cost is avoided to prioritize the common\n        //     use-cases (may be included in a future release, if requested enough).\n        //   - For types that can be introspected but do not have an objective definition of what\n        //     equality is (`Error`, etc.), the subjective decision is to be conservative and strictly compare.\n        // In all cases, these decisions should be reevaluated based on changes to the language and\n        // common development practices.\n        return false;\n    };\n}\n/**\n * Create the configuration object used for building comparators.\n */\nfunction createEqualityComparatorConfig(_a) {\n    var circular = _a.circular, createCustomConfig = _a.createCustomConfig, strict = _a.strict;\n    var config = {\n        areArraysEqual: strict\n            ? areObjectsEqualStrict\n            : areArraysEqual,\n        areDatesEqual: areDatesEqual,\n        areErrorsEqual: areErrorsEqual,\n        areFunctionsEqual: areFunctionsEqual,\n        areMapsEqual: strict\n            ? combineComparators(areMapsEqual, areObjectsEqualStrict)\n            : areMapsEqual,\n        areNumbersEqual: areNumbersEqual,\n        areObjectsEqual: strict\n            ? areObjectsEqualStrict\n            : areObjectsEqual,\n        arePrimitiveWrappersEqual: arePrimitiveWrappersEqual,\n        areRegExpsEqual: areRegExpsEqual,\n        areSetsEqual: strict\n            ? combineComparators(areSetsEqual, areObjectsEqualStrict)\n            : areSetsEqual,\n        areTypedArraysEqual: strict\n            ? areObjectsEqualStrict\n            : areTypedArraysEqual,\n        areUrlsEqual: areUrlsEqual,\n        unknownTagComparators: undefined,\n    };\n    if (createCustomConfig) {\n        config = assign({}, config, createCustomConfig(config));\n    }\n    if (circular) {\n        var areArraysEqual$1 = createIsCircular(config.areArraysEqual);\n        var areMapsEqual$1 = createIsCircular(config.areMapsEqual);\n        var areObjectsEqual$1 = createIsCircular(config.areObjectsEqual);\n        var areSetsEqual$1 = createIsCircular(config.areSetsEqual);\n        config = assign({}, config, {\n            areArraysEqual: areArraysEqual$1,\n            areMapsEqual: areMapsEqual$1,\n            areObjectsEqual: areObjectsEqual$1,\n            areSetsEqual: areSetsEqual$1,\n        });\n    }\n    return config;\n}\n/**\n * Default equality comparator pass-through, used as the standard `isEqual` creator for\n * use inside the built comparator.\n */\nfunction createInternalEqualityComparator(compare) {\n    return function (a, b, _indexOrKeyA, _indexOrKeyB, _parentA, _parentB, state) {\n        return compare(a, b, state);\n    };\n}\n/**\n * Create the `isEqual` function used by the consuming application.\n */\nfunction createIsEqual(_a) {\n    var circular = _a.circular, comparator = _a.comparator, createState = _a.createState, equals = _a.equals, strict = _a.strict;\n    if (createState) {\n        return function isEqual(a, b) {\n            var _a = createState(), _b = _a.cache, cache = _b === void 0 ? circular ? new WeakMap() : undefined : _b, meta = _a.meta;\n            return comparator(a, b, {\n                cache: cache,\n                equals: equals,\n                meta: meta,\n                strict: strict,\n            });\n        };\n    }\n    if (circular) {\n        return function isEqual(a, b) {\n            return comparator(a, b, {\n                cache: new WeakMap(),\n                equals: equals,\n                meta: undefined,\n                strict: strict,\n            });\n        };\n    }\n    var state = {\n        cache: undefined,\n        equals: equals,\n        meta: undefined,\n        strict: strict,\n    };\n    return function isEqual(a, b) {\n        return comparator(a, b, state);\n    };\n}\n\n/**\n * Whether the items passed are deeply-equal in value.\n */\nvar deepEqual = createCustomEqual();\n/**\n * Whether the items passed are deeply-equal in value based on strict comparison.\n */\nvar strictDeepEqual = createCustomEqual({ strict: true });\n/**\n * Whether the items passed are deeply-equal in value, including circular references.\n */\nvar circularDeepEqual = createCustomEqual({ circular: true });\n/**\n * Whether the items passed are deeply-equal in value, including circular references,\n * based on strict comparison.\n */\nvar strictCircularDeepEqual = createCustomEqual({\n    circular: true,\n    strict: true,\n});\n/**\n * Whether the items passed are shallowly-equal in value.\n */\nvar shallowEqual = createCustomEqual({\n    createInternalComparator: function () { return sameValueZeroEqual; },\n});\n/**\n * Whether the items passed are shallowly-equal in value based on strict comparison\n */\nvar strictShallowEqual = createCustomEqual({\n    strict: true,\n    createInternalComparator: function () { return sameValueZeroEqual; },\n});\n/**\n * Whether the items passed are shallowly-equal in value, including circular references.\n */\nvar circularShallowEqual = createCustomEqual({\n    circular: true,\n    createInternalComparator: function () { return sameValueZeroEqual; },\n});\n/**\n * Whether the items passed are shallowly-equal in value, including circular references,\n * based on strict comparison.\n */\nvar strictCircularShallowEqual = createCustomEqual({\n    circular: true,\n    createInternalComparator: function () { return sameValueZeroEqual; },\n    strict: true,\n});\n/**\n * Create a custom equality comparison method.\n *\n * This can be done to create very targeted comparisons in extreme hot-path scenarios\n * where the standard methods are not performant enough, but can also be used to provide\n * support for legacy environments that do not support expected features like\n * `RegExp.prototype.flags` out of the box.\n */\nfunction createCustomEqual(options) {\n    if (options === void 0) { options = {}; }\n    var _a = options.circular, circular = _a === void 0 ? false : _a, createCustomInternalComparator = options.createInternalComparator, createState = options.createState, _b = options.strict, strict = _b === void 0 ? false : _b;\n    var config = createEqualityComparatorConfig(options);\n    var comparator = createEqualityComparator(config);\n    var equals = createCustomInternalComparator\n        ? createCustomInternalComparator(comparator)\n        : createInternalEqualityComparator(comparator);\n    return createIsEqual({ circular: circular, comparator: comparator, createState: createState, equals: equals, strict: strict });\n}\n\nexport { circularDeepEqual, circularShallowEqual, createCustomEqual, deepEqual, sameValueZeroEqual, shallowEqual, strictCircularDeepEqual, strictCircularShallowEqual, strictDeepEqual, strictShallowEqual };\n//# sourceMappingURL=index.mjs.map\n","\nconst ARRAY_TYPES = [\n    Int8Array, Uint8Array, Uint8ClampedArray, Int16Array, Uint16Array,\n    Int32Array, Uint32Array, Float32Array, Float64Array\n];\n\n/** @typedef {Int8ArrayConstructor | Uint8ArrayConstructor | Uint8ClampedArrayConstructor | Int16ArrayConstructor | Uint16ArrayConstructor | Int32ArrayConstructor | Uint32ArrayConstructor | Float32ArrayConstructor | Float64ArrayConstructor} TypedArrayConstructor */\n\nconst VERSION = 1; // serialized format version\nconst HEADER_SIZE = 8;\n\nexport default class KDBush {\n\n    /**\n     * Creates an index from raw `ArrayBuffer` data.\n     * @param {ArrayBuffer} data\n     */\n    static from(data) {\n        if (!(data instanceof ArrayBuffer)) {\n            throw new Error('Data must be an instance of ArrayBuffer.');\n        }\n        const [magic, versionAndType] = new Uint8Array(data, 0, 2);\n        if (magic !== 0xdb) {\n            throw new Error('Data does not appear to be in a KDBush format.');\n        }\n        const version = versionAndType >> 4;\n        if (version !== VERSION) {\n            throw new Error(`Got v${version} data when expected v${VERSION}.`);\n        }\n        const ArrayType = ARRAY_TYPES[versionAndType & 0x0f];\n        if (!ArrayType) {\n            throw new Error('Unrecognized array type.');\n        }\n        const [nodeSize] = new Uint16Array(data, 2, 1);\n        const [numItems] = new Uint32Array(data, 4, 1);\n\n        return new KDBush(numItems, nodeSize, ArrayType, data);\n    }\n\n    /**\n     * Creates an index that will hold a given number of items.\n     * @param {number} numItems\n     * @param {number} [nodeSize=64] Size of the KD-tree node (64 by default).\n     * @param {TypedArrayConstructor} [ArrayType=Float64Array] The array type used for coordinates storage (`Float64Array` by default).\n     * @param {ArrayBuffer} [data] (For internal use only)\n     */\n    constructor(numItems, nodeSize = 64, ArrayType = Float64Array, data) {\n        if (isNaN(numItems) || numItems < 0) throw new Error(`Unpexpected numItems value: ${numItems}.`);\n\n        this.numItems = +numItems;\n        this.nodeSize = Math.min(Math.max(+nodeSize, 2), 65535);\n        this.ArrayType = ArrayType;\n        this.IndexArrayType = numItems < 65536 ? Uint16Array : Uint32Array;\n\n        const arrayTypeIndex = ARRAY_TYPES.indexOf(this.ArrayType);\n        const coordsByteSize = numItems * 2 * this.ArrayType.BYTES_PER_ELEMENT;\n        const idsByteSize = numItems * this.IndexArrayType.BYTES_PER_ELEMENT;\n        const padCoords = (8 - idsByteSize % 8) % 8;\n\n        if (arrayTypeIndex < 0) {\n            throw new Error(`Unexpected typed array class: ${ArrayType}.`);\n        }\n\n        if (data && (data instanceof ArrayBuffer)) { // reconstruct an index from a buffer\n            this.data = data;\n            this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);\n            this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = numItems * 2;\n            this._finished = true;\n        } else { // initialize a new index\n            this.data = new ArrayBuffer(HEADER_SIZE + coordsByteSize + idsByteSize + padCoords);\n            this.ids = new this.IndexArrayType(this.data, HEADER_SIZE, numItems);\n            this.coords = new this.ArrayType(this.data, HEADER_SIZE + idsByteSize + padCoords, numItems * 2);\n            this._pos = 0;\n            this._finished = false;\n\n            // set header\n            new Uint8Array(this.data, 0, 2).set([0xdb, (VERSION << 4) + arrayTypeIndex]);\n            new Uint16Array(this.data, 2, 1)[0] = nodeSize;\n            new Uint32Array(this.data, 4, 1)[0] = numItems;\n        }\n    }\n\n    /**\n     * Add a point to the index.\n     * @param {number} x\n     * @param {number} y\n     * @returns {number} An incremental index associated with the added item (starting from `0`).\n     */\n    add(x, y) {\n        const index = this._pos >> 1;\n        this.ids[index] = index;\n        this.coords[this._pos++] = x;\n        this.coords[this._pos++] = y;\n        return index;\n    }\n\n    /**\n     * Perform indexing of the added points.\n     */\n    finish() {\n        const numAdded = this._pos >> 1;\n        if (numAdded !== this.numItems) {\n            throw new Error(`Added ${numAdded} items when expected ${this.numItems}.`);\n        }\n        // kd-sort both arrays for efficient search\n        sort(this.ids, this.coords, this.nodeSize, 0, this.numItems - 1, 0);\n\n        this._finished = true;\n        return this;\n    }\n\n    /**\n     * Search the index for items within a given bounding box.\n     * @param {number} minX\n     * @param {number} minY\n     * @param {number} maxX\n     * @param {number} maxY\n     * @returns {number[]} An array of indices correponding to the found items.\n     */\n    range(minX, minY, maxX, maxY) {\n        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        const stack = [0, ids.length - 1, 0];\n        const result = [];\n\n        // recursively search for items in range in the kd-sorted arrays\n        while (stack.length) {\n            const axis = stack.pop() || 0;\n            const right = stack.pop() || 0;\n            const left = stack.pop() || 0;\n\n            // if we reached \"tree node\", search linearly\n            if (right - left <= nodeSize) {\n                for (let i = left; i <= right; i++) {\n                    const x = coords[2 * i];\n                    const y = coords[2 * i + 1];\n                    if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[i]);\n                }\n                continue;\n            }\n\n            // otherwise find the middle index\n            const m = (left + right) >> 1;\n\n            // include the middle item if it's in range\n            const x = coords[2 * m];\n            const y = coords[2 * m + 1];\n            if (x >= minX && x <= maxX && y >= minY && y <= maxY) result.push(ids[m]);\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? minX <= x : minY <= y) {\n                stack.push(left);\n                stack.push(m - 1);\n                stack.push(1 - axis);\n            }\n            if (axis === 0 ? maxX >= x : maxY >= y) {\n                stack.push(m + 1);\n                stack.push(right);\n                stack.push(1 - axis);\n            }\n        }\n\n        return result;\n    }\n\n    /**\n     * Search the index for items within a given radius.\n     * @param {number} qx\n     * @param {number} qy\n     * @param {number} r Query radius.\n     * @returns {number[]} An array of indices correponding to the found items.\n     */\n    within(qx, qy, r) {\n        if (!this._finished) throw new Error('Data not yet indexed - call index.finish().');\n\n        const {ids, coords, nodeSize} = this;\n        const stack = [0, ids.length - 1, 0];\n        const result = [];\n        const r2 = r * r;\n\n        // recursively search for items within radius in the kd-sorted arrays\n        while (stack.length) {\n            const axis = stack.pop() || 0;\n            const right = stack.pop() || 0;\n            const left = stack.pop() || 0;\n\n            // if we reached \"tree node\", search linearly\n            if (right - left <= nodeSize) {\n                for (let i = left; i <= right; i++) {\n                    if (sqDist(coords[2 * i], coords[2 * i + 1], qx, qy) <= r2) result.push(ids[i]);\n                }\n                continue;\n            }\n\n            // otherwise find the middle index\n            const m = (left + right) >> 1;\n\n            // include the middle item if it's in range\n            const x = coords[2 * m];\n            const y = coords[2 * m + 1];\n            if (sqDist(x, y, qx, qy) <= r2) result.push(ids[m]);\n\n            // queue search in halves that intersect the query\n            if (axis === 0 ? qx - r <= x : qy - r <= y) {\n                stack.push(left);\n                stack.push(m - 1);\n                stack.push(1 - axis);\n            }\n            if (axis === 0 ? qx + r >= x : qy + r >= y) {\n                stack.push(m + 1);\n                stack.push(right);\n                stack.push(1 - axis);\n            }\n        }\n\n        return result;\n    }\n}\n\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} nodeSize\n * @param {number} left\n * @param {number} right\n * @param {number} axis\n */\nfunction sort(ids, coords, nodeSize, left, right, axis) {\n    if (right - left <= nodeSize) return;\n\n    const m = (left + right) >> 1; // middle index\n\n    // sort ids and coords around the middle index so that the halves lie\n    // either left/right or top/bottom correspondingly (taking turns)\n    select(ids, coords, m, left, right, axis);\n\n    // recursively kd-sort first half and second half on the opposite axis\n    sort(ids, coords, nodeSize, left, m - 1, 1 - axis);\n    sort(ids, coords, nodeSize, m + 1, right, 1 - axis);\n}\n\n/**\n * Custom Floyd-Rivest selection algorithm: sort ids and coords so that\n * [left..k-1] items are smaller than k-th item (on either x or y axis)\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} k\n * @param {number} left\n * @param {number} right\n * @param {number} axis\n */\nfunction select(ids, coords, k, left, right, axis) {\n\n    while (right > left) {\n        if (right - left > 600) {\n            const n = right - left + 1;\n            const m = k - left + 1;\n            const z = Math.log(n);\n            const s = 0.5 * Math.exp(2 * z / 3);\n            const sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n            const newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n            const newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n            select(ids, coords, k, newLeft, newRight, axis);\n        }\n\n        const t = coords[2 * k + axis];\n        let i = left;\n        let j = right;\n\n        swapItem(ids, coords, left, k);\n        if (coords[2 * right + axis] > t) swapItem(ids, coords, left, right);\n\n        while (i < j) {\n            swapItem(ids, coords, i, j);\n            i++;\n            j--;\n            while (coords[2 * i + axis] < t) i++;\n            while (coords[2 * j + axis] > t) j--;\n        }\n\n        if (coords[2 * left + axis] === t) swapItem(ids, coords, left, j);\n        else {\n            j++;\n            swapItem(ids, coords, j, right);\n        }\n\n        if (j <= k) left = j + 1;\n        if (k <= j) right = j - 1;\n    }\n}\n\n/**\n * @param {Uint16Array | Uint32Array} ids\n * @param {InstanceType<TypedArrayConstructor>} coords\n * @param {number} i\n * @param {number} j\n */\nfunction swapItem(ids, coords, i, j) {\n    swap(ids, i, j);\n    swap(coords, 2 * i, 2 * j);\n    swap(coords, 2 * i + 1, 2 * j + 1);\n}\n\n/**\n * @param {InstanceType<TypedArrayConstructor>} arr\n * @param {number} i\n * @param {number} j\n */\nfunction swap(arr, i, j) {\n    const tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\n/**\n * @param {number} ax\n * @param {number} ay\n * @param {number} bx\n * @param {number} by\n */\nfunction sqDist(ax, ay, bx, by) {\n    const dx = ax - bx;\n    const dy = ay - by;\n    return dx * dx + dy * dy;\n}\n","\nimport KDBush from 'kdbush';\n\nconst defaultOptions = {\n    minZoom: 0,   // min zoom to generate clusters on\n    maxZoom: 16,  // max zoom level to cluster the points on\n    minPoints: 2, // minimum points to form a cluster\n    radius: 40,   // cluster radius in pixels\n    extent: 512,  // tile extent (radius is calculated relative to it)\n    nodeSize: 64, // size of the KD-tree leaf node, affects performance\n    log: false,   // whether to log timing info\n\n    // whether to generate numeric ids for input features (in vector tiles)\n    generateId: false,\n\n    // a reduce function for calculating custom cluster properties\n    reduce: null, // (accumulated, props) => { accumulated.sum += props.sum; }\n\n    // properties to use for individual points when running the reducer\n    map: props => props // props => ({sum: props.my_value})\n};\n\nconst fround = Math.fround || (tmp => ((x) => { tmp[0] = +x; return tmp[0]; }))(new Float32Array(1));\n\nconst OFFSET_ZOOM = 2;\nconst OFFSET_ID = 3;\nconst OFFSET_PARENT = 4;\nconst OFFSET_NUM = 5;\nconst OFFSET_PROP = 6;\n\nexport default class Supercluster {\n    constructor(options) {\n        this.options = Object.assign(Object.create(defaultOptions), options);\n        this.trees = new Array(this.options.maxZoom + 1);\n        this.stride = this.options.reduce ? 7 : 6;\n        this.clusterProps = [];\n    }\n\n    load(points) {\n        const {log, minZoom, maxZoom} = this.options;\n\n        if (log) console.time('total time');\n\n        const timerId = `prepare ${  points.length  } points`;\n        if (log) console.time(timerId);\n\n        this.points = points;\n\n        // generate a cluster object for each point and index input points into a KD-tree\n        const data = [];\n\n        for (let i = 0; i < points.length; i++) {\n            const p = points[i];\n            if (!p.geometry) continue;\n\n            const [lng, lat] = p.geometry.coordinates;\n            const x = fround(lngX(lng));\n            const y = fround(latY(lat));\n            // store internal point/cluster data in flat numeric arrays for performance\n            data.push(\n                x, y, // projected point coordinates\n                Infinity, // the last zoom the point was processed at\n                i, // index of the source feature in the original input array\n                -1, // parent cluster id\n                1 // number of points in a cluster\n            );\n            if (this.options.reduce) data.push(0); // noop\n        }\n        let tree = this.trees[maxZoom + 1] = this._createTree(data);\n\n        if (log) console.timeEnd(timerId);\n\n        // cluster points on max zoom, then cluster the results on previous zoom, etc.;\n        // results in a cluster hierarchy across zoom levels\n        for (let z = maxZoom; z >= minZoom; z--) {\n            const now = +Date.now();\n\n            // create a new set of clusters for the zoom and index them with a KD-tree\n            tree = this.trees[z] = this._createTree(this._cluster(tree, z));\n\n            if (log) console.log('z%d: %d clusters in %dms', z, tree.numItems, +Date.now() - now);\n        }\n\n        if (log) console.timeEnd('total time');\n\n        return this;\n    }\n\n    getClusters(bbox, zoom) {\n        let minLng = ((bbox[0] + 180) % 360 + 360) % 360 - 180;\n        const minLat = Math.max(-90, Math.min(90, bbox[1]));\n        let maxLng = bbox[2] === 180 ? 180 : ((bbox[2] + 180) % 360 + 360) % 360 - 180;\n        const maxLat = Math.max(-90, Math.min(90, bbox[3]));\n\n        if (bbox[2] - bbox[0] >= 360) {\n            minLng = -180;\n            maxLng = 180;\n        } else if (minLng > maxLng) {\n            const easternHem = this.getClusters([minLng, minLat, 180, maxLat], zoom);\n            const westernHem = this.getClusters([-180, minLat, maxLng, maxLat], zoom);\n            return easternHem.concat(westernHem);\n        }\n\n        const tree = this.trees[this._limitZoom(zoom)];\n        const ids = tree.range(lngX(minLng), latY(maxLat), lngX(maxLng), latY(minLat));\n        const data = tree.data;\n        const clusters = [];\n        for (const id of ids) {\n            const k = this.stride * id;\n            clusters.push(data[k + OFFSET_NUM] > 1 ? getClusterJSON(data, k, this.clusterProps) : this.points[data[k + OFFSET_ID]]);\n        }\n        return clusters;\n    }\n\n    getChildren(clusterId) {\n        const originId = this._getOriginId(clusterId);\n        const originZoom = this._getOriginZoom(clusterId);\n        const errorMsg = 'No cluster with the specified id.';\n\n        const tree = this.trees[originZoom];\n        if (!tree) throw new Error(errorMsg);\n\n        const data = tree.data;\n        if (originId * this.stride >= data.length) throw new Error(errorMsg);\n\n        const r = this.options.radius / (this.options.extent * Math.pow(2, originZoom - 1));\n        const x = data[originId * this.stride];\n        const y = data[originId * this.stride + 1];\n        const ids = tree.within(x, y, r);\n        const children = [];\n        for (const id of ids) {\n            const k = id * this.stride;\n            if (data[k + OFFSET_PARENT] === clusterId) {\n                children.push(data[k + OFFSET_NUM] > 1 ? getClusterJSON(data, k, this.clusterProps) : this.points[data[k + OFFSET_ID]]);\n            }\n        }\n\n        if (children.length === 0) throw new Error(errorMsg);\n\n        return children;\n    }\n\n    getLeaves(clusterId, limit, offset) {\n        limit = limit || 10;\n        offset = offset || 0;\n\n        const leaves = [];\n        this._appendLeaves(leaves, clusterId, limit, offset, 0);\n\n        return leaves;\n    }\n\n    getTile(z, x, y) {\n        const tree = this.trees[this._limitZoom(z)];\n        const z2 = Math.pow(2, z);\n        const {extent, radius} = this.options;\n        const p = radius / extent;\n        const top = (y - p) / z2;\n        const bottom = (y + 1 + p) / z2;\n\n        const tile = {\n            features: []\n        };\n\n        this._addTileFeatures(\n            tree.range((x - p) / z2, top, (x + 1 + p) / z2, bottom),\n            tree.data, x, y, z2, tile);\n\n        if (x === 0) {\n            this._addTileFeatures(\n                tree.range(1 - p / z2, top, 1, bottom),\n                tree.data, z2, y, z2, tile);\n        }\n        if (x === z2 - 1) {\n            this._addTileFeatures(\n                tree.range(0, top, p / z2, bottom),\n                tree.data, -1, y, z2, tile);\n        }\n\n        return tile.features.length ? tile : null;\n    }\n\n    getClusterExpansionZoom(clusterId) {\n        let expansionZoom = this._getOriginZoom(clusterId) - 1;\n        while (expansionZoom <= this.options.maxZoom) {\n            const children = this.getChildren(clusterId);\n            expansionZoom++;\n            if (children.length !== 1) break;\n            clusterId = children[0].properties.cluster_id;\n        }\n        return expansionZoom;\n    }\n\n    _appendLeaves(result, clusterId, limit, offset, skipped) {\n        const children = this.getChildren(clusterId);\n\n        for (const child of children) {\n            const props = child.properties;\n\n            if (props && props.cluster) {\n                if (skipped + props.point_count <= offset) {\n                    // skip the whole cluster\n                    skipped += props.point_count;\n                } else {\n                    // enter the cluster\n                    skipped = this._appendLeaves(result, props.cluster_id, limit, offset, skipped);\n                    // exit the cluster\n                }\n            } else if (skipped < offset) {\n                // skip a single point\n                skipped++;\n            } else {\n                // add a single point\n                result.push(child);\n            }\n            if (result.length === limit) break;\n        }\n\n        return skipped;\n    }\n\n    _createTree(data) {\n        const tree = new KDBush(data.length / this.stride | 0, this.options.nodeSize, Float32Array);\n        for (let i = 0; i < data.length; i += this.stride) tree.add(data[i], data[i + 1]);\n        tree.finish();\n        tree.data = data;\n        return tree;\n    }\n\n    _addTileFeatures(ids, data, x, y, z2, tile) {\n        for (const i of ids) {\n            const k = i * this.stride;\n            const isCluster = data[k + OFFSET_NUM] > 1;\n\n            let tags, px, py;\n            if (isCluster) {\n                tags = getClusterProperties(data, k, this.clusterProps);\n                px = data[k];\n                py = data[k + 1];\n            } else {\n                const p = this.points[data[k + OFFSET_ID]];\n                tags = p.properties;\n                const [lng, lat] = p.geometry.coordinates;\n                px = lngX(lng);\n                py = latY(lat);\n            }\n\n            const f = {\n                type: 1,\n                geometry: [[\n                    Math.round(this.options.extent * (px * z2 - x)),\n                    Math.round(this.options.extent * (py * z2 - y))\n                ]],\n                tags\n            };\n\n            // assign id\n            let id;\n            if (isCluster || this.options.generateId) {\n                // optionally generate id for points\n                id = data[k + OFFSET_ID];\n            } else {\n                // keep id if already assigned\n                id = this.points[data[k + OFFSET_ID]].id;\n            }\n\n            if (id !== undefined) f.id = id;\n\n            tile.features.push(f);\n        }\n    }\n\n    _limitZoom(z) {\n        return Math.max(this.options.minZoom, Math.min(Math.floor(+z), this.options.maxZoom + 1));\n    }\n\n    _cluster(tree, zoom) {\n        const {radius, extent, reduce, minPoints} = this.options;\n        const r = radius / (extent * Math.pow(2, zoom));\n        const data = tree.data;\n        const nextData = [];\n        const stride = this.stride;\n\n        // loop through each point\n        for (let i = 0; i < data.length; i += stride) {\n            // if we've already visited the point at this zoom level, skip it\n            if (data[i + OFFSET_ZOOM] <= zoom) continue;\n            data[i + OFFSET_ZOOM] = zoom;\n\n            // find all nearby points\n            const x = data[i];\n            const y = data[i + 1];\n            const neighborIds = tree.within(data[i], data[i + 1], r);\n\n            const numPointsOrigin = data[i + OFFSET_NUM];\n            let numPoints = numPointsOrigin;\n\n            // count the number of points in a potential cluster\n            for (const neighborId of neighborIds) {\n                const k = neighborId * stride;\n                // filter out neighbors that are already processed\n                if (data[k + OFFSET_ZOOM] > zoom) numPoints += data[k + OFFSET_NUM];\n            }\n\n            // if there were neighbors to merge, and there are enough points to form a cluster\n            if (numPoints > numPointsOrigin && numPoints >= minPoints) {\n                let wx = x * numPointsOrigin;\n                let wy = y * numPointsOrigin;\n\n                let clusterProperties;\n                let clusterPropIndex = -1;\n\n                // encode both zoom and point index on which the cluster originated -- offset by total length of features\n                const id = ((i / stride | 0) << 5) + (zoom + 1) + this.points.length;\n\n                for (const neighborId of neighborIds) {\n                    const k = neighborId * stride;\n\n                    if (data[k + OFFSET_ZOOM] <= zoom) continue;\n                    data[k + OFFSET_ZOOM] = zoom; // save the zoom (so it doesn't get processed twice)\n\n                    const numPoints2 = data[k + OFFSET_NUM];\n                    wx += data[k] * numPoints2; // accumulate coordinates for calculating weighted center\n                    wy += data[k + 1] * numPoints2;\n\n                    data[k + OFFSET_PARENT] = id;\n\n                    if (reduce) {\n                        if (!clusterProperties) {\n                            clusterProperties = this._map(data, i, true);\n                            clusterPropIndex = this.clusterProps.length;\n                            this.clusterProps.push(clusterProperties);\n                        }\n                        reduce(clusterProperties, this._map(data, k));\n                    }\n                }\n\n                data[i + OFFSET_PARENT] = id;\n                nextData.push(wx / numPoints, wy / numPoints, Infinity, id, -1, numPoints);\n                if (reduce) nextData.push(clusterPropIndex);\n\n            } else { // left points as unclustered\n                for (let j = 0; j < stride; j++) nextData.push(data[i + j]);\n\n                if (numPoints > 1) {\n                    for (const neighborId of neighborIds) {\n                        const k = neighborId * stride;\n                        if (data[k + OFFSET_ZOOM] <= zoom) continue;\n                        data[k + OFFSET_ZOOM] = zoom;\n                        for (let j = 0; j < stride; j++) nextData.push(data[k + j]);\n                    }\n                }\n            }\n        }\n\n        return nextData;\n    }\n\n    // get index of the point from which the cluster originated\n    _getOriginId(clusterId) {\n        return (clusterId - this.points.length) >> 5;\n    }\n\n    // get zoom of the point from which the cluster originated\n    _getOriginZoom(clusterId) {\n        return (clusterId - this.points.length) % 32;\n    }\n\n    _map(data, i, clone) {\n        if (data[i + OFFSET_NUM] > 1) {\n            const props = this.clusterProps[data[i + OFFSET_PROP]];\n            return clone ? Object.assign({}, props) : props;\n        }\n        const original = this.points[data[i + OFFSET_ID]].properties;\n        const result = this.options.map(original);\n        return clone && result === original ? Object.assign({}, result) : result;\n    }\n}\n\nfunction getClusterJSON(data, i, clusterProps) {\n    return {\n        type: 'Feature',\n        id: data[i + OFFSET_ID],\n        properties: getClusterProperties(data, i, clusterProps),\n        geometry: {\n            type: 'Point',\n            coordinates: [xLng(data[i]), yLat(data[i + 1])]\n        }\n    };\n}\n\nfunction getClusterProperties(data, i, clusterProps) {\n    const count = data[i + OFFSET_NUM];\n    const abbrev =\n        count >= 10000 ? `${Math.round(count / 1000)  }k` :\n        count >= 1000 ? `${Math.round(count / 100) / 10  }k` : count;\n    const propIndex = data[i + OFFSET_PROP];\n    const properties = propIndex === -1 ? {} : Object.assign({}, clusterProps[propIndex]);\n    return Object.assign(properties, {\n        cluster: true,\n        cluster_id: data[i + OFFSET_ID],\n        point_count: count,\n        point_count_abbreviated: abbrev\n    });\n}\n\n// longitude/latitude to spherical mercator in [0..1] range\nfunction lngX(lng) {\n    return lng / 360 + 0.5;\n}\nfunction latY(lat) {\n    const sin = Math.sin(lat * Math.PI / 180);\n    const y = (0.5 - 0.25 * Math.log((1 + sin) / (1 - sin)) / Math.PI);\n    return y < 0 ? 0 : y > 1 ? 1 : y;\n}\n\n// spherical mercator to longitude/latitude\nfunction xLng(x) {\n    return (x - 0.5) * 360;\n}\nfunction yLat(y) {\n    const y2 = (180 - y * 360) * Math.PI / 180;\n    return 360 * Math.atan(Math.exp(y2)) / Math.PI - 90;\n}\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Check if module exists (development only)\n\tif (__webpack_modules__[moduleId] === undefined) {\n\t\tvar e = new Error(\"Cannot find module '\" + moduleId + \"'\");\n\t\te.code = 'MODULE_NOT_FOUND';\n\t\tthrow e;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// define getter functions for harmony exports\n__webpack_require__.d = function(exports, definition) {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = function(obj, prop) { return Object.prototype.hasOwnProperty.call(obj, prop); }","// define __esModule on exports\n__webpack_require__.r = function(exports) {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","// // extract only necessary parts of lodash for gmaps_gogole\n// import { isFunction, map, extend, each, isObject, clone, defaults, isString, isArray, isNumber } from 'lodash';\n// window._ = { isFunction, map, extend, each, isObject, clone, defaults, isString, isArray, isNumber }\n\n// import './public/gmaps_google';\n\n// if (typeof window.gmapsOnLoad === 'function') {\n//   window.gmapsOnLoad();\n// }\n\nimport { MarkerClusterer } from \"@googlemaps/markerclusterer\";\n\nwindow.MarkerClusterer = MarkerClusterer;"],"names":["__rest","s","e","t","p","Object","prototype","hasOwnProperty","call","indexOf","getOwnPropertySymbols","i","length","propertyIsEnumerable","SuppressedError","MarkerUtils","isAdvancedMarkerAvailable","map","google","maps","marker","getMapCapabilities","isAdvancedMarkersAvailable","isAdvancedMarker","AdvancedMarkerElement","setMap","this","getPosition","position","LatLng","Number","isFinite","lat","lng","getVisible","Cluster","constructor","markers","_position","bounds","LatLngBounds","extend","getCenter","count","filter","m","push","undefined","assertNotNull","value","message","Error","filterMarkersToPaddedViewport","mapCanvasProjection","viewportPaddingPixels","getBounds","extendedMapBounds","extendBoundsToPaddedViewport","contains","projection","numPixels","northEast","southWest","latLngBoundsToPixelBounds","extendedPixelBounds","extendPixelBounds","pixelBoundsToLatLngBounds","getPaddedViewport","pixels","extended","ne","getNorthEast","sw","getSouthWest","distanceBetweenPoints","p1","p2","dLat","Math","PI","dLon","sinDLat","sin","sinDLon","a","cos","atan2","sqrt","fromLatLngToDivPixel","x","y","fromDivPixelToLatLng","AbstractAlgorithm","maxZoom","noop","AbstractViewportAlgorithm","_a","viewportPadding","super","calculate","zoom","getZoom","clusters","changed","cluster","GridAlgorithm","maxDistance","gridSize","state","newState","deepEqual","forEach","addToClosestCluster","candidate","distance","toJSON","NoopAlgorithm","input","SuperClusterAlgorithm","radius","options","superCluster","assign","round","points","type","geometry","coordinates","properties","load","getClusters","feature","transformCluster","getLeaves","cluster_id","Infinity","leaf","SuperClusterViewportAlgorithm","view","getViewportState","mapZoom","mapBounds","ClusterStats","sum","clusterMarkerCounts","clusterMarkerSum","reduce","b","mean","min","max","DefaultRenderer","render","stats","svg","title","zIndex","Marker","MAX_ZINDEX","svgEl","DOMParser","parseFromString","documentElement","setAttribute","clusterOptions","content","icon","url","btoa","anchor","Point","OverlayViewSafe","type1","type2","property","OverlayView","MarkerClustererEvents","defaultOnClusterClickHandler","_","fitBounds","MarkerClusterer","algorithmOptions","algorithm","renderer","onClusterClick","idleListener","addMarker","noDraw","includes","addMarkers","removeMarker","index","splice","removeMarkers","removed","clearMarkers","getMap","Map","getProjection","event","trigger","CLUSTERING_BEGIN","singleMarker","Set","add","groupMarkers","has","renderClusters","requestAnimationFrame","CLUSTERING_END","onAdd","addListener","bind","onRemove","removeListener","reset","delete","markerClickEventName","GMP_CLICK","CLUSTER_CLICK","getOwnPropertyNames","combineComparators","comparatorA","comparatorB","createIsCircular","areItemsEqual","cache","cachedA","get","cachedB","set","result","getStrictProperties","object","concat","hasOwn","sameValueZeroEqual","PREACT_VNODE","PREACT_OWNER","REACT_OWNER","getOwnPropertyDescriptor","keys","areArraysEqual","equals","areDatesEqual","getTime","areErrorsEqual","name","cause","stack","areFunctionsEqual","areMapsEqual","size","aResult","bResult","matchedIndices","Array","aIterable","entries","next","done","bIterable","hasMatch","matchIndex","aEntry","bEntry","areNumbersEqual","areObjectsEqual","isPropertyEqual","areObjectsEqualStrict","descriptorA","descriptorB","configurable","enumerable","writable","arePrimitiveWrappersEqual","valueOf","areRegExpsEqual","source","flags","areSetsEqual","values","areTypedArraysEqual","areUrlsEqual","hostname","pathname","protocol","port","hash","username","password","$$typeof","ARGUMENTS_TAG","BOOLEAN_TAG","DATE_TAG","ERROR_TAG","MAP_TAG","NUMBER_TAG","OBJECT_TAG","REG_EXP_TAG","SET_TAG","STRING_TAG","URL_TAG","isArray","isTypedArray","ArrayBuffer","isView","getTag","toString","createEqualityComparator","unknownTagComparators","Date","RegExp","tag","then","unknownTagComparator","shortTag","Symbol","toStringTag","createCustomEqual","strictDeepEqual","strict","circularDeepEqual","circular","strictCircularDeepEqual","shallowEqual","createInternalComparator","strictShallowEqual","circularShallowEqual","strictCircularShallowEqual","compare","createCustomInternalComparator","createState","_b","config","createCustomConfig","areArraysEqual$1","areMapsEqual$1","areObjectsEqual$1","areSetsEqual$1","createEqualityComparatorConfig","comparator","WeakMap","meta","createIsEqual","_indexOrKeyA","_indexOrKeyB","_parentA","_parentB","ARRAY_TYPES","Int8Array","Uint8Array","Uint8ClampedArray","Int16Array","Uint16Array","Int32Array","Uint32Array","Float32Array","Float64Array","KDBush","from","data","magic","versionAndType","version","ArrayType","nodeSize","numItems","isNaN","IndexArrayType","arrayTypeIndex","coordsByteSize","BYTES_PER_ELEMENT","idsByteSize","padCoords","ids","coords","_pos","_finished","finish","numAdded","sort","range","minX","minY","maxX","maxY","axis","pop","right","left","within","qx","qy","r","r2","sqDist","select","k","n","z","log","exp","sd","floor","j","swapItem","swap","arr","tmp","ax","ay","bx","by","dx","dy","defaultOptions","minZoom","minPoints","extent","generateId","props","fround","Supercluster","create","trees","stride","clusterProps","console","time","timerId","lngX","latY","tree","_createTree","timeEnd","now","_cluster","bbox","minLng","minLat","maxLng","maxLat","easternHem","westernHem","_limitZoom","id","getClusterJSON","getChildren","clusterId","originId","_getOriginId","originZoom","_getOriginZoom","errorMsg","pow","children","limit","offset","leaves","_appendLeaves","getTile","z2","top","bottom","tile","features","_addTileFeatures","getClusterExpansionZoom","expansionZoom","skipped","child","point_count","isCluster","tags","px","py","getClusterProperties","f","nextData","neighborIds","numPointsOrigin","numPoints","neighborId","clusterProperties","wx","wy","clusterPropIndex","numPoints2","_map","clone","original","yLat","abbrev","propIndex","point_count_abbreviated","y2","atan","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","exports","__webpack_modules__","code","module","d","definition","key","o","defineProperty","obj","prop","window"],"sourceRoot":""}