Many resources are needed to download a project. Please understand that we have to compensate our server costs. Thank you in advance. Project price only 1 $
You can buy this project and download/modify it how often you want.
{"mappings":"A,S,E,C,C,C,C,C,C,C,E,O,c,C,E,E,C,I,E,I,E,W,C,E,a,C,C,E,C,I,E,A,W,iB,C,E,E,Q,C,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,S,E,E,SCMI,EAAc,OAAO,SAAS,CAG9B,EAAiB,EAAY,cAAc,CAsD/C,EA/Be,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,SAAS,CAAM,CAAE,CAAO,EAC9C,EAAS,OAAO,GAEhB,IAAI,EAAQ,GACR,EAAS,EAAQ,MAAM,CACvB,EAAQ,EAAS,EAAI,CAAO,CAAC,EAAE,CAAG,KAAA,EAMtC,IAJI,GAAS,AAAA,CAAA,EAAA,EAAA,OAAa,AAAb,EAAe,CAAO,CAAC,EAAE,CAAE,CAAO,CAAC,EAAE,CAAE,IAClD,CAAA,EAAS,CAAA,EAGJ,EAAE,EAAQ,GAMf,IALA,IAAI,EAAS,CAAO,CAAC,EAAM,CACvB,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAK,AAAL,EAAO,GACf,EAAa,GACb,EAAc,EAAM,MAAM,CAEvB,EAAE,EAAa,GAAa,CACjC,IAAI,EAAM,CAAK,CAAC,EAAW,CACvB,EAAQ,CAAM,CAAC,EAAI,CAEnB,CAAA,AAAU,KAAA,IAAV,GACC,AAAA,CAAA,EAAA,EAAA,OAAC,AAAD,EAAG,EAAO,CAAW,CAAC,EAAI,GAAK,CAAC,EAAe,IAAI,CAAC,EAAQ,EAAA,GAC/D,CAAA,CAAM,CAAC,EAAI,CAAG,CAAM,CAAC,EAAI,AAAJ,CAEzB,CAGF,OAAO,CACT,E,G,E,Q,S,C,C,C,E,E,E,O,C,S,I,A,E,S,M,E,E,S,E,S,E,S,E,Q,G,E,Q,S,C,C,C,E,E,E,O,C,M,I,G,E,E,O,C,O,I,G,I,E,E,S,E,E,S,E,E,S,E,E,SExDA,SAAS,EAAI,CAAC,EACZ,IAiBI,EACA,EACA,EAnBA,EAAM,AAAwB,WAAxB,EAAE,KAAK,GAAG,SAAS,CAAgB,AAAA,CAAA,EAAA,EAAA,SAAQ,AAAR,EAAU,EAU9C,SAAU,CAAC,EAChB,OAAO,AAXwD,EAWtD,IAAI,CAAC,GAAG,MAAM,AACzB,IAKE,EAAM,EAAE,CACR,EAAQ,CAAC,EACT,EAAU,CAAC,EAkBf,EAAA,OAAA,CAAU,AArCsE,EAqCpE,KAAK,GAhBjB,SAAS,EAAI,CAAC,EACR,EAAA,OAAA,CAAM,EAAS,KAGnB,CAAO,CAAC,EAAE,CAAG,CAAA,EACb,CAAK,CAAC,EAAE,CAAG,CAAA,EACX,EAAA,OAAA,CAAU,AA3BoE,EA2BlE,QAAQ,CAAC,GAAI,SAAU,CAAC,EAC9B,EAAA,OAAA,CAAM,EAAO,EAAE,CAAC,EAClB,EAAI,IAAI,CAAC,GAET,EAAI,EAAE,CAAC,CAEX,GACA,OAAO,CAAK,CAAC,EAAE,CACjB,GAGO,GArCP,EAAA,OAAA,CAAU,EAAK,SAAU,CAAC,EACxB,IAAI,EAAQ,EAAE,IAAI,CAAC,GACnB,EAAE,UAAU,CAAC,GACb,EAAM,WAAW,CAAG,EAAE,IAAI,CAC1B,EAAM,QAAQ,CAAG,CAAA,EACjB,EAAE,OAAO,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,CAAE,EAAO,EAAA,OAAA,CAAW,OACxC,EAOF,CA2BA,SAAS,EAAK,CAAC,EACb,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAQ,EAAE,IAAI,CAAC,GACnB,GAAI,EAAM,QAAQ,CAAE,CAClB,EAAE,UAAU,CAAC,GAEb,IAAI,EAAc,EAAM,WAAW,AACnC,QAAO,EAAM,QAAQ,CACrB,OAAO,EAAM,WAAW,CACxB,EAAE,OAAO,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,CAAE,EAAO,EAC7B,CACF,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCxDI,EAAY,EAwBhB,EALA,SAAkB,CAAM,EACtB,IAAI,EAAK,EAAE,EACX,MAAO,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAAU,CAC5B,C,G,E,Q,S,C,C,C,E,E,E,O,C,Y,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCZI,EAAoB,EAAA,OAAA,CAAW,GAEnC,SAAS,EAAU,CAAC,CAAE,CAAQ,EAC5B,GAAI,AAAiB,GAAjB,EAAE,SAAS,GACb,MAAO,EAAE,CAEX,IAkEqB,EACjB,EACA,EACA,EAiBA,EAGA,EAzFA,GAkEiB,EAlEK,GAAY,EAmElC,EAAW,IAAI,EAAA,KAAI,CACnB,EAAQ,EACR,EAAS,EAEb,EAAA,OAAA,CAAU,AAvEa,EAuEX,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAS,OAAO,CAAC,EAAG,CAAE,EAAG,EAAG,GAAI,EAAG,IAAK,CAAE,EAC5C,GAIA,EAAA,OAAA,CAAU,AA7Ea,EA6EX,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAa,EAAS,IAAI,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,GAAK,EACxC,EAAS,EAAS,GAEtB,EAAS,OAAO,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,CADR,EAAa,GAE9B,EAAS,KAAK,GAAG,CAAC,EAAS,EAAS,IAAI,CAAC,EAAE,CAAC,EAAE,GAAG,EAAI,GACrD,EAAQ,KAAK,GAAG,CAAC,EAAQ,EAAS,IAAI,CAAC,EAAE,CAAC,EAAE,EAAK,EAAI,EACvD,GAEI,EAAU,EAAA,OAAA,CAAQ,EAAS,EAAQ,GAAG,GAAG,CAAC,WAC5C,OAAO,IAAI,EAAA,IAAG,AAChB,GACI,EAAU,EAAQ,EAEtB,EAAA,OAAA,CAAU,EAAS,KAAK,GAAI,SAAU,CAAC,EACrC,EAAa,EAAS,EAAS,EAAS,IAAI,CAAC,GAC/C,GAEO,CAAE,MAAO,EAAU,QAAS,EAAS,QAAS,CAAQ,GA9FzD,EAAU,AAUhB,SAAqB,CAAC,CAAE,CAAO,CAAE,CAAO,EAMtC,IALA,IAII,EAJA,EAAU,EAAE,CACZ,EAAU,CAAO,CAAC,EAAQ,MAAM,CAAG,EAAE,CACrC,EAAQ,CAAO,CAAC,EAAE,CAGf,EAAE,SAAS,IAAI,CACpB,KAAQ,EAAQ,EAAM,OAAO,IAC3B,EAAW,EAAG,EAAS,EAAS,GAElC,KAAQ,EAAQ,EAAQ,OAAO,IAC7B,EAAW,EAAG,EAAS,EAAS,GAElC,GAAI,EAAE,SAAS,GACb,CAAA,IAAK,IAAI,EAAI,EAAQ,MAAM,CAAG,EAAG,EAAI,EAAG,EAAE,EAExC,GADA,EAAQ,CAAO,CAAC,EAAE,CAAC,OAAO,GACf,CACT,EAAU,EAAQ,MAAM,CAAC,EAAW,EAAG,EAAS,EAAS,EAAO,CAAA,IAChE,KACF,CACF,CAEJ,CAEA,OAAO,CACT,EAnC4B,EAAM,KAAK,CAAE,EAAM,OAAO,CAAE,EAAM,OAAO,EAGnE,OAAO,EAAA,OAAA,CACL,EAAA,OAAA,CAAM,EAAS,SAAU,CAAC,EACxB,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,CAC5B,GAEJ,CA6BA,SAAS,EAAW,CAAC,CAAE,CAAO,CAAE,CAAO,CAAE,CAAK,CAAE,CAAmB,EACjE,IAAI,EAAU,EAAsB,EAAE,CAAG,KAAA,EAwBzC,OAtBA,EAAA,OAAA,CAAU,EAAE,OAAO,CAAC,EAAM,CAAC,EAAG,SAAU,CAAI,EAC1C,IAAI,EAAS,EAAE,IAAI,CAAC,GAChB,EAAS,EAAE,IAAI,CAAC,EAAK,CAAC,EAEtB,GACF,EAAQ,IAAI,CAAC,CAAE,EAAG,EAAK,CAAC,CAAE,EAAG,EAAK,CAAC,AAAC,GAGtC,EAAO,GAAG,EAAI,EACd,EAAa,EAAS,EAAS,EACjC,GAEA,EAAA,OAAA,CAAU,EAAE,QAAQ,CAAC,EAAM,CAAC,EAAG,SAAU,CAAI,EAC3C,IAAI,EAAS,EAAE,IAAI,CAAC,GAChB,EAAI,EAAK,CAAC,CACV,EAAS,EAAE,IAAI,CAAC,EACpB,CAAA,EAAO,EAAK,EAAI,EAChB,EAAa,EAAS,EAAS,EACjC,GAEA,EAAE,UAAU,CAAC,EAAM,CAAC,EAEb,CACT,CAkCA,SAAS,EAAa,CAAO,CAAE,CAAO,CAAE,CAAK,EACtC,EAAM,GAAG,CAEF,EAAM,EAAK,CAGrB,CAAO,CAAC,EAAM,GAAG,CAAG,EAAM,EAAK,CAAG,EAAQ,CAAC,OAAO,CAAC,GAFnD,CAAO,CAAC,EAAQ,MAAM,CAAG,EAAE,CAAC,OAAO,CAAC,GAFpC,CAAO,CAAC,EAAE,CAAC,OAAO,CAAC,EAMvB,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCxGA,EALA,SAAiB,CAAK,EAEpB,MAAO,AADM,CAAA,AAAS,MAAT,EAAgB,EAAI,EAAM,MAAM,AAAN,EACvB,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,EAAO,GAAK,EAAE,AAC5C,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,S,E,E,SCiCA,EALA,SAAa,CAAU,CAAE,CAAQ,EAE/B,MAAO,AADI,CAAA,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,GAAc,EAAA,OAAO,CAAI,EAAA,OAAM,EACtC,EAAY,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAU,GACjD,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,SC7BA,EAVA,SAAiB,CAAU,CAAE,CAAQ,EACnC,IAAI,EAAQ,GACR,EAAS,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,GAAc,MAAM,EAAW,MAAM,EAAI,EAAE,CAKpE,MAHA,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAY,SAAS,CAAK,CAAE,CAAG,CAAE,CAAU,EAClD,CAAM,CAAC,EAAE,EAAM,CAAG,EAAS,EAAO,EAAK,EACzC,GACO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GC0BA,IAAA,EAFY,AAAA,CAAA,EAAA,A,E,SAAA,OAAU,AAAV,G,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCdZ,EAlBA,SAAqB,CAAS,EAC5B,OAAO,SAAS,CAAK,CAAE,CAAG,CAAE,CAAI,EAa9B,OAZI,GAAQ,AAAe,UAAf,OAAO,GAAoB,AAAA,CAAA,EAAA,EAAA,OAAa,AAAb,EAAe,EAAO,EAAK,IAChE,CAAA,EAAM,EAAO,KAAA,CADf,EAIA,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GACb,AAAQ,KAAA,IAAR,GACF,EAAM,EACN,EAAQ,GAER,EAAM,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAEjB,EAAO,AAAS,KAAA,IAAT,EAAsB,EAAQ,EAAM,EAAI,GAAM,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GACvD,AAAA,CAAA,EAAA,EAAA,OAAQ,AAAR,EAAU,EAAO,EAAK,EAAM,EACrC,CACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GC1BA,IAAI,EAAa,KAAK,IAAI,CACtB,EAAY,KAAK,GAAG,CAyBxB,EAZA,SAAmB,CAAK,CAAE,CAAG,CAAE,CAAI,CAAE,CAAS,EAK5C,IAJA,IAAI,EAAQ,GACR,EAAS,EAAU,EAAY,AAAA,CAAA,EAAM,CAAA,EAAU,CAAA,GAAQ,CAAA,GAAK,GAC5D,EAAS,MAAM,GAEZ,KACL,CAAM,CAAC,EAAY,EAAS,EAAE,EAAM,CAAG,EACvC,GAAS,EAEX,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCtBI,EAAW,EAAI,EAsCnB,EAZA,SAAkB,CAAK,SACrB,AAAK,EAID,AADJ,CAAA,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAjB,IACc,GAAY,IAAU,CAAC,EAE5B,AADK,CAAA,EAAQ,EAAI,GAAK,CAAA,EA/Bf,sBAkCT,GAAU,EAAQ,EAAQ,EAPxB,AAAU,IAAV,EAAc,EAAQ,CAQjC,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SClCI,EAAM,EAAI,EAGV,EAAa,qBAGb,EAAa,aAGb,EAAY,cAGZ,EAAe,SA8CnB,EArBA,SAAkB,CAAK,EACrB,GAAI,AAAgB,UAAhB,OAAO,EACT,OAAO,EAET,GAAI,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GACX,OAAO,EAET,GAAI,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAAQ,CACnB,IAAI,EAAQ,AAAwB,YAAxB,OAAO,EAAM,OAAO,CAAiB,EAAM,OAAO,GAAK,EACnE,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAAU,EAAQ,GAAM,CAC3C,CACA,GAAI,AAAgB,UAAhB,OAAO,EACT,OAAO,AAAU,IAAV,EAAc,EAAQ,CAAC,EAEhC,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GACjB,IAAI,EAAW,EAAW,IAAI,CAAC,GAC/B,OAAQ,GAAY,EAAU,IAAI,CAAC,GAC/B,EAAa,EAAM,KAAK,CAAC,GAAI,EAAW,EAAI,GAC3C,EAAW,IAAI,CAAC,GAAS,EAAM,CAAC,CACvC,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SC1DI,EAAc,OAelB,EANA,SAAkB,CAAM,EACtB,OAAO,EACH,EAAO,KAAK,CAAC,EAAG,AAAA,CAAA,EAAA,EAAA,OAAc,AAAd,EAAgB,GAAU,GAAG,OAAO,CAAC,EAAa,IAClE,CACN,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GCfA,IAAI,EAAe,KAiBnB,EAPA,SAAyB,CAAM,EAG7B,IAFA,IAAI,EAAQ,EAAO,MAAM,CAElB,KAAW,EAAa,IAAI,CAAC,EAAO,MAAM,CAAC,MAClD,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,O,I,ECTA,OAAM,EACJ,aAAc,CACZ,IAAI,EAAW,CAAC,CAChB,CAAA,EAAS,KAAK,CAAG,EAAS,KAAK,CAAG,EAClC,IAAI,CAAC,SAAS,CAAG,CACnB,CACA,SAAU,CACR,IAAI,EAAW,IAAI,CAAC,SAAS,CACzB,EAAQ,EAAS,KAAK,CAC1B,GAAI,IAAU,EAEZ,OADA,EAAO,GACA,CAEX,CACA,QAAQ,CAAK,CAAE,CACb,IAAI,EAAW,IAAI,CAAC,SAAS,AACzB,CAAA,EAAM,KAAK,EAAI,EAAM,KAAK,EAC5B,EAAO,GAET,EAAM,KAAK,CAAG,EAAS,KAAK,CAC5B,EAAS,KAAK,CAAC,KAAK,CAAG,EACvB,EAAS,KAAK,CAAG,EACjB,EAAM,KAAK,CAAG,CAChB,CACA,UAAW,CAIT,IAHA,IAAI,EAAO,EAAE,CACT,EAAW,IAAI,CAAC,SAAS,CACzB,EAAO,EAAS,KAAK,CAClB,IAAS,GACd,EAAK,IAAI,CAAC,KAAK,SAAS,CAAC,EAAM,IAC/B,EAAO,EAAK,KAAK,CAEnB,MAAO,IAAM,EAAK,IAAI,CAAC,MAAQ,GACjC,CACF,CAEA,SAAS,EAAO,CAAK,EACnB,EAAM,KAAK,CAAC,KAAK,CAAG,EAAM,KAAK,CAC/B,EAAM,KAAK,CAAC,KAAK,CAAG,EAAM,KAAK,CAC/B,OAAO,EAAM,KAAK,CAClB,OAAO,EAAM,KAAK,AACpB,CAEA,SAAS,EAAe,CAAC,CAAE,CAAC,EAC1B,GAAI,AAAM,UAAN,GAAiB,AAAM,UAAN,EACnB,OAAO,CAEX,C,G,E,Q,S,C,C,C,E,E,E,O,C,S,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCvCA,SAAS,EAAO,CAAC,CAAE,CAAI,EACrB,IAAI,EAAO,GAAQ,EAAK,WAAW,CAAG,EAAA,IAAA,CAAY,EAAlD,MAAA,CACA,EAAK,SAAU,WACb,IAAI,EAAc,EAAK,qBAAsB,eA4J3C,EACA,EA5JA,OA2JA,EAAI,IAAI,EAAA,KAAI,CAAE,CAAE,WAAY,CAAA,EAAM,SAAU,CAAA,CAAK,GACjD,EAAQ,EAAa,AA5JG,EA4JQ,KAAK,IAEzC,EAAE,QAAQ,CACR,EAAA,OAAA,CAAQ,CAAC,EAAG,EAAe,EAAkB,EAAO,GAAgB,EAAA,OAAA,CAAO,EAAO,KAGpF,EAAA,OAAA,CAAU,AAlKkB,EAkKP,KAAK,GAAI,SAAU,CAAC,EACvC,IAAI,EAAO,EAAa,AAnKE,EAmKS,IAAI,CAAC,IACxC,EAAE,OAAO,CAAC,EAAG,EAAA,OAAA,CAAW,EAAkB,EAAM,GAAe,IAC/D,EAAE,SAAS,CAAC,EAAG,AArKW,EAqKA,MAAM,CAAC,GACnC,GAEA,EAAA,OAAA,CAAU,AAxKkB,EAwKP,KAAK,GAAI,SAAU,CAAC,EACvC,IAAI,EAAO,EAAa,AAzKE,EAyKS,IAAI,CAAC,IACxC,EAAE,OAAO,CACP,EACA,EAAA,OAAA,CAAQ,CAAC,EAAG,EAAc,EAAkB,EAAM,GAAe,EAAA,OAAA,CAAO,EAAM,IAElF,GAEO,CA/KL,GACA,EAAK,cAAe,WAUtB,AAT2B,EAStB,6BAA8B,eAgL/B,EAAA,EAAQ,AAzLE,EAyLA,KAAK,GACnB,EAAM,OAAO,EAAI,EACjB,EAAA,OAAA,CAAU,AA3LI,EA2LF,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AA5LC,EA4LC,IAAI,CAAC,EAClB,CAAA,EAAK,MAAM,EAAI,EACqB,MAAhC,EAAK,QAAQ,CAAC,WAAW,KACvB,AAAkB,OAAlB,EAAM,OAAO,EAAa,AAAkB,OAAlB,EAAM,OAAO,CACzC,EAAK,KAAK,EAAI,EAAK,WAAW,CAE9B,EAAK,MAAM,EAAI,EAAK,WAAW,CAGrC,EA1LA,GACA,AAZ2B,EAYtB,sBAAuB,WAsW5B,EAAA,OAAA,CAAU,AAlXI,EAkXF,KAAK,GAAI,SAAU,CAAC,EAC9B,GAAI,EAAE,CAAC,GAAK,EAAE,CAAC,CAAE,CACf,IAAI,EAAO,AApXD,EAoXG,IAAI,CAAC,EAAE,CAAC,CAChB,CAAA,EAAK,SAAS,EACjB,CAAA,EAAK,SAAS,CAAG,EAAE,AAAF,EAEnB,EAAK,SAAS,CAAC,IAAI,CAAC,CAAE,EAAG,EAAG,MAAO,AAxXzB,EAwX2B,IAAI,CAAC,EAAG,GAC7C,AAzXU,EAyXR,UAAU,CAAC,EACf,CACF,EA7WA,GACA,AAf2B,EAetB,cAAe,WAClB,EAAA,GAAA,CAhBY,EAiBd,GACA,AAlB2B,EAkBtB,uBAAwB,WAC3B,EAAA,GAAA,CAnBY,EAoBd,GACA,AArB2B,EAqBtB,WAAY,WACf,AAAA,CAAA,EAAA,EAAA,IAAG,AAAH,EAAK,EAAA,kBAAA,CAtBO,GAuBd,GACA,AAxB2B,EAwBtB,6BAA8B,WAuLnC,EAAA,OAAA,CAAU,AA/MI,EA+MF,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AAhNC,EAgNC,IAAI,CAAC,GAClB,GAAI,EAAK,KAAK,EAAI,EAAK,MAAM,CAAE,CAC7B,IAAI,EAAI,AAlNE,EAkNA,IAAI,CAAC,EAAE,CAAC,EAEd,EAAQ,CAAE,KAAM,AAAC,CAAA,AADb,AAnNE,EAmNA,IAAI,CAAC,EAAE,CAAC,EACK,IAAI,CAAG,EAAE,IAAG,AAAH,EAAQ,EAAI,EAAE,IAAI,CAAE,EAAG,CAAE,EACzD,EAAA,YAAA,CArNU,EAqNW,aAAc,EAAO,MAC5C,CACF,EA7LA,GACA,AA3B2B,EA2BtB,uBAAwB,WAC3B,EAAA,gBAAA,CA5BY,EA6Bd,GACA,AA9B2B,EA8BtB,2BAA4B,WAC/B,EAAA,OAAA,CA/BY,EAgCd,GACA,AAjC2B,EAiCtB,qBAAsB,WACzB,EAAA,cAAA,CAlCY,EAmCd,GACA,AApC2B,EAoCtB,uBAAwB,eAuLzB,EAAA,EAAU,EACd,EAAA,OAAA,CAAU,AA5NI,EA4NF,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AA7NC,EA6NC,IAAI,CAAC,EACd,CAAA,EAAK,SAAS,GAChB,EAAK,OAAO,CAAG,AA/NL,EA+NO,IAAI,CAAC,EAAK,SAAS,EAAE,IAAI,CAC1C,EAAK,OAAO,CAAG,AAhOL,EAgOO,IAAI,CAAC,EAAK,YAAY,EAAE,IAAI,CAE7C,EAAU,EAAA,OAAA,CAAM,EAAS,EAAK,OAAO,EAEzC,GACA,AArOc,EAqOZ,KAAK,GAAG,OAAO,CAAG,CA/LpB,GACA,AAvC2B,EAuCtB,6BAA8B,WAkMnC,EAAA,OAAA,CAAU,AAzOI,EAyOF,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AA1OC,EA0OC,IAAI,CAAC,EACC,CAAA,eAAf,EAAK,KAAK,GACZ,AA5OU,EA4OR,IAAI,CAAC,EAAK,CAAC,EAAE,SAAS,CAAG,EAAK,IAAI,CACpC,AA7OU,EA6OR,UAAU,CAAC,GAEjB,EAtMA,GACA,AA1C2B,EA0CtB,oBAAqB,WACxB,EAAA,GAAA,CA3CY,EA4Cd,GACA,AA7C2B,EA6CtB,wBAAyB,WAC5B,AAAA,CAAA,EAAA,EAAA,iBAAgB,AAAhB,EA9CY,EA+Cd,GACA,AAhD2B,EAgDtB,wBAAyB,WAC5B,AAAA,CAAA,EAAA,EAAA,iBAAgB,AAAhB,EAjDY,EAkDd,GACA,AAnD2B,EAmDtB,YAAa,WAChB,AAAA,CAAA,EAAA,EAAA,KAAI,AAAJ,EApDY,EAqDd,GACA,AAtD2B,EAsDtB,sBAAuB,eAyUxB,EAAA,EAAS,EAAA,gBAAA,CA/XC,GAgYd,EAAA,OAAA,CAAU,EAAQ,SAAU,CAAK,EAC/B,IAAI,EAAa,EACjB,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,CAAE,CAAC,EAC7B,IAAI,EAAO,AAnYD,EAmYG,IAAI,CAAC,EAClB,CAAA,EAAK,KAAK,CAAG,EAAI,EACjB,EAAA,OAAA,CAAU,EAAK,SAAS,CAAE,SAAU,CAAQ,EAC1C,EAAA,YAAA,CAtYQ,EAwYN,WACA,CACE,MAAO,EAAS,KAAK,CAAC,KAAK,CAC3B,OAAQ,EAAS,KAAK,CAAC,MAAM,CAC7B,KAAM,EAAK,IAAI,CACf,MAAO,GAAI,EAAE,EACb,EAAG,EAAS,CAAC,CACb,MAAO,EAAS,KAAK,AACvB,EACA,MAEJ,GACA,OAAO,EAAK,SAAS,AACvB,EACF,EA9VA,GACA,AAzD2B,EAyDtB,6BAA8B,WACjC,EAAA,MAAA,CA1DY,EA2Dd,GACA,AA5D2B,EA4DtB,eAAgB,WACnB,AAAA,CAAA,EAAA,EAAA,QAAO,AAAP,EA7DY,EA8Dd,GACA,AA/D2B,EA+DtB,wBAAyB,WA2V9B,EAAA,OAAA,CAAU,AA1ZI,EA0ZF,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AA3ZC,EA2ZC,IAAI,CAAC,GAClB,GAAI,AAAe,aAAf,EAAK,KAAK,CAAiB,CAC7B,IAAI,EAAW,AA7ZL,EA6ZO,IAAI,CAAC,EAAK,CAAC,CAAC,CAAC,EAC1B,EAAI,EAAS,CAAC,CAAG,EAAS,KAAK,CAAG,EAClC,EAAI,EAAS,CAAC,CACd,EAAK,EAAK,CAAC,CAAG,EACd,EAAK,EAAS,MAAM,CAAG,EAC3B,AAlaU,EAkaR,OAAO,CAAC,EAAK,CAAC,CAAE,EAAK,KAAK,EAC5B,AAnaU,EAmaR,UAAU,CAAC,GACb,EAAK,KAAK,CAAC,MAAM,CAAG,CAClB,CAAE,EAAG,EAAK,EAAI,EAAM,EAAG,EAAG,EAAI,CAAG,EACjC,CAAE,EAAG,EAAK,EAAI,EAAM,EAAG,EAAG,EAAI,CAAG,EACjC,CAAE,EAAG,EAAI,EAAI,EAAG,CAAE,EAClB,CAAE,EAAG,EAAK,EAAI,EAAM,EAAG,EAAG,EAAI,CAAG,EACjC,CAAE,EAAG,EAAK,EAAI,EAAM,EAAG,EAAG,EAAI,CAAG,EAClC,CACD,EAAK,KAAK,CAAC,CAAC,CAAG,EAAK,CAAC,CACrB,EAAK,KAAK,CAAC,CAAC,CAAG,EAAK,CAAC,AACvB,CACF,EA7WA,GACA,AAlE2B,EAkEtB,wBAAyB,WAyR9B,EAAA,OAAA,CAAU,AA3VI,EA2VF,KAAK,GAAI,SAAU,CAAC,EAC9B,GAAI,AA5VQ,EA4VN,QAAQ,CAAC,GAAG,MAAM,CAAE,CACxB,IAAI,EAAO,AA7VD,EA6VG,IAAI,CAAC,GACd,EAAI,AA9VE,EA8VA,IAAI,CAAC,EAAK,SAAS,EACzB,EAAI,AA/VE,EA+VA,IAAI,CAAC,EAAK,YAAY,EAC5B,EAAI,AAhWE,EAgWA,IAAI,CAAC,EAAA,OAAA,CAAO,EAAK,UAAU,GACjC,EAAI,AAjWE,EAiWA,IAAI,CAAC,EAAA,OAAA,CAAO,EAAK,WAAW,EAEtC,CAAA,EAAK,KAAK,CAAG,KAAK,GAAG,CAAC,EAAE,CAAC,CAAG,EAAE,CAAC,EAC/B,EAAK,MAAM,CAAG,KAAK,GAAG,CAAC,EAAE,CAAC,CAAG,EAAE,CAAC,EAChC,EAAK,CAAC,CAAG,EAAE,CAAC,CAAG,EAAK,KAAK,CAAG,EAC5B,EAAK,CAAC,CAAG,EAAE,CAAC,CAAG,EAAK,MAAM,CAAG,CAC/B,CACF,GAEA,EAAA,OAAA,CAAU,AA1WI,EA0WF,KAAK,GAAI,SAAU,CAAC,EACN,WAApB,AA3WQ,EA2WN,IAAI,CAAC,GAAG,KAAK,EACjB,AA5WU,EA4WR,UAAU,CAAC,EAEjB,EA1SA,GACA,AArE2B,EAqEtB,qBAAsB,WACzB,EAAA,IAAA,CAtEY,EAuEd,GACA,AAxE2B,EAwEtB,2BAA4B,WAuPjC,EAAA,OAAA,CAAU,AA/TI,EA+TF,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AAhUC,EAgUC,IAAI,CAAC,GAClB,GAAI,EAAA,OAAA,CAAM,EAAM,KAId,OAHI,CAAA,AAAkB,MAAlB,EAAK,QAAQ,EAAY,AAAkB,MAAlB,EAAK,QAAQ,AAAK,GAC7C,CAAA,EAAK,KAAK,EAAI,EAAK,WAAW,AAAX,EAEb,EAAK,QAAQ,EACnB,IAAK,IACH,EAAK,CAAC,EAAI,EAAK,KAAK,CAAG,EAAI,EAAK,WAAW,CAC3C,KACF,KAAK,IACH,EAAK,CAAC,EAAI,EAAK,KAAK,CAAG,EAAI,EAAK,WAAW,AAE/C,CAEJ,EApQA,GACA,AA3E2B,EA2EtB,2BAA4B,WAC/B,EAAA,IAAA,CA5EY,EA6Ed,GACA,AA9E2B,EA8EtB,qBAAsB,WACzB,AAmKJ,CAAA,SAAwB,CAAC,EACvB,IAAI,EAAO,OAAO,iBAAiB,CAC/B,EAAO,EACP,EAAO,OAAO,iBAAiB,CAC/B,EAAO,EACP,EAAa,EAAE,KAAK,GACpB,EAAU,EAAW,OAAO,EAAI,EAChC,EAAU,EAAW,OAAO,EAAI,EAEpC,SAAS,EAAY,CAAK,EACxB,IAAI,EAAI,EAAM,CAAC,CACX,EAAI,EAAM,CAAC,CACX,EAAI,EAAM,KAAK,CACf,EAAI,EAAM,MAAM,CACpB,EAAO,KAAK,GAAG,CAAC,EAAM,EAAI,EAAI,GAC9B,EAAO,KAAK,GAAG,CAAC,EAAM,EAAI,EAAI,GAC9B,EAAO,KAAK,GAAG,CAAC,EAAM,EAAI,EAAI,GAC9B,EAAO,KAAK,GAAG,CAAC,EAAM,EAAI,EAAI,EAChC,CAEA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAY,EAAE,IAAI,CAAC,GACrB,GACA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,EAAE,IAAI,CAAC,GACd,EAAA,OAAA,CAAM,EAAM,MACd,EAAY,EAEhB,GAEA,GAAQ,EACR,GAAQ,EAER,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,EAAE,IAAI,CAAC,EAClB,CAAA,EAAK,CAAC,EAAI,EACV,EAAK,CAAC,EAAI,CACZ,GAEA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,EAAE,IAAI,CAAC,GAClB,EAAA,OAAA,CAAU,EAAK,MAAM,CAAE,SAAU,CAAC,EAChC,EAAE,CAAC,EAAI,EACP,EAAE,CAAC,EAAI,CACT,GACI,EAAA,OAAA,CAAM,EAAM,MACd,CAAA,EAAK,CAAC,EAAI,CADZ,EAGI,EAAA,OAAA,CAAM,EAAM,MACd,CAAA,EAAK,CAAC,EAAI,CADZ,CAGF,GAEA,EAAW,KAAK,CAAG,EAAO,EAAO,EACjC,EAAW,MAAM,CAAG,EAAO,EAAO,CACpC,CAAA,EAzSgB,EAgFd,GACA,AAjF2B,EAiFtB,2BAA4B,WA2NjC,EAAA,OAAA,CAAU,AA5SI,EA4SF,KAAK,GAAI,SAAU,CAAC,EAC9B,IAGI,EAAI,EAHJ,EAAO,AA7SC,EA6SC,IAAI,CAAC,GACd,EAAQ,AA9SA,EA8SE,IAAI,CAAC,EAAE,CAAC,EAClB,EAAQ,AA/SA,EA+SE,IAAI,CAAC,EAAE,CAAC,CAEjB,CAAA,EAAK,MAAM,EAKd,EAAK,EAAK,MAAM,CAAC,EAAE,CACnB,EAAK,EAAK,MAAM,CAAC,EAAK,MAAM,CAAC,MAAM,CAAG,EAAE,GALxC,EAAK,MAAM,CAAG,EAAE,CAChB,EAAK,EACL,EAAK,GAKP,EAAK,MAAM,CAAC,OAAO,CAAC,EAAA,aAAA,CAAmB,EAAO,IAC9C,EAAK,MAAM,CAAC,IAAI,CAAC,EAAA,aAAA,CAAmB,EAAO,GAC7C,EAxOA,GACA,AApF2B,EAoFtB,oBAAqB,WA8P1B,EAAA,OAAA,CAAU,AAlVI,EAkVF,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AAnVC,EAmVC,IAAI,CAAC,EACd,CAAA,EAAK,QAAQ,EACf,EAAK,MAAM,CAAC,OAAO,EAEvB,EAjQA,GACA,AAvF2B,EAuFtB,mBAAoB,WACvB,EAAA,IAAA,CAxFY,EAyFd,EAxFE,GACA,EAAK,qBAAsB,WAiG7B,EAAA,OAAA,CAAU,AAhGW,EAgGA,KAAK,GAAI,SAAU,CAAC,EACvC,IAAI,EAAa,AAjGE,EAiGS,IAAI,CAAC,GAC7B,EAAc,AAlGI,EAkGQ,IAAI,CAAC,GAE/B,IACF,EAAW,CAAC,CAAG,EAAY,CAAC,CAC5B,EAAW,CAAC,CAAG,EAAY,CAAC,CAExB,AAxGgB,EAwGJ,QAAQ,CAAC,GAAG,MAAM,GAChC,EAAW,KAAK,CAAG,EAAY,KAAK,CACpC,EAAW,MAAM,CAAG,EAAY,MAAM,EAG5C,GAEA,EAAA,OAAA,CAAU,AA/GW,EA+GA,KAAK,GAAI,SAAU,CAAC,EACvC,IAAI,EAAa,AAhHE,EAgHS,IAAI,CAAC,GAC7B,EAAc,AAjHI,EAiHQ,IAAI,CAAC,EAEnC,CAAA,EAAW,MAAM,CAAG,EAAY,MAAM,CAClC,EAAA,OAAA,CAAM,EAAa,OACrB,EAAW,CAAC,CAAG,EAAY,CAAC,CAC5B,EAAW,CAAC,CAAG,EAAY,CAAC,CAEhC,GAEA,AA1HqB,EA0HV,KAAK,GAAG,KAAK,CAAG,AA1HH,EA0He,KAAK,GAAG,KAAK,CACpD,AA3HqB,EA2HV,KAAK,GAAG,MAAM,CAAG,AA3HJ,EA2HgB,KAAK,GAAG,MAAM,AA1HpD,EACF,EACF,CA2HA,IAAI,EAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,UAAU,CACvE,EAAgB,CAAE,QAAS,GAAI,QAAS,GAAI,QAAS,GAAI,QAAS,IAAK,EACvE,EAAa,CAAC,YAAa,SAAU,UAAW,QAAQ,CACxD,EAAe,CAAC,QAAS,SAAS,CAClC,EAAe,CAAE,MAAO,EAAG,OAAQ,CAAE,EACrC,EAAe,CAAC,SAAU,SAAU,QAAS,SAAU,cAAc,CACrE,EAAe,CACjB,OAAQ,EACR,OAAQ,EACR,MAAO,EACP,OAAQ,EACR,YAAa,GACb,SAAU,GACZ,EACI,EAAY,CAAC,WAAW,CAkS5B,SAAS,EAAkB,CAAG,CAAE,CAAK,EACnC,OAAO,EAAA,OAAA,CAAY,EAAA,OAAA,CAAO,EAAK,GAAQ,OACzC,CAEA,SAAS,EAAa,CAAK,EACzB,IAAI,EAAW,CAAC,EAIhB,OAHA,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,CAAE,CAAC,EAC7B,CAAQ,CAAC,EAAE,WAAW,GAAG,CAAG,CAC9B,GACO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GC9bA,IAAA,EALA,SAAc,CAAK,EACjB,IAAI,EAAS,AAAS,MAAT,EAAgB,EAAI,EAAM,MAAM,CAC7C,OAAO,EAAS,CAAK,CAAC,EAAS,EAAE,CAAG,KAAA,CACtC,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCyBA,EAVA,SAAmB,CAAM,CAAE,CAAQ,EACjC,IAAI,EAAS,CAAC,EAMd,OALA,EAAW,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAU,GAElC,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,EAAQ,SAAS,CAAK,CAAE,CAAG,CAAE,CAAM,EAC5C,AAAA,CAAA,EAAA,EAAA,OAAc,AAAd,EAAgB,EAAQ,EAAK,EAAS,EAAO,EAAK,GACpD,GACO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCZA,EANA,SAAa,CAAK,EAChB,OAAQ,GAAS,EAAM,MAAM,CACzB,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAO,EAAA,OAAO,CAAG,EAAA,OAAK,EACnC,KAAA,CACN,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCKA,EAnBA,SAAsB,CAAK,CAAE,CAAQ,CAAE,CAAU,EAI/C,IAHA,IAAI,EAAQ,GACR,EAAS,EAAM,MAAM,CAElB,EAAE,EAAQ,GAAQ,CACvB,IAAI,EAAQ,CAAK,CAAC,EAAM,CACpB,EAAU,EAAS,GAEvB,GAAI,AAAW,MAAX,GAAoB,CAAA,AAAa,KAAA,IAAb,EACf,GAAY,GAAW,CAAC,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAClC,EAAW,EAAS,EAAA,EAE1B,IAAI,EAAW,EACX,EAAS,CAEjB,CACA,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GChBA,IAAA,EAJA,SAAgB,CAAK,CAAE,CAAK,EAC1B,OAAO,EAAQ,CACjB,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCaA,EAJW,AAAA,CAAA,EAAA,A,E,SAAA,OAAO,AAAP,EAAS,SAAS,CAAM,CAAE,CAAK,EACxC,OAAO,AAAU,MAAV,EAAiB,CAAC,EAAI,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAQ,EAChD,E,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,SCJA,EANA,SAAkB,CAAM,CAAE,CAAK,EAC7B,MAAO,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,EAAQ,EAAO,SAAS,CAAK,CAAE,CAAI,EACnD,MAAO,AAAA,CAAA,EAAA,EAAA,OAAI,AAAJ,EAAM,EAAQ,EACvB,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCaA,EAhBA,SAAoB,CAAM,CAAE,CAAK,CAAE,CAAS,EAK1C,IAJA,IAAI,EAAQ,GACR,EAAS,EAAM,MAAM,CACrB,EAAS,CAAC,EAEP,EAAE,EAAQ,GAAQ,CACvB,IAAI,EAAO,CAAK,CAAC,EAAM,CACnB,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,EAAQ,GAExB,EAAU,EAAO,IACnB,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAM,GAAS,EAE5C,CACA,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCuBA,EAlCA,SAAiB,CAAM,CAAE,CAAI,CAAE,CAAK,CAAE,CAAU,EAC9C,GAAI,CAAC,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GACZ,OAAO,EAET,EAAO,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAM,GAOtB,IALA,IAAI,EAAQ,GACR,EAAS,EAAK,MAAM,CACpB,EAAY,EAAS,EACrB,EAAS,EAEN,AAAU,MAAV,GAAkB,EAAE,EAAQ,GAAQ,CACzC,IAAI,EAAM,AAAA,CAAA,EAAA,EAAA,OAAI,AAAJ,EAAM,CAAI,CAAC,EAAM,EACvB,EAAW,EAEf,GAAI,AAAQ,cAAR,GAAuB,AAAQ,gBAAR,GAAyB,AAAQ,cAAR,EAClD,MAGF,GAAI,GAAS,EAAW,CACtB,IAAI,EAAW,CAAM,CAAC,EAAI,AAET,MAAA,IADjB,CAAA,EAAW,EAAa,EAAW,EAAU,EAAK,GAAU,KAAA,CAA5D,GAEE,CAAA,EAAW,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAChB,EACC,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,CAAI,CAAC,EAAQ,EAAE,EAAI,EAAE,CAAG,CAAC,CAAA,CAE1C,CACA,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,EAAQ,EAAK,GACzB,EAAS,CAAM,CAAC,EAAI,AACtB,CACA,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCjCA,EAJA,SAAkB,CAAI,EACpB,MAAO,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAM,KAAA,EAAW,EAAA,OAAM,EAAI,EAAO,GAChE,C,G,E,Q,S,C,C,C,E,E,E,O,C,oB,I,G,I,E,E,S,E,E,S,E,E,SCRA,SAAS,EAAkB,CAAC,EAkB1B,EAAA,OAAA,CAAU,EAAE,QAAQ,GAjBpB,SAAS,EAAI,CAAC,EACZ,IAAI,EAAW,EAAE,QAAQ,CAAC,GACtB,EAAO,EAAE,IAAI,CAAC,GAKlB,GAJI,EAAS,MAAM,EACjB,EAAA,OAAA,CAAU,EAAU,GAGlB,EAAA,OAAA,CAAM,EAAM,WAAY,CAC1B,EAAK,UAAU,CAAG,EAAE,CACpB,EAAK,WAAW,CAAG,EAAE,CACrB,IAAK,IAAI,EAAO,EAAK,OAAO,CAAE,EAAU,EAAK,OAAO,CAAG,EAAG,EAAO,EAAS,EAAE,EAC1E,EAAc,EAAG,aAAc,MAAO,EAAG,EAAM,GAC/C,EAAc,EAAG,cAAe,MAAO,EAAG,EAAM,EAEpD,CACF,EAGF,CAEA,SAAS,EAAc,CAAC,CAAE,CAAI,CAAE,CAAM,CAAE,CAAE,CAAE,CAAM,CAAE,CAAI,EAEtD,IAAI,EAAO,CAAM,CAAC,EAAK,CAAC,EAAO,EAAE,CAC7B,EAAO,EAAA,YAAA,CAAkB,EAAG,SAFpB,CAAE,MAAO,EAAG,OAAQ,EAAG,KAAM,EAAM,WAAY,CAAK,EAEf,EACjD,CAAA,CAAM,CAAC,EAAK,CAAC,EAAK,CAAG,EACrB,EAAE,SAAS,CAAC,EAAM,GACd,GACF,EAAE,OAAO,CAAC,EAAM,EAAM,CAAE,OAAQ,CAAE,EAEtC,C,G,E,Q,S,C,C,C,E,E,E,O,C,e,I,G,E,E,O,C,W,I,G,E,E,O,C,qB,I,G,E,E,O,C,gB,I,G,E,E,O,C,mB,I,G,E,E,O,C,iB,I,G,E,E,O,C,mB,I,G,E,E,O,C,gB,I,G,E,E,O,C,U,I,G,E,E,O,C,Y,I,G,E,E,O,C,O,I,G,E,E,O,C,S,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,S,I,E,E,SCZA,SAAS,EAAa,CAAC,CAAE,CAAI,CAAE,CAAK,CAAE,CAAI,EACxC,IAAI,EACJ,GACE,EAAI,EAAA,OAAA,CAAW,SACR,EAAE,OAAO,CAAC,GAAI,AAIvB,OAFA,EAAM,KAAK,CAAG,EACd,EAAE,OAAO,CAAC,EAAG,GACN,CACT,CAMA,SAAS,EAAS,CAAC,EACjB,IAAI,EAAa,GAAI,CAAA,EAAA,EAAA,KAAI,AAAJ,IAAQ,QAAQ,CAAC,EAAE,KAAK,IAY7C,OAXA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAW,OAAO,CAAC,EAAG,EAAE,IAAI,CAAC,GAC/B,GACA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAc,EAAW,IAAI,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,GAAK,CAAE,OAAQ,EAAG,OAAQ,CAAE,EAClE,EAAQ,EAAE,IAAI,CAAC,GACnB,EAAW,OAAO,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,CAAE,CAC3B,OAAQ,EAAY,MAAM,CAAG,EAAM,MAAM,CACzC,OAAQ,KAAK,GAAG,CAAC,EAAY,MAAM,CAAE,EAAM,MAAM,CACnD,EACF,GACO,CACT,CAEA,SAAS,EAAmB,CAAC,EAC3B,IAAI,EAAa,GAAI,CAAA,EAAA,EAAA,KAAI,AAAJ,EAAM,CAAE,WAAY,EAAE,YAAY,EAAG,GAAG,QAAQ,CAAC,EAAE,KAAK,IAS7E,OARA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EACzB,EAAE,QAAQ,CAAC,GAAG,MAAM,EACvB,EAAW,OAAO,CAAC,EAAG,EAAE,IAAI,CAAC,GAEjC,GACA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAW,OAAO,CAAC,EAAG,EAAE,IAAI,CAAC,GAC/B,GACO,CACT,CA4BA,SAAS,EAAc,CAAI,CAAE,CAAK,EAChC,IAcI,EAAI,EAdJ,EAAI,EAAK,CAAC,CACV,EAAI,EAAK,CAAC,CAIV,EAAK,EAAM,CAAC,CAAG,EACf,EAAK,EAAM,CAAC,CAAG,EACf,EAAI,EAAK,KAAK,CAAG,EACjB,EAAI,EAAK,MAAM,CAAG,EAEtB,GAAI,CAAC,GAAM,CAAC,EACV,MAAM,AAAI,MAAM,6DAoBlB,OAhBI,KAAK,GAAG,CAAC,GAAM,EAAI,KAAK,GAAG,CAAC,GAAM,GAEhC,EAAK,GACP,CAAA,EAAI,CAAC,CAAA,EAEP,EAAM,EAAI,EAAM,EAChB,EAAK,IAGD,EAAK,GACP,CAAA,EAAI,CAAC,CAAA,EAEP,EAAK,EACL,EAAM,EAAI,EAAM,GAGX,CAAE,EAAG,EAAI,EAAI,EAAG,EAAI,CAAG,CAChC,CAMA,SAAS,EAAiB,CAAC,EACzB,IAAI,EAAW,EAAA,OAAA,CAAM,EAAA,OAAA,CAAQ,EAAQ,GAAK,GAAI,WAC5C,MAAO,EAAE,AACX,GAQA,OAPA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,EAAE,IAAI,CAAC,GACd,EAAO,EAAK,IAAI,CACf,EAAA,OAAA,CAAc,IACjB,CAAA,CAAQ,CAAC,EAAK,CAAC,EAAK,KAAK,CAAC,CAAG,CAAA,CAEjC,GACO,CACT,CAMA,SAAS,EAAe,CAAC,EACvB,IAAI,EAAM,EAAA,OAAA,CACR,EAAA,OAAA,CAAM,EAAE,KAAK,GAAI,SAAU,CAAC,EAC1B,OAAO,EAAE,IAAI,CAAC,GAAG,IAAI,AACvB,IAEF,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,EAAE,IAAI,CAAC,GACd,EAAA,OAAA,CAAM,EAAM,SACd,CAAA,EAAK,IAAI,EAAI,CADf,CAGF,EACF,CAEA,SAAS,EAAiB,CAAC,EAEzB,IAAI,EAAS,EAAA,OAAA,CACX,EAAA,OAAA,CAAM,EAAE,KAAK,GAAI,SAAU,CAAC,EAC1B,OAAO,EAAE,IAAI,CAAC,GAAG,IAAI,AACvB,IAGE,EAAS,EAAE,CACf,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,EAAE,IAAI,CAAC,GAAG,IAAI,CAAG,CACvB,CAAA,CAAM,CAAC,EAAK,EACf,CAAA,CAAM,CAAC,EAAK,CAAG,EAAE,AAAF,EAEjB,CAAM,CAAC,EAAK,CAAC,IAAI,CAAC,EACpB,GAEA,IAAI,EAAQ,EACR,EAAiB,EAAE,KAAK,GAAG,cAAc,CAC7C,EAAA,OAAA,CAAU,EAAQ,SAAU,CAAE,CAAE,CAAC,EAC3B,EAAA,OAAA,CAAc,IAAO,EAAI,GAAmB,EAC9C,EAAE,EACO,GACT,EAAA,OAAA,CAAU,EAAI,SAAU,CAAC,EACvB,EAAE,IAAI,CAAC,GAAG,IAAI,EAAI,CACpB,EAEJ,EACF,CAEA,SAAS,EAAc,CAAC,CAAE,CAAM,CAAE,CAAI,CAAE,CAAK,EAC3C,IAAI,EAAO,CACT,MAAO,EACP,OAAQ,CACV,EAKA,OAJI,UAAU,MAAM,EAAI,IACtB,EAAK,IAAI,CAAG,EACZ,EAAK,KAAK,CAAG,GAER,EAAa,EAAG,SAAU,EAAM,EACzC,CAEA,SAAS,EAAQ,CAAC,EAChB,OAAO,EAAA,OAAA,CACL,EAAA,OAAA,CAAM,EAAE,KAAK,GAAI,SAAU,CAAC,EAC1B,IAAI,EAAO,EAAE,IAAI,CAAC,GAAG,IAAI,CACzB,GAAI,CAAC,EAAA,OAAA,CAAc,GACjB,OAAO,CAEX,GAEJ,CAOA,SAAS,EAAU,CAAU,CAAE,CAAE,EAC/B,IAAI,EAAS,CAAE,IAAK,EAAE,CAAE,IAAK,EAAE,AAAC,EAQhC,OAPA,EAAA,OAAA,CAAU,EAAY,SAAU,CAAK,EAC/B,EAAG,GACL,EAAO,GAAG,CAAC,IAAI,CAAC,GAEhB,EAAO,GAAG,CAAC,IAAI,CAAC,EAEpB,GACO,CACT,CAMA,SAAS,EAAK,CAAI,CAAE,CAAE,EACpB,IAAI,EAAQ,EAAZ,OAAA,GACA,GAAI,CACF,OAAO,GACT,QAAU,CACR,QAAQ,GAAG,CAAC,EAAO,UAAa,CAAA,EAAA,OAAA,GAAU,CAAA,EAAS,KACrD,CACF,CAEA,SAAS,EAAO,CAAI,CAAE,CAAE,EACtB,OAAO,GACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SC7NA,EANA,SAAa,CAAK,EAChB,OAAQ,GAAS,EAAM,MAAM,CACzB,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAO,EAAA,OAAO,CAAG,EAAA,OAAK,EACnC,KAAA,CACN,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GCbA,IAAA,EAJA,SAAgB,CAAK,CAAE,CAAK,EAC1B,OAAO,EAAQ,CACjB,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCWA,EAJU,WACR,MAAO,AAAA,CAAA,EAAA,EAAA,OAAG,AAAH,EAAK,IAAI,CAAC,GAAG,EACtB,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,SCGA,EAJA,SAAmB,CAAK,CAAE,CAAM,EAC9B,MAAO,AAAA,CAAA,EAAA,EAAA,OAAY,AAAZ,EAAc,GAAS,EAAE,CAAE,GAAU,EAAE,CAAE,EAAA,OAAU,CAC5D,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GCCA,IAAA,EAbA,SAAuB,CAAK,CAAE,CAAM,CAAE,CAAU,EAM9C,IALA,IAAI,EAAQ,GACR,EAAS,EAAM,MAAM,CACrB,EAAa,EAAO,MAAM,CAC1B,EAAS,CAAC,EAEP,EAAE,EAAQ,GAAQ,CACvB,IAAI,EAAQ,EAAQ,EAAa,CAAM,CAAC,EAAM,CAAG,KAAA,EACjD,EAAW,EAAQ,CAAK,CAAC,EAAM,CAAE,EACnC,CACA,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,S,I,G,E,E,O,C,O,I,G,I,E,E,S,E,E,SChBA,SAAS,EAAO,CAAC,EACf,IAAI,EAAU,EAAE,KAAK,GAAG,OAAO,CAAC,WAAW,GACvC,CAAA,AAAY,OAAZ,GAAoB,AAAY,OAAZ,CAAY,GAClC,EAAgB,EAEpB,CAEA,SAAS,EAAK,CAAC,EACb,IAAI,EAAU,EAAE,KAAK,GAAG,OAAO,CAAC,WAAW,GACvC,CAAA,AAAY,OAAZ,GAAoB,AAAY,OAAZ,CAAY,IA0BpC,EAAA,OAAA,CAAU,AAzBC,EAyBC,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAY,AA1BH,EA0BK,IAAI,CAAC,GACrB,GAEA,EAAA,OAAA,CAAU,AA7BC,EA6BC,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AA9BF,EA8BI,IAAI,CAAC,GAClB,EAAA,OAAA,CAAU,EAAK,MAAM,CAAE,GACnB,EAAA,OAAA,CAAM,EAAM,MACd,EAAY,EAEhB,IAhCI,CAAA,AAAY,OAAZ,GAAoB,AAAY,OAAZ,CAAY,IAwCpC,EAAA,OAAA,CAAU,AAvCD,EAuCG,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAU,AAxCH,EAwCK,IAAI,CAAC,GACnB,GAEA,EAAA,OAAA,CAAU,AA3CD,EA2CG,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,AA5CJ,EA4CM,IAAI,CAAC,GAClB,EAAA,OAAA,CAAU,EAAK,MAAM,CAAE,GACnB,EAAA,OAAA,CAAM,EAAM,MACd,EAAU,EAEd,GAhDE,EAAgB,GAEpB,CAEA,SAAS,EAAgB,CAAC,EACxB,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAmB,EAAE,IAAI,CAAC,GAC5B,GACA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAmB,EAAE,IAAI,CAAC,GAC5B,EACF,CAEA,SAAS,EAAmB,CAAK,EAC/B,IAAI,EAAI,EAAM,KAAK,AACnB,CAAA,EAAM,KAAK,CAAG,EAAM,MAAM,CAC1B,EAAM,MAAM,CAAG,CACjB,CAgBA,SAAS,EAAY,CAAK,EACxB,EAAM,CAAC,CAAG,CAAC,EAAM,CAAC,AACpB,CAgBA,SAAS,EAAU,CAAK,EACtB,IAAI,EAAI,EAAM,CAAC,AACf,CAAA,EAAM,CAAC,CAAG,EAAM,CAAC,CACjB,EAAM,CAAC,CAAG,CACZ,C,G,E,Q,S,C,C,C,E,E,E,O,C,M,I,G,E,E,O,C,O,I,G,I,E,E,S,E,E,SCrDA,SAAS,EAAI,CAAC,EACZ,EAAE,KAAK,GAAG,WAAW,CAAG,EAAE,CAC1B,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAI,EACjC,AAIJ,CAAA,SAAuB,CAAC,CAAE,CAAC,EACzB,IAYI,EAAO,EAAO,EAZd,EAAI,EAAE,CAAC,CACP,EAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,CACtB,EAAI,EAAE,CAAC,CACP,EAAQ,EAAE,IAAI,CAAC,GAAG,IAAI,CACtB,EAAO,EAAE,IAAI,CACb,EAAY,EAAE,IAAI,CAAC,GACnB,EAAY,EAAU,SAAS,CAEnC,GAAI,IAAU,EAAQ,GAKtB,IAAK,AAHL,EAAE,UAAU,CAAC,GAGR,EAAI,EAAG,EAAE,EAAO,EAAQ,EAAO,EAAE,EAAG,EAAE,EACzC,EAAU,MAAM,CAAG,EAAE,CACrB,EAAQ,CACN,MAAO,EACP,OAAQ,EACR,UAAW,EACX,QAAS,EACT,KAAM,CACR,EACA,EAAQ,EAAA,YAAA,CAAkB,EAAG,OAAQ,EAAO,MACxC,IAAU,IACZ,EAAM,KAAK,CAAG,EAAU,KAAK,CAC7B,EAAM,MAAM,CAAG,EAAU,MAAM,CAE/B,EAAM,KAAK,CAAG,aAEd,EAAM,QAAQ,CAAG,EAAU,QAAQ,EAErC,EAAE,OAAO,CAAC,EAAG,EAAO,CAAE,OAAQ,EAAU,MAAM,AAAC,EAAG,GACxC,IAAN,GACF,EAAE,KAAK,GAAG,WAAW,CAAC,IAAI,CAAC,GAE7B,EAAI,EAGN,EAAE,OAAO,CAAC,EAAG,EAAG,CAAE,OAAQ,EAAU,MAAM,AAAC,EAAG,GAChD,CAAA,EA5CkB,EAAG,EACnB,EACF,CA4CA,SAAS,EAAK,CAAC,EACb,EAAA,OAAA,CAAU,EAAE,KAAK,GAAG,WAAW,CAAE,SAAU,CAAC,EAC1C,IAEI,EAFA,EAAO,EAAE,IAAI,CAAC,GACd,EAAY,EAAK,SAAS,CAG9B,IADA,EAAE,OAAO,CAAC,EAAK,OAAO,CAAE,GACjB,EAAK,KAAK,EACf,EAAI,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,CACtB,EAAE,UAAU,CAAC,GACb,EAAU,MAAM,CAAC,IAAI,CAAC,CAAE,EAAG,EAAK,CAAC,CAAE,EAAG,EAAK,CAAC,AAAC,GAC1B,eAAf,EAAK,KAAK,GACZ,EAAU,CAAC,CAAG,EAAK,CAAC,CACpB,EAAU,CAAC,CAAG,EAAK,CAAC,CACpB,EAAU,KAAK,CAAG,EAAK,KAAK,CAC5B,EAAU,MAAM,CAAG,EAAK,MAAM,EAEhC,EAAI,EACJ,EAAO,EAAE,IAAI,CAAC,EAElB,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,O,I,G,I,E,E,S,E,E,S,E,E,SCjEA,SAAS,EAAK,CAAC,EACb,OAAQ,EAAE,KAAK,GAAG,MAAM,EACtB,IAAK,kBASL,YAa0B,EAAA,EArBH,EAsBzB,AAAA,CAAA,EAAA,EAAA,cAAa,AAAb,EAAe,GArBX,KACF,KAAK,aAeP,AAAA,CAAA,EAAA,EAAA,WAAU,AAAV,EAdoB,GAepB,AAAA,CAAA,EAAA,EAAA,YAAW,AAAX,EAfoB,GAChB,KACF,KAAK,eACH,EAAkB,EAItB,CACF,CAGA,IAAI,EAAoB,EAAA,WAAU,A,G,E,Q,S,C,C,C,E,E,E,O,C,e,I,G,I,E,E,S,E,E,S,E,E,S,E,E,SCXlC,SAAS,EAAa,CAAC,EACrB,IAOI,EAAM,EAPN,EAAI,IAAI,EAAA,KAAI,CAAE,CAAE,SAAU,CAAA,CAAM,GAGhC,EAAQ,EAAE,KAAK,EAAE,CAAC,EAAE,CACpB,EAAO,EAAE,SAAS,GAItB,IAHA,EAAE,OAAO,CAAC,EAAO,CAAC,GAGX,AA0BP,EAAA,OAAA,CAAU,AA1BO,EA0BL,KAAK,GAZjB,SAAS,EAAI,CAAC,EACZ,EAAA,OAAA,CAAU,AAfQ,EAeN,SAAS,CAAC,GAAI,SAAU,CAAC,EACnC,IAAI,EAAQ,EAAE,CAAC,CACb,EAAI,IAAM,EAAQ,EAAE,CAAC,CAAG,EACrB,AAlBQ,EAkBN,OAAO,CAAC,IAAO,AAAA,CAAA,EAAA,EAAA,KAAI,AAAJ,EAlBN,EAkBe,KAC7B,AAnBW,EAmBT,OAAO,CAAC,EAAG,CAAC,GACd,AApBW,EAoBT,OAAO,CAAC,EAAG,EAAG,CAAC,GACjB,EAAI,GAER,EACF,GAGO,AA3BU,EA2BR,SAAS,GA3BO,GACvB,EAAO,AAiCX,SAA0B,CAAC,CAAE,CAAC,EAC5B,OAAO,EAAA,OAAA,CAAQ,EAAE,KAAK,GAAI,SAAU,CAAC,EACnC,GAAI,EAAE,OAAO,CAAC,EAAE,CAAC,IAAM,EAAE,OAAO,CAAC,EAAE,CAAC,EAClC,MAAO,AAAA,CAAA,EAAA,EAAA,KAAI,AAAJ,EAAM,EAAG,EAEpB,EACF,EAvC4B,EAAG,GAC3B,EAAQ,EAAE,OAAO,CAAC,EAAK,CAAC,EAAI,AAAA,CAAA,EAAA,EAAA,KAAI,AAAJ,EAAM,EAAG,GAAQ,CAAC,AAAA,CAAA,EAAA,EAAA,KAAI,AAAJ,EAAM,EAAG,GACvD,AAuCJ,SAAoB,CAAC,CAAE,CAAC,CAAE,CAAK,EAC7B,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAE,IAAI,CAAC,GAAG,IAAI,EAAI,CACpB,EACF,EA3Ce,EAAG,EAAG,GAGnB,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCdA,EANA,SAAe,CAAK,CAAE,CAAQ,EAC5B,OAAQ,GAAS,EAAM,MAAM,CACzB,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAO,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAU,GAAI,EAAA,OAAK,EACpD,KAAA,CACN,C,G,E,Q,S,C,C,C,E,E,E,O,C,c,I,G,E,E,O,C,Q,I,G,I,E,E,S,E,E,S,E,E,S,E,E,SCNA,SAAS,EAAY,CAAC,EACpB,IAAI,EAAU,CAAC,EA2Bf,EAAA,OAAA,CAAU,EAAE,OAAO,GAzBnB,SAAS,EAAI,CAAC,EACZ,IAAI,EAAQ,EAAE,IAAI,CAAC,GACnB,GAAI,EAAA,OAAA,CAAM,EAAS,GACjB,OAAO,EAAM,IAAI,AAEnB,CAAA,CAAO,CAAC,EAAE,CAAG,CAAA,EAEb,IAAI,EAAO,EAAA,OAAA,CACT,EAAA,OAAA,CAAM,EAAE,QAAQ,CAAC,GAAI,SAAU,CAAC,EAC9B,OAAO,EAAI,EAAE,CAAC,EAAI,EAAE,IAAI,CAAC,GAAG,MAAM,AACpC,IAYF,MARE,CAAA,IAAS,OAAO,iBAAiB,EAEjC,MADA,CACS,GAGT,CAAA,EAAO,CAAA,EAGD,EAAM,IAAI,CAAG,CACvB,EAGF,CAMA,SAAS,EAAM,CAAC,CAAE,CAAC,EACjB,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAG,EAAE,IAAI,CAAC,EAAE,CAAC,EAAE,IAAI,CAAG,EAAE,IAAI,CAAC,GAAG,MAAM,AAC/D,C,G,E,Q,S,C,C,C,E,E,E,O,C,iB,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,S,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCbA,SAAS,EAAe,CAAC,EACvB,EAAI,AAAA,CAAA,EAAA,EAAA,QAAO,AAAP,EAAS,GACb,AAAA,CAAA,EAAA,EAAA,WAAU,AAAV,EAAY,GACZ,IAII,EAAG,EAJH,EAAI,AAAA,CAAA,EAAA,EAAA,YAAW,AAAX,EAAa,GAKrB,IAJA,EAAiB,GACjB,EAAc,EAAG,GAGT,EAAI,EAAU,IACpB,EAAI,EAAU,EAAG,EAAG,GACpB,EAAc,EAAG,EAAG,EAAG,EAE3B,CAKA,SAAS,EAAc,CAAC,CAAE,CAAC,EACzB,IAAI,EAAK,EAAA,SAAA,CAAc,EAAG,EAAE,KAAK,IACjC,EAAK,EAAG,KAAK,CAAC,EAAG,EAAG,MAAM,CAAG,GAC7B,EAAA,OAAA,CAAU,EAAI,SAAU,CAAC,MAOrB,EAAA,EAAS,AADE,AALE,EAKA,IAAI,CALE,GAMD,MAAM,CAC5B,AAPiB,EAOf,IAAI,CAPiB,EAOT,GAAQ,QAAQ,CAAG,EAPhB,EAAG,EAAG,EACvB,EACF,CAYA,SAAS,EAAa,CAAC,CAAE,CAAC,CAAE,CAAK,EAE/B,IAAI,EAAS,AADE,EAAE,IAAI,CAAC,GACA,MAAM,CAExB,EAAc,CAAA,EAEd,EAAY,EAAE,IAAI,CAAC,EAAO,GAE1B,EAAW,EAyBf,OAvBK,IACH,EAAc,CAAA,EACd,EAAY,EAAE,IAAI,CAAC,EAAQ,IAG7B,EAAW,EAAU,MAAM,CAE3B,EAAA,OAAA,CAAU,EAAE,SAAS,CAAC,GAAQ,SAAU,CAAC,EACvC,IAAI,EAAY,EAAE,CAAC,GAAK,EACtB,EAAQ,EAAY,EAAE,CAAC,CAAG,EAAE,CAAC,CAE/B,GAAI,IAAU,EAAQ,CACpB,IAAI,EAAe,IAAc,EAC/B,EAAc,EAAE,IAAI,CAAC,GAAG,MAAM,CAGhC,GADA,GAAY,EAAe,EAAc,CAAC,EAqHvC,AApHY,EAoHP,OAAO,CApHG,EAAO,GAAQ,CAC/B,IAAI,EAAgB,EAAE,IAAI,CAAC,EAAO,GAAO,QAAQ,CACjD,GAAY,EAAe,CAAC,EAAgB,CAC9C,CACF,CACF,GAEO,CACT,CAEA,SAAS,EAAiB,CAAI,CAAE,CAAI,EAC9B,UAAU,MAAM,CAAG,GACrB,CAAA,EAAO,EAAK,KAAK,EAAE,CAAC,EAAE,AAAF,EAEtB,AAGF,SAAS,EAAgB,CAAI,CAAE,CAAO,CAAE,CAAO,CAAE,CAAC,CAAE,CAAM,EACxD,IAAI,EAAM,EACN,EAAQ,EAAK,IAAI,CAAC,GAkBtB,OAhBA,CAAO,CAAC,EAAE,CAAG,CAAA,EACb,EAAA,OAAA,CAAU,EAAK,SAAS,CAAC,GAAI,SAAU,CAAC,EACjC,EAAA,OAAA,CAAM,EAAS,IAClB,CAAA,EAAU,EAAgB,EAAM,EAAS,EAAS,EAAG,EADvD,CAGF,GAEA,EAAM,GAAG,CAAG,EACZ,EAAM,GAAG,CAAG,IACR,EACF,EAAM,MAAM,CAAG,EAGf,OAAO,EAAM,MAAM,CAGd,CACT,EAxBkB,EAAM,CAAC,EAAG,EAAG,EAC/B,CAyBA,SAAS,EAAU,CAAI,EACrB,OAAO,EAAA,OAAA,CAAO,EAAK,KAAK,GAAI,SAAU,CAAC,EACrC,OAAO,EAAK,IAAI,CAAC,GAAG,QAAQ,CAAG,CACjC,EACF,CAEA,SAAS,EAAU,CAAC,CAAE,CAAC,CAAE,CAAI,EAC3B,IAAI,EAAI,EAAK,CAAC,CACV,EAAI,EAAK,CAAC,CAKT,EAAE,OAAO,CAAC,EAAG,KAChB,EAAI,EAAK,CAAC,CACV,EAAI,EAAK,CAAC,EAGZ,IAAI,EAAS,EAAE,IAAI,CAAC,GAChB,EAAS,EAAE,IAAI,CAAC,GAChB,EAAY,EACZ,EAAO,CAAA,CAIP,CAAA,EAAO,GAAG,CAAG,EAAO,GAAG,GACzB,EAAY,EACZ,EAAO,CAAA,GAGT,IAAI,EAAa,EAAA,OAAA,CAAS,EAAE,KAAK,GAAI,SAAU,CAAI,EACjD,OACE,IAAS,EAAa,EAAG,EAAE,IAAI,CAAC,EAAK,CAAC,EAAG,IACzC,IAAS,EAAa,EAAG,EAAE,IAAI,CAAC,EAAK,CAAC,EAAG,EAE7C,GAEA,OAAO,EAAA,OAAA,CAAQ,EAAY,SAAU,CAAI,EACvC,MAAO,AAAA,CAAA,EAAA,EAAA,KAAI,AAAJ,EAAM,EAAG,EAClB,EACF,CAEA,SAAS,EAAc,CAAC,CAAE,CAAC,CAAE,CAAC,CAAE,CAAC,EAC/B,IAUI,EAGA,EAbA,EAAI,EAAE,CAAC,CACP,EAAI,EAAE,CAAC,CACX,EAAE,UAAU,CAAC,EAAG,GAChB,EAAE,OAAO,CAAC,EAAE,CAAC,CAAE,EAAE,CAAC,CAAE,CAAC,GACrB,EAAiB,GACjB,EAAc,EAAG,GAKb,EAAO,EAAA,OAAA,CAAO,AAJN,EAIQ,KAAK,GAAI,SAAU,CAAC,EACtC,MAAO,CAAC,AALK,EAKH,IAAI,CAAC,GAAG,MAAM,AAC1B,GAEA,EAAK,CADD,EAAK,EAAA,QAAA,CAPG,EAOa,IACjB,KAAK,CAAC,GACd,EAAA,OAAA,CAAU,EAAI,SAAU,CAAC,EACvB,IAAI,EAAS,AAVH,EAUK,IAAI,CAAC,GAAG,MAAM,CAC3B,EAAO,AAXI,EAWF,IAAI,CAAC,EAAG,GACjB,EAAU,CAAA,EAEP,IACH,EAAO,AAfI,EAeF,IAAI,CAAC,EAAQ,GACtB,EAAU,CAAA,GAGZ,AAnBa,EAmBX,IAAI,CAAC,GAAG,IAAI,CAAG,AAnBJ,EAmBM,IAAI,CAAC,GAAQ,IAAI,CAAI,CAAA,EAAU,EAAK,MAAM,CAAG,CAAC,EAAK,MAAM,AAAN,CACxE,EAnBF,CAiCA,SAAS,EAAa,CAAI,CAAE,CAAM,CAAE,CAAS,EAC3C,OAAO,EAAU,GAAG,EAAI,EAAO,GAAG,EAAI,EAAO,GAAG,EAAI,EAAU,GAAG,AACnE,CAlOA,EAAe,gBAAgB,CAAG,EAClC,EAAe,aAAa,CAAG,EAC/B,EAAe,YAAY,CAAG,EAC9B,EAAe,SAAS,CAAG,EAC3B,EAAe,SAAS,CAAG,EAC3B,EAAe,aAAa,CAAG,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,SC2B/B,EAFW,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,EAAA,OAAQ,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCf9B,EAbA,SAAoB,CAAa,EAC/B,OAAO,SAAS,CAAU,CAAE,CAAS,CAAE,CAAS,EAC9C,IAAI,EAAW,OAAO,GACtB,GAAI,CAAC,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,GAAa,CAC5B,IAAI,EAAW,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAW,GACvC,EAAa,AAAA,CAAA,EAAA,EAAA,OAAG,AAAH,EAAK,GAClB,EAAY,SAAS,CAAG,EAAI,OAAO,EAAS,CAAQ,CAAC,EAAI,CAAE,EAAK,EAAW,CAC7E,CACA,IAAI,EAAQ,EAAc,EAAY,EAAW,GACjD,OAAO,EAAQ,GAAK,CAAQ,CAAC,EAAW,CAAU,CAAC,EAAM,CAAG,EAAM,CAAG,KAAA,CACvE,CACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCjBI,EAAY,KAAK,GAAG,CAiDxB,EAZA,SAAmB,CAAK,CAAE,CAAS,CAAE,CAAS,EAC5C,IAAI,EAAS,AAAS,MAAT,EAAgB,EAAI,EAAM,MAAM,CAC7C,GAAI,CAAC,EACH,OAAO,GAET,IAAI,EAAQ,AAAa,MAAb,EAAoB,EAAI,AAAA,CAAA,EAAA,EAAA,OAAQ,AAAR,EAAU,GAI9C,OAHI,EAAQ,GACV,CAAA,EAAQ,EAAU,EAAS,EAAO,EADpC,EAGO,AAAA,CAAA,EAAA,EAAA,OAAY,AAAZ,EAAc,EAAO,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAW,GAAI,EAC1D,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCjBA,EAPA,SAAmB,CAAK,EACtB,IAAI,EAAS,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAClB,EAAY,EAAS,EAEzB,OAAO,GAAW,EAAU,EAAY,EAAS,EAAY,EAAU,CACzE,C,G,E,Q,S,C,C,C,E,E,E,O,C,Y,I,A,E,S,S,E,E,E,O,C,W,I,A,E,S,Q,E,E,S,E,S,E,S,E,S,E,S,E,S,E,S,E,S,E,S,E,S,E,Q,G,E,Q,S,C,C,C,E,E,S,E,Q,G,E,Q,S,C,C,C,E,E,E,O,C,W,I,G,I,E,E,S,E,E,SG5BI,EAAsB,EAAA,OAAA,CAAW,GAErC,SAAS,EAAS,CAAC,CAAE,CAAM,CAAE,CAAQ,CAAE,CAAM,EAC3C,OAAO,AAWT,SAAqB,CAAC,CAAE,CAAM,CAAE,CAAQ,CAAE,CAAM,EAC9C,IAEI,EAAG,EAFH,EAAU,CAAC,EACX,EAAK,IAAI,EAAA,aAAY,CAGrB,EAAkB,SAAU,CAAI,EAClC,IAAI,EAAI,EAAK,CAAC,GAAK,EAAI,EAAK,CAAC,CAAG,EAAK,CAAC,CAClC,EAAS,CAAO,CAAC,EAAE,CACnB,EAAS,EAAS,GAClB,EAAW,EAAO,QAAQ,CAAG,EAEjC,GAAI,EAAS,EACX,MAAM,AAAI,MACR,4DAEE,EACA,YACA,GAIF,EAAW,EAAO,QAAQ,GAC5B,EAAO,QAAQ,CAAG,EAClB,EAAO,WAAW,CAAG,EACrB,EAAG,QAAQ,CAAC,EAAG,GAEnB,EAQA,IANA,EAAE,KAAK,GAAG,OAAO,CAAC,SAAU,CAAC,EAC3B,IAAI,EAAW,IAAM,EAAS,EAAI,OAAO,iBAAiB,AAC1D,CAAA,CAAO,CAAC,EAAE,CAAG,CAAE,SAAU,CAAS,EAClC,EAAG,GAAG,CAAC,EAAG,EACZ,GAKE,AAHK,EAAG,IAAI,GAAK,GAGb,AADJ,CAAA,EAAS,CAAO,CADhB,EAAI,EAAG,SAAS,GACG,AAAF,EACN,QAAQ,GAAK,OAAO,iBAAiB,EAIhD,EAAO,GAAG,OAAO,CAAC,GAGpB,OAAO,CACT,EAvDI,EACA,OAAO,GACP,GAAY,EACZ,GACE,SAAU,CAAC,EACT,OAAO,EAAE,QAAQ,CAAC,EACpB,EAEN,C,G,E,Q,S,C,C,C,E,E,E,O,C,gB,I,G,I,E,E,QCNA,OAAM,EACJ,aAAc,CACZ,IAAI,CAAC,IAAI,CAAG,EAAE,CACd,IAAI,CAAC,WAAW,CAAG,CAAC,CACtB,CAIA,MAAO,CACL,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,AACzB,CAIA,MAAO,CACL,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,SAAU,CAAC,EAC9B,OAAO,EAAE,GAAG,AACd,EACF,CAIA,IAAI,CAAG,CAAE,CACP,OAAO,EAAA,OAAA,CAAM,IAAI,CAAC,WAAW,CAAE,EACjC,CAOA,SAAS,CAAG,CAAE,CACZ,IAAI,EAAQ,IAAI,CAAC,WAAW,CAAC,EAAI,CACjC,GAAI,AAAU,KAAA,IAAV,EACF,OAAO,IAAI,CAAC,IAAI,CAAC,EAAM,CAAC,QAAQ,AAEpC,CAKA,KAAM,CACJ,GAAI,AAAgB,IAAhB,IAAI,CAAC,IAAI,GACX,MAAM,AAAI,MAAM,mBAElB,OAAO,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,GAAG,AACzB,CASA,IAAI,CAAG,CAAE,CAAQ,CAAE,CACjB,IAAI,EAAa,IAAI,CAAC,WAAW,CAEjC,GADA,EAAM,OAAO,GACT,CAAC,EAAA,OAAA,CAAM,EAAY,GAAM,CAC3B,IAAI,EAAM,IAAI,CAAC,IAAI,CACf,EAAQ,EAAI,MAAM,CAItB,OAHA,CAAU,CAAC,EAAI,CAAG,EAClB,EAAI,IAAI,CAAC,CAAE,IAAK,EAAK,SAAU,CAAS,GACxC,IAAI,CAAC,SAAS,CAAC,GACR,CAAA,CACT,CACA,MAAO,CAAA,CACT,CAIA,WAAY,CACV,IAAI,CAAC,KAAK,CAAC,EAAG,IAAI,CAAC,IAAI,CAAC,MAAM,CAAG,GACjC,IAAI,EAAM,IAAI,CAAC,IAAI,CAAC,GAAG,GAGvB,OAFA,OAAO,IAAI,CAAC,WAAW,CAAC,EAAI,GAAG,CAAC,CAChC,IAAI,CAAC,QAAQ,CAAC,GACP,EAAI,GAAG,AAChB,CAQA,SAAS,CAAG,CAAE,CAAQ,CAAE,CACtB,IAAI,EAAQ,IAAI,CAAC,WAAW,CAAC,EAAI,CACjC,GAAI,EAAW,IAAI,CAAC,IAAI,CAAC,EAAM,CAAC,QAAQ,CACtC,MAAM,AAAI,MACR,uDAEE,EACA,SACA,IAAI,CAAC,IAAI,CAAC,EAAM,CAAC,QAAQ,CACzB,SACA,EAGN,CAAA,IAAI,CAAC,IAAI,CAAC,EAAM,CAAC,QAAQ,CAAG,EAC5B,IAAI,CAAC,SAAS,CAAC,EACjB,CACA,SAAS,CAAC,CAAE,CACV,IAAI,EAAM,IAAI,CAAC,IAAI,CACf,EAAI,EAAI,EACR,EAAI,EAAI,EACR,EAAU,EACV,EAAI,EAAI,MAAM,GAChB,EAAU,CAAG,CAAC,EAAE,CAAC,QAAQ,CAAG,CAAG,CAAC,EAAQ,CAAC,QAAQ,CAAG,EAAI,EACpD,EAAI,EAAI,MAAM,EAChB,CAAA,EAAU,CAAG,CAAC,EAAE,CAAC,QAAQ,CAAG,CAAG,CAAC,EAAQ,CAAC,QAAQ,CAAG,EAAI,CAD1D,EAGI,IAAY,IACd,IAAI,CAAC,KAAK,CAAC,EAAG,GACd,IAAI,CAAC,QAAQ,CAAC,IAGpB,CACA,UAAU,CAAK,CAAE,CAIf,IAHA,IAEI,EAFA,EAAM,IAAI,CAAC,IAAI,CACf,EAAW,CAAG,CAAC,EAAM,CAAC,QAAQ,CAIhC,AAFe,IAAV,IAED,CAAA,CAAG,CADP,EAAS,GAAS,EACH,CAAC,QAAQ,CAAG,CAAA,GAG3B,IAAI,CAAC,KAAK,CAAC,EAAO,GAClB,EAAQ,CAEZ,CACA,MAAM,CAAC,CAAE,CAAC,CAAE,CACV,IAAI,EAAM,IAAI,CAAC,IAAI,CACf,EAAa,IAAI,CAAC,WAAW,CAC7B,EAAW,CAAG,CAAC,EAAE,CACjB,EAAW,CAAG,CAAC,EAAE,AACrB,CAAA,CAAG,CAAC,EAAE,CAAG,EACT,CAAG,CAAC,EAAE,CAAG,EACT,CAAU,CAAC,EAAS,GAAG,CAAC,CAAG,EAC3B,CAAU,CAAC,EAAS,GAAG,CAAC,CAAG,CAC7B,CACF,C,G,E,Q,S,C,C,C,E,E,S,E,Q,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SEvFA,EAvBA,SAAmB,CAAM,CAAE,CAAQ,CAAE,CAAW,EAC9C,IAAI,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,GAChB,EAAY,GAAS,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,IAAW,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,GAG1D,GADA,EAAW,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,EAAU,GAC9B,AAAe,MAAf,EAAqB,CACvB,IAAI,EAAO,GAAU,EAAO,WAAW,CAErC,EADE,EACY,EAAQ,IAAI,EAAO,EAAE,CAE5B,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,IACF,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,GAAQ,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,IAAW,CAAC,CAKzE,CAIA,MAHC,AAAA,CAAA,EAAY,CAAA,EAAA,EAAA,OAAQ,AAAR,EAAY,CAAA,EAAA,EAAA,OAAS,AAAT,CAAS,EAAG,EAAQ,SAAS,CAAK,CAAE,CAAK,CAAE,CAAM,EACxE,OAAO,EAAS,EAAa,EAAO,EAAO,EAC7C,GACO,CACT,C,G,E,Q,S,C,C,C,E,E,S,E,Q,G,E,Q,S,C,C,C,E,E,E,O,C,S,I,G,I,E,E,SE1DA,SAAS,EAAO,CAAC,EACf,IAAI,EAAQ,EACR,EAAQ,EAAE,CACV,EAAU,CAAC,EACX,EAAU,EAAE,CAqChB,OANA,EAAE,KAAK,GAAG,OAAO,CAAC,SAAU,CAAC,EACtB,EAAA,OAAA,CAAM,EAAS,IAClB,AA/BJ,SAAS,EAAI,CAAC,EACZ,IAAI,EAAS,CAAO,CAAC,EAAE,CAAG,CACxB,QAAS,CAAA,EACT,QAAS,EACT,MAAO,GACT,EAYA,GAXA,EAAM,IAAI,CAAC,GAEX,EAAE,UAAU,CAAC,GAAG,OAAO,CAAC,SAAU,CAAC,EAC5B,EAAA,OAAA,CAAM,EAAS,GAGT,CAAO,CAAC,EAAE,CAAC,OAAO,EAC3B,CAAA,EAAM,OAAO,CAAG,KAAK,GAAG,CAAC,EAAM,OAAO,CAAE,CAAO,CAAC,EAAE,CAAC,KAAK,CAAA,GAHxD,EAAI,GACJ,EAAM,OAAO,CAAG,KAAK,GAAG,CAAC,EAAM,OAAO,CAAE,CAAO,CAAC,EAAE,CAAC,OAAO,EAI9D,GAEI,EAAM,OAAO,GAAK,EAAM,KAAK,CAAE,CACjC,IACI,EADA,EAAO,EAAE,CAEb,GAEE,CAAO,CADP,EAAI,EAAM,GAAG,GACH,CAAC,OAAO,CAAG,CAAA,EACrB,EAAK,IAAI,CAAC,SACH,IAAM,EAAG,AAClB,EAAQ,IAAI,CAAC,EACf,CACF,EAIQ,EAER,GAEO,CACT,C,G,E,Q,S,C,C,C,EC1C0B,A,E,SAAA,OAAA,CAAW,E,G,E,Q,S,C,C,C,E,E,Q,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,E,E,O,C,iB,I,G,I,E,E,S,E,E,S,E,E,SEErC,SAAS,EAAQ,CAAC,EAChB,IAAI,EAAU,CAAC,EACX,EAAQ,CAAC,EACT,EAAU,EAAE,CAkBhB,GAFA,EAAA,OAAA,CAAO,EAAE,KAAK,GAdd,SAAS,EAAM,CAAI,EACjB,GAAI,EAAA,OAAA,CAAM,EAAO,GACf,MAAM,IAAI,EAGP,EAAA,OAAA,CAAM,EAAS,KAClB,CAAK,CAAC,EAAK,CAAG,CAAA,EACd,CAAO,CAAC,EAAK,CAAG,CAAA,EAChB,EAAA,OAAA,CAAO,EAAE,YAAY,CAAC,GAAO,GAC7B,OAAO,CAAK,CAAC,EAAK,CAClB,EAAQ,IAAI,CAAC,GAEjB,GAII,EAAA,OAAA,CAAO,KAAa,EAAE,SAAS,GACjC,MAAM,IAAI,EAGZ,OAAO,CACT,CAEA,SAAS,IAAkB,CA9B3B,EAAQ,cAAc,CAAG,EA+BzB,EAAe,SAAS,CAAG,AAAI,O,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCU/B,EAdA,SAAc,CAAU,EACtB,GAAI,AAAc,MAAd,EACF,OAAO,EAET,GAAI,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,GACd,MAAO,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAAc,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,GAAc,EAAW,MAAM,CAE1E,IAAI,EAAM,AAAA,CAAA,EAAA,EAAA,OAAK,AAAL,EAAO,SACjB,AAAI,AAhCO,gBAgCP,GAAiB,AA/BV,gBA+BU,EACZ,EAAW,IAAI,CAEjB,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAAY,MAAM,AACpC,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCdA,EALA,SAAkB,CAAK,EACrB,MAAO,AAAgB,UAAhB,OAAO,GACX,CAAC,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,IAAU,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,IAAU,AArB/B,mBAqB+B,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,EAC1D,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SCVA,EANA,SAAoB,CAAM,EACxB,MAAO,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,GACd,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,GACZ,AAAA,CAAA,EAAA,EAAA,OAAQ,AAAR,EAAU,EAChB,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GCJA,IAAA,EAFgB,AAAA,CAAA,EAAA,A,E,SAAA,OAAW,AAAX,EAAa,S,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GCG7B,IAAI,EAAe,OAAO,qFAa1B,EAJA,SAAoB,CAAM,EACxB,OAAO,EAAa,IAAI,CAAC,EAC3B,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GCtBA,IAAI,EAAgB,gBAShB,EAAU,kDACV,EAAS,wBAET,EAAc,KAAO,EAAgB,IACrC,EAAa,+BACb,EAAa,iCAIb,EAAW,AAPE,MAAQ,EAAU,IAAM,EAAxB,KAQb,EAAW,oBACX,EAAY,gBAAwB,CAAC,EAAa,EAAY,EAAW,CAAC,IAAI,CAAC,KAAO,IAAM,EAAW,EAAW,KAKlH,EAAY,OAAO,EAAS,MAAQ,EAAjB,QAHA,CAAC,EAAc,EAAU,IAAK,EAAS,EAAY,EAd3D,IAAM,EAAgB,IAc0D,CAAC,IAAI,CAAC,KAAO,IADhG,CAAA,EAAW,EAAW,CAAA,EAIwC,KAiB1E,EARA,SAAqB,CAAM,EAEzB,IADA,IAAI,EAAS,EAAU,SAAS,CAAG,EAC5B,EAAU,IAAI,CAAC,IACpB,EAAE,EAEJ,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,Y,I,G,I,E,E,SCrCA,SAAS,EAAU,CAAC,CAAE,CAAE,EACtB,MAAO,AAAA,CAAA,EAAA,EAAA,GAAE,AAAF,EAAI,EAAG,EAAI,OACpB,C,G,E,Q,S,C,C,C,E,E,E,O,C,M,I,G,I,E,E,S,E,E,S,E,E,SCMA,SAAS,EAAI,CAAC,CAAE,CAAE,CAAE,CAAK,EAClB,EAAA,OAAA,CAAU,IACb,CAAA,EAAK,CAAC,EAAG,AAAA,EAGX,IAAI,EAAa,AAAC,CAAA,EAAE,UAAU,GAAK,EAAE,UAAU,CAAG,EAAE,SAAQ,AAAR,EAAW,IAAI,CAAC,GAEhE,EAAM,EAAE,CACR,EAAU,CAAC,EAQf,OAPA,EAAA,OAAA,CAAO,EAAI,SAAU,CAAC,EACpB,GAAI,CAAC,EAAE,OAAO,CAAC,GACb,MAAM,AAAI,MAAM,6BAA+B,GAGjD,AAKJ,CAAA,SAAS,EAAM,CAAC,CAAE,CAAC,CAAE,CAAS,CAAE,CAAO,CAAE,CAAU,CAAE,CAAG,EAClD,CAAC,EAAA,OAAA,CAAM,EAAS,KAClB,CAAO,CAAC,EAAE,CAAG,CAAA,EAER,GACH,EAAI,IAAI,CAAC,GAEX,EAAA,OAAA,CAAO,EAAW,GAAI,SAAU,CAAC,EAC/B,EAAM,EAAG,EAAG,EAAW,EAAS,EAAY,EAC9C,GACI,GACF,EAAI,IAAI,CAAC,GAGf,CAAA,EAnBU,EAAG,EAAG,AAAU,SAAV,EAAkB,EAAS,EAAY,EACrD,GACO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,W,I,G,I,E,E,SCzBA,SAAS,EAAS,CAAC,CAAE,CAAE,EACrB,MAAO,AAAA,CAAA,EAAA,EAAA,GAAE,AAAF,EAAI,EAAG,EAAI,MACpB,C,G,E,Q,S,C,C,C,E,E,S,E,S,E,S,E,Q,G,E,Q,S,C,C,C,E,E,E,O,C,M,I,G,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SEsBA,SAAS,EAAI,CAAC,EACZ,IAuEI,EAvEA,EAAO,EAAA,YAAA,CAAkB,EAAG,OAAQ,CAAC,EAAG,SACxC,GAsEA,EAAS,CAAC,EAUd,EAAA,OAAA,CAAU,AAhFc,EAgFZ,QAAQ,GAAI,SAAU,CAAC,GACjC,AAVF,SAAS,EAAI,CAAC,CAAE,CAAK,EACnB,IAAI,EAAW,AAxEO,EAwEL,QAAQ,CAAC,GACtB,GAAY,EAAS,MAAM,EAC7B,EAAA,OAAA,CAAU,EAAU,SAAU,CAAK,EACjC,EAAI,EAAO,EAAQ,EACrB,GAEF,CAAM,CAAC,EAAE,CAAG,CACd,EAEM,EAAG,EACT,GACO,GAlFH,EAAS,EAAA,OAAA,CAAM,EAAA,OAAA,CAAS,IAAW,EACnC,EAAU,EAAI,EAAS,CAE3B,CAAA,EAAE,KAAK,GAAG,WAAW,CAAG,EAGxB,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,EAAE,IAAI,CAAC,GAAG,MAAM,EAAI,CACtB,GAGA,IAAI,EA2EG,EAAA,OAAA,CACL,AA5EsB,EA4EpB,KAAK,GACP,SAAU,CAAG,CAAE,CAAC,EACd,OAAO,EAAM,AA9EO,EA8EL,IAAI,CAAC,GAAG,MAAM,AAC/B,EACA,GAhF2B,EAG7B,EAAA,OAAA,CAAU,EAAE,QAAQ,GAAI,SAAU,CAAK,EACrC,AAQJ,CAAA,SAAS,EAAI,CAAC,CAAE,CAAI,CAAE,CAAO,CAAE,CAAM,CAAE,CAAM,CAAE,CAAM,CAAE,CAAC,EACtD,IAAI,EAAW,EAAE,QAAQ,CAAC,GAC1B,GAAI,CAAC,EAAS,MAAM,CAAE,CAChB,IAAM,GACR,EAAE,OAAO,CAAC,EAAM,EAAG,CAAE,OAAQ,EAAG,OAAQ,CAAQ,GAElD,MACF,CAEA,IAAI,EAAM,EAAA,aAAA,CAAmB,EAAG,OAC5B,EAAS,EAAA,aAAA,CAAmB,EAAG,OAC/B,EAAQ,EAAE,IAAI,CAAC,GAEnB,EAAE,SAAS,CAAC,EAAK,GACjB,EAAM,SAAS,CAAG,EAClB,EAAE,SAAS,CAAC,EAAQ,GACpB,EAAM,YAAY,CAAG,EAErB,EAAA,OAAA,CAAU,EAAU,SAAU,CAAK,EACjC,EAAI,EAAG,EAAM,EAAS,EAAQ,EAAQ,EAAQ,GAE9C,IAAI,EAAY,EAAE,IAAI,CAAC,GACnB,EAAW,EAAU,SAAS,CAAG,EAAU,SAAS,CAAG,EACvD,EAAc,EAAU,YAAY,CAAG,EAAU,YAAY,CAAG,EAChE,EAAa,EAAU,SAAS,CAAG,EAAS,EAAI,EAChD,EAAS,IAAa,EAAc,EAAI,EAAS,CAAM,CAAC,EAAE,CAAG,EAEjE,EAAE,OAAO,CAAC,EAAK,EAAU,CACvB,OAAQ,EACR,OAAQ,EACR,YAAa,CAAA,CACf,GAEA,EAAE,OAAO,CAAC,EAAa,EAAQ,CAC7B,OAAQ,EACR,OAAQ,EACR,YAAa,CAAA,CACf,EACF,GAEK,EAAE,MAAM,CAAC,IACZ,EAAE,OAAO,CAAC,EAAM,EAAK,CAAE,OAAQ,EAAG,OAAQ,EAAS,CAAM,CAAC,EAAE,AAAC,EAEjE,CAAA,EAnDQ,EAAG,EAAM,EAAS,EAAQ,EAAQ,EAAQ,EAChD,GAIA,EAAE,KAAK,GAAG,cAAc,CAAG,CAC7B,CA0EA,SAAS,EAAQ,CAAC,EAChB,IAAI,EAAa,EAAE,KAAK,GACxB,EAAE,UAAU,CAAC,EAAW,WAAW,EACnC,OAAO,EAAW,WAAW,CAC7B,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAE1B,AADO,EAAE,IAAI,CAAC,GACT,WAAW,EAClB,EAAE,UAAU,CAAC,EAEjB,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,Q,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SC9GA,SAAS,EAAM,CAAC,EACd,IAAI,EAAU,EAAA,OAAA,CAAa,GACzB,EAAkB,EAAiB,EAAG,EAAA,OAAA,CAAQ,EAAG,EAAU,GAAI,WAC/D,EAAgB,EAAiB,EAAG,EAAA,OAAA,CAAQ,EAAU,EAAG,GAAI,IAAK,YAEhE,EAAW,AAAA,CAAA,EAAA,EAAA,SAAQ,AAAR,EAAU,GACzB,EAAY,EAAG,GAKf,IAAK,IAFH,EADE,EAAS,OAAO,iBAAiB,CAG5B,EAAI,EAAG,EAAW,EAAG,EAAW,EAAG,EAAE,EAAG,EAAE,EAAU,CAC3D,AAoBJ,CAAA,SAA0B,CAAW,CAAE,CAAS,EAC9C,IAAI,EAAK,IAAI,EAAA,KAAI,CACjB,EAAA,OAAA,CAAU,EAAa,SAAU,CAAE,EACjC,IAAI,EAAO,EAAG,KAAK,GAAG,IAAI,CACtB,EAAS,AAAA,CAAA,EAAA,EAAA,YAAW,AAAX,EAAa,EAAI,EAAM,EAAI,GACxC,EAAA,OAAA,CAAU,EAAO,EAAE,CAAE,SAAU,CAAC,CAAE,CAAC,EACjC,EAAG,IAAI,CAAC,GAAG,KAAK,CAAG,CACrB,GACA,AAAA,CAAA,EAAA,EAAA,sBAAqB,AAArB,EAAuB,EAAI,EAAI,EAAO,EAAE,CAC1C,EACF,CAAA,EA9BqB,EAAI,EAAI,EAAkB,EAAe,EAAI,GAAK,GAEnE,EAAW,EAAA,gBAAA,CAAsB,GACjC,IAAI,EAAK,AAAA,CAAA,EAAA,EAAA,UAAS,AAAT,EAAW,EAAG,GACnB,EAAK,IACP,EAAW,EACX,EAAO,EAAA,OAAA,CAAY,GACnB,EAAS,EAEb,CAEA,EAAY,EAAG,EACjB,CAEA,SAAS,EAAiB,CAAC,CAAE,CAAK,CAAE,CAAY,EAC9C,OAAO,EAAA,OAAA,CAAM,EAAO,SAAU,CAAI,EAChC,MAAO,AAAA,CAAA,EAAA,EAAA,eAAc,AAAd,EAAgB,EAAG,EAAM,EAClC,EACF,CAcA,SAAS,EAAY,CAAC,CAAE,CAAQ,EAC9B,EAAA,OAAA,CAAU,EAAU,SAAU,CAAK,EACjC,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,CAAE,CAAC,EAC7B,EAAE,IAAI,CAAC,GAAG,KAAK,CAAG,CACpB,EACF,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SChDA,EAJA,SAAmB,CAAK,EACtB,MAAO,AAAA,CAAA,EAAA,EAAA,OAAQ,AAAR,EAAU,EAAO,EAC1B,C,G,E,Q,S,C,C,C,E,E,E,O,C,yB,I,G,I,E,E,SCtBA,SAAS,EAAuB,CAAC,CAAE,CAAE,CAAE,CAAE,EACvC,IACE,EADE,EAAO,CAAC,EAGZ,EAAA,OAAA,CAAU,EAAI,SAAU,CAAC,EAIvB,IAHA,IACE,EACA,EAFE,EAAQ,EAAE,MAAM,CAAC,GAGd,GAAO,CASZ,GARA,CAAA,EAAS,EAAE,MAAM,CAAC,EAAlB,GAEE,EAAY,CAAI,CAAC,EAAO,CACxB,CAAI,CAAC,EAAO,CAAG,IAEf,EAAY,EACZ,EAAW,GAET,GAAa,IAAc,EAAO,CACpC,EAAG,OAAO,CAAC,EAAW,GACtB,MACF,CACA,EAAQ,CACV,CACF,EAyBF,C,G,E,Q,S,C,C,C,E,E,E,O,C,kB,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCjBA,SAAS,EAAgB,CAAC,CAAE,CAAI,CAAE,CAAY,EAC5C,IAAI,EAAO,AAmCb,SAAwB,CAAC,EAEvB,IADA,IAAI,EACG,EAAE,OAAO,CAAE,EAAI,EAAA,OAAA,CAAW,YACjC,OAAO,CACT,EAvC4B,GACxB,EAAS,GAAI,CAAA,EAAA,EAAA,KAAI,AAAJ,EAAM,CAAE,SAAU,CAAA,CAAK,GACjC,QAAQ,CAAC,CAAE,KAAM,CAAK,GACtB,mBAAmB,CAAC,SAAU,CAAC,EAC9B,OAAO,EAAE,IAAI,CAAC,EAChB,GA2BJ,OAzBA,EAAA,OAAA,CAAU,EAAE,KAAK,GAAI,SAAU,CAAC,EAC9B,IAAI,EAAO,EAAE,IAAI,CAAC,GAChB,EAAS,EAAE,MAAM,CAAC,GAEhB,CAAA,EAAK,IAAI,GAAK,GAAS,EAAK,OAAO,EAAI,GAAQ,GAAQ,EAAK,OAAO,AAAP,IAC9D,EAAO,OAAO,CAAC,GACf,EAAO,SAAS,CAAC,EAAG,GAAU,GAG9B,EAAA,OAAA,CAAU,CAAC,CAAC,EAAa,CAAC,GAAI,SAAU,CAAC,EACvC,IAAI,EAAI,EAAE,CAAC,GAAK,EAAI,EAAE,CAAC,CAAG,EAAE,CAAC,CAC3B,EAAO,EAAO,IAAI,CAAC,EAAG,GACtB,EAAS,AAAC,EAAA,OAAA,CAAc,GAAsB,EAAd,EAAK,MAAM,CAC7C,EAAO,OAAO,CAAC,EAAG,EAAG,CAAE,OAAQ,EAAE,IAAI,CAAC,GAAG,MAAM,CAAG,CAAO,EAC3D,GAEI,EAAA,OAAA,CAAM,EAAM,YACd,EAAO,OAAO,CAAC,EAAG,CAChB,WAAY,EAAK,UAAU,CAAC,EAAK,CACjC,YAAa,EAAK,WAAW,CAAC,EAAK,AACrC,GAGN,GAEO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,a,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCjDA,SAAS,EAAW,CAAC,CAAE,CAAQ,EAE7B,IAAK,IADD,EAAK,EACA,EAAI,EAAG,EAAI,EAAS,MAAM,CAAE,EAAE,EACrC,GAAM,AAKV,SAA4B,CAAC,CAAE,CAAU,CAAE,CAAU,EAuBnD,IAnBA,IAAI,EAAW,EAAA,OAAA,CACb,EACA,EAAA,OAAA,CAAM,EAAY,SAAU,CAAC,CAAE,CAAC,EAC9B,OAAO,CACT,IAEE,EAAe,EAAA,OAAA,CACjB,EAAA,OAAA,CAAM,EAAY,SAAU,CAAC,EAC3B,OAAO,EAAA,OAAA,CACL,EAAA,OAAA,CAAM,EAAE,QAAQ,CAAC,GAAI,SAAU,CAAC,EAC9B,MAAO,CAAE,IAAK,CAAQ,CAAC,EAAE,CAAC,CAAC,CAAE,OAAQ,EAAE,IAAI,CAAC,GAAG,MAAM,AAAC,CACxD,GACA,MAEJ,IAIE,EAAa,EACV,EAAa,EAAW,MAAM,EAAE,IAAe,EACtD,IAAI,EAAW,EAAI,EAAa,EAChC,GAAc,EACd,IAAI,EAAO,EAAA,OAAA,CAAM,AAAI,MAAM,GAAW,WACpC,OAAO,CACT,GAGI,EAAK,EAqBT,OApBA,EAAA,OAAA,CAEE,EAAa,OAAO,CAAC,SAAU,CAAK,EAClC,IAAI,EAAQ,EAAM,GAAG,CAAG,CACxB,CAAA,CAAI,CAAC,EAAM,EAAI,EAAM,MAAM,CAG3B,IAFA,IAAI,EAAY,EAET,EAAQ,GAET,EAAQ,GACV,CAAA,GAAa,CAAI,CAAC,EAAQ,EAAE,AAAF,EAG5B,EAAS,EAAQ,GAAM,EACvB,CAAI,CAAC,EAAM,EAAI,EAAM,MAAM,CAE7B,GAAM,EAAM,MAAM,CAAG,CACvB,IAGK,CACT,EA1D6B,EAAG,CAAQ,CAAC,EAAI,EAAE,CAAE,CAAQ,CAAC,EAAE,EAE1D,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,S,E,E,SCqBA,EAba,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,SAAS,CAAU,CAAE,CAAS,EAClD,GAAI,AAAc,MAAd,EACF,MAAO,EAAE,CAEX,IAAI,EAAS,EAAU,MAAM,CAM7B,OALI,EAAS,GAAK,AAAA,CAAA,EAAA,EAAA,OAAa,AAAb,EAAe,EAAY,CAAS,CAAC,EAAE,CAAE,CAAS,CAAC,EAAE,EACrE,EAAY,EAAE,CACL,EAAS,GAAK,AAAA,CAAA,EAAA,EAAA,OAAa,AAAb,EAAe,CAAS,CAAC,EAAE,CAAE,CAAS,CAAC,EAAE,CAAE,CAAS,CAAC,EAAE,GAC9E,CAAA,EAAY,CAAC,CAAS,CAAC,EAAE,CAAC,AAAA,EAErB,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,EAAY,AAAA,CAAA,EAAA,EAAA,OAAU,AAAV,EAAY,EAAW,GAAI,EAAE,CAC9D,E,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCGA,EA7BA,SAAqB,CAAU,CAAE,CAAS,CAAE,CAAM,EAE9C,EADE,EAAU,MAAM,CACN,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAW,SAAS,CAAQ,QAC/C,AAAI,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,GACH,SAAS,CAAK,EACnB,MAAO,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,EAAO,AAAoB,IAApB,EAAS,MAAM,CAAS,CAAQ,CAAC,EAAE,CAAG,EAC9D,EAEK,CACT,GAEY,CAAC,EAAA,OAAO,CAAE,CAGxB,IAAI,EAAQ,GACZ,EAAY,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAW,AAAA,CAAA,EAAA,EAAA,OAAQ,AAAR,EAAU,EAAA,OAAW,GAErD,IAAI,EAAS,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,EAAY,SAAS,CAAK,CAAE,CAAG,CAAE,CAAU,EAI9D,MAAO,CAAE,SAHM,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,EAAW,SAAS,CAAQ,EAClD,OAAO,EAAS,EAClB,GAC+B,MAAS,EAAE,EAAO,MAAS,CAAM,CAClE,GAEA,MAAO,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,EAAQ,SAAS,CAAM,CAAE,CAAK,EAC9C,MAAO,AAAA,CAAA,EAAA,EAAA,OAAc,AAAd,EAAgB,EAAQ,EAAO,EACxC,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,GC1BA,IAAA,EAVA,SAAoB,CAAK,CAAE,CAAQ,EACjC,IAAI,EAAS,EAAM,MAAM,CAGzB,IADA,EAAM,IAAI,CAAC,GACJ,KACL,CAAK,CAAC,EAAO,CAAG,CAAK,CAAC,EAAO,CAAC,KAAK,CAErC,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCyBA,EA3BA,SAAyB,CAAM,CAAE,CAAK,CAAE,CAAM,EAO5C,IANA,IAAI,EAAQ,GACR,EAAc,EAAO,QAAQ,CAC7B,EAAc,EAAM,QAAQ,CAC5B,EAAS,EAAY,MAAM,CAC3B,EAAe,EAAO,MAAM,CAEzB,EAAE,EAAQ,GAAQ,CACvB,IAAI,EAAS,AAAA,CAAA,EAAA,EAAA,OAAe,AAAf,EAAiB,CAAW,CAAC,EAAM,CAAE,CAAW,CAAC,EAAM,EACpE,GAAI,EAAQ,CACV,GAAI,GAAS,EACX,OAAO,EAGT,OAAO,EAAU,CAAA,AAAS,QADd,CAAM,CAAC,EAAM,CACU,GAAK,CAAA,CAC1C,CACF,CAQA,OAAO,EAAO,KAAK,CAAG,EAAM,KAAK,AACnC,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,SCDA,EA9BA,SAA0B,CAAK,CAAE,CAAK,EACpC,GAAI,IAAU,EAAO,CACnB,IAAI,EAAe,AAAU,KAAA,IAAV,EACf,EAAY,AAAU,OAAV,EACZ,EAAiB,GAAU,EAC3B,EAAc,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAEvB,EAAe,AAAU,KAAA,IAAV,EACf,EAAY,AAAU,OAAV,EACZ,EAAiB,GAAU,EAC3B,EAAc,AAAA,CAAA,EAAA,EAAA,OAAO,AAAP,EAAS,GAE3B,GAAI,CAAE,GAAa,CAAC,GAAe,CAAC,GAAe,EAAQ,GACtD,GAAe,GAAgB,GAAkB,CAAC,GAAa,CAAC,GAChE,GAAa,GAAgB,GAC7B,CAAC,GAAgB,GAClB,CAAC,EACH,OAAO,EAET,GAAI,CAAE,GAAa,CAAC,GAAe,CAAC,GAAe,EAAQ,GACtD,GAAe,GAAgB,GAAkB,CAAC,GAAa,CAAC,GAChE,GAAa,GAAgB,GAC7B,CAAC,GAAgB,GAClB,CAAC,EACH,OAAO,EAEX,CACA,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,Y,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCvBA,SAAS,EAAU,CAAC,EAClB,IAAI,EAAU,CAAC,EACX,EAAc,EAAA,OAAA,CAAS,EAAE,KAAK,GAAI,SAAU,CAAC,EAC/C,MAAO,CAAC,EAAE,QAAQ,CAAC,GAAG,MAAM,AAC9B,GACI,EAAU,EAAA,OAAA,CACZ,EAAA,OAAA,CAAM,EAAa,SAAU,CAAC,EAC5B,OAAO,EAAE,IAAI,CAAC,GAAG,IAAI,AACvB,IAEE,EAAS,EAAA,OAAA,CAAM,EAAA,OAAA,CAAQ,EAAU,GAAI,WACvC,MAAO,EAAE,AACX,GAUI,EAAY,EAAA,OAAA,CAAS,EAAa,SAAU,CAAC,EAC/C,OAAO,EAAE,IAAI,CAAC,GAAG,IAAI,AACvB,GAGA,OAFA,EAAA,OAAA,CAAU,EAXV,SAAS,EAAI,CAAC,EACR,EAAA,OAAA,CAAM,EAAS,KACnB,CAAO,CAAC,EAAE,CAAG,CAAA,EAEb,CAAM,CAAC,AADI,EAAE,IAAI,CAAC,GACN,IAAI,CAAC,CAAC,IAAI,CAAC,GACvB,EAAA,OAAA,CAAU,EAAE,UAAU,CAAC,GAAI,GAC7B,GAOO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,e,ICpCA,SAAS,EAAa,CAAC,CAAE,CAAC,CAAE,CAAE,CAAE,CAAS,EACvC,IAAI,EAAU,EAAE,QAAQ,CAAC,GACrB,EAAO,EAAE,IAAI,CAAC,GACd,EAAK,EAAO,EAAK,UAAU,CAAG,KAAA,EAC9B,EAAK,EAAO,EAAK,WAAW,CAAG,KAAA,EAC/B,EAAY,CAAC,EAEb,GACF,CAAA,EAAU,EAAA,OAAA,CAAS,EAAS,SAAU,CAAC,EACrC,OAAO,IAAM,GAAM,IAAM,CAC3B,EAAA,EAGF,IAAI,EAAc,AAAA,CAAA,EAAA,EAAA,UAAS,AAAT,EAAW,EAAG,GAChC,EAAA,OAAA,CAAU,EAAa,SAAU,CAAK,EACpC,GAAI,EAAE,QAAQ,CAAC,EAAM,CAAC,EAAE,MAAM,CAAE,CAC9B,IAAI,EAAiB,EAAa,EAAG,EAAM,CAAC,CAAE,EAAI,EAClD,CAAA,CAAS,CAAC,EAAM,CAAC,CAAC,CAAG,EACjB,EAAA,OAAA,CAAM,EAAgB,gBA2CzB,EAAA,OAAA,CAAc,AA1CI,EA0CG,UAAU,GAMlC,AAhDqB,EAgDd,UAAU,CAAG,AAhDQ,EAgDF,UAAU,CACpC,AAjDqB,EAiDd,MAAM,CAAG,AAjDY,EAiDN,MAAM,GAN5B,AA3CqB,EA2Cd,UAAU,CACf,AAAC,CAAA,AA5CkB,EA4CX,UAAU,CAAG,AA5CF,EA4CS,MAAM,CAAG,AA5CX,EA4CiB,UAAU,CAAG,AA5C9B,EA4CoC,MAAK,AAAL,EAC7D,CAAA,AA7CkB,EA6CX,MAAM,CAAG,AA7CS,EA6CH,MAAK,AAAL,EACzB,AA9CqB,EA8Cd,MAAM,EAAI,AA9CW,EA8CL,MAAM,EA5C7B,CACF,GAEA,IAAI,EAAU,AAAA,CAAA,EAAA,EAAA,gBAAe,AAAf,EAAiB,EAAa,GAwB5C,EAAA,OAAA,CAvBgB,EAuBG,SAAU,CAAK,EAChC,EAAM,EAAE,CAAG,EAAA,OAAA,CACT,EAAM,EAAE,CAAC,GAAG,CAAC,SAAU,CAAC,SACtB,AAAI,AA1Be,CA0BN,CAAC,EAAE,CACP,AA3BU,CA2BD,CAAC,EAAE,CAAC,EAAE,CAEjB,CACT,GAEJ,GA9BA,IAAI,EAAS,AAAA,CAAA,EAAA,EAAA,IAAG,AAAH,EAAK,EAAS,GAE3B,GAAI,IACF,EAAO,EAAE,CAAG,EAAA,OAAA,CAAU,CAAC,EAAI,EAAO,EAAE,CAAE,EAAG,EACrC,EAAE,YAAY,CAAC,GAAI,MAAM,EAAE,CAC7B,IAAI,EAAS,EAAE,IAAI,CAAC,EAAE,YAAY,CAAC,EAAG,CAAC,EAAE,EACvC,EAAS,EAAE,IAAI,CAAC,EAAE,YAAY,CAAC,EAAG,CAAC,EAAE,EAClC,EAAA,OAAA,CAAM,EAAQ,gBACjB,EAAO,UAAU,CAAG,EACpB,EAAO,MAAM,CAAG,GAElB,EAAO,UAAU,CACf,AAAC,CAAA,EAAO,UAAU,CAAG,EAAO,MAAM,CAAG,EAAO,KAAK,CAAG,EAAO,KAAI,AAAJ,EAAU,CAAA,EAAO,MAAM,CAAG,CAAA,EACvF,EAAO,MAAM,EAAI,CACnB,CAGF,OAAO,CACT,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,Q,G,E,Q,S,C,C,C,E,E,E,O,C,a,I,G,I,E,E,S,E,E,SChDA,SAAS,EAAW,CAAC,CAAE,CAAO,EAC5B,OAAO,EAAA,OAAA,CAAM,EAAS,SAAU,CAAC,EAC/B,IAAI,EAAM,EAAE,OAAO,CAAC,GACpB,GAAI,CAAC,EAAI,MAAM,CACb,MAAO,CAAE,EAAG,CAAE,EAEd,IAAI,EAAS,EAAA,OAAA,CACX,EACA,SAAU,CAAG,CAAE,CAAC,EACd,IAAI,EAAO,EAAE,IAAI,CAAC,GAChB,EAAQ,EAAE,IAAI,CAAC,EAAE,CAAC,EACpB,MAAO,CACL,IAAK,EAAI,GAAG,CAAG,EAAK,MAAM,CAAG,EAAM,KAAK,CACxC,OAAQ,EAAI,MAAM,CAAG,EAAK,MAAM,AAClC,CACF,EACA,CAAE,IAAK,EAAG,OAAQ,CAAE,GAGtB,MAAO,CACL,EAAG,EACH,WAAY,EAAO,GAAG,CAAG,EAAO,MAAM,CACtC,OAAQ,EAAO,MAAM,AACvB,CAEJ,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,mB,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCDA,SAAS,EAAiB,CAAO,CAAE,CAAE,EACnC,IAAI,EAAgB,CAAC,EA+BrB,OA9BA,EAAA,OAAA,CAAU,EAAS,SAAU,CAAK,CAAE,CAAC,EACnC,IAAI,EAAO,CAAa,CAAC,EAAM,CAAC,CAAC,CAAG,CAClC,SAAU,EACV,GAAI,EAAE,CACN,IAAK,EAAE,CACP,GAAI,CAAC,EAAM,CAAC,CAAC,CACb,EAAG,CACL,EACK,EAAA,OAAA,CAAc,EAAM,UAAU,IAEjC,EAAI,UAAU,CAAG,EAAM,UAAU,CAEjC,EAAI,MAAM,CAAG,EAAM,MAAM,CAE7B,GAEA,EAAA,OAAA,CAAU,EAAG,KAAK,GAAI,SAAU,CAAC,EAC/B,IAAI,EAAS,CAAa,CAAC,EAAE,CAAC,CAAC,CAC3B,EAAS,CAAa,CAAC,EAAE,CAAC,CAAC,CAC1B,EAAA,OAAA,CAAc,IAAY,EAAA,OAAA,CAAc,KAC3C,EAAO,QAAQ,GACf,EAAO,GAAG,CAAC,IAAI,CAAC,CAAa,CAAC,EAAE,CAAC,CAAC,EAEtC,GAOO,AAGT,SAA4B,CAAS,EA2BnC,IA1BA,IAAI,EAAU,EAAE,CA0BT,EAAU,MAAM,EAAE,CACvB,IAAI,EAAQ,EAAU,GAAG,GACzB,EAAQ,IAAI,CAAC,GACb,EAAA,OAAA,CAAU,EAAM,EAAK,CAAC,OAAO,GAAI,AA3BnC,SAAkB,CAAM,EACtB,OAAO,SAAU,CAAM,GACjB,EAAO,MAAM,EAIf,CAAA,EAAA,OAAA,CAAc,EAAO,UAAU,GAC/B,EAAA,OAAA,CAAc,EAAO,UAAU,GAC/B,EAAO,UAAU,EAAI,EAAO,UAAU,AAAV,GAE5B,AA+BR,SAAsB,CAAM,CAAE,CAAM,EAClC,IAAI,EAAM,EACN,EAAS,CAET,CAAA,EAAO,MAAM,GACf,GAAO,EAAO,UAAU,CAAG,EAAO,MAAM,CACxC,GAAU,EAAO,MAAM,EAGrB,EAAO,MAAM,GACf,GAAO,EAAO,UAAU,CAAG,EAAO,MAAM,CACxC,GAAU,EAAO,MAAM,EAGzB,EAAO,EAAE,CAAG,EAAO,EAAE,CAAC,MAAM,CAAC,EAAO,EAAE,EACtC,EAAO,UAAU,CAAG,EAAM,EAC1B,EAAO,MAAM,CAAG,EAChB,EAAO,CAAC,CAAG,KAAK,GAAG,CAAC,EAAO,CAAC,CAAE,EAAO,CAAC,EACtC,EAAO,MAAM,CAAG,CAAA,CAClB,EAlDqB,EAAQ,EAEzB,CACF,EAc4C,IAC1C,EAAA,OAAA,CAAU,EAAM,GAAG,CAAE,AAbvB,SAAmB,CAAM,EACvB,OAAO,SAAU,CAAM,EACrB,EAAO,EAAK,CAAC,IAAI,CAAC,GACQ,GAAtB,EAAE,EAAO,QAAQ,EACnB,EAAU,IAAI,CAAC,EAEnB,CACF,EAMiC,GACjC,CAEA,OAAO,EAAA,OAAA,CACL,EAAA,OAAA,CAAS,EAAS,SAAU,CAAK,EAC/B,MAAO,CAAC,EAAM,MAAM,AACtB,GACA,SAAU,CAAK,EACb,OAAO,EAAA,OAAA,CAAO,EAAO,CAAC,KAAM,IAAK,aAAc,SAAS,CAC1D,EAEJ,EAlDkB,EAAA,OAAA,CAAS,EAAe,SAAU,CAAK,EAErD,MAAO,CAAC,EAAM,QAAQ,AACxB,GAGF,C,G,E,Q,S,C,C,C,E,E,E,O,C,O,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCzDA,SAAS,EAAK,CAAO,CAAE,CAAS,EAC9B,IA0CuB,EA1CnB,EAAQ,EAAA,SAAA,CAAe,EAAS,SAAU,CAAK,EACjD,OAAO,EAAA,OAAA,CAAM,EAAO,aACtB,GACI,EAAW,EAAM,GAAG,CACtB,EAAa,EAAA,OAAA,CAAS,EAAM,GAAG,CAAE,SAAU,CAAK,EAC9C,MAAO,CAAC,EAAM,CAAC,AACjB,GACA,EAAK,EAAE,CACP,EAAM,EACN,EAAS,EACT,EAAU,EAEZ,EAAS,IAAI,EA8BU,EA9BO,CAAC,CAAC,EA+BzB,SAAU,CAAM,CAAE,CAAM,SAC7B,AAAI,EAAO,UAAU,CAAG,EAAO,UAAU,CAChC,GACE,EAAO,UAAU,CAAG,EAAO,UAAU,CACvC,EAGF,AAAC,EAA6B,EAAO,CAAC,CAAG,EAAO,CAAC,CAAzC,EAAO,CAAC,CAAG,EAAO,CAAC,AACpC,IArCA,EAAU,EAAkB,EAAI,EAAY,GAE5C,EAAA,OAAA,CAAU,EAAU,SAAU,CAAK,EACjC,GAAW,EAAM,EAAE,CAAC,MAAM,CAC1B,EAAG,IAAI,CAAC,EAAM,EAAE,EAChB,GAAO,EAAM,UAAU,CAAG,EAAM,MAAM,CACtC,GAAU,EAAM,MAAM,CACtB,EAAU,EAAkB,EAAI,EAAY,EAC9C,GAEA,IAAI,EAAS,CAAE,GAAI,EAAA,OAAA,CAAU,EAAI,EAKjC,OAJI,IACF,EAAO,UAAU,CAAG,EAAM,EAC1B,EAAO,MAAM,CAAG,GAEX,CACT,CAEA,SAAS,EAAkB,CAAE,CAAE,CAAU,CAAE,CAAK,EAE9C,IADA,IAAI,EACG,EAAW,MAAM,EAAK,AAAA,CAAA,EAAO,EAAA,OAAA,CAAO,EAAA,EAAa,CAAC,EAAI,GAC3D,EAAW,GAAG,GACd,EAAG,IAAI,CAAC,EAAK,EAAE,EACf,IAEF,OAAO,CACT,C,G,E,Q,S,C,C,C,E,E,E,O,C,oB,I,G,I,E,E,SC1CA,SAAS,EAAkB,CAAC,EAC1B,IAqEI,EACA,EAtEA,GAqEA,EAAS,CAAC,EACV,EAAM,EAOV,EAAA,OAAA,CAAU,AA7EoB,EA6ElB,QAAQ,GALpB,SAAS,EAAI,CAAC,EACZ,IAAI,EAAM,EACV,EAAA,OAAA,CAAU,AA1EkB,EA0EhB,QAAQ,CAAC,GAAI,GACzB,CAAM,CAAC,EAAE,CAAG,CAAE,IAAK,EAAK,IAAK,GAAM,CACrC,GAGO,GA7EP,EAAA,OAAA,CAAU,EAAE,KAAK,GAAG,WAAW,CAAE,SAAU,CAAC,EAU1C,IATA,IAAI,EAAO,EAAE,IAAI,CAAC,GACd,EAAU,EAAK,OAAO,CACtB,EAAW,AAsCnB,SAAkB,CAAC,CAAE,CAAa,CAAE,CAAC,CAAE,CAAC,EACtC,IAII,EACA,EALA,EAAQ,EAAE,CACV,EAAQ,EAAE,CACV,EAAM,KAAK,GAAG,CAAC,CAAa,CAAC,EAAE,CAAC,GAAG,CAAE,CAAa,CAAC,EAAE,CAAC,GAAG,EACzD,EAAM,KAAK,GAAG,CAAC,CAAa,CAAC,EAAE,CAAC,GAAG,CAAE,CAAa,CAAC,EAAE,CAAC,GAAG,EAK7D,EAAS,EACT,GAEE,EAAM,IAAI,CADV,EAAS,EAAE,MAAM,CAAC,UAEX,GAAW,CAAA,CAAa,CAAC,EAAO,CAAC,GAAG,CAAG,GAAO,EAAM,CAAa,CAAC,EAAO,CAAC,GAAE,AAAF,EAAM,AAKzF,IAJA,EAAM,EAGN,EAAS,EACF,AAAC,CAAA,EAAS,EAAE,MAAM,CAAC,EAAA,IAAa,GACrC,EAAM,IAAI,CAAC,GAGb,MAAO,CAAE,KAAM,EAAM,MAAM,CAAC,EAAM,OAAO,IAAK,IAAK,CAAI,CACzD,EA7D4B,EAAG,EAAe,EAAQ,CAAC,CAAE,EAAQ,CAAC,EAC1D,EAAO,EAAS,IAAI,CACpB,EAAM,EAAS,GAAG,CAClB,EAAU,EACV,EAAQ,CAAI,CADF,EACW,CACrB,EAAY,CAAA,EAET,IAAM,EAAQ,CAAC,EAAE,CAGtB,GAFA,EAAO,EAAE,IAAI,CAAC,GAEV,EAAW,CACb,KAAQ,AAAA,CAAA,EAAQ,CAAI,CAAC,EAAO,AAAP,IAAc,GAAO,EAAE,IAAI,CAAC,GAAO,OAAO,CAAG,EAAK,IAAI,EACzE,IAGE,IAAU,GACZ,CAAA,EAAY,CAAA,CADd,CAGF,CAEA,GAAI,CAAC,EAAW,CACd,KACE,EAAU,EAAK,MAAM,CAAG,GACxB,EAAE,IAAI,CAAE,EAAQ,CAAI,CAAC,EAAU,EAAE,EAAG,OAAO,EAAI,EAAK,IAAI,EAExD,IAEF,EAAQ,CAAI,CAAC,EAAQ,AACvB,CAEA,EAAE,SAAS,CAAC,EAAG,GACf,EAAI,EAAE,UAAU,CAAC,EAAE,CAAC,EAAE,AACxB,CACF,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,W,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCtCA,SAAS,EAAS,CAAC,MASA,EACb,EACA,EACA,EAHa,EARjB,EAAI,EAAA,kBAAA,CAAwB,GASxB,EAAW,EAAA,gBAAA,CAAsB,GACjC,EAAU,EAAE,KAAK,GAAG,OAAO,CAC3B,EAAQ,EACZ,EAAA,OAAA,CAAU,EAAU,SAAU,CAAK,EACjC,IAAI,EAAY,EAAA,OAAA,CACd,EAAA,OAAA,CAAM,EAAO,SAAU,CAAC,EACtB,OAAO,EAAE,IAAI,CAAC,GAAG,MAAM,AACzB,IAEF,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,EAC1B,EAAE,IAAI,CAAC,GAAG,CAAC,CAAG,EAAQ,EAAY,CACpC,GACA,GAAS,EAAY,CACvB,GAnBA,EAAA,OAAA,CAAS,AAAA,CAAA,EAAA,EAAA,SAAQ,AAAR,EAAU,GAAI,SAAU,CAAC,CAAE,CAAC,EACnC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAG,CAChB,EACF,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,SCsBA,EAJA,SAAgB,CAAM,CAAE,CAAQ,EAC9B,OAAO,GAAU,AAAA,CAAA,EAAA,EAAA,OAAS,AAAT,EAAW,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,GACnD,C,G,E,Q,S,C,C,C,E,E,E,O,C,Y,I,G,I,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,S,E,E,SCkGA,SAAS,EAAY,CAAS,CAAE,CAAC,CAAE,CAAC,EAClC,GAAI,EAAI,EAAG,CACT,IAAI,EAAM,EACV,EAAI,EACJ,EAAI,CACN,CAEA,IAAI,EAAa,CAAS,CAAC,EAAE,CACxB,GACH,CAAA,CAAS,CAAC,EAAE,CAAG,EAAa,CAAC,CAAA,EAE/B,CAAU,CAAC,EAAE,CAAG,CAAA,CAClB,CAuMA,SAAS,EAAU,CAAC,EAClB,IA/SI,EA4QA,EACF,EACA,EAqBkB,EAgBhB,EAJA,EAAW,EAAA,gBAAA,CAAsB,GACjC,EAAY,EAAA,OAAA,EAhTZ,EAAY,CAAC,EAmCjB,EAAA,OAAA,CA6Q8C,EA9S9C,SAAoB,CAAS,CAAE,CAAK,EAClC,IAEE,EAAK,EAGL,EAAU,EACV,EAAkB,EAAU,MAAM,CAClC,EAAW,EAAA,OAAA,CAAO,GAsBpB,OApBA,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,CAAE,CAAC,EAC7B,IAAI,EAAI,AAsEd,SAAmC,CAAC,CAAE,CAAC,EACrC,GAAI,EAAE,IAAI,CAAC,GAAG,KAAK,CACjB,OAAO,EAAA,OAAA,CAAO,EAAE,YAAY,CAAC,GAAI,SAAU,CAAC,EAC1C,OAAO,EAAE,IAAI,CAAC,GAAG,KAAK,AACxB,EAEJ,EAuN6C,EAnSF,GACnC,EAAK,EAAI,AAkS4B,EAlS1B,IAAI,CAAC,GAAG,KAAK,CAAG,EAEzB,CAAA,GAAK,IAAM,CAAA,IACb,EAAA,OAAA,CAAU,EAAM,KAAK,CAAC,EAAS,EAAI,GAAI,SAAU,CAAQ,EACvD,EAAA,OAAA,CAAU,AA8RyB,EA9RvB,YAAY,CAAC,GAAW,SAAU,CAAC,EAC7C,IAAI,EAAS,AA6RoB,EA7RlB,IAAI,CAAC,GAClB,EAAO,EAAO,KAAK,CAChB,CAAA,EAAO,GAAM,EAAK,CAAA,GAAS,CAAE,CAAA,EAAO,KAAK,EAAI,AA2RjB,EA3RmB,IAAI,CAAC,GAAU,KAAK,AAAL,GACjE,EAAY,EAAW,EAAG,EAE9B,EACF,GAEA,EAAU,EAAI,EACd,EAAK,EAET,GAEO,CACT,GAGO,GA4QkD,AAzQ3D,SAA4B,CAAC,CAAE,CAAQ,EACrC,IAAI,EAAY,CAAC,EAEjB,SAAS,EAAK,CAAK,CAAE,CAAQ,CAAE,CAAQ,CAAE,CAAe,CAAE,CAAe,EACvE,IAAI,EACJ,EAAA,OAAA,CAAU,EAAA,OAAA,CAAQ,EAAU,GAAW,SAAU,CAAC,EAChD,EAAI,CAAK,CAAC,EAAE,CACR,EAAE,IAAI,CAAC,GAAG,KAAK,EACjB,EAAA,OAAA,CAAU,EAAE,YAAY,CAAC,GAAI,SAAU,CAAC,EACtC,IAAI,EAAQ,EAAE,IAAI,CAAC,EACf,CAAA,EAAM,KAAK,EAAK,CAAA,EAAM,KAAK,CAAG,GAAmB,EAAM,KAAK,CAAG,CAAA,GACjE,EAAY,EAAW,EAAG,EAE9B,EAEJ,EACF,CAyBA,OADA,EAAA,OAAA,CAAS,EAtBT,SAAoB,CAAK,CAAE,CAAK,EAC9B,IACE,EADE,EAAe,GAEjB,EAAW,EAgBb,OAdA,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,CAAE,CAAc,EAC1C,GAAI,AAAoB,WAApB,EAAE,IAAI,CAAC,GAAG,KAAK,CAAe,CAChC,IAAI,EAAe,EAAE,YAAY,CAAC,EAC9B,CAAA,EAAa,MAAM,GACrB,EAAe,EAAE,IAAI,CAAC,CAAY,CAAC,EAAE,EAAE,KAAK,CAC5C,EAAK,EAAO,EAAU,EAAgB,EAAc,GAEpD,EAAW,EACX,EAAe,EAEnB,CACA,EAAK,EAAO,EAAU,EAAM,MAAM,CAAE,EAAc,EAAM,MAAM,CAChE,GAEO,CACT,GAGO,CACT,EA+N8E,EAAG,IAE3E,EAAM,CAAC,EAEX,EAAA,OAAA,CAAU,CAAC,IAAK,IAAI,CAAE,SAAU,CAAI,EAClC,EAAmB,AAAS,MAAT,EAAe,EAAW,EAAA,OAAA,CAAS,GAAU,OAAO,GACvE,EAAA,OAAA,CAAU,CAAC,IAAK,IAAI,CAAE,SAAU,CAAK,EACrB,MAAV,GACF,CAAA,EAAmB,EAAA,OAAA,CAAM,EAAkB,SAAU,CAAK,EACxD,OAAO,EAAA,OAAA,CAAS,GAAO,OAAO,EAChC,EAAA,EAGF,IAnMwB,EACxB,EACF,EACA,EAgMM,EAAa,AAAC,CAAA,AAAS,MAAT,EAAe,EAAE,YAAY,CAAG,EAAE,UAAS,AAAT,EAAY,IAAI,CAAC,GACjE,GApMoB,EAoMS,EAnMjC,EAAO,CAAC,EACV,EAAQ,CAAC,EACT,EAAM,CAAC,EAKT,EAAA,OAAA,CAAU,EAAU,SAAU,CAAK,EACjC,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,CAAE,CAAK,EACjC,CAAI,CAAC,EAAE,CAAG,EACV,CAAK,CAAC,EAAE,CAAG,EACX,CAAG,CAAC,EAAE,CAAG,CACX,EACF,GAEA,EAAA,OAAA,CAAU,EAAU,SAAU,CAAK,EACjC,IAAI,EAAU,GACd,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,EAC1B,IAAI,EAAK,AAiLqD,EAjL1C,GACpB,GAAI,EAAG,MAAM,CAKX,IAAK,IADD,EAAK,AAAC,CAAA,AAHV,CAAA,EAAK,EAAA,OAAA,CAAS,EAAI,SAAU,CAAC,EAC3B,OAAO,CAAG,CAAC,EAAE,AACf,EAAA,EACa,MAAM,CAAG,CAAA,EAAK,EAClB,EAAI,KAAK,KAAK,CAAC,GAAK,EAAK,KAAK,IAAI,CAAC,GAAK,GAAK,EAAI,EAAE,EAAG,CAC7D,IAAI,EAAI,CAAE,CAAC,EAAE,AACT,CAAA,CAAK,CAAC,EAAE,GAAK,GAAK,EAAU,CAAG,CAAC,EAAE,EAAI,CAAC,AA5CrD,SAAqB,CAAS,CAAE,CAAC,CAAE,CAAC,EAClC,GAAI,EAAI,EAAG,CACT,IAAI,EAAM,EACV,EAAI,EACJ,EAAI,CACN,CACA,OAAO,EAAA,OAAA,CAAM,CAAS,CAAC,EAAE,CAAE,EAC7B,EA8MyD,EAzKmB,EAAG,KACnE,CAAK,CAAC,EAAE,CAAG,EACX,CAAK,CAAC,EAAE,CAAG,CAAI,CAAC,EAAE,CAAG,CAAI,CAAC,EAAE,CAC5B,EAAU,CAAG,CAAC,EAAE,CAEpB,CAEJ,EACF,GAEO,CAAE,KAAM,EAAM,MAAO,CAAM,GAgK1B,EAAK,AA7Jf,SAA8B,CAAC,CAAE,CAAQ,CAAE,CAAI,CAAE,CAAK,CAAE,CAAU,EAMhE,IAsKW,EAAS,EAlHhB,EACF,EACA,EAtDE,EAAK,CAAC,EACR,GAmDE,EAAa,IAAI,EAAA,KAAI,CAkHd,EAhHG,CADZ,EAAa,AApDY,EAoDV,KAAK,IACG,OAAO,CAgHZ,EAhHc,EAAW,OAAO,CAAlD,EAiHK,SAAU,CAAC,CAAE,CAAC,CAAE,CAAC,EACtB,IAEI,EACA,EAHA,EAAS,EAAE,IAAI,CAAC,GAChB,EAAS,EAAE,IAAI,CAAC,GAKpB,GADA,EAHU,EAGH,EAAO,KAAK,CAAG,EAClB,EAAA,OAAA,CAAM,EAAQ,YAChB,OAAQ,EAAO,QAAQ,CAAC,WAAW,IACjC,IAAK,IACH,EAAQ,CAAC,EAAO,KAAK,CAAG,EACxB,KACF,KAAK,IACH,EAAQ,EAAO,KAAK,CAAG,CAE3B,CAWF,GATI,GACF,CAAA,GAAO,AAxLmC,EAwLtB,EAAQ,CAAC,CAD/B,EAGA,EAAQ,EAKR,GAHQ,CAAA,EAAO,KAAK,CAAG,EAAU,CAAA,EAAW,EACpC,AAAA,CAAA,EAAO,KAAK,CAAG,EAAU,CAAA,EAAW,EAErC,EAAO,KAAK,CAAG,EAClB,EAAA,OAAA,CAAM,EAAQ,YAChB,OAAQ,EAAO,QAAQ,CAAC,WAAW,IACjC,IAAK,IACH,EAAQ,EAAO,KAAK,CAAG,EACvB,KACF,KAAK,IACH,EAAQ,CAAC,EAAO,KAAK,CAAG,CAE5B,CAOF,OALI,GACF,CAAA,GAAO,AA3MmC,EA2MtB,EAAQ,CAAC,CAD/B,EAGA,EAAQ,EAED,CACT,EAzJA,EAAA,OAAA,CAvD8B,EAuDV,SAAU,CAAK,EACjC,IAAI,EACJ,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,EAC1B,IAAI,EAAQ,AA1DwB,CA0DpB,CAAC,EAAE,CAEnB,GADA,EAAW,OAAO,CAAC,GACf,EAAG,CACL,IAAI,EAAQ,AA7DsB,CA6DlB,CAAC,EAAE,CACjB,EAAU,EAAW,IAAI,CAAC,EAAO,GACnC,EAAW,OAAO,CAAC,EAAO,EAAO,KAAK,GAAG,CAAC,EA/DrB,EA+D8B,EAAG,GAAI,GAAW,GACvE,CACA,EAAI,CACN,EACF,GAEO,GApEL,EAAa,EAAa,aAAe,cAE3C,SAAS,EAAQ,CAAS,CAAE,CAAa,EAIvC,IAHA,IAAI,EAAQ,EAAO,KAAK,GACpB,EAAO,EAAM,GAAG,GAChB,EAAU,CAAC,EACR,GACD,CAAO,CAAC,EAAK,CACf,EAAU,IAEV,CAAO,CAAC,EAAK,CAAG,CAAA,EAChB,EAAM,IAAI,CAAC,GACX,EAAQ,EAAM,MAAM,CAAC,EAAc,KAGrC,EAAO,EAAM,GAAG,EAEpB,CA6BA,OARA,EAlBA,SAAe,CAAI,EACjB,CAAE,CAAC,EAAK,CAAG,EAAO,OAAO,CAAC,GAAM,MAAM,CAAC,SAAU,CAAG,CAAE,CAAC,EACrD,OAAO,KAAK,GAAG,CAAC,EAAK,CAAE,CAAC,EAAE,CAAC,CAAC,CAAG,EAAO,IAAI,CAAC,GAC7C,EAAG,EACL,EAce,EAAO,YAAY,CAAC,IAAI,CAAC,IACxC,EAZA,SAAe,CAAI,EACjB,IAAI,EAAM,EAAO,QAAQ,CAAC,GAAM,MAAM,CAAC,SAAU,CAAG,CAAE,CAAC,EACrD,OAAO,KAAK,GAAG,CAAC,EAAK,CAAE,CAAC,EAAE,CAAC,CAAC,CAAG,EAAO,IAAI,CAAC,GAC7C,EAAG,OAAO,iBAAiB,EAEvB,EAAO,EAAE,IAAI,CAAC,GACd,IAAQ,OAAO,iBAAiB,EAAI,EAAK,UAAU,GAAK,GAC1D,CAAA,CAAE,CAAC,EAAK,CAAG,KAAK,GAAG,CAAC,CAAE,CAAC,EAAK,CAAE,EADhC,CAGF,EAGe,EAAO,UAAU,CAAC,IAAI,CAAC,IAGtC,EAAA,OAAA,CAAU,EAAO,SAAU,CAAC,EAC1B,CAAE,CAAC,EAAE,CAAG,CAAE,CAAC,CAAI,CAAC,EAAE,CAAC,AACrB,GAEO,CACT,EAsGoC,EAAG,EAAkB,EAAM,IAAI,CAAE,EAAM,KAAK,CAAE,AAAU,MAAV,EAC9D,CAAA,MAAV,GACF,CAAA,EAAK,EAAA,OAAA,CAAY,EAAI,SAAU,CAAC,EAC9B,MAAO,CAAC,CACV,EAAA,EAEF,CAAG,CAAC,EAAO,EAAM,CAAG,CACtB,EACF,GAEA,IAAI,EApFG,EAAA,OAAA,CAAQ,EAAA,OAAA,CAoFmC,GApFpB,SAAU,CAAE,EACxC,IAAI,EAAM,OAAO,iBAAiB,CAC9B,EAAM,OAAO,iBAAiB,CASlC,OAPA,EAAA,OAAA,CAAQ,EAAI,SAAU,CAAC,CAAE,CAAC,EACxB,IAAI,EAmID,AApDwC,EAoDtC,IAAI,CAnIgB,GAmIZ,KAAK,CAnIY,EAE9B,EAAM,KAAK,GAAG,CAAC,EAAI,EAAW,GAC9B,EAAM,KAAK,GAAG,CAAC,EAAI,EAAW,EAChC,GAEO,EAAM,CACf,GA0EA,OA/DI,EAAc,EAAA,OAAA,CA8DI,GA7DpB,EAAa,EAAA,OAAA,CAAM,GACnB,EAAa,EAAA,OAAA,CAAM,GAErB,EAAA,OAAA,CAAU,CAAC,IAAK,IAAI,CAAE,SAAU,CAAI,EAClC,EAAA,OAAA,CAAU,CAAC,IAAK,IAAI,CAAE,SAAU,CAAK,EACnC,IAEE,EAFE,EAAY,EAAO,EACrB,EAAK,AAuDM,CAvDH,CAAC,EAAU,CAErB,GAAI,IAqDc,GAnDlB,IAAI,EAAS,EAAA,OAAA,CAAS,GACtB,CAAA,EAAQ,AAAU,MAAV,EAAgB,EAAa,EAAA,OAAA,CAAM,GAAU,EAAa,EAAA,OAAA,CAAM,EAAxE,GAGE,CAAA,AA+CW,CA/CR,CAAC,EAAU,CAAG,EAAA,OAAA,CAAY,EAAI,SAAU,CAAC,EAC1C,OAAO,EAAI,CACb,EAAA,EAEJ,EACF,GAGoB,EAwCA,EAAE,KAAK,GAAG,KAAK,CAvC5B,EAAA,OAAA,CAAY,AAuCJ,EAvCQ,EAAE,CAAE,SAAU,CAAM,CAAE,CAAC,EAC5C,GAAI,EACF,OAAO,AAqCI,CArCD,CAAC,EAAM,WAAW,GAAG,CAAC,EAAE,CAElC,IAAI,EAAK,EAAA,OAAA,CAAS,EAAA,OAAA,CAmCP,EAnCkB,IAC7B,MAAO,AAAC,CAAA,CAAE,CAAC,EAAE,CAAG,CAAE,CAAC,EAAE,AAAF,EAAM,CAE7B,EAiCF,C,G,E,Q,S,C,C,C,E,E,E,O,C,U,I,G,I,E,E,S,E,E,S,E,E,SC9UA,EANA,SAAe,CAAM,CAAE,CAAQ,EAC7B,OAAO,AAAU,MAAV,EACH,EACA,AAAA,CAAA,EAAA,EAAA,OAAM,AAAN,EAAQ,EAAQ,AAAA,CAAA,EAAA,EAAA,OAAW,AAAX,EAAa,GAAW,EAAA,OAAK,CACnD,C","sources":["","node_modules/lodash-es/defaults.js","node_modules/dagre-d3-es/src/dagre/index.js","node_modules/dagre-d3-es/src/dagre/acyclic.js","node_modules/lodash-es/uniqueId.js","node_modules/dagre-d3-es/src/dagre/greedy-fas.js","node_modules/lodash-es/flatten.js","node_modules/lodash-es/map.js","node_modules/lodash-es/_baseMap.js","node_modules/lodash-es/range.js","node_modules/lodash-es/_createRange.js","node_modules/lodash-es/_baseRange.js","node_modules/lodash-es/toFinite.js","node_modules/lodash-es/toNumber.js","node_modules/lodash-es/_baseTrim.js","node_modules/lodash-es/_trimmedEndIndex.js","node_modules/dagre-d3-es/src/dagre/data/list.js","node_modules/dagre-d3-es/src/dagre/layout.js","node_modules/lodash-es/last.js","node_modules/lodash-es/mapValues.js","node_modules/lodash-es/max.js","node_modules/lodash-es/_baseExtremum.js","node_modules/lodash-es/_baseGt.js","node_modules/lodash-es/pick.js","node_modules/lodash-es/_basePick.js","node_modules/lodash-es/_basePickBy.js","node_modules/lodash-es/_baseSet.js","node_modules/lodash-es/_flatRest.js","node_modules/dagre-d3-es/src/dagre/add-border-segments.js","node_modules/dagre-d3-es/src/dagre/util.js","node_modules/lodash-es/min.js","node_modules/lodash-es/_baseLt.js","node_modules/lodash-es/now.js","node_modules/lodash-es/zipObject.js","node_modules/lodash-es/_baseZipObject.js","node_modules/dagre-d3-es/src/dagre/coordinate-system.js","node_modules/dagre-d3-es/src/dagre/normalize.js","node_modules/dagre-d3-es/src/dagre/rank/index.js","node_modules/dagre-d3-es/src/dagre/rank/feasible-tree.js","node_modules/lodash-es/minBy.js","node_modules/dagre-d3-es/src/dagre/rank/util.js","node_modules/dagre-d3-es/src/dagre/rank/network-simplex.js","node_modules/lodash-es/find.js","node_modules/lodash-es/_createFind.js","node_modules/lodash-es/findIndex.js","node_modules/lodash-es/toInteger.js","node_modules/dagre-d3-es/src/graphlib/alg/index.js","node_modules/dagre-d3-es/src/graphlib/alg/components.js","node_modules/dagre-d3-es/src/graphlib/alg/dijkstra.js","node_modules/dagre-d3-es/src/graphlib/data/priority-queue.js","node_modules/dagre-d3-es/src/graphlib/alg/dijkstra-all.js","node_modules/lodash-es/transform.js","node_modules/dagre-d3-es/src/graphlib/alg/find-cycles.js","node_modules/dagre-d3-es/src/graphlib/alg/tarjan.js","node_modules/dagre-d3-es/src/graphlib/alg/floyd-warshall.js","node_modules/dagre-d3-es/src/graphlib/alg/is-acyclic.js","node_modules/dagre-d3-es/src/graphlib/alg/topsort.js","node_modules/lodash-es/size.js","node_modules/lodash-es/isString.js","node_modules/lodash-es/_stringSize.js","node_modules/lodash-es/_asciiSize.js","node_modules/lodash-es/_hasUnicode.js","node_modules/lodash-es/_unicodeSize.js","node_modules/dagre-d3-es/src/graphlib/alg/postorder.js","node_modules/dagre-d3-es/src/graphlib/alg/dfs.js","node_modules/dagre-d3-es/src/graphlib/alg/preorder.js","node_modules/dagre-d3-es/src/graphlib/alg/prim.js","node_modules/dagre-d3-es/src/dagre/nesting-graph.js","node_modules/dagre-d3-es/src/dagre/order/index.js","node_modules/lodash-es/cloneDeep.js","node_modules/dagre-d3-es/src/dagre/order/add-subgraph-constraints.js","node_modules/dagre-d3-es/src/dagre/order/build-layer-graph.js","node_modules/dagre-d3-es/src/dagre/order/cross-count.js","node_modules/lodash-es/sortBy.js","node_modules/lodash-es/_baseOrderBy.js","node_modules/lodash-es/_baseSortBy.js","node_modules/lodash-es/_compareMultiple.js","node_modules/lodash-es/_compareAscending.js","node_modules/dagre-d3-es/src/dagre/order/init-order.js","node_modules/dagre-d3-es/src/dagre/order/sort-subgraph.js","node_modules/dagre-d3-es/src/dagre/order/barycenter.js","node_modules/dagre-d3-es/src/dagre/order/resolve-conflicts.js","node_modules/dagre-d3-es/src/dagre/order/sort.js","node_modules/dagre-d3-es/src/dagre/parent-dummy-chains.js","node_modules/dagre-d3-es/src/dagre/position/index.js","node_modules/lodash-es/forOwn.js","node_modules/dagre-d3-es/src/dagre/position/bk.js","node_modules/lodash-es/forIn.js"],"sourcesContent":["\nfunction $parcel$export(e, n, v, s) {\n Object.defineProperty(e, n, {get: v, set: s, enumerable: true, configurable: true});\n}\n\n var $parcel$global = globalThis;\n var parcelRequire = $parcel$global[\"parcelRequire3bab\"];\nvar parcelRegister = parcelRequire.register;\nparcelRegister(\"bZ3BC\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $8b983041106799ba$export$2e2bcd8739ae039);\n\nvar $exqIp = parcelRequire(\"exqIp\");\n\nvar $lvgV1 = parcelRequire(\"lvgV1\");\n\nvar $fAzJF = parcelRequire(\"fAzJF\");\n\nvar $ceNjR = parcelRequire(\"ceNjR\");\n/** Used for built-in method references. */ var $8b983041106799ba$var$objectProto = Object.prototype;\n/** Used to check objects for own properties. */ var $8b983041106799ba$var$hasOwnProperty = $8b983041106799ba$var$objectProto.hasOwnProperty;\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 */ var $8b983041106799ba$var$defaults = (0, $exqIp.default)(function(object, sources) {\n object = Object(object);\n var index = -1;\n var length = sources.length;\n var guard = length > 2 ? sources[2] : undefined;\n if (guard && (0, $fAzJF.default)(sources[0], sources[1], guard)) length = 1;\n while(++index < length){\n var source = sources[index];\n var props = (0, $ceNjR.default)(source);\n var propsIndex = -1;\n var propsLength = props.length;\n while(++propsIndex < propsLength){\n var key = props[propsIndex];\n var value = object[key];\n if (value === undefined || (0, $lvgV1.default)(value, $8b983041106799ba$var$objectProto[key]) && !$8b983041106799ba$var$hasOwnProperty.call(object, key)) object[key] = source[key];\n }\n }\n return object;\n});\nvar $8b983041106799ba$export$2e2bcd8739ae039 = $8b983041106799ba$var$defaults;\n\n});\n\nparcelRegister(\"hV1gR\", function(module, exports) {\n\n$parcel$export(module.exports, \"layout\", () => (parcelRequire(\"4eF3g\")).layout);\n\nvar $5W7Tz = parcelRequire(\"5W7Tz\");\n\nvar $4eF3g = parcelRequire(\"4eF3g\");\n\nvar $hYbQT = parcelRequire(\"hYbQT\");\n\nvar $5kKE0 = parcelRequire(\"5kKE0\");\n\n});\nparcelRegister(\"5W7Tz\", function(module, exports) {\n\n$parcel$export(module.exports, \"run\", () => $45287e600870bec4$export$889ea624f2cb2c57);\n$parcel$export(module.exports, \"undo\", () => $45287e600870bec4$export$21f930c44940fd98);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $5GUsF = parcelRequire(\"5GUsF\");\n\nvar $2IgCr = parcelRequire(\"2IgCr\");\nfunction $45287e600870bec4$export$889ea624f2cb2c57(g) {\n var fas = g.graph().acyclicer === \"greedy\" ? (0, $2IgCr.greedyFAS)(g, weightFn(g)) : $45287e600870bec4$var$dfsFAS(g);\n $fpekr.default(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, $5GUsF.default(\"rev\"));\n });\n function weightFn(g) {\n return function(e) {\n return g.edge(e).weight;\n };\n }\n}\nfunction $45287e600870bec4$var$dfsFAS(g) {\n var fas = [];\n var stack = {};\n var visited = {};\n function dfs(v) {\n if ($8XLqy.default(visited, v)) return;\n visited[v] = true;\n stack[v] = true;\n $fpekr.default(g.outEdges(v), function(e) {\n if ($8XLqy.default(stack, e.w)) fas.push(e);\n else dfs(e.w);\n });\n delete stack[v];\n }\n $fpekr.default(g.nodes(), dfs);\n return fas;\n}\nfunction $45287e600870bec4$export$21f930c44940fd98(g) {\n $fpekr.default(g.edges(), function(e) {\n var label = g.edge(e);\n if (label.reversed) {\n g.removeEdge(e);\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\n});\nparcelRegister(\"5GUsF\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $424cac0c9e4294df$export$2e2bcd8739ae039);\n\nvar $1fnxW = parcelRequire(\"1fnxW\");\n/** Used to generate unique IDs. */ var $424cac0c9e4294df$var$idCounter = 0;\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 */ function $424cac0c9e4294df$var$uniqueId(prefix) {\n var id = ++$424cac0c9e4294df$var$idCounter;\n return (0, $1fnxW.default)(prefix) + id;\n}\nvar $424cac0c9e4294df$export$2e2bcd8739ae039 = $424cac0c9e4294df$var$uniqueId;\n\n});\n\nparcelRegister(\"2IgCr\", function(module, exports) {\n\n$parcel$export(module.exports, \"greedyFAS\", () => $1f9c95063efba538$export$b96a088aeac42554);\n\nvar $5Oe6X = parcelRequire(\"5Oe6X\");\nvar $0MuaS = parcelRequire(\"0MuaS\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $jJJbn = parcelRequire(\"jJJbn\");\n\nvar $4LkSm = parcelRequire(\"4LkSm\");\n\nvar $dWsTS = parcelRequire(\"dWsTS\");\nvar $1f9c95063efba538$var$DEFAULT_WEIGHT_FN = $5Oe6X.default(1);\nfunction $1f9c95063efba538$export$b96a088aeac42554(g, weightFn) {\n if (g.nodeCount() <= 1) return [];\n var state = $1f9c95063efba538$var$buildState(g, weightFn || $1f9c95063efba538$var$DEFAULT_WEIGHT_FN);\n var results = $1f9c95063efba538$var$doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n // Expand multi-edges\n return $0MuaS.default($3kePu.default(results, function(e) {\n return g.outEdges(e.v, e.w);\n }));\n}\nfunction $1f9c95063efba538$var$doGreedyFAS(g, buckets, zeroIdx) {\n var results = [];\n var sources = buckets[buckets.length - 1];\n var sinks = buckets[0];\n var entry;\n while(g.nodeCount()){\n while(entry = sinks.dequeue())$1f9c95063efba538$var$removeNode(g, buckets, zeroIdx, entry);\n while(entry = sources.dequeue())$1f9c95063efba538$var$removeNode(g, buckets, zeroIdx, entry);\n if (g.nodeCount()) for(var i = buckets.length - 2; i > 0; --i){\n entry = buckets[i].dequeue();\n if (entry) {\n results = results.concat($1f9c95063efba538$var$removeNode(g, buckets, zeroIdx, entry, true));\n break;\n }\n }\n }\n return results;\n}\nfunction $1f9c95063efba538$var$removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n var results = collectPredecessors ? [] : undefined;\n $fpekr.default(g.inEdges(entry.v), function(edge) {\n var weight = g.edge(edge);\n var uEntry = g.node(edge.v);\n if (collectPredecessors) results.push({\n v: edge.v,\n w: edge.w\n });\n uEntry.out -= weight;\n $1f9c95063efba538$var$assignBucket(buckets, zeroIdx, uEntry);\n });\n $fpekr.default(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 $1f9c95063efba538$var$assignBucket(buckets, zeroIdx, wEntry);\n });\n g.removeNode(entry.v);\n return results;\n}\nfunction $1f9c95063efba538$var$buildState(g, weightFn) {\n var fasGraph = new (0, $4LkSm.Graph)();\n var maxIn = 0;\n var maxOut = 0;\n $fpekr.default(g.nodes(), function(v) {\n fasGraph.setNode(v, {\n v: v,\n in: 0,\n 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 $fpekr.default(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 var buckets = $jJJbn.default(maxOut + maxIn + 3).map(function() {\n return new (0, $dWsTS.List)();\n });\n var zeroIdx = maxIn + 1;\n $fpekr.default(fasGraph.nodes(), function(v) {\n $1f9c95063efba538$var$assignBucket(buckets, zeroIdx, fasGraph.node(v));\n });\n return {\n graph: fasGraph,\n buckets: buckets,\n zeroIdx: zeroIdx\n };\n}\nfunction $1f9c95063efba538$var$assignBucket(buckets, zeroIdx, entry) {\n if (!entry.out) buckets[0].enqueue(entry);\n else if (!entry[\"in\"]) buckets[buckets.length - 1].enqueue(entry);\n else buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n}\n\n});\nparcelRegister(\"0MuaS\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $00259c72dfc3e307$export$2e2bcd8739ae039);\n\nvar $kQGD1 = parcelRequire(\"kQGD1\");\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 */ function $00259c72dfc3e307$var$flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? (0, $kQGD1.default)(array, 1) : [];\n}\nvar $00259c72dfc3e307$export$2e2bcd8739ae039 = $00259c72dfc3e307$var$flatten;\n\n});\n\nparcelRegister(\"3kePu\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $26bebe30abf83879$export$2e2bcd8739ae039);\n\nvar $afgje = parcelRequire(\"afgje\");\n\nvar $dKmGr = parcelRequire(\"dKmGr\");\n\nvar $7dWrG = parcelRequire(\"7dWrG\");\n\nvar $hf0C9 = parcelRequire(\"hf0C9\");\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 */ function $26bebe30abf83879$var$map(collection, iteratee) {\n var func = (0, $hf0C9.default)(collection) ? (0, $afgje.default) : (0, $7dWrG.default);\n return func(collection, (0, $dKmGr.default)(iteratee, 3));\n}\nvar $26bebe30abf83879$export$2e2bcd8739ae039 = $26bebe30abf83879$var$map;\n\n});\nparcelRegister(\"7dWrG\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $5427155e39bdb121$export$2e2bcd8739ae039);\n\nvar $irzyZ = parcelRequire(\"irzyZ\");\n\nvar $lAOUf = parcelRequire(\"lAOUf\");\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 */ function $5427155e39bdb121$var$baseMap(collection, iteratee) {\n var index = -1, result = (0, $lAOUf.default)(collection) ? Array(collection.length) : [];\n (0, $irzyZ.default)(collection, function(value, key, collection) {\n result[++index] = iteratee(value, key, collection);\n });\n return result;\n}\nvar $5427155e39bdb121$export$2e2bcd8739ae039 = $5427155e39bdb121$var$baseMap;\n\n});\n\n\nparcelRegister(\"jJJbn\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $e5e5449c5f030dea$export$2e2bcd8739ae039);\n\nvar $aDTIR = parcelRequire(\"aDTIR\");\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 */ var $e5e5449c5f030dea$var$range = (0, $aDTIR.default)();\nvar $e5e5449c5f030dea$export$2e2bcd8739ae039 = $e5e5449c5f030dea$var$range;\n\n});\nparcelRegister(\"aDTIR\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $7bf8c53fe06a5494$export$2e2bcd8739ae039);\n\nvar $HXpAz = parcelRequire(\"HXpAz\");\n\nvar $fAzJF = parcelRequire(\"fAzJF\");\n\nvar $7exj4 = parcelRequire(\"7exj4\");\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 */ function $7bf8c53fe06a5494$var$createRange(fromRight) {\n return function(start, end, step) {\n if (step && typeof step != \"number\" && (0, $fAzJF.default)(start, end, step)) end = step = undefined;\n // Ensure the sign of `-0` is preserved.\n start = (0, $7exj4.default)(start);\n if (end === undefined) {\n end = start;\n start = 0;\n } else end = (0, $7exj4.default)(end);\n step = step === undefined ? start < end ? 1 : -1 : (0, $7exj4.default)(step);\n return (0, $HXpAz.default)(start, end, step, fromRight);\n };\n}\nvar $7bf8c53fe06a5494$export$2e2bcd8739ae039 = $7bf8c53fe06a5494$var$createRange;\n\n});\nparcelRegister(\"HXpAz\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $08421a328cc62c0e$export$2e2bcd8739ae039);\n/* Built-in method references for those with the same name as other `lodash` methods. */ var $08421a328cc62c0e$var$nativeCeil = Math.ceil, $08421a328cc62c0e$var$nativeMax = Math.max;\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 */ function $08421a328cc62c0e$var$baseRange(start, end, step, fromRight) {\n var index = -1, length = $08421a328cc62c0e$var$nativeMax($08421a328cc62c0e$var$nativeCeil((end - start) / (step || 1)), 0), result = Array(length);\n while(length--){\n result[fromRight ? length : ++index] = start;\n start += step;\n }\n return result;\n}\nvar $08421a328cc62c0e$export$2e2bcd8739ae039 = $08421a328cc62c0e$var$baseRange;\n\n});\n\nparcelRegister(\"7exj4\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $5443ad2f6d2956e1$export$2e2bcd8739ae039);\n\nvar $1fkDi = parcelRequire(\"1fkDi\");\n/** Used as references for various `Number` constants. */ var $5443ad2f6d2956e1$var$INFINITY = 1 / 0, $5443ad2f6d2956e1$var$MAX_INTEGER = 1.7976931348623157e+308;\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 */ function $5443ad2f6d2956e1$var$toFinite(value) {\n if (!value) return value === 0 ? value : 0;\n value = (0, $1fkDi.default)(value);\n if (value === $5443ad2f6d2956e1$var$INFINITY || value === -$5443ad2f6d2956e1$var$INFINITY) {\n var sign = value < 0 ? -1 : 1;\n return sign * $5443ad2f6d2956e1$var$MAX_INTEGER;\n }\n return value === value ? value : 0;\n}\nvar $5443ad2f6d2956e1$export$2e2bcd8739ae039 = $5443ad2f6d2956e1$var$toFinite;\n\n});\nparcelRegister(\"1fkDi\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $0e87326299eb9bb7$export$2e2bcd8739ae039);\n\nvar $8N45u = parcelRequire(\"8N45u\");\n\nvar $iYDsF = parcelRequire(\"iYDsF\");\n\nvar $1WN0o = parcelRequire(\"1WN0o\");\n/** Used as references for various `Number` constants. */ var $0e87326299eb9bb7$var$NAN = 0 / 0;\n/** Used to detect bad signed hexadecimal string values. */ var $0e87326299eb9bb7$var$reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n/** Used to detect binary string values. */ var $0e87326299eb9bb7$var$reIsBinary = /^0b[01]+$/i;\n/** Used to detect octal string values. */ var $0e87326299eb9bb7$var$reIsOctal = /^0o[0-7]+$/i;\n/** Built-in method references without a dependency on `root`. */ var $0e87326299eb9bb7$var$freeParseInt = parseInt;\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 */ function $0e87326299eb9bb7$var$toNumber(value) {\n if (typeof value == \"number\") return value;\n if ((0, $1WN0o.default)(value)) return $0e87326299eb9bb7$var$NAN;\n if ((0, $iYDsF.default)(value)) {\n var other = typeof value.valueOf == \"function\" ? value.valueOf() : value;\n value = (0, $iYDsF.default)(other) ? other + \"\" : other;\n }\n if (typeof value != \"string\") return value === 0 ? value : +value;\n value = (0, $8N45u.default)(value);\n var isBinary = $0e87326299eb9bb7$var$reIsBinary.test(value);\n return isBinary || $0e87326299eb9bb7$var$reIsOctal.test(value) ? $0e87326299eb9bb7$var$freeParseInt(value.slice(2), isBinary ? 2 : 8) : $0e87326299eb9bb7$var$reIsBadHex.test(value) ? $0e87326299eb9bb7$var$NAN : +value;\n}\nvar $0e87326299eb9bb7$export$2e2bcd8739ae039 = $0e87326299eb9bb7$var$toNumber;\n\n});\nparcelRegister(\"8N45u\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $66661208b19b5b1b$export$2e2bcd8739ae039);\n\nvar $iu14O = parcelRequire(\"iu14O\");\n/** Used to match leading whitespace. */ var $66661208b19b5b1b$var$reTrimStart = /^\\s+/;\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 */ function $66661208b19b5b1b$var$baseTrim(string) {\n return string ? string.slice(0, (0, $iu14O.default)(string) + 1).replace($66661208b19b5b1b$var$reTrimStart, \"\") : string;\n}\nvar $66661208b19b5b1b$export$2e2bcd8739ae039 = $66661208b19b5b1b$var$baseTrim;\n\n});\nparcelRegister(\"iu14O\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $d74bdd257728cf90$export$2e2bcd8739ae039);\n/** Used to match a single whitespace character. */ var $d74bdd257728cf90$var$reWhitespace = /\\s/;\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 */ function $d74bdd257728cf90$var$trimmedEndIndex(string) {\n var index = string.length;\n while(index-- && $d74bdd257728cf90$var$reWhitespace.test(string.charAt(index)));\n return index;\n}\nvar $d74bdd257728cf90$export$2e2bcd8739ae039 = $d74bdd257728cf90$var$trimmedEndIndex;\n\n});\n\n\n\n\n\n\nparcelRegister(\"dWsTS\", function(module, exports) {\n\n$parcel$export(module.exports, \"List\", () => $a2671c21c143d066$export$54c2e3dc7acea9f5);\n/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */ class $a2671c21c143d066$export$54c2e3dc7acea9f5 {\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 $a2671c21c143d066$var$unlink(entry);\n return entry;\n }\n }\n enqueue(entry) {\n var sentinel = this._sentinel;\n if (entry._prev && entry._next) $a2671c21c143d066$var$unlink(entry);\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, $a2671c21c143d066$var$filterOutLinks));\n curr = curr._prev;\n }\n return \"[\" + strs.join(\", \") + \"]\";\n }\n}\nfunction $a2671c21c143d066$var$unlink(entry) {\n entry._prev._next = entry._next;\n entry._next._prev = entry._prev;\n delete entry._next;\n delete entry._prev;\n}\nfunction $a2671c21c143d066$var$filterOutLinks(k, v) {\n if (k !== \"_next\" && k !== \"_prev\") return v;\n}\n\n});\n\n\n\nparcelRegister(\"4eF3g\", function(module, exports) {\n\n$parcel$export(module.exports, \"layout\", () => $3158503efcc7eabf$export$b3219800bda33a1f);\n\nvar $bZ3BC = parcelRequire(\"bZ3BC\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $ke5ip = parcelRequire(\"ke5ip\");\nvar $hnngZ = parcelRequire(\"hnngZ\");\nvar $jPETu = parcelRequire(\"jPETu\");\nvar $gocXo = parcelRequire(\"gocXo\");\nvar $3mNDi = parcelRequire(\"3mNDi\");\n\nvar $4LkSm = parcelRequire(\"4LkSm\");\n\nvar $dQ1Uz = parcelRequire(\"dQ1Uz\");\n\nvar $1OyGc = parcelRequire(\"1OyGc\");\n\nvar $5W7Tz = parcelRequire(\"5W7Tz\");\n\nvar $hYbQT = parcelRequire(\"hYbQT\");\n\nvar $5kKE0 = parcelRequire(\"5kKE0\");\n\nvar $3EZuT = parcelRequire(\"3EZuT\");\n\nvar $6B9pM = parcelRequire(\"6B9pM\");\n\nvar $52JBL = parcelRequire(\"52JBL\");\n\nvar $2Zs6a = parcelRequire(\"2Zs6a\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\nfunction $3158503efcc7eabf$export$b3219800bda33a1f(g, opts) {\n var time = opts && opts.debugTiming ? $f1L0M.time : $f1L0M.notime;\n time(\"layout\", function() {\n var layoutGraph = time(\" buildLayoutGraph\", function() {\n return $3158503efcc7eabf$var$buildLayoutGraph(g);\n });\n time(\" runLayout\", function() {\n $3158503efcc7eabf$var$runLayout(layoutGraph, time);\n });\n time(\" updateInputGraph\", function() {\n $3158503efcc7eabf$var$updateInputGraph(g, layoutGraph);\n });\n });\n}\nfunction $3158503efcc7eabf$var$runLayout(g, time) {\n time(\" makeSpaceForEdgeLabels\", function() {\n $3158503efcc7eabf$var$makeSpaceForEdgeLabels(g);\n });\n time(\" removeSelfEdges\", function() {\n $3158503efcc7eabf$var$removeSelfEdges(g);\n });\n time(\" acyclic\", function() {\n $5W7Tz.run(g);\n });\n time(\" nestingGraph.run\", function() {\n $3EZuT.run(g);\n });\n time(\" rank\", function() {\n (0, $5kKE0.rank)($f1L0M.asNonCompoundGraph(g));\n });\n time(\" injectEdgeLabelProxies\", function() {\n $3158503efcc7eabf$var$injectEdgeLabelProxies(g);\n });\n time(\" removeEmptyRanks\", function() {\n $f1L0M.removeEmptyRanks(g);\n });\n time(\" nestingGraph.cleanup\", function() {\n $3EZuT.cleanup(g);\n });\n time(\" normalizeRanks\", function() {\n $f1L0M.normalizeRanks(g);\n });\n time(\" assignRankMinMax\", function() {\n $3158503efcc7eabf$var$assignRankMinMax(g);\n });\n time(\" removeEdgeLabelProxies\", function() {\n $3158503efcc7eabf$var$removeEdgeLabelProxies(g);\n });\n time(\" normalize.run\", function() {\n $hYbQT.run(g);\n });\n time(\" parentDummyChains\", function() {\n (0, $52JBL.parentDummyChains)(g);\n });\n time(\" addBorderSegments\", function() {\n (0, $dQ1Uz.addBorderSegments)(g);\n });\n time(\" order\", function() {\n (0, $6B9pM.order)(g);\n });\n time(\" insertSelfEdges\", function() {\n $3158503efcc7eabf$var$insertSelfEdges(g);\n });\n time(\" adjustCoordinateSystem\", function() {\n $1OyGc.adjust(g);\n });\n time(\" position\", function() {\n (0, $2Zs6a.position)(g);\n });\n time(\" positionSelfEdges\", function() {\n $3158503efcc7eabf$var$positionSelfEdges(g);\n });\n time(\" removeBorderNodes\", function() {\n $3158503efcc7eabf$var$removeBorderNodes(g);\n });\n time(\" normalize.undo\", function() {\n $hYbQT.undo(g);\n });\n time(\" fixupEdgeLabelCoords\", function() {\n $3158503efcc7eabf$var$fixupEdgeLabelCoords(g);\n });\n time(\" undoCoordinateSystem\", function() {\n $1OyGc.undo(g);\n });\n time(\" translateGraph\", function() {\n $3158503efcc7eabf$var$translateGraph(g);\n });\n time(\" assignNodeIntersects\", function() {\n $3158503efcc7eabf$var$assignNodeIntersects(g);\n });\n time(\" reversePoints\", function() {\n $3158503efcc7eabf$var$reversePointsForReversedEdges(g);\n });\n time(\" acyclic.undo\", function() {\n $5W7Tz.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 */ function $3158503efcc7eabf$var$updateInputGraph(inputGraph, layoutGraph) {\n $fpekr.default(inputGraph.nodes(), function(v) {\n var inputLabel = inputGraph.node(v);\n var layoutLabel = layoutGraph.node(v);\n if (inputLabel) {\n inputLabel.x = layoutLabel.x;\n inputLabel.y = layoutLabel.y;\n if (layoutGraph.children(v).length) {\n inputLabel.width = layoutLabel.width;\n inputLabel.height = layoutLabel.height;\n }\n }\n });\n $fpekr.default(inputGraph.edges(), function(e) {\n var inputLabel = inputGraph.edge(e);\n var layoutLabel = layoutGraph.edge(e);\n inputLabel.points = layoutLabel.points;\n if ($8XLqy.default(layoutLabel, \"x\")) {\n inputLabel.x = layoutLabel.x;\n inputLabel.y = layoutLabel.y;\n }\n });\n inputGraph.graph().width = layoutGraph.graph().width;\n inputGraph.graph().height = layoutGraph.graph().height;\n}\nvar $3158503efcc7eabf$var$graphNumAttrs = [\n \"nodesep\",\n \"edgesep\",\n \"ranksep\",\n \"marginx\",\n \"marginy\"\n];\nvar $3158503efcc7eabf$var$graphDefaults = {\n ranksep: 50,\n edgesep: 20,\n nodesep: 50,\n rankdir: \"tb\"\n};\nvar $3158503efcc7eabf$var$graphAttrs = [\n \"acyclicer\",\n \"ranker\",\n \"rankdir\",\n \"align\"\n];\nvar $3158503efcc7eabf$var$nodeNumAttrs = [\n \"width\",\n \"height\"\n];\nvar $3158503efcc7eabf$var$nodeDefaults = {\n width: 0,\n height: 0\n};\nvar $3158503efcc7eabf$var$edgeNumAttrs = [\n \"minlen\",\n \"weight\",\n \"width\",\n \"height\",\n \"labeloffset\"\n];\nvar $3158503efcc7eabf$var$edgeDefaults = {\n minlen: 1,\n weight: 1,\n width: 0,\n height: 0,\n labeloffset: 10,\n labelpos: \"r\"\n};\nvar $3158503efcc7eabf$var$edgeAttrs = [\n \"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 */ function $3158503efcc7eabf$var$buildLayoutGraph(inputGraph) {\n var g = new (0, $4LkSm.Graph)({\n multigraph: true,\n compound: true\n });\n var graph = $3158503efcc7eabf$var$canonicalize(inputGraph.graph());\n g.setGraph($gocXo.default({}, $3158503efcc7eabf$var$graphDefaults, $3158503efcc7eabf$var$selectNumberAttrs(graph, $3158503efcc7eabf$var$graphNumAttrs), $3mNDi.default(graph, $3158503efcc7eabf$var$graphAttrs)));\n $fpekr.default(inputGraph.nodes(), function(v) {\n var node = $3158503efcc7eabf$var$canonicalize(inputGraph.node(v));\n g.setNode(v, $bZ3BC.default($3158503efcc7eabf$var$selectNumberAttrs(node, $3158503efcc7eabf$var$nodeNumAttrs), $3158503efcc7eabf$var$nodeDefaults));\n g.setParent(v, inputGraph.parent(v));\n });\n $fpekr.default(inputGraph.edges(), function(e) {\n var edge = $3158503efcc7eabf$var$canonicalize(inputGraph.edge(e));\n g.setEdge(e, $gocXo.default({}, $3158503efcc7eabf$var$edgeDefaults, $3158503efcc7eabf$var$selectNumberAttrs(edge, $3158503efcc7eabf$var$edgeNumAttrs), $3mNDi.default(edge, $3158503efcc7eabf$var$edgeAttrs)));\n });\n return g;\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 */ function $3158503efcc7eabf$var$makeSpaceForEdgeLabels(g) {\n var graph = g.graph();\n graph.ranksep /= 2;\n $fpekr.default(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\") edge.width += edge.labeloffset;\n else edge.height += edge.labeloffset;\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 */ function $3158503efcc7eabf$var$injectEdgeLabelProxies(g) {\n $fpekr.default(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 = {\n rank: (w.rank - v.rank) / 2 + v.rank,\n e: e\n };\n $f1L0M.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n }\n });\n}\nfunction $3158503efcc7eabf$var$assignRankMinMax(g) {\n var maxRank = 0;\n $fpekr.default(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 = $jPETu.default(maxRank, node.maxRank);\n }\n });\n g.graph().maxRank = maxRank;\n}\nfunction $3158503efcc7eabf$var$removeEdgeLabelProxies(g) {\n $fpekr.default(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}\nfunction $3158503efcc7eabf$var$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 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 $fpekr.default(g.nodes(), function(v) {\n getExtremes(g.node(v));\n });\n $fpekr.default(g.edges(), function(e) {\n var edge = g.edge(e);\n if ($8XLqy.default(edge, \"x\")) getExtremes(edge);\n });\n minX -= marginX;\n minY -= marginY;\n $fpekr.default(g.nodes(), function(v) {\n var node = g.node(v);\n node.x -= minX;\n node.y -= minY;\n });\n $fpekr.default(g.edges(), function(e) {\n var edge = g.edge(e);\n $fpekr.default(edge.points, function(p) {\n p.x -= minX;\n p.y -= minY;\n });\n if ($8XLqy.default(edge, \"x\")) edge.x -= minX;\n if ($8XLqy.default(edge, \"y\")) edge.y -= minY;\n });\n graphLabel.width = maxX - minX + marginX;\n graphLabel.height = maxY - minY + marginY;\n}\nfunction $3158503efcc7eabf$var$assignNodeIntersects(g) {\n $fpekr.default(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($f1L0M.intersectRect(nodeV, p1));\n edge.points.push($f1L0M.intersectRect(nodeW, p2));\n });\n}\nfunction $3158503efcc7eabf$var$fixupEdgeLabelCoords(g) {\n $fpekr.default(g.edges(), function(e) {\n var edge = g.edge(e);\n if ($8XLqy.default(edge, \"x\")) {\n if (edge.labelpos === \"l\" || edge.labelpos === \"r\") edge.width -= edge.labeloffset;\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}\nfunction $3158503efcc7eabf$var$reversePointsForReversedEdges(g) {\n $fpekr.default(g.edges(), function(e) {\n var edge = g.edge(e);\n if (edge.reversed) edge.points.reverse();\n });\n}\nfunction $3158503efcc7eabf$var$removeBorderNodes(g) {\n $fpekr.default(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($ke5ip.default(node.borderLeft));\n var r = g.node($ke5ip.default(node.borderRight));\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 $fpekr.default(g.nodes(), function(v) {\n if (g.node(v).dummy === \"border\") g.removeNode(v);\n });\n}\nfunction $3158503efcc7eabf$var$removeSelfEdges(g) {\n $fpekr.default(g.edges(), function(e) {\n if (e.v === e.w) {\n var node = g.node(e.v);\n if (!node.selfEdges) node.selfEdges = [];\n node.selfEdges.push({\n e: e,\n label: g.edge(e)\n });\n g.removeEdge(e);\n }\n });\n}\nfunction $3158503efcc7eabf$var$insertSelfEdges(g) {\n var layers = $f1L0M.buildLayerMatrix(g);\n $fpekr.default(layers, function(layer) {\n var orderShift = 0;\n $fpekr.default(layer, function(v, i) {\n var node = g.node(v);\n node.order = i + orderShift;\n $fpekr.default(node.selfEdges, function(selfEdge) {\n $f1L0M.addDummyNode(g, \"selfedge\", {\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 }, \"_se\");\n });\n delete node.selfEdges;\n });\n });\n}\nfunction $3158503efcc7eabf$var$positionSelfEdges(g) {\n $fpekr.default(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 {\n x: x + 2 * dx / 3,\n y: y - dy\n },\n {\n x: x + 5 * dx / 6,\n y: y - dy\n },\n {\n x: x + dx,\n y: y\n },\n {\n x: x + 5 * dx / 6,\n y: y + dy\n },\n {\n x: x + 2 * dx / 3,\n y: y + dy\n }\n ];\n node.label.x = node.x;\n node.label.y = node.y;\n }\n });\n}\nfunction $3158503efcc7eabf$var$selectNumberAttrs(obj, attrs) {\n return $hnngZ.default($3mNDi.default(obj, attrs), Number);\n}\nfunction $3158503efcc7eabf$var$canonicalize(attrs) {\n var newAttrs = {};\n $fpekr.default(attrs, function(v, k) {\n newAttrs[k.toLowerCase()] = v;\n });\n return newAttrs;\n}\n\n});\nparcelRegister(\"ke5ip\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $eb99391fe11a02ac$export$2e2bcd8739ae039);\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 */ function $eb99391fe11a02ac$var$last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n}\nvar $eb99391fe11a02ac$export$2e2bcd8739ae039 = $eb99391fe11a02ac$var$last;\n\n});\n\nparcelRegister(\"hnngZ\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $ca66a3307a349412$export$2e2bcd8739ae039);\n\nvar $dLTlW = parcelRequire(\"dLTlW\");\n\nvar $by0Fh = parcelRequire(\"by0Fh\");\n\nvar $dKmGr = parcelRequire(\"dKmGr\");\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 */ function $ca66a3307a349412$var$mapValues(object, iteratee) {\n var result = {};\n iteratee = (0, $dKmGr.default)(iteratee, 3);\n (0, $by0Fh.default)(object, function(value, key, object) {\n (0, $dLTlW.default)(result, key, iteratee(value, key, object));\n });\n return result;\n}\nvar $ca66a3307a349412$export$2e2bcd8739ae039 = $ca66a3307a349412$var$mapValues;\n\n});\n\nparcelRegister(\"jPETu\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $e70280743e49d50c$export$2e2bcd8739ae039);\n\nvar $eZV2H = parcelRequire(\"eZV2H\");\n\nvar $gnSnX = parcelRequire(\"gnSnX\");\n\nvar $jSR8v = parcelRequire(\"jSR8v\");\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 */ function $e70280743e49d50c$var$max(array) {\n return array && array.length ? (0, $eZV2H.default)(array, (0, $jSR8v.default), (0, $gnSnX.default)) : undefined;\n}\nvar $e70280743e49d50c$export$2e2bcd8739ae039 = $e70280743e49d50c$var$max;\n\n});\nparcelRegister(\"eZV2H\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $aeb302a85511f1a9$export$2e2bcd8739ae039);\n\nvar $1WN0o = parcelRequire(\"1WN0o\");\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 */ function $aeb302a85511f1a9$var$baseExtremum(array, iteratee, comparator) {\n var index = -1, length = array.length;\n while(++index < length){\n var value = array[index], current = iteratee(value);\n if (current != null && (computed === undefined ? current === current && !(0, $1WN0o.default)(current) : comparator(current, computed))) var computed = current, result = value;\n }\n return result;\n}\nvar $aeb302a85511f1a9$export$2e2bcd8739ae039 = $aeb302a85511f1a9$var$baseExtremum;\n\n});\n\nparcelRegister(\"gnSnX\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $bed8fb20d4c2db18$export$2e2bcd8739ae039);\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 */ function $bed8fb20d4c2db18$var$baseGt(value, other) {\n return value > other;\n}\nvar $bed8fb20d4c2db18$export$2e2bcd8739ae039 = $bed8fb20d4c2db18$var$baseGt;\n\n});\n\n\nparcelRegister(\"3mNDi\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $2739ed381fef7da3$export$2e2bcd8739ae039);\n\nvar $5bi5n = parcelRequire(\"5bi5n\");\n\nvar $1GImM = parcelRequire(\"1GImM\");\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 */ var $2739ed381fef7da3$var$pick = (0, $1GImM.default)(function(object, paths) {\n return object == null ? {} : (0, $5bi5n.default)(object, paths);\n});\nvar $2739ed381fef7da3$export$2e2bcd8739ae039 = $2739ed381fef7da3$var$pick;\n\n});\nparcelRegister(\"5bi5n\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $3c5c0241c32418e2$export$2e2bcd8739ae039);\n\nvar $VRtgP = parcelRequire(\"VRtgP\");\n\nvar $cMLDw = parcelRequire(\"cMLDw\");\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 */ function $3c5c0241c32418e2$var$basePick(object, paths) {\n return (0, $VRtgP.default)(object, paths, function(value, path) {\n return (0, $cMLDw.default)(object, path);\n });\n}\nvar $3c5c0241c32418e2$export$2e2bcd8739ae039 = $3c5c0241c32418e2$var$basePick;\n\n});\nparcelRegister(\"VRtgP\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $0adecd3b9d26ca68$export$2e2bcd8739ae039);\n\nvar $foHRp = parcelRequire(\"foHRp\");\n\nvar $izsU2 = parcelRequire(\"izsU2\");\n\nvar $dUJCp = parcelRequire(\"dUJCp\");\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 */ function $0adecd3b9d26ca68$var$basePickBy(object, paths, predicate) {\n var index = -1, length = paths.length, result = {};\n while(++index < length){\n var path = paths[index], value = (0, $foHRp.default)(object, path);\n if (predicate(value, path)) (0, $izsU2.default)(result, (0, $dUJCp.default)(path, object), value);\n }\n return result;\n}\nvar $0adecd3b9d26ca68$export$2e2bcd8739ae039 = $0adecd3b9d26ca68$var$basePickBy;\n\n});\nparcelRegister(\"izsU2\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $d851ea62f3bb6942$export$2e2bcd8739ae039);\n\nvar $a6l6i = parcelRequire(\"a6l6i\");\n\nvar $dUJCp = parcelRequire(\"dUJCp\");\n\nvar $cBYZY = parcelRequire(\"cBYZY\");\n\nvar $iYDsF = parcelRequire(\"iYDsF\");\n\nvar $ft2bY = parcelRequire(\"ft2bY\");\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 */ function $d851ea62f3bb6942$var$baseSet(object, path, value, customizer) {\n if (!(0, $iYDsF.default)(object)) return object;\n path = (0, $dUJCp.default)(path, object);\n var index = -1, length = path.length, lastIndex = length - 1, nested = object;\n while(nested != null && ++index < length){\n var key = (0, $ft2bY.default)(path[index]), newValue = value;\n if (key === \"__proto__\" || key === \"constructor\" || key === \"prototype\") return object;\n if (index != lastIndex) {\n var objValue = nested[key];\n newValue = customizer ? customizer(objValue, key, nested) : undefined;\n if (newValue === undefined) newValue = (0, $iYDsF.default)(objValue) ? objValue : (0, $cBYZY.default)(path[index + 1]) ? [] : {};\n }\n (0, $a6l6i.default)(nested, key, newValue);\n nested = nested[key];\n }\n return object;\n}\nvar $d851ea62f3bb6942$export$2e2bcd8739ae039 = $d851ea62f3bb6942$var$baseSet;\n\n});\n\n\n\nparcelRegister(\"1GImM\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $13ac20f2e48b583b$export$2e2bcd8739ae039);\n\nvar $0MuaS = parcelRequire(\"0MuaS\");\n\nvar $dQSON = parcelRequire(\"dQSON\");\n\nvar $3CD6d = parcelRequire(\"3CD6d\");\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 */ function $13ac20f2e48b583b$var$flatRest(func) {\n return (0, $3CD6d.default)((0, $dQSON.default)(func, undefined, (0, $0MuaS.default)), func + \"\");\n}\nvar $13ac20f2e48b583b$export$2e2bcd8739ae039 = $13ac20f2e48b583b$var$flatRest;\n\n});\n\n\nparcelRegister(\"dQ1Uz\", function(module, exports) {\n\n$parcel$export(module.exports, \"addBorderSegments\", () => $a1319d4066c504fa$export$9a52541ba49edb51);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\nfunction $a1319d4066c504fa$export$9a52541ba49edb51(g) {\n function dfs(v) {\n var children = g.children(v);\n var node = g.node(v);\n if (children.length) $fpekr.default(children, dfs);\n if ($8XLqy.default(node, \"minRank\")) {\n node.borderLeft = [];\n node.borderRight = [];\n for(var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank){\n $a1319d4066c504fa$var$addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n $a1319d4066c504fa$var$addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n }\n }\n }\n $fpekr.default(g.children(), dfs);\n}\nfunction $a1319d4066c504fa$var$addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n var label = {\n width: 0,\n height: 0,\n rank: rank,\n borderType: prop\n };\n var prev = sgNode[prop][rank - 1];\n var curr = $f1L0M.addDummyNode(g, \"border\", label, prefix);\n sgNode[prop][rank] = curr;\n g.setParent(curr, sg);\n if (prev) g.setEdge(prev, curr, {\n weight: 1\n });\n}\n\n});\nparcelRegister(\"f1L0M\", function(module, exports) {\n\n$parcel$export(module.exports, \"addDummyNode\", () => $af0b6a829cfb7836$export$ecf34c2268abf7a0);\n$parcel$export(module.exports, \"simplify\", () => $af0b6a829cfb7836$export$798b53621063651);\n$parcel$export(module.exports, \"asNonCompoundGraph\", () => $af0b6a829cfb7836$export$556dc3686e4a2bd5);\n$parcel$export(module.exports, \"intersectRect\", () => $af0b6a829cfb7836$export$4a227323f5de0b79);\n$parcel$export(module.exports, \"buildLayerMatrix\", () => $af0b6a829cfb7836$export$aca89c9d4c6bb8ae);\n$parcel$export(module.exports, \"normalizeRanks\", () => $af0b6a829cfb7836$export$5747adf39cbd8007);\n$parcel$export(module.exports, \"removeEmptyRanks\", () => $af0b6a829cfb7836$export$45a0c732a9a44b01);\n$parcel$export(module.exports, \"addBorderNode\", () => $af0b6a829cfb7836$export$6589834e22e3d497);\n$parcel$export(module.exports, \"maxRank\", () => $af0b6a829cfb7836$export$978bfc7f0ad7d28e);\n$parcel$export(module.exports, \"partition\", () => $af0b6a829cfb7836$export$b29f828819edca8d);\n$parcel$export(module.exports, \"time\", () => $af0b6a829cfb7836$export$2da9be4cfdb689b1);\n$parcel$export(module.exports, \"notime\", () => $af0b6a829cfb7836$export$7f2cf532350145c2);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $1G4S6 = parcelRequire(\"1G4S6\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $jPETu = parcelRequire(\"jPETu\");\nvar $j8eVr = parcelRequire(\"j8eVr\");\nvar $2OtHx = parcelRequire(\"2OtHx\");\nvar $jJJbn = parcelRequire(\"jJJbn\");\nvar $5GUsF = parcelRequire(\"5GUsF\");\nvar $cOIXs = parcelRequire(\"cOIXs\");\n\nvar $4LkSm = parcelRequire(\"4LkSm\");\n/*\n * Adds a dummy node to the graph and return v.\n */ function $af0b6a829cfb7836$export$ecf34c2268abf7a0(g, type, attrs, name) {\n var v;\n do v = $5GUsF.default(name);\n while (g.hasNode(v));\n attrs.dummy = type;\n g.setNode(v, attrs);\n return v;\n}\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */ function $af0b6a829cfb7836$export$798b53621063651(g) {\n var simplified = new (0, $4LkSm.Graph)().setGraph(g.graph());\n $fpekr.default(g.nodes(), function(v) {\n simplified.setNode(v, g.node(v));\n });\n $fpekr.default(g.edges(), function(e) {\n var simpleLabel = simplified.edge(e.v, e.w) || {\n weight: 0,\n minlen: 1\n };\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}\nfunction $af0b6a829cfb7836$export$556dc3686e4a2bd5(g) {\n var simplified = new (0, $4LkSm.Graph)({\n multigraph: g.isMultigraph()\n }).setGraph(g.graph());\n $fpekr.default(g.nodes(), function(v) {\n if (!g.children(v).length) simplified.setNode(v, g.node(v));\n });\n $fpekr.default(g.edges(), function(e) {\n simplified.setEdge(e, g.edge(e));\n });\n return simplified;\n}\nfunction $af0b6a829cfb7836$export$c5a5d928abe0f9b5(g) {\n var weightMap = $3kePu.default(g.nodes(), function(v) {\n var sucs = {};\n $fpekr.default(g.outEdges(v), function(e) {\n sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n });\n return sucs;\n });\n return $cOIXs.default(g.nodes(), weightMap);\n}\nfunction $af0b6a829cfb7836$export$26130937b5f6ca22(g) {\n var weightMap = $3kePu.default(g.nodes(), function(v) {\n var preds = {};\n $fpekr.default(g.inEdges(v), function(e) {\n preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n });\n return preds;\n });\n return $cOIXs.default(g.nodes(), weightMap);\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 */ function $af0b6a829cfb7836$export$4a227323f5de0b79(rect, point) {\n var x = rect.x;\n var y = rect.y;\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 if (!dx && !dy) throw new Error(\"Not possible to find intersection inside of the rectangle\");\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) h = -h;\n sx = h * dx / dy;\n sy = h;\n } else {\n // Intersection is left or right of rect.\n if (dx < 0) w = -w;\n sx = w;\n sy = w * dy / dx;\n }\n return {\n x: x + sx,\n 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 */ function $af0b6a829cfb7836$export$aca89c9d4c6bb8ae(g) {\n var layering = $3kePu.default($jJJbn.default($af0b6a829cfb7836$export$978bfc7f0ad7d28e(g) + 1), function() {\n return [];\n });\n $fpekr.default(g.nodes(), function(v) {\n var node = g.node(v);\n var rank = node.rank;\n if (!$1G4S6.default(rank)) layering[rank][node.order] = v;\n });\n return layering;\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 */ function $af0b6a829cfb7836$export$5747adf39cbd8007(g) {\n var min = $j8eVr.default($3kePu.default(g.nodes(), function(v) {\n return g.node(v).rank;\n }));\n $fpekr.default(g.nodes(), function(v) {\n var node = g.node(v);\n if ($8XLqy.default(node, \"rank\")) node.rank -= min;\n });\n}\nfunction $af0b6a829cfb7836$export$45a0c732a9a44b01(g) {\n // Ranks may not start at 0, so we need to offset them\n var offset = $j8eVr.default($3kePu.default(g.nodes(), function(v) {\n return g.node(v).rank;\n }));\n var layers = [];\n $fpekr.default(g.nodes(), function(v) {\n var rank = g.node(v).rank - offset;\n if (!layers[rank]) layers[rank] = [];\n layers[rank].push(v);\n });\n var delta = 0;\n var nodeRankFactor = g.graph().nodeRankFactor;\n $fpekr.default(layers, function(vs, i) {\n if ($1G4S6.default(vs) && i % nodeRankFactor !== 0) --delta;\n else if (delta) $fpekr.default(vs, function(v) {\n g.node(v).rank += delta;\n });\n });\n}\nfunction $af0b6a829cfb7836$export$6589834e22e3d497(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 $af0b6a829cfb7836$export$ecf34c2268abf7a0(g, \"border\", node, prefix);\n}\nfunction $af0b6a829cfb7836$export$978bfc7f0ad7d28e(g) {\n return $jPETu.default($3kePu.default(g.nodes(), function(v) {\n var rank = g.node(v).rank;\n if (!$1G4S6.default(rank)) return rank;\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 */ function $af0b6a829cfb7836$export$b29f828819edca8d(collection, fn) {\n var result = {\n lhs: [],\n rhs: []\n };\n $fpekr.default(collection, function(value) {\n if (fn(value)) result.lhs.push(value);\n else result.rhs.push(value);\n });\n return result;\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 */ function $af0b6a829cfb7836$export$2da9be4cfdb689b1(name, fn) {\n var start = $2OtHx.default();\n try {\n return fn();\n } finally{\n console.log(name + \" time: \" + ($2OtHx.default() - start) + \"ms\");\n }\n}\nfunction $af0b6a829cfb7836$export$7f2cf532350145c2(name, fn) {\n return fn();\n}\n\n});\nparcelRegister(\"j8eVr\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $deda578ace4dc0e8$export$2e2bcd8739ae039);\n\nvar $eZV2H = parcelRequire(\"eZV2H\");\n\nvar $8cZoy = parcelRequire(\"8cZoy\");\n\nvar $jSR8v = parcelRequire(\"jSR8v\");\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 */ function $deda578ace4dc0e8$var$min(array) {\n return array && array.length ? (0, $eZV2H.default)(array, (0, $jSR8v.default), (0, $8cZoy.default)) : undefined;\n}\nvar $deda578ace4dc0e8$export$2e2bcd8739ae039 = $deda578ace4dc0e8$var$min;\n\n});\nparcelRegister(\"8cZoy\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $5f9f118206a36d13$export$2e2bcd8739ae039);\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 */ function $5f9f118206a36d13$var$baseLt(value, other) {\n return value < other;\n}\nvar $5f9f118206a36d13$export$2e2bcd8739ae039 = $5f9f118206a36d13$var$baseLt;\n\n});\n\n\nparcelRegister(\"2OtHx\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $20c74a585cb2c860$export$2e2bcd8739ae039);\n\nvar $2mpFt = parcelRequire(\"2mpFt\");\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 */ var $20c74a585cb2c860$var$now = function() {\n return (0, $2mpFt.default).Date.now();\n};\nvar $20c74a585cb2c860$export$2e2bcd8739ae039 = $20c74a585cb2c860$var$now;\n\n});\n\nparcelRegister(\"cOIXs\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $954d07441109d999$export$2e2bcd8739ae039);\n\nvar $a6l6i = parcelRequire(\"a6l6i\");\n\nvar $vN5jO = parcelRequire(\"vN5jO\");\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 */ function $954d07441109d999$var$zipObject(props, values) {\n return (0, $vN5jO.default)(props || [], values || [], (0, $a6l6i.default));\n}\nvar $954d07441109d999$export$2e2bcd8739ae039 = $954d07441109d999$var$zipObject;\n\n});\nparcelRegister(\"vN5jO\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $05f8f89499e1b848$export$2e2bcd8739ae039);\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 */ function $05f8f89499e1b848$var$baseZipObject(props, values, assignFunc) {\n var index = -1, length = props.length, valsLength = values.length, result = {};\n while(++index < length){\n var value = index < valsLength ? values[index] : undefined;\n assignFunc(result, props[index], value);\n }\n return result;\n}\nvar $05f8f89499e1b848$export$2e2bcd8739ae039 = $05f8f89499e1b848$var$baseZipObject;\n\n});\n\n\n\n\nparcelRegister(\"1OyGc\", function(module, exports) {\n\n$parcel$export(module.exports, \"adjust\", () => $15255ca2b31f4778$export$2c0e788bcc82013);\n$parcel$export(module.exports, \"undo\", () => $15255ca2b31f4778$export$21f930c44940fd98);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nfunction $15255ca2b31f4778$export$2c0e788bcc82013(g) {\n var rankDir = g.graph().rankdir.toLowerCase();\n if (rankDir === \"lr\" || rankDir === \"rl\") $15255ca2b31f4778$var$swapWidthHeight(g);\n}\nfunction $15255ca2b31f4778$export$21f930c44940fd98(g) {\n var rankDir = g.graph().rankdir.toLowerCase();\n if (rankDir === \"bt\" || rankDir === \"rl\") $15255ca2b31f4778$var$reverseY(g);\n if (rankDir === \"lr\" || rankDir === \"rl\") {\n $15255ca2b31f4778$var$swapXY(g);\n $15255ca2b31f4778$var$swapWidthHeight(g);\n }\n}\nfunction $15255ca2b31f4778$var$swapWidthHeight(g) {\n $fpekr.default(g.nodes(), function(v) {\n $15255ca2b31f4778$var$swapWidthHeightOne(g.node(v));\n });\n $fpekr.default(g.edges(), function(e) {\n $15255ca2b31f4778$var$swapWidthHeightOne(g.edge(e));\n });\n}\nfunction $15255ca2b31f4778$var$swapWidthHeightOne(attrs) {\n var w = attrs.width;\n attrs.width = attrs.height;\n attrs.height = w;\n}\nfunction $15255ca2b31f4778$var$reverseY(g) {\n $fpekr.default(g.nodes(), function(v) {\n $15255ca2b31f4778$var$reverseYOne(g.node(v));\n });\n $fpekr.default(g.edges(), function(e) {\n var edge = g.edge(e);\n $fpekr.default(edge.points, $15255ca2b31f4778$var$reverseYOne);\n if ($8XLqy.default(edge, \"y\")) $15255ca2b31f4778$var$reverseYOne(edge);\n });\n}\nfunction $15255ca2b31f4778$var$reverseYOne(attrs) {\n attrs.y = -attrs.y;\n}\nfunction $15255ca2b31f4778$var$swapXY(g) {\n $fpekr.default(g.nodes(), function(v) {\n $15255ca2b31f4778$var$swapXYOne(g.node(v));\n });\n $fpekr.default(g.edges(), function(e) {\n var edge = g.edge(e);\n $fpekr.default(edge.points, $15255ca2b31f4778$var$swapXYOne);\n if ($8XLqy.default(edge, \"x\")) $15255ca2b31f4778$var$swapXYOne(edge);\n });\n}\nfunction $15255ca2b31f4778$var$swapXYOne(attrs) {\n var x = attrs.x;\n attrs.x = attrs.y;\n attrs.y = x;\n}\n\n});\n\nparcelRegister(\"hYbQT\", function(module, exports) {\n\n$parcel$export(module.exports, \"run\", () => $d1513bd9b055ab2b$export$889ea624f2cb2c57);\n$parcel$export(module.exports, \"undo\", () => $d1513bd9b055ab2b$export$21f930c44940fd98);\n\nvar $fpekr = parcelRequire(\"fpekr\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\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 */ function $d1513bd9b055ab2b$export$889ea624f2cb2c57(g) {\n g.graph().dummyChains = [];\n $fpekr.default(g.edges(), function(edge) {\n $d1513bd9b055ab2b$var$normalizeEdge(g, edge);\n });\n}\nfunction $d1513bd9b055ab2b$var$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 if (wRank === vRank + 1) return;\n g.removeEdge(e);\n var dummy, attrs, i;\n for(i = 0, ++vRank; vRank < wRank; ++i, ++vRank){\n edgeLabel.points = [];\n attrs = {\n width: 0,\n height: 0,\n edgeLabel: edgeLabel,\n edgeObj: e,\n rank: vRank\n };\n dummy = $f1L0M.addDummyNode(g, \"edge\", attrs, \"_d\");\n if (vRank === labelRank) {\n attrs.width = edgeLabel.width;\n attrs.height = edgeLabel.height;\n // @ts-expect-error\n attrs.dummy = \"edge-label\";\n // @ts-expect-error\n attrs.labelpos = edgeLabel.labelpos;\n }\n g.setEdge(v, dummy, {\n weight: edgeLabel.weight\n }, name);\n if (i === 0) g.graph().dummyChains.push(dummy);\n v = dummy;\n }\n g.setEdge(v, w, {\n weight: edgeLabel.weight\n }, name);\n}\nfunction $d1513bd9b055ab2b$export$21f930c44940fd98(g) {\n $fpekr.default(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({\n x: node.x,\n y: node.y\n });\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\n});\n\nparcelRegister(\"5kKE0\", function(module, exports) {\n\n$parcel$export(module.exports, \"rank\", () => $3e2300910289dc63$export$fbc8bcd33b574fbc);\n\nvar $9PJbm = parcelRequire(\"9PJbm\");\n\nvar $V5im8 = parcelRequire(\"V5im8\");\n\nvar $3L0R5 = parcelRequire(\"3L0R5\");\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 */ function $3e2300910289dc63$export$fbc8bcd33b574fbc(g) {\n switch(g.graph().ranker){\n case \"network-simplex\":\n $3e2300910289dc63$var$networkSimplexRanker(g);\n break;\n case \"tight-tree\":\n $3e2300910289dc63$var$tightTreeRanker(g);\n break;\n case \"longest-path\":\n $3e2300910289dc63$var$longestPathRanker(g);\n break;\n default:\n $3e2300910289dc63$var$networkSimplexRanker(g);\n }\n}\n// A fast and simple ranker, but results are far from optimal.\nvar $3e2300910289dc63$var$longestPathRanker = (0, $3L0R5.longestPath);\nfunction $3e2300910289dc63$var$tightTreeRanker(g) {\n (0, $3L0R5.longestPath)(g);\n (0, $9PJbm.feasibleTree)(g);\n}\nfunction $3e2300910289dc63$var$networkSimplexRanker(g) {\n (0, $V5im8.networkSimplex)(g);\n}\n\n});\nparcelRegister(\"9PJbm\", function(module, exports) {\n\n$parcel$export(module.exports, \"feasibleTree\", () => $728becbbb3e82c30$export$1d03f990b5f20c77);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $iNbrh = parcelRequire(\"iNbrh\");\n\nvar $4LkSm = parcelRequire(\"4LkSm\");\n\nvar $3L0R5 = parcelRequire(\"3L0R5\");\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 */ function $728becbbb3e82c30$export$1d03f990b5f20c77(g) {\n var t = new (0, $4LkSm.Graph)({\n 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 var edge, delta;\n while($728becbbb3e82c30$var$tightTree(t, g) < size){\n edge = $728becbbb3e82c30$var$findMinSlackEdge(t, g);\n delta = t.hasNode(edge.v) ? (0, $3L0R5.slack)(g, edge) : -(0, $3L0R5.slack)(g, edge);\n $728becbbb3e82c30$var$shiftRanks(t, g, delta);\n }\n return t;\n}\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */ function $728becbbb3e82c30$var$tightTree(t, g) {\n function dfs(v) {\n $fpekr.default(g.nodeEdges(v), function(e) {\n var edgeV = e.v, w = v === edgeV ? e.w : edgeV;\n if (!t.hasNode(w) && !(0, $3L0R5.slack)(g, e)) {\n t.setNode(w, {});\n t.setEdge(v, w, {});\n dfs(w);\n }\n });\n }\n $fpekr.default(t.nodes(), dfs);\n return t.nodeCount();\n}\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */ function $728becbbb3e82c30$var$findMinSlackEdge(t, g) {\n return $iNbrh.default(g.edges(), function(e) {\n if (t.hasNode(e.v) !== t.hasNode(e.w)) return (0, $3L0R5.slack)(g, e);\n });\n}\nfunction $728becbbb3e82c30$var$shiftRanks(t, g, delta) {\n $fpekr.default(t.nodes(), function(v) {\n g.node(v).rank += delta;\n });\n}\n\n});\nparcelRegister(\"iNbrh\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $dae5ad21c0542277$export$2e2bcd8739ae039);\n\nvar $eZV2H = parcelRequire(\"eZV2H\");\n\nvar $dKmGr = parcelRequire(\"dKmGr\");\n\nvar $8cZoy = parcelRequire(\"8cZoy\");\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 */ function $dae5ad21c0542277$var$minBy(array, iteratee) {\n return array && array.length ? (0, $eZV2H.default)(array, (0, $dKmGr.default)(iteratee, 2), (0, $8cZoy.default)) : undefined;\n}\nvar $dae5ad21c0542277$export$2e2bcd8739ae039 = $dae5ad21c0542277$var$minBy;\n\n});\n\nparcelRegister(\"3L0R5\", function(module, exports) {\n\n$parcel$export(module.exports, \"longestPath\", () => $2bc66cb5f642877e$export$cebe150c9dd2da2e);\n$parcel$export(module.exports, \"slack\", () => $2bc66cb5f642877e$export$3748e8b0e9529e9c);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $j8eVr = parcelRequire(\"j8eVr\");\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 */ function $2bc66cb5f642877e$export$cebe150c9dd2da2e(g) {\n var visited = {};\n function dfs(v) {\n var label = g.node(v);\n if ($8XLqy.default(visited, v)) return label.rank;\n visited[v] = true;\n var rank = $j8eVr.default($3kePu.default(g.outEdges(v), function(e) {\n return dfs(e.w) - g.edge(e).minlen;\n }));\n if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n rank === undefined || // return value of _.map([]) for Lodash 4\n rank === null) // return value of _.map([null])\n rank = 0;\n return label.rank = rank;\n }\n $fpekr.default(g.sources(), dfs);\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 */ function $2bc66cb5f642877e$export$3748e8b0e9529e9c(g, e) {\n return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n\n});\n\n\nparcelRegister(\"V5im8\", function(module, exports) {\n\n$parcel$export(module.exports, \"networkSimplex\", () => $0ab96e79c32fe409$export$fb928ed1fa9faa94);\n\nvar $dCscT = parcelRequire(\"dCscT\");\nvar $5ILgR = parcelRequire(\"5ILgR\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $iNbrh = parcelRequire(\"iNbrh\");\nparcelRequire(\"g6xsS\");\nvar $9THt7 = parcelRequire(\"9THt7\");\nvar $2dR5Z = parcelRequire(\"2dR5Z\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\n\nvar $9PJbm = parcelRequire(\"9PJbm\");\n\nvar $3L0R5 = parcelRequire(\"3L0R5\");\n// Expose some internals for testing purposes\n$0ab96e79c32fe409$export$fb928ed1fa9faa94.initLowLimValues = $0ab96e79c32fe409$var$initLowLimValues;\n$0ab96e79c32fe409$export$fb928ed1fa9faa94.initCutValues = $0ab96e79c32fe409$var$initCutValues;\n$0ab96e79c32fe409$export$fb928ed1fa9faa94.calcCutValue = $0ab96e79c32fe409$var$calcCutValue;\n$0ab96e79c32fe409$export$fb928ed1fa9faa94.leaveEdge = $0ab96e79c32fe409$var$leaveEdge;\n$0ab96e79c32fe409$export$fb928ed1fa9faa94.enterEdge = $0ab96e79c32fe409$var$enterEdge;\n$0ab96e79c32fe409$export$fb928ed1fa9faa94.exchangeEdges = $0ab96e79c32fe409$var$exchangeEdges;\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 */ function $0ab96e79c32fe409$export$fb928ed1fa9faa94(g) {\n g = (0, $f1L0M.simplify)(g);\n (0, $3L0R5.longestPath)(g);\n var t = (0, $9PJbm.feasibleTree)(g);\n $0ab96e79c32fe409$var$initLowLimValues(t);\n $0ab96e79c32fe409$var$initCutValues(t, g);\n var e, f;\n while(e = $0ab96e79c32fe409$var$leaveEdge(t)){\n f = $0ab96e79c32fe409$var$enterEdge(t, g, e);\n $0ab96e79c32fe409$var$exchangeEdges(t, g, e, f);\n }\n}\n/*\n * Initializes cut values for all edges in the tree.\n */ function $0ab96e79c32fe409$var$initCutValues(t, g) {\n var vs = $9THt7.postorder(t, t.nodes());\n vs = vs.slice(0, vs.length - 1);\n $fpekr.default(vs, function(v) {\n $0ab96e79c32fe409$var$assignCutValue(t, g, v);\n });\n}\nfunction $0ab96e79c32fe409$var$assignCutValue(t, g, child) {\n var childLab = t.node(child);\n var parent = childLab.parent;\n t.edge(child, parent).cutvalue = $0ab96e79c32fe409$var$calcCutValue(t, g, child);\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 */ function $0ab96e79c32fe409$var$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 if (!graphEdge) {\n childIsTail = false;\n graphEdge = g.edge(parent, child);\n }\n cutValue = graphEdge.weight;\n $fpekr.default(g.nodeEdges(child), function(e) {\n var isOutEdge = e.v === child, other = isOutEdge ? e.w : e.v;\n if (other !== parent) {\n var pointsToHead = isOutEdge === childIsTail, otherWeight = g.edge(e).weight;\n cutValue += pointsToHead ? otherWeight : -otherWeight;\n if ($0ab96e79c32fe409$var$isTreeEdge(t, child, other)) {\n var otherCutValue = t.edge(child, other).cutvalue;\n cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n }\n }\n });\n return cutValue;\n}\nfunction $0ab96e79c32fe409$var$initLowLimValues(tree, root) {\n if (arguments.length < 2) root = tree.nodes()[0];\n $0ab96e79c32fe409$var$dfsAssignLowLim(tree, {}, 1, root);\n}\nfunction $0ab96e79c32fe409$var$dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n var low = nextLim;\n var label = tree.node(v);\n visited[v] = true;\n $fpekr.default(tree.neighbors(v), function(w) {\n if (!$8XLqy.default(visited, w)) nextLim = $0ab96e79c32fe409$var$dfsAssignLowLim(tree, visited, nextLim, w, v);\n });\n label.low = low;\n label.lim = nextLim++;\n if (parent) label.parent = parent;\n else // TODO should be able to remove this when we incrementally update low lim\n delete label.parent;\n return nextLim;\n}\nfunction $0ab96e79c32fe409$var$leaveEdge(tree) {\n return $5ILgR.default(tree.edges(), function(e) {\n return tree.edge(e).cutvalue < 0;\n });\n}\nfunction $0ab96e79c32fe409$var$enterEdge(t, g, edge) {\n var v = edge.v;\n var w = edge.w;\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 var vLabel = t.node(v);\n var wLabel = t.node(w);\n var tailLabel = vLabel;\n var flip = false;\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 var candidates = $dCscT.default(g.edges(), function(edge) {\n return flip === $0ab96e79c32fe409$var$isDescendant(t, t.node(edge.v), tailLabel) && flip !== $0ab96e79c32fe409$var$isDescendant(t, t.node(edge.w), tailLabel);\n });\n return $iNbrh.default(candidates, function(edge) {\n return (0, $3L0R5.slack)(g, edge);\n });\n}\nfunction $0ab96e79c32fe409$var$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 $0ab96e79c32fe409$var$initLowLimValues(t);\n $0ab96e79c32fe409$var$initCutValues(t, g);\n $0ab96e79c32fe409$var$updateRanks(t, g);\n}\nfunction $0ab96e79c32fe409$var$updateRanks(t, g) {\n var root = $5ILgR.default(t.nodes(), function(v) {\n return !g.node(v).parent;\n });\n var vs = $2dR5Z.preorder(t, root);\n vs = vs.slice(1);\n $fpekr.default(vs, function(v) {\n var parent = t.node(v).parent, edge = g.edge(v, parent), flipped = false;\n if (!edge) {\n edge = g.edge(parent, v);\n flipped = true;\n }\n g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n });\n}\n/*\n * Returns true if the edge is in the tree.\n */ function $0ab96e79c32fe409$var$isTreeEdge(tree, u, v) {\n return tree.hasEdge(u, v);\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 */ function $0ab96e79c32fe409$var$isDescendant(tree, vLabel, rootLabel) {\n return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n\n});\nparcelRegister(\"5ILgR\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $42a5bada1896155c$export$2e2bcd8739ae039);\n\nvar $hw3Be = parcelRequire(\"hw3Be\");\n\nvar $f58Tb = parcelRequire(\"f58Tb\");\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 */ var $42a5bada1896155c$var$find = (0, $hw3Be.default)((0, $f58Tb.default));\nvar $42a5bada1896155c$export$2e2bcd8739ae039 = $42a5bada1896155c$var$find;\n\n});\nparcelRegister(\"hw3Be\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $cc08379f7dd918be$export$2e2bcd8739ae039);\n\nvar $dKmGr = parcelRequire(\"dKmGr\");\n\nvar $lAOUf = parcelRequire(\"lAOUf\");\n\nvar $8krEv = parcelRequire(\"8krEv\");\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 */ function $cc08379f7dd918be$var$createFind(findIndexFunc) {\n return function(collection, predicate, fromIndex) {\n var iterable = Object(collection);\n if (!(0, $lAOUf.default)(collection)) {\n var iteratee = (0, $dKmGr.default)(predicate, 3);\n collection = (0, $8krEv.default)(collection);\n predicate = function(key) {\n return iteratee(iterable[key], key, iterable);\n };\n }\n var index = findIndexFunc(collection, predicate, fromIndex);\n return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n };\n}\nvar $cc08379f7dd918be$export$2e2bcd8739ae039 = $cc08379f7dd918be$var$createFind;\n\n});\n\nparcelRegister(\"f58Tb\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $afae37cffa73d900$export$2e2bcd8739ae039);\n\nvar $38tNx = parcelRequire(\"38tNx\");\n\nvar $dKmGr = parcelRequire(\"dKmGr\");\n\nvar $bj7KL = parcelRequire(\"bj7KL\");\n/* Built-in method references for those with the same name as other `lodash` methods. */ var $afae37cffa73d900$var$nativeMax = Math.max;\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 */ function $afae37cffa73d900$var$findIndex(array, predicate, fromIndex) {\n var length = array == null ? 0 : array.length;\n if (!length) return -1;\n var index = fromIndex == null ? 0 : (0, $bj7KL.default)(fromIndex);\n if (index < 0) index = $afae37cffa73d900$var$nativeMax(length + index, 0);\n return (0, $38tNx.default)(array, (0, $dKmGr.default)(predicate, 3), index);\n}\nvar $afae37cffa73d900$export$2e2bcd8739ae039 = $afae37cffa73d900$var$findIndex;\n\n});\nparcelRegister(\"bj7KL\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $83b77baf04e9e448$export$2e2bcd8739ae039);\n\nvar $7exj4 = parcelRequire(\"7exj4\");\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 */ function $83b77baf04e9e448$var$toInteger(value) {\n var result = (0, $7exj4.default)(value), remainder = result % 1;\n return result === result ? remainder ? result - remainder : result : 0;\n}\nvar $83b77baf04e9e448$export$2e2bcd8739ae039 = $83b77baf04e9e448$var$toInteger;\n\n});\n\n\n\nparcelRegister(\"g6xsS\", function(module, exports) {\n\n$parcel$export(module.exports, \"postorder\", () => (parcelRequire(\"9THt7\")).postorder);\n$parcel$export(module.exports, \"preorder\", () => (parcelRequire(\"2dR5Z\")).preorder);\n\nvar $aK11Y = parcelRequire(\"aK11Y\");\n\nvar $gTmJX = parcelRequire(\"gTmJX\");\n\nvar $aQWKj = parcelRequire(\"aQWKj\");\n\nvar $3rgvn = parcelRequire(\"3rgvn\");\n\nvar $fZYvj = parcelRequire(\"fZYvj\");\n\nvar $3G3TF = parcelRequire(\"3G3TF\");\n\nvar $9THt7 = parcelRequire(\"9THt7\");\n\nvar $2dR5Z = parcelRequire(\"2dR5Z\");\n\nvar $kKWb2 = parcelRequire(\"kKWb2\");\n\nvar $lshnt = parcelRequire(\"lshnt\");\n\nvar $1pQA6 = parcelRequire(\"1pQA6\");\n\n});\nparcelRegister(\"aK11Y\", function(module, exports) {\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nfunction $7d1efff666f3d7af$export$9b5ac10f59f76296(g) {\n var visited = {};\n var cmpts = [];\n var cmpt;\n function dfs(v) {\n if ($8XLqy.default(visited, v)) return;\n visited[v] = true;\n cmpt.push(v);\n $fpekr.default(g.successors(v), dfs);\n $fpekr.default(g.predecessors(v), dfs);\n }\n $fpekr.default(g.nodes(), function(v) {\n cmpt = [];\n dfs(v);\n if (cmpt.length) cmpts.push(cmpt);\n });\n return cmpts;\n}\n\n});\n\nparcelRegister(\"gTmJX\", function(module, exports) {\n\n$parcel$export(module.exports, \"dijkstra\", () => $c4c36c1db290d6a3$export$1c27361af35e8f2);\n\nvar $5Oe6X = parcelRequire(\"5Oe6X\");\n\nvar $1DJGF = parcelRequire(\"1DJGF\");\nvar $c4c36c1db290d6a3$var$DEFAULT_WEIGHT_FUNC = $5Oe6X.default(1);\nfunction $c4c36c1db290d6a3$export$1c27361af35e8f2(g, source, weightFn, edgeFn) {\n return $c4c36c1db290d6a3$var$runDijkstra(g, String(source), weightFn || $c4c36c1db290d6a3$var$DEFAULT_WEIGHT_FUNC, edgeFn || function(v) {\n return g.outEdges(v);\n });\n}\nfunction $c4c36c1db290d6a3$var$runDijkstra(g, source, weightFn, edgeFn) {\n var results = {};\n var pq = new (0, $1DJGF.PriorityQueue)();\n var v, vEntry;\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 if (weight < 0) throw new Error(\"dijkstra does not allow negative edge weights. Bad edge: \" + edge + \" Weight: \" + weight);\n if (distance < wEntry.distance) {\n wEntry.distance = distance;\n wEntry.predecessor = v;\n pq.decrease(w, distance);\n }\n };\n g.nodes().forEach(function(v) {\n var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n results[v] = {\n distance: distance\n };\n pq.add(v, distance);\n });\n while(pq.size() > 0){\n v = pq.removeMin();\n vEntry = results[v];\n if (vEntry.distance === Number.POSITIVE_INFINITY) break;\n edgeFn(v).forEach(updateNeighbors);\n }\n return results;\n}\n\n});\nparcelRegister(\"1DJGF\", function(module, exports) {\n\n$parcel$export(module.exports, \"PriorityQueue\", () => $131cdf7fbce3b76c$export$8fbd1ac8e83536df);\n\nvar $8XLqy = parcelRequire(\"8XLqy\");\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */ class $131cdf7fbce3b76c$export$8fbd1ac8e83536df {\n constructor(){\n this._arr = [];\n this._keyIndices = {};\n }\n /**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */ size() {\n return this._arr.length;\n }\n /**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */ keys() {\n return this._arr.map(function(x) {\n return x.key;\n });\n }\n /**\n * Returns `true` if **key** is in the queue and `false` if not.\n */ has(key) {\n return $8XLqy.default(this._keyIndices, key);\n }\n /**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */ priority(key) {\n var index = this._keyIndices[key];\n if (index !== undefined) return this._arr[index].priority;\n }\n /**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */ min() {\n if (this.size() === 0) throw new Error(\"Queue underflow\");\n return this._arr[0].key;\n }\n /**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */ add(key, priority) {\n var keyIndices = this._keyIndices;\n key = String(key);\n if (!$8XLqy.default(keyIndices, key)) {\n var arr = this._arr;\n var index = arr.length;\n keyIndices[key] = index;\n arr.push({\n key: key,\n priority: priority\n });\n this._decrease(index);\n return true;\n }\n return false;\n }\n /**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */ removeMin() {\n this._swap(0, this._arr.length - 1);\n var min = this._arr.pop();\n delete this._keyIndices[min.key];\n this._heapify(0);\n return min.key;\n }\n /**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */ decrease(key, priority) {\n var index = this._keyIndices[key];\n if (priority > this._arr[index].priority) throw new Error(\"New priority is greater than current priority. Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n this._arr[index].priority = priority;\n this._decrease(index);\n }\n _heapify(i) {\n var arr = this._arr;\n var l = 2 * i;\n var r = l + 1;\n var largest = i;\n if (l < arr.length) {\n largest = arr[l].priority < arr[largest].priority ? l : largest;\n if (r < arr.length) largest = arr[r].priority < arr[largest].priority ? r : largest;\n if (largest !== i) {\n this._swap(i, largest);\n this._heapify(largest);\n }\n }\n }\n _decrease(index) {\n var arr = this._arr;\n var priority = arr[index].priority;\n var parent;\n while(index !== 0){\n parent = index >> 1;\n if (arr[parent].priority < priority) break;\n this._swap(index, parent);\n index = parent;\n }\n }\n _swap(i, j) {\n var arr = this._arr;\n var keyIndices = this._keyIndices;\n var origArrI = arr[i];\n var origArrJ = arr[j];\n arr[i] = origArrJ;\n arr[j] = origArrI;\n keyIndices[origArrJ.key] = i;\n keyIndices[origArrI.key] = j;\n }\n}\n\n});\n\n\nparcelRegister(\"aQWKj\", function(module, exports) {\n\nvar $WFTbq = parcelRequire(\"WFTbq\");\n\nvar $gTmJX = parcelRequire(\"gTmJX\");\nfunction $7e6c547427b6281f$export$188e2982c83b73c9(g, weightFunc, edgeFunc) {\n return $WFTbq.default(g.nodes(), function(acc, v) {\n acc[v] = (0, $gTmJX.dijkstra)(g, v, weightFunc, edgeFunc);\n }, {});\n}\n\n});\nparcelRegister(\"WFTbq\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $0b05e9301ac69f0a$export$2e2bcd8739ae039);\n\nvar $iDECW = parcelRequire(\"iDECW\");\n\nvar $kgBRQ = parcelRequire(\"kgBRQ\");\n\nvar $by0Fh = parcelRequire(\"by0Fh\");\n\nvar $dKmGr = parcelRequire(\"dKmGr\");\n\nvar $bzIQZ = parcelRequire(\"bzIQZ\");\n\nvar $hf0C9 = parcelRequire(\"hf0C9\");\n\nvar $f3ZL4 = parcelRequire(\"f3ZL4\");\n\nvar $4VY3C = parcelRequire(\"4VY3C\");\n\nvar $iYDsF = parcelRequire(\"iYDsF\");\n\nvar $cmTeE = parcelRequire(\"cmTeE\");\n/**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.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 * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */ function $0b05e9301ac69f0a$var$transform(object, iteratee, accumulator) {\n var isArr = (0, $hf0C9.default)(object), isArrLike = isArr || (0, $f3ZL4.default)(object) || (0, $cmTeE.default)(object);\n iteratee = (0, $dKmGr.default)(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) accumulator = isArr ? new Ctor : [];\n else if ((0, $iYDsF.default)(object)) accumulator = (0, $4VY3C.default)(Ctor) ? (0, $kgBRQ.default)((0, $bzIQZ.default)(object)) : {};\n else accumulator = {};\n }\n (isArrLike ? (0, $iDECW.default) : (0, $by0Fh.default))(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n}\nvar $0b05e9301ac69f0a$export$2e2bcd8739ae039 = $0b05e9301ac69f0a$var$transform;\n\n});\n\n\nparcelRegister(\"3rgvn\", function(module, exports) {\n\nvar $dCscT = parcelRequire(\"dCscT\");\n\nvar $lshnt = parcelRequire(\"lshnt\");\nfunction $2810b241ce2fb211$export$6385a1c8ba0e03b9(g) {\n return $dCscT.default((0, $lshnt.tarjan)(g), function(cmpt) {\n return cmpt.length > 1 || cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]);\n });\n}\n\n});\nparcelRegister(\"lshnt\", function(module, exports) {\n\n$parcel$export(module.exports, \"tarjan\", () => $f9e9b157625df8b9$export$5f156e41c20211e5);\n\nvar $8XLqy = parcelRequire(\"8XLqy\");\nfunction $f9e9b157625df8b9$export$5f156e41c20211e5(g) {\n var index = 0;\n var stack = [];\n var visited = {}; // node id -> { onStack, lowlink, index }\n var results = [];\n function dfs(v) {\n var entry = visited[v] = {\n onStack: true,\n lowlink: index,\n index: index++\n };\n stack.push(v);\n g.successors(v).forEach(function(w) {\n if (!$8XLqy.default(visited, w)) {\n dfs(w);\n entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n } else if (visited[w].onStack) entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n });\n if (entry.lowlink === entry.index) {\n var cmpt = [];\n var w;\n do {\n w = stack.pop();\n visited[w].onStack = false;\n cmpt.push(w);\n }while (v !== w);\n results.push(cmpt);\n }\n }\n g.nodes().forEach(function(v) {\n if (!$8XLqy.default(visited, v)) dfs(v);\n });\n return results;\n}\n\n});\n\n\nparcelRegister(\"fZYvj\", function(module, exports) {\n\nvar $5Oe6X = parcelRequire(\"5Oe6X\");\nvar $ba5b7c62a3c883fc$var$DEFAULT_WEIGHT_FUNC = $5Oe6X.default(1);\nfunction $ba5b7c62a3c883fc$export$fbbf4bd85aaff6bd(g, weightFn, edgeFn) {\n return $ba5b7c62a3c883fc$var$runFloydWarshall(g, weightFn || $ba5b7c62a3c883fc$var$DEFAULT_WEIGHT_FUNC, edgeFn || function(v) {\n return g.outEdges(v);\n });\n}\nfunction $ba5b7c62a3c883fc$var$runFloydWarshall(g, weightFn, edgeFn) {\n var results = {};\n var nodes = g.nodes();\n nodes.forEach(function(v) {\n results[v] = {};\n results[v][v] = {\n distance: 0\n };\n nodes.forEach(function(w) {\n if (v !== w) results[v][w] = {\n 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] = {\n distance: d,\n 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 return results;\n}\n\n});\n\nparcelRegister(\"3G3TF\", function(module, exports) {\n\nvar $1pQA6 = parcelRequire(\"1pQA6\");\nfunction $2ad8513258b6f2dc$export$d455c45725963ce9(g) {\n try {\n (0, $1pQA6.topsort)(g);\n } catch (e) {\n if (e instanceof (0, $1pQA6.CycleException)) return false;\n throw e;\n }\n return true;\n}\n\n});\nparcelRegister(\"1pQA6\", function(module, exports) {\n\n$parcel$export(module.exports, \"topsort\", () => $1080e9cdf0705b36$export$ddfa0f9cd705ef1d);\n$parcel$export(module.exports, \"CycleException\", () => $1080e9cdf0705b36$export$7dcd3b9aab51459f);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $bW5IJ = parcelRequire(\"bW5IJ\");\n$1080e9cdf0705b36$export$ddfa0f9cd705ef1d.CycleException = $1080e9cdf0705b36$export$7dcd3b9aab51459f;\nfunction $1080e9cdf0705b36$export$ddfa0f9cd705ef1d(g) {\n var visited = {};\n var stack = {};\n var results = [];\n function visit(node) {\n if ($8XLqy.default(stack, node)) throw new $1080e9cdf0705b36$export$7dcd3b9aab51459f();\n if (!$8XLqy.default(visited, node)) {\n stack[node] = true;\n visited[node] = true;\n $fpekr.default(g.predecessors(node), visit);\n delete stack[node];\n results.push(node);\n }\n }\n $fpekr.default(g.sinks(), visit);\n if ($bW5IJ.default(visited) !== g.nodeCount()) throw new $1080e9cdf0705b36$export$7dcd3b9aab51459f();\n return results;\n}\nfunction $1080e9cdf0705b36$export$7dcd3b9aab51459f() {}\n$1080e9cdf0705b36$export$7dcd3b9aab51459f.prototype = new Error(); // must be an instance of Error to pass testing\n\n});\nparcelRegister(\"bW5IJ\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $8b098c6faba091ff$export$2e2bcd8739ae039);\n\nvar $lTyg4 = parcelRequire(\"lTyg4\");\n\nvar $4wkSQ = parcelRequire(\"4wkSQ\");\n\nvar $lAOUf = parcelRequire(\"lAOUf\");\n\nvar $7icKW = parcelRequire(\"7icKW\");\n\nvar $2GC4v = parcelRequire(\"2GC4v\");\n/** `Object#toString` result references. */ var $8b098c6faba091ff$var$mapTag = \"[object Map]\", $8b098c6faba091ff$var$setTag = \"[object Set]\";\n/**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */ function $8b098c6faba091ff$var$size(collection) {\n if (collection == null) return 0;\n if ((0, $lAOUf.default)(collection)) return (0, $7icKW.default)(collection) ? (0, $2GC4v.default)(collection) : collection.length;\n var tag = (0, $4wkSQ.default)(collection);\n if (tag == $8b098c6faba091ff$var$mapTag || tag == $8b098c6faba091ff$var$setTag) return collection.size;\n return (0, $lTyg4.default)(collection).length;\n}\nvar $8b098c6faba091ff$export$2e2bcd8739ae039 = $8b098c6faba091ff$var$size;\n\n});\nparcelRegister(\"7icKW\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $54f41bee1f651fc5$export$2e2bcd8739ae039);\n\nvar $hArsG = parcelRequire(\"hArsG\");\n\nvar $hf0C9 = parcelRequire(\"hf0C9\");\n\nvar $f2iog = parcelRequire(\"f2iog\");\n/** `Object#toString` result references. */ var $54f41bee1f651fc5$var$stringTag = \"[object String]\";\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 */ function $54f41bee1f651fc5$var$isString(value) {\n return typeof value == \"string\" || !(0, $hf0C9.default)(value) && (0, $f2iog.default)(value) && (0, $hArsG.default)(value) == $54f41bee1f651fc5$var$stringTag;\n}\nvar $54f41bee1f651fc5$export$2e2bcd8739ae039 = $54f41bee1f651fc5$var$isString;\n\n});\n\nparcelRegister(\"2GC4v\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $1f4d093e1a7ac82a$export$2e2bcd8739ae039);\n\nvar $j4vlp = parcelRequire(\"j4vlp\");\n\nvar $6MCUi = parcelRequire(\"6MCUi\");\n\nvar $7uinB = parcelRequire(\"7uinB\");\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */ function $1f4d093e1a7ac82a$var$stringSize(string) {\n return (0, $6MCUi.default)(string) ? (0, $7uinB.default)(string) : (0, $j4vlp.default)(string);\n}\nvar $1f4d093e1a7ac82a$export$2e2bcd8739ae039 = $1f4d093e1a7ac82a$var$stringSize;\n\n});\nparcelRegister(\"j4vlp\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $de26b4631f43a8da$export$2e2bcd8739ae039);\n\nvar $7cEkV = parcelRequire(\"7cEkV\");\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 */ var $de26b4631f43a8da$var$asciiSize = (0, $7cEkV.default)(\"length\");\nvar $de26b4631f43a8da$export$2e2bcd8739ae039 = $de26b4631f43a8da$var$asciiSize;\n\n});\n\nparcelRegister(\"6MCUi\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $4f0567e72dd9ce2b$export$2e2bcd8739ae039);\n/** Used to compose unicode character classes. */ var $4f0567e72dd9ce2b$var$rsAstralRange = \"\\ud800-\\udfff\", $4f0567e72dd9ce2b$var$rsComboMarksRange = \"\\\\u0300-\\\\u036f\", $4f0567e72dd9ce2b$var$reComboHalfMarksRange = \"\\\\ufe20-\\\\ufe2f\", $4f0567e72dd9ce2b$var$rsComboSymbolsRange = \"\\\\u20d0-\\\\u20ff\", $4f0567e72dd9ce2b$var$rsComboRange = $4f0567e72dd9ce2b$var$rsComboMarksRange + $4f0567e72dd9ce2b$var$reComboHalfMarksRange + $4f0567e72dd9ce2b$var$rsComboSymbolsRange, $4f0567e72dd9ce2b$var$rsVarRange = \"\\\\ufe0e\\\\ufe0f\";\n/** Used to compose unicode capture groups. */ var $4f0567e72dd9ce2b$var$rsZWJ = \"\\\\u200d\";\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/). */ var $4f0567e72dd9ce2b$var$reHasUnicode = RegExp(\"[\" + $4f0567e72dd9ce2b$var$rsZWJ + $4f0567e72dd9ce2b$var$rsAstralRange + $4f0567e72dd9ce2b$var$rsComboRange + $4f0567e72dd9ce2b$var$rsVarRange + \"]\");\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 */ function $4f0567e72dd9ce2b$var$hasUnicode(string) {\n return $4f0567e72dd9ce2b$var$reHasUnicode.test(string);\n}\nvar $4f0567e72dd9ce2b$export$2e2bcd8739ae039 = $4f0567e72dd9ce2b$var$hasUnicode;\n\n});\n\nparcelRegister(\"7uinB\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $57399790778a3f2c$export$2e2bcd8739ae039);\n/** Used to compose unicode character classes. */ var $57399790778a3f2c$var$rsAstralRange = \"\\ud800-\\udfff\", $57399790778a3f2c$var$rsComboMarksRange = \"\\\\u0300-\\\\u036f\", $57399790778a3f2c$var$reComboHalfMarksRange = \"\\\\ufe20-\\\\ufe2f\", $57399790778a3f2c$var$rsComboSymbolsRange = \"\\\\u20d0-\\\\u20ff\", $57399790778a3f2c$var$rsComboRange = $57399790778a3f2c$var$rsComboMarksRange + $57399790778a3f2c$var$reComboHalfMarksRange + $57399790778a3f2c$var$rsComboSymbolsRange, $57399790778a3f2c$var$rsVarRange = \"\\\\ufe0e\\\\ufe0f\";\n/** Used to compose unicode capture groups. */ var $57399790778a3f2c$var$rsAstral = \"[\" + $57399790778a3f2c$var$rsAstralRange + \"]\", $57399790778a3f2c$var$rsCombo = \"[\" + $57399790778a3f2c$var$rsComboRange + \"]\", $57399790778a3f2c$var$rsFitz = \"\\ud83c[\\udffb-\\udfff]\", $57399790778a3f2c$var$rsModifier = \"(?:\" + $57399790778a3f2c$var$rsCombo + \"|\" + $57399790778a3f2c$var$rsFitz + \")\", $57399790778a3f2c$var$rsNonAstral = \"[^\" + $57399790778a3f2c$var$rsAstralRange + \"]\", $57399790778a3f2c$var$rsRegional = \"(?:\\ud83c[\\udde6-\\uddff]){2}\", $57399790778a3f2c$var$rsSurrPair = \"[\\ud800-\\udbff][\\udc00-\\udfff]\", $57399790778a3f2c$var$rsZWJ = \"\\\\u200d\";\n/** Used to compose unicode regexes. */ var $57399790778a3f2c$var$reOptMod = $57399790778a3f2c$var$rsModifier + \"?\", $57399790778a3f2c$var$rsOptVar = \"[\" + $57399790778a3f2c$var$rsVarRange + \"]?\", $57399790778a3f2c$var$rsOptJoin = \"(?:\" + $57399790778a3f2c$var$rsZWJ + \"(?:\" + [\n $57399790778a3f2c$var$rsNonAstral,\n $57399790778a3f2c$var$rsRegional,\n $57399790778a3f2c$var$rsSurrPair\n].join(\"|\") + \")\" + $57399790778a3f2c$var$rsOptVar + $57399790778a3f2c$var$reOptMod + \")*\", $57399790778a3f2c$var$rsSeq = $57399790778a3f2c$var$rsOptVar + $57399790778a3f2c$var$reOptMod + $57399790778a3f2c$var$rsOptJoin, $57399790778a3f2c$var$rsSymbol = \"(?:\" + [\n $57399790778a3f2c$var$rsNonAstral + $57399790778a3f2c$var$rsCombo + \"?\",\n $57399790778a3f2c$var$rsCombo,\n $57399790778a3f2c$var$rsRegional,\n $57399790778a3f2c$var$rsSurrPair,\n $57399790778a3f2c$var$rsAstral\n].join(\"|\") + \")\";\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */ var $57399790778a3f2c$var$reUnicode = RegExp($57399790778a3f2c$var$rsFitz + \"(?=\" + $57399790778a3f2c$var$rsFitz + \")|\" + $57399790778a3f2c$var$rsSymbol + $57399790778a3f2c$var$rsSeq, \"g\");\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 */ function $57399790778a3f2c$var$unicodeSize(string) {\n var result = $57399790778a3f2c$var$reUnicode.lastIndex = 0;\n while($57399790778a3f2c$var$reUnicode.test(string))++result;\n return result;\n}\nvar $57399790778a3f2c$export$2e2bcd8739ae039 = $57399790778a3f2c$var$unicodeSize;\n\n});\n\n\n\n\n\nparcelRegister(\"9THt7\", function(module, exports) {\n\n$parcel$export(module.exports, \"postorder\", () => $734af81b3dd83e48$export$8d8ae0f94ad35db2);\n\nvar $4O4ag = parcelRequire(\"4O4ag\");\nfunction $734af81b3dd83e48$export$8d8ae0f94ad35db2(g, vs) {\n return (0, $4O4ag.dfs)(g, vs, \"post\");\n}\n\n});\nparcelRegister(\"4O4ag\", function(module, exports) {\n\n$parcel$export(module.exports, \"dfs\", () => $37ff0fecd38a7e49$export$51b654aff22fc5a6);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $hf0C9 = parcelRequire(\"hf0C9\");\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 */ function $37ff0fecd38a7e49$export$51b654aff22fc5a6(g, vs, order) {\n if (!$hf0C9.default(vs)) vs = [\n vs\n ];\n var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n var acc = [];\n var visited = {};\n $fpekr.default(vs, function(v) {\n if (!g.hasNode(v)) throw new Error(\"Graph does not have node: \" + v);\n $37ff0fecd38a7e49$var$doDfs(g, v, order === \"post\", visited, navigation, acc);\n });\n return acc;\n}\nfunction $37ff0fecd38a7e49$var$doDfs(g, v, postorder, visited, navigation, acc) {\n if (!$8XLqy.default(visited, v)) {\n visited[v] = true;\n if (!postorder) acc.push(v);\n $fpekr.default(navigation(v), function(w) {\n $37ff0fecd38a7e49$var$doDfs(g, w, postorder, visited, navigation, acc);\n });\n if (postorder) acc.push(v);\n }\n}\n\n});\n\n\nparcelRegister(\"2dR5Z\", function(module, exports) {\n\n$parcel$export(module.exports, \"preorder\", () => $19e5fb5f9afeebc5$export$48e957eb03fa4375);\n\nvar $4O4ag = parcelRequire(\"4O4ag\");\nfunction $19e5fb5f9afeebc5$export$48e957eb03fa4375(g, vs) {\n return (0, $4O4ag.dfs)(g, vs, \"pre\");\n}\n\n});\n\nparcelRegister(\"kKWb2\", function(module, exports) {\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\n\nvar $1DJGF = parcelRequire(\"1DJGF\");\n\nvar $2rLgF = parcelRequire(\"2rLgF\");\nfunction $f1c53b47605207a3$export$cf7b21533364217c(g, weightFunc) {\n var result = new (0, $2rLgF.Graph)();\n var parents = {};\n var pq = new (0, $1DJGF.PriorityQueue)();\n var v;\n function updateNeighbors(edge) {\n var w = edge.v === v ? edge.w : edge.v;\n var pri = pq.priority(w);\n if (pri !== undefined) {\n var edgeWeight = weightFunc(edge);\n if (edgeWeight < pri) {\n parents[w] = v;\n pq.decrease(w, edgeWeight);\n }\n }\n }\n if (g.nodeCount() === 0) return result;\n $fpekr.default(g.nodes(), function(v) {\n pq.add(v, Number.POSITIVE_INFINITY);\n result.setNode(v);\n });\n // Start from an arbitrary node\n pq.decrease(g.nodes()[0], 0);\n var init = false;\n while(pq.size() > 0){\n v = pq.removeMin();\n if ($8XLqy.default(parents, v)) result.setEdge(v, parents[v]);\n else if (init) throw new Error(\"Input graph is not connected: \" + g);\n else init = true;\n g.nodeEdges(v).forEach(updateNeighbors);\n }\n return result;\n}\n\n});\n\n\n\n\nparcelRegister(\"3EZuT\", function(module, exports) {\n\n$parcel$export(module.exports, \"run\", () => $2aa4cf987bc3158d$export$889ea624f2cb2c57);\n$parcel$export(module.exports, \"cleanup\", () => $2aa4cf987bc3158d$export$de863c629cb9919d);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $jPETu = parcelRequire(\"jPETu\");\nvar $hwphU = parcelRequire(\"hwphU\");\nvar $7pPNr = parcelRequire(\"7pPNr\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\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 */ function $2aa4cf987bc3158d$export$889ea624f2cb2c57(g) {\n var root = $f1L0M.addDummyNode(g, \"root\", {}, \"_root\");\n var depths = $2aa4cf987bc3158d$var$treeDepths(g);\n var height = $jPETu.default($7pPNr.default(depths)) - 1; // Note: depths is an Object not an array\n var nodeSep = 2 * height + 1;\n g.graph().nestingRoot = root;\n // Multiply minlen by nodeSep to align nodes on non-border ranks.\n $fpekr.default(g.edges(), function(e) {\n g.edge(e).minlen *= nodeSep;\n });\n // Calculate a weight that is sufficient to keep subgraphs vertically compact\n var weight = $2aa4cf987bc3158d$var$sumWeights(g) + 1;\n // Create border nodes and link them up\n $fpekr.default(g.children(), function(child) {\n $2aa4cf987bc3158d$var$dfs(g, root, nodeSep, weight, height, depths, child);\n });\n // Save the multiplier for node layers for later removal of empty border\n // layers.\n g.graph().nodeRankFactor = nodeSep;\n}\nfunction $2aa4cf987bc3158d$var$dfs(g, root, nodeSep, weight, height, depths, v) {\n var children = g.children(v);\n if (!children.length) {\n if (v !== root) g.setEdge(root, v, {\n weight: 0,\n minlen: nodeSep\n });\n return;\n }\n var top = $f1L0M.addBorderNode(g, \"_bt\");\n var bottom = $f1L0M.addBorderNode(g, \"_bb\");\n var label = g.node(v);\n g.setParent(top, v);\n label.borderTop = top;\n g.setParent(bottom, v);\n label.borderBottom = bottom;\n $fpekr.default(children, function(child) {\n $2aa4cf987bc3158d$var$dfs(g, root, nodeSep, weight, height, depths, child);\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 g.setEdge(top, childTop, {\n weight: thisWeight,\n minlen: minlen,\n nestingEdge: true\n });\n g.setEdge(childBottom, bottom, {\n weight: thisWeight,\n minlen: minlen,\n nestingEdge: true\n });\n });\n if (!g.parent(v)) g.setEdge(root, top, {\n weight: 0,\n minlen: height + depths[v]\n });\n}\nfunction $2aa4cf987bc3158d$var$treeDepths(g) {\n var depths = {};\n function dfs(v, depth) {\n var children = g.children(v);\n if (children && children.length) $fpekr.default(children, function(child) {\n dfs(child, depth + 1);\n });\n depths[v] = depth;\n }\n $fpekr.default(g.children(), function(v) {\n dfs(v, 1);\n });\n return depths;\n}\nfunction $2aa4cf987bc3158d$var$sumWeights(g) {\n return $hwphU.default(g.edges(), function(acc, e) {\n return acc + g.edge(e).weight;\n }, 0);\n}\nfunction $2aa4cf987bc3158d$export$de863c629cb9919d(g) {\n var graphLabel = g.graph();\n g.removeNode(graphLabel.nestingRoot);\n delete graphLabel.nestingRoot;\n $fpekr.default(g.edges(), function(e) {\n var edge = g.edge(e);\n if (edge.nestingEdge) g.removeEdge(e);\n });\n}\n\n});\n\nparcelRegister(\"6B9pM\", function(module, exports) {\n\n$parcel$export(module.exports, \"order\", () => $4cdd8060e8415f4c$export$aaaeab0fac9a3ccb);\n\nvar $chB0Q = parcelRequire(\"chB0Q\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $jJJbn = parcelRequire(\"jJJbn\");\n\nvar $4LkSm = parcelRequire(\"4LkSm\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\n\nvar $Kq5UN = parcelRequire(\"Kq5UN\");\n\nvar $lmSbe = parcelRequire(\"lmSbe\");\n\nvar $66uKz = parcelRequire(\"66uKz\");\n\nvar $h2A8Y = parcelRequire(\"h2A8Y\");\n\nvar $2sKV1 = parcelRequire(\"2sKV1\");\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 */ function $4cdd8060e8415f4c$export$aaaeab0fac9a3ccb(g) {\n var maxRank = $f1L0M.maxRank(g), downLayerGraphs = $4cdd8060e8415f4c$var$buildLayerGraphs(g, $jJJbn.default(1, maxRank + 1), \"inEdges\"), upLayerGraphs = $4cdd8060e8415f4c$var$buildLayerGraphs(g, $jJJbn.default(maxRank - 1, -1, -1), \"outEdges\");\n var layering = (0, $h2A8Y.initOrder)(g);\n $4cdd8060e8415f4c$var$assignOrder(g, layering);\n var bestCC = Number.POSITIVE_INFINITY, best;\n for(var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest){\n $4cdd8060e8415f4c$var$sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n layering = $f1L0M.buildLayerMatrix(g);\n var cc = (0, $66uKz.crossCount)(g, layering);\n if (cc < bestCC) {\n lastBest = 0;\n best = $chB0Q.default(layering);\n bestCC = cc;\n }\n }\n $4cdd8060e8415f4c$var$assignOrder(g, best);\n}\nfunction $4cdd8060e8415f4c$var$buildLayerGraphs(g, ranks, relationship) {\n return $3kePu.default(ranks, function(rank) {\n return (0, $lmSbe.buildLayerGraph)(g, rank, relationship);\n });\n}\nfunction $4cdd8060e8415f4c$var$sweepLayerGraphs(layerGraphs, biasRight) {\n var cg = new (0, $4LkSm.Graph)();\n $fpekr.default(layerGraphs, function(lg) {\n var root = lg.graph().root;\n var sorted = (0, $2sKV1.sortSubgraph)(lg, root, cg, biasRight);\n $fpekr.default(sorted.vs, function(v, i) {\n lg.node(v).order = i;\n });\n (0, $Kq5UN.addSubgraphConstraints)(lg, cg, sorted.vs);\n });\n}\nfunction $4cdd8060e8415f4c$var$assignOrder(g, layering) {\n $fpekr.default(layering, function(layer) {\n $fpekr.default(layer, function(v, i) {\n g.node(v).order = i;\n });\n });\n}\n\n});\nparcelRegister(\"chB0Q\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $8f13c87c1500733f$export$2e2bcd8739ae039);\n\nvar $gbpSA = parcelRequire(\"gbpSA\");\n/** Used to compose bitmasks for cloning. */ var $8f13c87c1500733f$var$CLONE_DEEP_FLAG = 1, $8f13c87c1500733f$var$CLONE_SYMBOLS_FLAG = 4;\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 */ function $8f13c87c1500733f$var$cloneDeep(value) {\n return (0, $gbpSA.default)(value, $8f13c87c1500733f$var$CLONE_DEEP_FLAG | $8f13c87c1500733f$var$CLONE_SYMBOLS_FLAG);\n}\nvar $8f13c87c1500733f$export$2e2bcd8739ae039 = $8f13c87c1500733f$var$cloneDeep;\n\n});\n\nparcelRegister(\"Kq5UN\", function(module, exports) {\n\n$parcel$export(module.exports, \"addSubgraphConstraints\", () => $08b889cc3a701783$export$def0b5ae5036962c);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nfunction $08b889cc3a701783$export$def0b5ae5036962c(g, cg, vs) {\n var prev = {}, rootPrev;\n $fpekr.default(vs, function(v) {\n var child = g.parent(v), parent, 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 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});\n\nparcelRegister(\"lmSbe\", function(module, exports) {\n\n$parcel$export(module.exports, \"buildLayerGraph\", () => $f8e5ae1d417223a6$export$eeb2d75ed1ad428);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $1G4S6 = parcelRequire(\"1G4S6\");\nvar $5GUsF = parcelRequire(\"5GUsF\");\n\nvar $4LkSm = parcelRequire(\"4LkSm\");\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 */ function $f8e5ae1d417223a6$export$eeb2d75ed1ad428(g, rank, relationship) {\n var root = $f8e5ae1d417223a6$var$createRootNode(g), result = new (0, $4LkSm.Graph)({\n compound: true\n }).setGraph({\n root: root\n }).setDefaultNodeLabel(function(v) {\n return g.node(v);\n });\n $fpekr.default(g.nodes(), function(v) {\n var node = g.node(v), parent = g.parent(v);\n if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n result.setNode(v);\n result.setParent(v, parent || root);\n // This assumes we have only short edges!\n $fpekr.default(g[relationship](v), function(e) {\n var u = e.v === v ? e.w : e.v, edge = result.edge(u, v), weight = !$1G4S6.default(edge) ? edge.weight : 0;\n result.setEdge(u, v, {\n weight: g.edge(e).weight + weight\n });\n });\n if ($8XLqy.default(node, \"minRank\")) result.setNode(v, {\n borderLeft: node.borderLeft[rank],\n borderRight: node.borderRight[rank]\n });\n }\n });\n return result;\n}\nfunction $f8e5ae1d417223a6$var$createRootNode(g) {\n var v;\n while(g.hasNode(v = $5GUsF.default(\"_root\")));\n return v;\n}\n\n});\n\nparcelRegister(\"66uKz\", function(module, exports) {\n\n$parcel$export(module.exports, \"crossCount\", () => $471b27f1b12e0017$export$4487b4ec3754a783);\n\nvar $0MuaS = parcelRequire(\"0MuaS\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $aJn7S = parcelRequire(\"aJn7S\");\nvar $cOIXs = parcelRequire(\"cOIXs\");\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 */ function $471b27f1b12e0017$export$4487b4ec3754a783(g, layering) {\n var cc = 0;\n for(var i = 1; i < layering.length; ++i)cc += $471b27f1b12e0017$var$twoLayerCrossCount(g, layering[i - 1], layering[i]);\n return cc;\n}\nfunction $471b27f1b12e0017$var$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 = $cOIXs.default(southLayer, $3kePu.default(southLayer, function(v, i) {\n return i;\n }));\n var southEntries = $0MuaS.default($3kePu.default(northLayer, function(v) {\n return $aJn7S.default($3kePu.default(g.outEdges(v), function(e) {\n return {\n pos: southPos[e.w],\n weight: g.edge(e).weight\n };\n }), \"pos\");\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 = $3kePu.default(new Array(treeSize), function() {\n return 0;\n });\n // Calculate the weighted crossings\n var cc = 0;\n $fpekr.default(// @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) weightSum += tree[index + 1];\n // @ts-expect-error\n index = index - 1 >> 1;\n tree[index] += entry.weight;\n }\n cc += entry.weight * weightSum;\n }));\n return cc;\n}\n\n});\nparcelRegister(\"aJn7S\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $7d000bb06f6c7a0a$export$2e2bcd8739ae039);\n\nvar $kQGD1 = parcelRequire(\"kQGD1\");\n\nvar $l9F4I = parcelRequire(\"l9F4I\");\n\nvar $exqIp = parcelRequire(\"exqIp\");\n\nvar $fAzJF = parcelRequire(\"fAzJF\");\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 */ var $7d000bb06f6c7a0a$var$sortBy = (0, $exqIp.default)(function(collection, iteratees) {\n if (collection == null) return [];\n var length = iteratees.length;\n if (length > 1 && (0, $fAzJF.default)(collection, iteratees[0], iteratees[1])) iteratees = [];\n else if (length > 2 && (0, $fAzJF.default)(iteratees[0], iteratees[1], iteratees[2])) iteratees = [\n iteratees[0]\n ];\n return (0, $l9F4I.default)(collection, (0, $kQGD1.default)(iteratees, 1), []);\n});\nvar $7d000bb06f6c7a0a$export$2e2bcd8739ae039 = $7d000bb06f6c7a0a$var$sortBy;\n\n});\nparcelRegister(\"l9F4I\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $03f974da62a26b46$export$2e2bcd8739ae039);\n\nvar $afgje = parcelRequire(\"afgje\");\n\nvar $foHRp = parcelRequire(\"foHRp\");\n\nvar $dKmGr = parcelRequire(\"dKmGr\");\n\nvar $7dWrG = parcelRequire(\"7dWrG\");\n\nvar $eJHHQ = parcelRequire(\"eJHHQ\");\n\nvar $hb0cD = parcelRequire(\"hb0cD\");\n\nvar $b9TPS = parcelRequire(\"b9TPS\");\n\nvar $jSR8v = parcelRequire(\"jSR8v\");\n\nvar $hf0C9 = parcelRequire(\"hf0C9\");\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 */ function $03f974da62a26b46$var$baseOrderBy(collection, iteratees, orders) {\n if (iteratees.length) iteratees = (0, $afgje.default)(iteratees, function(iteratee) {\n if ((0, $hf0C9.default)(iteratee)) return function(value) {\n return (0, $foHRp.default)(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n };\n return iteratee;\n });\n else iteratees = [\n (0, $jSR8v.default)\n ];\n var index = -1;\n iteratees = (0, $afgje.default)(iteratees, (0, $hb0cD.default)((0, $dKmGr.default)));\n var result = (0, $7dWrG.default)(collection, function(value, key, collection) {\n var criteria = (0, $afgje.default)(iteratees, function(iteratee) {\n return iteratee(value);\n });\n return {\n \"criteria\": criteria,\n \"index\": ++index,\n \"value\": value\n };\n });\n return (0, $eJHHQ.default)(result, function(object, other) {\n return (0, $b9TPS.default)(object, other, orders);\n });\n}\nvar $03f974da62a26b46$export$2e2bcd8739ae039 = $03f974da62a26b46$var$baseOrderBy;\n\n});\nparcelRegister(\"eJHHQ\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $aba72bca88e8fb79$export$2e2bcd8739ae039);\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 */ function $aba72bca88e8fb79$var$baseSortBy(array, comparer) {\n var length = array.length;\n array.sort(comparer);\n while(length--)array[length] = array[length].value;\n return array;\n}\nvar $aba72bca88e8fb79$export$2e2bcd8739ae039 = $aba72bca88e8fb79$var$baseSortBy;\n\n});\n\nparcelRegister(\"b9TPS\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $81fbd8ca42830c28$export$2e2bcd8739ae039);\n\nvar $6KvMf = parcelRequire(\"6KvMf\");\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 */ function $81fbd8ca42830c28$var$compareMultiple(object, other, orders) {\n var index = -1, objCriteria = object.criteria, othCriteria = other.criteria, length = objCriteria.length, ordersLength = orders.length;\n while(++index < length){\n var result = (0, $6KvMf.default)(objCriteria[index], othCriteria[index]);\n if (result) {\n if (index >= ordersLength) return result;\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}\nvar $81fbd8ca42830c28$export$2e2bcd8739ae039 = $81fbd8ca42830c28$var$compareMultiple;\n\n});\nparcelRegister(\"6KvMf\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $4e9fb044178c3f3f$export$2e2bcd8739ae039);\n\nvar $1WN0o = parcelRequire(\"1WN0o\");\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 */ function $4e9fb044178c3f3f$var$compareAscending(value, other) {\n if (value !== other) {\n var valIsDefined = value !== undefined, valIsNull = value === null, valIsReflexive = value === value, valIsSymbol = (0, $1WN0o.default)(value);\n var othIsDefined = other !== undefined, othIsNull = other === null, othIsReflexive = other === other, othIsSymbol = (0, $1WN0o.default)(other);\n if (!othIsNull && !othIsSymbol && !valIsSymbol && value > other || valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol || valIsNull && othIsDefined && othIsReflexive || !valIsDefined && othIsReflexive || !valIsReflexive) return 1;\n if (!valIsNull && !valIsSymbol && !othIsSymbol && value < other || othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol || othIsNull && valIsDefined && valIsReflexive || !othIsDefined && valIsReflexive || !othIsReflexive) return -1;\n }\n return 0;\n}\nvar $4e9fb044178c3f3f$export$2e2bcd8739ae039 = $4e9fb044178c3f3f$var$compareAscending;\n\n});\n\n\n\n\n\nparcelRegister(\"h2A8Y\", function(module, exports) {\n\n$parcel$export(module.exports, \"initOrder\", () => $c67ea8fa93554a8b$export$a68885affb54ae0d);\n\nvar $dCscT = parcelRequire(\"dCscT\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $jPETu = parcelRequire(\"jPETu\");\nvar $jJJbn = parcelRequire(\"jJJbn\");\nvar $aJn7S = parcelRequire(\"aJn7S\");\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 */ function $c67ea8fa93554a8b$export$a68885affb54ae0d(g) {\n var visited = {};\n var simpleNodes = $dCscT.default(g.nodes(), function(v) {\n return !g.children(v).length;\n });\n var maxRank = $jPETu.default($3kePu.default(simpleNodes, function(v) {\n return g.node(v).rank;\n }));\n var layers = $3kePu.default($jJJbn.default(maxRank + 1), function() {\n return [];\n });\n function dfs(v) {\n if ($8XLqy.default(visited, v)) return;\n visited[v] = true;\n var node = g.node(v);\n layers[node.rank].push(v);\n $fpekr.default(g.successors(v), dfs);\n }\n var orderedVs = $aJn7S.default(simpleNodes, function(v) {\n return g.node(v).rank;\n });\n $fpekr.default(orderedVs, dfs);\n return layers;\n}\n\n});\n\nparcelRegister(\"2sKV1\", function(module, exports) {\n\n$parcel$export(module.exports, \"sortSubgraph\", () => $1cb2975d8a9eba46$export$734a84c77ae2f1e);\n\nvar $dCscT = parcelRequire(\"dCscT\");\nvar $0MuaS = parcelRequire(\"0MuaS\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $1G4S6 = parcelRequire(\"1G4S6\");\n\nvar $5llzi = parcelRequire(\"5llzi\");\n\nvar $foFJO = parcelRequire(\"foFJO\");\n\nvar $JV5Uw = parcelRequire(\"JV5Uw\");\nfunction $1cb2975d8a9eba46$export$734a84c77ae2f1e(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 if (bl) movable = $dCscT.default(movable, function(w) {\n return w !== bl && w !== br;\n });\n var barycenters = (0, $5llzi.barycenter)(g, movable);\n $fpekr.default(barycenters, function(entry) {\n if (g.children(entry.v).length) {\n var subgraphResult = $1cb2975d8a9eba46$export$734a84c77ae2f1e(g, entry.v, cg, biasRight);\n subgraphs[entry.v] = subgraphResult;\n if ($8XLqy.default(subgraphResult, \"barycenter\")) $1cb2975d8a9eba46$var$mergeBarycenters(entry, subgraphResult);\n }\n });\n var entries = (0, $foFJO.resolveConflicts)(barycenters, cg);\n $1cb2975d8a9eba46$var$expandSubgraphs(entries, subgraphs);\n var result = (0, $JV5Uw.sort)(entries, biasRight);\n if (bl) {\n result.vs = $0MuaS.default([\n bl,\n result.vs,\n br\n ]);\n if (g.predecessors(bl).length) {\n var blPred = g.node(g.predecessors(bl)[0]), brPred = g.node(g.predecessors(br)[0]);\n if (!$8XLqy.default(result, \"barycenter\")) {\n result.barycenter = 0;\n result.weight = 0;\n }\n result.barycenter = (result.barycenter * result.weight + blPred.order + brPred.order) / (result.weight + 2);\n result.weight += 2;\n }\n }\n return result;\n}\nfunction $1cb2975d8a9eba46$var$expandSubgraphs(entries, subgraphs) {\n $fpekr.default(entries, function(entry) {\n entry.vs = $0MuaS.default(entry.vs.map(function(v) {\n if (subgraphs[v]) return subgraphs[v].vs;\n return v;\n }));\n });\n}\nfunction $1cb2975d8a9eba46$var$mergeBarycenters(target, other) {\n if (!$1G4S6.default(target.barycenter)) {\n target.barycenter = (target.barycenter * target.weight + other.barycenter * other.weight) / (target.weight + other.weight);\n target.weight += other.weight;\n } else {\n target.barycenter = other.barycenter;\n target.weight = other.weight;\n }\n}\n\n});\nparcelRegister(\"5llzi\", function(module, exports) {\n\n$parcel$export(module.exports, \"barycenter\", () => $3e3fa4ea881c8767$export$d54b347d68b9b5f6);\n\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $hwphU = parcelRequire(\"hwphU\");\nfunction $3e3fa4ea881c8767$export$d54b347d68b9b5f6(g, movable) {\n return $3kePu.default(movable, function(v) {\n var inV = g.inEdges(v);\n if (!inV.length) return {\n v: v\n };\n else {\n var result = $hwphU.default(inV, function(acc, e) {\n var edge = g.edge(e), 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,\n weight: 0\n });\n return {\n v: v,\n barycenter: result.sum / result.weight,\n weight: result.weight\n };\n }\n });\n}\n\n});\n\nparcelRegister(\"foFJO\", function(module, exports) {\n\n$parcel$export(module.exports, \"resolveConflicts\", () => $b3597929e0686675$export$51b8c24513c4c069);\n\nvar $dCscT = parcelRequire(\"dCscT\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $1G4S6 = parcelRequire(\"1G4S6\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $3mNDi = parcelRequire(\"3mNDi\");\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 */ function $b3597929e0686675$export$51b8c24513c4c069(entries, cg) {\n var mappedEntries = {};\n $fpekr.default(entries, function(entry, i) {\n var tmp = mappedEntries[entry.v] = {\n indegree: 0,\n in: [],\n out: [],\n vs: [\n entry.v\n ],\n i: i\n };\n if (!$1G4S6.default(entry.barycenter)) {\n // @ts-expect-error\n tmp.barycenter = entry.barycenter;\n // @ts-expect-error\n tmp.weight = entry.weight;\n }\n });\n $fpekr.default(cg.edges(), function(e) {\n var entryV = mappedEntries[e.v];\n var entryW = mappedEntries[e.w];\n if (!$1G4S6.default(entryV) && !$1G4S6.default(entryW)) {\n entryW.indegree++;\n entryV.out.push(mappedEntries[e.w]);\n }\n });\n var sourceSet = $dCscT.default(mappedEntries, function(entry) {\n // @ts-expect-error\n return !entry.indegree;\n });\n return $b3597929e0686675$var$doResolveConflicts(sourceSet);\n}\nfunction $b3597929e0686675$var$doResolveConflicts(sourceSet) {\n var entries = [];\n function handleIn(vEntry) {\n return function(uEntry) {\n if (uEntry.merged) return;\n if ($1G4S6.default(uEntry.barycenter) || $1G4S6.default(vEntry.barycenter) || uEntry.barycenter >= vEntry.barycenter) $b3597929e0686675$var$mergeEntries(vEntry, uEntry);\n };\n }\n function handleOut(vEntry) {\n return function(wEntry) {\n wEntry[\"in\"].push(vEntry);\n if (--wEntry.indegree === 0) sourceSet.push(wEntry);\n };\n }\n while(sourceSet.length){\n var entry = sourceSet.pop();\n entries.push(entry);\n $fpekr.default(entry[\"in\"].reverse(), handleIn(entry));\n $fpekr.default(entry.out, handleOut(entry));\n }\n return $3kePu.default($dCscT.default(entries, function(entry) {\n return !entry.merged;\n }), function(entry) {\n return $3mNDi.default(entry, [\n \"vs\",\n \"i\",\n \"barycenter\",\n \"weight\"\n ]);\n });\n}\nfunction $b3597929e0686675$var$mergeEntries(target, source) {\n var sum = 0;\n var weight = 0;\n if (target.weight) {\n sum += target.barycenter * target.weight;\n weight += target.weight;\n }\n if (source.weight) {\n sum += source.barycenter * source.weight;\n weight += source.weight;\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\n});\n\nparcelRegister(\"JV5Uw\", function(module, exports) {\n\n$parcel$export(module.exports, \"sort\", () => $08a07dd455ab8f48$export$97db5808d8f88186);\n\nvar $0MuaS = parcelRequire(\"0MuaS\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $ke5ip = parcelRequire(\"ke5ip\");\nvar $aJn7S = parcelRequire(\"aJn7S\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\nfunction $08a07dd455ab8f48$export$97db5808d8f88186(entries, biasRight) {\n var parts = $f1L0M.partition(entries, function(entry) {\n return $8XLqy.default(entry, \"barycenter\");\n });\n var sortable = parts.lhs, unsortable = $aJn7S.default(parts.rhs, function(entry) {\n return -entry.i;\n }), vs = [], sum = 0, weight = 0, vsIndex = 0;\n sortable.sort($08a07dd455ab8f48$var$compareWithBias(!!biasRight));\n vsIndex = $08a07dd455ab8f48$var$consumeUnsortable(vs, unsortable, vsIndex);\n $fpekr.default(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 = $08a07dd455ab8f48$var$consumeUnsortable(vs, unsortable, vsIndex);\n });\n var result = {\n vs: $0MuaS.default(vs)\n };\n if (weight) {\n result.barycenter = sum / weight;\n result.weight = weight;\n }\n return result;\n}\nfunction $08a07dd455ab8f48$var$consumeUnsortable(vs, unsortable, index) {\n var last;\n while(unsortable.length && (last = $ke5ip.default(unsortable)).i <= index){\n unsortable.pop();\n vs.push(last.vs);\n index++;\n }\n return index;\n}\nfunction $08a07dd455ab8f48$var$compareWithBias(bias) {\n return function(entryV, entryW) {\n if (entryV.barycenter < entryW.barycenter) return -1;\n else if (entryV.barycenter > entryW.barycenter) return 1;\n return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n };\n}\n\n});\n\n\n\nparcelRegister(\"52JBL\", function(module, exports) {\n\n$parcel$export(module.exports, \"parentDummyChains\", () => $3ac084799c1612da$export$f30289267ab03372);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nfunction $3ac084799c1612da$export$f30289267ab03372(g) {\n var postorderNums = $3ac084799c1612da$var$postorder(g);\n $fpekr.default(g.graph().dummyChains, function(v) {\n var node = g.node(v);\n var edgeObj = node.edgeObj;\n var pathData = $3ac084799c1612da$var$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 while(v !== edgeObj.w){\n node = g.node(v);\n if (ascending) {\n while((pathV = path[pathIdx]) !== lca && g.node(pathV).maxRank < node.rank)pathIdx++;\n if (pathV === lca) ascending = false;\n }\n if (!ascending) {\n while(pathIdx < path.length - 1 && g.node(pathV = path[pathIdx + 1]).minRank <= node.rank)pathIdx++;\n pathV = path[pathIdx];\n }\n g.setParent(v, pathV);\n v = g.successors(v)[0];\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 $3ac084799c1612da$var$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 // 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 // Traverse from w to LCA\n parent = w;\n while((parent = g.parent(parent)) !== lca)wPath.push(parent);\n return {\n path: vPath.concat(wPath.reverse()),\n lca: lca\n };\n}\nfunction $3ac084799c1612da$var$postorder(g) {\n var result = {};\n var lim = 0;\n function dfs(v) {\n var low = lim;\n $fpekr.default(g.children(v), dfs);\n result[v] = {\n low: low,\n lim: lim++\n };\n }\n $fpekr.default(g.children(), dfs);\n return result;\n}\n\n});\n\nparcelRegister(\"2Zs6a\", function(module, exports) {\n\n$parcel$export(module.exports, \"position\", () => $22d7130df25c1ba9$export$5880b8b5730aff45);\n\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $jqi0W = parcelRequire(\"jqi0W\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $jPETu = parcelRequire(\"jPETu\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\n\nvar $edbDb = parcelRequire(\"edbDb\");\nfunction $22d7130df25c1ba9$export$5880b8b5730aff45(g) {\n g = $f1L0M.asNonCompoundGraph(g);\n $22d7130df25c1ba9$var$positionY(g);\n $jqi0W.default((0, $edbDb.positionX)(g), function(x, v) {\n g.node(v).x = x;\n });\n}\nfunction $22d7130df25c1ba9$var$positionY(g) {\n var layering = $f1L0M.buildLayerMatrix(g);\n var rankSep = g.graph().ranksep;\n var prevY = 0;\n $fpekr.default(layering, function(layer) {\n var maxHeight = $jPETu.default($3kePu.default(layer, function(v) {\n return g.node(v).height;\n }));\n $fpekr.default(layer, function(v) {\n g.node(v).y = prevY + maxHeight / 2;\n });\n prevY += maxHeight + rankSep;\n });\n}\n\n});\nparcelRegister(\"jqi0W\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $e23e6b41153e0f0e$export$2e2bcd8739ae039);\n\nvar $by0Fh = parcelRequire(\"by0Fh\");\n\nvar $lmrTu = parcelRequire(\"lmrTu\");\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 */ function $e23e6b41153e0f0e$var$forOwn(object, iteratee) {\n return object && (0, $by0Fh.default)(object, (0, $lmrTu.default)(iteratee));\n}\nvar $e23e6b41153e0f0e$export$2e2bcd8739ae039 = $e23e6b41153e0f0e$var$forOwn;\n\n});\n\nparcelRegister(\"edbDb\", function(module, exports) {\n\n$parcel$export(module.exports, \"positionX\", () => $a58b4d4563904306$export$ec3af212ec314f01);\n\nvar $5ILgR = parcelRequire(\"5ILgR\");\nvar $fpekr = parcelRequire(\"fpekr\");\nvar $amOD8 = parcelRequire(\"amOD8\");\nvar $8XLqy = parcelRequire(\"8XLqy\");\nvar $ke5ip = parcelRequire(\"ke5ip\");\nvar $3kePu = parcelRequire(\"3kePu\");\nvar $hnngZ = parcelRequire(\"hnngZ\");\nvar $jPETu = parcelRequire(\"jPETu\");\nvar $gocXo = parcelRequire(\"gocXo\");\nvar $j8eVr = parcelRequire(\"j8eVr\");\nvar $iNbrh = parcelRequire(\"iNbrh\");\nvar $jJJbn = parcelRequire(\"jJJbn\");\nvar $hwphU = parcelRequire(\"hwphU\");\nvar $aJn7S = parcelRequire(\"aJn7S\");\nvar $7pPNr = parcelRequire(\"7pPNr\");\n\nvar $4LkSm = parcelRequire(\"4LkSm\");\n\nvar $f1L0M = parcelRequire(\"f1L0M\");\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 */ function $a58b4d4563904306$export$a2336058547dd16b(g, layering) {\n var conflicts = {};\n function visitLayer(prevLayer, layer) {\n var // segment.\n k0 = 0, // Tracks the last node in this layer scanned for crossings with a type-1\n // segment.\n scanPos = 0, prevLayerLength = prevLayer.length, lastNode = $ke5ip.default(layer);\n $fpekr.default(layer, function(v, i) {\n var w = $a58b4d4563904306$var$findOtherInnerSegmentNode(g, v), k1 = w ? g.node(w).order : prevLayerLength;\n if (w || v === lastNode) {\n $fpekr.default(layer.slice(scanPos, i + 1), function(scanNode) {\n $fpekr.default(g.predecessors(scanNode), function(u) {\n var uLabel = g.node(u), uPos = uLabel.order;\n if ((uPos < k0 || k1 < uPos) && !(uLabel.dummy && g.node(scanNode).dummy)) $a58b4d4563904306$export$d6a30e6c78fac74(conflicts, u, scanNode);\n });\n });\n // @ts-expect-error\n scanPos = i + 1;\n k0 = k1;\n }\n });\n return layer;\n }\n $hwphU.default(layering, visitLayer);\n return conflicts;\n}\nfunction $a58b4d4563904306$export$f384d2f2a62cea4b(g, layering) {\n var conflicts = {};\n function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n var v;\n $fpekr.default($jJJbn.default(southPos, southEnd), function(i) {\n v = south[i];\n if (g.node(v).dummy) $fpekr.default(g.predecessors(v), function(u) {\n var uNode = g.node(u);\n if (uNode.dummy && (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) $a58b4d4563904306$export$d6a30e6c78fac74(conflicts, u, v);\n });\n });\n }\n function visitLayer(north, south) {\n var prevNorthPos = -1, nextNorthPos, southPos = 0;\n $fpekr.default(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 return south;\n }\n $hwphU.default(layering, visitLayer);\n return conflicts;\n}\nfunction $a58b4d4563904306$var$findOtherInnerSegmentNode(g, v) {\n if (g.node(v).dummy) return $5ILgR.default(g.predecessors(v), function(u) {\n return g.node(u).dummy;\n });\n}\nfunction $a58b4d4563904306$export$d6a30e6c78fac74(conflicts, v, w) {\n if (v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n var conflictsV = conflicts[v];\n if (!conflictsV) conflicts[v] = conflictsV = {};\n conflictsV[w] = true;\n}\nfunction $a58b4d4563904306$export$76734886d09d2999(conflicts, v, w) {\n if (v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n return $8XLqy.default(conflicts[v], w);\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 */ function $a58b4d4563904306$export$983b95e2e3722091(g, layering, conflicts, neighborFn) {\n var root = {}, align = {}, pos = {};\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 $fpekr.default(layering, function(layer) {\n $fpekr.default(layer, function(v, order) {\n root[v] = v;\n align[v] = v;\n pos[v] = order;\n });\n });\n $fpekr.default(layering, function(layer) {\n var prevIdx = -1;\n $fpekr.default(layer, function(v) {\n var ws = neighborFn(v);\n if (ws.length) {\n ws = $aJn7S.default(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] && !$a58b4d4563904306$export$76734886d09d2999(conflicts, v, w)) {\n align[w] = v;\n align[v] = root[v] = root[w];\n prevIdx = pos[w];\n }\n }\n }\n });\n });\n return {\n root: root,\n align: align\n };\n}\nfunction $a58b4d4563904306$export$40e1a979a22b42db(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 = {}, blockG = $a58b4d4563904306$var$buildBlockGraph(g, layering, root, reverseSep), borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\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]) setXsFunc(elem);\n else {\n visited[elem] = true;\n stack.push(elem);\n stack = stack.concat(nextNodesFunc(elem));\n }\n elem = stack.pop();\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 // 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 var node = g.node(elem);\n if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) xs[elem] = Math.max(xs[elem], min);\n }\n iterate(pass1, blockG.predecessors.bind(blockG));\n iterate(pass2, blockG.successors.bind(blockG));\n // Assign x coordinates to all nodes\n $fpekr.default(align, function(v) {\n xs[v] = xs[root[v]];\n });\n return xs;\n}\nfunction $a58b4d4563904306$var$buildBlockGraph(g, layering, root, reverseSep) {\n var blockGraph = new (0, $4LkSm.Graph)(), graphLabel = g.graph(), sepFn = $a58b4d4563904306$var$sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n $fpekr.default(layering, function(layer) {\n var u;\n $fpekr.default(layer, function(v) {\n var vRoot = root[v];\n blockGraph.setNode(vRoot);\n if (u) {\n var uRoot = root[u], 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 return blockGraph;\n}\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */ function $a58b4d4563904306$export$870d8cbd39818c9(g, xss) {\n return $iNbrh.default($7pPNr.default(xss), function(xs) {\n var max = Number.NEGATIVE_INFINITY;\n var min = Number.POSITIVE_INFINITY;\n $amOD8.default(xs, function(x, v) {\n var halfWidth = $a58b4d4563904306$var$width(g, v) / 2;\n max = Math.max(x + halfWidth, max);\n min = Math.min(x - halfWidth, min);\n });\n return max - min;\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 */ function $a58b4d4563904306$export$68444cc44dca9679(xss, alignTo) {\n var alignToVals = $7pPNr.default(alignTo), alignToMin = $j8eVr.default(alignToVals), alignToMax = $jPETu.default(alignToVals);\n $fpekr.default([\n \"u\",\n \"d\"\n ], function(vert) {\n $fpekr.default([\n \"l\",\n \"r\"\n ], function(horiz) {\n var alignment = vert + horiz, xs = xss[alignment], delta;\n if (xs === alignTo) return;\n var xsVals = $7pPNr.default(xs);\n delta = horiz === \"l\" ? alignToMin - $j8eVr.default(xsVals) : alignToMax - $jPETu.default(xsVals);\n if (delta) xss[alignment] = $hnngZ.default(xs, function(x) {\n return x + delta;\n });\n });\n });\n}\nfunction $a58b4d4563904306$export$13efda6d80c8a88(xss, align) {\n return $hnngZ.default(xss.ul, function(ignore, v) {\n if (align) return xss[align.toLowerCase()][v];\n else {\n var xs = $aJn7S.default($3kePu.default(xss, v));\n return (xs[1] + xs[2]) / 2;\n }\n });\n}\nfunction $a58b4d4563904306$export$ec3af212ec314f01(g) {\n var layering = $f1L0M.buildLayerMatrix(g);\n var conflicts = $gocXo.default($a58b4d4563904306$export$a2336058547dd16b(g, layering), $a58b4d4563904306$export$f384d2f2a62cea4b(g, layering));\n var xss = {};\n var adjustedLayering;\n $fpekr.default([\n \"u\",\n \"d\"\n ], function(vert) {\n adjustedLayering = vert === \"u\" ? layering : $7pPNr.default(layering).reverse();\n $fpekr.default([\n \"l\",\n \"r\"\n ], function(horiz) {\n if (horiz === \"r\") adjustedLayering = $3kePu.default(adjustedLayering, function(inner) {\n return $7pPNr.default(inner).reverse();\n });\n var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n var align = $a58b4d4563904306$export$983b95e2e3722091(g, adjustedLayering, conflicts, neighborFn);\n var xs = $a58b4d4563904306$export$40e1a979a22b42db(g, adjustedLayering, align.root, align.align, horiz === \"r\");\n if (horiz === \"r\") xs = $hnngZ.default(xs, function(x) {\n return -x;\n });\n xss[vert + horiz] = xs;\n });\n });\n var smallestWidth = $a58b4d4563904306$export$870d8cbd39818c9(g, xss);\n $a58b4d4563904306$export$68444cc44dca9679(xss, smallestWidth);\n return $a58b4d4563904306$export$13efda6d80c8a88(xss, g.graph().align);\n}\nfunction $a58b4d4563904306$var$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 sum += vLabel.width / 2;\n if ($8XLqy.default(vLabel, \"labelpos\")) 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 if (delta) sum += reverseSep ? delta : -delta;\n delta = 0;\n sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n sum += wLabel.width / 2;\n if ($8XLqy.default(wLabel, \"labelpos\")) 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 if (delta) sum += reverseSep ? delta : -delta;\n delta = 0;\n return sum;\n };\n}\nfunction $a58b4d4563904306$var$width(g, v) {\n return g.node(v).width;\n}\n\n});\nparcelRegister(\"amOD8\", function(module, exports) {\n\n$parcel$export(module.exports, \"default\", () => $78c33b948be66cbe$export$2e2bcd8739ae039);\n\nvar $RlazS = parcelRequire(\"RlazS\");\n\nvar $lmrTu = parcelRequire(\"lmrTu\");\n\nvar $ceNjR = parcelRequire(\"ceNjR\");\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 */ function $78c33b948be66cbe$var$forIn(object, iteratee) {\n return object == null ? object : (0, $RlazS.default)(object, (0, $lmrTu.default)(iteratee), (0, $ceNjR.default));\n}\nvar $78c33b948be66cbe$export$2e2bcd8739ae039 = $78c33b948be66cbe$var$forIn;\n\n});\n\n\n\n\n\n\n//# sourceMappingURL=flowDiagram-b222e15a.19e32f11.js.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","import * as acyclic from './acyclic.js';\nimport { layout } from './layout.js';\nimport * as normalize from './normalize.js';\nimport { rank } from './rank/index.js';\n\nexport { acyclic, normalize, rank, layout };\n","import * as _ from 'lodash-es';\nimport { greedyFAS } from './greedy-fas.js';\n\nexport { run, undo };\n\nfunction run(g) {\n var fas = g.graph().acyclicer === 'greedy' ? greedyFAS(g, weightFn(g)) : dfsFAS(g);\n _.forEach(fas, function (e) {\n var label = g.edge(e);\n g.removeEdge(e);\n label.forwardName = e.name;\n label.reversed = true;\n g.setEdge(e.w, e.v, label, _.uniqueId('rev'));\n });\n\n function weightFn(g) {\n return function (e) {\n return g.edge(e).weight;\n };\n }\n}\n\nfunction dfsFAS(g) {\n var fas = [];\n var stack = {};\n var visited = {};\n\n function dfs(v) {\n if (_.has(visited, v)) {\n return;\n }\n visited[v] = true;\n stack[v] = true;\n _.forEach(g.outEdges(v), function (e) {\n if (_.has(stack, e.w)) {\n fas.push(e);\n } else {\n dfs(e.w);\n }\n });\n delete stack[v];\n }\n\n _.forEach(g.nodes(), dfs);\n return fas;\n}\n\nfunction undo(g) {\n _.forEach(g.edges(), function (e) {\n var label = g.edge(e);\n if (label.reversed) {\n g.removeEdge(e);\n\n var forwardName = label.forwardName;\n delete label.reversed;\n delete label.forwardName;\n g.setEdge(e.w, e.v, label, forwardName);\n }\n });\n}\n","import toString from './toString.js';\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n var id = ++idCounter;\n return toString(prefix) + id;\n}\n\nexport default uniqueId;\n","import * 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 baseFlatten from './_baseFlatten.js';\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n var length = array == null ? 0 : array.length;\n return length ? baseFlatten(array, 1) : [];\n}\n\nexport default flatten;\n","import 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 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 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","/* 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 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 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 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","/** 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","/*\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 { addBorderSegments } from './add-border-segments.js';\nimport * as coordinateSystem from './coordinate-system.js';\nimport * as acyclic from './acyclic.js';\nimport * as normalize from './normalize.js';\nimport { rank } from './rank/index.js';\nimport * as nestingGraph from './nesting-graph.js';\nimport { order } from './order/index.js';\nimport { parentDummyChains } from './parent-dummy-chains.js';\nimport { position } from './position/index.js';\nimport * as util from './util.js';\n\nexport { layout };\n\nfunction layout(g, opts) {\n var time = opts && opts.debugTiming ? util.time : util.notime;\n time('layout', function () {\n var layoutGraph = time(' buildLayoutGraph', function () {\n return buildLayoutGraph(g);\n });\n time(' runLayout', function () {\n runLayout(layoutGraph, time);\n });\n time(' updateInputGraph', function () {\n updateInputGraph(g, layoutGraph);\n });\n });\n}\n\nfunction runLayout(g, time) {\n time(' makeSpaceForEdgeLabels', function () {\n makeSpaceForEdgeLabels(g);\n });\n time(' removeSelfEdges', function () {\n removeSelfEdges(g);\n });\n time(' acyclic', function () {\n acyclic.run(g);\n });\n time(' nestingGraph.run', function () {\n nestingGraph.run(g);\n });\n time(' rank', function () {\n rank(util.asNonCompoundGraph(g));\n });\n time(' injectEdgeLabelProxies', function () {\n injectEdgeLabelProxies(g);\n });\n time(' removeEmptyRanks', function () {\n util.removeEmptyRanks(g);\n });\n time(' nestingGraph.cleanup', function () {\n nestingGraph.cleanup(g);\n });\n time(' normalizeRanks', function () {\n util.normalizeRanks(g);\n });\n time(' assignRankMinMax', function () {\n assignRankMinMax(g);\n });\n time(' removeEdgeLabelProxies', function () {\n removeEdgeLabelProxies(g);\n });\n time(' normalize.run', function () {\n normalize.run(g);\n });\n time(' parentDummyChains', function () {\n parentDummyChains(g);\n });\n time(' addBorderSegments', function () {\n addBorderSegments(g);\n });\n time(' order', function () {\n order(g);\n });\n time(' insertSelfEdges', function () {\n insertSelfEdges(g);\n });\n time(' adjustCoordinateSystem', function () {\n coordinateSystem.adjust(g);\n });\n time(' position', function () {\n position(g);\n });\n time(' positionSelfEdges', function () {\n positionSelfEdges(g);\n });\n time(' removeBorderNodes', function () {\n removeBorderNodes(g);\n });\n time(' normalize.undo', function () {\n normalize.undo(g);\n });\n time(' fixupEdgeLabelCoords', function () {\n fixupEdgeLabelCoords(g);\n });\n time(' undoCoordinateSystem', function () {\n coordinateSystem.undo(g);\n });\n time(' translateGraph', function () {\n translateGraph(g);\n });\n time(' assignNodeIntersects', function () {\n assignNodeIntersects(g);\n });\n time(' reversePoints', function () {\n reversePointsForReversedEdges(g);\n });\n time(' acyclic.undo', function () {\n acyclic.undo(g);\n });\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n _.forEach(inputGraph.nodes(), function (v) {\n var inputLabel = inputGraph.node(v);\n var layoutLabel = layoutGraph.node(v);\n\n if (inputLabel) {\n inputLabel.x = layoutLabel.x;\n inputLabel.y = layoutLabel.y;\n\n if (layoutGraph.children(v).length) {\n inputLabel.width = layoutLabel.width;\n inputLabel.height = layoutLabel.height;\n }\n }\n });\n\n _.forEach(inputGraph.edges(), function (e) {\n var inputLabel = inputGraph.edge(e);\n var layoutLabel = layoutGraph.edge(e);\n\n inputLabel.points = layoutLabel.points;\n if (_.has(layoutLabel, 'x')) {\n inputLabel.x = layoutLabel.x;\n inputLabel.y = layoutLabel.y;\n }\n });\n\n inputGraph.graph().width = layoutGraph.graph().width;\n inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = ['nodesep', 'edgesep', 'ranksep', 'marginx', 'marginy'];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: 'tb' };\nvar graphAttrs = ['acyclicer', 'ranker', 'rankdir', 'align'];\nvar nodeNumAttrs = ['width', 'height'];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];\nvar edgeDefaults = {\n minlen: 1,\n weight: 1,\n width: 0,\n height: 0,\n labeloffset: 10,\n labelpos: 'r',\n};\nvar edgeAttrs = ['labelpos'];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n var g = new Graph({ multigraph: true, compound: true });\n var graph = canonicalize(inputGraph.graph());\n\n g.setGraph(\n _.merge({}, graphDefaults, selectNumberAttrs(graph, graphNumAttrs), _.pick(graph, graphAttrs))\n );\n\n _.forEach(inputGraph.nodes(), function (v) {\n var node = canonicalize(inputGraph.node(v));\n g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n g.setParent(v, inputGraph.parent(v));\n });\n\n _.forEach(inputGraph.edges(), function (e) {\n var edge = canonicalize(inputGraph.edge(e));\n g.setEdge(\n e,\n _.merge({}, edgeDefaults, selectNumberAttrs(edge, edgeNumAttrs), _.pick(edge, edgeAttrs))\n );\n });\n\n return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n var graph = g.graph();\n graph.ranksep /= 2;\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n edge.minlen *= 2;\n if (edge.labelpos.toLowerCase() !== 'c') {\n if (graph.rankdir === 'TB' || graph.rankdir === 'BT') {\n edge.width += edge.labeloffset;\n } else {\n edge.height += edge.labeloffset;\n }\n }\n });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n if (edge.width && edge.height) {\n var v = g.node(e.v);\n var w = g.node(e.w);\n var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n util.addDummyNode(g, 'edge-proxy', label, '_ep');\n }\n });\n}\n\nfunction assignRankMinMax(g) {\n var maxRank = 0;\n _.forEach(g.nodes(), function (v) {\n var node = g.node(v);\n if (node.borderTop) {\n node.minRank = g.node(node.borderTop).rank;\n node.maxRank = g.node(node.borderBottom).rank;\n // @ts-expect-error\n maxRank = _.max(maxRank, node.maxRank);\n }\n });\n g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n _.forEach(g.nodes(), function (v) {\n var node = g.node(v);\n if (node.dummy === 'edge-proxy') {\n g.edge(node.e).labelRank = node.rank;\n g.removeNode(v);\n }\n });\n}\n\nfunction translateGraph(g) {\n var minX = Number.POSITIVE_INFINITY;\n var maxX = 0;\n var minY = Number.POSITIVE_INFINITY;\n var maxY = 0;\n var graphLabel = g.graph();\n var marginX = graphLabel.marginx || 0;\n var marginY = graphLabel.marginy || 0;\n\n function getExtremes(attrs) {\n var x = attrs.x;\n var y = attrs.y;\n var w = attrs.width;\n var h = attrs.height;\n minX = Math.min(minX, x - w / 2);\n maxX = Math.max(maxX, x + w / 2);\n minY = Math.min(minY, y - h / 2);\n maxY = Math.max(maxY, y + h / 2);\n }\n\n _.forEach(g.nodes(), function (v) {\n getExtremes(g.node(v));\n });\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n if (_.has(edge, 'x')) {\n getExtremes(edge);\n }\n });\n\n minX -= marginX;\n minY -= marginY;\n\n _.forEach(g.nodes(), function (v) {\n var node = g.node(v);\n node.x -= minX;\n node.y -= minY;\n });\n\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n _.forEach(edge.points, function (p) {\n p.x -= minX;\n p.y -= minY;\n });\n if (_.has(edge, 'x')) {\n edge.x -= minX;\n }\n if (_.has(edge, 'y')) {\n edge.y -= minY;\n }\n });\n\n graphLabel.width = maxX - minX + marginX;\n graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n var nodeV = g.node(e.v);\n var nodeW = g.node(e.w);\n var p1, p2;\n if (!edge.points) {\n edge.points = [];\n p1 = nodeW;\n p2 = nodeV;\n } else {\n p1 = edge.points[0];\n p2 = edge.points[edge.points.length - 1];\n }\n edge.points.unshift(util.intersectRect(nodeV, p1));\n edge.points.push(util.intersectRect(nodeW, p2));\n });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n if (_.has(edge, 'x')) {\n if (edge.labelpos === 'l' || edge.labelpos === 'r') {\n edge.width -= edge.labeloffset;\n }\n switch (edge.labelpos) {\n case 'l':\n edge.x -= edge.width / 2 + edge.labeloffset;\n break;\n case 'r':\n edge.x += edge.width / 2 + edge.labeloffset;\n break;\n }\n }\n });\n}\n\nfunction reversePointsForReversedEdges(g) {\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n if (edge.reversed) {\n edge.points.reverse();\n }\n });\n}\n\nfunction removeBorderNodes(g) {\n _.forEach(g.nodes(), function (v) {\n if (g.children(v).length) {\n var node = g.node(v);\n var t = g.node(node.borderTop);\n var b = g.node(node.borderBottom);\n var l = g.node(_.last(node.borderLeft));\n var r = g.node(_.last(node.borderRight));\n\n node.width = Math.abs(r.x - l.x);\n node.height = Math.abs(b.y - t.y);\n node.x = l.x + node.width / 2;\n node.y = t.y + node.height / 2;\n }\n });\n\n _.forEach(g.nodes(), function (v) {\n if (g.node(v).dummy === 'border') {\n g.removeNode(v);\n }\n });\n}\n\nfunction removeSelfEdges(g) {\n _.forEach(g.edges(), function (e) {\n if (e.v === e.w) {\n var node = g.node(e.v);\n if (!node.selfEdges) {\n node.selfEdges = [];\n }\n node.selfEdges.push({ e: e, label: g.edge(e) });\n g.removeEdge(e);\n }\n });\n}\n\nfunction insertSelfEdges(g) {\n var layers = util.buildLayerMatrix(g);\n _.forEach(layers, function (layer) {\n var orderShift = 0;\n _.forEach(layer, function (v, i) {\n var node = g.node(v);\n node.order = i + orderShift;\n _.forEach(node.selfEdges, function (selfEdge) {\n util.addDummyNode(\n g,\n 'selfedge',\n {\n width: selfEdge.label.width,\n height: selfEdge.label.height,\n rank: node.rank,\n order: i + ++orderShift,\n e: selfEdge.e,\n label: selfEdge.label,\n },\n '_se'\n );\n });\n delete node.selfEdges;\n });\n });\n}\n\nfunction positionSelfEdges(g) {\n _.forEach(g.nodes(), function (v) {\n var node = g.node(v);\n if (node.dummy === 'selfedge') {\n var selfNode = g.node(node.e.v);\n var x = selfNode.x + selfNode.width / 2;\n var y = selfNode.y;\n var dx = node.x - x;\n var dy = selfNode.height / 2;\n g.setEdge(node.e, node.label);\n g.removeNode(v);\n node.label.points = [\n { x: x + (2 * dx) / 3, y: y - dy },\n { x: x + (5 * dx) / 6, y: y - dy },\n { x: x + dx, y: y },\n { x: x + (5 * dx) / 6, y: y + dy },\n { x: x + (2 * dx) / 3, y: y + dy },\n ];\n node.label.x = node.x;\n node.label.y = node.y;\n }\n });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n var newAttrs = {};\n _.forEach(attrs, function (v, k) {\n newAttrs[k.toLowerCase()] = v;\n });\n return newAttrs;\n}\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n var length = array == null ? 0 : array.length;\n return length ? array[length - 1] : undefined;\n}\n\nexport default last;\n","import baseAssignValue from './_baseAssignValue.js';\nimport baseForOwn from './_baseForOwn.js';\nimport baseIteratee from './_baseIteratee.js';\n\n/**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n * 'fred': { 'user': 'fred', 'age': 40 },\n * 'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\nfunction mapValues(object, iteratee) {\n var result = {};\n iteratee = baseIteratee(iteratee, 3);\n\n baseForOwn(object, function(value, key, object) {\n baseAssignValue(result, key, iteratee(value, key, object));\n });\n return result;\n}\n\nexport default mapValues;\n","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 isSymbol from './isSymbol.js';\n\n/**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\nfunction baseExtremum(array, iteratee, comparator) {\n var index = -1,\n length = array.length;\n\n while (++index < length) {\n var value = array[index],\n current = iteratee(value);\n\n if (current != null && (computed === undefined\n ? (current === current && !isSymbol(current))\n : comparator(current, computed)\n )) {\n var computed = current,\n result = value;\n }\n }\n return result;\n}\n\nexport default baseExtremum;\n","/**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n * else `false`.\n */\nfunction baseGt(value, other) {\n return value > other;\n}\n\nexport default baseGt;\n","import 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 basePickBy from './_basePickBy.js';\nimport hasIn from './hasIn.js';\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n return basePickBy(object, paths, function(value, path) {\n return hasIn(object, path);\n });\n}\n\nexport default basePick;\n","import 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","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 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 * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { addBorderSegments };\n\nfunction addBorderSegments(g) {\n function dfs(v) {\n var children = g.children(v);\n var node = g.node(v);\n if (children.length) {\n _.forEach(children, dfs);\n }\n\n if (_.has(node, 'minRank')) {\n node.borderLeft = [];\n node.borderRight = [];\n for (var rank = node.minRank, maxRank = node.maxRank + 1; rank < maxRank; ++rank) {\n addBorderNode(g, 'borderLeft', '_bl', v, node, rank);\n addBorderNode(g, 'borderRight', '_br', v, node, rank);\n }\n }\n }\n\n _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n var label = { width: 0, height: 0, rank: rank, borderType: prop };\n var prev = sgNode[prop][rank - 1];\n var curr = util.addDummyNode(g, 'border', label, prefix);\n sgNode[prop][rank] = curr;\n g.setParent(curr, sg);\n if (prev) {\n g.setEdge(prev, curr, { weight: 1 });\n }\n}\n","import * as _ from 'lodash-es';\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 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","/**\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 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 assignValue from './_assignValue.js';\nimport baseZipObject from './_baseZipObject.js';\n\n/**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction zipObject(props, values) {\n return baseZipObject(props || [], values || [], assignValue);\n}\n\nexport default zipObject;\n","/**\n * 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 * as _ from 'lodash-es';\n\nexport { adjust, undo };\n\nfunction adjust(g) {\n var rankDir = g.graph().rankdir.toLowerCase();\n if (rankDir === 'lr' || rankDir === 'rl') {\n swapWidthHeight(g);\n }\n}\n\nfunction undo(g) {\n var rankDir = g.graph().rankdir.toLowerCase();\n if (rankDir === 'bt' || rankDir === 'rl') {\n reverseY(g);\n }\n\n if (rankDir === 'lr' || rankDir === 'rl') {\n swapXY(g);\n swapWidthHeight(g);\n }\n}\n\nfunction swapWidthHeight(g) {\n _.forEach(g.nodes(), function (v) {\n swapWidthHeightOne(g.node(v));\n });\n _.forEach(g.edges(), function (e) {\n swapWidthHeightOne(g.edge(e));\n });\n}\n\nfunction swapWidthHeightOne(attrs) {\n var w = attrs.width;\n attrs.width = attrs.height;\n attrs.height = w;\n}\n\nfunction reverseY(g) {\n _.forEach(g.nodes(), function (v) {\n reverseYOne(g.node(v));\n });\n\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n _.forEach(edge.points, reverseYOne);\n if (_.has(edge, 'y')) {\n reverseYOne(edge);\n }\n });\n}\n\nfunction reverseYOne(attrs) {\n attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n _.forEach(g.nodes(), function (v) {\n swapXYOne(g.node(v));\n });\n\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n _.forEach(edge.points, swapXYOne);\n if (_.has(edge, 'x')) {\n swapXYOne(edge);\n }\n });\n}\n\nfunction swapXYOne(attrs) {\n var x = attrs.x;\n attrs.x = attrs.y;\n attrs.y = x;\n}\n","import * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { run, undo };\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n * 1. The input graph is a DAG.\n * 2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n * 1. All edges in the graph have a length of 1.\n * 2. Dummy nodes are added where edges have been split into segments.\n * 3. The graph is augmented with a \"dummyChains\" attribute which contains\n * the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n g.graph().dummyChains = [];\n _.forEach(g.edges(), function (edge) {\n normalizeEdge(g, edge);\n });\n}\n\nfunction normalizeEdge(g, e) {\n var v = e.v;\n var vRank = g.node(v).rank;\n var w = e.w;\n var wRank = g.node(w).rank;\n var name = e.name;\n var edgeLabel = g.edge(e);\n var labelRank = edgeLabel.labelRank;\n\n if (wRank === vRank + 1) return;\n\n g.removeEdge(e);\n\n var dummy, attrs, i;\n for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n edgeLabel.points = [];\n attrs = {\n width: 0,\n height: 0,\n edgeLabel: edgeLabel,\n edgeObj: e,\n rank: vRank,\n };\n dummy = util.addDummyNode(g, 'edge', attrs, '_d');\n if (vRank === labelRank) {\n attrs.width = edgeLabel.width;\n attrs.height = edgeLabel.height;\n // @ts-expect-error\n attrs.dummy = 'edge-label';\n // @ts-expect-error\n attrs.labelpos = edgeLabel.labelpos;\n }\n g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n if (i === 0) {\n g.graph().dummyChains.push(dummy);\n }\n v = dummy;\n }\n\n g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n _.forEach(g.graph().dummyChains, function (v) {\n var node = g.node(v);\n var origLabel = node.edgeLabel;\n var w;\n g.setEdge(node.edgeObj, origLabel);\n while (node.dummy) {\n w = g.successors(v)[0];\n g.removeNode(v);\n origLabel.points.push({ x: node.x, y: node.y });\n if (node.dummy === 'edge-label') {\n origLabel.x = node.x;\n origLabel.y = node.y;\n origLabel.width = node.width;\n origLabel.height = node.height;\n }\n v = w;\n node = g.node(v);\n }\n });\n}\n","import { 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 { 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 baseExtremum from './_baseExtremum.js';\nimport baseIteratee from './_baseIteratee.js';\nimport baseLt from './_baseLt.js';\n\n/**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\nfunction minBy(array, iteratee) {\n return (array && array.length)\n ? baseExtremum(array, baseIteratee(iteratee, 2), baseLt)\n : undefined;\n}\n\nexport default minBy;\n","import * as _ from 'lodash-es';\n\nexport { longestPath, slack };\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n * 1. Input graph is a DAG.\n * 2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n * 1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n var visited = {};\n\n function dfs(v) {\n var label = g.node(v);\n if (_.has(visited, v)) {\n return label.rank;\n }\n visited[v] = true;\n\n var rank = _.min(\n _.map(g.outEdges(v), function (e) {\n return dfs(e.w) - g.edge(e).minlen;\n })\n );\n\n if (\n rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n rank === undefined || // return value of _.map([]) for Lodash 4\n rank === null\n ) {\n // return value of _.map([null])\n rank = 0;\n }\n\n return (label.rank = rank);\n }\n\n _.forEach(g.sources(), dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","import * as _ from 'lodash-es';\nimport * as alg from '../../graphlib/alg/index.js';\nimport { simplify } from '../util.js';\nimport { feasibleTree } from './feasible-tree.js';\nimport { longestPath, slack } from './util.js';\n\nexport { networkSimplex };\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n * 1. The input graph must be a DAG.\n * 2. All nodes in the graph must have an object value.\n * 3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n * 1. All nodes in the graph will have an assigned \"rank\" attribute that has\n * been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n * 1. Assign initial ranks to each node. We use the longest path algorithm,\n * which assigns ranks to the lowest position possible. In general this\n * leads to very wide bottom ranks and unnecessarily long edges.\n * 2. Construct a feasible tight tree. A tight tree is one such that all\n * edges in the tree have no slack (difference between length of edge\n * and minlen for the edge). This by itself greatly improves the assigned\n * rankings by shorting edges.\n * 3. Iteratively find edges that have negative cut values. Generally a\n * negative cut value indicates that the edge could be removed and a new\n * tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n g = simplify(g);\n longestPath(g);\n var t = feasibleTree(g);\n initLowLimValues(t);\n initCutValues(t, g);\n\n var e, f;\n while ((e = leaveEdge(t))) {\n f = enterEdge(t, g, e);\n exchangeEdges(t, g, e, f);\n }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n var vs = alg.postorder(t, t.nodes());\n vs = vs.slice(0, vs.length - 1);\n _.forEach(vs, function (v) {\n assignCutValue(t, g, v);\n });\n}\n\nfunction assignCutValue(t, g, child) {\n var childLab = t.node(child);\n var parent = childLab.parent;\n t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n var childLab = t.node(child);\n var parent = childLab.parent;\n // True if the child is on the tail end of the edge in the directed graph\n var childIsTail = true;\n // The graph's view of the tree edge we're inspecting\n var graphEdge = g.edge(child, parent);\n // The accumulated cut value for the edge between this node and its parent\n var cutValue = 0;\n\n if (!graphEdge) {\n childIsTail = false;\n graphEdge = g.edge(parent, child);\n }\n\n cutValue = graphEdge.weight;\n\n _.forEach(g.nodeEdges(child), function (e) {\n var isOutEdge = e.v === child,\n other = isOutEdge ? e.w : e.v;\n\n if (other !== parent) {\n var pointsToHead = isOutEdge === childIsTail,\n otherWeight = g.edge(e).weight;\n\n cutValue += pointsToHead ? otherWeight : -otherWeight;\n if (isTreeEdge(t, child, other)) {\n var otherCutValue = t.edge(child, other).cutvalue;\n cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n }\n }\n });\n\n return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n if (arguments.length < 2) {\n root = tree.nodes()[0];\n }\n dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n var low = nextLim;\n var label = tree.node(v);\n\n visited[v] = true;\n _.forEach(tree.neighbors(v), function (w) {\n if (!_.has(visited, w)) {\n nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n }\n });\n\n label.low = low;\n label.lim = nextLim++;\n if (parent) {\n label.parent = parent;\n } else {\n // TODO should be able to remove this when we incrementally update low lim\n delete label.parent;\n }\n\n return nextLim;\n}\n\nfunction leaveEdge(tree) {\n return _.find(tree.edges(), function (e) {\n return tree.edge(e).cutvalue < 0;\n });\n}\n\nfunction enterEdge(t, g, edge) {\n var v = edge.v;\n var w = edge.w;\n\n // For the rest of this function we assume that v is the tail and w is the\n // head, so if we don't have this edge in the graph we should flip it to\n // match the correct orientation.\n if (!g.hasEdge(v, w)) {\n v = edge.w;\n w = edge.v;\n }\n\n var vLabel = t.node(v);\n var wLabel = t.node(w);\n var tailLabel = vLabel;\n var flip = false;\n\n // If the root is in the tail of the edge then we need to flip the logic that\n // checks for the head and tail nodes in the candidates function below.\n if (vLabel.lim > wLabel.lim) {\n tailLabel = wLabel;\n flip = true;\n }\n\n var candidates = _.filter(g.edges(), function (edge) {\n return (\n flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n flip !== isDescendant(t, t.node(edge.w), tailLabel)\n );\n });\n\n return _.minBy(candidates, function (edge) {\n return slack(g, edge);\n });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n var v = e.v;\n var w = e.w;\n t.removeEdge(v, w);\n t.setEdge(f.v, f.w, {});\n initLowLimValues(t);\n initCutValues(t, g);\n updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n var root = _.find(t.nodes(), function (v) {\n return !g.node(v).parent;\n });\n var vs = alg.preorder(t, root);\n vs = vs.slice(1);\n _.forEach(vs, function (v) {\n var parent = t.node(v).parent,\n edge = g.edge(v, parent),\n flipped = false;\n\n if (!edge) {\n edge = g.edge(parent, v);\n flipped = true;\n }\n\n g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","import 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 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 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 { components } from './components.js';\nimport { dijkstra } from './dijkstra.js';\nimport { dijkstraAll } from './dijkstra-all.js';\nimport { findCycles } from './find-cycles.js';\nimport { floydWarshall } from './floyd-warshall.js';\nimport { isAcyclic } from './is-acyclic.js';\nimport { postorder } from './postorder.js';\nimport { preorder } from './preorder.js';\nimport { prim } from './prim.js';\nimport { tarjan } from './tarjan.js';\nimport { topsort } from './topsort.js';\n\nexport {\n components,\n dijkstra,\n dijkstraAll,\n findCycles,\n floydWarshall,\n isAcyclic,\n postorder,\n preorder,\n prim,\n tarjan,\n topsort,\n};\n","import * as _ from 'lodash-es';\n\nexport { components };\n\nfunction components(g) {\n var visited = {};\n var cmpts = [];\n var cmpt;\n\n function dfs(v) {\n if (_.has(visited, v)) return;\n visited[v] = true;\n cmpt.push(v);\n _.each(g.successors(v), dfs);\n _.each(g.predecessors(v), dfs);\n }\n\n _.each(g.nodes(), function (v) {\n cmpt = [];\n dfs(v);\n if (cmpt.length) {\n cmpts.push(cmpt);\n }\n });\n\n return cmpts;\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 { PriorityQueue };\n\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nclass PriorityQueue {\n constructor() {\n this._arr = [];\n this._keyIndices = {};\n }\n /**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */\n size() {\n return this._arr.length;\n }\n /**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */\n keys() {\n return this._arr.map(function (x) {\n return x.key;\n });\n }\n /**\n * Returns `true` if **key** is in the queue and `false` if not.\n */\n has(key) {\n return _.has(this._keyIndices, key);\n }\n /**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */\n priority(key) {\n var index = this._keyIndices[key];\n if (index !== undefined) {\n return this._arr[index].priority;\n }\n }\n /**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */\n min() {\n if (this.size() === 0) {\n throw new Error('Queue underflow');\n }\n return this._arr[0].key;\n }\n /**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */\n add(key, priority) {\n var keyIndices = this._keyIndices;\n key = String(key);\n if (!_.has(keyIndices, key)) {\n var arr = this._arr;\n var index = arr.length;\n keyIndices[key] = index;\n arr.push({ key: key, priority: priority });\n this._decrease(index);\n return true;\n }\n return false;\n }\n /**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */\n removeMin() {\n this._swap(0, this._arr.length - 1);\n var min = this._arr.pop();\n delete this._keyIndices[min.key];\n this._heapify(0);\n return min.key;\n }\n /**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */\n decrease(key, priority) {\n var index = this._keyIndices[key];\n if (priority > this._arr[index].priority) {\n throw new Error(\n 'New priority is greater than current priority. ' +\n 'Key: ' +\n key +\n ' Old: ' +\n this._arr[index].priority +\n ' New: ' +\n priority\n );\n }\n this._arr[index].priority = priority;\n this._decrease(index);\n }\n _heapify(i) {\n var arr = this._arr;\n var l = 2 * i;\n var r = l + 1;\n var largest = i;\n if (l < arr.length) {\n largest = arr[l].priority < arr[largest].priority ? l : largest;\n if (r < arr.length) {\n largest = arr[r].priority < arr[largest].priority ? r : largest;\n }\n if (largest !== i) {\n this._swap(i, largest);\n this._heapify(largest);\n }\n }\n }\n _decrease(index) {\n var arr = this._arr;\n var priority = arr[index].priority;\n var parent;\n while (index !== 0) {\n parent = index >> 1;\n if (arr[parent].priority < priority) {\n break;\n }\n this._swap(index, parent);\n index = parent;\n }\n }\n _swap(i, j) {\n var arr = this._arr;\n var keyIndices = this._keyIndices;\n var origArrI = arr[i];\n var origArrJ = arr[j];\n arr[i] = origArrJ;\n arr[j] = origArrI;\n keyIndices[origArrJ.key] = i;\n keyIndices[origArrI.key] = j;\n }\n}\n","import * as _ from 'lodash-es';\nimport { dijkstra } from './dijkstra.js';\n\nexport { dijkstraAll };\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n return _.transform(\n g.nodes(),\n function (acc, v) {\n acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n },\n {}\n );\n}\n","import arrayEach from './_arrayEach.js';\nimport baseCreate from './_baseCreate.js';\nimport baseForOwn from './_baseForOwn.js';\nimport baseIteratee from './_baseIteratee.js';\nimport getPrototype from './_getPrototype.js';\nimport isArray from './isArray.js';\nimport isBuffer from './isBuffer.js';\nimport isFunction from './isFunction.js';\nimport isObject from './isObject.js';\nimport isTypedArray from './isTypedArray.js';\n\n/**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.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 * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n * result.push(n *= n);\n * return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n * (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\nfunction transform(object, iteratee, accumulator) {\n var isArr = isArray(object),\n isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n iteratee = baseIteratee(iteratee, 4);\n if (accumulator == null) {\n var Ctor = object && object.constructor;\n if (isArrLike) {\n accumulator = isArr ? new Ctor : [];\n }\n else if (isObject(object)) {\n accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n }\n else {\n accumulator = {};\n }\n }\n (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n return iteratee(accumulator, value, index, object);\n });\n return accumulator;\n}\n\nexport default transform;\n","import * as _ from 'lodash-es';\nimport { tarjan } from './tarjan.js';\n\nexport { findCycles };\n\nfunction findCycles(g) {\n return _.filter(tarjan(g), function (cmpt) {\n return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n });\n}\n","import * as _ from 'lodash-es';\n\nexport { tarjan };\n\nfunction tarjan(g) {\n var index = 0;\n var stack = [];\n var visited = {}; // node id -> { onStack, lowlink, index }\n var results = [];\n\n function dfs(v) {\n var entry = (visited[v] = {\n onStack: true,\n lowlink: index,\n index: index++,\n });\n stack.push(v);\n\n g.successors(v).forEach(function (w) {\n if (!_.has(visited, w)) {\n dfs(w);\n entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n } else if (visited[w].onStack) {\n entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n }\n });\n\n if (entry.lowlink === entry.index) {\n var cmpt = [];\n var w;\n do {\n w = stack.pop();\n visited[w].onStack = false;\n cmpt.push(w);\n } while (v !== w);\n results.push(cmpt);\n }\n }\n\n g.nodes().forEach(function (v) {\n if (!_.has(visited, v)) {\n dfs(v);\n }\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 { topsort, CycleException } from './topsort.js';\n\nexport { isAcyclic };\n\nfunction isAcyclic(g) {\n try {\n topsort(g);\n } catch (e) {\n if (e instanceof CycleException) {\n return false;\n }\n throw e;\n }\n return true;\n}\n","import * as _ from 'lodash-es';\n\nexport { topsort, CycleException };\n\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n var visited = {};\n var stack = {};\n var results = [];\n\n function visit(node) {\n if (_.has(stack, node)) {\n throw new CycleException();\n }\n\n if (!_.has(visited, node)) {\n stack[node] = true;\n visited[node] = true;\n _.each(g.predecessors(node), visit);\n delete stack[node];\n results.push(node);\n }\n }\n\n _.each(g.sinks(), visit);\n\n if (_.size(visited) !== g.nodeCount()) {\n throw new CycleException();\n }\n\n return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing\n","import baseKeys from './_baseKeys.js';\nimport getTag from './_getTag.js';\nimport isArrayLike from './isArrayLike.js';\nimport isString from './isString.js';\nimport stringSize from './_stringSize.js';\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n setTag = '[object Set]';\n\n/**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\nfunction size(collection) {\n if (collection == null) {\n return 0;\n }\n if (isArrayLike(collection)) {\n return isString(collection) ? stringSize(collection) : collection.length;\n }\n var tag = getTag(collection);\n if (tag == mapTag || tag == setTag) {\n return collection.size;\n }\n return baseKeys(collection).length;\n}\n\nexport default size;\n","import baseGetTag from './_baseGetTag.js';\nimport isArray from './isArray.js';\nimport isObjectLike from './isObjectLike.js';\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n return typeof value == 'string' ||\n (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nexport default isString;\n","import asciiSize from './_asciiSize.js';\nimport hasUnicode from './_hasUnicode.js';\nimport unicodeSize from './_unicodeSize.js';\n\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\nfunction stringSize(string) {\n return hasUnicode(string)\n ? unicodeSize(string)\n : asciiSize(string);\n}\n\nexport default stringSize;\n","import 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 { dfs } from './dfs.js';\n\nexport { postorder };\n\nfunction postorder(g, vs) {\n return dfs(g, vs, 'post');\n}\n","import * as _ from 'lodash-es';\n\nexport { dfs };\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n if (!_.isArray(vs)) {\n vs = [vs];\n }\n\n var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n var acc = [];\n var visited = {};\n _.each(vs, function (v) {\n if (!g.hasNode(v)) {\n throw new Error('Graph does not have node: ' + v);\n }\n\n doDfs(g, v, order === 'post', visited, navigation, acc);\n });\n return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n if (!_.has(visited, v)) {\n visited[v] = true;\n\n if (!postorder) {\n acc.push(v);\n }\n _.each(navigation(v), function (w) {\n doDfs(g, w, postorder, visited, navigation, acc);\n });\n if (postorder) {\n acc.push(v);\n }\n }\n}\n","import { dfs } from './dfs.js';\n\nexport { preorder };\n\nfunction preorder(g, vs) {\n return dfs(g, vs, 'pre');\n}\n","import * as _ from 'lodash-es';\nimport { PriorityQueue } from '../data/priority-queue.js';\nimport { Graph } from '../graph.js';\n\nexport { prim };\n\nfunction prim(g, weightFunc) {\n var result = new Graph();\n var parents = {};\n var pq = new PriorityQueue();\n var v;\n\n function updateNeighbors(edge) {\n var w = edge.v === v ? edge.w : edge.v;\n var pri = pq.priority(w);\n if (pri !== undefined) {\n var edgeWeight = weightFunc(edge);\n if (edgeWeight < pri) {\n parents[w] = v;\n pq.decrease(w, edgeWeight);\n }\n }\n }\n\n if (g.nodeCount() === 0) {\n return result;\n }\n\n _.each(g.nodes(), function (v) {\n pq.add(v, Number.POSITIVE_INFINITY);\n result.setNode(v);\n });\n\n // Start from an arbitrary node\n pq.decrease(g.nodes()[0], 0);\n\n var init = false;\n while (pq.size() > 0) {\n v = pq.removeMin();\n if (_.has(parents, v)) {\n result.setEdge(v, parents[v]);\n } else if (init) {\n throw new Error('Input graph is not connected: ' + g);\n } else {\n init = true;\n }\n\n g.nodeEdges(v).forEach(updateNeighbors);\n }\n\n return result;\n}\n","import * as _ from 'lodash-es';\nimport * as util from './util.js';\n\nexport { run, cleanup };\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n * 1. Input graph is a DAG\n * 2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n * 1. Input graph is connected.\n * 2. Dummy nodes are added for the tops and bottoms of subgraphs.\n * 3. The minlen attribute for nodes is adjusted to ensure nodes do not\n * get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n var root = util.addDummyNode(g, 'root', {}, '_root');\n var depths = treeDepths(g);\n var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n var nodeSep = 2 * height + 1;\n\n g.graph().nestingRoot = root;\n\n // Multiply minlen by nodeSep to align nodes on non-border ranks.\n _.forEach(g.edges(), function (e) {\n g.edge(e).minlen *= nodeSep;\n });\n\n // Calculate a weight that is sufficient to keep subgraphs vertically compact\n var weight = sumWeights(g) + 1;\n\n // Create border nodes and link them up\n _.forEach(g.children(), function (child) {\n dfs(g, root, nodeSep, weight, height, depths, child);\n });\n\n // Save the multiplier for node layers for later removal of empty border\n // layers.\n g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n var children = g.children(v);\n if (!children.length) {\n if (v !== root) {\n g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n }\n return;\n }\n\n var top = util.addBorderNode(g, '_bt');\n var bottom = util.addBorderNode(g, '_bb');\n var label = g.node(v);\n\n g.setParent(top, v);\n label.borderTop = top;\n g.setParent(bottom, v);\n label.borderBottom = bottom;\n\n _.forEach(children, function (child) {\n dfs(g, root, nodeSep, weight, height, depths, child);\n\n var childNode = g.node(child);\n var childTop = childNode.borderTop ? childNode.borderTop : child;\n var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n var thisWeight = childNode.borderTop ? weight : 2 * weight;\n var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n g.setEdge(top, childTop, {\n weight: thisWeight,\n minlen: minlen,\n nestingEdge: true,\n });\n\n g.setEdge(childBottom, bottom, {\n weight: thisWeight,\n minlen: minlen,\n nestingEdge: true,\n });\n });\n\n if (!g.parent(v)) {\n g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n }\n}\n\nfunction treeDepths(g) {\n var depths = {};\n function dfs(v, depth) {\n var children = g.children(v);\n if (children && children.length) {\n _.forEach(children, function (child) {\n dfs(child, depth + 1);\n });\n }\n depths[v] = depth;\n }\n _.forEach(g.children(), function (v) {\n dfs(v, 1);\n });\n return depths;\n}\n\nfunction sumWeights(g) {\n return _.reduce(\n g.edges(),\n function (acc, e) {\n return acc + g.edge(e).weight;\n },\n 0\n );\n}\n\nfunction cleanup(g) {\n var graphLabel = g.graph();\n g.removeNode(graphLabel.nestingRoot);\n delete graphLabel.nestingRoot;\n _.forEach(g.edges(), function (e) {\n var edge = g.edge(e);\n if (edge.nestingEdge) {\n g.removeEdge(e);\n }\n });\n}\n","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\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 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","import * as _ from 'lodash-es';\n\nexport { addSubgraphConstraints };\n\nfunction addSubgraphConstraints(g, cg, vs) {\n var prev = {},\n rootPrev;\n\n _.forEach(vs, function (v) {\n var child = g.parent(v),\n parent,\n prevChild;\n while (child) {\n parent = g.parent(child);\n if (parent) {\n prevChild = prev[parent];\n prev[parent] = child;\n } else {\n prevChild = rootPrev;\n rootPrev = child;\n }\n if (prevChild && prevChild !== child) {\n cg.setEdge(prevChild, child);\n return;\n }\n child = parent;\n }\n });\n\n /*\n function dfs(v) {\n var children = v ? g.children(v) : g.children();\n if (children.length) {\n var min = Number.POSITIVE_INFINITY,\n subgraphs = [];\n _.each(children, function(child) {\n var childMin = dfs(child);\n if (g.children(child).length) {\n subgraphs.push({ v: child, order: childMin });\n }\n min = Math.min(min, childMin);\n });\n _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n cg.setEdge(prev.v, curr.v);\n return curr;\n });\n return min;\n }\n return g.node(v).order;\n }\n dfs(undefined);\n */\n}\n","import * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\n\nexport { buildLayerGraph };\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n * 1. Input graph is a DAG\n * 2. Base nodes in the input graph have a rank attribute\n * 3. Subgraph nodes in the input graph has minRank and maxRank attributes\n * 4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n * 1. Output graph has all nodes in the movable rank with preserved\n * hierarchy.\n * 2. Root nodes in the movable layer are made children of the node\n * indicated by the root attribute of the graph.\n * 3. Non-movable nodes incident on movable nodes, selected by the\n * relationship parameter, are included in the graph (without hierarchy).\n * 4. Edges incident on movable nodes, selected by the relationship\n * parameter, are added to the output graph.\n * 5. The weights for copied edges are aggregated as need, since the output\n * graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship) {\n var root = createRootNode(g),\n result = new Graph({ compound: true })\n .setGraph({ root: root })\n .setDefaultNodeLabel(function (v) {\n return g.node(v);\n });\n\n _.forEach(g.nodes(), function (v) {\n var node = g.node(v),\n parent = g.parent(v);\n\n if (node.rank === rank || (node.minRank <= rank && rank <= node.maxRank)) {\n result.setNode(v);\n result.setParent(v, parent || root);\n\n // This assumes we have only short edges!\n _.forEach(g[relationship](v), function (e) {\n var u = e.v === v ? e.w : e.v,\n edge = result.edge(u, v),\n weight = !_.isUndefined(edge) ? edge.weight : 0;\n result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n });\n\n if (_.has(node, 'minRank')) {\n result.setNode(v, {\n borderLeft: node.borderLeft[rank],\n borderRight: node.borderRight[rank],\n });\n }\n }\n });\n\n return result;\n}\n\nfunction createRootNode(g) {\n var v;\n while (g.hasNode((v = _.uniqueId('_root'))));\n return v;\n}\n","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 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 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 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 * as _ from 'lodash-es';\n\nexport { initOrder };\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n var visited = {};\n var simpleNodes = _.filter(g.nodes(), function (v) {\n return !g.children(v).length;\n });\n var maxRank = _.max(\n _.map(simpleNodes, function (v) {\n return g.node(v).rank;\n })\n );\n var layers = _.map(_.range(maxRank + 1), function () {\n return [];\n });\n\n function dfs(v) {\n if (_.has(visited, v)) return;\n visited[v] = true;\n var node = g.node(v);\n layers[node.rank].push(v);\n _.forEach(g.successors(v), dfs);\n }\n\n var orderedVs = _.sortBy(simpleNodes, function (v) {\n return g.node(v).rank;\n });\n _.forEach(orderedVs, dfs);\n\n return layers;\n}\n","import * as _ from 'lodash-es';\nimport { barycenter } from './barycenter.js';\nimport { resolveConflicts } from './resolve-conflicts.js';\nimport { sort } from './sort.js';\n\nexport { sortSubgraph };\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n var movable = g.children(v);\n var node = g.node(v);\n var bl = node ? node.borderLeft : undefined;\n var br = node ? node.borderRight : undefined;\n var subgraphs = {};\n\n if (bl) {\n movable = _.filter(movable, function (w) {\n return w !== bl && w !== br;\n });\n }\n\n var barycenters = barycenter(g, movable);\n _.forEach(barycenters, function (entry) {\n if (g.children(entry.v).length) {\n var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n subgraphs[entry.v] = subgraphResult;\n if (_.has(subgraphResult, 'barycenter')) {\n mergeBarycenters(entry, subgraphResult);\n }\n }\n });\n\n var entries = resolveConflicts(barycenters, cg);\n expandSubgraphs(entries, subgraphs);\n\n var result = sort(entries, biasRight);\n\n if (bl) {\n result.vs = _.flatten([bl, result.vs, br]);\n if (g.predecessors(bl).length) {\n var blPred = g.node(g.predecessors(bl)[0]),\n brPred = g.node(g.predecessors(br)[0]);\n if (!_.has(result, 'barycenter')) {\n result.barycenter = 0;\n result.weight = 0;\n }\n result.barycenter =\n (result.barycenter * result.weight + blPred.order + brPred.order) / (result.weight + 2);\n result.weight += 2;\n }\n }\n\n return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n _.forEach(entries, function (entry) {\n entry.vs = _.flatten(\n entry.vs.map(function (v) {\n if (subgraphs[v]) {\n return subgraphs[v].vs;\n }\n return v;\n })\n );\n });\n}\n\nfunction mergeBarycenters(target, other) {\n if (!_.isUndefined(target.barycenter)) {\n target.barycenter =\n (target.barycenter * target.weight + other.barycenter * other.weight) /\n (target.weight + other.weight);\n target.weight += other.weight;\n } else {\n target.barycenter = other.barycenter;\n target.weight = other.weight;\n }\n}\n","import * as _ from 'lodash-es';\n\nexport { barycenter };\n\nfunction barycenter(g, movable) {\n return _.map(movable, function (v) {\n var inV = g.inEdges(v);\n if (!inV.length) {\n return { v: v };\n } else {\n var result = _.reduce(\n inV,\n function (acc, e) {\n var edge = g.edge(e),\n nodeU = g.node(e.v);\n return {\n sum: acc.sum + edge.weight * nodeU.order,\n weight: acc.weight + edge.weight,\n };\n },\n { sum: 0, weight: 0 }\n );\n\n return {\n v: v,\n barycenter: result.sum / result.weight,\n weight: result.weight,\n };\n }\n });\n}\n","import * as _ from 'lodash-es';\n\nexport { resolveConflicts };\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n * 1. Each entry has the form {v, barycenter, weight}, or if the node has\n * no barycenter, then {v}.\n *\n * Returns:\n *\n * A new list of entries of the form {vs, i, barycenter, weight}. The list\n * `vs` may either be a singleton or it may be an aggregation of nodes\n * ordered such that they do not violate constraints from the constraint\n * graph. The property `i` is the lowest original index of any of the\n * elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n var mappedEntries = {};\n _.forEach(entries, function (entry, i) {\n var tmp = (mappedEntries[entry.v] = {\n indegree: 0,\n in: [],\n out: [],\n vs: [entry.v],\n i: i,\n });\n if (!_.isUndefined(entry.barycenter)) {\n // @ts-expect-error\n tmp.barycenter = entry.barycenter;\n // @ts-expect-error\n tmp.weight = entry.weight;\n }\n });\n\n _.forEach(cg.edges(), function (e) {\n var entryV = mappedEntries[e.v];\n var entryW = mappedEntries[e.w];\n if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n entryW.indegree++;\n entryV.out.push(mappedEntries[e.w]);\n }\n });\n\n var sourceSet = _.filter(mappedEntries, function (entry) {\n // @ts-expect-error\n return !entry.indegree;\n });\n\n return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n var entries = [];\n\n function handleIn(vEntry) {\n return function (uEntry) {\n if (uEntry.merged) {\n return;\n }\n if (\n _.isUndefined(uEntry.barycenter) ||\n _.isUndefined(vEntry.barycenter) ||\n uEntry.barycenter >= vEntry.barycenter\n ) {\n mergeEntries(vEntry, uEntry);\n }\n };\n }\n\n function handleOut(vEntry) {\n return function (wEntry) {\n wEntry['in'].push(vEntry);\n if (--wEntry.indegree === 0) {\n sourceSet.push(wEntry);\n }\n };\n }\n\n while (sourceSet.length) {\n var entry = sourceSet.pop();\n entries.push(entry);\n _.forEach(entry['in'].reverse(), handleIn(entry));\n _.forEach(entry.out, handleOut(entry));\n }\n\n return _.map(\n _.filter(entries, function (entry) {\n return !entry.merged;\n }),\n function (entry) {\n return _.pick(entry, ['vs', 'i', 'barycenter', 'weight']);\n }\n );\n}\n\nfunction mergeEntries(target, source) {\n var sum = 0;\n var weight = 0;\n\n if (target.weight) {\n sum += target.barycenter * target.weight;\n weight += target.weight;\n }\n\n if (source.weight) {\n sum += source.barycenter * source.weight;\n weight += source.weight;\n }\n\n target.vs = source.vs.concat(target.vs);\n target.barycenter = sum / weight;\n target.weight = weight;\n target.i = Math.min(source.i, target.i);\n source.merged = true;\n}\n","import * as _ from 'lodash-es';\nimport * as util from '../util.js';\n\nexport { sort };\n\nfunction sort(entries, biasRight) {\n var parts = util.partition(entries, function (entry) {\n return _.has(entry, 'barycenter');\n });\n var sortable = parts.lhs,\n unsortable = _.sortBy(parts.rhs, function (entry) {\n return -entry.i;\n }),\n vs = [],\n sum = 0,\n weight = 0,\n vsIndex = 0;\n\n sortable.sort(compareWithBias(!!biasRight));\n\n vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n _.forEach(sortable, function (entry) {\n vsIndex += entry.vs.length;\n vs.push(entry.vs);\n sum += entry.barycenter * entry.weight;\n weight += entry.weight;\n vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n });\n\n var result = { vs: _.flatten(vs) };\n if (weight) {\n result.barycenter = sum / weight;\n result.weight = weight;\n }\n return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n var last;\n while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n unsortable.pop();\n vs.push(last.vs);\n index++;\n }\n return index;\n}\n\nfunction compareWithBias(bias) {\n return function (entryV, entryW) {\n if (entryV.barycenter < entryW.barycenter) {\n return -1;\n } else if (entryV.barycenter > entryW.barycenter) {\n return 1;\n }\n\n return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n };\n}\n","import * as _ from 'lodash-es';\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';\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 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 * as _ from 'lodash-es';\nimport { Graph } from '../../graphlib/index.js';\nimport * as util from '../util.js';\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nexport {\n positionX,\n findType1Conflicts,\n findType2Conflicts,\n addConflict,\n hasConflict,\n verticalAlignment,\n horizontalCompaction,\n alignCoordinates,\n findSmallestWidthAlignment,\n balance,\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n var conflicts = {};\n\n function visitLayer(prevLayer, layer) {\n var // last visited node in the previous layer that is incident on an inner\n // segment.\n k0 = 0,\n // Tracks the last node in this layer scanned for crossings with a type-1\n // segment.\n scanPos = 0,\n prevLayerLength = prevLayer.length,\n lastNode = _.last(layer);\n\n _.forEach(layer, function (v, i) {\n var w = findOtherInnerSegmentNode(g, v),\n k1 = w ? g.node(w).order : prevLayerLength;\n\n if (w || v === lastNode) {\n _.forEach(layer.slice(scanPos, i + 1), function (scanNode) {\n _.forEach(g.predecessors(scanNode), function (u) {\n var uLabel = g.node(u),\n uPos = uLabel.order;\n if ((uPos < k0 || k1 < uPos) && !(uLabel.dummy && g.node(scanNode).dummy)) {\n addConflict(conflicts, u, scanNode);\n }\n });\n });\n // @ts-expect-error\n scanPos = i + 1;\n k0 = k1;\n }\n });\n\n return layer;\n }\n\n _.reduce(layering, visitLayer);\n return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n var conflicts = {};\n\n function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n var v;\n _.forEach(_.range(southPos, southEnd), function (i) {\n v = south[i];\n if (g.node(v).dummy) {\n _.forEach(g.predecessors(v), function (u) {\n var uNode = g.node(u);\n if (uNode.dummy && (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n addConflict(conflicts, u, v);\n }\n });\n }\n });\n }\n\n function visitLayer(north, south) {\n var prevNorthPos = -1,\n nextNorthPos,\n southPos = 0;\n\n _.forEach(south, function (v, southLookahead) {\n if (g.node(v).dummy === 'border') {\n var predecessors = g.predecessors(v);\n if (predecessors.length) {\n nextNorthPos = g.node(predecessors[0]).order;\n scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n // @ts-expect-error\n southPos = southLookahead;\n prevNorthPos = nextNorthPos;\n }\n }\n scan(south, southPos, south.length, nextNorthPos, north.length);\n });\n\n return south;\n }\n\n _.reduce(layering, visitLayer);\n return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n if (g.node(v).dummy) {\n return _.find(g.predecessors(v), function (u) {\n return g.node(u).dummy;\n });\n }\n}\n\nfunction addConflict(conflicts, v, w) {\n if (v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n\n var conflictsV = conflicts[v];\n if (!conflictsV) {\n conflicts[v] = conflictsV = {};\n }\n conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n if (v > w) {\n var tmp = v;\n v = w;\n w = tmp;\n }\n return _.has(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n var root = {},\n align = {},\n pos = {};\n\n // We cache the position here based on the layering because the graph and\n // layering may be out of sync. The layering matrix is manipulated to\n // generate different extreme alignments.\n _.forEach(layering, function (layer) {\n _.forEach(layer, function (v, order) {\n root[v] = v;\n align[v] = v;\n pos[v] = order;\n });\n });\n\n _.forEach(layering, function (layer) {\n var prevIdx = -1;\n _.forEach(layer, function (v) {\n var ws = neighborFn(v);\n if (ws.length) {\n ws = _.sortBy(ws, function (w) {\n return pos[w];\n });\n var mp = (ws.length - 1) / 2;\n for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n var w = ws[i];\n if (align[v] === v && prevIdx < pos[w] && !hasConflict(conflicts, v, w)) {\n align[w] = v;\n align[v] = root[v] = root[w];\n prevIdx = pos[w];\n }\n }\n }\n });\n });\n\n return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n // This portion of the algorithm differs from BK due to a number of problems.\n // Instead of their algorithm we construct a new block graph and do two\n // sweeps. The first sweep places blocks with the smallest possible\n // coordinates. The second sweep removes unused space by moving blocks to the\n // greatest coordinates without violating separation.\n var xs = {},\n blockG = buildBlockGraph(g, layering, root, reverseSep),\n borderType = reverseSep ? 'borderLeft' : 'borderRight';\n\n function iterate(setXsFunc, nextNodesFunc) {\n var stack = blockG.nodes();\n var elem = stack.pop();\n var visited = {};\n while (elem) {\n if (visited[elem]) {\n setXsFunc(elem);\n } else {\n visited[elem] = true;\n stack.push(elem);\n stack = stack.concat(nextNodesFunc(elem));\n }\n\n elem = stack.pop();\n }\n }\n\n // First pass, assign smallest coordinates\n function pass1(elem) {\n xs[elem] = blockG.inEdges(elem).reduce(function (acc, e) {\n return Math.max(acc, xs[e.v] + blockG.edge(e));\n }, 0);\n }\n\n // Second pass, assign greatest coordinates\n function pass2(elem) {\n var min = blockG.outEdges(elem).reduce(function (acc, e) {\n return Math.min(acc, xs[e.w] - blockG.edge(e));\n }, Number.POSITIVE_INFINITY);\n\n var node = g.node(elem);\n if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n xs[elem] = Math.max(xs[elem], min);\n }\n }\n\n iterate(pass1, blockG.predecessors.bind(blockG));\n iterate(pass2, blockG.successors.bind(blockG));\n\n // Assign x coordinates to all nodes\n _.forEach(align, function (v) {\n xs[v] = xs[root[v]];\n });\n\n return xs;\n}\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n var blockGraph = new Graph(),\n graphLabel = g.graph(),\n sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n _.forEach(layering, function (layer) {\n var u;\n _.forEach(layer, function (v) {\n var vRoot = root[v];\n blockGraph.setNode(vRoot);\n if (u) {\n var uRoot = root[u],\n prevMax = blockGraph.edge(uRoot, vRoot);\n blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n }\n u = v;\n });\n });\n\n return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n return _.minBy(_.values(xss), function (xs) {\n var max = Number.NEGATIVE_INFINITY;\n var min = Number.POSITIVE_INFINITY;\n\n _.forIn(xs, function (x, v) {\n var halfWidth = width(g, v) / 2;\n\n max = Math.max(x + halfWidth, max);\n min = Math.min(x - halfWidth, min);\n });\n\n return max - min;\n });\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n var alignToVals = _.values(alignTo),\n alignToMin = _.min(alignToVals),\n alignToMax = _.max(alignToVals);\n\n _.forEach(['u', 'd'], function (vert) {\n _.forEach(['l', 'r'], function (horiz) {\n var alignment = vert + horiz,\n xs = xss[alignment],\n delta;\n if (xs === alignTo) return;\n\n var xsVals = _.values(xs);\n delta = horiz === 'l' ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n if (delta) {\n xss[alignment] = _.mapValues(xs, function (x) {\n return x + delta;\n });\n }\n });\n });\n}\n\nfunction balance(xss, align) {\n return _.mapValues(xss.ul, function (ignore, v) {\n if (align) {\n return xss[align.toLowerCase()][v];\n } else {\n var xs = _.sortBy(_.map(xss, v));\n return (xs[1] + xs[2]) / 2;\n }\n });\n}\n\nfunction positionX(g) {\n var layering = util.buildLayerMatrix(g);\n var conflicts = _.merge(findType1Conflicts(g, layering), findType2Conflicts(g, layering));\n\n var xss = {};\n var adjustedLayering;\n _.forEach(['u', 'd'], function (vert) {\n adjustedLayering = vert === 'u' ? layering : _.values(layering).reverse();\n _.forEach(['l', 'r'], function (horiz) {\n if (horiz === 'r') {\n adjustedLayering = _.map(adjustedLayering, function (inner) {\n return _.values(inner).reverse();\n });\n }\n\n var neighborFn = (vert === 'u' ? g.predecessors : g.successors).bind(g);\n var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n var xs = horizontalCompaction(g, adjustedLayering, align.root, align.align, horiz === 'r');\n if (horiz === 'r') {\n xs = _.mapValues(xs, function (x) {\n return -x;\n });\n }\n xss[vert + horiz] = xs;\n });\n });\n\n var smallestWidth = findSmallestWidthAlignment(g, xss);\n alignCoordinates(xss, smallestWidth);\n return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n return function (g, v, w) {\n var vLabel = g.node(v);\n var wLabel = g.node(w);\n var sum = 0;\n var delta;\n\n sum += vLabel.width / 2;\n if (_.has(vLabel, 'labelpos')) {\n switch (vLabel.labelpos.toLowerCase()) {\n case 'l':\n delta = -vLabel.width / 2;\n break;\n case 'r':\n delta = vLabel.width / 2;\n break;\n }\n }\n if (delta) {\n sum += reverseSep ? delta : -delta;\n }\n delta = 0;\n\n sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n sum += wLabel.width / 2;\n if (_.has(wLabel, 'labelpos')) {\n switch (wLabel.labelpos.toLowerCase()) {\n case 'l':\n delta = wLabel.width / 2;\n break;\n case 'r':\n delta = -wLabel.width / 2;\n break;\n }\n }\n if (delta) {\n sum += reverseSep ? delta : -delta;\n }\n delta = 0;\n\n return sum;\n };\n}\n\nfunction width(g, v) {\n return g.node(v).width;\n}\n","import 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"],"names":["$parcel$export","e","n","v","s","Object","defineProperty","get","set","enumerable","configurable","parcelRequire","$parcel$global","globalThis","parcelRegister","register","module","exports","$8b983041106799ba$export$2e2bcd8739ae039","$exqIp","$lvgV1","$fAzJF","$ceNjR","$8b983041106799ba$var$objectProto","prototype","$8b983041106799ba$var$hasOwnProperty","hasOwnProperty","default","object","sources","index","length","guard","undefined","source","props","propsIndex","propsLength","key","value","call","layout","$45287e600870bec4$export$889ea624f2cb2c57","$45287e600870bec4$export$21f930c44940fd98","$fpekr","$8XLqy","$5GUsF","$2IgCr","g","fas","stack","visited","graph","acyclicer","greedyFAS","edge","weight","nodes","dfs","outEdges","w","push","label","removeEdge","forwardName","name","reversed","setEdge","edges","$424cac0c9e4294df$export$2e2bcd8739ae039","$1fnxW","$424cac0c9e4294df$var$idCounter","prefix","id","$1f9c95063efba538$export$b96a088aeac42554","$5Oe6X","$0MuaS","$3kePu","$jJJbn","$4LkSm","$dWsTS","$1f9c95063efba538$var$DEFAULT_WEIGHT_FN","weightFn","nodeCount","fasGraph","maxIn","maxOut","buckets","zeroIdx","state","Graph","setNode","in","out","prevWeight","Math","max","node","map","List","$1f9c95063efba538$var$assignBucket","results","$1f9c95063efba538$var$doGreedyFAS","entry","sinks","dequeue","$1f9c95063efba538$var$removeNode","i","concat","collectPredecessors","inEdges","uEntry","wEntry","removeNode","enqueue","$00259c72dfc3e307$export$2e2bcd8739ae039","$kQGD1","array","$26bebe30abf83879$export$2e2bcd8739ae039","$afgje","$dKmGr","$7dWrG","$hf0C9","collection","iteratee","func","$5427155e39bdb121$export$2e2bcd8739ae039","$irzyZ","$lAOUf","result","Array","$e5e5449c5f030dea$export$2e2bcd8739ae039","$aDTIR","$7bf8c53fe06a5494$export$2e2bcd8739ae039","$HXpAz","$7exj4","fromRight","start","end","step","$08421a328cc62c0e$export$2e2bcd8739ae039","$08421a328cc62c0e$var$nativeCeil","ceil","$08421a328cc62c0e$var$nativeMax","$5443ad2f6d2956e1$export$2e2bcd8739ae039","$1fkDi","$5443ad2f6d2956e1$var$INFINITY","sign","$0e87326299eb9bb7$export$2e2bcd8739ae039","$8N45u","$iYDsF","$1WN0o","$0e87326299eb9bb7$var$NAN","$0e87326299eb9bb7$var$reIsBadHex","$0e87326299eb9bb7$var$reIsBinary","$0e87326299eb9bb7$var$reIsOctal","$0e87326299eb9bb7$var$freeParseInt","parseInt","other","valueOf","isBinary","test","slice","$66661208b19b5b1b$export$2e2bcd8739ae039","$iu14O","$66661208b19b5b1b$var$reTrimStart","string","replace","$d74bdd257728cf90$export$2e2bcd8739ae039","$d74bdd257728cf90$var$reWhitespace","charAt","$a2671c21c143d066$export$54c2e3dc7acea9f5","constructor","sentinel","_next","_prev","_sentinel","$a2671c21c143d066$var$unlink","toString","strs","curr","JSON","stringify","$a2671c21c143d066$var$filterOutLinks","join","k","$3158503efcc7eabf$export$b3219800bda33a1f","$bZ3BC","$ke5ip","$hnngZ","$jPETu","$gocXo","$3mNDi","$dQ1Uz","$1OyGc","$5W7Tz","$hYbQT","$5kKE0","$3EZuT","$6B9pM","$52JBL","$2Zs6a","$f1L0M","opts","time","debugTiming","notime","layoutGraph","multigraph","compound","$3158503efcc7eabf$var$canonicalize","inputGraph","setGraph","$3158503efcc7eabf$var$graphDefaults","$3158503efcc7eabf$var$selectNumberAttrs","$3158503efcc7eabf$var$graphNumAttrs","$3158503efcc7eabf$var$graphAttrs","$3158503efcc7eabf$var$nodeNumAttrs","$3158503efcc7eabf$var$nodeDefaults","setParent","parent","$3158503efcc7eabf$var$edgeDefaults","$3158503efcc7eabf$var$edgeNumAttrs","$3158503efcc7eabf$var$edgeAttrs","ranksep","minlen","labelpos","toLowerCase","rankdir","width","labeloffset","height","selfEdges","run","rank","asNonCompoundGraph","addDummyNode","removeEmptyRanks","cleanup","normalizeRanks","maxRank","borderTop","minRank","borderBottom","dummy","labelRank","parentDummyChains","addBorderSegments","order","layers","buildLayerMatrix","layer","orderShift","selfEdge","adjust","position","selfNode","x","y","dx","dy","points","children","t","b","l","borderLeft","r","borderRight","abs","undo","$3158503efcc7eabf$var$translateGraph","minX","Number","POSITIVE_INFINITY","maxX","minY","maxY","graphLabel","marginX","marginx","marginY","marginy","getExtremes","attrs","h","min","p","p1","p2","nodeV","nodeW","unshift","intersectRect","reverse","inputLabel","layoutLabel","edgesep","nodesep","obj","newAttrs","$eb99391fe11a02ac$export$2e2bcd8739ae039","$ca66a3307a349412$export$2e2bcd8739ae039","$dLTlW","$by0Fh","$e70280743e49d50c$export$2e2bcd8739ae039","$eZV2H","$gnSnX","$jSR8v","$aeb302a85511f1a9$export$2e2bcd8739ae039","comparator","current","computed","$bed8fb20d4c2db18$export$2e2bcd8739ae039","$2739ed381fef7da3$export$2e2bcd8739ae039","$5bi5n","$1GImM","paths","$3c5c0241c32418e2$export$2e2bcd8739ae039","$VRtgP","$cMLDw","path","$0adecd3b9d26ca68$export$2e2bcd8739ae039","$foHRp","$izsU2","$dUJCp","predicate","$d851ea62f3bb6942$export$2e2bcd8739ae039","$a6l6i","$cBYZY","$ft2bY","customizer","lastIndex","nested","newValue","objValue","$13ac20f2e48b583b$export$2e2bcd8739ae039","$dQSON","$3CD6d","$a1319d4066c504fa$export$9a52541ba49edb51","$a1319d4066c504fa$var$addBorderNode","prop","sg","sgNode","prev","borderType","$af0b6a829cfb7836$export$ecf34c2268abf7a0","$af0b6a829cfb7836$export$798b53621063651","$af0b6a829cfb7836$export$556dc3686e4a2bd5","$af0b6a829cfb7836$export$4a227323f5de0b79","$af0b6a829cfb7836$export$aca89c9d4c6bb8ae","$af0b6a829cfb7836$export$5747adf39cbd8007","$af0b6a829cfb7836$export$45a0c732a9a44b01","$af0b6a829cfb7836$export$6589834e22e3d497","$af0b6a829cfb7836$export$978bfc7f0ad7d28e","$af0b6a829cfb7836$export$b29f828819edca8d","$af0b6a829cfb7836$export$2da9be4cfdb689b1","$af0b6a829cfb7836$export$7f2cf532350145c2","$1G4S6","$j8eVr","$2OtHx","type","hasNode","simplified","simpleLabel","isMultigraph","rect","point","sx","sy","Error","layering","offset","delta","nodeRankFactor","vs","arguments","fn","lhs","rhs","console","log","$deda578ace4dc0e8$export$2e2bcd8739ae039","$8cZoy","$5f9f118206a36d13$export$2e2bcd8739ae039","$20c74a585cb2c860$export$2e2bcd8739ae039","$2mpFt","Date","now","$954d07441109d999$export$2e2bcd8739ae039","$vN5jO","values","$05f8f89499e1b848$export$2e2bcd8739ae039","assignFunc","valsLength","$15255ca2b31f4778$export$2c0e788bcc82013","$15255ca2b31f4778$export$21f930c44940fd98","rankDir","$15255ca2b31f4778$var$swapWidthHeight","$15255ca2b31f4778$var$reverseYOne","$15255ca2b31f4778$var$swapXYOne","$15255ca2b31f4778$var$swapWidthHeightOne","$d1513bd9b055ab2b$export$889ea624f2cb2c57","$d1513bd9b055ab2b$export$21f930c44940fd98","dummyChains","$d1513bd9b055ab2b$var$normalizeEdge","vRank","wRank","edgeLabel","edgeObj","origLabel","successors","$3e2300910289dc63$export$fbc8bcd33b574fbc","$9PJbm","$V5im8","$3L0R5","ranker","networkSimplex","longestPath","feasibleTree","$3e2300910289dc63$var$longestPathRanker","$728becbbb3e82c30$export$1d03f990b5f20c77","$iNbrh","directed","size","$728becbbb3e82c30$var$tightTree","nodeEdges","edgeV","slack","$728becbbb3e82c30$var$findMinSlackEdge","$728becbbb3e82c30$var$shiftRanks","$dae5ad21c0542277$export$2e2bcd8739ae039","$2bc66cb5f642877e$export$cebe150c9dd2da2e","$2bc66cb5f642877e$export$3748e8b0e9529e9c","$0ab96e79c32fe409$export$fb928ed1fa9faa94","$dCscT","$5ILgR","$9THt7","$2dR5Z","simplify","f","$0ab96e79c32fe409$var$initLowLimValues","$0ab96e79c32fe409$var$initCutValues","$0ab96e79c32fe409$var$leaveEdge","$0ab96e79c32fe409$var$enterEdge","$0ab96e79c32fe409$var$exchangeEdges","postorder","childLab","cutvalue","$0ab96e79c32fe409$var$calcCutValue","child","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","tree","hasEdge","otherCutValue","root","$0ab96e79c32fe409$var$dfsAssignLowLim","nextLim","low","neighbors","lim","vLabel","wLabel","tailLabel","flip","candidates","$0ab96e79c32fe409$var$isDescendant","preorder","flipped","rootLabel","initLowLimValues","initCutValues","calcCutValue","leaveEdge","enterEdge","exchangeEdges","$42a5bada1896155c$export$2e2bcd8739ae039","$hw3Be","$f58Tb","$cc08379f7dd918be$export$2e2bcd8739ae039","$8krEv","findIndexFunc","fromIndex","iterable","$afae37cffa73d900$export$2e2bcd8739ae039","$38tNx","$bj7KL","$afae37cffa73d900$var$nativeMax","$83b77baf04e9e448$export$2e2bcd8739ae039","remainder","$c4c36c1db290d6a3$export$1c27361af35e8f2","$1DJGF","$c4c36c1db290d6a3$var$DEFAULT_WEIGHT_FUNC","edgeFn","$c4c36c1db290d6a3$var$runDijkstra","vEntry","pq","PriorityQueue","updateNeighbors","distance","predecessor","decrease","forEach","add","removeMin","String","$131cdf7fbce3b76c$export$8fbd1ac8e83536df","_arr","_keyIndices","keys","has","priority","keyIndices","arr","_decrease","_swap","pop","_heapify","largest","j","origArrI","origArrJ","$0b05e9301ac69f0a$export$2e2bcd8739ae039","$iDECW","$kgBRQ","$bzIQZ","$f3ZL4","$4VY3C","$cmTeE","accumulator","isArr","isArrLike","Ctor","$f9e9b157625df8b9$export$5f156e41c20211e5","onStack","lowlink","cmpt","$1080e9cdf0705b36$export$ddfa0f9cd705ef1d","$1080e9cdf0705b36$export$7dcd3b9aab51459f","$bW5IJ","visit","predecessors","CycleException","$8b098c6faba091ff$export$2e2bcd8739ae039","$lTyg4","$4wkSQ","$7icKW","$2GC4v","tag","$54f41bee1f651fc5$export$2e2bcd8739ae039","$hArsG","$f2iog","$1f4d093e1a7ac82a$export$2e2bcd8739ae039","$j4vlp","$6MCUi","$7uinB","$de26b4631f43a8da$export$2e2bcd8739ae039","$7cEkV","$4f0567e72dd9ce2b$export$2e2bcd8739ae039","$4f0567e72dd9ce2b$var$reHasUnicode","RegExp","$57399790778a3f2c$export$2e2bcd8739ae039","$57399790778a3f2c$var$rsAstralRange","$57399790778a3f2c$var$rsCombo","$57399790778a3f2c$var$rsFitz","$57399790778a3f2c$var$rsNonAstral","$57399790778a3f2c$var$rsRegional","$57399790778a3f2c$var$rsSurrPair","$57399790778a3f2c$var$reOptMod","$57399790778a3f2c$var$rsModifier","$57399790778a3f2c$var$rsOptVar","$57399790778a3f2c$var$rsOptJoin","$57399790778a3f2c$var$reUnicode","$734af81b3dd83e48$export$8d8ae0f94ad35db2","$4O4ag","$37ff0fecd38a7e49$export$51b654aff22fc5a6","navigation","isDirected","bind","acc","$37ff0fecd38a7e49$var$doDfs","$19e5fb5f9afeebc5$export$48e957eb03fa4375","$2aa4cf987bc3158d$export$889ea624f2cb2c57","$2aa4cf987bc3158d$export$de863c629cb9919d","$hwphU","$7pPNr","depths","depth","nodeSep","nestingRoot","$2aa4cf987bc3158d$var$dfs","top","addBorderNode","bottom","childNode","childTop","childBottom","thisWeight","nestingEdge","$4cdd8060e8415f4c$export$aaaeab0fac9a3ccb","$chB0Q","$Kq5UN","$lmSbe","$66uKz","$h2A8Y","$2sKV1","downLayerGraphs","$4cdd8060e8415f4c$var$buildLayerGraphs","upLayerGraphs","initOrder","$4cdd8060e8415f4c$var$assignOrder","best","bestCC","lastBest","$4cdd8060e8415f4c$var$sweepLayerGraphs","layerGraphs","biasRight","cg","lg","sorted","sortSubgraph","addSubgraphConstraints","cc","crossCount","ranks","relationship","buildLayerGraph","$8f13c87c1500733f$export$2e2bcd8739ae039","$gbpSA","$8f13c87c1500733f$var$CLONE_DEEP_FLAG","$08b889cc3a701783$export$def0b5ae5036962c","rootPrev","prevChild","$f8e5ae1d417223a6$export$eeb2d75ed1ad428","$f8e5ae1d417223a6$var$createRootNode","setDefaultNodeLabel","u","$471b27f1b12e0017$export$4487b4ec3754a783","$aJn7S","$cOIXs","$471b27f1b12e0017$var$twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","pos","firstIndex","treeSize","weightSum","$7d000bb06f6c7a0a$export$2e2bcd8739ae039","$l9F4I","iteratees","$03f974da62a26b46$export$2e2bcd8739ae039","$eJHHQ","$hb0cD","$b9TPS","orders","$aba72bca88e8fb79$export$2e2bcd8739ae039","comparer","sort","$81fbd8ca42830c28$export$2e2bcd8739ae039","$6KvMf","objCriteria","criteria","othCriteria","ordersLength","$4e9fb044178c3f3f$export$2e2bcd8739ae039","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","$c67ea8fa93554a8b$export$a68885affb54ae0d","simpleNodes","orderedVs","$1cb2975d8a9eba46$export$734a84c77ae2f1e","movable","bl","br","subgraphs","barycenters","$5llzi","barycenter","subgraphResult","target","entries","$foFJO","resolveConflicts","$JV5Uw","blPred","brPred","$3e3fa4ea881c8767$export$d54b347d68b9b5f6","inV","nodeU","sum","$b3597929e0686675$export$51b8c24513c4c069","mappedEntries","tmp","indegree","entryV","entryW","$b3597929e0686675$var$doResolveConflicts","sourceSet","handleIn","merged","$b3597929e0686675$var$mergeEntries","handleOut","$08a07dd455ab8f48$export$97db5808d8f88186","bias","parts","partition","sortable","unsortable","vsIndex","$08a07dd455ab8f48$var$consumeUnsortable","last","$3ac084799c1612da$export$f30289267ab03372","postorderNums","pathData","$3ac084799c1612da$var$findPath","lca","vPath","wPath","pathIdx","pathV","ascending","$22d7130df25c1ba9$export$5880b8b5730aff45","$jqi0W","$edbDb","rankSep","prevY","maxHeight","positionX","$e23e6b41153e0f0e$export$2e2bcd8739ae039","$lmrTu","$a58b4d4563904306$export$ec3af212ec314f01","$amOD8","$a58b4d4563904306$export$d6a30e6c78fac74","conflicts","conflictsV","alignToVals","alignToMin","alignToMax","align","adjustedLayering","prevLayer","k0","scanPos","prevLayerLength","lastNode","$a58b4d4563904306$var$findOtherInnerSegmentNode","k1","scanNode","uLabel","uPos","$a58b4d4563904306$export$f384d2f2a62cea4b","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","xss","vert","horiz","inner","neighborFn","prevIdx","ws","mp","floor","il","$a58b4d4563904306$export$76734886d09d2999","xs","$a58b4d4563904306$export$40e1a979a22b42db","reverseSep","edgeSep","blockGraph","sepFn","blockG","vRoot","uRoot","prevMax","iterate","setXsFunc","nextNodesFunc","elem","reduce","smallestWidth","NEGATIVE_INFINITY","halfWidth","alignment","xsVals","ul","ignore","$78c33b948be66cbe$export$2e2bcd8739ae039","$RlazS"],"version":3,"file":"flowDiagram-b222e15a.19e32f11.js.map"}
