@next-bricks/ai-portal 0.20.13 → 0.21.0

package/dist/chunks/2312.776924b8.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"chunks/2312.776924b8.js","mappings":";4IAEA,IACIA,EADW,EAAQ,OACIA,YACvBC,EAAe,EAAQ,OACvBC,EAAiB,EAAQ,OAE7BC,EAAOC,QAqBP,SAAcC,GACZ,OAAOA,EAAEC,QAAQC,QACjB,IAAK,kBAGL,SAYF,SAA8BF,GAC5BH,EAAeG,EACjB,CAdWG,CAAqBH,SAF9B,IAAK,cASP,SAAyBA,GACvBL,EAAYK,GACZJ,EAAaI,EACf,CAZqBI,CAAgBJ,GAAI,MACvC,IAAK,eAAgBK,EAAkBL,GAGzC,EAGA,IAAIK,EAAoBV,mECIxB,MAcMW,EAAoCC,IACxC,IAAI,iBACFC,EAAgB,UAChBC,EAAS,wBACTC,GACEH,EACJ,MAAMI,EAA8BD,EAAwB,GAE5D,OAAKF,GAAqBG,EAzC5B,SAAgCF,EAAWG,EAAMC,GAC/C,MAAMC,EAAQ,IAAKL,GAenB,OAZIG,EAAKG,IAAMN,EAAUO,GAAKH,EAAaE,IACzCD,EAAME,EAAIH,EAAaE,IAAMH,EAAKG,IACzBH,EAAKK,OAASR,EAAUO,GAAKH,EAAaE,IAAMF,EAAaK,SACtEJ,EAAME,EAAIH,EAAaE,IAAMF,EAAaK,OAASN,EAAKK,QAGtDL,EAAKO,KAAOV,EAAUW,GAAKP,EAAaM,KAC1CL,EAAMM,EAAIP,EAAaM,KAAOP,EAAKO,KAC1BP,EAAKS,MAAQZ,EAAUW,GAAKP,EAAaM,KAAON,EAAaS,QACtER,EAAMM,EAAIP,EAAaM,KAAON,EAAaS,MAAQV,EAAKS,OAGnDP,CACT,CA4BSS,CAAuBd,EAAWD,EAAkBG,GAHlDF,CAG8E,EAGnFe,EAAyBjB,IAC7B,IAAI,UACFE,GACEF,EACJ,MAAO,IAAKE,EACVW,EAAG,EACJ,kBC7EH,IAAIK,EAAO,EAAQ,OA2BnB,SAASC,EAAc1B,EAAG2B,EAAMC,EAAQC,EAAIC,EAAQC,GAClD,IAAIC,EAAQ,CAAEV,MAAO,EAAGJ,OAAQ,EAAGa,KAAMA,EAAME,WAAYN,GACvDO,EAAOJ,EAAOH,GAAMI,EAAO,GAC3BI,EAAOV,EAAKW,aAAapC,EAAG,SAAUgC,EAAOJ,GACjDE,EAAOH,GAAMI,GAAQI,EACrBnC,EAAEqC,UAAUF,EAAMN,GACdK,GACFlC,EAAEsC,QAAQJ,EAAMC,EAAM,CAAEI,OAAQ,GAEpC,CAlCAzC,EAAOC,QAEP,SAA2BC,GAoBzBA,EAAEwC,WAAWC,SAnBb,SAASC,EAAIC,GACX,IAAIH,EAAWxC,EAAEwC,SAASG,GACtBC,EAAO5C,EAAE4C,KAAKD,GAKlB,GAJIH,EAASK,QACXL,EAASC,QAAQC,GAGfE,EAAKE,eAAe,WAAY,CAClCF,EAAKG,WAAa,GAClBH,EAAKI,YAAc,GACnB,IAAK,IAAIjB,EAAOa,EAAKK,QAASC,EAAUN,EAAKM,QAAU,EACrDnB,EAAOmB,IACLnB,EACFL,EAAc1B,EAAG,aAAc,MAAO2C,EAAGC,EAAMb,GAC/CL,EAAc1B,EAAG,cAAe,MAAO2C,EAAGC,EAAMb,EAEpD,CACF,GAGF,+BCvBA,IAAIoB,EAAQ,eACR1B,EAAO,EAAQ,OAqCnB,SAAS2B,EAAmBpD,EAAGqD,GAC7B,IAAIC,EAAY,CAAC,EAsCjB,OAFAD,EAASR,QAAUQ,EAASE,QAlC5B,SAAoBC,EAAWC,GAC7B,IAGEC,EAAK,EAGLC,EAAU,EACVC,EAAkBJ,EAAUX,OAC5BgB,EAAWJ,EAAMA,EAAMZ,OAAS,GAsBlC,OApBAY,EAAMhB,SAAQ,CAACE,EAAGmB,KAChB,IAAIC,EAyEV,SAAmC/D,EAAG2C,GACpC,GAAI3C,EAAE4C,KAAKD,GAAGqB,MACZ,OAAOhE,EAAEiE,aAAatB,GAAGuB,MAAKC,GAAKnE,EAAE4C,KAAKuB,GAAGH,OAEjD,CA7EcI,CAA0BpE,EAAG2C,GACnC0B,EAAKN,EAAI/D,EAAE4C,KAAKmB,GAAGO,MAAQV,GAEzBG,GAAKpB,IAAMkB,KACbJ,EAAMc,MAAMZ,EAASG,EAAE,GAAGrB,SAAQ+B,IAChCxE,EAAEiE,aAAaO,GAAU/B,SAAQ0B,IAC/B,IAAIM,EAASzE,EAAE4C,KAAKuB,GAClBO,EAAOD,EAAOH,QACXI,EAAOhB,GAAMW,EAAKK,IACjBD,EAAOT,OAAShE,EAAE4C,KAAK4B,GAAUR,OACrCW,EAAYrB,EAAWa,EAAGK,EAC5B,GACA,IAEJb,EAAUG,EAAI,EACdJ,EAAKW,EACP,IAGKZ,CACT,IAIOH,CACT,CAEA,SAASsB,EAAmB5E,EAAGqD,GAC7B,IAAIC,EAAY,CAAC,EAEjB,SAASuB,EAAKC,EAAOC,EAAUC,EAAUC,EAAiBC,GACxD,IAAIvC,EACJlB,EAAK0D,MAAMJ,EAAUC,GAAUvC,SAAQqB,IACrCnB,EAAImC,EAAMhB,GACN9D,EAAE4C,KAAKD,GAAGqB,OACZhE,EAAEiE,aAAatB,GAAGF,SAAQ0B,IACxB,IAAIiB,EAAQpF,EAAE4C,KAAKuB,GACfiB,EAAMpB,QACLoB,EAAMd,MAAQW,GAAmBG,EAAMd,MAAQY,IAClDP,EAAYrB,EAAWa,EAAGxB,EAC5B,GAEJ,GAEJ,CA0BA,OAFAU,EAASR,QAAUQ,EAASE,QArB5B,SAAoB8B,EAAOP,GACzB,IACEQ,EADEC,GAAgB,EAElBR,EAAW,EAeb,OAbAD,EAAMrC,SAAQ,CAACE,EAAG6C,KAChB,GAAwB,WAApBxF,EAAE4C,KAAKD,GAAGqB,MAAoB,CAChC,IAAIC,EAAejE,EAAEiE,aAAatB,GAC9BsB,EAAapB,SACfyC,EAAetF,EAAE4C,KAAKqB,EAAa,IAAIK,MACvCO,EAAKC,EAAOC,EAAUS,EAAgBD,EAAcD,GACpDP,EAAWS,EACXD,EAAeD,EAEnB,CACAT,EAAKC,EAAOC,EAAUD,EAAMjC,OAAQyC,EAAcD,EAAMxC,OAAO,IAG1DiC,CACT,IAIOxB,CACT,CAQA,SAASqB,EAAYrB,EAAWX,EAAGoB,GACjC,GAAIpB,EAAIoB,EAAG,CACT,IAAI0B,EAAM9C,EACVA,EAAIoB,EACJA,EAAI0B,CACN,CAEA,IAAIC,EAAapC,EAAUX,GACtB+C,IACHpC,EAAUX,GAAK+C,EAAa,CAAC,GAE/BA,EAAW3B,IAAK,CAClB,CAEA,SAAS4B,EAAYrC,EAAWX,EAAGoB,GACjC,GAAIpB,EAAIoB,EAAG,CACT,IAAI0B,EAAM9C,EACVA,EAAIoB,EACJA,EAAI0B,CACN,CACA,QAASnC,EAAUX,IAAMW,EAAUX,GAAGG,eAAeiB,EACvD,CAUA,SAAS6B,EAAkB5F,EAAGqD,EAAUC,EAAWuC,GACjD,IAAIC,EAAO,CAAC,EACVC,EAAQ,CAAC,EACTC,EAAM,CAAC,EAkCT,OA7BA3C,EAASZ,SAAQgB,IACfA,EAAMhB,SAAQ,CAACE,EAAG2B,KAChBwB,EAAKnD,GAAKA,EACVoD,EAAMpD,GAAKA,EACXqD,EAAIrD,GAAK2B,CAAK,GACd,IAGJjB,EAASZ,SAAQgB,IACf,IAAIwC,GAAW,EACfxC,EAAMhB,SAAQE,IACZ,IAAIuD,EAAKL,EAAWlD,GACpB,GAAIuD,EAAGrD,OAAQ,CACbqD,EAAKA,EAAGC,MAAK,CAACC,EAAGC,IAAML,EAAII,GAAKJ,EAAIK,KACpC,IAAIC,GAAMJ,EAAGrD,OAAS,GAAK,EAC3B,IAAK,IAAIiB,EAAIyC,KAAKC,MAAMF,GAAKG,EAAKF,KAAKG,KAAKJ,GAAKxC,GAAK2C,IAAM3C,EAAG,CAC7D,IAAIC,EAAImC,EAAGpC,GACPiC,EAAMpD,KAAOA,GACbsD,EAAUD,EAAIjC,KACb4B,EAAYrC,EAAWX,EAAGoB,KAC7BgC,EAAMhC,GAAKpB,EACXoD,EAAMpD,GAAKmD,EAAKnD,GAAKmD,EAAK/B,GAC1BkC,EAAUD,EAAIjC,GAElB,CACF,IACA,IAGG,CAAE+B,KAAMA,EAAMC,MAAOA,EAC9B,CAEA,SAASY,EAAqB3G,EAAGqD,EAAUyC,EAAMC,EAAOa,GAMtD,IAAIC,EAAK,CAAC,EACRC,EAiDJ,SAAyB9G,EAAGqD,EAAUyC,EAAMc,GAC1C,IAAIG,EAAa,IAAI5D,EACnB6D,EAAahH,EAAEC,QACfgH,EAuHJ,SAAaC,EAASC,EAASP,GAC7B,MAAO,CAAC5G,EAAG2C,EAAGoB,KACZ,IAGIqD,EAHAC,EAASrH,EAAE4C,KAAKD,GAChB2E,EAAStH,EAAE4C,KAAKmB,GAChBwD,EAAM,EAIV,GADAA,GAAOF,EAAO/F,MAAQ,EAClB+F,EAAOvE,eAAe,YACxB,OAAQuE,EAAOG,SAASC,eACxB,IAAK,IAAKL,GAASC,EAAO/F,MAAQ,EAAG,MACrC,IAAK,IAAK8F,EAAQC,EAAO/F,MAAQ,EAYnC,GATI8F,IACFG,GAAOX,EAAaQ,GAASA,GAE/BA,EAAQ,EAERG,IAAQF,EAAOrD,MAAQmD,EAAUD,GAAW,EAC5CK,IAAQD,EAAOtD,MAAQmD,EAAUD,GAAW,EAE5CK,GAAOD,EAAOhG,MAAQ,EAClBgG,EAAOxE,eAAe,YACxB,OAAQwE,EAAOE,SAASC,eACxB,IAAK,IAAKL,EAAQE,EAAOhG,MAAQ,EAAG,MACpC,IAAK,IAAK8F,GAASE,EAAOhG,MAAQ,EAQpC,OALI8F,IACFG,GAAOX,EAAaQ,GAASA,GAE/BA,EAAQ,EAEDG,CAAG,CAEd,CA3JYG,CAAIV,EAAWW,QAASX,EAAWY,QAAShB,GAgBtD,OAdAvD,EAASZ,SAAQgB,IACf,IAAIU,EACJV,EAAMhB,SAAQE,IACZ,IAAIkF,EAAQ/B,EAAKnD,GAEjB,GADAoE,EAAWe,QAAQD,GACf1D,EAAG,CACL,IAAI4D,EAAQjC,EAAK3B,GACf6D,EAAUjB,EAAWkB,KAAKF,EAAOF,GACnCd,EAAWzE,QAAQyF,EAAOF,EAAOtB,KAAK2B,IAAIjB,EAAMjH,EAAG2C,EAAGwB,GAAI6D,GAAW,GACvE,CACA7D,EAAIxB,CAAC,GACL,IAGGoE,CACT,CArEaoB,CAAgBnI,EAAGqD,EAAUyC,EAAMc,GAC5C3E,EAAa2E,EAAa,aAAe,cAE3C,SAASwB,EAAQC,EAAWC,GAC1B,IAAIC,EAAQzB,EAAO0B,QACfC,EAAOF,EAAMG,MACbC,EAAU,CAAC,EACf,KAAOF,GACDE,EAAQF,GACVJ,EAAUI,IAEVE,EAAQF,IAAQ,EAChBF,EAAMK,KAAKH,GACXF,EAAQA,EAAMM,OAAOP,EAAcG,KAGrCA,EAAOF,EAAMG,KAEjB,CA2BA,OANAN,GAlBA,SAAeK,GACb5B,EAAG4B,GAAQ3B,EAAOgC,QAAQL,GAAMlF,QAAO,CAACwF,EAAKC,IACpCzC,KAAK2B,IAAIa,EAAKlC,EAAGmC,EAAErG,GAAKmE,EAAOmB,KAAKe,KAC1C,EACL,GAcelC,EAAO7C,aAAagF,KAAKnC,IACxCsB,GAZA,SAAeK,GACb,IAAIS,EAAMpC,EAAOqC,SAASV,GAAMlF,QAAO,CAACwF,EAAKC,IACpCzC,KAAK2C,IAAIH,EAAKlC,EAAGmC,EAAEjF,GAAK+C,EAAOmB,KAAKe,KAC1CI,OAAOC,mBAENzG,EAAO5C,EAAE4C,KAAK6F,GACdS,IAAQE,OAAOC,mBAAqBzG,EAAKX,aAAeA,IAC1D4E,EAAG4B,GAAQlC,KAAK2B,IAAIrB,EAAG4B,GAAOS,GAElC,GAGepC,EAAOwC,WAAWL,KAAKnC,IAGtCyC,OAAOC,KAAKzD,GAAOtD,SAAQE,GAAKkE,EAAGlE,GAAKkE,EAAGf,EAAKnD,MAEzCkE,CACT,CA4BA,SAAS4C,EAA2BzJ,EAAG0J,GACrC,OAAOH,OAAOI,OAAOD,GAAKnG,QAAO,CAACqG,EAAiB/C,KACjD,IAAIqB,EAAMkB,OAAOS,kBACbX,EAAME,OAAOC,kBAEjBE,OAAOO,QAAQjD,GAAIpE,SAAQ,EAAEE,EAAGvB,MAC9B,IAAI2I,EAiIV,SAAe/J,EAAG2C,GAChB,OAAO3C,EAAE4C,KAAKD,GAAGrB,KACnB,CAnIsBA,CAAMtB,EAAG2C,GAAK,EAE9BuF,EAAM3B,KAAK2B,IAAI9G,EAAI2I,EAAW7B,GAC9BgB,EAAM3C,KAAK2C,IAAI9H,EAAI2I,EAAWb,EAAI,IAGpC,MAAMc,EAAS9B,EAAMgB,EAIrB,OAHIc,EAASJ,EAAgB,KAC3BA,EAAkB,CAACI,EAAQnD,IAEtB+C,CAAe,GACrB,CAACR,OAAOC,kBAAmB,OAAO,EACvC,CASA,SAASY,EAAiBP,EAAKQ,GAC7B,IAAIC,EAAcZ,OAAOI,OAAOO,GAC9BE,EAAa7D,KAAK2C,OAAOiB,GACzBE,EAAa9D,KAAK2B,OAAOiC,GAE3B,CAAC,IAAK,KAAK1H,SAAQ6H,IACjB,CAAC,IAAK,KAAK7H,SAAQ8H,IACjB,IAAIC,EAAYF,EAAOC,EACrB1D,EAAK6C,EAAIc,GAEX,GAAI3D,IAAOqD,EAAS,OAEpB,IAAIO,EAASlB,OAAOI,OAAO9C,GACvBO,EAAQgD,EAAa7D,KAAK2C,OAAOuB,GACvB,MAAVF,IACFnD,EAAQiD,EAAa9D,KAAK2B,OAAOuC,IAG/BrD,IACFsC,EAAIc,GAAa/I,EAAKiJ,UAAU7D,GAAIzF,GAAKA,EAAIgG,IAC/C,GACA,GAEN,CAEA,SAASuD,EAAQjB,EAAK3D,GACpB,OAAOtE,EAAKiJ,UAAUhB,EAAIkB,IAAI,CAACC,EAAKlI,KAClC,GAAIoD,EACF,OAAO2D,EAAI3D,EAAM0B,eAAe9E,GAC3B,CACL,IAAIkE,EAAK0C,OAAOI,OAAOD,GAAKoB,KAAIjE,GAAMA,EAAGlE,KAAIwD,MAAK,CAACC,EAAGC,IAAMD,EAAIC,IAChE,OAAQQ,EAAG,GAAKA,EAAG,IAAM,CAC3B,IAEJ,CAjVA/G,EAAOC,QAAU,CACfgL,UAkVF,SAAmB/K,GACjB,IAMIgL,EANA3H,EAAW5B,EAAKwJ,iBAAiBjL,GACjCsD,EAAYiG,OAAO2B,OACrB9H,EAAmBpD,EAAGqD,GACtBuB,EAAmB5E,EAAGqD,IAEpBqG,EAAM,CAAC,EAEX,CAAC,IAAK,KAAKjH,SAAQ6H,IACjBU,EAA4B,MAATV,EAAejH,EAAWkG,OAAOI,OAAOtG,GAAU8H,UACrE,CAAC,IAAK,KAAK1I,SAAQ8H,IACH,MAAVA,IACFS,EAAmBA,EAAiBF,KAAIM,GAC/B7B,OAAOI,OAAOyB,GAAOD,aAIhC,IAAItF,GAAuB,MAATyE,EAAetK,EAAEiE,aAAejE,EAAEsJ,YAAYL,KAAKjJ,GACjE+F,EAAQH,EAAkB5F,EAAGgL,EAAkB1H,EAAWuC,GAC1DgB,EAAKF,EAAqB3G,EAAGgL,EAC/BjF,EAAMD,KAAMC,EAAMA,MAAiB,MAAVwE,GACb,MAAVA,IACF1D,EAAKpF,EAAKiJ,UAAU7D,GAAIzF,IAAMA,KAEhCsI,EAAIY,EAAOC,GAAS1D,CAAE,GACtB,IAIJ,IAAIwE,EAAgB5B,EAA2BzJ,EAAG0J,GAElD,OADAO,EAAiBP,EAAK2B,GACfV,EAAQjB,EAAK1J,EAAEC,QAAQ8F,MAChC,EAjXE3C,mBAAoBA,EACpBwB,mBAAoBA,EACpBD,YAAaA,EACbgB,YAAaA,EACbC,kBAAmBA,EACnBe,qBAAsBA,EACtBsD,iBAAkBA,EAClBR,2BAA4BA,EAC5BkB,QAASA,oBCpBX,IAAIlJ,EAAO,EAAQ,OACf0B,EAAQ,eAEZrD,EAAOC,QAAU,CACfuL,cAIF,SAAuBtL,GACrB,IAAIuL,EAAc9J,EAAKwJ,iBAAiBjL,GAEpCwL,EAAI,IAAIrI,EAAM,CAAEsI,UAAU,EAAMC,YAAY,IAAQC,SAAS,CAAC,GAkBlE,OAhBA3L,EAAEwI,QAAQ/F,SAAQE,IAChB6I,EAAE1D,QAAQnF,EAAG,CAAEX,MAAOW,IACtB6I,EAAEnJ,UAAUM,EAAG,QAAU3C,EAAE4C,KAAKD,GAAGZ,KAAK,IAG1C/B,EAAE4L,QAAQnJ,SAAQuG,GAAKwC,EAAElJ,QAAQ0G,EAAErG,EAAGqG,EAAEjF,EAAG,CAAC,EAAGiF,EAAE6C,QAEjDN,EAAY9I,SAAQ,CAACgB,EAAOK,KAC1B,IAAIgI,EAAS,QAAUhI,EACvB0H,EAAE1D,QAAQgE,EAAQ,CAAE/J,KAAM,SAC1B0B,EAAMF,QAAO,CAACY,EAAGxB,KACf6I,EAAElJ,QAAQ6B,EAAGxB,EAAG,CAAEoJ,MAAO,UAClBpJ,IACP,IAGG6I,CACT,cCcA,SAASQ,EAAOC,GACdA,EAAMC,MAAMC,MAAQF,EAAME,MAC1BF,EAAME,MAAMD,MAAQD,EAAMC,aACnBD,EAAME,aACNF,EAAMC,KACf,CAEA,SAASE,EAAeC,EAAG1J,GACzB,GAAU,UAAN0J,GAAuB,UAANA,EACnB,OAAO1J,CAEX,CAEA7C,EAAOC,QApDP,MACE,WAAAuM,GACE,IAAIC,EAAW,CAAC,EAChBA,EAASJ,MAAQI,EAASL,MAAQK,EAClCC,KAAKC,UAAYF,CACnB,CAEA,OAAAG,GACE,IAAIH,EAAWC,KAAKC,UAChBR,EAAQM,EAASL,MACrB,GAAID,IAAUM,EAEZ,OADAP,EAAOC,GACAA,CAEX,CAEA,OAAAU,CAAQV,GACN,IAAIM,EAAWC,KAAKC,UAChBR,EAAMC,OAASD,EAAME,OACvBH,EAAOC,GAETA,EAAME,MAAQI,EAASJ,MACvBI,EAASJ,MAAMD,MAAQD,EACvBM,EAASJ,MAAQF,EACjBA,EAAMC,MAAQK,CAChB,CAEA,QAAAK,GACE,IAAIC,EAAO,GACPN,EAAWC,KAAKC,UAChBtK,EAAOoK,EAASL,MACpB,KAAO/J,IAASoK,GACdM,EAAKjE,KAAKkE,KAAKC,UAAU5K,EAAMiK,IAC/BjK,EAAOA,EAAK+J,MAEd,MAAO,IAAMW,EAAKG,KAAK,MAAQ,GACjC,cCzCFlN,EAAOC,QAEP,SAA2BC,GACzB,IAAIiN,EAoEN,SAAmBjN,GACjB,IAAIkN,EAAS,CAAC,EACVC,EAAM,EASV,OAFAnN,EAAEwC,WAAWC,SALb,SAASC,EAAIC,GACX,IAAIyK,EAAMD,EACVnN,EAAEwC,SAASG,GAAGF,QAAQC,GACtBwK,EAAOvK,GAAK,CAAEyK,IAAKA,EAAKD,IAAKA,IAC/B,IAGOD,CACT,CAhFsBG,CAAUrN,GAE9BA,EAAEC,QAAQqN,YAAY7K,SAAQE,IAC5B,IAAIC,EAAO5C,EAAE4C,KAAKD,GACd4K,EAAU3K,EAAK2K,QACfC,EAqCR,SAAkBxN,EAAGiN,EAAetK,EAAGoB,GACrC,IAII0J,EACAC,EALAC,EAAQ,GACRC,EAAQ,GACRR,EAAM7G,KAAK2C,IAAI+D,EAActK,GAAGyK,IAAKH,EAAclJ,GAAGqJ,KACtDD,EAAM5G,KAAK2B,IAAI+E,EAActK,GAAGwK,IAAKF,EAAclJ,GAAGoJ,KAK1DM,EAAS9K,EACT,GACE8K,EAASzN,EAAEyN,OAAOA,GAClBE,EAAM/E,KAAK6E,SACJA,IACCR,EAAcQ,GAAQL,IAAMA,GAAOD,EAAMF,EAAcQ,GAAQN,MAKzE,IAJAO,EAAMD,EAGNA,EAAS1J,GACD0J,EAASzN,EAAEyN,OAAOA,MAAaC,GACrCE,EAAMhF,KAAK6E,GAGb,MAAO,CAAEI,KAAMF,EAAM9E,OAAO+E,EAAMzC,WAAYuC,IAAKA,EACrD,CA7DmBI,CAAS9N,EAAGiN,EAAeM,EAAQ5K,EAAG4K,EAAQxJ,GACzD8J,EAAOL,EAASK,KAChBH,EAAMF,EAASE,IACfK,EAAU,EACVC,EAAQH,EAAKE,GACbE,GAAY,EAEhB,KAAOtL,IAAM4K,EAAQxJ,GAAG,CAGtB,GAFAnB,EAAO5C,EAAE4C,KAAKD,GAEVsL,EAAW,CACb,MAAQD,EAAQH,EAAKE,MAAcL,GAC5B1N,EAAE4C,KAAKoL,GAAO9K,QAAUN,EAAKb,MAClCgM,IAGEC,IAAUN,IACZO,GAAY,EAEhB,CAEA,IAAKA,EAAW,CACd,KAAOF,EAAUF,EAAKhL,OAAS,GACxB7C,EAAE4C,KAAKoL,EAAQH,EAAKE,EAAU,IAAI9K,SAAWL,EAAKb,MACvDgM,IAEFC,EAAQH,EAAKE,EACf,CAEA/N,EAAEqC,UAAUM,EAAGqL,GACfrL,EAAI3C,EAAEsJ,WAAW3G,GAAG,EACtB,IAEJ,aCzCA7C,EAAOC,QAEP,SAAgCC,EAAGkO,EAAIC,GACrC,IACEC,EADElM,EAAO,CAAC,EAGZiM,EAAG1L,SAAQE,IACT,IACE8K,EACAY,EAFEC,EAAQtO,EAAEyN,OAAO9K,GAGrB,KAAO2L,GAAO,CASZ,GARAb,EAASzN,EAAEyN,OAAOa,GACdb,GACFY,EAAYnM,EAAKuL,GACjBvL,EAAKuL,GAAUa,IAEfD,EAAYD,EACZA,EAAWE,GAETD,GAAaA,IAAcC,EAE7B,YADAJ,EAAG5L,QAAQ+L,EAAWC,GAGxBA,EAAQb,CACV,IA0BJ,mBClDA,IAAItK,EAAQ,EAAQ,OAChBoL,EAAgB,EAAQ,OAE5BzO,EAAOC,QAEP,SAAcC,EAAGwO,GACf,IAGI7L,EAHAuK,EAAS,IAAI/J,EACbsL,EAAU,CAAC,EACXC,EAAK,IAAIH,EAGb,SAASI,EAAgB1G,GACvB,IAAIlE,EAAIkE,EAAKtF,IAAMA,EAAIsF,EAAKlE,EAAIkE,EAAKtF,EACjCiM,EAAMF,EAAGG,SAAS9K,GACtB,QAAY+K,IAARF,EAAmB,CACrB,IAAIG,EAAaP,EAAWvG,GACxB8G,EAAaH,IACfH,EAAQ1K,GAAKpB,EACb+L,EAAGM,SAASjL,EAAGgL,GAEnB,CACF,CAEA,GAAsB,IAAlB/O,EAAEiP,YACJ,OAAO/B,EAGTlN,EAAEwI,QAAQ/F,SAAQ,SAASE,GACzB+L,EAAGQ,IAAIvM,EAAGyG,OAAOC,mBACjB6D,EAAOpF,QAAQnF,EACjB,IAGA+L,EAAGM,SAAShP,EAAEwI,QAAQ,GAAI,GAG1B,IADA,IAAI2G,GAAO,EACJT,EAAGU,OAAS,GAAG,CAEpB,GADAzM,EAAI+L,EAAGW,YACHZ,EAAQ3L,eAAeH,GACzBuK,EAAO5K,QAAQK,EAAG8L,EAAQ9L,QACrB,IAAIwM,EACT,MAAM,IAAIG,MAAM,iCAAmCtP,GAEnDmP,GAAO,CACT,CAEAnP,EAAEuP,UAAU5M,GAAGF,QAAQkM,EACzB,CAEA,OAAOzB,CACT,aCmGApN,EAAOC,QA9IP,MACEyP,KAAO,GACPC,YAAc,CAAC,EAKf,IAAAL,GACE,OAAO5C,KAAKgD,KAAK3M,MACnB,CAKA,IAAA2G,GACE,OAAOgD,KAAKgD,KAAK1E,KAAI,SAAS1J,GAAK,OAAOA,EAAEsO,GAAK,GACnD,CAKA,GAAAC,CAAID,GACF,OAAOlD,KAAKiD,YAAY3M,eAAe4M,EACzC,CAQA,QAAAb,CAASa,GACP,IAAIE,EAAQpD,KAAKiD,YAAYC,GAC7B,QAAcZ,IAAVc,EACF,OAAOpD,KAAKgD,KAAKI,GAAOf,QAE5B,CAMA,GAAA3F,GACE,GAAoB,IAAhBsD,KAAK4C,OACP,MAAM,IAAIE,MAAM,mBAElB,OAAO9C,KAAKgD,KAAK,GAAGE,GACtB,CAUA,GAAAR,CAAIQ,EAAKb,GACP,IAAIgB,EAAarD,KAAKiD,YAEtB,GADAC,EAAMI,OAAOJ,IACRG,EAAW/M,eAAe4M,GAAM,CACnC,IAAIK,EAAMvD,KAAKgD,KACXI,EAAQG,EAAIlN,OAIhB,OAHAgN,EAAWH,GAAOE,EAClBG,EAAInH,KAAK,CAAC8G,IAAKA,EAAKb,SAAUA,IAC9BrC,KAAKwD,UAAUJ,IACR,CACT,CACA,OAAO,CACT,CAKA,SAAAP,GACE7C,KAAKyD,MAAM,EAAGzD,KAAKgD,KAAK3M,OAAS,GACjC,IAAIqG,EAAMsD,KAAKgD,KAAK9G,MAGpB,cAFO8D,KAAKiD,YAAYvG,EAAIwG,KAC5BlD,KAAK0D,SAAS,GACPhH,EAAIwG,GACb,CASA,QAAAV,CAASU,EAAKb,GACZ,IAAIe,EAAQpD,KAAKiD,YAAYC,GAC7B,GAAIb,EAAWrC,KAAKgD,KAAKI,GAAOf,SAC9B,MAAM,IAAIS,MAAM,uDACFI,EAAM,SAAWlD,KAAKgD,KAAKI,GAAOf,SAAW,SAAWA,GAExErC,KAAKgD,KAAKI,GAAOf,SAAWA,EAC5BrC,KAAKwD,UAAUJ,EACjB,CAEA,QAAAM,CAASpM,GACP,IAAIiM,EAAMvD,KAAKgD,KACXW,EAAI,EAAIrM,EACRsM,EAAID,EAAI,EACRE,EAAUvM,EACVqM,EAAIJ,EAAIlN,SACVwN,EAAUN,EAAII,GAAGtB,SAAWkB,EAAIM,GAASxB,SAAWsB,EAAIE,EACpDD,EAAIL,EAAIlN,SACVwN,EAAUN,EAAIK,GAAGvB,SAAWkB,EAAIM,GAASxB,SAAWuB,EAAIC,GAEtDA,IAAYvM,IACd0I,KAAKyD,MAAMnM,EAAGuM,GACd7D,KAAK0D,SAASG,IAGpB,CAEA,SAAAL,CAAUJ,GAIR,IAHA,IAEInC,EAFAsC,EAAMvD,KAAKgD,KACXX,EAAWkB,EAAIH,GAAOf,SAET,IAAVe,KAEDG,EADJtC,EAASmC,GAAS,GACFf,SAAWA,IAG3BrC,KAAKyD,MAAML,EAAOnC,GAClBmC,EAAQnC,CAEZ,CAEA,KAAAwC,CAAMnM,EAAGwM,GACP,IAAIP,EAAMvD,KAAKgD,KACXK,EAAarD,KAAKiD,YAClBc,EAAWR,EAAIjM,GACf0M,EAAWT,EAAIO,GACnBP,EAAIjM,GAAK0M,EACTT,EAAIO,GAAKC,EACTV,EAAWW,EAASd,KAAO5L,EAC3B+L,EAAWU,EAASb,KAAOY,CAC7B,oBClJF,IAAInN,EAAQ,eACR1B,EAAO,EAAQ,OAEnB3B,EAAOC,QAgCP,SAAyBC,EAAG+B,EAAM0O,GAChC,IAAI3K,EAgCN,SAAwB9F,GAEtB,IADA,IAAI2C,EACG3C,EAAE0Q,QAAS/N,EAAIlB,EAAKkP,SAAS,YACpC,OAAOhO,CACT,CApCaiO,CAAe5Q,GACxBkN,EAAS,IAAI/J,EAAM,CAAEsI,UAAU,IAAQE,SAAS,CAAE7F,KAAMA,IACrD+K,qBAAoBlO,GAAK3C,EAAE4C,KAAKD,KA2BrC,OAzBA3C,EAAEwI,QAAQ/F,SAAQE,IAChB,IAAIC,EAAO5C,EAAE4C,KAAKD,GAChB8K,EAASzN,EAAEyN,OAAO9K,IAEhBC,EAAKb,OAASA,GAAQa,EAAKK,SAAWlB,GAAQA,GAAQa,EAAKM,WAC7DgK,EAAOpF,QAAQnF,GACfuK,EAAO7K,UAAUM,EAAG8K,GAAU3H,GAG9B9F,EAAEyQ,GAAc9N,GAAGF,SAAQuG,IACzB,IAAI7E,EAAI6E,EAAErG,IAAMA,EAAIqG,EAAEjF,EAAIiF,EAAErG,EAC1BsF,EAAOiF,EAAOjF,KAAK9D,EAAGxB,GACtBJ,OAAkBuM,IAAT7G,EAAqBA,EAAK1F,OAAS,EAC9C2K,EAAO5K,QAAQ6B,EAAGxB,EAAG,CAAEJ,OAAQvC,EAAEiI,KAAKe,GAAGzG,OAASA,GAAS,IAGzDK,EAAKE,eAAe,YACtBoK,EAAOpF,QAAQnF,EAAG,CAChBI,WAAYH,EAAKG,WAAWhB,GAC5BiB,YAAaJ,EAAKI,YAAYjB,KAGpC,IAGKmL,CACT,gCChEA,IAAI4D,EAAU,EAAQ,OAClBC,EAAY,EAAQ,OACpBhP,EAAO,EAAQ,MACfiP,EAAiB,wBACjBC,EAAoB,EAAQ,OAC5BC,EAAmB,0BACnBC,EAAe,EAAQ,OACvBC,EAAoB,EAAQ,MAC5BC,EAAmB,EAAQ,OAC3B/M,EAAQ,EAAQ,OAChBgN,EAAW,EAAQ,OACnB7P,EAAO,EAAQ,OACf0B,EAAQ,eAEZrD,EAAOC,QAEP,SAAgBC,EAAGuR,GACjB,IAAIC,EAAOD,GAAQA,EAAKE,YAAchQ,EAAK+P,KAAO/P,EAAKiQ,OACvDF,EAAK,UAAU,KACb,IAAIG,EACFH,EAAK,sBAAsB,IA4FjC,SAA0BI,GACxB,IAAI5R,EAAI,IAAImD,EAAM,CAAEuI,YAAY,EAAMD,UAAU,IAC5CxL,EAAQ4R,EAAaD,EAAW3R,SA4BpC,OA1BAD,EAAE2L,SAASpC,OAAO2B,OAAO,CAAC,EACxB4G,EACAC,EAAkB9R,EAAO+R,GACzBvQ,EAAKwQ,KAAKhS,EAAOiS,KAEnBN,EAAWpJ,QAAQ/F,SAAQE,IAEzB,MAAMwP,EAAUJ,EADLF,EAAaD,EAAWhP,KAAKD,IACAyP,GACxC7I,OAAOC,KAAK6I,GAAc5P,SAAQ4J,SACbyC,IAAfqD,EAAQ9F,KACV8F,EAAQ9F,GAAKgG,EAAahG,GAC5B,IAGFrM,EAAE8H,QAAQnF,EAAGwP,GACbnS,EAAEqC,UAAUM,EAAGiP,EAAWnE,OAAO9K,GAAG,IAGtCiP,EAAWhG,QAAQnJ,SAAQuG,IACzB,IAAIf,EAAO4J,EAAaD,EAAW3J,KAAKe,IACxChJ,EAAEsC,QAAQ0G,EAAGO,OAAO2B,OAAO,CAAC,EAC1BoH,EACAP,EAAkB9J,EAAMsK,GACxB9Q,EAAKwQ,KAAKhK,EAAMuK,IAAY,IAGzBxS,CACT,CA3HuCyS,CAAiBzS,KACpDwR,EAAK,eAAsB,IAK/B,SAAmBxR,EAAGwR,EAAMD,GAC1BC,EAAK,8BAA8B,IA8HrC,SAAgCxR,GAC9B,IAAIC,EAAQD,EAAEC,QACdA,EAAMyS,SAAW,EACjB1S,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIf,EAAOjI,EAAEiI,KAAKe,GAClBf,EAAK0K,QAAU,EACqB,MAAhC1K,EAAKT,SAASC,gBACM,OAAlBxH,EAAM2S,SAAsC,OAAlB3S,EAAM2S,QAClC3K,EAAK3G,OAAS2G,EAAK4K,YAEnB5K,EAAK/G,QAAU+G,EAAK4K,YAExB,GAEJ,CA5I2CC,CAAuB9S,KAChEwR,EAAK,uBAA8B,IA2SrC,SAAyBxR,GACvBA,EAAE4L,QAAQnJ,SAAQuG,IAChB,GAAIA,EAAErG,IAAMqG,EAAEjF,EAAG,CACf,IAAInB,EAAO5C,EAAE4C,KAAKoG,EAAErG,GACfC,EAAKmQ,YACRnQ,EAAKmQ,UAAY,IAEnBnQ,EAAKmQ,UAAUnK,KAAK,CAAEI,EAAGA,EAAGhH,MAAOhC,EAAEiI,KAAKe,KAC1ChJ,EAAEgT,WAAWhK,EACf,IAEJ,CAtT2CiK,CAAgBjT,KACzDwR,EAAK,eAA8B,IAAMV,EAAQoC,IAAIlT,KACrDwR,EAAK,wBAA8B,IAAML,EAAa+B,IAAIlT,KAC1DwR,EAAK,YAA8B,IAAMzP,EAAKN,EAAK0R,mBAAmBnT,MACtEwR,EAAK,8BAA8B,IA+IrC,SAAgCxR,GAC9BA,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIf,EAAOjI,EAAEiI,KAAKe,GAClB,GAAIf,EAAK3G,OAAS2G,EAAK/G,OAAQ,CAC7B,IAAIyB,EAAI3C,EAAE4C,KAAKoG,EAAErG,GAEbX,EAAQ,CAAED,MADN/B,EAAE4C,KAAKoG,EAAEjF,GACMhC,KAAOY,EAAEZ,MAAQ,EAAIY,EAAEZ,KAAMiH,EAAGA,GACvDvH,EAAKW,aAAapC,EAAG,aAAcgC,EAAO,MAC5C,IAEJ,CAzJ2CoR,CAAuBpT,KAChEwR,EAAK,wBAA8B,IAAMN,EAAiBlR,KAC1DwR,EAAK,4BAA8B,IAAML,EAAakC,QAAQrT,KAC9DwR,EAAK,sBAA8B,IAAMR,EAAehR,KACxDwR,EAAK,wBAA8B,IAuJrC,SAA0BxR,GACxB,IAAIkD,EAAU,EACdlD,EAAEwI,QAAQ/F,SAAQE,IAChB,IAAIC,EAAO5C,EAAE4C,KAAKD,GACdC,EAAK0Q,YACP1Q,EAAKK,QAAUjD,EAAE4C,KAAKA,EAAK0Q,WAAWvR,KACtCa,EAAKM,QAAUlD,EAAE4C,KAAKA,EAAK2Q,cAAcxR,KACzCmB,EAAUqD,KAAK2B,IAAIhF,EAASN,EAAKM,SACnC,IAEFlD,EAAEC,QAAQiD,QAAUA,CACtB,CAlK2CsQ,CAAiBxT,KAC1DwR,EAAK,8BAA8B,IAmKrC,SAAgCxR,GAC9BA,EAAEwI,QAAQ/F,SAAQE,IAChB,IAAIC,EAAO5C,EAAE4C,KAAKD,GACC,eAAfC,EAAKoB,QACPhE,EAAEiI,KAAKrF,EAAKoG,GAAGyK,UAAY7Q,EAAKb,KAChC/B,EAAE0T,WAAW/Q,GACf,GAEJ,CA3K2CgR,CAAuB3T,KAChEwR,EAAK,qBAA8B,IAAMT,EAAUmC,IAAIlT,KACvDwR,EAAK,yBAA8B,IAAMP,EAAkBjR,KAC3DwR,EAAK,yBAA8B,IAAMJ,EAAkBpR,KAC3DwR,EAAK,aAA8B,IAAMlN,EAAMtE,EAAGuR,KAClDC,EAAK,uBAA8B,IA0SrC,SAAyBxR,GACVyB,EAAKwJ,iBAAiBjL,GAC5ByC,SAAQgB,IACb,IAAImQ,EAAa,EACjBnQ,EAAMhB,SAAQ,CAACE,EAAGmB,KAChB,IAAIlB,EAAO5C,EAAE4C,KAAKD,GAClBC,EAAK0B,MAAQR,EAAI8P,GAChBhR,EAAKmQ,WAAa,IAAItQ,SAAQoR,IAC7BpS,EAAKW,aAAapC,EAAG,WAAY,CAC/BsB,MAAOuS,EAAS7R,MAAMV,MACtBJ,OAAQ2S,EAAS7R,MAAMd,OACvBa,KAAMa,EAAKb,KACXuC,MAAOR,KAAO8P,EACd5K,EAAG6K,EAAS7K,EACZhH,MAAO6R,EAAS7R,OACf,MAAM,WAEJY,EAAKmQ,SAAS,GACrB,GAEN,CA9T2Ce,CAAgB9T,KACzDwR,EAAK,8BAA8B,IAAMH,EAAiB0C,OAAO/T,KACjEwR,EAAK,gBAA8B,IAAMF,EAAStR,KAClDwR,EAAK,yBAA8B,IA6TrC,SAA2BxR,GACzBA,EAAEwI,QAAQ/F,SAAQE,IAChB,IAAIC,EAAO5C,EAAE4C,KAAKD,GAClB,GAAmB,aAAfC,EAAKoB,MAAsB,CAC7B,IAAIgQ,EAAWhU,EAAE4C,KAAKA,EAAKoG,EAAErG,GACzBvB,EAAI4S,EAAS5S,EAAI4S,EAAS1S,MAAQ,EAClCN,EAAIgT,EAAShT,EACbiT,EAAKrR,EAAKxB,EAAIA,EACd8S,EAAKF,EAAS9S,OAAS,EAC3BlB,EAAEsC,QAAQM,EAAKoG,EAAGpG,EAAKZ,OACvBhC,EAAE0T,WAAW/Q,GACbC,EAAKZ,MAAMmS,OAAS,CAClB,CAAE/S,EAAGA,EAAI,EAAI6S,EAAK,EAAGjT,EAAGA,EAAIkT,GAC5B,CAAE9S,EAAGA,EAAI,EAAI6S,EAAK,EAAGjT,EAAGA,EAAIkT,GAC5B,CAAE9S,EAAGA,EAAQ6S,EAAQjT,EAAGA,GACxB,CAAEI,EAAGA,EAAI,EAAI6S,EAAK,EAAGjT,EAAGA,EAAIkT,GAC5B,CAAE9S,EAAGA,EAAI,EAAI6S,EAAK,EAAGjT,EAAGA,EAAIkT,IAE9BtR,EAAKZ,MAAMZ,EAAIwB,EAAKxB,EACpBwB,EAAKZ,MAAMhB,EAAI4B,EAAK5B,CACtB,IAEJ,CAnV2CoT,CAAkBpU,KAC3DwR,EAAK,yBAA8B,IAkQrC,SAA2BxR,GACzBA,EAAEwI,QAAQ/F,SAAQE,IAChB,GAAI3C,EAAEwC,SAASG,GAAGE,OAAQ,CACxB,IAAID,EAAO5C,EAAE4C,KAAKD,GACd0R,EAAIrU,EAAE4C,KAAKA,EAAK0Q,WAChBjN,EAAIrG,EAAE4C,KAAKA,EAAK2Q,cAChBpD,EAAInQ,EAAE4C,KAAKA,EAAKG,WAAWH,EAAKG,WAAWF,OAAS,IACpDuN,EAAIpQ,EAAE4C,KAAKA,EAAKI,YAAYJ,EAAKI,YAAYH,OAAS,IAE1DD,EAAKtB,MAAQiF,KAAK+N,IAAIlE,EAAEhP,EAAI+O,EAAE/O,GAC9BwB,EAAK1B,OAASqF,KAAK+N,IAAIjO,EAAErF,EAAIqT,EAAErT,GAC/B4B,EAAKxB,EAAI+O,EAAE/O,EAAIwB,EAAKtB,MAAQ,EAC5BsB,EAAK5B,EAAIqT,EAAErT,EAAI4B,EAAK1B,OAAS,CAC/B,KAGFlB,EAAEwI,QAAQ/F,SAAQE,IACQ,WAApB3C,EAAE4C,KAAKD,GAAGqB,OACZhE,EAAE0T,WAAW/Q,EACf,GAEJ,CAvR2C4R,CAAkBvU,KAC3DwR,EAAK,sBAA8B,IAAMT,EAAUyD,KAAKxU,KACxDwR,EAAK,4BAA8B,IAwOrC,SAA8BxR,GAC5BA,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIf,EAAOjI,EAAEiI,KAAKe,GAClB,GAAIf,EAAKnF,eAAe,KAItB,OAHsB,MAAlBmF,EAAKT,UAAsC,MAAlBS,EAAKT,WAChCS,EAAK3G,OAAS2G,EAAK4K,aAEb5K,EAAKT,UACb,IAAK,IAAKS,EAAK7G,GAAK6G,EAAK3G,MAAQ,EAAI2G,EAAK4K,YAAa,MACvD,IAAK,IAAK5K,EAAK7G,GAAK6G,EAAK3G,MAAQ,EAAI2G,EAAK4K,YAE5C,GAEJ,CArP2C4B,CAAqBzU,KAC9DwR,EAAK,4BAA8B,IAAMH,EAAiBmD,KAAKxU,KAC/DwR,EAAK,sBAA8B,IAgKrC,SAAwBxR,GACtB,IAAI0U,EAAOtL,OAAOC,kBACdsL,EAAO,EACPC,EAAOxL,OAAOC,kBACdwL,EAAO,EACP7N,EAAahH,EAAEC,QACf6U,EAAU9N,EAAW+N,SAAW,EAChCC,EAAUhO,EAAWiO,SAAW,EAEpC,SAASC,EAAYC,GACnB,IAAI/T,EAAI+T,EAAM/T,EACVJ,EAAImU,EAAMnU,EACV+C,EAAIoR,EAAM7T,MACVkK,EAAI2J,EAAMjU,OACdwT,EAAOnO,KAAK2C,IAAIwL,EAAMtT,EAAI2C,EAAI,GAC9B4Q,EAAOpO,KAAK2B,IAAIyM,EAAMvT,EAAI2C,EAAI,GAC9B6Q,EAAOrO,KAAK2C,IAAI0L,EAAM5T,EAAIwK,EAAI,GAC9BqJ,EAAOtO,KAAK2B,IAAI2M,EAAM7T,EAAIwK,EAAI,EAChC,CAEAxL,EAAEwI,QAAQ/F,SAAQE,GAAKuS,EAAYlV,EAAE4C,KAAKD,MAC1C3C,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIf,EAAOjI,EAAEiI,KAAKe,GACdf,EAAKnF,eAAe,MACtBoS,EAAYjN,EACd,IAGFyM,GAAQI,EACRF,GAAQI,EAERhV,EAAEwI,QAAQ/F,SAAQE,IAChB,IAAIC,EAAO5C,EAAE4C,KAAKD,GAClBC,EAAKxB,GAAKsT,EACV9R,EAAK5B,GAAK4T,CAAI,IAGhB5U,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIf,EAAOjI,EAAEiI,KAAKe,GAClBf,EAAKkM,OAAO1R,SAAQ2S,IAClBA,EAAEhU,GAAKsT,EACPU,EAAEpU,GAAK4T,CAAI,IAET3M,EAAKnF,eAAe,OAAQmF,EAAK7G,GAAKsT,GACtCzM,EAAKnF,eAAe,OAAQmF,EAAKjH,GAAK4T,EAAM,IAGlD5N,EAAW1F,MAAQqT,EAAOD,EAAOI,EACjC9N,EAAW9F,OAAS2T,EAAOD,EAAOI,CACpC,CAjN2CK,CAAerV,KACxDwR,EAAK,4BAA8B,IAkNrC,SAA8BxR,GAC5BA,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAGIsM,EAAIC,EAHJtN,EAAOjI,EAAEiI,KAAKe,GACdwM,EAAQxV,EAAE4C,KAAKoG,EAAErG,GACjB8S,EAAQzV,EAAE4C,KAAKoG,EAAEjF,GAEhBkE,EAAKkM,QAKRmB,EAAKrN,EAAKkM,OAAO,GACjBoB,EAAKtN,EAAKkM,OAAOlM,EAAKkM,OAAOtR,OAAS,KALtCoF,EAAKkM,OAAS,GACdmB,EAAKG,EACLF,EAAKC,GAKPvN,EAAKkM,OAAOuB,QAAQjU,EAAKkU,cAAcH,EAAOF,IAC9CrN,EAAKkM,OAAOvL,KAAKnH,EAAKkU,cAAcF,EAAOF,GAAI,GAEnD,CAnO2CK,CAAqB5V,KAC9DwR,EAAK,qBAA8B,IAmPrC,SAAuCxR,GACrCA,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIf,EAAOjI,EAAEiI,KAAKe,GACdf,EAAK4N,UACP5N,EAAKkM,OAAOhJ,SACd,GAEJ,CA1P2C2K,CAA8B9V,KACvEwR,EAAK,oBAA8B,IAAMV,EAAQ0D,KAAKxU,IACxD,CAjCqC+V,CAAUpE,EAAaH,EAAMD,KAC9DC,EAAK,sBAAsB,IAwC/B,SAA0BI,EAAYD,GACpCC,EAAWpJ,QAAQ/F,SAAQE,IACzB,IAAIqT,EAAapE,EAAWhP,KAAKD,GAC7BsT,EAActE,EAAY/O,KAAKD,GAE/BqT,IACFA,EAAW5U,EAAI6U,EAAY7U,EAC3B4U,EAAWhV,EAAIiV,EAAYjV,EAC3BgV,EAAWjU,KAAOkU,EAAYlU,KAE1B4P,EAAYnP,SAASG,GAAGE,SAC1BmT,EAAW1U,MAAQ2U,EAAY3U,MAC/B0U,EAAW9U,OAAS+U,EAAY/U,QAEpC,IAGF0Q,EAAWhG,QAAQnJ,SAAQuG,IACzB,IAAIgN,EAAapE,EAAW3J,KAAKe,GAC7BiN,EAActE,EAAY1J,KAAKe,GAEnCgN,EAAW7B,OAAS8B,EAAY9B,OAC5B8B,EAAYnT,eAAe,OAC7BkT,EAAW5U,EAAI6U,EAAY7U,EAC3B4U,EAAWhV,EAAIiV,EAAYjV,EAC7B,IAGF4Q,EAAW3R,QAAQqB,MAAQqQ,EAAY1R,QAAQqB,MAC/CsQ,EAAW3R,QAAQiB,OAASyQ,EAAY1R,QAAQiB,MAClD,CAtEqCgV,CAAiBlW,EAAG2R,IAAa,GAEtE,EAsEA,IAAIK,EAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,EAAgB,CAAEY,QAAS,GAAI9K,QAAS,GAAID,QAAS,GAAIiL,QAAS,MAClEV,EAAa,CAAC,YAAa,SAAU,UAAW,SAChDE,EAAe,CAAC,QAAS,UACzBC,EAAe,CAAE/Q,MAAO,EAAGJ,OAAQ,GACnCqR,EAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,EAAe,CACjBK,OAAQ,EAAGpQ,OAAQ,EAAGjB,MAAO,EAAGJ,OAAQ,EACxC2R,YAAa,GAAIrL,SAAU,KAEzBgL,EAAY,CAAC,YA0RjB,SAAST,EAAkBoE,EAAKhB,GAC9B,OAAO1T,EAAKiJ,UAAUjJ,EAAKwQ,KAAKkE,EAAKhB,GAAQ/L,OAC/C,CAEA,SAASyI,EAAasD,GACpB,IAAIiB,EAAW,CAAC,EAUhB,OATIjB,GACF5L,OAAOO,QAAQqL,GAAO1S,SAAQ,EAAE4J,EAAG1J,MAChB,iBAAN0J,IACTA,EAAIA,EAAE5E,eAGR2O,EAAS/J,GAAK1J,CAAC,IAGZyT,CACT,mBCpZA,IAAIC,EAAU,EAAQ,OAEtBvW,EAAOC,QAEP,SAAmBC,GACjB,IACEqW,EAAQrW,EACV,CAAE,MAAOgJ,GACP,GAAIA,aAAaqN,EAAQC,eACvB,OAAO,EAET,MAAMtN,CACR,CACA,OAAO,CACT,aCdAlJ,EAAOC,QAEP,SAAgBC,GACd,IAAI4P,EAAQ,EACRrH,EAAQ,GACRI,EAAU,CAAC,EACX4N,EAAU,GAEd,SAAS7T,EAAIC,GACX,IAAIsJ,EAAQtD,EAAQhG,GAAK,CACvB6T,SAAS,EACTC,QAAS7G,EACTA,MAAOA,KAaT,GAXArH,EAAMK,KAAKjG,GAEX3C,EAAEsJ,WAAW3G,GAAGF,SAAQ,SAASsB,GAC1B4E,EAAQ7F,eAAeiB,GAGjB4E,EAAQ5E,GAAGyS,UACpBvK,EAAMwK,QAAUlQ,KAAK2C,IAAI+C,EAAMwK,QAAS9N,EAAQ5E,GAAG6L,SAHnDlN,EAAIqB,GACJkI,EAAMwK,QAAUlQ,KAAK2C,IAAI+C,EAAMwK,QAAS9N,EAAQ5E,GAAG0S,SAIvD,IAEIxK,EAAMwK,UAAYxK,EAAM2D,MAAO,CACjC,IACI7L,EADA2S,EAAO,GAEX,GACE3S,EAAIwE,EAAMG,MACVC,EAAQ5E,GAAGyS,SAAU,EACrBE,EAAK9N,KAAK7E,SACHpB,IAAMoB,GACfwS,EAAQ3N,KAAK8N,EACf,CACF,CAQA,OANA1W,EAAEwI,QAAQ/F,SAAQ,SAASE,GACpBgG,EAAQ7F,eAAeH,IAC1BD,EAAIC,EAER,IAEO4T,CACT,mBCdA,IAAII,EAAM,EAAQ,OAElB7W,EAAOC,QAAU,CACfoD,MAAOwT,EAAIxT,MACXyT,KAAM,EAAQ,OACdC,IAAK,EAAQ,OACbC,QAASH,EAAIG,uCChCf,IAAI3T,EAAQ,eA2BZ,SAASf,EAAapC,EAAG+W,EAAM5B,EAAOtJ,GACpC,IAAIlJ,EACJ,GACEA,EAAIgO,EAAS9E,SACN7L,EAAE0Q,QAAQ/N,IAInB,OAFAwS,EAAMnR,MAAQ+S,EACd/W,EAAE8H,QAAQnF,EAAGwS,GACNxS,CACT,CAuKA,SAASO,EAAQlD,GACf,OAAOuG,KAAK2B,OAAOlI,EAAEwI,QAAQsC,KAAInI,IAC/B,IAAIZ,EAAO/B,EAAE4C,KAAKD,GAAGZ,KACrB,YAAa+M,IAAT/M,EACKqH,OAAO4N,UAGTjV,CAAI,IAEf,CAlNAjC,EAAOC,QAAU,CACf2B,cA4LF,SAAuB1B,EAAG4B,EAAQG,EAAMuC,GACtC,IAAI1B,EAAO,CACTtB,MAAO,EACPJ,OAAQ,GAMV,OAJI+V,UAAUpU,QAAU,IACtBD,EAAKb,KAAOA,EACZa,EAAK0B,MAAQA,GAERlC,EAAapC,EAAG,SAAU4C,EAAMhB,EACzC,EArMEQ,eACA+Q,mBAmDF,SAA4BnT,GAC1B,IAAIkX,EAAa,IAAI/T,EAAM,CAAEuI,WAAY1L,EAAEmX,iBAAkBxL,SAAS3L,EAAEC,SASxE,OARAD,EAAEwI,QAAQ/F,SAAQE,IACX3C,EAAEwC,SAASG,GAAGE,QACjBqU,EAAWpP,QAAQnF,EAAG3C,EAAE4C,KAAKD,GAC/B,IAEF3C,EAAE4L,QAAQnJ,SAAQuG,IAChBkO,EAAW5U,QAAQ0G,EAAGhJ,EAAEiI,KAAKe,GAAG,IAE3BkO,CACT,EA7DEjM,iBAgIF,SAA0BjL,GACxB,IAAIqD,EAAW8B,EAAMjC,EAAQlD,GAAK,GAAG8K,KAAI,IAAM,KAQ/C,OAPA9K,EAAEwI,QAAQ/F,SAAQE,IAChB,IAAIC,EAAO5C,EAAE4C,KAAKD,GACdZ,EAAOa,EAAKb,UACH+M,IAAT/M,IACFsB,EAAStB,GAAMa,EAAK0B,OAAS3B,EAC/B,IAEKU,CACT,EAzIEsS,cAwFF,SAAuB/U,EAAMwW,GAC3B,IAcIC,EAAIC,EAdJlW,EAAIR,EAAKQ,EACTJ,EAAIJ,EAAKI,EAITiT,EAAKmD,EAAMhW,EAAIA,EACf8S,EAAKkD,EAAMpW,EAAIA,EACf+C,EAAInD,EAAKU,MAAQ,EACjBkK,EAAI5K,EAAKM,OAAS,EAEtB,IAAK+S,IAAOC,EACV,MAAM,IAAI5E,MAAM,6DAoBlB,OAhBI/I,KAAK+N,IAAIJ,GAAMnQ,EAAIwC,KAAK+N,IAAIL,GAAMzI,GAEhC0I,EAAK,IACP1I,GAAKA,GAEP6L,EAAK7L,EAAIyI,EAAKC,EACdoD,EAAK9L,IAGDyI,EAAK,IACPlQ,GAAKA,GAEPsT,EAAKtT,EACLuT,EAAKvT,EAAImQ,EAAKD,GAGT,CAAE7S,EAAGA,EAAIiW,EAAIrW,EAAGA,EAAIsW,EAC7B,EAxHE5M,UAoRF,SAAmByL,EAAKoB,GACtB,IAAIC,EAAOD,EAKX,MAJ0B,iBAAfA,IACTC,EAAQC,GAAQA,EAAIF,IAGfhO,OAAOO,QAAQqM,GAAK5S,QAAO,CAACwF,GAAMsD,EAAG1J,MAC1CoG,EAAIsD,GAAKmL,EAAK7U,EAAG0J,GACVtD,IACN,CAAC,EACN,EA7RE7F,UACA8N,eA4IF,SAAwBhR,GACtB,IAAIkJ,EAAM3C,KAAK2C,OAAOlJ,EAAEwI,QAAQsC,KAAInI,IAClC,IAAIZ,EAAO/B,EAAE4C,KAAKD,GAAGZ,KACrB,YAAa+M,IAAT/M,EACKqH,OAAOsO,UAGT3V,CAAI,KAEb/B,EAAEwI,QAAQ/F,SAAQE,IAChB,IAAIC,EAAO5C,EAAE4C,KAAKD,GACdC,EAAKE,eAAe,UACtBF,EAAKb,MAAQmH,EACf,GAEJ,EA1JEwI,OAyOF,SAAgB7F,EAAM8L,GACpB,OAAOA,GACT,EA1OEC,UA+MF,SAAmBC,EAAYF,GAC7B,IAAIzK,EAAS,CAAE4K,IAAK,GAAIC,IAAK,IAQ7B,OAPAF,EAAWpV,SAAQ3B,IACb6W,EAAG7W,GACLoM,EAAO4K,IAAIlP,KAAK9H,GAEhBoM,EAAO6K,IAAInP,KAAK9H,EAClB,IAEKoM,CACT,EAxNE+E,KAoQF,SAAc+F,EAAQxO,GACpB,MAAMyO,EAAO,CAAC,EACd,IAAK,MAAMvI,KAAOlG,OACIsF,IAAhBkJ,EAAOtI,KACTuI,EAAKvI,GAAOsI,EAAOtI,IAIvB,OAAOuI,CACT,EA5QEC,mBAkEF,SAA4BlY,GAC1B,IAAImY,EAAYnY,EAAEwI,QAAQsC,KAAInI,IAC5B,IAAIyV,EAAQ,CAAC,EAIb,OAHApY,EAAE8I,QAAQnG,GAAGF,SAAQuG,IACnBoP,EAAMpP,EAAErG,IAAMyV,EAAMpP,EAAErG,IAAM,GAAK3C,EAAEiI,KAAKe,GAAGzG,MAAM,IAE5C6V,CAAK,IAEd,OAAOC,EAAUrY,EAAEwI,QAAS2P,EAC9B,EA1EEhT,QACA+L,iBAuJF,SAA0BlR,GAExB,IAAIsY,EAAS/R,KAAK2C,OAAOlJ,EAAEwI,QAAQsC,KAAInI,GAAK3C,EAAE4C,KAAKD,GAAGZ,QAElDwW,EAAS,GACbvY,EAAEwI,QAAQ/F,SAAQE,IAChB,IAAIZ,EAAO/B,EAAE4C,KAAKD,GAAGZ,KAAOuW,EACvBC,EAAOxW,KACVwW,EAAOxW,GAAQ,IAEjBwW,EAAOxW,GAAM6G,KAAKjG,EAAE,IAGtB,IAAIyE,EAAQ,EACRoR,EAAiBxY,EAAEC,QAAQuY,eAC/BC,MAAMC,KAAKH,GAAQ9V,SAAQ,CAAC0L,EAAIrK,UACnBgL,IAAPX,GAAoBrK,EAAI0U,GAAmB,IAC3CpR,OACc0H,IAAPX,GAAoB/G,GAC7B+G,EAAG1L,SAAQE,GAAK3C,EAAE4C,KAAKD,GAAGZ,MAAQqF,GACpC,GAEJ,EA5KEuR,SAyBF,SAAkB3Y,GAChB,IAAIkX,GAAa,IAAI/T,GAAQwI,SAAS3L,EAAEC,SAUxC,OATAD,EAAEwI,QAAQ/F,SAAQE,GAAKuU,EAAWpP,QAAQnF,EAAG3C,EAAE4C,KAAKD,MACpD3C,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAI4P,EAAc1B,EAAWjP,KAAKe,EAAErG,EAAGqG,EAAEjF,IAAM,CAAExB,OAAQ,EAAGoQ,OAAQ,GAChE3Q,EAAQhC,EAAEiI,KAAKe,GACnBkO,EAAW5U,QAAQ0G,EAAErG,EAAGqG,EAAEjF,EAAG,CAC3BxB,OAAQqW,EAAYrW,OAASP,EAAMO,OACnCoQ,OAAQpM,KAAK2B,IAAI0Q,EAAYjG,OAAQ3Q,EAAM2Q,SAC3C,IAEGuE,CACT,EApCE2B,iBAmDF,SAA0B7Y,GACxB,IAAImY,EAAYnY,EAAEwI,QAAQsC,KAAInI,IAC5B,IAAImW,EAAO,CAAC,EAIZ,OAHA9Y,EAAEmJ,SAASxG,GAAGF,SAAQuG,IACpB8P,EAAK9P,EAAEjF,IAAM+U,EAAK9P,EAAEjF,IAAM,GAAK/D,EAAEiI,KAAKe,GAAGzG,MAAM,IAE1CuW,CAAI,IAEb,OAAOT,EAAUrY,EAAEwI,QAAS2P,EAC9B,EA3DE3G,KAwNF,SAAc3F,EAAM8L,GAClB,IAAIoB,EAAQC,KAAKC,MACjB,IACE,OAAOtB,GACT,CAAE,QACAuB,QAAQC,IAAItN,EAAO,WAAamN,KAAKC,MAAQF,GAAS,KACxD,CACF,EA9NEpI,WACA0H,aAmOF,IAAIe,EAAY,EAChB,SAASzI,EAAS/O,GAChB,IAAIyX,IAAOD,EACX,OAAOxM,SAAShL,GAAUyX,CAC5B,CAEA,SAASlU,EAAM4T,EAAOO,EAAOC,EAAO,GACrB,MAATD,IACFA,EAAQP,EACRA,EAAQ,GAGV,IAAIS,EAAU1V,GAAMA,EAAIwV,EACpBC,EAAO,IACTC,EAAU1V,GAAMwV,EAAQxV,GAG1B,MAAMqB,EAAQ,GACd,IAAK,IAAIrB,EAAIiV,EAAOS,EAAO1V,GAAIA,GAAKyV,EAClCpU,EAAMyD,KAAK9E,GAGb,OAAOqB,CACT,CAyBA,SAASkT,EAAUoB,EAAO9P,GACxB,OAAO8P,EAAMlW,QAAO,CAACwF,EAAK2G,EAAK5L,KAC7BiF,EAAI2G,GAAO/F,EAAO7F,GACXiF,IACN,CAAC,EACN,gCC/SA,IAAI5F,EAAQ,eACRuW,EAAQ,eAmDZ,SAASC,EAAUtF,EAAGrU,GAcpB,OADAqU,EAAE7L,QAAQ/F,SAZV,SAASC,EAAIC,GACX3C,EAAEuP,UAAU5M,GAAGF,SAAQuG,IACrB,IAAI4Q,EAAQ5Q,EAAErG,EACZoB,EAAKpB,IAAMiX,EAAS5Q,EAAEjF,EAAI6V,EACvBvF,EAAE3D,QAAQ3M,IAAO2V,EAAM1Z,EAAGgJ,KAC7BqL,EAAEvM,QAAQ/D,EAAG,CAAC,GACdsQ,EAAE/R,QAAQK,EAAGoB,EAAG,CAAC,GACjBrB,EAAIqB,GACN,GAEJ,IAGOsQ,EAAEpF,WACX,CAMA,SAAS4K,EAAiBxF,EAAGrU,GAG3B,OAFcA,EAAE4L,QAEHrI,QAAO,CAACwF,EAAKd,KACxB,IAAI6R,EAAY1Q,OAAOC,kBAKvB,OAJIgL,EAAE3D,QAAQzI,EAAKtF,KAAO0R,EAAE3D,QAAQzI,EAAKlE,KACvC+V,EAAYJ,EAAM1Z,EAAGiI,IAGnB6R,EAAY/Q,EAAI,GACX,CAAC+Q,EAAW7R,GAGdc,CAAG,GACT,CAACK,OAAOC,kBAAmB,OAAO,EACvC,CAEA,SAAS0Q,EAAW1F,EAAGrU,EAAGoH,GACxBiN,EAAE7L,QAAQ/F,SAAQE,GAAK3C,EAAE4C,KAAKD,GAAGZ,MAAQqF,GAC3C,CAzFAtH,EAAOC,QA2BP,SAAsBC,GACpB,IAOIiI,EAAMb,EAPNiN,EAAI,IAAIlR,EAAM,CAAE6W,UAAU,IAG1BjB,EAAQ/Y,EAAEwI,QAAQ,GAClB4G,EAAOpP,EAAEiP,YAIb,IAHAoF,EAAEvM,QAAQiR,EAAO,CAAC,GAGXY,EAAUtF,EAAGrU,GAAKoP,GACvBnH,EAAO4R,EAAiBxF,EAAGrU,GAC3BoH,EAAQiN,EAAE3D,QAAQzI,EAAKtF,GAAK+W,EAAM1Z,EAAGiI,IAASyR,EAAM1Z,EAAGiI,GACvD8R,EAAW1F,EAAGrU,EAAGoH,GAGnB,OAAOiN,CACT,mBChDA,IAAI3R,EAAM,EAAQ,OAElB5C,EAAOC,QAEP,SAAkBC,EAAGmO,GACnB,OAAOzL,EAAI1C,EAAGmO,EAAI,MACpB,mBCNA,IAAII,EAAgB,EAAQ,OAE5BzO,EAAOC,QAIP,SAAkBC,EAAGgY,EAAQiC,EAAUC,GACrC,OAKF,SAAqBla,EAAGgY,EAAQiC,EAAUC,GACxC,IAEIvX,EAAGwX,EAFH5D,EAAU,CAAC,EACX7H,EAAK,IAAIH,EAGTI,EAAkB,SAAS1G,GAC7B,IAAIlE,EAAIkE,EAAKtF,IAAMA,EAAIsF,EAAKtF,EAAIsF,EAAKlE,EACjCqW,EAAS7D,EAAQxS,GACjBxB,EAAS0X,EAAShS,GAClBoS,EAAWF,EAAOE,SAAW9X,EAEjC,GAAIA,EAAS,EACX,MAAM,IAAI+M,MAAM,4DACerH,EAAO,YAAc1F,GAGlD8X,EAAWD,EAAOC,WACpBD,EAAOC,SAAWA,EAClBD,EAAOE,YAAc3X,EACrB+L,EAAGM,SAASjL,EAAGsW,GAEnB,EAQA,IANAra,EAAEwI,QAAQ/F,SAAQ,SAASE,GACzB,IAAI0X,EAAW1X,IAAMqV,EAAS,EAAI5O,OAAOC,kBACzCkN,EAAQ5T,GAAK,CAAE0X,SAAUA,GACzB3L,EAAGQ,IAAIvM,EAAG0X,EACZ,IAEO3L,EAAGU,OAAS,IACjBzM,EAAI+L,EAAGW,aACP8K,EAAS5D,EAAQ5T,IACN0X,WAAajR,OAAOC,oBAI/B6Q,EAAOvX,GAAGF,QAAQkM,GAGpB,OAAO4H,CACT,CA7CSgE,CAAYva,EAAG8P,OAAOkI,GAC3BiC,GAAYO,EACZN,GAAU,SAASvX,GAAK,OAAO3C,EAAEmJ,SAASxG,EAAI,EAClD,EANA,IAAI6X,EAAsB,IAAM,yBCJhC,aAAmE,0BAAF,EAA8F,WAAW,aAA4T,SAASC,EAAErU,EAAEC,EAAEoU,GAAG,IAAIC,EAAE,IAAIC,eAAeD,EAAEE,KAAK,MAAMxU,GAAGsU,EAAEG,aAAa,OAAOH,EAAEI,OAAO,WAAW9a,EAAE0a,EAAEK,SAAS1U,EAAEoU,EAAE,EAAEC,EAAEM,QAAQ,WAAW9B,QAAQ+B,MAAM,0BAA0B,EAAEP,EAAEQ,MAAM,CAAC,SAASR,EAAEtU,GAAG,IAAIC,EAAE,IAAIsU,eAAetU,EAAEuU,KAAK,OAAOxU,GAAE,GAAI,IAAIC,EAAE6U,MAAM,CAAC,MAAM9U,GAAG,CAAC,OAAO,KAAKC,EAAE8U,QAAQ,KAAK9U,EAAE8U,MAAM,CAAC,SAASnS,EAAE5C,GAAG,IAAIA,EAAEgV,cAAc,IAAIC,WAAW,SAAS,CAAC,MAAMZ,GAAG,IAAIpU,EAAEiV,SAASC,YAAY,eAAelV,EAAEmV,eAAe,SAAQ,GAAG,EAAGC,OAAO,EAAE,EAAE,EAAE,GAAG,IAAG,GAAG,GAAG,GAAG,EAAG,EAAE,MAAMrV,EAAEgV,cAAc/U,EAAE,CAAC,CAAC,IAAIqV,EAAE,iBAAiBD,QAAQA,OAAOA,SAASA,OAAOA,OAAO,iBAAiBE,MAAMA,KAAKA,OAAOA,KAAKA,KAAK,iBAAiB,EAAA3b,GAAQ,EAAAA,EAAO4b,SAAS,EAAA5b,EAAO,EAAAA,OAAO,EAAOoG,EAAEsV,EAAEG,WAAW,YAAYC,KAAKD,UAAUE,YAAY,cAAcD,KAAKD,UAAUE,aAAa,SAASD,KAAKD,UAAUE,WAAW/b,EAAE0b,EAAEM,SAAS,iBAAiBP,QAAQA,SAASC,EAAE,WAAW,EAAE,aAAaO,kBAAkBC,YAAY9V,EAAE,SAASC,EAAErG,EAAEwL,GAAG,IAAI1H,EAAE4X,EAAES,KAAKT,EAAEU,UAAU9L,EAAEgL,SAASe,cAAc,KAAKrc,EAAEA,GAAGqG,EAAEwF,MAAM,WAAWyE,EAAEgM,SAAStc,EAAEsQ,EAAEiM,IAAI,WAAW,iBAAiBlW,GAAGiK,EAAEkM,KAAKnW,EAAEiK,EAAEmM,SAASC,SAASD,OAAOzT,EAAEsH,GAAGoK,EAAEpK,EAAEkM,MAAM/B,EAAEpU,EAAErG,EAAEwL,GAAGxC,EAAEsH,EAAEA,EAAEqM,OAAO,YAAYrM,EAAEkM,KAAK1Y,EAAE8Y,gBAAgBvW,GAAGwW,YAAW,WAAW/Y,EAAEgZ,gBAAgBxM,EAAEkM,KAAK,GAAE,KAAKK,YAAW,WAAW7T,EAAEsH,EAAE,GAAE,GAAG,EAAE,qBAAqBuL,UAAU,SAASH,EAAE1b,EAAEwL,GAAG,GAAGxL,EAAEA,GAAG0b,EAAE7P,MAAM,WAAW,iBAAiB6P,EAAEG,UAAUkB,iBAAnoD,SAAW3W,EAAEC,GAAG,YAAM,IAAoBA,EAAEA,EAAE,CAAC2W,SAAQ,GAAI,iBAAiB3W,IAAI6S,QAAQ+D,KAAK,sDAAsD5W,EAAE,CAAC2W,SAAS3W,IAAIA,EAAE2W,SAAS,6EAA6ElB,KAAK1V,EAAE2Q,MAAM,IAAImG,KAAK,CAAC,SAAS9W,GAAG,CAAC2Q,KAAK3Q,EAAE2Q,OAAO3Q,CAAC,CAAs2CC,CAAEqV,EAAElQ,GAAGxL,QAAQ,GAAG0a,EAAEgB,GAAGjB,EAAEiB,EAAE1b,EAAEwL,OAAO,CAAC,IAAI1H,EAAEwX,SAASe,cAAc,KAAKvY,EAAE0Y,KAAKd,EAAE5X,EAAE6Y,OAAO,SAASE,YAAW,WAAW7T,EAAElF,EAAE,GAAE,CAAC,EAAE,SAASuC,EAAEqU,EAAE1R,EAAEhJ,GAAG,IAAGA,EAAEA,GAAG4a,KAAK,GAAG,aAAc5a,EAAEsb,SAAS6B,MAAMnd,EAAEsb,SAAS8B,KAAKC,UAAU,kBAAkB,iBAAiBhX,EAAE,OAAOoU,EAAEpU,EAAEqU,EAAE1R,GAAG,IAAIwC,EAAE,6BAA6BnF,EAAE0Q,KAAKjT,EAAE,eAAegY,KAAKJ,EAAE4B,cAAc5B,EAAE6B,OAAOjN,EAAE,eAAewL,KAAKD,UAAUE,WAAW,IAAIzL,GAAG9E,GAAG1H,GAAGsC,IAAI,oBAAoBoX,WAAW,CAAC,IAAInR,EAAE,IAAImR,WAAWnR,EAAEoR,UAAU,WAAW,IAAIrX,EAAEiG,EAAEa,OAAO9G,EAAEkK,EAAElK,EAAEA,EAAEsX,QAAQ,eAAe,yBAAyB1d,EAAEA,EAAE0c,SAASF,KAAKpW,EAAEsW,SAAStW,EAAEpG,EAAE,IAAI,EAAEqM,EAAEsR,cAActX,EAAE,KAAK,CAAC,IAAI8J,EAAEuL,EAAES,KAAKT,EAAEU,UAAUwB,EAAEzN,EAAEyM,gBAAgBvW,GAAGrG,EAAEA,EAAE0c,SAASkB,EAAElB,SAASF,KAAKoB,EAAE5d,EAAE,KAAK6c,YAAW,WAAW1M,EAAE2M,gBAAgBc,EAAE,GAAE,IAAI,CAAC,GAAGlC,EAAEM,OAAOhc,EAAEgc,OAAOhc,EAA+BF,EAAOC,QAAQC,CAAE,GAA5kF,UAAJ,IAAI,mCCAnE,IAAIyB,EAAO,EAAQ,OAmCnB,SAASoc,EAAkB1P,EAAI2P,EAAYlO,GACzC,IAAImO,EACJ,KAAOD,EAAWjb,SAAWkb,EAAOD,EAAWA,EAAWjb,OAAS,IAAIiB,GAAK8L,GAC1EkO,EAAWpV,MACXyF,EAAGvF,KAAKmV,EAAK5P,IACbyB,IAEF,OAAOA,CACT,CAzCA9P,EAAOC,QAEP,SAAc+J,EAASkU,GACrB,IAAIC,EAAQxc,EAAKmW,UAAU9N,GAASmC,GAC3BA,EAAMnJ,eAAe,gBAE1Bob,EAAWD,EAAMnG,IACnBgG,EAAaG,EAAMlG,IAAI5R,MAAK,CAACC,EAAGC,IAAMA,EAAEvC,EAAIsC,EAAEtC,IAC9CqK,EAAK,GACL5G,EAAM,EACNhF,EAAS,EACT4b,EAAU,EAgCd,IAAyBC,EA9BvBF,EAAS/X,MA8BciY,IA9BSJ,EA+BzB,CAACK,EAAQC,IACVD,EAAOE,WAAaD,EAAOC,YACrB,EACCF,EAAOE,WAAaD,EAAOC,WAC7B,EAGDH,EAA6BE,EAAOxa,EAAIua,EAAOva,EAAxCua,EAAOva,EAAIwa,EAAOxa,IApCnCqa,EAAUN,EAAkB1P,EAAI2P,EAAYK,GAE5CD,EAASzb,SAAQwJ,IACfkS,GAAWlS,EAAMkC,GAAGtL,OACpBsL,EAAGvF,KAAKqD,EAAMkC,IACd5G,GAAO0E,EAAMsS,WAAatS,EAAM1J,OAChCA,GAAU0J,EAAM1J,OAChB4b,EAAUN,EAAkB1P,EAAI2P,EAAYK,EAAQ,IAGtD,IAAIjR,EAAS,CAAEiB,GAAIA,EAAGqQ,MAAK,IAK3B,OAJIjc,IACF2K,EAAOqR,WAAahX,EAAMhF,EAC1B2K,EAAO3K,OAASA,GAEX2K,CACT,0BCPA,SAASuR,EAAgBze,GACvBA,EAAEwI,QAAQ/F,SAAQE,GAAK+b,EAAmB1e,EAAE4C,KAAKD,MACjD3C,EAAE4L,QAAQnJ,SAAQuG,GAAK0V,EAAmB1e,EAAEiI,KAAKe,KACnD,CAEA,SAAS0V,EAAmBvJ,GAC1B,IAAIpR,EAAIoR,EAAM7T,MACd6T,EAAM7T,MAAQ6T,EAAMjU,OACpBiU,EAAMjU,OAAS6C,CACjB,CAcA,SAAS4a,EAAYxJ,GACnBA,EAAMnU,GAAKmU,EAAMnU,CACnB,CAcA,SAAS4d,EAAUzJ,GACjB,IAAI/T,EAAI+T,EAAM/T,EACd+T,EAAM/T,EAAI+T,EAAMnU,EAChBmU,EAAMnU,EAAII,CACZ,CAnEAtB,EAAOC,QAAU,CACfgU,OAIF,SAAgB/T,GACd,IAAI6e,EAAU7e,EAAEC,QAAQ2S,QAAQnL,cAChB,OAAZoX,GAAgC,OAAZA,GACtBJ,EAAgBze,EAEpB,EAREwU,KAUF,SAAcxU,GACZ,IAAI6e,EAAU7e,EAAEC,QAAQ2S,QAAQnL,cAChB,OAAZoX,GAAgC,OAAZA,GAqB1B,SAAkB7e,GAChBA,EAAEwI,QAAQ/F,SAAQE,GAAKgc,EAAY3e,EAAE4C,KAAKD,MAE1C3C,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIf,EAAOjI,EAAEiI,KAAKe,GAClBf,EAAKkM,OAAO1R,QAAQkc,GAChB1W,EAAKnF,eAAe,MACtB6b,EAAY1W,EACd,GAEJ,CA9BI6W,CAAS9e,GAGK,OAAZ6e,GAAgC,OAAZA,IAiC1B,SAAgB7e,GACdA,EAAEwI,QAAQ/F,SAAQE,GAAKic,EAAU5e,EAAE4C,KAAKD,MAExC3C,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIf,EAAOjI,EAAEiI,KAAKe,GAClBf,EAAKkM,OAAO1R,QAAQmc,GAChB3W,EAAKnF,eAAe,MACtB8b,EAAU3W,EACZ,GAEJ,CA1CI8W,CAAO/e,GACPye,EAAgBze,GAEpB,2BCtBA,IACIgf,EAAa,KAyoBjB,SAASC,EAAqBnU,EAAKuB,GAC7BvB,EAAIuB,GACNvB,EAAIuB,KAEJvB,EAAIuB,GAAK,CAEb,CAEA,SAAS6S,EAAuBpU,EAAKuB,KAC5BvB,EAAIuB,WAAavB,EAAIuB,EAC9B,CAEA,SAAS8S,EAAaC,EAAYC,EAAIC,EAAIzT,GACxC,IAAIlJ,EAAI,GAAK0c,EACTtb,EAAI,GAAKub,EACb,IAAKF,GAAczc,EAAIoB,EAAG,CACxB,IAAI0B,EAAM9C,EACVA,EAAIoB,EACJA,EAAI0B,CACN,CACA,OAAO9C,EA5pBY,IA4pBSoB,EA5pBT,UA6pBE+K,IAATjD,EA/pBU,KA+pB+BA,EACvD,CAiBA,SAAS0T,EAAYH,EAAY7R,GAC/B,OAAO4R,EAAaC,EAAY7R,EAAQ5K,EAAG4K,EAAQxJ,EAAGwJ,EAAQ1B,KAChE,CAEA/L,EAAOC,QAvqBP,MACEyf,aAAc,EACdC,eAAgB,EAChBC,aAAc,EAGdC,OAGAC,oBAAsB,KAAe,EAGrCC,oBAAsB,KAAe,EAGrCC,OAAS,CAAC,EAGVC,IAAM,CAAC,EAGPC,OAAS,CAAC,EAGVC,KAAO,CAAC,EAGRC,MAAQ,CAAC,EAGTC,UAAY,CAAC,EAGbC,YAAc,CAAC,EAGfC,WAAa,EAGbC,WAAa,EAEbC,QAEAC,UAEA,WAAAlU,CAAYiF,GACNA,IACF/E,KAAKgT,aAAcjO,EAAKzO,eAAe,aAAcyO,EAAKyI,SAC1DxN,KAAKiT,gBAAgBlO,EAAKzO,eAAe,eAAgByO,EAAK7F,WAC9Dc,KAAKkT,cAAcnO,EAAKzO,eAAe,aAAcyO,EAAK9F,UAGxDe,KAAKkT,cAEPlT,KAAK+T,QAAU,CAAC,EAGhB/T,KAAKgU,UAAY,CAAC,EAClBhU,KAAKgU,UAAUxB,GAAc,CAAC,EAElC,CAOA,UAAAI,GACE,OAAO5S,KAAKgT,WACd,CAKA,YAAArI,GACE,OAAO3K,KAAKiT,aACd,CAKA,UAAAgB,GACE,OAAOjU,KAAKkT,WACd,CAKA,QAAA/T,CAAS3J,GAEP,OADAwK,KAAKmT,OAAS3d,EACPwK,IACT,CAKA,KAAAvM,GACE,OAAOuM,KAAKmT,MACd,CAYA,mBAAA9O,CAAoB6P,GAMlB,OALAlU,KAAKoT,oBAAsBc,EACD,mBAAfA,IACTlU,KAAKoT,oBAAsB,IAAMc,GAG5BlU,IACT,CAMA,SAAAyC,GACE,OAAOzC,KAAK6T,UACd,CAOA,KAAA7X,GACE,OAAOe,OAAOC,KAAKgD,KAAKsT,OAC1B,CAMA,OAAAa,GACE,IAAIhF,EAAOnP,KACX,OAAOA,KAAKhE,QAAQoY,QAAOje,GAAyC,IAApC4G,OAAOC,KAAKmS,EAAKoE,IAAIpd,IAAIE,QAC3D,CAMA,KAAAge,GACE,IAAIlF,EAAOnP,KACX,OAAOA,KAAKhE,QAAQoY,QAAOje,GAA0C,IAArC4G,OAAOC,KAAKmS,EAAKsE,KAAKtd,IAAIE,QAC5D,CAMA,QAAAie,CAAS3S,EAAIrN,GACX,IAAIigB,EAAO9J,UACP0E,EAAOnP,KAQX,OAPA2B,EAAG1L,SAAQ,SAASE,GACdoe,EAAKle,OAAS,EAChB8Y,EAAK7T,QAAQnF,EAAG7B,GAEhB6a,EAAK7T,QAAQnF,EAEjB,IACO6J,IACT,CAQA,OAAA1E,CAAQnF,EAAG7B,GACT,OAAI0L,KAAKsT,OAAOhd,eAAeH,IACzBsU,UAAUpU,OAAS,IACrB2J,KAAKsT,OAAOnd,GAAK7B,GAEZ0L,OAGTA,KAAKsT,OAAOnd,GAAKsU,UAAUpU,OAAS,EAAI/B,EAAQ0L,KAAKoT,oBAAoBjd,GACrE6J,KAAKkT,cACPlT,KAAK+T,QAAQ5d,GAAKqc,EAClBxS,KAAKgU,UAAU7d,GAAK,CAAC,EACrB6J,KAAKgU,UAAUxB,GAAYrc,IAAK,GAElC6J,KAAKuT,IAAIpd,GAAK,CAAC,EACf6J,KAAKwT,OAAOrd,GAAK,CAAC,EAClB6J,KAAKyT,KAAKtd,GAAK,CAAC,EAChB6J,KAAK0T,MAAMvd,GAAK,CAAC,IACf6J,KAAK6T,WACA7T,KACT,CAMA,IAAA5J,CAAKD,GACH,OAAO6J,KAAKsT,OAAOnd,EACrB,CAKA,OAAA+N,CAAQ/N,GACN,OAAO6J,KAAKsT,OAAOhd,eAAeH,EACpC,CAQA,UAAA+Q,CAAW/Q,GACT,IAAIgZ,EAAOnP,KACX,GAAIA,KAAKsT,OAAOhd,eAAeH,GAAI,CACjC,IAAIqQ,EAAahK,GAAK2S,EAAK3I,WAAW2I,EAAKwE,UAAUnX,WAC9CwD,KAAKsT,OAAOnd,GACf6J,KAAKkT,cACPlT,KAAKwU,4BAA4Bre,UAC1B6J,KAAK+T,QAAQ5d,GACpB6J,KAAKhK,SAASG,GAAGF,SAAQ,SAAS6L,GAChCqN,EAAKtZ,UAAUiM,EACjB,WACO9B,KAAKgU,UAAU7d,IAExB4G,OAAOC,KAAKgD,KAAKuT,IAAIpd,IAAIF,QAAQuQ,UAC1BxG,KAAKuT,IAAIpd,UACT6J,KAAKwT,OAAOrd,GACnB4G,OAAOC,KAAKgD,KAAKyT,KAAKtd,IAAIF,QAAQuQ,UAC3BxG,KAAKyT,KAAKtd,UACV6J,KAAK0T,MAAMvd,KAChB6J,KAAK6T,UACT,CACA,OAAO7T,IACT,CAQA,SAAAnK,CAAUM,EAAG8K,GACX,IAAKjB,KAAKkT,YACR,MAAM,IAAIpQ,MAAM,6CAGlB,QAAeR,IAAXrB,EACFA,EAASuR,MACJ,CAGL,IAAK,IAAIiC,EADTxT,GAAU,QAC+BqB,IAAbmS,EAAwBA,EAAWzU,KAAKiB,OAAOwT,GACzE,GAAIA,IAAate,EACf,MAAM,IAAI2M,MAAM,WAAa7B,EAAQ,iBAAmB9K,EACpD,yBAIR6J,KAAK1E,QAAQ2F,EACf,CAMA,OAJAjB,KAAK1E,QAAQnF,GACb6J,KAAKwU,4BAA4Bre,GACjC6J,KAAK+T,QAAQ5d,GAAK8K,EAClBjB,KAAKgU,UAAU/S,GAAQ9K,IAAK,EACrB6J,IACT,CAEA,2BAAAwU,CAA4Bre,UACnB6J,KAAKgU,UAAUhU,KAAK+T,QAAQ5d,IAAIA,EACzC,CAMA,MAAA8K,CAAO9K,GACL,GAAI6J,KAAKkT,YAAa,CACpB,IAAIjS,EAASjB,KAAK+T,QAAQ5d,GAC1B,GAAI8K,IAAWuR,EACb,OAAOvR,CAEX,CACF,CAMA,QAAAjL,CAASG,EAAIqc,GACX,GAAIxS,KAAKkT,YAAa,CACpB,IAAIld,EAAWgK,KAAKgU,UAAU7d,GAC9B,GAAIH,EACF,OAAO+G,OAAOC,KAAKhH,EAEvB,KAAO,IAAIG,IAAMqc,EACf,OAAOxS,KAAKhE,QACP,GAAIgE,KAAKkE,QAAQ/N,GACtB,MAAO,EACT,CACF,CAOA,YAAAsB,CAAatB,GACX,IAAIue,EAAS1U,KAAKwT,OAAOrd,GACzB,GAAIue,EACF,OAAO3X,OAAOC,KAAK0X,EAEvB,CAOA,UAAA5X,CAAW3G,GACT,IAAIwe,EAAQ3U,KAAK0T,MAAMvd,GACvB,GAAIwe,EACF,OAAO5X,OAAOC,KAAK2X,EAEvB,CAOA,SAAAC,CAAUze,GACR,IAAIyV,EAAQ5L,KAAKvI,aAAatB,GAC9B,GAAIyV,EAAO,CACT,MAAMiJ,EAAQ,IAAIC,IAAIlJ,GACtB,IAAK,IAAImJ,KAAQ/U,KAAKlD,WAAW3G,GAC/B0e,EAAMnS,IAAIqS,GAGZ,OAAO9I,MAAMC,KAAK2I,EAAM1X,SAC1B,CACF,CAEA,MAAA6X,CAAO7e,GAOL,OAA4B,KALxB6J,KAAK4S,aACK5S,KAAKlD,WAAW3G,GAEhB6J,KAAK4U,UAAUze,IAEZE,MACnB,CAQA,WAAA4e,CAAYb,GACV,IAAIc,EAAO,IAAIlV,KAAKF,YAAY,CAC9B0N,SAAUxN,KAAKgT,YACf9T,WAAYc,KAAKiT,cACjBhU,SAAUe,KAAKkT,cAGjBgC,EAAK/V,SAASa,KAAKvM,SAEnB,IAAI0b,EAAOnP,KACXjD,OAAOO,QAAQ0C,KAAKsT,QAAQrd,SAAQ,UAAUE,EAAG7B,IAC3C8f,EAAOje,IACT+e,EAAK5Z,QAAQnF,EAAG7B,EAEpB,IAEAyI,OAAOI,OAAO6C,KAAK2T,WAAW1d,SAAQ,SAASuG,GACzC0Y,EAAKhR,QAAQ1H,EAAErG,IAAM+e,EAAKhR,QAAQ1H,EAAEjF,IACtC2d,EAAKpf,QAAQ0G,EAAG2S,EAAK1T,KAAKe,GAE9B,IAEA,IAAIyF,EAAU,CAAC,EACf,SAASkT,EAAWhf,GAClB,IAAI8K,EAASkO,EAAKlO,OAAO9K,GACzB,YAAemM,IAAXrB,GAAwBiU,EAAKhR,QAAQjD,IACvCgB,EAAQ9L,GAAK8K,EACNA,GACEA,KAAUgB,EACZA,EAAQhB,GAERkU,EAAWlU,EAEtB,CAMA,OAJIjB,KAAKkT,aACPgC,EAAKlZ,QAAQ/F,SAAQE,GAAK+e,EAAKrf,UAAUM,EAAGgf,EAAWhf,MAGlD+e,CACT,CAWA,mBAAAE,CAAoBlB,GAMlB,OALAlU,KAAKqT,oBAAsBa,EACD,mBAAfA,IACTlU,KAAKqT,oBAAsB,IAAMa,GAG5BlU,IACT,CAMA,SAAAqV,GACE,OAAOrV,KAAK8T,UACd,CAMA,KAAA1U,GACE,OAAOrC,OAAOI,OAAO6C,KAAK2T,UAC5B,CAQA,OAAA2B,CAAQ3T,EAAIrN,GACV,IAAI6a,EAAOnP,KACPuU,EAAO9J,UASX,OARA9I,EAAG5K,QAAO,SAASZ,EAAGoB,GAMpB,OALIgd,EAAKle,OAAS,EAChB8Y,EAAKrZ,QAAQK,EAAGoB,EAAGjD,GAEnB6a,EAAKrZ,QAAQK,EAAGoB,GAEXA,CACT,IACOyI,IACT,CAQA,OAAAlK,GACE,IAAIK,EAAGoB,EAAG8H,EAAM/K,EACZihB,GAAiB,EACjBC,EAAO/K,UAAU,GAED,iBAAT+K,GAA8B,OAATA,GAAiB,MAAOA,GACtDrf,EAAIqf,EAAKrf,EACToB,EAAIie,EAAKje,EACT8H,EAAOmW,EAAKnW,KACa,IAArBoL,UAAUpU,SACZ/B,EAAQmW,UAAU,GAClB8K,GAAiB,KAGnBpf,EAAIqf,EACJje,EAAIkT,UAAU,GACdpL,EAAOoL,UAAU,GACbA,UAAUpU,OAAS,IACrB/B,EAAQmW,UAAU,GAClB8K,GAAiB,IAIrBpf,EAAI,GAAKA,EACToB,EAAI,GAAKA,OACI+K,IAATjD,IACFA,EAAO,GAAKA,GAGd,IAAI7C,EAAImW,EAAa3S,KAAKgT,YAAa7c,EAAGoB,EAAG8H,GAC7C,GAAIW,KAAK4T,YAAYtd,eAAekG,GAIlC,OAHI+Y,IACFvV,KAAK4T,YAAYpX,GAAKlI,GAEjB0L,KAGT,QAAasC,IAATjD,IAAuBW,KAAKiT,cAC9B,MAAM,IAAInQ,MAAM,qDAKlB9C,KAAK1E,QAAQnF,GACb6J,KAAK1E,QAAQ/D,GAEbyI,KAAK4T,YAAYpX,GAAK+Y,EAAiBjhB,EAAQ0L,KAAKqT,oBAAoBld,EAAGoB,EAAG8H,GAE9E,IAAI0B,EA8IR,SAAuB6R,EAAYC,EAAIC,EAAIzT,GACzC,IAAIlJ,EAAI,GAAK0c,EACTtb,EAAI,GAAKub,EACb,IAAKF,GAAczc,EAAIoB,EAAG,CACxB,IAAI0B,EAAM9C,EACVA,EAAIoB,EACJA,EAAI0B,CACN,CACA,IAAI8H,EAAW,CAAE5K,EAAGA,EAAGoB,EAAGA,GAI1B,OAHI8H,IACF0B,EAAQ1B,KAAOA,GAEV0B,CACT,CA3JkB0U,CAAczV,KAAKgT,YAAa7c,EAAGoB,EAAG8H,GAYpD,OAVAlJ,EAAI4K,EAAQ5K,EACZoB,EAAIwJ,EAAQxJ,EAEZwF,OAAO2Y,OAAO3U,GACdf,KAAK2T,UAAUnX,GAAKuE,EACpB0R,EAAqBzS,KAAKwT,OAAOjc,GAAIpB,GACrCsc,EAAqBzS,KAAK0T,MAAMvd,GAAIoB,GACpCyI,KAAKuT,IAAIhc,GAAGiF,GAAKuE,EACjBf,KAAKyT,KAAKtd,GAAGqG,GAAKuE,EAClBf,KAAK8T,aACE9T,IACT,CAMA,IAAAvE,CAAKtF,EAAGoB,EAAG8H,GACT,IAAI7C,EAA0B,IAArBiO,UAAUpU,OACf0c,EAAY/S,KAAKgT,YAAavI,UAAU,IACxCkI,EAAa3S,KAAKgT,YAAa7c,EAAGoB,EAAG8H,GACzC,OAAOW,KAAK4T,YAAYpX,EAC1B,CAMA,SAAAmZ,GACE,MAAMla,EAAOuE,KAAKvE,QAAQgP,WAC1B,MAAoB,iBAAThP,EACF,CAACjG,MAAOiG,GAGVA,CACT,CAMA,OAAAma,CAAQzf,EAAGoB,EAAG8H,GACZ,IAAI7C,EAA0B,IAArBiO,UAAUpU,OACf0c,EAAY/S,KAAKgT,YAAavI,UAAU,IACxCkI,EAAa3S,KAAKgT,YAAa7c,EAAGoB,EAAG8H,GACzC,OAAOW,KAAK4T,YAAYtd,eAAekG,EACzC,CAMA,UAAAgK,CAAWrQ,EAAGoB,EAAG8H,GACf,IAAI7C,EAA0B,IAArBiO,UAAUpU,OACf0c,EAAY/S,KAAKgT,YAAavI,UAAU,IACxCkI,EAAa3S,KAAKgT,YAAa7c,EAAGoB,EAAG8H,GACrC5D,EAAOuE,KAAK2T,UAAUnX,GAY1B,OAXIf,IACFtF,EAAIsF,EAAKtF,EACToB,EAAIkE,EAAKlE,SACFyI,KAAK4T,YAAYpX,UACjBwD,KAAK2T,UAAUnX,GACtBkW,EAAuB1S,KAAKwT,OAAOjc,GAAIpB,GACvCuc,EAAuB1S,KAAK0T,MAAMvd,GAAIoB,UAC/ByI,KAAKuT,IAAIhc,GAAGiF,UACZwD,KAAKyT,KAAKtd,GAAGqG,GACpBwD,KAAK8T,cAEA9T,IACT,CAOA,OAAA1D,CAAQnG,EAAGwB,GACT,IAAIke,EAAM7V,KAAKuT,IAAIpd,GACnB,GAAI0f,EAAK,CACP,IAAIzW,EAAQrC,OAAOI,OAAO0Y,GAC1B,OAAKle,EAGEyH,EAAMgV,QAAO3Y,GAAQA,EAAKtF,IAAMwB,IAF9ByH,CAGX,CACF,CAOA,QAAAzC,CAASxG,EAAGoB,GACV,IAAIue,EAAO9V,KAAKyT,KAAKtd,GACrB,GAAI2f,EAAM,CACR,IAAI1W,EAAQrC,OAAOI,OAAO2Y,GAC1B,OAAKve,EAGE6H,EAAMgV,QAAO3Y,GAAQA,EAAKlE,IAAMA,IAF9B6H,CAGX,CACF,CAOA,SAAA2D,CAAU5M,EAAGoB,GACX,IAAI+E,EAAU0D,KAAK1D,QAAQnG,EAAGoB,GAC9B,GAAI+E,EACF,OAAOA,EAAQD,OAAO2D,KAAKrD,SAASxG,EAAGoB,GAE3C,cCzoBFjE,EAAOC,QAAU,mBCAjB,SAASsW,EAAQrW,GACf,IAAI2I,EAAU,CAAC,EACXJ,EAAQ,CAAC,EACTgO,EAAU,GAkBd,GAFAvW,EAAE6gB,QAAQpe,SAdV,SAAS8f,EAAM3f,GACb,GAAI2F,EAAMzF,eAAeF,GACvB,MAAM,IAAI0T,EAGP3N,EAAQ7F,eAAeF,KAC1B2F,EAAM3F,IAAQ,EACd+F,EAAQ/F,IAAQ,EAChB5C,EAAEiE,aAAarB,GAAMH,QAAQ8f,UACtBha,EAAM3F,GACb2T,EAAQ3N,KAAKhG,GAEjB,IAII2G,OAAOC,KAAKb,GAAS9F,SAAW7C,EAAEiP,YACpC,MAAM,IAAIqH,EAGZ,OAAOC,CACT,CAEA,MAAMD,UAAuBhH,MAC3B,WAAAhD,GACEkW,SAASvL,UACX,EAGFnX,EAAOC,QAAUsW,EACjBA,EAAQC,eAAiBA,gCCjCzB,IAAI7U,EAAO,EAAQ,OAEnB3B,EAAOC,QA2BP,SAA0B+J,EAASoE,GACjC,IAAIuU,EAAgB,CAAC,EA0BrB,OAzBA3Y,EAAQrH,SAAQ,CAACwJ,EAAOnI,KACtB,IAAI2B,EAAMgd,EAAcxW,EAAMtJ,GAAK,CACjC+f,SAAU,EACV,GAAM,GACNC,IAAK,GACLxU,GAAI,CAAClC,EAAMtJ,GACXmB,EAAGA,QAEoBgL,IAArB7C,EAAMsS,aACR9Y,EAAI8Y,WAAatS,EAAMsS,WACvB9Y,EAAIlD,OAAS0J,EAAM1J,OACrB,IAGF2L,EAAGtC,QAAQnJ,SAAQuG,IACjB,IAAIqV,EAASoE,EAAczZ,EAAErG,GACzB2b,EAASmE,EAAczZ,EAAEjF,QACd+K,IAAXuP,QAAmCvP,IAAXwP,IAC1BA,EAAOoE,WACPrE,EAAOsE,IAAI/Z,KAAK6Z,EAAczZ,EAAEjF,IAClC,IAQJ,SAA4B6e,GAC1B,IAAI9Y,EAAU,GAEd,SAAS+Y,EAAS1I,GAChB,OAAO2I,IACDA,EAAOC,cAGejU,IAAtBgU,EAAOvE,iBACezP,IAAtBqL,EAAOoE,YACPuE,EAAOvE,YAAcpE,EAAOoE,aA2BtC,SAAsB5B,EAAQ3E,GAC5B,IAAIzQ,EAAM,EACNhF,EAAS,EAEToa,EAAOpa,SACTgF,GAAOoV,EAAO4B,WAAa5B,EAAOpa,OAClCA,GAAUoa,EAAOpa,QAGfyV,EAAOzV,SACTgF,GAAOyQ,EAAOuG,WAAavG,EAAOzV,OAClCA,GAAUyV,EAAOzV,QAGnBoa,EAAOxO,GAAK6J,EAAO7J,GAAGtF,OAAO8T,EAAOxO,IACpCwO,EAAO4B,WAAahX,EAAMhF,EAC1Boa,EAAOpa,OAASA,EAChBoa,EAAO7Y,EAAIyC,KAAK2C,IAAI8O,EAAOlU,EAAG6Y,EAAO7Y,GACrCkU,EAAO+K,QAAS,CAClB,CA7CQC,CAAa7I,EAAQ2I,EACvB,CAEJ,CAEA,SAASG,EAAU9I,GACjB,OAAOC,IACLA,EAAW,GAAExR,KAAKuR,GACQ,KAApBC,EAAOsI,UACXE,EAAUha,KAAKwR,EACjB,CAEJ,CAEA,KAAOwI,EAAU/f,QAAQ,CACvB,IAAIoJ,EAAQ2W,EAAUla,MACtBoB,EAAQlB,KAAKqD,GACbA,EAAU,GAAEd,UAAU1I,QAAQogB,EAAS5W,IACvCA,EAAM0W,IAAIlgB,QAAQwgB,EAAUhX,GAC9B,CAEA,OAAOnC,EAAQ8W,QAAO3U,IAAUA,EAAM8W,SAAQjY,KAAImB,GACzCxK,EAAKwQ,KAAKhG,EAAO,CAAC,KAAM,IAAK,aAAc,YAEtD,CAtCSiX,CAFS3Z,OAAOI,OAAO8Y,GAAe7B,QAAO3U,IAAUA,EAAMyW,WAGtE,mBC3DA,IAAIS,EAAW,EAAQ,OAEvBrjB,EAAOC,QAEP,SAAqBC,EAAGwO,EAAY4U,GAClC,OAAOpjB,EAAEwI,QAAQjF,QAAO,SAASwF,EAAKpG,GAEpC,OADAoG,EAAIpG,GAAKwgB,EAASnjB,EAAG2C,EAAG6L,EAAY4U,GAC7Bra,CACT,GAAG,CAAC,EACN,0BCPAjJ,EAAOC,QAAU,CACfJ,YAyBF,SAAqBK,GACnB,IAAI2I,EAAU,CAAC,EAwBf3I,EAAE2gB,UAAUle,SAtBZ,SAASC,EAAIC,GACX,IAAIX,EAAQhC,EAAE4C,KAAKD,GACnB,GAAIgG,EAAQ7F,eAAeH,GACzB,OAAOX,EAAMD,KAEf4G,EAAQhG,IAAK,EAEb,IAAIZ,EAAOwE,KAAK2C,OAAOlJ,EAAEmJ,SAASxG,GAAGmI,KAAI9B,GAC9B,MAALA,EACKI,OAAOC,kBAGT3G,EAAIsG,EAAEjF,GAAK/D,EAAEiI,KAAKe,GAAG2J,UAO9B,OAJI5Q,IAASqH,OAAOC,oBAClBtH,EAAO,GAGDC,EAAMD,KAAOA,CACvB,GAGF,EAlDE2X,MAwDF,SAAe1Z,EAAGgJ,GAChB,OAAOhJ,EAAE4C,KAAKoG,EAAEjF,GAAGhC,KAAO/B,EAAE4C,KAAKoG,EAAErG,GAAGZ,KAAO/B,EAAEiI,KAAKe,GAAG2J,MACzD,cC/BA,SAAS0Q,EAAa1gB,EAAG2gB,EAAY3a,EAASI,GAE5C,IADA,IAAIR,EAAQ,CAAC,CAAC5F,GAAG,IACV4F,EAAM1F,OAAS,GAAG,CACvB,IAAIV,EAAOoG,EAAMG,MACbvG,EAAK,GACP4G,EAAIH,KAAKzG,EAAK,IAETwG,EAAQ7F,eAAeX,EAAK,MAC/BwG,EAAQxG,EAAK,KAAM,EACnBoG,EAAMK,KAAK,CAACzG,EAAK,IAAI,IACrBohB,EAAaD,EAAWnhB,EAAK,KAAK4B,GAAKwE,EAAMK,KAAK,CAAC7E,GAAG,MAG5D,CACF,CAEA,SAASyf,EAAY7gB,EAAG2gB,EAAY3a,EAASI,GAE3C,IADA,IAAIR,EAAQ,CAAC5F,GACN4F,EAAM1F,OAAS,GAAG,CACvB,IAAIV,EAAOoG,EAAMG,MACZC,EAAQ7F,eAAeX,KAC1BwG,EAAQxG,IAAQ,EAChB4G,EAAIH,KAAKzG,GACTohB,EAAaD,EAAWnhB,IAAO4B,GAAKwE,EAAMK,KAAK7E,KAEnD,CACF,CAEA,SAASwf,EAAaE,EAAOC,GAE3B,IADA,IAAI7gB,EAAS4gB,EAAM5gB,OACZA,KACL6gB,EAASD,EAAM5gB,GAASA,EAAQ4gB,GAGlC,OAAOA,CACT,CAlEA3jB,EAAOC,QAUP,SAAaC,EAAGmO,EAAI7J,GACbmU,MAAMkL,QAAQxV,KACjBA,EAAK,CAACA,IAGR,IAAImV,EAAatjB,EAAEof,aAAezc,GAAK3C,EAAEsJ,WAAW3G,GAAKA,GAAK3C,EAAEohB,UAAUze,GACtEihB,EAAsB,SAAVtf,EAAmB+e,EAAeG,EAE9Cza,EAAM,GACNJ,EAAU,CAAC,EASf,OARAwF,EAAG1L,SAAQE,IACT,IAAK3C,EAAE0Q,QAAQ/N,GACb,MAAM,IAAI2M,MAAM,6BAA+B3M,GAGjDihB,EAAUjhB,EAAG2gB,EAAY3a,EAASI,EAAI,IAGjCA,CACT,mBC7BAjJ,EAAOC,QAAU,CACf8jB,WAAY,EAAQ,OACpBV,SAAU,EAAQ,OAClBW,YAAa,EAAQ,OACrBC,WAAY,EAAQ,OACpBC,cAAe,EAAQ,OACvBC,UAAW,EAAQ,OACnB5W,UAAW,EAAQ,OACnB6W,SAAU,EAAQ,OAClBC,KAAM,EAAQ,OACdC,OAAQ,EAAQ,OAChB/N,QAAS,EAAQ,6QCTnB,SAASgO,IACP,IAAK,IAAIC,EAAOrN,UAAUpU,OAAQ0hB,EAAO,IAAI9L,MAAM6L,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC/ED,EAAKC,GAAQvN,UAAUuN,GAGzB,OAAO,IAAAC,UAAQ,IAAM7hB,IACnB2hB,EAAK9hB,SAAQiiB,GAAOA,EAAI9hB,IAAM,GAEhC2hB,EACF,CAGA,MAAMI,EAA8B,oBAAXlJ,aAAqD,IAApBA,OAAOH,eAAqE,IAAlCG,OAAOH,SAASe,cAEpH,SAASuI,EAASC,GAChB,MAAMC,EAAgBvb,OAAO2S,UAAUtP,SAASmY,KAAKF,GACrD,MAAyB,oBAAlBC,GACW,oBAAlBA,CACF,CAEA,SAASE,EAAOpiB,GACd,MAAO,aAAcA,CACvB,CAEA,SAASqiB,EAAUtI,GACjB,IAAIuI,EAAuBC,EAE3B,OAAKxI,EAIDiI,EAASjI,GACJA,EAGJqI,EAAOrI,IAI8H,OAAlIuI,EAA2E,OAAlDC,EAAyBxI,EAAOyI,oBAAyB,EAASD,EAAuBE,aAAuBH,EAHxIzJ,OARAA,MAYX,CAEA,SAAS6J,EAAW1iB,GAClB,MAAM,SACJ2iB,GACEN,EAAUriB,GACd,OAAOA,aAAgB2iB,CACzB,CAEA,SAASC,EAAc5iB,GACrB,OAAIgiB,EAAShiB,IAINA,aAAgBqiB,EAAUriB,GAAM0a,WACzC,CAEA,SAASmI,EAAa7iB,GACpB,OAAOA,aAAgBqiB,EAAUriB,GAAM8iB,UACzC,CAEA,SAASC,EAAiBhJ,GACxB,OAAKA,EAIDiI,EAASjI,GACJA,EAAOrB,SAGX0J,EAAOrI,GAIR2I,EAAW3I,GACNA,EAGL6I,EAAc7I,IAAW8I,EAAa9I,GACjCA,EAAOyI,cAGT9J,SAXEA,SARAA,QAoBX,CAOA,MAAMsK,EAA4BjB,EAAY,EAAAkB,gBAAkB,EAAAC,UAEhE,SAASC,EAASC,GAChB,MAAMC,GAAa,IAAAC,QAAOF,GAI1B,OAHAJ,GAA0B,KACxBK,EAAWE,QAAUH,CAAO,KAEvB,IAAAI,cAAY,WACjB,IAAK,IAAI9B,EAAOrN,UAAUpU,OAAQke,EAAO,IAAItI,MAAM6L,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAC/EzD,EAAKyD,GAAQvN,UAAUuN,GAGzB,OAA6B,MAAtByB,EAAWE,aAAkB,EAASF,EAAWE,WAAWpF,EACrE,GAAG,GACL,CAEA,SAASsF,IACP,MAAMC,GAAc,IAAAJ,QAAO,MAU3B,MAAO,EATK,IAAAE,cAAY,CAACG,EAAUC,KACjCF,EAAYH,QAAUM,YAAYF,EAAUC,EAAS,GACpD,KACW,IAAAJ,cAAY,KACI,OAAxBE,EAAYH,UACdO,cAAcJ,EAAYH,SAC1BG,EAAYH,QAAU,KACxB,GACC,IAEL,CAEA,SAASQ,EAAe7lB,EAAO8lB,QACR,IAAjBA,IACFA,EAAe,CAAC9lB,IAGlB,MAAM+lB,GAAW,IAAAX,QAAOplB,GAMxB,OALA8kB,GAA0B,KACpBiB,EAASV,UAAYrlB,IACvB+lB,EAASV,QAAUrlB,EACrB,GACC8lB,GACIC,CACT,CAEA,SAASC,EAAYC,EAAUH,GAC7B,MAAMC,GAAW,IAAAX,UACjB,OAAO,IAAAzB,UAAQ,KACb,MAAMuC,EAAWD,EAASF,EAASV,SAEnC,OADAU,EAASV,QAAUa,EACZA,CAAQ,GAEjB,IAAIJ,GACN,CAEA,SAASK,EAAWC,GAClB,MAAMC,EAAkBpB,EAASmB,GAC3BtkB,GAAO,IAAAsjB,QAAO,MACdkB,GAAa,IAAAhB,cAAYvB,IACzBA,IAAYjiB,EAAKujB,UACA,MAAnBgB,GAAmCA,EAAgBtC,EAASjiB,EAAKujB,UAGnEvjB,EAAKujB,QAAUtB,CAAO,GAExB,IACA,MAAO,CAACjiB,EAAMwkB,EAChB,CAEA,SAASC,EAAYvmB,GACnB,MAAM4jB,GAAM,IAAAwB,UAIZ,OAHA,IAAAJ,YAAU,KACRpB,EAAIyB,QAAUrlB,CAAK,GAClB,CAACA,IACG4jB,EAAIyB,OACb,CAEA,IAAImB,EAAM,CAAC,EACX,SAASC,EAAY3lB,EAAQd,GAC3B,OAAO,IAAA2jB,UAAQ,KACb,GAAI3jB,EACF,OAAOA,EAGT,MAAMuY,EAAoB,MAAfiO,EAAI1lB,GAAkB,EAAI0lB,EAAI1lB,GAAU,EAEnD,OADA0lB,EAAI1lB,GAAUyX,EACPzX,EAAS,IAAMyX,CAAE,GACvB,CAACzX,EAAQd,GACd,CAEA,SAAS0mB,EAAmBC,GAC1B,OAAO,SAAUC,GACf,IAAK,IAAIpD,EAAOrN,UAAUpU,OAAQ8kB,EAAc,IAAIlP,MAAM6L,EAAO,EAAIA,EAAO,EAAI,GAAIE,EAAO,EAAGA,EAAOF,EAAME,IACzGmD,EAAYnD,EAAO,GAAKvN,UAAUuN,GAGpC,OAAOmD,EAAYpkB,QAAO,CAACqkB,EAAaC,KACtC,MAAM/d,EAAUP,OAAOO,QAAQ+d,GAE/B,IAAK,MAAOnY,EAAKoY,KAAoBhe,EAAS,CAC5C,MAAMhJ,EAAQ8mB,EAAYlY,GAEb,MAAT5O,IACF8mB,EAAYlY,GAAO5O,EAAQ2mB,EAAWK,EAE1C,CAEA,OAAOF,CAAW,GACjB,IAAKF,GAEV,CACF,CAEA,MAAMxY,EAAmBsY,EAAmB,GACtCO,EAAwBP,GAAoB,GAMlD,SAASQ,EAAgBC,GACvB,IAAKA,EACH,OAAO,EAGT,MAAM,cACJC,GACEjD,EAAUgD,EAAMtL,QACpB,OAAOuL,GAAiBD,aAAiBC,CAC3C,CAiBA,SAASC,EAAoBF,GAC3B,GAhBF,SAAsBA,GACpB,IAAKA,EACH,OAAO,EAGT,MAAM,WACJG,GACEnD,EAAUgD,EAAMtL,QACpB,OAAOyL,GAAcH,aAAiBG,CACxC,CAOMC,CAAaJ,GAAQ,CACvB,GAAIA,EAAMK,SAAWL,EAAMK,QAAQzlB,OAAQ,CACzC,MACE0lB,QAASnnB,EACTonB,QAASxnB,GACPinB,EAAMK,QAAQ,GAClB,MAAO,CACLlnB,IACAJ,IAEJ,CAAO,GAAIinB,EAAMQ,gBAAkBR,EAAMQ,eAAe5lB,OAAQ,CAC9D,MACE0lB,QAASnnB,EACTonB,QAASxnB,GACPinB,EAAMQ,eAAe,GACzB,MAAO,CACLrnB,IACAJ,IAEJ,CACF,CAEA,OArDF,SAAwCinB,GACtC,MAAO,YAAaA,GAAS,YAAaA,CAC5C,CAmDMS,CAA+BT,GAC1B,CACL7mB,EAAG6mB,EAAMM,QACTvnB,EAAGinB,EAAMO,SAIN,IACT,CAEA,MAAMG,EAAmBpf,OAAO2Y,OAAO,CACrC0G,UAAW,CACT,QAAAhc,CAASnM,GACP,IAAKA,EACH,OAGF,MAAM,EACJW,EAAC,EACDJ,GACEP,EACJ,MAAO,gBAAkBW,EAAImF,KAAKsiB,MAAMznB,GAAK,GAAK,QAAUJ,EAAIuF,KAAKsiB,MAAM7nB,GAAK,GAAK,QACvF,GAGF8nB,MAAO,CACL,QAAAlc,CAASnM,GACP,IAAKA,EACH,OAGF,MAAM,OACJsoB,EAAM,OACNC,GACEvoB,EACJ,MAAO,UAAYsoB,EAAS,YAAcC,EAAS,GACrD,GAGFC,UAAW,CACT,QAAArc,CAASnM,GACP,GAAKA,EAIL,MAAO,CAACkoB,EAAIC,UAAUhc,SAASnM,GAAYkoB,EAAIG,MAAMlc,SAASnM,IAAYuM,KAAK,IACjF,GAGFkc,WAAY,CACV,QAAAtc,CAASrM,GACP,IAAI,SACF4oB,EAAQ,SACR3C,EAAQ,OACR4C,GACE7oB,EACJ,OAAO4oB,EAAW,IAAM3C,EAAW,MAAQ4C,CAC7C,KAKEC,EAAW,yIACjB,SAASC,EAAuBzE,GAC9B,OAAIA,EAAQ0E,QAAQF,GACXxE,EAGFA,EAAQ2E,cAAcH,EAC/B,mBCnTAvpB,EAAOC,QAAU,CACf0pB,SAAU,EAAQ,OAElBC,OAAQ,EAAQ,OAChBC,MAAO,EAAQ,OACfloB,KAAM,CACJ+P,KAAM,cACNE,OAAQ,iBAEVoF,QAAS,EAAQ,yBC/BnB,IAAIrV,EAAO,EAAQ,OAoDnB,SAASiB,EAAI1C,EAAG8F,EAAMoB,EAAS3E,EAAQrB,EAAQ0oB,EAAQjnB,GACrD,IAAIH,EAAWxC,EAAEwC,SAASG,GAC1B,IAAKH,EAASK,OAIZ,YAHIF,IAAMmD,GACR9F,EAAEsC,QAAQwD,EAAMnD,EAAG,CAAEJ,OAAQ,EAAGoQ,OAAQzL,KAK5C,IAAInG,EAAMU,EAAKC,cAAc1B,EAAG,OAC5BiB,EAASQ,EAAKC,cAAc1B,EAAG,OAC/BgC,EAAQhC,EAAE4C,KAAKD,GAEnB3C,EAAEqC,UAAUtB,EAAK4B,GACjBX,EAAMsR,UAAYvS,EAClBf,EAAEqC,UAAUpB,EAAQ0B,GACpBX,EAAMuR,aAAetS,EAErBuB,EAASC,SAAQ6L,IACf5L,EAAI1C,EAAG8F,EAAMoB,EAAS3E,EAAQrB,EAAQ0oB,EAAQtb,GAE9C,IAAIub,EAAY7pB,EAAE4C,KAAK0L,GACnBwb,EAAWD,EAAUvW,UAAYuW,EAAUvW,UAAYhF,EACvDyb,EAAcF,EAAUtW,aAAesW,EAAUtW,aAAejF,EAChE0b,EAAaH,EAAUvW,UAAY/Q,EAAS,EAAIA,EAChDoQ,EAASmX,IAAaC,EAAc,EAAI7oB,EAAS0oB,EAAOjnB,GAAK,EAEjE3C,EAAEsC,QAAQvB,EAAK+oB,EAAU,CACvBvnB,OAAQynB,EACRrX,OAAQA,EACRsX,aAAa,IAGfjqB,EAAEsC,QAAQynB,EAAa9oB,EAAQ,CAC7BsB,OAAQynB,EACRrX,OAAQA,EACRsX,aAAa,GACb,IAGCjqB,EAAEyN,OAAO9K,IACZ3C,EAAEsC,QAAQwD,EAAM/E,EAAK,CAAEwB,OAAQ,EAAGoQ,OAAQzR,EAAS0oB,EAAOjnB,IAE9D,CA7FA7C,EAAOC,QAAU,CACfmT,IA2BF,SAAalT,GACX,IAAI8F,EAAOrE,EAAKW,aAAapC,EAAG,OAAQ,CAAC,EAAG,SACxC4pB,EAiEN,SAAoB5pB,GAClB,IAAI4pB,EAAS,CAAC,EACd,SAASlnB,EAAIC,EAAGunB,GACd,IAAI1nB,EAAWxC,EAAEwC,SAASG,GACtBH,GAAYA,EAASK,QACvBL,EAASC,SAAQ6L,GAAS5L,EAAI4L,EAAO4b,EAAQ,KAE/CN,EAAOjnB,GAAKunB,CACd,CAEA,OADAlqB,EAAEwC,WAAWC,SAAQE,GAAKD,EAAIC,EAAG,KAC1BinB,CACT,CA5EeO,CAAWnqB,GACpBkB,EAASqF,KAAK2B,OAAOqB,OAAOI,OAAOigB,IAAW,EAC9C1iB,EAAU,EAAIhG,EAAS,EAE3BlB,EAAEC,QAAQmqB,YAActkB,EAGxB9F,EAAE4L,QAAQnJ,SAAQuG,GAAKhJ,EAAEiI,KAAKe,GAAG2J,QAAUzL,IAG3C,IAAI3E,EAoEN,SAAoBvC,GAClB,OAAOA,EAAE4L,QAAQrI,QAAO,CAACwF,EAAKC,IAAMD,EAAM/I,EAAEiI,KAAKe,GAAGzG,QAAQ,EAC9D,CAtEe8nB,CAAWrqB,GAAK,EAG7BA,EAAEwC,WAAWC,SAAQ6L,GAAS5L,EAAI1C,EAAG8F,EAAMoB,EAAS3E,EAAQrB,EAAQ0oB,EAAQtb,KAI5EtO,EAAEC,QAAQuY,eAAiBtR,CAC7B,EA9CEmM,QA8GF,SAAiBrT,GACf,IAAIgH,EAAahH,EAAEC,QACnBD,EAAE0T,WAAW1M,EAAWojB,oBACjBpjB,EAAWojB,YAClBpqB,EAAE4L,QAAQnJ,SAAQuG,IACLhJ,EAAEiI,KAAKe,GACTihB,aACPjqB,EAAEgT,WAAWhK,EACf,GAEJ,oBC5HA,IAAI7F,EAAQ,EAAQ,OA4BpB,SAASmnB,EAAWtqB,GAClB,OAAOA,EAAEwI,QAAQsC,KAAI,SAASnI,GAC5B,IAAI4nB,EAAYvqB,EAAE4C,KAAKD,GACnB8K,EAASzN,EAAEyN,OAAO9K,GAClBC,EAAO,CAAED,EAAGA,GAOhB,YANkBmM,IAAdyb,IACF3nB,EAAK9B,MAAQypB,QAEAzb,IAAXrB,IACF7K,EAAK6K,OAASA,GAET7K,CACT,GACF,CAEA,SAAS4nB,EAAWxqB,GAClB,OAAOA,EAAE4L,QAAQd,KAAI,SAAS9B,GAC5B,IAAIyhB,EAAYzqB,EAAEiI,KAAKe,GACnBf,EAAO,CAAEtF,EAAGqG,EAAErG,EAAGoB,EAAGiF,EAAEjF,GAO1B,YANe+K,IAAX9F,EAAE6C,OACJ5D,EAAK4D,KAAO7C,EAAE6C,WAEEiD,IAAd2b,IACFxiB,EAAKnH,MAAQ2pB,GAERxiB,CACT,GACF,CArDAnI,EAAOC,QAAU,CACf2qB,MAQF,SAAe1qB,GACb,IAAI4W,EAAO,CACT+T,QAAS,CACP3Q,SAAUha,EAAEof,aACZ1T,WAAY1L,EAAEmX,eACd1L,SAAUzL,EAAEygB,cAEdjY,MAAO8hB,EAAWtqB,GAClB4L,MAAO4e,EAAWxqB,IAMpB,YAHkB8O,IAAd9O,EAAEC,UACJ2W,EAAK9V,MAAQ8pB,gBAAgB5qB,EAAEC,UAE1B2W,CACT,EAtBEiU,KA+DF,SAAcjU,GACZ,IAAI5W,EAAI,IAAImD,EAAMyT,EAAK+T,SAAShf,SAASiL,EAAK9V,OAU9C,OATA8V,EAAKpO,MAAM/F,SAAQ,SAASwJ,GAC1BjM,EAAE8H,QAAQmE,EAAMtJ,EAAGsJ,EAAMnL,OACrBmL,EAAMwB,QACRzN,EAAEqC,UAAU4J,EAAMtJ,EAAGsJ,EAAMwB,OAE/B,IACAmJ,EAAKhL,MAAMnJ,SAAQ,SAASwJ,GAC1BjM,EAAEsC,QAAQ,CAAEK,EAAGsJ,EAAMtJ,EAAGoB,EAAGkI,EAAMlI,EAAG8H,KAAMI,EAAMJ,MAAQI,EAAMnL,MAChE,IACOd,CACT,oBC9EAF,EAAOC,QAAU,CACfoD,MAAO,EAAQ,OACf2T,QAAS,EAAQ,mBCHnBhX,EAAOC,QAEP,SAAoBC,GAClB,IAEI0W,EAFA/N,EAAU,CAAC,EACXmiB,EAAQ,GAGZ,SAASpoB,EAAIC,GACPgG,EAAQ7F,eAAeH,KAC3BgG,EAAQhG,IAAK,EACb+T,EAAK9N,KAAKjG,GACV3C,EAAEsJ,WAAW3G,GAAGF,QAAQC,GACxB1C,EAAEiE,aAAatB,GAAGF,QAAQC,GAC5B,CAUA,OARA1C,EAAEwI,QAAQ/F,SAAQ,SAASE,GACzB+T,EAAO,GACPhU,EAAIC,GACA+T,EAAK7T,QACPioB,EAAMliB,KAAK8N,EAEf,IAEOoU,CACT,gCCtBA,IAAIC,EAAY,EAAQ,OACpBpa,EAAW,kBAEf7Q,EAAOC,QAAU,CACfmT,IAIF,SAAalT,IACwB,WAAxBA,EAAEC,QAAQ+qB,UACjBD,EAAU/qB,EAUd,SAAkBA,GAChB,OAAOgJ,GACEhJ,EAAEiI,KAAKe,GAAGzG,MAErB,CAdiB0X,CAASja,IAiB5B,SAAgBA,GACd,IAAIirB,EAAM,GACN1iB,EAAQ,CAAC,EACTI,EAAU,CAAC,EAmBf,OADA3I,EAAEwI,QAAQ/F,SAhBV,SAASC,EAAIC,GACPgG,EAAQ7F,eAAeH,KAG3BgG,EAAQhG,IAAK,EACb4F,EAAM5F,IAAK,EACX3C,EAAEmJ,SAASxG,GAAGF,SAAQuG,IAChBT,EAAMzF,eAAekG,EAAEjF,GACzBknB,EAAIriB,KAAKI,GAETtG,EAAIsG,EAAEjF,EACR,WAEKwE,EAAM5F,GACf,IAGOsoB,CACT,CAvCMC,CAAOlrB,IACPyC,SAAQuG,IACV,IAAIhH,EAAQhC,EAAEiI,KAAKe,GACnBhJ,EAAEgT,WAAWhK,GACbhH,EAAMmpB,YAAcniB,EAAE6C,KACtB7J,EAAM6T,UAAW,EACjB7V,EAAEsC,QAAQ0G,EAAEjF,EAAGiF,EAAErG,EAAGX,EAAO2O,EAAS,OAAO,GAQ/C,EApBE6D,KA+CF,SAAcxU,GACZA,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAIhH,EAAQhC,EAAEiI,KAAKe,GACnB,GAAIhH,EAAM6T,SAAU,CAClB7V,EAAEgT,WAAWhK,GAEb,IAAImiB,EAAcnpB,EAAMmpB,mBACjBnpB,EAAM6T,gBACN7T,EAAMmpB,YACbnrB,EAAEsC,QAAQ0G,EAAEjF,EAAGiF,EAAErG,EAAGX,EAAOmpB,EAC7B,IAEJ,oBClEA,IAAIzoB,EAAM,EAAQ,OAElB5C,EAAOC,QAEP,SAAmBC,EAAGmO,GACpB,OAAOzL,EAAI1C,EAAGmO,EAAI,OACpB,gCCJA,IAAIkK,EAAY,mBA4BhB,SAAS+S,EAAmBprB,EAAGqrB,EAAYC,GAIzC,IAAIvmB,EAAWsT,EAAUiT,EAAYA,EAAWxgB,KAAI,CAACnI,EAAGmB,IAAMA,KAC1DynB,EAAeF,EAAWG,SAAQ7oB,GAC7B3C,EAAEmJ,SAASxG,GAAGmI,KAAI9B,IAChB,CAAEhD,IAAKjB,EAASiE,EAAEjF,GAAIxB,OAAQvC,EAAEiI,KAAKe,GAAGzG,WAC9C4D,MAAK,CAACC,EAAGC,IAAMD,EAAEJ,IAAMK,EAAEL,QAI1BylB,EAAa,EACjB,KAAOA,EAAaH,EAAWzoB,QAAQ4oB,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIE,EAAO,IAAIlT,MAAMiT,GAAUE,KAAK,GAGhCC,EAAK,EAeT,OAdAN,EAAa9oB,SAAQwJ,IACnB,IAAI2D,EAAQ3D,EAAMjG,IAAMylB,EACxBE,EAAK/b,IAAU3D,EAAM1J,OACrB,IAAIupB,EAAY,EAChB,KAAOlc,EAAQ,GACTA,EAAQ,IACVkc,GAAaH,EAAK/b,EAAQ,IAE5BA,EAASA,EAAQ,GAAM,EACvB+b,EAAK/b,IAAU3D,EAAM1J,OAEvBspB,GAAM5f,EAAM1J,OAASupB,CAAS,IAGzBD,CACT,CA7DA/rB,EAAOC,QAkBP,SAAoBC,EAAGqD,GACrB,IAAIwoB,EAAK,EACT,IAAK,IAAI/nB,EAAI,EAAGA,EAAIT,EAASR,SAAUiB,EACrC+nB,GAAMT,EAAmBprB,EAAGqD,EAASS,EAAE,GAAIT,EAASS,IAEtD,OAAO+nB,CACT,gCC1BA,IAAIpqB,EAAO,EAAQ,OAEnB3B,EAAOC,QAAU,CACfmT,IAoBF,SAAalT,GACXA,EAAEC,QAAQqN,YAAc,GACxBtN,EAAE4L,QAAQnJ,SAAQwF,GAGpB,SAAuBjI,EAAGgJ,GACxB,IAYIhF,EAAOmR,EAAOrR,EAZdnB,EAAIqG,EAAErG,EACNopB,EAAQ/rB,EAAE4C,KAAKD,GAAGZ,KAClBgC,EAAIiF,EAAEjF,EACNioB,EAAQhsB,EAAE4C,KAAKmB,GAAGhC,KAClB8J,EAAO7C,EAAE6C,KACTogB,EAAYjsB,EAAEiI,KAAKe,GACnByK,EAAYwY,EAAUxY,UAE1B,GAAIuY,IAAUD,EAAQ,EAAtB,CAKA,IAHA/rB,EAAEgT,WAAWhK,GAGRlF,EAAI,IAAKioB,EAAOA,EAAQC,IAASloB,IAAKioB,EACzCE,EAAU9X,OAAS,GACnBgB,EAAQ,CACN7T,MAAO,EAAGJ,OAAQ,EAClB+qB,UAAWA,EAAW1e,QAASvE,EAC/BjH,KAAMgqB,GAER/nB,EAAQvC,EAAKW,aAAapC,EAAG,OAAQmV,EAAO,MACxC4W,IAAUtY,IACZ0B,EAAM7T,MAAQ2qB,EAAU3qB,MACxB6T,EAAMjU,OAAS+qB,EAAU/qB,OACzBiU,EAAMnR,MAAQ,aACdmR,EAAM3N,SAAWykB,EAAUzkB,UAE7BxH,EAAEsC,QAAQK,EAAGqB,EAAO,CAAEzB,OAAQ0pB,EAAU1pB,QAAUsJ,GACxC,IAAN/H,GACF9D,EAAEC,QAAQqN,YAAY1E,KAAK5E,GAE7BrB,EAAIqB,EAGNhE,EAAEsC,QAAQK,EAAGoB,EAAG,CAAExB,OAAQ0pB,EAAU1pB,QAAUsJ,EA1Bf,CA2BjC,CAvC4BqgB,CAAclsB,EAAGiI,IAC7C,EAtBEuM,KA8DF,SAAcxU,GACZA,EAAEC,QAAQqN,YAAY7K,SAAQE,IAC5B,IAEIoB,EAFAnB,EAAO5C,EAAE4C,KAAKD,GACdwpB,EAAYvpB,EAAKqpB,UAGrB,IADAjsB,EAAEsC,QAAQM,EAAK2K,QAAS4e,GACjBvpB,EAAKoB,OACVD,EAAI/D,EAAEsJ,WAAW3G,GAAG,GACpB3C,EAAE0T,WAAW/Q,GACbwpB,EAAUhY,OAAOvL,KAAK,CAAExH,EAAGwB,EAAKxB,EAAGJ,EAAG4B,EAAK5B,IACxB,eAAf4B,EAAKoB,QACPmoB,EAAU/qB,EAAIwB,EAAKxB,EACnB+qB,EAAUnrB,EAAI4B,EAAK5B,EACnBmrB,EAAU7qB,MAAQsB,EAAKtB,MACvB6qB,EAAUjrB,OAAS0B,EAAK1B,QAE1ByB,EAAIoB,EACJnB,EAAO5C,EAAE4C,KAAKD,EAChB,GAEJ,cCxFA7C,EAAOC,QAEP,SAAoBC,EAAGosB,EAAU,IAC/B,OAAOA,EAAQthB,KAAInI,IACjB,IAAI0f,EAAMriB,EAAE8I,QAAQnG,GACpB,GAAK0f,EAAIxf,OAEF,CACL,IAAIqK,EAASmV,EAAI9e,QAAO,CAACwF,EAAKC,KAC5B,IAAIf,EAAOjI,EAAEiI,KAAKe,GAChBqjB,EAAQrsB,EAAE4C,KAAKoG,EAAErG,GACnB,MAAO,CACL4E,IAAKwB,EAAIxB,IAAOU,EAAK1F,OAAS8pB,EAAM/nB,MACpC/B,OAAQwG,EAAIxG,OAAS0F,EAAK1F,OAC3B,GACA,CAAEgF,IAAK,EAAGhF,OAAQ,IAErB,MAAO,CACLI,EAAGA,EACH4b,WAAYrR,EAAO3F,IAAM2F,EAAO3K,OAChCA,OAAQ2K,EAAO3K,OAEnB,CAhBE,MAAO,CAAEI,EAAGA,EAgBd,GAEJ,gCCtBA,IAAI2pB,EAAY,EAAQ,OACpBC,EAAa,EAAQ,OACrBC,EAAe,EAAQ,OACvBC,EAAkB,EAAQ,OAC1BC,EAAyB,EAAQ,OACjCvpB,EAAQ,eACR1B,EAAO,EAAQ,OAsDnB,SAASkrB,EAAiB3sB,EAAG4sB,EAAOnc,GAClC,OAAOmc,EAAM9hB,KAAI,SAAS/I,GACxB,OAAO0qB,EAAgBzsB,EAAG+B,EAAM0O,EAClC,GACF,CAEA,SAASoc,EAAiBC,EAAa9O,GACrC,IAAI9P,EAAK,IAAI/K,EACb2pB,EAAYrqB,SAAQ,SAASsqB,GAC3B,IAAIjnB,EAAOinB,EAAG9sB,QAAQ6F,KAClBknB,EAASR,EAAaO,EAAIjnB,EAAMoI,EAAI8P,GACxCgP,EAAO7e,GAAG1L,SAAQ,CAACE,EAAGmB,IAAMipB,EAAGnqB,KAAKD,GAAG2B,MAAQR,IAC/C4oB,EAAuBK,EAAI7e,EAAI8e,EAAO7e,GACxC,GACF,CAEA,SAAS8e,EAAYjtB,EAAGqD,GACtBkG,OAAOI,OAAOtG,GAAUZ,SAAQgB,GAASA,EAAMhB,SAAQ,CAACE,EAAGmB,IAAM9D,EAAE4C,KAAKD,GAAG2B,MAAQR,KACrF,CAtEAhE,EAAOC,QAiBP,SAASuE,EAAMtE,EAAGuR,GAChB,GAAIA,GAAoC,mBAArBA,EAAK2b,YAEtB,YADA3b,EAAK2b,YAAYltB,EAAGsE,GAItB,IAAIpB,EAAUzB,EAAKyB,QAAQlD,GACzBmtB,EAAkBR,EAAiB3sB,EAAGyB,EAAK0D,MAAM,EAAGjC,EAAU,GAAI,WAClEkqB,EAAgBT,EAAiB3sB,EAAGyB,EAAK0D,MAAMjC,EAAU,GAAI,GAAI,GAAI,YAEnEG,EAAWipB,EAAUtsB,GAGzB,GAFAitB,EAAYjtB,EAAGqD,GAEXkO,GAAQA,EAAK8b,6BACf,OAGF,IACEC,EADEC,EAASnkB,OAAOC,kBAGpB,IAAK,IAAIvF,EAAI,EAAG0pB,EAAW,EAAGA,EAAW,IAAK1pB,IAAK0pB,EAAU,CAC3DX,EAAiB/oB,EAAI,EAAIqpB,EAAkBC,EAAetpB,EAAI,GAAK,GAEnET,EAAW5B,EAAKwJ,iBAAiBjL,GACjC,IAAI6rB,EAAKU,EAAWvsB,EAAGqD,GACnBwoB,EAAK0B,IACPC,EAAW,EACXF,EAAO/jB,OAAO2B,OAAO,CAAC,EAAG7H,GACzBkqB,EAAS1B,EAEb,CAEAoB,EAAYjtB,EAAGstB,EACjB,mBC5DA,IAAInqB,EAAQ,eACRsqB,EAAO,EAAQ,OASnB3tB,EAAOC,QAIP,SAAmBC,EAAGia,GACpB,GAAIja,EAAEiP,aAAe,EACnB,MAAO,GAET,IAAIye,EA0DN,SAAoB1tB,EAAGia,GACrB,IAAI0T,EAAW,IAAIxqB,EACfyqB,EAAQ,EACRC,EAAS,EAEb7tB,EAAEwI,QAAQ/F,SAAQE,IAChBgrB,EAAS7lB,QAAQnF,EAAG,CAAEA,EAAGA,EAAG,GAAM,EAAGggB,IAAK,GAAI,IAKhD3iB,EAAE4L,QAAQnJ,SAAQuG,IAChB,IAAI8kB,EAAaH,EAAS1lB,KAAKe,EAAErG,EAAGqG,EAAEjF,IAAM,EACxCxB,EAAS0X,EAASjR,GAClB+F,EAAa+e,EAAavrB,EAC9BorB,EAASrrB,QAAQ0G,EAAErG,EAAGqG,EAAEjF,EAAGgL,GAC3B8e,EAAStnB,KAAK2B,IAAI2lB,EAAQF,EAAS/qB,KAAKoG,EAAErG,GAAGggB,KAAOpgB,GACpDqrB,EAASrnB,KAAK2B,IAAI0lB,EAAQD,EAAS/qB,KAAKoG,EAAEjF,GAAO,IAAMxB,EAAO,IAGhE,IAAIwrB,EAoBN,SAAezU,GACb,MAAMnU,EAAQ,GACd,IAAK,IAAIrB,EAAI,EAAGA,EAAIwV,EAAOxV,IACzBqB,EAAMyD,KAAK9E,GAGb,OAAOqB,CACT,CA3BgBA,CAAM0oB,EAASD,EAAQ,GAAG9iB,KAAI,IAAM,IAAI2iB,IAClDO,EAAUJ,EAAQ,EAMtB,OAJAD,EAASnlB,QAAQ/F,SAAQE,IACvBsrB,EAAaF,EAASC,EAASL,EAAS/qB,KAAKD,GAAG,IAG3C,CAAE1C,MAAO0tB,EAAUI,QAASA,EAASC,QAASA,EACvD,CAtFcE,CAAWluB,EAAGia,GAAYkU,GAItC,OAGF,SAAqBnuB,EAAG+tB,EAASC,GAC/B,IAII/hB,EAJAsK,EAAU,GACVoK,EAAUoN,EAAQA,EAAQlrB,OAAS,GACnCge,EAAQkN,EAAQ,GAGpB,KAAO/tB,EAAEiP,aAAa,CACpB,KAAQhD,EAAQ4U,EAAMnU,WAAgBgH,EAAW1T,EAAG+tB,EAASC,EAAS/hB,GACtE,KAAQA,EAAQ0U,EAAQjU,WAAcgH,EAAW1T,EAAG+tB,EAASC,EAAS/hB,GACtE,GAAIjM,EAAEiP,YACJ,IAAK,IAAInL,EAAIiqB,EAAQlrB,OAAS,EAAGiB,EAAI,IAAKA,EAExC,GADAmI,EAAQ8hB,EAAQjqB,GAAG4I,UACfT,EAAO,CACTsK,EAAUA,EAAQ1N,OAAO6K,EAAW1T,EAAG+tB,EAASC,EAAS/hB,GAAO,IAChE,KACF,CAGN,CAEA,OAAOsK,CACT,CA3BgB6X,CAAYV,EAAMztB,MAAOytB,EAAMK,QAASL,EAAMM,SAG7CxC,SAAQxiB,GAAKhJ,EAAEmJ,SAASH,EAAErG,EAAGqG,EAAEjF,IAChD,EAXA,IAAIoqB,EAAoB,IAAM,EAoC9B,SAASza,EAAW1T,EAAG+tB,EAASC,EAAS/hB,EAAOoiB,GAC9C,IAAI9X,EAAU8X,EAAsB,QAAKvf,EAwBzC,OAtBA9O,EAAE8I,QAAQmD,EAAMtJ,GAAGF,SAAQwF,IACzB,IAAI1F,EAASvC,EAAEiI,KAAKA,GAChB6a,EAAS9iB,EAAE4C,KAAKqF,EAAKtF,GAErB0rB,GACF9X,EAAQ3N,KAAK,CAAEjG,EAAGsF,EAAKtF,EAAGoB,EAAGkE,EAAKlE,IAGpC+e,EAAOH,KAAOpgB,EACd0rB,EAAaF,EAASC,EAASlL,EAAO,IAGxC9iB,EAAEmJ,SAAS8C,EAAMtJ,GAAGF,SAAQwF,IAC1B,IAAI1F,EAASvC,EAAEiI,KAAKA,GAChBlE,EAAIkE,EAAKlE,EACTqW,EAASpa,EAAE4C,KAAKmB,GACpBqW,EAAW,IAAK7X,EAChB0rB,EAAaF,EAASC,EAAS5T,EAAO,IAGxCpa,EAAE0T,WAAWzH,EAAMtJ,GAEZ4T,CACT,CAgCA,SAAS0X,EAAaF,EAASC,EAAS/hB,GACjCA,EAAM0W,IAEC1W,EAAU,GAGpB8hB,EAAQ9hB,EAAM0W,IAAM1W,EAAU,GAAI+hB,GAASrhB,QAAQV,GAFnD8hB,EAAQA,EAAQlrB,OAAS,GAAG8J,QAAQV,GAFpC8hB,EAAQ,GAAGphB,QAAQV,EAMvB,mBClHA,IAAImY,EAAS,EAAQ,OAErBtkB,EAAOC,QAEP,SAAoBC,GAClB,OAAOokB,EAAOpkB,GAAG4gB,QAAO,SAASlK,GAC/B,OAAOA,EAAK7T,OAAS,GAAsB,IAAhB6T,EAAK7T,QAAgB7C,EAAEoiB,QAAQ1L,EAAK,GAAIA,EAAK,GAC1E,GACF,sLCNA,MAAM4X,EAAe,CACnBC,QAAS,QAEX,SAASC,EAAWjuB,GAClB,IAAI,GACF8Y,EAAE,MACFvY,GACEP,EACJ,OAAO,kBAAoB,MAAO,CAChC8Y,GAAIA,EACJtN,MAAOuiB,GACNxtB,EACL,CAEA,SAAS2tB,EAAWluB,GAClB,IAAI,GACF8Y,EAAE,aACFqV,EAAY,aACZC,EAAe,aACbpuB,EAgBJ,OAAO,kBAAoB,MAAO,CAChC8Y,GAAIA,EACJtN,MAhBqB,CACrBuF,SAAU,QACVvQ,IAAK,EACLI,KAAM,EACNG,MAAO,EACPJ,OAAQ,EACR0tB,QAAS,EACTC,OAAQ,EACRC,QAAS,EACTC,SAAU,SACVC,KAAM,gBACNC,SAAU,cACVC,WAAY,UAKZC,KAAM,SACN,YAAaR,EACb,eAAe,GACdD,EACL,CCvCA,MAAMU,GAAiC,IAAAC,eAAc,MAkC/CC,EAAkC,CACtCC,UAAW,iNAEPC,EAAuB,CAC3B,WAAAC,CAAYlvB,GACV,IAAI,OACFmvB,GACEnvB,EACJ,MAAO,4BAA8BmvB,EAAOrW,GAAK,GACnD,EAEA,UAAAsW,CAAWC,GACT,IAAI,OACFF,EAAM,KACNG,GACED,EAEJ,OAAIC,EACK,kBAAoBH,EAAOrW,GAAK,kCAAoCwW,EAAKxW,GAAK,IAGhF,kBAAoBqW,EAAOrW,GAAK,sCACzC,EAEA,SAAAyW,CAAUC,GACR,IAAI,OACFL,EAAM,KACNG,GACEE,EAEJ,OAAIF,EACK,kBAAoBH,EAAOrW,GAAK,oCAAsCwW,EAAKxW,GAG7E,kBAAoBqW,EAAOrW,GAAK,eACzC,EAEA,YAAA2W,CAAaC,GACX,IAAI,OACFP,GACEO,EACJ,MAAO,0CAA4CP,EAAOrW,GAAK,eACjE,GAIF,SAAS6W,EAAc3vB,GACrB,IAAI,cACF4vB,EAAgBX,EAAoB,UACpCY,EAAS,wBACTC,EAAuB,yBACvBC,EAA2BhB,GACzB/uB,EACJ,MAAM,SACJgwB,EAAQ,aACR7B,GDhDJ,WACE,MAAOA,EAAc8B,IAAmB,IAAAC,UAAS,IAMjD,MAAO,CACLF,UANe,IAAAnK,cAAYtlB,IACd,MAATA,GACF0vB,EAAgB1vB,EAClB,GACC,IAGD4tB,eAEJ,CCsCMgC,GACEC,GAAe,QAAY,kBAC1BC,EAASC,IAAc,IAAAJ,WAAS,GA+DvC,IA9DA,IAAA3K,YAAU,KACR+K,GAAW,EAAK,GACf,IA7FL,SAAuBtK,GACrB,MAAMuK,GAAmB,IAAAC,YAAW3B,IACpC,IAAAtJ,YAAU,KACR,IAAKgL,EACH,MAAM,IAAIxhB,MAAM,gEAIlB,OADoBwhB,EAAiBvK,EACnB,GACjB,CAACA,EAAUuK,GAChB,CAoFEE,EAAc,IAAAvM,UAAQ,KAAM,CAC1B,WAAAgL,CAAYG,GACV,IAAI,OACFF,GACEE,EACJW,EAASJ,EAAcV,YAAY,CACjCC,WAEJ,EAEA,UAAAuB,CAAWlB,GACT,IAAI,OACFL,EAAM,KACNG,GACEE,EAEAI,EAAcc,YAChBV,EAASJ,EAAcc,WAAW,CAChCvB,SACAG,SAGN,EAEA,UAAAF,CAAWM,GACT,IAAI,OACFP,EAAM,KACNG,GACEI,EACJM,EAASJ,EAAcR,WAAW,CAChCD,SACAG,SAEJ,EAEA,SAAAC,CAAUoB,GACR,IAAI,OACFxB,EAAM,KACNG,GACEqB,EACJX,EAASJ,EAAcL,UAAU,CAC/BJ,SACAG,SAEJ,EAEA,YAAAG,CAAamB,GACX,IAAI,OACFzB,EAAM,KACNG,GACEsB,EACJZ,EAASJ,EAAcH,aAAa,CAClCN,SACAG,SAEJ,KAEE,CAACU,EAAUJ,MAEVS,EACH,OAAO,KAGT,MAAMQ,EAAS,kBAAoB,aAAgB,KAAM,kBAAoB5C,EAAY,CACvFnV,GAAIgX,EACJvvB,MAAOwvB,EAAyBf,YAC9B,kBAAoBd,EAAY,CAClCpV,GAAIsX,EACJjC,aAAcA,KAEhB,OAAO0B,GAAY,IAAAiB,cAAaD,EAAQhB,GAAagB,CACvD,CAEA,IAAIE,EAaJ,SAASC,IAAQ,CAEjB,SAASC,EAAUC,EAAQ9G,GACzB,OAAO,IAAAlG,UAAQ,KAAM,CACnBgN,SACA9G,QAAoB,MAAXA,EAAkBA,EAAU,CAAC,KAExC,CAAC8G,EAAQ9G,GACX,CAEA,SAAS+G,IACP,IAAK,IAAIpN,EAAOrN,UAAUpU,OAAQ8uB,EAAU,IAAIlZ,MAAM6L,GAAOE,EAAO,EAAGA,EAAOF,EAAME,IAClFmN,EAAQnN,GAAQvN,UAAUuN,GAG5B,OAAO,IAAAC,UAAQ,IAAM,IAAIkN,GAAS/Q,QAAO6Q,GAAoB,MAAVA,KACnD,IAAIE,GACN,EA5BA,SAAWL,GACTA,EAAkB,UAAI,YACtBA,EAAiB,SAAI,WACrBA,EAAgB,QAAI,UACpBA,EAAmB,WAAI,aACvBA,EAAiB,SAAI,WACrBA,EAA0B,kBAAI,oBAC9BA,EAA6B,qBAAI,uBACjCA,EAA4B,oBAAI,qBACjC,CATD,CASGA,IAAWA,EAAS,CAAC,IAqBxB,MAAMM,EAAkCroB,OAAO2Y,OAAO,CACpD9gB,EAAG,EACHJ,EAAG,IA2BL,SAAS6wB,EAAkBtxB,EAAMqvB,GAC/B,IACEkC,MACEhxB,MAAOsF,IAEP7F,GAEFuxB,MACEhxB,MAAOuF,IAEPupB,EACJ,OAAOxpB,EAAIC,CACb,CAKA,SAAS0rB,EAAmBhC,EAAOE,GACjC,IACE6B,MACEhxB,MAAOsF,IAEP2pB,GAEF+B,MACEhxB,MAAOuF,IAEP4pB,EACJ,OAAO5pB,EAAID,CACb,CAwCA,SAAS4rB,EAAkBpxB,EAAMO,EAAMJ,GASrC,YARa,IAATI,IACFA,EAAOP,EAAKO,WAGF,IAARJ,IACFA,EAAMH,EAAKG,KAGN,CACLK,EAAGD,EAAoB,GAAbP,EAAKU,MACfN,EAAGD,EAAoB,GAAdH,EAAKM,OAElB,CAOA,MAAM+wB,EAAgB1xB,IACpB,IAAI,cACF2xB,EAAa,eACbC,EAAc,oBACdC,GACE7xB,EACJ,MAAM8xB,EAAaL,EAAkBE,EAAeA,EAAc/wB,KAAM+wB,EAAcnxB,KAChFuxB,EAAa,GAEnB,IAAK,MAAMC,KAAsBH,EAAqB,CACpD,MAAM,GACJ/Y,GACEkZ,EACE3xB,EAAOuxB,EAAeK,IAAInZ,GAEhC,GAAIzY,EAAM,CACR,MAAM6xB,GA9Hand,EA8HiB0c,EAAkBpxB,GA9H/B2U,EA8HsC8c,EA7H1D9rB,KAAKmsB,KAAKnsB,KAAKosB,IAAIrd,EAAGlU,EAAImU,EAAGnU,EAAG,GAAKmF,KAAKosB,IAAIrd,EAAGtU,EAAIuU,EAAGvU,EAAG,KA8H9DsxB,EAAW1pB,KAAK,CACdyQ,KACAyY,KAAM,CACJS,qBACAzxB,MAAO2xB,IAGb,CACF,CAvIF,IAAyBnd,EAAIC,EAyI3B,OAAO+c,EAAWnsB,KAAK0rB,EAAkB,EA8C3C,SAASe,EAAqB3mB,EAAO0Q,GACnC,MAAM5b,EAAMwF,KAAK2B,IAAIyU,EAAO5b,IAAKkL,EAAMlL,KACjCI,EAAOoF,KAAK2B,IAAIyU,EAAOxb,KAAM8K,EAAM9K,MACnCE,EAAQkF,KAAK2C,IAAIyT,EAAOxb,KAAOwb,EAAOrb,MAAO2K,EAAM9K,KAAO8K,EAAM3K,OAChEL,EAASsF,KAAK2C,IAAIyT,EAAO5b,IAAM4b,EAAOzb,OAAQ+K,EAAMlL,IAAMkL,EAAM/K,QAChEI,EAAQD,EAAQF,EAChBD,EAASD,EAASF,EAExB,GAAII,EAAOE,GAASN,EAAME,EAAQ,CAChC,MAAM4xB,EAAalW,EAAOrb,MAAQqb,EAAOzb,OACnC4xB,EAAY7mB,EAAM3K,MAAQ2K,EAAM/K,OAChC6xB,EAAmBzxB,EAAQJ,EAEjC,OAAOkI,QADmB2pB,GAAoBF,EAAaC,EAAYC,IACvCC,QAAQ,GAC1C,CAGA,OAAO,CACT,CAMA,MAAMC,EAAmB1yB,IACvB,IAAI,cACF2xB,EAAa,eACbC,EAAc,oBACdC,GACE7xB,EACJ,MAAM+xB,EAAa,GAEnB,IAAK,MAAMC,KAAsBH,EAAqB,CACpD,MAAM,GACJ/Y,GACEkZ,EACE3xB,EAAOuxB,EAAeK,IAAInZ,GAEhC,GAAIzY,EAAM,CACR,MAAMsyB,EAAoBN,EAAqBhyB,EAAMsxB,GAEjDgB,EAAoB,GACtBZ,EAAW1pB,KAAK,CACdyQ,KACAyY,KAAM,CACJS,qBACAzxB,MAAOoyB,IAIf,CACF,CAEA,OAAOZ,EAAWnsB,KAAK4rB,EAAmB,EAuE5C,SAASoB,EAAaC,EAAOC,GAC3B,OAAOD,GAASC,EAAQ,CACtBjyB,EAAGgyB,EAAMjyB,KAAOkyB,EAAMlyB,KACtBH,EAAGoyB,EAAMryB,IAAMsyB,EAAMtyB,KACnB6wB,CACN,CAEA,SAAS0B,EAAuB7L,GAC9B,OAAO,SAA0B7mB,GAC/B,IAAK,IAAI0jB,EAAOrN,UAAUpU,OAAQ8kB,EAAc,IAAIlP,MAAM6L,EAAO,EAAIA,EAAO,EAAI,GAAIE,EAAO,EAAGA,EAAOF,EAAME,IACzGmD,EAAYnD,EAAO,GAAKvN,UAAUuN,GAGpC,OAAOmD,EAAYpkB,QAAO,CAACwF,EAAK8e,KAAe,IAAM9e,EACnDhI,IAAKgI,EAAIhI,IAAM0mB,EAAWI,EAAW7mB,EACrCC,OAAQ8H,EAAI9H,OAASwmB,EAAWI,EAAW7mB,EAC3CG,KAAM4H,EAAI5H,KAAOsmB,EAAWI,EAAWzmB,EACvCC,MAAO0H,EAAI1H,MAAQomB,EAAWI,EAAWzmB,KACvC,IAAKR,GAEX,CACF,CACA,MAAM2yB,EAA+BD,EAAuB,GAmD5D,MAAME,EAAiB,CACrBC,iBAAiB,GAMnB,SAASC,EAAc7O,EAAS8F,QACd,IAAZA,IACFA,EAAU6I,GAGZ,IAAI5yB,EAAOikB,EAAQ8O,wBAEnB,GAAIhJ,EAAQ8I,gBAAiB,CAC3B,MAAM,UACJhzB,EAAS,gBACTmzB,IACE,QAAU/O,GAASgP,iBAAiBhP,GAEpCpkB,IACFG,EAhDN,SAA0BA,EAAMH,EAAWmzB,GACzC,MAAME,EAvBR,SAAwBrzB,GACtB,GAAIA,EAAUszB,WAAW,aAAc,CACrC,MAAMC,EAAiBvzB,EAAU8D,MAAM,GAAI,GAAG0vB,MAAM,MACpD,MAAO,CACL7yB,GAAI4yB,EAAe,IACnBhzB,GAAIgzB,EAAe,IACnBjL,QAASiL,EAAe,GACxBhL,QAASgL,EAAe,GAE5B,CAAO,GAAIvzB,EAAUszB,WAAW,WAAY,CAC1C,MAAMC,EAAiBvzB,EAAU8D,MAAM,GAAI,GAAG0vB,MAAM,MACpD,MAAO,CACL7yB,GAAI4yB,EAAe,GACnBhzB,GAAIgzB,EAAe,GACnBjL,QAASiL,EAAe,GACxBhL,QAASgL,EAAe,GAE5B,CAEA,OAAO,IACT,CAG0BE,CAAezzB,GAEvC,IAAKqzB,EACH,OAAOlzB,EAGT,MAAM,OACJmoB,EAAM,OACNC,EACA5nB,EAAG+yB,EACHnzB,EAAGozB,GACDN,EACE1yB,EAAIR,EAAKO,KAAOgzB,GAAc,EAAIpL,GAAUsL,WAAWT,GACvD5yB,EAAIJ,EAAKG,IAAMqzB,GAAc,EAAIpL,GAAUqL,WAAWT,EAAgBrvB,MAAMqvB,EAAgBU,QAAQ,KAAO,IAC3GvwB,EAAIglB,EAASnoB,EAAKU,MAAQynB,EAASnoB,EAAKU,MACxCkK,EAAIwd,EAASpoB,EAAKM,OAAS8nB,EAASpoB,EAAKM,OAC/C,MAAO,CACLI,MAAOyC,EACP7C,OAAQsK,EACRzK,IAAKC,EACLK,MAAOD,EAAI2C,EACX9C,OAAQD,EAAIwK,EACZrK,KAAMC,EAEV,CAuBamzB,CAAiB3zB,EAAMH,EAAWmzB,GAE7C,CAEA,MAAM,IACJ7yB,EAAG,KACHI,EAAI,MACJG,EAAK,OACLJ,EAAM,OACND,EAAM,MACNI,GACET,EACJ,MAAO,CACLG,MACAI,OACAG,QACAJ,SACAD,SACAI,QAEJ,CAUA,SAASmzB,EAA+B3P,GACtC,OAAO6O,EAAc7O,EAAS,CAC5B4O,iBAAiB,GAErB,CAoCA,SAASgB,EAAuB5P,EAASvL,GACvC,MAAMob,EAAgB,GAuCtB,OAAK7P,EArCL,SAAS8P,EAAwB/xB,GAC/B,GAAa,MAAT0W,GAAiBob,EAAc7xB,QAAUyW,EAC3C,OAAOob,EAGT,IAAK9xB,EACH,OAAO8xB,EAGT,IAAI,QAAW9xB,IAAkC,MAAzBA,EAAKgyB,mBAA6BF,EAAcG,SAASjyB,EAAKgyB,kBAEpF,OADAF,EAAc9rB,KAAKhG,EAAKgyB,kBACjBF,EAGT,KAAK,QAAc9xB,KAAS,QAAaA,GACvC,OAAO8xB,EAGT,GAAIA,EAAcG,SAASjyB,GACzB,OAAO8xB,EAGT,MAAMI,GAAgB,QAAUjQ,GAASgP,iBAAiBjxB,GAQ1D,OANIA,IAASiiB,GAxCjB,SAAsBA,EAASiQ,QACP,IAAlBA,IACFA,GAAgB,QAAUjQ,GAASgP,iBAAiBhP,IAGtD,MAAMkQ,EAAgB,wBAEtB,MADmB,CAAC,WAAY,YAAa,aAC3BC,MAAK7L,IACrB,MAAMroB,EAAQg0B,EAAc3L,GAC5B,MAAwB,iBAAVroB,GAAqBi0B,EAAcjZ,KAAKhb,EAAc,GAExE,CA8BUm0B,CAAaryB,EAAMkyB,IACrBJ,EAAc9rB,KAAKhG,GAlD3B,SAAiBA,EAAMkyB,GAKrB,YAJsB,IAAlBA,IACFA,GAAgB,QAAUlyB,GAAMixB,iBAAiBjxB,IAGjB,UAA3BkyB,EAAcxjB,QACvB,CAgDQ4jB,CAAQtyB,EAAMkyB,GACTJ,EAGFC,EAAwB/xB,EAAKuyB,WACtC,CAMOR,CAAwB9P,GAHtB6P,CAIX,CACA,SAASU,EAA2BxyB,GAClC,MAAOyyB,GAA2BZ,EAAuB7xB,EAAM,GAC/D,OAAkC,MAA3ByyB,EAAkCA,EAA0B,IACrE,CAEA,SAASC,EAAqBzQ,GAC5B,OAAK,MAAcA,GAIf,QAASA,GACJA,GAGJ,QAAOA,IAIR,QAAWA,IAAYA,KAAY,QAAiBA,GAAS+P,iBACxDnZ,QAGL,QAAcoJ,GACTA,EAGF,KAXE,KARA,IAoBX,CAEA,SAAS0Q,EAAqB1Q,GAC5B,OAAI,QAASA,GACJA,EAAQ2Q,QAGV3Q,EAAQ4Q,UACjB,CACA,SAASC,EAAqB7Q,GAC5B,OAAI,QAASA,GACJA,EAAQ8Q,QAGV9Q,EAAQ+Q,SACjB,CACA,SAASC,EAAqBhR,GAC5B,MAAO,CACLzjB,EAAGm0B,EAAqB1Q,GACxB7jB,EAAG00B,EAAqB7Q,GAE5B,CAEA,IAAIiR,EAOJ,SAASC,EAA2BlR,GAClC,SAAK,OAAcA,IAIZA,IAAYvJ,SAASsZ,gBAC9B,CAEA,SAASoB,EAAkBC,GACzB,MAAMC,EAAY,CAChB90B,EAAG,EACHJ,EAAG,GAECm1B,EAAaJ,EAA2BE,GAAsB,CAClE/0B,OAAQua,OAAO2a,YACf90B,MAAOma,OAAO4a,YACZ,CACFn1B,OAAQ+0B,EAAmBK,aAC3Bh1B,MAAO20B,EAAmBM,aAEtBC,EAAY,CAChBp1B,EAAG60B,EAAmBQ,YAAcN,EAAW70B,MAC/CN,EAAGi1B,EAAmBS,aAAeP,EAAWj1B,QAMlD,MAAO,CACLy1B,MALYV,EAAmBL,WAAaM,EAAUl1B,EAMtD41B,OALaX,EAAmBR,YAAcS,EAAU90B,EAMxDy1B,SALeZ,EAAmBL,WAAaY,EAAUx1B,EAMzD81B,QALcb,EAAmBR,YAAce,EAAUp1B,EAMzDo1B,YACAN,YAEJ,EAzCA,SAAWJ,GACTA,EAAUA,EAAmB,QAAI,GAAK,UACtCA,EAAUA,EAAoB,UAAK,GAAK,UACzC,CAHD,CAGGA,IAAcA,EAAY,CAAC,IAwC9B,MAAMiB,EAAmB,CACvB31B,EAAG,GACHJ,EAAG,IAEL,SAASg2B,EAA2BC,EAAiBC,EAAqB32B,EAAM42B,EAAcC,GAC5F,IAAI,IACFr2B,EAAG,KACHI,EAAI,MACJE,EAAK,OACLJ,GACEV,OAEiB,IAAjB42B,IACFA,EAAe,SAGW,IAAxBC,IACFA,EAAsBL,GAGxB,MAAM,MACJJ,EAAK,SACLE,EAAQ,OACRD,EAAM,QACNE,GACEd,EAAkBiB,GAChBI,EAAY,CAChBj2B,EAAG,EACHJ,EAAG,GAECs2B,EAAQ,CACZl2B,EAAG,EACHJ,EAAG,GAECu2B,EACIL,EAAoBh2B,OAASk2B,EAAoBp2B,EADrDu2B,EAEGL,EAAoB51B,MAAQ81B,EAAoBh2B,EAuBzD,OApBKu1B,GAAS51B,GAAOm2B,EAAoBn2B,IAAMw2B,GAE7CF,EAAUr2B,EAAI80B,EAAU0B,SACxBF,EAAMt2B,EAAIm2B,EAAe5wB,KAAK+N,KAAK4iB,EAAoBn2B,IAAMw2B,EAAmBx2B,GAAOw2B,KAC7EV,GAAY51B,GAAUi2B,EAAoBj2B,OAASs2B,IAE7DF,EAAUr2B,EAAI80B,EAAU2B,QACxBH,EAAMt2B,EAAIm2B,EAAe5wB,KAAK+N,KAAK4iB,EAAoBj2B,OAASs2B,EAAmBt2B,GAAUs2B,KAG1FT,GAAWz1B,GAAS61B,EAAoB71B,MAAQk2B,GAEnDF,EAAUj2B,EAAI00B,EAAU2B,QACxBH,EAAMl2B,EAAI+1B,EAAe5wB,KAAK+N,KAAK4iB,EAAoB71B,MAAQk2B,EAAkBl2B,GAASk2B,KAChFX,GAAUz1B,GAAQ+1B,EAAoB/1B,KAAOo2B,IAEvDF,EAAUj2B,EAAI00B,EAAU0B,SACxBF,EAAMl2B,EAAI+1B,EAAe5wB,KAAK+N,KAAK4iB,EAAoB/1B,KAAOo2B,EAAkBp2B,GAAQo2B,IAGnF,CACLF,YACAC,QAEJ,CAEA,SAASI,EAAqB7S,GAC5B,GAAIA,IAAYvJ,SAASsZ,iBAAkB,CACzC,MAAM,WACJyB,EAAU,YACVD,GACE3a,OACJ,MAAO,CACL1a,IAAK,EACLI,KAAM,EACNE,MAAOg1B,EACPp1B,OAAQm1B,EACR90B,MAAO+0B,EACPn1B,OAAQk1B,EAEZ,CAEA,MAAM,IACJr1B,EAAG,KACHI,EAAI,MACJE,EAAK,OACLJ,GACE4jB,EAAQ8O,wBACZ,MAAO,CACL5yB,MACAI,OACAE,QACAJ,SACAK,MAAOujB,EAAQ0R,YACfr1B,OAAQ2jB,EAAQyR,aAEpB,CAEA,SAASqB,EAAiBC,GACxB,OAAOA,EAAoBr0B,QAAO,CAACwF,EAAKnG,KAC/B,QAAImG,EAAK8sB,EAAqBjzB,KACpCgvB,EACL,CAyCA,MAAMiG,EAAa,CAAC,CAAC,IAAK,CAAC,OAAQ,SAxCnC,SAA0BD,GACxB,OAAOA,EAAoBr0B,QAAO,CAACwF,EAAKnG,IAC/BmG,EAAMwsB,EAAqB3yB,IACjC,EACL,GAoCgE,CAAC,IAAK,CAAC,MAAO,UAnC9E,SAA0Bg1B,GACxB,OAAOA,EAAoBr0B,QAAO,CAACwF,EAAKnG,IAC/BmG,EAAM2sB,EAAqB9yB,IACjC,EACL,IAgCA,MAAMk1B,EACJ,WAAAxrB,CAAY1L,EAAMikB,GAChBrY,KAAK5L,UAAO,EACZ4L,KAAKlL,WAAQ,EACbkL,KAAKtL,YAAS,EACdsL,KAAKzL,SAAM,EACXyL,KAAKvL,YAAS,EACduL,KAAKnL,WAAQ,EACbmL,KAAKrL,UAAO,EACZ,MAAMy2B,EAAsBnD,EAAuB5P,GAC7CkT,EAAgBJ,EAAiBC,GACvCprB,KAAK5L,KAAO,IAAKA,GAEjB4L,KAAKlL,MAAQV,EAAKU,MAClBkL,KAAKtL,OAASN,EAAKM,OAEnB,IAAK,MAAO82B,EAAMxuB,EAAMyuB,KAAoBJ,EAC1C,IAAK,MAAMnoB,KAAOlG,EAChBD,OAAO2uB,eAAe1rB,KAAMkD,EAAK,CAC/B8iB,IAAK,KACH,MAAM2F,EAAiBF,EAAgBL,GACjCQ,EAAsBL,EAAcC,GAAQG,EAClD,OAAO3rB,KAAK5L,KAAK8O,GAAO0oB,CAAmB,EAE7CC,YAAY,IAKlB9uB,OAAO2uB,eAAe1rB,KAAM,OAAQ,CAClC6rB,YAAY,GAEhB,EAIF,MAAMC,EACJ,WAAAhsB,CAAYqQ,GACVnQ,KAAKmQ,YAAS,EACdnQ,KAAK+rB,UAAY,GAEjB/rB,KAAKgsB,UAAY,KACfhsB,KAAK+rB,UAAU91B,SAAQ8jB,IACrB,IAAIkS,EAEJ,OAAuC,OAA/BA,EAAejsB,KAAKmQ,aAAkB,EAAS8b,EAAaC,uBAAuBnS,EAAS,GACpG,EAGJ/Z,KAAKmQ,OAASA,CAChB,CAEA,GAAAzN,CAAIypB,EAAW3S,EAAS2E,GACtB,IAAIiO,EAE6B,OAAhCA,EAAgBpsB,KAAKmQ,SAA2Bic,EAAcC,iBAAiBF,EAAW3S,EAAS2E,GACpGne,KAAK+rB,UAAU3vB,KAAK,CAAC+vB,EAAW3S,EAAS2E,GAC3C,EAgBF,SAASmO,EAAoB1xB,EAAO2xB,GAClC,MAAM9kB,EAAK1N,KAAK+N,IAAIlN,EAAMhG,GACpB8S,EAAK3N,KAAK+N,IAAIlN,EAAMpG,GAE1B,MAA2B,iBAAhB+3B,EACFxyB,KAAKmsB,KAAKze,GAAM,EAAIC,GAAM,GAAK6kB,EAGpC,MAAOA,GAAe,MAAOA,EACxB9kB,EAAK8kB,EAAY33B,GAAK8S,EAAK6kB,EAAY/3B,EAG5C,MAAO+3B,EACF9kB,EAAK8kB,EAAY33B,EAGtB,MAAO23B,GACF7kB,EAAK6kB,EAAY/3B,CAI5B,CAEA,IAAIg4B,EAmBAC,EAPJ,SAASC,EAAejR,GACtBA,EAAMiR,gBACR,CACA,SAASC,EAAgBlR,GACvBA,EAAMkR,iBACR,EAfA,SAAWH,GACTA,EAAiB,MAAI,QACrBA,EAAqB,UAAI,YACzBA,EAAmB,QAAI,UACvBA,EAAuB,YAAI,cAC3BA,EAAkB,OAAI,SACtBA,EAA2B,gBAAI,kBAC/BA,EAA4B,iBAAI,kBACjC,CARD,CAQGA,IAAcA,EAAY,CAAC,IAW9B,SAAWC,GACTA,EAAoB,MAAI,QACxBA,EAAmB,KAAI,YACvBA,EAAoB,MAAI,aACxBA,EAAmB,KAAI,YACvBA,EAAiB,GAAI,UACrBA,EAAkB,IAAI,SACtBA,EAAoB,MAAI,QACxBA,EAAkB,IAAI,KACvB,CATD,CASGA,IAAiBA,EAAe,CAAC,IAEpC,MAAMG,EAAuB,CAC3BrgB,MAAO,CAACkgB,EAAaI,MAAOJ,EAAaK,OACzCC,OAAQ,CAACN,EAAaO,KACtBC,IAAK,CAACR,EAAaI,MAAOJ,EAAaK,MAAOL,EAAaS,MAEvDC,EAAkC,CAAC1R,EAAO1nB,KAC9C,IAAI,mBACFq5B,GACEr5B,EAEJ,OAAQ0nB,EAAM4R,MACZ,KAAKZ,EAAaa,MAChB,MAAO,IAAKF,EACVx4B,EAAGw4B,EAAmBx4B,EAAI,IAG9B,KAAK63B,EAAac,KAChB,MAAO,IAAKH,EACVx4B,EAAGw4B,EAAmBx4B,EAAI,IAG9B,KAAK63B,EAAae,KAChB,MAAO,IAAKJ,EACV54B,EAAG44B,EAAmB54B,EAAI,IAG9B,KAAKi4B,EAAagB,GAChB,MAAO,IAAKL,EACV54B,EAAG44B,EAAmB54B,EAAI,IAIhB,EAGlB,MAAMk5B,GACJ,WAAA5tB,CAAYmN,GACVjN,KAAKiN,WAAQ,EACbjN,KAAK2tB,mBAAoB,EACzB3tB,KAAK4tB,0BAAuB,EAC5B5tB,KAAK+rB,eAAY,EACjB/rB,KAAK6tB,qBAAkB,EACvB7tB,KAAKiN,MAAQA,EACb,MACEwO,OAAO,OACLtL,IAEAlD,EACJjN,KAAKiN,MAAQA,EACbjN,KAAK+rB,UAAY,IAAID,GAAU,QAAiB3b,IAChDnQ,KAAK6tB,gBAAkB,IAAI/B,GAAU,QAAU3b,IAC/CnQ,KAAK8tB,cAAgB9tB,KAAK8tB,cAAcrxB,KAAKuD,MAC7CA,KAAK+tB,aAAe/tB,KAAK+tB,aAAatxB,KAAKuD,MAC3CA,KAAKguB,QACP,CAEA,MAAAA,GACEhuB,KAAKiuB,cACLjuB,KAAK6tB,gBAAgBnrB,IAAI8pB,EAAU0B,OAAQluB,KAAK+tB,cAChD/tB,KAAK6tB,gBAAgBnrB,IAAI8pB,EAAU2B,iBAAkBnuB,KAAK+tB,cAC1D1d,YAAW,IAAMrQ,KAAK+rB,UAAUrpB,IAAI8pB,EAAU4B,QAASpuB,KAAK8tB,gBAC9D,CAEA,WAAAG,GACE,MAAM,WACJI,EAAU,QACVC,GACEtuB,KAAKiN,MACH7W,EAAOi4B,EAAWj4B,KAAKujB,QAEzBvjB,GApOR,SAAgCiiB,EAASkW,GAKvC,QAJgB,IAAZA,IACFA,EAAUrH,IAGP7O,EACH,OAGF,MAAM,IACJ9jB,EAAG,KACHI,EAAI,OACJF,EAAM,MACNI,GACE05B,EAAQlW,GACoBuQ,EAA2BvQ,KAMvD5jB,GAAU,GAAKI,GAAS,GAAKN,GAAO0a,OAAO2a,aAAej1B,GAAQsa,OAAO4a,aAC3ExR,EAAQmW,eAAe,CACrBC,MAAO,SACPC,OAAQ,UAGd,CA0MMC,CAAuBv4B,GAGzBk4B,EAAQlJ,EACV,CAEA,aAAA0I,CAAcrS,GACZ,IAAI,QAAgBA,GAAQ,CAC1B,MAAM,OACJyH,EAAM,QACN0L,EAAO,QACPzQ,GACEne,KAAKiN,OACH,cACJ4hB,EAAgBjC,EAAoB,iBACpCkC,EAAmB3B,EAA+B,eAClD4B,EAAiB,UACf5Q,GACE,KACJkP,GACE5R,EAEJ,GAAIoT,EAAc5B,IAAI5E,SAASgF,GAE7B,YADArtB,KAAKgvB,UAAUvT,GAIjB,GAAIoT,EAAc9B,OAAO1E,SAASgF,GAEhC,YADArtB,KAAK+tB,aAAatS,GAIpB,MAAM,cACJiK,GACEkJ,EAAQjV,QACNyT,EAAqB1H,EAAgB,CACzC9wB,EAAG8wB,EAAc/wB,KACjBH,EAAGkxB,EAAcnxB,KACf6wB,EAECplB,KAAK4tB,uBACR5tB,KAAK4tB,qBAAuBR,GAG9B,MAAM6B,EAAiBH,EAAiBrT,EAAO,CAC7CyH,SACA0L,QAASA,EAAQjV,QACjByT,uBAGF,GAAI6B,EAAgB,CAClB,MAAMC,GAAmB,QAASD,EAAgB7B,GAC5C+B,EAAc,CAClBv6B,EAAG,EACHJ,EAAG,IAEC,oBACJ42B,GACEwD,EAAQjV,QAEZ,IAAK,MAAM8Q,KAAmBW,EAAqB,CACjD,MAAMP,EAAYpP,EAAM4R,MAClB,MACJlD,EAAK,QACLG,EAAO,OACPF,EAAM,SACNC,EAAQ,UACRL,EAAS,UACTN,GACEF,EAAkBiB,GAChB2E,EAAoBlE,EAAqBT,GACzC4E,EAAqB,CACzBz6B,EAAGmF,KAAK2C,IAAImuB,IAAc4B,EAAaa,MAAQ8B,EAAkBv6B,MAAQu6B,EAAkBt6B,MAAQ,EAAIs6B,EAAkBv6B,MAAOkF,KAAK2B,IAAImvB,IAAc4B,EAAaa,MAAQ8B,EAAkBz6B,KAAOy6B,EAAkBz6B,KAAOy6B,EAAkBt6B,MAAQ,EAAGm6B,EAAer6B,IAC1QJ,EAAGuF,KAAK2C,IAAImuB,IAAc4B,EAAae,KAAO4B,EAAkB36B,OAAS26B,EAAkB16B,OAAS,EAAI06B,EAAkB36B,OAAQsF,KAAK2B,IAAImvB,IAAc4B,EAAae,KAAO4B,EAAkB76B,IAAM66B,EAAkB76B,IAAM66B,EAAkB16B,OAAS,EAAGu6B,EAAez6B,KAEtQ86B,EAAazE,IAAc4B,EAAaa,QAAUhD,GAAWO,IAAc4B,EAAac,OAASnD,EACjGmF,EAAa1E,IAAc4B,EAAae,OAASnD,GAAYQ,IAAc4B,EAAagB,KAAOtD,EAErG,GAAImF,GAAcD,EAAmBz6B,IAAMq6B,EAAer6B,EAAG,CAC3D,MAAM46B,EAAuB/E,EAAgBxB,WAAaiG,EAAiBt6B,EACrE66B,EAA4B5E,IAAc4B,EAAaa,OAASkC,GAAwBxF,EAAUp1B,GAAKi2B,IAAc4B,EAAac,MAAQiC,GAAwB9F,EAAU90B,EAElL,GAAI66B,IAA8BP,EAAiB16B,EAOjD,YAJAi2B,EAAgBiF,SAAS,CACvB/6B,KAAM66B,EACNG,SAAUZ,IAMZI,EAAYv6B,EADV66B,EACchF,EAAgBxB,WAAauG,EAE7B3E,IAAc4B,EAAaa,MAAQ7C,EAAgBxB,WAAae,EAAUp1B,EAAI61B,EAAgBxB,WAAaS,EAAU90B,EAGnIu6B,EAAYv6B,GACd61B,EAAgBmF,SAAS,CACvBj7B,MAAOw6B,EAAYv6B,EACnB+6B,SAAUZ,IAId,KACF,CAAO,GAAIQ,GAAcF,EAAmB76B,IAAMy6B,EAAez6B,EAAG,CAClE,MAAMg7B,EAAuB/E,EAAgBrB,UAAY8F,EAAiB16B,EACpEi7B,EAA4B5E,IAAc4B,EAAae,MAAQgC,GAAwBxF,EAAUx1B,GAAKq2B,IAAc4B,EAAagB,IAAM+B,GAAwB9F,EAAUl1B,EAE/K,GAAIi7B,IAA8BP,EAAiBt6B,EAOjD,YAJA61B,EAAgBiF,SAAS,CACvBn7B,IAAKi7B,EACLG,SAAUZ,IAMZI,EAAY36B,EADVi7B,EACchF,EAAgBrB,UAAYoG,EAE5B3E,IAAc4B,EAAae,KAAO/C,EAAgBrB,UAAYY,EAAUx1B,EAAIi2B,EAAgBrB,UAAYM,EAAUl1B,EAGhI26B,EAAY36B,GACdi2B,EAAgBmF,SAAS,CACvBr7B,KAAM46B,EAAY36B,EAClBm7B,SAAUZ,IAId,KACF,CACF,CAEA/uB,KAAK6vB,WAAWpU,GAAO,SAAI,QAASwT,EAAgBjvB,KAAK4tB,sBAAuBuB,GAClF,CACF,CACF,CAEA,UAAAU,CAAWpU,EAAOqU,GAChB,MAAM,OACJC,GACE/vB,KAAKiN,MACTwO,EAAMiR,iBACNqD,EAAOD,EACT,CAEA,SAAAd,CAAUvT,GACR,MAAM,MACJuU,GACEhwB,KAAKiN,MACTwO,EAAMiR,iBACN1sB,KAAKiwB,SACLD,GACF,CAEA,YAAAjC,CAAatS,GACX,MAAM,SACJyU,GACElwB,KAAKiN,MACTwO,EAAMiR,iBACN1sB,KAAKiwB,SACLC,GACF,CAEA,MAAAD,GACEjwB,KAAK+rB,UAAUC,YACfhsB,KAAK6tB,gBAAgB7B,WACvB,EAmCF,SAASmE,GAAqBC,GAC5B,OAAOC,QAAQD,GAAc,aAAcA,EAC7C,CAEA,SAASE,GAAkBF,GACzB,OAAOC,QAAQD,GAAc,UAAWA,EAC1C,CAtCA1C,GAAe6C,WAAa,CAAC,CAC3BpE,UAAW,YACX3S,QAAS,CAACiC,EAAO1nB,EAAMqvB,KACrB,IAAI,cACFyL,EAAgBjC,EAAoB,aACpC4D,GACEz8B,GACA,OACFmvB,GACEE,EACJ,MAAM,KACJiK,GACE5R,EAAMgV,YAEV,GAAI5B,EAActiB,MAAM8b,SAASgF,GAAO,CACtC,MAAMqD,EAAYxN,EAAOyN,cAAchX,QAEvC,QAAI+W,GAAajV,EAAMtL,SAAWugB,IAIlCjV,EAAMiR,iBACU,MAAhB8D,GAAgCA,EAAa,CAC3C/U,MAAOA,EAAMgV,cAER,GACT,CAEA,OAAO,CAAK,IAYhB,MAAMG,GACJ,WAAA9wB,CAAYmN,EAAO4jB,EAAQC,GACzB,IAAIC,OAEmB,IAAnBD,IACFA,EArWN,SAAgC3gB,GAM9B,MAAM,YACJ6gB,IACE,QAAU7gB,GACd,OAAOA,aAAkB6gB,EAAc7gB,GAAS,QAAiBA,EACnE,CA2VuB8gB,CAAuBhkB,EAAMwO,MAAMtL,SAGtDnQ,KAAKiN,WAAQ,EACbjN,KAAK6wB,YAAS,EACd7wB,KAAK2tB,mBAAoB,EACzB3tB,KAAK8O,cAAW,EAChB9O,KAAKkxB,WAAY,EACjBlxB,KAAKmxB,wBAAqB,EAC1BnxB,KAAKoxB,UAAY,KACjBpxB,KAAK+rB,eAAY,EACjB/rB,KAAKqxB,uBAAoB,EACzBrxB,KAAK6tB,qBAAkB,EACvB7tB,KAAKiN,MAAQA,EACbjN,KAAK6wB,OAASA,EACd,MAAM,MACJpV,GACExO,GACE,OACJkD,GACEsL,EACJzb,KAAKiN,MAAQA,EACbjN,KAAK6wB,OAASA,EACd7wB,KAAK8O,UAAW,QAAiBqB,GACjCnQ,KAAKqxB,kBAAoB,IAAIvF,EAAU9rB,KAAK8O,UAC5C9O,KAAK+rB,UAAY,IAAID,EAAUgF,GAC/B9wB,KAAK6tB,gBAAkB,IAAI/B,GAAU,QAAU3b,IAC/CnQ,KAAKmxB,mBAA4E,OAAtDJ,GAAuB,QAAoBtV,IAAkBsV,EAAuB3L,EAC/GplB,KAAKiuB,YAAcjuB,KAAKiuB,YAAYxxB,KAAKuD,MACzCA,KAAK6vB,WAAa7vB,KAAK6vB,WAAWpzB,KAAKuD,MACvCA,KAAKgvB,UAAYhvB,KAAKgvB,UAAUvyB,KAAKuD,MACrCA,KAAK+tB,aAAe/tB,KAAK+tB,aAAatxB,KAAKuD,MAC3CA,KAAKsxB,cAAgBtxB,KAAKsxB,cAAc70B,KAAKuD,MAC7CA,KAAKuxB,oBAAsBvxB,KAAKuxB,oBAAoB90B,KAAKuD,MACzDA,KAAKguB,QACP,CAEA,MAAAA,GACE,MAAM,OACJ6C,EACA5jB,OACEkR,SAAS,qBACPqT,EAAoB,2BACpBC,KAGFzxB,KAgBJ,GAfAA,KAAK+rB,UAAUrpB,IAAImuB,EAAOa,KAAKryB,KAAMW,KAAK6vB,WAAY,CACpD8B,SAAS,IAEX3xB,KAAK+rB,UAAUrpB,IAAImuB,EAAO5D,IAAI5tB,KAAMW,KAAKgvB,WAErC6B,EAAO9D,QACT/sB,KAAK+rB,UAAUrpB,IAAImuB,EAAO9D,OAAO1tB,KAAMW,KAAK+tB,cAG9C/tB,KAAK6tB,gBAAgBnrB,IAAI8pB,EAAU0B,OAAQluB,KAAK+tB,cAChD/tB,KAAK6tB,gBAAgBnrB,IAAI8pB,EAAUoF,UAAWlF,GAC9C1sB,KAAK6tB,gBAAgBnrB,IAAI8pB,EAAU2B,iBAAkBnuB,KAAK+tB,cAC1D/tB,KAAK6tB,gBAAgBnrB,IAAI8pB,EAAUqF,YAAanF,GAChD1sB,KAAKqxB,kBAAkB3uB,IAAI8pB,EAAU4B,QAASpuB,KAAKsxB,eAE/CE,EAAsB,CACxB,GAAkC,MAA9BC,GAAsCA,EAA2B,CACnEhW,MAAOzb,KAAKiN,MAAMwO,MAClB4S,WAAYruB,KAAKiN,MAAMohB,WACvBlQ,QAASne,KAAKiN,MAAMkR,UAEpB,OAAOne,KAAKiuB,cAGd,GAAIqC,GAAkBkB,GAGpB,OAFAxxB,KAAKoxB,UAAY/gB,WAAWrQ,KAAKiuB,YAAauD,EAAqBM,YACnE9xB,KAAK+xB,cAAcP,GAIrB,GAAIrB,GAAqBqB,GAEvB,YADAxxB,KAAK+xB,cAAcP,EAGvB,CAEAxxB,KAAKiuB,aACP,CAEA,MAAAgC,GACEjwB,KAAK+rB,UAAUC,YACfhsB,KAAK6tB,gBAAgB7B,YAGrB3b,WAAWrQ,KAAKqxB,kBAAkBrF,UAAW,IAEtB,OAAnBhsB,KAAKoxB,YACPY,aAAahyB,KAAKoxB,WAClBpxB,KAAKoxB,UAAY,KAErB,CAEA,aAAAW,CAAc3B,EAAYtkB,GACxB,MAAM,OACJoX,EAAM,UACN+O,GACEjyB,KAAKiN,MACTglB,EAAU/O,EAAQkN,EAAYpwB,KAAKmxB,mBAAoBrlB,EACzD,CAEA,WAAAmiB,GACE,MAAM,mBACJkD,GACEnxB,MACE,QACJsuB,GACEtuB,KAAKiN,MAELkkB,IACFnxB,KAAKkxB,WAAY,EAEjBlxB,KAAKqxB,kBAAkB3uB,IAAI8pB,EAAU0F,MAAOvF,EAAiB,CAC3DwF,SAAS,IAGXnyB,KAAKuxB,sBAELvxB,KAAKqxB,kBAAkB3uB,IAAI8pB,EAAU4F,gBAAiBpyB,KAAKuxB,qBAC3DjD,EAAQ6C,GAEZ,CAEA,UAAAtB,CAAWpU,GACT,IAAI4W,EAEJ,MAAM,UACJnB,EAAS,mBACTC,EAAkB,MAClBlkB,GACEjN,MACE,OACJ+vB,EACA5R,SAAS,qBACPqT,IAEAvkB,EAEJ,IAAKkkB,EACH,OAGF,MAAMrB,EAAsE,OAAvDuC,GAAwB,QAAoB5W,IAAkB4W,EAAwBjN,EACrGxqB,GAAQ,QAASu2B,EAAoBrB,GAE3C,IAAKoB,GAAaM,EAAsB,CACtC,GAAIrB,GAAqBqB,GAAuB,CAC9C,GAAsC,MAAlCA,EAAqBc,WAAqBhG,EAAoB1xB,EAAO42B,EAAqBc,WAC5F,OAAOtyB,KAAK+tB,eAGd,GAAIzB,EAAoB1xB,EAAO42B,EAAqB3jB,UAClD,OAAO7N,KAAKiuB,aAEhB,CAEA,OAAIqC,GAAkBkB,IAChBlF,EAAoB1xB,EAAO42B,EAAqBc,WAC3CtyB,KAAK+tB,oBAIhB/tB,KAAK+xB,cAAcP,EAAsB52B,EAE3C,CAEI6gB,EAAM8W,YACR9W,EAAMiR,iBAGRqD,EAAOD,EACT,CAEA,SAAAd,GACE,MAAM,QACJwD,EAAO,MACPxC,GACEhwB,KAAKiN,MACTjN,KAAKiwB,SAEAjwB,KAAKkxB,WACRsB,EAAQxyB,KAAKiN,MAAMiW,QAGrB8M,GACF,CAEA,YAAAjC,GACE,MAAM,QACJyE,EAAO,SACPtC,GACElwB,KAAKiN,MACTjN,KAAKiwB,SAEAjwB,KAAKkxB,WACRsB,EAAQxyB,KAAKiN,MAAMiW,QAGrBgN,GACF,CAEA,aAAAoB,CAAc7V,GACRA,EAAM4R,OAASZ,EAAaO,KAC9BhtB,KAAK+tB,cAET,CAEA,mBAAAwD,GACE,IAAIkB,EAEsD,OAAzDA,EAAwBzyB,KAAK8O,SAAS4jB,iBAAmCD,EAAsBE,iBAClG,EAIF,MAAM9B,GAAS,CACb9D,OAAQ,CACN1tB,KAAM,iBAERqyB,KAAM,CACJryB,KAAM,eAER4tB,IAAK,CACH5tB,KAAM,cAGV,MAAMuzB,WAAsBhC,GAC1B,WAAA9wB,CAAYmN,GACV,MAAM,MACJwO,GACExO,EAGE6jB,GAAiB,QAAiBrV,EAAMtL,QAC9C6F,MAAM/I,EAAO4jB,GAAQC,EACvB,EAGF8B,GAAcrC,WAAa,CAAC,CAC1BpE,UAAW,gBACX3S,QAAS,CAACzlB,EAAMqvB,KACd,IACEqN,YAAahV,GACX1nB,GACA,aACFy8B,GACEpN,EAEJ,SAAK3H,EAAMoX,WAA8B,IAAjBpX,EAAMqX,SAId,MAAhBtC,GAAgCA,EAAa,CAC3C/U,UAEK,GAAI,IAIf,MAAMsX,GAAW,CACfrB,KAAM,CACJryB,KAAM,aAER4tB,IAAK,CACH5tB,KAAM,YAGV,IAAI2zB,IAEJ,SAAWA,GACTA,EAAYA,EAAwB,WAAI,GAAK,YAC9C,CAFD,CAEGA,KAAgBA,GAAc,CAAC,IAElC,cAA0BpC,GACxB,WAAA9wB,CAAYmN,GACV+I,MAAM/I,EAAO8lB,IAAU,QAAiB9lB,EAAMwO,MAAMtL,QACtD,GAGUogB,WAAa,CAAC,CACxBpE,UAAW,cACX3S,QAAS,CAACzlB,EAAMqvB,KACd,IACEqN,YAAahV,GACX1nB,GACA,aACFy8B,GACEpN,EAEJ,OAAI3H,EAAMqX,SAAWE,GAAYC,aAIjB,MAAhBzC,GAAgCA,EAAa,CAC3C/U,WAEK,EAAI,IAIf,MAAMyX,GAAW,CACfnG,OAAQ,CACN1tB,KAAM,eAERqyB,KAAM,CACJryB,KAAM,aAER4tB,IAAK,CACH5tB,KAAM,aAiDV,IAAI8zB,GAOAC,IArDJ,cAA0BxC,GACxB,WAAA9wB,CAAYmN,GACV+I,MAAM/I,EAAOimB,GACf,CAEA,YAAOG,GAQL,OAJApkB,OAAOod,iBAAiB6G,GAASxB,KAAKryB,KAAM0lB,EAAM,CAChDoN,SAAS,EACTR,SAAS,IAEJ,WACL1iB,OAAOid,oBAAoBgH,GAASxB,KAAKryB,KAAM0lB,EACjD,EAGA,SAASA,IAAQ,CACnB,IAGUwL,WAAa,CAAC,CACxBpE,UAAW,eACX3S,QAAS,CAACzlB,EAAMqvB,KACd,IACEqN,YAAahV,GACX1nB,GACA,aACFy8B,GACEpN,EACJ,MAAM,QACJtH,GACEL,EAEJ,QAAIK,EAAQzlB,OAAS,IAIL,MAAhBm6B,GAAgCA,EAAa,CAC3C/U,UAEK,GAAI,IAMf,SAAW0X,GACTA,EAAoBA,EAA6B,QAAI,GAAK,UAC1DA,EAAoBA,EAAmC,cAAI,GAAK,eACjE,CAHD,CAGGA,KAAwBA,GAAsB,CAAC,IAIlD,SAAWC,GACTA,EAAeA,EAA0B,UAAI,GAAK,YAClDA,EAAeA,EAAkC,kBAAI,GAAK,mBAC3D,CAHD,CAGGA,KAAmBA,GAAiB,CAAC,IAgHxC,MAAME,GAAsB,CAC1B1+B,EAAG,CACD,CAAC00B,EAAU0B,WAAW,EACtB,CAAC1B,EAAU2B,UAAU,GAEvBz2B,EAAG,CACD,CAAC80B,EAAU0B,WAAW,EACtB,CAAC1B,EAAU2B,UAAU,IAgEzB,IAAIsI,GAQAC,IANJ,SAAWD,GACTA,EAAkBA,EAA0B,OAAI,GAAK,SACrDA,EAAkBA,EAAkC,eAAI,GAAK,iBAC7DA,EAAkBA,EAAiC,cAAI,GAAK,eAC7D,CAJD,CAIGA,KAAsBA,GAAoB,CAAC,IAI9C,SAAWC,GACTA,EAA8B,UAAI,WACnC,CAFD,CAEGA,KAAuBA,GAAqB,CAAC,IAEhD,MAAMC,GAA4B,IAAIC,IAmHtC,SAASC,GAAgBr/B,EAAOs/B,GAC9B,OAAO,SAAYC,GACZv/B,EAIDu/B,IAIwB,mBAAdD,EAA2BA,EAAUt/B,GAASA,GAPnD,MAQR,CAACs/B,EAAWt/B,GACjB,CAsCA,SAASw/B,GAAkB//B,GACzB,IAAI,SACFwmB,EAAQ,SACRwZ,GACEhgC,EACJ,MAAMigC,GAAe,QAASzZ,GACxB0Z,GAAiB,IAAAhc,UAAQ,KAC7B,GAAI8b,GAA8B,oBAAX9kB,aAA2D,IAA1BA,OAAOilB,eAC7D,OAGF,MAAM,eACJA,GACEjlB,OACJ,OAAO,IAAIilB,EAAeF,EAAa,GAEzC,CAACD,IAID,OAHA,IAAAza,YAAU,IACD,IAAwB,MAAlB2a,OAAyB,EAASA,EAAeE,cAC7D,CAACF,IACGA,CACT,CAEA,SAASG,GAAe/b,GACtB,OAAO,IAAIiT,EAAKpE,EAAc7O,GAAUA,EAC1C,CAEA,SAASgc,GAAQhc,EAASkW,EAAS+F,QACjB,IAAZ/F,IACFA,EAAU6F,IAGZ,MAAOhgC,EAAMmgC,IAAW,IAAAtQ,UAAS,MAEjC,SAASuQ,IACPD,GAAQE,IACN,IAAKpc,EACH,OAAO,KAIP,IAAItkB,EADN,IAA4B,IAAxBskB,EAAQqc,YAKV,OAAoE,OAA5D3gC,EAAsB,MAAf0gC,EAAsBA,EAAcH,GAAwBvgC,EAAO,KAGpF,MAAM4gC,EAAUpG,EAAQlW,GAExB,OAAI/X,KAAKC,UAAUk0B,KAAiBn0B,KAAKC,UAAUo0B,GAC1CF,EAGFE,CAAO,GAElB,CAEA,MAAMC,EArFR,SAA6B7gC,GAC3B,IAAI,SACFwmB,EAAQ,SACRwZ,GACEhgC,EACJ,MAAM8gC,GAAkB,QAASta,GAC3Bqa,GAAmB,IAAA3c,UAAQ,KAC/B,GAAI8b,GAA8B,oBAAX9kB,aAA6D,IAA5BA,OAAO6lB,iBAC7D,OAGF,MAAM,iBACJA,GACE7lB,OACJ,OAAO,IAAI6lB,EAAiBD,EAAgB,GAC3C,CAACA,EAAiBd,IAIrB,OAHA,IAAAza,YAAU,IACD,IAA0B,MAApBsb,OAA2B,EAASA,EAAiBT,cACjE,CAACS,IACGA,CACT,CAiE2BG,CAAoB,CAC3C,QAAAxa,CAASya,GACP,GAAK3c,EAIL,IAAK,MAAM4c,KAAUD,EAAS,CAC5B,MAAM,KACJzqB,EAAI,OACJ4F,GACE8kB,EAEJ,GAAa,cAAT1qB,GAAwB4F,aAAkBW,aAAeX,EAAO+kB,SAAS7c,GAAU,CACrFmc,IACA,KACF,CACF,CACF,IAGIP,EAAiBH,GAAkB,CACvCvZ,SAAUia,IAgBZ,OAdA,SAA0B,KACxBA,IAEInc,GACgB,MAAlB4b,GAAkCA,EAAekB,QAAQ9c,GACrC,MAApBuc,GAAoCA,EAAiBO,QAAQrmB,SAAS8B,KAAM,CAC1EwkB,WAAW,EACXC,SAAS,MAGO,MAAlBpB,GAAkCA,EAAeE,aAC7B,MAApBS,GAAoCA,EAAiBT,aACvD,GACC,CAAC9b,IACGjkB,CACT,CAOA,MAAMkhC,GAAiB,GAkFvB,SAASC,GAAsBhK,EAAenR,QACvB,IAAjBA,IACFA,EAAe,IAGjB,MAAMob,GAAuB,IAAA9b,QAAO,MAgBpC,OAfA,IAAAJ,YAAU,KACRkc,EAAqB7b,QAAU,IAAI,GAErCS,IACA,IAAAd,YAAU,KACR,MAAMmc,EAAmBlK,IAAkBnG,EAEvCqQ,IAAqBD,EAAqB7b,UAC5C6b,EAAqB7b,QAAU4R,IAG5BkK,GAAoBD,EAAqB7b,UAC5C6b,EAAqB7b,QAAU,KACjC,GACC,CAAC4R,IACGiK,EAAqB7b,SAAU,QAAS4R,EAAeiK,EAAqB7b,SAAWyL,CAChG,CA8CA,SAASsQ,GAAcrd,GACrB,OAAO,IAAAJ,UAAQ,IAAMI,EA/rDvB,SAA6BA,GAC3B,MAAMvjB,EAAQujB,EAAQwR,WAChBn1B,EAAS2jB,EAAQuR,YACvB,MAAO,CACLr1B,IAAK,EACLI,KAAM,EACNE,MAAOC,EACPL,OAAQC,EACRI,QACAJ,SAEJ,CAorDiCihC,CAAoBtd,GAAW,MAAM,CAACA,GACvE,CAEA,MAAMud,GAAiB,GAsFvB,MAAMC,GAAiB,CAAC,CACtB5Q,OAAQ2N,GACRzU,QAAS,CAAC,GACT,CACD8G,OAAQyI,GACRvP,QAAS,CAAC,IAEN2X,GAAc,CAClBnc,QAAS,CAAC,GAENoc,GAAgC,CACpChT,UAAW,CACTwL,QAASvG,GAEXgO,UAAW,CACTzH,QAASvG,EACTiO,SAAU1C,GAAkB2C,cAC5BC,UAAW3C,GAAmB4C,WAEhCC,YAAa,CACX9H,QAASrH,IAIb,MAAMoP,WAA+B5C,IACnC,GAAA1N,CAAInZ,GACF,IAAI0pB,EAEJ,OAAa,MAAN1pB,GAA6C,OAA/B0pB,EAAavgB,MAAMgQ,IAAInZ,IAAe0pB,OAAyBj0B,CACtF,CAEA,OAAAk0B,GACE,OAAOvqB,MAAMC,KAAKlM,KAAK7C,SACzB,CAEA,UAAAs5B,GACE,OAAOz2B,KAAKw2B,UAAUpiB,QAAOrgB,IAC3B,IAAI,SACFggC,GACEhgC,EACJ,OAAQggC,CAAQ,GAEpB,CAEA,UAAA2C,CAAW7pB,GACT,IAAI8pB,EAAuBC,EAE3B,OAAyG,OAAjGD,EAAsD,OAA7BC,EAAY52B,KAAKgmB,IAAInZ,SAAe,EAAS+pB,EAAUxgC,KAAKujB,SAAmBgd,OAAwBr0B,CAC1I,EAIF,MAAMu0B,GAAuB,CAC3BC,eAAgB,KAChB5T,OAAQ,KACRmL,WAAY,KACZ0I,eAAgB,KAChBjR,WAAY,KACZkR,kBAAmB,KACnBC,eAA6B,IAAIvD,IACjC/N,eAA6B,IAAI+N,IACjC9N,oBAAkC,IAAI0Q,GACtCjT,KAAM,KACNgT,YAAa,CACXa,QAAS,CACPvd,QAAS,MAEXvlB,KAAM,KACN+iC,OAAQpS,GAEVqG,oBAAqB,GACrBl3B,wBAAyB,GACzBkjC,uBAAwBrB,GACxBsB,2BAA4BtS,EAC5BuS,WAAY,KACZC,oBAAoB,GAEhBC,GAAyB,CAC7BV,eAAgB,KAChBvG,WAAY,GACZrN,OAAQ,KACR6T,eAAgB,KAChBU,kBAAmB,CACjB1U,UAAW,IAEb2U,SAAU3S,EACVkS,eAA6B,IAAIvD,IACjCrQ,KAAM,KACNgU,2BAA4BtS,GAExB4S,IAA+B,IAAA9U,eAAc2U,IAC7CI,IAA6B,IAAA/U,eAAcgU,IAEjD,SAASgB,KACP,MAAO,CACL9U,UAAW,CACTG,OAAQ,KACRiO,mBAAoB,CAClBv8B,EAAG,EACHJ,EAAG,GAELwH,MAAO,IAAI03B,IACXoE,UAAW,CACTljC,EAAG,EACHJ,EAAG,IAGPwhC,UAAW,CACT+B,WAAY,IAAIzB,IAGtB,CACA,SAAS0B,GAAQ9W,EAAO+W,GACtB,OAAQA,EAAO1tB,MACb,KAAKua,EAAO8M,UACV,MAAO,IAAK1Q,EACV6B,UAAW,IAAK7B,EAAM6B,UACpBoO,mBAAoB8G,EAAO9G,mBAC3BjO,OAAQ+U,EAAO/U,SAIrB,KAAK4B,EAAOoT,SACV,OAA8B,MAA1BhX,EAAM6B,UAAUG,OACXhC,EAGF,IAAKA,EACV6B,UAAW,IAAK7B,EAAM6B,UACpB+U,UAAW,CACTljC,EAAGqjC,EAAOnI,YAAYl7B,EAAIssB,EAAM6B,UAAUoO,mBAAmBv8B,EAC7DJ,EAAGyjC,EAAOnI,YAAYt7B,EAAI0sB,EAAM6B,UAAUoO,mBAAmB38B,KAKrE,KAAKswB,EAAOqT,QACZ,KAAKrT,EAAOsT,WACV,MAAO,IAAKlX,EACV6B,UAAW,IAAK7B,EAAM6B,UACpBG,OAAQ,KACRiO,mBAAoB,CAClBv8B,EAAG,EACHJ,EAAG,GAELsjC,UAAW,CACTljC,EAAG,EACHJ,EAAG,KAKX,KAAKswB,EAAOuT,kBACV,CACE,MAAM,QACJhgB,GACE4f,GACE,GACJprB,GACEwL,EACE0f,EAAa,IAAIzB,GAAuBpV,EAAM8U,UAAU+B,YAE9D,OADAA,EAAWO,IAAIzrB,EAAIwL,GACZ,IAAK6I,EACV8U,UAAW,IAAK9U,EAAM8U,UACpB+B,cAGN,CAEF,KAAKjT,EAAOyT,qBACV,CACE,MAAM,GACJ1rB,EAAE,IACF3J,EAAG,SACH6wB,GACEkE,EACE5f,EAAU6I,EAAM8U,UAAU+B,WAAW/R,IAAInZ,GAE/C,IAAKwL,GAAWnV,IAAQmV,EAAQnV,IAC9B,OAAOge,EAGT,MAAM6W,EAAa,IAAIzB,GAAuBpV,EAAM8U,UAAU+B,YAI9D,OAHAA,EAAWO,IAAIzrB,EAAI,IAAKwL,EACtB0b,aAEK,IAAK7S,EACV8U,UAAW,IAAK9U,EAAM8U,UACpB+B,cAGN,CAEF,KAAKjT,EAAO0T,oBACV,CACE,MAAM,GACJ3rB,EAAE,IACF3J,GACE+0B,EACE5f,EAAU6I,EAAM8U,UAAU+B,WAAW/R,IAAInZ,GAE/C,IAAKwL,GAAWnV,IAAQmV,EAAQnV,IAC9B,OAAOge,EAGT,MAAM6W,EAAa,IAAIzB,GAAuBpV,EAAM8U,UAAU+B,YAE9D,OADAA,EAAWU,OAAO5rB,GACX,IAAKqU,EACV8U,UAAW,IAAK9U,EAAM8U,UACpB+B,cAGN,CAEF,QAEI,OAAO7W,EAGf,CAEA,SAASwX,GAAa3kC,GACpB,IAAI,SACFggC,GACEhgC,EACJ,MAAM,OACJmvB,EAAM,eACN4T,EAAc,eACdG,IACE,IAAA1S,YAAWoT,IACTgB,GAAyB,QAAY7B,GACrC8B,GAAmB,QAAsB,MAAV1V,OAAiB,EAASA,EAAOrW,IAgDtE,OA9CA,IAAAyM,YAAU,KACR,IAAIya,IAIC+C,GAAkB6B,GAA8C,MAApBC,EAA0B,CACzE,KAAK,QAAgBD,GACnB,OAGF,GAAI7pB,SAAS+pB,gBAAkBF,EAAuBxoB,OAEpD,OAGF,MAAM2oB,EAAgB7B,EAAejR,IAAI4S,GAEzC,IAAKE,EACH,OAGF,MAAM,cACJnI,EAAa,KACbv6B,GACE0iC,EAEJ,IAAKnI,EAAchX,UAAYvjB,EAAKujB,QAClC,OAGFof,uBAAsB,KACpB,IAAK,MAAM1gB,IAAW,CAACsY,EAAchX,QAASvjB,EAAKujB,SAAU,CAC3D,IAAKtB,EACH,SAGF,MAAM2gB,GAAgB,QAAuB3gB,GAE7C,GAAI2gB,EAAe,CACjBA,EAAcC,QACd,KACF,CACF,IAEJ,IACC,CAACnC,EAAgB/C,EAAUkD,EAAgB2B,EAAkBD,IACzD,IACT,CA+FA,MAAMO,IAAsC,IAAArW,eAAc,IAAKuC,EAC7D7I,OAAQ,EACRC,OAAQ,IAEV,IAAI2c,IAEJ,SAAWA,GACTA,EAAOA,EAAsB,cAAI,GAAK,gBACtCA,EAAOA,EAAqB,aAAI,GAAK,eACrCA,EAAOA,EAAoB,YAAI,GAAK,aACrC,CAJD,CAIGA,KAAWA,GAAS,CAAC,IAExB,MAAMC,IAA0B,IAAAC,OAAK,SAAoBtlC,GACvD,IAAIulC,EAAuBC,EAAuBC,EAAmBC,EAErE,IAAI,GACF5sB,EAAE,cACF6sB,EAAa,WACbC,GAAa,EAAI,SACjB3jC,EAAQ,QACRmvB,EAAU0Q,GAAc,mBACxB+D,EAAqBnT,EAAgB,UACrCoT,EAAS,UACTC,KACG7sB,GACDlZ,EACJ,MAAMgmC,GAAQ,IAAAC,YAAWhC,QAAS11B,EAAWu1B,KACtC3W,EAAOwW,GAAYqC,GACnBE,EAAsBC,GAnyF/B,WACE,MAAOnO,IAAa,IAAA9H,WAAS,IAAM,IAAInP,MACjCwP,GAAmB,IAAA1K,cAAYG,IACnCgS,EAAUrpB,IAAIqX,GACP,IAAMgS,EAAU0M,OAAO1e,KAC7B,CAACgS,IAYJ,MAAO,EAXU,IAAAnS,cAAY7lB,IAC3B,IAAI,KACFwW,EAAI,MACJkR,GACE1nB,EACJg4B,EAAU91B,SAAQ8jB,IAChB,IAAIogB,EAEJ,OAA4C,OAApCA,EAAiBpgB,EAASxP,SAAiB,EAAS4vB,EAAe5hB,KAAKwB,EAAU0B,EAAM,GAChG,GACD,CAACsQ,IACczH,EACpB,CAixF0D8V,IACjDzrB,EAAQ0rB,IAAa,IAAApW,UAASkV,GAAOmB,eACtCC,EAAgB5rB,IAAWwqB,GAAOqB,aAEtCzX,WACEG,OAAQuX,EACRz+B,MAAOi7B,EAAc,UACrBa,GAEF9B,WACE+B,WAAYnS,IAEZ1E,EACE9qB,EAAmB,MAAZqkC,EAAmBxD,EAAejR,IAAIyU,GAAY,KACzDC,GAAc,IAAAhhB,QAAO,CACzBihB,QAAS,KACTC,WAAY,OAER1X,GAAS,IAAAjL,UAAQ,KACrB,IAAI4iB,EAEJ,OAAmB,MAAZJ,EAAmB,CACxB5tB,GAAI4tB,EAEJnV,KAA0D,OAAnDuV,EAAqB,MAARzkC,OAAe,EAASA,EAAKkvB,MAAgBuV,EAAa/E,GAC9E1hC,KAAMsmC,GACJ,IAAI,GACP,CAACD,EAAUrkC,IACR0kC,GAAY,IAAAphB,QAAO,OAClBqhB,EAAcC,IAAmB,IAAA/W,UAAS,OAC1C6S,EAAgBmE,KAAqB,IAAAhX,UAAS,MAC/CiX,IAAc,QAAejuB,EAAOlQ,OAAOI,OAAO8P,IAClDkuB,IAAyB,QAAY,iBAAkBtuB,GACvDuuB,IAA6B,IAAAnjB,UAAQ,IAAM2N,EAAoB6Q,cAAc,CAAC7Q,IAC9EwR,IA9I2BiE,GA8IwBxB,GA7IlD,IAAA5hB,UAAQ,KAAM,CACnB8K,UAAW,IAAKgT,GAA8BhT,aAC9B,MAAVsY,QAAiB,EAASA,GAAOtY,WAEvCiT,UAAW,IAAKD,GAA8BC,aAC9B,MAAVqF,QAAiB,EAASA,GAAOrF,WAEvCK,YAAa,IAAKN,GAA8BM,eAChC,MAAVgF,QAAiB,EAASA,GAAOhF,gBAGzC,CAAW,MAAVgF,QAAiB,EAASA,GAAOtY,UAAqB,MAAVsY,QAAiB,EAASA,GAAOrF,UAAqB,MAAVqF,QAAiB,EAASA,GAAOhF,eAZ5H,IAAmCgF,GA+IjC,MAAM,eACJ1V,GAAc,2BACd0R,GAA0B,mBAC1BE,IAp7BJ,SAA+BQ,EAAYhkC,GACzC,IAAI,SACFunC,EAAQ,aACRlhB,EAAY,OACZihB,GACEtnC,EACJ,MAAOwnC,EAAOC,IAAY,IAAAvX,UAAS,OAC7B,UACJkS,EAAS,QACT5H,EAAO,SACP0H,GACEoF,EACEI,GAAgB,IAAA/hB,QAAOqe,GACvBhE,EAuFN,WACE,OAAQkC,GACN,KAAK1C,GAAkBmI,OACrB,OAAO,EAET,KAAKnI,GAAkBoI,eACrB,OAAOL,EAET,QACE,OAAQA,EAEd,CAlGiBM,GACXC,GAAc,QAAe9H,GAC7BsD,GAA6B,IAAAzd,cAAY,SAAUkB,QAC3C,IAARA,IACFA,EAAM,IAGJ+gB,EAAYliB,SAIhB6hB,GAASlnC,GACO,OAAVA,EACKwmB,EAGFxmB,EAAM+H,OAAOye,EAAI1G,QAAOvH,IAAOvY,EAAM+zB,SAASxb,OAEzD,GAAG,CAACgvB,IACEzK,GAAY,IAAA1X,QAAO,MACnBiM,GAAiB,SAAYkO,IACjC,GAAIE,IAAauH,EACf,OAAO7H,GAGT,IAAKI,GAAiBA,IAAkBJ,IAAgBgI,EAAc9hB,UAAYoe,GAAuB,MAATwD,EAAe,CAC7G,MAAMj9B,EAAM,IAAIo1B,IAEhB,IAAK,IAAI9P,KAAamU,EAAY,CAChC,IAAKnU,EACH,SAGF,GAAI2X,GAASA,EAAMllC,OAAS,IAAMklC,EAAMlT,SAASzE,EAAU/W,KAAO+W,EAAUxvB,KAAKulB,QAAS,CAExFrb,EAAIg6B,IAAI1U,EAAU/W,GAAI+W,EAAUxvB,KAAKulB,SACrC,QACF,CAEA,MAAMvjB,EAAOwtB,EAAUxtB,KAAKujB,QACtBvlB,EAAOgC,EAAO,IAAIk1B,EAAKiD,EAAQn4B,GAAOA,GAAQ,KACpDwtB,EAAUxvB,KAAKulB,QAAUvlB,EAErBA,GACFkK,EAAIg6B,IAAI1U,EAAU/W,GAAIzY,EAE1B,CAEA,OAAOkK,CACT,CAEA,OAAOu1B,CAAa,GACnB,CAACkE,EAAYwD,EAAOD,EAAUvH,EAAUxF,IA6B3C,OA5BA,IAAAjV,YAAU,KACRmiB,EAAc9hB,QAAUoe,CAAU,GACjC,CAACA,KACJ,IAAAze,YAAU,KACJya,GAIJsD,GAA4B,GAE9B,CAACiE,EAAUvH,KACX,IAAAza,YAAU,KACJiiB,GAASA,EAAMllC,OAAS,GAC1BmlC,EAAS,KACX,GAEF,CAACl7B,KAAKC,UAAUg7B,MAChB,IAAAjiB,YAAU,KACJya,GAAiC,iBAAdoC,GAAgD,OAAtB/E,EAAUzX,UAI3DyX,EAAUzX,QAAUtJ,YAAW,KAC7BgnB,IACAjG,EAAUzX,QAAU,IAAI,GACvBwc,GAAU,GAEf,CAACA,EAAWpC,EAAUsD,KAA+Bjd,IAC9C,CACLuL,iBACA0R,6BACAE,mBAA6B,MAATgE,EAexB,CAq0BMO,CAAsBV,GAA4B,CACpDE,SAAUf,EACVngB,aAAc,CAAC0d,EAAUljC,EAAGkjC,EAAUtjC,GACtC6mC,OAAQjE,GAAuBpB,YAE3B3H,GAv+BR,SAAuB4I,EAAgBpqB,GACrC,MAAMisB,EAAsB,MAANjsB,EAAaoqB,EAAejR,IAAInZ,QAAMvK,EACtDlM,EAAO0iC,EAAgBA,EAAc1iC,KAAKujB,QAAU,KAC1D,OAAO,SAAYoiB,IACjB,IAAIhoC,EAEJ,OAAU,MAAN8Y,EACK,KAM2C,OAA5C9Y,EAAe,MAARqC,EAAeA,EAAO2lC,GAAsBhoC,EAAO,IAAI,GACrE,CAACqC,EAAMyW,GACZ,CAw9BqBmvB,CAAc/E,EAAgBwD,GAC3CwB,IAAwB,IAAAhkB,UAAQ,IAAM6e,GAAiB,QAAoBA,GAAkB,MAAM,CAACA,IACpGoF,GAkcN,WACE,MAAMC,GAAsG,KAApD,MAAhBpB,OAAuB,EAASA,EAAapN,mBAC/EyO,EAAmD,iBAAfzC,GAAiD,IAAvBA,EAAW0C,SAAmC,IAAf1C,EAC7F0C,EAAU9B,IAAkB4B,IAAmCC,EAErE,MAA0B,iBAAfzC,EACF,IAAKA,EACV0C,WAIG,CACLA,UAEJ,CAhd0BC,GACpBC,GA7zBR,SAAwBnmC,EAAMm4B,GAC5B,OAAOoF,GAAgBv9B,EAAMm4B,EAC/B,CA2zBgCiO,CAAenO,GAAY+I,GAAuBrU,UAAUwL,UA5I5F,SAA0Cx6B,GACxC,IAAI,WACFs6B,EAAU,QACVE,EAAO,YACPkO,EAAW,OACXpB,GAAS,GACPtnC,EACJ,MAAM2oC,GAAc,IAAAhjB,SAAO,IACrB,EACJ9kB,EAAC,EACDJ,GACoB,kBAAX6mC,EAAuB,CAChCzmC,EAAGymC,EACH7mC,EAAG6mC,GACDA,GACJ,SAA0B,KAGxB,IAFkBzmC,IAAMJ,IAEP65B,EAEf,YADAqO,EAAY/iB,SAAU,GAIxB,GAAI+iB,EAAY/iB,UAAY8iB,EAG1B,OAIF,MAAMrmC,EAAqB,MAAdi4B,OAAqB,EAASA,EAAWj4B,KAAKujB,QAE3D,IAAKvjB,IAA6B,IAArBA,EAAKs+B,YAGhB,OAGF,MACMiI,EAAYhW,EADL4H,EAAQn4B,GACgBqmC,GAarC,GAXK7nC,IACH+nC,EAAU/nC,EAAI,GAGXJ,IACHmoC,EAAUnoC,EAAI,GAIhBkoC,EAAY/iB,SAAU,EAElB5f,KAAK+N,IAAI60B,EAAU/nC,GAAK,GAAKmF,KAAK+N,IAAI60B,EAAUnoC,GAAK,EAAG,CAC1D,MAAMq0B,EAA0BD,EAA2BxyB,GAEvDyyB,GACFA,EAAwB+G,SAAS,CAC/Br7B,IAAKooC,EAAUnoC,EACfG,KAAMgoC,EAAU/nC,GAGtB,IACC,CAACy5B,EAAYz5B,EAAGJ,EAAGioC,EAAalO,GACrC,CA8EEqO,CAAiC,CAC/BvO,WAAwB,MAAZoM,EAAmBxD,EAAejR,IAAIyU,GAAY,KAC9DY,OAAQa,GAAkBW,wBAC1BJ,YAAaF,GACbhO,QAAS6I,GAAuBrU,UAAUwL,UAE5C,MAAMwI,GAAiB1C,GAAQhG,GAAY+I,GAAuBrU,UAAUwL,QAASgO,IAC/EvF,GAAoB3C,GAAQhG,GAAaA,GAAWyO,cAAgB,MACpEC,IAAgB,IAAArjB,QAAO,CAC3Bod,eAAgB,KAChB5T,OAAQ,KACRmL,cACA3I,cAAe,KACfI,WAAY,KACZH,kBACAsR,iBACA+F,aAAc,KACdhpC,iBAAkB,KAClB4xB,sBACAvC,KAAM,KACN+H,oBAAqB,GACrB6R,wBAAyB,OAErBC,GAAWtX,EAAoB8Q,WAAmE,OAAvD4C,EAAwByD,GAAcpjB,QAAQ0J,WAAgB,EAASiW,EAAsBzsB,IACxIwpB,GArgBR,SAAiCtiC,GAC/B,IAAI,QACFw6B,GACEx6B,EACJ,MAAOK,EAAMmgC,IAAW,IAAAtQ,UAAS,MAiB3BgQ,EAAiBH,GAAkB,CACvCvZ,UAjBmB,IAAAX,cAAYtc,IAC/B,IAAK,MAAM,OACT6S,KACG7S,EACH,IAAI,QAAc6S,GAAS,CACzBokB,GAAQngC,IACN,MAAMugC,EAAUpG,EAAQpe,GACxB,OAAO/b,EAAO,IAAKA,EACjBU,MAAO6/B,EAAQ7/B,MACfJ,OAAQigC,EAAQjgC,QACdigC,CAAO,IAEb,KACF,CACF,GACC,CAACpG,MAIE4O,GAAmB,IAAAvjB,cAAYvB,IACnC,MAAMjiB,EAtCV,SAA2BA,GACzB,IAAKA,EACH,OAAO,KAGT,GAAIA,EAAKJ,SAASK,OAAS,EACzB,OAAOD,EAGT,MAAMgnC,EAAahnC,EAAKJ,SAAS,GACjC,OAAO,QAAconC,GAAcA,EAAahnC,CAClD,CA2BiBinC,CAAkBhlB,GACb,MAAlB4b,GAAkCA,EAAeE,aAE7C/9B,IACgB,MAAlB69B,GAAkCA,EAAekB,QAAQ/+B,IAG3Dm+B,EAAQn+B,EAAOm4B,EAAQn4B,GAAQ,KAAK,GACnC,CAACm4B,EAAS0F,KACNiD,EAASC,IAAU,QAAWgG,GACrC,OAAO,IAAAllB,UAAQ,KAAM,CACnBif,UACA9iC,OACA+iC,YACE,CAAC/iC,EAAM8iC,EAASC,GACtB,CA6dsBmG,CAAwB,CAC1C/O,QAAS6I,GAAuBf,YAAY9H,UAGxCyO,GAAwE,OAAxDzD,EAAwBlD,GAAYa,QAAQvd,SAAmB4f,EAAwBlL,GACvGr6B,GAAmBumC,EAA0D,OAAzCf,EAAoBnD,GAAYjiC,MAAgBolC,EAAoBzC,GAAiB,KACzHwG,GAAkBlN,QAAQgG,GAAYa,QAAQvd,SAAW0c,GAAYjiC,MAGrEopC,GAvtBC7W,EAFavyB,GAytBempC,GAAkB,KAAOxG,GAxtBxCpD,GAAgBv/B,KADtC,IAAsBA,GA2tBpB,MAAMkjC,GAAa5B,GAAcsH,IAAe,QAAUA,IAAgB,MAEpE5R,GAvtBR,SAAgCh1B,GAC9B,MAAMqnC,GAAe,IAAA/jB,QAAOtjB,GACtBsnC,GAAY,SAAY7J,GACvBz9B,EAIDy9B,GAAiBA,IAAkByB,IAAkBl/B,GAAQqnC,EAAa9jB,SAAWvjB,EAAKuyB,aAAe8U,EAAa9jB,QAAQgP,WACzHkL,EAGF5L,EAAuB7xB,GAPrBk/B,IAQR,CAACl/B,IAIJ,OAHA,IAAAkjB,YAAU,KACRmkB,EAAa9jB,QAAUvjB,CAAI,GAC1B,CAACA,IACGsnC,CACT,CAssB8BC,CAAuBpD,EAA4B,MAAZ2C,GAAmBA,GAAW7O,GAAa,MACxGn6B,GA9jBR,SAAkB0pC,EAAUrP,QACV,IAAZA,IACFA,EAAUrH,GAGZ,MAAO2W,GAAgBD,EACjBtG,EAAa5B,GAAcmI,GAAe,QAAUA,GAAgB,OACnEC,EAAOC,IAAY,IAAA9Z,UAAS2R,IAEnC,SAASoI,IACPD,GAAS,IACFH,EAASvnC,OAIPunC,EAASt/B,KAAI+Z,GAAWkR,EAA2BlR,GAAWif,EAAa,IAAIhM,EAAKiD,EAAQlW,GAAUA,KAHpGud,IAKb,CAEA,MAAM3B,EAAiBH,GAAkB,CACvCvZ,SAAUyjB,IAOZ,OALA,SAA0B,KACN,MAAlB/J,GAAkCA,EAAeE,aACjD6J,IACAJ,EAAS3nC,SAAQoiB,GAA6B,MAAlB4b,OAAyB,EAASA,EAAekB,QAAQ9c,IAAS,GAC7F,CAACulB,IACGE,CACT,CAkiBkCG,CAAS7S,IAEnC8S,GAjNR,SAAwBpE,EAAW/lC,GACjC,IAAI,UACFE,KACGsgB,GACDxgB,EACJ,OAAoB,MAAb+lC,GAAqBA,EAAUzjC,OAASyjC,EAAU/iC,QAAO,CAACqkB,EAAaH,IACrEA,EAAS,CACdhnB,UAAWmnB,KACR7G,KAEJtgB,GAAaA,CAClB,CAsM4BkqC,CAAerE,EAAW,CAClD7lC,UAAW,CACTW,EAAGkjC,EAAUljC,EAAI4oC,GAAc5oC,EAC/BJ,EAAGsjC,EAAUtjC,EAAIgpC,GAAchpC,EAC/B+nB,OAAQ,EACRC,OAAQ,GAEVsa,iBACA5T,SACA6T,kBACAC,qBACAhjC,oBACAqvB,KAAM0Z,GAAcpjB,QAAQ0J,KAC5B+a,gBAAiB/H,GAAYjiC,KAC7Bg3B,uBACAl3B,2BACAojC,gBAEI+G,GAAqBpC,IAAwB,QAAIA,GAAuBnE,GAAa,KACrFvM,GA1tBR,SAA0BqS,GACxB,MAAOU,EAAmBC,IAAwB,IAAAta,UAAS,MACrDua,GAAe,IAAA9kB,QAAOkkB,GAEtBa,GAAe,IAAA7kB,cAAY6B,IAC/B,MAAM2M,EAAmBU,EAAqBrN,EAAMtL,QAE/CiY,GAILmW,GAAqBD,GACdA,GAILA,EAAkBhG,IAAIlQ,EAAkBiB,EAAqBjB,IACtD,IAAIsL,IAAI4K,IAJN,MAKT,GACD,IAkCH,OAjCA,IAAAhlB,YAAU,KACR,MAAMolB,EAAmBF,EAAa7kB,QAEtC,GAAIikB,IAAac,EAAkB,CACjC73B,EAAQ63B,GACR,MAAMphC,EAAUsgC,EAASt/B,KAAI+Z,IAC3B,MAAMsmB,EAAoB7V,EAAqBzQ,GAE/C,OAAIsmB,GACFA,EAAkBtS,iBAAiB,SAAUoS,EAAc,CACzD9M,SAAS,IAEJ,CAACgN,EAAmBtV,EAAqBsV,KAG3C,IAAI,IACVvqB,QAAO3U,GAAkB,MAATA,IACnB8+B,EAAqBjhC,EAAQjH,OAAS,IAAIq9B,IAAIp2B,GAAW,MACzDkhC,EAAa7kB,QAAUikB,CACzB,CAEA,MAAO,KACL/2B,EAAQ+2B,GACR/2B,EAAQ63B,EAAiB,EAG3B,SAAS73B,EAAQ+2B,GACfA,EAAS3nC,SAAQoiB,IACf,MAAMsmB,EAAoB7V,EAAqBzQ,GAC1B,MAArBsmB,GAAqCA,EAAkBzS,oBAAoB,SAAUuS,EAAa,GAEtG,IACC,CAACA,EAAcb,KACX,IAAA3lB,UAAQ,IACT2lB,EAASvnC,OACJioC,EAAoBryB,MAAMC,KAAKoyB,EAAkBnhC,UAAUpG,QAAO,CAACwF,EAAKuzB,KAAgB,QAAIvzB,EAAKuzB,IAAc1K,GAAsB+F,EAAiByS,GAGxJxY,GACN,CAACwY,EAAUU,GAChB,CA8pBwBM,CAAiBxT,IAEjCyT,GAAmBtJ,GAAsBhK,IAEzCuT,GAAwBvJ,GAAsBhK,GAAe,CAACwL,KAC9DkG,IAA0B,QAAIiB,GAAmBW,IACjDnZ,GAAgB1xB,GAAmB+yB,EAAgB/yB,GAAkBkqC,IAAqB,KAC1FpY,GAAa5C,GAAUwC,GAAgBkU,EAAmB,CAC9D1W,SACAwC,iBACAC,kBACAC,oBAAqBwV,GACrBiD,wBACG,KACCU,GA5oFR,SAA2BjZ,GACzB,IAAKA,GAAoC,IAAtBA,EAAWzvB,OAC5B,OAAO,KAGT,MAAO2oC,GAAkBlZ,EACzB,OAAkBkZ,EAAuB,EAC3C,CAqoFiBC,CAAkBnZ,KAC1BzC,GAAM6b,KAAW,IAAAjb,UAAS,MAI3BhwB,GAl7ER,SAAqBA,EAAW2yB,EAAOC,GACrC,MAAO,IAAK5yB,EACVsoB,OAAQqK,GAASC,EAAQD,EAAM9xB,MAAQ+xB,EAAM/xB,MAAQ,EACrD0nB,OAAQoK,GAASC,EAAQD,EAAMlyB,OAASmyB,EAAMnyB,OAAS,EAE3D,CA66EoByqC,CADO5B,GAAkBW,IAAoB,QAAIA,GAAmBY,IACc,OAAnDrF,EAAqB,MAARpW,QAAe,EAASA,GAAKjvB,MAAgBqlC,EAAa,KAAM1C,IACxHqI,IAAkB,IAAA1lB,QAAO,MACzB2lB,IAAoB,IAAAzlB,cAAY,CAAC6B,EAAO2H,KAC5C,IACE6B,OAAQqa,EAAM,QACdnhB,GACEiF,EAEJ,GAAyB,MAArB0X,EAAUnhB,QACZ,OAGF,MAAM0U,EAAa4I,EAAejR,IAAI8U,EAAUnhB,SAEhD,IAAK0U,EACH,OAGF,MAAMyI,EAAiBrb,EAAMgV,YACvB8O,EAAiB,IAAID,EAAO,CAChCpc,OAAQ4X,EAAUnhB,QAClB0U,aACA5S,MAAOqb,EACP3Y,UAGAyQ,QAASmO,GAET,OAAAvK,CAAQ3lB,GAGN,IAFsBoqB,EAAejR,IAAInZ,GAGvC,OAGF,MAAM,YACJ2yB,GACEtE,GAAYvhB,QACV8B,EAAQ,CACZ5O,MAEa,MAAf2yB,GAA+BA,EAAY/jB,GAC3Cwe,EAAqB,CACnB1vB,KAAM,cACNkR,SAEJ,EAEA,SAAAwW,CAAUplB,EAAIujB,EAAYe,EAAoBrlB,GAG5C,IAFsBmrB,EAAejR,IAAInZ,GAGvC,OAGF,MAAM,cACJ4yB,GACEvE,GAAYvhB,QACV8B,EAAQ,CACZ5O,KACAujB,aACAe,qBACArlB,UAEe,MAAjB2zB,GAAiCA,EAAchkB,GAC/Cwe,EAAqB,CACnB1vB,KAAM,gBACNkR,SAEJ,EAEA,OAAA6S,CAAQ6C,GACN,MAAMtkB,EAAKiuB,EAAUnhB,QAErB,GAAU,MAAN9M,EACF,OAGF,MAAMisB,EAAgB7B,EAAejR,IAAInZ,GAEzC,IAAKisB,EACH,OAGF,MAAM,YACJ7V,GACEiY,GAAYvhB,QACV8B,EAAQ,CACZqb,iBACA5T,OAAQ,CACNrW,KACAyY,KAAMwT,EAAcxT,KACpBlxB,KAAMsmC,KAGV,IAAAgF,0BAAwB,KACP,MAAfzc,GAA+BA,EAAYxH,GAC3C4e,EAAUlB,GAAOwG,cACjBjI,EAAS,CACPntB,KAAMua,EAAO8M,UACbT,qBACAjO,OAAQrW,IAEVotB,EAAqB,CACnB1vB,KAAM,cACNkR,UAEFuf,EAAgBoE,GAAgBzlB,SAChCshB,GAAkBnE,EAAe,GAErC,EAEA,MAAA/G,CAAOD,GACL4H,EAAS,CACPntB,KAAMua,EAAOoT,SACbpI,eAEJ,EAEAE,MAAO4P,EAAc9a,EAAOqT,SAC5BjI,SAAU0P,EAAc9a,EAAOsT,cAIjC,SAASwH,EAAcr1B,GACrB,OAAOs1B,iBACL,MAAM,OACJ3c,EAAM,WACN4C,EAAU,KACVzC,EAAI,wBACJ4Z,GACEF,GAAcpjB,QAClB,IAAI8B,EAAQ,KAEZ,GAAIyH,GAAU+Z,EAAyB,CACrC,MAAM,WACJ6C,GACE5E,GAAYvhB,QAChB8B,EAAQ,CACNqb,iBACA5T,OAAQA,EACR4C,aACAlrB,MAAOqiC,EACP5Z,QAGE9Y,IAASua,EAAOqT,SAAiC,mBAAf2H,SACTC,QAAQC,QAAQF,EAAWrkB,MAGpDlR,EAAOua,EAAOsT,WAGpB,CAEA0C,EAAUnhB,QAAU,MACpB,IAAA+lB,0BAAwB,KACtBhI,EAAS,CACPntB,SAEF8vB,EAAUlB,GAAOmB,eACjB4E,GAAQ,MACRlE,EAAgB,MAChBC,GAAkB,MAClBmE,GAAgBzlB,QAAU,KAC1B,MAAMwS,EAAY5hB,IAASua,EAAOqT,QAAU,YAAc,eAE1D,GAAI1c,EAAO,CACT,MAAMjC,EAAU0hB,GAAYvhB,QAAQwS,GACzB,MAAX3S,GAA2BA,EAAQiC,GACnCwe,EAAqB,CACnB1vB,KAAM4hB,EACN1Q,SAEJ,IAEJ,CACF,CAvDA2jB,GAAgBzlB,QAAU4lB,CAuD1B,GAEF,CAACtI,IACKgJ,IAAoC,IAAArmB,cAAY,CAACJ,EAASyL,IACvD,CAACxJ,EAAOyH,KACb,MAAMuN,EAAchV,EAAMgV,YACpByP,EAAsBjJ,EAAejR,IAAI9C,GAE/C,GACsB,OAAtB4X,EAAUnhB,UACTumB,GACDzP,EAAY0P,QAAU1P,EAAY2P,iBAChC,OAGF,MAAMC,EAAoB,CACxBnd,OAAQgd,IAIa,IAFA1mB,EAAQiC,EAAOwJ,EAAO9G,QAASkiB,KAGpD5P,EAAY0P,OAAS,CACnBG,WAAYrb,EAAOA,QAErB6V,EAAUnhB,QAAUuJ,EACpBmc,GAAkB5jB,EAAOwJ,GAC3B,GAED,CAACgS,EAAgBoI,KACd9O,GAtvCR,SAA8BpL,EAASob,GACrC,OAAO,IAAAtoB,UAAQ,IAAMkN,EAAQpuB,QAAO,CAACqkB,EAAa6J,KAChD,MACEA,OAAQqa,GACNra,EAKJ,MAAO,IAAI7J,KAJckkB,EAAO/O,WAAWjyB,KAAIoyB,IAAa,CAC1DvE,UAAWuE,EAAUvE,UACrB3S,QAAS+mB,EAAoB7P,EAAUlX,QAASyL,OAEN,GAC3C,KAAK,CAACE,EAASob,GACpB,CA2uCqBC,CAAqBrb,EAAS8a,KAr2BnD,SAAwB9a,IACtB,IAAA7L,YAAU,KACR,IAAK,KACH,OAGF,MAAMmnB,EAActb,EAAQ7mB,KAAIvK,IAC9B,IAAI,OACFkxB,GACElxB,EACJ,OAAuB,MAAhBkxB,EAAOoO,WAAgB,EAASpO,EAAOoO,OAAO,IAEvD,MAAO,KACL,IAAK,MAAMqN,KAAYD,EACT,MAAZC,GAA4BA,GAC9B,CACD,GAGHvb,EAAQ7mB,KAAI8kB,IACV,IAAI,OACF6B,GACE7B,EACJ,OAAO6B,CAAM,IAEjB,CA60BE0b,CAAexb,IACf,SAA0B,KACpB4R,IAAkBpoB,IAAWwqB,GAAOwG,cACtCtF,EAAUlB,GAAOqB,YACnB,GACC,CAACzD,GAAgBpoB,KACpB,IAAA2K,YAAU,KACR,MAAM,WACJmL,GACEyW,GAAYvhB,SACV,OACJuJ,EAAM,eACN4T,EAAc,WACdhR,EAAU,KACVzC,GACE0Z,GAAcpjB,QAElB,IAAKuJ,IAAW4T,EACd,OAGF,MAAMrb,EAAQ,CACZyH,SACA4T,iBACAhR,aACAlrB,MAAO,CACLhG,EAAGqoC,GAAwBroC,EAC3BJ,EAAGyoC,GAAwBzoC,GAE7B6uB,SAEF,IAAAqc,0BAAwB,KACR,MAAdjb,GAA8BA,EAAWhJ,GACzCwe,EAAqB,CACnB1vB,KAAM,aACNkR,SACA,GACF,GAEJ,CAACwhB,GAAwBroC,EAAGqoC,GAAwBzoC,KACpD,IAAA8kB,YAAU,KACR,MAAM,OACJ4J,EAAM,eACN4T,EAAc,WACdhR,EAAU,oBACVF,EAAmB,wBACnBqX,GACEF,GAAcpjB,QAElB,IAAKuJ,GAA+B,MAArB4X,EAAUnhB,UAAoBmd,IAAmBmG,EAC9D,OAGF,MAAM,WACJ9Z,GACE+X,GAAYvhB,QACVinB,EAAgBhb,EAAoBI,IAAI+Y,IACxC1b,EAAOud,GAAiBA,EAAcxsC,KAAKulB,QAAU,CACzD9M,GAAI+zB,EAAc/zB,GAClBzY,KAAMwsC,EAAcxsC,KAAKulB,QACzB2L,KAAMsb,EAActb,KACpByO,SAAU6M,EAAc7M,UACtB,KACEtY,EAAQ,CACZyH,SACA4T,iBACAhR,aACAlrB,MAAO,CACLhG,EAAGqoC,EAAwBroC,EAC3BJ,EAAGyoC,EAAwBzoC,GAE7B6uB,SAEF,IAAAqc,0BAAwB,KACtBR,GAAQ7b,GACM,MAAdF,GAA8BA,EAAW1H,GACzCwe,EAAqB,CACnB1vB,KAAM,aACNkR,SACA,GACF,GAEJ,CAACsjB,MACD,SAA0B,KACxBhC,GAAcpjB,QAAU,CACtBmd,iBACA5T,SACAmL,cACA3I,iBACAI,cACAH,kBACAsR,iBACA+F,gBACAhpC,oBACA4xB,sBACAvC,QACA+H,uBACA6R,4BAEFvC,EAAY/gB,QAAU,CACpBghB,QAAS3mC,GACT4mC,WAAYlV,GACb,GACA,CAACxC,EAAQmL,GAAYvI,GAAYJ,GAAeuR,EAAgB+F,GAAchpC,GAAkB2xB,GAAgBC,EAAqBvC,GAAM+H,GAAqB6R,KAtgDrK,SAAyBlpC,GACvB,IAAI,aACF42B,EAAY,UACZ+F,EAAYyC,GAAoB0N,QAAO,UACvCC,EAAS,aACTC,EAAY,QACZ1E,EAAO,SACP2E,EAAW,EAAC,MACZlpC,EAAQs7B,GAAe6N,UAAS,mBAChC5C,EAAkB,oBAClBjT,EAAmB,wBACnBl3B,EAAuB,MACvB0G,EAAK,UACLmwB,GACEh3B,EACJ,MAAMmtC,EA0GR,SAAyB9d,GACvB,IAAI,MACFxoB,EAAK,SACLm5B,GACE3Q,EACJ,MAAM+d,GAAgB,QAAYvmC,GAClC,OAAO,SAAYwmC,IACjB,GAAIrN,IAAaoN,IAAkBC,EAEjC,OAAO9N,GAGT,MAAMzI,EACD9wB,KAAKsnC,KAAKzmC,EAAMhG,EAAIusC,EAAcvsC,GADjCi2B,EAED9wB,KAAKsnC,KAAKzmC,EAAMpG,EAAI2sC,EAAc3sC,GAGvC,MAAO,CACLI,EAAG,CACD,CAAC00B,EAAU0B,UAAWoW,EAAexsC,EAAE00B,EAAU0B,YAA8B,IAAjBH,EAC9D,CAACvB,EAAU2B,SAAUmW,EAAexsC,EAAE00B,EAAU2B,UAA4B,IAAhBJ,GAE9Dr2B,EAAG,CACD,CAAC80B,EAAU0B,UAAWoW,EAAe5sC,EAAE80B,EAAU0B,YAA8B,IAAjBH,EAC9D,CAACvB,EAAU2B,SAAUmW,EAAe5sC,EAAE80B,EAAU2B,UAA4B,IAAhBJ,GAE/D,GACA,CAACkJ,EAAUn5B,EAAOumC,GACvB,CAtIuBG,CAAgB,CACnC1mC,QACAm5B,UAAWsI,KAENkF,EAAuBC,IAA2B,UACnDC,GAAc,IAAA/nB,QAAO,CACzB9kB,EAAG,EACHJ,EAAG,IAECktC,GAAkB,IAAAhoB,QAAO,CAC7B9kB,EAAG,EACHJ,EAAG,IAECJ,GAAO,IAAA6jB,UAAQ,KACnB,OAAQyY,GACN,KAAKyC,GAAoB0N,QACvB,OAAOxC,EAAqB,CAC1B9pC,IAAK8pC,EAAmB7pC,EACxBC,OAAQ4pC,EAAmB7pC,EAC3BG,KAAM0pC,EAAmBzpC,EACzBC,MAAOwpC,EAAmBzpC,GACxB,KAEN,KAAKu+B,GAAoBwO,cACvB,OAAOZ,EACX,GACC,CAACrQ,EAAWqQ,EAAc1C,IACvBuD,GAAqB,IAAAloB,QAAO,MAC5BigB,GAAa,IAAA/f,cAAY,KAC7B,MAAM6Q,EAAkBmX,EAAmBjoB,QAE3C,IAAK8Q,EACH,OAGF,MAAMxB,EAAawY,EAAY9nB,QAAQ/kB,EAAI8sC,EAAgB/nB,QAAQ/kB,EAC7Dw0B,EAAYqY,EAAY9nB,QAAQnlB,EAAIktC,EAAgB/nB,QAAQnlB,EAClEi2B,EAAgBmF,SAAS3G,EAAYG,EAAU,GAC9C,IACGyY,GAA4B,IAAA5pB,UAAQ,IAAMngB,IAAUs7B,GAAe6N,UAAY,IAAI7V,GAAqBzsB,UAAYysB,GAAqB,CAACtzB,EAAOszB,KACvJ,IAAA9R,YAAU,KACR,GAAK+iB,GAAYjR,EAAoB/0B,QAAWjC,EAAhD,CAKA,IAAK,MAAMq2B,KAAmBoX,EAA2B,CACvD,IAAkE,KAAhD,MAAbf,OAAoB,EAASA,EAAUrW,IAC1C,SAGF,MAAMrnB,EAAQgoB,EAAoBtD,QAAQ2C,GACpCC,EAAsBx2B,EAAwBkP,GAEpD,IAAKsnB,EACH,SAGF,MAAM,UACJG,EAAS,MACTC,GACEN,EAA2BC,EAAiBC,EAAqBt2B,EAAMu2B,EAAcI,GAEzF,IAAK,MAAMS,IAAQ,CAAC,IAAK,KAClB0V,EAAa1V,GAAMX,EAAUW,MAChCV,EAAMU,GAAQ,EACdX,EAAUW,GAAQ,GAItB,GAAIV,EAAMl2B,EAAI,GAAKk2B,EAAMt2B,EAAI,EAM3B,OALAgtC,IACAI,EAAmBjoB,QAAU8Q,EAC7B8W,EAAsB5H,EAAYqH,GAClCS,EAAY9nB,QAAUmR,OACtB4W,EAAgB/nB,QAAUkR,EAG9B,CAEA4W,EAAY9nB,QAAU,CACpB/kB,EAAG,EACHJ,EAAG,GAELktC,EAAgB/nB,QAAU,CACxB/kB,EAAG,EACHJ,EAAG,GAELgtC,GA5CA,MAFEA,GA8CuB,GAE3B,CAAC7W,EAAcgP,EAAYmH,EAAWU,EAAyBnF,EAAS2E,EACxE1gC,KAAKC,UAAUnM,GACfkM,KAAKC,UAAU2gC,GAAeK,EAAuBnW,EAAqByW,EAA2B3tC,EACrGoM,KAAKC,UAAUwqB,IACjB,CA05CE+W,CAAgB,IAAK5F,GACnBthC,MAAOk9B,EACPiJ,aAAcrb,GACd2Y,sBACAjT,uBACAl3B,6BAEF,MAAM6tC,IAAgB,IAAA9pB,UAAQ,KACZ,CACdiL,SACAmL,cACA0I,kBACAD,iBACAhR,cACAkR,qBACAX,eACAY,iBACArR,sBACAD,kBACAtC,QACAgU,8BACAjM,uBACAl3B,2BACAkjC,0BACAG,sBACAD,iBAGD,CAACpU,EAAQmL,GAAY0I,GAAgBD,EAAgBhR,GAAYkR,GAAmBX,GAAaY,EAAgBrR,EAAqBD,GAAgBtC,GAAMgU,GAA4BjM,GAAqBl3B,GAAyBkjC,GAAwBG,GAAoBD,KAC/Q0K,IAAkB,IAAA/pB,UAAQ,KACd,CACd6e,iBACAvG,cACArN,SACA6T,kBACAU,kBAAmB,CACjB1U,UAAWoY,IAEbzD,WACAT,iBACA5T,QACAgU,iCAGD,CAACP,EAAgBvG,GAAYrN,EAAQ6T,GAAgBW,EAAUyD,GAAwBlE,EAAgB5T,GAAMgU,KAChH,OAAO,kBAAoBzU,EAAkBqf,SAAU,CACrD3tC,MAAO4lC,GACN,kBAAoBvC,GAAgBsK,SAAU,CAC/C3tC,MAAO0tC,IACN,kBAAoBpK,GAAcqK,SAAU,CAC7C3tC,MAAOytC,IACN,kBAAoB7I,GAAuB+I,SAAU,CACtD3tC,MAAOL,IACN+B,IAAY,kBAAoB0iC,GAAc,CAC/C3E,UAA4E,KAAhD,MAAjB2F,OAAwB,EAASA,EAAcwI,iBACvD,kBAAoBxe,EAAe,IAAKgW,EAC3C7V,wBAAyBsX,KAkB7B,IAEMgH,IAA2B,IAAAtf,eAAc,MACzCuf,GAAc,SACdC,GAAY,YAClB,SAASC,GAAavuC,GACpB,IAAI,GACF8Y,EAAE,KACFyY,EAAI,SACJyO,GAAW,EAAK,WAChBwO,GACExuC,EACJ,MAAMmP,GAAM,QAAYm/B,KAClB,WACJ9R,EAAU,eACVuG,EAAc,OACd5T,EAAM,eACN6T,EAAc,kBACdU,EAAiB,eACjBR,EAAc,KACd5T,IACE,IAAAkB,YAAWoT,KACT,KACJhV,EAAOyf,GAAW,gBAClBI,EAAkB,YAAW,SAC7BC,EAAW,GACK,MAAdF,EAAqBA,EAAa,CAAC,EACjCG,GAAwB,MAAVxf,OAAiB,EAASA,EAAOrW,MAAQA,EACvD5Y,GAAY,IAAAswB,YAAWme,EAAaxJ,GAAyBiJ,KAC5D/rC,EAAMwkB,IAAc,WACpB+V,EAAegS,IAAuB,UACvC5W,EA5hCR,SAA+BA,EAAWlf,GACxC,OAAO,IAAAoL,UAAQ,IACN8T,EAAUh1B,QAAO,CAACwF,EAAKxI,KAC5B,IAAI,UACFo4B,EAAS,QACT3S,GACEzlB,EAMJ,OAJAwI,EAAI4vB,GAAa1Q,IACfjC,EAAQiC,EAAO5O,EAAG,EAGbtQ,CAAG,GACT,CAAC,IACH,CAACwvB,EAAWlf,GACjB,CA6gCoB+1B,CAAsBrS,EAAY1jB,GAC9Cg2B,GAAU,QAAevd,GA0B/B,OAzBA,SAA0B,KACxB2R,EAAeqB,IAAIzrB,EAAI,CACrBA,KACA3J,MACA9M,OACAu6B,gBACArL,KAAMud,IAED,KACL,MAAMzsC,EAAO6gC,EAAejR,IAAInZ,GAE5BzW,GAAQA,EAAK8M,MAAQA,GACvB+zB,EAAewB,OAAO5rB,EACxB,IAGJ,CAACoqB,EAAgBpqB,IASV,CACLqW,SACA4T,iBACAC,iBACAwL,YAZyB,IAAAtqB,UAAQ,KAAM,CACvC0K,OACA8f,WACA,gBAAiB1O,EACjB,kBAAgB2O,GAAc/f,IAASyf,UAAqB9/B,EAC5D,uBAAwBkgC,EACxB,mBAAoB/K,EAAkB1U,aACpC,CAACgR,EAAUpR,EAAM8f,EAAUC,EAAYF,EAAiB/K,EAAkB1U,YAM5E2f,aACA3W,UAAWgI,OAAWzxB,EAAYypB,EAClC31B,OACAitB,OACAzI,aACA+nB,sBACA1uC,YAEJ,CAEA,SAAS6uC,KACP,OAAO,IAAAve,YAAWqT,GACpB,CAEA,MAAMmL,GAAc,YACdC,GAA8B,CAClCC,QAAS,IAEX,SAASC,GAAanvC,GACpB,IAAI,KACFuxB,EAAI,SACJyO,GAAW,EAAK,GAChBlnB,EAAE,qBACFs2B,GACEpvC,EACJ,MAAMmP,GAAM,QAAY6/B,KAClB,OACJ7f,EAAM,SACNwU,EAAQ,KACRrU,EAAI,2BACJgU,IACE,IAAA9S,YAAWoT,IACTyL,GAAW,IAAA1pB,QAAO,CACtBqa,aAEIsP,GAA0B,IAAA3pB,SAAO,GACjCtlB,GAAO,IAAAslB,QAAO,MACd4pB,GAAa,IAAA5pB,QAAO,OAExBqa,SAAUwP,EAAsB,sBAChCC,EACAP,QAASQ,GACP,IAAKT,MACJG,GAECroB,GAAM,QAAwC,MAAzB0oB,EAAgCA,EAAwB32B,GAmB7EonB,EAAiBH,GAAkB,CACvCvZ,UAnBmB,IAAAX,cAAY,KAC1BypB,EAAwB1pB,SAOH,MAAtB2pB,EAAW3pB,SACbqY,aAAasR,EAAW3pB,SAG1B2pB,EAAW3pB,QAAUtJ,YAAW,KAC9BgnB,EAA2BprB,MAAMkL,QAAQ2D,EAAInB,SAAWmB,EAAInB,QAAU,CAACmB,EAAInB,UAC3E2pB,EAAW3pB,QAAU,IAAI,GACxB8pB,IAXDJ,EAAwB1pB,SAAU,CAWX,GAE3B,CAAC8pB,IAGC1P,SAAUwP,IAA2BrgB,IAEjCia,GAAmB,IAAAvjB,cAAY,CAAC8pB,EAAYC,KAC3C1P,IAID0P,IACF1P,EAAe2P,UAAUD,GACzBN,EAAwB1pB,SAAU,GAGhC+pB,GACFzP,EAAekB,QAAQuO,GACzB,GACC,CAACzP,KACGiD,EAAStc,IAAc,QAAWuiB,GACnC0F,GAAU,QAAevd,GAwC/B,OAvCA,IAAAhM,YAAU,KACH2a,GAAmBiD,EAAQvd,UAIhCsa,EAAeE,aACfkP,EAAwB1pB,SAAU,EAClCsa,EAAekB,QAAQ+B,EAAQvd,SAAQ,GACtC,CAACud,EAASjD,KACb,IAAA3a,YAAU,KACRoe,EAAS,CACPntB,KAAMua,EAAOuT,kBACbhgB,QAAS,CACPxL,KACA3J,MACA6wB,WACA39B,KAAM8gC,EACN9iC,OACAkxB,KAAMud,KAGH,IAAMnL,EAAS,CACpBntB,KAAMua,EAAO0T,oBACbt1B,MACA2J,SAGJ,CAACA,KACD,IAAAyM,YAAU,KACJya,IAAaqP,EAASzpB,QAAQoa,WAChC2D,EAAS,CACPntB,KAAMua,EAAOyT,qBACb1rB,KACA3J,MACA6wB,aAEFqP,EAASzpB,QAAQoa,SAAWA,EAC9B,GACC,CAAClnB,EAAI3J,EAAK6wB,EAAU2D,IAChB,CACLxU,SACA9uB,OACAyvC,QAAiB,MAARxgB,OAAe,EAASA,EAAKxW,MAAQA,EAC9CzW,KAAM8gC,EACN7T,OACAzI,aAEJ,mBCv/GA,IAAI7I,EAAa,EAAQ,OACrB+xB,EAAmB,EAAQ,OAC3BnqC,EAAO,EAAQ,OAEnBrG,EAAOC,QAEP,SAASysB,EAAaxsB,EAAG2C,EAAGuL,EAAI8P,GAC9B,IAAIoO,EAAUpsB,EAAEwC,SAASG,GACrBC,EAAO5C,EAAE4C,KAAKD,GACd4tC,EAAK3tC,EAAOA,EAAKG,gBAAa+L,EAC9B0hC,EAAK5tC,EAAOA,EAAKI,iBAAa8L,EAC9B2hC,EAAY,CAAC,EAEbF,IACFnkB,EAAUA,EAAQxL,QAAO7c,GAAKA,IAAMwsC,GAAMxsC,IAAMysC,KAGlD,IAAIE,EAAcnyB,EAAWve,EAAGosB,GAChCskB,EAAYjuC,SAAQwJ,IAClB,GAAIjM,EAAEwC,SAASyJ,EAAMtJ,GAAGE,OAAQ,CAC9B,IAAI8tC,EAAiBnkB,EAAaxsB,EAAGiM,EAAMtJ,EAAGuL,EAAI8P,GAClDyyB,EAAUxkC,EAAMtJ,GAAKguC,EACjBA,EAAe7tC,eAAe,gBAwCN8tC,EAvCFD,OAwCJ7hC,KADF6N,EAvCD1Q,GAwCZsS,YACT5B,EAAO4B,YAAc5B,EAAO4B,WAAa5B,EAAOpa,OAC3BquC,EAAMryB,WAAaqyB,EAAMruC,SACzBoa,EAAOpa,OAASquC,EAAMruC,QAC3Coa,EAAOpa,QAAUquC,EAAMruC,SAEvBoa,EAAO4B,WAAaqyB,EAAMryB,WAC1B5B,EAAOpa,OAASquC,EAAMruC,QA7CtB,CAqCJ,IAA0Boa,EAAQi0B,CArC9B,IAGF,IAAI9mC,EAAUwmC,EAAiBI,EAAaxiC,IAuB9C,SAAyBpE,EAAS2mC,GAChC3mC,EAAQrH,SAAQwJ,IACdA,EAAMkC,GAAKlC,EAAMkC,GAAGqd,SAAQ7oB,GACtB8tC,EAAU9tC,GACL8tC,EAAU9tC,GAAGwL,GAEfxL,GACP,GAEN,CA/BEkuC,CAAgB/mC,EAAS2mC,GAEzB,IAAIvjC,EAAS/G,EAAK2D,EAASkU,GAE3B,GAAIuyB,IACFrjC,EAAOiB,GAAK,CAACoiC,EAAIrjC,EAAOiB,GAAIqiC,GAAIhyB,MAAK,GACjCxe,EAAEiE,aAAassC,GAAI1tC,QAAQ,CAC7B,IAAIiuC,EAAS9wC,EAAE4C,KAAK5C,EAAEiE,aAAassC,GAAI,IACrCQ,EAAS/wC,EAAE4C,KAAK5C,EAAEiE,aAAausC,GAAI,IAChCtjC,EAAOpK,eAAe,gBACzBoK,EAAOqR,WAAa,EACpBrR,EAAO3K,OAAS,GAElB2K,EAAOqR,YAAcrR,EAAOqR,WAAarR,EAAO3K,OAC3BuuC,EAAOxsC,MAAQysC,EAAOzsC,QAAU4I,EAAO3K,OAAS,GACrE2K,EAAO3K,QAAU,CACnB,CAGF,OAAO2K,CACT,aCjDApN,EAAOC,QAIP,SAAuBC,EAAGia,EAAUC,GAClC,OAKF,SAA0Bla,EAAGia,EAAUC,GACrC,IAAI3D,EAAU,CAAC,EACX/N,EAAQxI,EAAEwI,QAkCd,OAhCAA,EAAM/F,SAAQ,SAASE,GACrB4T,EAAQ5T,GAAK,CAAC,EACd4T,EAAQ5T,GAAGA,GAAK,CAAE0X,SAAU,GAC5B7R,EAAM/F,SAAQ,SAASsB,GACjBpB,IAAMoB,IACRwS,EAAQ5T,GAAGoB,GAAK,CAAEsW,SAAUjR,OAAOC,mBAEvC,IACA6Q,EAAOvX,GAAGF,SAAQ,SAASwF,GACzB,IAAIlE,EAAIkE,EAAKtF,IAAMA,EAAIsF,EAAKlE,EAAIkE,EAAKtF,EACjC+X,EAAIT,EAAShS,GACjBsO,EAAQ5T,GAAGoB,GAAK,CAAEsW,SAAUK,EAAGJ,YAAa3X,EAC9C,GACF,IAEA6F,EAAM/F,SAAQ,SAAS4J,GACrB,IAAI2kC,EAAOz6B,EAAQlK,GACnB7D,EAAM/F,SAAQ,SAASqB,GACrB,IAAImtC,EAAO16B,EAAQzS,GACnB0E,EAAM/F,SAAQ,SAAS6N,GACrB,IAAI4gC,EAAKD,EAAK5kC,GACV8kC,EAAKH,EAAK1gC,GACV8gC,EAAKH,EAAK3gC,GACV+gC,EAAcH,EAAG72B,SAAW82B,EAAG92B,SAC/Bg3B,EAAcD,EAAG/2B,WACnB+2B,EAAG/2B,SAAWg3B,EACdD,EAAG92B,YAAc62B,EAAG72B,YAExB,GACF,GACF,IAEO/D,CACT,CA1CS+6B,CAAiBtxC,EACtBia,GAAYO,EACZN,GAAU,SAASvX,GAAK,OAAO3C,EAAEmJ,SAASxG,EAAI,EAClD,EANA,IAAI6X,EAAsB,IAAM,2ECIrB+2B,EAA6B,CAACC,EAAQ7mB,IAA6E,EAAA8mB,KAAKjf,IAAI,wDAAwD,QAAc,OAAc,CAAC,EAAG7H,GAAU,CAAC,EAAG,CAC3O6mB,qICAF,SAASE,EAAUjuB,EAAO/K,EAAMi5B,GAC9B,MAAMC,EAAWnuB,EAAMlf,QAEvB,OADAqtC,EAASC,OAAOF,EAAK,EAAIC,EAAS/uC,OAAS8uC,EAAKA,EAAI,EAAGC,EAASC,OAAOn5B,EAAM,GAAG,IACzEk5B,CACT,CAYA,SAASE,EAAeC,EAAOzH,GAC7B,OAAOyH,EAAMxuC,QAAO,CAACqkB,EAAavO,EAAIzJ,KACpC,MAAMhP,EAAO0pC,EAAM9X,IAAInZ,GAMvB,OAJIzY,IACFgnB,EAAYhY,GAAShP,GAGhBgnB,CAAW,GACjBnP,MAAMs5B,EAAMlvC,QACjB,CAEA,SAASmvC,EAAapiC,GACpB,OAAiB,OAAVA,GAAkBA,GAAS,CACpC,CA2GA,MAAMqiC,EAAsB1xC,IAC1B,IAAI,MACF+pC,EAAK,YACL4H,EAAW,UACXC,EAAS,MACTviC,GACErP,EACJ,MAAM6xC,EAAWV,EAAUpH,EAAO6H,EAAWD,GACvCG,EAAU/H,EAAM16B,GAChBuxB,EAAUiR,EAASxiC,GAEzB,OAAKuxB,GAAYkR,EAIV,CACLjxC,EAAG+/B,EAAQhgC,KAAOkxC,EAAQlxC,KAC1BH,EAAGmgC,EAAQpgC,IAAMsxC,EAAQtxC,IACzBgoB,OAAQoY,EAAQ7/B,MAAQ+wC,EAAQ/wC,MAChC0nB,OAAQmY,EAAQjgC,OAASmxC,EAAQnxC,QAP1B,IAQR,EAoCGoxC,EAAiB,CACrBvpB,OAAQ,EACRC,OAAQ,GAEJupB,EAA8BhyC,IAClC,IAAIiyC,EAEJ,IAAI,YACFN,EACA3O,eAAgBkP,EAAkB,MAClC7iC,EAAK,MACL06B,EAAK,UACL6H,GACE5xC,EACJ,MAAMgjC,EAA8D,OAA5CiP,EAAqBlI,EAAM4H,IAAwBM,EAAqBC,EAEhG,IAAKlP,EACH,OAAO,KAGT,GAAI3zB,IAAUsiC,EAAa,CACzB,MAAMQ,EAAgBpI,EAAM6H,GAE5B,OAAKO,EAIE,CACLtxC,EAAG,EACHJ,EAAGkxC,EAAcC,EAAYO,EAAc3xC,IAAM2xC,EAAcxxC,QAAUqiC,EAAexiC,IAAMwiC,EAAeriC,QAAUwxC,EAAc3xC,IAAMwiC,EAAexiC,OACvJuxC,GANI,IAQX,CAEA,MAAMK,EAyBR,SAAsBC,EAAahjC,EAAOsiC,GACxC,MAAMjR,EAAc2R,EAAYhjC,GAC1BijC,EAAeD,EAAYhjC,EAAQ,GACnCkjC,EAAWF,EAAYhjC,EAAQ,GAErC,OAAKqxB,EAIDiR,EAActiC,EACTijC,EAAe5R,EAAYlgC,KAAO8xC,EAAa9xC,IAAM8xC,EAAa3xC,QAAU4xC,EAAWA,EAAS/xC,KAAOkgC,EAAYlgC,IAAMkgC,EAAY//B,QAAU,EAGjJ4xC,EAAWA,EAAS/xC,KAAOkgC,EAAYlgC,IAAMkgC,EAAY//B,QAAU2xC,EAAe5R,EAAYlgC,KAAO8xC,EAAa9xC,IAAM8xC,EAAa3xC,QAAU,EAP7I,CAQX,CAvCkB6xC,CAAazI,EAAO16B,EAAOsiC,GAE3C,OAAItiC,EAAQsiC,GAAetiC,GAASuiC,EAC3B,CACL/wC,EAAG,EACHJ,GAAIuiC,EAAeriC,OAASyxC,KACzBL,GAIH1iC,EAAQsiC,GAAetiC,GAASuiC,EAC3B,CACL/wC,EAAG,EACHJ,EAAGuiC,EAAeriC,OAASyxC,KACxBL,GAIA,CACLlxC,EAAG,EACHJ,EAAG,KACAsxC,EACJ,EAmBGzD,EAAY,WACZmE,EAAuB,kBAAoB,CAC/Cd,aAAc,EACde,YAAapE,EACbqE,mBAAmB,EACnBnB,MAAO,GACPI,WAAY,EACZgB,gBAAgB,EAChBC,YAAa,GACb3Q,SAAUwP,EACV1R,SAAU,CACRhR,WAAW,EACXiT,WAAW,KAGf,SAAS6Q,EAAgB9yC,GACvB,IAAI,SACFiC,EAAQ,GACR6W,EACA04B,MAAOuB,EAAgB,SACvB7Q,EAAWwP,EACX1R,SAAUgT,GAAe,GACvBhzC,EACJ,MAAM,OACJmvB,EAAM,YACNmT,EAAW,eACX1Q,EAAc,KACdtC,EAAI,2BACJgU,IACE,UACEoP,GAAc,QAAYpE,EAAWx1B,GACrC85B,EAAiBtW,QAA6B,OAArBgG,EAAYjiC,MACrCmxC,GAAQ,IAAAttB,UAAQ,IAAM6uB,EAAiBxoC,KAAI0oC,GAAwB,iBAATA,GAAqB,OAAQA,EAAOA,EAAKn6B,GAAKm6B,KAAO,CAACF,IAChHpE,EAAuB,MAAVxf,EACbwiB,EAAcxiB,EAASqiB,EAAMzd,QAAQ5E,EAAOrW,KAAO,EACnD84B,EAAYtiB,EAAOkiB,EAAMzd,QAAQzE,EAAKxW,KAAO,EAC7Co6B,GAAmB,IAAAvtB,QAAO6rB,GAC1B2B,GAjRR,SAAoBttC,EAAGC,GACrB,GAAID,IAAMC,EACR,OAAO,EAGT,GAAID,EAAEvD,SAAWwD,EAAExD,OACjB,OAAO,EAGT,IAAK,IAAIiB,EAAI,EAAGA,EAAIsC,EAAEvD,OAAQiB,IAC5B,GAAIsC,EAAEtC,KAAOuC,EAAEvC,GACb,OAAO,EAIX,OAAO,CACT,CAiQ4B6vC,CAAW5B,EAAO0B,EAAiBttB,SACvD+sB,GAAmC,IAAff,IAAqC,IAAjBD,GAAsBwB,EAC9DnT,EAjQR,SAA2BA,GACzB,MAAwB,kBAAbA,EACF,CACLhR,UAAWgR,EACXiC,UAAWjC,GAIRA,CACT,CAwPmBqT,CAAkBL,IACnC,SAA0B,KACpBG,GAAoBxE,GACtBrL,EAA2BkO,EAC7B,GACC,CAAC2B,EAAkB3B,EAAO7C,EAAYrL,KACzC,IAAA/d,YAAU,KACR2tB,EAAiBttB,QAAU4rB,CAAK,GAC/B,CAACA,IACJ,MAAM8B,GAAe,IAAApvB,UAAQ,KAAM,CACjCytB,cACAe,cACA1S,WACA2S,oBACAnB,QACAI,YACAgB,iBACAC,YAAatB,EAAeC,EAAO5f,GACnCsQ,cAEF,CAACyP,EAAae,EAAa1S,EAAShR,UAAWgR,EAASiC,UAAW0Q,EAAmBnB,EAAOI,EAAWhgB,EAAgBghB,EAAgB1Q,IACxI,OAAO,kBAAoBuQ,EAAQvE,SAAU,CAC3C3tC,MAAO+yC,GACNrxC,EACL,CAEA,MAAMsxC,EAAwBvzC,IAC5B,IAAI,GACF8Y,EAAE,MACF04B,EAAK,YACLG,EAAW,UACXC,GACE5xC,EACJ,OAAOmxC,EAAUK,EAAOG,EAAaC,GAAW7d,QAAQjb,EAAG,EAEvD06B,EAA8BnkB,IAClC,IAAI,YACFqjB,EAAW,UACXe,EAAS,YACTC,EAAW,MACXrkC,EAAK,MACLmiC,EAAK,SACLmC,EAAQ,cACRC,EAAa,oBACbC,EAAmB,WACnBC,GACEzkB,EAEJ,SAAKykB,IAAeJ,GAIhBE,IAAkBpC,GAASniC,IAAUskC,IAIrCF,IAIGE,IAAatkC,GAASqjC,IAAgBmB,GAAmB,EAE5DE,EAAoB,CACxB9tB,SAAU,IACV4C,OAAQ,QAEJmrB,EAAqB,YACrBC,EAAkC,KAAItrB,WAAWtc,SAAS,CAC9Duc,SAAUorB,EACV/tB,SAAU,EACV4C,OAAQ,WAEJqrB,EAAoB,CACxBzF,gBAAiB,YAkDnB,SAAS0F,EAAYn0C,GACnB,IAAI,qBACFo0C,EAAuBZ,EACvBhF,WAAY6F,EACZrU,SAAUsU,EACV/iB,KAAMgjB,EAAU,YAChBC,EAAcjB,EAAqB,GACnCz6B,EACAopB,SAAUuS,EAAa,qBACvBrF,EAAoB,WACpB0E,EAAaC,GACX/zC,EACJ,MAAM,MACJwxC,EAAK,YACLkB,EAAW,YACXf,EACA3R,SAAU0U,EAAc,kBACxB/B,EAAiB,YACjBE,EAAW,UACXjB,EAAS,eACTgB,EACA1Q,SAAUyS,IACR,IAAAnkB,YAAWiiB,GACTzS,EAoKR,SAAgCsU,EAAeI,GAC7C,IAAIE,EAAuBC,EAE3B,MAA6B,kBAAlBP,EACF,CACLtlB,UAAWslB,EAEXrS,WAAW,GAIR,CACLjT,UAAiG,OAArF4lB,EAAyC,MAAjBN,OAAwB,EAASA,EAActlB,WAAqB4lB,EAAwBF,EAAe1lB,UAC/IiT,UAAiG,OAArF4S,EAAyC,MAAjBP,OAAwB,EAASA,EAAcrS,WAAqB4S,EAAwBH,EAAezS,UAEnJ,CAnLmB6S,CAAuBR,EAAeI,GACjDrlC,EAAQmiC,EAAMzd,QAAQjb,GACtByY,GAAO,IAAArN,UAAQ,KAAM,CACzBvG,SAAU,CACR+0B,cACArjC,QACAmiC,YAEC+C,KACD,CAAC7B,EAAa6B,EAAYllC,EAAOmiC,IAC/BuD,GAA4B,IAAA7wB,UAAQ,IAAMstB,EAAMxtC,MAAMwtC,EAAMzd,QAAQjb,KAAM,CAAC04B,EAAO14B,KAClF,KACJzY,EAAI,KACJgC,EAAI,OACJytC,EACAjpB,WAAYmuB,IACV,QAAa,CACfl8B,KACAyY,OACAyO,SAAUA,EAASiC,UACnBmN,qBAAsB,CACpBK,sBAAuBsF,KACpB3F,MAGD,OACJjgB,EAAM,eACN4T,EAAc,eACdC,EAAc,WACdwL,EACA3nB,WAAYouB,EAAmB,UAC/Bjd,EAAS,WACT2W,EAAU,KACVrf,EAAI,oBACJsf,EAAmB,UACnB1uC,IACE,QAAa,CACf4Y,KACAyY,OACAid,WAAY,IAAK0F,KACZG,GAELrU,SAAUA,EAAShR,YAEfnI,GAAa,QAAgBmuB,EAAqBC,GAClDxB,EAAYnX,QAAQnN,GACpB+lB,EAAezB,IAAcd,GAAqBlB,EAAaE,IAAgBF,EAAaG,GAC5FuD,GAA4BvC,GAAkBjE,EAC9CyG,EAAyBD,GAA4BD,EAAeh1C,EAAY,KAEhFm1C,EAAiBH,EAAyC,MAA1BE,EAAiCA,GADrC,MAAjBX,EAAwBA,EAAgBE,GACgD,CACvG5K,MAAO8I,EACP7P,iBACA2O,cACAC,YACAviC,UACG,KACCskC,GAAWlC,EAAaE,IAAgBF,EAAaG,GAAa4C,EAAY,CAClF17B,KACA04B,QACAG,cACAC,cACGviC,EACCq3B,GAAqB,MAAVvX,OAAiB,EAASA,EAAOrW,GAC5Cu2B,IAAW,IAAA1pB,QAAO,CACtB+gB,YACA8K,QACAmC,YACAjB,gBAEIS,GAAmB3B,IAAUnC,GAASzpB,QAAQ4rB,MAC9C8D,GAA6BlB,EAAqB,CACtDjlB,SACAujB,cACA/D,aACA8E,YACA36B,KACAzJ,QACAmiC,QACAmC,SAAUtE,GAASzpB,QAAQ+tB,SAC3BC,cAAevE,GAASzpB,QAAQ4rB,MAChCqC,oBAAqBxE,GAASzpB,QAAQ8sB,YACtCoB,aACAJ,YAA0C,MAA7BrE,GAASzpB,QAAQ8gB,WAE1B6O,GAtJR,SAA6Bv1C,GAC3B,IAAI,SACFggC,EAAQ,MACR3wB,EAAK,KACLhN,EAAI,KACJhC,GACEL,EACJ,MAAOu1C,EAAkBC,IAAuB,IAAAtlB,UAAS,MACnDulB,GAAgB,IAAA9vB,QAAOtW,GA+B7B,OA9BA,SAA0B,KACxB,IAAK2wB,GAAY3wB,IAAUomC,EAAc7vB,SAAWvjB,EAAKujB,QAAS,CAChE,MAAMghB,EAAUvmC,EAAKulB,QAErB,GAAIghB,EAAS,CACX,MAAMhhB,GAAU,QAAcvjB,EAAKujB,QAAS,CAC1CsN,iBAAiB,IAEbrsB,EAAQ,CACZhG,EAAG+lC,EAAQhmC,KAAOglB,EAAQhlB,KAC1BH,EAAGmmC,EAAQpmC,IAAMolB,EAAQplB,IACzBgoB,OAAQoe,EAAQ7lC,MAAQ6kB,EAAQ7kB,MAChC0nB,OAAQme,EAAQjmC,OAASilB,EAAQjlB,SAG/BkG,EAAMhG,GAAKgG,EAAMpG,IACnB+0C,EAAoB3uC,EAExB,CACF,CAEIwI,IAAUomC,EAAc7vB,UAC1B6vB,EAAc7vB,QAAUvW,EAC1B,GACC,CAAC2wB,EAAU3wB,EAAOhN,EAAMhC,KAC3B,IAAAklB,YAAU,KACJgwB,GACFC,EAAoB,KACtB,GACC,CAACD,IACGA,CACT,CA8G2BG,CAAoB,CAC3C1V,UAAWsV,GACXjmC,QACAhN,OACAhC,SA8BF,OA5BA,IAAAklB,YAAU,KACJkuB,GAAapE,GAASzpB,QAAQ+tB,WAAaA,KAC7CtE,GAASzpB,QAAQ+tB,SAAWA,IAG1BjB,IAAgBrD,GAASzpB,QAAQ8sB,cACnCrD,GAASzpB,QAAQ8sB,YAAcA,GAG7BlB,IAAUnC,GAASzpB,QAAQ4rB,QAC7BnC,GAASzpB,QAAQ4rB,MAAQA,EAC3B,GACC,CAACiC,EAAWE,GAAUjB,EAAalB,KACtC,IAAAjsB,YAAU,KACR,GAAImhB,KAAa2I,GAASzpB,QAAQ8gB,SAChC,OAGF,GAAIA,KAAa2I,GAASzpB,QAAQ8gB,SAEhC,YADA2I,GAASzpB,QAAQ8gB,SAAWA,IAI9B,MAAMrJ,EAAY/gB,YAAW,KAC3B+yB,GAASzpB,QAAQ8gB,SAAWA,EAAQ,GACnC,IACH,MAAO,IAAMzI,aAAaZ,EAAU,GACnC,CAACqJ,KACG,CACLvX,SACAwiB,cACAnD,aACAjd,OACAlxB,OACAgP,QACAskC,YACAnC,QACA1B,SACA2D,YACA9E,aACA3W,YACA31B,OACAuvC,YACAtiB,OACAzI,aACA+nB,sBACAoG,sBACAC,sBACA/0C,UAA+B,MAApBq1C,GAA2BA,GAAmBF,EACzDvB,WAKAyB,IACApC,IAAoB9D,GAASzpB,QAAQ+tB,WAAatkC,EACzC4kC,EAGLkB,KAA6B,QAAgBpS,KAAoB+Q,OAArE,EAIIL,GAAa6B,GACR,KAAI3sB,WAAWtc,SAAS,IAAKynC,EAClClrB,SAAUorB,SAFd,EAQJ,CAiCoB,KAAava,KAAM,KAAaF,MAAO,KAAaG,GAAI,KAAaF,mCC7oBzF,IAAIn6B,EAAe,EAAQ,OACvB8Z,EAAQ,eACRw8B,EAAW,qBACXhyB,EAAW,aAAiCA,SAC5C7W,EAAY,aAAiCA,UAC7CsL,EAAW,kBA6Cf,SAAS9Y,EAAeG,GACtBA,EAAI2Y,EAAS3Y,GACbk2C,EAASl2C,GACT,IAIIgJ,EAJAqL,EAAIzU,EAAaI,GAKrB,IAJAm2C,EAAiB9hC,GACjB+hC,EAAc/hC,EAAGrU,GAGTgJ,EAAIqtC,EAAUhiC,IAEpBiiC,EAAcjiC,EAAGrU,EAAGgJ,EADhButC,EAAUliC,EAAGrU,EAAGgJ,GAGxB,CAKA,SAASotC,EAAc/hC,EAAGrU,GACxB,IAAImO,EAAKd,EAAUgH,EAAGA,EAAE7L,UACxB2F,EAAKA,EAAG5J,MAAM,EAAG4J,EAAGtL,OAAS,IAC1BJ,SAAQE,GAGb,SAAwB0R,EAAGrU,EAAGsO,GAC5B,IACIb,EADW4G,EAAEzR,KAAK0L,GACAb,OACtB4G,EAAEpM,KAAKqG,EAAOb,GAAQ+oC,SAAWC,EAAapiC,EAAGrU,EAAGsO,EACtD,CAPkBooC,CAAeriC,EAAGrU,EAAG2C,IACvC,CAYA,SAAS8zC,EAAapiC,EAAGrU,EAAGsO,GAC1B,IACIb,EADW4G,EAAEzR,KAAK0L,GACAb,OAElBkpC,GAAc,EAEdC,EAAY52C,EAAEiI,KAAKqG,EAAOb,GAE1BopC,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAY52C,EAAEiI,KAAKwF,EAAQa,IAG7BuoC,EAAWD,EAAUr0C,OAErBvC,EAAEuP,UAAUjB,GAAO7L,SAAQuG,IACzB,IAyHsB7E,EAAGxB,EAzHrBm0C,EAAY9tC,EAAErG,IAAM2L,EACtBsiC,EAAQkG,EAAY9tC,EAAEjF,EAAIiF,EAAErG,EAE9B,GAAIiuC,IAAUnjC,EAAQ,CACpB,IAAIspC,EAAeD,IAAcH,EAC/BK,EAAch3C,EAAEiI,KAAKe,GAAGzG,OAG1B,GADAs0C,GAAYE,EAAeC,GAAeA,EAkHtB7yC,EAjHFmK,EAiHK3L,EAjHEiuC,EAAVv8B,EAkHP+N,QAAQje,EAAGxB,GAlHc,CAC/B,IAAIs0C,EAAgB5iC,EAAEpM,KAAKqG,EAAOsiC,GAAO4F,SACzCK,GAAYE,GAAgBE,EAAgBA,CAC9C,CACF,KAGKJ,CACT,CAEA,SAASV,EAAiBxqB,EAAM7lB,GAC1BmR,UAAUpU,OAAS,IACrBiD,EAAO6lB,EAAKnjB,QAAQ,IAEtB0uC,EAAgBvrB,EAAM,CAAC,EAAG,EAAG7lB,EAC/B,CAEA,SAASoxC,EAAgBvrB,EAAMhjB,EAASwuC,EAASx0C,EAAG8K,GAClD,IAAIL,EAAM+pC,EACNn1C,EAAQ2pB,EAAK/oB,KAAKD,GAkBtB,OAhBAgG,EAAQhG,IAAK,EACbgpB,EAAKvK,UAAUze,GAAGF,SAAQsB,IACnB4E,EAAQ7F,eAAeiB,KAC1BozC,EAAUD,EAAgBvrB,EAAMhjB,EAASwuC,EAASpzC,EAAGpB,GACvD,IAGFX,EAAMoL,IAAMA,EACZpL,EAAMmL,IAAMgqC,IACR1pC,EACFzL,EAAMyL,OAASA,SAGRzL,EAAMyL,OAGR0pC,CACT,CAEA,SAASd,EAAU1qB,GACjB,OAAOA,EAAK/f,QAAQ1H,MAAK8E,GAAK2iB,EAAK1jB,KAAKe,GAAGwtC,SAAW,GACxD,CAEA,SAASD,EAAUliC,EAAGrU,EAAGiI,GACvB,IAAItF,EAAIsF,EAAKtF,EACToB,EAAIkE,EAAKlE,EAKR/D,EAAEoiB,QAAQzf,EAAGoB,KAChBpB,EAAIsF,EAAKlE,EACTA,EAAIkE,EAAKtF,GAGX,IAAI0E,EAASgN,EAAEzR,KAAKD,GAChB2E,EAAS+M,EAAEzR,KAAKmB,GAChBqzC,EAAY/vC,EACZgwC,GAAO,EAIPhwC,EAAO8F,IAAM7F,EAAO6F,MACtBiqC,EAAY9vC,EACZ+vC,GAAO,GAGT,IAAIC,EAAat3C,EAAE4L,QAAQgV,QAAO3Y,GACzBovC,IAASE,EAAaljC,EAAGA,EAAEzR,KAAKqF,EAAKtF,GAAIy0C,IACzCC,IAASE,EAAaljC,EAAGA,EAAEzR,KAAKqF,EAAKlE,GAAIqzC,KAGlD,OAAOE,EAAW/zC,QAAO,CAACwF,EAAKd,IACzByR,EAAM1Z,EAAGiI,GAAQyR,EAAM1Z,EAAG+I,GACrBd,EAGFc,GAEX,CAEA,SAASutC,EAAcjiC,EAAGrU,EAAGgJ,EAAG0S,GAC9B,IAAI/Y,EAAIqG,EAAErG,EACNoB,EAAIiF,EAAEjF,EACVsQ,EAAErB,WAAWrQ,EAAGoB,GAChBsQ,EAAE/R,QAAQoZ,EAAE/Y,EAAG+Y,EAAE3X,EAAG,CAAC,GACrBoyC,EAAiB9hC,GACjB+hC,EAAc/hC,EAAGrU,GAInB,SAAqBqU,EAAGrU,GACtB,IAAI8F,EAAOuO,EAAE7L,QAAQtE,MAAKvB,IAAM3C,EAAE4C,KAAKD,GAAG8K,SACtCU,EAAK+V,EAAS7P,EAAGvO,IACrBqI,EAAKA,EAAG5J,MAAM,IACX9B,SAAQE,IACT,IAAI8K,EAAS4G,EAAEzR,KAAKD,GAAG8K,OACrBxF,EAAOjI,EAAEiI,KAAKtF,EAAG8K,GACjB+pC,GAAU,EAEPvvC,IACHA,EAAOjI,EAAEiI,KAAKwF,EAAQ9K,GACtB60C,GAAU,GAGZx3C,EAAE4C,KAAKD,GAAGZ,KAAO/B,EAAE4C,KAAK6K,GAAQ1L,MAAQy1C,EAAUvvC,EAAK0K,QAAU1K,EAAK0K,OAAO,GAEjF,CAnBE8kC,CAAYpjC,EAAGrU,EACjB,CA+BA,SAASu3C,EAAa5rB,EAAMtkB,EAAQqwC,GAClC,OAAOA,EAAUtqC,KAAO/F,EAAO8F,KAAO9F,EAAO8F,KAAOuqC,EAAUvqC,GAChE,CAjOArN,EAAOC,QAAUF,EAGjBA,EAAes2C,iBAAmBA,EAClCt2C,EAAeu2C,cAAgBA,EAC/Bv2C,EAAe42C,aAAeA,EAC9B52C,EAAew2C,UAAYA,EAC3Bx2C,EAAe02C,UAAYA,EAC3B12C,EAAey2C,cAAgBA,aCjB/Bx2C,EAAOC,QAAU,sCCEjB,IAAI0B,EAAO,EAAQ,OAEnB3B,EAAOC,QAaP,SAAmBC,GACjB,IAAI2I,EAAU,CAAC,EACXgvC,EAAc33C,EAAEwI,QAAQoY,QAAOje,IAAM3C,EAAEwC,SAASG,GAAGE,SACnDK,EAAUqD,KAAK2B,OAAOyvC,EAAY7sC,KAAInI,GAAK3C,EAAE4C,KAAKD,GAAGZ,QACrDwW,EAAS9W,EAAK0D,MAAMjC,EAAU,GAAG4H,KAAI,IAAM,KAa/C,OAHgB6sC,EAAYxxC,MAAK,CAACC,EAAGC,IAAMrG,EAAE4C,KAAKwD,GAAGrE,KAAO/B,EAAE4C,KAAKyD,GAAGtE,OAC5DU,SATV,SAASC,EAAIC,GACX,GAAIgG,EAAQhG,GAAI,OAChBgG,EAAQhG,IAAK,EACb,IAAIC,EAAO5C,EAAE4C,KAAKD,GAClB4V,EAAO3V,EAAKb,MAAM6G,KAAKjG,GACvB3C,EAAEsJ,WAAW3G,GAAGF,QAAQC,EAC1B,IAKO6V,CACT,gCCjCA,IAAI9W,EAAO,EAAQ,OACfsJ,EAAY,kBAEhBjL,EAAOC,QAEP,SAAkBC,IAOlB,SAAmBA,GACjB,IAAIqD,EAAW5B,EAAKwJ,iBAAiBjL,GACjC43C,EAAU53C,EAAEC,QAAQyS,QACpBmlC,EAAQ,EACZx0C,EAASZ,SAAQgB,IACf,MAAMq0C,EAAYr0C,EAAMF,QAAO,CAACwF,EAAKpG,KACnC,MAAMzB,EAASlB,EAAE4C,KAAKD,GAAGzB,OACzB,OAAI6H,EAAM7H,EACD6H,EAEA7H,CACT,GACC,GACHuC,EAAMhB,SAAQE,GAAK3C,EAAE4C,KAAKD,GAAG3B,EAAI62C,EAAQC,EAAY,IACrDD,GAASC,EAAYF,CAAO,GAEhC,EApBEG,CAFA/3C,EAAIyB,EAAK0R,mBAAmBnT,IAG5BuJ,OAAOO,QAAQiB,EAAU/K,IAAIyC,SAAQ,EAAEE,EAAGvB,KAAOpB,EAAE4C,KAAKD,GAAGvB,EAAIA,GACjE","sources":["webpack:///../../node_modules/@dagrejs/dagre/lib/rank/index.js","webpack:///../../node_modules/@dnd-kit/modifiers/dist/modifiers.esm.js","webpack:///../../node_modules/@dagrejs/dagre/lib/add-border-segments.js","webpack:///../../node_modules/@dagrejs/dagre/lib/position/bk.js","webpack:///../../node_modules/@dagrejs/dagre/lib/debug.js","webpack:///../../node_modules/@dagrejs/dagre/lib/data/list.js","webpack:///../../node_modules/@dagrejs/dagre/lib/parent-dummy-chains.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/add-subgraph-constraints.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/prim.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/data/priority-queue.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/build-layer-graph.js","webpack:///../../node_modules/@dagrejs/dagre/lib/layout.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/is-acyclic.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/tarjan.js","webpack:///../../node_modules/@dagrejs/graphlib/index.js","webpack:///../../node_modules/@dagrejs/dagre/lib/util.js","webpack:///../../node_modules/@dagrejs/dagre/lib/rank/feasible-tree.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/preorder.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/dijkstra.js","webpack:///../../node_modules/file-saver/dist/FileSaver.min.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/sort.js","webpack:///../../node_modules/@dagrejs/dagre/lib/coordinate-system.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/graph.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/version.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/topsort.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/resolve-conflicts.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/dijkstra-all.js","webpack:///../../node_modules/@dagrejs/dagre/lib/rank/util.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/dfs.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/index.js","webpack:///../../node_modules/@dnd-kit/utilities/dist/utilities.esm.js","webpack:///../../node_modules/@dagrejs/dagre/index.js","webpack:///../../node_modules/@dagrejs/dagre/lib/nesting-graph.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/json.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/index.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/components.js","webpack:///../../node_modules/@dagrejs/dagre/lib/acyclic.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/postorder.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/cross-count.js","webpack:///../../node_modules/@dagrejs/dagre/lib/normalize.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/barycenter.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/index.js","webpack:///../../node_modules/@dagrejs/dagre/lib/greedy-fas.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/find-cycles.js","webpack:///../../node_modules/@dnd-kit/accessibility/dist/accessibility.esm.js","webpack:///../../node_modules/@dnd-kit/core/dist/core.esm.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/sort-subgraph.js","webpack:///../../node_modules/@dagrejs/graphlib/lib/alg/floyd-warshall.js","webpack:///../../node_modules/@next-api-sdk/cmdb-sdk/dist/esm/api/cmdb/cmdb_object/getObjectRef.js","webpack:///../../node_modules/@dnd-kit/sortable/dist/sortable.esm.js","webpack:///../../node_modules/@dagrejs/dagre/lib/rank/network-simplex.js","webpack:///../../node_modules/@dagrejs/dagre/lib/version.js","webpack:///../../node_modules/@dagrejs/dagre/lib/order/init-order.js","webpack:///../../node_modules/@dagrejs/dagre/lib/position/index.js"],"sourcesContent":["\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = 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\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  default: 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 { getEventCoordinates } from '@dnd-kit/utilities';\n\nfunction createSnapModifier(gridSize) {\n  return _ref => {\n    let {\n      transform\n    } = _ref;\n    return { ...transform,\n      x: Math.ceil(transform.x / gridSize) * gridSize,\n      y: Math.ceil(transform.y / gridSize) * gridSize\n    };\n  };\n}\n\nconst restrictToHorizontalAxis = _ref => {\n  let {\n    transform\n  } = _ref;\n  return { ...transform,\n    y: 0\n  };\n};\n\nfunction restrictToBoundingRect(transform, rect, boundingRect) {\n  const value = { ...transform\n  };\n\n  if (rect.top + transform.y <= boundingRect.top) {\n    value.y = boundingRect.top - rect.top;\n  } else if (rect.bottom + transform.y >= boundingRect.top + boundingRect.height) {\n    value.y = boundingRect.top + boundingRect.height - rect.bottom;\n  }\n\n  if (rect.left + transform.x <= boundingRect.left) {\n    value.x = boundingRect.left - rect.left;\n  } else if (rect.right + transform.x >= boundingRect.left + boundingRect.width) {\n    value.x = boundingRect.left + boundingRect.width - rect.right;\n  }\n\n  return value;\n}\n\nconst restrictToParentElement = _ref => {\n  let {\n    containerNodeRect,\n    draggingNodeRect,\n    transform\n  } = _ref;\n\n  if (!draggingNodeRect || !containerNodeRect) {\n    return transform;\n  }\n\n  return restrictToBoundingRect(transform, draggingNodeRect, containerNodeRect);\n};\n\nconst restrictToFirstScrollableAncestor = _ref => {\n  let {\n    draggingNodeRect,\n    transform,\n    scrollableAncestorRects\n  } = _ref;\n  const firstScrollableAncestorRect = scrollableAncestorRects[0];\n\n  if (!draggingNodeRect || !firstScrollableAncestorRect) {\n    return transform;\n  }\n\n  return restrictToBoundingRect(transform, draggingNodeRect, firstScrollableAncestorRect);\n};\n\nconst restrictToVerticalAxis = _ref => {\n  let {\n    transform\n  } = _ref;\n  return { ...transform,\n    x: 0\n  };\n};\n\nconst restrictToWindowEdges = _ref => {\n  let {\n    transform,\n    draggingNodeRect,\n    windowRect\n  } = _ref;\n\n  if (!draggingNodeRect || !windowRect) {\n    return transform;\n  }\n\n  return restrictToBoundingRect(transform, draggingNodeRect, windowRect);\n};\n\nconst snapCenterToCursor = _ref => {\n  let {\n    activatorEvent,\n    draggingNodeRect,\n    transform\n  } = _ref;\n\n  if (draggingNodeRect && activatorEvent) {\n    const activatorCoordinates = getEventCoordinates(activatorEvent);\n\n    if (!activatorCoordinates) {\n      return transform;\n    }\n\n    const offsetX = activatorCoordinates.x - draggingNodeRect.left;\n    const offsetY = activatorCoordinates.y - draggingNodeRect.top;\n    return { ...transform,\n      x: transform.x + offsetX - draggingNodeRect.width / 2,\n      y: transform.y + offsetY - draggingNodeRect.height / 2\n    };\n  }\n\n  return transform;\n};\n\nexport { createSnapModifier, restrictToFirstScrollableAncestor, restrictToHorizontalAxis, restrictToParentElement, restrictToVerticalAxis, restrictToWindowEdges, snapCenterToCursor };\n//# sourceMappingURL=modifiers.esm.js.map\n","let util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    let children = g.children(v);\n    let node = g.node(v);\n    if (children.length) {\n      children.forEach(dfs);\n    }\n\n    if (node.hasOwnProperty(\"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (let rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  g.children().forEach(dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  let label = { width: 0, height: 0, rank: rank, borderType: prop };\n  let prev = sgNode[prop][rank - 1];\n  let 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","\"use strict\";\n\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: 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  let conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    let\n      // 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 = layer[layer.length - 1];\n\n    layer.forEach((v, i) => {\n      let w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        layer.slice(scanPos, i+1).forEach(scanNode => {\n          g.predecessors(scanNode).forEach(u => {\n            let uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  layering.length && layering.reduce(visitLayer);\n\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  let conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    let v;\n    util.range(southPos, southEnd).forEach(i => {\n      v = south[i];\n      if (g.node(v).dummy) {\n        g.predecessors(v).forEach(u => {\n          let uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    let prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    south.forEach((v, southLookahead) => {\n      if (g.node(v).dummy === \"border\") {\n        let predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\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  layering.length && layering.reduce(visitLayer);\n\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return g.predecessors(v).find(u => g.node(u).dummy);\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    let tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  let 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    let tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return !!conflicts[v] && conflicts[v].hasOwnProperty(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  let 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  layering.forEach(layer => {\n    layer.forEach((v, order) => {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  layering.forEach(layer => {\n    let prevIdx = -1;\n    layer.forEach(v => {\n      let ws = neighborFn(v);\n      if (ws.length) {\n        ws = ws.sort((a, b) => pos[a] - pos[b]);\n        let mp = (ws.length - 1) / 2;\n        for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          let w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !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  let xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    let stack = blockG.nodes();\n    let elem = stack.pop();\n    let 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((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    let min = blockG.outEdges(elem).reduce((acc, e) => {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    let 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  Object.keys(align).forEach(v => xs[v] = xs[root[v]]);\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  let blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  layering.forEach(layer => {\n    let u;\n    layer.forEach(v => {\n      let 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 Object.values(xss).reduce((currentMinAndXs, xs) => {\n    let max = Number.NEGATIVE_INFINITY;\n    let min = Number.POSITIVE_INFINITY;\n\n    Object.entries(xs).forEach(([v, x]) => {\n      let halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    const newMin = max - min;\n    if (newMin < currentMinAndXs[0]) {\n      currentMinAndXs = [newMin, xs];\n    }\n    return currentMinAndXs;\n  }, [Number.POSITIVE_INFINITY, null])[1];\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  let alignToVals = Object.values(alignTo),\n    alignToMin = Math.min(...alignToVals),\n    alignToMax = Math.max(...alignToVals);\n\n  [\"u\", \"d\"].forEach(vert => {\n    [\"l\", \"r\"].forEach(horiz => {\n      let alignment = vert + horiz,\n        xs = xss[alignment];\n\n      if (xs === alignTo) return;\n\n      let xsVals = Object.values(xs);\n      let delta = alignToMin - Math.min(...xsVals);\n      if (horiz !== \"l\") {\n        delta = alignToMax - Math.max(...xsVals);\n      }\n\n      if (delta) {\n        xss[alignment] = util.mapValues(xs, x => x + delta);\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return util.mapValues(xss.ul, (num, v) => {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      let xs = Object.values(xss).map(xs => xs[v]).sort((a, b) => a - b);\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  let layering = util.buildLayerMatrix(g);\n  let conflicts = Object.assign(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  let xss = {};\n  let adjustedLayering;\n  [\"u\", \"d\"].forEach(vert => {\n    adjustedLayering = vert === \"u\" ? layering : Object.values(layering).reverse();\n    [\"l\", \"r\"].forEach(horiz => {\n      if (horiz === \"r\") {\n        adjustedLayering = adjustedLayering.map(inner => {\n          return Object.values(inner).reverse();\n        });\n      }\n\n      let neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      let align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      let xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = util.mapValues(xs, x => -x);\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n\n  let smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return (g, v, w) => {\n    let vLabel = g.node(v);\n    let wLabel = g.node(w);\n    let sum = 0;\n    let delta;\n\n    sum += vLabel.width / 2;\n    if (vLabel.hasOwnProperty(\"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; 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 (wLabel.hasOwnProperty(\"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; 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","let util = require(\"./util\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  let layerMatrix = util.buildLayerMatrix(g);\n\n  let h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  g.nodes().forEach(v => {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  g.edges().forEach(e => h.setEdge(e.v, e.w, {}, e.name));\n\n  layerMatrix.forEach((layer, i) => {\n    let layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    layer.reduce((u, v) => {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n","/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nclass List {\n  constructor() {\n    let sentinel = {};\n    sentinel._next = sentinel._prev = sentinel;\n    this._sentinel = sentinel;\n  }\n\n  dequeue() {\n    let sentinel = this._sentinel;\n    let entry = sentinel._prev;\n    if (entry !== sentinel) {\n      unlink(entry);\n      return entry;\n    }\n  }\n\n  enqueue(entry) {\n    let 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\n  toString() {\n    let strs = [];\n    let sentinel = this._sentinel;\n    let 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\nmodule.exports = List;\n","module.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  let postorderNums = postorder(g);\n\n  g.graph().dummyChains.forEach(v => {\n    let node = g.node(v);\n    let edgeObj = node.edgeObj;\n    let pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    let path = pathData.path;\n    let lca = pathData.lca;\n    let pathIdx = 0;\n    let pathV = path[pathIdx];\n    let ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               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 (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\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  let vPath = [];\n  let wPath = [];\n  let low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  let lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  let parent;\n  let 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 &&\n           (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  let result = {};\n  let lim = 0;\n\n  function dfs(v) {\n    let low = lim;\n    g.children(v).forEach(dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  g.children().forEach(dfs);\n\n  return result;\n}\n","module.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  let prev = {},\n    rootPrev;\n\n  vs.forEach(v => {\n    let 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      children.forEach(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      _.sortBy(subgraphs, \"order\").reduce(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","var Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = 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  g.nodes().forEach(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 (parents.hasOwnProperty(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","/**\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  _arr = [];\n  _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  /**\n   * Returns the keys that are in the queue. Takes `O(n)` time.\n   */\n  keys() {\n    return this._arr.map(function(x) { 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 this._keyIndices.hasOwnProperty(key);\n  }\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  /**\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  /**\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 (!keyIndices.hasOwnProperty(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  /**\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  /**\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(\"New priority is greater than current priority. \" +\n          \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n    }\n    this._arr[index].priority = priority;\n    this._decrease(index);\n  }\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\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\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\nmodule.exports = PriorityQueue;\n","let Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\nmodule.exports = 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  let root = createRootNode(g),\n    result = new Graph({ compound: true }).setGraph({ root: root })\n      .setDefaultNodeLabel(v => g.node(v));\n\n  g.nodes().forEach(v => {\n    let 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      g[relationship](v).forEach(e => {\n        let u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = edge !== undefined ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (node.hasOwnProperty(\"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 = util.uniqueId(\"_root\"))));\n  return v;\n}\n","\"use strict\";\n\nlet acyclic = require(\"./acyclic\");\nlet normalize = require(\"./normalize\");\nlet rank = require(\"./rank\");\nlet normalizeRanks = require(\"./util\").normalizeRanks;\nlet parentDummyChains = require(\"./parent-dummy-chains\");\nlet removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nlet nestingGraph = require(\"./nesting-graph\");\nlet addBorderSegments = require(\"./add-border-segments\");\nlet coordinateSystem = require(\"./coordinate-system\");\nlet order = require(\"./order\");\nlet position = require(\"./position\");\nlet util = require(\"./util\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  let time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", () => {\n    let layoutGraph =\n      time(\"  buildLayoutGraph\", () => buildLayoutGraph(g));\n    time(\"  runLayout\",        () => runLayout(layoutGraph, time, opts));\n    time(\"  updateInputGraph\", () => updateInputGraph(g, layoutGraph));\n  });\n}\n\nfunction runLayout(g, time, opts) {\n  time(\"    makeSpaceForEdgeLabels\", () => makeSpaceForEdgeLabels(g));\n  time(\"    removeSelfEdges\",        () => removeSelfEdges(g));\n  time(\"    acyclic\",                () => acyclic.run(g));\n  time(\"    nestingGraph.run\",       () => nestingGraph.run(g));\n  time(\"    rank\",                   () => rank(util.asNonCompoundGraph(g)));\n  time(\"    injectEdgeLabelProxies\", () => injectEdgeLabelProxies(g));\n  time(\"    removeEmptyRanks\",       () => removeEmptyRanks(g));\n  time(\"    nestingGraph.cleanup\",   () => nestingGraph.cleanup(g));\n  time(\"    normalizeRanks\",         () => normalizeRanks(g));\n  time(\"    assignRankMinMax\",       () => assignRankMinMax(g));\n  time(\"    removeEdgeLabelProxies\", () => removeEdgeLabelProxies(g));\n  time(\"    normalize.run\",          () => normalize.run(g));\n  time(\"    parentDummyChains\",      () => parentDummyChains(g));\n  time(\"    addBorderSegments\",      () => addBorderSegments(g));\n  time(\"    order\",                  () => order(g, opts));\n  time(\"    insertSelfEdges\",        () => insertSelfEdges(g));\n  time(\"    adjustCoordinateSystem\", () => coordinateSystem.adjust(g));\n  time(\"    position\",               () => position(g));\n  time(\"    positionSelfEdges\",      () => positionSelfEdges(g));\n  time(\"    removeBorderNodes\",      () => removeBorderNodes(g));\n  time(\"    normalize.undo\",         () => normalize.undo(g));\n  time(\"    fixupEdgeLabelCoords\",   () => fixupEdgeLabelCoords(g));\n  time(\"    undoCoordinateSystem\",   () => coordinateSystem.undo(g));\n  time(\"    translateGraph\",         () => translateGraph(g));\n  time(\"    assignNodeIntersects\",   () => assignNodeIntersects(g));\n  time(\"    reversePoints\",          () => reversePointsForReversedEdges(g));\n  time(\"    acyclic.undo\",           () => acyclic.undo(g));\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  inputGraph.nodes().forEach(v => {\n    let inputLabel = inputGraph.node(v);\n    let layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n      inputLabel.rank = layoutLabel.rank;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  inputGraph.edges().forEach(e => {\n    let inputLabel = inputGraph.edge(e);\n    let layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (layoutLabel.hasOwnProperty(\"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\nlet graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nlet graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nlet graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nlet nodeNumAttrs = [\"width\", \"height\"];\nlet nodeDefaults = { width: 0, height: 0 };\nlet edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nlet edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nlet 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  let g = new Graph({ multigraph: true, compound: true });\n  let graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(Object.assign({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    util.pick(graph, graphAttrs)));\n\n  inputGraph.nodes().forEach(v => {\n    let node = canonicalize(inputGraph.node(v));\n    const newNode = selectNumberAttrs(node, nodeNumAttrs);\n    Object.keys(nodeDefaults).forEach(k => {\n      if (newNode[k] === undefined) {\n        newNode[k] = nodeDefaults[k];\n      }\n    });\n\n    g.setNode(v, newNode);\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  inputGraph.edges().forEach(e => {\n    let edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, Object.assign({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      util.pick(edge, edgeAttrs)));\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  let graph = g.graph();\n  graph.ranksep /= 2;\n  g.edges().forEach(e => {\n    let 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  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.width && edge.height) {\n      let v = g.node(e.v);\n      let w = g.node(e.w);\n      let 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  let maxRank = 0;\n  g.nodes().forEach(v => {\n    let 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      maxRank = Math.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  g.nodes().forEach(v => {\n    let 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  let minX = Number.POSITIVE_INFINITY;\n  let maxX = 0;\n  let minY = Number.POSITIVE_INFINITY;\n  let maxY = 0;\n  let graphLabel = g.graph();\n  let marginX = graphLabel.marginx || 0;\n  let marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    let x = attrs.x;\n    let y = attrs.y;\n    let w = attrs.width;\n    let 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  g.nodes().forEach(v => getExtremes(g.node(v)));\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.hasOwnProperty(\"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(p => {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (edge.hasOwnProperty(\"x\")) { edge.x -= minX; }\n    if (edge.hasOwnProperty(\"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    let nodeV = g.node(e.v);\n    let nodeW = g.node(e.w);\n    let 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  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.hasOwnProperty(\"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  g.nodes().forEach(v => {\n    if (g.children(v).length) {\n      let node = g.node(v);\n      let t = g.node(node.borderTop);\n      let b = g.node(node.borderBottom);\n      let l = g.node(node.borderLeft[node.borderLeft.length - 1]);\n      let r = g.node(node.borderRight[node.borderRight.length - 1]);\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  g.nodes().forEach(v => {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  g.edges().forEach(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  layers.forEach(layer => {\n    var orderShift = 0;\n    layer.forEach((v, i) => {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      (node.selfEdges || []).forEach(selfEdge => {\n        util.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}\n\nfunction positionSelfEdges(g) {\n  g.nodes().forEach(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 util.mapValues(util.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  if (attrs) {\n    Object.entries(attrs).forEach(([k, v]) => {\n      if (typeof k === \"string\") {\n        k = k.toLowerCase();\n      }\n\n      newAttrs[k] = v;\n    });\n  }\n  return newAttrs;\n}\n","var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n  try {\n    topsort(g);\n  } catch (e) {\n    if (e instanceof topsort.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n","module.exports = 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 (!visited.hasOwnProperty(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 (!visited.hasOwnProperty(v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n","/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n  Graph: lib.Graph,\n  json: require(\"./lib/json\"),\n  alg: require(\"./lib/alg\"),\n  version: lib.version\n};\n","/* eslint \"no-console\": off */\n\n\"use strict\";\n\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\n\nmodule.exports = {\n  addBorderNode,\n  addDummyNode,\n  asNonCompoundGraph,\n  buildLayerMatrix,\n  intersectRect,\n  mapValues,\n  maxRank,\n  normalizeRanks,\n  notime,\n  partition,\n  pick,\n  predecessorWeights,\n  range,\n  removeEmptyRanks,\n  simplify,\n  successorWeights,\n  time,\n  uniqueId,\n  zipObject,\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  let 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  let simplified = new Graph().setGraph(g.graph());\n  g.nodes().forEach(v => simplified.setNode(v, g.node(v)));\n  g.edges().forEach(e => {\n    let simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    let 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  let simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  g.nodes().forEach(v => {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  g.edges().forEach(e => {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  let weightMap = g.nodes().map(v => {\n    let sucs = {};\n    g.outEdges(v).forEach(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  let weightMap = g.nodes().map(v => {\n    let preds = {};\n    g.inEdges(v).forEach(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  let x = rect.x;\n  let y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  let dx = point.x - x;\n  let dy = point.y - y;\n  let w = rect.width / 2;\n  let 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  let 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  let layering = range(maxRank(g) + 1).map(() => []);\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    let rank = node.rank;\n    if (rank !== undefined) {\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  let min = Math.min(...g.nodes().map(v => {\n    let rank = g.node(v).rank;\n    if (rank === undefined) {\n      return Number.MAX_VALUE;\n    }\n\n    return rank;\n  }));\n  g.nodes().forEach(v => {\n    let node = g.node(v);\n    if (node.hasOwnProperty(\"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  let offset = Math.min(...g.nodes().map(v => g.node(v).rank));\n\n  let layers = [];\n  g.nodes().forEach(v => {\n    let rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  let delta = 0;\n  let nodeRankFactor = g.graph().nodeRankFactor;\n  Array.from(layers).forEach((vs, i) => {\n    if (vs === undefined && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (vs !== undefined && delta) {\n      vs.forEach(v => g.node(v).rank += delta);\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  let 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 Math.max(...g.nodes().map(v => {\n    let rank = g.node(v).rank;\n    if (rank === undefined) {\n      return Number.MIN_VALUE;\n    }\n\n    return rank;\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  let result = { lhs: [], rhs: [] };\n  collection.forEach(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  let start = Date.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (Date.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n\nlet idCounter = 0;\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return toString(prefix) + id;\n}\n\nfunction range(start, limit, step = 1) {\n  if (limit == null) {\n    limit = start;\n    start = 0;\n  }\n\n  let endCon = (i) => i < limit;\n  if (step < 0) {\n    endCon = (i) => limit < i;\n  }\n\n  const range = [];\n  for (let i = start; endCon(i); i += step) {\n    range.push(i);\n  }\n\n  return range;\n}\n\nfunction pick(source, keys) {\n  const dest = {};\n  for (const key of keys) {\n    if (source[key] !== undefined) {\n      dest[key] = source[key];\n    }\n  }\n\n  return dest;\n}\n\nfunction mapValues(obj, funcOrProp) {\n  let func = funcOrProp;\n  if (typeof funcOrProp === 'string') {\n    func = (val) => val[funcOrProp];\n  }\n\n  return Object.entries(obj).reduce((acc, [k, v]) => {\n    acc[k] = func(v, k);\n    return acc;\n  }, {});\n}\n\nfunction zipObject(props, values) {\n  return props.reduce((acc, key, i) => {\n    acc[key] = values[i];\n    return acc;\n  }, {});\n}\n","\"use strict\";\n\nvar Graph = require(\"@dagrejs/graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = 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    g.nodeEdges(v).forEach(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  t.nodes().forEach(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  const edges = g.edges();\n\n  return edges.reduce((acc, edge) => {\n    let edgeSlack = Number.POSITIVE_INFINITY;\n    if (t.hasNode(edge.v) !== t.hasNode(edge.w)) {\n      edgeSlack = slack(g, edge);\n    }\n\n    if (edgeSlack < acc[0]) {\n      return [edgeSlack, edge];\n    }\n\n    return acc;\n  }, [Number.POSITIVE_INFINITY, null])[1];\n}\n\nfunction shiftRanks(t, g, delta) {\n  t.nodes().forEach(v => g.node(v).rank += delta);\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, \"pre\");\n}\n","var PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = () => 1;\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(g, String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\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(\"dijkstra does not allow negative edge weights. \" +\n                      \"Bad edge: \" + edge + \" Weight: \" + weight);\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","(function(a,b){if(\"function\"==typeof define&&define.amd)define([],b);else if(\"undefined\"!=typeof exports)b();else{b(),a.FileSaver={exports:{}}.exports}})(this,function(){\"use strict\";function b(a,b){return\"undefined\"==typeof b?b={autoBom:!1}:\"object\"!=typeof b&&(console.warn(\"Deprecated: Expected third argument to be a object\"),b={autoBom:!b}),b.autoBom&&/^\\s*(?:text\\/\\S*|application\\/xml|\\S*\\/\\S*\\+xml)\\s*;.*charset\\s*=\\s*utf-8/i.test(a.type)?new Blob([\"\\uFEFF\",a],{type:a.type}):a}function c(a,b,c){var d=new XMLHttpRequest;d.open(\"GET\",a),d.responseType=\"blob\",d.onload=function(){g(d.response,b,c)},d.onerror=function(){console.error(\"could not download file\")},d.send()}function d(a){var b=new XMLHttpRequest;b.open(\"HEAD\",a,!1);try{b.send()}catch(a){}return 200<=b.status&&299>=b.status}function e(a){try{a.dispatchEvent(new MouseEvent(\"click\"))}catch(c){var b=document.createEvent(\"MouseEvents\");b.initMouseEvent(\"click\",!0,!0,window,0,0,0,80,20,!1,!1,!1,!1,0,null),a.dispatchEvent(b)}}var f=\"object\"==typeof window&&window.window===window?window:\"object\"==typeof self&&self.self===self?self:\"object\"==typeof global&&global.global===global?global:void 0,a=f.navigator&&/Macintosh/.test(navigator.userAgent)&&/AppleWebKit/.test(navigator.userAgent)&&!/Safari/.test(navigator.userAgent),g=f.saveAs||(\"object\"!=typeof window||window!==f?function(){}:\"download\"in HTMLAnchorElement.prototype&&!a?function(b,g,h){var i=f.URL||f.webkitURL,j=document.createElement(\"a\");g=g||b.name||\"download\",j.download=g,j.rel=\"noopener\",\"string\"==typeof b?(j.href=b,j.origin===location.origin?e(j):d(j.href)?c(b,g,h):e(j,j.target=\"_blank\")):(j.href=i.createObjectURL(b),setTimeout(function(){i.revokeObjectURL(j.href)},4E4),setTimeout(function(){e(j)},0))}:\"msSaveOrOpenBlob\"in navigator?function(f,g,h){if(g=g||f.name||\"download\",\"string\"!=typeof f)navigator.msSaveOrOpenBlob(b(f,h),g);else if(d(f))c(f,g,h);else{var i=document.createElement(\"a\");i.href=f,i.target=\"_blank\",setTimeout(function(){e(i)})}}:function(b,d,e,g){if(g=g||open(\"\",\"_blank\"),g&&(g.document.title=g.document.body.innerText=\"downloading...\"),\"string\"==typeof b)return c(b,d,e);var h=\"application/octet-stream\"===b.type,i=/constructor/i.test(f.HTMLElement)||f.safari,j=/CriOS\\/[\\d]+/.test(navigator.userAgent);if((j||h&&i||a)&&\"undefined\"!=typeof FileReader){var k=new FileReader;k.onloadend=function(){var a=k.result;a=j?a:a.replace(/^data:[^;]*;/,\"data:attachment/file;\"),g?g.location.href=a:location=a,g=null},k.readAsDataURL(b)}else{var l=f.URL||f.webkitURL,m=l.createObjectURL(b);g?g.location=m:location.href=m,g=null,setTimeout(function(){l.revokeObjectURL(m)},4E4)}});f.saveAs=g.saveAs=g,\"undefined\"!=typeof module&&(module.exports=g)});\n\n//# sourceMappingURL=FileSaver.min.js.map","let util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  let parts = util.partition(entries, entry => {\n    return entry.hasOwnProperty(\"barycenter\");\n  });\n  let sortable = parts.lhs,\n    unsortable = parts.rhs.sort((a, b) => b.i - a.i),\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  sortable.forEach(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  let result = { vs: vs.flat(true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  let last;\n  while (unsortable.length && (last = unsortable[unsortable.length - 1]).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return (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","\"use strict\";\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  let rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  let 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  g.nodes().forEach(v => swapWidthHeightOne(g.node(v)));\n  g.edges().forEach(e => swapWidthHeightOne(g.edge(e)));\n}\n\nfunction swapWidthHeightOne(attrs) {\n  let w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  g.nodes().forEach(v => reverseYOne(g.node(v)));\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(reverseYOne);\n    if (edge.hasOwnProperty(\"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  g.nodes().forEach(v => swapXYOne(g.node(v)));\n\n  g.edges().forEach(e => {\n    let edge = g.edge(e);\n    edge.points.forEach(swapXYOne);\n    if (edge.hasOwnProperty(\"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  let x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n","\"use strict\";\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nclass Graph {\n  _isDirected = true;\n  _isMultigraph = false;\n  _isCompound = false;\n\n  // Label for the graph itself\n  _label;\n\n  // Defaults to be set when creating a new node\n  _defaultNodeLabelFn = () => undefined;\n\n  // Defaults to be set when creating a new edge\n  _defaultEdgeLabelFn = () => undefined;\n\n  // v -> label\n  _nodes = {};\n\n  // v -> edgeObj\n  _in = {};\n\n  // u -> v -> Number\n  _preds = {};\n\n  // v -> edgeObj\n  _out = {};\n\n  // v -> w -> Number\n  _sucs = {};\n\n  // e -> edgeObj\n  _edgeObjs = {};\n\n  // e -> label\n  _edgeLabels = {};\n\n  /* Number of nodes in the graph. Should only be changed by the implementation. */\n  _nodeCount = 0;\n\n  /* Number of edges in the graph. Should only be changed by the implementation. */\n  _edgeCount = 0;\n\n  _parent;\n\n  _children;\n\n  constructor(opts) {\n    if (opts) {\n      this._isDirected = opts.hasOwnProperty(\"directed\") ? opts.directed : true;\n      this._isMultigraph = opts.hasOwnProperty(\"multigraph\") ? opts.multigraph : false;\n      this._isCompound = opts.hasOwnProperty(\"compound\") ? opts.compound : false;\n    }\n\n    if (this._isCompound) {\n      // v -> parent\n      this._parent = {};\n\n      // v -> children\n      this._children = {};\n      this._children[GRAPH_NODE] = {};\n    }\n  }\n\n  /* === Graph functions ========= */\n\n  /**\n   * Whether graph was created with 'directed' flag set to true or not.\n   */\n  isDirected() {\n    return this._isDirected;\n  }\n\n  /**\n   * Whether graph was created with 'multigraph' flag set to true or not.\n   */\n  isMultigraph() {\n    return this._isMultigraph;\n  }\n\n  /**\n   * Whether graph was created with 'compound' flag set to true or not.\n   */\n  isCompound() {\n    return this._isCompound;\n  }\n\n  /**\n   * Sets the label of the graph.\n   */\n  setGraph(label) {\n    this._label = label;\n    return this;\n  }\n\n  /**\n   * Gets the graph label.\n   */\n  graph() {\n    return this._label;\n  }\n\n\n  /* === Node functions ========== */\n\n  /**\n   * Sets the default node label. If newDefault is a function, it will be\n   * invoked ach time when setting a label for a node. Otherwise, this label\n   * will be assigned as default label in case if no label was specified while\n   * setting a node.\n   * Complexity: O(1).\n   */\n  setDefaultNodeLabel(newDefault) {\n    this._defaultNodeLabelFn = newDefault;\n    if (typeof newDefault !== 'function') {\n      this._defaultNodeLabelFn = () => newDefault;\n    }\n\n    return this;\n  }\n\n  /**\n   * Gets the number of nodes in the graph.\n   * Complexity: O(1).\n   */\n  nodeCount() {\n    return this._nodeCount;\n  }\n\n  /**\n   * Gets all nodes of the graph. Note, the in case of compound graph subnodes are\n   * not included in list.\n   * Complexity: O(1).\n   */\n  nodes() {\n    return Object.keys(this._nodes);\n  }\n\n  /**\n   * Gets list of nodes without in-edges.\n   * Complexity: O(|V|).\n   */\n  sources() {\n    var self = this;\n    return this.nodes().filter(v => Object.keys(self._in[v]).length === 0);\n  }\n\n  /**\n   * Gets list of nodes without out-edges.\n   * Complexity: O(|V|).\n   */\n  sinks() {\n    var self = this;\n    return this.nodes().filter(v => Object.keys(self._out[v]).length === 0);\n  }\n\n  /**\n   * Invokes setNode method for each node in names list.\n   * Complexity: O(|names|).\n   */\n  setNodes(vs, value) {\n    var args = arguments;\n    var self = this;\n    vs.forEach(function(v) {\n      if (args.length > 1) {\n        self.setNode(v, value);\n      } else {\n        self.setNode(v);\n      }\n    });\n    return this;\n  }\n\n  /**\n   * Creates or updates the value for the node v in the graph. If label is supplied\n   * it is set as the value for the node. If label is not supplied and the node was\n   * created by this call then the default node label will be assigned.\n   * Complexity: O(1).\n   */\n  setNode(v, value) {\n    if (this._nodes.hasOwnProperty(v)) {\n      if (arguments.length > 1) {\n        this._nodes[v] = value;\n      }\n      return this;\n    }\n\n    this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n    if (this._isCompound) {\n      this._parent[v] = GRAPH_NODE;\n      this._children[v] = {};\n      this._children[GRAPH_NODE][v] = true;\n    }\n    this._in[v] = {};\n    this._preds[v] = {};\n    this._out[v] = {};\n    this._sucs[v] = {};\n    ++this._nodeCount;\n    return this;\n  }\n\n  /**\n   * Gets the label of node with specified name.\n   * Complexity: O(|V|).\n   */\n  node(v) {\n    return this._nodes[v];\n  }\n\n  /**\n   * Detects whether graph has a node with specified name or not.\n   */\n  hasNode(v) {\n    return this._nodes.hasOwnProperty(v);\n  }\n\n  /**\n   * Remove the node with the name from the graph or do nothing if the node is not in\n   * the graph. If the node was removed this function also removes any incident\n   * edges.\n   * Complexity: O(1).\n   */\n  removeNode(v) {\n    var self = this;\n    if (this._nodes.hasOwnProperty(v)) {\n      var removeEdge = e => self.removeEdge(self._edgeObjs[e]);\n      delete this._nodes[v];\n      if (this._isCompound) {\n        this._removeFromParentsChildList(v);\n        delete this._parent[v];\n        this.children(v).forEach(function(child) {\n          self.setParent(child);\n        });\n        delete this._children[v];\n      }\n      Object.keys(this._in[v]).forEach(removeEdge);\n      delete this._in[v];\n      delete this._preds[v];\n      Object.keys(this._out[v]).forEach(removeEdge);\n      delete this._out[v];\n      delete this._sucs[v];\n      --this._nodeCount;\n    }\n    return this;\n  }\n\n  /**\n   * Sets node p as a parent for node v if it is defined, or removes the\n   * parent for v if p is undefined. Method throws an exception in case of\n   * invoking it in context of noncompound graph.\n   * Average-case complexity: O(1).\n   */\n  setParent(v, parent) {\n    if (!this._isCompound) {\n      throw new Error(\"Cannot set parent in a non-compound graph\");\n    }\n\n    if (parent === undefined) {\n      parent = GRAPH_NODE;\n    } else {\n      // Coerce parent to string\n      parent += \"\";\n      for (var ancestor = parent; ancestor !== undefined; ancestor = this.parent(ancestor)) {\n        if (ancestor === v) {\n          throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n              \" would create a cycle\");\n        }\n      }\n\n      this.setNode(parent);\n    }\n\n    this.setNode(v);\n    this._removeFromParentsChildList(v);\n    this._parent[v] = parent;\n    this._children[parent][v] = true;\n    return this;\n  }\n\n  _removeFromParentsChildList(v) {\n    delete this._children[this._parent[v]][v];\n  }\n\n  /**\n   * Gets parent node for node v.\n   * Complexity: O(1).\n   */\n  parent(v) {\n    if (this._isCompound) {\n      var parent = this._parent[v];\n      if (parent !== GRAPH_NODE) {\n        return parent;\n      }\n    }\n  }\n\n  /**\n   * Gets list of direct children of node v.\n   * Complexity: O(1).\n   */\n  children(v = GRAPH_NODE) {\n    if (this._isCompound) {\n      var children = this._children[v];\n      if (children) {\n        return Object.keys(children);\n      }\n    } else if (v === GRAPH_NODE) {\n      return this.nodes();\n    } else if (this.hasNode(v)) {\n      return [];\n    }\n  }\n\n  /**\n   * Return all nodes that are predecessors of the specified node or undefined if node v is not in\n   * the graph. Behavior is undefined for undirected graphs - use neighbors instead.\n   * Complexity: O(|V|).\n   */\n  predecessors(v) {\n    var predsV = this._preds[v];\n    if (predsV) {\n      return Object.keys(predsV);\n    }\n  }\n\n  /**\n   * Return all nodes that are successors of the specified node or undefined if node v is not in\n   * the graph. Behavior is undefined for undirected graphs - use neighbors instead.\n   * Complexity: O(|V|).\n   */\n  successors(v) {\n    var sucsV = this._sucs[v];\n    if (sucsV) {\n      return Object.keys(sucsV);\n    }\n  }\n\n  /**\n   * Return all nodes that are predecessors or successors of the specified node or undefined if\n   * node v is not in the graph.\n   * Complexity: O(|V|).\n   */\n  neighbors(v) {\n    var preds = this.predecessors(v);\n    if (preds) {\n      const union = new Set(preds);\n      for (var succ of this.successors(v)) {\n        union.add(succ);\n      }\n\n      return Array.from(union.values());\n    }\n  }\n\n  isLeaf(v) {\n    var neighbors;\n    if (this.isDirected()) {\n      neighbors = this.successors(v);\n    } else {\n      neighbors = this.neighbors(v);\n    }\n    return neighbors.length === 0;\n  }\n\n  /**\n   * Creates new graph with nodes filtered via filter. Edges incident to rejected node\n   * are also removed. In case of compound graph, if parent is rejected by filter,\n   * than all its children are rejected too.\n   * Average-case complexity: O(|E|+|V|).\n   */\n  filterNodes(filter) {\n    var copy = new this.constructor({\n      directed: this._isDirected,\n      multigraph: this._isMultigraph,\n      compound: this._isCompound\n    });\n\n    copy.setGraph(this.graph());\n\n    var self = this;\n    Object.entries(this._nodes).forEach(function([v, value]) {\n      if (filter(v)) {\n        copy.setNode(v, value);\n      }\n    });\n\n    Object.values(this._edgeObjs).forEach(function(e) {\n      if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n        copy.setEdge(e, self.edge(e));\n      }\n    });\n\n    var parents = {};\n    function findParent(v) {\n      var parent = self.parent(v);\n      if (parent === undefined || copy.hasNode(parent)) {\n        parents[v] = parent;\n        return parent;\n      } else if (parent in parents) {\n        return parents[parent];\n      } else {\n        return findParent(parent);\n      }\n    }\n\n    if (this._isCompound) {\n      copy.nodes().forEach(v => copy.setParent(v, findParent(v)));\n    }\n\n    return copy;\n  }\n\n  /* === Edge functions ========== */\n\n  /**\n   * Sets the default edge label or factory function. This label will be\n   * assigned as default label in case if no label was specified while setting\n   * an edge or this function will be invoked each time when setting an edge\n   * with no label specified and returned value * will be used as a label for edge.\n   * Complexity: O(1).\n   */\n  setDefaultEdgeLabel(newDefault) {\n    this._defaultEdgeLabelFn = newDefault;\n    if (typeof newDefault !== 'function') {\n      this._defaultEdgeLabelFn = () => newDefault;\n    }\n\n    return this;\n  }\n\n  /**\n   * Gets the number of edges in the graph.\n   * Complexity: O(1).\n   */\n  edgeCount() {\n    return this._edgeCount;\n  }\n\n  /**\n   * Gets edges of the graph. In case of compound graph subgraphs are not considered.\n   * Complexity: O(|E|).\n   */\n  edges() {\n    return Object.values(this._edgeObjs);\n  }\n\n  /**\n   * Establish an edges path over the nodes in nodes list. If some edge is already\n   * exists, it will update its label, otherwise it will create an edge between pair\n   * of nodes with label provided or default label if no label provided.\n   * Complexity: O(|nodes|).\n   */\n  setPath(vs, value) {\n    var self = this;\n    var args = arguments;\n    vs.reduce(function(v, w) {\n      if (args.length > 1) {\n        self.setEdge(v, w, value);\n      } else {\n        self.setEdge(v, w);\n      }\n      return w;\n    });\n    return this;\n  }\n\n  /**\n   * Creates or updates the label for the edge (v, w) with the optionally supplied\n   * name. If label is supplied it is set as the value for the edge. If label is not\n   * supplied and the edge was created by this call then the default edge label will\n   * be assigned. The name parameter is only useful with multigraphs.\n   */\n  setEdge() {\n    var v, w, name, value;\n    var valueSpecified = false;\n    var arg0 = arguments[0];\n\n    if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n      v = arg0.v;\n      w = arg0.w;\n      name = arg0.name;\n      if (arguments.length === 2) {\n        value = arguments[1];\n        valueSpecified = true;\n      }\n    } else {\n      v = arg0;\n      w = arguments[1];\n      name = arguments[3];\n      if (arguments.length > 2) {\n        value = arguments[2];\n        valueSpecified = true;\n      }\n    }\n\n    v = \"\" + v;\n    w = \"\" + w;\n    if (name !== undefined) {\n      name = \"\" + name;\n    }\n\n    var e = edgeArgsToId(this._isDirected, v, w, name);\n    if (this._edgeLabels.hasOwnProperty(e)) {\n      if (valueSpecified) {\n        this._edgeLabels[e] = value;\n      }\n      return this;\n    }\n\n    if (name !== undefined && !this._isMultigraph) {\n      throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n    }\n\n    // It didn't exist, so we need to create it.\n    // First ensure the nodes exist.\n    this.setNode(v);\n    this.setNode(w);\n\n    this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n    var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n    // Ensure we add undirected edges in a consistent way.\n    v = edgeObj.v;\n    w = edgeObj.w;\n\n    Object.freeze(edgeObj);\n    this._edgeObjs[e] = edgeObj;\n    incrementOrInitEntry(this._preds[w], v);\n    incrementOrInitEntry(this._sucs[v], w);\n    this._in[w][e] = edgeObj;\n    this._out[v][e] = edgeObj;\n    this._edgeCount++;\n    return this;\n  }\n\n  /**\n   * Gets the label for the specified edge.\n   * Complexity: O(1).\n   */\n  edge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    return this._edgeLabels[e];\n  }\n\n  /**\n   * Gets the label for the specified edge and converts it to an object.\n   * Complexity: O(1)\n   */\n  edgeAsObj() {\n    const edge = this.edge(...arguments);\n    if (typeof edge !== \"object\") {\n      return {label: edge};\n    }\n\n    return edge;\n  }\n\n  /**\n   * Detects whether the graph contains specified edge or not. No subgraphs are considered.\n   * Complexity: O(1).\n   */\n  hasEdge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    return this._edgeLabels.hasOwnProperty(e);\n  }\n\n  /**\n   * Removes the specified edge from the graph. No subgraphs are considered.\n   * Complexity: O(1).\n   */\n  removeEdge(v, w, name) {\n    var e = (arguments.length === 1\n      ? edgeObjToId(this._isDirected, arguments[0])\n      : edgeArgsToId(this._isDirected, v, w, name));\n    var edge = this._edgeObjs[e];\n    if (edge) {\n      v = edge.v;\n      w = edge.w;\n      delete this._edgeLabels[e];\n      delete this._edgeObjs[e];\n      decrementOrRemoveEntry(this._preds[w], v);\n      decrementOrRemoveEntry(this._sucs[v], w);\n      delete this._in[w][e];\n      delete this._out[v][e];\n      this._edgeCount--;\n    }\n    return this;\n  }\n\n  /**\n   * Return all edges that point to the node v. Optionally filters those edges down to just those\n   * coming from node u. Behavior is undefined for undirected graphs - use nodeEdges instead.\n   * Complexity: O(|E|).\n   */\n  inEdges(v, u) {\n    var inV = this._in[v];\n    if (inV) {\n      var edges = Object.values(inV);\n      if (!u) {\n        return edges;\n      }\n      return edges.filter(edge => edge.v === u);\n    }\n  }\n\n  /**\n   * Return all edges that are pointed at by node v. Optionally filters those edges down to just\n   * those point to w. Behavior is undefined for undirected graphs - use nodeEdges instead.\n   * Complexity: O(|E|).\n   */\n  outEdges(v, w) {\n    var outV = this._out[v];\n    if (outV) {\n      var edges = Object.values(outV);\n      if (!w) {\n        return edges;\n      }\n      return edges.filter(edge => edge.w === w);\n    }\n  }\n\n  /**\n   * Returns all edges to or from node v regardless of direction. Optionally filters those edges\n   * down to just those between nodes v and w regardless of direction.\n   * Complexity: O(|E|).\n   */\n  nodeEdges(v, w) {\n    var inEdges = this.inEdges(v, w);\n    if (inEdges) {\n      return inEdges.concat(this.outEdges(v, w));\n    }\n  }\n}\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (name === undefined ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n\nmodule.exports = Graph;\n","module.exports = '2.2.2';\n","function topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (stack.hasOwnProperty(node)) {\n      throw new CycleException();\n    }\n\n    if (!visited.hasOwnProperty(node)) {\n      stack[node] = true;\n      visited[node] = true;\n      g.predecessors(node).forEach(visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  g.sinks().forEach(visit);\n\n  if (Object.keys(visited).length !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nclass CycleException extends Error {\n  constructor() {\n    super(...arguments);\n  }\n}\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n","\"use strict\";\n\nlet util = require(\"../util\");\n\nmodule.exports = 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  let mappedEntries = {};\n  entries.forEach((entry, i) => {\n    let tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (entry.barycenter !== undefined) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  cg.edges().forEach(e => {\n    let entryV = mappedEntries[e.v];\n    let entryW = mappedEntries[e.w];\n    if (entryV !== undefined && entryW !== undefined) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  let sourceSet = Object.values(mappedEntries).filter(entry => !entry.indegree);\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  let entries = [];\n\n  function handleIn(vEntry) {\n    return uEntry => {\n      if (uEntry.merged) {\n        return;\n      }\n      if (uEntry.barycenter === undefined ||\n          vEntry.barycenter === undefined ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return wEntry => {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    let entry = sourceSet.pop();\n    entries.push(entry);\n    entry[\"in\"].reverse().forEach(handleIn(entry));\n    entry.out.forEach(handleOut(entry));\n  }\n\n  return entries.filter(entry => !entry.merged).map(entry => {\n    return util.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n  });\n}\n\nfunction mergeEntries(target, source) {\n  let sum = 0;\n  let 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","var dijkstra = require(\"./dijkstra\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return g.nodes().reduce(function(acc, v) {\n    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n    return acc;\n  }, {});\n}\n","\"use strict\";\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\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 (visited.hasOwnProperty(v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = Math.min(...g.outEdges(v).map(e => {\n      if (e == null) {\n        return Number.POSITIVE_INFINITY;\n      }\n\n      return dfs(e.w) - g.edge(e).minlen;\n    }));\n\n    if (rank === Number.POSITIVE_INFINITY) {\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  g.sources().forEach(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","module.exports = 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 * If the order is not \"post\", it will be treated as \"pre\".\n */\nfunction dfs(g, vs, order) {\n  if (!Array.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = g.isDirected() ? v => g.successors(v) : v => g.neighbors(v);\n  var orderFunc = order === \"post\" ? postOrderDfs : preOrderDfs;\n\n  var acc = [];\n  var visited = {};\n  vs.forEach(v => {\n    if (!g.hasNode(v)) {\n      throw new Error(\"Graph does not have node: \" + v);\n    }\n\n    orderFunc(v, navigation, visited, acc);\n  });\n\n  return acc;\n}\n\nfunction postOrderDfs(v, navigation, visited, acc) {\n  var stack = [[v, false]];\n  while (stack.length > 0) {\n    var curr = stack.pop();\n    if (curr[1]) {\n      acc.push(curr[0]);\n    } else {\n      if (!visited.hasOwnProperty(curr[0])) {\n        visited[curr[0]] = true;\n        stack.push([curr[0], true]);\n        forEachRight(navigation(curr[0]), w => stack.push([w, false]));\n      }\n    }\n  }\n}\n\nfunction preOrderDfs(v, navigation, visited, acc) {\n  var stack = [v];\n  while (stack.length > 0) {\n    var curr = stack.pop();\n    if (!visited.hasOwnProperty(curr)) {\n      visited[curr] = true;\n      acc.push(curr);\n      forEachRight(navigation(curr), w => stack.push(w));\n    }\n  }\n}\n\nfunction forEachRight(array, iteratee) {\n  var length = array.length;\n  while (length--) {\n    iteratee(array[length], length, array);\n  }\n\n  return array;\n}\n","module.exports = {\n  components: require(\"./components\"),\n  dijkstra: require(\"./dijkstra\"),\n  dijkstraAll: require(\"./dijkstra-all\"),\n  findCycles: require(\"./find-cycles\"),\n  floydWarshall: require(\"./floyd-warshall\"),\n  isAcyclic: require(\"./is-acyclic\"),\n  postorder: require(\"./postorder\"),\n  preorder: require(\"./preorder\"),\n  prim: require(\"./prim\"),\n  tarjan: require(\"./tarjan\"),\n  topsort: require(\"./topsort\")\n};\n","import { useMemo, useLayoutEffect, useEffect, useRef, useCallback } from 'react';\n\nfunction useCombinedRefs() {\n  for (var _len = arguments.length, refs = new Array(_len), _key = 0; _key < _len; _key++) {\n    refs[_key] = arguments[_key];\n  }\n\n  return useMemo(() => node => {\n    refs.forEach(ref => ref(node));\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  refs);\n}\n\n// https://github.com/facebook/react/blob/master/packages/shared/ExecutionEnvironment.js\nconst canUseDOM = typeof window !== 'undefined' && typeof window.document !== 'undefined' && typeof window.document.createElement !== 'undefined';\n\nfunction isWindow(element) {\n  const elementString = Object.prototype.toString.call(element);\n  return elementString === '[object Window]' || // In Electron context the Window object serializes to [object global]\n  elementString === '[object global]';\n}\n\nfunction isNode(node) {\n  return 'nodeType' in node;\n}\n\nfunction getWindow(target) {\n  var _target$ownerDocument, _target$ownerDocument2;\n\n  if (!target) {\n    return window;\n  }\n\n  if (isWindow(target)) {\n    return target;\n  }\n\n  if (!isNode(target)) {\n    return window;\n  }\n\n  return (_target$ownerDocument = (_target$ownerDocument2 = target.ownerDocument) == null ? void 0 : _target$ownerDocument2.defaultView) != null ? _target$ownerDocument : window;\n}\n\nfunction isDocument(node) {\n  const {\n    Document\n  } = getWindow(node);\n  return node instanceof Document;\n}\n\nfunction isHTMLElement(node) {\n  if (isWindow(node)) {\n    return false;\n  }\n\n  return node instanceof getWindow(node).HTMLElement;\n}\n\nfunction isSVGElement(node) {\n  return node instanceof getWindow(node).SVGElement;\n}\n\nfunction getOwnerDocument(target) {\n  if (!target) {\n    return document;\n  }\n\n  if (isWindow(target)) {\n    return target.document;\n  }\n\n  if (!isNode(target)) {\n    return document;\n  }\n\n  if (isDocument(target)) {\n    return target;\n  }\n\n  if (isHTMLElement(target) || isSVGElement(target)) {\n    return target.ownerDocument;\n  }\n\n  return document;\n}\n\n/**\r\n * A hook that resolves to useEffect on the server and useLayoutEffect on the client\r\n * @param callback {function} Callback function that is invoked when the dependencies of the hook change\r\n */\n\nconst useIsomorphicLayoutEffect = canUseDOM ? useLayoutEffect : useEffect;\n\nfunction useEvent(handler) {\n  const handlerRef = useRef(handler);\n  useIsomorphicLayoutEffect(() => {\n    handlerRef.current = handler;\n  });\n  return useCallback(function () {\n    for (var _len = arguments.length, args = new Array(_len), _key = 0; _key < _len; _key++) {\n      args[_key] = arguments[_key];\n    }\n\n    return handlerRef.current == null ? void 0 : handlerRef.current(...args);\n  }, []);\n}\n\nfunction useInterval() {\n  const intervalRef = useRef(null);\n  const set = useCallback((listener, duration) => {\n    intervalRef.current = setInterval(listener, duration);\n  }, []);\n  const clear = useCallback(() => {\n    if (intervalRef.current !== null) {\n      clearInterval(intervalRef.current);\n      intervalRef.current = null;\n    }\n  }, []);\n  return [set, clear];\n}\n\nfunction useLatestValue(value, dependencies) {\n  if (dependencies === void 0) {\n    dependencies = [value];\n  }\n\n  const valueRef = useRef(value);\n  useIsomorphicLayoutEffect(() => {\n    if (valueRef.current !== value) {\n      valueRef.current = value;\n    }\n  }, dependencies);\n  return valueRef;\n}\n\nfunction useLazyMemo(callback, dependencies) {\n  const valueRef = useRef();\n  return useMemo(() => {\n    const newValue = callback(valueRef.current);\n    valueRef.current = newValue;\n    return newValue;\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [...dependencies]);\n}\n\nfunction useNodeRef(onChange) {\n  const onChangeHandler = useEvent(onChange);\n  const node = useRef(null);\n  const setNodeRef = useCallback(element => {\n    if (element !== node.current) {\n      onChangeHandler == null ? void 0 : onChangeHandler(element, node.current);\n    }\n\n    node.current = element;\n  }, //eslint-disable-next-line\n  []);\n  return [node, setNodeRef];\n}\n\nfunction usePrevious(value) {\n  const ref = useRef();\n  useEffect(() => {\n    ref.current = value;\n  }, [value]);\n  return ref.current;\n}\n\nlet ids = {};\nfunction useUniqueId(prefix, value) {\n  return useMemo(() => {\n    if (value) {\n      return value;\n    }\n\n    const id = ids[prefix] == null ? 0 : ids[prefix] + 1;\n    ids[prefix] = id;\n    return prefix + \"-\" + id;\n  }, [prefix, value]);\n}\n\nfunction createAdjustmentFn(modifier) {\n  return function (object) {\n    for (var _len = arguments.length, adjustments = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n      adjustments[_key - 1] = arguments[_key];\n    }\n\n    return adjustments.reduce((accumulator, adjustment) => {\n      const entries = Object.entries(adjustment);\n\n      for (const [key, valueAdjustment] of entries) {\n        const value = accumulator[key];\n\n        if (value != null) {\n          accumulator[key] = value + modifier * valueAdjustment;\n        }\n      }\n\n      return accumulator;\n    }, { ...object\n    });\n  };\n}\n\nconst add = /*#__PURE__*/createAdjustmentFn(1);\nconst subtract = /*#__PURE__*/createAdjustmentFn(-1);\n\nfunction hasViewportRelativeCoordinates(event) {\n  return 'clientX' in event && 'clientY' in event;\n}\n\nfunction isKeyboardEvent(event) {\n  if (!event) {\n    return false;\n  }\n\n  const {\n    KeyboardEvent\n  } = getWindow(event.target);\n  return KeyboardEvent && event instanceof KeyboardEvent;\n}\n\nfunction isTouchEvent(event) {\n  if (!event) {\n    return false;\n  }\n\n  const {\n    TouchEvent\n  } = getWindow(event.target);\n  return TouchEvent && event instanceof TouchEvent;\n}\n\n/**\r\n * Returns the normalized x and y coordinates for mouse and touch events.\r\n */\n\nfunction getEventCoordinates(event) {\n  if (isTouchEvent(event)) {\n    if (event.touches && event.touches.length) {\n      const {\n        clientX: x,\n        clientY: y\n      } = event.touches[0];\n      return {\n        x,\n        y\n      };\n    } else if (event.changedTouches && event.changedTouches.length) {\n      const {\n        clientX: x,\n        clientY: y\n      } = event.changedTouches[0];\n      return {\n        x,\n        y\n      };\n    }\n  }\n\n  if (hasViewportRelativeCoordinates(event)) {\n    return {\n      x: event.clientX,\n      y: event.clientY\n    };\n  }\n\n  return null;\n}\n\nconst CSS = /*#__PURE__*/Object.freeze({\n  Translate: {\n    toString(transform) {\n      if (!transform) {\n        return;\n      }\n\n      const {\n        x,\n        y\n      } = transform;\n      return \"translate3d(\" + (x ? Math.round(x) : 0) + \"px, \" + (y ? Math.round(y) : 0) + \"px, 0)\";\n    }\n\n  },\n  Scale: {\n    toString(transform) {\n      if (!transform) {\n        return;\n      }\n\n      const {\n        scaleX,\n        scaleY\n      } = transform;\n      return \"scaleX(\" + scaleX + \") scaleY(\" + scaleY + \")\";\n    }\n\n  },\n  Transform: {\n    toString(transform) {\n      if (!transform) {\n        return;\n      }\n\n      return [CSS.Translate.toString(transform), CSS.Scale.toString(transform)].join(' ');\n    }\n\n  },\n  Transition: {\n    toString(_ref) {\n      let {\n        property,\n        duration,\n        easing\n      } = _ref;\n      return property + \" \" + duration + \"ms \" + easing;\n    }\n\n  }\n});\n\nconst SELECTOR = 'a,frame,iframe,input:not([type=hidden]):not(:disabled),select:not(:disabled),textarea:not(:disabled),button:not(:disabled),*[tabindex]';\nfunction findFirstFocusableNode(element) {\n  if (element.matches(SELECTOR)) {\n    return element;\n  }\n\n  return element.querySelector(SELECTOR);\n}\n\nexport { CSS, add, canUseDOM, findFirstFocusableNode, getEventCoordinates, getOwnerDocument, getWindow, hasViewportRelativeCoordinates, isDocument, isHTMLElement, isKeyboardEvent, isNode, isSVGElement, isTouchEvent, isWindow, subtract, useCombinedRefs, useEvent, useInterval, useIsomorphicLayoutEffect, useLatestValue, useLazyMemo, useNodeRef, usePrevious, useUniqueId };\n//# sourceMappingURL=utilities.esm.js.map\n","/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"@dagrejs/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n","let util = require(\"./util\");\n\nmodule.exports = {\n  run,\n  cleanup,\n};\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 boundaries, 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  let root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  let depths = treeDepths(g);\n  let height = Math.max(...Object.values(depths)) - 1; // Note: depths is an Object not an array\n  let nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  g.edges().forEach(e => g.edge(e).minlen *= nodeSep);\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  let weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  g.children().forEach(child => 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}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  let 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  let top = util.addBorderNode(g, \"_bt\");\n  let bottom = util.addBorderNode(g, \"_bb\");\n  let 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  children.forEach(child => {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    let childNode = g.node(child);\n    let childTop = childNode.borderTop ? childNode.borderTop : child;\n    let childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    let thisWeight = childNode.borderTop ? weight : 2 * weight;\n    let 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      children.forEach(child => dfs(child, depth + 1));\n    }\n    depths[v] = depth;\n  }\n  g.children().forEach(v => dfs(v, 1));\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return g.edges().reduce((acc, e) => acc + g.edge(e).weight, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  g.edges().forEach(e => {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n","var Graph = require(\"./graph\");\n\nmodule.exports = {\n  write: write,\n  read: read\n};\n\n/**\n * Creates a JSON representation of the graph that can be serialized to a string with\n * JSON.stringify. The graph can later be restored using json.read.\n */\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound()\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g)\n  };\n\n  if (g.graph() !== undefined) {\n    json.value = structuredClone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return g.nodes().map(function(v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (nodeValue !== undefined) {\n      node.value = nodeValue;\n    }\n    if (parent !== undefined) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return g.edges().map(function(e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (e.name !== undefined) {\n      edge.name = e.name;\n    }\n    if (edgeValue !== undefined) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\n/**\n * Takes JSON as input and returns the graph representation.\n *\n * @example\n * var g2 = graphlib.json.read(JSON.parse(str));\n * g2.nodes();\n * // ['a', 'b']\n * g2.edges()\n * // [ { v: 'a', w: 'b' } ]\n */\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  json.nodes.forEach(function(entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  json.edges.forEach(function(entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n","// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n","module.exports = components;\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (visited.hasOwnProperty(v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    g.successors(v).forEach(dfs);\n    g.predecessors(v).forEach(dfs);\n  }\n\n  g.nodes().forEach(function(v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n","\"use strict\";\n\nlet greedyFAS = require(\"./greedy-fas\");\nlet uniqueId = require(\"./util\").uniqueId;\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  let fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  fas.forEach(e => {\n    let 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 e => {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  let fas = [];\n  let stack = {};\n  let visited = {};\n\n  function dfs(v) {\n    if (visited.hasOwnProperty(v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    g.outEdges(v).forEach(e => {\n      if (stack.hasOwnProperty(e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  g.nodes().forEach(dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  g.edges().forEach(e => {\n    let label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      let forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, \"post\");\n}\n","\"use strict\";\n\nlet zipObject = require(\"../util\").zipObject;\n\nmodule.exports = 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  let cc = 0;\n  for (let 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  let southPos = zipObject(southLayer, southLayer.map((v, i) => i));\n  let southEntries = northLayer.flatMap(v => {\n    return g.outEdges(v).map(e => {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }).sort((a, b) => a.pos - b.pos);\n  });\n\n  // Build the accumulator tree\n  let firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  let treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  let tree = new Array(treeSize).fill(0);\n\n  // Calculate the weighted crossings\n  let cc = 0;\n  southEntries.forEach(entry => {\n    let index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    let weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  });\n\n  return cc;\n}\n","\"use strict\";\n\nlet util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\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  g.edges().forEach(edge => normalizeEdge(g, edge));\n}\n\nfunction normalizeEdge(g, e) {\n  let v = e.v;\n  let vRank = g.node(v).rank;\n  let w = e.w;\n  let wRank = g.node(w).rank;\n  let name = e.name;\n  let edgeLabel = g.edge(e);\n  let labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  let dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  g.graph().dummyChains.forEach(v => {\n    let node = g.node(v);\n    let origLabel = node.edgeLabel;\n    let 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","module.exports = barycenter;\n\nfunction barycenter(g, movable = []) {\n  return movable.map(v => {\n    let inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      let result = inV.reduce((acc, e) => {\n        let 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      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n","\"use strict\";\n\nlet initOrder = require(\"./init-order\");\nlet crossCount = require(\"./cross-count\");\nlet sortSubgraph = require(\"./sort-subgraph\");\nlet buildLayerGraph = require(\"./build-layer-graph\");\nlet addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nlet Graph = require(\"@dagrejs/graphlib\").Graph;\nlet util = require(\"../util\");\n\nmodule.exports = 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, opts) {\n  if (opts && typeof opts.customOrder === 'function') {\n    opts.customOrder(g, order);\n    return;\n  }\n\n  let maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, util.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, util.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  let layering = initOrder(g);\n  assignOrder(g, layering);\n\n  if (opts && opts.disableOptimalOrderHeuristic) {\n    return;\n  }\n\n  let bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    let cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = Object.assign({}, layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  return ranks.map(function(rank) {\n    return buildLayerGraph(g, rank, relationship);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  let cg = new Graph();\n  layerGraphs.forEach(function(lg) {\n    let root = lg.graph().root;\n    let sorted = sortSubgraph(lg, root, cg, biasRight);\n    sorted.vs.forEach((v, i) => lg.node(v).order = i);\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  Object.values(layering).forEach(layer => layer.forEach((v, i) => g.node(v).order = i));\n}\n","let Graph = require(\"@dagrejs/graphlib\").Graph;\nlet List = require(\"./data/list\");\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 */\nmodule.exports = greedyFAS;\n\nlet DEFAULT_WEIGHT_FN = () => 1;\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  let state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  let results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return results.flatMap(e => g.outEdges(e.v, e.w));\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  let results = [];\n  let sources = buckets[buckets.length - 1];\n  let sinks = buckets[0];\n\n  let entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (let 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  let results = collectPredecessors ? [] : undefined;\n\n  g.inEdges(entry.v).forEach(edge => {\n    let weight = g.edge(edge);\n    let 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  g.outEdges(entry.v).forEach(edge => {\n    let weight = g.edge(edge);\n    let w = edge.w;\n    let 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  let fasGraph = new Graph();\n  let maxIn = 0;\n  let maxOut = 0;\n\n  g.nodes().forEach(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  g.edges().forEach(e => {\n    let prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    let weight = weightFn(e);\n    let 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  let buckets = range(maxOut + maxIn + 3).map(() => new List());\n  let zeroIdx = maxIn + 1;\n\n  fasGraph.nodes().forEach(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\nfunction range(limit) {\n  const range = [];\n  for (let i = 0; i < limit; i++) {\n    range.push(i);\n  }\n\n  return range;\n}\n","var tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n  return tarjan(g).filter(function(cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n","import React, { useState, useCallback } from 'react';\n\nconst hiddenStyles = {\n  display: 'none'\n};\nfunction HiddenText(_ref) {\n  let {\n    id,\n    value\n  } = _ref;\n  return React.createElement(\"div\", {\n    id: id,\n    style: hiddenStyles\n  }, value);\n}\n\nfunction LiveRegion(_ref) {\n  let {\n    id,\n    announcement,\n    ariaLiveType = \"assertive\"\n  } = _ref;\n  // Hide element visually but keep it readable by screen readers\n  const visuallyHidden = {\n    position: 'fixed',\n    top: 0,\n    left: 0,\n    width: 1,\n    height: 1,\n    margin: -1,\n    border: 0,\n    padding: 0,\n    overflow: 'hidden',\n    clip: 'rect(0 0 0 0)',\n    clipPath: 'inset(100%)',\n    whiteSpace: 'nowrap'\n  };\n  return React.createElement(\"div\", {\n    id: id,\n    style: visuallyHidden,\n    role: \"status\",\n    \"aria-live\": ariaLiveType,\n    \"aria-atomic\": true\n  }, announcement);\n}\n\nfunction useAnnouncement() {\n  const [announcement, setAnnouncement] = useState('');\n  const announce = useCallback(value => {\n    if (value != null) {\n      setAnnouncement(value);\n    }\n  }, []);\n  return {\n    announce,\n    announcement\n  };\n}\n\nexport { HiddenText, LiveRegion, useAnnouncement };\n//# sourceMappingURL=accessibility.esm.js.map\n","import React, { createContext, useContext, useEffect, useState, useCallback, useMemo, useRef, memo, useReducer, cloneElement, forwardRef } from 'react';\nimport { createPortal, unstable_batchedUpdates } from 'react-dom';\nimport { useUniqueId, getEventCoordinates, getWindow, isDocument, isHTMLElement, isSVGElement, canUseDOM, isWindow, isNode, getOwnerDocument, add, isKeyboardEvent, subtract, useLazyMemo, useInterval, usePrevious, useLatestValue, useEvent, useIsomorphicLayoutEffect, useNodeRef, findFirstFocusableNode, CSS } from '@dnd-kit/utilities';\nimport { useAnnouncement, HiddenText, LiveRegion } from '@dnd-kit/accessibility';\n\nconst DndMonitorContext = /*#__PURE__*/createContext(null);\n\nfunction useDndMonitor(listener) {\n  const registerListener = useContext(DndMonitorContext);\n  useEffect(() => {\n    if (!registerListener) {\n      throw new Error('useDndMonitor must be used within a children of <DndContext>');\n    }\n\n    const unsubscribe = registerListener(listener);\n    return unsubscribe;\n  }, [listener, registerListener]);\n}\n\nfunction useDndMonitorProvider() {\n  const [listeners] = useState(() => new Set());\n  const registerListener = useCallback(listener => {\n    listeners.add(listener);\n    return () => listeners.delete(listener);\n  }, [listeners]);\n  const dispatch = useCallback(_ref => {\n    let {\n      type,\n      event\n    } = _ref;\n    listeners.forEach(listener => {\n      var _listener$type;\n\n      return (_listener$type = listener[type]) == null ? void 0 : _listener$type.call(listener, event);\n    });\n  }, [listeners]);\n  return [dispatch, registerListener];\n}\n\nconst defaultScreenReaderInstructions = {\n  draggable: \"\\n    To pick up a draggable item, press the space bar.\\n    While dragging, use the arrow keys to move the item.\\n    Press space again to drop the item in its new position, or press escape to cancel.\\n  \"\n};\nconst defaultAnnouncements = {\n  onDragStart(_ref) {\n    let {\n      active\n    } = _ref;\n    return \"Picked up draggable item \" + active.id + \".\";\n  },\n\n  onDragOver(_ref2) {\n    let {\n      active,\n      over\n    } = _ref2;\n\n    if (over) {\n      return \"Draggable item \" + active.id + \" was moved over droppable area \" + over.id + \".\";\n    }\n\n    return \"Draggable item \" + active.id + \" is no longer over a droppable area.\";\n  },\n\n  onDragEnd(_ref3) {\n    let {\n      active,\n      over\n    } = _ref3;\n\n    if (over) {\n      return \"Draggable item \" + active.id + \" was dropped over droppable area \" + over.id;\n    }\n\n    return \"Draggable item \" + active.id + \" was dropped.\";\n  },\n\n  onDragCancel(_ref4) {\n    let {\n      active\n    } = _ref4;\n    return \"Dragging was cancelled. Draggable item \" + active.id + \" was dropped.\";\n  }\n\n};\n\nfunction Accessibility(_ref) {\n  let {\n    announcements = defaultAnnouncements,\n    container,\n    hiddenTextDescribedById,\n    screenReaderInstructions = defaultScreenReaderInstructions\n  } = _ref;\n  const {\n    announce,\n    announcement\n  } = useAnnouncement();\n  const liveRegionId = useUniqueId(\"DndLiveRegion\");\n  const [mounted, setMounted] = useState(false);\n  useEffect(() => {\n    setMounted(true);\n  }, []);\n  useDndMonitor(useMemo(() => ({\n    onDragStart(_ref2) {\n      let {\n        active\n      } = _ref2;\n      announce(announcements.onDragStart({\n        active\n      }));\n    },\n\n    onDragMove(_ref3) {\n      let {\n        active,\n        over\n      } = _ref3;\n\n      if (announcements.onDragMove) {\n        announce(announcements.onDragMove({\n          active,\n          over\n        }));\n      }\n    },\n\n    onDragOver(_ref4) {\n      let {\n        active,\n        over\n      } = _ref4;\n      announce(announcements.onDragOver({\n        active,\n        over\n      }));\n    },\n\n    onDragEnd(_ref5) {\n      let {\n        active,\n        over\n      } = _ref5;\n      announce(announcements.onDragEnd({\n        active,\n        over\n      }));\n    },\n\n    onDragCancel(_ref6) {\n      let {\n        active,\n        over\n      } = _ref6;\n      announce(announcements.onDragCancel({\n        active,\n        over\n      }));\n    }\n\n  }), [announce, announcements]));\n\n  if (!mounted) {\n    return null;\n  }\n\n  const markup = React.createElement(React.Fragment, null, React.createElement(HiddenText, {\n    id: hiddenTextDescribedById,\n    value: screenReaderInstructions.draggable\n  }), React.createElement(LiveRegion, {\n    id: liveRegionId,\n    announcement: announcement\n  }));\n  return container ? createPortal(markup, container) : markup;\n}\n\nvar Action;\n\n(function (Action) {\n  Action[\"DragStart\"] = \"dragStart\";\n  Action[\"DragMove\"] = \"dragMove\";\n  Action[\"DragEnd\"] = \"dragEnd\";\n  Action[\"DragCancel\"] = \"dragCancel\";\n  Action[\"DragOver\"] = \"dragOver\";\n  Action[\"RegisterDroppable\"] = \"registerDroppable\";\n  Action[\"SetDroppableDisabled\"] = \"setDroppableDisabled\";\n  Action[\"UnregisterDroppable\"] = \"unregisterDroppable\";\n})(Action || (Action = {}));\n\nfunction noop() {}\n\nfunction useSensor(sensor, options) {\n  return useMemo(() => ({\n    sensor,\n    options: options != null ? options : {}\n  }), // eslint-disable-next-line react-hooks/exhaustive-deps\n  [sensor, options]);\n}\n\nfunction useSensors() {\n  for (var _len = arguments.length, sensors = new Array(_len), _key = 0; _key < _len; _key++) {\n    sensors[_key] = arguments[_key];\n  }\n\n  return useMemo(() => [...sensors].filter(sensor => sensor != null), // eslint-disable-next-line react-hooks/exhaustive-deps\n  [...sensors]);\n}\n\nconst defaultCoordinates = /*#__PURE__*/Object.freeze({\n  x: 0,\n  y: 0\n});\n\n/**\r\n * Returns the distance between two points\r\n */\nfunction distanceBetween(p1, p2) {\n  return Math.sqrt(Math.pow(p1.x - p2.x, 2) + Math.pow(p1.y - p2.y, 2));\n}\n\nfunction getRelativeTransformOrigin(event, rect) {\n  const eventCoordinates = getEventCoordinates(event);\n\n  if (!eventCoordinates) {\n    return '0 0';\n  }\n\n  const transformOrigin = {\n    x: (eventCoordinates.x - rect.left) / rect.width * 100,\n    y: (eventCoordinates.y - rect.top) / rect.height * 100\n  };\n  return transformOrigin.x + \"% \" + transformOrigin.y + \"%\";\n}\n\n/**\r\n * Sort collisions from smallest to greatest value\r\n */\nfunction sortCollisionsAsc(_ref, _ref2) {\n  let {\n    data: {\n      value: a\n    }\n  } = _ref;\n  let {\n    data: {\n      value: b\n    }\n  } = _ref2;\n  return a - b;\n}\n/**\r\n * Sort collisions from greatest to smallest value\r\n */\n\nfunction sortCollisionsDesc(_ref3, _ref4) {\n  let {\n    data: {\n      value: a\n    }\n  } = _ref3;\n  let {\n    data: {\n      value: b\n    }\n  } = _ref4;\n  return b - a;\n}\n/**\r\n * Returns the coordinates of the corners of a given rectangle:\r\n * [TopLeft {x, y}, TopRight {x, y}, BottomLeft {x, y}, BottomRight {x, y}]\r\n */\n\nfunction cornersOfRectangle(_ref5) {\n  let {\n    left,\n    top,\n    height,\n    width\n  } = _ref5;\n  return [{\n    x: left,\n    y: top\n  }, {\n    x: left + width,\n    y: top\n  }, {\n    x: left,\n    y: top + height\n  }, {\n    x: left + width,\n    y: top + height\n  }];\n}\nfunction getFirstCollision(collisions, property) {\n  if (!collisions || collisions.length === 0) {\n    return null;\n  }\n\n  const [firstCollision] = collisions;\n  return property ? firstCollision[property] : firstCollision;\n}\n\n/**\r\n * Returns the coordinates of the center of a given ClientRect\r\n */\n\nfunction centerOfRectangle(rect, left, top) {\n  if (left === void 0) {\n    left = rect.left;\n  }\n\n  if (top === void 0) {\n    top = rect.top;\n  }\n\n  return {\n    x: left + rect.width * 0.5,\n    y: top + rect.height * 0.5\n  };\n}\n/**\r\n * Returns the closest rectangles from an array of rectangles to the center of a given\r\n * rectangle.\r\n */\n\n\nconst closestCenter = _ref => {\n  let {\n    collisionRect,\n    droppableRects,\n    droppableContainers\n  } = _ref;\n  const centerRect = centerOfRectangle(collisionRect, collisionRect.left, collisionRect.top);\n  const collisions = [];\n\n  for (const droppableContainer of droppableContainers) {\n    const {\n      id\n    } = droppableContainer;\n    const rect = droppableRects.get(id);\n\n    if (rect) {\n      const distBetween = distanceBetween(centerOfRectangle(rect), centerRect);\n      collisions.push({\n        id,\n        data: {\n          droppableContainer,\n          value: distBetween\n        }\n      });\n    }\n  }\n\n  return collisions.sort(sortCollisionsAsc);\n};\n\n/**\r\n * Returns the closest rectangles from an array of rectangles to the corners of\r\n * another rectangle.\r\n */\n\nconst closestCorners = _ref => {\n  let {\n    collisionRect,\n    droppableRects,\n    droppableContainers\n  } = _ref;\n  const corners = cornersOfRectangle(collisionRect);\n  const collisions = [];\n\n  for (const droppableContainer of droppableContainers) {\n    const {\n      id\n    } = droppableContainer;\n    const rect = droppableRects.get(id);\n\n    if (rect) {\n      const rectCorners = cornersOfRectangle(rect);\n      const distances = corners.reduce((accumulator, corner, index) => {\n        return accumulator + distanceBetween(rectCorners[index], corner);\n      }, 0);\n      const effectiveDistance = Number((distances / 4).toFixed(4));\n      collisions.push({\n        id,\n        data: {\n          droppableContainer,\n          value: effectiveDistance\n        }\n      });\n    }\n  }\n\n  return collisions.sort(sortCollisionsAsc);\n};\n\n/**\r\n * Returns the intersecting rectangle area between two rectangles\r\n */\n\nfunction getIntersectionRatio(entry, target) {\n  const top = Math.max(target.top, entry.top);\n  const left = Math.max(target.left, entry.left);\n  const right = Math.min(target.left + target.width, entry.left + entry.width);\n  const bottom = Math.min(target.top + target.height, entry.top + entry.height);\n  const width = right - left;\n  const height = bottom - top;\n\n  if (left < right && top < bottom) {\n    const targetArea = target.width * target.height;\n    const entryArea = entry.width * entry.height;\n    const intersectionArea = width * height;\n    const intersectionRatio = intersectionArea / (targetArea + entryArea - intersectionArea);\n    return Number(intersectionRatio.toFixed(4));\n  } // Rectangles do not overlap, or overlap has an area of zero (edge/corner overlap)\n\n\n  return 0;\n}\n/**\r\n * Returns the rectangles that has the greatest intersection area with a given\r\n * rectangle in an array of rectangles.\r\n */\n\nconst rectIntersection = _ref => {\n  let {\n    collisionRect,\n    droppableRects,\n    droppableContainers\n  } = _ref;\n  const collisions = [];\n\n  for (const droppableContainer of droppableContainers) {\n    const {\n      id\n    } = droppableContainer;\n    const rect = droppableRects.get(id);\n\n    if (rect) {\n      const intersectionRatio = getIntersectionRatio(rect, collisionRect);\n\n      if (intersectionRatio > 0) {\n        collisions.push({\n          id,\n          data: {\n            droppableContainer,\n            value: intersectionRatio\n          }\n        });\n      }\n    }\n  }\n\n  return collisions.sort(sortCollisionsDesc);\n};\n\n/**\r\n * Check if a given point is contained within a bounding rectangle\r\n */\n\nfunction isPointWithinRect(point, rect) {\n  const {\n    top,\n    left,\n    bottom,\n    right\n  } = rect;\n  return top <= point.y && point.y <= bottom && left <= point.x && point.x <= right;\n}\n/**\r\n * Returns the rectangles that the pointer is hovering over\r\n */\n\n\nconst pointerWithin = _ref => {\n  let {\n    droppableContainers,\n    droppableRects,\n    pointerCoordinates\n  } = _ref;\n\n  if (!pointerCoordinates) {\n    return [];\n  }\n\n  const collisions = [];\n\n  for (const droppableContainer of droppableContainers) {\n    const {\n      id\n    } = droppableContainer;\n    const rect = droppableRects.get(id);\n\n    if (rect && isPointWithinRect(pointerCoordinates, rect)) {\n      /* There may be more than a single rectangle intersecting\r\n       * with the pointer coordinates. In order to sort the\r\n       * colliding rectangles, we measure the distance between\r\n       * the pointer and the corners of the intersecting rectangle\r\n       */\n      const corners = cornersOfRectangle(rect);\n      const distances = corners.reduce((accumulator, corner) => {\n        return accumulator + distanceBetween(pointerCoordinates, corner);\n      }, 0);\n      const effectiveDistance = Number((distances / 4).toFixed(4));\n      collisions.push({\n        id,\n        data: {\n          droppableContainer,\n          value: effectiveDistance\n        }\n      });\n    }\n  }\n\n  return collisions.sort(sortCollisionsAsc);\n};\n\nfunction adjustScale(transform, rect1, rect2) {\n  return { ...transform,\n    scaleX: rect1 && rect2 ? rect1.width / rect2.width : 1,\n    scaleY: rect1 && rect2 ? rect1.height / rect2.height : 1\n  };\n}\n\nfunction getRectDelta(rect1, rect2) {\n  return rect1 && rect2 ? {\n    x: rect1.left - rect2.left,\n    y: rect1.top - rect2.top\n  } : defaultCoordinates;\n}\n\nfunction createRectAdjustmentFn(modifier) {\n  return function adjustClientRect(rect) {\n    for (var _len = arguments.length, adjustments = new Array(_len > 1 ? _len - 1 : 0), _key = 1; _key < _len; _key++) {\n      adjustments[_key - 1] = arguments[_key];\n    }\n\n    return adjustments.reduce((acc, adjustment) => ({ ...acc,\n      top: acc.top + modifier * adjustment.y,\n      bottom: acc.bottom + modifier * adjustment.y,\n      left: acc.left + modifier * adjustment.x,\n      right: acc.right + modifier * adjustment.x\n    }), { ...rect\n    });\n  };\n}\nconst getAdjustedRect = /*#__PURE__*/createRectAdjustmentFn(1);\n\nfunction parseTransform(transform) {\n  if (transform.startsWith('matrix3d(')) {\n    const transformArray = transform.slice(9, -1).split(/, /);\n    return {\n      x: +transformArray[12],\n      y: +transformArray[13],\n      scaleX: +transformArray[0],\n      scaleY: +transformArray[5]\n    };\n  } else if (transform.startsWith('matrix(')) {\n    const transformArray = transform.slice(7, -1).split(/, /);\n    return {\n      x: +transformArray[4],\n      y: +transformArray[5],\n      scaleX: +transformArray[0],\n      scaleY: +transformArray[3]\n    };\n  }\n\n  return null;\n}\n\nfunction inverseTransform(rect, transform, transformOrigin) {\n  const parsedTransform = parseTransform(transform);\n\n  if (!parsedTransform) {\n    return rect;\n  }\n\n  const {\n    scaleX,\n    scaleY,\n    x: translateX,\n    y: translateY\n  } = parsedTransform;\n  const x = rect.left - translateX - (1 - scaleX) * parseFloat(transformOrigin);\n  const y = rect.top - translateY - (1 - scaleY) * parseFloat(transformOrigin.slice(transformOrigin.indexOf(' ') + 1));\n  const w = scaleX ? rect.width / scaleX : rect.width;\n  const h = scaleY ? rect.height / scaleY : rect.height;\n  return {\n    width: w,\n    height: h,\n    top: y,\n    right: x + w,\n    bottom: y + h,\n    left: x\n  };\n}\n\nconst defaultOptions = {\n  ignoreTransform: false\n};\n/**\r\n * Returns the bounding client rect of an element relative to the viewport.\r\n */\n\nfunction getClientRect(element, options) {\n  if (options === void 0) {\n    options = defaultOptions;\n  }\n\n  let rect = element.getBoundingClientRect();\n\n  if (options.ignoreTransform) {\n    const {\n      transform,\n      transformOrigin\n    } = getWindow(element).getComputedStyle(element);\n\n    if (transform) {\n      rect = inverseTransform(rect, transform, transformOrigin);\n    }\n  }\n\n  const {\n    top,\n    left,\n    width,\n    height,\n    bottom,\n    right\n  } = rect;\n  return {\n    top,\n    left,\n    width,\n    height,\n    bottom,\n    right\n  };\n}\n/**\r\n * Returns the bounding client rect of an element relative to the viewport.\r\n *\r\n * @remarks\r\n * The ClientRect returned by this method does not take into account transforms\r\n * applied to the element it measures.\r\n *\r\n */\n\nfunction getTransformAgnosticClientRect(element) {\n  return getClientRect(element, {\n    ignoreTransform: true\n  });\n}\n\nfunction getWindowClientRect(element) {\n  const width = element.innerWidth;\n  const height = element.innerHeight;\n  return {\n    top: 0,\n    left: 0,\n    right: width,\n    bottom: height,\n    width,\n    height\n  };\n}\n\nfunction isFixed(node, computedStyle) {\n  if (computedStyle === void 0) {\n    computedStyle = getWindow(node).getComputedStyle(node);\n  }\n\n  return computedStyle.position === 'fixed';\n}\n\nfunction isScrollable(element, computedStyle) {\n  if (computedStyle === void 0) {\n    computedStyle = getWindow(element).getComputedStyle(element);\n  }\n\n  const overflowRegex = /(auto|scroll|overlay)/;\n  const properties = ['overflow', 'overflowX', 'overflowY'];\n  return properties.some(property => {\n    const value = computedStyle[property];\n    return typeof value === 'string' ? overflowRegex.test(value) : false;\n  });\n}\n\nfunction getScrollableAncestors(element, limit) {\n  const scrollParents = [];\n\n  function findScrollableAncestors(node) {\n    if (limit != null && scrollParents.length >= limit) {\n      return scrollParents;\n    }\n\n    if (!node) {\n      return scrollParents;\n    }\n\n    if (isDocument(node) && node.scrollingElement != null && !scrollParents.includes(node.scrollingElement)) {\n      scrollParents.push(node.scrollingElement);\n      return scrollParents;\n    }\n\n    if (!isHTMLElement(node) || isSVGElement(node)) {\n      return scrollParents;\n    }\n\n    if (scrollParents.includes(node)) {\n      return scrollParents;\n    }\n\n    const computedStyle = getWindow(element).getComputedStyle(node);\n\n    if (node !== element) {\n      if (isScrollable(node, computedStyle)) {\n        scrollParents.push(node);\n      }\n    }\n\n    if (isFixed(node, computedStyle)) {\n      return scrollParents;\n    }\n\n    return findScrollableAncestors(node.parentNode);\n  }\n\n  if (!element) {\n    return scrollParents;\n  }\n\n  return findScrollableAncestors(element);\n}\nfunction getFirstScrollableAncestor(node) {\n  const [firstScrollableAncestor] = getScrollableAncestors(node, 1);\n  return firstScrollableAncestor != null ? firstScrollableAncestor : null;\n}\n\nfunction getScrollableElement(element) {\n  if (!canUseDOM || !element) {\n    return null;\n  }\n\n  if (isWindow(element)) {\n    return element;\n  }\n\n  if (!isNode(element)) {\n    return null;\n  }\n\n  if (isDocument(element) || element === getOwnerDocument(element).scrollingElement) {\n    return window;\n  }\n\n  if (isHTMLElement(element)) {\n    return element;\n  }\n\n  return null;\n}\n\nfunction getScrollXCoordinate(element) {\n  if (isWindow(element)) {\n    return element.scrollX;\n  }\n\n  return element.scrollLeft;\n}\nfunction getScrollYCoordinate(element) {\n  if (isWindow(element)) {\n    return element.scrollY;\n  }\n\n  return element.scrollTop;\n}\nfunction getScrollCoordinates(element) {\n  return {\n    x: getScrollXCoordinate(element),\n    y: getScrollYCoordinate(element)\n  };\n}\n\nvar Direction;\n\n(function (Direction) {\n  Direction[Direction[\"Forward\"] = 1] = \"Forward\";\n  Direction[Direction[\"Backward\"] = -1] = \"Backward\";\n})(Direction || (Direction = {}));\n\nfunction isDocumentScrollingElement(element) {\n  if (!canUseDOM || !element) {\n    return false;\n  }\n\n  return element === document.scrollingElement;\n}\n\nfunction getScrollPosition(scrollingContainer) {\n  const minScroll = {\n    x: 0,\n    y: 0\n  };\n  const dimensions = isDocumentScrollingElement(scrollingContainer) ? {\n    height: window.innerHeight,\n    width: window.innerWidth\n  } : {\n    height: scrollingContainer.clientHeight,\n    width: scrollingContainer.clientWidth\n  };\n  const maxScroll = {\n    x: scrollingContainer.scrollWidth - dimensions.width,\n    y: scrollingContainer.scrollHeight - dimensions.height\n  };\n  const isTop = scrollingContainer.scrollTop <= minScroll.y;\n  const isLeft = scrollingContainer.scrollLeft <= minScroll.x;\n  const isBottom = scrollingContainer.scrollTop >= maxScroll.y;\n  const isRight = scrollingContainer.scrollLeft >= maxScroll.x;\n  return {\n    isTop,\n    isLeft,\n    isBottom,\n    isRight,\n    maxScroll,\n    minScroll\n  };\n}\n\nconst defaultThreshold = {\n  x: 0.2,\n  y: 0.2\n};\nfunction getScrollDirectionAndSpeed(scrollContainer, scrollContainerRect, _ref, acceleration, thresholdPercentage) {\n  let {\n    top,\n    left,\n    right,\n    bottom\n  } = _ref;\n\n  if (acceleration === void 0) {\n    acceleration = 10;\n  }\n\n  if (thresholdPercentage === void 0) {\n    thresholdPercentage = defaultThreshold;\n  }\n\n  const {\n    isTop,\n    isBottom,\n    isLeft,\n    isRight\n  } = getScrollPosition(scrollContainer);\n  const direction = {\n    x: 0,\n    y: 0\n  };\n  const speed = {\n    x: 0,\n    y: 0\n  };\n  const threshold = {\n    height: scrollContainerRect.height * thresholdPercentage.y,\n    width: scrollContainerRect.width * thresholdPercentage.x\n  };\n\n  if (!isTop && top <= scrollContainerRect.top + threshold.height) {\n    // Scroll Up\n    direction.y = Direction.Backward;\n    speed.y = acceleration * Math.abs((scrollContainerRect.top + threshold.height - top) / threshold.height);\n  } else if (!isBottom && bottom >= scrollContainerRect.bottom - threshold.height) {\n    // Scroll Down\n    direction.y = Direction.Forward;\n    speed.y = acceleration * Math.abs((scrollContainerRect.bottom - threshold.height - bottom) / threshold.height);\n  }\n\n  if (!isRight && right >= scrollContainerRect.right - threshold.width) {\n    // Scroll Right\n    direction.x = Direction.Forward;\n    speed.x = acceleration * Math.abs((scrollContainerRect.right - threshold.width - right) / threshold.width);\n  } else if (!isLeft && left <= scrollContainerRect.left + threshold.width) {\n    // Scroll Left\n    direction.x = Direction.Backward;\n    speed.x = acceleration * Math.abs((scrollContainerRect.left + threshold.width - left) / threshold.width);\n  }\n\n  return {\n    direction,\n    speed\n  };\n}\n\nfunction getScrollElementRect(element) {\n  if (element === document.scrollingElement) {\n    const {\n      innerWidth,\n      innerHeight\n    } = window;\n    return {\n      top: 0,\n      left: 0,\n      right: innerWidth,\n      bottom: innerHeight,\n      width: innerWidth,\n      height: innerHeight\n    };\n  }\n\n  const {\n    top,\n    left,\n    right,\n    bottom\n  } = element.getBoundingClientRect();\n  return {\n    top,\n    left,\n    right,\n    bottom,\n    width: element.clientWidth,\n    height: element.clientHeight\n  };\n}\n\nfunction getScrollOffsets(scrollableAncestors) {\n  return scrollableAncestors.reduce((acc, node) => {\n    return add(acc, getScrollCoordinates(node));\n  }, defaultCoordinates);\n}\nfunction getScrollXOffset(scrollableAncestors) {\n  return scrollableAncestors.reduce((acc, node) => {\n    return acc + getScrollXCoordinate(node);\n  }, 0);\n}\nfunction getScrollYOffset(scrollableAncestors) {\n  return scrollableAncestors.reduce((acc, node) => {\n    return acc + getScrollYCoordinate(node);\n  }, 0);\n}\n\nfunction scrollIntoViewIfNeeded(element, measure) {\n  if (measure === void 0) {\n    measure = getClientRect;\n  }\n\n  if (!element) {\n    return;\n  }\n\n  const {\n    top,\n    left,\n    bottom,\n    right\n  } = measure(element);\n  const firstScrollableAncestor = getFirstScrollableAncestor(element);\n\n  if (!firstScrollableAncestor) {\n    return;\n  }\n\n  if (bottom <= 0 || right <= 0 || top >= window.innerHeight || left >= window.innerWidth) {\n    element.scrollIntoView({\n      block: 'center',\n      inline: 'center'\n    });\n  }\n}\n\nconst properties = [['x', ['left', 'right'], getScrollXOffset], ['y', ['top', 'bottom'], getScrollYOffset]];\nclass Rect {\n  constructor(rect, element) {\n    this.rect = void 0;\n    this.width = void 0;\n    this.height = void 0;\n    this.top = void 0;\n    this.bottom = void 0;\n    this.right = void 0;\n    this.left = void 0;\n    const scrollableAncestors = getScrollableAncestors(element);\n    const scrollOffsets = getScrollOffsets(scrollableAncestors);\n    this.rect = { ...rect\n    };\n    this.width = rect.width;\n    this.height = rect.height;\n\n    for (const [axis, keys, getScrollOffset] of properties) {\n      for (const key of keys) {\n        Object.defineProperty(this, key, {\n          get: () => {\n            const currentOffsets = getScrollOffset(scrollableAncestors);\n            const scrollOffsetsDeltla = scrollOffsets[axis] - currentOffsets;\n            return this.rect[key] + scrollOffsetsDeltla;\n          },\n          enumerable: true\n        });\n      }\n    }\n\n    Object.defineProperty(this, 'rect', {\n      enumerable: false\n    });\n  }\n\n}\n\nclass Listeners {\n  constructor(target) {\n    this.target = void 0;\n    this.listeners = [];\n\n    this.removeAll = () => {\n      this.listeners.forEach(listener => {\n        var _this$target;\n\n        return (_this$target = this.target) == null ? void 0 : _this$target.removeEventListener(...listener);\n      });\n    };\n\n    this.target = target;\n  }\n\n  add(eventName, handler, options) {\n    var _this$target2;\n\n    (_this$target2 = this.target) == null ? void 0 : _this$target2.addEventListener(eventName, handler, options);\n    this.listeners.push([eventName, handler, options]);\n  }\n\n}\n\nfunction getEventListenerTarget(target) {\n  // If the `event.target` element is removed from the document events will still be targeted\n  // at it, and hence won't always bubble up to the window or document anymore.\n  // If there is any risk of an element being removed while it is being dragged,\n  // the best practice is to attach the event listeners directly to the target.\n  // https://developer.mozilla.org/en-US/docs/Web/API/EventTarget\n  const {\n    EventTarget\n  } = getWindow(target);\n  return target instanceof EventTarget ? target : getOwnerDocument(target);\n}\n\nfunction hasExceededDistance(delta, measurement) {\n  const dx = Math.abs(delta.x);\n  const dy = Math.abs(delta.y);\n\n  if (typeof measurement === 'number') {\n    return Math.sqrt(dx ** 2 + dy ** 2) > measurement;\n  }\n\n  if ('x' in measurement && 'y' in measurement) {\n    return dx > measurement.x && dy > measurement.y;\n  }\n\n  if ('x' in measurement) {\n    return dx > measurement.x;\n  }\n\n  if ('y' in measurement) {\n    return dy > measurement.y;\n  }\n\n  return false;\n}\n\nvar EventName;\n\n(function (EventName) {\n  EventName[\"Click\"] = \"click\";\n  EventName[\"DragStart\"] = \"dragstart\";\n  EventName[\"Keydown\"] = \"keydown\";\n  EventName[\"ContextMenu\"] = \"contextmenu\";\n  EventName[\"Resize\"] = \"resize\";\n  EventName[\"SelectionChange\"] = \"selectionchange\";\n  EventName[\"VisibilityChange\"] = \"visibilitychange\";\n})(EventName || (EventName = {}));\n\nfunction preventDefault(event) {\n  event.preventDefault();\n}\nfunction stopPropagation(event) {\n  event.stopPropagation();\n}\n\nvar KeyboardCode;\n\n(function (KeyboardCode) {\n  KeyboardCode[\"Space\"] = \"Space\";\n  KeyboardCode[\"Down\"] = \"ArrowDown\";\n  KeyboardCode[\"Right\"] = \"ArrowRight\";\n  KeyboardCode[\"Left\"] = \"ArrowLeft\";\n  KeyboardCode[\"Up\"] = \"ArrowUp\";\n  KeyboardCode[\"Esc\"] = \"Escape\";\n  KeyboardCode[\"Enter\"] = \"Enter\";\n  KeyboardCode[\"Tab\"] = \"Tab\";\n})(KeyboardCode || (KeyboardCode = {}));\n\nconst defaultKeyboardCodes = {\n  start: [KeyboardCode.Space, KeyboardCode.Enter],\n  cancel: [KeyboardCode.Esc],\n  end: [KeyboardCode.Space, KeyboardCode.Enter, KeyboardCode.Tab]\n};\nconst defaultKeyboardCoordinateGetter = (event, _ref) => {\n  let {\n    currentCoordinates\n  } = _ref;\n\n  switch (event.code) {\n    case KeyboardCode.Right:\n      return { ...currentCoordinates,\n        x: currentCoordinates.x + 25\n      };\n\n    case KeyboardCode.Left:\n      return { ...currentCoordinates,\n        x: currentCoordinates.x - 25\n      };\n\n    case KeyboardCode.Down:\n      return { ...currentCoordinates,\n        y: currentCoordinates.y + 25\n      };\n\n    case KeyboardCode.Up:\n      return { ...currentCoordinates,\n        y: currentCoordinates.y - 25\n      };\n  }\n\n  return undefined;\n};\n\nclass KeyboardSensor {\n  constructor(props) {\n    this.props = void 0;\n    this.autoScrollEnabled = false;\n    this.referenceCoordinates = void 0;\n    this.listeners = void 0;\n    this.windowListeners = void 0;\n    this.props = props;\n    const {\n      event: {\n        target\n      }\n    } = props;\n    this.props = props;\n    this.listeners = new Listeners(getOwnerDocument(target));\n    this.windowListeners = new Listeners(getWindow(target));\n    this.handleKeyDown = this.handleKeyDown.bind(this);\n    this.handleCancel = this.handleCancel.bind(this);\n    this.attach();\n  }\n\n  attach() {\n    this.handleStart();\n    this.windowListeners.add(EventName.Resize, this.handleCancel);\n    this.windowListeners.add(EventName.VisibilityChange, this.handleCancel);\n    setTimeout(() => this.listeners.add(EventName.Keydown, this.handleKeyDown));\n  }\n\n  handleStart() {\n    const {\n      activeNode,\n      onStart\n    } = this.props;\n    const node = activeNode.node.current;\n\n    if (node) {\n      scrollIntoViewIfNeeded(node);\n    }\n\n    onStart(defaultCoordinates);\n  }\n\n  handleKeyDown(event) {\n    if (isKeyboardEvent(event)) {\n      const {\n        active,\n        context,\n        options\n      } = this.props;\n      const {\n        keyboardCodes = defaultKeyboardCodes,\n        coordinateGetter = defaultKeyboardCoordinateGetter,\n        scrollBehavior = 'smooth'\n      } = options;\n      const {\n        code\n      } = event;\n\n      if (keyboardCodes.end.includes(code)) {\n        this.handleEnd(event);\n        return;\n      }\n\n      if (keyboardCodes.cancel.includes(code)) {\n        this.handleCancel(event);\n        return;\n      }\n\n      const {\n        collisionRect\n      } = context.current;\n      const currentCoordinates = collisionRect ? {\n        x: collisionRect.left,\n        y: collisionRect.top\n      } : defaultCoordinates;\n\n      if (!this.referenceCoordinates) {\n        this.referenceCoordinates = currentCoordinates;\n      }\n\n      const newCoordinates = coordinateGetter(event, {\n        active,\n        context: context.current,\n        currentCoordinates\n      });\n\n      if (newCoordinates) {\n        const coordinatesDelta = subtract(newCoordinates, currentCoordinates);\n        const scrollDelta = {\n          x: 0,\n          y: 0\n        };\n        const {\n          scrollableAncestors\n        } = context.current;\n\n        for (const scrollContainer of scrollableAncestors) {\n          const direction = event.code;\n          const {\n            isTop,\n            isRight,\n            isLeft,\n            isBottom,\n            maxScroll,\n            minScroll\n          } = getScrollPosition(scrollContainer);\n          const scrollElementRect = getScrollElementRect(scrollContainer);\n          const clampedCoordinates = {\n            x: Math.min(direction === KeyboardCode.Right ? scrollElementRect.right - scrollElementRect.width / 2 : scrollElementRect.right, Math.max(direction === KeyboardCode.Right ? scrollElementRect.left : scrollElementRect.left + scrollElementRect.width / 2, newCoordinates.x)),\n            y: Math.min(direction === KeyboardCode.Down ? scrollElementRect.bottom - scrollElementRect.height / 2 : scrollElementRect.bottom, Math.max(direction === KeyboardCode.Down ? scrollElementRect.top : scrollElementRect.top + scrollElementRect.height / 2, newCoordinates.y))\n          };\n          const canScrollX = direction === KeyboardCode.Right && !isRight || direction === KeyboardCode.Left && !isLeft;\n          const canScrollY = direction === KeyboardCode.Down && !isBottom || direction === KeyboardCode.Up && !isTop;\n\n          if (canScrollX && clampedCoordinates.x !== newCoordinates.x) {\n            const newScrollCoordinates = scrollContainer.scrollLeft + coordinatesDelta.x;\n            const canScrollToNewCoordinates = direction === KeyboardCode.Right && newScrollCoordinates <= maxScroll.x || direction === KeyboardCode.Left && newScrollCoordinates >= minScroll.x;\n\n            if (canScrollToNewCoordinates && !coordinatesDelta.y) {\n              // We don't need to update coordinates, the scroll adjustment alone will trigger\n              // logic to auto-detect the new container we are over\n              scrollContainer.scrollTo({\n                left: newScrollCoordinates,\n                behavior: scrollBehavior\n              });\n              return;\n            }\n\n            if (canScrollToNewCoordinates) {\n              scrollDelta.x = scrollContainer.scrollLeft - newScrollCoordinates;\n            } else {\n              scrollDelta.x = direction === KeyboardCode.Right ? scrollContainer.scrollLeft - maxScroll.x : scrollContainer.scrollLeft - minScroll.x;\n            }\n\n            if (scrollDelta.x) {\n              scrollContainer.scrollBy({\n                left: -scrollDelta.x,\n                behavior: scrollBehavior\n              });\n            }\n\n            break;\n          } else if (canScrollY && clampedCoordinates.y !== newCoordinates.y) {\n            const newScrollCoordinates = scrollContainer.scrollTop + coordinatesDelta.y;\n            const canScrollToNewCoordinates = direction === KeyboardCode.Down && newScrollCoordinates <= maxScroll.y || direction === KeyboardCode.Up && newScrollCoordinates >= minScroll.y;\n\n            if (canScrollToNewCoordinates && !coordinatesDelta.x) {\n              // We don't need to update coordinates, the scroll adjustment alone will trigger\n              // logic to auto-detect the new container we are over\n              scrollContainer.scrollTo({\n                top: newScrollCoordinates,\n                behavior: scrollBehavior\n              });\n              return;\n            }\n\n            if (canScrollToNewCoordinates) {\n              scrollDelta.y = scrollContainer.scrollTop - newScrollCoordinates;\n            } else {\n              scrollDelta.y = direction === KeyboardCode.Down ? scrollContainer.scrollTop - maxScroll.y : scrollContainer.scrollTop - minScroll.y;\n            }\n\n            if (scrollDelta.y) {\n              scrollContainer.scrollBy({\n                top: -scrollDelta.y,\n                behavior: scrollBehavior\n              });\n            }\n\n            break;\n          }\n        }\n\n        this.handleMove(event, add(subtract(newCoordinates, this.referenceCoordinates), scrollDelta));\n      }\n    }\n  }\n\n  handleMove(event, coordinates) {\n    const {\n      onMove\n    } = this.props;\n    event.preventDefault();\n    onMove(coordinates);\n  }\n\n  handleEnd(event) {\n    const {\n      onEnd\n    } = this.props;\n    event.preventDefault();\n    this.detach();\n    onEnd();\n  }\n\n  handleCancel(event) {\n    const {\n      onCancel\n    } = this.props;\n    event.preventDefault();\n    this.detach();\n    onCancel();\n  }\n\n  detach() {\n    this.listeners.removeAll();\n    this.windowListeners.removeAll();\n  }\n\n}\nKeyboardSensor.activators = [{\n  eventName: 'onKeyDown',\n  handler: (event, _ref, _ref2) => {\n    let {\n      keyboardCodes = defaultKeyboardCodes,\n      onActivation\n    } = _ref;\n    let {\n      active\n    } = _ref2;\n    const {\n      code\n    } = event.nativeEvent;\n\n    if (keyboardCodes.start.includes(code)) {\n      const activator = active.activatorNode.current;\n\n      if (activator && event.target !== activator) {\n        return false;\n      }\n\n      event.preventDefault();\n      onActivation == null ? void 0 : onActivation({\n        event: event.nativeEvent\n      });\n      return true;\n    }\n\n    return false;\n  }\n}];\n\nfunction isDistanceConstraint(constraint) {\n  return Boolean(constraint && 'distance' in constraint);\n}\n\nfunction isDelayConstraint(constraint) {\n  return Boolean(constraint && 'delay' in constraint);\n}\n\nclass AbstractPointerSensor {\n  constructor(props, events, listenerTarget) {\n    var _getEventCoordinates;\n\n    if (listenerTarget === void 0) {\n      listenerTarget = getEventListenerTarget(props.event.target);\n    }\n\n    this.props = void 0;\n    this.events = void 0;\n    this.autoScrollEnabled = true;\n    this.document = void 0;\n    this.activated = false;\n    this.initialCoordinates = void 0;\n    this.timeoutId = null;\n    this.listeners = void 0;\n    this.documentListeners = void 0;\n    this.windowListeners = void 0;\n    this.props = props;\n    this.events = events;\n    const {\n      event\n    } = props;\n    const {\n      target\n    } = event;\n    this.props = props;\n    this.events = events;\n    this.document = getOwnerDocument(target);\n    this.documentListeners = new Listeners(this.document);\n    this.listeners = new Listeners(listenerTarget);\n    this.windowListeners = new Listeners(getWindow(target));\n    this.initialCoordinates = (_getEventCoordinates = getEventCoordinates(event)) != null ? _getEventCoordinates : defaultCoordinates;\n    this.handleStart = this.handleStart.bind(this);\n    this.handleMove = this.handleMove.bind(this);\n    this.handleEnd = this.handleEnd.bind(this);\n    this.handleCancel = this.handleCancel.bind(this);\n    this.handleKeydown = this.handleKeydown.bind(this);\n    this.removeTextSelection = this.removeTextSelection.bind(this);\n    this.attach();\n  }\n\n  attach() {\n    const {\n      events,\n      props: {\n        options: {\n          activationConstraint,\n          bypassActivationConstraint\n        }\n      }\n    } = this;\n    this.listeners.add(events.move.name, this.handleMove, {\n      passive: false\n    });\n    this.listeners.add(events.end.name, this.handleEnd);\n\n    if (events.cancel) {\n      this.listeners.add(events.cancel.name, this.handleCancel);\n    }\n\n    this.windowListeners.add(EventName.Resize, this.handleCancel);\n    this.windowListeners.add(EventName.DragStart, preventDefault);\n    this.windowListeners.add(EventName.VisibilityChange, this.handleCancel);\n    this.windowListeners.add(EventName.ContextMenu, preventDefault);\n    this.documentListeners.add(EventName.Keydown, this.handleKeydown);\n\n    if (activationConstraint) {\n      if (bypassActivationConstraint != null && bypassActivationConstraint({\n        event: this.props.event,\n        activeNode: this.props.activeNode,\n        options: this.props.options\n      })) {\n        return this.handleStart();\n      }\n\n      if (isDelayConstraint(activationConstraint)) {\n        this.timeoutId = setTimeout(this.handleStart, activationConstraint.delay);\n        this.handlePending(activationConstraint);\n        return;\n      }\n\n      if (isDistanceConstraint(activationConstraint)) {\n        this.handlePending(activationConstraint);\n        return;\n      }\n    }\n\n    this.handleStart();\n  }\n\n  detach() {\n    this.listeners.removeAll();\n    this.windowListeners.removeAll(); // Wait until the next event loop before removing document listeners\n    // This is necessary because we listen for `click` and `selection` events on the document\n\n    setTimeout(this.documentListeners.removeAll, 50);\n\n    if (this.timeoutId !== null) {\n      clearTimeout(this.timeoutId);\n      this.timeoutId = null;\n    }\n  }\n\n  handlePending(constraint, offset) {\n    const {\n      active,\n      onPending\n    } = this.props;\n    onPending(active, constraint, this.initialCoordinates, offset);\n  }\n\n  handleStart() {\n    const {\n      initialCoordinates\n    } = this;\n    const {\n      onStart\n    } = this.props;\n\n    if (initialCoordinates) {\n      this.activated = true; // Stop propagation of click events once activation constraints are met\n\n      this.documentListeners.add(EventName.Click, stopPropagation, {\n        capture: true\n      }); // Remove any text selection from the document\n\n      this.removeTextSelection(); // Prevent further text selection while dragging\n\n      this.documentListeners.add(EventName.SelectionChange, this.removeTextSelection);\n      onStart(initialCoordinates);\n    }\n  }\n\n  handleMove(event) {\n    var _getEventCoordinates2;\n\n    const {\n      activated,\n      initialCoordinates,\n      props\n    } = this;\n    const {\n      onMove,\n      options: {\n        activationConstraint\n      }\n    } = props;\n\n    if (!initialCoordinates) {\n      return;\n    }\n\n    const coordinates = (_getEventCoordinates2 = getEventCoordinates(event)) != null ? _getEventCoordinates2 : defaultCoordinates;\n    const delta = subtract(initialCoordinates, coordinates); // Constraint validation\n\n    if (!activated && activationConstraint) {\n      if (isDistanceConstraint(activationConstraint)) {\n        if (activationConstraint.tolerance != null && hasExceededDistance(delta, activationConstraint.tolerance)) {\n          return this.handleCancel();\n        }\n\n        if (hasExceededDistance(delta, activationConstraint.distance)) {\n          return this.handleStart();\n        }\n      }\n\n      if (isDelayConstraint(activationConstraint)) {\n        if (hasExceededDistance(delta, activationConstraint.tolerance)) {\n          return this.handleCancel();\n        }\n      }\n\n      this.handlePending(activationConstraint, delta);\n      return;\n    }\n\n    if (event.cancelable) {\n      event.preventDefault();\n    }\n\n    onMove(coordinates);\n  }\n\n  handleEnd() {\n    const {\n      onAbort,\n      onEnd\n    } = this.props;\n    this.detach();\n\n    if (!this.activated) {\n      onAbort(this.props.active);\n    }\n\n    onEnd();\n  }\n\n  handleCancel() {\n    const {\n      onAbort,\n      onCancel\n    } = this.props;\n    this.detach();\n\n    if (!this.activated) {\n      onAbort(this.props.active);\n    }\n\n    onCancel();\n  }\n\n  handleKeydown(event) {\n    if (event.code === KeyboardCode.Esc) {\n      this.handleCancel();\n    }\n  }\n\n  removeTextSelection() {\n    var _this$document$getSel;\n\n    (_this$document$getSel = this.document.getSelection()) == null ? void 0 : _this$document$getSel.removeAllRanges();\n  }\n\n}\n\nconst events = {\n  cancel: {\n    name: 'pointercancel'\n  },\n  move: {\n    name: 'pointermove'\n  },\n  end: {\n    name: 'pointerup'\n  }\n};\nclass PointerSensor extends AbstractPointerSensor {\n  constructor(props) {\n    const {\n      event\n    } = props; // Pointer events stop firing if the target is unmounted while dragging\n    // Therefore we attach listeners to the owner document instead\n\n    const listenerTarget = getOwnerDocument(event.target);\n    super(props, events, listenerTarget);\n  }\n\n}\nPointerSensor.activators = [{\n  eventName: 'onPointerDown',\n  handler: (_ref, _ref2) => {\n    let {\n      nativeEvent: event\n    } = _ref;\n    let {\n      onActivation\n    } = _ref2;\n\n    if (!event.isPrimary || event.button !== 0) {\n      return false;\n    }\n\n    onActivation == null ? void 0 : onActivation({\n      event\n    });\n    return true;\n  }\n}];\n\nconst events$1 = {\n  move: {\n    name: 'mousemove'\n  },\n  end: {\n    name: 'mouseup'\n  }\n};\nvar MouseButton;\n\n(function (MouseButton) {\n  MouseButton[MouseButton[\"RightClick\"] = 2] = \"RightClick\";\n})(MouseButton || (MouseButton = {}));\n\nclass MouseSensor extends AbstractPointerSensor {\n  constructor(props) {\n    super(props, events$1, getOwnerDocument(props.event.target));\n  }\n\n}\nMouseSensor.activators = [{\n  eventName: 'onMouseDown',\n  handler: (_ref, _ref2) => {\n    let {\n      nativeEvent: event\n    } = _ref;\n    let {\n      onActivation\n    } = _ref2;\n\n    if (event.button === MouseButton.RightClick) {\n      return false;\n    }\n\n    onActivation == null ? void 0 : onActivation({\n      event\n    });\n    return true;\n  }\n}];\n\nconst events$2 = {\n  cancel: {\n    name: 'touchcancel'\n  },\n  move: {\n    name: 'touchmove'\n  },\n  end: {\n    name: 'touchend'\n  }\n};\nclass TouchSensor extends AbstractPointerSensor {\n  constructor(props) {\n    super(props, events$2);\n  }\n\n  static setup() {\n    // Adding a non-capture and non-passive `touchmove` listener in order\n    // to force `event.preventDefault()` calls to work in dynamically added\n    // touchmove event handlers. This is required for iOS Safari.\n    window.addEventListener(events$2.move.name, noop, {\n      capture: false,\n      passive: false\n    });\n    return function teardown() {\n      window.removeEventListener(events$2.move.name, noop);\n    }; // We create a new handler because the teardown function of another sensor\n    // could remove our event listener if we use a referentially equal listener.\n\n    function noop() {}\n  }\n\n}\nTouchSensor.activators = [{\n  eventName: 'onTouchStart',\n  handler: (_ref, _ref2) => {\n    let {\n      nativeEvent: event\n    } = _ref;\n    let {\n      onActivation\n    } = _ref2;\n    const {\n      touches\n    } = event;\n\n    if (touches.length > 1) {\n      return false;\n    }\n\n    onActivation == null ? void 0 : onActivation({\n      event\n    });\n    return true;\n  }\n}];\n\nvar AutoScrollActivator;\n\n(function (AutoScrollActivator) {\n  AutoScrollActivator[AutoScrollActivator[\"Pointer\"] = 0] = \"Pointer\";\n  AutoScrollActivator[AutoScrollActivator[\"DraggableRect\"] = 1] = \"DraggableRect\";\n})(AutoScrollActivator || (AutoScrollActivator = {}));\n\nvar TraversalOrder;\n\n(function (TraversalOrder) {\n  TraversalOrder[TraversalOrder[\"TreeOrder\"] = 0] = \"TreeOrder\";\n  TraversalOrder[TraversalOrder[\"ReversedTreeOrder\"] = 1] = \"ReversedTreeOrder\";\n})(TraversalOrder || (TraversalOrder = {}));\n\nfunction useAutoScroller(_ref) {\n  let {\n    acceleration,\n    activator = AutoScrollActivator.Pointer,\n    canScroll,\n    draggingRect,\n    enabled,\n    interval = 5,\n    order = TraversalOrder.TreeOrder,\n    pointerCoordinates,\n    scrollableAncestors,\n    scrollableAncestorRects,\n    delta,\n    threshold\n  } = _ref;\n  const scrollIntent = useScrollIntent({\n    delta,\n    disabled: !enabled\n  });\n  const [setAutoScrollInterval, clearAutoScrollInterval] = useInterval();\n  const scrollSpeed = useRef({\n    x: 0,\n    y: 0\n  });\n  const scrollDirection = useRef({\n    x: 0,\n    y: 0\n  });\n  const rect = useMemo(() => {\n    switch (activator) {\n      case AutoScrollActivator.Pointer:\n        return pointerCoordinates ? {\n          top: pointerCoordinates.y,\n          bottom: pointerCoordinates.y,\n          left: pointerCoordinates.x,\n          right: pointerCoordinates.x\n        } : null;\n\n      case AutoScrollActivator.DraggableRect:\n        return draggingRect;\n    }\n  }, [activator, draggingRect, pointerCoordinates]);\n  const scrollContainerRef = useRef(null);\n  const autoScroll = useCallback(() => {\n    const scrollContainer = scrollContainerRef.current;\n\n    if (!scrollContainer) {\n      return;\n    }\n\n    const scrollLeft = scrollSpeed.current.x * scrollDirection.current.x;\n    const scrollTop = scrollSpeed.current.y * scrollDirection.current.y;\n    scrollContainer.scrollBy(scrollLeft, scrollTop);\n  }, []);\n  const sortedScrollableAncestors = useMemo(() => order === TraversalOrder.TreeOrder ? [...scrollableAncestors].reverse() : scrollableAncestors, [order, scrollableAncestors]);\n  useEffect(() => {\n    if (!enabled || !scrollableAncestors.length || !rect) {\n      clearAutoScrollInterval();\n      return;\n    }\n\n    for (const scrollContainer of sortedScrollableAncestors) {\n      if ((canScroll == null ? void 0 : canScroll(scrollContainer)) === false) {\n        continue;\n      }\n\n      const index = scrollableAncestors.indexOf(scrollContainer);\n      const scrollContainerRect = scrollableAncestorRects[index];\n\n      if (!scrollContainerRect) {\n        continue;\n      }\n\n      const {\n        direction,\n        speed\n      } = getScrollDirectionAndSpeed(scrollContainer, scrollContainerRect, rect, acceleration, threshold);\n\n      for (const axis of ['x', 'y']) {\n        if (!scrollIntent[axis][direction[axis]]) {\n          speed[axis] = 0;\n          direction[axis] = 0;\n        }\n      }\n\n      if (speed.x > 0 || speed.y > 0) {\n        clearAutoScrollInterval();\n        scrollContainerRef.current = scrollContainer;\n        setAutoScrollInterval(autoScroll, interval);\n        scrollSpeed.current = speed;\n        scrollDirection.current = direction;\n        return;\n      }\n    }\n\n    scrollSpeed.current = {\n      x: 0,\n      y: 0\n    };\n    scrollDirection.current = {\n      x: 0,\n      y: 0\n    };\n    clearAutoScrollInterval();\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [acceleration, autoScroll, canScroll, clearAutoScrollInterval, enabled, interval, // eslint-disable-next-line react-hooks/exhaustive-deps\n  JSON.stringify(rect), // eslint-disable-next-line react-hooks/exhaustive-deps\n  JSON.stringify(scrollIntent), setAutoScrollInterval, scrollableAncestors, sortedScrollableAncestors, scrollableAncestorRects, // eslint-disable-next-line react-hooks/exhaustive-deps\n  JSON.stringify(threshold)]);\n}\nconst defaultScrollIntent = {\n  x: {\n    [Direction.Backward]: false,\n    [Direction.Forward]: false\n  },\n  y: {\n    [Direction.Backward]: false,\n    [Direction.Forward]: false\n  }\n};\n\nfunction useScrollIntent(_ref2) {\n  let {\n    delta,\n    disabled\n  } = _ref2;\n  const previousDelta = usePrevious(delta);\n  return useLazyMemo(previousIntent => {\n    if (disabled || !previousDelta || !previousIntent) {\n      // Reset scroll intent tracking when auto-scrolling is disabled\n      return defaultScrollIntent;\n    }\n\n    const direction = {\n      x: Math.sign(delta.x - previousDelta.x),\n      y: Math.sign(delta.y - previousDelta.y)\n    }; // Keep track of the user intent to scroll in each direction for both axis\n\n    return {\n      x: {\n        [Direction.Backward]: previousIntent.x[Direction.Backward] || direction.x === -1,\n        [Direction.Forward]: previousIntent.x[Direction.Forward] || direction.x === 1\n      },\n      y: {\n        [Direction.Backward]: previousIntent.y[Direction.Backward] || direction.y === -1,\n        [Direction.Forward]: previousIntent.y[Direction.Forward] || direction.y === 1\n      }\n    };\n  }, [disabled, delta, previousDelta]);\n}\n\nfunction useCachedNode(draggableNodes, id) {\n  const draggableNode = id != null ? draggableNodes.get(id) : undefined;\n  const node = draggableNode ? draggableNode.node.current : null;\n  return useLazyMemo(cachedNode => {\n    var _ref;\n\n    if (id == null) {\n      return null;\n    } // In some cases, the draggable node can unmount while dragging\n    // This is the case for virtualized lists. In those situations,\n    // we fall back to the last known value for that node.\n\n\n    return (_ref = node != null ? node : cachedNode) != null ? _ref : null;\n  }, [node, id]);\n}\n\nfunction useCombineActivators(sensors, getSyntheticHandler) {\n  return useMemo(() => sensors.reduce((accumulator, sensor) => {\n    const {\n      sensor: Sensor\n    } = sensor;\n    const sensorActivators = Sensor.activators.map(activator => ({\n      eventName: activator.eventName,\n      handler: getSyntheticHandler(activator.handler, sensor)\n    }));\n    return [...accumulator, ...sensorActivators];\n  }, []), [sensors, getSyntheticHandler]);\n}\n\nvar MeasuringStrategy;\n\n(function (MeasuringStrategy) {\n  MeasuringStrategy[MeasuringStrategy[\"Always\"] = 0] = \"Always\";\n  MeasuringStrategy[MeasuringStrategy[\"BeforeDragging\"] = 1] = \"BeforeDragging\";\n  MeasuringStrategy[MeasuringStrategy[\"WhileDragging\"] = 2] = \"WhileDragging\";\n})(MeasuringStrategy || (MeasuringStrategy = {}));\n\nvar MeasuringFrequency;\n\n(function (MeasuringFrequency) {\n  MeasuringFrequency[\"Optimized\"] = \"optimized\";\n})(MeasuringFrequency || (MeasuringFrequency = {}));\n\nconst defaultValue = /*#__PURE__*/new Map();\nfunction useDroppableMeasuring(containers, _ref) {\n  let {\n    dragging,\n    dependencies,\n    config\n  } = _ref;\n  const [queue, setQueue] = useState(null);\n  const {\n    frequency,\n    measure,\n    strategy\n  } = config;\n  const containersRef = useRef(containers);\n  const disabled = isDisabled();\n  const disabledRef = useLatestValue(disabled);\n  const measureDroppableContainers = useCallback(function (ids) {\n    if (ids === void 0) {\n      ids = [];\n    }\n\n    if (disabledRef.current) {\n      return;\n    }\n\n    setQueue(value => {\n      if (value === null) {\n        return ids;\n      }\n\n      return value.concat(ids.filter(id => !value.includes(id)));\n    });\n  }, [disabledRef]);\n  const timeoutId = useRef(null);\n  const droppableRects = useLazyMemo(previousValue => {\n    if (disabled && !dragging) {\n      return defaultValue;\n    }\n\n    if (!previousValue || previousValue === defaultValue || containersRef.current !== containers || queue != null) {\n      const map = new Map();\n\n      for (let container of containers) {\n        if (!container) {\n          continue;\n        }\n\n        if (queue && queue.length > 0 && !queue.includes(container.id) && container.rect.current) {\n          // This container does not need to be re-measured\n          map.set(container.id, container.rect.current);\n          continue;\n        }\n\n        const node = container.node.current;\n        const rect = node ? new Rect(measure(node), node) : null;\n        container.rect.current = rect;\n\n        if (rect) {\n          map.set(container.id, rect);\n        }\n      }\n\n      return map;\n    }\n\n    return previousValue;\n  }, [containers, queue, dragging, disabled, measure]);\n  useEffect(() => {\n    containersRef.current = containers;\n  }, [containers]);\n  useEffect(() => {\n    if (disabled) {\n      return;\n    }\n\n    measureDroppableContainers();\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [dragging, disabled]);\n  useEffect(() => {\n    if (queue && queue.length > 0) {\n      setQueue(null);\n    }\n  }, //eslint-disable-next-line react-hooks/exhaustive-deps\n  [JSON.stringify(queue)]);\n  useEffect(() => {\n    if (disabled || typeof frequency !== 'number' || timeoutId.current !== null) {\n      return;\n    }\n\n    timeoutId.current = setTimeout(() => {\n      measureDroppableContainers();\n      timeoutId.current = null;\n    }, frequency);\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [frequency, disabled, measureDroppableContainers, ...dependencies]);\n  return {\n    droppableRects,\n    measureDroppableContainers,\n    measuringScheduled: queue != null\n  };\n\n  function isDisabled() {\n    switch (strategy) {\n      case MeasuringStrategy.Always:\n        return false;\n\n      case MeasuringStrategy.BeforeDragging:\n        return dragging;\n\n      default:\n        return !dragging;\n    }\n  }\n}\n\nfunction useInitialValue(value, computeFn) {\n  return useLazyMemo(previousValue => {\n    if (!value) {\n      return null;\n    }\n\n    if (previousValue) {\n      return previousValue;\n    }\n\n    return typeof computeFn === 'function' ? computeFn(value) : value;\n  }, [computeFn, value]);\n}\n\nfunction useInitialRect(node, measure) {\n  return useInitialValue(node, measure);\n}\n\n/**\r\n * Returns a new MutationObserver instance.\r\n * If `MutationObserver` is undefined in the execution environment, returns `undefined`.\r\n */\n\nfunction useMutationObserver(_ref) {\n  let {\n    callback,\n    disabled\n  } = _ref;\n  const handleMutations = useEvent(callback);\n  const mutationObserver = useMemo(() => {\n    if (disabled || typeof window === 'undefined' || typeof window.MutationObserver === 'undefined') {\n      return undefined;\n    }\n\n    const {\n      MutationObserver\n    } = window;\n    return new MutationObserver(handleMutations);\n  }, [handleMutations, disabled]);\n  useEffect(() => {\n    return () => mutationObserver == null ? void 0 : mutationObserver.disconnect();\n  }, [mutationObserver]);\n  return mutationObserver;\n}\n\n/**\r\n * Returns a new ResizeObserver instance bound to the `onResize` callback.\r\n * If `ResizeObserver` is undefined in the execution environment, returns `undefined`.\r\n */\n\nfunction useResizeObserver(_ref) {\n  let {\n    callback,\n    disabled\n  } = _ref;\n  const handleResize = useEvent(callback);\n  const resizeObserver = useMemo(() => {\n    if (disabled || typeof window === 'undefined' || typeof window.ResizeObserver === 'undefined') {\n      return undefined;\n    }\n\n    const {\n      ResizeObserver\n    } = window;\n    return new ResizeObserver(handleResize);\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [disabled]);\n  useEffect(() => {\n    return () => resizeObserver == null ? void 0 : resizeObserver.disconnect();\n  }, [resizeObserver]);\n  return resizeObserver;\n}\n\nfunction defaultMeasure(element) {\n  return new Rect(getClientRect(element), element);\n}\n\nfunction useRect(element, measure, fallbackRect) {\n  if (measure === void 0) {\n    measure = defaultMeasure;\n  }\n\n  const [rect, setRect] = useState(null);\n\n  function measureRect() {\n    setRect(currentRect => {\n      if (!element) {\n        return null;\n      }\n\n      if (element.isConnected === false) {\n        var _ref;\n\n        // Fall back to last rect we measured if the element is\n        // no longer connected to the DOM.\n        return (_ref = currentRect != null ? currentRect : fallbackRect) != null ? _ref : null;\n      }\n\n      const newRect = measure(element);\n\n      if (JSON.stringify(currentRect) === JSON.stringify(newRect)) {\n        return currentRect;\n      }\n\n      return newRect;\n    });\n  }\n\n  const mutationObserver = useMutationObserver({\n    callback(records) {\n      if (!element) {\n        return;\n      }\n\n      for (const record of records) {\n        const {\n          type,\n          target\n        } = record;\n\n        if (type === 'childList' && target instanceof HTMLElement && target.contains(element)) {\n          measureRect();\n          break;\n        }\n      }\n    }\n\n  });\n  const resizeObserver = useResizeObserver({\n    callback: measureRect\n  });\n  useIsomorphicLayoutEffect(() => {\n    measureRect();\n\n    if (element) {\n      resizeObserver == null ? void 0 : resizeObserver.observe(element);\n      mutationObserver == null ? void 0 : mutationObserver.observe(document.body, {\n        childList: true,\n        subtree: true\n      });\n    } else {\n      resizeObserver == null ? void 0 : resizeObserver.disconnect();\n      mutationObserver == null ? void 0 : mutationObserver.disconnect();\n    }\n  }, [element]);\n  return rect;\n}\n\nfunction useRectDelta(rect) {\n  const initialRect = useInitialValue(rect);\n  return getRectDelta(rect, initialRect);\n}\n\nconst defaultValue$1 = [];\nfunction useScrollableAncestors(node) {\n  const previousNode = useRef(node);\n  const ancestors = useLazyMemo(previousValue => {\n    if (!node) {\n      return defaultValue$1;\n    }\n\n    if (previousValue && previousValue !== defaultValue$1 && node && previousNode.current && node.parentNode === previousNode.current.parentNode) {\n      return previousValue;\n    }\n\n    return getScrollableAncestors(node);\n  }, [node]);\n  useEffect(() => {\n    previousNode.current = node;\n  }, [node]);\n  return ancestors;\n}\n\nfunction useScrollOffsets(elements) {\n  const [scrollCoordinates, setScrollCoordinates] = useState(null);\n  const prevElements = useRef(elements); // To-do: Throttle the handleScroll callback\n\n  const handleScroll = useCallback(event => {\n    const scrollingElement = getScrollableElement(event.target);\n\n    if (!scrollingElement) {\n      return;\n    }\n\n    setScrollCoordinates(scrollCoordinates => {\n      if (!scrollCoordinates) {\n        return null;\n      }\n\n      scrollCoordinates.set(scrollingElement, getScrollCoordinates(scrollingElement));\n      return new Map(scrollCoordinates);\n    });\n  }, []);\n  useEffect(() => {\n    const previousElements = prevElements.current;\n\n    if (elements !== previousElements) {\n      cleanup(previousElements);\n      const entries = elements.map(element => {\n        const scrollableElement = getScrollableElement(element);\n\n        if (scrollableElement) {\n          scrollableElement.addEventListener('scroll', handleScroll, {\n            passive: true\n          });\n          return [scrollableElement, getScrollCoordinates(scrollableElement)];\n        }\n\n        return null;\n      }).filter(entry => entry != null);\n      setScrollCoordinates(entries.length ? new Map(entries) : null);\n      prevElements.current = elements;\n    }\n\n    return () => {\n      cleanup(elements);\n      cleanup(previousElements);\n    };\n\n    function cleanup(elements) {\n      elements.forEach(element => {\n        const scrollableElement = getScrollableElement(element);\n        scrollableElement == null ? void 0 : scrollableElement.removeEventListener('scroll', handleScroll);\n      });\n    }\n  }, [handleScroll, elements]);\n  return useMemo(() => {\n    if (elements.length) {\n      return scrollCoordinates ? Array.from(scrollCoordinates.values()).reduce((acc, coordinates) => add(acc, coordinates), defaultCoordinates) : getScrollOffsets(elements);\n    }\n\n    return defaultCoordinates;\n  }, [elements, scrollCoordinates]);\n}\n\nfunction useScrollOffsetsDelta(scrollOffsets, dependencies) {\n  if (dependencies === void 0) {\n    dependencies = [];\n  }\n\n  const initialScrollOffsets = useRef(null);\n  useEffect(() => {\n    initialScrollOffsets.current = null;\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  dependencies);\n  useEffect(() => {\n    const hasScrollOffsets = scrollOffsets !== defaultCoordinates;\n\n    if (hasScrollOffsets && !initialScrollOffsets.current) {\n      initialScrollOffsets.current = scrollOffsets;\n    }\n\n    if (!hasScrollOffsets && initialScrollOffsets.current) {\n      initialScrollOffsets.current = null;\n    }\n  }, [scrollOffsets]);\n  return initialScrollOffsets.current ? subtract(scrollOffsets, initialScrollOffsets.current) : defaultCoordinates;\n}\n\nfunction useSensorSetup(sensors) {\n  useEffect(() => {\n    if (!canUseDOM) {\n      return;\n    }\n\n    const teardownFns = sensors.map(_ref => {\n      let {\n        sensor\n      } = _ref;\n      return sensor.setup == null ? void 0 : sensor.setup();\n    });\n    return () => {\n      for (const teardown of teardownFns) {\n        teardown == null ? void 0 : teardown();\n      }\n    };\n  }, // TO-DO: Sensors length could theoretically change which would not be a valid dependency\n  // eslint-disable-next-line react-hooks/exhaustive-deps\n  sensors.map(_ref2 => {\n    let {\n      sensor\n    } = _ref2;\n    return sensor;\n  }));\n}\n\nfunction useSyntheticListeners(listeners, id) {\n  return useMemo(() => {\n    return listeners.reduce((acc, _ref) => {\n      let {\n        eventName,\n        handler\n      } = _ref;\n\n      acc[eventName] = event => {\n        handler(event, id);\n      };\n\n      return acc;\n    }, {});\n  }, [listeners, id]);\n}\n\nfunction useWindowRect(element) {\n  return useMemo(() => element ? getWindowClientRect(element) : null, [element]);\n}\n\nconst defaultValue$2 = [];\nfunction useRects(elements, measure) {\n  if (measure === void 0) {\n    measure = getClientRect;\n  }\n\n  const [firstElement] = elements;\n  const windowRect = useWindowRect(firstElement ? getWindow(firstElement) : null);\n  const [rects, setRects] = useState(defaultValue$2);\n\n  function measureRects() {\n    setRects(() => {\n      if (!elements.length) {\n        return defaultValue$2;\n      }\n\n      return elements.map(element => isDocumentScrollingElement(element) ? windowRect : new Rect(measure(element), element));\n    });\n  }\n\n  const resizeObserver = useResizeObserver({\n    callback: measureRects\n  });\n  useIsomorphicLayoutEffect(() => {\n    resizeObserver == null ? void 0 : resizeObserver.disconnect();\n    measureRects();\n    elements.forEach(element => resizeObserver == null ? void 0 : resizeObserver.observe(element));\n  }, [elements]);\n  return rects;\n}\n\nfunction getMeasurableNode(node) {\n  if (!node) {\n    return null;\n  }\n\n  if (node.children.length > 1) {\n    return node;\n  }\n\n  const firstChild = node.children[0];\n  return isHTMLElement(firstChild) ? firstChild : node;\n}\n\nfunction useDragOverlayMeasuring(_ref) {\n  let {\n    measure\n  } = _ref;\n  const [rect, setRect] = useState(null);\n  const handleResize = useCallback(entries => {\n    for (const {\n      target\n    } of entries) {\n      if (isHTMLElement(target)) {\n        setRect(rect => {\n          const newRect = measure(target);\n          return rect ? { ...rect,\n            width: newRect.width,\n            height: newRect.height\n          } : newRect;\n        });\n        break;\n      }\n    }\n  }, [measure]);\n  const resizeObserver = useResizeObserver({\n    callback: handleResize\n  });\n  const handleNodeChange = useCallback(element => {\n    const node = getMeasurableNode(element);\n    resizeObserver == null ? void 0 : resizeObserver.disconnect();\n\n    if (node) {\n      resizeObserver == null ? void 0 : resizeObserver.observe(node);\n    }\n\n    setRect(node ? measure(node) : null);\n  }, [measure, resizeObserver]);\n  const [nodeRef, setRef] = useNodeRef(handleNodeChange);\n  return useMemo(() => ({\n    nodeRef,\n    rect,\n    setRef\n  }), [rect, nodeRef, setRef]);\n}\n\nconst defaultSensors = [{\n  sensor: PointerSensor,\n  options: {}\n}, {\n  sensor: KeyboardSensor,\n  options: {}\n}];\nconst defaultData = {\n  current: {}\n};\nconst defaultMeasuringConfiguration = {\n  draggable: {\n    measure: getTransformAgnosticClientRect\n  },\n  droppable: {\n    measure: getTransformAgnosticClientRect,\n    strategy: MeasuringStrategy.WhileDragging,\n    frequency: MeasuringFrequency.Optimized\n  },\n  dragOverlay: {\n    measure: getClientRect\n  }\n};\n\nclass DroppableContainersMap extends Map {\n  get(id) {\n    var _super$get;\n\n    return id != null ? (_super$get = super.get(id)) != null ? _super$get : undefined : undefined;\n  }\n\n  toArray() {\n    return Array.from(this.values());\n  }\n\n  getEnabled() {\n    return this.toArray().filter(_ref => {\n      let {\n        disabled\n      } = _ref;\n      return !disabled;\n    });\n  }\n\n  getNodeFor(id) {\n    var _this$get$node$curren, _this$get;\n\n    return (_this$get$node$curren = (_this$get = this.get(id)) == null ? void 0 : _this$get.node.current) != null ? _this$get$node$curren : undefined;\n  }\n\n}\n\nconst defaultPublicContext = {\n  activatorEvent: null,\n  active: null,\n  activeNode: null,\n  activeNodeRect: null,\n  collisions: null,\n  containerNodeRect: null,\n  draggableNodes: /*#__PURE__*/new Map(),\n  droppableRects: /*#__PURE__*/new Map(),\n  droppableContainers: /*#__PURE__*/new DroppableContainersMap(),\n  over: null,\n  dragOverlay: {\n    nodeRef: {\n      current: null\n    },\n    rect: null,\n    setRef: noop\n  },\n  scrollableAncestors: [],\n  scrollableAncestorRects: [],\n  measuringConfiguration: defaultMeasuringConfiguration,\n  measureDroppableContainers: noop,\n  windowRect: null,\n  measuringScheduled: false\n};\nconst defaultInternalContext = {\n  activatorEvent: null,\n  activators: [],\n  active: null,\n  activeNodeRect: null,\n  ariaDescribedById: {\n    draggable: ''\n  },\n  dispatch: noop,\n  draggableNodes: /*#__PURE__*/new Map(),\n  over: null,\n  measureDroppableContainers: noop\n};\nconst InternalContext = /*#__PURE__*/createContext(defaultInternalContext);\nconst PublicContext = /*#__PURE__*/createContext(defaultPublicContext);\n\nfunction getInitialState() {\n  return {\n    draggable: {\n      active: null,\n      initialCoordinates: {\n        x: 0,\n        y: 0\n      },\n      nodes: new Map(),\n      translate: {\n        x: 0,\n        y: 0\n      }\n    },\n    droppable: {\n      containers: new DroppableContainersMap()\n    }\n  };\n}\nfunction reducer(state, action) {\n  switch (action.type) {\n    case Action.DragStart:\n      return { ...state,\n        draggable: { ...state.draggable,\n          initialCoordinates: action.initialCoordinates,\n          active: action.active\n        }\n      };\n\n    case Action.DragMove:\n      if (state.draggable.active == null) {\n        return state;\n      }\n\n      return { ...state,\n        draggable: { ...state.draggable,\n          translate: {\n            x: action.coordinates.x - state.draggable.initialCoordinates.x,\n            y: action.coordinates.y - state.draggable.initialCoordinates.y\n          }\n        }\n      };\n\n    case Action.DragEnd:\n    case Action.DragCancel:\n      return { ...state,\n        draggable: { ...state.draggable,\n          active: null,\n          initialCoordinates: {\n            x: 0,\n            y: 0\n          },\n          translate: {\n            x: 0,\n            y: 0\n          }\n        }\n      };\n\n    case Action.RegisterDroppable:\n      {\n        const {\n          element\n        } = action;\n        const {\n          id\n        } = element;\n        const containers = new DroppableContainersMap(state.droppable.containers);\n        containers.set(id, element);\n        return { ...state,\n          droppable: { ...state.droppable,\n            containers\n          }\n        };\n      }\n\n    case Action.SetDroppableDisabled:\n      {\n        const {\n          id,\n          key,\n          disabled\n        } = action;\n        const element = state.droppable.containers.get(id);\n\n        if (!element || key !== element.key) {\n          return state;\n        }\n\n        const containers = new DroppableContainersMap(state.droppable.containers);\n        containers.set(id, { ...element,\n          disabled\n        });\n        return { ...state,\n          droppable: { ...state.droppable,\n            containers\n          }\n        };\n      }\n\n    case Action.UnregisterDroppable:\n      {\n        const {\n          id,\n          key\n        } = action;\n        const element = state.droppable.containers.get(id);\n\n        if (!element || key !== element.key) {\n          return state;\n        }\n\n        const containers = new DroppableContainersMap(state.droppable.containers);\n        containers.delete(id);\n        return { ...state,\n          droppable: { ...state.droppable,\n            containers\n          }\n        };\n      }\n\n    default:\n      {\n        return state;\n      }\n  }\n}\n\nfunction RestoreFocus(_ref) {\n  let {\n    disabled\n  } = _ref;\n  const {\n    active,\n    activatorEvent,\n    draggableNodes\n  } = useContext(InternalContext);\n  const previousActivatorEvent = usePrevious(activatorEvent);\n  const previousActiveId = usePrevious(active == null ? void 0 : active.id); // Restore keyboard focus on the activator node\n\n  useEffect(() => {\n    if (disabled) {\n      return;\n    }\n\n    if (!activatorEvent && previousActivatorEvent && previousActiveId != null) {\n      if (!isKeyboardEvent(previousActivatorEvent)) {\n        return;\n      }\n\n      if (document.activeElement === previousActivatorEvent.target) {\n        // No need to restore focus\n        return;\n      }\n\n      const draggableNode = draggableNodes.get(previousActiveId);\n\n      if (!draggableNode) {\n        return;\n      }\n\n      const {\n        activatorNode,\n        node\n      } = draggableNode;\n\n      if (!activatorNode.current && !node.current) {\n        return;\n      }\n\n      requestAnimationFrame(() => {\n        for (const element of [activatorNode.current, node.current]) {\n          if (!element) {\n            continue;\n          }\n\n          const focusableNode = findFirstFocusableNode(element);\n\n          if (focusableNode) {\n            focusableNode.focus();\n            break;\n          }\n        }\n      });\n    }\n  }, [activatorEvent, disabled, draggableNodes, previousActiveId, previousActivatorEvent]);\n  return null;\n}\n\nfunction applyModifiers(modifiers, _ref) {\n  let {\n    transform,\n    ...args\n  } = _ref;\n  return modifiers != null && modifiers.length ? modifiers.reduce((accumulator, modifier) => {\n    return modifier({\n      transform: accumulator,\n      ...args\n    });\n  }, transform) : transform;\n}\n\nfunction useMeasuringConfiguration(config) {\n  return useMemo(() => ({\n    draggable: { ...defaultMeasuringConfiguration.draggable,\n      ...(config == null ? void 0 : config.draggable)\n    },\n    droppable: { ...defaultMeasuringConfiguration.droppable,\n      ...(config == null ? void 0 : config.droppable)\n    },\n    dragOverlay: { ...defaultMeasuringConfiguration.dragOverlay,\n      ...(config == null ? void 0 : config.dragOverlay)\n    }\n  }), // eslint-disable-next-line react-hooks/exhaustive-deps\n  [config == null ? void 0 : config.draggable, config == null ? void 0 : config.droppable, config == null ? void 0 : config.dragOverlay]);\n}\n\nfunction useLayoutShiftScrollCompensation(_ref) {\n  let {\n    activeNode,\n    measure,\n    initialRect,\n    config = true\n  } = _ref;\n  const initialized = useRef(false);\n  const {\n    x,\n    y\n  } = typeof config === 'boolean' ? {\n    x: config,\n    y: config\n  } : config;\n  useIsomorphicLayoutEffect(() => {\n    const disabled = !x && !y;\n\n    if (disabled || !activeNode) {\n      initialized.current = false;\n      return;\n    }\n\n    if (initialized.current || !initialRect) {\n      // Return early if layout shift scroll compensation was already attempted\n      // or if there is no initialRect to compare to.\n      return;\n    } // Get the most up to date node ref for the active draggable\n\n\n    const node = activeNode == null ? void 0 : activeNode.node.current;\n\n    if (!node || node.isConnected === false) {\n      // Return early if there is no attached node ref or if the node is\n      // disconnected from the document.\n      return;\n    }\n\n    const rect = measure(node);\n    const rectDelta = getRectDelta(rect, initialRect);\n\n    if (!x) {\n      rectDelta.x = 0;\n    }\n\n    if (!y) {\n      rectDelta.y = 0;\n    } // Only perform layout shift scroll compensation once\n\n\n    initialized.current = true;\n\n    if (Math.abs(rectDelta.x) > 0 || Math.abs(rectDelta.y) > 0) {\n      const firstScrollableAncestor = getFirstScrollableAncestor(node);\n\n      if (firstScrollableAncestor) {\n        firstScrollableAncestor.scrollBy({\n          top: rectDelta.y,\n          left: rectDelta.x\n        });\n      }\n    }\n  }, [activeNode, x, y, initialRect, measure]);\n}\n\nconst ActiveDraggableContext = /*#__PURE__*/createContext({ ...defaultCoordinates,\n  scaleX: 1,\n  scaleY: 1\n});\nvar Status;\n\n(function (Status) {\n  Status[Status[\"Uninitialized\"] = 0] = \"Uninitialized\";\n  Status[Status[\"Initializing\"] = 1] = \"Initializing\";\n  Status[Status[\"Initialized\"] = 2] = \"Initialized\";\n})(Status || (Status = {}));\n\nconst DndContext = /*#__PURE__*/memo(function DndContext(_ref) {\n  var _sensorContext$curren, _dragOverlay$nodeRef$, _dragOverlay$rect, _over$rect;\n\n  let {\n    id,\n    accessibility,\n    autoScroll = true,\n    children,\n    sensors = defaultSensors,\n    collisionDetection = rectIntersection,\n    measuring,\n    modifiers,\n    ...props\n  } = _ref;\n  const store = useReducer(reducer, undefined, getInitialState);\n  const [state, dispatch] = store;\n  const [dispatchMonitorEvent, registerMonitorListener] = useDndMonitorProvider();\n  const [status, setStatus] = useState(Status.Uninitialized);\n  const isInitialized = status === Status.Initialized;\n  const {\n    draggable: {\n      active: activeId,\n      nodes: draggableNodes,\n      translate\n    },\n    droppable: {\n      containers: droppableContainers\n    }\n  } = state;\n  const node = activeId != null ? draggableNodes.get(activeId) : null;\n  const activeRects = useRef({\n    initial: null,\n    translated: null\n  });\n  const active = useMemo(() => {\n    var _node$data;\n\n    return activeId != null ? {\n      id: activeId,\n      // It's possible for the active node to unmount while dragging\n      data: (_node$data = node == null ? void 0 : node.data) != null ? _node$data : defaultData,\n      rect: activeRects\n    } : null;\n  }, [activeId, node]);\n  const activeRef = useRef(null);\n  const [activeSensor, setActiveSensor] = useState(null);\n  const [activatorEvent, setActivatorEvent] = useState(null);\n  const latestProps = useLatestValue(props, Object.values(props));\n  const draggableDescribedById = useUniqueId(\"DndDescribedBy\", id);\n  const enabledDroppableContainers = useMemo(() => droppableContainers.getEnabled(), [droppableContainers]);\n  const measuringConfiguration = useMeasuringConfiguration(measuring);\n  const {\n    droppableRects,\n    measureDroppableContainers,\n    measuringScheduled\n  } = useDroppableMeasuring(enabledDroppableContainers, {\n    dragging: isInitialized,\n    dependencies: [translate.x, translate.y],\n    config: measuringConfiguration.droppable\n  });\n  const activeNode = useCachedNode(draggableNodes, activeId);\n  const activationCoordinates = useMemo(() => activatorEvent ? getEventCoordinates(activatorEvent) : null, [activatorEvent]);\n  const autoScrollOptions = getAutoScrollerOptions();\n  const initialActiveNodeRect = useInitialRect(activeNode, measuringConfiguration.draggable.measure);\n  useLayoutShiftScrollCompensation({\n    activeNode: activeId != null ? draggableNodes.get(activeId) : null,\n    config: autoScrollOptions.layoutShiftCompensation,\n    initialRect: initialActiveNodeRect,\n    measure: measuringConfiguration.draggable.measure\n  });\n  const activeNodeRect = useRect(activeNode, measuringConfiguration.draggable.measure, initialActiveNodeRect);\n  const containerNodeRect = useRect(activeNode ? activeNode.parentElement : null);\n  const sensorContext = useRef({\n    activatorEvent: null,\n    active: null,\n    activeNode,\n    collisionRect: null,\n    collisions: null,\n    droppableRects,\n    draggableNodes,\n    draggingNode: null,\n    draggingNodeRect: null,\n    droppableContainers,\n    over: null,\n    scrollableAncestors: [],\n    scrollAdjustedTranslate: null\n  });\n  const overNode = droppableContainers.getNodeFor((_sensorContext$curren = sensorContext.current.over) == null ? void 0 : _sensorContext$curren.id);\n  const dragOverlay = useDragOverlayMeasuring({\n    measure: measuringConfiguration.dragOverlay.measure\n  }); // Use the rect of the drag overlay if it is mounted\n\n  const draggingNode = (_dragOverlay$nodeRef$ = dragOverlay.nodeRef.current) != null ? _dragOverlay$nodeRef$ : activeNode;\n  const draggingNodeRect = isInitialized ? (_dragOverlay$rect = dragOverlay.rect) != null ? _dragOverlay$rect : activeNodeRect : null;\n  const usesDragOverlay = Boolean(dragOverlay.nodeRef.current && dragOverlay.rect); // The delta between the previous and new position of the draggable node\n  // is only relevant when there is no drag overlay\n\n  const nodeRectDelta = useRectDelta(usesDragOverlay ? null : activeNodeRect); // Get the window rect of the dragging node\n\n  const windowRect = useWindowRect(draggingNode ? getWindow(draggingNode) : null); // Get scrollable ancestors of the dragging node\n\n  const scrollableAncestors = useScrollableAncestors(isInitialized ? overNode != null ? overNode : activeNode : null);\n  const scrollableAncestorRects = useRects(scrollableAncestors); // Apply modifiers\n\n  const modifiedTranslate = applyModifiers(modifiers, {\n    transform: {\n      x: translate.x - nodeRectDelta.x,\n      y: translate.y - nodeRectDelta.y,\n      scaleX: 1,\n      scaleY: 1\n    },\n    activatorEvent,\n    active,\n    activeNodeRect,\n    containerNodeRect,\n    draggingNodeRect,\n    over: sensorContext.current.over,\n    overlayNodeRect: dragOverlay.rect,\n    scrollableAncestors,\n    scrollableAncestorRects,\n    windowRect\n  });\n  const pointerCoordinates = activationCoordinates ? add(activationCoordinates, translate) : null;\n  const scrollOffsets = useScrollOffsets(scrollableAncestors); // Represents the scroll delta since dragging was initiated\n\n  const scrollAdjustment = useScrollOffsetsDelta(scrollOffsets); // Represents the scroll delta since the last time the active node rect was measured\n\n  const activeNodeScrollDelta = useScrollOffsetsDelta(scrollOffsets, [activeNodeRect]);\n  const scrollAdjustedTranslate = add(modifiedTranslate, scrollAdjustment);\n  const collisionRect = draggingNodeRect ? getAdjustedRect(draggingNodeRect, modifiedTranslate) : null;\n  const collisions = active && collisionRect ? collisionDetection({\n    active,\n    collisionRect,\n    droppableRects,\n    droppableContainers: enabledDroppableContainers,\n    pointerCoordinates\n  }) : null;\n  const overId = getFirstCollision(collisions, 'id');\n  const [over, setOver] = useState(null); // When there is no drag overlay used, we need to account for the\n  // window scroll delta\n\n  const appliedTranslate = usesDragOverlay ? modifiedTranslate : add(modifiedTranslate, activeNodeScrollDelta);\n  const transform = adjustScale(appliedTranslate, (_over$rect = over == null ? void 0 : over.rect) != null ? _over$rect : null, activeNodeRect);\n  const activeSensorRef = useRef(null);\n  const instantiateSensor = useCallback((event, _ref2) => {\n    let {\n      sensor: Sensor,\n      options\n    } = _ref2;\n\n    if (activeRef.current == null) {\n      return;\n    }\n\n    const activeNode = draggableNodes.get(activeRef.current);\n\n    if (!activeNode) {\n      return;\n    }\n\n    const activatorEvent = event.nativeEvent;\n    const sensorInstance = new Sensor({\n      active: activeRef.current,\n      activeNode,\n      event: activatorEvent,\n      options,\n      // Sensors need to be instantiated with refs for arguments that change over time\n      // otherwise they are frozen in time with the stale arguments\n      context: sensorContext,\n\n      onAbort(id) {\n        const draggableNode = draggableNodes.get(id);\n\n        if (!draggableNode) {\n          return;\n        }\n\n        const {\n          onDragAbort\n        } = latestProps.current;\n        const event = {\n          id\n        };\n        onDragAbort == null ? void 0 : onDragAbort(event);\n        dispatchMonitorEvent({\n          type: 'onDragAbort',\n          event\n        });\n      },\n\n      onPending(id, constraint, initialCoordinates, offset) {\n        const draggableNode = draggableNodes.get(id);\n\n        if (!draggableNode) {\n          return;\n        }\n\n        const {\n          onDragPending\n        } = latestProps.current;\n        const event = {\n          id,\n          constraint,\n          initialCoordinates,\n          offset\n        };\n        onDragPending == null ? void 0 : onDragPending(event);\n        dispatchMonitorEvent({\n          type: 'onDragPending',\n          event\n        });\n      },\n\n      onStart(initialCoordinates) {\n        const id = activeRef.current;\n\n        if (id == null) {\n          return;\n        }\n\n        const draggableNode = draggableNodes.get(id);\n\n        if (!draggableNode) {\n          return;\n        }\n\n        const {\n          onDragStart\n        } = latestProps.current;\n        const event = {\n          activatorEvent,\n          active: {\n            id,\n            data: draggableNode.data,\n            rect: activeRects\n          }\n        };\n        unstable_batchedUpdates(() => {\n          onDragStart == null ? void 0 : onDragStart(event);\n          setStatus(Status.Initializing);\n          dispatch({\n            type: Action.DragStart,\n            initialCoordinates,\n            active: id\n          });\n          dispatchMonitorEvent({\n            type: 'onDragStart',\n            event\n          });\n          setActiveSensor(activeSensorRef.current);\n          setActivatorEvent(activatorEvent);\n        });\n      },\n\n      onMove(coordinates) {\n        dispatch({\n          type: Action.DragMove,\n          coordinates\n        });\n      },\n\n      onEnd: createHandler(Action.DragEnd),\n      onCancel: createHandler(Action.DragCancel)\n    });\n    activeSensorRef.current = sensorInstance;\n\n    function createHandler(type) {\n      return async function handler() {\n        const {\n          active,\n          collisions,\n          over,\n          scrollAdjustedTranslate\n        } = sensorContext.current;\n        let event = null;\n\n        if (active && scrollAdjustedTranslate) {\n          const {\n            cancelDrop\n          } = latestProps.current;\n          event = {\n            activatorEvent,\n            active: active,\n            collisions,\n            delta: scrollAdjustedTranslate,\n            over\n          };\n\n          if (type === Action.DragEnd && typeof cancelDrop === 'function') {\n            const shouldCancel = await Promise.resolve(cancelDrop(event));\n\n            if (shouldCancel) {\n              type = Action.DragCancel;\n            }\n          }\n        }\n\n        activeRef.current = null;\n        unstable_batchedUpdates(() => {\n          dispatch({\n            type\n          });\n          setStatus(Status.Uninitialized);\n          setOver(null);\n          setActiveSensor(null);\n          setActivatorEvent(null);\n          activeSensorRef.current = null;\n          const eventName = type === Action.DragEnd ? 'onDragEnd' : 'onDragCancel';\n\n          if (event) {\n            const handler = latestProps.current[eventName];\n            handler == null ? void 0 : handler(event);\n            dispatchMonitorEvent({\n              type: eventName,\n              event\n            });\n          }\n        });\n      };\n    }\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [draggableNodes]);\n  const bindActivatorToSensorInstantiator = useCallback((handler, sensor) => {\n    return (event, active) => {\n      const nativeEvent = event.nativeEvent;\n      const activeDraggableNode = draggableNodes.get(active);\n\n      if ( // Another sensor is already instantiating\n      activeRef.current !== null || // No active draggable\n      !activeDraggableNode || // Event has already been captured\n      nativeEvent.dndKit || nativeEvent.defaultPrevented) {\n        return;\n      }\n\n      const activationContext = {\n        active: activeDraggableNode\n      };\n      const shouldActivate = handler(event, sensor.options, activationContext);\n\n      if (shouldActivate === true) {\n        nativeEvent.dndKit = {\n          capturedBy: sensor.sensor\n        };\n        activeRef.current = active;\n        instantiateSensor(event, sensor);\n      }\n    };\n  }, [draggableNodes, instantiateSensor]);\n  const activators = useCombineActivators(sensors, bindActivatorToSensorInstantiator);\n  useSensorSetup(sensors);\n  useIsomorphicLayoutEffect(() => {\n    if (activeNodeRect && status === Status.Initializing) {\n      setStatus(Status.Initialized);\n    }\n  }, [activeNodeRect, status]);\n  useEffect(() => {\n    const {\n      onDragMove\n    } = latestProps.current;\n    const {\n      active,\n      activatorEvent,\n      collisions,\n      over\n    } = sensorContext.current;\n\n    if (!active || !activatorEvent) {\n      return;\n    }\n\n    const event = {\n      active,\n      activatorEvent,\n      collisions,\n      delta: {\n        x: scrollAdjustedTranslate.x,\n        y: scrollAdjustedTranslate.y\n      },\n      over\n    };\n    unstable_batchedUpdates(() => {\n      onDragMove == null ? void 0 : onDragMove(event);\n      dispatchMonitorEvent({\n        type: 'onDragMove',\n        event\n      });\n    });\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [scrollAdjustedTranslate.x, scrollAdjustedTranslate.y]);\n  useEffect(() => {\n    const {\n      active,\n      activatorEvent,\n      collisions,\n      droppableContainers,\n      scrollAdjustedTranslate\n    } = sensorContext.current;\n\n    if (!active || activeRef.current == null || !activatorEvent || !scrollAdjustedTranslate) {\n      return;\n    }\n\n    const {\n      onDragOver\n    } = latestProps.current;\n    const overContainer = droppableContainers.get(overId);\n    const over = overContainer && overContainer.rect.current ? {\n      id: overContainer.id,\n      rect: overContainer.rect.current,\n      data: overContainer.data,\n      disabled: overContainer.disabled\n    } : null;\n    const event = {\n      active,\n      activatorEvent,\n      collisions,\n      delta: {\n        x: scrollAdjustedTranslate.x,\n        y: scrollAdjustedTranslate.y\n      },\n      over\n    };\n    unstable_batchedUpdates(() => {\n      setOver(over);\n      onDragOver == null ? void 0 : onDragOver(event);\n      dispatchMonitorEvent({\n        type: 'onDragOver',\n        event\n      });\n    });\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [overId]);\n  useIsomorphicLayoutEffect(() => {\n    sensorContext.current = {\n      activatorEvent,\n      active,\n      activeNode,\n      collisionRect,\n      collisions,\n      droppableRects,\n      draggableNodes,\n      draggingNode,\n      draggingNodeRect,\n      droppableContainers,\n      over,\n      scrollableAncestors,\n      scrollAdjustedTranslate\n    };\n    activeRects.current = {\n      initial: draggingNodeRect,\n      translated: collisionRect\n    };\n  }, [active, activeNode, collisions, collisionRect, draggableNodes, draggingNode, draggingNodeRect, droppableRects, droppableContainers, over, scrollableAncestors, scrollAdjustedTranslate]);\n  useAutoScroller({ ...autoScrollOptions,\n    delta: translate,\n    draggingRect: collisionRect,\n    pointerCoordinates,\n    scrollableAncestors,\n    scrollableAncestorRects\n  });\n  const publicContext = useMemo(() => {\n    const context = {\n      active,\n      activeNode,\n      activeNodeRect,\n      activatorEvent,\n      collisions,\n      containerNodeRect,\n      dragOverlay,\n      draggableNodes,\n      droppableContainers,\n      droppableRects,\n      over,\n      measureDroppableContainers,\n      scrollableAncestors,\n      scrollableAncestorRects,\n      measuringConfiguration,\n      measuringScheduled,\n      windowRect\n    };\n    return context;\n  }, [active, activeNode, activeNodeRect, activatorEvent, collisions, containerNodeRect, dragOverlay, draggableNodes, droppableContainers, droppableRects, over, measureDroppableContainers, scrollableAncestors, scrollableAncestorRects, measuringConfiguration, measuringScheduled, windowRect]);\n  const internalContext = useMemo(() => {\n    const context = {\n      activatorEvent,\n      activators,\n      active,\n      activeNodeRect,\n      ariaDescribedById: {\n        draggable: draggableDescribedById\n      },\n      dispatch,\n      draggableNodes,\n      over,\n      measureDroppableContainers\n    };\n    return context;\n  }, [activatorEvent, activators, active, activeNodeRect, dispatch, draggableDescribedById, draggableNodes, over, measureDroppableContainers]);\n  return React.createElement(DndMonitorContext.Provider, {\n    value: registerMonitorListener\n  }, React.createElement(InternalContext.Provider, {\n    value: internalContext\n  }, React.createElement(PublicContext.Provider, {\n    value: publicContext\n  }, React.createElement(ActiveDraggableContext.Provider, {\n    value: transform\n  }, children)), React.createElement(RestoreFocus, {\n    disabled: (accessibility == null ? void 0 : accessibility.restoreFocus) === false\n  })), React.createElement(Accessibility, { ...accessibility,\n    hiddenTextDescribedById: draggableDescribedById\n  }));\n\n  function getAutoScrollerOptions() {\n    const activeSensorDisablesAutoscroll = (activeSensor == null ? void 0 : activeSensor.autoScrollEnabled) === false;\n    const autoScrollGloballyDisabled = typeof autoScroll === 'object' ? autoScroll.enabled === false : autoScroll === false;\n    const enabled = isInitialized && !activeSensorDisablesAutoscroll && !autoScrollGloballyDisabled;\n\n    if (typeof autoScroll === 'object') {\n      return { ...autoScroll,\n        enabled\n      };\n    }\n\n    return {\n      enabled\n    };\n  }\n});\n\nconst NullContext = /*#__PURE__*/createContext(null);\nconst defaultRole = 'button';\nconst ID_PREFIX = 'Draggable';\nfunction useDraggable(_ref) {\n  let {\n    id,\n    data,\n    disabled = false,\n    attributes\n  } = _ref;\n  const key = useUniqueId(ID_PREFIX);\n  const {\n    activators,\n    activatorEvent,\n    active,\n    activeNodeRect,\n    ariaDescribedById,\n    draggableNodes,\n    over\n  } = useContext(InternalContext);\n  const {\n    role = defaultRole,\n    roleDescription = 'draggable',\n    tabIndex = 0\n  } = attributes != null ? attributes : {};\n  const isDragging = (active == null ? void 0 : active.id) === id;\n  const transform = useContext(isDragging ? ActiveDraggableContext : NullContext);\n  const [node, setNodeRef] = useNodeRef();\n  const [activatorNode, setActivatorNodeRef] = useNodeRef();\n  const listeners = useSyntheticListeners(activators, id);\n  const dataRef = useLatestValue(data);\n  useIsomorphicLayoutEffect(() => {\n    draggableNodes.set(id, {\n      id,\n      key,\n      node,\n      activatorNode,\n      data: dataRef\n    });\n    return () => {\n      const node = draggableNodes.get(id);\n\n      if (node && node.key === key) {\n        draggableNodes.delete(id);\n      }\n    };\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [draggableNodes, id]);\n  const memoizedAttributes = useMemo(() => ({\n    role,\n    tabIndex,\n    'aria-disabled': disabled,\n    'aria-pressed': isDragging && role === defaultRole ? true : undefined,\n    'aria-roledescription': roleDescription,\n    'aria-describedby': ariaDescribedById.draggable\n  }), [disabled, role, tabIndex, isDragging, roleDescription, ariaDescribedById.draggable]);\n  return {\n    active,\n    activatorEvent,\n    activeNodeRect,\n    attributes: memoizedAttributes,\n    isDragging,\n    listeners: disabled ? undefined : listeners,\n    node,\n    over,\n    setNodeRef,\n    setActivatorNodeRef,\n    transform\n  };\n}\n\nfunction useDndContext() {\n  return useContext(PublicContext);\n}\n\nconst ID_PREFIX$1 = 'Droppable';\nconst defaultResizeObserverConfig = {\n  timeout: 25\n};\nfunction useDroppable(_ref) {\n  let {\n    data,\n    disabled = false,\n    id,\n    resizeObserverConfig\n  } = _ref;\n  const key = useUniqueId(ID_PREFIX$1);\n  const {\n    active,\n    dispatch,\n    over,\n    measureDroppableContainers\n  } = useContext(InternalContext);\n  const previous = useRef({\n    disabled\n  });\n  const resizeObserverConnected = useRef(false);\n  const rect = useRef(null);\n  const callbackId = useRef(null);\n  const {\n    disabled: resizeObserverDisabled,\n    updateMeasurementsFor,\n    timeout: resizeObserverTimeout\n  } = { ...defaultResizeObserverConfig,\n    ...resizeObserverConfig\n  };\n  const ids = useLatestValue(updateMeasurementsFor != null ? updateMeasurementsFor : id);\n  const handleResize = useCallback(() => {\n    if (!resizeObserverConnected.current) {\n      // ResizeObserver invokes the `handleResize` callback as soon as `observe` is called,\n      // assuming the element is rendered and displayed.\n      resizeObserverConnected.current = true;\n      return;\n    }\n\n    if (callbackId.current != null) {\n      clearTimeout(callbackId.current);\n    }\n\n    callbackId.current = setTimeout(() => {\n      measureDroppableContainers(Array.isArray(ids.current) ? ids.current : [ids.current]);\n      callbackId.current = null;\n    }, resizeObserverTimeout);\n  }, //eslint-disable-next-line react-hooks/exhaustive-deps\n  [resizeObserverTimeout]);\n  const resizeObserver = useResizeObserver({\n    callback: handleResize,\n    disabled: resizeObserverDisabled || !active\n  });\n  const handleNodeChange = useCallback((newElement, previousElement) => {\n    if (!resizeObserver) {\n      return;\n    }\n\n    if (previousElement) {\n      resizeObserver.unobserve(previousElement);\n      resizeObserverConnected.current = false;\n    }\n\n    if (newElement) {\n      resizeObserver.observe(newElement);\n    }\n  }, [resizeObserver]);\n  const [nodeRef, setNodeRef] = useNodeRef(handleNodeChange);\n  const dataRef = useLatestValue(data);\n  useEffect(() => {\n    if (!resizeObserver || !nodeRef.current) {\n      return;\n    }\n\n    resizeObserver.disconnect();\n    resizeObserverConnected.current = false;\n    resizeObserver.observe(nodeRef.current);\n  }, [nodeRef, resizeObserver]);\n  useEffect(() => {\n    dispatch({\n      type: Action.RegisterDroppable,\n      element: {\n        id,\n        key,\n        disabled,\n        node: nodeRef,\n        rect,\n        data: dataRef\n      }\n    });\n    return () => dispatch({\n      type: Action.UnregisterDroppable,\n      key,\n      id\n    });\n  }, // eslint-disable-next-line react-hooks/exhaustive-deps\n  [id]);\n  useEffect(() => {\n    if (disabled !== previous.current.disabled) {\n      dispatch({\n        type: Action.SetDroppableDisabled,\n        id,\n        key,\n        disabled\n      });\n      previous.current.disabled = disabled;\n    }\n  }, [id, key, disabled, dispatch]);\n  return {\n    active,\n    rect,\n    isOver: (over == null ? void 0 : over.id) === id,\n    node: nodeRef,\n    over,\n    setNodeRef\n  };\n}\n\nfunction AnimationManager(_ref) {\n  let {\n    animation,\n    children\n  } = _ref;\n  const [clonedChildren, setClonedChildren] = useState(null);\n  const [element, setElement] = useState(null);\n  const previousChildren = usePrevious(children);\n\n  if (!children && !clonedChildren && previousChildren) {\n    setClonedChildren(previousChildren);\n  }\n\n  useIsomorphicLayoutEffect(() => {\n    if (!element) {\n      return;\n    }\n\n    const key = clonedChildren == null ? void 0 : clonedChildren.key;\n    const id = clonedChildren == null ? void 0 : clonedChildren.props.id;\n\n    if (key == null || id == null) {\n      setClonedChildren(null);\n      return;\n    }\n\n    Promise.resolve(animation(id, element)).then(() => {\n      setClonedChildren(null);\n    });\n  }, [animation, clonedChildren, element]);\n  return React.createElement(React.Fragment, null, children, clonedChildren ? cloneElement(clonedChildren, {\n    ref: setElement\n  }) : null);\n}\n\nconst defaultTransform = {\n  x: 0,\n  y: 0,\n  scaleX: 1,\n  scaleY: 1\n};\nfunction NullifiedContextProvider(_ref) {\n  let {\n    children\n  } = _ref;\n  return React.createElement(InternalContext.Provider, {\n    value: defaultInternalContext\n  }, React.createElement(ActiveDraggableContext.Provider, {\n    value: defaultTransform\n  }, children));\n}\n\nconst baseStyles = {\n  position: 'fixed',\n  touchAction: 'none'\n};\n\nconst defaultTransition = activatorEvent => {\n  const isKeyboardActivator = isKeyboardEvent(activatorEvent);\n  return isKeyboardActivator ? 'transform 250ms ease' : undefined;\n};\n\nconst PositionedOverlay = /*#__PURE__*/forwardRef((_ref, ref) => {\n  let {\n    as,\n    activatorEvent,\n    adjustScale,\n    children,\n    className,\n    rect,\n    style,\n    transform,\n    transition = defaultTransition\n  } = _ref;\n\n  if (!rect) {\n    return null;\n  }\n\n  const scaleAdjustedTransform = adjustScale ? transform : { ...transform,\n    scaleX: 1,\n    scaleY: 1\n  };\n  const styles = { ...baseStyles,\n    width: rect.width,\n    height: rect.height,\n    top: rect.top,\n    left: rect.left,\n    transform: CSS.Transform.toString(scaleAdjustedTransform),\n    transformOrigin: adjustScale && activatorEvent ? getRelativeTransformOrigin(activatorEvent, rect) : undefined,\n    transition: typeof transition === 'function' ? transition(activatorEvent) : transition,\n    ...style\n  };\n  return React.createElement(as, {\n    className,\n    style: styles,\n    ref\n  }, children);\n});\n\nconst defaultDropAnimationSideEffects = options => _ref => {\n  let {\n    active,\n    dragOverlay\n  } = _ref;\n  const originalStyles = {};\n  const {\n    styles,\n    className\n  } = options;\n\n  if (styles != null && styles.active) {\n    for (const [key, value] of Object.entries(styles.active)) {\n      if (value === undefined) {\n        continue;\n      }\n\n      originalStyles[key] = active.node.style.getPropertyValue(key);\n      active.node.style.setProperty(key, value);\n    }\n  }\n\n  if (styles != null && styles.dragOverlay) {\n    for (const [key, value] of Object.entries(styles.dragOverlay)) {\n      if (value === undefined) {\n        continue;\n      }\n\n      dragOverlay.node.style.setProperty(key, value);\n    }\n  }\n\n  if (className != null && className.active) {\n    active.node.classList.add(className.active);\n  }\n\n  if (className != null && className.dragOverlay) {\n    dragOverlay.node.classList.add(className.dragOverlay);\n  }\n\n  return function cleanup() {\n    for (const [key, value] of Object.entries(originalStyles)) {\n      active.node.style.setProperty(key, value);\n    }\n\n    if (className != null && className.active) {\n      active.node.classList.remove(className.active);\n    }\n  };\n};\n\nconst defaultKeyframeResolver = _ref2 => {\n  let {\n    transform: {\n      initial,\n      final\n    }\n  } = _ref2;\n  return [{\n    transform: CSS.Transform.toString(initial)\n  }, {\n    transform: CSS.Transform.toString(final)\n  }];\n};\n\nconst defaultDropAnimationConfiguration = {\n  duration: 250,\n  easing: 'ease',\n  keyframes: defaultKeyframeResolver,\n  sideEffects: /*#__PURE__*/defaultDropAnimationSideEffects({\n    styles: {\n      active: {\n        opacity: '0'\n      }\n    }\n  })\n};\nfunction useDropAnimation(_ref3) {\n  let {\n    config,\n    draggableNodes,\n    droppableContainers,\n    measuringConfiguration\n  } = _ref3;\n  return useEvent((id, node) => {\n    if (config === null) {\n      return;\n    }\n\n    const activeDraggable = draggableNodes.get(id);\n\n    if (!activeDraggable) {\n      return;\n    }\n\n    const activeNode = activeDraggable.node.current;\n\n    if (!activeNode) {\n      return;\n    }\n\n    const measurableNode = getMeasurableNode(node);\n\n    if (!measurableNode) {\n      return;\n    }\n\n    const {\n      transform\n    } = getWindow(node).getComputedStyle(node);\n    const parsedTransform = parseTransform(transform);\n\n    if (!parsedTransform) {\n      return;\n    }\n\n    const animation = typeof config === 'function' ? config : createDefaultDropAnimation(config);\n    scrollIntoViewIfNeeded(activeNode, measuringConfiguration.draggable.measure);\n    return animation({\n      active: {\n        id,\n        data: activeDraggable.data,\n        node: activeNode,\n        rect: measuringConfiguration.draggable.measure(activeNode)\n      },\n      draggableNodes,\n      dragOverlay: {\n        node,\n        rect: measuringConfiguration.dragOverlay.measure(measurableNode)\n      },\n      droppableContainers,\n      measuringConfiguration,\n      transform: parsedTransform\n    });\n  });\n}\n\nfunction createDefaultDropAnimation(options) {\n  const {\n    duration,\n    easing,\n    sideEffects,\n    keyframes\n  } = { ...defaultDropAnimationConfiguration,\n    ...options\n  };\n  return _ref4 => {\n    let {\n      active,\n      dragOverlay,\n      transform,\n      ...rest\n    } = _ref4;\n\n    if (!duration) {\n      // Do not animate if animation duration is zero.\n      return;\n    }\n\n    const delta = {\n      x: dragOverlay.rect.left - active.rect.left,\n      y: dragOverlay.rect.top - active.rect.top\n    };\n    const scale = {\n      scaleX: transform.scaleX !== 1 ? active.rect.width * transform.scaleX / dragOverlay.rect.width : 1,\n      scaleY: transform.scaleY !== 1 ? active.rect.height * transform.scaleY / dragOverlay.rect.height : 1\n    };\n    const finalTransform = {\n      x: transform.x - delta.x,\n      y: transform.y - delta.y,\n      ...scale\n    };\n    const animationKeyframes = keyframes({ ...rest,\n      active,\n      dragOverlay,\n      transform: {\n        initial: transform,\n        final: finalTransform\n      }\n    });\n    const [firstKeyframe] = animationKeyframes;\n    const lastKeyframe = animationKeyframes[animationKeyframes.length - 1];\n\n    if (JSON.stringify(firstKeyframe) === JSON.stringify(lastKeyframe)) {\n      // The start and end keyframes are the same, infer that there is no animation needed.\n      return;\n    }\n\n    const cleanup = sideEffects == null ? void 0 : sideEffects({\n      active,\n      dragOverlay,\n      ...rest\n    });\n    const animation = dragOverlay.node.animate(animationKeyframes, {\n      duration,\n      easing,\n      fill: 'forwards'\n    });\n    return new Promise(resolve => {\n      animation.onfinish = () => {\n        cleanup == null ? void 0 : cleanup();\n        resolve();\n      };\n    });\n  };\n}\n\nlet key = 0;\nfunction useKey(id) {\n  return useMemo(() => {\n    if (id == null) {\n      return;\n    }\n\n    key++;\n    return key;\n  }, [id]);\n}\n\nconst DragOverlay = /*#__PURE__*/React.memo(_ref => {\n  let {\n    adjustScale = false,\n    children,\n    dropAnimation: dropAnimationConfig,\n    style,\n    transition,\n    modifiers,\n    wrapperElement = 'div',\n    className,\n    zIndex = 999\n  } = _ref;\n  const {\n    activatorEvent,\n    active,\n    activeNodeRect,\n    containerNodeRect,\n    draggableNodes,\n    droppableContainers,\n    dragOverlay,\n    over,\n    measuringConfiguration,\n    scrollableAncestors,\n    scrollableAncestorRects,\n    windowRect\n  } = useDndContext();\n  const transform = useContext(ActiveDraggableContext);\n  const key = useKey(active == null ? void 0 : active.id);\n  const modifiedTransform = applyModifiers(modifiers, {\n    activatorEvent,\n    active,\n    activeNodeRect,\n    containerNodeRect,\n    draggingNodeRect: dragOverlay.rect,\n    over,\n    overlayNodeRect: dragOverlay.rect,\n    scrollableAncestors,\n    scrollableAncestorRects,\n    transform,\n    windowRect\n  });\n  const initialRect = useInitialValue(activeNodeRect);\n  const dropAnimation = useDropAnimation({\n    config: dropAnimationConfig,\n    draggableNodes,\n    droppableContainers,\n    measuringConfiguration\n  }); // We need to wait for the active node to be measured before connecting the drag overlay ref\n  // otherwise collisions can be computed against a mispositioned drag overlay\n\n  const ref = initialRect ? dragOverlay.setRef : undefined;\n  return React.createElement(NullifiedContextProvider, null, React.createElement(AnimationManager, {\n    animation: dropAnimation\n  }, active && key ? React.createElement(PositionedOverlay, {\n    key: key,\n    id: active.id,\n    ref: ref,\n    as: wrapperElement,\n    activatorEvent: activatorEvent,\n    adjustScale: adjustScale,\n    className: className,\n    transition: transition,\n    rect: initialRect,\n    style: {\n      zIndex,\n      ...style\n    },\n    transform: modifiedTransform\n  }, children) : null));\n});\n\nexport { AutoScrollActivator, DndContext, DragOverlay, KeyboardCode, KeyboardSensor, MeasuringFrequency, MeasuringStrategy, MouseSensor, PointerSensor, TouchSensor, TraversalOrder, applyModifiers, closestCenter, closestCorners, defaultAnnouncements, defaultCoordinates, defaultDropAnimationConfiguration as defaultDropAnimation, defaultDropAnimationSideEffects, defaultKeyboardCoordinateGetter, defaultScreenReaderInstructions, getClientRect, getFirstCollision, getScrollableAncestors, pointerWithin, rectIntersection, useDndContext, useDndMonitor, useDraggable, useDroppable, useSensor, useSensors };\n//# sourceMappingURL=core.esm.js.map\n","let barycenter = require(\"./barycenter\");\nlet resolveConflicts = require(\"./resolve-conflicts\");\nlet sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  let movable = g.children(v);\n  let node = g.node(v);\n  let bl = node ? node.borderLeft : undefined;\n  let br = node ? node.borderRight: undefined;\n  let subgraphs = {};\n\n  if (bl) {\n    movable = movable.filter(w => w !== bl && w !== br);\n  }\n\n  let barycenters = barycenter(g, movable);\n  barycenters.forEach(entry => {\n    if (g.children(entry.v).length) {\n      let subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (subgraphResult.hasOwnProperty(\"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  let entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  let result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = [bl, result.vs, br].flat(true);\n    if (g.predecessors(bl).length) {\n      let blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!result.hasOwnProperty(\"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  entries.forEach(entry => {\n    entry.vs = entry.vs.flatMap(v => {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    });\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (target.barycenter !== undefined) {\n    target.barycenter = (target.barycenter * target.weight +\n                         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","module.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = () => 1;\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\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 _objectSpread from \"@babel/runtime/helpers/objectSpread2\";\nimport { http } from \"@next-core/http\";\n/**\n * @description 查出与指定模型有直接关联的模型\n * @endpoint GET /object_ref\n */\nexport var CmdbObjectApi_getObjectRef = (params, options) => /**! @contract easyops.api.cmdb.cmdb_object.GetObjectRef@1.1.0 */http.get(\"api/gateway/cmdb.cmdb_object.GetObjectRef/object_ref\", _objectSpread(_objectSpread({}, options), {}, {\n  params\n}));\n//# sourceMappingURL=getObjectRef.js.map","import React, { useMemo, useRef, useEffect, useState, useContext } from 'react';\nimport { useDndContext, getClientRect, useDroppable, useDraggable, closestCorners, getFirstCollision, getScrollableAncestors, KeyboardCode } from '@dnd-kit/core';\nimport { useUniqueId, useIsomorphicLayoutEffect, CSS, useCombinedRefs, isKeyboardEvent, subtract } from '@dnd-kit/utilities';\n\n/**\r\n * Move an array item to a different position. Returns a new array with the item moved to the new position.\r\n */\nfunction arrayMove(array, from, to) {\n  const newArray = array.slice();\n  newArray.splice(to < 0 ? newArray.length + to : to, 0, newArray.splice(from, 1)[0]);\n  return newArray;\n}\n\n/**\r\n * Swap an array item to a different position. Returns a new array with the item swapped to the new position.\r\n */\nfunction arraySwap(array, from, to) {\n  const newArray = array.slice();\n  newArray[from] = array[to];\n  newArray[to] = array[from];\n  return newArray;\n}\n\nfunction getSortedRects(items, rects) {\n  return items.reduce((accumulator, id, index) => {\n    const rect = rects.get(id);\n\n    if (rect) {\n      accumulator[index] = rect;\n    }\n\n    return accumulator;\n  }, Array(items.length));\n}\n\nfunction isValidIndex(index) {\n  return index !== null && index >= 0;\n}\n\nfunction itemsEqual(a, b) {\n  if (a === b) {\n    return true;\n  }\n\n  if (a.length !== b.length) {\n    return false;\n  }\n\n  for (let i = 0; i < a.length; i++) {\n    if (a[i] !== b[i]) {\n      return false;\n    }\n  }\n\n  return true;\n}\n\nfunction normalizeDisabled(disabled) {\n  if (typeof disabled === 'boolean') {\n    return {\n      draggable: disabled,\n      droppable: disabled\n    };\n  }\n\n  return disabled;\n}\n\n// To-do: We should be calculating scale transformation\nconst defaultScale = {\n  scaleX: 1,\n  scaleY: 1\n};\nconst horizontalListSortingStrategy = _ref => {\n  var _rects$activeIndex;\n\n  let {\n    rects,\n    activeNodeRect: fallbackActiveRect,\n    activeIndex,\n    overIndex,\n    index\n  } = _ref;\n  const activeNodeRect = (_rects$activeIndex = rects[activeIndex]) != null ? _rects$activeIndex : fallbackActiveRect;\n\n  if (!activeNodeRect) {\n    return null;\n  }\n\n  const itemGap = getItemGap(rects, index, activeIndex);\n\n  if (index === activeIndex) {\n    const newIndexRect = rects[overIndex];\n\n    if (!newIndexRect) {\n      return null;\n    }\n\n    return {\n      x: activeIndex < overIndex ? newIndexRect.left + newIndexRect.width - (activeNodeRect.left + activeNodeRect.width) : newIndexRect.left - activeNodeRect.left,\n      y: 0,\n      ...defaultScale\n    };\n  }\n\n  if (index > activeIndex && index <= overIndex) {\n    return {\n      x: -activeNodeRect.width - itemGap,\n      y: 0,\n      ...defaultScale\n    };\n  }\n\n  if (index < activeIndex && index >= overIndex) {\n    return {\n      x: activeNodeRect.width + itemGap,\n      y: 0,\n      ...defaultScale\n    };\n  }\n\n  return {\n    x: 0,\n    y: 0,\n    ...defaultScale\n  };\n};\n\nfunction getItemGap(rects, index, activeIndex) {\n  const currentRect = rects[index];\n  const previousRect = rects[index - 1];\n  const nextRect = rects[index + 1];\n\n  if (!currentRect || !previousRect && !nextRect) {\n    return 0;\n  }\n\n  if (activeIndex < index) {\n    return previousRect ? currentRect.left - (previousRect.left + previousRect.width) : nextRect.left - (currentRect.left + currentRect.width);\n  }\n\n  return nextRect ? nextRect.left - (currentRect.left + currentRect.width) : currentRect.left - (previousRect.left + previousRect.width);\n}\n\nconst rectSortingStrategy = _ref => {\n  let {\n    rects,\n    activeIndex,\n    overIndex,\n    index\n  } = _ref;\n  const newRects = arrayMove(rects, overIndex, activeIndex);\n  const oldRect = rects[index];\n  const newRect = newRects[index];\n\n  if (!newRect || !oldRect) {\n    return null;\n  }\n\n  return {\n    x: newRect.left - oldRect.left,\n    y: newRect.top - oldRect.top,\n    scaleX: newRect.width / oldRect.width,\n    scaleY: newRect.height / oldRect.height\n  };\n};\n\nconst rectSwappingStrategy = _ref => {\n  let {\n    activeIndex,\n    index,\n    rects,\n    overIndex\n  } = _ref;\n  let oldRect;\n  let newRect;\n\n  if (index === activeIndex) {\n    oldRect = rects[index];\n    newRect = rects[overIndex];\n  }\n\n  if (index === overIndex) {\n    oldRect = rects[index];\n    newRect = rects[activeIndex];\n  }\n\n  if (!newRect || !oldRect) {\n    return null;\n  }\n\n  return {\n    x: newRect.left - oldRect.left,\n    y: newRect.top - oldRect.top,\n    scaleX: newRect.width / oldRect.width,\n    scaleY: newRect.height / oldRect.height\n  };\n};\n\n// To-do: We should be calculating scale transformation\nconst defaultScale$1 = {\n  scaleX: 1,\n  scaleY: 1\n};\nconst verticalListSortingStrategy = _ref => {\n  var _rects$activeIndex;\n\n  let {\n    activeIndex,\n    activeNodeRect: fallbackActiveRect,\n    index,\n    rects,\n    overIndex\n  } = _ref;\n  const activeNodeRect = (_rects$activeIndex = rects[activeIndex]) != null ? _rects$activeIndex : fallbackActiveRect;\n\n  if (!activeNodeRect) {\n    return null;\n  }\n\n  if (index === activeIndex) {\n    const overIndexRect = rects[overIndex];\n\n    if (!overIndexRect) {\n      return null;\n    }\n\n    return {\n      x: 0,\n      y: activeIndex < overIndex ? overIndexRect.top + overIndexRect.height - (activeNodeRect.top + activeNodeRect.height) : overIndexRect.top - activeNodeRect.top,\n      ...defaultScale$1\n    };\n  }\n\n  const itemGap = getItemGap$1(rects, index, activeIndex);\n\n  if (index > activeIndex && index <= overIndex) {\n    return {\n      x: 0,\n      y: -activeNodeRect.height - itemGap,\n      ...defaultScale$1\n    };\n  }\n\n  if (index < activeIndex && index >= overIndex) {\n    return {\n      x: 0,\n      y: activeNodeRect.height + itemGap,\n      ...defaultScale$1\n    };\n  }\n\n  return {\n    x: 0,\n    y: 0,\n    ...defaultScale$1\n  };\n};\n\nfunction getItemGap$1(clientRects, index, activeIndex) {\n  const currentRect = clientRects[index];\n  const previousRect = clientRects[index - 1];\n  const nextRect = clientRects[index + 1];\n\n  if (!currentRect) {\n    return 0;\n  }\n\n  if (activeIndex < index) {\n    return previousRect ? currentRect.top - (previousRect.top + previousRect.height) : nextRect ? nextRect.top - (currentRect.top + currentRect.height) : 0;\n  }\n\n  return nextRect ? nextRect.top - (currentRect.top + currentRect.height) : previousRect ? currentRect.top - (previousRect.top + previousRect.height) : 0;\n}\n\nconst ID_PREFIX = 'Sortable';\nconst Context = /*#__PURE__*/React.createContext({\n  activeIndex: -1,\n  containerId: ID_PREFIX,\n  disableTransforms: false,\n  items: [],\n  overIndex: -1,\n  useDragOverlay: false,\n  sortedRects: [],\n  strategy: rectSortingStrategy,\n  disabled: {\n    draggable: false,\n    droppable: false\n  }\n});\nfunction SortableContext(_ref) {\n  let {\n    children,\n    id,\n    items: userDefinedItems,\n    strategy = rectSortingStrategy,\n    disabled: disabledProp = false\n  } = _ref;\n  const {\n    active,\n    dragOverlay,\n    droppableRects,\n    over,\n    measureDroppableContainers\n  } = useDndContext();\n  const containerId = useUniqueId(ID_PREFIX, id);\n  const useDragOverlay = Boolean(dragOverlay.rect !== null);\n  const items = useMemo(() => userDefinedItems.map(item => typeof item === 'object' && 'id' in item ? item.id : item), [userDefinedItems]);\n  const isDragging = active != null;\n  const activeIndex = active ? items.indexOf(active.id) : -1;\n  const overIndex = over ? items.indexOf(over.id) : -1;\n  const previousItemsRef = useRef(items);\n  const itemsHaveChanged = !itemsEqual(items, previousItemsRef.current);\n  const disableTransforms = overIndex !== -1 && activeIndex === -1 || itemsHaveChanged;\n  const disabled = normalizeDisabled(disabledProp);\n  useIsomorphicLayoutEffect(() => {\n    if (itemsHaveChanged && isDragging) {\n      measureDroppableContainers(items);\n    }\n  }, [itemsHaveChanged, items, isDragging, measureDroppableContainers]);\n  useEffect(() => {\n    previousItemsRef.current = items;\n  }, [items]);\n  const contextValue = useMemo(() => ({\n    activeIndex,\n    containerId,\n    disabled,\n    disableTransforms,\n    items,\n    overIndex,\n    useDragOverlay,\n    sortedRects: getSortedRects(items, droppableRects),\n    strategy\n  }), // eslint-disable-next-line react-hooks/exhaustive-deps\n  [activeIndex, containerId, disabled.draggable, disabled.droppable, disableTransforms, items, overIndex, droppableRects, useDragOverlay, strategy]);\n  return React.createElement(Context.Provider, {\n    value: contextValue\n  }, children);\n}\n\nconst defaultNewIndexGetter = _ref => {\n  let {\n    id,\n    items,\n    activeIndex,\n    overIndex\n  } = _ref;\n  return arrayMove(items, activeIndex, overIndex).indexOf(id);\n};\nconst defaultAnimateLayoutChanges = _ref2 => {\n  let {\n    containerId,\n    isSorting,\n    wasDragging,\n    index,\n    items,\n    newIndex,\n    previousItems,\n    previousContainerId,\n    transition\n  } = _ref2;\n\n  if (!transition || !wasDragging) {\n    return false;\n  }\n\n  if (previousItems !== items && index === newIndex) {\n    return false;\n  }\n\n  if (isSorting) {\n    return true;\n  }\n\n  return newIndex !== index && containerId === previousContainerId;\n};\nconst defaultTransition = {\n  duration: 200,\n  easing: 'ease'\n};\nconst transitionProperty = 'transform';\nconst disabledTransition = /*#__PURE__*/CSS.Transition.toString({\n  property: transitionProperty,\n  duration: 0,\n  easing: 'linear'\n});\nconst defaultAttributes = {\n  roleDescription: 'sortable'\n};\n\n/*\r\n * When the index of an item changes while sorting,\r\n * we need to temporarily disable the transforms\r\n */\n\nfunction useDerivedTransform(_ref) {\n  let {\n    disabled,\n    index,\n    node,\n    rect\n  } = _ref;\n  const [derivedTransform, setDerivedtransform] = useState(null);\n  const previousIndex = useRef(index);\n  useIsomorphicLayoutEffect(() => {\n    if (!disabled && index !== previousIndex.current && node.current) {\n      const initial = rect.current;\n\n      if (initial) {\n        const current = getClientRect(node.current, {\n          ignoreTransform: true\n        });\n        const delta = {\n          x: initial.left - current.left,\n          y: initial.top - current.top,\n          scaleX: initial.width / current.width,\n          scaleY: initial.height / current.height\n        };\n\n        if (delta.x || delta.y) {\n          setDerivedtransform(delta);\n        }\n      }\n    }\n\n    if (index !== previousIndex.current) {\n      previousIndex.current = index;\n    }\n  }, [disabled, index, node, rect]);\n  useEffect(() => {\n    if (derivedTransform) {\n      setDerivedtransform(null);\n    }\n  }, [derivedTransform]);\n  return derivedTransform;\n}\n\nfunction useSortable(_ref) {\n  let {\n    animateLayoutChanges = defaultAnimateLayoutChanges,\n    attributes: userDefinedAttributes,\n    disabled: localDisabled,\n    data: customData,\n    getNewIndex = defaultNewIndexGetter,\n    id,\n    strategy: localStrategy,\n    resizeObserverConfig,\n    transition = defaultTransition\n  } = _ref;\n  const {\n    items,\n    containerId,\n    activeIndex,\n    disabled: globalDisabled,\n    disableTransforms,\n    sortedRects,\n    overIndex,\n    useDragOverlay,\n    strategy: globalStrategy\n  } = useContext(Context);\n  const disabled = normalizeLocalDisabled(localDisabled, globalDisabled);\n  const index = items.indexOf(id);\n  const data = useMemo(() => ({\n    sortable: {\n      containerId,\n      index,\n      items\n    },\n    ...customData\n  }), [containerId, customData, index, items]);\n  const itemsAfterCurrentSortable = useMemo(() => items.slice(items.indexOf(id)), [items, id]);\n  const {\n    rect,\n    node,\n    isOver,\n    setNodeRef: setDroppableNodeRef\n  } = useDroppable({\n    id,\n    data,\n    disabled: disabled.droppable,\n    resizeObserverConfig: {\n      updateMeasurementsFor: itemsAfterCurrentSortable,\n      ...resizeObserverConfig\n    }\n  });\n  const {\n    active,\n    activatorEvent,\n    activeNodeRect,\n    attributes,\n    setNodeRef: setDraggableNodeRef,\n    listeners,\n    isDragging,\n    over,\n    setActivatorNodeRef,\n    transform\n  } = useDraggable({\n    id,\n    data,\n    attributes: { ...defaultAttributes,\n      ...userDefinedAttributes\n    },\n    disabled: disabled.draggable\n  });\n  const setNodeRef = useCombinedRefs(setDroppableNodeRef, setDraggableNodeRef);\n  const isSorting = Boolean(active);\n  const displaceItem = isSorting && !disableTransforms && isValidIndex(activeIndex) && isValidIndex(overIndex);\n  const shouldDisplaceDragSource = !useDragOverlay && isDragging;\n  const dragSourceDisplacement = shouldDisplaceDragSource && displaceItem ? transform : null;\n  const strategy = localStrategy != null ? localStrategy : globalStrategy;\n  const finalTransform = displaceItem ? dragSourceDisplacement != null ? dragSourceDisplacement : strategy({\n    rects: sortedRects,\n    activeNodeRect,\n    activeIndex,\n    overIndex,\n    index\n  }) : null;\n  const newIndex = isValidIndex(activeIndex) && isValidIndex(overIndex) ? getNewIndex({\n    id,\n    items,\n    activeIndex,\n    overIndex\n  }) : index;\n  const activeId = active == null ? void 0 : active.id;\n  const previous = useRef({\n    activeId,\n    items,\n    newIndex,\n    containerId\n  });\n  const itemsHaveChanged = items !== previous.current.items;\n  const shouldAnimateLayoutChanges = animateLayoutChanges({\n    active,\n    containerId,\n    isDragging,\n    isSorting,\n    id,\n    index,\n    items,\n    newIndex: previous.current.newIndex,\n    previousItems: previous.current.items,\n    previousContainerId: previous.current.containerId,\n    transition,\n    wasDragging: previous.current.activeId != null\n  });\n  const derivedTransform = useDerivedTransform({\n    disabled: !shouldAnimateLayoutChanges,\n    index,\n    node,\n    rect\n  });\n  useEffect(() => {\n    if (isSorting && previous.current.newIndex !== newIndex) {\n      previous.current.newIndex = newIndex;\n    }\n\n    if (containerId !== previous.current.containerId) {\n      previous.current.containerId = containerId;\n    }\n\n    if (items !== previous.current.items) {\n      previous.current.items = items;\n    }\n  }, [isSorting, newIndex, containerId, items]);\n  useEffect(() => {\n    if (activeId === previous.current.activeId) {\n      return;\n    }\n\n    if (activeId && !previous.current.activeId) {\n      previous.current.activeId = activeId;\n      return;\n    }\n\n    const timeoutId = setTimeout(() => {\n      previous.current.activeId = activeId;\n    }, 50);\n    return () => clearTimeout(timeoutId);\n  }, [activeId]);\n  return {\n    active,\n    activeIndex,\n    attributes,\n    data,\n    rect,\n    index,\n    newIndex,\n    items,\n    isOver,\n    isSorting,\n    isDragging,\n    listeners,\n    node,\n    overIndex,\n    over,\n    setNodeRef,\n    setActivatorNodeRef,\n    setDroppableNodeRef,\n    setDraggableNodeRef,\n    transform: derivedTransform != null ? derivedTransform : finalTransform,\n    transition: getTransition()\n  };\n\n  function getTransition() {\n    if ( // Temporarily disable transitions for a single frame to set up derived transforms\n    derivedTransform || // Or to prevent items jumping to back to their \"new\" position when items change\n    itemsHaveChanged && previous.current.newIndex === index) {\n      return disabledTransition;\n    }\n\n    if (shouldDisplaceDragSource && !isKeyboardEvent(activatorEvent) || !transition) {\n      return undefined;\n    }\n\n    if (isSorting || shouldAnimateLayoutChanges) {\n      return CSS.Transition.toString({ ...transition,\n        property: transitionProperty\n      });\n    }\n\n    return undefined;\n  }\n}\n\nfunction normalizeLocalDisabled(localDisabled, globalDisabled) {\n  var _localDisabled$dragga, _localDisabled$droppa;\n\n  if (typeof localDisabled === 'boolean') {\n    return {\n      draggable: localDisabled,\n      // Backwards compatibility\n      droppable: false\n    };\n  }\n\n  return {\n    draggable: (_localDisabled$dragga = localDisabled == null ? void 0 : localDisabled.draggable) != null ? _localDisabled$dragga : globalDisabled.draggable,\n    droppable: (_localDisabled$droppa = localDisabled == null ? void 0 : localDisabled.droppable) != null ? _localDisabled$droppa : globalDisabled.droppable\n  };\n}\n\nfunction hasSortableData(entry) {\n  if (!entry) {\n    return false;\n  }\n\n  const data = entry.data.current;\n\n  if (data && 'sortable' in data && typeof data.sortable === 'object' && 'containerId' in data.sortable && 'items' in data.sortable && 'index' in data.sortable) {\n    return true;\n  }\n\n  return false;\n}\n\nconst directions = [KeyboardCode.Down, KeyboardCode.Right, KeyboardCode.Up, KeyboardCode.Left];\nconst sortableKeyboardCoordinates = (event, _ref) => {\n  let {\n    context: {\n      active,\n      collisionRect,\n      droppableRects,\n      droppableContainers,\n      over,\n      scrollableAncestors\n    }\n  } = _ref;\n\n  if (directions.includes(event.code)) {\n    event.preventDefault();\n\n    if (!active || !collisionRect) {\n      return;\n    }\n\n    const filteredContainers = [];\n    droppableContainers.getEnabled().forEach(entry => {\n      if (!entry || entry != null && entry.disabled) {\n        return;\n      }\n\n      const rect = droppableRects.get(entry.id);\n\n      if (!rect) {\n        return;\n      }\n\n      switch (event.code) {\n        case KeyboardCode.Down:\n          if (collisionRect.top < rect.top) {\n            filteredContainers.push(entry);\n          }\n\n          break;\n\n        case KeyboardCode.Up:\n          if (collisionRect.top > rect.top) {\n            filteredContainers.push(entry);\n          }\n\n          break;\n\n        case KeyboardCode.Left:\n          if (collisionRect.left > rect.left) {\n            filteredContainers.push(entry);\n          }\n\n          break;\n\n        case KeyboardCode.Right:\n          if (collisionRect.left < rect.left) {\n            filteredContainers.push(entry);\n          }\n\n          break;\n      }\n    });\n    const collisions = closestCorners({\n      active,\n      collisionRect: collisionRect,\n      droppableRects,\n      droppableContainers: filteredContainers,\n      pointerCoordinates: null\n    });\n    let closestId = getFirstCollision(collisions, 'id');\n\n    if (closestId === (over == null ? void 0 : over.id) && collisions.length > 1) {\n      closestId = collisions[1].id;\n    }\n\n    if (closestId != null) {\n      const activeDroppable = droppableContainers.get(active.id);\n      const newDroppable = droppableContainers.get(closestId);\n      const newRect = newDroppable ? droppableRects.get(newDroppable.id) : null;\n      const newNode = newDroppable == null ? void 0 : newDroppable.node.current;\n\n      if (newNode && newRect && activeDroppable && newDroppable) {\n        const newScrollAncestors = getScrollableAncestors(newNode);\n        const hasDifferentScrollAncestors = newScrollAncestors.some((element, index) => scrollableAncestors[index] !== element);\n        const hasSameContainer = isSameContainer(activeDroppable, newDroppable);\n        const isAfterActive = isAfter(activeDroppable, newDroppable);\n        const offset = hasDifferentScrollAncestors || !hasSameContainer ? {\n          x: 0,\n          y: 0\n        } : {\n          x: isAfterActive ? collisionRect.width - newRect.width : 0,\n          y: isAfterActive ? collisionRect.height - newRect.height : 0\n        };\n        const rectCoordinates = {\n          x: newRect.left,\n          y: newRect.top\n        };\n        const newCoordinates = offset.x && offset.y ? rectCoordinates : subtract(rectCoordinates, offset);\n        return newCoordinates;\n      }\n    }\n  }\n\n  return undefined;\n};\n\nfunction isSameContainer(a, b) {\n  if (!hasSortableData(a) || !hasSortableData(b)) {\n    return false;\n  }\n\n  return a.data.current.sortable.containerId === b.data.current.sortable.containerId;\n}\n\nfunction isAfter(a, b) {\n  if (!hasSortableData(a) || !hasSortableData(b)) {\n    return false;\n  }\n\n  if (!isSameContainer(a, b)) {\n    return false;\n  }\n\n  return a.data.current.sortable.index < b.data.current.sortable.index;\n}\n\nexport { SortableContext, arrayMove, arraySwap, defaultAnimateLayoutChanges, defaultNewIndexGetter, hasSortableData, horizontalListSortingStrategy, rectSortingStrategy, rectSwappingStrategy, sortableKeyboardCoordinates, useSortable, verticalListSortingStrategy };\n//# sourceMappingURL=sortable.esm.js.map\n","\"use strict\";\n\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"@dagrejs/graphlib\").alg.preorder;\nvar postorder = require(\"@dagrejs/graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = 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  initRank(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 = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  vs.forEach(v => assignCutValue(t, g, v));\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  g.nodeEdges(child).forEach(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  tree.neighbors(v).forEach(w => {\n    if (!visited.hasOwnProperty(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 tree.edges().find(e => tree.edge(e).cutvalue < 0);\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 = g.edges().filter(edge => {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return candidates.reduce((acc, edge) => {\n    if (slack(g, edge) < slack(g, acc)) {\n      return edge;\n    }\n\n    return acc;\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 = t.nodes().find(v => !g.node(v).parent);\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  vs.forEach(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","module.exports = \"1.1.3\";\n","\"use strict\";\n\nlet util = require(\"../util\");\n\nmodule.exports = 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  let visited = {};\n  let simpleNodes = g.nodes().filter(v => !g.children(v).length);\n  let maxRank = Math.max(...simpleNodes.map(v => g.node(v).rank));\n  let layers = util.range(maxRank + 1).map(() => []);\n\n  function dfs(v) {\n    if (visited[v]) return;\n    visited[v] = true;\n    let node = g.node(v);\n    layers[node.rank].push(v);\n    g.successors(v).forEach(dfs);\n  }\n\n  let orderedVs = simpleNodes.sort((a, b) => g.node(a).rank - g.node(b).rank);\n  orderedVs.forEach(dfs);\n\n  return layers;\n}\n","\"use strict\";\n\nlet util = require(\"../util\");\nlet positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  Object.entries(positionX(g)).forEach(([v, x]) => g.node(v).x = x);\n}\n\nfunction positionY(g) {\n  let layering = util.buildLayerMatrix(g);\n  let rankSep = g.graph().ranksep;\n  let prevY = 0;\n  layering.forEach(layer => {\n    const maxHeight = layer.reduce((acc, v) => {\n      const height = g.node(v).height;\n      if (acc > height) {\n        return acc;\n      } else {\n        return height;\n      }\n    }, 0);\n    layer.forEach(v => g.node(v).y = prevY + maxHeight / 2);\n    prevY += maxHeight + rankSep;\n  });\n}\n\n"],"names":["longestPath","feasibleTree","networkSimplex","module","exports","g","graph","ranker","networkSimplexRanker","tightTreeRanker","longestPathRanker","restrictToFirstScrollableAncestor","_ref","draggingNodeRect","transform","scrollableAncestorRects","firstScrollableAncestorRect","rect","boundingRect","value","top","y","bottom","height","left","x","right","width","restrictToBoundingRect","restrictToVerticalAxis","util","addBorderNode","prop","prefix","sg","sgNode","rank","label","borderType","prev","curr","addDummyNode","setParent","setEdge","weight","children","forEach","dfs","v","node","length","hasOwnProperty","borderLeft","borderRight","minRank","maxRank","Graph","findType1Conflicts","layering","conflicts","reduce","prevLayer","layer","k0","scanPos","prevLayerLength","lastNode","i","w","dummy","predecessors","find","u","findOtherInnerSegmentNode","k1","order","slice","scanNode","uLabel","uPos","addConflict","findType2Conflicts","scan","south","southPos","southEnd","prevNorthBorder","nextNorthBorder","range","uNode","north","nextNorthPos","prevNorthPos","southLookahead","tmp","conflictsV","hasConflict","verticalAlignment","neighborFn","root","align","pos","prevIdx","ws","sort","a","b","mp","Math","floor","il","ceil","horizontalCompaction","reverseSep","xs","blockG","blockGraph","graphLabel","sepFn","nodeSep","edgeSep","delta","vLabel","wLabel","sum","labelpos","toLowerCase","sep","nodesep","edgesep","vRoot","setNode","uRoot","prevMax","edge","max","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","stack","nodes","elem","pop","visited","push","concat","inEdges","acc","e","bind","min","outEdges","Number","POSITIVE_INFINITY","successors","Object","keys","findSmallestWidthAlignment","xss","values","currentMinAndXs","NEGATIVE_INFINITY","entries","halfWidth","newMin","alignCoordinates","alignTo","alignToVals","alignToMin","alignToMax","vert","horiz","alignment","xsVals","mapValues","balance","ul","num","map","positionX","adjustedLayering","buildLayerMatrix","assign","reverse","inner","smallestWidth","debugOrdering","layerMatrix","h","compound","multigraph","setGraph","edges","name","layerV","style","unlink","entry","_prev","_next","filterOutLinks","k","constructor","sentinel","this","_sentinel","dequeue","enqueue","toString","strs","JSON","stringify","join","postorderNums","result","lim","low","postorder","dummyChains","edgeObj","pathData","parent","lca","vPath","wPath","path","findPath","pathIdx","pathV","ascending","cg","vs","rootPrev","prevChild","child","PriorityQueue","weightFunc","parents","pq","updateNeighbors","pri","priority","undefined","edgeWeight","decrease","nodeCount","add","init","size","removeMin","Error","nodeEdges","_arr","_keyIndices","key","has","index","keyIndices","String","arr","_decrease","_swap","_heapify","l","r","largest","j","origArrI","origArrJ","relationship","hasNode","uniqueId","createRootNode","setDefaultNodeLabel","acyclic","normalize","normalizeRanks","parentDummyChains","removeEmptyRanks","nestingGraph","addBorderSegments","coordinateSystem","position","opts","time","debugTiming","notime","layoutGraph","inputGraph","canonicalize","graphDefaults","selectNumberAttrs","graphNumAttrs","pick","graphAttrs","newNode","nodeNumAttrs","nodeDefaults","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","ranksep","minlen","rankdir","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeEdge","removeSelfEdges","run","asNonCompoundGraph","injectEdgeLabelProxies","cleanup","borderTop","borderBottom","assignRankMinMax","labelRank","removeNode","removeEdgeLabelProxies","orderShift","selfEdge","insertSelfEdges","adjust","selfNode","dx","dy","points","positionSelfEdges","t","abs","removeBorderNodes","undo","fixupEdgeLabelCoords","minX","maxX","minY","maxY","marginX","marginx","marginY","marginy","getExtremes","attrs","p","translateGraph","p1","p2","nodeV","nodeW","unshift","intersectRect","assignNodeIntersects","reversed","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","obj","newAttrs","topsort","CycleException","results","onStack","lowlink","cmpt","lib","json","alg","version","type","MIN_VALUE","arguments","simplified","isMultigraph","point","sx","sy","funcOrProp","func","val","MAX_VALUE","fn","partition","collection","lhs","rhs","source","dest","predecessorWeights","weightMap","preds","zipObject","offset","layers","nodeRankFactor","Array","from","simplify","simpleLabel","successorWeights","sucs","start","Date","now","console","log","idCounter","id","limit","step","endCon","props","slack","tightTree","edgeV","findMinSlackEdge","edgeSlack","shiftRanks","directed","weightFn","edgeFn","vEntry","wEntry","distance","predecessor","runDijkstra","DEFAULT_WEIGHT_FUNC","c","d","XMLHttpRequest","open","responseType","onload","response","onerror","error","send","status","dispatchEvent","MouseEvent","document","createEvent","initMouseEvent","window","f","self","global","navigator","test","userAgent","saveAs","HTMLAnchorElement","prototype","URL","webkitURL","createElement","download","rel","href","origin","location","target","createObjectURL","setTimeout","revokeObjectURL","msSaveOrOpenBlob","autoBom","warn","Blob","title","body","innerText","HTMLElement","safari","FileReader","onloadend","replace","readAsDataURL","m","consumeUnsortable","unsortable","last","biasRight","parts","sortable","vsIndex","bias","entryV","entryW","barycenter","flat","swapWidthHeight","swapWidthHeightOne","reverseYOne","swapXYOne","rankDir","reverseY","swapXY","GRAPH_NODE","incrementOrInitEntry","decrementOrRemoveEntry","edgeArgsToId","isDirected","v_","w_","edgeObjToId","_isDirected","_isMultigraph","_isCompound","_label","_defaultNodeLabelFn","_defaultEdgeLabelFn","_nodes","_in","_preds","_out","_sucs","_edgeObjs","_edgeLabels","_nodeCount","_edgeCount","_parent","_children","isCompound","newDefault","sources","filter","sinks","setNodes","args","_removeFromParentsChildList","ancestor","predsV","sucsV","neighbors","union","Set","succ","isLeaf","filterNodes","copy","findParent","setDefaultEdgeLabel","edgeCount","setPath","valueSpecified","arg0","edgeArgsToObj","freeze","edgeAsObj","hasEdge","inV","outV","visit","super","mappedEntries","indegree","out","sourceSet","handleIn","uEntry","merged","mergeEntries","handleOut","doResolveConflicts","dijkstra","edgeFunc","postOrderDfs","navigation","forEachRight","preOrderDfs","array","iteratee","isArray","orderFunc","components","dijkstraAll","findCycles","floydWarshall","isAcyclic","preorder","prim","tarjan","useCombinedRefs","_len","refs","_key","useMemo","ref","canUseDOM","isWindow","element","elementString","call","isNode","getWindow","_target$ownerDocument","_target$ownerDocument2","ownerDocument","defaultView","isDocument","Document","isHTMLElement","isSVGElement","SVGElement","getOwnerDocument","useIsomorphicLayoutEffect","useLayoutEffect","useEffect","useEvent","handler","handlerRef","useRef","current","useCallback","useInterval","intervalRef","listener","duration","setInterval","clearInterval","useLatestValue","dependencies","valueRef","useLazyMemo","callback","newValue","useNodeRef","onChange","onChangeHandler","setNodeRef","usePrevious","ids","useUniqueId","createAdjustmentFn","modifier","object","adjustments","accumulator","adjustment","valueAdjustment","subtract","isKeyboardEvent","event","KeyboardEvent","getEventCoordinates","TouchEvent","isTouchEvent","touches","clientX","clientY","changedTouches","hasViewportRelativeCoordinates","CSS","Translate","round","Scale","scaleX","scaleY","Transform","Transition","property","easing","SELECTOR","findFirstFocusableNode","matches","querySelector","graphlib","layout","debug","depths","childNode","childTop","childBottom","thisWeight","nestingEdge","depth","treeDepths","nestingRoot","sumWeights","writeNodes","nodeValue","writeEdges","edgeValue","write","options","structuredClone","read","cmpts","greedyFAS","acyclicer","fas","dfsFAS","forwardName","twoLayerCrossCount","northLayer","southLayer","southEntries","flatMap","firstIndex","treeSize","tree","fill","cc","weightSum","vRank","wRank","edgeLabel","normalizeEdge","origLabel","movable","nodeU","initOrder","crossCount","sortSubgraph","buildLayerGraph","addSubgraphConstraints","buildLayerGraphs","ranks","sweepLayerGraphs","layerGraphs","lg","sorted","assignOrder","customOrder","downLayerGraphs","upLayerGraphs","disableOptimalOrderHeuristic","best","bestCC","lastBest","List","state","fasGraph","maxIn","maxOut","prevWeight","buckets","zeroIdx","assignBucket","buildState","DEFAULT_WEIGHT_FN","doGreedyFAS","collectPredecessors","hiddenStyles","display","HiddenText","LiveRegion","announcement","ariaLiveType","margin","border","padding","overflow","clip","clipPath","whiteSpace","role","DndMonitorContext","createContext","defaultScreenReaderInstructions","draggable","defaultAnnouncements","onDragStart","active","onDragOver","_ref2","over","onDragEnd","_ref3","onDragCancel","_ref4","Accessibility","announcements","container","hiddenTextDescribedById","screenReaderInstructions","announce","setAnnouncement","useState","useAnnouncement","liveRegionId","mounted","setMounted","registerListener","useContext","useDndMonitor","onDragMove","_ref5","_ref6","markup","createPortal","Action","noop","useSensor","sensor","useSensors","sensors","defaultCoordinates","sortCollisionsAsc","data","sortCollisionsDesc","centerOfRectangle","closestCenter","collisionRect","droppableRects","droppableContainers","centerRect","collisions","droppableContainer","get","distBetween","sqrt","pow","getIntersectionRatio","targetArea","entryArea","intersectionArea","toFixed","rectIntersection","intersectionRatio","getRectDelta","rect1","rect2","createRectAdjustmentFn","getAdjustedRect","defaultOptions","ignoreTransform","getClientRect","getBoundingClientRect","transformOrigin","getComputedStyle","parsedTransform","startsWith","transformArray","split","parseTransform","translateX","translateY","parseFloat","indexOf","inverseTransform","getTransformAgnosticClientRect","getScrollableAncestors","scrollParents","findScrollableAncestors","scrollingElement","includes","computedStyle","overflowRegex","some","isScrollable","isFixed","parentNode","getFirstScrollableAncestor","firstScrollableAncestor","getScrollableElement","getScrollXCoordinate","scrollX","scrollLeft","getScrollYCoordinate","scrollY","scrollTop","getScrollCoordinates","Direction","isDocumentScrollingElement","getScrollPosition","scrollingContainer","minScroll","dimensions","innerHeight","innerWidth","clientHeight","clientWidth","maxScroll","scrollWidth","scrollHeight","isTop","isLeft","isBottom","isRight","defaultThreshold","getScrollDirectionAndSpeed","scrollContainer","scrollContainerRect","acceleration","thresholdPercentage","direction","speed","threshold","Backward","Forward","getScrollElementRect","getScrollOffsets","scrollableAncestors","properties","Rect","scrollOffsets","axis","getScrollOffset","defineProperty","currentOffsets","scrollOffsetsDeltla","enumerable","Listeners","listeners","removeAll","_this$target","removeEventListener","eventName","_this$target2","addEventListener","hasExceededDistance","measurement","EventName","KeyboardCode","preventDefault","stopPropagation","defaultKeyboardCodes","Space","Enter","cancel","Esc","end","Tab","defaultKeyboardCoordinateGetter","currentCoordinates","code","Right","Left","Down","Up","KeyboardSensor","autoScrollEnabled","referenceCoordinates","windowListeners","handleKeyDown","handleCancel","attach","handleStart","Resize","VisibilityChange","Keydown","activeNode","onStart","measure","scrollIntoView","block","inline","scrollIntoViewIfNeeded","context","keyboardCodes","coordinateGetter","scrollBehavior","handleEnd","newCoordinates","coordinatesDelta","scrollDelta","scrollElementRect","clampedCoordinates","canScrollX","canScrollY","newScrollCoordinates","canScrollToNewCoordinates","scrollTo","behavior","scrollBy","handleMove","coordinates","onMove","onEnd","detach","onCancel","isDistanceConstraint","constraint","Boolean","isDelayConstraint","activators","onActivation","nativeEvent","activator","activatorNode","AbstractPointerSensor","events","listenerTarget","_getEventCoordinates","EventTarget","getEventListenerTarget","activated","initialCoordinates","timeoutId","documentListeners","handleKeydown","removeTextSelection","activationConstraint","bypassActivationConstraint","move","passive","DragStart","ContextMenu","delay","handlePending","clearTimeout","onPending","Click","capture","SelectionChange","_getEventCoordinates2","tolerance","cancelable","onAbort","_this$document$getSel","getSelection","removeAllRanges","PointerSensor","isPrimary","button","events$1","MouseButton","RightClick","events$2","AutoScrollActivator","TraversalOrder","setup","defaultScrollIntent","MeasuringStrategy","MeasuringFrequency","defaultValue","Map","useInitialValue","computeFn","previousValue","useResizeObserver","disabled","handleResize","resizeObserver","ResizeObserver","disconnect","defaultMeasure","useRect","fallbackRect","setRect","measureRect","currentRect","isConnected","newRect","mutationObserver","handleMutations","MutationObserver","useMutationObserver","records","record","contains","observe","childList","subtree","defaultValue$1","useScrollOffsetsDelta","initialScrollOffsets","hasScrollOffsets","useWindowRect","getWindowClientRect","defaultValue$2","defaultSensors","defaultData","defaultMeasuringConfiguration","droppable","strategy","WhileDragging","frequency","Optimized","dragOverlay","DroppableContainersMap","_super$get","toArray","getEnabled","getNodeFor","_this$get$node$curren","_this$get","defaultPublicContext","activatorEvent","activeNodeRect","containerNodeRect","draggableNodes","nodeRef","setRef","measuringConfiguration","measureDroppableContainers","windowRect","measuringScheduled","defaultInternalContext","ariaDescribedById","dispatch","InternalContext","PublicContext","getInitialState","translate","containers","reducer","action","DragMove","DragEnd","DragCancel","RegisterDroppable","set","SetDroppableDisabled","UnregisterDroppable","delete","RestoreFocus","previousActivatorEvent","previousActiveId","activeElement","draggableNode","requestAnimationFrame","focusableNode","focus","ActiveDraggableContext","Status","DndContext","memo","_sensorContext$curren","_dragOverlay$nodeRef$","_dragOverlay$rect","_over$rect","accessibility","autoScroll","collisionDetection","measuring","modifiers","store","useReducer","dispatchMonitorEvent","registerMonitorListener","_listener$type","useDndMonitorProvider","setStatus","Uninitialized","isInitialized","Initialized","activeId","activeRects","initial","translated","_node$data","activeRef","activeSensor","setActiveSensor","setActivatorEvent","latestProps","draggableDescribedById","enabledDroppableContainers","config","dragging","queue","setQueue","containersRef","Always","BeforeDragging","isDisabled","disabledRef","useDroppableMeasuring","cachedNode","useCachedNode","activationCoordinates","autoScrollOptions","activeSensorDisablesAutoscroll","autoScrollGloballyDisabled","enabled","getAutoScrollerOptions","initialActiveNodeRect","useInitialRect","initialRect","initialized","rectDelta","useLayoutShiftScrollCompensation","layoutShiftCompensation","parentElement","sensorContext","draggingNode","scrollAdjustedTranslate","overNode","handleNodeChange","firstChild","getMeasurableNode","useDragOverlayMeasuring","usesDragOverlay","nodeRectDelta","previousNode","ancestors","useScrollableAncestors","elements","firstElement","rects","setRects","measureRects","useRects","modifiedTranslate","applyModifiers","overlayNodeRect","pointerCoordinates","scrollCoordinates","setScrollCoordinates","prevElements","handleScroll","previousElements","scrollableElement","useScrollOffsets","scrollAdjustment","activeNodeScrollDelta","overId","firstCollision","getFirstCollision","setOver","adjustScale","activeSensorRef","instantiateSensor","Sensor","sensorInstance","onDragAbort","onDragPending","unstable_batchedUpdates","Initializing","createHandler","async","cancelDrop","Promise","resolve","bindActivatorToSensorInstantiator","activeDraggableNode","dndKit","defaultPrevented","activationContext","capturedBy","getSyntheticHandler","useCombineActivators","teardownFns","teardown","useSensorSetup","overContainer","Pointer","canScroll","draggingRect","interval","TreeOrder","scrollIntent","previousDelta","previousIntent","sign","useScrollIntent","setAutoScrollInterval","clearAutoScrollInterval","scrollSpeed","scrollDirection","DraggableRect","scrollContainerRef","sortedScrollableAncestors","useAutoScroller","publicContext","internalContext","Provider","restoreFocus","NullContext","defaultRole","ID_PREFIX","useDraggable","attributes","roleDescription","tabIndex","isDragging","setActivatorNodeRef","useSyntheticListeners","dataRef","useDndContext","ID_PREFIX$1","defaultResizeObserverConfig","timeout","useDroppable","resizeObserverConfig","previous","resizeObserverConnected","callbackId","resizeObserverDisabled","updateMeasurementsFor","resizeObserverTimeout","newElement","previousElement","unobserve","isOver","resolveConflicts","bl","br","subgraphs","barycenters","subgraphResult","other","expandSubgraphs","blPred","brPred","rowK","rowI","ik","kj","ij","altDistance","runFloydWarshall","CmdbObjectApi_getObjectRef","params","http","arrayMove","to","newArray","splice","getSortedRects","items","isValidIndex","rectSortingStrategy","activeIndex","overIndex","newRects","oldRect","defaultScale$1","verticalListSortingStrategy","_rects$activeIndex","fallbackActiveRect","overIndexRect","itemGap","clientRects","previousRect","nextRect","getItemGap$1","Context","containerId","disableTransforms","useDragOverlay","sortedRects","SortableContext","userDefinedItems","disabledProp","item","previousItemsRef","itemsHaveChanged","itemsEqual","normalizeDisabled","contextValue","defaultNewIndexGetter","defaultAnimateLayoutChanges","isSorting","wasDragging","newIndex","previousItems","previousContainerId","transition","defaultTransition","transitionProperty","disabledTransition","defaultAttributes","useSortable","animateLayoutChanges","userDefinedAttributes","localDisabled","customData","getNewIndex","localStrategy","globalDisabled","globalStrategy","_localDisabled$dragga","_localDisabled$droppa","normalizeLocalDisabled","itemsAfterCurrentSortable","setDroppableNodeRef","setDraggableNodeRef","displaceItem","shouldDisplaceDragSource","dragSourceDisplacement","finalTransform","shouldAnimateLayoutChanges","derivedTransform","setDerivedtransform","previousIndex","useDerivedTransform","initRank","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","cutvalue","calcCutValue","assignCutValue","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","otherCutValue","dfsAssignLowLim","nextLim","tailLabel","flip","candidates","isDescendant","flipped","updateRanks","rootLabel","simpleNodes","rankSep","prevY","maxHeight","positionY"],"sourceRoot":""}