{"version":3,"file":"js/627-21f1c1b34080765ba35e.js","mappings":"4FAKA,SAASA,EAAOC,EAAMC,EAAaC,GAE/BA,EAAMA,GAAO,EAEb,IAOIC,EAAMC,EAAMC,EAAMC,EAAMC,EAAGC,EAAGC,EAP9BC,EAAWT,GAAeA,EAAYU,OACtCC,EAAWF,EAAWT,EAAY,GAAKC,EAAMF,EAAKW,OAClDE,EAAYC,EAAWd,EAAM,EAAGY,EAAUV,GAAK,GAC/Ca,EAAY,GAEhB,IAAKF,GAAaA,EAAUG,OAASH,EAAUI,KAAM,OAAOF,EAO5D,GAHIL,IAAUG,EA2PlB,SAAwBb,EAAMC,EAAaY,EAAWX,GAClD,IACIgB,EAAGC,EAAiBC,EADpBC,EAAQ,GAGZ,IAAKH,EAAI,EAAGC,EAAMlB,EAAYU,OAAQO,EAAIC,EAAKD,KAG3CE,EAAON,EAAWd,EAFVC,EAAYiB,GAAKhB,EACnBgB,EAAIC,EAAM,EAAIlB,EAAYiB,EAAI,GAAKhB,EAAMF,EAAKW,OAChBT,GAAK,MAC5BkB,EAAKJ,OAAMI,EAAKE,SAAU,GACvCD,EAAME,KAAKC,EAAYJ,IAM3B,IAHAC,EAAMI,KAAKC,GAGNR,EAAI,EAAGA,EAAIG,EAAMV,OAAQO,IAC1BL,EAAYc,EAAcN,EAAMH,GAAIL,GAGxC,OAAOA,CACX,CA/Q8Be,CAAe5B,EAAMC,EAAaY,EAAWX,IAGnEF,EAAKW,OAAS,GAAKT,EAAK,CACxBC,EAAOE,EAAOL,EAAK,GACnBI,EAAOE,EAAON,EAAK,GAEnB,IAAK,IAAIkB,EAAIhB,EAAKgB,EAAIN,EAAUM,GAAKhB,GACjCK,EAAIP,EAAKkB,IAEDf,IAAMA,EAAOI,IADrBC,EAAIR,EAAKkB,EAAI,IAELd,IAAMA,EAAOI,GACjBD,EAAIF,IAAMA,EAAOE,GACjBC,EAAIF,IAAMA,EAAOE,GAKzBC,EAAsB,KADtBA,EAAUoB,KAAKC,IAAIzB,EAAOF,EAAMG,EAAOF,IACb,MAAQK,EAAU,CAChD,CAIA,OAFAsB,EAAalB,EAAWE,EAAWb,EAAKC,EAAMC,EAAMK,EAAS,GAEtDM,CACX,CAGA,SAASD,EAAWd,EAAMgC,EAAOC,EAAK/B,EAAKgC,GACvC,IAAIhB,EAAGiB,EAEP,GAAID,IAAeE,EAAWpC,EAAMgC,EAAOC,EAAK/B,GAAO,EACnD,IAAKgB,EAAIc,EAAOd,EAAIe,EAAKf,GAAKhB,EAAKiC,EAAOE,EAAWnB,EAAGlB,EAAKkB,GAAIlB,EAAKkB,EAAI,GAAIiB,QAE9E,IAAKjB,EAAIe,EAAM/B,EAAKgB,GAAKc,EAAOd,GAAKhB,EAAKiC,EAAOE,EAAWnB,EAAGlB,EAAKkB,GAAIlB,EAAKkB,EAAI,GAAIiB,GAQzF,OALIA,GAAQG,EAAOH,EAAMA,EAAKnB,QAC1BuB,EAAWJ,GACXA,EAAOA,EAAKnB,MAGTmB,CACX,CAGA,SAASK,EAAaR,EAAOC,GACzB,IAAKD,EAAO,OAAOA,EACdC,IAAKA,EAAMD,GAEhB,IACIS,EADAC,EAAIV,EAER,GAGI,GAFAS,GAAQ,EAEHC,EAAEpB,UAAYgB,EAAOI,EAAGA,EAAE1B,OAAqC,IAA5B2B,EAAKD,EAAEzB,KAAMyB,EAAGA,EAAE1B,MAOtD0B,EAAIA,EAAE1B,SAP8D,CAGpE,GAFAuB,EAAWG,IACXA,EAAIT,EAAMS,EAAEzB,QACFyB,EAAE1B,KAAM,MAClByB,GAAQ,CAEZ,QAGKA,GAASC,IAAMT,GAExB,OAAOA,CACX,CAGA,SAASF,EAAaa,EAAK7B,EAAWb,EAAKC,EAAMC,EAAMK,EAASoC,GAC5D,GAAKD,EAAL,EAGKC,GAAQpC,GAuRjB,SAAoBuB,EAAO7B,EAAMC,EAAMK,GACnC,IAAIiC,EAAIV,EACR,GACgB,IAARU,EAAEI,IAASJ,EAAEI,EAAIC,EAAOL,EAAEnC,EAAGmC,EAAElC,EAAGL,EAAMC,EAAMK,IAClDiC,EAAEM,MAAQN,EAAEzB,KACZyB,EAAEO,MAAQP,EAAE1B,KACZ0B,EAAIA,EAAE1B,WACD0B,IAAMV,GAEfU,EAAEM,MAAMC,MAAQ,KAChBP,EAAEM,MAAQ,KAOd,SAAoB5B,GAChB,IAAIF,EAAGwB,EAAGQ,EAAGC,EAAGC,EAAMC,EAAWC,EAAOC,EACpCC,EAAS,EAEb,EAAG,CAMC,IALAd,EAAItB,EACJA,EAAO,KACPgC,EAAO,KACPC,EAAY,EAELX,GAAG,CAIN,IAHAW,IACAH,EAAIR,EACJY,EAAQ,EACHpC,EAAI,EAAGA,EAAIsC,IACZF,IACAJ,EAAIA,EAAED,OAFc/B,KAOxB,IAFAqC,EAAQC,EAEDF,EAAQ,GAAMC,EAAQ,GAAKL,GAEhB,IAAVI,IAA0B,IAAVC,IAAgBL,GAAKR,EAAEI,GAAKI,EAAEJ,IAC9CK,EAAIT,EACJA,EAAIA,EAAEO,MACNK,MAEAH,EAAID,EACJA,EAAIA,EAAED,MACNM,KAGAH,EAAMA,EAAKH,MAAQE,EAClB/B,EAAO+B,EAEZA,EAAEH,MAAQI,EACVA,EAAOD,EAGXT,EAAIQ,CACR,CAEAE,EAAKH,MAAQ,KACbO,GAAU,CAEd,OAASH,EAAY,EAGzB,CAtDII,CAAWf,EACf,CApS0BgB,CAAWd,EAAKzC,EAAMC,EAAMK,GAMlD,IAJA,IACIQ,EAAMD,EADN2C,EAAOf,EAIJA,EAAI3B,OAAS2B,EAAI5B,MAIpB,GAHAC,EAAO2B,EAAI3B,KACXD,EAAO4B,EAAI5B,KAEPP,EAAUmD,EAAYhB,EAAKzC,EAAMC,EAAMK,GAAWoD,EAAMjB,GAExD7B,EAAUQ,KAAKN,EAAKC,EAAIhB,EAAM,GAC9Ba,EAAUQ,KAAKqB,EAAI1B,EAAIhB,EAAM,GAC7Ba,EAAUQ,KAAKP,EAAKE,EAAIhB,EAAM,GAE9BqC,EAAWK,GAGXA,EAAM5B,EAAKA,KACX2C,EAAO3C,EAAKA,UAQhB,IAHA4B,EAAM5B,KAGM2C,EAAM,CAETd,EAIe,IAATA,EAEPd,EADAa,EAAMkB,EAAuBtB,EAAaI,GAAM7B,EAAWb,GACzCa,EAAWb,EAAKC,EAAMC,EAAMK,EAAS,GAGvC,IAAToC,GACPkB,EAAYnB,EAAK7B,EAAWb,EAAKC,EAAMC,EAAMK,GAT7CsB,EAAaS,EAAaI,GAAM7B,EAAWb,EAAKC,EAAMC,EAAMK,EAAS,GAYzE,KACJ,CA/CY,CAiDpB,CAGA,SAASoD,EAAMjB,GACX,IAAIoB,EAAIpB,EAAI3B,KACRgD,EAAIrB,EACJsB,EAAItB,EAAI5B,KAEZ,GAAI2B,EAAKqB,EAAGC,EAAGC,IAAM,EAAG,OAAO,EAY/B,IATA,IAAIC,EAAKH,EAAEzD,EAAG6D,EAAKH,EAAE1D,EAAG8D,EAAKH,EAAE3D,EAAG+D,EAAKN,EAAExD,EAAG+D,EAAKN,EAAEzD,EAAGgE,EAAKN,EAAE1D,EAGzDiE,EAAKN,EAAKC,EAAMD,EAAKE,EAAKF,EAAKE,EAAOD,EAAKC,EAAKD,EAAKC,EACrDK,EAAKJ,EAAKC,EAAMD,EAAKE,EAAKF,EAAKE,EAAOD,EAAKC,EAAKD,EAAKC,EACrDG,EAAKR,EAAKC,EAAMD,EAAKE,EAAKF,EAAKE,EAAOD,EAAKC,EAAKD,EAAKC,EACrDO,EAAKN,EAAKC,EAAMD,EAAKE,EAAKF,EAAKE,EAAOD,EAAKC,EAAKD,EAAKC,EAErD9B,EAAIwB,EAAElD,KACH0B,IAAMsB,GAAG,CACZ,GAAItB,EAAEnC,GAAKkE,GAAM/B,EAAEnC,GAAKoE,GAAMjC,EAAElC,GAAKkE,GAAMhC,EAAElC,GAAKoE,GAC9CC,EAAgBV,EAAIG,EAAIF,EAAIG,EAAIF,EAAIG,EAAI9B,EAAEnC,EAAGmC,EAAElC,IAC/CmC,EAAKD,EAAEzB,KAAMyB,EAAGA,EAAE1B,OAAS,EAAG,OAAO,EACzC0B,EAAIA,EAAE1B,IACV,CAEA,OAAO,CACX,CAEA,SAAS4C,EAAYhB,EAAKzC,EAAMC,EAAMK,GAClC,IAAIuD,EAAIpB,EAAI3B,KACRgD,EAAIrB,EACJsB,EAAItB,EAAI5B,KAEZ,GAAI2B,EAAKqB,EAAGC,EAAGC,IAAM,EAAG,OAAO,EAkB/B,IAhBA,IAAIC,EAAKH,EAAEzD,EAAG6D,EAAKH,EAAE1D,EAAG8D,EAAKH,EAAE3D,EAAG+D,EAAKN,EAAExD,EAAG+D,EAAKN,EAAEzD,EAAGgE,EAAKN,EAAE1D,EAGzDiE,EAAKN,EAAKC,EAAMD,EAAKE,EAAKF,EAAKE,EAAOD,EAAKC,EAAKD,EAAKC,EACrDK,EAAKJ,EAAKC,EAAMD,EAAKE,EAAKF,EAAKE,EAAOD,EAAKC,EAAKD,EAAKC,EACrDG,EAAKR,EAAKC,EAAMD,EAAKE,EAAKF,EAAKE,EAAOD,EAAKC,EAAKD,EAAKC,EACrDO,EAAKN,EAAKC,EAAMD,EAAKE,EAAKF,EAAKE,EAAOD,EAAKC,EAAKD,EAAKC,EAGrDM,EAAO/B,EAAO0B,EAAIC,EAAIvE,EAAMC,EAAMK,GAClCsE,EAAOhC,EAAO4B,EAAIC,EAAIzE,EAAMC,EAAMK,GAElCiC,EAAIE,EAAII,MACRgC,EAAIpC,EAAIK,MAGLP,GAAKA,EAAEI,GAAKgC,GAAQE,GAAKA,EAAElC,GAAKiC,GAAM,CACzC,GAAIrC,EAAEnC,GAAKkE,GAAM/B,EAAEnC,GAAKoE,GAAMjC,EAAElC,GAAKkE,GAAMhC,EAAElC,GAAKoE,GAAMlC,IAAMsB,GAAKtB,IAAMwB,GACrEW,EAAgBV,EAAIG,EAAIF,EAAIG,EAAIF,EAAIG,EAAI9B,EAAEnC,EAAGmC,EAAElC,IAAMmC,EAAKD,EAAEzB,KAAMyB,EAAGA,EAAE1B,OAAS,EAAG,OAAO,EAG9F,GAFA0B,EAAIA,EAAEM,MAEFgC,EAAEzE,GAAKkE,GAAMO,EAAEzE,GAAKoE,GAAMK,EAAExE,GAAKkE,GAAMM,EAAExE,GAAKoE,GAAMI,IAAMhB,GAAKgB,IAAMd,GACrEW,EAAgBV,EAAIG,EAAIF,EAAIG,EAAIF,EAAIG,EAAIQ,EAAEzE,EAAGyE,EAAExE,IAAMmC,EAAKqC,EAAE/D,KAAM+D,EAAGA,EAAEhE,OAAS,EAAG,OAAO,EAC9FgE,EAAIA,EAAE/B,KACV,CAGA,KAAOP,GAAKA,EAAEI,GAAKgC,GAAM,CACrB,GAAIpC,EAAEnC,GAAKkE,GAAM/B,EAAEnC,GAAKoE,GAAMjC,EAAElC,GAAKkE,GAAMhC,EAAElC,GAAKoE,GAAMlC,IAAMsB,GAAKtB,IAAMwB,GACrEW,EAAgBV,EAAIG,EAAIF,EAAIG,EAAIF,EAAIG,EAAI9B,EAAEnC,EAAGmC,EAAElC,IAAMmC,EAAKD,EAAEzB,KAAMyB,EAAGA,EAAE1B,OAAS,EAAG,OAAO,EAC9F0B,EAAIA,EAAEM,KACV,CAGA,KAAOgC,GAAKA,EAAElC,GAAKiC,GAAM,CACrB,GAAIC,EAAEzE,GAAKkE,GAAMO,EAAEzE,GAAKoE,GAAMK,EAAExE,GAAKkE,GAAMM,EAAExE,GAAKoE,GAAMI,IAAMhB,GAAKgB,IAAMd,GACrEW,EAAgBV,EAAIG,EAAIF,EAAIG,EAAIF,EAAIG,EAAIQ,EAAEzE,EAAGyE,EAAExE,IAAMmC,EAAKqC,EAAE/D,KAAM+D,EAAGA,EAAEhE,OAAS,EAAG,OAAO,EAC9FgE,EAAIA,EAAE/B,KACV,CAEA,OAAO,CACX,CAGA,SAASa,EAAuB9B,EAAOjB,EAAWb,GAC9C,IAAIwC,EAAIV,EACR,EAAG,CACC,IAAIgC,EAAItB,EAAEzB,KACNgD,EAAIvB,EAAE1B,KAAKA,MAEVsB,EAAO0B,EAAGC,IAAMgB,EAAWjB,EAAGtB,EAAGA,EAAE1B,KAAMiD,IAAMiB,EAAclB,EAAGC,IAAMiB,EAAcjB,EAAGD,KAExFjD,EAAUQ,KAAKyC,EAAE9C,EAAIhB,EAAM,GAC3Ba,EAAUQ,KAAKmB,EAAExB,EAAIhB,EAAM,GAC3Ba,EAAUQ,KAAK0C,EAAE/C,EAAIhB,EAAM,GAG3BqC,EAAWG,GACXH,EAAWG,EAAE1B,MAEb0B,EAAIV,EAAQiC,GAEhBvB,EAAIA,EAAE1B,IACV,OAAS0B,IAAMV,GAEf,OAAOQ,EAAaE,EACxB,CAGA,SAASqB,EAAY/B,EAAOjB,EAAWb,EAAKC,EAAMC,EAAMK,GAEpD,IAAIuD,EAAIhC,EACR,EAAG,CAEC,IADA,IAAIiC,EAAID,EAAEhD,KAAKA,KACRiD,IAAMD,EAAE/C,MAAM,CACjB,GAAI+C,EAAE9C,IAAM+C,EAAE/C,GAAKiE,EAAgBnB,EAAGC,GAAI,CAEtC,IAAIC,EAAIkB,EAAapB,EAAGC,GASxB,OANAD,EAAIxB,EAAawB,EAAGA,EAAEhD,MACtBkD,EAAI1B,EAAa0B,EAAGA,EAAElD,MAGtBe,EAAaiC,EAAGjD,EAAWb,EAAKC,EAAMC,EAAMK,EAAS,QACrDsB,EAAamC,EAAGnD,EAAWb,EAAKC,EAAMC,EAAMK,EAAS,EAEzD,CACAwD,EAAIA,EAAEjD,IACV,CACAgD,EAAIA,EAAEhD,IACV,OAASgD,IAAMhC,EACnB,CAyBA,SAASN,EAASsC,EAAGC,GACjB,OAAOD,EAAEzD,EAAI0D,EAAE1D,CACnB,CAGA,SAASoB,EAAc0D,EAAMxE,GACzB,IAAIyE,EAaR,SAAwBD,EAAMxE,GAC1B,IAII0E,EAJA7C,EAAI7B,EACJ2E,EAAKH,EAAK9E,EACVkF,EAAKJ,EAAK7E,EACVkF,GAAMC,IAKV,EAAG,CACC,GAAIF,GAAM/C,EAAElC,GAAKiF,GAAM/C,EAAE1B,KAAKR,GAAKkC,EAAE1B,KAAKR,IAAMkC,EAAElC,EAAG,CACjD,IAAID,EAAImC,EAAEnC,GAAKkF,EAAK/C,EAAElC,IAAMkC,EAAE1B,KAAKT,EAAImC,EAAEnC,IAAMmC,EAAE1B,KAAKR,EAAIkC,EAAElC,GAC5D,GAAID,GAAKiF,GAAMjF,EAAImF,IACfA,EAAKnF,EACLgF,EAAI7C,EAAEnC,EAAImC,EAAE1B,KAAKT,EAAImC,EAAIA,EAAE1B,KACvBT,IAAMiF,GAAI,OAAOD,CAE7B,CACA7C,EAAIA,EAAE1B,IACV,OAAS0B,IAAM7B,GAEf,IAAK0E,EAAG,OAAO,KAMf,IAIIK,EAJAjC,EAAO4B,EACPM,EAAKN,EAAEhF,EACPuF,EAAKP,EAAE/E,EACPuF,EAASJ,IAGbjD,EAAI6C,EAEJ,GACQC,GAAM9C,EAAEnC,GAAKmC,EAAEnC,GAAKsF,GAAML,IAAO9C,EAAEnC,GAC/BsE,EAAgBY,EAAKK,EAAKN,EAAKE,EAAID,EAAII,EAAIC,EAAIL,EAAKK,EAAKJ,EAAKF,EAAIC,EAAI/C,EAAEnC,EAAGmC,EAAElC,KAEjFoF,EAAM/D,KAAKmE,IAAIP,EAAK/C,EAAElC,IAAMgF,EAAK9C,EAAEnC,GAE/B2E,EAAcxC,EAAG2C,KAChBO,EAAMG,GAAWH,IAAQG,IAAWrD,EAAEnC,EAAIgF,EAAEhF,GAAMmC,EAAEnC,IAAMgF,EAAEhF,GAAK0F,EAAqBV,EAAG7C,OAC1F6C,EAAI7C,EACJqD,EAASH,IAIjBlD,EAAIA,EAAE1B,WACD0B,IAAMiB,GAEf,OAAO4B,CACX,CAjEiBW,CAAeb,EAAMxE,GAClC,IAAKyE,EACD,OAAOzE,EAGX,IAAIsF,EAAgBf,EAAaE,EAAQD,GAIzC,OADA7C,EAAa2D,EAAeA,EAAcnF,MACnCwB,EAAa8C,EAAQA,EAAOtE,KACvC,CA0DA,SAASiF,EAAqBV,EAAG7C,GAC7B,OAAOC,EAAK4C,EAAEtE,KAAMsE,EAAG7C,EAAEzB,MAAQ,GAAK0B,EAAKD,EAAE1B,KAAMuE,EAAGA,EAAEvE,MAAQ,CACpE,CAwEA,SAAS+B,EAAOxC,EAAGC,EAAGL,EAAMC,EAAMK,GAe9B,OAPAF,EAAqB,aADrBA,EAAqB,YADrBA,EAAqB,YADrBA,EAAqB,WAHrBA,GAAKA,EAAIJ,GAAQM,EAAU,GAGjBF,GAAK,IACLA,GAAK,IACLA,GAAK,IACLA,GAAK,KAKfC,EAAqB,aADrBA,EAAqB,YADrBA,EAAqB,YADrBA,EAAqB,WAPrBA,GAAKA,EAAIJ,GAAQK,EAAU,GAOjBD,GAAK,IACLA,GAAK,IACLA,GAAK,IACLA,GAAK,KAEE,CACrB,CAGA,SAASgB,EAAYQ,GACjB,IAAIU,EAAIV,EACJoE,EAAWpE,EACf,IACQU,EAAEnC,EAAI6F,EAAS7F,GAAMmC,EAAEnC,IAAM6F,EAAS7F,GAAKmC,EAAElC,EAAI4F,EAAS5F,KAAI4F,EAAW1D,GAC7EA,EAAIA,EAAE1B,WACD0B,IAAMV,GAEf,OAAOoE,CACX,CAGA,SAASvB,EAAgBV,EAAIG,EAAIF,EAAIG,EAAIF,EAAIG,EAAI6B,EAAIC,GACjD,OAAQjC,EAAKgC,IAAO/B,EAAKgC,KAAQnC,EAAKkC,IAAO7B,EAAK8B,KAC1CnC,EAAKkC,IAAO9B,EAAK+B,KAAQlC,EAAKiC,IAAO/B,EAAKgC,KAC1ClC,EAAKiC,IAAO7B,EAAK8B,KAAQjC,EAAKgC,IAAO9B,EAAK+B,EACtD,CAGA,SAASnB,EAAgBnB,EAAGC,GACxB,OAAOD,EAAEhD,KAAKE,IAAM+C,EAAE/C,GAAK8C,EAAE/C,KAAKC,IAAM+C,EAAE/C,IA2C9C,SAA2B8C,EAAGC,GAC1B,IAAIvB,EAAIsB,EACR,EAAG,CACC,GAAItB,EAAExB,IAAM8C,EAAE9C,GAAKwB,EAAE1B,KAAKE,IAAM8C,EAAE9C,GAAKwB,EAAExB,IAAM+C,EAAE/C,GAAKwB,EAAE1B,KAAKE,IAAM+C,EAAE/C,GAC7D+D,EAAWvC,EAAGA,EAAE1B,KAAMgD,EAAGC,GAAI,OAAO,EAC5CvB,EAAIA,EAAE1B,IACV,OAAS0B,IAAMsB,GAEf,OAAO,CACX,CApDoDuC,CAAkBvC,EAAGC,KAC7DiB,EAAclB,EAAGC,IAAMiB,EAAcjB,EAAGD,IA6DpD,SAAsBA,EAAGC,GACrB,IAAIvB,EAAIsB,EACJwC,GAAS,EACTH,GAAMrC,EAAEzD,EAAI0D,EAAE1D,GAAK,EACnB+F,GAAMtC,EAAExD,EAAIyD,EAAEzD,GAAK,EACvB,GACUkC,EAAElC,EAAI8F,IAAS5D,EAAE1B,KAAKR,EAAI8F,GAAQ5D,EAAE1B,KAAKR,IAAMkC,EAAElC,GAC9C6F,GAAM3D,EAAE1B,KAAKT,EAAImC,EAAEnC,IAAM+F,EAAK5D,EAAElC,IAAMkC,EAAE1B,KAAKR,EAAIkC,EAAElC,GAAKkC,EAAEnC,IAC/DiG,GAAUA,GACd9D,EAAIA,EAAE1B,WACD0B,IAAMsB,GAEf,OAAOwC,CACX,CA1E0DC,CAAazC,EAAGC,KAC7DtB,EAAKqB,EAAE/C,KAAM+C,EAAGC,EAAEhD,OAAS0B,EAAKqB,EAAGC,EAAEhD,KAAMgD,KAC5C3B,EAAO0B,EAAGC,IAAMtB,EAAKqB,EAAE/C,KAAM+C,EAAGA,EAAEhD,MAAQ,GAAK2B,EAAKsB,EAAEhD,KAAMgD,EAAGA,EAAEjD,MAAQ,EACrF,CAGA,SAAS2B,EAAKD,EAAGQ,EAAGwD,GAChB,OAAQxD,EAAE1C,EAAIkC,EAAElC,IAAMkG,EAAEnG,EAAI2C,EAAE3C,IAAM2C,EAAE3C,EAAImC,EAAEnC,IAAMmG,EAAElG,EAAI0C,EAAE1C,EAC9D,CAGA,SAAS8B,EAAOqE,EAAIC,GAChB,OAAOD,EAAGpG,IAAMqG,EAAGrG,GAAKoG,EAAGnG,IAAMoG,EAAGpG,CACxC,CAGA,SAASyE,EAAW0B,EAAIE,EAAID,EAAIE,GAC5B,IAAIC,EAAKC,EAAKrE,EAAKgE,EAAIE,EAAID,IACvBK,EAAKD,EAAKrE,EAAKgE,EAAIE,EAAIC,IACvBI,EAAKF,EAAKrE,EAAKiE,EAAIE,EAAIH,IACvBQ,EAAKH,EAAKrE,EAAKiE,EAAIE,EAAID,IAE3B,OAAIE,IAAOE,GAAMC,IAAOC,MAEb,IAAPJ,IAAYK,EAAUT,EAAIC,EAAIC,QACvB,IAAPI,IAAYG,EAAUT,EAAIG,EAAID,QACvB,IAAPK,IAAYE,EAAUR,EAAID,EAAIG,OACvB,IAAPK,IAAYC,EAAUR,EAAIC,EAAIC,MAGtC,CAGA,SAASM,EAAU1E,EAAGQ,EAAGwD,GACrB,OAAOxD,EAAE3C,GAAKsB,KAAKC,IAAIY,EAAEnC,EAAGmG,EAAEnG,IAAM2C,EAAE3C,GAAKsB,KAAKwF,IAAI3E,EAAEnC,EAAGmG,EAAEnG,IAAM2C,EAAE1C,GAAKqB,KAAKC,IAAIY,EAAElC,EAAGkG,EAAElG,IAAM0C,EAAE1C,GAAKqB,KAAKwF,IAAI3E,EAAElC,EAAGkG,EAAElG,EACzH,CAEA,SAASwG,EAAKM,GACV,OAAOA,EAAM,EAAI,EAAIA,EAAM,GAAK,EAAI,CACxC,CAeA,SAASpC,EAAclB,EAAGC,GACtB,OAAOtB,EAAKqB,EAAE/C,KAAM+C,EAAGA,EAAEhD,MAAQ,EAC7B2B,EAAKqB,EAAGC,EAAGD,EAAEhD,OAAS,GAAK2B,EAAKqB,EAAGA,EAAE/C,KAAMgD,IAAM,EACjDtB,EAAKqB,EAAGC,EAAGD,EAAE/C,MAAQ,GAAK0B,EAAKqB,EAAGA,EAAEhD,KAAMiD,GAAK,CACvD,CAoBA,SAASmB,EAAapB,EAAGC,GACrB,IAAIsD,EAAK,IAAIC,EAAKxD,EAAE9C,EAAG8C,EAAEzD,EAAGyD,EAAExD,GAC1BiH,EAAK,IAAID,EAAKvD,EAAE/C,EAAG+C,EAAE1D,EAAG0D,EAAEzD,GAC1BkH,EAAK1D,EAAEhD,KACP2G,EAAK1D,EAAEhD,KAcX,OAZA+C,EAAEhD,KAAOiD,EACTA,EAAEhD,KAAO+C,EAETuD,EAAGvG,KAAO0G,EACVA,EAAGzG,KAAOsG,EAEVE,EAAGzG,KAAOuG,EACVA,EAAGtG,KAAOwG,EAEVE,EAAG3G,KAAOyG,EACVA,EAAGxG,KAAO0G,EAEHF,CACX,CAGA,SAASpF,EAAWnB,EAAGX,EAAGC,EAAG2B,GACzB,IAAIO,EAAI,IAAI8E,EAAKtG,EAAGX,EAAGC,GAYvB,OAVK2B,GAKDO,EAAE1B,KAAOmB,EAAKnB,KACd0B,EAAEzB,KAAOkB,EACTA,EAAKnB,KAAKC,KAAOyB,EACjBP,EAAKnB,KAAO0B,IAPZA,EAAEzB,KAAOyB,EACTA,EAAE1B,KAAO0B,GAQNA,CACX,CAEA,SAASH,EAAWG,GAChBA,EAAE1B,KAAKC,KAAOyB,EAAEzB,KAChByB,EAAEzB,KAAKD,KAAO0B,EAAE1B,KAEZ0B,EAAEM,QAAON,EAAEM,MAAMC,MAAQP,EAAEO,OAC3BP,EAAEO,QAAOP,EAAEO,MAAMD,MAAQN,EAAEM,MACnC,CAEA,SAASwE,EAAKtG,EAAGX,EAAGC,GAEhBoH,KAAK1G,EAAIA,EAGT0G,KAAKrH,EAAIA,EACTqH,KAAKpH,EAAIA,EAGToH,KAAK3G,KAAO,KACZ2G,KAAK5G,KAAO,KAGZ4G,KAAK9E,EAAI,EAGT8E,KAAK5E,MAAQ,KACb4E,KAAK3E,MAAQ,KAGb2E,KAAKtG,SAAU,CACnB,CA+BA,SAASc,EAAWpC,EAAMgC,EAAOC,EAAK/B,GAElC,IADA,IAAI2H,EAAM,EACD3G,EAAIc,EAAO8F,EAAI7F,EAAM/B,EAAKgB,EAAIe,EAAKf,GAAKhB,EAC7C2H,IAAQ7H,EAAK8H,GAAK9H,EAAKkB,KAAOlB,EAAKkB,EAAI,GAAKlB,EAAK8H,EAAI,IACrDA,EAAI5G,EAER,OAAO2G,CACX,CAppBAE,EAAOC,QAAUjI,EACjBgI,EAAOC,QAAPD,QAAyBhI,EAinBzBA,EAAOkI,UAAY,SAAUjI,EAAMC,EAAaC,EAAKa,GACjD,IAAIL,EAAWT,GAAeA,EAAYU,OACtCC,EAAWF,EAAWT,EAAY,GAAKC,EAAMF,EAAKW,OAElDuH,EAAcrG,KAAKmE,IAAI5D,EAAWpC,EAAM,EAAGY,EAAUV,IACzD,GAAIQ,EACA,IAAK,IAAIQ,EAAI,EAAGC,EAAMlB,EAAYU,OAAQO,EAAIC,EAAKD,IAAK,CACpD,IAAIc,EAAQ/B,EAAYiB,GAAKhB,EACzB+B,EAAMf,EAAIC,EAAM,EAAIlB,EAAYiB,EAAI,GAAKhB,EAAMF,EAAKW,OACxDuH,GAAerG,KAAKmE,IAAI5D,EAAWpC,EAAMgC,EAAOC,EAAK/B,GACzD,CAGJ,IAAIiI,EAAgB,EACpB,IAAKjH,EAAI,EAAGA,EAAIH,EAAUJ,OAAQO,GAAK,EAAG,CACtC,IAAI8C,EAAIjD,EAAUG,GAAKhB,EACnB+D,EAAIlD,EAAUG,EAAI,GAAKhB,EACvBgE,EAAInD,EAAUG,EAAI,GAAKhB,EAC3BiI,GAAiBtG,KAAKmE,KACjBhG,EAAKgE,GAAKhE,EAAKkE,KAAOlE,EAAKiE,EAAI,GAAKjE,EAAKgE,EAAI,KAC7ChE,EAAKgE,GAAKhE,EAAKiE,KAAOjE,EAAKkE,EAAI,GAAKlE,EAAKgE,EAAI,IACtD,CAEA,OAAuB,IAAhBkE,GAAuC,IAAlBC,EAAsB,EAC9CtG,KAAKmE,KAAKmC,EAAgBD,GAAeA,EACjD,EAYAnI,EAAOqI,QAAU,SAAUpI,GAKvB,IAJA,IAAIE,EAAMF,EAAK,GAAG,GAAGW,OACjB0H,EAAS,CAACC,SAAU,GAAIC,MAAO,GAAIC,WAAYtI,GAC/CuI,EAAY,EAEPvH,EAAI,EAAGA,EAAIlB,EAAKW,OAAQO,IAAK,CAClC,IAAK,IAAI4G,EAAI,EAAGA,EAAI9H,EAAKkB,GAAGP,OAAQmH,IAChC,IAAK,IAAIY,EAAI,EAAGA,EAAIxI,EAAKwI,IAAKL,EAAOC,SAAS/G,KAAKvB,EAAKkB,GAAG4G,GAAGY,IAE9DxH,EAAI,IACJuH,GAAazI,EAAKkB,EAAI,GAAGP,OACzB0H,EAAOE,MAAMhH,KAAKkH,GAE1B,CACA,OAAOJ,CACX,C,qCCtqBA,IAAIM,EAAeC,EAAQ,OAEvBC,EAAWD,EAAQ,OAEnBE,EAAWD,EAASF,EAAa,6BAErCZ,EAAOC,QAAU,SAA4Be,EAAMC,GAClD,IAAIC,EAAYN,EAAaI,IAAQC,GACrC,MAAyB,oBAAdC,GAA4BH,EAASC,EAAM,gBAAkB,EAChEF,EAASI,GAEVA,CACR,C,oBCdoElB,EAAOC,QAAwF,WAAW,aAAa,SAASkB,EAAEA,EAAExC,EAAEvD,EAAEa,EAAEmF,IAAI,SAASD,EAAElE,EAAE0B,EAAEvD,EAAEa,EAAEmF,GAAG,KAAKnF,EAAEb,GAAG,CAAC,GAAGa,EAAEb,EAAE,IAAI,CAAC,IAAIiG,EAAEpF,EAAEb,EAAE,EAAEkG,EAAE3C,EAAEvD,EAAE,EAAEmG,EAAEzH,KAAK0H,IAAIH,GAAGI,EAAE,GAAG3H,KAAK4H,IAAI,EAAEH,EAAE,GAAGI,EAAE,GAAG7H,KAAK8H,KAAKL,EAAEE,GAAGJ,EAAEI,GAAGJ,IAAIC,EAAED,EAAE,EAAE,GAAG,EAAE,GAA+EF,EAAElE,EAAE0B,EAA9E7E,KAAKC,IAAIqB,EAAEtB,KAAK+H,MAAMlD,EAAE2C,EAAEG,EAAEJ,EAAEM,IAAM7H,KAAKwF,IAAIrD,EAAEnC,KAAK+H,MAAMlD,GAAG0C,EAAEC,GAAGG,EAAEJ,EAAEM,IAAcP,EAAE,CAAC,IAAIzG,EAAEsC,EAAE0B,GAAGgC,EAAEvF,EAAE5C,EAAEyD,EAAE,IAAI9C,EAAE8D,EAAE7B,EAAEuD,GAAGyC,EAAEnE,EAAEhB,GAAGtB,GAAG,GAAGxB,EAAE8D,EAAE7B,EAAEa,GAAG0E,EAAEnI,GAAG,CAAC,IAAIW,EAAE8D,EAAE0D,EAAEnI,GAAGmI,IAAInI,IAAI4I,EAAEnE,EAAE0D,GAAGhG,GAAG,GAAGgG,IAAI,KAAKS,EAAEnE,EAAEzE,GAAGmC,GAAG,GAAGnC,GAAG,CAAC,IAAI4I,EAAEnE,EAAE7B,GAAGT,GAAGxB,EAAE8D,EAAE7B,EAAE5C,GAAGW,EAAE8D,IAAIzE,EAAEyD,GAAGzD,GAAGmG,IAAIvD,EAAE5C,EAAE,GAAGmG,GAAGnG,IAAIyD,EAAEzD,EAAE,EAAE,CAAC,CAA9Z,CAAga2I,EAAExC,EAAEvD,GAAG,EAAEa,GAAGkF,EAAEvI,OAAO,EAAEwI,GAAGnE,EAAE,CAAC,SAAS9D,EAAEgI,EAAEhI,EAAE8D,GAAG,IAAI0B,EAAEwC,EAAEhI,GAAGgI,EAAEhI,GAAGgI,EAAElE,GAAGkE,EAAElE,GAAG0B,CAAC,CAAC,SAAS1B,EAAEkE,EAAEhI,GAAG,OAAOgI,EAAEhI,GAAG,EAAEgI,EAAEhI,EAAE,EAAE,CAAC,CAAC,IAAIwF,EAAE,SAASwC,QAAG,IAASA,IAAIA,EAAE,GAAGtB,KAAKiC,YAAYhI,KAAKC,IAAI,EAAEoH,GAAGtB,KAAKkC,YAAYjI,KAAKC,IAAI,EAAED,KAAKkI,KAAK,GAAGnC,KAAKiC,cAAcjC,KAAKoC,OAAO,EAAE,SAAS7G,EAAE+F,EAAEhI,EAAE8D,GAAG,IAAIA,EAAE,OAAO9D,EAAE+I,QAAQf,GAAG,IAAI,IAAIxC,EAAE,EAAEA,EAAExF,EAAEP,OAAO+F,IAAI,GAAG1B,EAAEkE,EAAEhI,EAAEwF,IAAI,OAAOA,EAAE,OAAO,CAAC,CAAC,SAAS1C,EAAEkF,EAAEhI,GAAGiI,EAAED,EAAE,EAAEA,EAAEgB,SAASvJ,OAAOO,EAAEgI,EAAE,CAAC,SAASC,EAAED,EAAEhI,EAAE8D,EAAE0B,EAAEvD,GAAGA,IAAIA,EAAET,EAAE,OAAOS,EAAEhD,KAAK,IAAIgD,EAAE/C,KAAK,IAAI+C,EAAE9C,MAAK,IAAK8C,EAAE7C,MAAK,IAAK,IAAI,IAAI0D,EAAE9C,EAAE8C,EAAEgB,EAAEhB,IAAI,CAAC,IAAImF,EAAED,EAAEgB,SAASlG,GAAGoF,EAAEjG,EAAE+F,EAAEiB,KAAKzD,EAAEyC,GAAGA,EAAE,CAAC,OAAOhG,CAAC,CAAC,SAASiG,EAAEF,EAAEhI,GAAG,OAAOgI,EAAE/I,KAAK0B,KAAKwF,IAAI6B,EAAE/I,KAAKe,EAAEf,MAAM+I,EAAE9I,KAAKyB,KAAKwF,IAAI6B,EAAE9I,KAAKc,EAAEd,MAAM8I,EAAE7I,KAAKwB,KAAKC,IAAIoH,EAAE7I,KAAKa,EAAEb,MAAM6I,EAAE5I,KAAKuB,KAAKC,IAAIoH,EAAE5I,KAAKY,EAAEZ,MAAM4I,CAAC,CAAC,SAASG,EAAEH,EAAEhI,GAAG,OAAOgI,EAAE/I,KAAKe,EAAEf,IAAI,CAAC,SAASmJ,EAAEJ,EAAEhI,GAAG,OAAOgI,EAAE9I,KAAKc,EAAEd,IAAI,CAAC,SAASoJ,EAAEN,GAAG,OAAOA,EAAE7I,KAAK6I,EAAE/I,OAAO+I,EAAE5I,KAAK4I,EAAE9I,KAAK,CAAC,SAASsJ,EAAER,GAAG,OAAOA,EAAE7I,KAAK6I,EAAE/I,MAAM+I,EAAE5I,KAAK4I,EAAE9I,KAAK,CAAC,SAASmF,EAAE2D,EAAEhI,GAAG,OAAOgI,EAAE/I,MAAMe,EAAEf,MAAM+I,EAAE9I,MAAMc,EAAEd,MAAMc,EAAEb,MAAM6I,EAAE7I,MAAMa,EAAEZ,MAAM4I,EAAE5I,IAAI,CAAC,SAAS4D,EAAEgF,EAAEhI,GAAG,OAAOA,EAAEf,MAAM+I,EAAE7I,MAAMa,EAAEd,MAAM8I,EAAE5I,MAAMY,EAAEb,MAAM6I,EAAE/I,MAAMe,EAAEZ,MAAM4I,EAAE9I,IAAI,CAAC,SAASsC,EAAEwG,GAAG,MAAM,CAACgB,SAAShB,EAAEkB,OAAO,EAAED,MAAK,EAAGhK,KAAK,IAAIC,KAAK,IAAIC,MAAK,IAAKC,MAAK,IAAK,CAAC,SAASoI,EAAExH,EAAE8D,EAAE0B,EAAEvD,EAAEa,GAAG,IAAI,IAAImF,EAAE,CAACnE,EAAE0B,GAAGyC,EAAExI,QAAQ,MAAM+F,EAAEyC,EAAEkB,QAAQrF,EAAEmE,EAAEkB,QAAQlH,GAAG,CAAC,IAAIiG,EAAEpE,EAAEnD,KAAKkI,MAAMrD,EAAE1B,GAAG7B,EAAE,GAAGA,EAAE+F,EAAEhI,EAAEkI,EAAEpE,EAAE0B,EAAE1C,GAAGmF,EAAE5H,KAAKyD,EAAEoE,EAAEA,EAAE1C,EAAE,CAAC,CAAC,OAAOA,EAAE4D,UAAUC,IAAI,WAAW,OAAO3C,KAAK4C,KAAK5C,KAAK5H,KAAK,GAAG,EAAE0G,EAAE4D,UAAUG,OAAO,SAASvB,GAAG,IAAIhI,EAAE0G,KAAK5H,KAAKgF,EAAE,GAAG,IAAId,EAAEgF,EAAEhI,GAAG,OAAO8D,EAAE,IAAI,IAAI0B,EAAEkB,KAAK8C,OAAOvH,EAAE,GAAGjC,GAAG,CAAC,IAAI,IAAI8C,EAAE,EAAEA,EAAE9C,EAAEgJ,SAASvJ,OAAOqD,IAAI,CAAC,IAAImF,EAAEjI,EAAEgJ,SAASlG,GAAGoF,EAAElI,EAAEiJ,KAAKzD,EAAEyC,GAAGA,EAAEjF,EAAEgF,EAAEE,KAAKlI,EAAEiJ,KAAKnF,EAAEzD,KAAK4H,GAAG5D,EAAE2D,EAAEE,GAAGxB,KAAK4C,KAAKrB,EAAEnE,GAAG7B,EAAE5B,KAAK4H,GAAG,CAACjI,EAAEiC,EAAEkH,KAAK,CAAC,OAAOrF,CAAC,EAAE0B,EAAE4D,UAAUK,SAAS,SAASzB,GAAG,IAAIhI,EAAE0G,KAAK5H,KAAK,IAAIkE,EAAEgF,EAAEhI,GAAG,OAAM,EAAG,IAAI,IAAI8D,EAAE,GAAG9D,GAAG,CAAC,IAAI,IAAIwF,EAAE,EAAEA,EAAExF,EAAEgJ,SAASvJ,OAAO+F,IAAI,CAAC,IAAIvD,EAAEjC,EAAEgJ,SAASxD,GAAG1C,EAAE9C,EAAEiJ,KAAKvC,KAAK8C,OAAOvH,GAAGA,EAAE,GAAGe,EAAEgF,EAAElF,GAAG,CAAC,GAAG9C,EAAEiJ,MAAM5E,EAAE2D,EAAElF,GAAG,OAAM,EAAGgB,EAAEzD,KAAK4B,EAAE,CAAC,CAACjC,EAAE8D,EAAEqF,KAAK,CAAC,OAAM,CAAE,EAAE3D,EAAE4D,UAAUM,KAAK,SAAS1B,GAAG,IAAIA,IAAIA,EAAEvI,OAAO,OAAOiH,KAAK,GAAGsB,EAAEvI,OAAOiH,KAAKkC,YAAY,CAAC,IAAI,IAAI5I,EAAE,EAAEA,EAAEgI,EAAEvI,OAAOO,IAAI0G,KAAKiD,OAAO3B,EAAEhI,IAAI,OAAO0G,IAAI,CAAC,IAAI5C,EAAE4C,KAAKkD,OAAO5B,EAAE6B,QAAQ,EAAE7B,EAAEvI,OAAO,EAAE,GAAG,GAAGiH,KAAK5H,KAAKkK,SAASvJ,OAAO,GAAGiH,KAAK5H,KAAKoK,SAASpF,EAAEoF,OAAOxC,KAAKoD,WAAWpD,KAAK5H,KAAKgF,OAAO,CAAC,GAAG4C,KAAK5H,KAAKoK,OAAOpF,EAAEoF,OAAO,CAAC,IAAI1D,EAAEkB,KAAK5H,KAAK4H,KAAK5H,KAAKgF,EAAEA,EAAE0B,CAAC,CAACkB,KAAKqD,QAAQjG,EAAE4C,KAAK5H,KAAKoK,OAAOpF,EAAEoF,OAAO,GAAE,EAAG,MAAMxC,KAAK5H,KAAKgF,EAAE,OAAO4C,IAAI,EAAElB,EAAE4D,UAAUO,OAAO,SAAS3B,GAAG,OAAOA,GAAGtB,KAAKqD,QAAQ/B,EAAEtB,KAAK5H,KAAKoK,OAAO,GAAGxC,IAAI,EAAElB,EAAE4D,UAAUN,MAAM,WAAW,OAAOpC,KAAK5H,KAAK0C,EAAE,IAAIkF,IAAI,EAAElB,EAAE4D,UAAUY,OAAO,SAAShC,EAAEhI,GAAG,IAAIgI,EAAE,OAAOtB,KAAK,IAAI,IAAI5C,EAAE0B,EAAE1C,EAAEmF,EAAEvB,KAAK5H,KAAKoJ,EAAExB,KAAK8C,OAAOxB,GAAGG,EAAE,GAAGC,EAAE,GAAGH,GAAGE,EAAE1I,QAAQ,CAAC,GAAGwI,IAAIA,EAAEE,EAAEgB,MAAM3D,EAAE2C,EAAEA,EAAE1I,OAAO,GAAGqE,EAAEsE,EAAEe,MAAMrG,GAAE,GAAImF,EAAEgB,KAAK,CAAC,IAAIX,EAAErG,EAAE+F,EAAEC,EAAEe,SAAShJ,GAAG,IAAI,IAAIsI,EAAE,OAAOL,EAAEe,SAASiB,OAAO3B,EAAE,GAAGH,EAAE9H,KAAK4H,GAAGvB,KAAKwD,UAAU/B,GAAGzB,IAAI,CAAC5D,GAAGmF,EAAEgB,OAAO5E,EAAE4D,EAAEC,GAAG1C,GAAG1B,IAAImE,EAAEzC,EAAEwD,SAASlF,GAAGhB,GAAE,GAAImF,EAAE,MAAME,EAAE9H,KAAK4H,GAAGG,EAAE/H,KAAKyD,GAAGA,EAAE,EAAE0B,EAAEyC,EAAEA,EAAEA,EAAEe,SAAS,GAAG,CAAC,OAAOtC,IAAI,EAAElB,EAAE4D,UAAUI,OAAO,SAASxB,GAAG,OAAOA,CAAC,EAAExC,EAAE4D,UAAUe,YAAY,SAASnC,EAAEhI,GAAG,OAAOgI,EAAE/I,KAAKe,EAAEf,IAAI,EAAEuG,EAAE4D,UAAUgB,YAAY,SAASpC,EAAEhI,GAAG,OAAOgI,EAAE9I,KAAKc,EAAEd,IAAI,EAAEsG,EAAE4D,UAAUiB,OAAO,WAAW,OAAO3D,KAAK5H,IAAI,EAAE0G,EAAE4D,UAAUkB,SAAS,SAAStC,GAAG,OAAOtB,KAAK5H,KAAKkJ,EAAEtB,IAAI,EAAElB,EAAE4D,UAAUE,KAAK,SAAStB,EAAEhI,GAAG,IAAI,IAAI8D,EAAE,GAAGkE,GAAGA,EAAEiB,KAAKjJ,EAAEK,KAAKkK,MAAMvK,EAAEgI,EAAEgB,UAAUlF,EAAEzD,KAAKkK,MAAMzG,EAAEkE,EAAEgB,UAAUhB,EAAElE,EAAEqF,MAAM,OAAOnJ,CAAC,EAAEwF,EAAE4D,UAAUQ,OAAO,SAAS5B,EAAEhI,EAAE8D,EAAE0B,GAAG,IAAIvD,EAAEgG,EAAEnE,EAAE9D,EAAE,EAAEkI,EAAExB,KAAKiC,YAAY,GAAGV,GAAGC,EAAE,OAAOpF,EAAEb,EAAET,EAAEwG,EAAE6B,MAAM7J,EAAE8D,EAAE,IAAI4C,KAAK8C,QAAQvH,EAAEuD,IAAIA,EAAE7E,KAAKkI,KAAKlI,KAAK0H,IAAIJ,GAAGtH,KAAK0H,IAAIH,IAAIA,EAAEvH,KAAKkI,KAAKZ,EAAEtH,KAAK6J,IAAItC,EAAE1C,EAAE,MAAMvD,EAAET,EAAE,KAAKyH,MAAK,EAAGhH,EAAEiH,OAAO1D,EAAE,IAAI2C,EAAExH,KAAKkI,KAAKZ,EAAEC,GAAGE,EAAED,EAAExH,KAAKkI,KAAKlI,KAAK8H,KAAKP,IAAIV,EAAEQ,EAAEhI,EAAE8D,EAAEsE,EAAE1B,KAAKyD,aAAa,IAAI,IAAI7B,EAAEtI,EAAEsI,GAAGxE,EAAEwE,GAAGF,EAAE,CAAC,IAAII,EAAE7H,KAAKwF,IAAImC,EAAEF,EAAE,EAAEtE,GAAG0D,EAAEQ,EAAEM,EAAEE,EAAEL,EAAEzB,KAAK0D,aAAa,IAAI,IAAI/F,EAAEiE,EAAEjE,GAAGmE,EAAEnE,GAAG8D,EAAE,CAAC,IAAInF,EAAErC,KAAKwF,IAAI9B,EAAE8D,EAAE,EAAEK,GAAGvG,EAAE+G,SAAS3I,KAAKqG,KAAKkD,OAAO5B,EAAE3D,EAAErB,EAAEwC,EAAE,GAAG,CAAC,CAAC,OAAO1C,EAAEb,EAAEyE,KAAK8C,QAAQvH,CAAC,EAAEuD,EAAE4D,UAAUqB,eAAe,SAASzC,EAAEhI,EAAE8D,EAAE0B,GAAG,KAAKA,EAAEnF,KAAKL,IAAIA,EAAEiJ,MAAMzD,EAAE/F,OAAO,IAAIqE,GAAG,CAAC,IAAI,IAAI7B,EAAE,IAAIa,EAAE,IAAImF,OAAE,EAAOC,EAAE,EAAEA,EAAElI,EAAEgJ,SAASvJ,OAAOyI,IAAI,CAAC,IAAIC,EAAEnI,EAAEgJ,SAASd,GAAGE,EAAEE,EAAEH,GAAGK,GAAGnE,EAAE2D,EAAEhF,EAAEmF,GAAGxH,KAAKC,IAAIoC,EAAE7D,KAAKkF,EAAElF,MAAMwB,KAAKwF,IAAInD,EAAE/D,KAAKoF,EAAEpF,QAAQ0B,KAAKC,IAAIoC,EAAE5D,KAAKiF,EAAEjF,MAAMuB,KAAKwF,IAAInD,EAAE9D,KAAKmF,EAAEnF,OAAOkJ,GAAGI,EAAE1F,GAAGA,EAAE0F,EAAEvG,EAAEmG,EAAEnG,EAAEmG,EAAEnG,EAAEgG,EAAEE,GAAGK,IAAI1F,GAAGsF,EAAEnG,IAAIA,EAAEmG,EAAEH,EAAEE,EAAE,CAACnI,EAAEiI,GAAGjI,EAAEgJ,SAAS,EAAE,CAAC,IAAI3E,EAAErB,EAAE,OAAOhD,CAAC,EAAEwF,EAAE4D,UAAUW,QAAQ,SAAS/B,EAAEhI,EAAE8D,GAAG,IAAI0B,EAAE1B,EAAEkE,EAAEtB,KAAK8C,OAAOxB,GAAG/F,EAAE,GAAGa,EAAE4D,KAAK+D,eAAejF,EAAEkB,KAAK5H,KAAKkB,EAAEiC,GAAG,IAAIa,EAAEkG,SAAS3I,KAAK2H,GAAGE,EAAEpF,EAAE0C,GAAGxF,GAAG,GAAGiC,EAAEjC,GAAGgJ,SAASvJ,OAAOiH,KAAKiC,aAAajC,KAAKgE,OAAOzI,EAAEjC,GAAGA,IAAI0G,KAAKiE,oBAAoBnF,EAAEvD,EAAEjC,EAAE,EAAEwF,EAAE4D,UAAUsB,OAAO,SAAS1C,EAAEhI,GAAG,IAAI8D,EAAEkE,EAAEhI,GAAGwF,EAAE1B,EAAEkF,SAASvJ,OAAOwC,EAAEyE,KAAKkC,YAAYlC,KAAKkE,iBAAiB9G,EAAE7B,EAAEuD,GAAG,IAAIyC,EAAEvB,KAAKmE,kBAAkB/G,EAAE7B,EAAEuD,GAAG0C,EAAE1G,EAAEsC,EAAEkF,SAASiB,OAAOhC,EAAEnE,EAAEkF,SAASvJ,OAAOwI,IAAIC,EAAEgB,OAAOpF,EAAEoF,OAAOhB,EAAEe,KAAKnF,EAAEmF,KAAKnG,EAAEgB,EAAE4C,KAAK8C,QAAQ1G,EAAEoF,EAAExB,KAAK8C,QAAQxJ,EAAEgI,EAAEhI,EAAE,GAAGgJ,SAAS3I,KAAK6H,GAAGxB,KAAKoD,WAAWhG,EAAEoE,EAAE,EAAE1C,EAAE4D,UAAUU,WAAW,SAAS9B,EAAEhI,GAAG0G,KAAK5H,KAAK0C,EAAE,CAACwG,EAAEhI,IAAI0G,KAAK5H,KAAKoK,OAAOlB,EAAEkB,OAAO,EAAExC,KAAK5H,KAAKmK,MAAK,EAAGnG,EAAE4D,KAAK5H,KAAK4H,KAAK8C,OAAO,EAAEhE,EAAE4D,UAAUyB,kBAAkB,SAAS7C,EAAEhI,EAAE8D,GAAG,IAAI,IAAI0B,EAAEvD,EAAEa,EAAEoF,EAAEC,EAAEC,EAAEI,EAAEnE,EAAE,IAAIrB,EAAE,IAAIxB,EAAExB,EAAEwB,GAAGsC,EAAE9D,EAAEwB,IAAI,CAAC,IAAIgG,EAAES,EAAED,EAAE,EAAExG,EAAEkF,KAAK8C,QAAQnK,EAAE4I,EAAED,EAAExG,EAAEsC,EAAE4C,KAAK8C,QAAQsB,GAAG7I,EAAEuF,EAAE1E,EAAEzD,EAAE6I,OAAE,EAAOC,OAAE,EAAOC,OAAE,EAAOI,OAAE,EAAON,EAAEvH,KAAKC,IAAIqB,EAAEhD,KAAK6D,EAAE7D,MAAMkJ,EAAExH,KAAKC,IAAIqB,EAAE/C,KAAK4D,EAAE5D,MAAMkJ,EAAEzH,KAAKwF,IAAIlE,EAAE9C,KAAK2D,EAAE3D,MAAMqJ,EAAE7H,KAAKwF,IAAIlE,EAAE7C,KAAK0D,EAAE1D,MAAMuB,KAAKC,IAAI,EAAEwH,EAAEF,GAAGvH,KAAKC,IAAI,EAAE4H,EAAEL,IAAI4C,EAAEzC,EAAEd,GAAGc,EAAEjJ,GAAGyL,EAAEzG,GAAGA,EAAEyG,EAAEtF,EAAEhE,EAAEwB,EAAE+H,EAAE/H,EAAE+H,EAAE/H,GAAG8H,IAAIzG,GAAG0G,EAAE/H,IAAIA,EAAE+H,EAAEvF,EAAEhE,EAAE,CAAC,OAAOgE,GAAG1B,EAAE9D,CAAC,EAAEwF,EAAE4D,UAAUwB,iBAAiB,SAAS5C,EAAEhI,EAAE8D,GAAG,IAAI0B,EAAEwC,EAAEiB,KAAKvC,KAAKyD,YAAYhC,EAAElG,EAAE+F,EAAEiB,KAAKvC,KAAK0D,YAAYhC,EAAE1B,KAAKsE,eAAehD,EAAEhI,EAAE8D,EAAE0B,GAAGkB,KAAKsE,eAAehD,EAAEhI,EAAE8D,EAAE7B,IAAI+F,EAAEgB,SAASzI,KAAKiF,EAAE,EAAEA,EAAE4D,UAAU4B,eAAe,SAAShD,EAAEhI,EAAE8D,EAAE0B,GAAGwC,EAAEgB,SAASzI,KAAKiF,GAAG,IAAI,IAAIvD,EAAEyE,KAAK8C,OAAO1G,EAAEmF,EAAED,EAAE,EAAEhI,EAAEiC,GAAGkG,EAAEF,EAAED,EAAElE,EAAE9D,EAAE8D,EAAE7B,GAAGmG,EAAEI,EAAE1F,GAAG0F,EAAEL,GAAGG,EAAEtI,EAAEsI,EAAExE,EAAE9D,EAAEsI,IAAI,CAAC,IAAIjE,EAAE2D,EAAEgB,SAASV,GAAGJ,EAAEpF,EAAEkF,EAAEiB,KAAKhH,EAAEoC,GAAGA,GAAG+D,GAAGI,EAAE1F,EAAE,CAAC,IAAI,IAAIE,EAAEc,EAAE9D,EAAE,EAAEgD,GAAGhD,EAAEgD,IAAI,CAAC,IAAIxB,EAAEwG,EAAEgB,SAAShG,GAAGkF,EAAEC,EAAEH,EAAEiB,KAAKhH,EAAET,GAAGA,GAAG4G,GAAGI,EAAEL,EAAE,CAAC,OAAOC,CAAC,EAAE5C,EAAE4D,UAAUuB,oBAAoB,SAAS3C,EAAEhI,EAAE8D,GAAG,IAAI,IAAI0B,EAAE1B,EAAE0B,GAAG,EAAEA,IAAI0C,EAAElI,EAAEwF,GAAGwC,EAAE,EAAExC,EAAE4D,UAAUc,UAAU,SAASlC,GAAG,IAAI,IAAIhI,EAAEgI,EAAEvI,OAAO,EAAEqE,OAAE,EAAO9D,GAAG,EAAEA,IAAI,IAAIgI,EAAEhI,GAAGgJ,SAASvJ,OAAOO,EAAE,GAAG8D,EAAEkE,EAAEhI,EAAE,GAAGgJ,UAAUiB,OAAOnG,EAAEiF,QAAQf,EAAEhI,IAAI,GAAG0G,KAAKoC,QAAQhG,EAAEkF,EAAEhI,GAAG0G,KAAK8C,OAAO,EAAEhE,CAAC,CAAzuMxF,E,qCCAnF,IAAIiL,EAAQC,MAAM9B,UAEC6B,EAAMpB,MACRoB,EAAME,G,gCCHR,WAASrI,EAAGC,GACzB,OAAOD,EAAIC,GAAK,EAAID,EAAIC,EAAI,EAAID,GAAKC,EAAI,EAAIqI,GAC/C,CCCA,ICDwBC,EA0BK/C,EAzBJ,KADD+C,EDCOC,GCAjB7L,SAyBe6I,EAzB6B+C,EAA9BA,EA0BnB,SAAS7D,EAAGnI,GACjB,OAAOiM,EAAUhD,EAAEd,GAAInI,EACzB,E,oGC/Ba,WAASkM,GAQtB,IAPA,IACIlH,EAGAmH,EACAP,EALAnH,EAAIyH,EAAO9L,OAEXO,GAAK,EACL4G,EAAI,IAIC5G,EAAI8D,GAAG8C,GAAK2E,EAAOvL,GAAGP,OAG/B,IAFA+L,EAAS,IAAIN,MAAMtE,KAEV9C,GAAK,GAGZ,IADAO,GADA4G,EAAQM,EAAOzH,IACLrE,SACD4E,GAAK,GACZmH,IAAS5E,GAAKqE,EAAM5G,GAIxB,OAAOmH,CACT,C,iHCpBU7K,KAAK8H,KAAK,IACX9H,KAAK8H,KAAK,IACV9H,KAAK8H,KAAK,E,qCCKJ,aACb,OAAO,IAAIgD,CACb,CAEA,SAASA,IACP/E,KAAKgF,OACP,C,gCAEAD,EAAMrC,UAAY,CAChBuC,YAAaF,EACbC,MAAO,WACLhF,KAAKyB,EACLzB,KAAKsB,EAAI,CACX,EACA4D,IAAK,SAAStM,GACZsM,EAAIC,EAAMvM,EAAGoH,KAAKsB,GAClB4D,EAAIlF,KAAMmF,EAAK1D,EAAGzB,KAAKyB,GACnBzB,KAAKyB,EAAGzB,KAAKsB,GAAK6D,EAAK7D,EACtBtB,KAAKyB,EAAI0D,EAAK7D,CACrB,EACA8D,QAAS,WACP,OAAOpF,KAAKyB,CACd,GAGF,IAAI0D,EAAO,IAAIJ,EAEf,SAASG,EAAIG,EAAOjJ,EAAGC,GACrB,IAAI1D,EAAI0M,EAAM5D,EAAIrF,EAAIC,EAClBiJ,EAAK3M,EAAIyD,EACTmJ,EAAK5M,EAAI2M,EACbD,EAAM/D,EAAKlF,EAAImJ,GAAOlJ,EAAIiJ,EAC5B,C,kGC/BIE,EACAC,EACAC,EACAC,EACAC,E,iCAPOC,G,UAAcR,EAAAA,EAAAA,MAErBS,GAAUT,EAAAA,EAAAA,KAOHU,EAAa,CACtBC,MAAOC,EAAAA,EACPC,UAAWD,EAAAA,EACXE,QAASF,EAAAA,EACTG,aAAc,WACZP,EAAYb,QACZe,EAAWG,UAAYG,EACvBN,EAAWI,QAAUG,CACvB,EACAC,WAAY,WACV,IAAIC,GAAYX,EAChBC,EAAQZ,IAAIsB,EAAW,EAAIC,EAAAA,GAAMD,EAAWA,GAC5CxG,KAAKkG,UAAYlG,KAAKmG,QAAUnG,KAAKgG,MAAQC,EAAAA,CAC/C,EACAS,OAAQ,WACNZ,EAAQZ,IAAIuB,EAAAA,GACd,GAGF,SAASJ,IACPN,EAAWC,MAAQW,CACrB,CAEA,SAASL,IACPM,EAAUpB,EAAUC,EACtB,CAEA,SAASkB,EAAeE,EAAQC,GAC9Bf,EAAWC,MAAQY,EACnBpB,EAAWqB,EAAQpB,EAAQqB,EAC3BD,GAAUE,EAAAA,GAASD,GAAOC,EAAAA,GAC1BrB,EAAUmB,EAAQlB,GAAUqB,EAAAA,EAAAA,IAAIF,EAAMA,EAAM,EAAIG,EAAAA,IAAYrB,GAAUsB,EAAAA,EAAAA,IAAIJ,EAC5E,CAEA,SAASF,EAAUC,EAAQC,GACzBD,GAAUE,EAAAA,GACVD,GADmBA,GAAOC,EAAAA,IACd,EAAIE,EAAAA,GAKhB,IAAIE,EAAUN,EAASnB,EACnB0B,EAAWD,GAAW,EAAI,GAAK,EAC/BE,EAAWD,EAAWD,EACtBG,GAASN,EAAAA,EAAAA,IAAIF,GACbS,GAASL,EAAAA,EAAAA,IAAIJ,GACbU,EAAI5B,EAAU2B,EACdzF,EAAI6D,EAAU2B,EAASE,GAAIR,EAAAA,EAAAA,IAAIK,GAC/BjD,EAAIoD,EAAIJ,GAAWF,EAAAA,EAAAA,IAAIG,GAC3BxB,EAAYX,KAAIuC,EAAAA,EAAAA,IAAMrD,EAAGtC,IAGzB4D,EAAUmB,EAAQlB,EAAU2B,EAAQ1B,EAAU2B,CAChD,C,wFCzDelC,EAAAA,EAAAA,I,4JCRR,SAASqC,EAAUC,GACxB,MAAO,EAACF,EAAAA,EAAAA,IAAME,EAAU,GAAIA,EAAU,KAAKC,EAAAA,EAAAA,IAAKD,EAAU,IAC5D,CAEO,SAASA,EAAUD,GACxB,IAAIb,EAASa,EAAU,GAAIZ,EAAMY,EAAU,GAAIJ,GAASN,EAAAA,EAAAA,IAAIF,GAC5D,MAAO,CAACQ,GAASN,EAAAA,EAAAA,IAAIH,GAASS,GAASJ,EAAAA,EAAAA,IAAIL,IAASK,EAAAA,EAAAA,IAAIJ,GAC1D,CAMO,SAASe,EAAezL,EAAGC,GAChC,MAAO,CAACD,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GAAID,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GAAID,EAAE,GAAKC,EAAE,GAAKD,EAAE,GAAKC,EAAE,GACvF,CAYO,SAASyL,EAA0BhH,GACxC,IAAIY,GAAIK,EAAAA,EAAAA,IAAKjB,EAAE,GAAKA,EAAE,GAAKA,EAAE,GAAKA,EAAE,GAAKA,EAAE,GAAKA,EAAE,IAClDA,EAAE,IAAMY,EAAGZ,EAAE,IAAMY,EAAGZ,EAAE,IAAMY,CAChC,C,yCC5BIqG,EACAC,EAAIC,EAAIC,EAGR1C,EAAUC,EACV5I,EAAIC,EAAIqL,E,sBAERC,G,SAAiB,CACnB1B,OAAQT,EAAAA,EACRD,MAAOqC,EACPnC,UAAWoC,EACXnC,QAASoC,EACTnC,aAAc,WACZgC,EAAelC,UAAYsC,EAC3BJ,EAAejC,QAAUsC,CAC3B,EACAlC,WAAY,WACV6B,EAAelC,UAAYoC,EAC3BF,EAAejC,QAAUoC,CAC3B,IAIF,SAASF,EAAcxB,EAAQC,GAC7BD,GAAUE,EAAAA,GAASD,GAAOC,EAAAA,GAC1B,IAAIO,GAASN,EAAAA,EAAAA,IAAIF,GACjB4B,EAAuBpB,GAASN,EAAAA,EAAAA,IAAIH,GAASS,GAASJ,EAAAA,EAAAA,IAAIL,IAASK,EAAAA,EAAAA,IAAIJ,GACzE,CAEA,SAAS4B,EAAuB/P,EAAGC,EAAGsC,KAClC6M,EACFC,IAAOrP,EAAIqP,GAAMD,EACjBE,IAAOrP,EAAIqP,GAAMF,EACjBG,IAAOhN,EAAIgN,GAAMH,CACnB,CAEA,SAASO,IACPF,EAAepC,MAAQ2C,CACzB,CAEA,SAASA,EAAuB9B,EAAQC,GACtCD,GAAUE,EAAAA,GAASD,GAAOC,EAAAA,GAC1B,IAAIO,GAASN,EAAAA,EAAAA,IAAIF,GACjBjK,EAAKyK,GAASN,EAAAA,EAAAA,IAAIH,GAClB/J,EAAKwK,GAASJ,EAAAA,EAAAA,IAAIL,GAClBsB,GAAKjB,EAAAA,EAAAA,IAAIJ,GACTsB,EAAepC,MAAQ4C,EACvBF,EAAuB7L,EAAIC,EAAIqL,EACjC,CAEA,SAASS,EAAkB/B,EAAQC,GACjCD,GAAUE,EAAAA,GAASD,GAAOC,EAAAA,GAC1B,IAAIO,GAASN,EAAAA,EAAAA,IAAIF,GACbnO,EAAI2O,GAASN,EAAAA,EAAAA,IAAIH,GACjBjO,EAAI0O,GAASJ,EAAAA,EAAAA,IAAIL,GACjB3L,GAAIgM,EAAAA,EAAAA,IAAIJ,GACR+B,GAAIpB,EAAAA,EAAAA,KAAM1F,EAAAA,EAAAA,KAAM8G,EAAI/L,EAAK5B,EAAIiN,EAAKvP,GAAKiQ,GAAKA,EAAIV,EAAKxP,EAAIkE,EAAK3B,GAAK2N,GAAKA,EAAIhM,EAAKjE,EAAIkE,EAAKnE,GAAKkQ,GAAIhM,EAAKlE,EAAImE,EAAKlE,EAAIuP,EAAKjN,GACxH2N,EACAA,GAAKhM,GAAMA,EAAKlE,IAChBkQ,GAAK/L,GAAMA,EAAKlE,IAChBiQ,GAAKV,GAAMA,EAAKjN,IACtBwN,EAAuB7L,EAAIC,EAAIqL,EACjC,CAEA,SAASI,IACPH,EAAepC,MAAQqC,CACzB,CAIA,SAASG,IACPJ,EAAepC,MAAQ8C,CACzB,CAEA,SAASL,IACPM,EAAkBvD,EAAUC,GAC5B2C,EAAepC,MAAQqC,CACzB,CAEA,SAASS,EAAuBjC,EAAQC,GACtCtB,EAAWqB,EAAQpB,EAAQqB,EAC3BD,GAAUE,EAAAA,GAASD,GAAOC,EAAAA,GAC1BqB,EAAepC,MAAQ+C,EACvB,IAAIzB,GAASN,EAAAA,EAAAA,IAAIF,GACjBjK,EAAKyK,GAASN,EAAAA,EAAAA,IAAIH,GAClB/J,EAAKwK,GAASJ,EAAAA,EAAAA,IAAIL,GAClBsB,GAAKjB,EAAAA,EAAAA,IAAIJ,GACT4B,EAAuB7L,EAAIC,EAAIqL,EACjC,CAEA,SAASY,EAAkBlC,EAAQC,GACjCD,GAAUE,EAAAA,GAASD,GAAOC,EAAAA,GAC1B,IAAIO,GAASN,EAAAA,EAAAA,IAAIF,GACbnO,EAAI2O,GAASN,EAAAA,EAAAA,IAAIH,GACjBjO,EAAI0O,GAASJ,EAAAA,EAAAA,IAAIL,GACjB3L,GAAIgM,EAAAA,EAAAA,IAAIJ,GACRrK,EAAKK,EAAK5B,EAAIiN,EAAKvP,EACnBgE,EAAKuL,EAAKxP,EAAIkE,EAAK3B,EACnB8N,EAAKnM,EAAKjE,EAAIkE,EAAKnE,EACnBgF,GAAIoE,EAAAA,EAAAA,IAAKtF,EAAKA,EAAKG,EAAKA,EAAKoM,EAAKA,GAClCH,GAAIjB,EAAAA,EAAAA,IAAKjK,GACTyG,EAAIzG,IAAMkL,EAAIlL,EACZyG,EAAI3H,EACJ2H,EAAIxH,EACJwH,EAAI4E,EACJH,EACAA,GAAKhM,GAAMA,EAAKlE,IAChBkQ,GAAK/L,GAAMA,EAAKlE,IAChBiQ,GAAKV,GAAMA,EAAKjN,IACtBwN,EAAuB7L,EAAIC,EAAIqL,EACjC,C,6HC/Gec,EAAAA,EAAAA,IACb,WAAa,OAAO,CAAM,IAS5B,SAA8BC,GAC5B,IAGIC,EAHAzD,EAAUhB,IACV0E,EAAO1E,IACP2E,EAAQ3E,IAGZ,MAAO,CACLwB,UAAW,WACTgD,EAAOhD,YACPiD,EAAQ,CACV,EACAnD,MAAO,SAASsD,EAASC,GACvB,IAAIC,EAAQF,EAAU,EAAIG,EAAAA,IAAMA,EAAAA,GAC5BC,GAAQtL,EAAAA,EAAAA,IAAIkL,EAAU5D,IACtBtH,EAAAA,EAAAA,IAAIsL,EAAQD,EAAAA,IAAME,EAAAA,IACpBT,EAAOlD,MAAMN,EAAS0D,GAAQA,EAAOG,GAAQ,EAAI,EAAIK,EAAAA,IAAUA,EAAAA,IAC/DV,EAAOlD,MAAMqD,EAAOD,GACpBF,EAAO/C,UACP+C,EAAOhD,YACPgD,EAAOlD,MAAMwD,EAAOJ,GACpBF,EAAOlD,MAAMsD,EAASF,GACtBD,EAAQ,GACCE,IAAUG,GAASE,GAASD,EAAAA,MACjCrL,EAAAA,EAAAA,IAAIsH,EAAU2D,GAASM,EAAAA,KAASjE,GAAW2D,EAAQM,EAAAA,KACnDvL,EAAAA,EAAAA,IAAIkL,EAAUE,GAASG,EAAAA,KAASL,GAAWE,EAAQG,EAAAA,IACvDP,EAoBR,SAAmC1D,EAAS0D,EAAME,EAASC,GACzD,IAAI5D,EACAkE,EACAC,GAAoB5C,EAAAA,EAAAA,IAAIxB,EAAU4D,GACtC,OAAOlL,EAAAA,EAAAA,IAAI0L,GAAqBH,EAAAA,IAC1BI,EAAAA,EAAAA,MAAM7C,EAAAA,EAAAA,IAAIkC,IAASS,GAAU7C,EAAAA,EAAAA,IAAIuC,KAASrC,EAAAA,EAAAA,IAAIoC,IAC1CpC,EAAAA,EAAAA,IAAIqC,IAAS5D,GAAUqB,EAAAA,EAAAA,IAAIoC,KAASlC,EAAAA,EAAAA,IAAIxB,KACvCC,EAAUkE,EAAUC,KACxBV,EAAOG,GAAQ,CACxB,CA7BeS,CAA0BtE,EAAS0D,EAAME,EAASC,GACzDL,EAAOlD,MAAMqD,EAAOD,GACpBF,EAAO/C,UACP+C,EAAOhD,YACPgD,EAAOlD,MAAMwD,EAAOJ,GACpBD,EAAQ,GAEVD,EAAOlD,MAAMN,EAAU4D,EAASF,EAAOG,GACvCF,EAAQG,CACV,EACArD,QAAS,WACP+C,EAAO/C,UACPT,EAAU0D,EAAO1E,GACnB,EACAyE,MAAO,WACL,OAAO,EAAIA,CACb,EAEJ,IAaA,SAAqCc,EAAMC,EAAIC,EAAWjB,GACxD,IAAIpC,EACJ,GAAY,MAARmD,EACFnD,EAAMqD,EAAYP,EAAAA,GAClBV,EAAOlD,OAAOyD,EAAAA,GAAI3C,GAClBoC,EAAOlD,MAAM,EAAGc,GAChBoC,EAAOlD,MAAMyD,EAAAA,GAAI3C,GACjBoC,EAAOlD,MAAMyD,EAAAA,GAAI,GACjBP,EAAOlD,MAAMyD,EAAAA,IAAK3C,GAClBoC,EAAOlD,MAAM,GAAIc,GACjBoC,EAAOlD,OAAOyD,EAAAA,IAAK3C,GACnBoC,EAAOlD,OAAOyD,EAAAA,GAAI,GAClBP,EAAOlD,OAAOyD,EAAAA,GAAI3C,QACb,IAAI1I,EAAAA,EAAAA,IAAI6L,EAAK,GAAKC,EAAG,IAAMP,EAAAA,GAAS,CACzC,IAAI9C,EAASoD,EAAK,GAAKC,EAAG,GAAKT,EAAAA,IAAMA,EAAAA,GACrC3C,EAAMqD,EAAYtD,EAAS,EAC3BqC,EAAOlD,OAAOa,EAAQC,GACtBoC,EAAOlD,MAAM,EAAGc,GAChBoC,EAAOlD,MAAMa,EAAQC,EACvB,MACEoC,EAAOlD,MAAMkE,EAAG,GAAIA,EAAG,GAE3B,GApFE,EAAET,EAAAA,IAAKG,EAAAA,I,oFCLM,aACb,IACIQ,EADAC,EAAQ,GAEZ,MAAO,CACLrE,MAAO,SAASrN,EAAGC,GACjBwR,EAAKzQ,KAAK,CAAChB,EAAGC,GAChB,EACAsN,UAAW,WACTmE,EAAM1Q,KAAKyQ,EAAO,GACpB,EACAjE,QAASF,EAAAA,EACTqE,OAAQ,WACFD,EAAMtR,OAAS,GAAGsR,EAAM1Q,KAAK0Q,EAAM5H,MAAM8H,OAAOF,EAAMG,SAC5D,EACA/J,OAAQ,WACN,IAAIA,EAAS4J,EAGb,OAFAA,EAAQ,GACRD,EAAO,KACA3J,CACT,EAEJ,C,mOCrBA,SAASgK,EAAazE,EAAO0E,EAAQC,EAAOC,GAC1C5K,KAAKrH,EAAIqN,EACThG,KAAK9E,EAAIwP,EACT1K,KAAKwB,EAAImJ,EACT3K,KAAKzE,EAAIqP,EACT5K,KAAKoE,GAAI,EACTpE,KAAK5C,EAAI4C,KAAKlF,EAAI,IACpB,CAKe,WAAS+P,EAAUC,EAAqBC,EAAaC,EAAa9B,GAC/E,IAEI5P,EACA8D,EAHA6N,EAAU,GACVhC,EAAO,GAwBX,GApBA4B,EAASK,SAAQ,SAASC,GACxB,MAAK/N,EAAI+N,EAAQpS,OAAS,IAAM,GAAhC,CACA,IAAIqE,EAAqCzE,EAAlCyS,EAAKD,EAAQ,GAAIpM,EAAKoM,EAAQ/N,GAKrC,IAAIiO,EAAAA,EAAAA,GAAWD,EAAIrM,GAAnB,CAEE,IADAmK,EAAOhD,YACF5M,EAAI,EAAGA,EAAI8D,IAAK9D,EAAG4P,EAAOlD,OAAOoF,EAAKD,EAAQ7R,IAAI,GAAI8R,EAAG,IAC9DlC,EAAO/C,SAET,MAEA8E,EAAQtR,KAAKhB,EAAI,IAAI8R,EAAaW,EAAID,EAAS,MAAM,IACrDlC,EAAKtP,KAAKhB,EAAE6I,EAAI,IAAIiJ,EAAaW,EAAI,KAAMzS,GAAG,IAC9CsS,EAAQtR,KAAKhB,EAAI,IAAI8R,EAAa1L,EAAIoM,EAAS,MAAM,IACrDlC,EAAKtP,KAAKhB,EAAE6I,EAAI,IAAIiJ,EAAa1L,EAAI,KAAMpG,GAAG,GAhBL,CAiB3C,IAEKsS,EAAQlS,OAAb,CAMA,IAJAkQ,EAAKpP,KAAKiR,GACVQ,EAAKL,GACLK,EAAKrC,GAEA3P,EAAI,EAAG8D,EAAI6L,EAAKlQ,OAAQO,EAAI8D,IAAK9D,EACpC2P,EAAK3P,GAAGiC,EAAIwP,GAAeA,EAO7B,IAJA,IACIL,EACA1E,EAFA5L,EAAQ6Q,EAAQ,KAIV,CAIR,IAFA,IAAIM,EAAUnR,EACVoR,GAAY,EACTD,EAAQnH,OAAQmH,EAAUA,EAAQnO,KAAOhD,EAAO,OACvDsQ,EAASa,EAAQrQ,EACjBgO,EAAOhD,YACP,EAAG,CAED,GADAqF,EAAQnH,EAAImH,EAAQ/J,EAAE4C,GAAI,EACtBmH,EAAQhQ,EAAG,CACb,GAAIiQ,EACF,IAAKlS,EAAI,EAAG8D,EAAIsN,EAAO3R,OAAQO,EAAI8D,IAAK9D,EAAG4P,EAAOlD,OAAOA,EAAQ0E,EAAOpR,IAAI,GAAI0M,EAAM,SAEtFgF,EAAYO,EAAQ5S,EAAG4S,EAAQnO,EAAEzE,EAAG,EAAGuQ,GAEzCqC,EAAUA,EAAQnO,CACpB,KAAO,CACL,GAAIoO,EAEF,IADAd,EAASa,EAAQzQ,EAAEI,EACd5B,EAAIoR,EAAO3R,OAAS,EAAGO,GAAK,IAAKA,EAAG4P,EAAOlD,OAAOA,EAAQ0E,EAAOpR,IAAI,GAAI0M,EAAM,SAEpFgF,EAAYO,EAAQ5S,EAAG4S,EAAQzQ,EAAEnC,GAAI,EAAGuQ,GAE1CqC,EAAUA,EAAQzQ,CACpB,CAEA4P,GADAa,EAAUA,EAAQ/J,GACDtG,EACjBsQ,GAAaA,CACf,QAAUD,EAAQnH,GAClB8E,EAAO/C,SACT,CA5C2B,CA6C7B,CAEA,SAASmF,EAAK/G,GACZ,GAAMnH,EAAImH,EAAMxL,OAAhB,CAKA,IAJA,IAAIqE,EAGAf,EAFA/C,EAAI,EACJ8C,EAAImI,EAAM,KAELjL,EAAI8D,GACXhB,EAAEgB,EAAIf,EAAIkI,EAAMjL,GAChB+C,EAAEvB,EAAIsB,EACNA,EAAIC,EAEND,EAAEgB,EAAIf,EAAIkI,EAAM,GAChBlI,EAAEvB,EAAIsB,CAXyB,CAYjC,C,mJClGIqP,EAAc,CAAC,KAAM,MACrBC,EAAS,CAACC,KAAM,aAAcF,YAAaA,GAEhC,WAASrP,EAAGC,GAGzB,OAFAoP,EAAY,GAAKrP,EACjBqP,EAAY,GAAKpP,GACVtD,EAAAA,EAAAA,GAAO2S,EAChB,C,4KCHIhG,EACAE,EACAD,E,4CAHAiG,GAAYvG,EAAAA,EAAAA,KAKZwG,EAAe,CACjBnF,OAAQT,EAAAA,EACRD,MAAOC,EAAAA,EACPC,UAMF,WACE2F,EAAa7F,MAAQ8F,EACrBD,EAAa1F,QAAU4F,CACzB,EARE5F,QAASF,EAAAA,EACTG,aAAcH,EAAAA,EACdM,WAAYN,EAAAA,GAQd,SAAS8F,IACPF,EAAa7F,MAAQ6F,EAAa1F,QAAUF,EAAAA,CAC9C,CAEA,SAAS6F,EAAiBjF,EAAQC,GAChCD,GAAUE,EAAAA,GAASD,GAAOC,EAAAA,GAC1BrB,EAAUmB,EAAQjB,GAAUsB,EAAAA,EAAAA,IAAIJ,GAAMnB,GAAUqB,EAAAA,EAAAA,IAAIF,GACpD+E,EAAa7F,MAAQgG,CACvB,CAEA,SAASA,EAAYnF,EAAQC,GAC3BD,GAAUE,EAAAA,GAASD,GAAOC,EAAAA,GAC1B,IAAIQ,GAASL,EAAAA,EAAAA,IAAIJ,GACbQ,GAASN,EAAAA,EAAAA,IAAIF,GACb4C,GAAQtL,EAAAA,EAAAA,IAAIyI,EAASnB,GACrBuG,GAAWjF,EAAAA,EAAAA,IAAI0C,GAEf/Q,EAAI2O,GADOJ,EAAAA,EAAAA,IAAIwC,GAEf9Q,EAAI+M,EAAU4B,EAAS3B,EAAU0B,EAAS2E,EAC1C/Q,EAAI0K,EAAU2B,EAAS5B,EAAU2B,EAAS2E,EAC9CL,EAAU1G,KAAIuC,EAAAA,EAAAA,KAAM1F,EAAAA,EAAAA,IAAKpJ,EAAIA,EAAIC,EAAIA,GAAIsC,IACzCwK,EAAUmB,EAAQjB,EAAU2B,EAAQ5B,EAAU2B,CAChD,CAEe,WAASoE,GAGtB,OAFAE,EAAU5G,SACVkE,EAAAA,EAAAA,GAAOwC,EAAQG,IACPD,CACV,C,8dCpDO,IAAIjC,EAAU,KAEVF,EAAKxP,KAAKiS,GACVtC,EAASH,EAAK,EACdxC,EAAYwC,EAAK,EACjBhD,EAAW,EAALgD,EAEN0C,EAAU,IAAM1C,EAChB1C,EAAU0C,EAAK,IAEfrL,EAAMnE,KAAKmE,IACX2L,EAAO9P,KAAK8P,KACZtC,EAAQxN,KAAKwN,MACbT,EAAM/M,KAAK+M,IAEXnF,GADO5H,KAAKkI,KACNlI,KAAK4H,KAEXF,GADQ1H,KAAK+H,MACP/H,KAAK0H,KAEXuF,GADMjN,KAAK6J,IACL7J,KAAKiN,KAEXnF,GADO9H,KAAKmF,KACLnF,KAAK8H,MACZ/D,EAAM/D,KAAK+D,IAEf,SAASoO,EAAKzT,GACnB,OAAOA,EAAI,EAAI,EAAIA,GAAK,EAAI8Q,EAAKxP,KAAKmS,KAAKzT,EAC7C,CAEO,SAASiP,EAAKjP,GACnB,OAAOA,EAAI,EAAIiR,EAASjR,GAAK,GAAKiR,EAAS3P,KAAK2N,KAAKjP,EACvD,C,qCC9Be,SAASsN,IAAQ,C,wECM5BoG,EACAC,EACAzP,EACAC,E,iCALAgJ,GAAUT,EAAAA,EAAAA,KACVQ,GAAcR,EAAAA,EAAAA,KAMdU,EAAa,CACfC,MAAOC,EAAAA,EACPC,UAAWD,EAAAA,EACXE,QAASF,EAAAA,EACTG,aAAc,WACZL,EAAWG,UAAYG,EACvBN,EAAWI,QAAUG,CACvB,EACAC,WAAY,WACVR,EAAWG,UAAYH,EAAWI,QAAUJ,EAAWC,MAAQC,EAAAA,EAC/DH,EAAQZ,KAAI9G,EAAAA,EAAAA,IAAIyH,IAChBA,EAAYb,OACd,EACAvE,OAAQ,WACN,IAAI1F,EAAO+K,EAAU,EAErB,OADAA,EAAQd,QACDjK,CACT,GAGF,SAASsL,IACPN,EAAWC,MAAQW,CACrB,CAEA,SAASA,EAAehO,EAAGC,GACzBmN,EAAWC,MAAQY,EACnByF,EAAMxP,EAAKlE,EAAG2T,EAAMxP,EAAKlE,CAC3B,CAEA,SAASgO,EAAUjO,EAAGC,GACpBiN,EAAYX,IAAIpI,EAAKnE,EAAIkE,EAAKjE,GAC9BiE,EAAKlE,EAAGmE,EAAKlE,CACf,CAEA,SAAS0N,IACPM,EAAUyF,EAAKC,EACjB,C,oDC7CIzP,EAAKkB,IACLjB,EAAKD,EACLE,GAAMF,EACNG,EAAKD,EAIIkJ,EAAAA,EACFA,EAAAA,EACKA,EAAAA,EACFA,EAAAA,C,oGC+BJA,C,wCCtCNsG,EACAF,EACAC,EACAzP,EACAC,E,iCALA8O,GAAYvG,EAAAA,EAAAA,KAOZwG,EAAe,CACjB7F,MAAOC,EAAAA,EACPC,UAAW,WACT2F,EAAa7F,MAAQ8F,CACvB,EACA3F,QAAS,WACHoG,GAAYP,EAAYK,EAAKC,GACjCT,EAAa7F,MAAQC,EAAAA,CACvB,EACAG,aAAc,WACZmG,GAAa,CACf,EACAhG,WAAY,WACVgG,EAAa,IACf,EACA9L,OAAQ,WACN,IAAI1H,GAAU6S,EAEd,OADAA,EAAU5G,QACHjM,CACT,GAGF,SAAS+S,EAAiBnT,EAAGC,GAC3BiT,EAAa7F,MAAQgG,EACrBK,EAAMxP,EAAKlE,EAAG2T,EAAMxP,EAAKlE,CAC3B,CAEA,SAASoT,EAAYrT,EAAGC,GACtBiE,GAAMlE,EAAGmE,GAAMlE,EACfgT,EAAU1G,KAAInD,EAAAA,EAAAA,IAAKlF,EAAKA,EAAKC,EAAKA,IAClCD,EAAKlE,EAAGmE,EAAKlE,CACf,C,qCCWA,SAAS4T,EAAOC,GACd,MAAO,MAAQA,EACT,IAAMA,EAAS,IAAMA,EAAS,aAAe,EAAIA,EACjD,IAAMA,EAAS,IAAMA,EAAS,YAAc,EAAIA,EAChD,GACR,CApDWD,EAAO,I,oFCJH,WAASpQ,EAAGC,GACzB,OAAO+B,EAAAA,EAAAA,IAAIhC,EAAE,GAAKC,EAAE,IAAMsN,EAAAA,KAAWvL,EAAAA,EAAAA,IAAIhC,EAAE,GAAKC,EAAE,IAAMsN,EAAAA,EAC1D,C,yGCAI1J,GAAMoF,EAAAA,EAAAA,KAEK,WAASqH,EAAS1G,GAC/B,IAAIa,EAASb,EAAM,GACfc,EAAMd,EAAM,GACZ2G,EAAS,EAACzF,EAAAA,EAAAA,IAAIL,KAAUG,EAAAA,EAAAA,IAAIH,GAAS,GACrC+F,EAAQ,EACRC,EAAU,EAEd5M,EAAI+E,QAEJ,IAAK,IAAI1L,EAAI,EAAG8D,EAAIsP,EAAQ3T,OAAQO,EAAI8D,IAAK9D,EAC3C,GAAMqE,GAAKmP,EAAOJ,EAAQpT,IAAIP,OAS9B,IARA,IAAI+T,EACAnP,EACAoP,EAASD,EAAKnP,EAAI,GAClB+H,EAAUqH,EAAO,GACjB3D,EAAO2D,EAAO,GAAK,EAAI9F,EAAAA,GACvBrB,GAAUsB,EAAAA,EAAAA,IAAIkC,GACdzD,GAAUqB,EAAAA,EAAAA,IAAIoC,GAETlJ,EAAI,EAAGA,EAAIvC,IAAKuC,EAAGwF,EAAU4D,EAAS1D,EAAUoH,EAASrH,EAAUkE,EAASkD,EAASE,EAAQ,CACpG,IAAIA,EAASH,EAAK5M,GACdoJ,EAAU2D,EAAO,GACjB1D,EAAO0D,EAAO,GAAK,EAAIhG,EAAAA,GACvB+F,GAAU9F,EAAAA,EAAAA,IAAIqC,GACdM,GAAU7C,EAAAA,EAAAA,IAAIuC,GACdG,EAAQJ,EAAU5D,EAClBtG,EAAOsK,GAAS,EAAI,GAAK,EACzBwD,EAAW9N,EAAOsK,EAClByD,EAAeD,EAAWzD,EAAAA,GAC1BjC,EAAI5B,EAAUoH,EAOlB,GALA/M,EAAIiF,KAAIuC,EAAAA,EAAAA,IAAMD,EAAIpI,GAAO8H,EAAAA,EAAAA,IAAIgG,GAAWvH,EAAUkE,EAAUrC,GAAIR,EAAAA,EAAAA,IAAIkG,KACpEN,GAASO,EAAezD,EAAQtK,EAAOqH,EAAAA,GAAMiD,EAIzCyD,EAAezH,GAAWmB,EAASyC,GAAWzC,EAAQ,CACxD,IAAIuG,GAAMvF,EAAAA,EAAAA,KAAeF,EAAAA,EAAAA,IAAUoF,IAASpF,EAAAA,EAAAA,IAAUsF,KACtDnF,EAAAA,EAAAA,IAA0BsF,GAC1B,IAAIC,GAAexF,EAAAA,EAAAA,IAAe8E,EAAQS,IAC1CtF,EAAAA,EAAAA,IAA0BuF,GAC1B,IAAIC,GAAUH,EAAezD,GAAS,GAAK,EAAI,IAAK9B,EAAAA,EAAAA,IAAKyF,EAAa,KAClEvG,EAAMwG,GAAUxG,IAAQwG,IAAWF,EAAI,IAAMA,EAAI,OACnDP,GAAWM,EAAezD,GAAS,EAAI,GAAK,EAEhD,CACF,CAcF,OAAQkD,GAASjD,EAAAA,IAAWiD,EAAQjD,EAAAA,IAAW1J,GAAO0J,EAAAA,IAAsB,EAAVkD,CACpE,C,gOCjEO,SAASU,EAAaC,GAC3B,OAAO,SAAS7U,EAAGC,GACjB,IAAI6D,GAAKuK,EAAAA,EAAAA,IAAIrO,GACTiE,GAAKoK,EAAAA,EAAAA,IAAIpO,GACT4O,EAAIgG,EAAM/Q,EAAKG,GACnB,MAAO,CACL4K,EAAI5K,GAAKsK,EAAAA,EAAAA,IAAIvO,GACb6O,GAAIN,EAAAA,EAAAA,IAAItO,GAEZ,CACF,CAEO,SAAS6U,EAAgBb,GAC9B,OAAO,SAASjU,EAAGC,GACjB,IAAIsC,GAAI6G,EAAAA,EAAAA,IAAKpJ,EAAIA,EAAIC,EAAIA,GACrB0D,EAAIsQ,EAAM1R,GACVwS,GAAKxG,EAAAA,EAAAA,IAAI5K,GACTqR,GAAK3G,EAAAA,EAAAA,IAAI1K,GACb,MAAO,EACLmL,EAAAA,EAAAA,IAAM9O,EAAI+U,EAAIxS,EAAIyS,IAClB/F,EAAAA,EAAAA,IAAK1M,GAAKtC,EAAI8U,EAAKxS,GAEvB,CACF,C,+DCrBW0S,G,UAAwBL,EAAAA,EAAAA,IAAa,SAASM,GACvD,OAAO9L,EAAAA,EAAAA,IAAK,GAAK,EAAI8L,GACvB,KAEAD,EAAsBE,QAASL,EAAAA,EAAAA,IAAgB,SAASvS,GACtD,OAAO,GAAI0M,EAAAA,EAAAA,IAAK1M,EAAI,EACtB,G,+DCNW6S,G,UAA0BR,EAAAA,EAAAA,IAAa,SAASjR,GACzD,OAAQA,GAAI8P,EAAAA,EAAAA,IAAK9P,KAAOA,GAAI4K,EAAAA,EAAAA,IAAI5K,EAClC,KAEAyR,EAAwBD,QAASL,EAAAA,EAAAA,IAAgB,SAASvS,GACxD,OAAOA,CACT,G,wRCRO,SAAS8S,EAAmBnH,EAAQC,GACzC,MAAO,CAACD,EAAQC,EAClB,CAEAkH,EAAmBF,OAASE,C,wECFrB,SAASC,EAAYtV,EAAGC,GAC7B,IAAIgE,GAAKoK,EAAAA,EAAAA,IAAIpO,GAAI4O,GAAIR,EAAAA,EAAAA,IAAIrO,GAAKiE,EAC9B,MAAO,CAACA,GAAKsK,EAAAA,EAAAA,IAAIvO,GAAK6O,GAAGN,EAAAA,EAAAA,IAAItO,GAAK4O,EACpC,CAEAyG,EAAYH,QAASL,EAAAA,EAAAA,GAAgB1D,EAAAA,G,oICL9B,SAASmE,EAAYrH,EAAQC,GAClC,MAAO,CAACD,GAAQlF,EAAAA,EAAAA,KAAI3D,EAAAA,EAAAA,KAAK4L,EAAAA,GAAS9C,GAAO,IAC3C,CAEAoH,EAAYJ,OAAS,SAASnV,EAAGC,GAC/B,MAAO,CAACD,EAAG,GAAIoR,EAAAA,EAAAA,KAAKlI,EAAAA,EAAAA,IAAIjJ,IAAMgR,EAAAA,GAChC,C,6DCPO,SAASuE,EAAiBtH,EAAQC,GACvC,IAAIsH,EAAOtH,EAAMA,EAAKuH,EAAOD,EAAOA,EACpC,MAAO,CACLvH,GAAU,MAAS,QAAWuH,EAAOC,GAAoBA,GAAQ,QAAWD,EAAO,QAAWC,GAAhD,UAC9CvH,GAAO,SAAWsH,GAAQ,QAAWC,GAAoB,QAAWD,EAAtB,QAA6B,QAAWC,KAE1F,CAEAF,EAAiBL,OAAS,SAASnV,EAAGC,GACpC,IAAqB8Q,EAAjB5C,EAAMlO,EAAGU,EAAI,GACjB,EAAG,CACD,IAAI8U,EAAOtH,EAAMA,EAAKuH,EAAOD,EAAOA,EACpCtH,GAAO4C,GAAS5C,GAAO,SAAWsH,GAAQ,QAAWC,GAAoB,QAAWD,EAAtB,QAA6B,QAAWC,KAAUzV,IAC3G,SAAWwV,GAAQ,QAAeC,GAAwB,QAAeD,EAA/B,QAAsC,QAAW,GAAKC,IACvG,QAASjQ,EAAAA,EAAAA,IAAIsL,GAASC,EAAAA,MAAarQ,EAAI,GACvC,MAAO,CACLX,GAAK,OAAUyV,EAAOtH,EAAMA,IAAoBsH,GAAoBA,EAAOA,EAAOA,GAAQ,QAAW,QAAWA,GAAvD,SAApB,UACrCtH,EAEJ,C,wEClBO,SAASwH,EAAgB3V,EAAGC,GACjC,MAAO,EAACoO,EAAAA,EAAAA,IAAIpO,IAAKsO,EAAAA,EAAAA,IAAIvO,IAAIuO,EAAAA,EAAAA,IAAItO,GAC/B,CAEA0V,EAAgBR,QAASL,EAAAA,EAAAA,GAAgB7F,EAAAA,G,sECHpBZ,EAAAA,EAAAA,IAAI,GAAKD,EAAAA,G,wECDvB,SAASwH,EAAiB5V,EAAGC,GAClC,IAAIgE,GAAKoK,EAAAA,EAAAA,IAAIpO,GAAI4O,EAAI,GAAIR,EAAAA,EAAAA,IAAIrO,GAAKiE,EAClC,MAAO,CAACA,GAAKsK,EAAAA,EAAAA,IAAIvO,GAAK6O,GAAGN,EAAAA,EAAAA,IAAItO,GAAK4O,EACpC,CAEA+G,EAAiBT,QAASL,EAAAA,EAAAA,IAAgB,SAASvS,GACjD,OAAO,GAAI6O,EAAAA,EAAAA,IAAK7O,EAClB,G,6DCRO,SAASsT,EAAsB3H,EAAQC,GAC5C,MAAO,EAACnF,EAAAA,EAAAA,KAAI3D,EAAAA,EAAAA,KAAK4L,EAAAA,GAAS9C,GAAO,KAAMD,EACzC,CAEA2H,EAAsBV,OAAS,SAASnV,EAAGC,GACzC,MAAO,EAAEA,EAAG,GAAImR,EAAAA,EAAAA,KAAKlI,EAAAA,EAAAA,IAAIlJ,IAAMiR,EAAAA,GACjC,C,mDCNA,SAAS6E,EAAiB5H,EAAQC,GAChC,MAAO,CAACD,EAAS4C,EAAAA,GAAK5C,EAASJ,EAAAA,GAAMI,GAAU4C,EAAAA,GAAK5C,EAASJ,EAAAA,GAAMI,EAAQC,EAC7E,CAEA2H,EAAiBX,OAASW,C,qCCP1B,SAASC,EAAeC,EAAUzF,GAC5ByF,GAAYC,EAAmBC,eAAeF,EAAShD,OACzDiD,EAAmBD,EAAShD,MAAMgD,EAAUzF,EAEhD,C,gCAEA,IAAI4F,EAAmB,CACrBC,QAAS,SAASrD,EAAQxC,GACxBwF,EAAehD,EAAOiD,SAAUzF,EAClC,EACA8F,kBAAmB,SAAStD,EAAQxC,GAElC,IADA,IAAI+F,EAAWvD,EAAOuD,SAAU3V,GAAK,EAAG8D,EAAI6R,EAASlW,SAC5CO,EAAI8D,GAAGsR,EAAeO,EAAS3V,GAAGqV,SAAUzF,EACvD,GAGE0F,EAAqB,CACvBM,OAAQ,SAASxD,EAAQxC,GACvBA,EAAOxC,QACT,EACAyI,MAAO,SAASzD,EAAQxC,GACtBwC,EAASA,EAAOD,YAChBvC,EAAOlD,MAAM0F,EAAO,GAAIA,EAAO,GAAIA,EAAO,GAC5C,EACA0D,WAAY,SAAS1D,EAAQxC,GAE3B,IADA,IAAIuC,EAAcC,EAAOD,YAAanS,GAAK,EAAG8D,EAAIqO,EAAY1S,SACrDO,EAAI8D,GAAGsO,EAASD,EAAYnS,GAAI4P,EAAOlD,MAAM0F,EAAO,GAAIA,EAAO,GAAIA,EAAO,GACrF,EACA2D,WAAY,SAAS3D,EAAQxC,GAC3BoG,EAAW5D,EAAOD,YAAavC,EAAQ,EACzC,EACAqG,gBAAiB,SAAS7D,EAAQxC,GAEhC,IADA,IAAIuC,EAAcC,EAAOD,YAAanS,GAAK,EAAG8D,EAAIqO,EAAY1S,SACrDO,EAAI8D,GAAGkS,EAAW7D,EAAYnS,GAAI4P,EAAQ,EACrD,EACAsG,QAAS,SAAS9D,EAAQxC,GACxBuG,EAAc/D,EAAOD,YAAavC,EACpC,EACAwG,aAAc,SAAShE,EAAQxC,GAE7B,IADA,IAAIuC,EAAcC,EAAOD,YAAanS,GAAK,EAAG8D,EAAIqO,EAAY1S,SACrDO,EAAI8D,GAAGqS,EAAchE,EAAYnS,GAAI4P,EAChD,EACAyG,mBAAoB,SAASjE,EAAQxC,GAEnC,IADA,IAAI0G,EAAalE,EAAOkE,WAAYtW,GAAK,EAAG8D,EAAIwS,EAAW7W,SAClDO,EAAI8D,GAAGsR,EAAekB,EAAWtW,GAAI4P,EAChD,GAGF,SAASoG,EAAW7D,EAAavC,EAAQ2G,GACvC,IAA6CC,EAAzCxW,GAAK,EAAG8D,EAAIqO,EAAY1S,OAAS8W,EAErC,IADA3G,EAAOhD,cACE5M,EAAI8D,GAAG0S,EAAarE,EAAYnS,GAAI4P,EAAOlD,MAAM8J,EAAW,GAAIA,EAAW,GAAIA,EAAW,IACnG5G,EAAO/C,SACT,CAEA,SAASsJ,EAAchE,EAAavC,GAClC,IAAI5P,GAAK,EAAG8D,EAAIqO,EAAY1S,OAE5B,IADAmQ,EAAO9C,iBACE9M,EAAI8D,GAAGkS,EAAW7D,EAAYnS,GAAI4P,EAAQ,GACnDA,EAAO3C,YACT,CAEe,WAASmF,EAAQxC,GAC1BwC,GAAUoD,EAAiBD,eAAenD,EAAOC,MACnDmD,EAAiBpD,EAAOC,MAAMD,EAAQxC,GAEtCwF,EAAehD,EAAQxC,EAE3B,C,qCC9DO,SAAS6G,EAAYC,GAC1B,OAAO,SAAS9G,GACd,IAAIzH,EAAI,IAAIwO,EACZ,IAAK,IAAIC,KAAOF,EAASvO,EAAEyO,GAAOF,EAAQE,GAE1C,OADAzO,EAAEyH,OAASA,EACJzH,CACT,CACF,CAEA,SAASwO,IAAmB,C,gCAE5BA,EAAgBvN,UAAY,CAC1BuC,YAAagL,EACbjK,MAAO,SAASrN,EAAGC,GAAKoH,KAAKkJ,OAAOlD,MAAMrN,EAAGC,EAAI,EACjD8N,OAAQ,WAAa1G,KAAKkJ,OAAOxC,QAAU,EAC3CR,UAAW,WAAalG,KAAKkJ,OAAOhD,WAAa,EACjDC,QAAS,WAAanG,KAAKkJ,OAAO/C,SAAW,EAC7CC,aAAc,WAAapG,KAAKkJ,OAAO9C,cAAgB,EACvDG,WAAY,WAAavG,KAAKkJ,OAAO3C,YAAc,E,gCCxBrD,SAAS4J,IACPnQ,KAAKoQ,EAAI,IACX,CAEO,SAASC,EAAaC,GAC3BA,EAAKC,EACLD,EAAKE,EACLF,EAAKG,EACLH,EAAKI,EACLJ,EAAKK,EACLL,EAAKM,EAAI,IACX,CAsLA,SAASC,EAAmBC,EAAMR,GAChC,IAAIxV,EAAIwV,EACJhV,EAAIgV,EAAKI,EACTK,EAASjW,EAAEyV,EAEXQ,EACEA,EAAON,IAAM3V,EAAGiW,EAAON,EAAInV,EAC1ByV,EAAOL,EAAIpV,EAEhBwV,EAAKV,EAAI9U,EAGXA,EAAEiV,EAAIQ,EACNjW,EAAEyV,EAAIjV,EACNR,EAAE4V,EAAIpV,EAAEmV,EACJ3V,EAAE4V,IAAG5V,EAAE4V,EAAEH,EAAIzV,GACjBQ,EAAEmV,EAAI3V,CACR,CAEA,SAASkW,EAAoBF,EAAMR,GACjC,IAAIxV,EAAIwV,EACJhV,EAAIgV,EAAKG,EACTM,EAASjW,EAAEyV,EAEXQ,EACEA,EAAON,IAAM3V,EAAGiW,EAAON,EAAInV,EAC1ByV,EAAOL,EAAIpV,EAEhBwV,EAAKV,EAAI9U,EAGXA,EAAEiV,EAAIQ,EACNjW,EAAEyV,EAAIjV,EACNR,EAAE2V,EAAInV,EAAEoV,EACJ5V,EAAE2V,IAAG3V,EAAE2V,EAAEF,EAAIzV,GACjBQ,EAAEoV,EAAI5V,CACR,CAEA,SAASmW,EAAcX,GACrB,KAAOA,EAAKG,GAAGH,EAAOA,EAAKG,EAC3B,OAAOH,CACT,CA7NAH,EAAazN,UAAY,CACvBuC,YAAakL,EAEblN,OAAQ,SAASiO,EAAOZ,GACtB,IAAIS,EAAQI,EAASC,EAErB,GAAIF,EAAO,CAKT,GAJAZ,EAAKK,EAAIO,EACTZ,EAAKM,EAAIM,EAAMN,EACXM,EAAMN,IAAGM,EAAMN,EAAED,EAAIL,GACzBY,EAAMN,EAAIN,EACNY,EAAMR,EAAG,CAEX,IADAQ,EAAQA,EAAMR,EACPQ,EAAMT,GAAGS,EAAQA,EAAMT,EAC9BS,EAAMT,EAAIH,CACZ,MACEY,EAAMR,EAAIJ,EAEZS,EAASG,CACX,MAAWlR,KAAKoQ,GACdc,EAAQD,EAAcjR,KAAKoQ,GAC3BE,EAAKK,EAAI,KACTL,EAAKM,EAAIM,EACTA,EAAMP,EAAIO,EAAMT,EAAIH,EACpBS,EAASG,IAETZ,EAAKK,EAAIL,EAAKM,EAAI,KAClB5Q,KAAKoQ,EAAIE,EACTS,EAAS,MAOX,IALAT,EAAKG,EAAIH,EAAKI,EAAI,KAClBJ,EAAKC,EAAIQ,EACTT,EAAKE,GAAI,EAETU,EAAQZ,EACDS,GAAUA,EAAOP,GAElBO,KADJI,EAAUJ,EAAOR,GACME,GACrBW,EAAQD,EAAQT,IACHU,EAAMZ,GACjBO,EAAOP,EAAIY,EAAMZ,GAAI,EACrBW,EAAQX,GAAI,EACZU,EAAQC,IAEJD,IAAUH,EAAOL,IACnBG,EAAmB7Q,KAAM+Q,GAEzBA,GADAG,EAAQH,GACOR,GAEjBQ,EAAOP,GAAI,EACXW,EAAQX,GAAI,EACZQ,EAAoBhR,KAAMmR,KAG5BC,EAAQD,EAAQV,IACHW,EAAMZ,GACjBO,EAAOP,EAAIY,EAAMZ,GAAI,EACrBW,EAAQX,GAAI,EACZU,EAAQC,IAEJD,IAAUH,EAAON,IACnBO,EAAoBhR,KAAM+Q,GAE1BA,GADAG,EAAQH,GACOR,GAEjBQ,EAAOP,GAAI,EACXW,EAAQX,GAAI,EACZK,EAAmB7Q,KAAMmR,IAG7BJ,EAASG,EAAMX,EAEjBvQ,KAAKoQ,EAAEI,GAAI,CACb,EAEAlN,OAAQ,SAASgN,GACXA,EAAKM,IAAGN,EAAKM,EAAED,EAAIL,EAAKK,GACxBL,EAAKK,IAAGL,EAAKK,EAAEC,EAAIN,EAAKM,GAC5BN,EAAKM,EAAIN,EAAKK,EAAI,KAElB,IACIU,EAGAjY,EACAkY,EALAP,EAAST,EAAKC,EAEdgB,EAAOjB,EAAKG,EACZe,EAAQlB,EAAKI,EAsCjB,GAhCKtX,EAFAmY,EACKC,EACEP,EAAcO,GADFD,EADNC,EAIdT,EACEA,EAAON,IAAMH,EAAMS,EAAON,EAAIrX,EAC7B2X,EAAOL,EAAItX,EAEhB4G,KAAKoQ,EAAIhX,EAGPmY,GAAQC,GACVF,EAAMlY,EAAKoX,EACXpX,EAAKoX,EAAIF,EAAKE,EACdpX,EAAKqX,EAAIc,EACTA,EAAKhB,EAAInX,EACLA,IAASoY,GACXT,EAAS3X,EAAKmX,EACdnX,EAAKmX,EAAID,EAAKC,EACdD,EAAOlX,EAAKsX,EACZK,EAAON,EAAIH,EACXlX,EAAKsX,EAAIc,EACTA,EAAMjB,EAAInX,IAEVA,EAAKmX,EAAIQ,EACTA,EAAS3X,EACTkX,EAAOlX,EAAKsX,KAGdY,EAAMhB,EAAKE,EACXF,EAAOlX,GAGLkX,IAAMA,EAAKC,EAAIQ,IACfO,EACJ,GAAIhB,GAAQA,EAAKE,EAAKF,EAAKE,GAAI,MAA/B,CAEA,EAAG,CACD,GAAIF,IAAStQ,KAAKoQ,EAAG,MACrB,GAAIE,IAASS,EAAON,GAQlB,IAPAY,EAAUN,EAAOL,GACLF,IACVa,EAAQb,GAAI,EACZO,EAAOP,GAAI,EACXK,EAAmB7Q,KAAM+Q,GACzBM,EAAUN,EAAOL,GAEdW,EAAQZ,GAAKY,EAAQZ,EAAED,GACpBa,EAAQX,GAAKW,EAAQX,EAAEF,EAAI,CAC5Ba,EAAQX,GAAMW,EAAQX,EAAEF,IAC3Ba,EAAQZ,EAAED,GAAI,EACda,EAAQb,GAAI,EACZQ,EAAoBhR,KAAMqR,GAC1BA,EAAUN,EAAOL,GAEnBW,EAAQb,EAAIO,EAAOP,EACnBO,EAAOP,EAAIa,EAAQX,EAAEF,GAAI,EACzBK,EAAmB7Q,KAAM+Q,GACzBT,EAAOtQ,KAAKoQ,EACZ,KACF,OASA,IAPAiB,EAAUN,EAAON,GACLD,IACVa,EAAQb,GAAI,EACZO,EAAOP,GAAI,EACXQ,EAAoBhR,KAAM+Q,GAC1BM,EAAUN,EAAON,GAEdY,EAAQZ,GAAKY,EAAQZ,EAAED,GACtBa,EAAQX,GAAKW,EAAQX,EAAEF,EAAI,CAC1Ba,EAAQZ,GAAMY,EAAQZ,EAAED,IAC3Ba,EAAQX,EAAEF,GAAI,EACda,EAAQb,GAAI,EACZK,EAAmB7Q,KAAMqR,GACzBA,EAAUN,EAAON,GAEnBY,EAAQb,EAAIO,EAAOP,EACnBO,EAAOP,EAAIa,EAAQZ,EAAED,GAAI,EACzBQ,EAAoBhR,KAAM+Q,GAC1BT,EAAOtQ,KAAKoQ,EACZ,KACF,CAEFiB,EAAQb,GAAI,EACZF,EAAOS,EACPA,EAASA,EAAOR,CAClB,QAAUD,EAAKE,GAEXF,IAAMA,EAAKE,GAAI,EAtD2B,CAuDhD,GA8CF,QC1OO,SAASiB,EAAWF,EAAMC,EAAOE,EAAIC,GAC1C,IAAIC,EAAO,CAAC,KAAM,MACdC,EAAQC,EAAMnY,KAAKiY,GAAQ,EAO/B,OANAA,EAAKL,KAAOA,EACZK,EAAKJ,MAAQA,EACTE,GAAIK,EAAWH,EAAML,EAAMC,EAAOE,GAClCC,GAAII,EAAWH,EAAMJ,EAAOD,EAAMI,GACtCK,EAAMT,EAAKM,OAAOI,UAAUtY,KAAKkY,GACjCG,EAAMR,EAAMK,OAAOI,UAAUtY,KAAKkY,GAC3BD,CACT,CAEO,SAASM,EAAiBX,EAAMG,EAAIC,GACzC,IAAIC,EAAO,CAACF,EAAIC,GAEhB,OADAC,EAAKL,KAAOA,EACLK,CACT,CAEO,SAASG,EAAWH,EAAML,EAAMC,EAAOW,GACvCP,EAAK,IAAOA,EAAK,GAIXA,EAAKL,OAASC,EACvBI,EAAK,GAAKO,EAEVP,EAAK,GAAKO,GANVP,EAAK,GAAKO,EACVP,EAAKL,KAAOA,EACZK,EAAKJ,MAAQA,EAMjB,CAGA,SAASY,EAASR,EAAM/U,EAAIC,EAAIC,EAAIC,GAClC,IAUI8B,EAVA1C,EAAIwV,EAAK,GACTvV,EAAIuV,EAAK,GACTrV,EAAKH,EAAE,GACPM,EAAKN,EAAE,GAGPiW,EAAK,EACLC,EAAK,EACLC,EAJKlW,EAAE,GAIGE,EACViW,EAJKnW,EAAE,GAIGK,EAId,GADAoC,EAAIjC,EAAKN,EACJgW,KAAMzT,EAAI,GAAf,CAEA,GADAA,GAAKyT,EACDA,EAAK,EAAG,CACV,GAAIzT,EAAIuT,EAAI,OACRvT,EAAIwT,IAAIA,EAAKxT,EACnB,MAAO,GAAIyT,EAAK,EAAG,CACjB,GAAIzT,EAAIwT,EAAI,OACRxT,EAAIuT,IAAIA,EAAKvT,EACnB,CAGA,GADAA,EAAI/B,EAAKR,EACJgW,KAAMzT,EAAI,GAAf,CAEA,GADAA,GAAKyT,EACDA,EAAK,EAAG,CACV,GAAIzT,EAAIwT,EAAI,OACRxT,EAAIuT,IAAIA,EAAKvT,EACnB,MAAO,GAAIyT,EAAK,EAAG,CACjB,GAAIzT,EAAIuT,EAAI,OACRvT,EAAIwT,IAAIA,EAAKxT,EACnB,CAGA,GADAA,EAAIhC,EAAKJ,EACJ8V,KAAM1T,EAAI,GAAf,CAEA,GADAA,GAAK0T,EACDA,EAAK,EAAG,CACV,GAAI1T,EAAIuT,EAAI,OACRvT,EAAIwT,IAAIA,EAAKxT,EACnB,MAAO,GAAI0T,EAAK,EAAG,CACjB,GAAI1T,EAAIwT,EAAI,OACRxT,EAAIuT,IAAIA,EAAKvT,EACnB,CAGA,GADAA,EAAI9B,EAAKN,EACJ8V,KAAM1T,EAAI,GAAf,CAEA,GADAA,GAAK0T,EACDA,EAAK,EAAG,CACV,GAAI1T,EAAIwT,EAAI,OACRxT,EAAIuT,IAAIA,EAAKvT,EACnB,MAAO,GAAI0T,EAAK,EAAG,CACjB,GAAI1T,EAAIuT,EAAI,OACRvT,EAAIwT,IAAIA,EAAKxT,EACnB,CAEA,QAAMuT,EAAK,GAAQC,EAAK,KAEpBD,EAAK,IAAGT,EAAK,GAAK,CAACrV,EAAK8V,EAAKE,EAAI7V,EAAK2V,EAAKG,IAC3CF,EAAK,IAAGV,EAAK,GAAK,CAACrV,EAAK+V,EAAKC,EAAI7V,EAAK4V,EAAKE,KACxC,EAdiB,CAXA,CAXA,CAXA,CAgD1B,CAEA,SAASC,EAAYb,EAAM/U,EAAIC,EAAIC,EAAIC,GACrC,IAAI2U,EAAKC,EAAK,GACd,GAAID,EAAI,OAAO,EAEf,IASIe,EACAC,EAVAjB,EAAKE,EAAK,GACVL,EAAOK,EAAKL,KACZC,EAAQI,EAAKJ,MACboB,EAAKrB,EAAK,GACVsB,EAAKtB,EAAK,GACVuB,EAAKtB,EAAM,GACXuB,EAAKvB,EAAM,GACXwB,GAAMJ,EAAKE,GAAM,EACjBG,GAAMJ,EAAKE,GAAM,EAIrB,GAAIA,IAAOF,EAAI,CACb,GAAIG,EAAKnW,GAAMmW,GAAMjW,EAAI,OACzB,GAAI6V,EAAKE,EAAI,CACX,GAAKpB,GACA,GAAIA,EAAG,IAAM1U,EAAI,YADb0U,EAAK,CAACsB,EAAIlW,GAEnB6U,EAAK,CAACqB,EAAIhW,EACZ,KAAO,CACL,GAAK0U,GACA,GAAIA,EAAG,GAAK5U,EAAI,YADZ4U,EAAK,CAACsB,EAAIhW,GAEnB2U,EAAK,CAACqB,EAAIlW,EACZ,CACF,MAGE,GADA6V,EAAKM,GADLP,GAAME,EAAKE,IAAOC,EAAKF,IACRG,EACXN,GAAM,GAAKA,EAAK,EAClB,GAAIE,EAAKE,EAAI,CACX,GAAKpB,GACA,GAAIA,EAAG,IAAM1U,EAAI,YADb0U,EAAK,EAAE5U,EAAK6V,GAAMD,EAAI5V,GAE/B6U,EAAK,EAAE3U,EAAK2V,GAAMD,EAAI1V,EACxB,KAAO,CACL,GAAK0U,GACA,GAAIA,EAAG,GAAK5U,EAAI,YADZ4U,EAAK,EAAE1U,EAAK2V,GAAMD,EAAI1V,GAE/B2U,EAAK,EAAE7U,EAAK6V,GAAMD,EAAI5V,EACxB,MAEA,GAAI+V,EAAKE,EAAI,CACX,GAAKrB,GACA,GAAIA,EAAG,IAAM3U,EAAI,YADb2U,EAAK,CAAC7U,EAAI6V,EAAK7V,EAAK8V,GAE7BhB,EAAK,CAAC5U,EAAI2V,EAAK3V,EAAK4V,EACtB,KAAO,CACL,GAAKjB,GACA,GAAIA,EAAG,GAAK7U,EAAI,YADZ6U,EAAK,CAAC3U,EAAI2V,EAAK3V,EAAK4V,GAE7BhB,EAAK,CAAC9U,EAAI6V,EAAK7V,EAAK8V,EACtB,CAMJ,OAFAf,EAAK,GAAKF,EACVE,EAAK,GAAKD,GACH,CACT,CC/IA,SAASuB,EAAkBC,EAAMvB,GAC/B,IAAIwB,EAAOD,EAAKC,KACZC,EAAKzB,EAAKL,KACV+B,EAAK1B,EAAKJ,MAEd,OADI4B,IAASE,IAAIA,EAAKD,EAAIA,EAAKD,GAC3BE,EAAWrZ,KAAKwN,MAAM6L,EAAG,GAAKD,EAAG,GAAIC,EAAG,GAAKD,EAAG,KAChDD,IAASC,GAAIA,EAAKzB,EAAK,GAAI0B,EAAK1B,EAAK,KACpCyB,EAAKzB,EAAK,GAAI0B,EAAK1B,EAAK,IACtB3X,KAAKwN,MAAM4L,EAAG,GAAKC,EAAG,GAAIA,EAAG,GAAKD,EAAG,IAC9C,CAEO,SAASE,EAAkBJ,EAAMvB,GACtC,OAAOA,IAAOA,EAAKL,OAAS4B,EAAKC,MACnC,CAEO,SAASI,EAAgBL,EAAMvB,GACpC,OAAOA,IAAOA,EAAKL,OAAS4B,EAAKC,MACnC,CCxBA,IAEWK,EAFPC,EAAa,GAIjB,SAASC,IACPtD,EAAarQ,MACbA,KAAKrH,EACLqH,KAAKpH,EACLoH,KAAKoN,IACLpN,KAAKoT,KACLpT,KAAKpD,GAAK,IACZ,CAEO,SAASgX,EAAaxG,GAC3B,IAAIyG,EAAOzG,EAAIuD,EACXmD,EAAO1G,EAAIwD,EAEf,GAAKiD,GAASC,EAAd,CAEA,IAAIC,EAAQF,EAAKT,KACbY,EAAQ5G,EAAIgG,KACZa,EAAQH,EAAKV,KAEjB,GAAIW,IAAUE,EAAd,CAEA,IAAIzX,EAAKwX,EAAM,GACXrX,EAAKqX,EAAM,GACXzX,EAAKwX,EAAM,GAAKvX,EAChBE,EAAKqX,EAAM,GAAKpX,EAChBF,EAAKwX,EAAM,GAAKzX,EAChBI,EAAKqX,EAAM,GAAKtX,EAEhBmE,EAAI,GAAKvE,EAAKK,EAAKF,EAAKD,GAC5B,KAAIqE,IAAMoT,GAAV,CAEA,IAAIC,EAAK5X,EAAKA,EAAKG,EAAKA,EACpB0X,EAAK3X,EAAKA,EAAKG,EAAKA,EACpBjE,GAAKiE,EAAKuX,EAAKzX,EAAK0X,GAAMtT,EAC1BlI,GAAK2D,EAAK6X,EAAK3X,EAAK0X,GAAMrT,EAE1B0L,EAASkH,EAAWjR,OAAS,IAAIkR,EACrCnH,EAAOY,IAAMA,EACbZ,EAAO4G,KAAOY,EACdxH,EAAO7T,EAAIA,EAAI6D,EACfgQ,EAAO5T,GAAK4T,EAAO5P,GAAKhE,EAAI+D,GAAM1C,KAAK8H,KAAKpJ,EAAIA,EAAIC,EAAIA,GAExDwU,EAAIZ,OAASA,EAKb,IAHA,IAAI6H,EAAS,KACT/D,EAAOgE,EAAQlE,EAEZE,GACL,GAAI9D,EAAO5T,EAAI0X,EAAK1X,GAAM4T,EAAO5T,IAAM0X,EAAK1X,GAAK4T,EAAO7T,GAAK2X,EAAK3X,EAAI,CACpE,IAAI2X,EAAKG,EACJ,CAAE4D,EAAS/D,EAAKK,EAAG,KAAO,CADnBL,EAAOA,EAAKG,CAE1B,KAAO,CACL,IAAIH,EAAKI,EACJ,CAAE2D,EAAS/D,EAAM,KAAO,CADjBA,EAAOA,EAAKI,CAE1B,CAGF4D,EAAQrR,OAAOoR,EAAQ7H,GAClB6H,IAAQZ,EAAcjH,EA7BD,CAVC,CAND,CA8C5B,CAEO,SAAS+H,EAAanH,GAC3B,IAAIZ,EAASY,EAAIZ,OACbA,IACGA,EAAOmE,IAAG8C,EAAcjH,EAAOoE,GACpC0D,EAAQhR,OAAOkJ,GACfkH,EAAW/Z,KAAK6S,GAChB6D,EAAa7D,GACbY,EAAIZ,OAAS,KAEjB,CCvEA,IAAIgI,EAAY,GAEhB,SAASC,IACPpE,EAAarQ,MACbA,KAAK4R,KACL5R,KAAKoT,KACLpT,KAAKwM,OAAS,IAChB,CAEA,SAASkI,EAAYtB,GACnB,IAAIuB,EAAQH,EAAU/R,OAAS,IAAIgS,EAEnC,OADAE,EAAMvB,KAAOA,EACNuB,CACT,CAEA,SAASC,EAAYD,GACnBJ,EAAaI,GACbE,EAAQvR,OAAOqR,GACfH,EAAU7a,KAAKgb,GACftE,EAAasE,EACf,CAEO,SAASG,EAAYH,GAC1B,IAAInI,EAASmI,EAAMnI,OACf7T,EAAI6T,EAAO7T,EACXC,EAAI4T,EAAO5P,GACXuV,EAAS,CAACxZ,EAAGC,GACbmc,EAAWJ,EAAMhE,EACjBvX,EAAOub,EAAM/D,EACboE,EAAe,CAACL,GAEpBC,EAAYD,GAGZ,IADA,IAAId,EAAOkB,EACJlB,EAAKrH,QACLvS,KAAKmE,IAAIzF,EAAIkb,EAAKrH,OAAO7T,GAAKgR,GAC9B1P,KAAKmE,IAAIxF,EAAIib,EAAKrH,OAAO5P,IAAM+M,GACpCoL,EAAWlB,EAAKlD,EAChBqE,EAAaC,QAAQpB,GACrBe,EAAYf,GACZA,EAAOkB,EAGTC,EAAaC,QAAQpB,GACrBU,EAAaV,GAGb,IADA,IAAIC,EAAO1a,EACJ0a,EAAKtH,QACLvS,KAAKmE,IAAIzF,EAAImb,EAAKtH,OAAO7T,GAAKgR,GAC9B1P,KAAKmE,IAAIxF,EAAIkb,EAAKtH,OAAO5P,IAAM+M,GACpCvQ,EAAO0a,EAAKlD,EACZoE,EAAarb,KAAKma,GAClBc,EAAYd,GACZA,EAAO1a,EAGT4b,EAAarb,KAAKma,GAClBS,EAAaT,GAEb,IACIoB,EADAC,EAAQH,EAAajc,OAEzB,IAAKmc,EAAO,EAAGA,EAAOC,IAASD,EAC7BpB,EAAOkB,EAAaE,GACpBrB,EAAOmB,EAAaE,EAAO,GAC3BnD,EAAW+B,EAAKlC,KAAMiC,EAAKT,KAAMU,EAAKV,KAAMjB,GAG9C0B,EAAOmB,EAAa,IACpBlB,EAAOkB,EAAaG,EAAQ,IACvBvD,KAAOH,EAAWoC,EAAKT,KAAMU,EAAKV,KAAM,KAAMjB,GAEnDyB,EAAaC,GACbD,EAAaE,EACf,CAEO,SAASsB,EAAShC,GASvB,IARA,IAEIS,EACAC,EACAuB,EACAC,EALA3c,EAAIya,EAAK,GACTmC,EAAYnC,EAAK,GAKjB9C,EAAOuE,EAAQzE,EAEZE,GAEL,IADA+E,EAAMG,EAAelF,EAAMiF,GAAa5c,GAC9BgR,EAAS2G,EAAOA,EAAKG,MAAQ,CAErC,MADA6E,EAAM3c,EAAI8c,EAAgBnF,EAAMiF,IACtB5L,GAMH,CACD0L,GAAO1L,GACTkK,EAAOvD,EAAKK,EACZmD,EAAOxD,GACEgF,GAAO3L,GAChBkK,EAAOvD,EACPwD,EAAOxD,EAAKM,GAEZiD,EAAOC,EAAOxD,EAEhB,KACF,CAhBE,IAAKA,EAAKI,EAAG,CACXmD,EAAOvD,EACP,KACF,CACAA,EAAOA,EAAKI,CAahB,EF7GG,SAAoB0C,GAClBpB,EAAMoB,EAAKvB,OAAS,CACzBuB,KAAMA,EACNnB,UAAW,GAEf,CE2GEyD,CAAWtC,GACX,IAAIuC,EAASjB,EAAYtB,GAGzB,GAFAyB,EAAQ5R,OAAO4Q,EAAM8B,GAEhB9B,GAASC,EAAd,CAEA,GAAID,IAASC,EAOX,OANAS,EAAaV,GACbC,EAAOY,EAAYb,EAAKT,MACxByB,EAAQ5R,OAAO0S,EAAQ7B,GACvB6B,EAAO/D,KAAOkC,EAAKlC,KAAOH,EAAWoC,EAAKT,KAAMuC,EAAOvC,MACvDQ,EAAaC,QACbD,EAAaE,GAIf,GAAKA,EAAL,CAMAS,EAAaV,GACbU,EAAaT,GAEb,IAAIC,EAAQF,EAAKT,KACb7W,EAAKwX,EAAM,GACXrX,EAAKqX,EAAM,GACXvX,EAAK4W,EAAK,GAAK7W,EACfI,EAAKyW,EAAK,GAAK1W,EACfuX,EAAQH,EAAKV,KACb3W,EAAKwX,EAAM,GAAK1X,EAChBK,EAAKqX,EAAM,GAAKvX,EAChBoE,EAAI,GAAKtE,EAAKI,EAAKD,EAAKF,GACxBmZ,EAAKpZ,EAAKA,EAAKG,EAAKA,EACpByX,EAAK3X,EAAKA,EAAKG,EAAKA,EACpBuV,EAAS,EAAEvV,EAAKgZ,EAAKjZ,EAAKyX,GAAMtT,EAAIvE,GAAKC,EAAK4X,EAAK3X,EAAKmZ,GAAM9U,EAAIpE,GAEtEqV,EAAW+B,EAAKlC,KAAMmC,EAAOE,EAAO9B,GACpCwD,EAAO/D,KAAOH,EAAWsC,EAAOX,EAAM,KAAMjB,GAC5C2B,EAAKlC,KAAOH,EAAW2B,EAAMa,EAAO,KAAM9B,GAC1CyB,EAAaC,GACbD,EAAaE,EAvBb,MAFE6B,EAAO/D,KAAOH,EAAWoC,EAAKT,KAAMuC,EAAOvC,KAbnB,CAuC5B,CAEA,SAASoC,EAAepI,EAAKmI,GAC3B,IAAInC,EAAOhG,EAAIgG,KACXyC,EAAQzC,EAAK,GACb0C,EAAQ1C,EAAK,GACb2C,EAAOD,EAAQP,EAEnB,IAAKQ,EAAM,OAAOF,EAElB,IAAIhC,EAAOzG,EAAIuD,EACf,IAAKkD,EAAM,OAAQ9V,IAGnB,IAAIiY,GADJ5C,EAAOS,EAAKT,MACK,GACb6C,EAAQ7C,EAAK,GACb8C,EAAQD,EAAQV,EAEpB,IAAKW,EAAO,OAAOF,EAEnB,IAAIG,EAAKH,EAAQH,EACbO,EAAO,EAAIL,EAAO,EAAIG,EACtB7Z,EAAI8Z,EAAKD,EAEb,OAAIE,IAAe/Z,EAAIpC,KAAK8H,KAAK1F,EAAIA,EAAI,EAAI+Z,GAAQD,EAAKA,IAAO,EAAID,GAASD,EAAQC,EAAQ,EAAIJ,EAAQC,EAAO,KAAOK,EAAOP,GAEvHA,EAAQG,GAAS,CAC3B,CAEA,SAASP,EAAgBrI,EAAKmI,GAC5B,IAAIzB,EAAO1G,EAAIwD,EACf,GAAIkD,EAAM,OAAO0B,EAAe1B,EAAMyB,GACtC,IAAInC,EAAOhG,EAAIgG,KACf,OAAOA,EAAK,KAAOmC,EAAYnC,EAAK,GAAKrV,GAC3C,CC1LO,IAEI8W,EACA7C,EACAsC,EACAxC,EALAnI,EAAU,KACVuK,EAAW,MAUtB,SAASmC,EAAcja,EAAGC,GACxB,OAAOA,EAAE,GAAKD,EAAE,IACTC,EAAE,GAAKD,EAAE,EAClB,CAEe,SAASka,EAAQC,EAAOC,GACrC,IACI7d,EACAC,EACA4T,EAHA4G,EAAOmD,EAAM1c,KAAKwc,GAAe5T,MAUrC,IALAqP,EAAQ,GACRE,EAAQ,IAAIxN,MAAM+R,EAAMxd,QACxB8b,EAAU,IAAI1E,EACdmE,EAAU,IAAInE,IAIZ,GADA3D,EAASiH,EACLL,KAAU5G,GAAU4G,EAAK,GAAK5G,EAAO5T,GAAMwa,EAAK,KAAO5G,EAAO5T,GAAKwa,EAAK,GAAK5G,EAAO7T,GAClFya,EAAK,KAAOza,GAAKya,EAAK,KAAOxa,IAC/Bwc,EAAShC,GACTza,EAAIya,EAAK,GAAIxa,EAAIwa,EAAK,IAExBA,EAAOmD,EAAM9T,UACR,KAAI+J,EAGT,MAFAsI,EAAYtI,EAAOY,IAGrB,CAKF,GHrBK,WACL,IAAK,IAA6B+F,EAAMlB,EAAW/R,EAAGvC,EAA7CrE,EAAI,EAAG8D,EAAI4U,EAAMjZ,OAA+BO,EAAI8D,IAAK9D,EAChE,IAAK6Z,EAAOnB,EAAM1Y,MAAQqE,GAAKsU,EAAYkB,EAAKlB,WAAWlZ,QAAS,CAClE,IAAI8Y,EAAQ,IAAIrN,MAAM7G,GAClB4G,EAAQ,IAAIC,MAAM7G,GACtB,IAAKuC,EAAI,EAAGA,EAAIvC,IAAKuC,EAAG2R,EAAM3R,GAAKA,EAAGqE,EAAMrE,GAAKgT,EAAkBC,EAAMrB,EAAMG,EAAU/R,KAEzF,IADA2R,EAAMhY,MAAK,SAASP,EAAG4G,GAAK,OAAOqE,EAAMrE,GAAKqE,EAAMjL,EAAI,IACnD4G,EAAI,EAAGA,EAAIvC,IAAKuC,EAAGqE,EAAMrE,GAAK+R,EAAUJ,EAAM3R,IACnD,IAAKA,EAAI,EAAGA,EAAIvC,IAAKuC,EAAG+R,EAAU/R,GAAKqE,EAAMrE,EAC/C,CAEJ,CGQEuW,GAEID,EAAQ,CACV,IAAI3Z,GAAM2Z,EAAO,GAAG,GAChB1Z,GAAM0Z,EAAO,GAAG,GAChBzZ,GAAMyZ,EAAO,GAAG,GAChBxZ,GAAMwZ,EAAO,GAAG,IJqGjB,SAAmB3Z,EAAIC,EAAIC,EAAIC,GAIpC,IAHA,IACI4U,EADAtY,EAAIwY,EAAM/Y,OAGPO,KACAmZ,EAAYb,EAAOE,EAAMxY,GAAIuD,EAAIC,EAAIC,EAAIC,IACtCoV,EAASR,EAAM/U,EAAIC,EAAIC,EAAIC,KAC1B/C,KAAKmE,IAAIwT,EAAK,GAAG,GAAKA,EAAK,GAAG,IAAMjI,GAClC1P,KAAKmE,IAAIwT,EAAK,GAAG,GAAKA,EAAK,GAAG,IAAMjI,WACtCmI,EAAMxY,EAGnB,CIhHIod,CAAU7Z,EAAIC,EAAIC,EAAIC,GHbnB,SAAmBH,EAAIC,EAAIC,EAAIC,GACpC,IACI2Z,EACAxD,EACAC,EACAwD,EACA3E,EACA4E,EACAzc,EACA0c,EACAC,EACA1c,EACA2c,EACAC,EAZAC,EAASlF,EAAMjZ,OAafoe,GAAQ,EAEZ,IAAKR,EAAQ,EAAGA,EAAQO,IAAUP,EAChC,GAAIxD,EAAOnB,EAAM2E,GAAQ,CAMvB,IALAvD,EAAOD,EAAKC,KAEZwD,GADA3E,EAAYkB,EAAKlB,WACKlZ,OAGf6d,KACA9E,EAAMG,EAAU2E,KACnB3E,EAAU1O,OAAOqT,EAAW,GAMhC,IADAA,EAAY,EAAGC,EAAa5E,EAAUlZ,OAC/B6d,EAAYC,GACyCG,GAA1D3c,EAAMmZ,EAAgBL,EAAMrB,EAAMG,EAAU2E,MAAyB,GAAIK,EAAO5c,EAAI,GACPyc,GAA7E1c,EAAQmZ,EAAkBJ,EAAMrB,EAAMG,IAAY2E,EAAYC,MAA8B,GAAIE,EAAS3c,EAAM,IAC3GH,KAAKmE,IAAI4Y,EAAOF,GAAUnN,GAAW1P,KAAKmE,IAAI6Y,EAAOF,GAAUpN,KACjEsI,EAAU1O,OAAOqT,EAAW,EAAG9E,EAAMnY,KAAKuY,EAAiBkB,EAAM/Y,EAC7DJ,KAAKmE,IAAI4Y,EAAOna,GAAM8M,GAAW3M,EAAKia,EAAOtN,EAAU,CAAC9M,EAAI5C,KAAKmE,IAAI0Y,EAASja,GAAM8M,EAAUoN,EAAS/Z,GACrG/C,KAAKmE,IAAI6Y,EAAOja,GAAM2M,GAAW5M,EAAKia,EAAOrN,EAAU,CAAC1P,KAAKmE,IAAI2Y,EAAS/Z,GAAM2M,EAAUmN,EAAS/Z,EAAIC,GACvG/C,KAAKmE,IAAI4Y,EAAOja,GAAM4M,GAAWsN,EAAOna,EAAK6M,EAAU,CAAC5M,EAAI9C,KAAKmE,IAAI0Y,EAAS/Z,GAAM4M,EAAUoN,EAASja,GACvG7C,KAAKmE,IAAI6Y,EAAOna,GAAM6M,GAAWqN,EAAOna,EAAK8M,EAAU,CAAC1P,KAAKmE,IAAI2Y,EAASja,GAAM6M,EAAUmN,EAASja,EAAIC,GACvG,OAAS,KACb+Z,GAIFA,IAAYM,GAAQ,EAC1B,CAKF,GAAIA,EAAO,CACT,IAAI5E,EAAIC,EAAI4E,EAAIC,EAAKtZ,IAErB,IAAK4Y,EAAQ,EAAGQ,EAAQ,KAAMR,EAAQO,IAAUP,GAC1CxD,EAAOnB,EAAM2E,MAIfS,GAFA7E,GADAa,EAAOD,EAAKC,MACF,GAAKvW,GAEL0V,GADVC,EAAKY,EAAK,GAAKtW,GACK0V,GACX6E,IAAIA,EAAKD,EAAID,EAAQhE,GAIlC,GAAIgE,EAAO,CACT,IAAIG,EAAM,CAACza,EAAIC,GAAKya,EAAM,CAAC1a,EAAIG,GAAKwa,EAAM,CAACza,EAAIC,GAAKya,EAAM,CAAC1a,EAAID,GAC/Dqa,EAAMlF,UAAUtY,KACdmY,EAAMnY,KAAKuY,EAAiBkB,EAAO+D,EAAM/D,KAAMkE,EAAKC,IAAQ,EAC5DzF,EAAMnY,KAAKuY,EAAiBkB,EAAMmE,EAAKC,IAAQ,EAC/C1F,EAAMnY,KAAKuY,EAAiBkB,EAAMoE,EAAKC,IAAQ,EAC/C3F,EAAMnY,KAAKuY,EAAiBkB,EAAMqE,EAAKH,IAAQ,EAEnD,CACF,CAGA,IAAKX,EAAQ,EAAGA,EAAQO,IAAUP,GAC5BxD,EAAOnB,EAAM2E,MACVxD,EAAKlB,UAAUlZ,eACXiZ,EAAM2E,GAIrB,CGrEIe,CAAU7a,EAAIC,EAAIC,EAAIC,EACxB,CAEAgD,KAAK8R,MAAQA,EACb9R,KAAKgS,MAAQA,EAEb6C,EACAP,EACAxC,EACAE,EAAQ,IACV,CAEAsE,EAAQ5T,UAAY,CAClBuC,YAAaqR,EAEbqB,SAAU,WACR,IAAI7F,EAAQ9R,KAAK8R,MAEjB,OAAO9R,KAAKgS,MAAMvN,KAAI,SAAS0O,GAC7B,IAAIzG,EAAUyG,EAAKlB,UAAUxN,KAAI,SAASnL,GAAK,OAAOia,EAAkBJ,EAAMrB,EAAMxY,GAAK,IAEzF,OADAoT,EAAQtU,KAAO+a,EAAKC,KAAKhb,KAClBsU,CACT,GACF,EAEAvT,UAAW,WACT,IAAIA,EAAY,GACZ2Y,EAAQ9R,KAAK8R,MAsBjB,OApBA9R,KAAKgS,MAAM9G,SAAQ,SAASiI,EAAM7Z,GAChC,GAAMqE,GAAKsU,EAAYkB,EAAKlB,WAAWlZ,OASvC,IARA,IACIkZ,EAEAtU,EACAia,EA9EYxb,EAAGC,EAAGC,EA0ElB8W,EAAOD,EAAKC,KAEZlT,GAAK,EAGL2X,EAAK/F,EAAMG,EAAUtU,EAAI,IACzBma,EAAKD,EAAGtG,OAAS6B,EAAOyE,EAAGrG,MAAQqG,EAAGtG,OAEjCrR,EAAIvC,GACXia,EAAKE,EAELA,GADAD,EAAK/F,EAAMG,EAAU/R,KACbqR,OAAS6B,EAAOyE,EAAGrG,MAAQqG,EAAGtG,KAClCqG,GAAME,GAAMxe,EAAIse,EAAG/F,OAASvY,EAAIwe,EAAGjG,QAtFtBxV,EAsFkDub,EAtF/Ctb,EAsFmDwb,IAtFzD1b,EAsF+CgX,GArFzD,GAAK9W,EAAE,KAAOD,EAAE,GAAKD,EAAE,KAAOA,EAAE,GAAKC,EAAE,KAAOC,EAAE,GAAKF,EAAE,IAqFkB,IAC3EjD,EAAUQ,KAAK,CAACyZ,EAAKhb,KAAMwf,EAAGxf,KAAM0f,EAAG1f,MAG7C,IAEOe,CACT,EAEA4e,MAAO,WACL,OAAO/X,KAAK8R,MAAMkG,QAAO,SAASpG,GAChC,OAAOA,EAAKJ,KACd,IAAG/M,KAAI,SAASmN,GACd,MAAO,CACLqG,OAAQrG,EAAKL,KAAKnZ,KAClB8f,OAAQtG,EAAKJ,MAAMpZ,KAEvB,GACF,EAEA+f,KAAM,SAASxf,EAAGC,EAAG6T,GAInB,IAHA,IAAiB2L,EAAkDjF,EAA/DkF,EAAOrY,KAAUsY,EAAKD,EAAKE,QAAU,EAAGnb,EAAIib,EAAKrG,MAAMjZ,SAGlDoa,EAAOkF,EAAKrG,MAAMsG,UAAYA,GAAMlb,EAAG,OAAO,KACvD,IAAImV,EAAK5Z,EAAIwa,EAAKC,KAAK,GAAIZ,EAAK5Z,EAAIua,EAAKC,KAAK,GAAIgE,EAAK7E,EAAKA,EAAKC,EAAKA,EAGtE,GACEW,EAAOkF,EAAKrG,MAAMoG,EAAKE,GAAKA,EAAK,KACjCnF,EAAKlB,UAAU/G,SAAQ,SAAS3P,GAC9B,IAAIqW,EAAOyG,EAAKvG,MAAMvW,GAAI6I,EAAIwN,EAAKL,KACnC,GAAKnN,IAAM+O,EAAKC,MAAShP,IAAQA,EAAIwN,EAAKJ,OAA1C,CACA,IAAIgH,EAAK7f,EAAIyL,EAAE,GAAIqU,EAAK7f,EAAIwL,EAAE,GAAIsU,EAAKF,EAAKA,EAAKC,EAAKA,EAClDC,EAAKtB,IAAIA,EAAKsB,EAAIJ,EAAKlU,EAAEyN,MAF2B,CAG1D,UACc,OAAPyG,GAIT,OAFAD,EAAKE,OAASH,EAEG,MAAV3L,GAAkB2K,GAAM3K,EAASA,EAAS0G,EAAKC,KAAO,IAC/D,E,oBC3HF,SAASuF,EAAOC,EAASjP,EAASkP,EAAQC,GAExC9Y,KAAK4Y,QAAU,GAEf5Y,KAAK2J,QAAU,EAEf3J,KAAK6Y,OAAS,EAEd7Y,KAAK+Y,SAAW/Y,KAAKgZ,mBAErBhZ,KAAKiZ,SAAW,GAEhBjZ,KAAKkZ,MAAQ,GAKblZ,KAAKmZ,SAAW,GAEhBnZ,KAAKoZ,UAAY,GAEjBpZ,KAAKqZ,eAAiB,EAEtBrZ,KAAKsZ,MAAMV,EAASjP,EAASkP,EAAQC,EACvC,CAeAH,EAAOjW,UAAU6W,IAAM,SAASX,EAASjP,EAASkP,EAAQC,GACxD9Y,KAAKsZ,MAAMV,EAASjP,EAASkP,EAAQC,GAErC,IAAK,IAAIU,EAAU,EAAGA,EAAUxZ,KAAKqZ,eAAgBG,IAEnD,GAA+B,IAA3BxZ,KAAKmZ,SAASK,GAAgB,CAChCxZ,KAAKmZ,SAASK,GAAW,EAGzB,IAAIC,EAAYzZ,KAAK0Z,aAAaF,GAElC,GAAIC,EAAU1gB,OAASiH,KAAK6Y,OAC1B7Y,KAAKkZ,MAAMvf,KAAK6f,OACX,CAEL,IAAIG,EAAY3Z,KAAKiZ,SAASlgB,OAC9BiH,KAAKiZ,SAAStf,KAAK,IACnBqG,KAAK4Z,cAAcJ,EAASG,GAE5B3Z,KAAK6Z,eAAeF,EAAWF,EACjC,CACF,CAGF,OAAOzZ,KAAKiZ,QACd,EAeAN,EAAOjW,UAAU4W,MAAQ,SAASV,EAASjP,EAASkP,EAAQE,GAE1D,GAAIH,EAAS,CAEX,KAAMA,aAAmBpU,OACvB,MAAMsV,MAAM,yCACHlB,EAAU,UAGrB5Y,KAAK4Y,QAAUA,EACf5Y,KAAKiZ,SAAW,GAChBjZ,KAAKkZ,MAAQ,GAEblZ,KAAKqZ,eAAiBT,EAAQ7f,OAC9BiH,KAAKmZ,SAAW,IAAI3U,MAAMxE,KAAKqZ,gBAC/BrZ,KAAKoZ,UAAY,IAAI5U,MAAMxE,KAAKqZ,eAClC,CAEI1P,IACF3J,KAAK2J,QAAUA,GAGbkP,IACF7Y,KAAK6Y,OAASA,GAGZE,IACF/Y,KAAK+Y,SAAWA,EAEpB,EAUAJ,EAAOjW,UAAUmX,eAAiB,SAASF,EAAWF,GAMpD,IAAK,IAAIngB,EAAI,EAAGA,EAAImgB,EAAU1gB,OAAQO,IAAK,CACzC,IAAIygB,EAAWN,EAAUngB,GAEzB,GAAgC,IAA5B0G,KAAKmZ,SAASY,GAAiB,CACjC/Z,KAAKmZ,SAASY,GAAY,EAC1B,IAAIC,EAAaha,KAAK0Z,aAAaK,GAE/BC,EAAWjhB,QAAUiH,KAAK6Y,SAC5BY,EAAYzZ,KAAKia,aAAaR,EAAWO,GAE7C,CAGiC,IAA7Bha,KAAKoZ,UAAUW,IACjB/Z,KAAK4Z,cAAcG,EAAUJ,EAEjC,CACF,EAQAhB,EAAOjW,UAAUkX,cAAgB,SAASJ,EAASG,GACjD3Z,KAAKiZ,SAASU,GAAWhgB,KAAK6f,GAC9BxZ,KAAKoZ,UAAUI,GAAW,CAC5B,EAUAb,EAAOjW,UAAUgX,aAAe,SAASF,GAGvC,IAFA,IAAIC,EAAY,GAEPS,EAAK,EAAGA,EAAKla,KAAKqZ,eAAgBa,IAAM,CACpCla,KAAK+Y,SAAS/Y,KAAK4Y,QAAQY,GAAUxZ,KAAK4Y,QAAQsB,IAClDla,KAAK2J,SACd8P,EAAU9f,KAAKugB,EAEnB,CAEA,OAAOT,CACT,EAWAd,EAAOjW,UAAUuX,aAAe,SAAS7d,EAAGC,GAG1C,IAFA,IAAI9C,EAAM8C,EAAEtD,OAEHO,EAAI,EAAGA,EAAIC,EAAKD,IAAK,CAC5B,IAAIqX,EAAItU,EAAE/C,GACN8C,EAAEiG,QAAQsO,GAAK,GACjBvU,EAAEzC,KAAKgX,EAEX,CAEA,OAAOvU,CACT,EAUAuc,EAAOjW,UAAUsW,mBAAqB,SAASle,EAAGQ,GAIhD,IAHA,IAAI2E,EAAM,EACN3G,EAAIW,KAAKwF,IAAI3E,EAAE/B,OAAQuC,EAAEvC,QAEtBO,KACL2G,IAAQnF,EAAExB,GAAKgC,EAAEhC,KAAOwB,EAAExB,GAAKgC,EAAEhC,IAGnC,OAAOW,KAAK8H,KAAK9B,EACnB,EAEqCE,EAAOC,UAC1CD,EAAOC,QAAUuY,E,oBC1NlB,SAASwB,EAAOvB,EAASpR,EAAGuR,GAC3B/Y,KAAKwH,EAAI,EACTxH,KAAK4Y,QAAU,GACf5Y,KAAKoa,YAAc,GACnBpa,KAAKqa,UAAY,GAEjBra,KAAKsa,KAAK1B,EAASpR,EAAGuR,EACxB,CAKAoB,EAAOzX,UAAU4X,KAAO,SAAS1B,EAASpR,EAAGuR,GAC3C/Y,KAAKoa,YAAc,GACnBpa,KAAKqa,UAAY,GAEM,qBAAZzB,IACT5Y,KAAK4Y,QAAUA,GAGA,qBAANpR,IACTxH,KAAKwH,EAAIA,GAGa,qBAAbuR,IACT/Y,KAAK+Y,SAAWA,EAEpB,EAKAoB,EAAOzX,UAAU6W,IAAM,SAASX,EAASpR,GACvCxH,KAAKsa,KAAK1B,EAASpR,GAKnB,IAHA,IAAIjO,EAAMyG,KAAK4Y,QAAQ7f,OAGdO,EAAI,EAAGA,EAAI0G,KAAKwH,EAAGlO,IAC1B0G,KAAKqa,UAAU/gB,GAAK0G,KAAKua,iBAI3B,IADA,IAAIC,GAAS,EACPA,GAAQ,CAGZA,EAASxa,KAAKya,SAGd,IAAK,IAAIC,EAAa,EAAGA,EAAa1a,KAAKwH,EAAGkT,IAAc,CAK1D,IAJA,IAAIC,EAAO,IAAInW,MAAMoW,GACjBC,EAAQ,EAGHviB,EAAM,EAAGA,EAAMsiB,EAAQtiB,IAC9BqiB,EAAKriB,GAAO,EAGd,IAAK,IAAI4H,EAAI,EAAGA,EAAI3G,EAAK2G,IAAK,CAC5B,IAAI0a,EAAS5a,KAAK4Y,QAAQ1Y,GAAGnH,OAG7B,GAAI2hB,IAAe1a,KAAKoa,YAAYla,GAAI,CACtC,IAAS5H,EAAM,EAAGA,EAAMsiB,EAAQtiB,IAC9BqiB,EAAKriB,IAAQ0H,KAAK4Y,QAAQ1Y,GAAG5H,GAE/BuiB,GACF,CACF,CAEA,GAAIA,EAAQ,EAAG,CAEb,IAASviB,EAAM,EAAGA,EAAMsiB,EAAQtiB,IAC9BqiB,EAAKriB,IAAQuiB,EAEf7a,KAAKqa,UAAUK,GAAcC,CAC/B,MAEE3a,KAAKqa,UAAUK,GAAc1a,KAAKua,iBAClCC,GAAS,CAEb,CACF,CAEA,OAAOxa,KAAK8a,aACd,EAOAX,EAAOzX,UAAU6X,eAAiB,WAChC,IACIQ,EACAb,EAFAc,EAAQhb,KAAK4Y,QAAQ7f,OAAQ,EAIjC,GACEmhB,EAAKjgB,KAAKghB,MAAMhhB,KAAKihB,SAAWF,GAChCD,EAAW/a,KAAK4Y,QAAQsB,SACjBla,KAAKqa,UAAUhY,QAAQ0Y,IAAa,GAE7C,OAAOA,CACT,EAOAZ,EAAOzX,UAAU+X,OAAS,WAKxB,IAJA,IAEIU,EAFAX,GAAS,EACTjhB,EAAMyG,KAAK4Y,QAAQ7f,OAGdO,EAAI,EAAGA,EAAIC,EAAKD,KACvB6hB,EAAkBnb,KAAKob,OAAOpb,KAAK4Y,QAAQtf,GAAI0G,KAAKqa,UAAWra,KAAK+Y,YAE7C/Y,KAAKoa,YAAY9gB,KACtC0G,KAAKoa,YAAY9gB,GAAK6hB,EACtBX,GAAS,GAIb,OAAOA,CACT,EAOAL,EAAOzX,UAAUoY,YAAc,WAI7B,IAHA,IACIJ,EADAzB,EAAW,IAAIzU,MAAMxE,KAAKwH,GAGrBgS,EAAU,EAAGA,EAAUxZ,KAAKoa,YAAYrhB,OAAQygB,IAInB,qBAAzBP,EAHXyB,EAAa1a,KAAKoa,YAAYZ,MAI5BP,EAASyB,GAAc,IAGzBzB,EAASyB,GAAY/gB,KAAK6f,GAG5B,OAAOP,CACT,EAUAkB,EAAOzX,UAAU0Y,OAAS,SAASpV,EAAOqV,EAAKzZ,GAM7C,IALA,IAGId,EAHArB,EAAM6b,OAAOC,UACbC,EAAM,EACNjiB,EAAM8hB,EAAItiB,OAGLO,EAAI,EAAGA,EAAIC,EAAKD,KACvBwH,EAAIc,EAAEoE,EAAOqV,EAAI/hB,KACTmG,IACNA,EAAMqB,EACN0a,EAAMliB,GAIV,OAAOkiB,CACT,EASArB,EAAOzX,UAAUqW,SAAW,SAASje,EAAGQ,GAItC,IAHA,IAAI2E,EAAM,EACN3G,EAAIW,KAAKwF,IAAI3E,EAAE/B,OAAQuC,EAAEvC,QAEtBO,KAAK,CACV,IAAImiB,EAAO3gB,EAAExB,GAAKgC,EAAEhC,GACpB2G,GAAOwb,EAAOA,CAChB,CAEA,OAAOxhB,KAAK8H,KAAK9B,EACnB,EAEqCE,EAAOC,UAC1CD,EAAOC,QAAU+Z,E,wBC9MnB,GAAqCha,EAAOC,QACtC,IAAIsb,EAAgB1a,EAAQ,OAoBlC,SAAS2a,EAAO/C,EAASjP,EAASkP,EAAQC,GAExC9Y,KAAK2J,QAAU,EAEf3J,KAAK6Y,OAAS,EAEd7Y,KAAK+Y,SAAW/Y,KAAKgZ,mBAKrBhZ,KAAK4b,cAAgB,GAErB5b,KAAK6b,WAAa,GAElB7b,KAAK8b,cAAgB,EAErB9b,KAAK+b,aAAe,GAEpB/b,KAAKsZ,MAAMV,EAASjP,EAASkP,EAAQC,EACvC,CAYA6C,EAAOjZ,UAAU6W,IAAM,SAASX,EAASjP,EAASkP,EAAQC,GACxD9Y,KAAKsZ,MAAMV,EAASjP,EAASkP,EAAQC,GAErC,IAAK,IAAIU,EAAU,EAAG9X,EAAI1B,KAAK4Y,QAAQ7f,OAAQygB,EAAU9X,EAAG8X,IAC1D,GAAiC,IAA7BxZ,KAAK6b,WAAWrC,GAAgB,CAClCxZ,KAAK6b,WAAWrC,GAAW,EAC3BxZ,KAAKiZ,SAAStf,KAAK,CAAC6f,IACpB,IAAIG,EAAY3Z,KAAKiZ,SAASlgB,OAAS,EAEvCiH,KAAK+b,aAAapiB,KAAK6f,GACvB,IAAIwC,EAAgB,IAAIN,EAAc,KAAM,KAAM,OAC9CjC,EAAYzZ,KAAK0Z,aAAaF,QAGIyC,IAAlCjc,KAAKkc,gBAAgB1C,KACvBxZ,KAAKmc,aAAa3C,EAASC,EAAWuC,GACtChc,KAAK6Z,eAAeF,EAAWqC,GAEnC,CAGF,OAAOhc,KAAKiZ,QACd,EAQA0C,EAAOjZ,UAAU0Z,oBAAsB,WAGrC,IAFA,IAAIC,EAAmB,GAEd/iB,EAAI,EAAGoI,EAAI1B,KAAK+b,aAAahjB,OAAQO,EAAIoI,EAAGpI,IAAK,CACxD,IAAIkgB,EAAUxZ,KAAK+b,aAAaziB,GAC5Byf,EAAW/Y,KAAK4b,cAAcpC,GAElC6C,EAAiB1iB,KAAK,CAAC6f,EAAST,GAClC,CAEA,OAAOsD,CACT,EAeAV,EAAOjZ,UAAU4W,MAAQ,SAASV,EAASjP,EAASkP,EAAQE,GAE1D,GAAIH,EAAS,CAEX,KAAMA,aAAmBpU,OACvB,MAAMsV,MAAM,yCACHlB,EAAU,UAGrB5Y,KAAK4Y,QAAUA,EACf5Y,KAAKiZ,SAAW,GAChBjZ,KAAK4b,cAAgB,IAAIpX,MAAMxE,KAAK4Y,QAAQ7f,QAC5CiH,KAAK6b,WAAa,IAAIrX,MAAMxE,KAAK4Y,QAAQ7f,QACzCiH,KAAK8b,cAAgB,EACrB9b,KAAK+b,aAAe,EACtB,CAEIpS,IACF3J,KAAK2J,QAAUA,GAGbkP,IACF7Y,KAAK6Y,OAASA,GAGZE,IACF/Y,KAAK+Y,SAAWA,EAEpB,EAWA4C,EAAOjZ,UAAUyZ,aAAe,SAAS3C,EAASC,EAAWhgB,GAC3D,IAAI6iB,EAAOtc,KAEXA,KAAK8b,cAAgB9b,KAAKkc,gBAAgB1C,GAC1CC,EAAUvO,SAAQ,SAAS6O,GACzB,QAAkCkC,IAA9BK,EAAKT,WAAW9B,GAAyB,CAC3C,IAAIwC,EAAOD,EAAKvD,SAASuD,EAAK1D,QAAQY,GAAU8C,EAAK1D,QAAQmB,IACzDyC,EAAuBviB,KAAKC,IAAIoiB,EAAKR,cAAeS,QAEnBN,IAAjCK,EAAKV,cAAc7B,IACrBuC,EAAKV,cAAc7B,GAAYyC,EAC/B/iB,EAAMwJ,OAAO8W,EAAUyC,IAEnBA,EAAuBF,EAAKV,cAAc7B,KAC5CuC,EAAKV,cAAc7B,GAAYyC,EAC/B/iB,EAAM6J,OAAOyW,GACbtgB,EAAMwJ,OAAO8W,EAAUyC,GAG7B,CACF,GACF,EAUAb,EAAOjZ,UAAUmX,eAAiB,SAASF,EAAWlgB,GAGpD,IAFA,IAAIgjB,EAAgBhjB,EAAMijB,cAEjB5hB,EAAI,EAAG4G,EAAI+a,EAAc1jB,OAAQ+B,EAAI4G,EAAG5G,IAAK,CACpD,IAAI0e,EAAUiD,EAAc3hB,GAC5B,QAAiCmhB,IAA7Bjc,KAAK6b,WAAWrC,GAAwB,CAC1C,IAAIC,EAAYzZ,KAAK0Z,aAAaF,GAClCxZ,KAAK6b,WAAWrC,GAAW,EAE3BxZ,KAAKiZ,SAASU,GAAWhgB,KAAK6f,GAC9BxZ,KAAK+b,aAAapiB,KAAK6f,QAEeyC,IAAlCjc,KAAKkc,gBAAgB1C,KACvBxZ,KAAKmc,aAAa3C,EAASC,EAAWhgB,GACtCuG,KAAK6Z,eAAeF,EAAWlgB,GAEnC,CACF,CACF,EASAkiB,EAAOjZ,UAAUwZ,gBAAkB,SAAS1C,GAE1C,IADA,IAAI9X,EAAI1B,KAAK2J,QACJgT,EAAe,EAAGA,EAAejb,EAAGib,IAAgB,CAE3D,GADgB3c,KAAK0Z,aAAaF,EAASmD,GAC7B5jB,QAAUiH,KAAK6Y,OAC3B,OAAO8D,CAEX,CAGF,EAUAhB,EAAOjZ,UAAUgX,aAAe,SAASF,EAAS7P,GAChDA,EAAUA,GAAW3J,KAAK2J,QAG1B,IAFA,IAAI8P,EAAY,GAEPS,EAAK,EAAGxY,EAAI1B,KAAK4Y,QAAQ7f,OAAQmhB,EAAKxY,EAAGwY,IAC5Cla,KAAK+Y,SAAS/Y,KAAK4Y,QAAQY,GAAUxZ,KAAK4Y,QAAQsB,IAAOvQ,GAC3D8P,EAAU9f,KAAKugB,GAInB,OAAOT,CACT,EAaAkC,EAAOjZ,UAAUsW,mBAAqB,SAASle,EAAGQ,GAIhD,IAHA,IAAI2E,EAAM,EACN3G,EAAIW,KAAKwF,IAAI3E,EAAE/B,OAAQuC,EAAEvC,QAEtBO,KACL2G,IAAQnF,EAAExB,GAAKgC,EAAEhC,KAAOwB,EAAExB,GAAKgC,EAAEhC,IAGnC,OAAOW,KAAK8H,KAAK9B,EACnB,EAEqCE,EAAOC,UAC1CD,EAAOC,QAAUub,E,oBCrPnB,SAASD,EAAckB,EAAUC,EAAYC,GAE3C9c,KAAK+c,OAAS,GAEd/c,KAAKgd,YAAc,GAEnBhd,KAAKid,SAAW,OAEhBjd,KAAKsZ,MAAMsD,EAAUC,EAAYC,EACnC,CAUApB,EAAchZ,UAAUO,OAAS,SAASia,EAAKC,GAI7C,IAHA,IAAIC,EAAgBpd,KAAK+c,OAAOhkB,OAC5B8Y,EAAQuL,EAELvL,KAAS,CACd,IAAIwL,EAAYrd,KAAKgd,YAAYnL,GACX,SAAlB7R,KAAKid,SACHE,EAAWE,IACbD,EAAgBvL,GAGdsL,EAAWE,IACbD,EAAgBvL,EAGtB,CAEA7R,KAAKsd,UAAUJ,EAAKC,EAAUC,EAChC,EASA1B,EAAchZ,UAAUY,OAAS,SAAS4Z,GAGxC,IAFA,IAAIrL,EAAQ7R,KAAK+c,OAAOhkB,OAEjB8Y,KAAS,CAEd,GAAIqL,IADOld,KAAK+c,OAAOlL,GACL,CAChB7R,KAAK+c,OAAOxZ,OAAOsO,EAAO,GAC1B7R,KAAKgd,YAAYzZ,OAAOsO,EAAO,GAC/B,KACF,CACF,CACF,EASA6J,EAAchZ,UAAUwI,QAAU,SAASqS,GACzCvd,KAAK+c,OAAO7R,QAAQqS,EACtB,EAMA7B,EAAchZ,UAAUga,YAAc,WACpC,OAAO1c,KAAK+c,MACd,EAOArB,EAAchZ,UAAU8a,mBAAqB,SAAS3L,GACpD,OAAO7R,KAAKgd,YAAYnL,EAC1B,EAMA6J,EAAchZ,UAAU+a,cAAgB,WACtC,OAAOzd,KAAKgd,WACd,EAMAtB,EAAchZ,UAAUgb,0BAA4B,WAGlD,IAFA,IAAIjd,EAAS,GAEJnH,EAAI,EAAGoI,EAAI1B,KAAK+c,OAAOhkB,OAAQO,EAAIoI,EAAGpI,IAC7CmH,EAAO9G,KAAK,CAACqG,KAAK+c,OAAOzjB,GAAI0G,KAAKgd,YAAY1jB,KAGhD,OAAOmH,CACT,EAUAib,EAAchZ,UAAU4W,MAAQ,SAASsD,EAAUC,EAAYC,GAE7D,GAAIF,GAAYC,EAAY,CAI1B,GAHA7c,KAAK+c,OAAS,GACd/c,KAAKgd,YAAc,GAEfJ,EAAS7jB,SAAW8jB,EAAW9jB,OACjC,MAAM,IAAI+gB,MAAM,oCAGlB,IAAK,IAAIxgB,EAAI,EAAGA,EAAIsjB,EAAS7jB,OAAQO,IACnC0G,KAAKiD,OAAO2Z,EAAStjB,GAAIujB,EAAWvjB,GAExC,CAEIwjB,IACF9c,KAAKid,SAAWH,EAEpB,EAUApB,EAAchZ,UAAU4a,UAAY,SAASJ,EAAKC,EAAUtL,GACtD7R,KAAK+c,OAAOhkB,SAAW8Y,GACzB7R,KAAK+c,OAAOpjB,KAAKujB,GACjBld,KAAKgd,YAAYrjB,KAAKwjB,KAEtBnd,KAAK+c,OAAOxZ,OAAOsO,EAAO,EAAGqL,GAC7Bld,KAAKgd,YAAYzZ,OAAOsO,EAAO,EAAGsL,GAEtC,EAEqChd,EAAOC,UAC1CD,EAAOC,QAAUsb,E,iCC9KnB,IACIvY,EAAQqB,MAAM9B,UAAUS,MACxBwa,EAAQC,OAAOlb,UAAUmb,SAG7B1d,EAAOC,QAAU,SAAciY,GAC3B,IAAIH,EAASlY,KACb,GAAsB,oBAAXkY,GAJA,sBAIyByF,EAAMG,KAAK5F,GAC3C,MAAM,IAAI6F,UARE,kDAQwB7F,GAyBxC,IAvBA,IAEI8F,EAFAC,EAAO9a,EAAM2a,KAAKI,UAAW,GAqB7BC,EAAclkB,KAAKC,IAAI,EAAGge,EAAOnf,OAASklB,EAAKllB,QAC/CqlB,EAAY,GACP9kB,EAAI,EAAGA,EAAI6kB,EAAa7kB,IAC7B8kB,EAAUzkB,KAAK,IAAML,GAKzB,GAFA0kB,EAAQK,SAAS,SAAU,oBAAsBD,EAAUE,KAAK,KAAO,4CAA/DD,EAxBK,WACT,GAAIre,gBAAgBge,EAAO,CACvB,IAAIvd,EAASyX,EAAOrU,MAChB7D,KACAie,EAAK1T,OAAOpH,EAAM2a,KAAKI,aAE3B,OAAIN,OAAOnd,KAAYA,EACZA,EAEJT,IACX,CACI,OAAOkY,EAAOrU,MACVwU,EACA4F,EAAK1T,OAAOpH,EAAM2a,KAAKI,YAGnC,IAUIhG,EAAOxV,UAAW,CAClB,IAAI6b,EAAQ,WAAkB,EAC9BA,EAAM7b,UAAYwV,EAAOxV,UACzBsb,EAAMtb,UAAY,IAAI6b,EACtBA,EAAM7b,UAAY,IACtB,CAEA,OAAOsb,CACX,C,oBCnDoE7d,EAAOC,QAAwF,WAAW,aAAa,SAASkB,EAAEA,EAAExC,EAAEvD,EAAEa,EAAEmF,IAAI,SAASD,EAAElE,EAAE0B,EAAEvD,EAAEa,EAAEmF,GAAG,KAAKnF,EAAEb,GAAG,CAAC,GAAGa,EAAEb,EAAE,IAAI,CAAC,IAAIiG,EAAEpF,EAAEb,EAAE,EAAEkG,EAAE3C,EAAEvD,EAAE,EAAEmG,EAAEzH,KAAK0H,IAAIH,GAAGI,EAAE,GAAG3H,KAAK4H,IAAI,EAAEH,EAAE,GAAGI,EAAE,GAAG7H,KAAK8H,KAAKL,EAAEE,GAAGJ,EAAEI,GAAGJ,IAAIC,EAAED,EAAE,EAAE,GAAG,EAAE,GAA+EF,EAAElE,EAAE0B,EAA9E7E,KAAKC,IAAIqB,EAAEtB,KAAK+H,MAAMlD,EAAE2C,EAAEG,EAAEJ,EAAEM,IAAM7H,KAAKwF,IAAIrD,EAAEnC,KAAK+H,MAAMlD,GAAG0C,EAAEC,GAAGG,EAAEJ,EAAEM,IAAcP,EAAE,CAAC,IAAIzG,EAAEsC,EAAE0B,GAAGgC,EAAEvF,EAAE5C,EAAEyD,EAAE,IAAI9C,EAAE8D,EAAE7B,EAAEuD,GAAGyC,EAAEnE,EAAEhB,GAAGtB,GAAG,GAAGxB,EAAE8D,EAAE7B,EAAEa,GAAG0E,EAAEnI,GAAG,CAAC,IAAIW,EAAE8D,EAAE0D,EAAEnI,GAAGmI,IAAInI,IAAI4I,EAAEnE,EAAE0D,GAAGhG,GAAG,GAAGgG,IAAI,KAAKS,EAAEnE,EAAEzE,GAAGmC,GAAG,GAAGnC,GAAG,CAAC,IAAI4I,EAAEnE,EAAE7B,GAAGT,GAAGxB,EAAE8D,EAAE7B,EAAE5C,GAAGW,EAAE8D,IAAIzE,EAAEyD,GAAGzD,GAAGmG,IAAIvD,EAAE5C,EAAE,GAAGmG,GAAGnG,IAAIyD,EAAEzD,EAAE,EAAE,CAAC,CAA9Z,CAAga2I,EAAExC,EAAEvD,GAAG,EAAEa,GAAGkF,EAAEvI,OAAO,EAAEwI,GAAGnE,EAAE,CAAC,SAAS9D,EAAEgI,EAAEhI,EAAE8D,GAAG,IAAI0B,EAAEwC,EAAEhI,GAAGgI,EAAEhI,GAAGgI,EAAElE,GAAGkE,EAAElE,GAAG0B,CAAC,CAAC,SAAS1B,EAAEkE,EAAEhI,GAAG,OAAOgI,EAAEhI,GAAG,EAAEgI,EAAEhI,EAAE,EAAE,CAAC,CAAC,IAAIwF,EAAE,SAASwC,QAAG,IAASA,IAAIA,EAAE,GAAGtB,KAAKiC,YAAYhI,KAAKC,IAAI,EAAEoH,GAAGtB,KAAKkC,YAAYjI,KAAKC,IAAI,EAAED,KAAKkI,KAAK,GAAGnC,KAAKiC,cAAcjC,KAAKoC,OAAO,EAAE,SAAS7G,EAAE+F,EAAEhI,EAAE8D,GAAG,IAAIA,EAAE,OAAO9D,EAAE+I,QAAQf,GAAG,IAAI,IAAIxC,EAAE,EAAEA,EAAExF,EAAEP,OAAO+F,IAAI,GAAG1B,EAAEkE,EAAEhI,EAAEwF,IAAI,OAAOA,EAAE,OAAO,CAAC,CAAC,SAAS1C,EAAEkF,EAAEhI,GAAGiI,EAAED,EAAE,EAAEA,EAAEgB,SAASvJ,OAAOO,EAAEgI,EAAE,CAAC,SAASC,EAAED,EAAEhI,EAAE8D,EAAE0B,EAAEvD,GAAGA,IAAIA,EAAET,EAAE,OAAOS,EAAEhD,KAAK,IAAIgD,EAAE/C,KAAK,IAAI+C,EAAE9C,MAAK,IAAK8C,EAAE7C,MAAK,IAAK,IAAI,IAAI0D,EAAE9C,EAAE8C,EAAEgB,EAAEhB,IAAI,CAAC,IAAImF,EAAED,EAAEgB,SAASlG,GAAGoF,EAAEjG,EAAE+F,EAAEiB,KAAKzD,EAAEyC,GAAGA,EAAE,CAAC,OAAOhG,CAAC,CAAC,SAASiG,EAAEF,EAAEhI,GAAG,OAAOgI,EAAE/I,KAAK0B,KAAKwF,IAAI6B,EAAE/I,KAAKe,EAAEf,MAAM+I,EAAE9I,KAAKyB,KAAKwF,IAAI6B,EAAE9I,KAAKc,EAAEd,MAAM8I,EAAE7I,KAAKwB,KAAKC,IAAIoH,EAAE7I,KAAKa,EAAEb,MAAM6I,EAAE5I,KAAKuB,KAAKC,IAAIoH,EAAE5I,KAAKY,EAAEZ,MAAM4I,CAAC,CAAC,SAASG,EAAEH,EAAEhI,GAAG,OAAOgI,EAAE/I,KAAKe,EAAEf,IAAI,CAAC,SAASmJ,EAAEJ,EAAEhI,GAAG,OAAOgI,EAAE9I,KAAKc,EAAEd,IAAI,CAAC,SAASoJ,EAAEN,GAAG,OAAOA,EAAE7I,KAAK6I,EAAE/I,OAAO+I,EAAE5I,KAAK4I,EAAE9I,KAAK,CAAC,SAASsJ,EAAER,GAAG,OAAOA,EAAE7I,KAAK6I,EAAE/I,MAAM+I,EAAE5I,KAAK4I,EAAE9I,KAAK,CAAC,SAASmF,EAAE2D,EAAEhI,GAAG,OAAOgI,EAAE/I,MAAMe,EAAEf,MAAM+I,EAAE9I,MAAMc,EAAEd,MAAMc,EAAEb,MAAM6I,EAAE7I,MAAMa,EAAEZ,MAAM4I,EAAE5I,IAAI,CAAC,SAAS4D,EAAEgF,EAAEhI,GAAG,OAAOA,EAAEf,MAAM+I,EAAE7I,MAAMa,EAAEd,MAAM8I,EAAE5I,MAAMY,EAAEb,MAAM6I,EAAE/I,MAAMe,EAAEZ,MAAM4I,EAAE9I,IAAI,CAAC,SAASsC,EAAEwG,GAAG,MAAM,CAACgB,SAAShB,EAAEkB,OAAO,EAAED,MAAK,EAAGhK,KAAK,IAAIC,KAAK,IAAIC,MAAK,IAAKC,MAAK,IAAK,CAAC,SAASoI,EAAExH,EAAE8D,EAAE0B,EAAEvD,EAAEa,GAAG,IAAI,IAAImF,EAAE,CAACnE,EAAE0B,GAAGyC,EAAExI,QAAQ,MAAM+F,EAAEyC,EAAEkB,QAAQrF,EAAEmE,EAAEkB,QAAQlH,GAAG,CAAC,IAAIiG,EAAEpE,EAAEnD,KAAKkI,MAAMrD,EAAE1B,GAAG7B,EAAE,GAAGA,EAAE+F,EAAEhI,EAAEkI,EAAEpE,EAAE0B,EAAE1C,GAAGmF,EAAE5H,KAAKyD,EAAEoE,EAAEA,EAAE1C,EAAE,CAAC,CAAC,OAAOA,EAAE4D,UAAUC,IAAI,WAAW,OAAO3C,KAAK4C,KAAK5C,KAAK5H,KAAK,GAAG,EAAE0G,EAAE4D,UAAUG,OAAO,SAASvB,GAAG,IAAIhI,EAAE0G,KAAK5H,KAAKgF,EAAE,GAAG,IAAId,EAAEgF,EAAEhI,GAAG,OAAO8D,EAAE,IAAI,IAAI0B,EAAEkB,KAAK8C,OAAOvH,EAAE,GAAGjC,GAAG,CAAC,IAAI,IAAI8C,EAAE,EAAEA,EAAE9C,EAAEgJ,SAASvJ,OAAOqD,IAAI,CAAC,IAAImF,EAAEjI,EAAEgJ,SAASlG,GAAGoF,EAAElI,EAAEiJ,KAAKzD,EAAEyC,GAAGA,EAAEjF,EAAEgF,EAAEE,KAAKlI,EAAEiJ,KAAKnF,EAAEzD,KAAK4H,GAAG5D,EAAE2D,EAAEE,GAAGxB,KAAK4C,KAAKrB,EAAEnE,GAAG7B,EAAE5B,KAAK4H,GAAG,CAACjI,EAAEiC,EAAEkH,KAAK,CAAC,OAAOrF,CAAC,EAAE0B,EAAE4D,UAAUK,SAAS,SAASzB,GAAG,IAAIhI,EAAE0G,KAAK5H,KAAK,IAAIkE,EAAEgF,EAAEhI,GAAG,OAAM,EAAG,IAAI,IAAI8D,EAAE,GAAG9D,GAAG,CAAC,IAAI,IAAIwF,EAAE,EAAEA,EAAExF,EAAEgJ,SAASvJ,OAAO+F,IAAI,CAAC,IAAIvD,EAAEjC,EAAEgJ,SAASxD,GAAG1C,EAAE9C,EAAEiJ,KAAKvC,KAAK8C,OAAOvH,GAAGA,EAAE,GAAGe,EAAEgF,EAAElF,GAAG,CAAC,GAAG9C,EAAEiJ,MAAM5E,EAAE2D,EAAElF,GAAG,OAAM,EAAGgB,EAAEzD,KAAK4B,EAAE,CAAC,CAACjC,EAAE8D,EAAEqF,KAAK,CAAC,OAAM,CAAE,EAAE3D,EAAE4D,UAAUM,KAAK,SAAS1B,GAAG,IAAIA,IAAIA,EAAEvI,OAAO,OAAOiH,KAAK,GAAGsB,EAAEvI,OAAOiH,KAAKkC,YAAY,CAAC,IAAI,IAAI5I,EAAE,EAAEA,EAAEgI,EAAEvI,OAAOO,IAAI0G,KAAKiD,OAAO3B,EAAEhI,IAAI,OAAO0G,IAAI,CAAC,IAAI5C,EAAE4C,KAAKkD,OAAO5B,EAAE6B,QAAQ,EAAE7B,EAAEvI,OAAO,EAAE,GAAG,GAAGiH,KAAK5H,KAAKkK,SAASvJ,OAAO,GAAGiH,KAAK5H,KAAKoK,SAASpF,EAAEoF,OAAOxC,KAAKoD,WAAWpD,KAAK5H,KAAKgF,OAAO,CAAC,GAAG4C,KAAK5H,KAAKoK,OAAOpF,EAAEoF,OAAO,CAAC,IAAI1D,EAAEkB,KAAK5H,KAAK4H,KAAK5H,KAAKgF,EAAEA,EAAE0B,CAAC,CAACkB,KAAKqD,QAAQjG,EAAE4C,KAAK5H,KAAKoK,OAAOpF,EAAEoF,OAAO,GAAE,EAAG,MAAMxC,KAAK5H,KAAKgF,EAAE,OAAO4C,IAAI,EAAElB,EAAE4D,UAAUO,OAAO,SAAS3B,GAAG,OAAOA,GAAGtB,KAAKqD,QAAQ/B,EAAEtB,KAAK5H,KAAKoK,OAAO,GAAGxC,IAAI,EAAElB,EAAE4D,UAAUN,MAAM,WAAW,OAAOpC,KAAK5H,KAAK0C,EAAE,IAAIkF,IAAI,EAAElB,EAAE4D,UAAUY,OAAO,SAAShC,EAAEhI,GAAG,IAAIgI,EAAE,OAAOtB,KAAK,IAAI,IAAI5C,EAAE0B,EAAE1C,EAAEmF,EAAEvB,KAAK5H,KAAKoJ,EAAExB,KAAK8C,OAAOxB,GAAGG,EAAE,GAAGC,EAAE,GAAGH,GAAGE,EAAE1I,QAAQ,CAAC,GAAGwI,IAAIA,EAAEE,EAAEgB,MAAM3D,EAAE2C,EAAEA,EAAE1I,OAAO,GAAGqE,EAAEsE,EAAEe,MAAMrG,GAAE,GAAImF,EAAEgB,KAAK,CAAC,IAAIX,EAAErG,EAAE+F,EAAEC,EAAEe,SAAShJ,GAAG,IAAI,IAAIsI,EAAE,OAAOL,EAAEe,SAASiB,OAAO3B,EAAE,GAAGH,EAAE9H,KAAK4H,GAAGvB,KAAKwD,UAAU/B,GAAGzB,IAAI,CAAC5D,GAAGmF,EAAEgB,OAAO5E,EAAE4D,EAAEC,GAAG1C,GAAG1B,IAAImE,EAAEzC,EAAEwD,SAASlF,GAAGhB,GAAE,GAAImF,EAAE,MAAME,EAAE9H,KAAK4H,GAAGG,EAAE/H,KAAKyD,GAAGA,EAAE,EAAE0B,EAAEyC,EAAEA,EAAEA,EAAEe,SAAS,GAAG,CAAC,OAAOtC,IAAI,EAAElB,EAAE4D,UAAUI,OAAO,SAASxB,GAAG,OAAOA,CAAC,EAAExC,EAAE4D,UAAUe,YAAY,SAASnC,EAAEhI,GAAG,OAAOgI,EAAE/I,KAAKe,EAAEf,IAAI,EAAEuG,EAAE4D,UAAUgB,YAAY,SAASpC,EAAEhI,GAAG,OAAOgI,EAAE9I,KAAKc,EAAEd,IAAI,EAAEsG,EAAE4D,UAAUiB,OAAO,WAAW,OAAO3D,KAAK5H,IAAI,EAAE0G,EAAE4D,UAAUkB,SAAS,SAAStC,GAAG,OAAOtB,KAAK5H,KAAKkJ,EAAEtB,IAAI,EAAElB,EAAE4D,UAAUE,KAAK,SAAStB,EAAEhI,GAAG,IAAI,IAAI8D,EAAE,GAAGkE,GAAGA,EAAEiB,KAAKjJ,EAAEK,KAAKkK,MAAMvK,EAAEgI,EAAEgB,UAAUlF,EAAEzD,KAAKkK,MAAMzG,EAAEkE,EAAEgB,UAAUhB,EAAElE,EAAEqF,MAAM,OAAOnJ,CAAC,EAAEwF,EAAE4D,UAAUQ,OAAO,SAAS5B,EAAEhI,EAAE8D,EAAE0B,GAAG,IAAIvD,EAAEgG,EAAEnE,EAAE9D,EAAE,EAAEkI,EAAExB,KAAKiC,YAAY,GAAGV,GAAGC,EAAE,OAAOpF,EAAEb,EAAET,EAAEwG,EAAE6B,MAAM7J,EAAE8D,EAAE,IAAI4C,KAAK8C,QAAQvH,EAAEuD,IAAIA,EAAE7E,KAAKkI,KAAKlI,KAAK0H,IAAIJ,GAAGtH,KAAK0H,IAAIH,IAAIA,EAAEvH,KAAKkI,KAAKZ,EAAEtH,KAAK6J,IAAItC,EAAE1C,EAAE,MAAMvD,EAAET,EAAE,KAAKyH,MAAK,EAAGhH,EAAEiH,OAAO1D,EAAE,IAAI2C,EAAExH,KAAKkI,KAAKZ,EAAEC,GAAGE,EAAED,EAAExH,KAAKkI,KAAKlI,KAAK8H,KAAKP,IAAIV,EAAEQ,EAAEhI,EAAE8D,EAAEsE,EAAE1B,KAAKyD,aAAa,IAAI,IAAI7B,EAAEtI,EAAEsI,GAAGxE,EAAEwE,GAAGF,EAAE,CAAC,IAAII,EAAE7H,KAAKwF,IAAImC,EAAEF,EAAE,EAAEtE,GAAG0D,EAAEQ,EAAEM,EAAEE,EAAEL,EAAEzB,KAAK0D,aAAa,IAAI,IAAI/F,EAAEiE,EAAEjE,GAAGmE,EAAEnE,GAAG8D,EAAE,CAAC,IAAInF,EAAErC,KAAKwF,IAAI9B,EAAE8D,EAAE,EAAEK,GAAGvG,EAAE+G,SAAS3I,KAAKqG,KAAKkD,OAAO5B,EAAE3D,EAAErB,EAAEwC,EAAE,GAAG,CAAC,CAAC,OAAO1C,EAAEb,EAAEyE,KAAK8C,QAAQvH,CAAC,EAAEuD,EAAE4D,UAAUqB,eAAe,SAASzC,EAAEhI,EAAE8D,EAAE0B,GAAG,KAAKA,EAAEnF,KAAKL,IAAIA,EAAEiJ,MAAMzD,EAAE/F,OAAO,IAAIqE,GAAG,CAAC,IAAI,IAAI7B,EAAE,IAAIa,EAAE,IAAImF,OAAE,EAAOC,EAAE,EAAEA,EAAElI,EAAEgJ,SAASvJ,OAAOyI,IAAI,CAAC,IAAIC,EAAEnI,EAAEgJ,SAASd,GAAGE,EAAEE,EAAEH,GAAGK,GAAGnE,EAAE2D,EAAEhF,EAAEmF,GAAGxH,KAAKC,IAAIoC,EAAE7D,KAAKkF,EAAElF,MAAMwB,KAAKwF,IAAInD,EAAE/D,KAAKoF,EAAEpF,QAAQ0B,KAAKC,IAAIoC,EAAE5D,KAAKiF,EAAEjF,MAAMuB,KAAKwF,IAAInD,EAAE9D,KAAKmF,EAAEnF,OAAOkJ,GAAGI,EAAE1F,GAAGA,EAAE0F,EAAEvG,EAAEmG,EAAEnG,EAAEmG,EAAEnG,EAAEgG,EAAEE,GAAGK,IAAI1F,GAAGsF,EAAEnG,IAAIA,EAAEmG,EAAEH,EAAEE,EAAE,CAACnI,EAAEiI,GAAGjI,EAAEgJ,SAAS,EAAE,CAAC,IAAI3E,EAAErB,EAAE,OAAOhD,CAAC,EAAEwF,EAAE4D,UAAUW,QAAQ,SAAS/B,EAAEhI,EAAE8D,GAAG,IAAI0B,EAAE1B,EAAEkE,EAAEtB,KAAK8C,OAAOxB,GAAG/F,EAAE,GAAGa,EAAE4D,KAAK+D,eAAejF,EAAEkB,KAAK5H,KAAKkB,EAAEiC,GAAG,IAAIa,EAAEkG,SAAS3I,KAAK2H,GAAGE,EAAEpF,EAAE0C,GAAGxF,GAAG,GAAGiC,EAAEjC,GAAGgJ,SAASvJ,OAAOiH,KAAKiC,aAAajC,KAAKgE,OAAOzI,EAAEjC,GAAGA,IAAI0G,KAAKiE,oBAAoBnF,EAAEvD,EAAEjC,EAAE,EAAEwF,EAAE4D,UAAUsB,OAAO,SAAS1C,EAAEhI,GAAG,IAAI8D,EAAEkE,EAAEhI,GAAGwF,EAAE1B,EAAEkF,SAASvJ,OAAOwC,EAAEyE,KAAKkC,YAAYlC,KAAKkE,iBAAiB9G,EAAE7B,EAAEuD,GAAG,IAAIyC,EAAEvB,KAAKmE,kBAAkB/G,EAAE7B,EAAEuD,GAAG0C,EAAE1G,EAAEsC,EAAEkF,SAASiB,OAAOhC,EAAEnE,EAAEkF,SAASvJ,OAAOwI,IAAIC,EAAEgB,OAAOpF,EAAEoF,OAAOhB,EAAEe,KAAKnF,EAAEmF,KAAKnG,EAAEgB,EAAE4C,KAAK8C,QAAQ1G,EAAEoF,EAAExB,KAAK8C,QAAQxJ,EAAEgI,EAAEhI,EAAE,GAAGgJ,SAAS3I,KAAK6H,GAAGxB,KAAKoD,WAAWhG,EAAEoE,EAAE,EAAE1C,EAAE4D,UAAUU,WAAW,SAAS9B,EAAEhI,GAAG0G,KAAK5H,KAAK0C,EAAE,CAACwG,EAAEhI,IAAI0G,KAAK5H,KAAKoK,OAAOlB,EAAEkB,OAAO,EAAExC,KAAK5H,KAAKmK,MAAK,EAAGnG,EAAE4D,KAAK5H,KAAK4H,KAAK8C,OAAO,EAAEhE,EAAE4D,UAAUyB,kBAAkB,SAAS7C,EAAEhI,EAAE8D,GAAG,IAAI,IAAI0B,EAAEvD,EAAEa,EAAEoF,EAAEC,EAAEC,EAAEI,EAAEnE,EAAE,IAAIrB,EAAE,IAAIxB,EAAExB,EAAEwB,GAAGsC,EAAE9D,EAAEwB,IAAI,CAAC,IAAIgG,EAAES,EAAED,EAAE,EAAExG,EAAEkF,KAAK8C,QAAQnK,EAAE4I,EAAED,EAAExG,EAAEsC,EAAE4C,KAAK8C,QAAQsB,GAAG7I,EAAEuF,EAAE1E,EAAEzD,EAAE6I,OAAE,EAAOC,OAAE,EAAOC,OAAE,EAAOI,OAAE,EAAON,EAAEvH,KAAKC,IAAIqB,EAAEhD,KAAK6D,EAAE7D,MAAMkJ,EAAExH,KAAKC,IAAIqB,EAAE/C,KAAK4D,EAAE5D,MAAMkJ,EAAEzH,KAAKwF,IAAIlE,EAAE9C,KAAK2D,EAAE3D,MAAMqJ,EAAE7H,KAAKwF,IAAIlE,EAAE7C,KAAK0D,EAAE1D,MAAMuB,KAAKC,IAAI,EAAEwH,EAAEF,GAAGvH,KAAKC,IAAI,EAAE4H,EAAEL,IAAI4C,EAAEzC,EAAEd,GAAGc,EAAEjJ,GAAGyL,EAAEzG,GAAGA,EAAEyG,EAAEtF,EAAEhE,EAAEwB,EAAE+H,EAAE/H,EAAE+H,EAAE/H,GAAG8H,IAAIzG,GAAG0G,EAAE/H,IAAIA,EAAE+H,EAAEvF,EAAEhE,EAAE,CAAC,OAAOgE,GAAG1B,EAAE9D,CAAC,EAAEwF,EAAE4D,UAAUwB,iBAAiB,SAAS5C,EAAEhI,EAAE8D,GAAG,IAAI0B,EAAEwC,EAAEiB,KAAKvC,KAAKyD,YAAYhC,EAAElG,EAAE+F,EAAEiB,KAAKvC,KAAK0D,YAAYhC,EAAE1B,KAAKsE,eAAehD,EAAEhI,EAAE8D,EAAE0B,GAAGkB,KAAKsE,eAAehD,EAAEhI,EAAE8D,EAAE7B,IAAI+F,EAAEgB,SAASzI,KAAKiF,EAAE,EAAEA,EAAE4D,UAAU4B,eAAe,SAAShD,EAAEhI,EAAE8D,EAAE0B,GAAGwC,EAAEgB,SAASzI,KAAKiF,GAAG,IAAI,IAAIvD,EAAEyE,KAAK8C,OAAO1G,EAAEmF,EAAED,EAAE,EAAEhI,EAAEiC,GAAGkG,EAAEF,EAAED,EAAElE,EAAE9D,EAAE8D,EAAE7B,GAAGmG,EAAEI,EAAE1F,GAAG0F,EAAEL,GAAGG,EAAEtI,EAAEsI,EAAExE,EAAE9D,EAAEsI,IAAI,CAAC,IAAIjE,EAAE2D,EAAEgB,SAASV,GAAGJ,EAAEpF,EAAEkF,EAAEiB,KAAKhH,EAAEoC,GAAGA,GAAG+D,GAAGI,EAAE1F,EAAE,CAAC,IAAI,IAAIE,EAAEc,EAAE9D,EAAE,EAAEgD,GAAGhD,EAAEgD,IAAI,CAAC,IAAIxB,EAAEwG,EAAEgB,SAAShG,GAAGkF,EAAEC,EAAEH,EAAEiB,KAAKhH,EAAET,GAAGA,GAAG4G,GAAGI,EAAEL,EAAE,CAAC,OAAOC,CAAC,EAAE5C,EAAE4D,UAAUuB,oBAAoB,SAAS3C,EAAEhI,EAAE8D,GAAG,IAAI,IAAI0B,EAAE1B,EAAE0B,GAAG,EAAEA,IAAI0C,EAAElI,EAAEwF,GAAGwC,EAAE,EAAExC,EAAE4D,UAAUc,UAAU,SAASlC,GAAG,IAAI,IAAIhI,EAAEgI,EAAEvI,OAAO,EAAEqE,OAAE,EAAO9D,GAAG,EAAEA,IAAI,IAAIgI,EAAEhI,GAAGgJ,SAASvJ,OAAOO,EAAE,GAAG8D,EAAEkE,EAAEhI,EAAE,GAAGgJ,UAAUiB,OAAOnG,EAAEiF,QAAQf,EAAEhI,IAAI,GAAG0G,KAAKoC,QAAQhG,EAAEkF,EAAEhI,GAAG0G,KAAK8C,OAAO,EAAEhE,CAAC,CAAzuMxF,E,iCCGnF6G,EAAOC,QAAU,WAChB,GAAsB,oBAAXoe,QAAiE,oBAAjCZ,OAAOa,sBAAwC,OAAO,EACjG,GAA+B,kBAApBD,OAAOE,SAAyB,OAAO,EAElD,IAAIC,EAAM,CAAC,EACPC,EAAMJ,OAAO,QACbK,EAASjB,OAAOgB,GACpB,GAAmB,kBAARA,EAAoB,OAAO,EAEtC,GAA4C,oBAAxChB,OAAOlb,UAAUmb,SAASC,KAAKc,GAA8B,OAAO,EACxE,GAA+C,oBAA3ChB,OAAOlb,UAAUmb,SAASC,KAAKe,GAAiC,OAAO,EAY3E,IAAKD,KADLD,EAAIC,GADS,GAEDD,EAAO,OAAO,EAC1B,GAA2B,oBAAhBf,OAAOkB,MAAmD,IAA5BlB,OAAOkB,KAAKH,GAAK5lB,OAAgB,OAAO,EAEjF,GAA0C,oBAA/B6kB,OAAOmB,qBAAiF,IAA3CnB,OAAOmB,oBAAoBJ,GAAK5lB,OAAgB,OAAO,EAE/G,IAAIimB,EAAOpB,OAAOa,sBAAsBE,GACxC,GAAoB,IAAhBK,EAAKjmB,QAAgBimB,EAAK,KAAOJ,EAAO,OAAO,EAEnD,IAAKhB,OAAOlb,UAAUuc,qBAAqBnB,KAAKa,EAAKC,GAAQ,OAAO,EAEpE,GAA+C,oBAApChB,OAAOsB,yBAAyC,CAC1D,IAAIC,EAAavB,OAAOsB,yBAAyBP,EAAKC,GACtD,GAdY,KAcRO,EAAWC,QAA8C,IAA1BD,EAAWE,WAAuB,OAAO,CAC7E,CAEA,OAAO,CACR,C,qCCvCA,IAAIC,EAAate,EAAQ,OAEzBb,EAAOC,QAAU,WAChB,OAAOkf,OAAkBd,OAAOe,WACjC,C,iCCJA,IAAIC,EAAc,SAAUJ,GAC3B,OAAOA,IAAUA,CAClB,EAEAjf,EAAOC,QAAU,SAAYhE,EAAGC,GAC/B,OAAU,IAAND,GAAiB,IAANC,EACP,EAAID,IAAM,EAAIC,EAElBD,IAAMC,MAGNmjB,EAAYpjB,KAAMojB,EAAYnjB,GAInC,C,qCCfA,IAAIojB,EAAiBze,EAAQ,OAE7Bb,EAAOC,QAAU,WAChB,MAA4B,oBAAdwd,OAAO8B,GAAoB9B,OAAO8B,GAAKD,CACtD,C,qCCJA,IAAIE,EAAc3e,EAAQ,OACtB4e,EAAS5e,EAAQ,MAErBb,EAAOC,QAAU,WAChB,IAAIyf,EAAWF,IAMf,OALAC,EAAOhC,OAAQ,CAAE8B,GAAIG,GAAY,CAChCH,GAAI,WACH,OAAO9B,OAAO8B,KAAOG,CACtB,IAEMA,CACR,C,qCCXA,IAAIC,EACJ,IAAKlC,OAAOkB,KAAM,CAEjB,IAAIiB,EAAMnC,OAAOlb,UAAUmM,eACvB8O,EAAQC,OAAOlb,UAAUmb,SACzBmC,EAAShf,EAAQ,OACjBif,EAAerC,OAAOlb,UAAUuc,qBAChCiB,GAAkBD,EAAanC,KAAK,CAAED,SAAU,MAAQ,YACxDsC,EAAkBF,EAAanC,MAAK,WAAa,GAAG,aACpDsC,EAAY,CACf,WACA,iBACA,UACA,iBACA,gBACA,uBACA,eAEGC,EAA6B,SAAU7e,GAC1C,IAAI8e,EAAO9e,EAAEyD,YACb,OAAOqb,GAAQA,EAAK5d,YAAclB,CACnC,EACI+e,EAAe,CAClBC,mBAAmB,EACnBC,UAAU,EACVC,WAAW,EACXC,QAAQ,EACRC,eAAe,EACfC,SAAS,EACTC,cAAc,EACdC,aAAa,EACbC,wBAAwB,EACxBC,uBAAuB,EACvBC,cAAc,EACdC,aAAa,EACbC,cAAc,EACdC,cAAc,EACdC,SAAS,EACTC,aAAa,EACbC,YAAY,EACZC,UAAU,EACVC,UAAU,EACVC,OAAO,EACPC,kBAAkB,EAClBC,oBAAoB,EACpBC,SAAS,GAENC,EAA4B,WAE/B,GAAsB,qBAAXC,OAA0B,OAAO,EAC5C,IAAK,IAAIxa,KAAKwa,OACb,IACC,IAAKzB,EAAa,IAAM/Y,IAAMuY,EAAIjC,KAAKkE,OAAQxa,IAAoB,OAAdwa,OAAOxa,IAAoC,kBAAdwa,OAAOxa,GACxF,IACC6Y,EAA2B2B,OAAOxa,GACnC,CAAE,MAAOjM,GACR,OAAO,CACR,CAEF,CAAE,MAAOA,GACR,OAAO,CACR,CAED,OAAO,CACR,CAjBgC,GA8BhCukB,EAAW,SAAcpU,GACxB,IAAIuW,EAAsB,OAAXvW,GAAqC,kBAAXA,EACrCwW,EAAoC,sBAAvBvE,EAAMG,KAAKpS,GACxByW,EAAcnC,EAAOtU,GACrB0W,EAAWH,GAAmC,oBAAvBtE,EAAMG,KAAKpS,GAClC2W,EAAU,GAEd,IAAKJ,IAAaC,IAAeC,EAChC,MAAM,IAAIpE,UAAU,sCAGrB,IAAIuE,EAAYnC,GAAmB+B,EACnC,GAAIE,GAAY1W,EAAO3S,OAAS,IAAMgnB,EAAIjC,KAAKpS,EAAQ,GACtD,IAAK,IAAIpS,EAAI,EAAGA,EAAIoS,EAAO3S,SAAUO,EACpC+oB,EAAQ1oB,KAAK4oB,OAAOjpB,IAItB,GAAI6oB,GAAezW,EAAO3S,OAAS,EAClC,IAAK,IAAImH,EAAI,EAAGA,EAAIwL,EAAO3S,SAAUmH,EACpCmiB,EAAQ1oB,KAAK4oB,OAAOriB,SAGrB,IAAK,IAAIiB,KAAQuK,EACV4W,GAAsB,cAATnhB,IAAyB4e,EAAIjC,KAAKpS,EAAQvK,IAC5DkhB,EAAQ1oB,KAAK4oB,OAAOphB,IAKvB,GAAI+e,EAGH,IAFA,IAAIsC,EA3CqC,SAAUhhB,GAEpD,GAAsB,qBAAXwgB,SAA2BD,EACrC,OAAO1B,EAA2B7e,GAEnC,IACC,OAAO6e,EAA2B7e,EACnC,CAAE,MAAOjG,GACR,OAAO,CACR,CACD,CAiCwBknB,CAAqC/W,GAElDlE,EAAI,EAAGA,EAAI4Y,EAAUrnB,SAAUyO,EACjCgb,GAAoC,gBAAjBpC,EAAU5Y,KAAyBuY,EAAIjC,KAAKpS,EAAQ0U,EAAU5Y,KACtF6a,EAAQ1oB,KAAKymB,EAAU5Y,IAI1B,OAAO6a,CACR,CACD,CACAliB,EAAOC,QAAU0f,C,iCCvHjB,IAAInC,EAAQC,OAAOlb,UAAUmb,SAE7B1d,EAAOC,QAAU,SAAqBgf,GACrC,IAAIsD,EAAM/E,EAAMG,KAAKsB,GACjBY,EAAiB,uBAAR0C,EASb,OARK1C,IACJA,EAAiB,mBAAR0C,GACE,OAAVtD,GACiB,kBAAVA,GACiB,kBAAjBA,EAAMrmB,QACbqmB,EAAMrmB,QAAU,GACa,sBAA7B4kB,EAAMG,KAAKsB,EAAMuD,SAEZ3C,CACR,C,oBChBA7f,EAAOC,QAAU,SAA6B4F,EAAO4c,EAAIxoB,EAAOC,GAC5D,IAAI1B,EAAIqN,EAAM,GAAIpN,EAAIoN,EAAM,GACxBpH,GAAS,OACCqd,IAAV7hB,IAAqBA,EAAQ,QACrB6hB,IAAR5hB,IAAmBA,EAAMuoB,EAAG7pB,QAEhC,IADA,IAAIQ,GAAOc,EAAID,GAAO,EACbd,EAAI,EAAG4G,EAAI3G,EAAM,EAAGD,EAAIC,EAAK2G,EAAI5G,IAAK,CAC3C,IAAIupB,EAAKD,EAAGxoB,EAAQ,EAAFd,EAAI,GAAIwpB,EAAKF,EAAGxoB,EAAQ,EAAFd,EAAI,GACxCypB,EAAKH,EAAGxoB,EAAQ,EAAF8F,EAAI,GAAI8iB,EAAKJ,EAAGxoB,EAAQ,EAAF8F,EAAI,GAC1B4iB,EAAKlqB,IAAQoqB,EAAKpqB,GAC5BD,GAAKoqB,EAAKF,IAAOjqB,EAAIkqB,IAAOE,EAAKF,GAAMD,IAChCjkB,GAAUA,EAC7B,CACA,OAAOA,CACX,C,mBCXAuB,EAAOC,QAAU,SAA+B4F,EAAO4c,EAAIxoB,EAAOC,GAC9D,IAAI1B,EAAIqN,EAAM,GAAIpN,EAAIoN,EAAM,GACxBpH,GAAS,OACCqd,IAAV7hB,IAAqBA,EAAQ,QACrB6hB,IAAR5hB,IAAmBA,EAAMuoB,EAAG7pB,QAEhC,IADA,IAAIQ,EAAMc,EAAMD,EACPd,EAAI,EAAG4G,EAAI3G,EAAM,EAAGD,EAAIC,EAAK2G,EAAI5G,IAAK,CAC3C,IAAIupB,EAAKD,EAAGtpB,EAAEc,GAAO,GAAI0oB,EAAKF,EAAGtpB,EAAEc,GAAO,GACtC2oB,EAAKH,EAAG1iB,EAAE9F,GAAO,GAAI4oB,EAAKJ,EAAG1iB,EAAE9F,GAAO,GACxB0oB,EAAKlqB,IAAQoqB,EAAKpqB,GAC5BD,GAAKoqB,EAAKF,IAAOjqB,EAAIkqB,IAAOE,EAAKF,GAAMD,IAChCjkB,GAAUA,EAC7B,CACA,OAAOA,CACX,C,oBChBgEuB,EAAOC,QAG9D,WAAc,aAEvB,SAAS6iB,EAAYC,EAAK1b,EAAG+J,EAAMC,EAAO7M,GACtCwe,EAAgBD,EAAK1b,EAAG+J,GAAQ,EAAGC,GAAU0R,EAAInqB,OAAS,EAAI4L,GAAWye,EAC7E,CAEA,SAASD,EAAgBD,EAAK1b,EAAG+J,EAAMC,EAAO7M,GAE1C,KAAO6M,EAAQD,GAAM,CACjB,GAAIC,EAAQD,EAAO,IAAK,CACpB,IAAInU,EAAIoU,EAAQD,EAAO,EACnB5T,EAAI6J,EAAI+J,EAAO,EACfrW,EAAIjB,KAAK0H,IAAIvE,GACbqE,EAAI,GAAMxH,KAAK4H,IAAI,EAAI3G,EAAI,GAC3BmoB,EAAK,GAAMppB,KAAK8H,KAAK7G,EAAIuG,GAAKrE,EAAIqE,GAAKrE,IAAMO,EAAIP,EAAI,EAAI,GAAK,EAAI,GAGtE+lB,EAAgBD,EAAK1b,EAFPvN,KAAKC,IAAIqX,EAAMtX,KAAK+H,MAAMwF,EAAI7J,EAAI8D,EAAIrE,EAAIimB,IACzCppB,KAAKwF,IAAI+R,EAAOvX,KAAK+H,MAAMwF,GAAKpK,EAAIO,GAAK8D,EAAIrE,EAAIimB,IACrB1e,EAC/C,CAEA,IAAIrD,EAAI4hB,EAAI1b,GACRlO,EAAIiY,EACJrR,EAAIsR,EAKR,IAHA8R,EAAKJ,EAAK3R,EAAM/J,GACZ7C,EAAQue,EAAI1R,GAAQlQ,GAAK,GAAGgiB,EAAKJ,EAAK3R,EAAMC,GAEzClY,EAAI4G,GAAG,CAIV,IAHAojB,EAAKJ,EAAK5pB,EAAG4G,GACb5G,IACA4G,IACOyE,EAAQue,EAAI5pB,GAAIgI,GAAK,GAAGhI,IAC/B,KAAOqL,EAAQue,EAAIhjB,GAAIoB,GAAK,GAAGpB,GACnC,CAE8B,IAA1ByE,EAAQue,EAAI3R,GAAOjQ,GAAUgiB,EAAKJ,EAAK3R,EAAMrR,GAG7CojB,EAAKJ,IADLhjB,EACasR,GAGbtR,GAAKsH,IAAG+J,EAAOrR,EAAI,GACnBsH,GAAKtH,IAAGsR,EAAQtR,EAAI,EAC5B,CACJ,CAEA,SAASojB,EAAKJ,EAAK5pB,EAAG4G,GAClB,IAAIqjB,EAAML,EAAI5pB,GACd4pB,EAAI5pB,GAAK4pB,EAAIhjB,GACbgjB,EAAIhjB,GAAKqjB,CACb,CAEA,SAASH,EAAehnB,EAAGC,GACvB,OAAOD,EAAIC,GAAK,EAAID,EAAIC,EAAI,EAAI,CACpC,CAEA,OAAO4mB,CAEP,CA7DiFO,E,qCCCjF,IAAIC,EAAiCziB,EAAAA,OAAAA,iCAEjC0iB,EAAU9F,OACV+F,EAAa5F,UAEjB5d,EAAOC,QAAU,WAChB,GAAY,MAARJ,MAAgBA,OAAS0jB,EAAQ1jB,MACpC,MAAM,IAAI2jB,EAAW,sDAEtB,IAAIljB,EAAS,GAyBb,OAxBIT,KAAK4jB,aACRnjB,GAAU,KAEPT,KAAK6jB,SACRpjB,GAAU,KAEPT,KAAK8jB,aACRrjB,GAAU,KAEPT,KAAK+jB,YACRtjB,GAAU,KAEPT,KAAKgkB,SACRvjB,GAAU,KAEPT,KAAKikB,UACRxjB,GAAU,KAEPT,KAAKkkB,cACRzjB,GAAU,KAEPT,KAAKmkB,SACR1jB,GAAU,KAEJA,CACR,EAEIgjB,GAAkC7F,OAAOwG,gBAC5CxG,OAAOwG,eAAejkB,EAAOC,QAAS,OAAtCwd,CAAgDwB,MAAO,a,qCCtCxD,IAAIK,EAAiBze,EAAQ,OAEzBqjB,EAAsBrjB,EAAAA,MAAAA,oBACtBsjB,EAAQ1G,OAAOsB,yBAEnB/e,EAAOC,QAAU,WAChB,GAAIikB,GAA0C,QAAlB,OAAQE,MAAiB,CACpD,IAAIpF,EAAamF,EAAME,OAAO9hB,UAAW,SACzC,GACCyc,GAC6B,oBAAnBA,EAAWsF,KACiB,mBAA5BD,OAAO9hB,UAAUshB,QACe,mBAAhCQ,OAAO9hB,UAAUkhB,WAC1B,CAED,IAAIc,EAAQ,GACRljB,EAAI,CAAC,EAWT,GAVAoc,OAAOwG,eAAe5iB,EAAG,aAAc,CACtCijB,IAAK,WACJC,GAAS,GACV,IAED9G,OAAOwG,eAAe5iB,EAAG,SAAU,CAClCijB,IAAK,WACJC,GAAS,GACV,IAEa,OAAVA,EACH,OAAOvF,EAAWsF,GAEpB,CACD,CACA,OAAOhF,CACR,C,qCCjCA,IAAI4E,EAAsBrjB,EAAAA,MAAAA,oBACtB2e,EAAc3e,EAAQ,OACtB2jB,EAAO/G,OAAOsB,yBACdkF,EAAiBxG,OAAOwG,eACxBQ,EAAU7G,UACV8G,EAAWjH,OAAOkH,eAClBC,EAAQ,IAEZ5kB,EAAOC,QAAU,WAChB,IAAKikB,IAAwBQ,EAC5B,MAAM,IAAID,EAAQ,6FAEnB,IAAI/E,EAAWF,IACXqF,EAAQH,EAASE,GACjB5F,EAAawF,EAAKK,EAAO,SAQ7B,OAPK7F,GAAcA,EAAWsF,MAAQ5E,GACrCuE,EAAeY,EAAO,QAAS,CAC9BC,cAAc,EACd5F,YAAY,EACZoF,IAAK5E,IAGAA,CACR,C,sBCzB8K,SAASve,GAAG,aAAa,MAAM/F,EAAE,UAAU6B,EAAE,sBAAsB,SAAS0B,EAAEwC,EAAE/F,EAAE6B,EAAE0B,EAAE0C,GAAG,IAAII,EAAEtI,EAAEwI,EAAExF,EAAEmF,EAAElG,EAAE,GAAGa,EAAE0C,EAAE,GAAGgC,EAAE,EAAEY,EAAE,EAAEtF,EAAEqF,GAAGrF,GAAGqF,GAAGG,EAAEH,EAAEA,EAAElG,IAAIuF,KAAKc,EAAExF,EAAEA,EAAE0C,IAAI4C,IAAI,IAAI5G,EAAE,EAAE,GAAGgG,EAAEQ,GAAGI,EAAEtE,EAAE,IAAIhB,EAAEqF,GAAGrF,GAAGqF,GAAGK,EAAEF,IAAItI,EAAEmI,EAAEG,GAAGH,GAAGA,EAAElG,IAAIuF,KAAKgB,EAAEF,IAAItI,EAAE8C,EAAEwF,GAAGxF,GAAGA,EAAE0C,IAAI4C,IAAIE,EAAEtI,EAAE,IAAIwI,IAAIN,EAAE1G,KAAKgH,GAAGhB,EAAEQ,GAAGI,EAAEtE,GAAGhB,EAAEqF,GAAGrF,GAAGqF,GAAGK,EAAEF,IAAItI,EAAEsI,EAAEH,IAAInF,EAAEhD,EAAEsI,KAAKH,EAAEnF,GAAGmF,EAAElG,IAAIuF,KAAKgB,EAAEF,IAAItI,EAAEsI,EAAExF,IAAIE,EAAEhD,EAAEsI,KAAKxF,EAAEE,GAAGF,EAAE0C,IAAI4C,IAAIE,EAAEtI,EAAE,IAAIwI,IAAIN,EAAE1G,KAAKgH,GAAG,KAAKhB,EAAEQ,GAAGQ,EAAEF,IAAItI,EAAEsI,EAAEH,IAAInF,EAAEhD,EAAEsI,KAAKH,EAAEnF,GAAGmF,EAAElG,IAAIuF,GAAGc,EAAEtI,EAAE,IAAIwI,IAAIN,EAAE1G,KAAKgH,GAAG,KAAKJ,EAAEtE,GAAG0E,EAAEF,IAAItI,EAAEsI,EAAExF,IAAIE,EAAEhD,EAAEsI,KAAKxF,EAAEE,GAAGF,EAAE0C,IAAI4C,GAAGE,EAAEtI,EAAE,IAAIwI,IAAIN,EAAE1G,KAAKgH,GAAG,OAAO,IAAIF,GAAG,IAAI9G,IAAI0G,EAAE1G,KAAK8G,GAAG9G,CAAC,CAAC,SAAS0G,EAAEF,GAAG,OAAO,IAAI4jB,aAAa5jB,EAAE,CAAC,MAAMM,EAAE,sBAAsBtI,EAAE,sBAAsBwI,EAAE,sBAAsBxF,EAAEkF,EAAE,GAAGC,EAAED,EAAE,GAAGpF,EAAEoF,EAAE,IAAIV,EAAEU,EAAE,IAAIE,EAAEF,EAAE,GAAGF,EAAE6jB,SAAS,SAAS7jB,EAAEE,EAAE1G,EAAEuB,EAAEzD,EAAE2I,GAAG,MAAM8C,GAAG7C,EAAED,IAAIzG,EAAElC,GAAGD,GAAG2I,EAAE1I,IAAIyD,EAAEkF,GAAGrB,EAAEmE,EAAE1L,EAAE,GAAG,IAAI0L,GAAG,IAAI1L,GAAG0L,EAAE,GAAG1L,EAAE,EAAE,OAAOuH,EAAE,MAAMvC,EAAE1D,KAAKmE,IAAIiG,EAAE1L,GAAG,OAAOsB,KAAKmE,IAAI8B,IAAI0B,EAAEjE,EAAEuC,GAAG,SAASoB,EAAEE,EAAEI,EAAE9G,EAAEuB,EAAEzD,EAAE2I,GAAG,IAAI8C,EAAE1L,EAAEuH,EAAEvC,EAAEyS,EAAEhM,EAAEyE,EAAEuc,EAAEC,EAAEC,EAAE3U,EAAE4U,EAAE/d,EAAElM,EAAEJ,EAAEsqB,EAAEhV,EAAEiV,EAAE,MAAMC,EAAEpkB,EAAEjF,EAAEspB,EAAE/jB,EAAEvF,EAAEupB,EAAEpkB,EAAE5I,EAAEitB,EAAE/qB,EAAElC,EAAEwX,GAAGlV,GAAGkqB,EAAEM,GAAG7c,GAAGzE,EAAE7I,EAAEmqB,IAAIthB,EAAEshB,MAAMJ,EAAEO,GAAGR,GAAGjhB,EAAE7I,EAAEsqB,IAAIzhB,EAAEyhB,OAAOvqB,EAAEoqB,EAAEG,GAAGhd,EAAEwc,EAAED,EAAEC,EAAExc,EAAEyc,KAAK3U,EAAEzV,GAAGsV,GAAG4U,EAAEQ,GAAG/c,GAAGzE,EAAE7I,EAAEqqB,IAAIxhB,EAAEwhB,MAAMN,EAAEK,GAAGN,GAAGjhB,EAAE7I,EAAEoqB,IAAIvhB,EAAEuhB,OAAOH,EAAEI,EAAED,GAAG9c,EAAEwc,EAAED,EAAEC,EAAExc,EAAEyc,KAAKhpB,EAAE,GAAGpB,GAAGyV,EAAEP,IAAIA,EAAEI,GAAGJ,GAAG5I,EAAElM,IAAIiqB,EAAEjqB,EAAEqV,IAAIP,EAAEmV,EAAEjqB,KAAKqV,EAAEP,KAAKO,EAAEnJ,EAAEge,GAAGlpB,EAAE,GAAGkL,GAAGmJ,EAAEP,IAAIA,EAAEoV,GAAGpV,GAAGqV,EAAEF,EAAE5U,GAAG4U,EAAEjpB,EAAE,GAAGipB,GAAGE,EAAErV,IAAIO,EAAEP,GAAG9T,EAAE,GAAGmpB,EAAE,IAAIK,EAAE,SAASxkB,EAAE/F,GAAG,IAAI6B,EAAE7B,EAAE,GAAG,IAAI,IAAIuD,EAAE,EAAEA,EAAEwC,EAAExC,IAAI1B,GAAG7B,EAAEuD,GAAG,OAAO1B,CAAC,CAA7D,CAA+D,EAAEd,GAAGypB,EAAEzsB,EAAEiI,EAAE,GAAGukB,GAAGC,IAAID,GAAGC,EAAE,OAAOD,EAAE,GAAGzhB,EAAE/C,GAAGokB,GAAGtV,EAAE9O,EAAEokB,KAAKtV,EAAE/T,GAAG6D,EAAE0B,GAAG+jB,GAAGvV,EAAExO,EAAE+jB,KAAKvV,EAAE/T,GAAG1D,EAAE6I,GAAGokB,GAAGxV,EAAE5O,EAAEokB,KAAKxV,EAAExX,GAAG+E,EAAE7C,GAAG+qB,GAAGzV,EAAEtV,EAAE+qB,KAAKzV,EAAExX,GAAG,IAAIyL,GAAG,IAAI1L,GAAG,IAAIuH,GAAG,IAAIvC,EAAE,OAAOmoB,EAAE,GAAGC,EAAEjkB,EAAEP,EAAEnE,EAAEnD,KAAKmE,IAAI0nB,IAAIA,GAAGJ,EAAE/nB,EAAEkoB,EAAExhB,GAAGuhB,EAAE1lB,EAAEylB,EAAEhtB,KAAKotB,IAAID,GAAGC,EAAE,OAAOD,EAAE1V,GAAGlV,GAAGkqB,EAAE/gB,GAAGwE,GAAGzE,EAAE7I,EAAE8I,IAAID,EAAEC,MAAMihB,EAAEO,GAAGR,GAAGjhB,EAAE7I,EAAEsqB,IAAIzhB,EAAEyhB,OAAOvqB,EAAE+I,EAAEwhB,GAAGhd,EAAEwc,EAAED,EAAEC,EAAExc,EAAEyc,KAAK3U,EAAEzV,GAAGsV,GAAG4U,EAAEzsB,GAAGkQ,GAAGzE,EAAE7I,EAAE5C,IAAIyL,EAAEzL,MAAM2sB,EAAEK,GAAGN,GAAGjhB,EAAE7I,EAAEoqB,IAAIvhB,EAAEuhB,OAAOH,EAAE7sB,EAAEgtB,GAAG9c,EAAEwc,EAAED,EAAEC,EAAExc,EAAEyc,KAAK5jB,EAAE,GAAGxG,GAAGyV,EAAEP,IAAIA,EAAEI,GAAGJ,GAAG5I,EAAElM,IAAIiqB,EAAEjqB,EAAEqV,IAAIP,EAAEmV,EAAEjqB,KAAKqV,EAAEP,KAAKO,EAAEnJ,EAAEge,GAAG9jB,EAAE,GAAG8F,GAAGmJ,EAAEP,IAAIA,EAAEoV,GAAGpV,GAAGqV,EAAEF,EAAE5U,GAAG4U,EAAE7jB,EAAE,GAAG6jB,GAAGE,EAAErV,IAAIO,EAAEP,GAAG1O,EAAE,GAAG+jB,EAAE,MAAMhV,EAAE3R,EAAE,EAAExC,EAAE,EAAEoF,EAAED,GAAG2O,GAAGlV,GAAGkqB,EAAEM,GAAG7c,GAAGzE,EAAE7I,EAAEmqB,IAAIthB,EAAEshB,MAAMJ,EAAE3nB,GAAG0nB,GAAGjhB,EAAE7I,EAAEoC,IAAIyG,EAAEzG,OAAOrC,EAAEoqB,EAAE/nB,GAAGkL,EAAEwc,EAAED,EAAEC,EAAExc,EAAEyc,KAAK3U,EAAEzV,GAAGsV,GAAG4U,EAAEQ,GAAG/c,GAAGzE,EAAE7I,EAAEqqB,IAAIxhB,EAAEwhB,MAAMN,EAAEplB,GAAGmlB,GAAGjhB,EAAE7I,EAAE2E,IAAIkE,EAAElE,OAAOslB,EAAEI,EAAE1lB,GAAG2I,EAAEwc,EAAED,EAAEC,EAAExc,EAAEyc,KAAK5jB,EAAE,GAAGxG,GAAGyV,EAAEP,IAAIA,EAAEI,GAAGJ,GAAG5I,EAAElM,IAAIiqB,EAAEjqB,EAAEqV,IAAIP,EAAEmV,EAAEjqB,KAAKqV,EAAEP,KAAKO,EAAEnJ,EAAEge,GAAG9jB,EAAE,GAAG8F,GAAGmJ,EAAEP,IAAIA,EAAEoV,GAAGpV,GAAGqV,EAAEF,EAAE5U,GAAG4U,EAAE7jB,EAAE,GAAG6jB,GAAGE,EAAErV,IAAIO,EAAEP,GAAG1O,EAAE,GAAG+jB,EAAE,MAAM7U,EAAE9R,EAAE2R,EAAEhP,EAAE,EAAEC,EAAEtF,GAAGgU,GAAGlV,GAAGkqB,EAAE/gB,GAAGwE,GAAGzE,EAAE7I,EAAE8I,IAAID,EAAEC,MAAMihB,EAAE3nB,GAAG0nB,GAAGjhB,EAAE7I,EAAEoC,IAAIyG,EAAEzG,OAAOrC,EAAE+I,EAAE1G,GAAGkL,EAAEwc,EAAED,EAAEC,EAAExc,EAAEyc,KAAK3U,EAAEzV,GAAGsV,GAAG4U,EAAEzsB,GAAGkQ,GAAGzE,EAAE7I,EAAE5C,IAAIyL,EAAEzL,MAAM2sB,EAAEplB,GAAGmlB,GAAGjhB,EAAE7I,EAAE2E,IAAIkE,EAAElE,OAAOslB,EAAE7sB,EAAEuH,GAAG2I,EAAEwc,EAAED,EAAEC,EAAExc,EAAEyc,KAAK5jB,EAAE,GAAGxG,GAAGyV,EAAEP,IAAIA,EAAEI,GAAGJ,GAAG5I,EAAElM,IAAIiqB,EAAEjqB,EAAEqV,IAAIP,EAAEmV,EAAEjqB,KAAKqV,EAAEP,KAAKO,EAAEnJ,EAAEge,GAAG9jB,EAAE,GAAG8F,GAAGmJ,EAAEP,IAAIA,EAAEoV,GAAGpV,GAAGqV,EAAEF,EAAE5U,GAAG4U,EAAE7jB,EAAE,GAAG6jB,GAAGE,EAAErV,IAAIO,EAAEP,GAAG1O,EAAE,GAAG+jB,EAAE,MAAMO,EAAElnB,EAAE8R,EAAExU,EAAE,EAAEsF,EAAEZ,GAAG,OAAOA,EAAEklB,EAAE,EAAE,CAAlhD,CAAohD1kB,EAAEE,EAAE1G,EAAEuB,EAAEzD,EAAE2I,EAAE5D,EAAE,EAAE2D,EAAE2kB,aAAa,SAAS3kB,EAAE/F,EAAE6B,EAAE0B,EAAE0C,EAAEI,GAAG,OAAOrG,EAAEqG,IAAIxE,EAAEoE,IAAIF,EAAEE,IAAI1C,EAAE8C,EAAE,EAAEgc,OAAOwG,eAAe9iB,EAAE,aAAa,CAAC8d,OAAM,GAAI,CAAhnF7jB,CAAE6E,E,gCCAtED,EAAOC,QAAU,CAIhB8lB,OAJgB,SAITvU,EAAG+G,EAAG3W,GAIZ,IAHA,IAAIxI,EAAMoY,EAAG5Y,OACTkH,EAAM,EAEF3G,EAAE,EAAEA,EAAEC,EAAID,IAAK,CACtB,IAAIwH,GAAK6Q,EAAGrY,IAAI,IAAMof,EAAGpf,IAAI,GAC7B2G,GAAOa,EAAEA,CACT,CAED,OAAOiB,EAAM9H,KAAK8H,KAAK9B,GAAOA,CAC9B,EAEDkmB,QAhBgB,SAgBRxU,EAAG+G,EAAG3W,GAIb,IAHA,IAAIxI,EAAMoY,EAAG5Y,OACTkH,EAAM,EAEF3G,EAAE,EAAEA,EAAEC,EAAID,IACjB2G,GAAOhG,KAAKmE,KAAKuT,EAAGrY,IAAI,IAAMof,EAAGpf,IAAI,IAItC,OAAOyI,EAAM9H,KAAK8H,KAAK9B,GAAOA,CAC9B,EAKDsc,KA/BgB,SA+BX5K,EAAG+G,EAAG3W,GACV,IAAIjB,EAAI7G,KAAKmE,IAAIuT,EAAG+G,GACpB,OAAO3W,EAAMjB,EAAIA,EAAEA,CACnB,E,qCClCF,IACCslB,EAAWplB,EAAQ,MACnBklB,EAASE,EAASF,OAClB3J,EAAO6J,EAAS7J,KAEjBpc,EAAOC,QAAU,CAChBimB,OADgB,SACTjuB,EAAKoP,GAKX,IAJA,IAAI/C,EAAM,CAAC,EAAG6hB,EAAK,GAAIhlB,EAAIkG,GAAG,EAC1BjO,EAAMnB,EAAKW,OACXwtB,EAAQnuB,EAAK,GAAGW,OAAO,EAErButB,EAAGvtB,OAAOyO,GAAMlG,KAAK,GAAG,CAC7B,IAAIR,EAAI1I,EAAK6B,KAAK+H,MAAM/H,KAAKihB,SAAS3hB,IAClC2W,EAAMqW,EAAOzlB,EAAEwd,KAAK,KAAd,GAAwBxd,EAC9B2D,EAAIyL,KACPzL,EAAIyL,IAAO,EACXoW,EAAG3sB,KAAKmH,GAET,CAED,GAAGwlB,EAAGvtB,OAAOyO,EAAG,MAAM,IAAIsS,MAAM,iCAC3B,OAAOwM,CACZ,EAKDE,KAtBgB,SAsBXpuB,EAAKoP,GACT,IAAIuR,EAAW3gB,EAAK,GAAGW,OAAQmtB,EAAS3J,EACpC+J,EAAK,GAAI/sB,EAAMnB,EAAKW,OACpBwtB,EAAQnuB,EAAK,GAAGW,OAAO,EAIvBuD,EAAIlE,EAAK6B,KAAK+H,MAAM/H,KAAKihB,SAAS3hB,IAC5BgtB,GAAOjqB,EAAEgiB,KAAK,KAKxB,IAJAgI,EAAG3sB,KAAK2C,GAIFgqB,EAAGvtB,OAAOyO,GAAG,CAKlB,IAHA,IAAIif,EAAQ,GAAIC,EAAKJ,EAAGvtB,OACpB4tB,EAAO,EAAGC,EAAM,GAEZttB,EAAE,EAAEA,EAAEC,EAAID,IAAK,CAEtB,IADA,IAAImG,EAAM1B,IACFmC,EAAE,EAAEA,EAAEwmB,EAAGxmB,IAAK,CACrB,IAAI2mB,EAAO9N,EAAS3gB,EAAKkB,GAAGgtB,EAAGpmB,IAC5B2mB,GAAMpnB,IAAKA,EAAMonB,EACpB,CACDJ,EAAMntB,GAAKmG,CACX,CAGD,IAAI,IAAIqnB,EAAE,EAAEA,EAAEvtB,EAAIutB,IACjBH,GAAQF,EAAMK,GAIf,IAAI,IAAIC,EAAE,EAAEA,EAAExtB,EAAIwtB,IACjBH,EAAIG,GAAK,CAACztB,EAAEytB,EAAG3iB,EAAEhM,EAAK2uB,GAAIC,GAAGP,EAAMM,GAAGJ,EAAMM,GAAG,GAIhDL,EAAI/sB,MAAK,SAACuC,EAAEC,GAAH,OAAOD,EAAE4qB,GAAG3qB,EAAE2qB,EAAd,IAGTJ,EAAI,GAAGK,GAAKL,EAAI,GAAGI,GACnB,IAAI,IAAIE,EAAE,EAAEA,EAAE3tB,EAAI2tB,IACjBN,EAAIM,GAAGD,GAAKL,EAAIM,EAAE,GAAGD,GAAKL,EAAIM,GAAGF,GAQlC,IAJA,IAAIG,EAAMltB,KAAKihB,SAGXkM,EAAM,EACJA,EAAI7tB,EAAI,GAAKqtB,EAAIQ,KAAOH,GAAGE,IACjCb,EAAG3sB,KAAKitB,EAAIQ,EAAI,GAAGhjB,EAiBnB,CAED,OAAOkiB,CACP,E,qCCjGF,IACCF,EAAWplB,EAAQ,MACnBqmB,EAAcrmB,EAAQ,OACtBklB,EAASE,EAASF,OAGlBG,GAFUD,EAASD,QACZC,EAAS7J,KACP8K,EAAYhB,QACrBG,EAAOa,EAAYb,KAOpB,SAASlM,EAAK/gB,EAAI+tB,EAAIljB,GACrBA,EAAIA,GAAK,GACT,IAAI,IAAI9K,EAAE,EAAEA,EAAEC,EAAID,IAAK8K,EAAE9K,GAAKguB,EAC9B,OAAOljB,CACP,CA8HDjE,EAAOC,QA5HP,SAAiBhI,EAAKoP,EAAE+f,EAAQC,GAC/B,IAAIlB,EAAK,GAAImB,EAAM,GAAIC,EAAO,GAAInL,EAAO,GACrCoL,GAAO,EAAOC,EAAKJ,GAbZ,IAcPjuB,EAAMnB,EAAKW,OAAQ8uB,EAAOzvB,EAAK,GAAGW,OAAQwtB,EAAQsB,EAAK,EACvDhN,EAAQ,GAEZ,GAAI0M,EAWHjB,EADgB,UAATiB,EACFlB,EAAOjuB,EAAKoP,GAED,QAAT+f,EACFf,EAAKpuB,EAAKoP,GAGV+f,OAfL,IADA,IAAIO,EAAO,CAAC,EACNxB,EAAGvtB,OAAOyO,GAAG,CAClB,IAAI4f,EAAMntB,KAAK+H,MAAM/H,KAAKihB,SAAS3hB,GAC/BuuB,EAAKV,KACRU,EAAKV,IAAO,EACZd,EAAG3sB,KAAKvB,EAAKgvB,IAEd,CAYF,EAAG,CAEF9M,EAAK9S,EAAE,EAAEqT,GAGT,IAAI,IAAIvhB,EAAE,EAAEA,EAAEC,EAAID,IAAK,CAEtB,IADA,IAAImG,EAAM1B,IAAUgqB,EAAM,EAClB7nB,EAAE,EAAEA,EAAEsH,EAAEtH,IAAK,EAEhBqc,EAAOgK,EAAOL,EAAO9tB,EAAKkB,GAAGgtB,EAAGpmB,IAAMjG,KAAKmE,IAAIhG,EAAKkB,GAAGgtB,EAAGpmB,MACrDT,IACRA,EAAM8c,EACNwL,EAAM7nB,EAEP,CACDwnB,EAAKpuB,GAAKyuB,EACVlN,EAAMkN,IACN,CAID,IADA,IAAI9nB,EAAM,GACF+nB,GADMP,EAAM,GACV,GAAEO,EAAExgB,EAAEwgB,IAEf/nB,EAAI+nB,GAAKzB,EAAOjM,EAAKuN,EAAK,EAAE5nB,EAAI+nB,IAAM,EACtCP,EAAIO,GAAK1B,EAAG0B,GAIb,GAAGzB,EAAO,CACT,IAAI,IAAI0B,EAAE,EAAEA,EAAEzgB,EAAEygB,IAAK3B,EAAG2B,GAAK,GAG7B,IAAI,IAAInB,EAAE,EAAEA,EAAEvtB,EAAIutB,IAMjB,IALA,IACEoB,EAAOjoB,EADCynB,EAAKZ,IAEbqB,EAAO/vB,EAAK0uB,GAGNvlB,EAAE,EAAEA,EAAEsmB,EAAKtmB,IAClB2mB,EAAK3mB,IAAM4mB,EAAK5mB,GAIlBomB,GAAO,EACP,IAAI,IAAIS,EAAE,EAAEA,EAAE5gB,EAAE4gB,IAAK,CAOpB,IANA,IAAIC,EAAM/B,EAAG8B,GACXE,EAAOroB,EAAImoB,GACXG,EAAOd,EAAIW,GACXI,EAAK3N,EAAMuN,GAGLK,EAAE,EAAEA,EAAEZ,EAAKY,IAClBJ,EAAII,GAAMH,EAAKG,GAAKD,GAAO,EAI5B,GAAGb,EACF,IAAI,IAAIe,EAAE,EAAEA,EAAEb,EAAKa,IAClB,GAAGH,EAAKG,IAAIL,EAAIK,GAAI,CACnBf,GAAO,EACP,KACA,CAGH,CACD,KAEI,CAEJ,IAAI,IAAIZ,EAAE,EAAEA,EAAExtB,EAAIwtB,IAAK,CAEtB9mB,EADUynB,EAAKX,KACH3uB,EAAK2uB,EACjB,CAED,IAAI,IAAI4B,EAAE,EAAEA,EAAEnhB,EAAEmhB,IACfrC,EAAGqC,GAAK1oB,EAAI0oB,GAAG9N,EAAM8N,IAAM,EAG5BhB,GAAO,EACP,IAAI,IAAIiB,EAAE,EAAEA,EAAEphB,EAAEohB,IACf,GAAGnB,EAAImB,IAAItC,EAAGsC,GAAI,CACjBjB,GAAO,EACP,KACA,CAEF,CAEDA,EAAOA,KAAWC,GAAI,CACtB,QAAOD,GAER,MAAO,CACNC,GAhIU,IAgIDA,EACTpgB,EAAIA,EACJkgB,KAAOA,EACPrN,UAAYiM,EAEb,C,gCChJ2B1I,OAAOlb,UAAUmM,eCE7C,IAAIga,EAAS,IAAIC,YAAY,IAChB,IAAI5D,aAAa2D,GAClB,IAAIE,YAAYF,E,iCCsBA,WACxB,SAASG,EAAOC,GACZjpB,KAAK0K,OAASue,EAAQve,QAAU,GAChC1K,KAAKkpB,SAAWD,EAAQC,UAAY,IACpClpB,KAAKmpB,UAAYF,EAAQE,WAAa,IACtCnpB,KAAKopB,QAAU,GACfppB,KAAKqpB,SAAW,GAChBrpB,KAAKspB,WAAaL,EAAQK,YAAc,GACxCtpB,KAAKjH,OAASiH,KAAK0K,OAAO3R,OAC1BiH,KAAKupB,MAAQ,EAEb,IAAK,IAAIjwB,EAAI,EAAGA,EAAI0G,KAAKjH,OAAQO,IAC7B0G,KAAK0K,OAAOpR,GAAG4B,EAAI8E,KAAK0K,OAAOpR,GAAG4B,GAAK,EAE3C,IAAS5B,EAAI,EAAGA,EAAI0G,KAAKjH,OAAS,EAAGO,IAAK,CACtC,IAAIyF,EAAKiB,KAAK0K,OAAOpR,GACjB0F,EAAKgB,KAAK0K,OAAOpR,EAAI,GACzB0G,KAAKopB,QAAQzvB,KAAK,CACdhB,GAAIoG,EAAGpG,EAAIqG,EAAGrG,GAAK,EACnBC,GAAImG,EAAGnG,EAAIoG,EAAGpG,GAAK,EACnBsC,GAAI6D,EAAG7D,EAAI8D,EAAG9D,GAAK,GAE3B,CACA8E,KAAKqpB,SAAS1vB,KAAK,CAACqG,KAAK0K,OAAO,GAAI1K,KAAK0K,OAAO,KAChD,IAASpR,EAAI,EAAGA,EAAI0G,KAAKopB,QAAQrwB,OAAS,EAAGO,IAAK,CAC9C,IAAIiZ,EAAKvS,KAAK0K,OAAOpR,EAAI,GAAGX,GAAKqH,KAAKopB,QAAQ9vB,GAAGX,EAAIqH,KAAKopB,QAAQ9vB,EAAI,GAAGX,GAAK,EAC1E6Z,EAAKxS,KAAK0K,OAAOpR,EAAI,GAAGV,GAAKoH,KAAKopB,QAAQ9vB,GAAGV,EAAIoH,KAAKopB,QAAQ9vB,EAAI,GAAGV,GAAK,EAC1E4wB,EAAKxpB,KAAK0K,OAAOpR,EAAI,GAAG4B,GAAK8E,KAAKopB,QAAQ9vB,GAAGV,EAAIoH,KAAKopB,QAAQ9vB,EAAI,GAAG4B,GAAK,EAC9E8E,KAAKqpB,SAAS1vB,KAAK,CACf,CACIhB,GAAI,EAAMqH,KAAKmpB,WAAanpB,KAAK0K,OAAOpR,EAAI,GAAGX,EAC3CqH,KAAKmpB,WAAanpB,KAAKopB,QAAQ9vB,GAAGX,EAAI4Z,GAC1C3Z,GAAI,EAAMoH,KAAKmpB,WAAanpB,KAAK0K,OAAOpR,EAAI,GAAGV,EAC3CoH,KAAKmpB,WAAanpB,KAAKopB,QAAQ9vB,GAAGV,EAAI4Z,GAC1CtX,GAAI,EAAM8E,KAAKmpB,WAAanpB,KAAK0K,OAAOpR,EAAI,GAAG4B,EAC3C8E,KAAKmpB,WAAanpB,KAAKopB,QAAQ9vB,GAAG4B,EAAIsuB,IAE9C,CACI7wB,GAAI,EAAMqH,KAAKmpB,WAAanpB,KAAK0K,OAAOpR,EAAI,GAAGX,EAC3CqH,KAAKmpB,WAAanpB,KAAKopB,QAAQ9vB,EAAI,GAAGX,EAAI4Z,GAC9C3Z,GAAI,EAAMoH,KAAKmpB,WAAanpB,KAAK0K,OAAOpR,EAAI,GAAGV,EAC3CoH,KAAKmpB,WAAanpB,KAAKopB,QAAQ9vB,EAAI,GAAGV,EAAI4Z,GAC9CtX,GAAI,EAAM8E,KAAKmpB,WAAanpB,KAAK0K,OAAOpR,EAAI,GAAG4B,EAC3C8E,KAAKmpB,WAAanpB,KAAKopB,QAAQ9vB,EAAI,GAAG4B,EAAIsuB,KAG1D,CAMA,OALAxpB,KAAKqpB,SAAS1vB,KAAK,CACfqG,KAAK0K,OAAO1K,KAAKjH,OAAS,GAC1BiH,KAAK0K,OAAO1K,KAAKjH,OAAS,KAE9BiH,KAAKypB,MAAQzpB,KAAK0pB,WAAW1pB,KAAKspB,YAC3BtpB,IACX,CAIAgpB,EAAOtmB,UAAUgnB,WAAa,SAAUC,GACpC,IAAIF,EAAQ,GACRG,EAAW5pB,KAAK6pB,IAAI,GACxBJ,EAAM9vB,KAAK,GACX,IAAK,IAAI2H,EAAI,EAAGA,EAAItB,KAAKkpB,SAAU5nB,GAAK,GAAI,CACxC,IAAIwoB,EAAO9pB,KAAK6pB,IAAIvoB,GACTrH,KAAK8H,MAAM+nB,EAAKnxB,EAAIixB,EAASjxB,IAAMmxB,EAAKnxB,EAAIixB,EAASjxB,IAC3DmxB,EAAKlxB,EAAIgxB,EAAShxB,IAAMkxB,EAAKlxB,EAAIgxB,EAAShxB,IAC1CkxB,EAAK5uB,EAAI0uB,EAAS1uB,IAAM4uB,EAAK5uB,EAAI0uB,EAAS1uB,IACpCyuB,IACPF,EAAM9vB,KAAK2H,GACXsoB,EAAWE,EAEnB,CACA,OAAOL,CACX,EAIAT,EAAOtmB,UAAUqnB,OAAS,SAAUzoB,GAChC,IAAIvC,EAAKiB,KAAK6pB,IAAIvoB,EAAI,IAClBtC,EAAKgB,KAAK6pB,IAAIvoB,EAAI,IACtB,MAAO,CACHsL,MAAQ,IAAM3S,KAAKwN,MAAM1I,EAAGnG,EAAIoG,EAAGpG,EAAGmG,EAAGpG,EAAIqG,EAAGrG,GAAM,KACtDqxB,MAAO/vB,KAAK8H,MAAM/C,EAAGrG,EAAIoG,EAAGpG,IAAMqG,EAAGrG,EAAIoG,EAAGpG,IACvCqG,EAAGpG,EAAImG,EAAGnG,IAAMoG,EAAGpG,EAAImG,EAAGnG,IAC1BoG,EAAG9D,EAAI6D,EAAG7D,IAAM8D,EAAG9D,EAAI6D,EAAG7D,IAEvC,EAQA8tB,EAAOtmB,UAAUmnB,IAAM,SAAUI,GAC7B,IAAI3oB,EAAI2oB,EAAOjqB,KAAKupB,MAChBjoB,EAAI,IACJA,EAAI,GAEJA,EAAItB,KAAKkpB,WACT5nB,EAAItB,KAAKkpB,SAAW,GAGxB,IAAIgB,EAAK5oB,EAAItB,KAAKkpB,SAClB,GAAIgB,GAAM,EACN,OAAOlqB,KAAK0K,OAAO1K,KAAKjH,OAAS,GAErC,IAAIqE,EAAInD,KAAK+H,OAAOhC,KAAK0K,OAAO3R,OAAS,GAAKmxB,GAE9C,OAKR,SAAgB5oB,EAAGvC,EAAIorB,EAAIC,EAAIprB,GAC3B,IAAI3C,EAQR,SAAWiF,GACP,IAAI4oB,EAAK5oB,EAAIA,EACT+oB,EAAKH,EAAK5oB,EACd,MAAO,CACH+oB,EACA,EAAIH,GAAM,EAAI5oB,GACd,EAAIA,GAAK,EAAIA,IAAM,EAAIA,IACtB,EAAIA,IAAM,EAAIA,IAAM,EAAIA,GAEjC,CAjBYkkB,CAAElkB,GAMV,MALU,CACN3I,EAAGqG,EAAGrG,EAAI0D,EAAE,GAAK+tB,EAAGzxB,EAAI0D,EAAE,GAAK8tB,EAAGxxB,EAAI0D,EAAE,GAAK0C,EAAGpG,EAAI0D,EAAE,GACtDzD,EAAGoG,EAAGpG,EAAIyD,EAAE,GAAK+tB,EAAGxxB,EAAIyD,EAAE,GAAK8tB,EAAGvxB,EAAIyD,EAAE,GAAK0C,EAAGnG,EAAIyD,EAAE,GACtDnB,EAAG8D,EAAG9D,EAAImB,EAAE,GAAK+tB,EAAGlvB,EAAImB,EAAE,GAAK8tB,EAAGjvB,EAAImB,EAAE,GAAK0C,EAAG7D,EAAImB,EAAE,GAG9D,CAbeiuB,EADGtqB,KAAKjH,OAAS,GAAKmxB,EAAK9sB,EAChB4C,KAAK0K,OAAOtN,GAAI4C,KAAKqpB,SAASjsB,GAAG,GAAI4C,KAAKqpB,SAASjsB,EAAI,GAAG,GAAI4C,KAAK0K,OAAOtN,EAAI,GACpG,CAEJ,CA/G4B,E,6JCfxBmtB,EAA0B,WAC1B,SAASA,IACLvqB,KAAK8R,MAAQ,GACb9R,KAAK0M,aAAUuP,EACfjc,KAAKwqB,cAAWvO,CACpB,CAoLA,OA7KAsO,EAAS7nB,UAAU/I,KAAO,SAAUiY,GAChC5R,KAAK8R,MAAMnY,KAAKiY,GAChB5R,KAAK0M,QAAU1M,KAAKwqB,cAAWvO,CACnC,EAQAsO,EAAS7nB,UAAU+hB,IAAM,SAAUnrB,GAC/B,OAAO0G,KAAK8R,MAAMxY,EACtB,EACAskB,OAAOwG,eAAemG,EAAS7nB,UAAW,SAAU,CAOhD+hB,IAAK,WACD,OAAOzkB,KAAK8R,MAAM/Y,MACtB,EACAsmB,YAAY,EACZ4F,cAAc,IAQlBsF,EAAS7nB,UAAUwI,QAAU,SAAUtJ,GACnC5B,KAAK8R,MAAM5G,QAAQtJ,EACvB,EAQA2oB,EAAS7nB,UAAU+B,IAAM,SAAU7C,GAC/B,OAAO5B,KAAK8R,MAAMrN,IAAI7C,EAC1B,EAQA2oB,EAAS7nB,UAAU+nB,KAAO,SAAU7oB,GAChC,OAAO5B,KAAK8R,MAAM2Y,KAAK7oB,EAC3B,EAWA2oB,EAAS7nB,UAAUgoB,QAAU,WAEzB,OAAO,CACX,EAUAH,EAAS7nB,UAAUioB,OAAS,WACxB,IAAIC,EAAQ5qB,KAGR6qB,EAAU7qB,KAAK8R,MAAMgZ,QAAO,SAAUC,EAAMnZ,EAAMtY,GAGlD,OAFIsY,EAAK3H,KAAKwB,YAAY,GAAKmf,EAAM9Y,MAAMiZ,GAAM9gB,KAAKwB,YAAY,KAC9Dsf,EAAOzxB,GACJyxB,CACX,GAAG,GAAIC,GAAqB,IAAZH,EAAgB7qB,KAAKjH,OAAS8xB,GAAW,EAAGI,GAASJ,EAAU,GAAK7qB,KAAKjH,OAAQmyB,GAAOC,EAAAA,EAAAA,IAAiBnrB,KAAK8R,MAAMkZ,GAAO/gB,KAAKwB,YAAazL,KAAK8R,MAAM+Y,GAAS5gB,KAAKwB,YAAazL,KAAK8R,MAAMmZ,GAAOhhB,KAAKwB,aAC1N,OAAa,IAATyf,EACQlrB,KAAK8R,MAAMkZ,GAAO/gB,KAAKwB,YAAY,GACvCzL,KAAK8R,MAAMmZ,GAAOhhB,KAAKwB,YAAY,GACpCyf,EAAO,CAClB,EAOAX,EAAS7nB,UAAU0oB,aAAe,WAC9B,OAAOC,EAAAA,EAAAA,IAAWrrB,KAAK8R,MAAMrN,KAAI,SAAUmN,GAAQ,OAAOA,EAAK3H,KAAKwB,WAAa,IACrF,EAOA8e,EAAS7nB,UAAU4oB,UAAY,WAC3B,GAAItrB,KAAK0M,QACL,OAAO1M,KAAK0M,QAChB,IAAIjB,EAAczL,KAAK8R,MAAMrN,KAAI,SAAUmN,GAAQ,OAAOA,EAAK3H,KAAKwB,WAAa,IAEjF,OADAA,EAAY9R,KAAKqG,KAAK8R,MAAM,GAAG7H,KAAKwB,aAC5BzL,KAAK0M,SAAUA,EAAAA,EAAAA,IAAQ,CAACjB,GACpC,EAOA8e,EAAS7nB,UAAU6oB,YAAc,WAC7B,OAAIvrB,KAAKwqB,SACExqB,KAAKwqB,SACRxqB,KAAKwqB,UAAWA,EAAAA,EAAAA,GAASxqB,KAAKsrB,YAC1C,EASAf,EAASiB,uBAAyB,SAAUC,EAAcC,GACtD,IACIC,EAAaC,EADbC,EAAeJ,EAAaF,cA2BhC,OAzBAG,EAAUxgB,SAAQ,SAAU4gB,GACxB,IAAIC,EAAcD,EAAMP,cAIxB,GAHIK,IACAD,EAAcC,EAASL,iBAEvBS,EAAAA,EAAAA,IAAgBD,EAAaF,KAE7BI,EAAAA,EAAAA,IAAiBF,EAAaF,GAAe,CAQ7C,IAPA,IAAIK,EAA0BT,EAAahnB,KAAI,SAAUmN,GAAQ,OAAOA,EAAK3H,KAAKwB,WAAa,IAC3F0gB,OAAY,EACZC,EAAU,SAAUC,GACfP,EAAMrB,MAAK,SAAU7Y,GAAQ,OAAO0a,EAAAA,EAAAA,IAAiBD,EAAIza,EAAK3H,KAAKwB,YAAc,MAClF0gB,EAAYE,EAEpB,EACSvF,EAAK,EAAGyF,EAA4BL,EAAyBpF,EAAKyF,EAA0BxzB,OAAQ+tB,IAAM,CAE/GsF,EADSG,EAA0BzF,GAEvC,CACIqF,GAAaL,EAAMltB,QAAOoH,EAAAA,EAAAA,IAAMmmB,MAC3BP,KAAYK,EAAAA,EAAAA,IAAiBN,EAAaI,KAC3CH,EAAWE,GAEvB,CACJ,IACOF,CACX,EAOArB,EAAS7nB,UAAU9D,OAAS,SAAUytB,GAClC,OAAOG,EAAAA,EAAAA,GAAsBH,EAAIrsB,KAAKsrB,YAC1C,EACOf,CACX,CA1L8B,GA2L9B,K,oDC1GA,EAxF0B,WACtB,SAAS3qB,EAAK6L,GACVzL,KAAKka,GAAKta,EAAK6sB,QAAQhhB,GACvBzL,KAAKyL,YAAcA,EACnBzL,KAAK0sB,WAAa,GAElB1sB,KAAK2sB,WAAa,GAClB3sB,KAAK4sB,kBAAmB,CAC5B,CA8EA,OA7EAhtB,EAAK6sB,QAAU,SAAUhhB,GACrB,OAAOA,EAAY6S,KAAK,IAC5B,EACA1e,EAAK8C,UAAUmqB,gBAAkB,SAAUjb,GACvC5R,KAAK0sB,WAAa1sB,KAAK0sB,WAAW1U,QAAO,SAAUzc,GAAK,OAAOA,EAAE0O,KAAKiQ,KAAOtI,EAAK3H,KAAKiQ,EAAI,GAC/F,EACAta,EAAK8C,UAAUoqB,gBAAkB,SAAUlb,GACvC5R,KAAK2sB,WAAa3sB,KAAK2sB,WAAW3U,QAAO,SAAUzc,GAAK,OAAOA,EAAE2O,GAAGgQ,KAAOtI,EAAK1H,GAAGgQ,EAAI,GAC3F,EAOAta,EAAK8C,UAAUqqB,aAAe,SAAUnb,GACpC5R,KAAK2sB,WAAWhzB,KAAKiY,GACrB5R,KAAK4sB,kBAAmB,CAC5B,EAOAhtB,EAAK8C,UAAUsqB,eAAiB,WAC5B,IAAIpC,EAAQ5qB,KACPA,KAAK4sB,mBAGN5sB,KAAK2sB,WAAW9yB,MAAK,SAAUuC,EAAGC,GAC9B,IAAI4wB,EAAQ7wB,EAAE8N,GAAIgjB,EAAQ7wB,EAAE6N,GAC5B,GAAI+iB,EAAMxhB,YAAY,GAAKmf,EAAMnf,YAAY,IAAM,GAC/CyhB,EAAMzhB,YAAY,GAAKmf,EAAMnf,YAAY,GAAK,EAC9C,OAAO,EACX,GAAIwhB,EAAMxhB,YAAY,GAAKmf,EAAMnf,YAAY,GAAK,GAC9CyhB,EAAMzhB,YAAY,GAAKmf,EAAMnf,YAAY,IAAM,EAC/C,OAAQ,EACZ,GAAIwhB,EAAMxhB,YAAY,GAAKmf,EAAMnf,YAAY,KAAO,GAChDyhB,EAAMzhB,YAAY,GAAKmf,EAAMnf,YAAY,KAAO,EAChD,OAAIwhB,EAAMxhB,YAAY,GAAKmf,EAAMnf,YAAY,IAAM,GAC/CyhB,EAAMzhB,YAAY,GAAKmf,EAAMnf,YAAY,IAAM,EACxCwhB,EAAMxhB,YAAY,GAAKyhB,EAAMzhB,YAAY,GAC7CyhB,EAAMzhB,YAAY,GAAKwhB,EAAMxhB,YAAY,GAEpD,IAAI0hB,GAAMhC,EAAAA,EAAAA,IAAiBP,EAAMnf,YAAawhB,EAAMxhB,YAAayhB,EAAMzhB,aACvE,OAAI0hB,EAAM,EACC,EACPA,EAAM,GACE,EACHlzB,KAAK6J,IAAImpB,EAAMxhB,YAAY,GAAKmf,EAAMnf,YAAY,GAAI,GAC3DxR,KAAK6J,IAAImpB,EAAMxhB,YAAY,GAAKmf,EAAMnf,YAAY,GAAI,IAASxR,KAAK6J,IAAIopB,EAAMzhB,YAAY,GAAKmf,EAAMnf,YAAY,GAAI,GACrHxR,KAAK6J,IAAIopB,EAAMzhB,YAAY,GAAKmf,EAAMnf,YAAY,GAAI,GAE9D,IACAzL,KAAK4sB,kBAAmB,EAEhC,EASAhtB,EAAK8C,UAAU0qB,cAAgB,WAE3B,OADAptB,KAAKgtB,iBACEhtB,KAAK2sB,UAChB,EACA/sB,EAAK8C,UAAU2qB,aAAe,SAAU/zB,GAEpC,OADA0G,KAAKgtB,iBACEhtB,KAAK2sB,WAAWrzB,EAC3B,EACAsG,EAAK8C,UAAU4qB,aAAe,SAAU1b,GACpC5R,KAAK0sB,WAAW/yB,KAAKiY,EACzB,EACOhS,CACX,CAvF0B,G,WCwE1B,EAvE0B,WAKtB,SAAS2tB,EAAKtjB,EAAMC,GAChBlK,KAAKiK,KAAOA,EACZjK,KAAKkK,GAAKA,EACVlK,KAAK5G,UAAO6iB,EACZjc,KAAKwtB,WAAQvR,EACbjc,KAAKytB,cAAWxR,EAChBjc,KAAK8M,UAAOmP,EACZjc,KAAKiK,KAAK8iB,aAAa/sB,MACvBA,KAAKkK,GAAGojB,aAAattB,KACzB,CAuDA,OAjDAutB,EAAK7qB,UAAUgrB,YAAc,WAKzB,OAJK1tB,KAAKytB,WACNztB,KAAKytB,SAAW,IAAIF,EAAKvtB,KAAKkK,GAAIlK,KAAKiK,MACvCjK,KAAKytB,SAASA,SAAWztB,MAEtBA,KAAKytB,QAChB,EAIAF,EAAK7qB,UAAUirB,WAAa,WACxB3tB,KAAKiK,KAAK6iB,gBAAgB9sB,MAC1BA,KAAKkK,GAAG2iB,gBAAgB7sB,KAC5B,EASAutB,EAAK7qB,UAAUkrB,QAAU,SAAUhc,GAC/B,OAAO5R,KAAKiK,KAAKiQ,KAAOtI,EAAK3H,KAAKiQ,IAAMla,KAAKkK,GAAGgQ,KAAOtI,EAAK1H,GAAGgQ,EACnE,EACAqT,EAAK7qB,UAAUmb,SAAW,WACtB,MAAO,UAAY7d,KAAKiK,KAAKiQ,GAAK,OAASla,KAAKkK,GAAGgQ,GAAK,IAC5D,EAMAqT,EAAK7qB,UAAUmrB,aAAe,WAC1B,OAAOC,EAAAA,EAAAA,IAAW,CAAC9tB,KAAKiK,KAAKwB,YAAazL,KAAKkK,GAAGuB,aACtD,EAWA8hB,EAAK7qB,UAAUqrB,UAAY,SAAUnc,GACjC,OAAOuZ,EAAAA,EAAAA,IAAiBvZ,EAAK3H,KAAKwB,YAAamG,EAAK1H,GAAGuB,YAAazL,KAAKkK,GAAGuB,YAChF,EACO8hB,CACX,CAtE0B,G,kCCyBC,WACvB,SAASS,IACLhuB,KAAK8R,MAAQ,GAEb9R,KAAKiuB,MAAQ,CAAC,CAClB,CAQAD,EAAME,YAAc,SAAUC,IAhClC,SAAyBA,GACrB,IAAKA,EACD,MAAM,IAAIrU,MAAM,qBACpB,GAAqB,sBAAjBqU,EAAQxiB,MACS,uBAAjBwiB,EAAQxiB,MACS,oBAAjBwiB,EAAQxiB,MACS,eAAjBwiB,EAAQxiB,MACS,YAAjBwiB,EAAQxiB,KACR,MAAM,IAAImO,MAAM,uBAAyBqU,EAAQxiB,KAAO,mGAChE,CAwBQyiB,CAAgBD,GAChB,IAAIE,EAAQ,IAAIL,EAYhB,OAXAM,EAAAA,EAAAA,IAAYH,GAAS,SAAUI,IAC3BC,EAAAA,EAAAA,IAAUD,EAAS,aAAc,uBAEjCE,EAAAA,EAAAA,IAAYF,GAAS,SAAUl1B,EAAMq1B,GACjC,GAAIr1B,EAAM,CACN,IAAIe,EAAQi0B,EAAMM,QAAQt1B,GAAOgB,EAAMg0B,EAAMM,QAAQD,GACrDL,EAAMO,QAAQx0B,EAAOC,EACzB,CACA,OAAOq0B,CACX,GACJ,IACOL,CACX,EAOAL,EAAMtrB,UAAUisB,QAAU,SAAUljB,GAChC,IAAIyO,EAAKta,EAAAA,QAAa6L,GAClB6E,EAAOtQ,KAAKiuB,MAAM/T,GAGtB,OAFK5J,IACDA,EAAOtQ,KAAKiuB,MAAM/T,GAAM,IAAIta,EAAK6L,IAC9B6E,CACX,EASA0d,EAAMtrB,UAAUksB,QAAU,SAAU3kB,EAAMC,GACtC,IAAI0H,EAAO,IAAI2b,EAAKtjB,EAAMC,GAAK2kB,EAAejd,EAAK8b,cACnD1tB,KAAK8R,MAAMnY,KAAKiY,GAChB5R,KAAK8R,MAAMnY,KAAKk1B,EACpB,EAIAb,EAAMtrB,UAAUosB,cAAgB,WAC5B,IAAIlE,EAAQ5qB,KACZ4d,OAAOkB,KAAK9e,KAAKiuB,OACZxpB,KAAI,SAAUyV,GAAM,OAAO0Q,EAAMqD,MAAM/T,EAAK,IAC5ChP,SAAQ,SAAUoF,GAAQ,OAAOsa,EAAMmE,gBAAgBze,EAAO,GACvE,EAQA0d,EAAMtrB,UAAUqsB,gBAAkB,SAAUze,GACxC,IAAIsa,EAAQ5qB,KAEZ,GAAIsQ,EAAKoc,WAAW3zB,QAAU,EAAG,CAC7B,IAAIi2B,EAAa1e,EAAK8c,gBAAgB3oB,KAAI,SAAUlJ,GAAK,OAAOA,EAAE2O,EAAI,IACtElK,KAAKrF,WAAW2V,GAChB0e,EAAW9jB,SAAQ,SAAU9N,GAAK,OAAOwtB,EAAMmE,gBAAgB3xB,EAAI,GACvE,CACJ,EAQA4wB,EAAMtrB,UAAUusB,eAAiB,WAC7B,IAAIrE,EAAQ5qB,KACZA,KAAKkvB,sBACLlvB,KAAKmvB,wBAELnvB,KAAK8R,MAAM5G,SAAQ,SAAU0G,GACrBA,EAAK4b,QAAU5b,EAAK6b,SAASD,QAC7B5C,EAAMwE,WAAWxd,EAAK6b,UACtB7C,EAAMwE,WAAWxd,GAEzB,GACJ,EASAoc,EAAMtrB,UAAUwsB,oBAAsB,SAAU5e,GAC5C,IAAIsa,EAAQ5qB,KACQ,qBAATsQ,EACPsN,OAAOkB,KAAK9e,KAAKiuB,OAAO/iB,SAAQ,SAAUgP,GACtC,OAAO0Q,EAAMsE,oBAAoBtE,EAAMqD,MAAM/T,GACjD,IAGA5J,EAAK8c,gBAAgBliB,SAAQ,SAAU0G,EAAMtY,GACzCgX,EAAK+c,cAAoB,IAAN/zB,EAAUgX,EAAK8c,gBAAgBr0B,OAASO,GAAK,GAAGm0B,SAASr0B,KAAOwY,CACvF,GAER,EAYAoc,EAAMtrB,UAAU2sB,qBAAuB,SAAU/e,EAAMkd,GAGnD,IAFA,IACI8B,EAAYC,EADZzd,EAAQxB,EAAK8c,gBAER9zB,EAAIwY,EAAM/Y,OAAS,EAAGO,GAAK,IAAKA,EAAG,CACxC,IAAIk2B,EAAK1d,EAAMxY,GAAIslB,EAAM4Q,EAAG/B,SAAUgC,OAAQ,EAAQC,OAAO,EACzDF,EAAGhC,QAAUA,IACbiC,EAAQD,GACR5Q,EAAI4O,QAAUA,IACdkC,EAAO9Q,GACN6Q,GAAUC,IAGXA,IACAH,EAAWG,GACXD,IACIF,IACAA,EAASn2B,KAAOq2B,EAChBF,OAAWtT,GAEVqT,IACDA,EAAaG,IAEzB,CACIF,IACAA,EAASn2B,KAAOk2B,EACxB,EAQAtB,EAAMtrB,UAAUysB,sBAAwB,WACpC,IAAIQ,EAAiB,GACjBnC,EAAQ,EAYZ,OAXAxtB,KAAK8R,MAAM5G,SAAQ,SAAU0G,GACzB,KAAIA,EAAK4b,OAAS,GAAlB,CAEAmC,EAAeh2B,KAAKiY,GACpB,IAAIrW,EAAIqW,EACR,GACIrW,EAAEiyB,MAAQA,EACVjyB,EAAIA,EAAEnC,YACAwY,EAAKgc,QAAQryB,IACvBiyB,GAPU,CAQd,IACOmC,CACX,EAMA3B,EAAMtrB,UAAUktB,aAAe,WAC3B,IAAIhF,EAAQ5qB,KACZA,KAAKkvB,sBAELlvB,KAAK8R,MAAM5G,SAAQ,SAAU0G,GACzBA,EAAK4b,WAAQvR,CACjB,IACAjc,KAAKmvB,wBAAwBjkB,SAAQ,SAAU0G,GAE3CgZ,EAAMiF,uBAAuBje,GAAM1G,SAAQ,SAAUoF,GACjDsa,EAAMyE,qBAAqB/e,EAAMsB,EAAK4b,MAC1C,GACJ,IACA,IAAIsC,EAAe,GAOnB,OALA9vB,KAAK8R,MAAM5G,SAAQ,SAAU0G,GACrBA,EAAK9E,MAETgjB,EAAan2B,KAAKixB,EAAMmF,cAAcne,GAC1C,IACOke,CACX,EAOA9B,EAAMtrB,UAAUmtB,uBAAyB,SAAUG,GAC/C,IAAIC,EAAoB,GACpBre,EAAOoe,EACP5D,EAAU,WAEV,IAAI8D,EAAS,EACbte,EAAK3H,KAAKmjB,gBAAgBliB,SAAQ,SAAU3P,GACpCA,EAAEiyB,QAAUwC,EAAUxC,SACpB0C,CACV,IACIA,EAAS,GACTD,EAAkBt2B,KAAKiY,EAAK3H,MAChC2H,EAAOA,EAAKxY,IAChB,EACA,GACIgzB,WACM4D,EAAUpC,QAAQhc,IAC5B,OAAOqe,CACX,EAOAjC,EAAMtrB,UAAUqtB,cAAgB,SAAUC,GACtC,IAAIpe,EAAOoe,EACPG,EAAW,IAAI5F,EAAAA,EACnB,GACI4F,EAASx2B,KAAKiY,GACdA,EAAK9E,KAAOqjB,EACZve,EAAOA,EAAKxY,YACN42B,EAAUpC,QAAQhc,IAC5B,OAAOue,CACX,EAOAnC,EAAMtrB,UAAU/H,WAAa,SAAU2V,GACnC,IAAIsa,EAAQ5qB,KACZsQ,EAAK8c,gBAAgBliB,SAAQ,SAAU0G,GAAQ,OAAOgZ,EAAMwE,WAAWxd,EAAO,IAC9EtB,EAAKoc,WAAWxhB,SAAQ,SAAU0G,GAAQ,OAAOgZ,EAAMwE,WAAWxd,EAAO,WAClE5R,KAAKiuB,MAAM3d,EAAK4J,GAC3B,EAMA8T,EAAMtrB,UAAU0sB,WAAa,SAAUxd,GACnC5R,KAAK8R,MAAQ9R,KAAK8R,MAAMkG,QAAO,SAAUzc,GAAK,OAAQA,EAAEqyB,QAAQhc,EAAO,IACvEA,EAAK+b,YACT,CAEJ,CA9Q2B,E,wKCVpB,SAASxC,EAAiBpsB,EAAIC,EAAI1D,GACrC,IAlBc3C,EAkBVy3B,EAAMpxB,EAAG,GAAKD,EAAG,GAAIsxB,EAAMrxB,EAAG,GAAKD,EAAG,GAAIuxB,EAAMh1B,EAAE,GAAK0D,EAAG,GAAIuxB,EAAMj1B,EAAE,GAAK0D,EAAG,GAClF,QAnBcrG,EAmBEy3B,EAAMG,EAAMD,EAAMD,GAlBrB,IAAM13B,EAAI,KAAOA,CAmBlC,CAUO,SAASqzB,EAAgBwE,EAAMC,GAClC,IAAIC,EAAQF,EAAK7hB,SAASlD,YAAY,GAAGhH,KAAI,SAAUnI,GAAK,OAAOA,EAAE,EAAI,IAAIq0B,EAAQH,EAAK7hB,SAASlD,YAAY,GAAGhH,KAAI,SAAUnI,GAAK,OAAOA,EAAE,EAAI,IAAIs0B,EAAQH,EAAK9hB,SAASlD,YAAY,GAAGhH,KAAI,SAAUnI,GAAK,OAAOA,EAAE,EAAI,IAAIu0B,EAAQJ,EAAK9hB,SAASlD,YAAY,GAAGhH,KAAI,SAAUnI,GAAK,OAAOA,EAAE,EAAI,IACpS,OAAQrC,KAAKC,IAAI2J,MAAM,KAAM6sB,KAAWz2B,KAAKC,IAAI2J,MAAM,KAAM+sB,IACzD32B,KAAKC,IAAI2J,MAAM,KAAM8sB,KAAW12B,KAAKC,IAAI2J,MAAM,KAAMgtB,IACrD52B,KAAKwF,IAAIoE,MAAM,KAAM6sB,KAAWz2B,KAAKwF,IAAIoE,MAAM,KAAM+sB,IACrD32B,KAAKwF,IAAIoE,MAAM,KAAM8sB,KAAW12B,KAAKwF,IAAIoE,MAAM,KAAMgtB,EAC7D,CAYO,SAAS5E,EAAiB3P,EAAMwU,GACnC,OAAOA,EAAIniB,SAASlD,YAAY,GAAGslB,OAAM,SAAUz0B,GAC/C,OAAOkwB,EAAAA,EAAAA,IAAsBxmB,EAAAA,EAAAA,IAAM1J,GAAIggB,EAC3C,GACJ,CAQO,SAASgQ,EAAiB0E,EAAQC,GACrC,OAAOD,EAAO,KAAOC,EAAO,IAAMD,EAAO,KAAOC,EAAO,EAC3D,C","sources":["webpack://app/./node_modules/@turf/tesselate/node_modules/earcut/src/earcut.js","webpack://app/./node_modules/call-bind/callBound.js","webpack://app/./node_modules/concaveman/node_modules/rbush/rbush.min.js","webpack://app/./node_modules/d3-array/src/array.js","webpack://app/./node_modules/d3-array/src/ascending.js","webpack://app/./node_modules/d3-array/src/bisect.js","webpack://app/./node_modules/d3-array/src/bisector.js","webpack://app/./node_modules/d3-array/src/merge.js","webpack://app/./node_modules/d3-array/src/ticks.js","webpack://app/./node_modules/d3-geo/src/adder.js","webpack://app/./node_modules/d3-geo/src/area.js","webpack://app/./node_modules/d3-geo/src/bounds.js","webpack://app/./node_modules/d3-geo/src/cartesian.js","webpack://app/./node_modules/d3-geo/src/centroid.js","webpack://app/./node_modules/d3-geo/src/clip/antimeridian.js","webpack://app/./node_modules/d3-geo/src/clip/buffer.js","webpack://app/./node_modules/d3-geo/src/clip/polygon.js","webpack://app/./node_modules/d3-geo/src/distance.js","webpack://app/./node_modules/d3-geo/src/length.js","webpack://app/./node_modules/d3-geo/src/math.js","webpack://app/./node_modules/d3-geo/src/noop.js","webpack://app/./node_modules/d3-geo/src/path/area.js","webpack://app/./node_modules/d3-geo/src/path/bounds.js","webpack://app/./node_modules/d3-geo/src/path/context.js","webpack://app/./node_modules/d3-geo/src/path/measure.js","webpack://app/./node_modules/d3-geo/src/path/string.js","webpack://app/./node_modules/d3-geo/src/pointEqual.js","webpack://app/./node_modules/d3-geo/src/polygonContains.js","webpack://app/./node_modules/d3-geo/src/projection/azimuthal.js","webpack://app/./node_modules/d3-geo/src/projection/azimuthalEqualArea.js","webpack://app/./node_modules/d3-geo/src/projection/azimuthalEquidistant.js","webpack://app/./node_modules/d3-geo/src/projection/equirectangular.js","webpack://app/./node_modules/d3-geo/src/projection/gnomonic.js","webpack://app/./node_modules/d3-geo/src/projection/mercator.js","webpack://app/./node_modules/d3-geo/src/projection/naturalEarth1.js","webpack://app/./node_modules/d3-geo/src/projection/orthographic.js","webpack://app/./node_modules/d3-geo/src/projection/resample.js","webpack://app/./node_modules/d3-geo/src/projection/stereographic.js","webpack://app/./node_modules/d3-geo/src/projection/transverseMercator.js","webpack://app/./node_modules/d3-geo/src/rotation.js","webpack://app/./node_modules/d3-geo/src/stream.js","webpack://app/./node_modules/d3-geo/src/transform.js","webpack://app/./node_modules/d3-voronoi/src/RedBlackTree.js","webpack://app/./node_modules/d3-voronoi/src/Edge.js","webpack://app/./node_modules/d3-voronoi/src/Cell.js","webpack://app/./node_modules/d3-voronoi/src/Circle.js","webpack://app/./node_modules/d3-voronoi/src/Beach.js","webpack://app/./node_modules/d3-voronoi/src/Diagram.js","webpack://app/./node_modules/density-clustering/lib/DBSCAN.js","webpack://app/./node_modules/density-clustering/lib/KMEANS.js","webpack://app/./node_modules/density-clustering/lib/OPTICS.js","webpack://app/./node_modules/density-clustering/lib/PriorityQueue.js","webpack://app/./node_modules/function-bind/implementation.js","webpack://app/./node_modules/geojson-rbush/node_modules/rbush/rbush.min.js","webpack://app/./node_modules/has-symbols/shams.js","webpack://app/./node_modules/has-tostringtag/shams.js","webpack://app/./node_modules/object-is/implementation.js","webpack://app/./node_modules/object-is/polyfill.js","webpack://app/./node_modules/object-is/shim.js","webpack://app/./node_modules/object-keys/implementation.js","webpack://app/./node_modules/object-keys/isArguments.js","webpack://app/./node_modules/point-in-polygon/flat.js","webpack://app/./node_modules/point-in-polygon/nested.js","webpack://app/./node_modules/rbush/node_modules/quickselect/quickselect.js","webpack://app/./node_modules/regexp.prototype.flags/implementation.js","webpack://app/./node_modules/regexp.prototype.flags/polyfill.js","webpack://app/./node_modules/regexp.prototype.flags/shim.js","webpack://app/./node_modules/robust-predicates/umd/orient2d.min.js","webpack://app/../../distance.js","webpack://app/../../kinit.js","webpack://app/../../main.js","webpack://app/./node_modules/topojson-server/src/object.js","webpack://app/./node_modules/topojson-server/src/hash/point-hash.js","webpack://app/./node_modules/@turf/bezier-spline/dist/es/lib/spline.js","webpack://app/./node_modules/@turf/polygonize/dist/es/lib/EdgeRing.js","webpack://app/./node_modules/@turf/polygonize/dist/es/lib/Node.js","webpack://app/./node_modules/@turf/polygonize/dist/es/lib/Edge.js","webpack://app/./node_modules/@turf/polygonize/dist/es/lib/Graph.js","webpack://app/./node_modules/@turf/polygonize/dist/es/lib/util.js"],"sourcesContent":["'use strict';\n\nmodule.exports = earcut;\nmodule.exports.default = earcut;\n\nfunction earcut(data, holeIndices, dim) {\n\n    dim = dim || 2;\n\n    var hasHoles = holeIndices && holeIndices.length,\n        outerLen = hasHoles ? holeIndices[0] * dim : data.length,\n        outerNode = linkedList(data, 0, outerLen, dim, true),\n        triangles = [];\n\n    if (!outerNode || outerNode.next === outerNode.prev) return triangles;\n\n    var minX, minY, maxX, maxY, x, y, invSize;\n\n    if (hasHoles) outerNode = eliminateHoles(data, holeIndices, outerNode, dim);\n\n    // if the shape is not too simple, we'll use z-order curve hash later; calculate polygon bbox\n    if (data.length > 80 * dim) {\n        minX = maxX = data[0];\n        minY = maxY = data[1];\n\n        for (var i = dim; i < outerLen; i += dim) {\n            x = data[i];\n            y = data[i + 1];\n            if (x < minX) minX = x;\n            if (y < minY) minY = y;\n            if (x > maxX) maxX = x;\n            if (y > maxY) maxY = y;\n        }\n\n        // minX, minY and invSize are later used to transform coords into integers for z-order calculation\n        invSize = Math.max(maxX - minX, maxY - minY);\n        invSize = invSize !== 0 ? 32767 / invSize : 0;\n    }\n\n    earcutLinked(outerNode, triangles, dim, minX, minY, invSize, 0);\n\n    return triangles;\n}\n\n// create a circular doubly linked list from polygon points in the specified winding order\nfunction linkedList(data, start, end, dim, clockwise) {\n    var i, last;\n\n    if (clockwise === (signedArea(data, start, end, dim) > 0)) {\n        for (i = start; i < end; i += dim) last = insertNode(i, data[i], data[i + 1], last);\n    } else {\n        for (i = end - dim; i >= start; i -= dim) last = insertNode(i, data[i], data[i + 1], last);\n    }\n\n    if (last && equals(last, last.next)) {\n        removeNode(last);\n        last = last.next;\n    }\n\n    return last;\n}\n\n// eliminate colinear or duplicate points\nfunction filterPoints(start, end) {\n    if (!start) return start;\n    if (!end) end = start;\n\n    var p = start,\n        again;\n    do {\n        again = false;\n\n        if (!p.steiner && (equals(p, p.next) || area(p.prev, p, p.next) === 0)) {\n            removeNode(p);\n            p = end = p.prev;\n            if (p === p.next) break;\n            again = true;\n\n        } else {\n            p = p.next;\n        }\n    } while (again || p !== end);\n\n    return end;\n}\n\n// main ear slicing loop which triangulates a polygon (given as a linked list)\nfunction earcutLinked(ear, triangles, dim, minX, minY, invSize, pass) {\n    if (!ear) return;\n\n    // interlink polygon nodes in z-order\n    if (!pass && invSize) indexCurve(ear, minX, minY, invSize);\n\n    var stop = ear,\n        prev, next;\n\n    // iterate through ears, slicing them one by one\n    while (ear.prev !== ear.next) {\n        prev = ear.prev;\n        next = ear.next;\n\n        if (invSize ? isEarHashed(ear, minX, minY, invSize) : isEar(ear)) {\n            // cut off the triangle\n            triangles.push(prev.i / dim | 0);\n            triangles.push(ear.i / dim | 0);\n            triangles.push(next.i / dim | 0);\n\n            removeNode(ear);\n\n            // skipping the next vertex leads to less sliver triangles\n            ear = next.next;\n            stop = next.next;\n\n            continue;\n        }\n\n        ear = next;\n\n        // if we looped through the whole remaining polygon and can't find any more ears\n        if (ear === stop) {\n            // try filtering points and slicing again\n            if (!pass) {\n                earcutLinked(filterPoints(ear), triangles, dim, minX, minY, invSize, 1);\n\n            // if this didn't work, try curing all small self-intersections locally\n            } else if (pass === 1) {\n                ear = cureLocalIntersections(filterPoints(ear), triangles, dim);\n                earcutLinked(ear, triangles, dim, minX, minY, invSize, 2);\n\n            // as a last resort, try splitting the remaining polygon into two\n            } else if (pass === 2) {\n                splitEarcut(ear, triangles, dim, minX, minY, invSize);\n            }\n\n            break;\n        }\n    }\n}\n\n// check whether a polygon node forms a valid ear with adjacent nodes\nfunction isEar(ear) {\n    var a = ear.prev,\n        b = ear,\n        c = ear.next;\n\n    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear\n\n    // now make sure we don't have other points inside the potential ear\n    var ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;\n\n    // triangle bbox; min & max are calculated like this for speed\n    var x0 = ax < bx ? (ax < cx ? ax : cx) : (bx < cx ? bx : cx),\n        y0 = ay < by ? (ay < cy ? ay : cy) : (by < cy ? by : cy),\n        x1 = ax > bx ? (ax > cx ? ax : cx) : (bx > cx ? bx : cx),\n        y1 = ay > by ? (ay > cy ? ay : cy) : (by > cy ? by : cy);\n\n    var p = c.next;\n    while (p !== a) {\n        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 &&\n            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) &&\n            area(p.prev, p, p.next) >= 0) return false;\n        p = p.next;\n    }\n\n    return true;\n}\n\nfunction isEarHashed(ear, minX, minY, invSize) {\n    var a = ear.prev,\n        b = ear,\n        c = ear.next;\n\n    if (area(a, b, c) >= 0) return false; // reflex, can't be an ear\n\n    var ax = a.x, bx = b.x, cx = c.x, ay = a.y, by = b.y, cy = c.y;\n\n    // triangle bbox; min & max are calculated like this for speed\n    var x0 = ax < bx ? (ax < cx ? ax : cx) : (bx < cx ? bx : cx),\n        y0 = ay < by ? (ay < cy ? ay : cy) : (by < cy ? by : cy),\n        x1 = ax > bx ? (ax > cx ? ax : cx) : (bx > cx ? bx : cx),\n        y1 = ay > by ? (ay > cy ? ay : cy) : (by > cy ? by : cy);\n\n    // z-order range for the current triangle bbox;\n    var minZ = zOrder(x0, y0, minX, minY, invSize),\n        maxZ = zOrder(x1, y1, minX, minY, invSize);\n\n    var p = ear.prevZ,\n        n = ear.nextZ;\n\n    // look for points inside the triangle in both directions\n    while (p && p.z >= minZ && n && n.z <= maxZ) {\n        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&\n            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;\n        p = p.prevZ;\n\n        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&\n            pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;\n        n = n.nextZ;\n    }\n\n    // look for remaining points in decreasing z-order\n    while (p && p.z >= minZ) {\n        if (p.x >= x0 && p.x <= x1 && p.y >= y0 && p.y <= y1 && p !== a && p !== c &&\n            pointInTriangle(ax, ay, bx, by, cx, cy, p.x, p.y) && area(p.prev, p, p.next) >= 0) return false;\n        p = p.prevZ;\n    }\n\n    // look for remaining points in increasing z-order\n    while (n && n.z <= maxZ) {\n        if (n.x >= x0 && n.x <= x1 && n.y >= y0 && n.y <= y1 && n !== a && n !== c &&\n            pointInTriangle(ax, ay, bx, by, cx, cy, n.x, n.y) && area(n.prev, n, n.next) >= 0) return false;\n        n = n.nextZ;\n    }\n\n    return true;\n}\n\n// go through all polygon nodes and cure small local self-intersections\nfunction cureLocalIntersections(start, triangles, dim) {\n    var p = start;\n    do {\n        var a = p.prev,\n            b = p.next.next;\n\n        if (!equals(a, b) && intersects(a, p, p.next, b) && locallyInside(a, b) && locallyInside(b, a)) {\n\n            triangles.push(a.i / dim | 0);\n            triangles.push(p.i / dim | 0);\n            triangles.push(b.i / dim | 0);\n\n            // remove two nodes involved\n            removeNode(p);\n            removeNode(p.next);\n\n            p = start = b;\n        }\n        p = p.next;\n    } while (p !== start);\n\n    return filterPoints(p);\n}\n\n// try splitting polygon into two and triangulate them independently\nfunction splitEarcut(start, triangles, dim, minX, minY, invSize) {\n    // look for a valid diagonal that divides the polygon into two\n    var a = start;\n    do {\n        var b = a.next.next;\n        while (b !== a.prev) {\n            if (a.i !== b.i && isValidDiagonal(a, b)) {\n                // split the polygon in two by the diagonal\n                var c = splitPolygon(a, b);\n\n                // filter colinear points around the cuts\n                a = filterPoints(a, a.next);\n                c = filterPoints(c, c.next);\n\n                // run earcut on each half\n                earcutLinked(a, triangles, dim, minX, minY, invSize, 0);\n                earcutLinked(c, triangles, dim, minX, minY, invSize, 0);\n                return;\n            }\n            b = b.next;\n        }\n        a = a.next;\n    } while (a !== start);\n}\n\n// link every hole into the outer loop, producing a single-ring polygon without holes\nfunction eliminateHoles(data, holeIndices, outerNode, dim) {\n    var queue = [],\n        i, len, start, end, list;\n\n    for (i = 0, len = holeIndices.length; i < len; i++) {\n        start = holeIndices[i] * dim;\n        end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;\n        list = linkedList(data, start, end, dim, false);\n        if (list === list.next) list.steiner = true;\n        queue.push(getLeftmost(list));\n    }\n\n    queue.sort(compareX);\n\n    // process holes from left to right\n    for (i = 0; i < queue.length; i++) {\n        outerNode = eliminateHole(queue[i], outerNode);\n    }\n\n    return outerNode;\n}\n\nfunction compareX(a, b) {\n    return a.x - b.x;\n}\n\n// find a bridge between vertices that connects hole with an outer ring and and link it\nfunction eliminateHole(hole, outerNode) {\n    var bridge = findHoleBridge(hole, outerNode);\n    if (!bridge) {\n        return outerNode;\n    }\n\n    var bridgeReverse = splitPolygon(bridge, hole);\n\n    // filter collinear points around the cuts\n    filterPoints(bridgeReverse, bridgeReverse.next);\n    return filterPoints(bridge, bridge.next);\n}\n\n// David Eberly's algorithm for finding a bridge between hole and outer polygon\nfunction findHoleBridge(hole, outerNode) {\n    var p = outerNode,\n        hx = hole.x,\n        hy = hole.y,\n        qx = -Infinity,\n        m;\n\n    // find a segment intersected by a ray from the hole's leftmost point to the left;\n    // segment's endpoint with lesser x will be potential connection point\n    do {\n        if (hy <= p.y && hy >= p.next.y && p.next.y !== p.y) {\n            var x = p.x + (hy - p.y) * (p.next.x - p.x) / (p.next.y - p.y);\n            if (x <= hx && x > qx) {\n                qx = x;\n                m = p.x < p.next.x ? p : p.next;\n                if (x === hx) return m; // hole touches outer segment; pick leftmost endpoint\n            }\n        }\n        p = p.next;\n    } while (p !== outerNode);\n\n    if (!m) return null;\n\n    // look for points inside the triangle of hole point, segment intersection and endpoint;\n    // if there are no points found, we have a valid connection;\n    // otherwise choose the point of the minimum angle with the ray as connection point\n\n    var stop = m,\n        mx = m.x,\n        my = m.y,\n        tanMin = Infinity,\n        tan;\n\n    p = m;\n\n    do {\n        if (hx >= p.x && p.x >= mx && hx !== p.x &&\n                pointInTriangle(hy < my ? hx : qx, hy, mx, my, hy < my ? qx : hx, hy, p.x, p.y)) {\n\n            tan = Math.abs(hy - p.y) / (hx - p.x); // tangential\n\n            if (locallyInside(p, hole) &&\n                (tan < tanMin || (tan === tanMin && (p.x > m.x || (p.x === m.x && sectorContainsSector(m, p)))))) {\n                m = p;\n                tanMin = tan;\n            }\n        }\n\n        p = p.next;\n    } while (p !== stop);\n\n    return m;\n}\n\n// whether sector in vertex m contains sector in vertex p in the same coordinates\nfunction sectorContainsSector(m, p) {\n    return area(m.prev, m, p.prev) < 0 && area(p.next, m, m.next) < 0;\n}\n\n// interlink polygon nodes in z-order\nfunction indexCurve(start, minX, minY, invSize) {\n    var p = start;\n    do {\n        if (p.z === 0) p.z = zOrder(p.x, p.y, minX, minY, invSize);\n        p.prevZ = p.prev;\n        p.nextZ = p.next;\n        p = p.next;\n    } while (p !== start);\n\n    p.prevZ.nextZ = null;\n    p.prevZ = null;\n\n    sortLinked(p);\n}\n\n// Simon Tatham's linked list merge sort algorithm\n// http://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html\nfunction sortLinked(list) {\n    var i, p, q, e, tail, numMerges, pSize, qSize,\n        inSize = 1;\n\n    do {\n        p = list;\n        list = null;\n        tail = null;\n        numMerges = 0;\n\n        while (p) {\n            numMerges++;\n            q = p;\n            pSize = 0;\n            for (i = 0; i < inSize; i++) {\n                pSize++;\n                q = q.nextZ;\n                if (!q) break;\n            }\n            qSize = inSize;\n\n            while (pSize > 0 || (qSize > 0 && q)) {\n\n                if (pSize !== 0 && (qSize === 0 || !q || p.z <= q.z)) {\n                    e = p;\n                    p = p.nextZ;\n                    pSize--;\n                } else {\n                    e = q;\n                    q = q.nextZ;\n                    qSize--;\n                }\n\n                if (tail) tail.nextZ = e;\n                else list = e;\n\n                e.prevZ = tail;\n                tail = e;\n            }\n\n            p = q;\n        }\n\n        tail.nextZ = null;\n        inSize *= 2;\n\n    } while (numMerges > 1);\n\n    return list;\n}\n\n// z-order of a point given coords and inverse of the longer side of data bbox\nfunction zOrder(x, y, minX, minY, invSize) {\n    // coords are transformed into non-negative 15-bit integer range\n    x = (x - minX) * invSize | 0;\n    y = (y - minY) * invSize | 0;\n\n    x = (x | (x << 8)) & 0x00FF00FF;\n    x = (x | (x << 4)) & 0x0F0F0F0F;\n    x = (x | (x << 2)) & 0x33333333;\n    x = (x | (x << 1)) & 0x55555555;\n\n    y = (y | (y << 8)) & 0x00FF00FF;\n    y = (y | (y << 4)) & 0x0F0F0F0F;\n    y = (y | (y << 2)) & 0x33333333;\n    y = (y | (y << 1)) & 0x55555555;\n\n    return x | (y << 1);\n}\n\n// find the leftmost node of a polygon ring\nfunction getLeftmost(start) {\n    var p = start,\n        leftmost = start;\n    do {\n        if (p.x < leftmost.x || (p.x === leftmost.x && p.y < leftmost.y)) leftmost = p;\n        p = p.next;\n    } while (p !== start);\n\n    return leftmost;\n}\n\n// check if a point lies within a convex triangle\nfunction pointInTriangle(ax, ay, bx, by, cx, cy, px, py) {\n    return (cx - px) * (ay - py) >= (ax - px) * (cy - py) &&\n           (ax - px) * (by - py) >= (bx - px) * (ay - py) &&\n           (bx - px) * (cy - py) >= (cx - px) * (by - py);\n}\n\n// check if a diagonal between two polygon nodes is valid (lies in polygon interior)\nfunction isValidDiagonal(a, b) {\n    return a.next.i !== b.i && a.prev.i !== b.i && !intersectsPolygon(a, b) && // dones't intersect other edges\n           (locallyInside(a, b) && locallyInside(b, a) && middleInside(a, b) && // locally visible\n            (area(a.prev, a, b.prev) || area(a, b.prev, b)) || // does not create opposite-facing sectors\n            equals(a, b) && area(a.prev, a, a.next) > 0 && area(b.prev, b, b.next) > 0); // special zero-length case\n}\n\n// signed area of a triangle\nfunction area(p, q, r) {\n    return (q.y - p.y) * (r.x - q.x) - (q.x - p.x) * (r.y - q.y);\n}\n\n// check if two points are equal\nfunction equals(p1, p2) {\n    return p1.x === p2.x && p1.y === p2.y;\n}\n\n// check if two segments intersect\nfunction intersects(p1, q1, p2, q2) {\n    var o1 = sign(area(p1, q1, p2));\n    var o2 = sign(area(p1, q1, q2));\n    var o3 = sign(area(p2, q2, p1));\n    var o4 = sign(area(p2, q2, q1));\n\n    if (o1 !== o2 && o3 !== o4) return true; // general case\n\n    if (o1 === 0 && onSegment(p1, p2, q1)) return true; // p1, q1 and p2 are collinear and p2 lies on p1q1\n    if (o2 === 0 && onSegment(p1, q2, q1)) return true; // p1, q1 and q2 are collinear and q2 lies on p1q1\n    if (o3 === 0 && onSegment(p2, p1, q2)) return true; // p2, q2 and p1 are collinear and p1 lies on p2q2\n    if (o4 === 0 && onSegment(p2, q1, q2)) return true; // p2, q2 and q1 are collinear and q1 lies on p2q2\n\n    return false;\n}\n\n// for collinear points p, q, r, check if point q lies on segment pr\nfunction onSegment(p, q, r) {\n    return q.x <= Math.max(p.x, r.x) && q.x >= Math.min(p.x, r.x) && q.y <= Math.max(p.y, r.y) && q.y >= Math.min(p.y, r.y);\n}\n\nfunction sign(num) {\n    return num > 0 ? 1 : num < 0 ? -1 : 0;\n}\n\n// check if a polygon diagonal intersects any polygon segments\nfunction intersectsPolygon(a, b) {\n    var p = a;\n    do {\n        if (p.i !== a.i && p.next.i !== a.i && p.i !== b.i && p.next.i !== b.i &&\n                intersects(p, p.next, a, b)) return true;\n        p = p.next;\n    } while (p !== a);\n\n    return false;\n}\n\n// check if a polygon diagonal is locally inside the polygon\nfunction locallyInside(a, b) {\n    return area(a.prev, a, a.next) < 0 ?\n        area(a, b, a.next) >= 0 && area(a, a.prev, b) >= 0 :\n        area(a, b, a.prev) < 0 || area(a, a.next, b) < 0;\n}\n\n// check if the middle point of a polygon diagonal is inside the polygon\nfunction middleInside(a, b) {\n    var p = a,\n        inside = false,\n        px = (a.x + b.x) / 2,\n        py = (a.y + b.y) / 2;\n    do {\n        if (((p.y > py) !== (p.next.y > py)) && p.next.y !== p.y &&\n                (px < (p.next.x - p.x) * (py - p.y) / (p.next.y - p.y) + p.x))\n            inside = !inside;\n        p = p.next;\n    } while (p !== a);\n\n    return inside;\n}\n\n// link two polygon vertices with a bridge; if the vertices belong to the same ring, it splits polygon into two;\n// if one belongs to the outer ring and another to a hole, it merges it into a single ring\nfunction splitPolygon(a, b) {\n    var a2 = new Node(a.i, a.x, a.y),\n        b2 = new Node(b.i, b.x, b.y),\n        an = a.next,\n        bp = b.prev;\n\n    a.next = b;\n    b.prev = a;\n\n    a2.next = an;\n    an.prev = a2;\n\n    b2.next = a2;\n    a2.prev = b2;\n\n    bp.next = b2;\n    b2.prev = bp;\n\n    return b2;\n}\n\n// create a node and optionally link it with previous one (in a circular doubly linked list)\nfunction insertNode(i, x, y, last) {\n    var p = new Node(i, x, y);\n\n    if (!last) {\n        p.prev = p;\n        p.next = p;\n\n    } else {\n        p.next = last.next;\n        p.prev = last;\n        last.next.prev = p;\n        last.next = p;\n    }\n    return p;\n}\n\nfunction removeNode(p) {\n    p.next.prev = p.prev;\n    p.prev.next = p.next;\n\n    if (p.prevZ) p.prevZ.nextZ = p.nextZ;\n    if (p.nextZ) p.nextZ.prevZ = p.prevZ;\n}\n\nfunction Node(i, x, y) {\n    // vertex index in coordinates array\n    this.i = i;\n\n    // vertex coordinates\n    this.x = x;\n    this.y = y;\n\n    // previous and next vertex nodes in a polygon ring\n    this.prev = null;\n    this.next = null;\n\n    // z-order curve value\n    this.z = 0;\n\n    // previous and next nodes in z-order\n    this.prevZ = null;\n    this.nextZ = null;\n\n    // indicates whether this is a steiner point\n    this.steiner = false;\n}\n\n// return a percentage difference between the polygon area and its triangulation area;\n// used to verify correctness of triangulation\nearcut.deviation = function (data, holeIndices, dim, triangles) {\n    var hasHoles = holeIndices && holeIndices.length;\n    var outerLen = hasHoles ? holeIndices[0] * dim : data.length;\n\n    var polygonArea = Math.abs(signedArea(data, 0, outerLen, dim));\n    if (hasHoles) {\n        for (var i = 0, len = holeIndices.length; i < len; i++) {\n            var start = holeIndices[i] * dim;\n            var end = i < len - 1 ? holeIndices[i + 1] * dim : data.length;\n            polygonArea -= Math.abs(signedArea(data, start, end, dim));\n        }\n    }\n\n    var trianglesArea = 0;\n    for (i = 0; i < triangles.length; i += 3) {\n        var a = triangles[i] * dim;\n        var b = triangles[i + 1] * dim;\n        var c = triangles[i + 2] * dim;\n        trianglesArea += Math.abs(\n            (data[a] - data[c]) * (data[b + 1] - data[a + 1]) -\n            (data[a] - data[b]) * (data[c + 1] - data[a + 1]));\n    }\n\n    return polygonArea === 0 && trianglesArea === 0 ? 0 :\n        Math.abs((trianglesArea - polygonArea) / polygonArea);\n};\n\nfunction signedArea(data, start, end, dim) {\n    var sum = 0;\n    for (var i = start, j = end - dim; i < end; i += dim) {\n        sum += (data[j] - data[i]) * (data[i + 1] + data[j + 1]);\n        j = i;\n    }\n    return sum;\n}\n\n// turn a polygon in a multi-dimensional array form (e.g. as in GeoJSON) into a form Earcut accepts\nearcut.flatten = function (data) {\n    var dim = data[0][0].length,\n        result = {vertices: [], holes: [], dimensions: dim},\n        holeIndex = 0;\n\n    for (var i = 0; i < data.length; i++) {\n        for (var j = 0; j < data[i].length; j++) {\n            for (var d = 0; d < dim; d++) result.vertices.push(data[i][j][d]);\n        }\n        if (i > 0) {\n            holeIndex += data[i - 1].length;\n            result.holes.push(holeIndex);\n        }\n    }\n    return result;\n};\n","'use strict';\n\nvar GetIntrinsic = require('get-intrinsic');\n\nvar callBind = require('./');\n\nvar $indexOf = callBind(GetIntrinsic('String.prototype.indexOf'));\n\nmodule.exports = function callBoundIntrinsic(name, allowMissing) {\n\tvar intrinsic = GetIntrinsic(name, !!allowMissing);\n\tif (typeof intrinsic === 'function' && $indexOf(name, '.prototype.') > -1) {\n\t\treturn callBind(intrinsic);\n\t}\n\treturn intrinsic;\n};\n","!function(t,i){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=i():\"function\"==typeof define&&define.amd?define(i):(t=t||self).RBush=i()}(this,function(){\"use strict\";function t(t,r,e,a,h){!function t(n,r,e,a,h){for(;a>e;){if(a-e>600){var o=a-e+1,s=r-e+1,l=Math.log(o),f=.5*Math.exp(2*l/3),u=.5*Math.sqrt(l*f*(o-f)/o)*(s-o/2<0?-1:1),m=Math.max(e,Math.floor(r-s*f/o+u)),c=Math.min(a,Math.floor(r+(o-s)*f/o+u));t(n,r,m,c,h)}var p=n[r],d=e,x=a;for(i(n,e,r),h(n[a],p)>0&&i(n,e,a);d<x;){for(i(n,d,x),d++,x--;h(n[d],p)<0;)d++;for(;h(n[x],p)>0;)x--}0===h(n[e],p)?i(n,e,x):i(n,++x,a),x<=r&&(e=x+1),r<=x&&(a=x-1)}}(t,r,e||0,a||t.length-1,h||n)}function i(t,i,n){var r=t[i];t[i]=t[n],t[n]=r}function n(t,i){return t<i?-1:t>i?1:0}var r=function(t){void 0===t&&(t=9),this._maxEntries=Math.max(4,t),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()};function e(t,i,n){if(!n)return i.indexOf(t);for(var r=0;r<i.length;r++)if(n(t,i[r]))return r;return-1}function a(t,i){h(t,0,t.children.length,i,t)}function h(t,i,n,r,e){e||(e=p(null)),e.minX=1/0,e.minY=1/0,e.maxX=-1/0,e.maxY=-1/0;for(var a=i;a<n;a++){var h=t.children[a];o(e,t.leaf?r(h):h)}return e}function o(t,i){return t.minX=Math.min(t.minX,i.minX),t.minY=Math.min(t.minY,i.minY),t.maxX=Math.max(t.maxX,i.maxX),t.maxY=Math.max(t.maxY,i.maxY),t}function s(t,i){return t.minX-i.minX}function l(t,i){return t.minY-i.minY}function f(t){return(t.maxX-t.minX)*(t.maxY-t.minY)}function u(t){return t.maxX-t.minX+(t.maxY-t.minY)}function m(t,i){return t.minX<=i.minX&&t.minY<=i.minY&&i.maxX<=t.maxX&&i.maxY<=t.maxY}function c(t,i){return i.minX<=t.maxX&&i.minY<=t.maxY&&i.maxX>=t.minX&&i.maxY>=t.minY}function p(t){return{children:t,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function d(i,n,r,e,a){for(var h=[n,r];h.length;)if(!((r=h.pop())-(n=h.pop())<=e)){var o=n+Math.ceil((r-n)/e/2)*e;t(i,o,n,r,a),h.push(n,o,o,r)}}return r.prototype.all=function(){return this._all(this.data,[])},r.prototype.search=function(t){var i=this.data,n=[];if(!c(t,i))return n;for(var r=this.toBBox,e=[];i;){for(var a=0;a<i.children.length;a++){var h=i.children[a],o=i.leaf?r(h):h;c(t,o)&&(i.leaf?n.push(h):m(t,o)?this._all(h,n):e.push(h))}i=e.pop()}return n},r.prototype.collides=function(t){var i=this.data;if(!c(t,i))return!1;for(var n=[];i;){for(var r=0;r<i.children.length;r++){var e=i.children[r],a=i.leaf?this.toBBox(e):e;if(c(t,a)){if(i.leaf||m(t,a))return!0;n.push(e)}}i=n.pop()}return!1},r.prototype.load=function(t){if(!t||!t.length)return this;if(t.length<this._minEntries){for(var i=0;i<t.length;i++)this.insert(t[i]);return this}var n=this._build(t.slice(),0,t.length-1,0);if(this.data.children.length)if(this.data.height===n.height)this._splitRoot(this.data,n);else{if(this.data.height<n.height){var r=this.data;this.data=n,n=r}this._insert(n,this.data.height-n.height-1,!0)}else this.data=n;return this},r.prototype.insert=function(t){return t&&this._insert(t,this.data.height-1),this},r.prototype.clear=function(){return this.data=p([]),this},r.prototype.remove=function(t,i){if(!t)return this;for(var n,r,a,h=this.data,o=this.toBBox(t),s=[],l=[];h||s.length;){if(h||(h=s.pop(),r=s[s.length-1],n=l.pop(),a=!0),h.leaf){var f=e(t,h.children,i);if(-1!==f)return h.children.splice(f,1),s.push(h),this._condense(s),this}a||h.leaf||!m(h,o)?r?(n++,h=r.children[n],a=!1):h=null:(s.push(h),l.push(n),n=0,r=h,h=h.children[0])}return this},r.prototype.toBBox=function(t){return t},r.prototype.compareMinX=function(t,i){return t.minX-i.minX},r.prototype.compareMinY=function(t,i){return t.minY-i.minY},r.prototype.toJSON=function(){return this.data},r.prototype.fromJSON=function(t){return this.data=t,this},r.prototype._all=function(t,i){for(var n=[];t;)t.leaf?i.push.apply(i,t.children):n.push.apply(n,t.children),t=n.pop();return i},r.prototype._build=function(t,i,n,r){var e,h=n-i+1,o=this._maxEntries;if(h<=o)return a(e=p(t.slice(i,n+1)),this.toBBox),e;r||(r=Math.ceil(Math.log(h)/Math.log(o)),o=Math.ceil(h/Math.pow(o,r-1))),(e=p([])).leaf=!1,e.height=r;var s=Math.ceil(h/o),l=s*Math.ceil(Math.sqrt(o));d(t,i,n,l,this.compareMinX);for(var f=i;f<=n;f+=l){var u=Math.min(f+l-1,n);d(t,f,u,s,this.compareMinY);for(var m=f;m<=u;m+=s){var c=Math.min(m+s-1,u);e.children.push(this._build(t,m,c,r-1))}}return a(e,this.toBBox),e},r.prototype._chooseSubtree=function(t,i,n,r){for(;r.push(i),!i.leaf&&r.length-1!==n;){for(var e=1/0,a=1/0,h=void 0,o=0;o<i.children.length;o++){var s=i.children[o],l=f(s),u=(m=t,c=s,(Math.max(c.maxX,m.maxX)-Math.min(c.minX,m.minX))*(Math.max(c.maxY,m.maxY)-Math.min(c.minY,m.minY))-l);u<a?(a=u,e=l<e?l:e,h=s):u===a&&l<e&&(e=l,h=s)}i=h||i.children[0]}var m,c;return i},r.prototype._insert=function(t,i,n){var r=n?t:this.toBBox(t),e=[],a=this._chooseSubtree(r,this.data,i,e);for(a.children.push(t),o(a,r);i>=0&&e[i].children.length>this._maxEntries;)this._split(e,i),i--;this._adjustParentBBoxes(r,e,i)},r.prototype._split=function(t,i){var n=t[i],r=n.children.length,e=this._minEntries;this._chooseSplitAxis(n,e,r);var h=this._chooseSplitIndex(n,e,r),o=p(n.children.splice(h,n.children.length-h));o.height=n.height,o.leaf=n.leaf,a(n,this.toBBox),a(o,this.toBBox),i?t[i-1].children.push(o):this._splitRoot(n,o)},r.prototype._splitRoot=function(t,i){this.data=p([t,i]),this.data.height=t.height+1,this.data.leaf=!1,a(this.data,this.toBBox)},r.prototype._chooseSplitIndex=function(t,i,n){for(var r,e,a,o,s,l,u,m=1/0,c=1/0,p=i;p<=n-i;p++){var d=h(t,0,p,this.toBBox),x=h(t,p,n,this.toBBox),v=(e=d,a=x,o=void 0,s=void 0,l=void 0,u=void 0,o=Math.max(e.minX,a.minX),s=Math.max(e.minY,a.minY),l=Math.min(e.maxX,a.maxX),u=Math.min(e.maxY,a.maxY),Math.max(0,l-o)*Math.max(0,u-s)),M=f(d)+f(x);v<m?(m=v,r=p,c=M<c?M:c):v===m&&M<c&&(c=M,r=p)}return r||n-i},r.prototype._chooseSplitAxis=function(t,i,n){var r=t.leaf?this.compareMinX:s,e=t.leaf?this.compareMinY:l;this._allDistMargin(t,i,n,r)<this._allDistMargin(t,i,n,e)&&t.children.sort(r)},r.prototype._allDistMargin=function(t,i,n,r){t.children.sort(r);for(var e=this.toBBox,a=h(t,0,i,e),s=h(t,n-i,n,e),l=u(a)+u(s),f=i;f<n-i;f++){var m=t.children[f];o(a,t.leaf?e(m):m),l+=u(a)}for(var c=n-i-1;c>=i;c--){var p=t.children[c];o(s,t.leaf?e(p):p),l+=u(s)}return l},r.prototype._adjustParentBBoxes=function(t,i,n){for(var r=n;r>=0;r--)o(i[r],t)},r.prototype._condense=function(t){for(var i=t.length-1,n=void 0;i>=0;i--)0===t[i].children.length?i>0?(n=t[i-1].children).splice(n.indexOf(t[i]),1):this.clear():a(t[i],this.toBBox)},r});\n","var array = Array.prototype;\n\nexport var slice = array.slice;\nexport var map = array.map;\n","export default function(a, b) {\n  return a < b ? -1 : a > b ? 1 : a >= b ? 0 : NaN;\n}\n","import ascending from \"./ascending\";\nimport bisector from \"./bisector\";\n\nvar ascendingBisect = bisector(ascending);\nexport var bisectRight = ascendingBisect.right;\nexport var bisectLeft = ascendingBisect.left;\nexport default bisectRight;\n","import ascending from \"./ascending\";\n\nexport default function(compare) {\n  if (compare.length === 1) compare = ascendingComparator(compare);\n  return {\n    left: function(a, x, lo, hi) {\n      if (lo == null) lo = 0;\n      if (hi == null) hi = a.length;\n      while (lo < hi) {\n        var mid = lo + hi >>> 1;\n        if (compare(a[mid], x) < 0) lo = mid + 1;\n        else hi = mid;\n      }\n      return lo;\n    },\n    right: function(a, x, lo, hi) {\n      if (lo == null) lo = 0;\n      if (hi == null) hi = a.length;\n      while (lo < hi) {\n        var mid = lo + hi >>> 1;\n        if (compare(a[mid], x) > 0) hi = mid;\n        else lo = mid + 1;\n      }\n      return lo;\n    }\n  };\n}\n\nfunction ascendingComparator(f) {\n  return function(d, x) {\n    return ascending(f(d), x);\n  };\n}\n","export default function(arrays) {\n  var n = arrays.length,\n      m,\n      i = -1,\n      j = 0,\n      merged,\n      array;\n\n  while (++i < n) j += arrays[i].length;\n  merged = new Array(j);\n\n  while (--n >= 0) {\n    array = arrays[n];\n    m = array.length;\n    while (--m >= 0) {\n      merged[--j] = array[m];\n    }\n  }\n\n  return merged;\n}\n","var e10 = Math.sqrt(50),\n    e5 = Math.sqrt(10),\n    e2 = Math.sqrt(2);\n\nexport default function(start, stop, count) {\n  var reverse,\n      i = -1,\n      n,\n      ticks,\n      step;\n\n  stop = +stop, start = +start, count = +count;\n  if (start === stop && count > 0) return [start];\n  if (reverse = stop < start) n = start, start = stop, stop = n;\n  if ((step = tickIncrement(start, stop, count)) === 0 || !isFinite(step)) return [];\n\n  if (step > 0) {\n    start = Math.ceil(start / step);\n    stop = Math.floor(stop / step);\n    ticks = new Array(n = Math.ceil(stop - start + 1));\n    while (++i < n) ticks[i] = (start + i) * step;\n  } else {\n    start = Math.floor(start * step);\n    stop = Math.ceil(stop * step);\n    ticks = new Array(n = Math.ceil(start - stop + 1));\n    while (++i < n) ticks[i] = (start - i) / step;\n  }\n\n  if (reverse) ticks.reverse();\n\n  return ticks;\n}\n\nexport function tickIncrement(start, stop, count) {\n  var step = (stop - start) / Math.max(0, count),\n      power = Math.floor(Math.log(step) / Math.LN10),\n      error = step / Math.pow(10, power);\n  return power >= 0\n      ? (error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1) * Math.pow(10, power)\n      : -Math.pow(10, -power) / (error >= e10 ? 10 : error >= e5 ? 5 : error >= e2 ? 2 : 1);\n}\n\nexport function tickStep(start, stop, count) {\n  var step0 = Math.abs(stop - start) / Math.max(0, count),\n      step1 = Math.pow(10, Math.floor(Math.log(step0) / Math.LN10)),\n      error = step0 / step1;\n  if (error >= e10) step1 *= 10;\n  else if (error >= e5) step1 *= 5;\n  else if (error >= e2) step1 *= 2;\n  return stop < start ? -step1 : step1;\n}\n","// Adds floating point numbers with twice the normal precision.\n// Reference: J. R. Shewchuk, Adaptive Precision Floating-Point Arithmetic and\n// Fast Robust Geometric Predicates, Discrete & Computational Geometry 18(3)\n// 305–363 (1997).\n// Code adapted from GeographicLib by Charles F. F. Karney,\n// http://geographiclib.sourceforge.net/\n\nexport default function() {\n  return new Adder;\n}\n\nfunction Adder() {\n  this.reset();\n}\n\nAdder.prototype = {\n  constructor: Adder,\n  reset: function() {\n    this.s = // rounded value\n    this.t = 0; // exact error\n  },\n  add: function(y) {\n    add(temp, y, this.t);\n    add(this, temp.s, this.s);\n    if (this.s) this.t += temp.t;\n    else this.s = temp.t;\n  },\n  valueOf: function() {\n    return this.s;\n  }\n};\n\nvar temp = new Adder;\n\nfunction add(adder, a, b) {\n  var x = adder.s = a + b,\n      bv = x - a,\n      av = x - bv;\n  adder.t = (a - av) + (b - bv);\n}\n","import adder from \"./adder\";\nimport {atan2, cos, quarterPi, radians, sin, tau} from \"./math\";\nimport noop from \"./noop\";\nimport stream from \"./stream\";\n\nexport var areaRingSum = adder();\n\nvar areaSum = adder(),\n    lambda00,\n    phi00,\n    lambda0,\n    cosPhi0,\n    sinPhi0;\n\nexport var areaStream = {\n  point: noop,\n  lineStart: noop,\n  lineEnd: noop,\n  polygonStart: function() {\n    areaRingSum.reset();\n    areaStream.lineStart = areaRingStart;\n    areaStream.lineEnd = areaRingEnd;\n  },\n  polygonEnd: function() {\n    var areaRing = +areaRingSum;\n    areaSum.add(areaRing < 0 ? tau + areaRing : areaRing);\n    this.lineStart = this.lineEnd = this.point = noop;\n  },\n  sphere: function() {\n    areaSum.add(tau);\n  }\n};\n\nfunction areaRingStart() {\n  areaStream.point = areaPointFirst;\n}\n\nfunction areaRingEnd() {\n  areaPoint(lambda00, phi00);\n}\n\nfunction areaPointFirst(lambda, phi) {\n  areaStream.point = areaPoint;\n  lambda00 = lambda, phi00 = phi;\n  lambda *= radians, phi *= radians;\n  lambda0 = lambda, cosPhi0 = cos(phi = phi / 2 + quarterPi), sinPhi0 = sin(phi);\n}\n\nfunction areaPoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  phi = phi / 2 + quarterPi; // half the angular distance from south pole\n\n  // Spherical excess E for a spherical triangle with vertices: south pole,\n  // previous point, current point.  Uses a formula derived from Cagnoli’s\n  // theorem.  See Todhunter, Spherical Trig. (1871), Sec. 103, Eq. (2).\n  var dLambda = lambda - lambda0,\n      sdLambda = dLambda >= 0 ? 1 : -1,\n      adLambda = sdLambda * dLambda,\n      cosPhi = cos(phi),\n      sinPhi = sin(phi),\n      k = sinPhi0 * sinPhi,\n      u = cosPhi0 * cosPhi + k * cos(adLambda),\n      v = k * sdLambda * sin(adLambda);\n  areaRingSum.add(atan2(v, u));\n\n  // Advance the previous points.\n  lambda0 = lambda, cosPhi0 = cosPhi, sinPhi0 = sinPhi;\n}\n\nexport default function(object) {\n  areaSum.reset();\n  stream(object, areaStream);\n  return areaSum * 2;\n}\n","import adder from \"./adder\";\nimport {areaStream, areaRingSum} from \"./area\";\nimport {cartesian, cartesianCross, cartesianNormalizeInPlace, spherical} from \"./cartesian\";\nimport {abs, degrees, epsilon, radians} from \"./math\";\nimport stream from \"./stream\";\n\nvar lambda0, phi0, lambda1, phi1, // bounds\n    lambda2, // previous lambda-coordinate\n    lambda00, phi00, // first point\n    p0, // previous 3D point\n    deltaSum = adder(),\n    ranges,\n    range;\n\nvar boundsStream = {\n  point: boundsPoint,\n  lineStart: boundsLineStart,\n  lineEnd: boundsLineEnd,\n  polygonStart: function() {\n    boundsStream.point = boundsRingPoint;\n    boundsStream.lineStart = boundsRingStart;\n    boundsStream.lineEnd = boundsRingEnd;\n    deltaSum.reset();\n    areaStream.polygonStart();\n  },\n  polygonEnd: function() {\n    areaStream.polygonEnd();\n    boundsStream.point = boundsPoint;\n    boundsStream.lineStart = boundsLineStart;\n    boundsStream.lineEnd = boundsLineEnd;\n    if (areaRingSum < 0) lambda0 = -(lambda1 = 180), phi0 = -(phi1 = 90);\n    else if (deltaSum > epsilon) phi1 = 90;\n    else if (deltaSum < -epsilon) phi0 = -90;\n    range[0] = lambda0, range[1] = lambda1;\n  }\n};\n\nfunction boundsPoint(lambda, phi) {\n  ranges.push(range = [lambda0 = lambda, lambda1 = lambda]);\n  if (phi < phi0) phi0 = phi;\n  if (phi > phi1) phi1 = phi;\n}\n\nfunction linePoint(lambda, phi) {\n  var p = cartesian([lambda * radians, phi * radians]);\n  if (p0) {\n    var normal = cartesianCross(p0, p),\n        equatorial = [normal[1], -normal[0], 0],\n        inflection = cartesianCross(equatorial, normal);\n    cartesianNormalizeInPlace(inflection);\n    inflection = spherical(inflection);\n    var delta = lambda - lambda2,\n        sign = delta > 0 ? 1 : -1,\n        lambdai = inflection[0] * degrees * sign,\n        phii,\n        antimeridian = abs(delta) > 180;\n    if (antimeridian ^ (sign * lambda2 < lambdai && lambdai < sign * lambda)) {\n      phii = inflection[1] * degrees;\n      if (phii > phi1) phi1 = phii;\n    } else if (lambdai = (lambdai + 360) % 360 - 180, antimeridian ^ (sign * lambda2 < lambdai && lambdai < sign * lambda)) {\n      phii = -inflection[1] * degrees;\n      if (phii < phi0) phi0 = phii;\n    } else {\n      if (phi < phi0) phi0 = phi;\n      if (phi > phi1) phi1 = phi;\n    }\n    if (antimeridian) {\n      if (lambda < lambda2) {\n        if (angle(lambda0, lambda) > angle(lambda0, lambda1)) lambda1 = lambda;\n      } else {\n        if (angle(lambda, lambda1) > angle(lambda0, lambda1)) lambda0 = lambda;\n      }\n    } else {\n      if (lambda1 >= lambda0) {\n        if (lambda < lambda0) lambda0 = lambda;\n        if (lambda > lambda1) lambda1 = lambda;\n      } else {\n        if (lambda > lambda2) {\n          if (angle(lambda0, lambda) > angle(lambda0, lambda1)) lambda1 = lambda;\n        } else {\n          if (angle(lambda, lambda1) > angle(lambda0, lambda1)) lambda0 = lambda;\n        }\n      }\n    }\n  } else {\n    ranges.push(range = [lambda0 = lambda, lambda1 = lambda]);\n  }\n  if (phi < phi0) phi0 = phi;\n  if (phi > phi1) phi1 = phi;\n  p0 = p, lambda2 = lambda;\n}\n\nfunction boundsLineStart() {\n  boundsStream.point = linePoint;\n}\n\nfunction boundsLineEnd() {\n  range[0] = lambda0, range[1] = lambda1;\n  boundsStream.point = boundsPoint;\n  p0 = null;\n}\n\nfunction boundsRingPoint(lambda, phi) {\n  if (p0) {\n    var delta = lambda - lambda2;\n    deltaSum.add(abs(delta) > 180 ? delta + (delta > 0 ? 360 : -360) : delta);\n  } else {\n    lambda00 = lambda, phi00 = phi;\n  }\n  areaStream.point(lambda, phi);\n  linePoint(lambda, phi);\n}\n\nfunction boundsRingStart() {\n  areaStream.lineStart();\n}\n\nfunction boundsRingEnd() {\n  boundsRingPoint(lambda00, phi00);\n  areaStream.lineEnd();\n  if (abs(deltaSum) > epsilon) lambda0 = -(lambda1 = 180);\n  range[0] = lambda0, range[1] = lambda1;\n  p0 = null;\n}\n\n// Finds the left-right distance between two longitudes.\n// This is almost the same as (lambda1 - lambda0 + 360°) % 360°, except that we want\n// the distance between ±180° to be 360°.\nfunction angle(lambda0, lambda1) {\n  return (lambda1 -= lambda0) < 0 ? lambda1 + 360 : lambda1;\n}\n\nfunction rangeCompare(a, b) {\n  return a[0] - b[0];\n}\n\nfunction rangeContains(range, x) {\n  return range[0] <= range[1] ? range[0] <= x && x <= range[1] : x < range[0] || range[1] < x;\n}\n\nexport default function(feature) {\n  var i, n, a, b, merged, deltaMax, delta;\n\n  phi1 = lambda1 = -(lambda0 = phi0 = Infinity);\n  ranges = [];\n  stream(feature, boundsStream);\n\n  // First, sort ranges by their minimum longitudes.\n  if (n = ranges.length) {\n    ranges.sort(rangeCompare);\n\n    // Then, merge any ranges that overlap.\n    for (i = 1, a = ranges[0], merged = [a]; i < n; ++i) {\n      b = ranges[i];\n      if (rangeContains(a, b[0]) || rangeContains(a, b[1])) {\n        if (angle(a[0], b[1]) > angle(a[0], a[1])) a[1] = b[1];\n        if (angle(b[0], a[1]) > angle(a[0], a[1])) a[0] = b[0];\n      } else {\n        merged.push(a = b);\n      }\n    }\n\n    // Finally, find the largest gap between the merged ranges.\n    // The final bounding box will be the inverse of this gap.\n    for (deltaMax = -Infinity, n = merged.length - 1, i = 0, a = merged[n]; i <= n; a = b, ++i) {\n      b = merged[i];\n      if ((delta = angle(a[1], b[0])) > deltaMax) deltaMax = delta, lambda0 = b[0], lambda1 = a[1];\n    }\n  }\n\n  ranges = range = null;\n\n  return lambda0 === Infinity || phi0 === Infinity\n      ? [[NaN, NaN], [NaN, NaN]]\n      : [[lambda0, phi0], [lambda1, phi1]];\n}\n","import {asin, atan2, cos, sin, sqrt} from \"./math\";\n\nexport function spherical(cartesian) {\n  return [atan2(cartesian[1], cartesian[0]), asin(cartesian[2])];\n}\n\nexport function cartesian(spherical) {\n  var lambda = spherical[0], phi = spherical[1], cosPhi = cos(phi);\n  return [cosPhi * cos(lambda), cosPhi * sin(lambda), sin(phi)];\n}\n\nexport function cartesianDot(a, b) {\n  return a[0] * b[0] + a[1] * b[1] + a[2] * b[2];\n}\n\nexport function cartesianCross(a, b) {\n  return [a[1] * b[2] - a[2] * b[1], a[2] * b[0] - a[0] * b[2], a[0] * b[1] - a[1] * b[0]];\n}\n\n// TODO return a\nexport function cartesianAddInPlace(a, b) {\n  a[0] += b[0], a[1] += b[1], a[2] += b[2];\n}\n\nexport function cartesianScale(vector, k) {\n  return [vector[0] * k, vector[1] * k, vector[2] * k];\n}\n\n// TODO return d\nexport function cartesianNormalizeInPlace(d) {\n  var l = sqrt(d[0] * d[0] + d[1] * d[1] + d[2] * d[2]);\n  d[0] /= l, d[1] /= l, d[2] /= l;\n}\n","import {asin, atan2, cos, degrees, epsilon, epsilon2, radians, sin, sqrt} from \"./math\";\nimport noop from \"./noop\";\nimport stream from \"./stream\";\n\nvar W0, W1,\n    X0, Y0, Z0,\n    X1, Y1, Z1,\n    X2, Y2, Z2,\n    lambda00, phi00, // first point\n    x0, y0, z0; // previous point\n\nvar centroidStream = {\n  sphere: noop,\n  point: centroidPoint,\n  lineStart: centroidLineStart,\n  lineEnd: centroidLineEnd,\n  polygonStart: function() {\n    centroidStream.lineStart = centroidRingStart;\n    centroidStream.lineEnd = centroidRingEnd;\n  },\n  polygonEnd: function() {\n    centroidStream.lineStart = centroidLineStart;\n    centroidStream.lineEnd = centroidLineEnd;\n  }\n};\n\n// Arithmetic mean of Cartesian vectors.\nfunction centroidPoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  var cosPhi = cos(phi);\n  centroidPointCartesian(cosPhi * cos(lambda), cosPhi * sin(lambda), sin(phi));\n}\n\nfunction centroidPointCartesian(x, y, z) {\n  ++W0;\n  X0 += (x - X0) / W0;\n  Y0 += (y - Y0) / W0;\n  Z0 += (z - Z0) / W0;\n}\n\nfunction centroidLineStart() {\n  centroidStream.point = centroidLinePointFirst;\n}\n\nfunction centroidLinePointFirst(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  var cosPhi = cos(phi);\n  x0 = cosPhi * cos(lambda);\n  y0 = cosPhi * sin(lambda);\n  z0 = sin(phi);\n  centroidStream.point = centroidLinePoint;\n  centroidPointCartesian(x0, y0, z0);\n}\n\nfunction centroidLinePoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  var cosPhi = cos(phi),\n      x = cosPhi * cos(lambda),\n      y = cosPhi * sin(lambda),\n      z = sin(phi),\n      w = atan2(sqrt((w = y0 * z - z0 * y) * w + (w = z0 * x - x0 * z) * w + (w = x0 * y - y0 * x) * w), x0 * x + y0 * y + z0 * z);\n  W1 += w;\n  X1 += w * (x0 + (x0 = x));\n  Y1 += w * (y0 + (y0 = y));\n  Z1 += w * (z0 + (z0 = z));\n  centroidPointCartesian(x0, y0, z0);\n}\n\nfunction centroidLineEnd() {\n  centroidStream.point = centroidPoint;\n}\n\n// See J. E. Brock, The Inertia Tensor for a Spherical Triangle,\n// J. Applied Mechanics 42, 239 (1975).\nfunction centroidRingStart() {\n  centroidStream.point = centroidRingPointFirst;\n}\n\nfunction centroidRingEnd() {\n  centroidRingPoint(lambda00, phi00);\n  centroidStream.point = centroidPoint;\n}\n\nfunction centroidRingPointFirst(lambda, phi) {\n  lambda00 = lambda, phi00 = phi;\n  lambda *= radians, phi *= radians;\n  centroidStream.point = centroidRingPoint;\n  var cosPhi = cos(phi);\n  x0 = cosPhi * cos(lambda);\n  y0 = cosPhi * sin(lambda);\n  z0 = sin(phi);\n  centroidPointCartesian(x0, y0, z0);\n}\n\nfunction centroidRingPoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  var cosPhi = cos(phi),\n      x = cosPhi * cos(lambda),\n      y = cosPhi * sin(lambda),\n      z = sin(phi),\n      cx = y0 * z - z0 * y,\n      cy = z0 * x - x0 * z,\n      cz = x0 * y - y0 * x,\n      m = sqrt(cx * cx + cy * cy + cz * cz),\n      w = asin(m), // line weight = angle\n      v = m && -w / m; // area weight multiplier\n  X2 += v * cx;\n  Y2 += v * cy;\n  Z2 += v * cz;\n  W1 += w;\n  X1 += w * (x0 + (x0 = x));\n  Y1 += w * (y0 + (y0 = y));\n  Z1 += w * (z0 + (z0 = z));\n  centroidPointCartesian(x0, y0, z0);\n}\n\nexport default function(object) {\n  W0 = W1 =\n  X0 = Y0 = Z0 =\n  X1 = Y1 = Z1 =\n  X2 = Y2 = Z2 = 0;\n  stream(object, centroidStream);\n\n  var x = X2,\n      y = Y2,\n      z = Z2,\n      m = x * x + y * y + z * z;\n\n  // If the area-weighted ccentroid is undefined, fall back to length-weighted ccentroid.\n  if (m < epsilon2) {\n    x = X1, y = Y1, z = Z1;\n    // If the feature has zero length, fall back to arithmetic mean of point vectors.\n    if (W1 < epsilon) x = X0, y = Y0, z = Z0;\n    m = x * x + y * y + z * z;\n    // If the feature still has an undefined ccentroid, then return.\n    if (m < epsilon2) return [NaN, NaN];\n  }\n\n  return [atan2(y, x) * degrees, asin(z / sqrt(m)) * degrees];\n}\n","import clip from \"./index\";\nimport {abs, atan, cos, epsilon, halfPi, pi, sin} from \"../math\";\n\nexport default clip(\n  function() { return true; },\n  clipAntimeridianLine,\n  clipAntimeridianInterpolate,\n  [-pi, -halfPi]\n);\n\n// Takes a line and cuts into visible segments. Return values: 0 - there were\n// intersections or the line was empty; 1 - no intersections; 2 - there were\n// intersections, and the first and last segments should be rejoined.\nfunction clipAntimeridianLine(stream) {\n  var lambda0 = NaN,\n      phi0 = NaN,\n      sign0 = NaN,\n      clean; // no intersections\n\n  return {\n    lineStart: function() {\n      stream.lineStart();\n      clean = 1;\n    },\n    point: function(lambda1, phi1) {\n      var sign1 = lambda1 > 0 ? pi : -pi,\n          delta = abs(lambda1 - lambda0);\n      if (abs(delta - pi) < epsilon) { // line crosses a pole\n        stream.point(lambda0, phi0 = (phi0 + phi1) / 2 > 0 ? halfPi : -halfPi);\n        stream.point(sign0, phi0);\n        stream.lineEnd();\n        stream.lineStart();\n        stream.point(sign1, phi0);\n        stream.point(lambda1, phi0);\n        clean = 0;\n      } else if (sign0 !== sign1 && delta >= pi) { // line crosses antimeridian\n        if (abs(lambda0 - sign0) < epsilon) lambda0 -= sign0 * epsilon; // handle degeneracies\n        if (abs(lambda1 - sign1) < epsilon) lambda1 -= sign1 * epsilon;\n        phi0 = clipAntimeridianIntersect(lambda0, phi0, lambda1, phi1);\n        stream.point(sign0, phi0);\n        stream.lineEnd();\n        stream.lineStart();\n        stream.point(sign1, phi0);\n        clean = 0;\n      }\n      stream.point(lambda0 = lambda1, phi0 = phi1);\n      sign0 = sign1;\n    },\n    lineEnd: function() {\n      stream.lineEnd();\n      lambda0 = phi0 = NaN;\n    },\n    clean: function() {\n      return 2 - clean; // if intersections, rejoin first and last segments\n    }\n  };\n}\n\nfunction clipAntimeridianIntersect(lambda0, phi0, lambda1, phi1) {\n  var cosPhi0,\n      cosPhi1,\n      sinLambda0Lambda1 = sin(lambda0 - lambda1);\n  return abs(sinLambda0Lambda1) > epsilon\n      ? atan((sin(phi0) * (cosPhi1 = cos(phi1)) * sin(lambda1)\n          - sin(phi1) * (cosPhi0 = cos(phi0)) * sin(lambda0))\n          / (cosPhi0 * cosPhi1 * sinLambda0Lambda1))\n      : (phi0 + phi1) / 2;\n}\n\nfunction clipAntimeridianInterpolate(from, to, direction, stream) {\n  var phi;\n  if (from == null) {\n    phi = direction * halfPi;\n    stream.point(-pi, phi);\n    stream.point(0, phi);\n    stream.point(pi, phi);\n    stream.point(pi, 0);\n    stream.point(pi, -phi);\n    stream.point(0, -phi);\n    stream.point(-pi, -phi);\n    stream.point(-pi, 0);\n    stream.point(-pi, phi);\n  } else if (abs(from[0] - to[0]) > epsilon) {\n    var lambda = from[0] < to[0] ? pi : -pi;\n    phi = direction * lambda / 2;\n    stream.point(-lambda, phi);\n    stream.point(0, phi);\n    stream.point(lambda, phi);\n  } else {\n    stream.point(to[0], to[1]);\n  }\n}\n","import noop from \"../noop\";\n\nexport default function() {\n  var lines = [],\n      line;\n  return {\n    point: function(x, y) {\n      line.push([x, y]);\n    },\n    lineStart: function() {\n      lines.push(line = []);\n    },\n    lineEnd: noop,\n    rejoin: function() {\n      if (lines.length > 1) lines.push(lines.pop().concat(lines.shift()));\n    },\n    result: function() {\n      var result = lines;\n      lines = [];\n      line = null;\n      return result;\n    }\n  };\n}\n","import pointEqual from \"../pointEqual\";\n\nfunction Intersection(point, points, other, entry) {\n  this.x = point;\n  this.z = points;\n  this.o = other; // another intersection\n  this.e = entry; // is an entry?\n  this.v = false; // visited\n  this.n = this.p = null; // next & previous\n}\n\n// A generalized polygon clipping algorithm: given a polygon that has been cut\n// into its visible line segments, and rejoins the segments by interpolating\n// along the clip edge.\nexport default function(segments, compareIntersection, startInside, interpolate, stream) {\n  var subject = [],\n      clip = [],\n      i,\n      n;\n\n  segments.forEach(function(segment) {\n    if ((n = segment.length - 1) <= 0) return;\n    var n, p0 = segment[0], p1 = segment[n], x;\n\n    // If the first and last points of a segment are coincident, then treat as a\n    // closed ring. TODO if all rings are closed, then the winding order of the\n    // exterior ring should be checked.\n    if (pointEqual(p0, p1)) {\n      stream.lineStart();\n      for (i = 0; i < n; ++i) stream.point((p0 = segment[i])[0], p0[1]);\n      stream.lineEnd();\n      return;\n    }\n\n    subject.push(x = new Intersection(p0, segment, null, true));\n    clip.push(x.o = new Intersection(p0, null, x, false));\n    subject.push(x = new Intersection(p1, segment, null, false));\n    clip.push(x.o = new Intersection(p1, null, x, true));\n  });\n\n  if (!subject.length) return;\n\n  clip.sort(compareIntersection);\n  link(subject);\n  link(clip);\n\n  for (i = 0, n = clip.length; i < n; ++i) {\n    clip[i].e = startInside = !startInside;\n  }\n\n  var start = subject[0],\n      points,\n      point;\n\n  while (1) {\n    // Find first unvisited intersection.\n    var current = start,\n        isSubject = true;\n    while (current.v) if ((current = current.n) === start) return;\n    points = current.z;\n    stream.lineStart();\n    do {\n      current.v = current.o.v = true;\n      if (current.e) {\n        if (isSubject) {\n          for (i = 0, n = points.length; i < n; ++i) stream.point((point = points[i])[0], point[1]);\n        } else {\n          interpolate(current.x, current.n.x, 1, stream);\n        }\n        current = current.n;\n      } else {\n        if (isSubject) {\n          points = current.p.z;\n          for (i = points.length - 1; i >= 0; --i) stream.point((point = points[i])[0], point[1]);\n        } else {\n          interpolate(current.x, current.p.x, -1, stream);\n        }\n        current = current.p;\n      }\n      current = current.o;\n      points = current.z;\n      isSubject = !isSubject;\n    } while (!current.v);\n    stream.lineEnd();\n  }\n}\n\nfunction link(array) {\n  if (!(n = array.length)) return;\n  var n,\n      i = 0,\n      a = array[0],\n      b;\n  while (++i < n) {\n    a.n = b = array[i];\n    b.p = a;\n    a = b;\n  }\n  a.n = b = array[0];\n  b.p = a;\n}\n","import length from \"./length\";\n\nvar coordinates = [null, null],\n    object = {type: \"LineString\", coordinates: coordinates};\n\nexport default function(a, b) {\n  coordinates[0] = a;\n  coordinates[1] = b;\n  return length(object);\n}\n","import adder from \"./adder\";\nimport {abs, atan2, cos, radians, sin, sqrt} from \"./math\";\nimport noop from \"./noop\";\nimport stream from \"./stream\";\n\nvar lengthSum = adder(),\n    lambda0,\n    sinPhi0,\n    cosPhi0;\n\nvar lengthStream = {\n  sphere: noop,\n  point: noop,\n  lineStart: lengthLineStart,\n  lineEnd: noop,\n  polygonStart: noop,\n  polygonEnd: noop\n};\n\nfunction lengthLineStart() {\n  lengthStream.point = lengthPointFirst;\n  lengthStream.lineEnd = lengthLineEnd;\n}\n\nfunction lengthLineEnd() {\n  lengthStream.point = lengthStream.lineEnd = noop;\n}\n\nfunction lengthPointFirst(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  lambda0 = lambda, sinPhi0 = sin(phi), cosPhi0 = cos(phi);\n  lengthStream.point = lengthPoint;\n}\n\nfunction lengthPoint(lambda, phi) {\n  lambda *= radians, phi *= radians;\n  var sinPhi = sin(phi),\n      cosPhi = cos(phi),\n      delta = abs(lambda - lambda0),\n      cosDelta = cos(delta),\n      sinDelta = sin(delta),\n      x = cosPhi * sinDelta,\n      y = cosPhi0 * sinPhi - sinPhi0 * cosPhi * cosDelta,\n      z = sinPhi0 * sinPhi + cosPhi0 * cosPhi * cosDelta;\n  lengthSum.add(atan2(sqrt(x * x + y * y), z));\n  lambda0 = lambda, sinPhi0 = sinPhi, cosPhi0 = cosPhi;\n}\n\nexport default function(object) {\n  lengthSum.reset();\n  stream(object, lengthStream);\n  return +lengthSum;\n}\n","export var epsilon = 1e-6;\nexport var epsilon2 = 1e-12;\nexport var pi = Math.PI;\nexport var halfPi = pi / 2;\nexport var quarterPi = pi / 4;\nexport var tau = pi * 2;\n\nexport var degrees = 180 / pi;\nexport var radians = pi / 180;\n\nexport var abs = Math.abs;\nexport var atan = Math.atan;\nexport var atan2 = Math.atan2;\nexport var cos = Math.cos;\nexport var ceil = Math.ceil;\nexport var exp = Math.exp;\nexport var floor = Math.floor;\nexport var log = Math.log;\nexport var pow = Math.pow;\nexport var sin = Math.sin;\nexport var sign = Math.sign || function(x) { return x > 0 ? 1 : x < 0 ? -1 : 0; };\nexport var sqrt = Math.sqrt;\nexport var tan = Math.tan;\n\nexport function acos(x) {\n  return x > 1 ? 0 : x < -1 ? pi : Math.acos(x);\n}\n\nexport function asin(x) {\n  return x > 1 ? halfPi : x < -1 ? -halfPi : Math.asin(x);\n}\n\nexport function haversin(x) {\n  return (x = sin(x / 2)) * x;\n}\n","export default function noop() {}\n","import adder from \"../adder\";\nimport {abs} from \"../math\";\nimport noop from \"../noop\";\n\nvar areaSum = adder(),\n    areaRingSum = adder(),\n    x00,\n    y00,\n    x0,\n    y0;\n\nvar areaStream = {\n  point: noop,\n  lineStart: noop,\n  lineEnd: noop,\n  polygonStart: function() {\n    areaStream.lineStart = areaRingStart;\n    areaStream.lineEnd = areaRingEnd;\n  },\n  polygonEnd: function() {\n    areaStream.lineStart = areaStream.lineEnd = areaStream.point = noop;\n    areaSum.add(abs(areaRingSum));\n    areaRingSum.reset();\n  },\n  result: function() {\n    var area = areaSum / 2;\n    areaSum.reset();\n    return area;\n  }\n};\n\nfunction areaRingStart() {\n  areaStream.point = areaPointFirst;\n}\n\nfunction areaPointFirst(x, y) {\n  areaStream.point = areaPoint;\n  x00 = x0 = x, y00 = y0 = y;\n}\n\nfunction areaPoint(x, y) {\n  areaRingSum.add(y0 * x - x0 * y);\n  x0 = x, y0 = y;\n}\n\nfunction areaRingEnd() {\n  areaPoint(x00, y00);\n}\n\nexport default areaStream;\n","import noop from \"../noop\";\n\nvar x0 = Infinity,\n    y0 = x0,\n    x1 = -x0,\n    y1 = x1;\n\nvar boundsStream = {\n  point: boundsPoint,\n  lineStart: noop,\n  lineEnd: noop,\n  polygonStart: noop,\n  polygonEnd: noop,\n  result: function() {\n    var bounds = [[x0, y0], [x1, y1]];\n    x1 = y1 = -(y0 = x0 = Infinity);\n    return bounds;\n  }\n};\n\nfunction boundsPoint(x, y) {\n  if (x < x0) x0 = x;\n  if (x > x1) x1 = x;\n  if (y < y0) y0 = y;\n  if (y > y1) y1 = y;\n}\n\nexport default boundsStream;\n","import {tau} from \"../math\";\nimport noop from \"../noop\";\n\nexport default function PathContext(context) {\n  this._context = context;\n}\n\nPathContext.prototype = {\n  _radius: 4.5,\n  pointRadius: function(_) {\n    return this._radius = _, this;\n  },\n  polygonStart: function() {\n    this._line = 0;\n  },\n  polygonEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._point = 0;\n  },\n  lineEnd: function() {\n    if (this._line === 0) this._context.closePath();\n    this._point = NaN;\n  },\n  point: function(x, y) {\n    switch (this._point) {\n      case 0: {\n        this._context.moveTo(x, y);\n        this._point = 1;\n        break;\n      }\n      case 1: {\n        this._context.lineTo(x, y);\n        break;\n      }\n      default: {\n        this._context.moveTo(x + this._radius, y);\n        this._context.arc(x, y, this._radius, 0, tau);\n        break;\n      }\n    }\n  },\n  result: noop\n};\n","import adder from \"../adder\";\nimport {sqrt} from \"../math\";\nimport noop from \"../noop\";\n\nvar lengthSum = adder(),\n    lengthRing,\n    x00,\n    y00,\n    x0,\n    y0;\n\nvar lengthStream = {\n  point: noop,\n  lineStart: function() {\n    lengthStream.point = lengthPointFirst;\n  },\n  lineEnd: function() {\n    if (lengthRing) lengthPoint(x00, y00);\n    lengthStream.point = noop;\n  },\n  polygonStart: function() {\n    lengthRing = true;\n  },\n  polygonEnd: function() {\n    lengthRing = null;\n  },\n  result: function() {\n    var length = +lengthSum;\n    lengthSum.reset();\n    return length;\n  }\n};\n\nfunction lengthPointFirst(x, y) {\n  lengthStream.point = lengthPoint;\n  x00 = x0 = x, y00 = y0 = y;\n}\n\nfunction lengthPoint(x, y) {\n  x0 -= x, y0 -= y;\n  lengthSum.add(sqrt(x0 * x0 + y0 * y0));\n  x0 = x, y0 = y;\n}\n\nexport default lengthStream;\n","export default function PathString() {\n  this._string = [];\n}\n\nPathString.prototype = {\n  _radius: 4.5,\n  _circle: circle(4.5),\n  pointRadius: function(_) {\n    if ((_ = +_) !== this._radius) this._radius = _, this._circle = null;\n    return this;\n  },\n  polygonStart: function() {\n    this._line = 0;\n  },\n  polygonEnd: function() {\n    this._line = NaN;\n  },\n  lineStart: function() {\n    this._point = 0;\n  },\n  lineEnd: function() {\n    if (this._line === 0) this._string.push(\"Z\");\n    this._point = NaN;\n  },\n  point: function(x, y) {\n    switch (this._point) {\n      case 0: {\n        this._string.push(\"M\", x, \",\", y);\n        this._point = 1;\n        break;\n      }\n      case 1: {\n        this._string.push(\"L\", x, \",\", y);\n        break;\n      }\n      default: {\n        if (this._circle == null) this._circle = circle(this._radius);\n        this._string.push(\"M\", x, \",\", y, this._circle);\n        break;\n      }\n    }\n  },\n  result: function() {\n    if (this._string.length) {\n      var result = this._string.join(\"\");\n      this._string = [];\n      return result;\n    } else {\n      return null;\n    }\n  }\n};\n\nfunction circle(radius) {\n  return \"m0,\" + radius\n      + \"a\" + radius + \",\" + radius + \" 0 1,1 0,\" + -2 * radius\n      + \"a\" + radius + \",\" + radius + \" 0 1,1 0,\" + 2 * radius\n      + \"z\";\n}\n","import {abs, epsilon} from \"./math\";\n\nexport default function(a, b) {\n  return abs(a[0] - b[0]) < epsilon && abs(a[1] - b[1]) < epsilon;\n}\n","import adder from \"./adder\";\nimport {cartesian, cartesianCross, cartesianNormalizeInPlace} from \"./cartesian\";\nimport {asin, atan2, cos, epsilon, pi, quarterPi, sin, tau} from \"./math\";\n\nvar sum = adder();\n\nexport default function(polygon, point) {\n  var lambda = point[0],\n      phi = point[1],\n      normal = [sin(lambda), -cos(lambda), 0],\n      angle = 0,\n      winding = 0;\n\n  sum.reset();\n\n  for (var i = 0, n = polygon.length; i < n; ++i) {\n    if (!(m = (ring = polygon[i]).length)) continue;\n    var ring,\n        m,\n        point0 = ring[m - 1],\n        lambda0 = point0[0],\n        phi0 = point0[1] / 2 + quarterPi,\n        sinPhi0 = sin(phi0),\n        cosPhi0 = cos(phi0);\n\n    for (var j = 0; j < m; ++j, lambda0 = lambda1, sinPhi0 = sinPhi1, cosPhi0 = cosPhi1, point0 = point1) {\n      var point1 = ring[j],\n          lambda1 = point1[0],\n          phi1 = point1[1] / 2 + quarterPi,\n          sinPhi1 = sin(phi1),\n          cosPhi1 = cos(phi1),\n          delta = lambda1 - lambda0,\n          sign = delta >= 0 ? 1 : -1,\n          absDelta = sign * delta,\n          antimeridian = absDelta > pi,\n          k = sinPhi0 * sinPhi1;\n\n      sum.add(atan2(k * sign * sin(absDelta), cosPhi0 * cosPhi1 + k * cos(absDelta)));\n      angle += antimeridian ? delta + sign * tau : delta;\n\n      // Are the longitudes either side of the point’s meridian (lambda),\n      // and are the latitudes smaller than the parallel (phi)?\n      if (antimeridian ^ lambda0 >= lambda ^ lambda1 >= lambda) {\n        var arc = cartesianCross(cartesian(point0), cartesian(point1));\n        cartesianNormalizeInPlace(arc);\n        var intersection = cartesianCross(normal, arc);\n        cartesianNormalizeInPlace(intersection);\n        var phiArc = (antimeridian ^ delta >= 0 ? -1 : 1) * asin(intersection[2]);\n        if (phi > phiArc || phi === phiArc && (arc[0] || arc[1])) {\n          winding += antimeridian ^ delta >= 0 ? 1 : -1;\n        }\n      }\n    }\n  }\n\n  // First, determine whether the South pole is inside or outside:\n  //\n  // It is inside if:\n  // * the polygon winds around it in a clockwise direction.\n  // * the polygon does not (cumulatively) wind around it, but has a negative\n  //   (counter-clockwise) area.\n  //\n  // Second, count the (signed) number of times a segment crosses a lambda\n  // from the point to the South pole.  If it is zero, then the point is the\n  // same side as the South pole.\n\n  return (angle < -epsilon || angle < epsilon && sum < -epsilon) ^ (winding & 1);\n}\n","import {asin, atan2, cos, sin, sqrt} from \"../math\";\n\nexport function azimuthalRaw(scale) {\n  return function(x, y) {\n    var cx = cos(x),\n        cy = cos(y),\n        k = scale(cx * cy);\n    return [\n      k * cy * sin(x),\n      k * sin(y)\n    ];\n  }\n}\n\nexport function azimuthalInvert(angle) {\n  return function(x, y) {\n    var z = sqrt(x * x + y * y),\n        c = angle(z),\n        sc = sin(c),\n        cc = cos(c);\n    return [\n      atan2(x * sc, z * cc),\n      asin(z && y * sc / z)\n    ];\n  }\n}\n","import {asin, sqrt} from \"../math\";\nimport {azimuthalRaw, azimuthalInvert} from \"./azimuthal\";\nimport projection from \"./index\";\n\nexport var azimuthalEqualAreaRaw = azimuthalRaw(function(cxcy) {\n  return sqrt(2 / (1 + cxcy));\n});\n\nazimuthalEqualAreaRaw.invert = azimuthalInvert(function(z) {\n  return 2 * asin(z / 2);\n});\n\nexport default function() {\n  return projection(azimuthalEqualAreaRaw)\n      .scale(124.75)\n      .clipAngle(180 - 1e-3);\n}\n","import {acos, sin} from \"../math\";\nimport {azimuthalRaw, azimuthalInvert} from \"./azimuthal\";\nimport projection from \"./index\";\n\nexport var azimuthalEquidistantRaw = azimuthalRaw(function(c) {\n  return (c = acos(c)) && c / sin(c);\n});\n\nazimuthalEquidistantRaw.invert = azimuthalInvert(function(z) {\n  return z;\n});\n\nexport default function() {\n  return projection(azimuthalEquidistantRaw)\n      .scale(79.4188)\n      .clipAngle(180 - 1e-3);\n}\n","import projection from \"./index\";\n\nexport function equirectangularRaw(lambda, phi) {\n  return [lambda, phi];\n}\n\nequirectangularRaw.invert = equirectangularRaw;\n\nexport default function() {\n  return projection(equirectangularRaw)\n      .scale(152.63);\n}\n","import {atan, cos, sin} from \"../math\";\nimport {azimuthalInvert} from \"./azimuthal\";\nimport projection from \"./index\";\n\nexport function gnomonicRaw(x, y) {\n  var cy = cos(y), k = cos(x) * cy;\n  return [cy * sin(x) / k, sin(y) / k];\n}\n\ngnomonicRaw.invert = azimuthalInvert(atan);\n\nexport default function() {\n  return projection(gnomonicRaw)\n      .scale(144.049)\n      .clipAngle(60);\n}\n","import {atan, exp, halfPi, log, pi, tan, tau} from \"../math\";\nimport rotation from \"../rotation\";\nimport projection from \"./index\";\n\nexport function mercatorRaw(lambda, phi) {\n  return [lambda, log(tan((halfPi + phi) / 2))];\n}\n\nmercatorRaw.invert = function(x, y) {\n  return [x, 2 * atan(exp(y)) - halfPi];\n};\n\nexport default function() {\n  return mercatorProjection(mercatorRaw)\n      .scale(961 / tau);\n}\n\nexport function mercatorProjection(project) {\n  var m = projection(project),\n      center = m.center,\n      scale = m.scale,\n      translate = m.translate,\n      clipExtent = m.clipExtent,\n      x0 = null, y0, x1, y1; // clip extent\n\n  m.scale = function(_) {\n    return arguments.length ? (scale(_), reclip()) : scale();\n  };\n\n  m.translate = function(_) {\n    return arguments.length ? (translate(_), reclip()) : translate();\n  };\n\n  m.center = function(_) {\n    return arguments.length ? (center(_), reclip()) : center();\n  };\n\n  m.clipExtent = function(_) {\n    return arguments.length ? ((_ == null ? x0 = y0 = x1 = y1 = null : (x0 = +_[0][0], y0 = +_[0][1], x1 = +_[1][0], y1 = +_[1][1])), reclip()) : x0 == null ? null : [[x0, y0], [x1, y1]];\n  };\n\n  function reclip() {\n    var k = pi * scale(),\n        t = m(rotation(m.rotate()).invert([0, 0]));\n    return clipExtent(x0 == null\n        ? [[t[0] - k, t[1] - k], [t[0] + k, t[1] + k]] : project === mercatorRaw\n        ? [[Math.max(t[0] - k, x0), y0], [Math.min(t[0] + k, x1), y1]]\n        : [[x0, Math.max(t[1] - k, y0)], [x1, Math.min(t[1] + k, y1)]]);\n  }\n\n  return reclip();\n}\n","import projection from \"./index\";\nimport {abs, epsilon} from \"../math\";\n\nexport function naturalEarth1Raw(lambda, phi) {\n  var phi2 = phi * phi, phi4 = phi2 * phi2;\n  return [\n    lambda * (0.8707 - 0.131979 * phi2 + phi4 * (-0.013791 + phi4 * (0.003971 * phi2 - 0.001529 * phi4))),\n    phi * (1.007226 + phi2 * (0.015085 + phi4 * (-0.044475 + 0.028874 * phi2 - 0.005916 * phi4)))\n  ];\n}\n\nnaturalEarth1Raw.invert = function(x, y) {\n  var phi = y, i = 25, delta;\n  do {\n    var phi2 = phi * phi, phi4 = phi2 * phi2;\n    phi -= delta = (phi * (1.007226 + phi2 * (0.015085 + phi4 * (-0.044475 + 0.028874 * phi2 - 0.005916 * phi4))) - y) /\n        (1.007226 + phi2 * (0.015085 * 3 + phi4 * (-0.044475 * 7 + 0.028874 * 9 * phi2 - 0.005916 * 11 * phi4)));\n  } while (abs(delta) > epsilon && --i > 0);\n  return [\n    x / (0.8707 + (phi2 = phi * phi) * (-0.131979 + phi2 * (-0.013791 + phi2 * phi2 * phi2 * (0.003971 - 0.001529 * phi2)))),\n    phi\n  ];\n};\n\nexport default function() {\n  return projection(naturalEarth1Raw)\n      .scale(175.295);\n}\n","import {asin, cos, epsilon, sin} from \"../math\";\nimport {azimuthalInvert} from \"./azimuthal\";\nimport projection from \"./index\";\n\nexport function orthographicRaw(x, y) {\n  return [cos(y) * sin(x), sin(y)];\n}\n\northographicRaw.invert = azimuthalInvert(asin);\n\nexport default function() {\n  return projection(orthographicRaw)\n      .scale(249.5)\n      .clipAngle(90 + epsilon);\n}\n","import {cartesian} from \"../cartesian\";\nimport {abs, asin, atan2, cos, epsilon, radians, sqrt} from \"../math\";\nimport {transformer} from \"../transform\";\n\nvar maxDepth = 16, // maximum depth of subdivision\n    cosMinDistance = cos(30 * radians); // cos(minimum angular distance)\n\nexport default function(project, delta2) {\n  return +delta2 ? resample(project, delta2) : resampleNone(project);\n}\n\nfunction resampleNone(project) {\n  return transformer({\n    point: function(x, y) {\n      x = project(x, y);\n      this.stream.point(x[0], x[1]);\n    }\n  });\n}\n\nfunction resample(project, delta2) {\n\n  function resampleLineTo(x0, y0, lambda0, a0, b0, c0, x1, y1, lambda1, a1, b1, c1, depth, stream) {\n    var dx = x1 - x0,\n        dy = y1 - y0,\n        d2 = dx * dx + dy * dy;\n    if (d2 > 4 * delta2 && depth--) {\n      var a = a0 + a1,\n          b = b0 + b1,\n          c = c0 + c1,\n          m = sqrt(a * a + b * b + c * c),\n          phi2 = asin(c /= m),\n          lambda2 = abs(abs(c) - 1) < epsilon || abs(lambda0 - lambda1) < epsilon ? (lambda0 + lambda1) / 2 : atan2(b, a),\n          p = project(lambda2, phi2),\n          x2 = p[0],\n          y2 = p[1],\n          dx2 = x2 - x0,\n          dy2 = y2 - y0,\n          dz = dy * dx2 - dx * dy2;\n      if (dz * dz / d2 > delta2 // perpendicular projected distance\n          || abs((dx * dx2 + dy * dy2) / d2 - 0.5) > 0.3 // midpoint close to an end\n          || a0 * a1 + b0 * b1 + c0 * c1 < cosMinDistance) { // angular distance\n        resampleLineTo(x0, y0, lambda0, a0, b0, c0, x2, y2, lambda2, a /= m, b /= m, c, depth, stream);\n        stream.point(x2, y2);\n        resampleLineTo(x2, y2, lambda2, a, b, c, x1, y1, lambda1, a1, b1, c1, depth, stream);\n      }\n    }\n  }\n  return function(stream) {\n    var lambda00, x00, y00, a00, b00, c00, // first point\n        lambda0, x0, y0, a0, b0, c0; // previous point\n\n    var resampleStream = {\n      point: point,\n      lineStart: lineStart,\n      lineEnd: lineEnd,\n      polygonStart: function() { stream.polygonStart(); resampleStream.lineStart = ringStart; },\n      polygonEnd: function() { stream.polygonEnd(); resampleStream.lineStart = lineStart; }\n    };\n\n    function point(x, y) {\n      x = project(x, y);\n      stream.point(x[0], x[1]);\n    }\n\n    function lineStart() {\n      x0 = NaN;\n      resampleStream.point = linePoint;\n      stream.lineStart();\n    }\n\n    function linePoint(lambda, phi) {\n      var c = cartesian([lambda, phi]), p = project(lambda, phi);\n      resampleLineTo(x0, y0, lambda0, a0, b0, c0, x0 = p[0], y0 = p[1], lambda0 = lambda, a0 = c[0], b0 = c[1], c0 = c[2], maxDepth, stream);\n      stream.point(x0, y0);\n    }\n\n    function lineEnd() {\n      resampleStream.point = point;\n      stream.lineEnd();\n    }\n\n    function ringStart() {\n      lineStart();\n      resampleStream.point = ringPoint;\n      resampleStream.lineEnd = ringEnd;\n    }\n\n    function ringPoint(lambda, phi) {\n      linePoint(lambda00 = lambda, phi), x00 = x0, y00 = y0, a00 = a0, b00 = b0, c00 = c0;\n      resampleStream.point = linePoint;\n    }\n\n    function ringEnd() {\n      resampleLineTo(x0, y0, lambda0, a0, b0, c0, x00, y00, lambda00, a00, b00, c00, maxDepth, stream);\n      resampleStream.lineEnd = lineEnd;\n      lineEnd();\n    }\n\n    return resampleStream;\n  };\n}\n","import {atan, cos, sin} from \"../math\";\nimport {azimuthalInvert} from \"./azimuthal\";\nimport projection from \"./index\";\n\nexport function stereographicRaw(x, y) {\n  var cy = cos(y), k = 1 + cos(x) * cy;\n  return [cy * sin(x) / k, sin(y) / k];\n}\n\nstereographicRaw.invert = azimuthalInvert(function(z) {\n  return 2 * atan(z);\n});\n\nexport default function() {\n  return projection(stereographicRaw)\n      .scale(250)\n      .clipAngle(142);\n}\n","import {atan, exp, halfPi, log, tan} from \"../math\";\nimport {mercatorProjection} from \"./mercator\";\n\nexport function transverseMercatorRaw(lambda, phi) {\n  return [log(tan((halfPi + phi) / 2)), -lambda];\n}\n\ntransverseMercatorRaw.invert = function(x, y) {\n  return [-y, 2 * atan(exp(x)) - halfPi];\n};\n\nexport default function() {\n  var m = mercatorProjection(transverseMercatorRaw),\n      center = m.center,\n      rotate = m.rotate;\n\n  m.center = function(_) {\n    return arguments.length ? center([-_[1], _[0]]) : (_ = center(), [_[1], -_[0]]);\n  };\n\n  m.rotate = function(_) {\n    return arguments.length ? rotate([_[0], _[1], _.length > 2 ? _[2] + 90 : 90]) : (_ = rotate(), [_[0], _[1], _[2] - 90]);\n  };\n\n  return rotate([0, 0, 90])\n      .scale(159.155);\n}\n","import compose from \"./compose\";\nimport {asin, atan2, cos, degrees, pi, radians, sin, tau} from \"./math\";\n\nfunction rotationIdentity(lambda, phi) {\n  return [lambda > pi ? lambda - tau : lambda < -pi ? lambda + tau : lambda, phi];\n}\n\nrotationIdentity.invert = rotationIdentity;\n\nexport function rotateRadians(deltaLambda, deltaPhi, deltaGamma) {\n  return (deltaLambda %= tau) ? (deltaPhi || deltaGamma ? compose(rotationLambda(deltaLambda), rotationPhiGamma(deltaPhi, deltaGamma))\n    : rotationLambda(deltaLambda))\n    : (deltaPhi || deltaGamma ? rotationPhiGamma(deltaPhi, deltaGamma)\n    : rotationIdentity);\n}\n\nfunction forwardRotationLambda(deltaLambda) {\n  return function(lambda, phi) {\n    return lambda += deltaLambda, [lambda > pi ? lambda - tau : lambda < -pi ? lambda + tau : lambda, phi];\n  };\n}\n\nfunction rotationLambda(deltaLambda) {\n  var rotation = forwardRotationLambda(deltaLambda);\n  rotation.invert = forwardRotationLambda(-deltaLambda);\n  return rotation;\n}\n\nfunction rotationPhiGamma(deltaPhi, deltaGamma) {\n  var cosDeltaPhi = cos(deltaPhi),\n      sinDeltaPhi = sin(deltaPhi),\n      cosDeltaGamma = cos(deltaGamma),\n      sinDeltaGamma = sin(deltaGamma);\n\n  function rotation(lambda, phi) {\n    var cosPhi = cos(phi),\n        x = cos(lambda) * cosPhi,\n        y = sin(lambda) * cosPhi,\n        z = sin(phi),\n        k = z * cosDeltaPhi + x * sinDeltaPhi;\n    return [\n      atan2(y * cosDeltaGamma - k * sinDeltaGamma, x * cosDeltaPhi - z * sinDeltaPhi),\n      asin(k * cosDeltaGamma + y * sinDeltaGamma)\n    ];\n  }\n\n  rotation.invert = function(lambda, phi) {\n    var cosPhi = cos(phi),\n        x = cos(lambda) * cosPhi,\n        y = sin(lambda) * cosPhi,\n        z = sin(phi),\n        k = z * cosDeltaGamma - y * sinDeltaGamma;\n    return [\n      atan2(y * cosDeltaGamma + z * sinDeltaGamma, x * cosDeltaPhi + k * sinDeltaPhi),\n      asin(k * cosDeltaPhi - x * sinDeltaPhi)\n    ];\n  };\n\n  return rotation;\n}\n\nexport default function(rotate) {\n  rotate = rotateRadians(rotate[0] * radians, rotate[1] * radians, rotate.length > 2 ? rotate[2] * radians : 0);\n\n  function forward(coordinates) {\n    coordinates = rotate(coordinates[0] * radians, coordinates[1] * radians);\n    return coordinates[0] *= degrees, coordinates[1] *= degrees, coordinates;\n  }\n\n  forward.invert = function(coordinates) {\n    coordinates = rotate.invert(coordinates[0] * radians, coordinates[1] * radians);\n    return coordinates[0] *= degrees, coordinates[1] *= degrees, coordinates;\n  };\n\n  return forward;\n}\n","function streamGeometry(geometry, stream) {\n  if (geometry && streamGeometryType.hasOwnProperty(geometry.type)) {\n    streamGeometryType[geometry.type](geometry, stream);\n  }\n}\n\nvar streamObjectType = {\n  Feature: function(object, stream) {\n    streamGeometry(object.geometry, stream);\n  },\n  FeatureCollection: function(object, stream) {\n    var features = object.features, i = -1, n = features.length;\n    while (++i < n) streamGeometry(features[i].geometry, stream);\n  }\n};\n\nvar streamGeometryType = {\n  Sphere: function(object, stream) {\n    stream.sphere();\n  },\n  Point: function(object, stream) {\n    object = object.coordinates;\n    stream.point(object[0], object[1], object[2]);\n  },\n  MultiPoint: function(object, stream) {\n    var coordinates = object.coordinates, i = -1, n = coordinates.length;\n    while (++i < n) object = coordinates[i], stream.point(object[0], object[1], object[2]);\n  },\n  LineString: function(object, stream) {\n    streamLine(object.coordinates, stream, 0);\n  },\n  MultiLineString: function(object, stream) {\n    var coordinates = object.coordinates, i = -1, n = coordinates.length;\n    while (++i < n) streamLine(coordinates[i], stream, 0);\n  },\n  Polygon: function(object, stream) {\n    streamPolygon(object.coordinates, stream);\n  },\n  MultiPolygon: function(object, stream) {\n    var coordinates = object.coordinates, i = -1, n = coordinates.length;\n    while (++i < n) streamPolygon(coordinates[i], stream);\n  },\n  GeometryCollection: function(object, stream) {\n    var geometries = object.geometries, i = -1, n = geometries.length;\n    while (++i < n) streamGeometry(geometries[i], stream);\n  }\n};\n\nfunction streamLine(coordinates, stream, closed) {\n  var i = -1, n = coordinates.length - closed, coordinate;\n  stream.lineStart();\n  while (++i < n) coordinate = coordinates[i], stream.point(coordinate[0], coordinate[1], coordinate[2]);\n  stream.lineEnd();\n}\n\nfunction streamPolygon(coordinates, stream) {\n  var i = -1, n = coordinates.length;\n  stream.polygonStart();\n  while (++i < n) streamLine(coordinates[i], stream, 1);\n  stream.polygonEnd();\n}\n\nexport default function(object, stream) {\n  if (object && streamObjectType.hasOwnProperty(object.type)) {\n    streamObjectType[object.type](object, stream);\n  } else {\n    streamGeometry(object, stream);\n  }\n}\n","export default function(methods) {\n  return {\n    stream: transformer(methods)\n  };\n}\n\nexport function transformer(methods) {\n  return function(stream) {\n    var s = new TransformStream;\n    for (var key in methods) s[key] = methods[key];\n    s.stream = stream;\n    return s;\n  };\n}\n\nfunction TransformStream() {}\n\nTransformStream.prototype = {\n  constructor: TransformStream,\n  point: function(x, y) { this.stream.point(x, y); },\n  sphere: function() { this.stream.sphere(); },\n  lineStart: function() { this.stream.lineStart(); },\n  lineEnd: function() { this.stream.lineEnd(); },\n  polygonStart: function() { this.stream.polygonStart(); },\n  polygonEnd: function() { this.stream.polygonEnd(); }\n};\n","function RedBlackTree() {\n  this._ = null; // root node\n}\n\nexport function RedBlackNode(node) {\n  node.U = // parent node\n  node.C = // color - true for red, false for black\n  node.L = // left node\n  node.R = // right node\n  node.P = // previous node\n  node.N = null; // next node\n}\n\nRedBlackTree.prototype = {\n  constructor: RedBlackTree,\n\n  insert: function(after, node) {\n    var parent, grandpa, uncle;\n\n    if (after) {\n      node.P = after;\n      node.N = after.N;\n      if (after.N) after.N.P = node;\n      after.N = node;\n      if (after.R) {\n        after = after.R;\n        while (after.L) after = after.L;\n        after.L = node;\n      } else {\n        after.R = node;\n      }\n      parent = after;\n    } else if (this._) {\n      after = RedBlackFirst(this._);\n      node.P = null;\n      node.N = after;\n      after.P = after.L = node;\n      parent = after;\n    } else {\n      node.P = node.N = null;\n      this._ = node;\n      parent = null;\n    }\n    node.L = node.R = null;\n    node.U = parent;\n    node.C = true;\n\n    after = node;\n    while (parent && parent.C) {\n      grandpa = parent.U;\n      if (parent === grandpa.L) {\n        uncle = grandpa.R;\n        if (uncle && uncle.C) {\n          parent.C = uncle.C = false;\n          grandpa.C = true;\n          after = grandpa;\n        } else {\n          if (after === parent.R) {\n            RedBlackRotateLeft(this, parent);\n            after = parent;\n            parent = after.U;\n          }\n          parent.C = false;\n          grandpa.C = true;\n          RedBlackRotateRight(this, grandpa);\n        }\n      } else {\n        uncle = grandpa.L;\n        if (uncle && uncle.C) {\n          parent.C = uncle.C = false;\n          grandpa.C = true;\n          after = grandpa;\n        } else {\n          if (after === parent.L) {\n            RedBlackRotateRight(this, parent);\n            after = parent;\n            parent = after.U;\n          }\n          parent.C = false;\n          grandpa.C = true;\n          RedBlackRotateLeft(this, grandpa);\n        }\n      }\n      parent = after.U;\n    }\n    this._.C = false;\n  },\n\n  remove: function(node) {\n    if (node.N) node.N.P = node.P;\n    if (node.P) node.P.N = node.N;\n    node.N = node.P = null;\n\n    var parent = node.U,\n        sibling,\n        left = node.L,\n        right = node.R,\n        next,\n        red;\n\n    if (!left) next = right;\n    else if (!right) next = left;\n    else next = RedBlackFirst(right);\n\n    if (parent) {\n      if (parent.L === node) parent.L = next;\n      else parent.R = next;\n    } else {\n      this._ = next;\n    }\n\n    if (left && right) {\n      red = next.C;\n      next.C = node.C;\n      next.L = left;\n      left.U = next;\n      if (next !== right) {\n        parent = next.U;\n        next.U = node.U;\n        node = next.R;\n        parent.L = node;\n        next.R = right;\n        right.U = next;\n      } else {\n        next.U = parent;\n        parent = next;\n        node = next.R;\n      }\n    } else {\n      red = node.C;\n      node = next;\n    }\n\n    if (node) node.U = parent;\n    if (red) return;\n    if (node && node.C) { node.C = false; return; }\n\n    do {\n      if (node === this._) break;\n      if (node === parent.L) {\n        sibling = parent.R;\n        if (sibling.C) {\n          sibling.C = false;\n          parent.C = true;\n          RedBlackRotateLeft(this, parent);\n          sibling = parent.R;\n        }\n        if ((sibling.L && sibling.L.C)\n            || (sibling.R && sibling.R.C)) {\n          if (!sibling.R || !sibling.R.C) {\n            sibling.L.C = false;\n            sibling.C = true;\n            RedBlackRotateRight(this, sibling);\n            sibling = parent.R;\n          }\n          sibling.C = parent.C;\n          parent.C = sibling.R.C = false;\n          RedBlackRotateLeft(this, parent);\n          node = this._;\n          break;\n        }\n      } else {\n        sibling = parent.L;\n        if (sibling.C) {\n          sibling.C = false;\n          parent.C = true;\n          RedBlackRotateRight(this, parent);\n          sibling = parent.L;\n        }\n        if ((sibling.L && sibling.L.C)\n          || (sibling.R && sibling.R.C)) {\n          if (!sibling.L || !sibling.L.C) {\n            sibling.R.C = false;\n            sibling.C = true;\n            RedBlackRotateLeft(this, sibling);\n            sibling = parent.L;\n          }\n          sibling.C = parent.C;\n          parent.C = sibling.L.C = false;\n          RedBlackRotateRight(this, parent);\n          node = this._;\n          break;\n        }\n      }\n      sibling.C = true;\n      node = parent;\n      parent = parent.U;\n    } while (!node.C);\n\n    if (node) node.C = false;\n  }\n};\n\nfunction RedBlackRotateLeft(tree, node) {\n  var p = node,\n      q = node.R,\n      parent = p.U;\n\n  if (parent) {\n    if (parent.L === p) parent.L = q;\n    else parent.R = q;\n  } else {\n    tree._ = q;\n  }\n\n  q.U = parent;\n  p.U = q;\n  p.R = q.L;\n  if (p.R) p.R.U = p;\n  q.L = p;\n}\n\nfunction RedBlackRotateRight(tree, node) {\n  var p = node,\n      q = node.L,\n      parent = p.U;\n\n  if (parent) {\n    if (parent.L === p) parent.L = q;\n    else parent.R = q;\n  } else {\n    tree._ = q;\n  }\n\n  q.U = parent;\n  p.U = q;\n  p.L = q.R;\n  if (p.L) p.L.U = p;\n  q.R = p;\n}\n\nfunction RedBlackFirst(node) {\n  while (node.L) node = node.L;\n  return node;\n}\n\nexport default RedBlackTree;\n","import {cells, edges, epsilon} from \"./Diagram\";\n\nexport function createEdge(left, right, v0, v1) {\n  var edge = [null, null],\n      index = edges.push(edge) - 1;\n  edge.left = left;\n  edge.right = right;\n  if (v0) setEdgeEnd(edge, left, right, v0);\n  if (v1) setEdgeEnd(edge, right, left, v1);\n  cells[left.index].halfedges.push(index);\n  cells[right.index].halfedges.push(index);\n  return edge;\n}\n\nexport function createBorderEdge(left, v0, v1) {\n  var edge = [v0, v1];\n  edge.left = left;\n  return edge;\n}\n\nexport function setEdgeEnd(edge, left, right, vertex) {\n  if (!edge[0] && !edge[1]) {\n    edge[0] = vertex;\n    edge.left = left;\n    edge.right = right;\n  } else if (edge.left === right) {\n    edge[1] = vertex;\n  } else {\n    edge[0] = vertex;\n  }\n}\n\n// Liang–Barsky line clipping.\nfunction clipEdge(edge, x0, y0, x1, y1) {\n  var a = edge[0],\n      b = edge[1],\n      ax = a[0],\n      ay = a[1],\n      bx = b[0],\n      by = b[1],\n      t0 = 0,\n      t1 = 1,\n      dx = bx - ax,\n      dy = by - ay,\n      r;\n\n  r = x0 - ax;\n  if (!dx && r > 0) return;\n  r /= dx;\n  if (dx < 0) {\n    if (r < t0) return;\n    if (r < t1) t1 = r;\n  } else if (dx > 0) {\n    if (r > t1) return;\n    if (r > t0) t0 = r;\n  }\n\n  r = x1 - ax;\n  if (!dx && r < 0) return;\n  r /= dx;\n  if (dx < 0) {\n    if (r > t1) return;\n    if (r > t0) t0 = r;\n  } else if (dx > 0) {\n    if (r < t0) return;\n    if (r < t1) t1 = r;\n  }\n\n  r = y0 - ay;\n  if (!dy && r > 0) return;\n  r /= dy;\n  if (dy < 0) {\n    if (r < t0) return;\n    if (r < t1) t1 = r;\n  } else if (dy > 0) {\n    if (r > t1) return;\n    if (r > t0) t0 = r;\n  }\n\n  r = y1 - ay;\n  if (!dy && r < 0) return;\n  r /= dy;\n  if (dy < 0) {\n    if (r > t1) return;\n    if (r > t0) t0 = r;\n  } else if (dy > 0) {\n    if (r < t0) return;\n    if (r < t1) t1 = r;\n  }\n\n  if (!(t0 > 0) && !(t1 < 1)) return true; // TODO Better check?\n\n  if (t0 > 0) edge[0] = [ax + t0 * dx, ay + t0 * dy];\n  if (t1 < 1) edge[1] = [ax + t1 * dx, ay + t1 * dy];\n  return true;\n}\n\nfunction connectEdge(edge, x0, y0, x1, y1) {\n  var v1 = edge[1];\n  if (v1) return true;\n\n  var v0 = edge[0],\n      left = edge.left,\n      right = edge.right,\n      lx = left[0],\n      ly = left[1],\n      rx = right[0],\n      ry = right[1],\n      fx = (lx + rx) / 2,\n      fy = (ly + ry) / 2,\n      fm,\n      fb;\n\n  if (ry === ly) {\n    if (fx < x0 || fx >= x1) return;\n    if (lx > rx) {\n      if (!v0) v0 = [fx, y0];\n      else if (v0[1] >= y1) return;\n      v1 = [fx, y1];\n    } else {\n      if (!v0) v0 = [fx, y1];\n      else if (v0[1] < y0) return;\n      v1 = [fx, y0];\n    }\n  } else {\n    fm = (lx - rx) / (ry - ly);\n    fb = fy - fm * fx;\n    if (fm < -1 || fm > 1) {\n      if (lx > rx) {\n        if (!v0) v0 = [(y0 - fb) / fm, y0];\n        else if (v0[1] >= y1) return;\n        v1 = [(y1 - fb) / fm, y1];\n      } else {\n        if (!v0) v0 = [(y1 - fb) / fm, y1];\n        else if (v0[1] < y0) return;\n        v1 = [(y0 - fb) / fm, y0];\n      }\n    } else {\n      if (ly < ry) {\n        if (!v0) v0 = [x0, fm * x0 + fb];\n        else if (v0[0] >= x1) return;\n        v1 = [x1, fm * x1 + fb];\n      } else {\n        if (!v0) v0 = [x1, fm * x1 + fb];\n        else if (v0[0] < x0) return;\n        v1 = [x0, fm * x0 + fb];\n      }\n    }\n  }\n\n  edge[0] = v0;\n  edge[1] = v1;\n  return true;\n}\n\nexport function clipEdges(x0, y0, x1, y1) {\n  var i = edges.length,\n      edge;\n\n  while (i--) {\n    if (!connectEdge(edge = edges[i], x0, y0, x1, y1)\n        || !clipEdge(edge, x0, y0, x1, y1)\n        || !(Math.abs(edge[0][0] - edge[1][0]) > epsilon\n            || Math.abs(edge[0][1] - edge[1][1]) > epsilon)) {\n      delete edges[i];\n    }\n  }\n}\n","import {createBorderEdge} from \"./Edge\";\nimport {cells, edges, epsilon} from \"./Diagram\";\n\nexport function createCell(site) {\n  return cells[site.index] = {\n    site: site,\n    halfedges: []\n  };\n}\n\nfunction cellHalfedgeAngle(cell, edge) {\n  var site = cell.site,\n      va = edge.left,\n      vb = edge.right;\n  if (site === vb) vb = va, va = site;\n  if (vb) return Math.atan2(vb[1] - va[1], vb[0] - va[0]);\n  if (site === va) va = edge[1], vb = edge[0];\n  else va = edge[0], vb = edge[1];\n  return Math.atan2(va[0] - vb[0], vb[1] - va[1]);\n}\n\nexport function cellHalfedgeStart(cell, edge) {\n  return edge[+(edge.left !== cell.site)];\n}\n\nexport function cellHalfedgeEnd(cell, edge) {\n  return edge[+(edge.left === cell.site)];\n}\n\nexport function sortCellHalfedges() {\n  for (var i = 0, n = cells.length, cell, halfedges, j, m; i < n; ++i) {\n    if ((cell = cells[i]) && (m = (halfedges = cell.halfedges).length)) {\n      var index = new Array(m),\n          array = new Array(m);\n      for (j = 0; j < m; ++j) index[j] = j, array[j] = cellHalfedgeAngle(cell, edges[halfedges[j]]);\n      index.sort(function(i, j) { return array[j] - array[i]; });\n      for (j = 0; j < m; ++j) array[j] = halfedges[index[j]];\n      for (j = 0; j < m; ++j) halfedges[j] = array[j];\n    }\n  }\n}\n\nexport function clipCells(x0, y0, x1, y1) {\n  var nCells = cells.length,\n      iCell,\n      cell,\n      site,\n      iHalfedge,\n      halfedges,\n      nHalfedges,\n      start,\n      startX,\n      startY,\n      end,\n      endX,\n      endY,\n      cover = true;\n\n  for (iCell = 0; iCell < nCells; ++iCell) {\n    if (cell = cells[iCell]) {\n      site = cell.site;\n      halfedges = cell.halfedges;\n      iHalfedge = halfedges.length;\n\n      // Remove any dangling clipped edges.\n      while (iHalfedge--) {\n        if (!edges[halfedges[iHalfedge]]) {\n          halfedges.splice(iHalfedge, 1);\n        }\n      }\n\n      // Insert any border edges as necessary.\n      iHalfedge = 0, nHalfedges = halfedges.length;\n      while (iHalfedge < nHalfedges) {\n        end = cellHalfedgeEnd(cell, edges[halfedges[iHalfedge]]), endX = end[0], endY = end[1];\n        start = cellHalfedgeStart(cell, edges[halfedges[++iHalfedge % nHalfedges]]), startX = start[0], startY = start[1];\n        if (Math.abs(endX - startX) > epsilon || Math.abs(endY - startY) > epsilon) {\n          halfedges.splice(iHalfedge, 0, edges.push(createBorderEdge(site, end,\n              Math.abs(endX - x0) < epsilon && y1 - endY > epsilon ? [x0, Math.abs(startX - x0) < epsilon ? startY : y1]\n              : Math.abs(endY - y1) < epsilon && x1 - endX > epsilon ? [Math.abs(startY - y1) < epsilon ? startX : x1, y1]\n              : Math.abs(endX - x1) < epsilon && endY - y0 > epsilon ? [x1, Math.abs(startX - x1) < epsilon ? startY : y0]\n              : Math.abs(endY - y0) < epsilon && endX - x0 > epsilon ? [Math.abs(startY - y0) < epsilon ? startX : x0, y0]\n              : null)) - 1);\n          ++nHalfedges;\n        }\n      }\n\n      if (nHalfedges) cover = false;\n    }\n  }\n\n  // If there weren’t any edges, have the closest site cover the extent.\n  // It doesn’t matter which corner of the extent we measure!\n  if (cover) {\n    var dx, dy, d2, dc = Infinity;\n\n    for (iCell = 0, cover = null; iCell < nCells; ++iCell) {\n      if (cell = cells[iCell]) {\n        site = cell.site;\n        dx = site[0] - x0;\n        dy = site[1] - y0;\n        d2 = dx * dx + dy * dy;\n        if (d2 < dc) dc = d2, cover = cell;\n      }\n    }\n\n    if (cover) {\n      var v00 = [x0, y0], v01 = [x0, y1], v11 = [x1, y1], v10 = [x1, y0];\n      cover.halfedges.push(\n        edges.push(createBorderEdge(site = cover.site, v00, v01)) - 1,\n        edges.push(createBorderEdge(site, v01, v11)) - 1,\n        edges.push(createBorderEdge(site, v11, v10)) - 1,\n        edges.push(createBorderEdge(site, v10, v00)) - 1\n      );\n    }\n  }\n\n  // Lastly delete any cells with no edges; these were entirely clipped.\n  for (iCell = 0; iCell < nCells; ++iCell) {\n    if (cell = cells[iCell]) {\n      if (!cell.halfedges.length) {\n        delete cells[iCell];\n      }\n    }\n  }\n}\n","import {RedBlackNode} from \"./RedBlackTree\";\nimport {circles, epsilon2} from \"./Diagram\";\n\nvar circlePool = [];\n\nexport var firstCircle;\n\nfunction Circle() {\n  RedBlackNode(this);\n  this.x =\n  this.y =\n  this.arc =\n  this.site =\n  this.cy = null;\n}\n\nexport function attachCircle(arc) {\n  var lArc = arc.P,\n      rArc = arc.N;\n\n  if (!lArc || !rArc) return;\n\n  var lSite = lArc.site,\n      cSite = arc.site,\n      rSite = rArc.site;\n\n  if (lSite === rSite) return;\n\n  var bx = cSite[0],\n      by = cSite[1],\n      ax = lSite[0] - bx,\n      ay = lSite[1] - by,\n      cx = rSite[0] - bx,\n      cy = rSite[1] - by;\n\n  var d = 2 * (ax * cy - ay * cx);\n  if (d >= -epsilon2) return;\n\n  var ha = ax * ax + ay * ay,\n      hc = cx * cx + cy * cy,\n      x = (cy * ha - ay * hc) / d,\n      y = (ax * hc - cx * ha) / d;\n\n  var circle = circlePool.pop() || new Circle;\n  circle.arc = arc;\n  circle.site = cSite;\n  circle.x = x + bx;\n  circle.y = (circle.cy = y + by) + Math.sqrt(x * x + y * y); // y bottom\n\n  arc.circle = circle;\n\n  var before = null,\n      node = circles._;\n\n  while (node) {\n    if (circle.y < node.y || (circle.y === node.y && circle.x <= node.x)) {\n      if (node.L) node = node.L;\n      else { before = node.P; break; }\n    } else {\n      if (node.R) node = node.R;\n      else { before = node; break; }\n    }\n  }\n\n  circles.insert(before, circle);\n  if (!before) firstCircle = circle;\n}\n\nexport function detachCircle(arc) {\n  var circle = arc.circle;\n  if (circle) {\n    if (!circle.P) firstCircle = circle.N;\n    circles.remove(circle);\n    circlePool.push(circle);\n    RedBlackNode(circle);\n    arc.circle = null;\n  }\n}\n","import {RedBlackNode} from \"./RedBlackTree\";\nimport {createCell} from \"./Cell\";\nimport {attachCircle, detachCircle} from \"./Circle\";\nimport {createEdge, setEdgeEnd} from \"./Edge\";\nimport {beaches, epsilon} from \"./Diagram\";\n\nvar beachPool = [];\n\nfunction Beach() {\n  RedBlackNode(this);\n  this.edge =\n  this.site =\n  this.circle = null;\n}\n\nfunction createBeach(site) {\n  var beach = beachPool.pop() || new Beach;\n  beach.site = site;\n  return beach;\n}\n\nfunction detachBeach(beach) {\n  detachCircle(beach);\n  beaches.remove(beach);\n  beachPool.push(beach);\n  RedBlackNode(beach);\n}\n\nexport function removeBeach(beach) {\n  var circle = beach.circle,\n      x = circle.x,\n      y = circle.cy,\n      vertex = [x, y],\n      previous = beach.P,\n      next = beach.N,\n      disappearing = [beach];\n\n  detachBeach(beach);\n\n  var lArc = previous;\n  while (lArc.circle\n      && Math.abs(x - lArc.circle.x) < epsilon\n      && Math.abs(y - lArc.circle.cy) < epsilon) {\n    previous = lArc.P;\n    disappearing.unshift(lArc);\n    detachBeach(lArc);\n    lArc = previous;\n  }\n\n  disappearing.unshift(lArc);\n  detachCircle(lArc);\n\n  var rArc = next;\n  while (rArc.circle\n      && Math.abs(x - rArc.circle.x) < epsilon\n      && Math.abs(y - rArc.circle.cy) < epsilon) {\n    next = rArc.N;\n    disappearing.push(rArc);\n    detachBeach(rArc);\n    rArc = next;\n  }\n\n  disappearing.push(rArc);\n  detachCircle(rArc);\n\n  var nArcs = disappearing.length,\n      iArc;\n  for (iArc = 1; iArc < nArcs; ++iArc) {\n    rArc = disappearing[iArc];\n    lArc = disappearing[iArc - 1];\n    setEdgeEnd(rArc.edge, lArc.site, rArc.site, vertex);\n  }\n\n  lArc = disappearing[0];\n  rArc = disappearing[nArcs - 1];\n  rArc.edge = createEdge(lArc.site, rArc.site, null, vertex);\n\n  attachCircle(lArc);\n  attachCircle(rArc);\n}\n\nexport function addBeach(site) {\n  var x = site[0],\n      directrix = site[1],\n      lArc,\n      rArc,\n      dxl,\n      dxr,\n      node = beaches._;\n\n  while (node) {\n    dxl = leftBreakPoint(node, directrix) - x;\n    if (dxl > epsilon) node = node.L; else {\n      dxr = x - rightBreakPoint(node, directrix);\n      if (dxr > epsilon) {\n        if (!node.R) {\n          lArc = node;\n          break;\n        }\n        node = node.R;\n      } else {\n        if (dxl > -epsilon) {\n          lArc = node.P;\n          rArc = node;\n        } else if (dxr > -epsilon) {\n          lArc = node;\n          rArc = node.N;\n        } else {\n          lArc = rArc = node;\n        }\n        break;\n      }\n    }\n  }\n\n  createCell(site);\n  var newArc = createBeach(site);\n  beaches.insert(lArc, newArc);\n\n  if (!lArc && !rArc) return;\n\n  if (lArc === rArc) {\n    detachCircle(lArc);\n    rArc = createBeach(lArc.site);\n    beaches.insert(newArc, rArc);\n    newArc.edge = rArc.edge = createEdge(lArc.site, newArc.site);\n    attachCircle(lArc);\n    attachCircle(rArc);\n    return;\n  }\n\n  if (!rArc) { // && lArc\n    newArc.edge = createEdge(lArc.site, newArc.site);\n    return;\n  }\n\n  // else lArc !== rArc\n  detachCircle(lArc);\n  detachCircle(rArc);\n\n  var lSite = lArc.site,\n      ax = lSite[0],\n      ay = lSite[1],\n      bx = site[0] - ax,\n      by = site[1] - ay,\n      rSite = rArc.site,\n      cx = rSite[0] - ax,\n      cy = rSite[1] - ay,\n      d = 2 * (bx * cy - by * cx),\n      hb = bx * bx + by * by,\n      hc = cx * cx + cy * cy,\n      vertex = [(cy * hb - by * hc) / d + ax, (bx * hc - cx * hb) / d + ay];\n\n  setEdgeEnd(rArc.edge, lSite, rSite, vertex);\n  newArc.edge = createEdge(lSite, site, null, vertex);\n  rArc.edge = createEdge(site, rSite, null, vertex);\n  attachCircle(lArc);\n  attachCircle(rArc);\n}\n\nfunction leftBreakPoint(arc, directrix) {\n  var site = arc.site,\n      rfocx = site[0],\n      rfocy = site[1],\n      pby2 = rfocy - directrix;\n\n  if (!pby2) return rfocx;\n\n  var lArc = arc.P;\n  if (!lArc) return -Infinity;\n\n  site = lArc.site;\n  var lfocx = site[0],\n      lfocy = site[1],\n      plby2 = lfocy - directrix;\n\n  if (!plby2) return lfocx;\n\n  var hl = lfocx - rfocx,\n      aby2 = 1 / pby2 - 1 / plby2,\n      b = hl / plby2;\n\n  if (aby2) return (-b + Math.sqrt(b * b - 2 * aby2 * (hl * hl / (-2 * plby2) - lfocy + plby2 / 2 + rfocy - pby2 / 2))) / aby2 + rfocx;\n\n  return (rfocx + lfocx) / 2;\n}\n\nfunction rightBreakPoint(arc, directrix) {\n  var rArc = arc.N;\n  if (rArc) return leftBreakPoint(rArc, directrix);\n  var site = arc.site;\n  return site[1] === directrix ? site[0] : Infinity;\n}\n","import {addBeach, removeBeach} from \"./Beach\";\nimport {sortCellHalfedges, cellHalfedgeStart, clipCells} from \"./Cell\";\nimport {firstCircle} from \"./Circle\";\nimport {clipEdges} from \"./Edge\";\nimport RedBlackTree from \"./RedBlackTree\";\n\nexport var epsilon = 1e-6;\nexport var epsilon2 = 1e-12;\nexport var beaches;\nexport var cells;\nexport var circles;\nexport var edges;\n\nfunction triangleArea(a, b, c) {\n  return (a[0] - c[0]) * (b[1] - a[1]) - (a[0] - b[0]) * (c[1] - a[1]);\n}\n\nfunction lexicographic(a, b) {\n  return b[1] - a[1]\n      || b[0] - a[0];\n}\n\nexport default function Diagram(sites, extent) {\n  var site = sites.sort(lexicographic).pop(),\n      x,\n      y,\n      circle;\n\n  edges = [];\n  cells = new Array(sites.length);\n  beaches = new RedBlackTree;\n  circles = new RedBlackTree;\n\n  while (true) {\n    circle = firstCircle;\n    if (site && (!circle || site[1] < circle.y || (site[1] === circle.y && site[0] < circle.x))) {\n      if (site[0] !== x || site[1] !== y) {\n        addBeach(site);\n        x = site[0], y = site[1];\n      }\n      site = sites.pop();\n    } else if (circle) {\n      removeBeach(circle.arc);\n    } else {\n      break;\n    }\n  }\n\n  sortCellHalfedges();\n\n  if (extent) {\n    var x0 = +extent[0][0],\n        y0 = +extent[0][1],\n        x1 = +extent[1][0],\n        y1 = +extent[1][1];\n    clipEdges(x0, y0, x1, y1);\n    clipCells(x0, y0, x1, y1);\n  }\n\n  this.edges = edges;\n  this.cells = cells;\n\n  beaches =\n  circles =\n  edges =\n  cells = null;\n}\n\nDiagram.prototype = {\n  constructor: Diagram,\n\n  polygons: function() {\n    var edges = this.edges;\n\n    return this.cells.map(function(cell) {\n      var polygon = cell.halfedges.map(function(i) { return cellHalfedgeStart(cell, edges[i]); });\n      polygon.data = cell.site.data;\n      return polygon;\n    });\n  },\n\n  triangles: function() {\n    var triangles = [],\n        edges = this.edges;\n\n    this.cells.forEach(function(cell, i) {\n      if (!(m = (halfedges = cell.halfedges).length)) return;\n      var site = cell.site,\n          halfedges,\n          j = -1,\n          m,\n          s0,\n          e1 = edges[halfedges[m - 1]],\n          s1 = e1.left === site ? e1.right : e1.left;\n\n      while (++j < m) {\n        s0 = s1;\n        e1 = edges[halfedges[j]];\n        s1 = e1.left === site ? e1.right : e1.left;\n        if (s0 && s1 && i < s0.index && i < s1.index && triangleArea(site, s0, s1) < 0) {\n          triangles.push([site.data, s0.data, s1.data]);\n        }\n      }\n    });\n\n    return triangles;\n  },\n\n  links: function() {\n    return this.edges.filter(function(edge) {\n      return edge.right;\n    }).map(function(edge) {\n      return {\n        source: edge.left.data,\n        target: edge.right.data\n      };\n    });\n  },\n\n  find: function(x, y, radius) {\n    var that = this, i0, i1 = that._found || 0, n = that.cells.length, cell;\n\n    // Use the previously-found cell, or start with an arbitrary one.\n    while (!(cell = that.cells[i1])) if (++i1 >= n) return null;\n    var dx = x - cell.site[0], dy = y - cell.site[1], d2 = dx * dx + dy * dy;\n\n    // Traverse the half-edges to find a closer cell, if any.\n    do {\n      cell = that.cells[i0 = i1], i1 = null;\n      cell.halfedges.forEach(function(e) {\n        var edge = that.edges[e], v = edge.left;\n        if ((v === cell.site || !v) && !(v = edge.right)) return;\n        var vx = x - v[0], vy = y - v[1], v2 = vx * vx + vy * vy;\n        if (v2 < d2) d2 = v2, i1 = v.index;\n      });\n    } while (i1 !== null);\n\n    that._found = i0;\n\n    return radius == null || d2 <= radius * radius ? cell.site : null;\n  }\n}\n","/**\r\n * DBSCAN - Density based clustering\r\n *\r\n * @author Lukasz Krawczyk <contact@lukaszkrawczyk.eu>\r\n * @copyright MIT\r\n */\r\n\r\n/**\r\n * DBSCAN class construcotr\r\n * @constructor\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distanceFunction\r\n * @returns {DBSCAN}\r\n */\r\nfunction DBSCAN(dataset, epsilon, minPts, distanceFunction) {\r\n  /** @type {Array} */\r\n  this.dataset = [];\r\n  /** @type {number} */\r\n  this.epsilon = 1;\r\n  /** @type {number} */\r\n  this.minPts = 2;\r\n  /** @type {function} */\r\n  this.distance = this._euclideanDistance;\r\n  /** @type {Array} */\r\n  this.clusters = [];\r\n  /** @type {Array} */\r\n  this.noise = [];\r\n\r\n  // temporary variables used during computation\r\n\r\n  /** @type {Array} */\r\n  this._visited = [];\r\n  /** @type {Array} */\r\n  this._assigned = [];\r\n  /** @type {number} */\r\n  this._datasetLength = 0;\r\n\r\n  this._init(dataset, epsilon, minPts, distanceFunction);\r\n};\r\n\r\n/******************************************************************************/\r\n// public functions\r\n\r\n/**\r\n * Start clustering\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distanceFunction\r\n * @returns {undefined}\r\n * @access public\r\n */\r\nDBSCAN.prototype.run = function(dataset, epsilon, minPts, distanceFunction) {\r\n  this._init(dataset, epsilon, minPts, distanceFunction);\r\n\r\n  for (var pointId = 0; pointId < this._datasetLength; pointId++) {\r\n    // if point is not visited, check if it forms a cluster\r\n    if (this._visited[pointId] !== 1) {\r\n      this._visited[pointId] = 1;\r\n\r\n      // if closest neighborhood is too small to form a cluster, mark as noise\r\n      var neighbors = this._regionQuery(pointId);\r\n\r\n      if (neighbors.length < this.minPts) {\r\n        this.noise.push(pointId);\r\n      } else {\r\n        // create new cluster and add point\r\n        var clusterId = this.clusters.length;\r\n        this.clusters.push([]);\r\n        this._addToCluster(pointId, clusterId);\r\n\r\n        this._expandCluster(clusterId, neighbors);\r\n      }\r\n    }\r\n  }\r\n\r\n  return this.clusters;\r\n};\r\n\r\n/******************************************************************************/\r\n// protected functions\r\n\r\n/**\r\n * Set object properties\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distance\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._init = function(dataset, epsilon, minPts, distance) {\r\n\r\n  if (dataset) {\r\n\r\n    if (!(dataset instanceof Array)) {\r\n      throw Error('Dataset must be of type array, ' +\r\n        typeof dataset + ' given');\r\n    }\r\n\r\n    this.dataset = dataset;\r\n    this.clusters = [];\r\n    this.noise = [];\r\n\r\n    this._datasetLength = dataset.length;\r\n    this._visited = new Array(this._datasetLength);\r\n    this._assigned = new Array(this._datasetLength);\r\n  }\r\n\r\n  if (epsilon) {\r\n    this.epsilon = epsilon;\r\n  }\r\n\r\n  if (minPts) {\r\n    this.minPts = minPts;\r\n  }\r\n\r\n  if (distance) {\r\n    this.distance = distance;\r\n  }\r\n};\r\n\r\n/**\r\n * Expand cluster to closest points of given neighborhood\r\n *\r\n * @param {number} clusterId\r\n * @param {Array} neighbors\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._expandCluster = function(clusterId, neighbors) {\r\n\r\n  /**\r\n   * It's very important to calculate length of neighbors array each time,\r\n   * as the number of elements changes over time\r\n   */\r\n  for (var i = 0; i < neighbors.length; i++) {\r\n    var pointId2 = neighbors[i];\r\n\r\n    if (this._visited[pointId2] !== 1) {\r\n      this._visited[pointId2] = 1;\r\n      var neighbors2 = this._regionQuery(pointId2);\r\n\r\n      if (neighbors2.length >= this.minPts) {\r\n        neighbors = this._mergeArrays(neighbors, neighbors2);\r\n      }\r\n    }\r\n\r\n    // add to cluster\r\n    if (this._assigned[pointId2] !== 1) {\r\n      this._addToCluster(pointId2, clusterId);\r\n    }\r\n  }\r\n};\r\n\r\n/**\r\n * Add new point to cluster\r\n *\r\n * @param {number} pointId\r\n * @param {number} clusterId\r\n */\r\nDBSCAN.prototype._addToCluster = function(pointId, clusterId) {\r\n  this.clusters[clusterId].push(pointId);\r\n  this._assigned[pointId] = 1;\r\n};\r\n\r\n/**\r\n * Find all neighbors around given point\r\n *\r\n * @param {number} pointId,\r\n * @param {number} epsilon\r\n * @returns {Array}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._regionQuery = function(pointId) {\r\n  var neighbors = [];\r\n\r\n  for (var id = 0; id < this._datasetLength; id++) {\r\n    var dist = this.distance(this.dataset[pointId], this.dataset[id]);\r\n    if (dist < this.epsilon) {\r\n      neighbors.push(id);\r\n    }\r\n  }\r\n\r\n  return neighbors;\r\n};\r\n\r\n/******************************************************************************/\r\n// helpers\r\n\r\n/**\r\n * @param {Array} a\r\n * @param {Array} b\r\n * @returns {Array}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._mergeArrays = function(a, b) {\r\n  var len = b.length;\r\n\r\n  for (var i = 0; i < len; i++) {\r\n    var P = b[i];\r\n    if (a.indexOf(P) < 0) {\r\n      a.push(P);\r\n    }\r\n  }\r\n\r\n  return a;\r\n};\r\n\r\n/**\r\n * Calculate euclidean distance in multidimensional space\r\n *\r\n * @param {Array} p\r\n * @param {Array} q\r\n * @returns {number}\r\n * @access protected\r\n */\r\nDBSCAN.prototype._euclideanDistance = function(p, q) {\r\n  var sum = 0;\r\n  var i = Math.min(p.length, q.length);\r\n\r\n  while (i--) {\r\n    sum += (p[i] - q[i]) * (p[i] - q[i]);\r\n  }\r\n\r\n  return Math.sqrt(sum);\r\n};\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n  module.exports = DBSCAN;\r\n}\r\n","/**\r\n * KMEANS clustering\r\n *\r\n * @author Lukasz Krawczyk <contact@lukaszkrawczyk.eu>\r\n * @copyright MIT\r\n */\r\n\r\n/**\r\n * KMEANS class constructor\r\n * @constructor\r\n *\r\n * @param {Array} dataset\r\n * @param {number} k - number of clusters\r\n * @param {function} distance - distance function\r\n * @returns {KMEANS}\r\n */\r\n function KMEANS(dataset, k, distance) {\r\n  this.k = 3; // number of clusters\r\n  this.dataset = []; // set of feature vectors\r\n  this.assignments = []; // set of associated clusters for each feature vector\r\n  this.centroids = []; // vectors for our clusters\r\n\r\n  this.init(dataset, k, distance);\r\n}\r\n\r\n/**\r\n * @returns {undefined}\r\n */\r\nKMEANS.prototype.init = function(dataset, k, distance) {\r\n  this.assignments = [];\r\n  this.centroids = [];\r\n\r\n  if (typeof dataset !== 'undefined') {\r\n    this.dataset = dataset;\r\n  }\r\n\r\n  if (typeof k !== 'undefined') {\r\n    this.k = k;\r\n  }\r\n\r\n  if (typeof distance !== 'undefined') {\r\n    this.distance = distance;\r\n  }\r\n};\r\n\r\n/**\r\n * @returns {undefined}\r\n */\r\nKMEANS.prototype.run = function(dataset, k) {\r\n  this.init(dataset, k);\r\n\r\n  var len = this.dataset.length;\r\n\r\n  // initialize centroids\r\n  for (var i = 0; i < this.k; i++) {\r\n    this.centroids[i] = this.randomCentroid();\r\n\t}\r\n\r\n  var change = true;\r\n  while(change) {\r\n\r\n    // assign feature vectors to clusters\r\n    change = this.assign();\r\n\r\n    // adjust location of centroids\r\n    for (var centroidId = 0; centroidId < this.k; centroidId++) {\r\n      var mean = new Array(maxDim);\r\n      var count = 0;\r\n\r\n      // init mean vector\r\n      for (var dim = 0; dim < maxDim; dim++) {\r\n        mean[dim] = 0;\r\n      }\r\n\r\n      for (var j = 0; j < len; j++) {\r\n        var maxDim = this.dataset[j].length;\r\n\r\n        // if current cluster id is assigned to point\r\n        if (centroidId === this.assignments[j]) {\r\n          for (var dim = 0; dim < maxDim; dim++) {\r\n            mean[dim] += this.dataset[j][dim];\r\n          }\r\n          count++;\r\n        }\r\n      }\r\n\r\n      if (count > 0) {\r\n        // if cluster contain points, adjust centroid position\r\n        for (var dim = 0; dim < maxDim; dim++) {\r\n          mean[dim] /= count;\r\n        }\r\n        this.centroids[centroidId] = mean;\r\n      } else {\r\n        // if cluster is empty, generate new random centroid\r\n        this.centroids[centroidId] = this.randomCentroid();\r\n        change = true;\r\n      }\r\n    }\r\n  }\r\n\r\n  return this.getClusters();\r\n};\r\n\r\n/**\r\n * Generate random centroid\r\n *\r\n * @returns {Array}\r\n */\r\nKMEANS.prototype.randomCentroid = function() {\r\n  var maxId = this.dataset.length -1;\r\n  var centroid;\r\n  var id;\r\n\r\n  do {\r\n    id = Math.round(Math.random() * maxId);\r\n    centroid = this.dataset[id];\r\n  } while (this.centroids.indexOf(centroid) >= 0);\r\n\r\n  return centroid;\r\n}\r\n\r\n/**\r\n * Assign points to clusters\r\n *\r\n * @returns {boolean}\r\n */\r\nKMEANS.prototype.assign = function() {\r\n  var change = false;\r\n  var len = this.dataset.length;\r\n  var closestCentroid;\r\n\r\n  for (var i = 0; i < len; i++) {\r\n    closestCentroid = this.argmin(this.dataset[i], this.centroids, this.distance);\r\n\r\n    if (closestCentroid != this.assignments[i]) {\r\n      this.assignments[i] = closestCentroid;\r\n      change = true;\r\n    }\r\n  }\r\n\r\n  return change;\r\n}\r\n\r\n/**\r\n * Extract information about clusters\r\n *\r\n * @returns {undefined}\r\n */\r\nKMEANS.prototype.getClusters = function() {\r\n  var clusters = new Array(this.k);\r\n  var centroidId;\r\n\r\n  for (var pointId = 0; pointId < this.assignments.length; pointId++) {\r\n    centroidId = this.assignments[pointId];\r\n\r\n    // init empty cluster\r\n    if (typeof clusters[centroidId] === 'undefined') {\r\n      clusters[centroidId] = [];\r\n    }\r\n\r\n    clusters[centroidId].push(pointId);\r\n  }\r\n\r\n  return clusters;\r\n};\r\n\r\n// utils\r\n\r\n/**\r\n * @params {Array} point\r\n * @params {Array.<Array>} set\r\n * @params {Function} f\r\n * @returns {number}\r\n */\r\nKMEANS.prototype.argmin = function(point, set, f) {\r\n  var min = Number.MAX_VALUE;\r\n  var arg = 0;\r\n  var len = set.length;\r\n  var d;\r\n\r\n  for (var i = 0; i < len; i++) {\r\n    d = f(point, set[i]);\r\n    if (d < min) {\r\n      min = d;\r\n      arg = i;\r\n    }\r\n  }\r\n\r\n  return arg;\r\n};\r\n\r\n/**\r\n * Euclidean distance\r\n *\r\n * @params {number} p\r\n * @params {number} q\r\n * @returns {number}\r\n */\r\nKMEANS.prototype.distance = function(p, q) {\r\n  var sum = 0;\r\n  var i = Math.min(p.length, q.length);\r\n\r\n  while (i--) {\r\n    var diff = p[i] - q[i];\r\n    sum += diff * diff;\r\n  }\r\n\r\n  return Math.sqrt(sum);\r\n};\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n  module.exports = KMEANS;\r\n}\r\n","\r\n/**\r\n * @requires ./PriorityQueue.js\r\n */\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n      var PriorityQueue = require('./PriorityQueue.js');\r\n}\r\n\r\n/**\r\n * OPTICS - Ordering points to identify the clustering structure\r\n *\r\n * @author Lukasz Krawczyk <contact@lukaszkrawczyk.eu>\r\n * @copyright MIT\r\n */\r\n\r\n/**\r\n * OPTICS class constructor\r\n * @constructor\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distanceFunction\r\n * @returns {OPTICS}\r\n */\r\nfunction OPTICS(dataset, epsilon, minPts, distanceFunction) {\r\n  /** @type {number} */\r\n  this.epsilon = 1;\r\n  /** @type {number} */\r\n  this.minPts = 1;\r\n  /** @type {function} */\r\n  this.distance = this._euclideanDistance;\r\n\r\n  // temporary variables used during computation\r\n\r\n  /** @type {Array} */\r\n  this._reachability = [];\r\n  /** @type {Array} */\r\n  this._processed = [];\r\n  /** @type {number} */\r\n  this._coreDistance = 0;\r\n  /** @type {Array} */\r\n  this._orderedList = [];\r\n\r\n  this._init(dataset, epsilon, minPts, distanceFunction);\r\n}\r\n\r\n/******************************************************************************/\r\n// pulic functions\r\n\r\n/**\r\n * Start clustering\r\n *\r\n * @param {Array} dataset\r\n * @returns {undefined}\r\n * @access public\r\n */\r\nOPTICS.prototype.run = function(dataset, epsilon, minPts, distanceFunction) {\r\n  this._init(dataset, epsilon, minPts, distanceFunction);\r\n\r\n  for (var pointId = 0, l = this.dataset.length; pointId < l; pointId++) {\r\n    if (this._processed[pointId] !== 1) {\r\n      this._processed[pointId] = 1;\r\n      this.clusters.push([pointId]);\r\n      var clusterId = this.clusters.length - 1;\r\n\r\n      this._orderedList.push(pointId);\r\n      var priorityQueue = new PriorityQueue(null, null, 'asc');\r\n      var neighbors = this._regionQuery(pointId);\r\n\r\n      // using priority queue assign elements to new cluster\r\n      if (this._distanceToCore(pointId) !== undefined) {\r\n        this._updateQueue(pointId, neighbors, priorityQueue);\r\n        this._expandCluster(clusterId, priorityQueue);\r\n      }\r\n    }\r\n  }\r\n\r\n  return this.clusters;\r\n};\r\n\r\n/**\r\n * Generate reachability plot for all points\r\n *\r\n * @returns {array}\r\n * @access public\r\n */\r\nOPTICS.prototype.getReachabilityPlot = function() {\r\n  var reachabilityPlot = [];\r\n\r\n  for (var i = 0, l = this._orderedList.length; i < l; i++) {\r\n    var pointId = this._orderedList[i];\r\n    var distance = this._reachability[pointId];\r\n\r\n    reachabilityPlot.push([pointId, distance]);\r\n  }\r\n\r\n  return reachabilityPlot;\r\n};\r\n\r\n/******************************************************************************/\r\n// protected functions\r\n\r\n/**\r\n * Set object properties\r\n *\r\n * @param {Array} dataset\r\n * @param {number} epsilon\r\n * @param {number} minPts\r\n * @param {function} distance\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nOPTICS.prototype._init = function(dataset, epsilon, minPts, distance) {\r\n\r\n  if (dataset) {\r\n\r\n    if (!(dataset instanceof Array)) {\r\n      throw Error('Dataset must be of type array, ' +\r\n        typeof dataset + ' given');\r\n    }\r\n\r\n    this.dataset = dataset;\r\n    this.clusters = [];\r\n    this._reachability = new Array(this.dataset.length);\r\n    this._processed = new Array(this.dataset.length);\r\n    this._coreDistance = 0;\r\n    this._orderedList = [];\r\n  }\r\n\r\n  if (epsilon) {\r\n    this.epsilon = epsilon;\r\n  }\r\n\r\n  if (minPts) {\r\n    this.minPts = minPts;\r\n  }\r\n\r\n  if (distance) {\r\n    this.distance = distance;\r\n  }\r\n};\r\n\r\n/**\r\n * Update information in queue\r\n *\r\n * @param {number} pointId\r\n * @param {Array} neighbors\r\n * @param {PriorityQueue} queue\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nOPTICS.prototype._updateQueue = function(pointId, neighbors, queue) {\r\n  var self = this;\r\n\r\n  this._coreDistance = this._distanceToCore(pointId);\r\n  neighbors.forEach(function(pointId2) {\r\n    if (self._processed[pointId2] === undefined) {\r\n      var dist = self.distance(self.dataset[pointId], self.dataset[pointId2]);\r\n      var newReachableDistance = Math.max(self._coreDistance, dist);\r\n\r\n      if (self._reachability[pointId2] === undefined) {\r\n        self._reachability[pointId2] = newReachableDistance;\r\n        queue.insert(pointId2, newReachableDistance);\r\n      } else {\r\n        if (newReachableDistance < self._reachability[pointId2]) {\r\n          self._reachability[pointId2] = newReachableDistance;\r\n          queue.remove(pointId2);\r\n          queue.insert(pointId2, newReachableDistance);\r\n        }\r\n      }\r\n    }\r\n  });\r\n};\r\n\r\n/**\r\n * Expand cluster\r\n *\r\n * @param {number} clusterId\r\n * @param {PriorityQueue} queue\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nOPTICS.prototype._expandCluster = function(clusterId, queue) {\r\n  var queueElements = queue.getElements();\r\n\r\n  for (var p = 0, l = queueElements.length; p < l; p++) {\r\n    var pointId = queueElements[p];\r\n    if (this._processed[pointId] === undefined) {\r\n      var neighbors = this._regionQuery(pointId);\r\n      this._processed[pointId] = 1;\r\n\r\n      this.clusters[clusterId].push(pointId);\r\n      this._orderedList.push(pointId);\r\n\r\n      if (this._distanceToCore(pointId) !== undefined) {\r\n        this._updateQueue(pointId, neighbors, queue);\r\n        this._expandCluster(clusterId, queue);\r\n      }\r\n    }\r\n  }\r\n};\r\n\r\n/**\r\n * Calculating distance to cluster core\r\n *\r\n * @param {number} pointId\r\n * @returns {number}\r\n * @access protected\r\n */\r\nOPTICS.prototype._distanceToCore = function(pointId) {\r\n  var l = this.epsilon;\r\n  for (var coreDistCand = 0; coreDistCand < l; coreDistCand++) {\r\n    var neighbors = this._regionQuery(pointId, coreDistCand);\r\n    if (neighbors.length >= this.minPts) {\r\n      return coreDistCand;\r\n    }\r\n  }\r\n\r\n  return;\r\n};\r\n\r\n/**\r\n * Find all neighbors around given point\r\n *\r\n * @param {number} pointId\r\n * @param {number} epsilon\r\n * @returns {Array}\r\n * @access protected\r\n */\r\nOPTICS.prototype._regionQuery = function(pointId, epsilon) {\r\n  epsilon = epsilon || this.epsilon;\r\n  var neighbors = [];\r\n\r\n  for (var id = 0, l = this.dataset.length; id < l; id++) {\r\n    if (this.distance(this.dataset[pointId], this.dataset[id]) < epsilon) {\r\n      neighbors.push(id);\r\n    }\r\n  }\r\n\r\n  return neighbors;\r\n};\r\n\r\n/******************************************************************************/\r\n// helpers\r\n\r\n/**\r\n * Calculate euclidean distance in multidimensional space\r\n *\r\n * @param {Array} p\r\n * @param {Array} q\r\n * @returns {number}\r\n * @access protected\r\n */\r\nOPTICS.prototype._euclideanDistance = function(p, q) {\r\n  var sum = 0;\r\n  var i = Math.min(p.length, q.length);\r\n\r\n  while (i--) {\r\n    sum += (p[i] - q[i]) * (p[i] - q[i]);\r\n  }\r\n\r\n  return Math.sqrt(sum);\r\n};\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n  module.exports = OPTICS;\r\n}\r\n","/**\r\n * PriorityQueue\r\n * Elements in this queue are sorted according to their value\r\n *\r\n * @author Lukasz Krawczyk <contact@lukaszkrawczyk.eu>\r\n * @copyright MIT\r\n */\r\n\r\n/**\r\n * PriorityQueue class construcotr\r\n * @constructor\r\n *\r\n * @example\r\n * queue: [1,2,3,4]\r\n * priorities: [4,1,2,3]\r\n * > result = [1,4,2,3]\r\n *\r\n * @param {Array} elements\r\n * @param {Array} priorities\r\n * @param {string} sorting - asc / desc\r\n * @returns {PriorityQueue}\r\n */\r\nfunction PriorityQueue(elements, priorities, sorting) {\r\n  /** @type {Array} */\r\n  this._queue = [];\r\n  /** @type {Array} */\r\n  this._priorities = [];\r\n  /** @type {string} */\r\n  this._sorting = 'desc';\r\n\r\n  this._init(elements, priorities, sorting);\r\n};\r\n\r\n/**\r\n * Insert element\r\n *\r\n * @param {Object} ele\r\n * @param {Object} priority\r\n * @returns {undefined}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.insert = function(ele, priority) {\r\n  var indexToInsert = this._queue.length;\r\n  var index = indexToInsert;\r\n\r\n  while (index--) {\r\n    var priority2 = this._priorities[index];\r\n    if (this._sorting === 'desc') {\r\n      if (priority > priority2) {\r\n        indexToInsert = index;\r\n      }\r\n    } else {\r\n      if (priority < priority2) {\r\n        indexToInsert = index;\r\n      }\r\n    }\r\n  }\r\n\r\n  this._insertAt(ele, priority, indexToInsert);\r\n};\r\n\r\n/**\r\n * Remove element\r\n *\r\n * @param {Object} ele\r\n * @returns {undefined}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.remove = function(ele) {\r\n  var index = this._queue.length;\r\n\r\n  while (index--) {\r\n    var ele2 = this._queue[index];\r\n    if (ele === ele2) {\r\n      this._queue.splice(index, 1);\r\n      this._priorities.splice(index, 1);\r\n      break;\r\n    }\r\n  }\r\n};\r\n\r\n/**\r\n * For each loop wrapper\r\n *\r\n * @param {function} func\r\n * @returs {undefined}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.forEach = function(func) {\r\n  this._queue.forEach(func);\r\n};\r\n\r\n/**\r\n * @returns {Array}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.getElements = function() {\r\n  return this._queue;\r\n};\r\n\r\n/**\r\n * @param {number} index\r\n * @returns {Object}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.getElementPriority = function(index) {\r\n  return this._priorities[index];\r\n};\r\n\r\n/**\r\n * @returns {Array}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.getPriorities = function() {\r\n  return this._priorities;\r\n};\r\n\r\n/**\r\n * @returns {Array}\r\n * @access public\r\n */\r\nPriorityQueue.prototype.getElementsWithPriorities = function() {\r\n  var result = [];\r\n\r\n  for (var i = 0, l = this._queue.length; i < l; i++) {\r\n    result.push([this._queue[i], this._priorities[i]]);\r\n  }\r\n\r\n  return result;\r\n};\r\n\r\n/**\r\n * Set object properties\r\n *\r\n * @param {Array} elements\r\n * @param {Array} priorities\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nPriorityQueue.prototype._init = function(elements, priorities, sorting) {\r\n\r\n  if (elements && priorities) {\r\n    this._queue = [];\r\n    this._priorities = [];\r\n\r\n    if (elements.length !== priorities.length) {\r\n      throw new Error('Arrays must have the same length');\r\n    }\r\n\r\n    for (var i = 0; i < elements.length; i++) {\r\n      this.insert(elements[i], priorities[i]);\r\n    }\r\n  }\r\n\r\n  if (sorting) {\r\n    this._sorting = sorting;\r\n  }\r\n};\r\n\r\n/**\r\n * Insert element at given position\r\n *\r\n * @param {Object} ele\r\n * @param {number} index\r\n * @returns {undefined}\r\n * @access protected\r\n */\r\nPriorityQueue.prototype._insertAt = function(ele, priority, index) {\r\n  if (this._queue.length === index) {\r\n    this._queue.push(ele);\r\n    this._priorities.push(priority);\r\n  } else {\r\n    this._queue.splice(index, 0, ele);\r\n    this._priorities.splice(index, 0, priority);\r\n  }\r\n};\r\n\r\nif (typeof module !== 'undefined' && module.exports) {\r\n  module.exports = PriorityQueue;\r\n}\r\n","'use strict';\n\n/* eslint no-invalid-this: 1 */\n\nvar ERROR_MESSAGE = 'Function.prototype.bind called on incompatible ';\nvar slice = Array.prototype.slice;\nvar toStr = Object.prototype.toString;\nvar funcType = '[object Function]';\n\nmodule.exports = function bind(that) {\n    var target = this;\n    if (typeof target !== 'function' || toStr.call(target) !== funcType) {\n        throw new TypeError(ERROR_MESSAGE + target);\n    }\n    var args = slice.call(arguments, 1);\n\n    var bound;\n    var binder = function () {\n        if (this instanceof bound) {\n            var result = target.apply(\n                this,\n                args.concat(slice.call(arguments))\n            );\n            if (Object(result) === result) {\n                return result;\n            }\n            return this;\n        } else {\n            return target.apply(\n                that,\n                args.concat(slice.call(arguments))\n            );\n        }\n    };\n\n    var boundLength = Math.max(0, target.length - args.length);\n    var boundArgs = [];\n    for (var i = 0; i < boundLength; i++) {\n        boundArgs.push('$' + i);\n    }\n\n    bound = Function('binder', 'return function (' + boundArgs.join(',') + '){ return binder.apply(this,arguments); }')(binder);\n\n    if (target.prototype) {\n        var Empty = function Empty() {};\n        Empty.prototype = target.prototype;\n        bound.prototype = new Empty();\n        Empty.prototype = null;\n    }\n\n    return bound;\n};\n","!function(t,i){\"object\"==typeof exports&&\"undefined\"!=typeof module?module.exports=i():\"function\"==typeof define&&define.amd?define(i):(t=t||self).RBush=i()}(this,function(){\"use strict\";function t(t,r,e,a,h){!function t(n,r,e,a,h){for(;a>e;){if(a-e>600){var o=a-e+1,s=r-e+1,l=Math.log(o),f=.5*Math.exp(2*l/3),u=.5*Math.sqrt(l*f*(o-f)/o)*(s-o/2<0?-1:1),m=Math.max(e,Math.floor(r-s*f/o+u)),c=Math.min(a,Math.floor(r+(o-s)*f/o+u));t(n,r,m,c,h)}var p=n[r],d=e,x=a;for(i(n,e,r),h(n[a],p)>0&&i(n,e,a);d<x;){for(i(n,d,x),d++,x--;h(n[d],p)<0;)d++;for(;h(n[x],p)>0;)x--}0===h(n[e],p)?i(n,e,x):i(n,++x,a),x<=r&&(e=x+1),r<=x&&(a=x-1)}}(t,r,e||0,a||t.length-1,h||n)}function i(t,i,n){var r=t[i];t[i]=t[n],t[n]=r}function n(t,i){return t<i?-1:t>i?1:0}var r=function(t){void 0===t&&(t=9),this._maxEntries=Math.max(4,t),this._minEntries=Math.max(2,Math.ceil(.4*this._maxEntries)),this.clear()};function e(t,i,n){if(!n)return i.indexOf(t);for(var r=0;r<i.length;r++)if(n(t,i[r]))return r;return-1}function a(t,i){h(t,0,t.children.length,i,t)}function h(t,i,n,r,e){e||(e=p(null)),e.minX=1/0,e.minY=1/0,e.maxX=-1/0,e.maxY=-1/0;for(var a=i;a<n;a++){var h=t.children[a];o(e,t.leaf?r(h):h)}return e}function o(t,i){return t.minX=Math.min(t.minX,i.minX),t.minY=Math.min(t.minY,i.minY),t.maxX=Math.max(t.maxX,i.maxX),t.maxY=Math.max(t.maxY,i.maxY),t}function s(t,i){return t.minX-i.minX}function l(t,i){return t.minY-i.minY}function f(t){return(t.maxX-t.minX)*(t.maxY-t.minY)}function u(t){return t.maxX-t.minX+(t.maxY-t.minY)}function m(t,i){return t.minX<=i.minX&&t.minY<=i.minY&&i.maxX<=t.maxX&&i.maxY<=t.maxY}function c(t,i){return i.minX<=t.maxX&&i.minY<=t.maxY&&i.maxX>=t.minX&&i.maxY>=t.minY}function p(t){return{children:t,height:1,leaf:!0,minX:1/0,minY:1/0,maxX:-1/0,maxY:-1/0}}function d(i,n,r,e,a){for(var h=[n,r];h.length;)if(!((r=h.pop())-(n=h.pop())<=e)){var o=n+Math.ceil((r-n)/e/2)*e;t(i,o,n,r,a),h.push(n,o,o,r)}}return r.prototype.all=function(){return this._all(this.data,[])},r.prototype.search=function(t){var i=this.data,n=[];if(!c(t,i))return n;for(var r=this.toBBox,e=[];i;){for(var a=0;a<i.children.length;a++){var h=i.children[a],o=i.leaf?r(h):h;c(t,o)&&(i.leaf?n.push(h):m(t,o)?this._all(h,n):e.push(h))}i=e.pop()}return n},r.prototype.collides=function(t){var i=this.data;if(!c(t,i))return!1;for(var n=[];i;){for(var r=0;r<i.children.length;r++){var e=i.children[r],a=i.leaf?this.toBBox(e):e;if(c(t,a)){if(i.leaf||m(t,a))return!0;n.push(e)}}i=n.pop()}return!1},r.prototype.load=function(t){if(!t||!t.length)return this;if(t.length<this._minEntries){for(var i=0;i<t.length;i++)this.insert(t[i]);return this}var n=this._build(t.slice(),0,t.length-1,0);if(this.data.children.length)if(this.data.height===n.height)this._splitRoot(this.data,n);else{if(this.data.height<n.height){var r=this.data;this.data=n,n=r}this._insert(n,this.data.height-n.height-1,!0)}else this.data=n;return this},r.prototype.insert=function(t){return t&&this._insert(t,this.data.height-1),this},r.prototype.clear=function(){return this.data=p([]),this},r.prototype.remove=function(t,i){if(!t)return this;for(var n,r,a,h=this.data,o=this.toBBox(t),s=[],l=[];h||s.length;){if(h||(h=s.pop(),r=s[s.length-1],n=l.pop(),a=!0),h.leaf){var f=e(t,h.children,i);if(-1!==f)return h.children.splice(f,1),s.push(h),this._condense(s),this}a||h.leaf||!m(h,o)?r?(n++,h=r.children[n],a=!1):h=null:(s.push(h),l.push(n),n=0,r=h,h=h.children[0])}return this},r.prototype.toBBox=function(t){return t},r.prototype.compareMinX=function(t,i){return t.minX-i.minX},r.prototype.compareMinY=function(t,i){return t.minY-i.minY},r.prototype.toJSON=function(){return this.data},r.prototype.fromJSON=function(t){return this.data=t,this},r.prototype._all=function(t,i){for(var n=[];t;)t.leaf?i.push.apply(i,t.children):n.push.apply(n,t.children),t=n.pop();return i},r.prototype._build=function(t,i,n,r){var e,h=n-i+1,o=this._maxEntries;if(h<=o)return a(e=p(t.slice(i,n+1)),this.toBBox),e;r||(r=Math.ceil(Math.log(h)/Math.log(o)),o=Math.ceil(h/Math.pow(o,r-1))),(e=p([])).leaf=!1,e.height=r;var s=Math.ceil(h/o),l=s*Math.ceil(Math.sqrt(o));d(t,i,n,l,this.compareMinX);for(var f=i;f<=n;f+=l){var u=Math.min(f+l-1,n);d(t,f,u,s,this.compareMinY);for(var m=f;m<=u;m+=s){var c=Math.min(m+s-1,u);e.children.push(this._build(t,m,c,r-1))}}return a(e,this.toBBox),e},r.prototype._chooseSubtree=function(t,i,n,r){for(;r.push(i),!i.leaf&&r.length-1!==n;){for(var e=1/0,a=1/0,h=void 0,o=0;o<i.children.length;o++){var s=i.children[o],l=f(s),u=(m=t,c=s,(Math.max(c.maxX,m.maxX)-Math.min(c.minX,m.minX))*(Math.max(c.maxY,m.maxY)-Math.min(c.minY,m.minY))-l);u<a?(a=u,e=l<e?l:e,h=s):u===a&&l<e&&(e=l,h=s)}i=h||i.children[0]}var m,c;return i},r.prototype._insert=function(t,i,n){var r=n?t:this.toBBox(t),e=[],a=this._chooseSubtree(r,this.data,i,e);for(a.children.push(t),o(a,r);i>=0&&e[i].children.length>this._maxEntries;)this._split(e,i),i--;this._adjustParentBBoxes(r,e,i)},r.prototype._split=function(t,i){var n=t[i],r=n.children.length,e=this._minEntries;this._chooseSplitAxis(n,e,r);var h=this._chooseSplitIndex(n,e,r),o=p(n.children.splice(h,n.children.length-h));o.height=n.height,o.leaf=n.leaf,a(n,this.toBBox),a(o,this.toBBox),i?t[i-1].children.push(o):this._splitRoot(n,o)},r.prototype._splitRoot=function(t,i){this.data=p([t,i]),this.data.height=t.height+1,this.data.leaf=!1,a(this.data,this.toBBox)},r.prototype._chooseSplitIndex=function(t,i,n){for(var r,e,a,o,s,l,u,m=1/0,c=1/0,p=i;p<=n-i;p++){var d=h(t,0,p,this.toBBox),x=h(t,p,n,this.toBBox),v=(e=d,a=x,o=void 0,s=void 0,l=void 0,u=void 0,o=Math.max(e.minX,a.minX),s=Math.max(e.minY,a.minY),l=Math.min(e.maxX,a.maxX),u=Math.min(e.maxY,a.maxY),Math.max(0,l-o)*Math.max(0,u-s)),M=f(d)+f(x);v<m?(m=v,r=p,c=M<c?M:c):v===m&&M<c&&(c=M,r=p)}return r||n-i},r.prototype._chooseSplitAxis=function(t,i,n){var r=t.leaf?this.compareMinX:s,e=t.leaf?this.compareMinY:l;this._allDistMargin(t,i,n,r)<this._allDistMargin(t,i,n,e)&&t.children.sort(r)},r.prototype._allDistMargin=function(t,i,n,r){t.children.sort(r);for(var e=this.toBBox,a=h(t,0,i,e),s=h(t,n-i,n,e),l=u(a)+u(s),f=i;f<n-i;f++){var m=t.children[f];o(a,t.leaf?e(m):m),l+=u(a)}for(var c=n-i-1;c>=i;c--){var p=t.children[c];o(s,t.leaf?e(p):p),l+=u(s)}return l},r.prototype._adjustParentBBoxes=function(t,i,n){for(var r=n;r>=0;r--)o(i[r],t)},r.prototype._condense=function(t){for(var i=t.length-1,n=void 0;i>=0;i--)0===t[i].children.length?i>0?(n=t[i-1].children).splice(n.indexOf(t[i]),1):this.clear():a(t[i],this.toBBox)},r});\n","'use strict';\n\n/* eslint complexity: [2, 18], max-statements: [2, 33] */\nmodule.exports = function hasSymbols() {\n\tif (typeof Symbol !== 'function' || typeof Object.getOwnPropertySymbols !== 'function') { return false; }\n\tif (typeof Symbol.iterator === 'symbol') { return true; }\n\n\tvar obj = {};\n\tvar sym = Symbol('test');\n\tvar symObj = Object(sym);\n\tif (typeof sym === 'string') { return false; }\n\n\tif (Object.prototype.toString.call(sym) !== '[object Symbol]') { return false; }\n\tif (Object.prototype.toString.call(symObj) !== '[object Symbol]') { return false; }\n\n\t// temp disabled per https://github.com/ljharb/object.assign/issues/17\n\t// if (sym instanceof Symbol) { return false; }\n\t// temp disabled per https://github.com/WebReflection/get-own-property-symbols/issues/4\n\t// if (!(symObj instanceof Symbol)) { return false; }\n\n\t// if (typeof Symbol.prototype.toString !== 'function') { return false; }\n\t// if (String(sym) !== Symbol.prototype.toString.call(sym)) { return false; }\n\n\tvar symVal = 42;\n\tobj[sym] = symVal;\n\tfor (sym in obj) { return false; } // eslint-disable-line no-restricted-syntax, no-unreachable-loop\n\tif (typeof Object.keys === 'function' && Object.keys(obj).length !== 0) { return false; }\n\n\tif (typeof Object.getOwnPropertyNames === 'function' && Object.getOwnPropertyNames(obj).length !== 0) { return false; }\n\n\tvar syms = Object.getOwnPropertySymbols(obj);\n\tif (syms.length !== 1 || syms[0] !== sym) { return false; }\n\n\tif (!Object.prototype.propertyIsEnumerable.call(obj, sym)) { return false; }\n\n\tif (typeof Object.getOwnPropertyDescriptor === 'function') {\n\t\tvar descriptor = Object.getOwnPropertyDescriptor(obj, sym);\n\t\tif (descriptor.value !== symVal || descriptor.enumerable !== true) { return false; }\n\t}\n\n\treturn true;\n};\n","'use strict';\n\nvar hasSymbols = require('has-symbols/shams');\n\nmodule.exports = function hasToStringTagShams() {\n\treturn hasSymbols() && !!Symbol.toStringTag;\n};\n","'use strict';\n\nvar numberIsNaN = function (value) {\n\treturn value !== value;\n};\n\nmodule.exports = function is(a, b) {\n\tif (a === 0 && b === 0) {\n\t\treturn 1 / a === 1 / b;\n\t}\n\tif (a === b) {\n\t\treturn true;\n\t}\n\tif (numberIsNaN(a) && numberIsNaN(b)) {\n\t\treturn true;\n\t}\n\treturn false;\n};\n\n","'use strict';\n\nvar implementation = require('./implementation');\n\nmodule.exports = function getPolyfill() {\n\treturn typeof Object.is === 'function' ? Object.is : implementation;\n};\n","'use strict';\n\nvar getPolyfill = require('./polyfill');\nvar define = require('define-properties');\n\nmodule.exports = function shimObjectIs() {\n\tvar polyfill = getPolyfill();\n\tdefine(Object, { is: polyfill }, {\n\t\tis: function testObjectIs() {\n\t\t\treturn Object.is !== polyfill;\n\t\t}\n\t});\n\treturn polyfill;\n};\n","'use strict';\n\nvar keysShim;\nif (!Object.keys) {\n\t// modified from https://github.com/es-shims/es5-shim\n\tvar has = Object.prototype.hasOwnProperty;\n\tvar toStr = Object.prototype.toString;\n\tvar isArgs = require('./isArguments'); // eslint-disable-line global-require\n\tvar isEnumerable = Object.prototype.propertyIsEnumerable;\n\tvar hasDontEnumBug = !isEnumerable.call({ toString: null }, 'toString');\n\tvar hasProtoEnumBug = isEnumerable.call(function () {}, 'prototype');\n\tvar dontEnums = [\n\t\t'toString',\n\t\t'toLocaleString',\n\t\t'valueOf',\n\t\t'hasOwnProperty',\n\t\t'isPrototypeOf',\n\t\t'propertyIsEnumerable',\n\t\t'constructor'\n\t];\n\tvar equalsConstructorPrototype = function (o) {\n\t\tvar ctor = o.constructor;\n\t\treturn ctor && ctor.prototype === o;\n\t};\n\tvar excludedKeys = {\n\t\t$applicationCache: true,\n\t\t$console: true,\n\t\t$external: true,\n\t\t$frame: true,\n\t\t$frameElement: true,\n\t\t$frames: true,\n\t\t$innerHeight: true,\n\t\t$innerWidth: true,\n\t\t$onmozfullscreenchange: true,\n\t\t$onmozfullscreenerror: true,\n\t\t$outerHeight: true,\n\t\t$outerWidth: true,\n\t\t$pageXOffset: true,\n\t\t$pageYOffset: true,\n\t\t$parent: true,\n\t\t$scrollLeft: true,\n\t\t$scrollTop: true,\n\t\t$scrollX: true,\n\t\t$scrollY: true,\n\t\t$self: true,\n\t\t$webkitIndexedDB: true,\n\t\t$webkitStorageInfo: true,\n\t\t$window: true\n\t};\n\tvar hasAutomationEqualityBug = (function () {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined') { return false; }\n\t\tfor (var k in window) {\n\t\t\ttry {\n\t\t\t\tif (!excludedKeys['$' + k] && has.call(window, k) && window[k] !== null && typeof window[k] === 'object') {\n\t\t\t\t\ttry {\n\t\t\t\t\t\tequalsConstructorPrototype(window[k]);\n\t\t\t\t\t} catch (e) {\n\t\t\t\t\t\treturn true;\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t} catch (e) {\n\t\t\t\treturn true;\n\t\t\t}\n\t\t}\n\t\treturn false;\n\t}());\n\tvar equalsConstructorPrototypeIfNotBuggy = function (o) {\n\t\t/* global window */\n\t\tif (typeof window === 'undefined' || !hasAutomationEqualityBug) {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t}\n\t\ttry {\n\t\t\treturn equalsConstructorPrototype(o);\n\t\t} catch (e) {\n\t\t\treturn false;\n\t\t}\n\t};\n\n\tkeysShim = function keys(object) {\n\t\tvar isObject = object !== null && typeof object === 'object';\n\t\tvar isFunction = toStr.call(object) === '[object Function]';\n\t\tvar isArguments = isArgs(object);\n\t\tvar isString = isObject && toStr.call(object) === '[object String]';\n\t\tvar theKeys = [];\n\n\t\tif (!isObject && !isFunction && !isArguments) {\n\t\t\tthrow new TypeError('Object.keys called on a non-object');\n\t\t}\n\n\t\tvar skipProto = hasProtoEnumBug && isFunction;\n\t\tif (isString && object.length > 0 && !has.call(object, 0)) {\n\t\t\tfor (var i = 0; i < object.length; ++i) {\n\t\t\t\ttheKeys.push(String(i));\n\t\t\t}\n\t\t}\n\n\t\tif (isArguments && object.length > 0) {\n\t\t\tfor (var j = 0; j < object.length; ++j) {\n\t\t\t\ttheKeys.push(String(j));\n\t\t\t}\n\t\t} else {\n\t\t\tfor (var name in object) {\n\t\t\t\tif (!(skipProto && name === 'prototype') && has.call(object, name)) {\n\t\t\t\t\ttheKeys.push(String(name));\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tif (hasDontEnumBug) {\n\t\t\tvar skipConstructor = equalsConstructorPrototypeIfNotBuggy(object);\n\n\t\t\tfor (var k = 0; k < dontEnums.length; ++k) {\n\t\t\t\tif (!(skipConstructor && dontEnums[k] === 'constructor') && has.call(object, dontEnums[k])) {\n\t\t\t\t\ttheKeys.push(dontEnums[k]);\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\treturn theKeys;\n\t};\n}\nmodule.exports = keysShim;\n","'use strict';\n\nvar toStr = Object.prototype.toString;\n\nmodule.exports = function isArguments(value) {\n\tvar str = toStr.call(value);\n\tvar isArgs = str === '[object Arguments]';\n\tif (!isArgs) {\n\t\tisArgs = str !== '[object Array]' &&\n\t\t\tvalue !== null &&\n\t\t\ttypeof value === 'object' &&\n\t\t\ttypeof value.length === 'number' &&\n\t\t\tvalue.length >= 0 &&\n\t\t\ttoStr.call(value.callee) === '[object Function]';\n\t}\n\treturn isArgs;\n};\n","module.exports = function pointInPolygonFlat (point, vs, start, end) {\n    var x = point[0], y = point[1];\n    var inside = false;\n    if (start === undefined) start = 0;\n    if (end === undefined) end = vs.length;\n    var len = (end-start)/2;\n    for (var i = 0, j = len - 1; i < len; j = i++) {\n        var xi = vs[start+i*2+0], yi = vs[start+i*2+1];\n        var xj = vs[start+j*2+0], yj = vs[start+j*2+1];\n        var intersect = ((yi > y) !== (yj > y))\n            && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);\n        if (intersect) inside = !inside;\n    }\n    return inside;\n};\n","// ray-casting algorithm based on\n// https://wrf.ecse.rpi.edu/Research/Short_Notes/pnpoly.html\n\nmodule.exports = function pointInPolygonNested (point, vs, start, end) {\n    var x = point[0], y = point[1];\n    var inside = false;\n    if (start === undefined) start = 0;\n    if (end === undefined) end = vs.length;\n    var len = end - start;\n    for (var i = 0, j = len - 1; i < len; j = i++) {\n        var xi = vs[i+start][0], yi = vs[i+start][1];\n        var xj = vs[j+start][0], yj = vs[j+start][1];\n        var intersect = ((yi > y) !== (yj > y))\n            && (x < (xj - xi) * (y - yi) / (yj - yi) + xi);\n        if (intersect) inside = !inside;\n    }\n    return inside;\n};\n","(function (global, factory) {\n\ttypeof exports === 'object' && typeof module !== 'undefined' ? module.exports = factory() :\n\ttypeof define === 'function' && define.amd ? define(factory) :\n\t(global.quickselect = factory());\n}(this, (function () { 'use strict';\n\nfunction quickselect(arr, k, left, right, compare) {\n    quickselectStep(arr, k, left || 0, right || (arr.length - 1), compare || defaultCompare);\n}\n\nfunction quickselectStep(arr, k, left, right, compare) {\n\n    while (right > left) {\n        if (right - left > 600) {\n            var n = right - left + 1;\n            var m = k - left + 1;\n            var z = Math.log(n);\n            var s = 0.5 * Math.exp(2 * z / 3);\n            var sd = 0.5 * Math.sqrt(z * s * (n - s) / n) * (m - n / 2 < 0 ? -1 : 1);\n            var newLeft = Math.max(left, Math.floor(k - m * s / n + sd));\n            var newRight = Math.min(right, Math.floor(k + (n - m) * s / n + sd));\n            quickselectStep(arr, k, newLeft, newRight, compare);\n        }\n\n        var t = arr[k];\n        var i = left;\n        var j = right;\n\n        swap(arr, left, k);\n        if (compare(arr[right], t) > 0) swap(arr, left, right);\n\n        while (i < j) {\n            swap(arr, i, j);\n            i++;\n            j--;\n            while (compare(arr[i], t) < 0) i++;\n            while (compare(arr[j], t) > 0) j--;\n        }\n\n        if (compare(arr[left], t) === 0) swap(arr, left, j);\n        else {\n            j++;\n            swap(arr, j, right);\n        }\n\n        if (j <= k) left = j + 1;\n        if (k <= j) right = j - 1;\n    }\n}\n\nfunction swap(arr, i, j) {\n    var tmp = arr[i];\n    arr[i] = arr[j];\n    arr[j] = tmp;\n}\n\nfunction defaultCompare(a, b) {\n    return a < b ? -1 : a > b ? 1 : 0;\n}\n\nreturn quickselect;\n\n})));\n","'use strict';\n\nvar functionsHaveConfigurableNames = require('functions-have-names').functionsHaveConfigurableNames();\n\nvar $Object = Object;\nvar $TypeError = TypeError;\n\nmodule.exports = function flags() {\n\tif (this != null && this !== $Object(this)) {\n\t\tthrow new $TypeError('RegExp.prototype.flags getter called on non-object');\n\t}\n\tvar result = '';\n\tif (this.hasIndices) {\n\t\tresult += 'd';\n\t}\n\tif (this.global) {\n\t\tresult += 'g';\n\t}\n\tif (this.ignoreCase) {\n\t\tresult += 'i';\n\t}\n\tif (this.multiline) {\n\t\tresult += 'm';\n\t}\n\tif (this.dotAll) {\n\t\tresult += 's';\n\t}\n\tif (this.unicode) {\n\t\tresult += 'u';\n\t}\n\tif (this.unicodeSets) {\n\t\tresult += 'v';\n\t}\n\tif (this.sticky) {\n\t\tresult += 'y';\n\t}\n\treturn result;\n};\n\nif (functionsHaveConfigurableNames && Object.defineProperty) {\n\tObject.defineProperty(module.exports, 'name', { value: 'get flags' });\n}\n","'use strict';\n\nvar implementation = require('./implementation');\n\nvar supportsDescriptors = require('define-properties').supportsDescriptors;\nvar $gOPD = Object.getOwnPropertyDescriptor;\n\nmodule.exports = function getPolyfill() {\n\tif (supportsDescriptors && (/a/mig).flags === 'gim') {\n\t\tvar descriptor = $gOPD(RegExp.prototype, 'flags');\n\t\tif (\n\t\t\tdescriptor\n\t\t\t&& typeof descriptor.get === 'function'\n\t\t\t&& typeof RegExp.prototype.dotAll === 'boolean'\n\t\t\t&& typeof RegExp.prototype.hasIndices === 'boolean'\n\t\t) {\n\t\t\t/* eslint getter-return: 0 */\n\t\t\tvar calls = '';\n\t\t\tvar o = {};\n\t\t\tObject.defineProperty(o, 'hasIndices', {\n\t\t\t\tget: function () {\n\t\t\t\t\tcalls += 'd';\n\t\t\t\t}\n\t\t\t});\n\t\t\tObject.defineProperty(o, 'sticky', {\n\t\t\t\tget: function () {\n\t\t\t\t\tcalls += 'y';\n\t\t\t\t}\n\t\t\t});\n\t\t\tif (calls === 'dy') {\n\t\t\t\treturn descriptor.get;\n\t\t\t}\n\t\t}\n\t}\n\treturn implementation;\n};\n","'use strict';\n\nvar supportsDescriptors = require('define-properties').supportsDescriptors;\nvar getPolyfill = require('./polyfill');\nvar gOPD = Object.getOwnPropertyDescriptor;\nvar defineProperty = Object.defineProperty;\nvar TypeErr = TypeError;\nvar getProto = Object.getPrototypeOf;\nvar regex = /a/;\n\nmodule.exports = function shimFlags() {\n\tif (!supportsDescriptors || !getProto) {\n\t\tthrow new TypeErr('RegExp.prototype.flags requires a true ES5 environment that supports property descriptors');\n\t}\n\tvar polyfill = getPolyfill();\n\tvar proto = getProto(regex);\n\tvar descriptor = gOPD(proto, 'flags');\n\tif (!descriptor || descriptor.get !== polyfill) {\n\t\tdefineProperty(proto, 'flags', {\n\t\t\tconfigurable: true,\n\t\t\tenumerable: false,\n\t\t\tget: polyfill\n\t\t});\n\t}\n\treturn polyfill;\n};\n","!function(t,e){\"object\"==typeof exports&&\"undefined\"!=typeof module?e(exports):\"function\"==typeof define&&define.amd?define([\"exports\"],e):e((t=t||self).predicates={})}(this,function(t){\"use strict\";const e=134217729,n=33306690738754706e-32;function r(t,e,n,r,o){let f,i,u,c,s=e[0],a=r[0],d=0,l=0;a>s==a>-s?(f=s,s=e[++d]):(f=a,a=r[++l]);let p=0;if(d<t&&l<n)for(a>s==a>-s?(u=f-((i=s+f)-s),s=e[++d]):(u=f-((i=a+f)-a),a=r[++l]),f=i,0!==u&&(o[p++]=u);d<t&&l<n;)a>s==a>-s?(u=f-((i=f+s)-(c=i-f))+(s-c),s=e[++d]):(u=f-((i=f+a)-(c=i-f))+(a-c),a=r[++l]),f=i,0!==u&&(o[p++]=u);for(;d<t;)u=f-((i=f+s)-(c=i-f))+(s-c),s=e[++d],f=i,0!==u&&(o[p++]=u);for(;l<n;)u=f-((i=f+a)-(c=i-f))+(a-c),a=r[++l],f=i,0!==u&&(o[p++]=u);return 0===f&&0!==p||(o[p++]=f),p}function o(t){return new Float64Array(t)}const f=33306690738754716e-32,i=22204460492503146e-32,u=11093356479670487e-47,c=o(4),s=o(8),a=o(12),d=o(16),l=o(4);t.orient2d=function(t,o,p,b,y,h){const M=(o-h)*(p-y),x=(t-y)*(b-h),j=M-x;if(0===M||0===x||M>0!=x>0)return j;const m=Math.abs(M+x);return Math.abs(j)>=f*m?j:-function(t,o,f,p,b,y,h){let M,x,j,m,_,v,w,A,F,O,P,g,k,q,z,B,C,D;const E=t-b,G=f-b,H=o-y,I=p-y;_=(z=(A=E-(w=(v=e*E)-(v-E)))*(O=I-(F=(v=e*I)-(v-I)))-((q=E*I)-w*F-A*F-w*O))-(P=z-(C=(A=H-(w=(v=e*H)-(v-H)))*(O=G-(F=(v=e*G)-(v-G)))-((B=H*G)-w*F-A*F-w*O))),c[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),c[1]=k-(P+_)+(_-B),_=(D=g+P)-g,c[2]=g-(D-_)+(P-_),c[3]=D;let J=function(t,e){let n=e[0];for(let r=1;r<t;r++)n+=e[r];return n}(4,c),K=i*h;if(J>=K||-J>=K)return J;if(M=t-(E+(_=t-E))+(_-b),j=f-(G+(_=f-G))+(_-b),x=o-(H+(_=o-H))+(_-y),m=p-(I+(_=p-I))+(_-y),0===M&&0===x&&0===j&&0===m)return J;if(K=u*h+n*Math.abs(J),(J+=E*m+I*M-(H*j+G*x))>=K||-J>=K)return J;_=(z=(A=M-(w=(v=e*M)-(v-M)))*(O=I-(F=(v=e*I)-(v-I)))-((q=M*I)-w*F-A*F-w*O))-(P=z-(C=(A=x-(w=(v=e*x)-(v-x)))*(O=G-(F=(v=e*G)-(v-G)))-((B=x*G)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const L=r(4,c,4,l,s);_=(z=(A=E-(w=(v=e*E)-(v-E)))*(O=m-(F=(v=e*m)-(v-m)))-((q=E*m)-w*F-A*F-w*O))-(P=z-(C=(A=H-(w=(v=e*H)-(v-H)))*(O=j-(F=(v=e*j)-(v-j)))-((B=H*j)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const N=r(L,s,4,l,a);_=(z=(A=M-(w=(v=e*M)-(v-M)))*(O=m-(F=(v=e*m)-(v-m)))-((q=M*m)-w*F-A*F-w*O))-(P=z-(C=(A=x-(w=(v=e*x)-(v-x)))*(O=j-(F=(v=e*j)-(v-j)))-((B=x*j)-w*F-A*F-w*O))),l[0]=z-(P+_)+(_-C),_=(k=q-((g=q+P)-(_=g-q))+(P-_))-(P=k-B),l[1]=k-(P+_)+(_-B),_=(D=g+P)-g,l[2]=g-(D-_)+(P-_),l[3]=D;const Q=r(N,a,4,l,d);return d[Q-1]}(t,o,p,b,y,h,m)},t.orient2dfast=function(t,e,n,r,o,f){return(e-f)*(n-o)-(t-o)*(r-f)},Object.defineProperty(t,\"__esModule\",{value:!0})});\n","module.exports = {\n\t/**\n\t * Euclidean distance\n\t */\n\teudist(v1,v2,sqrt) {\n\t\tvar len = v1.length;\n\t\tvar sum = 0;\n\n\t\tfor(let i=0;i<len;i++) {\n\t\t\tvar d = (v1[i]||0) - (v2[i]||0);\n\t\t\tsum += d*d;\n\t\t}\n\t\t// Square root not really needed\n\t\treturn sqrt? Math.sqrt(sum) : sum;\n\t},\n\n\tmandist(v1,v2,sqrt) {\n\t\tvar len = v1.length;\n\t\tvar sum = 0;\n\n\t\tfor(let i=0;i<len;i++) {\n\t\t\tsum += Math.abs((v1[i]||0) - (v2[i]||0));\n\t\t}\n\n\t\t// Square root not really needed\n\t\treturn sqrt? Math.sqrt(sum) : sum;\n\t},\n\n\t/**\n\t * Unidimensional distance\n\t */\n\tdist(v1,v2,sqrt) {\n\t\tvar d = Math.abs(v1-v2);\n\t\treturn sqrt? d : d*d;\n\t}\n\n}\n","const\n\tDistance = require(\"./distance.js\"),\n\teudist = Distance.eudist,\n\tdist = Distance.dist;\n\nmodule.exports = {\n\tkmrand(data,k) {\n\t\tvar map = {}, ks = [], t = k<<2;\n\t\tvar len = data.length;\n\t\tvar multi = data[0].length>0;\n\n\t\twhile(ks.length<k && (t--)>0) {\n\t\t\tlet d = data[Math.floor(Math.random()*len)];\n\t\t\tlet key = multi? d.join(\"_\") : `${d}`;\n\t\t\tif(!map[key]) {\n\t\t\t\tmap[key] = true;\n\t\t\t\tks.push(d);\n\t\t\t}\n\t\t}\n\n\t\tif(ks.length<k) throw new Error(\"Error initializating clusters\");\n\t\telse return ks;\n\t},\n\n\t/**\n\t * K-means++ initial centroid selection\n\t */\n\tkmpp(data,k) {\n\t\tvar distance = data[0].length? eudist : dist;\n\t\tvar ks = [], len = data.length;\n\t\tvar multi = data[0].length>0;\n\t\tvar map = {};\n\n\t\t// First random centroid\n\t\tvar c = data[Math.floor(Math.random()*len)];\n\t\tvar key = multi? c.join(\"_\") : `${c}`;\n\t\tks.push(c);\n\t\tmap[key] = true;\n\n\t\t// Retrieve next centroids\n\t\twhile(ks.length<k) {\n\t\t\t// Min Distances between current centroids and data points\n\t\t\tlet dists = [], lk = ks.length;\n\t\t\tlet dsum = 0, prs = [];\n\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tlet min = Infinity;\n\t\t\t\tfor(let j=0;j<lk;j++) {\n\t\t\t\t\tlet dist = distance(data[i],ks[j]);\n\t\t\t\t\tif(dist<=min) min = dist;\n\t\t\t\t}\n\t\t\t\tdists[i] = min;\n\t\t\t}\n\n\t\t\t// Sum all min distances\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tdsum += dists[i]\n\t\t\t}\n\n\t\t\t// Probabilities and cummulative prob (cumsum)\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tprs[i] = {i:i, v:data[i],\tpr:dists[i]/dsum, cs:0}\n\t\t\t}\n\n\t\t\t// Sort Probabilities\n\t\t\tprs.sort((a,b)=>a.pr-b.pr);\n\n\t\t\t// Cummulative Probabilities\n\t\t\tprs[0].cs = prs[0].pr;\n\t\t\tfor(let i=1;i<len;i++) {\n\t\t\t\tprs[i].cs = prs[i-1].cs + prs[i].pr;\n\t\t\t}\n\n\t\t\t// Randomize\n\t\t\tlet rnd = Math.random();\n\n\t\t\t// Gets only the items whose cumsum >= rnd\n\t\t\tlet idx = 0;\n\t\t\twhile(idx<len-1 && prs[idx++].cs<rnd);\n\t\t\tks.push(prs[idx-1].v);\n\t\t\t/*\n\t\t\tlet done = false;\n\t\t\twhile(!done) {\n\t\t\t\t// this is our new centroid\n\t\t\t\tc = prs[idx-1].v\n\t\t\t\tkey = multi? c.join(\"_\") : `${c}`;\n\t\t\t\tif(!map[key]) {\n\t\t\t\t\tmap[key] = true;\n\t\t\t\t\tks.push(c);\n\t\t\t\t\tdone = true;\n\t\t\t\t}\n\t\t\t\telse {\n\t\t\t\t\tidx++;\n\t\t\t\t}\n\t\t\t}\n\t\t\t*/\n\t\t}\n\n\t\treturn ks;\n\t}\n\n}\n","/*jshint esversion: 6 */\n\nconst\n\tDistance = require(\"./distance.js\"),\n\tClusterInit = require(\"./kinit.js\"),\n\teudist = Distance.eudist,\n\tmandist = Distance.mandist,\n\tdist = Distance.dist,\n\tkmrand = ClusterInit.kmrand,\n\tkmpp = ClusterInit.kmpp;\n\nconst MAX = 10000;\n\n/**\n * Inits an array with values\n */\nfunction init(len,val,v) {\n\tv = v || [];\n\tfor(let i=0;i<len;i++) v[i] = val;\n\treturn v;\n}\n\nfunction skmeans(data,k,initial,maxit) {\n\tvar ks = [], old = [], idxs = [], dist = [];\n\tvar conv = false, it = maxit || MAX;\n\tvar len = data.length, vlen = data[0].length, multi = vlen>0;\n\tvar count = [];\n\n\tif(!initial) {\n\t\tlet idxs = {};\n\t\twhile(ks.length<k) {\n\t\t\tlet idx = Math.floor(Math.random()*len);\n\t\t\tif(!idxs[idx]) {\n\t\t\t\tidxs[idx] = true;\n\t\t\t\tks.push(data[idx]);\n\t\t\t}\n\t\t}\n\t}\n\telse if(initial==\"kmrand\") {\n\t\tks = kmrand(data,k);\n\t}\n\telse if(initial==\"kmpp\") {\n\t\tks = kmpp(data,k);\n\t}\n\telse {\n\t\tks = initial;\n\t}\n\n\tdo {\n\t\t// Reset k count\n\t\tinit(k,0,count);\n\n\t\t// For each value in data, find the nearest centroid\n\t\tfor(let i=0;i<len;i++) {\n\t\t\tlet min = Infinity, idx = 0;\n\t\t\tfor(let j=0;j<k;j++) {\n\t\t\t\t// Multidimensional or unidimensional\n\t\t\t\tvar dist = multi? eudist(data[i],ks[j]) : Math.abs(data[i]-ks[j]);\n\t\t\t\tif(dist<=min) {\n\t\t\t\t\tmin = dist;\n\t\t\t\t\tidx = j;\n\t\t\t\t}\n\t\t\t}\n\t\t\tidxs[i] = idx;\t// Index of the selected centroid for that value\n\t\t\tcount[idx]++;\t\t// Number of values for this centroid\n\t\t}\n\n\t\t// Recalculate centroids\n\t\tvar sum = [], old = [], dif = 0;\n\t\tfor(let j=0;j<k;j++) {\n\t\t\t// Multidimensional or unidimensional\n\t\t\tsum[j] = multi? init(vlen,0,sum[j]) : 0;\n\t\t\told[j] = ks[j];\n\t\t}\n\n\t\t// If multidimensional\n\t\tif(multi) {\n\t\t\tfor(let j=0;j<k;j++) ks[j] = [];\n\n\t\t\t// Sum values and count for each centroid\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tlet\tidx = idxs[i],\t\t// Centroid for that item\n\t\t\t\t\t\tvsum = sum[idx],\t// Sum values for this centroid\n\t\t\t\t\t\tvect = data[i];\t\t// Current vector\n\n\t\t\t\t// Accumulate value on the centroid for current vector\n\t\t\t\tfor(let h=0;h<vlen;h++) {\n\t\t\t\t\tvsum[h] += vect[h];\n\t\t\t\t}\n\t\t\t}\n\t\t\t// Calculate the average for each centroid\n\t\t\tconv = true;\n\t\t\tfor(let j=0;j<k;j++) {\n\t\t\t\tlet ksj = ks[j],\t\t// Current centroid\n\t\t\t\t\t\tsumj = sum[j],\t// Accumulated centroid values\n\t\t\t\t\t\toldj = old[j], \t// Old centroid value\n\t\t\t\t\t\tcj = count[j];\t// Number of elements for this centroid\n\n\t\t\t\t// New average\n\t\t\t\tfor(let h=0;h<vlen;h++) {\n\t\t\t\t\tksj[h] = (sumj[h])/(cj) || 0;\t// New centroid\n\t\t\t\t}\n\n\t\t\t\t// Find if centroids have moved\n\t\t\t\tif(conv) {\n\t\t\t\t\tfor(let h=0;h<vlen;h++) {\n\t\t\t\t\t\tif(oldj[h]!=ksj[h]) {\n\t\t\t\t\t\t\tconv = false;\n\t\t\t\t\t\t\tbreak;\n\t\t\t\t\t\t}\n\t\t\t\t\t}\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\t\t// If unidimensional\n\t\telse {\n\t\t\t// Sum values and count for each centroid\n\t\t\tfor(let i=0;i<len;i++) {\n\t\t\t\tlet idx = idxs[i];\n\t\t\t\tsum[idx] += data[i];\n\t\t\t}\n\t\t\t// Calculate the average for each centroid\n\t\t\tfor(let j=0;j<k;j++) {\n\t\t\t\tks[j] = sum[j]/count[j] || 0;\t// New centroid\n\t\t\t}\n\t\t\t// Find if centroids have moved\n\t\t\tconv = true;\n\t\t\tfor(let j=0;j<k;j++) {\n\t\t\t\tif(old[j]!=ks[j]) {\n\t\t\t\t\tconv = false;\n\t\t\t\t\tbreak;\n\t\t\t\t}\n\t\t\t}\n\t\t}\n\n\t\tconv = conv || (--it<=0);\n\t}while(!conv);\n\n\treturn {\n\t\tit : MAX-it,\n\t\tk : k,\n\t\tidxs : idxs,\n\t\tcentroids : ks\n\t};\n}\n\nmodule.exports = skmeans;\n","export var hasOwnProperty = Object.prototype.hasOwnProperty;\n","// TODO if quantized, use simpler Int32 hashing?\n\nvar buffer = new ArrayBuffer(16),\n    floats = new Float64Array(buffer),\n    uints = new Uint32Array(buffer);\n\nexport default function(point) {\n  floats[0] = point[0];\n  floats[1] = point[1];\n  var hash = uints[0] ^ uints[1];\n  hash = hash << 5 ^ hash >> 7 ^ uints[2] ^ uints[3];\n  return hash & 0x7fffffff;\n}\n","/**\n * BezierSpline\n * https://github.com/leszekr/bezier-spline-js\n *\n * @private\n * @copyright\n * Copyright (c) 2013 Leszek Rybicki\n *\n * Permission is hereby granted, free of charge, to any person obtaining a copy\n * of this software and associated documentation files (the \"Software\"), to deal\n * in the Software without restriction, including without limitation the rights\n * to use, copy, modify, merge, publish, distribute, sublicense, and/or sell\n * copies of the Software, and to permit persons to whom the Software is\n * furnished to do so, subject to the following conditions:\n *\n * The above copyright notice and this permission notice shall be included in all\n * copies or substantial portions of the Software.\n *\n * THE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\n * IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\n * FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\n * AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\n * LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\n * OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE\n * SOFTWARE.\n */\nvar Spline = /** @class */ (function () {\n    function Spline(options) {\n        this.points = options.points || [];\n        this.duration = options.duration || 10000;\n        this.sharpness = options.sharpness || 0.85;\n        this.centers = [];\n        this.controls = [];\n        this.stepLength = options.stepLength || 60;\n        this.length = this.points.length;\n        this.delay = 0;\n        // this is to ensure compatibility with the 2d version\n        for (var i = 0; i < this.length; i++) {\n            this.points[i].z = this.points[i].z || 0;\n        }\n        for (var i = 0; i < this.length - 1; i++) {\n            var p1 = this.points[i];\n            var p2 = this.points[i + 1];\n            this.centers.push({\n                x: (p1.x + p2.x) / 2,\n                y: (p1.y + p2.y) / 2,\n                z: (p1.z + p2.z) / 2,\n            });\n        }\n        this.controls.push([this.points[0], this.points[0]]);\n        for (var i = 0; i < this.centers.length - 1; i++) {\n            var dx = this.points[i + 1].x - (this.centers[i].x + this.centers[i + 1].x) / 2;\n            var dy = this.points[i + 1].y - (this.centers[i].y + this.centers[i + 1].y) / 2;\n            var dz = this.points[i + 1].z - (this.centers[i].y + this.centers[i + 1].z) / 2;\n            this.controls.push([\n                {\n                    x: (1.0 - this.sharpness) * this.points[i + 1].x +\n                        this.sharpness * (this.centers[i].x + dx),\n                    y: (1.0 - this.sharpness) * this.points[i + 1].y +\n                        this.sharpness * (this.centers[i].y + dy),\n                    z: (1.0 - this.sharpness) * this.points[i + 1].z +\n                        this.sharpness * (this.centers[i].z + dz),\n                },\n                {\n                    x: (1.0 - this.sharpness) * this.points[i + 1].x +\n                        this.sharpness * (this.centers[i + 1].x + dx),\n                    y: (1.0 - this.sharpness) * this.points[i + 1].y +\n                        this.sharpness * (this.centers[i + 1].y + dy),\n                    z: (1.0 - this.sharpness) * this.points[i + 1].z +\n                        this.sharpness * (this.centers[i + 1].z + dz),\n                },\n            ]);\n        }\n        this.controls.push([\n            this.points[this.length - 1],\n            this.points[this.length - 1],\n        ]);\n        this.steps = this.cacheSteps(this.stepLength);\n        return this;\n    }\n    /**\n     * Caches an array of equidistant (more or less) points on the curve.\n     */\n    Spline.prototype.cacheSteps = function (mindist) {\n        var steps = [];\n        var laststep = this.pos(0);\n        steps.push(0);\n        for (var t = 0; t < this.duration; t += 10) {\n            var step = this.pos(t);\n            var dist = Math.sqrt((step.x - laststep.x) * (step.x - laststep.x) +\n                (step.y - laststep.y) * (step.y - laststep.y) +\n                (step.z - laststep.z) * (step.z - laststep.z));\n            if (dist > mindist) {\n                steps.push(t);\n                laststep = step;\n            }\n        }\n        return steps;\n    };\n    /**\n     * returns angle and speed in the given point in the curve\n     */\n    Spline.prototype.vector = function (t) {\n        var p1 = this.pos(t + 10);\n        var p2 = this.pos(t - 10);\n        return {\n            angle: (180 * Math.atan2(p1.y - p2.y, p1.x - p2.x)) / 3.14,\n            speed: Math.sqrt((p2.x - p1.x) * (p2.x - p1.x) +\n                (p2.y - p1.y) * (p2.y - p1.y) +\n                (p2.z - p1.z) * (p2.z - p1.z)),\n        };\n    };\n    /**\n     * Gets the position of the point, given time.\n     *\n     * WARNING: The speed is not constant. The time it takes between control points is constant.\n     *\n     * For constant speed, use Spline.steps[i];\n     */\n    Spline.prototype.pos = function (time) {\n        var t = time - this.delay;\n        if (t < 0) {\n            t = 0;\n        }\n        if (t > this.duration) {\n            t = this.duration - 1;\n        }\n        // t = t-this.delay;\n        var t2 = t / this.duration;\n        if (t2 >= 1) {\n            return this.points[this.length - 1];\n        }\n        var n = Math.floor((this.points.length - 1) * t2);\n        var t1 = (this.length - 1) * t2 - n;\n        return bezier(t1, this.points[n], this.controls[n][1], this.controls[n + 1][0], this.points[n + 1]);\n    };\n    return Spline;\n}());\nexport default Spline;\nfunction bezier(t, p1, c1, c2, p2) {\n    var b = B(t);\n    var pos = {\n        x: p2.x * b[0] + c2.x * b[1] + c1.x * b[2] + p1.x * b[3],\n        y: p2.y * b[0] + c2.y * b[1] + c1.y * b[2] + p1.y * b[3],\n        z: p2.z * b[0] + c2.z * b[1] + c1.z * b[2] + p1.z * b[3],\n    };\n    return pos;\n}\nfunction B(t) {\n    var t2 = t * t;\n    var t3 = t2 * t;\n    return [\n        t3,\n        3 * t2 * (1 - t),\n        3 * t * (1 - t) * (1 - t),\n        (1 - t) * (1 - t) * (1 - t),\n    ];\n}\n","import { orientationIndex, envelopeIsEqual, envelopeContains, coordinatesEqual, } from \"./util.js\";\nimport { multiPoint, polygon, point, } from \"@turf/helpers\";\nimport envelope from \"@turf/envelope\";\nimport booleanPointInPolygon from \"@turf/boolean-point-in-polygon\";\n/**\n * Ring of edges which form a polygon.\n *\n * The ring may be either an outer shell or a hole.\n *\n * This class is inspired in GEOS's geos::operation::polygonize::EdgeRing\n */\nvar EdgeRing = /** @class */ (function () {\n    function EdgeRing() {\n        this.edges = [];\n        this.polygon = undefined; //< Caches Polygon representation\n        this.envelope = undefined; //< Caches Envelope representation\n    }\n    /**\n     * Add an edge to the ring, inserting it in the last position.\n     *\n     * @memberof EdgeRing\n     * @param {Edge} edge - Edge to be inserted\n     */\n    EdgeRing.prototype.push = function (edge) {\n        this.edges.push(edge);\n        this.polygon = this.envelope = undefined;\n    };\n    /**\n     * Get Edge.\n     *\n     * @memberof EdgeRing\n     * @param {number} i - Index\n     * @returns {Edge} - Edge in the i position\n     */\n    EdgeRing.prototype.get = function (i) {\n        return this.edges[i];\n    };\n    Object.defineProperty(EdgeRing.prototype, \"length\", {\n        /**\n         * Getter of length property.\n         *\n         * @memberof EdgeRing\n         * @returns {number} - Length of the edge ring.\n         */\n        get: function () {\n            return this.edges.length;\n        },\n        enumerable: true,\n        configurable: true\n    });\n    /**\n     * Similar to Array.prototype.forEach for the list of Edges in the EdgeRing.\n     *\n     * @memberof EdgeRing\n     * @param {Function} f - The same function to be passed to Array.prototype.forEach\n     */\n    EdgeRing.prototype.forEach = function (f) {\n        this.edges.forEach(f);\n    };\n    /**\n     * Similar to Array.prototype.map for the list of Edges in the EdgeRing.\n     *\n     * @memberof EdgeRing\n     * @param {Function} f - The same function to be passed to Array.prototype.map\n     * @returns {Array} - The mapped values in the function\n     */\n    EdgeRing.prototype.map = function (f) {\n        return this.edges.map(f);\n    };\n    /**\n     * Similar to Array.prototype.some for the list of Edges in the EdgeRing.\n     *\n     * @memberof EdgeRing\n     * @param {Function} f - The same function to be passed to Array.prototype.some\n     * @returns {boolean} - True if an Edge check the condition\n     */\n    EdgeRing.prototype.some = function (f) {\n        return this.edges.some(f);\n    };\n    /**\n     * Check if the ring is valid in geomtry terms.\n     *\n     * A ring must have either 0 or 4 or more points. The first and the last must be\n     * equal (in 2D)\n     * geos::geom::LinearRing::validateConstruction\n     *\n     * @memberof EdgeRing\n     * @returns {boolean} - Validity of the EdgeRing\n     */\n    EdgeRing.prototype.isValid = function () {\n        // TODO: stub\n        return true;\n    };\n    /**\n     * Tests whether this ring is a hole.\n     *\n     * A ring is a hole if it is oriented counter-clockwise.\n     * Similar implementation of geos::algorithm::CGAlgorithms::isCCW\n     *\n     * @memberof EdgeRing\n     * @returns {boolean} - true: if it is a hole\n     */\n    EdgeRing.prototype.isHole = function () {\n        var _this = this;\n        // XXX: Assuming Ring is valid\n        // Find highest point\n        var hiIndex = this.edges.reduce(function (high, edge, i) {\n            if (edge.from.coordinates[1] > _this.edges[high].from.coordinates[1])\n                high = i;\n            return high;\n        }, 0), iPrev = (hiIndex === 0 ? this.length : hiIndex) - 1, iNext = (hiIndex + 1) % this.length, disc = orientationIndex(this.edges[iPrev].from.coordinates, this.edges[hiIndex].from.coordinates, this.edges[iNext].from.coordinates);\n        if (disc === 0)\n            return (this.edges[iPrev].from.coordinates[0] >\n                this.edges[iNext].from.coordinates[0]);\n        return disc > 0;\n    };\n    /**\n     * Creates a MultiPoint representing the EdgeRing (discarts edges directions).\n     *\n     * @memberof EdgeRing\n     * @returns {Feature<MultiPoint>} - Multipoint representation of the EdgeRing\n     */\n    EdgeRing.prototype.toMultiPoint = function () {\n        return multiPoint(this.edges.map(function (edge) { return edge.from.coordinates; }));\n    };\n    /**\n     * Creates a Polygon representing the EdgeRing.\n     *\n     * @memberof EdgeRing\n     * @returns {Feature<Polygon>} - Polygon representation of the Edge Ring\n     */\n    EdgeRing.prototype.toPolygon = function () {\n        if (this.polygon)\n            return this.polygon;\n        var coordinates = this.edges.map(function (edge) { return edge.from.coordinates; });\n        coordinates.push(this.edges[0].from.coordinates);\n        return (this.polygon = polygon([coordinates]));\n    };\n    /**\n     * Calculates the envelope of the EdgeRing.\n     *\n     * @memberof EdgeRing\n     * @returns {Feature<Polygon>} - envelope\n     */\n    EdgeRing.prototype.getEnvelope = function () {\n        if (this.envelope)\n            return this.envelope;\n        return (this.envelope = envelope(this.toPolygon()));\n    };\n    /**\n     * `geos::operation::polygonize::EdgeRing::findEdgeRingContaining`\n     *\n     * @param {EdgeRing} testEdgeRing - EdgeRing to look in the list\n     * @param {EdgeRing[]} shellList - List of EdgeRing in which to search\n     *\n     * @returns {EdgeRing} - EdgeRing which contains the testEdgeRing\n     */\n    EdgeRing.findEdgeRingContaining = function (testEdgeRing, shellList) {\n        var testEnvelope = testEdgeRing.getEnvelope();\n        var minEnvelope, minShell;\n        shellList.forEach(function (shell) {\n            var tryEnvelope = shell.getEnvelope();\n            if (minShell)\n                minEnvelope = minShell.getEnvelope();\n            // the hole envelope cannot equal the shell envelope\n            if (envelopeIsEqual(tryEnvelope, testEnvelope))\n                return;\n            if (envelopeContains(tryEnvelope, testEnvelope)) {\n                var testEdgeRingCoordinates = testEdgeRing.map(function (edge) { return edge.from.coordinates; });\n                var testPoint = void 0;\n                var _loop_1 = function (pt) {\n                    if (!shell.some(function (edge) { return coordinatesEqual(pt, edge.from.coordinates); })) {\n                        testPoint = pt;\n                    }\n                };\n                for (var _i = 0, testEdgeRingCoordinates_1 = testEdgeRingCoordinates; _i < testEdgeRingCoordinates_1.length; _i++) {\n                    var pt = testEdgeRingCoordinates_1[_i];\n                    _loop_1(pt);\n                }\n                if (testPoint && shell.inside(point(testPoint))) {\n                    if (!minShell || envelopeContains(minEnvelope, tryEnvelope))\n                        minShell = shell;\n                }\n            }\n        });\n        return minShell;\n    };\n    /**\n     * Checks if the point is inside the edgeRing\n     *\n     * @param {Feature<Point>} pt - Point to check if it is inside the edgeRing\n     * @returns {boolean} - True if it is inside, False otherwise\n     */\n    EdgeRing.prototype.inside = function (pt) {\n        return booleanPointInPolygon(pt, this.toPolygon());\n    };\n    return EdgeRing;\n}());\nexport default EdgeRing;\n","import { orientationIndex } from \"./util.js\";\n/**\n * Node\n */\nvar Node = /** @class */ (function () {\n    function Node(coordinates) {\n        this.id = Node.buildId(coordinates);\n        this.coordinates = coordinates; //< {Number[]}\n        this.innerEdges = []; //< {Edge[]}\n        // We wil store to (out) edges in an CCW order as geos::planargraph::DirectedEdgeStar does\n        this.outerEdges = []; //< {Edge[]}\n        this.outerEdgesSorted = false; //< {Boolean} flag that stores if the outer Edges had been sorted\n    }\n    Node.buildId = function (coordinates) {\n        return coordinates.join(\",\");\n    };\n    Node.prototype.removeInnerEdge = function (edge) {\n        this.innerEdges = this.innerEdges.filter(function (e) { return e.from.id !== edge.from.id; });\n    };\n    Node.prototype.removeOuterEdge = function (edge) {\n        this.outerEdges = this.outerEdges.filter(function (e) { return e.to.id !== edge.to.id; });\n    };\n    /**\n     * Outer edges are stored CCW order.\n     *\n     * @memberof Node\n     * @param {Edge} edge - Edge to add as an outerEdge.\n     */\n    Node.prototype.addOuterEdge = function (edge) {\n        this.outerEdges.push(edge);\n        this.outerEdgesSorted = false;\n    };\n    /**\n     * Sorts outer edges in CCW way.\n     *\n     * @memberof Node\n     * @private\n     */\n    Node.prototype.sortOuterEdges = function () {\n        var _this = this;\n        if (!this.outerEdgesSorted) {\n            //this.outerEdges.sort((a, b) => a.compareTo(b));\n            // Using this comparator in order to be deterministic\n            this.outerEdges.sort(function (a, b) {\n                var aNode = a.to, bNode = b.to;\n                if (aNode.coordinates[0] - _this.coordinates[0] >= 0 &&\n                    bNode.coordinates[0] - _this.coordinates[0] < 0)\n                    return 1;\n                if (aNode.coordinates[0] - _this.coordinates[0] < 0 &&\n                    bNode.coordinates[0] - _this.coordinates[0] >= 0)\n                    return -1;\n                if (aNode.coordinates[0] - _this.coordinates[0] === 0 &&\n                    bNode.coordinates[0] - _this.coordinates[0] === 0) {\n                    if (aNode.coordinates[1] - _this.coordinates[1] >= 0 ||\n                        bNode.coordinates[1] - _this.coordinates[1] >= 0)\n                        return aNode.coordinates[1] - bNode.coordinates[1];\n                    return bNode.coordinates[1] - aNode.coordinates[1];\n                }\n                var det = orientationIndex(_this.coordinates, aNode.coordinates, bNode.coordinates);\n                if (det < 0)\n                    return 1;\n                if (det > 0)\n                    return -1;\n                var d1 = Math.pow(aNode.coordinates[0] - _this.coordinates[0], 2) +\n                    Math.pow(aNode.coordinates[1] - _this.coordinates[1], 2), d2 = Math.pow(bNode.coordinates[0] - _this.coordinates[0], 2) +\n                    Math.pow(bNode.coordinates[1] - _this.coordinates[1], 2);\n                return d1 - d2;\n            });\n            this.outerEdgesSorted = true;\n        }\n    };\n    /**\n     * Retrieves outer edges.\n     *\n     * They are sorted if they aren't in the CCW order.\n     *\n     * @memberof Node\n     * @returns {Edge[]} - List of outer edges sorted in a CCW order.\n     */\n    Node.prototype.getOuterEdges = function () {\n        this.sortOuterEdges();\n        return this.outerEdges;\n    };\n    Node.prototype.getOuterEdge = function (i) {\n        this.sortOuterEdges();\n        return this.outerEdges[i];\n    };\n    Node.prototype.addInnerEdge = function (edge) {\n        this.innerEdges.push(edge);\n    };\n    return Node;\n}());\nexport default Node;\n","import { lineString } from \"@turf/helpers\";\nimport { orientationIndex } from \"./util.js\";\n/**\n * This class is inspired by GEOS's geos::operation::polygonize::PolygonizeDirectedEdge\n */\nvar Edge = /** @class */ (function () {\n    /**\n     * @param {Node} from - start node of the Edge\n     * @param {Node} to - end node of the edge\n     */\n    function Edge(from, to) {\n        this.from = from; //< start\n        this.to = to; //< End\n        this.next = undefined; //< The edge to be computed after\n        this.label = undefined; //< Used in order to detect Cut Edges (Bridges)\n        this.symetric = undefined; //< The symetric edge of this\n        this.ring = undefined; //< EdgeRing in which the Edge is\n        this.from.addOuterEdge(this);\n        this.to.addInnerEdge(this);\n    }\n    /**\n     * Creates or get the symetric Edge.\n     *\n     * @returns {Edge} - Symetric Edge.\n     */\n    Edge.prototype.getSymetric = function () {\n        if (!this.symetric) {\n            this.symetric = new Edge(this.to, this.from);\n            this.symetric.symetric = this;\n        }\n        return this.symetric;\n    };\n    /**\n     * Removes edge from from and to nodes.\n     */\n    Edge.prototype.deleteEdge = function () {\n        this.from.removeOuterEdge(this);\n        this.to.removeInnerEdge(this);\n    };\n    /**\n     * Compares Edge equallity.\n     *\n     * An edge is equal to another, if the from and to nodes are the same.\n     *\n     * @param {Edge} edge - Another Edge\n     * @returns {boolean} - True if Edges are equal, False otherwise\n     */\n    Edge.prototype.isEqual = function (edge) {\n        return this.from.id === edge.from.id && this.to.id === edge.to.id;\n    };\n    Edge.prototype.toString = function () {\n        return \"Edge { \" + this.from.id + \" -> \" + this.to.id + \" }\";\n    };\n    /**\n     * Returns a LineString representation of the Edge\n     *\n     * @returns {Feature<LineString>} - LineString representation of the Edge\n     */\n    Edge.prototype.toLineString = function () {\n        return lineString([this.from.coordinates, this.to.coordinates]);\n    };\n    /**\n     * Comparator of two edges.\n     *\n     * Implementation of geos::planargraph::DirectedEdge::compareTo.\n     *\n     * @param {Edge} edge - Another edge to compare with this one\n     * @returns {number} -1 if this Edge has a greater angle with the positive x-axis than b,\n     *          0 if the Edges are colinear,\n     *          1 otherwise\n     */\n    Edge.prototype.compareTo = function (edge) {\n        return orientationIndex(edge.from.coordinates, edge.to.coordinates, this.to.coordinates);\n    };\n    return Edge;\n}());\nexport default Edge;\n","import Node from \"./Node.js\";\nimport Edge from \"./Edge.js\";\nimport EdgeRing from \"./EdgeRing.js\";\nimport { flattenEach, coordReduce } from \"@turf/meta\";\nimport { featureOf } from \"@turf/invariant\";\n/**\n * Validates the geoJson.\n *\n * @param {GeoJSON} geoJson - input geoJson.\n * @throws {Error} if geoJson is invalid.\n */\nfunction validateGeoJson(geoJson) {\n    if (!geoJson)\n        throw new Error(\"No geojson passed\");\n    if (geoJson.type !== \"FeatureCollection\" &&\n        geoJson.type !== \"GeometryCollection\" &&\n        geoJson.type !== \"MultiLineString\" &&\n        geoJson.type !== \"LineString\" &&\n        geoJson.type !== \"Feature\")\n        throw new Error(\"Invalid input type '\" + geoJson.type + \"'. Geojson must be FeatureCollection, GeometryCollection, LineString, MultiLineString or Feature\");\n}\n/**\n * Represents a planar graph of edges and nodes that can be used to compute a polygonization.\n *\n * Although, this class is inspired by GEOS's `geos::operation::polygonize::PolygonizeGraph`,\n * it isn't a rewrite. As regards algorithm, this class implements the same logic, but it\n * isn't a javascript transcription of the C++ source.\n *\n * This graph is directed (both directions are created)\n */\nvar Graph = /** @class */ (function () {\n    function Graph() {\n        this.edges = []; //< {Edge[]} dirEdges\n        // The key is the `id` of the Node (ie: coordinates.join(','))\n        this.nodes = {};\n    }\n    /**\n     * Creates a graph from a GeoJSON.\n     *\n     * @param {FeatureCollection<LineString>} geoJson - it must comply with the restrictions detailed in the index\n     * @returns {Graph} - The newly created graph\n     * @throws {Error} if geoJson is invalid.\n     */\n    Graph.fromGeoJson = function (geoJson) {\n        validateGeoJson(geoJson);\n        var graph = new Graph();\n        flattenEach(geoJson, function (feature) {\n            featureOf(feature, \"LineString\", \"Graph::fromGeoJson\");\n            // When a LineString if formed by many segments, split them\n            coordReduce(feature, function (prev, cur) {\n                if (prev) {\n                    var start = graph.getNode(prev), end = graph.getNode(cur);\n                    graph.addEdge(start, end);\n                }\n                return cur;\n            });\n        });\n        return graph;\n    };\n    /**\n     * Creates or get a Node.\n     *\n     * @param {number[]} coordinates - Coordinates of the node\n     * @returns {Node} - The created or stored node\n     */\n    Graph.prototype.getNode = function (coordinates) {\n        var id = Node.buildId(coordinates);\n        var node = this.nodes[id];\n        if (!node)\n            node = this.nodes[id] = new Node(coordinates);\n        return node;\n    };\n    /**\n     * Adds an Edge and its symetricall.\n     *\n     * Edges are added symetrically, i.e.: we also add its symetric\n     *\n     * @param {Node} from - Node which starts the Edge\n     * @param {Node} to - Node which ends the Edge\n     */\n    Graph.prototype.addEdge = function (from, to) {\n        var edge = new Edge(from, to), symetricEdge = edge.getSymetric();\n        this.edges.push(edge);\n        this.edges.push(symetricEdge);\n    };\n    /**\n     * Removes Dangle Nodes (nodes with grade 1).\n     */\n    Graph.prototype.deleteDangles = function () {\n        var _this = this;\n        Object.keys(this.nodes)\n            .map(function (id) { return _this.nodes[id]; })\n            .forEach(function (node) { return _this._removeIfDangle(node); });\n    };\n    /**\n     * Check if node is dangle, if so, remove it.\n     *\n     * It calls itself recursively, removing a dangling node might cause another dangling node\n     *\n     * @param {Node} node - Node to check if it's a dangle\n     */\n    Graph.prototype._removeIfDangle = function (node) {\n        var _this = this;\n        // As edges are directed and symetrical, we count only innerEdges\n        if (node.innerEdges.length <= 1) {\n            var outerNodes = node.getOuterEdges().map(function (e) { return e.to; });\n            this.removeNode(node);\n            outerNodes.forEach(function (n) { return _this._removeIfDangle(n); });\n        }\n    };\n    /**\n     * Delete cut-edges (bridge edges).\n     *\n     * The graph will be traversed, all the edges will be labeled according the ring\n     * in which they are. (The label is a number incremented by 1). Edges with the same\n     * label are cut-edges.\n     */\n    Graph.prototype.deleteCutEdges = function () {\n        var _this = this;\n        this._computeNextCWEdges();\n        this._findLabeledEdgeRings();\n        // Cut-edges (bridges) are edges where both edges have the same label\n        this.edges.forEach(function (edge) {\n            if (edge.label === edge.symetric.label) {\n                _this.removeEdge(edge.symetric);\n                _this.removeEdge(edge);\n            }\n        });\n    };\n    /**\n     * Set the `next` property of each Edge.\n     *\n     * The graph will be transversed in a CW form, so, we set the next of the symetrical edge as the previous one.\n     * OuterEdges are sorted CCW.\n     *\n     * @param {Node} [node] - If no node is passed, the function calls itself for every node in the Graph\n     */\n    Graph.prototype._computeNextCWEdges = function (node) {\n        var _this = this;\n        if (typeof node === \"undefined\") {\n            Object.keys(this.nodes).forEach(function (id) {\n                return _this._computeNextCWEdges(_this.nodes[id]);\n            });\n        }\n        else {\n            node.getOuterEdges().forEach(function (edge, i) {\n                node.getOuterEdge((i === 0 ? node.getOuterEdges().length : i) - 1).symetric.next = edge;\n            });\n        }\n    };\n    /**\n     * Computes the next edge pointers going CCW around the given node, for the given edgering label.\n     *\n     * This algorithm has the effect of converting maximal edgerings into minimal edgerings\n     *\n     * XXX: method literally transcribed from `geos::operation::polygonize::PolygonizeGraph::computeNextCCWEdges`,\n     * could be written in a more javascript way.\n     *\n     * @param {Node} node - Node\n     * @param {number} label - Ring's label\n     */\n    Graph.prototype._computeNextCCWEdges = function (node, label) {\n        var edges = node.getOuterEdges();\n        var firstOutDE, prevInDE;\n        for (var i = edges.length - 1; i >= 0; --i) {\n            var de = edges[i], sym = de.symetric, outDE = void 0, inDE = void 0;\n            if (de.label === label)\n                outDE = de;\n            if (sym.label === label)\n                inDE = sym;\n            if (!outDE || !inDE)\n                // This edge is not in edgering\n                continue;\n            if (inDE)\n                prevInDE = inDE;\n            if (outDE) {\n                if (prevInDE) {\n                    prevInDE.next = outDE;\n                    prevInDE = undefined;\n                }\n                if (!firstOutDE)\n                    firstOutDE = outDE;\n            }\n        }\n        if (prevInDE)\n            prevInDE.next = firstOutDE;\n    };\n    /**\n     * Finds rings and labels edges according to which rings are.\n     *\n     * The label is a number which is increased for each ring.\n     *\n     * @returns {Edge[]} edges that start rings\n     */\n    Graph.prototype._findLabeledEdgeRings = function () {\n        var edgeRingStarts = [];\n        var label = 0;\n        this.edges.forEach(function (edge) {\n            if (edge.label >= 0)\n                return;\n            edgeRingStarts.push(edge);\n            var e = edge;\n            do {\n                e.label = label;\n                e = e.next;\n            } while (!edge.isEqual(e));\n            label++;\n        });\n        return edgeRingStarts;\n    };\n    /**\n     * Computes the EdgeRings formed by the edges in this graph.\n     *\n     * @returns {EdgeRing[]} - A list of all the EdgeRings in the graph.\n     */\n    Graph.prototype.getEdgeRings = function () {\n        var _this = this;\n        this._computeNextCWEdges();\n        // Clear labels\n        this.edges.forEach(function (edge) {\n            edge.label = undefined;\n        });\n        this._findLabeledEdgeRings().forEach(function (edge) {\n            // convertMaximalToMinimalEdgeRings\n            _this._findIntersectionNodes(edge).forEach(function (node) {\n                _this._computeNextCCWEdges(node, edge.label);\n            });\n        });\n        var edgeRingList = [];\n        // find all edgerings\n        this.edges.forEach(function (edge) {\n            if (edge.ring)\n                return;\n            edgeRingList.push(_this._findEdgeRing(edge));\n        });\n        return edgeRingList;\n    };\n    /**\n     * Find all nodes in a Maxima EdgeRing which are self-intersection nodes.\n     *\n     * @param {Node} startEdge - Start Edge of the Ring\n     * @returns {Node[]} - intersection nodes\n     */\n    Graph.prototype._findIntersectionNodes = function (startEdge) {\n        var intersectionNodes = [];\n        var edge = startEdge;\n        var _loop_1 = function () {\n            // getDegree\n            var degree = 0;\n            edge.from.getOuterEdges().forEach(function (e) {\n                if (e.label === startEdge.label)\n                    ++degree;\n            });\n            if (degree > 1)\n                intersectionNodes.push(edge.from);\n            edge = edge.next;\n        };\n        do {\n            _loop_1();\n        } while (!startEdge.isEqual(edge));\n        return intersectionNodes;\n    };\n    /**\n     * Get the edge-ring which starts from the provided Edge.\n     *\n     * @param {Edge} startEdge - starting edge of the edge ring\n     * @returns {EdgeRing} - EdgeRing which start Edge is the provided one.\n     */\n    Graph.prototype._findEdgeRing = function (startEdge) {\n        var edge = startEdge;\n        var edgeRing = new EdgeRing();\n        do {\n            edgeRing.push(edge);\n            edge.ring = edgeRing;\n            edge = edge.next;\n        } while (!startEdge.isEqual(edge));\n        return edgeRing;\n    };\n    /**\n     * Removes a node from the Graph.\n     *\n     * It also removes edges asociated to that node\n     * @param {Node} node - Node to be removed\n     */\n    Graph.prototype.removeNode = function (node) {\n        var _this = this;\n        node.getOuterEdges().forEach(function (edge) { return _this.removeEdge(edge); });\n        node.innerEdges.forEach(function (edge) { return _this.removeEdge(edge); });\n        delete this.nodes[node.id];\n    };\n    /**\n     * Remove edge from the graph and deletes the edge.\n     *\n     * @param {Edge} edge - Edge to be removed\n     */\n    Graph.prototype.removeEdge = function (edge) {\n        this.edges = this.edges.filter(function (e) { return !e.isEqual(edge); });\n        edge.deleteEdge();\n    };\n    return Graph;\n}());\nexport default Graph;\n","import booleanPointInPolygon from \"@turf/boolean-point-in-polygon\";\nimport { point } from \"@turf/helpers\";\n// https://developer.mozilla.org/en-US/docs/Web/JavaScript/Reference/Global_Objects/Math/sign#Polyfill\nfunction mathSign(x) {\n    return ((x > 0) - (x < 0) || +x);\n}\n/**\n * Returns the direction of the point q relative to the vector p1 -> p2.\n *\n * Implementation of geos::algorithm::CGAlgorithm::orientationIndex()\n * (same as geos::algorithm::CGAlgorithm::computeOrientation())\n *\n * @param {number[]} p1 - the origin point of the vector\n * @param {number[]} p2 - the final point of the vector\n * @param {number[]} q - the point to compute the direction to\n *\n * @returns {number} - 1 if q is ccw (left) from p1->p2,\n *    -1 if q is cw (right) from p1->p2,\n *     0 if q is colinear with p1->p2\n */\nexport function orientationIndex(p1, p2, q) {\n    var dx1 = p2[0] - p1[0], dy1 = p2[1] - p1[1], dx2 = q[0] - p2[0], dy2 = q[1] - p2[1];\n    return mathSign(dx1 * dy2 - dx2 * dy1);\n}\n/**\n * Checks if two envelopes are equal.\n *\n * The function assumes that the arguments are envelopes, i.e.: Rectangular polygon\n *\n * @param {Feature<Polygon>} env1 - Envelope\n * @param {Feature<Polygon>} env2 - Envelope\n * @returns {boolean} - True if the envelopes are equal\n */\nexport function envelopeIsEqual(env1, env2) {\n    var envX1 = env1.geometry.coordinates[0].map(function (c) { return c[0]; }), envY1 = env1.geometry.coordinates[0].map(function (c) { return c[1]; }), envX2 = env2.geometry.coordinates[0].map(function (c) { return c[0]; }), envY2 = env2.geometry.coordinates[0].map(function (c) { return c[1]; });\n    return (Math.max.apply(null, envX1) === Math.max.apply(null, envX2) &&\n        Math.max.apply(null, envY1) === Math.max.apply(null, envY2) &&\n        Math.min.apply(null, envX1) === Math.min.apply(null, envX2) &&\n        Math.min.apply(null, envY1) === Math.min.apply(null, envY2));\n}\n/**\n * Check if a envelope is contained in other one.\n *\n * The function assumes that the arguments are envelopes, i.e.: Convex polygon\n * XXX: Envelopes are rectangular, checking if a point is inside a rectangule is something easy,\n * this could be further improved.\n *\n * @param {Feature<Polygon>} self - Envelope\n * @param {Feature<Polygon>} env - Envelope\n * @returns {boolean} - True if env is contained in self\n */\nexport function envelopeContains(self, env) {\n    return env.geometry.coordinates[0].every(function (c) {\n        return booleanPointInPolygon(point(c), self);\n    });\n}\n/**\n * Checks if two coordinates are equal.\n *\n * @param {number[]} coord1 - First coordinate\n * @param {number[]} coord2 - Second coordinate\n * @returns {boolean} - True if coordinates are equal\n */\nexport function coordinatesEqual(coord1, coord2) {\n    return coord1[0] === coord2[0] && coord1[1] === coord2[1];\n}\n"],"names":["earcut","data","holeIndices","dim","minX","minY","maxX","maxY","x","y","invSize","hasHoles","length","outerLen","outerNode","linkedList","triangles","next","prev","i","len","list","queue","steiner","push","getLeftmost","sort","compareX","eliminateHole","eliminateHoles","Math","max","earcutLinked","start","end","clockwise","last","signedArea","insertNode","equals","removeNode","filterPoints","again","p","area","ear","pass","z","zOrder","prevZ","nextZ","q","e","tail","numMerges","pSize","qSize","inSize","sortLinked","indexCurve","stop","isEarHashed","isEar","cureLocalIntersections","splitEarcut","a","b","c","ax","bx","cx","ay","by","cy","x0","y0","x1","y1","pointInTriangle","minZ","maxZ","n","intersects","locallyInside","isValidDiagonal","splitPolygon","hole","bridge","m","hx","hy","qx","Infinity","tan","mx","my","tanMin","abs","sectorContainsSector","findHoleBridge","bridgeReverse","leftmost","px","py","intersectsPolygon","inside","middleInside","r","p1","p2","q1","q2","o1","sign","o2","o3","o4","onSegment","min","num","a2","Node","b2","an","bp","this","sum","j","module","exports","deviation","polygonArea","trianglesArea","flatten","result","vertices","holes","dimensions","holeIndex","d","GetIntrinsic","require","callBind","$indexOf","name","allowMissing","intrinsic","t","h","o","s","l","log","f","exp","u","sqrt","floor","_maxEntries","_minEntries","ceil","clear","indexOf","children","leaf","height","pop","prototype","all","_all","search","toBBox","collides","load","insert","_build","slice","_splitRoot","_insert","remove","splice","_condense","compareMinX","compareMinY","toJSON","fromJSON","apply","pow","_chooseSubtree","_split","_adjustParentBBoxes","_chooseSplitAxis","_chooseSplitIndex","v","M","_allDistMargin","array","Array","map","NaN","compare","ascending","arrays","merged","Adder","reset","constructor","add","temp","valueOf","adder","bv","av","lambda00","phi00","lambda0","cosPhi0","sinPhi0","areaRingSum","areaSum","areaStream","point","noop","lineStart","lineEnd","polygonStart","areaRingStart","areaRingEnd","polygonEnd","areaRing","tau","sphere","areaPointFirst","areaPoint","lambda","phi","radians","cos","quarterPi","sin","dLambda","sdLambda","adLambda","cosPhi","sinPhi","k","atan2","spherical","cartesian","asin","cartesianCross","cartesianNormalizeInPlace","W0","X0","Y0","Z0","z0","centroidStream","centroidPoint","centroidLineStart","centroidLineEnd","centroidRingStart","centroidRingEnd","centroidPointCartesian","centroidLinePointFirst","centroidLinePoint","w","centroidRingPointFirst","centroidRingPoint","cz","clip","stream","clean","phi0","sign0","lambda1","phi1","sign1","pi","delta","epsilon","halfPi","cosPhi1","sinLambda0Lambda1","atan","clipAntimeridianIntersect","from","to","direction","line","lines","rejoin","concat","shift","Intersection","points","other","entry","segments","compareIntersection","startInside","interpolate","subject","forEach","segment","p0","pointEqual","link","current","isSubject","coordinates","object","type","lengthSum","lengthStream","lengthPointFirst","lengthLineEnd","lengthPoint","cosDelta","PI","degrees","acos","x00","y00","lengthRing","circle","radius","polygon","normal","angle","winding","ring","point0","sinPhi1","point1","absDelta","antimeridian","arc","intersection","phiArc","azimuthalRaw","scale","azimuthalInvert","sc","cc","azimuthalEqualAreaRaw","cxcy","invert","azimuthalEquidistantRaw","equirectangularRaw","gnomonicRaw","mercatorRaw","naturalEarth1Raw","phi2","phi4","orthographicRaw","stereographicRaw","transverseMercatorRaw","rotationIdentity","streamGeometry","geometry","streamGeometryType","hasOwnProperty","streamObjectType","Feature","FeatureCollection","features","Sphere","Point","MultiPoint","LineString","streamLine","MultiLineString","Polygon","streamPolygon","MultiPolygon","GeometryCollection","geometries","closed","coordinate","transformer","methods","TransformStream","key","RedBlackTree","_","RedBlackNode","node","U","C","L","R","P","N","RedBlackRotateLeft","tree","parent","RedBlackRotateRight","RedBlackFirst","after","grandpa","uncle","sibling","red","left","right","createEdge","v0","v1","edge","index","edges","setEdgeEnd","cells","halfedges","createBorderEdge","vertex","clipEdge","t0","t1","dx","dy","connectEdge","fm","fb","lx","ly","rx","ry","fx","fy","cellHalfedgeAngle","cell","site","va","vb","cellHalfedgeStart","cellHalfedgeEnd","firstCircle","circlePool","Circle","attachCircle","lArc","rArc","lSite","cSite","rSite","epsilon2","ha","hc","before","circles","detachCircle","beachPool","Beach","createBeach","beach","detachBeach","beaches","removeBeach","previous","disappearing","unshift","iArc","nArcs","addBeach","dxl","dxr","directrix","leftBreakPoint","rightBreakPoint","createCell","newArc","hb","rfocx","rfocy","pby2","lfocx","lfocy","plby2","hl","aby2","lexicographic","Diagram","sites","extent","sortCellHalfedges","clipEdges","iCell","iHalfedge","nHalfedges","startX","startY","endX","endY","nCells","cover","d2","dc","v00","v01","v11","v10","clipCells","polygons","s0","e1","s1","links","filter","source","target","find","i0","that","i1","_found","vx","vy","v2","DBSCAN","dataset","minPts","distanceFunction","distance","_euclideanDistance","clusters","noise","_visited","_assigned","_datasetLength","_init","run","pointId","neighbors","_regionQuery","clusterId","_addToCluster","_expandCluster","Error","pointId2","neighbors2","_mergeArrays","id","KMEANS","assignments","centroids","init","randomCentroid","change","assign","centroidId","mean","maxDim","count","getClusters","centroid","maxId","round","random","closestCentroid","argmin","set","Number","MAX_VALUE","arg","diff","PriorityQueue","OPTICS","_reachability","_processed","_coreDistance","_orderedList","priorityQueue","undefined","_distanceToCore","_updateQueue","getReachabilityPlot","reachabilityPlot","self","dist","newReachableDistance","queueElements","getElements","coreDistCand","elements","priorities","sorting","_queue","_priorities","_sorting","ele","priority","indexToInsert","priority2","_insertAt","func","getElementPriority","getPriorities","getElementsWithPriorities","toStr","Object","toString","call","TypeError","bound","args","arguments","boundLength","boundArgs","Function","join","Empty","Symbol","getOwnPropertySymbols","iterator","obj","sym","symObj","keys","getOwnPropertyNames","syms","propertyIsEnumerable","getOwnPropertyDescriptor","descriptor","value","enumerable","hasSymbols","toStringTag","numberIsNaN","implementation","is","getPolyfill","define","polyfill","keysShim","has","isArgs","isEnumerable","hasDontEnumBug","hasProtoEnumBug","dontEnums","equalsConstructorPrototype","ctor","excludedKeys","$applicationCache","$console","$external","$frame","$frameElement","$frames","$innerHeight","$innerWidth","$onmozfullscreenchange","$onmozfullscreenerror","$outerHeight","$outerWidth","$pageXOffset","$pageYOffset","$parent","$scrollLeft","$scrollTop","$scrollX","$scrollY","$self","$webkitIndexedDB","$webkitStorageInfo","$window","hasAutomationEqualityBug","window","isObject","isFunction","isArguments","isString","theKeys","skipProto","String","skipConstructor","equalsConstructorPrototypeIfNotBuggy","str","callee","vs","xi","yi","xj","yj","quickselect","arr","quickselectStep","defaultCompare","sd","swap","tmp","factory","functionsHaveConfigurableNames","$Object","$TypeError","hasIndices","global","ignoreCase","multiline","dotAll","unicode","unicodeSets","sticky","defineProperty","supportsDescriptors","$gOPD","flags","RegExp","get","calls","gOPD","TypeErr","getProto","getPrototypeOf","regex","proto","configurable","Float64Array","orient2d","A","F","O","g","B","D","E","G","H","I","J","K","Q","orient2dfast","eudist","mandist","Distance","kmrand","ks","multi","kmpp","dists","lk","dsum","prs","_dist","_i","_i2","pr","cs","_i3","rnd","idx","ClusterInit","val","initial","maxit","old","idxs","conv","it","vlen","_idxs","_idx","_j","_j2","vsum","vect","_j3","ksj","sumj","oldj","cj","_h","_h2","_j4","_j5","buffer","ArrayBuffer","Uint32Array","Spline","options","duration","sharpness","centers","controls","stepLength","delay","dz","steps","cacheSteps","mindist","laststep","pos","step","vector","speed","time","t2","c1","c2","t3","bezier","EdgeRing","envelope","some","isValid","isHole","_this","hiIndex","reduce","high","iPrev","iNext","disc","orientationIndex","toMultiPoint","multiPoint","toPolygon","getEnvelope","findEdgeRingContaining","testEdgeRing","shellList","minEnvelope","minShell","testEnvelope","shell","tryEnvelope","envelopeIsEqual","envelopeContains","testEdgeRingCoordinates","testPoint","_loop_1","pt","coordinatesEqual","testEdgeRingCoordinates_1","booleanPointInPolygon","buildId","innerEdges","outerEdges","outerEdgesSorted","removeInnerEdge","removeOuterEdge","addOuterEdge","sortOuterEdges","aNode","bNode","det","getOuterEdges","getOuterEdge","addInnerEdge","Edge","label","symetric","getSymetric","deleteEdge","isEqual","toLineString","lineString","compareTo","Graph","nodes","fromGeoJson","geoJson","validateGeoJson","graph","flattenEach","feature","featureOf","coordReduce","cur","getNode","addEdge","symetricEdge","deleteDangles","_removeIfDangle","outerNodes","deleteCutEdges","_computeNextCWEdges","_findLabeledEdgeRings","removeEdge","_computeNextCCWEdges","firstOutDE","prevInDE","de","outDE","inDE","edgeRingStarts","getEdgeRings","_findIntersectionNodes","edgeRingList","_findEdgeRing","startEdge","intersectionNodes","degree","edgeRing","dx1","dy1","dx2","dy2","env1","env2","envX1","envY1","envX2","envY2","env","every","coord1","coord2"],"sourceRoot":""}