@antv/layout 1.0.0-alpha.1 → 1.0.0-alpha.3

package/dist/index.min.js.map

@@ -1 +1 @@
-{"version":3,"file":"index.min.js","mappings":"6CAEA,IAAIA,EAAMC,OAAOC,UAAUC,eACvBC,EAAS,IASb,SAASC,IAAU,CA4BnB,SAASC,EAAGC,EAAIC,EAASC,GACvBC,KAAKH,GAAKA,EACVG,KAAKF,QAAUA,EACfE,KAAKD,KAAOA,IAAQ,CACtB,CAaA,SAASE,EAAYC,EAASC,EAAON,EAAIC,EAASC,GAChD,GAAkB,mBAAPF,EACT,MAAM,IAAIO,UAAU,mCAGtB,IAAIC,EAAW,IAAIT,EAAGC,EAAIC,GAAWI,EAASH,GAC1CO,EAAMZ,EAASA,EAASS,EAAQA,EAMpC,OAJKD,EAAQK,QAAQD,GACXJ,EAAQK,QAAQD,GAAKT,GAC1BK,EAAQK,QAAQD,GAAO,CAACJ,EAAQK,QAAQD,GAAMD,GADhBH,EAAQK,QAAQD,GAAKE,KAAKH,IADlCH,EAAQK,QAAQD,GAAOD,EAAUH,EAAQO,gBAI7DP,CACT,CASA,SAASQ,EAAWR,EAASI,GACI,KAAzBJ,EAAQO,aAAoBP,EAAQK,QAAU,IAAIZ,SAC5CO,EAAQK,QAAQD,EAC9B,CASA,SAASK,IACPX,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,CACtB,CAzEIlB,OAAOqB,SACTjB,EAAOH,UAAYD,OAAOqB,OAAO,OAM5B,IAAIjB,GAASkB,YAAWnB,GAAS,IA2ExCiB,EAAanB,UAAUsB,WAAa,WAClC,IACIC,EACAC,EAFAC,EAAQ,GAIZ,GAA0B,IAAtBjB,KAAKS,aAAoB,OAAOQ,EAEpC,IAAKD,KAASD,EAASf,KAAKO,QACtBjB,EAAI4B,KAAKH,EAAQC,IAAOC,EAAMT,KAAKd,EAASsB,EAAKG,MAAM,GAAKH,GAGlE,OAAIzB,OAAO6B,sBACFH,EAAMI,OAAO9B,OAAO6B,sBAAsBL,IAG5CE,CACT,EASAN,EAAanB,UAAU8B,UAAY,SAAmBnB,GACpD,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCoB,EAAWvB,KAAKO,QAAQD,GAE5B,IAAKiB,EAAU,MAAO,GACtB,GAAIA,EAAS1B,GAAI,MAAO,CAAC0B,EAAS1B,IAElC,IAAK,IAAI2B,EAAI,EAAGC,EAAIF,EAASG,OAAQC,EAAK,IAAIC,MAAMH,GAAID,EAAIC,EAAGD,IAC7DG,EAAGH,GAAKD,EAASC,GAAG3B,GAGtB,OAAO8B,CACT,EASAhB,EAAanB,UAAUqC,cAAgB,SAAuB1B,GAC5D,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCmB,EAAYtB,KAAKO,QAAQD,GAE7B,OAAKgB,EACDA,EAAUzB,GAAW,EAClByB,EAAUI,OAFM,CAGzB,EASAf,EAAanB,UAAUsC,KAAO,SAAc3B,EAAO4B,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,IAAI7B,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAO,EAE/B,IAEI8B,EACAZ,EAHAF,EAAYtB,KAAKO,QAAQD,GACzB+B,EAAMC,UAAUZ,OAIpB,GAAIJ,EAAUzB,GAAI,CAGhB,OAFIyB,EAAUvB,MAAMC,KAAKuC,eAAepC,EAAOmB,EAAUzB,QAAI2C,GAAW,GAEhEH,GACN,KAAK,EAAG,OAAOf,EAAUzB,GAAGqB,KAAKI,EAAUxB,UAAU,EACrD,KAAK,EAAG,OAAOwB,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,IAAK,EACzD,KAAK,EAAG,OAAOT,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,IAAK,EAC7D,KAAK,EAAG,OAAOV,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,IAAK,EACjE,KAAK,EAAG,OAAOX,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,EAAIC,IAAK,EACrE,KAAK,EAAG,OAAOZ,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,EAAIC,EAAIC,IAAK,EAG3E,IAAKX,EAAI,EAAGY,EAAO,IAAIR,MAAMS,EAAK,GAAIb,EAAIa,EAAKb,IAC7CY,EAAKZ,EAAI,GAAKc,UAAUd,GAG1BF,EAAUzB,GAAG4C,MAAMnB,EAAUxB,QAASsC,EACxC,KAAO,CACL,IACIM,EADAhB,EAASJ,EAAUI,OAGvB,IAAKF,EAAI,EAAGA,EAAIE,EAAQF,IAGtB,OAFIF,EAAUE,GAAGzB,MAAMC,KAAKuC,eAAepC,EAAOmB,EAAUE,GAAG3B,QAAI2C,GAAW,GAEtEH,GACN,KAAK,EAAGf,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,SAAU,MACpD,KAAK,EAAGwB,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,GAAK,MACxD,KAAK,EAAGT,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,EAAIC,GAAK,MAC5D,KAAK,EAAGV,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,EAAIC,EAAIC,GAAK,MAChE,QACE,IAAKG,EAAM,IAAKM,EAAI,EAAGN,EAAO,IAAIR,MAAMS,EAAK,GAAIK,EAAIL,EAAKK,IACxDN,EAAKM,EAAI,GAAKJ,UAAUI,GAG1BpB,EAAUE,GAAG3B,GAAG4C,MAAMnB,EAAUE,GAAG1B,QAASsC,GAGpD,CAEA,OAAO,CACT,EAWAzB,EAAanB,UAAUmD,GAAK,SAAYxC,EAAON,EAAIC,GACjD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAWAa,EAAanB,UAAUO,KAAO,SAAcI,EAAON,EAAIC,GACrD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAYAa,EAAanB,UAAU+C,eAAiB,SAAwBpC,EAAON,EAAIC,EAASC,GAClF,IAAIO,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAON,KAC/B,IAAKH,EAEH,OADAa,EAAWV,KAAMM,GACVN,KAGT,IAAIsB,EAAYtB,KAAKO,QAAQD,GAE7B,GAAIgB,EAAUzB,GAEVyB,EAAUzB,KAAOA,GACfE,IAAQuB,EAAUvB,MAClBD,GAAWwB,EAAUxB,UAAYA,GAEnCY,EAAWV,KAAMM,OAEd,CACL,IAAK,IAAIkB,EAAI,EAAGT,EAAS,GAAIW,EAASJ,EAAUI,OAAQF,EAAIE,EAAQF,KAEhEF,EAAUE,GAAG3B,KAAOA,GACnBE,IAASuB,EAAUE,GAAGzB,MACtBD,GAAWwB,EAAUE,GAAG1B,UAAYA,IAErCiB,EAAOP,KAAKc,EAAUE,IAOtBT,EAAOW,OAAQ1B,KAAKO,QAAQD,GAAyB,IAAlBS,EAAOW,OAAeX,EAAO,GAAKA,EACpEL,EAAWV,KAAMM,EACxB,CAEA,OAAON,IACT,EASAW,EAAanB,UAAUoD,mBAAqB,SAA4BzC,GACtE,IAAIG,EAUJ,OARIH,GACFG,EAAMZ,EAASA,EAASS,EAAQA,EAC5BH,KAAKO,QAAQD,IAAMI,EAAWV,KAAMM,KAExCN,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,GAGfT,IACT,EAKAW,EAAanB,UAAUqD,IAAMlC,EAAanB,UAAU+C,eACpD5B,EAAanB,UAAUS,YAAcU,EAAanB,UAAUmD,GAK5DhC,EAAamC,SAAWpD,EAKxBiB,EAAaA,aAAeA,EAM1BoC,EAAOC,QAAUrC,C,gBC7Uf,IAAIsC,EAAa,EAAQ,KACrBC,EAAU,CAAC,mBACfH,EAAOC,QAAU,WAChB,IAAIG,EAAI,IAAIC,OAAOC,IAAIC,gBAAgB,IAAIC,KAAK,CAAC,2zbAAw8b,CAAEvC,KAAM,yBAIjgc,OAHAqC,IAAIG,gBAAgBH,IAAIC,gBAAgB,IAAIC,KAAK,CAAC,4zbAClDN,EAAWE,EAAGD,GAEPC,CACR,C,UCkCJJ,EAAOC,QA3CP,SAAoBS,EAAQP,GAC1B,IAAIQ,EAAI,EACJC,EAAY,CAAC,EACjBF,EAAOG,iBAAiB,WAAW,SAAUC,GAC3C,IAAIC,EAAID,EAAEE,KACV,GAAe,QAAXD,EAAEE,KAEN,GAAIF,EAAEG,GAAI,CACR,IAAIC,EAAIP,EAAUG,EAAEG,IAEhBC,WACKP,EAAUG,EAAEG,IAEfH,EAAEK,MACJD,EAAE,GAAG3E,OAAO6E,OAAOC,MAAMP,EAAEK,MAAMG,SAAUR,EAAEK,QAE7CD,EAAE,GAAGJ,EAAES,QAGb,KAAO,CACL,IAAIjE,EAAMkE,SAASC,YAAY,SAC/BnE,EAAIoE,UAAUZ,EAAEa,QAAQ,GAAO,GAC/BrE,EAAIyD,KAAOD,EAAEc,OACbnB,EAAOoB,cAAcvE,EACvB,CACF,IACA4C,EAAQ4B,SAAQ,SAAUH,GACxBlB,EAAOkB,GAAU,WACf,IAAII,EAAazC,UACjB,OAAO,IAAI0C,SAAQ,SAAUC,EAAGC,GAC9B,IAAIjB,IAAOP,EACXC,EAAUM,GAAM,CAACgB,EAAGC,GACpBzB,EAAO0B,YAAY,CACjBnB,KAAM,MACNC,GAAIA,EACJU,OAAQA,EACRC,OAAQ,GAAGzD,MAAMD,KAAK6D,IAE1B,GACF,CACF,GACF,C,GCxCIK,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqB9C,IAAjB+C,EACH,OAAOA,EAAavC,QAGrB,IAAID,EAASqC,EAAyBE,GAAY,CAGjDtC,QAAS,CAAC,GAOX,OAHAwC,EAAoBF,GAAUvC,EAAQA,EAAOC,QAASqC,GAG/CtC,EAAOC,OACf,CCrBAqC,EAAoBI,EAAK1C,IACxB,IAAI2C,EAAS3C,GAAUA,EAAO4C,WAC7B,IAAO5C,EAAiB,QACxB,IAAM,EAEP,OADAsC,EAAoBvB,EAAE4B,EAAQ,CAAET,EAAGS,IAC5BA,CAAM,ECLdL,EAAoBvB,EAAI,CAACd,EAAS4C,KACjC,IAAI,IAAIC,KAAOD,EACXP,EAAoBS,EAAEF,EAAYC,KAASR,EAAoBS,EAAE9C,EAAS6C,IAC5EtG,OAAOwG,eAAe/C,EAAS6C,EAAK,CAAEG,YAAY,EAAMC,IAAKL,EAAWC,IAE1E,ECNDR,EAAoBS,EAAI,CAACI,EAAKC,IAAU5G,OAAOC,UAAUC,eAAeyB,KAAKgF,EAAKC,GCClFd,EAAoBe,EAAKpD,IACH,oBAAXqD,QAA0BA,OAAOC,aAC1C/G,OAAOwG,eAAe/C,EAASqD,OAAOC,YAAa,CAAEC,MAAO,WAE7DhH,OAAOwG,eAAe/C,EAAS,aAAc,CAAEuD,OAAO,GAAO,E,wJCW9D,IAAIC,EAAgB,SAAS1C,EAAGoB,GAI5B,OAHAsB,EAAgBjH,OAAOkH,gBAClB,CAAE5F,UAAW,cAAgBe,OAAS,SAAUkC,EAAGoB,GAAKpB,EAAEjD,UAAYqE,CAAG,GAC1E,SAAUpB,EAAGoB,GAAK,IAAK,IAAIwB,KAAKxB,EAAO3F,OAAOC,UAAUC,eAAeyB,KAAKgE,EAAGwB,KAAI5C,EAAE4C,GAAKxB,EAAEwB,GAAI,EAC7FF,EAAc1C,EAAGoB,EAC5B,EAUWyB,EAAW,WAQlB,OAPAA,EAAWpH,OAAO6E,QAAU,SAAkBwC,GAC1C,IAAK,IAAIC,EAAGrF,EAAI,EAAGiE,EAAInD,UAAUZ,OAAQF,EAAIiE,EAAGjE,IAE5C,IAAK,IAAIkF,KADTG,EAAIvE,UAAUd,GACOjC,OAAOC,UAAUC,eAAeyB,KAAK2F,EAAGH,KAAIE,EAAEF,GAAKG,EAAEH,IAE9E,OAAOE,CACX,EACOD,EAASlE,MAAMzC,KAAMsC,UAChC,EA+FO,SAASwE,EAAOhB,EAAGL,GACtB,IAAIsB,EAAsB,mBAAXV,QAAyBP,EAAEO,OAAOW,UACjD,IAAKD,EAAG,OAAOjB,EACf,IAAmBM,EAAYvC,EAA3BrC,EAAIuF,EAAE7F,KAAK4E,GAAOmB,EAAK,GAC3B,IACI,WAAc,IAANxB,GAAgBA,KAAM,MAAQW,EAAI5E,EAAE0F,QAAQC,MAAMF,EAAGzG,KAAK4F,EAAEG,MAQxE,CANA,MAAOpC,GAASN,EAAI,CAAEM,MAAOA,EAAS,CACtC,QACI,IACQiC,IAAMA,EAAEe,OAASJ,EAAIvF,EAAU,SAAIuF,EAAE7F,KAAKM,EAElB,CAAhC,QAAU,GAAIqC,EAAG,MAAMA,EAAEM,KAAO,CACpC,CACA,OAAO8C,CACX,CA3C6B1H,OAAOqB,OA0GXrB,OAAOqB,OCrNzB,IAWDwG,EAAa,SCXN,GDY+B,SAACC,GAC3C,OAAOA,EAAIC,QAAQF,GAAY,SAACG,EAAG7D,GAAM,OAACA,EAAIA,EAAE8D,cAAgB,EAAvB,GAC3C,EAVwCjI,OAAOqB,OAAO,MCJ/BgB,MAAM6F,SCAhBC,EAAW,SAACC,GACvB,OAAQ,OAARA,GAA+B,iBAARA,CAAvB,EAEWC,EAAQ,SAAIC,GACvB,GAAe,OAAXA,EACF,OAAOA,EAET,GAAIA,aAAkBC,KACpB,OAAO,IAAIA,KAAKD,EAAOE,WAEzB,GAAIF,aAAkBjG,MAAO,CAC3B,IAAM,EAAK,GAIX,OAHCiG,EAAiB/C,SAAQ,SAACkD,GACzB,EAAGxH,KAAKwH,EACV,IACO,EAAGC,KAAI,SAACxC,GAAW,OAAAmC,EAAWnC,EAAX,G,CAE5B,GAAsB,iBAAXoC,GAAuBtI,OAAO2I,KAAKL,GAAQnG,OAAQ,CAC5D,IAAM,EAAK,KAAMmG,GAMjB,OAHAtI,OAAO2I,KAAK,GAAIpD,SAAQ,SAACqD,GACvB,EAAGA,GAAKP,EAAW,EAAGO,GACxB,IACO,C,CAET,OAAON,CACT,ECbaO,EAAkB,SAACC,EAAYrE,GAC1C,IAAMsE,EAAWD,EAAKrE,GACtB,OAAI0D,EAASY,GACJA,EAASC,KAEXD,CACT,ECEaE,EAAuB,SAClCC,EACAlC,EAMAmC,GAEA,YAFA,IAAAA,IAAAA,GAAA,GAEKnC,GAAmB,IAAVA,EA5BC,mBAwCAA,EACNA,EC5CM,iBD8CFA,EACJ,WAAM,OAAAA,CAAA,EAEX,EAAQA,GACH,WACL,GAAImC,EAAgB,CAClB,IAAMC,EAAMC,KAAKD,IAAG,MAARC,KLmHb,SAAuBC,EAAIC,EAAMC,GACpC,GAAIA,GAA6B,IAArBzG,UAAUZ,OAAc,IAAK,IAA4BuF,EAAxBzF,EAAI,EAAGC,EAAIqH,EAAKpH,OAAYF,EAAIC,EAAGD,KACxEyF,GAAQzF,KAAKsH,IACR7B,IAAIA,EAAKrF,MAAMpC,UAAU2B,MAAMD,KAAK4H,EAAM,EAAGtH,IAClDyF,EAAGzF,GAAKsH,EAAKtH,IAGrB,OAAOqH,EAAGxH,OAAO4F,GAAMrF,MAAMpC,UAAU2B,MAAMD,KAAK4H,GACtD,CK3HwB,MAASvC,IAAkB,IAC3C,OAAOyC,MAAML,GAAOF,EAAeE,C,CAErC,OAAOpC,CACT,EAEEmB,EAASnB,GACJ,WACL,GAAImC,EAAgB,CAClB,IAAMC,EAAMC,KAAKD,IAAIpC,EAAM0C,MAAO1C,EAAM2C,QACxC,OAAOF,MAAML,GAAOF,EAAeE,C,CAErC,MAAO,CAACpC,EAAM0C,MAAO1C,EAAM2C,OAC7B,EAEK,WAAM,OAAAT,CAAA,EAnCJ,SAAC3E,GACN,OAAIA,EAAEqF,KACA,EAAQrF,EAAEqF,MACLrF,EAAEqF,KAAK,GAAKrF,EAAEqF,KAAK,GAAKrF,EAAEqF,KAAK,GAAKrF,EAAEqF,KAAK,GAChDzB,EAAS5D,EAAEqF,MACNrF,EAAEqF,KAAKF,MAAQnF,EAAEqF,KAAKD,OAASpF,EAAEqF,KAAKF,MAAQnF,EAAEqF,KAAKD,OACvDpF,EAAEqF,KAEJV,CACT,CA2BJ,EEvDMW,EAA0D,CAC9DC,OAAQ,KACRC,YAAa,KACbC,UAAW,KACXC,WAAY,EACZC,SAAU,EAAIb,KAAKc,GACnBC,WAAW,EACXC,UAAW,EACXC,SAAU,KACVC,WAAY,GAkBd,aAGE,WAAmBC,QAAA,IAAAA,IAAAA,EAAiC,CAAC,GAAlC,KAAAA,QAAAA,EAFnB,KAAA9F,GAAK,WAGH1E,OAAO6E,OAAOpE,KAAK+J,QAASX,EAAyBW,EACvD,CAwJF,OAnJE,YAAAC,QAAA,SAAQC,EAAoCF,GAC1C,OAAO/J,KAAKkK,uBAAsB,EAAOD,EAAOF,EAClD,EAKA,YAAA3F,OAAA,SAAO6F,EAAoCF,GAA3C,WACEE,EAAME,OAAM,WACV,EAAKD,uBAAsB,EAAMD,EAAOF,EAC1C,GACF,EAEQ,YAAAG,sBAAR,SAA8B9F,EAAiB6F,EAAoCF,GACjF,IAAMK,EAAgB,OAAKpK,KAAK+J,SAAYA,GACpCd,EAAmLmB,EAAa,MAAzLlB,EAA4KkB,EAAa,OAAjLC,EAAoKD,EAAa,OAAzKR,EAA4JQ,EAAa,UAA9J,EAAiJA,EAAa,WAA9JZ,OAAU,IAAG,IAAC,EAAE,EAAiIY,EAAa,SAA9IX,OAAQ,IAAG,IAAIb,KAAKc,GAAE,EAAEI,EAAyGM,EAAa,WAA1GP,EAA6FO,EAAa,SAAhGT,EAAmFS,EAAa,UAAxEE,EAA2DF,EAAa,YAA5CG,EAA+BH,EAAa,SAA7BI,EAAgBJ,EAAa,YAElMK,EAAQR,EAAMS,cACdC,EAAQV,EAAMW,cACdnF,EAAIgF,EAAM/I,OAGhB,GAAU,IAAN+D,EAIF,OAHI+E,GACFA,IAEK,CACLC,MAAO,GACPE,MAAO,IAKL,QA0QV,SAAyB1B,EAA2BC,EAA4BmB,GAC9E,IAAIQ,EAAkB5B,EAClB6B,EAAmB5B,EACnB6B,EAAmBV,EAUvB,OATKQ,GAAqC,oBAAXG,SAC7BH,EAAkBG,OAAOC,YAEtBH,GAAsC,oBAAXE,SAC9BF,EAAmBE,OAAOE,aAEvBH,IACHA,EAAmB,CAACF,EAAmB,EAAGC,EAAoB,IAEzD,CAACD,EAAkBC,EAAmBC,EAC/C,CAxRkEI,CAAgBlC,EAAOC,EAAQmB,GAAO,GAA7FQ,EAAe,KAAEC,EAAgB,KAAEC,EAAgB,KAG1D,GAAU,IAANtF,EASF,OARIrB,IACF6F,EAAMmB,eAAeX,EAAM,GAAGxG,GAAI,IAAK8G,EAAiB,IACxDd,EAAMmB,eAAeX,EAAM,GAAGxG,GAAI,IAAK8G,EAAiB,KAGtDP,GACFA,IAEK,CACLC,MAAO,CACL,CACExG,GAAI,UAAGwG,EAAM,GAAGxG,IAChBoH,EAAGN,EAAiB,GACpBO,EAAGP,EAAiB,KAGxBJ,MAAO,IAIX,IAAMY,GAAa9B,EAAWD,GAAc/D,EACtC+F,EAAoB,CAAC,EAC3Bf,EAAM3F,SAAQ,SAAC2G,EAAMjK,GACnBgK,EAAQC,EAAKxH,IAAMzC,CACrB,IACA,IAAMkK,EH3Fe,SACvBjG,EACAkG,EACAhB,GAGA,IADA,IAAMe,EAAoB,GACjBlK,EAAI,EAAGA,EAAIiE,EAAGjE,IACrBkK,EAAQlK,GAAK,CACXoK,GAAI,EACJC,IAAK,EACLC,IAAK,GAGT,OAAKnB,GACLA,EAAM7F,SAAQ,SAACjB,GACb,IAAMkI,EAAS3D,EAAgBvE,EAAG,UAC5BgE,EAASO,EAAgBvE,EAAG,UAC9BkI,GAAUL,EAAQC,EAAWI,MAC/BL,EAAQC,EAAWI,IAASF,KAAO,EACnCH,EAAQC,EAAWI,IAASD,KAAO,GAEjCjE,GAAU6D,EAAQC,EAAW9D,MAC/B6D,EAAQC,EAAW9D,IAAS+D,IAAM,EAClCF,EAAQC,EAAW9D,IAASiE,KAAO,EAEvC,IACOJ,GAbYA,CAcrB,CGgEoBM,CAAUvB,EAAM/I,OAAQ8J,EAASb,GAE3CtB,EAAmCe,EAAa,OAAxCd,EAA2Bc,EAAa,YAA3Bb,EAAca,EAAa,UACtD,GAAIE,EAAkB,CACpB,IAAM,EAAwB9B,EAAqB,GAAI8B,GACjD,EAAqB9B,EAAqB,GAAI+B,GAChD,GAAc,IAClBE,EAAM3F,SAAQ,SAAC2G,GACb,IAAMQ,EAAQ,EAASR,GACnB,EAAcQ,IAAO,EAAcA,EACzC,IACA,IAAI,EAAS,EACbxB,EAAM3F,SAAQ,SAAC2G,EAAMjK,GACN,GAAH,IAANA,EAAoB,GAAe,IACvB,EAAYiK,IAAS,IAAM,GAAe,GAC5D,IACApC,EAAS,GAAU,EAAIT,KAAKc,G,MAClBL,GAAWC,GAAgBC,GAE3BD,GAAeC,EACzBD,EAAcC,EACLD,IAAgBC,IACzBA,EAAYD,GAJZD,EAASyB,EAAmBD,EAAkBA,EAAkB,EAAIC,EAAmB,EAMzF,IAAMoB,EAAQX,EAAYzB,EAEtBqC,EAAqB,GACrBC,EAAY3B,EAAMxC,KAAI,SAACwD,GAAS,OAAAA,EAAK1H,IAAL,IAGlCoI,EAFe,aAAbtC,EAEYwC,EAAiBX,EAASU,EAAWzB,EAAOa,GACpC,sBAAb3B,EAEKwC,EAAiBX,EAASU,EAAWzB,EAAOa,GAAS,GAC7C,WAAb3B,EA8Lf,SACE6B,EACAjB,GAEA,IAAM6B,EAA4B,GAMlC,OALA7B,EAAM3F,SAAQ,SAAC2G,EAAMjK,GACnBiK,EAAKc,OAASb,EAAQlK,GAAGsK,IACzBQ,EAAa9L,KAAKiL,EACpB,IACAa,EAAaE,KAAKC,GACXH,CACT,CAvMoBI,CAAehB,EAASU,GAGxB3B,EAIhB,IADA,IAAMkC,EAAO/D,KAAKgE,KAAKnH,EAAImE,GAClBpI,EAAI,EAAGA,EAAIiE,IAAKjE,EAAG,CAC1B,IAAI4E,EAAIiD,EACHjD,GAAqB,OAAhBkD,GAAsC,OAAdC,IAChCnD,EAAIkD,EAAgB9H,GAAK+H,EAAaD,IAAkB7D,EAAI,IAEzDW,IACHA,EAAI,GAAU,IAAJ5E,GAAYiE,EAAI,IAE5B,IAAIoH,EACFrD,EACChI,EAAImL,EAAQT,EACX,EAAItD,KAAKc,GAAME,EAAchB,KAAKkE,MAAMtL,EAAImL,GAC3ChD,IACHkD,EACEpD,EACCjI,EAAImL,EAAQT,EACX,EAAItD,KAAKc,GAAME,EAAchB,KAAKkE,MAAMtL,EAAImL,IAElDR,EAAY3K,GAAG6J,EAAIN,EAAiB,GAAKnC,KAAKmE,IAAIF,GAASzG,EAC3D+F,EAAY3K,GAAG8J,EAAIP,EAAiB,GAAKnC,KAAKoE,IAAIH,GAASzG,EAC3D+F,EAAY3K,GAAGyL,OAASvB,EAAQlK,GAAGsK,G,CAiBrC,OAdI1H,GACF+H,EAAYrH,SAAQ,SAAC2G,GACnBxB,EAAMiD,cAAczB,EAAKxH,GAAI,CAC3BoH,EAAGI,EAAKJ,EACRC,EAAGG,EAAKH,EACR2B,OAAQxB,EAAKwB,QAEjB,IAGEzC,GACFA,IAGK,CACLC,MAAO0B,EACPxB,MAAK,EAET,EACF,EA7JA,GA6NA,SAAS8B,EAAcxH,EAAcC,GACnC,IAAMiI,EAAUlI,EAAEsH,OACZa,EAAUlI,EAAEqH,OAClB,OAAIY,EAAUC,GACJ,EAEND,EAAUC,EACL,EAEF,CACT,CAEA,SAASf,EACPX,EACAjB,EACAE,EACAa,EACA6B,QAAA,IAAAA,IAAAA,GAAA,GAEA,IAAMC,EAAS1F,EAAM6C,GACf8C,EAAgB,CAACD,EAAO,IACxBE,EAAW,CAAC/C,EAAM,IAClBgD,EAAuB,GACvBhI,EAAIgF,EAAM/I,OAChB+L,EAAU,IAAK,EAtFjB,SACEhD,EACAE,EACAa,EACA6B,GAEA5C,EAAM3F,SAAQ,SAACyC,EAAG/F,GAChBiJ,EAAMjJ,GAAGkM,SAAW,GACpBjD,EAAMjJ,GAAGmM,OAAS,EACpB,IACIN,EACF1C,EAAM7F,SAAQ,SAACjB,GACb,IAAMkI,EAAS3D,EAAgBvE,EAAG,UAC5BgE,EAASO,EAAgBvE,EAAG,UAC9B+J,EAAY,EACZ7B,IACF6B,EAAYpC,EAAQO,IAEtB,IAAI8B,EAAY,EACZhG,IACFgG,EAAYrC,EAAQ3D,IAEtB,IAAMiG,EAAQrD,EAAMmD,GAAWF,SACzBC,EAASlD,EAAMoD,GAAWF,OAChCG,EAAMtN,KAAKiK,EAAMoD,GAAW5J,IAC5B0J,EAAOnN,KAAKiK,EAAMmD,GAAW3J,GAC/B,IAEA0G,EAAM7F,SAAQ,SAACjB,GACb,IAAMkI,EAAS3D,EAAgBvE,EAAG,UAC5BgE,EAASO,EAAgBvE,EAAG,UAC9B+J,EAAY,EACZ7B,IACF6B,EAAYpC,EAAQO,IAEtB,IAAI8B,EAAY,EACZhG,IACFgG,EAAYrC,EAAQ3D,IAEtB,IAAMkG,EAAiBtD,EAAMmD,GAAWF,SAClCM,EAAiBvD,EAAMoD,GAAWH,SACxCK,EAAevN,KAAKiK,EAAMoD,GAAW5J,IACrC+J,EAAexN,KAAKiK,EAAMmD,GAAW3J,GACvC,GAEJ,CA0CEgK,CAAcX,EAAQ3C,EAAOa,EAAS6B,GACtC,IAAIlF,EAAI,EA8CR,OA7CAmF,EAAOxI,SAAQ,SAACoJ,EAAO1M,GACrB,GAAU,IAANA,EACF,GACGA,IAAMiE,EAAI,GACTiG,EAAQlK,GAAGsK,MAAQJ,EAAQlK,EAAI,GAAGsK,MA9C5C,SAAiB7G,EAAcC,EAAcyF,GAE3C,IADA,IAAM5D,EAAI4D,EAAMjJ,OACPF,EAAI,EAAGA,EAAIuF,EAAGvF,IAAK,CAC1B,IAAMuK,EAAS3D,EAAgBuC,EAAMnJ,GAAI,UACnCqG,EAASO,EAAgBuC,EAAMnJ,GAAI,UACzC,GACGyD,EAAEhB,KAAO8H,GAAU7G,EAAEjB,KAAO4D,GAC5B3C,EAAEjB,KAAO8H,GAAU9G,EAAEhB,KAAO4D,EAE7B,OAAO,C,CAGX,OAAO,CACT,CAkCUsG,CACEZ,EAAcpF,GACd+F,EACAvD,IAEH8C,EAAUjM,GAMN,CAGL,IAFA,IAAMkM,EAAWH,EAAcpF,GAAGuF,SAC9BU,GAAa,EACR1L,EAAI,EAAGA,EAAIgL,EAAShM,OAAQgB,IAAK,CACxC,IAAM2L,EAAW7C,EAAQkC,EAAShL,IAClC,GAAIgJ,EAAQ2C,GAAUvC,MAAQJ,EAAQlK,GAAGsK,MAAQ2B,EAAUY,GAAW,CACpEd,EAAc/M,KAAK8M,EAAOe,IAC1Bb,EAAShN,KAAKiK,EAAMe,EAAQ8B,EAAOe,GAAUpK,MAC7CwJ,EAAUY,IAAY,EACtBD,GAAa,EACb,K,EAIJ,IADA,IAAIE,EAAK,GACDF,IACDX,EAAUa,KACbf,EAAc/M,KAAK8M,EAAOgB,IAC1Bd,EAAShN,KAAKiK,EAAMe,EAAQ8B,EAAOgB,GAAIrK,MACvCwJ,EAAUa,IAAM,EAChBF,GAAa,KAEfE,IACW7I,K,MA1Bb8H,EAAc/M,KAAK0N,GACnBV,EAAShN,KAAKiK,EAAMe,EAAQ0C,EAAMjK,MAClCwJ,EAAUjM,IAAK,EACf2G,GA6BN,IACOqF,CACT,C,wCC3Tae,EAAkB,CAI7BC,iBAAkB,OAKlBC,WAAY,aAwBd,cAYE,WACUxE,EACAyE,EACR3E,GAHF,MAOE,cAAO,K,OANC,EAAAE,MAAAA,EACA,EAAAyE,OAAAA,EAcR,EAAKC,c,CACP,CA+EF,OR1IO,SAAmB7K,EAAGoB,GACzB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAI9E,UAAU,uBAAyBwO,OAAO1J,GAAK,iCAE7D,SAAS2J,IAAO7O,KAAK8O,YAAchL,CAAG,CADtC0C,EAAc1C,EAAGoB,GAEjBpB,EAAEtE,UAAkB,OAAN0F,EAAa3F,OAAOqB,OAAOsE,IAAM2J,EAAGrP,UAAY0F,EAAE1F,UAAW,IAAIqP,EACnF,CQwBgC,MA+B9B,YAAAF,YAAA,WACM3O,KAAKyD,QACPzD,KAAKyD,OAAOsL,YAWd/O,KAAKyD,OAAS,MAEVzD,KAAKgP,UACPhP,KAAKgP,SAAU,EACfhP,KAAKiP,QAET,EAEA,YAAAA,MAAA,sBACE,GAAIjP,KAAKgP,QAAS,OAAOhP,KAEzBA,KAAKgP,SAAU,EAGf,IAAME,EAAU,CACdR,OAAQ,CACNzK,GAAIjE,KAAK0O,OAAOzK,GAChB8F,QAAS/J,KAAK0O,OAAO3E,SAEvBU,MAAOzK,KAAKiK,MAAMS,cAClBC,MAAO3K,KAAKiK,MAAMW,eAQduE,EAA4B,IAAIC,aAAa,CAAC,IAepD,OAJApP,KAAKyD,OAAO4L,gBAAgBH,EAAS,CAACC,IAA4BG,MAAK,SAAC,G,IAAA,SAACC,EAAS,KAAe,KAC/F,EAAKzN,KAAKyM,EAAgBE,WAAYc,EACxC,IAEOvP,IACT,EAEA,YAAAwP,KAAA,WAEE,OADAxP,KAAKgP,SAAU,EACRhP,IACT,EAEA,YAAAyP,KAAA,WACMzP,KAAKyD,QACPzD,KAAKyD,OAAOsL,WAMhB,EAEA,YAAAW,UAAA,WACE,OAAO1P,KAAKgP,OACd,EACF,EA5GA,CAAgC,KClDnBW,EAAuD,CAClEC,SAAUC,GAEL,SAASC,EAAe7L,EAAYyK,GACzCiB,EAAS1L,GAAMyK,CACjB,CCRO,MAAMqB,EACTvE,QAAU,IAAIwE,IACdC,QAAU,IAAID,IACdE,WAAa,IAAIF,IACjBG,YAAc,IAAIH,IAClBI,YAAc,IAAIJ,IAClBK,QAAU,GACVC,WAAa,EAMbC,UAAY,OA0BZzB,YAAY/E,GACHA,IAEDA,EAAQU,OACRzK,KAAKwQ,SAASzG,EAAQU,OACtBV,EAAQY,OACR3K,KAAKyQ,SAAS1G,EAAQY,OACtBZ,EAAQ2G,MACR1Q,KAAK2Q,QAAQ5G,EAAQ2G,MACrB3G,EAAQwG,YACRvQ,KAAKuQ,UAAYxG,EAAQwG,WACjC,CAsBApG,MAAStK,IACLG,KAAKsQ,YAAc,EACnBzQ,IACAG,KAAKsQ,YAAc,EACdtQ,KAAKsQ,YACNtQ,KAAK4Q,QACT,EAKJA,SACI,MAAMP,EAAUrQ,KAAKqQ,QACrBrQ,KAAKqQ,QAAU,GACfrQ,KAAKuQ,UAAU,CACXtG,MAAOjK,KACPqQ,WAER,CA0BAQ,cAAcR,GACV,IAAIS,EAAgB,GA8GpB,OA7GAT,EAAQvL,SAASiM,IACb,OAAQA,EAAO/M,MACX,IAAK,cAAe,CAKhB,IAAIgN,GAAe,EACnBF,EAAgBA,EAAcG,QAAQC,IAClC,GAAwB,cAApBA,EAAWlN,KAAsB,CACjC,MAAMmN,EAASD,EAAW3K,MAAMtC,KAAO8M,EAAOxK,MAAMtC,GAIpD,OAHIkN,IACAH,GAAe,IAEXG,CACZ,CACK,MAAwB,oBAApBD,EAAWlN,KACTkN,EAAWjN,KAAO8M,EAAOxK,MAAMtC,GAEb,yBAApBiN,EAAWlN,MACTkN,EAAWE,SAAWL,EAAOxK,MAAMtC,EAEnC,IAEV+M,GACDF,EAActQ,KAAKuQ,GAEvB,KACJ,CACA,IAAK,cAAe,CAKhB,IAAIC,GAAe,EACnBF,EAAgBA,EAAcG,QAAQC,IAClC,GAAwB,cAApBA,EAAWlN,KAAsB,CACjC,MAAMmN,EAASD,EAAW3K,MAAMtC,KAAO8M,EAAOxK,MAAMtC,GAIpD,OAHIkN,IACAH,GAAe,IAEXG,CACZ,CACK,MAAwB,oBAApBD,EAAWlN,MACI,gBAApBkN,EAAWlN,MACJkN,EAAWjN,KAAO8M,EAAOxK,MAAMtC,EAE/B,IAEV+M,GACDF,EAActQ,KAAKuQ,GAEvB,KACJ,CACA,IAAK,kBACL,IAAK,kBACL,IAAK,cAAe,CAIhB,MAAMM,EAAiBP,EAAcQ,MAAMJ,GAC/BA,EAAWlN,OAAS+M,EAAO/M,MAC/BkN,EAAWjN,KAAO8M,EAAO9M,IACzBiN,EAAWK,eAAiBR,EAAOQ,eAEvCF,EACAA,EAAeG,SAAWT,EAAOS,SAGjCV,EAActQ,KAAKuQ,GAEvB,KACJ,CACA,IAAK,wBAIDD,EAAgBA,EAAcG,QAAQC,GACV,0BAApBA,EAAWlN,KACJkN,EAAWO,UAAYV,EAAOU,QAEZ,yBAApBP,EAAWlN,MACTkN,EAAWO,UAAYV,EAAOU,UAI7CX,EAActQ,KAAKuQ,GACnB,MAEJ,IAAK,uBAAwB,CACzB,MAAMM,EAAiBP,EAAcQ,MAAMJ,GACX,yBAApBA,EAAWlN,MACfkN,EAAWO,UAAYV,EAAOU,SAC9BP,EAAWE,SAAWL,EAAOK,SAEjCC,EACAA,EAAeK,YACXX,EAAOW,YAGXZ,EAActQ,KAAKuQ,GAEvB,KACJ,CACA,QACID,EAActQ,KAAKuQ,GAE3B,IAEGD,CACX,CAEAa,mBAAmB1N,GACf,IAAKjE,KAAK4R,QAAQ3N,GACd,MAAM,IAAII,MAAM,0BAA4BJ,EAEpD,CAKA2N,QAAQ3N,GACJ,OAAOjE,KAAKwL,QAAQlM,IAAI2E,EAC5B,CAKA4N,aAAaC,EAAaC,GAEtB,OADA/R,KAAK2R,mBAAmBG,GACjB9R,KAAKgS,aAAaD,GAAcE,MAAMC,GAAaA,EAASjO,KAAO6N,GAC9E,CAKAK,QAAQlO,GAEJ,OADAjE,KAAK2R,mBAAmB1N,GACjBjE,KAAKwL,QAAQvF,IAAIhC,EAC5B,CAOAmO,gBAAgBnO,EAAIoO,GAChBrS,KAAK2R,mBAAmB1N,GACxB,MAAMqO,EAAUtS,KAAKkQ,WAAWjK,IAAIhC,GAC9BsO,EAAWvS,KAAKmQ,YAAYlK,IAAIhC,GACtC,GAAkB,OAAdoO,EACA,OAAOzQ,MAAMkH,KAAKwJ,GAEjB,GAAkB,QAAdD,EACL,OAAOzQ,MAAMkH,KAAKyJ,GAEtB,MAAMC,EAAY,IAAIC,IAAI,IAAIH,KAAYC,IAC1C,OAAO3Q,MAAMkH,KAAK0J,EACtB,CAKAxG,UAAU/H,EAAIoO,GACV,OAAOrS,KAAKoS,gBAAgBnO,EAAIoO,GAAW3Q,MAC/C,CAIAgR,cAAczO,GACV,MACM0O,EADW3S,KAAKoS,gBAAgBnO,EAAI,OACjBgE,KAAKI,GAASA,EAAKR,SAC5C,OAAOjG,MAAMkH,KAAK,IAAI2J,IAAIE,IAAU1K,KAAKhE,GAAOjE,KAAKmS,QAAQlO,IACjE,CAIA2O,gBAAgB3O,GACZ,MACM4O,EADU7S,KAAKoS,gBAAgBnO,EAAI,MACjBgE,KAAKI,GAASA,EAAK0D,SAC3C,OAAOnK,MAAMkH,KAAK,IAAI2J,IAAII,IAAU5K,KAAKhE,GAAOjE,KAAKmS,QAAQlO,IACjE,CAMA+N,aAAa/N,GACT,MAAM6O,EAAe9S,KAAK4S,gBAAgB3O,GACpC8O,EAAa/S,KAAK0S,cAAczO,GACtC,OAAOrC,MAAMkH,KAAK,IAAI2J,IAAI,IAAIK,KAAiBC,IACnD,CACAC,UAAUvH,GACN,GAAIzL,KAAK4R,QAAQnG,EAAKxH,IAClB,MAAM,IAAII,MAAM,wBAA0BoH,EAAKxH,IAEnDjE,KAAKwL,QAAQyH,IAAIxH,EAAKxH,GAAIwH,GAC1BzL,KAAKkQ,WAAW+C,IAAIxH,EAAKxH,GAAI,IAAIwO,KACjCzS,KAAKmQ,YAAY8C,IAAIxH,EAAKxH,GAAI,IAAIwO,KAClCzS,KAAKoQ,YAAYtL,SAAS4L,IACtBA,EAAKwC,YAAYD,IAAIxH,EAAKxH,GAAI,IAAIwO,IAAM,IAE5CzS,KAAKqQ,QAAQ7P,KAAK,CAAEwD,KAAM,YAAauC,MAAOkF,GAClD,CAKA+E,SAAS/F,GACLzK,KAAKmK,OAAM,KACP,IAAK,MAAMsB,KAAQhB,EACfzK,KAAKgT,UAAUvH,EACnB,GAER,CAKA0H,QAAQ1H,GACJzL,KAAKwQ,SAAS,CAAC/E,GACnB,CACA2H,aAAanP,GACT,MAAMwH,EAAOzL,KAAKmS,QAAQlO,GACpBqO,EAAUtS,KAAKkQ,WAAWjK,IAAIhC,GAC9BsO,EAAWvS,KAAKmQ,YAAYlK,IAAIhC,GACtCqO,GAASxN,SAASuD,GAASrI,KAAKqT,aAAahL,EAAKpE,MAClDsO,GAAUzN,SAASuD,GAASrI,KAAKqT,aAAahL,EAAKpE,MACnDjE,KAAKwL,QAAQ8H,OAAOrP,GACpBjE,KAAKoQ,YAAYtL,SAAS4L,IACtBA,EAAKwC,YAAYjN,IAAIhC,IAAKa,SAASgJ,IAC/B4C,EAAK6C,UAAUD,OAAOxF,EAAM7J,GAAG,IAEnCyM,EAAK6C,UAAUD,OAAOrP,GACtByM,EAAKwC,YAAYI,OAAOrP,EAAG,IAE/BjE,KAAKqQ,QAAQ7P,KAAK,CAAEwD,KAAM,cAAeuC,MAAOkF,GACpD,CAKA+H,YAAYC,GACRzT,KAAKmK,OAAM,KACPsJ,EAAO3O,SAASb,GAAOjE,KAAKoT,aAAanP,IAAI,GAErD,CAKAyP,WAAWzP,GACPjE,KAAKwT,YAAY,CAACvP,GACtB,CAKAmH,eAAenH,EAAIsN,EAAchL,GAC7B,MAAMkF,EAAOzL,KAAKmS,QAAQlO,GAC1BjE,KAAKmK,OAAM,KACP,MAAMwJ,EAAWlI,EAAK1H,KAAKwN,GACrBC,EAAWjL,EACjBkF,EAAK1H,KAAKwN,GAAgBC,EAC1BxR,KAAKqQ,QAAQ7P,KAAK,CACdwD,KAAM,kBACNC,KACAsN,eACAoC,WACAnC,YACF,GAEV,CAMAtE,cAAcjJ,EAAI2P,GACd5T,KAAKmK,OAAM,KACP5K,OAAOsU,QAAQD,GAAO9O,SAAQ,EAAEyM,EAAchL,MAC1CvG,KAAKoL,eAAenH,EAAIsN,EAAchL,EAAM,GAC9C,GAEV,CAEAuN,mBAAmB7P,GACf,IAAKjE,KAAK+T,QAAQ9P,GACd,MAAM,IAAII,MAAM,0BAA4BJ,EAEpD,CAKA8P,QAAQ9P,GACJ,OAAOjE,KAAKiQ,QAAQ3Q,IAAI2E,EAC5B,CAKA+P,QAAQ/P,GAEJ,OADAjE,KAAK8T,mBAAmB7P,GACjBjE,KAAKiQ,QAAQhK,IAAIhC,EAC5B,CAKAgQ,cAAchQ,GACV,MAAMoE,EAAOrI,KAAKgU,QAAQ/P,GAC1B,MAAO,CACHoE,OACA0D,OAAQ/L,KAAKmS,QAAQ9J,EAAK0D,QAC1BlE,OAAQ7H,KAAKmS,QAAQ9J,EAAKR,QAElC,CACAqM,UAAU7L,GACN,GAAIrI,KAAK+T,QAAQ1L,EAAKpE,IAClB,MAAM,IAAII,MAAM,wBAA0BgE,EAAKpE,IAEnDjE,KAAK2R,mBAAmBtJ,EAAK0D,QAC7B/L,KAAK2R,mBAAmBtJ,EAAKR,QAC7B7H,KAAKiQ,QAAQgD,IAAI5K,EAAKpE,GAAIoE,GAC1B,MAAMiK,EAAUtS,KAAKkQ,WAAWjK,IAAIoC,EAAKR,QACnC0K,EAAWvS,KAAKmQ,YAAYlK,IAAIoC,EAAK0D,QAC3CuG,EAAQ6B,IAAI9L,GACZkK,EAAS4B,IAAI9L,GACbrI,KAAKqQ,QAAQ7P,KAAK,CAAEwD,KAAM,YAAauC,MAAO8B,GAClD,CAKAoI,SAAS9F,GACL3K,KAAKmK,OAAM,KACP,IAAK,MAAM9B,KAAQsC,EACf3K,KAAKkU,UAAU7L,EACnB,GAER,CAaA+L,QAAQ/L,GACJrI,KAAKyQ,SAAS,CAACpI,GACnB,CACAgL,aAAapP,GACT,MAAMoE,EAAOrI,KAAKgU,QAAQ/P,GACpBsO,EAAWvS,KAAKmQ,YAAYlK,IAAIoC,EAAK0D,QACrCuG,EAAUtS,KAAKkQ,WAAWjK,IAAIoC,EAAKR,QACzC0K,EAASe,OAAOjL,GAChBiK,EAAQgB,OAAOjL,GACfrI,KAAKiQ,QAAQqD,OAAOrP,GACpBjE,KAAKqQ,QAAQ7P,KAAK,CAAEwD,KAAM,cAAeuC,MAAO8B,GACpD,CAKAgM,YAAYZ,GACRzT,KAAKmK,OAAM,KACPsJ,EAAO3O,SAASb,GAAOjE,KAAKqT,aAAapP,IAAI,GAErD,CAKAqQ,WAAWrQ,GACPjE,KAAKqU,YAAY,CAACpQ,GACtB,CAKAsQ,iBAAiBtQ,EAAI8H,GACjB,MAAM1D,EAAOrI,KAAKgU,QAAQ/P,GAC1BjE,KAAK2R,mBAAmB5F,GACxB,MAAMyI,EAAYnM,EAAK0D,OACjB0I,EAAY1I,EAClB/L,KAAKmQ,YAAYlK,IAAIuO,GAAWlB,OAAOjL,GACvCrI,KAAKmQ,YAAYlK,IAAIwO,GAAWN,IAAI9L,GACpCA,EAAK0D,OAASA,EACd/L,KAAKmK,OAAM,KACPnK,KAAKqQ,QAAQ7P,KAAK,CACdwD,KAAM,cACNC,KACAsN,aAAc,SACdoC,SAAUa,EACVhD,SAAUiD,GACZ,GAEV,CAKAC,iBAAiBzQ,EAAI4D,GACjB,MAAMQ,EAAOrI,KAAKgU,QAAQ/P,GAC1BjE,KAAK2R,mBAAmB9J,GACxB,MAAM8M,EAAYtM,EAAKR,OACjB+M,EAAY/M,EAClB7H,KAAKkQ,WAAWjK,IAAI0O,GAAWrB,OAAOjL,GACtCrI,KAAKkQ,WAAWjK,IAAI2O,GAAWT,IAAI9L,GACnCA,EAAKR,OAASA,EACd7H,KAAKmK,OAAM,KACPnK,KAAKqQ,QAAQ7P,KAAK,CACdwD,KAAM,cACNC,KACAsN,aAAc,SACdoC,SAAUgB,EACVnD,SAAUoD,GACZ,GAEV,CAKAC,eAAe5Q,EAAIsN,EAAchL,GAC7B,MAAM8B,EAAOrI,KAAKgU,QAAQ/P,GAC1BjE,KAAKmK,OAAM,KACP,MAAMwJ,EAAWtL,EAAKtE,KAAKwN,GACrBC,EAAWjL,EACjB8B,EAAKtE,KAAKwN,GAAgBC,EAC1BxR,KAAKqQ,QAAQ7P,KAAK,CACdwD,KAAM,kBACNC,KACAsN,eACAoC,WACAnC,YACF,GAEV,CAIAsD,cAAc7Q,EAAI2P,GACd5T,KAAKmK,OAAM,KACP5K,OAAOsU,QAAQD,GAAO9O,SAAQ,EAAEyM,EAAchL,MAC1CvG,KAAK6U,eAAe5Q,EAAIsN,EAAchL,EAAM,GAC9C,GAEV,CAEAwO,mBAAmBtD,GACf,IAAKzR,KAAKoQ,YAAY9Q,IAAImS,GACtB,MAAM,IAAIpN,MAAM,yCAA2CoN,EAEnE,CAiBAuD,oBAAoBvD,GACZzR,KAAKoQ,YAAY9Q,IAAImS,KAIzBzR,KAAKoQ,YAAY6C,IAAIxB,EAAS,CAC1B8B,UAAW,IAAIvD,IACfkD,YAAa,IAAIlD,MAErBhQ,KAAKmK,OAAM,KACPnK,KAAKqQ,QAAQ7P,KAAK,CACdwD,KAAM,wBACNyN,WACF,IAEV,CAUAwD,oBAAoBxD,GAChBzR,KAAK+U,mBAAmBtD,GACxBzR,KAAKoQ,YAAYkD,OAAO7B,GACxBzR,KAAKmK,OAAM,KACPnK,KAAKqQ,QAAQ7P,KAAK,CACdwD,KAAM,wBACNyN,WACF,GAEV,CAmBAd,QAAQD,EAAMe,GACVzR,KAAKmK,OAAM,KACPnK,KAAKgV,oBAAoBvD,GAEzB,MAAMhH,EAAQ,GACRyK,EAAQtT,MAAM6F,QAAQiJ,GAAQA,EAAO,CAACA,GAC5C,KAAOwE,EAAMxT,QAAQ,CACjB,MAAM+J,EAAOyJ,EAAMC,QACnB1K,EAAMjK,KAAKiL,GACPA,EAAKiC,UACLwH,EAAM1U,QAAQiL,EAAKiC,SAE3B,CACA1N,KAAKwQ,SAAS/F,GAEdA,EAAM3F,SAAS6I,IACXA,EAAOD,UAAU5I,SAASgJ,IACtB9N,KAAKoV,UAAUtH,EAAM7J,GAAI0J,EAAO1J,GAAIwN,EAAQ,GAC9C,GACJ,GAEV,CA0DA4D,SAAS5D,GAEL,OADAzR,KAAK+U,mBAAmBtD,GACjBzR,KAAK0K,cAAcuG,QAAQxF,IAAUzL,KAAKsV,UAAU7J,EAAKxH,GAAIwN,IACxE,CAKA8D,YAAYtR,EAAIwN,GACZzR,KAAK2R,mBAAmB1N,GACxBjE,KAAK+U,mBAAmBtD,GACxB,MACM/D,EADO1N,KAAKoQ,YAAYnK,IAAIwL,GACZyB,YAAYjN,IAAIhC,GACtC,OAAOrC,MAAMkH,KAAK4E,GAAY,GAClC,CAMA4H,UAAUrR,EAAIwN,GAIV,OAHAzR,KAAK2R,mBAAmB1N,GACxBjE,KAAK+U,mBAAmBtD,GACXzR,KAAKoQ,YAAYnK,IAAIwL,GACtB8B,UAAUtN,IAAIhC,IAAO,IACrC,CAQAmR,UAAUnR,EAAI0J,EAAQ8D,GAClBzR,KAAK+U,mBAAmBtD,GACxB,MAAMf,EAAO1Q,KAAKoQ,YAAYnK,IAAIwL,GAC5BhG,EAAOzL,KAAKmS,QAAQlO,GACpBuR,EAAY9E,EAAK6C,UAAUtN,IAAIhC,GAC/BwR,EAAYzV,KAAKmS,QAAQxE,GAE/B+C,EAAK6C,UAAUN,IAAIhP,EAAIwR,GAEnBD,GACA9E,EAAKwC,YAAYjN,IAAIuP,EAAUvR,KAAKqP,OAAO7H,GAE/C,IAAIiC,EAAWgD,EAAKwC,YAAYjN,IAAIwP,EAAUxR,IACzCyJ,IACDA,EAAW,IAAI+E,IACf/B,EAAKwC,YAAYD,IAAIwC,EAAUxR,GAAIyJ,IAEvCA,EAASyG,IAAI1I,GACbzL,KAAKmK,OAAM,KACPnK,KAAKqQ,QAAQ7P,KAAK,CACdwD,KAAM,uBACNyN,UACAL,OAAQnN,EACRyR,YAAaF,GAAWvR,GACxByN,YAAa+D,EAAUxR,IACzB,GAEV,CAKAyG,cACI,OAAO9I,MAAMkH,KAAK9I,KAAKwL,QAAQmK,SACnC,CAIA/K,cACI,OAAOhJ,MAAMkH,KAAK9I,KAAKiQ,QAAQ0F,SACnC,CACAC,MAAMC,EAAOC,EAASjW,GAClB,KAAOgW,EAAMnU,QAAQ,CACjB,MAAM+J,EAAOoK,EAAMV,QACnBtV,EAAG4L,GACHqK,EAAQ3B,IAAI1I,EAAKxH,IACjBjE,KAAK0S,cAAcjH,EAAKxH,IAAIa,SAASW,IAC5BqQ,EAAQxW,IAAImG,EAAExB,MACf6R,EAAQ3B,IAAI1O,EAAExB,IACd4R,EAAMrV,KAAKiF,GACf,GAER,CACJ,CACAsQ,IAAI9R,EAAIpE,GACJG,KAAK4V,MAAM,CAAC5V,KAAKmS,QAAQlO,IAAM,IAAIwO,IAAO5S,EAC9C,CACAmW,MAAMvK,EAAMqK,EAASjW,GACjBA,EAAG4L,GACHqK,EAAQ3B,IAAI1I,EAAKxH,IACjBjE,KAAK0S,cAAcjH,EAAKxH,IAAIa,SAASW,IAC5BqQ,EAAQxW,IAAImG,EAAExB,KACfjE,KAAKgW,MAAMvQ,EAAGqQ,EAASjW,EAC3B,GAER,CACAoW,IAAIhS,EAAIpE,GACJG,KAAKgW,MAAMhW,KAAKmS,QAAQlO,GAAK,IAAIwO,IAAO5S,EAC5C,CACA+H,QAEI,MAAMsO,EAAWlW,KAAK0K,cAAczC,KAAKkO,IAC9B,IAAKA,EAASpS,KAAM,IAAKoS,EAAQpS,UAEtCqS,EAAWpW,KAAK4K,cAAc3C,KAAKoO,IAC9B,IAAKA,EAAStS,KAAM,IAAKsS,EAAQtS,UAGtCuS,EAAW,IAAIvG,EAAM,CACvBtF,MAAOyL,EACPvL,MAAOyL,IAiBX,OAdApW,KAAKoQ,YAAYtL,SAAQ,EAAGyO,UAAWgD,EAAcrD,YAAasD,GAAkB/E,KAChF,MAAM8B,EAAY,IAAIvD,IACtBuG,EAAazR,SAAQ,CAAC6I,EAAQ9H,KAC1B0N,EAAUN,IAAIpN,EAAKyQ,EAASnE,QAAQxE,EAAO1J,IAAI,IAEnD,MAAMiP,EAAc,IAAIlD,IACxBwG,EAAe1R,SAAQ,CAAC4I,EAAU7H,KAC9BqN,EAAYD,IAAIpN,EAAK,IAAI4M,IAAI7Q,MAAMkH,KAAK4E,GAAUzF,KAAKxC,GAAM6Q,EAASnE,QAAQ1M,EAAExB,OAAM,IAE1FqS,EAASlG,YAAY6C,IAAIxB,EAAS,CAC9B8B,UAAWA,EACXL,YAAaA,GACf,IAECoD,CACX,CACAG,SACI,OAAOC,KAAKC,UAAU,CAClBlM,MAAOzK,KAAK0K,cACZC,MAAO3K,KAAK4K,eAGpB,E","sources":["webpack://Layout/../../node_modules/eventemitter3/index.js","webpack://Layout/./src/worker.ts","webpack://Layout/./node_modules/workerize-loader/dist/rpc-wrapper.js","webpack://Layout/webpack/bootstrap","webpack://Layout/webpack/runtime/compat get default export","webpack://Layout/webpack/runtime/define property getters","webpack://Layout/webpack/runtime/hasOwnProperty shorthand","webpack://Layout/webpack/runtime/make namespace object","webpack://Layout/../../node_modules/tslib/tslib.es6.js","webpack://Layout/./src/util/string.ts","webpack://Layout/./src/util/array.ts","webpack://Layout/./src/util/object.ts","webpack://Layout/./src/util/math.ts","webpack://Layout/./src/util/function.ts","webpack://Layout/./src/util/number.ts","webpack://Layout/./src/circular.ts","webpack://Layout/./src/supervisor.ts","webpack://Layout/./src/registry.ts","webpack://Layout/../../node_modules/@antv/graphlib/esm/Graph.js"],"sourcesContent":["'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n  module.exports = EventEmitter;\n}\n","\n\t\t\t\tvar addMethods = require(\"../node_modules/workerize-loader/dist/rpc-wrapper.js\")\n\t\t\t\tvar methods = [\"calculateLayout\"]\n\t\t\t\tmodule.exports = function() {\n\t\t\t\t\tvar w = new Worker(URL.createObjectURL(new Blob([\"(()=>{\\\"use strict\\\";var e={d:(t,r)=>{for(var a in r)e.o(r,a)&&!e.o(t,a)&&Object.defineProperty(t,a,{enumerable:!0,get:r[a]})},o:(e,t)=>Object.prototype.hasOwnProperty.call(e,t)},t={};e.d(t,{calculateLayout:()=>f});class r{nodeMap=new Map;edgeMap=new Map;inEdgesMap=new Map;outEdgesMap=new Map;treeIndices=new Map;changes=[];batchCount=0;onChanged=()=>{};constructor(e){e&&(e.nodes&&this.addNodes(e.nodes),e.edges&&this.addEdges(e.edges),e.tree&&this.addTree(e.tree),e.onChanged&&(this.onChanged=e.onChanged))}batch=e=>{this.batchCount+=1,e(),this.batchCount-=1,this.batchCount||this.commit()};commit(){const e=this.changes;this.changes=[],this.onChanged({graph:this,changes:e})}reduceChanges(e){let t=[];return e.forEach((e=>{switch(e.type){case\\\"NodeRemoved\\\":{let r=!1;t=t.filter((t=>{if(\\\"NodeAdded\\\"===t.type){const a=t.value.id===e.value.id;return a&&(r=!0),!a}return\\\"NodeDataUpdated\\\"===t.type?t.id!==e.value.id:\\\"TreeStructureChanged\\\"!==t.type||t.nodeId!==e.value.id})),r||t.push(e);break}case\\\"EdgeRemoved\\\":{let r=!1;t=t.filter((t=>{if(\\\"EdgeAdded\\\"===t.type){const a=t.value.id===e.value.id;return a&&(r=!0),!a}return\\\"EdgeDataUpdated\\\"!==t.type&&\\\"EdgeUpdated\\\"!==t.type||t.id!==e.value.id})),r||t.push(e);break}case\\\"NodeDataUpdated\\\":case\\\"EdgeDataUpdated\\\":case\\\"EdgeUpdated\\\":{const r=t.find((t=>t.type===e.type&&t.id===e.id&&t.propertyName===e.propertyName));r?r.newValue=e.newValue:t.push(e);break}case\\\"TreeStructureDetached\\\":t=t.filter((t=>\\\"TreeStructureAttached\\\"===t.type?t.treeKey!==e.treeKey:\\\"TreeStructureChanged\\\"!==t.type||t.treeKey!==e.treeKey)),t.push(e);break;case\\\"TreeStructureChanged\\\":{const r=t.find((t=>\\\"TreeStructureChanged\\\"===t.type&&t.treeKey===e.treeKey&&t.nodeId===e.nodeId));r?r.newParentId=e.newParentId:t.push(e);break}default:t.push(e)}})),t}checkNodeExistence(e){if(!this.hasNode(e))throw new Error(\\\"Node not found for id: \\\"+e)}hasNode(e){return this.nodeMap.has(e)}areNeighbors(e,t){return this.checkNodeExistence(e),this.getNeighbors(t).some((t=>t.id===e))}getNode(e){return this.checkNodeExistence(e),this.nodeMap.get(e)}getRelatedEdges(e,t){this.checkNodeExistence(e);const r=this.inEdgesMap.get(e),a=this.outEdgesMap.get(e);if(\\\"in\\\"===t)return Array.from(r);if(\\\"out\\\"===t)return Array.from(a);const d=new Set([...r,...a]);return Array.from(d)}getDegree(e,t){return this.getRelatedEdges(e,t).length}getSuccessors(e){const t=this.getRelatedEdges(e,\\\"out\\\").map((e=>e.target));return Array.from(new Set(t)).map((e=>this.getNode(e)))}getPredecessors(e){const t=this.getRelatedEdges(e,\\\"in\\\").map((e=>e.source));return Array.from(new Set(t)).map((e=>this.getNode(e)))}getNeighbors(e){const t=this.getPredecessors(e),r=this.getSuccessors(e);return Array.from(new Set([...t,...r]))}doAddNode(e){if(this.hasNode(e.id))throw new Error(\\\"Node already exists: \\\"+e.id);this.nodeMap.set(e.id,e),this.inEdgesMap.set(e.id,new Set),this.outEdgesMap.set(e.id,new Set),this.treeIndices.forEach((t=>{t.childrenMap.set(e.id,new Set)})),this.changes.push({type:\\\"NodeAdded\\\",value:e})}addNodes(e){this.batch((()=>{for(const t of e)this.doAddNode(t)}))}addNode(e){this.addNodes([e])}doRemoveNode(e){const t=this.getNode(e),r=this.inEdgesMap.get(e),a=this.outEdgesMap.get(e);r?.forEach((e=>this.doRemoveEdge(e.id))),a?.forEach((e=>this.doRemoveEdge(e.id))),this.nodeMap.delete(e),this.treeIndices.forEach((t=>{t.childrenMap.get(e)?.forEach((e=>{t.parentMap.delete(e.id)})),t.parentMap.delete(e),t.childrenMap.delete(e)})),this.changes.push({type:\\\"NodeRemoved\\\",value:t})}removeNodes(e){this.batch((()=>{e.forEach((e=>this.doRemoveNode(e)))}))}removeNode(e){this.removeNodes([e])}updateNodeData(e,t,r){const a=this.getNode(e);this.batch((()=>{const d=a.data[t],s=r;a.data[t]=s,this.changes.push({type:\\\"NodeDataUpdated\\\",id:e,propertyName:t,oldValue:d,newValue:s})}))}mergeNodeData(e,t){this.batch((()=>{Object.entries(t).forEach((([t,r])=>{this.updateNodeData(e,t,r)}))}))}checkEdgeExistence(e){if(!this.hasEdge(e))throw new Error(\\\"Edge not found for id: \\\"+e)}hasEdge(e){return this.edgeMap.has(e)}getEdge(e){return this.checkEdgeExistence(e),this.edgeMap.get(e)}getEdgeDetail(e){const t=this.getEdge(e);return{edge:t,source:this.getNode(t.source),target:this.getNode(t.target)}}doAddEdge(e){if(this.hasEdge(e.id))throw new Error(\\\"Edge already exists: \\\"+e.id);this.checkNodeExistence(e.source),this.checkNodeExistence(e.target),this.edgeMap.set(e.id,e);const t=this.inEdgesMap.get(e.target),r=this.outEdgesMap.get(e.source);t.add(e),r.add(e),this.changes.push({type:\\\"EdgeAdded\\\",value:e})}addEdges(e){this.batch((()=>{for(const t of e)this.doAddEdge(t)}))}addEdge(e){this.addEdges([e])}doRemoveEdge(e){const t=this.getEdge(e),r=this.outEdgesMap.get(t.source),a=this.inEdgesMap.get(t.target);r.delete(t),a.delete(t),this.edgeMap.delete(e),this.changes.push({type:\\\"EdgeRemoved\\\",value:t})}removeEdges(e){this.batch((()=>{e.forEach((e=>this.doRemoveEdge(e)))}))}removeEdge(e){this.removeEdges([e])}updateEdgeSource(e,t){const r=this.getEdge(e);this.checkNodeExistence(t);const a=r.source,d=t;this.outEdgesMap.get(a).delete(r),this.outEdgesMap.get(d).add(r),r.source=t,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:e,propertyName:\\\"source\\\",oldValue:a,newValue:d})}))}updateEdgeTarget(e,t){const r=this.getEdge(e);this.checkNodeExistence(t);const a=r.target,d=t;this.inEdgesMap.get(a).delete(r),this.inEdgesMap.get(d).add(r),r.target=t,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:e,propertyName:\\\"target\\\",oldValue:a,newValue:d})}))}updateEdgeData(e,t,r){const a=this.getEdge(e);this.batch((()=>{const d=a.data[t],s=r;a.data[t]=s,this.changes.push({type:\\\"EdgeDataUpdated\\\",id:e,propertyName:t,oldValue:d,newValue:s})}))}mergeEdgeData(e,t){this.batch((()=>{Object.entries(t).forEach((([t,r])=>{this.updateEdgeData(e,t,r)}))}))}checkTreeExistence(e){if(!this.treeIndices.has(e))throw new Error(\\\"Tree structure not found for treeKey: \\\"+e)}attachTreeStructure(e){this.treeIndices.has(e)||(this.treeIndices.set(e,{parentMap:new Map,childrenMap:new Map}),this.batch((()=>{this.changes.push({type:\\\"TreeStructureAttached\\\",treeKey:e})})))}detachTreeStructure(e){this.checkTreeExistence(e),this.treeIndices.delete(e),this.batch((()=>{this.changes.push({type:\\\"TreeStructureDetached\\\",treeKey:e})}))}addTree(e,t){this.batch((()=>{this.attachTreeStructure(t);const r=[],a=Array.isArray(e)?e:[e];for(;a.length;){const e=a.shift();r.push(e),e.children&&a.push(...e.children)}this.addNodes(r),r.forEach((e=>{e.children?.forEach((r=>{this.setParent(r.id,e.id,t)}))}))}))}getRoots(e){return this.checkTreeExistence(e),this.getAllNodes().filter((t=>!this.getParent(t.id,e)))}getChildren(e,t){this.checkNodeExistence(e),this.checkTreeExistence(t);const r=this.treeIndices.get(t).childrenMap.get(e);return Array.from(r||[])}getParent(e,t){return this.checkNodeExistence(e),this.checkTreeExistence(t),this.treeIndices.get(t).parentMap.get(e)||null}setParent(e,t,r){this.checkTreeExistence(r);const a=this.treeIndices.get(r),d=this.getNode(e),s=a.parentMap.get(e),n=this.getNode(t);a.parentMap.set(e,n),s&&a.childrenMap.get(s.id)?.delete(d);let i=a.childrenMap.get(n.id);i||(i=new Set,a.childrenMap.set(n.id,i)),i.add(d),this.batch((()=>{this.changes.push({type:\\\"TreeStructureChanged\\\",treeKey:r,nodeId:e,oldParentId:s?.id,newParentId:n.id})}))}getAllNodes(){return Array.from(this.nodeMap.values())}getAllEdges(){return Array.from(this.edgeMap.values())}doBFS(e,t,r){for(;e.length;){const a=e.shift();r(a),t.add(a.id),this.getSuccessors(a.id).forEach((r=>{t.has(r.id)||(t.add(r.id),e.push(r))}))}}bfs(e,t){this.doBFS([this.getNode(e)],new Set,t)}doDFS(e,t,r){r(e),t.add(e.id),this.getSuccessors(e.id).forEach((e=>{t.has(e.id)||this.doDFS(e,t,r)}))}dfs(e,t){this.doDFS(this.getNode(e),new Set,t)}clone(){const e=this.getAllNodes().map((e=>({...e,data:{...e.data}}))),t=this.getAllEdges().map((e=>({...e,data:{...e.data}}))),a=new r({nodes:e,edges:t});return this.treeIndices.forEach((({parentMap:e,childrenMap:t},r)=>{const d=new Map;e.forEach(((e,t)=>{d.set(t,a.getNode(e.id))}));const s=new Map;t.forEach(((e,t)=>{s.set(t,new Set(Array.from(e).map((e=>a.getNode(e.id)))))})),a.treeIndices.set(r,{parentMap:d,childrenMap:s})})),a}toJSON(){return JSON.stringify({nodes:this.getAllNodes(),edges:this.getAllEdges()})}}var a=function(){return a=Object.assign||function(e){for(var t,r=1,a=arguments.length;r<a;r++)for(var d in t=arguments[r])Object.prototype.hasOwnProperty.call(t,d)&&(e[d]=t[d]);return e},a.apply(this,arguments)};function d(e,t){var r=\\\"function\\\"==typeof Symbol&&e[Symbol.iterator];if(!r)return e;var a,d,s=r.call(e),n=[];try{for(;(void 0===t||t-- >0)&&!(a=s.next()).done;)n.push(a.value)}catch(e){d={error:e}}finally{try{a&&!a.done&&(r=s.return)&&r.call(s)}finally{if(d)throw d.error}}return n}Object.create,Object.create;var s=/-(\\\\w)/g,n=(function(e){return e.replace(s,(function(e,t){return t?t.toUpperCase():\\\"\\\"}))},Object.create(null),Array.isArray),i=function(e){return null!==e&&\\\"object\\\"==typeof e},o=function(e){if(null===e)return e;if(e instanceof Date)return new Date(e.getTime());if(e instanceof Array){var t=[];return e.forEach((function(e){t.push(e)})),t.map((function(e){return o(e)}))}if(\\\"object\\\"==typeof e&&Object.keys(e).length){var r=a({},e);return Object.keys(r).forEach((function(e){r[e]=o(r[e])})),r}return e},h=function(e,t){var r=e[t];return i(r)?r.cell:r},c=function(e,t,r){return void 0===r&&(r=!0),t||0===t?\\\"function\\\"==typeof t?t:\\\"number\\\"==typeof t?function(){return t}:n(t)?function(){if(r){var a=Math.max.apply(Math,function(e,t,r){if(r||2===arguments.length)for(var a,d=0,s=t.length;d<s;d++)!a&&d in t||(a||(a=Array.prototype.slice.call(t,0,d)),a[d]=t[d]);return e.concat(a||Array.prototype.slice.call(t))}([],d(t),!1));return isNaN(a)?e:a}return t}:i(t)?function(){if(r){var a=Math.max(t.width,t.height);return isNaN(a)?e:a}return[t.width,t.height]}:function(){return e}:function(t){return t.size?n(t.size)?t.size[0]>t.size[1]?t.size[0]:t.size[1]:i(t.size)?t.size.width>t.size.height?t.size.width:t.size.height:t.size:e}},u={radius:null,startRadius:null,endRadius:null,startAngle:0,endAngle:2*Math.PI,clockwise:!0,divisions:1,ordering:null,angleRatio:1};function g(e,t){var r=e.degree,a=t.degree;return r<a?-1:r>a?1:0}function p(e,t,r,a,d){void 0===d&&(d=!1);var s=o(t),n=[s[0]],i=[t[0]],c=[],u=t.length;c[0]=!0,function(e,t,r,a){e.forEach((function(t,r){e[r].children=[],e[r].parent=[]})),a?t.forEach((function(t){var a=h(t,\\\"source\\\"),d=h(t,\\\"target\\\"),s=0;a&&(s=r[a]);var n=0;d&&(n=r[d]);var i=e[s].children,o=e[n].parent;i.push(e[n].id),o.push(e[s].id)})):t.forEach((function(t){var a=h(t,\\\"source\\\"),d=h(t,\\\"target\\\"),s=0;a&&(s=r[a]);var n=0;d&&(n=r[d]);var i=e[s].children,o=e[n].children;i.push(e[n].id),o.push(e[s].id)}))}(s,r,a,d);var g=0;return s.forEach((function(d,o){if(0!==o)if(o!==u-1&&e[o].all===e[o+1].all&&!function(e,t,r){for(var a=r.length,d=0;d<a;d++){var s=h(r[d],\\\"source\\\"),n=h(r[d],\\\"target\\\");if(e.id===s&&t.id===n||t.id===s&&e.id===n)return!0}return!1}(n[g],d,r)||c[o]){for(var p=n[g].children,l=!1,f=0;f<p.length;f++){var E=a[p[f]];if(e[E].all===e[o].all&&!c[E]){n.push(s[E]),i.push(t[a[s[E].id]]),c[E]=!0,l=!0;break}}for(var y=0;!l&&(c[y]||(n.push(s[y]),i.push(t[a[s[y].id]]),c[y]=!0,l=!0),++y!==u););}else n.push(d),i.push(t[a[d.id]]),c[o]=!0,g++})),i}var l={circular:function(){function e(e){void 0===e&&(e={}),this.options=e,this.id=\\\"circular\\\",Object.assign(this.options,u,e)}return e.prototype.execute=function(e,t){return this.genericCircularLayout(!1,e,t)},e.prototype.assign=function(e,t){var r=this;e.batch((function(){r.genericCircularLayout(!0,e,t)}))},e.prototype.genericCircularLayout=function(e,t,r){var s=a(a({},this.options),r),n=s.width,i=s.height,o=s.center,u=s.divisions,l=s.startAngle,f=void 0===l?0:l,E=s.endAngle,y=void 0===E?2*Math.PI:E,v=s.angleRatio,N=s.ordering,M=s.clockwise,w=s.nodeSpacing,m=s.nodeSize,b=s.onLayoutEnd,A=t.getAllNodes(),S=t.getAllEdges(),k=A.length;if(0===k)return b&&b(),{nodes:[],edges:[]};var x=d(function(e,t,r){var a=e,d=t,s=r;return a||\\\"undefined\\\"==typeof window||(a=window.innerWidth),d||\\\"undefined\\\"==typeof window||(d=window.innerHeight),s||(s=[a/2,d/2]),[a,d,s]}(n,i,o),3),I=x[0],R=x[1],C=x[2];if(1===k)return e&&(t.updateNodeData(A[0].id,\\\"x\\\",C[0]),t.updateNodeData(A[0].id,\\\"y\\\",C[1])),b&&b(),{nodes:[{id:\\\"\\\".concat(A[0].id),x:C[0],y:C[1]}],edges:[]};var D=(y-f)/k,P={};A.forEach((function(e,t){P[e.id]=t}));var T=function(e,t,r){for(var a=[],d=0;d<e;d++)a[d]={in:0,out:0,all:0};return r?(r.forEach((function(e){var r=h(e,\\\"source\\\"),d=h(e,\\\"target\\\");r&&a[t[r]]&&(a[t[r]].out+=1,a[t[r]].all+=1),d&&a[t[d]]&&(a[t[d]].in+=1,a[t[d]].all+=1)})),a):a}(A.length,P,S),O=s.radius,j=s.startRadius,z=s.endRadius;if(w){var U=c(10,w),K=c(10,m),V=-1/0;A.forEach((function(e){var t=K(e);V<t&&(V=t)}));var L=0;A.forEach((function(e,t){L+=0===t?V||10:(U(e)||0)+(V||10)})),O=L/(2*Math.PI)}else O||j||z?!j&&z?j=z:j&&!z&&(z=j):O=R>I?I/2:R/2;var F=D*v,B=[],J=A.map((function(e){return e.data}));B=\\\"topology\\\"===N?p(T,J,S,P):\\\"topology-directed\\\"===N?p(T,J,S,P,!0):\\\"degree\\\"===N?function(e,t){var r=[];return t.forEach((function(t,a){t.degree=e[a].all,r.push(t)})),r.sort(g),r}(T,J):A;for(var H=Math.ceil(k/u),W=0;W<k;++W){var q=O;q||null===j||null===z||(q=j+W*(z-j)/(k-1)),q||(q=10+100*W/(k-1));var G=f+W%H*F+2*Math.PI/u*Math.floor(W/H);M||(G=y-W%H*F-2*Math.PI/u*Math.floor(W/H)),B[W].x=C[0]+Math.cos(G)*q,B[W].y=C[1]+Math.sin(G)*q,B[W].weight=T[W].all}return e&&B.forEach((function(e){t.mergeNodeData(e.id,{x:e.x,y:e.y,weight:e.weight})})),b&&b(),{nodes:B,edges:S}},e}()};function f(e,t){var a=e.layout,d=a.id,s=a.options,n=e.nodes,i=e.edges,o=new r({nodes:n,edges:i}),h=l[d];if(!h)throw new Error(\\\"Unknown layout id: \\\"+d);return[new h(s).execute(o),t]}addEventListener(\\\"message\\\",(function(e){var r,a=e.data,d=a.type,s=a.method,n=a.id,i=a.params;\\\"RPC\\\"===d&&s&&((r=t[s])?Promise.resolve().then((function(){return r.apply(t,i)})):Promise.reject(\\\"No such method\\\")).then((function(e){postMessage({type:\\\"RPC\\\",id:n,result:e})})).catch((function(e){var t={message:e};e.stack&&(t.message=e.message,t.stack=e.stack,t.name=e.name),postMessage({type:\\\"RPC\\\",id:n,error:t})}))})),postMessage({type:\\\"RPC\\\",method:\\\"ready\\\"})})();\\n//# sourceMappingURL=3a54d760230d1933f953.worker.js.map\"])), { name: \"[fullhash].worker.js\" })\n\t\t\t\t\tURL.revokeObjectURL(URL.createObjectURL(new Blob([\"(()=>{\\\"use strict\\\";var e={d:(t,r)=>{for(var a in r)e.o(r,a)&&!e.o(t,a)&&Object.defineProperty(t,a,{enumerable:!0,get:r[a]})},o:(e,t)=>Object.prototype.hasOwnProperty.call(e,t)},t={};e.d(t,{calculateLayout:()=>f});class r{nodeMap=new Map;edgeMap=new Map;inEdgesMap=new Map;outEdgesMap=new Map;treeIndices=new Map;changes=[];batchCount=0;onChanged=()=>{};constructor(e){e&&(e.nodes&&this.addNodes(e.nodes),e.edges&&this.addEdges(e.edges),e.tree&&this.addTree(e.tree),e.onChanged&&(this.onChanged=e.onChanged))}batch=e=>{this.batchCount+=1,e(),this.batchCount-=1,this.batchCount||this.commit()};commit(){const e=this.changes;this.changes=[],this.onChanged({graph:this,changes:e})}reduceChanges(e){let t=[];return e.forEach((e=>{switch(e.type){case\\\"NodeRemoved\\\":{let r=!1;t=t.filter((t=>{if(\\\"NodeAdded\\\"===t.type){const a=t.value.id===e.value.id;return a&&(r=!0),!a}return\\\"NodeDataUpdated\\\"===t.type?t.id!==e.value.id:\\\"TreeStructureChanged\\\"!==t.type||t.nodeId!==e.value.id})),r||t.push(e);break}case\\\"EdgeRemoved\\\":{let r=!1;t=t.filter((t=>{if(\\\"EdgeAdded\\\"===t.type){const a=t.value.id===e.value.id;return a&&(r=!0),!a}return\\\"EdgeDataUpdated\\\"!==t.type&&\\\"EdgeUpdated\\\"!==t.type||t.id!==e.value.id})),r||t.push(e);break}case\\\"NodeDataUpdated\\\":case\\\"EdgeDataUpdated\\\":case\\\"EdgeUpdated\\\":{const r=t.find((t=>t.type===e.type&&t.id===e.id&&t.propertyName===e.propertyName));r?r.newValue=e.newValue:t.push(e);break}case\\\"TreeStructureDetached\\\":t=t.filter((t=>\\\"TreeStructureAttached\\\"===t.type?t.treeKey!==e.treeKey:\\\"TreeStructureChanged\\\"!==t.type||t.treeKey!==e.treeKey)),t.push(e);break;case\\\"TreeStructureChanged\\\":{const r=t.find((t=>\\\"TreeStructureChanged\\\"===t.type&&t.treeKey===e.treeKey&&t.nodeId===e.nodeId));r?r.newParentId=e.newParentId:t.push(e);break}default:t.push(e)}})),t}checkNodeExistence(e){if(!this.hasNode(e))throw new Error(\\\"Node not found for id: \\\"+e)}hasNode(e){return this.nodeMap.has(e)}areNeighbors(e,t){return this.checkNodeExistence(e),this.getNeighbors(t).some((t=>t.id===e))}getNode(e){return this.checkNodeExistence(e),this.nodeMap.get(e)}getRelatedEdges(e,t){this.checkNodeExistence(e);const r=this.inEdgesMap.get(e),a=this.outEdgesMap.get(e);if(\\\"in\\\"===t)return Array.from(r);if(\\\"out\\\"===t)return Array.from(a);const d=new Set([...r,...a]);return Array.from(d)}getDegree(e,t){return this.getRelatedEdges(e,t).length}getSuccessors(e){const t=this.getRelatedEdges(e,\\\"out\\\").map((e=>e.target));return Array.from(new Set(t)).map((e=>this.getNode(e)))}getPredecessors(e){const t=this.getRelatedEdges(e,\\\"in\\\").map((e=>e.source));return Array.from(new Set(t)).map((e=>this.getNode(e)))}getNeighbors(e){const t=this.getPredecessors(e),r=this.getSuccessors(e);return Array.from(new Set([...t,...r]))}doAddNode(e){if(this.hasNode(e.id))throw new Error(\\\"Node already exists: \\\"+e.id);this.nodeMap.set(e.id,e),this.inEdgesMap.set(e.id,new Set),this.outEdgesMap.set(e.id,new Set),this.treeIndices.forEach((t=>{t.childrenMap.set(e.id,new Set)})),this.changes.push({type:\\\"NodeAdded\\\",value:e})}addNodes(e){this.batch((()=>{for(const t of e)this.doAddNode(t)}))}addNode(e){this.addNodes([e])}doRemoveNode(e){const t=this.getNode(e),r=this.inEdgesMap.get(e),a=this.outEdgesMap.get(e);r?.forEach((e=>this.doRemoveEdge(e.id))),a?.forEach((e=>this.doRemoveEdge(e.id))),this.nodeMap.delete(e),this.treeIndices.forEach((t=>{t.childrenMap.get(e)?.forEach((e=>{t.parentMap.delete(e.id)})),t.parentMap.delete(e),t.childrenMap.delete(e)})),this.changes.push({type:\\\"NodeRemoved\\\",value:t})}removeNodes(e){this.batch((()=>{e.forEach((e=>this.doRemoveNode(e)))}))}removeNode(e){this.removeNodes([e])}updateNodeData(e,t,r){const a=this.getNode(e);this.batch((()=>{const d=a.data[t],s=r;a.data[t]=s,this.changes.push({type:\\\"NodeDataUpdated\\\",id:e,propertyName:t,oldValue:d,newValue:s})}))}mergeNodeData(e,t){this.batch((()=>{Object.entries(t).forEach((([t,r])=>{this.updateNodeData(e,t,r)}))}))}checkEdgeExistence(e){if(!this.hasEdge(e))throw new Error(\\\"Edge not found for id: \\\"+e)}hasEdge(e){return this.edgeMap.has(e)}getEdge(e){return this.checkEdgeExistence(e),this.edgeMap.get(e)}getEdgeDetail(e){const t=this.getEdge(e);return{edge:t,source:this.getNode(t.source),target:this.getNode(t.target)}}doAddEdge(e){if(this.hasEdge(e.id))throw new Error(\\\"Edge already exists: \\\"+e.id);this.checkNodeExistence(e.source),this.checkNodeExistence(e.target),this.edgeMap.set(e.id,e);const t=this.inEdgesMap.get(e.target),r=this.outEdgesMap.get(e.source);t.add(e),r.add(e),this.changes.push({type:\\\"EdgeAdded\\\",value:e})}addEdges(e){this.batch((()=>{for(const t of e)this.doAddEdge(t)}))}addEdge(e){this.addEdges([e])}doRemoveEdge(e){const t=this.getEdge(e),r=this.outEdgesMap.get(t.source),a=this.inEdgesMap.get(t.target);r.delete(t),a.delete(t),this.edgeMap.delete(e),this.changes.push({type:\\\"EdgeRemoved\\\",value:t})}removeEdges(e){this.batch((()=>{e.forEach((e=>this.doRemoveEdge(e)))}))}removeEdge(e){this.removeEdges([e])}updateEdgeSource(e,t){const r=this.getEdge(e);this.checkNodeExistence(t);const a=r.source,d=t;this.outEdgesMap.get(a).delete(r),this.outEdgesMap.get(d).add(r),r.source=t,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:e,propertyName:\\\"source\\\",oldValue:a,newValue:d})}))}updateEdgeTarget(e,t){const r=this.getEdge(e);this.checkNodeExistence(t);const a=r.target,d=t;this.inEdgesMap.get(a).delete(r),this.inEdgesMap.get(d).add(r),r.target=t,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:e,propertyName:\\\"target\\\",oldValue:a,newValue:d})}))}updateEdgeData(e,t,r){const a=this.getEdge(e);this.batch((()=>{const d=a.data[t],s=r;a.data[t]=s,this.changes.push({type:\\\"EdgeDataUpdated\\\",id:e,propertyName:t,oldValue:d,newValue:s})}))}mergeEdgeData(e,t){this.batch((()=>{Object.entries(t).forEach((([t,r])=>{this.updateEdgeData(e,t,r)}))}))}checkTreeExistence(e){if(!this.treeIndices.has(e))throw new Error(\\\"Tree structure not found for treeKey: \\\"+e)}attachTreeStructure(e){this.treeIndices.has(e)||(this.treeIndices.set(e,{parentMap:new Map,childrenMap:new Map}),this.batch((()=>{this.changes.push({type:\\\"TreeStructureAttached\\\",treeKey:e})})))}detachTreeStructure(e){this.checkTreeExistence(e),this.treeIndices.delete(e),this.batch((()=>{this.changes.push({type:\\\"TreeStructureDetached\\\",treeKey:e})}))}addTree(e,t){this.batch((()=>{this.attachTreeStructure(t);const r=[],a=Array.isArray(e)?e:[e];for(;a.length;){const e=a.shift();r.push(e),e.children&&a.push(...e.children)}this.addNodes(r),r.forEach((e=>{e.children?.forEach((r=>{this.setParent(r.id,e.id,t)}))}))}))}getRoots(e){return this.checkTreeExistence(e),this.getAllNodes().filter((t=>!this.getParent(t.id,e)))}getChildren(e,t){this.checkNodeExistence(e),this.checkTreeExistence(t);const r=this.treeIndices.get(t).childrenMap.get(e);return Array.from(r||[])}getParent(e,t){return this.checkNodeExistence(e),this.checkTreeExistence(t),this.treeIndices.get(t).parentMap.get(e)||null}setParent(e,t,r){this.checkTreeExistence(r);const a=this.treeIndices.get(r),d=this.getNode(e),s=a.parentMap.get(e),n=this.getNode(t);a.parentMap.set(e,n),s&&a.childrenMap.get(s.id)?.delete(d);let i=a.childrenMap.get(n.id);i||(i=new Set,a.childrenMap.set(n.id,i)),i.add(d),this.batch((()=>{this.changes.push({type:\\\"TreeStructureChanged\\\",treeKey:r,nodeId:e,oldParentId:s?.id,newParentId:n.id})}))}getAllNodes(){return Array.from(this.nodeMap.values())}getAllEdges(){return Array.from(this.edgeMap.values())}doBFS(e,t,r){for(;e.length;){const a=e.shift();r(a),t.add(a.id),this.getSuccessors(a.id).forEach((r=>{t.has(r.id)||(t.add(r.id),e.push(r))}))}}bfs(e,t){this.doBFS([this.getNode(e)],new Set,t)}doDFS(e,t,r){r(e),t.add(e.id),this.getSuccessors(e.id).forEach((e=>{t.has(e.id)||this.doDFS(e,t,r)}))}dfs(e,t){this.doDFS(this.getNode(e),new Set,t)}clone(){const e=this.getAllNodes().map((e=>({...e,data:{...e.data}}))),t=this.getAllEdges().map((e=>({...e,data:{...e.data}}))),a=new r({nodes:e,edges:t});return this.treeIndices.forEach((({parentMap:e,childrenMap:t},r)=>{const d=new Map;e.forEach(((e,t)=>{d.set(t,a.getNode(e.id))}));const s=new Map;t.forEach(((e,t)=>{s.set(t,new Set(Array.from(e).map((e=>a.getNode(e.id)))))})),a.treeIndices.set(r,{parentMap:d,childrenMap:s})})),a}toJSON(){return JSON.stringify({nodes:this.getAllNodes(),edges:this.getAllEdges()})}}var a=function(){return a=Object.assign||function(e){for(var t,r=1,a=arguments.length;r<a;r++)for(var d in t=arguments[r])Object.prototype.hasOwnProperty.call(t,d)&&(e[d]=t[d]);return e},a.apply(this,arguments)};function d(e,t){var r=\\\"function\\\"==typeof Symbol&&e[Symbol.iterator];if(!r)return e;var a,d,s=r.call(e),n=[];try{for(;(void 0===t||t-- >0)&&!(a=s.next()).done;)n.push(a.value)}catch(e){d={error:e}}finally{try{a&&!a.done&&(r=s.return)&&r.call(s)}finally{if(d)throw d.error}}return n}Object.create,Object.create;var s=/-(\\\\w)/g,n=(function(e){return e.replace(s,(function(e,t){return t?t.toUpperCase():\\\"\\\"}))},Object.create(null),Array.isArray),i=function(e){return null!==e&&\\\"object\\\"==typeof e},o=function(e){if(null===e)return e;if(e instanceof Date)return new Date(e.getTime());if(e instanceof Array){var t=[];return e.forEach((function(e){t.push(e)})),t.map((function(e){return o(e)}))}if(\\\"object\\\"==typeof e&&Object.keys(e).length){var r=a({},e);return Object.keys(r).forEach((function(e){r[e]=o(r[e])})),r}return e},h=function(e,t){var r=e[t];return i(r)?r.cell:r},c=function(e,t,r){return void 0===r&&(r=!0),t||0===t?\\\"function\\\"==typeof t?t:\\\"number\\\"==typeof t?function(){return t}:n(t)?function(){if(r){var a=Math.max.apply(Math,function(e,t,r){if(r||2===arguments.length)for(var a,d=0,s=t.length;d<s;d++)!a&&d in t||(a||(a=Array.prototype.slice.call(t,0,d)),a[d]=t[d]);return e.concat(a||Array.prototype.slice.call(t))}([],d(t),!1));return isNaN(a)?e:a}return t}:i(t)?function(){if(r){var a=Math.max(t.width,t.height);return isNaN(a)?e:a}return[t.width,t.height]}:function(){return e}:function(t){return t.size?n(t.size)?t.size[0]>t.size[1]?t.size[0]:t.size[1]:i(t.size)?t.size.width>t.size.height?t.size.width:t.size.height:t.size:e}},u={radius:null,startRadius:null,endRadius:null,startAngle:0,endAngle:2*Math.PI,clockwise:!0,divisions:1,ordering:null,angleRatio:1};function g(e,t){var r=e.degree,a=t.degree;return r<a?-1:r>a?1:0}function p(e,t,r,a,d){void 0===d&&(d=!1);var s=o(t),n=[s[0]],i=[t[0]],c=[],u=t.length;c[0]=!0,function(e,t,r,a){e.forEach((function(t,r){e[r].children=[],e[r].parent=[]})),a?t.forEach((function(t){var a=h(t,\\\"source\\\"),d=h(t,\\\"target\\\"),s=0;a&&(s=r[a]);var n=0;d&&(n=r[d]);var i=e[s].children,o=e[n].parent;i.push(e[n].id),o.push(e[s].id)})):t.forEach((function(t){var a=h(t,\\\"source\\\"),d=h(t,\\\"target\\\"),s=0;a&&(s=r[a]);var n=0;d&&(n=r[d]);var i=e[s].children,o=e[n].children;i.push(e[n].id),o.push(e[s].id)}))}(s,r,a,d);var g=0;return s.forEach((function(d,o){if(0!==o)if(o!==u-1&&e[o].all===e[o+1].all&&!function(e,t,r){for(var a=r.length,d=0;d<a;d++){var s=h(r[d],\\\"source\\\"),n=h(r[d],\\\"target\\\");if(e.id===s&&t.id===n||t.id===s&&e.id===n)return!0}return!1}(n[g],d,r)||c[o]){for(var p=n[g].children,l=!1,f=0;f<p.length;f++){var E=a[p[f]];if(e[E].all===e[o].all&&!c[E]){n.push(s[E]),i.push(t[a[s[E].id]]),c[E]=!0,l=!0;break}}for(var y=0;!l&&(c[y]||(n.push(s[y]),i.push(t[a[s[y].id]]),c[y]=!0,l=!0),++y!==u););}else n.push(d),i.push(t[a[d.id]]),c[o]=!0,g++})),i}var l={circular:function(){function e(e){void 0===e&&(e={}),this.options=e,this.id=\\\"circular\\\",Object.assign(this.options,u,e)}return e.prototype.execute=function(e,t){return this.genericCircularLayout(!1,e,t)},e.prototype.assign=function(e,t){var r=this;e.batch((function(){r.genericCircularLayout(!0,e,t)}))},e.prototype.genericCircularLayout=function(e,t,r){var s=a(a({},this.options),r),n=s.width,i=s.height,o=s.center,u=s.divisions,l=s.startAngle,f=void 0===l?0:l,E=s.endAngle,y=void 0===E?2*Math.PI:E,v=s.angleRatio,N=s.ordering,M=s.clockwise,w=s.nodeSpacing,m=s.nodeSize,b=s.onLayoutEnd,A=t.getAllNodes(),S=t.getAllEdges(),k=A.length;if(0===k)return b&&b(),{nodes:[],edges:[]};var x=d(function(e,t,r){var a=e,d=t,s=r;return a||\\\"undefined\\\"==typeof window||(a=window.innerWidth),d||\\\"undefined\\\"==typeof window||(d=window.innerHeight),s||(s=[a/2,d/2]),[a,d,s]}(n,i,o),3),I=x[0],R=x[1],C=x[2];if(1===k)return e&&(t.updateNodeData(A[0].id,\\\"x\\\",C[0]),t.updateNodeData(A[0].id,\\\"y\\\",C[1])),b&&b(),{nodes:[{id:\\\"\\\".concat(A[0].id),x:C[0],y:C[1]}],edges:[]};var D=(y-f)/k,P={};A.forEach((function(e,t){P[e.id]=t}));var T=function(e,t,r){for(var a=[],d=0;d<e;d++)a[d]={in:0,out:0,all:0};return r?(r.forEach((function(e){var r=h(e,\\\"source\\\"),d=h(e,\\\"target\\\");r&&a[t[r]]&&(a[t[r]].out+=1,a[t[r]].all+=1),d&&a[t[d]]&&(a[t[d]].in+=1,a[t[d]].all+=1)})),a):a}(A.length,P,S),O=s.radius,j=s.startRadius,z=s.endRadius;if(w){var U=c(10,w),K=c(10,m),V=-1/0;A.forEach((function(e){var t=K(e);V<t&&(V=t)}));var L=0;A.forEach((function(e,t){L+=0===t?V||10:(U(e)||0)+(V||10)})),O=L/(2*Math.PI)}else O||j||z?!j&&z?j=z:j&&!z&&(z=j):O=R>I?I/2:R/2;var F=D*v,B=[],J=A.map((function(e){return e.data}));B=\\\"topology\\\"===N?p(T,J,S,P):\\\"topology-directed\\\"===N?p(T,J,S,P,!0):\\\"degree\\\"===N?function(e,t){var r=[];return t.forEach((function(t,a){t.degree=e[a].all,r.push(t)})),r.sort(g),r}(T,J):A;for(var H=Math.ceil(k/u),W=0;W<k;++W){var q=O;q||null===j||null===z||(q=j+W*(z-j)/(k-1)),q||(q=10+100*W/(k-1));var G=f+W%H*F+2*Math.PI/u*Math.floor(W/H);M||(G=y-W%H*F-2*Math.PI/u*Math.floor(W/H)),B[W].x=C[0]+Math.cos(G)*q,B[W].y=C[1]+Math.sin(G)*q,B[W].weight=T[W].all}return e&&B.forEach((function(e){t.mergeNodeData(e.id,{x:e.x,y:e.y,weight:e.weight})})),b&&b(),{nodes:B,edges:S}},e}()};function f(e,t){var a=e.layout,d=a.id,s=a.options,n=e.nodes,i=e.edges,o=new r({nodes:n,edges:i}),h=l[d];if(!h)throw new Error(\\\"Unknown layout id: \\\"+d);return[new h(s).execute(o),t]}addEventListener(\\\"message\\\",(function(e){var r,a=e.data,d=a.type,s=a.method,n=a.id,i=a.params;\\\"RPC\\\"===d&&s&&((r=t[s])?Promise.resolve().then((function(){return r.apply(t,i)})):Promise.reject(\\\"No such method\\\")).then((function(e){postMessage({type:\\\"RPC\\\",id:n,result:e})})).catch((function(e){var t={message:e};e.stack&&(t.message=e.message,t.stack=e.stack,t.name=e.name),postMessage({type:\\\"RPC\\\",id:n,error:t})}))})),postMessage({type:\\\"RPC\\\",method:\\\"ready\\\"})})();\\n//# sourceMappingURL=3a54d760230d1933f953.worker.js.map\"])));\n\t\t\t\t\taddMethods(w, methods)\n\t\t\t\t\t\n\t\t\t\t\treturn w\n\t\t\t\t}\n\t\t\t","function addMethods(worker, methods) {\n  var c = 0;\n  var callbacks = {};\n  worker.addEventListener('message', function (e) {\n    var d = e.data;\n    if (d.type !== 'RPC') return;\n\n    if (d.id) {\n      var f = callbacks[d.id];\n\n      if (f) {\n        delete callbacks[d.id];\n\n        if (d.error) {\n          f[1](Object.assign(Error(d.error.message), d.error));\n        } else {\n          f[0](d.result);\n        }\n      }\n    } else {\n      var evt = document.createEvent('Event');\n      evt.initEvent(d.method, false, false);\n      evt.data = d.params;\n      worker.dispatchEvent(evt);\n    }\n  });\n  methods.forEach(function (method) {\n    worker[method] = function () {\n      var _arguments = arguments;\n      return new Promise(function (a, b) {\n        var id = ++c;\n        callbacks[id] = [a, b];\n        worker.postMessage({\n          type: 'RPC',\n          id: id,\n          method: method,\n          params: [].slice.call(_arguments)\n        });\n      });\n    };\n  });\n}\n\nmodule.exports = addMethods;\n//# sourceMappingURL=rpc-wrapper.js.map\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (g && (g = 0, op[0] && (_ = 0)), _) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    var desc = Object.getOwnPropertyDescriptor(m, k);\r\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n        desc = { enumerable: true, get: function() { return m[k]; } };\r\n    }\r\n    Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n        if (ar || !(i in from)) {\r\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n            ar[i] = from[i];\r\n        }\r\n    }\r\n    return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\nexport function __classPrivateFieldIn(state, receiver) {\r\n    if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\r\n    return typeof state === \"function\" ? receiver === state : state.has(receiver);\r\n}\r\n","export const isString = (val: unknown): val is string =>\n  typeof val === \"string\";\n\nconst cacheStringFunction = <T extends (str: string) => string>(fn: T): T => {\n  const cache: Record<string, string> = Object.create(null);\n  return ((str: string) => {\n    const hit = cache[str];\n    return hit || (cache[str] = fn(str));\n  }) as any;\n};\n\nconst camelizeRE = /-(\\w)/g;\nexport const camelize = cacheStringFunction((str: string): string => {\n  return str.replace(camelizeRE, (_, c) => (c ? c.toUpperCase() : \"\"));\n});\n\n// export const capitalize = cacheStringFunction(\n//   (str: string) => str.charAt(0).toUpperCase() + str.slice(1),\n// )\n","export const isArray = Array.isArray;\n","export const isObject = (val: unknown): val is Record<any, any> =>\n  val !== null && typeof val === \"object\";\n\nexport const clone = <T>(target: T): T => {\n  if (target === null) {\n    return target;\n  }\n  if (target instanceof Date) {\n    return new Date(target.getTime()) as any;\n  }\n  if (target instanceof Array) {\n    const cp = [] as any[];\n    (target as any[]).forEach((v) => {\n      cp.push(v);\n    });\n    return cp.map((n: any) => clone<any>(n)) as any;\n  }\n  if (typeof target === \"object\" && Object.keys(target).length) {\n    const cp = { ...(target as { [key: string]: any }) } as {\n      [key: string]: any;\n    };\n    Object.keys(cp).forEach((k) => {\n      cp[k] = clone<any>(cp[k]);\n    });\n    return cp as T;\n  }\n  return target;\n};\n","import {\n  Matrix,\n  Model,\n  IndexMap,\n  Edge,\n  Node,\n  OutNode,\n  Degree,\n  NodeMap,\n} from \"../types\";\nimport { isArray } from \"./array\";\nimport { isNumber } from \"./number\";\nimport { isObject } from \"./object\";\n\nexport const getEdgeTerminal = (edge: Edge, type: \"source\" | \"target\") => {\n  const terminal = edge[type];\n  if (isObject(terminal)) {\n    return terminal.cell;\n  }\n  return terminal;\n};\n\nexport const getDegree = (\n  n: number,\n  nodeIdxMap: IndexMap,\n  edges: Edge[] | null\n) => {\n  const degrees: Degree[] = [];\n  for (let i = 0; i < n; i++) {\n    degrees[i] = {\n      in: 0,\n      out: 0,\n      all: 0,\n    };\n  }\n  if (!edges) return degrees;\n  edges.forEach((e) => {\n    const source = getEdgeTerminal(e, \"source\");\n    const target = getEdgeTerminal(e, \"target\");\n    if (source && degrees[nodeIdxMap[source]]) {\n      degrees[nodeIdxMap[source]].out += 1;\n      degrees[nodeIdxMap[source]].all += 1;\n    }\n    if (target && degrees[nodeIdxMap[target]]) {\n      degrees[nodeIdxMap[target]].in += 1;\n      degrees[nodeIdxMap[target]].all += 1;\n    }\n  });\n  return degrees;\n};\n\nexport const getDegreeMap = (nodes: Node[], edges: Edge[] | null) => {\n  const degreesMap: { [id: string]: Degree } = {};\n  nodes.forEach((node) => {\n    degreesMap[node.id] = {\n      in: 0,\n      out: 0,\n      all: 0,\n    };\n  });\n\n  if (!edges) return degreesMap;\n  edges.forEach((e) => {\n    const source = getEdgeTerminal(e, \"source\");\n    const target = getEdgeTerminal(e, \"target\");\n    if (source) {\n      degreesMap[source].out += 1;\n      degreesMap[source].all += 1;\n    }\n    if (target) {\n      degreesMap[target].in += 1;\n      degreesMap[target].all += 1;\n    }\n  });\n  return degreesMap;\n};\n\nexport const floydWarshall = (adjMatrix: Matrix[]): Matrix[] => {\n  // initialize\n  const dist: Matrix[] = [];\n  const size = adjMatrix.length;\n  for (let i = 0; i < size; i += 1) {\n    dist[i] = [];\n    for (let j = 0; j < size; j += 1) {\n      if (i === j) {\n        dist[i][j] = 0;\n      } else if (adjMatrix[i][j] === 0 || !adjMatrix[i][j]) {\n        dist[i][j] = Infinity;\n      } else {\n        dist[i][j] = adjMatrix[i][j];\n      }\n    }\n  }\n  // floyd\n  for (let k = 0; k < size; k += 1) {\n    for (let i = 0; i < size; i += 1) {\n      for (let j = 0; j < size; j += 1) {\n        if (dist[i][j] > dist[i][k] + dist[k][j]) {\n          dist[i][j] = dist[i][k] + dist[k][j];\n        }\n      }\n    }\n  }\n  return dist;\n};\n\nexport const getAdjMatrix = (data: Model, directed: boolean): Matrix[] => {\n  const { nodes, edges } = data;\n  const matrix: Matrix[] = [];\n  // map node with index in data.nodes\n  const nodeMap: {\n    [key: string]: number;\n  } = {};\n\n  if (!nodes) {\n    throw new Error(\"invalid nodes data!\");\n  }\n  if (nodes) {\n    nodes.forEach((node, i) => {\n      nodeMap[node.id] = i;\n      const row: number[] = [];\n      matrix.push(row);\n    });\n  }\n\n  edges?.forEach((e) => {\n    const source = getEdgeTerminal(e, \"source\");\n    const target = getEdgeTerminal(e, \"target\");\n    const sIndex = nodeMap[source as string];\n    const tIndex = nodeMap[target as string];\n    if (sIndex === undefined || tIndex === undefined) return;\n    matrix[sIndex][tIndex] = 1;\n    if (!directed) {\n      matrix[tIndex][sIndex] = 1;\n    }\n  });\n  return matrix;\n};\n\n/**\n * scale matrix\n * @param matrix [ [], [], [] ]\n * @param ratio\n */\nexport const scaleMatrix = (matrix: Matrix[], ratio: number) => {\n  const result: Matrix[] = [];\n  matrix.forEach((row) => {\n    const newRow: number[] = [];\n    row.forEach((v) => {\n      newRow.push(v * ratio);\n    });\n    result.push(newRow);\n  });\n  return result;\n};\n\n/**\n * depth first traverse, from leaves to root, children in inverse order\n *  if the fn returns false, terminate the traverse\n */\nconst traverseUp = <T extends { children?: T[] }>(\n  data: T,\n  fn: (param: T) => boolean\n) => {\n  if (data && data.children) {\n    for (let i = data.children.length - 1; i >= 0; i--) {\n      if (!traverseUp(data.children[i], fn)) return;\n    }\n  }\n\n  if (!fn(data)) {\n    return false;\n  }\n  return true;\n};\n\n/**\n * depth first traverse, from leaves to root, children in inverse order\n * if the fn returns false, terminate the traverse\n */\nexport const traverseTreeUp = <T extends { children?: T[] }>(\n  data: T,\n  fn: (param: T) => boolean\n) => {\n  if (typeof fn !== \"function\") {\n    return;\n  }\n  traverseUp(data, fn);\n};\n\n/**\n * calculate the bounding box for the nodes according to their x, y, and size\n * @param nodes nodes in the layout\n * @returns\n */\nexport const getLayoutBBox = (nodes: OutNode[]) => {\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  nodes.forEach((node) => {\n    let size = node.size;\n    if (isArray(size)) {\n      if (size.length === 1) size = [size[0], size[0]];\n    } else if (isNumber(size)) {\n      size = [size, size];\n    } else if (size === undefined || isNaN(size as any)) {\n      size = [30, 30];\n    }\n\n    const halfSize = [size[0] / 2, size[1] / 2];\n    const left = node.x - halfSize[0];\n    const right = node.x + halfSize[0];\n    const top = node.y - halfSize[1];\n    const bottom = node.y + halfSize[1];\n\n    if (minX > left) minX = left;\n    if (minY > top) minY = top;\n    if (maxX < right) maxX = right;\n    if (maxY < bottom) maxY = bottom;\n  });\n  return { minX, minY, maxX, maxY };\n};\n\n/**\n * 获取节点集合的平均位置信息\n * @param nodes 节点集合\n * @returns 平局内置\n */\nexport const getAvgNodePosition = (nodes: OutNode[]) => {\n  const totalNodes = { x: 0, y: 0 };\n  nodes.forEach((node) => {\n    totalNodes.x += node.x || 0;\n    totalNodes.y += node.y || 0;\n  });\n  // 获取均值向量\n  const length = nodes.length || 1;\n  return {\n    x: totalNodes.x / length,\n    y: totalNodes.y / length,\n  };\n};\n\n// 找出指定节点关联的边的起点或终点\nconst getCoreNode = (type: \"source\" | \"target\", node: Node, edges: Edge[]) => {\n  if (type === \"source\") {\n    return (edges?.find((edge) => edge.target === node.id)?.source ||\n      {}) as Node;\n  }\n  return (edges?.find((edge) => edge.source === node.id)?.target || {}) as Node;\n};\n\n// 找出指定节点为起点或终点的所有一度叶子节点\nconst getRelativeNodeIds = (\n  type: \"source\" | \"target\" | \"both\",\n  coreNode: Node,\n  edges: Edge[]\n) => {\n  let relativeNodes: string[] = [];\n  switch (type) {\n    case \"source\":\n      relativeNodes = edges\n        ?.filter((edge) => edge.source === coreNode.id)\n        .map((edge) => edge.target);\n      break;\n    case \"target\":\n      relativeNodes = edges\n        ?.filter((edge) => edge.target === coreNode.id)\n        .map((edge) => edge.source);\n      break;\n    case \"both\":\n      relativeNodes = edges\n        ?.filter((edge) => edge.source === coreNode.id)\n        .map((edge) => edge.target)\n        .concat(\n          edges\n            ?.filter((edge) => edge.target === coreNode.id)\n            .map((edge) => edge.source)\n        );\n      break;\n    default:\n      break;\n  }\n  // 去重\n  const set = new Set(relativeNodes);\n  return Array.from(set);\n};\n// 找出同类型的节点\nconst getSameTypeNodes = (\n  type: \"leaf\" | \"all\",\n  nodeClusterBy: string,\n  node: Node,\n  relativeNodes: Node[],\n  degreesMap: { [id: string]: Degree }\n) => {\n  // @ts-ignore\n  const typeName = node[nodeClusterBy] || \"\";\n  // @ts-ignore\n  let sameTypeNodes =\n    relativeNodes?.filter((item) => item[nodeClusterBy] === typeName) || [];\n  if (type === \"leaf\") {\n    sameTypeNodes = sameTypeNodes.filter(\n      (node) => degreesMap[node.id]?.in === 0 || degreesMap[node.id]?.out === 0\n    );\n  }\n  return sameTypeNodes;\n};\n\n// 找出与指定节点关联的边的起点或终点出发的所有一度叶子节点\nexport const getCoreNodeAndRelativeLeafNodes = (\n  type: \"leaf\" | \"all\",\n  node: Node,\n  edges: Edge[],\n  nodeClusterBy: string,\n  degreesMap: { [id: string]: Degree },\n  nodeMap: NodeMap\n) => {\n  const { in: inDegree, out: outDegree } = degreesMap[node.id];\n  let coreNode: Node = node;\n  let relativeLeafNodes: Node[] = [];\n  if (inDegree === 0) {\n    // 如果为没有出边的叶子节点，则找出与它关联的边的起点出发的所有一度节点\n    coreNode = getCoreNode(\"source\", node, edges);\n    relativeLeafNodes = getRelativeNodeIds(\"both\", coreNode, edges).map(\n      (nodeId) => nodeMap[nodeId]\n    );\n  } else if (outDegree === 0) {\n    // 如果为没有入边边的叶子节点，则找出与它关联的边的起点出发的所有一度节点\n    coreNode = getCoreNode(\"target\", node, edges);\n    relativeLeafNodes = getRelativeNodeIds(\"both\", coreNode, edges).map(\n      (nodeId) => nodeMap[nodeId]\n    );\n  }\n  relativeLeafNodes = relativeLeafNodes.filter(\n    (node) =>\n      degreesMap[node.id] &&\n      (degreesMap[node.id].in === 0 || degreesMap[node.id].out === 0)\n  );\n  const sameTypeLeafNodes = getSameTypeNodes(\n    type,\n    nodeClusterBy,\n    node,\n    relativeLeafNodes,\n    degreesMap\n  );\n  return { coreNode, relativeLeafNodes, sameTypeLeafNodes };\n};\n","import { isArray, isObject } from \".\";\nimport { isNumber } from \"./number\";\n\nexport const isFunction = (val: unknown): val is Function =>\n  typeof val === \"function\";\n\nexport const getFunc = (\n  value: number,\n  defaultValue: number,\n  func?: ((d?: any) => number) | undefined\n): Function => {\n  let resultFunc;\n  if (func) {\n    resultFunc = func;\n  } else if (isNumber(value)) {\n    resultFunc = () => value;\n  } else {\n    resultFunc = () => defaultValue;\n  }\n  return resultFunc;\n};\n\nexport const getFuncByUnknownType = (\n  defaultValue: number,\n  value?:\n    | number\n    | number[]\n    | { width: number; height: number }\n    | ((d?: any) => number)\n    | undefined,\n  resultIsNumber: boolean = true\n): ((d?: any) => number | number[]) => {\n  if (!value && value !== 0) {\n    return (d) => {\n      if (d.size) {\n        if (isArray(d.size))\n          return d.size[0] > d.size[1] ? d.size[0] : d.size[1];\n        if (isObject(d.size))\n          return d.size.width > d.size.height ? d.size.width : d.size.height;\n        return d.size;\n      }\n      return defaultValue;\n    };\n  }\n  if (isFunction(value)) {\n    return value;\n  }\n  if (isNumber(value)) {\n    return () => value;\n  }\n  if (isArray(value)) {\n    return () => {\n      if (resultIsNumber) {\n        const max = Math.max(...(value as number[]));\n        return isNaN(max) ? defaultValue : max;\n      }\n      return value;\n    };\n  }\n  if (isObject(value)) {\n    return () => {\n      if (resultIsNumber) {\n        const max = Math.max(value.width, value.height);\n        return isNaN(max) ? defaultValue : max;\n      }\n      return [value.width, value.height];\n    };\n  }\n  return () => defaultValue;\n};\n","export const isNumber = (val: unknown): val is Number =>\n  typeof val === \"number\";\n\nexport const isNaN = (num: unknown) => Number.isNaN(Number(num));\n\nexport const toNumber = (val: any): any => {\n  const n = parseFloat(val);\n  return isNaN(n) ? val : n;\n};\n","import type { Graph } from \"@antv/graphlib\";\nimport type { CircularLayoutOptions, SyncLayout, LayoutMapping, PointTuple, IndexMap, OutNode, Edge, Degree } from \"./types\";\nimport { getDegree, getEdgeTerminal, getFuncByUnknownType, clone } from \"./util\";\n\ntype INodeData = OutNode & {\n  degree: number;\n  size: number | PointTuple;\n  weight: number;\n  children: string[];\n  parent: string[];\n};\n\ntype IEdgeData = {};\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<CircularLayoutOptions> = {\n  radius: null,\n  startRadius: null,\n  endRadius: null,\n  startAngle: 0,\n  endAngle: 2 * Math.PI,\n  clockwise: true,\n  divisions: 1,\n  ordering: null,\n  angleRatio: 1\n}\n\n/**\n * Layout arranging the nodes in a circle.\n * \n * @example\n * // Assign layout options when initialization.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = layout.execute(graph); // { nodes: [], edges: [] }\n * \n * // Or use different options later.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }\n * \n * // If you want to assign the positions directly to the nodes, use assign method.\n * layout.assign(graph, { radius: 20 });\n */\nexport class CircularLayout implements SyncLayout<CircularLayoutOptions> {\n  id = 'circular';\n\n  constructor(public options: CircularLayoutOptions = {} as CircularLayoutOptions) {\n    Object.assign(this.options, DEFAULTS_LAYOUT_OPTIONS, options);\n  }\n\n  /**\n   * Return the positions of nodes and edges(if needed).\n   */\n  execute(graph: Graph<INodeData, IEdgeData>, options?: CircularLayoutOptions): LayoutMapping {\n    return this.genericCircularLayout(false, graph, options) as LayoutMapping;\n  }\n\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  assign(graph: Graph<INodeData, IEdgeData>, options?: CircularLayoutOptions) {\n    graph.batch(() => {\n      this.genericCircularLayout(true, graph, options);\n    });\n  }\n\n  private genericCircularLayout(assign: boolean, graph: Graph<INodeData, IEdgeData>, options?: CircularLayoutOptions): LayoutMapping | void {\n    const mergedOptions = { ...this.options, ...options };\n    const { width, height, center, divisions, startAngle = 0, endAngle = 2 * Math.PI, angleRatio, ordering, clockwise, nodeSpacing: paramNodeSpacing, nodeSize: paramNodeSize, onLayoutEnd } = mergedOptions;\n\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges() as Edge[];\n    const n = nodes.length;\n\n    // Need no layout if there is no node.\n    if (n === 0) {\n      if (onLayoutEnd) {\n        onLayoutEnd();\n      }\n      return {\n        nodes: [],\n        edges: [],\n      };\n    }\n\n    // Calculate center according to `window` if not provided.\n    const [calculatedWidth, calculatedHeight, calculatedCenter] = calculateCenter(width, height, center);\n\n    // Layout easily if there is only one node.\n    if (n === 1) {\n      if (assign) {\n        graph.updateNodeData(nodes[0].id, \"x\", calculatedCenter[0]);\n        graph.updateNodeData(nodes[0].id, \"y\", calculatedCenter[1]);\n      }\n      \n      if (onLayoutEnd) {\n        onLayoutEnd();\n      }\n      return {\n        nodes: [\n          {\n            id: `${nodes[0].id}`,\n            x: calculatedCenter[0],\n            y: calculatedCenter[1],\n          }\n        ],\n        edges: [],\n      };\n    }\n\n    const angleStep = (endAngle - startAngle) / n;\n    const nodeMap: IndexMap = {};\n    nodes.forEach((node, i) => {\n      nodeMap[node.id] = i;\n    });\n    const degrees = getDegree(nodes.length, nodeMap, edges as Edge[]);\n\n    let { radius, startRadius, endRadius } = mergedOptions;\n    if (paramNodeSpacing) {\n      const nodeSpacing: Function = getFuncByUnknownType(10, paramNodeSpacing);\n      const nodeSize: Function = getFuncByUnknownType(10, paramNodeSize);\n      let maxNodeSize = -Infinity;\n      nodes.forEach((node) => {\n        const nSize = nodeSize(node);\n        if (maxNodeSize < nSize) maxNodeSize = nSize;\n      });\n      let length = 0;\n      nodes.forEach((node, i) => {\n        if (i === 0) length += (maxNodeSize || 10);\n        else length += (nodeSpacing(node) || 0) + (maxNodeSize || 10);\n      });\n      radius = length / (2 * Math.PI);\n    } else if (!radius && !startRadius && !endRadius) {\n      radius = calculatedHeight > calculatedWidth ? calculatedWidth / 2 : calculatedHeight / 2;\n    } else if (!startRadius && endRadius) {\n      startRadius = endRadius;\n    } else if (startRadius && !endRadius) {\n      endRadius = startRadius;\n    }\n    const astep = angleStep * angleRatio!;\n\n    let layoutNodes: any[] = [];\n    let nodesData = nodes.map((node) => node.data);\n    if (ordering === \"topology\") {\n      // layout according to the topology\n      layoutNodes = topologyOrdering(degrees, nodesData, edges, nodeMap);\n    } else if (ordering === \"topology-directed\") {\n      // layout according to the topology\n      layoutNodes = topologyOrdering(degrees, nodesData, edges, nodeMap, true);\n    } else if (ordering === \"degree\") {\n      // layout according to the descent order of degrees\n      layoutNodes = degreeOrdering(degrees, nodesData);\n    } else {\n      // layout according to the original order in the data.nodes\n      layoutNodes = nodes;\n    }\n\n    const divN = Math.ceil(n / divisions!); // node number in each division\n    for (let i = 0; i < n; ++i) {\n      let r = radius;\n      if (!r && startRadius !== null && endRadius !== null) {\n        r = startRadius! + (i * (endRadius! - startRadius!)) / (n - 1);\n      }\n      if (!r) {\n        r = 10 + (i * 100) / (n - 1);\n      }\n      let angle =\n        startAngle +\n        (i % divN) * astep +\n        ((2 * Math.PI) / divisions!) * Math.floor(i / divN);\n      if (!clockwise) {\n        angle =\n          endAngle -\n          (i % divN) * astep -\n          ((2 * Math.PI) / divisions!) * Math.floor(i / divN);\n      }\n      layoutNodes[i].x = calculatedCenter[0] + Math.cos(angle) * r;\n      layoutNodes[i].y = calculatedCenter[1] + Math.sin(angle) * r;\n      layoutNodes[i].weight = degrees[i].all;\n    }\n\n    if (assign) {\n      layoutNodes.forEach((node) => {\n        graph.mergeNodeData(node.id, {\n          x: node.x,\n          y: node.y,\n          weight: node.weight,\n        });\n      });\n    }\n\n    if (onLayoutEnd) {\n      onLayoutEnd();\n    };\n\n    return {\n      nodes: layoutNodes,\n      edges\n    };\n  }\n}\n\nfunction initHierarchy(\n  nodes: INodeData[],\n  edges: Edge[],\n  nodeMap: IndexMap,\n  directed: boolean\n) {\n  nodes.forEach((_, i: number) => {\n    nodes[i].children = [];\n    nodes[i].parent = [];\n  });\n  if (directed) {\n    edges.forEach((e) => {\n      const source = getEdgeTerminal(e, 'source');\n      const target = getEdgeTerminal(e, 'target');\n      let sourceIdx = 0;\n      if (source) {\n        sourceIdx = nodeMap[source];\n      }\n      let targetIdx = 0;\n      if (target) {\n        targetIdx = nodeMap[target];\n      }\n      const child = nodes[sourceIdx].children!;\n      const parent = nodes[targetIdx].parent!;\n      child.push(nodes[targetIdx].id);\n      parent.push(nodes[sourceIdx].id);\n    });\n  } else {\n    edges.forEach((e) => {\n      const source = getEdgeTerminal(e, 'source');\n      const target = getEdgeTerminal(e, 'target');\n      let sourceIdx = 0;\n      if (source) {\n        sourceIdx = nodeMap[source];\n      }\n      let targetIdx = 0;\n      if (target) {\n        targetIdx = nodeMap[target];\n      }\n      const sourceChildren = nodes[sourceIdx].children!;\n      const targetChildren = nodes[targetIdx].children!;\n      sourceChildren.push(nodes[targetIdx].id);\n      targetChildren.push(nodes[sourceIdx].id);\n    });\n  }\n}\n\nfunction connect(a: INodeData, b: INodeData, edges: Edge[]) {\n  const m = edges.length;\n  for (let i = 0; i < m; i++) {\n    const source = getEdgeTerminal(edges[i], 'source');\n    const target = getEdgeTerminal(edges[i], 'target');\n    if (\n      (a.id === source && b.id === target) ||\n      (b.id === source && a.id === target)\n    ) {\n      return true;\n    }\n  }\n  return false;\n}\n\nfunction compareDegree(a: INodeData, b: INodeData) {\n  const aDegree = a.degree!;\n  const bDegree = b.degree!;\n  if (aDegree < bDegree) {\n    return -1;\n  }\n  if (aDegree > bDegree) {\n    return 1;\n  }\n  return 0;\n}\n\nfunction topologyOrdering(\n  degrees: Degree[],\n  nodes: INodeData[],\n  edges: Edge[],\n  nodeMap: IndexMap, \n  directed: boolean = false\n) {\n  const cnodes = clone(nodes);\n  const orderedCNodes = [cnodes[0]];\n  const resNodes = [nodes[0]];\n  const pickFlags: boolean[] = [];\n  const n = nodes.length;\n  pickFlags[0] = true;\n  initHierarchy(cnodes, edges, nodeMap, directed);\n  let k = 0;\n  cnodes.forEach((cnode, i) => {\n    if (i !== 0) {\n      if (\n        (i === n - 1 ||\n          degrees[i].all !== degrees[i + 1].all ||\n          connect(\n            orderedCNodes[k],\n            cnode,\n            edges\n          )) &&\n        !pickFlags[i]\n      ) {\n        orderedCNodes.push(cnode);\n        resNodes.push(nodes[nodeMap[cnode.id]]);\n        pickFlags[i] = true;\n        k++;\n      } else {\n        const children = orderedCNodes[k].children!;\n        let foundChild = false;\n        for (let j = 0; j < children.length; j++) {\n          const childIdx = nodeMap[children[j]];\n          if (degrees[childIdx].all === degrees[i].all && !pickFlags[childIdx]) {\n            orderedCNodes.push(cnodes[childIdx]);\n            resNodes.push(nodes[nodeMap[cnodes[childIdx].id]]);\n            pickFlags[childIdx] = true;\n            foundChild = true;\n            break;\n          }\n        }\n        let ii = 0;\n        while (!foundChild) {\n          if (!pickFlags[ii]) {\n            orderedCNodes.push(cnodes[ii]);\n            resNodes.push(nodes[nodeMap[cnodes[ii].id]]);\n            pickFlags[ii] = true;\n            foundChild = true;\n          }\n          ii++;\n          if (ii === n) {\n            break;\n          }\n        }\n      }\n    }\n  });\n  return resNodes;\n}\n\nfunction degreeOrdering(\n  degrees: Degree[],\n  nodes: INodeData[],\n): INodeData[] {\n  const orderedNodes: INodeData[] = [];\n  nodes.forEach((node, i) => {\n    node.degree = degrees[i].all;\n    orderedNodes.push(node);\n  });\n  orderedNodes.sort(compareDegree);\n  return orderedNodes;\n}\n\nfunction calculateCenter(width: number | undefined, height: number | undefined, center: PointTuple | undefined): [number, number, PointTuple] {\n  let calculatedWidth = width;\n  let calculatedHeight = height;\n  let calculatedCenter = center;\n  if (!calculatedWidth && typeof window !== \"undefined\") {\n    calculatedWidth = window.innerWidth;\n  }\n  if (!calculatedHeight && typeof window !== \"undefined\") {\n    calculatedHeight = window.innerHeight;\n  }\n  if (!calculatedCenter) {\n    calculatedCenter = [calculatedWidth! / 2, calculatedHeight! / 2];\n  }\n  return [calculatedWidth!, calculatedHeight!, calculatedCenter];\n}","import EventEmitter from 'eventemitter3';\nimport { Graph, Node, Edge } from \"@antv/graphlib\";\nimport type { LayoutMapping, SyncLayout } from \"./types\";\n// @ts-ignore\n// Inline the worker as a Blob. @see https://github.com/developit/workerize-loader#inline\nimport worker from \"workerize-loader?inline!./worker\";\n// import { setupTransferableMethodsOnMain } from \"@naoak/workerize-transferable\";\n\n/**\n * The payload transferred from main thread to the worker.\n */\nexport interface Payload {\n  layout: {\n    id: string;\n    options: any;\n  };\n  nodes: Node<any>[];\n  edges: Edge<any>[];\n}\n\nexport const SupervisorEvent = {\n  /**\n   * Get triggerred when each iteration finished.\n   */\n  LAYOUT_ITERATION: 'tick',\n\n  /**\n   * Get triggerred when layout calculation is done.\n   */\n  LAYOUT_END: 'layoutend',\n};\n\n/**\n * @example\n * const graph = new Graph();\n * const layout = new CircularLayout();\n * \n * const supervisor = new Supervisor(graph, layout, { auto: true });\n * supervisor.start();\n * supervisor.stop();\n * supervisor.kill();\n * \n * // lifecycle\n * supervisor.on('tick', () => {\n * });\n * supervisor.on('layoutend', () => {\n * });\n * \n * // Re-layout when graph changed.\n * graph.addNodes([{ id: 'node1' }, { id: 'node2' }]);\n * \n * // TODO: Custom layout.\n */\nexport class Supervisor extends EventEmitter {\n\n  /**\n   * Internal worker.\n   */\n  private worker: any;\n\n  /**\n   * Flag of running state.\n   */\n  private running: boolean;\n\n  constructor(\n    private graph: Graph<any, any>,\n    private layout: SyncLayout<any>, \n    options: {\n      auto: boolean; // 默认手动模式\n    }\n  ) {\n    super();\n\n    // TODO: listen to the graph-changed events.\n    // optional.\n    // forcelayout\n    // graph.onChanged = (e) => {\n    //   // node/edge added/dropped\n    // };\n\n    this.spawnWorker();\n  }\n\n  spawnWorker() {\n    if (this.worker) {\n      this.worker.terminate();\n    }\n\n    /**\n     * Worker function\n     */\n    // this.worker = this.createWorker(workerFunctionString);\n    // this.worker.addEventListener('message', this.handleWorkerMessage);\n\n    // Use workerize-loader to create WebWorker.\n    // @see https://github.com/developit/workerize-loader\n    this.worker = worker();\n\n    if (this.running) {\n      this.running = false;\n      this.start();\n    }\n  }\n\n  start() {\n    if (this.running) return this;\n\n    this.running = true;\n\n    // Payload should include nodes & edges(if needed).\n    const payload = {\n      layout: {\n        id: this.layout.id,\n        options: this.layout.options,\n      },\n      nodes: this.graph.getAllNodes(),\n      edges: this.graph.getAllEdges(),\n    };\n\n    /**\n     * TODO: Convert graph object to linear memory(e.g. csr, adjacency matrix), then transfer the ownership to worker.\n     * @example\n     * const arraybufferWithNodesEdges = graphToByteArrays(this.graph); // Float32Array\n     */\n    const arraybufferWithNodesEdges = new Float32Array([0]);\n\n    // TODO: Support transferables.\n    // @see https://www.npmjs.com/package/@naoak/workerize-transferable\n    // setupTransferableMethodsOnMain(this.worker, {\n    //   calculateLayout: {\n    //     // pick a transferable object from the method parameters\n    //     pickTransferablesFromParams: (params) => [params[1].buffer],\n    //   },\n    // });\n\n    this.worker.calculateLayout(payload, [arraybufferWithNodesEdges]).then(([positions, transferables]: [LayoutMapping, Float32Array[]]) => {\n      this.emit(SupervisorEvent.LAYOUT_END, positions);\n    });\n\n    return this;\n  }\n\n  stop() {\n    this.running = false;\n    return this;\n  }\n\n  kill() {\n    if (this.worker) {\n      this.worker.terminate();\n    }\n\n    // TODO: unbind listeners on graph.\n\n    // TODO: release attached memory\n  }\n\n  isRunning() {\n    return this.running;\n  }\n}\n","import { CircularLayout } from \"./circular\";\nimport type { SyncLayoutConstructor } from \"./types\";\n\nexport const registry: Record<string, SyncLayoutConstructor<any>> = {\n  circular: CircularLayout,\n};\nexport function registerLayout(id: string, layout: SyncLayoutConstructor<any>) {\n  registry[id] = layout;\n}\n","export class Graph {\n    nodeMap = new Map();\n    edgeMap = new Map();\n    inEdgesMap = new Map();\n    outEdgesMap = new Map();\n    treeIndices = new Map();\n    changes = [];\n    batchCount = 0;\n    /**\n     * This function is called with a {@link GraphChangedEvent} each time a graph change happened.\n     *\n     * `event.changes` contains all the graph changes in order since last `onChanged`.\n     */\n    onChanged = () => {\n        // Do nothing.\n    };\n    /**\n     * Create a new Graph instance.\n     * @param options - The options to initialize a graph. See {@link GraphOptions}.\n     *\n     * ```ts\n     * const graph = new Graph({\n     *   // Optional, initial nodes.\n     *   nodes: [\n     *     // Each node has a unique ID.\n     *     { id: 'A', foo: 1 },\n     *     { id: 'B', foo: 1 },\n     *   ],\n     *   // Optional, initial edges.\n     *   edges: [\n     *     { id: 'C', source: 'B', target: 'B', weight: 1 },\n     *   ],\n     *   // Optional, called with a GraphChangedEvent.\n     *   onChanged: (event) => {\n     *     console.log(event);\n     *   }\n     * });\n     * ```\n     */\n    constructor(options) {\n        if (!options)\n            return;\n        if (options.nodes)\n            this.addNodes(options.nodes);\n        if (options.edges)\n            this.addEdges(options.edges);\n        if (options.tree)\n            this.addTree(options.tree);\n        if (options.onChanged)\n            this.onChanged = options.onChanged;\n    }\n    /**\n     * Batch several graph changes into one.\n     *\n     * Make several changes, but dispatch only one ChangedEvent at the end of batch:\n     * ```ts\n     * graph.batch(() => {\n     *   graph.addNodes([]);\n     *   graph.addEdges([]);\n     * });\n     * ```\n     *\n     * Batches can be nested. Only the outermost batch will dispatch a ChangedEvent:\n     * ```ts\n     * graph.batch(() => {\n     *   graph.addNodes([]);\n     *   graph.batch(() => {\n     *     graph.addEdges([]);\n     *   });\n     * });\n     * ```\n     */\n    batch = (fn) => {\n        this.batchCount += 1;\n        fn();\n        this.batchCount -= 1;\n        if (!this.batchCount) {\n            this.commit();\n        }\n    };\n    /**\n     * Reset changes and dispatch a ChangedEvent.\n     */\n    commit() {\n        const changes = this.changes;\n        this.changes = [];\n        this.onChanged({\n            graph: this,\n            changes,\n        });\n    }\n    /**\n     * Reduce the number of ordered graph changes by dropping or merging unnecessary changes.\n     *\n     * For example, if we update a node and remove it in a batch:\n     *\n     * ```ts\n     * graph.batch(() => {\n     *   graph.updateNodeData('A', 'foo', 2);\n     *   graph.removeNode('A');\n     * });\n     * ```\n     *\n     * We get 2 atomic graph changes like\n     *\n     * ```ts\n     * [\n     *   { type: 'NodeDataUpdated', id: 'A', propertyName: 'foo', oldValue: 1, newValue: 2 },\n     *   { type: 'NodeRemoved', value: { id: 'A', data: { foo: 2 } },\n     * ]\n     * ```\n     *\n     * Since node 'A' has been removed, we actually have no need to handle with NodeDataUpdated change.\n     *\n     * `reduceChanges()` here helps us remove such changes.\n     */\n    reduceChanges(changes) {\n        let mergedChanges = [];\n        changes.forEach((change) => {\n            switch (change.type) {\n                case 'NodeRemoved': {\n                    // NodeAdded: A added.\n                    // NodeDataUpdated: A changed.\n                    // TreeStructureChanged: A's parent changed.\n                    // NodeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n                    let isNewlyAdded = false;\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'NodeAdded') {\n                            const sameId = pastChange.value.id === change.value.id;\n                            if (sameId) {\n                                isNewlyAdded = true;\n                            }\n                            return !sameId;\n                        }\n                        else if (pastChange.type === 'NodeDataUpdated') {\n                            return pastChange.id !== change.value.id;\n                        }\n                        else if (pastChange.type === 'TreeStructureChanged') {\n                            return pastChange.nodeId !== change.value.id;\n                        }\n                        return true;\n                    });\n                    if (!isNewlyAdded) {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'EdgeRemoved': {\n                    // EdgeAdded: A added.\n                    // EdgeDataUpdated: A changed.\n                    // EdgeDataUpdated: A's source/target changed.\n                    // EdgeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n                    let isNewlyAdded = false;\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'EdgeAdded') {\n                            const sameId = pastChange.value.id === change.value.id;\n                            if (sameId) {\n                                isNewlyAdded = true;\n                            }\n                            return !sameId;\n                        }\n                        else if (pastChange.type === 'EdgeDataUpdated' ||\n                            pastChange.type === 'EdgeUpdated') {\n                            return pastChange.id !== change.value.id;\n                        }\n                        return true;\n                    });\n                    if (!isNewlyAdded) {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'NodeDataUpdated':\n                case 'EdgeDataUpdated':\n                case 'EdgeUpdated': {\n                    // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 1, newValue: 2 }.\n                    // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 2, newValue: 3 }.\n                    // 👆 Could be merged as { id: A, propertyName: 'foo', oldValue: 1, newValue: 3 }.\n                    const existingChange = mergedChanges.find((pastChange) => {\n                        return (pastChange.type === change.type &&\n                            pastChange.id === change.id &&\n                            pastChange.propertyName === change.propertyName);\n                    });\n                    if (existingChange) {\n                        existingChange.newValue = change.newValue;\n                    }\n                    else {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'TreeStructureDetached': {\n                    // TreeStructureAttached\n                    // TreeStructureChanged\n                    // TreeStructureDetached 👈🏻 Since the tree struct was detached, above 2 changes may be ignored.\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'TreeStructureAttached') {\n                            return pastChange.treeKey !== change.treeKey;\n                        }\n                        else if (pastChange.type === 'TreeStructureChanged') {\n                            return pastChange.treeKey !== change.treeKey;\n                        }\n                        return true;\n                    });\n                    mergedChanges.push(change);\n                    break;\n                }\n                case 'TreeStructureChanged': {\n                    const existingChange = mergedChanges.find((pastChange) => {\n                        return (pastChange.type === 'TreeStructureChanged' &&\n                            pastChange.treeKey === change.treeKey &&\n                            pastChange.nodeId === change.nodeId);\n                    });\n                    if (existingChange) {\n                        existingChange.newParentId =\n                            change.newParentId;\n                    }\n                    else {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                default:\n                    mergedChanges.push(change);\n                    break;\n            }\n        });\n        return mergedChanges;\n    }\n    // ================= Node =================\n    checkNodeExistence(id) {\n        if (!this.hasNode(id)) {\n            throw new Error('Node not found for id: ' + id);\n        }\n    }\n    /**\n     * Check if a node exists in the graph.\n     * @group NodeMethods\n     */\n    hasNode(id) {\n        return this.nodeMap.has(id);\n    }\n    /**\n     * Tell if two nodes are neighbors.\n     * @group NodeMethods\n     */\n    areNeighbors(firstNodeId, secondNodeId) {\n        this.checkNodeExistence(firstNodeId);\n        return this.getNeighbors(secondNodeId).some((neighbor) => neighbor.id === firstNodeId);\n    }\n    /**\n     * Get the node data with given ID.\n     * @group NodeMethods\n     */\n    getNode(id) {\n        this.checkNodeExistence(id);\n        return this.nodeMap.get(id);\n    }\n    /**\n     * Given a node ID, find all edges of the node.\n     * @param id - ID of the node\n     * @param direction - Edge direction, defaults to 'both'.\n     * @group NodeMethods\n     */\n    getRelatedEdges(id, direction) {\n        this.checkNodeExistence(id);\n        const inEdges = this.inEdgesMap.get(id);\n        const outEdges = this.outEdgesMap.get(id);\n        if (direction === 'in') {\n            return Array.from(inEdges);\n        }\n        else if (direction === 'out') {\n            return Array.from(outEdges);\n        }\n        const bothEdges = new Set([...inEdges, ...outEdges]);\n        return Array.from(bothEdges);\n    }\n    /**\n     * Get the degree of the given node.\n     * @group NodeMethods\n     */\n    getDegree(id, direction) {\n        return this.getRelatedEdges(id, direction).length;\n    }\n    /**\n     * Get all successors of the given node.\n     */\n    getSuccessors(id) {\n        const outEdges = this.getRelatedEdges(id, 'out');\n        const targets = outEdges.map((edge) => edge.target);\n        return Array.from(new Set(targets)).map((id) => this.getNode(id));\n    }\n    /**\n     * Get all predecessors of the given node.\n     */\n    getPredecessors(id) {\n        const inEdges = this.getRelatedEdges(id, 'in');\n        const sources = inEdges.map((edge) => edge.source);\n        return Array.from(new Set(sources)).map((id) => this.getNode(id));\n    }\n    /**\n     * Given a node ID, find its neighbors.\n     * @param id - ID of the node\n     * @group NodeMethods\n     */\n    getNeighbors(id) {\n        const predecessors = this.getPredecessors(id);\n        const successors = this.getSuccessors(id);\n        return Array.from(new Set([...predecessors, ...successors]));\n    }\n    doAddNode(node) {\n        if (this.hasNode(node.id)) {\n            throw new Error('Node already exists: ' + node.id);\n        }\n        this.nodeMap.set(node.id, node);\n        this.inEdgesMap.set(node.id, new Set());\n        this.outEdgesMap.set(node.id, new Set());\n        this.treeIndices.forEach((tree) => {\n            tree.childrenMap.set(node.id, new Set());\n        });\n        this.changes.push({ type: 'NodeAdded', value: node });\n    }\n    /**\n     * Add all nodes of the given array, or iterable, into the graph.\n     * @group NodeMethods\n     */\n    addNodes(nodes) {\n        this.batch(() => {\n            for (const node of nodes) {\n                this.doAddNode(node);\n            }\n        });\n    }\n    /**\n     * Add a single node into the graph.\n     * @group NodeMethods\n     */\n    addNode(node) {\n        this.addNodes([node]);\n    }\n    doRemoveNode(id) {\n        const node = this.getNode(id);\n        const inEdges = this.inEdgesMap.get(id);\n        const outEdges = this.outEdgesMap.get(id);\n        inEdges?.forEach((edge) => this.doRemoveEdge(edge.id));\n        outEdges?.forEach((edge) => this.doRemoveEdge(edge.id));\n        this.nodeMap.delete(id);\n        this.treeIndices.forEach((tree) => {\n            tree.childrenMap.get(id)?.forEach((child) => {\n                tree.parentMap.delete(child.id);\n            });\n            tree.parentMap.delete(id);\n            tree.childrenMap.delete(id);\n        });\n        this.changes.push({ type: 'NodeRemoved', value: node });\n    }\n    /**\n     * Remove nodes and their attached edges from the graph.\n     * @group NodeMethods\n     */\n    removeNodes(idList) {\n        this.batch(() => {\n            idList.forEach((id) => this.doRemoveNode(id));\n        });\n    }\n    /**\n     * Remove a single node and its attached edges from the graph.\n     * @group NodeMethods\n     */\n    removeNode(id) {\n        this.removeNodes([id]);\n    }\n    /**\n     * Update node data.\n     * @group NodeMethods\n     */\n    updateNodeData(id, propertyName, value) {\n        const node = this.getNode(id);\n        this.batch(() => {\n            const oldValue = node.data[propertyName];\n            const newValue = value;\n            node.data[propertyName] = newValue;\n            this.changes.push({\n                type: 'NodeDataUpdated',\n                id,\n                propertyName,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    /**\n     * Like Object.assign, merge all properties of `path` to the node data.\n     * @param id Node ID.\n     * @param patch A data object to merge.\n     */\n    mergeNodeData(id, patch) {\n        this.batch(() => {\n            Object.entries(patch).forEach(([propertyName, value]) => {\n                this.updateNodeData(id, propertyName, value);\n            });\n        });\n    }\n    // ================= Edge =================\n    checkEdgeExistence(id) {\n        if (!this.hasEdge(id)) {\n            throw new Error('Edge not found for id: ' + id);\n        }\n    }\n    /**\n     * Check if an edge exists in the graph.\n     * @group NodeMethods\n     */\n    hasEdge(id) {\n        return this.edgeMap.has(id);\n    }\n    /**\n     * Get the edge data with given ID.\n     * @group EdgeMethods\n     */\n    getEdge(id) {\n        this.checkEdgeExistence(id);\n        return this.edgeMap.get(id);\n    }\n    /**\n     * Get the edge, the source node, and the target node by an edge ID.\n     * @group EdgeMethods\n     */\n    getEdgeDetail(id) {\n        const edge = this.getEdge(id);\n        return {\n            edge,\n            source: this.getNode(edge.source),\n            target: this.getNode(edge.target),\n        };\n    }\n    doAddEdge(edge) {\n        if (this.hasEdge(edge.id)) {\n            throw new Error('Edge already exists: ' + edge.id);\n        }\n        this.checkNodeExistence(edge.source);\n        this.checkNodeExistence(edge.target);\n        this.edgeMap.set(edge.id, edge);\n        const inEdges = this.inEdgesMap.get(edge.target);\n        const outEdges = this.outEdgesMap.get(edge.source);\n        inEdges.add(edge);\n        outEdges.add(edge);\n        this.changes.push({ type: 'EdgeAdded', value: edge });\n    }\n    /**\n     * Add all edges of the given iterable(an array, a set, etc.) into the graph.\n     * @group EdgeMethods\n     */\n    addEdges(edges) {\n        this.batch(() => {\n            for (const edge of edges) {\n                this.doAddEdge(edge);\n            }\n        });\n    }\n    /**\n     * Add a single edge pointing from `source` to `target` into the graph.\n     *\n     * ```ts\n     * graph.addNode({ id: 'NodeA' });\n     * graph.addNode({ id: 'NodeB' });\n     * graph.addEdge({ id: 'EdgeA', source: 'NodeA', target: 'NodeB' });\n     * ```\n     *\n     * If `source` or `target` were not found in the current graph, it throws an Error.\n     * @group EdgeMethods\n     */\n    addEdge(edge) {\n        this.addEdges([edge]);\n    }\n    doRemoveEdge(id) {\n        const edge = this.getEdge(id);\n        const outEdges = this.outEdgesMap.get(edge.source);\n        const inEdges = this.inEdgesMap.get(edge.target);\n        outEdges.delete(edge);\n        inEdges.delete(edge);\n        this.edgeMap.delete(id);\n        this.changes.push({ type: 'EdgeRemoved', value: edge });\n    }\n    /**\n     * Remove edges whose id was included in the given id list.\n     * @group EdgeMethods\n     */\n    removeEdges(idList) {\n        this.batch(() => {\n            idList.forEach((id) => this.doRemoveEdge(id));\n        });\n    }\n    /**\n     * Remove a single edge of the given id.\n     * @group EdgeMethods\n     */\n    removeEdge(id) {\n        this.removeEdges([id]);\n    }\n    /**\n     * Change the source of an edge. The source must be found in current graph.\n     * @group EdgeMethods\n     */\n    updateEdgeSource(id, source) {\n        const edge = this.getEdge(id);\n        this.checkNodeExistence(source);\n        const oldSource = edge.source;\n        const newSource = source;\n        this.outEdgesMap.get(oldSource).delete(edge);\n        this.outEdgesMap.get(newSource).add(edge);\n        edge.source = source;\n        this.batch(() => {\n            this.changes.push({\n                type: 'EdgeUpdated',\n                id,\n                propertyName: 'source',\n                oldValue: oldSource,\n                newValue: newSource,\n            });\n        });\n    }\n    /**\n     * Change the target of an edge. The target must be found in current graph.\n     * @group EdgeMethods\n     */\n    updateEdgeTarget(id, target) {\n        const edge = this.getEdge(id);\n        this.checkNodeExistence(target);\n        const oldTarget = edge.target;\n        const newTarget = target;\n        this.inEdgesMap.get(oldTarget).delete(edge);\n        this.inEdgesMap.get(newTarget).add(edge);\n        edge.target = target;\n        this.batch(() => {\n            this.changes.push({\n                type: 'EdgeUpdated',\n                id,\n                propertyName: 'target',\n                oldValue: oldTarget,\n                newValue: newTarget,\n            });\n        });\n    }\n    /**\n     * Update edge data.\n     * @group EdgeMethods\n     */\n    updateEdgeData(id, propertyName, value) {\n        const edge = this.getEdge(id);\n        this.batch(() => {\n            const oldValue = edge.data[propertyName];\n            const newValue = value;\n            edge.data[propertyName] = newValue;\n            this.changes.push({\n                type: 'EdgeDataUpdated',\n                id,\n                propertyName,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    /**\n     * @group EdgeMethods\n     */\n    mergeEdgeData(id, patch) {\n        this.batch(() => {\n            Object.entries(patch).forEach(([propertyName, value]) => {\n                this.updateEdgeData(id, propertyName, value);\n            });\n        });\n    }\n    // ================= Tree =================\n    checkTreeExistence(treeKey) {\n        if (!this.treeIndices.has(treeKey)) {\n            throw new Error('Tree structure not found for treeKey: ' + treeKey);\n        }\n    }\n    /**\n     * Attach a new tree structure representing the hierarchy of all nodes in the graph.\n     * @param treeKey A unique key of the tree structure. You can attach multiple tree structures with different keys.\n     *\n     * ```ts\n     * const graph = new Graph({\n     *   nodes: [{ id: 1 }, { id: 2 }, { id: 3 }],\n     * });\n     * graph.attachTreeStructure('Inheritance');\n     * graph.setParent(2, 1, 'Inheritance');\n     * graph.setParent(3, 1, 'Inheritance');\n     * graph.getRoots('Inheritance'); // [1]\n     * graph.getChildren(1, 'Inheritance'); // [2,3]\n     * ```\n     * @group TreeMethods\n     */\n    attachTreeStructure(treeKey) {\n        if (this.treeIndices.has(treeKey)) {\n            // Already attached.\n            return;\n        }\n        this.treeIndices.set(treeKey, {\n            parentMap: new Map(),\n            childrenMap: new Map(),\n        });\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureAttached',\n                treeKey,\n            });\n        });\n    }\n    /**\n     * Detach the tree structure of the given tree key from the graph.\n     *\n     * ```ts\n     * graph.detachTreeStructure('Inheritance');\n     * graph.getRoots('Inheritance'); // Error!\n     * ```\n     * @group TreeMethods\n     */\n    detachTreeStructure(treeKey) {\n        this.checkTreeExistence(treeKey);\n        this.treeIndices.delete(treeKey);\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureDetached',\n                treeKey,\n            });\n        });\n    }\n    /**\n     * Traverse the given tree data, add each node into the graph, then attach the tree structure.\n     *\n     * ```ts\n     * graph.addTree({\n     *   id: 1,\n     *   children: [\n     *     { id: 2 },\n     *     { id: 3 },\n     *   ],\n     * }, 'Inheritance');\n     * graph.getRoots('Inheritance'); // [1]\n     * graph.getChildren(1, 'Inheritance'); // [2, 3]\n     * graph.getAllNodes(); // [1, 2, 3]\n     * graph.getAllEdges(); // []\n     * ```\n     * @group TreeMethods\n     */\n    addTree(tree, treeKey) {\n        this.batch(() => {\n            this.attachTreeStructure(treeKey);\n            // Add Nodes\n            const nodes = [];\n            const stack = Array.isArray(tree) ? tree : [tree];\n            while (stack.length) {\n                const node = stack.shift();\n                nodes.push(node);\n                if (node.children) {\n                    stack.push(...node.children);\n                }\n            }\n            this.addNodes(nodes);\n            // Set parent for each child node.\n            nodes.forEach((parent) => {\n                parent.children?.forEach((child) => {\n                    this.setParent(child.id, parent.id, treeKey);\n                });\n            });\n        });\n    }\n    /**\n     * Get the root nodes of an attached tree structure.\n     *\n     * Consider a graph with the following tree structure attached:\n     * ```\n     * Tree structure:\n     *    O     3\n     *   / \\    |\n     *  1   2   4\n     * ```\n     * `graph.getRoots()` takes all nodes without a parent, therefore [0, 3] was returned.\n     *\n     * Newly added nodes are also unparented. So they are counted as roots.\n     * ```ts\n     * graph.addNode({ id: 5 });\n     * graph.getRoots(); // [0, 3, 5]\n     * ```\n     *\n     * Here is how the tree structure looks like:\n     * ```\n     * Tree structure:\n     *    O     3  5\n     *   / \\    |\n     *  1   2   4\n     * ```\n     *\n     * By setting a parent, a root node no more be a root.\n     * ```ts\n     * graph.setParent(5, 2);\n     * graph.getRoots(); // [0, 3]\n     * ```\n     *\n     * The tree structure now becomes:\n     * ```\n     * Tree structure:\n     *    O     3\n     *   / \\    |\n     *  1   2   4\n     *      |\n     *      5\n     * ```\n     *\n     * Removing a node forces its children to be unparented, or roots.\n     * ```ts\n     * graph.removeNode(0);\n     * graph.getRoots(); // [1, 2, 3]\n     * ```\n     *\n     * You might draw the the structure as follow:\n     * ```\n     * Tree structure:\n     *  1   2  3\n     *      |  |\n     *      5  4\n     * ```\n     * @group TreeMethods\n     */\n    getRoots(treeKey) {\n        this.checkTreeExistence(treeKey);\n        return this.getAllNodes().filter((node) => !this.getParent(node.id, treeKey));\n    }\n    /**\n     * Given a node ID and an optional tree key, get the children of the node in the specified tree structure.\n     * @group TreeMethods\n     */\n    getChildren(id, treeKey) {\n        this.checkNodeExistence(id);\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        const children = tree.childrenMap.get(id);\n        return Array.from(children || []);\n    }\n    /**\n     * Given a node ID and an optional tree key, get the parent of the node in the specified tree structure.\n     * If the given node is one of the tree roots, this returns null.\n     * @group TreeMethods\n     */\n    getParent(id, treeKey) {\n        this.checkNodeExistence(id);\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        return tree.parentMap.get(id) || null;\n    }\n    /**\n     * Set node parent. If this operation causes a circle, it fails with an error.\n     * @param id - ID of the child node.\n     * @param parent - ID of the parent node.\n     * @param treeKey - Which tree structure the relation is applied to.\n     * @group TreeMethods\n     */\n    setParent(id, parent, treeKey) {\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        const node = this.getNode(id);\n        const oldParent = tree.parentMap.get(id);\n        const newParent = this.getNode(parent);\n        // Set parent\n        tree.parentMap.set(id, newParent);\n        // Set children\n        if (oldParent) {\n            tree.childrenMap.get(oldParent.id)?.delete(node);\n        }\n        let children = tree.childrenMap.get(newParent.id);\n        if (!children) {\n            children = new Set();\n            tree.childrenMap.set(newParent.id, children);\n        }\n        children.add(node);\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureChanged',\n                treeKey,\n                nodeId: id,\n                oldParentId: oldParent?.id,\n                newParentId: newParent.id,\n            });\n        });\n    }\n    // ================= Graph =================\n    /**\n     * Get all nodes in the graph as an array.\n     */\n    getAllNodes() {\n        return Array.from(this.nodeMap.values());\n    }\n    /**\n     * Get all edges in the graph as an array.\n     */\n    getAllEdges() {\n        return Array.from(this.edgeMap.values());\n    }\n    doBFS(queue, visited, fn) {\n        while (queue.length) {\n            const node = queue.shift();\n            fn(node);\n            visited.add(node.id);\n            this.getSuccessors(node.id).forEach((n) => {\n                if (!visited.has(n.id)) {\n                    visited.add(n.id);\n                    queue.push(n);\n                }\n            });\n        }\n    }\n    bfs(id, fn) {\n        this.doBFS([this.getNode(id)], new Set(), fn);\n    }\n    doDFS(node, visited, fn) {\n        fn(node);\n        visited.add(node.id);\n        this.getSuccessors(node.id).forEach((n) => {\n            if (!visited.has(n.id)) {\n                this.doDFS(n, visited, fn);\n            }\n        });\n    }\n    dfs(id, fn) {\n        this.doDFS(this.getNode(id), new Set(), fn);\n    }\n    clone() {\n        // Make a shallow copy of nodes and edges.\n        const newNodes = this.getAllNodes().map((oldNode) => {\n            return { ...oldNode, data: { ...oldNode.data } };\n        });\n        const newEdges = this.getAllEdges().map((oldEdge) => {\n            return { ...oldEdge, data: { ...oldEdge.data } };\n        });\n        // Create a new graph with shallow copied nodes and edges.\n        const newGraph = new Graph({\n            nodes: newNodes,\n            edges: newEdges,\n        });\n        // Add tree indices.\n        this.treeIndices.forEach(({ parentMap: oldParentMap, childrenMap: oldChildrenMap }, treeKey) => {\n            const parentMap = new Map();\n            oldParentMap.forEach((parent, key) => {\n                parentMap.set(key, newGraph.getNode(parent.id));\n            });\n            const childrenMap = new Map();\n            oldChildrenMap.forEach((children, key) => {\n                childrenMap.set(key, new Set(Array.from(children).map((n) => newGraph.getNode(n.id))));\n            });\n            newGraph.treeIndices.set(treeKey, {\n                parentMap: parentMap,\n                childrenMap: childrenMap,\n            });\n        });\n        return newGraph;\n    }\n    toJSON() {\n        return JSON.stringify({\n            nodes: this.getAllNodes(),\n            edges: this.getAllEdges(),\n            // FIXME: And tree structures?\n        });\n    }\n}\n//# sourceMappingURL=Graph.js.map"],"names":["has","Object","prototype","hasOwnProperty","prefix","Events","EE","fn","context","once","this","addListener","emitter","event","TypeError","listener","evt","_events","push","_eventsCount","clearEvent","EventEmitter","create","__proto__","eventNames","events","name","names","call","slice","getOwnPropertySymbols","concat","listeners","handlers","i","l","length","ee","Array","listenerCount","emit","a1","a2","a3","a4","a5","args","len","arguments","removeListener","undefined","apply","j","on","removeAllListeners","off","prefixed","module","exports","addMethods","methods","w","Worker","URL","createObjectURL","Blob","revokeObjectURL","worker","c","callbacks","addEventListener","e","d","data","type","id","f","error","assign","Error","message","result","document","createEvent","initEvent","method","params","dispatchEvent","forEach","_arguments","Promise","a","b","postMessage","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","n","getter","__esModule","definition","key","o","defineProperty","enumerable","get","obj","prop","r","Symbol","toStringTag","value","extendStatics","setPrototypeOf","p","__assign","t","s","__read","m","iterator","ar","next","done","camelizeRE","str","replace","_","toUpperCase","isArray","isObject","val","clone","target","Date","getTime","v","map","keys","k","getEdgeTerminal","edge","terminal","cell","getFuncByUnknownType","defaultValue","resultIsNumber","max","Math","to","from","pack","isNaN","width","height","size","DEFAULTS_LAYOUT_OPTIONS","radius","startRadius","endRadius","startAngle","endAngle","PI","clockwise","divisions","ordering","angleRatio","options","execute","graph","genericCircularLayout","batch","mergedOptions","center","paramNodeSpacing","paramNodeSize","onLayoutEnd","nodes","getAllNodes","edges","getAllEdges","calculatedWidth","calculatedHeight","calculatedCenter","window","innerWidth","innerHeight","calculateCenter","updateNodeData","x","y","angleStep","nodeMap","node","degrees","nodeIdxMap","in","out","all","source","getDegree","nSize","astep","layoutNodes","nodesData","topologyOrdering","orderedNodes","degree","sort","compareDegree","degreeOrdering","divN","ceil","angle","floor","cos","sin","weight","mergeNodeData","aDegree","bDegree","directed","cnodes","orderedCNodes","resNodes","pickFlags","children","parent","sourceIdx","targetIdx","child","sourceChildren","targetChildren","initHierarchy","cnode","connect","foundChild","childIdx","ii","SupervisorEvent","LAYOUT_ITERATION","LAYOUT_END","layout","spawnWorker","String","__","constructor","terminate","running","start","payload","arraybufferWithNodesEdges","Float32Array","calculateLayout","then","positions","stop","kill","isRunning","registry","circular","CircularLayout","registerLayout","Graph","Map","edgeMap","inEdgesMap","outEdgesMap","treeIndices","changes","batchCount","onChanged","addNodes","addEdges","tree","addTree","commit","reduceChanges","mergedChanges","change","isNewlyAdded","filter","pastChange","sameId","nodeId","existingChange","find","propertyName","newValue","treeKey","newParentId","checkNodeExistence","hasNode","areNeighbors","firstNodeId","secondNodeId","getNeighbors","some","neighbor","getNode","getRelatedEdges","direction","inEdges","outEdges","bothEdges","Set","getSuccessors","targets","getPredecessors","sources","predecessors","successors","doAddNode","set","childrenMap","addNode","doRemoveNode","doRemoveEdge","delete","parentMap","removeNodes","idList","removeNode","oldValue","patch","entries","checkEdgeExistence","hasEdge","getEdge","getEdgeDetail","doAddEdge","add","addEdge","removeEdges","removeEdge","updateEdgeSource","oldSource","newSource","updateEdgeTarget","oldTarget","newTarget","updateEdgeData","mergeEdgeData","checkTreeExistence","attachTreeStructure","detachTreeStructure","stack","shift","setParent","getRoots","getParent","getChildren","oldParent","newParent","oldParentId","values","doBFS","queue","visited","bfs","doDFS","dfs","newNodes","oldNode","newEdges","oldEdge","newGraph","oldParentMap","oldChildrenMap","toJSON","JSON","stringify"],"sourceRoot":""}
+{"version":3,"file":"index.min.js","mappings":"CAAA,SAA2CA,EAAMC,GAC1B,iBAAZC,SAA0C,iBAAXC,OACxCA,OAAOD,QAAUD,IACQ,mBAAXG,QAAyBA,OAAOC,IAC9CD,OAAO,GAAIH,GACe,iBAAZC,QACdA,QAAgB,OAAID,IAEpBD,EAAa,OAAIC,GAClB,CATD,CASGK,MAAM,I,kCCPT,IAAIC,EAAMC,OAAOC,UAAUC,eACvBC,EAAS,IASb,SAASC,IAAU,CA4BnB,SAASC,EAAGC,EAAIC,EAASC,GACvBC,KAAKH,GAAKA,EACVG,KAAKF,QAAUA,EACfE,KAAKD,KAAOA,IAAQ,CACtB,CAaA,SAASE,EAAYC,EAASC,EAAON,EAAIC,EAASC,GAChD,GAAkB,mBAAPF,EACT,MAAM,IAAIO,UAAU,mCAGtB,IAAIC,EAAW,IAAIT,EAAGC,EAAIC,GAAWI,EAASH,GAC1CO,EAAMZ,EAASA,EAASS,EAAQA,EAMpC,OAJKD,EAAQK,QAAQD,GACXJ,EAAQK,QAAQD,GAAKT,GAC1BK,EAAQK,QAAQD,GAAO,CAACJ,EAAQK,QAAQD,GAAMD,GADhBH,EAAQK,QAAQD,GAAKE,KAAKH,IADlCH,EAAQK,QAAQD,GAAOD,EAAUH,EAAQO,gBAI7DP,CACT,CASA,SAASQ,EAAWR,EAASI,GACI,KAAzBJ,EAAQO,aAAoBP,EAAQK,QAAU,IAAIZ,SAC5CO,EAAQK,QAAQD,EAC9B,CASA,SAASK,IACPX,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,CACtB,CAzEIlB,OAAOqB,SACTjB,EAAOH,UAAYD,OAAOqB,OAAO,OAM5B,IAAIjB,GAASkB,YAAWnB,GAAS,IA2ExCiB,EAAanB,UAAUsB,WAAa,WAClC,IACIC,EACAC,EAFAC,EAAQ,GAIZ,GAA0B,IAAtBjB,KAAKS,aAAoB,OAAOQ,EAEpC,IAAKD,KAASD,EAASf,KAAKO,QACtBjB,EAAI4B,KAAKH,EAAQC,IAAOC,EAAMT,KAAKd,EAASsB,EAAKG,MAAM,GAAKH,GAGlE,OAAIzB,OAAO6B,sBACFH,EAAMI,OAAO9B,OAAO6B,sBAAsBL,IAG5CE,CACT,EASAN,EAAanB,UAAU8B,UAAY,SAAmBnB,GACpD,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCoB,EAAWvB,KAAKO,QAAQD,GAE5B,IAAKiB,EAAU,MAAO,GACtB,GAAIA,EAAS1B,GAAI,MAAO,CAAC0B,EAAS1B,IAElC,IAAK,IAAI2B,EAAI,EAAGC,EAAIF,EAASG,OAAQC,EAAK,IAAIC,MAAMH,GAAID,EAAIC,EAAGD,IAC7DG,EAAGH,GAAKD,EAASC,GAAG3B,GAGtB,OAAO8B,CACT,EASAhB,EAAanB,UAAUqC,cAAgB,SAAuB1B,GAC5D,IAAIG,EAAMZ,EAASA,EAASS,EAAQA,EAChCmB,EAAYtB,KAAKO,QAAQD,GAE7B,OAAKgB,EACDA,EAAUzB,GAAW,EAClByB,EAAUI,OAFM,CAGzB,EASAf,EAAanB,UAAUsC,KAAO,SAAc3B,EAAO4B,EAAIC,EAAIC,EAAIC,EAAIC,GACjE,IAAI7B,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAO,EAE/B,IAEI8B,EACAZ,EAHAF,EAAYtB,KAAKO,QAAQD,GACzB+B,EAAMC,UAAUZ,OAIpB,GAAIJ,EAAUzB,GAAI,CAGhB,OAFIyB,EAAUvB,MAAMC,KAAKuC,eAAepC,EAAOmB,EAAUzB,QAAI2C,GAAW,GAEhEH,GACN,KAAK,EAAG,OAAOf,EAAUzB,GAAGqB,KAAKI,EAAUxB,UAAU,EACrD,KAAK,EAAG,OAAOwB,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,IAAK,EACzD,KAAK,EAAG,OAAOT,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,IAAK,EAC7D,KAAK,EAAG,OAAOV,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,IAAK,EACjE,KAAK,EAAG,OAAOX,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,EAAIC,IAAK,EACrE,KAAK,EAAG,OAAOZ,EAAUzB,GAAGqB,KAAKI,EAAUxB,QAASiC,EAAIC,EAAIC,EAAIC,EAAIC,IAAK,EAG3E,IAAKX,EAAI,EAAGY,EAAO,IAAIR,MAAMS,EAAK,GAAIb,EAAIa,EAAKb,IAC7CY,EAAKZ,EAAI,GAAKc,UAAUd,GAG1BF,EAAUzB,GAAG4C,MAAMnB,EAAUxB,QAASsC,EACxC,KAAO,CACL,IACIM,EADAhB,EAASJ,EAAUI,OAGvB,IAAKF,EAAI,EAAGA,EAAIE,EAAQF,IAGtB,OAFIF,EAAUE,GAAGzB,MAAMC,KAAKuC,eAAepC,EAAOmB,EAAUE,GAAG3B,QAAI2C,GAAW,GAEtEH,GACN,KAAK,EAAGf,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,SAAU,MACpD,KAAK,EAAGwB,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,GAAK,MACxD,KAAK,EAAGT,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,EAAIC,GAAK,MAC5D,KAAK,EAAGV,EAAUE,GAAG3B,GAAGqB,KAAKI,EAAUE,GAAG1B,QAASiC,EAAIC,EAAIC,GAAK,MAChE,QACE,IAAKG,EAAM,IAAKM,EAAI,EAAGN,EAAO,IAAIR,MAAMS,EAAK,GAAIK,EAAIL,EAAKK,IACxDN,EAAKM,EAAI,GAAKJ,UAAUI,GAG1BpB,EAAUE,GAAG3B,GAAG4C,MAAMnB,EAAUE,GAAG1B,QAASsC,GAGpD,CAEA,OAAO,CACT,EAWAzB,EAAanB,UAAUmD,GAAK,SAAYxC,EAAON,EAAIC,GACjD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAWAa,EAAanB,UAAUO,KAAO,SAAcI,EAAON,EAAIC,GACrD,OAAOG,EAAYD,KAAMG,EAAON,EAAIC,GAAS,EAC/C,EAYAa,EAAanB,UAAU+C,eAAiB,SAAwBpC,EAAON,EAAIC,EAASC,GAClF,IAAIO,EAAMZ,EAASA,EAASS,EAAQA,EAEpC,IAAKH,KAAKO,QAAQD,GAAM,OAAON,KAC/B,IAAKH,EAEH,OADAa,EAAWV,KAAMM,GACVN,KAGT,IAAIsB,EAAYtB,KAAKO,QAAQD,GAE7B,GAAIgB,EAAUzB,GAEVyB,EAAUzB,KAAOA,GACfE,IAAQuB,EAAUvB,MAClBD,GAAWwB,EAAUxB,UAAYA,GAEnCY,EAAWV,KAAMM,OAEd,CACL,IAAK,IAAIkB,EAAI,EAAGT,EAAS,GAAIW,EAASJ,EAAUI,OAAQF,EAAIE,EAAQF,KAEhEF,EAAUE,GAAG3B,KAAOA,GACnBE,IAASuB,EAAUE,GAAGzB,MACtBD,GAAWwB,EAAUE,GAAG1B,UAAYA,IAErCiB,EAAOP,KAAKc,EAAUE,IAOtBT,EAAOW,OAAQ1B,KAAKO,QAAQD,GAAyB,IAAlBS,EAAOW,OAAeX,EAAO,GAAKA,EACpEL,EAAWV,KAAMM,EACxB,CAEA,OAAON,IACT,EASAW,EAAanB,UAAUoD,mBAAqB,SAA4BzC,GACtE,IAAIG,EAUJ,OARIH,GACFG,EAAMZ,EAASA,EAASS,EAAQA,EAC5BH,KAAKO,QAAQD,IAAMI,EAAWV,KAAMM,KAExCN,KAAKO,QAAU,IAAIZ,EACnBK,KAAKS,aAAe,GAGfT,IACT,EAKAW,EAAanB,UAAUqD,IAAMlC,EAAanB,UAAU+C,eACpD5B,EAAanB,UAAUS,YAAcU,EAAanB,UAAUmD,GAK5DhC,EAAamC,SAAWpD,EAKxBiB,EAAaA,aAAeA,EAM1BzB,EAAOD,QAAU0B,C,gBC7Uf,IAAIoC,EAAa,EAAQ,KACrBC,EAAU,CAAC,mBACf9D,EAAOD,QAAU,WAChB,IAAIgE,EAAI,IAAIC,OAAOC,IAAIC,gBAAgB,IAAIC,KAAK,CAAC,igyEAA0+yE,CAAErC,KAAM,yBAInizE,OAHAmC,IAAIG,gBAAgBH,IAAIC,gBAAgB,IAAIC,KAAK,CAAC,kgyEAClDN,EAAWE,EAAGD,GAEPC,CACR,C,UCkCJ/D,EAAOD,QA3CP,SAAoBsE,EAAQP,GAC1B,IAAIQ,EAAI,EACJC,EAAY,CAAC,EACjBF,EAAOG,iBAAiB,WAAW,SAAUC,GAC3C,IAAIC,EAAID,EAAEE,KACV,GAAe,QAAXD,EAAEE,KAEN,GAAIF,EAAEG,GAAI,CACR,IAAIC,EAAIP,EAAUG,EAAEG,IAEhBC,WACKP,EAAUG,EAAEG,IAEfH,EAAEK,MACJD,EAAE,GAAGzE,OAAO2E,OAAOC,MAAMP,EAAEK,MAAMG,SAAUR,EAAEK,QAE7CD,EAAE,GAAGJ,EAAES,QAGb,KAAO,CACL,IAAI/D,EAAMgE,SAASC,YAAY,SAC/BjE,EAAIkE,UAAUZ,EAAEa,QAAQ,GAAO,GAC/BnE,EAAIuD,KAAOD,EAAEc,OACbnB,EAAOoB,cAAcrE,EACvB,CACF,IACA0C,EAAQ4B,SAAQ,SAAUH,GACxBlB,EAAOkB,GAAU,WACf,IAAII,EAAavC,UACjB,OAAO,IAAIwC,SAAQ,SAAUC,EAAGC,GAC9B,IAAIjB,IAAOP,EACXC,EAAUM,GAAM,CAACgB,EAAGC,GACpBzB,EAAO0B,YAAY,CACjBnB,KAAM,MACNC,GAAIA,EACJU,OAAQA,EACRC,OAAQ,GAAGvD,MAAMD,KAAK2D,IAE1B,GACF,CACF,GACF,C,GCxCIK,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqB5C,IAAjB6C,EACH,OAAOA,EAAapG,QAGrB,IAAIC,EAASgG,EAAyBE,GAAY,CAGjDnG,QAAS,CAAC,GAOX,OAHAqG,EAAoBF,GAAUlG,EAAQA,EAAOD,QAASkG,GAG/CjG,EAAOD,OACf,CCrBAkG,EAAoBI,EAAKrG,IACxB,IAAIsG,EAAStG,GAAUA,EAAOuG,WAC7B,IAAOvG,EAAiB,QACxB,IAAM,EAEP,OADAiG,EAAoBvB,EAAE4B,EAAQ,CAAET,EAAGS,IAC5BA,CAAM,ECLdL,EAAoBvB,EAAI,CAAC3E,EAASyG,KACjC,IAAI,IAAIC,KAAOD,EACXP,EAAoBS,EAAEF,EAAYC,KAASR,EAAoBS,EAAE3G,EAAS0G,IAC5EpG,OAAOsG,eAAe5G,EAAS0G,EAAK,CAAEG,YAAY,EAAMC,IAAKL,EAAWC,IAE1E,ECNDR,EAAoBS,EAAI,CAACI,EAAKC,IAAU1G,OAAOC,UAAUC,eAAeyB,KAAK8E,EAAKC,GCClFd,EAAoBe,EAAKjH,IACH,oBAAXkH,QAA0BA,OAAOC,aAC1C7G,OAAOsG,eAAe5G,EAASkH,OAAOC,YAAa,CAAEC,MAAO,WAE7D9G,OAAOsG,eAAe5G,EAAS,aAAc,CAAEoH,OAAO,GAAO,E,kQCW9D,IAAIC,EAAgB,SAAS1C,EAAGoB,GAI5B,OAHAsB,EAAgB/G,OAAOgH,gBAClB,CAAE1F,UAAW,cAAgBe,OAAS,SAAUgC,EAAGoB,GAAKpB,EAAE/C,UAAYmE,CAAG,GAC1E,SAAUpB,EAAGoB,GAAK,IAAK,IAAIwB,KAAKxB,EAAOzF,OAAOC,UAAUC,eAAeyB,KAAK8D,EAAGwB,KAAI5C,EAAE4C,GAAKxB,EAAEwB,GAAI,EAC7FF,EAAc1C,EAAGoB,EAC5B,EAUWyB,EAAW,WAQlB,OAPAA,EAAWlH,OAAO2E,QAAU,SAAkBwC,GAC1C,IAAK,IAAIC,EAAGnF,EAAI,EAAG+D,EAAIjD,UAAUZ,OAAQF,EAAI+D,EAAG/D,IAE5C,IAAK,IAAIgF,KADTG,EAAIrE,UAAUd,GACOjC,OAAOC,UAAUC,eAAeyB,KAAKyF,EAAGH,KAAIE,EAAEF,GAAKG,EAAEH,IAE9E,OAAOE,CACX,EACOD,EAAShE,MAAMzC,KAAMsC,UAChC,EA+FO,SAASsE,EAAOhB,EAAGL,GACtB,IAAIsB,EAAsB,mBAAXV,QAAyBP,EAAEO,OAAOW,UACjD,IAAKD,EAAG,OAAOjB,EACf,IAAmBM,EAAYvC,EAA3BnC,EAAIqF,EAAE3F,KAAK0E,GAAOmB,EAAK,GAC3B,IACI,WAAc,IAANxB,GAAgBA,KAAM,MAAQW,EAAI1E,EAAEwF,QAAQC,MAAMF,EAAGvG,KAAK0F,EAAEG,MAQxE,CANA,MAAOpC,GAASN,EAAI,CAAEM,MAAOA,EAAS,CACtC,QACI,IACQiC,IAAMA,EAAEe,OAASJ,EAAIrF,EAAU,SAAIqF,EAAE3F,KAAKM,EAElB,CAAhC,QAAU,GAAImC,EAAG,MAAMA,EAAEM,KAAO,CACpC,CACA,OAAO8C,CACX,CAkBO,SAASG,EAAcC,EAAIC,EAAMC,GACpC,GAAIA,GAA6B,IAArB/E,UAAUZ,OAAc,IAAK,IAA4BqF,EAAxBvF,EAAI,EAAGC,EAAI2F,EAAK1F,OAAYF,EAAIC,EAAGD,KACxEuF,GAAQvF,KAAK4F,IACRL,IAAIA,EAAKnF,MAAMpC,UAAU2B,MAAMD,KAAKkG,EAAM,EAAG5F,IAClDuF,EAAGvF,GAAK4F,EAAK5F,IAGrB,OAAO2F,EAAG9F,OAAO0F,GAAMnF,MAAMpC,UAAU2B,MAAMD,KAAKkG,GACtD,CArE6B7H,OAAOqB,OA0GXrB,OAAOqB,OCrNzB,IAAM0G,EAAW,SAACC,GACvB,MAAe,iBAARA,CAAP,EAUIC,EAAa,SCXN,GDY+B,SAACC,GAC3C,OAAOA,EAAIC,QAAQF,GAAY,SAACG,EAAGnE,GAAM,OAACA,EAAIA,EAAEoE,cAAgB,EAAvB,GAC3C,EAVwCrI,OAAOqB,OAAO,MCJ/BgB,MAAMiG,SCAhB,EAAW,SAACN,GACvB,MAAe,iBAARA,CAAP,EC+DWO,EAAgB,SAACC,GAI5B,IAFA,IAAMC,EAAiB,GACjBC,EAAOF,EAAUrG,OACdF,EAAI,EAAGA,EAAIyG,EAAMzG,GAAK,EAAG,CAChCwG,EAAKxG,GAAK,GACV,IAAK,IAAIkB,EAAI,EAAGA,EAAIuF,EAAMvF,GAAK,EACzBlB,IAAMkB,EACRsF,EAAKxG,GAAGkB,GAAK,EACgB,IAApBqF,EAAUvG,GAAGkB,IAAaqF,EAAUvG,GAAGkB,GAGhDsF,EAAKxG,GAAGkB,GAAKqF,EAAUvG,GAAGkB,GAF1BsF,EAAKxG,GAAGkB,GAAKwF,G,CAOnB,IAAK,IAAIC,EAAI,EAAGA,EAAIF,EAAME,GAAK,EAC7B,IAAS3G,EAAI,EAAGA,EAAIyG,EAAMzG,GAAK,EAC7B,IAASkB,EAAI,EAAGA,EAAIuF,EAAMvF,GAAK,EACzBsF,EAAKxG,GAAGkB,GAAKsF,EAAKxG,GAAG2G,GAAKH,EAAKG,GAAGzF,KACpCsF,EAAKxG,GAAGkB,GAAKsF,EAAKxG,GAAG2G,GAAKH,EAAKG,GAAGzF,IAK1C,OAAOsF,CACT,EAEaI,EAAe,SAACvE,EAAwCwE,GAC3D,IAAAC,EAAiBzE,EAAI,MAAd0E,EAAU1E,EAAI,MACvB2E,EAAmB,GAEnBC,EAEF,CAAC,EAEL,IAAKH,EACH,MAAM,IAAInE,MAAM,uBAoBlB,OAlBImE,GACFA,EAAM1D,SAAQ,SAAC8D,EAAMlH,GACnBiH,EAAQC,EAAK3E,IAAMvC,EAEnBgH,EAAOhI,KADe,GAExB,IAGF+H,SAAAA,EAAO3D,SAAQ,SAACjB,GACN,IAAAgF,EAAmBhF,EAAC,OAAZiF,EAAWjF,EAAC,OACtBkF,EAASJ,EAAQE,GACjBG,EAASL,EAAQG,QACRpG,IAAXqG,QAAmCrG,IAAXsG,IAC5BN,EAAOK,GAAQC,GAAU,EACpBT,IACHG,EAAOM,GAAQD,GAAU,GAE7B,IACOL,CACT,EC3HaO,EAAW,SAACxB,GACvB,OAAQ,OAARA,GAA+B,iBAARA,CAAvB,EAEWyB,EAAQ,SAAIJ,GACvB,GAAe,OAAXA,EACF,OAAOA,EAET,GAAIA,aAAkBK,KACpB,OAAO,IAAIA,KAAKL,EAAOM,WAEzB,GAAIN,aAAkBhH,MAAO,CAC3B,IAAM,EAAK,GAIX,OAHCgH,EAAiBhE,SAAQ,SAACuE,GACzB,EAAG3I,KAAK2I,EACV,IACO,EAAGC,KAAI,SAAC7D,GAAW,OAAAyD,EAAWzD,EAAX,G,CAE5B,GAAsB,iBAAXqD,GAAuBrJ,OAAO8J,KAAKT,GAAQlH,OAAQ,CAC5D,IAAM,EAAK,KAAMkH,GAMjB,OAHArJ,OAAO8J,KAAK,GAAIzE,SAAQ,SAACuD,GACvB,EAAGA,GAAKa,EAAW,EAAGb,GACxB,IACO,C,CAET,OAAOS,CACT,ECxBaU,EAAa,SAAC/B,GACzB,MAAe,mBAARA,CAAP,EAkBWgC,EAAuB,SAClCC,EACAnD,EAMAoD,GAEA,YAFA,IAAAA,IAAAA,GAAA,GAEKpD,GAAmB,IAAVA,EAYViD,EAAWjD,GACNA,EAEL,EAASA,GACJ,WAAM,OAAAA,CAAA,EAEX,EAAQA,GACH,WACL,GAAIoD,EAAgB,CAClB,IAAMC,EAAMC,KAAKD,IAAG,MAARC,KAAI,OAAStD,IAAkB,IAC3C,OAAOuD,MAAMF,GAAOF,EAAeE,C,CAErC,OAAOrD,CACT,EAEE0C,EAAS1C,GACJ,WACL,GAAIoD,EAAgB,CAClB,IAAMC,EAAMC,KAAKD,IAAIrD,EAAMwD,MAAOxD,EAAMyD,QACxC,OAAOF,MAAMF,GAAOF,EAAeE,C,CAErC,MAAO,CAACrD,EAAMwD,MAAOxD,EAAMyD,OAC7B,EAEK,WAAM,OAAAN,CAAA,EAnCJ,SAAC5F,GACN,OAAIA,EAAEqE,KACA,EAAQrE,EAAEqE,MACLrE,EAAEqE,KAAK,GAAKrE,EAAEqE,KAAK,GAAKrE,EAAEqE,KAAK,GAAKrE,EAAEqE,KAAK,GAChDc,EAASnF,EAAEqE,MACNrE,EAAEqE,KAAK4B,MAAQjG,EAAEqE,KAAK6B,OAASlG,EAAEqE,KAAK4B,MAAQjG,EAAEqE,KAAK6B,OACvDlG,EAAEqE,KAEJuB,CACT,CA2BJ,EC/DMO,EAA0D,CAC9DC,OAAQ,KACRC,YAAa,KACbC,UAAW,KACXC,WAAY,EACZC,SAAU,EAAIT,KAAKU,GACnBC,WAAW,EACXC,UAAW,EACXC,SAAU,KACVC,WAAY,GAkBd,aAGE,WAAmBC,QAAA,IAAAA,IAAAA,EAAiC,CAAC,GAAlC,KAAAA,QAAAA,EAFnB,KAAA3G,GAAK,WAGH/D,KAAK0K,QAAU,OACVX,GACAW,EAEP,CAyJF,OApJE,YAAAC,QAAA,SAAQC,EAAcF,GACpB,OAAO1K,KAAK6K,uBAAsB,EAAOD,EAAOF,EAClD,EAKA,YAAAxG,OAAA,SAAO0G,EAAcF,GAArB,WACEE,EAAME,OAAM,WACV,EAAKD,uBAAsB,EAAMD,EAAOF,EAC1C,GACF,EAEQ,YAAAG,sBAAR,SAA8B3G,EAAiB0G,EAAcF,GAC3D,IAAMK,EAAgB,OAAK/K,KAAK0K,SAAYA,GACpCb,EAAqMkB,EAAa,MAA3MjB,EAA8LiB,EAAa,OAAnMC,EAAsLD,EAAa,OAA3LR,EAA8KQ,EAAa,UAAhL,EAAmKA,EAAa,WAAhLZ,OAAU,IAAG,IAAC,EAAE,EAAmJY,EAAa,SAAhKX,OAAQ,IAAG,IAAIT,KAAKU,GAAE,EAAEI,EAA2HM,EAAa,WAA5HP,EAA+GO,EAAa,SAAlHT,EAAqGS,EAAa,UAA1FE,EAA6EF,EAAa,YAA9DG,EAAiDH,EAAa,SAA/CI,EAAkCJ,EAAa,iBAA7BK,EAAgBL,EAAa,YAEtNzC,EAAQsC,EAAMS,cACd9C,EAAQqC,EAAMU,cAEbH,IACH7C,EAAQA,EAAMiD,QAAO,SAAA7C,GAAQ,OAAAA,EAAK7E,KAAK2H,cAAiChJ,IAAtBkG,EAAK7E,KAAK2H,OAA/B,IAC7BjD,EAAQA,EAAMgD,QAAO,SAAAE,GAAQ,OAAAA,EAAK5H,KAAK2H,cAAiChJ,IAAtBiJ,EAAK5H,KAAK2H,OAA/B,KAE/B,IAAMjG,EAAI+C,EAAM5G,OAGhB,GAAU,IAAN6D,EAKF,OAJA6F,SAAAA,EAAc,CACZ9C,MAAO,GACPC,MAAO,KAEF,CACLD,MAAO,GACPC,MAAO,IAKL,QAAwDmD,EAAgB7B,EAAOC,EAAQkB,GAAO,GAA7FW,EAAe,KAAEC,EAAgB,KAAEC,EAAgB,KAG1D,GAAU,IAANtG,EAAS,CACPrB,GACF0G,EAAMkB,cAAcxD,EAAM,GAAGvE,GAAI,CAC7BgI,EAAGF,EAAiB,GACpBG,EAAGH,EAAiB,KAG1B,IAAM,EAAS,CACbvD,MAAO,C,OAEAA,EAAM,IAAE,CACXzE,KAAM,OACDyE,EAAM,GAAGzE,MAAI,CAChBkI,EAAGF,EAAiB,GACpBG,EAAGH,EAAiB,QAI1BtD,MAAK,GAGP,OADA6C,SAAAA,EAAc,GACP,C,CAGT,IAAMa,GAAa7B,EAAWD,GAAc5E,EAEtCyE,EAAmCe,EAAa,OAAxCd,EAA2Bc,EAAa,YAA3Bb,EAAca,EAAa,UACtD,GAAIE,EAAkB,CACpB,IAAM,EAAwB1B,EAAqB,GAAI0B,GACjD,EAAqB1B,EAAqB,GAAI2B,GAChD,GAAc,IAClB5C,EAAM1D,SAAQ,SAAC8D,GACb,IAAMwD,EAAQ,EAASxD,GACnB,EAAcwD,IAAO,EAAcA,EACzC,IACA,IAAI,EAAY,EAChB5D,EAAM1D,SAAQ,SAAC8D,EAAMlH,GACN,GAAH,IAANA,EAAuB,GAAe,IACvB,EAAYkH,IAAS,IAAM,GAAe,GAC/D,IACAsB,EAAS,GAAa,EAAIL,KAAKU,G,MACrBL,GAAWC,GAAgBC,GAE3BD,GAAeC,EACzBD,EAAcC,EACLD,IAAgBC,IACzBA,EAAYD,GAJZD,EAASL,KAAKwC,IAAIP,EAAkBD,GAAmB,EAMzD,IAAMS,EAAQH,EAAYxB,EAGtB4B,EAAyB,GAG3BA,EAFe,aAAb7B,EAEY8B,EAAiB1B,EAAOtC,GAChB,sBAAbkC,EAEK8B,EAAiB1B,EAAOtC,GAAO,GACvB,WAAbkC,EAoHf,SACEI,EACAtC,GAEA,IAAMiE,EAA0B,GAKhC,OAJAjE,EAAM1D,SAAQ,SAAC8D,EAAMlH,GACnB+K,EAAa/L,KAAKwI,EAAMN,GAC1B,IACA6D,EAAaC,MAAK,SAACC,EAAaC,GAAgB,OAAC9B,EAAM+B,UAAUF,EAAM1I,GAAI,QAAU6G,EAAM+B,UAAUD,EAAM3I,GAAI,OAA/D,IACzCwI,CACT,CA5HoBK,CAAehC,EAAOtC,GAGtBA,EAAMc,KAAI,SAAAV,GAAQ,OAAAM,EAAMN,EAAN,IAIlC,IADA,IAAMmE,EAAOlD,KAAKmD,KAAKvH,EAAIgF,GAClB/I,EAAI,EAAGA,EAAI+D,IAAK/D,EAAG,CAC1B,IAAI0E,EAAI8D,EACH9D,GAAqB,OAAhB+D,GAAsC,OAAdC,IAChChE,EAAI+D,EAAgBzI,GAAK0I,EAAaD,IAAkB1E,EAAI,IAEzDW,IACHA,EAAI,GAAU,IAAJ1E,GAAY+D,EAAI,IAE5B,IAAIwH,EACF5C,EACC3I,EAAIqL,EAAQT,EACX,EAAIzC,KAAKU,GAAME,EAAcZ,KAAKqD,MAAMxL,EAAIqL,GAC3CvC,IACHyC,EACE3C,EACC5I,EAAIqL,EAAQT,EACX,EAAIzC,KAAKU,GAAME,EAAcZ,KAAKqD,MAAMxL,EAAIqL,IAElDR,EAAY7K,GAAGqC,KAAKkI,EAAIF,EAAiB,GAAKlC,KAAKsD,IAAIF,GAAS7G,EAChEmG,EAAY7K,GAAGqC,KAAKmI,EAAIH,EAAiB,GAAKlC,KAAKuD,IAAIH,GAAS7G,C,CAG9DhC,GACFmI,EAAYzH,SAAQ,SAAC8D,GACnBkC,EAAMkB,cAAcpD,EAAK3E,GAAI,CAC3BgI,EAAGrD,EAAK7E,KAAKkI,EACbC,EAAGtD,EAAK7E,KAAKmI,GAEjB,IAGF,IAAM3H,EAAS,CACbiE,MAAO+D,EACP9D,MAAK,GAIP,OAFA6C,SAAAA,EAAc/G,GAEPA,CACT,EACF,EAjKA,GA0KMiI,EAAmB,SACvB1B,EACAtC,EACAD,QAAA,IAAAA,IAAAA,GAAA,GAEA,IAAM8E,EAA2B,CAACnE,EAAMV,EAAM,KACxC8E,EAAuC,CAAC,EACxC7H,EAAI+C,EAAM5G,OAChB0L,EAAU9E,EAAM,GAAGvE,KAAM,EAEzB,IAAIoE,EAAI,EAwCR,OAvCAG,EAAM1D,SAAQ,SAAC8D,EAAMlH,GACnB,GAAU,IAANA,EACF,GACGA,IAAM+D,EAAI,GACTqF,EAAM+B,UAAUjE,EAAK3E,GAAI,UAAY6G,EAAM+B,UAAUrE,EAAM9G,EAAI,GAAGuC,GAAI,UACtE6G,EAAMyC,aAAaF,EAAchF,GAAGpE,GAAI2E,EAAK3E,KAE9CqJ,EAAU1E,EAAK3E,IAKX,CAGL,IAFA,IAAMuJ,EAAWjF,EAAWuC,EAAM2C,cAAcJ,EAAchF,GAAGpE,IAAM6G,EAAM4C,aAAaL,EAAchF,GAAGpE,IACvG0J,GAAa,EACR/K,EAAI,EAAGA,EAAI4K,EAAS5L,OAAQgB,IAAK,CACxC,IAAMgL,EAAQJ,EAAS5K,GACvB,GAAIkI,EAAM+B,UAAUe,EAAM3J,MAAQ6G,EAAM+B,UAAUjE,EAAK3E,MAAQqJ,EAAUM,EAAM3J,IAAK,CAClFoJ,EAAc3M,KAAKwI,EAAM0E,IACzBN,EAAUM,EAAM3J,KAAM,EACtB0J,GAAa,EACb,K,EAIJ,IADA,IAAIE,EAAK,GACDF,IACDL,EAAU9E,EAAMqF,GAAI5J,MACvBoJ,EAAc3M,KAAKwI,EAAMV,EAAMqF,KAC/BP,EAAU9E,EAAMqF,GAAI5J,KAAM,EAC1B0J,GAAa,KAEfE,IACWpI,K,MAvBb4H,EAAc3M,KAAKwI,EAAMN,IACzB0E,EAAU1E,EAAK3E,KAAM,EACrBoE,GA2BN,IACOgF,CACT,EA2BMzB,EAAkB,SACtB7B,EACAC,EACAkB,GAEA,IAAIW,EAAkB9B,EAClB+B,EAAmB9B,EACnB+B,EAAmBb,EAUvB,OATKW,GAAqC,oBAAXiC,SAC7BjC,EAAkBiC,OAAOC,YAEtBjC,GAAsC,oBAAXgC,SAC9BhC,EAAmBgC,OAAOE,aAEvBjC,IACHA,EAAmB,CAACF,EAAmB,EAAGC,EAAoB,IAEzD,CAACD,EAAkBC,EAAmBC,EAC/C,E,oCCvRakC,EAAkB,CAI7BC,iBAAkB,OAKlBC,WAAY,aAwBd,cAYE,WACUrD,EACAsD,EACRxD,GAHF,MAOE,cAAO,K,OANC,EAAAE,MAAAA,EACA,EAAAsD,OAAAA,EAcR,EAAKC,c,CACP,CA+EF,OR1IO,SAAmBvK,EAAGoB,GACzB,GAAiB,mBAANA,GAA0B,OAANA,EAC3B,MAAM,IAAI5E,UAAU,uBAAyBgO,OAAOpJ,GAAK,iCAE7D,SAASqJ,IAAOrO,KAAKsO,YAAc1K,CAAG,CADtC0C,EAAc1C,EAAGoB,GAEjBpB,EAAEpE,UAAkB,OAANwF,EAAazF,OAAOqB,OAAOoE,IAAMqJ,EAAG7O,UAAYwF,EAAExF,UAAW,IAAI6O,EACnF,CQwBgC,MA+B9B,YAAAF,YAAA,WACMnO,KAAKuD,QACPvD,KAAKuD,OAAOgL,YAWdvO,KAAKuD,OAAS,MAEVvD,KAAKwO,UACPxO,KAAKwO,SAAU,EACfxO,KAAKyO,QAET,EAEA,YAAAA,MAAA,sBACE,GAAIzO,KAAKwO,QAAS,OAAOxO,KAEzBA,KAAKwO,SAAU,EAGf,IAAME,EAAU,CACdR,OAAQ,CACNnK,GAAI/D,KAAKkO,OAAOnK,GAChB2G,QAAS1K,KAAKkO,OAAOxD,SAEvBpC,MAAOtI,KAAK4K,MAAMS,cAClB9C,MAAOvI,KAAK4K,MAAMU,eAQdqD,EAA4B,IAAIC,aAAa,CAAC,IAepD,OAJA5O,KAAKuD,OAAOsL,gBAAgBH,EAAS,CAACC,IAA4BG,MAAK,SAAC,G,IAAA,SAACC,EAAS,KAAe,KAC/F,EAAKjN,KAAKiM,EAAgBE,WAAYc,EACxC,IAEO/O,IACT,EAEA,YAAAgP,KAAA,WAEE,OADAhP,KAAKwO,SAAU,EACRxO,IACT,EAEA,YAAAiP,KAAA,WACMjP,KAAKuD,QACPvD,KAAKuD,OAAOgL,WAMhB,EAEA,YAAAW,UAAA,WACE,OAAOlP,KAAKwO,OACd,EACF,EA5GA,CAAgC,KClC1B,EAA4D,CAChEW,SAAU,GACVC,eAAgB,GAChBC,YAAa,GACbC,gBAAgB,EAChBC,WAAO/M,EACPgN,aAAa,EACbrF,WAAY,IAAUR,KAAKU,GAC3BC,WAAW,EACXmF,kBAAcjN,EACdkN,OAAQ,UAkBV,aAGE,WACShF,QAAA,IAAAA,IAAAA,EAAmC,CAAC,GAApC,KAAAA,QAAAA,EAHT,KAAA3G,GAAK,aAKHxE,OAAO2E,OAAOlE,KAAK0K,QAAS,EAAyBA,EACvD,CAqQF,OAhQE,YAAAC,QAAA,SAAQC,EAAcF,GACpB,OAAO1K,KAAK2P,yBAAwB,EAAO/E,EAAOF,EACpD,EAIA,YAAAxG,OAAA,SAAO0G,EAAcF,GACnB1K,KAAK2P,yBAAwB,EAAM/E,EAAOF,EAC5C,EAEQ,YAAAiF,wBAAR,SACEzL,EACA0G,EACAF,GAEA,IAAMK,EAAgB,OAAK/K,KAAK0K,SAAYA,GAElCkF,EAeN7E,EAAa,OAdR8E,EAcL9E,EAAa,MAbP+E,EAaN/E,EAAa,OAZPgF,EAYNhF,EAAa,OAXDiF,EAWZjF,EAAa,aAVRkF,EAULlF,EAAa,MATfT,EASES,EAAa,UARfyE,EAQEzE,EAAa,YAPf,EAOEA,EAAa,eAPfqE,OAAc,IAAG,KAAE,EACnBE,EAMEvE,EAAa,eALf,EAKEA,EAAa,WALfZ,OAAU,IAAG,MAAUR,KAAKU,GAAE,EAC9B8E,EAIEpE,EAAa,SAHfsE,EAGEtE,EAAa,YAFfI,EAEEJ,EAAa,iBADfK,EACEL,EAAa,YAEbzC,EAAQsC,EAAMS,cACd9C,EAAQqC,EAAMU,cAEbH,IACH7C,EAAQA,EAAMiD,QACZ,SAAC7C,GAAS,OAAAA,EAAK7E,KAAK2H,cAAiChJ,IAAtBkG,EAAK7E,KAAK2H,OAA/B,IAEZjD,EAAQA,EAAMgD,QACZ,SAACE,GAAS,OAAAA,EAAK5H,KAAK2H,cAAiChJ,IAAtBiJ,EAAK5H,KAAK2H,OAA/B,KAId,IAAMjG,EAAI+C,EAAM5G,OAChB,GAAU,IAAN6D,EAAS,CACX,IAAM,EAAS,CAAE+C,MAAO,GAAIC,MAAK,GAEjC,OADA6C,SAAAA,EAAc,GACP,C,CAGT,IAAMvB,EACHgG,GAAgC,oBAAXjC,OAEjBiC,EADDjC,OAAOC,WAEP/D,EACHgG,GAAiC,oBAAXlC,OAElBkC,EADDlC,OAAOE,YAEP9C,EAAU4E,GACZ,CAAC/F,EAAQ,EAAGC,EAAS,GAGzB,GAAU,IAANvE,EAAS,CACPrB,GACF0G,EAAMkB,cAAcxD,EAAM,GAAGvE,GAAI,CAC/BgI,EAAGf,EAAO,GACVgB,EAAGhB,EAAO,KAGd,IAAM,EAAS,CACb1C,MAAO,C,OAEAA,EAAM,IAAE,CACXzE,KAAM,OACDyE,EAAM,GAAGzE,MAAI,CAChBkI,EAAGf,EAAO,GACVgB,EAAGhB,EAAO,QAIhBzC,MAAK,GAGP,OADA6C,SAAAA,EAAc,GACP,C,CAGT,IACI8E,EADE7D,EAAyB,GAE3B8D,EAAyB,EAE3BD,EADE,EAAQf,GACIxF,KAAKD,IAAIyF,EAAS,GAAIA,EAAS,IAE/BA,EAEZ,EAAQE,GACVc,EAAiBxG,KAAKD,IAAI2F,EAAY,GAAIA,EAAY,IAC7C,EAASA,KAClBc,EAAiBd,GAEnB/G,EAAM1D,SAAQ,SAAC8D,GACb2D,EAAY7L,KAAKwI,EAAMN,IACvB,IAAIyG,EAAmBe,EACnB,EAAQxH,EAAK7E,KAAKoE,MACpBkH,EAAWxF,KAAKD,IAAIhB,EAAK7E,KAAKoE,KAAK,GAAIS,EAAK7E,KAAKoE,KAAK,IAC7C,EAASS,EAAK7E,KAAKoE,MAC5BkH,EAAWzG,EAAK7E,KAAKoE,KACZc,EAASL,EAAK7E,KAAKoE,QAC5BkH,EAAWxF,KAAKD,IACbhB,EAAK7E,KAAKoE,KAAa4B,MACvBnB,EAAK7E,KAAKoE,KAAa6B,SAG5BoG,EAAcvG,KAAKD,IAAIwG,EAAaf,GAEhC7F,EAAW+F,KACbc,EAAiBxG,KAAKD,IAAI2F,EAAY3G,GAAOyH,GAEjD,IAGA,IAAMC,EAAuB,CAAC,EAC9B/D,EAAYzH,SAAQ,SAAC8D,EAAMlH,GACzB4O,EAAW1H,EAAK3E,IAAMvC,CACxB,IAGA,IAAIkO,EAASK,EAEVzI,EAASoI,SAC+BlN,IAAxC6J,EAAY,GAAWxI,KAAK6L,KAE7BA,EAAS,UAEI,WAAXA,EACFrD,EAAYG,MACV,SAAC6D,EAAUC,GACT,OAAA1F,EAAM+B,UAAU2D,EAAGvM,GAAI,QAAU6G,EAAM+B,UAAU0D,EAAGtM,GAAI,OAAxD,IAIJsI,EAAYG,MACV,SAAC6D,EAAUC,GACT,OAACA,EAAWzM,KAAK6L,GAAWW,EAAWxM,KAAK6L,EAA5C,IAIN,IAAMa,EAAelE,EAAY,GAE3BoD,EACJO,GAAsBO,EAAqB1M,KAAK6L,GAAU,EAGtDc,EAIA,CAAC,CAAElI,MAAO,KACZmI,EAAeD,EAAO,GAC1BnE,EAAYzH,SAAQ,SAAC8D,GACnB,GAAI+H,EAAanI,MAAM5G,OAAS,EAAG,CACjC,IAAMgP,EAAO/G,KAAKgH,IAChBF,EAAanI,MAAM,GAAGzE,KAAK6L,GAAqBhH,EAAa7E,KAAK6L,IAEhED,GAAgBiB,GAAQjB,IAC1BgB,EAAe,CAAEnI,MAAO,IACxBkI,EAAOhQ,KAAKiQ,G,CAGhBA,EAAanI,MAAM9H,KAAKkI,EAC1B,IAGA,IAAIkI,EAAUV,GAAeC,GAAkBf,GAC/C,IAAKE,EAAgB,CAEnB,IAAMuB,EAAmBL,EAAO9O,OAAS,GAAK8O,EAAO,GAAGlI,MAAM5G,OAAS,EAEjEoP,GADOnH,KAAKwC,IAAItC,EAAOC,GAAU,EAAI8G,IACrBJ,EAAO9O,QAAUmP,EAAmB,EAAI,IAE9DD,EAAUjH,KAAKwC,IAAIyE,EAASE,E,CAI9B,IAAI5K,EAAI,EAuBR,GAtBAsK,EAAO5L,SAAQ,SAACmM,GACd,IAAMxB,OACW/M,IAAfyN,EACI,EAAItG,KAAKU,GAAM,EAAIV,KAAKU,GAAM0G,EAAMzI,MAAM5G,OAC1CuO,EAIN,GAHAc,EAAMC,OAASzB,EAAQ5F,KAAKD,IAAI,EAAGqH,EAAMzI,MAAM5G,OAAS,GAGpDqP,EAAMzI,MAAM5G,OAAS,GAAK4N,EAAgB,CAE5C,IAAM2B,EAAOtH,KAAKsD,IAAI8D,EAAMC,QAAUrH,KAAKsD,IAAI,GACzCiE,EAAOvH,KAAKuD,IAAI6D,EAAMC,QAAUrH,KAAKuD,IAAI,GACzCiE,EAAOxH,KAAKyH,KACfR,EAAUA,GAAYK,EAAOA,EAAOC,EAAOA,IAG9ChL,EAAIyD,KAAKD,IAAIyH,EAAMjL,E,CAErB6K,EAAM7K,EAAIA,EACVA,GAAK0K,CACP,IAEIpB,EAAa,CAGf,IAFA,IAAI,EAAY,EACZ,EAAK,EACAhO,EAAI,EAAGA,EAAIgP,EAAO9O,OAAQF,IAAK,CACtC,IACM6P,GADQb,EAAOhP,GACC0E,GAAK,GAAK,EAChC,EAAYyD,KAAKD,IAAI,EAAW2H,E,CAElC,EAAK,EACLb,EAAO5L,SAAQ,SAACmM,EAAOvP,GACX,IAANA,IACF,EAAKuP,EAAM7K,GAAK,GAElB6K,EAAM7K,EAAI,EACV,GAAM,CACR,G,CAIFsK,EAAO5L,SAAQ,SAACmM,GACd,IAAMC,EAASD,EAAMC,QAAU,EACzBM,EAAKP,EAAM7K,GAAK,EACtB6K,EAAMzI,MAAM1D,SAAQ,SAAC8D,EAAehG,GAClC,IAAM6O,EAAQpH,GAAcG,EAAY,GAAK,GAAK0G,EAAStO,EAC3DgG,EAAK7E,KAAKkI,EAAIf,EAAO,GAAKsG,EAAK3H,KAAKsD,IAAIsE,GACxC7I,EAAK7E,KAAKmI,EAAIhB,EAAO,GAAKsG,EAAK3H,KAAKuD,IAAIqE,EAC1C,GACF,IAEIrN,GACFmI,EAAYzH,SAAQ,SAAC8D,GACnB,OAAAkC,EAAMkB,cAAcpD,EAAK3E,GAAI,CAC3BgI,EAAGrD,EAAK7E,KAAKkI,EACbC,EAAGtD,EAAK7E,KAAKmI,GAFf,IAOJ,IAAM3H,EAAS,CACbiE,MAAO+D,EACP9D,MAAK,GAKP,OAFA6C,SAAAA,EAAc/G,GAEPA,CACT,EACF,EA5QA,GCnBM,EAAsD,CAC1DmN,MAAO,CAAC,EAAG,GACXlC,gBAAgB,EAChBmC,sBAAuB,GACvBC,UAAU,EACVC,UAAMnP,EACNoP,UAAMpP,EACNqP,cAAUrP,EACVkN,OAAQ,SACRP,SAAU,GACVtF,MAAO,IACPC,OAAQ,KAkBV,aAGE,WAAmBY,QAAA,IAAAA,IAAAA,EAA6B,CAAC,GAA9B,KAAAA,QAAAA,EAFnB,KAAA3G,GAAK,OAGHxE,OAAO2E,OAAOlE,KAAK0K,QAAS,EAAyBA,EACvD,CAuQF,OAlQE,YAAAC,QAAA,SAAQC,EAAcF,GACpB,OAAO1K,KAAK8R,mBAAkB,EAAOlH,EAAOF,EAC9C,EAIA,YAAAxG,OAAA,SAAO0G,EAAcF,GACnB1K,KAAK8R,mBAAkB,EAAMlH,EAAOF,EACtC,EAEQ,YAAAoH,kBAAR,SACE5N,EACA0G,EACAF,GAEA,IAAMK,EAAgB,OAAK/K,KAAK0K,SAAYA,GAE1C,EAWEK,EAAa,MAXfyG,OAAK,IAAG,GAAC,EAAG,GAAE,EACdE,EAUE3G,EAAa,SATf0G,EASE1G,EAAa,sBARfuE,EAQEvE,EAAa,eAPfgH,EAOEhH,EAAa,QANTiH,EAMJjH,EAAa,KALf,EAKEA,EAAa,KALTkH,OAAS,IAAG,EAAAF,EAAO,EACZ9G,EAIXF,EAAa,YAHLG,EAGRH,EAAa,SAFfK,EAEEL,EAAa,YADf8G,EACE9G,EAAa,SAEf2E,EAIE3E,EAAa,OAHR8E,EAGL9E,EAAa,MAFP+E,EAEN/E,EAAa,OADfI,EACEJ,EAAa,iBAEbzC,EAAQsC,EAAMS,cACd9C,EAAQqC,EAAMU,cAEbH,IACH7C,EAAQA,EAAMiD,QACZ,SAAC7C,GAAS,OAAAA,EAAK7E,KAAK2H,cAAiChJ,IAAtBkG,EAAK7E,KAAK2H,OAA/B,IAEZjD,EAAQA,EAAMgD,QACZ,SAACE,GAAS,OAAAA,EAAK5H,KAAK2H,cAAiChJ,IAAtBiJ,EAAK5H,KAAK2H,OAA/B,KAId,IAAMjG,EAAI+C,EAAM5G,OAGhB,GAAU,IAAN6D,EAAS,CACX,IAAM,EAAS,CACb+C,MAAO,GACPC,MAAK,GAGP,OADA6C,SAAAA,EAAc,GACP,C,CAET,GAAU,IAAN7F,EAAS,CACPrB,GACF0G,EAAMkB,cAAcxD,EAAM,GAAGvE,GAAI,CAC/BgI,EAAGyF,EAAM,GACTxF,EAAGwF,EAAM,KAGb,IAAM,EAAS,CACblJ,MAAO,C,OAEAA,EAAM,IAAE,CACXzE,KAAM,OACDyE,EAAM,GAAGzE,MAAI,CAChBkI,EAAGyF,EAAM,GACTxF,EAAGwF,EAAM,QAIfjJ,MAAK,GAGP,OADA6C,SAAAA,EAAc,GACP,C,CAGT,IAAMiB,EAAyB/D,EAAMc,KAAI,SAACV,GAAS,OAAAM,EAAMN,EAAN,IAGhDpB,EAASoI,SAC+BlN,IAAxC6J,EAAY,GAAWxI,KAAK6L,KAE7BA,EAAS,UAEI,WAAXA,EACFrD,EAAYG,MACV,SAAC6D,EAAIC,GACH,OAAA1F,EAAM+B,UAAU2D,EAAGvM,GAAI,QAAU6G,EAAM+B,UAAU0D,EAAGtM,GAAI,OAAxD,IAIJsI,EAAYG,MACV,SAAC6D,EAAIC,GAAO,OAACA,EAAWzM,KAAK6L,GAAYW,EAAWxM,KAAK6L,EAA7C,IAGhB,IAAM7F,EACHgG,GAAgC,oBAAXjC,OAEjBiC,EADDjC,OAAOC,WAEP/D,EACHgG,GAAiC,oBAAXlC,OAElBkC,EADDlC,OAAOE,YAGPoE,EAAQ3M,EACR4M,EAAM,CAAER,KAAMK,EAAWJ,KAAMK,GAGrC,GAAiB,MAAbD,GAAkC,MAAbC,EACvBE,EAAIR,KAAOK,EACXG,EAAIP,KAAOK,OACN,GAAiB,MAAbD,GAAkC,MAAbC,EAC9BE,EAAIR,KAAOK,EACXG,EAAIP,KAAOjI,KAAKmD,KAAKoF,EAAQC,EAAIR,WAC5B,GAAiB,MAAbK,GAAkC,MAAbC,EAC9BE,EAAIP,KAAOK,EACXE,EAAIR,KAAOhI,KAAKmD,KAAKoF,EAAQC,EAAIP,UAC5B,CAGL,IAAMQ,EAASzI,KAAKyH,KAAMc,EAAQpI,EAAUD,GAC5CsI,EAAIR,KAAOhI,KAAK0I,MAAMD,GACtBD,EAAIP,KAAOjI,KAAK0I,MAAOxI,EAAQC,EAAUsI,E,CAI3C,GAFAD,EAAIR,KAAOhI,KAAKD,IAAIyI,EAAIR,KAAM,GAC9BQ,EAAIP,KAAOjI,KAAKD,IAAIyI,EAAIP,KAAM,GAC1BO,EAAIP,KAAOO,EAAIR,KAAOO,IAGlBI,EAAKC,EAAMJ,IAIP,IAHJK,EAAKC,EAAMN,KAGID,EACnBK,EAAMJ,EAAKG,EAAK,IACNE,EAAK,GAAKF,GAAMJ,GAC1BO,EAAMN,EAAKK,EAAK,QAIlB,KAAOL,EAAIP,KAAOO,EAAIR,KAAOO,GAAO,CAClC,IACMM,EADAF,EAAKC,EAAMJ,KACXK,EAAKC,EAAMN,IAGP,GAAKG,GAAMJ,EACnBO,EAAMN,EAAKK,EAAK,GAEhBD,EAAMJ,EAAKG,EAAK,E,CAKtB,IAAII,EAAYhB,EAAW,EAAI7H,EAAQsI,EAAIP,KACvCe,EAAajB,EAAW,EAAI5H,EAASqI,EAAIR,KAE7C,GAAIrC,GAAkBrE,EAAkB,CACtC,IAAM,EAAwB1B,EAAqB,GAAI0B,GACjD,EAAqB1B,EAAqB,GAAI2B,GAAe,GACnEmB,EAAYzH,SAAQ,SAAC8D,GACdA,EAAK7E,KAAKkI,GAAMrD,EAAK7E,KAAKmI,IAE7BtD,EAAK7E,KAAKkI,EAAI,EACdrD,EAAK7E,KAAKmI,EAAI,GAGhB,IAGI4G,EACAC,EAJEC,EAAQlI,EAAMmI,QAAQrK,EAAK3E,IAC3BiP,EAAM,EAASF,IAAU,GAK3B,EAAQE,IACVJ,EAAQI,EAAI,GACZH,EAAQG,EAAI,KAEZJ,EAAQI,EACRH,EAAQG,GAGV,IAAMxM,OACYhE,IAAhB,EAA4B,EAAYkG,GAAQ+I,EAE5CxO,EAAI2P,EAAQpM,EACZyM,EAAIJ,EAAQrM,EAElBkM,EAAY/I,KAAKD,IAAIgJ,EAAWzP,GAChC0P,EAAahJ,KAAKD,IAAIiJ,EAAYM,EACpC,G,CAUF,IAPA,IAAMC,EAAqB,CAAC,EAGtBC,EAAK,CAAEC,IAAK,EAAGC,IAAK,GAGpBC,EAA4B,CAAC,EAC1B9R,EAAI,EAAGA,EAAI6K,EAAY3K,OAAQF,IAAK,CAC3C,IAAMkH,EAAO2D,EAAY7K,GACrB+R,OAAK,EAMT,GALI1B,IAEF0B,EAAQ1B,EAASjH,EAAMmI,QAAQrK,EAAK3E,MAGlCwP,SAAwB/Q,IAAd+Q,EAAMH,UAAmC5Q,IAAd+Q,EAAMF,KAAoB,CAEjE,IAAMG,GAAM,CACVJ,IAAKG,EAAMH,IACXC,IAAKE,EAAMF,KAGb,QAAgB7Q,IAAZgR,GAAIH,IAIN,IAFAG,GAAIH,IAAM,EAEHI,EAAKP,EAAUM,KACpBA,GAAIH,WAED,QAAgB7Q,IAAZgR,GAAIJ,IAIb,IAFAI,GAAIJ,IAAM,EAEHK,EAAKP,EAAUM,KACpBA,GAAIJ,MAIRE,EAAU5K,EAAK3E,IAAMyP,GACrBE,EAAIR,EAAUM,G,CAEhBG,EAAOjL,EAAM8I,EAAOkB,EAAWC,EAAYW,EAAWnB,EAAKgB,EAAID,E,CAEjE,IAAM7O,GAAS,CACbiE,MAAO+D,EACP9D,MAAK,GAaP,OAVA6C,SAAAA,EAAc/G,IAEVH,GACFmI,EAAYzH,SAAQ,SAAC8D,GACnBkC,EAAMkB,cAAcpD,EAAK3E,GAAI,CAC3BgI,EAAGrD,EAAK7E,KAAKkI,EACbC,EAAGtD,EAAK7E,KAAKmI,GAEjB,IAEK3H,EACT,EACF,EA5QA,GA8QMkO,EAAQ,SACZJ,EACA5K,GAEA,IAAIyL,EACErB,EAAOQ,EAAIR,MAAQ,EACnBC,EAAOO,EAAIP,MAAQ,EAWzB,OAVW,MAAPrK,EACFyL,EAAMrJ,KAAKwC,IAAIwF,EAAMC,GAETjI,KAAKwC,IAAIwF,EAAMC,KACfO,EAAIR,KACdQ,EAAIR,KAAOpK,EAEX4K,EAAIP,KAAOrK,EAGRyL,CACT,EAEMP,EAAQ,SAACN,EAAkB5K,GAC/B,IAAIlD,EACEuP,EAAWzB,EAAIR,MAAQ,EACvBkC,EAAW1B,EAAIP,MAAQ,EAW7B,OAVW,MAAPrK,EACFlD,EAASsF,KAAKD,IAAIkK,EAAUC,GAEhBlK,KAAKD,IAAIkK,EAAUC,KACnB1B,EAAIR,KACdQ,EAAIR,KAAOpK,EAEX4K,EAAIP,KAAOrK,EAGRlD,CACT,EAEMoP,EAAO,SAACP,EAAoBC,GAChC,OAAAD,EAAS,YAAKC,EAAGC,IAAG,YAAID,EAAGE,QAAU,CAArC,EAEIK,EAAM,SAACR,EAAoBC,GAC/B,OAACD,EAAS,YAAKC,EAAGC,IAAG,YAAID,EAAGE,OAAS,CAArC,EAEIS,EAAiB,SAAC3B,EAAkBgB,GACxC,IAAMvB,EAAOO,EAAIP,MAAQ,EACzBuB,EAAGE,MACCF,EAAGE,KAAOzB,IACZuB,EAAGE,IAAM,EACTF,EAAGC,MAEP,EAEMO,EAAS,SACbjL,EACA8I,EACAkB,EACAC,EACAW,EACAnB,EACAgB,EACAD,GAEA,IAAInH,EACAC,EAGEuH,EAAQD,EAAU5K,EAAK3E,IAC7B,GAAIwP,EACFxH,EAAIwH,EAAMF,IAAMX,EAAYA,EAAY,EAAIlB,EAAM,GAClDxF,EAAIuH,EAAMH,IAAMT,EAAaA,EAAa,EAAInB,EAAM,OAC/C,CAGL,KAAOiC,EAAKP,EAAUC,IACpBW,EAAe3B,EAAKgB,GAGtBpH,EAAIoH,EAAGE,IAAMX,EAAYA,EAAY,EAAIlB,EAAM,GAC/CxF,EAAImH,EAAGC,IAAMT,EAAaA,EAAa,EAAInB,EAAM,GACjDkC,EAAIR,EAAUC,GAEdW,EAAe3B,EAAKgB,E,CAEtBzK,EAAK7E,KAAKkI,EAAIA,EACdrD,EAAK7E,KAAKmI,EAAIA,CAChB,EC5ZA,MAAM,EAAWzM,OAAOC,UAAUuU,SAO3B,SAASC,EAAW3N,GACvB,OAAO,EAASnF,KAAKmF,GAAO4N,SAAS,SACzC,CCPA,SAASvK,EAAIwK,GACX,IAAIxJ,EAAUpI,UAAUZ,OAAS,QAAsBc,IAAjBF,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,IAAK0R,EAAWE,GACd,MAAM,IAAI9T,UAAU,0BAGtB,GAAqB,IAAjB8T,EAAMxS,OACR,MAAM,IAAItB,UAAU,2BAGtB,IAAI+T,EAAqBzJ,EAAQ0J,UAC7BA,OAAmC,IAAvBD,EAAgC,EAAIA,EAChDE,EAAmB3J,EAAQ4J,QAC3BA,OAA+B,IAArBD,EAA8BH,EAAMxS,OAAS2S,EAE3D,GAAID,EAAY,GAAKA,GAAaF,EAAMxS,SAAW6S,OAAOC,UAAUJ,GAClE,MAAM,IAAIjQ,MAAM,4DAGlB,GAAImQ,GAAWF,GAAaE,EAAUJ,EAAMxS,SAAW6S,OAAOC,UAAUF,GACtE,MAAM,IAAInQ,MAAM,iFAKlB,IAFA,IAAIsQ,EAAWP,EAAME,GAEZ5S,EAAI4S,EAAY,EAAG5S,EAAI8S,EAAS9S,IACnC0S,EAAM1S,GAAKiT,IAAUA,EAAWP,EAAM1S,IAG5C,OAAOiT,CACT,CC/BA,SAAStI,EAAI+H,GACX,IAAIxJ,EAAUpI,UAAUZ,OAAS,QAAsBc,IAAjBF,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,IAAK0R,EAAWE,GACd,MAAM,IAAI9T,UAAU,0BAGtB,GAAqB,IAAjB8T,EAAMxS,OACR,MAAM,IAAItB,UAAU,2BAGtB,IAAI+T,EAAqBzJ,EAAQ0J,UAC7BA,OAAmC,IAAvBD,EAAgC,EAAIA,EAChDE,EAAmB3J,EAAQ4J,QAC3BA,OAA+B,IAArBD,EAA8BH,EAAMxS,OAAS2S,EAE3D,GAAID,EAAY,GAAKA,GAAaF,EAAMxS,SAAW6S,OAAOC,UAAUJ,GAClE,MAAM,IAAIjQ,MAAM,4DAGlB,GAAImQ,GAAWF,GAAaE,EAAUJ,EAAMxS,SAAW6S,OAAOC,UAAUF,GACtE,MAAM,IAAInQ,MAAM,iFAKlB,IAFA,IAAIuQ,EAAWR,EAAME,GAEZ5S,EAAI4S,EAAY,EAAG5S,EAAI8S,EAAS9S,IACnC0S,EAAM1S,GAAKkT,IAAUA,EAAWR,EAAM1S,IAG5C,OAAOkT,CACT,CC7BA,SAASC,EAAQT,GACf,IAQIU,EARAlK,EAAUpI,UAAUZ,OAAS,QAAsBc,IAAjBF,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,IAAK0R,EAAWE,GACd,MAAM,IAAI9T,UAAU,0BACf,GAAqB,IAAjB8T,EAAMxS,OACf,MAAM,IAAItB,UAAU,2BAKtB,QAAuBoC,IAAnBkI,EAAQkK,OAAsB,CAChC,IAAKZ,EAAWtJ,EAAQkK,QACtB,MAAM,IAAIxU,UAAU,+CAGtBwU,EAASlK,EAAQkK,MACnB,MACEA,EAAS,IAAIhT,MAAMsS,EAAMxS,QAG3B,IAAImT,EAAa1I,EAAI+H,GACjBY,EAAapL,EAAIwK,GAErB,GAAIW,IAAeC,EACjB,MAAM,IAAIC,WAAW,+EAGvB,IAAIC,EAAetK,EAAQyB,IACvBuI,OAA4B,IAAjBM,EAA0BtK,EAAQuK,WAAaJ,EAAa,EAAIG,EAC3EE,EAAexK,EAAQhB,IACvB+K,OAA4B,IAAjBS,EAA0BxK,EAAQuK,WAAaH,EAAa,EAAII,EAE/E,GAAIR,GAAYD,EACd,MAAM,IAAIM,WAAW,8CAKvB,IAFA,IAAII,GAAUV,EAAWC,IAAaI,EAAaD,GAE1CrT,EAAI,EAAGA,EAAI0S,EAAMxS,OAAQF,IAChCoT,EAAOpT,IAAM0S,EAAM1S,GAAKqT,GAAcM,EAAST,EAGjD,OAAOE,CACT,CChDA,MAAMQ,EAAS,IAAIC,OAAO,GACpBC,EAAa,IAAID,OAAO,GAMvB,SAASE,EAAyB/M,EAAQkC,EAAU,CAAC,GAC1D,MAAM,QACJ8K,EAAU,GAAE,WACZC,EAAa,GAAE,WACfC,EAAa,EAAC,SACdC,EAAW,QACTjL,EACJ,MAAO,GAAGlC,EAAO8F,YAAYtN,WAC7BoU,OACAE,IAOF,SAAqB9M,EAAQgN,EAASC,EAAYC,EAAYC,GAC5D,MAAM,KAAEhE,EAAI,QAAEI,GAAYvJ,EACpBoN,EAAOjM,KAAKwC,IAAIwF,EAAM6D,GACtBK,EAAOlM,KAAKwC,IAAI4F,EAAS0D,GACzBpR,EAAS,GAEf,GAAiB,SAAbsR,EAAqB,CACvBA,GAAW,EACXG,EAAM,IAAK,IAAItU,EAAI,EAAGA,EAAIoU,EAAMpU,IAC9B,IAAK,IAAIkB,EAAI,EAAGA,EAAImT,EAAMnT,IACxB,GAAI8F,EAAOzC,IAAIvE,EAAGkB,GAAK,EAAG,CACxBiT,GAAW,EACX,MAAMG,CACR,CAGN,CAEA,IAAK,IAAItU,EAAI,EAAGA,EAAIoU,EAAMpU,IAAK,CAC7B,IAAIuU,EAAO,GACX,IAAK,IAAIrT,EAAI,EAAGA,EAAImT,EAAMnT,IACxBqT,EAAKvV,KAAKwV,EAAaxN,EAAOzC,IAAIvE,EAAGkB,GAAIgT,EAAYC,IAEvDtR,EAAO7D,KAAK,GAAGuV,EAAKE,KAAK,OAC3B,CAOA,OANIJ,IAAS9D,IACX1N,EAAOA,EAAO3C,OAAS,IAAM,QAAQqQ,EAAU0D,kBAE7CG,IAASjE,GACXtN,EAAO7D,KAAK,OAAOmR,EAAO6D,eAErBnR,EAAO4R,KAAK,KAAKX,IAC1B,CAvCeY,CAAY1N,EAAQgN,EAASC,EAAYC,EAAYC,OAClEP,OACAA,UAAe5M,EAAOmJ,SACtByD,aAAkB5M,EAAOuJ,YAE3B,CAoCA,SAASiE,EAAaG,EAAKT,EAAYC,GACrC,OACEQ,GAAO,GAAKR,EACR,IAAIS,EAAcD,EAAKT,EAAa,KACpCU,EAAcD,EAAKT,IACvBW,OAAOX,EACX,CAEA,SAASU,EAAcD,EAAK9T,GAE1B,IAAIoF,EAAM0O,EAAIpC,WACd,GAAItM,EAAI/F,QAAUW,EAAK,OAAOoF,EAI9B,IAAI6O,EAAMH,EAAII,QAAQlU,GAItB,GAHIiU,EAAI5U,OAASW,IACfiU,EAAMH,EAAII,QAAQ5M,KAAKD,IAAI,EAAGrH,GAAOiU,EAAI5U,OAASW,MAGlDiU,EAAI5U,QAAUW,IACbiU,EAAIE,WAAW,WACfF,EAAIE,WAAW,UAEhB,OAAOF,EAIT,IAAIG,EAAMN,EAAIO,cAAcrU,GAI5B,OAHIoU,EAAI/U,OAASW,IACfoU,EAAMN,EAAIO,cAAc/M,KAAKD,IAAI,EAAGrH,GAAOoU,EAAI/U,OAASW,MAEnDoU,EAAItV,MAAM,EACnB,CCjFO,SAASwV,EAAcnO,EAAQoO,EAAOC,GAC3C,IAAInN,EAAMmN,EAAQrO,EAAOmJ,KAAOnJ,EAAOmJ,KAAO,EAC9C,GAAIiF,EAAQ,GAAKA,EAAQlN,EACvB,MAAM,IAAIqL,WAAW,yBAEzB,CASO,SAAS+B,EAAiBtO,EAAQoO,EAAOC,GAC9C,IAAInN,EAAMmN,EAAQrO,EAAOuJ,QAAUvJ,EAAOuJ,QAAU,EACpD,GAAI6E,EAAQ,GAAKA,EAAQlN,EACvB,MAAM,IAAIqL,WAAW,4BAEzB,CAUO,SAASgC,EAAevO,EAAQwO,GAIrC,GAHIA,EAAOC,YACTD,EAASA,EAAOC,aAEdD,EAAOtV,SAAW8G,EAAOuJ,QAC3B,MAAM,IAAIgD,WACR,yDAGJ,OAAOiC,CACT,CAUO,SAASE,EAAkB1O,EAAQwO,GAIxC,GAHIA,EAAOC,YACTD,EAASA,EAAOC,aAEdD,EAAOtV,SAAW8G,EAAOmJ,KAC3B,MAAM,IAAIoD,WAAW,sDAEvB,OAAOiC,CACT,CA0BO,SAASG,EAAW3O,EAAQ4O,EAAUC,EAAQC,EAAaC,GAChE,GAAyB,IAArBjV,UAAUZ,OACZ,MAAM,IAAIqT,WAAW,wBAMvB,GAJAyC,EAAY,WAAYJ,GACxBI,EAAY,SAAUH,GACtBG,EAAY,cAAeF,GAC3BE,EAAY,YAAaD,GAEvBH,EAAWC,GACXC,EAAcC,GACdH,EAAW,GACXA,GAAY5O,EAAOmJ,MACnB0F,EAAS,GACTA,GAAU7O,EAAOmJ,MACjB2F,EAAc,GACdA,GAAe9O,EAAOuJ,SACtBwF,EAAY,GACZA,GAAa/O,EAAOuJ,QAEpB,MAAM,IAAIgD,WAAW,qCAEzB,CAEO,SAAS0C,EAAS/V,EAAQ2E,EAAQ,GACvC,IAAIqR,EAAQ,GACZ,IAAK,IAAIlW,EAAI,EAAGA,EAAIE,EAAQF,IAC1BkW,EAAMlX,KAAK6F,GAEb,OAAOqR,CACT,CAEA,SAASF,EAAYxW,EAAMqF,GACzB,GAAqB,iBAAVA,EACT,MAAM,IAAIjG,UAAU,GAAGY,qBAE3B,CAEO,SAAS2W,EAAcnP,GAC5B,GAAIA,EAAOoP,UACT,MAAM,IAAIzT,MAAM,wCAEpB,CClGO,MAAM0T,GACXC,mBAAmBC,EAASC,EAAYC,GAEtC,GADaF,EAAUC,IACRC,EAAQvW,OACrB,MAAM,IAAIqT,WAAW,+CAEvB,IAAImD,EAAY,IAAIC,GAAOJ,EAASC,GACpC,IAAK,IAAI5E,EAAM,EAAGA,EAAM2E,EAAS3E,IAC/B,IAAK,IAAIgF,EAAS,EAAGA,EAASJ,EAAYI,IACxCF,EAAUG,IAAIjF,EAAKgF,EAAQH,EAAQ7E,EAAM4E,EAAaI,IAG1D,OAAOF,CACT,CAEAJ,iBAAiBG,GACf,IAAIjB,EAAS,IAAImB,GAAO,EAAGF,EAAQvW,QACnC,IAAK,IAAIF,EAAI,EAAGA,EAAIyW,EAAQvW,OAAQF,IAClCwV,EAAOqB,IAAI,EAAG7W,EAAGyW,EAAQzW,IAE3B,OAAOwV,CACT,CAEAc,oBAAoBG,GAClB,IAAIjB,EAAS,IAAImB,GAAOF,EAAQvW,OAAQ,GACxC,IAAK,IAAIF,EAAI,EAAGA,EAAIyW,EAAQvW,OAAQF,IAClCwV,EAAOqB,IAAI7W,EAAG,EAAGyW,EAAQzW,IAE3B,OAAOwV,CACT,CAEAc,aAAanG,EAAMI,GACjB,OAAO,IAAIoG,GAAOxG,EAAMI,EAC1B,CAEA+F,YAAYnG,EAAMI,GAChB,OAAO,IAAIoG,GAAOxG,EAAMI,GAASuG,KAAK,EACxC,CAEAR,YAAYnG,EAAMI,EAASrH,EAAU,CAAC,GACpC,GAAuB,iBAAZA,EACT,MAAM,IAAItK,UAAU,6BAEtB,MAAM,OAAEmY,EAAS5O,KAAK4O,QAAW7N,EACjC,IAAIlC,EAAS,IAAI2P,GAAOxG,EAAMI,GAC9B,IAAK,IAAIvQ,EAAI,EAAGA,EAAImQ,EAAMnQ,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIqP,EAASrP,IAC3B8F,EAAO6P,IAAI7W,EAAGkB,EAAG6V,KAGrB,OAAO/P,CACT,CAEAsP,eAAenG,EAAMI,EAASrH,EAAU,CAAC,GACvC,GAAuB,iBAAZA,EACT,MAAM,IAAItK,UAAU,6BAEtB,MAAM,IAAE+L,EAAM,EAAC,IAAEzC,EAAM,IAAI,OAAE6O,EAAS5O,KAAK4O,QAAW7N,EACtD,IAAK6J,OAAOC,UAAUrI,GAAM,MAAM,IAAI/L,UAAU,0BAChD,IAAKmU,OAAOC,UAAU9K,GAAM,MAAM,IAAItJ,UAAU,0BAChD,GAAI+L,GAAOzC,EAAK,MAAM,IAAIqL,WAAW,gCACrC,IAAIyD,EAAW9O,EAAMyC,EACjB3D,EAAS,IAAI2P,GAAOxG,EAAMI,GAC9B,IAAK,IAAIvQ,EAAI,EAAGA,EAAImQ,EAAMnQ,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIqP,EAASrP,IAAK,CAChC,IAAI2D,EAAQ8F,EAAMxC,KAAK0I,MAAMkG,IAAWC,GACxChQ,EAAO6P,IAAI7W,EAAGkB,EAAG2D,EACnB,CAEF,OAAOmC,CACT,CAEAsP,WAAWnG,EAAMI,EAAS1L,QACR7D,IAAZuP,IAAuBA,EAAUJ,QACvBnP,IAAV6D,IAAqBA,EAAQ,GACjC,IAAI8F,EAAMxC,KAAKwC,IAAIwF,EAAMI,GACrBvJ,EAASxI,KAAKyY,MAAM9G,EAAMI,GAC9B,IAAK,IAAIvQ,EAAI,EAAGA,EAAI2K,EAAK3K,IACvBgH,EAAO6P,IAAI7W,EAAGA,EAAG6E,GAEnB,OAAOmC,CACT,CAEAsP,YAAYjU,EAAM8N,EAAMI,GACtB,IAAItQ,EAAIoC,EAAKnC,YACAc,IAATmP,IAAoBA,EAAOlQ,QACfe,IAAZuP,IAAuBA,EAAUJ,GACrC,IAAIxF,EAAMxC,KAAKwC,IAAI1K,EAAGkQ,EAAMI,GACxBvJ,EAASxI,KAAKyY,MAAM9G,EAAMI,GAC9B,IAAK,IAAIvQ,EAAI,EAAGA,EAAI2K,EAAK3K,IACvBgH,EAAO6P,IAAI7W,EAAGA,EAAGqC,EAAKrC,IAExB,OAAOgH,CACT,CAEAsP,WAAWY,EAASC,GAClBD,EAAU1Y,KAAK4Y,YAAYF,GAC3BC,EAAU3Y,KAAK4Y,YAAYD,GAC3B,IAAIhH,EAAO+G,EAAQ/G,KACfI,EAAU2G,EAAQ3G,QAClB1N,EAAS,IAAI8T,GAAOxG,EAAMI,GAC9B,IAAK,IAAIvQ,EAAI,EAAGA,EAAImQ,EAAMnQ,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIqP,EAASrP,IAC3B2B,EAAOgU,IAAI7W,EAAGkB,EAAGiH,KAAKwC,IAAIuM,EAAQ3S,IAAIvE,EAAGkB,GAAIiW,EAAQ5S,IAAIvE,EAAGkB,KAGhE,OAAO2B,CACT,CAEAyT,WAAWY,EAASC,GAClBD,EAAU1Y,KAAK4Y,YAAYF,GAC3BC,EAAU3Y,KAAK4Y,YAAYD,GAC3B,IAAIhH,EAAO+G,EAAQ/G,KACfI,EAAU2G,EAAQ3G,QAClB1N,EAAS,IAAIrE,KAAK2R,EAAMI,GAC5B,IAAK,IAAIvQ,EAAI,EAAGA,EAAImQ,EAAMnQ,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIqP,EAASrP,IAC3B2B,EAAOgU,IAAI7W,EAAGkB,EAAGiH,KAAKD,IAAIgP,EAAQ3S,IAAIvE,EAAGkB,GAAIiW,EAAQ5S,IAAIvE,EAAGkB,KAGhE,OAAO2B,CACT,CAEAyT,mBAAmBzR,GACjB,OAAOwR,GAAegB,SAASxS,GAASA,EAAQ,IAAI8R,GAAO9R,EAC7D,CAEAyR,gBAAgBzR,GACd,OAAgB,MAATA,GAAiC,WAAhBA,EAAMyS,KAChC,CAEI7Q,WACF,OAAOjI,KAAK2R,KAAO3R,KAAK+R,OAC1B,CAEAtP,MAAMsW,GACJ,GAAwB,mBAAbA,EACT,MAAM,IAAI3Y,UAAU,+BAEtB,IAAK,IAAIoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChCqW,EAAS7X,KAAKlB,KAAMwB,EAAGkB,GAG3B,OAAO1C,IACT,CAEAiX,YACE,IAAIS,EAAQ,GACZ,IAAK,IAAIlW,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChCgV,EAAMlX,KAAKR,KAAK+F,IAAIvE,EAAGkB,IAG3B,OAAOgV,CACT,CAEAsB,YACE,IAAIC,EAAO,GACX,IAAK,IAAIzX,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAAK,CAClCyX,EAAKzY,KAAK,IACV,IAAK,IAAIkC,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChCuW,EAAKzX,GAAGhB,KAAKR,KAAK+F,IAAIvE,EAAGkB,GAE7B,CACA,OAAOuW,CACT,CAEAC,SACE,OAAOlZ,KAAKgZ,WACd,CAEAG,cACE,OAAqB,IAAdnZ,KAAK2R,IACd,CAEAyH,iBACE,OAAwB,IAAjBpZ,KAAK+R,OACd,CAEAsH,WACE,OAAqB,IAAdrZ,KAAK2R,MAA+B,IAAjB3R,KAAK+R,OACjC,CAEAuH,WACE,OAAOtZ,KAAK2R,OAAS3R,KAAK+R,OAC5B,CAEA6F,UACE,OAAqB,IAAd5X,KAAK2R,MAA+B,IAAjB3R,KAAK+R,OACjC,CAEAwH,cACE,GAAIvZ,KAAKsZ,WAAY,CACnB,IAAK,IAAI9X,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,GAAKlB,EAAGkB,IACtB,GAAI1C,KAAK+F,IAAIvE,EAAGkB,KAAO1C,KAAK+F,IAAIrD,EAAGlB,GACjC,OAAO,EAIb,OAAO,CACT,CACA,OAAO,CACT,CAEAgY,gBACE,IAAIhY,EAAI,EACJkB,EAAI,EACJ+W,GAAkB,EAClBD,GAAgB,EAChBE,GAAU,EACd,KAAOlY,EAAIxB,KAAK2R,MAAQ6H,GAAe,CAGrC,IAFA9W,EAAI,EACJgX,GAAU,EACHhX,EAAI1C,KAAK+R,UAAuB,IAAZ2H,GACF,IAAnB1Z,KAAK+F,IAAIvE,EAAGkB,GACdA,IAC4B,IAAnB1C,KAAK+F,IAAIvE,EAAGkB,IAAYA,EAAI+W,GACrCC,GAAU,EACVD,EAAiB/W,IAEjB8W,GAAgB,EAChBE,GAAU,GAGdlY,GACF,CACA,OAAOgY,CACT,CAEAG,uBACE,IAAInY,EAAI,EACJkB,EAAI,EACJ+W,GAAkB,EAClBE,GAAuB,EACvBD,GAAU,EACd,KAAOlY,EAAIxB,KAAK2R,MAAQgI,GAAsB,CAG5C,IAFAjX,EAAI,EACJgX,GAAU,EACHhX,EAAI1C,KAAK+R,UAAuB,IAAZ2H,GACF,IAAnB1Z,KAAK+F,IAAIvE,EAAGkB,GACdA,IAC4B,IAAnB1C,KAAK+F,IAAIvE,EAAGkB,IAAYA,EAAI+W,GACrCC,GAAU,EACVD,EAAiB/W,IAEjBiX,GAAuB,EACvBD,GAAU,GAGd,IAAK,IAAIvR,EAAIzF,EAAI,EAAGyF,EAAInI,KAAK2R,KAAMxJ,IACV,IAAnBnI,KAAK+F,IAAIvE,EAAG2G,KACdwR,GAAuB,GAG3BnY,GACF,CACA,OAAOmY,CACT,CAEAC,cACE,IAAIvV,EAASrE,KAAKgJ,QACdiK,EAAI,EACJ9K,EAAI,EACR,KAAO8K,EAAI5O,EAAOsN,MAAQxJ,EAAI9D,EAAO0N,SAAS,CAC5C,IAAI8H,EAAO5G,EACX,IAAK,IAAIzR,EAAIyR,EAAGzR,EAAI6C,EAAOsN,KAAMnQ,IAC3B6C,EAAO0B,IAAIvE,EAAG2G,GAAK9D,EAAO0B,IAAI8T,EAAM1R,KACtC0R,EAAOrY,GAGX,GAA4B,IAAxB6C,EAAO0B,IAAI8T,EAAM1R,GACnBA,QACK,CACL9D,EAAOyV,SAAS7G,EAAG4G,GACnB,IAAIE,EAAM1V,EAAO0B,IAAIkN,EAAG9K,GACxB,IAAK,IAAIzF,EAAIyF,EAAGzF,EAAI2B,EAAO0N,QAASrP,IAClC2B,EAAOgU,IAAIpF,EAAGvQ,EAAG2B,EAAO0B,IAAIkN,EAAGvQ,GAAKqX,GAEtC,IAAK,IAAIvY,EAAIyR,EAAI,EAAGzR,EAAI6C,EAAOsN,KAAMnQ,IAAK,CACxC,IAAI2T,EAAS9Q,EAAO0B,IAAIvE,EAAG2G,GAAK9D,EAAO0B,IAAIkN,EAAG9K,GAC9C9D,EAAOgU,IAAI7W,EAAG2G,EAAG,GACjB,IAAK,IAAIzF,EAAIyF,EAAI,EAAGzF,EAAI2B,EAAO0N,QAASrP,IACtC2B,EAAOgU,IAAI7W,EAAGkB,EAAG2B,EAAO0B,IAAIvE,EAAGkB,GAAK2B,EAAO0B,IAAIkN,EAAGvQ,GAAKyS,EAE3D,CACAlC,IACA9K,GACF,CACF,CACA,OAAO9D,CACT,CAEA2V,qBACE,IAAI3V,EAASrE,KAAK4Z,cACd/S,EAAIxC,EAAO0N,QACXxM,EAAIlB,EAAOsN,KACXsB,EAAI1N,EAAI,EACZ,KAAO0N,GAAK,GACV,GAAyB,IAArB5O,EAAO4V,OAAOhH,GAChBA,QACK,CACL,IAAIzM,EAAI,EACJ0T,GAAQ,EACZ,KAAO1T,EAAIjB,IAAe,IAAV2U,GACW,IAArB7V,EAAO0B,IAAIkN,EAAGzM,GAChB0T,GAAQ,EAER1T,IAGJ,IAAK,IAAIhF,EAAI,EAAGA,EAAIyR,EAAGzR,IAAK,CAC1B,IAAI2T,EAAS9Q,EAAO0B,IAAIvE,EAAGgF,GAC3B,IAAK,IAAI9D,EAAI8D,EAAG9D,EAAImE,EAAGnE,IAAK,CAC1B,IAAIqX,EAAM1V,EAAO0B,IAAIvE,EAAGkB,GAAKyS,EAAS9Q,EAAO0B,IAAIkN,EAAGvQ,GACpD2B,EAAOgU,IAAI7W,EAAGkB,EAAGqX,EACnB,CACF,CACA9G,GACF,CAEF,OAAO5O,CACT,CAEAgU,MACE,MAAM,IAAIlU,MAAM,8BAClB,CAEA4B,MACE,MAAM,IAAI5B,MAAM,8BAClB,CAEAkR,OAAO3K,EAAU,CAAC,GAChB,GAAuB,iBAAZA,EACT,MAAM,IAAItK,UAAU,6BAEtB,MAAM,KAAEuR,EAAO,EAAC,QAAEI,EAAU,GAAMrH,EAClC,IAAK6J,OAAOC,UAAU7C,IAASA,GAAQ,EACrC,MAAM,IAAIvR,UAAU,mCAEtB,IAAKmU,OAAOC,UAAUzC,IAAYA,GAAW,EAC3C,MAAM,IAAI3R,UAAU,sCAEtB,IAAIoI,EAAS,IAAI2P,GAAOnY,KAAK2R,KAAOA,EAAM3R,KAAK+R,QAAUA,GACzD,IAAK,IAAIvQ,EAAI,EAAGA,EAAImQ,EAAMnQ,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIqP,EAASrP,IAC3B8F,EAAO2R,aAAana,KAAMA,KAAK2R,KAAOnQ,EAAGxB,KAAK+R,QAAUrP,GAG5D,OAAO8F,CACT,CAEA8P,KAAKjS,GACH,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG2D,GAGnB,OAAOrG,IACT,CAEAoa,MACE,OAAOpa,KAAKqa,MAAM,EACpB,CAEAC,OAAO1D,GACLD,EAAc3W,KAAM4W,GACpB,IAAIxD,EAAM,GACV,IAAK,IAAI5R,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAChC4R,EAAI5S,KAAKR,KAAK+F,IAAI6Q,EAAOpV,IAE3B,OAAO4R,CACT,CAEAmH,aAAa3D,GACX,OAAOuB,GAAOqC,UAAUxa,KAAKsa,OAAO1D,GACtC,CAEA6D,OAAO7D,EAAOc,GACZf,EAAc3W,KAAM4W,GACpBc,EAAQX,EAAe/W,KAAM0X,GAC7B,IAAK,IAAIlW,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAChCxB,KAAKqY,IAAIzB,EAAOpV,EAAGkW,EAAMlW,IAE3B,OAAOxB,IACT,CAEA8Z,SAASY,EAAMC,GACbhE,EAAc3W,KAAM0a,GACpB/D,EAAc3W,KAAM2a,GACpB,IAAK,IAAInZ,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAAK,CACrC,IAAIoZ,EAAO5a,KAAK+F,IAAI2U,EAAMlZ,GAC1BxB,KAAKqY,IAAIqC,EAAMlZ,EAAGxB,KAAK+F,IAAI4U,EAAMnZ,IACjCxB,KAAKqY,IAAIsC,EAAMnZ,EAAGoZ,EACpB,CACA,OAAO5a,IACT,CAEA6a,UAAUjE,GACRE,EAAiB9W,KAAM4W,GACvB,IAAIwB,EAAS,GACb,IAAK,IAAI5W,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B4W,EAAO5X,KAAKR,KAAK+F,IAAIvE,EAAGoV,IAE1B,OAAOwB,CACT,CAEA0C,gBAAgBlE,GACd,OAAOuB,GAAO4C,aAAa/a,KAAK6a,UAAUjE,GAC5C,CAEAoE,UAAUpE,EAAOc,GACfZ,EAAiB9W,KAAM4W,GACvBc,EAAQR,EAAkBlX,KAAM0X,GAChC,IAAK,IAAIlW,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7BxB,KAAKqY,IAAI7W,EAAGoV,EAAOc,EAAMlW,IAE3B,OAAOxB,IACT,CAEAib,YAAYC,EAASC,GACnBrE,EAAiB9W,KAAMkb,GACvBpE,EAAiB9W,KAAMmb,GACvB,IAAK,IAAI3Z,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAAK,CAClC,IAAIoZ,EAAO5a,KAAK+F,IAAIvE,EAAG0Z,GACvBlb,KAAKqY,IAAI7W,EAAG0Z,EAASlb,KAAK+F,IAAIvE,EAAG2Z,IACjCnb,KAAKqY,IAAI7W,EAAG2Z,EAASP,EACvB,CACA,OAAO5a,IACT,CAEAob,aAAapE,GACXA,EAASD,EAAe/W,KAAMgX,GAC9B,IAAK,IAAIxV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAKsU,EAAOtU,IAG3C,OAAO1C,IACT,CAEAqb,aAAarE,GACXA,EAASD,EAAe/W,KAAMgX,GAC9B,IAAK,IAAIxV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAKsU,EAAOtU,IAG3C,OAAO1C,IACT,CAEAsb,aAAatE,GACXA,EAASD,EAAe/W,KAAMgX,GAC9B,IAAK,IAAIxV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAKsU,EAAOtU,IAG3C,OAAO1C,IACT,CAEAub,aAAavE,GACXA,EAASD,EAAe/W,KAAMgX,GAC9B,IAAK,IAAIxV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAKsU,EAAOtU,IAG3C,OAAO1C,IACT,CAEAwb,gBAAgBxE,GACdA,EAASE,EAAkBlX,KAAMgX,GACjC,IAAK,IAAIxV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAKsU,EAAOxV,IAG3C,OAAOxB,IACT,CAEAyb,gBAAgBzE,GACdA,EAASE,EAAkBlX,KAAMgX,GACjC,IAAK,IAAIxV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAKsU,EAAOxV,IAG3C,OAAOxB,IACT,CAEA0b,gBAAgB1E,GACdA,EAASE,EAAkBlX,KAAMgX,GACjC,IAAK,IAAIxV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAKsU,EAAOxV,IAG3C,OAAOxB,IACT,CAEA2b,gBAAgB3E,GACdA,EAASE,EAAkBlX,KAAMgX,GACjC,IAAK,IAAIxV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAKsU,EAAOxV,IAG3C,OAAOxB,IACT,CAEA4b,OAAOhF,EAAOvQ,GACZsQ,EAAc3W,KAAM4W,GACpB,IAAK,IAAIpV,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAChCxB,KAAKqY,IAAIzB,EAAOpV,EAAGxB,KAAK+F,IAAI6Q,EAAOpV,GAAK6E,GAE1C,OAAOrG,IACT,CAEA6b,UAAUjF,EAAOvQ,GACfyQ,EAAiB9W,KAAM4W,GACvB,IAAK,IAAIpV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7BxB,KAAKqY,IAAI7W,EAAGoV,EAAO5W,KAAK+F,IAAIvE,EAAGoV,GAASvQ,GAE1C,OAAOrG,IACT,CAEA0J,IAAIoS,GACF,GAAI9b,KAAK4X,UACP,OAAOmE,IAET,OAAQD,GACN,IAAK,MAAO,CACV,MAAMpS,EAAM,IAAI9H,MAAM5B,KAAK2R,MAAM2G,KAAK/D,OAAOyH,mBAC7C,IAAK,IAAI5I,EAAM,EAAGA,EAAMpT,KAAK2R,KAAMyB,IACjC,IAAK,IAAIgF,EAAS,EAAGA,EAASpY,KAAK+R,QAASqG,IACtCpY,KAAK+F,IAAIqN,EAAKgF,GAAU1O,EAAI0J,KAC9B1J,EAAI0J,GAAOpT,KAAK+F,IAAIqN,EAAKgF,IAI/B,OAAO1O,CACT,CACA,IAAK,SAAU,CACb,MAAMA,EAAM,IAAI9H,MAAM5B,KAAK+R,SAASuG,KAAK/D,OAAOyH,mBAChD,IAAK,IAAI5I,EAAM,EAAGA,EAAMpT,KAAK2R,KAAMyB,IACjC,IAAK,IAAIgF,EAAS,EAAGA,EAASpY,KAAK+R,QAASqG,IACtCpY,KAAK+F,IAAIqN,EAAKgF,GAAU1O,EAAI0O,KAC9B1O,EAAI0O,GAAUpY,KAAK+F,IAAIqN,EAAKgF,IAIlC,OAAO1O,CACT,CACA,UAAKlH,EAAW,CACd,IAAIkH,EAAM1J,KAAK+F,IAAI,EAAG,GACtB,IAAK,IAAIqN,EAAM,EAAGA,EAAMpT,KAAK2R,KAAMyB,IACjC,IAAK,IAAIgF,EAAS,EAAGA,EAASpY,KAAK+R,QAASqG,IACtCpY,KAAK+F,IAAIqN,EAAKgF,GAAU1O,IAC1BA,EAAM1J,KAAK+F,IAAIqN,EAAKgF,IAI1B,OAAO1O,CACT,CACA,QACE,MAAM,IAAIvF,MAAM,mBAAmB2X,KAEzC,CAEAG,WACEtE,EAAc3X,MACd,IAAImJ,EAAInJ,KAAK+F,IAAI,EAAG,GAChBmW,EAAM,CAAC,EAAG,GACd,IAAK,IAAI1a,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAC5B1C,KAAK+F,IAAIvE,EAAGkB,GAAKyG,IACnBA,EAAInJ,KAAK+F,IAAIvE,EAAGkB,GAChBwZ,EAAI,GAAK1a,EACT0a,EAAI,GAAKxZ,GAIf,OAAOwZ,CACT,CAEA/P,IAAI2P,GACF,GAAI9b,KAAK4X,UACP,OAAOmE,IAGT,OAAQD,GACN,IAAK,MAAO,CACV,MAAM3P,EAAM,IAAIvK,MAAM5B,KAAK2R,MAAM2G,KAAK/D,OAAO4H,mBAC7C,IAAK,IAAI/I,EAAM,EAAGA,EAAMpT,KAAK2R,KAAMyB,IACjC,IAAK,IAAIgF,EAAS,EAAGA,EAASpY,KAAK+R,QAASqG,IACtCpY,KAAK+F,IAAIqN,EAAKgF,GAAUjM,EAAIiH,KAC9BjH,EAAIiH,GAAOpT,KAAK+F,IAAIqN,EAAKgF,IAI/B,OAAOjM,CACT,CACA,IAAK,SAAU,CACb,MAAMA,EAAM,IAAIvK,MAAM5B,KAAK+R,SAASuG,KAAK/D,OAAO4H,mBAChD,IAAK,IAAI/I,EAAM,EAAGA,EAAMpT,KAAK2R,KAAMyB,IACjC,IAAK,IAAIgF,EAAS,EAAGA,EAASpY,KAAK+R,QAASqG,IACtCpY,KAAK+F,IAAIqN,EAAKgF,GAAUjM,EAAIiM,KAC9BjM,EAAIiM,GAAUpY,KAAK+F,IAAIqN,EAAKgF,IAIlC,OAAOjM,CACT,CACA,UAAK3J,EAAW,CACd,IAAI2J,EAAMnM,KAAK+F,IAAI,EAAG,GACtB,IAAK,IAAIqN,EAAM,EAAGA,EAAMpT,KAAK2R,KAAMyB,IACjC,IAAK,IAAIgF,EAAS,EAAGA,EAASpY,KAAK+R,QAASqG,IACtCpY,KAAK+F,IAAIqN,EAAKgF,GAAUjM,IAC1BA,EAAMnM,KAAK+F,IAAIqN,EAAKgF,IAI1B,OAAOjM,CACT,CACA,QACE,MAAM,IAAIhI,MAAM,mBAAmB2X,KAEzC,CAEAM,WACEzE,EAAc3X,MACd,IAAImJ,EAAInJ,KAAK+F,IAAI,EAAG,GAChBmW,EAAM,CAAC,EAAG,GACd,IAAK,IAAI1a,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAC5B1C,KAAK+F,IAAIvE,EAAGkB,GAAKyG,IACnBA,EAAInJ,KAAK+F,IAAIvE,EAAGkB,GAChBwZ,EAAI,GAAK1a,EACT0a,EAAI,GAAKxZ,GAIf,OAAOwZ,CACT,CAEAjC,OAAO7G,GAEL,GADAuD,EAAc3W,KAAMoT,GAChBpT,KAAK4X,UACP,OAAOmE,IAET,IAAI5S,EAAInJ,KAAK+F,IAAIqN,EAAK,GACtB,IAAK,IAAI5R,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAC5BxB,KAAK+F,IAAIqN,EAAK5R,GAAK2H,IACrBA,EAAInJ,KAAK+F,IAAIqN,EAAK5R,IAGtB,OAAO2H,CACT,CAEAkT,YAAYjJ,GACVuD,EAAc3W,KAAMoT,GACpBuE,EAAc3X,MACd,IAAImJ,EAAInJ,KAAK+F,IAAIqN,EAAK,GAClB8I,EAAM,CAAC9I,EAAK,GAChB,IAAK,IAAI5R,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAC5BxB,KAAK+F,IAAIqN,EAAK5R,GAAK2H,IACrBA,EAAInJ,KAAK+F,IAAIqN,EAAK5R,GAClB0a,EAAI,GAAK1a,GAGb,OAAO0a,CACT,CAEAI,OAAOlJ,GAEL,GADAuD,EAAc3W,KAAMoT,GAChBpT,KAAK4X,UACP,OAAOmE,IAET,IAAI5S,EAAInJ,KAAK+F,IAAIqN,EAAK,GACtB,IAAK,IAAI5R,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAC5BxB,KAAK+F,IAAIqN,EAAK5R,GAAK2H,IACrBA,EAAInJ,KAAK+F,IAAIqN,EAAK5R,IAGtB,OAAO2H,CACT,CAEAoT,YAAYnJ,GACVuD,EAAc3W,KAAMoT,GACpBuE,EAAc3X,MACd,IAAImJ,EAAInJ,KAAK+F,IAAIqN,EAAK,GAClB8I,EAAM,CAAC9I,EAAK,GAChB,IAAK,IAAI5R,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAC5BxB,KAAK+F,IAAIqN,EAAK5R,GAAK2H,IACrBA,EAAInJ,KAAK+F,IAAIqN,EAAK5R,GAClB0a,EAAI,GAAK1a,GAGb,OAAO0a,CACT,CAEAM,UAAUpE,GAER,GADAtB,EAAiB9W,KAAMoY,GACnBpY,KAAK4X,UACP,OAAOmE,IAET,IAAI5S,EAAInJ,KAAK+F,IAAI,EAAGqS,GACpB,IAAK,IAAI5W,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IACzBxB,KAAK+F,IAAIvE,EAAG4W,GAAUjP,IACxBA,EAAInJ,KAAK+F,IAAIvE,EAAG4W,IAGpB,OAAOjP,CACT,CAEAsT,eAAerE,GACbtB,EAAiB9W,KAAMoY,GACvBT,EAAc3X,MACd,IAAImJ,EAAInJ,KAAK+F,IAAI,EAAGqS,GAChB8D,EAAM,CAAC,EAAG9D,GACd,IAAK,IAAI5W,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IACzBxB,KAAK+F,IAAIvE,EAAG4W,GAAUjP,IACxBA,EAAInJ,KAAK+F,IAAIvE,EAAG4W,GAChB8D,EAAI,GAAK1a,GAGb,OAAO0a,CACT,CAEAQ,UAAUtE,GAER,GADAtB,EAAiB9W,KAAMoY,GACnBpY,KAAK4X,UACP,OAAOmE,IAET,IAAI5S,EAAInJ,KAAK+F,IAAI,EAAGqS,GACpB,IAAK,IAAI5W,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IACzBxB,KAAK+F,IAAIvE,EAAG4W,GAAUjP,IACxBA,EAAInJ,KAAK+F,IAAIvE,EAAG4W,IAGpB,OAAOjP,CACT,CAEAwT,eAAevE,GACbtB,EAAiB9W,KAAMoY,GACvBT,EAAc3X,MACd,IAAImJ,EAAInJ,KAAK+F,IAAI,EAAGqS,GAChB8D,EAAM,CAAC,EAAG9D,GACd,IAAK,IAAI5W,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IACzBxB,KAAK+F,IAAIvE,EAAG4W,GAAUjP,IACxBA,EAAInJ,KAAK+F,IAAIvE,EAAG4W,GAChB8D,EAAI,GAAK1a,GAGb,OAAO0a,CACT,CAEAU,OACE,IAAIzQ,EAAMxC,KAAKwC,IAAInM,KAAK2R,KAAM3R,KAAK+R,SAC/B6K,EAAO,GACX,IAAK,IAAIpb,EAAI,EAAGA,EAAI2K,EAAK3K,IACvBob,EAAKpc,KAAKR,KAAK+F,IAAIvE,EAAGA,IAExB,OAAOob,CACT,CAEAC,KAAK/Y,EAAO,aACV,IAAIO,EAAS,EACb,GAAa,QAATP,EACF,OAAO9D,KAAK0J,MACP,GAAa,cAAT5F,EAAsB,CAC/B,IAAK,IAAItC,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC2B,GAAkBrE,KAAK+F,IAAIvE,EAAGkB,GAAK1C,KAAK+F,IAAIvE,EAAGkB,GAGnD,OAAOiH,KAAKyH,KAAK/M,EACnB,CACE,MAAM,IAAI0Q,WAAW,sBAAsBjR,IAE/C,CAEAgZ,gBACE,IAAIC,EAAM,EACV,IAAK,IAAIvb,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChCqa,GAAO/c,KAAK+F,IAAIvE,EAAGkB,GACnB1C,KAAKqY,IAAI7W,EAAGkB,EAAGqa,GAGnB,OAAO/c,IACT,CAEAgd,IAAIC,GACEpF,GAAegB,SAASoE,KAAUA,EAAUA,EAAQhG,aACxD,IAAIiG,EAAUld,KAAKiX,YACnB,GAAIiG,EAAQxb,SAAWub,EAAQvb,OAC7B,MAAM,IAAIqT,WAAW,qCAEvB,IAAIiI,EAAM,EACV,IAAK,IAAIxb,EAAI,EAAGA,EAAI0b,EAAQxb,OAAQF,IAClCwb,GAAOE,EAAQ1b,GAAKyb,EAAQzb,GAE9B,OAAOwb,CACT,CAEAG,KAAKC,GACHA,EAAQjF,GAAOS,YAAYwE,GAE3B,IAAIvW,EAAI7G,KAAK2R,KACTpM,EAAIvF,KAAK+R,QACTvL,EAAI4W,EAAMrL,QAEV1N,EAAS,IAAI8T,GAAOtR,EAAGL,GAEvB6W,EAAQ,IAAIC,aAAa/X,GAC7B,IAAK,IAAI7C,EAAI,EAAGA,EAAI8D,EAAG9D,IAAK,CAC1B,IAAK,IAAIyF,EAAI,EAAGA,EAAI5C,EAAG4C,IACrBkV,EAAMlV,GAAKiV,EAAMrX,IAAIoC,EAAGzF,GAG1B,IAAK,IAAIlB,EAAI,EAAGA,EAAIqF,EAAGrF,IAAK,CAC1B,IAAImF,EAAI,EACR,IAAK,IAAIwB,EAAI,EAAGA,EAAI5C,EAAG4C,IACrBxB,GAAK3G,KAAK+F,IAAIvE,EAAG2G,GAAKkV,EAAMlV,GAG9B9D,EAAOgU,IAAI7W,EAAGkB,EAAGiE,EACnB,CACF,CACA,OAAOtC,CACT,CAEAkZ,YAAYH,GACVA,EAAQjF,GAAOS,YAAYwE,GAC3B,IAAI/Y,EAAS,IAAI8T,GAAO,EAAG,GAC3B,MAAMqF,EAAMxd,KAAK+F,IAAI,EAAG,GAClB0X,EAAML,EAAMrX,IAAI,EAAG,GACnB2X,EAAM1d,KAAK+F,IAAI,EAAG,GAClB4X,EAAMP,EAAMrX,IAAI,EAAG,GACnB6X,EAAM5d,KAAK+F,IAAI,EAAG,GAClB8X,EAAMT,EAAMrX,IAAI,EAAG,GACnB+X,EAAM9d,KAAK+F,IAAI,EAAG,GAClBgY,EAAMX,EAAMrX,IAAI,EAAG,GAGnBiY,GAAMR,EAAMM,IAAQL,EAAMM,GAC1BE,GAAML,EAAME,GAAOL,EACnBS,EAAKV,GAAOG,EAAMI,GAClBI,EAAKL,GAAOD,EAAMJ,GAClBW,GAAMZ,EAAME,GAAOK,EAKnBM,EAAML,EAAKG,EAAKC,GAHVV,EAAMI,IAAQD,EAAME,GAI1BO,EAAMJ,EAAKE,EACXG,EAAMN,EAAKE,EACXK,EAAMR,EAAKC,EAAKC,GAPVN,EAAMJ,IAAQC,EAAME,GAahC,OAJAtZ,EAAOgU,IAAI,EAAG,EAAGgG,GACjBha,EAAOgU,IAAI,EAAG,EAAGiG,GACjBja,EAAOgU,IAAI,EAAG,EAAGkG,GACjBla,EAAOgU,IAAI,EAAG,EAAGmG,GACVna,CACT,CAEAoa,YAAYrB,GACVA,EAAQjF,GAAOS,YAAYwE,GAC3B,IAAI/Y,EAAS,IAAI8T,GAAO,EAAG,GAE3B,MAAMuG,EAAM1e,KAAK+F,IAAI,EAAG,GAClB4Y,EAAM3e,KAAK+F,IAAI,EAAG,GAClB6Y,EAAM5e,KAAK+F,IAAI,EAAG,GAClB8Y,EAAM7e,KAAK+F,IAAI,EAAG,GAClByX,EAAMxd,KAAK+F,IAAI,EAAG,GAClB2X,EAAM1d,KAAK+F,IAAI,EAAG,GAClB+Y,EAAM9e,KAAK+F,IAAI,EAAG,GAClB6X,EAAM5d,KAAK+F,IAAI,EAAG,GAClB+X,EAAM9d,KAAK+F,IAAI,EAAG,GAElBgZ,EAAM3B,EAAMrX,IAAI,EAAG,GACnBiZ,EAAM5B,EAAMrX,IAAI,EAAG,GACnBkZ,EAAM7B,EAAMrX,IAAI,EAAG,GACnBmZ,EAAM9B,EAAMrX,IAAI,EAAG,GACnB0X,EAAML,EAAMrX,IAAI,EAAG,GACnB4X,EAAMP,EAAMrX,IAAI,EAAG,GACnBoZ,EAAM/B,EAAMrX,IAAI,EAAG,GACnB8X,EAAMT,EAAMrX,IAAI,EAAG,GACnBgY,EAAMX,EAAMrX,IAAI,EAAG,GAGnBkY,GAAMS,EAAMG,KAASG,EAAMvB,GAE3BU,IAAOO,EAAMG,EAAMrB,IAAQuB,EAAMC,EAAMvB,GACvCW,GAAMS,EAAMrB,KAASuB,EAAMC,GAC3BI,EAAKV,EAAMK,EACXM,IAAOX,EAAMI,EAAMlB,IAAQmB,EAAME,EAAMtB,GACvC2B,IAAOZ,EAAMI,IAAQG,EAAMtB,GAC3B4B,GAAMT,EAAMlB,KAASmB,EAAME,GAG3BO,IAAQZ,EAAMhB,EAAME,IAAQL,EAAM0B,EAAMtB,GACxC4B,GAAOb,EAAMd,IAAQL,EAAMI,GAC3B6B,EAAMd,EAAMO,EACZQ,GAAO/B,EAAME,KAASqB,EAAMtB,GAC5B+B,IAAQhB,EAAMpB,EAAME,IAAQC,EAAMwB,EAAMpB,GACxC8B,GAAOjB,EAAMlB,IAAQC,EAAMI,GAC3B+B,GAAOtC,EAAME,KAASyB,EAAMpB,GAO5BM,EAAMe,EAAKM,EANLf,EAAMO,EAOZZ,GAzBMI,EAAMC,EAAMC,EAAMC,EAAMrB,EAAMI,EAAME,GAAOL,EAyBtCU,EAAKC,EAAKgB,EAAKI,EAAME,EAAMC,EACtCI,EAAMX,EAAKC,EAAKE,GAjBTb,EAAMC,EAAMC,EAAMpB,EAAME,EAAMoB,EAAMlB,GAAOD,EAiBvB+B,EAAME,EAAME,EACvCvB,EAAMN,EAzBDT,IAAQuB,EAAMC,EAAME,EAAMzB,EAAME,EAAMwB,EAAMpB,GAyBjCI,EAAKiB,EAAKM,EAAME,EAAMC,EACtCrB,EAAMP,EAAKE,EAAKC,EAAKgB,EATf1B,EAAMG,EAUZmC,EAAMN,EAAME,EAAMC,EAAMC,EATlBjB,EAAMI,EAUZgB,EAAMb,EAAKC,EAAKC,EApBV1B,IAAQmB,EAAME,EAAMC,EAAMzB,EAAME,EAAMwB,EAAMtB,GAoBvB2B,EAAMC,EAAMC,EACvCQ,EAAMV,EAAMC,EAAMC,EAAMC,EAVlBb,EAAME,EAWZmB,EAAMf,EAAKC,EAAKC,EAAKC,EAVfzB,EAAMC,EAqBlB,OATA1Z,EAAOgU,IAAI,EAAG,EAAGgG,GACjBha,EAAOgU,IAAI,EAAG,EAAGiG,GACjBja,EAAOgU,IAAI,EAAG,EAAG0H,GACjB1b,EAAOgU,IAAI,EAAG,EAAGkG,GACjBla,EAAOgU,IAAI,EAAG,EAAGmG,GACjBna,EAAOgU,IAAI,EAAG,EAAG2H,GACjB3b,EAAOgU,IAAI,EAAG,EAAG4H,GACjB5b,EAAOgU,IAAI,EAAG,EAAG6H,GACjB7b,EAAOgU,IAAI,EAAG,EAAG8H,GACV9b,CACT,CAEA+b,aAAapU,GACXA,EAAImM,GAAOS,YAAY5M,GACvB,IAAID,EAAI/L,KAAKgJ,QACTqX,EAAKtU,EAAE4F,KACP2O,EAAKvU,EAAEgG,QACPwO,EAAKvU,EAAE2F,KACP6O,EAAKxU,EAAE+F,QAUX,SAAS0O,EAAMC,EAAK/O,EAAMC,GACxB,IAAI1L,EAAIwa,EAAI/O,KACRnO,EAAIkd,EAAI3O,QACZ,GAAI7L,IAAMyL,GAAQnO,IAAMoO,EACtB,OAAO8O,EACF,CACL,IAAIC,EAAW9I,GAAeY,MAAM9G,EAAMC,GAE1C,OADA+O,EAAWA,EAASxG,aAAauG,EAAK,EAAG,GAClCC,CACT,CACF,CAnBIL,IAAOC,GAETK,QAAQC,KACN,eAAeR,OAAQC,SAAUC,OAAQC,sCAsB7C,IAAIta,EAAIyD,KAAKD,IAAI2W,EAAIE,GACjB/c,EAAImG,KAAKD,IAAI4W,EAAIE,GAiFrB,OAhFAzU,EAAI0U,EAAM1U,EAAG7F,EAAG1C,GAIhB,SAASsd,EAAU/b,EAAGC,EAAG2M,EAAMC,GAE7B,GAAID,GAAQ,KAAOC,GAAQ,IACzB,OAAO7M,EAAEoY,KAAKnY,GAIZ2M,EAAO,GAAM,GAAKC,EAAO,GAAM,GACjC7M,EAAI0b,EAAM1b,EAAG4M,EAAO,EAAGC,EAAO,GAC9B5M,EAAIyb,EAAMzb,EAAG2M,EAAO,EAAGC,EAAO,IACrBD,EAAO,GAAM,GACtB5M,EAAI0b,EAAM1b,EAAG4M,EAAO,EAAGC,GACvB5M,EAAIyb,EAAMzb,EAAG2M,EAAO,EAAGC,IACdA,EAAO,GAAM,IACtB7M,EAAI0b,EAAM1b,EAAG4M,EAAMC,EAAO,GAC1B5M,EAAIyb,EAAMzb,EAAG2M,EAAMC,EAAO,IAG5B,IAAImP,EAAWC,SAASjc,EAAE4M,KAAO,EAAG,IAChCsP,EAAWD,SAASjc,EAAEgN,QAAU,EAAG,IAEnCyL,EAAMzY,EAAEmc,UAAU,EAAGH,EAAW,EAAG,EAAGE,EAAW,GACjDxD,EAAMzY,EAAEkc,UAAU,EAAGH,EAAW,EAAG,EAAGE,EAAW,GAEjDvD,EAAM3Y,EAAEmc,UAAU,EAAGH,EAAW,EAAGE,EAAUlc,EAAEgN,QAAU,GACzD4L,EAAM3Y,EAAEkc,UAAU,EAAGH,EAAW,EAAGE,EAAUjc,EAAE+M,QAAU,GAEzD6L,EAAM7Y,EAAEmc,UAAUH,EAAUhc,EAAE4M,KAAO,EAAG,EAAGsP,EAAW,GACtDpD,EAAM7Y,EAAEkc,UAAUH,EAAU/b,EAAE2M,KAAO,EAAG,EAAGsP,EAAW,GAEtDnD,EAAM/Y,EAAEmc,UAAUH,EAAUhc,EAAE4M,KAAO,EAAGsP,EAAUlc,EAAEgN,QAAU,GAC9DgM,EAAM/Y,EAAEkc,UAAUH,EAAU/b,EAAE2M,KAAO,EAAGsP,EAAUjc,EAAE+M,QAAU,GAG9DiM,EAAK8C,EACPjJ,GAAesJ,IAAI3D,EAAKM,GACxBjG,GAAesJ,IAAI1D,EAAKM,GACxBgD,EACAE,GAEEhD,EAAK6C,EAAUjJ,GAAesJ,IAAIvD,EAAKE,GAAML,EAAKsD,EAAUE,GAC5D/C,EAAK4C,EAAUtD,EAAK3F,GAAeuJ,IAAIzD,EAAKI,GAAMgD,EAAUE,GAC5D9C,EAAK2C,EAAUhD,EAAKjG,GAAeuJ,IAAIvD,EAAKJ,GAAMsD,EAAUE,GAC5D7C,EAAK0C,EAAUjJ,GAAesJ,IAAI3D,EAAKE,GAAMK,EAAKgD,EAAUE,GAC5D7B,EAAK0B,EACPjJ,GAAeuJ,IAAIxD,EAAKJ,GACxB3F,GAAesJ,IAAI1D,EAAKE,GACxBoD,EACAE,GAEE5B,EAAKyB,EACPjJ,GAAeuJ,IAAI1D,EAAKI,GACxBjG,GAAesJ,IAAItD,EAAKE,GACxBgD,EACAE,GAIEzC,EAAM3G,GAAesJ,IAAInD,EAAIG,GACjCK,EAAI4C,IAAIhD,GACRI,EAAI2C,IAAI9B,GACR,IAAIW,EAAMnI,GAAesJ,IAAIjD,EAAIE,GAC7B8B,EAAMrI,GAAesJ,IAAIlD,EAAIE,GAC7BgC,EAAMtI,GAAeuJ,IAAIpD,EAAIC,GACjCkC,EAAIgB,IAAIjD,GACRiC,EAAIgB,IAAI/B,GAGR,IAAIuB,EAAW9I,GAAeY,MAAM,EAAI+F,EAAI7M,KAAM,EAAI6M,EAAIzM,SAK1D,OAJA4O,EAAWA,EAASxG,aAAaqE,EAAK,EAAG,GACzCmC,EAAWA,EAASxG,aAAa6F,EAAKxB,EAAI7M,KAAM,GAChDgP,EAAWA,EAASxG,aAAa+F,EAAK,EAAG1B,EAAIzM,SAC7C4O,EAAWA,EAASxG,aAAagG,EAAK3B,EAAI7M,KAAM6M,EAAIzM,SAC7C4O,EAASO,UAAU,EAAGvP,EAAO,EAAG,EAAGC,EAAO,EACnD,CAEOkP,CAAU/U,EA/EjBC,EAAIyU,EAAMzU,EAAG9F,EAAG1C,GA+EO0C,EAAG1C,EAC5B,CAEA6d,UAAU3W,EAAU,CAAC,GACnB,GAAuB,iBAAZA,EACT,MAAM,IAAItK,UAAU,6BAEtB,MAAM,IAAE+L,EAAM,EAAC,IAAEzC,EAAM,GAAMgB,EAC7B,IAAK6J,OAAO+M,SAASnV,GAAM,MAAM,IAAI/L,UAAU,wBAC/C,IAAKmU,OAAO+M,SAAS5X,GAAM,MAAM,IAAItJ,UAAU,wBAC/C,GAAI+L,GAAOzC,EAAK,MAAM,IAAIqL,WAAW,gCACrC,IAAImD,EAAY,IAAIC,GAAOnY,KAAK2R,KAAM3R,KAAK+R,SAC3C,IAAK,IAAIvQ,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAAK,CAClC,MAAM4R,EAAMpT,KAAKsa,OAAO9Y,GACpB4R,EAAI1R,OAAS,GACfiT,EAAQvB,EAAK,CAAEjH,MAAKzC,MAAKkL,OAAQxB,IAEnC8E,EAAUuC,OAAOjZ,EAAG4R,EACtB,CACA,OAAO8E,CACT,CAEAqJ,aAAa7W,EAAU,CAAC,GACtB,GAAuB,iBAAZA,EACT,MAAM,IAAItK,UAAU,6BAEtB,MAAM,IAAE+L,EAAM,EAAC,IAAEzC,EAAM,GAAMgB,EAC7B,IAAK6J,OAAO+M,SAASnV,GAAM,MAAM,IAAI/L,UAAU,wBAC/C,IAAKmU,OAAO+M,SAAS5X,GAAM,MAAM,IAAItJ,UAAU,wBAC/C,GAAI+L,GAAOzC,EAAK,MAAM,IAAIqL,WAAW,gCACrC,IAAImD,EAAY,IAAIC,GAAOnY,KAAK2R,KAAM3R,KAAK+R,SAC3C,IAAK,IAAIvQ,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAAK,CACrC,MAAM4W,EAASpY,KAAK6a,UAAUrZ,GAC1B4W,EAAO1W,QACTiT,EAAQyD,EAAQ,CACdjM,IAAKA,EACLzC,IAAKA,EACLkL,OAAQwD,IAGZF,EAAU8C,UAAUxZ,EAAG4W,EACzB,CACA,OAAOF,CACT,CAEAsJ,WACE,MAAMC,EAAS9X,KAAKmD,KAAK9M,KAAK+R,QAAU,GACxC,IAAK,IAAIvQ,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI+e,EAAQ/e,IAAK,CAC/B,IAAIgf,EAAQ1hB,KAAK+F,IAAIvE,EAAGkB,GACpBif,EAAO3hB,KAAK+F,IAAIvE,EAAGxB,KAAK+R,QAAU,EAAIrP,GAC1C1C,KAAKqY,IAAI7W,EAAGkB,EAAGif,GACf3hB,KAAKqY,IAAI7W,EAAGxB,KAAK+R,QAAU,EAAIrP,EAAGgf,EACpC,CAEF,OAAO1hB,IACT,CAEA4hB,cACE,MAAMH,EAAS9X,KAAKmD,KAAK9M,KAAK2R,KAAO,GACrC,IAAK,IAAIjP,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC,IAAK,IAAIlB,EAAI,EAAGA,EAAIigB,EAAQjgB,IAAK,CAC/B,IAAIkgB,EAAQ1hB,KAAK+F,IAAIvE,EAAGkB,GACpBif,EAAO3hB,KAAK+F,IAAI/F,KAAK2R,KAAO,EAAInQ,EAAGkB,GACvC1C,KAAKqY,IAAI7W,EAAGkB,EAAGif,GACf3hB,KAAKqY,IAAIrY,KAAK2R,KAAO,EAAInQ,EAAGkB,EAAGgf,EACjC,CAEF,OAAO1hB,IACT,CAEA6hB,iBAAiBzE,GACfA,EAAQjF,GAAOS,YAAYwE,GAE3B,IAAIvW,EAAI7G,KAAK2R,KACTpM,EAAIvF,KAAK+R,QACTvL,EAAI4W,EAAMzL,KACVmQ,EAAI1E,EAAMrL,QAEV1N,EAAS,IAAI8T,GAAOtR,EAAIL,EAAGjB,EAAIuc,GACnC,IAAK,IAAItgB,EAAI,EAAGA,EAAIqF,EAAGrF,IACrB,IAAK,IAAIkB,EAAI,EAAGA,EAAI6C,EAAG7C,IACrB,IAAK,IAAIyF,EAAI,EAAGA,EAAI3B,EAAG2B,IACrB,IAAK,IAAI1G,EAAI,EAAGA,EAAIqgB,EAAGrgB,IACrB4C,EAAOgU,IAAI7R,EAAIhF,EAAI2G,EAAG2Z,EAAIpf,EAAIjB,EAAGzB,KAAK+F,IAAIvE,EAAGkB,GAAK0a,EAAMrX,IAAIoC,EAAG1G,IAKvE,OAAO4C,CACT,CAEA0d,aAAa3E,GAEX,GADAA,EAAQjF,GAAOS,YAAYwE,IACtBpd,KAAKsZ,aAAe8D,EAAM9D,WAC7B,MAAM,IAAInV,MAAM,2CAElB,IAAI0C,EAAI7G,KAAK2R,KACTpM,EAAI6X,EAAMzL,KACVqQ,EAAMhiB,KAAK6hB,iBAAiB1J,GAAO8J,IAAI1c,EAAGA,IAC1C2c,EAAM/J,GAAO8J,IAAIpb,EAAGA,GAAGgb,iBAAiBzE,GAC5C,OAAO4E,EAAIb,IAAIe,EACjB,CAEAC,YACE,IAAI9d,EAAS,IAAI8T,GAAOnY,KAAK+R,QAAS/R,KAAK2R,MAC3C,IAAK,IAAInQ,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC2B,EAAOgU,IAAI3V,EAAGlB,EAAGxB,KAAK+F,IAAIvE,EAAGkB,IAGjC,OAAO2B,CACT,CAEA+d,SAASC,EAAkBC,IACzB,IAAK,IAAI9gB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7BxB,KAAKya,OAAOjZ,EAAGxB,KAAKsa,OAAO9Y,GAAGgL,KAAK6V,IAErC,OAAOriB,IACT,CAEAuiB,YAAYF,EAAkBC,IAC5B,IAAK,IAAI9gB,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAChCxB,KAAKgb,UAAUxZ,EAAGxB,KAAK6a,UAAUrZ,GAAGgL,KAAK6V,IAE3C,OAAOriB,IACT,CAEAkhB,UAAU9J,EAAUC,EAAQC,EAAaC,GACvCJ,EAAWnX,KAAMoX,EAAUC,EAAQC,EAAaC,GAChD,IAAIW,EAAY,IAAIC,GAClBd,EAASD,EAAW,EACpBG,EAAYD,EAAc,GAE5B,IAAK,IAAI9V,EAAI4V,EAAU5V,GAAK6V,EAAQ7V,IAClC,IAAK,IAAIkB,EAAI4U,EAAa5U,GAAK6U,EAAW7U,IACxCwV,EAAUG,IAAI7W,EAAI4V,EAAU1U,EAAI4U,EAAatX,KAAK+F,IAAIvE,EAAGkB,IAG7D,OAAOwV,CACT,CAEAsK,aAAaC,EAASnL,EAAaC,GAGjC,QAFoB/U,IAAhB8U,IAA2BA,EAAc,QAC3B9U,IAAd+U,IAAyBA,EAAYvX,KAAK+R,QAAU,GAEtDuF,EAAcC,GACdD,EAAc,GACdA,GAAetX,KAAK+R,SACpBwF,EAAY,GACZA,GAAavX,KAAK+R,QAElB,MAAM,IAAIgD,WAAW,yBAGvB,IAAImD,EAAY,IAAIC,GAAOsK,EAAQ/gB,OAAQ6V,EAAYD,EAAc,GACrE,IAAK,IAAI9V,EAAI,EAAGA,EAAIihB,EAAQ/gB,OAAQF,IAClC,IAAK,IAAIkB,EAAI4U,EAAa5U,GAAK6U,EAAW7U,IAAK,CAC7C,GAAI+f,EAAQjhB,GAAK,GAAKihB,EAAQjhB,IAAMxB,KAAK2R,KACvC,MAAM,IAAIoD,WAAW,2BAA2B0N,EAAQjhB,MAE1D0W,EAAUG,IAAI7W,EAAGkB,EAAI4U,EAAatX,KAAK+F,IAAI0c,EAAQjhB,GAAIkB,GACzD,CAEF,OAAOwV,CACT,CAEAwK,gBAAgBD,EAASrL,EAAUC,GAGjC,QAFiB7U,IAAb4U,IAAwBA,EAAW,QACxB5U,IAAX6U,IAAsBA,EAASrX,KAAK2R,KAAO,GAE7CyF,EAAWC,GACXD,EAAW,GACXA,GAAYpX,KAAK2R,MACjB0F,EAAS,GACTA,GAAUrX,KAAK2R,KAEf,MAAM,IAAIoD,WAAW,yBAGvB,IAAImD,EAAY,IAAIC,GAAOd,EAASD,EAAW,EAAGqL,EAAQ/gB,QAC1D,IAAK,IAAIF,EAAI,EAAGA,EAAIihB,EAAQ/gB,OAAQF,IAClC,IAAK,IAAIkB,EAAI0U,EAAU1U,GAAK2U,EAAQ3U,IAAK,CACvC,GAAI+f,EAAQjhB,GAAK,GAAKihB,EAAQjhB,IAAMxB,KAAK+R,QACvC,MAAM,IAAIgD,WAAW,8BAA8B0N,EAAQjhB,MAE7D0W,EAAUG,IAAI3V,EAAI0U,EAAU5V,EAAGxB,KAAK+F,IAAIrD,EAAG+f,EAAQjhB,IACrD,CAEF,OAAO0W,CACT,CAEAiC,aAAa3R,EAAQ4O,EAAUE,GAE7B,IADA9O,EAAS2P,GAAOS,YAAYpQ,IACjBoP,UACT,OAAO5X,KAITmX,EAAWnX,KAAMoX,EAFJA,EAAW5O,EAAOmJ,KAAO,EAEH2F,EADnBA,EAAc9O,EAAOuJ,QAAU,GAE/C,IAAK,IAAIvQ,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClC1C,KAAKqY,IAAIjB,EAAW5V,EAAG8V,EAAc5U,EAAG8F,EAAOzC,IAAIvE,EAAGkB,IAG1D,OAAO1C,IACT,CAEA2iB,UAAUC,EAAYC,ID7sCjB,SAAyBra,EAAQoa,GACtC,IAAK5O,EAAW4O,GACd,MAAM,IAAIxiB,UAAU,gCAGtB,IAAK,IAAIoB,EAAI,EAAGA,EAAIohB,EAAWlhB,OAAQF,IACrC,GAAIohB,EAAWphB,GAAK,GAAKohB,EAAWphB,IAAMgH,EAAOmJ,KAC/C,MAAM,IAAIoD,WAAW,+BAG3B,CCosCI+N,CAAgB9iB,KAAM4iB,GDlsCnB,SAA4Bpa,EAAQqa,GACzC,IAAK7O,EAAW6O,GACd,MAAM,IAAIziB,UAAU,mCAGtB,IAAK,IAAIoB,EAAI,EAAGA,EAAIqhB,EAAcnhB,OAAQF,IACxC,GAAIqhB,EAAcrhB,GAAK,GAAKqhB,EAAcrhB,IAAMgH,EAAOuJ,QACrD,MAAM,IAAIgD,WAAW,kCAG3B,CCyrCIgO,CAAmB/iB,KAAM6iB,GACzB,IAAI3K,EAAY,IAAIC,GAAOyK,EAAWlhB,OAAQmhB,EAAcnhB,QAC5D,IAAK,IAAIF,EAAI,EAAGA,EAAIohB,EAAWlhB,OAAQF,IAAK,CAC1C,IAAIwhB,EAAWJ,EAAWphB,GAC1B,IAAK,IAAIkB,EAAI,EAAGA,EAAImgB,EAAcnhB,OAAQgB,IAAK,CAC7C,IAAIugB,EAAcJ,EAAcngB,GAChCwV,EAAUG,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIid,EAAUC,GACzC,CACF,CACA,OAAO/K,CACT,CAEAgL,QACE,IAAI/W,EAAMxC,KAAKwC,IAAInM,KAAK2R,KAAM3R,KAAK+R,SAC/BmR,EAAQ,EACZ,IAAK,IAAI1hB,EAAI,EAAGA,EAAI2K,EAAK3K,IACvB0hB,GAASljB,KAAK+F,IAAIvE,EAAGA,GAEvB,OAAO0hB,CACT,CAEAla,QACE,IAAIkP,EAAY,IAAIC,GAAOnY,KAAK2R,KAAM3R,KAAK+R,SAC3C,IAAK,IAAIqB,EAAM,EAAGA,EAAMpT,KAAK2R,KAAMyB,IACjC,IAAK,IAAIgF,EAAS,EAAGA,EAASpY,KAAK+R,QAASqG,IAC1CF,EAAUG,IAAIjF,EAAKgF,EAAQpY,KAAK+F,IAAIqN,EAAKgF,IAG7C,OAAOF,CACT,CAEA6E,IAAIjB,GACF,OAAQA,GACN,IAAK,MACH,OCnzCD,SAAkBtT,GACvB,IAAIuU,EAAMtF,EAASjP,EAAOmJ,MAC1B,IAAK,IAAInQ,EAAI,EAAGA,EAAIgH,EAAOmJ,OAAQnQ,EACjC,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,UAAWrP,EACpCqa,EAAIvb,IAAMgH,EAAOzC,IAAIvE,EAAGkB,GAG5B,OAAOqa,CACT,CD2yCeoG,CAASnjB,MAClB,IAAK,SACH,OC3yCD,SAAqBwI,GAC1B,IAAIuU,EAAMtF,EAASjP,EAAOuJ,SAC1B,IAAK,IAAIvQ,EAAI,EAAGA,EAAIgH,EAAOmJ,OAAQnQ,EACjC,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,UAAWrP,EACpCqa,EAAIra,IAAM8F,EAAOzC,IAAIvE,EAAGkB,GAG5B,OAAOqa,CACT,CDmyCeqG,CAAYpjB,MACrB,UAAKwC,EACH,OCnyCD,SAAgBgG,GACrB,IAAIW,EAAI,EACR,IAAK,IAAI3H,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClCyG,GAAKX,EAAOzC,IAAIvE,EAAGkB,GAGvB,OAAOyG,CACT,CD2xCeka,CAAOrjB,MAChB,QACE,MAAM,IAAImE,MAAM,mBAAmB2X,KAEzC,CAEAwH,QAAQxH,GACN,OAAQA,GACN,IAAK,MACH,OClyCD,SAAsBtT,GAC3B,IAAIuU,EAAMtF,EAASjP,EAAOmJ,KAAM,GAChC,IAAK,IAAInQ,EAAI,EAAGA,EAAIgH,EAAOmJ,OAAQnQ,EACjC,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,UAAWrP,EACpCqa,EAAIvb,IAAMgH,EAAOzC,IAAIvE,EAAGkB,GAG5B,OAAOqa,CACT,CD0xCewG,CAAavjB,MACtB,IAAK,SACH,OC1xCD,SAAyBwI,GAC9B,IAAIuU,EAAMtF,EAASjP,EAAOuJ,QAAS,GACnC,IAAK,IAAIvQ,EAAI,EAAGA,EAAIgH,EAAOmJ,OAAQnQ,EACjC,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,UAAWrP,EACpCqa,EAAIra,IAAM8F,EAAOzC,IAAIvE,EAAGkB,GAG5B,OAAOqa,CACT,CDkxCeyG,CAAgBxjB,MACzB,UAAKwC,EACH,OClxCD,SAAoBgG,GACzB,IAAIW,EAAI,EACR,IAAK,IAAI3H,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClCyG,GAAKX,EAAOzC,IAAIvE,EAAGkB,GAGvB,OAAOyG,CACT,CD0wCesa,CAAWzjB,MACpB,QACE,MAAM,IAAImE,MAAM,mBAAmB2X,KAEzC,CAEA4H,KAAK5H,GACH,MAAMiB,EAAM/c,KAAK+c,IAAIjB,GACrB,OAAQA,GACN,IAAK,MACH,IAAK,IAAIta,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7Bub,EAAIvb,IAAMxB,KAAK+R,QAEjB,OAAOgL,EAET,IAAK,SACH,IAAK,IAAIvb,EAAI,EAAGA,EAAIxB,KAAK+R,QAASvQ,IAChCub,EAAIvb,IAAMxB,KAAK2R,KAEjB,OAAOoL,EAET,UAAKva,EACH,OAAOua,EAAM/c,KAAKiI,KACpB,QACE,MAAM,IAAI9D,MAAM,mBAAmB2X,KAEzC,CAEA6H,SAAS7H,EAAIpR,EAAU,CAAC,GAKtB,GAJkB,iBAAPoR,IACTpR,EAAUoR,EACVA,OAAKtZ,GAEgB,iBAAZkI,EACT,MAAM,IAAItK,UAAU,6BAEtB,MAAM,SAAEwjB,GAAW,EAAI,KAAEF,EAAO1jB,KAAK0jB,KAAK5H,IAAQpR,EAClD,GAAwB,kBAAbkZ,EACT,MAAM,IAAIxjB,UAAU,8BAEtB,OAAQ0b,GACN,IAAK,MACH,IAAK9H,EAAW0P,GACd,MAAM,IAAItjB,UAAU,yBAEtB,OCrzCD,SAAuBoI,EAAQob,EAAUF,GAC9C,MAAM/R,EAAOnJ,EAAOmJ,KACdC,EAAOpJ,EAAOuJ,QACd4R,EAAW,GAEjB,IAAK,IAAIniB,EAAI,EAAGA,EAAImQ,EAAMnQ,IAAK,CAC7B,IAAIqiB,EAAO,EACPC,EAAO,EACP/X,EAAI,EACR,IAAK,IAAIrJ,EAAI,EAAGA,EAAIkP,EAAMlP,IACxBqJ,EAAIvD,EAAOzC,IAAIvE,EAAGkB,GAAKghB,EAAKliB,GAC5BqiB,GAAQ9X,EACR+X,GAAQ/X,EAAIA,EAEV6X,EACFD,EAASnjB,MAAMsjB,EAAQD,EAAOA,EAAQjS,IAASA,EAAO,IAEtD+R,EAASnjB,MAAMsjB,EAAQD,EAAOA,EAAQjS,GAAQA,EAElD,CACA,OAAO+R,CACT,CDgyCeI,CAAc/jB,KAAM4jB,EAAUF,GAEvC,IAAK,SACH,IAAK1P,EAAW0P,GACd,MAAM,IAAItjB,UAAU,yBAEtB,OCpyCD,SAA0BoI,EAAQob,EAAUF,GACjD,MAAM/R,EAAOnJ,EAAOmJ,KACdC,EAAOpJ,EAAOuJ,QACd4R,EAAW,GAEjB,IAAK,IAAIjhB,EAAI,EAAGA,EAAIkP,EAAMlP,IAAK,CAC7B,IAAImhB,EAAO,EACPC,EAAO,EACP/X,EAAI,EACR,IAAK,IAAIvK,EAAI,EAAGA,EAAImQ,EAAMnQ,IACxBuK,EAAIvD,EAAOzC,IAAIvE,EAAGkB,GAAKghB,EAAKhhB,GAC5BmhB,GAAQ9X,EACR+X,GAAQ/X,EAAIA,EAEV6X,EACFD,EAASnjB,MAAMsjB,EAAQD,EAAOA,EAAQlS,IAASA,EAAO,IAEtDgS,EAASnjB,MAAMsjB,EAAQD,EAAOA,EAAQlS,GAAQA,EAElD,CACA,OAAOgS,CACT,CD+wCeK,CAAiBhkB,KAAM4jB,EAAUF,GAE1C,UAAKlhB,EACH,GAAoB,iBAATkhB,EACT,MAAM,IAAItjB,UAAU,yBAEtB,OCnxCD,SAAqBoI,EAAQob,EAAUF,GAC5C,MAAM/R,EAAOnJ,EAAOmJ,KACdC,EAAOpJ,EAAOuJ,QACd9J,EAAO0J,EAAOC,EAEpB,IAAIiS,EAAO,EACPC,EAAO,EACP/X,EAAI,EACR,IAAK,IAAIvK,EAAI,EAAGA,EAAImQ,EAAMnQ,IACxB,IAAK,IAAIkB,EAAI,EAAGA,EAAIkP,EAAMlP,IACxBqJ,EAAIvD,EAAOzC,IAAIvE,EAAGkB,GAAKghB,EACvBG,GAAQ9X,EACR+X,GAAQ/X,EAAIA,EAGhB,OAAI6X,GACME,EAAQD,EAAOA,EAAQ5b,IAASA,EAAO,IAEvC6b,EAAQD,EAAOA,EAAQ5b,GAAQA,CAE3C,CD+vCegc,CAAYjkB,KAAM4jB,EAAUF,GAErC,QACE,MAAM,IAAIvf,MAAM,mBAAmB2X,KAEzC,CAEAoI,kBAAkBpI,EAAIpR,GACF,iBAAPoR,IACTpR,EAAUoR,EACVA,OAAKtZ,GAEP,MAAMmhB,EAAW3jB,KAAK2jB,SAAS7H,EAAIpR,GACnC,QAAWlI,IAAPsZ,EACF,OAAOnS,KAAKyH,KAAKuS,GAEjB,IAAK,IAAIniB,EAAI,EAAGA,EAAImiB,EAASjiB,OAAQF,IACnCmiB,EAASniB,GAAKmI,KAAKyH,KAAKuS,EAASniB,IAEnC,OAAOmiB,CAEX,CAEA3Y,OAAO8Q,EAAIpR,EAAU,CAAC,GAKpB,GAJkB,iBAAPoR,IACTpR,EAAUoR,EACVA,OAAKtZ,GAEgB,iBAAZkI,EACT,MAAM,IAAItK,UAAU,6BAEtB,MAAM,OAAE4K,EAAShL,KAAK0jB,KAAK5H,IAAQpR,EACnC,OAAQoR,GACN,IAAK,MACH,IAAK9H,EAAWhJ,GACd,MAAM,IAAI5K,UAAU,2BAGtB,OCnyCD,SAAqBoI,EAAQkb,GAClC,IAAK,IAAIliB,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClC8F,EAAO6P,IAAI7W,EAAGkB,EAAG8F,EAAOzC,IAAIvE,EAAGkB,GAAKghB,EAAKliB,GAG/C,CD4xCQ2iB,CAAYnkB,KAAMgL,GACXhL,KAET,IAAK,SACH,IAAKgU,EAAWhJ,GACd,MAAM,IAAI5K,UAAU,2BAGtB,OClyCD,SAAwBoI,EAAQkb,GACrC,IAAK,IAAIliB,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClC8F,EAAO6P,IAAI7W,EAAGkB,EAAG8F,EAAOzC,IAAIvE,EAAGkB,GAAKghB,EAAKhhB,GAG/C,CD2xCQ0hB,CAAepkB,KAAMgL,GACdhL,KAET,UAAKwC,EACH,GAAsB,iBAAXwI,EACT,MAAM,IAAI5K,UAAU,2BAGtB,OCjyCD,SAAmBoI,EAAQkb,GAChC,IAAK,IAAIliB,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClC8F,EAAO6P,IAAI7W,EAAGkB,EAAG8F,EAAOzC,IAAIvE,EAAGkB,GAAKghB,EAG1C,CD0xCQW,CAAUrkB,KAAMgL,GACThL,KAET,QACE,MAAM,IAAImE,MAAM,mBAAmB2X,KAEzC,CAEAwI,MAAMxI,EAAIpR,EAAU,CAAC,GAKnB,GAJkB,iBAAPoR,IACTpR,EAAUoR,EACVA,OAAKtZ,GAEgB,iBAAZkI,EACT,MAAM,IAAItK,UAAU,6BAEtB,IAAIkkB,EAAQ5Z,EAAQ4Z,MACpB,OAAQxI,GACN,IAAK,MACH,QAActZ,IAAV8hB,EACFA,EC5yCH,SAAuB9b,GAC5B,MAAM8b,EAAQ,GACd,IAAK,IAAI9iB,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAAK,CACpC,IAAIub,EAAM,EACV,IAAK,IAAIra,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClCqa,GAAOpT,KAAK4a,IAAI/b,EAAOzC,IAAIvE,EAAGkB,GAAI,IAAM8F,EAAOuJ,QAAU,GAE3DuS,EAAM9jB,KAAKmJ,KAAKyH,KAAK2L,GACvB,CACA,OAAOuH,CACT,CDkyCkBE,CAAcxkB,WACjB,IAAKgU,EAAWsQ,GACrB,MAAM,IAAIlkB,UAAU,0BAGtB,OCryCD,SAAoBoI,EAAQ8b,GACjC,IAAK,IAAI9iB,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClC8F,EAAO6P,IAAI7W,EAAGkB,EAAG8F,EAAOzC,IAAIvE,EAAGkB,GAAK4hB,EAAM9iB,GAGhD,CD8xCQijB,CAAWzkB,KAAMskB,GACVtkB,KAET,IAAK,SACH,QAAcwC,IAAV8hB,EACFA,ECjyCH,SAA0B9b,GAC/B,MAAM8b,EAAQ,GACd,IAAK,IAAI5hB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAAK,CACvC,IAAIqa,EAAM,EACV,IAAK,IAAIvb,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/Bub,GAAOpT,KAAK4a,IAAI/b,EAAOzC,IAAIvE,EAAGkB,GAAI,IAAM8F,EAAOmJ,KAAO,GAExD2S,EAAM9jB,KAAKmJ,KAAKyH,KAAK2L,GACvB,CACA,OAAOuH,CACT,CDuxCkBI,CAAiB1kB,WACpB,IAAKgU,EAAWsQ,GACrB,MAAM,IAAIlkB,UAAU,0BAGtB,OC1xCD,SAAuBoI,EAAQ8b,GACpC,IAAK,IAAI9iB,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClC8F,EAAO6P,IAAI7W,EAAGkB,EAAG8F,EAAOzC,IAAIvE,EAAGkB,GAAK4hB,EAAM5hB,GAGhD,CDmxCQiiB,CAAc3kB,KAAMskB,GACbtkB,KAET,UAAKwC,EACH,QAAcA,IAAV8hB,EACFA,ECtxCH,SAAqB9b,GAC1B,MAAMoc,EAAUpc,EAAOP,KAAO,EAC9B,IAAI8U,EAAM,EACV,IAAK,IAAIra,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClC,IAAK,IAAIlB,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/Bub,GAAOpT,KAAK4a,IAAI/b,EAAOzC,IAAIvE,EAAGkB,GAAI,GAAKkiB,EAG3C,OAAOjb,KAAKyH,KAAK2L,EACnB,CD6wCkB8H,CAAY7kB,WACf,GAAqB,iBAAVskB,EAChB,MAAM,IAAIlkB,UAAU,0BAGtB,OChxCD,SAAkBoI,EAAQ8b,GAC/B,IAAK,IAAI9iB,EAAI,EAAGA,EAAIgH,EAAOmJ,KAAMnQ,IAC/B,IAAK,IAAIkB,EAAI,EAAGA,EAAI8F,EAAOuJ,QAASrP,IAClC8F,EAAO6P,IAAI7W,EAAGkB,EAAG8F,EAAOzC,IAAIvE,EAAGkB,GAAK4hB,EAG1C,CDywCQQ,CAAS9kB,KAAMskB,GACRtkB,KAET,QACE,MAAM,IAAImE,MAAM,mBAAmB2X,KAEzC,CAEA/H,SAASrJ,GACP,OAAO6K,EAAyBvV,KAAM0K,EACxC,EASF,SAAS4X,GAAevd,EAAGC,GACzB,OAAOD,EAAIC,CACb,CARA6S,GAAerY,UAAUsZ,MAAQ,SACX,oBAAX3S,SACT0R,GAAerY,UAAU2G,OAAO4e,IAAI,+BFx+C/B,WACL,OAAOxP,EAAyBvV,KAClC,GEq/CA6X,GAAeU,OAASV,GAAemN,KACvCnN,GAAeoN,UAAYpN,GAAeqN,QAC1CrN,GAAesN,SAAWtN,GAAe+E,KACzC/E,GAAerY,UAAU2lB,SAAWtN,GAAerY,UAAUod,KAC7D/E,GAAeuN,SAAWvN,GAAeoK,IACzCpK,GAAerY,UAAU6lB,OAASxN,GAAerY,UAAU4a,IAC3DvC,GAAerY,UAAU8lB,cACvBzN,GAAerY,UAAUqiB,iBAEZ,MAAM1J,WAAeN,GAClCvJ,YAAYiX,EAAOC,GAEjB,GADAC,QACItN,GAAOU,SAAS0M,GAElB,OAAOA,EAAMvc,QACR,GAAIuL,OAAOC,UAAU+Q,IAAUA,GAAS,EAAG,CAGhD,GADAvlB,KAAK6D,KAAO,KACR0Q,OAAOC,UAAUgR,IAAaA,GAAY,GAK5C,MAAM,IAAIplB,UAAU,uCAJpB,IAAK,IAAIoB,EAAI,EAAGA,EAAI+jB,EAAO/jB,IACzBxB,KAAK6D,KAAKrD,KAAK,IAAI8c,aAAakI,GAKtC,KAAO,KAAIxR,EAAWuR,GAqBpB,MAAM,IAAInlB,UACR,wDAtB0B,CAE5B,MAAMslB,EAAYH,EAGlB,GAAwB,iBADxBC,GADAD,EAAQG,EAAUhkB,QACCgkB,EAAU,GAAGhkB,OAAS,GAEvC,MAAM,IAAItB,UACR,qDAGJJ,KAAK6D,KAAO,GACZ,IAAK,IAAIrC,EAAI,EAAGA,EAAI+jB,EAAO/jB,IAAK,CAC9B,GAAIkkB,EAAUlkB,GAAGE,SAAW8jB,EAC1B,MAAM,IAAIzQ,WAAW,iCAEvB,IAAsB2Q,EAAUlkB,GA9CzBmkB,OAAOC,GACQ,iBAAZA,IA8CR,MAAM,IAAIxlB,UAAU,0CAEtBJ,KAAK6D,KAAKrD,KAAK8c,aAAalW,KAAKse,EAAUlkB,IAC7C,CACF,CAIA,CACAxB,KAAK2R,KAAO4T,EACZvlB,KAAK+R,QAAUyT,CACjB,CAEAnN,IAAI2K,EAAUC,EAAa5c,GAEzB,OADArG,KAAK6D,KAAKmf,GAAUC,GAAe5c,EAC5BrG,IACT,CAEA+F,IAAIid,EAAUC,GACZ,OAAOjjB,KAAK6D,KAAKmf,GAAUC,EAC7B,CAEA4C,UAAUjP,GAIR,OAHAD,EAAc3W,KAAM4W,GACpB5W,KAAK6D,KAAKiiB,OAAOlP,EAAO,GACxB5W,KAAK2R,MAAQ,EACN3R,IACT,CAEA+lB,OAAOnP,EAAOc,GASZ,YARclV,IAAVkV,IACFA,EAAQd,EACRA,EAAQ5W,KAAK2R,MAEfgF,EAAc3W,KAAM4W,GAAO,GAC3Bc,EAAQ4F,aAAalW,KAAK2P,EAAe/W,KAAM0X,IAC/C1X,KAAK6D,KAAKiiB,OAAOlP,EAAO,EAAGc,GAC3B1X,KAAK2R,MAAQ,EACN3R,IACT,CAEAgmB,aAAapP,GACXE,EAAiB9W,KAAM4W,GACvB,IAAK,IAAIpV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAAK,CAClC,MAAMykB,EAAS,IAAI3I,aAAatd,KAAK+R,QAAU,GAC/C,IAAK,IAAIrP,EAAI,EAAGA,EAAIkU,EAAOlU,IACzBujB,EAAOvjB,GAAK1C,KAAK6D,KAAKrC,GAAGkB,GAE3B,IAAK,IAAIA,EAAIkU,EAAQ,EAAGlU,EAAI1C,KAAK+R,QAASrP,IACxCujB,EAAOvjB,EAAI,GAAK1C,KAAK6D,KAAKrC,GAAGkB,GAE/B1C,KAAK6D,KAAKrC,GAAKykB,CACjB,CAEA,OADAjmB,KAAK+R,SAAW,EACT/R,IACT,CAEAkmB,UAAUtP,EAAOc,QACM,IAAVA,IACTA,EAAQd,EACRA,EAAQ5W,KAAK+R,SAEf+E,EAAiB9W,KAAM4W,GAAO,GAC9Bc,EAAQR,EAAkBlX,KAAM0X,GAChC,IAAK,IAAIlW,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAAK,CAClC,MAAMykB,EAAS,IAAI3I,aAAatd,KAAK+R,QAAU,GAC/C,IAAIrP,EAAI,EACR,KAAOA,EAAIkU,EAAOlU,IAChBujB,EAAOvjB,GAAK1C,KAAK6D,KAAKrC,GAAGkB,GAG3B,IADAujB,EAAOvjB,KAAOgV,EAAMlW,GACbkB,EAAI1C,KAAK+R,QAAU,EAAGrP,IAC3BujB,EAAOvjB,GAAK1C,KAAK6D,KAAKrC,GAAGkB,EAAI,GAE/B1C,KAAK6D,KAAKrC,GAAKykB,CACjB,CAEA,OADAjmB,KAAK+R,SAAW,EACT/R,IACT,GEjnDK,SAA+B6X,EAAgBM,GACpDN,EAAerY,UAAU2hB,IAAM,SAAa9a,GAC1C,MAAqB,iBAAVA,EAA2BrG,KAAKmmB,KAAK9f,GACzCrG,KAAKomB,KAAK/f,EACnB,EAEAwR,EAAerY,UAAU2mB,KAAO,SAAc9f,GAC5C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK2D,GAGpC,OAAOrG,IACT,EAEA6X,EAAerY,UAAU4mB,KAAO,SAAc5d,GAE5C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK8F,EAAOzC,IAAIvE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA6X,EAAesJ,IAAM,SAAa3Y,EAAQnC,GAExC,OADkB,IAAI8R,EAAO3P,GACZ2Y,IAAI9a,EACvB,EAEAwR,EAAerY,UAAU4hB,IAAM,SAAa/a,GAC1C,MAAqB,iBAAVA,EAA2BrG,KAAKqmB,KAAKhgB,GACzCrG,KAAKsmB,KAAKjgB,EACnB,EAEAwR,EAAerY,UAAU6mB,KAAO,SAAchgB,GAC5C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK2D,GAGpC,OAAOrG,IACT,EAEA6X,EAAerY,UAAU8mB,KAAO,SAAc9d,GAE5C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK8F,EAAOzC,IAAIvE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA6X,EAAeuJ,IAAM,SAAa5Y,EAAQnC,GAExC,OADkB,IAAI8R,EAAO3P,GACZ4Y,IAAI/a,EACvB,EACAwR,EAAerY,UAAU+mB,SAAW1O,EAAerY,UAAU4hB,IAC7DvJ,EAAerY,UAAUgnB,UAAY3O,EAAerY,UAAU6mB,KAC9DxO,EAAerY,UAAUinB,UAAY5O,EAAerY,UAAU8mB,KAC9DzO,EAAe0O,SAAW1O,EAAeuJ,IAEzCvJ,EAAerY,UAAUknB,IAAM,SAAargB,GAC1C,MAAqB,iBAAVA,EAA2BrG,KAAKqa,KAAKhU,GACzCrG,KAAK2mB,KAAKtgB,EACnB,EAEAwR,EAAerY,UAAU6a,KAAO,SAAchU,GAC5C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK2D,GAGpC,OAAOrG,IACT,EAEA6X,EAAerY,UAAUmnB,KAAO,SAAcne,GAE5C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK8F,EAAOzC,IAAIvE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA6X,EAAe6O,IAAM,SAAale,EAAQnC,GAExC,OADkB,IAAI8R,EAAO3P,GACZke,IAAIrgB,EACvB,EACAwR,EAAerY,UAAUonB,SAAW/O,EAAerY,UAAUknB,IAC7D7O,EAAerY,UAAUqnB,UAAYhP,EAAerY,UAAU6a,KAC9DxC,EAAerY,UAAUsnB,UAAYjP,EAAerY,UAAUmnB,KAC9D9O,EAAe+O,SAAW/O,EAAe6O,IAEzC7O,EAAerY,UAAUunB,IAAM,SAAa1gB,GAC1C,MAAqB,iBAAVA,EAA2BrG,KAAKgnB,KAAK3gB,GACzCrG,KAAKinB,KAAK5gB,EACnB,EAEAwR,EAAerY,UAAUwnB,KAAO,SAAc3gB,GAC5C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK2D,GAGpC,OAAOrG,IACT,EAEA6X,EAAerY,UAAUynB,KAAO,SAAcze,GAE5C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK8F,EAAOzC,IAAIvE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA6X,EAAekP,IAAM,SAAave,EAAQnC,GAExC,OADkB,IAAI8R,EAAO3P,GACZue,IAAI1gB,EACvB,EACAwR,EAAerY,UAAU0nB,OAASrP,EAAerY,UAAUunB,IAC3DlP,EAAerY,UAAU2nB,QAAUtP,EAAerY,UAAUwnB,KAC5DnP,EAAerY,UAAU4nB,QAAUvP,EAAerY,UAAUynB,KAC5DpP,EAAeqP,OAASrP,EAAekP,IAEvClP,EAAerY,UAAU6nB,IAAM,SAAahhB,GAC1C,MAAqB,iBAAVA,EAA2BrG,KAAKsnB,KAAKjhB,GACzCrG,KAAKunB,KAAKlhB,EACnB,EAEAwR,EAAerY,UAAU8nB,KAAO,SAAcjhB,GAC5C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK2D,GAGpC,OAAOrG,IACT,EAEA6X,EAAerY,UAAU+nB,KAAO,SAAc/e,GAE5C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK8F,EAAOzC,IAAIvE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA6X,EAAewP,IAAM,SAAa7e,EAAQnC,GAExC,OADkB,IAAI8R,EAAO3P,GACZ6e,IAAIhhB,EACvB,EACAwR,EAAerY,UAAUgoB,QAAU3P,EAAerY,UAAU6nB,IAC5DxP,EAAerY,UAAUioB,SAAW5P,EAAerY,UAAU8nB,KAC7DzP,EAAerY,UAAUkoB,SAAW7P,EAAerY,UAAU+nB,KAC7D1P,EAAe2P,QAAU3P,EAAewP,IAExCxP,EAAerY,UAAUmoB,IAAM,SAAathB,GAC1C,MAAqB,iBAAVA,EAA2BrG,KAAK4nB,KAAKvhB,GACzCrG,KAAK6nB,KAAKxhB,EACnB,EAEAwR,EAAerY,UAAUooB,KAAO,SAAcvhB,GAC5C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK2D,GAGpC,OAAOrG,IACT,EAEA6X,EAAerY,UAAUqoB,KAAO,SAAcrf,GAE5C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK8F,EAAOzC,IAAIvE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA6X,EAAe8P,IAAM,SAAanf,EAAQnC,GAExC,OADkB,IAAI8R,EAAO3P,GACZmf,IAAIthB,EACvB,EAEAwR,EAAerY,UAAUsoB,GAAK,SAAYzhB,GACxC,MAAqB,iBAAVA,EAA2BrG,KAAK+nB,IAAI1hB,GACxCrG,KAAKgoB,IAAI3hB,EAClB,EAEAwR,EAAerY,UAAUuoB,IAAM,SAAa1hB,GAC1C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK2D,GAGpC,OAAOrG,IACT,EAEA6X,EAAerY,UAAUwoB,IAAM,SAAaxf,GAE1C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK8F,EAAOzC,IAAIvE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA6X,EAAeiQ,GAAK,SAAYtf,EAAQnC,GAEtC,OADkB,IAAI8R,EAAO3P,GACZsf,GAAGzhB,EACtB,EAEAwR,EAAerY,UAAUyoB,IAAM,SAAa5hB,GAC1C,MAAqB,iBAAVA,EAA2BrG,KAAKkoB,KAAK7hB,GACzCrG,KAAKmoB,KAAK9hB,EACnB,EAEAwR,EAAerY,UAAU0oB,KAAO,SAAc7hB,GAC5C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK2D,GAGpC,OAAOrG,IACT,EAEA6X,EAAerY,UAAU2oB,KAAO,SAAc3f,GAE5C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,GAAK8F,EAAOzC,IAAIvE,EAAGkB,IAGlD,OAAO1C,IACT,EAEA6X,EAAeoQ,IAAM,SAAazf,EAAQnC,GAExC,OADkB,IAAI8R,EAAO3P,GACZyf,IAAI5hB,EACvB,EAEAwR,EAAerY,UAAU4oB,UAAY,SAAmB/hB,GACtD,MAAqB,iBAAVA,EAA2BrG,KAAKqoB,WAAWhiB,GAC/CrG,KAAKsoB,WAAWjiB,EACzB,EAEAwR,EAAerY,UAAU6oB,WAAa,SAAoBhiB,GACxD,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,IAAM2D,GAGrC,OAAOrG,IACT,EAEA6X,EAAerY,UAAU8oB,WAAa,SAAoB9f,GAExD,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,IAAM8F,EAAOzC,IAAIvE,EAAGkB,IAGnD,OAAO1C,IACT,EAEA6X,EAAeuQ,UAAY,SAAmB5f,EAAQnC,GAEpD,OADkB,IAAI8R,EAAO3P,GACZ4f,UAAU/hB,EAC7B,EAEAwR,EAAerY,UAAU+oB,0BAA4B,SAAmCliB,GACtF,MAAqB,iBAAVA,EAA2BrG,KAAKwoB,2BAA2BniB,GAC/DrG,KAAKyoB,2BAA2BpiB,EACzC,EAEAwR,EAAerY,UAAUgpB,2BAA6B,SAAoCniB,GACxF,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,IAAM2D,GAGrC,OAAOrG,IACT,EAEA6X,EAAerY,UAAUipB,2BAA6B,SAAoCjgB,GAExF,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,IAAM8F,EAAOzC,IAAIvE,EAAGkB,IAGnD,OAAO1C,IACT,EAEA6X,EAAe0Q,0BAA4B,SAAmC/f,EAAQnC,GAEpF,OADkB,IAAI8R,EAAO3P,GACZ+f,0BAA0BliB,EAC7C,EAEAwR,EAAerY,UAAUkpB,WAAa,SAAoBriB,GACxD,MAAqB,iBAAVA,EAA2BrG,KAAK2oB,YAAYtiB,GAChDrG,KAAK4oB,YAAYviB,EAC1B,EAEAwR,EAAerY,UAAUmpB,YAAc,SAAqBtiB,GAC1D,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,KAAO2D,GAGtC,OAAOrG,IACT,EAEA6X,EAAerY,UAAUopB,YAAc,SAAqBpgB,GAE1D,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAG1C,KAAK+F,IAAIvE,EAAGkB,KAAO8F,EAAOzC,IAAIvE,EAAGkB,IAGpD,OAAO1C,IACT,EAEA6X,EAAe6Q,WAAa,SAAoBlgB,EAAQnC,GAEtD,OADkB,IAAI8R,EAAO3P,GACZkgB,WAAWriB,EAC9B,EACAwR,EAAerY,UAAUqpB,mBAAqBhR,EAAerY,UAAUkpB,WACvE7Q,EAAerY,UAAUspB,oBAAsBjR,EAAerY,UAAUmpB,YACxE9Q,EAAerY,UAAUupB,oBAAsBlR,EAAerY,UAAUopB,YACxE/Q,EAAegR,mBAAqBhR,EAAe6Q,WAEnD7Q,EAAerY,UAAUwpB,IAAM,WAC7B,IAAK,IAAIxnB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,GAAK1C,KAAK+F,IAAIvE,EAAGkB,IAGjC,OAAO1C,IACT,EAEA6X,EAAemR,IAAM,SAAaxgB,GAEhC,OADkB,IAAI2P,EAAO3P,GACZwgB,KACnB,EAEAnR,EAAerY,UAAUmR,IAAM,WAC7B,IAAK,IAAInP,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKgH,IAAI3Q,KAAK+F,IAAIvE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA6X,EAAelH,IAAM,SAAanI,GAEhC,OADkB,IAAI2P,EAAO3P,GACZmI,KACnB,EAEAkH,EAAerY,UAAUypB,KAAO,WAC9B,IAAK,IAAIznB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKsf,KAAKjpB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAeoR,KAAO,SAAczgB,GAElC,OADkB,IAAI2P,EAAO3P,GACZygB,MACnB,EAEApR,EAAerY,UAAU0pB,MAAQ,WAC/B,IAAK,IAAI1nB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKuf,MAAMlpB,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAeqR,MAAQ,SAAe1gB,GAEpC,OADkB,IAAI2P,EAAO3P,GACZ0gB,OACnB,EAEArR,EAAerY,UAAU2pB,KAAO,WAC9B,IAAK,IAAI3nB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKwf,KAAKnpB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAesR,KAAO,SAAc3gB,GAElC,OADkB,IAAI2P,EAAO3P,GACZ2gB,MACnB,EAEAtR,EAAerY,UAAU4pB,MAAQ,WAC/B,IAAK,IAAI5nB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKyf,MAAMppB,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAeuR,MAAQ,SAAe5gB,GAEpC,OADkB,IAAI2P,EAAO3P,GACZ4gB,OACnB,EAEAvR,EAAerY,UAAU6pB,KAAO,WAC9B,IAAK,IAAI7nB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK0f,KAAKrpB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAewR,KAAO,SAAc7gB,GAElC,OADkB,IAAI2P,EAAO3P,GACZ6gB,MACnB,EAEAxR,EAAerY,UAAU8pB,MAAQ,WAC/B,IAAK,IAAI9nB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK2f,MAAMtpB,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAeyR,MAAQ,SAAe9gB,GAEpC,OADkB,IAAI2P,EAAO3P,GACZ8gB,OACnB,EAEAzR,EAAerY,UAAU+pB,KAAO,WAC9B,IAAK,IAAI/nB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK4f,KAAKvpB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAe0R,KAAO,SAAc/gB,GAElC,OADkB,IAAI2P,EAAO3P,GACZ+gB,MACnB,EAEA1R,EAAerY,UAAUsN,KAAO,WAC9B,IAAK,IAAItL,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKmD,KAAK9M,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAe/K,KAAO,SAActE,GAElC,OADkB,IAAI2P,EAAO3P,GACZsE,MACnB,EAEA+K,EAAerY,UAAUgqB,MAAQ,WAC/B,IAAK,IAAIhoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK6f,MAAMxpB,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAe2R,MAAQ,SAAehhB,GAEpC,OADkB,IAAI2P,EAAO3P,GACZghB,OACnB,EAEA3R,EAAerY,UAAUyN,IAAM,WAC7B,IAAK,IAAIzL,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKsD,IAAIjN,KAAK+F,IAAIvE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA6X,EAAe5K,IAAM,SAAazE,GAEhC,OADkB,IAAI2P,EAAO3P,GACZyE,KACnB,EAEA4K,EAAerY,UAAUiqB,KAAO,WAC9B,IAAK,IAAIjoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK8f,KAAKzpB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAe4R,KAAO,SAAcjhB,GAElC,OADkB,IAAI2P,EAAO3P,GACZihB,MACnB,EAEA5R,EAAerY,UAAUiX,IAAM,WAC7B,IAAK,IAAIjV,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK8M,IAAIzW,KAAK+F,IAAIvE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA6X,EAAepB,IAAM,SAAajO,GAEhC,OADkB,IAAI2P,EAAO3P,GACZiO,KACnB,EAEAoB,EAAerY,UAAUkqB,MAAQ,WAC/B,IAAK,IAAIloB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK+f,MAAM1pB,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAe6R,MAAQ,SAAelhB,GAEpC,OADkB,IAAI2P,EAAO3P,GACZkhB,OACnB,EAEA7R,EAAerY,UAAUwN,MAAQ,WAC/B,IAAK,IAAIxL,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKqD,MAAMhN,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAe7K,MAAQ,SAAexE,GAEpC,OADkB,IAAI2P,EAAO3P,GACZwE,OACnB,EAEA6K,EAAerY,UAAUmqB,OAAS,WAChC,IAAK,IAAInoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKggB,OAAO3pB,KAAK+F,IAAIvE,EAAGkB,KAG3C,OAAO1C,IACT,EAEA6X,EAAe8R,OAAS,SAAgBnhB,GAEtC,OADkB,IAAI2P,EAAO3P,GACZmhB,QACnB,EAEA9R,EAAerY,UAAUoqB,IAAM,WAC7B,IAAK,IAAIpoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKigB,IAAI5pB,KAAK+F,IAAIvE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA6X,EAAe+R,IAAM,SAAaphB,GAEhC,OADkB,IAAI2P,EAAO3P,GACZohB,KACnB,EAEA/R,EAAerY,UAAUqqB,MAAQ,WAC/B,IAAK,IAAIroB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKkgB,MAAM7pB,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAegS,MAAQ,SAAerhB,GAEpC,OADkB,IAAI2P,EAAO3P,GACZqhB,OACnB,EAEAhS,EAAerY,UAAUsqB,MAAQ,WAC/B,IAAK,IAAItoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKmgB,MAAM9pB,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAeiS,MAAQ,SAAethB,GAEpC,OADkB,IAAI2P,EAAO3P,GACZshB,OACnB,EAEAjS,EAAerY,UAAUuqB,KAAO,WAC9B,IAAK,IAAIvoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKogB,KAAK/pB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAekS,KAAO,SAAcvhB,GAElC,OADkB,IAAI2P,EAAO3P,GACZuhB,MACnB,EAEAlS,EAAerY,UAAU6S,MAAQ,WAC/B,IAAK,IAAI7Q,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK0I,MAAMrS,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAexF,MAAQ,SAAe7J,GAEpC,OADkB,IAAI2P,EAAO3P,GACZ6J,OACnB,EAEAwF,EAAerY,UAAUwqB,KAAO,WAC9B,IAAK,IAAIxoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKqgB,KAAKhqB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAemS,KAAO,SAAcxhB,GAElC,OADkB,IAAI2P,EAAO3P,GACZwhB,MACnB,EAEAnS,EAAerY,UAAU0N,IAAM,WAC7B,IAAK,IAAI1L,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKuD,IAAIlN,KAAK+F,IAAIvE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA6X,EAAe3K,IAAM,SAAa1E,GAEhC,OADkB,IAAI2P,EAAO3P,GACZ0E,KACnB,EAEA2K,EAAerY,UAAUyqB,KAAO,WAC9B,IAAK,IAAIzoB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKsgB,KAAKjqB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAeoS,KAAO,SAAczhB,GAElC,OADkB,IAAI2P,EAAO3P,GACZyhB,MACnB,EAEApS,EAAerY,UAAU4R,KAAO,WAC9B,IAAK,IAAI5P,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKyH,KAAKpR,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAezG,KAAO,SAAc5I,GAElC,OADkB,IAAI2P,EAAO3P,GACZ4I,MACnB,EAEAyG,EAAerY,UAAU0qB,IAAM,WAC7B,IAAK,IAAI1oB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKugB,IAAIlqB,KAAK+F,IAAIvE,EAAGkB,KAGxC,OAAO1C,IACT,EAEA6X,EAAeqS,IAAM,SAAa1hB,GAEhC,OADkB,IAAI2P,EAAO3P,GACZ0hB,KACnB,EAEArS,EAAerY,UAAU2qB,KAAO,WAC9B,IAAK,IAAI3oB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKwgB,KAAKnqB,KAAK+F,IAAIvE,EAAGkB,KAGzC,OAAO1C,IACT,EAEA6X,EAAesS,KAAO,SAAc3hB,GAElC,OADkB,IAAI2P,EAAO3P,GACZ2hB,MACnB,EAEAtS,EAAerY,UAAU4qB,MAAQ,WAC/B,IAAK,IAAI5oB,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAKygB,MAAMpqB,KAAK+F,IAAIvE,EAAGkB,KAG1C,OAAO1C,IACT,EAEA6X,EAAeuS,MAAQ,SAAe5hB,GAEpC,OADkB,IAAI2P,EAAO3P,GACZ4hB,OACnB,EAEAvS,EAAe0M,IAAM,SAAa/b,EAAQ6hB,GAExC,OADkB,IAAIlS,EAAO3P,GACZ+b,IAAI8F,EACvB,EAEAxS,EAAerY,UAAU+kB,IAAM,SAAale,GAC1C,MAAqB,iBAAVA,EAA2BrG,KAAKsqB,KAAKjkB,GACzCrG,KAAKuqB,KAAKlkB,EACnB,EAEAwR,EAAerY,UAAU8qB,KAAO,SAAcjkB,GAC5C,IAAK,IAAI7E,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK4a,IAAIvkB,KAAK+F,IAAIvE,EAAGkB,GAAI2D,IAG5C,OAAOrG,IACT,EAEA6X,EAAerY,UAAU+qB,KAAO,SAAc/hB,GAE5C,GADAA,EAAS2P,EAAOS,YAAYpQ,GACxBxI,KAAK2R,OAASnJ,EAAOmJ,MACvB3R,KAAK+R,UAAYvJ,EAAOuJ,QACxB,MAAM,IAAIgD,WAAW,qCAEvB,IAAK,IAAIvT,EAAI,EAAGA,EAAIxB,KAAK2R,KAAMnQ,IAC7B,IAAK,IAAIkB,EAAI,EAAGA,EAAI1C,KAAK+R,QAASrP,IAChC1C,KAAKqY,IAAI7W,EAAGkB,EAAGiH,KAAK4a,IAAIvkB,KAAK+F,IAAIvE,EAAGkB,GAAI8F,EAAOzC,IAAIvE,EAAGkB,KAG1D,OAAO1C,IACT,CACF,CF8zBAwqB,CAAsB3S,GAAgBM,IGlnDvB,MAAMsS,WAAwB5S,GAC3CvJ,YAAYzK,GACV4hB,QACAzlB,KAAK6D,KAAOA,EACZ7D,KAAK2R,KAAO9N,EAAKnC,OACjB1B,KAAK+R,QAAUlO,EAAK,GAAGnC,MACzB,CAEA2W,IAAI2K,EAAUC,EAAa5c,GAEzB,OADArG,KAAK6D,KAAKmf,GAAUC,GAAe5c,EAC5BrG,IACT,CAEA+F,IAAIid,EAAUC,GACZ,OAAOjjB,KAAK6D,KAAKmf,GAAUC,EAC7B,ECjBK,SAASyH,GAAW3lB,EAAGC,GAC5B,IAAIkB,EAAI,EACR,OAAIyD,KAAKgH,IAAI5L,GAAK4E,KAAKgH,IAAI3L,IACzBkB,EAAIlB,EAAID,EACD4E,KAAKgH,IAAI5L,GAAK4E,KAAKyH,KAAK,EAAIlL,EAAIA,IAE/B,IAANlB,GACFkB,EAAInB,EAAIC,EACD2E,KAAKgH,IAAI3L,GAAK2E,KAAKyH,KAAK,EAAIlL,EAAIA,IAElC,CACT,CCNe,MAAMykB,GACnBrc,YAAYjI,EAAOqE,EAAU,CAAC,GAG5B,IAFArE,EAAQokB,GAAgB7R,YAAYvS,IAE1BuR,UACR,MAAM,IAAIzT,MAAM,4BAGlB,IAAI0C,EAAIR,EAAMsL,KACVpM,EAAIc,EAAM0L,QAEd,MAAM,2BACJ6Y,GAA6B,EAAI,4BACjCC,GAA8B,EAAI,cAClCC,GAAgB,GACdpgB,EAEJ,IAII3F,EAJAgmB,EAAQC,QAAQJ,GAChBK,EAAQD,QAAQH,GAEhBK,GAAU,EAEd,GAAIrkB,EAAItB,EACN,GAAKulB,EAME,CACL/lB,EAAIsB,EAAM8b,YACVtb,EAAI9B,EAAE4M,KACNpM,EAAIR,EAAEgN,QACNmZ,GAAU,EACV,IAAIC,EAAMJ,EACVA,EAAQE,EACRA,EAAQE,CACV,MAbEpmB,EAAIsB,EAAM2C,QAEV4X,QAAQC,KACN,+FAYJ9b,EAAIsB,EAAM2C,QAGZ,IAAIoiB,EAAKzhB,KAAKwC,IAAItF,EAAGtB,GACjB8lB,EAAK1hB,KAAKwC,IAAItF,EAAI,EAAGtB,GACrBoB,EAAI,IAAI2W,aAAa+N,GACrBC,EAAI,IAAInT,GAAOtR,EAAGukB,GAClBG,EAAI,IAAIpT,GAAO5S,EAAGA,GAElB5B,EAAI,IAAI2Z,aAAa/X,GACrBimB,EAAO,IAAIlO,aAAazW,GAExB4kB,EAAK,IAAInO,aAAa+N,GAC1B,IAAK,IAAI7pB,EAAI,EAAGA,EAAI6pB,EAAI7pB,IAAKiqB,EAAGjqB,GAAKA,EAErC,IAAIkqB,EAAM/hB,KAAKwC,IAAItF,EAAI,EAAGtB,GACtBomB,EAAMhiB,KAAKD,IAAI,EAAGC,KAAKwC,IAAI5G,EAAI,EAAGsB,IAClC+kB,EAAMjiB,KAAKD,IAAIgiB,EAAKC,GAExB,IAAK,IAAIxjB,EAAI,EAAGA,EAAIyjB,EAAKzjB,IAAK,CAC5B,GAAIA,EAAIujB,EAAK,CACX/kB,EAAEwB,GAAK,EACP,IAAK,IAAI3G,EAAI2G,EAAG3G,EAAIqF,EAAGrF,IACrBmF,EAAEwB,GAAKuiB,GAAW/jB,EAAEwB,GAAIpD,EAAEgB,IAAIvE,EAAG2G,IAEnC,GAAa,IAATxB,EAAEwB,GAAU,CACVpD,EAAEgB,IAAIoC,EAAGA,GAAK,IAChBxB,EAAEwB,IAAMxB,EAAEwB,IAEZ,IAAK,IAAI3G,EAAI2G,EAAG3G,EAAIqF,EAAGrF,IACrBuD,EAAEsT,IAAI7W,EAAG2G,EAAGpD,EAAEgB,IAAIvE,EAAG2G,GAAKxB,EAAEwB,IAE9BpD,EAAEsT,IAAIlQ,EAAGA,EAAGpD,EAAEgB,IAAIoC,EAAGA,GAAK,EAC5B,CACAxB,EAAEwB,IAAMxB,EAAEwB,EACZ,CAEA,IAAK,IAAIzF,EAAIyF,EAAI,EAAGzF,EAAI6C,EAAG7C,IAAK,CAC9B,GAAIyF,EAAIujB,GAAgB,IAAT/kB,EAAEwB,GAAU,CACzB,IAAIzB,EAAI,EACR,IAAK,IAAIlF,EAAI2G,EAAG3G,EAAIqF,EAAGrF,IACrBkF,GAAK3B,EAAEgB,IAAIvE,EAAG2G,GAAKpD,EAAEgB,IAAIvE,EAAGkB,GAE9BgE,GAAKA,EAAI3B,EAAEgB,IAAIoC,EAAGA,GAClB,IAAK,IAAI3G,EAAI2G,EAAG3G,EAAIqF,EAAGrF,IACrBuD,EAAEsT,IAAI7W,EAAGkB,EAAGqC,EAAEgB,IAAIvE,EAAGkB,GAAKgE,EAAI3B,EAAEgB,IAAIvE,EAAG2G,GAE3C,CACAxE,EAAEjB,GAAKqC,EAAEgB,IAAIoC,EAAGzF,EAClB,CAEA,GAAIqoB,GAAS5iB,EAAIujB,EACf,IAAK,IAAIlqB,EAAI2G,EAAG3G,EAAIqF,EAAGrF,IACrB8pB,EAAEjT,IAAI7W,EAAG2G,EAAGpD,EAAEgB,IAAIvE,EAAG2G,IAIzB,GAAIA,EAAIwjB,EAAK,CACXhoB,EAAEwE,GAAK,EACP,IAAK,IAAI3G,EAAI2G,EAAI,EAAG3G,EAAI+D,EAAG/D,IACzBmC,EAAEwE,GAAKuiB,GAAW/mB,EAAEwE,GAAIxE,EAAEnC,IAE5B,GAAa,IAATmC,EAAEwE,GAAU,CACVxE,EAAEwE,EAAI,GAAK,IACbxE,EAAEwE,GAAK,EAAIxE,EAAEwE,IAEf,IAAK,IAAI3G,EAAI2G,EAAI,EAAG3G,EAAI+D,EAAG/D,IACzBmC,EAAEnC,IAAMmC,EAAEwE,GAEZxE,EAAEwE,EAAI,IAAM,CACd,CAEA,GADAxE,EAAEwE,IAAMxE,EAAEwE,GACNA,EAAI,EAAItB,GAAc,IAATlD,EAAEwE,GAAU,CAC3B,IAAK,IAAI3G,EAAI2G,EAAI,EAAG3G,EAAIqF,EAAGrF,IACzBgqB,EAAKhqB,GAAK,EAEZ,IAAK,IAAIA,EAAI2G,EAAI,EAAG3G,EAAIqF,EAAGrF,IACzB,IAAK,IAAIkB,EAAIyF,EAAI,EAAGzF,EAAI6C,EAAG7C,IACzB8oB,EAAKhqB,IAAMmC,EAAEjB,GAAKqC,EAAEgB,IAAIvE,EAAGkB,GAG/B,IAAK,IAAIA,EAAIyF,EAAI,EAAGzF,EAAI6C,EAAG7C,IAAK,CAC9B,IAAIgE,GAAK/C,EAAEjB,GAAKiB,EAAEwE,EAAI,GACtB,IAAK,IAAI3G,EAAI2G,EAAI,EAAG3G,EAAIqF,EAAGrF,IACzBuD,EAAEsT,IAAI7W,EAAGkB,EAAGqC,EAAEgB,IAAIvE,EAAGkB,GAAKgE,EAAI8kB,EAAKhqB,GAEvC,CACF,CACA,GAAIypB,EACF,IAAK,IAAIzpB,EAAI2G,EAAI,EAAG3G,EAAI+D,EAAG/D,IACzB+pB,EAAElT,IAAI7W,EAAG2G,EAAGxE,EAAEnC,GAGpB,CACF,CAEA,IAAIgF,EAAImD,KAAKwC,IAAI5G,EAAGsB,EAAI,GAYxB,GAXI6kB,EAAMnmB,IACRoB,EAAE+kB,GAAO3mB,EAAEgB,IAAI2lB,EAAKA,IAElB7kB,EAAIL,IACNG,EAAEH,EAAI,GAAK,GAETmlB,EAAM,EAAInlB,IACZ7C,EAAEgoB,GAAO5mB,EAAEgB,IAAI4lB,EAAKnlB,EAAI,IAE1B7C,EAAE6C,EAAI,GAAK,EAEPukB,EAAO,CACT,IAAK,IAAIroB,EAAIgpB,EAAKhpB,EAAI0oB,EAAI1oB,IAAK,CAC7B,IAAK,IAAIlB,EAAI,EAAGA,EAAIqF,EAAGrF,IACrB8pB,EAAEjT,IAAI7W,EAAGkB,EAAG,GAEd4oB,EAAEjT,IAAI3V,EAAGA,EAAG,EACd,CACA,IAAK,IAAIyF,EAAIujB,EAAM,EAAGvjB,GAAK,EAAGA,IAC5B,GAAa,IAATxB,EAAEwB,GAAU,CACd,IAAK,IAAIzF,EAAIyF,EAAI,EAAGzF,EAAI0oB,EAAI1oB,IAAK,CAC/B,IAAIgE,EAAI,EACR,IAAK,IAAIlF,EAAI2G,EAAG3G,EAAIqF,EAAGrF,IACrBkF,GAAK4kB,EAAEvlB,IAAIvE,EAAG2G,GAAKmjB,EAAEvlB,IAAIvE,EAAGkB,GAE9BgE,GAAKA,EAAI4kB,EAAEvlB,IAAIoC,EAAGA,GAClB,IAAK,IAAI3G,EAAI2G,EAAG3G,EAAIqF,EAAGrF,IACrB8pB,EAAEjT,IAAI7W,EAAGkB,EAAG4oB,EAAEvlB,IAAIvE,EAAGkB,GAAKgE,EAAI4kB,EAAEvlB,IAAIvE,EAAG2G,GAE3C,CACA,IAAK,IAAI3G,EAAI2G,EAAG3G,EAAIqF,EAAGrF,IACrB8pB,EAAEjT,IAAI7W,EAAG2G,GAAImjB,EAAEvlB,IAAIvE,EAAG2G,IAExBmjB,EAAEjT,IAAIlQ,EAAGA,EAAG,EAAImjB,EAAEvlB,IAAIoC,EAAGA,IACzB,IAAK,IAAI3G,EAAI,EAAGA,EAAI2G,EAAI,EAAG3G,IACzB8pB,EAAEjT,IAAI7W,EAAG2G,EAAG,EAEhB,KAAO,CACL,IAAK,IAAI3G,EAAI,EAAGA,EAAIqF,EAAGrF,IACrB8pB,EAAEjT,IAAI7W,EAAG2G,EAAG,GAEdmjB,EAAEjT,IAAIlQ,EAAGA,EAAG,EACd,CAEJ,CAEA,GAAI8iB,EACF,IAAK,IAAI9iB,EAAI5C,EAAI,EAAG4C,GAAK,EAAGA,IAAK,CAC/B,GAAIA,EAAIwjB,GAAgB,IAAThoB,EAAEwE,GACf,IAAK,IAAIzF,EAAIyF,EAAI,EAAGzF,EAAI6C,EAAG7C,IAAK,CAC9B,IAAIgE,EAAI,EACR,IAAK,IAAIlF,EAAI2G,EAAI,EAAG3G,EAAI+D,EAAG/D,IACzBkF,GAAK6kB,EAAExlB,IAAIvE,EAAG2G,GAAKojB,EAAExlB,IAAIvE,EAAGkB,GAE9BgE,GAAKA,EAAI6kB,EAAExlB,IAAIoC,EAAI,EAAGA,GACtB,IAAK,IAAI3G,EAAI2G,EAAI,EAAG3G,EAAI+D,EAAG/D,IACzB+pB,EAAElT,IAAI7W,EAAGkB,EAAG6oB,EAAExlB,IAAIvE,EAAGkB,GAAKgE,EAAI6kB,EAAExlB,IAAIvE,EAAG2G,GAE3C,CAEF,IAAK,IAAI3G,EAAI,EAAGA,EAAI+D,EAAG/D,IACrB+pB,EAAElT,IAAI7W,EAAG2G,EAAG,GAEdojB,EAAElT,IAAIlQ,EAAGA,EAAG,EACd,CAGF,IAAI0jB,EAAKrlB,EAAI,EACTslB,EAAO,EACPC,EAAMxX,OAAOyX,QACjB,KAAOxlB,EAAI,GAAG,CACZ,IAAI2B,EAAG8jB,EACP,IAAK9jB,EAAI3B,EAAI,EAAG2B,IAAM,IACT,IAAPA,EADmBA,IAAK,CAI5B,MAAM+jB,EACJ3X,OAAO4X,UAAYJ,EAAMpiB,KAAKgH,IAAIhK,EAAEwB,GAAKwB,KAAKgH,IAAIhK,EAAEwB,EAAI,KAC1D,GAAIwB,KAAKgH,IAAIhN,EAAEwE,KAAO+jB,GAAS3X,OAAO3K,MAAMjG,EAAEwE,IAAK,CACjDxE,EAAEwE,GAAK,EACP,KACF,CACF,CACA,GAAIA,IAAM3B,EAAI,EACZylB,EAAO,MACF,CACL,IAAIG,EACJ,IAAKA,EAAK5lB,EAAI,EAAG4lB,GAAMjkB,GACjBikB,IAAOjkB,EADaikB,IAAM,CAI9B,IAAI1lB,GACD0lB,IAAO5lB,EAAImD,KAAKgH,IAAIhN,EAAEyoB,IAAO,IAC7BA,IAAOjkB,EAAI,EAAIwB,KAAKgH,IAAIhN,EAAEyoB,EAAK,IAAM,GACxC,GAAIziB,KAAKgH,IAAIhK,EAAEylB,KAAQL,EAAMrlB,EAAG,CAC9BC,EAAEylB,GAAM,EACR,KACF,CACF,CACIA,IAAOjkB,EACT8jB,EAAO,EACEG,IAAO5lB,EAAI,EACpBylB,EAAO,GAEPA,EAAO,EACP9jB,EAAIikB,EAER,CAIA,OAFAjkB,IAEQ8jB,GACN,KAAK,EAAG,CACN,IAAIjoB,EAAIL,EAAE6C,EAAI,GACd7C,EAAE6C,EAAI,GAAK,EACX,IAAK,IAAI9D,EAAI8D,EAAI,EAAG9D,GAAKyF,EAAGzF,IAAK,CAC/B,IAAIgE,EAAIgkB,GAAW/jB,EAAEjE,GAAIsB,GACrBqoB,EAAK1lB,EAAEjE,GAAKgE,EACZ4lB,EAAKtoB,EAAI0C,EAMb,GALAC,EAAEjE,GAAKgE,EACHhE,IAAMyF,IACRnE,GAAKsoB,EAAK3oB,EAAEjB,EAAI,GAChBiB,EAAEjB,EAAI,GAAK2pB,EAAK1oB,EAAEjB,EAAI,IAEpBuoB,EACF,IAAK,IAAIzpB,EAAI,EAAGA,EAAI+D,EAAG/D,IACrBkF,EAAI2lB,EAAKd,EAAExlB,IAAIvE,EAAGkB,GAAK4pB,EAAKf,EAAExlB,IAAIvE,EAAGgF,EAAI,GACzC+kB,EAAElT,IAAI7W,EAAGgF,EAAI,GAAI8lB,EAAKf,EAAExlB,IAAIvE,EAAGkB,GAAK2pB,EAAKd,EAAExlB,IAAIvE,EAAGgF,EAAI,IACtD+kB,EAAElT,IAAI7W,EAAGkB,EAAGgE,EAGlB,CACA,KACF,CACA,KAAK,EAAG,CACN,IAAI1C,EAAIL,EAAEwE,EAAI,GACdxE,EAAEwE,EAAI,GAAK,EACX,IAAK,IAAIzF,EAAIyF,EAAGzF,EAAI8D,EAAG9D,IAAK,CAC1B,IAAIgE,EAAIgkB,GAAW/jB,EAAEjE,GAAIsB,GACrBqoB,EAAK1lB,EAAEjE,GAAKgE,EACZ4lB,EAAKtoB,EAAI0C,EAIb,GAHAC,EAAEjE,GAAKgE,EACP1C,GAAKsoB,EAAK3oB,EAAEjB,GACZiB,EAAEjB,GAAK2pB,EAAK1oB,EAAEjB,GACVqoB,EACF,IAAK,IAAIvpB,EAAI,EAAGA,EAAIqF,EAAGrF,IACrBkF,EAAI2lB,EAAKf,EAAEvlB,IAAIvE,EAAGkB,GAAK4pB,EAAKhB,EAAEvlB,IAAIvE,EAAG2G,EAAI,GACzCmjB,EAAEjT,IAAI7W,EAAG2G,EAAI,GAAImkB,EAAKhB,EAAEvlB,IAAIvE,EAAGkB,GAAK2pB,EAAKf,EAAEvlB,IAAIvE,EAAG2G,EAAI,IACtDmjB,EAAEjT,IAAI7W,EAAGkB,EAAGgE,EAGlB,CACA,KACF,CACA,KAAK,EAAG,CACN,MAAM4d,EAAQ3a,KAAKD,IACjBC,KAAKgH,IAAIhK,EAAEH,EAAI,IACfmD,KAAKgH,IAAIhK,EAAEH,EAAI,IACfmD,KAAKgH,IAAIhN,EAAE6C,EAAI,IACfmD,KAAKgH,IAAIhK,EAAEwB,IACXwB,KAAKgH,IAAIhN,EAAEwE,KAEPokB,EAAK5lB,EAAEH,EAAI,GAAK8d,EAChBkI,EAAO7lB,EAAEH,EAAI,GAAK8d,EAClBmI,EAAO9oB,EAAE6C,EAAI,GAAK8d,EAClBoI,EAAK/lB,EAAEwB,GAAKmc,EACZqI,EAAKhpB,EAAEwE,GAAKmc,EACZtf,IAAMwnB,EAAOD,IAAOC,EAAOD,GAAME,EAAOA,GAAQ,EAChDjpB,EAAI+oB,EAAKE,GAAQF,EAAKE,GAC5B,IAAIG,EAAQ,EACF,IAAN5nB,GAAiB,IAANxB,IAEXopB,EADE5nB,EAAI,EACE,EAAI2E,KAAKyH,KAAKpM,EAAIA,EAAIxB,GAEtBmG,KAAKyH,KAAKpM,EAAIA,EAAIxB,GAE5BopB,EAAQppB,GAAKwB,EAAI4nB,IAEnB,IAAI5oB,GAAK0oB,EAAKH,IAAOG,EAAKH,GAAMK,EAC5BC,EAAIH,EAAKC,EACb,IAAK,IAAIjqB,EAAIyF,EAAGzF,EAAI8D,EAAI,EAAG9D,IAAK,CAC9B,IAAIgE,EAAIgkB,GAAW1mB,EAAG6oB,GACZ,IAANnmB,IAASA,EAAI6N,OAAO4X,WACxB,IAAIE,EAAKroB,EAAI0C,EACT4lB,EAAKO,EAAInmB,EAQb,GAPIhE,IAAMyF,IACRxE,EAAEjB,EAAI,GAAKgE,GAEb1C,EAAIqoB,EAAK1lB,EAAEjE,GAAK4pB,EAAK3oB,EAAEjB,GACvBiB,EAAEjB,GAAK2pB,EAAK1oB,EAAEjB,GAAK4pB,EAAK3lB,EAAEjE,GAC1BmqB,EAAIP,EAAK3lB,EAAEjE,EAAI,GACfiE,EAAEjE,EAAI,GAAK2pB,EAAK1lB,EAAEjE,EAAI,GAClBuoB,EACF,IAAK,IAAIzpB,EAAI,EAAGA,EAAI+D,EAAG/D,IACrBkF,EAAI2lB,EAAKd,EAAExlB,IAAIvE,EAAGkB,GAAK4pB,EAAKf,EAAExlB,IAAIvE,EAAGkB,EAAI,GACzC6oB,EAAElT,IAAI7W,EAAGkB,EAAI,GAAI4pB,EAAKf,EAAExlB,IAAIvE,EAAGkB,GAAK2pB,EAAKd,EAAExlB,IAAIvE,EAAGkB,EAAI,IACtD6oB,EAAElT,IAAI7W,EAAGkB,EAAGgE,GAYhB,GATAA,EAAIgkB,GAAW1mB,EAAG6oB,GACR,IAANnmB,IAASA,EAAI6N,OAAO4X,WACxBE,EAAKroB,EAAI0C,EACT4lB,EAAKO,EAAInmB,EACTC,EAAEjE,GAAKgE,EACP1C,EAAIqoB,EAAK1oB,EAAEjB,GAAK4pB,EAAK3lB,EAAEjE,EAAI,GAC3BiE,EAAEjE,EAAI,IAAM4pB,EAAK3oB,EAAEjB,GAAK2pB,EAAK1lB,EAAEjE,EAAI,GACnCmqB,EAAIP,EAAK3oB,EAAEjB,EAAI,GACfiB,EAAEjB,EAAI,GAAK2pB,EAAK1oB,EAAEjB,EAAI,GAClBqoB,GAASroB,EAAImE,EAAI,EACnB,IAAK,IAAIrF,EAAI,EAAGA,EAAIqF,EAAGrF,IACrBkF,EAAI2lB,EAAKf,EAAEvlB,IAAIvE,EAAGkB,GAAK4pB,EAAKhB,EAAEvlB,IAAIvE,EAAGkB,EAAI,GACzC4oB,EAAEjT,IAAI7W,EAAGkB,EAAI,GAAI4pB,EAAKhB,EAAEvlB,IAAIvE,EAAGkB,GAAK2pB,EAAKf,EAAEvlB,IAAIvE,EAAGkB,EAAI,IACtD4oB,EAAEjT,IAAI7W,EAAGkB,EAAGgE,EAGlB,CACA/C,EAAE6C,EAAI,GAAKxC,EACX8nB,GAAc,EACd,KACF,CACA,KAAK,EACH,GAAInlB,EAAEwB,IAAM,IACVxB,EAAEwB,GAAKxB,EAAEwB,GAAK,GAAKxB,EAAEwB,GAAK,EACtB8iB,GACF,IAAK,IAAIzpB,EAAI,EAAGA,GAAKqqB,EAAIrqB,IACvB+pB,EAAElT,IAAI7W,EAAG2G,GAAIojB,EAAExlB,IAAIvE,EAAG2G,IAI5B,KAAOA,EAAI0jB,KACLllB,EAAEwB,IAAMxB,EAAEwB,EAAI,KADL,CAIb,IAAIzB,EAAIC,EAAEwB,GAGV,GAFAxB,EAAEwB,GAAKxB,EAAEwB,EAAI,GACbxB,EAAEwB,EAAI,GAAKzB,EACPukB,GAAS9iB,EAAI5C,EAAI,EACnB,IAAK,IAAI/D,EAAI,EAAGA,EAAI+D,EAAG/D,IACrBkF,EAAI6kB,EAAExlB,IAAIvE,EAAG2G,EAAI,GACjBojB,EAAElT,IAAI7W,EAAG2G,EAAI,EAAGojB,EAAExlB,IAAIvE,EAAG2G,IACzBojB,EAAElT,IAAI7W,EAAG2G,EAAGzB,GAGhB,GAAIqkB,GAAS5iB,EAAItB,EAAI,EACnB,IAAK,IAAIrF,EAAI,EAAGA,EAAIqF,EAAGrF,IACrBkF,EAAI4kB,EAAEvlB,IAAIvE,EAAG2G,EAAI,GACjBmjB,EAAEjT,IAAI7W,EAAG2G,EAAI,EAAGmjB,EAAEvlB,IAAIvE,EAAG2G,IACzBmjB,EAAEjT,IAAI7W,EAAG2G,EAAGzB,GAGhByB,GACF,CACA2jB,EAAO,EACPtlB,IAKN,CAEA,GAAI0kB,EAAS,CACX,IAAInR,EAAMwR,EACVA,EAAID,EACJA,EAAIvR,CACN,CAEA/Z,KAAK6G,EAAIA,EACT7G,KAAKuF,EAAIA,EACTvF,KAAK2G,EAAIA,EACT3G,KAAKsrB,EAAIA,EACTtrB,KAAKurB,EAAIA,CACX,CAEAuB,MAAMzmB,GACJ,IAAI0mB,EAAI1mB,EACJ1C,EAAI3D,KAAKgtB,UACTC,EAAQjtB,KAAK2G,EAAEjF,OACfwrB,EAAK/U,GAAOM,MAAMwU,EAAOA,GAE7B,IAAK,IAAIzrB,EAAI,EAAGA,EAAIyrB,EAAOzrB,IACrBmI,KAAKgH,IAAI3Q,KAAK2G,EAAEnF,KAAOmC,EACzBupB,EAAG7U,IAAI7W,EAAGA,EAAG,GAEb0rB,EAAG7U,IAAI7W,EAAGA,EAAG,EAAIxB,KAAK2G,EAAEnF,IAI5B,IAAI8pB,EAAItrB,KAAKsrB,EACTC,EAAIvrB,KAAKmtB,qBAETC,EAAK7B,EAAEpO,KAAK+P,GACZG,EAAQ9B,EAAE5Z,KACV2b,EAAQhC,EAAE3Z,KACV4b,EAAMpV,GAAOM,MAAM4U,EAAOC,GAE9B,IAAK,IAAI9rB,EAAI,EAAGA,EAAI6rB,EAAO7rB,IACzB,IAAK,IAAIkB,EAAI,EAAGA,EAAI4qB,EAAO5qB,IAAK,CAC9B,IAAIqa,EAAM,EACV,IAAK,IAAI5U,EAAI,EAAGA,EAAI8kB,EAAO9kB,IACzB4U,GAAOqQ,EAAGrnB,IAAIvE,EAAG2G,GAAKmjB,EAAEvlB,IAAIrD,EAAGyF,GAEjColB,EAAIlV,IAAI7W,EAAGkB,EAAGqa,EAChB,CAGF,OAAOwQ,EAAIpQ,KAAK4P,EAClB,CAEAS,iBAAiBnnB,GACf,OAAOrG,KAAK8sB,MAAM3U,GAAOyE,KAAKvW,GAChC,CAEAonB,UACE,IAAIlC,EAAIvrB,KAAKurB,EACT5nB,EAAI3D,KAAKgtB,UACTK,EAAQ9B,EAAE5Z,KACV+b,EAAQnC,EAAExZ,QACV4b,EAAI,IAAIxV,GAAOkV,EAAOrtB,KAAK2G,EAAEjF,QAEjC,IAAK,IAAIF,EAAI,EAAGA,EAAI6rB,EAAO7rB,IACzB,IAAK,IAAIkB,EAAI,EAAGA,EAAIgrB,EAAOhrB,IACrBiH,KAAKgH,IAAI3Q,KAAK2G,EAAEjE,IAAMiB,GACxBgqB,EAAEtV,IAAI7W,EAAGkB,EAAG6oB,EAAExlB,IAAIvE,EAAGkB,GAAK1C,KAAK2G,EAAEjE,IAKvC,IAAI4oB,EAAItrB,KAAKsrB,EAETgC,EAAQhC,EAAE3Z,KACVic,EAAQtC,EAAEvZ,QACVgb,EAAI,IAAI5U,GAAOkV,EAAOC,GAE1B,IAAK,IAAI9rB,EAAI,EAAGA,EAAI6rB,EAAO7rB,IACzB,IAAK,IAAIkB,EAAI,EAAGA,EAAI4qB,EAAO5qB,IAAK,CAC9B,IAAIqa,EAAM,EACV,IAAK,IAAI5U,EAAI,EAAGA,EAAIylB,EAAOzlB,IACzB4U,GAAO4Q,EAAE5nB,IAAIvE,EAAG2G,GAAKmjB,EAAEvlB,IAAIrD,EAAGyF,GAEhC4kB,EAAE1U,IAAI7W,EAAGkB,EAAGqa,EACd,CAGF,OAAOgQ,CACT,CAEIc,gBACF,OAAO7tB,KAAK2G,EAAE,GAAK3G,KAAK2G,EAAEgD,KAAKwC,IAAInM,KAAK6G,EAAG7G,KAAKuF,GAAK,EACvD,CAEIuoB,YACF,OAAO9tB,KAAK2G,EAAE,EAChB,CAEIonB,WACF,IAAIC,EAAMrkB,KAAKD,IAAI1J,KAAK6G,EAAG7G,KAAKuF,GAAKvF,KAAK2G,EAAE,GAAK4N,OAAOyX,QACpD9lB,EAAI,EACJS,EAAI3G,KAAK2G,EACb,IAAK,IAAInF,EAAI,EAAGmM,EAAKhH,EAAEjF,OAAQF,EAAImM,EAAInM,IACjCmF,EAAEnF,GAAKwsB,GACT9nB,IAGJ,OAAOA,CACT,CAEIif,eACF,OAAOvjB,MAAMwF,KAAKpH,KAAK2G,EACzB,CAEIqmB,gBACF,OAAQzY,OAAOyX,QAAU,EAAKriB,KAAKD,IAAI1J,KAAK6G,EAAG7G,KAAKuF,GAAKvF,KAAK2G,EAAE,EAClE,CAEIsnB,0BACF,OAAOjuB,KAAKsrB,CACd,CAEI6B,2BACF,OAAOntB,KAAKurB,CACd,CAEI2C,qBACF,OAAO/V,GAAOyE,KAAK5c,KAAK2G,EAC1B,ECjgBF,IAAM,GAAqD,CACzDqE,OAAQ,CAAC,EAAG,GACZmjB,aAAc,IAkBhB,cAGE,WAAmBzjB,QAAA,IAAAA,IAAAA,EAA4B,CAAC,GAA7B,KAAAA,QAAAA,EAFnB,KAAA3G,GAAK,MAGHxE,OAAO2E,OAAOlE,KAAK0K,QAAS,GAAyBA,EACvD,CAwGF,OAnGE,YAAAC,QAAA,SAAQC,EAAcF,GACpB,OAAO1K,KAAKouB,kBAAiB,EAAOxjB,EAAOF,EAC7C,EAIA,YAAAxG,OAAA,SAAO0G,EAAcF,GACnB1K,KAAKouB,kBAAiB,EAAMxjB,EAAOF,EACrC,EAEQ,YAAA0jB,iBAAR,SACElqB,EACA0G,EACAF,GAEA,IAAMK,EAAgB,OAAK/K,KAAK0K,SAAYA,GAE1C,EAIEK,EAAa,OAJfC,OAAM,IAAG,GAAC,EAAG,GAAE,EACf,EAGED,EAAa,aAHfojB,OAAY,IAAG,KAAE,EACjBhjB,EAEEJ,EAAa,iBADfK,EACEL,EAAa,YAEbzC,EAAQsC,EAAMS,cACd9C,EAAQqC,EAAMU,cAWlB,GATKH,IACH7C,EAAQA,EAAMiD,QACZ,SAAC7C,GAAS,OAAAA,EAAK7E,KAAK2H,cAAiChJ,IAAtBkG,EAAK7E,KAAK2H,OAA/B,IAEZjD,EAAQA,EAAMgD,QACZ,SAACE,GAAS,OAAAA,EAAK5H,KAAK2H,cAAiChJ,IAAtBiJ,EAAK5H,KAAK2H,OAA/B,MAITlD,GAA0B,IAAjBA,EAAM5G,OAAc,CAChC,IAAM,EAAS,CAAE4G,MAAO,GAAIC,MAAK,GAEjC,OADA6C,SAAAA,EAAc,GACP,C,CAET,GAAqB,IAAjB9C,EAAM5G,OAAc,CAClBwC,GACF0G,EAAMkB,cAAcxD,EAAM,GAAGvE,GAAI,CAC/BgI,EAAGf,EAAO,GACVgB,EAAGhB,EAAO,KAGd,IAAM,EAAS,CACb1C,MAAO,C,OAEAA,EAAM,IAAE,CACXzE,KAAM,OACDyE,EAAM,GAAGzE,MAAI,CAChBkI,EAAGf,EAAO,GACVgB,EAAGhB,EAAO,QAIhBzC,MAAK,GAGP,OADA6C,SAAAA,EAAc,GACP,C,CAIT,IAAMrD,EAAYK,EAAa,CAAEE,MAAK,EAAEC,MAAK,IAAI,GAC3C8lB,EAAYvmB,EAAcC,GAChCumB,GAAeD,GAGf,IAAME,EnBkBiB,SAAC/lB,EAAkBgmB,GAC5C,IAAMnqB,EAAmB,GAQzB,OAPAmE,EAAO5D,SAAQ,SAACwO,GACd,IAAM6S,EAAmB,GACzB7S,EAAIxO,SAAQ,SAACuE,GACX8c,EAAOzlB,KAAK2I,EAAIqlB,EAClB,IACAnqB,EAAO7D,KAAKylB,EACd,IACO5hB,CACT,CmB5BoBoqB,CAAYJ,EAAWF,GAGjCpf,EAAY2f,GAAOH,GACnBliB,EAAyB,GAC/B0C,EAAUnK,SAAQ,SAAC4B,EAAahF,GAC9B,IAAMmtB,EAAQ3lB,EAAMV,EAAM9G,IAC1BmtB,EAAM9qB,KAAKkI,EAAIvF,EAAE,GAAKwE,EAAO,GAC7B2jB,EAAM9qB,KAAKmI,EAAIxF,EAAE,GAAKwE,EAAO,GAC7BqB,EAAY7L,KAAKmuB,EACnB,IAEIzqB,GACFmI,EAAYzH,SAAQ,SAAC8D,GACnB,OAAAkC,EAAMkB,cAAcpD,EAAK3E,GAAI,CAC3BgI,EAAGrD,EAAK7E,KAAKkI,EACbC,EAAGtD,EAAK7E,KAAKmI,GAFf,IAOJ,IAAM3H,EAAS,CACbiE,MAAO+D,EACP9D,MAAK,GAIP,OAFA6C,SAAAA,EAAc/G,GAEPA,CACT,EACF,EA7GA,GA+GMiqB,GAAiB,SAACD,GACtB,IAAIO,GAAe,OACnBP,EAAUzpB,SAAQ,SAACwO,GACjBA,EAAIxO,SAAQ,SAACyB,GACPA,IAAU6B,KAGV0mB,EAAcvoB,IAChBuoB,EAAcvoB,EAElB,GACF,IACAgoB,EAAUzpB,SAAQ,SAACwO,EAAK5R,GACtB4R,EAAIxO,SAAQ,SAACyB,EAAO3D,GACd2D,IAAU6B,MACZmmB,EAAU7sB,GAAGkB,GAAKksB,EAEtB,GACF,GACF,EAMMF,GAAS,SAACL,GACd,IAGMQ,EAAI,OAAa,OAAaR,EAAW,IAAK,IAG9CS,EAAWD,EAAEnL,KAAK,OAClBqL,EAAWF,EAAEnL,KAAK,UAClBsL,EAAYH,EAAEnL,OACpBmL,EAAE1N,IAAI6N,GACH3T,aAAayT,GACbrT,gBAAgBsT,GAInB,IAAME,EAAM,IAAItE,GAA2BkE,GACrCK,EAAc,QAAcD,EAAIf,gBAAgB/I,WACtD,OAAO8J,EAAIhB,oBAAoB/U,SAAS9P,KAAI,SAACgK,GAC3C,OAAO,OAAa,CAACA,GAAM,CAAC8b,IACzBhW,SAAS,GACT4M,OAAO,EApBM,EAqBlB,GACF,EC5KM,GAAiE,CACrEqJ,WAAY,GACZrlB,OAAQ,GACRD,MAAO,GACPulB,MAAO,IACPC,QAAS,GACTlnB,EAAG,GAuBCmnB,GAAe,SAAChnB,EAAeyG,EAAoBwgB,EAAepnB,EAAWqnB,EAAiBC,GAClG1gB,EAAUnK,SAAQ,SAACuE,EAAU3H,GAC3B+tB,EAAK/tB,GAAK,CAAEuK,EAAG,EAAGC,EAAG,GACrB+C,EAAUnK,SAAQ,SAAC8qB,EAAUhtB,GAC3B,GAAIlB,IAAMkB,GAIN8sB,EAAMhuB,KAAOguB,EAAM9sB,GAAvB,CAGA,IAAIitB,EAAOxmB,EAAE4C,EAAI2jB,EAAE3jB,EACf6jB,EAAOzmB,EAAE6C,EAAI0jB,EAAE1jB,EACf6jB,EAAYlmB,KAAKyH,KAAKue,EAAOA,EAAOC,EAAOA,GAC/C,GAAkB,IAAdC,EAAiB,CACnBA,EAAY,EACZ,IAAM7F,EAAOxoB,EAAIkB,EAAI,GAAK,EAC1BitB,EAAO,IAAO3F,EACd4F,EAAO,IAAO5F,C,CAGhB,GAAI6F,EAAYJ,EAAannB,EAAM9G,IAAM,EAAIiuB,EAAannB,EAAM5F,IAAM,EAAG,CACvE,IAAMotB,EAAU3nB,EAAIA,EAAK0nB,EACzBN,EAAK/tB,GAAGuK,GAAM4jB,EAAOE,EAAaC,EAClCP,EAAK/tB,GAAGwK,GAAM4jB,EAAOC,EAAaC,C,EAEtC,GACF,GACF,EAEMC,GAAkB,SAAChhB,EAAoBwgB,EAAeH,EAAeY,EAAuBC,EAAkBC,EAAqBrmB,EAAe2lB,GACtJ,IAAMW,EAAUD,GAAermB,EAAQ,GA0CvC,OAzCImmB,GACFT,EAAK3qB,SAAQ,SAACwrB,EAAI5uB,GAChB,IAAM6uB,EAAKthB,EAAUvN,GAAGuK,EAAIgD,EAAUkhB,GAAUlkB,EAC1CukB,EAAKvhB,EAAUvN,GAAGwK,EAAI+C,EAAUkhB,GAAUjkB,EAC1CukB,EAAU5mB,KAAKyH,KAAKif,EAAKA,EAAKC,EAAKA,GACrCE,EAAMF,EAAKC,EACXE,GAAOJ,EAAKE,EACVG,EAAW/mB,KAAKyH,KAAKgf,EAAGrkB,EAAIqkB,EAAGrkB,EAAIqkB,EAAGpkB,EAAIokB,EAAGpkB,GAC/CkgB,EAAQviB,KAAKsf,MAAMuH,EAAMJ,EAAGrkB,EAAI0kB,EAAML,EAAGpkB,GAAK0kB,GAC9CxE,EAAQviB,KAAKU,GAAK,IACpB6hB,GAASviB,KAAKU,GAAK,EACnBmmB,IAAQ,EACRC,IAAQ,GAEV,IAAME,EAAchnB,KAAKsD,IAAIif,GAASwE,EACtCN,EAAGrkB,EAAIykB,EAAMG,EACbP,EAAGpkB,EAAIykB,EAAME,CACf,IAIF5hB,EAAUnK,SAAQ,SAACW,EAAG/D,GACpB,GAAIA,IAAMyuB,EAAV,CAGA,IAAMW,EAAajnB,KAAKyH,KAAKme,EAAK/tB,GAAGuK,EAAIwjB,EAAK/tB,GAAGuK,EAAIwjB,EAAK/tB,GAAGwK,EAAIujB,EAAK/tB,GAAGwK,GACzE,GAAI4kB,EAAa,GAAKpvB,IAAMyuB,EAAU,CACpC,IAAMY,EAAclnB,KAAKwC,IAAIgkB,GAAWf,EAzGxB,KAyGgDwB,GAGhE,GAFArrB,EAAEwG,GAAMwjB,EAAK/tB,GAAGuK,EAAI6kB,EAAcC,EAClCtrB,EAAEyG,GAAMujB,EAAK/tB,GAAGwK,EAAI4kB,EAAcC,EAC9Bb,EAAc,CAChB,IAAIK,EAAK9qB,EAAEwG,EAAIgD,EAAUkhB,GAAUlkB,EAC/BukB,EAAK/qB,EAAEyG,EAAI+C,EAAUkhB,GAAUjkB,EAC7B8kB,EAAQnnB,KAAKyH,KAAKif,EAAKA,EAAKC,EAAKA,GACvCD,EAAMA,EAAKS,EAAStB,EAAMhuB,GAC1B8uB,EAAMA,EAAKQ,EAAStB,EAAMhuB,GAC1B+D,EAAEwG,EAAIgD,EAAUkhB,GAAUlkB,EAAIskB,EAC9B9qB,EAAEyG,EAAI+C,EAAUkhB,GAAUjkB,EAAIskB,C,GAGpC,IACOvhB,CACT,ECrHM,GAAwD,CAC5DgiB,aAAc,IACdC,UAAW,KACXC,WAAY,KACZ9C,aAAc,GACd7e,gBAAgB,EAChBH,cAAU3M,EACV6M,iBAAa7M,EACbwtB,cAAc,EACdkB,2BAA4B,IAC5BxhB,YAAQlN,EACR2uB,aAAc,IAkBhB,cAGE,WAAmBzmB,QAAA,IAAAA,IAAAA,EAA+B,CAAC,GAAhC,KAAAA,QAAAA,EAFnB,KAAA3G,GAAK,SAGHxE,OAAO2E,OAAOlE,KAAK0K,QAAS,GAAyBA,EACvD,CAgPF,OA3OE,YAAAC,QAAA,SAAQC,EAAcF,GACpB,OAAO1K,KAAKoxB,qBAAoB,EAAOxmB,EAAOF,EAChD,EAIA,YAAAxG,OAAA,SAAO0G,EAAcF,GACnB1K,KAAKoxB,qBAAoB,EAAMxmB,EAAOF,EACxC,EAEQ,YAAA0mB,oBAAR,SAA4BltB,EAAiB0G,EAAcF,GACzD,IAAMK,EAAgB,OAAK/K,KAAK0K,SAAYA,GAEnCmF,EAgBL9E,EAAa,MAfP+E,EAeN/E,EAAa,OAdP6E,EAcN7E,EAAa,OAbJsmB,EAaTtmB,EAAa,UAZHumB,EAYVvmB,EAAa,WAXfoE,EAWEpE,EAAa,SAVfsE,EAUEtE,EAAa,YATfilB,EASEjlB,EAAa,aARfuE,EAQEvE,EAAa,eAPfmmB,EAOEnmB,EAAa,2BANf2E,EAME3E,EAAa,OALf,EAKEA,EAAa,aALfojB,OAAY,IAAG,KAAE,EACjB,EAIEpjB,EAAa,aAJfomB,OAAY,IAAG,KAAE,EACjB,EAGEpmB,EAAa,aAHfgmB,OAAY,IAAG,MAAI,EACnB5lB,EAEEJ,EAAa,iBADfK,EACEL,EAAa,YAEbzC,EAAQsC,EAAMS,cACd9C,EAAQqC,EAAMU,cAOlB,GALKH,IACH7C,EAAQA,EAAMiD,QAAO,SAAA7C,GAAQ,OAAAA,EAAK7E,KAAK2H,cAAiChJ,IAAtBkG,EAAK7E,KAAK2H,OAA/B,IAC7BjD,EAAQA,EAAMgD,QAAO,SAAAE,GAAQ,OAAAA,EAAK5H,KAAK2H,cAAiChJ,IAAtBiJ,EAAK5H,KAAK2H,OAA/B,MAG1BlD,GAA0B,IAAjBA,EAAM5G,OAAc,CAChC,IAAM,EAAS,CAAE4G,MAAO,GAAIC,MAAK,GAEjC,OADA6C,SAAAA,EAAc,GACP,C,CAGT,IAAMvB,EAASgG,GAAgC,oBAAXjC,OAA6CiC,EAApBjC,OAAOC,WAC9D/D,EAAUgG,GAAiC,oBAAXlC,OAA8CkC,EAArBlC,OAAOE,YAChE9C,EAAU4E,GAAc,CAAC/F,EAAQ,EAAGC,EAAS,GAEnD,GAAqB,IAAjBxB,EAAM5G,OAAc,CAClBwC,GACF0G,EAAMkB,cAAcxD,EAAM,GAAGvE,GAAI,CAC/BgI,EAAGf,EAAO,GACVgB,EAAGhB,EAAO,KAGd,IAAM,EAAS,CACb1C,MAAO,C,OAEAA,EAAM,IAAE,CACXzE,KAAM,OACDyE,EAAM,GAAGzE,MAAI,CAChBkI,EAAGf,EAAO,GACVgB,EAAGhB,EAAO,QAIhBzC,MAAK,GAGP,OADA6C,SAAAA,EAAc,GACP,C,CAGT,IAAI4lB,EAAY1oB,EAAM,GACtB,GAAIhB,EAAS+pB,IACX,IAAK,IAAI7vB,EAAI,EAAGA,EAAI8G,EAAM5G,OAAQF,IAChC,GAAI8G,EAAM9G,GAAGuC,KAAOstB,EAAgB,CAClCL,EAAY1oB,EAAM9G,GAClB,K,OAIJwvB,EAAYK,GAAkB/oB,EAAM,GAItC,IAAMipB,EAAaC,GAAalpB,EAAO0oB,EAAUjtB,IAG3CgE,EAAYK,EAAa,CAAEE,MAAK,EAAEC,MAAK,IAAI,GAC3C8lB,EAAYvmB,EAAcC,GAC1B6mB,EAAc6C,GAAWpD,EAAWkD,GAE1C,GAAelD,EAAWkD,EAAY3C,EAAc,GAGpD,IAAM8C,EAAarD,EAAUkD,GACzBI,EACF9nB,EAAQmB,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKnB,EAAQmB,EAAO,GACzD4mB,EACF9nB,EAASkB,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKlB,EAASkB,EAAO,GAC7C,IAAd2mB,IACFA,EAAY9nB,EAAQ,GAEH,IAAf+nB,IACFA,EAAa9nB,EAAS,GAGxB,IAAM+nB,EAAYloB,KAAKwC,IAAIwlB,EAAWC,GAChCE,EAAOnoB,KAAKD,IAAG,MAARC,KAAI,OAAQ+nB,IAAU,IAE7BlC,EAAkB,GAClByB,EAAcK,GAAmBO,EAAYC,EACnDJ,EAAW9sB,SAAQ,SAACyB,EAAO7E,GACzBguB,EAAMhuB,GAAK6E,EAAQ4qB,CACrB,IAEA,IAWIxB,EAXEsC,EAAiBC,GAAgB1pB,EAAO+lB,EAAWF,EAAcqB,EAAOyB,EAAYvhB,EAAQyhB,GAE5Fc,EAAUC,GAAgBH,GAG5BhjB,ECnKW,SAACojB,EAAmB9D,EAAqBF,GAC1D,IAEE,IAAMU,EAAI,OAAa,OAAaR,EAAW,IAAK,IAG9CS,EAAWD,EAAEnL,KAAK,OAClBqL,EAAWF,EAAEnL,KAAK,UAClBsL,EAAYH,EAAEnL,OACpBmL,EAAE1N,IAAI6N,GAAW3T,aAAayT,GAAUrT,gBAAgBsT,GAIxD,IAAME,EAAM,IAAItE,GAA2BkE,GACrC,EAAc,QAAcI,EAAIf,gBAAgB/I,WACtD,OAAO8J,EAAIhB,oBAAoB/U,SAAS9P,KAAI,SAACgK,GAC3C,OAAO,OAAa,CAACA,GAAM,CAAC,IAAc8F,SAAS,GAAG4M,OAAO,EAAGqM,EAClE,G,CACA,SAEA,IADA,IAAMnf,EAAoB,GACjBxR,EAAI,EAAGA,EAAI6sB,EAAU3sB,OAAQF,IAAK,CACzC,IAAMuK,EAAIpC,KAAK4O,SAAW4V,EACpBniB,EAAIrC,KAAK4O,SAAW4V,EAC1Bnb,EAAIxS,KAAK,CAACuL,EAAGC,G,CAEf,OAAOgH,C,CAEX,CDwI6Bof,CAAIjE,EAAc4D,EAAgB5D,GAAc/kB,KAAI,SAAC,G,IAAA,SAAC2C,EAAC,KAAEC,EAAC,KAAM,OACvFD,GAAInC,MAAMmC,GAAKpC,KAAK4O,SAAW4V,EAAepiB,GAAKgD,EAAUwiB,GAAYxlB,EACzEC,GAAIpC,MAAMoC,GAAKrC,KAAK4O,SAAW4V,EAAeniB,GAAK+C,EAAUwiB,GAAYvlB,EAFc,IAQzF,GAHAhM,KAAKqyB,IAAItB,EAAchiB,EAAWkjB,EAASF,EAAgBvC,EAAO+B,GAG9DjiB,EAAgB,CAClBmgB,EAAe6C,GAAenjB,EAAUE,GACxC,IAAMkjB,EAAsD,CAC1DjqB,MAAK,EACLmnB,aAAY,EACZ1gB,UAAS,EACTygB,MAAK,EACL1lB,OAAM,EACND,MAAK,EACLmmB,aAAchF,QAAQgF,GACtBC,SAAUsB,EACVpC,WAAY+B,GAA8B,IAC1C/oB,EAAG4G,EAAUrN,OAAS,KAExBqN,EDhK+B,SAACnE,EAAcF,GASlD,IARA,IAAMK,EAAgB,OAAK,IAA4BL,GAC/CqE,EAAmGhE,EAAa,UAArGokB,EAAwFpkB,EAAa,WAAzFlB,EAA4EkB,EAAa,MAAlF5C,EAAqE4C,EAAa,EAA/E,EAAkEA,EAAa,MAA/EqkB,OAAK,IAAG,MAAG,EAAEY,EAAqDjlB,EAAa,aAApDklB,EAAuCllB,EAAa,SAA1C,EAA6BA,EAAa,MAA1CykB,OAAK,IAAG,KAAE,EAAEC,EAAiB1kB,EAAa,aAElHzC,EAAQsC,EAAMS,cAEdkkB,EAAgB,GAChBW,EAAcrmB,EAAQ,GAEnBrI,EAAI,EAAGA,EAAI2tB,EAAY3tB,IAC9BuN,EAAUnK,SAAQ,SAAC+C,EAAUQ,GAC3BonB,EAAKpnB,GAAK,CAAE4D,EAAG,EAAGC,EAAG,EACvB,IAEAsjB,GAAahnB,EAAOyG,EAAWwgB,EAAMpnB,EAAGqnB,EAAOC,GAC/CM,GAAgBhhB,EAAWwgB,EAAMH,EAAOY,EAAcC,EAAUC,EAAarmB,EAAO2lB,GAEtF,OAAOzgB,CACT,CC8IkByjB,CAAsB5nB,EAAO2nB,E,CAG3C,IAAMlmB,GAAyB,GAC/B0C,EAAUnK,SAAQ,SAAC4B,EAAUhF,GAC3B6K,GAAY7L,KAAK,OACZ8H,EAAM9G,IAAE,CACXqC,KAAM,OACDyE,EAAM,GAAGzE,MAAI,CAChBkI,EAAGvF,EAAEuF,EAAIf,EAAO,GAChBgB,EAAGxF,EAAEwF,EAAIhB,EAAO,OAGtB,IAEI9G,GACFmI,GAAYzH,SAAQ,SAAA8D,GAAQ,OAAAkC,EAAMkB,cAAcpD,EAAK3E,GAAI,CACvDgI,EAAGrD,EAAK7E,KAAKkI,EACbC,EAAGtD,EAAK7E,KAAKmI,GAFa,IAM9B,IAAM3H,GAAS,CACbiE,MAAO+D,GACP9D,MAAK,GAIP,OAFA6C,SAAAA,EAAc/G,IAEPA,EACT,EACQ,YAAAguB,IAAR,SACEtB,EACAhiB,EACAkjB,EACAF,EACAvC,EACA+B,GAEA,IAAK,IAAI/vB,EAAI,EAAGA,GAAKuvB,EAAcvvB,IAAK,CACtC,IAAMixB,EAAQjxB,EAAIuvB,EAClB/wB,KAAK0yB,aAAaD,EAAO1jB,EAAWygB,EAAOuC,EAAgBE,EAASV,E,CAExE,EACQ,YAAAmB,aAAR,SACED,EACA1jB,EACAygB,EACAnB,EACA4D,EACAV,GAEA,IAAMoB,EAAS,EAAIF,EACnB1jB,EAAUnK,SAAQ,SAACuE,EAAU3H,GAE3B,IAAMoxB,EAAYC,GAAa1pB,EAAG,CAAE4C,EAAG,EAAGC,EAAG,IACvC8mB,EAAyB,IAAdF,EAAkB,EAAI,EAAIA,EAC3C,GAAIpxB,IAAM+vB,EAAV,CAGA,IAAIwB,EAAY,EACZC,EAAY,EACZC,EAAc,EAClBlkB,EAAUnK,SAAQ,SAAC8qB,EAAGhtB,GAEpB,GAAIlB,IAAMkB,EAAV,CAIA,IAAMwwB,EAAOL,GAAa1pB,EAAGumB,GACvByD,EAAoB,IAATD,EAAa,EAAI,EAAIA,EAChCE,EAAW/E,EAAU3rB,GAAGlB,GAE9ByxB,GAAehB,EAAQzwB,GAAGkB,GAE1BqwB,GAAad,EAAQzwB,GAAGkB,IAAMgtB,EAAE3jB,EAAIqnB,GAAYjqB,EAAE4C,EAAI2jB,EAAE3jB,GAAKonB,GAE7DH,GAAaf,EAAQzwB,GAAGkB,IAAMgtB,EAAE1jB,EAAIonB,GAAYjqB,EAAE6C,EAAI0jB,EAAE1jB,GAAKmnB,E,CAC/D,IACA,IAAME,EAAqB,IAAb7D,EAAMhuB,GAAW,EAAI,EAAIguB,EAAMhuB,GAC7CyxB,GAAeN,EACfM,GAAeR,EAAQY,EAAQA,EAE/BN,GAAaJ,EACbI,GAAaN,EAAQY,EAAQlqB,EAAE4C,EAAI+mB,EACnC3pB,EAAE4C,EAAIgnB,EAAYE,EAElBD,GAAaL,EACbK,GAAaP,EAAQY,EAAQlqB,EAAE6C,EAAI8mB,EACnC3pB,EAAE6C,EAAIgnB,EAAYC,C,CACpB,GACF,EACF,EArPA,GAuPMjB,GAAkB,SACtB1pB,EACA+lB,EACAF,EACAqB,EACAyB,EACAvhB,EACAyhB,GAEA,IAAK7oB,EAAO,MAAO,GACnB,IAAMjE,EAAmB,GA2CzB,OA1CIgqB,GACFA,EAAUzpB,SAAQ,SAACwO,EAAe5R,GAChC,IAAMykB,EAAiB,GACvB7S,EAAIxO,SAAQ,SAACuE,EAAGzG,GACd,GAAIlB,IAAMkB,EACRujB,EAAOzlB,KAAK,QACP,GAAIgvB,EAAMhuB,KAAOguB,EAAM9sB,GAE5B,GAAe,SAAXgN,EAEFuW,EAAOzlB,KACJ2I,GAAKQ,KAAKgH,IAAInP,EAAIkB,GAAKyuB,IACrB3B,EAAMhuB,GAAKyvB,SAEX,GAAIvhB,EAAQ,CAEjB,IAAI4jB,EACAhrB,EAAM9G,GAAWkO,IAA+B,EAChD6jB,EACAjrB,EAAM5F,GAAWgN,IAA+B,EAChDpI,EAASgsB,KACXA,EAASA,EAAOE,WAAW,IAEzBlsB,EAASisB,KACXA,EAASA,EAAOC,WAAW,IAE7BvN,EAAOzlB,KACJ2I,GAAKQ,KAAKgH,IAAI2iB,EAASC,GAAUpC,IAC/B3B,EAAMhuB,GAAKyvB,G,MAGhBhL,EAAOzlB,KAAM2I,EAAIglB,GAAiBqB,EAAMhuB,GAAKyvB,QAE1C,CAEL,IAAMwC,GAAQtF,EAAe8C,GAAc,EAC3ChL,EAAOzlB,KAAK2I,EAAIsqB,E,CAEpB,IACApvB,EAAO7D,KAAKylB,EACd,IAEK5hB,CACT,EAEM6tB,GAAkB,SAACH,GAIvB,IAHA,IAAMpgB,EAAOogB,EAAerwB,OACtBkQ,EAAOmgB,EAAe,GAAGrwB,OACzB2C,EAAqB,GAClB7C,EAAI,EAAGA,EAAImQ,EAAMnQ,IAAK,CAE7B,IADA,IAAM4R,EAAgB,GACb1Q,EAAI,EAAGA,EAAIkP,EAAMlP,IACK,IAAzBqvB,EAAevwB,GAAGkB,GACpB0Q,EAAI5S,KAAK,GAAKuxB,EAAevwB,GAAGkB,GAAKqvB,EAAevwB,GAAGkB,KAEvD0Q,EAAI5S,KAAK,GAGb6D,EAAO7D,KAAK4S,E,CAEd,OAAO/O,CACT,EAQMwuB,GAAe,SAACa,EAAWC,GAAc,OAAAhqB,KAAKyH,MACjDsiB,EAAG3nB,EAAI4nB,EAAG5nB,IAAM2nB,EAAG3nB,EAAI4nB,EAAG5nB,IAAM2nB,EAAG1nB,EAAI2nB,EAAG3nB,IAAM0nB,EAAG1nB,EAAI2nB,EAAG3nB,GADd,EAIzCwlB,GAAe,SAAC9Z,EAAc3T,GAClC,IAAI6S,GAAS,EAMb,OALAc,EAAM9S,SAAQ,SAACG,EAAGvD,GACZuD,EAAEhB,KAAOA,IACX6S,EAAQpV,EAEZ,IACOmI,KAAKD,IAAIkN,EAAO,EACzB,EAEM,GAAiB,SAACpO,EAAkB+oB,EAAoBqC,GAG5D,IAFA,IAAMlyB,EAAS8G,EAAO9G,OAEbF,EAAI,EAAGA,EAAIE,EAAQF,IAE1B,GAAIgH,EAAO+oB,GAAY/vB,KAAO0G,IAAU,CACtCM,EAAO+oB,GAAY/vB,GAAKoyB,EACxBprB,EAAOhH,GAAG+vB,GAAcqC,EAExB,IAAK,IAAIlxB,EAAI,EAAGA,EAAIhB,EAAQgB,IACtB8F,EAAOhH,GAAGkB,KAAOwF,KAAYM,EAAO+oB,GAAY7uB,KAAOwF,MACzDM,EAAO+oB,GAAY7uB,GAAKkxB,EAAOprB,EAAOhH,GAAGkB,GACzC8F,EAAO9F,GAAG6uB,GAAcqC,EAAOprB,EAAOhH,GAAGkB,G,CAMjD,IAASlB,EAAI,EAAGA,EAAIE,EAAQF,IAC1B,GAAIA,IAAM+vB,EAGV,IAAS7uB,EAAI,EAAGA,EAAIhB,EAAQgB,IAC1B,GAAI8F,EAAOhH,GAAGkB,KAAOwF,IAAU,CAC7B,IAAI2rB,EAAQlqB,KAAKgH,IAAInI,EAAO+oB,GAAY/vB,GAAKgH,EAAO+oB,GAAY7uB,IAChEmxB,EAAkB,IAAVA,EAAc,EAAIA,EAC1BrrB,EAAOhH,GAAGkB,GAAKmxB,C,CAIvB,EAEMpC,GAAa,SAACjpB,EAAkB+oB,GAEpC,IADA,IAAI7nB,EAAM,EACDlI,EAAI,EAAGA,EAAIgH,EAAO+oB,GAAY7vB,OAAQF,IACzCgH,EAAO+oB,GAAY/vB,KAAO0G,MAG9BwB,EAAMlB,EAAO+oB,GAAY/vB,GAAKkI,EAAMlB,EAAO+oB,GAAY/vB,GAAKkI,GAE9D,OAAOA,CACT,EAQM4oB,GAAiB,SACrBnjB,EACAE,GAEA,IACIykB,EAiCJ,OA/BEA,EADE,EAASzkB,GACO,WAAM,OAAAA,CAAA,EACf/F,EAAW+F,GACFA,EAEA,WAAM,UAGrBF,EAgBM,EAAQA,GACF,SAACvL,GAEd,OADYuL,EAAS,GAAKA,EAAS,GAAKA,EAAS,GAAKA,EAAS,IAClD2kB,EAAgBlwB,EAC/B,EAEe,SAACA,GAAY,OAAAuL,EAAW2kB,EAAgBlwB,EAA3B,EArBb,SAACA,GACd,OAAIA,EAAEC,KAAKkwB,SACFpqB,KAAKD,IAAI9F,EAAEC,KAAKkwB,SAAS,GAAInwB,EAAEC,KAAKkwB,SAAS,IAAMD,EAAgBlwB,GAExEA,EAAEC,KAAKoE,KACL,EAAQrE,EAAEC,KAAKoE,MACV0B,KAAKD,IAAI9F,EAAEC,KAAKoE,KAAK,GAAIrE,EAAEC,KAAKoE,KAAK,IAAM6rB,EAAgBlwB,GAC7DmF,EAASnF,EAAEC,KAAKoE,OACTrE,EAAEC,KAAKoE,KAAK4B,MAAQjG,EAAEC,KAAKoE,KAAK6B,OAASlG,EAAEC,KAAKoE,KAAK4B,MAAQjG,EAAEC,KAAKoE,KAAK6B,QACxEgqB,EAAgBlwB,GAExBA,EAAEC,KAAKoE,KAAO6rB,EAAgBlwB,GAEhC,GAAKkwB,EAAgBlwB,EAC9B,CAUJ,EEtcM,GAAwD,CAC5DoH,OAAQ,CAAC,EAAG,GACZnB,MAAO,IACPC,OAAQ,KAkBV,cAGE,WAAmBY,QAAA,IAAAA,IAAAA,EAA+B,CAAC,GAAhC,KAAAA,QAAAA,EAFnB,KAAA3G,GAAK,SAGHxE,OAAO2E,OAAOlE,KAAK0K,QAAS,GAAyBA,EACvD,CA8EF,OAzEE,YAAAC,QAAA,SAAQC,EAAcF,GACpB,OAAO1K,KAAKg0B,qBAAoB,EAAOppB,EAAOF,EAChD,EAIA,YAAAxG,OAAA,SAAO0G,EAAcF,GACnB1K,KAAKg0B,qBAAoB,EAAMppB,EAAOF,EACxC,EAEQ,YAAAspB,oBAAR,SACE9vB,EACA0G,EACAF,GAEA,IAAMK,EAAgB,OAAK/K,KAAK0K,SAAYA,GAElCkF,EAKN7E,EAAa,OAJR8E,EAIL9E,EAAa,MAHP+E,EAGN/E,EAAa,OAFfI,EAEEJ,EAAa,iBADfK,EACEL,EAAa,YAEbzC,EAAQsC,EAAMS,cACbF,IACH7C,EAAQA,EAAMiD,QACZ,SAAC7C,GAAS,OAAAA,EAAK7E,KAAK2H,cAAiChJ,IAAtBkG,EAAK7E,KAAK2H,OAA/B,KAEd,IACM3B,EACHgG,GAAgC,oBAAXjC,OAEjBiC,EADDjC,OAAOC,WAEP/D,EACHgG,GAAiC,oBAAXlC,OAElBkC,EADDlC,OAAOE,YAEP9C,EAAU4E,GACZ,CAAC/F,EAAQ,EAAGC,EAAS,GAGnBuC,EAAyB,GAC3B/D,GACFA,EAAM1D,SAAQ,SAAC8D,GACb2D,EAAY7L,KAAK,CACfuD,GAAI2E,EAAK3E,GACTF,KAAM,CACJkI,EAnBY,IAmBRpC,KAAK4O,SAAW,IAAqB1O,EAAQmB,EAAO,GACxDgB,EApBY,IAoBRrC,KAAK4O,SAAW,IAAqBzO,EAASkB,EAAO,KAG/D,IAGE9G,GACFmI,EAAYzH,SAAQ,SAAC8D,GACnB,OAAAkC,EAAMkB,cAAcpD,EAAK3E,GAAI,CAC3BgI,EAAGrD,EAAK7E,KAAKkI,EACbC,EAAGtD,EAAK7E,KAAKmI,GAFf,IAOJ,IAAM3H,EAAS,CACbiE,MAAO+D,EACP9D,MAAOqC,EAAMU,eAKf,OAFAF,SAAAA,EAAc/G,GAEPA,CACT,EACF,EAnFA,GCtBa4vB,GAAuD,CAClEC,SAAUC,EACVC,WAAYC,EACZjC,IAAKkC,GACL/b,OAAQgc,GACRC,KAAMC,EACNC,OAAQC,IAEH,SAASC,GAAe7wB,EAAYmK,GACzC+lB,GAASlwB,GAAMmK,CACjB,CClBO,MAAM2mB,GACTpsB,QAAU,IAAIqsB,IACdC,QAAU,IAAID,IACdE,WAAa,IAAIF,IACjBG,YAAc,IAAIH,IAClBI,YAAc,IAAIJ,IAClBK,QAAU,GACVC,WAAa,EAMbC,UAAY,OA0BZ/mB,YAAY5D,GACHA,IAEDA,EAAQpC,OACRtI,KAAKs1B,SAAS5qB,EAAQpC,OACtBoC,EAAQnC,OACRvI,KAAKu1B,SAAS7qB,EAAQnC,OACtBmC,EAAQ8qB,MACRx1B,KAAKy1B,QAAQ/qB,EAAQ8qB,MACrB9qB,EAAQ2qB,YACRr1B,KAAKq1B,UAAY3qB,EAAQ2qB,WACjC,CAsBAvqB,MAASjL,IACLG,KAAKo1B,YAAc,EACnBv1B,IACAG,KAAKo1B,YAAc,EACdp1B,KAAKo1B,YACNp1B,KAAK01B,QACT,EAKJA,SACI,MAAMP,EAAUn1B,KAAKm1B,QACrBn1B,KAAKm1B,QAAU,GACfn1B,KAAKq1B,UAAU,CACXzqB,MAAO5K,KACPm1B,WAER,CA0BAQ,cAAcR,GACV,IAAIS,EAAgB,GA8GpB,OA7GAT,EAAQvwB,SAASixB,IACb,OAAQA,EAAO/xB,MACX,IAAK,cAAe,CAKhB,IAAIgyB,GAAe,EACnBF,EAAgBA,EAAcrqB,QAAQwqB,IAClC,GAAwB,cAApBA,EAAWjyB,KAAsB,CACjC,MAAMkyB,EAASD,EAAW1vB,MAAMtC,KAAO8xB,EAAOxvB,MAAMtC,GAIpD,OAHIiyB,IACAF,GAAe,IAEXE,CACZ,CACK,MAAwB,oBAApBD,EAAWjyB,KACTiyB,EAAWhyB,KAAO8xB,EAAOxvB,MAAMtC,GAEb,yBAApBgyB,EAAWjyB,MACTiyB,EAAWE,SAAWJ,EAAOxvB,MAAMtC,EAEnC,IAEV+xB,GACDF,EAAcp1B,KAAKq1B,GAEvB,KACJ,CACA,IAAK,cAAe,CAKhB,IAAIC,GAAe,EACnBF,EAAgBA,EAAcrqB,QAAQwqB,IAClC,GAAwB,cAApBA,EAAWjyB,KAAsB,CACjC,MAAMkyB,EAASD,EAAW1vB,MAAMtC,KAAO8xB,EAAOxvB,MAAMtC,GAIpD,OAHIiyB,IACAF,GAAe,IAEXE,CACZ,CACK,MAAwB,oBAApBD,EAAWjyB,MACI,gBAApBiyB,EAAWjyB,MACJiyB,EAAWhyB,KAAO8xB,EAAOxvB,MAAMtC,EAE/B,IAEV+xB,GACDF,EAAcp1B,KAAKq1B,GAEvB,KACJ,CACA,IAAK,kBACL,IAAK,kBACL,IAAK,cAAe,CAIhB,MAAMK,EAAiBN,EAAcO,MAAMJ,GAC/BA,EAAWjyB,OAAS+xB,EAAO/xB,MAC/BiyB,EAAWhyB,KAAO8xB,EAAO9xB,IACzBgyB,EAAWK,eAAiBP,EAAOO,eAEvCF,EACAA,EAAeG,SAAWR,EAAOQ,SAGjCT,EAAcp1B,KAAKq1B,GAEvB,KACJ,CACA,IAAK,wBAIDD,EAAgBA,EAAcrqB,QAAQwqB,GACV,0BAApBA,EAAWjyB,KACJiyB,EAAWO,UAAYT,EAAOS,QAEZ,yBAApBP,EAAWjyB,MACTiyB,EAAWO,UAAYT,EAAOS,UAI7CV,EAAcp1B,KAAKq1B,GACnB,MAEJ,IAAK,uBAAwB,CACzB,MAAMK,EAAiBN,EAAcO,MAAMJ,GACX,yBAApBA,EAAWjyB,MACfiyB,EAAWO,UAAYT,EAAOS,SAC9BP,EAAWE,SAAWJ,EAAOI,SAEjCC,EACAA,EAAeK,YACXV,EAAOU,YAGXX,EAAcp1B,KAAKq1B,GAEvB,KACJ,CACA,QACID,EAAcp1B,KAAKq1B,GAE3B,IAEGD,CACX,CAEAY,mBAAmBzyB,GACf,IAAK/D,KAAKy2B,QAAQ1yB,GACd,MAAM,IAAII,MAAM,0BAA4BJ,EAEpD,CAKA0yB,QAAQ1yB,GACJ,OAAO/D,KAAKyI,QAAQnJ,IAAIyE,EAC5B,CAKAsJ,aAAaqpB,EAAaC,GAEtB,OADA32B,KAAKw2B,mBAAmBE,GACjB12B,KAAKwN,aAAampB,GAAcC,MAAMC,GAAaA,EAAS9yB,KAAO2yB,GAC9E,CAKA3jB,QAAQhP,GAEJ,OADA/D,KAAKw2B,mBAAmBzyB,GACjB/D,KAAKyI,QAAQ1C,IAAIhC,EAC5B,CAOA+yB,gBAAgB/yB,EAAIgzB,GAChB/2B,KAAKw2B,mBAAmBzyB,GACxB,MAAMizB,EAAUh3B,KAAKg1B,WAAWjvB,IAAIhC,GAC9BkzB,EAAWj3B,KAAKi1B,YAAYlvB,IAAIhC,GACtC,GAAkB,OAAdgzB,EACA,OAAOn1B,MAAMwF,KAAK4vB,GAEjB,GAAkB,QAAdD,EACL,OAAOn1B,MAAMwF,KAAK6vB,GAEtB,MAAMC,EAAY,IAAIC,IAAI,IAAIH,KAAYC,IAC1C,OAAOr1B,MAAMwF,KAAK8vB,EACtB,CAKAvqB,UAAU5I,EAAIgzB,GACV,OAAO/2B,KAAK82B,gBAAgB/yB,EAAIgzB,GAAWr1B,MAC/C,CAIA6L,cAAcxJ,GACV,MACMqzB,EADWp3B,KAAK82B,gBAAgB/yB,EAAI,OACjBqF,KAAKqC,GAASA,EAAK7C,SAC5C,OAAOhH,MAAMwF,KAAK,IAAI+vB,IAAIC,IAAUhuB,KAAKrF,GAAO/D,KAAK+S,QAAQhP,IACjE,CAIAszB,gBAAgBtzB,GACZ,MACMuzB,EADUt3B,KAAK82B,gBAAgB/yB,EAAI,MACjBqF,KAAKqC,GAASA,EAAK9C,SAC3C,OAAO/G,MAAMwF,KAAK,IAAI+vB,IAAIG,IAAUluB,KAAKrF,GAAO/D,KAAK+S,QAAQhP,IACjE,CAMAyJ,aAAazJ,GACT,MAAMwzB,EAAev3B,KAAKq3B,gBAAgBtzB,GACpCyzB,EAAax3B,KAAKuN,cAAcxJ,GACtC,OAAOnC,MAAMwF,KAAK,IAAI+vB,IAAI,IAAII,KAAiBC,IACnD,CACAC,UAAU/uB,GACN,GAAI1I,KAAKy2B,QAAQ/tB,EAAK3E,IAClB,MAAM,IAAII,MAAM,wBAA0BuE,EAAK3E,IAEnD/D,KAAKyI,QAAQ4P,IAAI3P,EAAK3E,GAAI2E,GAC1B1I,KAAKg1B,WAAW3c,IAAI3P,EAAK3E,GAAI,IAAIozB,KACjCn3B,KAAKi1B,YAAY5c,IAAI3P,EAAK3E,GAAI,IAAIozB,KAClCn3B,KAAKk1B,YAAYtwB,SAAS4wB,IACtBA,EAAKkC,YAAYrf,IAAI3P,EAAK3E,GAAI,IAAIozB,IAAM,IAE5Cn3B,KAAKm1B,QAAQ30B,KAAK,CAAEsD,KAAM,YAAauC,MAAOqC,GAClD,CAKA4sB,SAAShtB,GACLtI,KAAK8K,OAAM,KACP,IAAK,MAAMpC,KAAQJ,EACftI,KAAKy3B,UAAU/uB,EACnB,GAER,CAKAivB,QAAQjvB,GACJ1I,KAAKs1B,SAAS,CAAC5sB,GACnB,CACAkvB,aAAa7zB,GACT,MAAM2E,EAAO1I,KAAK+S,QAAQhP,GACpBizB,EAAUh3B,KAAKg1B,WAAWjvB,IAAIhC,GAC9BkzB,EAAWj3B,KAAKi1B,YAAYlvB,IAAIhC,GACtCizB,GAASpyB,SAAS6G,GAASzL,KAAK63B,aAAapsB,EAAK1H,MAClDkzB,GAAUryB,SAAS6G,GAASzL,KAAK63B,aAAapsB,EAAK1H,MACnD/D,KAAKyI,QAAQqvB,OAAO/zB,GACpB/D,KAAKk1B,YAAYtwB,SAAS4wB,IACtBA,EAAKkC,YAAY3xB,IAAIhC,IAAKa,SAAS8I,IAC/B8nB,EAAKuC,UAAUD,OAAOpqB,EAAM3J,GAAG,IAEnCyxB,EAAKuC,UAAUD,OAAO/zB,GACtByxB,EAAKkC,YAAYI,OAAO/zB,EAAG,IAE/B/D,KAAKm1B,QAAQ30B,KAAK,CAAEsD,KAAM,cAAeuC,MAAOqC,GACpD,CAKAsvB,YAAYC,GACRj4B,KAAK8K,OAAM,KACPmtB,EAAOrzB,SAASb,GAAO/D,KAAK43B,aAAa7zB,IAAI,GAErD,CAKAm0B,WAAWn0B,GACP/D,KAAKg4B,YAAY,CAACj0B,GACtB,CAKAo0B,eAAep0B,EAAIqyB,EAAc/vB,GAC7B,MAAMqC,EAAO1I,KAAK+S,QAAQhP,GAC1B/D,KAAK8K,OAAM,KACP,MAAMstB,EAAW1vB,EAAK7E,KAAKuyB,GACrBC,EAAWhwB,EACjBqC,EAAK7E,KAAKuyB,GAAgBC,EAC1Br2B,KAAKm1B,QAAQ30B,KAAK,CACdsD,KAAM,kBACNC,KACAqyB,eACAgC,WACA/B,YACF,GAEV,CAMAvqB,cAAc/H,EAAIs0B,GACdr4B,KAAK8K,OAAM,KACPvL,OAAO+4B,QAAQD,GAAOzzB,SAAQ,EAAEwxB,EAAc/vB,MAC1CrG,KAAKm4B,eAAep0B,EAAIqyB,EAAc/vB,EAAM,GAC9C,GAEV,CAEAkyB,mBAAmBx0B,GACf,IAAK/D,KAAKw4B,QAAQz0B,GACd,MAAM,IAAII,MAAM,0BAA4BJ,EAEpD,CAKAy0B,QAAQz0B,GACJ,OAAO/D,KAAK+0B,QAAQz1B,IAAIyE,EAC5B,CAKA00B,QAAQ10B,GAEJ,OADA/D,KAAKu4B,mBAAmBx0B,GACjB/D,KAAK+0B,QAAQhvB,IAAIhC,EAC5B,CAKA20B,cAAc30B,GACV,MAAM0H,EAAOzL,KAAKy4B,QAAQ10B,GAC1B,MAAO,CACH0H,OACA9C,OAAQ3I,KAAK+S,QAAQtH,EAAK9C,QAC1BC,OAAQ5I,KAAK+S,QAAQtH,EAAK7C,QAElC,CACA+vB,UAAUltB,GACN,GAAIzL,KAAKw4B,QAAQ/sB,EAAK1H,IAClB,MAAM,IAAII,MAAM,wBAA0BsH,EAAK1H,IAEnD/D,KAAKw2B,mBAAmB/qB,EAAK9C,QAC7B3I,KAAKw2B,mBAAmB/qB,EAAK7C,QAC7B5I,KAAK+0B,QAAQ1c,IAAI5M,EAAK1H,GAAI0H,GAC1B,MAAMurB,EAAUh3B,KAAKg1B,WAAWjvB,IAAI0F,EAAK7C,QACnCquB,EAAWj3B,KAAKi1B,YAAYlvB,IAAI0F,EAAK9C,QAC3CquB,EAAQ7V,IAAI1V,GACZwrB,EAAS9V,IAAI1V,GACbzL,KAAKm1B,QAAQ30B,KAAK,CAAEsD,KAAM,YAAauC,MAAOoF,GAClD,CAKA8pB,SAAShtB,GACLvI,KAAK8K,OAAM,KACP,IAAK,MAAMW,KAAQlD,EACfvI,KAAK24B,UAAUltB,EACnB,GAER,CAaAmtB,QAAQntB,GACJzL,KAAKu1B,SAAS,CAAC9pB,GACnB,CACAosB,aAAa9zB,GACT,MAAM0H,EAAOzL,KAAKy4B,QAAQ10B,GACpBkzB,EAAWj3B,KAAKi1B,YAAYlvB,IAAI0F,EAAK9C,QACrCquB,EAAUh3B,KAAKg1B,WAAWjvB,IAAI0F,EAAK7C,QACzCquB,EAASa,OAAOrsB,GAChBurB,EAAQc,OAAOrsB,GACfzL,KAAK+0B,QAAQ+C,OAAO/zB,GACpB/D,KAAKm1B,QAAQ30B,KAAK,CAAEsD,KAAM,cAAeuC,MAAOoF,GACpD,CAKAotB,YAAYZ,GACRj4B,KAAK8K,OAAM,KACPmtB,EAAOrzB,SAASb,GAAO/D,KAAK63B,aAAa9zB,IAAI,GAErD,CAKA+0B,WAAW/0B,GACP/D,KAAK64B,YAAY,CAAC90B,GACtB,CAKAg1B,iBAAiBh1B,EAAI4E,GACjB,MAAM8C,EAAOzL,KAAKy4B,QAAQ10B,GAC1B/D,KAAKw2B,mBAAmB7tB,GACxB,MAAMqwB,EAAYvtB,EAAK9C,OACjBswB,EAAYtwB,EAClB3I,KAAKi1B,YAAYlvB,IAAIizB,GAAWlB,OAAOrsB,GACvCzL,KAAKi1B,YAAYlvB,IAAIkzB,GAAW9X,IAAI1V,GACpCA,EAAK9C,OAASA,EACd3I,KAAK8K,OAAM,KACP9K,KAAKm1B,QAAQ30B,KAAK,CACdsD,KAAM,cACNC,KACAqyB,aAAc,SACdgC,SAAUY,EACV3C,SAAU4C,GACZ,GAEV,CAKAC,iBAAiBn1B,EAAI6E,GACjB,MAAM6C,EAAOzL,KAAKy4B,QAAQ10B,GAC1B/D,KAAKw2B,mBAAmB5tB,GACxB,MAAMuwB,EAAY1tB,EAAK7C,OACjBwwB,EAAYxwB,EAClB5I,KAAKg1B,WAAWjvB,IAAIozB,GAAWrB,OAAOrsB,GACtCzL,KAAKg1B,WAAWjvB,IAAIqzB,GAAWjY,IAAI1V,GACnCA,EAAK7C,OAASA,EACd5I,KAAK8K,OAAM,KACP9K,KAAKm1B,QAAQ30B,KAAK,CACdsD,KAAM,cACNC,KACAqyB,aAAc,SACdgC,SAAUe,EACV9C,SAAU+C,GACZ,GAEV,CAKAC,eAAet1B,EAAIqyB,EAAc/vB,GAC7B,MAAMoF,EAAOzL,KAAKy4B,QAAQ10B,GAC1B/D,KAAK8K,OAAM,KACP,MAAMstB,EAAW3sB,EAAK5H,KAAKuyB,GACrBC,EAAWhwB,EACjBoF,EAAK5H,KAAKuyB,GAAgBC,EAC1Br2B,KAAKm1B,QAAQ30B,KAAK,CACdsD,KAAM,kBACNC,KACAqyB,eACAgC,WACA/B,YACF,GAEV,CAIAiD,cAAcv1B,EAAIs0B,GACdr4B,KAAK8K,OAAM,KACPvL,OAAO+4B,QAAQD,GAAOzzB,SAAQ,EAAEwxB,EAAc/vB,MAC1CrG,KAAKq5B,eAAet1B,EAAIqyB,EAAc/vB,EAAM,GAC9C,GAEV,CAEAkzB,mBAAmBjD,GACf,IAAKt2B,KAAKk1B,YAAY51B,IAAIg3B,GACtB,MAAM,IAAInyB,MAAM,yCAA2CmyB,EAEnE,CAiBAkD,oBAAoBlD,GACZt2B,KAAKk1B,YAAY51B,IAAIg3B,KAIzBt2B,KAAKk1B,YAAY7c,IAAIie,EAAS,CAC1ByB,UAAW,IAAIjD,IACf4C,YAAa,IAAI5C,MAErB90B,KAAK8K,OAAM,KACP9K,KAAKm1B,QAAQ30B,KAAK,CACdsD,KAAM,wBACNwyB,WACF,IAEV,CAUAmD,oBAAoBnD,GAChBt2B,KAAKu5B,mBAAmBjD,GACxBt2B,KAAKk1B,YAAY4C,OAAOxB,GACxBt2B,KAAK8K,OAAM,KACP9K,KAAKm1B,QAAQ30B,KAAK,CACdsD,KAAM,wBACNwyB,WACF,GAEV,CAmBAb,QAAQD,EAAMc,GACVt2B,KAAK8K,OAAM,KACP9K,KAAKw5B,oBAAoBlD,GAEzB,MAAMhuB,EAAQ,GACRoxB,EAAQ93B,MAAMiG,QAAQ2tB,GAAQA,EAAO,CAACA,GAC5C,KAAOkE,EAAMh4B,QAAQ,CACjB,MAAMgH,EAAOgxB,EAAM9M,QACnBtkB,EAAM9H,KAAKkI,GACPA,EAAK4E,UACLosB,EAAMl5B,QAAQkI,EAAK4E,SAE3B,CACAtN,KAAKs1B,SAAShtB,GAEdA,EAAM1D,SAAS+0B,IACXA,EAAOrsB,UAAU1I,SAAS8I,IACtB1N,KAAK45B,UAAUlsB,EAAM3J,GAAI41B,EAAO51B,GAAIuyB,EAAQ,GAC9C,GACJ,GAEV,CA0DAuD,SAASvD,GAEL,OADAt2B,KAAKu5B,mBAAmBjD,GACjBt2B,KAAKqL,cAAcE,QAAQ7C,IAAU1I,KAAK85B,UAAUpxB,EAAK3E,GAAIuyB,IACxE,CAKAyD,YAAYh2B,EAAIuyB,GACZt2B,KAAKw2B,mBAAmBzyB,GACxB/D,KAAKu5B,mBAAmBjD,GACxB,MACMhpB,EADOtN,KAAKk1B,YAAYnvB,IAAIuwB,GACZoB,YAAY3xB,IAAIhC,GACtC,OAAOnC,MAAMwF,KAAKkG,GAAY,GAClC,CAMAwsB,UAAU/1B,EAAIuyB,GAIV,OAHAt2B,KAAKw2B,mBAAmBzyB,GACxB/D,KAAKu5B,mBAAmBjD,GACXt2B,KAAKk1B,YAAYnvB,IAAIuwB,GACtByB,UAAUhyB,IAAIhC,IAAO,IACrC,CAQA61B,UAAU71B,EAAI41B,EAAQrD,GAClBt2B,KAAKu5B,mBAAmBjD,GACxB,MAAMd,EAAOx1B,KAAKk1B,YAAYnvB,IAAIuwB,GAC5B5tB,EAAO1I,KAAK+S,QAAQhP,GACpBi2B,EAAYxE,EAAKuC,UAAUhyB,IAAIhC,GAC/Bk2B,EAAYj6B,KAAK+S,QAAQ4mB,GAE/BnE,EAAKuC,UAAU1f,IAAItU,EAAIk2B,GAEnBD,GACAxE,EAAKkC,YAAY3xB,IAAIi0B,EAAUj2B,KAAK+zB,OAAOpvB,GAE/C,IAAI4E,EAAWkoB,EAAKkC,YAAY3xB,IAAIk0B,EAAUl2B,IACzCuJ,IACDA,EAAW,IAAI6pB,IACf3B,EAAKkC,YAAYrf,IAAI4hB,EAAUl2B,GAAIuJ,IAEvCA,EAAS6T,IAAIzY,GACb1I,KAAK8K,OAAM,KACP9K,KAAKm1B,QAAQ30B,KAAK,CACdsD,KAAM,uBACNwyB,UACAL,OAAQlyB,EACRm2B,YAAaF,GAAWj2B,GACxBwyB,YAAa0D,EAAUl2B,IACzB,GAEV,CAKAsH,cACI,OAAOzJ,MAAMwF,KAAKpH,KAAKyI,QAAQ0xB,SACnC,CAIA7uB,cACI,OAAO1J,MAAMwF,KAAKpH,KAAK+0B,QAAQoF,SACnC,CACAC,MAAMC,EAAOC,EAASz6B,GAClB,KAAOw6B,EAAM34B,QAAQ,CACjB,MAAMgH,EAAO2xB,EAAMzN,QACnB/sB,EAAG6I,GACH4xB,EAAQnZ,IAAIzY,EAAK3E,IACjB/D,KAAKuN,cAAc7E,EAAK3E,IAAIa,SAASW,IAC5B+0B,EAAQh7B,IAAIiG,EAAExB,MACfu2B,EAAQnZ,IAAI5b,EAAExB,IACds2B,EAAM75B,KAAK+E,GACf,GAER,CACJ,CACAg1B,IAAIx2B,EAAIlE,GACJG,KAAKo6B,MAAM,CAACp6B,KAAK+S,QAAQhP,IAAM,IAAIozB,IAAOt3B,EAC9C,CACA26B,MAAM9xB,EAAM4xB,EAASz6B,GACjBA,EAAG6I,GACH4xB,EAAQnZ,IAAIzY,EAAK3E,IACjB/D,KAAKuN,cAAc7E,EAAK3E,IAAIa,SAASW,IAC5B+0B,EAAQh7B,IAAIiG,EAAExB,KACf/D,KAAKw6B,MAAMj1B,EAAG+0B,EAASz6B,EAC3B,GAER,CACA46B,IAAI12B,EAAIlE,GACJG,KAAKw6B,MAAMx6B,KAAK+S,QAAQhP,GAAK,IAAIozB,IAAOt3B,EAC5C,CACAmJ,QAEI,MAAM0xB,EAAW16B,KAAKqL,cAAcjC,KAAKuxB,IAC9B,IAAKA,EAAS92B,KAAM,IAAK82B,EAAQ92B,UAEtC+2B,EAAW56B,KAAKsL,cAAclC,KAAKyxB,IAC9B,IAAKA,EAASh3B,KAAM,IAAKg3B,EAAQh3B,UAGtCi3B,EAAW,IAAIjG,GAAM,CACvBvsB,MAAOoyB,EACPnyB,MAAOqyB,IAiBX,OAdA56B,KAAKk1B,YAAYtwB,SAAQ,EAAGmzB,UAAWgD,EAAcrD,YAAasD,GAAkB1E,KAChF,MAAMyB,EAAY,IAAIjD,IACtBiG,EAAan2B,SAAQ,CAAC+0B,EAAQh0B,KAC1BoyB,EAAU1f,IAAI1S,EAAKm1B,EAAS/nB,QAAQ4mB,EAAO51B,IAAI,IAEnD,MAAM2zB,EAAc,IAAI5C,IACxBkG,EAAep2B,SAAQ,CAAC0I,EAAU3H,KAC9B+xB,EAAYrf,IAAI1S,EAAK,IAAIwxB,IAAIv1B,MAAMwF,KAAKkG,GAAUlE,KAAK7D,GAAMu1B,EAAS/nB,QAAQxN,EAAExB,OAAM,IAE1F+2B,EAAS5F,YAAY7c,IAAIie,EAAS,CAC9ByB,UAAWA,EACXL,YAAaA,GACf,IAECoD,CACX,CACA5hB,SACI,OAAO+hB,KAAKC,UAAU,CAClB5yB,MAAOtI,KAAKqL,cACZ9C,MAAOvI,KAAKsL,eAGpB,E","sources":["webpack://Layout/webpack/universalModuleDefinition","webpack://Layout/../../node_modules/eventemitter3/index.js","webpack://Layout/./src/worker.ts","webpack://Layout/./node_modules/workerize-loader/dist/rpc-wrapper.js","webpack://Layout/webpack/bootstrap","webpack://Layout/webpack/runtime/compat get default export","webpack://Layout/webpack/runtime/define property getters","webpack://Layout/webpack/runtime/hasOwnProperty shorthand","webpack://Layout/webpack/runtime/make namespace object","webpack://Layout/../../node_modules/tslib/tslib.es6.js","webpack://Layout/./src/util/string.ts","webpack://Layout/./src/util/array.ts","webpack://Layout/./src/util/number.ts","webpack://Layout/./src/util/math.ts","webpack://Layout/./src/util/object.ts","webpack://Layout/./src/util/function.ts","webpack://Layout/./src/circular.ts","webpack://Layout/./src/supervisor.ts","webpack://Layout/./src/concentric.ts","webpack://Layout/./src/grid.ts","webpack://Layout/../../node_modules/is-any-array/lib-esm/index.js","webpack://Layout/../../node_modules/ml-array-max/lib-es6/index.js","webpack://Layout/../../node_modules/ml-array-min/lib-es6/index.js","webpack://Layout/../../node_modules/ml-array-rescale/lib-es6/index.js","webpack://Layout/../../node_modules/ml-matrix/src/inspect.js","webpack://Layout/../../node_modules/ml-matrix/src/util.js","webpack://Layout/../../node_modules/ml-matrix/src/matrix.js","webpack://Layout/../../node_modules/ml-matrix/src/stat.js","webpack://Layout/../../node_modules/ml-matrix/src/mathOperations.js","webpack://Layout/../../node_modules/ml-matrix/src/wrap/WrapperMatrix2D.js","webpack://Layout/../../node_modules/ml-matrix/src/dc/util.js","webpack://Layout/../../node_modules/ml-matrix/src/dc/svd.js","webpack://Layout/./src/mds.ts","webpack://Layout/./src/radial/RadialNonoverlapForce.ts","webpack://Layout/./src/radial/index.ts","webpack://Layout/./src/radial/mds.ts","webpack://Layout/./src/random.ts","webpack://Layout/./src/registry.ts","webpack://Layout/../../node_modules/@antv/graphlib/esm/Graph.js"],"sourcesContent":["(function webpackUniversalModuleDefinition(root, factory) {\n\tif(typeof exports === 'object' && typeof module === 'object')\n\t\tmodule.exports = factory();\n\telse if(typeof define === 'function' && define.amd)\n\t\tdefine([], factory);\n\telse if(typeof exports === 'object')\n\t\texports[\"Layout\"] = factory();\n\telse\n\t\troot[\"Layout\"] = factory();\n})(self, () => {\nreturn ","'use strict';\n\nvar has = Object.prototype.hasOwnProperty\n  , prefix = '~';\n\n/**\n * Constructor to create a storage for our `EE` objects.\n * An `Events` instance is a plain object whose properties are event names.\n *\n * @constructor\n * @private\n */\nfunction Events() {}\n\n//\n// We try to not inherit from `Object.prototype`. In some engines creating an\n// instance in this way is faster than calling `Object.create(null)` directly.\n// If `Object.create(null)` is not supported we prefix the event names with a\n// character to make sure that the built-in object properties are not\n// overridden or used as an attack vector.\n//\nif (Object.create) {\n  Events.prototype = Object.create(null);\n\n  //\n  // This hack is needed because the `__proto__` property is still inherited in\n  // some old browsers like Android 4, iPhone 5.1, Opera 11 and Safari 5.\n  //\n  if (!new Events().__proto__) prefix = false;\n}\n\n/**\n * Representation of a single event listener.\n *\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} [once=false] Specify if the listener is a one-time listener.\n * @constructor\n * @private\n */\nfunction EE(fn, context, once) {\n  this.fn = fn;\n  this.context = context;\n  this.once = once || false;\n}\n\n/**\n * Add a listener for a given event.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} context The context to invoke the listener with.\n * @param {Boolean} once Specify if the listener is a one-time listener.\n * @returns {EventEmitter}\n * @private\n */\nfunction addListener(emitter, event, fn, context, once) {\n  if (typeof fn !== 'function') {\n    throw new TypeError('The listener must be a function');\n  }\n\n  var listener = new EE(fn, context || emitter, once)\n    , evt = prefix ? prefix + event : event;\n\n  if (!emitter._events[evt]) emitter._events[evt] = listener, emitter._eventsCount++;\n  else if (!emitter._events[evt].fn) emitter._events[evt].push(listener);\n  else emitter._events[evt] = [emitter._events[evt], listener];\n\n  return emitter;\n}\n\n/**\n * Clear event by name.\n *\n * @param {EventEmitter} emitter Reference to the `EventEmitter` instance.\n * @param {(String|Symbol)} evt The Event name.\n * @private\n */\nfunction clearEvent(emitter, evt) {\n  if (--emitter._eventsCount === 0) emitter._events = new Events();\n  else delete emitter._events[evt];\n}\n\n/**\n * Minimal `EventEmitter` interface that is molded against the Node.js\n * `EventEmitter` interface.\n *\n * @constructor\n * @public\n */\nfunction EventEmitter() {\n  this._events = new Events();\n  this._eventsCount = 0;\n}\n\n/**\n * Return an array listing the events for which the emitter has registered\n * listeners.\n *\n * @returns {Array}\n * @public\n */\nEventEmitter.prototype.eventNames = function eventNames() {\n  var names = []\n    , events\n    , name;\n\n  if (this._eventsCount === 0) return names;\n\n  for (name in (events = this._events)) {\n    if (has.call(events, name)) names.push(prefix ? name.slice(1) : name);\n  }\n\n  if (Object.getOwnPropertySymbols) {\n    return names.concat(Object.getOwnPropertySymbols(events));\n  }\n\n  return names;\n};\n\n/**\n * Return the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Array} The registered listeners.\n * @public\n */\nEventEmitter.prototype.listeners = function listeners(event) {\n  var evt = prefix ? prefix + event : event\n    , handlers = this._events[evt];\n\n  if (!handlers) return [];\n  if (handlers.fn) return [handlers.fn];\n\n  for (var i = 0, l = handlers.length, ee = new Array(l); i < l; i++) {\n    ee[i] = handlers[i].fn;\n  }\n\n  return ee;\n};\n\n/**\n * Return the number of listeners listening to a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Number} The number of listeners.\n * @public\n */\nEventEmitter.prototype.listenerCount = function listenerCount(event) {\n  var evt = prefix ? prefix + event : event\n    , listeners = this._events[evt];\n\n  if (!listeners) return 0;\n  if (listeners.fn) return 1;\n  return listeners.length;\n};\n\n/**\n * Calls each of the listeners registered for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @returns {Boolean} `true` if the event had listeners, else `false`.\n * @public\n */\nEventEmitter.prototype.emit = function emit(event, a1, a2, a3, a4, a5) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return false;\n\n  var listeners = this._events[evt]\n    , len = arguments.length\n    , args\n    , i;\n\n  if (listeners.fn) {\n    if (listeners.once) this.removeListener(event, listeners.fn, undefined, true);\n\n    switch (len) {\n      case 1: return listeners.fn.call(listeners.context), true;\n      case 2: return listeners.fn.call(listeners.context, a1), true;\n      case 3: return listeners.fn.call(listeners.context, a1, a2), true;\n      case 4: return listeners.fn.call(listeners.context, a1, a2, a3), true;\n      case 5: return listeners.fn.call(listeners.context, a1, a2, a3, a4), true;\n      case 6: return listeners.fn.call(listeners.context, a1, a2, a3, a4, a5), true;\n    }\n\n    for (i = 1, args = new Array(len -1); i < len; i++) {\n      args[i - 1] = arguments[i];\n    }\n\n    listeners.fn.apply(listeners.context, args);\n  } else {\n    var length = listeners.length\n      , j;\n\n    for (i = 0; i < length; i++) {\n      if (listeners[i].once) this.removeListener(event, listeners[i].fn, undefined, true);\n\n      switch (len) {\n        case 1: listeners[i].fn.call(listeners[i].context); break;\n        case 2: listeners[i].fn.call(listeners[i].context, a1); break;\n        case 3: listeners[i].fn.call(listeners[i].context, a1, a2); break;\n        case 4: listeners[i].fn.call(listeners[i].context, a1, a2, a3); break;\n        default:\n          if (!args) for (j = 1, args = new Array(len -1); j < len; j++) {\n            args[j - 1] = arguments[j];\n          }\n\n          listeners[i].fn.apply(listeners[i].context, args);\n      }\n    }\n  }\n\n  return true;\n};\n\n/**\n * Add a listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.on = function on(event, fn, context) {\n  return addListener(this, event, fn, context, false);\n};\n\n/**\n * Add a one-time listener for a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn The listener function.\n * @param {*} [context=this] The context to invoke the listener with.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.once = function once(event, fn, context) {\n  return addListener(this, event, fn, context, true);\n};\n\n/**\n * Remove the listeners of a given event.\n *\n * @param {(String|Symbol)} event The event name.\n * @param {Function} fn Only remove the listeners that match this function.\n * @param {*} context Only remove the listeners that have this context.\n * @param {Boolean} once Only remove one-time listeners.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeListener = function removeListener(event, fn, context, once) {\n  var evt = prefix ? prefix + event : event;\n\n  if (!this._events[evt]) return this;\n  if (!fn) {\n    clearEvent(this, evt);\n    return this;\n  }\n\n  var listeners = this._events[evt];\n\n  if (listeners.fn) {\n    if (\n      listeners.fn === fn &&\n      (!once || listeners.once) &&\n      (!context || listeners.context === context)\n    ) {\n      clearEvent(this, evt);\n    }\n  } else {\n    for (var i = 0, events = [], length = listeners.length; i < length; i++) {\n      if (\n        listeners[i].fn !== fn ||\n        (once && !listeners[i].once) ||\n        (context && listeners[i].context !== context)\n      ) {\n        events.push(listeners[i]);\n      }\n    }\n\n    //\n    // Reset the array, or remove it completely if we have no more listeners.\n    //\n    if (events.length) this._events[evt] = events.length === 1 ? events[0] : events;\n    else clearEvent(this, evt);\n  }\n\n  return this;\n};\n\n/**\n * Remove all listeners, or those of the specified event.\n *\n * @param {(String|Symbol)} [event] The event name.\n * @returns {EventEmitter} `this`.\n * @public\n */\nEventEmitter.prototype.removeAllListeners = function removeAllListeners(event) {\n  var evt;\n\n  if (event) {\n    evt = prefix ? prefix + event : event;\n    if (this._events[evt]) clearEvent(this, evt);\n  } else {\n    this._events = new Events();\n    this._eventsCount = 0;\n  }\n\n  return this;\n};\n\n//\n// Alias methods names because people roll like that.\n//\nEventEmitter.prototype.off = EventEmitter.prototype.removeListener;\nEventEmitter.prototype.addListener = EventEmitter.prototype.on;\n\n//\n// Expose the prefix.\n//\nEventEmitter.prefixed = prefix;\n\n//\n// Allow `EventEmitter` to be imported as module namespace.\n//\nEventEmitter.EventEmitter = EventEmitter;\n\n//\n// Expose the module.\n//\nif ('undefined' !== typeof module) {\n  module.exports = EventEmitter;\n}\n","\n\t\t\t\tvar addMethods = require(\"../node_modules/workerize-loader/dist/rpc-wrapper.js\")\n\t\t\t\tvar methods = [\"calculateLayout\"]\n\t\t\t\tmodule.exports = function() {\n\t\t\t\t\tvar w = new Worker(URL.createObjectURL(new Blob([\"(()=>{\\\"use strict\\\";var t={d:(e,r)=>{for(var o in r)t.o(r,o)&&!t.o(e,o)&&Object.defineProperty(e,o,{enumerable:!0,get:r[o]})},o:(t,e)=>Object.prototype.hasOwnProperty.call(t,e)},e={};t.d(e,{calculateLayout:()=>yt});class r{nodeMap=new Map;edgeMap=new Map;inEdgesMap=new Map;outEdgesMap=new Map;treeIndices=new Map;changes=[];batchCount=0;onChanged=()=>{};constructor(t){t&&(t.nodes&&this.addNodes(t.nodes),t.edges&&this.addEdges(t.edges),t.tree&&this.addTree(t.tree),t.onChanged&&(this.onChanged=t.onChanged))}batch=t=>{this.batchCount+=1,t(),this.batchCount-=1,this.batchCount||this.commit()};commit(){const t=this.changes;this.changes=[],this.onChanged({graph:this,changes:t})}reduceChanges(t){let e=[];return t.forEach((t=>{switch(t.type){case\\\"NodeRemoved\\\":{let r=!1;e=e.filter((e=>{if(\\\"NodeAdded\\\"===e.type){const o=e.value.id===t.value.id;return o&&(r=!0),!o}return\\\"NodeDataUpdated\\\"===e.type?e.id!==t.value.id:\\\"TreeStructureChanged\\\"!==e.type||e.nodeId!==t.value.id})),r||e.push(t);break}case\\\"EdgeRemoved\\\":{let r=!1;e=e.filter((e=>{if(\\\"EdgeAdded\\\"===e.type){const o=e.value.id===t.value.id;return o&&(r=!0),!o}return\\\"EdgeDataUpdated\\\"!==e.type&&\\\"EdgeUpdated\\\"!==e.type||e.id!==t.value.id})),r||e.push(t);break}case\\\"NodeDataUpdated\\\":case\\\"EdgeDataUpdated\\\":case\\\"EdgeUpdated\\\":{const r=e.find((e=>e.type===t.type&&e.id===t.id&&e.propertyName===t.propertyName));r?r.newValue=t.newValue:e.push(t);break}case\\\"TreeStructureDetached\\\":e=e.filter((e=>\\\"TreeStructureAttached\\\"===e.type?e.treeKey!==t.treeKey:\\\"TreeStructureChanged\\\"!==e.type||e.treeKey!==t.treeKey)),e.push(t);break;case\\\"TreeStructureChanged\\\":{const r=e.find((e=>\\\"TreeStructureChanged\\\"===e.type&&e.treeKey===t.treeKey&&e.nodeId===t.nodeId));r?r.newParentId=t.newParentId:e.push(t);break}default:e.push(t)}})),e}checkNodeExistence(t){if(!this.hasNode(t))throw new Error(\\\"Node not found for id: \\\"+t)}hasNode(t){return this.nodeMap.has(t)}areNeighbors(t,e){return this.checkNodeExistence(t),this.getNeighbors(e).some((e=>e.id===t))}getNode(t){return this.checkNodeExistence(t),this.nodeMap.get(t)}getRelatedEdges(t,e){this.checkNodeExistence(t);const r=this.inEdgesMap.get(t),o=this.outEdgesMap.get(t);if(\\\"in\\\"===e)return Array.from(r);if(\\\"out\\\"===e)return Array.from(o);const s=new Set([...r,...o]);return Array.from(s)}getDegree(t,e){return this.getRelatedEdges(t,e).length}getSuccessors(t){const e=this.getRelatedEdges(t,\\\"out\\\").map((t=>t.target));return Array.from(new Set(e)).map((t=>this.getNode(t)))}getPredecessors(t){const e=this.getRelatedEdges(t,\\\"in\\\").map((t=>t.source));return Array.from(new Set(e)).map((t=>this.getNode(t)))}getNeighbors(t){const e=this.getPredecessors(t),r=this.getSuccessors(t);return Array.from(new Set([...e,...r]))}doAddNode(t){if(this.hasNode(t.id))throw new Error(\\\"Node already exists: \\\"+t.id);this.nodeMap.set(t.id,t),this.inEdgesMap.set(t.id,new Set),this.outEdgesMap.set(t.id,new Set),this.treeIndices.forEach((e=>{e.childrenMap.set(t.id,new Set)})),this.changes.push({type:\\\"NodeAdded\\\",value:t})}addNodes(t){this.batch((()=>{for(const e of t)this.doAddNode(e)}))}addNode(t){this.addNodes([t])}doRemoveNode(t){const e=this.getNode(t),r=this.inEdgesMap.get(t),o=this.outEdgesMap.get(t);r?.forEach((t=>this.doRemoveEdge(t.id))),o?.forEach((t=>this.doRemoveEdge(t.id))),this.nodeMap.delete(t),this.treeIndices.forEach((e=>{e.childrenMap.get(t)?.forEach((t=>{e.parentMap.delete(t.id)})),e.parentMap.delete(t),e.childrenMap.delete(t)})),this.changes.push({type:\\\"NodeRemoved\\\",value:e})}removeNodes(t){this.batch((()=>{t.forEach((t=>this.doRemoveNode(t)))}))}removeNode(t){this.removeNodes([t])}updateNodeData(t,e,r){const o=this.getNode(t);this.batch((()=>{const s=o.data[e],n=r;o.data[e]=n,this.changes.push({type:\\\"NodeDataUpdated\\\",id:t,propertyName:e,oldValue:s,newValue:n})}))}mergeNodeData(t,e){this.batch((()=>{Object.entries(e).forEach((([e,r])=>{this.updateNodeData(t,e,r)}))}))}checkEdgeExistence(t){if(!this.hasEdge(t))throw new Error(\\\"Edge not found for id: \\\"+t)}hasEdge(t){return this.edgeMap.has(t)}getEdge(t){return this.checkEdgeExistence(t),this.edgeMap.get(t)}getEdgeDetail(t){const e=this.getEdge(t);return{edge:e,source:this.getNode(e.source),target:this.getNode(e.target)}}doAddEdge(t){if(this.hasEdge(t.id))throw new Error(\\\"Edge already exists: \\\"+t.id);this.checkNodeExistence(t.source),this.checkNodeExistence(t.target),this.edgeMap.set(t.id,t);const e=this.inEdgesMap.get(t.target),r=this.outEdgesMap.get(t.source);e.add(t),r.add(t),this.changes.push({type:\\\"EdgeAdded\\\",value:t})}addEdges(t){this.batch((()=>{for(const e of t)this.doAddEdge(e)}))}addEdge(t){this.addEdges([t])}doRemoveEdge(t){const e=this.getEdge(t),r=this.outEdgesMap.get(e.source),o=this.inEdgesMap.get(e.target);r.delete(e),o.delete(e),this.edgeMap.delete(t),this.changes.push({type:\\\"EdgeRemoved\\\",value:e})}removeEdges(t){this.batch((()=>{t.forEach((t=>this.doRemoveEdge(t)))}))}removeEdge(t){this.removeEdges([t])}updateEdgeSource(t,e){const r=this.getEdge(t);this.checkNodeExistence(e);const o=r.source,s=e;this.outEdgesMap.get(o).delete(r),this.outEdgesMap.get(s).add(r),r.source=e,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:t,propertyName:\\\"source\\\",oldValue:o,newValue:s})}))}updateEdgeTarget(t,e){const r=this.getEdge(t);this.checkNodeExistence(e);const o=r.target,s=e;this.inEdgesMap.get(o).delete(r),this.inEdgesMap.get(s).add(r),r.target=e,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:t,propertyName:\\\"target\\\",oldValue:o,newValue:s})}))}updateEdgeData(t,e,r){const o=this.getEdge(t);this.batch((()=>{const s=o.data[e],n=r;o.data[e]=n,this.changes.push({type:\\\"EdgeDataUpdated\\\",id:t,propertyName:e,oldValue:s,newValue:n})}))}mergeEdgeData(t,e){this.batch((()=>{Object.entries(e).forEach((([e,r])=>{this.updateEdgeData(t,e,r)}))}))}checkTreeExistence(t){if(!this.treeIndices.has(t))throw new Error(\\\"Tree structure not found for treeKey: \\\"+t)}attachTreeStructure(t){this.treeIndices.has(t)||(this.treeIndices.set(t,{parentMap:new Map,childrenMap:new Map}),this.batch((()=>{this.changes.push({type:\\\"TreeStructureAttached\\\",treeKey:t})})))}detachTreeStructure(t){this.checkTreeExistence(t),this.treeIndices.delete(t),this.batch((()=>{this.changes.push({type:\\\"TreeStructureDetached\\\",treeKey:t})}))}addTree(t,e){this.batch((()=>{this.attachTreeStructure(e);const r=[],o=Array.isArray(t)?t:[t];for(;o.length;){const t=o.shift();r.push(t),t.children&&o.push(...t.children)}this.addNodes(r),r.forEach((t=>{t.children?.forEach((r=>{this.setParent(r.id,t.id,e)}))}))}))}getRoots(t){return this.checkTreeExistence(t),this.getAllNodes().filter((e=>!this.getParent(e.id,t)))}getChildren(t,e){this.checkNodeExistence(t),this.checkTreeExistence(e);const r=this.treeIndices.get(e).childrenMap.get(t);return Array.from(r||[])}getParent(t,e){return this.checkNodeExistence(t),this.checkTreeExistence(e),this.treeIndices.get(e).parentMap.get(t)||null}setParent(t,e,r){this.checkTreeExistence(r);const o=this.treeIndices.get(r),s=this.getNode(t),n=o.parentMap.get(t),i=this.getNode(e);o.parentMap.set(t,i),n&&o.childrenMap.get(n.id)?.delete(s);let a=o.childrenMap.get(i.id);a||(a=new Set,o.childrenMap.set(i.id,a)),a.add(s),this.batch((()=>{this.changes.push({type:\\\"TreeStructureChanged\\\",treeKey:r,nodeId:t,oldParentId:n?.id,newParentId:i.id})}))}getAllNodes(){return Array.from(this.nodeMap.values())}getAllEdges(){return Array.from(this.edgeMap.values())}doBFS(t,e,r){for(;t.length;){const o=t.shift();r(o),e.add(o.id),this.getSuccessors(o.id).forEach((r=>{e.has(r.id)||(e.add(r.id),t.push(r))}))}}bfs(t,e){this.doBFS([this.getNode(t)],new Set,e)}doDFS(t,e,r){r(t),e.add(t.id),this.getSuccessors(t.id).forEach((t=>{e.has(t.id)||this.doDFS(t,e,r)}))}dfs(t,e){this.doDFS(this.getNode(t),new Set,e)}clone(){const t=this.getAllNodes().map((t=>({...t,data:{...t.data}}))),e=this.getAllEdges().map((t=>({...t,data:{...t.data}}))),o=new r({nodes:t,edges:e});return this.treeIndices.forEach((({parentMap:t,childrenMap:e},r)=>{const s=new Map;t.forEach(((t,e)=>{s.set(e,o.getNode(t.id))}));const n=new Map;e.forEach(((t,e)=>{n.set(e,new Set(Array.from(t).map((t=>o.getNode(t.id)))))})),o.treeIndices.set(r,{parentMap:s,childrenMap:n})})),o}toJSON(){return JSON.stringify({nodes:this.getAllNodes(),edges:this.getAllEdges()})}}var o=function(){return o=Object.assign||function(t){for(var e,r=1,o=arguments.length;r<o;r++)for(var s in e=arguments[r])Object.prototype.hasOwnProperty.call(e,s)&&(t[s]=e[s]);return t},o.apply(this,arguments)};function s(t,e){var r=\\\"function\\\"==typeof Symbol&&t[Symbol.iterator];if(!r)return t;var o,s,n=r.call(t),i=[];try{for(;(void 0===e||e-- >0)&&!(o=n.next()).done;)i.push(o.value)}catch(t){s={error:t}}finally{try{o&&!o.done&&(r=n.return)&&r.call(n)}finally{if(s)throw s.error}}return i}function n(t,e,r){if(r||2===arguments.length)for(var o,s=0,n=e.length;s<n;s++)!o&&s in e||(o||(o=Array.prototype.slice.call(e,0,s)),o[s]=e[s]);return t.concat(o||Array.prototype.slice.call(e))}Object.create,Object.create;var i=function(t){return\\\"string\\\"==typeof t},a=/-(\\\\w)/g,h=(function(t){return t.replace(a,(function(t,e){return e?e.toUpperCase():\\\"\\\"}))},Object.create(null),Array.isArray),u=function(t){return\\\"number\\\"==typeof t},l=function(t){for(var e=[],r=t.length,o=0;o<r;o+=1){e[o]=[];for(var s=0;s<r;s+=1)o===s?e[o][s]=0:0!==t[o][s]&&t[o][s]?e[o][s]=t[o][s]:e[o][s]=1/0}for(var n=0;n<r;n+=1)for(o=0;o<r;o+=1)for(s=0;s<r;s+=1)e[o][s]>e[o][n]+e[n][s]&&(e[o][s]=e[o][n]+e[n][s]);return e},c=function(t,e){var r=t.nodes,o=t.edges,s=[],n={};if(!r)throw new Error(\\\"invalid nodes data!\\\");return r&&r.forEach((function(t,e){n[t.id]=e,s.push([])})),null==o||o.forEach((function(t){var r=t.source,o=t.target,i=n[r],a=n[o];void 0!==i&&void 0!==a&&(s[i][a]=1,e||(s[a][i]=1))})),s},f=function(t){return null!==t&&\\\"object\\\"==typeof t},d=function(t){if(null===t)return t;if(t instanceof Date)return new Date(t.getTime());if(t instanceof Array){var e=[];return t.forEach((function(t){e.push(t)})),e.map((function(t){return d(t)}))}if(\\\"object\\\"==typeof t&&Object.keys(t).length){var r=o({},t);return Object.keys(r).forEach((function(t){r[t]=d(r[t])})),r}return t},g=function(t){return\\\"function\\\"==typeof t},m=function(t,e,r){return void 0===r&&(r=!0),e||0===e?g(e)?e:u(e)?function(){return e}:h(e)?function(){if(r){var o=Math.max.apply(Math,n([],s(e),!1));return isNaN(o)?t:o}return e}:f(e)?function(){if(r){var o=Math.max(e.width,e.height);return isNaN(o)?t:o}return[e.width,e.height]}:function(){return t}:function(e){return e.size?h(e.size)?e.size[0]>e.size[1]?e.size[0]:e.size[1]:f(e.size)?e.size.width>e.size.height?e.size.width:e.size.height:e.size:t}},p={radius:null,startRadius:null,endRadius:null,startAngle:0,endAngle:2*Math.PI,clockwise:!0,divisions:1,ordering:null,angleRatio:1},w=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"circular\\\",this.options=o(o({},p),t)}return t.prototype.execute=function(t,e){return this.genericCircularLayout(!1,t,e)},t.prototype.assign=function(t,e){var r=this;t.batch((function(){r.genericCircularLayout(!0,t,e)}))},t.prototype.genericCircularLayout=function(t,e,r){var n=o(o({},this.options),r),i=n.width,a=n.height,h=n.center,u=n.divisions,l=n.startAngle,c=void 0===l?0:l,f=n.endAngle,g=void 0===f?2*Math.PI:f,p=n.angleRatio,w=n.ordering,M=n.clockwise,b=n.nodeSpacing,E=n.nodeSize,x=n.layoutInvisibles,S=n.onLayoutEnd,N=e.getAllNodes(),R=e.getAllEdges();x||(N=N.filter((function(t){return t.data.visible||void 0===t.data.visible})),R=R.filter((function(t){return t.data.visible||void 0===t.data.visible})));var I=N.length;if(0===I)return null==S||S({nodes:[],edges:[]}),{nodes:[],edges:[]};var k=s(v(i,a,h),3),A=k[0],T=k[1],D=k[2];if(1===I){t&&e.mergeNodeData(N[0].id,{x:D[0],y:D[1]});var C={nodes:[o(o({},N[0]),{data:o(o({},N[0].data),{x:D[0],y:D[1]})})],edges:R};return null==S||S(C),C}var z=(g-c)/I,P=n.radius,V=n.startRadius,q=n.endRadius;if(b){var j=m(10,b),O=m(10,E),F=-1/0;N.forEach((function(t){var e=O(t);F<e&&(F=e)}));var L=0;N.forEach((function(t,e){L+=0===e?F||10:(j(t)||0)+(F||10)})),P=L/(2*Math.PI)}else P||V||q?!V&&q?V=q:V&&!q&&(q=V):P=Math.min(T,A)/2;var $=z*p,U=[];U=\\\"topology\\\"===w?y(e,N):\\\"topology-directed\\\"===w?y(e,N,!0):\\\"degree\\\"===w?function(t,e){var r=[];return e.forEach((function(t,e){r.push(d(t))})),r.sort((function(e,r){return t.getDegree(e.id,\\\"both\\\")-t.getDegree(r.id,\\\"both\\\")})),r}(e,N):N.map((function(t){return d(t)}));for(var B=Math.ceil(I/u),K=0;K<I;++K){var W=P;W||null===V||null===q||(W=V+K*(q-V)/(I-1)),W||(W=10+100*K/(I-1));var J=c+K%B*$+2*Math.PI/u*Math.floor(K/B);M||(J=g-K%B*$-2*Math.PI/u*Math.floor(K/B)),U[K].data.x=D[0]+Math.cos(J)*W,U[K].data.y=D[1]+Math.sin(J)*W}t&&U.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var _={nodes:U,edges:R};return null==S||S(_),_},t}(),y=function(t,e,r){void 0===r&&(r=!1);var o=[d(e[0])],s={},n=e.length;s[e[0].id]=!0;var i=0;return e.forEach((function(a,h){if(0!==h)if(h!==n-1&&t.getDegree(a.id,\\\"both\\\")===t.getDegree(e[h+1].id,\\\"both\\\")&&!t.areNeighbors(o[i].id,a.id)||s[a.id]){for(var u=r?t.getSuccessors(o[i].id):t.getNeighbors(o[i].id),l=!1,c=0;c<u.length;c++){var f=u[c];if(t.getDegree(f.id)===t.getDegree(a.id)&&!s[f.id]){o.push(d(f)),s[f.id]=!0,l=!0;break}}for(var g=0;!l&&(s[e[g].id]||(o.push(d(e[g])),s[e[g].id]=!0,l=!0),++g!==n););}else o.push(d(a)),s[a.id]=!0,i++})),o},v=function(t,e,r){var o=t,s=e,n=r;return o||\\\"undefined\\\"==typeof window||(o=window.innerWidth),s||\\\"undefined\\\"==typeof window||(s=window.innerHeight),n||(n=[o/2,s/2]),[o,s,n]},M={nodeSize:30,minNodeSpacing:10,nodeSpacing:10,preventOverlap:!1,sweep:void 0,equidistant:!1,startAngle:1.5*Math.PI,clockwise:!0,maxLevelDiff:void 0,sortBy:\\\"degree\\\"},b=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"concentric\\\",Object.assign(this.options,M,t)}return t.prototype.execute=function(t,e){return this.genericConcentricLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericConcentricLayout(!0,t,e)},t.prototype.genericConcentricLayout=function(t,e,r){var s=o(o({},this.options),r),n=s.center,a=s.width,l=s.height,c=s.sortBy,m=s.maxLevelDiff,p=s.sweep,w=s.clockwise,y=s.equidistant,v=s.minNodeSpacing,M=void 0===v?10:v,b=s.preventOverlap,E=s.startAngle,x=void 0===E?1.5*Math.PI:E,S=s.nodeSize,N=s.nodeSpacing,R=s.layoutInvisibles,I=s.onLayoutEnd,k=e.getAllNodes(),A=e.getAllEdges();R||(k=k.filter((function(t){return t.data.visible||void 0===t.data.visible})),A=A.filter((function(t){return t.data.visible||void 0===t.data.visible})));var T=k.length;if(0===T){var D={nodes:[],edges:A};return null==I||I(D),D}var C=a||\\\"undefined\\\"==typeof window?a:window.innerWidth,z=l||\\\"undefined\\\"==typeof window?l:window.innerHeight,P=n||[C/2,z/2];if(1===T){t&&e.mergeNodeData(k[0].id,{x:P[0],y:P[1]});var V={nodes:[o(o({},k[0]),{data:o(o({},k[0].data),{x:P[0],y:P[1]})})],edges:A};return null==I||I(V),V}var q,j=[],O=0;q=h(S)?Math.max(S[0],S[1]):S,h(N)?O=Math.max(N[0],N[1]):u(N)&&(O=N),k.forEach((function(t){j.push(d(t));var e=q;h(t.data.size)?e=Math.max(t.data.size[0],t.data.size[1]):u(t.data.size)?e=t.data.size:f(t.data.size)&&(e=Math.max(t.data.size.width,t.data.size.height)),q=Math.max(q,e),g(N)&&(O=Math.max(N(t),O))}));var F={};j.forEach((function(t,e){F[t.id]=e}));var L=c;i(L)&&void 0!==j[0].data[L]||(L=\\\"degree\\\"),\\\"degree\\\"===L?j.sort((function(t,r){return e.getDegree(r.id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")})):j.sort((function(t,e){return e.data[L]-t.data[L]}));var $=j[0],U=m||$.data[L]/4,B=[{nodes:[]}],K=B[0];j.forEach((function(t){if(K.nodes.length>0){var e=Math.abs(K.nodes[0].data[L]-t.data[L]);U&&e>=U&&(K={nodes:[]},B.push(K))}K.nodes.push(t)}));var W=q+(O||M);if(!b){var J=B.length>0&&B[0].nodes.length>1,_=(Math.min(C,z)/2-W)/(B.length+(J?1:0));W=Math.min(W,_)}var G=0;if(B.forEach((function(t){var e=void 0===p?2*Math.PI-2*Math.PI/t.nodes.length:p;if(t.dTheta=e/Math.max(1,t.nodes.length-1),t.nodes.length>1&&b){var r=Math.cos(t.dTheta)-Math.cos(0),o=Math.sin(t.dTheta)-Math.sin(0),s=Math.sqrt(W*W/(r*r+o*o));G=Math.max(s,G)}t.r=G,G+=W})),y){for(var H=0,Y=0,Q=0;Q<B.length;Q++){var X=(B[Q].r||0)-Y;H=Math.max(H,X)}Y=0,B.forEach((function(t,e){0===e&&(Y=t.r||0),t.r=Y,Y+=H}))}B.forEach((function(t){var e=t.dTheta||0,r=t.r||0;t.nodes.forEach((function(t,o){var s=x+(w?1:-1)*e*o;t.data.x=P[0]+r*Math.cos(s),t.data.y=P[1]+r*Math.sin(s)}))})),t&&j.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var Z={nodes:j,edges:A};return null==I||I(Z),Z},t}(),E={begin:[0,0],preventOverlap:!0,preventOverlapPadding:10,condense:!1,rows:void 0,cols:void 0,position:void 0,sortBy:\\\"degree\\\",nodeSize:30,width:300,height:300},x=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"grid\\\",Object.assign(this.options,E,t)}return t.prototype.execute=function(t,e){return this.genericGridLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericGridLayout(!0,t,e)},t.prototype.genericGridLayout=function(t,e,r){var s=o(o({},this.options),r),n=s.begin,a=void 0===n?[0,0]:n,u=s.condense,l=s.preventOverlapPadding,c=s.preventOverlap,f=s.columns,g=s.rows,p=s.cols,w=void 0===p?f:p,y=s.nodeSpacing,v=s.nodeSize,M=s.onLayoutEnd,b=s.position,E=s.sortBy,x=s.width,k=s.height,T=s.layoutInvisibles,D=e.getAllNodes(),C=e.getAllEdges();T||(D=D.filter((function(t){return t.data.visible||void 0===t.data.visible})),C=C.filter((function(t){return t.data.visible||void 0===t.data.visible})));var z=D.length;if(0===z){var P={nodes:[],edges:C};return null==M||M(P),P}if(1===z){t&&e.mergeNodeData(D[0].id,{x:a[0],y:a[1]});var V={nodes:[o(o({},D[0]),{data:o(o({},D[0].data),{x:a[0],y:a[1]})})],edges:C};return null==M||M(V),V}var q=D.map((function(t){return d(t)}));i(E)&&void 0!==q[0].data[E]||(E=\\\"degree\\\"),\\\"degree\\\"===E?q.sort((function(t,r){return e.getDegree(r.id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")})):q.sort((function(t,e){return e.data[E]-t.data[E]}));var j=x||\\\"undefined\\\"==typeof window?x:window.innerWidth,O=k||\\\"undefined\\\"==typeof window?k:window.innerHeight,F=z,L={rows:g,cols:w};if(null!=g&&null!=w)L.rows=g,L.cols=w;else if(null!=g&&null==w)L.rows=g,L.cols=Math.ceil(F/L.rows);else if(null==g&&null!=w)L.cols=w,L.rows=Math.ceil(F/L.cols);else{var $=Math.sqrt(F*O/j);L.rows=Math.round($),L.cols=Math.round(j/O*$)}if(L.rows=Math.max(L.rows,1),L.cols=Math.max(L.cols,1),L.cols*L.rows>F)((B=S(L))-1)*(U=N(L))>=F?S(L,B-1):(U-1)*B>=F&&N(L,U-1);else for(;L.cols*L.rows<F;){var U,B=S(L);((U=N(L))+1)*B>=F?N(L,U+1):S(L,B+1)}var K=u?0:j/L.cols,W=u?0:O/L.rows;if(c||y){var J=m(10,y),_=m(30,v,!1);q.forEach((function(t){t.data.x&&t.data.y||(t.data.x=0,t.data.y=0);var r,o,s=e.getNode(t.id),n=_(s)||30;h(n)?(r=n[0],o=n[1]):(r=n,o=n);var i=void 0!==J?J(t):l,a=r+i,u=o+i;K=Math.max(K,a),W=Math.max(W,u)}))}for(var G={},H={row:0,col:0},Y={},Q=0;Q<q.length;Q++){var X=q[Q],Z=void 0;if(b&&(Z=b(e.getNode(X.id))),Z&&(void 0!==Z.row||void 0!==Z.col)){var tt={row:Z.row,col:Z.col};if(void 0===tt.col)for(tt.col=0;R(G,tt);)tt.col++;else if(void 0===tt.row)for(tt.row=0;R(G,tt);)tt.row++;Y[X.id]=tt,I(G,tt)}A(X,a,K,W,Y,L,H,G)}var et={nodes:q,edges:C};return null==M||M(et),t&&q.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),et},t}(),S=function(t,e){var r,o=t.rows||5,s=t.cols||5;return null==e?r=Math.min(o,s):Math.min(o,s)===t.rows?t.rows=e:t.cols=e,r},N=function(t,e){var r,o=t.rows||5,s=t.cols||5;return null==e?r=Math.max(o,s):Math.max(o,s)===t.rows?t.rows=e:t.cols=e,r},R=function(t,e){return t[\\\"c-\\\".concat(e.row,\\\"-\\\").concat(e.col)]||!1},I=function(t,e){return t[\\\"c-\\\".concat(e.row,\\\"-\\\").concat(e.col)]=!0},k=function(t,e){var r=t.cols||5;e.col++,e.col>=r&&(e.col=0,e.row++)},A=function(t,e,r,o,s,n,i,a){var h,u,l=s[t.id];if(l)h=l.col*r+r/2+e[0],u=l.row*o+o/2+e[1];else{for(;R(a,i);)k(n,i);h=i.col*r+r/2+e[0],u=i.row*o+o/2+e[1],I(a,i),k(n,i)}t.data.x=h,t.data.y=u};const T=Object.prototype.toString;function D(t){return T.call(t).endsWith(\\\"Array]\\\")}function C(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!D(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");var r=e.fromIndex,o=void 0===r?0:r,s=e.toIndex,n=void 0===s?t.length:s;if(o<0||o>=t.length||!Number.isInteger(o))throw new Error(\\\"fromIndex must be a positive integer smaller than length\\\");if(n<=o||n>t.length||!Number.isInteger(n))throw new Error(\\\"toIndex must be an integer greater than fromIndex and at most equal to length\\\");for(var i=t[o],a=o+1;a<n;a++)t[a]>i&&(i=t[a]);return i}function z(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!D(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");var r=e.fromIndex,o=void 0===r?0:r,s=e.toIndex,n=void 0===s?t.length:s;if(o<0||o>=t.length||!Number.isInteger(o))throw new Error(\\\"fromIndex must be a positive integer smaller than length\\\");if(n<=o||n>t.length||!Number.isInteger(n))throw new Error(\\\"toIndex must be an integer greater than fromIndex and at most equal to length\\\");for(var i=t[o],a=o+1;a<n;a++)t[a]<i&&(i=t[a]);return i}function P(t){var e,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!D(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");if(void 0!==r.output){if(!D(r.output))throw new TypeError(\\\"output option must be an array if specified\\\");e=r.output}else e=new Array(t.length);var o=z(t),s=C(t);if(o===s)throw new RangeError(\\\"minimum and maximum input values are equal. Cannot rescale a constant array\\\");var n=r.min,i=void 0===n?r.autoMinMax?o:0:n,a=r.max,h=void 0===a?r.autoMinMax?s:1:a;if(i>=h)throw new RangeError(\\\"min option must be smaller than max option\\\");for(var u=(h-i)/(s-o),l=0;l<t.length;l++)e[l]=(t[l]-o)*u+i;return e}const V=\\\" \\\".repeat(2),q=\\\" \\\".repeat(4);function j(t,e={}){const{maxRows:r=15,maxColumns:o=10,maxNumSize:s=8,padMinus:n=\\\"auto\\\"}=e;return`${t.constructor.name} {\\\\n${V}[\\\\n${q}${function(t,e,r,o,s){const{rows:n,columns:i}=t,a=Math.min(n,e),h=Math.min(i,r),u=[];if(\\\"auto\\\"===s){s=!1;t:for(let e=0;e<a;e++)for(let r=0;r<h;r++)if(t.get(e,r)<0){s=!0;break t}}for(let e=0;e<a;e++){let r=[];for(let n=0;n<h;n++)r.push(O(t.get(e,n),o,s));u.push(`${r.join(\\\" \\\")}`)}return h!==i&&(u[u.length-1]+=` ... ${i-r} more columns`),a!==n&&u.push(`... ${n-e} more rows`),u.join(`\\\\n${q}`)}(t,r,o,s,n)}\\\\n${V}]\\\\n${V}rows: ${t.rows}\\\\n${V}columns: ${t.columns}\\\\n}`}function O(t,e,r){return(t>=0&&r?` ${F(t,e-1)}`:F(t,e)).padEnd(e)}function F(t,e){let r=t.toString();if(r.length<=e)return r;let o=t.toFixed(e);if(o.length>e&&(o=t.toFixed(Math.max(0,e-(o.length-e)))),o.length<=e&&!o.startsWith(\\\"0.000\\\")&&!o.startsWith(\\\"-0.000\\\"))return o;let s=t.toExponential(e);return s.length>e&&(s=t.toExponential(Math.max(0,e-(s.length-e)))),s.slice(0)}function L(t,e,r){let o=r?t.rows:t.rows-1;if(e<0||e>o)throw new RangeError(\\\"Row index out of range\\\")}function $(t,e,r){let o=r?t.columns:t.columns-1;if(e<0||e>o)throw new RangeError(\\\"Column index out of range\\\")}function U(t,e){if(e.to1DArray&&(e=e.to1DArray()),e.length!==t.columns)throw new RangeError(\\\"vector size must be the same as the number of columns\\\");return e}function B(t,e){if(e.to1DArray&&(e=e.to1DArray()),e.length!==t.rows)throw new RangeError(\\\"vector size must be the same as the number of rows\\\");return e}function K(t,e,r,o,s){if(5!==arguments.length)throw new RangeError(\\\"expected 4 arguments\\\");if(J(\\\"startRow\\\",e),J(\\\"endRow\\\",r),J(\\\"startColumn\\\",o),J(\\\"endColumn\\\",s),e>r||o>s||e<0||e>=t.rows||r<0||r>=t.rows||o<0||o>=t.columns||s<0||s>=t.columns)throw new RangeError(\\\"Submatrix indices are out of range\\\")}function W(t,e=0){let r=[];for(let o=0;o<t;o++)r.push(e);return r}function J(t,e){if(\\\"number\\\"!=typeof e)throw new TypeError(`${t} must be a number`)}function _(t){if(t.isEmpty())throw new Error(\\\"Empty matrix has no elements to index\\\")}class G{static from1DArray(t,e,r){if(t*e!==r.length)throw new RangeError(\\\"data length does not match given dimensions\\\");let o=new Y(t,e);for(let s=0;s<t;s++)for(let t=0;t<e;t++)o.set(s,t,r[s*e+t]);return o}static rowVector(t){let e=new Y(1,t.length);for(let r=0;r<t.length;r++)e.set(0,r,t[r]);return e}static columnVector(t){let e=new Y(t.length,1);for(let r=0;r<t.length;r++)e.set(r,0,t[r]);return e}static zeros(t,e){return new Y(t,e)}static ones(t,e){return new Y(t,e).fill(1)}static rand(t,e,r={}){if(\\\"object\\\"!=typeof r)throw new TypeError(\\\"options must be an object\\\");const{random:o=Math.random}=r;let s=new Y(t,e);for(let r=0;r<t;r++)for(let t=0;t<e;t++)s.set(r,t,o());return s}static randInt(t,e,r={}){if(\\\"object\\\"!=typeof r)throw new TypeError(\\\"options must be an object\\\");const{min:o=0,max:s=1e3,random:n=Math.random}=r;if(!Number.isInteger(o))throw new TypeError(\\\"min must be an integer\\\");if(!Number.isInteger(s))throw new TypeError(\\\"max must be an integer\\\");if(o>=s)throw new RangeError(\\\"min must be smaller than max\\\");let i=s-o,a=new Y(t,e);for(let r=0;r<t;r++)for(let t=0;t<e;t++){let e=o+Math.round(n()*i);a.set(r,t,e)}return a}static eye(t,e,r){void 0===e&&(e=t),void 0===r&&(r=1);let o=Math.min(t,e),s=this.zeros(t,e);for(let t=0;t<o;t++)s.set(t,t,r);return s}static diag(t,e,r){let o=t.length;void 0===e&&(e=o),void 0===r&&(r=e);let s=Math.min(o,e,r),n=this.zeros(e,r);for(let e=0;e<s;e++)n.set(e,e,t[e]);return n}static min(t,e){t=this.checkMatrix(t),e=this.checkMatrix(e);let r=t.rows,o=t.columns,s=new Y(r,o);for(let n=0;n<r;n++)for(let r=0;r<o;r++)s.set(n,r,Math.min(t.get(n,r),e.get(n,r)));return s}static max(t,e){t=this.checkMatrix(t),e=this.checkMatrix(e);let r=t.rows,o=t.columns,s=new this(r,o);for(let n=0;n<r;n++)for(let r=0;r<o;r++)s.set(n,r,Math.max(t.get(n,r),e.get(n,r)));return s}static checkMatrix(t){return G.isMatrix(t)?t:new Y(t)}static isMatrix(t){return null!=t&&\\\"Matrix\\\"===t.klass}get size(){return this.rows*this.columns}apply(t){if(\\\"function\\\"!=typeof t)throw new TypeError(\\\"callback must be a function\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.call(this,e,r);return this}to1DArray(){let t=[];for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.push(this.get(e,r));return t}to2DArray(){let t=[];for(let e=0;e<this.rows;e++){t.push([]);for(let r=0;r<this.columns;r++)t[e].push(this.get(e,r))}return t}toJSON(){return this.to2DArray()}isRowVector(){return 1===this.rows}isColumnVector(){return 1===this.columns}isVector(){return 1===this.rows||1===this.columns}isSquare(){return this.rows===this.columns}isEmpty(){return 0===this.rows||0===this.columns}isSymmetric(){if(this.isSquare()){for(let t=0;t<this.rows;t++)for(let e=0;e<=t;e++)if(this.get(t,e)!==this.get(e,t))return!1;return!0}return!1}isEchelonForm(){let t=0,e=0,r=-1,o=!0,s=!1;for(;t<this.rows&&o;){for(e=0,s=!1;e<this.columns&&!1===s;)0===this.get(t,e)?e++:1===this.get(t,e)&&e>r?(s=!0,r=e):(o=!1,s=!0);t++}return o}isReducedEchelonForm(){let t=0,e=0,r=-1,o=!0,s=!1;for(;t<this.rows&&o;){for(e=0,s=!1;e<this.columns&&!1===s;)0===this.get(t,e)?e++:1===this.get(t,e)&&e>r?(s=!0,r=e):(o=!1,s=!0);for(let r=e+1;r<this.rows;r++)0!==this.get(t,r)&&(o=!1);t++}return o}echelonForm(){let t=this.clone(),e=0,r=0;for(;e<t.rows&&r<t.columns;){let o=e;for(let s=e;s<t.rows;s++)t.get(s,r)>t.get(o,r)&&(o=s);if(0===t.get(o,r))r++;else{t.swapRows(e,o);let s=t.get(e,r);for(let o=r;o<t.columns;o++)t.set(e,o,t.get(e,o)/s);for(let o=e+1;o<t.rows;o++){let s=t.get(o,r)/t.get(e,r);t.set(o,r,0);for(let n=r+1;n<t.columns;n++)t.set(o,n,t.get(o,n)-t.get(e,n)*s)}e++,r++}}return t}reducedEchelonForm(){let t=this.echelonForm(),e=t.columns,r=t.rows,o=r-1;for(;o>=0;)if(0===t.maxRow(o))o--;else{let s=0,n=!1;for(;s<r&&!1===n;)1===t.get(o,s)?n=!0:s++;for(let r=0;r<o;r++){let n=t.get(r,s);for(let i=s;i<e;i++){let e=t.get(r,i)-n*t.get(o,i);t.set(r,i,e)}}o--}return t}set(){throw new Error(\\\"set method is unimplemented\\\")}get(){throw new Error(\\\"get method is unimplemented\\\")}repeat(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{rows:e=1,columns:r=1}=t;if(!Number.isInteger(e)||e<=0)throw new TypeError(\\\"rows must be a positive integer\\\");if(!Number.isInteger(r)||r<=0)throw new TypeError(\\\"columns must be a positive integer\\\");let o=new Y(this.rows*e,this.columns*r);for(let t=0;t<e;t++)for(let e=0;e<r;e++)o.setSubMatrix(this,this.rows*t,this.columns*e);return o}fill(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,t);return this}neg(){return this.mulS(-1)}getRow(t){L(this,t);let e=[];for(let r=0;r<this.columns;r++)e.push(this.get(t,r));return e}getRowVector(t){return Y.rowVector(this.getRow(t))}setRow(t,e){L(this,t),e=U(this,e);for(let r=0;r<this.columns;r++)this.set(t,r,e[r]);return this}swapRows(t,e){L(this,t),L(this,e);for(let r=0;r<this.columns;r++){let o=this.get(t,r);this.set(t,r,this.get(e,r)),this.set(e,r,o)}return this}getColumn(t){$(this,t);let e=[];for(let r=0;r<this.rows;r++)e.push(this.get(r,t));return e}getColumnVector(t){return Y.columnVector(this.getColumn(t))}setColumn(t,e){$(this,t),e=B(this,e);for(let r=0;r<this.rows;r++)this.set(r,t,e[r]);return this}swapColumns(t,e){$(this,t),$(this,e);for(let r=0;r<this.rows;r++){let o=this.get(r,t);this.set(r,t,this.get(r,e)),this.set(r,e,o)}return this}addRowVector(t){t=U(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t[r]);return this}subRowVector(t){t=U(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t[r]);return this}mulRowVector(t){t=U(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t[r]);return this}divRowVector(t){t=U(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t[r]);return this}addColumnVector(t){t=B(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t[e]);return this}subColumnVector(t){t=B(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t[e]);return this}mulColumnVector(t){t=B(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t[e]);return this}divColumnVector(t){t=B(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t[e]);return this}mulRow(t,e){L(this,t);for(let r=0;r<this.columns;r++)this.set(t,r,this.get(t,r)*e);return this}mulColumn(t,e){$(this,t);for(let r=0;r<this.rows;r++)this.set(r,t,this.get(r,t)*e);return this}max(t){if(this.isEmpty())return NaN;switch(t){case\\\"row\\\":{const t=new Array(this.rows).fill(Number.NEGATIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t[e]&&(t[e]=this.get(e,r));return t}case\\\"column\\\":{const t=new Array(this.columns).fill(Number.NEGATIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t[r]&&(t[r]=this.get(e,r));return t}case void 0:{let t=this.get(0,0);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t&&(t=this.get(e,r));return t}default:throw new Error(`invalid option: ${t}`)}}maxIndex(){_(this);let t=this.get(0,0),e=[0,0];for(let r=0;r<this.rows;r++)for(let o=0;o<this.columns;o++)this.get(r,o)>t&&(t=this.get(r,o),e[0]=r,e[1]=o);return e}min(t){if(this.isEmpty())return NaN;switch(t){case\\\"row\\\":{const t=new Array(this.rows).fill(Number.POSITIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t[e]&&(t[e]=this.get(e,r));return t}case\\\"column\\\":{const t=new Array(this.columns).fill(Number.POSITIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t[r]&&(t[r]=this.get(e,r));return t}case void 0:{let t=this.get(0,0);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t&&(t=this.get(e,r));return t}default:throw new Error(`invalid option: ${t}`)}}minIndex(){_(this);let t=this.get(0,0),e=[0,0];for(let r=0;r<this.rows;r++)for(let o=0;o<this.columns;o++)this.get(r,o)<t&&(t=this.get(r,o),e[0]=r,e[1]=o);return e}maxRow(t){if(L(this,t),this.isEmpty())return NaN;let e=this.get(t,0);for(let r=1;r<this.columns;r++)this.get(t,r)>e&&(e=this.get(t,r));return e}maxRowIndex(t){L(this,t),_(this);let e=this.get(t,0),r=[t,0];for(let o=1;o<this.columns;o++)this.get(t,o)>e&&(e=this.get(t,o),r[1]=o);return r}minRow(t){if(L(this,t),this.isEmpty())return NaN;let e=this.get(t,0);for(let r=1;r<this.columns;r++)this.get(t,r)<e&&(e=this.get(t,r));return e}minRowIndex(t){L(this,t),_(this);let e=this.get(t,0),r=[t,0];for(let o=1;o<this.columns;o++)this.get(t,o)<e&&(e=this.get(t,o),r[1]=o);return r}maxColumn(t){if($(this,t),this.isEmpty())return NaN;let e=this.get(0,t);for(let r=1;r<this.rows;r++)this.get(r,t)>e&&(e=this.get(r,t));return e}maxColumnIndex(t){$(this,t),_(this);let e=this.get(0,t),r=[0,t];for(let o=1;o<this.rows;o++)this.get(o,t)>e&&(e=this.get(o,t),r[0]=o);return r}minColumn(t){if($(this,t),this.isEmpty())return NaN;let e=this.get(0,t);for(let r=1;r<this.rows;r++)this.get(r,t)<e&&(e=this.get(r,t));return e}minColumnIndex(t){$(this,t),_(this);let e=this.get(0,t),r=[0,t];for(let o=1;o<this.rows;o++)this.get(o,t)<e&&(e=this.get(o,t),r[0]=o);return r}diag(){let t=Math.min(this.rows,this.columns),e=[];for(let r=0;r<t;r++)e.push(this.get(r,r));return e}norm(t=\\\"frobenius\\\"){let e=0;if(\\\"max\\\"===t)return this.max();if(\\\"frobenius\\\"===t){for(let t=0;t<this.rows;t++)for(let r=0;r<this.columns;r++)e+=this.get(t,r)*this.get(t,r);return Math.sqrt(e)}throw new RangeError(`unknown norm type: ${t}`)}cumulativeSum(){let t=0;for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t+=this.get(e,r),this.set(e,r,t);return this}dot(t){G.isMatrix(t)&&(t=t.to1DArray());let e=this.to1DArray();if(e.length!==t.length)throw new RangeError(\\\"vectors do not have the same size\\\");let r=0;for(let o=0;o<e.length;o++)r+=e[o]*t[o];return r}mmul(t){t=Y.checkMatrix(t);let e=this.rows,r=this.columns,o=t.columns,s=new Y(e,o),n=new Float64Array(r);for(let i=0;i<o;i++){for(let e=0;e<r;e++)n[e]=t.get(e,i);for(let t=0;t<e;t++){let e=0;for(let o=0;o<r;o++)e+=this.get(t,o)*n[o];s.set(t,i,e)}}return s}strassen2x2(t){t=Y.checkMatrix(t);let e=new Y(2,2);const r=this.get(0,0),o=t.get(0,0),s=this.get(0,1),n=t.get(0,1),i=this.get(1,0),a=t.get(1,0),h=this.get(1,1),u=t.get(1,1),l=(r+h)*(o+u),c=(i+h)*o,f=r*(n-u),d=h*(a-o),g=(r+s)*u,m=l+d-g+(s-h)*(a+u),p=f+g,w=c+d,y=l-c+f+(i-r)*(o+n);return e.set(0,0,m),e.set(0,1,p),e.set(1,0,w),e.set(1,1,y),e}strassen3x3(t){t=Y.checkMatrix(t);let e=new Y(3,3);const r=this.get(0,0),o=this.get(0,1),s=this.get(0,2),n=this.get(1,0),i=this.get(1,1),a=this.get(1,2),h=this.get(2,0),u=this.get(2,1),l=this.get(2,2),c=t.get(0,0),f=t.get(0,1),d=t.get(0,2),g=t.get(1,0),m=t.get(1,1),p=t.get(1,2),w=t.get(2,0),y=t.get(2,1),v=t.get(2,2),M=(r-n)*(-f+m),b=(-r+n+i)*(c-f+m),E=(n+i)*(-c+f),x=r*c,S=(-r+h+u)*(c-d+p),N=(-r+h)*(d-p),R=(h+u)*(-c+d),I=(-s+u+l)*(m+w-y),k=(s-l)*(m-y),A=s*w,T=(u+l)*(-w+y),D=(-s+i+a)*(p+w-v),C=(s-a)*(p-v),z=(i+a)*(-w+v),P=x+A+o*g,V=(r+o+s-n-i-u-l)*m+b+E+x+I+A+T,q=x+S+R+(r+o+s-i-a-h-u)*p+A+D+z,j=M+i*(-c+f+g-m-p-w+v)+b+x+A+D+C,O=M+b+E+x+a*y,F=A+D+C+z+n*d,L=x+S+N+u*(-c+d+g-m-p-w+y)+I+k+A,$=I+k+A+T+h*f,U=x+S+N+R+l*v;return e.set(0,0,P),e.set(0,1,V),e.set(0,2,q),e.set(1,0,j),e.set(1,1,O),e.set(1,2,F),e.set(2,0,L),e.set(2,1,$),e.set(2,2,U),e}mmulStrassen(t){t=Y.checkMatrix(t);let e=this.clone(),r=e.rows,o=e.columns,s=t.rows,n=t.columns;function i(t,e,r){let o=t.rows,s=t.columns;if(o===e&&s===r)return t;{let o=G.zeros(e,r);return o=o.setSubMatrix(t,0,0),o}}o!==s&&console.warn(`Multiplying ${r} x ${o} and ${s} x ${n} matrix: dimensions do not match.`);let a=Math.max(r,s),h=Math.max(o,n);return e=i(e,a,h),function t(e,r,o,s){if(o<=512||s<=512)return e.mmul(r);o%2==1&&s%2==1?(e=i(e,o+1,s+1),r=i(r,o+1,s+1)):o%2==1?(e=i(e,o+1,s),r=i(r,o+1,s)):s%2==1&&(e=i(e,o,s+1),r=i(r,o,s+1));let n=parseInt(e.rows/2,10),a=parseInt(e.columns/2,10),h=e.subMatrix(0,n-1,0,a-1),u=r.subMatrix(0,n-1,0,a-1),l=e.subMatrix(0,n-1,a,e.columns-1),c=r.subMatrix(0,n-1,a,r.columns-1),f=e.subMatrix(n,e.rows-1,0,a-1),d=r.subMatrix(n,r.rows-1,0,a-1),g=e.subMatrix(n,e.rows-1,a,e.columns-1),m=r.subMatrix(n,r.rows-1,a,r.columns-1),p=t(G.add(h,g),G.add(u,m),n,a),w=t(G.add(f,g),u,n,a),y=t(h,G.sub(c,m),n,a),v=t(g,G.sub(d,u),n,a),M=t(G.add(h,l),m,n,a),b=t(G.sub(f,h),G.add(u,c),n,a),E=t(G.sub(l,g),G.add(d,m),n,a),x=G.add(p,v);x.sub(M),x.add(E);let S=G.add(y,M),N=G.add(w,v),R=G.sub(p,w);R.add(y),R.add(b);let I=G.zeros(2*x.rows,2*x.columns);return I=I.setSubMatrix(x,0,0),I=I.setSubMatrix(S,x.rows,0),I=I.setSubMatrix(N,0,x.columns),I=I.setSubMatrix(R,x.rows,x.columns),I.subMatrix(0,o-1,0,s-1)}(e,t=i(t,a,h),a,h)}scaleRows(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{min:e=0,max:r=1}=t;if(!Number.isFinite(e))throw new TypeError(\\\"min must be a number\\\");if(!Number.isFinite(r))throw new TypeError(\\\"max must be a number\\\");if(e>=r)throw new RangeError(\\\"min must be smaller than max\\\");let o=new Y(this.rows,this.columns);for(let t=0;t<this.rows;t++){const s=this.getRow(t);s.length>0&&P(s,{min:e,max:r,output:s}),o.setRow(t,s)}return o}scaleColumns(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{min:e=0,max:r=1}=t;if(!Number.isFinite(e))throw new TypeError(\\\"min must be a number\\\");if(!Number.isFinite(r))throw new TypeError(\\\"max must be a number\\\");if(e>=r)throw new RangeError(\\\"min must be smaller than max\\\");let o=new Y(this.rows,this.columns);for(let t=0;t<this.columns;t++){const s=this.getColumn(t);s.length&&P(s,{min:e,max:r,output:s}),o.setColumn(t,s)}return o}flipRows(){const t=Math.ceil(this.columns/2);for(let e=0;e<this.rows;e++)for(let r=0;r<t;r++){let t=this.get(e,r),o=this.get(e,this.columns-1-r);this.set(e,r,o),this.set(e,this.columns-1-r,t)}return this}flipColumns(){const t=Math.ceil(this.rows/2);for(let e=0;e<this.columns;e++)for(let r=0;r<t;r++){let t=this.get(r,e),o=this.get(this.rows-1-r,e);this.set(r,e,o),this.set(this.rows-1-r,e,t)}return this}kroneckerProduct(t){t=Y.checkMatrix(t);let e=this.rows,r=this.columns,o=t.rows,s=t.columns,n=new Y(e*o,r*s);for(let i=0;i<e;i++)for(let e=0;e<r;e++)for(let r=0;r<o;r++)for(let a=0;a<s;a++)n.set(o*i+r,s*e+a,this.get(i,e)*t.get(r,a));return n}kroneckerSum(t){if(t=Y.checkMatrix(t),!this.isSquare()||!t.isSquare())throw new Error(\\\"Kronecker Sum needs two Square Matrices\\\");let e=this.rows,r=t.rows,o=this.kroneckerProduct(Y.eye(r,r)),s=Y.eye(e,e).kroneckerProduct(t);return o.add(s)}transpose(){let t=new Y(this.columns,this.rows);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.set(r,e,this.get(e,r));return t}sortRows(t=H){for(let e=0;e<this.rows;e++)this.setRow(e,this.getRow(e).sort(t));return this}sortColumns(t=H){for(let e=0;e<this.columns;e++)this.setColumn(e,this.getColumn(e).sort(t));return this}subMatrix(t,e,r,o){K(this,t,e,r,o);let s=new Y(e-t+1,o-r+1);for(let n=t;n<=e;n++)for(let e=r;e<=o;e++)s.set(n-t,e-r,this.get(n,e));return s}subMatrixRow(t,e,r){if(void 0===e&&(e=0),void 0===r&&(r=this.columns-1),e>r||e<0||e>=this.columns||r<0||r>=this.columns)throw new RangeError(\\\"Argument out of range\\\");let o=new Y(t.length,r-e+1);for(let s=0;s<t.length;s++)for(let n=e;n<=r;n++){if(t[s]<0||t[s]>=this.rows)throw new RangeError(`Row index out of range: ${t[s]}`);o.set(s,n-e,this.get(t[s],n))}return o}subMatrixColumn(t,e,r){if(void 0===e&&(e=0),void 0===r&&(r=this.rows-1),e>r||e<0||e>=this.rows||r<0||r>=this.rows)throw new RangeError(\\\"Argument out of range\\\");let o=new Y(r-e+1,t.length);for(let s=0;s<t.length;s++)for(let n=e;n<=r;n++){if(t[s]<0||t[s]>=this.columns)throw new RangeError(`Column index out of range: ${t[s]}`);o.set(n-e,s,this.get(n,t[s]))}return o}setSubMatrix(t,e,r){if((t=Y.checkMatrix(t)).isEmpty())return this;K(this,e,e+t.rows-1,r,r+t.columns-1);for(let o=0;o<t.rows;o++)for(let s=0;s<t.columns;s++)this.set(e+o,r+s,t.get(o,s));return this}selection(t,e){!function(t,e){if(!D(e))throw new TypeError(\\\"row indices must be an array\\\");for(let r=0;r<e.length;r++)if(e[r]<0||e[r]>=t.rows)throw new RangeError(\\\"row indices are out of range\\\")}(this,t),function(t,e){if(!D(e))throw new TypeError(\\\"column indices must be an array\\\");for(let r=0;r<e.length;r++)if(e[r]<0||e[r]>=t.columns)throw new RangeError(\\\"column indices are out of range\\\")}(this,e);let r=new Y(t.length,e.length);for(let o=0;o<t.length;o++){let s=t[o];for(let t=0;t<e.length;t++){let n=e[t];r.set(o,t,this.get(s,n))}}return r}trace(){let t=Math.min(this.rows,this.columns),e=0;for(let r=0;r<t;r++)e+=this.get(r,r);return e}clone(){let t=new Y(this.rows,this.columns);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.set(e,r,this.get(e,r));return t}sum(t){switch(t){case\\\"row\\\":return function(t){let e=W(t.rows);for(let r=0;r<t.rows;++r)for(let o=0;o<t.columns;++o)e[r]+=t.get(r,o);return e}(this);case\\\"column\\\":return function(t){let e=W(t.columns);for(let r=0;r<t.rows;++r)for(let o=0;o<t.columns;++o)e[o]+=t.get(r,o);return e}(this);case void 0:return function(t){let e=0;for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)e+=t.get(r,o);return e}(this);default:throw new Error(`invalid option: ${t}`)}}product(t){switch(t){case\\\"row\\\":return function(t){let e=W(t.rows,1);for(let r=0;r<t.rows;++r)for(let o=0;o<t.columns;++o)e[r]*=t.get(r,o);return e}(this);case\\\"column\\\":return function(t){let e=W(t.columns,1);for(let r=0;r<t.rows;++r)for(let o=0;o<t.columns;++o)e[o]*=t.get(r,o);return e}(this);case void 0:return function(t){let e=1;for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)e*=t.get(r,o);return e}(this);default:throw new Error(`invalid option: ${t}`)}}mean(t){const e=this.sum(t);switch(t){case\\\"row\\\":for(let t=0;t<this.rows;t++)e[t]/=this.columns;return e;case\\\"column\\\":for(let t=0;t<this.columns;t++)e[t]/=this.rows;return e;case void 0:return e/this.size;default:throw new Error(`invalid option: ${t}`)}}variance(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");const{unbiased:r=!0,mean:o=this.mean(t)}=e;if(\\\"boolean\\\"!=typeof r)throw new TypeError(\\\"unbiased must be a boolean\\\");switch(t){case\\\"row\\\":if(!D(o))throw new TypeError(\\\"mean must be an array\\\");return function(t,e,r){const o=t.rows,s=t.columns,n=[];for(let i=0;i<o;i++){let o=0,a=0,h=0;for(let e=0;e<s;e++)h=t.get(i,e)-r[i],o+=h,a+=h*h;e?n.push((a-o*o/s)/(s-1)):n.push((a-o*o/s)/s)}return n}(this,r,o);case\\\"column\\\":if(!D(o))throw new TypeError(\\\"mean must be an array\\\");return function(t,e,r){const o=t.rows,s=t.columns,n=[];for(let i=0;i<s;i++){let s=0,a=0,h=0;for(let e=0;e<o;e++)h=t.get(e,i)-r[i],s+=h,a+=h*h;e?n.push((a-s*s/o)/(o-1)):n.push((a-s*s/o)/o)}return n}(this,r,o);case void 0:if(\\\"number\\\"!=typeof o)throw new TypeError(\\\"mean must be a number\\\");return function(t,e,r){const o=t.rows,s=t.columns,n=o*s;let i=0,a=0,h=0;for(let e=0;e<o;e++)for(let o=0;o<s;o++)h=t.get(e,o)-r,i+=h,a+=h*h;return e?(a-i*i/n)/(n-1):(a-i*i/n)/n}(this,r,o);default:throw new Error(`invalid option: ${t}`)}}standardDeviation(t,e){\\\"object\\\"==typeof t&&(e=t,t=void 0);const r=this.variance(t,e);if(void 0===t)return Math.sqrt(r);for(let t=0;t<r.length;t++)r[t]=Math.sqrt(r[t]);return r}center(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");const{center:r=this.mean(t)}=e;switch(t){case\\\"row\\\":if(!D(r))throw new TypeError(\\\"center must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)-e[r])}(this,r),this;case\\\"column\\\":if(!D(r))throw new TypeError(\\\"center must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)-e[o])}(this,r),this;case void 0:if(\\\"number\\\"!=typeof r)throw new TypeError(\\\"center must be a number\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)-e)}(this,r),this;default:throw new Error(`invalid option: ${t}`)}}scale(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");let r=e.scale;switch(t){case\\\"row\\\":if(void 0===r)r=function(t){const e=[];for(let r=0;r<t.rows;r++){let o=0;for(let e=0;e<t.columns;e++)o+=Math.pow(t.get(r,e),2)/(t.columns-1);e.push(Math.sqrt(o))}return e}(this);else if(!D(r))throw new TypeError(\\\"scale must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)/e[r])}(this,r),this;case\\\"column\\\":if(void 0===r)r=function(t){const e=[];for(let r=0;r<t.columns;r++){let o=0;for(let e=0;e<t.rows;e++)o+=Math.pow(t.get(e,r),2)/(t.rows-1);e.push(Math.sqrt(o))}return e}(this);else if(!D(r))throw new TypeError(\\\"scale must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)/e[o])}(this,r),this;case void 0:if(void 0===r)r=function(t){const e=t.size-1;let r=0;for(let o=0;o<t.columns;o++)for(let s=0;s<t.rows;s++)r+=Math.pow(t.get(s,o),2)/e;return Math.sqrt(r)}(this);else if(\\\"number\\\"!=typeof r)throw new TypeError(\\\"scale must be a number\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)/e)}(this,r),this;default:throw new Error(`invalid option: ${t}`)}}toString(t){return j(this,t)}}function H(t,e){return t-e}G.prototype.klass=\\\"Matrix\\\",\\\"undefined\\\"!=typeof Symbol&&(G.prototype[Symbol.for(\\\"nodejs.util.inspect.custom\\\")]=function(){return j(this)}),G.random=G.rand,G.randomInt=G.randInt,G.diagonal=G.diag,G.prototype.diagonal=G.prototype.diag,G.identity=G.eye,G.prototype.negate=G.prototype.neg,G.prototype.tensorProduct=G.prototype.kroneckerProduct;class Y extends G{constructor(t,e){if(super(),Y.isMatrix(t))return t.clone();if(Number.isInteger(t)&&t>=0){if(this.data=[],!(Number.isInteger(e)&&e>=0))throw new TypeError(\\\"nColumns must be a positive integer\\\");for(let r=0;r<t;r++)this.data.push(new Float64Array(e))}else{if(!D(t))throw new TypeError(\\\"First argument must be a positive number or an array\\\");{const r=t;if(\\\"number\\\"!=typeof(e=(t=r.length)?r[0].length:0))throw new TypeError(\\\"Data must be a 2D array with at least one element\\\");this.data=[];for(let o=0;o<t;o++){if(r[o].length!==e)throw new RangeError(\\\"Inconsistent array dimensions\\\");if(!r[o].every((t=>\\\"number\\\"==typeof t)))throw new TypeError(\\\"Input data contains non-numeric values\\\");this.data.push(Float64Array.from(r[o]))}}}this.rows=t,this.columns=e}set(t,e,r){return this.data[t][e]=r,this}get(t,e){return this.data[t][e]}removeRow(t){return L(this,t),this.data.splice(t,1),this.rows-=1,this}addRow(t,e){return void 0===e&&(e=t,t=this.rows),L(this,t,!0),e=Float64Array.from(U(this,e)),this.data.splice(t,0,e),this.rows+=1,this}removeColumn(t){$(this,t);for(let e=0;e<this.rows;e++){const r=new Float64Array(this.columns-1);for(let o=0;o<t;o++)r[o]=this.data[e][o];for(let o=t+1;o<this.columns;o++)r[o-1]=this.data[e][o];this.data[e]=r}return this.columns-=1,this}addColumn(t,e){void 0===e&&(e=t,t=this.columns),$(this,t,!0),e=B(this,e);for(let r=0;r<this.rows;r++){const o=new Float64Array(this.columns+1);let s=0;for(;s<t;s++)o[s]=this.data[r][s];for(o[s++]=e[r];s<this.columns+1;s++)o[s]=this.data[r][s-1];this.data[r]=o}return this.columns+=1,this}}!function(t,e){t.prototype.add=function(t){return\\\"number\\\"==typeof t?this.addS(t):this.addM(t)},t.prototype.addS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t);return this},t.prototype.addM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t.get(e,r));return this},t.add=function(t,r){return new e(t).add(r)},t.prototype.sub=function(t){return\\\"number\\\"==typeof t?this.subS(t):this.subM(t)},t.prototype.subS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t);return this},t.prototype.subM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t.get(e,r));return this},t.sub=function(t,r){return new e(t).sub(r)},t.prototype.subtract=t.prototype.sub,t.prototype.subtractS=t.prototype.subS,t.prototype.subtractM=t.prototype.subM,t.subtract=t.sub,t.prototype.mul=function(t){return\\\"number\\\"==typeof t?this.mulS(t):this.mulM(t)},t.prototype.mulS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t);return this},t.prototype.mulM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t.get(e,r));return this},t.mul=function(t,r){return new e(t).mul(r)},t.prototype.multiply=t.prototype.mul,t.prototype.multiplyS=t.prototype.mulS,t.prototype.multiplyM=t.prototype.mulM,t.multiply=t.mul,t.prototype.div=function(t){return\\\"number\\\"==typeof t?this.divS(t):this.divM(t)},t.prototype.divS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t);return this},t.prototype.divM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t.get(e,r));return this},t.div=function(t,r){return new e(t).div(r)},t.prototype.divide=t.prototype.div,t.prototype.divideS=t.prototype.divS,t.prototype.divideM=t.prototype.divM,t.divide=t.div,t.prototype.mod=function(t){return\\\"number\\\"==typeof t?this.modS(t):this.modM(t)},t.prototype.modS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)%t);return this},t.prototype.modM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)%t.get(e,r));return this},t.mod=function(t,r){return new e(t).mod(r)},t.prototype.modulus=t.prototype.mod,t.prototype.modulusS=t.prototype.modS,t.prototype.modulusM=t.prototype.modM,t.modulus=t.mod,t.prototype.and=function(t){return\\\"number\\\"==typeof t?this.andS(t):this.andM(t)},t.prototype.andS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)&t);return this},t.prototype.andM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)&t.get(e,r));return this},t.and=function(t,r){return new e(t).and(r)},t.prototype.or=function(t){return\\\"number\\\"==typeof t?this.orS(t):this.orM(t)},t.prototype.orS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)|t);return this},t.prototype.orM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)|t.get(e,r));return this},t.or=function(t,r){return new e(t).or(r)},t.prototype.xor=function(t){return\\\"number\\\"==typeof t?this.xorS(t):this.xorM(t)},t.prototype.xorS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)^t);return this},t.prototype.xorM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)^t.get(e,r));return this},t.xor=function(t,r){return new e(t).xor(r)},t.prototype.leftShift=function(t){return\\\"number\\\"==typeof t?this.leftShiftS(t):this.leftShiftM(t)},t.prototype.leftShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)<<t);return this},t.prototype.leftShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)<<t.get(e,r));return this},t.leftShift=function(t,r){return new e(t).leftShift(r)},t.prototype.signPropagatingRightShift=function(t){return\\\"number\\\"==typeof t?this.signPropagatingRightShiftS(t):this.signPropagatingRightShiftM(t)},t.prototype.signPropagatingRightShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>t);return this},t.prototype.signPropagatingRightShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>t.get(e,r));return this},t.signPropagatingRightShift=function(t,r){return new e(t).signPropagatingRightShift(r)},t.prototype.rightShift=function(t){return\\\"number\\\"==typeof t?this.rightShiftS(t):this.rightShiftM(t)},t.prototype.rightShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>>t);return this},t.prototype.rightShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>>t.get(e,r));return this},t.rightShift=function(t,r){return new e(t).rightShift(r)},t.prototype.zeroFillRightShift=t.prototype.rightShift,t.prototype.zeroFillRightShiftS=t.prototype.rightShiftS,t.prototype.zeroFillRightShiftM=t.prototype.rightShiftM,t.zeroFillRightShift=t.rightShift,t.prototype.not=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,~this.get(t,e));return this},t.not=function(t){return new e(t).not()},t.prototype.abs=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.abs(this.get(t,e)));return this},t.abs=function(t){return new e(t).abs()},t.prototype.acos=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.acos(this.get(t,e)));return this},t.acos=function(t){return new e(t).acos()},t.prototype.acosh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.acosh(this.get(t,e)));return this},t.acosh=function(t){return new e(t).acosh()},t.prototype.asin=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.asin(this.get(t,e)));return this},t.asin=function(t){return new e(t).asin()},t.prototype.asinh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.asinh(this.get(t,e)));return this},t.asinh=function(t){return new e(t).asinh()},t.prototype.atan=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.atan(this.get(t,e)));return this},t.atan=function(t){return new e(t).atan()},t.prototype.atanh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.atanh(this.get(t,e)));return this},t.atanh=function(t){return new e(t).atanh()},t.prototype.cbrt=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cbrt(this.get(t,e)));return this},t.cbrt=function(t){return new e(t).cbrt()},t.prototype.ceil=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.ceil(this.get(t,e)));return this},t.ceil=function(t){return new e(t).ceil()},t.prototype.clz32=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.clz32(this.get(t,e)));return this},t.clz32=function(t){return new e(t).clz32()},t.prototype.cos=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cos(this.get(t,e)));return this},t.cos=function(t){return new e(t).cos()},t.prototype.cosh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cosh(this.get(t,e)));return this},t.cosh=function(t){return new e(t).cosh()},t.prototype.exp=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.exp(this.get(t,e)));return this},t.exp=function(t){return new e(t).exp()},t.prototype.expm1=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.expm1(this.get(t,e)));return this},t.expm1=function(t){return new e(t).expm1()},t.prototype.floor=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.floor(this.get(t,e)));return this},t.floor=function(t){return new e(t).floor()},t.prototype.fround=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.fround(this.get(t,e)));return this},t.fround=function(t){return new e(t).fround()},t.prototype.log=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log(this.get(t,e)));return this},t.log=function(t){return new e(t).log()},t.prototype.log1p=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log1p(this.get(t,e)));return this},t.log1p=function(t){return new e(t).log1p()},t.prototype.log10=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log10(this.get(t,e)));return this},t.log10=function(t){return new e(t).log10()},t.prototype.log2=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log2(this.get(t,e)));return this},t.log2=function(t){return new e(t).log2()},t.prototype.round=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.round(this.get(t,e)));return this},t.round=function(t){return new e(t).round()},t.prototype.sign=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sign(this.get(t,e)));return this},t.sign=function(t){return new e(t).sign()},t.prototype.sin=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sin(this.get(t,e)));return this},t.sin=function(t){return new e(t).sin()},t.prototype.sinh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sinh(this.get(t,e)));return this},t.sinh=function(t){return new e(t).sinh()},t.prototype.sqrt=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sqrt(this.get(t,e)));return this},t.sqrt=function(t){return new e(t).sqrt()},t.prototype.tan=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.tan(this.get(t,e)));return this},t.tan=function(t){return new e(t).tan()},t.prototype.tanh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.tanh(this.get(t,e)));return this},t.tanh=function(t){return new e(t).tanh()},t.prototype.trunc=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.trunc(this.get(t,e)));return this},t.trunc=function(t){return new e(t).trunc()},t.pow=function(t,r){return new e(t).pow(r)},t.prototype.pow=function(t){return\\\"number\\\"==typeof t?this.powS(t):this.powM(t)},t.prototype.powS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,Math.pow(this.get(e,r),t));return this},t.prototype.powM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,Math.pow(this.get(e,r),t.get(e,r)));return this}}(G,Y);class Q extends G{constructor(t){super(),this.data=t,this.rows=t.length,this.columns=t[0].length}set(t,e,r){return this.data[t][e]=r,this}get(t,e){return this.data[t][e]}}function X(t,e){let r=0;return Math.abs(t)>Math.abs(e)?(r=e/t,Math.abs(t)*Math.sqrt(1+r*r)):0!==e?(r=t/e,Math.abs(e)*Math.sqrt(1+r*r)):0}class Z{constructor(t,e={}){if((t=Q.checkMatrix(t)).isEmpty())throw new Error(\\\"Matrix must be non-empty\\\");let r=t.rows,o=t.columns;const{computeLeftSingularVectors:s=!0,computeRightSingularVectors:n=!0,autoTranspose:i=!1}=e;let a,h=Boolean(s),u=Boolean(n),l=!1;if(r<o)if(i){a=t.transpose(),r=a.rows,o=a.columns,l=!0;let e=h;h=u,u=e}else a=t.clone(),console.warn(\\\"Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose\\\");else a=t.clone();let c=Math.min(r,o),f=Math.min(r+1,o),d=new Float64Array(f),g=new Y(r,c),m=new Y(o,o),p=new Float64Array(o),w=new Float64Array(r),y=new Float64Array(f);for(let t=0;t<f;t++)y[t]=t;let v=Math.min(r-1,o),M=Math.max(0,Math.min(o-2,r)),b=Math.max(v,M);for(let t=0;t<b;t++){if(t<v){d[t]=0;for(let e=t;e<r;e++)d[t]=X(d[t],a.get(e,t));if(0!==d[t]){a.get(t,t)<0&&(d[t]=-d[t]);for(let e=t;e<r;e++)a.set(e,t,a.get(e,t)/d[t]);a.set(t,t,a.get(t,t)+1)}d[t]=-d[t]}for(let e=t+1;e<o;e++){if(t<v&&0!==d[t]){let o=0;for(let s=t;s<r;s++)o+=a.get(s,t)*a.get(s,e);o=-o/a.get(t,t);for(let s=t;s<r;s++)a.set(s,e,a.get(s,e)+o*a.get(s,t))}p[e]=a.get(t,e)}if(h&&t<v)for(let e=t;e<r;e++)g.set(e,t,a.get(e,t));if(t<M){p[t]=0;for(let e=t+1;e<o;e++)p[t]=X(p[t],p[e]);if(0!==p[t]){p[t+1]<0&&(p[t]=0-p[t]);for(let e=t+1;e<o;e++)p[e]/=p[t];p[t+1]+=1}if(p[t]=-p[t],t+1<r&&0!==p[t]){for(let e=t+1;e<r;e++)w[e]=0;for(let e=t+1;e<r;e++)for(let r=t+1;r<o;r++)w[e]+=p[r]*a.get(e,r);for(let e=t+1;e<o;e++){let o=-p[e]/p[t+1];for(let s=t+1;s<r;s++)a.set(s,e,a.get(s,e)+o*w[s])}}if(u)for(let e=t+1;e<o;e++)m.set(e,t,p[e])}}let E=Math.min(o,r+1);if(v<o&&(d[v]=a.get(v,v)),r<E&&(d[E-1]=0),M+1<E&&(p[M]=a.get(M,E-1)),p[E-1]=0,h){for(let t=v;t<c;t++){for(let e=0;e<r;e++)g.set(e,t,0);g.set(t,t,1)}for(let t=v-1;t>=0;t--)if(0!==d[t]){for(let e=t+1;e<c;e++){let o=0;for(let s=t;s<r;s++)o+=g.get(s,t)*g.get(s,e);o=-o/g.get(t,t);for(let s=t;s<r;s++)g.set(s,e,g.get(s,e)+o*g.get(s,t))}for(let e=t;e<r;e++)g.set(e,t,-g.get(e,t));g.set(t,t,1+g.get(t,t));for(let e=0;e<t-1;e++)g.set(e,t,0)}else{for(let e=0;e<r;e++)g.set(e,t,0);g.set(t,t,1)}}if(u)for(let t=o-1;t>=0;t--){if(t<M&&0!==p[t])for(let e=t+1;e<o;e++){let r=0;for(let s=t+1;s<o;s++)r+=m.get(s,t)*m.get(s,e);r=-r/m.get(t+1,t);for(let s=t+1;s<o;s++)m.set(s,e,m.get(s,e)+r*m.get(s,t))}for(let e=0;e<o;e++)m.set(e,t,0);m.set(t,t,1)}let x=E-1,S=0,N=Number.EPSILON;for(;E>0;){let t,e;for(t=E-2;t>=-1&&-1!==t;t--){const e=Number.MIN_VALUE+N*Math.abs(d[t]+Math.abs(d[t+1]));if(Math.abs(p[t])<=e||Number.isNaN(p[t])){p[t]=0;break}}if(t===E-2)e=4;else{let r;for(r=E-1;r>=t&&r!==t;r--){let e=(r!==E?Math.abs(p[r]):0)+(r!==t+1?Math.abs(p[r-1]):0);if(Math.abs(d[r])<=N*e){d[r]=0;break}}r===t?e=3:r===E-1?e=1:(e=2,t=r)}switch(t++,e){case 1:{let e=p[E-2];p[E-2]=0;for(let r=E-2;r>=t;r--){let s=X(d[r],e),n=d[r]/s,i=e/s;if(d[r]=s,r!==t&&(e=-i*p[r-1],p[r-1]=n*p[r-1]),u)for(let t=0;t<o;t++)s=n*m.get(t,r)+i*m.get(t,E-1),m.set(t,E-1,-i*m.get(t,r)+n*m.get(t,E-1)),m.set(t,r,s)}break}case 2:{let e=p[t-1];p[t-1]=0;for(let o=t;o<E;o++){let s=X(d[o],e),n=d[o]/s,i=e/s;if(d[o]=s,e=-i*p[o],p[o]=n*p[o],h)for(let e=0;e<r;e++)s=n*g.get(e,o)+i*g.get(e,t-1),g.set(e,t-1,-i*g.get(e,o)+n*g.get(e,t-1)),g.set(e,o,s)}break}case 3:{const e=Math.max(Math.abs(d[E-1]),Math.abs(d[E-2]),Math.abs(p[E-2]),Math.abs(d[t]),Math.abs(p[t])),s=d[E-1]/e,n=d[E-2]/e,i=p[E-2]/e,a=d[t]/e,l=p[t]/e,c=((n+s)*(n-s)+i*i)/2,f=s*i*(s*i);let w=0;0===c&&0===f||(w=c<0?0-Math.sqrt(c*c+f):Math.sqrt(c*c+f),w=f/(c+w));let y=(a+s)*(a-s)+w,v=a*l;for(let e=t;e<E-1;e++){let s=X(y,v);0===s&&(s=Number.MIN_VALUE);let n=y/s,i=v/s;if(e!==t&&(p[e-1]=s),y=n*d[e]+i*p[e],p[e]=n*p[e]-i*d[e],v=i*d[e+1],d[e+1]=n*d[e+1],u)for(let t=0;t<o;t++)s=n*m.get(t,e)+i*m.get(t,e+1),m.set(t,e+1,-i*m.get(t,e)+n*m.get(t,e+1)),m.set(t,e,s);if(s=X(y,v),0===s&&(s=Number.MIN_VALUE),n=y/s,i=v/s,d[e]=s,y=n*p[e]+i*d[e+1],d[e+1]=-i*p[e]+n*d[e+1],v=i*p[e+1],p[e+1]=n*p[e+1],h&&e<r-1)for(let t=0;t<r;t++)s=n*g.get(t,e)+i*g.get(t,e+1),g.set(t,e+1,-i*g.get(t,e)+n*g.get(t,e+1)),g.set(t,e,s)}p[E-2]=y,S+=1;break}case 4:if(d[t]<=0&&(d[t]=d[t]<0?-d[t]:0,u))for(let e=0;e<=x;e++)m.set(e,t,-m.get(e,t));for(;t<x&&!(d[t]>=d[t+1]);){let e=d[t];if(d[t]=d[t+1],d[t+1]=e,u&&t<o-1)for(let r=0;r<o;r++)e=m.get(r,t+1),m.set(r,t+1,m.get(r,t)),m.set(r,t,e);if(h&&t<r-1)for(let o=0;o<r;o++)e=g.get(o,t+1),g.set(o,t+1,g.get(o,t)),g.set(o,t,e);t++}S=0,E--}}if(l){let t=m;m=g,g=t}this.m=r,this.n=o,this.s=d,this.U=g,this.V=m}solve(t){let e=t,r=this.threshold,o=this.s.length,s=Y.zeros(o,o);for(let t=0;t<o;t++)Math.abs(this.s[t])<=r?s.set(t,t,0):s.set(t,t,1/this.s[t]);let n=this.U,i=this.rightSingularVectors,a=i.mmul(s),h=i.rows,u=n.rows,l=Y.zeros(h,u);for(let t=0;t<h;t++)for(let e=0;e<u;e++){let r=0;for(let s=0;s<o;s++)r+=a.get(t,s)*n.get(e,s);l.set(t,e,r)}return l.mmul(e)}solveForDiagonal(t){return this.solve(Y.diag(t))}inverse(){let t=this.V,e=this.threshold,r=t.rows,o=t.columns,s=new Y(r,this.s.length);for(let n=0;n<r;n++)for(let r=0;r<o;r++)Math.abs(this.s[r])>e&&s.set(n,r,t.get(n,r)/this.s[r]);let n=this.U,i=n.rows,a=n.columns,h=new Y(r,i);for(let t=0;t<r;t++)for(let e=0;e<i;e++){let r=0;for(let o=0;o<a;o++)r+=s.get(t,o)*n.get(e,o);h.set(t,e,r)}return h}get condition(){return this.s[0]/this.s[Math.min(this.m,this.n)-1]}get norm2(){return this.s[0]}get rank(){let t=Math.max(this.m,this.n)*this.s[0]*Number.EPSILON,e=0,r=this.s;for(let o=0,s=r.length;o<s;o++)r[o]>t&&e++;return e}get diagonal(){return Array.from(this.s)}get threshold(){return Number.EPSILON/2*Math.max(this.m,this.n)*this.s[0]}get leftSingularVectors(){return this.U}get rightSingularVectors(){return this.V}get diagonalMatrix(){return Y.diag(this.s)}}var tt={center:[0,0],linkDistance:50},et=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"mds\\\",Object.assign(this.options,tt,t)}return t.prototype.execute=function(t,e){return this.genericMDSLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericMDSLayout(!0,t,e)},t.prototype.genericMDSLayout=function(t,e,r){var s=o(o({},this.options),r),n=s.center,i=void 0===n?[0,0]:n,a=s.linkDistance,h=void 0===a?50:a,u=s.layoutInvisibles,f=s.onLayoutEnd,g=e.getAllNodes(),m=e.getAllEdges();if(u||(g=g.filter((function(t){return t.data.visible||void 0===t.data.visible})),m=m.filter((function(t){return t.data.visible||void 0===t.data.visible}))),!g||0===g.length){var p={nodes:[],edges:m};return null==f||f(p),p}if(1===g.length){t&&e.mergeNodeData(g[0].id,{x:i[0],y:i[1]});var w={nodes:[o(o({},g[0]),{data:o(o({},g[0].data),{x:i[0],y:i[1]})})],edges:m};return null==f||f(w),w}var y=c({nodes:g,edges:m},!1),v=l(y);rt(v);var M=function(t,e){var r=[];return t.forEach((function(t){var o=[];t.forEach((function(t){o.push(t*e)})),r.push(o)})),r}(v,h),b=ot(M),E=[];b.forEach((function(t,e){var r=d(g[e]);r.data.x=t[0]+i[0],r.data.y=t[1]+i[1],E.push(r)})),t&&E.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var x={nodes:E,edges:m};return null==f||f(x),x},t}(),rt=function(t){var e=-999999;t.forEach((function(t){t.forEach((function(t){t!==1/0&&e<t&&(e=t)}))})),t.forEach((function(r,o){r.forEach((function(r,s){r===1/0&&(t[o][s]=e)}))}))},ot=function(t){var e=Y.mul(Y.pow(t,2),-.5),r=e.mean(\\\"row\\\"),o=e.mean(\\\"column\\\"),s=e.mean();e.add(s).subRowVector(r).subColumnVector(o);var n=new Z(e),i=Y.sqrt(n.diagonalMatrix).diagonal();return n.leftSingularVectors.toJSON().map((function(t){return Y.mul([t],[i]).toJSON()[0].splice(0,2)}))},st={iterations:10,height:10,width:10,speed:100,gravity:10,k:5},nt=function(t,e,r,o,s,n){e.forEach((function(i,a){r[a]={x:0,y:0},e.forEach((function(e,h){if(a!==h&&s[a]===s[h]){var u=i.x-e.x,l=i.y-e.y,c=Math.sqrt(u*u+l*l);if(0===c){c=1;var f=a>h?1:-1;u=.01*f,l=.01*f}if(c<n(t[a])/2+n(t[h])/2){var d=o*o/c;r[a].x+=u/c*d,r[a].y+=l/c*d}}}))}))},it=function(t,e,r,o,s,n,i,a){var h=n||i/10;return o&&e.forEach((function(e,r){var o=t[r].x-t[s].x,n=t[r].y-t[s].y,i=Math.sqrt(o*o+n*n),a=n/i,h=-o/i,u=Math.sqrt(e.x*e.x+e.y*e.y),l=Math.acos((a*e.x+h*e.y)/u);l>Math.PI/2&&(l-=Math.PI/2,a*=-1,h*=-1);var c=Math.cos(l)*u;e.x=a*c,e.y=h*c})),t.forEach((function(n,i){if(i!==s){var u=Math.sqrt(e[i].x*e[i].x+e[i].y*e[i].y);if(u>0&&i!==s){var l=Math.min(h*(r/800),u);if(n.x+=e[i].x/u*l,n.y+=e[i].y/u*l,o){var c=n.x-t[s].x,f=n.y-t[s].y,d=Math.sqrt(c*c+f*f);c=c/d*a[i],f=f/d*a[i],n.x=t[s].x+c,n.y=t[s].y+f}}}})),t},at={maxIteration:1e3,focusNode:null,unitRadius:null,linkDistance:50,preventOverlap:!1,nodeSize:void 0,nodeSpacing:void 0,strictRadial:!0,maxPreventOverlapIteration:200,sortBy:void 0,sortStrength:10},ht=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"radial\\\",Object.assign(this.options,at,t)}return t.prototype.execute=function(t,e){return this.genericRadialLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericRadialLayout(!0,t,e)},t.prototype.genericRadialLayout=function(t,e,r){var a=o(o({},this.options),r),h=a.width,u=a.height,f=a.center,d=a.focusNode,g=a.unitRadius,m=a.nodeSize,p=a.nodeSpacing,w=a.strictRadial,y=a.preventOverlap,v=a.maxPreventOverlapIteration,M=a.sortBy,b=a.linkDistance,E=void 0===b?50:b,x=a.sortStrength,S=void 0===x?10:x,N=a.maxIteration,R=void 0===N?1e3:N,I=a.layoutInvisibles,k=a.onLayoutEnd,A=e.getAllNodes(),T=e.getAllEdges();if(I||(A=A.filter((function(t){return t.data.visible||void 0===t.data.visible})),T=T.filter((function(t){return t.data.visible||void 0===t.data.visible}))),!A||0===A.length){var D={nodes:[],edges:T};return null==k||k(D),D}var C=h||\\\"undefined\\\"==typeof window?h:window.innerWidth,z=u||\\\"undefined\\\"==typeof window?u:window.innerHeight,P=f||[C/2,z/2];if(1===A.length){t&&e.mergeNodeData(A[0].id,{x:P[0],y:P[1]});var V={nodes:[o(o({},A[0]),{data:o(o({},A[0].data),{x:P[0],y:P[1]})})],edges:T};return null==k||k(V),V}var q=A[0];if(i(d)){for(var j=0;j<A.length;j++)if(A[j].id===d){q=A[j];break}}else q=d||A[0];var O=ft(A,q.id),F=c({nodes:A,edges:T},!1),L=l(F),$=gt(L,O);dt(L,O,$+1);var U=L[O],B=C-P[0]>P[0]?P[0]:C-P[0],K=z-P[1]>P[1]?P[1]:z-P[1];0===B&&(B=C/2),0===K&&(K=z/2);var W=Math.min(B,K),J=Math.max.apply(Math,n([],s(U),!1)),_=[],G=g||W/J;U.forEach((function(t,e){_[e]=t*G}));var H,Q=ut(A,L,E,_,G,M,S),X=lt(Q),tt=function(t,e,r){try{var o=Y.mul(Y.pow(e,2),-.5),s=o.mean(\\\"row\\\"),n=o.mean(\\\"column\\\"),i=o.mean();o.add(i).subRowVector(s).subColumnVector(n);var a=new Z(o),h=Y.sqrt(a.diagonalMatrix).diagonal();return a.leftSingularVectors.toJSON().map((function(e){return Y.mul([e],[h]).toJSON()[0].splice(0,t)}))}catch(t){for(var u=[],l=0;l<e.length;l++){var c=Math.random()*r,f=Math.random()*r;u.push([c,f])}return u}}(E,Q,E).map((function(t){var e=s(t,2),r=e[0],o=e[1];return{x:(isNaN(r)?Math.random()*E:r)-tt[O].x,y:(isNaN(o)?Math.random()*E:o)-tt[O].y}}));if(this.run(R,tt,X,Q,_,O),y){H=mt(m,p);var et={nodes:A,nodeSizeFunc:H,positions:tt,radii:_,height:z,width:C,strictRadial:Boolean(w),focusIdx:O,iterations:v||200,k:tt.length/4.5};tt=function(t,e){for(var r=o(o({},st),e),s=r.positions,n=r.iterations,i=r.width,a=r.k,h=r.speed,u=void 0===h?100:h,l=r.strictRadial,c=r.focusIdx,f=r.radii,d=void 0===f?[]:f,g=r.nodeSizeFunc,m=t.getAllNodes(),p=[],w=i/10,y=0;y<n;y++)s.forEach((function(t,e){p[e]={x:0,y:0}})),nt(m,s,p,a,d,g),it(s,p,u,l,c,w,i,d);return s}(e,et)}var rt=[];tt.forEach((function(t,e){rt.push(o(o({},A[e]),{data:o(o({},A[0].data),{x:t.x+P[0],y:t.y+P[1]})}))})),t&&rt.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var ot={nodes:rt,edges:T};return null==k||k(ot),ot},t.prototype.run=function(t,e,r,o,s,n){for(var i=0;i<=t;i++){var a=i/t;this.oneIteration(a,e,s,o,r,n)}},t.prototype.oneIteration=function(t,e,r,o,s,n){var i=1-t;e.forEach((function(a,h){var u=ct(a,{x:0,y:0}),l=0===u?0:1/u;if(h!==n){var c=0,f=0,d=0;e.forEach((function(t,e){if(h!==e){var r=ct(a,t),n=0===r?0:1/r,i=o[e][h];d+=s[h][e],c+=s[h][e]*(t.x+i*(a.x-t.x)*n),f+=s[h][e]*(t.y+i*(a.y-t.y)*n)}}));var g=0===r[h]?0:1/r[h];d*=i,d+=t*g*g,c*=i,c+=t*g*a.x*l,a.x=c/d,f*=i,f+=t*g*a.y*l,a.y=f/d}}))},t}(),ut=function(t,e,r,o,s,n,a){if(!t)return[];var h=[];return e&&e.forEach((function(e,u){var l=[];e.forEach((function(e,h){if(u===h)l.push(0);else if(o[u]===o[h])if(\\\"data\\\"===n)l.push(e*(Math.abs(u-h)*a)/(o[u]/s));else if(n){var c=t[u][n]||0,f=t[h][n]||0;i(c)&&(c=c.charCodeAt(0)),i(f)&&(f=f.charCodeAt(0)),l.push(e*(Math.abs(c-f)*a)/(o[u]/s))}else l.push(e*r/(o[u]/s));else{var d=(r+s)/2;l.push(e*d)}})),h.push(l)})),h},lt=function(t){for(var e=t.length,r=t[0].length,o=[],s=0;s<e;s++){for(var n=[],i=0;i<r;i++)0!==t[s][i]?n.push(1/(t[s][i]*t[s][i])):n.push(0);o.push(n)}return o},ct=function(t,e){return Math.sqrt((t.x-e.x)*(t.x-e.x)+(t.y-e.y)*(t.y-e.y))},ft=function(t,e){var r=-1;return t.forEach((function(t,o){t.id===e&&(r=o)})),Math.max(r,0)},dt=function(t,e,r){for(var o=t.length,s=0;s<o;s++)if(t[e][s]===1/0){t[e][s]=r,t[s][e]=r;for(var n=0;n<o;n++)t[s][n]!==1/0&&t[e][n]===1/0&&(t[e][n]=r+t[s][n],t[n][e]=r+t[s][n])}for(s=0;s<o;s++)if(s!==e)for(n=0;n<o;n++)if(t[s][n]===1/0){var i=Math.abs(t[e][s]-t[e][n]);i=0===i?1:i,t[s][n]=i}},gt=function(t,e){for(var r=0,o=0;o<t[e].length;o++)t[e][o]!==1/0&&(r=t[e][o]>r?t[e][o]:r);return r},mt=function(t,e){var r;return r=u(e)?function(){return e}:g(e)?e:function(){return 0},t?h(t)?function(e){return(t[0]>t[1]?t[0]:t[1])+r(e)}:function(e){return t+r(e)}:function(t){return t.data.bboxSize?Math.max(t.data.bboxSize[0],t.data.bboxSize[1])+r(t):t.data.size?h(t.data.size)?Math.max(t.data.size[0],t.data.size[1])+r(t):f(t.data.size)?(t.data.size.width>t.data.size.height?t.data.size.width:t.data.size.height)+r(t):t.data.size+r(t):10+r(t)}},pt={center:[0,0],width:300,height:300},wt={circular:w,concentric:b,mds:et,random:function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"random\\\",Object.assign(this.options,pt,t)}return t.prototype.execute=function(t,e){return this.genericRandomLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericRandomLayout(!0,t,e)},t.prototype.genericRandomLayout=function(t,e,r){var s=o(o({},this.options),r),n=s.center,i=s.width,a=s.height,h=s.layoutInvisibles,u=s.onLayoutEnd,l=e.getAllNodes();h||(l=l.filter((function(t){return t.data.visible||void 0===t.data.visible})));var c=i||\\\"undefined\\\"==typeof window?i:window.innerWidth,f=a||\\\"undefined\\\"==typeof window?a:window.innerHeight,d=n||[c/2,f/2],g=[];l&&l.forEach((function(t){g.push({id:t.id,data:{x:.9*(Math.random()-.5)*c+d[0],y:.9*(Math.random()-.5)*f+d[1]}})})),t&&g.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var m={nodes:g,edges:e.getAllEdges()};return null==u||u(m),m},t}(),grid:x,radial:ht};function yt(t,e){var o=t.layout,s=o.id,n=o.options,i=t.nodes,a=t.edges,h=new r({nodes:i,edges:a}),u=wt[s];if(!u)throw new Error(\\\"Unknown layout id: \\\"+s);return[new u(n).execute(h),e]}addEventListener(\\\"message\\\",(function(t){var r,o=t.data,s=o.type,n=o.method,i=o.id,a=o.params;\\\"RPC\\\"===s&&n&&((r=e[n])?Promise.resolve().then((function(){return r.apply(e,a)})):Promise.reject(\\\"No such method\\\")).then((function(t){postMessage({type:\\\"RPC\\\",id:i,result:t})})).catch((function(t){var e={message:t};t.stack&&(e.message=t.message,e.stack=t.stack,e.name=t.name),postMessage({type:\\\"RPC\\\",id:i,error:e})}))})),postMessage({type:\\\"RPC\\\",method:\\\"ready\\\"})})();\\n//# sourceMappingURL=03710bc99fe066d705cb.worker.js.map\"])), { name: \"[fullhash].worker.js\" })\n\t\t\t\t\tURL.revokeObjectURL(URL.createObjectURL(new Blob([\"(()=>{\\\"use strict\\\";var t={d:(e,r)=>{for(var o in r)t.o(r,o)&&!t.o(e,o)&&Object.defineProperty(e,o,{enumerable:!0,get:r[o]})},o:(t,e)=>Object.prototype.hasOwnProperty.call(t,e)},e={};t.d(e,{calculateLayout:()=>yt});class r{nodeMap=new Map;edgeMap=new Map;inEdgesMap=new Map;outEdgesMap=new Map;treeIndices=new Map;changes=[];batchCount=0;onChanged=()=>{};constructor(t){t&&(t.nodes&&this.addNodes(t.nodes),t.edges&&this.addEdges(t.edges),t.tree&&this.addTree(t.tree),t.onChanged&&(this.onChanged=t.onChanged))}batch=t=>{this.batchCount+=1,t(),this.batchCount-=1,this.batchCount||this.commit()};commit(){const t=this.changes;this.changes=[],this.onChanged({graph:this,changes:t})}reduceChanges(t){let e=[];return t.forEach((t=>{switch(t.type){case\\\"NodeRemoved\\\":{let r=!1;e=e.filter((e=>{if(\\\"NodeAdded\\\"===e.type){const o=e.value.id===t.value.id;return o&&(r=!0),!o}return\\\"NodeDataUpdated\\\"===e.type?e.id!==t.value.id:\\\"TreeStructureChanged\\\"!==e.type||e.nodeId!==t.value.id})),r||e.push(t);break}case\\\"EdgeRemoved\\\":{let r=!1;e=e.filter((e=>{if(\\\"EdgeAdded\\\"===e.type){const o=e.value.id===t.value.id;return o&&(r=!0),!o}return\\\"EdgeDataUpdated\\\"!==e.type&&\\\"EdgeUpdated\\\"!==e.type||e.id!==t.value.id})),r||e.push(t);break}case\\\"NodeDataUpdated\\\":case\\\"EdgeDataUpdated\\\":case\\\"EdgeUpdated\\\":{const r=e.find((e=>e.type===t.type&&e.id===t.id&&e.propertyName===t.propertyName));r?r.newValue=t.newValue:e.push(t);break}case\\\"TreeStructureDetached\\\":e=e.filter((e=>\\\"TreeStructureAttached\\\"===e.type?e.treeKey!==t.treeKey:\\\"TreeStructureChanged\\\"!==e.type||e.treeKey!==t.treeKey)),e.push(t);break;case\\\"TreeStructureChanged\\\":{const r=e.find((e=>\\\"TreeStructureChanged\\\"===e.type&&e.treeKey===t.treeKey&&e.nodeId===t.nodeId));r?r.newParentId=t.newParentId:e.push(t);break}default:e.push(t)}})),e}checkNodeExistence(t){if(!this.hasNode(t))throw new Error(\\\"Node not found for id: \\\"+t)}hasNode(t){return this.nodeMap.has(t)}areNeighbors(t,e){return this.checkNodeExistence(t),this.getNeighbors(e).some((e=>e.id===t))}getNode(t){return this.checkNodeExistence(t),this.nodeMap.get(t)}getRelatedEdges(t,e){this.checkNodeExistence(t);const r=this.inEdgesMap.get(t),o=this.outEdgesMap.get(t);if(\\\"in\\\"===e)return Array.from(r);if(\\\"out\\\"===e)return Array.from(o);const s=new Set([...r,...o]);return Array.from(s)}getDegree(t,e){return this.getRelatedEdges(t,e).length}getSuccessors(t){const e=this.getRelatedEdges(t,\\\"out\\\").map((t=>t.target));return Array.from(new Set(e)).map((t=>this.getNode(t)))}getPredecessors(t){const e=this.getRelatedEdges(t,\\\"in\\\").map((t=>t.source));return Array.from(new Set(e)).map((t=>this.getNode(t)))}getNeighbors(t){const e=this.getPredecessors(t),r=this.getSuccessors(t);return Array.from(new Set([...e,...r]))}doAddNode(t){if(this.hasNode(t.id))throw new Error(\\\"Node already exists: \\\"+t.id);this.nodeMap.set(t.id,t),this.inEdgesMap.set(t.id,new Set),this.outEdgesMap.set(t.id,new Set),this.treeIndices.forEach((e=>{e.childrenMap.set(t.id,new Set)})),this.changes.push({type:\\\"NodeAdded\\\",value:t})}addNodes(t){this.batch((()=>{for(const e of t)this.doAddNode(e)}))}addNode(t){this.addNodes([t])}doRemoveNode(t){const e=this.getNode(t),r=this.inEdgesMap.get(t),o=this.outEdgesMap.get(t);r?.forEach((t=>this.doRemoveEdge(t.id))),o?.forEach((t=>this.doRemoveEdge(t.id))),this.nodeMap.delete(t),this.treeIndices.forEach((e=>{e.childrenMap.get(t)?.forEach((t=>{e.parentMap.delete(t.id)})),e.parentMap.delete(t),e.childrenMap.delete(t)})),this.changes.push({type:\\\"NodeRemoved\\\",value:e})}removeNodes(t){this.batch((()=>{t.forEach((t=>this.doRemoveNode(t)))}))}removeNode(t){this.removeNodes([t])}updateNodeData(t,e,r){const o=this.getNode(t);this.batch((()=>{const s=o.data[e],n=r;o.data[e]=n,this.changes.push({type:\\\"NodeDataUpdated\\\",id:t,propertyName:e,oldValue:s,newValue:n})}))}mergeNodeData(t,e){this.batch((()=>{Object.entries(e).forEach((([e,r])=>{this.updateNodeData(t,e,r)}))}))}checkEdgeExistence(t){if(!this.hasEdge(t))throw new Error(\\\"Edge not found for id: \\\"+t)}hasEdge(t){return this.edgeMap.has(t)}getEdge(t){return this.checkEdgeExistence(t),this.edgeMap.get(t)}getEdgeDetail(t){const e=this.getEdge(t);return{edge:e,source:this.getNode(e.source),target:this.getNode(e.target)}}doAddEdge(t){if(this.hasEdge(t.id))throw new Error(\\\"Edge already exists: \\\"+t.id);this.checkNodeExistence(t.source),this.checkNodeExistence(t.target),this.edgeMap.set(t.id,t);const e=this.inEdgesMap.get(t.target),r=this.outEdgesMap.get(t.source);e.add(t),r.add(t),this.changes.push({type:\\\"EdgeAdded\\\",value:t})}addEdges(t){this.batch((()=>{for(const e of t)this.doAddEdge(e)}))}addEdge(t){this.addEdges([t])}doRemoveEdge(t){const e=this.getEdge(t),r=this.outEdgesMap.get(e.source),o=this.inEdgesMap.get(e.target);r.delete(e),o.delete(e),this.edgeMap.delete(t),this.changes.push({type:\\\"EdgeRemoved\\\",value:e})}removeEdges(t){this.batch((()=>{t.forEach((t=>this.doRemoveEdge(t)))}))}removeEdge(t){this.removeEdges([t])}updateEdgeSource(t,e){const r=this.getEdge(t);this.checkNodeExistence(e);const o=r.source,s=e;this.outEdgesMap.get(o).delete(r),this.outEdgesMap.get(s).add(r),r.source=e,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:t,propertyName:\\\"source\\\",oldValue:o,newValue:s})}))}updateEdgeTarget(t,e){const r=this.getEdge(t);this.checkNodeExistence(e);const o=r.target,s=e;this.inEdgesMap.get(o).delete(r),this.inEdgesMap.get(s).add(r),r.target=e,this.batch((()=>{this.changes.push({type:\\\"EdgeUpdated\\\",id:t,propertyName:\\\"target\\\",oldValue:o,newValue:s})}))}updateEdgeData(t,e,r){const o=this.getEdge(t);this.batch((()=>{const s=o.data[e],n=r;o.data[e]=n,this.changes.push({type:\\\"EdgeDataUpdated\\\",id:t,propertyName:e,oldValue:s,newValue:n})}))}mergeEdgeData(t,e){this.batch((()=>{Object.entries(e).forEach((([e,r])=>{this.updateEdgeData(t,e,r)}))}))}checkTreeExistence(t){if(!this.treeIndices.has(t))throw new Error(\\\"Tree structure not found for treeKey: \\\"+t)}attachTreeStructure(t){this.treeIndices.has(t)||(this.treeIndices.set(t,{parentMap:new Map,childrenMap:new Map}),this.batch((()=>{this.changes.push({type:\\\"TreeStructureAttached\\\",treeKey:t})})))}detachTreeStructure(t){this.checkTreeExistence(t),this.treeIndices.delete(t),this.batch((()=>{this.changes.push({type:\\\"TreeStructureDetached\\\",treeKey:t})}))}addTree(t,e){this.batch((()=>{this.attachTreeStructure(e);const r=[],o=Array.isArray(t)?t:[t];for(;o.length;){const t=o.shift();r.push(t),t.children&&o.push(...t.children)}this.addNodes(r),r.forEach((t=>{t.children?.forEach((r=>{this.setParent(r.id,t.id,e)}))}))}))}getRoots(t){return this.checkTreeExistence(t),this.getAllNodes().filter((e=>!this.getParent(e.id,t)))}getChildren(t,e){this.checkNodeExistence(t),this.checkTreeExistence(e);const r=this.treeIndices.get(e).childrenMap.get(t);return Array.from(r||[])}getParent(t,e){return this.checkNodeExistence(t),this.checkTreeExistence(e),this.treeIndices.get(e).parentMap.get(t)||null}setParent(t,e,r){this.checkTreeExistence(r);const o=this.treeIndices.get(r),s=this.getNode(t),n=o.parentMap.get(t),i=this.getNode(e);o.parentMap.set(t,i),n&&o.childrenMap.get(n.id)?.delete(s);let a=o.childrenMap.get(i.id);a||(a=new Set,o.childrenMap.set(i.id,a)),a.add(s),this.batch((()=>{this.changes.push({type:\\\"TreeStructureChanged\\\",treeKey:r,nodeId:t,oldParentId:n?.id,newParentId:i.id})}))}getAllNodes(){return Array.from(this.nodeMap.values())}getAllEdges(){return Array.from(this.edgeMap.values())}doBFS(t,e,r){for(;t.length;){const o=t.shift();r(o),e.add(o.id),this.getSuccessors(o.id).forEach((r=>{e.has(r.id)||(e.add(r.id),t.push(r))}))}}bfs(t,e){this.doBFS([this.getNode(t)],new Set,e)}doDFS(t,e,r){r(t),e.add(t.id),this.getSuccessors(t.id).forEach((t=>{e.has(t.id)||this.doDFS(t,e,r)}))}dfs(t,e){this.doDFS(this.getNode(t),new Set,e)}clone(){const t=this.getAllNodes().map((t=>({...t,data:{...t.data}}))),e=this.getAllEdges().map((t=>({...t,data:{...t.data}}))),o=new r({nodes:t,edges:e});return this.treeIndices.forEach((({parentMap:t,childrenMap:e},r)=>{const s=new Map;t.forEach(((t,e)=>{s.set(e,o.getNode(t.id))}));const n=new Map;e.forEach(((t,e)=>{n.set(e,new Set(Array.from(t).map((t=>o.getNode(t.id)))))})),o.treeIndices.set(r,{parentMap:s,childrenMap:n})})),o}toJSON(){return JSON.stringify({nodes:this.getAllNodes(),edges:this.getAllEdges()})}}var o=function(){return o=Object.assign||function(t){for(var e,r=1,o=arguments.length;r<o;r++)for(var s in e=arguments[r])Object.prototype.hasOwnProperty.call(e,s)&&(t[s]=e[s]);return t},o.apply(this,arguments)};function s(t,e){var r=\\\"function\\\"==typeof Symbol&&t[Symbol.iterator];if(!r)return t;var o,s,n=r.call(t),i=[];try{for(;(void 0===e||e-- >0)&&!(o=n.next()).done;)i.push(o.value)}catch(t){s={error:t}}finally{try{o&&!o.done&&(r=n.return)&&r.call(n)}finally{if(s)throw s.error}}return i}function n(t,e,r){if(r||2===arguments.length)for(var o,s=0,n=e.length;s<n;s++)!o&&s in e||(o||(o=Array.prototype.slice.call(e,0,s)),o[s]=e[s]);return t.concat(o||Array.prototype.slice.call(e))}Object.create,Object.create;var i=function(t){return\\\"string\\\"==typeof t},a=/-(\\\\w)/g,h=(function(t){return t.replace(a,(function(t,e){return e?e.toUpperCase():\\\"\\\"}))},Object.create(null),Array.isArray),u=function(t){return\\\"number\\\"==typeof t},l=function(t){for(var e=[],r=t.length,o=0;o<r;o+=1){e[o]=[];for(var s=0;s<r;s+=1)o===s?e[o][s]=0:0!==t[o][s]&&t[o][s]?e[o][s]=t[o][s]:e[o][s]=1/0}for(var n=0;n<r;n+=1)for(o=0;o<r;o+=1)for(s=0;s<r;s+=1)e[o][s]>e[o][n]+e[n][s]&&(e[o][s]=e[o][n]+e[n][s]);return e},c=function(t,e){var r=t.nodes,o=t.edges,s=[],n={};if(!r)throw new Error(\\\"invalid nodes data!\\\");return r&&r.forEach((function(t,e){n[t.id]=e,s.push([])})),null==o||o.forEach((function(t){var r=t.source,o=t.target,i=n[r],a=n[o];void 0!==i&&void 0!==a&&(s[i][a]=1,e||(s[a][i]=1))})),s},f=function(t){return null!==t&&\\\"object\\\"==typeof t},d=function(t){if(null===t)return t;if(t instanceof Date)return new Date(t.getTime());if(t instanceof Array){var e=[];return t.forEach((function(t){e.push(t)})),e.map((function(t){return d(t)}))}if(\\\"object\\\"==typeof t&&Object.keys(t).length){var r=o({},t);return Object.keys(r).forEach((function(t){r[t]=d(r[t])})),r}return t},g=function(t){return\\\"function\\\"==typeof t},m=function(t,e,r){return void 0===r&&(r=!0),e||0===e?g(e)?e:u(e)?function(){return e}:h(e)?function(){if(r){var o=Math.max.apply(Math,n([],s(e),!1));return isNaN(o)?t:o}return e}:f(e)?function(){if(r){var o=Math.max(e.width,e.height);return isNaN(o)?t:o}return[e.width,e.height]}:function(){return t}:function(e){return e.size?h(e.size)?e.size[0]>e.size[1]?e.size[0]:e.size[1]:f(e.size)?e.size.width>e.size.height?e.size.width:e.size.height:e.size:t}},p={radius:null,startRadius:null,endRadius:null,startAngle:0,endAngle:2*Math.PI,clockwise:!0,divisions:1,ordering:null,angleRatio:1},w=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"circular\\\",this.options=o(o({},p),t)}return t.prototype.execute=function(t,e){return this.genericCircularLayout(!1,t,e)},t.prototype.assign=function(t,e){var r=this;t.batch((function(){r.genericCircularLayout(!0,t,e)}))},t.prototype.genericCircularLayout=function(t,e,r){var n=o(o({},this.options),r),i=n.width,a=n.height,h=n.center,u=n.divisions,l=n.startAngle,c=void 0===l?0:l,f=n.endAngle,g=void 0===f?2*Math.PI:f,p=n.angleRatio,w=n.ordering,M=n.clockwise,b=n.nodeSpacing,E=n.nodeSize,x=n.layoutInvisibles,S=n.onLayoutEnd,N=e.getAllNodes(),R=e.getAllEdges();x||(N=N.filter((function(t){return t.data.visible||void 0===t.data.visible})),R=R.filter((function(t){return t.data.visible||void 0===t.data.visible})));var I=N.length;if(0===I)return null==S||S({nodes:[],edges:[]}),{nodes:[],edges:[]};var k=s(v(i,a,h),3),A=k[0],T=k[1],D=k[2];if(1===I){t&&e.mergeNodeData(N[0].id,{x:D[0],y:D[1]});var C={nodes:[o(o({},N[0]),{data:o(o({},N[0].data),{x:D[0],y:D[1]})})],edges:R};return null==S||S(C),C}var z=(g-c)/I,P=n.radius,V=n.startRadius,q=n.endRadius;if(b){var j=m(10,b),O=m(10,E),F=-1/0;N.forEach((function(t){var e=O(t);F<e&&(F=e)}));var L=0;N.forEach((function(t,e){L+=0===e?F||10:(j(t)||0)+(F||10)})),P=L/(2*Math.PI)}else P||V||q?!V&&q?V=q:V&&!q&&(q=V):P=Math.min(T,A)/2;var $=z*p,U=[];U=\\\"topology\\\"===w?y(e,N):\\\"topology-directed\\\"===w?y(e,N,!0):\\\"degree\\\"===w?function(t,e){var r=[];return e.forEach((function(t,e){r.push(d(t))})),r.sort((function(e,r){return t.getDegree(e.id,\\\"both\\\")-t.getDegree(r.id,\\\"both\\\")})),r}(e,N):N.map((function(t){return d(t)}));for(var B=Math.ceil(I/u),K=0;K<I;++K){var W=P;W||null===V||null===q||(W=V+K*(q-V)/(I-1)),W||(W=10+100*K/(I-1));var J=c+K%B*$+2*Math.PI/u*Math.floor(K/B);M||(J=g-K%B*$-2*Math.PI/u*Math.floor(K/B)),U[K].data.x=D[0]+Math.cos(J)*W,U[K].data.y=D[1]+Math.sin(J)*W}t&&U.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var _={nodes:U,edges:R};return null==S||S(_),_},t}(),y=function(t,e,r){void 0===r&&(r=!1);var o=[d(e[0])],s={},n=e.length;s[e[0].id]=!0;var i=0;return e.forEach((function(a,h){if(0!==h)if(h!==n-1&&t.getDegree(a.id,\\\"both\\\")===t.getDegree(e[h+1].id,\\\"both\\\")&&!t.areNeighbors(o[i].id,a.id)||s[a.id]){for(var u=r?t.getSuccessors(o[i].id):t.getNeighbors(o[i].id),l=!1,c=0;c<u.length;c++){var f=u[c];if(t.getDegree(f.id)===t.getDegree(a.id)&&!s[f.id]){o.push(d(f)),s[f.id]=!0,l=!0;break}}for(var g=0;!l&&(s[e[g].id]||(o.push(d(e[g])),s[e[g].id]=!0,l=!0),++g!==n););}else o.push(d(a)),s[a.id]=!0,i++})),o},v=function(t,e,r){var o=t,s=e,n=r;return o||\\\"undefined\\\"==typeof window||(o=window.innerWidth),s||\\\"undefined\\\"==typeof window||(s=window.innerHeight),n||(n=[o/2,s/2]),[o,s,n]},M={nodeSize:30,minNodeSpacing:10,nodeSpacing:10,preventOverlap:!1,sweep:void 0,equidistant:!1,startAngle:1.5*Math.PI,clockwise:!0,maxLevelDiff:void 0,sortBy:\\\"degree\\\"},b=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"concentric\\\",Object.assign(this.options,M,t)}return t.prototype.execute=function(t,e){return this.genericConcentricLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericConcentricLayout(!0,t,e)},t.prototype.genericConcentricLayout=function(t,e,r){var s=o(o({},this.options),r),n=s.center,a=s.width,l=s.height,c=s.sortBy,m=s.maxLevelDiff,p=s.sweep,w=s.clockwise,y=s.equidistant,v=s.minNodeSpacing,M=void 0===v?10:v,b=s.preventOverlap,E=s.startAngle,x=void 0===E?1.5*Math.PI:E,S=s.nodeSize,N=s.nodeSpacing,R=s.layoutInvisibles,I=s.onLayoutEnd,k=e.getAllNodes(),A=e.getAllEdges();R||(k=k.filter((function(t){return t.data.visible||void 0===t.data.visible})),A=A.filter((function(t){return t.data.visible||void 0===t.data.visible})));var T=k.length;if(0===T){var D={nodes:[],edges:A};return null==I||I(D),D}var C=a||\\\"undefined\\\"==typeof window?a:window.innerWidth,z=l||\\\"undefined\\\"==typeof window?l:window.innerHeight,P=n||[C/2,z/2];if(1===T){t&&e.mergeNodeData(k[0].id,{x:P[0],y:P[1]});var V={nodes:[o(o({},k[0]),{data:o(o({},k[0].data),{x:P[0],y:P[1]})})],edges:A};return null==I||I(V),V}var q,j=[],O=0;q=h(S)?Math.max(S[0],S[1]):S,h(N)?O=Math.max(N[0],N[1]):u(N)&&(O=N),k.forEach((function(t){j.push(d(t));var e=q;h(t.data.size)?e=Math.max(t.data.size[0],t.data.size[1]):u(t.data.size)?e=t.data.size:f(t.data.size)&&(e=Math.max(t.data.size.width,t.data.size.height)),q=Math.max(q,e),g(N)&&(O=Math.max(N(t),O))}));var F={};j.forEach((function(t,e){F[t.id]=e}));var L=c;i(L)&&void 0!==j[0].data[L]||(L=\\\"degree\\\"),\\\"degree\\\"===L?j.sort((function(t,r){return e.getDegree(r.id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")})):j.sort((function(t,e){return e.data[L]-t.data[L]}));var $=j[0],U=m||$.data[L]/4,B=[{nodes:[]}],K=B[0];j.forEach((function(t){if(K.nodes.length>0){var e=Math.abs(K.nodes[0].data[L]-t.data[L]);U&&e>=U&&(K={nodes:[]},B.push(K))}K.nodes.push(t)}));var W=q+(O||M);if(!b){var J=B.length>0&&B[0].nodes.length>1,_=(Math.min(C,z)/2-W)/(B.length+(J?1:0));W=Math.min(W,_)}var G=0;if(B.forEach((function(t){var e=void 0===p?2*Math.PI-2*Math.PI/t.nodes.length:p;if(t.dTheta=e/Math.max(1,t.nodes.length-1),t.nodes.length>1&&b){var r=Math.cos(t.dTheta)-Math.cos(0),o=Math.sin(t.dTheta)-Math.sin(0),s=Math.sqrt(W*W/(r*r+o*o));G=Math.max(s,G)}t.r=G,G+=W})),y){for(var H=0,Y=0,Q=0;Q<B.length;Q++){var X=(B[Q].r||0)-Y;H=Math.max(H,X)}Y=0,B.forEach((function(t,e){0===e&&(Y=t.r||0),t.r=Y,Y+=H}))}B.forEach((function(t){var e=t.dTheta||0,r=t.r||0;t.nodes.forEach((function(t,o){var s=x+(w?1:-1)*e*o;t.data.x=P[0]+r*Math.cos(s),t.data.y=P[1]+r*Math.sin(s)}))})),t&&j.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var Z={nodes:j,edges:A};return null==I||I(Z),Z},t}(),E={begin:[0,0],preventOverlap:!0,preventOverlapPadding:10,condense:!1,rows:void 0,cols:void 0,position:void 0,sortBy:\\\"degree\\\",nodeSize:30,width:300,height:300},x=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"grid\\\",Object.assign(this.options,E,t)}return t.prototype.execute=function(t,e){return this.genericGridLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericGridLayout(!0,t,e)},t.prototype.genericGridLayout=function(t,e,r){var s=o(o({},this.options),r),n=s.begin,a=void 0===n?[0,0]:n,u=s.condense,l=s.preventOverlapPadding,c=s.preventOverlap,f=s.columns,g=s.rows,p=s.cols,w=void 0===p?f:p,y=s.nodeSpacing,v=s.nodeSize,M=s.onLayoutEnd,b=s.position,E=s.sortBy,x=s.width,k=s.height,T=s.layoutInvisibles,D=e.getAllNodes(),C=e.getAllEdges();T||(D=D.filter((function(t){return t.data.visible||void 0===t.data.visible})),C=C.filter((function(t){return t.data.visible||void 0===t.data.visible})));var z=D.length;if(0===z){var P={nodes:[],edges:C};return null==M||M(P),P}if(1===z){t&&e.mergeNodeData(D[0].id,{x:a[0],y:a[1]});var V={nodes:[o(o({},D[0]),{data:o(o({},D[0].data),{x:a[0],y:a[1]})})],edges:C};return null==M||M(V),V}var q=D.map((function(t){return d(t)}));i(E)&&void 0!==q[0].data[E]||(E=\\\"degree\\\"),\\\"degree\\\"===E?q.sort((function(t,r){return e.getDegree(r.id,\\\"both\\\")-e.getDegree(t.id,\\\"both\\\")})):q.sort((function(t,e){return e.data[E]-t.data[E]}));var j=x||\\\"undefined\\\"==typeof window?x:window.innerWidth,O=k||\\\"undefined\\\"==typeof window?k:window.innerHeight,F=z,L={rows:g,cols:w};if(null!=g&&null!=w)L.rows=g,L.cols=w;else if(null!=g&&null==w)L.rows=g,L.cols=Math.ceil(F/L.rows);else if(null==g&&null!=w)L.cols=w,L.rows=Math.ceil(F/L.cols);else{var $=Math.sqrt(F*O/j);L.rows=Math.round($),L.cols=Math.round(j/O*$)}if(L.rows=Math.max(L.rows,1),L.cols=Math.max(L.cols,1),L.cols*L.rows>F)((B=S(L))-1)*(U=N(L))>=F?S(L,B-1):(U-1)*B>=F&&N(L,U-1);else for(;L.cols*L.rows<F;){var U,B=S(L);((U=N(L))+1)*B>=F?N(L,U+1):S(L,B+1)}var K=u?0:j/L.cols,W=u?0:O/L.rows;if(c||y){var J=m(10,y),_=m(30,v,!1);q.forEach((function(t){t.data.x&&t.data.y||(t.data.x=0,t.data.y=0);var r,o,s=e.getNode(t.id),n=_(s)||30;h(n)?(r=n[0],o=n[1]):(r=n,o=n);var i=void 0!==J?J(t):l,a=r+i,u=o+i;K=Math.max(K,a),W=Math.max(W,u)}))}for(var G={},H={row:0,col:0},Y={},Q=0;Q<q.length;Q++){var X=q[Q],Z=void 0;if(b&&(Z=b(e.getNode(X.id))),Z&&(void 0!==Z.row||void 0!==Z.col)){var tt={row:Z.row,col:Z.col};if(void 0===tt.col)for(tt.col=0;R(G,tt);)tt.col++;else if(void 0===tt.row)for(tt.row=0;R(G,tt);)tt.row++;Y[X.id]=tt,I(G,tt)}A(X,a,K,W,Y,L,H,G)}var et={nodes:q,edges:C};return null==M||M(et),t&&q.forEach((function(t){e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})})),et},t}(),S=function(t,e){var r,o=t.rows||5,s=t.cols||5;return null==e?r=Math.min(o,s):Math.min(o,s)===t.rows?t.rows=e:t.cols=e,r},N=function(t,e){var r,o=t.rows||5,s=t.cols||5;return null==e?r=Math.max(o,s):Math.max(o,s)===t.rows?t.rows=e:t.cols=e,r},R=function(t,e){return t[\\\"c-\\\".concat(e.row,\\\"-\\\").concat(e.col)]||!1},I=function(t,e){return t[\\\"c-\\\".concat(e.row,\\\"-\\\").concat(e.col)]=!0},k=function(t,e){var r=t.cols||5;e.col++,e.col>=r&&(e.col=0,e.row++)},A=function(t,e,r,o,s,n,i,a){var h,u,l=s[t.id];if(l)h=l.col*r+r/2+e[0],u=l.row*o+o/2+e[1];else{for(;R(a,i);)k(n,i);h=i.col*r+r/2+e[0],u=i.row*o+o/2+e[1],I(a,i),k(n,i)}t.data.x=h,t.data.y=u};const T=Object.prototype.toString;function D(t){return T.call(t).endsWith(\\\"Array]\\\")}function C(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!D(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");var r=e.fromIndex,o=void 0===r?0:r,s=e.toIndex,n=void 0===s?t.length:s;if(o<0||o>=t.length||!Number.isInteger(o))throw new Error(\\\"fromIndex must be a positive integer smaller than length\\\");if(n<=o||n>t.length||!Number.isInteger(n))throw new Error(\\\"toIndex must be an integer greater than fromIndex and at most equal to length\\\");for(var i=t[o],a=o+1;a<n;a++)t[a]>i&&(i=t[a]);return i}function z(t){var e=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!D(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");var r=e.fromIndex,o=void 0===r?0:r,s=e.toIndex,n=void 0===s?t.length:s;if(o<0||o>=t.length||!Number.isInteger(o))throw new Error(\\\"fromIndex must be a positive integer smaller than length\\\");if(n<=o||n>t.length||!Number.isInteger(n))throw new Error(\\\"toIndex must be an integer greater than fromIndex and at most equal to length\\\");for(var i=t[o],a=o+1;a<n;a++)t[a]<i&&(i=t[a]);return i}function P(t){var e,r=arguments.length>1&&void 0!==arguments[1]?arguments[1]:{};if(!D(t))throw new TypeError(\\\"input must be an array\\\");if(0===t.length)throw new TypeError(\\\"input must not be empty\\\");if(void 0!==r.output){if(!D(r.output))throw new TypeError(\\\"output option must be an array if specified\\\");e=r.output}else e=new Array(t.length);var o=z(t),s=C(t);if(o===s)throw new RangeError(\\\"minimum and maximum input values are equal. Cannot rescale a constant array\\\");var n=r.min,i=void 0===n?r.autoMinMax?o:0:n,a=r.max,h=void 0===a?r.autoMinMax?s:1:a;if(i>=h)throw new RangeError(\\\"min option must be smaller than max option\\\");for(var u=(h-i)/(s-o),l=0;l<t.length;l++)e[l]=(t[l]-o)*u+i;return e}const V=\\\" \\\".repeat(2),q=\\\" \\\".repeat(4);function j(t,e={}){const{maxRows:r=15,maxColumns:o=10,maxNumSize:s=8,padMinus:n=\\\"auto\\\"}=e;return`${t.constructor.name} {\\\\n${V}[\\\\n${q}${function(t,e,r,o,s){const{rows:n,columns:i}=t,a=Math.min(n,e),h=Math.min(i,r),u=[];if(\\\"auto\\\"===s){s=!1;t:for(let e=0;e<a;e++)for(let r=0;r<h;r++)if(t.get(e,r)<0){s=!0;break t}}for(let e=0;e<a;e++){let r=[];for(let n=0;n<h;n++)r.push(O(t.get(e,n),o,s));u.push(`${r.join(\\\" \\\")}`)}return h!==i&&(u[u.length-1]+=` ... ${i-r} more columns`),a!==n&&u.push(`... ${n-e} more rows`),u.join(`\\\\n${q}`)}(t,r,o,s,n)}\\\\n${V}]\\\\n${V}rows: ${t.rows}\\\\n${V}columns: ${t.columns}\\\\n}`}function O(t,e,r){return(t>=0&&r?` ${F(t,e-1)}`:F(t,e)).padEnd(e)}function F(t,e){let r=t.toString();if(r.length<=e)return r;let o=t.toFixed(e);if(o.length>e&&(o=t.toFixed(Math.max(0,e-(o.length-e)))),o.length<=e&&!o.startsWith(\\\"0.000\\\")&&!o.startsWith(\\\"-0.000\\\"))return o;let s=t.toExponential(e);return s.length>e&&(s=t.toExponential(Math.max(0,e-(s.length-e)))),s.slice(0)}function L(t,e,r){let o=r?t.rows:t.rows-1;if(e<0||e>o)throw new RangeError(\\\"Row index out of range\\\")}function $(t,e,r){let o=r?t.columns:t.columns-1;if(e<0||e>o)throw new RangeError(\\\"Column index out of range\\\")}function U(t,e){if(e.to1DArray&&(e=e.to1DArray()),e.length!==t.columns)throw new RangeError(\\\"vector size must be the same as the number of columns\\\");return e}function B(t,e){if(e.to1DArray&&(e=e.to1DArray()),e.length!==t.rows)throw new RangeError(\\\"vector size must be the same as the number of rows\\\");return e}function K(t,e,r,o,s){if(5!==arguments.length)throw new RangeError(\\\"expected 4 arguments\\\");if(J(\\\"startRow\\\",e),J(\\\"endRow\\\",r),J(\\\"startColumn\\\",o),J(\\\"endColumn\\\",s),e>r||o>s||e<0||e>=t.rows||r<0||r>=t.rows||o<0||o>=t.columns||s<0||s>=t.columns)throw new RangeError(\\\"Submatrix indices are out of range\\\")}function W(t,e=0){let r=[];for(let o=0;o<t;o++)r.push(e);return r}function J(t,e){if(\\\"number\\\"!=typeof e)throw new TypeError(`${t} must be a number`)}function _(t){if(t.isEmpty())throw new Error(\\\"Empty matrix has no elements to index\\\")}class G{static from1DArray(t,e,r){if(t*e!==r.length)throw new RangeError(\\\"data length does not match given dimensions\\\");let o=new Y(t,e);for(let s=0;s<t;s++)for(let t=0;t<e;t++)o.set(s,t,r[s*e+t]);return o}static rowVector(t){let e=new Y(1,t.length);for(let r=0;r<t.length;r++)e.set(0,r,t[r]);return e}static columnVector(t){let e=new Y(t.length,1);for(let r=0;r<t.length;r++)e.set(r,0,t[r]);return e}static zeros(t,e){return new Y(t,e)}static ones(t,e){return new Y(t,e).fill(1)}static rand(t,e,r={}){if(\\\"object\\\"!=typeof r)throw new TypeError(\\\"options must be an object\\\");const{random:o=Math.random}=r;let s=new Y(t,e);for(let r=0;r<t;r++)for(let t=0;t<e;t++)s.set(r,t,o());return s}static randInt(t,e,r={}){if(\\\"object\\\"!=typeof r)throw new TypeError(\\\"options must be an object\\\");const{min:o=0,max:s=1e3,random:n=Math.random}=r;if(!Number.isInteger(o))throw new TypeError(\\\"min must be an integer\\\");if(!Number.isInteger(s))throw new TypeError(\\\"max must be an integer\\\");if(o>=s)throw new RangeError(\\\"min must be smaller than max\\\");let i=s-o,a=new Y(t,e);for(let r=0;r<t;r++)for(let t=0;t<e;t++){let e=o+Math.round(n()*i);a.set(r,t,e)}return a}static eye(t,e,r){void 0===e&&(e=t),void 0===r&&(r=1);let o=Math.min(t,e),s=this.zeros(t,e);for(let t=0;t<o;t++)s.set(t,t,r);return s}static diag(t,e,r){let o=t.length;void 0===e&&(e=o),void 0===r&&(r=e);let s=Math.min(o,e,r),n=this.zeros(e,r);for(let e=0;e<s;e++)n.set(e,e,t[e]);return n}static min(t,e){t=this.checkMatrix(t),e=this.checkMatrix(e);let r=t.rows,o=t.columns,s=new Y(r,o);for(let n=0;n<r;n++)for(let r=0;r<o;r++)s.set(n,r,Math.min(t.get(n,r),e.get(n,r)));return s}static max(t,e){t=this.checkMatrix(t),e=this.checkMatrix(e);let r=t.rows,o=t.columns,s=new this(r,o);for(let n=0;n<r;n++)for(let r=0;r<o;r++)s.set(n,r,Math.max(t.get(n,r),e.get(n,r)));return s}static checkMatrix(t){return G.isMatrix(t)?t:new Y(t)}static isMatrix(t){return null!=t&&\\\"Matrix\\\"===t.klass}get size(){return this.rows*this.columns}apply(t){if(\\\"function\\\"!=typeof t)throw new TypeError(\\\"callback must be a function\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.call(this,e,r);return this}to1DArray(){let t=[];for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.push(this.get(e,r));return t}to2DArray(){let t=[];for(let e=0;e<this.rows;e++){t.push([]);for(let r=0;r<this.columns;r++)t[e].push(this.get(e,r))}return t}toJSON(){return this.to2DArray()}isRowVector(){return 1===this.rows}isColumnVector(){return 1===this.columns}isVector(){return 1===this.rows||1===this.columns}isSquare(){return this.rows===this.columns}isEmpty(){return 0===this.rows||0===this.columns}isSymmetric(){if(this.isSquare()){for(let t=0;t<this.rows;t++)for(let e=0;e<=t;e++)if(this.get(t,e)!==this.get(e,t))return!1;return!0}return!1}isEchelonForm(){let t=0,e=0,r=-1,o=!0,s=!1;for(;t<this.rows&&o;){for(e=0,s=!1;e<this.columns&&!1===s;)0===this.get(t,e)?e++:1===this.get(t,e)&&e>r?(s=!0,r=e):(o=!1,s=!0);t++}return o}isReducedEchelonForm(){let t=0,e=0,r=-1,o=!0,s=!1;for(;t<this.rows&&o;){for(e=0,s=!1;e<this.columns&&!1===s;)0===this.get(t,e)?e++:1===this.get(t,e)&&e>r?(s=!0,r=e):(o=!1,s=!0);for(let r=e+1;r<this.rows;r++)0!==this.get(t,r)&&(o=!1);t++}return o}echelonForm(){let t=this.clone(),e=0,r=0;for(;e<t.rows&&r<t.columns;){let o=e;for(let s=e;s<t.rows;s++)t.get(s,r)>t.get(o,r)&&(o=s);if(0===t.get(o,r))r++;else{t.swapRows(e,o);let s=t.get(e,r);for(let o=r;o<t.columns;o++)t.set(e,o,t.get(e,o)/s);for(let o=e+1;o<t.rows;o++){let s=t.get(o,r)/t.get(e,r);t.set(o,r,0);for(let n=r+1;n<t.columns;n++)t.set(o,n,t.get(o,n)-t.get(e,n)*s)}e++,r++}}return t}reducedEchelonForm(){let t=this.echelonForm(),e=t.columns,r=t.rows,o=r-1;for(;o>=0;)if(0===t.maxRow(o))o--;else{let s=0,n=!1;for(;s<r&&!1===n;)1===t.get(o,s)?n=!0:s++;for(let r=0;r<o;r++){let n=t.get(r,s);for(let i=s;i<e;i++){let e=t.get(r,i)-n*t.get(o,i);t.set(r,i,e)}}o--}return t}set(){throw new Error(\\\"set method is unimplemented\\\")}get(){throw new Error(\\\"get method is unimplemented\\\")}repeat(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{rows:e=1,columns:r=1}=t;if(!Number.isInteger(e)||e<=0)throw new TypeError(\\\"rows must be a positive integer\\\");if(!Number.isInteger(r)||r<=0)throw new TypeError(\\\"columns must be a positive integer\\\");let o=new Y(this.rows*e,this.columns*r);for(let t=0;t<e;t++)for(let e=0;e<r;e++)o.setSubMatrix(this,this.rows*t,this.columns*e);return o}fill(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,t);return this}neg(){return this.mulS(-1)}getRow(t){L(this,t);let e=[];for(let r=0;r<this.columns;r++)e.push(this.get(t,r));return e}getRowVector(t){return Y.rowVector(this.getRow(t))}setRow(t,e){L(this,t),e=U(this,e);for(let r=0;r<this.columns;r++)this.set(t,r,e[r]);return this}swapRows(t,e){L(this,t),L(this,e);for(let r=0;r<this.columns;r++){let o=this.get(t,r);this.set(t,r,this.get(e,r)),this.set(e,r,o)}return this}getColumn(t){$(this,t);let e=[];for(let r=0;r<this.rows;r++)e.push(this.get(r,t));return e}getColumnVector(t){return Y.columnVector(this.getColumn(t))}setColumn(t,e){$(this,t),e=B(this,e);for(let r=0;r<this.rows;r++)this.set(r,t,e[r]);return this}swapColumns(t,e){$(this,t),$(this,e);for(let r=0;r<this.rows;r++){let o=this.get(r,t);this.set(r,t,this.get(r,e)),this.set(r,e,o)}return this}addRowVector(t){t=U(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t[r]);return this}subRowVector(t){t=U(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t[r]);return this}mulRowVector(t){t=U(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t[r]);return this}divRowVector(t){t=U(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t[r]);return this}addColumnVector(t){t=B(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t[e]);return this}subColumnVector(t){t=B(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t[e]);return this}mulColumnVector(t){t=B(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t[e]);return this}divColumnVector(t){t=B(this,t);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t[e]);return this}mulRow(t,e){L(this,t);for(let r=0;r<this.columns;r++)this.set(t,r,this.get(t,r)*e);return this}mulColumn(t,e){$(this,t);for(let r=0;r<this.rows;r++)this.set(r,t,this.get(r,t)*e);return this}max(t){if(this.isEmpty())return NaN;switch(t){case\\\"row\\\":{const t=new Array(this.rows).fill(Number.NEGATIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t[e]&&(t[e]=this.get(e,r));return t}case\\\"column\\\":{const t=new Array(this.columns).fill(Number.NEGATIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t[r]&&(t[r]=this.get(e,r));return t}case void 0:{let t=this.get(0,0);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)>t&&(t=this.get(e,r));return t}default:throw new Error(`invalid option: ${t}`)}}maxIndex(){_(this);let t=this.get(0,0),e=[0,0];for(let r=0;r<this.rows;r++)for(let o=0;o<this.columns;o++)this.get(r,o)>t&&(t=this.get(r,o),e[0]=r,e[1]=o);return e}min(t){if(this.isEmpty())return NaN;switch(t){case\\\"row\\\":{const t=new Array(this.rows).fill(Number.POSITIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t[e]&&(t[e]=this.get(e,r));return t}case\\\"column\\\":{const t=new Array(this.columns).fill(Number.POSITIVE_INFINITY);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t[r]&&(t[r]=this.get(e,r));return t}case void 0:{let t=this.get(0,0);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.get(e,r)<t&&(t=this.get(e,r));return t}default:throw new Error(`invalid option: ${t}`)}}minIndex(){_(this);let t=this.get(0,0),e=[0,0];for(let r=0;r<this.rows;r++)for(let o=0;o<this.columns;o++)this.get(r,o)<t&&(t=this.get(r,o),e[0]=r,e[1]=o);return e}maxRow(t){if(L(this,t),this.isEmpty())return NaN;let e=this.get(t,0);for(let r=1;r<this.columns;r++)this.get(t,r)>e&&(e=this.get(t,r));return e}maxRowIndex(t){L(this,t),_(this);let e=this.get(t,0),r=[t,0];for(let o=1;o<this.columns;o++)this.get(t,o)>e&&(e=this.get(t,o),r[1]=o);return r}minRow(t){if(L(this,t),this.isEmpty())return NaN;let e=this.get(t,0);for(let r=1;r<this.columns;r++)this.get(t,r)<e&&(e=this.get(t,r));return e}minRowIndex(t){L(this,t),_(this);let e=this.get(t,0),r=[t,0];for(let o=1;o<this.columns;o++)this.get(t,o)<e&&(e=this.get(t,o),r[1]=o);return r}maxColumn(t){if($(this,t),this.isEmpty())return NaN;let e=this.get(0,t);for(let r=1;r<this.rows;r++)this.get(r,t)>e&&(e=this.get(r,t));return e}maxColumnIndex(t){$(this,t),_(this);let e=this.get(0,t),r=[0,t];for(let o=1;o<this.rows;o++)this.get(o,t)>e&&(e=this.get(o,t),r[0]=o);return r}minColumn(t){if($(this,t),this.isEmpty())return NaN;let e=this.get(0,t);for(let r=1;r<this.rows;r++)this.get(r,t)<e&&(e=this.get(r,t));return e}minColumnIndex(t){$(this,t),_(this);let e=this.get(0,t),r=[0,t];for(let o=1;o<this.rows;o++)this.get(o,t)<e&&(e=this.get(o,t),r[0]=o);return r}diag(){let t=Math.min(this.rows,this.columns),e=[];for(let r=0;r<t;r++)e.push(this.get(r,r));return e}norm(t=\\\"frobenius\\\"){let e=0;if(\\\"max\\\"===t)return this.max();if(\\\"frobenius\\\"===t){for(let t=0;t<this.rows;t++)for(let r=0;r<this.columns;r++)e+=this.get(t,r)*this.get(t,r);return Math.sqrt(e)}throw new RangeError(`unknown norm type: ${t}`)}cumulativeSum(){let t=0;for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t+=this.get(e,r),this.set(e,r,t);return this}dot(t){G.isMatrix(t)&&(t=t.to1DArray());let e=this.to1DArray();if(e.length!==t.length)throw new RangeError(\\\"vectors do not have the same size\\\");let r=0;for(let o=0;o<e.length;o++)r+=e[o]*t[o];return r}mmul(t){t=Y.checkMatrix(t);let e=this.rows,r=this.columns,o=t.columns,s=new Y(e,o),n=new Float64Array(r);for(let i=0;i<o;i++){for(let e=0;e<r;e++)n[e]=t.get(e,i);for(let t=0;t<e;t++){let e=0;for(let o=0;o<r;o++)e+=this.get(t,o)*n[o];s.set(t,i,e)}}return s}strassen2x2(t){t=Y.checkMatrix(t);let e=new Y(2,2);const r=this.get(0,0),o=t.get(0,0),s=this.get(0,1),n=t.get(0,1),i=this.get(1,0),a=t.get(1,0),h=this.get(1,1),u=t.get(1,1),l=(r+h)*(o+u),c=(i+h)*o,f=r*(n-u),d=h*(a-o),g=(r+s)*u,m=l+d-g+(s-h)*(a+u),p=f+g,w=c+d,y=l-c+f+(i-r)*(o+n);return e.set(0,0,m),e.set(0,1,p),e.set(1,0,w),e.set(1,1,y),e}strassen3x3(t){t=Y.checkMatrix(t);let e=new Y(3,3);const r=this.get(0,0),o=this.get(0,1),s=this.get(0,2),n=this.get(1,0),i=this.get(1,1),a=this.get(1,2),h=this.get(2,0),u=this.get(2,1),l=this.get(2,2),c=t.get(0,0),f=t.get(0,1),d=t.get(0,2),g=t.get(1,0),m=t.get(1,1),p=t.get(1,2),w=t.get(2,0),y=t.get(2,1),v=t.get(2,2),M=(r-n)*(-f+m),b=(-r+n+i)*(c-f+m),E=(n+i)*(-c+f),x=r*c,S=(-r+h+u)*(c-d+p),N=(-r+h)*(d-p),R=(h+u)*(-c+d),I=(-s+u+l)*(m+w-y),k=(s-l)*(m-y),A=s*w,T=(u+l)*(-w+y),D=(-s+i+a)*(p+w-v),C=(s-a)*(p-v),z=(i+a)*(-w+v),P=x+A+o*g,V=(r+o+s-n-i-u-l)*m+b+E+x+I+A+T,q=x+S+R+(r+o+s-i-a-h-u)*p+A+D+z,j=M+i*(-c+f+g-m-p-w+v)+b+x+A+D+C,O=M+b+E+x+a*y,F=A+D+C+z+n*d,L=x+S+N+u*(-c+d+g-m-p-w+y)+I+k+A,$=I+k+A+T+h*f,U=x+S+N+R+l*v;return e.set(0,0,P),e.set(0,1,V),e.set(0,2,q),e.set(1,0,j),e.set(1,1,O),e.set(1,2,F),e.set(2,0,L),e.set(2,1,$),e.set(2,2,U),e}mmulStrassen(t){t=Y.checkMatrix(t);let e=this.clone(),r=e.rows,o=e.columns,s=t.rows,n=t.columns;function i(t,e,r){let o=t.rows,s=t.columns;if(o===e&&s===r)return t;{let o=G.zeros(e,r);return o=o.setSubMatrix(t,0,0),o}}o!==s&&console.warn(`Multiplying ${r} x ${o} and ${s} x ${n} matrix: dimensions do not match.`);let a=Math.max(r,s),h=Math.max(o,n);return e=i(e,a,h),function t(e,r,o,s){if(o<=512||s<=512)return e.mmul(r);o%2==1&&s%2==1?(e=i(e,o+1,s+1),r=i(r,o+1,s+1)):o%2==1?(e=i(e,o+1,s),r=i(r,o+1,s)):s%2==1&&(e=i(e,o,s+1),r=i(r,o,s+1));let n=parseInt(e.rows/2,10),a=parseInt(e.columns/2,10),h=e.subMatrix(0,n-1,0,a-1),u=r.subMatrix(0,n-1,0,a-1),l=e.subMatrix(0,n-1,a,e.columns-1),c=r.subMatrix(0,n-1,a,r.columns-1),f=e.subMatrix(n,e.rows-1,0,a-1),d=r.subMatrix(n,r.rows-1,0,a-1),g=e.subMatrix(n,e.rows-1,a,e.columns-1),m=r.subMatrix(n,r.rows-1,a,r.columns-1),p=t(G.add(h,g),G.add(u,m),n,a),w=t(G.add(f,g),u,n,a),y=t(h,G.sub(c,m),n,a),v=t(g,G.sub(d,u),n,a),M=t(G.add(h,l),m,n,a),b=t(G.sub(f,h),G.add(u,c),n,a),E=t(G.sub(l,g),G.add(d,m),n,a),x=G.add(p,v);x.sub(M),x.add(E);let S=G.add(y,M),N=G.add(w,v),R=G.sub(p,w);R.add(y),R.add(b);let I=G.zeros(2*x.rows,2*x.columns);return I=I.setSubMatrix(x,0,0),I=I.setSubMatrix(S,x.rows,0),I=I.setSubMatrix(N,0,x.columns),I=I.setSubMatrix(R,x.rows,x.columns),I.subMatrix(0,o-1,0,s-1)}(e,t=i(t,a,h),a,h)}scaleRows(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{min:e=0,max:r=1}=t;if(!Number.isFinite(e))throw new TypeError(\\\"min must be a number\\\");if(!Number.isFinite(r))throw new TypeError(\\\"max must be a number\\\");if(e>=r)throw new RangeError(\\\"min must be smaller than max\\\");let o=new Y(this.rows,this.columns);for(let t=0;t<this.rows;t++){const s=this.getRow(t);s.length>0&&P(s,{min:e,max:r,output:s}),o.setRow(t,s)}return o}scaleColumns(t={}){if(\\\"object\\\"!=typeof t)throw new TypeError(\\\"options must be an object\\\");const{min:e=0,max:r=1}=t;if(!Number.isFinite(e))throw new TypeError(\\\"min must be a number\\\");if(!Number.isFinite(r))throw new TypeError(\\\"max must be a number\\\");if(e>=r)throw new RangeError(\\\"min must be smaller than max\\\");let o=new Y(this.rows,this.columns);for(let t=0;t<this.columns;t++){const s=this.getColumn(t);s.length&&P(s,{min:e,max:r,output:s}),o.setColumn(t,s)}return o}flipRows(){const t=Math.ceil(this.columns/2);for(let e=0;e<this.rows;e++)for(let r=0;r<t;r++){let t=this.get(e,r),o=this.get(e,this.columns-1-r);this.set(e,r,o),this.set(e,this.columns-1-r,t)}return this}flipColumns(){const t=Math.ceil(this.rows/2);for(let e=0;e<this.columns;e++)for(let r=0;r<t;r++){let t=this.get(r,e),o=this.get(this.rows-1-r,e);this.set(r,e,o),this.set(this.rows-1-r,e,t)}return this}kroneckerProduct(t){t=Y.checkMatrix(t);let e=this.rows,r=this.columns,o=t.rows,s=t.columns,n=new Y(e*o,r*s);for(let i=0;i<e;i++)for(let e=0;e<r;e++)for(let r=0;r<o;r++)for(let a=0;a<s;a++)n.set(o*i+r,s*e+a,this.get(i,e)*t.get(r,a));return n}kroneckerSum(t){if(t=Y.checkMatrix(t),!this.isSquare()||!t.isSquare())throw new Error(\\\"Kronecker Sum needs two Square Matrices\\\");let e=this.rows,r=t.rows,o=this.kroneckerProduct(Y.eye(r,r)),s=Y.eye(e,e).kroneckerProduct(t);return o.add(s)}transpose(){let t=new Y(this.columns,this.rows);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.set(r,e,this.get(e,r));return t}sortRows(t=H){for(let e=0;e<this.rows;e++)this.setRow(e,this.getRow(e).sort(t));return this}sortColumns(t=H){for(let e=0;e<this.columns;e++)this.setColumn(e,this.getColumn(e).sort(t));return this}subMatrix(t,e,r,o){K(this,t,e,r,o);let s=new Y(e-t+1,o-r+1);for(let n=t;n<=e;n++)for(let e=r;e<=o;e++)s.set(n-t,e-r,this.get(n,e));return s}subMatrixRow(t,e,r){if(void 0===e&&(e=0),void 0===r&&(r=this.columns-1),e>r||e<0||e>=this.columns||r<0||r>=this.columns)throw new RangeError(\\\"Argument out of range\\\");let o=new Y(t.length,r-e+1);for(let s=0;s<t.length;s++)for(let n=e;n<=r;n++){if(t[s]<0||t[s]>=this.rows)throw new RangeError(`Row index out of range: ${t[s]}`);o.set(s,n-e,this.get(t[s],n))}return o}subMatrixColumn(t,e,r){if(void 0===e&&(e=0),void 0===r&&(r=this.rows-1),e>r||e<0||e>=this.rows||r<0||r>=this.rows)throw new RangeError(\\\"Argument out of range\\\");let o=new Y(r-e+1,t.length);for(let s=0;s<t.length;s++)for(let n=e;n<=r;n++){if(t[s]<0||t[s]>=this.columns)throw new RangeError(`Column index out of range: ${t[s]}`);o.set(n-e,s,this.get(n,t[s]))}return o}setSubMatrix(t,e,r){if((t=Y.checkMatrix(t)).isEmpty())return this;K(this,e,e+t.rows-1,r,r+t.columns-1);for(let o=0;o<t.rows;o++)for(let s=0;s<t.columns;s++)this.set(e+o,r+s,t.get(o,s));return this}selection(t,e){!function(t,e){if(!D(e))throw new TypeError(\\\"row indices must be an array\\\");for(let r=0;r<e.length;r++)if(e[r]<0||e[r]>=t.rows)throw new RangeError(\\\"row indices are out of range\\\")}(this,t),function(t,e){if(!D(e))throw new TypeError(\\\"column indices must be an array\\\");for(let r=0;r<e.length;r++)if(e[r]<0||e[r]>=t.columns)throw new RangeError(\\\"column indices are out of range\\\")}(this,e);let r=new Y(t.length,e.length);for(let o=0;o<t.length;o++){let s=t[o];for(let t=0;t<e.length;t++){let n=e[t];r.set(o,t,this.get(s,n))}}return r}trace(){let t=Math.min(this.rows,this.columns),e=0;for(let r=0;r<t;r++)e+=this.get(r,r);return e}clone(){let t=new Y(this.rows,this.columns);for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)t.set(e,r,this.get(e,r));return t}sum(t){switch(t){case\\\"row\\\":return function(t){let e=W(t.rows);for(let r=0;r<t.rows;++r)for(let o=0;o<t.columns;++o)e[r]+=t.get(r,o);return e}(this);case\\\"column\\\":return function(t){let e=W(t.columns);for(let r=0;r<t.rows;++r)for(let o=0;o<t.columns;++o)e[o]+=t.get(r,o);return e}(this);case void 0:return function(t){let e=0;for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)e+=t.get(r,o);return e}(this);default:throw new Error(`invalid option: ${t}`)}}product(t){switch(t){case\\\"row\\\":return function(t){let e=W(t.rows,1);for(let r=0;r<t.rows;++r)for(let o=0;o<t.columns;++o)e[r]*=t.get(r,o);return e}(this);case\\\"column\\\":return function(t){let e=W(t.columns,1);for(let r=0;r<t.rows;++r)for(let o=0;o<t.columns;++o)e[o]*=t.get(r,o);return e}(this);case void 0:return function(t){let e=1;for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)e*=t.get(r,o);return e}(this);default:throw new Error(`invalid option: ${t}`)}}mean(t){const e=this.sum(t);switch(t){case\\\"row\\\":for(let t=0;t<this.rows;t++)e[t]/=this.columns;return e;case\\\"column\\\":for(let t=0;t<this.columns;t++)e[t]/=this.rows;return e;case void 0:return e/this.size;default:throw new Error(`invalid option: ${t}`)}}variance(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");const{unbiased:r=!0,mean:o=this.mean(t)}=e;if(\\\"boolean\\\"!=typeof r)throw new TypeError(\\\"unbiased must be a boolean\\\");switch(t){case\\\"row\\\":if(!D(o))throw new TypeError(\\\"mean must be an array\\\");return function(t,e,r){const o=t.rows,s=t.columns,n=[];for(let i=0;i<o;i++){let o=0,a=0,h=0;for(let e=0;e<s;e++)h=t.get(i,e)-r[i],o+=h,a+=h*h;e?n.push((a-o*o/s)/(s-1)):n.push((a-o*o/s)/s)}return n}(this,r,o);case\\\"column\\\":if(!D(o))throw new TypeError(\\\"mean must be an array\\\");return function(t,e,r){const o=t.rows,s=t.columns,n=[];for(let i=0;i<s;i++){let s=0,a=0,h=0;for(let e=0;e<o;e++)h=t.get(e,i)-r[i],s+=h,a+=h*h;e?n.push((a-s*s/o)/(o-1)):n.push((a-s*s/o)/o)}return n}(this,r,o);case void 0:if(\\\"number\\\"!=typeof o)throw new TypeError(\\\"mean must be a number\\\");return function(t,e,r){const o=t.rows,s=t.columns,n=o*s;let i=0,a=0,h=0;for(let e=0;e<o;e++)for(let o=0;o<s;o++)h=t.get(e,o)-r,i+=h,a+=h*h;return e?(a-i*i/n)/(n-1):(a-i*i/n)/n}(this,r,o);default:throw new Error(`invalid option: ${t}`)}}standardDeviation(t,e){\\\"object\\\"==typeof t&&(e=t,t=void 0);const r=this.variance(t,e);if(void 0===t)return Math.sqrt(r);for(let t=0;t<r.length;t++)r[t]=Math.sqrt(r[t]);return r}center(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");const{center:r=this.mean(t)}=e;switch(t){case\\\"row\\\":if(!D(r))throw new TypeError(\\\"center must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)-e[r])}(this,r),this;case\\\"column\\\":if(!D(r))throw new TypeError(\\\"center must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)-e[o])}(this,r),this;case void 0:if(\\\"number\\\"!=typeof r)throw new TypeError(\\\"center must be a number\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)-e)}(this,r),this;default:throw new Error(`invalid option: ${t}`)}}scale(t,e={}){if(\\\"object\\\"==typeof t&&(e=t,t=void 0),\\\"object\\\"!=typeof e)throw new TypeError(\\\"options must be an object\\\");let r=e.scale;switch(t){case\\\"row\\\":if(void 0===r)r=function(t){const e=[];for(let r=0;r<t.rows;r++){let o=0;for(let e=0;e<t.columns;e++)o+=Math.pow(t.get(r,e),2)/(t.columns-1);e.push(Math.sqrt(o))}return e}(this);else if(!D(r))throw new TypeError(\\\"scale must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)/e[r])}(this,r),this;case\\\"column\\\":if(void 0===r)r=function(t){const e=[];for(let r=0;r<t.columns;r++){let o=0;for(let e=0;e<t.rows;e++)o+=Math.pow(t.get(e,r),2)/(t.rows-1);e.push(Math.sqrt(o))}return e}(this);else if(!D(r))throw new TypeError(\\\"scale must be an array\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)/e[o])}(this,r),this;case void 0:if(void 0===r)r=function(t){const e=t.size-1;let r=0;for(let o=0;o<t.columns;o++)for(let s=0;s<t.rows;s++)r+=Math.pow(t.get(s,o),2)/e;return Math.sqrt(r)}(this);else if(\\\"number\\\"!=typeof r)throw new TypeError(\\\"scale must be a number\\\");return function(t,e){for(let r=0;r<t.rows;r++)for(let o=0;o<t.columns;o++)t.set(r,o,t.get(r,o)/e)}(this,r),this;default:throw new Error(`invalid option: ${t}`)}}toString(t){return j(this,t)}}function H(t,e){return t-e}G.prototype.klass=\\\"Matrix\\\",\\\"undefined\\\"!=typeof Symbol&&(G.prototype[Symbol.for(\\\"nodejs.util.inspect.custom\\\")]=function(){return j(this)}),G.random=G.rand,G.randomInt=G.randInt,G.diagonal=G.diag,G.prototype.diagonal=G.prototype.diag,G.identity=G.eye,G.prototype.negate=G.prototype.neg,G.prototype.tensorProduct=G.prototype.kroneckerProduct;class Y extends G{constructor(t,e){if(super(),Y.isMatrix(t))return t.clone();if(Number.isInteger(t)&&t>=0){if(this.data=[],!(Number.isInteger(e)&&e>=0))throw new TypeError(\\\"nColumns must be a positive integer\\\");for(let r=0;r<t;r++)this.data.push(new Float64Array(e))}else{if(!D(t))throw new TypeError(\\\"First argument must be a positive number or an array\\\");{const r=t;if(\\\"number\\\"!=typeof(e=(t=r.length)?r[0].length:0))throw new TypeError(\\\"Data must be a 2D array with at least one element\\\");this.data=[];for(let o=0;o<t;o++){if(r[o].length!==e)throw new RangeError(\\\"Inconsistent array dimensions\\\");if(!r[o].every((t=>\\\"number\\\"==typeof t)))throw new TypeError(\\\"Input data contains non-numeric values\\\");this.data.push(Float64Array.from(r[o]))}}}this.rows=t,this.columns=e}set(t,e,r){return this.data[t][e]=r,this}get(t,e){return this.data[t][e]}removeRow(t){return L(this,t),this.data.splice(t,1),this.rows-=1,this}addRow(t,e){return void 0===e&&(e=t,t=this.rows),L(this,t,!0),e=Float64Array.from(U(this,e)),this.data.splice(t,0,e),this.rows+=1,this}removeColumn(t){$(this,t);for(let e=0;e<this.rows;e++){const r=new Float64Array(this.columns-1);for(let o=0;o<t;o++)r[o]=this.data[e][o];for(let o=t+1;o<this.columns;o++)r[o-1]=this.data[e][o];this.data[e]=r}return this.columns-=1,this}addColumn(t,e){void 0===e&&(e=t,t=this.columns),$(this,t,!0),e=B(this,e);for(let r=0;r<this.rows;r++){const o=new Float64Array(this.columns+1);let s=0;for(;s<t;s++)o[s]=this.data[r][s];for(o[s++]=e[r];s<this.columns+1;s++)o[s]=this.data[r][s-1];this.data[r]=o}return this.columns+=1,this}}!function(t,e){t.prototype.add=function(t){return\\\"number\\\"==typeof t?this.addS(t):this.addM(t)},t.prototype.addS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t);return this},t.prototype.addM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)+t.get(e,r));return this},t.add=function(t,r){return new e(t).add(r)},t.prototype.sub=function(t){return\\\"number\\\"==typeof t?this.subS(t):this.subM(t)},t.prototype.subS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t);return this},t.prototype.subM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)-t.get(e,r));return this},t.sub=function(t,r){return new e(t).sub(r)},t.prototype.subtract=t.prototype.sub,t.prototype.subtractS=t.prototype.subS,t.prototype.subtractM=t.prototype.subM,t.subtract=t.sub,t.prototype.mul=function(t){return\\\"number\\\"==typeof t?this.mulS(t):this.mulM(t)},t.prototype.mulS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t);return this},t.prototype.mulM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)*t.get(e,r));return this},t.mul=function(t,r){return new e(t).mul(r)},t.prototype.multiply=t.prototype.mul,t.prototype.multiplyS=t.prototype.mulS,t.prototype.multiplyM=t.prototype.mulM,t.multiply=t.mul,t.prototype.div=function(t){return\\\"number\\\"==typeof t?this.divS(t):this.divM(t)},t.prototype.divS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t);return this},t.prototype.divM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)/t.get(e,r));return this},t.div=function(t,r){return new e(t).div(r)},t.prototype.divide=t.prototype.div,t.prototype.divideS=t.prototype.divS,t.prototype.divideM=t.prototype.divM,t.divide=t.div,t.prototype.mod=function(t){return\\\"number\\\"==typeof t?this.modS(t):this.modM(t)},t.prototype.modS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)%t);return this},t.prototype.modM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)%t.get(e,r));return this},t.mod=function(t,r){return new e(t).mod(r)},t.prototype.modulus=t.prototype.mod,t.prototype.modulusS=t.prototype.modS,t.prototype.modulusM=t.prototype.modM,t.modulus=t.mod,t.prototype.and=function(t){return\\\"number\\\"==typeof t?this.andS(t):this.andM(t)},t.prototype.andS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)&t);return this},t.prototype.andM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)&t.get(e,r));return this},t.and=function(t,r){return new e(t).and(r)},t.prototype.or=function(t){return\\\"number\\\"==typeof t?this.orS(t):this.orM(t)},t.prototype.orS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)|t);return this},t.prototype.orM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)|t.get(e,r));return this},t.or=function(t,r){return new e(t).or(r)},t.prototype.xor=function(t){return\\\"number\\\"==typeof t?this.xorS(t):this.xorM(t)},t.prototype.xorS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)^t);return this},t.prototype.xorM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)^t.get(e,r));return this},t.xor=function(t,r){return new e(t).xor(r)},t.prototype.leftShift=function(t){return\\\"number\\\"==typeof t?this.leftShiftS(t):this.leftShiftM(t)},t.prototype.leftShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)<<t);return this},t.prototype.leftShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)<<t.get(e,r));return this},t.leftShift=function(t,r){return new e(t).leftShift(r)},t.prototype.signPropagatingRightShift=function(t){return\\\"number\\\"==typeof t?this.signPropagatingRightShiftS(t):this.signPropagatingRightShiftM(t)},t.prototype.signPropagatingRightShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>t);return this},t.prototype.signPropagatingRightShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>t.get(e,r));return this},t.signPropagatingRightShift=function(t,r){return new e(t).signPropagatingRightShift(r)},t.prototype.rightShift=function(t){return\\\"number\\\"==typeof t?this.rightShiftS(t):this.rightShiftM(t)},t.prototype.rightShiftS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>>t);return this},t.prototype.rightShiftM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,this.get(e,r)>>>t.get(e,r));return this},t.rightShift=function(t,r){return new e(t).rightShift(r)},t.prototype.zeroFillRightShift=t.prototype.rightShift,t.prototype.zeroFillRightShiftS=t.prototype.rightShiftS,t.prototype.zeroFillRightShiftM=t.prototype.rightShiftM,t.zeroFillRightShift=t.rightShift,t.prototype.not=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,~this.get(t,e));return this},t.not=function(t){return new e(t).not()},t.prototype.abs=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.abs(this.get(t,e)));return this},t.abs=function(t){return new e(t).abs()},t.prototype.acos=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.acos(this.get(t,e)));return this},t.acos=function(t){return new e(t).acos()},t.prototype.acosh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.acosh(this.get(t,e)));return this},t.acosh=function(t){return new e(t).acosh()},t.prototype.asin=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.asin(this.get(t,e)));return this},t.asin=function(t){return new e(t).asin()},t.prototype.asinh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.asinh(this.get(t,e)));return this},t.asinh=function(t){return new e(t).asinh()},t.prototype.atan=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.atan(this.get(t,e)));return this},t.atan=function(t){return new e(t).atan()},t.prototype.atanh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.atanh(this.get(t,e)));return this},t.atanh=function(t){return new e(t).atanh()},t.prototype.cbrt=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cbrt(this.get(t,e)));return this},t.cbrt=function(t){return new e(t).cbrt()},t.prototype.ceil=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.ceil(this.get(t,e)));return this},t.ceil=function(t){return new e(t).ceil()},t.prototype.clz32=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.clz32(this.get(t,e)));return this},t.clz32=function(t){return new e(t).clz32()},t.prototype.cos=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cos(this.get(t,e)));return this},t.cos=function(t){return new e(t).cos()},t.prototype.cosh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.cosh(this.get(t,e)));return this},t.cosh=function(t){return new e(t).cosh()},t.prototype.exp=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.exp(this.get(t,e)));return this},t.exp=function(t){return new e(t).exp()},t.prototype.expm1=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.expm1(this.get(t,e)));return this},t.expm1=function(t){return new e(t).expm1()},t.prototype.floor=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.floor(this.get(t,e)));return this},t.floor=function(t){return new e(t).floor()},t.prototype.fround=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.fround(this.get(t,e)));return this},t.fround=function(t){return new e(t).fround()},t.prototype.log=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log(this.get(t,e)));return this},t.log=function(t){return new e(t).log()},t.prototype.log1p=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log1p(this.get(t,e)));return this},t.log1p=function(t){return new e(t).log1p()},t.prototype.log10=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log10(this.get(t,e)));return this},t.log10=function(t){return new e(t).log10()},t.prototype.log2=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.log2(this.get(t,e)));return this},t.log2=function(t){return new e(t).log2()},t.prototype.round=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.round(this.get(t,e)));return this},t.round=function(t){return new e(t).round()},t.prototype.sign=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sign(this.get(t,e)));return this},t.sign=function(t){return new e(t).sign()},t.prototype.sin=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sin(this.get(t,e)));return this},t.sin=function(t){return new e(t).sin()},t.prototype.sinh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sinh(this.get(t,e)));return this},t.sinh=function(t){return new e(t).sinh()},t.prototype.sqrt=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.sqrt(this.get(t,e)));return this},t.sqrt=function(t){return new e(t).sqrt()},t.prototype.tan=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.tan(this.get(t,e)));return this},t.tan=function(t){return new e(t).tan()},t.prototype.tanh=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.tanh(this.get(t,e)));return this},t.tanh=function(t){return new e(t).tanh()},t.prototype.trunc=function(){for(let t=0;t<this.rows;t++)for(let e=0;e<this.columns;e++)this.set(t,e,Math.trunc(this.get(t,e)));return this},t.trunc=function(t){return new e(t).trunc()},t.pow=function(t,r){return new e(t).pow(r)},t.prototype.pow=function(t){return\\\"number\\\"==typeof t?this.powS(t):this.powM(t)},t.prototype.powS=function(t){for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,Math.pow(this.get(e,r),t));return this},t.prototype.powM=function(t){if(t=e.checkMatrix(t),this.rows!==t.rows||this.columns!==t.columns)throw new RangeError(\\\"Matrices dimensions must be equal\\\");for(let e=0;e<this.rows;e++)for(let r=0;r<this.columns;r++)this.set(e,r,Math.pow(this.get(e,r),t.get(e,r)));return this}}(G,Y);class Q extends G{constructor(t){super(),this.data=t,this.rows=t.length,this.columns=t[0].length}set(t,e,r){return this.data[t][e]=r,this}get(t,e){return this.data[t][e]}}function X(t,e){let r=0;return Math.abs(t)>Math.abs(e)?(r=e/t,Math.abs(t)*Math.sqrt(1+r*r)):0!==e?(r=t/e,Math.abs(e)*Math.sqrt(1+r*r)):0}class Z{constructor(t,e={}){if((t=Q.checkMatrix(t)).isEmpty())throw new Error(\\\"Matrix must be non-empty\\\");let r=t.rows,o=t.columns;const{computeLeftSingularVectors:s=!0,computeRightSingularVectors:n=!0,autoTranspose:i=!1}=e;let a,h=Boolean(s),u=Boolean(n),l=!1;if(r<o)if(i){a=t.transpose(),r=a.rows,o=a.columns,l=!0;let e=h;h=u,u=e}else a=t.clone(),console.warn(\\\"Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose\\\");else a=t.clone();let c=Math.min(r,o),f=Math.min(r+1,o),d=new Float64Array(f),g=new Y(r,c),m=new Y(o,o),p=new Float64Array(o),w=new Float64Array(r),y=new Float64Array(f);for(let t=0;t<f;t++)y[t]=t;let v=Math.min(r-1,o),M=Math.max(0,Math.min(o-2,r)),b=Math.max(v,M);for(let t=0;t<b;t++){if(t<v){d[t]=0;for(let e=t;e<r;e++)d[t]=X(d[t],a.get(e,t));if(0!==d[t]){a.get(t,t)<0&&(d[t]=-d[t]);for(let e=t;e<r;e++)a.set(e,t,a.get(e,t)/d[t]);a.set(t,t,a.get(t,t)+1)}d[t]=-d[t]}for(let e=t+1;e<o;e++){if(t<v&&0!==d[t]){let o=0;for(let s=t;s<r;s++)o+=a.get(s,t)*a.get(s,e);o=-o/a.get(t,t);for(let s=t;s<r;s++)a.set(s,e,a.get(s,e)+o*a.get(s,t))}p[e]=a.get(t,e)}if(h&&t<v)for(let e=t;e<r;e++)g.set(e,t,a.get(e,t));if(t<M){p[t]=0;for(let e=t+1;e<o;e++)p[t]=X(p[t],p[e]);if(0!==p[t]){p[t+1]<0&&(p[t]=0-p[t]);for(let e=t+1;e<o;e++)p[e]/=p[t];p[t+1]+=1}if(p[t]=-p[t],t+1<r&&0!==p[t]){for(let e=t+1;e<r;e++)w[e]=0;for(let e=t+1;e<r;e++)for(let r=t+1;r<o;r++)w[e]+=p[r]*a.get(e,r);for(let e=t+1;e<o;e++){let o=-p[e]/p[t+1];for(let s=t+1;s<r;s++)a.set(s,e,a.get(s,e)+o*w[s])}}if(u)for(let e=t+1;e<o;e++)m.set(e,t,p[e])}}let E=Math.min(o,r+1);if(v<o&&(d[v]=a.get(v,v)),r<E&&(d[E-1]=0),M+1<E&&(p[M]=a.get(M,E-1)),p[E-1]=0,h){for(let t=v;t<c;t++){for(let e=0;e<r;e++)g.set(e,t,0);g.set(t,t,1)}for(let t=v-1;t>=0;t--)if(0!==d[t]){for(let e=t+1;e<c;e++){let o=0;for(let s=t;s<r;s++)o+=g.get(s,t)*g.get(s,e);o=-o/g.get(t,t);for(let s=t;s<r;s++)g.set(s,e,g.get(s,e)+o*g.get(s,t))}for(let e=t;e<r;e++)g.set(e,t,-g.get(e,t));g.set(t,t,1+g.get(t,t));for(let e=0;e<t-1;e++)g.set(e,t,0)}else{for(let e=0;e<r;e++)g.set(e,t,0);g.set(t,t,1)}}if(u)for(let t=o-1;t>=0;t--){if(t<M&&0!==p[t])for(let e=t+1;e<o;e++){let r=0;for(let s=t+1;s<o;s++)r+=m.get(s,t)*m.get(s,e);r=-r/m.get(t+1,t);for(let s=t+1;s<o;s++)m.set(s,e,m.get(s,e)+r*m.get(s,t))}for(let e=0;e<o;e++)m.set(e,t,0);m.set(t,t,1)}let x=E-1,S=0,N=Number.EPSILON;for(;E>0;){let t,e;for(t=E-2;t>=-1&&-1!==t;t--){const e=Number.MIN_VALUE+N*Math.abs(d[t]+Math.abs(d[t+1]));if(Math.abs(p[t])<=e||Number.isNaN(p[t])){p[t]=0;break}}if(t===E-2)e=4;else{let r;for(r=E-1;r>=t&&r!==t;r--){let e=(r!==E?Math.abs(p[r]):0)+(r!==t+1?Math.abs(p[r-1]):0);if(Math.abs(d[r])<=N*e){d[r]=0;break}}r===t?e=3:r===E-1?e=1:(e=2,t=r)}switch(t++,e){case 1:{let e=p[E-2];p[E-2]=0;for(let r=E-2;r>=t;r--){let s=X(d[r],e),n=d[r]/s,i=e/s;if(d[r]=s,r!==t&&(e=-i*p[r-1],p[r-1]=n*p[r-1]),u)for(let t=0;t<o;t++)s=n*m.get(t,r)+i*m.get(t,E-1),m.set(t,E-1,-i*m.get(t,r)+n*m.get(t,E-1)),m.set(t,r,s)}break}case 2:{let e=p[t-1];p[t-1]=0;for(let o=t;o<E;o++){let s=X(d[o],e),n=d[o]/s,i=e/s;if(d[o]=s,e=-i*p[o],p[o]=n*p[o],h)for(let e=0;e<r;e++)s=n*g.get(e,o)+i*g.get(e,t-1),g.set(e,t-1,-i*g.get(e,o)+n*g.get(e,t-1)),g.set(e,o,s)}break}case 3:{const e=Math.max(Math.abs(d[E-1]),Math.abs(d[E-2]),Math.abs(p[E-2]),Math.abs(d[t]),Math.abs(p[t])),s=d[E-1]/e,n=d[E-2]/e,i=p[E-2]/e,a=d[t]/e,l=p[t]/e,c=((n+s)*(n-s)+i*i)/2,f=s*i*(s*i);let w=0;0===c&&0===f||(w=c<0?0-Math.sqrt(c*c+f):Math.sqrt(c*c+f),w=f/(c+w));let y=(a+s)*(a-s)+w,v=a*l;for(let e=t;e<E-1;e++){let s=X(y,v);0===s&&(s=Number.MIN_VALUE);let n=y/s,i=v/s;if(e!==t&&(p[e-1]=s),y=n*d[e]+i*p[e],p[e]=n*p[e]-i*d[e],v=i*d[e+1],d[e+1]=n*d[e+1],u)for(let t=0;t<o;t++)s=n*m.get(t,e)+i*m.get(t,e+1),m.set(t,e+1,-i*m.get(t,e)+n*m.get(t,e+1)),m.set(t,e,s);if(s=X(y,v),0===s&&(s=Number.MIN_VALUE),n=y/s,i=v/s,d[e]=s,y=n*p[e]+i*d[e+1],d[e+1]=-i*p[e]+n*d[e+1],v=i*p[e+1],p[e+1]=n*p[e+1],h&&e<r-1)for(let t=0;t<r;t++)s=n*g.get(t,e)+i*g.get(t,e+1),g.set(t,e+1,-i*g.get(t,e)+n*g.get(t,e+1)),g.set(t,e,s)}p[E-2]=y,S+=1;break}case 4:if(d[t]<=0&&(d[t]=d[t]<0?-d[t]:0,u))for(let e=0;e<=x;e++)m.set(e,t,-m.get(e,t));for(;t<x&&!(d[t]>=d[t+1]);){let e=d[t];if(d[t]=d[t+1],d[t+1]=e,u&&t<o-1)for(let r=0;r<o;r++)e=m.get(r,t+1),m.set(r,t+1,m.get(r,t)),m.set(r,t,e);if(h&&t<r-1)for(let o=0;o<r;o++)e=g.get(o,t+1),g.set(o,t+1,g.get(o,t)),g.set(o,t,e);t++}S=0,E--}}if(l){let t=m;m=g,g=t}this.m=r,this.n=o,this.s=d,this.U=g,this.V=m}solve(t){let e=t,r=this.threshold,o=this.s.length,s=Y.zeros(o,o);for(let t=0;t<o;t++)Math.abs(this.s[t])<=r?s.set(t,t,0):s.set(t,t,1/this.s[t]);let n=this.U,i=this.rightSingularVectors,a=i.mmul(s),h=i.rows,u=n.rows,l=Y.zeros(h,u);for(let t=0;t<h;t++)for(let e=0;e<u;e++){let r=0;for(let s=0;s<o;s++)r+=a.get(t,s)*n.get(e,s);l.set(t,e,r)}return l.mmul(e)}solveForDiagonal(t){return this.solve(Y.diag(t))}inverse(){let t=this.V,e=this.threshold,r=t.rows,o=t.columns,s=new Y(r,this.s.length);for(let n=0;n<r;n++)for(let r=0;r<o;r++)Math.abs(this.s[r])>e&&s.set(n,r,t.get(n,r)/this.s[r]);let n=this.U,i=n.rows,a=n.columns,h=new Y(r,i);for(let t=0;t<r;t++)for(let e=0;e<i;e++){let r=0;for(let o=0;o<a;o++)r+=s.get(t,o)*n.get(e,o);h.set(t,e,r)}return h}get condition(){return this.s[0]/this.s[Math.min(this.m,this.n)-1]}get norm2(){return this.s[0]}get rank(){let t=Math.max(this.m,this.n)*this.s[0]*Number.EPSILON,e=0,r=this.s;for(let o=0,s=r.length;o<s;o++)r[o]>t&&e++;return e}get diagonal(){return Array.from(this.s)}get threshold(){return Number.EPSILON/2*Math.max(this.m,this.n)*this.s[0]}get leftSingularVectors(){return this.U}get rightSingularVectors(){return this.V}get diagonalMatrix(){return Y.diag(this.s)}}var tt={center:[0,0],linkDistance:50},et=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"mds\\\",Object.assign(this.options,tt,t)}return t.prototype.execute=function(t,e){return this.genericMDSLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericMDSLayout(!0,t,e)},t.prototype.genericMDSLayout=function(t,e,r){var s=o(o({},this.options),r),n=s.center,i=void 0===n?[0,0]:n,a=s.linkDistance,h=void 0===a?50:a,u=s.layoutInvisibles,f=s.onLayoutEnd,g=e.getAllNodes(),m=e.getAllEdges();if(u||(g=g.filter((function(t){return t.data.visible||void 0===t.data.visible})),m=m.filter((function(t){return t.data.visible||void 0===t.data.visible}))),!g||0===g.length){var p={nodes:[],edges:m};return null==f||f(p),p}if(1===g.length){t&&e.mergeNodeData(g[0].id,{x:i[0],y:i[1]});var w={nodes:[o(o({},g[0]),{data:o(o({},g[0].data),{x:i[0],y:i[1]})})],edges:m};return null==f||f(w),w}var y=c({nodes:g,edges:m},!1),v=l(y);rt(v);var M=function(t,e){var r=[];return t.forEach((function(t){var o=[];t.forEach((function(t){o.push(t*e)})),r.push(o)})),r}(v,h),b=ot(M),E=[];b.forEach((function(t,e){var r=d(g[e]);r.data.x=t[0]+i[0],r.data.y=t[1]+i[1],E.push(r)})),t&&E.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var x={nodes:E,edges:m};return null==f||f(x),x},t}(),rt=function(t){var e=-999999;t.forEach((function(t){t.forEach((function(t){t!==1/0&&e<t&&(e=t)}))})),t.forEach((function(r,o){r.forEach((function(r,s){r===1/0&&(t[o][s]=e)}))}))},ot=function(t){var e=Y.mul(Y.pow(t,2),-.5),r=e.mean(\\\"row\\\"),o=e.mean(\\\"column\\\"),s=e.mean();e.add(s).subRowVector(r).subColumnVector(o);var n=new Z(e),i=Y.sqrt(n.diagonalMatrix).diagonal();return n.leftSingularVectors.toJSON().map((function(t){return Y.mul([t],[i]).toJSON()[0].splice(0,2)}))},st={iterations:10,height:10,width:10,speed:100,gravity:10,k:5},nt=function(t,e,r,o,s,n){e.forEach((function(i,a){r[a]={x:0,y:0},e.forEach((function(e,h){if(a!==h&&s[a]===s[h]){var u=i.x-e.x,l=i.y-e.y,c=Math.sqrt(u*u+l*l);if(0===c){c=1;var f=a>h?1:-1;u=.01*f,l=.01*f}if(c<n(t[a])/2+n(t[h])/2){var d=o*o/c;r[a].x+=u/c*d,r[a].y+=l/c*d}}}))}))},it=function(t,e,r,o,s,n,i,a){var h=n||i/10;return o&&e.forEach((function(e,r){var o=t[r].x-t[s].x,n=t[r].y-t[s].y,i=Math.sqrt(o*o+n*n),a=n/i,h=-o/i,u=Math.sqrt(e.x*e.x+e.y*e.y),l=Math.acos((a*e.x+h*e.y)/u);l>Math.PI/2&&(l-=Math.PI/2,a*=-1,h*=-1);var c=Math.cos(l)*u;e.x=a*c,e.y=h*c})),t.forEach((function(n,i){if(i!==s){var u=Math.sqrt(e[i].x*e[i].x+e[i].y*e[i].y);if(u>0&&i!==s){var l=Math.min(h*(r/800),u);if(n.x+=e[i].x/u*l,n.y+=e[i].y/u*l,o){var c=n.x-t[s].x,f=n.y-t[s].y,d=Math.sqrt(c*c+f*f);c=c/d*a[i],f=f/d*a[i],n.x=t[s].x+c,n.y=t[s].y+f}}}})),t},at={maxIteration:1e3,focusNode:null,unitRadius:null,linkDistance:50,preventOverlap:!1,nodeSize:void 0,nodeSpacing:void 0,strictRadial:!0,maxPreventOverlapIteration:200,sortBy:void 0,sortStrength:10},ht=function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"radial\\\",Object.assign(this.options,at,t)}return t.prototype.execute=function(t,e){return this.genericRadialLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericRadialLayout(!0,t,e)},t.prototype.genericRadialLayout=function(t,e,r){var a=o(o({},this.options),r),h=a.width,u=a.height,f=a.center,d=a.focusNode,g=a.unitRadius,m=a.nodeSize,p=a.nodeSpacing,w=a.strictRadial,y=a.preventOverlap,v=a.maxPreventOverlapIteration,M=a.sortBy,b=a.linkDistance,E=void 0===b?50:b,x=a.sortStrength,S=void 0===x?10:x,N=a.maxIteration,R=void 0===N?1e3:N,I=a.layoutInvisibles,k=a.onLayoutEnd,A=e.getAllNodes(),T=e.getAllEdges();if(I||(A=A.filter((function(t){return t.data.visible||void 0===t.data.visible})),T=T.filter((function(t){return t.data.visible||void 0===t.data.visible}))),!A||0===A.length){var D={nodes:[],edges:T};return null==k||k(D),D}var C=h||\\\"undefined\\\"==typeof window?h:window.innerWidth,z=u||\\\"undefined\\\"==typeof window?u:window.innerHeight,P=f||[C/2,z/2];if(1===A.length){t&&e.mergeNodeData(A[0].id,{x:P[0],y:P[1]});var V={nodes:[o(o({},A[0]),{data:o(o({},A[0].data),{x:P[0],y:P[1]})})],edges:T};return null==k||k(V),V}var q=A[0];if(i(d)){for(var j=0;j<A.length;j++)if(A[j].id===d){q=A[j];break}}else q=d||A[0];var O=ft(A,q.id),F=c({nodes:A,edges:T},!1),L=l(F),$=gt(L,O);dt(L,O,$+1);var U=L[O],B=C-P[0]>P[0]?P[0]:C-P[0],K=z-P[1]>P[1]?P[1]:z-P[1];0===B&&(B=C/2),0===K&&(K=z/2);var W=Math.min(B,K),J=Math.max.apply(Math,n([],s(U),!1)),_=[],G=g||W/J;U.forEach((function(t,e){_[e]=t*G}));var H,Q=ut(A,L,E,_,G,M,S),X=lt(Q),tt=function(t,e,r){try{var o=Y.mul(Y.pow(e,2),-.5),s=o.mean(\\\"row\\\"),n=o.mean(\\\"column\\\"),i=o.mean();o.add(i).subRowVector(s).subColumnVector(n);var a=new Z(o),h=Y.sqrt(a.diagonalMatrix).diagonal();return a.leftSingularVectors.toJSON().map((function(e){return Y.mul([e],[h]).toJSON()[0].splice(0,t)}))}catch(t){for(var u=[],l=0;l<e.length;l++){var c=Math.random()*r,f=Math.random()*r;u.push([c,f])}return u}}(E,Q,E).map((function(t){var e=s(t,2),r=e[0],o=e[1];return{x:(isNaN(r)?Math.random()*E:r)-tt[O].x,y:(isNaN(o)?Math.random()*E:o)-tt[O].y}}));if(this.run(R,tt,X,Q,_,O),y){H=mt(m,p);var et={nodes:A,nodeSizeFunc:H,positions:tt,radii:_,height:z,width:C,strictRadial:Boolean(w),focusIdx:O,iterations:v||200,k:tt.length/4.5};tt=function(t,e){for(var r=o(o({},st),e),s=r.positions,n=r.iterations,i=r.width,a=r.k,h=r.speed,u=void 0===h?100:h,l=r.strictRadial,c=r.focusIdx,f=r.radii,d=void 0===f?[]:f,g=r.nodeSizeFunc,m=t.getAllNodes(),p=[],w=i/10,y=0;y<n;y++)s.forEach((function(t,e){p[e]={x:0,y:0}})),nt(m,s,p,a,d,g),it(s,p,u,l,c,w,i,d);return s}(e,et)}var rt=[];tt.forEach((function(t,e){rt.push(o(o({},A[e]),{data:o(o({},A[0].data),{x:t.x+P[0],y:t.y+P[1]})}))})),t&&rt.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var ot={nodes:rt,edges:T};return null==k||k(ot),ot},t.prototype.run=function(t,e,r,o,s,n){for(var i=0;i<=t;i++){var a=i/t;this.oneIteration(a,e,s,o,r,n)}},t.prototype.oneIteration=function(t,e,r,o,s,n){var i=1-t;e.forEach((function(a,h){var u=ct(a,{x:0,y:0}),l=0===u?0:1/u;if(h!==n){var c=0,f=0,d=0;e.forEach((function(t,e){if(h!==e){var r=ct(a,t),n=0===r?0:1/r,i=o[e][h];d+=s[h][e],c+=s[h][e]*(t.x+i*(a.x-t.x)*n),f+=s[h][e]*(t.y+i*(a.y-t.y)*n)}}));var g=0===r[h]?0:1/r[h];d*=i,d+=t*g*g,c*=i,c+=t*g*a.x*l,a.x=c/d,f*=i,f+=t*g*a.y*l,a.y=f/d}}))},t}(),ut=function(t,e,r,o,s,n,a){if(!t)return[];var h=[];return e&&e.forEach((function(e,u){var l=[];e.forEach((function(e,h){if(u===h)l.push(0);else if(o[u]===o[h])if(\\\"data\\\"===n)l.push(e*(Math.abs(u-h)*a)/(o[u]/s));else if(n){var c=t[u][n]||0,f=t[h][n]||0;i(c)&&(c=c.charCodeAt(0)),i(f)&&(f=f.charCodeAt(0)),l.push(e*(Math.abs(c-f)*a)/(o[u]/s))}else l.push(e*r/(o[u]/s));else{var d=(r+s)/2;l.push(e*d)}})),h.push(l)})),h},lt=function(t){for(var e=t.length,r=t[0].length,o=[],s=0;s<e;s++){for(var n=[],i=0;i<r;i++)0!==t[s][i]?n.push(1/(t[s][i]*t[s][i])):n.push(0);o.push(n)}return o},ct=function(t,e){return Math.sqrt((t.x-e.x)*(t.x-e.x)+(t.y-e.y)*(t.y-e.y))},ft=function(t,e){var r=-1;return t.forEach((function(t,o){t.id===e&&(r=o)})),Math.max(r,0)},dt=function(t,e,r){for(var o=t.length,s=0;s<o;s++)if(t[e][s]===1/0){t[e][s]=r,t[s][e]=r;for(var n=0;n<o;n++)t[s][n]!==1/0&&t[e][n]===1/0&&(t[e][n]=r+t[s][n],t[n][e]=r+t[s][n])}for(s=0;s<o;s++)if(s!==e)for(n=0;n<o;n++)if(t[s][n]===1/0){var i=Math.abs(t[e][s]-t[e][n]);i=0===i?1:i,t[s][n]=i}},gt=function(t,e){for(var r=0,o=0;o<t[e].length;o++)t[e][o]!==1/0&&(r=t[e][o]>r?t[e][o]:r);return r},mt=function(t,e){var r;return r=u(e)?function(){return e}:g(e)?e:function(){return 0},t?h(t)?function(e){return(t[0]>t[1]?t[0]:t[1])+r(e)}:function(e){return t+r(e)}:function(t){return t.data.bboxSize?Math.max(t.data.bboxSize[0],t.data.bboxSize[1])+r(t):t.data.size?h(t.data.size)?Math.max(t.data.size[0],t.data.size[1])+r(t):f(t.data.size)?(t.data.size.width>t.data.size.height?t.data.size.width:t.data.size.height)+r(t):t.data.size+r(t):10+r(t)}},pt={center:[0,0],width:300,height:300},wt={circular:w,concentric:b,mds:et,random:function(){function t(t){void 0===t&&(t={}),this.options=t,this.id=\\\"random\\\",Object.assign(this.options,pt,t)}return t.prototype.execute=function(t,e){return this.genericRandomLayout(!1,t,e)},t.prototype.assign=function(t,e){this.genericRandomLayout(!0,t,e)},t.prototype.genericRandomLayout=function(t,e,r){var s=o(o({},this.options),r),n=s.center,i=s.width,a=s.height,h=s.layoutInvisibles,u=s.onLayoutEnd,l=e.getAllNodes();h||(l=l.filter((function(t){return t.data.visible||void 0===t.data.visible})));var c=i||\\\"undefined\\\"==typeof window?i:window.innerWidth,f=a||\\\"undefined\\\"==typeof window?a:window.innerHeight,d=n||[c/2,f/2],g=[];l&&l.forEach((function(t){g.push({id:t.id,data:{x:.9*(Math.random()-.5)*c+d[0],y:.9*(Math.random()-.5)*f+d[1]}})})),t&&g.forEach((function(t){return e.mergeNodeData(t.id,{x:t.data.x,y:t.data.y})}));var m={nodes:g,edges:e.getAllEdges()};return null==u||u(m),m},t}(),grid:x,radial:ht};function yt(t,e){var o=t.layout,s=o.id,n=o.options,i=t.nodes,a=t.edges,h=new r({nodes:i,edges:a}),u=wt[s];if(!u)throw new Error(\\\"Unknown layout id: \\\"+s);return[new u(n).execute(h),e]}addEventListener(\\\"message\\\",(function(t){var r,o=t.data,s=o.type,n=o.method,i=o.id,a=o.params;\\\"RPC\\\"===s&&n&&((r=e[n])?Promise.resolve().then((function(){return r.apply(e,a)})):Promise.reject(\\\"No such method\\\")).then((function(t){postMessage({type:\\\"RPC\\\",id:i,result:t})})).catch((function(t){var e={message:t};t.stack&&(e.message=t.message,e.stack=t.stack,e.name=t.name),postMessage({type:\\\"RPC\\\",id:i,error:e})}))})),postMessage({type:\\\"RPC\\\",method:\\\"ready\\\"})})();\\n//# sourceMappingURL=03710bc99fe066d705cb.worker.js.map\"])));\n\t\t\t\t\taddMethods(w, methods)\n\t\t\t\t\t\n\t\t\t\t\treturn w\n\t\t\t\t}\n\t\t\t","function addMethods(worker, methods) {\n  var c = 0;\n  var callbacks = {};\n  worker.addEventListener('message', function (e) {\n    var d = e.data;\n    if (d.type !== 'RPC') return;\n\n    if (d.id) {\n      var f = callbacks[d.id];\n\n      if (f) {\n        delete callbacks[d.id];\n\n        if (d.error) {\n          f[1](Object.assign(Error(d.error.message), d.error));\n        } else {\n          f[0](d.result);\n        }\n      }\n    } else {\n      var evt = document.createEvent('Event');\n      evt.initEvent(d.method, false, false);\n      evt.data = d.params;\n      worker.dispatchEvent(evt);\n    }\n  });\n  methods.forEach(function (method) {\n    worker[method] = function () {\n      var _arguments = arguments;\n      return new Promise(function (a, b) {\n        var id = ++c;\n        callbacks[id] = [a, b];\n        worker.postMessage({\n          type: 'RPC',\n          id: id,\n          method: method,\n          params: [].slice.call(_arguments)\n        });\n      });\n    };\n  });\n}\n\nmodule.exports = addMethods;\n//# sourceMappingURL=rpc-wrapper.js.map\n","// The module cache\nvar __webpack_module_cache__ = {};\n\n// The require function\nfunction __webpack_require__(moduleId) {\n\t// Check if module is in cache\n\tvar cachedModule = __webpack_module_cache__[moduleId];\n\tif (cachedModule !== undefined) {\n\t\treturn cachedModule.exports;\n\t}\n\t// Create a new module (and put it into the cache)\n\tvar module = __webpack_module_cache__[moduleId] = {\n\t\t// no module.id needed\n\t\t// no module.loaded needed\n\t\texports: {}\n\t};\n\n\t// Execute the module function\n\t__webpack_modules__[moduleId](module, module.exports, __webpack_require__);\n\n\t// Return the exports of the module\n\treturn module.exports;\n}\n\n","// getDefaultExport function for compatibility with non-harmony modules\n__webpack_require__.n = (module) => {\n\tvar getter = module && module.__esModule ?\n\t\t() => (module['default']) :\n\t\t() => (module);\n\t__webpack_require__.d(getter, { a: getter });\n\treturn getter;\n};","// define getter functions for harmony exports\n__webpack_require__.d = (exports, definition) => {\n\tfor(var key in definition) {\n\t\tif(__webpack_require__.o(definition, key) && !__webpack_require__.o(exports, key)) {\n\t\t\tObject.defineProperty(exports, key, { enumerable: true, get: definition[key] });\n\t\t}\n\t}\n};","__webpack_require__.o = (obj, prop) => (Object.prototype.hasOwnProperty.call(obj, prop))","// define __esModule on exports\n__webpack_require__.r = (exports) => {\n\tif(typeof Symbol !== 'undefined' && Symbol.toStringTag) {\n\t\tObject.defineProperty(exports, Symbol.toStringTag, { value: 'Module' });\n\t}\n\tObject.defineProperty(exports, '__esModule', { value: true });\n};","/******************************************************************************\r\nCopyright (c) Microsoft Corporation.\r\n\r\nPermission to use, copy, modify, and/or distribute this software for any\r\npurpose with or without fee is hereby granted.\r\n\r\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\r\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\r\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\r\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\r\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\r\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\r\nPERFORMANCE OF THIS SOFTWARE.\r\n***************************************************************************** */\r\n/* global Reflect, Promise */\r\n\r\nvar extendStatics = function(d, b) {\r\n    extendStatics = Object.setPrototypeOf ||\r\n        ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\r\n        function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\r\n    return extendStatics(d, b);\r\n};\r\n\r\nexport function __extends(d, b) {\r\n    if (typeof b !== \"function\" && b !== null)\r\n        throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\r\n    extendStatics(d, b);\r\n    function __() { this.constructor = d; }\r\n    d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\r\n}\r\n\r\nexport var __assign = function() {\r\n    __assign = Object.assign || function __assign(t) {\r\n        for (var s, i = 1, n = arguments.length; i < n; i++) {\r\n            s = arguments[i];\r\n            for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\r\n        }\r\n        return t;\r\n    }\r\n    return __assign.apply(this, arguments);\r\n}\r\n\r\nexport function __rest(s, e) {\r\n    var t = {};\r\n    for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\r\n        t[p] = s[p];\r\n    if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\r\n        for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\r\n            if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\r\n                t[p[i]] = s[p[i]];\r\n        }\r\n    return t;\r\n}\r\n\r\nexport function __decorate(decorators, target, key, desc) {\r\n    var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\r\n    if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\r\n    else for (var i = decorators.length - 1; i >= 0; i--) if (d = decorators[i]) r = (c < 3 ? d(r) : c > 3 ? d(target, key, r) : d(target, key)) || r;\r\n    return c > 3 && r && Object.defineProperty(target, key, r), r;\r\n}\r\n\r\nexport function __param(paramIndex, decorator) {\r\n    return function (target, key) { decorator(target, key, paramIndex); }\r\n}\r\n\r\nexport function __metadata(metadataKey, metadataValue) {\r\n    if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\r\n}\r\n\r\nexport function __awaiter(thisArg, _arguments, P, generator) {\r\n    function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\r\n    return new (P || (P = Promise))(function (resolve, reject) {\r\n        function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\r\n        function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\r\n        function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\r\n        step((generator = generator.apply(thisArg, _arguments || [])).next());\r\n    });\r\n}\r\n\r\nexport function __generator(thisArg, body) {\r\n    var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\r\n    return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\r\n    function verb(n) { return function (v) { return step([n, v]); }; }\r\n    function step(op) {\r\n        if (f) throw new TypeError(\"Generator is already executing.\");\r\n        while (g && (g = 0, op[0] && (_ = 0)), _) try {\r\n            if (f = 1, y && (t = op[0] & 2 ? y[\"return\"] : op[0] ? y[\"throw\"] || ((t = y[\"return\"]) && t.call(y), 0) : y.next) && !(t = t.call(y, op[1])).done) return t;\r\n            if (y = 0, t) op = [op[0] & 2, t.value];\r\n            switch (op[0]) {\r\n                case 0: case 1: t = op; break;\r\n                case 4: _.label++; return { value: op[1], done: false };\r\n                case 5: _.label++; y = op[1]; op = [0]; continue;\r\n                case 7: op = _.ops.pop(); _.trys.pop(); continue;\r\n                default:\r\n                    if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\r\n                    if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\r\n                    if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\r\n                    if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\r\n                    if (t[2]) _.ops.pop();\r\n                    _.trys.pop(); continue;\r\n            }\r\n            op = body.call(thisArg, _);\r\n        } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\r\n        if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\r\n    }\r\n}\r\n\r\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    var desc = Object.getOwnPropertyDescriptor(m, k);\r\n    if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\r\n        desc = { enumerable: true, get: function() { return m[k]; } };\r\n    }\r\n    Object.defineProperty(o, k2, desc);\r\n}) : (function(o, m, k, k2) {\r\n    if (k2 === undefined) k2 = k;\r\n    o[k2] = m[k];\r\n});\r\n\r\nexport function __exportStar(m, o) {\r\n    for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\r\n}\r\n\r\nexport function __values(o) {\r\n    var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\r\n    if (m) return m.call(o);\r\n    if (o && typeof o.length === \"number\") return {\r\n        next: function () {\r\n            if (o && i >= o.length) o = void 0;\r\n            return { value: o && o[i++], done: !o };\r\n        }\r\n    };\r\n    throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\r\n}\r\n\r\nexport function __read(o, n) {\r\n    var m = typeof Symbol === \"function\" && o[Symbol.iterator];\r\n    if (!m) return o;\r\n    var i = m.call(o), r, ar = [], e;\r\n    try {\r\n        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\r\n    }\r\n    catch (error) { e = { error: error }; }\r\n    finally {\r\n        try {\r\n            if (r && !r.done && (m = i[\"return\"])) m.call(i);\r\n        }\r\n        finally { if (e) throw e.error; }\r\n    }\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spread() {\r\n    for (var ar = [], i = 0; i < arguments.length; i++)\r\n        ar = ar.concat(__read(arguments[i]));\r\n    return ar;\r\n}\r\n\r\n/** @deprecated */\r\nexport function __spreadArrays() {\r\n    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\r\n    for (var r = Array(s), k = 0, i = 0; i < il; i++)\r\n        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\r\n            r[k] = a[j];\r\n    return r;\r\n}\r\n\r\nexport function __spreadArray(to, from, pack) {\r\n    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\r\n        if (ar || !(i in from)) {\r\n            if (!ar) ar = Array.prototype.slice.call(from, 0, i);\r\n            ar[i] = from[i];\r\n        }\r\n    }\r\n    return to.concat(ar || Array.prototype.slice.call(from));\r\n}\r\n\r\nexport function __await(v) {\r\n    return this instanceof __await ? (this.v = v, this) : new __await(v);\r\n}\r\n\r\nexport function __asyncGenerator(thisArg, _arguments, generator) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var g = generator.apply(thisArg, _arguments || []), i, q = [];\r\n    return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\r\n    function verb(n) { if (g[n]) i[n] = function (v) { return new Promise(function (a, b) { q.push([n, v, a, b]) > 1 || resume(n, v); }); }; }\r\n    function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\r\n    function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\r\n    function fulfill(value) { resume(\"next\", value); }\r\n    function reject(value) { resume(\"throw\", value); }\r\n    function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\r\n}\r\n\r\nexport function __asyncDelegator(o) {\r\n    var i, p;\r\n    return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\r\n    function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: n === \"return\" } : f ? f(v) : v; } : f; }\r\n}\r\n\r\nexport function __asyncValues(o) {\r\n    if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\r\n    var m = o[Symbol.asyncIterator], i;\r\n    return m ? m.call(o) : (o = typeof __values === \"function\" ? __values(o) : o[Symbol.iterator](), i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i);\r\n    function verb(n) { i[n] = o[n] && function (v) { return new Promise(function (resolve, reject) { v = o[n](v), settle(resolve, reject, v.done, v.value); }); }; }\r\n    function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\r\n}\r\n\r\nexport function __makeTemplateObject(cooked, raw) {\r\n    if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\r\n    return cooked;\r\n};\r\n\r\nvar __setModuleDefault = Object.create ? (function(o, v) {\r\n    Object.defineProperty(o, \"default\", { enumerable: true, value: v });\r\n}) : function(o, v) {\r\n    o[\"default\"] = v;\r\n};\r\n\r\nexport function __importStar(mod) {\r\n    if (mod && mod.__esModule) return mod;\r\n    var result = {};\r\n    if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\r\n    __setModuleDefault(result, mod);\r\n    return result;\r\n}\r\n\r\nexport function __importDefault(mod) {\r\n    return (mod && mod.__esModule) ? mod : { default: mod };\r\n}\r\n\r\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot read private member from an object whose class did not declare it\");\r\n    return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\r\n}\r\n\r\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\r\n    if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\r\n    if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\r\n    if (typeof state === \"function\" ? receiver !== state || !f : !state.has(receiver)) throw new TypeError(\"Cannot write private member to an object whose class did not declare it\");\r\n    return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\r\n}\r\n\r\nexport function __classPrivateFieldIn(state, receiver) {\r\n    if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\r\n    return typeof state === \"function\" ? receiver === state : state.has(receiver);\r\n}\r\n","export const isString = (val: unknown): val is string =>\n  typeof val === \"string\";\n\nconst cacheStringFunction = <T extends (str: string) => string>(fn: T): T => {\n  const cache: Record<string, string> = Object.create(null);\n  return ((str: string) => {\n    const hit = cache[str];\n    return hit || (cache[str] = fn(str));\n  }) as any;\n};\n\nconst camelizeRE = /-(\\w)/g;\nexport const camelize = cacheStringFunction((str: string): string => {\n  return str.replace(camelizeRE, (_, c) => (c ? c.toUpperCase() : \"\"));\n});\n\n// export const capitalize = cacheStringFunction(\n//   (str: string) => str.charAt(0).toUpperCase() + str.slice(1),\n// )\n","export const isArray = Array.isArray;\n","export const isNumber = (val: unknown): val is Number =>\n  typeof val === \"number\";\n\nexport const isNaN = (num: unknown) => Number.isNaN(Number(num));\n\nexport const toNumber = (val: any): any => {\n  const n = parseFloat(val);\n  return isNaN(n) ? val : n;\n};\n","import type {\n  Matrix,\n  IndexMap,\n  Edge,\n  Node,\n  OutNode,\n  Degree,\n} from \"../types\";\nimport { isArray } from \"./array\";\nimport { isNumber } from \"./number\";\n\nexport const getDegree = (\n  n: number,\n  nodeIdxMap: IndexMap,\n  edges: Edge[] | null\n) => {\n  const degrees: Degree[] = [];\n  for (let i = 0; i < n; i++) {\n    degrees[i] = {\n      in: 0,\n      out: 0,\n      all: 0,\n    };\n  }\n  if (!edges) return degrees;\n  edges.forEach((e) => {\n    const { source, target } = e;\n    if (source && degrees[nodeIdxMap[source]]) {\n      degrees[nodeIdxMap[source]].out += 1;\n      degrees[nodeIdxMap[source]].all += 1;\n    }\n    if (target && degrees[nodeIdxMap[target]]) {\n      degrees[nodeIdxMap[target]].in += 1;\n      degrees[nodeIdxMap[target]].all += 1;\n    }\n  });\n  return degrees;\n};\n\nexport const getDegreeMap = (nodes: Node[], edges: Edge[] | null) => {\n  const degreesMap: { [id: string]: Degree } = {};\n  nodes.forEach((node) => {\n    degreesMap[node.id] = {\n      in: 0,\n      out: 0,\n      all: 0,\n    };\n  });\n\n  if (!edges) return degreesMap;\n  edges.forEach((e) => {\n    const { source, target } = e;\n    if (source) {\n      degreesMap[source].out += 1;\n      degreesMap[source].all += 1;\n    }\n    if (target) {\n      degreesMap[target].in += 1;\n      degreesMap[target].all += 1;\n    }\n  });\n  return degreesMap;\n};\n\nexport const floydWarshall = (adjMatrix: Matrix[]): Matrix[] => {\n  // initialize\n  const dist: Matrix[] = [];\n  const size = adjMatrix.length;\n  for (let i = 0; i < size; i += 1) {\n    dist[i] = [];\n    for (let j = 0; j < size; j += 1) {\n      if (i === j) {\n        dist[i][j] = 0;\n      } else if (adjMatrix[i][j] === 0 || !adjMatrix[i][j]) {\n        dist[i][j] = Infinity;\n      } else {\n        dist[i][j] = adjMatrix[i][j];\n      }\n    }\n  }\n  // floyd\n  for (let k = 0; k < size; k += 1) {\n    for (let i = 0; i < size; i += 1) {\n      for (let j = 0; j < size; j += 1) {\n        if (dist[i][j] > dist[i][k] + dist[k][j]) {\n          dist[i][j] = dist[i][k] + dist[k][j];\n        }\n      }\n    }\n  }\n  return dist;\n};\n\nexport const getAdjMatrix = (data: { nodes: Node[]; edges: Edge[] }, directed: boolean): Matrix[] => {\n  const { nodes, edges } = data;\n  const matrix: Matrix[] = [];\n  // map node with index in data.nodes\n  const nodeMap: {\n    [key: string]: number;\n  } = {};\n\n  if (!nodes) {\n    throw new Error(\"invalid nodes data!\");\n  }\n  if (nodes) {\n    nodes.forEach((node, i) => {\n      nodeMap[node.id] = i;\n      const row: number[] = [];\n      matrix.push(row);\n    });\n  }\n\n  edges?.forEach((e) => {\n    const { source, target } = e;\n    const sIndex = nodeMap[source as string];\n    const tIndex = nodeMap[target as string];\n    if (sIndex === undefined || tIndex === undefined) return;\n    matrix[sIndex][tIndex] = 1;\n    if (!directed) {\n      matrix[tIndex][sIndex] = 1;\n    }\n  });\n  return matrix;\n};\n\n/**\n * scale matrix\n * @param matrix [ [], [], [] ]\n * @param ratio\n */\nexport const scaleMatrix = (matrix: Matrix[], ratio: number) => {\n  const result: Matrix[] = [];\n  matrix.forEach((row) => {\n    const newRow: number[] = [];\n    row.forEach((v) => {\n      newRow.push(v * ratio);\n    });\n    result.push(newRow);\n  });\n  return result;\n};\n\n/**\n * depth first traverse, from leaves to root, children in inverse order\n *  if the fn returns false, terminate the traverse\n */\nconst traverseUp = <T extends { children?: T[] }>(\n  data: T,\n  fn: (param: T) => boolean\n) => {\n  if (data && data.children) {\n    for (let i = data.children.length - 1; i >= 0; i--) {\n      if (!traverseUp(data.children[i], fn)) return;\n    }\n  }\n\n  if (!fn(data)) {\n    return false;\n  }\n  return true;\n};\n\n/**\n * depth first traverse, from leaves to root, children in inverse order\n * if the fn returns false, terminate the traverse\n */\nexport const traverseTreeUp = <T extends { children?: T[] }>(\n  data: T,\n  fn: (param: T) => boolean\n) => {\n  if (typeof fn !== \"function\") {\n    return;\n  }\n  traverseUp(data, fn);\n};\n\n/**\n * calculate the bounding box for the nodes according to their x, y, and size\n * @param nodes nodes in the layout\n * @returns\n */\nexport const getLayoutBBox = (nodes: OutNode[]) => {\n  let minX = Infinity;\n  let minY = Infinity;\n  let maxX = -Infinity;\n  let maxY = -Infinity;\n  nodes.forEach((node) => {\n    let size = node.data.size;\n    if (isArray(size)) {\n      if (size.length === 1) size = [size[0], size[0]];\n    } else if (isNumber(size)) {\n      size = [size, size];\n    } else if (size === undefined || isNaN(size as any)) {\n      size = [30, 30];\n    }\n\n    const halfSize = [size[0] / 2, size[1] / 2];\n    const left = node.data.x - halfSize[0];\n    const right = node.data.x + halfSize[0];\n    const top = node.data.y - halfSize[1];\n    const bottom = node.data.y + halfSize[1];\n\n    if (minX > left) minX = left;\n    if (minY > top) minY = top;\n    if (maxX < right) maxX = right;\n    if (maxY < bottom) maxY = bottom;\n  });\n  return { minX, minY, maxX, maxY };\n};\n\n/**\n * 获取节点集合的平均位置信息\n * @param nodes 节点集合\n * @returns 平局内置\n */\nexport const getAvgNodePosition = (nodes: OutNode[]) => {\n  const totalNodes = { x: 0, y: 0 };\n  nodes.forEach((node) => {\n    totalNodes.x += node.data.x || 0;\n    totalNodes.y += node.data.y || 0;\n  });\n  // 获取均值向量\n  const length = nodes.length || 1;\n  return {\n    x: totalNodes.x / length,\n    y: totalNodes.y / length,\n  };\n};\n\n// 找出指定节点关联的边的起点或终点\nconst getCoreNode = (type: \"source\" | \"target\", node: Node, edges: Edge[]) => {\n  if (type === \"source\") {\n    return (edges?.find((edge) => edge.target === node.id)?.source ||\n      {}) as Node;\n  }\n  return (edges?.find((edge) => edge.source === node.id)?.target || {}) as Node;\n};\n\n// 找出指定节点为起点或终点的所有一度叶子节点\nconst getRelativeNodeIds = (\n  type: \"source\" | \"target\" | \"both\",\n  coreNode: Node,\n  edges: Edge[]\n) => {\n  let relativeNodes: (string | number)[] = [];\n  switch (type) {\n    case \"source\":\n      relativeNodes = edges\n        ?.filter((edge) => edge.source === coreNode.id)\n        .map((edge) => edge.target);\n      break;\n    case \"target\":\n      relativeNodes = edges\n        ?.filter((edge) => edge.target === coreNode.id)\n        .map((edge) => edge.source);\n      break;\n    case \"both\":\n      relativeNodes = edges\n        ?.filter((edge) => edge.source === coreNode.id)\n        .map((edge) => edge.target)\n        .concat(\n          edges\n            ?.filter((edge) => edge.target === coreNode.id)\n            .map((edge) => edge.source)\n        );\n      break;\n    default:\n      break;\n  }\n  // 去重\n  const set = new Set(relativeNodes);\n  return Array.from(set);\n};\n// 找出同类型的节点\nconst getSameTypeNodes = (\n  type: \"leaf\" | \"all\",\n  nodeClusterBy: string,\n  node: Node,\n  relativeNodes: Node[],\n  degreesMap: { [id: string]: Degree }\n) => {\n  const typeName = node[nodeClusterBy as keyof Node] || \"\";\n  let sameTypeNodes =\n    relativeNodes?.filter((item) => item[nodeClusterBy as keyof Node] === typeName) || [];\n  if (type === \"leaf\") {\n    sameTypeNodes = sameTypeNodes.filter(\n      (node) => degreesMap[node.id]?.in === 0 || degreesMap[node.id]?.out === 0\n    );\n  }\n  return sameTypeNodes;\n};\n\n// 找出与指定节点关联的边的起点或终点出发的所有一度叶子节点\nexport const getCoreNodeAndRelativeLeafNodes = (\n  type: \"leaf\" | \"all\",\n  node: Node,\n  edges: Edge[],\n  nodeClusterBy: string,\n  degreesMap: { [id: string]: Degree },\n  nodeMap: { [id: string]: Node }\n) => {\n  const { in: inDegree, out: outDegree } = degreesMap[node.id];\n  let coreNode: Node = node;\n  let relativeLeafNodes: Node[] = [];\n  if (inDegree === 0) {\n    // 如果为没有出边的叶子节点，则找出与它关联的边的起点出发的所有一度节点\n    coreNode = getCoreNode(\"source\", node, edges);\n    relativeLeafNodes = getRelativeNodeIds(\"both\", coreNode, edges).map(\n      (nodeId) => nodeMap[nodeId]\n    );\n  } else if (outDegree === 0) {\n    // 如果为没有入边边的叶子节点，则找出与它关联的边的起点出发的所有一度节点\n    coreNode = getCoreNode(\"target\", node, edges);\n    relativeLeafNodes = getRelativeNodeIds(\"both\", coreNode, edges).map(\n      (nodeId) => nodeMap[nodeId]\n    );\n  }\n  relativeLeafNodes = relativeLeafNodes.filter(\n    (node) =>\n      degreesMap[node.id] &&\n      (degreesMap[node.id].in === 0 || degreesMap[node.id].out === 0)\n  );\n  const sameTypeLeafNodes = getSameTypeNodes(\n    type,\n    nodeClusterBy,\n    node,\n    relativeLeafNodes,\n    degreesMap\n  );\n  return { coreNode, relativeLeafNodes, sameTypeLeafNodes };\n};\n","export const isObject = (val: unknown): val is Record<any, any> =>\n  val !== null && typeof val === \"object\";\n\nexport const clone = <T>(target: T): T => {\n  if (target === null) {\n    return target;\n  }\n  if (target instanceof Date) {\n    return new Date(target.getTime()) as any;\n  }\n  if (target instanceof Array) {\n    const cp = [] as any[];\n    (target as any[]).forEach((v) => {\n      cp.push(v);\n    });\n    return cp.map((n: any) => clone<any>(n)) as any;\n  }\n  if (typeof target === \"object\" && Object.keys(target).length) {\n    const cp = { ...(target as { [key: string]: any }) } as {\n      [key: string]: any;\n    };\n    Object.keys(cp).forEach((k) => {\n      cp[k] = clone<any>(cp[k]);\n    });\n    return cp as T;\n  }\n  return target;\n};\n","import { isArray, isObject } from \".\";\nimport { isNumber } from \"./number\";\n\nexport const isFunction = (val: unknown): val is Function =>\n  typeof val === \"function\";\n\nexport const getFunc = (\n  value: number,\n  defaultValue: number,\n  func?: ((d?: any) => number) | undefined\n): Function => {\n  let resultFunc;\n  if (func) {\n    resultFunc = func;\n  } else if (isNumber(value)) {\n    resultFunc = () => value;\n  } else {\n    resultFunc = () => defaultValue;\n  }\n  return resultFunc;\n};\n\nexport const getFuncByUnknownType = (\n  defaultValue: number,\n  value?:\n    | number\n    | number[]\n    | { width: number; height: number }\n    | ((d?: any) => number)\n    | undefined,\n  resultIsNumber: boolean = true\n): ((d?: any) => number | number[]) => {\n  if (!value && value !== 0) {\n    return (d) => {\n      if (d.size) {\n        if (isArray(d.size))\n          return d.size[0] > d.size[1] ? d.size[0] : d.size[1];\n        if (isObject(d.size))\n          return d.size.width > d.size.height ? d.size.width : d.size.height;\n        return d.size;\n      }\n      return defaultValue;\n    };\n  }\n  if (isFunction(value)) {\n    return value;\n  }\n  if (isNumber(value)) {\n    return () => value;\n  }\n  if (isArray(value)) {\n    return () => {\n      if (resultIsNumber) {\n        const max = Math.max(...(value as number[]));\n        return isNaN(max) ? defaultValue : max;\n      }\n      return value;\n    };\n  }\n  if (isObject(value)) {\n    return () => {\n      if (resultIsNumber) {\n        const max = Math.max(value.width, value.height);\n        return isNaN(max) ? defaultValue : max;\n      }\n      return [value.width, value.height];\n    };\n  }\n  return () => defaultValue;\n};\n","import type { Graph, CircularLayoutOptions, SyncLayout, LayoutMapping, PointTuple, OutNode, Node } from \"./types\";\nimport { getFuncByUnknownType, clone } from \"./util\";\n\n// TODO: graph getDegree, getNeighbors, getSuccessors considering the hidden nodes according to layoutInvisible\n\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<CircularLayoutOptions> = {\n  radius: null,\n  startRadius: null,\n  endRadius: null,\n  startAngle: 0,\n  endAngle: 2 * Math.PI,\n  clockwise: true,\n  divisions: 1,\n  ordering: null,\n  angleRatio: 1\n}\n\n/**\n * Layout arranging the nodes in a circle.\n * \n * @example\n * // Assign layout options when initialization.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = layout.execute(graph); // { nodes: [], edges: [] }\n * \n * // Or use different options later.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }\n * \n * // If you want to assign the positions directly to the nodes, use assign method.\n * layout.assign(graph, { radius: 20 });\n */\nexport class CircularLayout implements SyncLayout<CircularLayoutOptions> {\n  id = 'circular';\n\n  constructor(public options: CircularLayoutOptions = {} as CircularLayoutOptions) {\n    this.options = {\n      ...DEFAULTS_LAYOUT_OPTIONS,\n      ...options\n    };\n  }\n\n  /**\n   * Return the positions of nodes and edges(if needed).\n   */\n  execute(graph: Graph, options?: CircularLayoutOptions): LayoutMapping {\n    return this.genericCircularLayout(false, graph, options) as LayoutMapping;\n  }\n\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  assign(graph: Graph, options?: CircularLayoutOptions) {\n    graph.batch(() => {\n      this.genericCircularLayout(true, graph, options);\n    });\n  }\n\n  private genericCircularLayout(assign: boolean, graph: Graph, options?: CircularLayoutOptions): LayoutMapping | void {\n    const mergedOptions = { ...this.options, ...options };\n    const { width, height, center, divisions, startAngle = 0, endAngle = 2 * Math.PI, angleRatio, ordering, clockwise, nodeSpacing: paramNodeSpacing, nodeSize: paramNodeSize, layoutInvisibles, onLayoutEnd } = mergedOptions;\n\n    let nodes = graph.getAllNodes();\n    let edges = graph.getAllEdges();\n\n    if (!layoutInvisibles) {\n      nodes = nodes.filter(node => node.data.visible || node.data.visible === undefined);\n      edges = edges.filter(edge => edge.data.visible || edge.data.visible === undefined);\n    }\n    const n = nodes.length;\n\n    // Need no layout if there is no node.\n    if (n === 0) {\n      onLayoutEnd?.({\n        nodes: [],\n        edges: [],\n      });\n      return {\n        nodes: [],\n        edges: [],\n      };\n    }\n\n    // Calculate center according to `window` if not provided.\n    const [calculatedWidth, calculatedHeight, calculatedCenter] = calculateCenter(width, height, center);\n\n    // Layout easily if there is only one node.\n    if (n === 1) {\n      if (assign) {\n        graph.mergeNodeData(nodes[0].id, {\n            x: calculatedCenter[0],\n            y: calculatedCenter[1],\n        });\n      }\n      const result = {\n        nodes: [\n          {\n            ...nodes[0],\n            data: {\n              ...nodes[0].data,\n              x: calculatedCenter[0],\n              y: calculatedCenter[1],\n            }\n          }\n        ],\n        edges,\n      }\n      onLayoutEnd?.(result);\n      return result;\n    }\n\n    const angleStep = (endAngle - startAngle) / n;\n\n    let { radius, startRadius, endRadius } = mergedOptions;\n    if (paramNodeSpacing) {\n      const nodeSpacing: Function = getFuncByUnknownType(10, paramNodeSpacing);\n      const nodeSize: Function = getFuncByUnknownType(10, paramNodeSize);\n      let maxNodeSize = -Infinity;\n      nodes.forEach((node) => {\n        const nSize = nodeSize(node);\n        if (maxNodeSize < nSize) maxNodeSize = nSize;\n      });\n      let perimeter = 0;\n      nodes.forEach((node, i) => {\n        if (i === 0) perimeter += (maxNodeSize || 10);\n        else perimeter += (nodeSpacing(node) || 0) + (maxNodeSize || 10);\n      });\n      radius = perimeter / (2 * Math.PI);\n    } else if (!radius && !startRadius && !endRadius) {\n      radius = Math.min(calculatedHeight, calculatedWidth) / 2;\n    } else if (!startRadius && endRadius) {\n      startRadius = endRadius;\n    } else if (startRadius && !endRadius) {\n      endRadius = startRadius;\n    }\n    const astep = angleStep * angleRatio!;\n\n    // calculated nodes as temporary result\n    let layoutNodes: OutNode[] = [];\n    if (ordering === \"topology\") {\n      // layout according to the topology\n      layoutNodes = topologyOrdering(graph, nodes);\n    } else if (ordering === \"topology-directed\") {\n      // layout according to the topology\n      layoutNodes = topologyOrdering(graph, nodes, true);\n    } else if (ordering === \"degree\") {\n      // layout according to the descent order of degrees\n      layoutNodes = degreeOrdering(graph, nodes);\n    } else {\n      // layout according to the original order in the data.nodes\n      layoutNodes = nodes.map(node => clone(node) as OutNode);\n    }\n\n    const divN = Math.ceil(n / divisions!); // node number in each division\n    for (let i = 0; i < n; ++i) {\n      let r = radius;\n      if (!r && startRadius !== null && endRadius !== null) {\n        r = startRadius! + (i * (endRadius! - startRadius!)) / (n - 1);\n      }\n      if (!r) {\n        r = 10 + (i * 100) / (n - 1);\n      }\n      let angle =\n        startAngle +\n        (i % divN) * astep +\n        ((2 * Math.PI) / divisions!) * Math.floor(i / divN);\n      if (!clockwise) {\n        angle =\n          endAngle -\n          (i % divN) * astep -\n          ((2 * Math.PI) / divisions!) * Math.floor(i / divN);\n      }\n      layoutNodes[i].data.x = calculatedCenter[0] + Math.cos(angle) * r;\n      layoutNodes[i].data.y = calculatedCenter[1] + Math.sin(angle) * r;\n    }\n\n    if (assign) {\n      layoutNodes.forEach((node) => {\n        graph.mergeNodeData(node.id, {\n          x: node.data.x,\n          y: node.data.y,\n        });\n      });\n    }\n\n    const result = {\n      nodes: layoutNodes,\n      edges\n    }\n    onLayoutEnd?.(result);\n\n    return result;\n  }\n}\n\n/**\n * order the nodes acoording to the graph topology\n * @param graph \n * @param nodes \n * @param directed \n * @returns \n */\nconst topologyOrdering = (\n  graph: Graph,\n  nodes: Node[],\n  directed: boolean = false\n) => {\n  const orderedCNodes: OutNode[] = [clone(nodes[0]) as OutNode];\n  const pickFlags: { [id: string]: boolean } = {};\n  const n = nodes.length;\n  pickFlags[nodes[0].id] = true;\n  // write children into cnodes\n  let k = 0;\n  nodes.forEach((node, i) => {\n    if (i !== 0) {\n      if (\n        (i === n - 1 ||\n          graph.getDegree(node.id, 'both') !== graph.getDegree(nodes[i + 1].id, 'both') ||\n          graph.areNeighbors(orderedCNodes[k].id, node.id)\n        ) &&\n        !pickFlags[node.id]\n      ) {\n        orderedCNodes.push(clone(node) as OutNode);\n        pickFlags[node.id] = true;\n        k++;\n      } else {\n        const children = directed ? graph.getSuccessors(orderedCNodes[k].id) : graph.getNeighbors(orderedCNodes[k].id);\n        let foundChild = false;\n        for (let j = 0; j < children.length; j++) {\n          const child = children[j];\n          if (graph.getDegree(child.id) === graph.getDegree(node.id) && !pickFlags[child.id]) {\n            orderedCNodes.push(clone(child) as OutNode);\n            pickFlags[child.id] = true;\n            foundChild = true;\n            break;\n          }\n        }\n        let ii = 0;\n        while (!foundChild) {\n          if (!pickFlags[nodes[ii].id]) {\n            orderedCNodes.push(clone(nodes[ii]) as OutNode);\n            pickFlags[nodes[ii].id] = true;\n            foundChild = true;\n          }\n          ii++;\n          if (ii === n) {\n            break;\n          }\n        }\n      }\n    }\n  });\n  return orderedCNodes;\n}\n\n/**\n * order the nodes according to their degree\n * @param graph \n * @param nodes \n * @returns \n */\nfunction degreeOrdering(\n  graph: Graph,\n  nodes: Node[],\n): OutNode[] {\n  const orderedNodes: OutNode[] = [];\n  nodes.forEach((node, i) => {\n    orderedNodes.push(clone(node) as OutNode);\n  });\n  orderedNodes.sort((nodeA: Node, nodeB: Node) => (graph.getDegree(nodeA.id, 'both') - graph.getDegree(nodeB.id, 'both')));\n  return orderedNodes;\n}\n\n/**\n * format the invalide width and height, and get the center position \n * @param width \n * @param height \n * @param center \n * @returns \n */\nconst calculateCenter = (\n  width: number | undefined,\n  height: number | undefined,\n  center: PointTuple | undefined\n): [number, number, PointTuple] => {\n  let calculatedWidth = width;\n  let calculatedHeight = height;\n  let calculatedCenter = center;\n  if (!calculatedWidth && typeof window !== \"undefined\") {\n    calculatedWidth = window.innerWidth;\n  }\n  if (!calculatedHeight && typeof window !== \"undefined\") {\n    calculatedHeight = window.innerHeight;\n  }\n  if (!calculatedCenter) {\n    calculatedCenter = [calculatedWidth! / 2, calculatedHeight! / 2];\n  }\n  return [calculatedWidth!, calculatedHeight!, calculatedCenter];\n}","import EventEmitter from 'eventemitter3';\nimport { Graph, Node, Edge } from \"@antv/graphlib\";\nimport type { LayoutMapping, SyncLayout, LayoutSupervisor } from \"./types\";\n// @ts-ignore\n// Inline the worker as a Blob. @see https://github.com/developit/workerize-loader#inline\nimport worker from \"workerize-loader?inline!./worker\";\n// import { setupTransferableMethodsOnMain } from \"@naoak/workerize-transferable\";\n\n/**\n * The payload transferred from main thread to the worker.\n */\nexport interface Payload {\n  layout: {\n    id: string;\n    options: any;\n  };\n  nodes: Node<any>[];\n  edges: Edge<any>[];\n}\n\nexport const SupervisorEvent = {\n  /**\n   * Get triggerred when each iteration finished.\n   */\n  LAYOUT_ITERATION: 'tick',\n\n  /**\n   * Get triggerred when layout calculation is done.\n   */\n  LAYOUT_END: 'layoutend',\n};\n\n/**\n * @example\n * const graph = new Graph();\n * const layout = new CircularLayout();\n * \n * const supervisor = new Supervisor(graph, layout, { auto: true });\n * supervisor.start();\n * supervisor.stop();\n * supervisor.kill();\n * \n * // lifecycle\n * supervisor.on('tick', () => {\n * });\n * supervisor.on('layoutend', () => {\n * });\n * \n * // Re-layout when graph changed.\n * graph.addNodes([{ id: 'node1' }, { id: 'node2' }]);\n * \n * // TODO: Custom layout.\n */\nexport class Supervisor extends EventEmitter implements LayoutSupervisor {\n\n  /**\n   * Internal worker.\n   */\n  private worker: any;\n\n  /**\n   * Flag of running state.\n   */\n  private running: boolean;\n\n  constructor(\n    private graph: Graph<any, any>,\n    private layout: SyncLayout<any>, \n    options: {\n      auto: boolean; // 默认手动模式\n    }\n  ) {\n    super();\n\n    // TODO: listen to the graph-changed events.\n    // optional.\n    // forcelayout\n    // graph.onChanged = (e) => {\n    //   // node/edge added/dropped\n    // };\n\n    this.spawnWorker();\n  }\n\n  spawnWorker() {\n    if (this.worker) {\n      this.worker.terminate();\n    }\n\n    /**\n     * Worker function\n     */\n    // this.worker = this.createWorker(workerFunctionString);\n    // this.worker.addEventListener('message', this.handleWorkerMessage);\n\n    // Use workerize-loader to create WebWorker.\n    // @see https://github.com/developit/workerize-loader\n    this.worker = worker();\n\n    if (this.running) {\n      this.running = false;\n      this.start();\n    }\n  }\n\n  start() {\n    if (this.running) return this;\n\n    this.running = true;\n\n    // Payload should include nodes & edges(if needed).\n    const payload = {\n      layout: {\n        id: this.layout.id,\n        options: this.layout.options,\n      },\n      nodes: this.graph.getAllNodes(),\n      edges: this.graph.getAllEdges(),\n    };\n\n    /**\n     * TODO: Convert graph object to linear memory(e.g. csr, adjacency matrix), then transfer the ownership to worker.\n     * @example\n     * const arraybufferWithNodesEdges = graphToByteArrays(this.graph); // Float32Array\n     */\n    const arraybufferWithNodesEdges = new Float32Array([0]);\n\n    // TODO: Support transferables.\n    // @see https://www.npmjs.com/package/@naoak/workerize-transferable\n    // setupTransferableMethodsOnMain(this.worker, {\n    //   calculateLayout: {\n    //     // pick a transferable object from the method parameters\n    //     pickTransferablesFromParams: (params) => [params[1].buffer],\n    //   },\n    // });\n\n    this.worker.calculateLayout(payload, [arraybufferWithNodesEdges]).then(([positions, transferables]: [LayoutMapping, Float32Array[]]) => {\n      this.emit(SupervisorEvent.LAYOUT_END, positions);\n    });\n\n    return this;\n  }\n\n  stop() {\n    this.running = false;\n    return this;\n  }\n\n  kill() {\n    if (this.worker) {\n      this.worker.terminate();\n    }\n\n    // TODO: unbind listeners on graph.\n\n    // TODO: release attached memory\n  }\n\n  isRunning() {\n    return this.running;\n  }\n}\n","import type {\n  Graph,\n  Node,\n  LayoutMapping,\n  OutNode,\n  PointTuple,\n  ConcentricLayoutOptions,\n  SyncLayout,\n  IndexMap,\n} from \"./types\";\nimport {\n  clone,\n  isArray,\n  isFunction,\n  isNumber,\n  isObject,\n  isString,\n} from \"./util\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<ConcentricLayoutOptions> = {\n  nodeSize: 30,\n  minNodeSpacing: 10,\n  nodeSpacing: 10,\n  preventOverlap: false,\n  sweep: undefined,\n  equidistant: false,\n  startAngle: (3 / 2) * Math.PI,\n  clockwise: true,\n  maxLevelDiff: undefined,\n  sortBy: \"degree\",\n};\n\n/**\n * Layout arranging the nodes in concentrics\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new ConcentricLayout({ nodeSpacing: 10 });\n * const positions = layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new ConcentricLayout({ nodeSpacing: 10});\n * const positions = layout.execute(graph, { nodeSpacing: 10 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * layout.assign(graph, { nodeSpacing: 10 });\n */\nexport class ConcentricLayout implements SyncLayout<ConcentricLayoutOptions> {\n  id = \"concentric\";\n\n  constructor(\n    public options: ConcentricLayoutOptions = {} as ConcentricLayoutOptions\n  ) {\n    Object.assign(this.options, DEFAULTS_LAYOUT_OPTIONS, options);\n  }\n\n  /**\n   * Return the positions of nodes and edges(if needed).\n   */\n  execute(graph: Graph, options?: ConcentricLayoutOptions): LayoutMapping {\n    return this.genericConcentricLayout(false, graph, options) as LayoutMapping;\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  assign(graph: Graph, options?: ConcentricLayoutOptions) {\n    this.genericConcentricLayout(true, graph, options);\n  }\n\n  private genericConcentricLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: ConcentricLayoutOptions\n  ): LayoutMapping | void {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      center: propsCenter,\n      width: propsWidth,\n      height: propsHeight,\n      sortBy: propsSortBy,\n      maxLevelDiff: propsMaxLevelDiff,\n      sweep: propsSweep,\n      clockwise,\n      equidistant,\n      minNodeSpacing = 10,\n      preventOverlap,\n      startAngle = (3 / 2) * Math.PI,\n      nodeSize,\n      nodeSpacing,\n      layoutInvisibles,\n      onLayoutEnd,\n    } = mergedOptions;\n\n    let nodes = graph.getAllNodes();\n    let edges = graph.getAllEdges();\n\n    if (!layoutInvisibles) {\n      nodes = nodes.filter(\n        (node) => node.data.visible || node.data.visible === undefined\n      );\n      edges = edges.filter(\n        (edge) => edge.data.visible || edge.data.visible === undefined\n      );\n    }\n\n    const n = nodes.length;\n    if (n === 0) {\n      const result = { nodes: [], edges };\n      onLayoutEnd?.(result);\n      return result;\n    }\n\n    const width =\n      !propsWidth && typeof window !== \"undefined\"\n        ? window.innerWidth\n        : (propsWidth as number);\n    const height =\n      !propsHeight && typeof window !== \"undefined\"\n        ? window.innerHeight\n        : (propsHeight as number);\n    const center = !propsCenter\n      ? [width / 2, height / 2]\n      : (propsCenter as PointTuple);\n\n    if (n === 1) {\n      if (assign) {\n        graph.mergeNodeData(nodes[0].id, {\n          x: center[0],\n          y: center[1],\n        });\n      }\n      const result = {\n        nodes: [\n          {\n            ...nodes[0],\n            data: {\n              ...nodes[0].data,\n              x: center[0],\n              y: center[1],\n            },\n          },\n        ],\n        edges,\n      };\n      onLayoutEnd?.(result);\n      return result;\n    }\n\n    const layoutNodes: OutNode[] = [];\n    let maxNodeSize: number;\n    let maxNodeSpacing: number = 0;\n    if (isArray(nodeSize)) {\n      maxNodeSize = Math.max(nodeSize[0], nodeSize[1]);\n    } else {\n      maxNodeSize = nodeSize as number;\n    }\n    if (isArray(nodeSpacing)) {\n      maxNodeSpacing = Math.max(nodeSpacing[0], nodeSpacing[1]);\n    } else if (isNumber(nodeSpacing)) {\n      maxNodeSpacing = nodeSpacing;\n    }\n    nodes.forEach((node) => {\n      layoutNodes.push(clone(node) as OutNode);\n      let nodeSize: number = maxNodeSize;\n      if (isArray(node.data.size)) {\n        nodeSize = Math.max(node.data.size[0], node.data.size[1]);\n      } else if (isNumber(node.data.size)) {\n        nodeSize = node.data.size;\n      } else if (isObject(node.data.size)) {\n        nodeSize = Math.max(\n          (node.data.size as any).width,\n          (node.data.size as any).height\n        );\n      }\n      maxNodeSize = Math.max(maxNodeSize, nodeSize);\n\n      if (isFunction(nodeSpacing)) {\n        maxNodeSpacing = Math.max(nodeSpacing(node), maxNodeSpacing);\n      }\n    });\n\n    // layout\n    const nodeIdxMap: IndexMap = {};\n    layoutNodes.forEach((node, i) => {\n      nodeIdxMap[node.id] = i;\n    });\n\n    // get the node degrees\n    let sortBy = propsSortBy!;\n    if (\n      !isString(sortBy) ||\n      (layoutNodes[0] as any).data[sortBy] === undefined\n    ) {\n      sortBy = \"degree\";\n    }\n    if (sortBy === \"degree\") {\n      layoutNodes.sort(\n        (n1: Node, n2: Node) =>\n          graph.getDegree(n2.id, \"both\") - graph.getDegree(n1.id, \"both\")\n      );\n    } else {\n      // sort nodes by value\n      layoutNodes.sort(\n        (n1: Node, n2: Node) =>\n          (n2 as any).data[sortBy] - (n1 as any).data[sortBy]\n      );\n    }\n\n    const maxValueNode = layoutNodes[0];\n\n    const maxLevelDiff =\n      propsMaxLevelDiff || (maxValueNode as any).data[sortBy] / 4;\n\n    // put the values into levels\n    const levels: {\n      nodes: OutNode[];\n      r?: number;\n      dTheta?: number;\n    }[] = [{ nodes: [] }];\n    let currentLevel = levels[0];\n    layoutNodes.forEach((node) => {\n      if (currentLevel.nodes.length > 0) {\n        const diff = Math.abs(\n          currentLevel.nodes[0].data[sortBy] as number - (node as any).data[sortBy]\n        );\n        if (maxLevelDiff && diff >= maxLevelDiff) {\n          currentLevel = { nodes: [] };\n          levels.push(currentLevel);\n        }\n      }\n      currentLevel.nodes.push(node);\n    });\n\n    // create positions for levels\n    let minDist = maxNodeSize + (maxNodeSpacing || minNodeSpacing); // min dist between nodes\n    if (!preventOverlap) {\n      // then strictly constrain to bb\n      const firstLvlHasMulti = levels.length > 0 && levels[0].nodes.length > 1;\n      const maxR = Math.min(width, height) / 2 - minDist;\n      const rStep = maxR / (levels.length + (firstLvlHasMulti ? 1 : 0));\n\n      minDist = Math.min(minDist, rStep);\n    }\n\n    // find the metrics for each level\n    let r = 0;\n    levels.forEach((level) => {\n      const sweep =\n        propsSweep === undefined\n          ? 2 * Math.PI - (2 * Math.PI) / level.nodes.length\n          : propsSweep;\n      level.dTheta = sweep / Math.max(1, level.nodes.length - 1);\n\n      // calculate the radius\n      if (level.nodes.length > 1 && preventOverlap) {\n        // but only if more than one node (can't overlap)\n        const dcos = Math.cos(level.dTheta) - Math.cos(0);\n        const dsin = Math.sin(level.dTheta) - Math.sin(0);\n        const rMin = Math.sqrt(\n          (minDist * minDist) / (dcos * dcos + dsin * dsin)\n        ); // s.t. no nodes overlapping\n\n        r = Math.max(rMin, r);\n      }\n      level.r = r;\n      r += minDist;\n    });\n\n    if (equidistant) {\n      let rDeltaMax = 0;\n      let rr = 0;\n      for (let i = 0; i < levels.length; i++) {\n        const level = levels[i];\n        const rDelta = (level.r || 0) - rr;\n        rDeltaMax = Math.max(rDeltaMax, rDelta);\n      }\n      rr = 0;\n      levels.forEach((level, i) => {\n        if (i === 0) {\n          rr = level.r || 0;\n        }\n        level.r = rr;\n        rr += rDeltaMax;\n      });\n    }\n\n    // calculate the node positions\n    levels.forEach((level) => {\n      const dTheta = level.dTheta || 0;\n      const rr = level.r || 0;\n      level.nodes.forEach((node: OutNode, j: number) => {\n        const theta = startAngle + (clockwise ? 1 : -1) * dTheta * j;\n        node.data.x = center[0] + rr * Math.cos(theta);\n        node.data.y = center[1] + rr * Math.sin(theta);\n      });\n    });\n\n    if (assign) {\n      layoutNodes.forEach((node) =>\n        graph.mergeNodeData(node.id, {\n          x: node.data.x,\n          y: node.data.y,\n        })\n      );\n    }\n\n    const result = {\n      nodes: layoutNodes,\n      edges,\n    };\n\n    onLayoutEnd?.(result);\n\n    return result;\n  }\n}\n","import { isString, getFuncByUnknownType, isArray, clone } from \"./util\";\nimport type {\n  Graph,\n  GridLayoutOptions,\n  LayoutMapping,\n  PointTuple,\n  SyncLayout,\n  OutNode,\n} from \"./types\";\n\ntype RowsAndCols = {\n  rows: number;\n  cols: number;\n};\n\ntype RowAndCol = {\n  row: number;\n  col: number;\n};\n\ntype IdMapRowAndCol = {\n  [id: string]: RowAndCol;\n};\n\ntype VisitMap = {\n  [id: string]: boolean;\n};\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<GridLayoutOptions> = {\n  begin: [0, 0],\n  preventOverlap: true,\n  preventOverlapPadding: 10,\n  condense: false,\n  rows: undefined,\n  cols: undefined,\n  position: undefined,\n  sortBy: \"degree\",\n  nodeSize: 30,\n  width: 300,\n  height: 300,\n};\n\n/**\n * Layout arranging the nodes in a grid.\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new GridLayout({ rows: 10 });\n * const positions = layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new GridLayout({ rows: 10 });\n * const positions = layout.execute(graph, { rows: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * layout.assign(graph, { rows: 20 });\n */\nexport class GridLayout implements SyncLayout<GridLayoutOptions> {\n  id = \"grid\";\n\n  constructor(public options: GridLayoutOptions = {} as GridLayoutOptions) {\n    Object.assign(this.options, DEFAULTS_LAYOUT_OPTIONS, options);\n  }\n\n  /**\n   * Return the positions of nodes and edges(if needed).\n   */\n  execute(graph: Graph, options?: GridLayoutOptions): LayoutMapping {\n    return this.genericGridLayout(false, graph, options) as LayoutMapping;\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  assign(graph: Graph, options?: GridLayoutOptions) {\n    this.genericGridLayout(true, graph, options);\n  }\n\n  private genericGridLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: GridLayoutOptions\n  ): LayoutMapping | void {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      begin = [0, 0],\n      condense,\n      preventOverlapPadding,\n      preventOverlap,\n      columns,\n      rows: propsRows,\n      cols: propsCols = columns,\n      nodeSpacing: paramNodeSpacing,\n      nodeSize: paramNodeSize,\n      onLayoutEnd,\n      position,\n    } = mergedOptions;\n    let {\n      sortBy,\n      width: propsWidth,\n      height: propsHeight,\n      layoutInvisibles,\n    } = mergedOptions;\n\n    let nodes = graph.getAllNodes();\n    let edges = graph.getAllEdges();\n\n    if (!layoutInvisibles) {\n      nodes = nodes.filter(\n        (node) => node.data.visible || node.data.visible === undefined\n      );\n      edges = edges.filter(\n        (edge) => edge.data.visible || edge.data.visible === undefined\n      );\n    }\n\n    const n = nodes.length;\n\n    // Need no layout if there is no node.\n    if (n === 0) {\n      const result = {\n        nodes: [],\n        edges,\n      };\n      onLayoutEnd?.(result);\n      return result;\n    }\n    if (n === 1) {\n      if (assign) {\n        graph.mergeNodeData(nodes[0].id, {\n          x: begin[0],\n          y: begin[1],\n        });\n      }\n      const result = {\n        nodes: [\n          {\n            ...nodes[0],\n            data: {\n              ...nodes[0].data,\n              x: begin[0],\n              y: begin[1],\n            },\n          },\n        ],\n        edges,\n      };\n      onLayoutEnd?.(result);\n      return result;\n    }\n\n    const layoutNodes: OutNode[] = nodes.map((node) => clone(node) as OutNode);\n\n    if (\n      !isString(sortBy) ||\n      (layoutNodes[0] as any).data[sortBy] === undefined\n    ) {\n      sortBy = \"degree\";\n    }\n    if (sortBy === \"degree\") {\n      layoutNodes.sort(\n        (n1, n2) =>\n          graph.getDegree(n2.id, \"both\") - graph.getDegree(n1.id, \"both\")\n      );\n    } else {\n      // sort nodes by value\n      layoutNodes.sort(\n        (n1, n2) => (n2 as any).data[sortBy!] - (n1 as any).data[sortBy!]\n      );\n    }\n    const width =\n      !propsWidth && typeof window !== \"undefined\"\n        ? window.innerWidth\n        : (propsWidth as number);\n    const height =\n      !propsHeight && typeof window !== \"undefined\"\n        ? window.innerHeight\n        : (propsHeight as number);\n\n    const cells = n;\n    const rcs = { rows: propsRows, cols: propsCols } as RowsAndCols;\n\n    // if rows or columns were set in self, use those values\n    if (propsRows != null && propsCols != null) {\n      rcs.rows = propsRows;\n      rcs.cols = propsCols;\n    } else if (propsRows != null && propsCols == null) {\n      rcs.rows = propsRows;\n      rcs.cols = Math.ceil(cells / rcs.rows);\n    } else if (propsRows == null && propsCols != null) {\n      rcs.cols = propsCols;\n      rcs.rows = Math.ceil(cells / rcs.cols);\n    } else {\n      // otherwise use the automatic values and adjust accordingly\t      // otherwise use the automatic values and adjust accordingly\n      // width/height * splits^2 = cells where splits is number of times to split width\n      const splits = Math.sqrt((cells * height) / width);\n      rcs.rows = Math.round(splits);\n      rcs.cols = Math.round((width / height) * splits);\n    }\n    rcs.rows = Math.max(rcs.rows, 1);\n    rcs.cols = Math.max(rcs.cols, 1);\n    if (rcs.cols * rcs.rows > cells) {\n      // otherwise use the automatic values and adjust accordingly\n      // if rounding was up, see if we can reduce rows or columns\n      const sm = small(rcs) as number;\n      const lg = large(rcs) as number;\n\n      // reducing the small side takes away the most cells, so try it first\n      if ((sm - 1) * lg >= cells) {\n        small(rcs, sm - 1);\n      } else if ((lg - 1) * sm >= cells) {\n        large(rcs, lg - 1);\n      }\n    } else {\n      // if rounding was too low, add rows or columns\n      while (rcs.cols * rcs.rows < cells) {\n        const sm = small(rcs) as number;\n        const lg = large(rcs) as number;\n\n        // try to add to larger side first (adds less in multiplication)\n        if ((lg + 1) * sm >= cells) {\n          large(rcs, lg + 1);\n        } else {\n          small(rcs, sm + 1);\n        }\n      }\n    }\n\n    let cellWidth = condense ? 0 : width / rcs.cols;\n    let cellHeight = condense ? 0 : height / rcs.rows;\n\n    if (preventOverlap || paramNodeSpacing) {\n      const nodeSpacing: Function = getFuncByUnknownType(10, paramNodeSpacing);\n      const nodeSize: Function = getFuncByUnknownType(30, paramNodeSize, false);\n      layoutNodes.forEach((node) => {\n        if (!node.data.x || !node.data.y) {\n          // for bb\n          node.data.x = 0;\n          node.data.y = 0;\n        }\n\n        const oNode = graph.getNode(node.id);\n        const res = nodeSize(oNode) || 30;\n\n        let nodeW;\n        let nodeH;\n\n        if (isArray(res)) {\n          nodeW = res[0];\n          nodeH = res[1];\n        } else {\n          nodeW = res;\n          nodeH = res;\n        }\n\n        const p =\n          nodeSpacing !== undefined ? nodeSpacing(node) : preventOverlapPadding;\n\n        const w = nodeW + p;\n        const h = nodeH + p;\n\n        cellWidth = Math.max(cellWidth, w);\n        cellHeight = Math.max(cellHeight, h);\n      });\n    }\n\n    const cellUsed: VisitMap = {}; // e.g. 'c-0-2' => true\n\n    // to keep track of current cell position\n    const rc = { row: 0, col: 0 };\n\n    // get a cache of all the manual positions\n    const id2manPos: IdMapRowAndCol = {};\n    for (let i = 0; i < layoutNodes.length; i++) {\n      const node = layoutNodes[i];\n      let rcPos;\n      if (position) {\n        // TODO: not sure the api name\n        rcPos = position(graph.getNode(node.id));\n      }\n\n      if (rcPos && (rcPos.row !== undefined || rcPos.col !== undefined)) {\n        // must have at least row or col def'd\n        const pos = {\n          row: rcPos.row,\n          col: rcPos.col,\n        } as RowAndCol;\n\n        if (pos.col === undefined) {\n          // find unused col\n          pos.col = 0;\n\n          while (used(cellUsed, pos)) {\n            pos.col++;\n          }\n        } else if (pos.row === undefined) {\n          // find unused row\n          pos.row = 0;\n\n          while (used(cellUsed, pos)) {\n            pos.row++;\n          }\n        }\n\n        id2manPos[node.id] = pos as RowAndCol;\n        use(cellUsed, pos);\n      }\n      getPos(node, begin, cellWidth, cellHeight, id2manPos, rcs, rc, cellUsed);\n    }\n    const result = {\n      nodes: layoutNodes,\n      edges,\n    };\n\n    onLayoutEnd?.(result);\n\n    if (assign) {\n      layoutNodes.forEach((node) => {\n        graph.mergeNodeData(node.id, {\n          x: node.data.x,\n          y: node.data.y,\n        });\n      });\n    }\n    return result;\n  }\n}\n\nconst small = (\n  rcs: { rows: number; cols: number },\n  val?: number\n): number | undefined => {\n  let res: number | undefined;\n  const rows = rcs.rows || 5;\n  const cols = rcs.cols || 5;\n  if (val == null) {\n    res = Math.min(rows, cols);\n  } else {\n    const min = Math.min(rows, cols);\n    if (min === rcs.rows) {\n      rcs.rows = val;\n    } else {\n      rcs.cols = val;\n    }\n  }\n  return res;\n};\n\nconst large = (rcs: RowsAndCols, val?: number): number | undefined => {\n  let result: number | undefined;\n  const usedRows = rcs.rows || 5;\n  const usedCols = rcs.cols || 5;\n  if (val == null) {\n    result = Math.max(usedRows, usedCols);\n  } else {\n    const max = Math.max(usedRows, usedCols);\n    if (max === rcs.rows) {\n      rcs.rows = val;\n    } else {\n      rcs.cols = val;\n    }\n  }\n  return result;\n};\n\nconst used = (cellUsed: VisitMap, rc: RowAndCol) =>\n  cellUsed[`c-${rc.row}-${rc.col}`] || false;\n\nconst use = (cellUsed: VisitMap, rc: RowAndCol) =>\n  (cellUsed[`c-${rc.row}-${rc.col}`] = true);\n\nconst moveToNextCell = (rcs: RowsAndCols, rc: RowAndCol) => {\n  const cols = rcs.cols || 5;\n  rc.col++;\n  if (rc.col >= cols) {\n    rc.col = 0;\n    rc.row++;\n  }\n};\n\nconst getPos = (\n  node: OutNode,\n  begin: PointTuple,\n  cellWidth: number,\n  cellHeight: number,\n  id2manPos: IdMapRowAndCol,\n  rcs: RowsAndCols,\n  rc: RowAndCol,\n  cellUsed: VisitMap\n) => {\n  let x: number;\n  let y: number;\n\n  // see if we have a manual position set\n  const rcPos = id2manPos[node.id];\n  if (rcPos) {\n    x = rcPos.col * cellWidth + cellWidth / 2 + begin[0];\n    y = rcPos.row * cellHeight + cellHeight / 2 + begin[1];\n  } else {\n    // otherwise set automatically\n\n    while (used(cellUsed, rc)) {\n      moveToNextCell(rcs, rc);\n    }\n\n    x = rc.col * cellWidth + cellWidth / 2 + begin[0];\n    y = rc.row * cellHeight + cellHeight / 2 + begin[1];\n    use(cellUsed, rc);\n\n    moveToNextCell(rcs, rc);\n  }\n  node.data.x = x;\n  node.data.y = y;\n};\n","const toString = Object.prototype.toString;\n/**\n * Checks if an object is an instance of an Array (array or typed array).\n *\n * @param {any} value - Object to check.\n * @returns {boolean} True if the object is an array.\n */\nexport function isAnyArray(value) {\n    return toString.call(value).endsWith('Array]');\n}\n//# sourceMappingURL=index.js.map","import { isAnyArray } from 'is-any-array';\n\nfunction max(input) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n  if (!isAnyArray(input)) {\n    throw new TypeError('input must be an array');\n  }\n\n  if (input.length === 0) {\n    throw new TypeError('input must not be empty');\n  }\n\n  var _options$fromIndex = options.fromIndex,\n      fromIndex = _options$fromIndex === void 0 ? 0 : _options$fromIndex,\n      _options$toIndex = options.toIndex,\n      toIndex = _options$toIndex === void 0 ? input.length : _options$toIndex;\n\n  if (fromIndex < 0 || fromIndex >= input.length || !Number.isInteger(fromIndex)) {\n    throw new Error('fromIndex must be a positive integer smaller than length');\n  }\n\n  if (toIndex <= fromIndex || toIndex > input.length || !Number.isInteger(toIndex)) {\n    throw new Error('toIndex must be an integer greater than fromIndex and at most equal to length');\n  }\n\n  var maxValue = input[fromIndex];\n\n  for (var i = fromIndex + 1; i < toIndex; i++) {\n    if (input[i] > maxValue) maxValue = input[i];\n  }\n\n  return maxValue;\n}\n\nexport { max as default };\n","import { isAnyArray } from 'is-any-array';\n\nfunction min(input) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n  if (!isAnyArray(input)) {\n    throw new TypeError('input must be an array');\n  }\n\n  if (input.length === 0) {\n    throw new TypeError('input must not be empty');\n  }\n\n  var _options$fromIndex = options.fromIndex,\n      fromIndex = _options$fromIndex === void 0 ? 0 : _options$fromIndex,\n      _options$toIndex = options.toIndex,\n      toIndex = _options$toIndex === void 0 ? input.length : _options$toIndex;\n\n  if (fromIndex < 0 || fromIndex >= input.length || !Number.isInteger(fromIndex)) {\n    throw new Error('fromIndex must be a positive integer smaller than length');\n  }\n\n  if (toIndex <= fromIndex || toIndex > input.length || !Number.isInteger(toIndex)) {\n    throw new Error('toIndex must be an integer greater than fromIndex and at most equal to length');\n  }\n\n  var minValue = input[fromIndex];\n\n  for (var i = fromIndex + 1; i < toIndex; i++) {\n    if (input[i] < minValue) minValue = input[i];\n  }\n\n  return minValue;\n}\n\nexport { min as default };\n","import { isAnyArray } from 'is-any-array';\nimport max from 'ml-array-max';\nimport min from 'ml-array-min';\n\nfunction rescale(input) {\n  var options = arguments.length > 1 && arguments[1] !== undefined ? arguments[1] : {};\n\n  if (!isAnyArray(input)) {\n    throw new TypeError('input must be an array');\n  } else if (input.length === 0) {\n    throw new TypeError('input must not be empty');\n  }\n\n  var output;\n\n  if (options.output !== undefined) {\n    if (!isAnyArray(options.output)) {\n      throw new TypeError('output option must be an array if specified');\n    }\n\n    output = options.output;\n  } else {\n    output = new Array(input.length);\n  }\n\n  var currentMin = min(input);\n  var currentMax = max(input);\n\n  if (currentMin === currentMax) {\n    throw new RangeError('minimum and maximum input values are equal. Cannot rescale a constant array');\n  }\n\n  var _options$min = options.min,\n      minValue = _options$min === void 0 ? options.autoMinMax ? currentMin : 0 : _options$min,\n      _options$max = options.max,\n      maxValue = _options$max === void 0 ? options.autoMinMax ? currentMax : 1 : _options$max;\n\n  if (minValue >= maxValue) {\n    throw new RangeError('min option must be smaller than max option');\n  }\n\n  var factor = (maxValue - minValue) / (currentMax - currentMin);\n\n  for (var i = 0; i < input.length; i++) {\n    output[i] = (input[i] - currentMin) * factor + minValue;\n  }\n\n  return output;\n}\n\nexport { rescale as default };\n","const indent = ' '.repeat(2);\nconst indentData = ' '.repeat(4);\n\nexport function inspectMatrix() {\n  return inspectMatrixWithOptions(this);\n}\n\nexport function inspectMatrixWithOptions(matrix, options = {}) {\n  const {\n    maxRows = 15,\n    maxColumns = 10,\n    maxNumSize = 8,\n    padMinus = 'auto',\n  } = options;\n  return `${matrix.constructor.name} {\n${indent}[\n${indentData}${inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus)}\n${indent}]\n${indent}rows: ${matrix.rows}\n${indent}columns: ${matrix.columns}\n}`;\n}\n\nfunction inspectData(matrix, maxRows, maxColumns, maxNumSize, padMinus) {\n  const { rows, columns } = matrix;\n  const maxI = Math.min(rows, maxRows);\n  const maxJ = Math.min(columns, maxColumns);\n  const result = [];\n\n  if (padMinus === 'auto') {\n    padMinus = false;\n    loop: for (let i = 0; i < maxI; i++) {\n      for (let j = 0; j < maxJ; j++) {\n        if (matrix.get(i, j) < 0) {\n          padMinus = true;\n          break loop;\n        }\n      }\n    }\n  }\n\n  for (let i = 0; i < maxI; i++) {\n    let line = [];\n    for (let j = 0; j < maxJ; j++) {\n      line.push(formatNumber(matrix.get(i, j), maxNumSize, padMinus));\n    }\n    result.push(`${line.join(' ')}`);\n  }\n  if (maxJ !== columns) {\n    result[result.length - 1] += ` ... ${columns - maxColumns} more columns`;\n  }\n  if (maxI !== rows) {\n    result.push(`... ${rows - maxRows} more rows`);\n  }\n  return result.join(`\\n${indentData}`);\n}\n\nfunction formatNumber(num, maxNumSize, padMinus) {\n  return (\n    num >= 0 && padMinus\n      ? ` ${formatNumber2(num, maxNumSize - 1)}`\n      : formatNumber2(num, maxNumSize)\n  ).padEnd(maxNumSize);\n}\n\nfunction formatNumber2(num, len) {\n  // small.length numbers should be as is\n  let str = num.toString();\n  if (str.length <= len) return str;\n\n  // (7)'0.00123' is better then (7)'1.23e-2'\n  // (8)'0.000123' is worse then (7)'1.23e-3',\n  let fix = num.toFixed(len);\n  if (fix.length > len) {\n    fix = num.toFixed(Math.max(0, len - (fix.length - len)));\n  }\n  if (\n    fix.length <= len &&\n    !fix.startsWith('0.000') &&\n    !fix.startsWith('-0.000')\n  ) {\n    return fix;\n  }\n\n  // well, if it's still too long the user should've used longer numbers\n  let exp = num.toExponential(len);\n  if (exp.length > len) {\n    exp = num.toExponential(Math.max(0, len - (exp.length - len)));\n  }\n  return exp.slice(0);\n}\n","import { isAnyArray } from 'is-any-array';\n\n/**\n * @private\n * Check that a row index is not out of bounds\n * @param {Matrix} matrix\n * @param {number} index\n * @param {boolean} [outer]\n */\nexport function checkRowIndex(matrix, index, outer) {\n  let max = outer ? matrix.rows : matrix.rows - 1;\n  if (index < 0 || index > max) {\n    throw new RangeError('Row index out of range');\n  }\n}\n\n/**\n * @private\n * Check that a column index is not out of bounds\n * @param {Matrix} matrix\n * @param {number} index\n * @param {boolean} [outer]\n */\nexport function checkColumnIndex(matrix, index, outer) {\n  let max = outer ? matrix.columns : matrix.columns - 1;\n  if (index < 0 || index > max) {\n    throw new RangeError('Column index out of range');\n  }\n}\n\n/**\n * @private\n * Check that the provided vector is an array with the right length\n * @param {Matrix} matrix\n * @param {Array|Matrix} vector\n * @return {Array}\n * @throws {RangeError}\n */\nexport function checkRowVector(matrix, vector) {\n  if (vector.to1DArray) {\n    vector = vector.to1DArray();\n  }\n  if (vector.length !== matrix.columns) {\n    throw new RangeError(\n      'vector size must be the same as the number of columns',\n    );\n  }\n  return vector;\n}\n\n/**\n * @private\n * Check that the provided vector is an array with the right length\n * @param {Matrix} matrix\n * @param {Array|Matrix} vector\n * @return {Array}\n * @throws {RangeError}\n */\nexport function checkColumnVector(matrix, vector) {\n  if (vector.to1DArray) {\n    vector = vector.to1DArray();\n  }\n  if (vector.length !== matrix.rows) {\n    throw new RangeError('vector size must be the same as the number of rows');\n  }\n  return vector;\n}\n\nexport function checkRowIndices(matrix, rowIndices) {\n  if (!isAnyArray(rowIndices)) {\n    throw new TypeError('row indices must be an array');\n  }\n\n  for (let i = 0; i < rowIndices.length; i++) {\n    if (rowIndices[i] < 0 || rowIndices[i] >= matrix.rows) {\n      throw new RangeError('row indices are out of range');\n    }\n  }\n}\n\nexport function checkColumnIndices(matrix, columnIndices) {\n  if (!isAnyArray(columnIndices)) {\n    throw new TypeError('column indices must be an array');\n  }\n\n  for (let i = 0; i < columnIndices.length; i++) {\n    if (columnIndices[i] < 0 || columnIndices[i] >= matrix.columns) {\n      throw new RangeError('column indices are out of range');\n    }\n  }\n}\n\nexport function checkRange(matrix, startRow, endRow, startColumn, endColumn) {\n  if (arguments.length !== 5) {\n    throw new RangeError('expected 4 arguments');\n  }\n  checkNumber('startRow', startRow);\n  checkNumber('endRow', endRow);\n  checkNumber('startColumn', startColumn);\n  checkNumber('endColumn', endColumn);\n  if (\n    startRow > endRow ||\n    startColumn > endColumn ||\n    startRow < 0 ||\n    startRow >= matrix.rows ||\n    endRow < 0 ||\n    endRow >= matrix.rows ||\n    startColumn < 0 ||\n    startColumn >= matrix.columns ||\n    endColumn < 0 ||\n    endColumn >= matrix.columns\n  ) {\n    throw new RangeError('Submatrix indices are out of range');\n  }\n}\n\nexport function newArray(length, value = 0) {\n  let array = [];\n  for (let i = 0; i < length; i++) {\n    array.push(value);\n  }\n  return array;\n}\n\nfunction checkNumber(name, value) {\n  if (typeof value !== 'number') {\n    throw new TypeError(`${name} must be a number`);\n  }\n}\n\nexport function checkNonEmpty(matrix) {\n  if (matrix.isEmpty()) {\n    throw new Error('Empty matrix has no elements to index');\n  }\n}\n","import { isAnyArray } from 'is-any-array';\nimport rescale from 'ml-array-rescale';\n\nimport { inspectMatrix, inspectMatrixWithOptions } from './inspect';\nimport { installMathOperations } from './mathOperations';\nimport {\n  sumByRow,\n  sumByColumn,\n  sumAll,\n  productByRow,\n  productByColumn,\n  productAll,\n  varianceByRow,\n  varianceByColumn,\n  varianceAll,\n  centerByRow,\n  centerByColumn,\n  centerAll,\n  scaleByRow,\n  scaleByColumn,\n  scaleAll,\n  getScaleByRow,\n  getScaleByColumn,\n  getScaleAll,\n} from './stat';\nimport {\n  checkRowVector,\n  checkRowIndex,\n  checkColumnIndex,\n  checkColumnVector,\n  checkRange,\n  checkNonEmpty,\n  checkRowIndices,\n  checkColumnIndices,\n} from './util';\n\nexport class AbstractMatrix {\n  static from1DArray(newRows, newColumns, newData) {\n    let length = newRows * newColumns;\n    if (length !== newData.length) {\n      throw new RangeError('data length does not match given dimensions');\n    }\n    let newMatrix = new Matrix(newRows, newColumns);\n    for (let row = 0; row < newRows; row++) {\n      for (let column = 0; column < newColumns; column++) {\n        newMatrix.set(row, column, newData[row * newColumns + column]);\n      }\n    }\n    return newMatrix;\n  }\n\n  static rowVector(newData) {\n    let vector = new Matrix(1, newData.length);\n    for (let i = 0; i < newData.length; i++) {\n      vector.set(0, i, newData[i]);\n    }\n    return vector;\n  }\n\n  static columnVector(newData) {\n    let vector = new Matrix(newData.length, 1);\n    for (let i = 0; i < newData.length; i++) {\n      vector.set(i, 0, newData[i]);\n    }\n    return vector;\n  }\n\n  static zeros(rows, columns) {\n    return new Matrix(rows, columns);\n  }\n\n  static ones(rows, columns) {\n    return new Matrix(rows, columns).fill(1);\n  }\n\n  static rand(rows, columns, options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { random = Math.random } = options;\n    let matrix = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        matrix.set(i, j, random());\n      }\n    }\n    return matrix;\n  }\n\n  static randInt(rows, columns, options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1000, random = Math.random } = options;\n    if (!Number.isInteger(min)) throw new TypeError('min must be an integer');\n    if (!Number.isInteger(max)) throw new TypeError('max must be an integer');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let interval = max - min;\n    let matrix = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        let value = min + Math.round(random() * interval);\n        matrix.set(i, j, value);\n      }\n    }\n    return matrix;\n  }\n\n  static eye(rows, columns, value) {\n    if (columns === undefined) columns = rows;\n    if (value === undefined) value = 1;\n    let min = Math.min(rows, columns);\n    let matrix = this.zeros(rows, columns);\n    for (let i = 0; i < min; i++) {\n      matrix.set(i, i, value);\n    }\n    return matrix;\n  }\n\n  static diag(data, rows, columns) {\n    let l = data.length;\n    if (rows === undefined) rows = l;\n    if (columns === undefined) columns = rows;\n    let min = Math.min(l, rows, columns);\n    let matrix = this.zeros(rows, columns);\n    for (let i = 0; i < min; i++) {\n      matrix.set(i, i, data[i]);\n    }\n    return matrix;\n  }\n\n  static min(matrix1, matrix2) {\n    matrix1 = this.checkMatrix(matrix1);\n    matrix2 = this.checkMatrix(matrix2);\n    let rows = matrix1.rows;\n    let columns = matrix1.columns;\n    let result = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        result.set(i, j, Math.min(matrix1.get(i, j), matrix2.get(i, j)));\n      }\n    }\n    return result;\n  }\n\n  static max(matrix1, matrix2) {\n    matrix1 = this.checkMatrix(matrix1);\n    matrix2 = this.checkMatrix(matrix2);\n    let rows = matrix1.rows;\n    let columns = matrix1.columns;\n    let result = new this(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        result.set(i, j, Math.max(matrix1.get(i, j), matrix2.get(i, j)));\n      }\n    }\n    return result;\n  }\n\n  static checkMatrix(value) {\n    return AbstractMatrix.isMatrix(value) ? value : new Matrix(value);\n  }\n\n  static isMatrix(value) {\n    return value != null && value.klass === 'Matrix';\n  }\n\n  get size() {\n    return this.rows * this.columns;\n  }\n\n  apply(callback) {\n    if (typeof callback !== 'function') {\n      throw new TypeError('callback must be a function');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        callback.call(this, i, j);\n      }\n    }\n    return this;\n  }\n\n  to1DArray() {\n    let array = [];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        array.push(this.get(i, j));\n      }\n    }\n    return array;\n  }\n\n  to2DArray() {\n    let copy = [];\n    for (let i = 0; i < this.rows; i++) {\n      copy.push([]);\n      for (let j = 0; j < this.columns; j++) {\n        copy[i].push(this.get(i, j));\n      }\n    }\n    return copy;\n  }\n\n  toJSON() {\n    return this.to2DArray();\n  }\n\n  isRowVector() {\n    return this.rows === 1;\n  }\n\n  isColumnVector() {\n    return this.columns === 1;\n  }\n\n  isVector() {\n    return this.rows === 1 || this.columns === 1;\n  }\n\n  isSquare() {\n    return this.rows === this.columns;\n  }\n\n  isEmpty() {\n    return this.rows === 0 || this.columns === 0;\n  }\n\n  isSymmetric() {\n    if (this.isSquare()) {\n      for (let i = 0; i < this.rows; i++) {\n        for (let j = 0; j <= i; j++) {\n          if (this.get(i, j) !== this.get(j, i)) {\n            return false;\n          }\n        }\n      }\n      return true;\n    }\n    return false;\n  }\n\n  isEchelonForm() {\n    let i = 0;\n    let j = 0;\n    let previousColumn = -1;\n    let isEchelonForm = true;\n    let checked = false;\n    while (i < this.rows && isEchelonForm) {\n      j = 0;\n      checked = false;\n      while (j < this.columns && checked === false) {\n        if (this.get(i, j) === 0) {\n          j++;\n        } else if (this.get(i, j) === 1 && j > previousColumn) {\n          checked = true;\n          previousColumn = j;\n        } else {\n          isEchelonForm = false;\n          checked = true;\n        }\n      }\n      i++;\n    }\n    return isEchelonForm;\n  }\n\n  isReducedEchelonForm() {\n    let i = 0;\n    let j = 0;\n    let previousColumn = -1;\n    let isReducedEchelonForm = true;\n    let checked = false;\n    while (i < this.rows && isReducedEchelonForm) {\n      j = 0;\n      checked = false;\n      while (j < this.columns && checked === false) {\n        if (this.get(i, j) === 0) {\n          j++;\n        } else if (this.get(i, j) === 1 && j > previousColumn) {\n          checked = true;\n          previousColumn = j;\n        } else {\n          isReducedEchelonForm = false;\n          checked = true;\n        }\n      }\n      for (let k = j + 1; k < this.rows; k++) {\n        if (this.get(i, k) !== 0) {\n          isReducedEchelonForm = false;\n        }\n      }\n      i++;\n    }\n    return isReducedEchelonForm;\n  }\n\n  echelonForm() {\n    let result = this.clone();\n    let h = 0;\n    let k = 0;\n    while (h < result.rows && k < result.columns) {\n      let iMax = h;\n      for (let i = h; i < result.rows; i++) {\n        if (result.get(i, k) > result.get(iMax, k)) {\n          iMax = i;\n        }\n      }\n      if (result.get(iMax, k) === 0) {\n        k++;\n      } else {\n        result.swapRows(h, iMax);\n        let tmp = result.get(h, k);\n        for (let j = k; j < result.columns; j++) {\n          result.set(h, j, result.get(h, j) / tmp);\n        }\n        for (let i = h + 1; i < result.rows; i++) {\n          let factor = result.get(i, k) / result.get(h, k);\n          result.set(i, k, 0);\n          for (let j = k + 1; j < result.columns; j++) {\n            result.set(i, j, result.get(i, j) - result.get(h, j) * factor);\n          }\n        }\n        h++;\n        k++;\n      }\n    }\n    return result;\n  }\n\n  reducedEchelonForm() {\n    let result = this.echelonForm();\n    let m = result.columns;\n    let n = result.rows;\n    let h = n - 1;\n    while (h >= 0) {\n      if (result.maxRow(h) === 0) {\n        h--;\n      } else {\n        let p = 0;\n        let pivot = false;\n        while (p < n && pivot === false) {\n          if (result.get(h, p) === 1) {\n            pivot = true;\n          } else {\n            p++;\n          }\n        }\n        for (let i = 0; i < h; i++) {\n          let factor = result.get(i, p);\n          for (let j = p; j < m; j++) {\n            let tmp = result.get(i, j) - factor * result.get(h, j);\n            result.set(i, j, tmp);\n          }\n        }\n        h--;\n      }\n    }\n    return result;\n  }\n\n  set() {\n    throw new Error('set method is unimplemented');\n  }\n\n  get() {\n    throw new Error('get method is unimplemented');\n  }\n\n  repeat(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { rows = 1, columns = 1 } = options;\n    if (!Number.isInteger(rows) || rows <= 0) {\n      throw new TypeError('rows must be a positive integer');\n    }\n    if (!Number.isInteger(columns) || columns <= 0) {\n      throw new TypeError('columns must be a positive integer');\n    }\n    let matrix = new Matrix(this.rows * rows, this.columns * columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        matrix.setSubMatrix(this, this.rows * i, this.columns * j);\n      }\n    }\n    return matrix;\n  }\n\n  fill(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, value);\n      }\n    }\n    return this;\n  }\n\n  neg() {\n    return this.mulS(-1);\n  }\n\n  getRow(index) {\n    checkRowIndex(this, index);\n    let row = [];\n    for (let i = 0; i < this.columns; i++) {\n      row.push(this.get(index, i));\n    }\n    return row;\n  }\n\n  getRowVector(index) {\n    return Matrix.rowVector(this.getRow(index));\n  }\n\n  setRow(index, array) {\n    checkRowIndex(this, index);\n    array = checkRowVector(this, array);\n    for (let i = 0; i < this.columns; i++) {\n      this.set(index, i, array[i]);\n    }\n    return this;\n  }\n\n  swapRows(row1, row2) {\n    checkRowIndex(this, row1);\n    checkRowIndex(this, row2);\n    for (let i = 0; i < this.columns; i++) {\n      let temp = this.get(row1, i);\n      this.set(row1, i, this.get(row2, i));\n      this.set(row2, i, temp);\n    }\n    return this;\n  }\n\n  getColumn(index) {\n    checkColumnIndex(this, index);\n    let column = [];\n    for (let i = 0; i < this.rows; i++) {\n      column.push(this.get(i, index));\n    }\n    return column;\n  }\n\n  getColumnVector(index) {\n    return Matrix.columnVector(this.getColumn(index));\n  }\n\n  setColumn(index, array) {\n    checkColumnIndex(this, index);\n    array = checkColumnVector(this, array);\n    for (let i = 0; i < this.rows; i++) {\n      this.set(i, index, array[i]);\n    }\n    return this;\n  }\n\n  swapColumns(column1, column2) {\n    checkColumnIndex(this, column1);\n    checkColumnIndex(this, column2);\n    for (let i = 0; i < this.rows; i++) {\n      let temp = this.get(i, column1);\n      this.set(i, column1, this.get(i, column2));\n      this.set(i, column2, temp);\n    }\n    return this;\n  }\n\n  addRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + vector[j]);\n      }\n    }\n    return this;\n  }\n\n  subRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - vector[j]);\n      }\n    }\n    return this;\n  }\n\n  mulRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * vector[j]);\n      }\n    }\n    return this;\n  }\n\n  divRowVector(vector) {\n    vector = checkRowVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / vector[j]);\n      }\n    }\n    return this;\n  }\n\n  addColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + vector[i]);\n      }\n    }\n    return this;\n  }\n\n  subColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - vector[i]);\n      }\n    }\n    return this;\n  }\n\n  mulColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * vector[i]);\n      }\n    }\n    return this;\n  }\n\n  divColumnVector(vector) {\n    vector = checkColumnVector(this, vector);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / vector[i]);\n      }\n    }\n    return this;\n  }\n\n  mulRow(index, value) {\n    checkRowIndex(this, index);\n    for (let i = 0; i < this.columns; i++) {\n      this.set(index, i, this.get(index, i) * value);\n    }\n    return this;\n  }\n\n  mulColumn(index, value) {\n    checkColumnIndex(this, index);\n    for (let i = 0; i < this.rows; i++) {\n      this.set(i, index, this.get(i, index) * value);\n    }\n    return this;\n  }\n\n  max(by) {\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    switch (by) {\n      case 'row': {\n        const max = new Array(this.rows).fill(Number.NEGATIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max[row]) {\n              max[row] = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      case 'column': {\n        const max = new Array(this.columns).fill(Number.NEGATIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max[column]) {\n              max[column] = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      case undefined: {\n        let max = this.get(0, 0);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) > max) {\n              max = this.get(row, column);\n            }\n          }\n        }\n        return max;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  maxIndex() {\n    checkNonEmpty(this);\n    let v = this.get(0, 0);\n    let idx = [0, 0];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        if (this.get(i, j) > v) {\n          v = this.get(i, j);\n          idx[0] = i;\n          idx[1] = j;\n        }\n      }\n    }\n    return idx;\n  }\n\n  min(by) {\n    if (this.isEmpty()) {\n      return NaN;\n    }\n\n    switch (by) {\n      case 'row': {\n        const min = new Array(this.rows).fill(Number.POSITIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min[row]) {\n              min[row] = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      case 'column': {\n        const min = new Array(this.columns).fill(Number.POSITIVE_INFINITY);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min[column]) {\n              min[column] = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      case undefined: {\n        let min = this.get(0, 0);\n        for (let row = 0; row < this.rows; row++) {\n          for (let column = 0; column < this.columns; column++) {\n            if (this.get(row, column) < min) {\n              min = this.get(row, column);\n            }\n          }\n        }\n        return min;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  minIndex() {\n    checkNonEmpty(this);\n    let v = this.get(0, 0);\n    let idx = [0, 0];\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        if (this.get(i, j) < v) {\n          v = this.get(i, j);\n          idx[0] = i;\n          idx[1] = j;\n        }\n      }\n    }\n    return idx;\n  }\n\n  maxRow(row) {\n    checkRowIndex(this, row);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(row, 0);\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) > v) {\n        v = this.get(row, i);\n      }\n    }\n    return v;\n  }\n\n  maxRowIndex(row) {\n    checkRowIndex(this, row);\n    checkNonEmpty(this);\n    let v = this.get(row, 0);\n    let idx = [row, 0];\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) > v) {\n        v = this.get(row, i);\n        idx[1] = i;\n      }\n    }\n    return idx;\n  }\n\n  minRow(row) {\n    checkRowIndex(this, row);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(row, 0);\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) < v) {\n        v = this.get(row, i);\n      }\n    }\n    return v;\n  }\n\n  minRowIndex(row) {\n    checkRowIndex(this, row);\n    checkNonEmpty(this);\n    let v = this.get(row, 0);\n    let idx = [row, 0];\n    for (let i = 1; i < this.columns; i++) {\n      if (this.get(row, i) < v) {\n        v = this.get(row, i);\n        idx[1] = i;\n      }\n    }\n    return idx;\n  }\n\n  maxColumn(column) {\n    checkColumnIndex(this, column);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(0, column);\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) > v) {\n        v = this.get(i, column);\n      }\n    }\n    return v;\n  }\n\n  maxColumnIndex(column) {\n    checkColumnIndex(this, column);\n    checkNonEmpty(this);\n    let v = this.get(0, column);\n    let idx = [0, column];\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) > v) {\n        v = this.get(i, column);\n        idx[0] = i;\n      }\n    }\n    return idx;\n  }\n\n  minColumn(column) {\n    checkColumnIndex(this, column);\n    if (this.isEmpty()) {\n      return NaN;\n    }\n    let v = this.get(0, column);\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) < v) {\n        v = this.get(i, column);\n      }\n    }\n    return v;\n  }\n\n  minColumnIndex(column) {\n    checkColumnIndex(this, column);\n    checkNonEmpty(this);\n    let v = this.get(0, column);\n    let idx = [0, column];\n    for (let i = 1; i < this.rows; i++) {\n      if (this.get(i, column) < v) {\n        v = this.get(i, column);\n        idx[0] = i;\n      }\n    }\n    return idx;\n  }\n\n  diag() {\n    let min = Math.min(this.rows, this.columns);\n    let diag = [];\n    for (let i = 0; i < min; i++) {\n      diag.push(this.get(i, i));\n    }\n    return diag;\n  }\n\n  norm(type = 'frobenius') {\n    let result = 0;\n    if (type === 'max') {\n      return this.max();\n    } else if (type === 'frobenius') {\n      for (let i = 0; i < this.rows; i++) {\n        for (let j = 0; j < this.columns; j++) {\n          result = result + this.get(i, j) * this.get(i, j);\n        }\n      }\n      return Math.sqrt(result);\n    } else {\n      throw new RangeError(`unknown norm type: ${type}`);\n    }\n  }\n\n  cumulativeSum() {\n    let sum = 0;\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        sum += this.get(i, j);\n        this.set(i, j, sum);\n      }\n    }\n    return this;\n  }\n\n  dot(vector2) {\n    if (AbstractMatrix.isMatrix(vector2)) vector2 = vector2.to1DArray();\n    let vector1 = this.to1DArray();\n    if (vector1.length !== vector2.length) {\n      throw new RangeError('vectors do not have the same size');\n    }\n    let dot = 0;\n    for (let i = 0; i < vector1.length; i++) {\n      dot += vector1[i] * vector2[i];\n    }\n    return dot;\n  }\n\n  mmul(other) {\n    other = Matrix.checkMatrix(other);\n\n    let m = this.rows;\n    let n = this.columns;\n    let p = other.columns;\n\n    let result = new Matrix(m, p);\n\n    let Bcolj = new Float64Array(n);\n    for (let j = 0; j < p; j++) {\n      for (let k = 0; k < n; k++) {\n        Bcolj[k] = other.get(k, j);\n      }\n\n      for (let i = 0; i < m; i++) {\n        let s = 0;\n        for (let k = 0; k < n; k++) {\n          s += this.get(i, k) * Bcolj[k];\n        }\n\n        result.set(i, j, s);\n      }\n    }\n    return result;\n  }\n\n  strassen2x2(other) {\n    other = Matrix.checkMatrix(other);\n    let result = new Matrix(2, 2);\n    const a11 = this.get(0, 0);\n    const b11 = other.get(0, 0);\n    const a12 = this.get(0, 1);\n    const b12 = other.get(0, 1);\n    const a21 = this.get(1, 0);\n    const b21 = other.get(1, 0);\n    const a22 = this.get(1, 1);\n    const b22 = other.get(1, 1);\n\n    // Compute intermediate values.\n    const m1 = (a11 + a22) * (b11 + b22);\n    const m2 = (a21 + a22) * b11;\n    const m3 = a11 * (b12 - b22);\n    const m4 = a22 * (b21 - b11);\n    const m5 = (a11 + a12) * b22;\n    const m6 = (a21 - a11) * (b11 + b12);\n    const m7 = (a12 - a22) * (b21 + b22);\n\n    // Combine intermediate values into the output.\n    const c00 = m1 + m4 - m5 + m7;\n    const c01 = m3 + m5;\n    const c10 = m2 + m4;\n    const c11 = m1 - m2 + m3 + m6;\n\n    result.set(0, 0, c00);\n    result.set(0, 1, c01);\n    result.set(1, 0, c10);\n    result.set(1, 1, c11);\n    return result;\n  }\n\n  strassen3x3(other) {\n    other = Matrix.checkMatrix(other);\n    let result = new Matrix(3, 3);\n\n    const a00 = this.get(0, 0);\n    const a01 = this.get(0, 1);\n    const a02 = this.get(0, 2);\n    const a10 = this.get(1, 0);\n    const a11 = this.get(1, 1);\n    const a12 = this.get(1, 2);\n    const a20 = this.get(2, 0);\n    const a21 = this.get(2, 1);\n    const a22 = this.get(2, 2);\n\n    const b00 = other.get(0, 0);\n    const b01 = other.get(0, 1);\n    const b02 = other.get(0, 2);\n    const b10 = other.get(1, 0);\n    const b11 = other.get(1, 1);\n    const b12 = other.get(1, 2);\n    const b20 = other.get(2, 0);\n    const b21 = other.get(2, 1);\n    const b22 = other.get(2, 2);\n\n    const m1 = (a00 + a01 + a02 - a10 - a11 - a21 - a22) * b11;\n    const m2 = (a00 - a10) * (-b01 + b11);\n    const m3 = a11 * (-b00 + b01 + b10 - b11 - b12 - b20 + b22);\n    const m4 = (-a00 + a10 + a11) * (b00 - b01 + b11);\n    const m5 = (a10 + a11) * (-b00 + b01);\n    const m6 = a00 * b00;\n    const m7 = (-a00 + a20 + a21) * (b00 - b02 + b12);\n    const m8 = (-a00 + a20) * (b02 - b12);\n    const m9 = (a20 + a21) * (-b00 + b02);\n    const m10 = (a00 + a01 + a02 - a11 - a12 - a20 - a21) * b12;\n    const m11 = a21 * (-b00 + b02 + b10 - b11 - b12 - b20 + b21);\n    const m12 = (-a02 + a21 + a22) * (b11 + b20 - b21);\n    const m13 = (a02 - a22) * (b11 - b21);\n    const m14 = a02 * b20;\n    const m15 = (a21 + a22) * (-b20 + b21);\n    const m16 = (-a02 + a11 + a12) * (b12 + b20 - b22);\n    const m17 = (a02 - a12) * (b12 - b22);\n    const m18 = (a11 + a12) * (-b20 + b22);\n    const m19 = a01 * b10;\n    const m20 = a12 * b21;\n    const m21 = a10 * b02;\n    const m22 = a20 * b01;\n    const m23 = a22 * b22;\n\n    const c00 = m6 + m14 + m19;\n    const c01 = m1 + m4 + m5 + m6 + m12 + m14 + m15;\n    const c02 = m6 + m7 + m9 + m10 + m14 + m16 + m18;\n    const c10 = m2 + m3 + m4 + m6 + m14 + m16 + m17;\n    const c11 = m2 + m4 + m5 + m6 + m20;\n    const c12 = m14 + m16 + m17 + m18 + m21;\n    const c20 = m6 + m7 + m8 + m11 + m12 + m13 + m14;\n    const c21 = m12 + m13 + m14 + m15 + m22;\n    const c22 = m6 + m7 + m8 + m9 + m23;\n\n    result.set(0, 0, c00);\n    result.set(0, 1, c01);\n    result.set(0, 2, c02);\n    result.set(1, 0, c10);\n    result.set(1, 1, c11);\n    result.set(1, 2, c12);\n    result.set(2, 0, c20);\n    result.set(2, 1, c21);\n    result.set(2, 2, c22);\n    return result;\n  }\n\n  mmulStrassen(y) {\n    y = Matrix.checkMatrix(y);\n    let x = this.clone();\n    let r1 = x.rows;\n    let c1 = x.columns;\n    let r2 = y.rows;\n    let c2 = y.columns;\n    if (c1 !== r2) {\n      // eslint-disable-next-line no-console\n      console.warn(\n        `Multiplying ${r1} x ${c1} and ${r2} x ${c2} matrix: dimensions do not match.`,\n      );\n    }\n\n    // Put a matrix into the top left of a matrix of zeros.\n    // `rows` and `cols` are the dimensions of the output matrix.\n    function embed(mat, rows, cols) {\n      let r = mat.rows;\n      let c = mat.columns;\n      if (r === rows && c === cols) {\n        return mat;\n      } else {\n        let resultat = AbstractMatrix.zeros(rows, cols);\n        resultat = resultat.setSubMatrix(mat, 0, 0);\n        return resultat;\n      }\n    }\n\n    // Make sure both matrices are the same size.\n    // This is exclusively for simplicity:\n    // this algorithm can be implemented with matrices of different sizes.\n\n    let r = Math.max(r1, r2);\n    let c = Math.max(c1, c2);\n    x = embed(x, r, c);\n    y = embed(y, r, c);\n\n    // Our recursive multiplication function.\n    function blockMult(a, b, rows, cols) {\n      // For small matrices, resort to naive multiplication.\n      if (rows <= 512 || cols <= 512) {\n        return a.mmul(b); // a is equivalent to this\n      }\n\n      // Apply dynamic padding.\n      if (rows % 2 === 1 && cols % 2 === 1) {\n        a = embed(a, rows + 1, cols + 1);\n        b = embed(b, rows + 1, cols + 1);\n      } else if (rows % 2 === 1) {\n        a = embed(a, rows + 1, cols);\n        b = embed(b, rows + 1, cols);\n      } else if (cols % 2 === 1) {\n        a = embed(a, rows, cols + 1);\n        b = embed(b, rows, cols + 1);\n      }\n\n      let halfRows = parseInt(a.rows / 2, 10);\n      let halfCols = parseInt(a.columns / 2, 10);\n      // Subdivide input matrices.\n      let a11 = a.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n      let b11 = b.subMatrix(0, halfRows - 1, 0, halfCols - 1);\n\n      let a12 = a.subMatrix(0, halfRows - 1, halfCols, a.columns - 1);\n      let b12 = b.subMatrix(0, halfRows - 1, halfCols, b.columns - 1);\n\n      let a21 = a.subMatrix(halfRows, a.rows - 1, 0, halfCols - 1);\n      let b21 = b.subMatrix(halfRows, b.rows - 1, 0, halfCols - 1);\n\n      let a22 = a.subMatrix(halfRows, a.rows - 1, halfCols, a.columns - 1);\n      let b22 = b.subMatrix(halfRows, b.rows - 1, halfCols, b.columns - 1);\n\n      // Compute intermediate values.\n      let m1 = blockMult(\n        AbstractMatrix.add(a11, a22),\n        AbstractMatrix.add(b11, b22),\n        halfRows,\n        halfCols,\n      );\n      let m2 = blockMult(AbstractMatrix.add(a21, a22), b11, halfRows, halfCols);\n      let m3 = blockMult(a11, AbstractMatrix.sub(b12, b22), halfRows, halfCols);\n      let m4 = blockMult(a22, AbstractMatrix.sub(b21, b11), halfRows, halfCols);\n      let m5 = blockMult(AbstractMatrix.add(a11, a12), b22, halfRows, halfCols);\n      let m6 = blockMult(\n        AbstractMatrix.sub(a21, a11),\n        AbstractMatrix.add(b11, b12),\n        halfRows,\n        halfCols,\n      );\n      let m7 = blockMult(\n        AbstractMatrix.sub(a12, a22),\n        AbstractMatrix.add(b21, b22),\n        halfRows,\n        halfCols,\n      );\n\n      // Combine intermediate values into the output.\n      let c11 = AbstractMatrix.add(m1, m4);\n      c11.sub(m5);\n      c11.add(m7);\n      let c12 = AbstractMatrix.add(m3, m5);\n      let c21 = AbstractMatrix.add(m2, m4);\n      let c22 = AbstractMatrix.sub(m1, m2);\n      c22.add(m3);\n      c22.add(m6);\n\n      // Crop output to the desired size (undo dynamic padding).\n      let resultat = AbstractMatrix.zeros(2 * c11.rows, 2 * c11.columns);\n      resultat = resultat.setSubMatrix(c11, 0, 0);\n      resultat = resultat.setSubMatrix(c12, c11.rows, 0);\n      resultat = resultat.setSubMatrix(c21, 0, c11.columns);\n      resultat = resultat.setSubMatrix(c22, c11.rows, c11.columns);\n      return resultat.subMatrix(0, rows - 1, 0, cols - 1);\n    }\n\n    return blockMult(x, y, r, c);\n  }\n\n  scaleRows(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1 } = options;\n    if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n    if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let newMatrix = new Matrix(this.rows, this.columns);\n    for (let i = 0; i < this.rows; i++) {\n      const row = this.getRow(i);\n      if (row.length > 0) {\n        rescale(row, { min, max, output: row });\n      }\n      newMatrix.setRow(i, row);\n    }\n    return newMatrix;\n  }\n\n  scaleColumns(options = {}) {\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { min = 0, max = 1 } = options;\n    if (!Number.isFinite(min)) throw new TypeError('min must be a number');\n    if (!Number.isFinite(max)) throw new TypeError('max must be a number');\n    if (min >= max) throw new RangeError('min must be smaller than max');\n    let newMatrix = new Matrix(this.rows, this.columns);\n    for (let i = 0; i < this.columns; i++) {\n      const column = this.getColumn(i);\n      if (column.length) {\n        rescale(column, {\n          min: min,\n          max: max,\n          output: column,\n        });\n      }\n      newMatrix.setColumn(i, column);\n    }\n    return newMatrix;\n  }\n\n  flipRows() {\n    const middle = Math.ceil(this.columns / 2);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < middle; j++) {\n        let first = this.get(i, j);\n        let last = this.get(i, this.columns - 1 - j);\n        this.set(i, j, last);\n        this.set(i, this.columns - 1 - j, first);\n      }\n    }\n    return this;\n  }\n\n  flipColumns() {\n    const middle = Math.ceil(this.rows / 2);\n    for (let j = 0; j < this.columns; j++) {\n      for (let i = 0; i < middle; i++) {\n        let first = this.get(i, j);\n        let last = this.get(this.rows - 1 - i, j);\n        this.set(i, j, last);\n        this.set(this.rows - 1 - i, j, first);\n      }\n    }\n    return this;\n  }\n\n  kroneckerProduct(other) {\n    other = Matrix.checkMatrix(other);\n\n    let m = this.rows;\n    let n = this.columns;\n    let p = other.rows;\n    let q = other.columns;\n\n    let result = new Matrix(m * p, n * q);\n    for (let i = 0; i < m; i++) {\n      for (let j = 0; j < n; j++) {\n        for (let k = 0; k < p; k++) {\n          for (let l = 0; l < q; l++) {\n            result.set(p * i + k, q * j + l, this.get(i, j) * other.get(k, l));\n          }\n        }\n      }\n    }\n    return result;\n  }\n\n  kroneckerSum(other) {\n    other = Matrix.checkMatrix(other);\n    if (!this.isSquare() || !other.isSquare()) {\n      throw new Error('Kronecker Sum needs two Square Matrices');\n    }\n    let m = this.rows;\n    let n = other.rows;\n    let AxI = this.kroneckerProduct(Matrix.eye(n, n));\n    let IxB = Matrix.eye(m, m).kroneckerProduct(other);\n    return AxI.add(IxB);\n  }\n\n  transpose() {\n    let result = new Matrix(this.columns, this.rows);\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        result.set(j, i, this.get(i, j));\n      }\n    }\n    return result;\n  }\n\n  sortRows(compareFunction = compareNumbers) {\n    for (let i = 0; i < this.rows; i++) {\n      this.setRow(i, this.getRow(i).sort(compareFunction));\n    }\n    return this;\n  }\n\n  sortColumns(compareFunction = compareNumbers) {\n    for (let i = 0; i < this.columns; i++) {\n      this.setColumn(i, this.getColumn(i).sort(compareFunction));\n    }\n    return this;\n  }\n\n  subMatrix(startRow, endRow, startColumn, endColumn) {\n    checkRange(this, startRow, endRow, startColumn, endColumn);\n    let newMatrix = new Matrix(\n      endRow - startRow + 1,\n      endColumn - startColumn + 1,\n    );\n    for (let i = startRow; i <= endRow; i++) {\n      for (let j = startColumn; j <= endColumn; j++) {\n        newMatrix.set(i - startRow, j - startColumn, this.get(i, j));\n      }\n    }\n    return newMatrix;\n  }\n\n  subMatrixRow(indices, startColumn, endColumn) {\n    if (startColumn === undefined) startColumn = 0;\n    if (endColumn === undefined) endColumn = this.columns - 1;\n    if (\n      startColumn > endColumn ||\n      startColumn < 0 ||\n      startColumn >= this.columns ||\n      endColumn < 0 ||\n      endColumn >= this.columns\n    ) {\n      throw new RangeError('Argument out of range');\n    }\n\n    let newMatrix = new Matrix(indices.length, endColumn - startColumn + 1);\n    for (let i = 0; i < indices.length; i++) {\n      for (let j = startColumn; j <= endColumn; j++) {\n        if (indices[i] < 0 || indices[i] >= this.rows) {\n          throw new RangeError(`Row index out of range: ${indices[i]}`);\n        }\n        newMatrix.set(i, j - startColumn, this.get(indices[i], j));\n      }\n    }\n    return newMatrix;\n  }\n\n  subMatrixColumn(indices, startRow, endRow) {\n    if (startRow === undefined) startRow = 0;\n    if (endRow === undefined) endRow = this.rows - 1;\n    if (\n      startRow > endRow ||\n      startRow < 0 ||\n      startRow >= this.rows ||\n      endRow < 0 ||\n      endRow >= this.rows\n    ) {\n      throw new RangeError('Argument out of range');\n    }\n\n    let newMatrix = new Matrix(endRow - startRow + 1, indices.length);\n    for (let i = 0; i < indices.length; i++) {\n      for (let j = startRow; j <= endRow; j++) {\n        if (indices[i] < 0 || indices[i] >= this.columns) {\n          throw new RangeError(`Column index out of range: ${indices[i]}`);\n        }\n        newMatrix.set(j - startRow, i, this.get(j, indices[i]));\n      }\n    }\n    return newMatrix;\n  }\n\n  setSubMatrix(matrix, startRow, startColumn) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (matrix.isEmpty()) {\n      return this;\n    }\n    let endRow = startRow + matrix.rows - 1;\n    let endColumn = startColumn + matrix.columns - 1;\n    checkRange(this, startRow, endRow, startColumn, endColumn);\n    for (let i = 0; i < matrix.rows; i++) {\n      for (let j = 0; j < matrix.columns; j++) {\n        this.set(startRow + i, startColumn + j, matrix.get(i, j));\n      }\n    }\n    return this;\n  }\n\n  selection(rowIndices, columnIndices) {\n    checkRowIndices(this, rowIndices);\n    checkColumnIndices(this, columnIndices);\n    let newMatrix = new Matrix(rowIndices.length, columnIndices.length);\n    for (let i = 0; i < rowIndices.length; i++) {\n      let rowIndex = rowIndices[i];\n      for (let j = 0; j < columnIndices.length; j++) {\n        let columnIndex = columnIndices[j];\n        newMatrix.set(i, j, this.get(rowIndex, columnIndex));\n      }\n    }\n    return newMatrix;\n  }\n\n  trace() {\n    let min = Math.min(this.rows, this.columns);\n    let trace = 0;\n    for (let i = 0; i < min; i++) {\n      trace += this.get(i, i);\n    }\n    return trace;\n  }\n\n  clone() {\n    let newMatrix = new Matrix(this.rows, this.columns);\n    for (let row = 0; row < this.rows; row++) {\n      for (let column = 0; column < this.columns; column++) {\n        newMatrix.set(row, column, this.get(row, column));\n      }\n    }\n    return newMatrix;\n  }\n\n  sum(by) {\n    switch (by) {\n      case 'row':\n        return sumByRow(this);\n      case 'column':\n        return sumByColumn(this);\n      case undefined:\n        return sumAll(this);\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  product(by) {\n    switch (by) {\n      case 'row':\n        return productByRow(this);\n      case 'column':\n        return productByColumn(this);\n      case undefined:\n        return productAll(this);\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  mean(by) {\n    const sum = this.sum(by);\n    switch (by) {\n      case 'row': {\n        for (let i = 0; i < this.rows; i++) {\n          sum[i] /= this.columns;\n        }\n        return sum;\n      }\n      case 'column': {\n        for (let i = 0; i < this.columns; i++) {\n          sum[i] /= this.rows;\n        }\n        return sum;\n      }\n      case undefined:\n        return sum / this.size;\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  variance(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { unbiased = true, mean = this.mean(by) } = options;\n    if (typeof unbiased !== 'boolean') {\n      throw new TypeError('unbiased must be a boolean');\n    }\n    switch (by) {\n      case 'row': {\n        if (!isAnyArray(mean)) {\n          throw new TypeError('mean must be an array');\n        }\n        return varianceByRow(this, unbiased, mean);\n      }\n      case 'column': {\n        if (!isAnyArray(mean)) {\n          throw new TypeError('mean must be an array');\n        }\n        return varianceByColumn(this, unbiased, mean);\n      }\n      case undefined: {\n        if (typeof mean !== 'number') {\n          throw new TypeError('mean must be a number');\n        }\n        return varianceAll(this, unbiased, mean);\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  standardDeviation(by, options) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    const variance = this.variance(by, options);\n    if (by === undefined) {\n      return Math.sqrt(variance);\n    } else {\n      for (let i = 0; i < variance.length; i++) {\n        variance[i] = Math.sqrt(variance[i]);\n      }\n      return variance;\n    }\n  }\n\n  center(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    const { center = this.mean(by) } = options;\n    switch (by) {\n      case 'row': {\n        if (!isAnyArray(center)) {\n          throw new TypeError('center must be an array');\n        }\n        centerByRow(this, center);\n        return this;\n      }\n      case 'column': {\n        if (!isAnyArray(center)) {\n          throw new TypeError('center must be an array');\n        }\n        centerByColumn(this, center);\n        return this;\n      }\n      case undefined: {\n        if (typeof center !== 'number') {\n          throw new TypeError('center must be a number');\n        }\n        centerAll(this, center);\n        return this;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  scale(by, options = {}) {\n    if (typeof by === 'object') {\n      options = by;\n      by = undefined;\n    }\n    if (typeof options !== 'object') {\n      throw new TypeError('options must be an object');\n    }\n    let scale = options.scale;\n    switch (by) {\n      case 'row': {\n        if (scale === undefined) {\n          scale = getScaleByRow(this);\n        } else if (!isAnyArray(scale)) {\n          throw new TypeError('scale must be an array');\n        }\n        scaleByRow(this, scale);\n        return this;\n      }\n      case 'column': {\n        if (scale === undefined) {\n          scale = getScaleByColumn(this);\n        } else if (!isAnyArray(scale)) {\n          throw new TypeError('scale must be an array');\n        }\n        scaleByColumn(this, scale);\n        return this;\n      }\n      case undefined: {\n        if (scale === undefined) {\n          scale = getScaleAll(this);\n        } else if (typeof scale !== 'number') {\n          throw new TypeError('scale must be a number');\n        }\n        scaleAll(this, scale);\n        return this;\n      }\n      default:\n        throw new Error(`invalid option: ${by}`);\n    }\n  }\n\n  toString(options) {\n    return inspectMatrixWithOptions(this, options);\n  }\n}\n\nAbstractMatrix.prototype.klass = 'Matrix';\nif (typeof Symbol !== 'undefined') {\n  AbstractMatrix.prototype[Symbol.for('nodejs.util.inspect.custom')] =\n    inspectMatrix;\n}\n\nfunction compareNumbers(a, b) {\n  return a - b;\n}\n\nfunction isArrayOfNumbers(array) {\n  return array.every((element) => {\n    return typeof element === 'number';\n  });\n}\n\n// Synonyms\nAbstractMatrix.random = AbstractMatrix.rand;\nAbstractMatrix.randomInt = AbstractMatrix.randInt;\nAbstractMatrix.diagonal = AbstractMatrix.diag;\nAbstractMatrix.prototype.diagonal = AbstractMatrix.prototype.diag;\nAbstractMatrix.identity = AbstractMatrix.eye;\nAbstractMatrix.prototype.negate = AbstractMatrix.prototype.neg;\nAbstractMatrix.prototype.tensorProduct =\n  AbstractMatrix.prototype.kroneckerProduct;\n\nexport default class Matrix extends AbstractMatrix {\n  constructor(nRows, nColumns) {\n    super();\n    if (Matrix.isMatrix(nRows)) {\n      // eslint-disable-next-line no-constructor-return\n      return nRows.clone();\n    } else if (Number.isInteger(nRows) && nRows >= 0) {\n      // Create an empty matrix\n      this.data = [];\n      if (Number.isInteger(nColumns) && nColumns >= 0) {\n        for (let i = 0; i < nRows; i++) {\n          this.data.push(new Float64Array(nColumns));\n        }\n      } else {\n        throw new TypeError('nColumns must be a positive integer');\n      }\n    } else if (isAnyArray(nRows)) {\n      // Copy the values from the 2D array\n      const arrayData = nRows;\n      nRows = arrayData.length;\n      nColumns = nRows ? arrayData[0].length : 0;\n      if (typeof nColumns !== 'number') {\n        throw new TypeError(\n          'Data must be a 2D array with at least one element',\n        );\n      }\n      this.data = [];\n      for (let i = 0; i < nRows; i++) {\n        if (arrayData[i].length !== nColumns) {\n          throw new RangeError('Inconsistent array dimensions');\n        }\n        if (!isArrayOfNumbers(arrayData[i])) {\n          throw new TypeError('Input data contains non-numeric values');\n        }\n        this.data.push(Float64Array.from(arrayData[i]));\n      }\n    } else {\n      throw new TypeError(\n        'First argument must be a positive number or an array',\n      );\n    }\n    this.rows = nRows;\n    this.columns = nColumns;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.data[rowIndex][columnIndex] = value;\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.data[rowIndex][columnIndex];\n  }\n\n  removeRow(index) {\n    checkRowIndex(this, index);\n    this.data.splice(index, 1);\n    this.rows -= 1;\n    return this;\n  }\n\n  addRow(index, array) {\n    if (array === undefined) {\n      array = index;\n      index = this.rows;\n    }\n    checkRowIndex(this, index, true);\n    array = Float64Array.from(checkRowVector(this, array));\n    this.data.splice(index, 0, array);\n    this.rows += 1;\n    return this;\n  }\n\n  removeColumn(index) {\n    checkColumnIndex(this, index);\n    for (let i = 0; i < this.rows; i++) {\n      const newRow = new Float64Array(this.columns - 1);\n      for (let j = 0; j < index; j++) {\n        newRow[j] = this.data[i][j];\n      }\n      for (let j = index + 1; j < this.columns; j++) {\n        newRow[j - 1] = this.data[i][j];\n      }\n      this.data[i] = newRow;\n    }\n    this.columns -= 1;\n    return this;\n  }\n\n  addColumn(index, array) {\n    if (typeof array === 'undefined') {\n      array = index;\n      index = this.columns;\n    }\n    checkColumnIndex(this, index, true);\n    array = checkColumnVector(this, array);\n    for (let i = 0; i < this.rows; i++) {\n      const newRow = new Float64Array(this.columns + 1);\n      let j = 0;\n      for (; j < index; j++) {\n        newRow[j] = this.data[i][j];\n      }\n      newRow[j++] = array[i];\n      for (; j < this.columns + 1; j++) {\n        newRow[j] = this.data[i][j - 1];\n      }\n      this.data[i] = newRow;\n    }\n    this.columns += 1;\n    return this;\n  }\n}\n\ninstallMathOperations(AbstractMatrix, Matrix);\n","import { newArray } from './util';\n\nexport function sumByRow(matrix) {\n  let sum = newArray(matrix.rows);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[i] += matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nexport function sumByColumn(matrix) {\n  let sum = newArray(matrix.columns);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[j] += matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nexport function sumAll(matrix) {\n  let v = 0;\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      v += matrix.get(i, j);\n    }\n  }\n  return v;\n}\n\nexport function productByRow(matrix) {\n  let sum = newArray(matrix.rows, 1);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[i] *= matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nexport function productByColumn(matrix) {\n  let sum = newArray(matrix.columns, 1);\n  for (let i = 0; i < matrix.rows; ++i) {\n    for (let j = 0; j < matrix.columns; ++j) {\n      sum[j] *= matrix.get(i, j);\n    }\n  }\n  return sum;\n}\n\nexport function productAll(matrix) {\n  let v = 1;\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      v *= matrix.get(i, j);\n    }\n  }\n  return v;\n}\n\nexport function varianceByRow(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const variance = [];\n\n  for (let i = 0; i < rows; i++) {\n    let sum1 = 0;\n    let sum2 = 0;\n    let x = 0;\n    for (let j = 0; j < cols; j++) {\n      x = matrix.get(i, j) - mean[i];\n      sum1 += x;\n      sum2 += x * x;\n    }\n    if (unbiased) {\n      variance.push((sum2 - (sum1 * sum1) / cols) / (cols - 1));\n    } else {\n      variance.push((sum2 - (sum1 * sum1) / cols) / cols);\n    }\n  }\n  return variance;\n}\n\nexport function varianceByColumn(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const variance = [];\n\n  for (let j = 0; j < cols; j++) {\n    let sum1 = 0;\n    let sum2 = 0;\n    let x = 0;\n    for (let i = 0; i < rows; i++) {\n      x = matrix.get(i, j) - mean[j];\n      sum1 += x;\n      sum2 += x * x;\n    }\n    if (unbiased) {\n      variance.push((sum2 - (sum1 * sum1) / rows) / (rows - 1));\n    } else {\n      variance.push((sum2 - (sum1 * sum1) / rows) / rows);\n    }\n  }\n  return variance;\n}\n\nexport function varianceAll(matrix, unbiased, mean) {\n  const rows = matrix.rows;\n  const cols = matrix.columns;\n  const size = rows * cols;\n\n  let sum1 = 0;\n  let sum2 = 0;\n  let x = 0;\n  for (let i = 0; i < rows; i++) {\n    for (let j = 0; j < cols; j++) {\n      x = matrix.get(i, j) - mean;\n      sum1 += x;\n      sum2 += x * x;\n    }\n  }\n  if (unbiased) {\n    return (sum2 - (sum1 * sum1) / size) / (size - 1);\n  } else {\n    return (sum2 - (sum1 * sum1) / size) / size;\n  }\n}\n\nexport function centerByRow(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean[i]);\n    }\n  }\n}\n\nexport function centerByColumn(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean[j]);\n    }\n  }\n}\n\nexport function centerAll(matrix, mean) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) - mean);\n    }\n  }\n}\n\nexport function getScaleByRow(matrix) {\n  const scale = [];\n  for (let i = 0; i < matrix.rows; i++) {\n    let sum = 0;\n    for (let j = 0; j < matrix.columns; j++) {\n      sum += Math.pow(matrix.get(i, j), 2) / (matrix.columns - 1);\n    }\n    scale.push(Math.sqrt(sum));\n  }\n  return scale;\n}\n\nexport function scaleByRow(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale[i]);\n    }\n  }\n}\n\nexport function getScaleByColumn(matrix) {\n  const scale = [];\n  for (let j = 0; j < matrix.columns; j++) {\n    let sum = 0;\n    for (let i = 0; i < matrix.rows; i++) {\n      sum += Math.pow(matrix.get(i, j), 2) / (matrix.rows - 1);\n    }\n    scale.push(Math.sqrt(sum));\n  }\n  return scale;\n}\n\nexport function scaleByColumn(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale[j]);\n    }\n  }\n}\n\nexport function getScaleAll(matrix) {\n  const divider = matrix.size - 1;\n  let sum = 0;\n  for (let j = 0; j < matrix.columns; j++) {\n    for (let i = 0; i < matrix.rows; i++) {\n      sum += Math.pow(matrix.get(i, j), 2) / divider;\n    }\n  }\n  return Math.sqrt(sum);\n}\n\nexport function scaleAll(matrix, scale) {\n  for (let i = 0; i < matrix.rows; i++) {\n    for (let j = 0; j < matrix.columns; j++) {\n      matrix.set(i, j, matrix.get(i, j) / scale);\n    }\n  }\n}\n","export function installMathOperations(AbstractMatrix, Matrix) {\n  AbstractMatrix.prototype.add = function add(value) {\n    if (typeof value === 'number') return this.addS(value);\n    return this.addM(value);\n  };\n\n  AbstractMatrix.prototype.addS = function addS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.addM = function addM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) + matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.add = function add(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.add(value);\n  };\n\n  AbstractMatrix.prototype.sub = function sub(value) {\n    if (typeof value === 'number') return this.subS(value);\n    return this.subM(value);\n  };\n\n  AbstractMatrix.prototype.subS = function subS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.subM = function subM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) - matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sub = function sub(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sub(value);\n  };\n  AbstractMatrix.prototype.subtract = AbstractMatrix.prototype.sub;\n  AbstractMatrix.prototype.subtractS = AbstractMatrix.prototype.subS;\n  AbstractMatrix.prototype.subtractM = AbstractMatrix.prototype.subM;\n  AbstractMatrix.subtract = AbstractMatrix.sub;\n\n  AbstractMatrix.prototype.mul = function mul(value) {\n    if (typeof value === 'number') return this.mulS(value);\n    return this.mulM(value);\n  };\n\n  AbstractMatrix.prototype.mulS = function mulS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.mulM = function mulM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) * matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.mul = function mul(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.mul(value);\n  };\n  AbstractMatrix.prototype.multiply = AbstractMatrix.prototype.mul;\n  AbstractMatrix.prototype.multiplyS = AbstractMatrix.prototype.mulS;\n  AbstractMatrix.prototype.multiplyM = AbstractMatrix.prototype.mulM;\n  AbstractMatrix.multiply = AbstractMatrix.mul;\n\n  AbstractMatrix.prototype.div = function div(value) {\n    if (typeof value === 'number') return this.divS(value);\n    return this.divM(value);\n  };\n\n  AbstractMatrix.prototype.divS = function divS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.divM = function divM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) / matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.div = function div(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.div(value);\n  };\n  AbstractMatrix.prototype.divide = AbstractMatrix.prototype.div;\n  AbstractMatrix.prototype.divideS = AbstractMatrix.prototype.divS;\n  AbstractMatrix.prototype.divideM = AbstractMatrix.prototype.divM;\n  AbstractMatrix.divide = AbstractMatrix.div;\n\n  AbstractMatrix.prototype.mod = function mod(value) {\n    if (typeof value === 'number') return this.modS(value);\n    return this.modM(value);\n  };\n\n  AbstractMatrix.prototype.modS = function modS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) % value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.modM = function modM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) % matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.mod = function mod(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.mod(value);\n  };\n  AbstractMatrix.prototype.modulus = AbstractMatrix.prototype.mod;\n  AbstractMatrix.prototype.modulusS = AbstractMatrix.prototype.modS;\n  AbstractMatrix.prototype.modulusM = AbstractMatrix.prototype.modM;\n  AbstractMatrix.modulus = AbstractMatrix.mod;\n\n  AbstractMatrix.prototype.and = function and(value) {\n    if (typeof value === 'number') return this.andS(value);\n    return this.andM(value);\n  };\n\n  AbstractMatrix.prototype.andS = function andS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) & value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.andM = function andM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) & matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.and = function and(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.and(value);\n  };\n\n  AbstractMatrix.prototype.or = function or(value) {\n    if (typeof value === 'number') return this.orS(value);\n    return this.orM(value);\n  };\n\n  AbstractMatrix.prototype.orS = function orS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) | value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.orM = function orM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) | matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.or = function or(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.or(value);\n  };\n\n  AbstractMatrix.prototype.xor = function xor(value) {\n    if (typeof value === 'number') return this.xorS(value);\n    return this.xorM(value);\n  };\n\n  AbstractMatrix.prototype.xorS = function xorS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) ^ value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.xorM = function xorM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) ^ matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.xor = function xor(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.xor(value);\n  };\n\n  AbstractMatrix.prototype.leftShift = function leftShift(value) {\n    if (typeof value === 'number') return this.leftShiftS(value);\n    return this.leftShiftM(value);\n  };\n\n  AbstractMatrix.prototype.leftShiftS = function leftShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) << value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.leftShiftM = function leftShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) << matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.leftShift = function leftShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.leftShift(value);\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShift = function signPropagatingRightShift(value) {\n    if (typeof value === 'number') return this.signPropagatingRightShiftS(value);\n    return this.signPropagatingRightShiftM(value);\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShiftS = function signPropagatingRightShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >> value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.signPropagatingRightShiftM = function signPropagatingRightShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >> matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.signPropagatingRightShift = function signPropagatingRightShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.signPropagatingRightShift(value);\n  };\n\n  AbstractMatrix.prototype.rightShift = function rightShift(value) {\n    if (typeof value === 'number') return this.rightShiftS(value);\n    return this.rightShiftM(value);\n  };\n\n  AbstractMatrix.prototype.rightShiftS = function rightShiftS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >>> value);\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.rightShiftM = function rightShiftM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, this.get(i, j) >>> matrix.get(i, j));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.rightShift = function rightShift(matrix, value) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.rightShift(value);\n  };\n  AbstractMatrix.prototype.zeroFillRightShift = AbstractMatrix.prototype.rightShift;\n  AbstractMatrix.prototype.zeroFillRightShiftS = AbstractMatrix.prototype.rightShiftS;\n  AbstractMatrix.prototype.zeroFillRightShiftM = AbstractMatrix.prototype.rightShiftM;\n  AbstractMatrix.zeroFillRightShift = AbstractMatrix.rightShift;\n\n  AbstractMatrix.prototype.not = function not() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, ~(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.not = function not(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.not();\n  };\n\n  AbstractMatrix.prototype.abs = function abs() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.abs(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.abs = function abs(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.abs();\n  };\n\n  AbstractMatrix.prototype.acos = function acos() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.acos(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.acos = function acos(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.acos();\n  };\n\n  AbstractMatrix.prototype.acosh = function acosh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.acosh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.acosh = function acosh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.acosh();\n  };\n\n  AbstractMatrix.prototype.asin = function asin() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.asin(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.asin = function asin(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.asin();\n  };\n\n  AbstractMatrix.prototype.asinh = function asinh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.asinh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.asinh = function asinh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.asinh();\n  };\n\n  AbstractMatrix.prototype.atan = function atan() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.atan(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.atan = function atan(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.atan();\n  };\n\n  AbstractMatrix.prototype.atanh = function atanh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.atanh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.atanh = function atanh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.atanh();\n  };\n\n  AbstractMatrix.prototype.cbrt = function cbrt() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cbrt(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cbrt = function cbrt(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cbrt();\n  };\n\n  AbstractMatrix.prototype.ceil = function ceil() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.ceil(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.ceil = function ceil(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.ceil();\n  };\n\n  AbstractMatrix.prototype.clz32 = function clz32() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.clz32(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.clz32 = function clz32(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.clz32();\n  };\n\n  AbstractMatrix.prototype.cos = function cos() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cos(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cos = function cos(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cos();\n  };\n\n  AbstractMatrix.prototype.cosh = function cosh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.cosh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.cosh = function cosh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.cosh();\n  };\n\n  AbstractMatrix.prototype.exp = function exp() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.exp(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.exp = function exp(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.exp();\n  };\n\n  AbstractMatrix.prototype.expm1 = function expm1() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.expm1(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.expm1 = function expm1(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.expm1();\n  };\n\n  AbstractMatrix.prototype.floor = function floor() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.floor(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.floor = function floor(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.floor();\n  };\n\n  AbstractMatrix.prototype.fround = function fround() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.fround(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.fround = function fround(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.fround();\n  };\n\n  AbstractMatrix.prototype.log = function log() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log = function log(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log();\n  };\n\n  AbstractMatrix.prototype.log1p = function log1p() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log1p(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log1p = function log1p(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log1p();\n  };\n\n  AbstractMatrix.prototype.log10 = function log10() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log10(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log10 = function log10(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log10();\n  };\n\n  AbstractMatrix.prototype.log2 = function log2() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.log2(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.log2 = function log2(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.log2();\n  };\n\n  AbstractMatrix.prototype.round = function round() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.round(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.round = function round(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.round();\n  };\n\n  AbstractMatrix.prototype.sign = function sign() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sign(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sign = function sign(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sign();\n  };\n\n  AbstractMatrix.prototype.sin = function sin() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sin(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sin = function sin(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sin();\n  };\n\n  AbstractMatrix.prototype.sinh = function sinh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sinh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sinh = function sinh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sinh();\n  };\n\n  AbstractMatrix.prototype.sqrt = function sqrt() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.sqrt(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.sqrt = function sqrt(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.sqrt();\n  };\n\n  AbstractMatrix.prototype.tan = function tan() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.tan(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.tan = function tan(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.tan();\n  };\n\n  AbstractMatrix.prototype.tanh = function tanh() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.tanh(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.tanh = function tanh(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.tanh();\n  };\n\n  AbstractMatrix.prototype.trunc = function trunc() {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.trunc(this.get(i, j)));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.trunc = function trunc(matrix) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.trunc();\n  };\n\n  AbstractMatrix.pow = function pow(matrix, arg0) {\n    const newMatrix = new Matrix(matrix);\n    return newMatrix.pow(arg0);\n  };\n\n  AbstractMatrix.prototype.pow = function pow(value) {\n    if (typeof value === 'number') return this.powS(value);\n    return this.powM(value);\n  };\n\n  AbstractMatrix.prototype.powS = function powS(value) {\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.pow(this.get(i, j), value));\n      }\n    }\n    return this;\n  };\n\n  AbstractMatrix.prototype.powM = function powM(matrix) {\n    matrix = Matrix.checkMatrix(matrix);\n    if (this.rows !== matrix.rows ||\n      this.columns !== matrix.columns) {\n      throw new RangeError('Matrices dimensions must be equal');\n    }\n    for (let i = 0; i < this.rows; i++) {\n      for (let j = 0; j < this.columns; j++) {\n        this.set(i, j, Math.pow(this.get(i, j), matrix.get(i, j)));\n      }\n    }\n    return this;\n  };\n}\n","import { AbstractMatrix } from '../matrix';\n\nexport default class WrapperMatrix2D extends AbstractMatrix {\n  constructor(data) {\n    super();\n    this.data = data;\n    this.rows = data.length;\n    this.columns = data[0].length;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.data[rowIndex][columnIndex] = value;\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.data[rowIndex][columnIndex];\n  }\n}\n","export function hypotenuse(a, b) {\n  let r = 0;\n  if (Math.abs(a) > Math.abs(b)) {\n    r = b / a;\n    return Math.abs(a) * Math.sqrt(1 + r * r);\n  }\n  if (b !== 0) {\n    r = a / b;\n    return Math.abs(b) * Math.sqrt(1 + r * r);\n  }\n  return 0;\n}\n","import Matrix from '../matrix';\nimport WrapperMatrix2D from '../wrap/WrapperMatrix2D';\n\nimport { hypotenuse } from './util';\n\nexport default class SingularValueDecomposition {\n  constructor(value, options = {}) {\n    value = WrapperMatrix2D.checkMatrix(value);\n\n    if (value.isEmpty()) {\n      throw new Error('Matrix must be non-empty');\n    }\n\n    let m = value.rows;\n    let n = value.columns;\n\n    const {\n      computeLeftSingularVectors = true,\n      computeRightSingularVectors = true,\n      autoTranspose = false,\n    } = options;\n\n    let wantu = Boolean(computeLeftSingularVectors);\n    let wantv = Boolean(computeRightSingularVectors);\n\n    let swapped = false;\n    let a;\n    if (m < n) {\n      if (!autoTranspose) {\n        a = value.clone();\n        // eslint-disable-next-line no-console\n        console.warn(\n          'Computing SVD on a matrix with more columns than rows. Consider enabling autoTranspose',\n        );\n      } else {\n        a = value.transpose();\n        m = a.rows;\n        n = a.columns;\n        swapped = true;\n        let aux = wantu;\n        wantu = wantv;\n        wantv = aux;\n      }\n    } else {\n      a = value.clone();\n    }\n\n    let nu = Math.min(m, n);\n    let ni = Math.min(m + 1, n);\n    let s = new Float64Array(ni);\n    let U = new Matrix(m, nu);\n    let V = new Matrix(n, n);\n\n    let e = new Float64Array(n);\n    let work = new Float64Array(m);\n\n    let si = new Float64Array(ni);\n    for (let i = 0; i < ni; i++) si[i] = i;\n\n    let nct = Math.min(m - 1, n);\n    let nrt = Math.max(0, Math.min(n - 2, m));\n    let mrc = Math.max(nct, nrt);\n\n    for (let k = 0; k < mrc; k++) {\n      if (k < nct) {\n        s[k] = 0;\n        for (let i = k; i < m; i++) {\n          s[k] = hypotenuse(s[k], a.get(i, k));\n        }\n        if (s[k] !== 0) {\n          if (a.get(k, k) < 0) {\n            s[k] = -s[k];\n          }\n          for (let i = k; i < m; i++) {\n            a.set(i, k, a.get(i, k) / s[k]);\n          }\n          a.set(k, k, a.get(k, k) + 1);\n        }\n        s[k] = -s[k];\n      }\n\n      for (let j = k + 1; j < n; j++) {\n        if (k < nct && s[k] !== 0) {\n          let t = 0;\n          for (let i = k; i < m; i++) {\n            t += a.get(i, k) * a.get(i, j);\n          }\n          t = -t / a.get(k, k);\n          for (let i = k; i < m; i++) {\n            a.set(i, j, a.get(i, j) + t * a.get(i, k));\n          }\n        }\n        e[j] = a.get(k, j);\n      }\n\n      if (wantu && k < nct) {\n        for (let i = k; i < m; i++) {\n          U.set(i, k, a.get(i, k));\n        }\n      }\n\n      if (k < nrt) {\n        e[k] = 0;\n        for (let i = k + 1; i < n; i++) {\n          e[k] = hypotenuse(e[k], e[i]);\n        }\n        if (e[k] !== 0) {\n          if (e[k + 1] < 0) {\n            e[k] = 0 - e[k];\n          }\n          for (let i = k + 1; i < n; i++) {\n            e[i] /= e[k];\n          }\n          e[k + 1] += 1;\n        }\n        e[k] = -e[k];\n        if (k + 1 < m && e[k] !== 0) {\n          for (let i = k + 1; i < m; i++) {\n            work[i] = 0;\n          }\n          for (let i = k + 1; i < m; i++) {\n            for (let j = k + 1; j < n; j++) {\n              work[i] += e[j] * a.get(i, j);\n            }\n          }\n          for (let j = k + 1; j < n; j++) {\n            let t = -e[j] / e[k + 1];\n            for (let i = k + 1; i < m; i++) {\n              a.set(i, j, a.get(i, j) + t * work[i]);\n            }\n          }\n        }\n        if (wantv) {\n          for (let i = k + 1; i < n; i++) {\n            V.set(i, k, e[i]);\n          }\n        }\n      }\n    }\n\n    let p = Math.min(n, m + 1);\n    if (nct < n) {\n      s[nct] = a.get(nct, nct);\n    }\n    if (m < p) {\n      s[p - 1] = 0;\n    }\n    if (nrt + 1 < p) {\n      e[nrt] = a.get(nrt, p - 1);\n    }\n    e[p - 1] = 0;\n\n    if (wantu) {\n      for (let j = nct; j < nu; j++) {\n        for (let i = 0; i < m; i++) {\n          U.set(i, j, 0);\n        }\n        U.set(j, j, 1);\n      }\n      for (let k = nct - 1; k >= 0; k--) {\n        if (s[k] !== 0) {\n          for (let j = k + 1; j < nu; j++) {\n            let t = 0;\n            for (let i = k; i < m; i++) {\n              t += U.get(i, k) * U.get(i, j);\n            }\n            t = -t / U.get(k, k);\n            for (let i = k; i < m; i++) {\n              U.set(i, j, U.get(i, j) + t * U.get(i, k));\n            }\n          }\n          for (let i = k; i < m; i++) {\n            U.set(i, k, -U.get(i, k));\n          }\n          U.set(k, k, 1 + U.get(k, k));\n          for (let i = 0; i < k - 1; i++) {\n            U.set(i, k, 0);\n          }\n        } else {\n          for (let i = 0; i < m; i++) {\n            U.set(i, k, 0);\n          }\n          U.set(k, k, 1);\n        }\n      }\n    }\n\n    if (wantv) {\n      for (let k = n - 1; k >= 0; k--) {\n        if (k < nrt && e[k] !== 0) {\n          for (let j = k + 1; j < n; j++) {\n            let t = 0;\n            for (let i = k + 1; i < n; i++) {\n              t += V.get(i, k) * V.get(i, j);\n            }\n            t = -t / V.get(k + 1, k);\n            for (let i = k + 1; i < n; i++) {\n              V.set(i, j, V.get(i, j) + t * V.get(i, k));\n            }\n          }\n        }\n        for (let i = 0; i < n; i++) {\n          V.set(i, k, 0);\n        }\n        V.set(k, k, 1);\n      }\n    }\n\n    let pp = p - 1;\n    let iter = 0;\n    let eps = Number.EPSILON;\n    while (p > 0) {\n      let k, kase;\n      for (k = p - 2; k >= -1; k--) {\n        if (k === -1) {\n          break;\n        }\n        const alpha =\n          Number.MIN_VALUE + eps * Math.abs(s[k] + Math.abs(s[k + 1]));\n        if (Math.abs(e[k]) <= alpha || Number.isNaN(e[k])) {\n          e[k] = 0;\n          break;\n        }\n      }\n      if (k === p - 2) {\n        kase = 4;\n      } else {\n        let ks;\n        for (ks = p - 1; ks >= k; ks--) {\n          if (ks === k) {\n            break;\n          }\n          let t =\n            (ks !== p ? Math.abs(e[ks]) : 0) +\n            (ks !== k + 1 ? Math.abs(e[ks - 1]) : 0);\n          if (Math.abs(s[ks]) <= eps * t) {\n            s[ks] = 0;\n            break;\n          }\n        }\n        if (ks === k) {\n          kase = 3;\n        } else if (ks === p - 1) {\n          kase = 1;\n        } else {\n          kase = 2;\n          k = ks;\n        }\n      }\n\n      k++;\n\n      switch (kase) {\n        case 1: {\n          let f = e[p - 2];\n          e[p - 2] = 0;\n          for (let j = p - 2; j >= k; j--) {\n            let t = hypotenuse(s[j], f);\n            let cs = s[j] / t;\n            let sn = f / t;\n            s[j] = t;\n            if (j !== k) {\n              f = -sn * e[j - 1];\n              e[j - 1] = cs * e[j - 1];\n            }\n            if (wantv) {\n              for (let i = 0; i < n; i++) {\n                t = cs * V.get(i, j) + sn * V.get(i, p - 1);\n                V.set(i, p - 1, -sn * V.get(i, j) + cs * V.get(i, p - 1));\n                V.set(i, j, t);\n              }\n            }\n          }\n          break;\n        }\n        case 2: {\n          let f = e[k - 1];\n          e[k - 1] = 0;\n          for (let j = k; j < p; j++) {\n            let t = hypotenuse(s[j], f);\n            let cs = s[j] / t;\n            let sn = f / t;\n            s[j] = t;\n            f = -sn * e[j];\n            e[j] = cs * e[j];\n            if (wantu) {\n              for (let i = 0; i < m; i++) {\n                t = cs * U.get(i, j) + sn * U.get(i, k - 1);\n                U.set(i, k - 1, -sn * U.get(i, j) + cs * U.get(i, k - 1));\n                U.set(i, j, t);\n              }\n            }\n          }\n          break;\n        }\n        case 3: {\n          const scale = Math.max(\n            Math.abs(s[p - 1]),\n            Math.abs(s[p - 2]),\n            Math.abs(e[p - 2]),\n            Math.abs(s[k]),\n            Math.abs(e[k]),\n          );\n          const sp = s[p - 1] / scale;\n          const spm1 = s[p - 2] / scale;\n          const epm1 = e[p - 2] / scale;\n          const sk = s[k] / scale;\n          const ek = e[k] / scale;\n          const b = ((spm1 + sp) * (spm1 - sp) + epm1 * epm1) / 2;\n          const c = sp * epm1 * (sp * epm1);\n          let shift = 0;\n          if (b !== 0 || c !== 0) {\n            if (b < 0) {\n              shift = 0 - Math.sqrt(b * b + c);\n            } else {\n              shift = Math.sqrt(b * b + c);\n            }\n            shift = c / (b + shift);\n          }\n          let f = (sk + sp) * (sk - sp) + shift;\n          let g = sk * ek;\n          for (let j = k; j < p - 1; j++) {\n            let t = hypotenuse(f, g);\n            if (t === 0) t = Number.MIN_VALUE;\n            let cs = f / t;\n            let sn = g / t;\n            if (j !== k) {\n              e[j - 1] = t;\n            }\n            f = cs * s[j] + sn * e[j];\n            e[j] = cs * e[j] - sn * s[j];\n            g = sn * s[j + 1];\n            s[j + 1] = cs * s[j + 1];\n            if (wantv) {\n              for (let i = 0; i < n; i++) {\n                t = cs * V.get(i, j) + sn * V.get(i, j + 1);\n                V.set(i, j + 1, -sn * V.get(i, j) + cs * V.get(i, j + 1));\n                V.set(i, j, t);\n              }\n            }\n            t = hypotenuse(f, g);\n            if (t === 0) t = Number.MIN_VALUE;\n            cs = f / t;\n            sn = g / t;\n            s[j] = t;\n            f = cs * e[j] + sn * s[j + 1];\n            s[j + 1] = -sn * e[j] + cs * s[j + 1];\n            g = sn * e[j + 1];\n            e[j + 1] = cs * e[j + 1];\n            if (wantu && j < m - 1) {\n              for (let i = 0; i < m; i++) {\n                t = cs * U.get(i, j) + sn * U.get(i, j + 1);\n                U.set(i, j + 1, -sn * U.get(i, j) + cs * U.get(i, j + 1));\n                U.set(i, j, t);\n              }\n            }\n          }\n          e[p - 2] = f;\n          iter = iter + 1;\n          break;\n        }\n        case 4: {\n          if (s[k] <= 0) {\n            s[k] = s[k] < 0 ? -s[k] : 0;\n            if (wantv) {\n              for (let i = 0; i <= pp; i++) {\n                V.set(i, k, -V.get(i, k));\n              }\n            }\n          }\n          while (k < pp) {\n            if (s[k] >= s[k + 1]) {\n              break;\n            }\n            let t = s[k];\n            s[k] = s[k + 1];\n            s[k + 1] = t;\n            if (wantv && k < n - 1) {\n              for (let i = 0; i < n; i++) {\n                t = V.get(i, k + 1);\n                V.set(i, k + 1, V.get(i, k));\n                V.set(i, k, t);\n              }\n            }\n            if (wantu && k < m - 1) {\n              for (let i = 0; i < m; i++) {\n                t = U.get(i, k + 1);\n                U.set(i, k + 1, U.get(i, k));\n                U.set(i, k, t);\n              }\n            }\n            k++;\n          }\n          iter = 0;\n          p--;\n          break;\n        }\n        // no default\n      }\n    }\n\n    if (swapped) {\n      let tmp = V;\n      V = U;\n      U = tmp;\n    }\n\n    this.m = m;\n    this.n = n;\n    this.s = s;\n    this.U = U;\n    this.V = V;\n  }\n\n  solve(value) {\n    let Y = value;\n    let e = this.threshold;\n    let scols = this.s.length;\n    let Ls = Matrix.zeros(scols, scols);\n\n    for (let i = 0; i < scols; i++) {\n      if (Math.abs(this.s[i]) <= e) {\n        Ls.set(i, i, 0);\n      } else {\n        Ls.set(i, i, 1 / this.s[i]);\n      }\n    }\n\n    let U = this.U;\n    let V = this.rightSingularVectors;\n\n    let VL = V.mmul(Ls);\n    let vrows = V.rows;\n    let urows = U.rows;\n    let VLU = Matrix.zeros(vrows, urows);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < urows; j++) {\n        let sum = 0;\n        for (let k = 0; k < scols; k++) {\n          sum += VL.get(i, k) * U.get(j, k);\n        }\n        VLU.set(i, j, sum);\n      }\n    }\n\n    return VLU.mmul(Y);\n  }\n\n  solveForDiagonal(value) {\n    return this.solve(Matrix.diag(value));\n  }\n\n  inverse() {\n    let V = this.V;\n    let e = this.threshold;\n    let vrows = V.rows;\n    let vcols = V.columns;\n    let X = new Matrix(vrows, this.s.length);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < vcols; j++) {\n        if (Math.abs(this.s[j]) > e) {\n          X.set(i, j, V.get(i, j) / this.s[j]);\n        }\n      }\n    }\n\n    let U = this.U;\n\n    let urows = U.rows;\n    let ucols = U.columns;\n    let Y = new Matrix(vrows, urows);\n\n    for (let i = 0; i < vrows; i++) {\n      for (let j = 0; j < urows; j++) {\n        let sum = 0;\n        for (let k = 0; k < ucols; k++) {\n          sum += X.get(i, k) * U.get(j, k);\n        }\n        Y.set(i, j, sum);\n      }\n    }\n\n    return Y;\n  }\n\n  get condition() {\n    return this.s[0] / this.s[Math.min(this.m, this.n) - 1];\n  }\n\n  get norm2() {\n    return this.s[0];\n  }\n\n  get rank() {\n    let tol = Math.max(this.m, this.n) * this.s[0] * Number.EPSILON;\n    let r = 0;\n    let s = this.s;\n    for (let i = 0, ii = s.length; i < ii; i++) {\n      if (s[i] > tol) {\n        r++;\n      }\n    }\n    return r;\n  }\n\n  get diagonal() {\n    return Array.from(this.s);\n  }\n\n  get threshold() {\n    return (Number.EPSILON / 2) * Math.max(this.m, this.n) * this.s[0];\n  }\n\n  get leftSingularVectors() {\n    return this.U;\n  }\n\n  get rightSingularVectors() {\n    return this.V;\n  }\n\n  get diagonalMatrix() {\n    return Matrix.diag(this.s);\n  }\n}\n","import { Matrix as MLMatrix, SingularValueDecomposition } from \"ml-matrix\";\nimport type {\n  Graph,\n  LayoutMapping,\n  OutNode,\n  PointTuple,\n  MDSLayoutOptions,\n  SyncLayout,\n  Matrix,\n} from \"./types\";\nimport { clone, floydWarshall, getAdjMatrix, scaleMatrix } from \"./util\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<MDSLayoutOptions> = {\n  center: [0, 0],\n  linkDistance: 50,\n};\n\n/**\n * Layout arranging the nodes with multiple dimensional scaling algorithm\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new MDSLayout({ center: [100, 100] });\n * const positions = layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new MDSLayout({ center: [100, 100] });\n * const positions = layout.execute(graph, { rows: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * layout.assign(graph, { center: [100, 100] });\n */\nexport class MDSLayout implements SyncLayout<MDSLayoutOptions> {\n  id = \"mds\";\n\n  constructor(public options: MDSLayoutOptions = {} as MDSLayoutOptions) {\n    Object.assign(this.options, DEFAULTS_LAYOUT_OPTIONS, options);\n  }\n\n  /**\n   * Return the positions of nodes and edges(if needed).\n   */\n  execute(graph: Graph, options?: MDSLayoutOptions): LayoutMapping {\n    return this.genericMDSLayout(false, graph, options) as LayoutMapping;\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  assign(graph: Graph, options?: MDSLayoutOptions) {\n    this.genericMDSLayout(true, graph, options);\n  }\n\n  private genericMDSLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: MDSLayoutOptions\n  ): LayoutMapping | void {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      center = [0, 0],\n      linkDistance = 50,\n      layoutInvisibles,\n      onLayoutEnd,\n    } = mergedOptions;\n\n    let nodes = graph.getAllNodes();\n    let edges = graph.getAllEdges();\n\n    if (!layoutInvisibles) {\n      nodes = nodes.filter(\n        (node) => node.data.visible || node.data.visible === undefined\n      );\n      edges = edges.filter(\n        (edge) => edge.data.visible || edge.data.visible === undefined\n      );\n    }\n\n    if (!nodes || nodes.length === 0) {\n      const result = { nodes: [], edges };\n      onLayoutEnd?.(result);\n      return result;\n    }\n    if (nodes.length === 1) {\n      if (assign) {\n        graph.mergeNodeData(nodes[0].id, {\n          x: center[0],\n          y: center[1],\n        });\n      }\n      const result = {\n        nodes: [\n          {\n            ...nodes[0],\n            data: {\n              ...nodes[0].data,\n              x: center[0],\n              y: center[1],\n            },\n          },\n        ],\n        edges,\n      };\n      onLayoutEnd?.(result);\n      return result;\n    }\n\n    // the graph-theoretic distance (shortest path distance) matrix\n    const adjMatrix = getAdjMatrix({ nodes, edges }, false);\n    const distances = floydWarshall(adjMatrix);\n    handleInfinity(distances);\n\n    // scale the ideal edge length acoording to linkDistance\n    const scaledD = scaleMatrix(distances, linkDistance);\n\n    // get positions by MDS\n    const positions = runMDS(scaledD);\n    const layoutNodes: OutNode[] = [];\n    positions.forEach((p: number[], i: number) => {\n      const cnode = clone(nodes[i]) as OutNode;\n      cnode.data.x = p[0] + center[0];\n      cnode.data.y = p[1] + center[1];\n      layoutNodes.push(cnode);\n    });\n\n    if (assign) {\n      layoutNodes.forEach((node) =>\n        graph.mergeNodeData(node.id, {\n          x: node.data.x,\n          y: node.data.y,\n        })\n      );\n    }\n\n    const result = {\n      nodes: layoutNodes,\n      edges,\n    };\n    onLayoutEnd?.(result);\n\n    return result;\n  }\n}\n\nconst handleInfinity = (distances: Matrix[]) => {\n  let maxDistance = -999999;\n  distances.forEach((row) => {\n    row.forEach((value) => {\n      if (value === Infinity) {\n        return;\n      }\n      if (maxDistance < value) {\n        maxDistance = value;\n      }\n    });\n  });\n  distances.forEach((row, i) => {\n    row.forEach((value, j) => {\n      if (value === Infinity) {\n        distances[i][j] = maxDistance;\n      }\n    });\n  });\n};\n\n/**\n * mds 算法\n * @return {array} positions 计算后的节点位置数组\n */\nconst runMDS = (distances: Matrix[]): PointTuple[] => {\n  const dimension = 2;\n\n  // square distances\n  const M = MLMatrix.mul(MLMatrix.pow(distances, 2), -0.5);\n\n  // double centre the rows/columns\n  const rowMeans = M.mean(\"row\");\n  const colMeans = M.mean(\"column\");\n  const totalMean = M.mean();\n  M.add(totalMean)\n    .subRowVector(rowMeans)\n    .subColumnVector(colMeans);\n\n  // take the SVD of the double centred matrix, and return the\n  // points from it\n  const ret = new SingularValueDecomposition(M);\n  const eigenValues = MLMatrix.sqrt(ret.diagonalMatrix).diagonal();\n  return ret.leftSingularVectors.toJSON().map((row: number[]) => {\n    return MLMatrix.mul([row], [eigenValues])\n      .toJSON()[0]\n      .splice(0, dimension) as PointTuple;\n  });\n};\n","import type { Graph, Node, Point } from \"../types\";\n\nconst SPEED_DIVISOR = 800;\n\nexport type RadialNonoverlapForceOptions = {\n  positions: Point[];\n  focusIdx: number;\n  radii: number[];\n  iterations: number;\n  height: number;\n  width: number;\n  k: number;\n  strictRadial: boolean;\n  nodes: Node[];\n  speed?: number;\n  gravity?: number;\n  nodeSizeFunc: (node: Node) => number;\n};\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<RadialNonoverlapForceOptions> = {\n  iterations: 10,\n  height: 10,\n  width: 10,\n  speed: 100,\n  gravity: 10,\n  k: 5\n}\n\nexport const radialNonoverlapForce = (graph: Graph, options: RadialNonoverlapForceOptions): Point[] => {\n  const mergedOptions = { ...DEFAULTS_LAYOUT_OPTIONS, ...options };\n  const { positions, iterations, width, k, speed = 100, strictRadial, focusIdx, radii = [], nodeSizeFunc } = mergedOptions;\n\n  const nodes = graph.getAllNodes();\n\n  const disp: Point[] = [];\n  const maxDisplace = width / 10;\n\n  for (let i = 0; i < iterations; i++) {\n    positions.forEach((_: Point, k: number) => {\n      disp[k] = { x: 0, y: 0 };\n    });\n    // 给重叠的节点增加斥力\n    getRepulsion(nodes, positions, disp, k, radii, nodeSizeFunc);\n    updatePositions(positions, disp, speed, strictRadial, focusIdx, maxDisplace, width, radii);\n  }\n  return positions;\n}\n\nconst getRepulsion = (nodes: Node[], positions: Point[], disp: Point[], k: number, radii: number[], nodeSizeFunc: (node: Node) => number) => {\n  positions.forEach((v: Point, i: number) => {\n    disp[i] = { x: 0, y: 0 };\n    positions.forEach((u: Point, j: number) => {\n      if (i === j) {\n        return;\n      }\n      // v and u are not on the same circle, return\n      if (radii[i] !== radii[j]) {\n        return;\n      }\n      let vecx = v.x - u.x;\n      let vecy = v.y - u.y;\n      let vecLength = Math.sqrt(vecx * vecx + vecy * vecy);\n      if (vecLength === 0) {\n        vecLength = 1;\n        const sign = i > j ? 1 : -1;\n        vecx = 0.01 * sign;\n        vecy = 0.01 * sign;\n      }\n      // these two nodes overlap\n      if (vecLength < nodeSizeFunc(nodes[i]) / 2 + nodeSizeFunc(nodes[j]) / 2) {\n        const common = (k * k) / vecLength;\n        disp[i].x += (vecx / vecLength) * common;\n        disp[i].y += (vecy / vecLength) * common;\n      }\n    });\n  });\n}\n\nconst updatePositions = (positions: Point[], disp: Point[], speed: number, strictRadial: boolean, focusIdx: number, maxDisplace: number, width: number, radii: number[]) => {\n  const maxDisp = maxDisplace || width / 10;\n  if (strictRadial) {\n    disp.forEach((di, i) => {\n      const vx = positions[i].x - positions[focusIdx].x;\n      const vy = positions[i].y - positions[focusIdx].y;\n      const vLength = Math.sqrt(vx * vx + vy * vy);\n      let vpx = vy / vLength;\n      let vpy = -vx / vLength;\n      const diLength = Math.sqrt(di.x * di.x + di.y * di.y);\n      let alpha = Math.acos((vpx * di.x + vpy * di.y) / diLength);\n      if (alpha > Math.PI / 2) {\n        alpha -= Math.PI / 2;\n        vpx *= -1;\n        vpy *= -1;\n      }\n      const tdispLength = Math.cos(alpha) * diLength;\n      di.x = vpx * tdispLength;\n      di.y = vpy * tdispLength;\n    });\n  }\n\n  // move\n  positions.forEach((n, i) => {\n    if (i === focusIdx) {\n      return;\n    }\n    const distLength = Math.sqrt(disp[i].x * disp[i].x + disp[i].y * disp[i].y);\n    if (distLength > 0 && i !== focusIdx) {\n      const limitedDist = Math.min(maxDisp * (speed / SPEED_DIVISOR), distLength);\n      n.x += (disp[i].x / distLength) * limitedDist;\n      n.y += (disp[i].y / distLength) * limitedDist;\n      if (strictRadial) {\n        let vx = n.x - positions[focusIdx].x;\n        let vy = n.y - positions[focusIdx].y;\n        const nfDis = Math.sqrt(vx * vx + vy * vy);\n        vx = (vx / nfDis) * radii[i];\n        vy = (vy / nfDis) * radii[i];\n        n.x = positions[focusIdx].x + vx;\n        n.y = positions[focusIdx].y + vy;\n      }\n    }\n  });\n  return positions;\n}","import type { Graph, Node, LayoutMapping, Matrix, OutNode, PointTuple, RadialLayoutOptions, SyncLayout, Point } from \"../types\";\nimport { floydWarshall, getAdjMatrix, isArray, isFunction, isNumber, isObject, isString } from \"../util\";\nimport { mds } from \"./mds\";\nimport { radialNonoverlapForce, RadialNonoverlapForceOptions } from \"./RadialNonoverlapForce\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<RadialLayoutOptions> = {\n  maxIteration: 1000,\n  focusNode: null,\n  unitRadius: null,\n  linkDistance: 50,\n  preventOverlap: false,\n  nodeSize: undefined,\n  nodeSpacing: undefined,\n  strictRadial: true,\n  maxPreventOverlapIteration: 200,\n  sortBy: undefined,\n  sortStrength: 10\n}\n\n/**\n * Layout arranging the nodes' on a radial shape\n * \n * @example\n * // Assign layout options when initialization.\n * const layout = new RadialLayout({ focusNode: 'node0' });\n * const positions = layout.execute(graph); // { nodes: [], edges: [] }\n * \n * // Or use different options later.\n * const layout = new RadialLayout({ focusNode: 'node0' });\n * const positions = layout.execute(graph, { focusNode: 'node0' }); // { nodes: [], edges: [] }\n * \n * // If you want to assign the positions directly to the nodes, use assign method.\n * layout.assign(graph, { focusNode: 'node0' });\n */\nexport class RadialLayout implements SyncLayout<RadialLayoutOptions> {\n  id = 'radial';\n\n  constructor(public options: RadialLayoutOptions = {} as RadialLayoutOptions) {\n    Object.assign(this.options, DEFAULTS_LAYOUT_OPTIONS, options);\n  }\n\n  /**\n   * Return the positions of nodes and edges(if needed).\n   */\n  execute(graph: Graph, options?: RadialLayoutOptions): LayoutMapping {\n    return this.genericRadialLayout(false, graph, options) as LayoutMapping;\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  assign(graph: Graph, options?: RadialLayoutOptions) {\n    this.genericRadialLayout(true, graph, options);\n  }\n\n  private genericRadialLayout(assign: boolean, graph: Graph, options?: RadialLayoutOptions): LayoutMapping | void {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      width: propsWidth,\n      height: propsHeight,\n      center: propsCenter,\n      focusNode: propsFocusNode,\n      unitRadius: propsUnitRadius,\n      nodeSize,\n      nodeSpacing,\n      strictRadial,\n      preventOverlap,\n      maxPreventOverlapIteration,\n      sortBy,\n      linkDistance = 50,\n      sortStrength = 10,\n      maxIteration = 1000,\n      layoutInvisibles,\n      onLayoutEnd\n    } = mergedOptions;\n\n    let nodes = graph.getAllNodes();\n    let edges = graph.getAllEdges();\n\n    if (!layoutInvisibles) {\n      nodes = nodes.filter(node => node.data.visible || node.data.visible === undefined);\n      edges = edges.filter(edge => edge.data.visible || edge.data.visible === undefined);\n    }\n\n    if (!nodes || nodes.length === 0) {\n      const result = { nodes: [], edges }\n      onLayoutEnd?.(result);\n      return result;\n    }\n\n    const width = !propsWidth && typeof window !== \"undefined\" ? window.innerWidth : propsWidth as number;\n    const height = !propsHeight && typeof window !== \"undefined\" ? window.innerHeight : propsHeight as number;\n    const center = !propsCenter ? [width / 2, height / 2] : propsCenter as PointTuple;\n\n    if (nodes.length === 1) {\n      if (assign) {\n        graph.mergeNodeData(nodes[0].id, {\n          x: center[0],\n          y: center[1],\n        });\n      }\n      const result = {\n        nodes: [\n          {\n            ...nodes[0],\n            data: {\n              ...nodes[0].data,\n              x: center[0],\n              y: center[1],\n            }\n          }\n        ],\n        edges,\n      };\n      onLayoutEnd?.(result);\n      return result;\n    }\n    // layout\n    let focusNode = nodes[0];\n    if (isString(propsFocusNode)) {\n      for (let i = 0; i < nodes.length; i++) {\n        if (nodes[i].id === propsFocusNode) {\n          focusNode = nodes[i];\n          break;\n        }\n      }\n    } else {\n      focusNode = propsFocusNode || nodes[0];\n    }\n    \n    // the index of the focusNode in data\n    const focusIndex = getIndexById(nodes, focusNode.id);\n\n    // the graph-theoretic distance (shortest path distance) matrix\n    const adjMatrix = getAdjMatrix({ nodes, edges }, false);\n    const distances = floydWarshall(adjMatrix);\n    const maxDistance = maxToFocus(distances, focusIndex);\n    // replace first node in unconnected component to the circle at (maxDistance + 1)\n    handleInfinity(distances, focusIndex, maxDistance + 1);\n\n    // the shortest path distance from each node to focusNode\n    const focusNodeD = distances[focusIndex];\n    let semiWidth =\n      width - center[0] > center[0] ? center[0] : width - center[0];\n    let semiHeight =\n      height - center[1] > center[1] ? center[1] : height - center[1];\n    if (semiWidth === 0) {\n      semiWidth = width / 2;\n    }\n    if (semiHeight === 0) {\n      semiHeight = height / 2;\n    }\n    // the maxRadius of the graph\n    const maxRadius = Math.min(semiWidth, semiHeight);\n    const maxD = Math.max(...focusNodeD);\n    // the radius for each nodes away from focusNode\n    const radii: number[] = [];\n    const unitRadius = !propsUnitRadius ?  maxRadius / maxD : propsUnitRadius;\n    focusNodeD.forEach((value, i) => {\n      radii[i] = value * unitRadius;\n    });\n\n    const idealDistances = eIdealDisMatrix(nodes, distances, linkDistance, radii, unitRadius, sortBy, sortStrength);\n    // the weight matrix, Wij = 1 / dij^(-2)\n    const weights = getWeightMatrix(idealDistances);\n\n    // the initial positions from mds, move the graph to origin, centered at focusNode\n    let positions: Point[] = mds(linkDistance, idealDistances, linkDistance).map(([x, y]) => ({\n      x: (isNaN(x) ? Math.random() * linkDistance : x) - positions[focusIndex].x,\n      y: (isNaN(y) ? Math.random() * linkDistance : y) - positions[focusIndex].y,\n    }));\n\n    this.run(maxIteration, positions, weights, idealDistances, radii, focusIndex);\n    let nodeSizeFunc;\n    // stagger the overlapped nodes\n    if (preventOverlap) {\n      nodeSizeFunc = formatNodeSize(nodeSize, nodeSpacing);\n      const nonoverlapForceParams: RadialNonoverlapForceOptions = {\n        nodes,\n        nodeSizeFunc,\n        positions,\n        radii,\n        height,\n        width,\n        strictRadial: Boolean(strictRadial),\n        focusIdx: focusIndex,\n        iterations: maxPreventOverlapIteration || 200,\n        k: positions.length / 4.5,\n      };\n      positions = radialNonoverlapForce(graph, nonoverlapForceParams)\n    }\n    // move the graph to center\n    const layoutNodes: OutNode[] = [];\n    positions.forEach((p: Point, i: number) => {\n      layoutNodes.push({\n        ...nodes[i],\n        data: {\n          ...nodes[0].data,\n          x: p.x + center[0],\n          y: p.y + center[1]\n        }\n      })\n    });\n\n    if (assign) {\n      layoutNodes.forEach(node => graph.mergeNodeData(node.id, {\n        x: node.data.x,\n        y: node.data.y\n      }));\n    }\n\n    const result = {\n      nodes: layoutNodes,\n      edges\n    }\n    onLayoutEnd?.(result);\n\n    return result;\n  }\n  private run(\n    maxIteration: number,\n    positions: Point[],\n    weights: Matrix[],\n    idealDistances: Matrix[],\n    radii: number[],\n    focusIndex: number\n  ) {\n    for (let i = 0; i <= maxIteration; i++) {\n      const param = i / maxIteration;\n      this.oneIteration(param, positions, radii, idealDistances, weights, focusIndex);\n    }\n  }\n  private oneIteration(\n    param: number,\n    positions: Point[],\n    radii: number[],\n    distances: Matrix[],\n    weights: Matrix[],\n    focusIndex: number\n  ) {\n    const vparam = 1 - param;\n    positions.forEach((v: Point, i: number) => {\n      // v\n      const originDis = getEDistance(v, { x: 0, y: 0 });\n      const reciODis = originDis === 0 ? 0 : 1 / originDis;\n      if (i === focusIndex) {\n        return;\n      }\n      let xMolecule = 0;\n      let yMolecule = 0;\n      let denominator = 0;\n      positions.forEach((u, j) => {\n        // u\n        if (i === j) {\n          return;\n        }\n        // the euclidean distance between v and u\n        const edis = getEDistance(v, u);\n        const reciEdis = edis === 0 ? 0 : 1 / edis;\n        const idealDis = distances[j][i];\n        // same for x and y\n        denominator += weights[i][j];\n        // x\n        xMolecule += weights[i][j] * (u.x + idealDis * (v.x - u.x) * reciEdis);\n        // y\n        yMolecule += weights[i][j] * (u.y + idealDis * (v.y - u.y) * reciEdis);\n      });\n      const reciR = radii[i] === 0 ? 0 : 1 / radii[i];\n      denominator *= vparam;\n      denominator += param * reciR * reciR;\n      // x\n      xMolecule *= vparam;\n      xMolecule += param * reciR * v.x * reciODis;\n      v.x = xMolecule / denominator;\n      // y\n      yMolecule *= vparam;\n      yMolecule += param * reciR * v.y * reciODis;\n      v.y = yMolecule / denominator;\n    });\n  }\n}\n\nconst eIdealDisMatrix = (\n  nodes: Node[],\n  distances: Matrix[],\n  linkDistance: number,\n  radii: number[],\n  unitRadius: number,\n  sortBy: string | undefined,\n  sortStrength: number\n): Matrix[] => {\n  if (!nodes) return [];\n  const result: Matrix[] = [];\n  if (distances) {\n    distances.forEach((row: number[], i: number) => {\n      const newRow: Matrix = [];\n      row.forEach((v, j) => {\n        if (i === j) {\n          newRow.push(0);\n        } else if (radii[i] === radii[j]) {\n          // i and j are on the same circle\n          if (sortBy === \"data\") {\n            // sort the nodes on the same circle according to the ordering of the data\n            newRow.push(\n              (v * (Math.abs(i - j) * sortStrength)) /\n                (radii[i] / unitRadius)\n            );\n          } else if (sortBy) {\n            // sort the nodes on the same circle according to the attributes\n            let iValue: number | string =\n              ((nodes[i] as any)[sortBy] as number | string) || 0;\n            let jValue: number | string =\n              ((nodes[j] as any)[sortBy] as number | string) || 0;\n            if (isString(iValue)) {\n              iValue = iValue.charCodeAt(0);\n            }\n            if (isString(jValue)) {\n              jValue = jValue.charCodeAt(0);\n            }\n            newRow.push(\n              (v * (Math.abs(iValue - jValue) * sortStrength)) /\n                (radii[i] / unitRadius)\n            );\n          } else {\n            newRow.push((v * linkDistance) / (radii[i] / unitRadius));\n          }\n        } else {\n          // i and j are on different circles\n          const link = (linkDistance + unitRadius) / 2;\n          newRow.push(v * link);\n        }\n      });\n      result.push(newRow);\n    });\n  }\n  return result;\n}\n\nconst getWeightMatrix = (idealDistances: Matrix[]) => {\n  const rows = idealDistances.length;\n  const cols = idealDistances[0].length;\n  const result: number[][] = [];\n  for (let i = 0; i < rows; i++) {\n    const row: number[] = [];\n    for (let j = 0; j < cols; j++) {\n      if (idealDistances[i][j] !== 0) {\n        row.push(1 / (idealDistances[i][j] * idealDistances[i][j]));\n      } else {\n        row.push(0);\n      }\n    }\n    result.push(row);\n  }\n  return result;\n}\n\n/**\n * calculate the euclidean distance form p1 to p2\n * @param p1 \n * @param p2 \n * @returns \n */\nconst getEDistance = (p1: Point, p2: Point) => Math.sqrt(\n  (p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y)\n);\n\nconst getIndexById = (array: any[], id: string | number) => {\n  let index = -1;\n  array.forEach((a, i) => {\n    if (a.id === id) {\n      index = i;\n    }\n  });\n  return Math.max(index, 0);\n}\n\nconst handleInfinity = (matrix: Matrix[], focusIndex: number, step: number) => {\n  const length = matrix.length;\n  // 遍历 matrix 中遍历 focus 对应行\n  for (let i = 0; i < length; i++) {\n    // matrix 关注点对应行的 Inf 项\n    if (matrix[focusIndex][i] === Infinity) {\n      matrix[focusIndex][i] = step;\n      matrix[i][focusIndex] = step;\n      // 遍历 matrix 中的 i 行，i 行中非 Inf 项若在 focus 行为 Inf，则替换 focus 行的那个 Inf\n      for (let j = 0; j < length; j++) {\n        if (matrix[i][j] !== Infinity && matrix[focusIndex][j] === Infinity) {\n          matrix[focusIndex][j] = step + matrix[i][j];\n          matrix[j][focusIndex] = step + matrix[i][j];\n        }\n      }\n    }\n  }\n  // 处理其他行的 Inf。根据该行对应点与 focus 距离以及 Inf 项点 与 focus 距离，决定替换值\n  for (let i = 0; i < length; i++) {\n    if (i === focusIndex) {\n      continue;\n    }\n    for (let j = 0; j < length; j++) {\n      if (matrix[i][j] === Infinity) {\n        let minus = Math.abs(matrix[focusIndex][i] - matrix[focusIndex][j]);\n        minus = minus === 0 ? 1 : minus;\n        matrix[i][j] = minus;\n      }\n    }\n  }\n}\n\nconst maxToFocus = (matrix: Matrix[], focusIndex: number): number => {\n  let max = 0;\n  for (let i = 0; i < matrix[focusIndex].length; i++) {\n    if (matrix[focusIndex][i] === Infinity) {\n      continue;\n    }\n    max = matrix[focusIndex][i] > max ? matrix[focusIndex][i] : max;\n  }\n  return max;\n}\n\n/**\n * format the props nodeSize and nodeSpacing to a function\n * @param nodeSize \n * @param nodeSpacing \n * @returns \n */\nconst formatNodeSize = (\n  nodeSize: number | number[] | undefined,\n  nodeSpacing: number | Function | undefined\n): ((nodeData: Node) => number) => {\n  let nodeSizeFunc;\n  let nodeSpacingFunc: Function;\n  if (isNumber(nodeSpacing)) {\n    nodeSpacingFunc = () => nodeSpacing;\n  } else if (isFunction(nodeSpacing)) {\n    nodeSpacingFunc = nodeSpacing;\n  } else {\n    nodeSpacingFunc = () => 0;\n  }\n\n  if (!nodeSize) {\n    nodeSizeFunc = (d: Node) => {\n      if (d.data.bboxSize) {\n        return Math.max(d.data.bboxSize[0], d.data.bboxSize[1]) + nodeSpacingFunc(d);\n      }\n      if (d.data.size) {\n        if (isArray(d.data.size)) {\n          return Math.max(d.data.size[0], d.data.size[1]) + nodeSpacingFunc(d);\n        }  if (isObject(d.data.size)) {\n          const res = d.data.size.width > d.data.size.height ? d.data.size.width : d.data.size.height;\n          return res + nodeSpacingFunc(d);  \n        }\n        return d.data.size + nodeSpacingFunc(d);\n      }\n      return 10 + nodeSpacingFunc(d);\n    };\n  } else if (isArray(nodeSize)) {\n    nodeSizeFunc = (d: Node) => {\n      const res = nodeSize[0] > nodeSize[1] ? nodeSize[0] : nodeSize[1];\n      return res + nodeSpacingFunc(d);\n    };\n  } else {\n    nodeSizeFunc = (d: Node) => nodeSize + nodeSpacingFunc(d);\n  }\n  return nodeSizeFunc;\n}","import { Matrix as MLMatrix, SingularValueDecomposition } from 'ml-matrix';\nimport type { PointTuple, Matrix } from '../types';\n\nexport const mds = (dimension: number, distances: Matrix[], linkDistance: number) => {\n  try {\n    // square distances\n    const M = MLMatrix.mul(MLMatrix.pow(distances, 2), -0.5);\n\n    // double centre the rows/columns\n    const rowMeans = M.mean('row');\n    const colMeans = M.mean('column');\n    const totalMean = M.mean();\n    M.add(totalMean).subRowVector(rowMeans).subColumnVector(colMeans);\n\n    // take the SVD of the double centred matrix, and return the\n    // points from it\n    const ret = new SingularValueDecomposition(M);\n    const eigenValues = MLMatrix.sqrt(ret.diagonalMatrix).diagonal();\n    return ret.leftSingularVectors.toJSON().map((row: number[]) => {\n      return MLMatrix.mul([row], [eigenValues]).toJSON()[0].splice(0, dimension) as PointTuple;\n    });\n  } catch {\n    const res: PointTuple[] = [];\n    for (let i = 0; i < distances.length; i++) {\n      const x = Math.random() * linkDistance;\n      const y = Math.random() * linkDistance;\n      res.push([x, y]);\n    }\n    return res;\n  }\n}","import type {\n  Graph,\n  LayoutMapping,\n  OutNode,\n  PointTuple,\n  RandomLayoutOptions,\n  SyncLayout,\n} from \"./types\";\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<RandomLayoutOptions> = {\n  center: [0, 0],\n  width: 300,\n  height: 300,\n};\n\n/**\n * Layout randomizing the nodes' position\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new RandomLayout({ center: [100, 100] });\n * const positions = layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new RandomLayout({ center: [100, 100] });\n * const positions = layout.execute(graph, { center: [100, 100] }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * layout.assign(graph, { center: [100, 100] });\n */\nexport class RandomLayout implements SyncLayout<RandomLayoutOptions> {\n  id = \"random\";\n\n  constructor(public options: RandomLayoutOptions = {} as RandomLayoutOptions) {\n    Object.assign(this.options, DEFAULTS_LAYOUT_OPTIONS, options);\n  }\n\n  /**\n   * Return the positions of nodes and edges(if needed).\n   */\n  execute(graph: Graph, options?: RandomLayoutOptions): LayoutMapping {\n    return this.genericRandomLayout(false, graph, options) as LayoutMapping;\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  assign(graph: Graph, options?: RandomLayoutOptions) {\n    this.genericRandomLayout(true, graph, options);\n  }\n\n  private genericRandomLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: RandomLayoutOptions\n  ): LayoutMapping | void {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      center: propsCenter,\n      width: propsWidth,\n      height: propsHeight,\n      layoutInvisibles,\n      onLayoutEnd,\n    } = mergedOptions;\n\n    let nodes = graph.getAllNodes();\n    if (!layoutInvisibles)\n      nodes = nodes.filter(\n        (node) => node.data.visible || node.data.visible === undefined\n      );\n    const layoutScale = 0.9;\n    const width =\n      !propsWidth && typeof window !== \"undefined\"\n        ? window.innerWidth\n        : (propsWidth as number);\n    const height =\n      !propsHeight && typeof window !== \"undefined\"\n        ? window.innerHeight\n        : (propsHeight as number);\n    const center = !propsCenter\n      ? [width / 2, height / 2]\n      : (propsCenter as PointTuple);\n\n    const layoutNodes: OutNode[] = [];\n    if (nodes) {\n      nodes.forEach((node) => {\n        layoutNodes.push({\n          id: node.id,\n          data: {\n            x: (Math.random() - 0.5) * layoutScale * width + center[0],\n            y: (Math.random() - 0.5) * layoutScale * height + center[1],\n          },\n        });\n      });\n    }\n\n    if (assign) {\n      layoutNodes.forEach((node) =>\n        graph.mergeNodeData(node.id, {\n          x: node.data.x,\n          y: node.data.y,\n        })\n      );\n    }\n\n    const result = {\n      nodes: layoutNodes,\n      edges: graph.getAllEdges(),\n    };\n\n    onLayoutEnd?.(result);\n\n    return result;\n  }\n}\n","import { CircularLayout } from \"./circular\";\nimport { ConcentricLayout } from \"./concentric\";\nimport { GridLayout } from \"./grid\";\nimport { MDSLayout } from \"./mds\";\nimport { RadialLayout } from \"./radial\";\nimport { RandomLayout } from \"./random\";\nimport type { SyncLayoutConstructor } from \"./types\";\n\nexport const registry: Record<string, SyncLayoutConstructor<any>> = {\n  circular: CircularLayout,\n  concentric: ConcentricLayout,\n  mds: MDSLayout,\n  random: RandomLayout,\n  grid: GridLayout,\n  radial: RadialLayout,\n};\nexport function registerLayout(id: string, layout: SyncLayoutConstructor<any>) {\n  registry[id] = layout;\n}\n","export class Graph {\n    nodeMap = new Map();\n    edgeMap = new Map();\n    inEdgesMap = new Map();\n    outEdgesMap = new Map();\n    treeIndices = new Map();\n    changes = [];\n    batchCount = 0;\n    /**\n     * This function is called with a {@link GraphChangedEvent} each time a graph change happened.\n     *\n     * `event.changes` contains all the graph changes in order since last `onChanged`.\n     */\n    onChanged = () => {\n        // Do nothing.\n    };\n    /**\n     * Create a new Graph instance.\n     * @param options - The options to initialize a graph. See {@link GraphOptions}.\n     *\n     * ```ts\n     * const graph = new Graph({\n     *   // Optional, initial nodes.\n     *   nodes: [\n     *     // Each node has a unique ID.\n     *     { id: 'A', foo: 1 },\n     *     { id: 'B', foo: 1 },\n     *   ],\n     *   // Optional, initial edges.\n     *   edges: [\n     *     { id: 'C', source: 'B', target: 'B', weight: 1 },\n     *   ],\n     *   // Optional, called with a GraphChangedEvent.\n     *   onChanged: (event) => {\n     *     console.log(event);\n     *   }\n     * });\n     * ```\n     */\n    constructor(options) {\n        if (!options)\n            return;\n        if (options.nodes)\n            this.addNodes(options.nodes);\n        if (options.edges)\n            this.addEdges(options.edges);\n        if (options.tree)\n            this.addTree(options.tree);\n        if (options.onChanged)\n            this.onChanged = options.onChanged;\n    }\n    /**\n     * Batch several graph changes into one.\n     *\n     * Make several changes, but dispatch only one ChangedEvent at the end of batch:\n     * ```ts\n     * graph.batch(() => {\n     *   graph.addNodes([]);\n     *   graph.addEdges([]);\n     * });\n     * ```\n     *\n     * Batches can be nested. Only the outermost batch will dispatch a ChangedEvent:\n     * ```ts\n     * graph.batch(() => {\n     *   graph.addNodes([]);\n     *   graph.batch(() => {\n     *     graph.addEdges([]);\n     *   });\n     * });\n     * ```\n     */\n    batch = (fn) => {\n        this.batchCount += 1;\n        fn();\n        this.batchCount -= 1;\n        if (!this.batchCount) {\n            this.commit();\n        }\n    };\n    /**\n     * Reset changes and dispatch a ChangedEvent.\n     */\n    commit() {\n        const changes = this.changes;\n        this.changes = [];\n        this.onChanged({\n            graph: this,\n            changes,\n        });\n    }\n    /**\n     * Reduce the number of ordered graph changes by dropping or merging unnecessary changes.\n     *\n     * For example, if we update a node and remove it in a batch:\n     *\n     * ```ts\n     * graph.batch(() => {\n     *   graph.updateNodeData('A', 'foo', 2);\n     *   graph.removeNode('A');\n     * });\n     * ```\n     *\n     * We get 2 atomic graph changes like\n     *\n     * ```ts\n     * [\n     *   { type: 'NodeDataUpdated', id: 'A', propertyName: 'foo', oldValue: 1, newValue: 2 },\n     *   { type: 'NodeRemoved', value: { id: 'A', data: { foo: 2 } },\n     * ]\n     * ```\n     *\n     * Since node 'A' has been removed, we actually have no need to handle with NodeDataUpdated change.\n     *\n     * `reduceChanges()` here helps us remove such changes.\n     */\n    reduceChanges(changes) {\n        let mergedChanges = [];\n        changes.forEach((change) => {\n            switch (change.type) {\n                case 'NodeRemoved': {\n                    // NodeAdded: A added.\n                    // NodeDataUpdated: A changed.\n                    // TreeStructureChanged: A's parent changed.\n                    // NodeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n                    let isNewlyAdded = false;\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'NodeAdded') {\n                            const sameId = pastChange.value.id === change.value.id;\n                            if (sameId) {\n                                isNewlyAdded = true;\n                            }\n                            return !sameId;\n                        }\n                        else if (pastChange.type === 'NodeDataUpdated') {\n                            return pastChange.id !== change.value.id;\n                        }\n                        else if (pastChange.type === 'TreeStructureChanged') {\n                            return pastChange.nodeId !== change.value.id;\n                        }\n                        return true;\n                    });\n                    if (!isNewlyAdded) {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'EdgeRemoved': {\n                    // EdgeAdded: A added.\n                    // EdgeDataUpdated: A changed.\n                    // EdgeDataUpdated: A's source/target changed.\n                    // EdgeRemoved: A removed. 👈🏻 Since A was removed, above three changes may be ignored.\n                    let isNewlyAdded = false;\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'EdgeAdded') {\n                            const sameId = pastChange.value.id === change.value.id;\n                            if (sameId) {\n                                isNewlyAdded = true;\n                            }\n                            return !sameId;\n                        }\n                        else if (pastChange.type === 'EdgeDataUpdated' ||\n                            pastChange.type === 'EdgeUpdated') {\n                            return pastChange.id !== change.value.id;\n                        }\n                        return true;\n                    });\n                    if (!isNewlyAdded) {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'NodeDataUpdated':\n                case 'EdgeDataUpdated':\n                case 'EdgeUpdated': {\n                    // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 1, newValue: 2 }.\n                    // NodeDataUpdated: { id: A, propertyName: 'foo', oldValue: 2, newValue: 3 }.\n                    // 👆 Could be merged as { id: A, propertyName: 'foo', oldValue: 1, newValue: 3 }.\n                    const existingChange = mergedChanges.find((pastChange) => {\n                        return (pastChange.type === change.type &&\n                            pastChange.id === change.id &&\n                            pastChange.propertyName === change.propertyName);\n                    });\n                    if (existingChange) {\n                        existingChange.newValue = change.newValue;\n                    }\n                    else {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                case 'TreeStructureDetached': {\n                    // TreeStructureAttached\n                    // TreeStructureChanged\n                    // TreeStructureDetached 👈🏻 Since the tree struct was detached, above 2 changes may be ignored.\n                    mergedChanges = mergedChanges.filter((pastChange) => {\n                        if (pastChange.type === 'TreeStructureAttached') {\n                            return pastChange.treeKey !== change.treeKey;\n                        }\n                        else if (pastChange.type === 'TreeStructureChanged') {\n                            return pastChange.treeKey !== change.treeKey;\n                        }\n                        return true;\n                    });\n                    mergedChanges.push(change);\n                    break;\n                }\n                case 'TreeStructureChanged': {\n                    const existingChange = mergedChanges.find((pastChange) => {\n                        return (pastChange.type === 'TreeStructureChanged' &&\n                            pastChange.treeKey === change.treeKey &&\n                            pastChange.nodeId === change.nodeId);\n                    });\n                    if (existingChange) {\n                        existingChange.newParentId =\n                            change.newParentId;\n                    }\n                    else {\n                        mergedChanges.push(change);\n                    }\n                    break;\n                }\n                default:\n                    mergedChanges.push(change);\n                    break;\n            }\n        });\n        return mergedChanges;\n    }\n    // ================= Node =================\n    checkNodeExistence(id) {\n        if (!this.hasNode(id)) {\n            throw new Error('Node not found for id: ' + id);\n        }\n    }\n    /**\n     * Check if a node exists in the graph.\n     * @group NodeMethods\n     */\n    hasNode(id) {\n        return this.nodeMap.has(id);\n    }\n    /**\n     * Tell if two nodes are neighbors.\n     * @group NodeMethods\n     */\n    areNeighbors(firstNodeId, secondNodeId) {\n        this.checkNodeExistence(firstNodeId);\n        return this.getNeighbors(secondNodeId).some((neighbor) => neighbor.id === firstNodeId);\n    }\n    /**\n     * Get the node data with given ID.\n     * @group NodeMethods\n     */\n    getNode(id) {\n        this.checkNodeExistence(id);\n        return this.nodeMap.get(id);\n    }\n    /**\n     * Given a node ID, find all edges of the node.\n     * @param id - ID of the node\n     * @param direction - Edge direction, defaults to 'both'.\n     * @group NodeMethods\n     */\n    getRelatedEdges(id, direction) {\n        this.checkNodeExistence(id);\n        const inEdges = this.inEdgesMap.get(id);\n        const outEdges = this.outEdgesMap.get(id);\n        if (direction === 'in') {\n            return Array.from(inEdges);\n        }\n        else if (direction === 'out') {\n            return Array.from(outEdges);\n        }\n        const bothEdges = new Set([...inEdges, ...outEdges]);\n        return Array.from(bothEdges);\n    }\n    /**\n     * Get the degree of the given node.\n     * @group NodeMethods\n     */\n    getDegree(id, direction) {\n        return this.getRelatedEdges(id, direction).length;\n    }\n    /**\n     * Get all successors of the given node.\n     */\n    getSuccessors(id) {\n        const outEdges = this.getRelatedEdges(id, 'out');\n        const targets = outEdges.map((edge) => edge.target);\n        return Array.from(new Set(targets)).map((id) => this.getNode(id));\n    }\n    /**\n     * Get all predecessors of the given node.\n     */\n    getPredecessors(id) {\n        const inEdges = this.getRelatedEdges(id, 'in');\n        const sources = inEdges.map((edge) => edge.source);\n        return Array.from(new Set(sources)).map((id) => this.getNode(id));\n    }\n    /**\n     * Given a node ID, find its neighbors.\n     * @param id - ID of the node\n     * @group NodeMethods\n     */\n    getNeighbors(id) {\n        const predecessors = this.getPredecessors(id);\n        const successors = this.getSuccessors(id);\n        return Array.from(new Set([...predecessors, ...successors]));\n    }\n    doAddNode(node) {\n        if (this.hasNode(node.id)) {\n            throw new Error('Node already exists: ' + node.id);\n        }\n        this.nodeMap.set(node.id, node);\n        this.inEdgesMap.set(node.id, new Set());\n        this.outEdgesMap.set(node.id, new Set());\n        this.treeIndices.forEach((tree) => {\n            tree.childrenMap.set(node.id, new Set());\n        });\n        this.changes.push({ type: 'NodeAdded', value: node });\n    }\n    /**\n     * Add all nodes of the given array, or iterable, into the graph.\n     * @group NodeMethods\n     */\n    addNodes(nodes) {\n        this.batch(() => {\n            for (const node of nodes) {\n                this.doAddNode(node);\n            }\n        });\n    }\n    /**\n     * Add a single node into the graph.\n     * @group NodeMethods\n     */\n    addNode(node) {\n        this.addNodes([node]);\n    }\n    doRemoveNode(id) {\n        const node = this.getNode(id);\n        const inEdges = this.inEdgesMap.get(id);\n        const outEdges = this.outEdgesMap.get(id);\n        inEdges?.forEach((edge) => this.doRemoveEdge(edge.id));\n        outEdges?.forEach((edge) => this.doRemoveEdge(edge.id));\n        this.nodeMap.delete(id);\n        this.treeIndices.forEach((tree) => {\n            tree.childrenMap.get(id)?.forEach((child) => {\n                tree.parentMap.delete(child.id);\n            });\n            tree.parentMap.delete(id);\n            tree.childrenMap.delete(id);\n        });\n        this.changes.push({ type: 'NodeRemoved', value: node });\n    }\n    /**\n     * Remove nodes and their attached edges from the graph.\n     * @group NodeMethods\n     */\n    removeNodes(idList) {\n        this.batch(() => {\n            idList.forEach((id) => this.doRemoveNode(id));\n        });\n    }\n    /**\n     * Remove a single node and its attached edges from the graph.\n     * @group NodeMethods\n     */\n    removeNode(id) {\n        this.removeNodes([id]);\n    }\n    /**\n     * Update node data.\n     * @group NodeMethods\n     */\n    updateNodeData(id, propertyName, value) {\n        const node = this.getNode(id);\n        this.batch(() => {\n            const oldValue = node.data[propertyName];\n            const newValue = value;\n            node.data[propertyName] = newValue;\n            this.changes.push({\n                type: 'NodeDataUpdated',\n                id,\n                propertyName,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    /**\n     * Like Object.assign, merge all properties of `path` to the node data.\n     * @param id Node ID.\n     * @param patch A data object to merge.\n     */\n    mergeNodeData(id, patch) {\n        this.batch(() => {\n            Object.entries(patch).forEach(([propertyName, value]) => {\n                this.updateNodeData(id, propertyName, value);\n            });\n        });\n    }\n    // ================= Edge =================\n    checkEdgeExistence(id) {\n        if (!this.hasEdge(id)) {\n            throw new Error('Edge not found for id: ' + id);\n        }\n    }\n    /**\n     * Check if an edge exists in the graph.\n     * @group NodeMethods\n     */\n    hasEdge(id) {\n        return this.edgeMap.has(id);\n    }\n    /**\n     * Get the edge data with given ID.\n     * @group EdgeMethods\n     */\n    getEdge(id) {\n        this.checkEdgeExistence(id);\n        return this.edgeMap.get(id);\n    }\n    /**\n     * Get the edge, the source node, and the target node by an edge ID.\n     * @group EdgeMethods\n     */\n    getEdgeDetail(id) {\n        const edge = this.getEdge(id);\n        return {\n            edge,\n            source: this.getNode(edge.source),\n            target: this.getNode(edge.target),\n        };\n    }\n    doAddEdge(edge) {\n        if (this.hasEdge(edge.id)) {\n            throw new Error('Edge already exists: ' + edge.id);\n        }\n        this.checkNodeExistence(edge.source);\n        this.checkNodeExistence(edge.target);\n        this.edgeMap.set(edge.id, edge);\n        const inEdges = this.inEdgesMap.get(edge.target);\n        const outEdges = this.outEdgesMap.get(edge.source);\n        inEdges.add(edge);\n        outEdges.add(edge);\n        this.changes.push({ type: 'EdgeAdded', value: edge });\n    }\n    /**\n     * Add all edges of the given iterable(an array, a set, etc.) into the graph.\n     * @group EdgeMethods\n     */\n    addEdges(edges) {\n        this.batch(() => {\n            for (const edge of edges) {\n                this.doAddEdge(edge);\n            }\n        });\n    }\n    /**\n     * Add a single edge pointing from `source` to `target` into the graph.\n     *\n     * ```ts\n     * graph.addNode({ id: 'NodeA' });\n     * graph.addNode({ id: 'NodeB' });\n     * graph.addEdge({ id: 'EdgeA', source: 'NodeA', target: 'NodeB' });\n     * ```\n     *\n     * If `source` or `target` were not found in the current graph, it throws an Error.\n     * @group EdgeMethods\n     */\n    addEdge(edge) {\n        this.addEdges([edge]);\n    }\n    doRemoveEdge(id) {\n        const edge = this.getEdge(id);\n        const outEdges = this.outEdgesMap.get(edge.source);\n        const inEdges = this.inEdgesMap.get(edge.target);\n        outEdges.delete(edge);\n        inEdges.delete(edge);\n        this.edgeMap.delete(id);\n        this.changes.push({ type: 'EdgeRemoved', value: edge });\n    }\n    /**\n     * Remove edges whose id was included in the given id list.\n     * @group EdgeMethods\n     */\n    removeEdges(idList) {\n        this.batch(() => {\n            idList.forEach((id) => this.doRemoveEdge(id));\n        });\n    }\n    /**\n     * Remove a single edge of the given id.\n     * @group EdgeMethods\n     */\n    removeEdge(id) {\n        this.removeEdges([id]);\n    }\n    /**\n     * Change the source of an edge. The source must be found in current graph.\n     * @group EdgeMethods\n     */\n    updateEdgeSource(id, source) {\n        const edge = this.getEdge(id);\n        this.checkNodeExistence(source);\n        const oldSource = edge.source;\n        const newSource = source;\n        this.outEdgesMap.get(oldSource).delete(edge);\n        this.outEdgesMap.get(newSource).add(edge);\n        edge.source = source;\n        this.batch(() => {\n            this.changes.push({\n                type: 'EdgeUpdated',\n                id,\n                propertyName: 'source',\n                oldValue: oldSource,\n                newValue: newSource,\n            });\n        });\n    }\n    /**\n     * Change the target of an edge. The target must be found in current graph.\n     * @group EdgeMethods\n     */\n    updateEdgeTarget(id, target) {\n        const edge = this.getEdge(id);\n        this.checkNodeExistence(target);\n        const oldTarget = edge.target;\n        const newTarget = target;\n        this.inEdgesMap.get(oldTarget).delete(edge);\n        this.inEdgesMap.get(newTarget).add(edge);\n        edge.target = target;\n        this.batch(() => {\n            this.changes.push({\n                type: 'EdgeUpdated',\n                id,\n                propertyName: 'target',\n                oldValue: oldTarget,\n                newValue: newTarget,\n            });\n        });\n    }\n    /**\n     * Update edge data.\n     * @group EdgeMethods\n     */\n    updateEdgeData(id, propertyName, value) {\n        const edge = this.getEdge(id);\n        this.batch(() => {\n            const oldValue = edge.data[propertyName];\n            const newValue = value;\n            edge.data[propertyName] = newValue;\n            this.changes.push({\n                type: 'EdgeDataUpdated',\n                id,\n                propertyName,\n                oldValue,\n                newValue,\n            });\n        });\n    }\n    /**\n     * @group EdgeMethods\n     */\n    mergeEdgeData(id, patch) {\n        this.batch(() => {\n            Object.entries(patch).forEach(([propertyName, value]) => {\n                this.updateEdgeData(id, propertyName, value);\n            });\n        });\n    }\n    // ================= Tree =================\n    checkTreeExistence(treeKey) {\n        if (!this.treeIndices.has(treeKey)) {\n            throw new Error('Tree structure not found for treeKey: ' + treeKey);\n        }\n    }\n    /**\n     * Attach a new tree structure representing the hierarchy of all nodes in the graph.\n     * @param treeKey A unique key of the tree structure. You can attach multiple tree structures with different keys.\n     *\n     * ```ts\n     * const graph = new Graph({\n     *   nodes: [{ id: 1 }, { id: 2 }, { id: 3 }],\n     * });\n     * graph.attachTreeStructure('Inheritance');\n     * graph.setParent(2, 1, 'Inheritance');\n     * graph.setParent(3, 1, 'Inheritance');\n     * graph.getRoots('Inheritance'); // [1]\n     * graph.getChildren(1, 'Inheritance'); // [2,3]\n     * ```\n     * @group TreeMethods\n     */\n    attachTreeStructure(treeKey) {\n        if (this.treeIndices.has(treeKey)) {\n            // Already attached.\n            return;\n        }\n        this.treeIndices.set(treeKey, {\n            parentMap: new Map(),\n            childrenMap: new Map(),\n        });\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureAttached',\n                treeKey,\n            });\n        });\n    }\n    /**\n     * Detach the tree structure of the given tree key from the graph.\n     *\n     * ```ts\n     * graph.detachTreeStructure('Inheritance');\n     * graph.getRoots('Inheritance'); // Error!\n     * ```\n     * @group TreeMethods\n     */\n    detachTreeStructure(treeKey) {\n        this.checkTreeExistence(treeKey);\n        this.treeIndices.delete(treeKey);\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureDetached',\n                treeKey,\n            });\n        });\n    }\n    /**\n     * Traverse the given tree data, add each node into the graph, then attach the tree structure.\n     *\n     * ```ts\n     * graph.addTree({\n     *   id: 1,\n     *   children: [\n     *     { id: 2 },\n     *     { id: 3 },\n     *   ],\n     * }, 'Inheritance');\n     * graph.getRoots('Inheritance'); // [1]\n     * graph.getChildren(1, 'Inheritance'); // [2, 3]\n     * graph.getAllNodes(); // [1, 2, 3]\n     * graph.getAllEdges(); // []\n     * ```\n     * @group TreeMethods\n     */\n    addTree(tree, treeKey) {\n        this.batch(() => {\n            this.attachTreeStructure(treeKey);\n            // Add Nodes\n            const nodes = [];\n            const stack = Array.isArray(tree) ? tree : [tree];\n            while (stack.length) {\n                const node = stack.shift();\n                nodes.push(node);\n                if (node.children) {\n                    stack.push(...node.children);\n                }\n            }\n            this.addNodes(nodes);\n            // Set parent for each child node.\n            nodes.forEach((parent) => {\n                parent.children?.forEach((child) => {\n                    this.setParent(child.id, parent.id, treeKey);\n                });\n            });\n        });\n    }\n    /**\n     * Get the root nodes of an attached tree structure.\n     *\n     * Consider a graph with the following tree structure attached:\n     * ```\n     * Tree structure:\n     *    O     3\n     *   / \\    |\n     *  1   2   4\n     * ```\n     * `graph.getRoots()` takes all nodes without a parent, therefore [0, 3] was returned.\n     *\n     * Newly added nodes are also unparented. So they are counted as roots.\n     * ```ts\n     * graph.addNode({ id: 5 });\n     * graph.getRoots(); // [0, 3, 5]\n     * ```\n     *\n     * Here is how the tree structure looks like:\n     * ```\n     * Tree structure:\n     *    O     3  5\n     *   / \\    |\n     *  1   2   4\n     * ```\n     *\n     * By setting a parent, a root node no more be a root.\n     * ```ts\n     * graph.setParent(5, 2);\n     * graph.getRoots(); // [0, 3]\n     * ```\n     *\n     * The tree structure now becomes:\n     * ```\n     * Tree structure:\n     *    O     3\n     *   / \\    |\n     *  1   2   4\n     *      |\n     *      5\n     * ```\n     *\n     * Removing a node forces its children to be unparented, or roots.\n     * ```ts\n     * graph.removeNode(0);\n     * graph.getRoots(); // [1, 2, 3]\n     * ```\n     *\n     * You might draw the the structure as follow:\n     * ```\n     * Tree structure:\n     *  1   2  3\n     *      |  |\n     *      5  4\n     * ```\n     * @group TreeMethods\n     */\n    getRoots(treeKey) {\n        this.checkTreeExistence(treeKey);\n        return this.getAllNodes().filter((node) => !this.getParent(node.id, treeKey));\n    }\n    /**\n     * Given a node ID and an optional tree key, get the children of the node in the specified tree structure.\n     * @group TreeMethods\n     */\n    getChildren(id, treeKey) {\n        this.checkNodeExistence(id);\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        const children = tree.childrenMap.get(id);\n        return Array.from(children || []);\n    }\n    /**\n     * Given a node ID and an optional tree key, get the parent of the node in the specified tree structure.\n     * If the given node is one of the tree roots, this returns null.\n     * @group TreeMethods\n     */\n    getParent(id, treeKey) {\n        this.checkNodeExistence(id);\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        return tree.parentMap.get(id) || null;\n    }\n    /**\n     * Set node parent. If this operation causes a circle, it fails with an error.\n     * @param id - ID of the child node.\n     * @param parent - ID of the parent node.\n     * @param treeKey - Which tree structure the relation is applied to.\n     * @group TreeMethods\n     */\n    setParent(id, parent, treeKey) {\n        this.checkTreeExistence(treeKey);\n        const tree = this.treeIndices.get(treeKey);\n        const node = this.getNode(id);\n        const oldParent = tree.parentMap.get(id);\n        const newParent = this.getNode(parent);\n        // Set parent\n        tree.parentMap.set(id, newParent);\n        // Set children\n        if (oldParent) {\n            tree.childrenMap.get(oldParent.id)?.delete(node);\n        }\n        let children = tree.childrenMap.get(newParent.id);\n        if (!children) {\n            children = new Set();\n            tree.childrenMap.set(newParent.id, children);\n        }\n        children.add(node);\n        this.batch(() => {\n            this.changes.push({\n                type: 'TreeStructureChanged',\n                treeKey,\n                nodeId: id,\n                oldParentId: oldParent?.id,\n                newParentId: newParent.id,\n            });\n        });\n    }\n    // ================= Graph =================\n    /**\n     * Get all nodes in the graph as an array.\n     */\n    getAllNodes() {\n        return Array.from(this.nodeMap.values());\n    }\n    /**\n     * Get all edges in the graph as an array.\n     */\n    getAllEdges() {\n        return Array.from(this.edgeMap.values());\n    }\n    doBFS(queue, visited, fn) {\n        while (queue.length) {\n            const node = queue.shift();\n            fn(node);\n            visited.add(node.id);\n            this.getSuccessors(node.id).forEach((n) => {\n                if (!visited.has(n.id)) {\n                    visited.add(n.id);\n                    queue.push(n);\n                }\n            });\n        }\n    }\n    bfs(id, fn) {\n        this.doBFS([this.getNode(id)], new Set(), fn);\n    }\n    doDFS(node, visited, fn) {\n        fn(node);\n        visited.add(node.id);\n        this.getSuccessors(node.id).forEach((n) => {\n            if (!visited.has(n.id)) {\n                this.doDFS(n, visited, fn);\n            }\n        });\n    }\n    dfs(id, fn) {\n        this.doDFS(this.getNode(id), new Set(), fn);\n    }\n    clone() {\n        // Make a shallow copy of nodes and edges.\n        const newNodes = this.getAllNodes().map((oldNode) => {\n            return { ...oldNode, data: { ...oldNode.data } };\n        });\n        const newEdges = this.getAllEdges().map((oldEdge) => {\n            return { ...oldEdge, data: { ...oldEdge.data } };\n        });\n        // Create a new graph with shallow copied nodes and edges.\n        const newGraph = new Graph({\n            nodes: newNodes,\n            edges: newEdges,\n        });\n        // Add tree indices.\n        this.treeIndices.forEach(({ parentMap: oldParentMap, childrenMap: oldChildrenMap }, treeKey) => {\n            const parentMap = new Map();\n            oldParentMap.forEach((parent, key) => {\n                parentMap.set(key, newGraph.getNode(parent.id));\n            });\n            const childrenMap = new Map();\n            oldChildrenMap.forEach((children, key) => {\n                childrenMap.set(key, new Set(Array.from(children).map((n) => newGraph.getNode(n.id))));\n            });\n            newGraph.treeIndices.set(treeKey, {\n                parentMap: parentMap,\n                childrenMap: childrenMap,\n            });\n        });\n        return newGraph;\n    }\n    toJSON() {\n        return JSON.stringify({\n            nodes: this.getAllNodes(),\n            edges: this.getAllEdges(),\n            // FIXME: And tree structures?\n        });\n    }\n}\n//# sourceMappingURL=Graph.js.map"],"names":["root","factory","exports","module","define","amd","self","has","Object","prototype","hasOwnProperty","prefix","Events","EE","fn","context","once","this","addListener","emitter","event","TypeError","listener","evt","_events","push","_eventsCount","clearEvent","EventEmitter","create","__proto__","eventNames","events","name","names","call","slice","getOwnPropertySymbols","concat","listeners","handlers","i","l","length","ee","Array","listenerCount","emit","a1","a2","a3","a4","a5","args","len","arguments","removeListener","undefined","apply","j","on","removeAllListeners","off","prefixed","addMethods","methods","w","Worker","URL","createObjectURL","Blob","revokeObjectURL","worker","c","callbacks","addEventListener","e","d","data","type","id","f","error","assign","Error","message","result","document","createEvent","initEvent","method","params","dispatchEvent","forEach","_arguments","Promise","a","b","postMessage","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","__webpack_modules__","n","getter","__esModule","definition","key","o","defineProperty","enumerable","get","obj","prop","r","Symbol","toStringTag","value","extendStatics","setPrototypeOf","p","__assign","t","s","__read","m","iterator","ar","next","done","__spreadArray","to","from","pack","isString","val","camelizeRE","str","replace","_","toUpperCase","isArray","floydWarshall","adjMatrix","dist","size","Infinity","k","getAdjMatrix","directed","nodes","edges","matrix","nodeMap","node","source","target","sIndex","tIndex","isObject","clone","Date","getTime","v","map","keys","isFunction","getFuncByUnknownType","defaultValue","resultIsNumber","max","Math","isNaN","width","height","DEFAULTS_LAYOUT_OPTIONS","radius","startRadius","endRadius","startAngle","endAngle","PI","clockwise","divisions","ordering","angleRatio","options","execute","graph","genericCircularLayout","batch","mergedOptions","center","paramNodeSpacing","paramNodeSize","layoutInvisibles","onLayoutEnd","getAllNodes","getAllEdges","filter","visible","edge","calculateCenter","calculatedWidth","calculatedHeight","calculatedCenter","mergeNodeData","x","y","angleStep","nSize","min","astep","layoutNodes","topologyOrdering","orderedNodes","sort","nodeA","nodeB","getDegree","degreeOrdering","divN","ceil","angle","floor","cos","sin","orderedCNodes","pickFlags","areNeighbors","children","getSuccessors","getNeighbors","foundChild","child","ii","window","innerWidth","innerHeight","SupervisorEvent","LAYOUT_ITERATION","LAYOUT_END","layout","spawnWorker","String","__","constructor","terminate","running","start","payload","arraybufferWithNodesEdges","Float32Array","calculateLayout","then","positions","stop","kill","isRunning","nodeSize","minNodeSpacing","nodeSpacing","preventOverlap","sweep","equidistant","maxLevelDiff","sortBy","genericConcentricLayout","propsCenter","propsWidth","propsHeight","propsSortBy","propsMaxLevelDiff","propsSweep","maxNodeSize","maxNodeSpacing","nodeIdxMap","n1","n2","maxValueNode","levels","currentLevel","diff","abs","minDist","firstLvlHasMulti","rStep","level","dTheta","dcos","dsin","rMin","sqrt","rDelta","rr","theta","begin","preventOverlapPadding","condense","rows","cols","position","genericGridLayout","columns","propsRows","propsCols","cells","rcs","splits","round","sm","small","lg","large","cellWidth","cellHeight","nodeW","nodeH","oNode","getNode","res","h","cellUsed","rc","row","col","id2manPos","rcPos","pos","used","use","getPos","usedRows","usedCols","moveToNextCell","toString","isAnyArray","endsWith","input","_options$fromIndex","fromIndex","_options$toIndex","toIndex","Number","isInteger","maxValue","minValue","rescale","output","currentMin","currentMax","RangeError","_options$min","autoMinMax","_options$max","factor","indent","repeat","indentData","inspectMatrixWithOptions","maxRows","maxColumns","maxNumSize","padMinus","maxI","maxJ","loop","line","formatNumber","join","inspectData","num","formatNumber2","padEnd","fix","toFixed","startsWith","exp","toExponential","checkRowIndex","index","outer","checkColumnIndex","checkRowVector","vector","to1DArray","checkColumnVector","checkRange","startRow","endRow","startColumn","endColumn","checkNumber","newArray","array","checkNonEmpty","isEmpty","AbstractMatrix","static","newRows","newColumns","newData","newMatrix","Matrix","column","set","fill","random","interval","zeros","matrix1","matrix2","checkMatrix","isMatrix","klass","callback","to2DArray","copy","toJSON","isRowVector","isColumnVector","isVector","isSquare","isSymmetric","isEchelonForm","previousColumn","checked","isReducedEchelonForm","echelonForm","iMax","swapRows","tmp","reducedEchelonForm","maxRow","pivot","setSubMatrix","neg","mulS","getRow","getRowVector","rowVector","setRow","row1","row2","temp","getColumn","getColumnVector","columnVector","setColumn","swapColumns","column1","column2","addRowVector","subRowVector","mulRowVector","divRowVector","addColumnVector","subColumnVector","mulColumnVector","divColumnVector","mulRow","mulColumn","by","NaN","NEGATIVE_INFINITY","maxIndex","idx","POSITIVE_INFINITY","minIndex","maxRowIndex","minRow","minRowIndex","maxColumn","maxColumnIndex","minColumn","minColumnIndex","diag","norm","cumulativeSum","sum","dot","vector2","vector1","mmul","other","Bcolj","Float64Array","strassen2x2","a11","b11","a12","b12","a21","b21","a22","b22","m1","m2","m3","m4","m5","c00","c01","c10","c11","strassen3x3","a00","a01","a02","a10","a20","b00","b01","b02","b10","b20","m6","m7","m8","m9","m12","m13","m14","m15","m16","m17","m18","c02","c12","c20","c21","c22","mmulStrassen","r1","c1","r2","c2","embed","mat","resultat","console","warn","blockMult","halfRows","parseInt","halfCols","subMatrix","add","sub","scaleRows","isFinite","scaleColumns","flipRows","middle","first","last","flipColumns","kroneckerProduct","q","kroneckerSum","AxI","eye","IxB","transpose","sortRows","compareFunction","compareNumbers","sortColumns","subMatrixRow","indices","subMatrixColumn","selection","rowIndices","columnIndices","checkRowIndices","checkColumnIndices","rowIndex","columnIndex","trace","sumByRow","sumByColumn","sumAll","product","productByRow","productByColumn","productAll","mean","variance","unbiased","sum1","sum2","varianceByRow","varianceByColumn","varianceAll","standardDeviation","centerByRow","centerByColumn","centerAll","scale","pow","getScaleByRow","scaleByRow","getScaleByColumn","scaleByColumn","divider","getScaleAll","scaleAll","for","rand","randomInt","randInt","diagonal","identity","negate","tensorProduct","nRows","nColumns","super","arrayData","every","element","removeRow","splice","addRow","removeColumn","newRow","addColumn","addS","addM","subS","subM","subtract","subtractS","subtractM","mul","mulM","multiply","multiplyS","multiplyM","div","divS","divM","divide","divideS","divideM","mod","modS","modM","modulus","modulusS","modulusM","and","andS","andM","or","orS","orM","xor","xorS","xorM","leftShift","leftShiftS","leftShiftM","signPropagatingRightShift","signPropagatingRightShiftS","signPropagatingRightShiftM","rightShift","rightShiftS","rightShiftM","zeroFillRightShift","zeroFillRightShiftS","zeroFillRightShiftM","not","acos","acosh","asin","asinh","atan","atanh","cbrt","clz32","cosh","expm1","fround","log","log1p","log10","log2","sign","sinh","tan","tanh","trunc","arg0","powS","powM","installMathOperations","WrapperMatrix2D","hypotenuse","SingularValueDecomposition","computeLeftSingularVectors","computeRightSingularVectors","autoTranspose","wantu","Boolean","wantv","swapped","aux","nu","ni","U","V","work","si","nct","nrt","mrc","pp","iter","eps","EPSILON","kase","alpha","MIN_VALUE","ks","cs","sn","sp","spm1","epm1","sk","ek","shift","g","solve","Y","threshold","scols","Ls","rightSingularVectors","VL","vrows","urows","VLU","solveForDiagonal","inverse","vcols","X","ucols","condition","norm2","rank","tol","leftSingularVectors","diagonalMatrix","linkDistance","genericMDSLayout","distances","handleInfinity","scaledD","ratio","scaleMatrix","runMDS","cnode","maxDistance","M","rowMeans","colMeans","totalMean","ret","eigenValues","iterations","speed","gravity","getRepulsion","disp","radii","nodeSizeFunc","u","vecx","vecy","vecLength","common","updatePositions","strictRadial","focusIdx","maxDisplace","maxDisp","di","vx","vy","vLength","vpx","vpy","diLength","tdispLength","distLength","limitedDist","nfDis","maxIteration","focusNode","unitRadius","maxPreventOverlapIteration","sortStrength","genericRadialLayout","propsFocusNode","propsUnitRadius","focusIndex","getIndexById","maxToFocus","focusNodeD","semiWidth","semiHeight","maxRadius","maxD","idealDistances","eIdealDisMatrix","weights","getWeightMatrix","dimension","mds","run","formatNodeSize","nonoverlapForceParams","radialNonoverlapForce","param","oneIteration","vparam","originDis","getEDistance","reciODis","xMolecule","yMolecule","denominator","edis","reciEdis","idealDis","reciR","iValue","jValue","charCodeAt","link","p1","p2","step","minus","nodeSpacingFunc","bboxSize","genericRandomLayout","registry","circular","CircularLayout","concentric","ConcentricLayout","MDSLayout","RandomLayout","grid","GridLayout","radial","RadialLayout","registerLayout","Graph","Map","edgeMap","inEdgesMap","outEdgesMap","treeIndices","changes","batchCount","onChanged","addNodes","addEdges","tree","addTree","commit","reduceChanges","mergedChanges","change","isNewlyAdded","pastChange","sameId","nodeId","existingChange","find","propertyName","newValue","treeKey","newParentId","checkNodeExistence","hasNode","firstNodeId","secondNodeId","some","neighbor","getRelatedEdges","direction","inEdges","outEdges","bothEdges","Set","targets","getPredecessors","sources","predecessors","successors","doAddNode","childrenMap","addNode","doRemoveNode","doRemoveEdge","delete","parentMap","removeNodes","idList","removeNode","updateNodeData","oldValue","patch","entries","checkEdgeExistence","hasEdge","getEdge","getEdgeDetail","doAddEdge","addEdge","removeEdges","removeEdge","updateEdgeSource","oldSource","newSource","updateEdgeTarget","oldTarget","newTarget","updateEdgeData","mergeEdgeData","checkTreeExistence","attachTreeStructure","detachTreeStructure","stack","parent","setParent","getRoots","getParent","getChildren","oldParent","newParent","oldParentId","values","doBFS","queue","visited","bfs","doDFS","dfs","newNodes","oldNode","newEdges","oldEdge","newGraph","oldParentMap","oldChildrenMap","JSON","stringify"],"sourceRoot":""}