{"version":3,"file":"921-1c9f134a601e6083fed4.js","mappings":"+GAEwBA,EA0BKC,E,mBC5Bd,WAASC,EAAGC,GACzB,OAAOD,EAAIC,GAAK,EAAID,EAAIC,EAAI,EAAID,GAAKC,EAAI,EAAIC,GAC/C,CDCyB,KADDJ,EECO,GFAjBK,SAyBeJ,EAzB6BD,EAA9BA,EA0BnB,SAASM,EAAGC,GACjB,OAAO,EAAUN,EAAEK,GAAIC,EACzB,GG/BF,IAAIC,EAAQC,MAAMC,UCAH,WAASC,EAAQC,GAC9B,IAEIC,EACAC,EAHAC,EAAIJ,EAAON,OACXW,GAAK,EAIT,GAAe,MAAXJ,GACF,OAASI,EAAID,GACX,GAA2B,OAAtBF,EAAQF,EAAOK,KAAeH,GAASA,EAE1C,IADAC,EAAMD,IACGG,EAAID,GACgB,OAAtBF,EAAQF,EAAOK,KAAeH,EAAQC,IACzCA,EAAMD,QAQd,OAASG,EAAID,GACX,GAA+C,OAA1CF,EAAQD,EAAQD,EAAOK,GAAIA,EAAGL,KAAoBE,GAASA,EAE9D,IADAC,EAAMD,IACGG,EAAID,GACoC,OAA1CF,EAAQD,EAAQD,EAAOK,GAAIA,EAAGL,KAAoBE,EAAQC,IAC7DA,EAAMD,GAOhB,OAAOC,CACT,CCjCe,WAASH,EAAQC,GAC9B,IAEIC,EACAI,EAHAF,EAAIJ,EAAON,OACXW,GAAK,EAIT,GAAe,MAAXJ,GACF,OAASI,EAAID,GACX,GAA2B,OAAtBF,EAAQF,EAAOK,KAAeH,GAASA,EAE1C,IADAI,EAAMJ,IACGG,EAAID,GACgB,OAAtBF,EAAQF,EAAOK,KAAeC,EAAMJ,IACvCI,EAAMJ,QAQd,OAASG,EAAID,GACX,GAA+C,OAA1CF,EAAQD,EAAQD,EAAOK,GAAIA,EAAGL,KAAoBE,GAASA,EAE9D,IADAI,EAAMJ,IACGG,EAAID,GACoC,OAA1CF,EAAQD,EAAQD,EAAOK,GAAIA,EAAGL,KAAoBM,EAAMJ,IAC3DI,EAAMJ,GAOhB,OAAOI,CACT,CCjCe,WAASN,EAAQC,GAC9B,IAEIC,EAFAE,EAAIJ,EAAON,OACXW,GAAK,EAELE,EAAM,EAEV,GAAe,MAAXN,EACF,OAASI,EAAID,IACPF,GAASF,EAAOK,MAAIE,GAAOL,QAKjC,OAASG,EAAID,IACPF,GAASD,EAAQD,EAAOK,GAAIA,EAAGL,MAASO,GAAOL,GAIvD,OAAOK,CACT,CCjBA,SAASC,EAAYb,GACnB,OAAOA,EAAEc,OAAOC,KAClB,CAUO,SAASC,EAAQC,EAAMR,GAC5B,OAAOQ,EAAKC,YAAYnB,OAASkB,EAAKF,MAAQN,EAAI,CACpD,CChBe,SAAS,EAASR,GAC/B,OAAO,WACL,OAAOA,CACT,CACF,CCAA,SAASkB,EAAuBvB,EAAGC,GACjC,OAAOuB,EAAiBxB,EAAEyB,OAAQxB,EAAEwB,SAAWzB,EAAE0B,MAAQzB,EAAEyB,KAC7D,CAEA,SAASC,EAAuB3B,EAAGC,GACjC,OAAOuB,EAAiBxB,EAAEkB,OAAQjB,EAAEiB,SAAWlB,EAAE0B,MAAQzB,EAAEyB,KAC7D,CAEA,SAASF,EAAiBxB,EAAGC,GAC3B,OAAOD,EAAE4B,GAAK3B,EAAE2B,EAClB,CAEA,SAASjB,EAAMP,GACb,OAAOA,EAAEO,KACX,CAEA,SAASkB,EAAUzB,GACjB,OAAOA,EAAEsB,KACX,CAEA,SAASI,EAAaC,GACpB,OAAOA,EAAMC,KACf,CAEA,SAASC,EAAaF,GACpB,OAAOA,EAAMG,KACf,CAEA,SAASC,EAAKC,EAAUC,GACtB,MAAMhB,EAAOe,EAASE,IAAID,GAC1B,IAAKhB,EAAM,MAAM,IAAIkB,MAAM,YAAcF,GACzC,OAAOhB,CACT,CAEA,SAASmB,GAAoB,MAACR,IAC5B,IAAK,MAAMX,KAAQW,EAAO,CACxB,IAAIJ,EAAKP,EAAKO,GACVa,EAAKb,EACT,IAAK,MAAMc,KAAQrB,EAAKC,YACtBoB,EAAKd,GAAKA,EAAKc,EAAKC,MAAQ,EAC5Bf,GAAMc,EAAKC,MAEb,IAAK,MAAMD,KAAQrB,EAAKuB,YACtBF,EAAKD,GAAKA,EAAKC,EAAKC,MAAQ,EAC5BF,GAAMC,EAAKC,KAEf,CACF,CNjDmBrC,EAAMuC,MACRvC,EAAMwC,IOHbC,KAAKC,KAAK,IACXD,KAAKC,KAAK,IACVD,KAAKC,KAAK,GCFnB,IAAIC,EAAKF,KAAKG,GACVC,EAAM,EAAIF,EACVG,EAAU,KACVC,EAAaF,EAAMC,EAEvB,SAASE,IACPC,KAAKC,IAAMD,KAAKE,IAChBF,KAAKG,IAAMH,KAAKI,IAAM,KACtBJ,KAAKK,EAAI,EACX,CAEA,SAASC,IACP,OAAO,IAAIP,CACb,CAEAA,EAAK9C,UAAYqD,EAAKrD,UAAY,CAChCsD,YAAaR,EACbS,OAAQ,SAAS1D,EAAG2D,GAClBT,KAAKK,GAAK,KAAOL,KAAKC,IAAMD,KAAKG,KAAOrD,GAAK,KAAOkD,KAAKE,IAAMF,KAAKI,KAAOK,EAC7E,EACAC,UAAW,WACQ,OAAbV,KAAKG,MACPH,KAAKG,IAAMH,KAAKC,IAAKD,KAAKI,IAAMJ,KAAKE,IACrCF,KAAKK,GAAK,IAEd,EACAM,OAAQ,SAAS7D,EAAG2D,GAClBT,KAAKK,GAAK,KAAOL,KAAKG,KAAOrD,GAAK,KAAOkD,KAAKI,KAAOK,EACvD,EACAG,iBAAkB,SAASC,EAAI3B,EAAIpC,EAAG2D,GACpCT,KAAKK,GAAK,MAAQQ,EAAM,MAAQ3B,EAAM,KAAOc,KAAKG,KAAOrD,GAAK,KAAOkD,KAAKI,KAAOK,EACnF,EACAK,cAAe,SAASD,EAAI3B,EAAI6B,EAAIC,EAAIlE,EAAG2D,GACzCT,KAAKK,GAAK,MAAQQ,EAAM,MAAQ3B,EAAM,MAAQ6B,EAAM,MAAQC,EAAM,KAAOhB,KAAKG,KAAOrD,GAAK,KAAOkD,KAAKI,KAAOK,EAC/G,EACAQ,MAAO,SAASJ,EAAI3B,EAAI6B,EAAIC,EAAIE,GAC9BL,GAAMA,EAAI3B,GAAMA,EAAI6B,GAAMA,EAAIC,GAAMA,EAAIE,GAAKA,EAC7C,IAAIC,EAAKnB,KAAKG,IACV9B,EAAK2B,KAAKI,IACVgB,EAAML,EAAKF,EACXQ,EAAML,EAAK9B,EACXoC,EAAMH,EAAKN,EACXU,EAAMlD,EAAKa,EACXsC,EAAQF,EAAMA,EAAMC,EAAMA,EAG9B,GAAIL,EAAI,EAAG,MAAM,IAAIlC,MAAM,oBAAsBkC,GAGjD,GAAiB,OAAblB,KAAKG,IACPH,KAAKK,GAAK,KAAOL,KAAKG,IAAMU,GAAM,KAAOb,KAAKI,IAAMlB,QAIjD,GAAMsC,EAAQ3B,EAKd,GAAML,KAAKiC,IAAIF,EAAMH,EAAMC,EAAMC,GAAOzB,GAAaqB,EAKrD,CACH,IAAIQ,EAAMX,EAAKI,EACXQ,EAAMX,EAAK3C,EACXuD,EAAQR,EAAMA,EAAMC,EAAMA,EAC1BQ,EAAQH,EAAMA,EAAMC,EAAMA,EAC1BG,EAAMtC,KAAKC,KAAKmC,GAChBG,EAAMvC,KAAKC,KAAK+B,GAChBQ,EAAId,EAAI1B,KAAKyC,KAAKvC,EAAKF,KAAK0C,MAAMN,EAAQJ,EAAQK,IAAU,EAAIC,EAAMC,KAAS,GAC/EI,EAAMH,EAAID,EACVK,EAAMJ,EAAIF,EAGVtC,KAAKiC,IAAIU,EAAM,GAAKtC,IACtBG,KAAKK,GAAK,KAAOQ,EAAKsB,EAAMb,GAAO,KAAOpC,EAAKiD,EAAMZ,IAGvDvB,KAAKK,GAAK,IAAMa,EAAI,IAAMA,EAAI,WAAaK,EAAMG,EAAMJ,EAAMK,GAAQ,KAAO3B,KAAKG,IAAMU,EAAKuB,EAAMhB,GAAO,KAAOpB,KAAKI,IAAMlB,EAAKkD,EAAMf,EACxI,MArBErB,KAAKK,GAAK,KAAOL,KAAKG,IAAMU,GAAM,KAAOb,KAAKI,IAAMlB,EAsBxD,EACAmD,IAAK,SAASvF,EAAG2D,EAAGS,EAAGoB,EAAIC,EAAIC,GAC7B1F,GAAKA,EAAG2D,GAAKA,EAAW+B,IAAQA,EAChC,IAAIC,GADYvB,GAAKA,GACR1B,KAAKkD,IAAIJ,GAClBK,EAAKzB,EAAI1B,KAAKoD,IAAIN,GAClBnB,EAAKrE,EAAI2F,EACTpE,EAAKoC,EAAIkC,EACTE,EAAK,EAAIL,EACTM,EAAKN,EAAMF,EAAKC,EAAKA,EAAKD,EAG9B,GAAIpB,EAAI,EAAG,MAAM,IAAIlC,MAAM,oBAAsBkC,GAGhC,OAAblB,KAAKG,IACPH,KAAKK,GAAK,IAAMc,EAAK,IAAM9C,GAIpBmB,KAAKiC,IAAIzB,KAAKG,IAAMgB,GAAMtB,GAAWL,KAAKiC,IAAIzB,KAAKI,IAAM/B,GAAMwB,KACtEG,KAAKK,GAAK,IAAMc,EAAK,IAAM9C,GAIxB6C,IAGD4B,EAAK,IAAGA,EAAKA,EAAKlD,EAAMA,GAGxBkD,EAAKhD,EACPE,KAAKK,GAAK,IAAMa,EAAI,IAAMA,EAAI,QAAU2B,EAAK,KAAO/F,EAAI2F,GAAM,KAAOhC,EAAIkC,GAAM,IAAMzB,EAAI,IAAMA,EAAI,QAAU2B,EAAK,KAAO7C,KAAKG,IAAMgB,GAAM,KAAOnB,KAAKI,IAAM/B,GAIrJyE,EAAKjD,IACZG,KAAKK,GAAK,IAAMa,EAAI,IAAMA,EAAI,SAAW4B,GAAMpD,GAAO,IAAMmD,EAAK,KAAO7C,KAAKG,IAAMrD,EAAIoE,EAAI1B,KAAKkD,IAAIH,IAAO,KAAOvC,KAAKI,IAAMK,EAAIS,EAAI1B,KAAKoD,IAAIL,KAElJ,EACAQ,KAAM,SAASjG,EAAG2D,EAAGuC,EAAGC,GACtBjD,KAAKK,GAAK,KAAOL,KAAKC,IAAMD,KAAKG,KAAOrD,GAAK,KAAOkD,KAAKE,IAAMF,KAAKI,KAAOK,GAAK,MAAQuC,EAAK,MAAQC,EAAK,KAAQD,EAAK,GACzH,EACAE,SAAU,WACR,OAAOlD,KAAKK,CACd,GAGF,UCjIO,IAAI,EAAQrD,MAAMC,UAAUqC,MCApB,WAASxC,GACtB,OAAO,WACL,OAAOA,CACT,CACF,CCJO,SAAS,EAAEqG,GAChB,OAAOA,EAAE,EACX,CAEO,SAAS,EAAEA,GAChB,OAAOA,EAAE,EACX,CCAA,SAASC,EAAWvG,GAClB,OAAOA,EAAEqB,MACX,CAEA,SAASmF,EAAWxG,GAClB,OAAOA,EAAEc,MACX,CAuCA,SAAS2F,EAAgBC,EAASpC,EAAI9C,EAAIwC,EAAI3B,GAC5CqE,EAAQ/C,OAAOW,EAAI9C,GACnBkF,EAAQzC,cAAcK,GAAMA,EAAKN,GAAM,EAAGxC,EAAI8C,EAAIjC,EAAI2B,EAAI3B,EAC5D,CCpDA,SAASsE,EAAiB3G,GACxB,MAAO,CAACA,EAAEqB,OAAO2C,GAAIhE,EAAEwB,GACzB,CAEA,SAASoF,EAAiB5G,GACxB,MAAO,CAACA,EAAEc,OAAOwD,GAAItE,EAAEqC,GACzB,CAEe,aACb,ODGF,SAAcwE,GACZ,IAAIxF,EAASkF,EACTzF,EAAS0F,EACTvG,EAAI,EACJ2D,EAAI,EACJ8C,EAAU,KAEd,SAASpE,IACP,IAAIwE,EAAQC,EAAO,EAAMC,KAAKC,WAAYC,EAAI7F,EAAO8F,MAAMhE,KAAM4D,GAAOK,EAAItG,EAAOqG,MAAMhE,KAAM4D,GAG/F,GAFKL,IAASA,EAAUI,EAAS,KACjCD,EAAMH,GAAUzG,EAAEkH,MAAMhE,MAAO4D,EAAK,GAAKG,EAAGH,KAASnD,EAAEuD,MAAMhE,KAAM4D,IAAQ9G,EAAEkH,MAAMhE,MAAO4D,EAAK,GAAKK,EAAGL,KAASnD,EAAEuD,MAAMhE,KAAM4D,IAC1HD,EAAQ,OAAOJ,EAAU,KAAMI,EAAS,IAAM,IACpD,CAsBA,OApBAxE,EAAKjB,OAAS,SAASmC,GACrB,OAAOyD,UAAUlH,QAAUsB,EAASmC,EAAGlB,GAAQjB,CACjD,EAEAiB,EAAKxB,OAAS,SAAS0C,GACrB,OAAOyD,UAAUlH,QAAUe,EAAS0C,EAAGlB,GAAQxB,CACjD,EAEAwB,EAAKrC,EAAI,SAASuD,GAChB,OAAOyD,UAAUlH,QAAUE,EAAiB,mBAANuD,EAAmBA,EAAI,GAAUA,GAAIlB,GAAQrC,CACrF,EAEAqC,EAAKsB,EAAI,SAASJ,GAChB,OAAOyD,UAAUlH,QAAU6D,EAAiB,mBAANJ,EAAmBA,EAAI,GAAUA,GAAIlB,GAAQsB,CACrF,EAEAtB,EAAKoE,QAAU,SAASlD,GACtB,OAAOyD,UAAUlH,QAAW2G,EAAe,MAALlD,EAAY,KAAOA,EAAIlB,GAAQoE,CACvE,EAEOpE,CACT,CAsBS,CAAKmE,GC3DPpF,OAAOsF,GACP7F,OAAO8F,EACd,CCEA,IAAIS,EAAS,WACX,IAAIC,GAAoB,SAAO,SAASC,EAAGC,EAAGC,EAAItC,GAChD,IAAKsC,EAAKA,GAAM,CAAC,EAAGtC,EAAIoC,EAAExH,OAAQoF,IAAKsC,EAAGF,EAAEpC,IAAMqC,GAClD,OAAOC,CACT,GAAG,KAAMC,EAAM,CAAC,EAAG,GAAIC,EAAM,CAAC,EAAG,IAAKC,EAAM,CAAC,EAAG,EAAG,GAAI,IACnDC,EAAU,CACZC,OAAuB,SAAO,WAC9B,GAAG,SACHC,GAAI,CAAC,EACLC,SAAU,CAAE,MAAS,EAAG,MAAS,EAAG,OAAU,EAAG,QAAW,EAAG,IAAO,EAAG,QAAW,EAAG,OAAU,EAAG,SAAY,EAAG,IAAO,GAAI,gBAAiB,GAAI,MAAS,GAAI,gBAAiB,GAAI,eAAgB,GAAI,MAAS,GAAI,QAAW,GAAI,YAAe,GAAI,OAAU,GAAI,aAAgB,GAAI,iBAAoB,GAAI,QAAW,EAAG,KAAQ,GACxUC,WAAY,CAAE,EAAG,QAAS,EAAG,SAAU,EAAG,UAAW,GAAI,MAAO,GAAI,gBAAiB,GAAI,QAAS,GAAI,gBAAiB,GAAI,eAAgB,GAAI,SAAU,GAAI,eAAgB,GAAI,oBACjLC,aAAc,CAAC,EAAG,CAAC,EAAG,GAAI,CAAC,EAAG,GAAI,CAAC,EAAG,GAAI,CAAC,EAAG,GAAI,CAAC,EAAG,GAAI,CAAC,EAAG,GAAI,CAAC,EAAG,GAAI,CAAC,GAAI,GAAI,CAAC,GAAI,GAAI,CAAC,GAAI,GAAI,CAAC,GAAI,IAC1GC,eAA+B,SAAO,SAAmBC,EAAQC,EAAQC,EAAUP,EAAIQ,EAASC,EAAIC,GAClG,IAAIC,EAAKF,EAAGzI,OAAS,EACrB,OAAQwI,GACN,KAAK,EACH,MAAMlH,EAAS0G,EAAGY,iBAAiBH,EAAGE,EAAK,GAAGE,OAAOC,WAAW,KAAM,MAChE/H,EAASiH,EAAGY,iBAAiBH,EAAGE,EAAK,GAAGE,OAAOC,WAAW,KAAM,MAChEtI,EAAQuI,WAAWN,EAAGE,GAAIE,QAChCb,EAAGgB,QAAQ1H,EAAQP,EAAQP,GAC3B,MACF,KAAK,EACL,KAAK,EACL,KAAK,GACH4C,KAAK6F,EAAIR,EAAGE,GACZ,MACF,KAAK,GACHvF,KAAK6F,EAAIR,EAAGE,EAAK,GAGvB,GAAG,aACHO,MAAO,CAAC,CAAE,EAAG,EAAG,EAAG,CAAC,EAAG,IAAM,CAAE,EAAG,CAAC,IAAM,CAAE,EAAG,CAAC,EAAG,IAAM,CAAE,EAAG,EAAG,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAIvB,EAAK,GAAIC,GAAO,CAAE,EAAG,CAAC,EAAG,GAAI,EAAG,GAAI,GAAI,CAAC,EAAG,KAAOL,EAAEK,EAAK,CAAC,EAAG,GAAI,CAAE,EAAG,GAAI,EAAG,CAAC,EAAG,MAAQ,CAAE,GAAI,CAAC,EAAG,KAAOL,EAAEM,EAAK,CAAC,EAAG,IAAKN,EAAEM,EAAK,CAAC,EAAG,IAAK,CAAE,GAAI,CAAC,EAAG,KAAON,EAAEM,EAAK,CAAC,EAAG,KAAM,CAAE,EAAG,CAAC,EAAG,IAAM,CAAE,EAAG,CAAC,EAAG,IAAMN,EAAEK,EAAK,CAAC,EAAG,IAAK,CAAE,EAAG,GAAI,EAAG,EAAG,GAAI,EAAG,GAAI,EAAG,GAAI,EAAG,GAAID,EAAK,GAAIC,GAAO,CAAE,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAID,EAAK,GAAIC,GAAO,CAAE,GAAI,CAAC,EAAG,KAAOL,EAAEK,EAAK,CAAC,EAAG,IAAK,CAAE,GAAI,CAAC,EAAG,KAAOL,EAAEM,EAAK,CAAC,EAAG,KAAM,CAAE,GAAI,GAAI,GAAI,EAAG,GAAI,EAAG,GAAIF,EAAK,GAAIC,GAAOL,EAAE,CAAC,EAAG,EAAG,IAAK,CAAC,EAAG,KAC/hB4B,eAAgB,CAAE,GAAI,CAAC,EAAG,GAAI,GAAI,CAAC,EAAG,IACtCC,YAA4B,SAAO,SAAoBC,EAAKC,GAC1D,IAAIA,EAAKC,YAEF,CACL,IAAIC,EAAQ,IAAIpH,MAAMiH,GAEtB,MADAG,EAAMF,KAAOA,EACPE,CACR,CALEpG,KAAK2E,MAAMsB,EAMf,GAAG,cACHI,OAAuB,SAAO,SAAeC,GAC3C,IAAIC,EAAOvG,KAAMwG,EAAQ,CAAC,GAAIC,EAAS,GAAIC,EAAS,CAAC,MAAOC,EAAS,GAAIb,EAAQ9F,KAAK8F,MAAOb,EAAS,GAAIE,EAAW,EAAGD,EAAS,EAAG0B,EAAa,EAC7IC,EAAOF,EAAOrH,MAAMuE,KAAKC,UAAW,GACpCgD,EAASC,OAAOC,OAAOhH,KAAKiH,OAC5BC,EAAc,CAAEtC,GAAI,CAAC,GACzB,IAAK,IAAIR,KAAKpE,KAAK4E,GACbmC,OAAO9J,UAAUkK,eAAetD,KAAK7D,KAAK4E,GAAIR,KAChD8C,EAAYtC,GAAGR,GAAKpE,KAAK4E,GAAGR,IAGhC0C,EAAOM,SAASd,EAAOY,EAAYtC,IACnCsC,EAAYtC,GAAGqC,MAAQH,EACvBI,EAAYtC,GAAGV,OAASlE,UACI,IAAjB8G,EAAOO,SAChBP,EAAOO,OAAS,CAAC,GAEnB,IAAIC,EAAQR,EAAOO,OACnBV,EAAOY,KAAKD,GACZ,IAAIE,EAASV,EAAOW,SAAWX,EAAOW,QAAQD,OAY9C,SAASE,IACP,IAAIC,EASJ,MAPqB,iBADrBA,EAAQlB,EAAOmB,OAASd,EAAOY,OA/BqI,KAiC9JC,aAAiB3K,QAEnB2K,GADAlB,EAASkB,GACMC,OAEjBD,EAAQpB,EAAK1B,SAAS8C,IAAUA,GAE3BA,CACT,CAtByC,mBAA9BT,EAAYtC,GAAGoB,WACxBhG,KAAKgG,WAAakB,EAAYtC,GAAGoB,WAEjChG,KAAKgG,WAAae,OAAOc,eAAe7H,MAAMgG,YAOhD,SALA,SAAkB1I,GAChBkJ,EAAM5J,OAAS4J,EAAM5J,OAAS,EAAIU,EAClCoJ,EAAO9J,OAAS8J,EAAO9J,OAASU,EAChCqJ,EAAO/J,OAAS+J,EAAO/J,OAASU,CAClC,GACiB,aAajB,QAAOoK,EAAK,OAEZ,IADA,IAAII,EAAQC,EAAgBC,EAAOC,EAAW/G,EAAeiC,EAAG+E,EAAKC,EAAUC,EAA9BC,EAAQ,CAAC,IAC7C,CAUX,GATAL,EAAQxB,EAAMA,EAAM5J,OAAS,GACzBoD,KAAK+F,eAAeiC,GACtBC,EAASjI,KAAK+F,eAAeiC,IAEzBF,UACFA,EAASJ,KAEXO,EAASnC,EAAMkC,IAAUlC,EAAMkC,GAAOF,SAElB,IAAXG,IAA2BA,EAAOrL,SAAWqL,EAAO,GAAI,CACjE,IAAIK,EAEJ,IAAKnF,KADLiF,EAAW,GACDtC,EAAMkC,GACVhI,KAAK8E,WAAW3B,IAAMA,EAzD6H,GA0DrJiF,EAASb,KAAK,IAAMvH,KAAK8E,WAAW3B,GAAK,KAI3CmF,EADExB,EAAOyB,aACA,wBAA0BpD,EAAW,GAAK,MAAQ2B,EAAOyB,eAAiB,eAAiBH,EAASI,KAAK,MAAQ,WAAaxI,KAAK8E,WAAWgD,IAAWA,GAAU,IAEnK,wBAA0B3C,EAAW,GAAK,iBAhE6G,GAgE1F2C,EAAgB,eAAiB,KAAO9H,KAAK8E,WAAWgD,IAAWA,GAAU,KAErJ9H,KAAKgG,WAAWsC,EAAQ,CACtBG,KAAM3B,EAAO4B,MACbf,MAAO3H,KAAK8E,WAAWgD,IAAWA,EAClCa,KAAM7B,EAAO3B,SACbyD,IAAKtB,EACLc,YAEJ,CACA,GAAIH,EAAO,aAAcjL,OAASiL,EAAOrL,OAAS,EAChD,MAAM,IAAIoC,MAAM,oDAAsDgJ,EAAQ,YAAcF,GAE9F,OAAQG,EAAO,IACb,KAAK,EACHzB,EAAMe,KAAKO,GACXpB,EAAOa,KAAKT,EAAO7B,QACnB0B,EAAOY,KAAKT,EAAOO,QACnBb,EAAMe,KAAKU,EAAO,IAClBH,EAAS,KACJC,GASHD,EAASC,EACTA,EAAiB,OATjB7C,EAAS4B,EAAO5B,OAChBD,EAAS6B,EAAO7B,OAChBE,EAAW2B,EAAO3B,SAClBmC,EAAQR,EAAOO,OACXT,EAAa,GACfA,KAMJ,MACF,KAAK,EAwBH,GAvBAsB,EAAMlI,KAAK+E,aAAakD,EAAO,IAAI,GACnCI,EAAMxC,EAAIa,EAAOA,EAAO9J,OAASsL,GACjCG,EAAM/C,GAAK,CACTuD,WAAYlC,EAAOA,EAAO/J,QAAUsL,GAAO,IAAIW,WAC/CC,UAAWnC,EAAOA,EAAO/J,OAAS,GAAGkM,UACrCC,aAAcpC,EAAOA,EAAO/J,QAAUsL,GAAO,IAAIa,aACjDC,YAAarC,EAAOA,EAAO/J,OAAS,GAAGoM,aAErCxB,IACFa,EAAM/C,GAAG2D,MAAQ,CACftC,EAAOA,EAAO/J,QAAUsL,GAAO,IAAIe,MAAM,GACzCtC,EAAOA,EAAO/J,OAAS,GAAGqM,MAAM,UAYnB,KATjB/H,EAAIlB,KAAKgF,cAAchB,MAAMqE,EAAO,CAClCpD,EACAC,EACAC,EACA+B,EAAYtC,GACZqD,EAAO,GACPvB,EACAC,GACAuC,OAAOrC,KAEP,OAAO3F,EAELgH,IACF1B,EAAQA,EAAMlH,MAAM,GAAI,EAAI4I,EAAM,GAClCxB,EAASA,EAAOpH,MAAM,GAAI,EAAI4I,GAC9BvB,EAASA,EAAOrH,MAAM,GAAI,EAAI4I,IAEhC1B,EAAMe,KAAKvH,KAAK+E,aAAakD,EAAO,IAAI,IACxCvB,EAAOa,KAAKc,EAAMxC,GAClBc,EAAOY,KAAKc,EAAM/C,IAClB6C,EAAWrC,EAAMU,EAAMA,EAAM5J,OAAS,IAAI4J,EAAMA,EAAM5J,OAAS,IAC/D4J,EAAMe,KAAKY,GACX,MACF,KAAK,EACH,OAAO,EAEb,CACA,OAAO,CACT,GAAG,UAEDlB,EAAwB,WA2T1B,MA1Ta,CACXkC,IAAK,EACLnD,YAA4B,SAAO,SAAoBC,EAAKC,GAC1D,IAAIlG,KAAK4E,GAAGV,OAGV,MAAM,IAAIlF,MAAMiH,GAFhBjG,KAAK4E,GAAGV,OAAO8B,WAAWC,EAAKC,EAInC,GAAG,cAEHkB,UAA0B,SAAO,SAASd,EAAO1B,GAiB/C,OAhBA5E,KAAK4E,GAAKA,GAAM5E,KAAK4E,IAAM,CAAC,EAC5B5E,KAAKoJ,OAAS9C,EACdtG,KAAKqJ,MAAQrJ,KAAKsJ,WAAatJ,KAAKuJ,MAAO,EAC3CvJ,KAAKmF,SAAWnF,KAAKkF,OAAS,EAC9BlF,KAAKiF,OAASjF,KAAKwJ,QAAUxJ,KAAK0I,MAAQ,GAC1C1I,KAAKyJ,eAAiB,CAAC,WACvBzJ,KAAKqH,OAAS,CACZwB,WAAY,EACZE,aAAc,EACdD,UAAW,EACXE,YAAa,GAEXhJ,KAAKyH,QAAQD,SACfxH,KAAKqH,OAAO4B,MAAQ,CAAC,EAAG,IAE1BjJ,KAAK0J,OAAS,EACP1J,IACT,GAAG,YAEHsG,OAAuB,SAAO,WAC5B,IAAIqD,EAAK3J,KAAKoJ,OAAO,GAiBrB,OAhBApJ,KAAKiF,QAAU0E,EACf3J,KAAKkF,SACLlF,KAAK0J,SACL1J,KAAK0I,OAASiB,EACd3J,KAAKwJ,SAAWG,EACJA,EAAGjB,MAAM,oBAEnB1I,KAAKmF,WACLnF,KAAKqH,OAAOyB,aAEZ9I,KAAKqH,OAAO2B,cAEVhJ,KAAKyH,QAAQD,QACfxH,KAAKqH,OAAO4B,MAAM,KAEpBjJ,KAAKoJ,OAASpJ,KAAKoJ,OAAO9J,MAAM,GACzBqK,CACT,GAAG,SAEHC,OAAuB,SAAO,SAASD,GACrC,IAAIzB,EAAMyB,EAAG/M,OACTiN,EAAQF,EAAGG,MAAM,iBACrB9J,KAAKoJ,OAASO,EAAK3J,KAAKoJ,OACxBpJ,KAAKiF,OAASjF,KAAKiF,OAAO8E,OAAO,EAAG/J,KAAKiF,OAAOrI,OAASsL,GACzDlI,KAAK0J,QAAUxB,EACf,IAAI8B,EAAWhK,KAAK0I,MAAMoB,MAAM,iBAChC9J,KAAK0I,MAAQ1I,KAAK0I,MAAMqB,OAAO,EAAG/J,KAAK0I,MAAM9L,OAAS,GACtDoD,KAAKwJ,QAAUxJ,KAAKwJ,QAAQO,OAAO,EAAG/J,KAAKwJ,QAAQ5M,OAAS,GACxDiN,EAAMjN,OAAS,IACjBoD,KAAKmF,UAAY0E,EAAMjN,OAAS,GAElC,IAAIsE,EAAIlB,KAAKqH,OAAO4B,MAWpB,OAVAjJ,KAAKqH,OAAS,CACZwB,WAAY7I,KAAKqH,OAAOwB,WACxBC,UAAW9I,KAAKmF,SAAW,EAC3B4D,aAAc/I,KAAKqH,OAAO0B,aAC1BC,YAAaa,GAASA,EAAMjN,SAAWoN,EAASpN,OAASoD,KAAKqH,OAAO0B,aAAe,GAAKiB,EAASA,EAASpN,OAASiN,EAAMjN,QAAQA,OAASiN,EAAM,GAAGjN,OAASoD,KAAKqH,OAAO0B,aAAeb,GAEtLlI,KAAKyH,QAAQD,SACfxH,KAAKqH,OAAO4B,MAAQ,CAAC/H,EAAE,GAAIA,EAAE,GAAKlB,KAAKkF,OAASgD,IAElDlI,KAAKkF,OAASlF,KAAKiF,OAAOrI,OACnBoD,IACT,GAAG,SAEHiK,MAAsB,SAAO,WAE3B,OADAjK,KAAKqJ,OAAQ,EACNrJ,IACT,GAAG,QAEHkK,QAAwB,SAAO,WAC7B,OAAIlK,KAAKyH,QAAQ0C,iBACfnK,KAAKsJ,YAAa,EAQbtJ,MANEA,KAAKgG,WAAW,0BAA4BhG,KAAKmF,SAAW,GAAK,mIAAqInF,KAAKuI,eAAgB,CAChOE,KAAM,GACNd,MAAO,KACPgB,KAAM3I,KAAKmF,UAIjB,GAAG,UAEHiF,MAAsB,SAAO,SAAS9M,GACpC0C,KAAK4J,MAAM5J,KAAK0I,MAAMpJ,MAAMhC,GAC9B,GAAG,QAEH+M,WAA2B,SAAO,WAChC,IAAIC,EAAOtK,KAAKwJ,QAAQO,OAAO,EAAG/J,KAAKwJ,QAAQ5M,OAASoD,KAAK0I,MAAM9L,QACnE,OAAQ0N,EAAK1N,OAAS,GAAK,MAAQ,IAAM0N,EAAKP,QAAQ,IAAIQ,QAAQ,MAAO,GAC3E,GAAG,aAEHC,eAA+B,SAAO,WACpC,IAAIC,EAAOzK,KAAK0I,MAIhB,OAHI+B,EAAK7N,OAAS,KAChB6N,GAAQzK,KAAKoJ,OAAOW,OAAO,EAAG,GAAKU,EAAK7N,UAElC6N,EAAKV,OAAO,EAAG,KAAOU,EAAK7N,OAAS,GAAK,MAAQ,KAAK2N,QAAQ,MAAO,GAC/E,GAAG,iBAEHhC,cAA8B,SAAO,WACnC,IAAImC,EAAM1K,KAAKqK,YACXM,EAAI,IAAI3N,MAAM0N,EAAI9N,OAAS,GAAG4L,KAAK,KACvC,OAAOkC,EAAM1K,KAAKwK,gBAAkB,KAAOG,EAAI,GACjD,GAAG,gBAEHC,YAA4B,SAAO,SAASlC,EAAOmC,GACjD,IAAIlD,EAAOkC,EAAOiB,EAmDlB,GAlDI9K,KAAKyH,QAAQ0C,kBACfW,EAAS,CACP3F,SAAUnF,KAAKmF,SACfkC,OAAQ,CACNwB,WAAY7I,KAAKqH,OAAOwB,WACxBC,UAAW9I,KAAK8I,UAChBC,aAAc/I,KAAKqH,OAAO0B,aAC1BC,YAAahJ,KAAKqH,OAAO2B,aAE3B/D,OAAQjF,KAAKiF,OACbyD,MAAO1I,KAAK0I,MACZqC,QAAS/K,KAAK+K,QACdvB,QAASxJ,KAAKwJ,QACdtE,OAAQlF,KAAKkF,OACbwE,OAAQ1J,KAAK0J,OACbL,MAAOrJ,KAAKqJ,MACZD,OAAQpJ,KAAKoJ,OACbxE,GAAI5E,KAAK4E,GACT6E,eAAgBzJ,KAAKyJ,eAAenK,MAAM,GAC1CiK,KAAMvJ,KAAKuJ,MAETvJ,KAAKyH,QAAQD,SACfsD,EAAOzD,OAAO4B,MAAQjJ,KAAKqH,OAAO4B,MAAM3J,MAAM,MAGlDuK,EAAQnB,EAAM,GAAGA,MAAM,sBAErB1I,KAAKmF,UAAY0E,EAAMjN,QAEzBoD,KAAKqH,OAAS,CACZwB,WAAY7I,KAAKqH,OAAOyB,UACxBA,UAAW9I,KAAKmF,SAAW,EAC3B4D,aAAc/I,KAAKqH,OAAO2B,YAC1BA,YAAaa,EAAQA,EAAMA,EAAMjN,OAAS,GAAGA,OAASiN,EAAMA,EAAMjN,OAAS,GAAG8L,MAAM,UAAU,GAAG9L,OAASoD,KAAKqH,OAAO2B,YAAcN,EAAM,GAAG9L,QAE/IoD,KAAKiF,QAAUyD,EAAM,GACrB1I,KAAK0I,OAASA,EAAM,GACpB1I,KAAK+K,QAAUrC,EACf1I,KAAKkF,OAASlF,KAAKiF,OAAOrI,OACtBoD,KAAKyH,QAAQD,SACfxH,KAAKqH,OAAO4B,MAAQ,CAACjJ,KAAK0J,OAAQ1J,KAAK0J,QAAU1J,KAAKkF,SAExDlF,KAAKqJ,OAAQ,EACbrJ,KAAKsJ,YAAa,EAClBtJ,KAAKoJ,OAASpJ,KAAKoJ,OAAO9J,MAAMoJ,EAAM,GAAG9L,QACzCoD,KAAKwJ,SAAWd,EAAM,GACtBf,EAAQ3H,KAAKgF,cAAcnB,KAAK7D,KAAMA,KAAK4E,GAAI5E,KAAM6K,EAAc7K,KAAKyJ,eAAezJ,KAAKyJ,eAAe7M,OAAS,IAChHoD,KAAKuJ,MAAQvJ,KAAKoJ,SACpBpJ,KAAKuJ,MAAO,GAEV5B,EACF,OAAOA,EACF,GAAI3H,KAAKsJ,WAAY,CAC1B,IAAK,IAAIlF,KAAK0G,EACZ9K,KAAKoE,GAAK0G,EAAO1G,GAEnB,OAAO,CACT,CACA,OAAO,CACT,GAAG,cAEHqG,MAAsB,SAAO,WAC3B,GAAIzK,KAAKuJ,KACP,OAAOvJ,KAAKmJ,IAKd,IAAIxB,EAAOe,EAAOsC,EAAW7M,EAHxB6B,KAAKoJ,SACRpJ,KAAKuJ,MAAO,GAGTvJ,KAAKqJ,QACRrJ,KAAKiF,OAAS,GACdjF,KAAK0I,MAAQ,IAGf,IADA,IAAIuC,EAAQjL,KAAKkL,gBACR3N,EAAI,EAAGA,EAAI0N,EAAMrO,OAAQW,IAEhC,IADAyN,EAAYhL,KAAKoJ,OAAOV,MAAM1I,KAAKiL,MAAMA,EAAM1N,SAC5BmL,GAASsC,EAAU,GAAGpO,OAAS8L,EAAM,GAAG9L,QAAS,CAGlE,GAFA8L,EAAQsC,EACR7M,EAAQZ,EACJyC,KAAKyH,QAAQ0C,gBAAiB,CAEhC,IAAc,KADdxC,EAAQ3H,KAAK4K,WAAWI,EAAWC,EAAM1N,KAEvC,OAAOoK,EACF,GAAI3H,KAAKsJ,WAAY,CAC1BZ,GAAQ,EACR,QACF,CACE,OAAO,CAEX,CAAO,IAAK1I,KAAKyH,QAAQ0D,KACvB,KAEJ,CAEF,OAAIzC,GAEY,KADdf,EAAQ3H,KAAK4K,WAAWlC,EAAOuC,EAAM9M,MAE5BwJ,EAIS,KAAhB3H,KAAKoJ,OACApJ,KAAKmJ,IAELnJ,KAAKgG,WAAW,0BAA4BhG,KAAKmF,SAAW,GAAK,yBAA2BnF,KAAKuI,eAAgB,CACtHE,KAAM,GACNd,MAAO,KACPgB,KAAM3I,KAAKmF,UAGjB,GAAG,QAEHuC,KAAqB,SAAO,WAE1B,OADQ1H,KAAKyK,QAIJzK,KAAK0H,KAEhB,GAAG,OAEH0D,OAAuB,SAAO,SAAeC,GAC3CrL,KAAKyJ,eAAelC,KAAK8D,EAC3B,GAAG,SAEHC,UAA0B,SAAO,WAE/B,OADQtL,KAAKyJ,eAAe7M,OAAS,EAC7B,EACCoD,KAAKyJ,eAAe7B,MAEpB5H,KAAKyJ,eAAe,EAE/B,GAAG,YAEHyB,eAA+B,SAAO,WACpC,OAAIlL,KAAKyJ,eAAe7M,QAAUoD,KAAKyJ,eAAezJ,KAAKyJ,eAAe7M,OAAS,GAC1EoD,KAAKuL,WAAWvL,KAAKyJ,eAAezJ,KAAKyJ,eAAe7M,OAAS,IAAIqO,MAErEjL,KAAKuL,WAAoB,QAAEN,KAEtC,GAAG,iBAEHO,UAA0B,SAAO,SAAkBlO,GAEjD,OADAA,EAAI0C,KAAKyJ,eAAe7M,OAAS,EAAI4C,KAAKiC,IAAInE,GAAK,KAC1C,EACA0C,KAAKyJ,eAAenM,GAEpB,SAEX,GAAG,YAEHmO,WAA2B,SAAO,SAAmBJ,GACnDrL,KAAKoL,MAAMC,EACb,GAAG,aAEHK,gBAAgC,SAAO,WACrC,OAAO1L,KAAKyJ,eAAe7M,MAC7B,GAAG,kBACH6K,QAAS,CAAE,oBAAoB,GAC/BzC,eAA+B,SAAO,SAAmBJ,EAAI+G,EAAKC,EAA2BC,GAE3F,OAAQD,GACN,KAAK,EAEH,OADA5L,KAAKyL,UAAU,OACR,EAET,KAAK,EACH,OAAO,GAET,KAAK,EACH,OAAO,EAET,KAAK,EACH,OAAO,GAET,KAAK,EAEH,OADAzL,KAAKyL,UAAU,gBACR,GAET,KAAK,EACH,OAAO,GAET,KAAK,EAEH,OADAzL,KAAKsL,SAAS,gBACP,GAET,KAAK,EACH,OAAO,GAGb,GAAG,aACHL,MAAO,CAAC,sBAAuB,UAAW,kCAAmC,iBAAkB,iBAAkB,qDAAsD,6BAA8B,oGACrMM,WAAY,CAAE,IAAO,CAAE,MAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,WAAa,GAAS,aAAgB,CAAE,MAAS,CAAC,EAAG,GAAI,WAAa,GAAS,QAAW,CAAE,MAAS,CAAC,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,EAAG,GAAI,WAAa,IAGvM,CA5T4B,GA8T5B,SAASO,IACP9L,KAAK4E,GAAK,CAAC,CACb,CAIA,OAPAF,EAAQuC,MAAQA,GAIhB,QAAO6E,EAAQ,UACfA,EAAO7O,UAAYyH,EACnBA,EAAQoH,OAASA,EACV,IAAIA,CACb,CA9fa,GA+fb5H,EAAOA,OAASA,EAChB,IAAI6H,EAAiB7H,EAGjBvF,EAAQ,GACRF,EAAQ,GACRuN,EAA2B,IAAIC,IAC/BC,GAAyB,SAAO,KAClCvN,EAAQ,GACRF,EAAQ,GACRuN,EAA2B,IAAIC,KAC/B,SAAO,GACN,SACCE,EAAa,MACf,WAAA5L,CAAYrC,EAAQP,EAAQP,EAAQ,GAClC4C,KAAK9B,OAASA,EACd8B,KAAKrC,OAASA,EACdqC,KAAK5C,MAAQA,CACf,SAEE,QAAO4C,KAAM,aACf,GAEE4F,GAA0B,SAAO,CAAC1H,EAAQP,EAAQP,KACpDuB,EAAM4I,KAAK,IAAI4E,EAAWjO,EAAQP,EAAQP,GAAO,GAChD,WACCgP,EAAa,MACf,WAAA7L,CAAY8L,GACVrM,KAAKqM,GAAKA,CACZ,SAEE,QAAOrM,KAAM,aACf,GAEEwF,GAAmC,SAAQ6G,IAC7CA,EAAK,KAAeC,aAAaD,GAAI,WACrC,IAAIvO,EAAOkO,EAASjN,IAAIsN,GAMxB,YALa,IAATvO,IACFA,EAAO,IAAIsO,EAAWC,GACtBL,EAASO,IAAIF,EAAIvO,GACjBW,EAAM8I,KAAKzJ,IAENA,CAAI,GACV,oBACC0O,GAA2B,SAAO,IAAM/N,GAAO,YAC/CgO,GAA2B,SAAO,IAAM9N,GAAO,YAC/C+N,GAA2B,SAAO,KAAM,CAC1CjO,MAAOA,EAAMc,KAAKzB,IAAS,CAAGgB,GAAIhB,EAAKuO,OACvC1N,MAAOA,EAAMY,KAAKJ,IAAS,CACzBjB,OAAQiB,EAAKjB,OAAOmO,GACpB1O,OAAQwB,EAAKxB,OAAO0O,GACpBjP,MAAO+B,EAAK/B,aAEZ,YACAuP,GAAmB,CACrBX,WACAY,WAA2B,SAAO,KAAM,UAAYC,QAAQ,aAC5DL,WACAC,WACAC,WACA9G,UACAJ,mBACAsH,YAAW,KACXC,YAAW,KACXC,kBAAiB,KACjBC,kBAAiB,KACjBC,gBAAe,KACfC,gBAAe,KACfC,MAAOlB,GAmBLmB,GAAM,MAAMC,UAEZ,QAAOtN,KAAM,MACf,QAEEA,KAAKuN,MAAQ,CACf,CACA,WAAO9C,CAAK+C,GACV,OAAO,IAAIF,EAAKE,KAASF,EAAKC,MAChC,CACA,WAAAhN,CAAYzB,GACVkB,KAAKlB,GAAKA,EACVkB,KAAKyN,KAAO,IAAI3O,GAClB,CACA,QAAAoE,GACE,MAAO,OAASlD,KAAKyN,KAAO,GAC9B,GAIEC,GAAgB,CAClBC,KVrnBK,SAAc7P,GACnB,OAAOA,EAAKF,KACd,EUonBEgQ,MVlnBK,SAAe9P,EAAMR,GAC1B,OAAOA,EAAI,EAAIQ,EAAK+P,MACtB,EUinBEC,OV3mBK,SAAgBhQ,GACrB,OAAOA,EAAKuB,YAAYzC,OAASkB,EAAKF,MAChCE,EAAKC,YAAYnB,OAASY,EAAIM,EAAKC,YAAaL,GAAe,EAC/D,CACR,EUwmBEG,QAAS,GAEPkQ,IAAuB,SAAO,SAAStF,EAAM3J,EAAIkP,EAAUC,GAC7D,MAAM,cAAEC,EAAerB,OAAQsB,IAAS,UAClCC,EAAsB,KAAcvB,OAC1C,IAAIwB,EACkB,YAAlBH,IACFG,GAAiB,SAAS,KAAOvP,IAEnC,MAAMwP,EAAyB,YAAlBJ,GAA8B,SAASG,EAAe5P,QAAQ,GAAG8P,gBAAgBC,OAAQ,SAAS,QACzGC,EAAwB,YAAlBP,EAA8BI,EAAKI,OAAO,QAAQ5P,QAAU,SAAS,QAAQA,OACnFM,EAAQ+O,GAAM/O,OAASgP,EAAoBhP,MAC3CyO,EAASM,GAAMN,QAAUO,EAAoBhP,MAC7CuP,EAAcR,GAAMQ,aAAeP,EAAoBO,YACvDC,EAAgBT,GAAMS,eAAiBR,EAAoBQ,cAC3DC,EAASV,GAAMU,QAAUT,EAAoBS,OAC7CC,EAASX,GAAMW,QAAUV,EAAoBU,OAC7CC,EAAaZ,GAAMY,YAAcX,EAAoBW,WACrDvQ,EAAQyP,EAAQe,GAAGtC,WACnBuC,EAAYvB,GAAckB,IR5lBnB,WACb,IAEYM,EAGRC,EACAC,EANAjO,EAAK,EAAG9C,EAAK,EAAGwC,EAAK,EAAG3B,EAAK,EAC7BuD,EAAK,GACLE,EAAK,EACL7D,EAAKR,EACL+Q,EAAQxR,EAGRY,EAAQF,EACRI,EAAQD,EACR4Q,EAAa,EAEjB,SAASzC,IACP,MAAMrO,EAAQ,CAACC,MAAOA,EAAMuF,MAAM,KAAMF,WAAYnF,MAAOA,EAAMqF,MAAM,KAAMF,YAO7E,OAoDF,UAA0B,MAACrF,EAAK,MAAEE,IAChC,IAAK,MAAOpB,EAAGO,KAASW,EAAM8Q,UAC5BzR,EAAKK,MAAQZ,EACbO,EAAKC,YAAc,GACnBD,EAAKuB,YAAc,GAErB,MAAMR,EAAW,IAAIoN,IAAIxN,EAAMc,KAAI,CAAC1C,EAAGU,IAAM,CAACuB,EAAGjC,EAAGU,EAAGkB,GAAQ5B,MAC/D,IAAK,MAAOU,EAAG4B,KAASR,EAAM4Q,UAAW,CACvCpQ,EAAKhB,MAAQZ,EACb,IAAI,OAACW,EAAM,OAAEP,GAAUwB,EACD,iBAAXjB,IAAqBA,EAASiB,EAAKjB,OAASU,EAAKC,EAAUX,IAChD,iBAAXP,IAAqBA,EAASwB,EAAKxB,OAASiB,EAAKC,EAAUlB,IACtEO,EAAOH,YAAYwJ,KAAKpI,GACxBxB,EAAO0B,YAAYkI,KAAKpI,EAC1B,CACA,GAAgB,MAAZiQ,EACF,IAAK,MAAM,YAACrR,EAAW,YAAEsB,KAAgBZ,EACvCV,EAAYoR,KAAKC,GACjB/P,EAAY8P,KAAKC,EAGvB,CA/EEI,CAAiBhR,GAiFnB,UAA2B,MAACC,IAC1B,IAAK,MAAMX,KAAQW,EACjBX,EAAKV,WAA4BqS,IAApB3R,EAAK4R,WACZlQ,KAAKnC,IAAII,EAAIK,EAAKC,YAAaX,GAAQK,EAAIK,EAAKuB,YAAajC,IAC7DU,EAAK4R,UAEf,CAtFEC,CAAkBnR,GAwFpB,UAA2B,MAACC,IAC1B,MAAMnB,EAAImB,EAAM7B,OAChB,IAAIgT,EAAU,IAAIC,IAAIpR,GAClBgM,EAAO,IAAIoF,IACX/S,EAAI,EACR,KAAO8S,EAAQE,MAAM,CACnB,IAAK,MAAMhS,KAAQ8R,EAAS,CAC1B9R,EAAKF,MAAQd,EACb,IAAK,MAAM,OAACa,KAAWG,EAAKC,YAC1B0M,EAAKsF,IAAIpS,EAEb,CACA,KAAMb,EAAIQ,EAAG,MAAM,IAAI0B,MAAM,iBAC7B4Q,EAAUnF,EACVA,EAAO,IAAIoF,GACb,CACF,CAvGEG,CAAkBxR,GAyGpB,UAA4B,MAACC,IAC3B,MAAMnB,EAAImB,EAAM7B,OAChB,IAAIgT,EAAU,IAAIC,IAAIpR,GAClBgM,EAAO,IAAIoF,IACX/S,EAAI,EACR,KAAO8S,EAAQE,MAAM,CACnB,IAAK,MAAMhS,KAAQ8R,EAAS,CAC1B9R,EAAK+P,OAAS/Q,EACd,IAAK,MAAM,OAACoB,KAAWJ,EAAKuB,YAC1BoL,EAAKsF,IAAI7R,EAEb,CACA,KAAMpB,EAAIQ,EAAG,MAAM,IAAI0B,MAAM,iBAC7B4Q,EAAUnF,EACVA,EAAO,IAAIoF,GACb,CACF,CAxHEI,CAAmBzR,GAkKrB,SAA6BA,GAC3B,MAAM0R,EAzCR,UAA2B,MAACzR,IAC1B,MAAM3B,EAAIO,EAAIoB,GAAO5B,GAAKA,EAAEe,QAAS,EAC/BuS,GAAMtP,EAAKM,EAAKsB,IAAO3F,EAAI,GAC3BoT,EAAU,IAAIlT,MAAMF,GAC1B,IAAK,MAAMgB,KAAQW,EAAO,CACxB,MAAMlB,EAAIiC,KAAKnC,IAAI,EAAGmC,KAAKhC,IAAIV,EAAI,EAAG0C,KAAK4Q,MAAMf,EAAMxL,KAAK,KAAM/F,EAAMhB,MACxEgB,EAAKuS,MAAQ9S,EACbO,EAAKqD,GAAKA,EAAK5D,EAAI4S,EACnBrS,EAAK+C,GAAK/C,EAAKqD,GAAKsB,EAChByN,EAAQ3S,GAAI2S,EAAQ3S,GAAGgK,KAAKzJ,GAC3BoS,EAAQ3S,GAAK,CAACO,EACrB,CACA,GAAIqR,EAAM,IAAK,MAAMmB,KAAUJ,EAC7BI,EAAOnB,KAAKA,GAEd,OAAOe,CACT,CAyBkBK,CAAkB/R,GAClC0Q,EAAK1P,KAAKhC,IAAImF,GAAKzD,EAAKb,IAAOhB,EAAI6S,GAASvF,GAAKA,EAAE/N,SAAU,IAxB/D,SAAgCsT,GAC9B,MAAMM,EAAKhT,EAAI0S,GAASvF,IAAMzL,EAAKb,GAAMsM,EAAE/N,OAAS,GAAKsS,GAAMzR,EAAIkN,EAAGvN,KACtE,IAAK,MAAMqB,KAASyR,EAAS,CAC3B,IAAIzP,EAAIpC,EACR,IAAK,MAAMP,KAAQW,EAAO,CACxBX,EAAKO,GAAKoC,EACV3C,EAAKoB,GAAKuB,EAAI3C,EAAKV,MAAQoT,EAC3B/P,EAAI3C,EAAKoB,GAAKgQ,EACd,IAAK,MAAM/P,KAAQrB,EAAKC,YACtBoB,EAAKC,MAAQD,EAAK/B,MAAQoT,CAE9B,CACA/P,GAAKvB,EAAKuB,EAAIyO,IAAOzQ,EAAM7B,OAAS,GACpC,IAAK,IAAIW,EAAI,EAAGA,EAAIkB,EAAM7B,SAAUW,EAAG,CACrC,MAAMO,EAAOW,EAAMlB,GACnBO,EAAKO,IAAMoC,GAAKlD,EAAI,GACpBO,EAAKoB,IAAMuB,GAAKlD,EAAI,EACtB,CACAkT,EAAahS,EACf,CACF,CAKEiS,CAAuBR,GACvB,IAAK,IAAI3S,EAAI,EAAGA,EAAI+R,IAAc/R,EAAG,CACnC,MAAMoT,EAAQnR,KAAKoR,IAAI,IAAMrT,GACvBsT,EAAOrR,KAAKnC,IAAI,EAAIsT,GAAQpT,EAAI,GAAK+R,GAC3CwB,EAAiBZ,EAASS,EAAOE,GACjCE,EAAiBb,EAASS,EAAOE,EACnC,CACF,CA3KEG,CAAoBxS,GACpBS,EAAoBT,GACbA,CACT,CA2KA,SAASuS,EAAiBb,EAASS,EAAOE,GACxC,IAAK,IAAItT,EAAI,EAAGD,EAAI4S,EAAQtT,OAAQW,EAAID,IAAKC,EAAG,CAC9C,MAAM+S,EAASJ,EAAQ3S,GACvB,IAAK,MAAMI,KAAU2S,EAAQ,CAC3B,IAAI7P,EAAI,EACJuC,EAAI,EACR,IAAK,MAAM,OAAC9E,EAAM,MAAEd,KAAUO,EAAO0B,YAAa,CAChD,IAAIgF,EAAIjH,GAASO,EAAO0S,MAAQnS,EAAOmS,OACvC5P,GAAKwQ,EAAU/S,EAAQP,GAAU0G,EACjCrB,GAAKqB,CACP,CACA,KAAMrB,EAAI,GAAI,SACd,IAAIL,GAAMlC,EAAIuC,EAAIrF,EAAOU,IAAMsS,EAC/BhT,EAAOU,IAAMsE,EACbhF,EAAOuB,IAAMyD,EACbuO,EAAiBvT,EACnB,MACa8R,IAATN,GAAoBmB,EAAOnB,KAAKlR,GACpCkT,EAAkBb,EAAQO,EAC5B,CACF,CAGA,SAASC,EAAiBZ,EAASS,EAAOE,GACxC,IAAK,IAAwBtT,EAAhB2S,EAAQtT,OAAgB,EAAGW,GAAK,IAAKA,EAAG,CACnD,MAAM+S,EAASJ,EAAQ3S,GACvB,IAAK,MAAMW,KAAUoS,EAAQ,CAC3B,IAAI7P,EAAI,EACJuC,EAAI,EACR,IAAK,MAAM,OAACrF,EAAM,MAAEP,KAAUc,EAAOH,YAAa,CAChD,IAAIsG,EAAIjH,GAASO,EAAO0S,MAAQnS,EAAOmS,OACvC5P,GAAK2Q,EAAUlT,EAAQP,GAAU0G,EACjCrB,GAAKqB,CACP,CACA,KAAMrB,EAAI,GAAI,SACd,IAAIL,GAAMlC,EAAIuC,EAAI9E,EAAOG,IAAMsS,EAC/BzS,EAAOG,IAAMsE,EACbzE,EAAOgB,IAAMyD,EACbuO,EAAiBhT,EACnB,MACauR,IAATN,GAAoBmB,EAAOnB,KAAKlR,GACpCkT,EAAkBb,EAAQO,EAC5B,CACF,CAEA,SAASM,EAAkB1S,EAAOkS,GAChC,MAAMpT,EAAIkB,EAAM7B,QAAU,EACpByU,EAAU5S,EAAMlB,GACtB+T,EAA6B7S,EAAO4S,EAAQhT,GAAK6Q,EAAI3R,EAAI,EAAGoT,GAC5DY,EAA6B9S,EAAO4S,EAAQnS,GAAKgQ,EAAI3R,EAAI,EAAGoT,GAC5DW,EAA6B7S,EAAOS,EAAIT,EAAM7B,OAAS,EAAG+T,GAC1DY,EAA6B9S,EAAOJ,EAAI,EAAGsS,EAC7C,CAGA,SAASY,EAA6B9S,EAAOgC,EAAGlD,EAAGoT,GACjD,KAAOpT,EAAIkB,EAAM7B,SAAUW,EAAG,CAC5B,MAAMO,EAAOW,EAAMlB,GACboF,GAAMlC,EAAI3C,EAAKO,IAAMsS,EACvBhO,EAAK,OAAM7E,EAAKO,IAAMsE,EAAI7E,EAAKoB,IAAMyD,GACzClC,EAAI3C,EAAKoB,GAAKgQ,CAChB,CACF,CAGA,SAASoC,EAA6B7S,EAAOgC,EAAGlD,EAAGoT,GACjD,KAAOpT,GAAK,IAAKA,EAAG,CAClB,MAAMO,EAAOW,EAAMlB,GACboF,GAAM7E,EAAKoB,GAAKuB,GAAKkQ,EACvBhO,EAAK,OAAM7E,EAAKO,IAAMsE,EAAI7E,EAAKoB,IAAMyD,GACzClC,EAAI3C,EAAKO,GAAK6Q,CAChB,CACF,CAEA,SAASgC,GAAiB,YAACnT,EAAW,YAAEsB,IACtC,QAAiBoQ,IAAbL,EAAwB,CAC1B,IAAK,MAAOlR,QAAQ,YAACH,MAAiBsB,EACpCtB,EAAYoR,KAAK/Q,GAEnB,IAAK,MAAOT,QAAQ,YAAC0B,MAAiBtB,EACpCsB,EAAY8P,KAAKnR,EAErB,CACF,CAEA,SAASyS,EAAahS,GACpB,QAAiBgR,IAAbL,EACF,IAAK,MAAM,YAACrR,EAAW,YAAEsB,KAAgBZ,EACvCV,EAAYoR,KAAK/Q,GACjBiB,EAAY8P,KAAKnR,EAGvB,CAGA,SAASiT,EAAU/S,EAAQP,GACzB,IAAI8C,EAAIvC,EAAOG,IAAMH,EAAOH,YAAYnB,OAAS,GAAKsS,EAAK,EAC3D,IAAK,MAAOvR,OAAQG,EAAI,MAAEsB,KAAUlB,EAAOH,YAAa,CACtD,GAAID,IAASH,EAAQ,MACrB8C,GAAKrB,EAAQ8P,CACf,CACA,IAAK,MAAOhR,OAAQJ,EAAI,MAAEsB,KAAUzB,EAAO0B,YAAa,CACtD,GAAIvB,IAASI,EAAQ,MACrBuC,GAAKrB,CACP,CACA,OAAOqB,CACT,CAGA,SAAS2Q,EAAUlT,EAAQP,GACzB,IAAI8C,EAAI9C,EAAOU,IAAMV,EAAO0B,YAAYzC,OAAS,GAAKsS,EAAK,EAC3D,IAAK,MAAOhR,OAAQJ,EAAI,MAAEsB,KAAUzB,EAAO0B,YAAa,CACtD,GAAIvB,IAASI,EAAQ,MACrBuC,GAAKrB,EAAQ8P,CACf,CACA,IAAK,MAAOvR,OAAQG,EAAI,MAAEsB,KAAUlB,EAAOH,YAAa,CACtD,GAAID,IAASH,EAAQ,MACrB8C,GAAKrB,CACP,CACA,OAAOqB,CACT,CAEA,OAnSAoM,EAAO2E,OAAS,SAAShT,GAEvB,OADAS,EAAoBT,GACbA,CACT,EAEAqO,EAAO4E,OAAS,SAASpR,GACvB,OAAOyD,UAAUlH,QAAUkC,EAAkB,mBAANuB,EAAmBA,EAAI,EAASA,GAAIwM,GAAU/N,CACvF,EAEA+N,EAAOoC,UAAY,SAAS5O,GAC1B,OAAOyD,UAAUlH,QAAUyS,EAAqB,mBAANhP,EAAmBA,EAAI,EAASA,GAAIwM,GAAUwC,CAC1F,EAEAxC,EAAO6E,SAAW,SAASrR,GACzB,OAAOyD,UAAUlH,QAAUuS,EAAO9O,EAAGwM,GAAUsC,CACjD,EAEAtC,EAAO8E,UAAY,SAAStR,GAC1B,OAAOyD,UAAUlH,QAAU6F,GAAMpC,EAAGwM,GAAUpK,CAChD,EAEAoK,EAAO+E,YAAc,SAASvR,GAC5B,OAAOyD,UAAUlH,QAAU+F,EAAKuM,GAAM7O,EAAGwM,GAAUlK,CACrD,EAEAkK,EAAOpO,MAAQ,SAAS4B,GACtB,OAAOyD,UAAUlH,QAAU6B,EAAqB,mBAAN4B,EAAmBA,EAAI,EAASA,GAAIwM,GAAUpO,CAC1F,EAEAoO,EAAOlO,MAAQ,SAAS0B,GACtB,OAAOyD,UAAUlH,QAAU+B,EAAqB,mBAAN0B,EAAmBA,EAAI,EAASA,GAAIwM,GAAUlO,CAC1F,EAEAkO,EAAOuC,SAAW,SAAS/O,GACzB,OAAOyD,UAAUlH,QAAUwS,EAAW/O,EAAGwM,GAAUuC,CACrD,EAEAvC,EAAOiD,KAAO,SAASzP,GACrB,OAAOyD,UAAUlH,QAAUuE,EAAK9C,EAAK,EAAGwC,GAAMR,EAAE,GAAInB,GAAMmB,EAAE,GAAIwM,GAAU,CAAChM,EAAKM,EAAIjC,EAAKb,EAC3F,EAEAwO,EAAOgF,OAAS,SAASxR,GACvB,OAAOyD,UAAUlH,QAAUuE,GAAMd,EAAE,GAAG,GAAIQ,GAAMR,EAAE,GAAG,GAAIhC,GAAMgC,EAAE,GAAG,GAAInB,GAAMmB,EAAE,GAAG,GAAIwM,GAAU,CAAC,CAAC1L,EAAI9C,GAAK,CAACwC,EAAI3B,GACnH,EAEA2N,EAAOyC,WAAa,SAASjP,GAC3B,OAAOyD,UAAUlH,QAAU0S,GAAcjP,EAAGwM,GAAUyC,CACxD,EAoPOzC,CACT,EQmSiB,GAAW4E,QAAQ5U,GAAMA,EAAEiC,KAAI6S,UAD5B,IACiDC,YAAY,IAAM7C,EAAa,GAAK,IAAIE,UAAUA,GAAW4C,OAAO,CACrI,CAAC,EAAG,GACJ,CAACzS,EAAOyO,IAEVhB,CAAOrO,GACP,MAAMsT,GAAc,SAAe,MACnCrD,EAAIsD,OAAO,KAAKC,KAAK,QAAS,SAASC,UAAU,SAASC,KAAK1T,EAAMC,OAAO+J,KAAK,KAAKwJ,KAAK,QAAS,QAAQA,KAAK,MAAOnV,IAAOA,EAAEsV,IAAM9E,GAAI5C,KAAK,UAAU3L,KAAIkT,KAAK,aAAa,SAASnV,GACvL,MAAO,aAAeA,EAAEsE,GAAK,IAAMtE,EAAEwB,GAAK,GAC5C,IAAG2T,KAAK,KAAMnV,GAAMA,EAAEsE,KAAI6Q,KAAK,KAAMnV,GAAMA,EAAEwB,KAAI0T,OAAO,QAAQC,KAAK,UAAWnV,GACvEA,EAAEqC,GAAKrC,EAAEwB,KACf2T,KAAK,SAAUnV,GAAMA,EAAEgE,GAAKhE,EAAEsE,KAAI6Q,KAAK,QAASnV,GAAMiV,EAAYjV,EAAEiC,MACvE,MAAMsT,GAA0B,SAAO,EAAGtT,GAAIuT,EAAKjV,WAC5C2R,EAGE,GAAGsD,MACZxD,IAASrP,KAAK8S,MAAc,IAARlV,GAAe,MAAM0R,IAH9BuD,GAIR,WACH5D,EAAIsD,OAAO,KAAKC,KAAK,QAAS,eAAeA,KAAK,cAAe,cAAcA,KAAK,YAAa,IAAIC,UAAU,QAAQC,KAAK1T,EAAMC,OAAO+J,KAAK,QAAQwJ,KAAK,KAAMnV,GAAMA,EAAEsE,GAAK/B,EAAQ,EAAIvC,EAAEgE,GAAK,EAAIhE,EAAEsE,GAAK,IAAG6Q,KAAK,KAAMnV,IAAOA,EAAEqC,GAAKrC,EAAEwB,IAAM,IAAG2T,KAAK,MAASjD,EAAa,IAAM,QAAtB,MAAkCiD,KAAK,eAAgBnV,GAAMA,EAAEsE,GAAK/B,EAAQ,EAAI,QAAU,QAAOqJ,KAAK2J,GACpW,MAAMjT,EAAOsP,EAAIsD,OAAO,KAAKC,KAAK,QAAS,SAASA,KAAK,OAAQ,QAAQA,KAAK,iBAAkB,IAAKC,UAAU,SAASC,KAAK1T,EAAMG,OAAO6J,KAAK,KAAKwJ,KAAK,QAAS,QAAQO,MAAM,iBAAkB,YAC5LC,EAAYrE,GAAMqE,WAAa,WACrC,GAAkB,aAAdA,EAA0B,CAC5B,MAAMC,EAAWtT,EAAK4S,OAAO,kBAAkBC,KAAK,MAAOnV,IAAOA,EAAEsV,IAAM9E,GAAI5C,KAAK,oBAAoB3L,KAAIkT,KAAK,gBAAiB,kBAAkBA,KAAK,MAAOnV,GAAMA,EAAEqB,OAAO2C,KAAImR,KAAK,MAAOnV,GAAMA,EAAEc,OAAOwD,KAC7MsR,EAASV,OAAO,QAAQC,KAAK,SAAU,MAAMA,KAAK,cAAenV,GAAMiV,EAAYjV,EAAEqB,OAAOY,MAC5F2T,EAASV,OAAO,QAAQC,KAAK,SAAU,QAAQA,KAAK,cAAenV,GAAMiV,EAAYjV,EAAEc,OAAOmB,KAChG,CACA,IAAI4T,EACJ,OAAQF,GACN,IAAK,WACHE,GAA2B,SAAQ7V,GAAMA,EAAEsV,KAAK,YAChD,MACF,IAAK,SACHO,GAA2B,SAAQ7V,GAAMiV,EAAYjV,EAAEqB,OAAOY,KAAK,YACnE,MACF,IAAK,SACH4T,GAA2B,SAAQ7V,GAAMiV,EAAYjV,EAAEc,OAAOmB,KAAK,YACnE,MACF,QACE4T,EAAWF,EAEfrT,EAAK4S,OAAO,QAAQC,KAAK,IAAK,KAA0BA,KAAK,SAAUU,GAAUV,KAAK,gBAAiBnV,GAAM2C,KAAKnC,IAAI,EAAGR,EAAEuC,UAC3H,aAAkB,EAAQqP,EAAK,EAAGE,EACpC,GAAG,QACCgE,GAAyB,CAC3B5E,SAIE6E,IAAwC,SAAQnK,GAC9BA,EAAK/C,WAAW,2BAA4B,IAAIA,WAAW,aAAc,MAAMD,QAElG,yBAGCoN,GAAgB9G,EAAe1F,MAAMyM,KAAK/G,GAC9CA,EAAe1F,MAASoC,GAASoK,GAAcD,GAAsBnK,IACrE,IAAIsK,GAAU,CACZ7O,OAAQ6H,EACRiD,GAAIrC,GACJqG,SAAUL,G","sources":["webpack:///./node_modules/d3-array/src/bisector.js","webpack:///./node_modules/d3-array/src/ascending.js","webpack:///./node_modules/d3-array/src/bisect.js","webpack:///./node_modules/d3-array/src/array.js","webpack:///./node_modules/d3-array/src/max.js","webpack:///./node_modules/d3-array/src/min.js","webpack:///./node_modules/d3-array/src/sum.js","webpack:///./node_modules/d3-sankey/src/align.js","webpack:///./node_modules/d3-sankey/src/constant.js","webpack:///./node_modules/d3-sankey/src/sankey.js","webpack:///./node_modules/d3-array/src/ticks.js","webpack:///./node_modules/d3-sankey/node_modules/d3-path/src/path.js","webpack:///./node_modules/d3-sankey/node_modules/d3-shape/src/array.js","webpack:///./node_modules/d3-sankey/node_modules/d3-shape/src/constant.js","webpack:///./node_modules/d3-sankey/node_modules/d3-shape/src/point.js","webpack:///./node_modules/d3-sankey/node_modules/d3-shape/src/link/index.js","webpack:///./node_modules/d3-sankey/src/sankeyLinkHorizontal.js","webpack:///./node_modules/mermaid/dist/chunks/mermaid.core/sankeyDiagram-Y46BX6SQ.mjs"],"sourcesContent":["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(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","var array = Array.prototype;\n\nexport var slice = array.slice;\nexport var map = array.map;\n","export default function(values, valueof) {\n  var n = values.length,\n      i = -1,\n      value,\n      max;\n\n  if (valueof == null) {\n    while (++i < n) { // Find the first comparable value.\n      if ((value = values[i]) != null && value >= value) {\n        max = value;\n        while (++i < n) { // Compare the remaining values.\n          if ((value = values[i]) != null && value > max) {\n            max = value;\n          }\n        }\n      }\n    }\n  }\n\n  else {\n    while (++i < n) { // Find the first comparable value.\n      if ((value = valueof(values[i], i, values)) != null && value >= value) {\n        max = value;\n        while (++i < n) { // Compare the remaining values.\n          if ((value = valueof(values[i], i, values)) != null && value > max) {\n            max = value;\n          }\n        }\n      }\n    }\n  }\n\n  return max;\n}\n","export default function(values, valueof) {\n  var n = values.length,\n      i = -1,\n      value,\n      min;\n\n  if (valueof == null) {\n    while (++i < n) { // Find the first comparable value.\n      if ((value = values[i]) != null && value >= value) {\n        min = value;\n        while (++i < n) { // Compare the remaining values.\n          if ((value = values[i]) != null && min > value) {\n            min = value;\n          }\n        }\n      }\n    }\n  }\n\n  else {\n    while (++i < n) { // Find the first comparable value.\n      if ((value = valueof(values[i], i, values)) != null && value >= value) {\n        min = value;\n        while (++i < n) { // Compare the remaining values.\n          if ((value = valueof(values[i], i, values)) != null && min > value) {\n            min = value;\n          }\n        }\n      }\n    }\n  }\n\n  return min;\n}\n","export default function(values, valueof) {\n  var n = values.length,\n      i = -1,\n      value,\n      sum = 0;\n\n  if (valueof == null) {\n    while (++i < n) {\n      if (value = +values[i]) sum += value; // Note: zero and null are equivalent.\n    }\n  }\n\n  else {\n    while (++i < n) {\n      if (value = +valueof(values[i], i, values)) sum += value;\n    }\n  }\n\n  return sum;\n}\n","import {min} from \"d3-array\";\n\nfunction targetDepth(d) {\n  return d.target.depth;\n}\n\nexport function left(node) {\n  return node.depth;\n}\n\nexport function right(node, n) {\n  return n - 1 - node.height;\n}\n\nexport function justify(node, n) {\n  return node.sourceLinks.length ? node.depth : n - 1;\n}\n\nexport function center(node) {\n  return node.targetLinks.length ? node.depth\n      : node.sourceLinks.length ? min(node.sourceLinks, targetDepth) - 1\n      : 0;\n}\n","export default function constant(x) {\n  return function() {\n    return x;\n  };\n}\n","import {max, min, sum} from \"d3-array\";\nimport {justify} from \"./align.js\";\nimport constant from \"./constant.js\";\n\nfunction ascendingSourceBreadth(a, b) {\n  return ascendingBreadth(a.source, b.source) || a.index - b.index;\n}\n\nfunction ascendingTargetBreadth(a, b) {\n  return ascendingBreadth(a.target, b.target) || a.index - b.index;\n}\n\nfunction ascendingBreadth(a, b) {\n  return a.y0 - b.y0;\n}\n\nfunction value(d) {\n  return d.value;\n}\n\nfunction defaultId(d) {\n  return d.index;\n}\n\nfunction defaultNodes(graph) {\n  return graph.nodes;\n}\n\nfunction defaultLinks(graph) {\n  return graph.links;\n}\n\nfunction find(nodeById, id) {\n  const node = nodeById.get(id);\n  if (!node) throw new Error(\"missing: \" + id);\n  return node;\n}\n\nfunction computeLinkBreadths({nodes}) {\n  for (const node of nodes) {\n    let y0 = node.y0;\n    let y1 = y0;\n    for (const link of node.sourceLinks) {\n      link.y0 = y0 + link.width / 2;\n      y0 += link.width;\n    }\n    for (const link of node.targetLinks) {\n      link.y1 = y1 + link.width / 2;\n      y1 += link.width;\n    }\n  }\n}\n\nexport default function Sankey() {\n  let x0 = 0, y0 = 0, x1 = 1, y1 = 1; // extent\n  let dx = 24; // nodeWidth\n  let dy = 8, py; // nodePadding\n  let id = defaultId;\n  let align = justify;\n  let sort;\n  let linkSort;\n  let nodes = defaultNodes;\n  let links = defaultLinks;\n  let iterations = 6;\n\n  function sankey() {\n    const graph = {nodes: nodes.apply(null, arguments), links: links.apply(null, arguments)};\n    computeNodeLinks(graph);\n    computeNodeValues(graph);\n    computeNodeDepths(graph);\n    computeNodeHeights(graph);\n    computeNodeBreadths(graph);\n    computeLinkBreadths(graph);\n    return graph;\n  }\n\n  sankey.update = function(graph) {\n    computeLinkBreadths(graph);\n    return graph;\n  };\n\n  sankey.nodeId = function(_) {\n    return arguments.length ? (id = typeof _ === \"function\" ? _ : constant(_), sankey) : id;\n  };\n\n  sankey.nodeAlign = function(_) {\n    return arguments.length ? (align = typeof _ === \"function\" ? _ : constant(_), sankey) : align;\n  };\n\n  sankey.nodeSort = function(_) {\n    return arguments.length ? (sort = _, sankey) : sort;\n  };\n\n  sankey.nodeWidth = function(_) {\n    return arguments.length ? (dx = +_, sankey) : dx;\n  };\n\n  sankey.nodePadding = function(_) {\n    return arguments.length ? (dy = py = +_, sankey) : dy;\n  };\n\n  sankey.nodes = function(_) {\n    return arguments.length ? (nodes = typeof _ === \"function\" ? _ : constant(_), sankey) : nodes;\n  };\n\n  sankey.links = function(_) {\n    return arguments.length ? (links = typeof _ === \"function\" ? _ : constant(_), sankey) : links;\n  };\n\n  sankey.linkSort = function(_) {\n    return arguments.length ? (linkSort = _, sankey) : linkSort;\n  };\n\n  sankey.size = function(_) {\n    return arguments.length ? (x0 = y0 = 0, x1 = +_[0], y1 = +_[1], sankey) : [x1 - x0, y1 - y0];\n  };\n\n  sankey.extent = function(_) {\n    return arguments.length ? (x0 = +_[0][0], x1 = +_[1][0], y0 = +_[0][1], y1 = +_[1][1], sankey) : [[x0, y0], [x1, y1]];\n  };\n\n  sankey.iterations = function(_) {\n    return arguments.length ? (iterations = +_, sankey) : iterations;\n  };\n\n  function computeNodeLinks({nodes, links}) {\n    for (const [i, node] of nodes.entries()) {\n      node.index = i;\n      node.sourceLinks = [];\n      node.targetLinks = [];\n    }\n    const nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d]));\n    for (const [i, link] of links.entries()) {\n      link.index = i;\n      let {source, target} = link;\n      if (typeof source !== \"object\") source = link.source = find(nodeById, source);\n      if (typeof target !== \"object\") target = link.target = find(nodeById, target);\n      source.sourceLinks.push(link);\n      target.targetLinks.push(link);\n    }\n    if (linkSort != null) {\n      for (const {sourceLinks, targetLinks} of nodes) {\n        sourceLinks.sort(linkSort);\n        targetLinks.sort(linkSort);\n      }\n    }\n  }\n\n  function computeNodeValues({nodes}) {\n    for (const node of nodes) {\n      node.value = node.fixedValue === undefined\n          ? Math.max(sum(node.sourceLinks, value), sum(node.targetLinks, value))\n          : node.fixedValue;\n    }\n  }\n\n  function computeNodeDepths({nodes}) {\n    const n = nodes.length;\n    let current = new Set(nodes);\n    let next = new Set;\n    let x = 0;\n    while (current.size) {\n      for (const node of current) {\n        node.depth = x;\n        for (const {target} of node.sourceLinks) {\n          next.add(target);\n        }\n      }\n      if (++x > n) throw new Error(\"circular link\");\n      current = next;\n      next = new Set;\n    }\n  }\n\n  function computeNodeHeights({nodes}) {\n    const n = nodes.length;\n    let current = new Set(nodes);\n    let next = new Set;\n    let x = 0;\n    while (current.size) {\n      for (const node of current) {\n        node.height = x;\n        for (const {source} of node.targetLinks) {\n          next.add(source);\n        }\n      }\n      if (++x > n) throw new Error(\"circular link\");\n      current = next;\n      next = new Set;\n    }\n  }\n\n  function computeNodeLayers({nodes}) {\n    const x = max(nodes, d => d.depth) + 1;\n    const kx = (x1 - x0 - dx) / (x - 1);\n    const columns = new Array(x);\n    for (const node of nodes) {\n      const i = Math.max(0, Math.min(x - 1, Math.floor(align.call(null, node, x))));\n      node.layer = i;\n      node.x0 = x0 + i * kx;\n      node.x1 = node.x0 + dx;\n      if (columns[i]) columns[i].push(node);\n      else columns[i] = [node];\n    }\n    if (sort) for (const column of columns) {\n      column.sort(sort);\n    }\n    return columns;\n  }\n\n  function initializeNodeBreadths(columns) {\n    const ky = min(columns, c => (y1 - y0 - (c.length - 1) * py) / sum(c, value));\n    for (const nodes of columns) {\n      let y = y0;\n      for (const node of nodes) {\n        node.y0 = y;\n        node.y1 = y + node.value * ky;\n        y = node.y1 + py;\n        for (const link of node.sourceLinks) {\n          link.width = link.value * ky;\n        }\n      }\n      y = (y1 - y + py) / (nodes.length + 1);\n      for (let i = 0; i < nodes.length; ++i) {\n        const node = nodes[i];\n        node.y0 += y * (i + 1);\n        node.y1 += y * (i + 1);\n      }\n      reorderLinks(nodes);\n    }\n  }\n\n  function computeNodeBreadths(graph) {\n    const columns = computeNodeLayers(graph);\n    py = Math.min(dy, (y1 - y0) / (max(columns, c => c.length) - 1));\n    initializeNodeBreadths(columns);\n    for (let i = 0; i < iterations; ++i) {\n      const alpha = Math.pow(0.99, i);\n      const beta = Math.max(1 - alpha, (i + 1) / iterations);\n      relaxRightToLeft(columns, alpha, beta);\n      relaxLeftToRight(columns, alpha, beta);\n    }\n  }\n\n  // Reposition each node based on its incoming (target) links.\n  function relaxLeftToRight(columns, alpha, beta) {\n    for (let i = 1, n = columns.length; i < n; ++i) {\n      const column = columns[i];\n      for (const target of column) {\n        let y = 0;\n        let w = 0;\n        for (const {source, value} of target.targetLinks) {\n          let v = value * (target.layer - source.layer);\n          y += targetTop(source, target) * v;\n          w += v;\n        }\n        if (!(w > 0)) continue;\n        let dy = (y / w - target.y0) * alpha;\n        target.y0 += dy;\n        target.y1 += dy;\n        reorderNodeLinks(target);\n      }\n      if (sort === undefined) column.sort(ascendingBreadth);\n      resolveCollisions(column, beta);\n    }\n  }\n\n  // Reposition each node based on its outgoing (source) links.\n  function relaxRightToLeft(columns, alpha, beta) {\n    for (let n = columns.length, i = n - 2; i >= 0; --i) {\n      const column = columns[i];\n      for (const source of column) {\n        let y = 0;\n        let w = 0;\n        for (const {target, value} of source.sourceLinks) {\n          let v = value * (target.layer - source.layer);\n          y += sourceTop(source, target) * v;\n          w += v;\n        }\n        if (!(w > 0)) continue;\n        let dy = (y / w - source.y0) * alpha;\n        source.y0 += dy;\n        source.y1 += dy;\n        reorderNodeLinks(source);\n      }\n      if (sort === undefined) column.sort(ascendingBreadth);\n      resolveCollisions(column, beta);\n    }\n  }\n\n  function resolveCollisions(nodes, alpha) {\n    const i = nodes.length >> 1;\n    const subject = nodes[i];\n    resolveCollisionsBottomToTop(nodes, subject.y0 - py, i - 1, alpha);\n    resolveCollisionsTopToBottom(nodes, subject.y1 + py, i + 1, alpha);\n    resolveCollisionsBottomToTop(nodes, y1, nodes.length - 1, alpha);\n    resolveCollisionsTopToBottom(nodes, y0, 0, alpha);\n  }\n\n  // Push any overlapping nodes down.\n  function resolveCollisionsTopToBottom(nodes, y, i, alpha) {\n    for (; i < nodes.length; ++i) {\n      const node = nodes[i];\n      const dy = (y - node.y0) * alpha;\n      if (dy > 1e-6) node.y0 += dy, node.y1 += dy;\n      y = node.y1 + py;\n    }\n  }\n\n  // Push any overlapping nodes up.\n  function resolveCollisionsBottomToTop(nodes, y, i, alpha) {\n    for (; i >= 0; --i) {\n      const node = nodes[i];\n      const dy = (node.y1 - y) * alpha;\n      if (dy > 1e-6) node.y0 -= dy, node.y1 -= dy;\n      y = node.y0 - py;\n    }\n  }\n\n  function reorderNodeLinks({sourceLinks, targetLinks}) {\n    if (linkSort === undefined) {\n      for (const {source: {sourceLinks}} of targetLinks) {\n        sourceLinks.sort(ascendingTargetBreadth);\n      }\n      for (const {target: {targetLinks}} of sourceLinks) {\n        targetLinks.sort(ascendingSourceBreadth);\n      }\n    }\n  }\n\n  function reorderLinks(nodes) {\n    if (linkSort === undefined) {\n      for (const {sourceLinks, targetLinks} of nodes) {\n        sourceLinks.sort(ascendingTargetBreadth);\n        targetLinks.sort(ascendingSourceBreadth);\n      }\n    }\n  }\n\n  // Returns the target.y0 that would produce an ideal link from source to target.\n  function targetTop(source, target) {\n    let y = source.y0 - (source.sourceLinks.length - 1) * py / 2;\n    for (const {target: node, width} of source.sourceLinks) {\n      if (node === target) break;\n      y += width + py;\n    }\n    for (const {source: node, width} of target.targetLinks) {\n      if (node === source) break;\n      y -= width;\n    }\n    return y;\n  }\n\n  // Returns the source.y0 that would produce an ideal link from source to target.\n  function sourceTop(source, target) {\n    let y = target.y0 - (target.targetLinks.length - 1) * py / 2;\n    for (const {source: node, width} of target.targetLinks) {\n      if (node === source) break;\n      y += width + py;\n    }\n    for (const {target: node, width} of source.sourceLinks) {\n      if (node === target) break;\n      y -= width;\n    }\n    return y;\n  }\n\n  return sankey;\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","var pi = Math.PI,\n    tau = 2 * pi,\n    epsilon = 1e-6,\n    tauEpsilon = tau - epsilon;\n\nfunction Path() {\n  this._x0 = this._y0 = // start of current subpath\n  this._x1 = this._y1 = null; // end of current subpath\n  this._ = \"\";\n}\n\nfunction path() {\n  return new Path;\n}\n\nPath.prototype = path.prototype = {\n  constructor: Path,\n  moveTo: function(x, y) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y);\n  },\n  closePath: function() {\n    if (this._x1 !== null) {\n      this._x1 = this._x0, this._y1 = this._y0;\n      this._ += \"Z\";\n    }\n  },\n  lineTo: function(x, y) {\n    this._ += \"L\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  quadraticCurveTo: function(x1, y1, x, y) {\n    this._ += \"Q\" + (+x1) + \",\" + (+y1) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  bezierCurveTo: function(x1, y1, x2, y2, x, y) {\n    this._ += \"C\" + (+x1) + \",\" + (+y1) + \",\" + (+x2) + \",\" + (+y2) + \",\" + (this._x1 = +x) + \",\" + (this._y1 = +y);\n  },\n  arcTo: function(x1, y1, x2, y2, r) {\n    x1 = +x1, y1 = +y1, x2 = +x2, y2 = +y2, r = +r;\n    var x0 = this._x1,\n        y0 = this._y1,\n        x21 = x2 - x1,\n        y21 = y2 - y1,\n        x01 = x0 - x1,\n        y01 = y0 - y1,\n        l01_2 = x01 * x01 + y01 * y01;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x1,y1).\n    if (this._x1 === null) {\n      this._ += \"M\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Or, is (x1,y1) coincident with (x0,y0)? Do nothing.\n    else if (!(l01_2 > epsilon));\n\n    // Or, are (x0,y0), (x1,y1) and (x2,y2) collinear?\n    // Equivalently, is (x1,y1) coincident with (x2,y2)?\n    // Or, is the radius zero? Line to (x1,y1).\n    else if (!(Math.abs(y01 * x21 - y21 * x01) > epsilon) || !r) {\n      this._ += \"L\" + (this._x1 = x1) + \",\" + (this._y1 = y1);\n    }\n\n    // Otherwise, draw an arc!\n    else {\n      var x20 = x2 - x0,\n          y20 = y2 - y0,\n          l21_2 = x21 * x21 + y21 * y21,\n          l20_2 = x20 * x20 + y20 * y20,\n          l21 = Math.sqrt(l21_2),\n          l01 = Math.sqrt(l01_2),\n          l = r * Math.tan((pi - Math.acos((l21_2 + l01_2 - l20_2) / (2 * l21 * l01))) / 2),\n          t01 = l / l01,\n          t21 = l / l21;\n\n      // If the start tangent is not coincident with (x0,y0), line to.\n      if (Math.abs(t01 - 1) > epsilon) {\n        this._ += \"L\" + (x1 + t01 * x01) + \",\" + (y1 + t01 * y01);\n      }\n\n      this._ += \"A\" + r + \",\" + r + \",0,0,\" + (+(y01 * x20 > x01 * y20)) + \",\" + (this._x1 = x1 + t21 * x21) + \",\" + (this._y1 = y1 + t21 * y21);\n    }\n  },\n  arc: function(x, y, r, a0, a1, ccw) {\n    x = +x, y = +y, r = +r, ccw = !!ccw;\n    var dx = r * Math.cos(a0),\n        dy = r * Math.sin(a0),\n        x0 = x + dx,\n        y0 = y + dy,\n        cw = 1 ^ ccw,\n        da = ccw ? a0 - a1 : a1 - a0;\n\n    // Is the radius negative? Error.\n    if (r < 0) throw new Error(\"negative radius: \" + r);\n\n    // Is this path empty? Move to (x0,y0).\n    if (this._x1 === null) {\n      this._ += \"M\" + x0 + \",\" + y0;\n    }\n\n    // Or, is (x0,y0) not coincident with the previous point? Line to (x0,y0).\n    else if (Math.abs(this._x1 - x0) > epsilon || Math.abs(this._y1 - y0) > epsilon) {\n      this._ += \"L\" + x0 + \",\" + y0;\n    }\n\n    // Is this arc empty? We’re done.\n    if (!r) return;\n\n    // Does the angle go the wrong way? Flip the direction.\n    if (da < 0) da = da % tau + tau;\n\n    // Is this a complete circle? Draw two arcs to complete the circle.\n    if (da > tauEpsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (x - dx) + \",\" + (y - dy) + \"A\" + r + \",\" + r + \",0,1,\" + cw + \",\" + (this._x1 = x0) + \",\" + (this._y1 = y0);\n    }\n\n    // Is this arc non-empty? Draw an arc!\n    else if (da > epsilon) {\n      this._ += \"A\" + r + \",\" + r + \",0,\" + (+(da >= pi)) + \",\" + cw + \",\" + (this._x1 = x + r * Math.cos(a1)) + \",\" + (this._y1 = y + r * Math.sin(a1));\n    }\n  },\n  rect: function(x, y, w, h) {\n    this._ += \"M\" + (this._x0 = this._x1 = +x) + \",\" + (this._y0 = this._y1 = +y) + \"h\" + (+w) + \"v\" + (+h) + \"h\" + (-w) + \"Z\";\n  },\n  toString: function() {\n    return this._;\n  }\n};\n\nexport default path;\n","export var slice = Array.prototype.slice;\n","export default function(x) {\n  return function constant() {\n    return x;\n  };\n}\n","export function x(p) {\n  return p[0];\n}\n\nexport function y(p) {\n  return p[1];\n}\n","import {path} from \"d3-path\";\nimport {slice} from \"../array.js\";\nimport constant from \"../constant.js\";\nimport {x as pointX, y as pointY} from \"../point.js\";\nimport pointRadial from \"../pointRadial.js\";\n\nfunction linkSource(d) {\n  return d.source;\n}\n\nfunction linkTarget(d) {\n  return d.target;\n}\n\nfunction link(curve) {\n  var source = linkSource,\n      target = linkTarget,\n      x = pointX,\n      y = pointY,\n      context = null;\n\n  function link() {\n    var buffer, argv = slice.call(arguments), s = source.apply(this, argv), t = target.apply(this, argv);\n    if (!context) context = buffer = path();\n    curve(context, +x.apply(this, (argv[0] = s, argv)), +y.apply(this, argv), +x.apply(this, (argv[0] = t, argv)), +y.apply(this, argv));\n    if (buffer) return context = null, buffer + \"\" || null;\n  }\n\n  link.source = function(_) {\n    return arguments.length ? (source = _, link) : source;\n  };\n\n  link.target = function(_) {\n    return arguments.length ? (target = _, link) : target;\n  };\n\n  link.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), link) : x;\n  };\n\n  link.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), link) : y;\n  };\n\n  link.context = function(_) {\n    return arguments.length ? ((context = _ == null ? null : _), link) : context;\n  };\n\n  return link;\n}\n\nfunction curveHorizontal(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0 = (x0 + x1) / 2, y0, x0, y1, x1, y1);\n}\n\nfunction curveVertical(context, x0, y0, x1, y1) {\n  context.moveTo(x0, y0);\n  context.bezierCurveTo(x0, y0 = (y0 + y1) / 2, x1, y0, x1, y1);\n}\n\nfunction curveRadial(context, x0, y0, x1, y1) {\n  var p0 = pointRadial(x0, y0),\n      p1 = pointRadial(x0, y0 = (y0 + y1) / 2),\n      p2 = pointRadial(x1, y0),\n      p3 = pointRadial(x1, y1);\n  context.moveTo(p0[0], p0[1]);\n  context.bezierCurveTo(p1[0], p1[1], p2[0], p2[1], p3[0], p3[1]);\n}\n\nexport function linkHorizontal() {\n  return link(curveHorizontal);\n}\n\nexport function linkVertical() {\n  return link(curveVertical);\n}\n\nexport function linkRadial() {\n  var l = link(curveRadial);\n  l.angle = l.x, delete l.x;\n  l.radius = l.y, delete l.y;\n  return l;\n}\n","import {linkHorizontal} from \"d3-shape\";\n\nfunction horizontalSource(d) {\n  return [d.source.x1, d.y0];\n}\n\nfunction horizontalTarget(d) {\n  return [d.target.x0, d.y1];\n}\n\nexport default function() {\n  return linkHorizontal()\n      .source(horizontalSource)\n      .target(horizontalTarget);\n}\n","import {\n  __name,\n  clear,\n  common_default,\n  defaultConfig2 as defaultConfig,\n  getAccDescription,\n  getAccTitle,\n  getConfig2 as getConfig,\n  getDiagramTitle,\n  setAccDescription,\n  setAccTitle,\n  setDiagramTitle,\n  setupGraphViewbox\n} from \"./chunk-6DBFFHIP.mjs\";\n\n// src/diagrams/sankey/parser/sankey.jison\nvar parser = function() {\n  var o = /* @__PURE__ */ __name(function(k, v, o2, l) {\n    for (o2 = o2 || {}, l = k.length; l--; o2[k[l]] = v) ;\n    return o2;\n  }, \"o\"), $V0 = [1, 9], $V1 = [1, 10], $V2 = [1, 5, 10, 12];\n  var parser2 = {\n    trace: /* @__PURE__ */ __name(function trace() {\n    }, \"trace\"),\n    yy: {},\n    symbols_: { \"error\": 2, \"start\": 3, \"SANKEY\": 4, \"NEWLINE\": 5, \"csv\": 6, \"opt_eof\": 7, \"record\": 8, \"csv_tail\": 9, \"EOF\": 10, \"field[source]\": 11, \"COMMA\": 12, \"field[target]\": 13, \"field[value]\": 14, \"field\": 15, \"escaped\": 16, \"non_escaped\": 17, \"DQUOTE\": 18, \"ESCAPED_TEXT\": 19, \"NON_ESCAPED_TEXT\": 20, \"$accept\": 0, \"$end\": 1 },\n    terminals_: { 2: \"error\", 4: \"SANKEY\", 5: \"NEWLINE\", 10: \"EOF\", 11: \"field[source]\", 12: \"COMMA\", 13: \"field[target]\", 14: \"field[value]\", 18: \"DQUOTE\", 19: \"ESCAPED_TEXT\", 20: \"NON_ESCAPED_TEXT\" },\n    productions_: [0, [3, 4], [6, 2], [9, 2], [9, 0], [7, 1], [7, 0], [8, 5], [15, 1], [15, 1], [16, 3], [17, 1]],\n    performAction: /* @__PURE__ */ __name(function anonymous(yytext, yyleng, yylineno, yy, yystate, $$, _$) {\n      var $0 = $$.length - 1;\n      switch (yystate) {\n        case 7:\n          const source = yy.findOrCreateNode($$[$0 - 4].trim().replaceAll('\"\"', '\"'));\n          const target = yy.findOrCreateNode($$[$0 - 2].trim().replaceAll('\"\"', '\"'));\n          const value = parseFloat($$[$0].trim());\n          yy.addLink(source, target, value);\n          break;\n        case 8:\n        case 9:\n        case 11:\n          this.$ = $$[$0];\n          break;\n        case 10:\n          this.$ = $$[$0 - 1];\n          break;\n      }\n    }, \"anonymous\"),\n    table: [{ 3: 1, 4: [1, 2] }, { 1: [3] }, { 5: [1, 3] }, { 6: 4, 8: 5, 15: 6, 16: 7, 17: 8, 18: $V0, 20: $V1 }, { 1: [2, 6], 7: 11, 10: [1, 12] }, o($V1, [2, 4], { 9: 13, 5: [1, 14] }), { 12: [1, 15] }, o($V2, [2, 8]), o($V2, [2, 9]), { 19: [1, 16] }, o($V2, [2, 11]), { 1: [2, 1] }, { 1: [2, 5] }, o($V1, [2, 2]), { 6: 17, 8: 5, 15: 6, 16: 7, 17: 8, 18: $V0, 20: $V1 }, { 15: 18, 16: 7, 17: 8, 18: $V0, 20: $V1 }, { 18: [1, 19] }, o($V1, [2, 3]), { 12: [1, 20] }, o($V2, [2, 10]), { 15: 21, 16: 7, 17: 8, 18: $V0, 20: $V1 }, o([1, 5, 10], [2, 7])],\n    defaultActions: { 11: [2, 1], 12: [2, 5] },\n    parseError: /* @__PURE__ */ __name(function parseError(str, hash) {\n      if (hash.recoverable) {\n        this.trace(str);\n      } else {\n        var error = new Error(str);\n        error.hash = hash;\n        throw error;\n      }\n    }, \"parseError\"),\n    parse: /* @__PURE__ */ __name(function parse(input) {\n      var self = this, stack = [0], tstack = [], vstack = [null], lstack = [], table = this.table, yytext = \"\", yylineno = 0, yyleng = 0, recovering = 0, TERROR = 2, EOF = 1;\n      var args = lstack.slice.call(arguments, 1);\n      var lexer2 = Object.create(this.lexer);\n      var sharedState = { yy: {} };\n      for (var k in this.yy) {\n        if (Object.prototype.hasOwnProperty.call(this.yy, k)) {\n          sharedState.yy[k] = this.yy[k];\n        }\n      }\n      lexer2.setInput(input, sharedState.yy);\n      sharedState.yy.lexer = lexer2;\n      sharedState.yy.parser = this;\n      if (typeof lexer2.yylloc == \"undefined\") {\n        lexer2.yylloc = {};\n      }\n      var yyloc = lexer2.yylloc;\n      lstack.push(yyloc);\n      var ranges = lexer2.options && lexer2.options.ranges;\n      if (typeof sharedState.yy.parseError === \"function\") {\n        this.parseError = sharedState.yy.parseError;\n      } else {\n        this.parseError = Object.getPrototypeOf(this).parseError;\n      }\n      function popStack(n) {\n        stack.length = stack.length - 2 * n;\n        vstack.length = vstack.length - n;\n        lstack.length = lstack.length - n;\n      }\n      __name(popStack, \"popStack\");\n      function lex() {\n        var token;\n        token = tstack.pop() || lexer2.lex() || EOF;\n        if (typeof token !== \"number\") {\n          if (token instanceof Array) {\n            tstack = token;\n            token = tstack.pop();\n          }\n          token = self.symbols_[token] || token;\n        }\n        return token;\n      }\n      __name(lex, \"lex\");\n      var symbol, preErrorSymbol, state, action, a, r, yyval = {}, p, len, newState, expected;\n      while (true) {\n        state = stack[stack.length - 1];\n        if (this.defaultActions[state]) {\n          action = this.defaultActions[state];\n        } else {\n          if (symbol === null || typeof symbol == \"undefined\") {\n            symbol = lex();\n          }\n          action = table[state] && table[state][symbol];\n        }\n        if (typeof action === \"undefined\" || !action.length || !action[0]) {\n          var errStr = \"\";\n          expected = [];\n          for (p in table[state]) {\n            if (this.terminals_[p] && p > TERROR) {\n              expected.push(\"'\" + this.terminals_[p] + \"'\");\n            }\n          }\n          if (lexer2.showPosition) {\n            errStr = \"Parse error on line \" + (yylineno + 1) + \":\\n\" + lexer2.showPosition() + \"\\nExpecting \" + expected.join(\", \") + \", got '\" + (this.terminals_[symbol] || symbol) + \"'\";\n          } else {\n            errStr = \"Parse error on line \" + (yylineno + 1) + \": Unexpected \" + (symbol == EOF ? \"end of input\" : \"'\" + (this.terminals_[symbol] || symbol) + \"'\");\n          }\n          this.parseError(errStr, {\n            text: lexer2.match,\n            token: this.terminals_[symbol] || symbol,\n            line: lexer2.yylineno,\n            loc: yyloc,\n            expected\n          });\n        }\n        if (action[0] instanceof Array && action.length > 1) {\n          throw new Error(\"Parse Error: multiple actions possible at state: \" + state + \", token: \" + symbol);\n        }\n        switch (action[0]) {\n          case 1:\n            stack.push(symbol);\n            vstack.push(lexer2.yytext);\n            lstack.push(lexer2.yylloc);\n            stack.push(action[1]);\n            symbol = null;\n            if (!preErrorSymbol) {\n              yyleng = lexer2.yyleng;\n              yytext = lexer2.yytext;\n              yylineno = lexer2.yylineno;\n              yyloc = lexer2.yylloc;\n              if (recovering > 0) {\n                recovering--;\n              }\n            } else {\n              symbol = preErrorSymbol;\n              preErrorSymbol = null;\n            }\n            break;\n          case 2:\n            len = this.productions_[action[1]][1];\n            yyval.$ = vstack[vstack.length - len];\n            yyval._$ = {\n              first_line: lstack[lstack.length - (len || 1)].first_line,\n              last_line: lstack[lstack.length - 1].last_line,\n              first_column: lstack[lstack.length - (len || 1)].first_column,\n              last_column: lstack[lstack.length - 1].last_column\n            };\n            if (ranges) {\n              yyval._$.range = [\n                lstack[lstack.length - (len || 1)].range[0],\n                lstack[lstack.length - 1].range[1]\n              ];\n            }\n            r = this.performAction.apply(yyval, [\n              yytext,\n              yyleng,\n              yylineno,\n              sharedState.yy,\n              action[1],\n              vstack,\n              lstack\n            ].concat(args));\n            if (typeof r !== \"undefined\") {\n              return r;\n            }\n            if (len) {\n              stack = stack.slice(0, -1 * len * 2);\n              vstack = vstack.slice(0, -1 * len);\n              lstack = lstack.slice(0, -1 * len);\n            }\n            stack.push(this.productions_[action[1]][0]);\n            vstack.push(yyval.$);\n            lstack.push(yyval._$);\n            newState = table[stack[stack.length - 2]][stack[stack.length - 1]];\n            stack.push(newState);\n            break;\n          case 3:\n            return true;\n        }\n      }\n      return true;\n    }, \"parse\")\n  };\n  var lexer = /* @__PURE__ */ function() {\n    var lexer2 = {\n      EOF: 1,\n      parseError: /* @__PURE__ */ __name(function parseError(str, hash) {\n        if (this.yy.parser) {\n          this.yy.parser.parseError(str, hash);\n        } else {\n          throw new Error(str);\n        }\n      }, \"parseError\"),\n      // resets the lexer, sets new input\n      setInput: /* @__PURE__ */ __name(function(input, yy) {\n        this.yy = yy || this.yy || {};\n        this._input = input;\n        this._more = this._backtrack = this.done = false;\n        this.yylineno = this.yyleng = 0;\n        this.yytext = this.matched = this.match = \"\";\n        this.conditionStack = [\"INITIAL\"];\n        this.yylloc = {\n          first_line: 1,\n          first_column: 0,\n          last_line: 1,\n          last_column: 0\n        };\n        if (this.options.ranges) {\n          this.yylloc.range = [0, 0];\n        }\n        this.offset = 0;\n        return this;\n      }, \"setInput\"),\n      // consumes and returns one char from the input\n      input: /* @__PURE__ */ __name(function() {\n        var ch = this._input[0];\n        this.yytext += ch;\n        this.yyleng++;\n        this.offset++;\n        this.match += ch;\n        this.matched += ch;\n        var lines = ch.match(/(?:\\r\\n?|\\n).*/g);\n        if (lines) {\n          this.yylineno++;\n          this.yylloc.last_line++;\n        } else {\n          this.yylloc.last_column++;\n        }\n        if (this.options.ranges) {\n          this.yylloc.range[1]++;\n        }\n        this._input = this._input.slice(1);\n        return ch;\n      }, \"input\"),\n      // unshifts one char (or a string) into the input\n      unput: /* @__PURE__ */ __name(function(ch) {\n        var len = ch.length;\n        var lines = ch.split(/(?:\\r\\n?|\\n)/g);\n        this._input = ch + this._input;\n        this.yytext = this.yytext.substr(0, this.yytext.length - len);\n        this.offset -= len;\n        var oldLines = this.match.split(/(?:\\r\\n?|\\n)/g);\n        this.match = this.match.substr(0, this.match.length - 1);\n        this.matched = this.matched.substr(0, this.matched.length - 1);\n        if (lines.length - 1) {\n          this.yylineno -= lines.length - 1;\n        }\n        var r = this.yylloc.range;\n        this.yylloc = {\n          first_line: this.yylloc.first_line,\n          last_line: this.yylineno + 1,\n          first_column: this.yylloc.first_column,\n          last_column: lines ? (lines.length === oldLines.length ? this.yylloc.first_column : 0) + oldLines[oldLines.length - lines.length].length - lines[0].length : this.yylloc.first_column - len\n        };\n        if (this.options.ranges) {\n          this.yylloc.range = [r[0], r[0] + this.yyleng - len];\n        }\n        this.yyleng = this.yytext.length;\n        return this;\n      }, \"unput\"),\n      // When called from action, caches matched text and appends it on next action\n      more: /* @__PURE__ */ __name(function() {\n        this._more = true;\n        return this;\n      }, \"more\"),\n      // When called from action, signals the lexer that this rule fails to match the input, so the next matching rule (regex) should be tested instead.\n      reject: /* @__PURE__ */ __name(function() {\n        if (this.options.backtrack_lexer) {\n          this._backtrack = true;\n        } else {\n          return this.parseError(\"Lexical error on line \" + (this.yylineno + 1) + \". You can only invoke reject() in the lexer when the lexer is of the backtracking persuasion (options.backtrack_lexer = true).\\n\" + this.showPosition(), {\n            text: \"\",\n            token: null,\n            line: this.yylineno\n          });\n        }\n        return this;\n      }, \"reject\"),\n      // retain first n characters of the match\n      less: /* @__PURE__ */ __name(function(n) {\n        this.unput(this.match.slice(n));\n      }, \"less\"),\n      // displays already matched input, i.e. for error messages\n      pastInput: /* @__PURE__ */ __name(function() {\n        var past = this.matched.substr(0, this.matched.length - this.match.length);\n        return (past.length > 20 ? \"...\" : \"\") + past.substr(-20).replace(/\\n/g, \"\");\n      }, \"pastInput\"),\n      // displays upcoming input, i.e. for error messages\n      upcomingInput: /* @__PURE__ */ __name(function() {\n        var next = this.match;\n        if (next.length < 20) {\n          next += this._input.substr(0, 20 - next.length);\n        }\n        return (next.substr(0, 20) + (next.length > 20 ? \"...\" : \"\")).replace(/\\n/g, \"\");\n      }, \"upcomingInput\"),\n      // displays the character position where the lexing error occurred, i.e. for error messages\n      showPosition: /* @__PURE__ */ __name(function() {\n        var pre = this.pastInput();\n        var c = new Array(pre.length + 1).join(\"-\");\n        return pre + this.upcomingInput() + \"\\n\" + c + \"^\";\n      }, \"showPosition\"),\n      // test the lexed token: return FALSE when not a match, otherwise return token\n      test_match: /* @__PURE__ */ __name(function(match, indexed_rule) {\n        var token, lines, backup;\n        if (this.options.backtrack_lexer) {\n          backup = {\n            yylineno: this.yylineno,\n            yylloc: {\n              first_line: this.yylloc.first_line,\n              last_line: this.last_line,\n              first_column: this.yylloc.first_column,\n              last_column: this.yylloc.last_column\n            },\n            yytext: this.yytext,\n            match: this.match,\n            matches: this.matches,\n            matched: this.matched,\n            yyleng: this.yyleng,\n            offset: this.offset,\n            _more: this._more,\n            _input: this._input,\n            yy: this.yy,\n            conditionStack: this.conditionStack.slice(0),\n            done: this.done\n          };\n          if (this.options.ranges) {\n            backup.yylloc.range = this.yylloc.range.slice(0);\n          }\n        }\n        lines = match[0].match(/(?:\\r\\n?|\\n).*/g);\n        if (lines) {\n          this.yylineno += lines.length;\n        }\n        this.yylloc = {\n          first_line: this.yylloc.last_line,\n          last_line: this.yylineno + 1,\n          first_column: this.yylloc.last_column,\n          last_column: lines ? lines[lines.length - 1].length - lines[lines.length - 1].match(/\\r?\\n?/)[0].length : this.yylloc.last_column + match[0].length\n        };\n        this.yytext += match[0];\n        this.match += match[0];\n        this.matches = match;\n        this.yyleng = this.yytext.length;\n        if (this.options.ranges) {\n          this.yylloc.range = [this.offset, this.offset += this.yyleng];\n        }\n        this._more = false;\n        this._backtrack = false;\n        this._input = this._input.slice(match[0].length);\n        this.matched += match[0];\n        token = this.performAction.call(this, this.yy, this, indexed_rule, this.conditionStack[this.conditionStack.length - 1]);\n        if (this.done && this._input) {\n          this.done = false;\n        }\n        if (token) {\n          return token;\n        } else if (this._backtrack) {\n          for (var k in backup) {\n            this[k] = backup[k];\n          }\n          return false;\n        }\n        return false;\n      }, \"test_match\"),\n      // return next match in input\n      next: /* @__PURE__ */ __name(function() {\n        if (this.done) {\n          return this.EOF;\n        }\n        if (!this._input) {\n          this.done = true;\n        }\n        var token, match, tempMatch, index;\n        if (!this._more) {\n          this.yytext = \"\";\n          this.match = \"\";\n        }\n        var rules = this._currentRules();\n        for (var i = 0; i < rules.length; i++) {\n          tempMatch = this._input.match(this.rules[rules[i]]);\n          if (tempMatch && (!match || tempMatch[0].length > match[0].length)) {\n            match = tempMatch;\n            index = i;\n            if (this.options.backtrack_lexer) {\n              token = this.test_match(tempMatch, rules[i]);\n              if (token !== false) {\n                return token;\n              } else if (this._backtrack) {\n                match = false;\n                continue;\n              } else {\n                return false;\n              }\n            } else if (!this.options.flex) {\n              break;\n            }\n          }\n        }\n        if (match) {\n          token = this.test_match(match, rules[index]);\n          if (token !== false) {\n            return token;\n          }\n          return false;\n        }\n        if (this._input === \"\") {\n          return this.EOF;\n        } else {\n          return this.parseError(\"Lexical error on line \" + (this.yylineno + 1) + \". Unrecognized text.\\n\" + this.showPosition(), {\n            text: \"\",\n            token: null,\n            line: this.yylineno\n          });\n        }\n      }, \"next\"),\n      // return next match that has a token\n      lex: /* @__PURE__ */ __name(function lex() {\n        var r = this.next();\n        if (r) {\n          return r;\n        } else {\n          return this.lex();\n        }\n      }, \"lex\"),\n      // activates a new lexer condition state (pushes the new lexer condition state onto the condition stack)\n      begin: /* @__PURE__ */ __name(function begin(condition) {\n        this.conditionStack.push(condition);\n      }, \"begin\"),\n      // pop the previously active lexer condition state off the condition stack\n      popState: /* @__PURE__ */ __name(function popState() {\n        var n = this.conditionStack.length - 1;\n        if (n > 0) {\n          return this.conditionStack.pop();\n        } else {\n          return this.conditionStack[0];\n        }\n      }, \"popState\"),\n      // produce the lexer rule set which is active for the currently active lexer condition state\n      _currentRules: /* @__PURE__ */ __name(function _currentRules() {\n        if (this.conditionStack.length && this.conditionStack[this.conditionStack.length - 1]) {\n          return this.conditions[this.conditionStack[this.conditionStack.length - 1]].rules;\n        } else {\n          return this.conditions[\"INITIAL\"].rules;\n        }\n      }, \"_currentRules\"),\n      // return the currently active lexer condition state; when an index argument is provided it produces the N-th previous condition state, if available\n      topState: /* @__PURE__ */ __name(function topState(n) {\n        n = this.conditionStack.length - 1 - Math.abs(n || 0);\n        if (n >= 0) {\n          return this.conditionStack[n];\n        } else {\n          return \"INITIAL\";\n        }\n      }, \"topState\"),\n      // alias for begin(condition)\n      pushState: /* @__PURE__ */ __name(function pushState(condition) {\n        this.begin(condition);\n      }, \"pushState\"),\n      // return the number of states currently on the stack\n      stateStackSize: /* @__PURE__ */ __name(function stateStackSize() {\n        return this.conditionStack.length;\n      }, \"stateStackSize\"),\n      options: { \"case-insensitive\": true },\n      performAction: /* @__PURE__ */ __name(function anonymous(yy, yy_, $avoiding_name_collisions, YY_START) {\n        var YYSTATE = YY_START;\n        switch ($avoiding_name_collisions) {\n          case 0:\n            this.pushState(\"csv\");\n            return 4;\n            break;\n          case 1:\n            return 10;\n            break;\n          case 2:\n            return 5;\n            break;\n          case 3:\n            return 12;\n            break;\n          case 4:\n            this.pushState(\"escaped_text\");\n            return 18;\n            break;\n          case 5:\n            return 20;\n            break;\n          case 6:\n            this.popState(\"escaped_text\");\n            return 18;\n            break;\n          case 7:\n            return 19;\n            break;\n        }\n      }, \"anonymous\"),\n      rules: [/^(?:sankey-beta\\b)/i, /^(?:$)/i, /^(?:((\\u000D\\u000A)|(\\u000A)))/i, /^(?:(\\u002C))/i, /^(?:(\\u0022))/i, /^(?:([\\u0020-\\u0021\\u0023-\\u002B\\u002D-\\u007E])*)/i, /^(?:(\\u0022)(?!(\\u0022)))/i, /^(?:(([\\u0020-\\u0021\\u0023-\\u002B\\u002D-\\u007E])|(\\u002C)|(\\u000D)|(\\u000A)|(\\u0022)(\\u0022))*)/i],\n      conditions: { \"csv\": { \"rules\": [1, 2, 3, 4, 5, 6, 7], \"inclusive\": false }, \"escaped_text\": { \"rules\": [6, 7], \"inclusive\": false }, \"INITIAL\": { \"rules\": [0, 1, 2, 3, 4, 5, 6, 7], \"inclusive\": true } }\n    };\n    return lexer2;\n  }();\n  parser2.lexer = lexer;\n  function Parser() {\n    this.yy = {};\n  }\n  __name(Parser, \"Parser\");\n  Parser.prototype = parser2;\n  parser2.Parser = Parser;\n  return new Parser();\n}();\nparser.parser = parser;\nvar sankey_default = parser;\n\n// src/diagrams/sankey/sankeyDB.ts\nvar links = [];\nvar nodes = [];\nvar nodesMap = /* @__PURE__ */ new Map();\nvar clear2 = /* @__PURE__ */ __name(() => {\n  links = [];\n  nodes = [];\n  nodesMap = /* @__PURE__ */ new Map();\n  clear();\n}, \"clear\");\nvar SankeyLink = class {\n  constructor(source, target, value = 0) {\n    this.source = source;\n    this.target = target;\n    this.value = value;\n  }\n  static {\n    __name(this, \"SankeyLink\");\n  }\n};\nvar addLink = /* @__PURE__ */ __name((source, target, value) => {\n  links.push(new SankeyLink(source, target, value));\n}, \"addLink\");\nvar SankeyNode = class {\n  constructor(ID) {\n    this.ID = ID;\n  }\n  static {\n    __name(this, \"SankeyNode\");\n  }\n};\nvar findOrCreateNode = /* @__PURE__ */ __name((ID) => {\n  ID = common_default.sanitizeText(ID, getConfig());\n  let node = nodesMap.get(ID);\n  if (node === void 0) {\n    node = new SankeyNode(ID);\n    nodesMap.set(ID, node);\n    nodes.push(node);\n  }\n  return node;\n}, \"findOrCreateNode\");\nvar getNodes = /* @__PURE__ */ __name(() => nodes, \"getNodes\");\nvar getLinks = /* @__PURE__ */ __name(() => links, \"getLinks\");\nvar getGraph = /* @__PURE__ */ __name(() => ({\n  nodes: nodes.map((node) => ({ id: node.ID })),\n  links: links.map((link) => ({\n    source: link.source.ID,\n    target: link.target.ID,\n    value: link.value\n  }))\n}), \"getGraph\");\nvar sankeyDB_default = {\n  nodesMap,\n  getConfig: /* @__PURE__ */ __name(() => getConfig().sankey, \"getConfig\"),\n  getNodes,\n  getLinks,\n  getGraph,\n  addLink,\n  findOrCreateNode,\n  getAccTitle,\n  setAccTitle,\n  getAccDescription,\n  setAccDescription,\n  getDiagramTitle,\n  setDiagramTitle,\n  clear: clear2\n};\n\n// src/diagrams/sankey/sankeyRenderer.ts\nimport {\n  select as d3select,\n  scaleOrdinal as d3scaleOrdinal,\n  schemeTableau10 as d3schemeTableau10\n} from \"d3\";\nimport {\n  sankey as d3Sankey,\n  sankeyLinkHorizontal as d3SankeyLinkHorizontal,\n  sankeyLeft as d3SankeyLeft,\n  sankeyRight as d3SankeyRight,\n  sankeyCenter as d3SankeyCenter,\n  sankeyJustify as d3SankeyJustify\n} from \"d3-sankey\";\n\n// src/rendering-util/uid.ts\nvar Uid = class _Uid {\n  static {\n    __name(this, \"Uid\");\n  }\n  static {\n    this.count = 0;\n  }\n  static next(name) {\n    return new _Uid(name + ++_Uid.count);\n  }\n  constructor(id) {\n    this.id = id;\n    this.href = `#${id}`;\n  }\n  toString() {\n    return \"url(\" + this.href + \")\";\n  }\n};\n\n// src/diagrams/sankey/sankeyRenderer.ts\nvar alignmentsMap = {\n  left: d3SankeyLeft,\n  right: d3SankeyRight,\n  center: d3SankeyCenter,\n  justify: d3SankeyJustify\n};\nvar draw = /* @__PURE__ */ __name(function(text, id, _version, diagObj) {\n  const { securityLevel, sankey: conf } = getConfig();\n  const defaultSankeyConfig = defaultConfig.sankey;\n  let sandboxElement;\n  if (securityLevel === \"sandbox\") {\n    sandboxElement = d3select(\"#i\" + id);\n  }\n  const root = securityLevel === \"sandbox\" ? d3select(sandboxElement.nodes()[0].contentDocument.body) : d3select(\"body\");\n  const svg = securityLevel === \"sandbox\" ? root.select(`[id=\"${id}\"]`) : d3select(`[id=\"${id}\"]`);\n  const width = conf?.width ?? defaultSankeyConfig.width;\n  const height = conf?.height ?? defaultSankeyConfig.width;\n  const useMaxWidth = conf?.useMaxWidth ?? defaultSankeyConfig.useMaxWidth;\n  const nodeAlignment = conf?.nodeAlignment ?? defaultSankeyConfig.nodeAlignment;\n  const prefix = conf?.prefix ?? defaultSankeyConfig.prefix;\n  const suffix = conf?.suffix ?? defaultSankeyConfig.suffix;\n  const showValues = conf?.showValues ?? defaultSankeyConfig.showValues;\n  const graph = diagObj.db.getGraph();\n  const nodeAlign = alignmentsMap[nodeAlignment];\n  const nodeWidth = 10;\n  const sankey = d3Sankey().nodeId((d) => d.id).nodeWidth(nodeWidth).nodePadding(10 + (showValues ? 15 : 0)).nodeAlign(nodeAlign).extent([\n    [0, 0],\n    [width, height]\n  ]);\n  sankey(graph);\n  const colorScheme = d3scaleOrdinal(d3schemeTableau10);\n  svg.append(\"g\").attr(\"class\", \"nodes\").selectAll(\".node\").data(graph.nodes).join(\"g\").attr(\"class\", \"node\").attr(\"id\", (d) => (d.uid = Uid.next(\"node-\")).id).attr(\"transform\", function(d) {\n    return \"translate(\" + d.x0 + \",\" + d.y0 + \")\";\n  }).attr(\"x\", (d) => d.x0).attr(\"y\", (d) => d.y0).append(\"rect\").attr(\"height\", (d) => {\n    return d.y1 - d.y0;\n  }).attr(\"width\", (d) => d.x1 - d.x0).attr(\"fill\", (d) => colorScheme(d.id));\n  const getText = /* @__PURE__ */ __name(({ id: id2, value }) => {\n    if (!showValues) {\n      return id2;\n    }\n    return `${id2}\n${prefix}${Math.round(value * 100) / 100}${suffix}`;\n  }, \"getText\");\n  svg.append(\"g\").attr(\"class\", \"node-labels\").attr(\"font-family\", \"sans-serif\").attr(\"font-size\", 14).selectAll(\"text\").data(graph.nodes).join(\"text\").attr(\"x\", (d) => d.x0 < width / 2 ? d.x1 + 6 : d.x0 - 6).attr(\"y\", (d) => (d.y1 + d.y0) / 2).attr(\"dy\", `${showValues ? \"0\" : \"0.35\"}em`).attr(\"text-anchor\", (d) => d.x0 < width / 2 ? \"start\" : \"end\").text(getText);\n  const link = svg.append(\"g\").attr(\"class\", \"links\").attr(\"fill\", \"none\").attr(\"stroke-opacity\", 0.5).selectAll(\".link\").data(graph.links).join(\"g\").attr(\"class\", \"link\").style(\"mix-blend-mode\", \"multiply\");\n  const linkColor = conf?.linkColor ?? \"gradient\";\n  if (linkColor === \"gradient\") {\n    const gradient = link.append(\"linearGradient\").attr(\"id\", (d) => (d.uid = Uid.next(\"linearGradient-\")).id).attr(\"gradientUnits\", \"userSpaceOnUse\").attr(\"x1\", (d) => d.source.x1).attr(\"x2\", (d) => d.target.x0);\n    gradient.append(\"stop\").attr(\"offset\", \"0%\").attr(\"stop-color\", (d) => colorScheme(d.source.id));\n    gradient.append(\"stop\").attr(\"offset\", \"100%\").attr(\"stop-color\", (d) => colorScheme(d.target.id));\n  }\n  let coloring;\n  switch (linkColor) {\n    case \"gradient\":\n      coloring = /* @__PURE__ */ __name((d) => d.uid, \"coloring\");\n      break;\n    case \"source\":\n      coloring = /* @__PURE__ */ __name((d) => colorScheme(d.source.id), \"coloring\");\n      break;\n    case \"target\":\n      coloring = /* @__PURE__ */ __name((d) => colorScheme(d.target.id), \"coloring\");\n      break;\n    default:\n      coloring = linkColor;\n  }\n  link.append(\"path\").attr(\"d\", d3SankeyLinkHorizontal()).attr(\"stroke\", coloring).attr(\"stroke-width\", (d) => Math.max(1, d.width));\n  setupGraphViewbox(void 0, svg, 0, useMaxWidth);\n}, \"draw\");\nvar sankeyRenderer_default = {\n  draw\n};\n\n// src/diagrams/sankey/sankeyUtils.ts\nvar prepareTextForParsing = /* @__PURE__ */ __name((text) => {\n  const textToParse = text.replaceAll(/^[^\\S\\n\\r]+|[^\\S\\n\\r]+$/g, \"\").replaceAll(/([\\n\\r])+/g, \"\\n\").trim();\n  return textToParse;\n}, \"prepareTextForParsing\");\n\n// src/diagrams/sankey/sankeyDiagram.ts\nvar originalParse = sankey_default.parse.bind(sankey_default);\nsankey_default.parse = (text) => originalParse(prepareTextForParsing(text));\nvar diagram = {\n  parser: sankey_default,\n  db: sankeyDB_default,\n  renderer: sankeyRenderer_default\n};\nexport {\n  diagram\n};\n"],"names":["compare","f","a","b","NaN","length","d","x","array","Array","prototype","values","valueof","value","max","n","i","min","sum","targetDepth","target","depth","justify","node","sourceLinks","ascendingSourceBreadth","ascendingBreadth","source","index","ascendingTargetBreadth","y0","defaultId","defaultNodes","graph","nodes","defaultLinks","links","find","nodeById","id","get","Error","computeLinkBreadths","y1","link","width","targetLinks","slice","map","Math","sqrt","pi","PI","tau","epsilon","tauEpsilon","Path","this","_x0","_y0","_x1","_y1","_","path","constructor","moveTo","y","closePath","lineTo","quadraticCurveTo","x1","bezierCurveTo","x2","y2","arcTo","r","x0","x21","y21","x01","y01","l01_2","abs","x20","y20","l21_2","l20_2","l21","l01","l","tan","acos","t01","t21","arc","a0","a1","ccw","dx","cos","dy","sin","cw","da","rect","w","h","toString","p","linkSource","linkTarget","curveHorizontal","context","horizontalSource","horizontalTarget","curve","buffer","argv","call","arguments","s","apply","t","parser","o","k","v","o2","$V0","$V1","$V2","parser2","trace","yy","symbols_","terminals_","productions_","performAction","yytext","yyleng","yylineno","yystate","$$","_$","$0","findOrCreateNode","trim","replaceAll","parseFloat","addLink","$","table","defaultActions","parseError","str","hash","recoverable","error","parse","input","self","stack","tstack","vstack","lstack","recovering","args","lexer2","Object","create","lexer","sharedState","hasOwnProperty","setInput","yylloc","yyloc","push","ranges","options","lex","token","pop","getPrototypeOf","symbol","preErrorSymbol","state","action","len","newState","expected","yyval","errStr","showPosition","join","text","match","line","loc","first_line","last_line","first_column","last_column","range","concat","EOF","_input","_more","_backtrack","done","matched","conditionStack","offset","ch","unput","lines","split","substr","oldLines","more","reject","backtrack_lexer","less","pastInput","past","replace","upcomingInput","next","pre","c","test_match","indexed_rule","backup","matches","tempMatch","rules","_currentRules","flex","begin","condition","popState","conditions","topState","pushState","stateStackSize","yy_","$avoiding_name_collisions","YY_START","Parser","sankey_default","nodesMap","Map","clear2","SankeyLink","SankeyNode","ID","sanitizeText","set","getNodes","getLinks","getGraph","sankeyDB_default","getConfig","sankey","getAccTitle","setAccTitle","getAccDescription","setAccDescription","getDiagramTitle","setDiagramTitle","clear","Uid","_Uid","count","name","href","alignmentsMap","left","right","height","center","draw","_version","diagObj","securityLevel","conf","defaultSankeyConfig","sandboxElement","root","contentDocument","body","svg","select","useMaxWidth","nodeAlignment","prefix","suffix","showValues","db","nodeAlign","py","sort","linkSort","align","iterations","entries","computeNodeLinks","undefined","fixedValue","computeNodeValues","current","Set","size","add","computeNodeDepths","computeNodeHeights","columns","kx","floor","layer","column","computeNodeLayers","ky","reorderLinks","initializeNodeBreadths","alpha","pow","beta","relaxRightToLeft","relaxLeftToRight","computeNodeBreadths","targetTop","reorderNodeLinks","resolveCollisions","sourceTop","subject","resolveCollisionsBottomToTop","resolveCollisionsTopToBottom","update","nodeId","nodeSort","nodeWidth","nodePadding","extent","colorScheme","append","attr","selectAll","data","uid","getText","id2","round","style","linkColor","gradient","coloring","sankeyRenderer_default","prepareTextForParsing","originalParse","bind","diagram","renderer"],"sourceRoot":""}