@next-bricks/ai-portal 0.67.0 → 0.68.0

package/dist/chunks/{4228.ea602510.js.map → 4228.692fa030.js.map}

@@ -1 +1 @@
-{"version":3,"file":"chunks/4228.ea602510.js","mappings":"uLAqBA,QAVA,SAAiBA,EAAYC,GAC3B,IAAIC,GAAS,EACTC,GAAS,OAAYH,GAAcI,MAAMJ,EAAWK,QAAU,GAKlE,OAHA,OAASL,GAAY,SAASM,EAAOC,EAAKP,GACxCG,IAASD,GAASD,EAASK,EAAOC,EAAKP,EACzC,IACOG,CACT,C,wGC+BA,QAlCA,SAAiBK,EAAQC,EAAMH,EAAOI,GACpC,KAAK,EAAAC,EAAA,GAASH,GACZ,OAAOA,EAST,IALA,IAAIN,GAAS,EACTG,GAHJI,GAAO,OAASA,EAAMD,IAGJH,OACdO,EAAYP,EAAS,EACrBQ,EAASL,EAEI,MAAVK,KAAoBX,EAAQG,GAAQ,CACzC,IAAIE,GAAM,OAAME,EAAKP,IACjBY,EAAWR,EAEf,GAAY,cAARC,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOC,EAGT,GAAIN,GAASU,EAAW,CACtB,IAAIG,EAAWF,EAAON,QAELS,KADjBF,EAAWJ,EAAaA,EAAWK,EAAUR,EAAKM,QAAUG,KAE1DF,GAAW,EAAAH,EAAA,GAASI,GAChBA,GACC,OAAQN,EAAKP,EAAQ,IAAM,GAAK,CAAC,EAE1C,EACA,OAAYW,EAAQN,EAAKO,GACzBD,EAASA,EAAON,EAClB,CACA,OAAOC,CACT,ECnBA,EAhBA,SAAoBA,EAAQS,EAAOC,GAKjC,IAJA,IAAIhB,GAAS,EACTG,EAASY,EAAMZ,OACfF,EAAS,CAAC,IAELD,EAAQG,GAAQ,CACvB,IAAII,EAAOQ,EAAMf,GACbI,GAAQ,OAAQE,EAAQC,GAExBS,EAAUZ,EAAOG,IACnB,EAAQN,GAAQ,OAASM,EAAMD,GAASF,EAE5C,CACA,OAAOH,CACT,C,mCCRA,QALA,SAAcgB,GACZ,IAAId,EAAkB,MAATc,EAAgB,EAAIA,EAAMd,OACvC,OAAOA,EAASc,EAAMd,EAAS,QAAKW,CACtC,C,uECYA,QALA,SAAkBV,GAChB,MAAuB,iBAATA,KACV,OAAQA,KAAU,OAAaA,IArBrB,oBAqB+B,OAAWA,EAC1D,C,mCC1BA,IAAIc,EAAe,KCEnB,IAAIC,EAAc,OAelB,QANA,SAAkBC,GAChB,OAAOA,EACHA,EAAOC,MAAM,EDHnB,SAAyBD,GAGvB,IAFA,IAAIpB,EAAQoB,EAAOjB,OAEZH,KAAWkB,EAAaI,KAAKF,EAAOG,OAAOvB,MAClD,OAAOA,CACT,CCFsB,CAAgBoB,GAAU,GAAGI,QAAQL,EAAa,IAClEC,CACN,E,0BCRIK,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAeC,SCdnB,IAAIC,EAAW,IAsCf,QAZA,SAAkB1B,GAChB,OAAKA,GAGLA,EDSF,SAAkBA,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,IAAI,EAAA2B,EAAA,GAAS3B,GACX,OA1CM,IA4CR,IAAI,EAAAK,EAAA,GAASL,GAAQ,CACnB,IAAI4B,EAAgC,mBAAjB5B,EAAM6B,QAAwB7B,EAAM6B,UAAY7B,EACnEA,GAAQ,EAAAK,EAAA,GAASuB,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAAT5B,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQ,EAASA,GACjB,IAAI8B,EAAWR,EAAWJ,KAAKlB,GAC/B,OAAQ8B,GAAYP,EAAUL,KAAKlB,GAC/BwB,EAAaxB,EAAMiB,MAAM,GAAIa,EAAW,EAAI,GAC3CT,EAAWH,KAAKlB,GAvDb,KAuD6BA,CACvC,CC5BU,CAASA,MACH0B,GAAY1B,KAAU,IA9BpB,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,C,kDCJA,QAPA,SAAmBA,GACjB,IAAIH,GAAS,OAASG,GAClB+B,EAAYlC,EAAS,EAEzB,OAAOA,GAAWA,EAAUkC,EAAYlC,EAASkC,EAAYlC,EAAU,CACzE,C,+DC9BImC,EAAY,EAwBhB,QALA,SAAkBC,GAChB,IAAIC,IAAOF,EACX,OAAO,OAASC,GAAUC,CAC5B,E,qCCxBIC,EAAaC,KAAKC,KAClBC,EAAYF,KAAKG,I,yBC2CrB,QCjCS,SAASC,EAAOC,EAAKC,GAa1B,OAZIA,GAAuB,iBAARA,IAAoB,OAAeF,EAAOC,EAAKC,KAChED,EAAMC,OAAOhC,GAGf8B,GAAQ,EAAAG,EAAA,GAASH,QACL9B,IAAR+B,GACFA,EAAMD,EACNA,EAAQ,GAERC,GAAM,EAAAE,EAAA,GAASF,GFPrB,SAAmBD,EAAOC,EAAKC,EAAME,GAKnC,IAJA,IAAIhD,GAAS,EACTG,EAASuC,EAAUH,GAAYM,EAAMD,IAAUE,GAAQ,IAAK,GAC5D7C,EAASC,MAAMC,GAEZA,KACLF,EAAO+C,EAAY7C,IAAWH,GAAS4C,EACvCA,GAASE,EAEX,OAAO7C,CACT,CEAW,CAAU2C,EAAOC,EADxBC,OAAgBhC,IAATgC,EAAsBF,EAAQC,EAAM,GAAK,GAAK,EAAAE,EAAA,GAASD,QDmBtD,ECjBV,E,eCnBF,MAAMG,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,IAAW,GA4CnC,SAASC,EAAWC,EAAGC,EAASC,EAASjB,EAAOkB,GAC9C,IAAIC,EAAUD,EAAsB,QAAK7D,EAwBzC,OAtBA,IAAU0D,EAAEK,QAAQpB,EAAMY,IAAI,SAAUS,GACtC,IAAIC,EAASP,EAAEM,KAAKA,GAChBE,EAASR,EAAES,KAAKH,EAAKT,GAErBM,GACFC,EAAQb,KAAK,CAAEM,EAAGS,EAAKT,EAAGa,EAAGJ,EAAKI,IAGpCF,EAAOG,KAAOJ,EACdK,EAAaX,EAASC,EAASM,EACjC,IAEA,IAAUR,EAAEa,SAAS5B,EAAMY,IAAI,SAAUS,GACvC,IAAIC,EAASP,EAAEM,KAAKA,GAChBI,EAAIJ,EAAKI,EACTI,EAASd,EAAES,KAAKC,GACpBI,EAAW,IAAKP,EAChBK,EAAaX,EAASC,EAASY,EACjC,IAEAd,EAAED,WAAWd,EAAMY,GAEZO,CACT,CAkCA,SAASQ,EAAaX,EAASC,EAASjB,GACjCA,EAAM0B,IAEC1B,EAAU,GAGpBgB,EAAQhB,EAAM0B,IAAM1B,EAAU,GAAIiB,GAASf,QAAQF,GAFnDgB,EAAQA,EAAQtE,OAAS,GAAGwD,QAAQF,GAFpCgB,EAAQ,GAAGd,QAAQF,EAMvB,CCxHA,SAAS8B,EAAIf,GACX,IAAIgB,EAA8B,WAAxBhB,EAAEiB,QAAQC,UDStB,SAAmBlB,EAAGmB,GACpB,GAAInB,EAAEoB,aAAe,EACnB,MAAO,GAET,IAAIC,EAkEN,SAAoBrB,EAAGmB,GACrB,IAAIG,EAAW,IAAI,IACfC,EAAQ,EACRC,EAAS,EAEb,IAAUxB,EAAEyB,SAAS,SAAU5B,GAC7ByB,EAASI,QAAQ7B,EAAG,CAAEA,EAAGA,EAAG8B,GAAI,EAAGhB,IAAK,GAC1C,IAIA,IAAUX,EAAE4B,SAAS,SAAUC,GAC7B,IAAIC,EAAaR,EAAShB,KAAKuB,EAAEhC,EAAGgC,EAAEnB,IAAM,EACxCH,EAASY,EAASU,GAClBE,EAAaD,EAAavB,EAC9Be,EAASU,QAAQH,EAAEhC,EAAGgC,EAAEnB,EAAGqB,GAC3BP,EAASxD,KAAKG,IAAIqD,EAASF,EAASb,KAAKoB,EAAEhC,GAAGc,KAAOJ,GACrDgB,EAAQvD,KAAKG,IAAIoD,EAAQD,EAASb,KAAKoB,EAAEnB,GAAO,IAAKH,EACvD,IAEA,IAAIN,EAAU,EAAQuB,EAASD,EAAQ,GAAGU,KAAI,WAC5C,OAAO,IAAIxD,CACb,IACIyB,EAAUqB,EAAQ,EAMtB,OAJA,IAAUD,EAASG,SAAS,SAAU5B,GACpCe,EAAaX,EAASC,EAASoB,EAASb,KAAKZ,GAC/C,IAEO,CAAEoB,MAAOK,EAAUrB,QAASA,EAASC,QAASA,EACvD,CAhGcgC,CAAWlC,EAAGmB,GAAYrB,GAClCM,EAUN,SAAqBJ,EAAGC,EAASC,GAM/B,IALA,IAIIjB,EAJAmB,EAAU,GACV+B,EAAUlC,EAAQA,EAAQtE,OAAS,GACnCyG,EAAQnC,EAAQ,GAGbD,EAAEoB,aAAa,CACpB,KAAQnC,EAAQmD,EAAMpD,WACpBe,EAAWC,EAAGC,EAASC,EAASjB,GAElC,KAAQA,EAAQkD,EAAQnD,WACtBe,EAAWC,EAAGC,EAASC,EAASjB,GAElC,GAAIe,EAAEoB,YACJ,IAAK,IAAIiB,EAAIpC,EAAQtE,OAAS,EAAG0G,EAAI,IAAKA,EAExC,GADApD,EAAQgB,EAAQoC,GAAGrD,UACR,CACToB,EAAUA,EAAQkC,OAAOvC,EAAWC,EAAGC,EAASC,EAASjB,GAAO,IAChE,KACF,CAGN,CAEA,OAAOmB,CACT,CAnCgBmC,CAAYlB,EAAMJ,MAAOI,EAAMpB,QAASoB,EAAMnB,SAG5D,OAAO,IACL,IAAME,GAAS,SAAUyB,GACvB,OAAO7B,EAAEa,SAASgB,EAAEhC,EAAGgC,EAAEnB,EAC3B,IAEJ,CCtB+C8B,CAAUxC,EASvD,SAAkBA,GAChB,OAAO,SAAU6B,GACf,OAAO7B,EAAEM,KAAKuB,GAAGtB,MACnB,CACF,CAb0DY,CAASnB,IAgBrE,SAAgBA,GACd,IAAIgB,EAAM,GACNyB,EAAQ,CAAC,EACTC,EAAU,CAAC,EAmBf,OADA,IAAU1C,EAAEyB,SAhBZ,SAASkB,EAAI9C,GACP+C,OAAOC,UAAUC,eAAeC,KAAKL,EAAS7C,KAGlD6C,EAAQ7C,IAAK,EACb4C,EAAM5C,IAAK,EACX,IAAUG,EAAEa,SAAShB,IAAI,SAAUgC,GAC7Be,OAAOC,UAAUC,eAAeC,KAAKN,EAAOZ,EAAEnB,GAChDM,EAAIzB,KAAKsC,GAETc,EAAId,EAAEnB,EAEV,WACO+B,EAAM5C,GACf,IAGOmB,CACT,CAvC2EgC,CAAOhD,GAChF,IAAUgB,GAAK,SAAUa,GACvB,IAAIoB,EAAQjD,EAAEM,KAAKuB,GACnB7B,EAAEkD,WAAWrB,GACboB,EAAME,YAActB,EAAEuB,KACtBH,EAAMI,UAAW,EACjBrD,EAAEgC,QAAQH,EAAEnB,EAAGmB,EAAEhC,EAAGoD,EAAO,EAAW,OACxC,GAOF,C,8DCIA,SCbkBK,EDSE,SAASxH,EAAQS,GACnC,OAAiB,MAAVT,EAAiB,CAAC,EET3B,SAAkBA,EAAQS,GACxB,OAAO,OAAWT,EAAQS,GAAO,SAASX,EAAOG,GAC/C,OAAO,EAAAwH,EAAA,GAAMzH,EAAQC,EACvB,GACF,CFK+B,CAASD,EAAQS,EAChD,GCVS,QAAY,OAAS+G,OAAMhH,EAAWkH,EAAA,GAAUF,EAAO,KADhE,IAAkBA,E,sBEElB,QAJA,SAAgB1H,EAAO4B,GACrB,OAAO5B,EAAQ4B,CACjB,E,eCiBA,QANA,SAAaf,GACX,OAAQA,GAASA,EAAMd,QACnB,OAAac,EAAOgH,EAAA,EAAU,QAC9BnH,CACN,E,gDCgBA,QAVA,SAAmBR,EAAQP,GACzB,IAAIE,EAAS,CAAC,EAMd,OALAF,GAAW,OAAaA,EAAU,IAElC,OAAWO,GAAQ,SAASF,EAAOC,EAAKC,IACtC,OAAgBL,EAAQI,EAAKN,EAASK,EAAOC,EAAKC,GACpD,IACOL,CACT,E,gDClBA,QAJU,WACR,OAAO,IAAKiI,KAAKC,KACnB,ECGA,SAASC,EAAa5D,EAAG6D,EAAMC,EAAOV,GACpC,IAAIvD,EACJ,GACEA,EAAI,EAAWuD,SACRpD,EAAE+D,QAAQlE,IAInB,OAFAiE,EAAME,MAAQH,EACd7D,EAAE0B,QAAQ7B,EAAGiE,GACNjE,CACT,CAsBA,SAASoE,EAAmBjE,GAC1B,IAAIkE,EAAa,IAAI,IAAM,CAAEC,WAAYnE,EAAEoE,iBAAkBC,SAASrE,EAAEiB,SASxE,OARA,IAAUjB,EAAEyB,SAAS,SAAU5B,GACxBG,EAAEsE,SAASzE,GAAGlE,QACjBuI,EAAWxC,QAAQ7B,EAAGG,EAAES,KAAKZ,GAEjC,IACA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7BqC,EAAWlC,QAAQH,EAAG7B,EAAEM,KAAKuB,GAC/B,IACOqC,CACT,CA4BA,SAASK,EAAcC,EAAMC,GAC3B,IAcIC,EAAIC,EAdJC,EAAIJ,EAAKI,EACTC,EAAIL,EAAKK,EAITC,EAAKL,EAAMG,EAAIA,EACfG,EAAKN,EAAMI,EAAIA,EACfnE,EAAI8D,EAAKQ,MAAQ,EACjBC,EAAIT,EAAKU,OAAS,EAEtB,IAAKJ,IAAOC,EACV,MAAM,IAAII,MAAM,6DAoBlB,OAhBInH,KAAKoH,IAAIL,GAAMrE,EAAI1C,KAAKoH,IAAIN,GAAMG,GAEhCF,EAAK,IACPE,GAAKA,GAEPP,EAAMO,EAAIH,EAAMC,EAChBJ,EAAKM,IAGDH,EAAK,IACPpE,GAAKA,GAEPgE,EAAKhE,EACLiE,EAAMjE,EAAIqE,EAAMD,GAGX,CAAEF,EAAGA,EAAIF,EAAIG,EAAGA,EAAIF,EAC7B,CAMA,SAASU,EAAiBrF,GACxB,IAAIsF,EAAW,IAAM,EAAQ,EAAQtF,GAAK,IAAI,WAC5C,MAAO,EACT,IAQA,OAPA,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GACd0F,EAAO9E,EAAK8E,KACX,IAAcA,KACjBD,EAASC,GAAM9E,EAAK+E,OAAS3F,EAEjC,IACOyF,CACT,CAkDA,SAASG,EAAczF,EAAGnC,EAAQ0H,EAAMC,GACtC,IAAI/E,EAAO,CACTuE,MAAO,EACPE,OAAQ,GAMV,OAJIQ,UAAU/J,QAAU,IACtB8E,EAAK8E,KAAOA,EACZ9E,EAAK+E,MAAQA,GAER5B,EAAa5D,EAAG,SAAUS,EAAM5C,EACzC,CAEA,SAAS,EAAQmC,GACf,OAAO,EACL,IAAMA,EAAEyB,SAAS,SAAU5B,GACzB,IAAI0F,EAAOvF,EAAES,KAAKZ,GAAG0F,KACrB,IAAK,IAAcA,GACjB,OAAOA,CAEX,IAEJ,CAuBA,SAAS,EAAKnC,EAAMuC,GAClB,IAAIvH,EAAQ,IACZ,IACE,OAAOuH,GACT,CAAE,QACAC,QAAQC,IAAIzC,EAAO,WAAa,IAAUhF,GAAS,KACrD,CACF,CAEA,SAAS0H,EAAO1C,EAAMuC,GACpB,OAAOA,GACT,CC/NA,SAAS,EAAc3F,EAAG+F,EAAMlI,EAAQmI,EAAIC,EAAQV,GAClD,IAAItC,EAAQ,CAAE+B,MAAO,EAAGE,OAAQ,EAAGK,KAAMA,EAAMW,WAAYH,GACvDI,EAAOF,EAAOF,GAAMR,EAAO,GAC3BjG,EAAO,EAAkBU,EAAG,SAAUiD,EAAOpF,GACjDoI,EAAOF,GAAMR,GAAQjG,EACrBU,EAAEoG,UAAU9G,EAAM0G,GACdG,GACFnG,EAAEgC,QAAQmE,EAAM7G,EAAM,CAAEiB,OAAQ,GAEpC,CCZA,SAAS8F,GAAgBrG,GACvB,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7ByG,GAAmBtG,EAAES,KAAKZ,GAC5B,IACA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7ByE,GAAmBtG,EAAEM,KAAKuB,GAC5B,GACF,CAEA,SAASyE,GAAmBxC,GAC1B,IAAIpD,EAAIoD,EAAMkB,MACdlB,EAAMkB,MAAQlB,EAAMoB,OACpBpB,EAAMoB,OAASxE,CACjB,CAgBA,SAAS6F,GAAYzC,GACnBA,EAAMe,GAAKf,EAAMe,CACnB,CAgBA,SAAS2B,GAAU1C,GACjB,IAAIc,EAAId,EAAMc,EACdd,EAAMc,EAAId,EAAMe,EAChBf,EAAMe,EAAID,CACZ,C,gBCzCA,SANA,SAAenI,EAAOlB,GACpB,OAAQkB,GAASA,EAAMd,QACnB,OAAac,GAAO,OAAalB,EAAU,GAAI,WAC/Ce,CACN,ECNA,SAASmK,GAAYzG,GACnB,IAAI0C,EAAU,CAAC,EA2Bf,IAAU1C,EAAEmC,WAzBZ,SAASQ,EAAI9C,GACX,IAAIoD,EAAQjD,EAAES,KAAKZ,GACnB,GAAI+C,OAAOC,UAAUC,eAAeC,KAAKL,EAAS7C,GAChD,OAAOoD,EAAMsC,KAEf7C,EAAQ7C,IAAK,EAEb,IAAI0F,EAAO,IACT,IAAMvF,EAAEa,SAAShB,IAAI,SAAUgC,GAC7B,OAAOc,EAAId,EAAEnB,GAAKV,EAAEM,KAAKuB,GAAG6E,MAC9B,KAYF,OAREnB,IAASoB,OAAOC,mBAAhBrB,MACAA,IAIAA,EAAO,GAGDtC,EAAMsC,KAAOA,CACvB,GAGF,CAMA,SAASsB,GAAM7G,EAAG6B,GAChB,OAAO7B,EAAES,KAAKoB,EAAEnB,GAAG6E,KAAOvF,EAAES,KAAKoB,EAAEhC,GAAG0F,KAAOvF,EAAEM,KAAKuB,GAAG6E,MACzD,CC/BA,SAASI,GAAa9G,GACpB,IAOIM,EAAMyG,EAPNC,EAAI,IAAI,IAAM,CAAEC,UAAU,IAG1B7I,EAAQ4B,EAAEyB,QAAQ,GAClByF,EAAOlH,EAAEoB,YAIb,IAHA4F,EAAEtF,QAAQtD,EAAO,CAAC,GAGX+I,GAAUH,EAAGhH,GAAKkH,GACvB5G,EAAO8G,GAAiBJ,EAAGhH,GAC3B+G,EAAQC,EAAEjD,QAAQzD,EAAKT,GAAKgH,GAAM7G,EAAGM,IAASuG,GAAM7G,EAAGM,GACvD+G,GAAWL,EAAGhH,EAAG+G,GAGnB,OAAOC,CACT,CAMA,SAASG,GAAUH,EAAGhH,GAcpB,OADA,IAAUgH,EAAEvF,SAZZ,SAASkB,EAAI9C,GACX,IAAUG,EAAEsH,UAAUzH,IAAI,SAAUgC,GAClC,IAAI0F,EAAQ1F,EAAEhC,EACZa,EAAIb,IAAM0H,EAAQ1F,EAAEnB,EAAI6G,EACrBP,EAAEjD,QAAQrD,IAAOmG,GAAM7G,EAAG6B,KAC7BmF,EAAEtF,QAAQhB,EAAG,CAAC,GACdsG,EAAEhF,QAAQnC,EAAGa,EAAG,CAAC,GACjBiC,EAAIjC,GAER,GACF,IAGOsG,EAAE5F,WACX,CAMA,SAASgG,GAAiBJ,EAAGhH,GAC3B,OAAO,GAAQA,EAAE4B,SAAS,SAAUC,GAClC,GAAImF,EAAEjD,QAAQlC,EAAEhC,KAAOmH,EAAEjD,QAAQlC,EAAEnB,GACjC,OAAOmG,GAAM7G,EAAG6B,EAEpB,GACF,CAEA,SAASwF,GAAWL,EAAGhH,EAAG+G,GACxB,IAAUC,EAAEvF,SAAS,SAAU5B,GAC7BG,EAAES,KAAKZ,GAAG0F,MAAQwB,CACpB,GACF,C,4BCjF0B,IAAW,GCDX,IAAW,G,qCCKrB,E,SAAA,GAAa,UCGVS,OAAO,uFCX1B,IAAI,GAAgB,kBAQhBC,GAAW,IAAM,GAAgB,IACjCC,GAAU,kDACVC,GAAS,2BAETC,GAAc,KAAO,GAAgB,IACrCC,GAAa,kCACbC,GAAa,qCAIbC,GAPa,MAAQL,GAAU,IAAMC,GAO1BK,KACXC,GAAW,oBAEXC,GAAQD,GAAWF,GADP,gBAAwB,CAACH,GAAaC,GAAYC,IAAYnI,KAAK,KAAO,IAAMsI,GAAWF,GAAW,KAElHI,GAAW,MAAQ,CAACP,GAAcF,GAAU,IAAKA,GAASG,GAAYC,GAAYL,IAAU9H,KAAK,KAAO,IAG5F6H,OAAOG,GAAS,MAAQA,GAAS,KAAOQ,GAAWD,GAAO,KCS/C,IAAI/C,M,gBCvB/B,SAASxC,GAAI3C,EAAGoI,EAAI5C,GACb,KAAU4C,KACbA,EAAK,CAACA,IAGR,IAAIC,GAAcrI,EAAEsI,aAAetI,EAAEuI,WAAavI,EAAEwI,WAAWC,KAAKzI,GAEhE0I,EAAM,GACNhG,EAAU,CAAC,EAQf,OAPA,IAAO0F,GAAI,SAAUvI,GACnB,IAAKG,EAAE+D,QAAQlE,GACb,MAAM,IAAIsF,MAAM,6BAA+BtF,GAGjD8I,GAAM3I,EAAGH,EAAa,SAAV2F,EAAkB9C,EAAS2F,EAAYK,EACrD,IACOA,CACT,CAEA,SAASC,GAAM3I,EAAGH,EAAG+I,EAAWlG,EAAS2F,EAAYK,GAC9C9F,OAAOC,UAAUC,eAAeC,KAAKL,EAAS7C,KACjD6C,EAAQ7C,IAAK,EAER+I,GACHF,EAAInJ,KAAKM,GAEX,IAAOwI,EAAWxI,IAAI,SAAUa,GAC9BiI,GAAM3I,EAAGU,EAAGkI,EAAWlG,EAAS2F,EAAYK,EAC9C,IACIE,GACFF,EAAInJ,KAAKM,GAGf,CCIA,SAASgJ,GAAe7I,GACtBA,EbZF,SAAkBA,GAChB,IAAIkE,GAAa,IAAI,KAAQG,SAASrE,EAAEiB,SAYxC,OAXA,IAAUjB,EAAEyB,SAAS,SAAU5B,GAC7BqE,EAAWxC,QAAQ7B,EAAGG,EAAES,KAAKZ,GAC/B,IACA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7B,IAAIiH,EAAc5E,EAAW5D,KAAKuB,EAAEhC,EAAGgC,EAAEnB,IAAM,CAAEH,OAAQ,EAAGmG,OAAQ,GAChEzD,EAAQjD,EAAEM,KAAKuB,GACnBqC,EAAWlC,QAAQH,EAAEhC,EAAGgC,EAAEnB,EAAG,CAC3BH,OAAQuI,EAAYvI,OAAS0C,EAAM1C,OACnCmG,OAAQ1I,KAAKG,IAAI2K,EAAYpC,OAAQzD,EAAMyD,SAE/C,IACOxC,CACT,CaFM6E,CAAS/I,GACbyG,GAAYzG,GACZ,IAII6B,EAJAmF,EAAIF,GAAa9G,GAKrB,IAJAgJ,GAAiBhC,GACjBiC,GAAcjC,EAAGhH,GAGT6B,EAAIqH,GAAUlC,IAEpBmC,GAAcnC,EAAGhH,EAAG6B,EADhBuH,GAAUpC,EAAGhH,EAAG6B,GAGxB,CAKA,SAASoH,GAAcjC,EAAGhH,GACxB,IAAIoI,EC/DN,SAAmBpI,EAAGoI,GACpB,OAAOzF,GAAI3C,EAAGoI,EAAI,OACpB,CD6DW,CAAcpB,EAAGA,EAAEvF,SAC5B2G,EAAKA,EAAGvL,MAAM,EAAGuL,EAAGzM,OAAS,GAC7B,IAAUyM,GAAI,SAAUvI,IAK1B,SAAwBmH,EAAGhH,EAAGqJ,GAC5B,IACIC,EADWtC,EAAEvG,KAAK4I,GACAC,OACtBtC,EAAE1G,KAAK+I,EAAOC,GAAQC,SAAWC,GAAaxC,EAAGhH,EAAGqJ,EACtD,CARII,CAAezC,EAAGhH,EAAGH,EACvB,GACF,CAYA,SAAS2J,GAAaxC,EAAGhH,EAAGqJ,GAC1B,IACIC,EADWtC,EAAEvG,KAAK4I,GACAC,OAElBI,GAAc,EAEdC,EAAY3J,EAAEM,KAAK+I,EAAOC,GAE1BM,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAY3J,EAAEM,KAAKgJ,EAAQD,IAG7BO,EAAWD,EAAUpJ,OAErB,IAAUP,EAAEsH,UAAU+B,IAAQ,SAAUxH,GACtC,IA2HsBgI,EAAGhK,EA3HrBiK,EAAYjI,EAAEhC,IAAMwJ,EACtB7L,EAAQsM,EAAYjI,EAAEnB,EAAImB,EAAEhC,EAE9B,GAAIrC,IAAU8L,EAAQ,CACpB,IAAIS,EAAeD,IAAcJ,EAC/BM,EAAchK,EAAEM,KAAKuB,GAAGtB,OAG1B,GADAqJ,GAAYG,EAAeC,GAAeA,EAoHtBH,EAnHFR,EAmHKxJ,EAnHErC,EAAVwJ,EAoHPiD,QAAQJ,EAAGhK,GApHc,CAC/B,IAAIqK,EAAgBlD,EAAE1G,KAAK+I,EAAO7L,GAAO+L,SACzCK,GAAYG,GAAgBG,EAAgBA,CAC9C,CACF,CACF,IAEON,CACT,CAEA,SAASZ,GAAiBmB,EAAMC,GAC1B1E,UAAU/J,OAAS,IACrByO,EAAOD,EAAK1I,QAAQ,IAEtB4I,GAAgBF,EAAM,CAAC,EAAG,EAAGC,EAC/B,CAEA,SAASC,GAAgBF,EAAMzH,EAAS4H,EAASzK,EAAGyJ,GAClD,IAAIiB,EAAMD,EACNrH,EAAQkH,EAAK1J,KAAKZ,GAkBtB,OAhBA6C,EAAQ7C,IAAK,EACb,IAAUsK,EAAK3B,UAAU3I,IAAI,SAAUa,GAChCkC,OAAOC,UAAUC,eAAeC,KAAKL,EAAShC,KACjD4J,EAAUD,GAAgBF,EAAMzH,EAAS4H,EAAS5J,EAAGb,GAEzD,IAEAoD,EAAMsH,IAAMA,EACZtH,EAAMuH,IAAMF,IACRhB,EACFrG,EAAMqG,OAASA,SAGRrG,EAAMqG,OAGRgB,CACT,CAEA,SAASpB,GAAUiB,GACjB,OAAO,KAAOA,EAAKvI,SAAS,SAAUC,GACpC,OAAOsI,EAAK7J,KAAKuB,GAAG0H,SAAW,CACjC,GACF,CAEA,SAASH,GAAUpC,EAAGhH,EAAGM,GACvB,IAAIT,EAAIS,EAAKT,EACTa,EAAIJ,EAAKI,EAKRV,EAAEiK,QAAQpK,EAAGa,KAChBb,EAAIS,EAAKI,EACTA,EAAIJ,EAAKT,GAGX,IAAI4K,EAASzD,EAAEvG,KAAKZ,GAChB6K,EAAS1D,EAAEvG,KAAKC,GAChBiK,EAAYF,EACZG,GAAO,EAIPH,EAAOD,IAAME,EAAOF,MACtBG,EAAYD,EACZE,GAAO,GAGT,IAAIC,EAAa,KAAS7K,EAAE4B,SAAS,SAAUtB,GAC7C,OACEsK,IAASE,GAAa9D,EAAGA,EAAEvG,KAAKH,EAAKT,GAAI8K,IACzCC,IAASE,GAAa9D,EAAGA,EAAEvG,KAAKH,EAAKI,GAAIiK,EAE7C,IAEA,OAAO,GAAQE,GAAY,SAAUvK,GACnC,OAAOuG,GAAM7G,EAAGM,EAClB,GACF,CAEA,SAAS6I,GAAcnC,EAAGhH,EAAG6B,EAAGkJ,GAC9B,IAAIlL,EAAIgC,EAAEhC,EACNa,EAAImB,EAAEnB,EACVsG,EAAE9D,WAAWrD,EAAGa,GAChBsG,EAAEhF,QAAQ+I,EAAElL,EAAGkL,EAAErK,EAAG,CAAC,GACrBsI,GAAiBhC,GACjBiC,GAAcjC,EAAGhH,GAInB,SAAqBgH,EAAGhH,GACtB,IAAIoK,EAAO,KAAOpD,EAAEvF,SAAS,SAAU5B,GACrC,OAAQG,EAAES,KAAKZ,GAAGyJ,MACpB,IACIlB,EE1MN,SAAkBpI,EAAGoI,GACnB,OAAOzF,GAAI3C,EAAGoI,EAAI,MACpB,CFwMW,CAAapB,EAAGoD,GACzBhC,EAAKA,EAAGvL,MAAM,GACd,IAAUuL,GAAI,SAAUvI,GACtB,IAAIyJ,EAAStC,EAAEvG,KAAKZ,GAAGyJ,OACrBhJ,EAAON,EAAEM,KAAKT,EAAGyJ,GACjB0B,GAAU,EAEP1K,IACHA,EAAON,EAAEM,KAAKgJ,EAAQzJ,GACtBmL,GAAU,GAGZhL,EAAES,KAAKZ,GAAG0F,KAAOvF,EAAES,KAAK6I,GAAQ/D,MAAQyF,EAAU1K,EAAKoG,QAAUpG,EAAKoG,OACxE,GACF,CArBEuE,CAAYjE,EAAGhH,EACjB,CAiCA,SAAS8K,GAAaX,EAAMM,EAAQS,GAClC,OAAOA,EAAUX,KAAOE,EAAOD,KAAOC,EAAOD,KAAOU,EAAUV,GAChE,CGlNA,SAASjF,GAAKvF,GACZ,OAAQA,EAAEiB,QAAQkK,QAChB,IAAK,kBASL,SAaJ,SAA8BnL,GAC5B6I,GAAe7I,EACjB,CAdMoL,CAAqBpL,SAPvB,IAAK,cAcT,SAAyBA,GACvByG,GAAYzG,GACZ8G,GAAa9G,EACf,CAhBMqL,CAAgBrL,GAChB,MACF,IAAK,eACHsL,GAAkBtL,GAKxB,C,SH9BA6I,GAAeG,iBAAmBA,GAClCH,GAAeI,cAAgBA,GAC/BJ,GAAeW,aAAeA,GAC9BX,GAAeK,UAAYA,GAC3BL,GAAeO,UAAYA,GAC3BP,GAAeM,cAAgBA,GG4B/B,IAAImC,GAAoB7E,G,4BCdxB,SAAS,GAAIzG,GACX,IAAIoK,EAAO,EAAkBpK,EAAG,OAAQ,CAAC,EAAG,SACxCuL,EAqEN,SAAoBvL,GAClB,IAAIuL,EAAS,CAAC,EACd,SAAS5I,EAAI9C,EAAG2L,GACd,IAAIlH,EAAWtE,EAAEsE,SAASzE,GACtByE,GAAYA,EAAS3I,QACvB,IAAU2I,GAAU,SAAU+E,GAC5B1G,EAAI0G,EAAOmC,EAAQ,EACrB,IAEFD,EAAO1L,GAAK2L,CACd,CAIA,OAHA,IAAUxL,EAAEsE,YAAY,SAAUzE,GAChC8C,EAAI9C,EAAG,EACT,IACO0L,CACT,CApFeE,CAAWzL,GACpBkF,EAAS,EAAM,KAASqG,IAAW,EACnCG,EAAU,EAAIxG,EAAS,EAE3BlF,EAAEiB,QAAQ0K,YAAcvB,EAGxB,IAAUpK,EAAE4B,SAAS,SAAUC,GAC7B7B,EAAEM,KAAKuB,GAAG6E,QAAUgF,CACtB,IAGA,IAAInL,EA0EN,SAAoBP,GAClB,OAAO,KACLA,EAAE4B,SACF,SAAU8G,EAAK7G,GACb,OAAO6G,EAAM1I,EAAEM,KAAKuB,GAAGtB,MACzB,GACA,EAEJ,CAlFeqL,CAAW5L,GAAK,EAG7B,IAAUA,EAAEsE,YAAY,SAAU+E,GAChC,GAAIrJ,EAAGoK,EAAMsB,EAASnL,EAAQ2E,EAAQqG,EAAQlC,EAChD,IAIArJ,EAAEiB,QAAQ4K,eAAiBH,CAC7B,CAEA,SAAS,GAAI1L,EAAGoK,EAAMsB,EAASnL,EAAQ2E,EAAQqG,EAAQ1L,GACrD,IAAIyE,EAAWtE,EAAEsE,SAASzE,GAC1B,GAAKyE,EAAS3I,OAAd,CAOA,IAAImQ,EAAM,EAAmB9L,EAAG,OAC5B+L,EAAS,EAAmB/L,EAAG,OAC/BiD,EAAQjD,EAAES,KAAKZ,GAEnBG,EAAEoG,UAAU0F,EAAKjM,GACjBoD,EAAM+I,UAAYF,EAClB9L,EAAEoG,UAAU2F,EAAQlM,GACpBoD,EAAMgJ,aAAeF,EAErB,IAAUzH,GAAU,SAAU+E,GAC5B,GAAIrJ,EAAGoK,EAAMsB,EAASnL,EAAQ2E,EAAQqG,EAAQlC,GAE9C,IAAI6C,EAAYlM,EAAES,KAAK4I,GACnB8C,EAAWD,EAAUF,UAAYE,EAAUF,UAAY3C,EACvD+C,EAAcF,EAAUD,aAAeC,EAAUD,aAAe5C,EAChEgD,EAAaH,EAAUF,UAAYzL,EAAS,EAAIA,EAChDmG,EAASyF,IAAaC,EAAc,EAAIlH,EAASqG,EAAO1L,GAAK,EAEjEG,EAAEgC,QAAQ8J,EAAKK,EAAU,CACvB5L,OAAQ8L,EACR3F,OAAQA,EACR4F,aAAa,IAGftM,EAAEgC,QAAQoK,EAAaL,EAAQ,CAC7BxL,OAAQ8L,EACR3F,OAAQA,EACR4F,aAAa,GAEjB,IAEKtM,EAAEsJ,OAAOzJ,IACZG,EAAEgC,QAAQoI,EAAM0B,EAAK,CAAEvL,OAAQ,EAAGmG,OAAQxB,EAASqG,EAAO1L,IAlC5D,MAJMA,IAAMuK,GACRpK,EAAEgC,QAAQoI,EAAMvK,EAAG,CAAEU,OAAQ,EAAGmG,OAAQgF,GAuC9C,C,gBCrEA,SAJA,SAAmB9P,GACjB,OAAO,QAAUA,EAAO2Q,EAC1B,E,gBCJA,MCCA,GAJA,SAAmBC,EAAOC,GACxB,ODXF,SAAuBD,EAAOC,EAAQC,GAMpC,IALA,IAAIlR,GAAS,EACTG,EAAS6Q,EAAM7Q,OACfgR,EAAaF,EAAO9Q,OACpBF,EAAS,CAAC,IAELD,EAAQG,GAAQ,CACvB,IAAIC,EAAQJ,EAAQmR,EAAaF,EAAOjR,QAASc,EACjDoQ,EAAWjR,EAAQ+Q,EAAMhR,GAAQI,EACnC,CACA,OAAOH,CACT,CCAS,CAAc+Q,GAAS,GAAIC,GAAU,GAAI,KAClD,E,gFCmBA,SA9BA,SAA0B7Q,EAAO4B,GAC/B,GAAI5B,IAAU4B,EAAO,CACnB,IAAIoP,OAAyBtQ,IAAVV,EACfiR,EAAsB,OAAVjR,EACZkR,EAAiBlR,GAAUA,EAC3BmR,GAAc,EAAAxP,GAAA,GAAS3B,GAEvBoR,OAAyB1Q,IAAVkB,EACfyP,EAAsB,OAAVzP,EACZ0P,EAAiB1P,GAAUA,EAC3B2P,GAAc,EAAA5P,GAAA,GAASC,GAE3B,IAAMyP,IAAcE,IAAgBJ,GAAenR,EAAQ4B,GACtDuP,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAevR,EAAQ4B,GACtD2P,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,ECUA,GA7BA,SAAqB5R,EAAY8R,EAAWC,GAExCD,EADEA,EAAUzR,QACA,QAASyR,GAAW,SAAS7R,GACvC,OAAI,EAAA+R,GAAA,GAAQ/R,GACH,SAASK,GACd,OAAO,QAAQA,EAA2B,IAApBL,EAASI,OAAeJ,EAAS,GAAKA,EAC9D,EAEKA,CACT,IAEY,CAACkI,EAAA,GAGf,IAAIjI,GAAS,EAUb,OATA4R,GAAY,QAASA,GAAW,QAAU,MCxB5C,SAAoB3Q,EAAO8Q,GACzB,IAAI5R,EAASc,EAAMd,OAGnB,IADAc,EAAM+Q,KAAKD,GACJ5R,KACLc,EAAMd,GAAUc,EAAMd,GAAQC,MAEhC,OAAOa,CACT,CDyBS,EAPM,QAAQnB,GAAY,SAASM,EAAOC,EAAKP,GAIpD,MAAO,CAAE,UAHM,QAAS8R,GAAW,SAAS7R,GAC1C,OAAOA,EAASK,EAClB,IAC+B,QAAWJ,EAAO,MAASI,EAC5D,KAE0B,SAASE,EAAQ0B,GACzC,OE5BJ,SAAyB1B,EAAQ0B,EAAO6P,GAOtC,IANA,IAAI7R,GAAS,EACTiS,EAAc3R,EAAO4R,SACrBC,EAAcnQ,EAAMkQ,SACpB/R,EAAS8R,EAAY9R,OACrBiS,EAAeP,EAAO1R,SAEjBH,EAAQG,GAAQ,CACvB,IAAIF,EAAS,GAAiBgS,EAAYjS,GAAQmS,EAAYnS,IAC9D,GAAIC,EACF,OAAID,GAASoS,EACJnS,EAGFA,GAAmB,QADd4R,EAAO7R,IACiB,EAAI,EAE5C,CAQA,OAAOM,EAAON,MAAQgC,EAAMhC,KAC9B,CFGW,CAAgBM,EAAQ0B,EAAO6P,EACxC,GACF,EGCA,IAba,E,SAAA,IAAS,SAAS/R,EAAY8R,GACzC,GAAkB,MAAd9R,EACF,MAAO,GAET,IAAIK,EAASyR,EAAUzR,OAMvB,OALIA,EAAS,IAAK,OAAeL,EAAY8R,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHzR,EAAS,IAAK,OAAeyR,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElB,GAAY9R,GAAY,QAAY8R,EAAW,GAAI,GAC5D,ICzBA,SAASS,GAAW7N,EAAGsF,GAErB,IADA,IAAIwI,EAAK,EACAzL,EAAI,EAAGA,EAAIiD,EAAS3J,SAAU0G,EACrCyL,GAAMC,GAAmB/N,EAAGsF,EAASjD,EAAI,GAAIiD,EAASjD,IAExD,OAAOyL,CACT,CAEA,SAASC,GAAmB/N,EAAGgO,EAAYC,GAuBzC,IAnBA,IAAIC,EAAW,GACbD,EACA,IAAMA,GAAY,SAAUpO,EAAGwC,GAC7B,OAAOA,CACT,KAEE8L,EAAe,IACjB,IAAMH,GAAY,SAAUnO,GAC1B,OAAO,GACL,IAAMG,EAAEa,SAAShB,IAAI,SAAUgC,GAC7B,MAAO,CAAEuM,IAAKF,EAASrM,EAAEnB,GAAIH,OAAQP,EAAEM,KAAKuB,GAAGtB,OACjD,IACA,MAEJ,KAIE8N,EAAa,EACVA,EAAaJ,EAAWtS,QAAQ0S,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIlE,EAAO,IAAM,IAAIzO,MAAM4S,IAAW,WACpC,OAAO,CACT,IAGIR,EAAK,EAqBT,OApBA,IAEEK,EAAaI,SAAQ,SAAUtP,GAC7B,IAAIzD,EAAQyD,EAAMmP,IAAMC,EACxBlE,EAAK3O,IAAUyD,EAAMsB,OAGrB,IAFA,IAAIiO,EAAY,EAEThT,EAAQ,GAETA,EAAQ,IACVgT,GAAarE,EAAK3O,EAAQ,IAI5B2O,EADA3O,EAASA,EAAQ,GAAM,IACRyD,EAAMsB,OAEvBuN,GAAM7O,EAAMsB,OAASiO,CACvB,KAGKV,CACT,CC5EA,SAASN,GAAKiB,EAASC,GACrB,IA0CuBC,EA1CnBC,E3BwNN,SAAmBtT,GACjB,IAAIG,EAAS,CAAEoT,IAAK,GAAIC,IAAK,IAQ7B,OAPA,IAAUxT,GAAY,SAAUM,G2B1NI,IAAUqD,I3B2NrCrD,E2B1NAgH,OAAOC,UAAUC,eAAeC,KAAK9D,EAAO,c3B2NjDxD,EAAOoT,IAAItP,KAAK3D,GAEhBH,EAAOqT,IAAIvP,KAAK3D,EAEpB,IACOH,CACT,C2BlOc,CAAegT,GAGvBM,EAAWH,EAAMC,IACnBG,EAAa,GAASJ,EAAME,KAAK,SAAU7P,GACzC,OAAQA,EAAMoD,CAChB,IACA+F,EAAK,GACL6G,EAAM,EACN1O,EAAS,EACT2O,EAAU,EAEZH,EAASvB,MA8BcmB,IA9BSD,EA+BzB,SAAUS,EAAQC,GACvB,OAAID,EAAOE,WAAaD,EAAOC,YACrB,EACCF,EAAOE,WAAaD,EAAOC,WAC7B,EAGDV,EAA6BS,EAAO/M,EAAI8M,EAAO9M,EAAxC8M,EAAO9M,EAAI+M,EAAO/M,CACnC,IArCA6M,EAAUI,GAAkBlH,EAAI4G,EAAYE,GAE5C,IAAUH,GAAU,SAAU9P,GAC5BiQ,GAAWjQ,EAAMmJ,GAAGzM,OACpByM,EAAG7I,KAAKN,EAAMmJ,IACd6G,GAAOhQ,EAAMoQ,WAAapQ,EAAMsB,OAChCA,GAAUtB,EAAMsB,OAChB2O,EAAUI,GAAkBlH,EAAI4G,EAAYE,EAC9C,IAEA,IAAIzT,EAAS,CAAE2M,GAAI,IAAUA,IAK7B,OAJI7H,IACF9E,EAAO4T,WAAaJ,EAAM1O,EAC1B9E,EAAO8E,OAASA,GAEX9E,CACT,CAEA,SAAS6T,GAAkBlH,EAAI4G,EAAYxT,GAEzC,IADA,IAAI+T,EACGP,EAAWrT,SAAW4T,EAAO,IAAOP,IAAa3M,GAAK7G,GAC3DwT,EAAWQ,MACXpH,EAAG7I,KAAKgQ,EAAKnH,IACb5M,IAEF,OAAOA,CACT,CCvCA,SAASiU,GAAazP,EAAGH,EAAG6P,EAAIhB,GAC9B,IAAIiB,EAAU3P,EAAEsE,SAASzE,GACrBY,EAAOT,EAAES,KAAKZ,GACd+P,EAAKnP,EAAOA,EAAKoP,gBAAavT,EAC9BwT,EAAKrP,EAAOA,EAAKsP,iBAAczT,EAC/B0T,EAAY,CAAC,EAEbJ,IACFD,EAAU,KAASA,GAAS,SAAUjP,GACpC,OAAOA,IAAMkP,GAAMlP,IAAMoP,CAC3B,KAGF,IAAIG,EChBN,SAAoBjQ,EAAG2P,GACrB,OAAO,IAAMA,GAAS,SAAU9P,GAC9B,IAAIqQ,EAAMlQ,EAAEK,QAAQR,GACpB,GAAKqQ,EAAIvU,OAEF,CACL,IAAIF,EAAS,KACXyU,GACA,SAAUxH,EAAK7G,GACb,IAAIvB,EAAON,EAAEM,KAAKuB,GAChBsO,EAAQnQ,EAAES,KAAKoB,EAAEhC,GACnB,MAAO,CACLoP,IAAKvG,EAAIuG,IAAM3O,EAAKC,OAAS4P,EAAM3K,MACnCjF,OAAQmI,EAAInI,OAASD,EAAKC,OAE9B,GACA,CAAE0O,IAAK,EAAG1O,OAAQ,IAGpB,MAAO,CACLV,EAAGA,EACHwP,WAAY5T,EAAOwT,IAAMxT,EAAO8E,OAChCA,OAAQ9E,EAAO8E,OAEnB,CApBE,MAAO,CAAEV,EAAGA,EAqBhB,GACF,CDVoBwP,CAAWrP,EAAG2P,GAChC,IAAUM,GAAa,SAAUhR,GAC/B,GAAIe,EAAEsE,SAASrF,EAAMY,GAAGlE,OAAQ,CAC9B,IAAIyU,EAAiBX,GAAazP,EAAGf,EAAMY,EAAG6P,EAAIhB,GAClDsB,EAAU/Q,EAAMY,GAAKuQ,EACjBxN,OAAOC,UAAUC,eAAeC,KAAKqN,EAAgB,gBA0CrCC,EAzCDpR,EAyCSzB,EAzCF4S,EA0CzB,IAAcC,EAAOhB,aAMxBgB,EAAOhB,WAAa7R,EAAM6R,WAC1BgB,EAAO9P,OAAS/C,EAAM+C,SANtB8P,EAAOhB,YACJgB,EAAOhB,WAAagB,EAAO9P,OAAS/C,EAAM6R,WAAa7R,EAAM+C,SAC7D8P,EAAO9P,OAAS/C,EAAM+C,QACzB8P,EAAO9P,QAAU/C,EAAM+C,QA5CvB,CAuCJ,IAA0B8P,EAAQ7S,CAtChC,IAEA,IAAIiR,EEFN,SAA0BA,EAASiB,GACjC,IAAIY,EAAgB,CAAC,EA+BrB,OA9BA,IAAU7B,GAAS,SAAUxP,EAAOoD,GAClC,IAAIkO,EAAOD,EAAcrR,EAAMY,GAAK,CAClC2Q,SAAU,EACV7O,GAAI,GACJhB,IAAK,GACLyH,GAAI,CAACnJ,EAAMY,GACXwC,EAAGA,GAEA,IAAcpD,EAAMoQ,cAEvBkB,EAAIlB,WAAapQ,EAAMoQ,WAEvBkB,EAAIhQ,OAAStB,EAAMsB,OAEvB,IAEA,IAAUmP,EAAG9N,SAAS,SAAUC,GAC9B,IAAIsN,EAASmB,EAAczO,EAAEhC,GACzBuP,EAASkB,EAAczO,EAAEnB,GACxB,IAAcyO,IAAY,IAAcC,KAC3CA,EAAOoB,WACPrB,EAAOxO,IAAIpB,KAAK+Q,EAAczO,EAAEnB,IAEpC,IAUF,SAA4B+P,GAC1B,IAAIhC,EAAU,GAEd,SAASiC,EAASC,GAChB,OAAO,SAAUnQ,GAwCrB,IAAsB6P,EAAQO,EACxB3B,EACA1O,EAzCIC,EAAOqQ,SAIT,IAAcrQ,EAAO6O,aACrB,IAAcsB,EAAOtB,aACrB7O,EAAO6O,YAAcsB,EAAOtB,cAiCNuB,EA/BDpQ,EAgCvByO,EAAM,EACN1O,EAAS,GAFO8P,EA/BDM,GAmCRpQ,SACT0O,GAAOoB,EAAOhB,WAAagB,EAAO9P,OAClCA,GAAU8P,EAAO9P,QAGfqQ,EAAOrQ,SACT0O,GAAO2B,EAAOvB,WAAauB,EAAOrQ,OAClCA,GAAUqQ,EAAOrQ,QAGnB8P,EAAOjI,GAAKwI,EAAOxI,GAAG9F,OAAO+N,EAAOjI,IACpCiI,EAAOhB,WAAaJ,EAAM1O,EAC1B8P,EAAO9P,OAASA,EAChB8P,EAAOhO,EAAIrE,KAAK8S,IAAIF,EAAOvO,EAAGgO,EAAOhO,GACrCuO,EAAOC,QAAS,EA/Cd,CACF,CAEA,SAASE,EAAUJ,GACjB,OAAO,SAAU7P,GACfA,EAAW,GAAEvB,KAAKoR,GACQ,KAApB7P,EAAO0P,UACXC,EAAUlR,KAAKuB,EAEnB,CACF,CAEA,KAAO2P,EAAU9U,QAAQ,CACvB,IAAIsD,EAAQwR,EAAUjB,MACtBf,EAAQlP,KAAKN,GACb,IAAUA,EAAU,GAAE+R,UAAWN,EAASzR,IAC1C,IAAUA,EAAM0B,IAAKoQ,EAAU9R,GACjC,CAEA,OAAO,IACL,KAASwP,GAAS,SAAUxP,GAC1B,OAAQA,EAAM4R,MAChB,KACA,SAAU5R,GACR,OAAO,EAAOA,EAAO,CAAC,KAAM,IAAK,aAAc,UACjD,GAEJ,CA7CSgS,CALS,KAASX,GAAe,SAAUrR,GAEhD,OAAQA,EAAMuR,QAChB,IAGF,CF/BgBU,CAAiBjB,EAAaP,IAuB9C,SAAyBjB,EAASuB,GAChC,IAAUvB,GAAS,SAAUxP,GAC3BA,EAAMmJ,GAAK,IACTnJ,EAAMmJ,GAAGnG,KAAI,SAAUpC,GACrB,OAAImQ,EAAUnQ,GACLmQ,EAAUnQ,GAAGuI,GAEfvI,CACT,IAEJ,GACF,CAjCEsR,CAAgB1C,EAASuB,GAEzB,IAAIvU,EAAS+R,GAAKiB,EAASC,GAE3B,GAAIkB,IACFnU,EAAO2M,GAAK,IAAU,CAACwH,EAAInU,EAAO2M,GAAI0H,IAClC9P,EAAEoR,aAAaxB,GAAIjU,QAAQ,CAC7B,IAAI0V,EAASrR,EAAES,KAAKT,EAAEoR,aAAaxB,GAAI,IACrC0B,EAAStR,EAAES,KAAKT,EAAEoR,aAAatB,GAAI,IAChClN,OAAOC,UAAUC,eAAeC,KAAKtH,EAAQ,gBAChDA,EAAO4T,WAAa,EACpB5T,EAAO8E,OAAS,GAElB9E,EAAO4T,YACJ5T,EAAO4T,WAAa5T,EAAO8E,OAAS8Q,EAAO7L,MAAQ8L,EAAO9L,QAAU/J,EAAO8E,OAAS,GACvF9E,EAAO8E,QAAU,CACnB,CAGF,OAAO9E,CACT,CGAA,SAAS8V,GAAiBvR,EAAGwR,EAAOC,GAClC,OAAO,IAAMD,GAAO,SAAUjM,GAC5B,OCnBJ,SAAyBvF,EAAGuF,EAAMkM,GAChC,IAAIrH,EAmCN,SAAwBpK,GAEtB,IADA,IAAIH,EACGG,EAAE+D,QAASlE,EAAI,EAAW,YACjC,OAAOA,CACT,CAvCa6R,CAAe1R,GACxBvE,EAAS,IAAI,IAAM,CAAEkW,UAAU,IAC5BtN,SAAS,CAAE+F,KAAMA,IACjBwH,qBAAoB,SAAU/R,GAC7B,OAAOG,EAAES,KAAKZ,EAChB,IA2BJ,OAzBA,IAAUG,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GAChByJ,EAAStJ,EAAEsJ,OAAOzJ,IAEhBY,EAAK8E,OAASA,GAAS9E,EAAKoR,SAAWtM,GAAQA,GAAQ9E,EAAKqR,WAC9DrW,EAAOiG,QAAQ7B,GACfpE,EAAO2K,UAAUvG,EAAGyJ,GAAUc,GAG9B,IAAUpK,EAAEyR,GAAc5R,IAAI,SAAUgC,GACtC,IAAIgI,EAAIhI,EAAEhC,IAAMA,EAAIgC,EAAEnB,EAAImB,EAAEhC,EAC1BS,EAAO7E,EAAO6E,KAAKuJ,EAAGhK,GACtBU,EAAU,IAAcD,GAAsB,EAAdA,EAAKC,OACvC9E,EAAOuG,QAAQ6H,EAAGhK,EAAG,CAAEU,OAAQP,EAAEM,KAAKuB,GAAGtB,OAASA,GACpD,IAEIqC,OAAOC,UAAUC,eAAeC,KAAKtC,EAAM,YAC7ChF,EAAOiG,QAAQ7B,EAAG,CAChBgQ,WAAYpP,EAAKoP,WAAWtK,GAC5BwK,YAAatP,EAAKsP,YAAYxK,KAItC,IAEO9J,CACT,CDfWsW,CAAgB/R,EAAGuF,EAAMkM,EAClC,GACF,CAEA,SAASO,GAAiBC,EAAavD,GACrC,IAAIgB,EAAK,IAAI,IACb,IAAUuC,GAAa,SAAUC,GAC/B,IAAI9H,EAAO8H,EAAGjR,QAAQmJ,KAClB+H,EAAS1C,GAAayC,EAAI9H,EAAMsF,EAAIhB,GACxC,IAAUyD,EAAO/J,IAAI,SAAUvI,EAAGwC,GAChC6P,EAAGzR,KAAKZ,GAAG2F,MAAQnD,CACrB,IE7DJ,SAAgCrC,EAAG0P,EAAItH,GACrC,IACEgK,EADEjM,EAAO,CAAC,EAGZ,IAAUiC,GAAI,SAAUvI,GAItB,IAHA,IACEyJ,EACA+I,EAFEhJ,EAAQrJ,EAAEsJ,OAAOzJ,GAGdwJ,GAAO,CASZ,IARAC,EAAStJ,EAAEsJ,OAAOD,KAEhBgJ,EAAYlM,EAAKmD,GACjBnD,EAAKmD,GAAUD,IAEfgJ,EAAYD,EACZA,EAAW/I,GAETgJ,GAAaA,IAAchJ,EAE7B,YADAqG,EAAG1N,QAAQqQ,EAAWhJ,GAGxBA,EAAQC,CACV,CACF,GAyBF,CFcIgJ,CAAuBJ,EAAIxC,EAAIyC,EAAO/J,GACxC,GACF,CAEA,SAASmK,GAAYvS,EAAGsF,GACtB,IAAUA,GAAU,SAAUkN,GAC5B,IAAUA,GAAO,SAAU3S,EAAGwC,GAC5BrC,EAAES,KAAKZ,GAAG2F,MAAQnD,CACpB,GACF,GACF,C,gBGzCA,SAJA,SAAgBvG,EAAQP,GACtB,OAAOO,IAAU,OAAWA,GAAQ,QAAaP,GACnD,E,4BCKA,SANA,SAAeO,EAAQP,GACrB,OAAiB,MAAVO,EACHA,GACA,QAAQA,GAAQ,QAAaP,GAAWkX,GAAA,EAC9C,EC+FA,SAASC,GAAYC,EAAW9S,EAAGa,GACjC,GAAIb,EAAIa,EAAG,CACT,IAAI6P,EAAM1Q,EACVA,EAAIa,EACJA,EAAI6P,CACN,CAEA,IAAIqC,EAAaD,EAAU9S,GACtB+S,IACHD,EAAU9S,GAAK+S,EAAa,CAAC,GAE/BA,EAAWlS,IAAK,CAClB,CAEA,SAASmS,GAAYF,EAAW9S,EAAGa,GACjC,GAAIb,EAAIa,EAAG,CACT,IAAI6P,EAAM1Q,EACVA,EAAIa,EACJA,EAAI6P,CACN,CACA,QAASoC,EAAU9S,IAAM+C,OAAOC,UAAUC,eAAeC,KAAK4P,EAAU9S,GAAIa,EAC9E,CA8LA,SAASoS,GAAU9S,GACjB,IAII+S,EAJAzN,EAAW,EAAsBtF,GACjC2S,EAAY,IAjTlB,SAA4B3S,EAAGsF,GAC7B,IAAIqN,EAAY,CAAC,EAoCjB,OADA,KAASrN,GAjCT,SAAoB0N,EAAWR,GAC7B,IAEES,EAAK,EAGLC,EAAU,EACVC,EAAkBH,EAAUrX,OAC5ByX,EAAW,IAAOZ,GAsBpB,OApBA,IAAUA,GAAO,SAAU3S,EAAGwC,GAC5B,IAAI3B,EAsEV,SAAmCV,EAAGH,GACpC,GAAIG,EAAES,KAAKZ,GAAGmE,MACZ,OAAO,KAAOhE,EAAEoR,aAAavR,IAAI,SAAUgK,GACzC,OAAO7J,EAAES,KAAKoJ,GAAG7F,KACnB,GAEJ,CA5EcqP,CAA0BrT,EAAGH,GACnCyT,EAAK5S,EAAIV,EAAES,KAAKC,GAAG8E,MAAQ2N,GAEzBzS,GAAKb,IAAMuT,KACb,IAAUZ,EAAM3V,MAAMqW,EAAS7Q,EAAI,IAAI,SAAUkR,GAC/C,IAAUvT,EAAEoR,aAAamC,IAAW,SAAU1J,GAC5C,IAAI2J,EAASxT,EAAES,KAAKoJ,GAClB4J,EAAOD,EAAOhO,QACXiO,EAAOR,GAAMK,EAAKG,IAAWD,EAAOxP,OAAShE,EAAES,KAAK8S,GAAUvP,OACjE0O,GAAYC,EAAW9I,EAAG0J,EAE9B,GACF,IAEAL,EAAU7Q,EAAI,EACd4Q,EAAKK,EAET,IAEOd,CACT,IAGOG,CACT,CA2Q0Be,CAAmB1T,EAAGsF,GAzQhD,SAA4BtF,EAAGsF,GAC7B,IAAIqN,EAAY,CAAC,EAEjB,SAASgB,EAAKC,EAAO1F,EAAU2F,EAAUC,EAAiBC,GACxD,IAAIlU,EACJ,IAAU,EAAQqO,EAAU2F,IAAW,SAAUxR,GAC/CxC,EAAI+T,EAAMvR,GACNrC,EAAES,KAAKZ,GAAGmE,OACZ,IAAUhE,EAAEoR,aAAavR,IAAI,SAAUgK,GACrC,IAAImK,EAAQhU,EAAES,KAAKoJ,GACfmK,EAAMhQ,QAAUgQ,EAAMxO,MAAQsO,GAAmBE,EAAMxO,MAAQuO,IACjErB,GAAYC,EAAW9I,EAAGhK,EAE9B,GAEJ,GACF,CAyBA,OADA,KAASyF,GAtBT,SAAoB2O,EAAOL,GACzB,IACEM,EADEC,GAAgB,EAElBjG,EAAW,EAgBb,OAdA,IAAU0F,GAAO,SAAU/T,EAAGuU,GAC5B,GAAwB,WAApBpU,EAAES,KAAKZ,GAAGmE,MAAoB,CAChC,IAAIoN,EAAepR,EAAEoR,aAAavR,GAC9BuR,EAAazV,SACfuY,EAAelU,EAAES,KAAK2Q,EAAa,IAAI5L,MACvCmO,EAAKC,EAAO1F,EAAUkG,EAAgBD,EAAcD,GAEpDhG,EAAWkG,EACXD,EAAeD,EAEnB,CACAP,EAAKC,EAAO1F,EAAU0F,EAAMjY,OAAQuY,EAAcD,EAAMtY,OAC1D,IAEOiY,CACT,IAGOjB,CACT,CA+N2D0B,CAAmBrU,EAAGsF,IAE3EgP,EAAM,CAAC,EAEX,IAAU,CAAC,IAAK,MAAM,SAAUC,GAC9BxB,EAA4B,MAATwB,EAAejP,EAAW,KAASA,GAAU0L,UAChE,IAAU,CAAC,IAAK,MAAM,SAAUwD,GAChB,MAAVA,IACFzB,EAAmB,IAAMA,GAAkB,SAAU0B,GACnD,OAAO,KAASA,GAAOzD,SACzB,KAGF,IAAI0D,GAAuB,MAATH,EAAevU,EAAEoR,aAAepR,EAAEuI,YAAYE,KAAKzI,GACjE2U,EApMV,SAA2B3U,EAAGsF,EAAUqN,EAAW+B,GACjD,IAAItK,EAAO,CAAC,EACVuK,EAAQ,CAAC,EACTvG,EAAM,CAAC,EAkCT,OA7BA,IAAU9I,GAAU,SAAUkN,GAC5B,IAAUA,GAAO,SAAU3S,EAAG2F,GAC5B4E,EAAKvK,GAAKA,EACV8U,EAAM9U,GAAKA,EACXuO,EAAIvO,GAAK2F,CACX,GACF,IAEA,IAAUF,GAAU,SAAUkN,GAC5B,IAAIoC,GAAW,EACf,IAAUpC,GAAO,SAAU3S,GACzB,IAAIgV,EAAKH,EAAW7U,GACpB,GAAIgV,EAAGlZ,OAAQ,CACbkZ,EAAK,GAASA,GAAI,SAAUnU,GAC1B,OAAO0N,EAAI1N,EACb,IAEA,IADA,IAAIoU,GAAMD,EAAGlZ,OAAS,GAAK,EAClB0G,EAAIrE,KAAK+W,MAAMD,GAAKE,EAAKhX,KAAKC,KAAK6W,GAAKzS,GAAK2S,IAAM3S,EAAG,CAC7D,IAAI3B,EAAImU,EAAGxS,GACPsS,EAAM9U,KAAOA,GAAK+U,EAAUxG,EAAI1N,KAAOmS,GAAYF,EAAW9S,EAAGa,KACnEiU,EAAMjU,GAAKb,EACX8U,EAAM9U,GAAKuK,EAAKvK,GAAKuK,EAAK1J,GAC1BkU,EAAUxG,EAAI1N,GAElB,CACF,CACF,GACF,IAEO,CAAE0J,KAAMA,EAAMuK,MAAOA,EAC9B,CA8JkBM,CAAkBjV,EAAG+S,EAAkBJ,EAAW+B,GAC1DQ,EA7JV,SAA8BlV,EAAGsF,EAAU8E,EAAMuK,EAAOQ,GAMtD,IAAID,EAAK,CAAC,EACRE,EAkDJ,SAAyBpV,EAAGsF,EAAU8E,EAAM+K,GAC1C,IAAIE,EAAa,IAAI,IACnBC,EAAatV,EAAEiB,QACfsU,EAgHJ,SAAa7J,EAAS8J,EAASL,GAC7B,OAAO,SAAUnV,EAAGH,EAAGa,GACrB,IAGIqG,EAHA0D,EAASzK,EAAES,KAAKZ,GAChB6K,EAAS1K,EAAES,KAAKC,GAChBuO,EAAM,EAIV,GADAA,GAAOxE,EAAOzF,MAAQ,EAClBpC,OAAOC,UAAUC,eAAeC,KAAK0H,EAAQ,YAC/C,OAAQA,EAAOgL,SAASC,eACtB,IAAK,IACH3O,GAAS0D,EAAOzF,MAAQ,EACxB,MACF,IAAK,IACH+B,EAAQ0D,EAAOzF,MAAQ,EAa7B,GATI+B,IACFkI,GAAOkG,EAAapO,GAASA,GAE/BA,EAAQ,EAERkI,IAAQxE,EAAOzG,MAAQwR,EAAU9J,GAAW,EAC5CuD,IAAQvE,EAAO1G,MAAQwR,EAAU9J,GAAW,EAE5CuD,GAAOvE,EAAO1F,MAAQ,EAClBpC,OAAOC,UAAUC,eAAeC,KAAK2H,EAAQ,YAC/C,OAAQA,EAAO+K,SAASC,eACtB,IAAK,IACH3O,EAAQ2D,EAAO1F,MAAQ,EACvB,MACF,IAAK,IACH+B,GAAS2D,EAAO1F,MAAQ,EAS9B,OALI+B,IACFkI,GAAOkG,EAAapO,GAASA,GAE/BA,EAAQ,EAEDkI,CACT,CACF,CA5JY0G,CAAIL,EAAWM,QAASN,EAAWO,QAASV,GAgBtD,OAdA,IAAU7P,GAAU,SAAUkN,GAC5B,IAAI3I,EACJ,IAAU2I,GAAO,SAAU3S,GACzB,IAAIiW,EAAQ1L,EAAKvK,GAEjB,GADAwV,EAAW3T,QAAQoU,GACfjM,EAAG,CACL,IAAIkM,EAAQ3L,EAAKP,GACfmM,EAAUX,EAAW/U,KAAKyV,EAAOD,GACnCT,EAAWrT,QAAQ+T,EAAOD,EAAO9X,KAAKG,IAAIoX,EAAMvV,EAAGH,EAAGgK,GAAImM,GAAW,GACvE,CACAnM,EAAIhK,CACN,GACF,IAEOwV,CACT,CAtEaY,CAAgBjW,EAAGsF,EAAU8E,EAAM+K,GAC5CjP,EAAaiP,EAAa,aAAe,cAE3C,SAASe,EAAQC,EAAWC,GAI1B,IAHA,IAAI3T,EAAQ2S,EAAO3T,QACf4U,EAAO5T,EAAM+M,MACb9M,EAAU,CAAC,EACR2T,GACD3T,EAAQ2T,GACVF,EAAUE,IAEV3T,EAAQ2T,IAAQ,EAChB5T,EAAMlD,KAAK8W,GACX5T,EAAQA,EAAMH,OAAO8T,EAAcC,KAGrCA,EAAO5T,EAAM+M,KAEjB,CA6BA,OARA0G,GAlBA,SAAeG,GACbnB,EAAGmB,GAAQjB,EAAO/U,QAAQgW,GAAMC,QAAO,SAAU5N,EAAK7G,GACpD,OAAO7D,KAAKG,IAAIuK,EAAKwM,EAAGrT,EAAEhC,GAAKuV,EAAO9U,KAAKuB,GAC7C,GAAG,EACL,GAceuT,EAAOhE,aAAa3I,KAAK2M,IACxCc,GAZA,SAAeG,GACb,IAAIvF,EAAMsE,EAAOvU,SAASwV,GAAMC,QAAO,SAAU5N,EAAK7G,GACpD,OAAO7D,KAAK8S,IAAIpI,EAAKwM,EAAGrT,EAAEnB,GAAK0U,EAAO9U,KAAKuB,GAC7C,GAAG8E,OAAOC,mBAENnG,EAAOT,EAAES,KAAK4V,GACdvF,IAAQnK,OAAOC,mBAAqBnG,EAAKyF,aAAeA,IAC1DgP,EAAGmB,GAAQrY,KAAKG,IAAI+W,EAAGmB,GAAOvF,GAElC,GAGesE,EAAO7M,WAAWE,KAAK2M,IAGtC,IAAUT,GAAO,SAAU9U,GACzBqV,EAAGrV,GAAKqV,EAAG9K,EAAKvK,GAClB,IAEOqV,CACT,CAsGeqB,CAAqBvW,EAAG+S,EAAkB4B,EAAMvK,KAAMuK,EAAMA,MAAiB,MAAVH,GAC9D,MAAVA,IACFU,EAAK,EAAYA,GAAI,SAAUtQ,GAC7B,OAAQA,CACV,KAEF0P,EAAIC,EAAOC,GAASU,CACtB,GACF,IAEA,IAAIsB,EArFN,SAAoCxW,EAAGsU,GACrC,OAAO,GAAQ,KAASA,IAAM,SAAUY,GACtC,IAAI/W,EAAMwI,OAAO8P,kBACb3F,EAAMnK,OAAOC,kBASjB,OAPA,GAAQsO,GAAI,SAAUtQ,EAAG/E,GACvB,IAAI6W,EAkIV,SAAe1W,EAAGH,GAChB,OAAOG,EAAES,KAAKZ,GAAGmF,KACnB,CApIsBA,CAAMhF,EAAGH,GAAK,EAE9B1B,EAAMH,KAAKG,IAAIyG,EAAI8R,EAAWvY,GAC9B2S,EAAM9S,KAAK8S,IAAIlM,EAAI8R,EAAW5F,EAChC,IAEO3S,EAAM2S,CACf,GACF,CAuEsB6F,CAA2B3W,EAAGsU,GAElD,OAhEF,SAA0BA,EAAKsC,GAC7B,IAAIC,EAAc,KAASD,GACzBE,EAAa,IAAMD,GACnBE,EAAa,EAAMF,GAErB,IAAU,CAAC,IAAK,MAAM,SAAUtC,GAC9B,IAAU,CAAC,IAAK,MAAM,SAAUC,GAC9B,IAEEzN,EAFEiQ,EAAYzC,EAAOC,EACrBU,EAAKZ,EAAI0C,GAEX,GAAI9B,IAAO0B,EAAX,CAEA,IAAIK,EAAS,KAAS/B,IACtBnO,EAAkB,MAAVyN,EAAgBsC,EAAa,IAAMG,GAAUF,EAAa,EAAME,MAGtE3C,EAAI0C,GAAa,EAAY9B,GAAI,SAAUtQ,GACzC,OAAOA,EAAImC,CACb,IARwB,CAU5B,GACF,GACF,CAyCEmQ,CAAiB5C,EAAKkC,GAvCxB,SAAiBlC,EAAKK,GACpB,OAAO,EAAYL,EAAI6C,IAAI,SAAUC,EAAQvX,GAC3C,GAAI8U,EACF,OAAOL,EAAIK,EAAMe,eAAe7V,GAEhC,IAAIqV,EAAK,GAAS,IAAMZ,EAAKzU,IAC7B,OAAQqV,EAAG,GAAKA,EAAG,IAAM,CAE7B,GACF,CA+BSmC,CAAQ/C,EAAKtU,EAAEiB,QAAQ0T,MAChC,CCrWA,SAAS2C,GAAOtX,EAAGuX,GACjB,IAAIC,EAAOD,GAAQA,EAAKE,YAAc,EAAY,EAClDD,EAAK,UAAU,KACb,IAAIE,EAAcF,EAAK,sBAAsB,IA+FjD,SAA0BG,GACxB,IAAI3X,EAAI,IAAI,IAAM,CAAEmE,YAAY,EAAMwN,UAAU,IAC5C1Q,EAAQ2W,GAAaD,EAAW1W,SAoBpC,OAlBAjB,EAAEqE,SACA,IAAQ,CAAC,EAAGwT,GAAeC,GAAkB7W,EAAO8W,IAAgB,EAAO9W,EAAO+W,MAGpF,IAAUL,EAAWlW,SAAS,SAAU5B,GACtC,IAAIY,EAAOmX,GAAaD,EAAWlX,KAAKZ,IACxCG,EAAE0B,QAAQ7B,EAAG,IAAWiY,GAAkBrX,EAAMwX,IAAeC,KAC/DlY,EAAEoG,UAAUvG,EAAG8X,EAAWrO,OAAOzJ,GACnC,IAEA,IAAU8X,EAAW/V,SAAS,SAAUC,GACtC,IAAIvB,EAAOsX,GAAaD,EAAWrX,KAAKuB,IACxC7B,EAAEgC,QACAH,EACA,IAAQ,CAAC,EAAGsW,GAAcL,GAAkBxX,EAAM8X,IAAe,EAAO9X,EAAM+X,KAElF,IAEOrY,CACT,CAtHuDsY,CAAiBtY,KACpEwX,EAAK,eAAe,IAKxB,SAAmBxX,EAAGwX,GACpBA,EAAK,8BAA8B,IAyHrC,SAAgCxX,GAC9B,IAAIiB,EAAQjB,EAAEiB,QACdA,EAAMsX,SAAW,EACjB,IAAUvY,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClBvB,EAAKoG,QAAU,EACqB,MAAhCpG,EAAKmV,SAASC,gBACM,OAAlBzU,EAAMuX,SAAsC,OAAlBvX,EAAMuX,QAClClY,EAAK0E,OAAS1E,EAAKmY,YAEnBnY,EAAK4E,QAAU5E,EAAKmY,YAG1B,GACF,CAvI2CC,CAAuB1Y,KAChEwX,EAAK,uBAAuB,IAiT9B,SAAyBxX,GACvB,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,GAAIA,EAAEhC,IAAMgC,EAAEnB,EAAG,CACf,IAAID,EAAOT,EAAES,KAAKoB,EAAEhC,GACfY,EAAKkY,YACRlY,EAAKkY,UAAY,IAEnBlY,EAAKkY,UAAUpZ,KAAK,CAAEsC,EAAGA,EAAGoB,MAAOjD,EAAEM,KAAKuB,KAC1C7B,EAAEkD,WAAWrB,EACf,CACF,GACF,CA5ToC+W,CAAgB5Y,KAClDwX,EAAK,eAAe,IAAM,EAAYxX,KACtCwX,EAAK,wBAAwB,IAAM,GAAiBxX,KACpDwX,EAAK,YAAY,IAAMjS,GAAK,EAAwBvF,MACpDwX,EAAK,8BAA8B,IA0IrC,SAAgCxX,GAC9B,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,GAAIvB,EAAK0E,OAAS1E,EAAK4E,OAAQ,CAC7B,IAAIrF,EAAIG,EAAES,KAAKoB,EAAEhC,GAEboD,EAAQ,CAAEsC,MADNvF,EAAES,KAAKoB,EAAEnB,GACM6E,KAAO1F,EAAE0F,MAAQ,EAAI1F,EAAE0F,KAAM1D,EAAGA,GACvD,EAAkB7B,EAAG,aAAciD,EAAO,MAC5C,CACF,GACF,CApJ2C4V,CAAuB7Y,KAChEwX,EAAK,wBAAwB,IrCqI/B,SAA0BxX,GAExB,IAAI8Y,EAAS,IACX,IAAM9Y,EAAEyB,SAAS,SAAU5B,GACzB,OAAOG,EAAES,KAAKZ,GAAG0F,IACnB,KAGEwT,EAAS,GACb,IAAU/Y,EAAEyB,SAAS,SAAU5B,GAC7B,IAAI0F,EAAOvF,EAAES,KAAKZ,GAAG0F,KAAOuT,EACvBC,EAAOxT,KACVwT,EAAOxT,GAAQ,IAEjBwT,EAAOxT,GAAMhG,KAAKM,EACpB,IAEA,IAAIkH,EAAQ,EACR8E,EAAiB7L,EAAEiB,QAAQ4K,eAC/B,IAAUkN,GAAQ,SAAU3Q,EAAI/F,GAC1B,IAAc+F,IAAO/F,EAAIwJ,GAAmB,IAC5C9E,EACOA,GACT,IAAUqB,GAAI,SAAUvI,GACtBG,EAAES,KAAKZ,GAAG0F,MAAQwB,CACpB,GAEJ,GACF,CqCjKqC,CAAsB/G,KACzDwX,EAAK,4BAA4B,IpB8FnC,SAAiBxX,GACf,IAAIsV,EAAatV,EAAEiB,QACnBjB,EAAED,WAAWuV,EAAW3J,oBACjB2J,EAAW3J,YAClB,IAAU3L,EAAE4B,SAAS,SAAUC,GAClB7B,EAAEM,KAAKuB,GACTyK,aACPtM,EAAEkD,WAAWrB,EAEjB,GACF,CoBxGyC,CAAqB7B,KAC5DwX,EAAK,sBAAsB,IrCqH7B,SAAwBxX,GACtB,IAAI8Q,EAAM,IACR,IAAM9Q,EAAEyB,SAAS,SAAU5B,GACzB,OAAOG,EAAES,KAAKZ,GAAG0F,IACnB,KAEF,IAAUvF,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GACd,IAAMY,EAAM,UACdA,EAAK8E,MAAQuL,EAEjB,GACF,CqCjImC,CAAoB9Q,KACrDwX,EAAK,wBAAwB,IAkJ/B,SAA0BxX,GACxB,IAAI8R,EAAU,EACd,IAAU9R,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GACdY,EAAKuL,YACPvL,EAAKoR,QAAU7R,EAAES,KAAKA,EAAKuL,WAAWzG,KACtC9E,EAAKqR,QAAU9R,EAAES,KAAKA,EAAKwL,cAAc1G,KAEzCuM,EAAU,EAAMA,EAASrR,EAAKqR,SAElC,IACA9R,EAAEiB,QAAQ6Q,QAAUA,CACtB,CA9JqCkH,CAAiBhZ,KACpDwX,EAAK,8BAA8B,IA+JrC,SAAgCxX,GAC9B,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GACC,eAAfY,EAAKuD,QACPhE,EAAEM,KAAKG,EAAKoB,GAAGoX,UAAYxY,EAAK8E,KAChCvF,EAAED,WAAWF,GAEjB,GACF,CAvK2CqZ,CAAuBlZ,KAChEwX,EAAK,qBAAqB,ICV5B,SAAaxX,GACXA,EAAEiB,QAAQkY,YAAc,GACxB,IAAUnZ,EAAE4B,SAAS,SAAUtB,IAQjC,SAAuBN,EAAG6B,GACxB,IAAIhC,EAAIgC,EAAEhC,EACNuZ,EAAQpZ,EAAES,KAAKZ,GAAG0F,KAClB7E,EAAImB,EAAEnB,EACN2Y,EAAQrZ,EAAES,KAAKC,GAAG6E,KAClBnC,EAAOvB,EAAEuB,KACTkW,EAAYtZ,EAAEM,KAAKuB,GACnBoX,EAAYK,EAAUL,UAE1B,GAAII,IAAUD,EAAQ,EAAtB,CAEApZ,EAAEkD,WAAWrB,GAcb,IACImC,EAAO3B,EADPyB,OAAQxH,EAEZ,IAAK+F,EAAI,IAAK+W,EAAOA,EAAQC,IAAShX,IAAK+W,EACzCE,EAAUC,OAAS,GAQnBvV,EAAQ,EAAkBhE,EAAG,OAP7B8D,EAAQ,CACNkB,MAAO,EACPE,OAAQ,EACRoU,UAAWA,EACXE,QAAS3X,EACT0D,KAAM6T,GAEoC,MACxCA,IAAUH,IACZnV,EAAMkB,MAAQsU,EAAUtU,MACxBlB,EAAMoB,OAASoU,EAAUpU,OACzBpB,EAAME,MAAQ,aACdF,EAAM2R,SAAW6D,EAAU7D,UAE7BzV,EAAEgC,QAAQnC,EAAGmE,EAAO,CAAEzD,OAAQ+Y,EAAU/Y,QAAU6C,GACxC,IAANf,GACFrC,EAAEiB,QAAQkY,YAAY5Z,KAAKyE,GAE7BnE,EAAImE,EAGNhE,EAAEgC,QAAQnC,EAAGa,EAAG,CAAEH,OAAQ+Y,EAAU/Y,QAAU6C,EAzCf,CA0CjC,CA1DIqW,CAAczZ,EAAGM,EACnB,GACF,CDKkC,CAAcN,KAC9CwX,EAAK,yBAAyB,IEjChC,SAA2BxX,GACzB,IAAI0Z,EAoEN,SAAmB1Z,GACjB,IAAIvE,EAAS,CAAC,EACV+O,EAAM,EASV,OAFA,IAAUxK,EAAEsE,YALZ,SAAS3B,EAAI9C,GACX,IAAI0K,EAAMC,EACV,IAAUxK,EAAEsE,SAASzE,GAAI8C,GACzBlH,EAAOoE,GAAK,CAAE0K,IAAKA,EAAKC,IAAKA,IAC/B,IAGO/O,CACT,CAhFsB,CAAUuE,GAE9B,IAAUA,EAAEiB,QAAQkY,aAAa,SAAUtZ,GAUzC,IATA,IAAIY,EAAOT,EAAES,KAAKZ,GACd2Z,EAAU/Y,EAAK+Y,QACfG,EAsCR,SAAkB3Z,EAAG0Z,EAAe7Z,EAAGa,GACrC,IAII4I,EACAsQ,EALAC,EAAQ,GACRC,EAAQ,GACRvP,EAAMvM,KAAK8S,IAAI4I,EAAc7Z,GAAG0K,IAAKmP,EAAchZ,GAAG6J,KACtDC,EAAMxM,KAAKG,IAAIub,EAAc7Z,GAAG2K,IAAKkP,EAAchZ,GAAG8J,KAK1DlB,EAASzJ,EACT,GACEyJ,EAAStJ,EAAEsJ,OAAOA,GAClBuQ,EAAMta,KAAK+J,SACJA,IAAWoQ,EAAcpQ,GAAQiB,IAAMA,GAAOC,EAAMkP,EAAcpQ,GAAQkB,MAKnF,IAJAoP,EAAMtQ,EAGNA,EAAS5I,GACD4I,EAAStJ,EAAEsJ,OAAOA,MAAasQ,GACrCE,EAAMva,KAAK+J,GAGb,MAAO,CAAEvN,KAAM8d,EAAMvX,OAAOwX,EAAM9I,WAAY4I,IAAKA,EACrD,CA7DmBG,CAAS/Z,EAAG0Z,EAAeF,EAAQ3Z,EAAG2Z,EAAQ9Y,GACzD3E,EAAO4d,EAAS5d,KAChB6d,EAAMD,EAASC,IACfI,EAAU,EACVC,EAAQle,EAAKie,GACbE,GAAY,EAETra,IAAM2Z,EAAQ9Y,GAAG,CAGtB,GAFAD,EAAOT,EAAES,KAAKZ,GAEVqa,EAAW,CACb,MAAQD,EAAQle,EAAKie,MAAcJ,GAAO5Z,EAAES,KAAKwZ,GAAOnI,QAAUrR,EAAK8E,MACrEyU,IAGEC,IAAUL,IACZM,GAAY,EAEhB,CAEA,IAAKA,EAAW,CACd,KACEF,EAAUje,EAAKJ,OAAS,GACxBqE,EAAES,KAAMwZ,EAAQle,EAAKie,EAAU,IAAKnI,SAAWpR,EAAK8E,MAEpDyU,IAEFC,EAAQle,EAAKie,EACf,CAEAha,EAAEoG,UAAUvG,EAAGoa,GACfpa,EAAIG,EAAEuI,WAAW1I,GAAG,EACtB,CACF,GACF,CFPsCsa,CAAkBna,KACtDwX,EAAK,yBAAyB,IpCjChC,SAA2BxX,GAkBzB,IAAUA,EAAEsE,YAjBZ,SAAS3B,EAAI9C,GACX,IAAIyE,EAAWtE,EAAEsE,SAASzE,GACtBY,EAAOT,EAAES,KAAKZ,GAKlB,GAJIyE,EAAS3I,QACX,IAAU2I,EAAU3B,GAGlBC,OAAOC,UAAUC,eAAeC,KAAKtC,EAAM,WAAY,CACzDA,EAAKoP,WAAa,GAClBpP,EAAKsP,YAAc,GACnB,IAAK,IAAIxK,EAAO9E,EAAKoR,QAASC,EAAUrR,EAAKqR,QAAU,EAAGvM,EAAOuM,IAAWvM,EAC1E,EAAcvF,EAAG,aAAc,MAAOH,EAAGY,EAAM8E,GAC/C,EAAcvF,EAAG,cAAe,MAAOH,EAAGY,EAAM8E,EAEpD,CACF,GAGF,CoCcsC6U,CAAkBpa,KACtDwX,EAAK,aAAa,INbpB,SAAexX,GACb,IAAI8R,EAAU,EAAa9R,GACzBqa,EAAkB9I,GAAiBvR,EAAG,EAAQ,EAAG8R,EAAU,GAAI,WAC/DwI,EAAgB/I,GAAiBvR,EAAG,EAAQ8R,EAAU,GAAI,GAAI,GAAI,YAEhExM,ESlBC,SAAmBtF,GACxB,IAAI0C,EAAU,CAAC,EACX6X,EAAc,KAASva,EAAEyB,SAAS,SAAU5B,GAC9C,OAAQG,EAAEsE,SAASzE,GAAGlE,MACxB,IACImW,EAAU,EACZ,IAAMyI,GAAa,SAAU1a,GAC3B,OAAOG,EAAES,KAAKZ,GAAG0F,IACnB,KAEEwT,EAAS,IAAM,EAAQjH,EAAU,IAAI,WACvC,MAAO,EACT,IAUI0I,EAAY,GAASD,GAAa,SAAU1a,GAC9C,OAAOG,EAAES,KAAKZ,GAAG0F,IACnB,IAGA,OAFA,IAAUiV,GAXV,SAAS7X,EAAI9C,GACX,IAAI,IAAM6C,EAAS7C,GAAnB,CACA6C,EAAQ7C,IAAK,EACb,IAAIY,EAAOT,EAAES,KAAKZ,GAClBkZ,EAAOtY,EAAK8E,MAAMhG,KAAKM,GACvB,IAAUG,EAAEuI,WAAW1I,GAAI8C,EAJE,CAK/B,IAOOoW,CACT,CTViB0B,CAAUza,GACzBuS,GAAYvS,EAAGsF,GAKf,IAHA,IACEoV,EADEC,EAAShU,OAAOC,kBAGXvE,EAAI,EAAGuY,EAAW,EAAGA,EAAW,IAAKvY,IAAKuY,EAAU,CAC3D5I,GAAiB3P,EAAI,EAAIgY,EAAkBC,EAAejY,EAAI,GAAK,GAGnE,IAAIyL,EAAKD,GAAW7N,EADpBsF,EAAW,EAAsBtF,IAE7B8N,EAAK6M,IACPC,EAAW,EACXF,EAAO,GAAYpV,GACnBqV,EAAS7M,EAEb,CAEAyE,GAAYvS,EAAG0a,EACjB,CMX0BlV,CAAMxF,KAC9BwX,EAAK,uBAAuB,IAgT9B,SAAyBxX,GACvB,IAAI+Y,EAAS,EAAsB/Y,GACnC,IAAU+Y,GAAQ,SAAUvG,GAC1B,IAAIqI,EAAa,EACjB,IAAUrI,GAAO,SAAU3S,EAAGwC,GAC5B,IAAI5B,EAAOT,EAAES,KAAKZ,GAClBY,EAAK+E,MAAQnD,EAAIwY,EACjB,IAAUpa,EAAKkY,WAAW,SAAUmC,GAClC,EACE9a,EACA,WACA,CACEgF,MAAO8V,EAAS7X,MAAM+B,MACtBE,OAAQ4V,EAAS7X,MAAMiC,OACvBK,KAAM9E,EAAK8E,KACXC,MAAOnD,KAAMwY,EACbhZ,EAAGiZ,EAASjZ,EACZoB,MAAO6X,EAAS7X,OAElB,MAEJ,WACOxC,EAAKkY,SACd,GACF,GACF,CAzUoCoC,CAAgB/a,KAClDwX,EAAK,8BAA8B,InCrCrC,SAAgBxX,GACd,IAAIgb,EAAUhb,EAAEiB,QAAQuX,QAAQ9C,cAChB,OAAZsF,GAAgC,OAAZA,GACtB3U,GAAgBrG,EAEpB,CmCgC2C,CAAwBA,KACjEwX,EAAK,gBAAgB,IIpCvB,SAAkBxX,IASlB,SAAmBA,GACjB,IAAIsF,EAAW,EAAsBtF,GACjCib,EAAUjb,EAAEiB,QAAQsX,QACpB2C,EAAQ,EACZ,IAAU5V,GAAU,SAAUkN,GAC5B,IAAI2I,EAAY,EACd,IAAM3I,GAAO,SAAU3S,GACrB,OAAOG,EAAES,KAAKZ,GAAGqF,MACnB,KAEF,IAAUsN,GAAO,SAAU3S,GACzBG,EAAES,KAAKZ,GAAGgF,EAAIqW,EAAQC,EAAY,CACpC,IACAD,GAASC,EAAYF,CACvB,GACF,EArBEG,CAFApb,EAAI,EAAwBA,IAG5B,GAAS8S,GAAU9S,IAAI,SAAU4E,EAAG/E,GAClCG,EAAES,KAAKZ,GAAG+E,EAAIA,CAChB,GACF,CJ6B6ByW,CAASrb,KACpCwX,EAAK,yBAAyB,IAwUhC,SAA2BxX,GACzB,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GAClB,GAAmB,aAAfY,EAAKuD,MAAsB,CAC7B,IAAIsX,EAAWtb,EAAES,KAAKA,EAAKoB,EAAEhC,GACzB+E,EAAI0W,EAAS1W,EAAI0W,EAAStW,MAAQ,EAClCH,EAAIyW,EAASzW,EACbC,EAAKrE,EAAKmE,EAAIA,EACdG,EAAKuW,EAASpW,OAAS,EAC3BlF,EAAEgC,QAAQvB,EAAKoB,EAAGpB,EAAKwC,OACvBjD,EAAED,WAAWF,GACbY,EAAKwC,MAAMsW,OAAS,CAClB,CAAE3U,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,EAAKwC,MAAM2B,EAAInE,EAAKmE,EACpBnE,EAAKwC,MAAM4B,EAAIpE,EAAKoE,CACtB,CACF,GACF,CA9VsC0W,CAAkBvb,KACtDwX,EAAK,yBAAyB,IAwQhC,SAA2BxX,GACzB,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B,GAAIG,EAAEsE,SAASzE,GAAGlE,OAAQ,CACxB,IAAI8E,EAAOT,EAAES,KAAKZ,GACdmH,EAAIhH,EAAES,KAAKA,EAAKuL,WAChBwP,EAAIxb,EAAES,KAAKA,EAAKwL,cAChBwP,EAAIzb,EAAES,KAAK,IAAOA,EAAKoP,aACvB6L,EAAI1b,EAAES,KAAK,IAAOA,EAAKsP,cAE3BtP,EAAKuE,MAAQhH,KAAKoH,IAAIsW,EAAE9W,EAAI6W,EAAE7W,GAC9BnE,EAAKyE,OAASlH,KAAKoH,IAAIoW,EAAE3W,EAAImC,EAAEnC,GAC/BpE,EAAKmE,EAAI6W,EAAE7W,EAAInE,EAAKuE,MAAQ,EAC5BvE,EAAKoE,EAAImC,EAAEnC,EAAIpE,EAAKyE,OAAS,CAC/B,CACF,IAEA,IAAUlF,EAAEyB,SAAS,SAAU5B,GACL,WAApBG,EAAES,KAAKZ,GAAGmE,OACZhE,EAAED,WAAWF,EAEjB,GACF,CA7RsC8b,CAAkB3b,KACtDwX,EAAK,sBAAsB,IC4C7B,SAAcxX,GACZ,IAAUA,EAAEiB,QAAQkY,aAAa,SAAUtZ,GACzC,IAEIa,EAFAD,EAAOT,EAAES,KAAKZ,GACd+b,EAAYnb,EAAK6Y,UAGrB,IADAtZ,EAAEgC,QAAQvB,EAAK+Y,QAASoC,GACjBnb,EAAKuD,OACVtD,EAAIV,EAAEuI,WAAW1I,GAAG,GACpBG,EAAED,WAAWF,GACb+b,EAAUrC,OAAOha,KAAK,CAAEqF,EAAGnE,EAAKmE,EAAGC,EAAGpE,EAAKoE,IACxB,eAAfpE,EAAKuD,QACP4X,EAAUhX,EAAInE,EAAKmE,EACnBgX,EAAU/W,EAAIpE,EAAKoE,EACnB+W,EAAU5W,MAAQvE,EAAKuE,MACvB4W,EAAU1W,OAASzE,EAAKyE,QAE1BrF,EAAIa,EACJD,EAAOT,EAAES,KAAKZ,EAElB,GACF,CDhEmC,CAAeG,KAChDwX,EAAK,4BAA4B,IA0OnC,SAA8BxX,GAC5B,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,GAAIe,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,KAI7C,OAHsB,MAAlBA,EAAKmV,UAAsC,MAAlBnV,EAAKmV,WAChCnV,EAAK0E,OAAS1E,EAAKmY,aAEbnY,EAAKmV,UACX,IAAK,IACHnV,EAAKsE,GAAKtE,EAAK0E,MAAQ,EAAI1E,EAAKmY,YAChC,MACF,IAAK,IACHnY,EAAKsE,GAAKtE,EAAK0E,MAAQ,EAAI1E,EAAKmY,YAIxC,GACF,CA3PyCoD,CAAqB7b,KAC5DwX,EAAK,4BAA4B,InCpCnC,SAAcxX,GACZ,IAAIgb,EAAUhb,EAAEiB,QAAQuX,QAAQ9C,cAChB,OAAZsF,GAAgC,OAAZA,GAyB1B,SAAkBhb,GAChB,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B0G,GAAYvG,EAAES,KAAKZ,GACrB,IAEA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,IAAUvB,EAAKiZ,OAAQhT,IACnB3D,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,MAC7CiG,GAAYjG,EAEhB,GACF,CApCIwb,CAAS9b,GAGK,OAAZgb,GAAgC,OAAZA,IAuC1B,SAAgBhb,GACd,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B2G,GAAUxG,EAAES,KAAKZ,GACnB,IAEA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,IAAUvB,EAAKiZ,OAAQ/S,IACnB5D,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,MAC7CkG,GAAUlG,EAEd,GACF,CAlDIyb,CAAO/b,GACPqG,GAAgBrG,GAEpB,CmC0ByC,CAAsBA,KAC7DwX,EAAK,sBAAsB,IA4J7B,SAAwBxX,GACtB,IAAIgc,EAAOrV,OAAOC,kBACdqV,EAAO,EACPC,EAAOvV,OAAOC,kBACduV,EAAO,EACP7G,EAAatV,EAAEiB,QACfmb,EAAU9G,EAAW+G,SAAW,EAChCC,EAAUhH,EAAWiH,SAAW,EAEpC,SAASC,EAAY1Y,GACnB,IAAIc,EAAId,EAAMc,EACVC,EAAIf,EAAMe,EACVnE,EAAIoD,EAAMkB,MACVC,EAAInB,EAAMoB,OACd8W,EAAOhe,KAAK8S,IAAIkL,EAAMpX,EAAIlE,EAAI,GAC9Bub,EAAOje,KAAKG,IAAI8d,EAAMrX,EAAIlE,EAAI,GAC9Bwb,EAAOle,KAAK8S,IAAIoL,EAAMrX,EAAII,EAAI,GAC9BkX,EAAOne,KAAKG,IAAIge,EAAMtX,EAAII,EAAI,EAChC,CAEA,IAAUjF,EAAEyB,SAAS,SAAU5B,GAC7B2c,EAAYxc,EAAES,KAAKZ,GACrB,IACA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GACde,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,MAC7Ckc,EAAYlc,EAEhB,IAEA0b,GAAQI,EACRF,GAAQI,EAER,IAAUtc,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GAClBY,EAAKmE,GAAKoX,EACVvb,EAAKoE,GAAKqX,CACZ,IAEA,IAAUlc,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,IAAUvB,EAAKiZ,QAAQ,SAAUkD,GAC/BA,EAAE7X,GAAKoX,EACPS,EAAE5X,GAAKqX,CACT,IACItZ,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,OAC7CA,EAAKsE,GAAKoX,GAERpZ,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,OAC7CA,EAAKuE,GAAKqX,EAEd,IAEA5G,EAAWtQ,MAAQiX,EAAOD,EAAOI,EACjC9G,EAAWpQ,OAASiX,EAAOD,EAAOI,CACpC,CAnNmCI,CAAe1c,KAChDwX,EAAK,4BAA4B,IAoNnC,SAA8BxX,GAC5B,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAGI8a,EAAIC,EAHJtc,EAAON,EAAEM,KAAKuB,GACdgb,EAAQ7c,EAAES,KAAKoB,EAAEhC,GACjBid,EAAQ9c,EAAES,KAAKoB,EAAEnB,GAEhBJ,EAAKiZ,QAKRoD,EAAKrc,EAAKiZ,OAAO,GACjBqD,EAAKtc,EAAKiZ,OAAOjZ,EAAKiZ,OAAO5d,OAAS,KALtC2E,EAAKiZ,OAAS,GACdoD,EAAKG,EACLF,EAAKC,GAKPvc,EAAKiZ,OAAOwD,QAAQ,EAAmBF,EAAOF,IAC9Crc,EAAKiZ,OAAOha,KAAK,EAAmBud,EAAOF,GAC7C,GACF,CArOyCI,CAAqBhd,KAC5DwX,EAAK,qBAAqB,IAyP5B,SAAuCxX,GACrC,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GACdvB,EAAK+C,UACP/C,EAAKiZ,OAAOvI,SAEhB,GACF,CAhQkCiM,CAA8Bjd,KAC9DwX,EAAK,oBAAoB,I7CJ3B,SAAcxX,GACZ,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAAIoB,EAAQjD,EAAEM,KAAKuB,GACnB,GAAIoB,EAAMI,SAAU,CAClBrD,EAAEkD,WAAWrB,GAEb,IAAIsB,EAAcF,EAAME,mBACjBF,EAAMI,gBACNJ,EAAME,YACbnD,EAAEgC,QAAQH,EAAEnB,EAAGmB,EAAEhC,EAAGoD,EAAOE,EAC7B,CACF,GACF,C6CRiC,CAAanD,IAC9C,CAjC8Bkd,CAAUxF,EAAaF,KACjDA,EAAK,sBAAsB,IAwC/B,SAA0BG,EAAYD,GACpC,IAAUC,EAAWlW,SAAS,SAAU5B,GACtC,IAAIsd,EAAaxF,EAAWlX,KAAKZ,GAC7Bud,EAAc1F,EAAYjX,KAAKZ,GAE/Bsd,IACFA,EAAWvY,EAAIwY,EAAYxY,EAC3BuY,EAAWtY,EAAIuY,EAAYvY,EAEvB6S,EAAYpT,SAASzE,GAAGlE,SAC1BwhB,EAAWnY,MAAQoY,EAAYpY,MAC/BmY,EAAWjY,OAASkY,EAAYlY,QAGtC,IAEA,IAAUyS,EAAW/V,SAAS,SAAUC,GACtC,IAAIsb,EAAaxF,EAAWrX,KAAKuB,GAC7Bub,EAAc1F,EAAYpX,KAAKuB,GAEnCsb,EAAW5D,OAAS6D,EAAY7D,OAC5B3W,OAAOC,UAAUC,eAAeC,KAAKqa,EAAa,OACpDD,EAAWvY,EAAIwY,EAAYxY,EAC3BuY,EAAWtY,EAAIuY,EAAYvY,EAE/B,IAEA8S,EAAW1W,QAAQ+D,MAAQ0S,EAAYzW,QAAQ+D,MAC/C2S,EAAW1W,QAAQiE,OAASwS,EAAYzW,QAAQiE,MAClD,CArEqCmY,CAAiBrd,EAAG0X,IAAa,GAEtE,CAqEA,IAAIK,GAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,GAAgB,CAAEU,QAAS,GAAI1C,QAAS,GAAID,QAAS,GAAI4C,QAAS,MAClER,GAAa,CAAC,YAAa,SAAU,UAAW,SAChDC,GAAe,CAAC,QAAS,UACzBC,GAAe,CAAElT,MAAO,EAAGE,OAAQ,GACnCkT,GAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,GAAe,CACjBzR,OAAQ,EACRnG,OAAQ,EACRyE,MAAO,EACPE,OAAQ,EACRuT,YAAa,GACbhD,SAAU,KAER4C,GAAY,CAAC,YAkSjB,SAASP,GAAkBwF,EAAKxZ,GAC9B,OAAO,EAAY,EAAOwZ,EAAKxZ,GAAQ6C,OACzC,CAEA,SAASiR,GAAa9T,GACpB,IAAIyZ,EAAW,CAAC,EAIhB,OAHA,IAAUzZ,GAAO,SAAUjE,EAAGD,GAC5B2d,EAAS3d,EAAE8V,eAAiB7V,CAC9B,IACO0d,CACT,C,iGKhZIrf,EAAYF,KAAKG,ICoCrB,SC9BoBqf,EF+BpB,SAAmB/gB,EAAOD,EAAWihB,GACnC,IAAI9hB,EAAkB,MAATc,EAAgB,EAAIA,EAAMd,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIH,EAAqB,MAAbiiB,EAAoB,GAAI,EAAAC,EAAA,GAAUD,GAI9C,OAHIjiB,EAAQ,IACVA,EAAQ0C,EAAUvC,EAASH,EAAO,KAE7B,OAAciB,GAAO,OAAaD,EAAW,GAAIhB,EAC1D,EExCS,SAASF,EAAYkB,EAAWihB,GACrC,IAAIE,EAAW/a,OAAOtH,GACtB,KAAK,EAAAsiB,EAAA,GAAYtiB,GAAa,CAC5B,IAAIC,GAAW,OAAaiB,EAAW,GACvClB,GAAa,EAAAuiB,EAAA,GAAKviB,GAClBkB,EAAY,SAASX,GAAO,OAAON,EAASoiB,EAAS9hB,GAAMA,EAAK8hB,EAAW,CAC7E,CACA,IAAIniB,EAAQgiB,EAAcliB,EAAYkB,EAAWihB,GACjD,OAAOjiB,GAAS,EAAImiB,EAASpiB,EAAWD,EAAWE,GAASA,QAASc,CACvE,GAVF,IAAoBkhB,C,+JCcpB,SAJY,QAAS,SAASM,GAC5B,OAAO,QAAS,OAAYA,EAAQ,EAAGC,EAAA,GAAmB,GAC5D,I,0BCpBIC,EAAa,KAsBV,MAAMC,EACX,WAAAvf,CAAY6Y,EAAO,CAAC,GAClBzY,KAAKof,aAActb,OAAOC,UAAUC,eAAeC,KAAKwU,EAAM,aAC1DA,EAAKtQ,SAETnI,KAAKqf,gBAAgBvb,OAAOC,UAAUC,eAAeC,KAAKwU,EAAM,eAC5DA,EAAKpT,WAETrF,KAAKsf,cAAcxb,OAAOC,UAAUC,eAAeC,KAAKwU,EAAM,aAC1DA,EAAK5F,SAIT7S,KAAKuf,YAAS/hB,EAGdwC,KAAKwf,oBAAsB,SAAWhiB,GAGtCwC,KAAKyf,oBAAsB,SAAWjiB,GAGtCwC,KAAK0f,OAAS,CAAC,EAEX1f,KAAKsf,cAEPtf,KAAK2f,QAAU,CAAC,EAGhB3f,KAAK4f,UAAY,CAAC,EAClB5f,KAAK4f,UAAUV,GAAc,CAAC,GAIhClf,KAAK6f,IAAM,CAAC,EAGZ7f,KAAK8f,OAAS,CAAC,EAGf9f,KAAK+f,KAAO,CAAC,EAGb/f,KAAKggB,MAAQ,CAAC,EAGdhgB,KAAKigB,UAAY,CAAC,EAGlBjgB,KAAKkgB,YAAc,CAAC,CACtB,CAEA,UAAA1W,GACE,OAAOxJ,KAAKof,WACd,CACA,YAAA9Z,GACE,OAAOtF,KAAKqf,aACd,CACA,UAAAc,GACE,OAAOngB,KAAKsf,WACd,CACA,QAAA/Z,CAASpB,GAEP,OADAnE,KAAKuf,OAASpb,EACPnE,IACT,CACA,KAAAmC,GACE,OAAOnC,KAAKuf,MACd,CAEA,mBAAAzM,CAAoBsN,GAKlB,OAJK,IAAaA,KAChBA,EAAa,IAAWA,IAE1BpgB,KAAKwf,oBAAsBY,EACpBpgB,IACT,CACA,SAAAsC,GACE,OAAOtC,KAAKqgB,UACd,CACA,KAAA1d,GACE,OAAO,IAAO3C,KAAK0f,OACrB,CACA,OAAArc,GACE,IAAIid,EAAOtgB,KACX,OAAO,IAASA,KAAK2C,SAAS,SAAU5B,GACtC,OAAO,IAAUuf,EAAKT,IAAI9e,GAC5B,GACF,CACA,KAAAuC,GACE,IAAIgd,EAAOtgB,KACX,OAAO,IAASA,KAAK2C,SAAS,SAAU5B,GACtC,OAAO,IAAUuf,EAAKP,KAAKhf,GAC7B,GACF,CACA,QAAAwf,CAASjX,EAAIxM,GACX,IAAI0jB,EAAO5Z,UACP0Z,EAAOtgB,KAQX,OAPA,IAAOsJ,GAAI,SAAUvI,GACfyf,EAAK3jB,OAAS,EAChByjB,EAAK1d,QAAQ7B,EAAGjE,GAEhBwjB,EAAK1d,QAAQ7B,EAEjB,IACOf,IACT,CACA,OAAA4C,CAAQ7B,EAAGjE,GACT,OAAIgH,OAAOC,UAAUC,eAAeC,KAAKjE,KAAK0f,OAAQ3e,IAChD6F,UAAU/J,OAAS,IACrBmD,KAAK0f,OAAO3e,GAAKjE,GAEZkD,OAITA,KAAK0f,OAAO3e,GAAK6F,UAAU/J,OAAS,EAAIC,EAAQkD,KAAKwf,oBAAoBze,GACrEf,KAAKsf,cACPtf,KAAK2f,QAAQ5e,GAAKme,EAClBlf,KAAK4f,UAAU7e,GAAK,CAAC,EACrBf,KAAK4f,UAAUV,GAAYne,IAAK,GAElCf,KAAK6f,IAAI9e,GAAK,CAAC,EACff,KAAK8f,OAAO/e,GAAK,CAAC,EAClBf,KAAK+f,KAAKhf,GAAK,CAAC,EAChBf,KAAKggB,MAAMjf,GAAK,CAAC,IACff,KAAKqgB,WACArgB,KACT,CACA,IAAA2B,CAAKZ,GACH,OAAOf,KAAK0f,OAAO3e,EACrB,CACA,OAAAkE,CAAQlE,GACN,OAAO+C,OAAOC,UAAUC,eAAeC,KAAKjE,KAAK0f,OAAQ3e,EAC3D,CACA,UAAAE,CAAWF,GACT,GAAI+C,OAAOC,UAAUC,eAAeC,KAAKjE,KAAK0f,OAAQ3e,GAAI,CACxD,IAAIqD,EAAcrB,GAAM/C,KAAKoE,WAAWpE,KAAKigB,UAAUld,WAChD/C,KAAK0f,OAAO3e,GACff,KAAKsf,cACPtf,KAAKygB,4BAA4B1f,UAC1Bf,KAAK2f,QAAQ5e,GACpB,IAAOf,KAAKwF,SAASzE,IAAKwJ,IACxBvK,KAAKsH,UAAUiD,EAAM,WAEhBvK,KAAK4f,UAAU7e,IAExB,IAAO,IAAOf,KAAK6f,IAAI9e,IAAKqD,UACrBpE,KAAK6f,IAAI9e,UACTf,KAAK8f,OAAO/e,GACnB,IAAO,IAAOf,KAAK+f,KAAKhf,IAAKqD,UACtBpE,KAAK+f,KAAKhf,UACVf,KAAKggB,MAAMjf,KAChBf,KAAKqgB,UACT,CACA,OAAOrgB,IACT,CACA,SAAAsH,CAAUvG,EAAGyJ,GACX,IAAKxK,KAAKsf,YACR,MAAM,IAAIjZ,MAAM,6CAGlB,GAAI,IAAcmE,GAChBA,EAAS0U,MACJ,CAGL,IAAK,IAAIwB,EADTlW,GAAU,IACmB,IAAckW,GAAWA,EAAW1gB,KAAKwK,OAAOkW,GAC3E,GAAIA,IAAa3f,EACf,MAAM,IAAIsF,MAAM,WAAamE,EAAS,iBAAmBzJ,EAAI,yBAIjEf,KAAK4C,QAAQ4H,EACf,CAMA,OAJAxK,KAAK4C,QAAQ7B,GACbf,KAAKygB,4BAA4B1f,GACjCf,KAAK2f,QAAQ5e,GAAKyJ,EAClBxK,KAAK4f,UAAUpV,GAAQzJ,IAAK,EACrBf,IACT,CACA,2BAAAygB,CAA4B1f,UACnBf,KAAK4f,UAAU5f,KAAK2f,QAAQ5e,IAAIA,EACzC,CACA,MAAAyJ,CAAOzJ,GACL,GAAIf,KAAKsf,YAAa,CACpB,IAAI9U,EAASxK,KAAK2f,QAAQ5e,GAC1B,GAAIyJ,IAAW0U,EACb,OAAO1U,CAEX,CACF,CACA,QAAAhF,CAASzE,GAKP,GAJI,IAAcA,KAChBA,EAAIme,GAGFlf,KAAKsf,YAAa,CACpB,IAAI9Z,EAAWxF,KAAK4f,UAAU7e,GAC9B,GAAIyE,EACF,OAAO,IAAOA,EAElB,KAAO,IAAIzE,IAAMme,EACf,OAAOlf,KAAK2C,QACP,GAAI3C,KAAKiF,QAAQlE,GACtB,MAAO,EACT,CACF,CACA,YAAAuR,CAAavR,GACX,IAAI4f,EAAS3gB,KAAK8f,OAAO/e,GACzB,GAAI4f,EACF,OAAO,IAAOA,EAElB,CACA,UAAAlX,CAAW1I,GACT,IAAI6f,EAAQ5gB,KAAKggB,MAAMjf,GACvB,GAAI6f,EACF,OAAO,IAAOA,EAElB,CACA,SAAAlX,CAAU3I,GACR,IAAI8f,EAAQ7gB,KAAKsS,aAAavR,GAC9B,GAAI8f,EACF,OAAO,EAAQA,EAAO7gB,KAAKyJ,WAAW1I,GAE1C,CACA,MAAA+f,CAAO/f,GAOL,OAA4B,KALxBf,KAAKwJ,aACKxJ,KAAKyJ,WAAW1I,GAEhBf,KAAK0J,UAAU3I,IAEZlE,MACnB,CACA,WAAAkkB,CAAYC,GAEV,IAAIC,EAAO,IAAIjhB,KAAKJ,YAAY,CAC9BuI,SAAUnI,KAAKof,YACf/Z,WAAYrF,KAAKqf,cACjBxM,SAAU7S,KAAKsf,cAGjB2B,EAAK1b,SAASvF,KAAKmC,SAEnB,IAAIme,EAAOtgB,KACX,IAAOA,KAAK0f,QAAQ,SAAU5iB,EAAOiE,GAC/BigB,EAAOjgB,IACTkgB,EAAKre,QAAQ7B,EAAGjE,EAEpB,IAEA,IAAOkD,KAAKigB,WAAW,SAAUld,GAE3Bke,EAAKhc,QAAQlC,EAAEhC,IAAMkgB,EAAKhc,QAAQlC,EAAEnB,IACtCqf,EAAK/d,QAAQH,EAAGud,EAAK9e,KAAKuB,GAE9B,IAEA,IAAIme,EAAU,CAAC,EACf,SAASC,EAAWpgB,GAClB,IAAIyJ,EAAS8V,EAAK9V,OAAOzJ,GACzB,YAAevD,IAAXgN,GAAwByW,EAAKhc,QAAQuF,IACvC0W,EAAQngB,GAAKyJ,EACNA,GACEA,KAAU0W,EACZA,EAAQ1W,GAER2W,EAAW3W,EAEtB,CAQA,OANIxK,KAAKsf,aACP,IAAO2B,EAAKte,SAAS,SAAU5B,GAC7BkgB,EAAK3Z,UAAUvG,EAAGogB,EAAWpgB,GAC/B,IAGKkgB,CACT,CAEA,mBAAAG,CAAoBhB,GAKlB,OAJK,IAAaA,KAChBA,EAAa,IAAWA,IAE1BpgB,KAAKyf,oBAAsBW,EACpBpgB,IACT,CACA,SAAAqhB,GACE,OAAOrhB,KAAKshB,UACd,CACA,KAAAxe,GACE,OAAO,IAAS9C,KAAKigB,UACvB,CACA,OAAAsB,CAAQjY,EAAIxM,GACV,IAAIwjB,EAAOtgB,KACPwgB,EAAO5Z,UASX,OARA,IAAS0C,GAAI,SAAUvI,EAAGa,GAMxB,OALI4e,EAAK3jB,OAAS,EAChByjB,EAAKpd,QAAQnC,EAAGa,EAAG9E,GAEnBwjB,EAAKpd,QAAQnC,EAAGa,GAEXA,CACT,IACO5B,IACT,CAKA,OAAAkD,GACE,IAAInC,EAAGa,EAAG0C,EAAMxH,EACZ0kB,GAAiB,EACjBC,EAAO7a,UAAU,GAED,iBAAT6a,GAA8B,OAATA,GAAiB,MAAOA,GACtD1gB,EAAI0gB,EAAK1gB,EACTa,EAAI6f,EAAK7f,EACT0C,EAAOmd,EAAKnd,KACa,IAArBsC,UAAU/J,SACZC,EAAQ8J,UAAU,GAClB4a,GAAiB,KAGnBzgB,EAAI0gB,EACJ7f,EAAIgF,UAAU,GACdtC,EAAOsC,UAAU,GACbA,UAAU/J,OAAS,IACrBC,EAAQ8J,UAAU,GAClB4a,GAAiB,IAIrBzgB,EAAI,GAAKA,EACTa,EAAI,GAAKA,EACJ,IAAc0C,KACjBA,EAAO,GAAKA,GAGd,IAAIvB,EAAI2e,EAAa1hB,KAAKof,YAAare,EAAGa,EAAG0C,GAC7C,GAAIR,OAAOC,UAAUC,eAAeC,KAAKjE,KAAKkgB,YAAand,GAIzD,OAHIye,IACFxhB,KAAKkgB,YAAYnd,GAAKjG,GAEjBkD,KAGT,IAAK,IAAcsE,KAAUtE,KAAKqf,cAChC,MAAM,IAAIhZ,MAAM,qDAKlBrG,KAAK4C,QAAQ7B,GACbf,KAAK4C,QAAQhB,GAGb5B,KAAKkgB,YAAYnd,GAAKye,EAAiB1kB,EAAQkD,KAAKyf,oBAAoB1e,EAAGa,EAAG0C,GAE9E,IAAIoW,EA8GR,SAAuBlR,EAAYmY,EAAIC,EAAItd,GACzC,IAAIvD,EAAI,GAAK4gB,EACT/f,EAAI,GAAKggB,EACb,IAAKpY,GAAczI,EAAIa,EAAG,CACxB,IAAI6P,EAAM1Q,EACVA,EAAIa,EACJA,EAAI6P,CACN,CACA,IAAIiJ,EAAU,CAAE3Z,EAAGA,EAAGa,EAAGA,GAIzB,OAHI0C,IACFoW,EAAQpW,KAAOA,GAEVoW,CACT,CA3HkBmH,CAAc7hB,KAAKof,YAAare,EAAGa,EAAG0C,GAYpD,OAVAvD,EAAI2Z,EAAQ3Z,EACZa,EAAI8Y,EAAQ9Y,EAEZkC,OAAOge,OAAOpH,GACd1a,KAAKigB,UAAUld,GAAK2X,EACpBqH,EAAqB/hB,KAAK8f,OAAOle,GAAIb,GACrCghB,EAAqB/hB,KAAKggB,MAAMjf,GAAIa,GACpC5B,KAAK6f,IAAIje,GAAGmB,GAAK2X,EACjB1a,KAAK+f,KAAKhf,GAAGgC,GAAK2X,EAClB1a,KAAKshB,aACEthB,IACT,CACA,IAAAwB,CAAKT,EAAGa,EAAG0C,GACT,IAAIvB,EACmB,IAArB6D,UAAU/J,OACNmlB,EAAYhiB,KAAKof,YAAaxY,UAAU,IACxC8a,EAAa1hB,KAAKof,YAAare,EAAGa,EAAG0C,GAC3C,OAAOtE,KAAKkgB,YAAYnd,EAC1B,CACA,OAAAoI,CAAQpK,EAAGa,EAAG0C,GACZ,IAAIvB,EACmB,IAArB6D,UAAU/J,OACNmlB,EAAYhiB,KAAKof,YAAaxY,UAAU,IACxC8a,EAAa1hB,KAAKof,YAAare,EAAGa,EAAG0C,GAC3C,OAAOR,OAAOC,UAAUC,eAAeC,KAAKjE,KAAKkgB,YAAand,EAChE,CACA,UAAAqB,CAAWrD,EAAGa,EAAG0C,GACf,IAAIvB,EACmB,IAArB6D,UAAU/J,OACNmlB,EAAYhiB,KAAKof,YAAaxY,UAAU,IACxC8a,EAAa1hB,KAAKof,YAAare,EAAGa,EAAG0C,GACvC9C,EAAOxB,KAAKigB,UAAUld,GAY1B,OAXIvB,IACFT,EAAIS,EAAKT,EACTa,EAAIJ,EAAKI,SACF5B,KAAKkgB,YAAYnd,UACjB/C,KAAKigB,UAAUld,GACtBkf,EAAuBjiB,KAAK8f,OAAOle,GAAIb,GACvCkhB,EAAuBjiB,KAAKggB,MAAMjf,GAAIa,UAC/B5B,KAAK6f,IAAIje,GAAGmB,UACZ/C,KAAK+f,KAAKhf,GAAGgC,GACpB/C,KAAKshB,cAEAthB,IACT,CACA,OAAAuB,CAAQR,EAAGgK,GACT,IAAIqG,EAAMpR,KAAK6f,IAAI9e,GACnB,GAAIqQ,EAAK,CACP,IAAItO,EAAQ,IAASsO,GACrB,OAAKrG,EAGE,IAASjI,GAAO,SAAUtB,GAC/B,OAAOA,EAAKT,IAAMgK,CACpB,IAJSjI,CAKX,CACF,CACA,QAAAf,CAAShB,EAAGa,GACV,IAAIsgB,EAAOliB,KAAK+f,KAAKhf,GACrB,GAAImhB,EAAM,CACR,IAAIpf,EAAQ,IAASof,GACrB,OAAKtgB,EAGE,IAASkB,GAAO,SAAUtB,GAC/B,OAAOA,EAAKI,IAAMA,CACpB,IAJSkB,CAKX,CACF,CACA,SAAA0F,CAAUzH,EAAGa,GACX,IAAIL,EAAUvB,KAAKuB,QAAQR,EAAGa,GAC9B,GAAIL,EACF,OAAOA,EAAQiC,OAAOxD,KAAK+B,SAAShB,EAAGa,GAE3C,EASF,SAASmgB,EAAqB5e,EAAKrC,GAC7BqC,EAAIrC,GACNqC,EAAIrC,KAEJqC,EAAIrC,GAAK,CAEb,CAEA,SAASmhB,EAAuB9e,EAAKrC,KAC5BqC,EAAIrC,WACFqC,EAAIrC,EAEf,CAEA,SAAS4gB,EAAalY,EAAYmY,EAAIC,EAAItd,GACxC,IAAIvD,EAAI,GAAK4gB,EACT/f,EAAI,GAAKggB,EACb,IAAKpY,GAAczI,EAAIa,EAAG,CACxB,IAAI6P,EAAM1Q,EACVA,EAAIa,EACJA,EAAI6P,CACN,CACA,OAAO1Q,EAxeY,IAweSa,EAxeT,KAwe+B,IAAc0C,GA1e1C,KA0esEA,EAC9F,CAiBA,SAAS0d,EAAYxY,EAAYkR,GAC/B,OAAOgH,EAAalY,EAAYkR,EAAQ3Z,EAAG2Z,EAAQ9Y,EAAG8Y,EAAQpW,KAChE,CA/CA6a,EAAMpb,UAAUsc,WAAa,EAG7BlB,EAAMpb,UAAUud,WAAa,C,kDC/b7B,QALA,SAAiB3jB,GAEf,OADsB,MAATA,GAAoBA,EAAMd,QACvB,OAAYc,EAAO,GAAK,EAC1C,C,sFClBA,IAGI,EAHcmG,OAAOC,UAGQC,eAcjC,QAJA,SAAiBhH,EAAQD,GACvB,OAAiB,MAAVC,GAAkB,EAAeiH,KAAKjH,EAAQD,EACvD,E,eCkBA,QAJA,SAAaC,EAAQC,GACnB,OAAiB,MAAVD,IAAkB,OAAQA,EAAQC,EAAM,EACjD,C,wECJA,QANA,SAAaU,GACX,OAAQA,GAASA,EAAMd,QACnB,OAAac,EAAO,IAAU,UAC9BH,CACN,C,mFC0BA,QALA,SAAahB,EAAYC,GAEvB,QADW,OAAQD,GAAc,IAAW,KAChCA,GAAY,OAAaC,EAAU,GACjD,C,kFC5CI0lB,EAAcre,OAAOC,UAGrBC,EAAiBme,EAAYne,eAsDjC,SA/Be,QAAS,SAAShH,EAAQqG,GACvCrG,EAAS8G,OAAO9G,GAEhB,IAAIN,GAAS,EACTG,EAASwG,EAAQxG,OACjBulB,EAAQvlB,EAAS,EAAIwG,EAAQ,QAAK7F,EAMtC,IAJI4kB,IAAS,OAAe/e,EAAQ,GAAIA,EAAQ,GAAI+e,KAClDvlB,EAAS,KAGFH,EAAQG,GAMf,IALA,IAAIiV,EAASzO,EAAQ3G,GACjBgR,GAAQ,OAAOoE,GACfuQ,GAAc,EACdC,EAAc5U,EAAM7Q,SAEfwlB,EAAaC,GAAa,CACjC,IAAIvlB,EAAM2Q,EAAM2U,GACZvlB,EAAQE,EAAOD,SAELS,IAAVV,IACC,OAAGA,EAAOqlB,EAAYplB,MAAUiH,EAAeC,KAAKjH,EAAQD,MAC/DC,EAAOD,GAAO+U,EAAO/U,GAEzB,CAGF,OAAOC,CACT,G,mCChDA,QAJA,SAAgBF,EAAO4B,GACrB,OAAO5B,EAAQ4B,CACjB,C,kDCoBA,QAnBA,SAAsBf,EAAOlB,EAAU8lB,GAIrC,IAHA,IAAI7lB,GAAS,EACTG,EAASc,EAAMd,SAEVH,EAAQG,GAAQ,CACvB,IAAIC,EAAQa,EAAMjB,GACd8lB,EAAU/lB,EAASK,GAEvB,GAAe,MAAX0lB,SAAiChlB,IAAbilB,EACfD,GAAYA,KAAY,OAASA,GAClCD,EAAWC,EAASC,IAE1B,IAAIA,EAAWD,EACX7lB,EAASG,CAEjB,CACA,OAAOH,CACT,C","sources":["webpack:///../../node_modules/lodash-es/_baseMap.js","webpack:///../../node_modules/lodash-es/_baseSet.js","webpack:///../../node_modules/lodash-es/_basePickBy.js","webpack:///../../node_modules/lodash-es/last.js","webpack:///../../node_modules/lodash-es/isString.js","webpack:///../../node_modules/lodash-es/_trimmedEndIndex.js","webpack:///../../node_modules/lodash-es/_baseTrim.js","webpack:///../../node_modules/lodash-es/toNumber.js","webpack:///../../node_modules/lodash-es/toFinite.js","webpack:///../../node_modules/lodash-es/toInteger.js","webpack:///../../node_modules/lodash-es/uniqueId.js","webpack:///../../node_modules/lodash-es/_baseRange.js","webpack:///../../node_modules/lodash-es/range.js","webpack:///../../node_modules/lodash-es/_createRange.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/data/list.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/greedy-fas.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/acyclic.js","webpack:///../../node_modules/lodash-es/pick.js","webpack:///../../node_modules/lodash-es/_flatRest.js","webpack:///../../node_modules/lodash-es/_basePick.js","webpack:///../../node_modules/lodash-es/_baseGt.js","webpack:///../../node_modules/lodash-es/max.js","webpack:///../../node_modules/lodash-es/mapValues.js","webpack:///../../node_modules/lodash-es/now.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/util.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/add-border-segments.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/coordinate-system.js","webpack:///../../node_modules/lodash-es/minBy.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/rank/util.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js","webpack:///../../node_modules/lodash-es/_asciiSize.js","webpack:///../../node_modules/lodash-es/_hasUnicode.js","webpack:///../../node_modules/lodash-es/_unicodeSize.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/rank/index.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/nesting-graph.js","webpack:///../../node_modules/lodash-es/cloneDeep.js","webpack:///../../node_modules/lodash-es/_baseZipObject.js","webpack:///../../node_modules/lodash-es/zipObject.js","webpack:///../../node_modules/lodash-es/_compareAscending.js","webpack:///../../node_modules/lodash-es/_baseOrderBy.js","webpack:///../../node_modules/lodash-es/_baseSortBy.js","webpack:///../../node_modules/lodash-es/_compareMultiple.js","webpack:///../../node_modules/lodash-es/sortBy.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/cross-count.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/sort.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/barycenter.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/index.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js","webpack:///../../node_modules/lodash-es/forOwn.js","webpack:///../../node_modules/lodash-es/forIn.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/position/bk.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/layout.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/normalize.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/init-order.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/position/index.js","webpack:///../../node_modules/lodash-es/findIndex.js","webpack:///../../node_modules/lodash-es/find.js","webpack:///../../node_modules/lodash-es/_createFind.js","webpack:///../../node_modules/lodash-es/union.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/graph.js","webpack:///../../node_modules/lodash-es/flatten.js","webpack:///../../node_modules/lodash-es/_baseHas.js","webpack:///../../node_modules/lodash-es/has.js","webpack:///../../node_modules/lodash-es/min.js","webpack:///../../node_modules/lodash-es/map.js","webpack:///../../node_modules/lodash-es/defaults.js","webpack:///../../node_modules/lodash-es/_baseLt.js","webpack:///../../node_modules/lodash-es/_baseExtremum.js"],"sourcesContent":["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 assignValue from './_assignValue.js';\nimport castPath from './_castPath.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nexport default baseSet;\n","import baseGet from './_baseGet.js';\nimport baseSet from './_baseSet.js';\nimport castPath from './_castPath.js';\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nexport default basePickBy;\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 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","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nexport default baseTrim;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nexport default toNumber;\n","import toNumber from './toNumber.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nexport default toFinite;\n","import toFinite from './toFinite.js';\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nexport default toInteger;\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","/* 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 * 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 (Object.prototype.hasOwnProperty.call(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function (e) {\n      if (Object.prototype.hasOwnProperty.call(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 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","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","/**\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","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","import root from './_root.js';\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nexport default now;\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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 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 (Object.prototype.hasOwnProperty.call(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 * 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 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 * 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 (Object.prototype.hasOwnProperty.call(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!Object.prototype.hasOwnProperty.call(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 (!Object.prototype.hasOwnProperty.call(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 (!Object.prototype.hasOwnProperty.call(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 baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nexport default cloneDeep;\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","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 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","/**\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 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 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';\nimport * as util from '../util.js';\n\nexport { sort };\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function (entry) {\n    return Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 (!Object.prototype.hasOwnProperty.call(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';\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 { 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';\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 (Object.prototype.hasOwnProperty.call(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","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 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 !!conflicts[v] && Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 { 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', () => {\n    var layoutGraph = time('  buildLayoutGraph', () => buildLayoutGraph(g));\n    time('  runLayout', () => runLayout(layoutGraph, time));\n    time('  updateInputGraph', () => updateInputGraph(g, layoutGraph));\n  });\n}\n\nfunction runLayout(g, time) {\n  time('    makeSpaceForEdgeLabels', () => makeSpaceForEdgeLabels(g));\n  time('    removeSelfEdges', () => removeSelfEdges(g));\n  time('    acyclic', () => acyclic.run(g));\n  time('    nestingGraph.run', () => nestingGraph.run(g));\n  time('    rank', () => rank(util.asNonCompoundGraph(g)));\n  time('    injectEdgeLabelProxies', () => injectEdgeLabelProxies(g));\n  time('    removeEmptyRanks', () => util.removeEmptyRanks(g));\n  time('    nestingGraph.cleanup', () => nestingGraph.cleanup(g));\n  time('    normalizeRanks', () => util.normalizeRanks(g));\n  time('    assignRankMinMax', () => assignRankMinMax(g));\n  time('    removeEdgeLabelProxies', () => removeEdgeLabelProxies(g));\n  time('    normalize.run', () => normalize.run(g));\n  time('    parentDummyChains', () => parentDummyChains(g));\n  time('    addBorderSegments', () => addBorderSegments(g));\n  time('    order', () => order(g));\n  time('    insertSelfEdges', () => insertSelfEdges(g));\n  time('    adjustCoordinateSystem', () => coordinateSystem.adjust(g));\n  time('    position', () => position(g));\n  time('    positionSelfEdges', () => positionSelfEdges(g));\n  time('    removeBorderNodes', () => removeBorderNodes(g));\n  time('    normalize.undo', () => normalize.undo(g));\n  time('    fixupEdgeLabelCoords', () => fixupEdgeLabelCoords(g));\n  time('    undoCoordinateSystem', () => coordinateSystem.undo(g));\n  time('    translateGraph', () => translateGraph(g));\n  time('    assignNodeIntersects', () => assignNodeIntersects(g));\n  time('    reversePoints', () => reversePointsForReversedEdges(g));\n  time('    acyclic.undo', () => acyclic.undo(g));\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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(edge, 'x')) {\n      edge.x -= minX;\n    }\n    if (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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","/**\n * TypeScript type imports:\n *\n * @import { Graph } from '../graphlib/graph.js';\n */\nimport * 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\n/**\n * @param {Graph} g\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  /**\n   * @typedef {Object} Attrs\n   * @property {number} width\n   * @property {number} height\n   * @property {ReturnType<Graph[\"node\"]>} edgeLabel\n   * @property {any} edgeObj\n   * @property {ReturnType<Graph[\"node\"]>[\"rank\"]} rank\n   * @property {string} [dummy]\n   * @property {ReturnType<Graph[\"node\"]>[\"labelpos\"]} [labelpos]\n   */\n\n  /** @type {Attrs | undefined} */\n  var attrs = undefined;\n  var dummy, 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      attrs.dummy = 'edge-label';\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 * 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 * as _ from 'lodash-es';\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 */\nexport function 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';\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 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 baseIteratee from './_baseIteratee.js';\nimport isArrayLike from './isArrayLike.js';\nimport keys from './keys.js';\n\n/**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\nfunction createFind(findIndexFunc) {\n  return function(collection, predicate, fromIndex) {\n    var iterable = Object(collection);\n    if (!isArrayLike(collection)) {\n      var iteratee = baseIteratee(predicate, 3);\n      collection = keys(collection);\n      predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n    }\n    var index = findIndexFunc(collection, predicate, fromIndex);\n    return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n  };\n}\n\nexport default createFind;\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 = Object.prototype.hasOwnProperty.call(opts, 'directed')\n      ? opts.directed\n      : true;\n    this._isMultigraph = Object.prototype.hasOwnProperty.call(opts, 'multigraph')\n      ? opts.multigraph\n      : false;\n    this._isCompound = Object.prototype.hasOwnProperty.call(opts, 'compound')\n      ? opts.compound\n      : 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 (Object.prototype.hasOwnProperty.call(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 Object.prototype.hasOwnProperty.call(this._nodes, v);\n  }\n  removeNode(v) {\n    if (Object.prototype.hasOwnProperty.call(this._nodes, v)) {\n      var removeEdge = (e) => this.removeEdge(this._edgeObjs[e]);\n      delete this._nodes[v];\n      if (this._isCompound) {\n        this._removeFromParentsChildList(v);\n        delete this._parent[v];\n        _.each(this.children(v), (child) => {\n          this.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 (Object.prototype.hasOwnProperty.call(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 Object.prototype.hasOwnProperty.call(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","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","/** 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","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 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 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","/**\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 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"],"names":["collection","iteratee","index","result","Array","length","value","key","object","path","customizer","isObject","lastIndex","nested","newValue","objValue","undefined","paths","predicate","array","reWhitespace","reTrimStart","string","slice","test","charAt","replace","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","INFINITY","isSymbol","other","valueOf","isBinary","remainder","idCounter","prefix","id","nativeCeil","Math","ceil","nativeMax","max","start","end","step","toFinite","fromRight","List","constructor","sentinel","_next","_prev","this","_sentinel","dequeue","entry","unlink","enqueue","toString","strs","curr","push","JSON","stringify","filterOutLinks","join","k","v","DEFAULT_WEIGHT_FN","removeNode","g","buckets","zeroIdx","collectPredecessors","results","inEdges","edge","weight","uEntry","node","w","out","assignBucket","outEdges","wEntry","run","fas","graph","acyclicer","weightFn","nodeCount","state","fasGraph","maxIn","maxOut","nodes","setNode","in","edges","e","prevWeight","edgeWeight","setEdge","map","buildState","sources","sinks","i","concat","doGreedyFAS","greedyFAS","stack","visited","dfs","Object","prototype","hasOwnProperty","call","dfsFAS","label","removeEdge","forwardName","name","reversed","func","hasIn","flatten","identity","Date","now","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","arguments","fn","console","log","notime","prop","sg","sgNode","borderType","prev","setParent","swapWidthHeight","swapWidthHeightOne","reverseYOne","swapXYOne","longestPath","minlen","Number","POSITIVE_INFINITY","slack","feasibleTree","delta","t","directed","size","tightTree","findMinSlackEdge","shiftRanks","nodeEdges","edgeV","RegExp","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","rsSymbol","vs","navigation","isDirected","successors","neighbors","bind","acc","doDfs","postorder","networkSimplex","simpleLabel","simplify","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","child","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","CLONE_DEEP_FLAG","props","values","assignFunc","valsLength","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","iteratees","orders","isArray","comparer","sort","objCriteria","criteria","othCriteria","ordersLength","crossCount","cc","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","pos","firstIndex","treeSize","forEach","weightSum","entries","biasRight","bias","parts","lhs","rhs","sortable","unsortable","sum","vsIndex","entryV","entryW","barycenter","consumeUnsortable","last","pop","sortSubgraph","cg","movable","bl","borderLeft","br","borderRight","subgraphs","barycenters","inV","nodeU","subgraphResult","target","mappedEntries","tmp","indegree","sourceSet","handleIn","vEntry","source","merged","min","handleOut","reverse","doResolveConflicts","resolveConflicts","expandSubgraphs","predecessors","blPred","brPred","buildLayerGraphs","ranks","relationship","createRootNode","compound","setDefaultNodeLabel","minRank","maxRank","buildLayerGraph","sweepLayerGraphs","layerGraphs","lg","sorted","rootPrev","prevChild","addSubgraphConstraints","assignOrder","layer","keysIn","addConflict","conflicts","conflictsV","hasConflict","positionX","adjustedLayering","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","findType1Conflicts","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","findType2Conflicts","xss","vert","horiz","inner","neighborFn","align","prevIdx","ws","mp","floor","il","verticalAlignment","xs","reverseSep","blockG","blockGraph","graphLabel","sepFn","edgeSep","labelpos","toLowerCase","sep","nodesep","edgesep","vRoot","uRoot","prevMax","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","elem","reduce","horizontalCompaction","smallestWidth","NEGATIVE_INFINITY","halfWidth","findSmallestWidthAlignment","alignTo","alignToVals","alignToMin","alignToMax","alignment","xsVals","alignCoordinates","ul","ignore","balance","layout","opts","time","debugTiming","layoutGraph","inputGraph","canonicalize","graphDefaults","selectNumberAttrs","graphNumAttrs","graphAttrs","nodeNumAttrs","nodeDefaults","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","ranksep","rankdir","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeSelfEdges","injectEdgeLabelProxies","offset","layers","assignRankMinMax","labelRank","removeEdgeLabelProxies","dummyChains","vRank","wRank","edgeLabel","points","edgeObj","normalizeEdge","postorderNums","pathData","lca","vPath","wPath","findPath","pathIdx","pathV","ascending","parentDummyChains","addBorderSegments","downLayerGraphs","upLayerGraphs","simpleNodes","orderedVs","initOrder","best","bestCC","lastBest","orderShift","selfEdge","insertSelfEdges","rankDir","rankSep","prevY","maxHeight","positionY","position","selfNode","positionSelfEdges","b","l","r","removeBorderNodes","origLabel","fixupEdgeLabelCoords","reverseY","swapXY","minX","maxX","minY","maxY","marginX","marginx","marginY","marginy","getExtremes","p","translateGraph","p1","p2","nodeV","nodeW","unshift","assignNodeIntersects","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","obj","newAttrs","findIndexFunc","fromIndex","toInteger","iterable","isArrayLike","keys","arrays","isArrayLikeObject","GRAPH_NODE","Graph","_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","freeze","incrementOrInitEntry","edgeObjToId","decrementOrRemoveEntry","outV","objectProto","guard","propsIndex","propsLength","comparator","current","computed"],"sourceRoot":""}
+{"version":3,"file":"chunks/4228.692fa030.js","mappings":"uLAqBA,QAVA,SAAiBA,EAAYC,GAC3B,IAAIC,GAAS,EACTC,GAAS,OAAYH,GAAcI,MAAMJ,EAAWK,QAAU,GAKlE,OAHA,OAASL,GAAY,SAASM,EAAOC,EAAKP,GACxCG,IAASD,GAASD,EAASK,EAAOC,EAAKP,EACzC,IACOG,CACT,C,yGC+BA,QAlCA,SAAiBK,EAAQC,EAAMH,EAAOI,GACpC,KAAK,EAAAC,EAAA,GAASH,GACZ,OAAOA,EAST,IALA,IAAIN,GAAS,EACTG,GAHJI,GAAO,OAASA,EAAMD,IAGJH,OACdO,EAAYP,EAAS,EACrBQ,EAASL,EAEI,MAAVK,KAAoBX,EAAQG,GAAQ,CACzC,IAAIE,GAAM,OAAME,EAAKP,IACjBY,EAAWR,EAEf,GAAY,cAARC,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAOC,EAGT,GAAIN,GAASU,EAAW,CACtB,IAAIG,EAAWF,EAAON,QAELS,KADjBF,EAAWJ,EAAaA,EAAWK,EAAUR,EAAKM,QAAUG,KAE1DF,GAAW,EAAAH,EAAA,GAASI,GAChBA,GACC,OAAQN,EAAKP,EAAQ,IAAM,GAAK,CAAC,EAE1C,EACA,OAAYW,EAAQN,EAAKO,GACzBD,EAASA,EAAON,EAClB,CACA,OAAOC,CACT,ECnBA,EAhBA,SAAoBA,EAAQS,EAAOC,GAKjC,IAJA,IAAIhB,GAAS,EACTG,EAASY,EAAMZ,OACfF,EAAS,CAAC,IAELD,EAAQG,GAAQ,CACvB,IAAII,EAAOQ,EAAMf,GACbI,GAAQ,OAAQE,EAAQC,GAExBS,EAAUZ,EAAOG,IACnB,EAAQN,GAAQ,OAASM,EAAMD,GAASF,EAE5C,CACA,OAAOH,CACT,C,mCCRA,QALA,SAAcgB,GACZ,IAAId,EAAkB,MAATc,EAAgB,EAAIA,EAAMd,OACvC,OAAOA,EAASc,EAAMd,EAAS,QAAKW,CACtC,C,uECYA,QALA,SAAkBV,GAChB,MAAuB,iBAATA,KACV,OAAQA,KAAU,OAAaA,IArBrB,oBAqB+B,OAAWA,EAC1D,C,mCC1BA,IAAIc,EAAe,KCEnB,IAAIC,EAAc,OAelB,QANA,SAAkBC,GAChB,OAAOA,EACHA,EAAOC,MAAM,EDHnB,SAAyBD,GAGvB,IAFA,IAAIpB,EAAQoB,EAAOjB,OAEZH,KAAWkB,EAAaI,KAAKF,EAAOG,OAAOvB,MAClD,OAAOA,CACT,CCFsB,CAAgBoB,GAAU,GAAGI,QAAQL,EAAa,IAClEC,CACN,E,0BCRIK,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAeC,SCdnB,IAAIC,EAAW,IAsCf,QAZA,SAAkB1B,GAChB,OAAKA,GAGLA,EDSF,SAAkBA,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,IAAI,EAAA2B,EAAA,GAAS3B,GACX,OA1CM,IA4CR,IAAI,EAAAK,EAAA,GAASL,GAAQ,CACnB,IAAI4B,EAAgC,mBAAjB5B,EAAM6B,QAAwB7B,EAAM6B,UAAY7B,EACnEA,GAAQ,EAAAK,EAAA,GAASuB,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAAT5B,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQ,EAASA,GACjB,IAAI8B,EAAWR,EAAWJ,KAAKlB,GAC/B,OAAQ8B,GAAYP,EAAUL,KAAKlB,GAC/BwB,EAAaxB,EAAMiB,MAAM,GAAIa,EAAW,EAAI,GAC3CT,EAAWH,KAAKlB,GAvDb,KAuD6BA,CACvC,CC5BU,CAASA,MACH0B,GAAY1B,KAAU,IA9BpB,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,C,kDCJA,QAPA,SAAmBA,GACjB,IAAIH,GAAS,OAASG,GAClB+B,EAAYlC,EAAS,EAEzB,OAAOA,GAAWA,EAAUkC,EAAYlC,EAASkC,EAAYlC,EAAU,CACzE,C,+DC9BImC,EAAY,EAwBhB,QALA,SAAkBC,GAChB,IAAIC,IAAOF,EACX,OAAO,OAASC,GAAUC,CAC5B,E,qCCxBIC,EAAaC,KAAKC,KAClBC,EAAYF,KAAKG,I,yBC2CrB,QCjCS,SAASC,EAAOC,EAAKC,GAa1B,OAZIA,GAAuB,iBAARA,IAAoB,OAAeF,EAAOC,EAAKC,KAChED,EAAMC,OAAOhC,GAGf8B,GAAQ,EAAAG,EAAA,GAASH,QACL9B,IAAR+B,GACFA,EAAMD,EACNA,EAAQ,GAERC,GAAM,EAAAE,EAAA,GAASF,GFPrB,SAAmBD,EAAOC,EAAKC,EAAME,GAKnC,IAJA,IAAIhD,GAAS,EACTG,EAASuC,EAAUH,GAAYM,EAAMD,IAAUE,GAAQ,IAAK,GAC5D7C,EAASC,MAAMC,GAEZA,KACLF,EAAO+C,EAAY7C,IAAWH,GAAS4C,EACvCA,GAASE,EAEX,OAAO7C,CACT,CEAW,CAAU2C,EAAOC,EADxBC,OAAgBhC,IAATgC,EAAsBF,EAAQC,EAAM,GAAK,GAAK,EAAAE,EAAA,GAASD,QDmBtD,ECjBV,E,eCnBF,MAAMG,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,IAAW,GA4CnC,SAASC,EAAWC,EAAGC,EAASC,EAASjB,EAAOkB,GAC9C,IAAIC,EAAUD,EAAsB,QAAK7D,EAwBzC,OAtBA,IAAU0D,EAAEK,QAAQpB,EAAMY,IAAI,SAAUS,GACtC,IAAIC,EAASP,EAAEM,KAAKA,GAChBE,EAASR,EAAES,KAAKH,EAAKT,GAErBM,GACFC,EAAQb,KAAK,CAAEM,EAAGS,EAAKT,EAAGa,EAAGJ,EAAKI,IAGpCF,EAAOG,KAAOJ,EACdK,EAAaX,EAASC,EAASM,EACjC,IAEA,IAAUR,EAAEa,SAAS5B,EAAMY,IAAI,SAAUS,GACvC,IAAIC,EAASP,EAAEM,KAAKA,GAChBI,EAAIJ,EAAKI,EACTI,EAASd,EAAES,KAAKC,GACpBI,EAAW,IAAKP,EAChBK,EAAaX,EAASC,EAASY,EACjC,IAEAd,EAAED,WAAWd,EAAMY,GAEZO,CACT,CAkCA,SAASQ,EAAaX,EAASC,EAASjB,GACjCA,EAAM0B,IAEC1B,EAAU,GAGpBgB,EAAQhB,EAAM0B,IAAM1B,EAAU,GAAIiB,GAASf,QAAQF,GAFnDgB,EAAQA,EAAQtE,OAAS,GAAGwD,QAAQF,GAFpCgB,EAAQ,GAAGd,QAAQF,EAMvB,CCxHA,SAAS8B,EAAIf,GACX,IAAIgB,EAA8B,WAAxBhB,EAAEiB,QAAQC,UDStB,SAAmBlB,EAAGmB,GACpB,GAAInB,EAAEoB,aAAe,EACnB,MAAO,GAET,IAAIC,EAkEN,SAAoBrB,EAAGmB,GACrB,IAAIG,EAAW,IAAI,IACfC,EAAQ,EACRC,EAAS,EAEb,IAAUxB,EAAEyB,SAAS,SAAU5B,GAC7ByB,EAASI,QAAQ7B,EAAG,CAAEA,EAAGA,EAAG8B,GAAI,EAAGhB,IAAK,GAC1C,IAIA,IAAUX,EAAE4B,SAAS,SAAUC,GAC7B,IAAIC,EAAaR,EAAShB,KAAKuB,EAAEhC,EAAGgC,EAAEnB,IAAM,EACxCH,EAASY,EAASU,GAClBE,EAAaD,EAAavB,EAC9Be,EAASU,QAAQH,EAAEhC,EAAGgC,EAAEnB,EAAGqB,GAC3BP,EAASxD,KAAKG,IAAIqD,EAASF,EAASb,KAAKoB,EAAEhC,GAAGc,KAAOJ,GACrDgB,EAAQvD,KAAKG,IAAIoD,EAAQD,EAASb,KAAKoB,EAAEnB,GAAO,IAAKH,EACvD,IAEA,IAAIN,EAAU,EAAQuB,EAASD,EAAQ,GAAGU,KAAI,WAC5C,OAAO,IAAIxD,CACb,IACIyB,EAAUqB,EAAQ,EAMtB,OAJA,IAAUD,EAASG,SAAS,SAAU5B,GACpCe,EAAaX,EAASC,EAASoB,EAASb,KAAKZ,GAC/C,IAEO,CAAEoB,MAAOK,EAAUrB,QAASA,EAASC,QAASA,EACvD,CAhGcgC,CAAWlC,EAAGmB,GAAYrB,GAClCM,EAUN,SAAqBJ,EAAGC,EAASC,GAM/B,IALA,IAIIjB,EAJAmB,EAAU,GACV+B,EAAUlC,EAAQA,EAAQtE,OAAS,GACnCyG,EAAQnC,EAAQ,GAGbD,EAAEoB,aAAa,CACpB,KAAQnC,EAAQmD,EAAMpD,WACpBe,EAAWC,EAAGC,EAASC,EAASjB,GAElC,KAAQA,EAAQkD,EAAQnD,WACtBe,EAAWC,EAAGC,EAASC,EAASjB,GAElC,GAAIe,EAAEoB,YACJ,IAAK,IAAIiB,EAAIpC,EAAQtE,OAAS,EAAG0G,EAAI,IAAKA,EAExC,GADApD,EAAQgB,EAAQoC,GAAGrD,UACR,CACToB,EAAUA,EAAQkC,OAAOvC,EAAWC,EAAGC,EAASC,EAASjB,GAAO,IAChE,KACF,CAGN,CAEA,OAAOmB,CACT,CAnCgBmC,CAAYlB,EAAMJ,MAAOI,EAAMpB,QAASoB,EAAMnB,SAG5D,OAAO,IACL,IAAME,GAAS,SAAUyB,GACvB,OAAO7B,EAAEa,SAASgB,EAAEhC,EAAGgC,EAAEnB,EAC3B,IAEJ,CCtB+C8B,CAAUxC,EASvD,SAAkBA,GAChB,OAAO,SAAU6B,GACf,OAAO7B,EAAEM,KAAKuB,GAAGtB,MACnB,CACF,CAb0DY,CAASnB,IAgBrE,SAAgBA,GACd,IAAIgB,EAAM,GACNyB,EAAQ,CAAC,EACTC,EAAU,CAAC,EAmBf,OADA,IAAU1C,EAAEyB,SAhBZ,SAASkB,EAAI9C,GACP+C,OAAOC,UAAUC,eAAeC,KAAKL,EAAS7C,KAGlD6C,EAAQ7C,IAAK,EACb4C,EAAM5C,IAAK,EACX,IAAUG,EAAEa,SAAShB,IAAI,SAAUgC,GAC7Be,OAAOC,UAAUC,eAAeC,KAAKN,EAAOZ,EAAEnB,GAChDM,EAAIzB,KAAKsC,GAETc,EAAId,EAAEnB,EAEV,WACO+B,EAAM5C,GACf,IAGOmB,CACT,CAvC2EgC,CAAOhD,GAChF,IAAUgB,GAAK,SAAUa,GACvB,IAAIoB,EAAQjD,EAAEM,KAAKuB,GACnB7B,EAAEkD,WAAWrB,GACboB,EAAME,YAActB,EAAEuB,KACtBH,EAAMI,UAAW,EACjBrD,EAAEgC,QAAQH,EAAEnB,EAAGmB,EAAEhC,EAAGoD,EAAO,EAAW,OACxC,GAOF,C,8DCIA,SCbkBK,EDSE,SAASxH,EAAQS,GACnC,OAAiB,MAAVT,EAAiB,CAAC,EET3B,SAAkBA,EAAQS,GACxB,OAAO,OAAWT,EAAQS,GAAO,SAASX,EAAOG,GAC/C,OAAO,EAAAwH,EAAA,GAAMzH,EAAQC,EACvB,GACF,CFK+B,CAASD,EAAQS,EAChD,GCVS,QAAY,OAAS+G,OAAMhH,EAAWkH,EAAA,GAAUF,EAAO,KADhE,IAAkBA,E,sBEElB,QAJA,SAAgB1H,EAAO4B,GACrB,OAAO5B,EAAQ4B,CACjB,E,eCiBA,QANA,SAAaf,GACX,OAAQA,GAASA,EAAMd,QACnB,OAAac,EAAOgH,EAAA,EAAU,QAC9BnH,CACN,E,gDCgBA,QAVA,SAAmBR,EAAQP,GACzB,IAAIE,EAAS,CAAC,EAMd,OALAF,GAAW,OAAaA,EAAU,IAElC,OAAWO,GAAQ,SAASF,EAAOC,EAAKC,IACtC,OAAgBL,EAAQI,EAAKN,EAASK,EAAOC,EAAKC,GACpD,IACOL,CACT,E,gDClBA,QAJU,WACR,OAAO,IAAKiI,KAAKC,KACnB,ECGA,SAASC,EAAa5D,EAAG6D,EAAMC,EAAOV,GACpC,IAAIvD,EACJ,GACEA,EAAI,EAAWuD,SACRpD,EAAE+D,QAAQlE,IAInB,OAFAiE,EAAME,MAAQH,EACd7D,EAAE0B,QAAQ7B,EAAGiE,GACNjE,CACT,CAsBA,SAASoE,EAAmBjE,GAC1B,IAAIkE,EAAa,IAAI,IAAM,CAAEC,WAAYnE,EAAEoE,iBAAkBC,SAASrE,EAAEiB,SASxE,OARA,IAAUjB,EAAEyB,SAAS,SAAU5B,GACxBG,EAAEsE,SAASzE,GAAGlE,QACjBuI,EAAWxC,QAAQ7B,EAAGG,EAAES,KAAKZ,GAEjC,IACA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7BqC,EAAWlC,QAAQH,EAAG7B,EAAEM,KAAKuB,GAC/B,IACOqC,CACT,CA4BA,SAASK,EAAcC,EAAMC,GAC3B,IAcIC,EAAIC,EAdJC,EAAIJ,EAAKI,EACTC,EAAIL,EAAKK,EAITC,EAAKL,EAAMG,EAAIA,EACfG,EAAKN,EAAMI,EAAIA,EACfnE,EAAI8D,EAAKQ,MAAQ,EACjBC,EAAIT,EAAKU,OAAS,EAEtB,IAAKJ,IAAOC,EACV,MAAM,IAAII,MAAM,6DAoBlB,OAhBInH,KAAKoH,IAAIL,GAAMrE,EAAI1C,KAAKoH,IAAIN,GAAMG,GAEhCF,EAAK,IACPE,GAAKA,GAEPP,EAAMO,EAAIH,EAAMC,EAChBJ,EAAKM,IAGDH,EAAK,IACPpE,GAAKA,GAEPgE,EAAKhE,EACLiE,EAAMjE,EAAIqE,EAAMD,GAGX,CAAEF,EAAGA,EAAIF,EAAIG,EAAGA,EAAIF,EAC7B,CAMA,SAASU,EAAiBrF,GACxB,IAAIsF,EAAW,IAAM,EAAQ,EAAQtF,GAAK,IAAI,WAC5C,MAAO,EACT,IAQA,OAPA,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GACd0F,EAAO9E,EAAK8E,KACX,IAAcA,KACjBD,EAASC,GAAM9E,EAAK+E,OAAS3F,EAEjC,IACOyF,CACT,CAkDA,SAASG,EAAczF,EAAGnC,EAAQ0H,EAAMC,GACtC,IAAI/E,EAAO,CACTuE,MAAO,EACPE,OAAQ,GAMV,OAJIQ,UAAU/J,QAAU,IACtB8E,EAAK8E,KAAOA,EACZ9E,EAAK+E,MAAQA,GAER5B,EAAa5D,EAAG,SAAUS,EAAM5C,EACzC,CAEA,SAAS,EAAQmC,GACf,OAAO,EACL,IAAMA,EAAEyB,SAAS,SAAU5B,GACzB,IAAI0F,EAAOvF,EAAES,KAAKZ,GAAG0F,KACrB,IAAK,IAAcA,GACjB,OAAOA,CAEX,IAEJ,CAuBA,SAAS,EAAKnC,EAAMuC,GAClB,IAAIvH,EAAQ,IACZ,IACE,OAAOuH,GACT,CAAE,QACAC,QAAQC,IAAIzC,EAAO,WAAa,IAAUhF,GAAS,KACrD,CACF,CAEA,SAAS0H,EAAO1C,EAAMuC,GACpB,OAAOA,GACT,CC/NA,SAAS,EAAc3F,EAAG+F,EAAMlI,EAAQmI,EAAIC,EAAQV,GAClD,IAAItC,EAAQ,CAAE+B,MAAO,EAAGE,OAAQ,EAAGK,KAAMA,EAAMW,WAAYH,GACvDI,EAAOF,EAAOF,GAAMR,EAAO,GAC3BjG,EAAO,EAAkBU,EAAG,SAAUiD,EAAOpF,GACjDoI,EAAOF,GAAMR,GAAQjG,EACrBU,EAAEoG,UAAU9G,EAAM0G,GACdG,GACFnG,EAAEgC,QAAQmE,EAAM7G,EAAM,CAAEiB,OAAQ,GAEpC,CCZA,SAAS8F,GAAgBrG,GACvB,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7ByG,GAAmBtG,EAAES,KAAKZ,GAC5B,IACA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7ByE,GAAmBtG,EAAEM,KAAKuB,GAC5B,GACF,CAEA,SAASyE,GAAmBxC,GAC1B,IAAIpD,EAAIoD,EAAMkB,MACdlB,EAAMkB,MAAQlB,EAAMoB,OACpBpB,EAAMoB,OAASxE,CACjB,CAgBA,SAAS6F,GAAYzC,GACnBA,EAAMe,GAAKf,EAAMe,CACnB,CAgBA,SAAS2B,GAAU1C,GACjB,IAAIc,EAAId,EAAMc,EACdd,EAAMc,EAAId,EAAMe,EAChBf,EAAMe,EAAID,CACZ,C,gBCzCA,SANA,SAAenI,EAAOlB,GACpB,OAAQkB,GAASA,EAAMd,QACnB,OAAac,GAAO,OAAalB,EAAU,GAAI,WAC/Ce,CACN,ECNA,SAASmK,GAAYzG,GACnB,IAAI0C,EAAU,CAAC,EA2Bf,IAAU1C,EAAEmC,WAzBZ,SAASQ,EAAI9C,GACX,IAAIoD,EAAQjD,EAAES,KAAKZ,GACnB,GAAI+C,OAAOC,UAAUC,eAAeC,KAAKL,EAAS7C,GAChD,OAAOoD,EAAMsC,KAEf7C,EAAQ7C,IAAK,EAEb,IAAI0F,EAAO,IACT,IAAMvF,EAAEa,SAAShB,IAAI,SAAUgC,GAC7B,OAAOc,EAAId,EAAEnB,GAAKV,EAAEM,KAAKuB,GAAG6E,MAC9B,KAYF,OAREnB,IAASoB,OAAOC,mBAAhBrB,MACAA,IAIAA,EAAO,GAGDtC,EAAMsC,KAAOA,CACvB,GAGF,CAMA,SAASsB,GAAM7G,EAAG6B,GAChB,OAAO7B,EAAES,KAAKoB,EAAEnB,GAAG6E,KAAOvF,EAAES,KAAKoB,EAAEhC,GAAG0F,KAAOvF,EAAEM,KAAKuB,GAAG6E,MACzD,CC/BA,SAASI,GAAa9G,GACpB,IAOIM,EAAMyG,EAPNC,EAAI,IAAI,IAAM,CAAEC,UAAU,IAG1B7I,EAAQ4B,EAAEyB,QAAQ,GAClByF,EAAOlH,EAAEoB,YAIb,IAHA4F,EAAEtF,QAAQtD,EAAO,CAAC,GAGX+I,GAAUH,EAAGhH,GAAKkH,GACvB5G,EAAO8G,GAAiBJ,EAAGhH,GAC3B+G,EAAQC,EAAEjD,QAAQzD,EAAKT,GAAKgH,GAAM7G,EAAGM,IAASuG,GAAM7G,EAAGM,GACvD+G,GAAWL,EAAGhH,EAAG+G,GAGnB,OAAOC,CACT,CAMA,SAASG,GAAUH,EAAGhH,GAcpB,OADA,IAAUgH,EAAEvF,SAZZ,SAASkB,EAAI9C,GACX,IAAUG,EAAEsH,UAAUzH,IAAI,SAAUgC,GAClC,IAAI0F,EAAQ1F,EAAEhC,EACZa,EAAIb,IAAM0H,EAAQ1F,EAAEnB,EAAI6G,EACrBP,EAAEjD,QAAQrD,IAAOmG,GAAM7G,EAAG6B,KAC7BmF,EAAEtF,QAAQhB,EAAG,CAAC,GACdsG,EAAEhF,QAAQnC,EAAGa,EAAG,CAAC,GACjBiC,EAAIjC,GAER,GACF,IAGOsG,EAAE5F,WACX,CAMA,SAASgG,GAAiBJ,EAAGhH,GAC3B,OAAO,GAAQA,EAAE4B,SAAS,SAAUC,GAClC,GAAImF,EAAEjD,QAAQlC,EAAEhC,KAAOmH,EAAEjD,QAAQlC,EAAEnB,GACjC,OAAOmG,GAAM7G,EAAG6B,EAEpB,GACF,CAEA,SAASwF,GAAWL,EAAGhH,EAAG+G,GACxB,IAAUC,EAAEvF,SAAS,SAAU5B,GAC7BG,EAAES,KAAKZ,GAAG0F,MAAQwB,CACpB,GACF,C,4BCjF0B,IAAW,GCDX,IAAW,G,qCCKrB,E,SAAA,GAAa,UCGVS,OAAO,uFCX1B,IAAI,GAAgB,kBAQhBC,GAAW,IAAM,GAAgB,IACjCC,GAAU,kDACVC,GAAS,2BAETC,GAAc,KAAO,GAAgB,IACrCC,GAAa,kCACbC,GAAa,qCAIbC,GAPa,MAAQL,GAAU,IAAMC,GAO1BK,KACXC,GAAW,oBAEXC,GAAQD,GAAWF,GADP,gBAAwB,CAACH,GAAaC,GAAYC,IAAYnI,KAAK,KAAO,IAAMsI,GAAWF,GAAW,KAElHI,GAAW,MAAQ,CAACP,GAAcF,GAAU,IAAKA,GAASG,GAAYC,GAAYL,IAAU9H,KAAK,KAAO,IAG5F6H,OAAOG,GAAS,MAAQA,GAAS,KAAOQ,GAAWD,GAAO,KCS/C,IAAI/C,M,gBCvB/B,SAASxC,GAAI3C,EAAGoI,EAAI5C,GACb,KAAU4C,KACbA,EAAK,CAACA,IAGR,IAAIC,GAAcrI,EAAEsI,aAAetI,EAAEuI,WAAavI,EAAEwI,WAAWC,KAAKzI,GAEhE0I,EAAM,GACNhG,EAAU,CAAC,EAQf,OAPA,IAAO0F,GAAI,SAAUvI,GACnB,IAAKG,EAAE+D,QAAQlE,GACb,MAAM,IAAIsF,MAAM,6BAA+BtF,GAGjD8I,GAAM3I,EAAGH,EAAa,SAAV2F,EAAkB9C,EAAS2F,EAAYK,EACrD,IACOA,CACT,CAEA,SAASC,GAAM3I,EAAGH,EAAG+I,EAAWlG,EAAS2F,EAAYK,GAC9C9F,OAAOC,UAAUC,eAAeC,KAAKL,EAAS7C,KACjD6C,EAAQ7C,IAAK,EAER+I,GACHF,EAAInJ,KAAKM,GAEX,IAAOwI,EAAWxI,IAAI,SAAUa,GAC9BiI,GAAM3I,EAAGU,EAAGkI,EAAWlG,EAAS2F,EAAYK,EAC9C,IACIE,GACFF,EAAInJ,KAAKM,GAGf,CCIA,SAASgJ,GAAe7I,GACtBA,EbZF,SAAkBA,GAChB,IAAIkE,GAAa,IAAI,KAAQG,SAASrE,EAAEiB,SAYxC,OAXA,IAAUjB,EAAEyB,SAAS,SAAU5B,GAC7BqE,EAAWxC,QAAQ7B,EAAGG,EAAES,KAAKZ,GAC/B,IACA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7B,IAAIiH,EAAc5E,EAAW5D,KAAKuB,EAAEhC,EAAGgC,EAAEnB,IAAM,CAAEH,OAAQ,EAAGmG,OAAQ,GAChEzD,EAAQjD,EAAEM,KAAKuB,GACnBqC,EAAWlC,QAAQH,EAAEhC,EAAGgC,EAAEnB,EAAG,CAC3BH,OAAQuI,EAAYvI,OAAS0C,EAAM1C,OACnCmG,OAAQ1I,KAAKG,IAAI2K,EAAYpC,OAAQzD,EAAMyD,SAE/C,IACOxC,CACT,CaFM6E,CAAS/I,GACbyG,GAAYzG,GACZ,IAII6B,EAJAmF,EAAIF,GAAa9G,GAKrB,IAJAgJ,GAAiBhC,GACjBiC,GAAcjC,EAAGhH,GAGT6B,EAAIqH,GAAUlC,IAEpBmC,GAAcnC,EAAGhH,EAAG6B,EADhBuH,GAAUpC,EAAGhH,EAAG6B,GAGxB,CAKA,SAASoH,GAAcjC,EAAGhH,GACxB,IAAIoI,EC/DN,SAAmBpI,EAAGoI,GACpB,OAAOzF,GAAI3C,EAAGoI,EAAI,OACpB,CD6DW,CAAcpB,EAAGA,EAAEvF,SAC5B2G,EAAKA,EAAGvL,MAAM,EAAGuL,EAAGzM,OAAS,GAC7B,IAAUyM,GAAI,SAAUvI,IAK1B,SAAwBmH,EAAGhH,EAAGqJ,GAC5B,IACIC,EADWtC,EAAEvG,KAAK4I,GACAC,OACtBtC,EAAE1G,KAAK+I,EAAOC,GAAQC,SAAWC,GAAaxC,EAAGhH,EAAGqJ,EACtD,CARII,CAAezC,EAAGhH,EAAGH,EACvB,GACF,CAYA,SAAS2J,GAAaxC,EAAGhH,EAAGqJ,GAC1B,IACIC,EADWtC,EAAEvG,KAAK4I,GACAC,OAElBI,GAAc,EAEdC,EAAY3J,EAAEM,KAAK+I,EAAOC,GAE1BM,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAY3J,EAAEM,KAAKgJ,EAAQD,IAG7BO,EAAWD,EAAUpJ,OAErB,IAAUP,EAAEsH,UAAU+B,IAAQ,SAAUxH,GACtC,IA2HsBgI,EAAGhK,EA3HrBiK,EAAYjI,EAAEhC,IAAMwJ,EACtB7L,EAAQsM,EAAYjI,EAAEnB,EAAImB,EAAEhC,EAE9B,GAAIrC,IAAU8L,EAAQ,CACpB,IAAIS,EAAeD,IAAcJ,EAC/BM,EAAchK,EAAEM,KAAKuB,GAAGtB,OAG1B,GADAqJ,GAAYG,EAAeC,GAAeA,EAoHtBH,EAnHFR,EAmHKxJ,EAnHErC,EAAVwJ,EAoHPiD,QAAQJ,EAAGhK,GApHc,CAC/B,IAAIqK,EAAgBlD,EAAE1G,KAAK+I,EAAO7L,GAAO+L,SACzCK,GAAYG,GAAgBG,EAAgBA,CAC9C,CACF,CACF,IAEON,CACT,CAEA,SAASZ,GAAiBmB,EAAMC,GAC1B1E,UAAU/J,OAAS,IACrByO,EAAOD,EAAK1I,QAAQ,IAEtB4I,GAAgBF,EAAM,CAAC,EAAG,EAAGC,EAC/B,CAEA,SAASC,GAAgBF,EAAMzH,EAAS4H,EAASzK,EAAGyJ,GAClD,IAAIiB,EAAMD,EACNrH,EAAQkH,EAAK1J,KAAKZ,GAkBtB,OAhBA6C,EAAQ7C,IAAK,EACb,IAAUsK,EAAK3B,UAAU3I,IAAI,SAAUa,GAChCkC,OAAOC,UAAUC,eAAeC,KAAKL,EAAShC,KACjD4J,EAAUD,GAAgBF,EAAMzH,EAAS4H,EAAS5J,EAAGb,GAEzD,IAEAoD,EAAMsH,IAAMA,EACZtH,EAAMuH,IAAMF,IACRhB,EACFrG,EAAMqG,OAASA,SAGRrG,EAAMqG,OAGRgB,CACT,CAEA,SAASpB,GAAUiB,GACjB,OAAO,KAAOA,EAAKvI,SAAS,SAAUC,GACpC,OAAOsI,EAAK7J,KAAKuB,GAAG0H,SAAW,CACjC,GACF,CAEA,SAASH,GAAUpC,EAAGhH,EAAGM,GACvB,IAAIT,EAAIS,EAAKT,EACTa,EAAIJ,EAAKI,EAKRV,EAAEiK,QAAQpK,EAAGa,KAChBb,EAAIS,EAAKI,EACTA,EAAIJ,EAAKT,GAGX,IAAI4K,EAASzD,EAAEvG,KAAKZ,GAChB6K,EAAS1D,EAAEvG,KAAKC,GAChBiK,EAAYF,EACZG,GAAO,EAIPH,EAAOD,IAAME,EAAOF,MACtBG,EAAYD,EACZE,GAAO,GAGT,IAAIC,EAAa,KAAS7K,EAAE4B,SAAS,SAAUtB,GAC7C,OACEsK,IAASE,GAAa9D,EAAGA,EAAEvG,KAAKH,EAAKT,GAAI8K,IACzCC,IAASE,GAAa9D,EAAGA,EAAEvG,KAAKH,EAAKI,GAAIiK,EAE7C,IAEA,OAAO,GAAQE,GAAY,SAAUvK,GACnC,OAAOuG,GAAM7G,EAAGM,EAClB,GACF,CAEA,SAAS6I,GAAcnC,EAAGhH,EAAG6B,EAAGkJ,GAC9B,IAAIlL,EAAIgC,EAAEhC,EACNa,EAAImB,EAAEnB,EACVsG,EAAE9D,WAAWrD,EAAGa,GAChBsG,EAAEhF,QAAQ+I,EAAElL,EAAGkL,EAAErK,EAAG,CAAC,GACrBsI,GAAiBhC,GACjBiC,GAAcjC,EAAGhH,GAInB,SAAqBgH,EAAGhH,GACtB,IAAIoK,EAAO,KAAOpD,EAAEvF,SAAS,SAAU5B,GACrC,OAAQG,EAAES,KAAKZ,GAAGyJ,MACpB,IACIlB,EE1MN,SAAkBpI,EAAGoI,GACnB,OAAOzF,GAAI3C,EAAGoI,EAAI,MACpB,CFwMW,CAAapB,EAAGoD,GACzBhC,EAAKA,EAAGvL,MAAM,GACd,IAAUuL,GAAI,SAAUvI,GACtB,IAAIyJ,EAAStC,EAAEvG,KAAKZ,GAAGyJ,OACrBhJ,EAAON,EAAEM,KAAKT,EAAGyJ,GACjB0B,GAAU,EAEP1K,IACHA,EAAON,EAAEM,KAAKgJ,EAAQzJ,GACtBmL,GAAU,GAGZhL,EAAES,KAAKZ,GAAG0F,KAAOvF,EAAES,KAAK6I,GAAQ/D,MAAQyF,EAAU1K,EAAKoG,QAAUpG,EAAKoG,OACxE,GACF,CArBEuE,CAAYjE,EAAGhH,EACjB,CAiCA,SAAS8K,GAAaX,EAAMM,EAAQS,GAClC,OAAOA,EAAUX,KAAOE,EAAOD,KAAOC,EAAOD,KAAOU,EAAUV,GAChE,CGlNA,SAASjF,GAAKvF,GACZ,OAAQA,EAAEiB,QAAQkK,QAChB,IAAK,kBASL,SAaJ,SAA8BnL,GAC5B6I,GAAe7I,EACjB,CAdMoL,CAAqBpL,SAPvB,IAAK,cAcT,SAAyBA,GACvByG,GAAYzG,GACZ8G,GAAa9G,EACf,CAhBMqL,CAAgBrL,GAChB,MACF,IAAK,eACHsL,GAAkBtL,GAKxB,C,SH9BA6I,GAAeG,iBAAmBA,GAClCH,GAAeI,cAAgBA,GAC/BJ,GAAeW,aAAeA,GAC9BX,GAAeK,UAAYA,GAC3BL,GAAeO,UAAYA,GAC3BP,GAAeM,cAAgBA,GG4B/B,IAAImC,GAAoB7E,G,4BCdxB,SAAS,GAAIzG,GACX,IAAIoK,EAAO,EAAkBpK,EAAG,OAAQ,CAAC,EAAG,SACxCuL,EAqEN,SAAoBvL,GAClB,IAAIuL,EAAS,CAAC,EACd,SAAS5I,EAAI9C,EAAG2L,GACd,IAAIlH,EAAWtE,EAAEsE,SAASzE,GACtByE,GAAYA,EAAS3I,QACvB,IAAU2I,GAAU,SAAU+E,GAC5B1G,EAAI0G,EAAOmC,EAAQ,EACrB,IAEFD,EAAO1L,GAAK2L,CACd,CAIA,OAHA,IAAUxL,EAAEsE,YAAY,SAAUzE,GAChC8C,EAAI9C,EAAG,EACT,IACO0L,CACT,CApFeE,CAAWzL,GACpBkF,EAAS,EAAM,KAASqG,IAAW,EACnCG,EAAU,EAAIxG,EAAS,EAE3BlF,EAAEiB,QAAQ0K,YAAcvB,EAGxB,IAAUpK,EAAE4B,SAAS,SAAUC,GAC7B7B,EAAEM,KAAKuB,GAAG6E,QAAUgF,CACtB,IAGA,IAAInL,EA0EN,SAAoBP,GAClB,OAAO,KACLA,EAAE4B,SACF,SAAU8G,EAAK7G,GACb,OAAO6G,EAAM1I,EAAEM,KAAKuB,GAAGtB,MACzB,GACA,EAEJ,CAlFeqL,CAAW5L,GAAK,EAG7B,IAAUA,EAAEsE,YAAY,SAAU+E,GAChC,GAAIrJ,EAAGoK,EAAMsB,EAASnL,EAAQ2E,EAAQqG,EAAQlC,EAChD,IAIArJ,EAAEiB,QAAQ4K,eAAiBH,CAC7B,CAEA,SAAS,GAAI1L,EAAGoK,EAAMsB,EAASnL,EAAQ2E,EAAQqG,EAAQ1L,GACrD,IAAIyE,EAAWtE,EAAEsE,SAASzE,GAC1B,GAAKyE,EAAS3I,OAAd,CAOA,IAAImQ,EAAM,EAAmB9L,EAAG,OAC5B+L,EAAS,EAAmB/L,EAAG,OAC/BiD,EAAQjD,EAAES,KAAKZ,GAEnBG,EAAEoG,UAAU0F,EAAKjM,GACjBoD,EAAM+I,UAAYF,EAClB9L,EAAEoG,UAAU2F,EAAQlM,GACpBoD,EAAMgJ,aAAeF,EAErB,IAAUzH,GAAU,SAAU+E,GAC5B,GAAIrJ,EAAGoK,EAAMsB,EAASnL,EAAQ2E,EAAQqG,EAAQlC,GAE9C,IAAI6C,EAAYlM,EAAES,KAAK4I,GACnB8C,EAAWD,EAAUF,UAAYE,EAAUF,UAAY3C,EACvD+C,EAAcF,EAAUD,aAAeC,EAAUD,aAAe5C,EAChEgD,EAAaH,EAAUF,UAAYzL,EAAS,EAAIA,EAChDmG,EAASyF,IAAaC,EAAc,EAAIlH,EAASqG,EAAO1L,GAAK,EAEjEG,EAAEgC,QAAQ8J,EAAKK,EAAU,CACvB5L,OAAQ8L,EACR3F,OAAQA,EACR4F,aAAa,IAGftM,EAAEgC,QAAQoK,EAAaL,EAAQ,CAC7BxL,OAAQ8L,EACR3F,OAAQA,EACR4F,aAAa,GAEjB,IAEKtM,EAAEsJ,OAAOzJ,IACZG,EAAEgC,QAAQoI,EAAM0B,EAAK,CAAEvL,OAAQ,EAAGmG,OAAQxB,EAASqG,EAAO1L,IAlC5D,MAJMA,IAAMuK,GACRpK,EAAEgC,QAAQoI,EAAMvK,EAAG,CAAEU,OAAQ,EAAGmG,OAAQgF,GAuC9C,C,gBCrEA,SAJA,SAAmB9P,GACjB,OAAO,QAAUA,EAAO2Q,EAC1B,E,gBCJA,MCCA,GAJA,SAAmBC,EAAOC,GACxB,ODXF,SAAuBD,EAAOC,EAAQC,GAMpC,IALA,IAAIlR,GAAS,EACTG,EAAS6Q,EAAM7Q,OACfgR,EAAaF,EAAO9Q,OACpBF,EAAS,CAAC,IAELD,EAAQG,GAAQ,CACvB,IAAIC,EAAQJ,EAAQmR,EAAaF,EAAOjR,QAASc,EACjDoQ,EAAWjR,EAAQ+Q,EAAMhR,GAAQI,EACnC,CACA,OAAOH,CACT,CCAS,CAAc+Q,GAAS,GAAIC,GAAU,GAAI,KAClD,E,gFCmBA,SA9BA,SAA0B7Q,EAAO4B,GAC/B,GAAI5B,IAAU4B,EAAO,CACnB,IAAIoP,OAAyBtQ,IAAVV,EACfiR,EAAsB,OAAVjR,EACZkR,EAAiBlR,GAAUA,EAC3BmR,GAAc,EAAAxP,GAAA,GAAS3B,GAEvBoR,OAAyB1Q,IAAVkB,EACfyP,EAAsB,OAAVzP,EACZ0P,EAAiB1P,GAAUA,EAC3B2P,GAAc,EAAA5P,GAAA,GAASC,GAE3B,IAAMyP,IAAcE,IAAgBJ,GAAenR,EAAQ4B,GACtDuP,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAevR,EAAQ4B,GACtD2P,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,ECUA,GA7BA,SAAqB5R,EAAY8R,EAAWC,GAExCD,EADEA,EAAUzR,QACA,QAASyR,GAAW,SAAS7R,GACvC,OAAI,EAAA+R,GAAA,GAAQ/R,GACH,SAASK,GACd,OAAO,QAAQA,EAA2B,IAApBL,EAASI,OAAeJ,EAAS,GAAKA,EAC9D,EAEKA,CACT,IAEY,CAACkI,EAAA,GAGf,IAAIjI,GAAS,EAUb,OATA4R,GAAY,QAASA,GAAW,QAAU,MCxB5C,SAAoB3Q,EAAO8Q,GACzB,IAAI5R,EAASc,EAAMd,OAGnB,IADAc,EAAM+Q,KAAKD,GACJ5R,KACLc,EAAMd,GAAUc,EAAMd,GAAQC,MAEhC,OAAOa,CACT,CDyBS,EAPM,QAAQnB,GAAY,SAASM,EAAOC,EAAKP,GAIpD,MAAO,CAAE,UAHM,QAAS8R,GAAW,SAAS7R,GAC1C,OAAOA,EAASK,EAClB,IAC+B,QAAWJ,EAAO,MAASI,EAC5D,KAE0B,SAASE,EAAQ0B,GACzC,OE5BJ,SAAyB1B,EAAQ0B,EAAO6P,GAOtC,IANA,IAAI7R,GAAS,EACTiS,EAAc3R,EAAO4R,SACrBC,EAAcnQ,EAAMkQ,SACpB/R,EAAS8R,EAAY9R,OACrBiS,EAAeP,EAAO1R,SAEjBH,EAAQG,GAAQ,CACvB,IAAIF,EAAS,GAAiBgS,EAAYjS,GAAQmS,EAAYnS,IAC9D,GAAIC,EACF,OAAID,GAASoS,EACJnS,EAGFA,GAAmB,QADd4R,EAAO7R,IACiB,EAAI,EAE5C,CAQA,OAAOM,EAAON,MAAQgC,EAAMhC,KAC9B,CFGW,CAAgBM,EAAQ0B,EAAO6P,EACxC,GACF,EGCA,IAba,E,SAAA,IAAS,SAAS/R,EAAY8R,GACzC,GAAkB,MAAd9R,EACF,MAAO,GAET,IAAIK,EAASyR,EAAUzR,OAMvB,OALIA,EAAS,IAAK,OAAeL,EAAY8R,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHzR,EAAS,IAAK,OAAeyR,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElB,GAAY9R,GAAY,QAAY8R,EAAW,GAAI,GAC5D,ICzBA,SAASS,GAAW7N,EAAGsF,GAErB,IADA,IAAIwI,EAAK,EACAzL,EAAI,EAAGA,EAAIiD,EAAS3J,SAAU0G,EACrCyL,GAAMC,GAAmB/N,EAAGsF,EAASjD,EAAI,GAAIiD,EAASjD,IAExD,OAAOyL,CACT,CAEA,SAASC,GAAmB/N,EAAGgO,EAAYC,GAuBzC,IAnBA,IAAIC,EAAW,GACbD,EACA,IAAMA,GAAY,SAAUpO,EAAGwC,GAC7B,OAAOA,CACT,KAEE8L,EAAe,IACjB,IAAMH,GAAY,SAAUnO,GAC1B,OAAO,GACL,IAAMG,EAAEa,SAAShB,IAAI,SAAUgC,GAC7B,MAAO,CAAEuM,IAAKF,EAASrM,EAAEnB,GAAIH,OAAQP,EAAEM,KAAKuB,GAAGtB,OACjD,IACA,MAEJ,KAIE8N,EAAa,EACVA,EAAaJ,EAAWtS,QAAQ0S,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIlE,EAAO,IAAM,IAAIzO,MAAM4S,IAAW,WACpC,OAAO,CACT,IAGIR,EAAK,EAqBT,OApBA,IAEEK,EAAaI,SAAQ,SAAUtP,GAC7B,IAAIzD,EAAQyD,EAAMmP,IAAMC,EACxBlE,EAAK3O,IAAUyD,EAAMsB,OAGrB,IAFA,IAAIiO,EAAY,EAEThT,EAAQ,GAETA,EAAQ,IACVgT,GAAarE,EAAK3O,EAAQ,IAI5B2O,EADA3O,EAASA,EAAQ,GAAM,IACRyD,EAAMsB,OAEvBuN,GAAM7O,EAAMsB,OAASiO,CACvB,KAGKV,CACT,CC5EA,SAASN,GAAKiB,EAASC,GACrB,IA0CuBC,EA1CnBC,E3BwNN,SAAmBtT,GACjB,IAAIG,EAAS,CAAEoT,IAAK,GAAIC,IAAK,IAQ7B,OAPA,IAAUxT,GAAY,SAAUM,G2B1NI,IAAUqD,I3B2NrCrD,E2B1NAgH,OAAOC,UAAUC,eAAeC,KAAK9D,EAAO,c3B2NjDxD,EAAOoT,IAAItP,KAAK3D,GAEhBH,EAAOqT,IAAIvP,KAAK3D,EAEpB,IACOH,CACT,C2BlOc,CAAegT,GAGvBM,EAAWH,EAAMC,IACnBG,EAAa,GAASJ,EAAME,KAAK,SAAU7P,GACzC,OAAQA,EAAMoD,CAChB,IACA+F,EAAK,GACL6G,EAAM,EACN1O,EAAS,EACT2O,EAAU,EAEZH,EAASvB,MA8BcmB,IA9BSD,EA+BzB,SAAUS,EAAQC,GACvB,OAAID,EAAOE,WAAaD,EAAOC,YACrB,EACCF,EAAOE,WAAaD,EAAOC,WAC7B,EAGDV,EAA6BS,EAAO/M,EAAI8M,EAAO9M,EAAxC8M,EAAO9M,EAAI+M,EAAO/M,CACnC,IArCA6M,EAAUI,GAAkBlH,EAAI4G,EAAYE,GAE5C,IAAUH,GAAU,SAAU9P,GAC5BiQ,GAAWjQ,EAAMmJ,GAAGzM,OACpByM,EAAG7I,KAAKN,EAAMmJ,IACd6G,GAAOhQ,EAAMoQ,WAAapQ,EAAMsB,OAChCA,GAAUtB,EAAMsB,OAChB2O,EAAUI,GAAkBlH,EAAI4G,EAAYE,EAC9C,IAEA,IAAIzT,EAAS,CAAE2M,GAAI,IAAUA,IAK7B,OAJI7H,IACF9E,EAAO4T,WAAaJ,EAAM1O,EAC1B9E,EAAO8E,OAASA,GAEX9E,CACT,CAEA,SAAS6T,GAAkBlH,EAAI4G,EAAYxT,GAEzC,IADA,IAAI+T,EACGP,EAAWrT,SAAW4T,EAAO,IAAOP,IAAa3M,GAAK7G,GAC3DwT,EAAWQ,MACXpH,EAAG7I,KAAKgQ,EAAKnH,IACb5M,IAEF,OAAOA,CACT,CCvCA,SAASiU,GAAazP,EAAGH,EAAG6P,EAAIhB,GAC9B,IAAIiB,EAAU3P,EAAEsE,SAASzE,GACrBY,EAAOT,EAAES,KAAKZ,GACd+P,EAAKnP,EAAOA,EAAKoP,gBAAavT,EAC9BwT,EAAKrP,EAAOA,EAAKsP,iBAAczT,EAC/B0T,EAAY,CAAC,EAEbJ,IACFD,EAAU,KAASA,GAAS,SAAUjP,GACpC,OAAOA,IAAMkP,GAAMlP,IAAMoP,CAC3B,KAGF,IAAIG,EChBN,SAAoBjQ,EAAG2P,GACrB,OAAO,IAAMA,GAAS,SAAU9P,GAC9B,IAAIqQ,EAAMlQ,EAAEK,QAAQR,GACpB,GAAKqQ,EAAIvU,OAEF,CACL,IAAIF,EAAS,KACXyU,GACA,SAAUxH,EAAK7G,GACb,IAAIvB,EAAON,EAAEM,KAAKuB,GAChBsO,EAAQnQ,EAAES,KAAKoB,EAAEhC,GACnB,MAAO,CACLoP,IAAKvG,EAAIuG,IAAM3O,EAAKC,OAAS4P,EAAM3K,MACnCjF,OAAQmI,EAAInI,OAASD,EAAKC,OAE9B,GACA,CAAE0O,IAAK,EAAG1O,OAAQ,IAGpB,MAAO,CACLV,EAAGA,EACHwP,WAAY5T,EAAOwT,IAAMxT,EAAO8E,OAChCA,OAAQ9E,EAAO8E,OAEnB,CApBE,MAAO,CAAEV,EAAGA,EAqBhB,GACF,CDVoBwP,CAAWrP,EAAG2P,GAChC,IAAUM,GAAa,SAAUhR,GAC/B,GAAIe,EAAEsE,SAASrF,EAAMY,GAAGlE,OAAQ,CAC9B,IAAIyU,EAAiBX,GAAazP,EAAGf,EAAMY,EAAG6P,EAAIhB,GAClDsB,EAAU/Q,EAAMY,GAAKuQ,EACjBxN,OAAOC,UAAUC,eAAeC,KAAKqN,EAAgB,gBA0CrCC,EAzCDpR,EAyCSzB,EAzCF4S,EA0CzB,IAAcC,EAAOhB,aAMxBgB,EAAOhB,WAAa7R,EAAM6R,WAC1BgB,EAAO9P,OAAS/C,EAAM+C,SANtB8P,EAAOhB,YACJgB,EAAOhB,WAAagB,EAAO9P,OAAS/C,EAAM6R,WAAa7R,EAAM+C,SAC7D8P,EAAO9P,OAAS/C,EAAM+C,QACzB8P,EAAO9P,QAAU/C,EAAM+C,QA5CvB,CAuCJ,IAA0B8P,EAAQ7S,CAtChC,IAEA,IAAIiR,EEFN,SAA0BA,EAASiB,GACjC,IAAIY,EAAgB,CAAC,EA+BrB,OA9BA,IAAU7B,GAAS,SAAUxP,EAAOoD,GAClC,IAAIkO,EAAOD,EAAcrR,EAAMY,GAAK,CAClC2Q,SAAU,EACV7O,GAAI,GACJhB,IAAK,GACLyH,GAAI,CAACnJ,EAAMY,GACXwC,EAAGA,GAEA,IAAcpD,EAAMoQ,cAEvBkB,EAAIlB,WAAapQ,EAAMoQ,WAEvBkB,EAAIhQ,OAAStB,EAAMsB,OAEvB,IAEA,IAAUmP,EAAG9N,SAAS,SAAUC,GAC9B,IAAIsN,EAASmB,EAAczO,EAAEhC,GACzBuP,EAASkB,EAAczO,EAAEnB,GACxB,IAAcyO,IAAY,IAAcC,KAC3CA,EAAOoB,WACPrB,EAAOxO,IAAIpB,KAAK+Q,EAAczO,EAAEnB,IAEpC,IAUF,SAA4B+P,GAC1B,IAAIhC,EAAU,GAEd,SAASiC,EAASC,GAChB,OAAO,SAAUnQ,GAwCrB,IAAsB6P,EAAQO,EACxB3B,EACA1O,EAzCIC,EAAOqQ,SAIT,IAAcrQ,EAAO6O,aACrB,IAAcsB,EAAOtB,aACrB7O,EAAO6O,YAAcsB,EAAOtB,cAiCNuB,EA/BDpQ,EAgCvByO,EAAM,EACN1O,EAAS,GAFO8P,EA/BDM,GAmCRpQ,SACT0O,GAAOoB,EAAOhB,WAAagB,EAAO9P,OAClCA,GAAU8P,EAAO9P,QAGfqQ,EAAOrQ,SACT0O,GAAO2B,EAAOvB,WAAauB,EAAOrQ,OAClCA,GAAUqQ,EAAOrQ,QAGnB8P,EAAOjI,GAAKwI,EAAOxI,GAAG9F,OAAO+N,EAAOjI,IACpCiI,EAAOhB,WAAaJ,EAAM1O,EAC1B8P,EAAO9P,OAASA,EAChB8P,EAAOhO,EAAIrE,KAAK8S,IAAIF,EAAOvO,EAAGgO,EAAOhO,GACrCuO,EAAOC,QAAS,EA/Cd,CACF,CAEA,SAASE,EAAUJ,GACjB,OAAO,SAAU7P,GACfA,EAAW,GAAEvB,KAAKoR,GACQ,KAApB7P,EAAO0P,UACXC,EAAUlR,KAAKuB,EAEnB,CACF,CAEA,KAAO2P,EAAU9U,QAAQ,CACvB,IAAIsD,EAAQwR,EAAUjB,MACtBf,EAAQlP,KAAKN,GACb,IAAUA,EAAU,GAAE+R,UAAWN,EAASzR,IAC1C,IAAUA,EAAM0B,IAAKoQ,EAAU9R,GACjC,CAEA,OAAO,IACL,KAASwP,GAAS,SAAUxP,GAC1B,OAAQA,EAAM4R,MAChB,KACA,SAAU5R,GACR,OAAO,EAAOA,EAAO,CAAC,KAAM,IAAK,aAAc,UACjD,GAEJ,CA7CSgS,CALS,KAASX,GAAe,SAAUrR,GAEhD,OAAQA,EAAMuR,QAChB,IAGF,CF/BgBU,CAAiBjB,EAAaP,IAuB9C,SAAyBjB,EAASuB,GAChC,IAAUvB,GAAS,SAAUxP,GAC3BA,EAAMmJ,GAAK,IACTnJ,EAAMmJ,GAAGnG,KAAI,SAAUpC,GACrB,OAAImQ,EAAUnQ,GACLmQ,EAAUnQ,GAAGuI,GAEfvI,CACT,IAEJ,GACF,CAjCEsR,CAAgB1C,EAASuB,GAEzB,IAAIvU,EAAS+R,GAAKiB,EAASC,GAE3B,GAAIkB,IACFnU,EAAO2M,GAAK,IAAU,CAACwH,EAAInU,EAAO2M,GAAI0H,IAClC9P,EAAEoR,aAAaxB,GAAIjU,QAAQ,CAC7B,IAAI0V,EAASrR,EAAES,KAAKT,EAAEoR,aAAaxB,GAAI,IACrC0B,EAAStR,EAAES,KAAKT,EAAEoR,aAAatB,GAAI,IAChClN,OAAOC,UAAUC,eAAeC,KAAKtH,EAAQ,gBAChDA,EAAO4T,WAAa,EACpB5T,EAAO8E,OAAS,GAElB9E,EAAO4T,YACJ5T,EAAO4T,WAAa5T,EAAO8E,OAAS8Q,EAAO7L,MAAQ8L,EAAO9L,QAAU/J,EAAO8E,OAAS,GACvF9E,EAAO8E,QAAU,CACnB,CAGF,OAAO9E,CACT,CGAA,SAAS8V,GAAiBvR,EAAGwR,EAAOC,GAClC,OAAO,IAAMD,GAAO,SAAUjM,GAC5B,OCnBJ,SAAyBvF,EAAGuF,EAAMkM,GAChC,IAAIrH,EAmCN,SAAwBpK,GAEtB,IADA,IAAIH,EACGG,EAAE+D,QAASlE,EAAI,EAAW,YACjC,OAAOA,CACT,CAvCa6R,CAAe1R,GACxBvE,EAAS,IAAI,IAAM,CAAEkW,UAAU,IAC5BtN,SAAS,CAAE+F,KAAMA,IACjBwH,qBAAoB,SAAU/R,GAC7B,OAAOG,EAAES,KAAKZ,EAChB,IA2BJ,OAzBA,IAAUG,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GAChByJ,EAAStJ,EAAEsJ,OAAOzJ,IAEhBY,EAAK8E,OAASA,GAAS9E,EAAKoR,SAAWtM,GAAQA,GAAQ9E,EAAKqR,WAC9DrW,EAAOiG,QAAQ7B,GACfpE,EAAO2K,UAAUvG,EAAGyJ,GAAUc,GAG9B,IAAUpK,EAAEyR,GAAc5R,IAAI,SAAUgC,GACtC,IAAIgI,EAAIhI,EAAEhC,IAAMA,EAAIgC,EAAEnB,EAAImB,EAAEhC,EAC1BS,EAAO7E,EAAO6E,KAAKuJ,EAAGhK,GACtBU,EAAU,IAAcD,GAAsB,EAAdA,EAAKC,OACvC9E,EAAOuG,QAAQ6H,EAAGhK,EAAG,CAAEU,OAAQP,EAAEM,KAAKuB,GAAGtB,OAASA,GACpD,IAEIqC,OAAOC,UAAUC,eAAeC,KAAKtC,EAAM,YAC7ChF,EAAOiG,QAAQ7B,EAAG,CAChBgQ,WAAYpP,EAAKoP,WAAWtK,GAC5BwK,YAAatP,EAAKsP,YAAYxK,KAItC,IAEO9J,CACT,CDfWsW,CAAgB/R,EAAGuF,EAAMkM,EAClC,GACF,CAEA,SAASO,GAAiBC,EAAavD,GACrC,IAAIgB,EAAK,IAAI,IACb,IAAUuC,GAAa,SAAUC,GAC/B,IAAI9H,EAAO8H,EAAGjR,QAAQmJ,KAClB+H,EAAS1C,GAAayC,EAAI9H,EAAMsF,EAAIhB,GACxC,IAAUyD,EAAO/J,IAAI,SAAUvI,EAAGwC,GAChC6P,EAAGzR,KAAKZ,GAAG2F,MAAQnD,CACrB,IE7DJ,SAAgCrC,EAAG0P,EAAItH,GACrC,IACEgK,EADEjM,EAAO,CAAC,EAGZ,IAAUiC,GAAI,SAAUvI,GAItB,IAHA,IACEyJ,EACA+I,EAFEhJ,EAAQrJ,EAAEsJ,OAAOzJ,GAGdwJ,GAAO,CASZ,IARAC,EAAStJ,EAAEsJ,OAAOD,KAEhBgJ,EAAYlM,EAAKmD,GACjBnD,EAAKmD,GAAUD,IAEfgJ,EAAYD,EACZA,EAAW/I,GAETgJ,GAAaA,IAAchJ,EAE7B,YADAqG,EAAG1N,QAAQqQ,EAAWhJ,GAGxBA,EAAQC,CACV,CACF,GAyBF,CFcIgJ,CAAuBJ,EAAIxC,EAAIyC,EAAO/J,GACxC,GACF,CAEA,SAASmK,GAAYvS,EAAGsF,GACtB,IAAUA,GAAU,SAAUkN,GAC5B,IAAUA,GAAO,SAAU3S,EAAGwC,GAC5BrC,EAAES,KAAKZ,GAAG2F,MAAQnD,CACpB,GACF,GACF,C,gBGzCA,SAJA,SAAgBvG,EAAQP,GACtB,OAAOO,IAAU,OAAWA,GAAQ,QAAaP,GACnD,E,4BCKA,SANA,SAAeO,EAAQP,GACrB,OAAiB,MAAVO,EACHA,GACA,QAAQA,GAAQ,QAAaP,GAAWkX,GAAA,EAC9C,EC+FA,SAASC,GAAYC,EAAW9S,EAAGa,GACjC,GAAIb,EAAIa,EAAG,CACT,IAAI6P,EAAM1Q,EACVA,EAAIa,EACJA,EAAI6P,CACN,CAEA,IAAIqC,EAAaD,EAAU9S,GACtB+S,IACHD,EAAU9S,GAAK+S,EAAa,CAAC,GAE/BA,EAAWlS,IAAK,CAClB,CAEA,SAASmS,GAAYF,EAAW9S,EAAGa,GACjC,GAAIb,EAAIa,EAAG,CACT,IAAI6P,EAAM1Q,EACVA,EAAIa,EACJA,EAAI6P,CACN,CACA,QAASoC,EAAU9S,IAAM+C,OAAOC,UAAUC,eAAeC,KAAK4P,EAAU9S,GAAIa,EAC9E,CA8LA,SAASoS,GAAU9S,GACjB,IAII+S,EAJAzN,EAAW,EAAsBtF,GACjC2S,EAAY,IAjTlB,SAA4B3S,EAAGsF,GAC7B,IAAIqN,EAAY,CAAC,EAoCjB,OADA,KAASrN,GAjCT,SAAoB0N,EAAWR,GAC7B,IAEES,EAAK,EAGLC,EAAU,EACVC,EAAkBH,EAAUrX,OAC5ByX,EAAW,IAAOZ,GAsBpB,OApBA,IAAUA,GAAO,SAAU3S,EAAGwC,GAC5B,IAAI3B,EAsEV,SAAmCV,EAAGH,GACpC,GAAIG,EAAES,KAAKZ,GAAGmE,MACZ,OAAO,KAAOhE,EAAEoR,aAAavR,IAAI,SAAUgK,GACzC,OAAO7J,EAAES,KAAKoJ,GAAG7F,KACnB,GAEJ,CA5EcqP,CAA0BrT,EAAGH,GACnCyT,EAAK5S,EAAIV,EAAES,KAAKC,GAAG8E,MAAQ2N,GAEzBzS,GAAKb,IAAMuT,KACb,IAAUZ,EAAM3V,MAAMqW,EAAS7Q,EAAI,IAAI,SAAUkR,GAC/C,IAAUvT,EAAEoR,aAAamC,IAAW,SAAU1J,GAC5C,IAAI2J,EAASxT,EAAES,KAAKoJ,GAClB4J,EAAOD,EAAOhO,QACXiO,EAAOR,GAAMK,EAAKG,IAAWD,EAAOxP,OAAShE,EAAES,KAAK8S,GAAUvP,OACjE0O,GAAYC,EAAW9I,EAAG0J,EAE9B,GACF,IAEAL,EAAU7Q,EAAI,EACd4Q,EAAKK,EAET,IAEOd,CACT,IAGOG,CACT,CA2Q0Be,CAAmB1T,EAAGsF,GAzQhD,SAA4BtF,EAAGsF,GAC7B,IAAIqN,EAAY,CAAC,EAEjB,SAASgB,EAAKC,EAAO1F,EAAU2F,EAAUC,EAAiBC,GACxD,IAAIlU,EACJ,IAAU,EAAQqO,EAAU2F,IAAW,SAAUxR,GAC/CxC,EAAI+T,EAAMvR,GACNrC,EAAES,KAAKZ,GAAGmE,OACZ,IAAUhE,EAAEoR,aAAavR,IAAI,SAAUgK,GACrC,IAAImK,EAAQhU,EAAES,KAAKoJ,GACfmK,EAAMhQ,QAAUgQ,EAAMxO,MAAQsO,GAAmBE,EAAMxO,MAAQuO,IACjErB,GAAYC,EAAW9I,EAAGhK,EAE9B,GAEJ,GACF,CAyBA,OADA,KAASyF,GAtBT,SAAoB2O,EAAOL,GACzB,IACEM,EADEC,GAAgB,EAElBjG,EAAW,EAgBb,OAdA,IAAU0F,GAAO,SAAU/T,EAAGuU,GAC5B,GAAwB,WAApBpU,EAAES,KAAKZ,GAAGmE,MAAoB,CAChC,IAAIoN,EAAepR,EAAEoR,aAAavR,GAC9BuR,EAAazV,SACfuY,EAAelU,EAAES,KAAK2Q,EAAa,IAAI5L,MACvCmO,EAAKC,EAAO1F,EAAUkG,EAAgBD,EAAcD,GAEpDhG,EAAWkG,EACXD,EAAeD,EAEnB,CACAP,EAAKC,EAAO1F,EAAU0F,EAAMjY,OAAQuY,EAAcD,EAAMtY,OAC1D,IAEOiY,CACT,IAGOjB,CACT,CA+N2D0B,CAAmBrU,EAAGsF,IAE3EgP,EAAM,CAAC,EAEX,IAAU,CAAC,IAAK,MAAM,SAAUC,GAC9BxB,EAA4B,MAATwB,EAAejP,EAAW,KAASA,GAAU0L,UAChE,IAAU,CAAC,IAAK,MAAM,SAAUwD,GAChB,MAAVA,IACFzB,EAAmB,IAAMA,GAAkB,SAAU0B,GACnD,OAAO,KAASA,GAAOzD,SACzB,KAGF,IAAI0D,GAAuB,MAATH,EAAevU,EAAEoR,aAAepR,EAAEuI,YAAYE,KAAKzI,GACjE2U,EApMV,SAA2B3U,EAAGsF,EAAUqN,EAAW+B,GACjD,IAAItK,EAAO,CAAC,EACVuK,EAAQ,CAAC,EACTvG,EAAM,CAAC,EAkCT,OA7BA,IAAU9I,GAAU,SAAUkN,GAC5B,IAAUA,GAAO,SAAU3S,EAAG2F,GAC5B4E,EAAKvK,GAAKA,EACV8U,EAAM9U,GAAKA,EACXuO,EAAIvO,GAAK2F,CACX,GACF,IAEA,IAAUF,GAAU,SAAUkN,GAC5B,IAAIoC,GAAW,EACf,IAAUpC,GAAO,SAAU3S,GACzB,IAAIgV,EAAKH,EAAW7U,GACpB,GAAIgV,EAAGlZ,OAAQ,CACbkZ,EAAK,GAASA,GAAI,SAAUnU,GAC1B,OAAO0N,EAAI1N,EACb,IAEA,IADA,IAAIoU,GAAMD,EAAGlZ,OAAS,GAAK,EAClB0G,EAAIrE,KAAK+W,MAAMD,GAAKE,EAAKhX,KAAKC,KAAK6W,GAAKzS,GAAK2S,IAAM3S,EAAG,CAC7D,IAAI3B,EAAImU,EAAGxS,GACPsS,EAAM9U,KAAOA,GAAK+U,EAAUxG,EAAI1N,KAAOmS,GAAYF,EAAW9S,EAAGa,KACnEiU,EAAMjU,GAAKb,EACX8U,EAAM9U,GAAKuK,EAAKvK,GAAKuK,EAAK1J,GAC1BkU,EAAUxG,EAAI1N,GAElB,CACF,CACF,GACF,IAEO,CAAE0J,KAAMA,EAAMuK,MAAOA,EAC9B,CA8JkBM,CAAkBjV,EAAG+S,EAAkBJ,EAAW+B,GAC1DQ,EA7JV,SAA8BlV,EAAGsF,EAAU8E,EAAMuK,EAAOQ,GAMtD,IAAID,EAAK,CAAC,EACRE,EAkDJ,SAAyBpV,EAAGsF,EAAU8E,EAAM+K,GAC1C,IAAIE,EAAa,IAAI,IACnBC,EAAatV,EAAEiB,QACfsU,EAgHJ,SAAa7J,EAAS8J,EAASL,GAC7B,OAAO,SAAUnV,EAAGH,EAAGa,GACrB,IAGIqG,EAHA0D,EAASzK,EAAES,KAAKZ,GAChB6K,EAAS1K,EAAES,KAAKC,GAChBuO,EAAM,EAIV,GADAA,GAAOxE,EAAOzF,MAAQ,EAClBpC,OAAOC,UAAUC,eAAeC,KAAK0H,EAAQ,YAC/C,OAAQA,EAAOgL,SAASC,eACtB,IAAK,IACH3O,GAAS0D,EAAOzF,MAAQ,EACxB,MACF,IAAK,IACH+B,EAAQ0D,EAAOzF,MAAQ,EAa7B,GATI+B,IACFkI,GAAOkG,EAAapO,GAASA,GAE/BA,EAAQ,EAERkI,IAAQxE,EAAOzG,MAAQwR,EAAU9J,GAAW,EAC5CuD,IAAQvE,EAAO1G,MAAQwR,EAAU9J,GAAW,EAE5CuD,GAAOvE,EAAO1F,MAAQ,EAClBpC,OAAOC,UAAUC,eAAeC,KAAK2H,EAAQ,YAC/C,OAAQA,EAAO+K,SAASC,eACtB,IAAK,IACH3O,EAAQ2D,EAAO1F,MAAQ,EACvB,MACF,IAAK,IACH+B,GAAS2D,EAAO1F,MAAQ,EAS9B,OALI+B,IACFkI,GAAOkG,EAAapO,GAASA,GAE/BA,EAAQ,EAEDkI,CACT,CACF,CA5JY0G,CAAIL,EAAWM,QAASN,EAAWO,QAASV,GAgBtD,OAdA,IAAU7P,GAAU,SAAUkN,GAC5B,IAAI3I,EACJ,IAAU2I,GAAO,SAAU3S,GACzB,IAAIiW,EAAQ1L,EAAKvK,GAEjB,GADAwV,EAAW3T,QAAQoU,GACfjM,EAAG,CACL,IAAIkM,EAAQ3L,EAAKP,GACfmM,EAAUX,EAAW/U,KAAKyV,EAAOD,GACnCT,EAAWrT,QAAQ+T,EAAOD,EAAO9X,KAAKG,IAAIoX,EAAMvV,EAAGH,EAAGgK,GAAImM,GAAW,GACvE,CACAnM,EAAIhK,CACN,GACF,IAEOwV,CACT,CAtEaY,CAAgBjW,EAAGsF,EAAU8E,EAAM+K,GAC5CjP,EAAaiP,EAAa,aAAe,cAE3C,SAASe,EAAQC,EAAWC,GAI1B,IAHA,IAAI3T,EAAQ2S,EAAO3T,QACf4U,EAAO5T,EAAM+M,MACb9M,EAAU,CAAC,EACR2T,GACD3T,EAAQ2T,GACVF,EAAUE,IAEV3T,EAAQ2T,IAAQ,EAChB5T,EAAMlD,KAAK8W,GACX5T,EAAQA,EAAMH,OAAO8T,EAAcC,KAGrCA,EAAO5T,EAAM+M,KAEjB,CA6BA,OARA0G,GAlBA,SAAeG,GACbnB,EAAGmB,GAAQjB,EAAO/U,QAAQgW,GAAMC,QAAO,SAAU5N,EAAK7G,GACpD,OAAO7D,KAAKG,IAAIuK,EAAKwM,EAAGrT,EAAEhC,GAAKuV,EAAO9U,KAAKuB,GAC7C,GAAG,EACL,GAceuT,EAAOhE,aAAa3I,KAAK2M,IACxCc,GAZA,SAAeG,GACb,IAAIvF,EAAMsE,EAAOvU,SAASwV,GAAMC,QAAO,SAAU5N,EAAK7G,GACpD,OAAO7D,KAAK8S,IAAIpI,EAAKwM,EAAGrT,EAAEnB,GAAK0U,EAAO9U,KAAKuB,GAC7C,GAAG8E,OAAOC,mBAENnG,EAAOT,EAAES,KAAK4V,GACdvF,IAAQnK,OAAOC,mBAAqBnG,EAAKyF,aAAeA,IAC1DgP,EAAGmB,GAAQrY,KAAKG,IAAI+W,EAAGmB,GAAOvF,GAElC,GAGesE,EAAO7M,WAAWE,KAAK2M,IAGtC,IAAUT,GAAO,SAAU9U,GACzBqV,EAAGrV,GAAKqV,EAAG9K,EAAKvK,GAClB,IAEOqV,CACT,CAsGeqB,CAAqBvW,EAAG+S,EAAkB4B,EAAMvK,KAAMuK,EAAMA,MAAiB,MAAVH,GAC9D,MAAVA,IACFU,EAAK,EAAYA,GAAI,SAAUtQ,GAC7B,OAAQA,CACV,KAEF0P,EAAIC,EAAOC,GAASU,CACtB,GACF,IAEA,IAAIsB,EArFN,SAAoCxW,EAAGsU,GACrC,OAAO,GAAQ,KAASA,IAAM,SAAUY,GACtC,IAAI/W,EAAMwI,OAAO8P,kBACb3F,EAAMnK,OAAOC,kBASjB,OAPA,GAAQsO,GAAI,SAAUtQ,EAAG/E,GACvB,IAAI6W,EAkIV,SAAe1W,EAAGH,GAChB,OAAOG,EAAES,KAAKZ,GAAGmF,KACnB,CApIsBA,CAAMhF,EAAGH,GAAK,EAE9B1B,EAAMH,KAAKG,IAAIyG,EAAI8R,EAAWvY,GAC9B2S,EAAM9S,KAAK8S,IAAIlM,EAAI8R,EAAW5F,EAChC,IAEO3S,EAAM2S,CACf,GACF,CAuEsB6F,CAA2B3W,EAAGsU,GAElD,OAhEF,SAA0BA,EAAKsC,GAC7B,IAAIC,EAAc,KAASD,GACzBE,EAAa,IAAMD,GACnBE,EAAa,EAAMF,GAErB,IAAU,CAAC,IAAK,MAAM,SAAUtC,GAC9B,IAAU,CAAC,IAAK,MAAM,SAAUC,GAC9B,IAEEzN,EAFEiQ,EAAYzC,EAAOC,EACrBU,EAAKZ,EAAI0C,GAEX,GAAI9B,IAAO0B,EAAX,CAEA,IAAIK,EAAS,KAAS/B,IACtBnO,EAAkB,MAAVyN,EAAgBsC,EAAa,IAAMG,GAAUF,EAAa,EAAME,MAGtE3C,EAAI0C,GAAa,EAAY9B,GAAI,SAAUtQ,GACzC,OAAOA,EAAImC,CACb,IARwB,CAU5B,GACF,GACF,CAyCEmQ,CAAiB5C,EAAKkC,GAvCxB,SAAiBlC,EAAKK,GACpB,OAAO,EAAYL,EAAI6C,IAAI,SAAUC,EAAQvX,GAC3C,GAAI8U,EACF,OAAOL,EAAIK,EAAMe,eAAe7V,GAEhC,IAAIqV,EAAK,GAAS,IAAMZ,EAAKzU,IAC7B,OAAQqV,EAAG,GAAKA,EAAG,IAAM,CAE7B,GACF,CA+BSmC,CAAQ/C,EAAKtU,EAAEiB,QAAQ0T,MAChC,CCrWA,SAAS2C,GAAOtX,EAAGuX,GACjB,IAAIC,EAAOD,GAAQA,EAAKE,YAAc,EAAY,EAClDD,EAAK,UAAU,KACb,IAAIE,EAAcF,EAAK,sBAAsB,IA+FjD,SAA0BG,GACxB,IAAI3X,EAAI,IAAI,IAAM,CAAEmE,YAAY,EAAMwN,UAAU,IAC5C1Q,EAAQ2W,GAAaD,EAAW1W,SAoBpC,OAlBAjB,EAAEqE,SACA,IAAQ,CAAC,EAAGwT,GAAeC,GAAkB7W,EAAO8W,IAAgB,EAAO9W,EAAO+W,MAGpF,IAAUL,EAAWlW,SAAS,SAAU5B,GACtC,IAAIY,EAAOmX,GAAaD,EAAWlX,KAAKZ,IACxCG,EAAE0B,QAAQ7B,EAAG,IAAWiY,GAAkBrX,EAAMwX,IAAeC,KAC/DlY,EAAEoG,UAAUvG,EAAG8X,EAAWrO,OAAOzJ,GACnC,IAEA,IAAU8X,EAAW/V,SAAS,SAAUC,GACtC,IAAIvB,EAAOsX,GAAaD,EAAWrX,KAAKuB,IACxC7B,EAAEgC,QACAH,EACA,IAAQ,CAAC,EAAGsW,GAAcL,GAAkBxX,EAAM8X,IAAe,EAAO9X,EAAM+X,KAElF,IAEOrY,CACT,CAtHuDsY,CAAiBtY,KACpEwX,EAAK,eAAe,IAKxB,SAAmBxX,EAAGwX,GACpBA,EAAK,8BAA8B,IAyHrC,SAAgCxX,GAC9B,IAAIiB,EAAQjB,EAAEiB,QACdA,EAAMsX,SAAW,EACjB,IAAUvY,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClBvB,EAAKoG,QAAU,EACqB,MAAhCpG,EAAKmV,SAASC,gBACM,OAAlBzU,EAAMuX,SAAsC,OAAlBvX,EAAMuX,QAClClY,EAAK0E,OAAS1E,EAAKmY,YAEnBnY,EAAK4E,QAAU5E,EAAKmY,YAG1B,GACF,CAvI2CC,CAAuB1Y,KAChEwX,EAAK,uBAAuB,IAiT9B,SAAyBxX,GACvB,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,GAAIA,EAAEhC,IAAMgC,EAAEnB,EAAG,CACf,IAAID,EAAOT,EAAES,KAAKoB,EAAEhC,GACfY,EAAKkY,YACRlY,EAAKkY,UAAY,IAEnBlY,EAAKkY,UAAUpZ,KAAK,CAAEsC,EAAGA,EAAGoB,MAAOjD,EAAEM,KAAKuB,KAC1C7B,EAAEkD,WAAWrB,EACf,CACF,GACF,CA5ToC+W,CAAgB5Y,KAClDwX,EAAK,eAAe,IAAM,EAAYxX,KACtCwX,EAAK,wBAAwB,IAAM,GAAiBxX,KACpDwX,EAAK,YAAY,IAAMjS,GAAK,EAAwBvF,MACpDwX,EAAK,8BAA8B,IA0IrC,SAAgCxX,GAC9B,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,GAAIvB,EAAK0E,OAAS1E,EAAK4E,OAAQ,CAC7B,IAAIrF,EAAIG,EAAES,KAAKoB,EAAEhC,GAEboD,EAAQ,CAAEsC,MADNvF,EAAES,KAAKoB,EAAEnB,GACM6E,KAAO1F,EAAE0F,MAAQ,EAAI1F,EAAE0F,KAAM1D,EAAGA,GACvD,EAAkB7B,EAAG,aAAciD,EAAO,MAC5C,CACF,GACF,CApJ2C4V,CAAuB7Y,KAChEwX,EAAK,wBAAwB,IrCqI/B,SAA0BxX,GAExB,IAAI8Y,EAAS,IACX,IAAM9Y,EAAEyB,SAAS,SAAU5B,GACzB,OAAOG,EAAES,KAAKZ,GAAG0F,IACnB,KAGEwT,EAAS,GACb,IAAU/Y,EAAEyB,SAAS,SAAU5B,GAC7B,IAAI0F,EAAOvF,EAAES,KAAKZ,GAAG0F,KAAOuT,EACvBC,EAAOxT,KACVwT,EAAOxT,GAAQ,IAEjBwT,EAAOxT,GAAMhG,KAAKM,EACpB,IAEA,IAAIkH,EAAQ,EACR8E,EAAiB7L,EAAEiB,QAAQ4K,eAC/B,IAAUkN,GAAQ,SAAU3Q,EAAI/F,GAC1B,IAAc+F,IAAO/F,EAAIwJ,GAAmB,IAC5C9E,EACOA,GACT,IAAUqB,GAAI,SAAUvI,GACtBG,EAAES,KAAKZ,GAAG0F,MAAQwB,CACpB,GAEJ,GACF,CqCjKqC,CAAsB/G,KACzDwX,EAAK,4BAA4B,IpB8FnC,SAAiBxX,GACf,IAAIsV,EAAatV,EAAEiB,QACnBjB,EAAED,WAAWuV,EAAW3J,oBACjB2J,EAAW3J,YAClB,IAAU3L,EAAE4B,SAAS,SAAUC,GAClB7B,EAAEM,KAAKuB,GACTyK,aACPtM,EAAEkD,WAAWrB,EAEjB,GACF,CoBxGyC,CAAqB7B,KAC5DwX,EAAK,sBAAsB,IrCqH7B,SAAwBxX,GACtB,IAAI8Q,EAAM,IACR,IAAM9Q,EAAEyB,SAAS,SAAU5B,GACzB,OAAOG,EAAES,KAAKZ,GAAG0F,IACnB,KAEF,IAAUvF,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GACd,IAAMY,EAAM,UACdA,EAAK8E,MAAQuL,EAEjB,GACF,CqCjImC,CAAoB9Q,KACrDwX,EAAK,wBAAwB,IAkJ/B,SAA0BxX,GACxB,IAAI8R,EAAU,EACd,IAAU9R,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GACdY,EAAKuL,YACPvL,EAAKoR,QAAU7R,EAAES,KAAKA,EAAKuL,WAAWzG,KACtC9E,EAAKqR,QAAU9R,EAAES,KAAKA,EAAKwL,cAAc1G,KAEzCuM,EAAU,EAAMA,EAASrR,EAAKqR,SAElC,IACA9R,EAAEiB,QAAQ6Q,QAAUA,CACtB,CA9JqCkH,CAAiBhZ,KACpDwX,EAAK,8BAA8B,IA+JrC,SAAgCxX,GAC9B,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GACC,eAAfY,EAAKuD,QACPhE,EAAEM,KAAKG,EAAKoB,GAAGoX,UAAYxY,EAAK8E,KAChCvF,EAAED,WAAWF,GAEjB,GACF,CAvK2CqZ,CAAuBlZ,KAChEwX,EAAK,qBAAqB,ICV5B,SAAaxX,GACXA,EAAEiB,QAAQkY,YAAc,GACxB,IAAUnZ,EAAE4B,SAAS,SAAUtB,IAQjC,SAAuBN,EAAG6B,GACxB,IAAIhC,EAAIgC,EAAEhC,EACNuZ,EAAQpZ,EAAES,KAAKZ,GAAG0F,KAClB7E,EAAImB,EAAEnB,EACN2Y,EAAQrZ,EAAES,KAAKC,GAAG6E,KAClBnC,EAAOvB,EAAEuB,KACTkW,EAAYtZ,EAAEM,KAAKuB,GACnBoX,EAAYK,EAAUL,UAE1B,GAAII,IAAUD,EAAQ,EAAtB,CAEApZ,EAAEkD,WAAWrB,GAcb,IACImC,EAAO3B,EADPyB,OAAQxH,EAEZ,IAAK+F,EAAI,IAAK+W,EAAOA,EAAQC,IAAShX,IAAK+W,EACzCE,EAAUC,OAAS,GAQnBvV,EAAQ,EAAkBhE,EAAG,OAP7B8D,EAAQ,CACNkB,MAAO,EACPE,OAAQ,EACRoU,UAAWA,EACXE,QAAS3X,EACT0D,KAAM6T,GAEoC,MACxCA,IAAUH,IACZnV,EAAMkB,MAAQsU,EAAUtU,MACxBlB,EAAMoB,OAASoU,EAAUpU,OACzBpB,EAAME,MAAQ,aACdF,EAAM2R,SAAW6D,EAAU7D,UAE7BzV,EAAEgC,QAAQnC,EAAGmE,EAAO,CAAEzD,OAAQ+Y,EAAU/Y,QAAU6C,GACxC,IAANf,GACFrC,EAAEiB,QAAQkY,YAAY5Z,KAAKyE,GAE7BnE,EAAImE,EAGNhE,EAAEgC,QAAQnC,EAAGa,EAAG,CAAEH,OAAQ+Y,EAAU/Y,QAAU6C,EAzCf,CA0CjC,CA1DIqW,CAAczZ,EAAGM,EACnB,GACF,CDKkC,CAAcN,KAC9CwX,EAAK,yBAAyB,IEjChC,SAA2BxX,GACzB,IAAI0Z,EAoEN,SAAmB1Z,GACjB,IAAIvE,EAAS,CAAC,EACV+O,EAAM,EASV,OAFA,IAAUxK,EAAEsE,YALZ,SAAS3B,EAAI9C,GACX,IAAI0K,EAAMC,EACV,IAAUxK,EAAEsE,SAASzE,GAAI8C,GACzBlH,EAAOoE,GAAK,CAAE0K,IAAKA,EAAKC,IAAKA,IAC/B,IAGO/O,CACT,CAhFsB,CAAUuE,GAE9B,IAAUA,EAAEiB,QAAQkY,aAAa,SAAUtZ,GAUzC,IATA,IAAIY,EAAOT,EAAES,KAAKZ,GACd2Z,EAAU/Y,EAAK+Y,QACfG,EAsCR,SAAkB3Z,EAAG0Z,EAAe7Z,EAAGa,GACrC,IAII4I,EACAsQ,EALAC,EAAQ,GACRC,EAAQ,GACRvP,EAAMvM,KAAK8S,IAAI4I,EAAc7Z,GAAG0K,IAAKmP,EAAchZ,GAAG6J,KACtDC,EAAMxM,KAAKG,IAAIub,EAAc7Z,GAAG2K,IAAKkP,EAAchZ,GAAG8J,KAK1DlB,EAASzJ,EACT,GACEyJ,EAAStJ,EAAEsJ,OAAOA,GAClBuQ,EAAMta,KAAK+J,SACJA,IAAWoQ,EAAcpQ,GAAQiB,IAAMA,GAAOC,EAAMkP,EAAcpQ,GAAQkB,MAKnF,IAJAoP,EAAMtQ,EAGNA,EAAS5I,GACD4I,EAAStJ,EAAEsJ,OAAOA,MAAasQ,GACrCE,EAAMva,KAAK+J,GAGb,MAAO,CAAEvN,KAAM8d,EAAMvX,OAAOwX,EAAM9I,WAAY4I,IAAKA,EACrD,CA7DmBG,CAAS/Z,EAAG0Z,EAAeF,EAAQ3Z,EAAG2Z,EAAQ9Y,GACzD3E,EAAO4d,EAAS5d,KAChB6d,EAAMD,EAASC,IACfI,EAAU,EACVC,EAAQle,EAAKie,GACbE,GAAY,EAETra,IAAM2Z,EAAQ9Y,GAAG,CAGtB,GAFAD,EAAOT,EAAES,KAAKZ,GAEVqa,EAAW,CACb,MAAQD,EAAQle,EAAKie,MAAcJ,GAAO5Z,EAAES,KAAKwZ,GAAOnI,QAAUrR,EAAK8E,MACrEyU,IAGEC,IAAUL,IACZM,GAAY,EAEhB,CAEA,IAAKA,EAAW,CACd,KACEF,EAAUje,EAAKJ,OAAS,GACxBqE,EAAES,KAAMwZ,EAAQle,EAAKie,EAAU,IAAKnI,SAAWpR,EAAK8E,MAEpDyU,IAEFC,EAAQle,EAAKie,EACf,CAEAha,EAAEoG,UAAUvG,EAAGoa,GACfpa,EAAIG,EAAEuI,WAAW1I,GAAG,EACtB,CACF,GACF,CFPsCsa,CAAkBna,KACtDwX,EAAK,yBAAyB,IpCjChC,SAA2BxX,GAkBzB,IAAUA,EAAEsE,YAjBZ,SAAS3B,EAAI9C,GACX,IAAIyE,EAAWtE,EAAEsE,SAASzE,GACtBY,EAAOT,EAAES,KAAKZ,GAKlB,GAJIyE,EAAS3I,QACX,IAAU2I,EAAU3B,GAGlBC,OAAOC,UAAUC,eAAeC,KAAKtC,EAAM,WAAY,CACzDA,EAAKoP,WAAa,GAClBpP,EAAKsP,YAAc,GACnB,IAAK,IAAIxK,EAAO9E,EAAKoR,QAASC,EAAUrR,EAAKqR,QAAU,EAAGvM,EAAOuM,IAAWvM,EAC1E,EAAcvF,EAAG,aAAc,MAAOH,EAAGY,EAAM8E,GAC/C,EAAcvF,EAAG,cAAe,MAAOH,EAAGY,EAAM8E,EAEpD,CACF,GAGF,CoCcsC6U,CAAkBpa,KACtDwX,EAAK,aAAa,INbpB,SAAexX,GACb,IAAI8R,EAAU,EAAa9R,GACzBqa,EAAkB9I,GAAiBvR,EAAG,EAAQ,EAAG8R,EAAU,GAAI,WAC/DwI,EAAgB/I,GAAiBvR,EAAG,EAAQ8R,EAAU,GAAI,GAAI,GAAI,YAEhExM,ESlBC,SAAmBtF,GACxB,IAAI0C,EAAU,CAAC,EACX6X,EAAc,KAASva,EAAEyB,SAAS,SAAU5B,GAC9C,OAAQG,EAAEsE,SAASzE,GAAGlE,MACxB,IACImW,EAAU,EACZ,IAAMyI,GAAa,SAAU1a,GAC3B,OAAOG,EAAES,KAAKZ,GAAG0F,IACnB,KAEEwT,EAAS,IAAM,EAAQjH,EAAU,IAAI,WACvC,MAAO,EACT,IAUI0I,EAAY,GAASD,GAAa,SAAU1a,GAC9C,OAAOG,EAAES,KAAKZ,GAAG0F,IACnB,IAGA,OAFA,IAAUiV,GAXV,SAAS7X,EAAI9C,GACX,IAAI,IAAM6C,EAAS7C,GAAnB,CACA6C,EAAQ7C,IAAK,EACb,IAAIY,EAAOT,EAAES,KAAKZ,GAClBkZ,EAAOtY,EAAK8E,MAAMhG,KAAKM,GACvB,IAAUG,EAAEuI,WAAW1I,GAAI8C,EAJE,CAK/B,IAOOoW,CACT,CTViB0B,CAAUza,GACzBuS,GAAYvS,EAAGsF,GAKf,IAHA,IACEoV,EADEC,EAAShU,OAAOC,kBAGXvE,EAAI,EAAGuY,EAAW,EAAGA,EAAW,IAAKvY,IAAKuY,EAAU,CAC3D5I,GAAiB3P,EAAI,EAAIgY,EAAkBC,EAAejY,EAAI,GAAK,GAGnE,IAAIyL,EAAKD,GAAW7N,EADpBsF,EAAW,EAAsBtF,IAE7B8N,EAAK6M,IACPC,EAAW,EACXF,EAAO,GAAYpV,GACnBqV,EAAS7M,EAEb,CAEAyE,GAAYvS,EAAG0a,EACjB,CMX0BlV,CAAMxF,KAC9BwX,EAAK,uBAAuB,IAgT9B,SAAyBxX,GACvB,IAAI+Y,EAAS,EAAsB/Y,GACnC,IAAU+Y,GAAQ,SAAUvG,GAC1B,IAAIqI,EAAa,EACjB,IAAUrI,GAAO,SAAU3S,EAAGwC,GAC5B,IAAI5B,EAAOT,EAAES,KAAKZ,GAClBY,EAAK+E,MAAQnD,EAAIwY,EACjB,IAAUpa,EAAKkY,WAAW,SAAUmC,GAClC,EACE9a,EACA,WACA,CACEgF,MAAO8V,EAAS7X,MAAM+B,MACtBE,OAAQ4V,EAAS7X,MAAMiC,OACvBK,KAAM9E,EAAK8E,KACXC,MAAOnD,KAAMwY,EACbhZ,EAAGiZ,EAASjZ,EACZoB,MAAO6X,EAAS7X,OAElB,MAEJ,WACOxC,EAAKkY,SACd,GACF,GACF,CAzUoCoC,CAAgB/a,KAClDwX,EAAK,8BAA8B,InCrCrC,SAAgBxX,GACd,IAAIgb,EAAUhb,EAAEiB,QAAQuX,QAAQ9C,cAChB,OAAZsF,GAAgC,OAAZA,GACtB3U,GAAgBrG,EAEpB,CmCgC2C,CAAwBA,KACjEwX,EAAK,gBAAgB,IIpCvB,SAAkBxX,IASlB,SAAmBA,GACjB,IAAIsF,EAAW,EAAsBtF,GACjCib,EAAUjb,EAAEiB,QAAQsX,QACpB2C,EAAQ,EACZ,IAAU5V,GAAU,SAAUkN,GAC5B,IAAI2I,EAAY,EACd,IAAM3I,GAAO,SAAU3S,GACrB,OAAOG,EAAES,KAAKZ,GAAGqF,MACnB,KAEF,IAAUsN,GAAO,SAAU3S,GACzBG,EAAES,KAAKZ,GAAGgF,EAAIqW,EAAQC,EAAY,CACpC,IACAD,GAASC,EAAYF,CACvB,GACF,EArBEG,CAFApb,EAAI,EAAwBA,IAG5B,GAAS8S,GAAU9S,IAAI,SAAU4E,EAAG/E,GAClCG,EAAES,KAAKZ,GAAG+E,EAAIA,CAChB,GACF,CJ6B6ByW,CAASrb,KACpCwX,EAAK,yBAAyB,IAwUhC,SAA2BxX,GACzB,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GAClB,GAAmB,aAAfY,EAAKuD,MAAsB,CAC7B,IAAIsX,EAAWtb,EAAES,KAAKA,EAAKoB,EAAEhC,GACzB+E,EAAI0W,EAAS1W,EAAI0W,EAAStW,MAAQ,EAClCH,EAAIyW,EAASzW,EACbC,EAAKrE,EAAKmE,EAAIA,EACdG,EAAKuW,EAASpW,OAAS,EAC3BlF,EAAEgC,QAAQvB,EAAKoB,EAAGpB,EAAKwC,OACvBjD,EAAED,WAAWF,GACbY,EAAKwC,MAAMsW,OAAS,CAClB,CAAE3U,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,EAAKwC,MAAM2B,EAAInE,EAAKmE,EACpBnE,EAAKwC,MAAM4B,EAAIpE,EAAKoE,CACtB,CACF,GACF,CA9VsC0W,CAAkBvb,KACtDwX,EAAK,yBAAyB,IAwQhC,SAA2BxX,GACzB,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B,GAAIG,EAAEsE,SAASzE,GAAGlE,OAAQ,CACxB,IAAI8E,EAAOT,EAAES,KAAKZ,GACdmH,EAAIhH,EAAES,KAAKA,EAAKuL,WAChBwP,EAAIxb,EAAES,KAAKA,EAAKwL,cAChBwP,EAAIzb,EAAES,KAAK,IAAOA,EAAKoP,aACvB6L,EAAI1b,EAAES,KAAK,IAAOA,EAAKsP,cAE3BtP,EAAKuE,MAAQhH,KAAKoH,IAAIsW,EAAE9W,EAAI6W,EAAE7W,GAC9BnE,EAAKyE,OAASlH,KAAKoH,IAAIoW,EAAE3W,EAAImC,EAAEnC,GAC/BpE,EAAKmE,EAAI6W,EAAE7W,EAAInE,EAAKuE,MAAQ,EAC5BvE,EAAKoE,EAAImC,EAAEnC,EAAIpE,EAAKyE,OAAS,CAC/B,CACF,IAEA,IAAUlF,EAAEyB,SAAS,SAAU5B,GACL,WAApBG,EAAES,KAAKZ,GAAGmE,OACZhE,EAAED,WAAWF,EAEjB,GACF,CA7RsC8b,CAAkB3b,KACtDwX,EAAK,sBAAsB,IC4C7B,SAAcxX,GACZ,IAAUA,EAAEiB,QAAQkY,aAAa,SAAUtZ,GACzC,IAEIa,EAFAD,EAAOT,EAAES,KAAKZ,GACd+b,EAAYnb,EAAK6Y,UAGrB,IADAtZ,EAAEgC,QAAQvB,EAAK+Y,QAASoC,GACjBnb,EAAKuD,OACVtD,EAAIV,EAAEuI,WAAW1I,GAAG,GACpBG,EAAED,WAAWF,GACb+b,EAAUrC,OAAOha,KAAK,CAAEqF,EAAGnE,EAAKmE,EAAGC,EAAGpE,EAAKoE,IACxB,eAAfpE,EAAKuD,QACP4X,EAAUhX,EAAInE,EAAKmE,EACnBgX,EAAU/W,EAAIpE,EAAKoE,EACnB+W,EAAU5W,MAAQvE,EAAKuE,MACvB4W,EAAU1W,OAASzE,EAAKyE,QAE1BrF,EAAIa,EACJD,EAAOT,EAAES,KAAKZ,EAElB,GACF,CDhEmC,CAAeG,KAChDwX,EAAK,4BAA4B,IA0OnC,SAA8BxX,GAC5B,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,GAAIe,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,KAI7C,OAHsB,MAAlBA,EAAKmV,UAAsC,MAAlBnV,EAAKmV,WAChCnV,EAAK0E,OAAS1E,EAAKmY,aAEbnY,EAAKmV,UACX,IAAK,IACHnV,EAAKsE,GAAKtE,EAAK0E,MAAQ,EAAI1E,EAAKmY,YAChC,MACF,IAAK,IACHnY,EAAKsE,GAAKtE,EAAK0E,MAAQ,EAAI1E,EAAKmY,YAIxC,GACF,CA3PyCoD,CAAqB7b,KAC5DwX,EAAK,4BAA4B,InCpCnC,SAAcxX,GACZ,IAAIgb,EAAUhb,EAAEiB,QAAQuX,QAAQ9C,cAChB,OAAZsF,GAAgC,OAAZA,GAyB1B,SAAkBhb,GAChB,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B0G,GAAYvG,EAAES,KAAKZ,GACrB,IAEA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,IAAUvB,EAAKiZ,OAAQhT,IACnB3D,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,MAC7CiG,GAAYjG,EAEhB,GACF,CApCIwb,CAAS9b,GAGK,OAAZgb,GAAgC,OAAZA,IAuC1B,SAAgBhb,GACd,IAAUA,EAAEyB,SAAS,SAAU5B,GAC7B2G,GAAUxG,EAAES,KAAKZ,GACnB,IAEA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,IAAUvB,EAAKiZ,OAAQ/S,IACnB5D,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,MAC7CkG,GAAUlG,EAEd,GACF,CAlDIyb,CAAO/b,GACPqG,GAAgBrG,GAEpB,CmC0ByC,CAAsBA,KAC7DwX,EAAK,sBAAsB,IA4J7B,SAAwBxX,GACtB,IAAIgc,EAAOrV,OAAOC,kBACdqV,EAAO,EACPC,EAAOvV,OAAOC,kBACduV,EAAO,EACP7G,EAAatV,EAAEiB,QACfmb,EAAU9G,EAAW+G,SAAW,EAChCC,EAAUhH,EAAWiH,SAAW,EAEpC,SAASC,EAAY1Y,GACnB,IAAIc,EAAId,EAAMc,EACVC,EAAIf,EAAMe,EACVnE,EAAIoD,EAAMkB,MACVC,EAAInB,EAAMoB,OACd8W,EAAOhe,KAAK8S,IAAIkL,EAAMpX,EAAIlE,EAAI,GAC9Bub,EAAOje,KAAKG,IAAI8d,EAAMrX,EAAIlE,EAAI,GAC9Bwb,EAAOle,KAAK8S,IAAIoL,EAAMrX,EAAII,EAAI,GAC9BkX,EAAOne,KAAKG,IAAIge,EAAMtX,EAAII,EAAI,EAChC,CAEA,IAAUjF,EAAEyB,SAAS,SAAU5B,GAC7B2c,EAAYxc,EAAES,KAAKZ,GACrB,IACA,IAAUG,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GACde,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,MAC7Ckc,EAAYlc,EAEhB,IAEA0b,GAAQI,EACRF,GAAQI,EAER,IAAUtc,EAAEyB,SAAS,SAAU5B,GAC7B,IAAIY,EAAOT,EAAES,KAAKZ,GAClBY,EAAKmE,GAAKoX,EACVvb,EAAKoE,GAAKqX,CACZ,IAEA,IAAUlc,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GAClB,IAAUvB,EAAKiZ,QAAQ,SAAUkD,GAC/BA,EAAE7X,GAAKoX,EACPS,EAAE5X,GAAKqX,CACT,IACItZ,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,OAC7CA,EAAKsE,GAAKoX,GAERpZ,OAAOC,UAAUC,eAAeC,KAAKzC,EAAM,OAC7CA,EAAKuE,GAAKqX,EAEd,IAEA5G,EAAWtQ,MAAQiX,EAAOD,EAAOI,EACjC9G,EAAWpQ,OAASiX,EAAOD,EAAOI,CACpC,CAnNmCI,CAAe1c,KAChDwX,EAAK,4BAA4B,IAoNnC,SAA8BxX,GAC5B,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAGI8a,EAAIC,EAHJtc,EAAON,EAAEM,KAAKuB,GACdgb,EAAQ7c,EAAES,KAAKoB,EAAEhC,GACjBid,EAAQ9c,EAAES,KAAKoB,EAAEnB,GAEhBJ,EAAKiZ,QAKRoD,EAAKrc,EAAKiZ,OAAO,GACjBqD,EAAKtc,EAAKiZ,OAAOjZ,EAAKiZ,OAAO5d,OAAS,KALtC2E,EAAKiZ,OAAS,GACdoD,EAAKG,EACLF,EAAKC,GAKPvc,EAAKiZ,OAAOwD,QAAQ,EAAmBF,EAAOF,IAC9Crc,EAAKiZ,OAAOha,KAAK,EAAmBud,EAAOF,GAC7C,GACF,CArOyCI,CAAqBhd,KAC5DwX,EAAK,qBAAqB,IAyP5B,SAAuCxX,GACrC,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAAIvB,EAAON,EAAEM,KAAKuB,GACdvB,EAAK+C,UACP/C,EAAKiZ,OAAOvI,SAEhB,GACF,CAhQkCiM,CAA8Bjd,KAC9DwX,EAAK,oBAAoB,I7CJ3B,SAAcxX,GACZ,IAAUA,EAAE4B,SAAS,SAAUC,GAC7B,IAAIoB,EAAQjD,EAAEM,KAAKuB,GACnB,GAAIoB,EAAMI,SAAU,CAClBrD,EAAEkD,WAAWrB,GAEb,IAAIsB,EAAcF,EAAME,mBACjBF,EAAMI,gBACNJ,EAAME,YACbnD,EAAEgC,QAAQH,EAAEnB,EAAGmB,EAAEhC,EAAGoD,EAAOE,EAC7B,CACF,GACF,C6CRiC,CAAanD,IAC9C,CAjC8Bkd,CAAUxF,EAAaF,KACjDA,EAAK,sBAAsB,IAwC/B,SAA0BG,EAAYD,GACpC,IAAUC,EAAWlW,SAAS,SAAU5B,GACtC,IAAIsd,EAAaxF,EAAWlX,KAAKZ,GAC7Bud,EAAc1F,EAAYjX,KAAKZ,GAE/Bsd,IACFA,EAAWvY,EAAIwY,EAAYxY,EAC3BuY,EAAWtY,EAAIuY,EAAYvY,EAEvB6S,EAAYpT,SAASzE,GAAGlE,SAC1BwhB,EAAWnY,MAAQoY,EAAYpY,MAC/BmY,EAAWjY,OAASkY,EAAYlY,QAGtC,IAEA,IAAUyS,EAAW/V,SAAS,SAAUC,GACtC,IAAIsb,EAAaxF,EAAWrX,KAAKuB,GAC7Bub,EAAc1F,EAAYpX,KAAKuB,GAEnCsb,EAAW5D,OAAS6D,EAAY7D,OAC5B3W,OAAOC,UAAUC,eAAeC,KAAKqa,EAAa,OACpDD,EAAWvY,EAAIwY,EAAYxY,EAC3BuY,EAAWtY,EAAIuY,EAAYvY,EAE/B,IAEA8S,EAAW1W,QAAQ+D,MAAQ0S,EAAYzW,QAAQ+D,MAC/C2S,EAAW1W,QAAQiE,OAASwS,EAAYzW,QAAQiE,MAClD,CArEqCmY,CAAiBrd,EAAG0X,IAAa,GAEtE,CAqEA,IAAIK,GAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,GAAgB,CAAEU,QAAS,GAAI1C,QAAS,GAAID,QAAS,GAAI4C,QAAS,MAClER,GAAa,CAAC,YAAa,SAAU,UAAW,SAChDC,GAAe,CAAC,QAAS,UACzBC,GAAe,CAAElT,MAAO,EAAGE,OAAQ,GACnCkT,GAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,GAAe,CACjBzR,OAAQ,EACRnG,OAAQ,EACRyE,MAAO,EACPE,OAAQ,EACRuT,YAAa,GACbhD,SAAU,KAER4C,GAAY,CAAC,YAkSjB,SAASP,GAAkBwF,EAAKxZ,GAC9B,OAAO,EAAY,EAAOwZ,EAAKxZ,GAAQ6C,OACzC,CAEA,SAASiR,GAAa9T,GACpB,IAAIyZ,EAAW,CAAC,EAIhB,OAHA,IAAUzZ,GAAO,SAAUjE,EAAGD,GAC5B2d,EAAS3d,EAAE8V,eAAiB7V,CAC9B,IACO0d,CACT,C,iGKhZIrf,EAAYF,KAAKG,ICoCrB,SC9BoBqf,EF+BpB,SAAmB/gB,EAAOD,EAAWihB,GACnC,IAAI9hB,EAAkB,MAATc,EAAgB,EAAIA,EAAMd,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAIH,EAAqB,MAAbiiB,EAAoB,GAAI,EAAAC,EAAA,GAAUD,GAI9C,OAHIjiB,EAAQ,IACVA,EAAQ0C,EAAUvC,EAASH,EAAO,KAE7B,OAAciB,GAAO,OAAaD,EAAW,GAAIhB,EAC1D,EExCS,SAASF,EAAYkB,EAAWihB,GACrC,IAAIE,EAAW/a,OAAOtH,GACtB,KAAK,EAAAsiB,EAAA,GAAYtiB,GAAa,CAC5B,IAAIC,GAAW,OAAaiB,EAAW,GACvClB,GAAa,EAAAuiB,EAAA,GAAKviB,GAClBkB,EAAY,SAASX,GAAO,OAAON,EAASoiB,EAAS9hB,GAAMA,EAAK8hB,EAAW,CAC7E,CACA,IAAIniB,EAAQgiB,EAAcliB,EAAYkB,EAAWihB,GACjD,OAAOjiB,GAAS,EAAImiB,EAASpiB,EAAWD,EAAWE,GAASA,QAASc,CACvE,GAVF,IAAoBkhB,C,+JCcpB,SAJY,QAAS,SAASM,GAC5B,OAAO,QAAS,OAAYA,EAAQ,EAAGC,EAAA,GAAmB,GAC5D,I,0BCpBIC,EAAa,KAsBV,MAAMC,EACX,WAAAvf,CAAY6Y,EAAO,CAAC,GAClBzY,KAAKof,aAActb,OAAOC,UAAUC,eAAeC,KAAKwU,EAAM,aAC1DA,EAAKtQ,SAETnI,KAAKqf,gBAAgBvb,OAAOC,UAAUC,eAAeC,KAAKwU,EAAM,eAC5DA,EAAKpT,WAETrF,KAAKsf,cAAcxb,OAAOC,UAAUC,eAAeC,KAAKwU,EAAM,aAC1DA,EAAK5F,SAIT7S,KAAKuf,YAAS/hB,EAGdwC,KAAKwf,oBAAsB,SAAWhiB,GAGtCwC,KAAKyf,oBAAsB,SAAWjiB,GAGtCwC,KAAK0f,OAAS,CAAC,EAEX1f,KAAKsf,cAEPtf,KAAK2f,QAAU,CAAC,EAGhB3f,KAAK4f,UAAY,CAAC,EAClB5f,KAAK4f,UAAUV,GAAc,CAAC,GAIhClf,KAAK6f,IAAM,CAAC,EAGZ7f,KAAK8f,OAAS,CAAC,EAGf9f,KAAK+f,KAAO,CAAC,EAGb/f,KAAKggB,MAAQ,CAAC,EAGdhgB,KAAKigB,UAAY,CAAC,EAGlBjgB,KAAKkgB,YAAc,CAAC,CACtB,CAEA,UAAA1W,GACE,OAAOxJ,KAAKof,WACd,CACA,YAAA9Z,GACE,OAAOtF,KAAKqf,aACd,CACA,UAAAc,GACE,OAAOngB,KAAKsf,WACd,CACA,QAAA/Z,CAASpB,GAEP,OADAnE,KAAKuf,OAASpb,EACPnE,IACT,CACA,KAAAmC,GACE,OAAOnC,KAAKuf,MACd,CAEA,mBAAAzM,CAAoBsN,GAKlB,OAJK,IAAaA,KAChBA,EAAa,IAAWA,IAE1BpgB,KAAKwf,oBAAsBY,EACpBpgB,IACT,CACA,SAAAsC,GACE,OAAOtC,KAAKqgB,UACd,CACA,KAAA1d,GACE,OAAO,IAAO3C,KAAK0f,OACrB,CACA,OAAArc,GACE,IAAIid,EAAOtgB,KACX,OAAO,IAASA,KAAK2C,SAAS,SAAU5B,GACtC,OAAO,IAAUuf,EAAKT,IAAI9e,GAC5B,GACF,CACA,KAAAuC,GACE,IAAIgd,EAAOtgB,KACX,OAAO,IAASA,KAAK2C,SAAS,SAAU5B,GACtC,OAAO,IAAUuf,EAAKP,KAAKhf,GAC7B,GACF,CACA,QAAAwf,CAASjX,EAAIxM,GACX,IAAI0jB,EAAO5Z,UACP0Z,EAAOtgB,KAQX,OAPA,IAAOsJ,GAAI,SAAUvI,GACfyf,EAAK3jB,OAAS,EAChByjB,EAAK1d,QAAQ7B,EAAGjE,GAEhBwjB,EAAK1d,QAAQ7B,EAEjB,IACOf,IACT,CACA,OAAA4C,CAAQ7B,EAAGjE,GACT,OAAIgH,OAAOC,UAAUC,eAAeC,KAAKjE,KAAK0f,OAAQ3e,IAChD6F,UAAU/J,OAAS,IACrBmD,KAAK0f,OAAO3e,GAAKjE,GAEZkD,OAITA,KAAK0f,OAAO3e,GAAK6F,UAAU/J,OAAS,EAAIC,EAAQkD,KAAKwf,oBAAoBze,GACrEf,KAAKsf,cACPtf,KAAK2f,QAAQ5e,GAAKme,EAClBlf,KAAK4f,UAAU7e,GAAK,CAAC,EACrBf,KAAK4f,UAAUV,GAAYne,IAAK,GAElCf,KAAK6f,IAAI9e,GAAK,CAAC,EACff,KAAK8f,OAAO/e,GAAK,CAAC,EAClBf,KAAK+f,KAAKhf,GAAK,CAAC,EAChBf,KAAKggB,MAAMjf,GAAK,CAAC,IACff,KAAKqgB,WACArgB,KACT,CACA,IAAA2B,CAAKZ,GACH,OAAOf,KAAK0f,OAAO3e,EACrB,CACA,OAAAkE,CAAQlE,GACN,OAAO+C,OAAOC,UAAUC,eAAeC,KAAKjE,KAAK0f,OAAQ3e,EAC3D,CACA,UAAAE,CAAWF,GACT,GAAI+C,OAAOC,UAAUC,eAAeC,KAAKjE,KAAK0f,OAAQ3e,GAAI,CACxD,IAAIqD,EAAcrB,GAAM/C,KAAKoE,WAAWpE,KAAKigB,UAAUld,WAChD/C,KAAK0f,OAAO3e,GACff,KAAKsf,cACPtf,KAAKygB,4BAA4B1f,UAC1Bf,KAAK2f,QAAQ5e,GACpB,IAAOf,KAAKwF,SAASzE,IAAKwJ,IACxBvK,KAAKsH,UAAUiD,EAAM,WAEhBvK,KAAK4f,UAAU7e,IAExB,IAAO,IAAOf,KAAK6f,IAAI9e,IAAKqD,UACrBpE,KAAK6f,IAAI9e,UACTf,KAAK8f,OAAO/e,GACnB,IAAO,IAAOf,KAAK+f,KAAKhf,IAAKqD,UACtBpE,KAAK+f,KAAKhf,UACVf,KAAKggB,MAAMjf,KAChBf,KAAKqgB,UACT,CACA,OAAOrgB,IACT,CACA,SAAAsH,CAAUvG,EAAGyJ,GACX,IAAKxK,KAAKsf,YACR,MAAM,IAAIjZ,MAAM,6CAGlB,GAAI,IAAcmE,GAChBA,EAAS0U,MACJ,CAGL,IAAK,IAAIwB,EADTlW,GAAU,IACmB,IAAckW,GAAWA,EAAW1gB,KAAKwK,OAAOkW,GAC3E,GAAIA,IAAa3f,EACf,MAAM,IAAIsF,MAAM,WAAamE,EAAS,iBAAmBzJ,EAAI,yBAIjEf,KAAK4C,QAAQ4H,EACf,CAMA,OAJAxK,KAAK4C,QAAQ7B,GACbf,KAAKygB,4BAA4B1f,GACjCf,KAAK2f,QAAQ5e,GAAKyJ,EAClBxK,KAAK4f,UAAUpV,GAAQzJ,IAAK,EACrBf,IACT,CACA,2BAAAygB,CAA4B1f,UACnBf,KAAK4f,UAAU5f,KAAK2f,QAAQ5e,IAAIA,EACzC,CACA,MAAAyJ,CAAOzJ,GACL,GAAIf,KAAKsf,YAAa,CACpB,IAAI9U,EAASxK,KAAK2f,QAAQ5e,GAC1B,GAAIyJ,IAAW0U,EACb,OAAO1U,CAEX,CACF,CACA,QAAAhF,CAASzE,GAKP,GAJI,IAAcA,KAChBA,EAAIme,GAGFlf,KAAKsf,YAAa,CACpB,IAAI9Z,EAAWxF,KAAK4f,UAAU7e,GAC9B,GAAIyE,EACF,OAAO,IAAOA,EAElB,KAAO,IAAIzE,IAAMme,EACf,OAAOlf,KAAK2C,QACP,GAAI3C,KAAKiF,QAAQlE,GACtB,MAAO,EACT,CACF,CACA,YAAAuR,CAAavR,GACX,IAAI4f,EAAS3gB,KAAK8f,OAAO/e,GACzB,GAAI4f,EACF,OAAO,IAAOA,EAElB,CACA,UAAAlX,CAAW1I,GACT,IAAI6f,EAAQ5gB,KAAKggB,MAAMjf,GACvB,GAAI6f,EACF,OAAO,IAAOA,EAElB,CACA,SAAAlX,CAAU3I,GACR,IAAI8f,EAAQ7gB,KAAKsS,aAAavR,GAC9B,GAAI8f,EACF,OAAO,EAAQA,EAAO7gB,KAAKyJ,WAAW1I,GAE1C,CACA,MAAA+f,CAAO/f,GAOL,OAA4B,KALxBf,KAAKwJ,aACKxJ,KAAKyJ,WAAW1I,GAEhBf,KAAK0J,UAAU3I,IAEZlE,MACnB,CACA,WAAAkkB,CAAYC,GAEV,IAAIC,EAAO,IAAIjhB,KAAKJ,YAAY,CAC9BuI,SAAUnI,KAAKof,YACf/Z,WAAYrF,KAAKqf,cACjBxM,SAAU7S,KAAKsf,cAGjB2B,EAAK1b,SAASvF,KAAKmC,SAEnB,IAAIme,EAAOtgB,KACX,IAAOA,KAAK0f,QAAQ,SAAU5iB,EAAOiE,GAC/BigB,EAAOjgB,IACTkgB,EAAKre,QAAQ7B,EAAGjE,EAEpB,IAEA,IAAOkD,KAAKigB,WAAW,SAAUld,GAE3Bke,EAAKhc,QAAQlC,EAAEhC,IAAMkgB,EAAKhc,QAAQlC,EAAEnB,IACtCqf,EAAK/d,QAAQH,EAAGud,EAAK9e,KAAKuB,GAE9B,IAEA,IAAIme,EAAU,CAAC,EACf,SAASC,EAAWpgB,GAClB,IAAIyJ,EAAS8V,EAAK9V,OAAOzJ,GACzB,YAAevD,IAAXgN,GAAwByW,EAAKhc,QAAQuF,IACvC0W,EAAQngB,GAAKyJ,EACNA,GACEA,KAAU0W,EACZA,EAAQ1W,GAER2W,EAAW3W,EAEtB,CAQA,OANIxK,KAAKsf,aACP,IAAO2B,EAAKte,SAAS,SAAU5B,GAC7BkgB,EAAK3Z,UAAUvG,EAAGogB,EAAWpgB,GAC/B,IAGKkgB,CACT,CAEA,mBAAAG,CAAoBhB,GAKlB,OAJK,IAAaA,KAChBA,EAAa,IAAWA,IAE1BpgB,KAAKyf,oBAAsBW,EACpBpgB,IACT,CACA,SAAAqhB,GACE,OAAOrhB,KAAKshB,UACd,CACA,KAAAxe,GACE,OAAO,IAAS9C,KAAKigB,UACvB,CACA,OAAAsB,CAAQjY,EAAIxM,GACV,IAAIwjB,EAAOtgB,KACPwgB,EAAO5Z,UASX,OARA,IAAS0C,GAAI,SAAUvI,EAAGa,GAMxB,OALI4e,EAAK3jB,OAAS,EAChByjB,EAAKpd,QAAQnC,EAAGa,EAAG9E,GAEnBwjB,EAAKpd,QAAQnC,EAAGa,GAEXA,CACT,IACO5B,IACT,CAKA,OAAAkD,GACE,IAAInC,EAAGa,EAAG0C,EAAMxH,EACZ0kB,GAAiB,EACjBC,EAAO7a,UAAU,GAED,iBAAT6a,GAA8B,OAATA,GAAiB,MAAOA,GACtD1gB,EAAI0gB,EAAK1gB,EACTa,EAAI6f,EAAK7f,EACT0C,EAAOmd,EAAKnd,KACa,IAArBsC,UAAU/J,SACZC,EAAQ8J,UAAU,GAClB4a,GAAiB,KAGnBzgB,EAAI0gB,EACJ7f,EAAIgF,UAAU,GACdtC,EAAOsC,UAAU,GACbA,UAAU/J,OAAS,IACrBC,EAAQ8J,UAAU,GAClB4a,GAAiB,IAIrBzgB,EAAI,GAAKA,EACTa,EAAI,GAAKA,EACJ,IAAc0C,KACjBA,EAAO,GAAKA,GAGd,IAAIvB,EAAI2e,EAAa1hB,KAAKof,YAAare,EAAGa,EAAG0C,GAC7C,GAAIR,OAAOC,UAAUC,eAAeC,KAAKjE,KAAKkgB,YAAand,GAIzD,OAHIye,IACFxhB,KAAKkgB,YAAYnd,GAAKjG,GAEjBkD,KAGT,IAAK,IAAcsE,KAAUtE,KAAKqf,cAChC,MAAM,IAAIhZ,MAAM,qDAKlBrG,KAAK4C,QAAQ7B,GACbf,KAAK4C,QAAQhB,GAGb5B,KAAKkgB,YAAYnd,GAAKye,EAAiB1kB,EAAQkD,KAAKyf,oBAAoB1e,EAAGa,EAAG0C,GAE9E,IAAIoW,EA8GR,SAAuBlR,EAAYmY,EAAIC,EAAItd,GACzC,IAAIvD,EAAI,GAAK4gB,EACT/f,EAAI,GAAKggB,EACb,IAAKpY,GAAczI,EAAIa,EAAG,CACxB,IAAI6P,EAAM1Q,EACVA,EAAIa,EACJA,EAAI6P,CACN,CACA,IAAIiJ,EAAU,CAAE3Z,EAAGA,EAAGa,EAAGA,GAIzB,OAHI0C,IACFoW,EAAQpW,KAAOA,GAEVoW,CACT,CA3HkBmH,CAAc7hB,KAAKof,YAAare,EAAGa,EAAG0C,GAYpD,OAVAvD,EAAI2Z,EAAQ3Z,EACZa,EAAI8Y,EAAQ9Y,EAEZkC,OAAOge,OAAOpH,GACd1a,KAAKigB,UAAUld,GAAK2X,EACpBqH,EAAqB/hB,KAAK8f,OAAOle,GAAIb,GACrCghB,EAAqB/hB,KAAKggB,MAAMjf,GAAIa,GACpC5B,KAAK6f,IAAIje,GAAGmB,GAAK2X,EACjB1a,KAAK+f,KAAKhf,GAAGgC,GAAK2X,EAClB1a,KAAKshB,aACEthB,IACT,CACA,IAAAwB,CAAKT,EAAGa,EAAG0C,GACT,IAAIvB,EACmB,IAArB6D,UAAU/J,OACNmlB,EAAYhiB,KAAKof,YAAaxY,UAAU,IACxC8a,EAAa1hB,KAAKof,YAAare,EAAGa,EAAG0C,GAC3C,OAAOtE,KAAKkgB,YAAYnd,EAC1B,CACA,OAAAoI,CAAQpK,EAAGa,EAAG0C,GACZ,IAAIvB,EACmB,IAArB6D,UAAU/J,OACNmlB,EAAYhiB,KAAKof,YAAaxY,UAAU,IACxC8a,EAAa1hB,KAAKof,YAAare,EAAGa,EAAG0C,GAC3C,OAAOR,OAAOC,UAAUC,eAAeC,KAAKjE,KAAKkgB,YAAand,EAChE,CACA,UAAAqB,CAAWrD,EAAGa,EAAG0C,GACf,IAAIvB,EACmB,IAArB6D,UAAU/J,OACNmlB,EAAYhiB,KAAKof,YAAaxY,UAAU,IACxC8a,EAAa1hB,KAAKof,YAAare,EAAGa,EAAG0C,GACvC9C,EAAOxB,KAAKigB,UAAUld,GAY1B,OAXIvB,IACFT,EAAIS,EAAKT,EACTa,EAAIJ,EAAKI,SACF5B,KAAKkgB,YAAYnd,UACjB/C,KAAKigB,UAAUld,GACtBkf,EAAuBjiB,KAAK8f,OAAOle,GAAIb,GACvCkhB,EAAuBjiB,KAAKggB,MAAMjf,GAAIa,UAC/B5B,KAAK6f,IAAIje,GAAGmB,UACZ/C,KAAK+f,KAAKhf,GAAGgC,GACpB/C,KAAKshB,cAEAthB,IACT,CACA,OAAAuB,CAAQR,EAAGgK,GACT,IAAIqG,EAAMpR,KAAK6f,IAAI9e,GACnB,GAAIqQ,EAAK,CACP,IAAItO,EAAQ,IAASsO,GACrB,OAAKrG,EAGE,IAASjI,GAAO,SAAUtB,GAC/B,OAAOA,EAAKT,IAAMgK,CACpB,IAJSjI,CAKX,CACF,CACA,QAAAf,CAAShB,EAAGa,GACV,IAAIsgB,EAAOliB,KAAK+f,KAAKhf,GACrB,GAAImhB,EAAM,CACR,IAAIpf,EAAQ,IAASof,GACrB,OAAKtgB,EAGE,IAASkB,GAAO,SAAUtB,GAC/B,OAAOA,EAAKI,IAAMA,CACpB,IAJSkB,CAKX,CACF,CACA,SAAA0F,CAAUzH,EAAGa,GACX,IAAIL,EAAUvB,KAAKuB,QAAQR,EAAGa,GAC9B,GAAIL,EACF,OAAOA,EAAQiC,OAAOxD,KAAK+B,SAAShB,EAAGa,GAE3C,EASF,SAASmgB,EAAqB5e,EAAKrC,GAC7BqC,EAAIrC,GACNqC,EAAIrC,KAEJqC,EAAIrC,GAAK,CAEb,CAEA,SAASmhB,EAAuB9e,EAAKrC,KAC5BqC,EAAIrC,WACFqC,EAAIrC,EAEf,CAEA,SAAS4gB,EAAalY,EAAYmY,EAAIC,EAAItd,GACxC,IAAIvD,EAAI,GAAK4gB,EACT/f,EAAI,GAAKggB,EACb,IAAKpY,GAAczI,EAAIa,EAAG,CACxB,IAAI6P,EAAM1Q,EACVA,EAAIa,EACJA,EAAI6P,CACN,CACA,OAAO1Q,EAxeY,IAweSa,EAxeT,KAwe+B,IAAc0C,GA1e1C,KA0esEA,EAC9F,CAiBA,SAAS0d,EAAYxY,EAAYkR,GAC/B,OAAOgH,EAAalY,EAAYkR,EAAQ3Z,EAAG2Z,EAAQ9Y,EAAG8Y,EAAQpW,KAChE,CA/CA6a,EAAMpb,UAAUsc,WAAa,EAG7BlB,EAAMpb,UAAUud,WAAa,C,kDC/b7B,QALA,SAAiB3jB,GAEf,OADsB,MAATA,GAAoBA,EAAMd,QACvB,OAAYc,EAAO,GAAK,EAC1C,C,sFClBA,IAGI,EAHcmG,OAAOC,UAGQC,eAcjC,QAJA,SAAiBhH,EAAQD,GACvB,OAAiB,MAAVC,GAAkB,EAAeiH,KAAKjH,EAAQD,EACvD,E,eCkBA,QAJA,SAAaC,EAAQC,GACnB,OAAiB,MAAVD,IAAkB,OAAQA,EAAQC,EAAM,EACjD,C,wECJA,QANA,SAAaU,GACX,OAAQA,GAASA,EAAMd,QACnB,OAAac,EAAO,IAAU,UAC9BH,CACN,C,mFC0BA,QALA,SAAahB,EAAYC,GAEvB,QADW,OAAQD,GAAc,IAAW,KAChCA,GAAY,OAAaC,EAAU,GACjD,C,kFC5CI0lB,EAAcre,OAAOC,UAGrBC,EAAiBme,EAAYne,eAsDjC,SA/Be,QAAS,SAAShH,EAAQqG,GACvCrG,EAAS8G,OAAO9G,GAEhB,IAAIN,GAAS,EACTG,EAASwG,EAAQxG,OACjBulB,EAAQvlB,EAAS,EAAIwG,EAAQ,QAAK7F,EAMtC,IAJI4kB,IAAS,OAAe/e,EAAQ,GAAIA,EAAQ,GAAI+e,KAClDvlB,EAAS,KAGFH,EAAQG,GAMf,IALA,IAAIiV,EAASzO,EAAQ3G,GACjBgR,GAAQ,OAAOoE,GACfuQ,GAAc,EACdC,EAAc5U,EAAM7Q,SAEfwlB,EAAaC,GAAa,CACjC,IAAIvlB,EAAM2Q,EAAM2U,GACZvlB,EAAQE,EAAOD,SAELS,IAAVV,IACC,OAAGA,EAAOqlB,EAAYplB,MAAUiH,EAAeC,KAAKjH,EAAQD,MAC/DC,EAAOD,GAAO+U,EAAO/U,GAEzB,CAGF,OAAOC,CACT,G,mCChDA,QAJA,SAAgBF,EAAO4B,GACrB,OAAO5B,EAAQ4B,CACjB,C,kDCoBA,QAnBA,SAAsBf,EAAOlB,EAAU8lB,GAIrC,IAHA,IAAI7lB,GAAS,EACTG,EAASc,EAAMd,SAEVH,EAAQG,GAAQ,CACvB,IAAIC,EAAQa,EAAMjB,GACd8lB,EAAU/lB,EAASK,GAEvB,GAAe,MAAX0lB,SAAiChlB,IAAbilB,EACfD,GAAYA,KAAY,OAASA,GAClCD,EAAWC,EAASC,IAE1B,IAAIA,EAAWD,EACX7lB,EAASG,CAEjB,CACA,OAAOH,CACT,C","sources":["webpack:///../../node_modules/lodash-es/_baseMap.js","webpack:///../../node_modules/lodash-es/_baseSet.js","webpack:///../../node_modules/lodash-es/_basePickBy.js","webpack:///../../node_modules/lodash-es/last.js","webpack:///../../node_modules/lodash-es/isString.js","webpack:///../../node_modules/lodash-es/_trimmedEndIndex.js","webpack:///../../node_modules/lodash-es/_baseTrim.js","webpack:///../../node_modules/lodash-es/toNumber.js","webpack:///../../node_modules/lodash-es/toFinite.js","webpack:///../../node_modules/lodash-es/toInteger.js","webpack:///../../node_modules/lodash-es/uniqueId.js","webpack:///../../node_modules/lodash-es/_baseRange.js","webpack:///../../node_modules/lodash-es/range.js","webpack:///../../node_modules/lodash-es/_createRange.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/data/list.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/greedy-fas.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/acyclic.js","webpack:///../../node_modules/lodash-es/pick.js","webpack:///../../node_modules/lodash-es/_flatRest.js","webpack:///../../node_modules/lodash-es/_basePick.js","webpack:///../../node_modules/lodash-es/_baseGt.js","webpack:///../../node_modules/lodash-es/max.js","webpack:///../../node_modules/lodash-es/mapValues.js","webpack:///../../node_modules/lodash-es/now.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/util.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/add-border-segments.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/coordinate-system.js","webpack:///../../node_modules/lodash-es/minBy.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/rank/util.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js","webpack:///../../node_modules/lodash-es/_asciiSize.js","webpack:///../../node_modules/lodash-es/_hasUnicode.js","webpack:///../../node_modules/lodash-es/_unicodeSize.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/topsort.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/dfs.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/postorder.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/alg/preorder.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/rank/index.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/nesting-graph.js","webpack:///../../node_modules/lodash-es/cloneDeep.js","webpack:///../../node_modules/lodash-es/_baseZipObject.js","webpack:///../../node_modules/lodash-es/zipObject.js","webpack:///../../node_modules/lodash-es/_compareAscending.js","webpack:///../../node_modules/lodash-es/_baseOrderBy.js","webpack:///../../node_modules/lodash-es/_baseSortBy.js","webpack:///../../node_modules/lodash-es/_compareMultiple.js","webpack:///../../node_modules/lodash-es/sortBy.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/cross-count.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/sort.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/barycenter.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/index.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js","webpack:///../../node_modules/lodash-es/forOwn.js","webpack:///../../node_modules/lodash-es/forIn.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/position/bk.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/layout.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/normalize.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/order/init-order.js","webpack:///../../node_modules/dagre-d3-es/src/dagre/position/index.js","webpack:///../../node_modules/lodash-es/findIndex.js","webpack:///../../node_modules/lodash-es/find.js","webpack:///../../node_modules/lodash-es/_createFind.js","webpack:///../../node_modules/lodash-es/union.js","webpack:///../../node_modules/dagre-d3-es/src/graphlib/graph.js","webpack:///../../node_modules/lodash-es/flatten.js","webpack:///../../node_modules/lodash-es/_baseHas.js","webpack:///../../node_modules/lodash-es/has.js","webpack:///../../node_modules/lodash-es/min.js","webpack:///../../node_modules/lodash-es/map.js","webpack:///../../node_modules/lodash-es/defaults.js","webpack:///../../node_modules/lodash-es/_baseLt.js","webpack:///../../node_modules/lodash-es/_baseExtremum.js"],"sourcesContent":["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 assignValue from './_assignValue.js';\nimport castPath from './_castPath.js';\nimport isIndex from './_isIndex.js';\nimport isObject from './isObject.js';\nimport toKey from './_toKey.js';\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nexport default baseSet;\n","import baseGet from './_baseGet.js';\nimport baseSet from './_baseSet.js';\nimport castPath from './_castPath.js';\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nexport default basePickBy;\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 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","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nexport default trimmedEndIndex;\n","import trimmedEndIndex from './_trimmedEndIndex.js';\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nexport default baseTrim;\n","import baseTrim from './_baseTrim.js';\nimport isObject from './isObject.js';\nimport isSymbol from './isSymbol.js';\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nexport default toNumber;\n","import toNumber from './toNumber.js';\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nexport default toFinite;\n","import toFinite from './toFinite.js';\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nexport default toInteger;\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","/* 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 * 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 (Object.prototype.hasOwnProperty.call(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function (e) {\n      if (Object.prototype.hasOwnProperty.call(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 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","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","/**\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","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","import root from './_root.js';\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nexport default now;\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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 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 (Object.prototype.hasOwnProperty.call(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 * 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 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 * 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 (Object.prototype.hasOwnProperty.call(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!Object.prototype.hasOwnProperty.call(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 (!Object.prototype.hasOwnProperty.call(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 (!Object.prototype.hasOwnProperty.call(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 baseClone from './_baseClone.js';\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nexport default cloneDeep;\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","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 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","/**\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 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 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';\nimport * as util from '../util.js';\n\nexport { sort };\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function (entry) {\n    return Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 (!Object.prototype.hasOwnProperty.call(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';\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 { 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';\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 (Object.prototype.hasOwnProperty.call(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","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 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 !!conflicts[v] && Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 { 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', () => {\n    var layoutGraph = time('  buildLayoutGraph', () => buildLayoutGraph(g));\n    time('  runLayout', () => runLayout(layoutGraph, time));\n    time('  updateInputGraph', () => updateInputGraph(g, layoutGraph));\n  });\n}\n\nfunction runLayout(g, time) {\n  time('    makeSpaceForEdgeLabels', () => makeSpaceForEdgeLabels(g));\n  time('    removeSelfEdges', () => removeSelfEdges(g));\n  time('    acyclic', () => acyclic.run(g));\n  time('    nestingGraph.run', () => nestingGraph.run(g));\n  time('    rank', () => rank(util.asNonCompoundGraph(g)));\n  time('    injectEdgeLabelProxies', () => injectEdgeLabelProxies(g));\n  time('    removeEmptyRanks', () => util.removeEmptyRanks(g));\n  time('    nestingGraph.cleanup', () => nestingGraph.cleanup(g));\n  time('    normalizeRanks', () => util.normalizeRanks(g));\n  time('    assignRankMinMax', () => assignRankMinMax(g));\n  time('    removeEdgeLabelProxies', () => removeEdgeLabelProxies(g));\n  time('    normalize.run', () => normalize.run(g));\n  time('    parentDummyChains', () => parentDummyChains(g));\n  time('    addBorderSegments', () => addBorderSegments(g));\n  time('    order', () => order(g));\n  time('    insertSelfEdges', () => insertSelfEdges(g));\n  time('    adjustCoordinateSystem', () => coordinateSystem.adjust(g));\n  time('    position', () => position(g));\n  time('    positionSelfEdges', () => positionSelfEdges(g));\n  time('    removeBorderNodes', () => removeBorderNodes(g));\n  time('    normalize.undo', () => normalize.undo(g));\n  time('    fixupEdgeLabelCoords', () => fixupEdgeLabelCoords(g));\n  time('    undoCoordinateSystem', () => coordinateSystem.undo(g));\n  time('    translateGraph', () => translateGraph(g));\n  time('    assignNodeIntersects', () => assignNodeIntersects(g));\n  time('    reversePoints', () => reversePointsForReversedEdges(g));\n  time('    acyclic.undo', () => acyclic.undo(g));\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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(edge, 'x')) {\n      edge.x -= minX;\n    }\n    if (Object.prototype.hasOwnProperty.call(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 (Object.prototype.hasOwnProperty.call(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","/**\n * TypeScript type imports:\n *\n * @import { Graph } from '../graphlib/graph.js';\n */\nimport * 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\n/**\n * @param {Graph} g\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  /**\n   * @typedef {Object} Attrs\n   * @property {number} width\n   * @property {number} height\n   * @property {ReturnType<Graph[\"node\"]>} edgeLabel\n   * @property {any} edgeObj\n   * @property {ReturnType<Graph[\"node\"]>[\"rank\"]} rank\n   * @property {string} [dummy]\n   * @property {ReturnType<Graph[\"node\"]>[\"labelpos\"]} [labelpos]\n   */\n\n  /** @type {Attrs | undefined} */\n  var attrs = undefined;\n  var dummy, 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      attrs.dummy = 'edge-label';\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 * 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 * as _ from 'lodash-es';\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 */\nexport function 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';\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 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 baseIteratee from './_baseIteratee.js';\nimport isArrayLike from './isArrayLike.js';\nimport keys from './keys.js';\n\n/**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\nfunction createFind(findIndexFunc) {\n  return function(collection, predicate, fromIndex) {\n    var iterable = Object(collection);\n    if (!isArrayLike(collection)) {\n      var iteratee = baseIteratee(predicate, 3);\n      collection = keys(collection);\n      predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n    }\n    var index = findIndexFunc(collection, predicate, fromIndex);\n    return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n  };\n}\n\nexport default createFind;\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 = Object.prototype.hasOwnProperty.call(opts, 'directed')\n      ? opts.directed\n      : true;\n    this._isMultigraph = Object.prototype.hasOwnProperty.call(opts, 'multigraph')\n      ? opts.multigraph\n      : false;\n    this._isCompound = Object.prototype.hasOwnProperty.call(opts, 'compound')\n      ? opts.compound\n      : 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 (Object.prototype.hasOwnProperty.call(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 Object.prototype.hasOwnProperty.call(this._nodes, v);\n  }\n  removeNode(v) {\n    if (Object.prototype.hasOwnProperty.call(this._nodes, v)) {\n      var removeEdge = (e) => this.removeEdge(this._edgeObjs[e]);\n      delete this._nodes[v];\n      if (this._isCompound) {\n        this._removeFromParentsChildList(v);\n        delete this._parent[v];\n        _.each(this.children(v), (child) => {\n          this.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 (Object.prototype.hasOwnProperty.call(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 Object.prototype.hasOwnProperty.call(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","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","/** 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","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 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 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","/**\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 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"],"names":["collection","iteratee","index","result","Array","length","value","key","object","path","customizer","isObject","lastIndex","nested","newValue","objValue","undefined","paths","predicate","array","reWhitespace","reTrimStart","string","slice","test","charAt","replace","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","INFINITY","isSymbol","other","valueOf","isBinary","remainder","idCounter","prefix","id","nativeCeil","Math","ceil","nativeMax","max","start","end","step","toFinite","fromRight","List","constructor","sentinel","_next","_prev","this","_sentinel","dequeue","entry","unlink","enqueue","toString","strs","curr","push","JSON","stringify","filterOutLinks","join","k","v","DEFAULT_WEIGHT_FN","removeNode","g","buckets","zeroIdx","collectPredecessors","results","inEdges","edge","weight","uEntry","node","w","out","assignBucket","outEdges","wEntry","run","fas","graph","acyclicer","weightFn","nodeCount","state","fasGraph","maxIn","maxOut","nodes","setNode","in","edges","e","prevWeight","edgeWeight","setEdge","map","buildState","sources","sinks","i","concat","doGreedyFAS","greedyFAS","stack","visited","dfs","Object","prototype","hasOwnProperty","call","dfsFAS","label","removeEdge","forwardName","name","reversed","func","hasIn","flatten","identity","Date","now","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","arguments","fn","console","log","notime","prop","sg","sgNode","borderType","prev","setParent","swapWidthHeight","swapWidthHeightOne","reverseYOne","swapXYOne","longestPath","minlen","Number","POSITIVE_INFINITY","slack","feasibleTree","delta","t","directed","size","tightTree","findMinSlackEdge","shiftRanks","nodeEdges","edgeV","RegExp","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","rsSymbol","vs","navigation","isDirected","successors","neighbors","bind","acc","doDfs","postorder","networkSimplex","simpleLabel","simplify","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","child","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","CLONE_DEEP_FLAG","props","values","assignFunc","valsLength","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","iteratees","orders","isArray","comparer","sort","objCriteria","criteria","othCriteria","ordersLength","crossCount","cc","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","pos","firstIndex","treeSize","forEach","weightSum","entries","biasRight","bias","parts","lhs","rhs","sortable","unsortable","sum","vsIndex","entryV","entryW","barycenter","consumeUnsortable","last","pop","sortSubgraph","cg","movable","bl","borderLeft","br","borderRight","subgraphs","barycenters","inV","nodeU","subgraphResult","target","mappedEntries","tmp","indegree","sourceSet","handleIn","vEntry","source","merged","min","handleOut","reverse","doResolveConflicts","resolveConflicts","expandSubgraphs","predecessors","blPred","brPred","buildLayerGraphs","ranks","relationship","createRootNode","compound","setDefaultNodeLabel","minRank","maxRank","buildLayerGraph","sweepLayerGraphs","layerGraphs","lg","sorted","rootPrev","prevChild","addSubgraphConstraints","assignOrder","layer","keysIn","addConflict","conflicts","conflictsV","hasConflict","positionX","adjustedLayering","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","findType1Conflicts","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","findType2Conflicts","xss","vert","horiz","inner","neighborFn","align","prevIdx","ws","mp","floor","il","verticalAlignment","xs","reverseSep","blockG","blockGraph","graphLabel","sepFn","edgeSep","labelpos","toLowerCase","sep","nodesep","edgesep","vRoot","uRoot","prevMax","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","elem","reduce","horizontalCompaction","smallestWidth","NEGATIVE_INFINITY","halfWidth","findSmallestWidthAlignment","alignTo","alignToVals","alignToMin","alignToMax","alignment","xsVals","alignCoordinates","ul","ignore","balance","layout","opts","time","debugTiming","layoutGraph","inputGraph","canonicalize","graphDefaults","selectNumberAttrs","graphNumAttrs","graphAttrs","nodeNumAttrs","nodeDefaults","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","ranksep","rankdir","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeSelfEdges","injectEdgeLabelProxies","offset","layers","assignRankMinMax","labelRank","removeEdgeLabelProxies","dummyChains","vRank","wRank","edgeLabel","points","edgeObj","normalizeEdge","postorderNums","pathData","lca","vPath","wPath","findPath","pathIdx","pathV","ascending","parentDummyChains","addBorderSegments","downLayerGraphs","upLayerGraphs","simpleNodes","orderedVs","initOrder","best","bestCC","lastBest","orderShift","selfEdge","insertSelfEdges","rankDir","rankSep","prevY","maxHeight","positionY","position","selfNode","positionSelfEdges","b","l","r","removeBorderNodes","origLabel","fixupEdgeLabelCoords","reverseY","swapXY","minX","maxX","minY","maxY","marginX","marginx","marginY","marginy","getExtremes","p","translateGraph","p1","p2","nodeV","nodeW","unshift","assignNodeIntersects","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","obj","newAttrs","findIndexFunc","fromIndex","toInteger","iterable","isArrayLike","keys","arrays","isArrayLikeObject","GRAPH_NODE","Graph","_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","freeze","incrementOrInitEntry","edgeObjToId","decrementOrRemoveEntry","outV","objectProto","guard","propsIndex","propsLength","comparator","current","computed"],"sourceRoot":""}