@finos/legend-application-pure-ide-deployment 11.11.0 → 11.12.0

package/dist/ide/static/636.4620ce27.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"static/636.4620ce27.js","mappings":"kbAOA,MAAMA,EACJ,WAAAC,GACE,IAAIC,EAAW,CAAC,EAChBA,EAASC,MAAQD,EAASE,MAAQF,EAClCG,KAAKC,UAAYJ,CACnB,CACA,OAAAK,GACE,IAAIL,EAAWG,KAAKC,UAChBE,EAAQN,EAASE,MACrB,GAAII,IAAUN,EAEZ,OADAO,EAAOD,GACAA,CAEX,CACA,OAAAE,CAAQF,GACN,IAAIN,EAAWG,KAAKC,UAChBE,EAAMJ,OAASI,EAAML,OACvBM,EAAOD,GAETA,EAAML,MAAQD,EAASC,MACvBD,EAASC,MAAMC,MAAQI,EACvBN,EAASC,MAAQK,EACjBA,EAAMJ,MAAQF,CAChB,CACA,QAAAS,GAIE,IAHA,IAAIC,EAAO,GACPV,EAAWG,KAAKC,UAChBO,EAAOX,EAASE,MACbS,IAASX,GACdU,EAAKE,KAAKC,KAAKC,UAAUH,EAAMI,IAC/BJ,EAAOA,EAAKT,MAEd,MAAO,IAAMQ,EAAKM,KAAK,MAAQ,GACjC,EAGF,SAAST,EAAOD,GACdA,EAAMJ,MAAMD,MAAQK,EAAML,MAC1BK,EAAML,MAAMC,MAAQI,EAAMJ,aACnBI,EAAML,aACNK,EAAMJ,KACf,CAEA,SAASa,EAAeE,EAAGC,GACzB,GAAU,UAAND,GAAuB,UAANA,EACnB,OAAOC,CAEX,CCzCA,IAAIC,EAAoB,UAAW,GAEnC,SAASC,EAAUC,EAAGC,GACpB,GAAID,EAAEE,aAAe,EACnB,MAAO,GAET,IAAIC,EAkEN,SAAoBH,EAAGC,GACrB,IAAIG,EAAW,IAAI,EAAAC,MACfC,EAAQ,EACRC,EAAS,EAEb,UAAUP,EAAEQ,SAAS,SAAUX,GAC7BO,EAASK,QAAQZ,EAAG,CAAEA,EAAGA,EAAGa,GAAI,EAAGC,IAAK,GAC1C,IAIA,UAAUX,EAAEY,SAAS,SAAUC,GAC7B,IAAIC,EAAaV,EAASW,KAAKF,EAAEhB,EAAGgB,EAAEG,IAAM,EACxCC,EAAShB,EAASY,GAClBK,EAAaJ,EAAaG,EAC9Bb,EAASe,QAAQN,EAAEhB,EAAGgB,EAAEG,EAAGE,GAC3BX,EAASa,KAAKC,IAAId,EAASH,EAASkB,KAAKT,EAAEhB,GAAGc,KAAOM,GACrDX,EAAQc,KAAKC,IAAIf,EAAQF,EAASkB,KAAKT,EAAEG,GAAO,IAAKC,EACvD,IAEA,IAAIM,EAAU,UAAQhB,EAASD,EAAQ,GAAGkB,KAAI,WAC5C,OAAO,IAAI/C,CACb,IACIgD,EAAUnB,EAAQ,EAMtB,OAJA,UAAUF,EAASI,SAAS,SAAUX,GACpC6B,EAAaH,EAASE,EAASrB,EAASkB,KAAKzB,GAC/C,IAEO,CAAE8B,MAAOvB,EAAUmB,QAASA,EAASE,QAASA,EACvD,CAhGcG,CAAW5B,EAAGC,GAAYH,GAClC+B,EAUN,SAAqB7B,EAAGuB,EAASE,GAC/B,IAIIxC,EAJA4C,EAAU,GACVC,EAAUP,EAAQA,EAAQQ,OAAS,GACnCC,EAAQT,EAAQ,GAGpB,KAAOvB,EAAEE,aAAa,CACpB,KAAQjB,EAAQ+C,EAAMhD,WACpBiD,EAAWjC,EAAGuB,EAASE,EAASxC,GAElC,KAAQA,EAAQ6C,EAAQ9C,WACtBiD,EAAWjC,EAAGuB,EAASE,EAASxC,GAElC,GAAIe,EAAEE,YACJ,IAAK,IAAIgC,EAAIX,EAAQQ,OAAS,EAAGG,EAAI,IAAKA,EAExC,GADAjD,EAAQsC,EAAQW,GAAGlD,UACR,CACT6C,EAAUA,EAAQM,OAAOF,EAAWjC,EAAGuB,EAASE,EAASxC,GAAO,IAChE,KACF,CAGN,CAEA,OAAO4C,CACT,CAnCgBO,CAAYjC,EAAMwB,MAAOxB,EAAMoB,QAASpB,EAAMsB,SAG5D,OAAO,UACL,UAAMI,GAAS,SAAUhB,GACvB,OAAOb,EAAEqC,SAASxB,EAAEhB,EAAGgB,EAAEG,EAC3B,IAEJ,CA6BA,SAASiB,EAAWjC,EAAGuB,EAASE,EAASxC,EAAOqD,GAC9C,IAAIT,EAAUS,EAAsB,QAAKC,EAwBzC,OAtBA,UAAUvC,EAAEwC,QAAQvD,EAAMY,IAAI,SAAUkB,GACtC,IAAIE,EAASjB,EAAEe,KAAKA,GAChB0B,EAASzC,EAAEsB,KAAKP,EAAKlB,GAErByC,GACFT,EAAQtC,KAAK,CAAEM,EAAGkB,EAAKlB,EAAGmB,EAAGD,EAAKC,IAGpCyB,EAAO9B,KAAOM,EACdS,EAAaH,EAASE,EAASgB,EACjC,IAEA,UAAUzC,EAAEqC,SAASpD,EAAMY,IAAI,SAAUkB,GACvC,IAAIE,EAASjB,EAAEe,KAAKA,GAChBC,EAAID,EAAKC,EACT0B,EAAS1C,EAAEsB,KAAKN,GACpB0B,EAAW,IAAKzB,EAChBS,EAAaH,EAASE,EAASiB,EACjC,IAEA1C,EAAEiC,WAAWhD,EAAMY,GAEZgC,CACT,CAkCA,SAASH,EAAaH,EAASE,EAASxC,GACjCA,EAAM0B,IAEC1B,EAAU,GAGpBsC,EAAQtC,EAAM0B,IAAM1B,EAAU,GAAIwC,GAAStC,QAAQF,GAFnDsC,EAAQA,EAAQQ,OAAS,GAAG5C,QAAQF,GAFpCsC,EAAQ,GAAGpC,QAAQF,EAMvB,CCxHA,SAAS0D,EAAI3C,GACX,IAAI4C,EAA8B,WAAxB5C,EAAE2B,QAAQkB,UAAyB9C,EAAUC,EASvD,SAAkBA,GAChB,OAAO,SAAUa,GACf,OAAOb,EAAEe,KAAKF,GAAGI,MACnB,CACF,CAb0DhB,CAASD,IAgBrE,SAAgBA,GACd,IAAI4C,EAAM,GACNE,EAAQ,CAAC,EACTC,EAAU,CAAC,EAEf,SAASC,EAAInD,GACP,UAAMkD,EAASlD,KAGnBkD,EAAQlD,IAAK,EACbiD,EAAMjD,IAAK,EACX,UAAUG,EAAEqC,SAASxC,IAAI,SAAUgB,GAC7B,UAAMiC,EAAOjC,EAAEG,GACjB4B,EAAIrD,KAAKsB,GAETmC,EAAInC,EAAEG,EAEV,WACO8B,EAAMjD,GACf,CAGA,OADA,UAAUG,EAAEQ,QAASwC,GACdJ,CACT,CAvC2EK,CAAOjD,GAChF,UAAU4C,GAAK,SAAU/B,GACvB,IAAIqC,EAAQlD,EAAEe,KAAKF,GACnBb,EAAEmD,WAAWtC,GACbqC,EAAME,YAAcvC,EAAEwC,KACtBH,EAAMI,UAAW,EACjBtD,EAAEmB,QAAQN,EAAEG,EAAGH,EAAEhB,EAAGqD,EAAO,UAAW,OACxC,GAOF,CA2BA,SAASK,EAAKvD,GACZ,UAAUA,EAAEY,SAAS,SAAUC,GAC7B,IAAIqC,EAAQlD,EAAEe,KAAKF,GACnB,GAAIqC,EAAMI,SAAU,CAClBtD,EAAEmD,WAAWtC,GAEb,IAAIuC,EAAcF,EAAME,mBACjBF,EAAMI,gBACNJ,EAAME,YACbpD,EAAEmB,QAAQN,EAAEG,EAAGH,EAAEhB,EAAGqD,EAAOE,EAC7B,CACF,GACF,C,4CC5BA,QAnBA,SAAsBI,EAAOC,EAAUC,GAIrC,IAHA,IAAIC,GAAS,EACT5B,EAASyB,EAAMzB,SAEV4B,EAAQ5B,GAAQ,CACvB,IAAI6B,EAAQJ,EAAMG,GACdE,EAAUJ,EAASG,GAEvB,GAAe,MAAXC,SAAiCtB,IAAbuB,EACfD,GAAYA,KAAY,EAAAE,EAAA,SAASF,GAClCH,EAAWG,EAASC,IAE1B,IAAIA,EAAWD,EACXG,EAASJ,CAEjB,CACA,OAAOI,CACT,EChBA,QAJA,SAAgBJ,EAAOK,GACrB,OAAOL,EAAQK,CACjB,E,cCiBA,QANA,SAAaT,GACX,OAAQA,GAASA,EAAMzB,OACnB,EAAayB,EAAOU,EAAA,QAAU,QAC9B3B,CACN,ECPA,QALA,SAAciB,GACZ,IAAIzB,EAAkB,MAATyB,EAAgB,EAAIA,EAAMzB,OACvC,OAAOA,EAASyB,EAAMzB,EAAS,QAAKQ,CACtC,E,gCCyBA,QAVA,SAAmB4B,EAAQV,GACzB,IAAIO,EAAS,CAAC,EAMd,OALAP,GAAW,aAAaA,EAAU,IAElC,aAAWU,GAAQ,SAASP,EAAOQ,EAAKD,IACtC,aAAgBH,EAAQI,EAAKX,EAASG,EAAOQ,EAAKD,GACpD,IACOH,CACT,E,cClBA,QAbA,SAAuBK,EAAOC,EAAQC,GAMpC,IALA,IAAIZ,GAAS,EACT5B,EAASsC,EAAMtC,OACfyC,EAAaF,EAAOvC,OACpBiC,EAAS,CAAC,IAELL,EAAQ5B,GAAQ,CACvB,IAAI6B,EAAQD,EAAQa,EAAaF,EAAOX,QAASpB,EACjDgC,EAAWP,EAAQK,EAAMV,GAAQC,EACnC,CACA,OAAOI,CACT,ECGA,QAJA,SAAmBK,EAAOC,GACxB,OAAO,EAAcD,GAAS,GAAIC,GAAU,GAAI,UAClD,E,cCRA,QAJA,SAAgBV,EAAOK,GACrB,OAAOL,EAAQK,CACjB,ECiBA,QANA,SAAaT,GACX,OAAQA,GAASA,EAAMzB,OACnB,EAAayB,EAAOU,EAAA,QAAU,QAC9B3B,CACN,E,cCHA,SAASkC,EAAazE,EAAG0E,EAAMC,EAAOtB,GACpC,IAAIxD,EACJ,GACEA,EAAI,UAAWwD,SACRrD,EAAE4E,QAAQ/E,IAInB,OAFA8E,EAAME,MAAQH,EACd1E,EAAES,QAAQZ,EAAG8E,GACN9E,CACT,CAsBA,SAASiF,EAAmB9E,GAC1B,IAAI+E,EAAa,IAAI,EAAA1E,MAAM,CAAE2E,WAAYhF,EAAEiF,iBAAkBC,SAASlF,EAAE2B,SASxE,OARA,UAAU3B,EAAEQ,SAAS,SAAUX,GACxBG,EAAEmF,SAAStF,GAAGkC,QACjBgD,EAAWtE,QAAQZ,EAAGG,EAAEsB,KAAKzB,GAEjC,IACA,UAAUG,EAAEY,SAAS,SAAUC,GAC7BkE,EAAW5D,QAAQN,EAAGb,EAAEe,KAAKF,GAC/B,IACOkE,CACT,CA4BA,SAASK,EAAcC,EAAMC,GAC3B,IAcIC,EAAIC,EAdJC,EAAIJ,EAAKI,EACTC,EAAIL,EAAKK,EAITC,EAAKL,EAAMG,EAAIA,EACfG,EAAKN,EAAMI,EAAIA,EACf1E,EAAIqE,EAAKQ,MAAQ,EACjBC,EAAIT,EAAKU,OAAS,EAEtB,IAAKJ,IAAOC,EACV,MAAM,IAAII,MAAM,6DAoBlB,OAhBI5E,KAAK6E,IAAIL,GAAM5E,EAAII,KAAK6E,IAAIN,GAAMG,GAEhCF,EAAK,IACPE,GAAKA,GAEPP,EAAMO,EAAIH,EAAMC,EAChBJ,EAAKM,IAGDH,EAAK,IACP3E,GAAKA,GAEPuE,EAAKvE,EACLwE,EAAMxE,EAAI4E,EAAMD,GAGX,CAAEF,EAAGA,EAAIF,EAAIG,EAAGA,EAAIF,EAC7B,CAMA,SAASU,EAAiBlG,GACxB,IAAImG,EAAW,UAAM,UAAQ,EAAQnG,GAAK,IAAI,WAC5C,MAAO,EACT,IAQA,OAPA,UAAUA,EAAEQ,SAAS,SAAUX,GAC7B,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GACduG,EAAO9E,EAAK8E,KACX,UAAcA,KACjBD,EAASC,GAAM9E,EAAK+E,OAASxG,EAEjC,IACOsG,CACT,CAkDA,SAASG,EAActG,EAAGuG,EAAQH,EAAMC,GACtC,IAAI/E,EAAO,CACTuE,MAAO,EACPE,OAAQ,GAMV,OAJIS,UAAUzE,QAAU,IACtBT,EAAK8E,KAAOA,EACZ9E,EAAK+E,MAAQA,GAER5B,EAAazE,EAAG,SAAUsB,EAAMiF,EACzC,CAEA,SAAS,EAAQvG,GACf,OAAO,EACL,UAAMA,EAAEQ,SAAS,SAAUX,GACzB,IAAIuG,EAAOpG,EAAEsB,KAAKzB,GAAGuG,KACrB,IAAK,UAAcA,GACjB,OAAOA,CAEX,IAEJ,CAuBA,SAAS,EAAK/C,EAAMoD,GAClB,IAAIC,EAAQ,YACZ,IACE,OAAOD,GACT,CAAE,QACAE,QAAQC,IAAIvD,EAAO,WAAa,YAAUqD,GAAS,KACrD,CACF,CAEA,SAASG,EAAOxD,EAAMoD,GACpB,OAAOA,GACT,CC/NA,SAAS,EAAczG,EAAG8G,EAAMP,EAAQQ,EAAIC,EAAQZ,GAClD,IAAIlD,EAAQ,CAAE2C,MAAO,EAAGE,OAAQ,EAAGK,KAAMA,EAAMa,WAAYH,GACvDI,EAAOF,EAAOF,GAAMV,EAAO,GAC3B9G,EAAO,EAAkBU,EAAG,SAAUkD,EAAOqD,GACjDS,EAAOF,GAAMV,GAAQ9G,EACrBU,EAAEmH,UAAU7H,EAAMyH,GACdG,GACFlH,EAAEmB,QAAQ+F,EAAM5H,EAAM,CAAE2B,OAAQ,GAEpC,CCxBA,SAAS,EAAKjB,GACZ,IAAIoH,EAAUpH,EAAE2B,QAAQ0F,QAAQC,cAChB,OAAZF,GAAgC,OAAZA,GAyB1B,SAAkBpH,GAChB,UAAUA,EAAEQ,SAAS,SAAUX,GAC7B0H,GAAYvH,EAAEsB,KAAKzB,GACrB,IAEA,UAAUG,EAAEY,SAAS,SAAUC,GAC7B,IAAIE,EAAOf,EAAEe,KAAKF,GAClB,UAAUE,EAAKyG,OAAQD,IACnB,UAAMxG,EAAM,MACdwG,GAAYxG,EAEhB,GACF,CApCI0G,CAASzH,GAGK,OAAZoH,GAAgC,OAAZA,KAuC1B,SAAgBpH,GACd,UAAUA,EAAEQ,SAAS,SAAUX,GAC7B6H,GAAU1H,EAAEsB,KAAKzB,GACnB,IAEA,UAAUG,EAAEY,SAAS,SAAUC,GAC7B,IAAIE,EAAOf,EAAEe,KAAKF,GAClB,UAAUE,EAAKyG,OAAQE,IACnB,UAAM3G,EAAM,MACd2G,GAAU3G,EAEd,GACF,CAlDI4G,CAAO3H,GACP4H,EAAgB5H,GAEpB,CAEA,SAAS4H,EAAgB5H,GACvB,UAAUA,EAAEQ,SAAS,SAAUX,GAC7BgI,EAAmB7H,EAAEsB,KAAKzB,GAC5B,IACA,UAAUG,EAAEY,SAAS,SAAUC,GAC7BgH,EAAmB7H,EAAEe,KAAKF,GAC5B,GACF,CAEA,SAASgH,EAAmBlD,GAC1B,IAAI3D,EAAI2D,EAAMkB,MACdlB,EAAMkB,MAAQlB,EAAMoB,OACpBpB,EAAMoB,OAAS/E,CACjB,CAgBA,SAASuG,GAAY5C,GACnBA,EAAMe,GAAKf,EAAMe,CACnB,CAgBA,SAASgC,GAAU/C,GACjB,IAAIc,EAAId,EAAMc,EACdd,EAAMc,EAAId,EAAMe,EAChBf,EAAMe,EAAID,CACZ,CCrDA,SAAS,GAAIzF,GACXA,EAAE2B,QAAQmG,YAAc,GACxB,UAAU9H,EAAEY,SAAS,SAAUG,IAKjC,SAAuBf,EAAGa,GACxB,IAYIgE,EAAOF,EAAOzC,EAZdrC,EAAIgB,EAAEhB,EACNkI,EAAQ/H,EAAEsB,KAAKzB,GAAGuG,KAClBpF,EAAIH,EAAEG,EACNgH,EAAQhI,EAAEsB,KAAKN,GAAGoF,KAClB/C,EAAOxC,EAAEwC,KACT4E,EAAYjI,EAAEe,KAAKF,GACnBqH,EAAYD,EAAUC,UAE1B,GAAIF,IAAUD,EAAQ,EAAG,OAKzB,IAHA/H,EAAEmD,WAAWtC,GAGRqB,EAAI,IAAK6F,EAAOA,EAAQC,IAAS9F,IAAK6F,EACzCE,EAAUT,OAAS,GAQnB3C,EAAQ,EAAkB7E,EAAG,OAP7B2E,EAAQ,CACNkB,MAAO,EACPE,OAAQ,EACRkC,UAAWA,EACXE,QAAStH,EACTuF,KAAM2B,GAEoC,MACxCA,IAAUG,IACZvD,EAAMkB,MAAQoC,EAAUpC,MACxBlB,EAAMoB,OAASkC,EAAUlC,OAEzBpB,EAAME,MAAQ,aAEdF,EAAMyD,SAAWH,EAAUG,UAE7BpI,EAAEmB,QAAQtB,EAAGgF,EAAO,CAAE5D,OAAQgH,EAAUhH,QAAUoC,GACxC,IAANnB,GACFlC,EAAE2B,QAAQmG,YAAYvI,KAAKsF,GAE7BhF,EAAIgF,EAGN7E,EAAEmB,QAAQtB,EAAGmB,EAAG,CAAEC,OAAQgH,EAAUhH,QAAUoC,EAChD,CA5CIgF,CAAcrI,EAAGe,EACnB,GACF,CA4CA,SAAS,GAAKf,GACZ,UAAUA,EAAE2B,QAAQmG,aAAa,SAAUjI,GACzC,IAEImB,EAFAM,EAAOtB,EAAEsB,KAAKzB,GACdyI,EAAYhH,EAAK2G,UAGrB,IADAjI,EAAEmB,QAAQG,EAAK6G,QAASG,GACjBhH,EAAKuD,OACV7D,EAAIhB,EAAEuI,WAAW1I,GAAG,GACpBG,EAAEiC,WAAWpC,GACbyI,EAAUd,OAAOjI,KAAK,CAAEkG,EAAGnE,EAAKmE,EAAGC,EAAGpE,EAAKoE,IACxB,eAAfpE,EAAKuD,QACPyD,EAAU7C,EAAInE,EAAKmE,EACnB6C,EAAU5C,EAAIpE,EAAKoE,EACnB4C,EAAUzC,MAAQvE,EAAKuE,MACvByC,EAAUvC,OAASzE,EAAKyE,QAE1BlG,EAAImB,EACJM,EAAOtB,EAAEsB,KAAKzB,EAElB,GACF,CCzDA,SANA,SAAe2D,EAAOC,GACpB,OAAQD,GAASA,EAAMzB,OACnB,EAAayB,GAAO,aAAaC,EAAU,GAAI,QAC/ClB,CACN,ECNA,SAASiG,GAAYxI,GACnB,IAAI+C,EAAU,CAAC,EA2Bf,UAAU/C,EAAE8B,WAzBZ,SAASkB,EAAInD,GACX,IAAIqD,EAAQlD,EAAEsB,KAAKzB,GACnB,GAAI,UAAMkD,EAASlD,GACjB,OAAOqD,EAAMkD,KAEfrD,EAAQlD,IAAK,EAEb,IAAIuG,EAAO,EACT,UAAMpG,EAAEqC,SAASxC,IAAI,SAAUgB,GAC7B,OAAOmC,EAAInC,EAAEG,GAAKhB,EAAEe,KAAKF,GAAG4H,MAC9B,KAYF,OARErC,IAASsC,OAAOC,mBAAhBvC,MACAA,IAIAA,EAAO,GAGDlD,EAAMkD,KAAOA,CACvB,GAGF,CAMA,SAASwC,GAAM5I,EAAGa,GAChB,OAAOb,EAAEsB,KAAKT,EAAEG,GAAGoF,KAAOpG,EAAEsB,KAAKT,EAAEhB,GAAGuG,KAAOpG,EAAEe,KAAKF,GAAG4H,MACzD,CC/BA,SAASI,GAAa7I,GACpB,IAOIe,EAAM+H,EAPNC,EAAI,IAAI,EAAA1I,MAAM,CAAE2I,UAAU,IAG1BtC,EAAQ1G,EAAEQ,QAAQ,GAClByI,EAAOjJ,EAAEE,YAIb,IAHA6I,EAAEtI,QAAQiG,EAAO,CAAC,GAGXwC,GAAUH,EAAG/I,GAAKiJ,GACvBlI,EAAOoI,GAAiBJ,EAAG/I,GAC3B8I,EAAQC,EAAEnE,QAAQ7D,EAAKlB,GAAK+I,GAAM5I,EAAGe,IAAS6H,GAAM5I,EAAGe,GACvDqI,GAAWL,EAAG/I,EAAG8I,GAGnB,OAAOC,CACT,CAMA,SAASG,GAAUH,EAAG/I,GAcpB,OADA,UAAU+I,EAAEvI,SAZZ,SAASwC,EAAInD,GACX,UAAUG,EAAEqJ,UAAUxJ,IAAI,SAAUgB,GAClC,IAAIyI,EAAQzI,EAAEhB,EACZmB,EAAInB,IAAMyJ,EAAQzI,EAAEG,EAAIsI,EACrBP,EAAEnE,QAAQ5D,IAAO4H,GAAM5I,EAAGa,KAC7BkI,EAAEtI,QAAQO,EAAG,CAAC,GACd+H,EAAE5H,QAAQtB,EAAGmB,EAAG,CAAC,GACjBgC,EAAIhC,GAER,GACF,IAGO+H,EAAE7I,WACX,CAMA,SAASiJ,GAAiBJ,EAAG/I,GAC3B,OAAO,GAAQA,EAAEY,SAAS,SAAUC,GAClC,GAAIkI,EAAEnE,QAAQ/D,EAAEhB,KAAOkJ,EAAEnE,QAAQ/D,EAAEG,GACjC,OAAO4H,GAAM5I,EAAGa,EAEpB,GACF,CAEA,SAASuI,GAAWL,EAAG/I,EAAG8I,GACxB,UAAUC,EAAEvI,SAAS,SAAUX,GAC7BG,EAAEsB,KAAKzB,GAAGuG,MAAQ0C,CACpB,GACF,C,qCCjFIS,GAAYnI,KAAKC,IAiDrB,SAZA,SAAmBmC,EAAOgG,EAAWC,GACnC,IAAI1H,EAAkB,MAATyB,EAAgB,EAAIA,EAAMzB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI4B,EAAqB,MAAb8F,EAAoB,GAAI,EAAAC,GAAA,SAAUD,GAI9C,OAHI9F,EAAQ,IACVA,EAAQ4F,GAAUxH,EAAS4B,EAAO,KAE7B,cAAcH,GAAO,aAAagG,EAAW,GAAI7F,EAC1D,ECXA,UAFW,cAAW,I,eClCI,UAAW,G,uECDX,UAAW,G,2DCyBrC,SALA,SAAkBC,GAChB,MAAuB,iBAATA,KACV,EAAA+F,GAAA,SAAQ/F,KAAU,EAAAgG,GAAA,SAAahG,IArBrB,oBAqB+B,cAAWA,EAC1D,EChBA,UAFgB,E,QAAA,SAAa,UCR7B,IAWIiG,GAAeC,OAAO,uFAa1B,SAJA,SAAoBC,GAClB,OAAOF,GAAaG,KAAKD,EAC3B,ECtBA,IAAI,GAAgB,kBAQhBE,GAAW,IAAM,GAAgB,IACjCC,GAAU,kDACVC,GAAS,2BAETC,GAAc,KAAO,GAAgB,IACrCC,GAAa,kCACbC,GAAa,qCAIbC,GAPa,MAAQL,GAAU,IAAMC,GAAS,IAOtB,IACxBK,GAAW,oBAEXC,GAAQD,GAAWD,IADP,gBAAwB,CAACH,GAAaC,GAAYC,IAAY3K,KAAK,KAAO,IAAM6K,GAAWD,GAAW,MAElHG,GAAW,MAAQ,CAACN,GAAcF,GAAU,IAAKA,GAASG,GAAYC,GAAYL,IAAUtK,KAAK,KAAO,IAGxGgL,GAAYb,OAAOK,GAAS,MAAQA,GAAS,KAAOO,GAAWD,GAAO,KAiB1E,SARA,SAAqBV,GAEnB,IADA,IAAI/F,EAAS2G,GAAUC,UAAY,EAC5BD,GAAUX,KAAKD,MAClB/F,EAEJ,OAAOA,CACT,ECxBA,SANA,SAAoB+F,GAClB,OAAO,GAAWA,GACd,GAAYA,GACZ,GAAUA,EAChB,EC8BA,SAdA,SAAcc,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,IAAI,EAAAC,GAAA,SAAYD,GACd,OAAO,GAASA,GAAc,GAAWA,GAAcA,EAAW9I,OAEpE,IAAIgJ,GAAM,cAAOF,GACjB,MAhCW,gBAgCPE,GA/BO,gBA+BUA,EACZF,EAAW5B,MAEb,cAAS4B,GAAY9I,MAC9B,ECrCA,SAASiJ,GAAQhL,GACf,IAAI+C,EAAU,CAAC,EACXD,EAAQ,CAAC,EACTjB,EAAU,GAkBd,GAFA,UAAO7B,EAAEgC,SAdT,SAASiJ,EAAM3J,GACb,GAAI,UAAMwB,EAAOxB,GACf,MAAM,IAAI4J,GAGP,UAAMnI,EAASzB,KAClBwB,EAAMxB,IAAQ,EACdyB,EAAQzB,IAAQ,EAChB,UAAOtB,EAAEmL,aAAa7J,GAAO2J,UACtBnI,EAAMxB,GACbO,EAAQtC,KAAK+B,GAEjB,IAII,GAAOyB,KAAa/C,EAAEE,YACxB,MAAM,IAAIgL,GAGZ,OAAOrJ,CACT,CAEA,SAASqJ,KAAkB,CCtB3B,SAASlI,GAAIhD,EAAGoL,EAAI/E,GACb,WAAU+E,KACbA,EAAK,CAACA,IAGR,IAAIC,GAAcrL,EAAEsL,aAAetL,EAAEuI,WAAavI,EAAEuL,WAAWC,KAAKxL,GAEhEyL,EAAM,GACN1I,EAAU,CAAC,EAQf,OAPA,UAAOqI,GAAI,SAAUvL,GACnB,IAAKG,EAAE4E,QAAQ/E,GACb,MAAM,IAAImG,MAAM,6BAA+BnG,GAGjD6L,GAAM1L,EAAGH,EAAa,SAAVwG,EAAkBtD,EAASsI,EAAYI,EACrD,IACOA,CACT,CAEA,SAASC,GAAM1L,EAAGH,EAAG8L,EAAW5I,EAASsI,EAAYI,GAC9C,UAAM1I,EAASlD,KAClBkD,EAAQlD,IAAK,EAER8L,GACHF,EAAIlM,KAAKM,GAEX,UAAOwL,EAAWxL,IAAI,SAAUmB,GAC9B0K,GAAM1L,EAAGgB,EAAG2K,EAAW5I,EAASsI,EAAYI,EAC9C,IACIE,GACFF,EAAIlM,KAAKM,GAGf,CDzCAmL,GAAQE,eAAiBA,GA+BzBA,GAAeU,UAAY,IAAI5F,M,QEc/B,SAAS6F,GAAe7L,GACtBA,EnBZF,SAAkBA,GAChB,IAAI+E,GAAa,IAAI,EAAA1E,OAAQ6E,SAASlF,EAAE2B,SAYxC,OAXA,UAAU3B,EAAEQ,SAAS,SAAUX,GAC7BkF,EAAWtE,QAAQZ,EAAGG,EAAEsB,KAAKzB,GAC/B,IACA,UAAUG,EAAEY,SAAS,SAAUC,GAC7B,IAAIiL,EAAc/G,EAAWhE,KAAKF,EAAEhB,EAAGgB,EAAEG,IAAM,CAAEC,OAAQ,EAAGwH,OAAQ,GAChEvF,EAAQlD,EAAEe,KAAKF,GACnBkE,EAAW5D,QAAQN,EAAEhB,EAAGgB,EAAEG,EAAG,CAC3BC,OAAQ6K,EAAY7K,OAASiC,EAAMjC,OACnCwH,OAAQrH,KAAKC,IAAIyK,EAAYrD,OAAQvF,EAAMuF,SAE/C,IACO1D,CACT,CmBFMgH,CAAS/L,GACbwI,GAAYxI,GACZ,IAIIa,EAJAkI,EAAIF,GAAa7I,GAKrB,IAJAgM,GAAiBjD,GACjBkD,GAAclD,EAAG/I,GAGTa,EAAIqL,GAAUnD,IAEpBoD,GAAcpD,EAAG/I,EAAGa,EADhBuL,GAAUrD,EAAG/I,EAAGa,GAGxB,CAKA,SAASoL,GAAclD,EAAG/I,GACxB,IAAIoL,EC/DN,SAAmBpL,EAAGoL,GACpB,OAAOpI,GAAIhD,EAAGoL,EAAI,OACpB,CD6DW,CAAcrC,EAAGA,EAAEvI,SAC5B4K,EAAKA,EAAGiB,MAAM,EAAGjB,EAAGrJ,OAAS,GAC7B,UAAUqJ,GAAI,SAAUvL,IAK1B,SAAwBkJ,EAAG/I,EAAGsM,GAC5B,IAAIC,EAAWxD,EAAEzH,KAAKgL,GAClBE,EAASD,EAASC,OACtBzD,EAAEhI,KAAKuL,EAAOE,GAAQC,SAAWC,GAAa3D,EAAG/I,EAAGsM,EACtD,CARIK,CAAe5D,EAAG/I,EAAGH,EACvB,GACF,CAYA,SAAS6M,GAAa3D,EAAG/I,EAAGsM,GAC1B,IACIE,EADWzD,EAAEzH,KAAKgL,GACAE,OAElBI,GAAc,EAEdC,EAAY7M,EAAEe,KAAKuL,EAAOE,GAE1BM,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAY7M,EAAEe,KAAKyL,EAAQF,IAG7BQ,EAAWD,EAAU5L,OAErB,UAAUjB,EAAEqJ,UAAUiD,IAAQ,SAAUzL,GACtC,IA2HsBkM,EAAGlN,EA3HrBmN,EAAYnM,EAAEhB,IAAMyM,EACtBrI,EAAQ+I,EAAYnM,EAAEG,EAAIH,EAAEhB,EAE9B,GAAIoE,IAAUuI,EAAQ,CACpB,IAAIS,EAAeD,IAAcJ,EAC/BM,EAAclN,EAAEe,KAAKF,GAAGI,OAG1B,GADA6L,GAAYG,EAAeC,GAAeA,EAoHtBH,EAnHFT,EAmHKzM,EAnHEoE,EAAV8E,EAoHPoE,QAAQJ,EAAGlN,GApHc,CAC/B,IAAIuN,EAAgBrE,EAAEhI,KAAKuL,EAAOrI,GAAOwI,SACzCK,GAAYG,GAAgBG,EAAgBA,CAC9C,CACF,CACF,IAEON,CACT,CAEA,SAASd,GAAiBqB,EAAMC,GAC1B9G,UAAUzE,OAAS,IACrBuL,EAAOD,EAAK7M,QAAQ,IAEtB+M,GAAgBF,EAAM,CAAC,EAAG,EAAGC,EAC/B,CAEA,SAASC,GAAgBF,EAAMtK,EAASyK,EAAS3N,EAAG2M,GAClD,IAAIiB,EAAMD,EACNtK,EAAQmK,EAAK/L,KAAKzB,GAkBtB,OAhBAkD,EAAQlD,IAAK,EACb,UAAUwN,EAAK9B,UAAU1L,IAAI,SAAUmB,GAChC,UAAM+B,EAAS/B,KAClBwM,EAAUD,GAAgBF,EAAMtK,EAASyK,EAASxM,EAAGnB,GAEzD,IAEAqD,EAAMuK,IAAMA,EACZvK,EAAMwK,IAAMF,IACRhB,EACFtJ,EAAMsJ,OAASA,SAGRtJ,EAAMsJ,OAGRgB,CACT,CAEA,SAAStB,GAAUmB,GACjB,OAAO,GAAOA,EAAKzM,SAAS,SAAUC,GACpC,OAAOwM,EAAKtM,KAAKF,GAAG4L,SAAW,CACjC,GACF,CAEA,SAASL,GAAUrD,EAAG/I,EAAGe,GACvB,IAAIlB,EAAIkB,EAAKlB,EACTmB,EAAID,EAAKC,EAKRhB,EAAEmN,QAAQtN,EAAGmB,KAChBnB,EAAIkB,EAAKC,EACTA,EAAID,EAAKlB,GAGX,IAAI8N,EAAS5E,EAAEzH,KAAKzB,GAChB+N,EAAS7E,EAAEzH,KAAKN,GAChB6M,EAAYF,EACZG,GAAO,EAIPH,EAAOD,IAAME,EAAOF,MACtBG,EAAYD,EACZE,GAAO,GAGT,IAAIC,EAAa,WAAS/N,EAAEY,SAAS,SAAUG,GAC7C,OACE+M,IAASE,GAAajF,EAAGA,EAAEzH,KAAKP,EAAKlB,GAAIgO,IACzCC,IAASE,GAAajF,EAAGA,EAAEzH,KAAKP,EAAKC,GAAI6M,EAE7C,IAEA,OAAO,GAAQE,GAAY,SAAUhN,GACnC,OAAO6H,GAAM5I,EAAGe,EAClB,GACF,CAEA,SAASoL,GAAcpD,EAAG/I,EAAGa,EAAGoN,GAC9B,IAAIpO,EAAIgB,EAAEhB,EACNmB,EAAIH,EAAEG,EACV+H,EAAE5F,WAAWtD,EAAGmB,GAChB+H,EAAE5H,QAAQ8M,EAAEpO,EAAGoO,EAAEjN,EAAG,CAAC,GACrBgL,GAAiBjD,GACjBkD,GAAclD,EAAG/I,GAInB,SAAqB+I,EAAG/I,GACtB,IAAIsN,EAAO,GAAOvE,EAAEvI,SAAS,SAAUX,GACrC,OAAQG,EAAEsB,KAAKzB,GAAG2M,MACpB,IACIpB,EE1MN,SAAkBpL,EAAGoL,GACnB,OAAOpI,GAAIhD,EAAGoL,EAAI,MACpB,CFwMW,CAAarC,EAAGuE,GACzBlC,EAAKA,EAAGiB,MAAM,GACd,UAAUjB,GAAI,SAAUvL,GACtB,IAAI2M,EAASzD,EAAEzH,KAAKzB,GAAG2M,OACrBzL,EAAOf,EAAEe,KAAKlB,EAAG2M,GACjB0B,GAAU,EAEPnN,IACHA,EAAOf,EAAEe,KAAKyL,EAAQ3M,GACtBqO,GAAU,GAGZlO,EAAEsB,KAAKzB,GAAGuG,KAAOpG,EAAEsB,KAAKkL,GAAQpG,MAAQ8H,EAAUnN,EAAK0H,QAAU1H,EAAK0H,OACxE,GACF,CArBE0F,CAAYpF,EAAG/I,EACjB,CAiCA,SAASgO,GAAaX,EAAMM,EAAQS,GAClC,OAAOA,EAAUX,KAAOE,EAAOD,KAAOC,EAAOD,KAAOU,EAAUV,GAChE,CGlNA,SAAStH,GAAKpG,GACZ,OAAQA,EAAE2B,QAAQ0M,QAChB,IAAK,kBASL,QACEC,GAAqBtO,SAPvB,IAAK,cAcT,SAAyBA,GACvBwI,GAAYxI,GACZ6I,GAAa7I,EACf,CAhBMuO,CAAgBvO,GAChB,MACF,IAAK,eACHwO,GAAkBxO,GAKxB,CH9BA6L,GAAeG,iBAAmBA,GAClCH,GAAeI,cAAgBA,GAC/BJ,GAAea,aAAeA,GAC9Bb,GAAeK,UAAYA,GAC3BL,GAAeO,UAAYA,GAC3BP,GAAeM,cAAgBA,GG4B/B,IAAIqC,GAAoBhG,GAOxB,SAAS8F,GAAqBtO,GAC5B6L,GAAe7L,EACjB,C,0BCvBA,SAAS,GAAIA,GACX,IAAIsN,EAAO,EAAkBtN,EAAG,OAAQ,CAAC,EAAG,SACxCyO,EAqEN,SAAoBzO,GAClB,IAAIyO,EAAS,CAAC,EACd,SAASzL,EAAInD,EAAG6O,GACd,IAAIvJ,EAAWnF,EAAEmF,SAAStF,GACtBsF,GAAYA,EAASpD,QACvB,UAAUoD,GAAU,SAAUmH,GAC5BtJ,EAAIsJ,EAAOoC,EAAQ,EACrB,IAEFD,EAAO5O,GAAK6O,CACd,CAIA,OAHA,UAAU1O,EAAEmF,YAAY,SAAUtF,GAChCmD,EAAInD,EAAG,EACT,IACO4O,CACT,CApFeE,CAAW3O,GACpB+F,EAAS,EAAM,WAAS0I,IAAW,EACnCG,EAAU,EAAI7I,EAAS,EAE3B/F,EAAE2B,QAAQkN,YAAcvB,EAGxB,UAAUtN,EAAEY,SAAS,SAAUC,GAC7Bb,EAAEe,KAAKF,GAAG4H,QAAUmG,CACtB,IAGA,IAAI3N,EA0EN,SAAoBjB,GAClB,OAAO,WACLA,EAAEY,SACF,SAAU6K,EAAK5K,GACb,OAAO4K,EAAMzL,EAAEe,KAAKF,GAAGI,MACzB,GACA,EAEJ,CAlFe6N,CAAW9O,GAAK,EAG7B,UAAUA,EAAEmF,YAAY,SAAUmH,GAChC,GAAItM,EAAGsN,EAAMsB,EAAS3N,EAAQ8E,EAAQ0I,EAAQnC,EAChD,IAIAtM,EAAE2B,QAAQoN,eAAiBH,CAC7B,CAEA,SAAS,GAAI5O,EAAGsN,EAAMsB,EAAS3N,EAAQ8E,EAAQ0I,EAAQ5O,GACrD,IAAIsF,EAAWnF,EAAEmF,SAAStF,GAC1B,GAAKsF,EAASpD,OAAd,CAOA,IAAIiN,EAAM,EAAmBhP,EAAG,OAC5BiP,EAAS,EAAmBjP,EAAG,OAC/BkD,EAAQlD,EAAEsB,KAAKzB,GAEnBG,EAAEmH,UAAU6H,EAAKnP,GACjBqD,EAAMgM,UAAYF,EAClBhP,EAAEmH,UAAU8H,EAAQpP,GACpBqD,EAAMiM,aAAeF,EAErB,UAAU9J,GAAU,SAAUmH,GAC5B,GAAItM,EAAGsN,EAAMsB,EAAS3N,EAAQ8E,EAAQ0I,EAAQnC,GAE9C,IAAI8C,EAAYpP,EAAEsB,KAAKgL,GACnB+C,EAAWD,EAAUF,UAAYE,EAAUF,UAAY5C,EACvDgD,EAAcF,EAAUD,aAAeC,EAAUD,aAAe7C,EAChEiD,EAAaH,EAAUF,UAAYjO,EAAS,EAAIA,EAChDwH,EAAS4G,IAAaC,EAAc,EAAIvJ,EAAS0I,EAAO5O,GAAK,EAEjEG,EAAEmB,QAAQ6N,EAAKK,EAAU,CACvBpO,OAAQsO,EACR9G,OAAQA,EACR+G,aAAa,IAGfxP,EAAEmB,QAAQmO,EAAaL,EAAQ,CAC7BhO,OAAQsO,EACR9G,OAAQA,EACR+G,aAAa,GAEjB,IAEKxP,EAAEwM,OAAO3M,IACZG,EAAEmB,QAAQmM,EAAM0B,EAAK,CAAE/N,OAAQ,EAAGwH,OAAQ1C,EAAS0I,EAAO5O,IAlC5D,MAJMA,IAAMyN,GACRtN,EAAEmB,QAAQmM,EAAMzN,EAAG,CAAEoB,OAAQ,EAAGwH,OAAQmG,GAuC9C,C,eC9DA,SAASa,GAAgBzP,EAAGoG,EAAMsJ,GAChC,IAAIpC,EAmCN,SAAwBtN,GACtB,IAAIH,EACJ,KAAOG,EAAE4E,QAAS/E,EAAI,UAAW,YACjC,OAAOA,CACT,CAvCa8P,CAAe3P,GACxBgE,EAAS,IAAI,EAAA3D,MAAM,CAAEuP,UAAU,IAC5B1K,SAAS,CAAEoI,KAAMA,IACjBuC,qBAAoB,SAAUhQ,GAC7B,OAAOG,EAAEsB,KAAKzB,EAChB,IA2BJ,OAzBA,UAAUG,EAAEQ,SAAS,SAAUX,GAC7B,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GAChB2M,EAASxM,EAAEwM,OAAO3M,IAEhByB,EAAK8E,OAASA,GAAS9E,EAAKwO,SAAW1J,GAAQA,GAAQ9E,EAAKyO,WAC9D/L,EAAOvD,QAAQZ,GACfmE,EAAOmD,UAAUtH,EAAG2M,GAAUc,GAG9B,UAAUtN,EAAE0P,GAAc7P,IAAI,SAAUgB,GACtC,IAAIkM,EAAIlM,EAAEhB,IAAMA,EAAIgB,EAAEG,EAAIH,EAAEhB,EAC1BkB,EAAOiD,EAAOjD,KAAKgM,EAAGlN,GACtBoB,EAAU,UAAcF,GAAsB,EAAdA,EAAKE,OACvC+C,EAAO7C,QAAQ4L,EAAGlN,EAAG,CAAEoB,OAAQjB,EAAEe,KAAKF,GAAGI,OAASA,GACpD,IAEI,UAAMK,EAAM,YACd0C,EAAOvD,QAAQZ,EAAG,CAChBmQ,WAAY1O,EAAK0O,WAAW5J,GAC5B6J,YAAa3O,EAAK2O,YAAY7J,KAItC,IAEOpC,CACT,C,gDCjDA,SAVA,SAAoBR,EAAO0M,GACzB,IAAInO,EAASyB,EAAMzB,OAGnB,IADAyB,EAAM2M,KAAKD,GACJnO,KACLyB,EAAMzB,GAAUyB,EAAMzB,GAAQ6B,MAEhC,OAAOJ,CACT,E,eCsBA,SA9BA,SAA0BI,EAAOK,GAC/B,GAAIL,IAAUK,EAAO,CACnB,IAAImM,OAAyB7N,IAAVqB,EACfyM,EAAsB,OAAVzM,EACZ0M,EAAiB1M,GAAUA,EAC3B2M,GAAc,EAAAxM,EAAA,SAASH,GAEvB4M,OAAyBjO,IAAV0B,EACfwM,EAAsB,OAAVxM,EACZyM,EAAiBzM,GAAUA,EAC3B0M,GAAc,EAAA5M,EAAA,SAASE,GAE3B,IAAMwM,IAAcE,IAAgBJ,GAAe3M,EAAQK,GACtDsM,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAe/M,EAAQK,GACtD0M,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,ECKA,SA3BA,SAAyBvM,EAAQF,EAAO2M,GAOtC,IANA,IAAIjN,GAAS,EACTkN,EAAc1M,EAAO2M,SACrBC,EAAc9M,EAAM6M,SACpB/O,EAAS8O,EAAY9O,OACrBiP,EAAeJ,EAAO7O,SAEjB4B,EAAQ5B,GAAQ,CACvB,IAAIiC,EAAS,GAAiB6M,EAAYlN,GAAQoN,EAAYpN,IAC9D,GAAIK,EACF,OAAIL,GAASqN,EACJhN,EAGFA,GAAmB,QADd4M,EAAOjN,IACiB,EAAI,EAE5C,CAQA,OAAOQ,EAAOR,MAAQM,EAAMN,KAC9B,ECOA,SA7BA,SAAqBkH,EAAYoG,EAAWL,GAExCK,EADEA,EAAUlP,QACA,cAASkP,GAAW,SAASxN,GACvC,OAAI,EAAAkG,GAAA,SAAQlG,GACH,SAASG,GACd,OAAO,cAAQA,EAA2B,IAApBH,EAAS1B,OAAe0B,EAAS,GAAKA,EAC9D,EAEKA,CACT,IAEY,CAACS,EAAA,SAGf,IAAIP,GAAS,EACbsN,GAAY,cAASA,GAAW,cAAU,YAE1C,IAAIjN,GAAS,cAAQ6G,GAAY,SAASjH,EAAOQ,EAAKyG,GAIpD,MAAO,CAAE,UAHM,cAASoG,GAAW,SAASxN,GAC1C,OAAOA,EAASG,EAClB,IAC+B,QAAWD,EAAO,MAASC,EAC5D,IAEA,OAAO,GAAWI,GAAQ,SAASG,EAAQF,GACzC,OAAO,GAAgBE,EAAQF,EAAO2M,EACxC,GACF,E,0BCCA,UAba,eAAS,SAAS/F,EAAYoG,GACzC,GAAkB,MAAdpG,EACF,MAAO,GAET,IAAI9I,EAASkP,EAAUlP,OAMvB,OALIA,EAAS,IAAK,cAAe8I,EAAYoG,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHlP,EAAS,IAAK,cAAekP,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElB,GAAYpG,GAAY,cAAYoG,EAAW,GAAI,GAC5D,ICzBA,SAASC,GAAWlR,EAAGmG,GAErB,IADA,IAAIgL,EAAK,EACAjP,EAAI,EAAGA,EAAIiE,EAASpE,SAAUG,EACrCiP,GAAMC,GAAmBpR,EAAGmG,EAASjE,EAAI,GAAIiE,EAASjE,IAExD,OAAOiP,CACT,CAEA,SAASC,GAAmBpR,EAAGqR,EAAYC,GAuBzC,IAnBA,IAAIC,EAAW,EACbD,EACA,UAAMA,GAAY,SAAUzR,EAAGqC,GAC7B,OAAOA,CACT,KAEEsP,EAAe,UACjB,UAAMH,GAAY,SAAUxR,GAC1B,OAAO,GACL,UAAMG,EAAEqC,SAASxC,IAAI,SAAUgB,GAC7B,MAAO,CAAE4Q,IAAKF,EAAS1Q,EAAEG,GAAIC,OAAQjB,EAAEe,KAAKF,GAAGI,OACjD,IACA,MAEJ,KAIEyQ,EAAa,EACVA,EAAaJ,EAAWvP,QAAQ2P,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIrE,EAAO,UAAM,IAAIuE,MAAMD,IAAW,WACpC,OAAO,CACT,IAGIR,EAAK,EAqBT,OApBA,UAEEK,EAAaK,SAAQ,SAAU5S,GAC7B,IAAI0E,EAAQ1E,EAAMwS,IAAMC,EACxBrE,EAAK1J,IAAU1E,EAAMgC,OAGrB,IAFA,IAAI6Q,EAAY,EAETnO,EAAQ,GAETA,EAAQ,IACVmO,GAAazE,EAAK1J,EAAQ,IAI5B0J,EADA1J,EAASA,EAAQ,GAAM,IACR1E,EAAMgC,OAEvBkQ,GAAMlS,EAAMgC,OAAS6Q,CACvB,KAGKX,CACT,CCpDA,SAASY,GAAiBC,EAASC,GACjC,IAAIC,EAAgB,CAAC,EA+BrB,OA9BA,UAAUF,GAAS,SAAU/S,EAAOiD,GAClC,IAAIiQ,EAAOD,EAAcjT,EAAMY,GAAK,CAClCuS,SAAU,EACV1R,GAAI,GACJC,IAAK,GACLyK,GAAI,CAACnM,EAAMY,GACXqC,EAAGA,GAEA,UAAcjD,EAAMoT,cAEvBF,EAAIE,WAAapT,EAAMoT,WAEvBF,EAAIlR,OAAShC,EAAMgC,OAEvB,IAEA,UAAUgR,EAAGrR,SAAS,SAAUC,GAC9B,IAAIyR,EAASJ,EAAcrR,EAAEhB,GACzB0S,EAASL,EAAcrR,EAAEG,GACxB,UAAcsR,IAAY,UAAcC,KAC3CA,EAAOH,WACPE,EAAO3R,IAAIpB,KAAK2S,EAAcrR,EAAEG,IAEpC,IAUF,SAA4BwR,GAC1B,IAAIR,EAAU,GAEd,SAASS,EAASC,GAChB,OAAO,SAAUjQ,GACXA,EAAOkQ,SAIT,UAAclQ,EAAO4P,aACrB,UAAcK,EAAOL,aACrB5P,EAAO4P,YAAcK,EAAOL,aAiCpC,SAAsBO,EAAQC,GAC5B,IAAIC,EAAM,EACN7R,EAAS,EAET2R,EAAO3R,SACT6R,GAAOF,EAAOP,WAAaO,EAAO3R,OAClCA,GAAU2R,EAAO3R,QAGf4R,EAAO5R,SACT6R,GAAOD,EAAOR,WAAaQ,EAAO5R,OAClCA,GAAU4R,EAAO5R,QAGnB2R,EAAOxH,GAAKyH,EAAOzH,GAAGjJ,OAAOyQ,EAAOxH,IACpCwH,EAAOP,WAAaS,EAAM7R,EAC1B2R,EAAO3R,OAASA,EAChB2R,EAAO1Q,EAAId,KAAK2R,IAAIF,EAAO3Q,EAAG0Q,EAAO1Q,GACrC2Q,EAAOF,QAAS,CAClB,CAlDQK,CAAaN,EAAQjQ,EAEzB,CACF,CAEA,SAASwQ,EAAUP,GACjB,OAAO,SAAUhQ,GACfA,EAAW,GAAEnD,KAAKmT,GACQ,KAApBhQ,EAAO0P,UACXI,EAAUjT,KAAKmD,EAEnB,CACF,CAEA,KAAO8P,EAAUzQ,QAAQ,CACvB,IAAI9C,EAAQuT,EAAUU,MACtBlB,EAAQzS,KAAKN,GACb,UAAUA,EAAU,GAAEkU,UAAWV,EAASxT,IAC1C,UAAUA,EAAM0B,IAAKsS,EAAUhU,GACjC,CAEA,OAAO,UACL,WAAS+S,GAAS,SAAU/S,GAC1B,OAAQA,EAAM0T,MAChB,KACA,SAAU1T,GACR,OAAO,UAAOA,EAAO,CAAC,KAAM,IAAK,aAAc,UACjD,GAEJ,CA7CSmU,CALS,WAASlB,GAAe,SAAUjT,GAEhD,OAAQA,EAAMmT,QAChB,IAGF,CCzDA,SAASjC,GAAK6B,EAASqB,GACrB,IA0CuBC,EA1CnBC,EhCwNN,SAAmB1I,EAAYpE,GAC7B,IAAIzC,EAAS,CAAEwP,IAAK,GAAIC,IAAK,IAQ7B,OAPA,UAAU5I,GAAY,SAAUjH,GAC1B6C,EAAG7C,GACLI,EAAOwP,IAAIjU,KAAKqE,GAEhBI,EAAOyP,IAAIlU,KAAKqE,EAEpB,IACOI,CACT,CgClOc,CAAegO,GAAS,SAAU/S,GAC5C,OAAO,UAAMA,EAAO,aACtB,IACIyU,EAAWH,EAAMC,IACnBG,EAAa,GAASJ,EAAME,KAAK,SAAUxU,GACzC,OAAQA,EAAMiD,CAChB,IACAkJ,EAAK,GACL0H,EAAM,EACN7R,EAAS,EACT2S,EAAU,EAEZF,EAASvD,MA8BcmD,IA9BSD,EA+BzB,SAAUf,EAAQC,GACvB,OAAID,EAAOD,WAAaE,EAAOF,YACrB,EACCC,EAAOD,WAAaE,EAAOF,WAC7B,EAGDiB,EAA6Bf,EAAOrQ,EAAIoQ,EAAOpQ,EAAxCoQ,EAAOpQ,EAAIqQ,EAAOrQ,CACnC,IArCA0R,EAAUC,GAAkBzI,EAAIuI,EAAYC,GAE5C,UAAUF,GAAU,SAAUzU,GAC5B2U,GAAW3U,EAAMmM,GAAGrJ,OACpBqJ,EAAG7L,KAAKN,EAAMmM,IACd0H,GAAO7T,EAAMoT,WAAapT,EAAMgC,OAChCA,GAAUhC,EAAMgC,OAChB2S,EAAUC,GAAkBzI,EAAIuI,EAAYC,EAC9C,IAEA,IAAI5P,EAAS,CAAEoH,GAAI,UAAUA,IAK7B,OAJInK,IACF+C,EAAOqO,WAAaS,EAAM7R,EAC1B+C,EAAO/C,OAASA,GAEX+C,CACT,CAEA,SAAS6P,GAAkBzI,EAAIuI,EAAYhQ,GAEzC,IADA,IAAImQ,EACGH,EAAW5R,SAAW+R,EAAO,EAAOH,IAAazR,GAAKyB,GAC3DgQ,EAAWT,MACX9H,EAAG7L,KAAKuU,EAAK1I,IACbzH,IAEF,OAAOA,CACT,CCvCA,SAASoQ,GAAa/T,EAAGH,EAAGoS,EAAIoB,GAC9B,IAAIW,EAAUhU,EAAEmF,SAAStF,GACrByB,EAAOtB,EAAEsB,KAAKzB,GACdoU,EAAK3S,EAAOA,EAAK0O,gBAAazN,EAC9B2R,EAAK5S,EAAOA,EAAK2O,iBAAc1N,EAC/B4R,EAAY,CAAC,EAEbF,IACFD,EAAU,WAASA,GAAS,SAAUhT,GACpC,OAAOA,IAAMiT,GAAMjT,IAAMkT,CAC3B,KAGF,IAAIE,EChBN,SAAoBpU,EAAGgU,GACrB,OAAO,UAAMA,GAAS,SAAUnU,GAC9B,IAAIwU,EAAMrU,EAAEwC,QAAQ3C,GACpB,GAAKwU,EAAItS,OAEF,CACL,IAAIiC,EAAS,WACXqQ,GACA,SAAU5I,EAAK5K,GACb,IAAIE,EAAOf,EAAEe,KAAKF,GAChByT,EAAQtU,EAAEsB,KAAKT,EAAEhB,GACnB,MAAO,CACLiT,IAAKrH,EAAIqH,IAAM/R,EAAKE,OAASqT,EAAMjO,MACnCpF,OAAQwK,EAAIxK,OAASF,EAAKE,OAE9B,GACA,CAAE6R,IAAK,EAAG7R,OAAQ,IAGpB,MAAO,CACLpB,EAAGA,EACHwS,WAAYrO,EAAO8O,IAAM9O,EAAO/C,OAChCA,OAAQ+C,EAAO/C,OAEnB,CApBE,MAAO,CAAEpB,EAAGA,EAqBhB,GACF,CDVoBwS,CAAWrS,EAAGgU,GAChC,UAAUI,GAAa,SAAUnV,GAC/B,GAAIe,EAAEmF,SAASlG,EAAMY,GAAGkC,OAAQ,CAC9B,IAAIwS,EAAiBR,GAAa/T,EAAGf,EAAMY,EAAGoS,EAAIoB,GAClDc,EAAUlV,EAAMY,GAAK0U,EACjB,UAAMA,EAAgB,gBA0CN3B,EAzCD3T,EAyCSgF,EAzCFsQ,EA0CzB,UAAc3B,EAAOP,aAMxBO,EAAOP,WAAapO,EAAMoO,WAC1BO,EAAO3R,OAASgD,EAAMhD,SANtB2R,EAAOP,YACJO,EAAOP,WAAaO,EAAO3R,OAASgD,EAAMoO,WAAapO,EAAMhD,SAC7D2R,EAAO3R,OAASgD,EAAMhD,QACzB2R,EAAO3R,QAAUgD,EAAMhD,QA5CvB,CAuCJ,IAA0B2R,EAAQ3O,CAtChC,IAEA,IAAI+N,EAAUD,GAAiBqC,EAAanC,IAuB9C,SAAyBD,EAASmC,GAChC,UAAUnC,GAAS,SAAU/S,GAC3BA,EAAMmM,GAAK,UACTnM,EAAMmM,GAAG5J,KAAI,SAAU3B,GACrB,OAAIsU,EAAUtU,GACLsU,EAAUtU,GAAGuL,GAEfvL,CACT,IAEJ,GACF,CAjCE2U,CAAgBxC,EAASmC,GAEzB,IAAInQ,EAASmM,GAAK6B,EAASqB,GAE3B,GAAIY,IACFjQ,EAAOoH,GAAK,UAAU,CAAC6I,EAAIjQ,EAAOoH,GAAI8I,IAClClU,EAAEmL,aAAa8I,GAAIlS,QAAQ,CAC7B,IAAI0S,EAASzU,EAAEsB,KAAKtB,EAAEmL,aAAa8I,GAAI,IACrCS,EAAS1U,EAAEsB,KAAKtB,EAAEmL,aAAa+I,GAAI,IAChC,UAAMlQ,EAAQ,gBACjBA,EAAOqO,WAAa,EACpBrO,EAAO/C,OAAS,GAElB+C,EAAOqO,YACJrO,EAAOqO,WAAarO,EAAO/C,OAASwT,EAAOpO,MAAQqO,EAAOrO,QAAUrC,EAAO/C,OAAS,GACvF+C,EAAO/C,QAAU,CACnB,CAGF,OAAO+C,CACT,CE1BA,SAASqC,GAAMrG,GACb,IAAI+P,EAAU,EAAa/P,GACzB2U,EAAkBC,GAAiB5U,EAAG,UAAQ,EAAG+P,EAAU,GAAI,WAC/D8E,EAAgBD,GAAiB5U,EAAG,UAAQ+P,EAAU,GAAI,GAAI,GAAI,YAEhE5J,EChBN,SAAmBnG,GACjB,IAAI+C,EAAU,CAAC,EACX+R,EAAc,WAAS9U,EAAEQ,SAAS,SAAUX,GAC9C,OAAQG,EAAEmF,SAAStF,GAAGkC,MACxB,IACIgO,EAAU,EACZ,UAAM+E,GAAa,SAAUjV,GAC3B,OAAOG,EAAEsB,KAAKzB,GAAGuG,IACnB,KAEE2O,EAAS,UAAM,UAAQhF,EAAU,IAAI,WACvC,MAAO,EACT,IAUIiF,EAAY,GAASF,GAAa,SAAUjV,GAC9C,OAAOG,EAAEsB,KAAKzB,GAAGuG,IACnB,IAGA,OAFA,UAAU4O,GAXV,SAAShS,EAAInD,GACX,IAAI,UAAMkD,EAASlD,GAAnB,CACAkD,EAAQlD,IAAK,EACb,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GAClBkV,EAAOzT,EAAK8E,MAAM7G,KAAKM,GACvB,UAAUG,EAAEuI,WAAW1I,GAAImD,EAJE,CAK/B,IAOO+R,CACT,CDZiBE,CAAUjV,GACzBkV,GAAYlV,EAAGmG,GAKf,IAHA,IACEgP,EADEC,EAAS1M,OAAOC,kBAGXzG,EAAI,EAAGmT,EAAW,EAAGA,EAAW,IAAKnT,IAAKmT,EAAU,CAC3DC,GAAiBpT,EAAI,EAAIyS,EAAkBE,EAAe3S,EAAI,GAAK,GAGnE,IAAIiP,EAAKD,GAAWlR,EADpBmG,EAAW,EAAsBnG,IAE7BmR,EAAKiE,IACPC,EAAW,EACXF,EAAO,WAAYhP,GACnBiP,EAASjE,EAEb,CAEA+D,GAAYlV,EAAGmV,EACjB,CAEA,SAASP,GAAiB5U,EAAGuV,EAAO7F,GAClC,OAAO,UAAM6F,GAAO,SAAUnP,GAC5B,OAAOqJ,GAAgBzP,EAAGoG,EAAMsJ,EAClC,GACF,CAEA,SAAS4F,GAAiBE,EAAanC,GACrC,IAAIpB,EAAK,IAAI,EAAA5R,MACb,UAAUmV,GAAa,SAAUC,GAC/B,IAAInI,EAAOmI,EAAG9T,QAAQ2L,KAClBoI,EAAS3B,GAAa0B,EAAInI,EAAM2E,EAAIoB,GACxC,UAAUqC,EAAOtK,IAAI,SAAUvL,EAAGqC,GAChCuT,EAAGnU,KAAKzB,GAAGwG,MAAQnE,CACrB,IE7DJ,SAAgClC,EAAGiS,EAAI7G,GACrC,IACEuK,EADEzO,EAAO,CAAC,EAGZ,UAAUkE,GAAI,SAAUvL,GAItB,IAHA,IACE2M,EACAoJ,EAFEtJ,EAAQtM,EAAEwM,OAAO3M,GAGdyM,GAAO,CASZ,IARAE,EAASxM,EAAEwM,OAAOF,KAEhBsJ,EAAY1O,EAAKsF,GACjBtF,EAAKsF,GAAUF,IAEfsJ,EAAYD,EACZA,EAAWrJ,GAETsJ,GAAaA,IAActJ,EAE7B,YADA2F,EAAG9Q,QAAQyU,EAAWtJ,GAGxBA,EAAQE,CACV,CACF,GAyBF,CFcIqJ,CAAuBJ,EAAIxD,EAAIyD,EAAOtK,GACxC,GACF,CAEA,SAAS8J,GAAYlV,EAAGmG,GACtB,UAAUA,GAAU,SAAU2P,GAC5B,UAAUA,GAAO,SAAUjW,EAAGqC,GAC5BlC,EAAEsB,KAAKzB,GAAGwG,MAAQnE,CACpB,GACF,GACF,CGxEA,SAAS6T,GAAkB/V,GACzB,IAAIgW,EAoEN,SAAmBhW,GACjB,IAAIgE,EAAS,CAAC,EACV0J,EAAM,EAEV,SAAS1K,EAAInD,GACX,IAAI4N,EAAMC,EACV,UAAU1N,EAAEmF,SAAStF,GAAImD,GACzBgB,EAAOnE,GAAK,CAAE4N,IAAKA,EAAKC,IAAKA,IAC/B,CAGA,OAFA,UAAU1N,EAAEmF,WAAYnC,GAEjBgB,CACT,CAhFsB,CAAUhE,GAE9B,UAAUA,EAAE2B,QAAQmG,aAAa,SAAUjI,GAUzC,IATA,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GACdsI,EAAU7G,EAAK6G,QACf8N,EAsCR,SAAkBjW,EAAGgW,EAAenW,EAAGmB,GACrC,IAIIwL,EACA0J,EALAC,EAAQ,GACRC,EAAQ,GACR3I,EAAMrM,KAAK2R,IAAIiD,EAAcnW,GAAG4N,IAAKuI,EAAchV,GAAGyM,KACtDC,EAAMtM,KAAKC,IAAI2U,EAAcnW,GAAG6N,IAAKsI,EAAchV,GAAG0M,KAK1DlB,EAAS3M,EACT,GACE2M,EAASxM,EAAEwM,OAAOA,GAClB2J,EAAM5W,KAAKiN,SACJA,IAAWwJ,EAAcxJ,GAAQiB,IAAMA,GAAOC,EAAMsI,EAAcxJ,GAAQkB,MACnFwI,EAAM1J,EAGNA,EAASxL,EACT,MAAQwL,EAASxM,EAAEwM,OAAOA,MAAa0J,GACrCE,EAAM7W,KAAKiN,GAGb,MAAO,CAAE6J,KAAMF,EAAMhU,OAAOiU,EAAMjD,WAAY+C,IAAKA,EACrD,CA7DmBI,CAAStW,EAAGgW,EAAe7N,EAAQtI,EAAGsI,EAAQnH,GACzDqV,EAAOJ,EAASI,KAChBH,EAAMD,EAASC,IACfK,EAAU,EACVC,EAAQH,EAAKE,GACbE,GAAY,EAET5W,IAAMsI,EAAQnH,GAAG,CAGtB,GAFAM,EAAOtB,EAAEsB,KAAKzB,GAEV4W,EAAW,CACb,MAAQD,EAAQH,EAAKE,MAAcL,GAAOlW,EAAEsB,KAAKkV,GAAOzG,QAAUzO,EAAK8E,MACrEmQ,IAGEC,IAAUN,IACZO,GAAY,EAEhB,CAEA,IAAKA,EAAW,CACd,KACEF,EAAUF,EAAKtU,OAAS,GACxB/B,EAAEsB,KAAMkV,EAAQH,EAAKE,EAAU,IAAKzG,SAAWxO,EAAK8E,MAEpDmQ,IAEFC,EAAQH,EAAKE,EACf,CAEAvW,EAAEmH,UAAUtH,EAAG2W,GACf3W,EAAIG,EAAEuI,WAAW1I,GAAG,EACtB,CACF,GACF,C,eCTA,SAJA,SAAgBsE,EAAQV,GACtB,OAAOU,IAAU,aAAWA,GAAQ,cAAaV,GACnD,E,0BCKA,SANA,SAAeU,EAAQV,GACrB,OAAiB,MAAVU,EACHA,GACA,cAAQA,GAAQ,cAAaV,GAAWiT,GAAA,QAC9C,ECGA,SAASC,GAAmB3W,EAAGmG,GAC7B,IAAIyQ,EAAY,CAAC,EAoCjB,OADA,WAASzQ,GAjCT,SAAoB0Q,EAAWf,GAC7B,IAEEgB,EAAK,EAGLC,EAAU,EACVC,EAAkBH,EAAU9U,OAC5BkV,EAAW,EAAOnB,GAsBpB,OApBA,UAAUA,GAAO,SAAUjW,EAAGqC,GAC5B,IAAIlB,EAsEV,SAAmChB,EAAGH,GACpC,GAAIG,EAAEsB,KAAKzB,GAAGgF,MACZ,OAAO,GAAO7E,EAAEmL,aAAatL,IAAI,SAAUkN,GACzC,OAAO/M,EAAEsB,KAAKyL,GAAGlI,KACnB,GAEJ,CA5EcqS,CAA0BlX,EAAGH,GACnCsX,EAAKnW,EAAIhB,EAAEsB,KAAKN,GAAGqF,MAAQ2Q,GAEzBhW,GAAKnB,IAAMoX,KACb,UAAUnB,EAAMzJ,MAAM0K,EAAS7U,EAAI,IAAI,SAAUkV,GAC/C,UAAUpX,EAAEmL,aAAaiM,IAAW,SAAUrK,GAC5C,IAAIsK,EAASrX,EAAEsB,KAAKyL,GAClBuK,EAAOD,EAAOhR,QACXiR,EAAOR,GAAMK,EAAKG,IAAWD,EAAOxS,OAAS7E,EAAEsB,KAAK8V,GAAUvS,OACjE0S,GAAYX,EAAW7J,EAAGqK,EAE9B,GACF,IAEAL,EAAU7U,EAAI,EACd4U,EAAKK,EAET,IAEOrB,CACT,IAGOc,CACT,CAsDA,SAASW,GAAYX,EAAW/W,EAAGmB,GACjC,GAAInB,EAAImB,EAAG,CACT,IAAImR,EAAMtS,EACVA,EAAImB,EACJA,EAAImR,CACN,CAEA,IAAIqF,EAAaZ,EAAU/W,GACtB2X,IACHZ,EAAU/W,GAAK2X,EAAa,CAAC,GAE/BA,EAAWxW,IAAK,CAClB,CAEA,SAASyW,GAAYb,EAAW/W,EAAGmB,GACjC,GAAInB,EAAImB,EAAG,CACT,IAAImR,EAAMtS,EACVA,EAAImB,EACJA,EAAImR,CACN,CACA,OAAO,UAAMyE,EAAU/W,GAAImB,EAC7B,CAkDA,SAAS0W,GAAqB1X,EAAGmG,EAAUmH,EAAMqK,EAAOC,GAMtD,IAAIC,EAAK,CAAC,EACRC,EAkDJ,SAAyB9X,EAAGmG,EAAUmH,EAAMsK,GAC1C,IAAIG,EAAa,IAAI,EAAA1X,MACnB2X,EAAahY,EAAE2B,QACfsW,EAgHJ,SAAarJ,EAASsJ,EAASN,GAC7B,OAAO,SAAU5X,EAAGH,EAAGmB,GACrB,IAGI8H,EAHA6E,EAAS3N,EAAEsB,KAAKzB,GAChB+N,EAAS5N,EAAEsB,KAAKN,GAChB8R,EAAM,EAIV,GADAA,GAAOnF,EAAO9H,MAAQ,EAClB,UAAM8H,EAAQ,YAChB,OAAQA,EAAOvF,SAASd,eACtB,IAAK,IACHwB,GAAS6E,EAAO9H,MAAQ,EACxB,MACF,IAAK,IACHiD,EAAQ6E,EAAO9H,MAAQ,EAa7B,GATIiD,IACFgK,GAAO8E,EAAa9O,GAASA,GAE/BA,EAAQ,EAERgK,IAAQnF,EAAO9I,MAAQqT,EAAUtJ,GAAW,EAC5CkE,IAAQlF,EAAO/I,MAAQqT,EAAUtJ,GAAW,EAE5CkE,GAAOlF,EAAO/H,MAAQ,EAClB,UAAM+H,EAAQ,YAChB,OAAQA,EAAOxF,SAASd,eACtB,IAAK,IACHwB,EAAQ8E,EAAO/H,MAAQ,EACvB,MACF,IAAK,IACHiD,GAAS8E,EAAO/H,MAAQ,EAS9B,OALIiD,IACFgK,GAAO8E,EAAa9O,GAASA,GAE/BA,EAAQ,EAEDgK,CACT,CACF,CA5JYqF,CAAIH,EAAWI,QAASJ,EAAWK,QAAST,GAgBtD,OAdA,UAAUzR,GAAU,SAAU2P,GAC5B,IAAI/I,EACJ,UAAU+I,GAAO,SAAUjW,GACzB,IAAIyY,EAAQhL,EAAKzN,GAEjB,GADAkY,EAAWtX,QAAQ6X,GACfvL,EAAG,CACL,IAAIwL,EAAQjL,EAAKP,GACfyL,EAAUT,EAAWhX,KAAKwX,EAAOD,GACnCP,EAAW5W,QAAQoX,EAAOD,EAAOlX,KAAKC,IAAI4W,EAAMjY,EAAGH,EAAGkN,GAAIyL,GAAW,GACvE,CACAzL,EAAIlN,CACN,GACF,IAEOkY,CACT,CAtEaU,CAAgBzY,EAAGmG,EAAUmH,EAAMsK,GAC5C3Q,EAAa2Q,EAAa,aAAe,cAE3C,SAASc,EAAQC,EAAWC,GAI1B,IAHA,IAAI9V,EAAQgV,EAAOtX,QACfqY,EAAO/V,EAAMoQ,MACbnQ,EAAU,CAAC,EACR8V,GACD9V,EAAQ8V,GACVF,EAAUE,IAEV9V,EAAQ8V,IAAQ,EAChB/V,EAAMvD,KAAKsZ,GACX/V,EAAQA,EAAMX,OAAOyW,EAAcC,KAGrCA,EAAO/V,EAAMoQ,KAEjB,CA6BA,OARAwF,GAlBA,SAAeG,GACbhB,EAAGgB,GAAQf,EAAOtV,QAAQqW,GAAMC,QAAO,SAAUrN,EAAK5K,GACpD,OAAOO,KAAKC,IAAIoK,EAAKoM,EAAGhX,EAAEhB,GAAKiY,EAAO/W,KAAKF,GAC7C,GAAG,EACL,GAceiX,EAAO3M,aAAaK,KAAKsM,IACxCY,GAZA,SAAeG,GACb,IAAI9F,EAAM+E,EAAOzV,SAASwW,GAAMC,QAAO,SAAUrN,EAAK5K,GACpD,OAAOO,KAAK2R,IAAItH,EAAKoM,EAAGhX,EAAEG,GAAK8W,EAAO/W,KAAKF,GAC7C,GAAG6H,OAAOC,mBAENrH,EAAOtB,EAAEsB,KAAKuX,GACd9F,IAAQrK,OAAOC,mBAAqBrH,EAAK2F,aAAeA,IAC1D4Q,EAAGgB,GAAQzX,KAAKC,IAAIwW,EAAGgB,GAAO9F,GAElC,GAGe+E,EAAOvP,WAAWiD,KAAKsM,IAGtC,UAAUH,GAAO,SAAU9X,GACzBgY,EAAGhY,GAAKgY,EAAGvK,EAAKzN,GAClB,IAEOgY,CACT,CAqFA,SAASkB,GAAU/Y,GACjB,IAIIgZ,EAJA7S,EAAW,EAAsBnG,GACjC4W,EAAY,UAAQD,GAAmB3W,EAAGmG,GAzQhD,SAA4BnG,EAAGmG,GAC7B,IAAIyQ,EAAY,CAAC,EAEjB,SAASqC,EAAKC,EAAO3H,EAAU4H,EAAUC,EAAiBC,GACxD,IAAIxZ,EACJ,UAAU,UAAQ0R,EAAU4H,IAAW,SAAUjX,GAC/CrC,EAAIqZ,EAAMhX,GACNlC,EAAEsB,KAAKzB,GAAGgF,OACZ,UAAU7E,EAAEmL,aAAatL,IAAI,SAAUkN,GACrC,IAAIuM,EAAQtZ,EAAEsB,KAAKyL,GACfuM,EAAMzU,QAAUyU,EAAMjT,MAAQ+S,GAAmBE,EAAMjT,MAAQgT,IACjE9B,GAAYX,EAAW7J,EAAGlN,EAE9B,GAEJ,GACF,CAyBA,OADA,WAASsG,GAtBT,SAAoBoT,EAAOL,GACzB,IACEM,EADEC,GAAgB,EAElBlI,EAAW,EAgBb,OAdA,UAAU2H,GAAO,SAAUrZ,EAAG6Z,GAC5B,GAAwB,WAApB1Z,EAAEsB,KAAKzB,GAAGgF,MAAoB,CAChC,IAAIsG,EAAenL,EAAEmL,aAAatL,GAC9BsL,EAAapJ,SACfyX,EAAexZ,EAAEsB,KAAK6J,EAAa,IAAI9E,MACvC4S,EAAKC,EAAO3H,EAAUmI,EAAgBD,EAAcD,GAEpDjI,EAAWmI,EACXD,EAAeD,EAEnB,CACAP,EAAKC,EAAO3H,EAAU2H,EAAMnX,OAAQyX,EAAcD,EAAMxX,OAC1D,IAEOmX,CACT,IAGOtC,CACT,CA+N2D+C,CAAmB3Z,EAAGmG,IAE3EyT,EAAM,CAAC,EAEX,UAAU,CAAC,IAAK,MAAM,SAAUC,GAC9Bb,EAA4B,MAATa,EAAe1T,EAAW,WAASA,GAAUgN,UAChE,UAAU,CAAC,IAAK,MAAM,SAAU2G,GAChB,MAAVA,IACFd,EAAmB,UAAMA,GAAkB,SAAUe,GACnD,OAAO,WAASA,GAAO5G,SACzB,KAGF,IAAI6G,GAAuB,MAATH,EAAe7Z,EAAEmL,aAAenL,EAAEuI,YAAYiD,KAAKxL,GACjE2X,EApMV,SAA2B3X,EAAGmG,EAAUyQ,EAAWoD,GACjD,IAAI1M,EAAO,CAAC,EACVqK,EAAQ,CAAC,EACTlG,EAAM,CAAC,EAkCT,OA7BA,UAAUtL,GAAU,SAAU2P,GAC5B,UAAUA,GAAO,SAAUjW,EAAGwG,GAC5BiH,EAAKzN,GAAKA,EACV8X,EAAM9X,GAAKA,EACX4R,EAAI5R,GAAKwG,CACX,GACF,IAEA,UAAUF,GAAU,SAAU2P,GAC5B,IAAImE,GAAW,EACf,UAAUnE,GAAO,SAAUjW,GACzB,IAAIqa,EAAKF,EAAWna,GACpB,GAAIqa,EAAGnY,OAAQ,CACbmY,EAAK,GAASA,GAAI,SAAUlZ,GAC1B,OAAOyQ,EAAIzQ,EACb,IAEA,IADA,IAAImZ,GAAMD,EAAGnY,OAAS,GAAK,EAClBG,EAAId,KAAKgZ,MAAMD,GAAKE,EAAKjZ,KAAKkZ,KAAKH,GAAKjY,GAAKmY,IAAMnY,EAAG,CAC7D,IAAIlB,EAAIkZ,EAAGhY,GACPyV,EAAM9X,KAAOA,GAAKoa,EAAUxI,EAAIzQ,KAAOyW,GAAYb,EAAW/W,EAAGmB,KACnE2W,EAAM3W,GAAKnB,EACX8X,EAAM9X,GAAKyN,EAAKzN,GAAKyN,EAAKtM,GAC1BiZ,EAAUxI,EAAIzQ,GAElB,CACF,CACF,GACF,IAEO,CAAEsM,KAAMA,EAAMqK,MAAOA,EAC9B,CA8JkB4C,CAAkBva,EAAGgZ,EAAkBpC,EAAWoD,GAC1DnC,EAAKH,GAAqB1X,EAAGgZ,EAAkBrB,EAAMrK,KAAMqK,EAAMA,MAAiB,MAAVmC,GAC9D,MAAVA,IACFjC,EAAK,EAAYA,GAAI,SAAUpS,GAC7B,OAAQA,CACV,KAEFmU,EAAIC,EAAOC,GAASjC,CACtB,GACF,IAEA,IAAI2C,EArFN,SAAoCxa,EAAG4Z,GACrC,OAAO,GAAQ,WAASA,IAAM,SAAU/B,GACtC,IAAIxW,EAAMqH,OAAO+R,kBACb1H,EAAMrK,OAAOC,kBASjB,OAPA,GAAQkP,GAAI,SAAUpS,EAAG5F,GACvB,IAAI6a,EAkIV,SAAe1a,EAAGH,GAChB,OAAOG,EAAEsB,KAAKzB,GAAGgG,KACnB,CApIsBA,CAAM7F,EAAGH,GAAK,EAE9BwB,EAAMD,KAAKC,IAAIoE,EAAIiV,EAAWrZ,GAC9B0R,EAAM3R,KAAK2R,IAAItN,EAAIiV,EAAW3H,EAChC,IAEO1R,EAAM0R,CACf,GACF,CAuEsB4H,CAA2B3a,EAAG4Z,GAElD,OAhEF,SAA0BA,EAAKgB,GAC7B,IAAIC,EAAc,WAASD,GACzBE,EAAa,EAAMD,GACnBE,EAAa,EAAMF,GAErB,UAAU,CAAC,IAAK,MAAM,SAAUhB,GAC9B,UAAU,CAAC,IAAK,MAAM,SAAUC,GAC9B,IAEEhR,EAFEkS,EAAYnB,EAAOC,EACrBjC,EAAK+B,EAAIoB,GAEX,GAAInD,IAAO+C,EAAX,CAEA,IAAIK,EAAS,WAASpD,IACtB/O,EAAkB,MAAVgR,EAAgBgB,EAAa,EAAMG,GAAUF,EAAa,EAAME,MAGtErB,EAAIoB,GAAa,EAAYnD,GAAI,SAAUpS,GACzC,OAAOA,EAAIqD,CACb,IARwB,CAU5B,GACF,GACF,CAyCEoS,CAAiBtB,EAAKY,GAvCxB,SAAiBZ,EAAKjC,GACpB,OAAO,EAAYiC,EAAIuB,IAAI,SAAUC,EAAQvb,GAC3C,GAAI8X,EACF,OAAOiC,EAAIjC,EAAMrQ,eAAezH,GAEhC,IAAIgY,EAAK,GAAS,UAAM+B,EAAK/Z,IAC7B,OAAQgY,EAAG,GAAKA,EAAG,IAAM,CAE7B,GACF,CA+BSwD,CAAQzB,EAAK5Z,EAAE2B,QAAQgW,MAChC,CC9WA,SAAS2D,GAAStb,IASlB,SAAmBA,GACjB,IAAImG,EAAW,EAAsBnG,GACjCub,EAAUvb,EAAE2B,QAAQ6Z,QACpBC,EAAQ,EACZ,UAAUtV,GAAU,SAAU2P,GAC5B,IAAI4F,EAAY,EACd,UAAM5F,GAAO,SAAUjW,GACrB,OAAOG,EAAEsB,KAAKzB,GAAGkG,MACnB,KAEF,UAAU+P,GAAO,SAAUjW,GACzBG,EAAEsB,KAAKzB,GAAG6F,EAAI+V,EAAQC,EAAY,CACpC,IACAD,GAASC,EAAYH,CACvB,GACF,EArBEI,CAFA3b,EAAI,EAAwBA,IAG5B,GAAS+Y,GAAU/Y,IAAI,SAAUyF,EAAG5F,GAClCG,EAAEsB,KAAKzB,GAAG4F,EAAIA,CAChB,GACF,CCEA,SAASmW,GAAO5b,EAAG6b,GACjB,IAAIC,EAAOD,GAAQA,EAAKE,YAAc,EAAY,EAClDD,EAAK,UAAU,WACb,IAAIE,EAAcF,EAAK,sBAAsB,WAC3C,OA0JN,SAA0BG,GACxB,IAAIjc,EAAI,IAAI,EAAAK,MAAM,CAAE2E,YAAY,EAAM4K,UAAU,IAC5CjO,EAAQua,GAAaD,EAAWta,SAoBpC,OAlBA3B,EAAEkF,SACA,UAAQ,CAAC,EAAGiX,GAAeC,GAAkBza,EAAO0a,IAAgB,UAAO1a,EAAO2a,MAGpF,UAAUL,EAAWzb,SAAS,SAAUX,GACtC,IAAIyB,EAAO4a,GAAaD,EAAW3a,KAAKzB,IACxCG,EAAES,QAAQZ,EAAG,UAAWuc,GAAkB9a,EAAMib,IAAeC,KAC/Dxc,EAAEmH,UAAUtH,EAAGoc,EAAWzP,OAAO3M,GACnC,IAEA,UAAUoc,EAAWrb,SAAS,SAAUC,GACtC,IAAIE,EAAOmb,GAAaD,EAAWlb,KAAKF,IACxCb,EAAEmB,QACAN,EACA,UAAQ,CAAC,EAAG4b,GAAcL,GAAkBrb,EAAM2b,IAAe,UAAO3b,EAAM4b,KAElF,IAEO3c,CACT,CAjLa4c,CAAiB5c,EAC1B,IACA8b,EAAK,eAAe,YASxB,SAAmB9b,EAAG8b,GACpBA,EAAK,8BAA8B,YA+KrC,SAAgC9b,GAC9B,IAAI2B,EAAQ3B,EAAE2B,QACdA,EAAM6Z,SAAW,EACjB,UAAUxb,EAAEY,SAAS,SAAUC,GAC7B,IAAIE,EAAOf,EAAEe,KAAKF,GAClBE,EAAK0H,QAAU,EACqB,MAAhC1H,EAAKqH,SAASd,gBACM,OAAlB3F,EAAM0F,SAAsC,OAAlB1F,EAAM0F,QAClCtG,EAAK8E,OAAS9E,EAAK8b,YAEnB9b,EAAKgF,QAAUhF,EAAK8b,YAG1B,GACF,CA5LIC,CAAuB9c,EACzB,IACA8b,EAAK,uBAAuB,YAqW9B,SAAyB9b,GACvB,UAAUA,EAAEY,SAAS,SAAUC,GAC7B,GAAIA,EAAEhB,IAAMgB,EAAEG,EAAG,CACf,IAAIM,EAAOtB,EAAEsB,KAAKT,EAAEhB,GACfyB,EAAKyb,YACRzb,EAAKyb,UAAY,IAEnBzb,EAAKyb,UAAUxd,KAAK,CAAEsB,EAAGA,EAAGqC,MAAOlD,EAAEe,KAAKF,KAC1Cb,EAAEmD,WAAWtC,EACf,CACF,GACF,CA/WImc,CAAgBhd,EAClB,IACA8b,EAAK,eAAe,WAClB,EAAY9b,EACd,IACA8b,EAAK,wBAAwB,WAC3B,GAAiB9b,EACnB,IACA8b,EAAK,YAAY,WACf1V,GAAK,EAAwBpG,GAC/B,IACA8b,EAAK,8BAA8B,YAsLrC,SAAgC9b,GAC9B,UAAUA,EAAEY,SAAS,SAAUC,GAC7B,IAAIE,EAAOf,EAAEe,KAAKF,GAClB,GAAIE,EAAK8E,OAAS9E,EAAKgF,OAAQ,CAC7B,IAAIlG,EAAIG,EAAEsB,KAAKT,EAAEhB,GAEbqD,EAAQ,CAAEkD,MADNpG,EAAEsB,KAAKT,EAAEG,GACMoF,KAAOvG,EAAEuG,MAAQ,EAAIvG,EAAEuG,KAAMvF,EAAGA,GACvD,EAAkBb,EAAG,aAAckD,EAAO,MAC5C,CACF,GACF,CA/LI+Z,CAAuBjd,EACzB,IACA8b,EAAK,wBAAwB,Y3CmH/B,SAA0B9b,GAExB,IAAIkd,EAAS,EACX,UAAMld,EAAEQ,SAAS,SAAUX,GACzB,OAAOG,EAAEsB,KAAKzB,GAAGuG,IACnB,KAGE2O,EAAS,GACb,UAAU/U,EAAEQ,SAAS,SAAUX,GAC7B,IAAIuG,EAAOpG,EAAEsB,KAAKzB,GAAGuG,KAAO8W,EACvBnI,EAAO3O,KACV2O,EAAO3O,GAAQ,IAEjB2O,EAAO3O,GAAM7G,KAAKM,EACpB,IAEA,IAAIiJ,EAAQ,EACRiG,EAAiB/O,EAAE2B,QAAQoN,eAC/B,UAAUgG,GAAQ,SAAU3J,EAAIlJ,GAC1B,UAAckJ,IAAOlJ,EAAI6M,GAAmB,IAC5CjG,EACOA,GACT,UAAUsC,GAAI,SAAUvL,GACtBG,EAAEsB,KAAKzB,GAAGuG,MAAQ0C,CACpB,GAEJ,GACF,C2C9II,CAAsB9I,EACxB,IACA8b,EAAK,4BAA4B,YpB0EnC,SAAiB9b,GACf,IAAIgY,EAAahY,EAAE2B,QACnB3B,EAAEiC,WAAW+V,EAAWnJ,oBACjBmJ,EAAWnJ,YAClB,UAAU7O,EAAEY,SAAS,SAAUC,GAClBb,EAAEe,KAAKF,GACT2O,aACPxP,EAAEmD,WAAWtC,EAEjB,GACF,CoBnFI,CAAqBb,EACvB,IACA8b,EAAK,sBAAsB,Y3C+F7B,SAAwB9b,GACtB,IAAI+S,EAAM,EACR,UAAM/S,EAAEQ,SAAS,SAAUX,GACzB,OAAOG,EAAEsB,KAAKzB,GAAGuG,IACnB,KAEF,UAAUpG,EAAEQ,SAAS,SAAUX,GAC7B,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GACd,UAAMyB,EAAM,UACdA,EAAK8E,MAAQ2M,EAEjB,GACF,C2C1GI,CAAoB/S,EACtB,IACA8b,EAAK,wBAAwB,YAsL/B,SAA0B9b,GACxB,IAAI+P,EAAU,EACd,UAAU/P,EAAEQ,SAAS,SAAUX,GAC7B,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GACdyB,EAAK4N,YACP5N,EAAKwO,QAAU9P,EAAEsB,KAAKA,EAAK4N,WAAW9I,KACtC9E,EAAKyO,QAAU/P,EAAEsB,KAAKA,EAAK6N,cAAc/I,KAEzC2J,EAAU,EAAMA,EAASzO,EAAKyO,SAElC,IACA/P,EAAE2B,QAAQoO,QAAUA,CACtB,CAjMIoN,CAAiBnd,EACnB,IACA8b,EAAK,8BAA8B,YAiMrC,SAAgC9b,GAC9B,UAAUA,EAAEQ,SAAS,SAAUX,GAC7B,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GACC,eAAfyB,EAAKuD,QACP7E,EAAEe,KAAKO,EAAKT,GAAGqH,UAAY5G,EAAK8E,KAChCpG,EAAEiC,WAAWpC,GAEjB,GACF,CAxMIud,CAAuBpd,EACzB,IACA8b,EAAK,qBAAqB,WACxB,GAAc9b,EAChB,IACA8b,EAAK,yBAAyB,WAC5B/F,GAAkB/V,EACpB,IACA8b,EAAK,yBAAyB,Y1CjEhC,SAA2B9b,GAkBzB,UAAUA,EAAEmF,YAjBZ,SAASnC,EAAInD,GACX,IAAIsF,EAAWnF,EAAEmF,SAAStF,GACtByB,EAAOtB,EAAEsB,KAAKzB,GAKlB,GAJIsF,EAASpD,QACX,UAAUoD,EAAUnC,GAGlB,UAAM1B,EAAM,WAAY,CAC1BA,EAAK0O,WAAa,GAClB1O,EAAK2O,YAAc,GACnB,IAAK,IAAI7J,EAAO9E,EAAKwO,QAASC,EAAUzO,EAAKyO,QAAU,EAAG3J,EAAO2J,IAAW3J,EAC1E,EAAcpG,EAAG,aAAc,MAAOH,EAAGyB,EAAM8E,GAC/C,EAAcpG,EAAG,cAAe,MAAOH,EAAGyB,EAAM8E,EAEpD,CACF,GAGF,C0C+CIiX,CAAkBrd,EACpB,IACA8b,EAAK,aAAa,WAChBzV,GAAMrG,EACR,IACA8b,EAAK,uBAAuB,YAwU9B,SAAyB9b,GACvB,IAAI+U,EAAS,EAAsB/U,GACnC,UAAU+U,GAAQ,SAAUe,GAC1B,IAAIwH,EAAa,EACjB,UAAUxH,GAAO,SAAUjW,EAAGqC,GAC5B,IAAIZ,EAAOtB,EAAEsB,KAAKzB,GAClByB,EAAK+E,MAAQnE,EAAIob,EACjB,UAAUhc,EAAKyb,WAAW,SAAUQ,GAClC,EACEvd,EACA,WACA,CACE6F,MAAO0X,EAASra,MAAM2C,MACtBE,OAAQwX,EAASra,MAAM6C,OACvBK,KAAM9E,EAAK8E,KACXC,MAAOnE,KAAMob,EACbzc,EAAG0c,EAAS1c,EACZqC,MAAOqa,EAASra,OAElB,MAEJ,WACO5B,EAAKyb,SACd,GACF,GACF,CAhWIS,CAAgBxd,EAClB,IACA8b,EAAK,8BAA8B,YzC3ErC,SAAgB9b,GACd,IAAIoH,EAAUpH,EAAE2B,QAAQ0F,QAAQC,cAChB,OAAZF,GAAgC,OAAZA,GACtBQ,EAAgB5H,EAEpB,CyCuEI,CAAwBA,EAC1B,IACA8b,EAAK,gBAAgB,WACnBR,GAAStb,EACX,IACA8b,EAAK,yBAAyB,YA0VhC,SAA2B9b,GACzB,UAAUA,EAAEQ,SAAS,SAAUX,GAC7B,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GAClB,GAAmB,aAAfyB,EAAKuD,MAAsB,CAC7B,IAAI4Y,EAAWzd,EAAEsB,KAAKA,EAAKT,EAAEhB,GACzB4F,EAAIgY,EAAShY,EAAIgY,EAAS5X,MAAQ,EAClCH,EAAI+X,EAAS/X,EACbC,EAAKrE,EAAKmE,EAAIA,EACdG,EAAK6X,EAAS1X,OAAS,EAC3B/F,EAAEmB,QAAQG,EAAKT,EAAGS,EAAK4B,OACvBlD,EAAEiC,WAAWpC,GACbyB,EAAK4B,MAAMsE,OAAS,CAClB,CAAE/B,EAAGA,EAAK,EAAIE,EAAM,EAAGD,EAAGA,EAAIE,GAC9B,CAAEH,EAAGA,EAAK,EAAIE,EAAM,EAAGD,EAAGA,EAAIE,GAC9B,CAAEH,EAAGA,EAAIE,EAAID,EAAGA,GAChB,CAAED,EAAGA,EAAK,EAAIE,EAAM,EAAGD,EAAGA,EAAIE,GAC9B,CAAEH,EAAGA,EAAK,EAAIE,EAAM,EAAGD,EAAGA,EAAIE,IAEhCtE,EAAK4B,MAAMuC,EAAInE,EAAKmE,EACpBnE,EAAK4B,MAAMwC,EAAIpE,EAAKoE,CACtB,CACF,GACF,CA/WIgY,CAAkB1d,EACpB,IACA8b,EAAK,yBAAyB,YAwRhC,SAA2B9b,GACzB,UAAUA,EAAEQ,SAAS,SAAUX,GAC7B,GAAIG,EAAEmF,SAAStF,GAAGkC,OAAQ,CACxB,IAAIT,EAAOtB,EAAEsB,KAAKzB,GACdkJ,EAAI/I,EAAEsB,KAAKA,EAAK4N,WAChByO,EAAI3d,EAAEsB,KAAKA,EAAK6N,cAChByO,EAAI5d,EAAEsB,KAAK,EAAOA,EAAK0O,aACvB6N,EAAI7d,EAAEsB,KAAK,EAAOA,EAAK2O,cAE3B3O,EAAKuE,MAAQzE,KAAK6E,IAAI4X,EAAEpY,EAAImY,EAAEnY,GAC9BnE,EAAKyE,OAAS3E,KAAK6E,IAAI0X,EAAEjY,EAAIqD,EAAErD,GAC/BpE,EAAKmE,EAAImY,EAAEnY,EAAInE,EAAKuE,MAAQ,EAC5BvE,EAAKoE,EAAIqD,EAAErD,EAAIpE,EAAKyE,OAAS,CAC/B,CACF,IAEA,UAAU/F,EAAEQ,SAAS,SAAUX,GACL,WAApBG,EAAEsB,KAAKzB,GAAGgF,OACZ7E,EAAEiC,WAAWpC,EAEjB,GACF,CA5SIie,CAAkB9d,EACpB,IACA8b,EAAK,sBAAsB,WACzB,GAAe9b,EACjB,IACA8b,EAAK,4BAA4B,YAsPnC,SAA8B9b,GAC5B,UAAUA,EAAEY,SAAS,SAAUC,GAC7B,IAAIE,EAAOf,EAAEe,KAAKF,GAClB,GAAI,UAAME,EAAM,KAId,OAHsB,MAAlBA,EAAKqH,UAAsC,MAAlBrH,EAAKqH,WAChCrH,EAAK8E,OAAS9E,EAAK8b,aAEb9b,EAAKqH,UACX,IAAK,IACHrH,EAAK0E,GAAK1E,EAAK8E,MAAQ,EAAI9E,EAAK8b,YAChC,MACF,IAAK,IACH9b,EAAK0E,GAAK1E,EAAK8E,MAAQ,EAAI9E,EAAK8b,YAIxC,GACF,CAtQIkB,CAAqB/d,EACvB,IACA8b,EAAK,4BAA4B,WAC/B,EAAsB9b,EACxB,IACA8b,EAAK,sBAAsB,YAoK7B,SAAwB9b,GACtB,IAAIge,EAAOtV,OAAOC,kBACdsV,EAAO,EACPC,EAAOxV,OAAOC,kBACdwV,EAAO,EACPnG,EAAahY,EAAE2B,QACfyc,EAAUpG,EAAWqG,SAAW,EAChCC,EAAUtG,EAAWuG,SAAW,EAEpC,SAASC,EAAY7Z,GACnB,IAAIc,EAAId,EAAMc,EACVC,EAAIf,EAAMe,EACV1E,EAAI2D,EAAMkB,MACVC,EAAInB,EAAMoB,OACdiY,EAAO5c,KAAK2R,IAAIiL,EAAMvY,EAAIzE,EAAI,GAC9Bid,EAAO7c,KAAKC,IAAI4c,EAAMxY,EAAIzE,EAAI,GAC9Bkd,EAAO9c,KAAK2R,IAAImL,EAAMxY,EAAII,EAAI,GAC9BqY,EAAO/c,KAAKC,IAAI8c,EAAMzY,EAAII,EAAI,EAChC,CAEA,UAAU9F,EAAEQ,SAAS,SAAUX,GAC7B2e,EAAYxe,EAAEsB,KAAKzB,GACrB,IACA,UAAUG,EAAEY,SAAS,SAAUC,GAC7B,IAAIE,EAAOf,EAAEe,KAAKF,GACd,UAAME,EAAM,MACdyd,EAAYzd,EAEhB,IAEAid,GAAQI,EACRF,GAAQI,EAER,UAAUte,EAAEQ,SAAS,SAAUX,GAC7B,IAAIyB,EAAOtB,EAAEsB,KAAKzB,GAClByB,EAAKmE,GAAKuY,EACV1c,EAAKoE,GAAKwY,CACZ,IAEA,UAAUle,EAAEY,SAAS,SAAUC,GAC7B,IAAIE,EAAOf,EAAEe,KAAKF,GAClB,UAAUE,EAAKyG,QAAQ,SAAUiX,GAC/BA,EAAEhZ,GAAKuY,EACPS,EAAE/Y,GAAKwY,CACT,IACI,UAAMnd,EAAM,OACdA,EAAK0E,GAAKuY,GAER,UAAMjd,EAAM,OACdA,EAAK2E,GAAKwY,EAEd,IAEAlG,EAAWnS,MAAQoY,EAAOD,EAAOI,EACjCpG,EAAWjS,OAASoY,EAAOD,EAAOI,CACpC,CA1NII,CAAe1e,EACjB,IACA8b,EAAK,4BAA4B,YA0NnC,SAA8B9b,GAC5B,UAAUA,EAAEY,SAAS,SAAUC,GAC7B,IAGI8d,EAAIC,EAHJ7d,EAAOf,EAAEe,KAAKF,GACdge,EAAQ7e,EAAEsB,KAAKT,EAAEhB,GACjBif,EAAQ9e,EAAEsB,KAAKT,EAAEG,GAEhBD,EAAKyG,QAKRmX,EAAK5d,EAAKyG,OAAO,GACjBoX,EAAK7d,EAAKyG,OAAOzG,EAAKyG,OAAOzF,OAAS,KALtChB,EAAKyG,OAAS,GACdmX,EAAKG,EACLF,EAAKC,GAKP9d,EAAKyG,OAAOuX,QAAQ,EAAmBF,EAAOF,IAC9C5d,EAAKyG,OAAOjI,KAAK,EAAmBuf,EAAOF,GAC7C,GACF,CA1OII,CAAqBhf,EACvB,IACA8b,EAAK,qBAAqB,YA6P5B,SAAuC9b,GACrC,UAAUA,EAAEY,SAAS,SAAUC,GAC7B,IAAIE,EAAOf,EAAEe,KAAKF,GACdE,EAAKuC,UACPvC,EAAKyG,OAAO2L,SAEhB,GACF,CAnQI8L,CAA8Bjf,EAChC,IACA8b,EAAK,oBAAoB,WACvB,EAAa9b,EACf,GACF,CA1FMkf,CAAUlD,EAAaF,EACzB,IACAA,EAAK,sBAAsB,YAgG/B,SAA0BG,EAAYD,GACpC,UAAUC,EAAWzb,SAAS,SAAUX,GACtC,IAAIsf,EAAalD,EAAW3a,KAAKzB,GAC7Buf,EAAcpD,EAAY1a,KAAKzB,GAE/Bsf,IACFA,EAAW1Z,EAAI2Z,EAAY3Z,EAC3B0Z,EAAWzZ,EAAI0Z,EAAY1Z,EAEvBsW,EAAY7W,SAAStF,GAAGkC,SAC1Bod,EAAWtZ,MAAQuZ,EAAYvZ,MAC/BsZ,EAAWpZ,OAASqZ,EAAYrZ,QAGtC,IAEA,UAAUkW,EAAWrb,SAAS,SAAUC,GACtC,IAAIse,EAAalD,EAAWlb,KAAKF,GAC7Bue,EAAcpD,EAAYjb,KAAKF,GAEnCse,EAAW3X,OAAS4X,EAAY5X,OAC5B,UAAM4X,EAAa,OACrBD,EAAW1Z,EAAI2Z,EAAY3Z,EAC3B0Z,EAAWzZ,EAAI0Z,EAAY1Z,EAE/B,IAEAuW,EAAWta,QAAQkE,MAAQmW,EAAYra,QAAQkE,MAC/CoW,EAAWta,QAAQoE,OAASiW,EAAYra,QAAQoE,MAClD,CA5HMsZ,CAAiBrf,EAAGgc,EACtB,GACF,GACF,CA2HA,IAAIK,GAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,GAAgB,CAAEX,QAAS,GAAInD,QAAS,GAAID,QAAS,GAAI/Q,QAAS,MAClEiV,GAAa,CAAC,YAAa,SAAU,UAAW,SAChDC,GAAe,CAAC,QAAS,UACzBC,GAAe,CAAE3W,MAAO,EAAGE,OAAQ,GACnC2W,GAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,GAAe,CACjBhU,OAAQ,EACRxH,OAAQ,EACR4E,MAAO,EACPE,OAAQ,EACR8W,YAAa,GACbzU,SAAU,KAERuU,GAAY,CAAC,YAkSjB,SAASP,GAAkBkD,EAAK3a,GAC9B,OAAO,EAAY,UAAO2a,EAAK3a,GAAQ+D,OACzC,CAEA,SAASwT,GAAavX,GACpB,IAAI4a,EAAW,CAAC,EAIhB,OAHA,UAAU5a,GAAO,SAAU9E,EAAGD,GAC5B2f,EAAS3f,EAAE0H,eAAiBzH,CAC9B,IACO0f,CACT,C,wKCxbA,SAJY,cAAS,SAASC,GAC5B,OAAO,cAAS,aAAYA,EAAQ,EAAGC,EAAA,SAAmB,GAC5D,I,wBCrBIC,EAAoB,KACpBC,EAAa,KACbC,EAAiB,IAqBd,MAAMvf,EACX,WAAA3B,CAAYmd,EAAO,CAAC,GAClB/c,KAAK+gB,aAAc,UAAMhE,EAAM,aAAcA,EAAK7S,SAClDlK,KAAKghB,gBAAgB,UAAMjE,EAAM,eAAgBA,EAAK7W,WACtDlG,KAAKihB,cAAc,UAAMlE,EAAM,aAAcA,EAAKjM,SAGlD9Q,KAAKkhB,YAASzd,EAGdzD,KAAKmhB,oBAAsB,eAAW1d,GAGtCzD,KAAKohB,oBAAsB,eAAW3d,GAGtCzD,KAAKqhB,OAAS,CAAC,EAEXrhB,KAAKihB,cAEPjhB,KAAKshB,QAAU,CAAC,EAGhBthB,KAAKuhB,UAAY,CAAC,EAClBvhB,KAAKuhB,UAAUV,GAAc,CAAC,GAIhC7gB,KAAKwhB,IAAM,CAAC,EAGZxhB,KAAKyhB,OAAS,CAAC,EAGfzhB,KAAK0hB,KAAO,CAAC,EAGb1hB,KAAK2hB,MAAQ,CAAC,EAGd3hB,KAAK4hB,UAAY,CAAC,EAGlB5hB,KAAK6hB,YAAc,CAAC,CACtB,CAEA,UAAArV,GACE,OAAOxM,KAAK+gB,WACd,CACA,YAAA5a,GACE,OAAOnG,KAAKghB,aACd,CACA,UAAAc,GACE,OAAO9hB,KAAKihB,WACd,CACA,QAAA7a,CAAShC,GAEP,OADApE,KAAKkhB,OAAS9c,EACPpE,IACT,CACA,KAAA6C,GACE,OAAO7C,KAAKkhB,MACd,CAEA,mBAAAnQ,CAAoBgR,GAKlB,OAJK,UAAaA,KAChBA,EAAa,UAAWA,IAE1B/hB,KAAKmhB,oBAAsBY,EACpB/hB,IACT,CACA,SAAAoB,GACE,OAAOpB,KAAKgiB,UACd,CACA,KAAAtgB,GACE,OAAO,UAAO1B,KAAKqhB,OACrB,CACA,OAAAre,GACE,IAAIif,EAAOjiB,KACX,OAAO,UAASA,KAAK0B,SAAS,SAAUX,GACtC,OAAO,UAAUkhB,EAAKT,IAAIzgB,GAC5B,GACF,CACA,KAAAmC,GACE,IAAI+e,EAAOjiB,KACX,OAAO,UAASA,KAAK0B,SAAS,SAAUX,GACtC,OAAO,UAAUkhB,EAAKP,KAAK3gB,GAC7B,GACF,CACA,QAAAmhB,CAAS5V,EAAIxH,GACX,IAAIqd,EAAOza,UACPua,EAAOjiB,KAQX,OAPA,UAAOsM,GAAI,SAAUvL,GACfohB,EAAKlf,OAAS,EAChBgf,EAAKtgB,QAAQZ,EAAG+D,GAEhBmd,EAAKtgB,QAAQZ,EAEjB,IACOf,IACT,CACA,OAAA2B,CAAQZ,EAAG+D,GACT,OAAI,UAAM9E,KAAKqhB,OAAQtgB,IACjB2G,UAAUzE,OAAS,IACrBjD,KAAKqhB,OAAOtgB,GAAK+D,GAEZ9E,OAITA,KAAKqhB,OAAOtgB,GAAK2G,UAAUzE,OAAS,EAAI6B,EAAQ9E,KAAKmhB,oBAAoBpgB,GACrEf,KAAKihB,cACPjhB,KAAKshB,QAAQvgB,GAAK8f,EAClB7gB,KAAKuhB,UAAUxgB,GAAK,CAAC,EACrBf,KAAKuhB,UAAUV,GAAY9f,IAAK,GAElCf,KAAKwhB,IAAIzgB,GAAK,CAAC,EACff,KAAKyhB,OAAO1gB,GAAK,CAAC,EAClBf,KAAK0hB,KAAK3gB,GAAK,CAAC,EAChBf,KAAK2hB,MAAM5gB,GAAK,CAAC,IACff,KAAKgiB,WACAhiB,KACT,CACA,IAAAwC,CAAKzB,GACH,OAAOf,KAAKqhB,OAAOtgB,EACrB,CACA,OAAA+E,CAAQ/E,GACN,OAAO,UAAMf,KAAKqhB,OAAQtgB,EAC5B,CACA,UAAAoC,CAAWpC,GACT,IAAIkhB,EAAOjiB,KACX,GAAI,UAAMA,KAAKqhB,OAAQtgB,GAAI,CACzB,IAAIsD,EAAa,SAAUtC,GACzBkgB,EAAK5d,WAAW4d,EAAKL,UAAU7f,GACjC,SACO/B,KAAKqhB,OAAOtgB,GACff,KAAKihB,cACPjhB,KAAKoiB,4BAA4BrhB,UAC1Bf,KAAKshB,QAAQvgB,GACpB,UAAOf,KAAKqG,SAAStF,IAAI,SAAUyM,GACjCyU,EAAK5Z,UAAUmF,EACjB,WACOxN,KAAKuhB,UAAUxgB,IAExB,UAAO,UAAOf,KAAKwhB,IAAIzgB,IAAKsD,UACrBrE,KAAKwhB,IAAIzgB,UACTf,KAAKyhB,OAAO1gB,GACnB,UAAO,UAAOf,KAAK0hB,KAAK3gB,IAAKsD,UACtBrE,KAAK0hB,KAAK3gB,UACVf,KAAK2hB,MAAM5gB,KAChBf,KAAKgiB,UACT,CACA,OAAOhiB,IACT,CACA,SAAAqI,CAAUtH,EAAG2M,GACX,IAAK1N,KAAKihB,YACR,MAAM,IAAI/Z,MAAM,6CAGlB,GAAI,UAAcwG,GAChBA,EAASmT,MACJ,CAGL,IAAK,IAAIwB,EADT3U,GAAU,IACmB,UAAc2U,GAAWA,EAAWriB,KAAK0N,OAAO2U,GAC3E,GAAIA,IAAathB,EACf,MAAM,IAAImG,MAAM,WAAawG,EAAS,iBAAmB3M,EAAI,yBAIjEf,KAAK2B,QAAQ+L,EACf,CAMA,OAJA1N,KAAK2B,QAAQZ,GACbf,KAAKoiB,4BAA4BrhB,GACjCf,KAAKshB,QAAQvgB,GAAK2M,EAClB1N,KAAKuhB,UAAU7T,GAAQ3M,IAAK,EACrBf,IACT,CACA,2BAAAoiB,CAA4BrhB,UACnBf,KAAKuhB,UAAUvhB,KAAKshB,QAAQvgB,IAAIA,EACzC,CACA,MAAA2M,CAAO3M,GACL,GAAIf,KAAKihB,YAAa,CACpB,IAAIvT,EAAS1N,KAAKshB,QAAQvgB,GAC1B,GAAI2M,IAAWmT,EACb,OAAOnT,CAEX,CACF,CACA,QAAArH,CAAStF,GAKP,GAJI,UAAcA,KAChBA,EAAI8f,GAGF7gB,KAAKihB,YAAa,CACpB,IAAI5a,EAAWrG,KAAKuhB,UAAUxgB,GAC9B,GAAIsF,EACF,OAAO,UAAOA,EAElB,KAAO,IAAItF,IAAM8f,EACf,OAAO7gB,KAAK0B,QACP,GAAI1B,KAAK8F,QAAQ/E,GACtB,MAAO,EACT,CACF,CACA,YAAAsL,CAAatL,GACX,IAAIuhB,EAAStiB,KAAKyhB,OAAO1gB,GACzB,GAAIuhB,EACF,OAAO,UAAOA,EAElB,CACA,UAAA7Y,CAAW1I,GACT,IAAIwhB,EAAQviB,KAAK2hB,MAAM5gB,GACvB,GAAIwhB,EACF,OAAO,UAAOA,EAElB,CACA,SAAA9V,CAAU1L,GACR,IAAIyhB,EAAQxiB,KAAKqM,aAAatL,GAC9B,GAAIyhB,EACF,OAAO,EAAQA,EAAOxiB,KAAKyJ,WAAW1I,GAE1C,CACA,MAAA0hB,CAAO1hB,GAOL,OAA4B,KALxBf,KAAKwM,aACKxM,KAAKyJ,WAAW1I,GAEhBf,KAAKyM,UAAU1L,IAEZkC,MACnB,CACA,WAAAyf,CAAYC,GAEV,IAAIC,EAAO,IAAI5iB,KAAKJ,YAAY,CAC9BsK,SAAUlK,KAAK+gB,YACf7a,WAAYlG,KAAKghB,cACjBlQ,SAAU9Q,KAAKihB,cAGjB2B,EAAKxc,SAASpG,KAAK6C,SAEnB,IAAIof,EAAOjiB,KACX,UAAOA,KAAKqhB,QAAQ,SAAUvc,EAAO/D,GAC/B4hB,EAAO5hB,IACT6hB,EAAKjhB,QAAQZ,EAAG+D,EAEpB,IAEA,UAAO9E,KAAK4hB,WAAW,SAAU7f,GAE3B6gB,EAAK9c,QAAQ/D,EAAEhB,IAAM6hB,EAAK9c,QAAQ/D,EAAEG,IACtC0gB,EAAKvgB,QAAQN,EAAGkgB,EAAKhgB,KAAKF,GAE9B,IAEA,IAAI8gB,EAAU,CAAC,EACf,SAASC,EAAW/hB,GAClB,IAAI2M,EAASuU,EAAKvU,OAAO3M,GACzB,YAAe0C,IAAXiK,GAAwBkV,EAAK9c,QAAQ4H,IACvCmV,EAAQ9hB,GAAK2M,EACNA,GACEA,KAAUmV,EACZA,EAAQnV,GAERoV,EAAWpV,EAEtB,CAQA,OANI1N,KAAKihB,aACP,UAAO2B,EAAKlhB,SAAS,SAAUX,GAC7B6hB,EAAKva,UAAUtH,EAAG+hB,EAAW/hB,GAC/B,IAGK6hB,CACT,CAEA,mBAAAG,CAAoBhB,GAKlB,OAJK,UAAaA,KAChBA,EAAa,UAAWA,IAE1B/hB,KAAKohB,oBAAsBW,EACpB/hB,IACT,CACA,SAAAgjB,GACE,OAAOhjB,KAAKijB,UACd,CACA,KAAAnhB,GACE,OAAO,UAAS9B,KAAK4hB,UACvB,CACA,OAAAsB,CAAQ5W,EAAIxH,GACV,IAAImd,EAAOjiB,KACPmiB,EAAOza,UASX,OARA,UAAS4E,GAAI,SAAUvL,EAAGmB,GAMxB,OALIigB,EAAKlf,OAAS,EAChBgf,EAAK5f,QAAQtB,EAAGmB,EAAG4C,GAEnBmd,EAAK5f,QAAQtB,EAAGmB,GAEXA,CACT,IACOlC,IACT,CAKA,OAAAqC,GACE,IAAItB,EAAGmB,EAAGqC,EAAMO,EACZqe,GAAiB,EACjBC,EAAO1b,UAAU,GAED,iBAAT0b,GAA8B,OAATA,GAAiB,MAAOA,GACtDriB,EAAIqiB,EAAKriB,EACTmB,EAAIkhB,EAAKlhB,EACTqC,EAAO6e,EAAK7e,KACa,IAArBmD,UAAUzE,SACZ6B,EAAQ4C,UAAU,GAClByb,GAAiB,KAGnBpiB,EAAIqiB,EACJlhB,EAAIwF,UAAU,GACdnD,EAAOmD,UAAU,GACbA,UAAUzE,OAAS,IACrB6B,EAAQ4C,UAAU,GAClByb,GAAiB,IAIrBpiB,EAAI,GAAKA,EACTmB,EAAI,GAAKA,EACJ,UAAcqC,KACjBA,EAAO,GAAKA,GAGd,IAAIxC,EAAIshB,EAAarjB,KAAK+gB,YAAahgB,EAAGmB,EAAGqC,GAC7C,GAAI,UAAMvE,KAAK6hB,YAAa9f,GAI1B,OAHIohB,IACFnjB,KAAK6hB,YAAY9f,GAAK+C,GAEjB9E,KAGT,IAAK,UAAcuE,KAAUvE,KAAKghB,cAChC,MAAM,IAAI9Z,MAAM,qDAKlBlH,KAAK2B,QAAQZ,GACbf,KAAK2B,QAAQO,GAGblC,KAAK6hB,YAAY9f,GAAKohB,EAAiBre,EAAQ9E,KAAKohB,oBAAoBrgB,EAAGmB,EAAGqC,GAE9E,IAAI8E,EA8GR,SAAuBmD,EAAY8W,EAAIC,EAAIhf,GACzC,IAAIxD,EAAI,GAAKuiB,EACTphB,EAAI,GAAKqhB,EACb,IAAK/W,GAAczL,EAAImB,EAAG,CACxB,IAAImR,EAAMtS,EACVA,EAAImB,EACJA,EAAImR,CACN,CACA,IAAIhK,EAAU,CAAEtI,EAAGA,EAAGmB,EAAGA,GACrBqC,IACF8E,EAAQ9E,KAAOA,GAEjB,OAAO8E,CACT,CA3HkBma,CAAcxjB,KAAK+gB,YAAahgB,EAAGmB,EAAGqC,GAYpD,OAVAxD,EAAIsI,EAAQtI,EACZmB,EAAImH,EAAQnH,EAEZuhB,OAAOC,OAAOra,GACdrJ,KAAK4hB,UAAU7f,GAAKsH,EACpBsa,EAAqB3jB,KAAKyhB,OAAOvf,GAAInB,GACrC4iB,EAAqB3jB,KAAK2hB,MAAM5gB,GAAImB,GACpClC,KAAKwhB,IAAItf,GAAGH,GAAKsH,EACjBrJ,KAAK0hB,KAAK3gB,GAAGgB,GAAKsH,EAClBrJ,KAAKijB,aACEjjB,IACT,CACA,IAAAiC,CAAKlB,EAAGmB,EAAGqC,GACT,IAAIxC,EACmB,IAArB2F,UAAUzE,OACN2gB,EAAY5jB,KAAK+gB,YAAarZ,UAAU,IACxC2b,EAAarjB,KAAK+gB,YAAahgB,EAAGmB,EAAGqC,GAC3C,OAAOvE,KAAK6hB,YAAY9f,EAC1B,CACA,OAAAsM,CAAQtN,EAAGmB,EAAGqC,GACZ,IAAIxC,EACmB,IAArB2F,UAAUzE,OACN2gB,EAAY5jB,KAAK+gB,YAAarZ,UAAU,IACxC2b,EAAarjB,KAAK+gB,YAAahgB,EAAGmB,EAAGqC,GAC3C,OAAO,UAAMvE,KAAK6hB,YAAa9f,EACjC,CACA,UAAAsC,CAAWtD,EAAGmB,EAAGqC,GACf,IAAIxC,EACmB,IAArB2F,UAAUzE,OACN2gB,EAAY5jB,KAAK+gB,YAAarZ,UAAU,IACxC2b,EAAarjB,KAAK+gB,YAAahgB,EAAGmB,EAAGqC,GACvCtC,EAAOjC,KAAK4hB,UAAU7f,GAY1B,OAXIE,IACFlB,EAAIkB,EAAKlB,EACTmB,EAAID,EAAKC,SACFlC,KAAK6hB,YAAY9f,UACjB/B,KAAK4hB,UAAU7f,GACtB8hB,EAAuB7jB,KAAKyhB,OAAOvf,GAAInB,GACvC8iB,EAAuB7jB,KAAK2hB,MAAM5gB,GAAImB,UAC/BlC,KAAKwhB,IAAItf,GAAGH,UACZ/B,KAAK0hB,KAAK3gB,GAAGgB,GACpB/B,KAAKijB,cAEAjjB,IACT,CACA,OAAA0D,CAAQ3C,EAAGkN,GACT,IAAIsH,EAAMvV,KAAKwhB,IAAIzgB,GACnB,GAAIwU,EAAK,CACP,IAAIzT,EAAQ,UAASyT,GACrB,OAAKtH,EAGE,UAASnM,GAAO,SAAUG,GAC/B,OAAOA,EAAKlB,IAAMkN,CACpB,IAJSnM,CAKX,CACF,CACA,QAAAyB,CAASxC,EAAGmB,GACV,IAAI4hB,EAAO9jB,KAAK0hB,KAAK3gB,GACrB,GAAI+iB,EAAM,CACR,IAAIhiB,EAAQ,UAASgiB,GACrB,OAAK5hB,EAGE,UAASJ,GAAO,SAAUG,GAC/B,OAAOA,EAAKC,IAAMA,CACpB,IAJSJ,CAKX,CACF,CACA,SAAAyI,CAAUxJ,EAAGmB,GACX,IAAIwB,EAAU1D,KAAK0D,QAAQ3C,EAAGmB,GAC9B,GAAIwB,EACF,OAAOA,EAAQL,OAAOrD,KAAKuD,SAASxC,EAAGmB,GAE3C,EASF,SAASyhB,EAAqBjhB,EAAK5B,GAC7B4B,EAAI5B,GACN4B,EAAI5B,KAEJ4B,EAAI5B,GAAK,CAEb,CAEA,SAAS+iB,EAAuBnhB,EAAK5B,KAC5B4B,EAAI5B,WACF4B,EAAI5B,EAEf,CAEA,SAASuiB,EAAa7W,EAAY8W,EAAIC,EAAIhf,GACxC,IAAIxD,EAAI,GAAKuiB,EACTphB,EAAI,GAAKqhB,EACb,IAAK/W,GAAczL,EAAImB,EAAG,CACxB,IAAImR,EAAMtS,EACVA,EAAImB,EACJA,EAAImR,CACN,CACA,OAAOtS,EAAI+f,EAAiB5e,EAAI4e,GAAkB,UAAcvc,GAAQqc,EAAoBrc,EAC9F,CAiBA,SAASqf,EAAYpX,EAAYnD,GAC/B,OAAOga,EAAa7W,EAAYnD,EAAQtI,EAAGsI,EAAQnH,EAAGmH,EAAQ9E,KAChE,CA/CAhD,EAAMuL,UAAUkV,WAAa,EAG7BzgB,EAAMuL,UAAUmW,WAAa,C,+EC7c7B,MAAMc,EAAU,W,sECShB,QCHA,SAAwBC,EAAUC,GAChC,OAAO,SAASlY,EAAYpH,GAC1B,GAAkB,MAAdoH,EACF,OAAOA,EAET,KAAK,EAAAC,EAAA,SAAYD,GACf,OAAOiY,EAASjY,EAAYpH,GAM9B,IAJA,IAAI1B,EAAS8I,EAAW9I,OACpB4B,EAAQof,EAAYhhB,GAAU,EAC9BihB,EAAWT,OAAO1X,IAEdkY,EAAYpf,MAAYA,EAAQ5B,KACa,IAA/C0B,EAASuf,EAASrf,GAAQA,EAAOqf,KAIvC,OAAOnY,CACT,CACF,CDlBe,CAAe,U,0FEN1BoY,EAAmB,UAAS,UAAOC,wBAAqB3gB,EAc5D,QALA,SAAuBqB,GACrB,OAAO,EAAA+F,EAAA,SAAQ/F,KAAU,EAAAuf,EAAA,SAAYvf,OAChCqf,GAAoBrf,GAASA,EAAMqf,GAC1C,ECoBA,QAvBA,SAASG,EAAY5f,EAAOkL,EAAOlF,EAAW6Z,EAAUrf,GACtD,IAAIL,GAAS,EACT5B,EAASyB,EAAMzB,OAKnB,IAHAyH,IAAcA,EAAY,GAC1BxF,IAAWA,EAAS,MAEXL,EAAQ5B,GAAQ,CACvB,IAAI6B,EAAQJ,EAAMG,GACd+K,EAAQ,GAAKlF,EAAU5F,GACrB8K,EAAQ,EAEV0U,EAAYxf,EAAO8K,EAAQ,EAAGlF,EAAW6Z,EAAUrf,IAEnD,aAAUA,EAAQJ,GAEVyf,IACVrf,EAAOA,EAAOjC,QAAU6B,EAE5B,CACA,OAAOI,CACT,C,qECpBA,QAJA,SAAoBG,EAAQV,GAC1B,OAAOU,IAAU,aAAQA,EAAQV,EAAU,UAC7C,C,uECQA,QAVA,SAAiBoH,EAAYpH,GAC3B,IAAIE,GAAS,EACTK,GAAS,aAAY6G,GAAc+G,MAAM/G,EAAW9I,QAAU,GAKlE,OAHA,aAAS8I,GAAY,SAASjH,EAAOQ,EAAKyG,GACxC7G,IAASL,GAASF,EAASG,EAAOQ,EAAKyG,EACzC,IACO7G,CACT,C,6DCNA,QAJA,SAAsBJ,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ,SAC9C,C,2FCLI0f,EAAcf,OAAO3W,UAGrB2X,EAAiBD,EAAYC,eAsDjC,SA/Be,cAAS,SAASpf,EAAQrC,GACvCqC,EAASoe,OAAOpe,GAEhB,IAAIR,GAAS,EACT5B,EAASD,EAAQC,OACjByhB,EAAQzhB,EAAS,EAAID,EAAQ,QAAKS,EAMtC,IAJIihB,IAAS,aAAe1hB,EAAQ,GAAIA,EAAQ,GAAI0hB,KAClDzhB,EAAS,KAGF4B,EAAQ5B,GAMf,IALA,IAAI8Q,EAAS/Q,EAAQ6B,GACjBU,GAAQ,aAAOwO,GACf4Q,GAAc,EACdC,EAAcrf,EAAMtC,SAEf0hB,EAAaC,GAAa,CACjC,IAAItf,EAAMC,EAAMof,GACZ7f,EAAQO,EAAOC,SAEL7B,IAAVqB,IACC,aAAGA,EAAO0f,EAAYlf,MAAUmf,EAAeI,KAAKxf,EAAQC,MAC/DD,EAAOC,GAAOyO,EAAOzO,GAEzB,CAGF,OAAOD,CACT,G,uECzCA,QAVA,SAAoB0G,EAAYrB,GAC9B,IAAIxF,EAAS,GAMb,OALA,aAAS6G,GAAY,SAASjH,EAAOD,EAAOkH,GACtCrB,EAAU5F,EAAOD,EAAOkH,IAC1B7G,EAAOzE,KAAKqE,EAEhB,IACOI,CACT,E,wBCiCA,QALA,SAAgB6G,EAAYrB,GAE1B,QADW,EAAAG,EAAA,SAAQkB,GAAc,UAAc,GACnCA,GAAY,aAAarB,EAAW,GAClD,C,6DC5BA,QALA,SAAiBhG,GAEf,OADsB,MAATA,EAAgB,EAAIA,EAAMzB,SACvB,aAAYyB,EAAO,GAAK,EAC1C,C,2FCqBA,QALA,SAAiBqH,EAAYpH,GAE3B,QADW,aAAQoH,GAAc,UAAY,WACjCA,GAAY,aAAapH,GACvC,C,+CCrCA,IAGI,EAHc8e,OAAO3W,UAGQ2X,eAcjC,QAJA,SAAiBpf,EAAQC,GACvB,OAAiB,MAAVD,GAAkB,EAAewf,KAAKxf,EAAQC,EACvD,E,cCkBA,QAJA,SAAaD,EAAQkS,GACnB,OAAiB,MAAVlS,IAAkB,aAAQA,EAAQkS,EAAM,EACjD,C,+CCXA,QAJA,SAAqBzS,GACnB,YAAiBrB,IAAVqB,CACT,C,2FCiCA,QALA,SAAaiH,EAAYpH,GAEvB,QADW,aAAQoH,GAAc,UAAW,WAChCA,GAAY,aAAapH,EAAU,GACjD,C,uEChCA,QANA,SAAkBU,EAAQyf,GACxB,OAAO,aAAWzf,EAAQyf,GAAO,SAAShgB,EAAOyS,GAC/C,OAAO,EAAAwN,EAAA,SAAM1f,EAAQkS,EACvB,GACF,E,kCCQA,QCbA,SAAkByN,GAChB,OAAO,cAAY,aAASA,OAAMvhB,EAAWwhB,EAAA,SAAUD,EAAO,GAChE,CDOW,EAAS,SAAS3f,EAAQyf,GACnC,OAAiB,MAAVzf,EAAiB,CAAC,EAAI,EAASA,EAAQyf,EAChD,G,+CErBA,IAAII,EAAa5iB,KAAKkZ,KAClB/Q,EAAYnI,KAAKC,IAyBrB,QAZA,SAAmBqF,EAAOud,EAAKC,EAAMnB,GAKnC,IAJA,IAAIpf,GAAS,EACT5B,EAASwH,EAAUya,GAAYC,EAAMvd,IAAUwd,GAAQ,IAAK,GAC5DlgB,EAAS4N,MAAM7P,GAEZA,KACLiC,EAAO+e,EAAYhhB,IAAW4B,GAAS+C,EACvCA,GAASwd,EAEX,OAAOlgB,CACT,E,wBCoBA,QClCA,SAAqB+e,GACnB,OAAO,SAASrc,EAAOud,EAAKC,GAa1B,OAZIA,GAAuB,iBAARA,IAAoB,aAAexd,EAAOud,EAAKC,KAChED,EAAMC,OAAO3hB,GAGfmE,GAAQ,EAAAyd,EAAA,SAASzd,QACLnE,IAAR0hB,GACFA,EAAMvd,EACNA,EAAQ,GAERud,GAAM,EAAAE,EAAA,SAASF,GAEjBC,OAAgB3hB,IAAT2hB,EAAsBxd,EAAQud,EAAM,GAAK,GAAK,EAAAE,EAAA,SAASD,GACvD,EAAUxd,EAAOud,EAAKC,EAAMnB,EACrC,CACF,CDgBY,E,+CElBZ,QAbA,SAAqBvf,EAAOC,EAAU2gB,EAAaC,GACjD,IAAI1gB,GAAS,EACT5B,EAAkB,MAATyB,EAAgB,EAAIA,EAAMzB,OAKvC,IAHIsiB,GAAatiB,IACfqiB,EAAc5gB,IAAQG,MAEfA,EAAQ5B,GACfqiB,EAAc3gB,EAAS2gB,EAAa5gB,EAAMG,GAAQA,EAAOH,GAE3D,OAAO4gB,CACT,E,wBCDA,QATA,SAAoBvZ,EAAYpH,EAAU2gB,EAAaC,EAAWvB,GAMhE,OALAA,EAASjY,GAAY,SAASjH,EAAOD,EAAOkH,GAC1CuZ,EAAcC,GACTA,GAAY,EAAOzgB,GACpBH,EAAS2gB,EAAaxgB,EAAOD,EAAOkH,EAC1C,IACOuZ,CACT,E,cC8BA,QAPA,SAAgBvZ,EAAYpH,EAAU2gB,GACpC,IAAIN,GAAO,EAAAna,EAAA,SAAQkB,GAAc,EAAc,EAC3CwZ,EAAY7d,UAAUzE,OAAS,EAEnC,OAAO+hB,EAAKjZ,GAAY,aAAapH,EAAU,GAAI2gB,EAAaC,EAAW,UAC7E,C,4DC7CIC,EAAY,EAwBhB,QALA,SAAkB/d,GAChB,IAAIge,IAAOD,EACX,OAAO,aAAS/d,GAAUge,CAC5B,C,6DCPA,QANA,SAAoBpgB,EAAQE,GAC1B,OAAO,aAASA,GAAO,SAASD,GAC9B,OAAOD,EAAOC,EAChB,GACF,E,aCiBA,QAJA,SAAgBD,GACd,OAAiB,MAAVA,EAAiB,GAAK,EAAWA,GAAQ,EAAAqgB,EAAA,SAAKrgB,GACvD,C","sources":["webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/data/list.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/greedy-fas.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/acyclic.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseExtremum.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseGt.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/max.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/last.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/mapValues.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseZipObject.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/zipObject.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseLt.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/min.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/util.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/add-border-segments.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/coordinate-system.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/normalize.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/minBy.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/rank/util.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/findIndex.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/find.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/isString.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_asciiSize.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_hasUnicode.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_unicodeSize.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_stringSize.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/size.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/rank/index.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/nesting-graph.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseSortBy.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_compareAscending.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_compareMultiple.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseOrderBy.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/sortBy.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/cross-count.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/sort.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/barycenter.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/index.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/init-order.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/forOwn.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/forIn.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/position/bk.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/position/index.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/dagre/layout.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/union.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/graphlib/graph.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/dagre-d3-es/src/graphlib/index.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseEach.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_createBaseEach.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_isFlattenable.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseFlatten.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseForOwn.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseMap.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_castFunction.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/defaults.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseFilter.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/filter.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/flatten.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/forEach.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseHas.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/has.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/isUndefined.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/map.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_basePick.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/pick.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_flatRest.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseRange.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/range.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_createRange.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_arrayReduce.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseReduce.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/reduce.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/uniqueId.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/_baseValues.js","webpack://@finos/legend-application-pure-ide-deployment/../../node_modules/lodash-es/values.js"],"sourcesContent":["/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nexport { List };\n\nclass List {\n  constructor() {\n    var sentinel = {};\n    sentinel._next = sentinel._prev = sentinel;\n    this._sentinel = sentinel;\n  }\n  dequeue() {\n    var sentinel = this._sentinel;\n    var entry = sentinel._prev;\n    if (entry !== sentinel) {\n      unlink(entry);\n      return entry;\n    }\n  }\n  enqueue(entry) {\n    var sentinel = this._sentinel;\n    if (entry._prev && entry._next) {\n      unlink(entry);\n    }\n    entry._next = sentinel._next;\n    sentinel._next._prev = entry;\n    sentinel._next = entry;\n    entry._prev = sentinel;\n  }\n  toString() {\n    var strs = [];\n    var sentinel = this._sentinel;\n    var curr = sentinel._prev;\n    while (curr !== sentinel) {\n      strs.push(JSON.stringify(curr, filterOutLinks));\n      curr = curr._prev;\n    }\n    return '[' + strs.join(', ') + ']';\n  }\n}\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== '_next' && k !== '_prev') {\n    return v;\n  }\n}\n","import * as _ from 'lodash-es';\nimport { Graph } from '../graphlib/index.js';\nimport { List } from './data/list.js';\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nexport { greedyFAS };\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return _.flatten(\n    _.map(results, function (e) {\n      return g.outEdges(e.v, e.w);\n    })\n  );\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue())) {\n      removeNode(g, buckets, zeroIdx, entry);\n    }\n    while ((entry = sources.dequeue())) {\n      removeNode(g, buckets, zeroIdx, entry);\n    }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  _.forEach(g.inEdges(entry.v), function (edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  _.forEach(g.outEdges(entry.v), function (edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry['in'] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  _.forEach(g.nodes(), function (v) {\n    fasGraph.setNode(v, { v: v, in: 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  _.forEach(g.edges(), function (e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, (fasGraph.node(e.v).out += weight));\n    maxIn = Math.max(maxIn, (fasGraph.node(e.w)['in'] += weight));\n  });\n\n  var buckets = _.range(maxOut + maxIn + 3).map(function () {\n    return new List();\n  });\n  var zeroIdx = maxIn + 1;\n\n  _.forEach(fasGraph.nodes(), function (v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry['in']) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry['in'] + zeroIdx].enqueue(entry);\n  }\n}\n","import * as _ from 'lodash-es';\nimport { greedyFAS } from './greedy-fas.js';\n\nexport { run, undo };\n\nfunction run(g) {\n  var fas = g.graph().acyclicer === 'greedy' ? greedyFAS(g, weightFn(g)) : dfsFAS(g);\n  _.forEach(fas, function (e) {\n    var label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, _.uniqueId('rev'));\n  });\n\n  function weightFn(g) {\n    return function (e) {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  var fas = [];\n  var stack = {};\n  var visited = {};\n\n  function dfs(v) {\n    if (_.has(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function (e) {\n      if (_.has(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  _.forEach(g.nodes(), dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  _.forEach(g.edges(), function (e) {\n    var label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      var forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n","import isSymbol from './isSymbol.js';\n\n/**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\nfunction baseExtremum(array, iteratee, comparator) {\n  var index = -1,\n      length = array.length;\n\n  while (++index < length) {\n    var value = array[index],\n        current = iteratee(value);\n\n    if (current != null && (computed === undefined\n          ? (current === current && !isSymbol(current))\n          : comparator(current, computed)\n        )) {\n      var computed = current,\n          result = value;\n    }\n  }\n  return result;\n}\n\nexport default baseExtremum;\n","/**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n *  else `false`.\n */\nfunction baseGt(value, other) {\n  return value > other;\n}\n\nexport default baseGt;\n","import baseExtremum from './_baseExtremum.js';\nimport baseGt from './_baseGt.js';\nimport identity from './identity.js';\n\n/**\n * Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\nfunction max(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseGt)\n    : undefined;\n}\n\nexport default max;\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nexport default last;\n","import baseAssignValue from './_baseAssignValue.js';\nimport baseForOwn from './_baseForOwn.js';\nimport baseIteratee from './_baseIteratee.js';\n\n/**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n *   'fred':    { 'user': 'fred',    'age': 40 },\n *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\nfunction mapValues(object, iteratee) {\n  var result = {};\n  iteratee = baseIteratee(iteratee, 3);\n\n  baseForOwn(object, function(value, key, object) {\n    baseAssignValue(result, key, iteratee(value, key, object));\n  });\n  return result;\n}\n\nexport default mapValues;\n","/**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\nfunction baseZipObject(props, values, assignFunc) {\n  var index = -1,\n      length = props.length,\n      valsLength = values.length,\n      result = {};\n\n  while (++index < length) {\n    var value = index < valsLength ? values[index] : undefined;\n    assignFunc(result, props[index], value);\n  }\n  return result;\n}\n\nexport default baseZipObject;\n","import assignValue from './_assignValue.js';\nimport baseZipObject from './_baseZipObject.js';\n\n/**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction zipObject(props, values) {\n  return baseZipObject(props || [], values || [], assignValue);\n}\n\nexport default zipObject;\n","/**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n *  else `false`.\n */\nfunction baseLt(value, other) {\n  return value < other;\n}\n\nexport default baseLt;\n","import baseExtremum from './_baseExtremum.js';\nimport baseLt from './_baseLt.js';\nimport identity from './identity.js';\n\n/**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\nfunction min(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseLt)\n    : undefined;\n}\n\nexport default min;\n","import * as _ from 'lodash-es';\nimport { Graph } from '../graphlib/index.js';\n\nexport {\n  addDummyNode,\n  simplify,\n  asNonCompoundGraph,\n  successorWeights,\n  predecessorWeights,\n  intersectRect,\n  buildLayerMatrix,\n  normalizeRanks,\n  removeEmptyRanks,\n  addBorderNode,\n  maxRank,\n  partition,\n  time,\n  notime,\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v;\n  do {\n    v = _.uniqueId(name);\n  } while (g.hasNode(v));\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  var simplified = new Graph().setGraph(g.graph());\n  _.forEach(g.nodes(), function (v) {\n    simplified.setNode(v, g.node(v));\n  });\n  _.forEach(g.edges(), function (e) {\n    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    var label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen),\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  _.forEach(g.nodes(), function (v) {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  _.forEach(g.edges(), function (e) {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  var weightMap = _.map(g.nodes(), function (v) {\n    var sucs = {};\n    _.forEach(g.outEdges(v), function (e) {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  var weightMap = _.map(g.nodes(), function (v) {\n    var preds = {};\n    _.forEach(g.inEdges(v), function (e) {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  var x = rect.x;\n  var y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  var dx = point.x - x;\n  var dy = point.y - y;\n  var w = rect.width / 2;\n  var h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error('Not possible to find intersection inside of the rectangle');\n  }\n\n  var sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = (h * dx) / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = (w * dy) / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  var layering = _.map(_.range(maxRank(g) + 1), function () {\n    return [];\n  });\n  _.forEach(g.nodes(), function (v) {\n    var node = g.node(v);\n    var rank = node.rank;\n    if (!_.isUndefined(rank)) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  var min = _.min(\n    _.map(g.nodes(), function (v) {\n      return g.node(v).rank;\n    })\n  );\n  _.forEach(g.nodes(), function (v) {\n    var node = g.node(v);\n    if (_.has(node, 'rank')) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  var offset = _.min(\n    _.map(g.nodes(), function (v) {\n      return g.node(v).rank;\n    })\n  );\n\n  var layers = [];\n  _.forEach(g.nodes(), function (v) {\n    var rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  var delta = 0;\n  var nodeRankFactor = g.graph().nodeRankFactor;\n  _.forEach(layers, function (vs, i) {\n    if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (delta) {\n      _.forEach(vs, function (v) {\n        g.node(v).rank += delta;\n      });\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  var node = {\n    width: 0,\n    height: 0,\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, 'border', node, prefix);\n}\n\nfunction maxRank(g) {\n  return _.max(\n    _.map(g.nodes(), function (v) {\n      var rank = g.node(v).rank;\n      if (!_.isUndefined(rank)) {\n        return rank;\n      }\n    })\n  );\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  var result = { lhs: [], rhs: [] };\n  _.forEach(collection, function (value) {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  var start = _.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + ' time: ' + (_.now() - start) + 'ms');\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n","import * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { addBorderSegments };\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    var children = g.children(v);\n    var node = g.node(v);\n    if (children.length) {\n      _.forEach(children, dfs);\n    }\n\n    if (_.has(node, 'minRank')) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank) {\n        addBorderNode(g, 'borderLeft', '_bl', v, node, rank);\n        addBorderNode(g, 'borderRight', '_br', v, node, rank);\n      }\n    }\n  }\n\n  _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n  var prev = sgNode[prop][rank - 1];\n  var curr = util.addDummyNode(g, 'border', label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n","import * as _ from 'lodash-es';\n\nexport { adjust, undo };\n\nfunction adjust(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === 'lr' || rankDir === 'rl') {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === 'bt' || rankDir === 'rl') {\n    reverseY(g);\n  }\n\n  if (rankDir === 'lr' || rankDir === 'rl') {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  _.forEach(g.nodes(), function (v) {\n    swapWidthHeightOne(g.node(v));\n  });\n  _.forEach(g.edges(), function (e) {\n    swapWidthHeightOne(g.edge(e));\n  });\n}\n\nfunction swapWidthHeightOne(attrs) {\n  var w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  _.forEach(g.nodes(), function (v) {\n    reverseYOne(g.node(v));\n  });\n\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, reverseYOne);\n    if (_.has(edge, 'y')) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  _.forEach(g.nodes(), function (v) {\n    swapXYOne(g.node(v));\n  });\n\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, swapXYOne);\n    if (_.has(edge, 'x')) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  var x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n","import * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { run, undo };\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  _.forEach(g.edges(), function (edge) {\n    normalizeEdge(g, edge);\n  });\n}\n\nfunction normalizeEdge(g, e) {\n  var v = e.v;\n  var vRank = g.node(v).rank;\n  var w = e.w;\n  var wRank = g.node(w).rank;\n  var name = e.name;\n  var edgeLabel = g.edge(e);\n  var labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  var dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0,\n      height: 0,\n      edgeLabel: edgeLabel,\n      edgeObj: e,\n      rank: vRank,\n    };\n    dummy = util.addDummyNode(g, 'edge', attrs, '_d');\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      // @ts-expect-error\n      attrs.dummy = 'edge-label';\n      // @ts-expect-error\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  _.forEach(g.graph().dummyChains, function (v) {\n    var node = g.node(v);\n    var origLabel = node.edgeLabel;\n    var w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === 'edge-label') {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n","import baseExtremum from './_baseExtremum.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseLt from './_baseLt.js';\n\n/**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\nfunction minBy(array, iteratee) {\n  return (array && array.length)\n    ? baseExtremum(array, baseIteratee(iteratee, 2), baseLt)\n    : undefined;\n}\n\nexport default minBy;\n","import * as _ from 'lodash-es';\n\nexport { longestPath, slack };\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (_.has(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = _.min(\n      _.map(g.outEdges(v), function (e) {\n        return dfs(e.w) - g.edge(e).minlen;\n      })\n    );\n\n    if (\n      rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n      rank === undefined || // return value of _.map([]) for Lodash 4\n      rank === null\n    ) {\n      // return value of _.map([null])\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  _.forEach(g.sources(), dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\nimport { slack } from './util.js';\n\nexport { feasibleTree };\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    _.forEach(g.nodeEdges(v), function (e) {\n      var edgeV = e.v,\n        w = v === edgeV ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  _.forEach(t.nodes(), dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  return _.minBy(g.edges(), function (e) {\n    if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n      return slack(g, e);\n    }\n  });\n}\n\nfunction shiftRanks(t, g, delta) {\n  _.forEach(t.nodes(), function (v) {\n    g.node(v).rank += delta;\n  });\n}\n","import baseFindIndex from './_baseFindIndex.js';\nimport baseIteratee from './_baseIteratee.js';\nimport toInteger from './toInteger.js';\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\nfunction findIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nexport default findIndex;\n","import createFind from './_createFind.js';\nimport findIndex from './findIndex.js';\n\n/**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'age': 36, 'active': true },\n *   { 'user': 'fred',    'age': 40, 'active': false },\n *   { 'user': 'pebbles', 'age': 1,  'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\nvar find = createFind(findIndex);\n\nexport default find;\n","import * as _ from 'lodash-es';\nimport { PriorityQueue } from '../data/priority-queue.js';\n\nexport { dijkstra };\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(\n    g,\n    String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn ||\n      function (v) {\n        return g.outEdges(v);\n      }\n  );\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function (edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\n        'dijkstra does not allow negative edge weights. ' +\n          'Bad edge: ' +\n          edge +\n          ' Weight: ' +\n          weight\n      );\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function (v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n","import * as _ from 'lodash-es';\n\nexport { floydWarshall };\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(\n    g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn ||\n      function (v) {\n        return g.outEdges(v);\n      }\n  );\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function (v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function (w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function (edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function (k) {\n    var rowK = results[k];\n    nodes.forEach(function (i) {\n      var rowI = results[i];\n      nodes.forEach(function (j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n","import baseGetTag from './_baseGetTag.js';\nimport isArray from './isArray.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nexport default isString;\n","import baseProperty from './_baseProperty.js';\n\n/**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nvar asciiSize = baseProperty('length');\n\nexport default asciiSize;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nexport default hasUnicode;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nfunction unicodeSize(string) {\n  var result = reUnicode.lastIndex = 0;\n  while (reUnicode.test(string)) {\n    ++result;\n  }\n  return result;\n}\n\nexport default unicodeSize;\n","import asciiSize from './_asciiSize.js';\nimport hasUnicode from './_hasUnicode.js';\nimport unicodeSize from './_unicodeSize.js';\n\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\nfunction stringSize(string) {\n  return hasUnicode(string)\n    ? unicodeSize(string)\n    : asciiSize(string);\n}\n\nexport default stringSize;\n","import baseKeys from './_baseKeys.js';\nimport getTag from './_getTag.js';\nimport isArrayLike from './isArrayLike.js';\nimport isString from './isString.js';\nimport stringSize from './_stringSize.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\nfunction size(collection) {\n  if (collection == null) {\n    return 0;\n  }\n  if (isArrayLike(collection)) {\n    return isString(collection) ? stringSize(collection) : collection.length;\n  }\n  var tag = getTag(collection);\n  if (tag == mapTag || tag == setTag) {\n    return collection.size;\n  }\n  return baseKeys(collection).length;\n}\n\nexport default size;\n","import * as _ from 'lodash-es';\n\nexport { topsort, CycleException };\n\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (_.has(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!_.has(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      _.each(g.predecessors(node), visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  _.each(g.sinks(), visit);\n\n  if (_.size(visited) !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing\n","import * as _ from 'lodash-es';\n\nexport { dfs };\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n  if (!_.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n  var acc = [];\n  var visited = {};\n  _.each(vs, function (v) {\n    if (!g.hasNode(v)) {\n      throw new Error('Graph does not have node: ' + v);\n    }\n\n    doDfs(g, v, order === 'post', visited, navigation, acc);\n  });\n  return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n  if (!_.has(visited, v)) {\n    visited[v] = true;\n\n    if (!postorder) {\n      acc.push(v);\n    }\n    _.each(navigation(v), function (w) {\n      doDfs(g, w, postorder, visited, navigation, acc);\n    });\n    if (postorder) {\n      acc.push(v);\n    }\n  }\n}\n","import * as _ from 'lodash-es';\nimport * as alg from '../../graphlib/alg/index.js';\nimport { simplify } from '../util.js';\nimport { feasibleTree } from './feasible-tree.js';\nimport { longestPath, slack } from './util.js';\n\nexport { networkSimplex };\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  longestPath(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = alg.postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  _.forEach(vs, function (v) {\n    assignCutValue(t, g, v);\n  });\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  _.forEach(g.nodeEdges(child), function (e) {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  _.forEach(tree.neighbors(v), function (w) {\n    if (!_.has(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return _.find(tree.edges(), function (e) {\n    return tree.edge(e).cutvalue < 0;\n  });\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = _.filter(g.edges(), function (edge) {\n    return (\n      flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n      flip !== isDescendant(t, t.node(edge.w), tailLabel)\n    );\n  });\n\n  return _.minBy(candidates, function (edge) {\n    return slack(g, edge);\n  });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = _.find(t.nodes(), function (v) {\n    return !g.node(v).parent;\n  });\n  var vs = alg.preorder(t, root);\n  vs = vs.slice(1);\n  _.forEach(vs, function (v) {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","import { dfs } from './dfs.js';\n\nexport { postorder };\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, 'post');\n}\n","import { dfs } from './dfs.js';\n\nexport { preorder };\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, 'pre');\n}\n","import { feasibleTree } from './feasible-tree.js';\nimport { networkSimplex } from './network-simplex.js';\nimport { longestPath } from './util.js';\n\nexport { rank };\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  switch (g.graph().ranker) {\n    case 'network-simplex':\n      networkSimplexRanker(g);\n      break;\n    case 'tight-tree':\n      tightTreeRanker(g);\n      break;\n    case 'longest-path':\n      longestPathRanker(g);\n      break;\n    default:\n      networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n","import * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { run, cleanup };\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  var root = util.addDummyNode(g, 'root', {}, '_root');\n  var depths = treeDepths(g);\n  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n  var nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  _.forEach(g.edges(), function (e) {\n    g.edge(e).minlen *= nodeSep;\n  });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  var weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  _.forEach(g.children(), function (child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  var children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  var top = util.addBorderNode(g, '_bt');\n  var bottom = util.addBorderNode(g, '_bb');\n  var label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  _.forEach(children, function (child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    var childNode = g.node(child);\n    var childTop = childNode.borderTop ? childNode.borderTop : child;\n    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true,\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true,\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      _.forEach(children, function (child) {\n        dfs(child, depth + 1);\n      });\n    }\n    depths[v] = depth;\n  }\n  _.forEach(g.children(), function (v) {\n    dfs(v, 1);\n  });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return _.reduce(\n    g.edges(),\n    function (acc, e) {\n      return acc + g.edge(e).weight;\n    },\n    0\n  );\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\n\nexport { buildLayerGraph };\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship) {\n  var root = createRootNode(g),\n    result = new Graph({ compound: true })\n      .setGraph({ root: root })\n      .setDefaultNodeLabel(function (v) {\n        return g.node(v);\n      });\n\n  _.forEach(g.nodes(), function (v) {\n    var node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || (node.minRank <= rank && rank <= node.maxRank)) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      _.forEach(g[relationship](v), function (e) {\n        var u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = !_.isUndefined(edge) ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (_.has(node, 'minRank')) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank],\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = _.uniqueId('_root'))));\n  return v;\n}\n","/**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\nexport default baseSortBy;\n","import isSymbol from './isSymbol.js';\n\n/**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined,\n        valIsNull = value === null,\n        valIsReflexive = value === value,\n        valIsSymbol = isSymbol(value);\n\n    var othIsDefined = other !== undefined,\n        othIsNull = other === null,\n        othIsReflexive = other === other,\n        othIsSymbol = isSymbol(other);\n\n    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n        (valIsNull && othIsDefined && othIsReflexive) ||\n        (!valIsDefined && othIsReflexive) ||\n        !valIsReflexive) {\n      return 1;\n    }\n    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n        (othIsNull && valIsDefined && valIsReflexive) ||\n        (!othIsDefined && valIsReflexive) ||\n        !othIsReflexive) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\nexport default compareAscending;\n","import compareAscending from './_compareAscending.js';\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = compareAscending(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also ensures a stable sort in V8 and other engines.\n  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n  return object.index - other.index;\n}\n\nexport default compareMultiple;\n","import arrayMap from './_arrayMap.js';\nimport baseGet from './_baseGet.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport baseSortBy from './_baseSortBy.js';\nimport baseUnary from './_baseUnary.js';\nimport compareMultiple from './_compareMultiple.js';\nimport identity from './identity.js';\nimport isArray from './isArray.js';\n\n/**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\nfunction baseOrderBy(collection, iteratees, orders) {\n  if (iteratees.length) {\n    iteratees = arrayMap(iteratees, function(iteratee) {\n      if (isArray(iteratee)) {\n        return function(value) {\n          return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n        }\n      }\n      return iteratee;\n    });\n  } else {\n    iteratees = [identity];\n  }\n\n  var index = -1;\n  iteratees = arrayMap(iteratees, baseUnary(baseIteratee));\n\n  var result = baseMap(collection, function(value, key, collection) {\n    var criteria = arrayMap(iteratees, function(iteratee) {\n      return iteratee(value);\n    });\n    return { 'criteria': criteria, 'index': ++index, 'value': value };\n  });\n\n  return baseSortBy(result, function(object, other) {\n    return compareMultiple(object, other, orders);\n  });\n}\n\nexport default baseOrderBy;\n","import baseFlatten from './_baseFlatten.js';\nimport baseOrderBy from './_baseOrderBy.js';\nimport baseRest from './_baseRest.js';\nimport isIterateeCall from './_isIterateeCall.js';\n\n/**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n *  The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n *   { 'user': 'fred',   'age': 48 },\n *   { 'user': 'barney', 'age': 36 },\n *   { 'user': 'fred',   'age': 30 },\n *   { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\nvar sortBy = baseRest(function(collection, iteratees) {\n  if (collection == null) {\n    return [];\n  }\n  var length = iteratees.length;\n  if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n    iteratees = [];\n  } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n    iteratees = [iteratees[0]];\n  }\n  return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n});\n\nexport default sortBy;\n","import * as _ from 'lodash-es';\n\nexport { crossCount };\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  var cc = 0;\n  for (var i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i - 1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  var southPos = _.zipObject(\n    southLayer,\n    _.map(southLayer, function (v, i) {\n      return i;\n    })\n  );\n  var southEntries = _.flatten(\n    _.map(northLayer, function (v) {\n      return _.sortBy(\n        _.map(g.outEdges(v), function (e) {\n          return { pos: southPos[e.w], weight: g.edge(e).weight };\n        }),\n        'pos'\n      );\n    })\n  );\n\n  // Build the accumulator tree\n  var firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  var treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  var tree = _.map(new Array(treeSize), function () {\n    return 0;\n  });\n\n  // Calculate the weighted crossings\n  var cc = 0;\n  _.forEach(\n    // @ts-expect-error\n    southEntries.forEach(function (entry) {\n      var index = entry.pos + firstIndex;\n      tree[index] += entry.weight;\n      var weightSum = 0;\n      // @ts-expect-error\n      while (index > 0) {\n        // @ts-expect-error\n        if (index % 2) {\n          weightSum += tree[index + 1];\n        }\n        // @ts-expect-error\n        index = (index - 1) >> 1;\n        tree[index] += entry.weight;\n      }\n      cc += entry.weight * weightSum;\n    })\n  );\n\n  return cc;\n}\n","import * as _ from 'lodash-es';\n\nexport { resolveConflicts };\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  var mappedEntries = {};\n  _.forEach(entries, function (entry, i) {\n    var tmp = (mappedEntries[entry.v] = {\n      indegree: 0,\n      in: [],\n      out: [],\n      vs: [entry.v],\n      i: i,\n    });\n    if (!_.isUndefined(entry.barycenter)) {\n      // @ts-expect-error\n      tmp.barycenter = entry.barycenter;\n      // @ts-expect-error\n      tmp.weight = entry.weight;\n    }\n  });\n\n  _.forEach(cg.edges(), function (e) {\n    var entryV = mappedEntries[e.v];\n    var entryW = mappedEntries[e.w];\n    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  var sourceSet = _.filter(mappedEntries, function (entry) {\n    // @ts-expect-error\n    return !entry.indegree;\n  });\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  var entries = [];\n\n  function handleIn(vEntry) {\n    return function (uEntry) {\n      if (uEntry.merged) {\n        return;\n      }\n      if (\n        _.isUndefined(uEntry.barycenter) ||\n        _.isUndefined(vEntry.barycenter) ||\n        uEntry.barycenter >= vEntry.barycenter\n      ) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return function (wEntry) {\n      wEntry['in'].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    var entry = sourceSet.pop();\n    entries.push(entry);\n    _.forEach(entry['in'].reverse(), handleIn(entry));\n    _.forEach(entry.out, handleOut(entry));\n  }\n\n  return _.map(\n    _.filter(entries, function (entry) {\n      return !entry.merged;\n    }),\n    function (entry) {\n      return _.pick(entry, ['vs', 'i', 'barycenter', 'weight']);\n    }\n  );\n}\n\nfunction mergeEntries(target, source) {\n  var sum = 0;\n  var weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n","import * as _ from 'lodash-es';\nimport * as util from '../util.js';\n\nexport { sort };\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function (entry) {\n    return _.has(entry, 'barycenter');\n  });\n  var sortable = parts.lhs,\n    unsortable = _.sortBy(parts.rhs, function (entry) {\n      return -entry.i;\n    }),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  _.forEach(sortable, function (entry) {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  var result = { vs: _.flatten(vs) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  var last;\n  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return function (entryV, entryW) {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n","import * as _ from 'lodash-es';\nimport { barycenter } from './barycenter.js';\nimport { resolveConflicts } from './resolve-conflicts.js';\nimport { sort } from './sort.js';\n\nexport { sortSubgraph };\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  var movable = g.children(v);\n  var node = g.node(v);\n  var bl = node ? node.borderLeft : undefined;\n  var br = node ? node.borderRight : undefined;\n  var subgraphs = {};\n\n  if (bl) {\n    movable = _.filter(movable, function (w) {\n      return w !== bl && w !== br;\n    });\n  }\n\n  var barycenters = barycenter(g, movable);\n  _.forEach(barycenters, function (entry) {\n    if (g.children(entry.v).length) {\n      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (_.has(subgraphResult, 'barycenter')) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  var entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  var result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = _.flatten([bl, result.vs, br]);\n    if (g.predecessors(bl).length) {\n      var blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!_.has(result, 'barycenter')) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter =\n        (result.barycenter * result.weight + blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  _.forEach(entries, function (entry) {\n    entry.vs = _.flatten(\n      entry.vs.map(function (v) {\n        if (subgraphs[v]) {\n          return subgraphs[v].vs;\n        }\n        return v;\n      })\n    );\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (!_.isUndefined(target.barycenter)) {\n    target.barycenter =\n      (target.barycenter * target.weight + other.barycenter * other.weight) /\n      (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n","import * as _ from 'lodash-es';\n\nexport { barycenter };\n\nfunction barycenter(g, movable) {\n  return _.map(movable, function (v) {\n    var inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      var result = _.reduce(\n        inV,\n        function (acc, e) {\n          var edge = g.edge(e),\n            nodeU = g.node(e.v);\n          return {\n            sum: acc.sum + edge.weight * nodeU.order,\n            weight: acc.weight + edge.weight,\n          };\n        },\n        { sum: 0, weight: 0 }\n      );\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight,\n      };\n    }\n  });\n}\n","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\nimport * as util from '../util.js';\nimport { addSubgraphConstraints } from './add-subgraph-constraints.js';\nimport { buildLayerGraph } from './build-layer-graph.js';\nimport { crossCount } from './cross-count.js';\nimport { initOrder } from './init-order.js';\nimport { sortSubgraph } from './sort-subgraph.js';\n\nexport { order };\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g) {\n  var maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), 'inEdges'),\n    upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), 'outEdges');\n\n  var layering = initOrder(g);\n  assignOrder(g, layering);\n\n  var bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    var cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = _.cloneDeep(layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  return _.map(ranks, function (rank) {\n    return buildLayerGraph(g, rank, relationship);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  var cg = new Graph();\n  _.forEach(layerGraphs, function (lg) {\n    var root = lg.graph().root;\n    var sorted = sortSubgraph(lg, root, cg, biasRight);\n    _.forEach(sorted.vs, function (v, i) {\n      lg.node(v).order = i;\n    });\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  _.forEach(layering, function (layer) {\n    _.forEach(layer, function (v, i) {\n      g.node(v).order = i;\n    });\n  });\n}\n","import * as _ from 'lodash-es';\n\nexport { initOrder };\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  var visited = {};\n  var simpleNodes = _.filter(g.nodes(), function (v) {\n    return !g.children(v).length;\n  });\n  var maxRank = _.max(\n    _.map(simpleNodes, function (v) {\n      return g.node(v).rank;\n    })\n  );\n  var layers = _.map(_.range(maxRank + 1), function () {\n    return [];\n  });\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    var node = g.node(v);\n    layers[node.rank].push(v);\n    _.forEach(g.successors(v), dfs);\n  }\n\n  var orderedVs = _.sortBy(simpleNodes, function (v) {\n    return g.node(v).rank;\n  });\n  _.forEach(orderedVs, dfs);\n\n  return layers;\n}\n","import * as _ from 'lodash-es';\n\nexport { addSubgraphConstraints };\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  var prev = {},\n    rootPrev;\n\n  _.forEach(vs, function (v) {\n    var child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      _.each(children, function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n","import * as _ from 'lodash-es';\n\nexport { parentDummyChains };\n\nfunction parentDummyChains(g) {\n  var postorderNums = postorder(g);\n\n  _.forEach(g.graph().dummyChains, function (v) {\n    var node = g.node(v);\n    var edgeObj = node.edgeObj;\n    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    var path = pathData.path;\n    var lca = pathData.lca;\n    var pathIdx = 0;\n    var pathV = path[pathIdx];\n    var ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca && g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (\n          pathIdx < path.length - 1 &&\n          g.node((pathV = path[pathIdx + 1])).minRank <= node.rank\n        ) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  var vPath = [];\n  var wPath = [];\n  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  var parent;\n  var lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent && (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  var result = {};\n  var lim = 0;\n\n  function dfs(v) {\n    var low = lim;\n    _.forEach(g.children(v), dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  _.forEach(g.children(), dfs);\n\n  return result;\n}\n","import baseForOwn from './_baseForOwn.js';\nimport castFunction from './_castFunction.js';\n\n/**\n * Iterates over own enumerable string keyed properties of an object and\n * invokes `iteratee` for each property. The iteratee is invoked with three\n * arguments: (value, key, object). Iteratee functions may exit iteration\n * early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forOwnRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forOwn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forOwn(object, iteratee) {\n  return object && baseForOwn(object, castFunction(iteratee));\n}\n\nexport default forOwn;\n","import baseFor from './_baseFor.js';\nimport castFunction from './_castFunction.js';\nimport keysIn from './keysIn.js';\n\n/**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\nfunction forIn(object, iteratee) {\n  return object == null\n    ? object\n    : baseFor(object, castFunction(iteratee), keysIn);\n}\n\nexport default forIn;\n","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\nimport * as util from '../util.js';\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nexport {\n  positionX,\n  findType1Conflicts,\n  findType2Conflicts,\n  addConflict,\n  hasConflict,\n  verticalAlignment,\n  horizontalCompaction,\n  alignCoordinates,\n  findSmallestWidthAlignment,\n  balance,\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  var conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    var // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = _.last(layer);\n\n    _.forEach(layer, function (v, i) {\n      var w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        _.forEach(layer.slice(scanPos, i + 1), function (scanNode) {\n          _.forEach(g.predecessors(scanNode), function (u) {\n            var uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) && !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        // @ts-expect-error\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  var conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    var v;\n    _.forEach(_.range(southPos, southEnd), function (i) {\n      v = south[i];\n      if (g.node(v).dummy) {\n        _.forEach(g.predecessors(v), function (u) {\n          var uNode = g.node(u);\n          if (uNode.dummy && (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n  function visitLayer(north, south) {\n    var prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    _.forEach(south, function (v, southLookahead) {\n      if (g.node(v).dummy === 'border') {\n        var predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          // @ts-expect-error\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return _.find(g.predecessors(v), function (u) {\n      return g.node(u).dummy;\n    });\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  var conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return _.has(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  var root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  _.forEach(layering, function (layer) {\n    _.forEach(layer, function (v, order) {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  _.forEach(layering, function (layer) {\n    var prevIdx = -1;\n    _.forEach(layer, function (v) {\n      var ws = neighborFn(v);\n      if (ws.length) {\n        ws = _.sortBy(ws, function (w) {\n          return pos[w];\n        });\n        var mp = (ws.length - 1) / 2;\n        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          var w = ws[i];\n          if (align[v] === v && prevIdx < pos[w] && !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  var xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? 'borderLeft' : 'borderRight';\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    var stack = blockG.nodes();\n    var elem = stack.pop();\n    var visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce(function (acc, e) {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    var min = blockG.outEdges(elem).reduce(function (acc, e) {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    var node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  _.forEach(align, function (v) {\n    xs[v] = xs[root[v]];\n  });\n\n  return xs;\n}\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  var blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  _.forEach(layering, function (layer) {\n    var u;\n    _.forEach(layer, function (v) {\n      var vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return _.minBy(_.values(xss), function (xs) {\n    var max = Number.NEGATIVE_INFINITY;\n    var min = Number.POSITIVE_INFINITY;\n\n    _.forIn(xs, function (x, v) {\n      var halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    return max - min;\n  });\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  var alignToVals = _.values(alignTo),\n    alignToMin = _.min(alignToVals),\n    alignToMax = _.max(alignToVals);\n\n  _.forEach(['u', 'd'], function (vert) {\n    _.forEach(['l', 'r'], function (horiz) {\n      var alignment = vert + horiz,\n        xs = xss[alignment],\n        delta;\n      if (xs === alignTo) return;\n\n      var xsVals = _.values(xs);\n      delta = horiz === 'l' ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n      if (delta) {\n        xss[alignment] = _.mapValues(xs, function (x) {\n          return x + delta;\n        });\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return _.mapValues(xss.ul, function (ignore, v) {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      var xs = _.sortBy(_.map(xss, v));\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  var layering = util.buildLayerMatrix(g);\n  var conflicts = _.merge(findType1Conflicts(g, layering), findType2Conflicts(g, layering));\n\n  var xss = {};\n  var adjustedLayering;\n  _.forEach(['u', 'd'], function (vert) {\n    adjustedLayering = vert === 'u' ? layering : _.values(layering).reverse();\n    _.forEach(['l', 'r'], function (horiz) {\n      if (horiz === 'r') {\n        adjustedLayering = _.map(adjustedLayering, function (inner) {\n          return _.values(inner).reverse();\n        });\n      }\n\n      var neighborFn = (vert === 'u' ? g.predecessors : g.successors).bind(g);\n      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, horiz === 'r');\n      if (horiz === 'r') {\n        xs = _.mapValues(xs, function (x) {\n          return -x;\n        });\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  var smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return function (g, v, w) {\n    var vLabel = g.node(v);\n    var wLabel = g.node(w);\n    var sum = 0;\n    var delta;\n\n    sum += vLabel.width / 2;\n    if (_.has(vLabel, 'labelpos')) {\n      switch (vLabel.labelpos.toLowerCase()) {\n        case 'l':\n          delta = -vLabel.width / 2;\n          break;\n        case 'r':\n          delta = vLabel.width / 2;\n          break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (_.has(wLabel, 'labelpos')) {\n      switch (wLabel.labelpos.toLowerCase()) {\n        case 'l':\n          delta = wLabel.width / 2;\n          break;\n        case 'r':\n          delta = -wLabel.width / 2;\n          break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n","import * as _ from 'lodash-es';\nimport * as util from '../util.js';\nimport { positionX } from './bk.js';\n\nexport { position };\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  _.forOwn(positionX(g), function (x, v) {\n    g.node(v).x = x;\n  });\n}\n\nfunction positionY(g) {\n  var layering = util.buildLayerMatrix(g);\n  var rankSep = g.graph().ranksep;\n  var prevY = 0;\n  _.forEach(layering, function (layer) {\n    var maxHeight = _.max(\n      _.map(layer, function (v) {\n        return g.node(v).height;\n      })\n    );\n    _.forEach(layer, function (v) {\n      g.node(v).y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + rankSep;\n  });\n}\n","import * as _ from 'lodash-es';\nimport { Graph } from '../graphlib/index.js';\nimport { addBorderSegments } from './add-border-segments.js';\nimport * as coordinateSystem from './coordinate-system.js';\nimport * as acyclic from './acyclic.js';\nimport * as normalize from './normalize.js';\nimport { rank } from './rank/index.js';\nimport * as nestingGraph from './nesting-graph.js';\nimport { order } from './order/index.js';\nimport { parentDummyChains } from './parent-dummy-chains.js';\nimport { position } from './position/index.js';\nimport * as util from './util.js';\n\nexport { layout };\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? util.time : util.notime;\n  time('layout', function () {\n    var layoutGraph = time('  buildLayoutGraph', function () {\n      return buildLayoutGraph(g);\n    });\n    time('  runLayout', function () {\n      runLayout(layoutGraph, time);\n    });\n    time('  updateInputGraph', function () {\n      updateInputGraph(g, layoutGraph);\n    });\n  });\n}\n\nfunction runLayout(g, time) {\n  time('    makeSpaceForEdgeLabels', function () {\n    makeSpaceForEdgeLabels(g);\n  });\n  time('    removeSelfEdges', function () {\n    removeSelfEdges(g);\n  });\n  time('    acyclic', function () {\n    acyclic.run(g);\n  });\n  time('    nestingGraph.run', function () {\n    nestingGraph.run(g);\n  });\n  time('    rank', function () {\n    rank(util.asNonCompoundGraph(g));\n  });\n  time('    injectEdgeLabelProxies', function () {\n    injectEdgeLabelProxies(g);\n  });\n  time('    removeEmptyRanks', function () {\n    util.removeEmptyRanks(g);\n  });\n  time('    nestingGraph.cleanup', function () {\n    nestingGraph.cleanup(g);\n  });\n  time('    normalizeRanks', function () {\n    util.normalizeRanks(g);\n  });\n  time('    assignRankMinMax', function () {\n    assignRankMinMax(g);\n  });\n  time('    removeEdgeLabelProxies', function () {\n    removeEdgeLabelProxies(g);\n  });\n  time('    normalize.run', function () {\n    normalize.run(g);\n  });\n  time('    parentDummyChains', function () {\n    parentDummyChains(g);\n  });\n  time('    addBorderSegments', function () {\n    addBorderSegments(g);\n  });\n  time('    order', function () {\n    order(g);\n  });\n  time('    insertSelfEdges', function () {\n    insertSelfEdges(g);\n  });\n  time('    adjustCoordinateSystem', function () {\n    coordinateSystem.adjust(g);\n  });\n  time('    position', function () {\n    position(g);\n  });\n  time('    positionSelfEdges', function () {\n    positionSelfEdges(g);\n  });\n  time('    removeBorderNodes', function () {\n    removeBorderNodes(g);\n  });\n  time('    normalize.undo', function () {\n    normalize.undo(g);\n  });\n  time('    fixupEdgeLabelCoords', function () {\n    fixupEdgeLabelCoords(g);\n  });\n  time('    undoCoordinateSystem', function () {\n    coordinateSystem.undo(g);\n  });\n  time('    translateGraph', function () {\n    translateGraph(g);\n  });\n  time('    assignNodeIntersects', function () {\n    assignNodeIntersects(g);\n  });\n  time('    reversePoints', function () {\n    reversePointsForReversedEdges(g);\n  });\n  time('    acyclic.undo', function () {\n    acyclic.undo(g);\n  });\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  _.forEach(inputGraph.nodes(), function (v) {\n    var inputLabel = inputGraph.node(v);\n    var layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  _.forEach(inputGraph.edges(), function (e) {\n    var inputLabel = inputGraph.edge(e);\n    var layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (_.has(layoutLabel, 'x')) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = ['nodesep', 'edgesep', 'ranksep', 'marginx', 'marginy'];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: 'tb' };\nvar graphAttrs = ['acyclicer', 'ranker', 'rankdir', 'align'];\nvar nodeNumAttrs = ['width', 'height'];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];\nvar edgeDefaults = {\n  minlen: 1,\n  weight: 1,\n  width: 0,\n  height: 0,\n  labeloffset: 10,\n  labelpos: 'r',\n};\nvar edgeAttrs = ['labelpos'];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  var g = new Graph({ multigraph: true, compound: true });\n  var graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(\n    _.merge({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), _.pick(graph, graphAttrs))\n  );\n\n  _.forEach(inputGraph.nodes(), function (v) {\n    var node = canonicalize(inputGraph.node(v));\n    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  _.forEach(inputGraph.edges(), function (e) {\n    var edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(\n      e,\n      _.merge({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), _.pick(edge, edgeAttrs))\n    );\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  var graph = g.graph();\n  graph.ranksep /= 2;\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== 'c') {\n      if (graph.rankdir === 'TB' || graph.rankdir === 'BT') {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (edge.width && edge.height) {\n      var v = g.node(e.v);\n      var w = g.node(e.w);\n      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, 'edge-proxy', label, '_ep');\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  var maxRank = 0;\n  _.forEach(g.nodes(), function (v) {\n    var node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      // @ts-expect-error\n      maxRank = _.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  _.forEach(g.nodes(), function (v) {\n    var node = g.node(v);\n    if (node.dummy === 'edge-proxy') {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  var minX = Number.POSITIVE_INFINITY;\n  var maxX = 0;\n  var minY = Number.POSITIVE_INFINITY;\n  var maxY = 0;\n  var graphLabel = g.graph();\n  var marginX = graphLabel.marginx || 0;\n  var marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    var x = attrs.x;\n    var y = attrs.y;\n    var w = attrs.width;\n    var h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  _.forEach(g.nodes(), function (v) {\n    getExtremes(g.node(v));\n  });\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (_.has(edge, 'x')) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  _.forEach(g.nodes(), function (v) {\n    var node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, function (p) {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (_.has(edge, 'x')) {\n      edge.x -= minX;\n    }\n    if (_.has(edge, 'y')) {\n      edge.y -= minY;\n    }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    var nodeV = g.node(e.v);\n    var nodeW = g.node(e.w);\n    var p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (_.has(edge, 'x')) {\n      if (edge.labelpos === 'l' || edge.labelpos === 'r') {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n        case 'l':\n          edge.x -= edge.width / 2 + edge.labeloffset;\n          break;\n        case 'r':\n          edge.x += edge.width / 2 + edge.labeloffset;\n          break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  _.forEach(g.edges(), function (e) {\n    var edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  _.forEach(g.nodes(), function (v) {\n    if (g.children(v).length) {\n      var node = g.node(v);\n      var t = g.node(node.borderTop);\n      var b = g.node(node.borderBottom);\n      var l = g.node(_.last(node.borderLeft));\n      var r = g.node(_.last(node.borderRight));\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  _.forEach(g.nodes(), function (v) {\n    if (g.node(v).dummy === 'border') {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  _.forEach(g.edges(), function (e) {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  _.forEach(layers, function (layer) {\n    var orderShift = 0;\n    _.forEach(layer, function (v, i) {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      _.forEach(node.selfEdges, function (selfEdge) {\n        util.addDummyNode(\n          g,\n          'selfedge',\n          {\n            width: selfEdge.label.width,\n            height: selfEdge.label.height,\n            rank: node.rank,\n            order: i + ++orderShift,\n            e: selfEdge.e,\n            label: selfEdge.label,\n          },\n          '_se'\n        );\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  _.forEach(g.nodes(), function (v) {\n    var node = g.node(v);\n    if (node.dummy === 'selfedge') {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + (2 * dx) / 3, y: y - dy },\n        { x: x + (5 * dx) / 6, y: y - dy },\n        { x: x + dx, y: y },\n        { x: x + (5 * dx) / 6, y: y + dy },\n        { x: x + (2 * dx) / 3, y: y + dy },\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  _.forEach(attrs, function (v, k) {\n    newAttrs[k.toLowerCase()] = v;\n  });\n  return newAttrs;\n}\n","import baseFlatten from './_baseFlatten.js';\nimport baseRest from './_baseRest.js';\nimport baseUniq from './_baseUniq.js';\nimport isArrayLikeObject from './isArrayLikeObject.js';\n\n/**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\nvar union = baseRest(function(arrays) {\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\nexport default union;\n","import * as _ from 'lodash-es';\n\nvar DEFAULT_EDGE_NAME = '\\x00';\nvar GRAPH_NODE = '\\x00';\nvar EDGE_KEY_DELIM = '\\x01';\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\nexport class Graph {\n  constructor(opts = {}) {\n    this._isDirected = _.has(opts, 'directed') ? opts.directed : true;\n    this._isMultigraph = _.has(opts, 'multigraph') ? opts.multigraph : false;\n    this._isCompound = _.has(opts, 'compound') ? opts.compound : false;\n\n    // Label for the graph itself\n    this._label = undefined;\n\n    // Defaults to be set when creating a new node\n    this._defaultNodeLabelFn = _.constant(undefined);\n\n    // Defaults to be set when creating a new edge\n    this._defaultEdgeLabelFn = _.constant(undefined);\n\n    // v -> label\n    this._nodes = {};\n\n    if (this._isCompound) {\n      // v -> parent\n      this._parent = {};\n\n      // v -> children\n      this._children = {};\n      this._children[GRAPH_NODE] = {};\n    }\n\n    // v -> edgeObj\n    this._in = {};\n\n    // u -> v -> Number\n    this._preds = {};\n\n    // v -> edgeObj\n    this._out = {};\n\n    // v -> w -> Number\n    this._sucs = {};\n\n    // e -> edgeObj\n    this._edgeObjs = {};\n\n    // e -> label\n    this._edgeLabels = {};\n  }\n  /* === Graph functions ========= */\n  isDirected() {\n    return this._isDirected;\n  }\n  isMultigraph() {\n    return this._isMultigraph;\n  }\n  isCompound() {\n    return this._isCompound;\n  }\n  setGraph(label) {\n    this._label = label;\n    return this;\n  }\n  graph() {\n    return this._label;\n  }\n  /* === Node functions ========== */\n  setDefaultNodeLabel(newDefault) {\n    if (!_.isFunction(newDefault)) {\n      newDefault = _.constant(newDefault);\n    }\n    this._defaultNodeLabelFn = newDefault;\n    return this;\n  }\n  nodeCount() {\n    return this._nodeCount;\n  }\n  nodes() {\n    return _.keys(this._nodes);\n  }\n  sources() {\n    var self = this;\n    return _.filter(this.nodes(), function (v) {\n      return _.isEmpty(self._in[v]);\n    });\n  }\n  sinks() {\n    var self = this;\n    return _.filter(this.nodes(), function (v) {\n      return _.isEmpty(self._out[v]);\n    });\n  }\n  setNodes(vs, value) {\n    var args = arguments;\n    var self = this;\n    _.each(vs, function (v) {\n      if (args.length > 1) {\n        self.setNode(v, value);\n      } else {\n        self.setNode(v);\n      }\n    });\n    return this;\n  }\n  setNode(v, value) {\n    if (_.has(this._nodes, v)) {\n      if (arguments.length > 1) {\n        this._nodes[v] = value;\n      }\n      return this;\n    }\n\n    // @ts-expect-error\n    this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n    if (this._isCompound) {\n      this._parent[v] = GRAPH_NODE;\n      this._children[v] = {};\n      this._children[GRAPH_NODE][v] = true;\n    }\n    this._in[v] = {};\n    this._preds[v] = {};\n    this._out[v] = {};\n    this._sucs[v] = {};\n    ++this._nodeCount;\n    return this;\n  }\n  node(v) {\n    return this._nodes[v];\n  }\n  hasNode(v) {\n    return _.has(this._nodes, v);\n  }\n  removeNode(v) {\n    var self = this;\n    if (_.has(this._nodes, v)) {\n      var removeEdge = function (e) {\n        self.removeEdge(self._edgeObjs[e]);\n      };\n      delete this._nodes[v];\n      if (this._isCompound) {\n        this._removeFromParentsChildList(v);\n        delete this._parent[v];\n        _.each(this.children(v), function (child) {\n          self.setParent(child);\n        });\n        delete this._children[v];\n      }\n      _.each(_.keys(this._in[v]), removeEdge);\n      delete this._in[v];\n      delete this._preds[v];\n      _.each(_.keys(this._out[v]), removeEdge);\n      delete this._out[v];\n      delete this._sucs[v];\n      --this._nodeCount;\n    }\n    return this;\n  }\n  setParent(v, parent) {\n    if (!this._isCompound) {\n      throw new Error('Cannot set parent in a non-compound graph');\n    }\n\n    if (_.isUndefined(parent)) {\n      parent = GRAPH_NODE;\n    } else {\n      // Coerce parent to string\n      parent += '';\n      for (var ancestor = parent; !_.isUndefined(ancestor); ancestor = this.parent(ancestor)) {\n        if (ancestor === v) {\n          throw new Error('Setting ' + parent + ' as parent of ' + v + ' would create a cycle');\n        }\n      }\n\n      this.setNode(parent);\n    }\n\n    this.setNode(v);\n    this._removeFromParentsChildList(v);\n    this._parent[v] = parent;\n    this._children[parent][v] = true;\n    return this;\n  }\n  _removeFromParentsChildList(v) {\n    delete this._children[this._parent[v]][v];\n  }\n  parent(v) {\n    if (this._isCompound) {\n      var parent = this._parent[v];\n      if (parent !== GRAPH_NODE) {\n        return parent;\n      }\n    }\n  }\n  children(v) {\n    if (_.isUndefined(v)) {\n      v = GRAPH_NODE;\n    }\n\n    if (this._isCompound) {\n      var children = this._children[v];\n      if (children) {\n        return _.keys(children);\n      }\n    } else if (v === GRAPH_NODE) {\n      return this.nodes();\n    } else if (this.hasNode(v)) {\n      return [];\n    }\n  }\n  predecessors(v) {\n    var predsV = this._preds[v];\n    if (predsV) {\n      return _.keys(predsV);\n    }\n  }\n  successors(v) {\n    var sucsV = this._sucs[v];\n    if (sucsV) {\n      return _.keys(sucsV);\n    }\n  }\n  neighbors(v) {\n    var preds = this.predecessors(v);\n    if (preds) {\n      return _.union(preds, this.successors(v));\n    }\n  }\n  isLeaf(v) {\n    var neighbors;\n    if (this.isDirected()) {\n      neighbors = this.successors(v);\n    } else {\n      neighbors = this.neighbors(v);\n    }\n    return neighbors.length === 0;\n  }\n  filterNodes(filter) {\n    // @ts-expect-error\n    var copy = new this.constructor({\n      directed: this._isDirected,\n      multigraph: this._isMultigraph,\n      compound: this._isCompound,\n    });\n\n    copy.setGraph(this.graph());\n\n    var self = this;\n    _.each(this._nodes, function (value, v) {\n      if (filter(v)) {\n        copy.setNode(v, value);\n      }\n    });\n\n    _.each(this._edgeObjs, function (e) {\n      // @ts-expect-error\n      if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n        copy.setEdge(e, self.edge(e));\n      }\n    });\n\n    var parents = {};\n    function findParent(v) {\n      var parent = self.parent(v);\n      if (parent === undefined || copy.hasNode(parent)) {\n        parents[v] = parent;\n        return parent;\n      } else if (parent in parents) {\n        return parents[parent];\n      } else {\n        return findParent(parent);\n      }\n    }\n\n    if (this._isCompound) {\n      _.each(copy.nodes(), function (v) {\n        copy.setParent(v, findParent(v));\n      });\n    }\n\n    return copy;\n  }\n  /* === Edge functions ========== */\n  setDefaultEdgeLabel(newDefault) {\n    if (!_.isFunction(newDefault)) {\n      newDefault = _.constant(newDefault);\n    }\n    this._defaultEdgeLabelFn = newDefault;\n    return this;\n  }\n  edgeCount() {\n    return this._edgeCount;\n  }\n  edges() {\n    return _.values(this._edgeObjs);\n  }\n  setPath(vs, value) {\n    var self = this;\n    var args = arguments;\n    _.reduce(vs, function (v, w) {\n      if (args.length > 1) {\n        self.setEdge(v, w, value);\n      } else {\n        self.setEdge(v, w);\n      }\n      return w;\n    });\n    return this;\n  }\n  /*\n   * setEdge(v, w, [value, [name]])\n   * setEdge({ v, w, [name] }, [value])\n   */\n  setEdge() {\n    var v, w, name, value;\n    var valueSpecified = false;\n    var arg0 = arguments[0];\n\n    if (typeof arg0 === 'object' && arg0 !== null && 'v' in arg0) {\n      v = arg0.v;\n      w = arg0.w;\n      name = arg0.name;\n      if (arguments.length === 2) {\n        value = arguments[1];\n        valueSpecified = true;\n      }\n    } else {\n      v = arg0;\n      w = arguments[1];\n      name = arguments[3];\n      if (arguments.length > 2) {\n        value = arguments[2];\n        valueSpecified = true;\n      }\n    }\n\n    v = '' + v;\n    w = '' + w;\n    if (!_.isUndefined(name)) {\n      name = '' + name;\n    }\n\n    var e = edgeArgsToId(this._isDirected, v, w, name);\n    if (_.has(this._edgeLabels, e)) {\n      if (valueSpecified) {\n        this._edgeLabels[e] = value;\n      }\n      return this;\n    }\n\n    if (!_.isUndefined(name) && !this._isMultigraph) {\n      throw new Error('Cannot set a named edge when isMultigraph = false');\n    }\n\n    // It didn't exist, so we need to create it.\n    // First ensure the nodes exist.\n    this.setNode(v);\n    this.setNode(w);\n\n    // @ts-expect-error\n    this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n    var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n    // Ensure we add undirected edges in a consistent way.\n    v = edgeObj.v;\n    w = edgeObj.w;\n\n    Object.freeze(edgeObj);\n    this._edgeObjs[e] = edgeObj;\n    incrementOrInitEntry(this._preds[w], v);\n    incrementOrInitEntry(this._sucs[v], w);\n    this._in[w][e] = edgeObj;\n    this._out[v][e] = edgeObj;\n    this._edgeCount++;\n    return this;\n  }\n  edge(v, w, name) {\n    var e =\n      arguments.length === 1\n        ? edgeObjToId(this._isDirected, arguments[0])\n        : edgeArgsToId(this._isDirected, v, w, name);\n    return this._edgeLabels[e];\n  }\n  hasEdge(v, w, name) {\n    var e =\n      arguments.length === 1\n        ? edgeObjToId(this._isDirected, arguments[0])\n        : edgeArgsToId(this._isDirected, v, w, name);\n    return _.has(this._edgeLabels, e);\n  }\n  removeEdge(v, w, name) {\n    var e =\n      arguments.length === 1\n        ? edgeObjToId(this._isDirected, arguments[0])\n        : edgeArgsToId(this._isDirected, v, w, name);\n    var edge = this._edgeObjs[e];\n    if (edge) {\n      v = edge.v;\n      w = edge.w;\n      delete this._edgeLabels[e];\n      delete this._edgeObjs[e];\n      decrementOrRemoveEntry(this._preds[w], v);\n      decrementOrRemoveEntry(this._sucs[v], w);\n      delete this._in[w][e];\n      delete this._out[v][e];\n      this._edgeCount--;\n    }\n    return this;\n  }\n  inEdges(v, u) {\n    var inV = this._in[v];\n    if (inV) {\n      var edges = _.values(inV);\n      if (!u) {\n        return edges;\n      }\n      return _.filter(edges, function (edge) {\n        return edge.v === u;\n      });\n    }\n  }\n  outEdges(v, w) {\n    var outV = this._out[v];\n    if (outV) {\n      var edges = _.values(outV);\n      if (!w) {\n        return edges;\n      }\n      return _.filter(edges, function (edge) {\n        return edge.w === w;\n      });\n    }\n  }\n  nodeEdges(v, w) {\n    var inEdges = this.inEdges(v, w);\n    if (inEdges) {\n      return inEdges.concat(this.outEdges(v, w));\n    }\n  }\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) {\n    delete map[k];\n  }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = '' + v_;\n  var w = '' + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM + (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = '' + v_;\n  var w = '' + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj = { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n","// Includes only the \"core\" of graphlib\n\nimport { Graph } from './graph.js';\n\nconst version = '2.1.9-pre';\n\nexport { Graph, version };\n","import baseForOwn from './_baseForOwn.js';\nimport createBaseEach from './_createBaseEach.js';\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nexport default baseEach;\n","import isArrayLike from './isArrayLike.js';\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nexport default createBaseEach;\n","import Symbol from './_Symbol.js';\nimport isArguments from './isArguments.js';\nimport isArray from './isArray.js';\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nexport default isFlattenable;\n","import arrayPush from './_arrayPush.js';\nimport isFlattenable from './_isFlattenable.js';\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nexport default baseFlatten;\n","import baseFor from './_baseFor.js';\nimport keys from './keys.js';\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nexport default baseForOwn;\n","import baseEach from './_baseEach.js';\nimport isArrayLike from './isArrayLike.js';\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nexport default baseMap;\n","import identity from './identity.js';\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nexport default castFunction;\n","import baseRest from './_baseRest.js';\nimport eq from './eq.js';\nimport isIterateeCall from './_isIterateeCall.js';\nimport keysIn from './keysIn.js';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\nvar defaults = baseRest(function(object, sources) {\n  object = Object(object);\n\n  var index = -1;\n  var length = sources.length;\n  var guard = length > 2 ? sources[2] : undefined;\n\n  if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n    length = 1;\n  }\n\n  while (++index < length) {\n    var source = sources[index];\n    var props = keysIn(source);\n    var propsIndex = -1;\n    var propsLength = props.length;\n\n    while (++propsIndex < propsLength) {\n      var key = props[propsIndex];\n      var value = object[key];\n\n      if (value === undefined ||\n          (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        object[key] = source[key];\n      }\n    }\n  }\n\n  return object;\n});\n\nexport default defaults;\n","import baseEach from './_baseEach.js';\n\n/**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction baseFilter(collection, predicate) {\n  var result = [];\n  baseEach(collection, function(value, index, collection) {\n    if (predicate(value, index, collection)) {\n      result.push(value);\n    }\n  });\n  return result;\n}\n\nexport default baseFilter;\n","import arrayFilter from './_arrayFilter.js';\nimport baseFilter from './_baseFilter.js';\nimport baseIteratee from './_baseIteratee.js';\nimport isArray from './isArray.js';\n\n/**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': true },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\nfunction filter(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nexport default filter;\n","import baseFlatten from './_baseFlatten.js';\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n","import arrayEach from './_arrayEach.js';\nimport baseEach from './_baseEach.js';\nimport castFunction from './_castFunction.js';\nimport isArray from './isArray.js';\n\n/**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n *   console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forEach(collection, iteratee) {\n  var func = isArray(collection) ? arrayEach : baseEach;\n  return func(collection, castFunction(iteratee));\n}\n\nexport default forEach;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHas(object, key) {\n  return object != null && hasOwnProperty.call(object, key);\n}\n\nexport default baseHas;\n","import baseHas from './_baseHas.js';\nimport hasPath from './_hasPath.js';\n\n/**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\nfunction has(object, path) {\n  return object != null && hasPath(object, path, baseHas);\n}\n\nexport default has;\n","/**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\nfunction isUndefined(value) {\n  return value === undefined;\n}\n\nexport default isUndefined;\n","import arrayMap from './_arrayMap.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseMap from './_baseMap.js';\nimport isArray from './isArray.js';\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nexport default map;\n","import basePickBy from './_basePickBy.js';\nimport hasIn from './hasIn.js';\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nexport default basePick;\n","import basePick from './_basePick.js';\nimport flatRest from './_flatRest.js';\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nexport default pick;\n","import flatten from './flatten.js';\nimport overRest from './_overRest.js';\nimport setToString from './_setToString.js';\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nexport default flatRest;\n","/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil,\n    nativeMax = Math.max;\n\n/**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\nfunction baseRange(start, end, step, fromRight) {\n  var index = -1,\n      length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n      result = Array(length);\n\n  while (length--) {\n    result[fromRight ? length : ++index] = start;\n    start += step;\n  }\n  return result;\n}\n\nexport default baseRange;\n","import createRange from './_createRange.js';\n\n/**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\nvar range = createRange();\n\nexport default range;\n","import baseRange from './_baseRange.js';\nimport isIterateeCall from './_isIterateeCall.js';\nimport toFinite from './toFinite.js';\n\n/**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\nfunction createRange(fromRight) {\n  return function(start, end, step) {\n    if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n      end = step = undefined;\n    }\n    // Ensure the sign of `-0` is preserved.\n    start = toFinite(start);\n    if (end === undefined) {\n      end = start;\n      start = 0;\n    } else {\n      end = toFinite(end);\n    }\n    step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n    return baseRange(start, end, step, fromRight);\n  };\n}\n\nexport default createRange;\n","/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nexport default arrayReduce;\n","/**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n *  `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n  eachFunc(collection, function(value, index, collection) {\n    accumulator = initAccum\n      ? (initAccum = false, value)\n      : iteratee(accumulator, value, index, collection);\n  });\n  return accumulator;\n}\n\nexport default baseReduce;\n","import arrayReduce from './_arrayReduce.js';\nimport baseEach from './_baseEach.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseReduce from './_baseReduce.js';\nimport isArray from './isArray.js';\n\n/**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n *   return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n *   return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\nfunction reduce(collection, iteratee, accumulator) {\n  var func = isArray(collection) ? arrayReduce : baseReduce,\n      initAccum = arguments.length < 3;\n\n  return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nexport default reduce;\n","import toString from './toString.js';\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return toString(prefix) + id;\n}\n\nexport default uniqueId;\n","import arrayMap from './_arrayMap.js';\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\nexport default baseValues;\n","import baseValues from './_baseValues.js';\nimport keys from './keys.js';\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object == null ? [] : baseValues(object, keys(object));\n}\n\nexport default values;\n"],"names":["List","constructor","sentinel","_next","_prev","this","_sentinel","dequeue","entry","unlink","enqueue","toString","strs","curr","push","JSON","stringify","filterOutLinks","join","k","v","DEFAULT_WEIGHT_FN","greedyFAS","g","weightFn","nodeCount","state","fasGraph","Graph","maxIn","maxOut","nodes","setNode","in","out","edges","e","prevWeight","edge","w","weight","edgeWeight","setEdge","Math","max","node","buckets","map","zeroIdx","assignBucket","graph","buildState","results","sources","length","sinks","removeNode","i","concat","doGreedyFAS","outEdges","collectPredecessors","undefined","inEdges","uEntry","wEntry","run","fas","acyclicer","stack","visited","dfs","dfsFAS","label","removeEdge","forwardName","name","reversed","undo","array","iteratee","comparator","index","value","current","computed","isSymbol","result","other","identity","object","key","props","values","assignFunc","valsLength","addDummyNode","type","attrs","hasNode","dummy","asNonCompoundGraph","simplified","multigraph","isMultigraph","setGraph","children","intersectRect","rect","point","sx","sy","x","y","dx","dy","width","h","height","Error","abs","buildLayerMatrix","layering","rank","order","addBorderNode","prefix","arguments","fn","start","console","log","notime","prop","sg","sgNode","borderType","prev","setParent","rankDir","rankdir","toLowerCase","reverseYOne","points","reverseY","swapXYOne","swapXY","swapWidthHeight","swapWidthHeightOne","dummyChains","vRank","wRank","edgeLabel","labelRank","edgeObj","labelpos","normalizeEdge","origLabel","successors","longestPath","minlen","Number","POSITIVE_INFINITY","slack","feasibleTree","delta","t","directed","size","tightTree","findMinSlackEdge","shiftRanks","nodeEdges","edgeV","nativeMax","predicate","fromIndex","toInteger","isArray","isObjectLike","reHasUnicode","RegExp","string","test","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsOptVar","rsSeq","rsSymbol","reUnicode","lastIndex","collection","isArrayLike","tag","topsort","visit","CycleException","predecessors","vs","navigation","isDirected","neighbors","bind","acc","doDfs","postorder","prototype","networkSimplex","simpleLabel","simplify","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","slice","child","childLab","parent","cutvalue","calcCutValue","assignCutValue","childIsTail","graphEdge","cutValue","u","isOutEdge","pointsToHead","otherWeight","hasEdge","otherCutValue","tree","root","dfsAssignLowLim","nextLim","low","lim","vLabel","wLabel","tailLabel","flip","candidates","isDescendant","f","flipped","updateRanks","rootLabel","ranker","networkSimplexRanker","tightTreeRanker","longestPathRanker","depths","depth","treeDepths","nodeSep","nestingRoot","sumWeights","nodeRankFactor","top","bottom","borderTop","borderBottom","childNode","childTop","childBottom","thisWeight","nestingEdge","buildLayerGraph","relationship","createRootNode","compound","setDefaultNodeLabel","minRank","maxRank","borderLeft","borderRight","comparer","sort","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","orders","objCriteria","criteria","othCriteria","ordersLength","iteratees","crossCount","cc","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","pos","firstIndex","treeSize","Array","forEach","weightSum","resolveConflicts","entries","cg","mappedEntries","tmp","indegree","barycenter","entryV","entryW","sourceSet","handleIn","vEntry","merged","target","source","sum","min","mergeEntries","handleOut","pop","reverse","doResolveConflicts","biasRight","bias","parts","lhs","rhs","sortable","unsortable","vsIndex","consumeUnsortable","last","sortSubgraph","movable","bl","br","subgraphs","barycenters","inV","nodeU","subgraphResult","expandSubgraphs","blPred","brPred","downLayerGraphs","buildLayerGraphs","upLayerGraphs","simpleNodes","layers","orderedVs","initOrder","assignOrder","best","bestCC","lastBest","sweepLayerGraphs","ranks","layerGraphs","lg","sorted","rootPrev","prevChild","addSubgraphConstraints","layer","parentDummyChains","postorderNums","pathData","lca","vPath","wPath","path","findPath","pathIdx","pathV","ascending","keysIn","findType1Conflicts","conflicts","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","addConflict","conflictsV","hasConflict","horizontalCompaction","align","reverseSep","xs","blockG","blockGraph","graphLabel","sepFn","edgeSep","sep","nodesep","edgesep","vRoot","uRoot","prevMax","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","elem","reduce","positionX","adjustedLayering","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","findType2Conflicts","xss","vert","horiz","inner","neighborFn","prevIdx","ws","mp","floor","il","ceil","verticalAlignment","smallestWidth","NEGATIVE_INFINITY","halfWidth","findSmallestWidthAlignment","alignTo","alignToVals","alignToMin","alignToMax","alignment","xsVals","alignCoordinates","ul","ignore","balance","position","rankSep","ranksep","prevY","maxHeight","positionY","layout","opts","time","debugTiming","layoutGraph","inputGraph","canonicalize","graphDefaults","selectNumberAttrs","graphNumAttrs","graphAttrs","nodeNumAttrs","nodeDefaults","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeSelfEdges","injectEdgeLabelProxies","offset","assignRankMinMax","removeEdgeLabelProxies","addBorderSegments","orderShift","selfEdge","insertSelfEdges","selfNode","positionSelfEdges","b","l","r","removeBorderNodes","fixupEdgeLabelCoords","minX","maxX","minY","maxY","marginX","marginx","marginY","marginy","getExtremes","p","translateGraph","p1","p2","nodeV","nodeW","unshift","assignNodeIntersects","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","obj","newAttrs","arrays","isArrayLikeObject","DEFAULT_EDGE_NAME","GRAPH_NODE","EDGE_KEY_DELIM","_isDirected","_isMultigraph","_isCompound","_label","_defaultNodeLabelFn","_defaultEdgeLabelFn","_nodes","_parent","_children","_in","_preds","_out","_sucs","_edgeObjs","_edgeLabels","isCompound","newDefault","_nodeCount","self","setNodes","args","_removeFromParentsChildList","ancestor","predsV","sucsV","preds","isLeaf","filterNodes","filter","copy","parents","findParent","setDefaultEdgeLabel","edgeCount","_edgeCount","setPath","valueSpecified","arg0","edgeArgsToId","v_","w_","edgeArgsToObj","Object","freeze","incrementOrInitEntry","edgeObjToId","decrementOrRemoveEntry","outV","version","eachFunc","fromRight","iterable","spreadableSymbol","isConcatSpreadable","isArguments","baseFlatten","isStrict","objectProto","hasOwnProperty","guard","propsIndex","propsLength","call","paths","hasIn","func","flatten","nativeCeil","end","step","toFinite","accumulator","initAccum","idCounter","id","keys"],"sourceRoot":""}