@antv/layout 1.2.14-beta.1 → 1.2.14-beta.3

package/dist/85db61ddc757dae66e04.worker.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"85db61ddc757dae66e04.worker.js","mappings":"4BAsBAA,EAAOC,QAAU,CACfC,SAAU,EAAQ,MAElBC,OAAQ,EAAQ,MAChBC,MAAO,EAAQ,MACfC,KAAM,CACJC,KAAM,aACNC,OAAQ,gBAEVC,QAAS,EAAQ,M,8BC7BnB,IAAIC,EAAI,EAAQ,MACZC,EAAY,EAAQ,MAExBV,EAAOC,QAAU,CACfU,IAIF,SAAaC,GACX,IAAIC,EAA+B,WAAxBD,EAAEE,QAAQC,UACjBL,EAAUE,EAUd,SAAkBA,GAChB,OAAO,SAASI,GACd,OAAOJ,EAAEK,KAAKD,GAAGE,MACnB,CACF,CAdiBC,CAASP,IAiB5B,SAAgBA,GACd,IAAIC,EAAM,GACNO,EAAQ,CAAC,EACTC,EAAU,CAAC,EAmBf,OADAZ,EAAEa,QAAQV,EAAEW,SAhBZ,SAASC,EAAIC,GACPhB,EAAEiB,IAAIL,EAASI,KAGnBJ,EAAQI,IAAK,EACbL,EAAMK,IAAK,EACXhB,EAAEa,QAAQV,EAAEe,SAASF,IAAI,SAAST,GAC5BP,EAAEiB,IAAIN,EAAOJ,EAAEY,GACjBf,EAAIgB,KAAKb,GAETQ,EAAIR,EAAEY,EAEV,WACOR,EAAMK,GACf,IAGOZ,CACT,CAvCMiB,CAAOlB,GACXH,EAAEa,QAAQT,GAAK,SAASG,GACtB,IAAIe,EAAQnB,EAAEK,KAAKD,GACnBJ,EAAEoB,WAAWhB,GACbe,EAAME,YAAcjB,EAAEkB,KACtBH,EAAMI,UAAW,EACjBvB,EAAEwB,QAAQpB,EAAEY,EAAGZ,EAAES,EAAGM,EAAOtB,EAAE4B,SAAS,OACxC,GAOF,EApBEC,KA+CF,SAAc1B,GACZH,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIe,EAAQnB,EAAEK,KAAKD,GACnB,GAAIe,EAAMI,SAAU,CAClBvB,EAAEoB,WAAWhB,GAEb,IAAIiB,EAAcF,EAAME,mBACjBF,EAAMI,gBACNJ,EAAME,YACbrB,EAAEwB,QAAQpB,EAAEY,EAAGZ,EAAES,EAAGM,EAAOE,EAC7B,CACF,GACF,E,iBClEA,IAAIxB,EAAI,EAAQ,MACZJ,EAAO,EAAQ,MA2BnB,SAASmC,EAAc5B,EAAG6B,EAAMC,EAAQC,EAAIC,EAAQC,GAClD,IAAId,EAAQ,CAAEe,MAAO,EAAGC,OAAQ,EAAGF,KAAMA,EAAMG,WAAYP,GACvDQ,EAAOL,EAAOH,GAAMI,EAAO,GAC3BK,EAAO7C,EAAK8C,aAAavC,EAAG,SAAUmB,EAAOW,GACjDE,EAAOH,GAAMI,GAAQK,EACrBtC,EAAEwC,UAAUF,EAAMP,GACdM,GACFrC,EAAEwB,QAAQa,EAAMC,EAAM,CAAEhC,OAAQ,GAEpC,CAlCAlB,EAAOC,QAEP,SAA2BW,GAoBzBH,EAAEa,QAAQV,EAAEyC,YAnBZ,SAAS7B,EAAIC,GACX,IAAI4B,EAAWzC,EAAEyC,SAAS5B,GACtB6B,EAAO1C,EAAE0C,KAAK7B,GAKlB,GAJI4B,EAASE,QACX9C,EAAEa,QAAQ+B,EAAU7B,GAGlBf,EAAEiB,IAAI4B,EAAM,WAAY,CAC1BA,EAAKE,WAAa,GAClBF,EAAKG,YAAc,GACnB,IAAK,IAAIZ,EAAOS,EAAKI,QAASC,EAAUL,EAAKK,QAAU,EACrDd,EAAOc,IACLd,EACFL,EAAc5B,EAAG,aAAc,MAAOa,EAAG6B,EAAMT,GAC/CL,EAAc5B,EAAG,cAAe,MAAOa,EAAG6B,EAAMT,EAEpD,CACF,GAGF,C,8BCxBA,IAAIpC,EAAI,EAAQ,MA0BhB,SAASmD,EAAgBhD,GACvBH,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAAKoC,EAAmBjD,EAAE0C,KAAK7B,GAAK,IAClEhB,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAAK6C,EAAmBjD,EAAEK,KAAKD,GAAK,GACpE,CAEA,SAAS6C,EAAmBC,GAC1B,IAAIlC,EAAIkC,EAAMhB,MACdgB,EAAMhB,MAAQgB,EAAMf,OACpBe,EAAMf,OAASnB,CACjB,CAcA,SAASmC,EAAYD,GACnBA,EAAME,GAAKF,EAAME,CACnB,CAcA,SAASC,EAAUH,GACjB,IAAII,EAAIJ,EAAMI,EACdJ,EAAMI,EAAIJ,EAAME,EAChBF,EAAME,EAAIE,CACZ,CAnEAlE,EAAOC,QAAU,CACfkE,OAIF,SAAgBvD,GACd,IAAIwD,EAAUxD,EAAEE,QAAQuD,QAAQC,cAChB,OAAZF,GAAgC,OAAZA,GACtBR,EAAgBhD,EAEpB,EARE0B,KAUF,SAAc1B,GACZ,IAAIwD,EAAUxD,EAAEE,QAAQuD,QAAQC,cAChB,OAAZF,GAAgC,OAAZA,GAqB1B,SAAkBxD,GAChBH,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAAKsC,EAAYnD,EAAE0C,KAAK7B,GAAK,IAE3DhB,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIC,EAAOL,EAAEK,KAAKD,GAClBP,EAAEa,QAAQL,EAAKsD,OAAQR,GACnBtD,EAAEiB,IAAIT,EAAM,MACd8C,EAAY9C,EAEhB,GACF,CA9BIuD,CAAS5D,GAGK,OAAZwD,GAAgC,OAAZA,IAiC1B,SAAgBxD,GACdH,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAAKwC,EAAUrD,EAAE0C,KAAK7B,GAAK,IAEzDhB,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIC,EAAOL,EAAEK,KAAKD,GAClBP,EAAEa,QAAQL,EAAKsD,OAAQN,GACnBxD,EAAEiB,IAAIT,EAAM,MACdgD,EAAUhD,EAEd,GACF,CA1CIwD,CAAO7D,GACPgD,EAAgBhD,GAEpB,E,WCnBA,SAAS8D,IACP,IAAIC,EAAW,CAAC,EAChBA,EAASC,MAAQD,EAASE,MAAQF,EAClCG,KAAKC,UAAYJ,CACnB,CAiCA,SAASK,EAAOC,GACdA,EAAMJ,MAAMD,MAAQK,EAAML,MAC1BK,EAAML,MAAMC,MAAQI,EAAMJ,aACnBI,EAAML,aACNK,EAAMJ,KACf,CAEA,SAASK,EAAeC,EAAG1D,GACzB,GAAU,UAAN0D,GAAuB,UAANA,EACnB,OAAO1D,CAEX,CAlDAzB,EAAOC,QAAUyE,EAQjBA,EAAKU,UAAUC,QAAU,WACvB,IAAIV,EAAWG,KAAKC,UAChBE,EAAQN,EAASE,MACrB,GAAII,IAAUN,EAEZ,OADAK,EAAOC,GACAA,CAEX,EAEAP,EAAKU,UAAUE,QAAU,SAASL,GAChC,IAAIN,EAAWG,KAAKC,UAChBE,EAAMJ,OAASI,EAAML,OACvBI,EAAOC,GAETA,EAAML,MAAQD,EAASC,MACvBD,EAASC,MAAMC,MAAQI,EACvBN,EAASC,MAAQK,EACjBA,EAAMJ,MAAQF,CAChB,EAEAD,EAAKU,UAAUG,SAAW,WAIxB,IAHA,IAAIC,EAAO,GACPb,EAAWG,KAAKC,UAChB7B,EAAOyB,EAASE,MACb3B,IAASyB,GACda,EAAK3D,KAAK4D,KAAKC,UAAUxC,EAAMgC,IAC/BhC,EAAOA,EAAK2B,MAEd,MAAO,IAAMW,EAAKG,KAAK,MAAQ,GACjC,C,iBC1CA,IAAIlF,EAAI,EAAQ,MACZJ,EAAO,EAAQ,MACfuF,EAAQ,cAEZ5F,EAAOC,QAAU,CACf4F,cAIF,SAAuBjF,GACrB,IAAIkF,EAAczF,EAAK0F,iBAAiBnF,GAEpCoF,EAAI,IAAIJ,EAAM,CAAEK,UAAU,EAAMC,YAAY,IAAQC,SAAS,CAAC,GAoBlE,OAlBA1F,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5BuE,EAAEI,QAAQ3E,EAAG,CAAEM,MAAON,IACtBuE,EAAE5C,UAAU3B,EAAG,QAAUb,EAAE0C,KAAK7B,GAAGoB,KACrC,IAEApC,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5BgF,EAAE5D,QAAQpB,EAAES,EAAGT,EAAEY,EAAG,CAAC,EAAGZ,EAAEkB,KAC5B,IAEAzB,EAAEa,QAAQwE,GAAa,SAASO,EAAOC,GACrC,IAAIC,EAAS,QAAUD,EACvBN,EAAEI,QAAQG,EAAQ,CAAE1D,KAAM,SAC1BpC,EAAE+F,OAAOH,GAAO,SAASI,EAAGhF,GAE1B,OADAuE,EAAE5D,QAAQqE,EAAGhF,EAAG,CAAEiF,MAAO,UAClBjF,CACT,GACF,IAEOuE,CACT,E,iBC/BA,IAAI9F,EAGF,IACEA,EAAW,EAAQ,KACrB,CAAE,MAAOc,GAET,CAGGd,IACHA,EAAWyG,OAAOzG,UAGpBF,EAAOC,QAAUC,C,iBChBjB,IAAIO,EAAI,EAAQ,MACZmF,EAAQ,cACRlB,EAAO,EAAQ,MASnB1E,EAAOC,QAIP,SAAmBW,EAAGO,GACpB,GAAIP,EAAEgG,aAAe,EACnB,MAAO,GAET,IAAIC,EA4DN,SAAoBjG,EAAGO,GACrB,IAAI2F,EAAW,IAAIlB,EACfmB,EAAQ,EACRC,EAAS,EAEbvG,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5BqF,EAASV,QAAQ3E,EAAG,CAAEA,EAAGA,EAAG,GAAM,EAAGwF,IAAK,GAC5C,IAIAxG,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIkG,EAAaJ,EAAS7F,KAAKD,EAAES,EAAGT,EAAEY,IAAM,EACxCV,EAASC,EAASH,GAClBmG,EAAaD,EAAahG,EAC9B4F,EAAS1E,QAAQpB,EAAES,EAAGT,EAAEY,EAAGuF,GAC3BH,EAASI,KAAKC,IAAIL,EAAQF,EAASxD,KAAKtC,EAAES,GAAGwF,KAAO/F,GACpD6F,EAASK,KAAKC,IAAIN,EAAQD,EAASxD,KAAKtC,EAAEY,GAAO,IAAMV,EACzD,IAEA,IAAIoG,EAAU7G,EAAE8G,MAAMP,EAASD,EAAQ,GAAGS,KAAI,WAAa,OAAO,IAAI9C,CAAQ,IAC1E+C,EAAUV,EAAQ,EAMtB,OAJAtG,EAAEa,QAAQwF,EAASvF,SAAS,SAASE,GACnCiG,EAAaJ,EAASG,EAASX,EAASxD,KAAK7B,GAC/C,IAEO,CAAEX,MAAOgG,EAAUQ,QAASA,EAASG,QAASA,EACvD,CAxFcE,CAAW/G,EAAGO,GAAYyG,GAClCC,EAQN,SAAqBjH,EAAG0G,EAASG,GAM/B,IALA,IAIIxC,EAJA4C,EAAU,GACVC,EAAUR,EAAQA,EAAQ/D,OAAS,GACnCwE,EAAQT,EAAQ,GAGb1G,EAAEgG,aAAa,CACpB,KAAQ3B,EAAQ8C,EAAM1C,WAAgB2C,EAAWpH,EAAG0G,EAASG,EAASxC,GACtE,KAAQA,EAAQ6C,EAAQzC,WAAc2C,EAAWpH,EAAG0G,EAASG,EAASxC,GACtE,GAAIrE,EAAEgG,YACJ,IAAK,IAAIN,EAAIgB,EAAQ/D,OAAS,EAAG+C,EAAI,IAAKA,EAExC,GADArB,EAAQqC,EAAQhB,GAAGjB,UACR,CACTwC,EAAUA,EAAQI,OAAOD,EAAWpH,EAAG0G,EAASG,EAASxC,GAAO,IAChE,KACF,CAGN,CAEA,OAAO4C,CACT,CA7BgBK,CAAYrB,EAAM/F,MAAO+F,EAAMS,QAAST,EAAMY,SAG5D,OAAOhH,EAAE0H,QAAQ1H,EAAE+G,IAAIK,GAAS,SAAS7G,GACvC,OAAOJ,EAAEe,SAASX,EAAES,EAAGT,EAAEY,EAC3B,KAAI,EACN,EAbA,IAAIgG,EAAoBnH,EAAE2H,SAAS,GAsCnC,SAASJ,EAAWpH,EAAG0G,EAASG,EAASxC,EAAOoD,GAC9C,IAAIR,EAAUQ,EAAsB,QAAKC,EAwBzC,OAtBA7H,EAAEa,QAAQV,EAAE2H,QAAQtD,EAAMxD,IAAI,SAASR,GACrC,IAAIC,EAASN,EAAEK,KAAKA,GAChBuH,EAAS5H,EAAE0C,KAAKrC,EAAKQ,GAErB4G,GACFR,EAAQhG,KAAK,CAAEJ,EAAGR,EAAKQ,EAAGG,EAAGX,EAAKW,IAGpC4G,EAAOvB,KAAO/F,EACdwG,EAAaJ,EAASG,EAASe,EACjC,IAEA/H,EAAEa,QAAQV,EAAEe,SAASsD,EAAMxD,IAAI,SAASR,GACtC,IAAIC,EAASN,EAAEK,KAAKA,GAChBW,EAAIX,EAAKW,EACT6G,EAAS7H,EAAE0C,KAAK1B,GACpB6G,EAAW,IAAKvH,EAChBwG,EAAaJ,EAASG,EAASgB,EACjC,IAEA7H,EAAEoH,WAAW/C,EAAMxD,GAEZoG,CACT,CAgCA,SAASH,EAAaJ,EAASG,EAASxC,GACjCA,EAAMgC,IAEChC,EAAU,GAGpBqC,EAAQrC,EAAMgC,IAAMhC,EAAU,GAAIwC,GAASnC,QAAQL,GAFnDqC,EAAQA,EAAQ/D,OAAS,GAAG+B,QAAQL,GAFpCqC,EAAQ,GAAGhC,QAAQL,EAMvB,C,8BCnHA,IAAIxE,EAAI,EAAQ,MACZiI,EAAU,EAAQ,MAClBC,EAAY,EAAQ,MACpB9F,EAAO,EAAQ,MACf+F,EAAiB,uBACjBC,EAAoB,EAAQ,MAC5BC,EAAmB,yBACnBC,EAAe,EAAQ,MACvBC,EAAoB,EAAQ,MAC5BC,EAAmB,EAAQ,MAC3BC,EAAQ,EAAQ,MAChBC,EAAW,EAAQ,MACnB9I,EAAO,EAAQ,MACfuF,EAAQ,cAEZ5F,EAAOC,QAEP,SAAgBW,EAAGwI,GACjB,IAAI9I,EAAO8I,GAAQA,EAAKC,YAAchJ,EAAKC,KAAOD,EAAKE,OACvDD,EAAK,UAAU,WACb,IAAIgJ,EACFhJ,EAAK,sBAAsB,WAAa,OA2F9C,SAA0BiJ,GACxB,IAAI3I,EAAI,IAAIgF,EAAM,CAAEM,YAAY,EAAMD,UAAU,IAC5CnF,EAAQ0I,EAAaD,EAAWzI,SAqBpC,OAnBAF,EAAEuF,SAAS1F,EAAEgJ,MAAM,CAAC,EAClBC,EACAC,EAAkB7I,EAAO8I,GACzBnJ,EAAEoJ,KAAK/I,EAAOgJ,KAEhBrJ,EAAEa,QAAQiI,EAAWhI,SAAS,SAASE,GACrC,IAAI6B,EAAOkG,EAAaD,EAAWjG,KAAK7B,IACxCb,EAAEwF,QAAQ3E,EAAGhB,EAAEsJ,SAASJ,EAAkBrG,EAAM0G,GAAeC,IAC/DrJ,EAAEwC,UAAU3B,EAAG8H,EAAWW,OAAOzI,GACnC,IAEAhB,EAAEa,QAAQiI,EAAWhH,SAAS,SAASvB,GACrC,IAAIC,EAAOuI,EAAaD,EAAWtI,KAAKD,IACxCJ,EAAEwB,QAAQpB,EAAGP,EAAEgJ,MAAM,CAAC,EACpBU,EACAR,EAAkB1I,EAAMmJ,GACxB3J,EAAEoJ,KAAK5I,EAAMoJ,IACjB,IAEOzJ,CACT,CAnHqD0J,CAAiB1J,EAAI,IACtEN,EAAK,eAAsB,YAK/B,SAAmBM,EAAGN,GACpBA,EAAK,8BAA8B,YAsHrC,SAAgCM,GAC9B,IAAIE,EAAQF,EAAEE,QACdA,EAAMyJ,SAAW,EACjB9J,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIC,EAAOL,EAAEK,KAAKD,GAClBC,EAAKuJ,QAAU,EACqB,MAAhCvJ,EAAKwJ,SAASnG,gBACM,OAAlBxD,EAAMuD,SAAsC,OAAlBvD,EAAMuD,QAClCpD,EAAK6B,OAAS7B,EAAKyJ,YAEnBzJ,EAAK8B,QAAU9B,EAAKyJ,YAG1B,GACF,CApIkDC,CAAuB/J,EAAI,IAC3EN,EAAK,uBAA8B,YAmSrC,SAAyBM,GACvBH,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,GAAIA,EAAES,IAAMT,EAAEY,EAAG,CACf,IAAI0B,EAAO1C,EAAE0C,KAAKtC,EAAES,GACf6B,EAAKsH,YACRtH,EAAKsH,UAAY,IAEnBtH,EAAKsH,UAAU/I,KAAK,CAAEb,EAAMe,MAAOnB,EAAEK,KAAKD,KAC1CJ,EAAEoB,WAAWhB,EACf,CACF,GACF,CA9SkD6J,CAAgBjK,EAAI,IACpEN,EAAK,eAA8B,WAAaoI,EAAQ/H,IAAIC,EAAI,IAChEN,EAAK,wBAA8B,WAAayI,EAAapI,IAAIC,EAAI,IACrEN,EAAK,YAA8B,WAAauC,EAAKxC,EAAKyK,mBAAmBlK,GAAK,IAClFN,EAAK,8BAA8B,YAuIrC,SAAgCM,GAC9BH,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIC,EAAOL,EAAEK,KAAKD,GAClB,GAAIC,EAAK6B,OAAS7B,EAAK8B,OAAQ,CAC7B,IAAItB,EAAIb,EAAE0C,KAAKtC,EAAES,GAEbM,EAAQ,CAAEc,MADNjC,EAAE0C,KAAKtC,EAAEY,GACMiB,KAAOpB,EAAEoB,MAAQ,EAAIpB,EAAEoB,KAAM7B,GACpDX,EAAK8C,aAAavC,EAAG,aAAcmB,EAAO,MAC5C,CACF,GACF,CAjJkDgJ,CAAuBnK,EAAI,IAC3EN,EAAK,wBAA8B,WAAawI,EAAiBlI,EAAI,IACrEN,EAAK,4BAA8B,WAAayI,EAAaiC,QAAQpK,EAAI,IACzEN,EAAK,sBAA8B,WAAasI,EAAehI,EAAI,IACnEN,EAAK,wBAA8B,YA+IrC,SAA0BM,GACxB,IAAI+C,EAAU,EACdlD,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GACd6B,EAAK2H,YACP3H,EAAKI,QAAU9C,EAAE0C,KAAKA,EAAK2H,WAAWpI,KACtCS,EAAKK,QAAU/C,EAAE0C,KAAKA,EAAK4H,cAAcrI,KACzCc,EAAUlD,EAAE4G,IAAI1D,EAASL,EAAKK,SAElC,IACA/C,EAAEE,QAAQ6C,QAAUA,CACtB,CA1JkDwH,CAAiBvK,EAAI,IACrEN,EAAK,8BAA8B,YA2JrC,SAAgCM,GAC9BH,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GACC,eAAf6B,EAAK8H,QACPxK,EAAEK,KAAKqC,EAAKtC,GAAGqK,UAAY/H,EAAKT,KAChCjC,EAAEoH,WAAWvG,GAEjB,GACF,CAnKkD6J,CAAuB1K,EAAI,IAC3EN,EAAK,qBAA8B,WAAaqI,EAAUhI,IAAIC,EAAI,IAClEN,EAAK,yBAA8B,WAAauI,EAAkBjI,EAAI,IACtEN,EAAK,yBAA8B,WAAa0I,EAAkBpI,EAAI,IACtEN,EAAK,aAA8B,WAAa4I,EAAMtI,EAAI,IAC1DN,EAAK,uBAA8B,YAkSrC,SAAyBM,GACvB,IAAI2K,EAASlL,EAAK0F,iBAAiBnF,GACnCH,EAAEa,QAAQiK,GAAQ,SAASlF,GACzB,IAAImF,EAAa,EACjB/K,EAAEa,QAAQ+E,GAAO,SAAS5E,EAAG6E,GAC3B,IAAIhD,EAAO1C,EAAE0C,KAAK7B,GAClB6B,EAAK4F,MAAQ5C,EAAIkF,EACjB/K,EAAEa,QAAQgC,EAAKsH,WAAW,SAASa,GACjCpL,EAAK8C,aAAavC,EAAG,WAAY,CAC/BkC,MAAO2I,EAAS1J,MAAMe,MACtBC,OAAQ0I,EAAS1J,MAAMgB,OACvBF,KAAMS,EAAKT,KACXqG,MAAO5C,KAAOkF,EACdxK,EAAGyK,EAASzK,EACZe,MAAO0J,EAAS1J,OACf,MACL,WACOuB,EAAKsH,SACd,GACF,GACF,CAtTkDc,CAAgB9K,EAAI,IACpEN,EAAK,8BAA8B,WAAa2I,EAAiB9E,OAAOvD,EAAI,IAC5EN,EAAK,gBAA8B,WAAa6I,EAASvI,EAAI,IAC7DN,EAAK,yBAA8B,YAqTrC,SAA2BM,GACzBH,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GAClB,GAAmB,aAAf6B,EAAK8H,MAAsB,CAC7B,IAAIO,EAAW/K,EAAE0C,KAAKA,EAAKtC,EAAES,GACzByC,EAAIyH,EAASzH,EAAIyH,EAAS7I,MAAQ,EAClCkB,EAAI2H,EAAS3H,EACb4H,EAAKtI,EAAKY,EAAIA,EACd2H,EAAKF,EAAS5I,OAAS,EAC3BnC,EAAEwB,QAAQkB,EAAKtC,EAAGsC,EAAKvB,OACvBnB,EAAEoH,WAAWvG,GACb6B,EAAKvB,MAAMwC,OAAS,CAClB,CAAEL,EAAGA,EAAI,EAAI0H,EAAK,EAAG5H,EAAGA,EAAI6H,GAC5B,CAAE3H,EAAGA,EAAI,EAAI0H,EAAK,EAAG5H,EAAGA,EAAI6H,GAC5B,CAAE3H,EAAGA,EAAQ0H,EAAQ5H,EAAGA,GACxB,CAAEE,EAAGA,EAAI,EAAI0H,EAAK,EAAG5H,EAAGA,EAAI6H,GAC5B,CAAE3H,EAAGA,EAAI,EAAI0H,EAAK,EAAG5H,EAAGA,EAAI6H,IAE9BvI,EAAKvB,MAAMmC,EAAIZ,EAAKY,EACpBZ,EAAKvB,MAAMiC,EAAIV,EAAKU,CACtB,CACF,GACF,CA3UkD8H,CAAkBlL,EAAI,IACtEN,EAAK,yBAA8B,YA0PrC,SAA2BM,GACzBH,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,GAAIb,EAAEyC,SAAS5B,GAAG8B,OAAQ,CACxB,IAAID,EAAO1C,EAAE0C,KAAK7B,GACdsK,EAAInL,EAAE0C,KAAKA,EAAK2H,WAChBe,EAAIpL,EAAE0C,KAAKA,EAAK4H,cAChBe,EAAIrL,EAAE0C,KAAK7C,EAAEyL,KAAK5I,EAAKE,aACvB2I,EAAIvL,EAAE0C,KAAK7C,EAAEyL,KAAK5I,EAAKG,cAE3BH,EAAKR,MAAQsE,KAAKgF,IAAID,EAAEjI,EAAI+H,EAAE/H,GAC9BZ,EAAKP,OAASqE,KAAKgF,IAAIJ,EAAEhI,EAAI+H,EAAE/H,GAC/BV,EAAKY,EAAI+H,EAAE/H,EAAIZ,EAAKR,MAAQ,EAC5BQ,EAAKU,EAAI+H,EAAE/H,EAAIV,EAAKP,OAAS,CAC/B,CACF,IAEAtC,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GACJ,WAApBb,EAAE0C,KAAK7B,GAAG2J,OACZxK,EAAEoH,WAAWvG,EAEjB,GACF,CA/QkD4K,CAAkBzL,EAAI,IACtEN,EAAK,sBAA8B,WAAaqI,EAAUrG,KAAK1B,EAAI,IACnEN,EAAK,4BAA8B,YAgOrC,SAA8BM,GAC5BH,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIC,EAAOL,EAAEK,KAAKD,GAClB,GAAIP,EAAEiB,IAAIT,EAAM,KAId,OAHsB,MAAlBA,EAAKwJ,UAAsC,MAAlBxJ,EAAKwJ,WAChCxJ,EAAK6B,OAAS7B,EAAKyJ,aAEbzJ,EAAKwJ,UACb,IAAK,IAAKxJ,EAAKiD,GAAKjD,EAAK6B,MAAQ,EAAI7B,EAAKyJ,YAAa,MACvD,IAAK,IAAKzJ,EAAKiD,GAAKjD,EAAK6B,MAAQ,EAAI7B,EAAKyJ,YAG9C,GACF,CA7OkD4B,CAAqB1L,EAAI,IACzEN,EAAK,4BAA8B,WAAa2I,EAAiB3G,KAAK1B,EAAI,IAC1EN,EAAK,sBAA8B,YAwJrC,SAAwBM,GACtB,IAAI2L,EAAOC,OAAOC,kBACdC,EAAO,EACPC,EAAOH,OAAOC,kBACdG,EAAO,EACPC,EAAajM,EAAEE,QACfgM,EAAUD,EAAWE,SAAW,EAChCC,EAAUH,EAAWI,SAAW,EAEpC,SAASC,EAAYpJ,GACnB,IAAII,EAAIJ,EAAMI,EACVF,EAAIF,EAAME,EACVpC,EAAIkC,EAAMhB,MACVkD,EAAIlC,EAAMf,OACdwJ,EAAOnF,KAAK+F,IAAIZ,EAAMrI,EAAItC,EAAI,GAC9B8K,EAAOtF,KAAKC,IAAIqF,EAAMxI,EAAItC,EAAI,GAC9B+K,EAAOvF,KAAK+F,IAAIR,EAAM3I,EAAIgC,EAAI,GAC9B4G,EAAOxF,KAAKC,IAAIuF,EAAM5I,EAAIgC,EAAI,EAChC,CAEAvF,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAAKyL,EAAYtM,EAAE0C,KAAK7B,GAAK,IAC3DhB,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIC,EAAOL,EAAEK,KAAKD,GACdP,EAAEiB,IAAIT,EAAM,MACdiM,EAAYjM,EAEhB,IAEAsL,GAAQO,EACRH,GAAQK,EAERvM,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GAClB6B,EAAKY,GAAKqI,EACVjJ,EAAKU,GAAK2I,CACZ,IAEAlM,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIC,EAAOL,EAAEK,KAAKD,GAClBP,EAAEa,QAAQL,EAAKsD,QAAQ,SAAS6I,GAC9BA,EAAElJ,GAAKqI,EACPa,EAAEpJ,GAAK2I,CACT,IACIlM,EAAEiB,IAAIT,EAAM,OAAQA,EAAKiD,GAAKqI,GAC9B9L,EAAEiB,IAAIT,EAAM,OAAQA,EAAK+C,GAAK2I,EACpC,IAEAE,EAAW/J,MAAQ4J,EAAOH,EAAOO,EACjCD,EAAW9J,OAAS6J,EAAOD,EAAOK,CACpC,CAzMkDK,CAAezM,EAAI,IACnEN,EAAK,4BAA8B,YA0MrC,SAA8BM,GAC5BH,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAGIsM,EAAIC,EAHJtM,EAAOL,EAAEK,KAAKD,GACdwM,EAAQ5M,EAAE0C,KAAKtC,EAAES,GACjBgM,EAAQ7M,EAAE0C,KAAKtC,EAAEY,GAEhBX,EAAKsD,QAKR+I,EAAKrM,EAAKsD,OAAO,GACjBgJ,EAAKtM,EAAKsD,OAAOtD,EAAKsD,OAAOhB,OAAS,KALtCtC,EAAKsD,OAAS,GACd+I,EAAKG,EACLF,EAAKC,GAKPvM,EAAKsD,OAAOmJ,QAAQrN,EAAKsN,cAAcH,EAAOF,IAC9CrM,EAAKsD,OAAO1C,KAAKxB,EAAKsN,cAAcF,EAAOF,GAC7C,GACF,CA3NkDK,CAAqBhN,EAAI,IACzEN,EAAK,qBAA8B,YA2OrC,SAAuCM,GACrCH,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAIC,EAAOL,EAAEK,KAAKD,GACdC,EAAKkB,UACPlB,EAAKsD,OAAOsJ,SAEhB,GACF,CAlPkDC,CAA8BlN,EAAI,IAClFN,EAAK,oBAA8B,WAAaoI,EAAQpG,KAAK1B,EAAI,GACnE,CAjC4CmN,CAAUzE,EAAahJ,EAAO,IACtEA,EAAK,sBAAsB,YAwC/B,SAA0BiJ,EAAYD,GACpC7I,EAAEa,QAAQiI,EAAWhI,SAAS,SAASE,GACrC,IAAIuM,EAAazE,EAAWjG,KAAK7B,GAC7BwM,EAAc3E,EAAYhG,KAAK7B,GAE/BuM,IACFA,EAAW9J,EAAI+J,EAAY/J,EAC3B8J,EAAWhK,EAAIiK,EAAYjK,EAEvBsF,EAAYjG,SAAS5B,GAAG8B,SAC1ByK,EAAWlL,MAAQmL,EAAYnL,MAC/BkL,EAAWjL,OAASkL,EAAYlL,QAGtC,IAEAtC,EAAEa,QAAQiI,EAAWhH,SAAS,SAASvB,GACrC,IAAIgN,EAAazE,EAAWtI,KAAKD,GAC7BiN,EAAc3E,EAAYrI,KAAKD,GAEnCgN,EAAWzJ,OAAS0J,EAAY1J,OAC5B9D,EAAEiB,IAAIuM,EAAa,OACrBD,EAAW9J,EAAI+J,EAAY/J,EAC3B8J,EAAWhK,EAAIiK,EAAYjK,EAE/B,IAEAuF,EAAWzI,QAAQgC,MAAQwG,EAAYxI,QAAQgC,MAC/CyG,EAAWzI,QAAQiC,OAASuG,EAAYxI,QAAQiC,MAClD,CArE4CmL,CAAiBtN,EAAG0I,EAAc,GAC5E,GACF,EAqEA,IAAIM,EAAgB,CAAC,UAAW,UAAW,UAAW,UAAW,WAC7DF,EAAgB,CAAEa,QAAS,GAAI4D,QAAS,GAAIC,QAAS,GAAI/J,QAAS,MAClEyF,EAAa,CAAC,YAAa,SAAU,UAAW,SAChDE,EAAe,CAAC,QAAS,UACzBC,EAAe,CAAEnH,MAAO,EAAGC,OAAQ,GACnCqH,EAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,EAAe,CACjBK,OAAQ,EAAGtJ,OAAQ,EAAG4B,MAAO,EAAGC,OAAQ,EACxC2H,YAAa,GAAID,SAAU,KAEzBJ,EAAY,CAAC,YAmRjB,SAASV,EAAkB0E,EAAKvK,GAC9B,OAAOrD,EAAE6N,UAAU7N,EAAEoJ,KAAKwE,EAAKvK,GAAQ0I,OACzC,CAEA,SAAShD,EAAa1F,GACpB,IAAIyK,EAAW,CAAC,EAIhB,OAHA9N,EAAEa,QAAQwC,GAAO,SAASrC,EAAG0D,GAC3BoJ,EAASpJ,EAAEb,eAAiB7C,CAC9B,IACO8M,CACT,C,iBCrYA,IAAIC,EAGF,IACEA,EAAS,CACPC,UAAW,EAAQ,MACnBrG,SAAU,EAAQ,MAClB2B,SAAU,EAAQ,MAClB2E,KAAM,EAAQ,KACdC,OAAQ,EAAQ,MAChBC,KAAM,EAAQ,KACdzG,QAAS,EAAQ,MACjB7G,QAAS,EAAQ,MACjBuN,MAAO,EAAQ,MACfnN,IAAM,EAAQ,MACdoN,YAAa,EAAQ,MACrB5C,KAAM,EAAQ,MACd1E,IAAK,EAAQ,MACb8G,UAAW,EAAQ,MACnBjH,IAAK,EAAQ,MACboC,MAAO,EAAQ,MACf0D,IAAK,EAAQ,MACb4B,MAAO,EAAQ,MACfC,IAAK,EAAQ,MACbnF,KAAM,EAAQ,KACdtC,MAAO,EAAQ,MACff,OAAQ,EAAQ,MAChByI,OAAQ,EAAQ,MAChB5M,SAAU,EAAQ,KAClB6M,OAAQ,EAAQ,MAChBC,UAAW,EAAQ,MAEvB,CAAE,MAAOnO,GAET,CAGGwN,IACHA,EAAS7H,OAAOlG,GAGlBT,EAAOC,QAAUuO,C,iBC3CjB,IAAI/N,EAAI,EAAQ,MACZJ,EAAO,EAAQ,MAsDnB,SAASmB,EAAIZ,EAAGwO,EAAMC,EAASnO,EAAQ6B,EAAQuM,EAAQ7N,GACrD,IAAI4B,EAAWzC,EAAEyC,SAAS5B,GAC1B,GAAK4B,EAASE,OAAd,CAOA,IAAIgM,EAAMlP,EAAKmC,cAAc5B,EAAG,OAC5B4O,EAASnP,EAAKmC,cAAc5B,EAAG,OAC/BmB,EAAQnB,EAAE0C,KAAK7B,GAEnBb,EAAEwC,UAAUmM,EAAK9N,GACjBM,EAAMkJ,UAAYsE,EAClB3O,EAAEwC,UAAUoM,EAAQ/N,GACpBM,EAAMmJ,aAAesE,EAErB/O,EAAEa,QAAQ+B,GAAU,SAASoM,GAC3BjO,EAAIZ,EAAGwO,EAAMC,EAASnO,EAAQ6B,EAAQuM,EAAQG,GAE9C,IAAIC,EAAY9O,EAAE0C,KAAKmM,GACnBE,EAAWD,EAAUzE,UAAYyE,EAAUzE,UAAYwE,EACvDG,EAAcF,EAAUxE,aAAewE,EAAUxE,aAAeuE,EAChEI,EAAaH,EAAUzE,UAAY/J,EAAS,EAAIA,EAChDsJ,EAASmF,IAAaC,EAAc,EAAI7M,EAASuM,EAAO7N,GAAK,EAEjEb,EAAEwB,QAAQmN,EAAKI,EAAU,CACvBzO,OAAQ2O,EACRrF,OAAQA,EACRsF,aAAa,IAGflP,EAAEwB,QAAQwN,EAAaJ,EAAQ,CAC7BtO,OAAQ2O,EACRrF,OAAQA,EACRsF,aAAa,GAEjB,IAEKlP,EAAEsJ,OAAOzI,IACZb,EAAEwB,QAAQgN,EAAMG,EAAK,CAAErO,OAAQ,EAAGsJ,OAAQzH,EAASuM,EAAO7N,IAlC5D,MAJMA,IAAM2N,GACRxO,EAAEwB,QAAQgN,EAAM3N,EAAG,CAAEP,OAAQ,EAAGsJ,OAAQ6E,GAuC9C,CA/FArP,EAAOC,QAAU,CACfU,IA2BF,SAAaC,GACX,IAAIwO,EAAO/O,EAAK8C,aAAavC,EAAG,OAAQ,CAAC,EAAG,SACxC0O,EAmEN,SAAoB1O,GAClB,IAAI0O,EAAS,CAAC,EACd,SAAS9N,EAAIC,EAAGsO,GACd,IAAI1M,EAAWzC,EAAEyC,SAAS5B,GACtB4B,GAAYA,EAASE,QACvB9C,EAAEa,QAAQ+B,GAAU,SAASoM,GAC3BjO,EAAIiO,EAAOM,EAAQ,EACrB,IAEFT,EAAO7N,GAAKsO,CACd,CAEA,OADAtP,EAAEa,QAAQV,EAAEyC,YAAY,SAAS5B,GAAKD,EAAIC,EAAG,EAAI,IAC1C6N,CACT,CAhFeU,CAAWpP,GACpBmC,EAAStC,EAAE4G,IAAI5G,EAAEyO,OAAOI,IAAW,EACnCD,EAAU,EAAItM,EAAS,EAE3BnC,EAAEE,QAAQmP,YAAcb,EAGxB3O,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAAKJ,EAAEK,KAAKD,GAAGwJ,QAAU6E,CAAS,IAGhE,IAAInO,EAwEN,SAAoBN,GAClB,OAAOH,EAAE+F,OAAO5F,EAAE2B,SAAS,SAAS2N,EAAKlP,GACvC,OAAOkP,EAAMtP,EAAEK,KAAKD,GAAGE,MACzB,GAAG,EACL,CA5EeiP,CAAWvP,GAAK,EAG7BH,EAAEa,QAAQV,EAAEyC,YAAY,SAASoM,GAC/BjO,EAAIZ,EAAGwO,EAAMC,EAASnO,EAAQ6B,EAAQuM,EAAQG,EAChD,IAIA7O,EAAEE,QAAQsP,eAAiBf,CAC7B,EAhDErE,QAoHF,SAAiBpK,GACf,IAAIiM,EAAajM,EAAEE,QACnBF,EAAEoH,WAAW6E,EAAWoD,oBACjBpD,EAAWoD,YAClBxP,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GACjBJ,EAAEK,KAAKD,GACT8O,aACPlP,EAAEoB,WAAWhB,EAEjB,GACF,E,8BCjIA,IAAIP,EAAI,EAAQ,MACZJ,EAAO,EAAQ,MAEnBL,EAAOC,QAAU,CACfU,IAoBF,SAAaC,GACXA,EAAEE,QAAQuP,YAAc,GACxB5P,EAAEa,QAAQV,EAAE2B,SAAS,SAAStB,IAGhC,SAAuBL,EAAGI,GACxB,IAYIoK,EAAOtH,EAAOwC,EAZd7E,EAAIT,EAAES,EACN6O,EAAQ1P,EAAE0C,KAAK7B,GAAGoB,KAClBjB,EAAIZ,EAAEY,EACN2O,EAAQ3P,EAAE0C,KAAK1B,GAAGiB,KAClBX,EAAOlB,EAAEkB,KACTsO,EAAY5P,EAAEK,KAAKD,GACnBqK,EAAYmF,EAAUnF,UAE1B,GAAIkF,IAAUD,EAAQ,EAAtB,CAKA,IAHA1P,EAAEoB,WAAWhB,GAGRsF,EAAI,IAAKgK,EAAOA,EAAQC,IAASjK,IAAKgK,EACzCE,EAAUjM,OAAS,GACnBT,EAAQ,CACNhB,MAAO,EAAGC,OAAQ,EAClByN,UAAWA,EAAWC,QAASzP,EAC/B6B,KAAMyN,GAERlF,EAAQ/K,EAAK8C,aAAavC,EAAG,OAAQkD,EAAO,MACxCwM,IAAUjF,IACZvH,EAAMhB,MAAQ0N,EAAU1N,MACxBgB,EAAMf,OAASyN,EAAUzN,OACzBe,EAAMsH,MAAQ,aACdtH,EAAM2G,SAAW+F,EAAU/F,UAE7B7J,EAAEwB,QAAQX,EAAG2J,EAAO,CAAElK,OAAQsP,EAAUtP,QAAUgB,GACxC,IAANoE,GACF1F,EAAEE,QAAQuP,YAAYxO,KAAKuJ,GAE7B3J,EAAI2J,EAGNxK,EAAEwB,QAAQX,EAAGG,EAAG,CAAEV,OAAQsP,EAAUtP,QAAUgB,EA1Bf,CA2BjC,CAvCwCwO,CAAc9P,EAAGK,EAAO,GAChE,EAtBEqB,KA8DF,SAAc1B,GACZH,EAAEa,QAAQV,EAAEE,QAAQuP,aAAa,SAAS5O,GACxC,IAEIG,EAFA0B,EAAO1C,EAAE0C,KAAK7B,GACdkP,EAAYrN,EAAKkN,UAGrB,IADA5P,EAAEwB,QAAQkB,EAAKmN,QAASE,GACjBrN,EAAK8H,OACVxJ,EAAIhB,EAAEgQ,WAAWnP,GAAG,GACpBb,EAAEoH,WAAWvG,GACbkP,EAAUpM,OAAO1C,KAAK,CAAEqC,EAAGZ,EAAKY,EAAGF,EAAGV,EAAKU,IACxB,eAAfV,EAAK8H,QACPuF,EAAUzM,EAAIZ,EAAKY,EACnByM,EAAU3M,EAAIV,EAAKU,EACnB2M,EAAU7N,MAAQQ,EAAKR,MACvB6N,EAAU5N,OAASO,EAAKP,QAE1BtB,EAAIG,EACJ0B,EAAO1C,EAAE0C,KAAK7B,EAElB,GACF,E,iBCzFA,IAAIhB,EAAI,EAAQ,MAEhBT,EAAOC,QAEP,SAAgCW,EAAGiQ,EAAIC,GACrC,IACEC,EADE9N,EAAO,CAAC,EAGZxC,EAAEa,QAAQwP,GAAI,SAASrP,GAIrB,IAHA,IACEyI,EACA8G,EAFEvB,EAAQ7O,EAAEsJ,OAAOzI,GAGdgO,GAAO,CASZ,IARAvF,EAAStJ,EAAEsJ,OAAOuF,KAEhBuB,EAAY/N,EAAKiH,GACjBjH,EAAKiH,GAAUuF,IAEfuB,EAAYD,EACZA,EAAWtB,GAETuB,GAAaA,IAAcvB,EAE7B,YADAoB,EAAGzO,QAAQ4O,EAAWvB,GAGxBA,EAAQvF,CACV,CACF,GAyBF,C,iBCpDA,IAAIzJ,EAAI,EAAQ,MAEhBT,EAAOC,QAEP,SAAoBW,EAAGqQ,GACrB,OAAOxQ,EAAE+G,IAAIyJ,GAAS,SAASxP,GAC7B,IAAIyP,EAAMtQ,EAAE2H,QAAQ9G,GACpB,GAAKyP,EAAI3N,OAEF,CACL,IAAI4N,EAAS1Q,EAAE+F,OAAO0K,GAAK,SAAShB,EAAKlP,GACvC,IAAIC,EAAOL,EAAEK,KAAKD,GAChBoQ,EAAQxQ,EAAE0C,KAAKtC,EAAES,GACnB,MAAO,CACL4P,IAAKnB,EAAImB,IAAOpQ,EAAKC,OAASkQ,EAAMlI,MACpChI,OAAQgP,EAAIhP,OAASD,EAAKC,OAE9B,GAAG,CAAEmQ,IAAK,EAAGnQ,OAAQ,IAErB,MAAO,CACLO,EAAGA,EACH6P,WAAYH,EAAOE,IAAMF,EAAOjQ,OAChCA,OAAQiQ,EAAOjQ,OAEnB,CAhBE,MAAO,CAAEO,EAAGA,EAiBhB,GACF,C,iBC1BA,IAAIhB,EAAI,EAAQ,MACZmF,EAAQ,cAEZ5F,EAAOC,QAgCP,SAAyBW,EAAGiC,EAAM0O,GAChC,IAAInC,EAgCN,SAAwBxO,GAEtB,IADA,IAAIa,EACGb,EAAE4Q,QAAS/P,EAAIhB,EAAE4B,SAAS,YACjC,OAAOZ,CACT,CApCagQ,CAAe7Q,GACxBuQ,EAAS,IAAIvL,EAAM,CAAEK,UAAU,IAAQE,SAAS,CAAEiJ,KAAMA,IACrDsC,qBAAoB,SAASjQ,GAAK,OAAOb,EAAE0C,KAAK7B,EAAI,IA2BzD,OAzBAhB,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GAChByI,EAAStJ,EAAEsJ,OAAOzI,IAEhB6B,EAAKT,OAASA,GAAQS,EAAKI,SAAWb,GAAQA,GAAQS,EAAKK,WAC7DwN,EAAO/K,QAAQ3E,GACf0P,EAAO/N,UAAU3B,EAAGyI,GAAUkF,GAG9B3O,EAAEa,QAAQV,EAAE2Q,GAAc9P,IAAI,SAAST,GACrC,IAAIyF,EAAIzF,EAAES,IAAMA,EAAIT,EAAEY,EAAIZ,EAAES,EAC1BR,EAAOkQ,EAAOlQ,KAAKwF,EAAGhF,GACtBP,EAAUT,EAAEqO,YAAY7N,GAAsB,EAAdA,EAAKC,OACvCiQ,EAAO/O,QAAQqE,EAAGhF,EAAG,CAAEP,OAAQN,EAAEK,KAAKD,GAAGE,OAASA,GACpD,IAEIT,EAAEiB,IAAI4B,EAAM,YACd6N,EAAO/K,QAAQ3E,EAAG,CAChB+B,WAAYF,EAAKE,WAAWX,GAC5BY,YAAaH,EAAKG,YAAYZ,KAItC,IAEOsO,CACT,C,8BChEA,IAAI1Q,EAAI,EAAQ,MA4BhB,SAASkR,EAAmB/Q,EAAGgR,EAAYC,GAczC,IAVA,IAAIC,EAAWrR,EAAE0O,UAAU0C,EACzBpR,EAAE+G,IAAIqK,GAAY,SAAUpQ,EAAG6E,GAAK,OAAOA,CAAG,KAC5CyL,EAAetR,EAAE0H,QAAQ1H,EAAE+G,IAAIoK,GAAY,SAASnQ,GACtD,OAAOhB,EAAEwO,OAAOxO,EAAE+G,IAAI5G,EAAEe,SAASF,IAAI,SAAST,GAC5C,MAAO,CAAEgR,IAAKF,EAAS9Q,EAAEY,GAAIV,OAAQN,EAAEK,KAAKD,GAAGE,OACjD,IAAI,MACN,KAAI,GAGA+Q,EAAa,EACVA,EAAaJ,EAAWtO,QAAQ0O,IAAe,EACtD,IAAIC,EAAW,EAAID,EAAa,EAChCA,GAAc,EACd,IAAIE,EAAO1R,EAAE+G,IAAI,IAAI4K,MAAMF,IAAW,WAAa,OAAO,CAAG,IAGzDG,EAAK,EAeT,OAdA5R,EAAEa,QAAQyQ,EAAazQ,SAAQ,SAAS2D,GACtC,IAAIqN,EAAQrN,EAAM+M,IAAMC,EACxBE,EAAKG,IAAUrN,EAAM/D,OAErB,IADA,IAAIqR,EAAY,EACTD,EAAQ,GACTA,EAAQ,IACVC,GAAaJ,EAAKG,EAAQ,IAG5BH,EADAG,EAASA,EAAQ,GAAM,IACRrN,EAAM/D,OAEvBmR,GAAMpN,EAAM/D,OAASqR,CACvB,KAEOF,CACT,CA9DArS,EAAOC,QAkBP,SAAoBW,EAAG4R,GAErB,IADA,IAAIH,EAAK,EACA/L,EAAI,EAAGA,EAAIkM,EAASjP,SAAU+C,EACrC+L,GAAMV,EAAmB/Q,EAAG4R,EAASlM,EAAE,GAAIkM,EAASlM,IAEtD,OAAO+L,CACT,C,8BC1BA,IAAI5R,EAAI,EAAQ,MACZgS,EAAY,EAAQ,MACpBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAkB,EAAQ,MAC1BC,EAAyB,EAAQ,MACjCjN,EAAQ,cACRvF,EAAO,EAAQ,MA6CnB,SAASyS,EAAiBlS,EAAGmS,EAAOxB,GAClC,OAAO9Q,EAAE+G,IAAIuL,GAAO,SAASlQ,GAC3B,OAAO+P,EAAgBhS,EAAGiC,EAAM0O,EAClC,GACF,CAEA,SAASyB,EAAiBC,EAAaC,GACrC,IAAIrC,EAAK,IAAIjL,EACbnF,EAAEa,QAAQ2R,GAAa,SAASE,GAC9B,IAAI/D,EAAO+D,EAAGrS,QAAQsO,KAClBgE,EAAST,EAAaQ,EAAI/D,EAAMyB,EAAIqC,GACxCzS,EAAEa,QAAQ8R,EAAOtC,IAAI,SAASrP,EAAG6E,GAC/B6M,EAAG7P,KAAK7B,GAAGyH,MAAQ5C,CACrB,IACAuM,EAAuBM,EAAItC,EAAIuC,EAAOtC,GACxC,GACF,CAEA,SAASuC,EAAYzS,EAAG4R,GACtB/R,EAAEa,QAAQkR,GAAU,SAASnM,GAC3B5F,EAAEa,QAAQ+E,GAAO,SAAS5E,EAAG6E,GAC3B1F,EAAE0C,KAAK7B,GAAGyH,MAAQ5C,CACpB,GACF,GACF,CAnEAtG,EAAOC,QAiBP,SAAeW,GACb,IAAI+C,EAAUtD,EAAKsD,QAAQ/C,GACzB0S,EAAkBR,EAAiBlS,EAAGH,EAAE8G,MAAM,EAAG5D,EAAU,GAAI,WAC/D4P,EAAgBT,EAAiBlS,EAAGH,EAAE8G,MAAM5D,EAAU,GAAI,GAAI,GAAI,YAEhE6O,EAAWC,EAAU7R,GACzByS,EAAYzS,EAAG4R,GAKf,IAHA,IACEgB,EADEC,EAASjH,OAAOC,kBAGXnG,EAAI,EAAGoN,EAAW,EAAGA,EAAW,IAAKpN,IAAKoN,EAAU,CAC3DV,EAAiB1M,EAAI,EAAIgN,EAAkBC,EAAejN,EAAI,GAAK,GAEnEkM,EAAWnS,EAAK0F,iBAAiBnF,GACjC,IAAIyR,EAAKK,EAAW9R,EAAG4R,GACnBH,EAAKoB,IACPC,EAAW,EACXF,EAAO/S,EAAEgO,UAAU+D,GACnBiB,EAASpB,EAEb,CAEAgB,EAAYzS,EAAG4S,EACjB,C,8BClDA,IAAI/S,EAAI,EAAQ,MAEhBT,EAAOC,QAaP,SAAmBW,GACjB,IAAIS,EAAU,CAAC,EACXsS,EAAclT,EAAEkO,OAAO/N,EAAEW,SAAS,SAASE,GAC7C,OAAQb,EAAEyC,SAAS5B,GAAG8B,MACxB,IACII,EAAUlD,EAAE4G,IAAI5G,EAAE+G,IAAImM,GAAa,SAASlS,GAAK,OAAOb,EAAE0C,KAAK7B,GAAGoB,IAAM,KACxE0I,EAAS9K,EAAE+G,IAAI/G,EAAE8G,MAAM5D,EAAU,IAAI,WAAa,MAAO,EAAI,IAU7DiQ,EAAYnT,EAAEwO,OAAO0E,GAAa,SAASlS,GAAK,OAAOb,EAAE0C,KAAK7B,GAAGoB,IAAM,IAG3E,OAFApC,EAAEa,QAAQsS,GATV,SAASpS,EAAIC,GACX,IAAIhB,EAAEiB,IAAIL,EAASI,GAAnB,CACAJ,EAAQI,IAAK,EACb,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GAClB8J,EAAOjI,EAAKT,MAAMhB,KAAKJ,GACvBhB,EAAEa,QAAQV,EAAEgQ,WAAWnP,GAAID,EAJE,CAK/B,IAKO+J,CACT,C,8BCnCA,IAAI9K,EAAI,EAAQ,MAEhBT,EAAOC,QA2BP,SAA0B4T,EAAShD,GACjC,IAAIiD,EAAgB,CAAC,EA4BrB,OA3BArT,EAAEa,QAAQuS,GAAS,SAAS5O,EAAOqB,GACjC,IAAIyN,EAAMD,EAAc7O,EAAMxD,GAAK,CACjCuS,SAAU,EACV,GAAM,GACN/M,IAAK,GACL6J,GAAI,CAAC7L,EAAMxD,GACX6E,EAAGA,GAEA7F,EAAEqO,YAAY7J,EAAMqM,cACvByC,EAAIzC,WAAarM,EAAMqM,WACvByC,EAAI7S,OAAS+D,EAAM/D,OAEvB,IAEAT,EAAEa,QAAQuP,EAAGtO,SAAS,SAASvB,GAC7B,IAAIiT,EAASH,EAAc9S,EAAES,GACzByS,EAASJ,EAAc9S,EAAEY,GACxBnB,EAAEqO,YAAYmF,IAAYxT,EAAEqO,YAAYoF,KAC3CA,EAAOF,WACPC,EAAOhN,IAAIpF,KAAKiS,EAAc9S,EAAEY,IAEpC,IASF,SAA4BuS,GAC1B,IAAIN,EAAU,GAEd,SAASO,EAASC,GAChB,OAAO,SAAS7L,GAmCpB,IAAsB8L,EAAQC,EACxBlD,EACAnQ,EApCIsH,EAAOgM,SAGP/T,EAAEqO,YAAYtG,EAAO8I,aACrB7Q,EAAEqO,YAAYuF,EAAO/C,aACrB9I,EAAO8I,YAAc+C,EAAO/C,cA6BRiD,EA5BD/L,EA6BvB6I,EAAM,EACNnQ,EAAS,GAFOoT,EA5BDD,GAgCRnT,SACTmQ,GAAOiD,EAAOhD,WAAagD,EAAOpT,OAClCA,GAAUoT,EAAOpT,QAGfqT,EAAOrT,SACTmQ,GAAOkD,EAAOjD,WAAaiD,EAAOrT,OAClCA,GAAUqT,EAAOrT,QAGnBoT,EAAOxD,GAAKyD,EAAOzD,GAAG7I,OAAOqM,EAAOxD,IACpCwD,EAAOhD,WAAaD,EAAMnQ,EAC1BoT,EAAOpT,OAASA,EAChBoT,EAAOhO,EAAIc,KAAK+F,IAAIoH,EAAOjO,EAAGgO,EAAOhO,GACrCiO,EAAOC,QAAS,EA5Cd,CACF,CAEA,SAASC,EAAUJ,GACjB,OAAO,SAAS5L,GACdA,EAAW,GAAE5G,KAAKwS,GACQ,KAApB5L,EAAOuL,UACXG,EAAUtS,KAAK4G,EAEnB,CACF,CAEA,KAAO0L,EAAU5Q,QAAQ,CACvB,IAAI0B,EAAQkP,EAAUO,MACtBb,EAAQhS,KAAKoD,GACbxE,EAAEa,QAAQ2D,EAAU,GAAE4I,UAAWuG,EAASnP,IAC1CxE,EAAEa,QAAQ2D,EAAMgC,IAAKwN,EAAUxP,GACjC,CAEA,OAAOxE,EAAE+G,IAAI/G,EAAEkO,OAAOkF,GAAS,SAAS5O,GAAS,OAAQA,EAAMuP,MAAQ,KACrE,SAASvP,GACP,OAAOxE,EAAEoJ,KAAK5E,EAAO,CAAC,KAAM,IAAK,aAAc,UACjD,GAEJ,CAxCS0P,CAJSlU,EAAEkO,OAAOmF,GAAe,SAAS7O,GAC/C,OAAQA,EAAM+O,QAChB,IAGF,C,iBC7DA,IAAIvT,EAAI,EAAQ,MACZ6Q,EAAa,EAAQ,MACrBsD,EAAmB,EAAQ,MAC3BC,EAAO,EAAQ,KAEnB7U,EAAOC,QAEP,SAAS0S,EAAa/R,EAAGa,EAAGoP,EAAIqC,GAC9B,IAAIjC,EAAUrQ,EAAEyC,SAAS5B,GACrB6B,EAAO1C,EAAE0C,KAAK7B,GACdqT,EAAKxR,EAAOA,EAAKE,gBAAa8E,EAC9ByM,EAAKzR,EAAOA,EAAKG,iBAAa6E,EAC9B0M,EAAY,CAAC,EAEbF,IACF7D,EAAUxQ,EAAEkO,OAAOsC,GAAS,SAASrP,GACnC,OAAOA,IAAMkT,GAAMlT,IAAMmT,CAC3B,KAGF,IAAIE,EAAc3D,EAAW1Q,EAAGqQ,GAChCxQ,EAAEa,QAAQ2T,GAAa,SAAShQ,GAC9B,GAAIrE,EAAEyC,SAAS4B,EAAMxD,GAAG8B,OAAQ,CAC9B,IAAI2R,EAAiBvC,EAAa/R,EAAGqE,EAAMxD,EAAGoP,EAAIqC,GAClD8B,EAAU/P,EAAMxD,GAAKyT,EACjBzU,EAAEiB,IAAIwT,EAAgB,gBAwCNZ,EAvCDrP,EAuCSkQ,EAvCFD,EAwCzBzU,EAAEqO,YAAYwF,EAAOhD,aAMxBgD,EAAOhD,WAAa6D,EAAM7D,WAC1BgD,EAAOpT,OAASiU,EAAMjU,SANtBoT,EAAOhD,YAAcgD,EAAOhD,WAAagD,EAAOpT,OAC3BiU,EAAM7D,WAAa6D,EAAMjU,SACzBoT,EAAOpT,OAASiU,EAAMjU,QAC3CoT,EAAOpT,QAAUiU,EAAMjU,QA1CvB,CAqCJ,IAA0BoT,EAAQa,CApChC,IAEA,IAAItB,EAAUe,EAAiBK,EAAapE,IAuB9C,SAAyBgD,EAASmB,GAChCvU,EAAEa,QAAQuS,GAAS,SAAS5O,GAC1BA,EAAM6L,GAAKrQ,EAAE0H,QAAQlD,EAAM6L,GAAGtJ,KAAI,SAAS/F,GACzC,OAAIuT,EAAUvT,GACLuT,EAAUvT,GAAGqP,GAEfrP,CACT,KAAI,EACN,GACF,CA/BE2T,CAAgBvB,EAASmB,GAEzB,IAAI7D,EAAS0D,EAAKhB,EAASX,GAE3B,GAAI4B,IACF3D,EAAOL,GAAKrQ,EAAE0H,QAAQ,CAAC2M,EAAI3D,EAAOL,GAAIiE,IAAK,GACvCnU,EAAEyU,aAAaP,GAAIvR,QAAQ,CAC7B,IAAI+R,EAAS1U,EAAE0C,KAAK1C,EAAEyU,aAAaP,GAAI,IACrCS,EAAS3U,EAAE0C,KAAK1C,EAAEyU,aAAaN,GAAI,IAChCtU,EAAEiB,IAAIyP,EAAQ,gBACjBA,EAAOG,WAAa,EACpBH,EAAOjQ,OAAS,GAElBiQ,EAAOG,YAAcH,EAAOG,WAAaH,EAAOjQ,OAC3BoU,EAAOpM,MAAQqM,EAAOrM,QAAUiI,EAAOjQ,OAAS,GACrEiQ,EAAOjQ,QAAU,CACnB,CAGF,OAAOiQ,CACT,C,gBCpDA,IAAI1Q,EAAI,EAAQ,MACZJ,EAAO,EAAQ,MAmCnB,SAASmV,EAAkB1E,EAAI2E,EAAYnD,GAEzC,IADA,IAAIpG,EACGuJ,EAAWlS,SAAW2I,EAAOzL,EAAEyL,KAAKuJ,IAAanP,GAAKgM,GAC3DmD,EAAWf,MACX5D,EAAGjP,KAAKqK,EAAK4E,IACbwB,IAEF,OAAOA,CACT,CAzCAtS,EAAOC,QAEP,SAAc4T,EAASX,GACrB,IAwCuBwC,EAxCnBC,EAAQtV,EAAKuV,UAAU/B,GAAS,SAAS5O,GAC3C,OAAOxE,EAAEiB,IAAIuD,EAAO,aACtB,IACI4Q,EAAWF,EAAMG,IACnBL,EAAahV,EAAEwO,OAAO0G,EAAMI,KAAK,SAAS9Q,GAAS,OAAQA,EAAMqB,CAAG,IACpEwK,EAAK,GACLO,EAAM,EACNnQ,EAAS,EACT8U,EAAU,EAEZH,EAAShB,MA8Bca,IA9BSxC,EA+BzB,SAASe,EAAQC,GACtB,OAAID,EAAO3C,WAAa4C,EAAO5C,YACrB,EACC2C,EAAO3C,WAAa4C,EAAO5C,WAC7B,EAGDoE,EAA6BxB,EAAO5N,EAAI2N,EAAO3N,EAAxC2N,EAAO3N,EAAI4N,EAAO5N,CACnC,IArCA0P,EAAUR,EAAkB1E,EAAI2E,EAAYO,GAE5CvV,EAAEa,QAAQuU,GAAU,SAAU5Q,GAC5B+Q,GAAW/Q,EAAM6L,GAAGvN,OACpBuN,EAAGjP,KAAKoD,EAAM6L,IACdO,GAAOpM,EAAMqM,WAAarM,EAAM/D,OAChCA,GAAU+D,EAAM/D,OAChB8U,EAAUR,EAAkB1E,EAAI2E,EAAYO,EAC9C,IAEA,IAAI7E,EAAS,CAAEL,GAAIrQ,EAAE0H,QAAQ2I,GAAI,IAKjC,OAJI5P,IACFiQ,EAAOG,WAAaD,EAAMnQ,EAC1BiQ,EAAOjQ,OAASA,GAEXiQ,CACT,C,iBClCA,IAAI1Q,EAAI,EAAQ,MAEhBT,EAAOC,QAEP,SAA2BW,GACzB,IAAIqV,EAoEN,SAAmBrV,GACjB,IAAIuQ,EAAS,CAAC,EACV+E,EAAM,EASV,OAFAzV,EAAEa,QAAQV,EAAEyC,YALZ,SAAS7B,EAAIC,GACX,IAAI0U,EAAMD,EACVzV,EAAEa,QAAQV,EAAEyC,SAAS5B,GAAID,GACzB2P,EAAO1P,GAAK,CAAE0U,IAAKA,EAAKD,IAAKA,IAC/B,IAGO/E,CACT,CAhFsBiF,CAAUxV,GAE9BH,EAAEa,QAAQV,EAAEE,QAAQuP,aAAa,SAAS5O,GAUxC,IATA,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GACdgP,EAAUnN,EAAKmN,QACf4F,EAqCR,SAAkBzV,EAAGqV,EAAexU,EAAGG,GACrC,IAIIsI,EACAoM,EALAC,EAAQ,GACRC,EAAQ,GACRL,EAAM/O,KAAK+F,IAAI8I,EAAcxU,GAAG0U,IAAKF,EAAcrU,GAAGuU,KACtDD,EAAM9O,KAAKC,IAAI4O,EAAcxU,GAAGyU,IAAKD,EAAcrU,GAAGsU,KAK1DhM,EAASzI,EACT,GACEyI,EAAStJ,EAAEsJ,OAAOA,GAClBqM,EAAM1U,KAAKqI,SACJA,IACC+L,EAAc/L,GAAQiM,IAAMA,GAAOD,EAAMD,EAAc/L,GAAQgM,MAKzE,IAJAI,EAAMpM,EAGNA,EAAStI,GACDsI,EAAStJ,EAAEsJ,OAAOA,MAAaoM,GACrCE,EAAM3U,KAAKqI,GAGb,MAAO,CAAEuM,KAAMF,EAAMtO,OAAOuO,EAAM3I,WAAYyI,IAAKA,EACrD,CA7DmBI,CAAS9V,EAAGqV,EAAexF,EAAQhP,EAAGgP,EAAQ7O,GACzD6U,EAAOJ,EAASI,KAChBH,EAAMD,EAASC,IACfK,EAAU,EACVC,EAAQH,EAAKE,GACbE,GAAY,EAETpV,IAAMgP,EAAQ7O,GAAG,CAGtB,GAFA0B,EAAO1C,EAAE0C,KAAK7B,GAEVoV,EAAW,CACb,MAAQD,EAAQH,EAAKE,MAAcL,GAC5B1V,EAAE0C,KAAKsT,GAAOjT,QAAUL,EAAKT,MAClC8T,IAGEC,IAAUN,IACZO,GAAY,EAEhB,CAEA,IAAKA,EAAW,CACd,KAAOF,EAAUF,EAAKlT,OAAS,GACxB3C,EAAE0C,KAAKsT,EAAQH,EAAKE,EAAU,IAAIjT,SAAWJ,EAAKT,MACvD8T,IAEFC,EAAQH,EAAKE,EACf,CAEA/V,EAAEwC,UAAU3B,EAAGmV,GACfnV,EAAIb,EAAEgQ,WAAWnP,GAAG,EACtB,CACF,GACF,C,8BCzCA,IAAIhB,EAAI,EAAQ,MACZmF,EAAQ,cACRvF,EAAO,EAAQ,MAqCnB,SAASyW,EAAmBlW,EAAG4R,GAC7B,IAAIuE,EAAY,CAAC,EAqCjB,OADAtW,EAAE+F,OAAOgM,GAlCT,SAAoBwE,EAAW3Q,GAC7B,IAGE4Q,EAAK,EAGLC,EAAU,EACVC,EAAkBH,EAAUzT,OAC5B6T,EAAW3W,EAAEyL,KAAK7F,GAsBpB,OApBA5F,EAAEa,QAAQ+E,GAAO,SAAS5E,EAAG6E,GAC3B,IAAI1E,EAuEV,SAAmChB,EAAGa,GACpC,GAAIb,EAAE0C,KAAK7B,GAAG2J,MACZ,OAAO3K,EAAEmO,KAAKhO,EAAEyU,aAAa5T,IAAI,SAASgF,GACxC,OAAO7F,EAAE0C,KAAKmD,GAAG2E,KACnB,GAEJ,CA7EciM,CAA0BzW,EAAGa,GACnC6V,EAAK1V,EAAIhB,EAAE0C,KAAK1B,GAAGsH,MAAQiO,GAEzBvV,GAAKH,IAAM2V,KACb3W,EAAEa,QAAQ+E,EAAMkR,MAAML,EAAS5Q,EAAG,IAAI,SAASkR,GAC7C/W,EAAEa,QAAQV,EAAEyU,aAAamC,IAAW,SAAS/Q,GAC3C,IAAIgR,EAAS7W,EAAE0C,KAAKmD,GAClBiR,EAAOD,EAAOvO,QACXwO,EAAOT,GAAMK,EAAKI,IACjBD,EAAOrM,OAASxK,EAAE0C,KAAKkU,GAAUpM,OACrCuM,EAAYZ,EAAWtQ,EAAG+Q,EAE9B,GACF,IACAN,EAAU5Q,EAAI,EACd2Q,EAAKK,EAET,IAEOjR,CACT,IAGO0Q,CACT,CAEA,SAASa,EAAmBhX,EAAG4R,GAC7B,IAAIuE,EAAY,CAAC,EAEjB,SAASc,EAAKC,EAAOhG,EAAUiG,EAAUC,EAAiBC,GACxD,IAAIxW,EACJhB,EAAEa,QAAQb,EAAE8G,MAAMuK,EAAUiG,IAAW,SAASzR,GAC9C7E,EAAIqW,EAAMxR,GACN1F,EAAE0C,KAAK7B,GAAG2J,OACZ3K,EAAEa,QAAQV,EAAEyU,aAAa5T,IAAI,SAASgF,GACpC,IAAIyR,EAAQtX,EAAE0C,KAAKmD,GACfyR,EAAM9M,QACL8M,EAAMhP,MAAQ8O,GAAmBE,EAAMhP,MAAQ+O,IAClDN,EAAYZ,EAAWtQ,EAAGhF,EAE9B,GAEJ,GACF,CAyBA,OADAhB,EAAE+F,OAAOgM,GArBT,SAAoB2F,EAAOL,GACzB,IACEM,EADEC,GAAgB,EAElBvG,EAAW,EAeb,OAbArR,EAAEa,QAAQwW,GAAO,SAASrW,EAAG6W,GAC3B,GAAwB,WAApB1X,EAAE0C,KAAK7B,GAAG2J,MAAoB,CAChC,IAAIiK,EAAezU,EAAEyU,aAAa5T,GAC9B4T,EAAa9R,SACf6U,EAAexX,EAAE0C,KAAK+R,EAAa,IAAInM,MACvC2O,EAAKC,EAAOhG,EAAUwG,EAAgBD,EAAcD,GACpDtG,EAAWwG,EACXD,EAAeD,EAEnB,CACAP,EAAKC,EAAOhG,EAAUgG,EAAMvU,OAAQ6U,EAAcD,EAAM5U,OAC1D,IAEOuU,CACT,IAGOf,CACT,CAUA,SAASY,EAAYZ,EAAWtV,EAAGG,GACjC,GAAIH,EAAIG,EAAG,CACT,IAAImS,EAAMtS,EACVA,EAAIG,EACJA,EAAImS,CACN,CAEA,IAAIwE,EAAaxB,EAAUtV,GACtB8W,IACHxB,EAAUtV,GAAK8W,EAAa,CAAC,GAE/BA,EAAW3W,IAAK,CAClB,CAEA,SAAS4W,EAAYzB,EAAWtV,EAAGG,GACjC,GAAIH,EAAIG,EAAG,CACT,IAAImS,EAAMtS,EACVA,EAAIG,EACJA,EAAImS,CACN,CACA,OAAOtT,EAAEiB,IAAIqV,EAAUtV,GAAIG,EAC7B,CAUA,SAAS6W,EAAkB7X,EAAG4R,EAAUuE,EAAW2B,GACjD,IAAItJ,EAAO,CAAC,EACVuJ,EAAQ,CAAC,EACT3G,EAAM,CAAC,EAkCT,OA7BAvR,EAAEa,QAAQkR,GAAU,SAASnM,GAC3B5F,EAAEa,QAAQ+E,GAAO,SAAS5E,EAAGyH,GAC3BkG,EAAK3N,GAAKA,EACVkX,EAAMlX,GAAKA,EACXuQ,EAAIvQ,GAAKyH,CACX,GACF,IAEAzI,EAAEa,QAAQkR,GAAU,SAASnM,GAC3B,IAAIuS,GAAW,EACfnY,EAAEa,QAAQ+E,GAAO,SAAS5E,GACxB,IAAIoX,EAAKH,EAAWjX,GACpB,GAAIoX,EAAGtV,OAAQ,CACbsV,EAAKpY,EAAEwO,OAAO4J,GAAI,SAASjX,GAAK,OAAOoQ,EAAIpQ,EAAI,IAE/C,IADA,IAAIkX,GAAMD,EAAGtV,OAAS,GAAK,EAClB+C,EAAIc,KAAK2R,MAAMD,GAAKE,EAAK5R,KAAK6R,KAAKH,GAAKxS,GAAK0S,IAAM1S,EAAG,CAC7D,IAAI1E,EAAIiX,EAAGvS,GACPqS,EAAMlX,KAAOA,GACbmX,EAAU5G,EAAIpQ,KACb4W,EAAYzB,EAAWtV,EAAGG,KAC7B+W,EAAM/W,GAAKH,EACXkX,EAAMlX,GAAK2N,EAAK3N,GAAK2N,EAAKxN,GAC1BgX,EAAU5G,EAAIpQ,GAElB,CACF,CACF,GACF,IAEO,CAAEwN,KAAMA,EAAMuJ,MAAOA,EAC9B,CAEA,SAASO,EAAqBtY,EAAG4R,EAAUpD,EAAMuJ,EAAOQ,GAMtD,IAAIC,EAAK,CAAC,EACRC,EAmDJ,SAAyBzY,EAAG4R,EAAUpD,EAAM+J,GAC1C,IAAIG,EAAa,IAAI1T,EACnBiH,EAAajM,EAAEE,QACfyY,EA+GJ,SAAalK,EAASmK,EAASL,GAC7B,OAAO,SAASvY,EAAGa,EAAGG,GACpB,IAGI6X,EAHAC,EAAS9Y,EAAE0C,KAAK7B,GAChBkY,EAAS/Y,EAAE0C,KAAK1B,GAChByP,EAAM,EAIV,GADAA,GAAOqI,EAAO5W,MAAQ,EAClBrC,EAAEiB,IAAIgY,EAAQ,YAChB,OAAQA,EAAOjP,SAASnG,eACxB,IAAK,IAAKmV,GAASC,EAAO5W,MAAQ,EAAG,MACrC,IAAK,IAAK2W,EAAQC,EAAO5W,MAAQ,EAYnC,GATI2W,IACFpI,GAAO8H,EAAaM,GAASA,GAE/BA,EAAQ,EAERpI,IAAQqI,EAAOtO,MAAQoO,EAAUnK,GAAW,EAC5CgC,IAAQsI,EAAOvO,MAAQoO,EAAUnK,GAAW,EAE5CgC,GAAOsI,EAAO7W,MAAQ,EAClBrC,EAAEiB,IAAIiY,EAAQ,YAChB,OAAQA,EAAOlP,SAASnG,eACxB,IAAK,IAAKmV,EAAQE,EAAO7W,MAAQ,EAAG,MACpC,IAAK,IAAK2W,GAASE,EAAO7W,MAAQ,EAQpC,OALI2W,IACFpI,GAAO8H,EAAaM,GAASA,GAE/BA,EAAQ,EAEDpI,CACT,CACF,CAnJYuI,CAAI/M,EAAWuB,QAASvB,EAAWsB,QAASgL,GAgBtD,OAdA1Y,EAAEa,QAAQkR,GAAU,SAASnM,GAC3B,IAAII,EACJhG,EAAEa,QAAQ+E,GAAO,SAAS5E,GACxB,IAAIoY,EAAQzK,EAAK3N,GAEjB,GADA6X,EAAWlT,QAAQyT,GACfpT,EAAG,CACL,IAAIqT,EAAQ1K,EAAK3I,GACfsT,EAAUT,EAAWrY,KAAK6Y,EAAOD,GACnCP,EAAWlX,QAAQ0X,EAAOD,EAAOzS,KAAKC,IAAIkS,EAAM3Y,EAAGa,EAAGgF,GAAIsT,GAAW,GACvE,CACAtT,EAAIhF,CACN,GACF,IAEO6X,CACT,CAvEaU,CAAgBpZ,EAAG4R,EAAUpD,EAAM+J,GAC5CnW,EAAamW,EAAa,aAAe,cAE3C,SAASc,EAAQC,EAAWC,GAI1B,IAHA,IAAI/Y,EAAQiY,EAAO9X,QACf6Y,EAAOhZ,EAAMsT,MACbrT,EAAU,CAAC,EACR+Y,GACD/Y,EAAQ+Y,GACVF,EAAUE,IAEV/Y,EAAQ+Y,IAAQ,EAChBhZ,EAAMS,KAAKuY,GACXhZ,EAAQA,EAAM6G,OAAOkS,EAAcC,KAGrCA,EAAOhZ,EAAMsT,KAEjB,CA6BA,OARAuF,GAlBA,SAAeG,GACbhB,EAAGgB,GAAQf,EAAO9Q,QAAQ6R,GAAM5T,QAAO,SAAS0J,EAAKlP,GACnD,OAAOoG,KAAKC,IAAI6I,EAAKkJ,EAAGpY,EAAES,GAAK4X,EAAOpY,KAAKD,GAC7C,GAAG,EACL,GAceqY,EAAOhE,aAAagF,KAAKhB,IACxCY,GAZA,SAAeG,GACb,IAAIjN,EAAMkM,EAAO1X,SAASyY,GAAM5T,QAAO,SAAS0J,EAAKlP,GACnD,OAAOoG,KAAK+F,IAAI+C,EAAKkJ,EAAGpY,EAAEY,GAAKyX,EAAOpY,KAAKD,GAC7C,GAAGwL,OAAOC,mBAENnJ,EAAO1C,EAAE0C,KAAK8W,GACdjN,IAAQX,OAAOC,mBAAqBnJ,EAAKN,aAAeA,IAC1DoW,EAAGgB,GAAQhT,KAAKC,IAAI+R,EAAGgB,GAAOjN,GAElC,GAGekM,EAAOzI,WAAWyJ,KAAKhB,IAGtC5Y,EAAEa,QAAQqX,GAAO,SAASlX,GACxB2X,EAAG3X,GAAK2X,EAAGhK,EAAK3N,GAClB,IAEO2X,CACT,CA4BA,SAASkB,EAA2B1Z,EAAG2Z,GACrC,OAAO9Z,EAAEsO,MAAMtO,EAAEyO,OAAOqL,IAAM,SAAUnB,GACtC,IAAI/R,EAAMmF,OAAOgO,kBACbrN,EAAMX,OAAOC,kBASjB,OAPAhM,EAAEoO,MAAMuK,GAAI,SAAUlV,EAAGzC,GACvB,IAAIgZ,EAyHV,SAAe7Z,EAAGa,GAChB,OAAOb,EAAE0C,KAAK7B,GAAGqB,KACnB,CA3HsBA,CAAMlC,EAAGa,GAAK,EAE9B4F,EAAMD,KAAKC,IAAInD,EAAIuW,EAAWpT,GAC9B8F,EAAM/F,KAAK+F,IAAIjJ,EAAIuW,EAAWtN,EAChC,IAEO9F,EAAM8F,CACf,GACF,CASA,SAASuN,EAAiBH,EAAKI,GAC7B,IAAIC,EAAcna,EAAEyO,OAAOyL,GACzBE,EAAapa,EAAE0M,IAAIyN,GACnBE,EAAara,EAAE4G,IAAIuT,GAErBna,EAAEa,QAAQ,CAAC,IAAK,MAAM,SAASyZ,GAC7Bta,EAAEa,QAAQ,CAAC,IAAK,MAAM,SAAS0Z,GAC7B,IAEEvB,EAFEwB,EAAYF,EAAOC,EACrB5B,EAAKmB,EAAIU,GAEX,GAAI7B,IAAOuB,EAAX,CAEA,IAAIO,EAASza,EAAEyO,OAAOkK,IACtBK,EAAkB,MAAVuB,EAAgBH,EAAapa,EAAE0M,IAAI+N,GAAUJ,EAAara,EAAE4G,IAAI6T,MAGtEX,EAAIU,GAAaxa,EAAE6N,UAAU8K,GAAI,SAASlV,GAAK,OAAOA,EAAIuV,CAAO,IANzC,CAQ5B,GACF,GACF,CAEA,SAAS0B,EAAQZ,EAAK5B,GACpB,OAAOlY,EAAE6N,UAAUiM,EAAIa,IAAI,SAASC,EAAQ5Z,GAC1C,GAAIkX,EACF,OAAO4B,EAAI5B,EAAMrU,eAAe7C,GAEhC,IAAI2X,EAAK3Y,EAAEwO,OAAOxO,EAAE+G,IAAI+S,EAAK9Y,IAC7B,OAAQ2X,EAAG,GAAKA,EAAG,IAAM,CAE7B,GACF,CA5UApZ,EAAOC,QAAU,CACfqb,UA6UF,SAAmB1a,GACjB,IAMI2a,EANA/I,EAAWnS,EAAK0F,iBAAiBnF,GACjCmW,EAAYtW,EAAEgJ,MAChBqN,EAAmBlW,EAAG4R,GACtBoF,EAAmBhX,EAAG4R,IAEpB+H,EAAM,CAAC,EAEX9Z,EAAEa,QAAQ,CAAC,IAAK,MAAM,SAASyZ,GAC7BQ,EAA4B,MAATR,EAAevI,EAAW/R,EAAEyO,OAAOsD,GAAU3E,UAChEpN,EAAEa,QAAQ,CAAC,IAAK,MAAM,SAAS0Z,GACf,MAAVA,IACFO,EAAmB9a,EAAE+G,IAAI+T,GAAkB,SAASC,GAClD,OAAO/a,EAAEyO,OAAOsM,GAAO3N,SACzB,KAGF,IAAI6K,GAAuB,MAATqC,EAAena,EAAEyU,aAAezU,EAAEgQ,YAAYyJ,KAAKzZ,GACjE+X,EAAQF,EAAkB7X,EAAG2a,EAAkBxE,EAAW2B,GAC1DU,EAAKF,EAAqBtY,EAAG2a,EAC/B5C,EAAMvJ,KAAMuJ,EAAMA,MAAiB,MAAVqC,GACb,MAAVA,IACF5B,EAAK3Y,EAAE6N,UAAU8K,GAAI,SAASlV,GAAK,OAAQA,CAAG,KAEhDqW,EAAIQ,EAAOC,GAAS5B,CACtB,GACF,IAEA,IAAIqC,EAAgBnB,EAA2B1Z,EAAG2Z,GAElD,OADAG,EAAiBH,EAAKkB,GACfN,EAAQZ,EAAK3Z,EAAEE,QAAQ6X,MAChC,EA3WE7B,mBAAoBA,EACpBc,mBAAoBA,EACpBD,YAAaA,EACba,YAAaA,EACbC,kBAAmBA,EACnBS,qBAAsBA,EACtBwB,iBAAkBA,EAClBJ,2BAA4BA,EAC5Ba,QAASA,E,8BCnBX,IAAI1a,EAAI,EAAQ,MACZJ,EAAO,EAAQ,MACfib,EAAY,kBAEhBtb,EAAOC,QAEP,SAAkBW,IASlB,SAAmBA,GACjB,IAAI4R,EAAWnS,EAAK0F,iBAAiBnF,GACjC8a,EAAU9a,EAAEE,QAAQyJ,QACpBoR,EAAQ,EACZlb,EAAEa,QAAQkR,GAAU,SAASnM,GAC3B,IAAIuV,EAAYnb,EAAE4G,IAAI5G,EAAE+G,IAAInB,GAAO,SAAS5E,GAAK,OAAOb,EAAE0C,KAAK7B,GAAGsB,MAAQ,KAC1EtC,EAAEa,QAAQ+E,GAAO,SAAS5E,GACxBb,EAAE0C,KAAK7B,GAAGuC,EAAI2X,EAAQC,EAAY,CACpC,IACAD,GAASC,EAAYF,CACvB,GACF,EAjBEG,CAFAjb,EAAIP,EAAKyK,mBAAmBlK,IAG5BH,EAAEa,QAAQga,EAAU1a,IAAI,SAASsD,EAAGzC,GAClCb,EAAE0C,KAAK7B,GAAGyC,EAAIA,CAChB,GACF,C,8BCbA,IAAIzD,EAAI,EAAQ,MACZmF,EAAQ,cACRkW,EAAQ,cAmDZ,SAASC,EAAUhQ,EAAGnL,GAcpB,OADAH,EAAEa,QAAQyK,EAAExK,SAZZ,SAASC,EAAIC,GACXhB,EAAEa,QAAQV,EAAEob,UAAUva,IAAI,SAAST,GACjC,IAAIib,EAAQjb,EAAES,EACZG,EAAKH,IAAMwa,EAASjb,EAAEY,EAAIqa,EACvBlQ,EAAEyF,QAAQ5P,IAAOka,EAAMlb,EAAGI,KAC7B+K,EAAE3F,QAAQxE,EAAG,CAAC,GACdmK,EAAE3J,QAAQX,EAAGG,EAAG,CAAC,GACjBJ,EAAII,GAER,GACF,IAGOmK,EAAEnF,WACX,CAMA,SAASsV,EAAiBnQ,EAAGnL,GAC3B,OAAOH,EAAEsO,MAAMnO,EAAE2B,SAAS,SAASvB,GACjC,GAAI+K,EAAEyF,QAAQxQ,EAAES,KAAOsK,EAAEyF,QAAQxQ,EAAEY,GACjC,OAAOka,EAAMlb,EAAGI,EAEpB,GACF,CAEA,SAASmb,EAAWpQ,EAAGnL,EAAG6Y,GACxBhZ,EAAEa,QAAQyK,EAAExK,SAAS,SAASE,GAC5Bb,EAAE0C,KAAK7B,GAAGoB,MAAQ4W,CACpB,GACF,CAlFAzZ,EAAOC,QA2BP,SAAsBW,GACpB,IAOIK,EAAMwY,EAPN1N,EAAI,IAAInG,EAAM,CAAEwW,UAAU,IAG1BC,EAAQzb,EAAEW,QAAQ,GAClB+a,EAAO1b,EAAEgG,YAIb,IAHAmF,EAAE3F,QAAQiW,EAAO,CAAC,GAGXN,EAAUhQ,EAAGnL,GAAK0b,GACvBrb,EAAOib,EAAiBnQ,EAAGnL,GAC3B6Y,EAAQ1N,EAAEyF,QAAQvQ,EAAKQ,GAAKqa,EAAMlb,EAAGK,IAAS6a,EAAMlb,EAAGK,GACvDkb,EAAWpQ,EAAGnL,EAAG6Y,GAGnB,OAAO1N,CACT,C,8BC/CA,IACIwQ,EADW,EAAQ,MACIA,YACvBC,EAAe,EAAQ,MACvBC,EAAiB,EAAQ,MAE7Bzc,EAAOC,QAqBP,SAAcW,GACZ,OAAOA,EAAEE,QAAQ4b,QACjB,IAAK,kBAGL,SAYF,SAA8B9b,GAC5B6b,EAAe7b,EACjB,CAdW+b,CAAqB/b,SAF9B,IAAK,cASP,SAAyBA,GACvB2b,EAAY3b,GACZ4b,EAAa5b,EACf,CAZqBgc,CAAgBhc,GAAI,MACvC,IAAK,eAAgBic,EAAkBjc,GAGzC,EAGA,IAAIic,EAAoBN,C,8BCpCxB,IAAI9b,EAAI,EAAQ,MACZ+b,EAAe,EAAQ,MACvBV,EAAQ,cACRgB,EAAW,oBACXC,EAAW,YAA2BA,SACtC3G,EAAY,YAA2BA,UACvC4G,EAAW,iBA6Cf,SAASP,EAAe7b,GACtBA,EAAIoc,EAASpc,GACbkc,EAASlc,GACT,IAIII,EAJA+K,EAAIyQ,EAAa5b,GAKrB,IAJAqc,EAAiBlR,GACjBmR,EAAcnR,EAAGnL,GAGTI,EAAImc,EAAUpR,IAEpBqR,EAAcrR,EAAGnL,EAAGI,EADhBqc,EAAUtR,EAAGnL,EAAGI,GAGxB,CAKA,SAASkc,EAAcnR,EAAGnL,GACxB,IAAIkQ,EAAKsF,EAAUrK,EAAGA,EAAExK,SACxBuP,EAAKA,EAAGyG,MAAM,EAAGzG,EAAGvN,OAAS,GAC7B9C,EAAEa,QAAQwP,GAAI,SAASrP,IAKzB,SAAwBsK,EAAGnL,EAAG6O,GAC5B,IACIvF,EADW6B,EAAEzI,KAAKmM,GACAvF,OACtB6B,EAAE9K,KAAKwO,EAAOvF,GAAQoT,SAAWC,EAAaxR,EAAGnL,EAAG6O,EACtD,CARI+N,CAAezR,EAAGnL,EAAGa,EACvB,GACF,CAYA,SAAS8b,EAAaxR,EAAGnL,EAAG6O,GAC1B,IACIvF,EADW6B,EAAEzI,KAAKmM,GACAvF,OAElBuT,GAAc,EAEdC,EAAY9c,EAAEK,KAAKwO,EAAOvF,GAE1ByT,EAAW,EAyBf,OAvBKD,IACHD,GAAc,EACdC,EAAY9c,EAAEK,KAAKiJ,EAAQuF,IAG7BkO,EAAWD,EAAUxc,OAErBT,EAAEa,QAAQV,EAAEob,UAAUvM,IAAQ,SAASzO,GACrC,IAqHsByF,EAAGhF,EArHrBmc,EAAY5c,EAAES,IAAMgO,EACtB0F,EAAQyI,EAAY5c,EAAEY,EAAIZ,EAAES,EAE9B,GAAI0T,IAAUjL,EAAQ,CACpB,IAAI2T,EAAeD,IAAcH,EAC/BK,EAAcld,EAAEK,KAAKD,GAAGE,OAG1B,GADAyc,GAAYE,EAAeC,GAAeA,EA8GtBrX,EA7GFgJ,EA6GKhO,EA7GE0T,EAAVpJ,EA8GPgS,QAAQtX,EAAGhF,GA9Gc,CAC/B,IAAIuc,EAAgBjS,EAAE9K,KAAKwO,EAAO0F,GAAOmI,SACzCK,GAAYE,GAAgBG,EAAgBA,CAC9C,CACF,CACF,IAEOL,CACT,CAEA,SAASV,EAAiB9K,EAAM/C,GAC1B6O,UAAU1a,OAAS,IACrB6L,EAAO+C,EAAK5Q,QAAQ,IAEtB2c,EAAgB/L,EAAM,CAAC,EAAG,EAAG/C,EAC/B,CAEA,SAAS8O,EAAgB/L,EAAM9Q,EAAS8c,EAAS1c,EAAGyI,GAClD,IAAIiM,EAAMgI,EACNpc,EAAQoQ,EAAK7O,KAAK7B,GAkBtB,OAhBAJ,EAAQI,IAAK,EACbhB,EAAEa,QAAQ6Q,EAAKiM,UAAU3c,IAAI,SAASG,GAC/BnB,EAAEiB,IAAIL,EAASO,KAClBuc,EAAUD,EAAgB/L,EAAM9Q,EAAS8c,EAASvc,EAAGH,GAEzD,IAEAM,EAAMoU,IAAMA,EACZpU,EAAMmU,IAAMiI,IACRjU,EACFnI,EAAMmI,OAASA,SAGRnI,EAAMmI,OAGRiU,CACT,CAEA,SAAShB,EAAUhL,GACjB,OAAO1R,EAAEmO,KAAKuD,EAAK5P,SAAS,SAASvB,GACnC,OAAOmR,EAAKlR,KAAKD,GAAGsc,SAAW,CACjC,GACF,CAEA,SAASD,EAAUtR,EAAGnL,EAAGK,GACvB,IAAIQ,EAAIR,EAAKQ,EACTG,EAAIX,EAAKW,EAKRhB,EAAEmd,QAAQtc,EAAGG,KAChBH,EAAIR,EAAKW,EACTA,EAAIX,EAAKQ,GAGX,IAAIiY,EAAS3N,EAAEzI,KAAK7B,GAChBkY,EAAS5N,EAAEzI,KAAK1B,GAChByc,EAAY3E,EACZ4E,GAAO,EAIP5E,EAAOxD,IAAMyD,EAAOzD,MACtBmI,EAAY1E,EACZ2E,GAAO,GAGT,IAAIC,EAAa9d,EAAEkO,OAAO/N,EAAE2B,SAAS,SAAStB,GAC5C,OAAOqd,IAASE,EAAazS,EAAGA,EAAEzI,KAAKrC,EAAKQ,GAAI4c,IACzCC,IAASE,EAAazS,EAAGA,EAAEzI,KAAKrC,EAAKW,GAAIyc,EAClD,IAEA,OAAO5d,EAAEsO,MAAMwP,GAAY,SAAStd,GAAQ,OAAO6a,EAAMlb,EAAGK,EAAO,GACrE,CAEA,SAASmc,EAAcrR,EAAGnL,EAAGI,EAAGyd,GAC9B,IAAIhd,EAAIT,EAAES,EACNG,EAAIZ,EAAEY,EACVmK,EAAE/J,WAAWP,EAAGG,GAChBmK,EAAE3J,QAAQqc,EAAEhd,EAAGgd,EAAE7c,EAAG,CAAC,GACrBqb,EAAiBlR,GACjBmR,EAAcnR,EAAGnL,GAInB,SAAqBmL,EAAGnL,GACtB,IAAIwO,EAAO3O,EAAEmO,KAAK7C,EAAExK,SAAS,SAASE,GAAK,OAAQb,EAAE0C,KAAK7B,GAAGyI,MAAQ,IACjE4G,EAAKiM,EAAShR,EAAGqD,GACrB0B,EAAKA,EAAGyG,MAAM,GACd9W,EAAEa,QAAQwP,GAAI,SAASrP,GACrB,IAAIyI,EAAS6B,EAAEzI,KAAK7B,GAAGyI,OACrBjJ,EAAOL,EAAEK,KAAKQ,EAAGyI,GACjBwU,GAAU,EAEPzd,IACHA,EAAOL,EAAEK,KAAKiJ,EAAQzI,GACtBid,GAAU,GAGZ9d,EAAE0C,KAAK7B,GAAGoB,KAAOjC,EAAE0C,KAAK4G,GAAQrH,MAAQ6b,EAAUzd,EAAKuJ,QAAUvJ,EAAKuJ,OACxE,GACF,CAnBEmU,CAAY5S,EAAGnL,EACjB,CA+BA,SAAS4d,EAAarM,EAAMuH,EAAQkF,GAClC,OAAOA,EAAUzI,KAAOuD,EAAOxD,KAAOwD,EAAOxD,KAAO0I,EAAU1I,GAChE,CA/NAlW,EAAOC,QAAUwc,EAGjBA,EAAeQ,iBAAmBA,EAClCR,EAAeS,cAAgBA,EAC/BT,EAAec,aAAeA,EAC9Bd,EAAeU,UAAYA,EAC3BV,EAAeY,UAAYA,EAC3BZ,EAAeW,cAAgBA,C,8BChB/B,IAAI3c,EAAI,EAAQ,MAEhBT,EAAOC,QAAU,CACfsc,YAyBF,SAAqB3b,GACnB,IAAIS,EAAU,CAAC,EAsBfZ,EAAEa,QAAQV,EAAEkH,WApBZ,SAAStG,EAAIC,GACX,IAAIM,EAAQnB,EAAE0C,KAAK7B,GACnB,GAAIhB,EAAEiB,IAAIL,EAASI,GACjB,OAAOM,EAAMc,KAEfxB,EAAQI,IAAK,EAEb,IAAIoB,EAAOpC,EAAE0M,IAAI1M,EAAE+G,IAAI5G,EAAEe,SAASF,IAAI,SAAST,GAC7C,OAAOQ,EAAIR,EAAEY,GAAKhB,EAAEK,KAAKD,GAAGwJ,MAC9B,KAQA,OANI3H,IAAS2J,OAAOC,mBAAhB5J,MACAA,IAEFA,EAAO,GAGDd,EAAMc,KAAOA,CACvB,GAGF,EAhDEiZ,MAsDF,SAAelb,EAAGI,GAChB,OAAOJ,EAAE0C,KAAKtC,EAAEY,GAAGiB,KAAOjC,EAAE0C,KAAKtC,EAAES,GAAGoB,KAAOjC,EAAEK,KAAKD,GAAGwJ,MACzD,E,8BC1DA,IAAI/J,EAAI,EAAQ,MACZmF,EAAQ,cAsBZ,SAASzC,EAAavC,EAAGie,EAAM/a,EAAO5B,GACpC,IAAIT,EACJ,GACEA,EAAIhB,EAAE4B,SAASH,SACRtB,EAAE4Q,QAAQ/P,IAInB,OAFAqC,EAAMsH,MAAQyT,EACdje,EAAEwF,QAAQ3E,EAAGqC,GACNrC,CACT,CAgKA,SAASkC,EAAQ/C,GACf,OAAOH,EAAE4G,IAAI5G,EAAE+G,IAAI5G,EAAEW,SAAS,SAASE,GACrC,IAAIoB,EAAOjC,EAAE0C,KAAK7B,GAAGoB,KACrB,IAAKpC,EAAEqO,YAAYjM,GACjB,OAAOA,CAEX,IACF,CApMA7C,EAAOC,QAAU,CACfkD,aAAcA,EACd6Z,SAiCF,SAAkBpc,GAChB,IAAIke,GAAa,IAAIlZ,GAAQO,SAASvF,EAAEE,SAUxC,OATAL,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAAKqd,EAAW1Y,QAAQ3E,EAAGb,EAAE0C,KAAK7B,GAAK,IACrEhB,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B,IAAI+d,EAAcD,EAAW7d,KAAKD,EAAES,EAAGT,EAAEY,IAAM,CAAEV,OAAQ,EAAGsJ,OAAQ,GAChEzI,EAAQnB,EAAEK,KAAKD,GACnB8d,EAAW1c,QAAQpB,EAAES,EAAGT,EAAEY,EAAG,CAC3BV,OAAQ6d,EAAY7d,OAASa,EAAMb,OACnCsJ,OAAQpD,KAAKC,IAAI0X,EAAYvU,OAAQzI,EAAMyI,SAE/C,IACOsU,CACT,EA5CEhU,mBA8CF,SAA4BlK,GAC1B,IAAIke,EAAa,IAAIlZ,EAAM,CAAEM,WAAYtF,EAAEoe,iBAAkB7Y,SAASvF,EAAEE,SASxE,OARAL,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GACvBb,EAAEyC,SAAS5B,GAAG8B,QACjBub,EAAW1Y,QAAQ3E,EAAGb,EAAE0C,KAAK7B,GAEjC,IACAhB,EAAEa,QAAQV,EAAE2B,SAAS,SAASvB,GAC5B8d,EAAW1c,QAAQpB,EAAGJ,EAAEK,KAAKD,GAC/B,IACO8d,CACT,EAxDEG,iBA0DF,SAA0Bre,GACxB,IAAIse,EAAYze,EAAE+G,IAAI5G,EAAEW,SAAS,SAASE,GACxC,IAAI0d,EAAO,CAAC,EAIZ,OAHA1e,EAAEa,QAAQV,EAAEe,SAASF,IAAI,SAAST,GAChCme,EAAKne,EAAEY,IAAMud,EAAKne,EAAEY,IAAM,GAAKhB,EAAEK,KAAKD,GAAGE,MAC3C,IACOie,CACT,IACA,OAAO1e,EAAE0O,UAAUvO,EAAEW,QAAS2d,EAChC,EAlEEE,mBAoEF,SAA4Bxe,GAC1B,IAAIse,EAAYze,EAAE+G,IAAI5G,EAAEW,SAAS,SAASE,GACxC,IAAI4d,EAAQ,CAAC,EAIb,OAHA5e,EAAEa,QAAQV,EAAE2H,QAAQ9G,IAAI,SAAST,GAC/Bqe,EAAMre,EAAES,IAAM4d,EAAMre,EAAES,IAAM,GAAKb,EAAEK,KAAKD,GAAGE,MAC7C,IACOme,CACT,IACA,OAAO5e,EAAE0O,UAAUvO,EAAEW,QAAS2d,EAChC,EA5EEvR,cAkFF,SAAuB2R,EAAMC,GAC3B,IAcIC,EAAIC,EAdJvb,EAAIob,EAAKpb,EACTF,EAAIsb,EAAKtb,EAIT4H,EAAK2T,EAAMrb,EAAIA,EACf2H,EAAK0T,EAAMvb,EAAIA,EACfpC,EAAI0d,EAAKxc,MAAQ,EACjBkD,EAAIsZ,EAAKvc,OAAS,EAEtB,IAAK6I,IAAOC,EACV,MAAM,IAAI6T,MAAM,6DAoBlB,OAhBItY,KAAKgF,IAAIP,GAAMjK,EAAIwF,KAAKgF,IAAIR,GAAM5F,GAEhC6F,EAAK,IACP7F,GAAKA,GAEPwZ,EAAKxZ,EAAI4F,EAAKC,EACd4T,EAAKzZ,IAGD4F,EAAK,IACPhK,GAAKA,GAEP4d,EAAK5d,EACL6d,EAAK7d,EAAIiK,EAAKD,GAGT,CAAE1H,EAAGA,EAAIsb,EAAIxb,EAAGA,EAAIyb,EAC7B,EAlHE1Z,iBAwHF,SAA0BnF,GACxB,IAAI4R,EAAW/R,EAAE+G,IAAI/G,EAAE8G,MAAM5D,EAAQ/C,GAAK,IAAI,WAAa,MAAO,EAAI,IAQtE,OAPAH,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GACdoB,EAAOS,EAAKT,KACXpC,EAAEqO,YAAYjM,KACjB2P,EAAS3P,GAAMS,EAAK4F,OAASzH,EAEjC,IACO+Q,CACT,EAjIE5J,eAuIF,SAAwBhI,GACtB,IAAIuM,EAAM1M,EAAE0M,IAAI1M,EAAE+G,IAAI5G,EAAEW,SAAS,SAASE,GAAK,OAAOb,EAAE0C,KAAK7B,GAAGoB,IAAM,KACtEpC,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,IAAI6B,EAAO1C,EAAE0C,KAAK7B,GACdhB,EAAEiB,IAAI4B,EAAM,UACdA,EAAKT,MAAQsK,EAEjB,GACF,EA9IErE,iBAgJF,SAA0BlI,GAExB,IAAI+e,EAASlf,EAAE0M,IAAI1M,EAAE+G,IAAI5G,EAAEW,SAAS,SAASE,GAAK,OAAOb,EAAE0C,KAAK7B,GAAGoB,IAAM,KAErE0I,EAAS,GACb9K,EAAEa,QAAQV,EAAEW,SAAS,SAASE,GAC5B,IAAIoB,EAAOjC,EAAE0C,KAAK7B,GAAGoB,KAAO8c,EACvBpU,EAAO1I,KACV0I,EAAO1I,GAAQ,IAEjB0I,EAAO1I,GAAMhB,KAAKJ,EACpB,IAEA,IAAIgY,EAAQ,EACRrJ,EAAiBxP,EAAEE,QAAQsP,eAC/B3P,EAAEa,QAAQiK,GAAQ,SAASuF,EAAIxK,GACzB7F,EAAEqO,YAAYgC,IAAOxK,EAAI8J,GAAmB,IAC5CqJ,EACOA,GACThZ,EAAEa,QAAQwP,GAAI,SAASrP,GAAKb,EAAE0C,KAAK7B,GAAGoB,MAAQ4W,CAAO,GAEzD,GACF,EArKEjX,cAuKF,SAAuB5B,EAAG8B,EAAQG,EAAMqG,GACtC,IAAI5F,EAAO,CACTR,MAAO,EACPC,OAAQ,GAMV,OAJIkb,UAAU1a,QAAU,IACtBD,EAAKT,KAAOA,EACZS,EAAK4F,MAAQA,GAER/F,EAAavC,EAAG,SAAU0C,EAAMZ,EACzC,EAhLEiB,QAASA,EACTiS,UA+LF,SAAmBgK,EAAYC,GAC7B,IAAI1O,EAAS,CAAE2E,IAAK,GAAIC,IAAK,IAQ7B,OAPAtV,EAAEa,QAAQse,GAAY,SAASE,GACzBD,EAAGC,GACL3O,EAAO2E,IAAIjU,KAAKie,GAEhB3O,EAAO4E,IAAIlU,KAAKie,EAEpB,IACO3O,CACT,EAxME7Q,KA8MF,SAAc4B,EAAM2d,GAClB,IAAIxD,EAAQ5b,EAAEuO,MACd,IACE,OAAO6Q,GACT,CAAE,QACAE,QAAQC,IAAI9d,EAAO,WAAazB,EAAEuO,MAAQqN,GAAS,KACrD,CACF,EApNE9b,OAsNF,SAAgB2B,EAAM2d,GACpB,OAAOA,GACT,E,WC7OA7f,EAAOC,QAAU,O,iBC8BjB,IAAIggB,EAAM,EAAQ,KAElBjgB,EAAOC,QAAU,CACf2F,MAAOqa,EAAIra,MACXsa,KAAM,EAAQ,MACdC,IAAK,EAAQ,MACb3f,QAASyf,EAAIzf,Q,iBCpCf,IAAIC,EAAI,EAAQ,KAEhBT,EAAOC,QAEP,SAAoBW,GAClB,IAEIwf,EAFA/e,EAAU,CAAC,EACXgf,EAAQ,GAGZ,SAAS7e,EAAIC,GACPhB,EAAEiB,IAAIL,EAASI,KACnBJ,EAAQI,IAAK,EACb2e,EAAKve,KAAKJ,GACVhB,EAAEiO,KAAK9N,EAAEgQ,WAAWnP,GAAID,GACxBf,EAAEiO,KAAK9N,EAAEyU,aAAa5T,GAAID,GAC5B,CAUA,OARAf,EAAEiO,KAAK9N,EAAEW,SAAS,SAASE,GACzB2e,EAAO,GACP5e,EAAIC,GACA2e,EAAK7c,QACP8c,EAAMxe,KAAKue,EAEf,IAEOC,CACT,C,iBC1BA,IAAI5f,EAAI,EAAQ,KA+BhB,SAAS6f,EAAM1f,EAAGa,EAAG2U,EAAW/U,EAASkf,EAAYrQ,GAC9CzP,EAAEiB,IAAIL,EAASI,KAClBJ,EAAQI,IAAK,EAER2U,GAAalG,EAAIrO,KAAKJ,GAC3BhB,EAAEiO,KAAK6R,EAAW9e,IAAI,SAASG,GAC7B0e,EAAM1f,EAAGgB,EAAGwU,EAAW/U,EAASkf,EAAYrQ,EAC9C,IACIkG,GAAalG,EAAIrO,KAAKJ,GAE9B,CAvCAzB,EAAOC,QAUP,SAAaW,EAAGkQ,EAAI5H,GACbzI,EAAE+f,QAAQ1P,KACbA,EAAK,CAACA,IAGR,IAAIyP,GAAc3f,EAAE6f,aAAe7f,EAAEgQ,WAAahQ,EAAEwd,WAAW/D,KAAKzZ,GAEhEsP,EAAM,GACN7O,EAAU,CAAC,EAQf,OAPAZ,EAAEiO,KAAKoC,GAAI,SAASrP,GAClB,IAAKb,EAAE4Q,QAAQ/P,GACb,MAAM,IAAIie,MAAM,6BAA+Bje,GAGjD6e,EAAM1f,EAAGa,EAAa,SAAVyH,EAAkB7H,EAASkf,EAAYrQ,EACrD,IACOA,CACT,C,iBC7BA,IAAIwQ,EAAW,EAAQ,MACnBjgB,EAAI,EAAQ,KAEhBT,EAAOC,QAEP,SAAqBW,EAAG+f,EAAYC,GAClC,OAAOngB,EAAEogB,UAAUjgB,EAAEW,SAAS,SAAS2O,EAAKzO,GAC1CyO,EAAIzO,GAAKif,EAAS9f,EAAGa,EAAGkf,EAAYC,EACtC,GAAG,CAAC,EACN,C,iBCTA,IAAIngB,EAAI,EAAQ,KACZqgB,EAAgB,EAAQ,MAE5B9gB,EAAOC,QAIP,SAAkBW,EAAG2T,EAAQpT,EAAU4f,GACrC,OAKF,SAAqBngB,EAAG2T,EAAQpT,EAAU4f,GACxC,IAEItf,EAAG4S,EAFHxM,EAAU,CAAC,EACXmZ,EAAK,IAAIF,EAGTG,EAAkB,SAAShgB,GAC7B,IAAIW,EAAIX,EAAKQ,IAAMA,EAAIR,EAAKQ,EAAIR,EAAKW,EACjC6G,EAASZ,EAAQjG,GACjBV,EAASC,EAASF,GAClBigB,EAAW7M,EAAO6M,SAAWhgB,EAEjC,GAAIA,EAAS,EACX,MAAM,IAAIwe,MAAM,4DACeze,EAAO,YAAcC,GAGlDggB,EAAWzY,EAAOyY,WACpBzY,EAAOyY,SAAWA,EAClBzY,EAAO0Y,YAAc1f,EACrBuf,EAAGI,SAASxf,EAAGsf,GAEnB,EAQA,IANAtgB,EAAEW,QAAQD,SAAQ,SAASG,GACzB,IAAIyf,EAAWzf,IAAM8S,EAAS,EAAI/H,OAAOC,kBACzC5E,EAAQpG,GAAK,CAAEyf,SAAUA,GACzBF,EAAGK,IAAI5f,EAAGyf,EACZ,IAEOF,EAAG1E,OAAS,IACjB7a,EAAIuf,EAAGM,aACPjN,EAASxM,EAAQpG,IACNyf,WAAa1U,OAAOC,oBAI/BsU,EAAOtf,GAAGH,QAAQ2f,GAGpB,OAAOpZ,CACT,CA7CS0Z,CAAY3gB,EAAG4gB,OAAOjN,GAC3BpT,GAAYsgB,EACZV,GAAU,SAAStf,GAAK,OAAOb,EAAEe,SAASF,EAAI,EAClD,EANA,IAAIggB,EAAsBhhB,EAAE2H,SAAS,E,iBCLrC,IAAI3H,EAAI,EAAQ,KACZihB,EAAS,EAAQ,MAErB1hB,EAAOC,QAEP,SAAoBW,GAClB,OAAOH,EAAEkO,OAAO+S,EAAO9gB,IAAI,SAASwf,GAClC,OAAOA,EAAK7c,OAAS,GAAsB,IAAhB6c,EAAK7c,QAAgB3C,EAAEmd,QAAQqC,EAAK,GAAIA,EAAK,GAC1E,GACF,C,iBCTA,IAAI3f,EAAI,EAAQ,KAEhBT,EAAOC,QAIP,SAAuBW,EAAGO,EAAU4f,GAClC,OAKF,SAA0BngB,EAAGO,EAAU4f,GACrC,IAAIlZ,EAAU,CAAC,EACXtG,EAAQX,EAAEW,QAkCd,OAhCAA,EAAMD,SAAQ,SAASG,GACrBoG,EAAQpG,GAAK,CAAC,EACdoG,EAAQpG,GAAGA,GAAK,CAAEyf,SAAU,GAC5B3f,EAAMD,SAAQ,SAASM,GACjBH,IAAMG,IACRiG,EAAQpG,GAAGG,GAAK,CAAEsf,SAAU1U,OAAOC,mBAEvC,IACAsU,EAAOtf,GAAGH,SAAQ,SAASL,GACzB,IAAIW,EAAIX,EAAKQ,IAAMA,EAAIR,EAAKW,EAAIX,EAAKQ,EACjCkgB,EAAIxgB,EAASF,GACjB4G,EAAQpG,GAAGG,GAAK,CAAEsf,SAAUS,EAAGR,YAAa1f,EAC9C,GACF,IAEAF,EAAMD,SAAQ,SAAS6D,GACrB,IAAIyc,EAAO/Z,EAAQ1C,GACnB5D,EAAMD,SAAQ,SAASgF,GACrB,IAAIub,EAAOha,EAAQvB,GACnB/E,EAAMD,SAAQ,SAASwgB,GACrB,IAAIC,EAAKF,EAAK1c,GACV6c,EAAKJ,EAAKE,GACVG,EAAKJ,EAAKC,GACVI,EAAcH,EAAGb,SAAWc,EAAGd,SAC/BgB,EAAcD,EAAGf,WACnBe,EAAGf,SAAWgB,EACdD,EAAGd,YAAca,EAAGb,YAExB,GACF,GACF,IAEOtZ,CACT,CA1CSsa,CAAiBvhB,EACtBO,GAAYsgB,EACZV,GAAU,SAAStf,GAAK,OAAOb,EAAEe,SAASF,EAAI,EAClD,EANA,IAAIggB,EAAsBhhB,EAAE2H,SAAS,E,iBCJrCpI,EAAOC,QAAU,CACfmiB,WAAY,EAAQ,MACpB1B,SAAU,EAAQ,MAClB2B,YAAa,EAAQ,MACrBC,WAAY,EAAQ,MACpBC,cAAe,EAAQ,MACvBC,UAAW,EAAQ,MACnBpM,UAAW,EAAQ,MACnB2G,SAAU,EAAQ,IAClB0F,KAAM,EAAQ,MACdf,OAAQ,EAAQ,MAChBgB,QAAS,EAAQ,M,iBCXnB,IAAIA,EAAU,EAAQ,MAEtB1iB,EAAOC,QAEP,SAAmBW,GACjB,IACE8hB,EAAQ9hB,EACV,CAAE,MAAOI,GACP,GAAIA,aAAa0hB,EAAQC,eACvB,OAAO,EAET,MAAM3hB,CACR,CACA,OAAO,CACT,C,iBCdA,IAAIQ,EAAM,EAAQ,MAElBxB,EAAOC,QAEP,SAAmBW,EAAGkQ,GACpB,OAAOtP,EAAIZ,EAAGkQ,EAAI,OACpB,C,eCNA,IAAItP,EAAM,EAAQ,MAElBxB,EAAOC,QAEP,SAAkBW,EAAGkQ,GACnB,OAAOtP,EAAIZ,EAAGkQ,EAAI,MACpB,C,iBCNA,IAAIrQ,EAAI,EAAQ,KACZmF,EAAQ,EAAQ,MAChBkb,EAAgB,EAAQ,MAE5B9gB,EAAOC,QAEP,SAAcW,EAAG+f,GACf,IAGIlf,EAHA0P,EAAS,IAAIvL,EACbgd,EAAU,CAAC,EACX5B,EAAK,IAAIF,EAGb,SAASG,EAAgBhgB,GACvB,IAAIW,EAAIX,EAAKQ,IAAMA,EAAIR,EAAKW,EAAIX,EAAKQ,EACjCohB,EAAM7B,EAAG8B,SAASlhB,GACtB,QAAY0G,IAARua,EAAmB,CACrB,IAAI1b,EAAawZ,EAAW1f,GACxBkG,EAAa0b,IACfD,EAAQhhB,GAAKH,EACbuf,EAAGI,SAASxf,EAAGuF,GAEnB,CACF,CAEA,GAAsB,IAAlBvG,EAAEgG,YACJ,OAAOuK,EAGT1Q,EAAEiO,KAAK9N,EAAEW,SAAS,SAASE,GACzBuf,EAAGK,IAAI5f,EAAG+K,OAAOC,mBACjB0E,EAAO/K,QAAQ3E,EACjB,IAGAuf,EAAGI,SAASxgB,EAAEW,QAAQ,GAAI,GAG1B,IADA,IAAIwhB,GAAO,EACJ/B,EAAG1E,OAAS,GAAG,CAEpB,GADA7a,EAAIuf,EAAGM,YACH7gB,EAAEiB,IAAIkhB,EAASnhB,GACjB0P,EAAO/O,QAAQX,EAAGmhB,EAAQnhB,QACrB,IAAIshB,EACT,MAAM,IAAIrD,MAAM,iCAAmC9e,GAEnDmiB,GAAO,CACT,CAEAniB,EAAEob,UAAUva,GAAGH,QAAQ2f,EACzB,CAEA,OAAO9P,CACT,C,iBCnDA,IAAI1Q,EAAI,EAAQ,KAEhBT,EAAOC,QAEP,SAAgBW,GACd,IAAI0R,EAAQ,EACRlR,EAAQ,GACRC,EAAU,CAAC,EACXwG,EAAU,GAEd,SAASrG,EAAIC,GACX,IAAIwD,EAAQ5D,EAAQI,GAAK,CACvBuhB,SAAS,EACTC,QAAS3Q,EACTA,MAAOA,KAaT,GAXAlR,EAAMS,KAAKJ,GAEXb,EAAEgQ,WAAWnP,GAAGH,SAAQ,SAASM,GAC1BnB,EAAEiB,IAAIL,EAASO,GAGTP,EAAQO,GAAGohB,UACpB/d,EAAMge,QAAU7b,KAAK+F,IAAIlI,EAAMge,QAAS5hB,EAAQO,GAAG0Q,SAHnD9Q,EAAII,GACJqD,EAAMge,QAAU7b,KAAK+F,IAAIlI,EAAMge,QAAS5hB,EAAQO,GAAGqhB,SAIvD,IAEIhe,EAAMge,UAAYhe,EAAMqN,MAAO,CACjC,IACI1Q,EADAwe,EAAO,GAEX,GACExe,EAAIR,EAAMsT,MACVrT,EAAQO,GAAGohB,SAAU,EACrB5C,EAAKve,KAAKD,SACHH,IAAMG,GACfiG,EAAQhG,KAAKue,EACf,CACF,CAQA,OANAxf,EAAEW,QAAQD,SAAQ,SAASG,GACpBhB,EAAEiB,IAAIL,EAASI,IAClBD,EAAIC,EAER,IAEOoG,CACT,C,iBC9CA,IAAIpH,EAAI,EAAQ,KAKhB,SAASiiB,EAAQ9hB,GACf,IAAIS,EAAU,CAAC,EACXD,EAAQ,CAAC,EACTyG,EAAU,GAkBd,GAFApH,EAAEiO,KAAK9N,EAAEmH,SAdT,SAASmb,EAAM5f,GACb,GAAI7C,EAAEiB,IAAIN,EAAOkC,GACf,MAAM,IAAIqf,EAGPliB,EAAEiB,IAAIL,EAASiC,KAClBlC,EAAMkC,IAAQ,EACdjC,EAAQiC,IAAQ,EAChB7C,EAAEiO,KAAK9N,EAAEyU,aAAa/R,GAAO4f,UACtB9hB,EAAMkC,GACbuE,EAAQhG,KAAKyB,GAEjB,IAII7C,EAAE6b,KAAKjb,KAAaT,EAAEgG,YACxB,MAAM,IAAI+b,EAGZ,OAAO9a,CACT,CAEA,SAAS8a,IAAkB,CA/B3B3iB,EAAOC,QAAUyiB,EACjBA,EAAQC,eAAiBA,EA+BzBA,EAAevd,UAAY,IAAIsa,K,iBClC/B,IAAIjf,EAAI,EAAQ,KAWhB,SAASqgB,IACPhc,KAAKqe,KAAO,GACZre,KAAKse,YAAc,CAAC,CACtB,CAZApjB,EAAOC,QAAU6gB,EAiBjBA,EAAc1b,UAAUkX,KAAO,WAC7B,OAAOxX,KAAKqe,KAAK5f,MACnB,EAKAud,EAAc1b,UAAUie,KAAO,WAC7B,OAAOve,KAAKqe,KAAK3b,KAAI,SAAStD,GAAK,OAAOA,EAAEof,GAAK,GACnD,EAKAxC,EAAc1b,UAAU1D,IAAM,SAAS4hB,GACrC,OAAO7iB,EAAEiB,IAAIoD,KAAKse,YAAaE,EACjC,EAQAxC,EAAc1b,UAAU0d,SAAW,SAASQ,GAC1C,IAAIhR,EAAQxN,KAAKse,YAAYE,GAC7B,QAAchb,IAAVgK,EACF,OAAOxN,KAAKqe,KAAK7Q,GAAOwQ,QAE5B,EAMAhC,EAAc1b,UAAU+H,IAAM,WAC5B,GAAoB,IAAhBrI,KAAKwX,OACP,MAAM,IAAIoD,MAAM,mBAElB,OAAO5a,KAAKqe,KAAK,GAAGG,GACtB,EAUAxC,EAAc1b,UAAUic,IAAM,SAASiC,EAAKR,GAC1C,IAAIS,EAAaze,KAAKse,YAEtB,GADAE,EAAM9B,OAAO8B,IACR7iB,EAAEiB,IAAI6hB,EAAYD,GAAM,CAC3B,IAAIE,EAAM1e,KAAKqe,KACX7Q,EAAQkR,EAAIjgB,OAIhB,OAHAggB,EAAWD,GAAOhR,EAClBkR,EAAI3hB,KAAK,CAACyhB,IAAKA,EAAKR,SAAUA,IAC9Bhe,KAAK2e,UAAUnR,IACR,CACT,CACA,OAAO,CACT,EAKAwO,EAAc1b,UAAUkc,UAAY,WAClCxc,KAAK4e,MAAM,EAAG5e,KAAKqe,KAAK5f,OAAS,GACjC,IAAI4J,EAAMrI,KAAKqe,KAAKzO,MAGpB,cAFO5P,KAAKse,YAAYjW,EAAImW,KAC5Bxe,KAAK6e,SAAS,GACPxW,EAAImW,GACb,EASAxC,EAAc1b,UAAUgc,SAAW,SAASkC,EAAKR,GAC/C,IAAIxQ,EAAQxN,KAAKse,YAAYE,GAC7B,GAAIR,EAAWhe,KAAKqe,KAAK7Q,GAAOwQ,SAC9B,MAAM,IAAIpD,MAAM,uDACF4D,EAAM,SAAWxe,KAAKqe,KAAK7Q,GAAOwQ,SAAW,SAAWA,GAExEhe,KAAKqe,KAAK7Q,GAAOwQ,SAAWA,EAC5Bhe,KAAK2e,UAAUnR,EACjB,EAEAwO,EAAc1b,UAAUue,SAAW,SAASrd,GAC1C,IAAIkd,EAAM1e,KAAKqe,KACXlX,EAAI,EAAI3F,EACR6F,EAAIF,EAAI,EACR2X,EAAUtd,EACV2F,EAAIuX,EAAIjgB,SACVqgB,EAAUJ,EAAIvX,GAAG6W,SAAWU,EAAII,GAASd,SAAW7W,EAAI2X,EACpDzX,EAAIqX,EAAIjgB,SACVqgB,EAAUJ,EAAIrX,GAAG2W,SAAWU,EAAII,GAASd,SAAW3W,EAAIyX,GAEtDA,IAAYtd,IACdxB,KAAK4e,MAAMpd,EAAGsd,GACd9e,KAAK6e,SAASC,IAGpB,EAEA9C,EAAc1b,UAAUqe,UAAY,SAASnR,GAI3C,IAHA,IAEIpI,EAFAsZ,EAAM1e,KAAKqe,KACXL,EAAWU,EAAIlR,GAAOwQ,SAET,IAAVxQ,KAEDkR,EADJtZ,EAASoI,GAAS,GACFwQ,SAAWA,IAG3Bhe,KAAK4e,MAAMpR,EAAOpI,GAClBoI,EAAQpI,CAEZ,EAEA4W,EAAc1b,UAAUse,MAAQ,SAASpd,EAAGwb,GAC1C,IAAI0B,EAAM1e,KAAKqe,KACXI,EAAaze,KAAKse,YAClBS,EAAWL,EAAIld,GACfwd,EAAWN,EAAI1B,GACnB0B,EAAIld,GAAKwd,EACTN,EAAI1B,GAAK+B,EACTN,EAAWO,EAASR,KAAOhd,EAC3Bid,EAAWM,EAASP,KAAOxB,CAC7B,C,8BCrJA,IAAIrhB,EAAI,EAAQ,KAEhBT,EAAOC,QAAU2F,EAEjB,IAAIme,EAAoB,KACpBC,EAAa,KACbC,EAAiB,IAYrB,SAASre,EAAMwD,GACbtE,KAAKof,aAAczjB,EAAEiB,IAAI0H,EAAM,aAAcA,EAAKgT,SAClDtX,KAAKqf,gBAAgB1jB,EAAEiB,IAAI0H,EAAM,eAAgBA,EAAKlD,WACtDpB,KAAKsf,cAAc3jB,EAAEiB,IAAI0H,EAAM,aAAcA,EAAKnD,SAGlDnB,KAAKuf,YAAS/b,EAGdxD,KAAKwf,oBAAsB7jB,EAAE2H,cAASE,GAGtCxD,KAAKyf,oBAAsB9jB,EAAE2H,cAASE,GAGtCxD,KAAK0f,OAAS,CAAC,EAEX1f,KAAKsf,cAEPtf,KAAK2f,QAAU,CAAC,EAGhB3f,KAAK4f,UAAY,CAAC,EAClB5f,KAAK4f,UAAUV,GAAc,CAAC,GAIhClf,KAAK6f,IAAM,CAAC,EAGZ7f,KAAK8f,OAAS,CAAC,EAGf9f,KAAK+f,KAAO,CAAC,EAGb/f,KAAKggB,MAAQ,CAAC,EAGdhgB,KAAKigB,UAAY,CAAC,EAGlBjgB,KAAKkgB,YAAc,CAAC,CACtB,CA2aA,SAASC,EAAqBzd,EAAKrC,GAC7BqC,EAAIrC,GACNqC,EAAIrC,KAEJqC,EAAIrC,GAAK,CAEb,CAEA,SAAS+f,EAAuB1d,EAAKrC,KAC5BqC,EAAIrC,WAAaqC,EAAIrC,EAC9B,CAEA,SAASggB,EAAa1E,EAAY2E,EAAIC,EAAInjB,GACxC,IAAIT,EAAI,GAAK2jB,EACTxjB,EAAI,GAAKyjB,EACb,IAAK5E,GAAchf,EAAIG,EAAG,CACxB,IAAImS,EAAMtS,EACVA,EAAIG,EACJA,EAAImS,CACN,CACA,OAAOtS,EAAIwiB,EAAiBriB,EAAIqiB,GACpBxjB,EAAEqO,YAAY5M,GAAQ6hB,EAAoB7hB,EACxD,CAiBA,SAASojB,EAAY7E,EAAYhQ,GAC/B,OAAO0U,EAAa1E,EAAYhQ,EAAQhP,EAAGgP,EAAQ7O,EAAG6O,EAAQvO,KAChE,CAjdA0D,EAAMR,UAAUmgB,WAAa,EAG7B3f,EAAMR,UAAUogB,WAAa,EAK7B5f,EAAMR,UAAUqb,WAAa,WAC3B,OAAO3b,KAAKof,WACd,EAEAte,EAAMR,UAAU4Z,aAAe,WAC7B,OAAOla,KAAKqf,aACd,EAEAve,EAAMR,UAAUqgB,WAAa,WAC3B,OAAO3gB,KAAKsf,WACd,EAEAxe,EAAMR,UAAUe,SAAW,SAASpE,GAElC,OADA+C,KAAKuf,OAAStiB,EACP+C,IACT,EAEAc,EAAMR,UAAUtE,MAAQ,WACtB,OAAOgE,KAAKuf,MACd,EAKAze,EAAMR,UAAUsM,oBAAsB,SAASgU,GAK7C,OAJKjlB,EAAEklB,WAAWD,KAChBA,EAAajlB,EAAE2H,SAASsd,IAE1B5gB,KAAKwf,oBAAsBoB,EACpB5gB,IACT,EAEAc,EAAMR,UAAUwB,UAAY,WAC1B,OAAO9B,KAAKygB,UACd,EAEA3f,EAAMR,UAAU7D,MAAQ,WACtB,OAAOd,EAAE4iB,KAAKve,KAAK0f,OACrB,EAEA5e,EAAMR,UAAU0C,QAAU,WACxB,IAAI8d,EAAO9gB,KACX,OAAOrE,EAAEkO,OAAO7J,KAAKvD,SAAS,SAASE,GACrC,OAAOhB,EAAEolB,QAAQD,EAAKjB,IAAIljB,GAC5B,GACF,EAEAmE,EAAMR,UAAU2C,MAAQ,WACtB,IAAI6d,EAAO9gB,KACX,OAAOrE,EAAEkO,OAAO7J,KAAKvD,SAAS,SAASE,GACrC,OAAOhB,EAAEolB,QAAQD,EAAKf,KAAKpjB,GAC7B,GACF,EAEAmE,EAAMR,UAAU0gB,SAAW,SAAShV,EAAIgP,GACtC,IAAIiG,EAAO9H,UACP2H,EAAO9gB,KAQX,OAPArE,EAAEiO,KAAKoC,GAAI,SAASrP,GACdskB,EAAKxiB,OAAS,EAChBqiB,EAAKxf,QAAQ3E,EAAGqe,GAEhB8F,EAAKxf,QAAQ3E,EAEjB,IACOqD,IACT,EAEAc,EAAMR,UAAUgB,QAAU,SAAS3E,EAAGqe,GACpC,OAAIrf,EAAEiB,IAAIoD,KAAK0f,OAAQ/iB,IACjBwc,UAAU1a,OAAS,IACrBuB,KAAK0f,OAAO/iB,GAAKqe,GAEZhb,OAGTA,KAAK0f,OAAO/iB,GAAKwc,UAAU1a,OAAS,EAAIuc,EAAQhb,KAAKwf,oBAAoB7iB,GACrEqD,KAAKsf,cACPtf,KAAK2f,QAAQhjB,GAAKuiB,EAClBlf,KAAK4f,UAAUjjB,GAAK,CAAC,EACrBqD,KAAK4f,UAAUV,GAAYviB,IAAK,GAElCqD,KAAK6f,IAAIljB,GAAK,CAAC,EACfqD,KAAK8f,OAAOnjB,GAAK,CAAC,EAClBqD,KAAK+f,KAAKpjB,GAAK,CAAC,EAChBqD,KAAKggB,MAAMrjB,GAAK,CAAC,IACfqD,KAAKygB,WACAzgB,KACT,EAEAc,EAAMR,UAAU9B,KAAO,SAAS7B,GAC9B,OAAOqD,KAAK0f,OAAO/iB,EACrB,EAEAmE,EAAMR,UAAUoM,QAAU,SAAS/P,GACjC,OAAOhB,EAAEiB,IAAIoD,KAAK0f,OAAQ/iB,EAC5B,EAEAmE,EAAMR,UAAU4C,WAAc,SAASvG,GACrC,IAAImkB,EAAO9gB,KACX,GAAIrE,EAAEiB,IAAIoD,KAAK0f,OAAQ/iB,GAAI,CACzB,IAAIO,EAAa,SAAShB,GAAK4kB,EAAK5jB,WAAW4jB,EAAKb,UAAU/jB,GAAK,SAC5D8D,KAAK0f,OAAO/iB,GACfqD,KAAKsf,cACPtf,KAAKkhB,4BAA4BvkB,UAC1BqD,KAAK2f,QAAQhjB,GACpBhB,EAAEiO,KAAK5J,KAAKzB,SAAS5B,IAAI,SAASgO,GAChCmW,EAAKxiB,UAAUqM,EACjB,WACO3K,KAAK4f,UAAUjjB,IAExBhB,EAAEiO,KAAKjO,EAAE4iB,KAAKve,KAAK6f,IAAIljB,IAAKO,UACrB8C,KAAK6f,IAAIljB,UACTqD,KAAK8f,OAAOnjB,GACnBhB,EAAEiO,KAAKjO,EAAE4iB,KAAKve,KAAK+f,KAAKpjB,IAAKO,UACtB8C,KAAK+f,KAAKpjB,UACVqD,KAAKggB,MAAMrjB,KAChBqD,KAAKygB,UACT,CACA,OAAOzgB,IACT,EAEAc,EAAMR,UAAUhC,UAAY,SAAS3B,EAAGyI,GACtC,IAAKpF,KAAKsf,YACR,MAAM,IAAI1E,MAAM,6CAGlB,GAAIjf,EAAEqO,YAAY5E,GAChBA,EAAS8Z,MACJ,CAGL,IAAK,IAAIiC,EADT/b,GAAU,IAEPzJ,EAAEqO,YAAYmX,GACfA,EAAWnhB,KAAKoF,OAAO+b,GACvB,GAAIA,IAAaxkB,EACf,MAAM,IAAIie,MAAM,WAAaxV,EAAQ,iBAAmBzI,EACxC,yBAIpBqD,KAAKsB,QAAQ8D,EACf,CAMA,OAJApF,KAAKsB,QAAQ3E,GACbqD,KAAKkhB,4BAA4BvkB,GACjCqD,KAAK2f,QAAQhjB,GAAKyI,EAClBpF,KAAK4f,UAAUxa,GAAQzI,IAAK,EACrBqD,IACT,EAEAc,EAAMR,UAAU4gB,4BAA8B,SAASvkB,UAC9CqD,KAAK4f,UAAU5f,KAAK2f,QAAQhjB,IAAIA,EACzC,EAEAmE,EAAMR,UAAU8E,OAAS,SAASzI,GAChC,GAAIqD,KAAKsf,YAAa,CACpB,IAAIla,EAASpF,KAAK2f,QAAQhjB,GAC1B,GAAIyI,IAAW8Z,EACb,OAAO9Z,CAEX,CACF,EAEAtE,EAAMR,UAAU/B,SAAW,SAAS5B,GAKlC,GAJIhB,EAAEqO,YAAYrN,KAChBA,EAAIuiB,GAGFlf,KAAKsf,YAAa,CACpB,IAAI/gB,EAAWyB,KAAK4f,UAAUjjB,GAC9B,GAAI4B,EACF,OAAO5C,EAAE4iB,KAAKhgB,EAElB,KAAO,IAAI5B,IAAMuiB,EACf,OAAOlf,KAAKvD,QACP,GAAIuD,KAAK0M,QAAQ/P,GACtB,MAAO,EACT,CACF,EAEAmE,EAAMR,UAAUiQ,aAAe,SAAS5T,GACtC,IAAIykB,EAASphB,KAAK8f,OAAOnjB,GACzB,GAAIykB,EACF,OAAOzlB,EAAE4iB,KAAK6C,EAElB,EAEAtgB,EAAMR,UAAUwL,WAAa,SAASnP,GACpC,IAAI0kB,EAAQrhB,KAAKggB,MAAMrjB,GACvB,GAAI0kB,EACF,OAAO1lB,EAAE4iB,KAAK8C,EAElB,EAEAvgB,EAAMR,UAAUgZ,UAAY,SAAS3c,GACnC,IAAI4d,EAAQva,KAAKuQ,aAAa5T,GAC9B,GAAI4d,EACF,OAAO5e,EAAE2lB,MAAM/G,EAAOva,KAAK8L,WAAWnP,GAE1C,EAEAmE,EAAMR,UAAUihB,OAAS,SAAU5kB,GAOjC,OAA4B,KALxBqD,KAAK2b,aACK3b,KAAK8L,WAAWnP,GAEhBqD,KAAKsZ,UAAU3c,IAEZ8B,MACnB,EAEAqC,EAAMR,UAAUkhB,YAAc,SAAS3X,GACrC,IAAI4X,EAAO,IAAIzhB,KAAK0hB,YAAY,CAC9BpK,SAAUtX,KAAKof,YACfhe,WAAYpB,KAAKqf,cACjBle,SAAUnB,KAAKsf,cAGjBmC,EAAKpgB,SAASrB,KAAKhE,SAEnB,IAAI8kB,EAAO9gB,KACXrE,EAAEiO,KAAK5J,KAAK0f,QAAQ,SAAS1E,EAAOre,GAC9BkN,EAAOlN,IACT8kB,EAAKngB,QAAQ3E,EAAGqe,EAEpB,IAEArf,EAAEiO,KAAK5J,KAAKigB,WAAW,SAAS/jB,GAC1BulB,EAAK/U,QAAQxQ,EAAES,IAAM8kB,EAAK/U,QAAQxQ,EAAEY,IACtC2kB,EAAKnkB,QAAQpB,EAAG4kB,EAAK3kB,KAAKD,GAE9B,IAEA,IAAI4hB,EAAU,CAAC,EACf,SAAS6D,EAAWhlB,GAClB,IAAIyI,EAAS0b,EAAK1b,OAAOzI,GACzB,YAAe6G,IAAX4B,GAAwBqc,EAAK/U,QAAQtH,IACvC0Y,EAAQnhB,GAAKyI,EACNA,GACEA,KAAU0Y,EACZA,EAAQ1Y,GAERuc,EAAWvc,EAEtB,CAQA,OANIpF,KAAKsf,aACP3jB,EAAEiO,KAAK6X,EAAKhlB,SAAS,SAASE,GAC5B8kB,EAAKnjB,UAAU3B,EAAGglB,EAAWhlB,GAC/B,IAGK8kB,CACT,EAIA3gB,EAAMR,UAAUshB,oBAAsB,SAAShB,GAK7C,OAJKjlB,EAAEklB,WAAWD,KAChBA,EAAajlB,EAAE2H,SAASsd,IAE1B5gB,KAAKyf,oBAAsBmB,EACpB5gB,IACT,EAEAc,EAAMR,UAAUuhB,UAAY,WAC1B,OAAO7hB,KAAK0gB,UACd,EAEA5f,EAAMR,UAAU7C,MAAQ,WACtB,OAAO9B,EAAEyO,OAAOpK,KAAKigB,UACvB,EAEAnf,EAAMR,UAAUwhB,QAAU,SAAS9V,EAAIgP,GACrC,IAAI8F,EAAO9gB,KACPihB,EAAO9H,UASX,OARAxd,EAAE+F,OAAOsK,GAAI,SAASrP,EAAGG,GAMvB,OALImkB,EAAKxiB,OAAS,EAChBqiB,EAAKxjB,QAAQX,EAAGG,EAAGke,GAEnB8F,EAAKxjB,QAAQX,EAAGG,GAEXA,CACT,IACOkD,IACT,EAMAc,EAAMR,UAAUhD,QAAU,WACxB,IAAIX,EAAGG,EAAGM,EAAM4d,EACZ+G,GAAiB,EACjBC,EAAO7I,UAAU,GAED,iBAAT6I,GAA8B,OAATA,GAAiB,MAAOA,GACtDrlB,EAAIqlB,EAAKrlB,EACTG,EAAIklB,EAAKllB,EACTM,EAAO4kB,EAAK5kB,KACa,IAArB+b,UAAU1a,SACZuc,EAAQ7B,UAAU,GAClB4I,GAAiB,KAGnBplB,EAAIqlB,EACJllB,EAAIqc,UAAU,GACd/b,EAAO+b,UAAU,GACbA,UAAU1a,OAAS,IACrBuc,EAAQ7B,UAAU,GAClB4I,GAAiB,IAIrBplB,EAAI,GAAKA,EACTG,EAAI,GAAKA,EACJnB,EAAEqO,YAAY5M,KACjBA,EAAO,GAAKA,GAGd,IAAIlB,EAAImkB,EAAargB,KAAKof,YAAaziB,EAAGG,EAAGM,GAC7C,GAAIzB,EAAEiB,IAAIoD,KAAKkgB,YAAahkB,GAI1B,OAHI6lB,IACF/hB,KAAKkgB,YAAYhkB,GAAK8e,GAEjBhb,KAGT,IAAKrE,EAAEqO,YAAY5M,KAAU4C,KAAKqf,cAChC,MAAM,IAAIzE,MAAM,qDAKlB5a,KAAKsB,QAAQ3E,GACbqD,KAAKsB,QAAQxE,GAEbkD,KAAKkgB,YAAYhkB,GAAK6lB,EAAiB/G,EAAQhb,KAAKyf,oBAAoB9iB,EAAGG,EAAGM,GAE9E,IAAIuO,EAqGN,SAAuBgQ,EAAY2E,EAAIC,EAAInjB,GACzC,IAAIT,EAAI,GAAK2jB,EACTxjB,EAAI,GAAKyjB,EACb,IAAK5E,GAAchf,EAAIG,EAAG,CACxB,IAAImS,EAAMtS,EACVA,EAAIG,EACJA,EAAImS,CACN,CACA,IAAItD,EAAW,CAAEhP,EAAGA,EAAGG,EAAGA,GAI1B,OAHIM,IACFuO,EAAQvO,KAAOA,GAEVuO,CACT,CAlHgBsW,CAAcjiB,KAAKof,YAAaziB,EAAGG,EAAGM,GAYpD,OAVAT,EAAIgP,EAAQhP,EACZG,EAAI6O,EAAQ7O,EAEZolB,OAAOC,OAAOxW,GACd3L,KAAKigB,UAAU/jB,GAAKyP,EACpBwU,EAAqBngB,KAAK8f,OAAOhjB,GAAIH,GACrCwjB,EAAqBngB,KAAKggB,MAAMrjB,GAAIG,GACpCkD,KAAK6f,IAAI/iB,GAAGZ,GAAKyP,EACjB3L,KAAK+f,KAAKpjB,GAAGT,GAAKyP,EAClB3L,KAAK0gB,aACE1gB,IACT,EAEAc,EAAMR,UAAUnE,KAAO,SAASQ,EAAGG,EAAGM,GACpC,IAAIlB,EAA0B,IAArBid,UAAU1a,OACf+hB,EAAYxgB,KAAKof,YAAajG,UAAU,IACxCkH,EAAargB,KAAKof,YAAaziB,EAAGG,EAAGM,GACzC,OAAO4C,KAAKkgB,YAAYhkB,EAC1B,EAEA4E,EAAMR,UAAU2Y,QAAU,SAAStc,EAAGG,EAAGM,GACvC,IAAIlB,EAA0B,IAArBid,UAAU1a,OACf+hB,EAAYxgB,KAAKof,YAAajG,UAAU,IACxCkH,EAAargB,KAAKof,YAAaziB,EAAGG,EAAGM,GACzC,OAAOzB,EAAEiB,IAAIoD,KAAKkgB,YAAahkB,EACjC,EAEA4E,EAAMR,UAAUpD,WAAa,SAASP,EAAGG,EAAGM,GAC1C,IAAIlB,EAA0B,IAArBid,UAAU1a,OACf+hB,EAAYxgB,KAAKof,YAAajG,UAAU,IACxCkH,EAAargB,KAAKof,YAAaziB,EAAGG,EAAGM,GACrCjB,EAAO6D,KAAKigB,UAAU/jB,GAY1B,OAXIC,IACFQ,EAAIR,EAAKQ,EACTG,EAAIX,EAAKW,SACFkD,KAAKkgB,YAAYhkB,UACjB8D,KAAKigB,UAAU/jB,GACtBkkB,EAAuBpgB,KAAK8f,OAAOhjB,GAAIH,GACvCyjB,EAAuBpgB,KAAKggB,MAAMrjB,GAAIG,UAC/BkD,KAAK6f,IAAI/iB,GAAGZ,UACZ8D,KAAK+f,KAAKpjB,GAAGT,GACpB8D,KAAK0gB,cAEA1gB,IACT,EAEAc,EAAMR,UAAUmD,QAAU,SAAS9G,EAAGgF,GACpC,IAAIyK,EAAMpM,KAAK6f,IAAIljB,GACnB,GAAIyP,EAAK,CACP,IAAI3O,EAAQ9B,EAAEyO,OAAOgC,GACrB,OAAKzK,EAGEhG,EAAEkO,OAAOpM,GAAO,SAAStB,GAAQ,OAAOA,EAAKQ,IAAMgF,CAAG,IAFpDlE,CAGX,CACF,EAEAqD,EAAMR,UAAUzD,SAAW,SAASF,EAAGG,GACrC,IAAIslB,EAAOpiB,KAAK+f,KAAKpjB,GACrB,GAAIylB,EAAM,CACR,IAAI3kB,EAAQ9B,EAAEyO,OAAOgY,GACrB,OAAKtlB,EAGEnB,EAAEkO,OAAOpM,GAAO,SAAStB,GAAQ,OAAOA,EAAKW,IAAMA,CAAG,IAFpDW,CAGX,CACF,EAEAqD,EAAMR,UAAU4W,UAAY,SAASva,EAAGG,GACtC,IAAI2G,EAAUzD,KAAKyD,QAAQ9G,EAAGG,GAC9B,GAAI2G,EACF,OAAOA,EAAQN,OAAOnD,KAAKnD,SAASF,EAAGG,GAE3C,C,gBCveA5B,EAAOC,QAAU,CACf2F,MAAO,EAAQ,MACfpF,QAAS,EAAQ,M,iBCHnB,IAAIC,EAAI,EAAQ,KACZmF,EAAQ,EAAQ,MAuBpB,SAASuhB,EAAWvmB,GAClB,OAAOH,EAAE+G,IAAI5G,EAAEW,SAAS,SAASE,GAC/B,IAAI2lB,EAAYxmB,EAAE0C,KAAK7B,GACnByI,EAAStJ,EAAEsJ,OAAOzI,GAClB6B,EAAO,CAAE7B,EAAGA,GAOhB,OANKhB,EAAEqO,YAAYsY,KACjB9jB,EAAKwc,MAAQsH,GAEV3mB,EAAEqO,YAAY5E,KACjB5G,EAAK4G,OAASA,GAET5G,CACT,GACF,CAEA,SAAS+jB,EAAWzmB,GAClB,OAAOH,EAAE+G,IAAI5G,EAAE2B,SAAS,SAASvB,GAC/B,IAAIsmB,EAAY1mB,EAAEK,KAAKD,GACnBC,EAAO,CAAEQ,EAAGT,EAAES,EAAGG,EAAGZ,EAAEY,GAO1B,OANKnB,EAAEqO,YAAY9N,EAAEkB,QACnBjB,EAAKiB,KAAOlB,EAAEkB,MAEXzB,EAAEqO,YAAYwY,KACjBrmB,EAAK6e,MAAQwH,GAERrmB,CACT,GACF,CAhDAjB,EAAOC,QAAU,CACfsnB,MAIF,SAAe3mB,GACb,IAAIsf,EAAO,CACTsH,QAAS,CACPpL,SAAUxb,EAAE6f,aACZva,WAAYtF,EAAEoe,eACd/Y,SAAUrF,EAAE6kB,cAEdlkB,MAAO4lB,EAAWvmB,GAClB2B,MAAO8kB,EAAWzmB,IAKpB,OAHKH,EAAEqO,YAAYlO,EAAEE,WACnBof,EAAKJ,MAAQrf,EAAEgnB,MAAM7mB,EAAEE,UAElBof,CACT,EAjBEwH,KAgDF,SAAcxH,GACZ,IAAItf,EAAI,IAAIgF,EAAMsa,EAAKsH,SAASrhB,SAAS+Z,EAAKJ,OAU9C,OATArf,EAAEiO,KAAKwR,EAAK3e,OAAO,SAAS0D,GAC1BrE,EAAEwF,QAAQnB,EAAMxD,EAAGwD,EAAM6a,OACrB7a,EAAMiF,QACRtJ,EAAEwC,UAAU6B,EAAMxD,EAAGwD,EAAMiF,OAE/B,IACAzJ,EAAEiO,KAAKwR,EAAK3d,OAAO,SAAS0C,GAC1BrE,EAAEwB,QAAQ,CAAEX,EAAGwD,EAAMxD,EAAGG,EAAGqD,EAAMrD,EAAGM,KAAM+C,EAAM/C,MAAQ+C,EAAM6a,MAChE,IACOlf,CACT,E,gBC/DA,IAAI4N,EAGF,IACEA,EAAS,CACPiZ,MAAO,EAAQ,MACfrf,SAAU,EAAQ,MAClBsG,KAAM,EAAQ,KACdC,OAAQ,EAAQ,MAChBjN,IAAM,EAAQ,MACd8e,QAAS,EAAQ,MACjBqF,QAAS,EAAQ,MACjBF,WAAY,EAAQ,MACpB7W,YAAa,EAAQ,MACrBuU,KAAM,EAAQ,MACd7b,IAAK,EAAQ,MACbhB,OAAQ,EAAQ,MAChB8V,KAAM,EAAQ,MACduE,UAAW,EAAQ,MACnBuF,MAAO,EAAQ,MACflX,OAAQ,EAAQ,MAEpB,CAAE,MAAOlO,GAET,CAGGwN,IACHA,EAAS7H,OAAOlG,GAGlBT,EAAOC,QAAUuO,C,WCjCjBxO,EAAOC,QAAU,O,+DCCjB,MAAMsF,EAAWyhB,OAAO5hB,UAAUG,SAO3B,SAASoiB,EAAW7H,GACvB,MAAM8H,EAAMriB,EAASsiB,KAAK/H,GAC1B,OAAO8H,EAAIE,SAAS,YAAcF,EAAIG,SAAS,MACnD,C,iBCXA,IAIIC,EAJY,EAAQ,KAITC,CAHJ,EAAQ,KAGY,YAE/BjoB,EAAOC,QAAU+nB,C,iBCNjB,IAAIE,EAAY,EAAQ,MACpBC,EAAa,EAAQ,MACrBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAStB,SAASC,EAAK1U,GACZ,IAAIvB,GAAS,EACT/O,EAAoB,MAAXsQ,EAAkB,EAAIA,EAAQtQ,OAG3C,IADAuB,KAAK0jB,UACIlW,EAAQ/O,GAAQ,CACvB,IAAI0B,EAAQ4O,EAAQvB,GACpBxN,KAAK2jB,IAAIxjB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGAsjB,EAAKnjB,UAAUojB,MAAQN,EACvBK,EAAKnjB,UAAkB,OAAI+iB,EAC3BI,EAAKnjB,UAAUsjB,IAAMN,EACrBG,EAAKnjB,UAAU1D,IAAM2mB,EACrBE,EAAKnjB,UAAUqjB,IAAMH,EAErBtoB,EAAOC,QAAUsoB,C,iBC/BjB,IAAII,EAAiB,EAAQ,MACzBC,EAAkB,EAAQ,MAC1BC,EAAe,EAAQ,MACvBC,EAAe,EAAQ,MACvBC,EAAe,EAAQ,KAS3B,SAASC,EAAUnV,GACjB,IAAIvB,GAAS,EACT/O,EAAoB,MAAXsQ,EAAkB,EAAIA,EAAQtQ,OAG3C,IADAuB,KAAK0jB,UACIlW,EAAQ/O,GAAQ,CACvB,IAAI0B,EAAQ4O,EAAQvB,GACpBxN,KAAK2jB,IAAIxjB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGA+jB,EAAU5jB,UAAUojB,MAAQG,EAC5BK,EAAU5jB,UAAkB,OAAIwjB,EAChCI,EAAU5jB,UAAUsjB,IAAMG,EAC1BG,EAAU5jB,UAAU1D,IAAMonB,EAC1BE,EAAU5jB,UAAUqjB,IAAMM,EAE1B/oB,EAAOC,QAAU+oB,C,iBC/BjB,IAIIC,EAJY,EAAQ,KAIdhB,CAHC,EAAQ,KAGO,OAE1BjoB,EAAOC,QAAUgpB,C,iBCNjB,IAAIC,EAAgB,EAAQ,MACxBC,EAAiB,EAAQ,MACzBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,KACtBC,EAAc,EAAQ,MAS1B,SAASC,EAAS1V,GAChB,IAAIvB,GAAS,EACT/O,EAAoB,MAAXsQ,EAAkB,EAAIA,EAAQtQ,OAG3C,IADAuB,KAAK0jB,UACIlW,EAAQ/O,GAAQ,CACvB,IAAI0B,EAAQ4O,EAAQvB,GACpBxN,KAAK2jB,IAAIxjB,EAAM,GAAIA,EAAM,GAC3B,CACF,CAGAskB,EAASnkB,UAAUojB,MAAQU,EAC3BK,EAASnkB,UAAkB,OAAI+jB,EAC/BI,EAASnkB,UAAUsjB,IAAMU,EACzBG,EAASnkB,UAAU1D,IAAM2nB,EACzBE,EAASnkB,UAAUqjB,IAAMa,EAEzBtpB,EAAOC,QAAUspB,C,iBC/BjB,IAIIC,EAJY,EAAQ,KAIVvB,CAHH,EAAQ,KAGW,WAE9BjoB,EAAOC,QAAUupB,C,iBCNjB,IAIIC,EAJY,EAAQ,KAIdxB,CAHC,EAAQ,KAGO,OAE1BjoB,EAAOC,QAAUwpB,C,iBCNjB,IAAIF,EAAW,EAAQ,MACnBG,EAAc,EAAQ,MACtBC,EAAc,EAAQ,MAU1B,SAASC,EAAS1a,GAChB,IAAIoD,GAAS,EACT/O,EAAmB,MAAV2L,EAAiB,EAAIA,EAAO3L,OAGzC,IADAuB,KAAK+kB,SAAW,IAAIN,IACXjX,EAAQ/O,GACfuB,KAAKuc,IAAInS,EAAOoD,GAEpB,CAGAsX,EAASxkB,UAAUic,IAAMuI,EAASxkB,UAAUvD,KAAO6nB,EACnDE,EAASxkB,UAAU1D,IAAMioB,EAEzB3pB,EAAOC,QAAU2pB,C,iBC1BjB,IAAIZ,EAAY,EAAQ,MACpBc,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MACtBC,EAAW,EAAQ,KACnBC,EAAW,EAAQ,MACnBC,EAAW,EAAQ,MASvB,SAASC,EAAMtW,GACb,IAAIuW,EAAOtlB,KAAK+kB,SAAW,IAAIb,EAAUnV,GACzC/O,KAAKwX,KAAO8N,EAAK9N,IACnB,CAGA6N,EAAM/kB,UAAUojB,MAAQsB,EACxBK,EAAM/kB,UAAkB,OAAI2kB,EAC5BI,EAAM/kB,UAAUsjB,IAAMsB,EACtBG,EAAM/kB,UAAU1D,IAAMuoB,EACtBE,EAAM/kB,UAAUqjB,IAAMyB,EAEtBlqB,EAAOC,QAAUkqB,C,iBC1BjB,IAGIE,EAHO,EAAQ,KAGDA,OAElBrqB,EAAOC,QAAUoqB,C,iBCLjB,IAGIC,EAHO,EAAQ,KAGGA,WAEtBtqB,EAAOC,QAAUqqB,C,iBCLjB,IAIIC,EAJY,EAAQ,KAIVtC,CAHH,EAAQ,KAGW,WAE9BjoB,EAAOC,QAAUsqB,C,WCcjBvqB,EAAOC,QAVP,SAAeuqB,EAAMC,EAAS1E,GAC5B,OAAQA,EAAKxiB,QACX,KAAK,EAAG,OAAOinB,EAAK3C,KAAK4C,GACzB,KAAK,EAAG,OAAOD,EAAK3C,KAAK4C,EAAS1E,EAAK,IACvC,KAAK,EAAG,OAAOyE,EAAK3C,KAAK4C,EAAS1E,EAAK,GAAIA,EAAK,IAChD,KAAK,EAAG,OAAOyE,EAAK3C,KAAK4C,EAAS1E,EAAK,GAAIA,EAAK,GAAIA,EAAK,IAE3D,OAAOyE,EAAKE,MAAMD,EAAS1E,EAC7B,C,WCGA/lB,EAAOC,QAZP,SAAmB0qB,EAAOC,GAIxB,IAHA,IAAItY,GAAS,EACT/O,EAAkB,MAATonB,EAAgB,EAAIA,EAAMpnB,SAE9B+O,EAAQ/O,IAC8B,IAAzCqnB,EAASD,EAAMrY,GAAQA,EAAOqY,KAIpC,OAAOA,CACT,C,WCKA3qB,EAAOC,QAfP,SAAqB0qB,EAAOE,GAM1B,IALA,IAAIvY,GAAS,EACT/O,EAAkB,MAATonB,EAAgB,EAAIA,EAAMpnB,OACnCunB,EAAW,EACX3Z,EAAS,KAEJmB,EAAQ/O,GAAQ,CACvB,IAAIuc,EAAQ6K,EAAMrY,GACduY,EAAU/K,EAAOxN,EAAOqY,KAC1BxZ,EAAO2Z,KAAchL,EAEzB,CACA,OAAO3O,CACT,C,gBCtBA,IAAI4Z,EAAc,EAAQ,MAgB1B/qB,EAAOC,QALP,SAAuB0qB,EAAO7K,GAE5B,QADsB,MAAT6K,IAAoBA,EAAMpnB,SACpBwnB,EAAYJ,EAAO7K,EAAO,IAAM,CACrD,C,WCOA9f,EAAOC,QAZP,SAA2B0qB,EAAO7K,EAAOkL,GAIvC,IAHA,IAAI1Y,GAAS,EACT/O,EAAkB,MAATonB,EAAgB,EAAIA,EAAMpnB,SAE9B+O,EAAQ/O,GACf,GAAIynB,EAAWlL,EAAO6K,EAAMrY,IAC1B,OAAO,EAGX,OAAO,CACT,C,iBCnBA,IAAI2Y,EAAY,EAAQ,MACpBC,EAAc,EAAQ,IACtB1K,EAAU,EAAQ,MAClB2K,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAe,EAAQ,MAMvBC,EAHctE,OAAO5hB,UAGQkmB,eAqCjCtrB,EAAOC,QA3BP,SAAuB6f,EAAOyL,GAC5B,IAAIC,EAAQhL,EAAQV,GAChB2L,GAASD,GAASN,EAAYpL,GAC9B4L,GAAUF,IAAUC,GAASN,EAASrL,GACtC6L,GAAUH,IAAUC,IAAUC,GAAUL,EAAavL,GACrD8L,EAAcJ,GAASC,GAASC,GAAUC,EAC1Cxa,EAASya,EAAcX,EAAUnL,EAAMvc,OAAQie,QAAU,GACzDje,EAAS4N,EAAO5N,OAEpB,IAAK,IAAI+f,KAAOxD,GACTyL,IAAaD,EAAezD,KAAK/H,EAAOwD,IACvCsI,IAEQ,UAAPtI,GAECoI,IAAkB,UAAPpI,GAA0B,UAAPA,IAE9BqI,IAAkB,UAAPrI,GAA0B,cAAPA,GAA8B,cAAPA,IAEtD8H,EAAQ9H,EAAK/f,KAElB4N,EAAOtP,KAAKyhB,GAGhB,OAAOnS,CACT,C,WC1BAnR,EAAOC,QAXP,SAAkB0qB,EAAOC,GAKvB,IAJA,IAAItY,GAAS,EACT/O,EAAkB,MAATonB,EAAgB,EAAIA,EAAMpnB,OACnC4N,EAASiB,MAAM7O,KAEV+O,EAAQ/O,GACf4N,EAAOmB,GAASsY,EAASD,EAAMrY,GAAQA,EAAOqY,GAEhD,OAAOxZ,CACT,C,WCCAnR,EAAOC,QAXP,SAAmB0qB,EAAOzb,GAKxB,IAJA,IAAIoD,GAAS,EACT/O,EAAS2L,EAAO3L,OAChBoc,EAASgL,EAAMpnB,SAEV+O,EAAQ/O,GACfonB,EAAMhL,EAASrN,GAASpD,EAAOoD,GAEjC,OAAOqY,CACT,C,WCQA3qB,EAAOC,QAbP,SAAqB0qB,EAAOC,EAAUiB,EAAaC,GACjD,IAAIxZ,GAAS,EACT/O,EAAkB,MAATonB,EAAgB,EAAIA,EAAMpnB,OAKvC,IAHIuoB,GAAavoB,IACfsoB,EAAclB,IAAQrY,MAEfA,EAAQ/O,GACfsoB,EAAcjB,EAASiB,EAAalB,EAAMrY,GAAQA,EAAOqY,GAE3D,OAAOkB,CACT,C,WCDA7rB,EAAOC,QAZP,SAAmB0qB,EAAOE,GAIxB,IAHA,IAAIvY,GAAS,EACT/O,EAAkB,MAATonB,EAAgB,EAAIA,EAAMpnB,SAE9B+O,EAAQ/O,GACf,GAAIsnB,EAAUF,EAAMrY,GAAQA,EAAOqY,GACjC,OAAO,EAGX,OAAO,CACT,C,gBCpBA,IASIoB,EATe,EAAQ,KASXC,CAAa,UAE7BhsB,EAAOC,QAAU8rB,C,iBCXjB,IAAIE,EAAkB,EAAQ,MAC1BC,EAAK,EAAQ,MAkBjBlsB,EAAOC,QAPP,SAA0BksB,EAAQ7I,EAAKxD,SACtBxX,IAAVwX,IAAwBoM,EAAGC,EAAO7I,GAAMxD,SAC9BxX,IAAVwX,KAAyBwD,KAAO6I,KACnCF,EAAgBE,EAAQ7I,EAAKxD,EAEjC,C,iBCjBA,IAAImM,EAAkB,EAAQ,MAC1BC,EAAK,EAAQ,MAMbZ,EAHctE,OAAO5hB,UAGQkmB,eAoBjCtrB,EAAOC,QARP,SAAqBksB,EAAQ7I,EAAKxD,GAChC,IAAIsM,EAAWD,EAAO7I,GAChBgI,EAAezD,KAAKsE,EAAQ7I,IAAQ4I,EAAGE,EAAUtM,UACxCxX,IAAVwX,GAAyBwD,KAAO6I,IACnCF,EAAgBE,EAAQ7I,EAAKxD,EAEjC,C,iBCzBA,IAAIoM,EAAK,EAAQ,MAoBjBlsB,EAAOC,QAVP,SAAsB0qB,EAAOrH,GAE3B,IADA,IAAI/f,EAASonB,EAAMpnB,OACZA,KACL,GAAI2oB,EAAGvB,EAAMpnB,GAAQ,GAAI+f,GACvB,OAAO/f,EAGX,OAAQ,CACV,C,iBClBA,IAAI8oB,EAAa,EAAQ,MACrBhJ,EAAO,EAAQ,MAenBrjB,EAAOC,QAJP,SAAoBksB,EAAQ5X,GAC1B,OAAO4X,GAAUE,EAAW9X,EAAQ8O,EAAK9O,GAAS4X,EACpD,C,iBCdA,IAAIE,EAAa,EAAQ,MACrBC,EAAS,EAAQ,MAerBtsB,EAAOC,QAJP,SAAsBksB,EAAQ5X,GAC5B,OAAO4X,GAAUE,EAAW9X,EAAQ+X,EAAO/X,GAAS4X,EACtD,C,iBCdA,IAAII,EAAiB,EAAQ,MAwB7BvsB,EAAOC,QAbP,SAAyBksB,EAAQ7I,EAAKxD,GACzB,aAAPwD,GAAsBiJ,EACxBA,EAAeJ,EAAQ7I,EAAK,CAC1B,cAAgB,EAChB,YAAc,EACd,MAASxD,EACT,UAAY,IAGdqM,EAAO7I,GAAOxD,CAElB,C,iBCtBA,IAAIqK,EAAQ,EAAQ,MAChBqC,EAAY,EAAQ,MACpBC,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAc,EAAQ,MACtBC,EAAY,EAAQ,KACpBC,EAAc,EAAQ,MACtBC,EAAgB,EAAQ,MACxBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBC,EAAS,EAAQ,MACjBC,EAAiB,EAAQ,MACzBC,EAAiB,EAAQ,MACzBC,EAAkB,EAAQ,MAC1B7M,EAAU,EAAQ,MAClB2K,EAAW,EAAQ,MACnBmC,EAAQ,EAAQ,MAChBC,EAAW,EAAQ,MACnBC,EAAQ,EAAQ,MAChBnK,EAAO,EAAQ,MACfiJ,EAAS,EAAQ,MAQjBmB,EAAU,qBAKVC,EAAU,oBAIVC,EAAY,kBAoBZC,EAAgB,CAAC,EACrBA,EAAcH,GAAWG,EA7BV,kBA8BfA,EAfqB,wBAeWA,EAdd,qBAelBA,EA9Bc,oBA8BWA,EA7BX,iBA8BdA,EAfiB,yBAeWA,EAdX,yBAejBA,EAdc,sBAcWA,EAbV,uBAcfA,EAbe,uBAaWA,EA5Bb,gBA6BbA,EA5BgB,mBA4BWA,EAAcD,GACzCC,EA3BgB,mBA2BWA,EA1Bd,gBA2BbA,EA1BgB,mBA0BWA,EAzBX,mBA0BhBA,EAhBe,uBAgBWA,EAfJ,8BAgBtBA,EAfgB,wBAeWA,EAdX,yBAcsC,EACtDA,EArCe,kBAqCWA,EAAcF,GACxCE,EA5BiB,qBA4BW,EA8F5B5tB,EAAOC,QA5EP,SAAS4tB,EAAU/N,EAAOgO,EAASC,EAAYzK,EAAK6I,EAAQ/qB,GAC1D,IAAI+P,EACA6c,EAnEgB,EAmEPF,EACTG,EAnEgB,EAmEPH,EACTI,EAnEmB,EAmEVJ,EAKb,GAHIC,IACF5c,EAASgb,EAAS4B,EAAWjO,EAAOwD,EAAK6I,EAAQ/qB,GAAS2sB,EAAWjO,SAExDxX,IAAX6I,EACF,OAAOA,EAET,IAAKoc,EAASzN,GACZ,OAAOA,EAET,IAAI0L,EAAQhL,EAAQV,GACpB,GAAI0L,GAEF,GADAra,EAASgc,EAAerN,IACnBkO,EACH,OAAOnB,EAAU/M,EAAO3O,OAErB,CACL,IAAIyW,EAAMsF,EAAOpN,GACbqO,EAASvG,GAAO8F,GA7EX,8BA6EsB9F,EAE/B,GAAIuD,EAASrL,GACX,OAAO8M,EAAY9M,EAAOkO,GAE5B,GAAIpG,GAAO+F,GAAa/F,GAAO6F,GAAYU,IAAWhC,GAEpD,GADAhb,EAAU8c,GAAUE,EAAU,CAAC,EAAId,EAAgBvN,IAC9CkO,EACH,OAAOC,EACHlB,EAAcjN,EAAO6M,EAAaxb,EAAQ2O,IAC1CgN,EAAYhN,EAAO4M,EAAWvb,EAAQ2O,QAEvC,CACL,IAAK8N,EAAchG,GACjB,OAAOuE,EAASrM,EAAQ,CAAC,EAE3B3O,EAASic,EAAetN,EAAO8H,EAAKoG,EACtC,CACF,CAEA5sB,IAAUA,EAAQ,IAAI+oB,GACtB,IAAIiE,EAAUhtB,EAAMsnB,IAAI5I,GACxB,GAAIsO,EACF,OAAOA,EAEThtB,EAAMqnB,IAAI3I,EAAO3O,GAEbqc,EAAM1N,GACRA,EAAMxe,SAAQ,SAAS+sB,GACrBld,EAAOkQ,IAAIwM,EAAUQ,EAAUP,EAASC,EAAYM,EAAUvO,EAAO1e,GACvE,IACSksB,EAAMxN,IACfA,EAAMxe,SAAQ,SAAS+sB,EAAU/K,GAC/BnS,EAAOsX,IAAInF,EAAKuK,EAAUQ,EAAUP,EAASC,EAAYzK,EAAKxD,EAAO1e,GACvE,IAGF,IAIIktB,EAAQ9C,OAAQljB,GAJL4lB,EACVD,EAAShB,EAAeD,EACxBiB,EAAS3B,EAASjJ,GAEkBvD,GASzC,OARA0M,EAAU8B,GAASxO,GAAO,SAASuO,EAAU/K,GACvCgL,IAEFD,EAAWvO,EADXwD,EAAM+K,IAIR5B,EAAYtb,EAAQmS,EAAKuK,EAAUQ,EAAUP,EAASC,EAAYzK,EAAKxD,EAAO1e,GAChF,IACO+P,CACT,C,iBCnKA,IAAIoc,EAAW,EAAQ,MAGnBgB,EAAevH,OAAOwH,OAUtBC,EAAc,WAChB,SAAStC,IAAU,CACnB,OAAO,SAASuC,GACd,IAAKnB,EAASmB,GACZ,MAAO,CAAC,EAEV,GAAIH,EACF,OAAOA,EAAaG,GAEtBvC,EAAO/mB,UAAYspB,EACnB,IAAIvd,EAAS,IAAIgb,EAEjB,OADAA,EAAO/mB,eAAYkD,EACZ6I,CACT,CACF,CAdiB,GAgBjBnR,EAAOC,QAAUwuB,C,gBC7BjB,IAAIE,EAAa,EAAQ,MAWrBC,EAViB,EAAQ,KAUdC,CAAeF,GAE9B3uB,EAAOC,QAAU2uB,C,iBCbjB,IAAIE,EAAW,EAAQ,KA+BvB9uB,EAAOC,QAnBP,SAAsB0qB,EAAOC,EAAUI,GAIrC,IAHA,IAAI1Y,GAAS,EACT/O,EAASonB,EAAMpnB,SAEV+O,EAAQ/O,GAAQ,CACvB,IAAIuc,EAAQ6K,EAAMrY,GACdyc,EAAUnE,EAAS9K,GAEvB,GAAe,MAAXiP,SAAiCzmB,IAAb0mB,EACfD,GAAYA,IAAYD,EAASC,GAClC/D,EAAW+D,EAASC,IAE1B,IAAIA,EAAWD,EACX5d,EAAS2O,CAEjB,CACA,OAAO3O,CACT,C,iBC7BA,IAAIyd,EAAW,EAAQ,KAoBvB5uB,EAAOC,QAVP,SAAoB2f,EAAYiL,GAC9B,IAAI1Z,EAAS,GAMb,OALAyd,EAAShP,GAAY,SAASE,EAAOxN,EAAOsN,GACtCiL,EAAU/K,EAAOxN,EAAOsN,IAC1BzO,EAAOtP,KAAKie,EAEhB,IACO3O,CACT,C,UCKAnR,EAAOC,QAZP,SAAuB0qB,EAAOE,EAAWoE,EAAWC,GAIlD,IAHA,IAAI3rB,EAASonB,EAAMpnB,OACf+O,EAAQ2c,GAAaC,EAAY,GAAK,GAElCA,EAAY5c,MAAYA,EAAQ/O,GACtC,GAAIsnB,EAAUF,EAAMrY,GAAQA,EAAOqY,GACjC,OAAOrY,EAGX,OAAQ,CACV,C,iBCrBA,IAAI6c,EAAY,EAAQ,MACpBC,EAAgB,EAAQ,MAoC5BpvB,EAAOC,QAvBP,SAASovB,EAAY1E,EAAO5a,EAAO8a,EAAWyE,EAAUne,GACtD,IAAImB,GAAS,EACT/O,EAASonB,EAAMpnB,OAKnB,IAHAsnB,IAAcA,EAAYuE,GAC1Bje,IAAWA,EAAS,MAEXmB,EAAQ/O,GAAQ,CACvB,IAAIuc,EAAQ6K,EAAMrY,GACdvC,EAAQ,GAAK8a,EAAU/K,GACrB/P,EAAQ,EAEVsf,EAAYvP,EAAO/P,EAAQ,EAAG8a,EAAWyE,EAAUne,GAEnDge,EAAUhe,EAAQ2O,GAEVwP,IACVne,EAAOA,EAAO5N,QAAUuc,EAE5B,CACA,OAAO3O,CACT,C,iBCnCA,IAaIoe,EAbgB,EAAQ,KAadC,GAEdxvB,EAAOC,QAAUsvB,C,iBCfjB,IAAIA,EAAU,EAAQ,MAClBlM,EAAO,EAAQ,MAcnBrjB,EAAOC,QAJP,SAAoBksB,EAAQvB,GAC1B,OAAOuB,GAAUoD,EAAQpD,EAAQvB,EAAUvH,EAC7C,C,iBCbA,IAAIoM,EAAW,EAAQ,KACnBC,EAAQ,EAAQ,MAsBpB1vB,EAAOC,QAZP,SAAiBksB,EAAQ1V,GAMvB,IAHA,IAAInE,EAAQ,EACR/O,GAHJkT,EAAOgZ,EAAShZ,EAAM0V,IAGJ5oB,OAED,MAAV4oB,GAAkB7Z,EAAQ/O,GAC/B4oB,EAASA,EAAOuD,EAAMjZ,EAAKnE,OAE7B,OAAQA,GAASA,GAAS/O,EAAU4oB,OAAS7jB,CAC/C,C,iBCrBA,IAAI6mB,EAAY,EAAQ,MACpB3O,EAAU,EAAQ,MAkBtBxgB,EAAOC,QALP,SAAwBksB,EAAQwD,EAAUC,GACxC,IAAIze,EAASwe,EAASxD,GACtB,OAAO3L,EAAQ2L,GAAUhb,EAASge,EAAUhe,EAAQye,EAAYzD,GAClE,C,iBCjBA,IAAI9B,EAAS,EAAQ,MACjBwF,EAAY,EAAQ,MACpBC,EAAiB,EAAQ,MAOzBC,EAAiB1F,EAASA,EAAO2F,iBAAc1nB,EAkBnDtI,EAAOC,QATP,SAAoB6f,GAClB,OAAa,MAATA,OACexX,IAAVwX,EAdQ,qBADL,gBAiBJiQ,GAAkBA,KAAkB/I,OAAOlH,GAC/C+P,EAAU/P,GACVgQ,EAAehQ,EACrB,C,WCZA9f,EAAOC,QAJP,SAAgB6f,EAAO3K,GACrB,OAAO2K,EAAQ3K,CACjB,C,WCVA,IAGImW,EAHctE,OAAO5hB,UAGQkmB,eAcjCtrB,EAAOC,QAJP,SAAiBksB,EAAQ7I,GACvB,OAAiB,MAAV6I,GAAkBb,EAAezD,KAAKsE,EAAQ7I,EACvD,C,WCJAtjB,EAAOC,QAJP,SAAmBksB,EAAQ7I,GACzB,OAAiB,MAAV6I,GAAkB7I,KAAO0D,OAAOmF,EACzC,C,iBCVA,IAAI8D,EAAgB,EAAQ,KACxBC,EAAY,EAAQ,MACpBC,EAAgB,EAAQ,KAiB5BnwB,EAAOC,QANP,SAAqB0qB,EAAO7K,EAAOmP,GACjC,OAAOnP,GAAUA,EACbqQ,EAAcxF,EAAO7K,EAAOmP,GAC5BgB,EAActF,EAAOuF,EAAWjB,EACtC,C,iBCjBA,IAAImB,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MAgB3BrwB,EAAOC,QAJP,SAAyB6f,GACvB,OAAOuQ,EAAavQ,IAVR,sBAUkBsQ,EAAWtQ,EAC3C,C,iBCfA,IAAIwQ,EAAkB,EAAQ,MAC1BD,EAAe,EAAQ,MA0B3BrwB,EAAOC,QAVP,SAASswB,EAAYzQ,EAAO3K,EAAO2Y,EAASC,EAAY3sB,GACtD,OAAI0e,IAAU3K,IAGD,MAAT2K,GAA0B,MAAT3K,IAAmBkb,EAAavQ,KAAWuQ,EAAalb,GACpE2K,GAAUA,GAAS3K,GAAUA,EAE/Bmb,EAAgBxQ,EAAO3K,EAAO2Y,EAASC,EAAYwC,EAAanvB,GACzE,C,iBCzBA,IAAI+oB,EAAQ,EAAQ,MAChBqG,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MACvBxD,EAAS,EAAQ,MACjB1M,EAAU,EAAQ,MAClB2K,EAAW,EAAQ,MACnBE,EAAe,EAAQ,MAMvBoC,EAAU,qBACVkD,EAAW,iBACXhD,EAAY,kBAMZrC,EAHctE,OAAO5hB,UAGQkmB,eA6DjCtrB,EAAOC,QA7CP,SAAyBksB,EAAQhX,EAAO2Y,EAASC,EAAY6C,EAAWxvB,GACtE,IAAIyvB,EAAWrQ,EAAQ2L,GACnB2E,EAAWtQ,EAAQrL,GACnB4b,EAASF,EAAWF,EAAWzD,EAAOf,GACtC6E,EAASF,EAAWH,EAAWzD,EAAO/X,GAKtC8b,GAHJF,EAASA,GAAUtD,EAAUE,EAAYoD,IAGhBpD,EACrBuD,GAHJF,EAASA,GAAUvD,EAAUE,EAAYqD,IAGhBrD,EACrBwD,EAAYJ,GAAUC,EAE1B,GAAIG,GAAahG,EAASgB,GAAS,CACjC,IAAKhB,EAAShW,GACZ,OAAO,EAET0b,GAAW,EACXI,GAAW,CACb,CACA,GAAIE,IAAcF,EAEhB,OADA7vB,IAAUA,EAAQ,IAAI+oB,GACd0G,GAAYxF,EAAac,GAC7BqE,EAAYrE,EAAQhX,EAAO2Y,EAASC,EAAY6C,EAAWxvB,GAC3DqvB,EAAWtE,EAAQhX,EAAO4b,EAAQjD,EAASC,EAAY6C,EAAWxvB,GAExE,KArDyB,EAqDnB0sB,GAAiC,CACrC,IAAIsD,EAAeH,GAAY3F,EAAezD,KAAKsE,EAAQ,eACvDkF,EAAeH,GAAY5F,EAAezD,KAAK1S,EAAO,eAE1D,GAAIic,GAAgBC,EAAc,CAChC,IAAIC,EAAeF,EAAejF,EAAOrM,QAAUqM,EAC/CoF,EAAeF,EAAelc,EAAM2K,QAAU3K,EAGlD,OADA/T,IAAUA,EAAQ,IAAI+oB,GACfyG,EAAUU,EAAcC,EAAczD,EAASC,EAAY3sB,EACpE,CACF,CACA,QAAK+vB,IAGL/vB,IAAUA,EAAQ,IAAI+oB,GACfuG,EAAavE,EAAQhX,EAAO2Y,EAASC,EAAY6C,EAAWxvB,GACrE,C,iBChFA,IAAI8rB,EAAS,EAAQ,MACjBmD,EAAe,EAAQ,MAgB3BrwB,EAAOC,QAJP,SAAmB6f,GACjB,OAAOuQ,EAAavQ,IAVT,gBAUmBoN,EAAOpN,EACvC,C,iBCfA,IAAIqK,EAAQ,EAAQ,MAChBoG,EAAc,EAAQ,MA4D1BvwB,EAAOC,QA5CP,SAAqBksB,EAAQ5X,EAAQid,EAAWzD,GAC9C,IAAIzb,EAAQkf,EAAUjuB,OAClBA,EAAS+O,EACTmf,GAAgB1D,EAEpB,GAAc,MAAV5B,EACF,OAAQ5oB,EAGV,IADA4oB,EAASnF,OAAOmF,GACT7Z,KAAS,CACd,IAAI8X,EAAOoH,EAAUlf,GACrB,GAAKmf,GAAgBrH,EAAK,GAClBA,EAAK,KAAO+B,EAAO/B,EAAK,MACtBA,EAAK,KAAM+B,GAEnB,OAAO,CAEX,CACA,OAAS7Z,EAAQ/O,GAAQ,CAEvB,IAAI+f,GADJ8G,EAAOoH,EAAUlf,IACF,GACX8Z,EAAWD,EAAO7I,GAClBoO,EAAWtH,EAAK,GAEpB,GAAIqH,GAAgBrH,EAAK,IACvB,QAAiB9hB,IAAb8jB,KAA4B9I,KAAO6I,GACrC,OAAO,MAEJ,CACL,IAAI/qB,EAAQ,IAAI+oB,EAChB,GAAI4D,EACF,IAAI5c,EAAS4c,EAAW3B,EAAUsF,EAAUpO,EAAK6I,EAAQ5X,EAAQnT,GAEnE,UAAiBkH,IAAX6I,EACEof,EAAYmB,EAAUtF,EAAUuF,EAA+C5D,EAAY3sB,GAC3F+P,GAEN,OAAO,CAEX,CACF,CACA,OAAO,CACT,C,WChDAnR,EAAOC,QAJP,SAAmB6f,GACjB,OAAOA,GAAUA,CACnB,C,iBCTA,IAAI6F,EAAa,EAAQ,MACrBiM,EAAW,EAAQ,MACnBrE,EAAW,EAAQ,MACnBsE,EAAW,EAAQ,KASnBC,EAAe,8BAGfC,EAAYC,SAAS5sB,UACrB6sB,EAAcjL,OAAO5hB,UAGrB8sB,EAAeH,EAAUxsB,SAGzB+lB,EAAiB2G,EAAY3G,eAG7B6G,EAAaC,OAAO,IACtBF,EAAarK,KAAKyD,GAAgB+G,QAjBjB,sBAiBuC,QACvDA,QAAQ,yDAA0D,SAAW,KAmBhFryB,EAAOC,QARP,SAAsB6f,GACpB,SAAKyN,EAASzN,IAAU8R,EAAS9R,MAGnB6F,EAAW7F,GAASqS,EAAaL,GAChCQ,KAAKT,EAAS/R,GAC/B,C,iBC5CA,IAAIoN,EAAS,EAAQ,MACjBmD,EAAe,EAAQ,MAgB3BrwB,EAAOC,QAJP,SAAmB6f,GACjB,OAAOuQ,EAAavQ,IAVT,gBAUmBoN,EAAOpN,EACvC,C,gBCfA,IAAIsQ,EAAa,EAAQ,MACrBmC,EAAW,EAAQ,MACnBlC,EAAe,EAAQ,MA8BvBmC,EAAiB,CAAC,EACtBA,EAZiB,yBAYYA,EAXZ,yBAYjBA,EAXc,sBAWYA,EAVX,uBAWfA,EAVe,uBAUYA,EATZ,uBAUfA,EATsB,8BASYA,EARlB,wBAShBA,EARgB,yBAQY,EAC5BA,EAjCc,sBAiCYA,EAhCX,kBAiCfA,EApBqB,wBAoBYA,EAhCnB,oBAiCdA,EApBkB,qBAoBYA,EAhChB,iBAiCdA,EAhCe,kBAgCYA,EA/Bb,qBAgCdA,EA/Ba,gBA+BYA,EA9BT,mBA+BhBA,EA9BgB,mBA8BYA,EA7BZ,mBA8BhBA,EA7Ba,gBA6BYA,EA5BT,mBA6BhBA,EA5BiB,qBA4BY,EAc7BxyB,EAAOC,QALP,SAA0B6f,GACxB,OAAOuQ,EAAavQ,IAClByS,EAASzS,EAAMvc,WAAaivB,EAAepC,EAAWtQ,GAC1D,C,iBCzDA,IAAI2S,EAAc,EAAQ,MACtBC,EAAsB,EAAQ,MAC9BC,EAAW,EAAQ,MACnBnS,EAAU,EAAQ,MAClBoS,EAAW,EAAQ,MA0BvB5yB,EAAOC,QAjBP,SAAsB6f,GAGpB,MAAoB,mBAATA,EACFA,EAEI,MAATA,EACK6S,EAEW,iBAAT7S,EACFU,EAAQV,GACX4S,EAAoB5S,EAAM,GAAIA,EAAM,IACpC2S,EAAY3S,GAEX8S,EAAS9S,EAClB,C,iBC5BA,IAAI+S,EAAc,EAAQ,MACtBC,EAAa,EAAQ,MAMrBxH,EAHctE,OAAO5hB,UAGQkmB,eAsBjCtrB,EAAOC,QAbP,SAAkBksB,GAChB,IAAK0G,EAAY1G,GACf,OAAO2G,EAAW3G,GAEpB,IAAIhb,EAAS,GACb,IAAK,IAAImS,KAAO0D,OAAOmF,GACjBb,EAAezD,KAAKsE,EAAQ7I,IAAe,eAAPA,GACtCnS,EAAOtP,KAAKyhB,GAGhB,OAAOnS,CACT,C,iBC3BA,IAAIoc,EAAW,EAAQ,MACnBsF,EAAc,EAAQ,MACtBE,EAAe,EAAQ,MAMvBzH,EAHctE,OAAO5hB,UAGQkmB,eAwBjCtrB,EAAOC,QAfP,SAAoBksB,GAClB,IAAKoB,EAASpB,GACZ,OAAO4G,EAAa5G,GAEtB,IAAI6G,EAAUH,EAAY1G,GACtBhb,EAAS,GAEb,IAAK,IAAImS,KAAO6I,GACD,eAAP7I,IAAyB0P,GAAY1H,EAAezD,KAAKsE,EAAQ7I,KACrEnS,EAAOtP,KAAKyhB,GAGhB,OAAOnS,CACT,C,WCjBAnR,EAAOC,QAJP,SAAgB6f,EAAO3K,GACrB,OAAO2K,EAAQ3K,CACjB,C,iBCXA,IAAIyZ,EAAW,EAAQ,KACnBqE,EAAc,EAAQ,MAoB1BjzB,EAAOC,QAVP,SAAiB2f,EAAYgL,GAC3B,IAAItY,GAAS,EACTnB,EAAS8hB,EAAYrT,GAAcxN,MAAMwN,EAAWrc,QAAU,GAKlE,OAHAqrB,EAAShP,GAAY,SAASE,EAAOwD,EAAK1D,GACxCzO,IAASmB,GAASsY,EAAS9K,EAAOwD,EAAK1D,EACzC,IACOzO,CACT,C,iBCnBA,IAAI+hB,EAAc,EAAQ,MACtBC,EAAe,EAAQ,MACvBC,EAA0B,EAAQ,MAmBtCpzB,EAAOC,QAVP,SAAqBsU,GACnB,IAAIid,EAAY2B,EAAa5e,GAC7B,OAAwB,GAApBid,EAAUjuB,QAAeiuB,EAAU,GAAG,GACjC4B,EAAwB5B,EAAU,GAAG,GAAIA,EAAU,GAAG,IAExD,SAASrF,GACd,OAAOA,IAAW5X,GAAU2e,EAAY/G,EAAQ5X,EAAQid,EAC1D,CACF,C,iBCnBA,IAAIjB,EAAc,EAAQ,MACtB7H,EAAM,EAAQ,MACd2K,EAAQ,EAAQ,MAChBC,EAAQ,EAAQ,KAChBC,EAAqB,EAAQ,MAC7BH,EAA0B,EAAQ,MAClC1D,EAAQ,EAAQ,MA0BpB1vB,EAAOC,QAZP,SAA6BwW,EAAMib,GACjC,OAAI4B,EAAM7c,IAAS8c,EAAmB7B,GAC7B0B,EAAwB1D,EAAMjZ,GAAOib,GAEvC,SAASvF,GACd,IAAIC,EAAW1D,EAAIyD,EAAQ1V,GAC3B,YAAqBnO,IAAb8jB,GAA0BA,IAAasF,EAC3C2B,EAAMlH,EAAQ1V,GACd8Z,EAAYmB,EAAUtF,EAAUuF,EACtC,CACF,C,iBC9BA,IAAIxH,EAAQ,EAAQ,MAChBqJ,EAAmB,EAAQ,MAC3BjE,EAAU,EAAQ,MAClBkE,EAAgB,EAAQ,MACxBlG,EAAW,EAAQ,MACnBjB,EAAS,EAAQ,MACjBoH,EAAU,EAAQ,MAmCtB1zB,EAAOC,QAtBP,SAAS0zB,EAAUxH,EAAQ5X,EAAQqf,EAAU7F,EAAY3sB,GACnD+qB,IAAW5X,GAGfgb,EAAQhb,GAAQ,SAASmd,EAAUpO,GAEjC,GADAliB,IAAUA,EAAQ,IAAI+oB,GAClBoD,EAASmE,GACX+B,EAActH,EAAQ5X,EAAQ+O,EAAKsQ,EAAUD,EAAW5F,EAAY3sB,OAEjE,CACH,IAAIyyB,EAAW9F,EACXA,EAAW2F,EAAQvH,EAAQ7I,GAAMoO,EAAWpO,EAAM,GAAK6I,EAAQ5X,EAAQnT,QACvEkH,OAEaA,IAAburB,IACFA,EAAWnC,GAEb8B,EAAiBrH,EAAQ7I,EAAKuQ,EAChC,CACF,GAAGvH,EACL,C,iBCvCA,IAAIkH,EAAmB,EAAQ,MAC3B5G,EAAc,EAAQ,MACtBkH,EAAkB,EAAQ,MAC1BjH,EAAY,EAAQ,KACpBQ,EAAkB,EAAQ,MAC1BnC,EAAc,EAAQ,IACtB1K,EAAU,EAAQ,MAClBuT,EAAoB,EAAQ,MAC5B5I,EAAW,EAAQ,MACnBxF,EAAa,EAAQ,MACrB4H,EAAW,EAAQ,MACnByG,EAAgB,EAAQ,MACxB3I,EAAe,EAAQ,MACvBqI,EAAU,EAAQ,MAClBO,EAAgB,EAAQ,KA+E5Bj0B,EAAOC,QA9DP,SAAuBksB,EAAQ5X,EAAQ+O,EAAKsQ,EAAUM,EAAWnG,EAAY3sB,GAC3E,IAAIgrB,EAAWsH,EAAQvH,EAAQ7I,GAC3BoO,EAAWgC,EAAQnf,EAAQ+O,GAC3B8K,EAAUhtB,EAAMsnB,IAAIgJ,GAExB,GAAItD,EACFoF,EAAiBrH,EAAQ7I,EAAK8K,OADhC,CAIA,IAAIyF,EAAW9F,EACXA,EAAW3B,EAAUsF,EAAWpO,EAAM,GAAK6I,EAAQ5X,EAAQnT,QAC3DkH,EAEA6rB,OAAwB7rB,IAAburB,EAEf,GAAIM,EAAU,CACZ,IAAI3I,EAAQhL,EAAQkR,GAChBhG,GAAUF,GAASL,EAASuG,GAC5B0C,GAAW5I,IAAUE,GAAUL,EAAaqG,GAEhDmC,EAAWnC,EACPlG,GAASE,GAAU0I,EACjB5T,EAAQ4L,GACVyH,EAAWzH,EAEJ2H,EAAkB3H,GACzByH,EAAWhH,EAAUT,GAEdV,GACPyI,GAAW,EACXN,EAAWjH,EAAY8E,GAAU,IAE1B0C,GACPD,GAAW,EACXN,EAAWC,EAAgBpC,GAAU,IAGrCmC,EAAW,GAGNG,EAActC,IAAaxG,EAAYwG,IAC9CmC,EAAWzH,EACPlB,EAAYkB,GACdyH,EAAWI,EAAc7H,GAEjBmB,EAASnB,KAAazG,EAAWyG,KACzCyH,EAAWxG,EAAgBqE,KAI7ByC,GAAW,CAEf,CACIA,IAEF/yB,EAAMqnB,IAAIiJ,EAAUmC,GACpBK,EAAUL,EAAUnC,EAAUkC,EAAU7F,EAAY3sB,GACpDA,EAAc,OAAEswB,IAElB8B,EAAiBrH,EAAQ7I,EAAKuQ,EAnD9B,CAoDF,C,iBC3FA,IAAIQ,EAAW,EAAQ,MACnBC,EAAU,EAAQ,MAClBC,EAAe,EAAQ,MACvBC,EAAU,EAAQ,MAClBC,EAAa,EAAQ,MACrBC,EAAY,EAAQ,MACpBC,EAAkB,EAAQ,MAC1BhC,EAAW,EAAQ,MACnBnS,EAAU,EAAQ,MAwCtBxgB,EAAOC,QA7BP,SAAqB2f,EAAYgV,EAAWC,GAExCD,EADEA,EAAUrxB,OACA8wB,EAASO,GAAW,SAAShK,GACvC,OAAIpK,EAAQoK,GACH,SAAS9K,GACd,OAAOwU,EAAQxU,EAA2B,IAApB8K,EAASrnB,OAAeqnB,EAAS,GAAKA,EAC9D,EAEKA,CACT,IAEY,CAAC+H,GAGf,IAAIrgB,GAAS,EACbsiB,EAAYP,EAASO,EAAWF,EAAUH,IAE1C,IAAIpjB,EAASqjB,EAAQ5U,GAAY,SAASE,EAAOwD,EAAK1D,GAIpD,MAAO,CAAE,SAHMyU,EAASO,GAAW,SAAShK,GAC1C,OAAOA,EAAS9K,EAClB,IAC+B,QAAWxN,EAAO,MAASwN,EAC5D,IAEA,OAAO2U,EAAWtjB,GAAQ,SAASgb,EAAQhX,GACzC,OAAOwf,EAAgBxI,EAAQhX,EAAO0f,EACxC,GACF,C,iBC9CA,IAAIC,EAAa,EAAQ,MACrBzB,EAAQ,EAAQ,MAiBpBrzB,EAAOC,QANP,SAAkBksB,EAAQ4I,GACxB,OAAOD,EAAW3I,EAAQ4I,GAAO,SAASjV,EAAOrJ,GAC/C,OAAO4c,EAAMlH,EAAQ1V,EACvB,GACF,C,iBChBA,IAAI6d,EAAU,EAAQ,MAClBU,EAAU,EAAQ,MAClBvF,EAAW,EAAQ,KA2BvBzvB,EAAOC,QAhBP,SAAoBksB,EAAQ4I,EAAOlK,GAKjC,IAJA,IAAIvY,GAAS,EACT/O,EAASwxB,EAAMxxB,OACf4N,EAAS,CAAC,IAELmB,EAAQ/O,GAAQ,CACvB,IAAIkT,EAAOse,EAAMziB,GACbwN,EAAQwU,EAAQnI,EAAQ1V,GAExBoU,EAAU/K,EAAOrJ,IACnBue,EAAQ7jB,EAAQse,EAAShZ,EAAM0V,GAASrM,EAE5C,CACA,OAAO3O,CACT,C,WCdAnR,EAAOC,QANP,SAAsBqjB,GACpB,OAAO,SAAS6I,GACd,OAAiB,MAAVA,OAAiB7jB,EAAY6jB,EAAO7I,EAC7C,CACF,C,iBCXA,IAAIgR,EAAU,EAAQ,MAetBt0B,EAAOC,QANP,SAA0BwW,GACxB,OAAO,SAAS0V,GACd,OAAOmI,EAAQnI,EAAQ1V,EACzB,CACF,C,WCZA,IAAIwe,EAAa7tB,KAAK6R,KAClBic,EAAY9tB,KAAKC,IAyBrBrH,EAAOC,QAZP,SAAmBoc,EAAO8Y,EAAKC,EAAMlG,GAKnC,IAJA,IAAI5c,GAAS,EACT/O,EAAS2xB,EAAUD,GAAYE,EAAM9Y,IAAU+Y,GAAQ,IAAK,GAC5DjkB,EAASiB,MAAM7O,GAEZA,KACL4N,EAAO+d,EAAY3rB,IAAW+O,GAAS+J,EACvCA,GAAS+Y,EAEX,OAAOjkB,CACT,C,WCHAnR,EAAOC,QATP,SAAoB2f,EAAYgL,EAAUiB,EAAaC,EAAWuJ,GAMhE,OALAA,EAASzV,GAAY,SAASE,EAAOxN,EAAOsN,GAC1CiM,EAAcC,GACTA,GAAY,EAAOhM,GACpB8K,EAASiB,EAAa/L,EAAOxN,EAAOsN,EAC1C,IACOiM,CACT,C,iBCpBA,IAAI8G,EAAW,EAAQ,MACnB2C,EAAW,EAAQ,MACnBC,EAAc,EAAQ,MAc1Bv1B,EAAOC,QAJP,SAAkBuqB,EAAMnO,GACtB,OAAOkZ,EAAYD,EAAS9K,EAAMnO,EAAOsW,GAAWnI,EAAO,GAC7D,C,iBCdA,IAAIiC,EAAc,EAAQ,MACtBgD,EAAW,EAAQ,KACnBrE,EAAU,EAAQ,MAClBmC,EAAW,EAAQ,MACnBmC,EAAQ,EAAQ,MA8CpB1vB,EAAOC,QAlCP,SAAiBksB,EAAQ1V,EAAMqJ,EAAOiO,GACpC,IAAKR,EAASpB,GACZ,OAAOA,EAST,IALA,IAAI7Z,GAAS,EACT/O,GAHJkT,EAAOgZ,EAAShZ,EAAM0V,IAGJ5oB,OACdiyB,EAAYjyB,EAAS,EACrBkyB,EAAStJ,EAEI,MAAVsJ,KAAoBnjB,EAAQ/O,GAAQ,CACzC,IAAI+f,EAAMoM,EAAMjZ,EAAKnE,IACjBuhB,EAAW/T,EAEf,GAAY,cAARwD,GAA+B,gBAARA,GAAiC,cAARA,EAClD,OAAO6I,EAGT,GAAI7Z,GAASkjB,EAAW,CACtB,IAAIpJ,EAAWqJ,EAAOnS,QAELhb,KADjBurB,EAAW9F,EAAaA,EAAW3B,EAAU9I,EAAKmS,QAAUntB,KAE1DurB,EAAWtG,EAASnB,GAChBA,EACChB,EAAQ3U,EAAKnE,EAAQ,IAAM,GAAK,CAAC,EAE1C,CACAma,EAAYgJ,EAAQnS,EAAKuQ,GACzB4B,EAASA,EAAOnS,EAClB,CACA,OAAO6I,CACT,C,iBChDA,IAAI/jB,EAAW,EAAQ,MACnBmkB,EAAiB,EAAQ,MACzBoG,EAAW,EAAQ,MAUnB+C,EAAmBnJ,EAA4B,SAAS/B,EAAMmL,GAChE,OAAOpJ,EAAe/B,EAAM,WAAY,CACtC,cAAgB,EAChB,YAAc,EACd,MAASpiB,EAASutB,GAClB,UAAY,GAEhB,EAPwChD,EASxC3yB,EAAOC,QAAUy1B,C,WCDjB11B,EAAOC,QAVP,SAAoB0qB,EAAOiL,GACzB,IAAIryB,EAASonB,EAAMpnB,OAGnB,IADAonB,EAAM9V,KAAK+gB,GACJryB,KACLonB,EAAMpnB,GAAUonB,EAAMpnB,GAAQuc,MAEhC,OAAO6K,CACT,C,WCCA3qB,EAAOC,QAVP,SAAmB41B,EAAGjL,GAIpB,IAHA,IAAItY,GAAS,EACTnB,EAASiB,MAAMyjB,KAEVvjB,EAAQujB,GACf1kB,EAAOmB,GAASsY,EAAStY,GAE3B,OAAOnB,CACT,C,iBCjBA,IAAIkZ,EAAS,EAAQ,MACjBgK,EAAW,EAAQ,MACnB7T,EAAU,EAAQ,MAClBsO,EAAW,EAAQ,KAMnBgH,EAAczL,EAASA,EAAOjlB,eAAYkD,EAC1CytB,EAAiBD,EAAcA,EAAYvwB,cAAW+C,EA0B1DtI,EAAOC,QAhBP,SAAS+1B,EAAalW,GAEpB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIU,EAAQV,GAEV,OAAOuU,EAASvU,EAAOkW,GAAgB,GAEzC,GAAIlH,EAAShP,GACX,OAAOiW,EAAiBA,EAAelO,KAAK/H,GAAS,GAEvD,IAAI3O,EAAU2O,EAAQ,GACtB,MAAkB,KAAV3O,GAAkB,EAAI2O,IAAU,IAAa,KAAO3O,CAC9D,C,iBClCA,IAAI8kB,EAAkB,EAAQ,MAG1BC,EAAc,OAelBl2B,EAAOC,QANP,SAAkB01B,GAChB,OAAOA,EACHA,EAAOpe,MAAM,EAAG0e,EAAgBN,GAAU,GAAGtD,QAAQ6D,EAAa,IAClEP,CACN,C,WCHA31B,EAAOC,QANP,SAAmBuqB,GACjB,OAAO,SAAS1K,GACd,OAAO0K,EAAK1K,EACd,CACF,C,iBCXA,IAAI8J,EAAW,EAAQ,MACnBuM,EAAgB,EAAQ,KACxBC,EAAoB,EAAQ,MAC5BC,EAAW,EAAQ,MACnBC,EAAY,EAAQ,MACpBC,EAAa,EAAQ,MAkEzBv2B,EAAOC,QApDP,SAAkB0qB,EAAOC,EAAUI,GACjC,IAAI1Y,GAAS,EACTyV,EAAWoO,EACX5yB,EAASonB,EAAMpnB,OACf4wB,GAAW,EACXhjB,EAAS,GACTqlB,EAAOrlB,EAEX,GAAI6Z,EACFmJ,GAAW,EACXpM,EAAWqO,OAER,GAAI7yB,GAvBY,IAuBgB,CACnC,IAAIklB,EAAMmC,EAAW,KAAO0L,EAAU3L,GACtC,GAAIlC,EACF,OAAO8N,EAAW9N,GAEpB0L,GAAW,EACXpM,EAAWsO,EACXG,EAAO,IAAI5M,CACb,MAEE4M,EAAO5L,EAAW,GAAKzZ,EAEzBslB,EACA,OAASnkB,EAAQ/O,GAAQ,CACvB,IAAIuc,EAAQ6K,EAAMrY,GACd0c,EAAWpE,EAAWA,EAAS9K,GAASA,EAG5C,GADAA,EAASkL,GAAwB,IAAVlL,EAAeA,EAAQ,EAC1CqU,GAAYnF,GAAaA,EAAU,CAErC,IADA,IAAI0H,EAAYF,EAAKjzB,OACdmzB,KACL,GAAIF,EAAKE,KAAe1H,EACtB,SAASyH,EAGT7L,GACF4L,EAAK30B,KAAKmtB,GAEZ7d,EAAOtP,KAAKie,EACd,MACUiI,EAASyO,EAAMxH,EAAUhE,KAC7BwL,IAASrlB,GACXqlB,EAAK30B,KAAKmtB,GAEZ7d,EAAOtP,KAAKie,GAEhB,CACA,OAAO3O,CACT,C,gBCrEA,IAAIkjB,EAAW,EAAQ,MAkBvBr0B,EAAOC,QANP,SAAoBksB,EAAQmC,GAC1B,OAAO+F,EAAS/F,GAAO,SAAShL,GAC9B,OAAO6I,EAAO7I,EAChB,GACF,C,WCMAtjB,EAAOC,QAbP,SAAuBquB,EAAOpf,EAAQynB,GAMpC,IALA,IAAIrkB,GAAS,EACT/O,EAAS+qB,EAAM/qB,OACfqzB,EAAa1nB,EAAO3L,OACpB4N,EAAS,CAAC,IAELmB,EAAQ/O,GAAQ,CACvB,IAAIuc,EAAQxN,EAAQskB,EAAa1nB,EAAOoD,QAAShK,EACjDquB,EAAWxlB,EAAQmd,EAAMhc,GAAQwN,EACnC,CACA,OAAO3O,CACT,C,WCRAnR,EAAOC,QAJP,SAAkB42B,EAAOvT,GACvB,OAAOuT,EAAMn1B,IAAI4hB,EACnB,C,iBCVA,IAAIqP,EAAW,EAAQ,MAavB3yB,EAAOC,QAJP,SAAsB6f,GACpB,MAAuB,mBAATA,EAAsBA,EAAQ6S,CAC9C,C,gBCXA,IAAInS,EAAU,EAAQ,MAClB8S,EAAQ,EAAQ,KAChBwD,EAAe,EAAQ,MACvBvxB,EAAW,EAAQ,KAiBvBvF,EAAOC,QAPP,SAAkB6f,EAAOqM,GACvB,OAAI3L,EAAQV,GACHA,EAEFwT,EAAMxT,EAAOqM,GAAU,CAACrM,GAASgX,EAAavxB,EAASua,GAChE,C,iBClBA,IAAIwK,EAAa,EAAQ,MAezBtqB,EAAOC,QANP,SAA0B82B,GACxB,IAAI5lB,EAAS,IAAI4lB,EAAYvQ,YAAYuQ,EAAYC,YAErD,OADA,IAAI1M,EAAWnZ,GAAQsX,IAAI,IAAI6B,EAAWyM,IACnC5lB,CACT,C,4BCbA,IAAI/B,EAAO,EAAQ,KAGf6nB,EAA4Ch3B,IAAYA,EAAQi3B,UAAYj3B,EAG5Ek3B,EAAaF,GAA4Cj3B,IAAWA,EAAOk3B,UAAYl3B,EAMvFo3B,EAHgBD,GAAcA,EAAWl3B,UAAYg3B,EAG5B7nB,EAAKgoB,YAAS9uB,EACvC+uB,EAAcD,EAASA,EAAOC,iBAAc/uB,EAqBhDtI,EAAOC,QAXP,SAAqBq3B,EAAQtJ,GAC3B,GAAIA,EACF,OAAOsJ,EAAO/f,QAEhB,IAAIhU,EAAS+zB,EAAO/zB,OAChB4N,EAASkmB,EAAcA,EAAY9zB,GAAU,IAAI+zB,EAAO9Q,YAAYjjB,GAGxE,OADA+zB,EAAO/Q,KAAKpV,GACLA,CACT,C,iBChCA,IAAIomB,EAAmB,EAAQ,MAe/Bv3B,EAAOC,QALP,SAAuBu3B,EAAUxJ,GAC/B,IAAIsJ,EAAStJ,EAASuJ,EAAiBC,EAASF,QAAUE,EAASF,OACnE,OAAO,IAAIE,EAAShR,YAAY8Q,EAAQE,EAASC,WAAYD,EAASR,WACxE,C,WCZA,IAAIU,EAAU,OAed13B,EAAOC,QANP,SAAqB03B,GACnB,IAAIxmB,EAAS,IAAIwmB,EAAOnR,YAAYmR,EAAOpjB,OAAQmjB,EAAQE,KAAKD,IAEhE,OADAxmB,EAAOqkB,UAAYmC,EAAOnC,UACnBrkB,CACT,C,iBCdA,IAAIkZ,EAAS,EAAQ,MAGjByL,EAAczL,EAASA,EAAOjlB,eAAYkD,EAC1CuvB,EAAgB/B,EAAcA,EAAYgC,aAAUxvB,EAaxDtI,EAAOC,QAJP,SAAqB83B,GACnB,OAAOF,EAAgB7Q,OAAO6Q,EAAchQ,KAAKkQ,IAAW,CAAC,CAC/D,C,iBCfA,IAAIR,EAAmB,EAAQ,MAe/Bv3B,EAAOC,QALP,SAAyB+3B,EAAYhK,GACnC,IAAIsJ,EAAStJ,EAASuJ,EAAiBS,EAAWV,QAAUU,EAAWV,OACvE,OAAO,IAAIU,EAAWxR,YAAY8Q,EAAQU,EAAWP,WAAYO,EAAWz0B,OAC9E,C,iBCbA,IAAIurB,EAAW,EAAQ,KAwCvB9uB,EAAOC,QA9BP,SAA0B6f,EAAO3K,GAC/B,GAAI2K,IAAU3K,EAAO,CACnB,IAAI8iB,OAAyB3vB,IAAVwX,EACfoY,EAAsB,OAAVpY,EACZqY,EAAiBrY,GAAUA,EAC3BsY,EAActJ,EAAShP,GAEvBuY,OAAyB/vB,IAAV6M,EACfmjB,EAAsB,OAAVnjB,EACZojB,EAAiBpjB,GAAUA,EAC3BqjB,EAAc1J,EAAS3Z,GAE3B,IAAMmjB,IAAcE,IAAgBJ,GAAetY,EAAQ3K,GACtDijB,GAAeC,GAAgBE,IAAmBD,IAAcE,GAChEN,GAAaG,GAAgBE,IAC5BN,GAAgBM,IACjBJ,EACH,OAAO,EAET,IAAMD,IAAcE,IAAgBI,GAAe1Y,EAAQ3K,GACtDqjB,GAAeP,GAAgBE,IAAmBD,IAAcE,GAChEE,GAAaL,GAAgBE,IAC5BE,GAAgBF,IACjBI,EACH,OAAQ,CAEZ,CACA,OAAO,CACT,C,iBCtCA,IAAIE,EAAmB,EAAQ,MA2C/Bz4B,EAAOC,QA3BP,SAAyBksB,EAAQhX,EAAO0f,GAOtC,IANA,IAAIviB,GAAS,EACTomB,EAAcvM,EAAOwM,SACrBC,EAAczjB,EAAMwjB,SACpBp1B,EAASm1B,EAAYn1B,OACrBs1B,EAAehE,EAAOtxB,SAEjB+O,EAAQ/O,GAAQ,CACvB,IAAI4N,EAASsnB,EAAiBC,EAAYpmB,GAAQsmB,EAAYtmB,IAC9D,GAAInB,EACF,OAAImB,GAASumB,EACJ1nB,EAGFA,GAAmB,QADd0jB,EAAOviB,IACiB,EAAI,EAE5C,CAQA,OAAO6Z,EAAO7Z,MAAQ6C,EAAM7C,KAC9B,C,UCtBAtS,EAAOC,QAXP,SAAmBsU,EAAQoW,GACzB,IAAIrY,GAAS,EACT/O,EAASgR,EAAOhR,OAGpB,IADAonB,IAAUA,EAAQvY,MAAM7O,MACf+O,EAAQ/O,GACfonB,EAAMrY,GAASiC,EAAOjC,GAExB,OAAOqY,CACT,C,iBCjBA,IAAI8B,EAAc,EAAQ,MACtBR,EAAkB,EAAQ,MAsC9BjsB,EAAOC,QA1BP,SAAoBsU,EAAQ+Z,EAAOnC,EAAQ4B,GACzC,IAAI+K,GAAS3M,EACbA,IAAWA,EAAS,CAAC,GAKrB,IAHA,IAAI7Z,GAAS,EACT/O,EAAS+qB,EAAM/qB,SAEV+O,EAAQ/O,GAAQ,CACvB,IAAI+f,EAAMgL,EAAMhc,GAEZuhB,EAAW9F,EACXA,EAAW5B,EAAO7I,GAAM/O,EAAO+O,GAAMA,EAAK6I,EAAQ5X,QAClDjM,OAEaA,IAAburB,IACFA,EAAWtf,EAAO+O,IAEhBwV,EACF7M,EAAgBE,EAAQ7I,EAAKuQ,GAE7BpH,EAAYN,EAAQ7I,EAAKuQ,EAE7B,CACA,OAAO1H,CACT,C,iBCrCA,IAAIE,EAAa,EAAQ,MACrB0M,EAAa,EAAQ,MAczB/4B,EAAOC,QAJP,SAAqBsU,EAAQ4X,GAC3B,OAAOE,EAAW9X,EAAQwkB,EAAWxkB,GAAS4X,EAChD,C,iBCbA,IAAIE,EAAa,EAAQ,MACrB2M,EAAe,EAAQ,KAc3Bh5B,EAAOC,QAJP,SAAuBsU,EAAQ4X,GAC7B,OAAOE,EAAW9X,EAAQykB,EAAazkB,GAAS4X,EAClD,C,iBCbA,IAGI8M,EAHO,EAAQ,KAGG,sBAEtBj5B,EAAOC,QAAUg5B,C,iBCLjB,IAAIC,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,MAmC7Bn5B,EAAOC,QA1BP,SAAwBm5B,GACtB,OAAOF,GAAS,SAAS/M,EAAQrkB,GAC/B,IAAIwK,GAAS,EACT/O,EAASuE,EAAQvE,OACjBwqB,EAAaxqB,EAAS,EAAIuE,EAAQvE,EAAS,QAAK+E,EAChD+wB,EAAQ91B,EAAS,EAAIuE,EAAQ,QAAKQ,EAWtC,IATAylB,EAAcqL,EAAS71B,OAAS,GAA0B,mBAAdwqB,GACvCxqB,IAAUwqB,QACXzlB,EAEA+wB,GAASF,EAAerxB,EAAQ,GAAIA,EAAQ,GAAIuxB,KAClDtL,EAAaxqB,EAAS,OAAI+E,EAAYylB,EACtCxqB,EAAS,GAEX4oB,EAASnF,OAAOmF,KACP7Z,EAAQ/O,GAAQ,CACvB,IAAIgR,EAASzM,EAAQwK,GACjBiC,GACF6kB,EAASjN,EAAQ5X,EAAQjC,EAAOyb,EAEpC,CACA,OAAO5B,CACT,GACF,C,iBClCA,IAAI8G,EAAc,EAAQ,MA+B1BjzB,EAAOC,QArBP,SAAwBo1B,EAAUnG,GAChC,OAAO,SAAStP,EAAYgL,GAC1B,GAAkB,MAAdhL,EACF,OAAOA,EAET,IAAKqT,EAAYrT,GACf,OAAOyV,EAASzV,EAAYgL,GAM9B,IAJA,IAAIrnB,EAASqc,EAAWrc,OACpB+O,EAAQ4c,EAAY3rB,GAAU,EAC9B+1B,EAAWtS,OAAOpH,IAEdsP,EAAY5c,MAAYA,EAAQ/O,KACa,IAA/CqnB,EAAS0O,EAAShnB,GAAQA,EAAOgnB,KAIvC,OAAO1Z,CACT,CACF,C,WCLA5f,EAAOC,QAjBP,SAAuBivB,GACrB,OAAO,SAAS/C,EAAQvB,EAAU+E,GAMhC,IALA,IAAIrd,GAAS,EACTgnB,EAAWtS,OAAOmF,GAClBmC,EAAQqB,EAASxD,GACjB5oB,EAAS+qB,EAAM/qB,OAEZA,KAAU,CACf,IAAI+f,EAAMgL,EAAMY,EAAY3rB,IAAW+O,GACvC,IAA+C,IAA3CsY,EAAS0O,EAAShW,GAAMA,EAAKgW,GAC/B,KAEJ,CACA,OAAOnN,CACT,CACF,C,iBCtBA,IAAIoI,EAAe,EAAQ,MACvBtB,EAAc,EAAQ,MACtB5P,EAAO,EAAQ,MAsBnBrjB,EAAOC,QAbP,SAAoBs5B,GAClB,OAAO,SAAS3Z,EAAYiL,EAAWoE,GACrC,IAAIqK,EAAWtS,OAAOpH,GACtB,IAAKqT,EAAYrT,GAAa,CAC5B,IAAIgL,EAAW2J,EAAa1J,EAAW,GACvCjL,EAAayD,EAAKzD,GAClBiL,EAAY,SAASvH,GAAO,OAAOsH,EAAS0O,EAAShW,GAAMA,EAAKgW,EAAW,CAC7E,CACA,IAAIhnB,EAAQinB,EAAc3Z,EAAYiL,EAAWoE,GACjD,OAAO3c,GAAS,EAAIgnB,EAAS1O,EAAWhL,EAAWtN,GAASA,QAAShK,CACvE,CACF,C,iBCtBA,IAAIkxB,EAAY,EAAQ,MACpBL,EAAiB,EAAQ,MACzBM,EAAW,EAAQ,MA2BvBz5B,EAAOC,QAlBP,SAAqBivB,GACnB,OAAO,SAAS7S,EAAO8Y,EAAKC,GAa1B,OAZIA,GAAuB,iBAARA,GAAoB+D,EAAe9c,EAAO8Y,EAAKC,KAChED,EAAMC,OAAO9sB,GAGf+T,EAAQod,EAASpd,QACL/T,IAAR6sB,GACFA,EAAM9Y,EACNA,EAAQ,GAER8Y,EAAMsE,EAAStE,GAEjBC,OAAgB9sB,IAAT8sB,EAAsB/Y,EAAQ8Y,EAAM,GAAK,EAAKsE,EAASrE,GACvDoE,EAAUnd,EAAO8Y,EAAKC,EAAMlG,EACrC,CACF,C,iBC3BA,IAAIzF,EAAM,EAAQ,MACdiQ,EAAO,EAAQ,MACfnD,EAAa,EAAQ,MAYrBD,EAAc7M,GAAQ,EAAI8M,EAAW,IAAI9M,EAAI,CAAC,EAAE,KAAK,IAT1C,IASoE,SAASva,GAC1F,OAAO,IAAIua,EAAIva,EACjB,EAF4EwqB,EAI5E15B,EAAOC,QAAUq2B,C,iBClBjB,IAAIrO,EAAY,EAAQ,MAEpBsE,EAAkB,WACpB,IACE,IAAI/B,EAAOvC,EAAUjB,OAAQ,kBAE7B,OADAwD,EAAK,CAAC,EAAG,GAAI,CAAC,GACPA,CACT,CAAE,MAAOxpB,GAAI,CACf,CANqB,GAQrBhB,EAAOC,QAAUssB,C,iBCVjB,IAAI3C,EAAW,EAAQ,MACnB+P,EAAY,EAAQ,MACpBtD,EAAW,EAAQ,MAiFvBr2B,EAAOC,QA9DP,SAAqB0qB,EAAOxV,EAAO2Y,EAASC,EAAY6C,EAAWxvB,GACjE,IAAIw4B,EAjBqB,EAiBT9L,EACZ+L,EAAYlP,EAAMpnB,OAClBu2B,EAAY3kB,EAAM5R,OAEtB,GAAIs2B,GAAaC,KAAeF,GAAaE,EAAYD,GACvD,OAAO,EAGT,IAAIE,EAAa34B,EAAMsnB,IAAIiC,GACvBqP,EAAa54B,EAAMsnB,IAAIvT,GAC3B,GAAI4kB,GAAcC,EAChB,OAAOD,GAAc5kB,GAAS6kB,GAAcrP,EAE9C,IAAIrY,GAAS,EACTnB,GAAS,EACTqlB,EA/BuB,EA+Bf1I,EAAoC,IAAIlE,OAAWthB,EAM/D,IAJAlH,EAAMqnB,IAAIkC,EAAOxV,GACjB/T,EAAMqnB,IAAItT,EAAOwV,KAGRrY,EAAQunB,GAAW,CAC1B,IAAII,EAAWtP,EAAMrY,GACjB4nB,EAAW/kB,EAAM7C,GAErB,GAAIyb,EACF,IAAIoM,EAAWP,EACX7L,EAAWmM,EAAUD,EAAU3nB,EAAO6C,EAAOwV,EAAOvpB,GACpD2sB,EAAWkM,EAAUC,EAAU5nB,EAAOqY,EAAOxV,EAAO/T,GAE1D,QAAiBkH,IAAb6xB,EAAwB,CAC1B,GAAIA,EACF,SAEFhpB,GAAS,EACT,KACF,CAEA,GAAIqlB,GACF,IAAKmD,EAAUxkB,GAAO,SAAS+kB,EAAUE,GACnC,IAAK/D,EAASG,EAAM4D,KACfH,IAAaC,GAAYtJ,EAAUqJ,EAAUC,EAAUpM,EAASC,EAAY3sB,IAC/E,OAAOo1B,EAAK30B,KAAKu4B,EAErB,IAAI,CACNjpB,GAAS,EACT,KACF,OACK,GACD8oB,IAAaC,IACXtJ,EAAUqJ,EAAUC,EAAUpM,EAASC,EAAY3sB,GACpD,CACL+P,GAAS,EACT,KACF,CACF,CAGA,OAFA/P,EAAc,OAAEupB,GAChBvpB,EAAc,OAAE+T,GACThE,CACT,C,iBCjFA,IAAIkZ,EAAS,EAAQ,MACjBC,EAAa,EAAQ,MACrB4B,EAAK,EAAQ,MACbsE,EAAc,EAAQ,MACtB6J,EAAa,EAAQ,MACrB9D,EAAa,EAAQ,MAqBrBT,EAAczL,EAASA,EAAOjlB,eAAYkD,EAC1CuvB,EAAgB/B,EAAcA,EAAYgC,aAAUxvB,EAoFxDtI,EAAOC,QAjEP,SAAoBksB,EAAQhX,EAAOyS,EAAKkG,EAASC,EAAY6C,EAAWxvB,GACtE,OAAQwmB,GACN,IAzBc,oBA0BZ,GAAKuE,EAAO6K,YAAc7hB,EAAM6hB,YAC3B7K,EAAOsL,YAActiB,EAAMsiB,WAC9B,OAAO,EAETtL,EAASA,EAAOmL,OAChBniB,EAAQA,EAAMmiB,OAEhB,IAlCiB,uBAmCf,QAAKnL,EAAO6K,YAAc7hB,EAAM6hB,aAC3BpG,EAAU,IAAItG,EAAW6B,GAAS,IAAI7B,EAAWnV,KAKxD,IAnDU,mBAoDV,IAnDU,gBAoDV,IAjDY,kBAoDV,OAAO+W,GAAIC,GAAShX,GAEtB,IAxDW,iBAyDT,OAAOgX,EAAOjqB,MAAQiT,EAAMjT,MAAQiqB,EAAOmO,SAAWnlB,EAAMmlB,QAE9D,IAxDY,kBAyDZ,IAvDY,kBA2DV,OAAOnO,GAAWhX,EAAQ,GAE5B,IAjES,eAkEP,IAAIolB,EAAUF,EAEhB,IAjES,eAkEP,IAAIT,EA5EiB,EA4EL9L,EAGhB,GAFAyM,IAAYA,EAAUhE,GAElBpK,EAAO7P,MAAQnH,EAAMmH,OAASsd,EAChC,OAAO,EAGT,IAAIxL,EAAUhtB,EAAMsnB,IAAIyD,GACxB,GAAIiC,EACF,OAAOA,GAAWjZ,EAEpB2Y,GAtFuB,EAyFvB1sB,EAAMqnB,IAAI0D,EAAQhX,GAClB,IAAIhE,EAASqf,EAAY+J,EAAQpO,GAASoO,EAAQplB,GAAQ2Y,EAASC,EAAY6C,EAAWxvB,GAE1F,OADAA,EAAc,OAAE+qB,GACThb,EAET,IAnFY,kBAoFV,GAAI0mB,EACF,OAAOA,EAAchQ,KAAKsE,IAAW0L,EAAchQ,KAAK1S,GAG9D,OAAO,CACT,C,iBC7GA,IAAI6X,EAAa,EAAQ,MASrB1B,EAHctE,OAAO5hB,UAGQkmB,eAgFjCtrB,EAAOC,QAjEP,SAAsBksB,EAAQhX,EAAO2Y,EAASC,EAAY6C,EAAWxvB,GACnE,IAAIw4B,EAtBqB,EAsBT9L,EACZ0M,EAAWxN,EAAWb,GACtBsO,EAAYD,EAASj3B,OAIzB,GAAIk3B,GAHWzN,EAAW7X,GACD5R,SAEMq2B,EAC7B,OAAO,EAGT,IADA,IAAItnB,EAAQmoB,EACLnoB,KAAS,CACd,IAAIgR,EAAMkX,EAASloB,GACnB,KAAMsnB,EAAYtW,KAAOnO,EAAQmW,EAAezD,KAAK1S,EAAOmO,IAC1D,OAAO,CAEX,CAEA,IAAIoX,EAAat5B,EAAMsnB,IAAIyD,GACvB6N,EAAa54B,EAAMsnB,IAAIvT,GAC3B,GAAIulB,GAAcV,EAChB,OAAOU,GAAcvlB,GAAS6kB,GAAc7N,EAE9C,IAAIhb,GAAS,EACb/P,EAAMqnB,IAAI0D,EAAQhX,GAClB/T,EAAMqnB,IAAItT,EAAOgX,GAGjB,IADA,IAAIwO,EAAWf,IACNtnB,EAAQmoB,GAAW,CAE1B,IAAIrO,EAAWD,EADf7I,EAAMkX,EAASloB,IAEX4nB,EAAW/kB,EAAMmO,GAErB,GAAIyK,EACF,IAAIoM,EAAWP,EACX7L,EAAWmM,EAAU9N,EAAU9I,EAAKnO,EAAOgX,EAAQ/qB,GACnD2sB,EAAW3B,EAAU8N,EAAU5W,EAAK6I,EAAQhX,EAAO/T,GAGzD,UAAmBkH,IAAb6xB,EACG/N,IAAa8N,GAAYtJ,EAAUxE,EAAU8N,EAAUpM,EAASC,EAAY3sB,GAC7E+4B,GACD,CACLhpB,GAAS,EACT,KACF,CACAwpB,IAAaA,EAAkB,eAAPrX,EAC1B,CACA,GAAInS,IAAWwpB,EAAU,CACvB,IAAIC,EAAUzO,EAAO3F,YACjBqU,EAAU1lB,EAAMqR,YAGhBoU,GAAWC,KACV,gBAAiB1O,MAAU,gBAAiBhX,IACzB,mBAAXylB,GAAyBA,aAAmBA,GACjC,mBAAXC,GAAyBA,aAAmBA,IACvD1pB,GAAS,EAEb,CAGA,OAFA/P,EAAc,OAAE+qB,GAChB/qB,EAAc,OAAE+T,GACThE,CACT,C,iBCvFA,IAAIhJ,EAAU,EAAQ,MAClBmtB,EAAW,EAAQ,MACnBC,EAAc,EAAQ,MAa1Bv1B,EAAOC,QAJP,SAAkBuqB,GAChB,OAAO+K,EAAYD,EAAS9K,OAAMliB,EAAWH,GAAUqiB,EAAO,GAChE,C,iBCZA,IAAIsQ,EAA8B,iBAAV,EAAAl6B,GAAsB,EAAAA,GAAU,EAAAA,EAAOomB,SAAWA,QAAU,EAAApmB,EAEpFZ,EAAOC,QAAU66B,C,iBCHjB,IAAIC,EAAiB,EAAQ,MACzBhC,EAAa,EAAQ,MACrB1V,EAAO,EAAQ,MAanBrjB,EAAOC,QAJP,SAAoBksB,GAClB,OAAO4O,EAAe5O,EAAQ9I,EAAM0V,EACtC,C,iBCbA,IAAIgC,EAAiB,EAAQ,MACzB/B,EAAe,EAAQ,KACvB1M,EAAS,EAAQ,MAcrBtsB,EAAOC,QAJP,SAAsBksB,GACpB,OAAO4O,EAAe5O,EAAQG,EAAQ0M,EACxC,C,iBCdA,IAAIgC,EAAY,EAAQ,IAiBxBh7B,EAAOC,QAPP,SAAoBuH,EAAK8b,GACvB,IAAI8G,EAAO5iB,EAAIqiB,SACf,OAAOmR,EAAU1X,GACb8G,EAAmB,iBAAP9G,EAAkB,SAAW,QACzC8G,EAAK5iB,GACX,C,iBCfA,IAAI+rB,EAAqB,EAAQ,MAC7BlQ,EAAO,EAAQ,MAsBnBrjB,EAAOC,QAbP,SAAsBksB,GAIpB,IAHA,IAAIhb,EAASkS,EAAK8I,GACd5oB,EAAS4N,EAAO5N,OAEbA,KAAU,CACf,IAAI+f,EAAMnS,EAAO5N,GACbuc,EAAQqM,EAAO7I,GAEnBnS,EAAO5N,GAAU,CAAC+f,EAAKxD,EAAOyT,EAAmBzT,GACnD,CACA,OAAO3O,CACT,C,iBCrBA,IAAI8pB,EAAe,EAAQ,MACvBC,EAAW,EAAQ,MAevBl7B,EAAOC,QALP,SAAmBksB,EAAQ7I,GACzB,IAAIxD,EAAQob,EAAS/O,EAAQ7I,GAC7B,OAAO2X,EAAanb,GAASA,OAAQxX,CACvC,C,iBCdA,IAGI6yB,EAHU,EAAQ,KAGHC,CAAQpU,OAAOqU,eAAgBrU,QAElDhnB,EAAOC,QAAUk7B,C,iBCLjB,IAAI9Q,EAAS,EAAQ,MAGjB4H,EAAcjL,OAAO5hB,UAGrBkmB,EAAiB2G,EAAY3G,eAO7BgQ,EAAuBrJ,EAAY1sB,SAGnCwqB,EAAiB1F,EAASA,EAAO2F,iBAAc1nB,EA6BnDtI,EAAOC,QApBP,SAAmB6f,GACjB,IAAIyb,EAAQjQ,EAAezD,KAAK/H,EAAOiQ,GACnCnI,EAAM9H,EAAMiQ,GAEhB,IACEjQ,EAAMiQ,QAAkBznB,EACxB,IAAIkzB,GAAW,CACjB,CAAE,MAAOx6B,GAAI,CAEb,IAAImQ,EAASmqB,EAAqBzT,KAAK/H,GAQvC,OAPI0b,IACED,EACFzb,EAAMiQ,GAAkBnI,SAEjB9H,EAAMiQ,IAGV5e,CACT,C,iBC3CA,IAAIsqB,EAAc,EAAQ,MACtBC,EAAY,EAAQ,MAMpBC,EAHc3U,OAAO5hB,UAGcu2B,qBAGnCC,EAAmB5U,OAAO6U,sBAS1B9C,EAAc6C,EAA+B,SAASzP,GACxD,OAAc,MAAVA,EACK,IAETA,EAASnF,OAAOmF,GACTsP,EAAYG,EAAiBzP,IAAS,SAAS4L,GACpD,OAAO4D,EAAqB9T,KAAKsE,EAAQ4L,EAC3C,IACF,EARqC2D,EAUrC17B,EAAOC,QAAU84B,C,gBC7BjB,IAAI5J,EAAY,EAAQ,MACpBgM,EAAe,EAAQ,MACvBpC,EAAa,EAAQ,MACrB2C,EAAY,EAAQ,MAYpB1C,EATmBhS,OAAO6U,sBASqB,SAAS1P,GAE1D,IADA,IAAIhb,EAAS,GACNgb,GACLgD,EAAUhe,EAAQ4nB,EAAW5M,IAC7BA,EAASgP,EAAahP,GAExB,OAAOhb,CACT,EAPuCuqB,EASvC17B,EAAOC,QAAU+4B,C,iBCxBjB,IAAIhR,EAAW,EAAQ,MACnBiB,EAAM,EAAQ,MACdO,EAAU,EAAQ,MAClBC,EAAM,EAAQ,MACdc,EAAU,EAAQ,MAClB6F,EAAa,EAAQ,MACrByB,EAAW,EAAQ,KAGnBiK,EAAS,eAETC,EAAa,mBACbC,EAAS,eACTC,EAAa,mBAEbC,EAAc,oBAGdC,EAAqBtK,EAAS7J,GAC9BoU,EAAgBvK,EAAS5I,GACzBoT,EAAoBxK,EAASrI,GAC7B8S,EAAgBzK,EAASpI,GACzB8S,EAAoB1K,EAAStH,GAS7B2C,EAASkD,GAGRpI,GAAYkF,EAAO,IAAIlF,EAAS,IAAIwU,YAAY,MAAQN,GACxDjT,GAAOiE,EAAO,IAAIjE,IAAQ6S,GAC1BtS,GAAW0D,EAAO1D,EAAQiT,YAAcV,GACxCtS,GAAOyD,EAAO,IAAIzD,IAAQuS,GAC1BzR,GAAW2C,EAAO,IAAI3C,IAAY0R,KACrC/O,EAAS,SAASpN,GAChB,IAAI3O,EAASif,EAAWtQ,GACpB4c,EA/BQ,mBA+BDvrB,EAAsB2O,EAAM0G,iBAAcle,EACjDq0B,EAAaD,EAAO7K,EAAS6K,GAAQ,GAEzC,GAAIC,EACF,OAAQA,GACN,KAAKR,EAAoB,OAAOD,EAChC,KAAKE,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAC/B,KAAKO,EAAe,OAAON,EAC3B,KAAKO,EAAmB,OAAON,EAGnC,OAAO9qB,CACT,GAGFnR,EAAOC,QAAUitB,C,WC7CjBltB,EAAOC,QAJP,SAAkBksB,EAAQ7I,GACxB,OAAiB,MAAV6I,OAAiB7jB,EAAY6jB,EAAO7I,EAC7C,C,iBCVA,IAAImM,EAAW,EAAQ,KACnBvE,EAAc,EAAQ,IACtB1K,EAAU,EAAQ,MAClB4K,EAAU,EAAQ,MAClBmH,EAAW,EAAQ,MACnB7C,EAAQ,EAAQ,MAiCpB1vB,EAAOC,QAtBP,SAAiBksB,EAAQ1V,EAAMmmB,GAO7B,IAJA,IAAItqB,GAAS,EACT/O,GAHJkT,EAAOgZ,EAAShZ,EAAM0V,IAGJ5oB,OACd4N,GAAS,IAEJmB,EAAQ/O,GAAQ,CACvB,IAAI+f,EAAMoM,EAAMjZ,EAAKnE,IACrB,KAAMnB,EAAmB,MAAVgb,GAAkByQ,EAAQzQ,EAAQ7I,IAC/C,MAEF6I,EAASA,EAAO7I,EAClB,CACA,OAAInS,KAAYmB,GAAS/O,EAChB4N,KAET5N,EAAmB,MAAV4oB,EAAiB,EAAIA,EAAO5oB,SAClBgvB,EAAShvB,IAAW6nB,EAAQ9H,EAAK/f,KACjDid,EAAQ2L,IAAWjB,EAAYiB,GACpC,C,WCnCA,IAWI0Q,EAAezK,OAAO,uFAa1BpyB,EAAOC,QAJP,SAAoB01B,GAClB,OAAOkH,EAAavK,KAAKqD,EAC3B,C,iBCvBA,IAAImH,EAAe,EAAQ,MAc3B98B,EAAOC,QALP,WACE6E,KAAK+kB,SAAWiT,EAAeA,EAAa,MAAQ,CAAC,EACrDh4B,KAAKwX,KAAO,CACd,C,WCIAtc,EAAOC,QANP,SAAoBqjB,GAClB,IAAInS,EAASrM,KAAKpD,IAAI4hB,WAAexe,KAAK+kB,SAASvG,GAEnD,OADAxe,KAAKwX,MAAQnL,EAAS,EAAI,EACnBA,CACT,C,iBCdA,IAAI2rB,EAAe,EAAQ,MASvBxR,EAHctE,OAAO5hB,UAGQkmB,eAoBjCtrB,EAAOC,QATP,SAAiBqjB,GACf,IAAI8G,EAAOtlB,KAAK+kB,SAChB,GAAIiT,EAAc,CAChB,IAAI3rB,EAASiZ,EAAK9G,GAClB,MArBiB,8BAqBVnS,OAA4B7I,EAAY6I,CACjD,CACA,OAAOma,EAAezD,KAAKuC,EAAM9G,GAAO8G,EAAK9G,QAAOhb,CACtD,C,iBC3BA,IAAIw0B,EAAe,EAAQ,MAMvBxR,EAHctE,OAAO5hB,UAGQkmB,eAgBjCtrB,EAAOC,QALP,SAAiBqjB,GACf,IAAI8G,EAAOtlB,KAAK+kB,SAChB,OAAOiT,OAA8Bx0B,IAAd8hB,EAAK9G,GAAsBgI,EAAezD,KAAKuC,EAAM9G,EAC9E,C,iBCpBA,IAAIwZ,EAAe,EAAQ,MAsB3B98B,EAAOC,QAPP,SAAiBqjB,EAAKxD,GACpB,IAAIsK,EAAOtlB,KAAK+kB,SAGhB,OAFA/kB,KAAKwX,MAAQxX,KAAKpD,IAAI4hB,GAAO,EAAI,EACjC8G,EAAK9G,GAAQwZ,QAA0Bx0B,IAAVwX,EAfV,4BAekDA,EAC9Dhb,IACT,C,WCnBA,IAGIwmB,EAHctE,OAAO5hB,UAGQkmB,eAqBjCtrB,EAAOC,QAZP,SAAwB0qB,GACtB,IAAIpnB,EAASonB,EAAMpnB,OACf4N,EAAS,IAAIwZ,EAAMnE,YAAYjjB,GAOnC,OAJIA,GAA6B,iBAAZonB,EAAM,IAAkBW,EAAezD,KAAK8C,EAAO,WACtExZ,EAAOmB,MAAQqY,EAAMrY,MACrBnB,EAAO4rB,MAAQpS,EAAMoS,OAEhB5rB,CACT,C,iBCvBA,IAAIomB,EAAmB,EAAQ,MAC3ByF,EAAgB,EAAQ,MACxBC,EAAc,EAAQ,MACtBC,EAAc,EAAQ,MACtBpJ,EAAkB,EAAQ,MAwE9B9zB,EAAOC,QApCP,SAAwBksB,EAAQvE,EAAKoG,GACnC,IAAI0O,EAAOvQ,EAAO3F,YAClB,OAAQoB,GACN,IA3BiB,uBA4Bf,OAAO2P,EAAiBpL,GAE1B,IAvCU,mBAwCV,IAvCU,gBAwCR,OAAO,IAAIuQ,GAAMvQ,GAEnB,IAjCc,oBAkCZ,OAAO6Q,EAAc7Q,EAAQ6B,GAE/B,IAnCa,wBAmCI,IAlCJ,wBAmCb,IAlCU,qBAkCI,IAjCH,sBAiCkB,IAhClB,sBAiCX,IAhCW,sBAgCI,IA/BG,6BA+BmB,IA9BzB,uBA8ByC,IA7BzC,uBA8BV,OAAO8F,EAAgB3H,EAAQ6B,GAEjC,IAjDS,eA2DT,IAxDS,eAyDP,OAAO,IAAI0O,EARb,IAnDY,kBAoDZ,IAjDY,kBAkDV,OAAO,IAAIA,EAAKvQ,GAElB,IAtDY,kBAuDV,OAAO8Q,EAAY9Q,GAKrB,IAzDY,kBA0DV,OAAO+Q,EAAY/Q,GAEzB,C,iBC1EA,IAAIsC,EAAa,EAAQ,MACrB0M,EAAe,EAAQ,MACvBtI,EAAc,EAAQ,MAe1B7yB,EAAOC,QANP,SAAyBksB,GACvB,MAAqC,mBAAtBA,EAAO3F,aAA8BqM,EAAY1G,GAE5D,CAAC,EADDsC,EAAW0M,EAAahP,GAE9B,C,iBCfA,IAAI9B,EAAS,EAAQ,MACjBa,EAAc,EAAQ,IACtB1K,EAAU,EAAQ,MAGlB2c,EAAmB9S,EAASA,EAAO+S,wBAAqB90B,EAc5DtI,EAAOC,QALP,SAAuB6f,GACrB,OAAOU,EAAQV,IAAUoL,EAAYpL,OAChCqd,GAAoBrd,GAASA,EAAMqd,GAC1C,C,WChBA,IAGIE,EAAW,mBAoBfr9B,EAAOC,QAVP,SAAiB6f,EAAOvc,GACtB,IAAIsb,SAAciB,EAGlB,SAFAvc,EAAmB,MAAVA,EAfY,iBAewBA,KAGlC,UAARsb,GACU,UAARA,GAAoBwe,EAAS/K,KAAKxS,KAChCA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,EAAQvc,CACjD,C,iBCtBA,IAAI2oB,EAAK,EAAQ,MACb+G,EAAc,EAAQ,MACtB7H,EAAU,EAAQ,MAClBmC,EAAW,EAAQ,MA0BvBvtB,EAAOC,QAdP,SAAwB6f,EAAOxN,EAAO6Z,GACpC,IAAKoB,EAASpB,GACZ,OAAO,EAET,IAAItN,SAAcvM,EAClB,SAAY,UAARuM,EACKoU,EAAY9G,IAAWf,EAAQ9Y,EAAO6Z,EAAO5oB,QACrC,UAARsb,GAAoBvM,KAAS6Z,IAE7BD,EAAGC,EAAO7Z,GAAQwN,EAG7B,C,gBC3BA,IAAIU,EAAU,EAAQ,MAClBsO,EAAW,EAAQ,KAGnBwO,EAAe,mDACfC,EAAgB,QAuBpBv9B,EAAOC,QAbP,SAAe6f,EAAOqM,GACpB,GAAI3L,EAAQV,GACV,OAAO,EAET,IAAIjB,SAAciB,EAClB,QAAY,UAARjB,GAA4B,UAARA,GAA4B,WAARA,GAC/B,MAATiB,IAAiBgP,EAAShP,KAGvByd,EAAcjL,KAAKxS,KAAWwd,EAAahL,KAAKxS,IAC1C,MAAVqM,GAAkBrM,KAASkH,OAAOmF,EACvC,C,SCZAnsB,EAAOC,QAPP,SAAmB6f,GACjB,IAAIjB,SAAciB,EAClB,MAAgB,UAARjB,GAA4B,UAARA,GAA4B,UAARA,GAA4B,WAARA,EACrD,cAAViB,EACU,OAAVA,CACP,C,iBCZA,IAIM0d,EAJFvE,EAAa,EAAQ,MAGrBwE,GACED,EAAM,SAAS5F,KAAKqB,GAAcA,EAAW5V,MAAQ4V,EAAW5V,KAAKqa,UAAY,KACvE,iBAAmBF,EAAO,GAc1Cx9B,EAAOC,QAJP,SAAkBuqB,GAChB,QAASiT,GAAeA,KAAcjT,CACxC,C,WChBA,IAAIyH,EAAcjL,OAAO5hB,UAgBzBpF,EAAOC,QAPP,SAAqB6f,GACnB,IAAI4c,EAAO5c,GAASA,EAAM0G,YAG1B,OAAO1G,KAFqB,mBAAR4c,GAAsBA,EAAKt3B,WAAc6sB,EAG/D,C,iBCfA,IAAI1E,EAAW,EAAQ,MAcvBvtB,EAAOC,QAJP,SAA4B6f,GAC1B,OAAOA,GAAUA,IAAUyN,EAASzN,EACtC,C,WCAA9f,EAAOC,QALP,WACE6E,KAAK+kB,SAAW,GAChB/kB,KAAKwX,KAAO,CACd,C,iBCVA,IAAIqhB,EAAe,EAAQ,MAMvBC,EAHaxrB,MAAMhN,UAGCw4B,OA4BxB59B,EAAOC,QAjBP,SAAyBqjB,GACvB,IAAI8G,EAAOtlB,KAAK+kB,SACZvX,EAAQqrB,EAAavT,EAAM9G,GAE/B,QAAIhR,EAAQ,IAIRA,GADY8X,EAAK7mB,OAAS,EAE5B6mB,EAAK1V,MAELkpB,EAAO/V,KAAKuC,EAAM9X,EAAO,KAEzBxN,KAAKwX,KACA,GACT,C,iBChCA,IAAIqhB,EAAe,EAAQ,MAkB3B39B,EAAOC,QAPP,SAAsBqjB,GACpB,IAAI8G,EAAOtlB,KAAK+kB,SACZvX,EAAQqrB,EAAavT,EAAM9G,GAE/B,OAAOhR,EAAQ,OAAIhK,EAAY8hB,EAAK9X,GAAO,EAC7C,C,iBChBA,IAAIqrB,EAAe,EAAQ,MAe3B39B,EAAOC,QAJP,SAAsBqjB,GACpB,OAAOqa,EAAa74B,KAAK+kB,SAAUvG,IAAQ,CAC7C,C,gBCbA,IAAIqa,EAAe,EAAQ,MAyB3B39B,EAAOC,QAbP,SAAsBqjB,EAAKxD,GACzB,IAAIsK,EAAOtlB,KAAK+kB,SACZvX,EAAQqrB,EAAavT,EAAM9G,GAQ/B,OANIhR,EAAQ,KACRxN,KAAKwX,KACP8N,EAAKvoB,KAAK,CAACyhB,EAAKxD,KAEhBsK,EAAK9X,GAAO,GAAKwN,EAEZhb,IACT,C,iBCvBA,IAAIyjB,EAAO,EAAQ,MACfS,EAAY,EAAQ,MACpBC,EAAM,EAAQ,MAkBlBjpB,EAAOC,QATP,WACE6E,KAAKwX,KAAO,EACZxX,KAAK+kB,SAAW,CACd,KAAQ,IAAItB,EACZ,IAAO,IAAKU,GAAOD,GACnB,OAAU,IAAIT,EAElB,C,iBClBA,IAAIsV,EAAa,EAAQ,MAiBzB79B,EAAOC,QANP,SAAwBqjB,GACtB,IAAInS,EAAS0sB,EAAW/4B,KAAMwe,GAAa,OAAEA,GAE7C,OADAxe,KAAKwX,MAAQnL,EAAS,EAAI,EACnBA,CACT,C,gBCfA,IAAI0sB,EAAa,EAAQ,MAezB79B,EAAOC,QAJP,SAAqBqjB,GACnB,OAAOua,EAAW/4B,KAAMwe,GAAKoF,IAAIpF,EACnC,C,gBCbA,IAAIua,EAAa,EAAQ,MAezB79B,EAAOC,QAJP,SAAqBqjB,GACnB,OAAOua,EAAW/4B,KAAMwe,GAAK5hB,IAAI4hB,EACnC,C,iBCbA,IAAIua,EAAa,EAAQ,MAqBzB79B,EAAOC,QATP,SAAqBqjB,EAAKxD,GACxB,IAAIsK,EAAOyT,EAAW/4B,KAAMwe,GACxBhH,EAAO8N,EAAK9N,KAIhB,OAFA8N,EAAK3B,IAAInF,EAAKxD,GACdhb,KAAKwX,MAAQ8N,EAAK9N,MAAQA,EAAO,EAAI,EAC9BxX,IACT,C,WCFA9E,EAAOC,QAVP,SAAoBuH,GAClB,IAAI8K,GAAS,EACTnB,EAASiB,MAAM5K,EAAI8U,MAKvB,OAHA9U,EAAIlG,SAAQ,SAASwe,EAAOwD,GAC1BnS,IAASmB,GAAS,CAACgR,EAAKxD,EAC1B,IACO3O,CACT,C,WCIAnR,EAAOC,QAVP,SAAiCqjB,EAAKoO,GACpC,OAAO,SAASvF,GACd,OAAc,MAAVA,GAGGA,EAAO7I,KAASoO,SACPppB,IAAbopB,GAA2BpO,KAAO0D,OAAOmF,GAC9C,CACF,C,iBCjBA,IAAI2R,EAAU,EAAQ,MAyBtB99B,EAAOC,QAZP,SAAuBuqB,GACrB,IAAIrZ,EAAS2sB,EAAQtT,GAAM,SAASlH,GAIlC,OAfmB,MAYfuT,EAAMva,MACRua,EAAMrO,QAEDlF,CACT,IAEIuT,EAAQ1lB,EAAO0lB,MACnB,OAAO1lB,CACT,C,iBCvBA,IAGI2rB,EAHY,EAAQ,KAGL7U,CAAUjB,OAAQ,UAErChnB,EAAOC,QAAU68B,C,iBCLjB,IAGIhK,EAHU,EAAQ,KAGLsI,CAAQpU,OAAO3D,KAAM2D,QAEtChnB,EAAOC,QAAU6yB,C,WCcjB9yB,EAAOC,QAVP,SAAsBksB,GACpB,IAAIhb,EAAS,GACb,GAAc,MAAVgb,EACF,IAAK,IAAI7I,KAAO0D,OAAOmF,GACrBhb,EAAOtP,KAAKyhB,GAGhB,OAAOnS,CACT,C,4BCjBA,IAAI2pB,EAAa,EAAQ,MAGrB7D,EAA4Ch3B,IAAYA,EAAQi3B,UAAYj3B,EAG5Ek3B,EAAaF,GAA4Cj3B,IAAWA,EAAOk3B,UAAYl3B,EAMvF+9B,EAHgB5G,GAAcA,EAAWl3B,UAAYg3B,GAGtB6D,EAAWkD,QAG1CC,EAAY,WACd,IAIE,OAFY9G,GAAcA,EAAW+G,SAAW/G,EAAW+G,QAAQ,QAAQC,OAOpEJ,GAAeA,EAAYK,SAAWL,EAAYK,QAAQ,OACnE,CAAE,MAAOp9B,GAAI,CACf,CAZe,GAcfhB,EAAOC,QAAUg+B,C,WC5BjB,IAOI3C,EAPctU,OAAO5hB,UAOcG,SAavCvF,EAAOC,QAJP,SAAwB6f,GACtB,OAAOwb,EAAqBzT,KAAK/H,EACnC,C,WCLA9f,EAAOC,QANP,SAAiBuqB,EAAM3J,GACrB,OAAO,SAASwd,GACd,OAAO7T,EAAK3J,EAAUwd,GACxB,CACF,C,iBCZA,IAAI3T,EAAQ,EAAQ,MAGhBwK,EAAY9tB,KAAKC,IAgCrBrH,EAAOC,QArBP,SAAkBuqB,EAAMnO,EAAOwE,GAE7B,OADAxE,EAAQ6Y,OAAoB5sB,IAAV+T,EAAuBmO,EAAKjnB,OAAS,EAAK8Y,EAAO,GAC5D,WAML,IALA,IAAI0J,EAAO9H,UACP3L,GAAS,EACT/O,EAAS2xB,EAAUnP,EAAKxiB,OAAS8Y,EAAO,GACxCsO,EAAQvY,MAAM7O,KAET+O,EAAQ/O,GACfonB,EAAMrY,GAASyT,EAAK1J,EAAQ/J,GAE9BA,GAAS,EAET,IADA,IAAIgsB,EAAYlsB,MAAMiK,EAAQ,KACrB/J,EAAQ+J,GACfiiB,EAAUhsB,GAASyT,EAAKzT,GAG1B,OADAgsB,EAAUjiB,GAASwE,EAAU8J,GACtBD,EAAMF,EAAM1lB,KAAMw5B,EAC3B,CACF,C,gBCjCA,IAAIxD,EAAa,EAAQ,MAGrByD,EAA0B,iBAAR3Y,MAAoBA,MAAQA,KAAKoB,SAAWA,QAAUpB,KAGxExW,EAAO0rB,GAAcyD,GAAYvM,SAAS,cAATA,GAErChyB,EAAOC,QAAUmP,C,WCYjBpP,EAAOC,QAZP,SAAiBksB,EAAQ7I,GACvB,IAAY,gBAARA,GAAgD,mBAAhB6I,EAAO7I,KAIhC,aAAPA,EAIJ,OAAO6I,EAAO7I,EAChB,C,WCAAtjB,EAAOC,QALP,SAAqB6f,GAEnB,OADAhb,KAAK+kB,SAASpB,IAAI3I,EAbC,6BAcZhb,IACT,C,WCHA9E,EAAOC,QAJP,SAAqB6f,GACnB,OAAOhb,KAAK+kB,SAASnoB,IAAIoe,EAC3B,C,WCMA9f,EAAOC,QAVP,SAAoBwoB,GAClB,IAAInW,GAAS,EACTnB,EAASiB,MAAMqW,EAAInM,MAKvB,OAHAmM,EAAInnB,SAAQ,SAASwe,GACnB3O,IAASmB,GAASwN,CACpB,IACO3O,CACT,C,iBCfA,IAAIukB,EAAkB,EAAQ,MAW1BH,EAVW,EAAQ,KAULiJ,CAAS9I,GAE3B11B,EAAOC,QAAUs1B,C,WCZjB,IAIIkJ,EAAYC,KAAK1vB,IA+BrBhP,EAAOC,QApBP,SAAkBuqB,GAChB,IAAImU,EAAQ,EACRC,EAAa,EAEjB,OAAO,WACL,IAAIC,EAAQJ,IACRK,EApBO,IAoBiBD,EAAQD,GAGpC,GADAA,EAAaC,EACTC,EAAY,GACd,KAAMH,GAzBI,IA0BR,OAAO1gB,UAAU,QAGnB0gB,EAAQ,EAEV,OAAOnU,EAAKE,WAAMpiB,EAAW2V,UAC/B,CACF,C,iBClCA,IAAI+K,EAAY,EAAQ,MAcxBhpB,EAAOC,QALP,WACE6E,KAAK+kB,SAAW,IAAIb,EACpBlkB,KAAKwX,KAAO,CACd,C,WCKAtc,EAAOC,QARP,SAAqBqjB,GACnB,IAAI8G,EAAOtlB,KAAK+kB,SACZ1Y,EAASiZ,EAAa,OAAE9G,GAG5B,OADAxe,KAAKwX,KAAO8N,EAAK9N,KACVnL,CACT,C,UCFAnR,EAAOC,QAJP,SAAkBqjB,GAChB,OAAOxe,KAAK+kB,SAASnB,IAAIpF,EAC3B,C,WCEAtjB,EAAOC,QAJP,SAAkBqjB,GAChB,OAAOxe,KAAK+kB,SAASnoB,IAAI4hB,EAC3B,C,iBCXA,IAAI0F,EAAY,EAAQ,MACpBC,EAAM,EAAQ,MACdM,EAAW,EAAQ,MA+BvBvpB,EAAOC,QAhBP,SAAkBqjB,EAAKxD,GACrB,IAAIsK,EAAOtlB,KAAK+kB,SAChB,GAAIO,aAAgBpB,EAAW,CAC7B,IAAI+V,EAAQ3U,EAAKP,SACjB,IAAKZ,GAAQ8V,EAAMx7B,OAASy7B,IAG1B,OAFAD,EAAMl9B,KAAK,CAACyhB,EAAKxD,IACjBhb,KAAKwX,OAAS8N,EAAK9N,KACZxX,KAETslB,EAAOtlB,KAAK+kB,SAAW,IAAIN,EAASwV,EACtC,CAGA,OAFA3U,EAAK3B,IAAInF,EAAKxD,GACdhb,KAAKwX,KAAO8N,EAAK9N,KACVxX,IACT,C,UCTA9E,EAAOC,QAZP,SAAuB0qB,EAAO7K,EAAOmP,GAInC,IAHA,IAAI3c,EAAQ2c,EAAY,EACpB1rB,EAASonB,EAAMpnB,SAEV+O,EAAQ/O,GACf,GAAIonB,EAAMrY,KAAWwN,EACnB,OAAOxN,EAGX,OAAQ,CACV,C,iBCpBA,IAAIyZ,EAAY,EAAQ,KACpBkT,EAAa,EAAQ,MACrBC,EAAc,EAAQ,MAe1Bl/B,EAAOC,QANP,SAAoB01B,GAClB,OAAOsJ,EAAWtJ,GACduJ,EAAYvJ,GACZ5J,EAAU4J,EAChB,C,iBCfA,IAAIwJ,EAAgB,EAAQ,MAGxBC,EAAa,mGAGbC,EAAe,WASfvI,EAAeqI,GAAc,SAASxJ,GACxC,IAAIxkB,EAAS,GAOb,OAN6B,KAAzBwkB,EAAO2J,WAAW,IACpBnuB,EAAOtP,KAAK,IAEd8zB,EAAOtD,QAAQ+M,GAAY,SAASG,EAAOC,EAAQC,EAAOC,GACxDvuB,EAAOtP,KAAK49B,EAAQC,EAAUrN,QAAQgN,EAAc,MAASG,GAAUD,EACzE,IACOpuB,CACT,IAEAnR,EAAOC,QAAU62B,C,iBC1BjB,IAAIhI,EAAW,EAAQ,KAoBvB9uB,EAAOC,QARP,SAAe6f,GACb,GAAoB,iBAATA,GAAqBgP,EAAShP,GACvC,OAAOA,EAET,IAAI3O,EAAU2O,EAAQ,GACtB,MAAkB,KAAV3O,GAAkB,EAAI2O,IAAU,IAAa,KAAO3O,CAC9D,C,UCjBA,IAGI+gB,EAHYF,SAAS5sB,UAGIG,SAqB7BvF,EAAOC,QAZP,SAAkBuqB,GAChB,GAAY,MAARA,EAAc,CAChB,IACE,OAAO0H,EAAarK,KAAK2C,EAC3B,CAAE,MAAOxpB,GAAI,CACb,IACE,OAAQwpB,EAAO,EACjB,CAAE,MAAOxpB,GAAI,CACf,CACA,MAAO,EACT,C,WCtBA,IAAI2+B,EAAe,KAiBnB3/B,EAAOC,QAPP,SAAyB01B,GAGvB,IAFA,IAAIrjB,EAAQqjB,EAAOpyB,OAEZ+O,KAAWqtB,EAAarN,KAAKqD,EAAOiK,OAAOttB,MAClD,OAAOA,CACT,C,WCfA,IAAIutB,EAAgB,kBAQhBC,EAAW,IAAMD,EAAgB,IACjCE,EAAU,kDACVC,EAAS,2BAETC,EAAc,KAAOJ,EAAgB,IACrCK,EAAa,kCACbC,EAAa,qCAIbC,EAPa,MAAQL,EAAU,IAAMC,EAO1BK,KACXC,EAAW,oBAEXC,EAAQD,EAAWF,EADP,gBAAwB,CAACH,EAAaC,EAAYC,GAAYx6B,KAAK,KAAO,IAAM26B,EAAWF,EAAW,KAElHI,EAAW,MAAQ,CAACP,EAAcF,EAAU,IAAKA,EAASG,EAAYC,EAAYL,GAAUn6B,KAAK,KAAO,IAGxG86B,EAAYrO,OAAO4N,EAAS,MAAQA,EAAS,KAAOQ,EAAWD,EAAO,KAiB1EvgC,EAAOC,QARP,SAAqB01B,GAEnB,IADA,IAAIxkB,EAASsvB,EAAUjL,UAAY,EAC5BiL,EAAUnO,KAAKqD,MAClBxkB,EAEJ,OAAOA,CACT,C,iBCzCA,IAAI0c,EAAY,EAAQ,MAmCxB7tB,EAAOC,QAJP,SAAe6f,GACb,OAAO+N,EAAU/N,EA7BM,EA8BzB,C,iBCjCA,IAAI+N,EAAY,EAAQ,MA4BxB7tB,EAAOC,QAJP,SAAmB6f,GACjB,OAAO+N,EAAU/N,EAAO4gB,EAC1B,C,WCDA1gC,EAAOC,QANP,SAAkB6f,GAChB,OAAO,WACL,OAAOA,CACT,CACF,C,iBCvBA,IAAIoZ,EAAW,EAAQ,MACnBhN,EAAK,EAAQ,MACbiN,EAAiB,EAAQ,MACzB7M,EAAS,EAAQ,MAGjB2F,EAAcjL,OAAO5hB,UAGrBkmB,EAAiB2G,EAAY3G,eAuB7BvhB,EAAWmvB,GAAS,SAAS/M,EAAQrkB,GACvCqkB,EAASnF,OAAOmF,GAEhB,IAAI7Z,GAAS,EACT/O,EAASuE,EAAQvE,OACjB81B,EAAQ91B,EAAS,EAAIuE,EAAQ,QAAKQ,EAMtC,IAJI+wB,GAASF,EAAerxB,EAAQ,GAAIA,EAAQ,GAAIuxB,KAClD91B,EAAS,KAGF+O,EAAQ/O,GAMf,IALA,IAAIgR,EAASzM,EAAQwK,GACjBgc,EAAQhC,EAAO/X,GACfosB,GAAc,EACdC,EAActS,EAAM/qB,SAEfo9B,EAAaC,GAAa,CACjC,IAAItd,EAAMgL,EAAMqS,GACZ7gB,EAAQqM,EAAO7I,SAELhb,IAAVwX,GACCoM,EAAGpM,EAAOmS,EAAY3O,MAAUgI,EAAezD,KAAKsE,EAAQ7I,MAC/D6I,EAAO7I,GAAO/O,EAAO+O,GAEzB,CAGF,OAAO6I,CACT,IAEAnsB,EAAOC,QAAU8J,C,gBC/DjB/J,EAAOC,QAAU,EAAjB,K,WCoCAD,EAAOC,QAJP,SAAY6f,EAAO3K,GACjB,OAAO2K,IAAU3K,GAAU2K,GAAUA,GAAS3K,GAAUA,CAC1D,C,iBClCA,IAAIsmB,EAAc,EAAQ,MACtBoF,EAAa,EAAQ,MACrBtM,EAAe,EAAQ,MACvB/T,EAAU,EAAQ,MAgDtBxgB,EAAOC,QALP,SAAgB2f,EAAYiL,GAE1B,OADWrK,EAAQZ,GAAc6b,EAAcoF,GACnCjhB,EAAY2U,EAAa1J,EAAW,GAClD,C,gBCjDA,IAuCIjc,EAvCa,EAAQ,KAuCdkyB,CAtCK,EAAQ,OAwCxB9gC,EAAOC,QAAU2O,C,iBCzCjB,IAAIqhB,EAAgB,EAAQ,KACxBsE,EAAe,EAAQ,MACvBwM,EAAY,EAAQ,MAGpB7L,EAAY9tB,KAAKC,IAiDrBrH,EAAOC,QAZP,SAAmB0qB,EAAOE,EAAWoE,GACnC,IAAI1rB,EAAkB,MAATonB,EAAgB,EAAIA,EAAMpnB,OACvC,IAAKA,EACH,OAAQ,EAEV,IAAI+O,EAAqB,MAAb2c,EAAoB,EAAI8R,EAAU9R,GAI9C,OAHI3c,EAAQ,IACVA,EAAQ4iB,EAAU3xB,EAAS+O,EAAO,IAE7B2d,EAActF,EAAO4J,EAAa1J,EAAW,GAAIvY,EAC1D,C,iBCpDA,IAAI+c,EAAc,EAAQ,MAqB1BrvB,EAAOC,QALP,SAAiB0qB,GAEf,OADsB,MAATA,GAAoBA,EAAMpnB,OACvB8rB,EAAY1E,EAAO,GAAK,EAC1C,C,iBCnBA,IAAI6B,EAAY,EAAQ,MACpBoC,EAAW,EAAQ,KACnBoS,EAAe,EAAQ,MACvBxgB,EAAU,EAAQ,MAqCtBxgB,EAAOC,QALP,SAAiB2f,EAAYgL,GAE3B,OADWpK,EAAQZ,GAAc4M,EAAYoC,GACjChP,EAAYohB,EAAapW,GACvC,C,iBCtCA,IAAI2E,EAAU,EAAQ,MAClByR,EAAe,EAAQ,MACvB1U,EAAS,EAAQ,MAoCrBtsB,EAAOC,QANP,SAAeksB,EAAQvB,GACrB,OAAiB,MAAVuB,EACHA,EACAoD,EAAQpD,EAAQ6U,EAAapW,GAAW0B,EAC9C,C,iBCpCA,IAAIgI,EAAU,EAAQ,MAgCtBt0B,EAAOC,QALP,SAAaksB,EAAQ1V,EAAMwqB,GACzB,IAAI9vB,EAAmB,MAAVgb,OAAiB7jB,EAAYgsB,EAAQnI,EAAQ1V,GAC1D,YAAkBnO,IAAX6I,EAAuB8vB,EAAe9vB,CAC/C,C,iBC9BA,IAAI+vB,EAAU,EAAQ,MAClBC,EAAU,EAAQ,MAiCtBnhC,EAAOC,QAJP,SAAaksB,EAAQ1V,GACnB,OAAiB,MAAV0V,GAAkBgV,EAAQhV,EAAQ1V,EAAMyqB,EACjD,C,iBChCA,IAAIE,EAAY,EAAQ,MACpBD,EAAU,EAAQ,MAgCtBnhC,EAAOC,QAJP,SAAeksB,EAAQ1V,GACrB,OAAiB,MAAV0V,GAAkBgV,EAAQhV,EAAQ1V,EAAM2qB,EACjD,C,WCXAphC,EAAOC,QAJP,SAAkB6f,GAChB,OAAOA,CACT,C,eClBA,IAAIuhB,EAAkB,EAAQ,MAC1BhR,EAAe,EAAQ,MAGvB4B,EAAcjL,OAAO5hB,UAGrBkmB,EAAiB2G,EAAY3G,eAG7BqQ,EAAuB1J,EAAY0J,qBAoBnCzQ,EAAcmW,EAAgB,WAAa,OAAOpjB,SAAW,CAA/B,IAAsCojB,EAAkB,SAASvhB,GACjG,OAAOuQ,EAAavQ,IAAUwL,EAAezD,KAAK/H,EAAO,YACtD6b,EAAqB9T,KAAK/H,EAAO,SACtC,EAEA9f,EAAOC,QAAUirB,C,WCZjB,IAAI1K,EAAUpO,MAAMoO,QAEpBxgB,EAAOC,QAAUugB,C,iBCzBjB,IAAImF,EAAa,EAAQ,MACrB4M,EAAW,EAAQ,MA+BvBvyB,EAAOC,QAJP,SAAqB6f,GACnB,OAAgB,MAATA,GAAiByS,EAASzS,EAAMvc,UAAYoiB,EAAW7F,EAChE,C,iBC9BA,IAAImT,EAAc,EAAQ,MACtB5C,EAAe,EAAQ,MA+B3BrwB,EAAOC,QAJP,SAA2B6f,GACzB,OAAOuQ,EAAavQ,IAAUmT,EAAYnT,EAC5C,C,4BC9BA,IAAI1Q,EAAO,EAAQ,KACfkyB,EAAY,EAAQ,MAGpBrK,EAA4Ch3B,IAAYA,EAAQi3B,UAAYj3B,EAG5Ek3B,EAAaF,GAA4Cj3B,IAAWA,EAAOk3B,UAAYl3B,EAMvFo3B,EAHgBD,GAAcA,EAAWl3B,UAAYg3B,EAG5B7nB,EAAKgoB,YAAS9uB,EAsBvC6iB,GAnBiBiM,EAASA,EAAOjM,cAAW7iB,IAmBfg5B,EAEjCthC,EAAOC,QAAUkrB,C,iBCrCjB,IAAIoW,EAAW,EAAQ,MACnBrU,EAAS,EAAQ,MACjBhC,EAAc,EAAQ,IACtB1K,EAAU,EAAQ,MAClByS,EAAc,EAAQ,MACtB9H,EAAW,EAAQ,MACnB0H,EAAc,EAAQ,MACtBxH,EAAe,EAAQ,MAUvBC,EAHctE,OAAO5hB,UAGQkmB,eA2DjCtrB,EAAOC,QAxBP,SAAiB6f,GACf,GAAa,MAATA,EACF,OAAO,EAET,GAAImT,EAAYnT,KACXU,EAAQV,IAA0B,iBAATA,GAA4C,mBAAhBA,EAAM8d,QAC1DzS,EAASrL,IAAUuL,EAAavL,IAAUoL,EAAYpL,IAC1D,OAAQA,EAAMvc,OAEhB,IAAIqkB,EAAMsF,EAAOpN,GACjB,GApDW,gBAoDP8H,GAnDO,gBAmDUA,EACnB,OAAQ9H,EAAMxD,KAEhB,GAAIuW,EAAY/S,GACd,OAAQyhB,EAASzhB,GAAOvc,OAE1B,IAAK,IAAI+f,KAAOxD,EACd,GAAIwL,EAAezD,KAAK/H,EAAOwD,GAC7B,OAAO,EAGX,OAAO,CACT,C,iBC1EA,IAAI8M,EAAa,EAAQ,MACrB7C,EAAW,EAAQ,MAmCvBvtB,EAAOC,QAVP,SAAoB6f,GAClB,IAAKyN,EAASzN,GACZ,OAAO,EAIT,IAAI8H,EAAMwI,EAAWtQ,GACrB,MA5BY,qBA4BL8H,GA3BI,8BA2BcA,GA7BZ,0BA6B6BA,GA1B7B,kBA0BgDA,CAC/D,C,WCAA5nB,EAAOC,QALP,SAAkB6f,GAChB,MAAuB,iBAATA,GACZA,GAAS,GAAKA,EAAQ,GAAK,GAAKA,GA9Bb,gBA+BvB,C,iBChCA,IAAI0hB,EAAY,EAAQ,MACpB9M,EAAY,EAAQ,MACpBuJ,EAAW,EAAQ,MAGnBwD,EAAYxD,GAAYA,EAAS3Q,MAmBjCA,EAAQmU,EAAY/M,EAAU+M,GAAaD,EAE/CxhC,EAAOC,QAAUqtB,C,WCIjBttB,EAAOC,QALP,SAAkB6f,GAChB,IAAIjB,SAAciB,EAClB,OAAgB,MAATA,IAA0B,UAARjB,GAA4B,YAARA,EAC/C,C,WCAA7e,EAAOC,QAJP,SAAsB6f,GACpB,OAAgB,MAATA,GAAiC,iBAATA,CACjC,C,iBC1BA,IAAIsQ,EAAa,EAAQ,MACrB+K,EAAe,EAAQ,MACvB9K,EAAe,EAAQ,MAMvB0B,EAAYC,SAAS5sB,UACrB6sB,EAAcjL,OAAO5hB,UAGrB8sB,EAAeH,EAAUxsB,SAGzB+lB,EAAiB2G,EAAY3G,eAG7BoW,EAAmBxP,EAAarK,KAAKb,QA2CzChnB,EAAOC,QAbP,SAAuB6f,GACrB,IAAKuQ,EAAavQ,IA5CJ,mBA4CcsQ,EAAWtQ,GACrC,OAAO,EAET,IAAI4O,EAAQyM,EAAarb,GACzB,GAAc,OAAV4O,EACF,OAAO,EAET,IAAIgO,EAAOpR,EAAezD,KAAK6G,EAAO,gBAAkBA,EAAMlI,YAC9D,MAAsB,mBAARkW,GAAsBA,aAAgBA,GAClDxK,EAAarK,KAAK6U,IAASgF,CAC/B,C,iBC3DA,IAAIC,EAAY,EAAQ,MACpBjN,EAAY,EAAQ,MACpBuJ,EAAW,EAAQ,MAGnB2D,EAAY3D,GAAYA,EAASzQ,MAmBjCA,EAAQoU,EAAYlN,EAAUkN,GAAaD,EAE/C3hC,EAAOC,QAAUutB,C,iBC1BjB,IAAI4C,EAAa,EAAQ,MACrB5P,EAAU,EAAQ,MAClB6P,EAAe,EAAQ,MA2B3BrwB,EAAOC,QALP,SAAkB6f,GAChB,MAAuB,iBAATA,IACVU,EAAQV,IAAUuQ,EAAavQ,IArBrB,mBAqB+BsQ,EAAWtQ,EAC1D,C,gBC3BA,IAAIsQ,EAAa,EAAQ,MACrBC,EAAe,EAAQ,MA2B3BrwB,EAAOC,QALP,SAAkB6f,GAChB,MAAuB,iBAATA,GACXuQ,EAAavQ,IArBF,mBAqBYsQ,EAAWtQ,EACvC,C,iBC1BA,IAAI+hB,EAAmB,EAAQ,KAC3BnN,EAAY,EAAQ,MACpBuJ,EAAW,EAAQ,MAGnB6D,EAAmB7D,GAAYA,EAAS5S,aAmBxCA,EAAeyW,EAAmBpN,EAAUoN,GAAoBD,EAEpE7hC,EAAOC,QAAUorB,C,WCLjBrrB,EAAOC,QAJP,SAAqB6f,GACnB,YAAiBxX,IAAVwX,CACT,C,iBCnBA,IAAIiiB,EAAgB,EAAQ,MACxBR,EAAW,EAAQ,MACnBtO,EAAc,EAAQ,MAkC1BjzB,EAAOC,QAJP,SAAcksB,GACZ,OAAO8G,EAAY9G,GAAU4V,EAAc5V,GAAUoV,EAASpV,EAChE,C,iBClCA,IAAI4V,EAAgB,EAAQ,MACxBC,EAAa,EAAQ,MACrB/O,EAAc,EAAQ,MA6B1BjzB,EAAOC,QAJP,SAAgBksB,GACd,OAAO8G,EAAY9G,GAAU4V,EAAc5V,GAAQ,GAAQ6V,EAAW7V,EACxE,C,WCVAnsB,EAAOC,QALP,SAAc0qB,GACZ,IAAIpnB,EAAkB,MAATonB,EAAgB,EAAIA,EAAMpnB,OACvC,OAAOA,EAASonB,EAAMpnB,EAAS,QAAK+E,CACtC,C,iBCjBA,IAAI+rB,EAAW,EAAQ,MACnBE,EAAe,EAAQ,MACvBC,EAAU,EAAQ,MAClBhU,EAAU,EAAQ,MAiDtBxgB,EAAOC,QALP,SAAa2f,EAAYgL,GAEvB,OADWpK,EAAQZ,GAAcyU,EAAWG,GAChC5U,EAAY2U,EAAa3J,EAAU,GACjD,C,iBClDA,IAAIqB,EAAkB,EAAQ,MAC1B0C,EAAa,EAAQ,MACrB4F,EAAe,EAAQ,MAwC3Bv0B,EAAOC,QAVP,SAAmBksB,EAAQvB,GACzB,IAAIzZ,EAAS,CAAC,EAMd,OALAyZ,EAAW2J,EAAa3J,EAAU,GAElC+D,EAAWxC,GAAQ,SAASrM,EAAOwD,EAAK6I,GACtCF,EAAgB9a,EAAQmS,EAAKsH,EAAS9K,EAAOwD,EAAK6I,GACpD,IACOhb,CACT,C,iBCxCA,IAAI8wB,EAAe,EAAQ,MACvBC,EAAS,EAAQ,MACjBvP,EAAW,EAAQ,MA0BvB3yB,EAAOC,QANP,SAAa0qB,GACX,OAAQA,GAASA,EAAMpnB,OACnB0+B,EAAatX,EAAOgI,EAAUuP,QAC9B55B,CACN,C,iBC1BA,IAAIihB,EAAW,EAAQ,MAiDvB,SAASuU,EAAQtT,EAAM2X,GACrB,GAAmB,mBAAR3X,GAAmC,MAAZ2X,GAAuC,mBAAZA,EAC3D,MAAM,IAAIC,UAhDQ,uBAkDpB,IAAIC,EAAW,WACb,IAAItc,EAAO9H,UACPqF,EAAM6e,EAAWA,EAASzX,MAAM5lB,KAAMihB,GAAQA,EAAK,GACnD8Q,EAAQwL,EAASxL,MAErB,GAAIA,EAAMn1B,IAAI4hB,GACZ,OAAOuT,EAAMnO,IAAIpF,GAEnB,IAAInS,EAASqZ,EAAKE,MAAM5lB,KAAMihB,GAE9B,OADAsc,EAASxL,MAAQA,EAAMpO,IAAInF,EAAKnS,IAAW0lB,EACpC1lB,CACT,EAEA,OADAkxB,EAASxL,MAAQ,IAAKiH,EAAQwE,OAAS/Y,GAChC8Y,CACT,CAGAvE,EAAQwE,MAAQ/Y,EAEhBvpB,EAAOC,QAAU69B,C,iBCxEjB,IAAInK,EAAY,EAAQ,MAkCpBlqB,EAjCiB,EAAQ,KAiCjB84B,EAAe,SAASpW,EAAQ5X,EAAQqf,GAClDD,EAAUxH,EAAQ5X,EAAQqf,EAC5B,IAEA5zB,EAAOC,QAAUwJ,C,iBCtCjB,IAAIw4B,EAAe,EAAQ,MACvBO,EAAS,EAAQ,MACjB7P,EAAW,EAAQ,MA0BvB3yB,EAAOC,QANP,SAAa0qB,GACX,OAAQA,GAASA,EAAMpnB,OACnB0+B,EAAatX,EAAOgI,EAAU6P,QAC9Bl6B,CACN,C,iBC1BA,IAAI25B,EAAe,EAAQ,MACvB1N,EAAe,EAAQ,MACvBiO,EAAS,EAAQ,MA+BrBxiC,EAAOC,QANP,SAAe0qB,EAAOC,GACpB,OAAQD,GAASA,EAAMpnB,OACnB0+B,EAAatX,EAAO4J,EAAa3J,EAAU,GAAI4X,QAC/Cl6B,CACN,C,WCfAtI,EAAOC,QAJP,WAEA,C,iBCdA,IAAImP,EAAO,EAAQ,KAsBnBpP,EAAOC,QAJG,WACR,OAAOmP,EAAKsvB,KAAK1vB,KACnB,C,gBCpBA,IAAIyzB,EAAW,EAAQ,MAoBnB54B,EAnBW,EAAQ,KAmBZ64B,EAAS,SAASvW,EAAQ4I,GACnC,OAAiB,MAAV5I,EAAiB,CAAC,EAAIsW,EAAStW,EAAQ4I,EAChD,IAEA/0B,EAAOC,QAAU4J,C,iBCxBjB,IAAImiB,EAAe,EAAQ,MACvB2W,EAAmB,EAAQ,MAC3BrP,EAAQ,EAAQ,KAChB5D,EAAQ,EAAQ,MA4BpB1vB,EAAOC,QAJP,SAAkBwW,GAChB,OAAO6c,EAAM7c,GAAQuV,EAAa0D,EAAMjZ,IAASksB,EAAiBlsB,EACpE,C,iBC7BA,IA2CIlP,EA3Cc,EAAQ,KA2Cdq7B,GAEZ5iC,EAAOC,QAAUsH,C,iBC7CjB,IAAIs7B,EAAc,EAAQ,MACtBjU,EAAW,EAAQ,KACnB2F,EAAe,EAAQ,MACvBuO,EAAa,EAAQ,MACrBtiB,EAAU,EAAQ,MA8CtBxgB,EAAOC,QAPP,SAAgB2f,EAAYgL,EAAUiB,GACpC,IAAIrB,EAAOhK,EAAQZ,GAAcijB,EAAcC,EAC3ChX,EAAY7N,UAAU1a,OAAS,EAEnC,OAAOinB,EAAK5K,EAAY2U,EAAa3J,EAAU,GAAIiB,EAAaC,EAAW8C,EAC7E,C,iBChDA,IAAI2S,EAAW,EAAQ,MACnBrU,EAAS,EAAQ,MACjB+F,EAAc,EAAQ,MACtB8P,EAAW,EAAQ,MACnBC,EAAa,EAAQ,MAyCzBhjC,EAAOC,QAdP,SAAc2f,GACZ,GAAkB,MAAdA,EACF,OAAO,EAET,GAAIqT,EAAYrT,GACd,OAAOmjB,EAASnjB,GAAcojB,EAAWpjB,GAAcA,EAAWrc,OAEpE,IAAIqkB,EAAMsF,EAAOtN,GACjB,MAhCW,gBAgCPgI,GA/BO,gBA+BUA,EACZhI,EAAWtD,KAEbilB,EAAS3hB,GAAYrc,MAC9B,C,iBC3CA,IAAI8rB,EAAc,EAAQ,MACtB4T,EAAc,EAAQ,MACtB/J,EAAW,EAAQ,MACnBC,EAAiB,EAAQ,MA+BzBlqB,EAASiqB,GAAS,SAAStZ,EAAYgV,GACzC,GAAkB,MAAdhV,EACF,MAAO,GAET,IAAIrc,EAASqxB,EAAUrxB,OAMvB,OALIA,EAAS,GAAK41B,EAAevZ,EAAYgV,EAAU,GAAIA,EAAU,IACnEA,EAAY,GACHrxB,EAAS,GAAK41B,EAAevE,EAAU,GAAIA,EAAU,GAAIA,EAAU,MAC5EA,EAAY,CAACA,EAAU,KAElBqO,EAAYrjB,EAAYyP,EAAYuF,EAAW,GAAI,GAC5D,IAEA50B,EAAOC,QAAUgP,C,WCzBjBjP,EAAOC,QAJP,WACE,MAAO,EACT,C,WCHAD,EAAOC,QAJP,WACE,OAAO,CACT,C,iBCfA,IAAIijC,EAAW,EAAQ,MAGnBC,EAAW,IAsCfnjC,EAAOC,QAZP,SAAkB6f,GAChB,OAAKA,GAGLA,EAAQojB,EAASpjB,MACHqjB,GAAYrjB,KAAU,IA9BpB,uBA+BFA,EAAQ,GAAK,EAAI,GAGxBA,GAAUA,EAAQA,EAAQ,EAPd,IAAVA,EAAcA,EAAQ,CAQjC,C,iBCvCA,IAAI2Z,EAAW,EAAQ,MAmCvBz5B,EAAOC,QAPP,SAAmB6f,GACjB,IAAI3O,EAASsoB,EAAS3Z,GAClBsjB,EAAYjyB,EAAS,EAEzB,OAAOA,GAAWA,EAAUiyB,EAAYjyB,EAASiyB,EAAYjyB,EAAU,CACzE,C,iBCjCA,IAAIkyB,EAAW,EAAQ,MACnB9V,EAAW,EAAQ,MACnBuB,EAAW,EAAQ,KAMnBwU,EAAa,qBAGbC,EAAa,aAGbC,EAAY,cAGZC,EAAeC,SA8CnB1jC,EAAOC,QArBP,SAAkB6f,GAChB,GAAoB,iBAATA,EACT,OAAOA,EAET,GAAIgP,EAAShP,GACX,OA1CM,IA4CR,GAAIyN,EAASzN,GAAQ,CACnB,IAAI3K,EAAgC,mBAAjB2K,EAAMgY,QAAwBhY,EAAMgY,UAAYhY,EACnEA,EAAQyN,EAASpY,GAAUA,EAAQ,GAAMA,CAC3C,CACA,GAAoB,iBAAT2K,EACT,OAAiB,IAAVA,EAAcA,GAASA,EAEhCA,EAAQujB,EAASvjB,GACjB,IAAI6jB,EAAWJ,EAAWjR,KAAKxS,GAC/B,OAAQ6jB,GAAYH,EAAUlR,KAAKxS,GAC/B2jB,EAAa3jB,EAAMvI,MAAM,GAAIosB,EAAW,EAAI,GAC3CL,EAAWhR,KAAKxS,GAvDb,KAuD6BA,CACvC,C,gBC7DA,IAAIuM,EAAa,EAAQ,MACrBC,EAAS,EAAQ,MA8BrBtsB,EAAOC,QAJP,SAAuB6f,GACrB,OAAOuM,EAAWvM,EAAOwM,EAAOxM,GAClC,C,gBC7BA,IAAIkW,EAAe,EAAQ,MA2B3Bh2B,EAAOC,QAJP,SAAkB6f,GAChB,OAAgB,MAATA,EAAgB,GAAKkW,EAAalW,EAC3C,C,iBCzBA,IAAI0M,EAAY,EAAQ,MACpBiC,EAAa,EAAQ,MACrBE,EAAa,EAAQ,MACrB4F,EAAe,EAAQ,MACvB4G,EAAe,EAAQ,MACvB3a,EAAU,EAAQ,MAClB2K,EAAW,EAAQ,MACnBxF,EAAa,EAAQ,MACrB4H,EAAW,EAAQ,MACnBlC,EAAe,EAAQ,MAuD3BrrB,EAAOC,QAvBP,SAAmBksB,EAAQvB,EAAUiB,GACnC,IAAIL,EAAQhL,EAAQ2L,GAChByX,EAAYpY,GAASL,EAASgB,IAAWd,EAAac,GAG1D,GADAvB,EAAW2J,EAAa3J,EAAU,GACf,MAAfiB,EAAqB,CACvB,IAAI6Q,EAAOvQ,GAAUA,EAAO3F,YAE1BqF,EADE+X,EACYpY,EAAQ,IAAIkR,EAAO,GAE1BnP,EAASpB,IACFxG,EAAW+W,GAAQjO,EAAW0M,EAAahP,IAG3C,CAAC,CAEnB,CAIA,OAHCyX,EAAYpX,EAAYmC,GAAYxC,GAAQ,SAASrM,EAAOxN,EAAO6Z,GAClE,OAAOvB,EAASiB,EAAa/L,EAAOxN,EAAO6Z,EAC7C,IACON,CACT,C,iBC9DA,IAAIwD,EAAc,EAAQ,MACtB6J,EAAW,EAAQ,MACnB2K,EAAW,EAAQ,MACnB9P,EAAoB,EAAQ,MAkB5B3N,EAAQ8S,GAAS,SAAS4K,GAC5B,OAAOD,EAASxU,EAAYyU,EAAQ,EAAG/P,GAAmB,GAC5D,IAEA/zB,EAAOC,QAAUmmB,C,gBCzBjB,IAAI7gB,EAAW,EAAQ,KAGnBw+B,EAAY,EAwBhB/jC,EAAOC,QALP,SAAkByC,GAChB,IAAIshC,IAAOD,EACX,OAAOx+B,EAAS7C,GAAUshC,CAC5B,C,iBCzBA,IAAIC,EAAa,EAAQ,KACrB5gB,EAAO,EAAQ,MAgCnBrjB,EAAOC,QAJP,SAAgBksB,GACd,OAAiB,MAAVA,EAAiB,GAAK8X,EAAW9X,EAAQ9I,EAAK8I,GACvD,C,iBC/BA,IAAIM,EAAc,EAAQ,MACtByX,EAAgB,EAAQ,MAsB5BlkC,EAAOC,QAJP,SAAmBquB,EAAOpf,GACxB,OAAOg1B,EAAc5V,GAAS,GAAIpf,GAAU,GAAIud,EAClD,C,yECjBA,SAAS0X,EAAQpH,GACf,IAQIqH,EARA5c,EAAUvJ,UAAU1a,OAAS,QAAsB+E,IAAjB2V,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,KAAK,IAAA0J,YAAWoV,GACd,MAAM,IAAIqF,UAAU,0BACf,GAAqB,IAAjBrF,EAAMx5B,OACf,MAAM,IAAI6+B,UAAU,2BAKtB,QAAuB95B,IAAnBkf,EAAQ4c,OAAsB,CAChC,KAAK,IAAAzc,YAAWH,EAAQ4c,QACtB,MAAM,IAAIhC,UAAU,+CAGtBgC,EAAS5c,EAAQ4c,MACnB,MACEA,EAAS,IAAIhyB,MAAM2qB,EAAMx5B,QAG3B,IAAI8gC,ECvBN,SAAatH,GACX,IAAIvV,EAAUvJ,UAAU1a,OAAS,QAAsB+E,IAAjB2V,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,KAAK,IAAA0J,YAAWoV,GACd,MAAM,IAAIqF,UAAU,0BAGtB,GAAqB,IAAjBrF,EAAMx5B,OACR,MAAM,IAAI6+B,UAAU,2BAGtB,IAAIkC,EAAqB9c,EAAQyH,UAC7BA,OAAmC,IAAvBqV,EAAgC,EAAIA,EAChDC,EAAmB/c,EAAQgd,QAC3BA,OAA+B,IAArBD,EAA8BxH,EAAMx5B,OAASghC,EAE3D,GAAItV,EAAY,GAAKA,GAAa8N,EAAMx5B,SAAWiJ,OAAOi4B,UAAUxV,GAClE,MAAM,IAAIvP,MAAM,4DAGlB,GAAI8kB,GAAWvV,GAAauV,EAAUzH,EAAMx5B,SAAWiJ,OAAOi4B,UAAUD,GACtE,MAAM,IAAI9kB,MAAM,iFAKlB,IAFA,IAAIglB,EAAW3H,EAAM9N,GAEZ3oB,EAAI2oB,EAAY,EAAG3oB,EAAIk+B,EAASl+B,IACnCy2B,EAAMz2B,GAAKo+B,IAAUA,EAAW3H,EAAMz2B,IAG5C,OAAOo+B,CACT,CDRmBv3B,CAAI4vB,GACjB4H,EExBN,SAAa5H,GACX,IAAIvV,EAAUvJ,UAAU1a,OAAS,QAAsB+E,IAAjB2V,UAAU,GAAmBA,UAAU,GAAK,CAAC,EAEnF,KAAK,IAAA0J,YAAWoV,GACd,MAAM,IAAIqF,UAAU,0BAGtB,GAAqB,IAAjBrF,EAAMx5B,OACR,MAAM,IAAI6+B,UAAU,2BAGtB,IAAIkC,EAAqB9c,EAAQyH,UAC7BA,OAAmC,IAAvBqV,EAAgC,EAAIA,EAChDC,EAAmB/c,EAAQgd,QAC3BA,OAA+B,IAArBD,EAA8BxH,EAAMx5B,OAASghC,EAE3D,GAAItV,EAAY,GAAKA,GAAa8N,EAAMx5B,SAAWiJ,OAAOi4B,UAAUxV,GAClE,MAAM,IAAIvP,MAAM,4DAGlB,GAAI8kB,GAAWvV,GAAauV,EAAUzH,EAAMx5B,SAAWiJ,OAAOi4B,UAAUD,GACtE,MAAM,IAAI9kB,MAAM,iFAKlB,IAFA,IAAIklB,EAAW7H,EAAM9N,GAEZ3oB,EAAI2oB,EAAY,EAAG3oB,EAAIk+B,EAASl+B,IACnCy2B,EAAMz2B,GAAKs+B,IAAUA,EAAW7H,EAAMz2B,IAG5C,OAAOs+B,CACT,CFPmBv9B,CAAI01B,GAErB,GAAIsH,IAAeM,EACjB,MAAM,IAAIE,WAAW,+EAGvB,IAAIC,EAAetd,EAAQra,IACvBu3B,OAA4B,IAAjBI,EAA0Btd,EAAQud,WAAaV,EAAa,EAAIS,EAC3EE,EAAexd,EAAQngB,IACvBu9B,OAA4B,IAAjBI,EAA0Bxd,EAAQud,WAAaJ,EAAa,EAAIK,EAE/E,GAAIN,GAAYE,EACd,MAAM,IAAIC,WAAW,8CAKvB,IAFA,IAAII,GAAUL,EAAWF,IAAaC,EAAaN,GAE1C/9B,EAAI,EAAGA,EAAIy2B,EAAMx5B,OAAQ+C,IAChC89B,EAAO99B,IAAMy2B,EAAMz2B,GAAK+9B,GAAcY,EAASP,EAGjD,OAAON,CACT,C,8BG5CA,IAAIzc,EAAa,EAAQ,MACrBwc,EAAU,EAAQ,KAEtB,MAAMe,EAAS,IAAIC,OAAO,GACpBC,EAAa,IAAID,OAAO,GAM9B,SAASE,EAAyBC,EAAQ9d,EAAU,CAAC,GACnD,MAAM,QACJ+d,EAAU,GAAE,WACZC,EAAa,GAAE,WACfC,EAAa,EAAC,SACdC,EAAW,QACTle,EACJ,MAAO,GAAG8d,EAAO9e,YAAYtkB,WAC7BgjC,OACAE,IAOF,SAAqBE,EAAQC,EAASC,EAAYC,EAAYC,GAC5D,MAAM,KAAEC,EAAI,QAAEC,GAAYN,EACpBO,EAAOz+B,KAAK+F,IAAIw4B,EAAMJ,GACtBO,EAAO1+B,KAAK+F,IAAIy4B,EAASJ,GACzBr0B,EAAS,GAEf,GAAiB,SAAbu0B,EAAqB,CACvBA,GAAW,EACXK,EAAM,IAAK,IAAIz/B,EAAI,EAAGA,EAAIu/B,EAAMv/B,IAC9B,IAAK,IAAIwb,EAAI,EAAGA,EAAIgkB,EAAMhkB,IACxB,GAAIwjB,EAAO5c,IAAIpiB,EAAGwb,GAAK,EAAG,CACxB4jB,GAAW,EACX,MAAMK,CACR,CAGN,CAEA,IAAK,IAAIz/B,EAAI,EAAGA,EAAIu/B,EAAMv/B,IAAK,CAC7B,IAAI0/B,EAAO,GACX,IAAK,IAAIlkB,EAAI,EAAGA,EAAIgkB,EAAMhkB,IACxBkkB,EAAKnkC,KAAKokC,EAAaX,EAAO5c,IAAIpiB,EAAGwb,GAAI2jB,EAAYC,IAEvDv0B,EAAOtP,KAAK,GAAGmkC,EAAKrgC,KAAK,OAC3B,CAOA,OANImgC,IAASF,IACXz0B,EAAOA,EAAO5N,OAAS,IAAM,QAAQqiC,EAAUJ,kBAE7CK,IAASF,GACXx0B,EAAOtP,KAAK,OAAO8jC,EAAOJ,eAErBp0B,EAAOxL,KAAK,KAAKy/B,IAC1B,CAvCec,CAAYZ,EAAQC,EAASC,EAAYC,EAAYC,OAClER,OACAA,UAAeI,EAAOK,SACtBT,aAAkBI,EAAOM,YAE3B,CAoCA,SAASK,EAAaE,EAAKV,EAAYC,GACrC,OACES,GAAO,GAAKT,EACR,IAAIU,EAAcD,EAAKV,EAAa,KACpCW,EAAcD,EAAKV,IACvBY,OAAOZ,EACX,CAEA,SAASW,EAAcD,EAAKG,GAE1B,IAAIC,EAAMJ,EAAI5gC,WACd,GAAIghC,EAAIhjC,QAAU+iC,EAAK,OAAOC,EAI9B,IAAIC,EAAML,EAAIM,QAAQH,GAItB,GAHIE,EAAIjjC,OAAS+iC,IACfE,EAAML,EAAIM,QAAQr/B,KAAKC,IAAI,EAAGi/B,GAAOE,EAAIjjC,OAAS+iC,MAGlDE,EAAIjjC,QAAU+iC,IACbE,EAAIE,WAAW,WACfF,EAAIE,WAAW,UAEhB,OAAOF,EAIT,IAAIG,EAAMR,EAAIS,cAAcN,GAI5B,OAHIK,EAAIpjC,OAAS+iC,IACfK,EAAMR,EAAIS,cAAcx/B,KAAKC,IAAI,EAAGi/B,GAAOK,EAAIpjC,OAAS+iC,MAEnDK,EAAIpvB,MAAM,EACnB,CAi0BA,SAASsvB,EAAcvB,EAAQhzB,EAAOmkB,GACpC,IAAIpvB,EAAMovB,EAAQ6O,EAAOK,KAAOL,EAAOK,KAAO,EAC9C,GAAIrzB,EAAQ,GAAKA,EAAQjL,EACvB,MAAM,IAAIw9B,WAAW,yBAEzB,CASA,SAASiC,EAAiBxB,EAAQhzB,EAAOmkB,GACvC,IAAIpvB,EAAMovB,EAAQ6O,EAAOM,QAAUN,EAAOM,QAAU,EACpD,GAAItzB,EAAQ,GAAKA,EAAQjL,EACvB,MAAM,IAAIw9B,WAAW,4BAEzB,CAUA,SAASkC,EAAezB,EAAQ0B,GAI9B,GAHIA,EAAOC,YACTD,EAASA,EAAOC,aAEdD,EAAOzjC,SAAW+hC,EAAOM,QAC3B,MAAM,IAAIf,WACR,yDAGJ,OAAOmC,CACT,CAUA,SAASE,EAAkB5B,EAAQ0B,GAIjC,GAHIA,EAAOC,YACTD,EAASA,EAAOC,aAEdD,EAAOzjC,SAAW+hC,EAAOK,KAC3B,MAAM,IAAId,WAAW,sDAEvB,OAAOmC,CACT,CAEA,SAASG,EAAgB7B,EAAQ8B,GAC/B,IAAKzf,EAAWA,WAAWyf,GACzB,MAAM,IAAIhF,UAAU,gCAGtB,IAAK,IAAI97B,EAAI,EAAGA,EAAI8gC,EAAW7jC,OAAQ+C,IACrC,GAAI8gC,EAAW9gC,GAAK,GAAK8gC,EAAW9gC,IAAMg/B,EAAOK,KAC/C,MAAM,IAAId,WAAW,+BAG3B,CAEA,SAASwC,EAAmB/B,EAAQgC,GAClC,IAAK3f,EAAWA,WAAW2f,GACzB,MAAM,IAAIlF,UAAU,mCAGtB,IAAK,IAAI97B,EAAI,EAAGA,EAAIghC,EAAc/jC,OAAQ+C,IACxC,GAAIghC,EAAchhC,GAAK,GAAKghC,EAAchhC,IAAMg/B,EAAOM,QACrD,MAAM,IAAIf,WAAW,kCAG3B,CAEA,SAAS0C,EAAWjC,EAAQkC,EAAUC,EAAQC,EAAaC,GACzD,GAAyB,IAArB1pB,UAAU1a,OACZ,MAAM,IAAIshC,WAAW,wBAMvB,GAJA+C,EAAY,WAAYJ,GACxBI,EAAY,SAAUH,GACtBG,EAAY,cAAeF,GAC3BE,EAAY,YAAaD,GAEvBH,EAAWC,GACXC,EAAcC,GACdH,EAAW,GACXA,GAAYlC,EAAOK,MACnB8B,EAAS,GACTA,GAAUnC,EAAOK,MACjB+B,EAAc,GACdA,GAAepC,EAAOM,SACtB+B,EAAY,GACZA,GAAarC,EAAOM,QAEpB,MAAM,IAAIf,WAAW,qCAEzB,CAEA,SAASgD,EAAStkC,EAAQuc,EAAQ,GAChC,IAAI6K,EAAQ,GACZ,IAAK,IAAIrkB,EAAI,EAAGA,EAAI/C,EAAQ+C,IAC1BqkB,EAAM9oB,KAAKie,GAEb,OAAO6K,CACT,CAEA,SAASid,EAAY1lC,EAAM4d,GACzB,GAAqB,iBAAVA,EACT,MAAM,IAAIsiB,UAAU,GAAGlgC,qBAE3B,CAEA,SAAS4lC,EAAcxC,GACrB,GAAIA,EAAOzf,UACT,MAAM,IAAInG,MAAM,wCAEpB,CAqNA,MAAMqoB,EACJ,kBAAOC,CAAYC,EAASC,EAAYC,GAEtC,GADaF,EAAUC,IACRC,EAAQ5kC,OACrB,MAAM,IAAIshC,WAAW,+CAEvB,IAAIuD,EAAY,IAAIC,EAAOJ,EAASC,GACpC,IAAK,IAAII,EAAM,EAAGA,EAAML,EAASK,IAC/B,IAAK,IAAIC,EAAS,EAAGA,EAASL,EAAYK,IACxCH,EAAU3f,IAAI6f,EAAKC,EAAQJ,EAAQG,EAAMJ,EAAaK,IAG1D,OAAOH,CACT,CAEA,gBAAOI,CAAUL,GACf,IAAInB,EAAS,IAAIqB,EAAO,EAAGF,EAAQ5kC,QACnC,IAAK,IAAI+C,EAAI,EAAGA,EAAI6hC,EAAQ5kC,OAAQ+C,IAClC0gC,EAAOve,IAAI,EAAGniB,EAAG6hC,EAAQ7hC,IAE3B,OAAO0gC,CACT,CAEA,mBAAOyB,CAAaN,GAClB,IAAInB,EAAS,IAAIqB,EAAOF,EAAQ5kC,OAAQ,GACxC,IAAK,IAAI+C,EAAI,EAAGA,EAAI6hC,EAAQ5kC,OAAQ+C,IAClC0gC,EAAOve,IAAIniB,EAAG,EAAG6hC,EAAQ7hC,IAE3B,OAAO0gC,CACT,CAEA,YAAO0B,CAAM/C,EAAMC,GACjB,OAAO,IAAIyC,EAAO1C,EAAMC,EAC1B,CAEA,WAAO+C,CAAKhD,EAAMC,GAChB,OAAO,IAAIyC,EAAO1C,EAAMC,GAASgD,KAAK,EACxC,CAEA,WAAOC,CAAKlD,EAAMC,EAASpe,EAAU,CAAC,GACpC,GAAuB,iBAAZA,EACT,MAAM,IAAI4a,UAAU,6BAEtB,MAAM,OAAE0G,EAAS1hC,KAAK0hC,QAAWthB,EACjC,IAAI8d,EAAS,IAAI+C,EAAO1C,EAAMC,GAC9B,IAAK,IAAIt/B,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxB,IAAK,IAAIwb,EAAI,EAAGA,EAAI8jB,EAAS9jB,IAC3BwjB,EAAO7c,IAAIniB,EAAGwb,EAAGgnB,KAGrB,OAAOxD,CACT,CAEA,cAAOyD,CAAQpD,EAAMC,EAASpe,EAAU,CAAC,GACvC,GAAuB,iBAAZA,EACT,MAAM,IAAI4a,UAAU,6BAEtB,MAAM,IAAEj1B,EAAM,EAAC,IAAE9F,EAAM,IAAI,OAAEyhC,EAAS1hC,KAAK0hC,QAAWthB,EACtD,IAAKhb,OAAOi4B,UAAUt3B,GAAM,MAAM,IAAIi1B,UAAU,0BAChD,IAAK51B,OAAOi4B,UAAUp9B,GAAM,MAAM,IAAI+6B,UAAU,0BAChD,GAAIj1B,GAAO9F,EAAK,MAAM,IAAIw9B,WAAW,gCACrC,IAAImE,EAAW3hC,EAAM8F,EACjBm4B,EAAS,IAAI+C,EAAO1C,EAAMC,GAC9B,IAAK,IAAIt/B,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxB,IAAK,IAAIwb,EAAI,EAAGA,EAAI8jB,EAAS9jB,IAAK,CAChC,IAAIhC,EAAQ3S,EAAM/F,KAAK6hC,MAAMH,IAAWE,GACxC1D,EAAO7c,IAAIniB,EAAGwb,EAAGhC,EACnB,CAEF,OAAOwlB,CACT,CAEA,UAAO4D,CAAIvD,EAAMC,EAAS9lB,QACRxX,IAAZs9B,IAAuBA,EAAUD,QACvBr9B,IAAVwX,IAAqBA,EAAQ,GACjC,IAAI3S,EAAM/F,KAAK+F,IAAIw4B,EAAMC,GACrBN,EAASxgC,KAAK4jC,MAAM/C,EAAMC,GAC9B,IAAK,IAAIt/B,EAAI,EAAGA,EAAI6G,EAAK7G,IACvBg/B,EAAO7c,IAAIniB,EAAGA,EAAGwZ,GAEnB,OAAOwlB,CACT,CAEA,WAAO6D,CAAK/e,EAAMub,EAAMC,GACtB,IAAI35B,EAAIme,EAAK7mB,YACA+E,IAATq9B,IAAoBA,EAAO15B,QACf3D,IAAZs9B,IAAuBA,EAAUD,GACrC,IAAIx4B,EAAM/F,KAAK+F,IAAIlB,EAAG05B,EAAMC,GACxBN,EAASxgC,KAAK4jC,MAAM/C,EAAMC,GAC9B,IAAK,IAAIt/B,EAAI,EAAGA,EAAI6G,EAAK7G,IACvBg/B,EAAO7c,IAAIniB,EAAGA,EAAG8jB,EAAK9jB,IAExB,OAAOg/B,CACT,CAEA,UAAOn4B,CAAIi8B,EAASC,GAClBD,EAAUtkC,KAAKwkC,YAAYF,GAC3BC,EAAUvkC,KAAKwkC,YAAYD,GAC3B,IAAI1D,EAAOyD,EAAQzD,KACfC,EAAUwD,EAAQxD,QAClBz0B,EAAS,IAAIk3B,EAAO1C,EAAMC,GAC9B,IAAK,IAAIt/B,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxB,IAAK,IAAIwb,EAAI,EAAGA,EAAI8jB,EAAS9jB,IAC3B3Q,EAAOsX,IAAIniB,EAAGwb,EAAG1a,KAAK+F,IAAIi8B,EAAQ1gB,IAAIpiB,EAAGwb,GAAIunB,EAAQ3gB,IAAIpiB,EAAGwb,KAGhE,OAAO3Q,CACT,CAEA,UAAO9J,CAAI+hC,EAASC,GAClBD,EAAUtkC,KAAKwkC,YAAYF,GAC3BC,EAAUvkC,KAAKwkC,YAAYD,GAC3B,IAAI1D,EAAOyD,EAAQzD,KACfC,EAAUwD,EAAQxD,QAClBz0B,EAAS,IAAIrM,KAAK6gC,EAAMC,GAC5B,IAAK,IAAIt/B,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxB,IAAK,IAAIwb,EAAI,EAAGA,EAAI8jB,EAAS9jB,IAC3B3Q,EAAOsX,IAAIniB,EAAGwb,EAAG1a,KAAKC,IAAI+hC,EAAQ1gB,IAAIpiB,EAAGwb,GAAIunB,EAAQ3gB,IAAIpiB,EAAGwb,KAGhE,OAAO3Q,CACT,CAEA,kBAAOm4B,CAAYxpB,GACjB,OAAOioB,EAAewB,SAASzpB,GAASA,EAAQ,IAAIuoB,EAAOvoB,EAC7D,CAEA,eAAOypB,CAASzpB,GACd,OAAgB,MAATA,GAAiC,WAAhBA,EAAM0pB,KAChC,CAEA,QAAIltB,GACF,OAAOxX,KAAK6gC,KAAO7gC,KAAK8gC,OAC1B,CAEA,KAAAlb,CAAM+e,GACJ,GAAwB,mBAAbA,EACT,MAAM,IAAIrH,UAAU,+BAEtB,IAAK,IAAI97B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChC2nB,EAAS5hB,KAAK/iB,KAAMwB,EAAGwb,GAG3B,OAAOhd,IACT,CAEA,SAAAmiC,GACE,IAAItc,EAAQ,GACZ,IAAK,IAAIrkB,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChC6I,EAAM9oB,KAAKiD,KAAK4jB,IAAIpiB,EAAGwb,IAG3B,OAAO6I,CACT,CAEA,SAAA+e,GACE,IAAInjB,EAAO,GACX,IAAK,IAAIjgB,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAAK,CAClCigB,EAAK1kB,KAAK,IACV,IAAK,IAAIigB,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChCyE,EAAKjgB,GAAGzE,KAAKiD,KAAK4jB,IAAIpiB,EAAGwb,GAE7B,CACA,OAAOyE,CACT,CAEA,MAAAojB,GACE,OAAO7kC,KAAK4kC,WACd,CAEA,WAAAE,GACE,OAAqB,IAAd9kC,KAAK6gC,IACd,CAEA,cAAAkE,GACE,OAAwB,IAAjB/kC,KAAK8gC,OACd,CAEA,QAAAkE,GACE,OAAqB,IAAdhlC,KAAK6gC,MAA+B,IAAjB7gC,KAAK8gC,OACjC,CAEA,QAAAmE,GACE,OAAOjlC,KAAK6gC,OAAS7gC,KAAK8gC,OAC5B,CAEA,OAAA/f,GACE,OAAqB,IAAd/gB,KAAK6gC,MAA+B,IAAjB7gC,KAAK8gC,OACjC,CAEA,WAAAoE,GACE,GAAIllC,KAAKilC,WAAY,CACnB,IAAK,IAAIzjC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,GAAKxb,EAAGwb,IACtB,GAAIhd,KAAK4jB,IAAIpiB,EAAGwb,KAAOhd,KAAK4jB,IAAI5G,EAAGxb,GACjC,OAAO,EAIb,OAAO,CACT,CACA,OAAO,CACT,CAEA,UAAA2jC,GACE,IAAKnlC,KAAKklC,cAAe,OAAO,EAEhC,IAAK,IAAI1jC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,GAAuB,IAAnBxB,KAAK4jB,IAAIpiB,EAAGA,GAAU,OAAO,EAGnC,OAAO,CACT,CAEA,aAAA4jC,GACE,IAAI5jC,EAAI,EACJwb,EAAI,EACJqoB,GAAkB,EAClBD,GAAgB,EAChBE,GAAU,EACd,KAAO9jC,EAAIxB,KAAK6gC,MAAQuE,GAAe,CAGrC,IAFApoB,EAAI,EACJsoB,GAAU,EACHtoB,EAAIhd,KAAK8gC,UAAuB,IAAZwE,GACF,IAAnBtlC,KAAK4jB,IAAIpiB,EAAGwb,GACdA,IAC4B,IAAnBhd,KAAK4jB,IAAIpiB,EAAGwb,IAAYA,EAAIqoB,GACrCC,GAAU,EACVD,EAAiBroB,IAEjBooB,GAAgB,EAChBE,GAAU,GAGd9jC,GACF,CACA,OAAO4jC,CACT,CAEA,oBAAAG,GACE,IAAI/jC,EAAI,EACJwb,EAAI,EACJqoB,GAAkB,EAClBE,GAAuB,EACvBD,GAAU,EACd,KAAO9jC,EAAIxB,KAAK6gC,MAAQ0E,GAAsB,CAG5C,IAFAvoB,EAAI,EACJsoB,GAAU,EACHtoB,EAAIhd,KAAK8gC,UAAuB,IAAZwE,GACF,IAAnBtlC,KAAK4jB,IAAIpiB,EAAGwb,GACdA,IAC4B,IAAnBhd,KAAK4jB,IAAIpiB,EAAGwb,IAAYA,EAAIqoB,GACrCC,GAAU,EACVD,EAAiBroB,IAEjBuoB,GAAuB,EACvBD,GAAU,GAGd,IAAK,IAAIjlC,EAAI2c,EAAI,EAAG3c,EAAIL,KAAK6gC,KAAMxgC,IACV,IAAnBL,KAAK4jB,IAAIpiB,EAAGnB,KACdklC,GAAuB,GAG3B/jC,GACF,CACA,OAAO+jC,CACT,CAEA,WAAAC,GACE,IAAIn5B,EAASrM,KAAK2iB,QACdzhB,EAAI,EACJb,EAAI,EACR,KAAOa,EAAImL,EAAOw0B,MAAQxgC,EAAIgM,EAAOy0B,SAAS,CAC5C,IAAI2E,EAAOvkC,EACX,IAAK,IAAIM,EAAIN,EAAGM,EAAI6K,EAAOw0B,KAAMr/B,IAC3B6K,EAAOuX,IAAIpiB,EAAGnB,GAAKgM,EAAOuX,IAAI6hB,EAAMplC,KACtColC,EAAOjkC,GAGX,GAA4B,IAAxB6K,EAAOuX,IAAI6hB,EAAMplC,GACnBA,QACK,CACLgM,EAAOq5B,SAASxkC,EAAGukC,GACnB,IAAIx2B,EAAM5C,EAAOuX,IAAI1iB,EAAGb,GACxB,IAAK,IAAI2c,EAAI3c,EAAG2c,EAAI3Q,EAAOy0B,QAAS9jB,IAClC3Q,EAAOsX,IAAIziB,EAAG8b,EAAG3Q,EAAOuX,IAAI1iB,EAAG8b,GAAK/N,GAEtC,IAAK,IAAIzN,EAAIN,EAAI,EAAGM,EAAI6K,EAAOw0B,KAAMr/B,IAAK,CACxC,IAAI2+B,EAAS9zB,EAAOuX,IAAIpiB,EAAGnB,GAAKgM,EAAOuX,IAAI1iB,EAAGb,GAC9CgM,EAAOsX,IAAIniB,EAAGnB,EAAG,GACjB,IAAK,IAAI2c,EAAI3c,EAAI,EAAG2c,EAAI3Q,EAAOy0B,QAAS9jB,IACtC3Q,EAAOsX,IAAIniB,EAAGwb,EAAG3Q,EAAOuX,IAAIpiB,EAAGwb,GAAK3Q,EAAOuX,IAAI1iB,EAAG8b,GAAKmjB,EAE3D,CACAj/B,IACAb,GACF,CACF,CACA,OAAOgM,CACT,CAEA,kBAAAs5B,GACE,IAAIt5B,EAASrM,KAAKwlC,cACdI,EAAIv5B,EAAOy0B,QACX/P,EAAI1kB,EAAOw0B,KACX3/B,EAAI6vB,EAAI,EACZ,KAAO7vB,GAAK,GACV,GAAyB,IAArBmL,EAAOw5B,OAAO3kC,GAChBA,QACK,CACL,IAAIoH,EAAI,EACJw9B,GAAQ,EACZ,KAAOx9B,EAAIyoB,IAAe,IAAV+U,GACW,IAArBz5B,EAAOuX,IAAI1iB,EAAGoH,GAChBw9B,GAAQ,EAERx9B,IAGJ,IAAK,IAAI9G,EAAI,EAAGA,EAAIN,EAAGM,IAAK,CAC1B,IAAI2+B,EAAS9zB,EAAOuX,IAAIpiB,EAAG8G,GAC3B,IAAK,IAAI0U,EAAI1U,EAAG0U,EAAI4oB,EAAG5oB,IAAK,CAC1B,IAAI/N,EAAM5C,EAAOuX,IAAIpiB,EAAGwb,GAAKmjB,EAAS9zB,EAAOuX,IAAI1iB,EAAG8b,GACpD3Q,EAAOsX,IAAIniB,EAAGwb,EAAG/N,EACnB,CACF,CACA/N,GACF,CAEF,OAAOmL,CACT,CAEA,GAAAsX,GACE,MAAM,IAAI/I,MAAM,8BAClB,CAEA,GAAAgJ,GACE,MAAM,IAAIhJ,MAAM,8BAClB,CAEA,MAAAylB,CAAO3d,EAAU,CAAC,GAChB,GAAuB,iBAAZA,EACT,MAAM,IAAI4a,UAAU,6BAEtB,MAAM,KAAEuD,EAAO,EAAC,QAAEC,EAAU,GAAMpe,EAClC,IAAKhb,OAAOi4B,UAAUkB,IAASA,GAAQ,EACrC,MAAM,IAAIvD,UAAU,mCAEtB,IAAK51B,OAAOi4B,UAAUmB,IAAYA,GAAW,EAC3C,MAAM,IAAIxD,UAAU,sCAEtB,IAAIkD,EAAS,IAAI+C,EAAOvjC,KAAK6gC,KAAOA,EAAM7gC,KAAK8gC,QAAUA,GACzD,IAAK,IAAIt/B,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxB,IAAK,IAAIwb,EAAI,EAAGA,EAAI8jB,EAAS9jB,IAC3BwjB,EAAOuF,aAAa/lC,KAAMA,KAAK6gC,KAAOr/B,EAAGxB,KAAK8gC,QAAU9jB,GAG5D,OAAOwjB,CACT,CAEA,IAAAsD,CAAK9oB,GACH,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhC,GAGnB,OAAOhb,IACT,CAEA,GAAAgmC,GACE,OAAOhmC,KAAKimC,MAAM,EACpB,CAEA,MAAAC,CAAO14B,GACLu0B,EAAc/hC,KAAMwN,GACpB,IAAIg2B,EAAM,GACV,IAAK,IAAIhiC,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAChCgiC,EAAIzmC,KAAKiD,KAAK4jB,IAAIpW,EAAOhM,IAE3B,OAAOgiC,CACT,CAEA,YAAA2C,CAAa34B,GACX,OAAO+1B,EAAOG,UAAU1jC,KAAKkmC,OAAO14B,GACtC,CAEA,MAAA44B,CAAO54B,EAAOqY,GACZkc,EAAc/hC,KAAMwN,GACpBqY,EAAQoc,EAAejiC,KAAM6lB,GAC7B,IAAK,IAAIrkB,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAChCxB,KAAK2jB,IAAInW,EAAOhM,EAAGqkB,EAAMrkB,IAE3B,OAAOxB,IACT,CAEA,QAAA0lC,CAASW,EAAMC,GACbvE,EAAc/hC,KAAMqmC,GACpBtE,EAAc/hC,KAAMsmC,GACpB,IAAK,IAAI9kC,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAAK,CACrC,IAAI+kC,EAAOvmC,KAAK4jB,IAAIyiB,EAAM7kC,GAC1BxB,KAAK2jB,IAAI0iB,EAAM7kC,EAAGxB,KAAK4jB,IAAI0iB,EAAM9kC,IACjCxB,KAAK2jB,IAAI2iB,EAAM9kC,EAAG+kC,EACpB,CACA,OAAOvmC,IACT,CAEA,SAAAwmC,CAAUh5B,GACRw0B,EAAiBhiC,KAAMwN,GACvB,IAAIi2B,EAAS,GACb,IAAK,IAAIjiC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7BiiC,EAAO1mC,KAAKiD,KAAK4jB,IAAIpiB,EAAGgM,IAE1B,OAAOi2B,CACT,CAEA,eAAAgD,CAAgBj5B,GACd,OAAO+1B,EAAOI,aAAa3jC,KAAKwmC,UAAUh5B,GAC5C,CAEA,SAAAk5B,CAAUl5B,EAAOqY,GACfmc,EAAiBhiC,KAAMwN,GACvBqY,EAAQuc,EAAkBpiC,KAAM6lB,GAChC,IAAK,IAAIrkB,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7BxB,KAAK2jB,IAAIniB,EAAGgM,EAAOqY,EAAMrkB,IAE3B,OAAOxB,IACT,CAEA,WAAA2mC,CAAYC,EAASC,GACnB7E,EAAiBhiC,KAAM4mC,GACvB5E,EAAiBhiC,KAAM6mC,GACvB,IAAK,IAAIrlC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAAK,CAClC,IAAI+kC,EAAOvmC,KAAK4jB,IAAIpiB,EAAGolC,GACvB5mC,KAAK2jB,IAAIniB,EAAGolC,EAAS5mC,KAAK4jB,IAAIpiB,EAAGqlC,IACjC7mC,KAAK2jB,IAAIniB,EAAGqlC,EAASN,EACvB,CACA,OAAOvmC,IACT,CAEA,YAAA8mC,CAAa5E,GACXA,EAASD,EAAejiC,KAAMkiC,GAC9B,IAAK,IAAI1gC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKklB,EAAOllB,IAG3C,OAAOhd,IACT,CAEA,YAAA+mC,CAAa7E,GACXA,EAASD,EAAejiC,KAAMkiC,GAC9B,IAAK,IAAI1gC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKklB,EAAOllB,IAG3C,OAAOhd,IACT,CAEA,YAAAgnC,CAAa9E,GACXA,EAASD,EAAejiC,KAAMkiC,GAC9B,IAAK,IAAI1gC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKklB,EAAOllB,IAG3C,OAAOhd,IACT,CAEA,YAAAinC,CAAa/E,GACXA,EAASD,EAAejiC,KAAMkiC,GAC9B,IAAK,IAAI1gC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKklB,EAAOllB,IAG3C,OAAOhd,IACT,CAEA,eAAAknC,CAAgBhF,GACdA,EAASE,EAAkBpiC,KAAMkiC,GACjC,IAAK,IAAI1gC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKklB,EAAO1gC,IAG3C,OAAOxB,IACT,CAEA,eAAAmnC,CAAgBjF,GACdA,EAASE,EAAkBpiC,KAAMkiC,GACjC,IAAK,IAAI1gC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKklB,EAAO1gC,IAG3C,OAAOxB,IACT,CAEA,eAAAonC,CAAgBlF,GACdA,EAASE,EAAkBpiC,KAAMkiC,GACjC,IAAK,IAAI1gC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKklB,EAAO1gC,IAG3C,OAAOxB,IACT,CAEA,eAAAqnC,CAAgBnF,GACdA,EAASE,EAAkBpiC,KAAMkiC,GACjC,IAAK,IAAI1gC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKklB,EAAO1gC,IAG3C,OAAOxB,IACT,CAEA,MAAAsnC,CAAO95B,EAAOwN,GACZ+mB,EAAc/hC,KAAMwN,GACpB,IAAK,IAAIhM,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAChCxB,KAAK2jB,IAAInW,EAAOhM,EAAGxB,KAAK4jB,IAAIpW,EAAOhM,GAAKwZ,GAE1C,OAAOhb,IACT,CAEA,SAAAunC,CAAU/5B,EAAOwN,GACfgnB,EAAiBhiC,KAAMwN,GACvB,IAAK,IAAIhM,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7BxB,KAAK2jB,IAAIniB,EAAGgM,EAAOxN,KAAK4jB,IAAIpiB,EAAGgM,GAASwN,GAE1C,OAAOhb,IACT,CAEA,GAAAuC,CAAIilC,GACF,GAAIxnC,KAAK+gB,UACP,OAAO0mB,IAET,OAAQD,GACN,IAAK,MAAO,CACV,MAAMjlC,EAAM,IAAI+K,MAAMtN,KAAK6gC,MAAMiD,KAAKp8B,OAAOgO,mBAC7C,IAAK,IAAI8tB,EAAM,EAAGA,EAAMxjC,KAAK6gC,KAAM2C,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASzjC,KAAK8gC,QAAS2C,IACtCzjC,KAAK4jB,IAAI4f,EAAKC,GAAUlhC,EAAIihC,KAC9BjhC,EAAIihC,GAAOxjC,KAAK4jB,IAAI4f,EAAKC,IAI/B,OAAOlhC,CACT,CACA,IAAK,SAAU,CACb,MAAMA,EAAM,IAAI+K,MAAMtN,KAAK8gC,SAASgD,KAAKp8B,OAAOgO,mBAChD,IAAK,IAAI8tB,EAAM,EAAGA,EAAMxjC,KAAK6gC,KAAM2C,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASzjC,KAAK8gC,QAAS2C,IACtCzjC,KAAK4jB,IAAI4f,EAAKC,GAAUlhC,EAAIkhC,KAC9BlhC,EAAIkhC,GAAUzjC,KAAK4jB,IAAI4f,EAAKC,IAIlC,OAAOlhC,CACT,CACA,UAAKiB,EAAW,CACd,IAAIjB,EAAMvC,KAAK4jB,IAAI,EAAG,GACtB,IAAK,IAAI4f,EAAM,EAAGA,EAAMxjC,KAAK6gC,KAAM2C,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASzjC,KAAK8gC,QAAS2C,IACtCzjC,KAAK4jB,IAAI4f,EAAKC,GAAUlhC,IAC1BA,EAAMvC,KAAK4jB,IAAI4f,EAAKC,IAI1B,OAAOlhC,CACT,CACA,QACE,MAAM,IAAIqY,MAAM,mBAAmB4sB,KAEzC,CAEA,QAAAE,GACE1E,EAAchjC,MACd,IAAIrD,EAAIqD,KAAK4jB,IAAI,EAAG,GAChB+jB,EAAM,CAAC,EAAG,GACd,IAAK,IAAInmC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAC5Bhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKrgB,IACnBA,EAAIqD,KAAK4jB,IAAIpiB,EAAGwb,GAChB2qB,EAAI,GAAKnmC,EACTmmC,EAAI,GAAK3qB,GAIf,OAAO2qB,CACT,CAEA,GAAAt/B,CAAIm/B,GACF,GAAIxnC,KAAK+gB,UACP,OAAO0mB,IAGT,OAAQD,GACN,IAAK,MAAO,CACV,MAAMn/B,EAAM,IAAIiF,MAAMtN,KAAK6gC,MAAMiD,KAAKp8B,OAAOC,mBAC7C,IAAK,IAAI67B,EAAM,EAAGA,EAAMxjC,KAAK6gC,KAAM2C,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASzjC,KAAK8gC,QAAS2C,IACtCzjC,KAAK4jB,IAAI4f,EAAKC,GAAUp7B,EAAIm7B,KAC9Bn7B,EAAIm7B,GAAOxjC,KAAK4jB,IAAI4f,EAAKC,IAI/B,OAAOp7B,CACT,CACA,IAAK,SAAU,CACb,MAAMA,EAAM,IAAIiF,MAAMtN,KAAK8gC,SAASgD,KAAKp8B,OAAOC,mBAChD,IAAK,IAAI67B,EAAM,EAAGA,EAAMxjC,KAAK6gC,KAAM2C,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASzjC,KAAK8gC,QAAS2C,IACtCzjC,KAAK4jB,IAAI4f,EAAKC,GAAUp7B,EAAIo7B,KAC9Bp7B,EAAIo7B,GAAUzjC,KAAK4jB,IAAI4f,EAAKC,IAIlC,OAAOp7B,CACT,CACA,UAAK7E,EAAW,CACd,IAAI6E,EAAMrI,KAAK4jB,IAAI,EAAG,GACtB,IAAK,IAAI4f,EAAM,EAAGA,EAAMxjC,KAAK6gC,KAAM2C,IACjC,IAAK,IAAIC,EAAS,EAAGA,EAASzjC,KAAK8gC,QAAS2C,IACtCzjC,KAAK4jB,IAAI4f,EAAKC,GAAUp7B,IAC1BA,EAAMrI,KAAK4jB,IAAI4f,EAAKC,IAI1B,OAAOp7B,CACT,CACA,QACE,MAAM,IAAIuS,MAAM,mBAAmB4sB,KAEzC,CAEA,QAAAI,GACE5E,EAAchjC,MACd,IAAIrD,EAAIqD,KAAK4jB,IAAI,EAAG,GAChB+jB,EAAM,CAAC,EAAG,GACd,IAAK,IAAInmC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAC5Bhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKrgB,IACnBA,EAAIqD,KAAK4jB,IAAIpiB,EAAGwb,GAChB2qB,EAAI,GAAKnmC,EACTmmC,EAAI,GAAK3qB,GAIf,OAAO2qB,CACT,CAEA,MAAA9B,CAAOrC,GAEL,GADAzB,EAAc/hC,KAAMwjC,GAChBxjC,KAAK+gB,UACP,OAAO0mB,IAET,IAAI9qC,EAAIqD,KAAK4jB,IAAI4f,EAAK,GACtB,IAAK,IAAIhiC,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAC5BxB,KAAK4jB,IAAI4f,EAAKhiC,GAAK7E,IACrBA,EAAIqD,KAAK4jB,IAAI4f,EAAKhiC,IAGtB,OAAO7E,CACT,CAEA,WAAAkrC,CAAYrE,GACVzB,EAAc/hC,KAAMwjC,GACpBR,EAAchjC,MACd,IAAIrD,EAAIqD,KAAK4jB,IAAI4f,EAAK,GAClBmE,EAAM,CAACnE,EAAK,GAChB,IAAK,IAAIhiC,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAC5BxB,KAAK4jB,IAAI4f,EAAKhiC,GAAK7E,IACrBA,EAAIqD,KAAK4jB,IAAI4f,EAAKhiC,GAClBmmC,EAAI,GAAKnmC,GAGb,OAAOmmC,CACT,CAEA,MAAAG,CAAOtE,GAEL,GADAzB,EAAc/hC,KAAMwjC,GAChBxjC,KAAK+gB,UACP,OAAO0mB,IAET,IAAI9qC,EAAIqD,KAAK4jB,IAAI4f,EAAK,GACtB,IAAK,IAAIhiC,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAC5BxB,KAAK4jB,IAAI4f,EAAKhiC,GAAK7E,IACrBA,EAAIqD,KAAK4jB,IAAI4f,EAAKhiC,IAGtB,OAAO7E,CACT,CAEA,WAAAorC,CAAYvE,GACVzB,EAAc/hC,KAAMwjC,GACpBR,EAAchjC,MACd,IAAIrD,EAAIqD,KAAK4jB,IAAI4f,EAAK,GAClBmE,EAAM,CAACnE,EAAK,GAChB,IAAK,IAAIhiC,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAC5BxB,KAAK4jB,IAAI4f,EAAKhiC,GAAK7E,IACrBA,EAAIqD,KAAK4jB,IAAI4f,EAAKhiC,GAClBmmC,EAAI,GAAKnmC,GAGb,OAAOmmC,CACT,CAEA,SAAAK,CAAUvE,GAER,GADAzB,EAAiBhiC,KAAMyjC,GACnBzjC,KAAK+gB,UACP,OAAO0mB,IAET,IAAI9qC,EAAIqD,KAAK4jB,IAAI,EAAG6f,GACpB,IAAK,IAAIjiC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IACzBxB,KAAK4jB,IAAIpiB,EAAGiiC,GAAU9mC,IACxBA,EAAIqD,KAAK4jB,IAAIpiB,EAAGiiC,IAGpB,OAAO9mC,CACT,CAEA,cAAAsrC,CAAexE,GACbzB,EAAiBhiC,KAAMyjC,GACvBT,EAAchjC,MACd,IAAIrD,EAAIqD,KAAK4jB,IAAI,EAAG6f,GAChBkE,EAAM,CAAC,EAAGlE,GACd,IAAK,IAAIjiC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IACzBxB,KAAK4jB,IAAIpiB,EAAGiiC,GAAU9mC,IACxBA,EAAIqD,KAAK4jB,IAAIpiB,EAAGiiC,GAChBkE,EAAI,GAAKnmC,GAGb,OAAOmmC,CACT,CAEA,SAAAO,CAAUzE,GAER,GADAzB,EAAiBhiC,KAAMyjC,GACnBzjC,KAAK+gB,UACP,OAAO0mB,IAET,IAAI9qC,EAAIqD,KAAK4jB,IAAI,EAAG6f,GACpB,IAAK,IAAIjiC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IACzBxB,KAAK4jB,IAAIpiB,EAAGiiC,GAAU9mC,IACxBA,EAAIqD,KAAK4jB,IAAIpiB,EAAGiiC,IAGpB,OAAO9mC,CACT,CAEA,cAAAwrC,CAAe1E,GACbzB,EAAiBhiC,KAAMyjC,GACvBT,EAAchjC,MACd,IAAIrD,EAAIqD,KAAK4jB,IAAI,EAAG6f,GAChBkE,EAAM,CAAC,EAAGlE,GACd,IAAK,IAAIjiC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IACzBxB,KAAK4jB,IAAIpiB,EAAGiiC,GAAU9mC,IACxBA,EAAIqD,KAAK4jB,IAAIpiB,EAAGiiC,GAChBkE,EAAI,GAAKnmC,GAGb,OAAOmmC,CACT,CAEA,IAAAtD,GACE,IAAIh8B,EAAM/F,KAAK+F,IAAIrI,KAAK6gC,KAAM7gC,KAAK8gC,SAC/BuD,EAAO,GACX,IAAK,IAAI7iC,EAAI,EAAGA,EAAI6G,EAAK7G,IACvB6iC,EAAKtnC,KAAKiD,KAAK4jB,IAAIpiB,EAAGA,IAExB,OAAO6iC,CACT,CAEA,IAAA+D,CAAKruB,EAAO,aACV,OAAQA,GACN,IAAK,MACH,OAAO/Z,KAAKuC,MACd,IAAK,YACH,OAAOD,KAAK+lC,KAAKroC,KAAKsoC,IAAItoC,OAC5B,QACE,MAAM,IAAI+/B,WAAW,sBAAsBhmB,KAEjD,CAEA,aAAAwuB,GACE,IAAIh8B,EAAM,EACV,IAAK,IAAI/K,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChCzQ,GAAOvM,KAAK4jB,IAAIpiB,EAAGwb,GACnBhd,KAAK2jB,IAAIniB,EAAGwb,EAAGzQ,GAGnB,OAAOvM,IACT,CAEA,GAAAsoC,CAAIE,GACEvF,EAAewB,SAAS+D,KAAUA,EAAUA,EAAQrG,aACxD,IAAIsG,EAAUzoC,KAAKmiC,YACnB,GAAIsG,EAAQhqC,SAAW+pC,EAAQ/pC,OAC7B,MAAM,IAAIshC,WAAW,qCAEvB,IAAIuI,EAAM,EACV,IAAK,IAAI9mC,EAAI,EAAGA,EAAIinC,EAAQhqC,OAAQ+C,IAClC8mC,GAAOG,EAAQjnC,GAAKgnC,EAAQhnC,GAE9B,OAAO8mC,CACT,CAEA,IAAAI,CAAKr4B,GACHA,EAAQkzB,EAAOiB,YAAYn0B,GAE3B,IAAIu1B,EAAI5lC,KAAK6gC,KACT9P,EAAI/wB,KAAK8gC,QACTx4B,EAAI+H,EAAMywB,QAEVz0B,EAAS,IAAIk3B,EAAOqC,EAAGt9B,GAEvBqgC,EAAQ,IAAIC,aAAa7X,GAC7B,IAAK,IAAI/T,EAAI,EAAGA,EAAI1U,EAAG0U,IAAK,CAC1B,IAAK,IAAI3c,EAAI,EAAGA,EAAI0wB,EAAG1wB,IACrBsoC,EAAMtoC,GAAKgQ,EAAMuT,IAAIvjB,EAAG2c,GAG1B,IAAK,IAAIxb,EAAI,EAAGA,EAAIokC,EAAGpkC,IAAK,CAC1B,IAAIqnC,EAAI,EACR,IAAK,IAAIxoC,EAAI,EAAGA,EAAI0wB,EAAG1wB,IACrBwoC,GAAK7oC,KAAK4jB,IAAIpiB,EAAGnB,GAAKsoC,EAAMtoC,GAG9BgM,EAAOsX,IAAIniB,EAAGwb,EAAG6rB,EACnB,CACF,CACA,OAAOx8B,CACT,CAEA,WAAAy8B,CAAYz4B,GACVA,EAAQkzB,EAAOiB,YAAYn0B,GAC3B,IAAIhE,EAAS,IAAIk3B,EAAO,EAAG,GAC3B,MAAMwF,EAAM/oC,KAAK4jB,IAAI,EAAG,GAClBolB,EAAM34B,EAAMuT,IAAI,EAAG,GACnBqlB,EAAMjpC,KAAK4jB,IAAI,EAAG,GAClBslB,EAAM74B,EAAMuT,IAAI,EAAG,GACnBulB,EAAMnpC,KAAK4jB,IAAI,EAAG,GAClBwlB,EAAM/4B,EAAMuT,IAAI,EAAG,GACnBylB,EAAMrpC,KAAK4jB,IAAI,EAAG,GAClB0lB,EAAMj5B,EAAMuT,IAAI,EAAG,GAGnB2lB,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,OAJA78B,EAAOsX,IAAI,EAAG,EAAGimB,GACjBv9B,EAAOsX,IAAI,EAAG,EAAGkmB,GACjBx9B,EAAOsX,IAAI,EAAG,EAAGmmB,GACjBz9B,EAAOsX,IAAI,EAAG,EAAGomB,GACV19B,CACT,CAEA,WAAA29B,CAAY35B,GACVA,EAAQkzB,EAAOiB,YAAYn0B,GAC3B,IAAIhE,EAAS,IAAIk3B,EAAO,EAAG,GAE3B,MAAM0G,EAAMjqC,KAAK4jB,IAAI,EAAG,GAClBsmB,EAAMlqC,KAAK4jB,IAAI,EAAG,GAClBumB,EAAMnqC,KAAK4jB,IAAI,EAAG,GAClBwmB,EAAMpqC,KAAK4jB,IAAI,EAAG,GAClBmlB,EAAM/oC,KAAK4jB,IAAI,EAAG,GAClBqlB,EAAMjpC,KAAK4jB,IAAI,EAAG,GAClBymB,EAAMrqC,KAAK4jB,IAAI,EAAG,GAClBulB,EAAMnpC,KAAK4jB,IAAI,EAAG,GAClBylB,EAAMrpC,KAAK4jB,IAAI,EAAG,GAElB0mB,EAAMj6B,EAAMuT,IAAI,EAAG,GACnB2mB,EAAMl6B,EAAMuT,IAAI,EAAG,GACnB4mB,EAAMn6B,EAAMuT,IAAI,EAAG,GACnB6mB,EAAMp6B,EAAMuT,IAAI,EAAG,GACnBolB,EAAM34B,EAAMuT,IAAI,EAAG,GACnBslB,EAAM74B,EAAMuT,IAAI,EAAG,GACnB8mB,EAAMr6B,EAAMuT,IAAI,EAAG,GACnBwlB,EAAM/4B,EAAMuT,IAAI,EAAG,GACnB0lB,EAAMj5B,EAAMuT,IAAI,EAAG,GAGnB4lB,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,OATAj9B,EAAOsX,IAAI,EAAG,EAAGimB,GACjBv9B,EAAOsX,IAAI,EAAG,EAAGkmB,GACjBx9B,EAAOsX,IAAI,EAAG,EAAG2nB,GACjBj/B,EAAOsX,IAAI,EAAG,EAAGmmB,GACjBz9B,EAAOsX,IAAI,EAAG,EAAGomB,GACjB19B,EAAOsX,IAAI,EAAG,EAAG4nB,GACjBl/B,EAAOsX,IAAI,EAAG,EAAG6nB,GACjBn/B,EAAOsX,IAAI,EAAG,EAAG8nB,GACjBp/B,EAAOsX,IAAI,EAAG,EAAG+nB,GACVr/B,CACT,CAEA,YAAAs/B,CAAazsC,GACXA,EAAIqkC,EAAOiB,YAAYtlC,GACvB,IAAIE,EAAIY,KAAK2iB,QACTipB,EAAKxsC,EAAEyhC,KACPgL,EAAKzsC,EAAE0hC,QACPgL,EAAK5sC,EAAE2hC,KACPkL,EAAK7sC,EAAE4hC,QAUX,SAASkL,EAAMC,EAAKpL,EAAMqL,GACxB,IAAI7kC,EAAI4kC,EAAIpL,KACRsL,EAAIF,EAAInL,QACZ,GAAIz5B,IAAMw5B,GAAQsL,IAAMD,EACtB,OAAOD,EACF,CACL,IAAIG,EAAWnJ,EAAeW,MAAM/C,EAAMqL,GAE1C,OADAE,EAAWA,EAASrG,aAAakG,EAAK,EAAG,GAClCG,CACT,CACF,CAnBIP,IAAOC,GAET7wB,QAAQoxB,KACN,eAAeT,OAAQC,SAAUC,OAAQC,sCAsB7C,IAAI1kC,EAAI/E,KAAKC,IAAIqpC,EAAIE,GACjBK,EAAI7pC,KAAKC,IAAIspC,EAAIE,GAiFrB,OAhFA3sC,EAAI4sC,EAAM5sC,EAAGiI,EAAG8kC,GAIhB,SAASG,EAAUC,EAAGrlC,EAAG25B,EAAMqL,GAE7B,GAAIrL,GAAQ,KAAOqL,GAAQ,IACzB,OAAOK,EAAE7D,KAAKxhC,GAIZ25B,EAAO,GAAM,GAAKqL,EAAO,GAAM,GACjCK,EAAIP,EAAMO,EAAG1L,EAAO,EAAGqL,EAAO,GAC9BhlC,EAAI8kC,EAAM9kC,EAAG25B,EAAO,EAAGqL,EAAO,IACrBrL,EAAO,GAAM,GACtB0L,EAAIP,EAAMO,EAAG1L,EAAO,EAAGqL,GACvBhlC,EAAI8kC,EAAM9kC,EAAG25B,EAAO,EAAGqL,IACdA,EAAO,GAAM,IACtBK,EAAIP,EAAMO,EAAG1L,EAAMqL,EAAO,GAC1BhlC,EAAI8kC,EAAM9kC,EAAG25B,EAAMqL,EAAO,IAG5B,IAAIM,EAAW5N,SAAS2N,EAAE1L,KAAO,EAAG,IAChC4L,EAAW7N,SAAS2N,EAAEzL,QAAU,EAAG,IAEnCiI,EAAMwD,EAAEG,UAAU,EAAGF,EAAW,EAAG,EAAGC,EAAW,GACjDzD,EAAM9hC,EAAEwlC,UAAU,EAAGF,EAAW,EAAG,EAAGC,EAAW,GAEjDxD,EAAMsD,EAAEG,UAAU,EAAGF,EAAW,EAAGC,EAAUF,EAAEzL,QAAU,GACzDoI,EAAMhiC,EAAEwlC,UAAU,EAAGF,EAAW,EAAGC,EAAUvlC,EAAE45B,QAAU,GAEzDqI,EAAMoD,EAAEG,UAAUF,EAAUD,EAAE1L,KAAO,EAAG,EAAG4L,EAAW,GACtDrD,EAAMliC,EAAEwlC,UAAUF,EAAUtlC,EAAE25B,KAAO,EAAG,EAAG4L,EAAW,GAEtDpD,EAAMkD,EAAEG,UAAUF,EAAUD,EAAE1L,KAAO,EAAG4L,EAAUF,EAAEzL,QAAU,GAC9DwI,EAAMpiC,EAAEwlC,UAAUF,EAAUtlC,EAAE25B,KAAO,EAAG4L,EAAUvlC,EAAE45B,QAAU,GAG9DyI,EAAK+C,EACPrJ,EAAe1mB,IAAIwsB,EAAKM,GACxBpG,EAAe1mB,IAAIysB,EAAKM,GACxBkD,EACAC,GAEEjD,EAAK8C,EAAUrJ,EAAe1mB,IAAI4sB,EAAKE,GAAML,EAAKwD,EAAUC,GAC5DhD,EAAK6C,EAAUvD,EAAK9F,EAAe0J,IAAIzD,EAAKI,GAAMkD,EAAUC,GAC5D/C,EAAK4C,EAAUjD,EAAKpG,EAAe0J,IAAIvD,EAAKJ,GAAMwD,EAAUC,GAC5D9C,EAAK2C,EAAUrJ,EAAe1mB,IAAIwsB,EAAKE,GAAMK,EAAKkD,EAAUC,GAC5D9B,EAAK2B,EACPrJ,EAAe0J,IAAIxD,EAAKJ,GACxB9F,EAAe1mB,IAAIysB,EAAKE,GACxBsD,EACAC,GAEE7B,EAAK0B,EACPrJ,EAAe0J,IAAI1D,EAAKI,GACxBpG,EAAe1mB,IAAI6sB,EAAKE,GACxBkD,EACAC,GAIE1C,EAAM9G,EAAe1mB,IAAIgtB,EAAIG,GACjCK,EAAI4C,IAAIhD,GACRI,EAAIxtB,IAAIquB,GACR,IAAIW,EAAMtI,EAAe1mB,IAAIktB,EAAIE,GAC7B8B,EAAMxI,EAAe1mB,IAAIitB,EAAIE,GAC7BgC,EAAMzI,EAAe0J,IAAIpD,EAAIC,GACjCkC,EAAInvB,IAAIktB,GACRiC,EAAInvB,IAAIouB,GAGR,IAAIt+B,EAAS42B,EAAeW,MAAM,EAAImG,EAAIlJ,KAAM,EAAIkJ,EAAIjJ,SAKxD,OAJAz0B,EAASA,EAAO05B,aAAagE,EAAK,EAAG,GACrC19B,EAASA,EAAO05B,aAAawF,EAAKxB,EAAIlJ,KAAM,GAC5Cx0B,EAASA,EAAO05B,aAAa0F,EAAK,EAAG1B,EAAIjJ,SACzCz0B,EAASA,EAAO05B,aAAa2F,EAAK3B,EAAIlJ,KAAMkJ,EAAIjJ,SACzCz0B,EAAOqgC,UAAU,EAAG7L,EAAO,EAAG,EAAGqL,EAAO,EACjD,CAEOI,CAAUltC,EA/EjBF,EAAI8sC,EAAM9sC,EAAGmI,EAAG8kC,GA+EO9kC,EAAG8kC,EAC5B,CAEA,SAAAS,CAAUlqB,EAAU,CAAC,GACnB,GAAuB,iBAAZA,EACT,MAAM,IAAI4a,UAAU,6BAEtB,MAAM,IAAEj1B,EAAM,EAAC,IAAE9F,EAAM,GAAMmgB,EAC7B,IAAKhb,OAAOmlC,SAASxkC,GAAM,MAAM,IAAIi1B,UAAU,wBAC/C,IAAK51B,OAAOmlC,SAAStqC,GAAM,MAAM,IAAI+6B,UAAU,wBAC/C,GAAIj1B,GAAO9F,EAAK,MAAM,IAAIw9B,WAAW,gCACrC,IAAIuD,EAAY,IAAIC,EAAOvjC,KAAK6gC,KAAM7gC,KAAK8gC,SAC3C,IAAK,IAAIt/B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAAK,CAClC,MAAMgiC,EAAMxjC,KAAKkmC,OAAO1kC,GACpBgiC,EAAI/kC,OAAS,GACf4gC,EAAQmE,EAAK,CAAEn7B,MAAK9F,MAAK+8B,OAAQkE,IAEnCF,EAAU8C,OAAO5kC,EAAGgiC,EACtB,CACA,OAAOF,CACT,CAEA,YAAAwJ,CAAapqB,EAAU,CAAC,GACtB,GAAuB,iBAAZA,EACT,MAAM,IAAI4a,UAAU,6BAEtB,MAAM,IAAEj1B,EAAM,EAAC,IAAE9F,EAAM,GAAMmgB,EAC7B,IAAKhb,OAAOmlC,SAASxkC,GAAM,MAAM,IAAIi1B,UAAU,wBAC/C,IAAK51B,OAAOmlC,SAAStqC,GAAM,MAAM,IAAI+6B,UAAU,wBAC/C,GAAIj1B,GAAO9F,EAAK,MAAM,IAAIw9B,WAAW,gCACrC,IAAIuD,EAAY,IAAIC,EAAOvjC,KAAK6gC,KAAM7gC,KAAK8gC,SAC3C,IAAK,IAAIt/B,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAAK,CACrC,MAAMiiC,EAASzjC,KAAKwmC,UAAUhlC,GAC1BiiC,EAAOhlC,QACT4gC,EAAQoE,EAAQ,CACdp7B,MACA9F,MACA+8B,OAAQmE,IAGZH,EAAUoD,UAAUllC,EAAGiiC,EACzB,CACA,OAAOH,CACT,CAEA,QAAAyJ,GACE,MAAMC,EAAS1qC,KAAK6R,KAAKnU,KAAK8gC,QAAU,GACxC,IAAK,IAAIt/B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIgwB,EAAQhwB,IAAK,CAC/B,IAAIiwB,EAAQjtC,KAAK4jB,IAAIpiB,EAAGwb,GACpB5V,EAAOpH,KAAK4jB,IAAIpiB,EAAGxB,KAAK8gC,QAAU,EAAI9jB,GAC1Chd,KAAK2jB,IAAIniB,EAAGwb,EAAG5V,GACfpH,KAAK2jB,IAAIniB,EAAGxB,KAAK8gC,QAAU,EAAI9jB,EAAGiwB,EACpC,CAEF,OAAOjtC,IACT,CAEA,WAAAktC,GACE,MAAMF,EAAS1qC,KAAK6R,KAAKnU,KAAK6gC,KAAO,GACrC,IAAK,IAAI7jB,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChC,IAAK,IAAIxb,EAAI,EAAGA,EAAIwrC,EAAQxrC,IAAK,CAC/B,IAAIyrC,EAAQjtC,KAAK4jB,IAAIpiB,EAAGwb,GACpB5V,EAAOpH,KAAK4jB,IAAI5jB,KAAK6gC,KAAO,EAAIr/B,EAAGwb,GACvChd,KAAK2jB,IAAIniB,EAAGwb,EAAG5V,GACfpH,KAAK2jB,IAAI3jB,KAAK6gC,KAAO,EAAIr/B,EAAGwb,EAAGiwB,EACjC,CAEF,OAAOjtC,IACT,CAEA,gBAAAmtC,CAAiB98B,GACfA,EAAQkzB,EAAOiB,YAAYn0B,GAE3B,IAAIu1B,EAAI5lC,KAAK6gC,KACT9P,EAAI/wB,KAAK8gC,QACTx4B,EAAI+H,EAAMwwB,KACVuM,EAAI/8B,EAAMywB,QAEVz0B,EAAS,IAAIk3B,EAAOqC,EAAIt9B,EAAGyoB,EAAIqc,GACnC,IAAK,IAAI5rC,EAAI,EAAGA,EAAIokC,EAAGpkC,IACrB,IAAK,IAAIwb,EAAI,EAAGA,EAAI+T,EAAG/T,IACrB,IAAK,IAAI3c,EAAI,EAAGA,EAAIiI,EAAGjI,IACrB,IAAK,IAAI8G,EAAI,EAAGA,EAAIimC,EAAGjmC,IACrBkF,EAAOsX,IAAIrb,EAAI9G,EAAInB,EAAG+sC,EAAIpwB,EAAI7V,EAAGnH,KAAK4jB,IAAIpiB,EAAGwb,GAAK3M,EAAMuT,IAAIvjB,EAAG8G,IAKvE,OAAOkF,CACT,CAEA,YAAAghC,CAAah9B,GAEX,GADAA,EAAQkzB,EAAOiB,YAAYn0B,IACtBrQ,KAAKilC,aAAe50B,EAAM40B,WAC7B,MAAM,IAAIrqB,MAAM,2CAElB,IAAIgrB,EAAI5lC,KAAK6gC,KACT9P,EAAI1gB,EAAMwwB,KACVyM,EAAMttC,KAAKmtC,iBAAiB5J,EAAOa,IAAIrT,EAAGA,IAC1Cwc,EAAMhK,EAAOa,IAAIwB,EAAGA,GAAGuH,iBAAiB98B,GAC5C,OAAOi9B,EAAI/wB,IAAIgxB,EACjB,CAEA,SAAAC,GACE,IAAInhC,EAAS,IAAIk3B,EAAOvjC,KAAK8gC,QAAS9gC,KAAK6gC,MAC3C,IAAK,IAAIr/B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChC3Q,EAAOsX,IAAI3G,EAAGxb,EAAGxB,KAAK4jB,IAAIpiB,EAAGwb,IAGjC,OAAO3Q,CACT,CAEA,QAAAohC,CAASC,EAAkBC,GACzB,IAAK,IAAInsC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7BxB,KAAKomC,OAAO5kC,EAAGxB,KAAKkmC,OAAO1kC,GAAGuO,KAAK29B,IAErC,OAAO1tC,IACT,CAEA,WAAA4tC,CAAYF,EAAkBC,GAC5B,IAAK,IAAInsC,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAChCxB,KAAK0mC,UAAUllC,EAAGxB,KAAKwmC,UAAUhlC,GAAGuO,KAAK29B,IAE3C,OAAO1tC,IACT,CAEA,SAAA0sC,CAAUhK,EAAUC,EAAQC,EAAaC,GACvCJ,EAAWziC,KAAM0iC,EAAUC,EAAQC,EAAaC,GAChD,IAAIS,EAAY,IAAIC,EAClBZ,EAASD,EAAW,EACpBG,EAAYD,EAAc,GAE5B,IAAK,IAAIphC,EAAIkhC,EAAUlhC,GAAKmhC,EAAQnhC,IAClC,IAAK,IAAIwb,EAAI4lB,EAAa5lB,GAAK6lB,EAAW7lB,IACxCsmB,EAAU3f,IAAIniB,EAAIkhC,EAAU1lB,EAAI4lB,EAAa5iC,KAAK4jB,IAAIpiB,EAAGwb,IAG7D,OAAOsmB,CACT,CAEA,YAAAuK,CAAaC,EAASlL,EAAaC,GAGjC,QAFoBr/B,IAAhBo/B,IAA2BA,EAAc,QAC3Bp/B,IAAdq/B,IAAyBA,EAAY7iC,KAAK8gC,QAAU,GAEtD8B,EAAcC,GACdD,EAAc,GACdA,GAAe5iC,KAAK8gC,SACpB+B,EAAY,GACZA,GAAa7iC,KAAK8gC,QAElB,MAAM,IAAIf,WAAW,yBAGvB,IAAIuD,EAAY,IAAIC,EAAOuK,EAAQrvC,OAAQokC,EAAYD,EAAc,GACrE,IAAK,IAAIphC,EAAI,EAAGA,EAAIssC,EAAQrvC,OAAQ+C,IAClC,IAAK,IAAIwb,EAAI4lB,EAAa5lB,GAAK6lB,EAAW7lB,IAAK,CAC7C,GAAI8wB,EAAQtsC,GAAK,GAAKssC,EAAQtsC,IAAMxB,KAAK6gC,KACvC,MAAM,IAAId,WAAW,2BAA2B+N,EAAQtsC,MAE1D8hC,EAAU3f,IAAIniB,EAAGwb,EAAI4lB,EAAa5iC,KAAK4jB,IAAIkqB,EAAQtsC,GAAIwb,GACzD,CAEF,OAAOsmB,CACT,CAEA,eAAAyK,CAAgBD,EAASpL,EAAUC,GAGjC,QAFiBn/B,IAAbk/B,IAAwBA,EAAW,QACxBl/B,IAAXm/B,IAAsBA,EAAS3iC,KAAK6gC,KAAO,GAE7C6B,EAAWC,GACXD,EAAW,GACXA,GAAY1iC,KAAK6gC,MACjB8B,EAAS,GACTA,GAAU3iC,KAAK6gC,KAEf,MAAM,IAAId,WAAW,yBAGvB,IAAIuD,EAAY,IAAIC,EAAOZ,EAASD,EAAW,EAAGoL,EAAQrvC,QAC1D,IAAK,IAAI+C,EAAI,EAAGA,EAAIssC,EAAQrvC,OAAQ+C,IAClC,IAAK,IAAIwb,EAAI0lB,EAAU1lB,GAAK2lB,EAAQ3lB,IAAK,CACvC,GAAI8wB,EAAQtsC,GAAK,GAAKssC,EAAQtsC,IAAMxB,KAAK8gC,QACvC,MAAM,IAAIf,WAAW,8BAA8B+N,EAAQtsC,MAE7D8hC,EAAU3f,IAAI3G,EAAI0lB,EAAUlhC,EAAGxB,KAAK4jB,IAAI5G,EAAG8wB,EAAQtsC,IACrD,CAEF,OAAO8hC,CACT,CAEA,YAAAyC,CAAavF,EAAQkC,EAAUE,GAE7B,IADApC,EAAS+C,EAAOiB,YAAYhE,IACjBzf,UACT,OAAO/gB,KAITyiC,EAAWziC,KAAM0iC,EAFJA,EAAWlC,EAAOK,KAAO,EAEH+B,EADnBA,EAAcpC,EAAOM,QAAU,GAE/C,IAAK,IAAIt/B,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClChd,KAAK2jB,IAAI+e,EAAWlhC,EAAGohC,EAAc5lB,EAAGwjB,EAAO5c,IAAIpiB,EAAGwb,IAG1D,OAAOhd,IACT,CAEA,SAAAguC,CAAU1L,EAAYE,GACpBH,EAAgBriC,KAAMsiC,GACtBC,EAAmBviC,KAAMwiC,GACzB,IAAIc,EAAY,IAAIC,EAAOjB,EAAW7jC,OAAQ+jC,EAAc/jC,QAC5D,IAAK,IAAI+C,EAAI,EAAGA,EAAI8gC,EAAW7jC,OAAQ+C,IAAK,CAC1C,IAAIysC,EAAW3L,EAAW9gC,GAC1B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwlB,EAAc/jC,OAAQue,IAAK,CAC7C,IAAIkxB,EAAc1L,EAAcxlB,GAChCsmB,EAAU3f,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIqqB,EAAUC,GACzC,CACF,CACA,OAAO5K,CACT,CAEA,KAAA6K,GACE,IAAI9lC,EAAM/F,KAAK+F,IAAIrI,KAAK6gC,KAAM7gC,KAAK8gC,SAC/BqN,EAAQ,EACZ,IAAK,IAAI3sC,EAAI,EAAGA,EAAI6G,EAAK7G,IACvB2sC,GAASnuC,KAAK4jB,IAAIpiB,EAAGA,GAEvB,OAAO2sC,CACT,CAEA,KAAAxrB,GACE,OAAO3iB,KAAK0hB,YAAYD,KAAKzhB,KAAM,IAAIujC,EAAOvjC,KAAK6gC,KAAM7gC,KAAK8gC,SAChE,CAQA,WAAOrf,CAAK2sB,EAAMC,GAChB,IAAK,MAAO7K,EAAKC,EAAQzoB,KAAUozB,EAAKr/B,UACtCs/B,EAAG1qB,IAAI6f,EAAKC,EAAQzoB,GAGtB,OAAOqzB,CACT,CAEA,GAAA9hC,CAAIi7B,GACF,OAAQA,GACN,IAAK,MACH,OAj/CR,SAAkBhH,GAChB,IAAIj0B,EAAMw2B,EAASvC,EAAOK,MAC1B,IAAK,IAAIr/B,EAAI,EAAGA,EAAIg/B,EAAOK,OAAQr/B,EACjC,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,UAAW9jB,EACpCzQ,EAAI/K,IAAMg/B,EAAO5c,IAAIpiB,EAAGwb,GAG5B,OAAOzQ,CACT,CAy+Ce+hC,CAAStuC,MAClB,IAAK,SACH,OAz+CR,SAAqBwgC,GACnB,IAAIj0B,EAAMw2B,EAASvC,EAAOM,SAC1B,IAAK,IAAIt/B,EAAI,EAAGA,EAAIg/B,EAAOK,OAAQr/B,EACjC,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,UAAW9jB,EACpCzQ,EAAIyQ,IAAMwjB,EAAO5c,IAAIpiB,EAAGwb,GAG5B,OAAOzQ,CACT,CAi+CegiC,CAAYvuC,MACrB,UAAKwD,EACH,OAj+CR,SAAgBg9B,GACd,IAAI7jC,EAAI,EACR,IAAK,IAAI6E,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCrgB,GAAK6jC,EAAO5c,IAAIpiB,EAAGwb,GAGvB,OAAOrgB,CACT,CAy9Ce6xC,CAAOxuC,MAChB,QACE,MAAM,IAAI4a,MAAM,mBAAmB4sB,KAEzC,CAEA,OAAAiH,CAAQjH,GACN,OAAQA,GACN,IAAK,MACH,OAh+CR,SAAsBhH,GACpB,IAAIj0B,EAAMw2B,EAASvC,EAAOK,KAAM,GAChC,IAAK,IAAIr/B,EAAI,EAAGA,EAAIg/B,EAAOK,OAAQr/B,EACjC,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,UAAW9jB,EACpCzQ,EAAI/K,IAAMg/B,EAAO5c,IAAIpiB,EAAGwb,GAG5B,OAAOzQ,CACT,CAw9CemiC,CAAa1uC,MACtB,IAAK,SACH,OAx9CR,SAAyBwgC,GACvB,IAAIj0B,EAAMw2B,EAASvC,EAAOM,QAAS,GACnC,IAAK,IAAIt/B,EAAI,EAAGA,EAAIg/B,EAAOK,OAAQr/B,EACjC,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,UAAW9jB,EACpCzQ,EAAIyQ,IAAMwjB,EAAO5c,IAAIpiB,EAAGwb,GAG5B,OAAOzQ,CACT,CAg9CeoiC,CAAgB3uC,MACzB,UAAKwD,EACH,OAh9CR,SAAoBg9B,GAClB,IAAI7jC,EAAI,EACR,IAAK,IAAI6E,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCrgB,GAAK6jC,EAAO5c,IAAIpiB,EAAGwb,GAGvB,OAAOrgB,CACT,CAw8CeiyC,CAAW5uC,MACpB,QACE,MAAM,IAAI4a,MAAM,mBAAmB4sB,KAEzC,CAEA,IAAAqH,CAAKrH,GACH,MAAMj7B,EAAMvM,KAAKuM,IAAIi7B,GACrB,OAAQA,GACN,IAAK,MACH,IAAK,IAAIhmC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B+K,EAAI/K,IAAMxB,KAAK8gC,QAEjB,OAAOv0B,EAET,IAAK,SACH,IAAK,IAAI/K,EAAI,EAAGA,EAAIxB,KAAK8gC,QAASt/B,IAChC+K,EAAI/K,IAAMxB,KAAK6gC,KAEjB,OAAOt0B,EAET,UAAK/I,EACH,OAAO+I,EAAMvM,KAAKwX,KACpB,QACE,MAAM,IAAIoD,MAAM,mBAAmB4sB,KAEzC,CAEA,QAAAsH,CAAStH,EAAI9kB,EAAU,CAAC,GAKtB,GAJkB,iBAAP8kB,IACT9kB,EAAU8kB,EACVA,OAAKhkC,GAEgB,iBAAZkf,EACT,MAAM,IAAI4a,UAAU,6BAEtB,MAAM,SAAEyR,GAAW,EAAI,KAAEF,EAAO7uC,KAAK6uC,KAAKrH,IAAQ9kB,EAClD,GAAwB,kBAAbqsB,EACT,MAAM,IAAIzR,UAAU,8BAEtB,OAAQkK,GACN,IAAK,MACH,IAAK3kB,EAAWA,WAAWgsB,GACzB,MAAM,IAAIvR,UAAU,yBAEtB,OAn/CR,SAAuBkD,EAAQuO,EAAUF,GACvC,MAAMhO,EAAOL,EAAOK,KACdqL,EAAO1L,EAAOM,QACdgO,EAAW,GAEjB,IAAK,IAAIttC,EAAI,EAAGA,EAAIq/B,EAAMr/B,IAAK,CAC7B,IAAIwtC,EAAO,EACPC,EAAO,EACP7vC,EAAI,EACR,IAAK,IAAI4d,EAAI,EAAGA,EAAIkvB,EAAMlvB,IACxB5d,EAAIohC,EAAO5c,IAAIpiB,EAAGwb,GAAK6xB,EAAKrtC,GAC5BwtC,GAAQ5vC,EACR6vC,GAAQ7vC,EAAIA,EAEV2vC,EACFD,EAAS/xC,MAAMkyC,EAAQD,EAAOA,EAAQ9C,IAASA,EAAO,IAEtD4C,EAAS/xC,MAAMkyC,EAAQD,EAAOA,EAAQ9C,GAAQA,EAElD,CACA,OAAO4C,CACT,CA89CeI,CAAclvC,KAAM+uC,EAAUF,GAEvC,IAAK,SACH,IAAKhsB,EAAWA,WAAWgsB,GACzB,MAAM,IAAIvR,UAAU,yBAEtB,OAl+CR,SAA0BkD,EAAQuO,EAAUF,GAC1C,MAAMhO,EAAOL,EAAOK,KACdqL,EAAO1L,EAAOM,QACdgO,EAAW,GAEjB,IAAK,IAAI9xB,EAAI,EAAGA,EAAIkvB,EAAMlvB,IAAK,CAC7B,IAAIgyB,EAAO,EACPC,EAAO,EACP7vC,EAAI,EACR,IAAK,IAAIoC,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxBpC,EAAIohC,EAAO5c,IAAIpiB,EAAGwb,GAAK6xB,EAAK7xB,GAC5BgyB,GAAQ5vC,EACR6vC,GAAQ7vC,EAAIA,EAEV2vC,EACFD,EAAS/xC,MAAMkyC,EAAQD,EAAOA,EAAQnO,IAASA,EAAO,IAEtDiO,EAAS/xC,MAAMkyC,EAAQD,EAAOA,EAAQnO,GAAQA,EAElD,CACA,OAAOiO,CACT,CA68CeK,CAAiBnvC,KAAM+uC,EAAUF,GAE1C,UAAKrrC,EACH,GAAoB,iBAATqrC,EACT,MAAM,IAAIvR,UAAU,yBAEtB,OAj9CR,SAAqBkD,EAAQuO,EAAUF,GACrC,MAAMhO,EAAOL,EAAOK,KACdqL,EAAO1L,EAAOM,QACdtpB,EAAOqpB,EAAOqL,EAEpB,IAAI8C,EAAO,EACPC,EAAO,EACP7vC,EAAI,EACR,IAAK,IAAIoC,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxB,IAAK,IAAIwb,EAAI,EAAGA,EAAIkvB,EAAMlvB,IACxB5d,EAAIohC,EAAO5c,IAAIpiB,EAAGwb,GAAK6xB,EACvBG,GAAQ5vC,EACR6vC,GAAQ7vC,EAAIA,EAGhB,OAAI2vC,GACME,EAAQD,EAAOA,EAAQx3B,IAASA,EAAO,IAEvCy3B,EAAQD,EAAOA,EAAQx3B,GAAQA,CAE3C,CA67Ce43B,CAAYpvC,KAAM+uC,EAAUF,GAErC,QACE,MAAM,IAAIj0B,MAAM,mBAAmB4sB,KAEzC,CAEA,iBAAA6H,CAAkB7H,EAAI9kB,GACF,iBAAP8kB,IACT9kB,EAAU8kB,EACVA,OAAKhkC,GAEP,MAAMsrC,EAAW9uC,KAAK8uC,SAAStH,EAAI9kB,GACnC,QAAWlf,IAAPgkC,EACF,OAAOllC,KAAK+lC,KAAKyG,GAEjB,IAAK,IAAIttC,EAAI,EAAGA,EAAIstC,EAASrwC,OAAQ+C,IACnCstC,EAASttC,GAAKc,KAAK+lC,KAAKyG,EAASttC,IAEnC,OAAOstC,CAEX,CAEA,MAAAQ,CAAO9H,EAAI9kB,EAAU,CAAC,GAKpB,GAJkB,iBAAP8kB,IACT9kB,EAAU8kB,EACVA,OAAKhkC,GAEgB,iBAAZkf,EACT,MAAM,IAAI4a,UAAU,6BAEtB,MAAM,OAAEgS,EAAStvC,KAAK6uC,KAAKrH,IAAQ9kB,EACnC,OAAQ8kB,GACN,IAAK,MACH,IAAK3kB,EAAWA,WAAWysB,GACzB,MAAM,IAAIhS,UAAU,2BAGtB,OAj+CR,SAAqBkD,EAAQqO,GAC3B,IAAK,IAAIrtC,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCwjB,EAAO7c,IAAIniB,EAAGwb,EAAGwjB,EAAO5c,IAAIpiB,EAAGwb,GAAK6xB,EAAKrtC,GAG/C,CA09CQ+tC,CAAYvvC,KAAMsvC,GACXtvC,KAET,IAAK,SACH,IAAK6iB,EAAWA,WAAWysB,GACzB,MAAM,IAAIhS,UAAU,2BAGtB,OAh+CR,SAAwBkD,EAAQqO,GAC9B,IAAK,IAAIrtC,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCwjB,EAAO7c,IAAIniB,EAAGwb,EAAGwjB,EAAO5c,IAAIpiB,EAAGwb,GAAK6xB,EAAK7xB,GAG/C,CAy9CQwyB,CAAexvC,KAAMsvC,GACdtvC,KAET,UAAKwD,EACH,GAAsB,iBAAX8rC,EACT,MAAM,IAAIhS,UAAU,2BAGtB,OA/9CR,SAAmBkD,EAAQqO,GACzB,IAAK,IAAIrtC,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCwjB,EAAO7c,IAAIniB,EAAGwb,EAAGwjB,EAAO5c,IAAIpiB,EAAGwb,GAAK6xB,EAG1C,CAw9CQY,CAAUzvC,KAAMsvC,GACTtvC,KAET,QACE,MAAM,IAAI4a,MAAM,mBAAmB4sB,KAEzC,CAEA,KAAAkI,CAAMlI,EAAI9kB,EAAU,CAAC,GAKnB,GAJkB,iBAAP8kB,IACT9kB,EAAU8kB,EACVA,OAAKhkC,GAEgB,iBAAZkf,EACT,MAAM,IAAI4a,UAAU,6BAEtB,IAAIoS,EAAQhtB,EAAQgtB,MACpB,OAAQlI,GACN,IAAK,MACH,QAAchkC,IAAVksC,EACFA,EA1+CV,SAAuBlP,GACrB,MAAMkP,EAAQ,GACd,IAAK,IAAIluC,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAAK,CACpC,IAAI+K,EAAM,EACV,IAAK,IAAIyQ,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCzQ,GAAOjK,KAAKqtC,IAAInP,EAAO5c,IAAIpiB,EAAGwb,GAAI,IAAMwjB,EAAOM,QAAU,GAE3D4O,EAAM3yC,KAAKuF,KAAK+lC,KAAK97B,GACvB,CACA,OAAOmjC,CACT,CAg+CkBE,CAAc5vC,WACjB,IAAK6iB,EAAWA,WAAW6sB,GAChC,MAAM,IAAIpS,UAAU,0BAGtB,OAn+CR,SAAoBkD,EAAQkP,GAC1B,IAAK,IAAIluC,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCwjB,EAAO7c,IAAIniB,EAAGwb,EAAGwjB,EAAO5c,IAAIpiB,EAAGwb,GAAK0yB,EAAMluC,GAGhD,CA49CQquC,CAAW7vC,KAAM0vC,GACV1vC,KAET,IAAK,SACH,QAAcwD,IAAVksC,EACFA,EA/9CV,SAA0BlP,GACxB,MAAMkP,EAAQ,GACd,IAAK,IAAI1yB,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAAK,CACvC,IAAIzQ,EAAM,EACV,IAAK,IAAI/K,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B+K,GAAOjK,KAAKqtC,IAAInP,EAAO5c,IAAIpiB,EAAGwb,GAAI,IAAMwjB,EAAOK,KAAO,GAExD6O,EAAM3yC,KAAKuF,KAAK+lC,KAAK97B,GACvB,CACA,OAAOmjC,CACT,CAq9CkBI,CAAiB9vC,WACpB,IAAK6iB,EAAWA,WAAW6sB,GAChC,MAAM,IAAIpS,UAAU,0BAGtB,OAx9CR,SAAuBkD,EAAQkP,GAC7B,IAAK,IAAIluC,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCwjB,EAAO7c,IAAIniB,EAAGwb,EAAGwjB,EAAO5c,IAAIpiB,EAAGwb,GAAK0yB,EAAM1yB,GAGhD,CAi9CQ+yB,CAAc/vC,KAAM0vC,GACb1vC,KAET,UAAKwD,EACH,QAAcA,IAAVksC,EACFA,EAp9CV,SAAqBlP,GACnB,MAAMwP,EAAUxP,EAAOhpB,KAAO,EAC9B,IAAIjL,EAAM,EACV,IAAK,IAAIyQ,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClC,IAAK,IAAIxb,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B+K,GAAOjK,KAAKqtC,IAAInP,EAAO5c,IAAIpiB,EAAGwb,GAAI,GAAKgzB,EAG3C,OAAO1tC,KAAK+lC,KAAK97B,EACnB,CA28CkB0jC,CAAYjwC,WACf,GAAqB,iBAAV0vC,EAChB,MAAM,IAAIpS,UAAU,0BAGtB,OA98CR,SAAkBkD,EAAQkP,GACxB,IAAK,IAAIluC,EAAI,EAAGA,EAAIg/B,EAAOK,KAAMr/B,IAC/B,IAAK,IAAIwb,EAAI,EAAGA,EAAIwjB,EAAOM,QAAS9jB,IAClCwjB,EAAO7c,IAAIniB,EAAGwb,EAAGwjB,EAAO5c,IAAIpiB,EAAGwb,GAAK0yB,EAG1C,CAu8CQQ,CAASlwC,KAAM0vC,GACR1vC,KAET,QACE,MAAM,IAAI4a,MAAM,mBAAmB4sB,KAEzC,CAEA,QAAA/mC,CAASiiB,GACP,OAAO6d,EAAyBvgC,KAAM0iB,EACxC,CAEA,CAAC6C,OAAO4qB,YACN,OAAOnwC,KAAK+O,SACd,CAOA,QAACA,GACC,IAAK,IAAIy0B,EAAM,EAAGA,EAAMxjC,KAAK6gC,KAAM2C,IACjC,IAAK,IAAI4M,EAAM,EAAGA,EAAMpwC,KAAK8gC,QAASsP,SAC9B,CAAC5M,EAAK4M,EAAKpwC,KAAK4jB,IAAI4f,EAAK4M,GAGrC,CAOA,OAAChmC,GACC,IAAK,IAAIo5B,EAAM,EAAGA,EAAMxjC,KAAK6gC,KAAM2C,IACjC,IAAK,IAAI4M,EAAM,EAAGA,EAAMpwC,KAAK8gC,QAASsP,UAC9BpwC,KAAK4jB,IAAI4f,EAAK4M,EAG1B,EASF,SAASzC,EAAepB,EAAGrlC,GACzB,OAAOqlC,EAAIrlC,CACb,CARA+7B,EAAe3iC,UAAUokC,MAAQ,SACX,oBAAXnf,SACT0d,EAAe3iC,UAAUilB,OAAO8qB,IAAI,+BA5tFtC,WACE,OAAO9P,EAAyBvgC,KAClC,GAyuFAijC,EAAee,OAASf,EAAec,KACvCd,EAAeqN,UAAYrN,EAAegB,QAC1ChB,EAAesN,SAAWtN,EAAeoB,KACzCpB,EAAe3iC,UAAUiwC,SAAWtN,EAAe3iC,UAAU+jC,KAC7DpB,EAAepV,SAAWoV,EAAemB,IACzCnB,EAAe3iC,UAAUkwC,OAASvN,EAAe3iC,UAAU0lC,IAC3D/C,EAAe3iC,UAAUmwC,cACvBxN,EAAe3iC,UAAU6sC,iBAE3B,MAAM5J,UAAeN,EAInB3d,KAOA,GAAUorB,EAAOC,GAGf,GAFA3wC,KAAKslB,KAAO,KAER5d,OAAOi4B,UAAUgR,IAAaA,GAAY,GAK5C,MAAM,IAAIrT,UAAU,uCAJpB,IAAK,IAAI97B,EAAI,EAAGA,EAAIkvC,EAAOlvC,IACzBxB,KAAKslB,KAAKvoB,KAAK,IAAI6rC,aAAa+H,IAMpC3wC,KAAK6gC,KAAO6P,EACZ1wC,KAAK8gC,QAAU6P,CACjB,CAEA,WAAAjvB,CAAYgvB,EAAOC,GAEjB,GADAC,QACIrN,EAAOkB,SAASiM,GAClB1wC,MAAK,EAAU0wC,EAAM7P,KAAM6P,EAAM5P,SACjCyC,EAAO9hB,KAAKivB,EAAO1wC,WACd,GAAI0H,OAAOi4B,UAAU+Q,IAAUA,GAAS,EAC7C1wC,MAAK,EAAU0wC,EAAOC,OACjB,KAAI9tB,EAAWA,WAAW6tB,GAyB/B,MAAM,IAAIpT,UACR,wDA1BqC,CAEvC,MAAMuT,EAAYH,EAGlB,GAAwB,iBADxBC,GADAD,EAAQG,EAAUpyC,QACCoyC,EAAU,GAAGpyC,OAAS,GAEvC,MAAM,IAAI6+B,UACR,qDAGJt9B,KAAKslB,KAAO,GAEZ,IAAK,IAAI9jB,EAAI,EAAGA,EAAIkvC,EAAOlvC,IAAK,CAC9B,GAAIqvC,EAAUrvC,GAAG/C,SAAWkyC,EAC1B,MAAM,IAAI5Q,WAAW,iCAEvB,IAAsB8Q,EAAUrvC,GAhEzBsvC,OAAOC,GACQ,iBAAZA,IAgER,MAAM,IAAIzT,UAAU,0CAEtBt9B,KAAKslB,KAAKvoB,KAAK6rC,aAAawF,KAAKyC,EAAUrvC,IAC7C,CAEAxB,KAAK6gC,KAAO6P,EACZ1wC,KAAK8gC,QAAU6P,CACjB,CAIA,CACF,CAEA,GAAAhtB,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKslB,KAAK2oB,GAAUC,GAAelzB,EAC5Bhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKslB,KAAK2oB,GAAUC,EAC7B,CAEA,SAAA8C,CAAUxjC,GAIR,OAHAu0B,EAAc/hC,KAAMwN,GACpBxN,KAAKslB,KAAKwT,OAAOtrB,EAAO,GACxBxN,KAAK6gC,MAAQ,EACN7gC,IACT,CAEA,MAAAixC,CAAOzjC,EAAOqY,GASZ,YARcriB,IAAVqiB,IACFA,EAAQrY,EACRA,EAAQxN,KAAK6gC,MAEfkB,EAAc/hC,KAAMwN,GAAO,GAC3BqY,EAAQ+iB,aAAawF,KAAKnM,EAAejiC,KAAM6lB,IAC/C7lB,KAAKslB,KAAKwT,OAAOtrB,EAAO,EAAGqY,GAC3B7lB,KAAK6gC,MAAQ,EACN7gC,IACT,CAEA,YAAAkxC,CAAa1jC,GACXw0B,EAAiBhiC,KAAMwN,GACvB,IAAK,IAAIhM,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAAK,CAClC,MAAM2vC,EAAS,IAAIvI,aAAa5oC,KAAK8gC,QAAU,GAC/C,IAAK,IAAI9jB,EAAI,EAAGA,EAAIxP,EAAOwP,IACzBm0B,EAAOn0B,GAAKhd,KAAKslB,KAAK9jB,GAAGwb,GAE3B,IAAK,IAAIA,EAAIxP,EAAQ,EAAGwP,EAAIhd,KAAK8gC,QAAS9jB,IACxCm0B,EAAOn0B,EAAI,GAAKhd,KAAKslB,KAAK9jB,GAAGwb,GAE/Bhd,KAAKslB,KAAK9jB,GAAK2vC,CACjB,CAEA,OADAnxC,KAAK8gC,SAAW,EACT9gC,IACT,CAEA,SAAAoxC,CAAU5jC,EAAOqY,QACM,IAAVA,IACTA,EAAQrY,EACRA,EAAQxN,KAAK8gC,SAEfkB,EAAiBhiC,KAAMwN,GAAO,GAC9BqY,EAAQuc,EAAkBpiC,KAAM6lB,GAChC,IAAK,IAAIrkB,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAAK,CAClC,MAAM2vC,EAAS,IAAIvI,aAAa5oC,KAAK8gC,QAAU,GAC/C,IAAI9jB,EAAI,EACR,KAAOA,EAAIxP,EAAOwP,IAChBm0B,EAAOn0B,GAAKhd,KAAKslB,KAAK9jB,GAAGwb,GAG3B,IADAm0B,EAAOn0B,KAAO6I,EAAMrkB,GACbwb,EAAIhd,KAAK8gC,QAAU,EAAG9jB,IAC3Bm0B,EAAOn0B,GAAKhd,KAAKslB,KAAK9jB,GAAGwb,EAAI,GAE/Bhd,KAAKslB,KAAK9jB,GAAK2vC,CACjB,CAEA,OADAnxC,KAAK8gC,SAAW,EACT9gC,IACT,GA5xFF,SAA+BijC,EAAgBM,GAC7CN,EAAe3iC,UAAUic,IAAM,SAAavB,GAC1C,MAAqB,iBAAVA,EAA2Bhb,KAAKqxC,KAAKr2B,GACzChb,KAAKsxC,KAAKt2B,EACnB,EAEAioB,EAAe3iC,UAAU+wC,KAAO,SAAcr2B,GAC5C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKhC,GAGpC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUgxC,KAAO,SAAc9Q,GAE5C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKwjB,EAAO5c,IAAIpiB,EAAGwb,IAGlD,OAAOhd,IACT,EAEAijC,EAAe1mB,IAAM,SAAaikB,EAAQxlB,GAExC,OADkB,IAAIuoB,EAAO/C,GACZjkB,IAAIvB,EACvB,EAEAioB,EAAe3iC,UAAUqsC,IAAM,SAAa3xB,GAC1C,MAAqB,iBAAVA,EAA2Bhb,KAAKuxC,KAAKv2B,GACzChb,KAAKwxC,KAAKx2B,EACnB,EAEAioB,EAAe3iC,UAAUixC,KAAO,SAAcv2B,GAC5C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKhC,GAGpC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUkxC,KAAO,SAAchR,GAE5C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKwjB,EAAO5c,IAAIpiB,EAAGwb,IAGlD,OAAOhd,IACT,EAEAijC,EAAe0J,IAAM,SAAanM,EAAQxlB,GAExC,OADkB,IAAIuoB,EAAO/C,GACZmM,IAAI3xB,EACvB,EACAioB,EAAe3iC,UAAUmxC,SAAWxO,EAAe3iC,UAAUqsC,IAC7D1J,EAAe3iC,UAAUoxC,UAAYzO,EAAe3iC,UAAUixC,KAC9DtO,EAAe3iC,UAAUqxC,UAAY1O,EAAe3iC,UAAUkxC,KAC9DvO,EAAewO,SAAWxO,EAAe0J,IAEzC1J,EAAe3iC,UAAUsxC,IAAM,SAAa52B,GAC1C,MAAqB,iBAAVA,EAA2Bhb,KAAKimC,KAAKjrB,GACzChb,KAAK6xC,KAAK72B,EACnB,EAEAioB,EAAe3iC,UAAU2lC,KAAO,SAAcjrB,GAC5C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKhC,GAGpC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUuxC,KAAO,SAAcrR,GAE5C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKwjB,EAAO5c,IAAIpiB,EAAGwb,IAGlD,OAAOhd,IACT,EAEAijC,EAAe2O,IAAM,SAAapR,EAAQxlB,GAExC,OADkB,IAAIuoB,EAAO/C,GACZoR,IAAI52B,EACvB,EACAioB,EAAe3iC,UAAUwxC,SAAW7O,EAAe3iC,UAAUsxC,IAC7D3O,EAAe3iC,UAAUyxC,UAAY9O,EAAe3iC,UAAU2lC,KAC9DhD,EAAe3iC,UAAU0xC,UAAY/O,EAAe3iC,UAAUuxC,KAC9D5O,EAAe6O,SAAW7O,EAAe2O,IAEzC3O,EAAe3iC,UAAU2xC,IAAM,SAAaj3B,GAC1C,MAAqB,iBAAVA,EAA2Bhb,KAAKkyC,KAAKl3B,GACzChb,KAAKmyC,KAAKn3B,EACnB,EAEAioB,EAAe3iC,UAAU4xC,KAAO,SAAcl3B,GAC5C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKhC,GAGpC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAU6xC,KAAO,SAAc3R,GAE5C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKwjB,EAAO5c,IAAIpiB,EAAGwb,IAGlD,OAAOhd,IACT,EAEAijC,EAAegP,IAAM,SAAazR,EAAQxlB,GAExC,OADkB,IAAIuoB,EAAO/C,GACZyR,IAAIj3B,EACvB,EACAioB,EAAe3iC,UAAU8xC,OAASnP,EAAe3iC,UAAU2xC,IAC3DhP,EAAe3iC,UAAU+xC,QAAUpP,EAAe3iC,UAAU4xC,KAC5DjP,EAAe3iC,UAAUgyC,QAAUrP,EAAe3iC,UAAU6xC,KAC5DlP,EAAemP,OAASnP,EAAegP,IAEvChP,EAAe3iC,UAAUiyC,IAAM,SAAav3B,GAC1C,MAAqB,iBAAVA,EAA2Bhb,KAAKwyC,KAAKx3B,GACzChb,KAAKyyC,KAAKz3B,EACnB,EAEAioB,EAAe3iC,UAAUkyC,KAAO,SAAcx3B,GAC5C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKhC,GAGpC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUmyC,KAAO,SAAcjS,GAE5C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKwjB,EAAO5c,IAAIpiB,EAAGwb,IAGlD,OAAOhd,IACT,EAEAijC,EAAesP,IAAM,SAAa/R,EAAQxlB,GAExC,OADkB,IAAIuoB,EAAO/C,GACZ+R,IAAIv3B,EACvB,EACAioB,EAAe3iC,UAAUoyC,QAAUzP,EAAe3iC,UAAUiyC,IAC5DtP,EAAe3iC,UAAUqyC,SAAW1P,EAAe3iC,UAAUkyC,KAC7DvP,EAAe3iC,UAAUsyC,SAAW3P,EAAe3iC,UAAUmyC,KAC7DxP,EAAeyP,QAAUzP,EAAesP,IAExCtP,EAAe3iC,UAAUuyC,IAAM,SAAa73B,GAC1C,MAAqB,iBAAVA,EAA2Bhb,KAAK8yC,KAAK93B,GACzChb,KAAK+yC,KAAK/3B,EACnB,EAEAioB,EAAe3iC,UAAUwyC,KAAO,SAAc93B,GAC5C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKhC,GAGpC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUyyC,KAAO,SAAcvS,GAE5C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKwjB,EAAO5c,IAAIpiB,EAAGwb,IAGlD,OAAOhd,IACT,EAEAijC,EAAe4P,IAAM,SAAarS,EAAQxlB,GAExC,OADkB,IAAIuoB,EAAO/C,GACZqS,IAAI73B,EACvB,EAEAioB,EAAe3iC,UAAU0yC,GAAK,SAAYh4B,GACxC,MAAqB,iBAAVA,EAA2Bhb,KAAKizC,IAAIj4B,GACxChb,KAAKkzC,IAAIl4B,EAClB,EAEAioB,EAAe3iC,UAAU2yC,IAAM,SAAaj4B,GAC1C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKhC,GAGpC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAU4yC,IAAM,SAAa1S,GAE1C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKwjB,EAAO5c,IAAIpiB,EAAGwb,IAGlD,OAAOhd,IACT,EAEAijC,EAAe+P,GAAK,SAAYxS,EAAQxlB,GAEtC,OADkB,IAAIuoB,EAAO/C,GACZwS,GAAGh4B,EACtB,EAEAioB,EAAe3iC,UAAU6yC,IAAM,SAAan4B,GAC1C,MAAqB,iBAAVA,EAA2Bhb,KAAKozC,KAAKp4B,GACzChb,KAAKqzC,KAAKr4B,EACnB,EAEAioB,EAAe3iC,UAAU8yC,KAAO,SAAcp4B,GAC5C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKhC,GAGpC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAU+yC,KAAO,SAAc7S,GAE5C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,GAAKwjB,EAAO5c,IAAIpiB,EAAGwb,IAGlD,OAAOhd,IACT,EAEAijC,EAAekQ,IAAM,SAAa3S,EAAQxlB,GAExC,OADkB,IAAIuoB,EAAO/C,GACZ2S,IAAIn4B,EACvB,EAEAioB,EAAe3iC,UAAUgzC,UAAY,SAAmBt4B,GACtD,MAAqB,iBAAVA,EAA2Bhb,KAAKuzC,WAAWv4B,GAC/Chb,KAAKwzC,WAAWx4B,EACzB,EAEAioB,EAAe3iC,UAAUizC,WAAa,SAAoBv4B,GACxD,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,IAAMhC,GAGrC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUkzC,WAAa,SAAoBhT,GAExD,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,IAAMwjB,EAAO5c,IAAIpiB,EAAGwb,IAGnD,OAAOhd,IACT,EAEAijC,EAAeqQ,UAAY,SAAmB9S,EAAQxlB,GAEpD,OADkB,IAAIuoB,EAAO/C,GACZ8S,UAAUt4B,EAC7B,EAEAioB,EAAe3iC,UAAUmzC,0BAA4B,SAAmCz4B,GACtF,MAAqB,iBAAVA,EAA2Bhb,KAAK0zC,2BAA2B14B,GAC/Dhb,KAAK2zC,2BAA2B34B,EACzC,EAEAioB,EAAe3iC,UAAUozC,2BAA6B,SAAoC14B,GACxF,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,IAAMhC,GAGrC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUqzC,2BAA6B,SAAoCnT,GAExF,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,IAAMwjB,EAAO5c,IAAIpiB,EAAGwb,IAGnD,OAAOhd,IACT,EAEAijC,EAAewQ,0BAA4B,SAAmCjT,EAAQxlB,GAEpF,OADkB,IAAIuoB,EAAO/C,GACZiT,0BAA0Bz4B,EAC7C,EAEAioB,EAAe3iC,UAAUszC,WAAa,SAAoB54B,GACxD,MAAqB,iBAAVA,EAA2Bhb,KAAK6zC,YAAY74B,GAChDhb,KAAK8zC,YAAY94B,EAC1B,EAEAioB,EAAe3iC,UAAUuzC,YAAc,SAAqB74B,GAC1D,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,KAAOhC,GAGtC,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUwzC,YAAc,SAAqBtT,GAE1D,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAGhd,KAAK4jB,IAAIpiB,EAAGwb,KAAOwjB,EAAO5c,IAAIpiB,EAAGwb,IAGpD,OAAOhd,IACT,EAEAijC,EAAe2Q,WAAa,SAAoBpT,EAAQxlB,GAEtD,OADkB,IAAIuoB,EAAO/C,GACZoT,WAAW54B,EAC9B,EACAioB,EAAe3iC,UAAUyzC,mBAAqB9Q,EAAe3iC,UAAUszC,WACvE3Q,EAAe3iC,UAAU0zC,oBAAsB/Q,EAAe3iC,UAAUuzC,YACxE5Q,EAAe3iC,UAAU2zC,oBAAsBhR,EAAe3iC,UAAUwzC,YACxE7Q,EAAe8Q,mBAAqB9Q,EAAe2Q,WAEnD3Q,EAAe3iC,UAAU4zC,IAAM,WAC7B,IAAK,IAAI1yC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,GAAKhd,KAAK4jB,IAAIpiB,EAAGwb,IAGjC,OAAOhd,IACT,EAEAijC,EAAeiR,IAAM,SAAa1T,GAEhC,OADkB,IAAI+C,EAAO/C,GACZ0T,KACnB,EAEAjR,EAAe3iC,UAAUgH,IAAM,WAC7B,IAAK,IAAI9F,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKgF,IAAItH,KAAK4jB,IAAIpiB,EAAGwb,KAGxC,OAAOhd,IACT,EAEAijC,EAAe37B,IAAM,SAAak5B,GAEhC,OADkB,IAAI+C,EAAO/C,GACZl5B,KACnB,EAEA27B,EAAe3iC,UAAU6zC,KAAO,WAC9B,IAAK,IAAI3yC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK6xC,KAAKn0C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAekR,KAAO,SAAc3T,GAElC,OADkB,IAAI+C,EAAO/C,GACZ2T,MACnB,EAEAlR,EAAe3iC,UAAU8zC,MAAQ,WAC/B,IAAK,IAAI5yC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK8xC,MAAMp0C,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAemR,MAAQ,SAAe5T,GAEpC,OADkB,IAAI+C,EAAO/C,GACZ4T,OACnB,EAEAnR,EAAe3iC,UAAU+zC,KAAO,WAC9B,IAAK,IAAI7yC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK+xC,KAAKr0C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAeoR,KAAO,SAAc7T,GAElC,OADkB,IAAI+C,EAAO/C,GACZ6T,MACnB,EAEApR,EAAe3iC,UAAUg0C,MAAQ,WAC/B,IAAK,IAAI9yC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKgyC,MAAMt0C,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAeqR,MAAQ,SAAe9T,GAEpC,OADkB,IAAI+C,EAAO/C,GACZ8T,OACnB,EAEArR,EAAe3iC,UAAUi0C,KAAO,WAC9B,IAAK,IAAI/yC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKiyC,KAAKv0C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAesR,KAAO,SAAc/T,GAElC,OADkB,IAAI+C,EAAO/C,GACZ+T,MACnB,EAEAtR,EAAe3iC,UAAUk0C,MAAQ,WAC/B,IAAK,IAAIhzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKkyC,MAAMx0C,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAeuR,MAAQ,SAAehU,GAEpC,OADkB,IAAI+C,EAAO/C,GACZgU,OACnB,EAEAvR,EAAe3iC,UAAUm0C,KAAO,WAC9B,IAAK,IAAIjzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKmyC,KAAKz0C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAewR,KAAO,SAAcjU,GAElC,OADkB,IAAI+C,EAAO/C,GACZiU,MACnB,EAEAxR,EAAe3iC,UAAU6T,KAAO,WAC9B,IAAK,IAAI3S,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK6R,KAAKnU,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAe9uB,KAAO,SAAcqsB,GAElC,OADkB,IAAI+C,EAAO/C,GACZrsB,MACnB,EAEA8uB,EAAe3iC,UAAUo0C,MAAQ,WAC/B,IAAK,IAAIlzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKoyC,MAAM10C,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAeyR,MAAQ,SAAelU,GAEpC,OADkB,IAAI+C,EAAO/C,GACZkU,OACnB,EAEAzR,EAAe3iC,UAAUq0C,IAAM,WAC7B,IAAK,IAAInzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKqyC,IAAI30C,KAAK4jB,IAAIpiB,EAAGwb,KAGxC,OAAOhd,IACT,EAEAijC,EAAe0R,IAAM,SAAanU,GAEhC,OADkB,IAAI+C,EAAO/C,GACZmU,KACnB,EAEA1R,EAAe3iC,UAAUs0C,KAAO,WAC9B,IAAK,IAAIpzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKsyC,KAAK50C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAe2R,KAAO,SAAcpU,GAElC,OADkB,IAAI+C,EAAO/C,GACZoU,MACnB,EAEA3R,EAAe3iC,UAAUuhC,IAAM,WAC7B,IAAK,IAAIrgC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKu/B,IAAI7hC,KAAK4jB,IAAIpiB,EAAGwb,KAGxC,OAAOhd,IACT,EAEAijC,EAAepB,IAAM,SAAarB,GAEhC,OADkB,IAAI+C,EAAO/C,GACZqB,KACnB,EAEAoB,EAAe3iC,UAAUu0C,MAAQ,WAC/B,IAAK,IAAIrzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKuyC,MAAM70C,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAe4R,MAAQ,SAAerU,GAEpC,OADkB,IAAI+C,EAAO/C,GACZqU,OACnB,EAEA5R,EAAe3iC,UAAU2T,MAAQ,WAC/B,IAAK,IAAIzS,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK2R,MAAMjU,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAehvB,MAAQ,SAAeusB,GAEpC,OADkB,IAAI+C,EAAO/C,GACZvsB,OACnB,EAEAgvB,EAAe3iC,UAAUw0C,OAAS,WAChC,IAAK,IAAItzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKwyC,OAAO90C,KAAK4jB,IAAIpiB,EAAGwb,KAG3C,OAAOhd,IACT,EAEAijC,EAAe6R,OAAS,SAAgBtU,GAEtC,OADkB,IAAI+C,EAAO/C,GACZsU,QACnB,EAEA7R,EAAe3iC,UAAU4a,IAAM,WAC7B,IAAK,IAAI1Z,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK4Y,IAAIlb,KAAK4jB,IAAIpiB,EAAGwb,KAGxC,OAAOhd,IACT,EAEAijC,EAAe/nB,IAAM,SAAaslB,GAEhC,OADkB,IAAI+C,EAAO/C,GACZtlB,KACnB,EAEA+nB,EAAe3iC,UAAUy0C,MAAQ,WAC/B,IAAK,IAAIvzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKyyC,MAAM/0C,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAe8R,MAAQ,SAAevU,GAEpC,OADkB,IAAI+C,EAAO/C,GACZuU,OACnB,EAEA9R,EAAe3iC,UAAU00C,MAAQ,WAC/B,IAAK,IAAIxzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK0yC,MAAMh1C,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAe+R,MAAQ,SAAexU,GAEpC,OADkB,IAAI+C,EAAO/C,GACZwU,OACnB,EAEA/R,EAAe3iC,UAAU20C,KAAO,WAC9B,IAAK,IAAIzzC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK2yC,KAAKj1C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAegS,KAAO,SAAczU,GAElC,OADkB,IAAI+C,EAAO/C,GACZyU,MACnB,EAEAhS,EAAe3iC,UAAU6jC,MAAQ,WAC/B,IAAK,IAAI3iC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK6hC,MAAMnkC,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAekB,MAAQ,SAAe3D,GAEpC,OADkB,IAAI+C,EAAO/C,GACZ2D,OACnB,EAEAlB,EAAe3iC,UAAU40C,KAAO,WAC9B,IAAK,IAAI1zC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK4yC,KAAKl1C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAeiS,KAAO,SAAc1U,GAElC,OADkB,IAAI+C,EAAO/C,GACZ0U,MACnB,EAEAjS,EAAe3iC,UAAU60C,IAAM,WAC7B,IAAK,IAAI3zC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK6yC,IAAIn1C,KAAK4jB,IAAIpiB,EAAGwb,KAGxC,OAAOhd,IACT,EAEAijC,EAAekS,IAAM,SAAa3U,GAEhC,OADkB,IAAI+C,EAAO/C,GACZ2U,KACnB,EAEAlS,EAAe3iC,UAAU80C,KAAO,WAC9B,IAAK,IAAI5zC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK8yC,KAAKp1C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAemS,KAAO,SAAc5U,GAElC,OADkB,IAAI+C,EAAO/C,GACZ4U,MACnB,EAEAnS,EAAe3iC,UAAU+nC,KAAO,WAC9B,IAAK,IAAI7mC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK+lC,KAAKroC,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAeoF,KAAO,SAAc7H,GAElC,OADkB,IAAI+C,EAAO/C,GACZ6H,MACnB,EAEApF,EAAe3iC,UAAU+0C,IAAM,WAC7B,IAAK,IAAI7zC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAK+yC,IAAIr1C,KAAK4jB,IAAIpiB,EAAGwb,KAGxC,OAAOhd,IACT,EAEAijC,EAAeoS,IAAM,SAAa7U,GAEhC,OADkB,IAAI+C,EAAO/C,GACZ6U,KACnB,EAEApS,EAAe3iC,UAAUg1C,KAAO,WAC9B,IAAK,IAAI9zC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKgzC,KAAKt1C,KAAK4jB,IAAIpiB,EAAGwb,KAGzC,OAAOhd,IACT,EAEAijC,EAAeqS,KAAO,SAAc9U,GAElC,OADkB,IAAI+C,EAAO/C,GACZ8U,MACnB,EAEArS,EAAe3iC,UAAUi1C,MAAQ,WAC/B,IAAK,IAAI/zC,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKizC,MAAMv1C,KAAK4jB,IAAIpiB,EAAGwb,KAG1C,OAAOhd,IACT,EAEAijC,EAAesS,MAAQ,SAAe/U,GAEpC,OADkB,IAAI+C,EAAO/C,GACZ+U,OACnB,EAEAtS,EAAe0M,IAAM,SAAanP,EAAQxe,GAExC,OADkB,IAAIuhB,EAAO/C,GACZmP,IAAI3tB,EACvB,EAEAihB,EAAe3iC,UAAUqvC,IAAM,SAAa30B,GAC1C,MAAqB,iBAAVA,EAA2Bhb,KAAKw1C,KAAKx6B,GACzChb,KAAKy1C,KAAKz6B,EACnB,EAEAioB,EAAe3iC,UAAUk1C,KAAO,SAAcx6B,GAC5C,IAAK,IAAIxZ,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKqtC,IAAI3vC,KAAK4jB,IAAIpiB,EAAGwb,GAAIhC,IAG5C,OAAOhb,IACT,EAEAijC,EAAe3iC,UAAUm1C,KAAO,SAAcjV,GAE5C,GADAA,EAAS+C,EAAOiB,YAAYhE,GACxBxgC,KAAK6gC,OAASL,EAAOK,MACvB7gC,KAAK8gC,UAAYN,EAAOM,QACxB,MAAM,IAAIf,WAAW,qCAEvB,IAAK,IAAIv+B,EAAI,EAAGA,EAAIxB,KAAK6gC,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIhd,KAAK8gC,QAAS9jB,IAChChd,KAAK2jB,IAAIniB,EAAGwb,EAAG1a,KAAKqtC,IAAI3vC,KAAK4jB,IAAIpiB,EAAGwb,GAAIwjB,EAAO5c,IAAIpiB,EAAGwb,KAG1D,OAAOhd,IACT,CACF,CAy+DA01C,CAAsBzS,EAAgBM,GAMtC,MAAMoS,UAAwB1S,EAE5B,GAEA,QAAIzrB,GACF,OAAOxX,MAAK,EAAQwX,IACtB,CAEA,QAAIqpB,GACF,OAAO7gC,MAAK,EAAQ6gC,IACtB,CAEA,WAAIC,GACF,OAAO9gC,MAAK,EAAQ8gC,OACtB,CAEA,gBAAI8U,GACF,OAAO51C,KAAK6gC,IACd,CASA,wBAAOgV,CAAkB76B,GACvB,OAAOuoB,EAAOkB,SAASzpB,IAA8B,oBAApBA,EAAM86B,SACzC,CAMA,YAAOlS,CAAMgS,GACX,OAAO,IAAI51C,KAAK41C,EAClB,CAMA,WAAO/R,CAAK+R,GACV,OAAO,IAAI51C,KAAK41C,GAAc9R,KAAK,EACrC,CAMA,WAAApiB,CAAYk0B,GAGV,GAFAhF,QAEIrN,EAAOkB,SAASmR,GAAe,CACjC,IAAKA,EAAa1Q,cAChB,MAAM,IAAI5H,UAAU,sBAGtBt9B,MAAK,EAAUujC,EAAO9hB,KACpBm0B,EACA,IAAIrS,EAAOqS,EAAa/U,KAAM+U,EAAa/U,MAE/C,MAAO,GAAIn5B,OAAOi4B,UAAUiW,IAAiBA,GAAgB,EAC3D51C,MAAK,EAAU,IAAIujC,EAAOqS,EAAcA,QAIxC,GAFA51C,MAAK,EAAU,IAAIujC,EAAOqS,IAErB51C,KAAKklC,cACR,MAAM,IAAI5H,UAAU,qBAG1B,CAEA,KAAA3a,GACE,MAAM6d,EAAS,IAAImV,EAAgB31C,KAAK41C,cAExC,IAAK,MAAOpS,EAAK4M,EAAKp1B,KAAUhb,KAAK+1C,oBACnCvV,EAAO7c,IAAI6f,EAAK4M,EAAKp1B,GAGvB,OAAOwlB,CACT,CAEA,QAAAwV,GACE,OAAO,IAAIzS,EAAOvjC,KACpB,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,MAAK,EAAQ4jB,IAAIqqB,EAAUC,EACpC,CACA,GAAAvqB,CAAIsqB,EAAUC,EAAalzB,GAKzB,OAHAhb,MAAK,EAAQ2jB,IAAIsqB,EAAUC,EAAalzB,GACxChb,MAAK,EAAQ2jB,IAAIuqB,EAAaD,EAAUjzB,GAEjChb,IACT,CAEA,WAAAi2C,CAAYzoC,GAKV,OAHAxN,MAAK,EAAQgxC,UAAUxjC,GACvBxN,MAAK,EAAQkxC,aAAa1jC,GAEnBxN,IACT,CAEA,QAAAk2C,CAAS1oC,EAAOqY,QACAriB,IAAVqiB,IACFA,EAAQrY,EACRA,EAAQxN,KAAK41C,cAGf,MAAMpS,EAAM3d,EAAMpT,QAMlB,OALA+wB,EAAI1K,OAAOtrB,EAAO,GAElBxN,MAAK,EAAQixC,OAAOzjC,EAAOg2B,GAC3BxjC,MAAK,EAAQoxC,UAAU5jC,EAAOqY,GAEvB7lB,IACT,CAKA,SAAAm2C,CAAUC,GACR,GAAIA,EAAK33C,SAAWuB,KAAK41C,aACvB,MAAM,IAAI7V,WAAW,2CAKvB,MAAMsW,EAAgB,GACtB,IAAK,MAAO7oC,EAAO8oC,KAAiBF,EAAKrnC,UACnCunC,GACJD,EAAct5C,KAAKyQ,GAGrB6oC,EAActtC,UAGd,IAAK,MAAMwtC,KAAaF,EACtBr2C,KAAKi2C,YAAYM,GAGnB,OAAOv2C,IACT,CAoBA,SAAAw2C,GACE,MAAM,aAAEZ,GAAiB51C,KAGnBy2C,EAAU,IAAInpC,MAAOsoC,GAAgBA,EAAe,GAAM,GAChE,IAAK,IAAIxF,EAAM,EAAG5M,EAAM,EAAGh2B,EAAQ,EAAGA,EAAQipC,EAAQh4C,OAAQ+O,IAC5DipC,EAAQjpC,GAASxN,KAAK4jB,IAAI4f,EAAK4M,KAEzBA,GAAOwF,IAAcxF,IAAQ5M,GAGrC,OAAOiT,CACT,CAMA,kBAAOC,CAAYD,GACjB,MAAME,EAAcF,EAAQh4C,OAItBm3C,GAAgBtzC,KAAK+lC,KAAK,EAAIsO,EAAc,GAAK,GAAK,EAE5D,IAAKjvC,OAAOi4B,UAAUiW,GACpB,MAAM,IAAItY,UACR,qEAAqE38B,KAAKC,UACxE61C,MAKN,MAAMjW,EAAS,IAAImV,EAAgBC,GACnC,IAAK,IAAIxF,EAAM,EAAG5M,EAAM,EAAGh2B,EAAQ,EAAGA,EAAQmpC,EAAanpC,IACzDgzB,EAAO7c,IAAIysB,EAAK5M,EAAKiT,EAAQjpC,MACvB4iC,GAAOwF,IAAcxF,IAAQ5M,GAGrC,OAAOhD,CACT,CAQA,kBAACuV,GACC,IAAK,IAAIvS,EAAM,EAAG4M,EAAM,EAAG5M,EAAMxjC,KAAK41C,kBAAc,EAAQ,CAC1D,MAAM56B,EAAQhb,KAAK4jB,IAAI4f,EAAK4M,QAEtB,CAAC5M,EAAK4M,EAAKp1B,KAGXo1B,GAAOpwC,KAAK41C,eAAcxF,IAAQ5M,EAC1C,CACF,CAQA,iBAACoT,GACC,IAAK,IAAIpT,EAAM,EAAG4M,EAAM,EAAG5M,EAAMxjC,KAAK41C,kBAAc,EAAQ,CAC1D,MAAM56B,EAAQhb,KAAK4jB,IAAI4f,EAAK4M,SAEtBp1B,IAGAo1B,GAAOpwC,KAAK41C,eAAcxF,IAAQ5M,EAC1C,CACF,EAEFmS,EAAgBr1C,UAAUw1C,UAAY,kBAEtC,MAAMe,UAAuBlB,EAQ3B,uBAAOmB,CAAiB97B,GACtB,OACE26B,EAAgBE,kBAAkB76B,IACX,mBAAvBA,EAAM+7B,YAEV,CAEA,WAAAr1B,CAAYs1B,GAGV,GAFApG,MAAMoG,IAEDh3C,KAAKmlC,aACR,MAAM,IAAI7H,UAAU,qDAExB,CAEA,GAAA3Z,CAAIsqB,EAAUC,EAAalzB,GAIzB,OAFIizB,IAAaC,IAAalzB,EAAQ,GAE/B41B,MAAMjtB,IAAIsqB,EAAUC,EAAalzB,EAC1C,CAEA,QAAAk7B,CAAS1oC,EAAOqY,GAUd,YATcriB,IAAVqiB,IACFA,EAAQrY,EACRA,EAAQxN,KAAK41C,eAIf/vB,EAAQA,EAAMpT,SACRjF,GAAS,EAERojC,MAAMsF,SAAS1oC,EAAOqY,EAC/B,CAEA,iBAAAoxB,GACE,OAAO,IAAItB,EAAgB31C,KAC7B,CAEA,KAAA2iB,GACE,MAAM6d,EAAS,IAAIqW,EAAe72C,KAAK41C,cAEvC,IAAK,MAAOpS,EAAK4M,EAAKp1B,KAAUhb,KAAK+1C,oBAC/BvS,IAAQ4M,GACZ5P,EAAO7c,IAAI6f,EAAK4M,EAAKp1B,GAGvB,OAAOwlB,CACT,CAqBA,SAAAgW,GACE,MAAM,aAAEZ,GAAiB51C,KAInBy2C,EAAU,IAAInpC,OAHIsoC,EAAe,GAAKA,EAAgB,GAI5D,IAAK,IAAIxF,EAAM,EAAG5M,EAAM,EAAGh2B,EAAQ,EAAGA,EAAQipC,EAAQh4C,OAAQ+O,IAC5DipC,EAAQjpC,GAASxN,KAAK4jB,IAAI4f,EAAK4M,KAEzBA,GAAOwF,IAAcxF,EAAc,KAAN5M,GAGrC,OAAOiT,CACT,CAKA,kBAAOC,CAAYD,GACjB,MAAME,EAAcF,EAAQh4C,OAGtBm3C,GAAgBtzC,KAAK+lC,KAAK,EAAIsO,EAAc,GAAK,GAAK,EAE5D,IAAKjvC,OAAOi4B,UAAUiW,GACpB,MAAM,IAAItY,UACR,mEAAmE38B,KAAKC,UACtE61C,MAKN,MAAMjW,EAAS,IAAIxgC,KAAK41C,GACxB,IAAK,IAAIxF,EAAM,EAAG5M,EAAM,EAAGh2B,EAAQ,EAAGA,EAAQmpC,EAAanpC,IACzDgzB,EAAO7c,IAAIysB,EAAK5M,EAAKiT,EAAQjpC,MACvB4iC,GAAOwF,IAAcxF,EAAc,KAAN5M,GAGrC,OAAOhD,CACT,EAEFqW,EAAev2C,UAAUy2C,aAAe,iBAExC,MAAMG,UAAiBjU,EACrB,WAAAvhB,CAAY8e,EAAQK,EAAMC,GACxB8P,QACA5wC,KAAKwgC,OAASA,EACdxgC,KAAK6gC,KAAOA,EACZ7gC,KAAK8gC,QAAUA,CACjB,EAqGF,MAAMqW,UAA4BD,EAChC,WAAAx1B,CAAY8e,EAAQ8B,EAAYE,GAC9BH,EAAgB7B,EAAQ8B,GACxBC,EAAmB/B,EAAQgC,GAC3BoO,MAAMpQ,EAAQ8B,EAAW7jC,OAAQ+jC,EAAc/jC,QAC/CuB,KAAKsiC,WAAaA,EAClBtiC,KAAKwiC,cAAgBA,CACvB,CAEA,GAAA7e,CAAIsqB,EAAUC,EAAalzB,GAMzB,OALAhb,KAAKwgC,OAAO7c,IACV3jB,KAAKsiC,WAAW2L,GAChBjuC,KAAKwiC,cAAc0L,GACnBlzB,GAEKhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKwgC,OAAO5c,IACjB5jB,KAAKsiC,WAAW2L,GAChBjuC,KAAKwiC,cAAc0L,GAEvB,EA2CF,MAAMkJ,UAAwBnU,EAC5B,WAAAvhB,CAAY4D,EAAM5C,EAAU,CAAC,GAC3B,MAAM,KAAEme,EAAO,GAAMne,EAErB,GAAI4C,EAAK7mB,OAASoiC,GAAS,EACzB,MAAM,IAAIjmB,MAAM,0DAElBg2B,QACA5wC,KAAK6gC,KAAOA,EACZ7gC,KAAK8gC,QAAUxb,EAAK7mB,OAASoiC,EAC7B7gC,KAAKslB,KAAOA,CACd,CAEA,GAAA3B,CAAIsqB,EAAUC,EAAalzB,GACzB,IAAIxN,EAAQxN,KAAKq3C,gBAAgBpJ,EAAUC,GAE3C,OADAluC,KAAKslB,KAAK9X,GAASwN,EACZhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,IAAI1gC,EAAQxN,KAAKq3C,gBAAgBpJ,EAAUC,GAC3C,OAAOluC,KAAKslB,KAAK9X,EACnB,CAEA,eAAA6pC,CAAgB7T,EAAKC,GACnB,OAAOD,EAAMxjC,KAAK8gC,QAAU2C,CAC9B,EAGF,MAAM6T,UAAwBrU,EAC5B,WAAAvhB,CAAY4D,GACVsrB,QACA5wC,KAAKslB,KAAOA,EACZtlB,KAAK6gC,KAAOvb,EAAK7mB,OACjBuB,KAAK8gC,QAAUxb,EAAK,GAAG7mB,MACzB,CAEA,GAAAklB,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKslB,KAAK2oB,GAAUC,GAAelzB,EAC5Bhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKslB,KAAK2oB,GAAUC,EAC7B,EAeF,MAAMqJ,EACJ,WAAA71B,CAAY8e,GAGV,IAKIh/B,EAAGwb,EAAG3c,EAAGiI,EAAGugC,EAAG5hC,EAAGtK,EAClB66C,EAAQC,EANRC,GAFJlX,EAAS8W,EAAgB9S,YAAYhE,IAErB7d,QACZke,EAAO6W,EAAG7W,KACVC,EAAU4W,EAAG5W,QACb6W,EAAc,IAAI/O,aAAa/H,GAC/B+W,EAAY,EAIhB,IAAKp2C,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACpBm2C,EAAYn2C,GAAKA,EAKnB,IAFAg2C,EAAS,IAAI5O,aAAa/H,GAErB7jB,EAAI,EAAGA,EAAI8jB,EAAS9jB,IAAK,CAC5B,IAAKxb,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACpBg2C,EAAOh2C,GAAKk2C,EAAG9zB,IAAIpiB,EAAGwb,GAGxB,IAAKxb,EAAI,EAAGA,EAAIq/B,EAAMr/B,IAAK,CAGzB,IAFAi2C,EAAOn1C,KAAK+F,IAAI7G,EAAGwb,GACnB6rB,EAAI,EACCxoC,EAAI,EAAGA,EAAIo3C,EAAMp3C,IACpBwoC,GAAK6O,EAAG9zB,IAAIpiB,EAAGnB,GAAKm3C,EAAOn3C,GAE7Bm3C,EAAOh2C,IAAMqnC,EACb6O,EAAG/zB,IAAIniB,EAAGwb,EAAGw6B,EAAOh2C,GACtB,CAGA,IADA8G,EAAI0U,EACCxb,EAAIwb,EAAI,EAAGxb,EAAIq/B,EAAMr/B,IACpBc,KAAKgF,IAAIkwC,EAAOh2C,IAAMc,KAAKgF,IAAIkwC,EAAOlvC,MACxCA,EAAI9G,GAIR,GAAI8G,IAAM0U,EAAG,CACX,IAAK3c,EAAI,EAAGA,EAAIygC,EAASzgC,IACvB4G,EAAIywC,EAAG9zB,IAAItb,EAAGjI,GACdq3C,EAAG/zB,IAAIrb,EAAGjI,EAAGq3C,EAAG9zB,IAAI5G,EAAG3c,IACvBq3C,EAAG/zB,IAAI3G,EAAG3c,EAAG4G,GAGftK,EAAIg7C,EAAYrvC,GAChBqvC,EAAYrvC,GAAKqvC,EAAY36B,GAC7B26B,EAAY36B,GAAKrgB,EAEjBi7C,GAAaA,CACf,CAEA,GAAI56B,EAAI6jB,GAAyB,IAAjB6W,EAAG9zB,IAAI5G,EAAGA,GACxB,IAAKxb,EAAIwb,EAAI,EAAGxb,EAAIq/B,EAAMr/B,IACxBk2C,EAAG/zB,IAAIniB,EAAGwb,EAAG06B,EAAG9zB,IAAIpiB,EAAGwb,GAAK06B,EAAG9zB,IAAI5G,EAAGA,GAG5C,CAEAhd,KAAK63C,GAAKH,EACV13C,KAAK23C,YAAcA,EACnB33C,KAAK43C,UAAYA,CACnB,CAEA,UAAAE,GACE,IAAIxyB,EAAOtlB,KAAK63C,GACZzH,EAAM9qB,EAAKwb,QACf,IAAK,IAAI9jB,EAAI,EAAGA,EAAIozB,EAAKpzB,IACvB,GAAuB,IAAnBsI,EAAK1B,IAAI5G,EAAGA,GACd,OAAO,EAGX,OAAO,CACT,CAEA,KAAA+6B,CAAM/8B,GACJA,EAAQuoB,EAAOiB,YAAYxpB,GAE3B,IAAI08B,EAAK13C,KAAK63C,GAGd,GAFWH,EAAG7W,OAED7lB,EAAM6lB,KACjB,MAAM,IAAIjmB,MAAM,6BAElB,GAAI5a,KAAK83C,aACP,MAAM,IAAIl9B,MAAM,yBAGlB,IAGIpZ,EAAGwb,EAAG3c,EAHNw5B,EAAQ7e,EAAM8lB,QACdkX,EAAIh9B,EAAM6yB,aAAa7tC,KAAK23C,YAAa,EAAG9d,EAAQ,GACpDiH,EAAU4W,EAAG5W,QAGjB,IAAKzgC,EAAI,EAAGA,EAAIygC,EAASzgC,IACvB,IAAKmB,EAAInB,EAAI,EAAGmB,EAAIs/B,EAASt/B,IAC3B,IAAKwb,EAAI,EAAGA,EAAI6c,EAAO7c,IACrBg7B,EAAEr0B,IAAIniB,EAAGwb,EAAGg7B,EAAEp0B,IAAIpiB,EAAGwb,GAAKg7B,EAAEp0B,IAAIvjB,EAAG2c,GAAK06B,EAAG9zB,IAAIpiB,EAAGnB,IAIxD,IAAKA,EAAIygC,EAAU,EAAGzgC,GAAK,EAAGA,IAAK,CACjC,IAAK2c,EAAI,EAAGA,EAAI6c,EAAO7c,IACrBg7B,EAAEr0B,IAAItjB,EAAG2c,EAAGg7B,EAAEp0B,IAAIvjB,EAAG2c,GAAK06B,EAAG9zB,IAAIvjB,EAAGA,IAEtC,IAAKmB,EAAI,EAAGA,EAAInB,EAAGmB,IACjB,IAAKwb,EAAI,EAAGA,EAAI6c,EAAO7c,IACrBg7B,EAAEr0B,IAAIniB,EAAGwb,EAAGg7B,EAAEp0B,IAAIpiB,EAAGwb,GAAKg7B,EAAEp0B,IAAIvjB,EAAG2c,GAAK06B,EAAG9zB,IAAIpiB,EAAGnB,GAGxD,CACA,OAAO23C,CACT,CAEA,eAAIC,GACF,IAAI3yB,EAAOtlB,KAAK63C,GAChB,IAAKvyB,EAAK2f,WACR,MAAM,IAAIrqB,MAAM,yBAElB,IAAIq9B,EAAcj4C,KAAK43C,UACnBxH,EAAM9qB,EAAKwb,QACf,IAAK,IAAI9jB,EAAI,EAAGA,EAAIozB,EAAKpzB,IACvBi7B,GAAe3yB,EAAK1B,IAAI5G,EAAGA,GAE7B,OAAOi7B,CACT,CAEA,yBAAIC,GACF,IAAI5yB,EAAOtlB,KAAK63C,GACZhX,EAAOvb,EAAKub,KACZC,EAAUxb,EAAKwb,QACfkX,EAAI,IAAIzU,EAAO1C,EAAMC,GACzB,IAAK,IAAIt/B,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxB,IAAK,IAAIwb,EAAI,EAAGA,EAAI8jB,EAAS9jB,IACvBxb,EAAIwb,EACNg7B,EAAEr0B,IAAIniB,EAAGwb,EAAGsI,EAAK1B,IAAIpiB,EAAGwb,IACfxb,IAAMwb,EACfg7B,EAAEr0B,IAAIniB,EAAGwb,EAAG,GAEZg7B,EAAEr0B,IAAIniB,EAAGwb,EAAG,GAIlB,OAAOg7B,CACT,CAEA,yBAAIG,GACF,IAAI7yB,EAAOtlB,KAAK63C,GACZhX,EAAOvb,EAAKub,KACZC,EAAUxb,EAAKwb,QACfkX,EAAI,IAAIzU,EAAO1C,EAAMC,GACzB,IAAK,IAAIt/B,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACxB,IAAK,IAAIwb,EAAI,EAAGA,EAAI8jB,EAAS9jB,IACvBxb,GAAKwb,EACPg7B,EAAEr0B,IAAIniB,EAAGwb,EAAGsI,EAAK1B,IAAIpiB,EAAGwb,IAExBg7B,EAAEr0B,IAAIniB,EAAGwb,EAAG,GAIlB,OAAOg7B,CACT,CAEA,0BAAII,GACF,OAAO9qC,MAAM8gC,KAAKpuC,KAAK23C,YACzB,EAGF,SAASU,EAAW9L,EAAGrlC,GACrB,IAAIG,EAAI,EACR,OAAI/E,KAAKgF,IAAIilC,GAAKjqC,KAAKgF,IAAIJ,IACzBG,EAAIH,EAAIqlC,EACDjqC,KAAKgF,IAAIilC,GAAKjqC,KAAK+lC,KAAK,EAAIhhC,EAAIA,IAE/B,IAANH,GACFG,EAAIklC,EAAIrlC,EACD5E,KAAKgF,IAAIJ,GAAK5E,KAAK+lC,KAAK,EAAIhhC,EAAIA,IAElC,CACT,CAEA,MAAMixC,EACJ,WAAA52B,CAAY1G,GAGV,IAIIxZ,EAAGwb,EAAG3c,EAAGwoC,EAJT0P,GAFJv9B,EAAQs8B,EAAgB9S,YAAYxpB,IAErB2H,QACXijB,EAAI5qB,EAAM6lB,KACV9P,EAAI/V,EAAM8lB,QACV0X,EAAQ,IAAI5P,aAAa7X,GAG7B,IAAK1wB,EAAI,EAAGA,EAAI0wB,EAAG1wB,IAAK,CACtB,IAAIo4C,EAAM,EACV,IAAKj3C,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACjBi3C,EAAMJ,EAAWI,EAAKF,EAAG30B,IAAIpiB,EAAGnB,IAElC,GAAY,IAARo4C,EAAW,CAIb,IAHIF,EAAG30B,IAAIvjB,EAAGA,GAAK,IACjBo4C,GAAOA,GAEJj3C,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACjB+2C,EAAG50B,IAAIniB,EAAGnB,EAAGk4C,EAAG30B,IAAIpiB,EAAGnB,GAAKo4C,GAG9B,IADAF,EAAG50B,IAAItjB,EAAGA,EAAGk4C,EAAG30B,IAAIvjB,EAAGA,GAAK,GACvB2c,EAAI3c,EAAI,EAAG2c,EAAI+T,EAAG/T,IAAK,CAE1B,IADA6rB,EAAI,EACCrnC,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACjBqnC,GAAK0P,EAAG30B,IAAIpiB,EAAGnB,GAAKk4C,EAAG30B,IAAIpiB,EAAGwb,GAGhC,IADA6rB,GAAKA,EAAI0P,EAAG30B,IAAIvjB,EAAGA,GACdmB,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACjB+2C,EAAG50B,IAAIniB,EAAGwb,EAAGu7B,EAAG30B,IAAIpiB,EAAGwb,GAAK6rB,EAAI0P,EAAG30B,IAAIpiB,EAAGnB,GAE9C,CACF,CACAm4C,EAAMn4C,IAAMo4C,CACd,CAEAz4C,KAAK04C,GAAKH,EACVv4C,KAAK24C,MAAQH,CACf,CAEA,KAAAT,CAAM/8B,GACJA,EAAQuoB,EAAOiB,YAAYxpB,GAE3B,IAAIu9B,EAAKv4C,KAAK04C,GACV9S,EAAI2S,EAAG1X,KAEX,GAAI7lB,EAAM6lB,OAAS+E,EACjB,MAAM,IAAIhrB,MAAM,oCAElB,IAAK5a,KAAK44C,aACR,MAAM,IAAIh+B,MAAM,4BAGlB,IAGIpZ,EAAGwb,EAAG3c,EAAGwoC,EAHThP,EAAQ7e,EAAM8lB,QACdkX,EAAIh9B,EAAM2H,QACVoO,EAAIwnB,EAAGzX,QAGX,IAAKzgC,EAAI,EAAGA,EAAI0wB,EAAG1wB,IACjB,IAAK2c,EAAI,EAAGA,EAAI6c,EAAO7c,IAAK,CAE1B,IADA6rB,EAAI,EACCrnC,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACjBqnC,GAAK0P,EAAG30B,IAAIpiB,EAAGnB,GAAK23C,EAAEp0B,IAAIpiB,EAAGwb,GAG/B,IADA6rB,GAAKA,EAAI0P,EAAG30B,IAAIvjB,EAAGA,GACdmB,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACjBw2C,EAAEr0B,IAAIniB,EAAGwb,EAAGg7B,EAAEp0B,IAAIpiB,EAAGwb,GAAK6rB,EAAI0P,EAAG30B,IAAIpiB,EAAGnB,GAE5C,CAEF,IAAKA,EAAI0wB,EAAI,EAAG1wB,GAAK,EAAGA,IAAK,CAC3B,IAAK2c,EAAI,EAAGA,EAAI6c,EAAO7c,IACrBg7B,EAAEr0B,IAAItjB,EAAG2c,EAAGg7B,EAAEp0B,IAAIvjB,EAAG2c,GAAKhd,KAAK24C,MAAMt4C,IAEvC,IAAKmB,EAAI,EAAGA,EAAInB,EAAGmB,IACjB,IAAKwb,EAAI,EAAGA,EAAI6c,EAAO7c,IACrBg7B,EAAEr0B,IAAIniB,EAAGwb,EAAGg7B,EAAEp0B,IAAIpiB,EAAGwb,GAAKg7B,EAAEp0B,IAAIvjB,EAAG2c,GAAKu7B,EAAG30B,IAAIpiB,EAAGnB,GAGxD,CAEA,OAAO23C,EAAEtL,UAAU,EAAG3b,EAAI,EAAG,EAAG8I,EAAQ,EAC1C,CAEA,UAAA+e,GACE,IAAI9X,EAAU9gC,KAAK04C,GAAG5X,QACtB,IAAK,IAAIt/B,EAAI,EAAGA,EAAIs/B,EAASt/B,IAC3B,GAAsB,IAAlBxB,KAAK24C,MAAMn3C,GACb,OAAO,EAGX,OAAO,CACT,CAEA,yBAAI22C,GACF,IAGI32C,EAAGwb,EAHHu7B,EAAKv4C,KAAK04C,GACV3nB,EAAIwnB,EAAGzX,QACPkX,EAAI,IAAIzU,EAAOxS,EAAGA,GAEtB,IAAKvvB,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACjB,IAAKwb,EAAI,EAAGA,EAAI+T,EAAG/T,IACbxb,EAAIwb,EACNg7B,EAAEr0B,IAAIniB,EAAGwb,EAAGu7B,EAAG30B,IAAIpiB,EAAGwb,IACbxb,IAAMwb,EACfg7B,EAAEr0B,IAAIniB,EAAGwb,EAAGhd,KAAK24C,MAAMn3C,IAEvBw2C,EAAEr0B,IAAIniB,EAAGwb,EAAG,GAIlB,OAAOg7B,CACT,CAEA,oBAAIa,GACF,IAIIr3C,EAAGwb,EAAG3c,EAAGwoC,EAJT0P,EAAKv4C,KAAK04C,GACV7X,EAAO0X,EAAG1X,KACVC,EAAUyX,EAAGzX,QACbkX,EAAI,IAAIzU,EAAO1C,EAAMC,GAGzB,IAAKzgC,EAAIygC,EAAU,EAAGzgC,GAAK,EAAGA,IAAK,CACjC,IAAKmB,EAAI,EAAGA,EAAIq/B,EAAMr/B,IACpBw2C,EAAEr0B,IAAIniB,EAAGnB,EAAG,GAGd,IADA23C,EAAEr0B,IAAItjB,EAAGA,EAAG,GACP2c,EAAI3c,EAAG2c,EAAI8jB,EAAS9jB,IACvB,GAAqB,IAAjBu7B,EAAG30B,IAAIvjB,EAAGA,GAAU,CAEtB,IADAwoC,EAAI,EACCrnC,EAAInB,EAAGmB,EAAIq/B,EAAMr/B,IACpBqnC,GAAK0P,EAAG30B,IAAIpiB,EAAGnB,GAAK23C,EAAEp0B,IAAIpiB,EAAGwb,GAK/B,IAFA6rB,GAAKA,EAAI0P,EAAG30B,IAAIvjB,EAAGA,GAEdmB,EAAInB,EAAGmB,EAAIq/B,EAAMr/B,IACpBw2C,EAAEr0B,IAAIniB,EAAGwb,EAAGg7B,EAAEp0B,IAAIpiB,EAAGwb,GAAK6rB,EAAI0P,EAAG30B,IAAIpiB,EAAGnB,GAE5C,CAEJ,CACA,OAAO23C,CACT,EAGF,MAAMc,EACJ,WAAAp3B,CAAY1G,EAAO0H,EAAU,CAAC,GAG5B,IAFA1H,EAAQs8B,EAAgB9S,YAAYxpB,IAE1B+F,UACR,MAAM,IAAInG,MAAM,4BAGlB,IAAIgrB,EAAI5qB,EAAM6lB,KACV9P,EAAI/V,EAAM8lB,QAEd,MAAM,2BACJiY,GAA6B,EAAI,4BACjCC,GAA8B,EAAI,cAClCC,GAAgB,GACdv2B,EAEJ,IAII6pB,EAJA2M,EAAQC,QAAQJ,GAChBK,EAAQD,QAAQH,GAEhBK,GAAU,EAEd,GAAIzT,EAAI7U,EACN,GAAKkoB,EAME,CACL1M,EAAIvxB,EAAMwyB,YACV5H,EAAI2G,EAAE1L,KACN9P,EAAIwb,EAAEzL,QACNuY,GAAU,EACV,IAAIC,EAAMJ,EACVA,EAAQE,EACRA,EAAQE,CACV,MAbE/M,EAAIvxB,EAAM2H,QAEV1H,QAAQoxB,KACN,+FAYJE,EAAIvxB,EAAM2H,QAGZ,IAAI42B,EAAKj3C,KAAK+F,IAAIu9B,EAAG7U,GACjByoB,EAAKl3C,KAAK+F,IAAIu9B,EAAI,EAAG7U,GACrB8X,EAAI,IAAID,aAAa4Q,GACrBC,EAAI,IAAIlW,EAAOqC,EAAG2T,GAClBG,EAAI,IAAInW,EAAOxS,EAAGA,GAElB70B,EAAI,IAAI0sC,aAAa7X,GACrB4oB,EAAO,IAAI/Q,aAAahD,GAExBgU,EAAK,IAAIhR,aAAa4Q,GAC1B,IAAK,IAAIh4C,EAAI,EAAGA,EAAIg4C,EAAIh4C,IAAKo4C,EAAGp4C,GAAKA,EAErC,IAAIq4C,EAAMv3C,KAAK+F,IAAIu9B,EAAI,EAAG7U,GACtB+oB,EAAMx3C,KAAKC,IAAI,EAAGD,KAAK+F,IAAI0oB,EAAI,EAAG6U,IAClCmU,EAAMz3C,KAAKC,IAAIs3C,EAAKC,GAExB,IAAK,IAAIz5C,EAAI,EAAGA,EAAI05C,EAAK15C,IAAK,CAC5B,GAAIA,EAAIw5C,EAAK,CACXhR,EAAExoC,GAAK,EACP,IAAK,IAAImB,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACrBqnC,EAAExoC,GAAKg4C,EAAWxP,EAAExoC,GAAIksC,EAAE3oB,IAAIpiB,EAAGnB,IAEnC,GAAa,IAATwoC,EAAExoC,GAAU,CACVksC,EAAE3oB,IAAIvjB,EAAGA,GAAK,IAChBwoC,EAAExoC,IAAMwoC,EAAExoC,IAEZ,IAAK,IAAImB,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACrB+qC,EAAE5oB,IAAIniB,EAAGnB,EAAGksC,EAAE3oB,IAAIpiB,EAAGnB,GAAKwoC,EAAExoC,IAE9BksC,EAAE5oB,IAAItjB,EAAGA,EAAGksC,EAAE3oB,IAAIvjB,EAAGA,GAAK,EAC5B,CACAwoC,EAAExoC,IAAMwoC,EAAExoC,EACZ,CAEA,IAAK,IAAI2c,EAAI3c,EAAI,EAAG2c,EAAI+T,EAAG/T,IAAK,CAC9B,GAAI3c,EAAIw5C,GAAgB,IAAThR,EAAExoC,GAAU,CACzB,IAAI4G,EAAI,EACR,IAAK,IAAIzF,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACrByF,GAAKslC,EAAE3oB,IAAIpiB,EAAGnB,GAAKksC,EAAE3oB,IAAIpiB,EAAGwb,GAE9B/V,GAAKA,EAAIslC,EAAE3oB,IAAIvjB,EAAGA,GAClB,IAAK,IAAImB,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACrB+qC,EAAE5oB,IAAIniB,EAAGwb,EAAGuvB,EAAE3oB,IAAIpiB,EAAGwb,GAAK/V,EAAIslC,EAAE3oB,IAAIpiB,EAAGnB,GAE3C,CACAnE,EAAE8gB,GAAKuvB,EAAE3oB,IAAIvjB,EAAG2c,EAClB,CAEA,GAAIk8B,GAAS74C,EAAIw5C,EACf,IAAK,IAAIr4C,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACrBi4C,EAAE91B,IAAIniB,EAAGnB,EAAGksC,EAAE3oB,IAAIpiB,EAAGnB,IAIzB,GAAIA,EAAIy5C,EAAK,CACX59C,EAAEmE,GAAK,EACP,IAAK,IAAImB,EAAInB,EAAI,EAAGmB,EAAIuvB,EAAGvvB,IACzBtF,EAAEmE,GAAKg4C,EAAWn8C,EAAEmE,GAAInE,EAAEsF,IAE5B,GAAa,IAATtF,EAAEmE,GAAU,CACVnE,EAAEmE,EAAI,GAAK,IACbnE,EAAEmE,GAAK,EAAInE,EAAEmE,IAEf,IAAK,IAAImB,EAAInB,EAAI,EAAGmB,EAAIuvB,EAAGvvB,IACzBtF,EAAEsF,IAAMtF,EAAEmE,GAEZnE,EAAEmE,EAAI,IAAM,CACd,CAEA,GADAnE,EAAEmE,IAAMnE,EAAEmE,GACNA,EAAI,EAAIulC,GAAc,IAAT1pC,EAAEmE,GAAU,CAC3B,IAAK,IAAImB,EAAInB,EAAI,EAAGmB,EAAIokC,EAAGpkC,IACzBm4C,EAAKn4C,GAAK,EAEZ,IAAK,IAAIA,EAAInB,EAAI,EAAGmB,EAAIokC,EAAGpkC,IACzB,IAAK,IAAIwb,EAAI3c,EAAI,EAAG2c,EAAI+T,EAAG/T,IACzB28B,EAAKn4C,IAAMtF,EAAE8gB,GAAKuvB,EAAE3oB,IAAIpiB,EAAGwb,GAG/B,IAAK,IAAIA,EAAI3c,EAAI,EAAG2c,EAAI+T,EAAG/T,IAAK,CAC9B,IAAI/V,GAAK/K,EAAE8gB,GAAK9gB,EAAEmE,EAAI,GACtB,IAAK,IAAImB,EAAInB,EAAI,EAAGmB,EAAIokC,EAAGpkC,IACzB+qC,EAAE5oB,IAAIniB,EAAGwb,EAAGuvB,EAAE3oB,IAAIpiB,EAAGwb,GAAK/V,EAAI0yC,EAAKn4C,GAEvC,CACF,CACA,GAAI43C,EACF,IAAK,IAAI53C,EAAInB,EAAI,EAAGmB,EAAIuvB,EAAGvvB,IACzBk4C,EAAE/1B,IAAIniB,EAAGnB,EAAGnE,EAAEsF,GAGpB,CACF,CAEA,IAAI8G,EAAIhG,KAAK+F,IAAI0oB,EAAG6U,EAAI,GAYxB,GAXIiU,EAAM9oB,IACR8X,EAAEgR,GAAOtN,EAAE3oB,IAAIi2B,EAAKA,IAElBjU,EAAIt9B,IACNugC,EAAEvgC,EAAI,GAAK,GAETwxC,EAAM,EAAIxxC,IACZpM,EAAE49C,GAAOvN,EAAE3oB,IAAIk2B,EAAKxxC,EAAI,IAE1BpM,EAAEoM,EAAI,GAAK,EAEP4wC,EAAO,CACT,IAAK,IAAIl8B,EAAI68B,EAAK78B,EAAIu8B,EAAIv8B,IAAK,CAC7B,IAAK,IAAIxb,EAAI,EAAGA,EAAIokC,EAAGpkC,IACrBi4C,EAAE91B,IAAIniB,EAAGwb,EAAG,GAEdy8B,EAAE91B,IAAI3G,EAAGA,EAAG,EACd,CACA,IAAK,IAAI3c,EAAIw5C,EAAM,EAAGx5C,GAAK,EAAGA,IAC5B,GAAa,IAATwoC,EAAExoC,GAAU,CACd,IAAK,IAAI2c,EAAI3c,EAAI,EAAG2c,EAAIu8B,EAAIv8B,IAAK,CAC/B,IAAI/V,EAAI,EACR,IAAK,IAAIzF,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACrByF,GAAKwyC,EAAE71B,IAAIpiB,EAAGnB,GAAKo5C,EAAE71B,IAAIpiB,EAAGwb,GAE9B/V,GAAKA,EAAIwyC,EAAE71B,IAAIvjB,EAAGA,GAClB,IAAK,IAAImB,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACrBi4C,EAAE91B,IAAIniB,EAAGwb,EAAGy8B,EAAE71B,IAAIpiB,EAAGwb,GAAK/V,EAAIwyC,EAAE71B,IAAIpiB,EAAGnB,GAE3C,CACA,IAAK,IAAImB,EAAInB,EAAGmB,EAAIokC,EAAGpkC,IACrBi4C,EAAE91B,IAAIniB,EAAGnB,GAAIo5C,EAAE71B,IAAIpiB,EAAGnB,IAExBo5C,EAAE91B,IAAItjB,EAAGA,EAAG,EAAIo5C,EAAE71B,IAAIvjB,EAAGA,IACzB,IAAK,IAAImB,EAAI,EAAGA,EAAInB,EAAI,EAAGmB,IACzBi4C,EAAE91B,IAAIniB,EAAGnB,EAAG,EAEhB,KAAO,CACL,IAAK,IAAImB,EAAI,EAAGA,EAAIokC,EAAGpkC,IACrBi4C,EAAE91B,IAAIniB,EAAGnB,EAAG,GAEdo5C,EAAE91B,IAAItjB,EAAGA,EAAG,EACd,CAEJ,CAEA,GAAI+4C,EACF,IAAK,IAAI/4C,EAAI0wB,EAAI,EAAG1wB,GAAK,EAAGA,IAAK,CAC/B,GAAIA,EAAIy5C,GAAgB,IAAT59C,EAAEmE,GACf,IAAK,IAAI2c,EAAI3c,EAAI,EAAG2c,EAAI+T,EAAG/T,IAAK,CAC9B,IAAI/V,EAAI,EACR,IAAK,IAAIzF,EAAInB,EAAI,EAAGmB,EAAIuvB,EAAGvvB,IACzByF,GAAKyyC,EAAE91B,IAAIpiB,EAAGnB,GAAKq5C,EAAE91B,IAAIpiB,EAAGwb,GAE9B/V,GAAKA,EAAIyyC,EAAE91B,IAAIvjB,EAAI,EAAGA,GACtB,IAAK,IAAImB,EAAInB,EAAI,EAAGmB,EAAIuvB,EAAGvvB,IACzBk4C,EAAE/1B,IAAIniB,EAAGwb,EAAG08B,EAAE91B,IAAIpiB,EAAGwb,GAAK/V,EAAIyyC,EAAE91B,IAAIpiB,EAAGnB,GAE3C,CAEF,IAAK,IAAImB,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACrBk4C,EAAE/1B,IAAIniB,EAAGnB,EAAG,GAEdq5C,EAAE/1B,IAAItjB,EAAGA,EAAG,EACd,CAGF,IAAI25C,EAAK1xC,EAAI,EACT2xC,EAAMvyC,OAAOwyC,QACjB,KAAO5xC,EAAI,GAAG,CACZ,IAAIjI,EAAG85C,EACP,IAAK95C,EAAIiI,EAAI,EAAGjI,IAAM,IACT,IAAPA,EADmBA,IAAK,CAI5B,MAAM+5C,EACJ1yC,OAAO2yC,UAAYJ,EAAM33C,KAAKgF,IAAIuhC,EAAExoC,GAAKiC,KAAKgF,IAAIuhC,EAAExoC,EAAI,KAC1D,GAAIiC,KAAKgF,IAAIpL,EAAEmE,KAAO+5C,GAAS1yC,OAAO4yC,MAAMp+C,EAAEmE,IAAK,CACjDnE,EAAEmE,GAAK,EACP,KACF,CACF,CACA,GAAIA,IAAMiI,EAAI,EACZ6xC,EAAO,MACF,CACL,IAAII,EACJ,IAAKA,EAAKjyC,EAAI,EAAGiyC,GAAMl6C,GACjBk6C,IAAOl6C,EADak6C,IAAM,CAI9B,IAAItzC,GACDszC,IAAOjyC,EAAIhG,KAAKgF,IAAIpL,EAAEq+C,IAAO,IAC7BA,IAAOl6C,EAAI,EAAIiC,KAAKgF,IAAIpL,EAAEq+C,EAAK,IAAM,GACxC,GAAIj4C,KAAKgF,IAAIuhC,EAAE0R,KAAQN,EAAMhzC,EAAG,CAC9B4hC,EAAE0R,GAAM,EACR,KACF,CACF,CACIA,IAAOl6C,EACT85C,EAAO,EACEI,IAAOjyC,EAAI,EACpB6xC,EAAO,GAEPA,EAAO,EACP95C,EAAIk6C,EAER,CAIA,OAFAl6C,IAEQ85C,GACN,KAAK,EAAG,CACN,IAAIxgC,EAAIzd,EAAEoM,EAAI,GACdpM,EAAEoM,EAAI,GAAK,EACX,IAAK,IAAI0U,EAAI1U,EAAI,EAAG0U,GAAK3c,EAAG2c,IAAK,CAC/B,IAAI/V,EAAIoxC,EAAWxP,EAAE7rB,GAAIrD,GACrB6gC,EAAK3R,EAAE7rB,GAAK/V,EACZwzC,EAAK9gC,EAAI1S,EAMb,GALA4hC,EAAE7rB,GAAK/V,EACH+V,IAAM3c,IACRsZ,GAAK8gC,EAAKv+C,EAAE8gB,EAAI,GAChB9gB,EAAE8gB,EAAI,GAAKw9B,EAAKt+C,EAAE8gB,EAAI,IAEpBo8B,EACF,IAAK,IAAI53C,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACrByF,EAAIuzC,EAAKd,EAAE91B,IAAIpiB,EAAGwb,GAAKy9B,EAAKf,EAAE91B,IAAIpiB,EAAG8G,EAAI,GACzCoxC,EAAE/1B,IAAIniB,EAAG8G,EAAI,GAAImyC,EAAKf,EAAE91B,IAAIpiB,EAAGwb,GAAKw9B,EAAKd,EAAE91B,IAAIpiB,EAAG8G,EAAI,IACtDoxC,EAAE/1B,IAAIniB,EAAGwb,EAAG/V,EAGlB,CACA,KACF,CACA,KAAK,EAAG,CACN,IAAI0S,EAAIzd,EAAEmE,EAAI,GACdnE,EAAEmE,EAAI,GAAK,EACX,IAAK,IAAI2c,EAAI3c,EAAG2c,EAAI1U,EAAG0U,IAAK,CAC1B,IAAI/V,EAAIoxC,EAAWxP,EAAE7rB,GAAIrD,GACrB6gC,EAAK3R,EAAE7rB,GAAK/V,EACZwzC,EAAK9gC,EAAI1S,EAIb,GAHA4hC,EAAE7rB,GAAK/V,EACP0S,GAAK8gC,EAAKv+C,EAAE8gB,GACZ9gB,EAAE8gB,GAAKw9B,EAAKt+C,EAAE8gB,GACVk8B,EACF,IAAK,IAAI13C,EAAI,EAAGA,EAAIokC,EAAGpkC,IACrByF,EAAIuzC,EAAKf,EAAE71B,IAAIpiB,EAAGwb,GAAKy9B,EAAKhB,EAAE71B,IAAIpiB,EAAGnB,EAAI,GACzCo5C,EAAE91B,IAAIniB,EAAGnB,EAAI,GAAIo6C,EAAKhB,EAAE71B,IAAIpiB,EAAGwb,GAAKw9B,EAAKf,EAAE71B,IAAIpiB,EAAGnB,EAAI,IACtDo5C,EAAE91B,IAAIniB,EAAGwb,EAAG/V,EAGlB,CACA,KACF,CACA,KAAK,EAAG,CACN,MAAMyoC,EAAQptC,KAAKC,IACjBD,KAAKgF,IAAIuhC,EAAEvgC,EAAI,IACfhG,KAAKgF,IAAIuhC,EAAEvgC,EAAI,IACfhG,KAAKgF,IAAIpL,EAAEoM,EAAI,IACfhG,KAAKgF,IAAIuhC,EAAExoC,IACXiC,KAAKgF,IAAIpL,EAAEmE,KAEPq6C,EAAK7R,EAAEvgC,EAAI,GAAKonC,EAChBiL,EAAO9R,EAAEvgC,EAAI,GAAKonC,EAClBkL,EAAO1+C,EAAEoM,EAAI,GAAKonC,EAClBmL,EAAKhS,EAAExoC,GAAKqvC,EACZoL,EAAK5+C,EAAEmE,GAAKqvC,EACZxoC,IAAMyzC,EAAOD,IAAOC,EAAOD,GAAME,EAAOA,GAAQ,EAChDzO,EAAIuO,EAAKE,GAAQF,EAAKE,GAC5B,IAAIG,EAAQ,EACF,IAAN7zC,GAAiB,IAANilC,IAEX4O,EADE7zC,EAAI,EACE,EAAI5E,KAAK+lC,KAAKnhC,EAAIA,EAAIilC,GAEtB7pC,KAAK+lC,KAAKnhC,EAAIA,EAAIilC,GAE5B4O,EAAQ5O,GAAKjlC,EAAI6zC,IAEnB,IAAIphC,GAAKkhC,EAAKH,IAAOG,EAAKH,GAAMK,EAC5Bj/C,EAAI++C,EAAKC,EACb,IAAK,IAAI99B,EAAI3c,EAAG2c,EAAI1U,EAAI,EAAG0U,IAAK,CAC9B,IAAI/V,EAAIoxC,EAAW1+B,EAAG7d,GACZ,IAANmL,IAASA,EAAIS,OAAO2yC,WACxB,IAAIG,EAAK7gC,EAAI1S,EACTwzC,EAAK3+C,EAAImL,EAQb,GAPI+V,IAAM3c,IACRnE,EAAE8gB,EAAI,GAAK/V,GAEb0S,EAAI6gC,EAAK3R,EAAE7rB,GAAKy9B,EAAKv+C,EAAE8gB,GACvB9gB,EAAE8gB,GAAKw9B,EAAKt+C,EAAE8gB,GAAKy9B,EAAK5R,EAAE7rB,GAC1BlhB,EAAI2+C,EAAK5R,EAAE7rB,EAAI,GACf6rB,EAAE7rB,EAAI,GAAKw9B,EAAK3R,EAAE7rB,EAAI,GAClBo8B,EACF,IAAK,IAAI53C,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACrByF,EAAIuzC,EAAKd,EAAE91B,IAAIpiB,EAAGwb,GAAKy9B,EAAKf,EAAE91B,IAAIpiB,EAAGwb,EAAI,GACzC08B,EAAE/1B,IAAIniB,EAAGwb,EAAI,GAAIy9B,EAAKf,EAAE91B,IAAIpiB,EAAGwb,GAAKw9B,EAAKd,EAAE91B,IAAIpiB,EAAGwb,EAAI,IACtD08B,EAAE/1B,IAAIniB,EAAGwb,EAAG/V,GAYhB,GATAA,EAAIoxC,EAAW1+B,EAAG7d,GACR,IAANmL,IAASA,EAAIS,OAAO2yC,WACxBG,EAAK7gC,EAAI1S,EACTwzC,EAAK3+C,EAAImL,EACT4hC,EAAE7rB,GAAK/V,EACP0S,EAAI6gC,EAAKt+C,EAAE8gB,GAAKy9B,EAAK5R,EAAE7rB,EAAI,GAC3B6rB,EAAE7rB,EAAI,IAAMy9B,EAAKv+C,EAAE8gB,GAAKw9B,EAAK3R,EAAE7rB,EAAI,GACnClhB,EAAI2+C,EAAKv+C,EAAE8gB,EAAI,GACf9gB,EAAE8gB,EAAI,GAAKw9B,EAAKt+C,EAAE8gB,EAAI,GAClBk8B,GAASl8B,EAAI4oB,EAAI,EACnB,IAAK,IAAIpkC,EAAI,EAAGA,EAAIokC,EAAGpkC,IACrByF,EAAIuzC,EAAKf,EAAE71B,IAAIpiB,EAAGwb,GAAKy9B,EAAKhB,EAAE71B,IAAIpiB,EAAGwb,EAAI,GACzCy8B,EAAE91B,IAAIniB,EAAGwb,EAAI,GAAIy9B,EAAKhB,EAAE71B,IAAIpiB,EAAGwb,GAAKw9B,EAAKf,EAAE71B,IAAIpiB,EAAGwb,EAAI,IACtDy8B,EAAE91B,IAAIniB,EAAGwb,EAAG/V,EAGlB,CACA/K,EAAEoM,EAAI,GAAKqR,EACX,KACF,CACA,KAAK,EACH,GAAIkvB,EAAExoC,IAAM,IACVwoC,EAAExoC,GAAKwoC,EAAExoC,GAAK,GAAKwoC,EAAExoC,GAAK,EACtB+4C,GACF,IAAK,IAAI53C,EAAI,EAAGA,GAAKw4C,EAAIx4C,IACvBk4C,EAAE/1B,IAAIniB,EAAGnB,GAAIq5C,EAAE91B,IAAIpiB,EAAGnB,IAI5B,KAAOA,EAAI25C,KACLnR,EAAExoC,IAAMwoC,EAAExoC,EAAI,KADL,CAIb,IAAI4G,EAAI4hC,EAAExoC,GAGV,GAFAwoC,EAAExoC,GAAKwoC,EAAExoC,EAAI,GACbwoC,EAAExoC,EAAI,GAAK4G,EACPmyC,GAAS/4C,EAAI0wB,EAAI,EACnB,IAAK,IAAIvvB,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACrByF,EAAIyyC,EAAE91B,IAAIpiB,EAAGnB,EAAI,GACjBq5C,EAAE/1B,IAAIniB,EAAGnB,EAAI,EAAGq5C,EAAE91B,IAAIpiB,EAAGnB,IACzBq5C,EAAE/1B,IAAIniB,EAAGnB,EAAG4G,GAGhB,GAAIiyC,GAAS74C,EAAIulC,EAAI,EACnB,IAAK,IAAIpkC,EAAI,EAAGA,EAAIokC,EAAGpkC,IACrByF,EAAIwyC,EAAE71B,IAAIpiB,EAAGnB,EAAI,GACjBo5C,EAAE91B,IAAIniB,EAAGnB,EAAI,EAAGo5C,EAAE71B,IAAIpiB,EAAGnB,IACzBo5C,EAAE91B,IAAIniB,EAAGnB,EAAG4G,GAGhB5G,GACF,CACAiI,IAKN,CAEA,GAAI+wC,EAAS,CACX,IAAIpqC,EAAMyqC,EACVA,EAAID,EACJA,EAAIxqC,CACN,CAEAjP,KAAK4lC,EAAIA,EACT5lC,KAAK+wB,EAAIA,EACT/wB,KAAK6oC,EAAIA,EACT7oC,KAAKy5C,EAAIA,EACTz5C,KAAK05C,EAAIA,CACX,CAEA,KAAA3B,CAAM/8B,GACJ,IAAIggC,EAAIhgC,EACJ9e,EAAI8D,KAAKi7C,UACTC,EAAQl7C,KAAK6oC,EAAEpqC,OACf08C,EAAK5X,EAAOK,MAAMsX,EAAOA,GAE7B,IAAK,IAAI15C,EAAI,EAAGA,EAAI05C,EAAO15C,IACrBc,KAAKgF,IAAItH,KAAK6oC,EAAErnC,KAAOtF,EACzBi/C,EAAGx3B,IAAIniB,EAAGA,EAAG,GAEb25C,EAAGx3B,IAAIniB,EAAGA,EAAG,EAAIxB,KAAK6oC,EAAErnC,IAI5B,IAAIi4C,EAAIz5C,KAAKy5C,EACTC,EAAI15C,KAAKo7C,qBAETC,EAAK3B,EAAEhR,KAAKyS,GACZG,EAAQ5B,EAAE7Y,KACV0a,EAAQ9B,EAAE5Y,KACV2a,EAAMjY,EAAOK,MAAM0X,EAAOC,GAE9B,IAAK,IAAI/5C,EAAI,EAAGA,EAAI85C,EAAO95C,IACzB,IAAK,IAAIwb,EAAI,EAAGA,EAAIu+B,EAAOv+B,IAAK,CAC9B,IAAIzQ,EAAM,EACV,IAAK,IAAIlM,EAAI,EAAGA,EAAI66C,EAAO76C,IACzBkM,GAAO8uC,EAAGz3B,IAAIpiB,EAAGnB,GAAKo5C,EAAE71B,IAAI5G,EAAG3c,GAEjCm7C,EAAI73B,IAAIniB,EAAGwb,EAAGzQ,EAChB,CAGF,OAAOivC,EAAI9S,KAAKsS,EAClB,CAEA,gBAAAS,CAAiBzgC,GACf,OAAOhb,KAAK+3C,MAAMxU,EAAOc,KAAKrpB,GAChC,CAEA,OAAA0gC,GACE,IAAIhC,EAAI15C,KAAK05C,EACTx9C,EAAI8D,KAAKi7C,UACTK,EAAQ5B,EAAE7Y,KACV8a,EAAQjC,EAAE5Y,QACVkX,EAAI,IAAIzU,EAAO+X,EAAOt7C,KAAK6oC,EAAEpqC,QAEjC,IAAK,IAAI+C,EAAI,EAAGA,EAAI85C,EAAO95C,IACzB,IAAK,IAAIwb,EAAI,EAAGA,EAAI2+B,EAAO3+B,IACrB1a,KAAKgF,IAAItH,KAAK6oC,EAAE7rB,IAAM9gB,GACxB87C,EAAEr0B,IAAIniB,EAAGwb,EAAG08B,EAAE91B,IAAIpiB,EAAGwb,GAAKhd,KAAK6oC,EAAE7rB,IAKvC,IAAIy8B,EAAIz5C,KAAKy5C,EAET8B,EAAQ9B,EAAE5Y,KACV+a,EAAQnC,EAAE3Y,QACVka,EAAI,IAAIzX,EAAO+X,EAAOC,GAE1B,IAAK,IAAI/5C,EAAI,EAAGA,EAAI85C,EAAO95C,IACzB,IAAK,IAAIwb,EAAI,EAAGA,EAAIu+B,EAAOv+B,IAAK,CAC9B,IAAIzQ,EAAM,EACV,IAAK,IAAIlM,EAAI,EAAGA,EAAIu7C,EAAOv7C,IACzBkM,GAAOyrC,EAAEp0B,IAAIpiB,EAAGnB,GAAKo5C,EAAE71B,IAAI5G,EAAG3c,GAEhC26C,EAAEr3B,IAAIniB,EAAGwb,EAAGzQ,EACd,CAGF,OAAOyuC,CACT,CAEA,aAAIa,GACF,OAAO77C,KAAK6oC,EAAE,GAAK7oC,KAAK6oC,EAAEvmC,KAAK+F,IAAIrI,KAAK4lC,EAAG5lC,KAAK+wB,GAAK,EACvD,CAEA,SAAI+qB,GACF,OAAO97C,KAAK6oC,EAAE,EAChB,CAEA,QAAI9qC,GACF,IAAIg+C,EAAMz5C,KAAKC,IAAIvC,KAAK4lC,EAAG5lC,KAAK+wB,GAAK/wB,KAAK6oC,EAAE,GAAKnhC,OAAOwyC,QACpD7yC,EAAI,EACJwhC,EAAI7oC,KAAK6oC,EACb,IAAK,IAAIrnC,EAAI,EAAGw6C,EAAKnT,EAAEpqC,OAAQ+C,EAAIw6C,EAAIx6C,IACjCqnC,EAAErnC,GAAKu6C,GACT10C,IAGJ,OAAOA,CACT,CAEA,YAAIkpC,GACF,OAAOjjC,MAAM8gC,KAAKpuC,KAAK6oC,EACzB,CAEA,aAAIoS,GACF,OAAQvzC,OAAOwyC,QAAU,EAAK53C,KAAKC,IAAIvC,KAAK4lC,EAAG5lC,KAAK+wB,GAAK/wB,KAAK6oC,EAAE,EAClE,CAEA,uBAAIoT,GACF,OAAOj8C,KAAKy5C,CACd,CAEA,wBAAI2B,GACF,OAAOp7C,KAAK05C,CACd,CAEA,kBAAIwC,GACF,OAAO3Y,EAAOc,KAAKrkC,KAAK6oC,EAC1B,EAYF,SAASkP,EAAMoE,EAAcC,EAAeC,GAAS,GAGnD,OAFAF,EAAe7E,EAAgB9S,YAAY2X,GAC3CC,EAAgB9E,EAAgB9S,YAAY4X,GACxCC,EACK,IAAIvD,EAA2BqD,GAAcpE,MAAMqE,GAEnDD,EAAalX,WAChB,IAAIsS,EAAgB4E,GAAcpE,MAAMqE,GACxC,IAAI9D,EAAgB6D,GAAcpE,MAAMqE,EAEhD,CA0CA,SAASE,EAAOvrB,EAAGwrB,GACjB,IAAI95C,EAAQ,GACZ,IAAK,IAAIjB,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACjBA,IAAM+6C,GACR95C,EAAM1F,KAAKyE,GAGf,OAAOiB,CACT,CAEA,SAAS+5C,EACPC,EACAjc,EACAhzB,EACAkvC,EAAiB,KACjBC,EAAiB,MAEjB,GAAIF,EAAQE,EACV,OAAO,IAAIrvC,MAAMkzB,EAAOK,KAAO,GAAGiD,KAAK,GAClC,CACL,IAAI8Y,EAAcpc,EAAOyQ,OAAOzjC,EAAO,CAAC,IACxC,IAAK,IAAIhM,EAAI,EAAGA,EAAIo7C,EAAY/b,KAAMr/B,IAChCc,KAAKgF,IAAIs1C,EAAYh5B,IAAIpiB,EAAG,IAAMk7C,GACpCE,EAAYj5B,IAAIniB,EAAG,EAAG,GAG1B,OAAOo7C,EAAYza,WACrB,CACF,CAmIA,MAAM0a,EACJ,WAAAn7B,CAAY8e,EAAQ9d,EAAU,CAAC,GAC7B,MAAM,gBAAEo6B,GAAkB,GAAUp6B,EAGpC,KADA8d,EAAS8W,EAAgB9S,YAAYhE,IACzByE,WACV,MAAM,IAAIrqB,MAAM,iCAGlB,GAAI4lB,EAAOzf,UACT,MAAM,IAAInG,MAAM,4BAGlB,IAKIpZ,EAAGwb,EALH+T,EAAIyP,EAAOM,QACX4Y,EAAI,IAAInW,EAAOxS,EAAGA,GAClBlU,EAAI,IAAI+rB,aAAa7X,GACrB70B,EAAI,IAAI0sC,aAAa7X,GACrB/V,EAAQwlB,EAGR0E,GAAc,EAOlB,GALEA,IADE4X,GAGYtc,EAAO0E,cAGnBA,EAAa,CACf,IAAK1jC,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACjB,IAAKwb,EAAI,EAAGA,EAAI+T,EAAG/T,IACjB08B,EAAE/1B,IAAIniB,EAAGwb,EAAGhC,EAAM4I,IAAIpiB,EAAGwb,KAwDnC,SAAe+T,EAAG70B,EAAG2gB,EAAG68B,GACtB,IAAI//B,EAAG7d,EAAGoF,EAAGM,EAAGwb,EAAG3c,EAAG08C,EAAIrN,EAE1B,IAAK1yB,EAAI,EAAGA,EAAI+T,EAAG/T,IACjBH,EAAEG,GAAK08B,EAAE91B,IAAImN,EAAI,EAAG/T,GAGtB,IAAKxb,EAAIuvB,EAAI,EAAGvvB,EAAI,EAAGA,IAAK,CAG1B,IAFAkuC,EAAQ,EACRxuC,EAAI,EACCb,EAAI,EAAGA,EAAImB,EAAGnB,IACjBqvC,GAAgBptC,KAAKgF,IAAIuV,EAAExc,IAG7B,GAAc,IAAVqvC,EAEF,IADAxzC,EAAEsF,GAAKqb,EAAErb,EAAI,GACRwb,EAAI,EAAGA,EAAIxb,EAAGwb,IACjBH,EAAEG,GAAK08B,EAAE91B,IAAIpiB,EAAI,EAAGwb,GACpB08B,EAAE/1B,IAAIniB,EAAGwb,EAAG,GACZ08B,EAAE/1B,IAAI3G,EAAGxb,EAAG,OAET,CACL,IAAKnB,EAAI,EAAGA,EAAImB,EAAGnB,IACjBwc,EAAExc,IAAMqvC,EACRxuC,GAAK2b,EAAExc,GAAKwc,EAAExc,GAYhB,IATAsZ,EAAIkD,EAAErb,EAAI,GACV1F,EAAIwG,KAAK+lC,KAAKnnC,GACVyY,EAAI,IACN7d,GAAKA,GAGPI,EAAEsF,GAAKkuC,EAAQ5zC,EACfoF,GAAQyY,EAAI7d,EACZ+gB,EAAErb,EAAI,GAAKmY,EAAI7d,EACVkhB,EAAI,EAAGA,EAAIxb,EAAGwb,IACjB9gB,EAAE8gB,GAAK,EAGT,IAAKA,EAAI,EAAGA,EAAIxb,EAAGwb,IAAK,CAItB,IAHArD,EAAIkD,EAAEG,GACN08B,EAAE/1B,IAAI3G,EAAGxb,EAAGmY,GACZ7d,EAAII,EAAE8gB,GAAK08B,EAAE91B,IAAI5G,EAAGA,GAAKrD,EACpBtZ,EAAI2c,EAAI,EAAG3c,GAAKmB,EAAI,EAAGnB,IAC1BvE,GAAK49C,EAAE91B,IAAIvjB,EAAG2c,GAAKH,EAAExc,GACrBnE,EAAEmE,IAAMq5C,EAAE91B,IAAIvjB,EAAG2c,GAAKrD,EAExBzd,EAAE8gB,GAAKlhB,CACT,CAGA,IADA6d,EAAI,EACCqD,EAAI,EAAGA,EAAIxb,EAAGwb,IACjB9gB,EAAE8gB,IAAM9b,EACRyY,GAAKzd,EAAE8gB,GAAKH,EAAEG,GAIhB,IADA+/B,EAAKpjC,GAAKzY,EAAIA,GACT8b,EAAI,EAAGA,EAAIxb,EAAGwb,IACjB9gB,EAAE8gB,IAAM+/B,EAAKlgC,EAAEG,GAGjB,IAAKA,EAAI,EAAGA,EAAIxb,EAAGwb,IAAK,CAGtB,IAFArD,EAAIkD,EAAEG,GACNlhB,EAAII,EAAE8gB,GACD3c,EAAI2c,EAAG3c,GAAKmB,EAAI,EAAGnB,IACtBq5C,EAAE/1B,IAAItjB,EAAG2c,EAAG08B,EAAE91B,IAAIvjB,EAAG2c,IAAMrD,EAAIzd,EAAEmE,GAAKvE,EAAI+gB,EAAExc,KAE9Cwc,EAAEG,GAAK08B,EAAE91B,IAAIpiB,EAAI,EAAGwb,GACpB08B,EAAE/1B,IAAIniB,EAAGwb,EAAG,EACd,CACF,CACAH,EAAErb,GAAKN,CACT,CAEA,IAAKM,EAAI,EAAGA,EAAIuvB,EAAI,EAAGvvB,IAAK,CAI1B,GAHAk4C,EAAE/1B,IAAIoN,EAAI,EAAGvvB,EAAGk4C,EAAE91B,IAAIpiB,EAAGA,IACzBk4C,EAAE/1B,IAAIniB,EAAGA,EAAG,GACZN,EAAI2b,EAAErb,EAAI,GACA,IAANN,EAAS,CACX,IAAKb,EAAI,EAAGA,GAAKmB,EAAGnB,IAClBwc,EAAExc,GAAKq5C,EAAE91B,IAAIvjB,EAAGmB,EAAI,GAAKN,EAG3B,IAAK8b,EAAI,EAAGA,GAAKxb,EAAGwb,IAAK,CAEvB,IADAlhB,EAAI,EACCuE,EAAI,EAAGA,GAAKmB,EAAGnB,IAClBvE,GAAK49C,EAAE91B,IAAIvjB,EAAGmB,EAAI,GAAKk4C,EAAE91B,IAAIvjB,EAAG2c,GAElC,IAAK3c,EAAI,EAAGA,GAAKmB,EAAGnB,IAClBq5C,EAAE/1B,IAAItjB,EAAG2c,EAAG08B,EAAE91B,IAAIvjB,EAAG2c,GAAKlhB,EAAI+gB,EAAExc,GAEpC,CACF,CAEA,IAAKA,EAAI,EAAGA,GAAKmB,EAAGnB,IAClBq5C,EAAE/1B,IAAItjB,EAAGmB,EAAI,EAAG,EAEpB,CAEA,IAAKwb,EAAI,EAAGA,EAAI+T,EAAG/T,IACjBH,EAAEG,GAAK08B,EAAE91B,IAAImN,EAAI,EAAG/T,GACpB08B,EAAE/1B,IAAIoN,EAAI,EAAG/T,EAAG,GAGlB08B,EAAE/1B,IAAIoN,EAAI,EAAGA,EAAI,EAAG,GACpB70B,EAAE,GAAK,CACT,CAhKM8gD,CAAMjsB,EAAG70B,EAAG2gB,EAAG68B,GAkKrB,SAAc3oB,EAAG70B,EAAG2gB,EAAG68B,GACrB,IAAI59C,EAAGoF,EAAGM,EAAGwb,EAAG3c,EAAG8G,EAAGy+B,EAAGt9B,EAAGjB,EAAG41C,EAAK9Q,EAAGJ,EAAImR,EAAIC,EAAKtU,EAAGuU,EAEvD,IAAK57C,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACjBtF,EAAEsF,EAAI,GAAKtF,EAAEsF,GAGftF,EAAE60B,EAAI,GAAK,EAEX,IAAIpX,EAAI,EACJ0jC,EAAO,EACPpD,EAAMvyC,OAAOwyC,QAEjB,IAAK/yC,EAAI,EAAGA,EAAI4pB,EAAG5pB,IAAK,CAGtB,IAFAk2C,EAAO/6C,KAAKC,IAAI86C,EAAM/6C,KAAKgF,IAAIuV,EAAE1V,IAAM7E,KAAKgF,IAAIpL,EAAEiL,KAClDy+B,EAAIz+B,EACGy+B,EAAI7U,KACLzuB,KAAKgF,IAAIpL,EAAE0pC,KAAOqU,EAAMoD,IAG5BzX,IAGF,GAAIA,EAAIz+B,EACN,EAAG,CAaD,IAXArL,EAAI+gB,EAAE1V,GACNmB,GAAKuU,EAAE1V,EAAI,GAAKrL,IAAM,EAAII,EAAEiL,IAC5BE,EAAIgxC,EAAW/vC,EAAG,GACdA,EAAI,IACNjB,GAAKA,GAGPwV,EAAE1V,GAAKjL,EAAEiL,IAAMmB,EAAIjB,GACnBwV,EAAE1V,EAAI,GAAKjL,EAAEiL,IAAMmB,EAAIjB,GACvB41C,EAAMpgC,EAAE1V,EAAI,GACZjG,EAAIpF,EAAI+gB,EAAE1V,GACL3F,EAAI2F,EAAI,EAAG3F,EAAIuvB,EAAGvvB,IACrBqb,EAAErb,IAAMN,EAYV,IATAyY,GAAQzY,EAERoH,EAAIuU,EAAE+oB,GACNuG,EAAI,EACJJ,EAAKI,EACL+Q,EAAK/Q,EACLgR,EAAMjhD,EAAEiL,EAAI,GACZ0hC,EAAI,EACJuU,EAAK,EACA57C,EAAIokC,EAAI,EAAGpkC,GAAK2F,EAAG3F,IAatB,IAZA07C,EAAKnR,EACLA,EAAKI,EACLiR,EAAKvU,EACL/sC,EAAIqwC,EAAIjwC,EAAEsF,GACVN,EAAIirC,EAAI7jC,EACRjB,EAAIgxC,EAAW/vC,EAAGpM,EAAEsF,IACpBtF,EAAEsF,EAAI,GAAKqnC,EAAIxhC,EACfwhC,EAAI3sC,EAAEsF,GAAK6F,EACX8kC,EAAI7jC,EAAIjB,EACRiB,EAAI6jC,EAAItvB,EAAErb,GAAKqnC,EAAI/sC,EACnB+gB,EAAErb,EAAI,GAAKN,EAAI2nC,GAAKsD,EAAIrwC,EAAI+sC,EAAIhsB,EAAErb,IAE7BnB,EAAI,EAAGA,EAAI0wB,EAAG1wB,IACjBa,EAAIw4C,EAAE91B,IAAIvjB,EAAGmB,EAAI,GACjBk4C,EAAE/1B,IAAItjB,EAAGmB,EAAI,EAAGqnC,EAAI6Q,EAAE91B,IAAIvjB,EAAGmB,GAAK2qC,EAAIjrC,GACtCw4C,EAAE/1B,IAAItjB,EAAGmB,EAAG2qC,EAAIuN,EAAE91B,IAAIvjB,EAAGmB,GAAKqnC,EAAI3nC,GAItCoH,GAAMugC,EAAIuU,EAAKF,EAAKC,EAAMjhD,EAAEiL,GAAM81C,EAClC/gD,EAAEiL,GAAK0hC,EAAIvgC,EACXuU,EAAE1V,GAAKglC,EAAI7jC,CACb,OAAShG,KAAKgF,IAAIpL,EAAEiL,IAAM8yC,EAAMoD,GAElCxgC,EAAE1V,GAAK0V,EAAE1V,GAAKwS,EACdzd,EAAEiL,GAAK,CACT,CAEA,IAAK3F,EAAI,EAAGA,EAAIuvB,EAAI,EAAGvvB,IAAK,CAG1B,IAFAnB,EAAImB,EACJ8G,EAAIuU,EAAErb,GACDwb,EAAIxb,EAAI,EAAGwb,EAAI+T,EAAG/T,IACjBH,EAAEG,GAAK1U,IACTjI,EAAI2c,EACJ1U,EAAIuU,EAAEG,IAIV,GAAI3c,IAAMmB,EAGR,IAFAqb,EAAExc,GAAKwc,EAAErb,GACTqb,EAAErb,GAAK8G,EACF0U,EAAI,EAAGA,EAAI+T,EAAG/T,IACjB1U,EAAIoxC,EAAE91B,IAAI5G,EAAGxb,GACbk4C,EAAE/1B,IAAI3G,EAAGxb,EAAGk4C,EAAE91B,IAAI5G,EAAG3c,IACrBq5C,EAAE/1B,IAAI3G,EAAG3c,EAAGiI,EAGlB,CACF,CApQMg1C,CAAKvsB,EAAG70B,EAAG2gB,EAAG68B,EAChB,KAAO,CACL,IAAI6D,EAAI,IAAIha,EAAOxS,EAAGA,GAClBysB,EAAM,IAAI5U,aAAa7X,GAC3B,IAAK/T,EAAI,EAAGA,EAAI+T,EAAG/T,IACjB,IAAKxb,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACjB+7C,EAAE55B,IAAIniB,EAAGwb,EAAGhC,EAAM4I,IAAIpiB,EAAGwb,KAgQnC,SAAgB+T,EAAGwsB,EAAGC,EAAK9D,GACzB,IAEI//B,EAAG7d,EAAGoF,EAAGM,EAAGwb,EAAG4oB,EACf8J,EAFA+N,EAAO1sB,EAAI,EAIf,IAAK6U,EAAIv0B,EAASu0B,GAAK6X,EAAO,EAAG7X,IAAK,CAEpC,IADA8J,EAAQ,EACHluC,EAAIokC,EAAGpkC,GAAKi8C,EAAMj8C,IACrBkuC,GAAgBptC,KAAKgF,IAAIi2C,EAAE35B,IAAIpiB,EAAGokC,EAAI,IAGxC,GAAc,IAAV8J,EAAa,CAEf,IADAxuC,EAAI,EACCM,EAAIi8C,EAAMj8C,GAAKokC,EAAGpkC,IACrBg8C,EAAIh8C,GAAK+7C,EAAE35B,IAAIpiB,EAAGokC,EAAI,GAAK8J,EAC3BxuC,GAAKs8C,EAAIh8C,GAAKg8C,EAAIh8C,GAWpB,IARA1F,EAAIwG,KAAK+lC,KAAKnnC,GACVs8C,EAAI5X,GAAK,IACX9pC,GAAKA,GAGPoF,GAAQs8C,EAAI5X,GAAK9pC,EACjB0hD,EAAI5X,GAAK4X,EAAI5X,GAAK9pC,EAEbkhB,EAAI4oB,EAAG5oB,EAAI+T,EAAG/T,IAAK,CAEtB,IADArD,EAAI,EACCnY,EAAIi8C,EAAMj8C,GAAKokC,EAAGpkC,IACrBmY,GAAK6jC,EAAIh8C,GAAK+7C,EAAE35B,IAAIpiB,EAAGwb,GAIzB,IADArD,GAAQzY,EACHM,EAAIokC,EAAGpkC,GAAKi8C,EAAMj8C,IACrB+7C,EAAE55B,IAAIniB,EAAGwb,EAAGugC,EAAE35B,IAAIpiB,EAAGwb,GAAKrD,EAAI6jC,EAAIh8C,GAEtC,CAEA,IAAKA,EAAI,EAAGA,GAAKi8C,EAAMj8C,IAAK,CAE1B,IADAmY,EAAI,EACCqD,EAAIygC,EAAMzgC,GAAK4oB,EAAG5oB,IACrBrD,GAAK6jC,EAAIxgC,GAAKugC,EAAE35B,IAAIpiB,EAAGwb,GAIzB,IADArD,GAAQzY,EACH8b,EAAI4oB,EAAG5oB,GAAKygC,EAAMzgC,IACrBugC,EAAE55B,IAAIniB,EAAGwb,EAAGugC,EAAE35B,IAAIpiB,EAAGwb,GAAKrD,EAAI6jC,EAAIxgC,GAEtC,CAEAwgC,EAAI5X,GAAK8J,EAAQ8N,EAAI5X,GACrB2X,EAAE55B,IAAIiiB,EAAGA,EAAI,EAAG8J,EAAQ5zC,EAC1B,CACF,CAEA,IAAK0F,EAAI,EAAGA,EAAIuvB,EAAGvvB,IACjB,IAAKwb,EAAI,EAAGA,EAAI+T,EAAG/T,IACjB08B,EAAE/1B,IAAIniB,EAAGwb,EAAGxb,IAAMwb,EAAI,EAAI,GAI9B,IAAK4oB,EAAI6X,EAAO,EAAG7X,GAAKv0B,EAASu0B,IAC/B,GAAwB,IAApB2X,EAAE35B,IAAIgiB,EAAGA,EAAI,GAAU,CACzB,IAAKpkC,EAAIokC,EAAI,EAAGpkC,GAAKi8C,EAAMj8C,IACzBg8C,EAAIh8C,GAAK+7C,EAAE35B,IAAIpiB,EAAGokC,EAAI,GAGxB,IAAK5oB,EAAI4oB,EAAG5oB,GAAKygC,EAAMzgC,IAAK,CAE1B,IADAlhB,EAAI,EACC0F,EAAIokC,EAAGpkC,GAAKi8C,EAAMj8C,IACrB1F,GAAK0hD,EAAIh8C,GAAKk4C,EAAE91B,IAAIpiB,EAAGwb,GAIzB,IADAlhB,EAAIA,EAAI0hD,EAAI5X,GAAK2X,EAAE35B,IAAIgiB,EAAGA,EAAI,GACzBpkC,EAAIokC,EAAGpkC,GAAKi8C,EAAMj8C,IACrBk4C,EAAE/1B,IAAIniB,EAAGwb,EAAG08B,EAAE91B,IAAIpiB,EAAGwb,GAAKlhB,EAAI0hD,EAAIh8C,GAEtC,CACF,CAEJ,CA9UMk8C,CAAO3sB,EAAGwsB,EAAGC,EAAK9D,GAgVxB,SAAciE,EAAIzhD,EAAG2gB,EAAG68B,EAAG6D,GACzB,IAYI/7C,EAAGwb,EAAG3c,EAAG8G,EAAGy+B,EAAG3+B,EAAGnK,EAAGsC,EAAGF,EACxB0+C,EAAIC,EAAIC,EAAIC,EACZC,EAASC,EAdTltB,EAAI4sB,EAAK,EAETF,EAAOE,EAAK,EACZ1D,EAAMvyC,OAAOwyC,QACbgE,EAAU,EACV9V,EAAO,EACP9/B,EAAI,EACJ8kC,EAAI,EACJ/lC,EAAI,EACJwhC,EAAI,EACJsV,EAAI,EACJC,EAAO,EAKX,IAAK58C,EAAI,EAAGA,EAAIm8C,EAAIn8C,IAMlB,KALIA,EAhBI,GAgBOA,EAAIi8C,KACjB5gC,EAAErb,GAAK+7C,EAAE35B,IAAIpiB,EAAGA,GAChBtF,EAAEsF,GAAK,GAGJwb,EAAI1a,KAAKC,IAAIf,EAAI,EAAG,GAAIwb,EAAI2gC,EAAI3gC,IACnCorB,GAAc9lC,KAAKgF,IAAIi2C,EAAE35B,IAAIpiB,EAAGwb,IAIpC,KAAO+T,GA1BG,GA0BO,CAEf,IADA5pB,EAAI4pB,EACG5pB,EA5BC,IA6BN0hC,EAAIvmC,KAAKgF,IAAIi2C,EAAE35B,IAAIzc,EAAI,EAAGA,EAAI,IAAM7E,KAAKgF,IAAIi2C,EAAE35B,IAAIzc,EAAGA,IAC5C,IAAN0hC,IACFA,EAAIT,KAEF9lC,KAAKgF,IAAIi2C,EAAE35B,IAAIzc,EAAGA,EAAI,IAAM8yC,EAAMpR,KAGtC1hC,IAGF,GAAIA,IAAM4pB,EACRwsB,EAAE55B,IAAIoN,EAAGA,EAAGwsB,EAAE35B,IAAImN,EAAGA,GAAKmtB,GAC1BrhC,EAAEkU,GAAKwsB,EAAE35B,IAAImN,EAAGA,GAChB70B,EAAE60B,GAAK,EACPA,IACAqtB,EAAO,OACF,GAAIj3C,IAAM4pB,EAAI,EAAG,CAStB,GARAj0B,EAAIygD,EAAE35B,IAAImN,EAAGA,EAAI,GAAKwsB,EAAE35B,IAAImN,EAAI,EAAGA,GACnCzoB,GAAKi1C,EAAE35B,IAAImN,EAAI,EAAGA,EAAI,GAAKwsB,EAAE35B,IAAImN,EAAGA,IAAM,EAC1Cqc,EAAI9kC,EAAIA,EAAIxL,EACZqhD,EAAI77C,KAAK+lC,KAAK/lC,KAAKgF,IAAI8lC,IACvBmQ,EAAE55B,IAAIoN,EAAGA,EAAGwsB,EAAE35B,IAAImN,EAAGA,GAAKmtB,GAC1BX,EAAE55B,IAAIoN,EAAI,EAAGA,EAAI,EAAGwsB,EAAE35B,IAAImN,EAAI,EAAGA,EAAI,GAAKmtB,GAC1C9+C,EAAIm+C,EAAE35B,IAAImN,EAAGA,GAETqc,GAAK,EAAG,CAiBV,IAhBA+Q,EAAI71C,GAAK,EAAIA,EAAI61C,EAAI71C,EAAI61C,EACzBthC,EAAEkU,EAAI,GAAK3xB,EAAI++C,EACfthC,EAAEkU,GAAKlU,EAAEkU,EAAI,GACH,IAANotB,IACFthC,EAAEkU,GAAK3xB,EAAItC,EAAIqhD,GAEjBjiD,EAAE60B,EAAI,GAAK,EACX70B,EAAE60B,GAAK,EACP3xB,EAAIm+C,EAAE35B,IAAImN,EAAGA,EAAI,GACjB8X,EAAIvmC,KAAKgF,IAAIlI,GAAKkD,KAAKgF,IAAI62C,GAC3B71C,EAAIlJ,EAAIypC,EACRuE,EAAI+Q,EAAItV,EACRxhC,EAAI/E,KAAK+lC,KAAK//B,EAAIA,EAAI8kC,EAAIA,GAC1B9kC,GAAQjB,EACR+lC,GAAQ/lC,EAEH2V,EAAI+T,EAAI,EAAG/T,EAAI2gC,EAAI3gC,IACtBmhC,EAAIZ,EAAE35B,IAAImN,EAAI,EAAG/T,GACjBugC,EAAE55B,IAAIoN,EAAI,EAAG/T,EAAGowB,EAAI+Q,EAAI71C,EAAIi1C,EAAE35B,IAAImN,EAAG/T,IACrCugC,EAAE55B,IAAIoN,EAAG/T,EAAGowB,EAAImQ,EAAE35B,IAAImN,EAAG/T,GAAK1U,EAAI61C,GAGpC,IAAK38C,EAAI,EAAGA,GAAKuvB,EAAGvvB,IAClB28C,EAAIZ,EAAE35B,IAAIpiB,EAAGuvB,EAAI,GACjBwsB,EAAE55B,IAAIniB,EAAGuvB,EAAI,EAAGqc,EAAI+Q,EAAI71C,EAAIi1C,EAAE35B,IAAIpiB,EAAGuvB,IACrCwsB,EAAE55B,IAAIniB,EAAGuvB,EAAGqc,EAAImQ,EAAE35B,IAAIpiB,EAAGuvB,GAAKzoB,EAAI61C,GAGpC,IAAK38C,EAnFD,EAmFUA,GAAKi8C,EAAMj8C,IACvB28C,EAAIzE,EAAE91B,IAAIpiB,EAAGuvB,EAAI,GACjB2oB,EAAE/1B,IAAIniB,EAAGuvB,EAAI,EAAGqc,EAAI+Q,EAAI71C,EAAIoxC,EAAE91B,IAAIpiB,EAAGuvB,IACrC2oB,EAAE/1B,IAAIniB,EAAGuvB,EAAGqc,EAAIsM,EAAE91B,IAAIpiB,EAAGuvB,GAAKzoB,EAAI61C,EAEtC,MACEthC,EAAEkU,EAAI,GAAK3xB,EAAIkJ,EACfuU,EAAEkU,GAAK3xB,EAAIkJ,EACXpM,EAAE60B,EAAI,GAAKotB,EACXjiD,EAAE60B,IAAMotB,EAGVptB,GAAQ,EACRqtB,EAAO,CACT,KAAO,CASL,GARAh/C,EAAIm+C,EAAE35B,IAAImN,EAAGA,GACb7xB,EAAI,EACJpC,EAAI,EACAqK,EAAI4pB,IACN7xB,EAAIq+C,EAAE35B,IAAImN,EAAI,EAAGA,EAAI,GACrBj0B,EAAIygD,EAAE35B,IAAImN,EAAGA,EAAI,GAAKwsB,EAAE35B,IAAImN,EAAI,EAAGA,IAGxB,KAATqtB,EAAa,CAEf,IADAF,GAAW9+C,EACNoC,EA5GD,EA4GUA,GAAKuvB,EAAGvvB,IACpB+7C,EAAE55B,IAAIniB,EAAGA,EAAG+7C,EAAE35B,IAAIpiB,EAAGA,GAAKpC,GAE5BypC,EAAIvmC,KAAKgF,IAAIi2C,EAAE35B,IAAImN,EAAGA,EAAI,IAAMzuB,KAAKgF,IAAIi2C,EAAE35B,IAAImN,EAAI,EAAGA,EAAI,IAE1D3xB,EAAIF,EAAI,IAAO2pC,EACf/rC,GAAK,MAAS+rC,EAAIA,CACpB,CAEA,GAAa,KAATuV,IACFvV,GAAK3pC,EAAIE,GAAK,EACdypC,EAAIA,EAAIA,EAAI/rC,EACR+rC,EAAI,GAAG,CAMT,IALAA,EAAIvmC,KAAK+lC,KAAKQ,GACV3pC,EAAIE,IACNypC,GAAKA,GAEPA,EAAIzpC,EAAItC,IAAMoC,EAAIE,GAAK,EAAIypC,GACtBrnC,EA9HH,EA8HYA,GAAKuvB,EAAGvvB,IACpB+7C,EAAE55B,IAAIniB,EAAGA,EAAG+7C,EAAE35B,IAAIpiB,EAAGA,GAAKqnC,GAE5BqV,GAAWrV,EAEXzpC,EAAIF,EAAIpC,EAAI,IACd,CAMF,IAHAshD,GAAc,EAEdxY,EAAI7U,EAAI,EACD6U,GAAKz+B,IACVg3C,EAAIZ,EAAE35B,IAAIgiB,EAAGA,GACbv+B,EAAIjI,EAAI++C,EACRtV,EAAI3pC,EAAIi/C,EACR71C,GAAKjB,EAAIwhC,EAAI/rC,GAAKygD,EAAE35B,IAAIgiB,EAAI,EAAGA,GAAK2X,EAAE35B,IAAIgiB,EAAGA,EAAI,GACjDwH,EAAImQ,EAAE35B,IAAIgiB,EAAI,EAAGA,EAAI,GAAKuY,EAAI92C,EAAIwhC,EAClCxhC,EAAIk2C,EAAE35B,IAAIgiB,EAAI,EAAGA,EAAI,GACrBiD,EAAIvmC,KAAKgF,IAAIgB,GAAKhG,KAAKgF,IAAI8lC,GAAK9qC,KAAKgF,IAAID,GACzCiB,GAAQugC,EACRuE,GAAQvE,EACRxhC,GAAQwhC,EACJjD,IAAMz+B,MAIR7E,KAAKgF,IAAIi2C,EAAE35B,IAAIgiB,EAAGA,EAAI,KAAOtjC,KAAKgF,IAAI8lC,GAAK9qC,KAAKgF,IAAID,IACpD4yC,GACG33C,KAAKgF,IAAIgB,IACPhG,KAAKgF,IAAIi2C,EAAE35B,IAAIgiB,EAAI,EAAGA,EAAI,IACzBtjC,KAAKgF,IAAI62C,GACT77C,KAAKgF,IAAIi2C,EAAE35B,IAAIgiB,EAAI,EAAGA,EAAI,QAIlCA,IAGF,IAAKpkC,EAAIokC,EAAI,EAAGpkC,GAAKuvB,EAAGvvB,IACtB+7C,EAAE55B,IAAIniB,EAAGA,EAAI,EAAG,GACZA,EAAIokC,EAAI,GACV2X,EAAE55B,IAAIniB,EAAGA,EAAI,EAAG,GAIpB,IAAKnB,EAAIulC,EAAGvlC,GAAK0wB,EAAI,IACnBitB,EAAU39C,IAAM0wB,EAAI,EAChB1wB,IAAMulC,IACRt9B,EAAIi1C,EAAE35B,IAAIvjB,EAAGA,EAAI,GACjB+sC,EAAImQ,EAAE35B,IAAIvjB,EAAI,EAAGA,EAAI,GACrBgH,EAAI22C,EAAUT,EAAE35B,IAAIvjB,EAAI,EAAGA,EAAI,GAAK,EACpCjB,EAAIkD,KAAKgF,IAAIgB,GAAKhG,KAAKgF,IAAI8lC,GAAK9qC,KAAKgF,IAAID,GAC/B,IAANjI,IACFkJ,GAAQlJ,EACRguC,GAAQhuC,EACRiI,GAAQjI,IAIF,IAANA,GAdkBiB,IAuBtB,GALAwoC,EAAIvmC,KAAK+lC,KAAK//B,EAAIA,EAAI8kC,EAAIA,EAAI/lC,EAAIA,GAC9BiB,EAAI,IACNugC,GAAKA,GAGG,IAANA,EAAS,CAcX,IAbIxoC,IAAMulC,EACR2X,EAAE55B,IAAItjB,EAAGA,EAAI,GAAIwoC,EAAIzpC,GACZ+H,IAAMy+B,GACf2X,EAAE55B,IAAItjB,EAAGA,EAAI,GAAIk9C,EAAE35B,IAAIvjB,EAAGA,EAAI,IAGhCiI,GAAQugC,EACRzpC,EAAIkJ,EAAIugC,EACR3pC,EAAIkuC,EAAIvE,EACRsV,EAAI92C,EAAIwhC,EACRuE,GAAQ9kC,EACRjB,GAAQiB,EAEH0U,EAAI3c,EAAG2c,EAAI2gC,EAAI3gC,IAClB1U,EAAIi1C,EAAE35B,IAAIvjB,EAAG2c,GAAKowB,EAAImQ,EAAE35B,IAAIvjB,EAAI,EAAG2c,GAC/BghC,IACF11C,GAAQjB,EAAIk2C,EAAE35B,IAAIvjB,EAAI,EAAG2c,GACzBugC,EAAE55B,IAAItjB,EAAI,EAAG2c,EAAGugC,EAAE35B,IAAIvjB,EAAI,EAAG2c,GAAK1U,EAAI61C,IAGxCZ,EAAE55B,IAAItjB,EAAG2c,EAAGugC,EAAE35B,IAAIvjB,EAAG2c,GAAK1U,EAAIlJ,GAC9Bm+C,EAAE55B,IAAItjB,EAAI,EAAG2c,EAAGugC,EAAE35B,IAAIvjB,EAAI,EAAG2c,GAAK1U,EAAIpJ,GAGxC,IAAKsC,EAAI,EAAGA,GAAKc,KAAK+F,IAAI0oB,EAAG1wB,EAAI,GAAImB,IACnC8G,EAAIlJ,EAAIm+C,EAAE35B,IAAIpiB,EAAGnB,GAAKnB,EAAIq+C,EAAE35B,IAAIpiB,EAAGnB,EAAI,GACnC29C,IACF11C,GAAQ61C,EAAIZ,EAAE35B,IAAIpiB,EAAGnB,EAAI,GACzBk9C,EAAE55B,IAAIniB,EAAGnB,EAAI,EAAGk9C,EAAE35B,IAAIpiB,EAAGnB,EAAI,GAAKiI,EAAIjB,IAGxCk2C,EAAE55B,IAAIniB,EAAGnB,EAAGk9C,EAAE35B,IAAIpiB,EAAGnB,GAAKiI,GAC1Bi1C,EAAE55B,IAAIniB,EAAGnB,EAAI,EAAGk9C,EAAE35B,IAAIpiB,EAAGnB,EAAI,GAAKiI,EAAI8kC,GAGxC,IAAK5rC,EAvOH,EAuOYA,GAAKi8C,EAAMj8C,IACvB8G,EAAIlJ,EAAIs6C,EAAE91B,IAAIpiB,EAAGnB,GAAKnB,EAAIw6C,EAAE91B,IAAIpiB,EAAGnB,EAAI,GACnC29C,IACF11C,GAAQ61C,EAAIzE,EAAE91B,IAAIpiB,EAAGnB,EAAI,GACzBq5C,EAAE/1B,IAAIniB,EAAGnB,EAAI,EAAGq5C,EAAE91B,IAAIpiB,EAAGnB,EAAI,GAAKiI,EAAIjB,IAGxCqyC,EAAE/1B,IAAIniB,EAAGnB,EAAGq5C,EAAE91B,IAAIpiB,EAAGnB,GAAKiI,GAC1BoxC,EAAE/1B,IAAIniB,EAAGnB,EAAI,EAAGq5C,EAAE91B,IAAIpiB,EAAGnB,EAAI,GAAKiI,EAAI8kC,EAE1C,CAEJ,CACF,CAEA,GAAa,IAAThF,EAAJ,CAIA,IAAKrX,EAAI4sB,EAAK,EAAG5sB,GAAK,EAAGA,IAIvB,GAHAzoB,EAAIuU,EAAEkU,GACNqc,EAAIlxC,EAAE60B,GAEI,IAANqc,EAGF,IAFAjmC,EAAI4pB,EACJwsB,EAAE55B,IAAIoN,EAAGA,EAAG,GACPvvB,EAAIuvB,EAAI,EAAGvvB,GAAK,EAAGA,IAAK,CAG3B,IAFA1E,EAAIygD,EAAE35B,IAAIpiB,EAAGA,GAAK8G,EAClBjB,EAAI,EACC2V,EAAI7V,EAAG6V,GAAK+T,EAAG/T,IAClB3V,GAAQk2C,EAAE35B,IAAIpiB,EAAGwb,GAAKugC,EAAE35B,IAAI5G,EAAG+T,GAGjC,GAAI70B,EAAEsF,GAAK,EACT28C,EAAIrhD,EACJ+rC,EAAIxhC,OAmBJ,GAjBAF,EAAI3F,EACS,IAATtF,EAAEsF,GACJ+7C,EAAE55B,IAAIniB,EAAGuvB,EAAS,IAANj0B,GAAWuK,EAAIvK,GAAKuK,GAAK4yC,EAAM7R,KAE3ChpC,EAAIm+C,EAAE35B,IAAIpiB,EAAGA,EAAI,GACjBtC,EAAIq+C,EAAE35B,IAAIpiB,EAAI,EAAGA,GACjB4rC,GAAKvwB,EAAErb,GAAK8G,IAAMuU,EAAErb,GAAK8G,GAAKpM,EAAEsF,GAAKtF,EAAEsF,GACvCyF,GAAK7H,EAAIypC,EAAIsV,EAAI92C,GAAK+lC,EACtBmQ,EAAE55B,IAAIniB,EAAGuvB,EAAG9pB,GACZs2C,EAAE55B,IACAniB,EAAI,EACJuvB,EACAzuB,KAAKgF,IAAIlI,GAAKkD,KAAKgF,IAAI62C,KAAO92C,EAAIvK,EAAImK,GAAK7H,IAAMypC,EAAI3pC,EAAI+H,GAAKk3C,IAIlEl3C,EAAI3E,KAAKgF,IAAIi2C,EAAE35B,IAAIpiB,EAAGuvB,IAClBkpB,EAAMhzC,EAAIA,EAAI,EAChB,IAAK+V,EAAIxb,EAAGwb,GAAK+T,EAAG/T,IAClBugC,EAAE55B,IAAI3G,EAAG+T,EAAGwsB,EAAE35B,IAAI5G,EAAG+T,GAAK9pB,EAIlC,MACK,GAAImmC,EAAI,EAcb,IAbAjmC,EAAI4pB,EAAI,EAEJzuB,KAAKgF,IAAIi2C,EAAE35B,IAAImN,EAAGA,EAAI,IAAMzuB,KAAKgF,IAAIi2C,EAAE35B,IAAImN,EAAI,EAAGA,KACpDwsB,EAAE55B,IAAIoN,EAAI,EAAGA,EAAI,EAAGqc,EAAImQ,EAAE35B,IAAImN,EAAGA,EAAI,IACrCwsB,EAAE55B,IAAIoN,EAAI,EAAGA,IAAKwsB,EAAE35B,IAAImN,EAAGA,GAAKzoB,GAAKi1C,EAAE35B,IAAImN,EAAGA,EAAI,MAElDktB,EAAUI,EAAK,GAAId,EAAE35B,IAAImN,EAAI,EAAGA,GAAIwsB,EAAE35B,IAAImN,EAAI,EAAGA,EAAI,GAAKzoB,EAAG8kC,GAC7DmQ,EAAE55B,IAAIoN,EAAI,EAAGA,EAAI,EAAGktB,EAAQ,IAC5BV,EAAE55B,IAAIoN,EAAI,EAAGA,EAAGktB,EAAQ,KAG1BV,EAAE55B,IAAIoN,EAAGA,EAAI,EAAG,GAChBwsB,EAAE55B,IAAIoN,EAAGA,EAAG,GACPvvB,EAAIuvB,EAAI,EAAGvvB,GAAK,EAAGA,IAAK,CAG3B,IAFAo8C,EAAK,EACLC,EAAK,EACA7gC,EAAI7V,EAAG6V,GAAK+T,EAAG/T,IAClB4gC,GAAUL,EAAE35B,IAAIpiB,EAAGwb,GAAKugC,EAAE35B,IAAI5G,EAAG+T,EAAI,GACrC8sB,GAAUN,EAAE35B,IAAIpiB,EAAGwb,GAAKugC,EAAE35B,IAAI5G,EAAG+T,GAKnC,GAFAj0B,EAAIygD,EAAE35B,IAAIpiB,EAAGA,GAAK8G,EAEdpM,EAAEsF,GAAK,EACT28C,EAAIrhD,EACJuK,EAAIu2C,EACJ/U,EAAIgV,OAsDJ,GApDA12C,EAAI3F,EACS,IAATtF,EAAEsF,IACJy8C,EAAUI,GAAMT,GAAKC,EAAI/gD,EAAGswC,GAC5BmQ,EAAE55B,IAAIniB,EAAGuvB,EAAI,EAAGktB,EAAQ,IACxBV,EAAE55B,IAAIniB,EAAGuvB,EAAGktB,EAAQ,MAEpB7+C,EAAIm+C,EAAE35B,IAAIpiB,EAAGA,EAAI,GACjBtC,EAAIq+C,EAAE35B,IAAIpiB,EAAI,EAAGA,GACjBs8C,GAAMjhC,EAAErb,GAAK8G,IAAMuU,EAAErb,GAAK8G,GAAKpM,EAAEsF,GAAKtF,EAAEsF,GAAK4rC,EAAIA,EACjD2Q,EAAkB,GAAZlhC,EAAErb,GAAK8G,GAAS8kC,EACX,IAAP0Q,GAAmB,IAAPC,IACdD,EACE7D,EACA7R,GACC9lC,KAAKgF,IAAIxK,GACRwF,KAAKgF,IAAI8lC,GACT9qC,KAAKgF,IAAIlI,GACTkD,KAAKgF,IAAIpI,GACToD,KAAKgF,IAAI62C,KAEfF,EAAUI,EACRj/C,EAAIiI,EAAI82C,EAAIP,EAAKxQ,EAAIyQ,EACrBz+C,EAAIypC,EAAIsV,EAAIN,EAAKzQ,EAAIwQ,EACrBE,EACAC,GAEFR,EAAE55B,IAAIniB,EAAGuvB,EAAI,EAAGktB,EAAQ,IACxBV,EAAE55B,IAAIniB,EAAGuvB,EAAGktB,EAAQ,IAChB37C,KAAKgF,IAAIlI,GAAKkD,KAAKgF,IAAI62C,GAAK77C,KAAKgF,IAAI8lC,IACvCmQ,EAAE55B,IACAniB,EAAI,EACJuvB,EAAI,IACF6sB,EAAK9gD,EAAIygD,EAAE35B,IAAIpiB,EAAGuvB,EAAI,GAAKqc,EAAImQ,EAAE35B,IAAIpiB,EAAGuvB,IAAM3xB,GAElDm+C,EAAE55B,IACAniB,EAAI,EACJuvB,IACE8sB,EAAK/gD,EAAIygD,EAAE35B,IAAIpiB,EAAGuvB,GAAKqc,EAAImQ,EAAE35B,IAAIpiB,EAAGuvB,EAAI,IAAM3xB,KAGlD6+C,EAAUI,GACPh3C,EAAInI,EAAIq+C,EAAE35B,IAAIpiB,EAAGuvB,EAAI,IACrB8X,EAAI3pC,EAAIq+C,EAAE35B,IAAIpiB,EAAGuvB,GAClBotB,EACA/Q,GAEFmQ,EAAE55B,IAAIniB,EAAI,EAAGuvB,EAAI,EAAGktB,EAAQ,IAC5BV,EAAE55B,IAAIniB,EAAI,EAAGuvB,EAAGktB,EAAQ,MAI5Bh3C,EAAI3E,KAAKC,IAAID,KAAKgF,IAAIi2C,EAAE35B,IAAIpiB,EAAGuvB,EAAI,IAAKzuB,KAAKgF,IAAIi2C,EAAE35B,IAAIpiB,EAAGuvB,KACtDkpB,EAAMhzC,EAAIA,EAAI,EAChB,IAAK+V,EAAIxb,EAAGwb,GAAK+T,EAAG/T,IAClBugC,EAAE55B,IAAI3G,EAAG+T,EAAI,EAAGwsB,EAAE35B,IAAI5G,EAAG+T,EAAI,GAAK9pB,GAClCs2C,EAAE55B,IAAI3G,EAAG+T,EAAGwsB,EAAE35B,IAAI5G,EAAG+T,GAAK9pB,EAIlC,CAIJ,IAAKzF,EAAI,EAAGA,EAAIm8C,EAAIn8C,IAClB,GAAIA,EAjYI,GAiYOA,EAAIi8C,EACjB,IAAKzgC,EAAIxb,EAAGwb,EAAI2gC,EAAI3gC,IAClB08B,EAAE/1B,IAAIniB,EAAGwb,EAAGugC,EAAE35B,IAAIpiB,EAAGwb,IAK3B,IAAKA,EAAI2gC,EAAK,EAAG3gC,GAxYP,EAwYiBA,IACzB,IAAKxb,EAzYG,EAyYMA,GAAKi8C,EAAMj8C,IAAK,CAE5B,IADA28C,EAAI,EACC99C,EA3YC,EA2YQA,GAAKiC,KAAK+F,IAAI2U,EAAGygC,GAAOp9C,IACpC89C,GAAQzE,EAAE91B,IAAIpiB,EAAGnB,GAAKk9C,EAAE35B,IAAIvjB,EAAG2c,GAEjC08B,EAAE/1B,IAAIniB,EAAGwb,EAAGmhC,EACd,CAvJF,CAyJF,CAluBMG,CAAKvtB,EAAG70B,EAAG2gB,EAAG68B,EAAG6D,EACnB,CAEAv9C,KAAK+wB,EAAIA,EACT/wB,KAAK9D,EAAIA,EACT8D,KAAK6c,EAAIA,EACT7c,KAAK05C,EAAIA,CACX,CAEA,mBAAI6E,GACF,OAAOjxC,MAAM8gC,KAAKpuC,KAAK6c,EACzB,CAEA,wBAAI2hC,GACF,OAAOlxC,MAAM8gC,KAAKpuC,KAAK9D,EACzB,CAEA,qBAAIuiD,GACF,OAAOz+C,KAAK05C,CACd,CAEA,kBAAIwC,GACF,IAII16C,EAAGwb,EAJH+T,EAAI/wB,KAAK+wB,EACT70B,EAAI8D,KAAK9D,EACT2gB,EAAI7c,KAAK6c,EACTm7B,EAAI,IAAIzU,EAAOxS,EAAGA,GAEtB,IAAKvvB,EAAI,EAAGA,EAAIuvB,EAAGvvB,IAAK,CACtB,IAAKwb,EAAI,EAAGA,EAAI+T,EAAG/T,IACjBg7B,EAAEr0B,IAAIniB,EAAGwb,EAAG,GAEdg7B,EAAEr0B,IAAIniB,EAAGA,EAAGqb,EAAErb,IACVtF,EAAEsF,GAAK,EACTw2C,EAAEr0B,IAAIniB,EAAGA,EAAI,EAAGtF,EAAEsF,IACTtF,EAAEsF,GAAK,GAChBw2C,EAAEr0B,IAAIniB,EAAGA,EAAI,EAAGtF,EAAEsF,GAEtB,CACA,OAAOw2C,CACT,EA6rBF,SAASqG,EAAKK,EAAIC,EAAIC,EAAIC,GACxB,IAAIx3C,EAAGwV,EACP,OAAIva,KAAKgF,IAAIs3C,GAAMt8C,KAAKgF,IAAIu3C,IAC1Bx3C,EAAIw3C,EAAKD,EACT/hC,EAAI+hC,EAAKv3C,EAAIw3C,EACN,EAAEH,EAAKr3C,EAAIs3C,GAAM9hC,GAAI8hC,EAAKt3C,EAAIq3C,GAAM7hC,KAE3CxV,EAAIu3C,EAAKC,EACThiC,EAAIgiC,EAAKx3C,EAAIu3C,EACN,EAAEv3C,EAAIq3C,EAAKC,GAAM9hC,GAAIxV,EAAIs3C,EAAKD,GAAM7hC,GAE/C,CAEA,MAAMiiC,EACJ,WAAAp9B,CAAY1G,GAEV,KADAA,EAAQs8B,EAAgB9S,YAAYxpB,IACzBkqB,cACT,MAAM,IAAItqB,MAAM,2BAGlB,IAIIpZ,EAAGwb,EAAG3c,EAJNksC,EAAIvxB,EACJ+jC,EAAYxS,EAAE1L,KACd15B,EAAI,IAAIo8B,EAAOwb,EAAWA,GAC1BC,GAAmB,EAGvB,IAAKhiC,EAAI,EAAGA,EAAI+hC,EAAW/hC,IAAK,CAC9B,IAAIH,EAAI,EACR,IAAKxc,EAAI,EAAGA,EAAI2c,EAAG3c,IAAK,CACtB,IAAIwoC,EAAI,EACR,IAAKrnC,EAAI,EAAGA,EAAInB,EAAGmB,IACjBqnC,GAAK1hC,EAAEyc,IAAIvjB,EAAGmB,GAAK2F,EAAEyc,IAAI5G,EAAGxb,GAE9BqnC,GAAK0D,EAAE3oB,IAAI5G,EAAG3c,GAAKwoC,GAAK1hC,EAAEyc,IAAIvjB,EAAGA,GACjC8G,EAAEwc,IAAI3G,EAAG3c,EAAGwoC,GACZhsB,GAAQgsB,EAAIA,CACd,CAMA,IAJAhsB,EAAI0vB,EAAE3oB,IAAI5G,EAAGA,GAAKH,EAElBmiC,GAAoBniC,EAAI,EACxB1V,EAAEwc,IAAI3G,EAAGA,EAAG1a,KAAK+lC,KAAK/lC,KAAKC,IAAIsa,EAAG,KAC7Bxc,EAAI2c,EAAI,EAAG3c,EAAI0+C,EAAW1+C,IAC7B8G,EAAEwc,IAAI3G,EAAG3c,EAAG,EAEhB,CAEAL,KAAKi/C,EAAI93C,EACTnH,KAAKg/C,iBAAmB7F,QAAQ6F,EAClC,CAEA,kBAAAE,GACE,OAAOl/C,KAAKg/C,gBACd,CAEA,KAAAjH,CAAM/8B,GACJA,EAAQs8B,EAAgB9S,YAAYxpB,GAEpC,IAAI7T,EAAInH,KAAKi/C,EACTF,EAAY53C,EAAE05B,KAElB,GAAI7lB,EAAM6lB,OAASke,EACjB,MAAM,IAAInkC,MAAM,kCAElB,IAAkC,IAA9B5a,KAAKk/C,qBACP,MAAM,IAAItkC,MAAM,mCAGlB,IAEIpZ,EAAGwb,EAAG3c,EAFNw5B,EAAQ7e,EAAM8lB,QACdqe,EAAInkC,EAAM2H,QAGd,IAAKtiB,EAAI,EAAGA,EAAI0+C,EAAW1+C,IACzB,IAAK2c,EAAI,EAAGA,EAAI6c,EAAO7c,IAAK,CAC1B,IAAKxb,EAAI,EAAGA,EAAInB,EAAGmB,IACjB29C,EAAEx7B,IAAItjB,EAAG2c,EAAGmiC,EAAEv7B,IAAIvjB,EAAG2c,GAAKmiC,EAAEv7B,IAAIpiB,EAAGwb,GAAK7V,EAAEyc,IAAIvjB,EAAGmB,IAEnD29C,EAAEx7B,IAAItjB,EAAG2c,EAAGmiC,EAAEv7B,IAAIvjB,EAAG2c,GAAK7V,EAAEyc,IAAIvjB,EAAGA,GACrC,CAGF,IAAKA,EAAI0+C,EAAY,EAAG1+C,GAAK,EAAGA,IAC9B,IAAK2c,EAAI,EAAGA,EAAI6c,EAAO7c,IAAK,CAC1B,IAAKxb,EAAInB,EAAI,EAAGmB,EAAIu9C,EAAWv9C,IAC7B29C,EAAEx7B,IAAItjB,EAAG2c,EAAGmiC,EAAEv7B,IAAIvjB,EAAG2c,GAAKmiC,EAAEv7B,IAAIpiB,EAAGwb,GAAK7V,EAAEyc,IAAIpiB,EAAGnB,IAEnD8+C,EAAEx7B,IAAItjB,EAAG2c,EAAGmiC,EAAEv7B,IAAIvjB,EAAG2c,GAAK7V,EAAEyc,IAAIvjB,EAAGA,GACrC,CAGF,OAAO8+C,CACT,CAEA,yBAAIjH,GACF,OAAOl4C,KAAKi/C,CACd,EAGF,MAAMG,EACJ,WAAA19B,CAAYs2B,EAAGt1B,EAAU,CAAC,GACxBs1B,EAAIV,EAAgB9S,YAAYwT,GAChC,IAAI,EAAEgD,GAAMt4B,EACZ,MAAM,YACJ28B,GAAc,EAAK,cACnBC,EAAgB,IAAI,oBACpBC,EAAsB,OACpB78B,EAEJ,IAAI/gB,EACJ,GAAIq5C,EAAG,CAML,GAJEA,EADEn4B,EAAWA,WAAWm4B,IAAsB,iBAATA,EAAE,GACnCzX,EAAOI,aAAaqX,GAEpB1D,EAAgB9S,YAAYwW,GAE9BA,EAAEna,OAASmX,EAAEnX,KACf,MAAM,IAAIjmB,MAAM,8CAElBjZ,EAAIq5C,EAAEvU,gBAAgB,EACxB,MACE9kC,EAAIq2C,EAAEvR,gBAAgB,GAGxB,IACIx/B,EAAGmmC,EAAGtwC,EAAG0iD,EADTC,EAAO,EAGX,IACE,IAAIC,EAAU,EACdA,EAAUJ,GAAiBG,EAAOF,EAClCG,IAEA5iD,EAAIk7C,EAAExK,YAAY9E,KAAK/mC,GAAGswC,IAAItwC,EAAE6rC,YAAY9E,KAAK/mC,GAAGiiB,IAAI,EAAG,IAC3D9mB,EAAIA,EAAEm1C,IAAIn1C,EAAEsrC,QAEZnhC,EAAI+wC,EAAEtP,KAAK5rC,GAAGm1C,IAAIn1C,EAAE0wC,YAAY9E,KAAK5rC,GAAG8mB,IAAI,EAAG,IAE3C87B,EAAU,IACZD,EAAOx4C,EAAE0b,QAAQgqB,IAAI6S,GAAM7P,IAAI,GAAGpjC,OAEpCizC,EAAOv4C,EAAE0b,QAELq4B,GACF5N,EAAI4N,EAAExN,YAAY9E,KAAKzhC,GAAGgrC,IAAIhrC,EAAEumC,YAAY9E,KAAKzhC,GAAG2c,IAAI,EAAG,IAC3DwpB,EAAIA,EAAE6E,IAAI7E,EAAEhF,QAEZzmC,EAAIq5C,EAAEtS,KAAK0E,GAAG6E,IAAI7E,EAAEI,YAAY9E,KAAK0E,GAAGxpB,IAAI,EAAG,KAE/CjiB,EAAIsF,EAIR,GAAI+zC,EAAG,CACL,IAAI1yC,EAAI0vC,EAAExK,YAAY9E,KAAKzhC,GAAGgrC,IAAIhrC,EAAEumC,YAAY9E,KAAKzhC,GAAG2c,IAAI,EAAG,IAC/Dtb,EAAIA,EAAE2pC,IAAI3pC,EAAE8/B,QACZ,IAAIuX,EAAY3H,EAAEr1B,QAAQgqB,IAAI1lC,EAAE0b,QAAQ+lB,KAAKpgC,EAAEklC,cAC3CoS,EAAWj+C,EAAE6rC,YAAY9E,KAAKzhC,GAAGgrC,IAAIhrC,EAAEumC,YAAY9E,KAAKzhC,GAAG2c,IAAI,EAAG,IAClEi8B,EAAY7E,EAAEr4B,QAAQgqB,IACxB1lC,EAAE0b,QAAQsjB,KAAK2Z,EAASh8B,IAAI,EAAG,IAAI8kB,KAAK0E,EAAEI,cAG5CxtC,KAAKiH,EAAIA,EACTjH,KAAKsI,EAAIA,EAAEklC,YACXxtC,KAAKlD,EAAIA,EAAE0wC,YACXxtC,KAAKotC,EAAIA,EACTptC,KAAK2B,EAAIA,EACT3B,KAAK6oC,EAAI5hC,EAAEumC,YAAY9E,KAAKzhC,GAC5BjH,KAAK2/C,UAAYA,EACjB3/C,KAAK6/C,UAAYA,EACjB7/C,KAAK8/C,MAAQF,CACf,MACE5/C,KAAKlD,EAAIA,EAAE0wC,YACXxtC,KAAK6oC,EAAI5hC,EAAEumC,YAAY9E,KAAKzhC,GAAGohC,OAE7BroC,KAAKiH,EADHo4C,EACOp4C,EAAE0b,QAAQsvB,IAAIjyC,KAAK6oC,EAAEjlB,IAAI,EAAG,IAE5B3c,EAEXjH,KAAK2/C,UAAY3H,EAAErL,IAAI1lC,EAAEyhC,KAAK5rC,EAAE0wC,aAEpC,EAGFryC,EAAQ,GAAiB8nC,EACzB9nC,EAAQ,GAAM2jD,EACd3jD,EAAQ,GAAwB2jD,EAChC3jD,EAAQ,GAAiB07C,EACzB17C,EAAQ,GAAM0hD,EACd1hD,EAAQ,GAA0B0hD,EAClC1hD,EAAQ08C,GAAKN,EACbp8C,EAAQ,GAAkBo8C,EAC1Bp8C,EAAQ,GAASooC,EACjBpoC,EAAQ,GAxsER,cAAwC+7C,EACtC,WAAAx1B,CAAY8e,EAAQgC,GAClBD,EAAmB/B,EAAQgC,GAC3BoO,MAAMpQ,EAAQA,EAAOK,KAAM2B,EAAc/jC,QACzCuB,KAAKwiC,cAAgBA,CACvB,CAEA,GAAA7e,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKwgC,OAAO7c,IAAIsqB,EAAUjuC,KAAKwiC,cAAc0L,GAAclzB,GACpDhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKwgC,OAAO5c,IAAIqqB,EAAUjuC,KAAKwiC,cAAc0L,GACtD,GA2rEF/yC,EAAQ,GA1tER,cAA+B+7C,EAC7B,WAAAx1B,CAAY8e,EAAQiD,GAClBzB,EAAiBxB,EAAQiD,GACzBmN,MAAMpQ,EAAQA,EAAOK,KAAM,GAC3B7gC,KAAKyjC,OAASA,CAChB,CAEA,GAAA9f,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKwgC,OAAO7c,IAAIsqB,EAAUjuC,KAAKyjC,OAAQzoB,GAChChb,IACT,CAEA,GAAA4jB,CAAIqqB,GACF,OAAOjuC,KAAKwgC,OAAO5c,IAAIqqB,EAAUjuC,KAAKyjC,OACxC,GA6sEFtoC,EAAQ,GAzrER,cAAmC+7C,EACjC,WAAAx1B,CAAY8e,GACVoQ,MAAMpQ,EAAQA,EAAOK,KAAML,EAAOM,QACpC,CAEA,GAAAnd,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKwgC,OAAO7c,IAAIsqB,EAAUjuC,KAAK8gC,QAAUoN,EAAc,EAAGlzB,GACnDhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKwgC,OAAO5c,IAAIqqB,EAAUjuC,KAAK8gC,QAAUoN,EAAc,EAChE,GA8qEF/yC,EAAQ,GA3qER,cAAgC+7C,EAC9B,WAAAx1B,CAAY8e,GACVoQ,MAAMpQ,EAAQA,EAAOK,KAAML,EAAOM,QACpC,CAEA,GAAAnd,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKwgC,OAAO7c,IAAI3jB,KAAK6gC,KAAOoN,EAAW,EAAGC,EAAalzB,GAChDhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKwgC,OAAO5c,IAAI5jB,KAAK6gC,KAAOoN,EAAW,EAAGC,EACnD,GAgqEF/yC,EAAQ,GA5oER,cAAqC+7C,EACnC,WAAAx1B,CAAY8e,EAAQ8B,GAClBD,EAAgB7B,EAAQ8B,GACxBsO,MAAMpQ,EAAQ8B,EAAW7jC,OAAQ+hC,EAAOM,SACxC9gC,KAAKsiC,WAAaA,CACpB,CAEA,GAAA3e,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKwgC,OAAO7c,IAAI3jB,KAAKsiC,WAAW2L,GAAWC,EAAalzB,GACjDhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKwgC,OAAO5c,IAAI5jB,KAAKsiC,WAAW2L,GAAWC,EACpD,GA+nEF/yC,EAAQ,GA9pER,cAA4B+7C,EAC1B,WAAAx1B,CAAY8e,EAAQgD,GAClBzB,EAAcvB,EAAQgD,GACtBoN,MAAMpQ,EAAQ,EAAGA,EAAOM,SACxB9gC,KAAKwjC,IAAMA,CACb,CAEA,GAAA7f,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKwgC,OAAO7c,IAAI3jB,KAAKwjC,IAAK0K,EAAalzB,GAChChb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKwgC,OAAO5c,IAAI5jB,KAAKwjC,IAAK0K,EACnC,GAipEF/yC,EAAQ,GAAsBg8C,EAC9Bh8C,EAAQ,GApmER,cAA4B+7C,EAC1B,WAAAx1B,CAAY8e,EAAQkC,EAAUC,EAAQC,EAAaC,GACjDJ,EAAWjC,EAAQkC,EAAUC,EAAQC,EAAaC,GAClD+N,MAAMpQ,EAAQmC,EAASD,EAAW,EAAGG,EAAYD,EAAc,GAC/D5iC,KAAK0iC,SAAWA,EAChB1iC,KAAK4iC,YAAcA,CACrB,CAEA,GAAAjf,CAAIsqB,EAAUC,EAAalzB,GAMzB,OALAhb,KAAKwgC,OAAO7c,IACV3jB,KAAK0iC,SAAWuL,EAChBjuC,KAAK4iC,YAAcsL,EACnBlzB,GAEKhb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKwgC,OAAO5c,IACjB5jB,KAAK0iC,SAAWuL,EAChBjuC,KAAK4iC,YAAcsL,EAEvB,GA+kEF/yC,EAAQ,GA5kER,cAAkC+7C,EAChC,WAAAx1B,CAAY8e,GACVoQ,MAAMpQ,EAAQA,EAAOM,QAASN,EAAOK,KACvC,CAEA,GAAAld,CAAIsqB,EAAUC,EAAalzB,GAEzB,OADAhb,KAAKwgC,OAAO7c,IAAIuqB,EAAaD,EAAUjzB,GAChChb,IACT,CAEA,GAAA4jB,CAAIqqB,EAAUC,GACZ,OAAOluC,KAAKwgC,OAAO5c,IAAIsqB,EAAaD,EACtC,GAikEF9yC,EAAQ,GAASikD,EACjBjkD,EAAQ,GAASikD,EACjBjkD,EAAQu9C,GAAKJ,EACbn9C,EAAQ,GAAkBm9C,EAC1Bn9C,EAAQ,GAAM29C,EACd39C,EAAQ,GAA6B29C,EACrC39C,EAAQ,EAAkBw6C,EAC1Bx6C,EAAQ,GAAkBi8C,EAC1Bj8C,EAAQ,GAAkBm8C,EAC1Bn8C,EAAQ,GAnhCR,SAAqB4kD,EAASC,EAAUD,EAASr9B,EAAU,CAAC,GAC1Dq9B,EAAU,IAAIxc,EAAOwc,GACrB,IAAIE,GAAU,EAYd,GAVqB,iBAAZD,GACNzc,EAAOkB,SAASub,IAChBn9B,EAAWA,WAAWm9B,GAMvBA,EAAU,IAAIzc,EAAOyc,IAJrBt9B,EAAUs9B,EACVA,EAAUD,EACVE,GAAU,GAIRF,EAAQlf,OAASmf,EAAQnf,KAC3B,MAAM,IAAIvD,UAAU,mDAGtB,MAAM,OAAEgS,GAAS,EAAI,MAAEI,GAAQ,GAAShtB,EACpC4sB,IACFyQ,EAAQzQ,OAAO,UACV2Q,GACHD,EAAQ1Q,OAAO,WAGfI,IACFqQ,EAAQrQ,MAAM,UACTuQ,GACHD,EAAQtQ,MAAM,WAIlB,MAAMwQ,EAAMH,EAAQ1Q,kBAAkB,SAAU,CAAEN,UAAU,IACtDoR,EAAMF,EACRC,EACAF,EAAQ3Q,kBAAkB,SAAU,CAAEN,UAAU,IAE9CqR,EAAOL,EAAQvS,YAAY9E,KAAKsX,GACtC,IAAK,IAAIx+C,EAAI,EAAGA,EAAI4+C,EAAKvf,KAAMr/B,IAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIojC,EAAKtf,QAAS9jB,IAChCojC,EAAKz8B,IACHniB,EACAwb,EACAojC,EAAKx8B,IAAIpiB,EAAGwb,IAAM,GAAKkjC,EAAI1+C,GAAK2+C,EAAInjC,MAAQ,GAAK+iC,EAAQlf,KAAO,KAItE,OAAOuf,CACT,EAo+BAjlD,EAAQ,GArjCR,SAAoB4kD,EAASC,EAAUD,EAASr9B,EAAU,CAAC,GACzDq9B,EAAU,IAAIxc,EAAOwc,GACrB,IAAIE,GAAU,EAYd,GAVqB,iBAAZD,GACNzc,EAAOkB,SAASub,IAChBn9B,EAAWA,WAAWm9B,GAMvBA,EAAU,IAAIzc,EAAOyc,IAJrBt9B,EAAUs9B,EACVA,EAAUD,EACVE,GAAU,GAIRF,EAAQlf,OAASmf,EAAQnf,KAC3B,MAAM,IAAIvD,UAAU,mDAEtB,MAAM,OAAEgS,GAAS,GAAS5sB,EACtB4sB,IACFyQ,EAAUA,EAAQzQ,OAAO,UACpB2Q,IACHD,EAAUA,EAAQ1Q,OAAO,YAG7B,MAAM+Q,EAAMN,EAAQvS,YAAY9E,KAAKsX,GACrC,IAAK,IAAIx+C,EAAI,EAAGA,EAAI6+C,EAAIxf,KAAMr/B,IAC5B,IAAK,IAAIwb,EAAI,EAAGA,EAAIqjC,EAAIvf,QAAS9jB,IAC/BqjC,EAAI18B,IAAIniB,EAAGwb,EAAGqjC,EAAIz8B,IAAIpiB,EAAGwb,IAAM,GAAK+iC,EAAQlf,KAAO,KAGvD,OAAOwf,CACT,EAwhCAllD,EAAQ,GA3qCR,SAAS88C,EAAYzX,GAEnB,IADAA,EAAS+C,EAAOiB,YAAYhE,IACjByE,WAAY,CACrB,GAAuB,IAAnBzE,EAAOM,QACT,OAAO,EAGT,IAAIyL,EAAGrlC,EAAGilC,EAAGtvB,EACb,GAAuB,IAAnB2jB,EAAOM,QAOT,OALAyL,EAAI/L,EAAO5c,IAAI,EAAG,GAClB1c,EAAIs5B,EAAO5c,IAAI,EAAG,GAClBuoB,EAAI3L,EAAO5c,IAAI,EAAG,GAClB/G,EAAI2jB,EAAO5c,IAAI,EAAG,GAEX2oB,EAAI1vB,EAAI3V,EAAIilC,EACd,GAAuB,IAAnB3L,EAAOM,QAAe,CAE/B,IAAIwf,EAAYC,EAAYC,EAQ5B,OAPAF,EAAa,IAAInJ,EAAoB3W,EAAQ,CAAC,EAAG,GAAI,CAAC,EAAG,IACzD+f,EAAa,IAAIpJ,EAAoB3W,EAAQ,CAAC,EAAG,GAAI,CAAC,EAAG,IACzDggB,EAAa,IAAIrJ,EAAoB3W,EAAQ,CAAC,EAAG,GAAI,CAAC,EAAG,IACzD+L,EAAI/L,EAAO5c,IAAI,EAAG,GAClB1c,EAAIs5B,EAAO5c,IAAI,EAAG,GAClBuoB,EAAI3L,EAAO5c,IAAI,EAAG,GAGhB2oB,EAAI0L,EAAYqI,GAChBp5C,EAAI+wC,EAAYsI,GAChBpU,EAAI8L,EAAYuI,EAEpB,CAEE,OAAO,IAAIjJ,EAAgB/W,GAAQyX,WAEvC,CACE,MAAMr9B,MAAM,yDAEhB,EAsoCAzf,EAAQ,GAjsCR,SAAiBqlC,EAAQ6b,GAAS,GAEhC,OADA7b,EAAS8W,EAAgB9S,YAAYhE,GACjC6b,EACK,IAAIvD,EAA2BtY,GAAQkb,UAEvC3D,EAAMvX,EAAQ+C,EAAOa,IAAI5D,EAAOK,MAE3C,EA2rCA1lC,EAAQ,GAvmCR,SAA4BqlC,EAAQ9d,EAAU,CAAC,GAC7C,MAAM,eAAEg6B,EAAiB,KAAM,eAAEC,EAAiB,MAAWj6B,EAG7D,IAAIqO,GAFJyP,EAAS+C,EAAOiB,YAAYhE,IAEbK,KACX99B,EAAU,IAAIwgC,EAAOxS,EAAGA,GAE5B,IAAK,IAAIvvB,EAAI,EAAGA,EAAIuvB,EAAGvvB,IAAK,CAC1B,IAAI0F,EAAIq8B,EAAOI,aAAanD,EAAO0F,OAAO1kC,IACtCi/C,EAAOjgB,EAAOqN,aAAayO,EAAOvrB,EAAGvvB,IAAIgsC,YAEzCpuC,EADM,IAAI05C,EAA2B2H,GAC7B1I,MAAM7wC,GACdu1C,EAAQlZ,EAAOoJ,IAAIzlC,EAAGu5C,EAAK/X,KAAKtpC,IAAIkI,MAAM/E,MAC9CQ,EAAQqjC,OACN5kC,EACAg7C,EAAmBC,EAAOr9C,EAAGoC,EAAGk7C,EAAgBC,GAEpD,CACA,OAAO55C,CACT,EAqlCA5H,EAAQ,GAnlCR,SAAuBqlC,EAAQya,EAAYvzC,OAAOwyC,SAEhD,IADA1Z,EAAS+C,EAAOiB,YAAYhE,IACjBzf,UAIT,OAAOyf,EAAOgN,YAEhB,IAAIkT,EAAc,IAAI5H,EAA2BtY,EAAQ,CAAEyY,eAAe,IAEtEQ,EAAIiH,EAAYzE,oBAChBvC,EAAIgH,EAAYtF,qBAChBvS,EAAI6X,EAAYnQ,SAEpB,IAAK,IAAI/uC,EAAI,EAAGA,EAAIqnC,EAAEpqC,OAAQ+C,IACxBc,KAAKgF,IAAIuhC,EAAErnC,IAAMy5C,EACnBpS,EAAErnC,GAAK,EAAMqnC,EAAErnC,GAEfqnC,EAAErnC,GAAK,EAIX,OAAOk4C,EAAEhR,KAAKnF,EAAOc,KAAKwE,GAAGH,KAAK+Q,EAAEjM,aACtC,EA6jCAryC,EAAQ,GAAQ48C,EAChB58C,EAAQ,GAhiER,SAAc0qB,EAAOnD,GACnB,GAAIG,EAAWA,WAAWgD,GACxB,OAAIA,EAAM,IAAMhD,EAAWA,WAAWgD,EAAM,IACnC,IAAIyxB,EAAgBzxB,GAEpB,IAAIuxB,EAAgBvxB,EAAOnD,GAGpC,MAAM,IAAI9H,MAAM,+BAEpB,C,GCz9GI+lC,EAA2B,CAAC,EAGhC,SAASC,EAAoBC,GAE5B,IAAIC,EAAeH,EAAyBE,GAC5C,QAAqBr9C,IAAjBs9C,EACH,OAAOA,EAAa3lD,QAGrB,IAAID,EAASylD,EAAyBE,GAAY,CACjD3hB,GAAI2hB,EACJE,QAAQ,EACR5lD,QAAS,CAAC,GAUX,OANA6lD,EAAoBH,GAAU3lD,EAAQA,EAAOC,QAASylD,GAGtD1lD,EAAO6lD,QAAS,EAGT7lD,EAAOC,OACf,CCxBAylD,EAAoB7vB,EAAK71B,IACxB,IAAI+lD,EAAS/lD,GAAUA,EAAOgmD,WAC7B,IAAOhmD,EAAiB,QACxB,IAAM,EAEP,OADA0lD,EAAoB/jC,EAAEokC,EAAQ,CAAE1U,EAAG0U,IAC5BA,CAAM,ECLdL,EAAoB/jC,EAAI,CAAC1hB,EAASgmD,KACjC,IAAI,IAAI3iC,KAAO2iC,EACXP,EAAoBQ,EAAED,EAAY3iC,KAASoiC,EAAoBQ,EAAEjmD,EAASqjB,IAC5E0D,OAAOuF,eAAetsB,EAASqjB,EAAK,CAAE6iC,YAAY,EAAMz9B,IAAKu9B,EAAW3iC,IAE1E,ECNDoiC,EAAoB9kD,EAAI,WACvB,GAA0B,iBAAfwlD,WAAyB,OAAOA,WAC3C,IACC,OAAOthD,MAAQ,IAAIktB,SAAS,cAAb,EAChB,CAAE,MAAOhxB,GACR,GAAsB,iBAAX2F,OAAqB,OAAOA,MACxC,CACA,CAPuB,GCAxB++C,EAAoBQ,EAAI,CAAC73C,EAAK5L,IAAUukB,OAAO5hB,UAAUkmB,eAAezD,KAAKxZ,EAAK5L,GCClFijD,EAAoBv5C,EAAKlM,IACH,oBAAXoqB,QAA0BA,OAAO2F,aAC1ChJ,OAAOuF,eAAetsB,EAASoqB,OAAO2F,YAAa,CAAElQ,MAAO,WAE7DkH,OAAOuF,eAAetsB,EAAS,aAAc,CAAE6f,OAAO,GAAO,ECL9D4lC,EAAoBW,IAAOrmD,IAC1BA,EAAO+0B,MAAQ,GACV/0B,EAAOqD,WAAUrD,EAAOqD,SAAW,IACjCrD,G,4BCuCD,SAASsmD,EAAO3Y,EAAG3sC,GACxB,IAAI+K,EAAI,CAAC,EACT,IAAK,IAAIqB,KAAKugC,EAAO3mB,OAAO5hB,UAAUkmB,eAAezD,KAAK8lB,EAAGvgC,IAAMpM,EAAEulD,QAAQn5C,GAAK,IAC9ErB,EAAEqB,GAAKugC,EAAEvgC,IACb,GAAS,MAALugC,GAAqD,mBAAjC3mB,OAAO6U,sBACtB,KAAIv1B,EAAI,EAAb,IAAgB8G,EAAI4Z,OAAO6U,sBAAsB8R,GAAIrnC,EAAI8G,EAAE7J,OAAQ+C,IAC3DtF,EAAEulD,QAAQn5C,EAAE9G,IAAM,GAAK0gB,OAAO5hB,UAAUu2B,qBAAqB9T,KAAK8lB,EAAGvgC,EAAE9G,MACvEyF,EAAEqB,EAAE9G,IAAMqnC,EAAEvgC,EAAE9G,IAF4B,CAItD,OAAOyF,CACT,CA8DO,SAASy6C,EAAU/7B,EAASg8B,EAAYC,EAAGC,GAEhD,OAAO,IAAKD,IAAMA,EAAIl9B,WAAU,SAAUiT,EAASmqB,GAC/C,SAASC,EAAU/mC,GAAS,IAAMsV,EAAKuxB,EAAUG,KAAKhnC,GAAS,CAAE,MAAO9e,GAAK4lD,EAAO5lD,EAAI,CAAE,CAC1F,SAAS+lD,EAASjnC,GAAS,IAAMsV,EAAKuxB,EAAiB,MAAE7mC,GAAS,CAAE,MAAO9e,GAAK4lD,EAAO5lD,EAAI,CAAE,CAC7F,SAASo0B,EAAKjkB,GAJlB,IAAe2O,EAIa3O,EAAO61C,KAAOvqB,EAAQtrB,EAAO2O,QAJ1CA,EAIyD3O,EAAO2O,MAJhDA,aAAiB4mC,EAAI5mC,EAAQ,IAAI4mC,GAAE,SAAUjqB,GAAWA,EAAQ3c,EAAQ,KAIjBmnC,KAAKJ,EAAWE,EAAW,CAC7G3xB,GAAMuxB,EAAYA,EAAUj8B,MAAMD,EAASg8B,GAAc,KAAKK,OAClE,GACF,C,kDA8B6B9/B,OAAOwH,OA0GXxH,OAAOwH,OAyDkB,mBAApB04B,iBAAiCA,gBCnN/D,QAtGkC,WAC9B,SAASC,IACLriD,KAAKsiD,QAAU,CAAC,CACpB,CAiGA,OA1FAD,EAAa/hD,UAAUiiD,GAAK,SAAUC,EAAK7d,EAAU8d,GAQjD,OAPKziD,KAAKsiD,QAAQE,KACdxiD,KAAKsiD,QAAQE,GAAO,IAExBxiD,KAAKsiD,QAAQE,GAAKzlD,KAAK,CACnB4nC,SAAUA,EACV8d,OAAQA,IAELziD,IACX,EAMAqiD,EAAa/hD,UAAUmiD,KAAO,SAAUD,EAAK7d,GACzC,OAAO3kC,KAAKuiD,GAAGC,EAAK7d,GAAU,EAClC,EAMA0d,EAAa/hD,UAAUoiD,KAAO,SAAUF,GAGpC,IAFA,IAAIG,EAAQ3iD,KACRihB,EAAO,GACF2hC,EAAK,EAAGA,EAAKzpC,UAAU1a,OAAQmkD,IACpC3hC,EAAK2hC,EAAK,GAAKzpC,UAAUypC,GAE7B,IAAIC,EAAS7iD,KAAKsiD,QAAQE,IAAQ,GAC9BM,EAAiB9iD,KAAKsiD,QA1CnB,MA0CwC,GAE3CS,EAAS,SAAUC,GAEnB,IADA,IAAIvkD,EAASukD,EAAGvkD,OACP+C,EAAI,EAAGA,EAAI/C,EAAQ+C,IACxB,GAAKwhD,EAAGxhD,GAAR,CAGA,IAAIyhD,EAAKD,EAAGxhD,GAAImjC,EAAWse,EAAGte,SAAiBse,EAAGR,OAE9CO,EAAGlqB,OAAOt3B,EAAG,GACK,IAAdwhD,EAAGvkD,eACIkkD,EAAML,QAAQE,GAEzB/jD,IACA+C,KAEJmjC,EAAS/e,MAAM+8B,EAAO1hC,EAVtB,CAYR,EACA8hC,EAAOF,GACPE,EAAOD,EACX,EAMAT,EAAa/hD,UAAU4iD,IAAM,SAAUV,EAAK7d,GACxC,GAAK6d,EAKD,GAAK7d,EAIA,CAID,IAFA,IAAIke,EAAS7iD,KAAKsiD,QAAQE,IAAQ,GAC9BW,EAAWN,EAAOpkD,OACb+C,EAAI,EAAGA,EAAI2hD,EAAU3hD,IACtBqhD,EAAOrhD,GAAGmjC,WAAaA,IACvBke,EAAO/pB,OAAOt3B,EAAG,GACjB2hD,IACA3hD,KAGc,IAAlBqhD,EAAOpkD,eACAuB,KAAKsiD,QAAQE,EAE5B,aAhBWxiD,KAAKsiD,QAAQE,QALxBxiD,KAAKsiD,QAAU,CAAC,EAuBpB,OAAOtiD,IACX,EAEAqiD,EAAa/hD,UAAU8iD,UAAY,WAC/B,OAAOpjD,KAAKsiD,OAChB,EACOD,CACX,CArGiC,GCF1B,SAASgB,EAAMC,EAAO/mD,EAASwe,EAAIwoC,GACtC,KAAOD,EAAM7kD,QAAQ,CACjB,MAAMD,EAAO8kD,EAAMvI,QAEnB,GADchgC,EAAGvc,GAEb,OAAO,EAEXjC,EAAQggB,IAAI/d,EAAK0gC,IACjBqkB,EAAU/kD,EAAK0gC,IAAI1iC,SAASu0B,IACnBx0B,EAAQK,IAAIm0B,EAAEmO,MACf3iC,EAAQggB,IAAIwU,EAAEmO,IACdokB,EAAMvmD,KAAKg0B,GACf,GAER,CACA,OAAO,CACX,CACO,SAASyyB,EAAMhlD,EAAMjC,EAASwe,EAAIwoC,GAErC,GADcxoC,EAAGvc,GAEb,OAAO,EAEXjC,EAAQggB,IAAI/d,EAAK0gC,IACjB,IAAK,MAAMnO,KAAKwyB,EAAU/kD,EAAK0gC,IAC3B,IAAK3iC,EAAQK,IAAIm0B,EAAEmO,KACXskB,EAAMzyB,EAAGx0B,EAASwe,EAAIwoC,GACtB,OAAO,EAInB,OAAO,CACX,CC9BA,MAAME,EAAgB,KAAM,EACrB,MAAMC,EACT1nD,MACA2nD,WACAC,WAEAC,aACAC,WAAa,IAAI3/B,IACjB4/B,YAAc,IAAI5/B,IAClB6/B,aAAe,IAAI7/B,IACnB8/B,YAAc,IAAI9/B,IAClB+/B,YAAc,IAAI//B,IAClB,WAAAzC,CAAYgB,GACR1iB,KAAKhE,MAAQ0mB,EAAQ1mB,MACrB,MAAM2nD,EAAajhC,EAAQihC,YAAcF,EACnCG,EAAalhC,EAAQkhC,YAAcH,EACzCzjD,KAAK2jD,WAAaA,EAClB3jD,KAAK4jD,WAAcznD,IACf,MAAM,OAAEsT,EAAM,OAAED,GAAWxP,KAAKhE,MAAMmoD,cAAchoD,EAAK+iC,IACzD,SAAKykB,EAAWl0C,KAAYk0C,EAAWn0C,KAGhCo0C,EAAWznD,EAAMsT,EAAQD,EAAO,EAErB,SAAlBkT,EAAQqP,OACR/xB,KAAK6jD,cAAe,EACpB7jD,KAAKokD,kBAEkB,WAAlB1hC,EAAQqP,MACb/xB,KAAK6jD,cAAe,EAGpB7jD,KAAK6jD,cAAe,CAE5B,CAKAQ,WAAa,KACTrkD,KAAK8jD,WAAWpgC,QAChB1jB,KAAK+jD,YAAYrgC,QACjB1jB,KAAKgkD,aAAatgC,QAClB1jB,KAAKikD,YAAYvgC,QACjB1jB,KAAKkkD,YAAYxgC,OAAO,EAK5B4gC,aAAe,KACXtkD,KAAKqkD,aACLrkD,KAAKukD,YAAYvkD,KAAKhE,MAAMwoD,cAAc9hD,KAAKlE,GAASA,EAAK0gC,KAAI,EAOrEqlB,YAAeE,IACX,MAAMC,EAAkB,IAAI//B,IAC5B8/B,EAAgBjoD,SAAS0iC,IAErB,MAAMylB,EAAc3kD,KAAKgkD,aAAapgC,IAAIsb,GAI1C,GAHIylB,GACAA,EAAYnoD,SAASL,GAASuoD,EAAgBnoC,IAAIpgB,EAAK+iC,MAEtDl/B,KAAK0M,QAAQwyB,GASb,CAGD,MAAMz7B,EAAUzD,KAAKhE,MAChB4oD,gBAAgB1lB,EAAI,MACpBr1B,OAAO7J,KAAK4jD,YACX/mD,EAAWmD,KAAKhE,MACjB4oD,gBAAgB1lB,EAAI,OACpBr1B,OAAO7J,KAAK4jD,YACXiB,EAAYv3C,MAAM8gC,KAAK,IAAIzpB,IAAI,IAAIlhB,KAAY5G,KACrDgoD,EAAUroD,SAASL,GAASuoD,EAAgBnoC,IAAIpgB,EAAK+iC,MAErDl/B,KAAK8jD,WAAWngC,IAAIub,EAAIz7B,GACxBzD,KAAK+jD,YAAYpgC,IAAIub,EAAIriC,GACzBmD,KAAKgkD,aAAargC,IAAIub,EAAI2lB,GAE1B7kD,KAAKikD,YAAYtgC,IAAIub,EAAIl/B,KAAKhE,MAAM8oD,QAAQ5lB,GAChD,MAvBIl/B,KAAK8jD,WAAWiB,OAAO7lB,GACvBl/B,KAAK+jD,YAAYgB,OAAO7lB,GACxBl/B,KAAKgkD,aAAae,OAAO7lB,GAEzBl/B,KAAKikD,YAAYc,OAAO7lB,EAmB5B,IAGJwlB,EAAgBloD,SAAS0iC,IACjBl/B,KAAKiZ,QAAQimB,GACbl/B,KAAKkkD,YAAYvgC,IAAIub,EAAIl/B,KAAKhE,MAAMgpD,QAAQ9lB,IAG5Cl/B,KAAKkkD,YAAYa,OAAO7lB,EAC5B,GACF,EAEN,cAAAklB,GACIpkD,KAAKskD,eACLtkD,KAAKhE,MAAMumD,GAAG,UAAWviD,KAAKilD,mBAClC,CACA,aAAAC,GACIllD,KAAKhE,MAAMknD,IAAI,UAAWljD,KAAKilD,mBACnC,CACAA,mBAAsBE,IAElB,MAAMV,EAAkB,IAAI9/B,IAC5BwgC,EAAMC,QAAQ5oD,SAAS6oD,IACnB,OAAQA,EAAOtrC,MACX,IAAK,YA4BL,IAAK,cACD0qC,EAAgBloC,IAAI8oC,EAAOrqC,MAAMkkB,IACjC,MA3BJ,IAAK,kBACDulB,EAAgBloC,IAAI8oC,EAAOnmB,IAC3B,MACJ,IAAK,YAkBL,IAAK,cACDulB,EAAgBloC,IAAI8oC,EAAOrqC,MAAMvL,QACjCg1C,EAAgBloC,IAAI8oC,EAAOrqC,MAAMxL,QACjC,MAjBJ,IAAK,cAC2B,WAAxB61C,EAAOC,cACiB,WAAxBD,EAAOC,eACPb,EAAgBloC,IAAI8oC,EAAOE,UAC3Bd,EAAgBloC,IAAI8oC,EAAOt2B,WAE/B,MACJ,IAAK,kBACD,GAAIo2B,EAAMnpD,MAAMid,QAAQosC,EAAOnmB,IAAK,CAChC,MAAM/iC,EAAOgpD,EAAMnpD,MAAMgpD,QAAQK,EAAOnmB,IACxCulB,EAAgBloC,IAAIpgB,EAAKsT,QACzBg1C,EAAgBloC,IAAIpgB,EAAKqT,OAC7B,EAWR,IAGJxP,KAAKukD,YAAYE,EAAgB,EAGrC,kBAAAe,CAAmBtmB,GACfl/B,KAAK8kD,QAAQ5lB,EACjB,CACA,OAAAxyB,CAAQwyB,GACJ,IAAKl/B,KAAKhE,MAAM0Q,QAAQwyB,GACpB,OAAO,EACX,MAAM1gC,EAAOwB,KAAKhE,MAAM8oD,QAAQ5lB,GAChC,OAAOl/B,KAAK2jD,WAAWnlD,EAC3B,CACA,YAAAinD,CAAaC,EAAaC,GAEtB,OADA3lD,KAAKwlD,mBAAmBE,GACjB1lD,KAAK4lD,aAAaD,GAAcE,MAAMC,GAAaA,EAAS5mB,KAAOwmB,GAC9E,CACA,OAAAZ,CAAQ5lB,GACJ,MAAM1gC,EAAOwB,KAAKhE,MAAM8oD,QAAQ5lB,GAChC,IAAKl/B,KAAK2jD,WAAWnlD,GACjB,MAAM,IAAIoc,MAAM,0BAA4BskB,GAEhD,OAAO1gC,CACX,CACA,eAAAomD,CAAgB1lB,EAAI6mB,GAEhB,OADA/lD,KAAKwlD,mBAAmBtmB,GACpBl/B,KAAK6jD,aACa,OAAdkC,EACO/lD,KAAK8jD,WAAWlgC,IAAIsb,GAER,QAAd6mB,EACE/lD,KAAK+jD,YAAYngC,IAAIsb,GAGrBl/B,KAAKgkD,aAAapgC,IAAIsb,GAGvBl/B,KAAKhE,MAAM4oD,gBAAgB1lB,EAAI6mB,GAChCl8C,OAAO7J,KAAK4jD,WAC7B,CACA,SAAAoC,CAAU9mB,EAAI6mB,GACV,OAAO/lD,KAAK4kD,gBAAgB1lB,EAAI6mB,GAAWtnD,MAC/C,CACA,aAAAwnD,CAAc/mB,GACV,MACMgnB,EADWlmD,KAAK4kD,gBAAgB1lB,EAAI,OACjBx8B,KAAKvG,GAAS6D,KAAK8kD,QAAQ3oD,EAAKqT,UACzD,OAAOlC,MAAM8gC,KAAK,IAAIzpB,IAAIuhC,GAC9B,CACA,eAAAC,CAAgBjnB,GACZ,MACMl8B,EADUhD,KAAK4kD,gBAAgB1lB,EAAI,MACjBx8B,KAAKvG,GAAS6D,KAAK8kD,QAAQ3oD,EAAKsT,UACxD,OAAOnC,MAAM8gC,KAAK,IAAIzpB,IAAI3hB,GAC9B,CACA,YAAA4iD,CAAa1mB,GACT,MAAM3uB,EAAevQ,KAAKmmD,gBAAgBjnB,GACpCpzB,EAAa9L,KAAKimD,cAAc/mB,GACtC,OAAO5xB,MAAM8gC,KAAK,IAAIzpB,IAAI,IAAIpU,KAAiBzE,IACnD,CAEA,OAAAmN,CAAQimB,GACJ,IAAKl/B,KAAKhE,MAAMid,QAAQimB,GACpB,OAAO,EACX,MAAM/iC,EAAO6D,KAAKhE,MAAMgpD,QAAQ9lB,GAChC,OAAOl/B,KAAK4jD,WAAWznD,EAC3B,CACA,OAAA6oD,CAAQ9lB,GACJ,MAAM/iC,EAAO6D,KAAKhE,MAAMgpD,QAAQ9lB,GAChC,IAAKl/B,KAAK4jD,WAAWznD,GACjB,MAAM,IAAIye,MAAM,0BAA4BskB,GAEhD,OAAO/iC,CACX,CACA,aAAAgoD,CAAcjlB,GACV,MAAM/iC,EAAO6D,KAAKglD,QAAQ9lB,GAC1B,MAAO,CACH/iC,OACAsT,OAAQzP,KAAK8kD,QAAQ3oD,EAAKsT,QAC1BD,OAAQxP,KAAK8kD,QAAQ3oD,EAAKqT,QAElC,CAEA,gBAAA42C,CAAiBC,GACb,OAAOrmD,KAAKhE,MAAMoqD,iBAAiBC,EACvC,CACA,QAAAC,CAASD,GACL,OAAOrmD,KAAKhE,MAAMsqD,SAASD,GAASx8C,OAAO7J,KAAK2jD,WACpD,CACA,WAAA4C,CAAYrnB,EAAImnB,GAEZ,OADArmD,KAAKwlD,mBAAmBtmB,GACjBl/B,KAAKhE,MAAMuqD,YAAYrnB,EAAImnB,GAASx8C,OAAO7J,KAAK2jD,WAC3D,CACA,SAAA6C,CAAUtnB,EAAImnB,GACVrmD,KAAKwlD,mBAAmBtmB,GACxB,MAAM95B,EAASpF,KAAKhE,MAAMwqD,UAAUtnB,EAAImnB,GACxC,OAAKjhD,GAAWpF,KAAK2jD,WAAWv+C,GAEzBA,EADI,IAEf,CAEA,WAAAo/C,GACI,OAAIxkD,KAAK6jD,aACEv2C,MAAM8gC,KAAKpuC,KAAKikD,YAAY75C,UAEhCpK,KAAKhE,MAAMwoD,cAAc36C,OAAO7J,KAAK2jD,WAChD,CACA,WAAA8C,GACI,OAAIzmD,KAAK6jD,aACEv2C,MAAM8gC,KAAKpuC,KAAKkkD,YAAY95C,UAEhCpK,KAAKhE,MAAMyqD,cAAc58C,OAAO7J,KAAK4jD,WAChD,CACA,GAAA8C,CAAIxnB,EAAInkB,EAAIgrC,EAAY,OACpB,MAAMxC,EAAY,CACdoD,GAAI3mD,KAAKmmD,gBAAgB5wC,KAAKvV,MAC9BmC,IAAKnC,KAAKimD,cAAc1wC,KAAKvV,MAC7B4mD,KAAM5mD,KAAK4lD,aAAarwC,KAAKvV,OAC/B+lD,GACF1C,EAAM,CAACrjD,KAAK8kD,QAAQ5lB,IAAM,IAAIva,IAAO5J,EAAIwoC,EAC7C,CACA,GAAA7mD,CAAIwiC,EAAInkB,EAAIgrC,EAAY,OACpB,MAAMxC,EAAY,CACdoD,GAAI3mD,KAAKmmD,gBAAgB5wC,KAAKvV,MAC9BmC,IAAKnC,KAAKimD,cAAc1wC,KAAKvV,MAC7B4mD,KAAM5mD,KAAK4lD,aAAarwC,KAAKvV,OAC/B+lD,GACFvC,EAAMxjD,KAAK8kD,QAAQ5lB,GAAK,IAAIva,IAAO5J,EAAIwoC,EAC3C,ECnRG,MAAMziD,UAAc,EACvB+lD,QAAU,IAAI1iC,IACd2iC,QAAU,IAAI3iC,IACd2/B,WAAa,IAAI3/B,IACjB4/B,YAAc,IAAI5/B,IAClB6/B,aAAe,IAAI7/B,IACnB4iC,YAAc,IAAI5iC,IAClBihC,QAAU,GACV4B,WAAa,EAMbC,UAAY,OA0BZ,WAAAvlC,CAAYgB,GACRkuB,QACKluB,IAEDA,EAAQjmB,OACRuD,KAAKknD,SAASxkC,EAAQjmB,OACtBimB,EAAQjlB,OACRuC,KAAKmnD,SAASzkC,EAAQjlB,OACtBilB,EAAQrV,MACRrN,KAAKonD,QAAQ1kC,EAAQrV,MACrBqV,EAAQukC,YACRjnD,KAAKinD,UAAYvkC,EAAQukC,WACjC,CAsBAI,MAAStsC,IACL/a,KAAKgnD,YAAc,EACnBjsC,IACA/a,KAAKgnD,YAAc,EACdhnD,KAAKgnD,YACNhnD,KAAKsnD,QACT,EAKJ,MAAAA,GACI,MAAMlC,EAAUplD,KAAKolD,QACrBplD,KAAKolD,QAAU,GACf,MAAMD,EAAQ,CACVnpD,MAAOgE,KACPolD,WAEJplD,KAAK0iD,KAAK,UAAWyC,GACrBnlD,KAAKinD,UAAU9B,EACnB,CA0BA,aAAAoC,CAAcnC,GACV,IAAIoC,EAAgB,GAwHpB,OAvHApC,EAAQ5oD,SAAS6oD,IACb,OAAQA,EAAOtrC,MACX,IAAK,cAAe,CAKhB,IAAI0tC,GAAe,EACnBD,EAAgBA,EAAc39C,QAAQ69C,IAClC,GAAwB,cAApBA,EAAW3tC,KAAsB,CACjC,MAAM4tC,EAASD,EAAW1sC,MAAMkkB,KAAOmmB,EAAOrqC,MAAMkkB,GAIpD,OAHIyoB,IACAF,GAAe,IAEXE,CACZ,CACK,MAAwB,oBAApBD,EAAW3tC,KACT2tC,EAAWxoB,KAAOmmB,EAAOrqC,MAAMkkB,GAEb,yBAApBwoB,EAAW3tC,MACT2tC,EAAWE,SAAWvC,EAAOrqC,MAAMkkB,EAEnC,IAEVuoB,GACDD,EAAczqD,KAAKsoD,GAEvB,KACJ,CACA,IAAK,cAAe,CAKhB,IAAIoC,GAAe,EACnBD,EAAgBA,EAAc39C,QAAQ69C,IAClC,GAAwB,cAApBA,EAAW3tC,KAAsB,CACjC,MAAM4tC,EAASD,EAAW1sC,MAAMkkB,KAAOmmB,EAAOrqC,MAAMkkB,GAIpD,OAHIyoB,IACAF,GAAe,IAEXE,CACZ,CACK,MAAwB,oBAApBD,EAAW3tC,MACI,gBAApB2tC,EAAW3tC,MACJ2tC,EAAWxoB,KAAOmmB,EAAOrqC,MAAMkkB,EAE/B,IAEVuoB,GACDD,EAAczqD,KAAKsoD,GAEvB,KACJ,CACA,IAAK,kBACL,IAAK,kBACL,IAAK,cAAe,CAIhB,MAAM73C,EAAQg6C,EAAcK,WAAWH,GAC3BA,EAAW3tC,OAASsrC,EAAOtrC,MAC/B2tC,EAAWxoB,KAAOmmB,EAAOnmB,UACA17B,IAAxB6hD,EAAOC,cACJoC,EAAWpC,eAAiBD,EAAOC,gBAEzCwC,EAAiBN,EAAch6C,GACjCs6C,OAC4BtkD,IAAxB6hD,EAAOC,aAEPwC,EAAe/4B,SAAWs2B,EAAOt2B,UAIjCy4B,EAAc1uB,OAAOtrB,EAAO,GAC5Bg6C,EAAczqD,KAAKsoD,IAIvBmC,EAAczqD,KAAKsoD,GAEvB,KACJ,CACA,IAAK,wBAIDmC,EAAgBA,EAAc39C,QAAQ69C,GACV,0BAApBA,EAAW3tC,KACJ2tC,EAAWrB,UAAYhB,EAAOgB,QAEZ,yBAApBqB,EAAW3tC,MACT2tC,EAAWrB,UAAYhB,EAAOgB,UAI7CmB,EAAczqD,KAAKsoD,GACnB,MAEJ,IAAK,uBAAwB,CACzB,MAAMyC,EAAiBN,EAAc19C,MAAM49C,GACX,yBAApBA,EAAW3tC,MACf2tC,EAAWrB,UAAYhB,EAAOgB,SAC9BqB,EAAWE,SAAWvC,EAAOuC,SAEjCE,EACAA,EAAeC,YACX1C,EAAO0C,YAGXP,EAAczqD,KAAKsoD,GAEvB,KACJ,CACA,QACImC,EAAczqD,KAAKsoD,GAE3B,IAEGmC,CACX,CAEA,kBAAAhC,CAAmBtmB,GACfl/B,KAAK8kD,QAAQ5lB,EACjB,CAKA,OAAAxyB,CAAQwyB,GACJ,OAAOl/B,KAAK6mD,QAAQjqD,IAAIsiC,EAC5B,CAKA,YAAAumB,CAAaC,EAAaC,GACtB,OAAO3lD,KAAK4lD,aAAaD,GAAcE,MAAMC,GAAaA,EAAS5mB,KAAOwmB,GAC9E,CAKA,OAAAZ,CAAQ5lB,GACJ,MAAM1gC,EAAOwB,KAAK6mD,QAAQjjC,IAAIsb,GAC9B,IAAK1gC,EACD,MAAM,IAAIoc,MAAM,0BAA4BskB,GAEhD,OAAO1gC,CACX,CAOA,eAAAomD,CAAgB1lB,EAAI6mB,GAEhB,GADA/lD,KAAKwlD,mBAAmBtmB,GACN,OAAd6mB,EAAoB,CACpB,MAAMtiD,EAAUzD,KAAK8jD,WAAWlgC,IAAIsb,GACpC,OAAO5xB,MAAM8gC,KAAK3qC,EACtB,CACK,GAAkB,QAAdsiD,EAAqB,CAC1B,MAAMlpD,EAAWmD,KAAK+jD,YAAYngC,IAAIsb,GACtC,OAAO5xB,MAAM8gC,KAAKvxC,EACtB,CACK,CACD,MAAMgoD,EAAY7kD,KAAKgkD,aAAapgC,IAAIsb,GACxC,OAAO5xB,MAAM8gC,KAAKyW,EACtB,CACJ,CAKA,SAAAmB,CAAU9mB,EAAI6mB,GACV,OAAO/lD,KAAK4kD,gBAAgB1lB,EAAI6mB,GAAWtnD,MAC/C,CAIA,aAAAwnD,CAAc/mB,GACV,MACMgnB,EADWlmD,KAAK4kD,gBAAgB1lB,EAAI,OACjBx8B,KAAKvG,GAAS6D,KAAK8kD,QAAQ3oD,EAAKqT,UACzD,OAAOlC,MAAM8gC,KAAK,IAAIzpB,IAAIuhC,GAC9B,CAIA,eAAAC,CAAgBjnB,GACZ,MACMl8B,EADUhD,KAAK4kD,gBAAgB1lB,EAAI,MACjBx8B,KAAKvG,GAAS6D,KAAK8kD,QAAQ3oD,EAAKsT,UACxD,OAAOnC,MAAM8gC,KAAK,IAAIzpB,IAAI3hB,GAC9B,CAMA,YAAA4iD,CAAa1mB,GACT,MAAM3uB,EAAevQ,KAAKmmD,gBAAgBjnB,GACpCpzB,EAAa9L,KAAKimD,cAAc/mB,GACtC,OAAO5xB,MAAM8gC,KAAK,IAAIzpB,IAAI,IAAIpU,KAAiBzE,IACnD,CACA,SAAAk8C,CAAUxpD,GACN,GAAIwB,KAAK0M,QAAQlO,EAAK0gC,IAClB,MAAM,IAAItkB,MAAM,wBAA0Bpc,EAAK0gC,IAEnDl/B,KAAK6mD,QAAQljC,IAAInlB,EAAK0gC,GAAI1gC,GAC1BwB,KAAK8jD,WAAWngC,IAAInlB,EAAK0gC,GAAI,IAAIva,KACjC3kB,KAAK+jD,YAAYpgC,IAAInlB,EAAK0gC,GAAI,IAAIva,KAClC3kB,KAAKgkD,aAAargC,IAAInlB,EAAK0gC,GAAI,IAAIva,KACnC3kB,KAAK+mD,YAAYvqD,SAAS6Q,IACtBA,EAAK46C,YAAYtkC,IAAInlB,EAAK0gC,GAAI,IAAIva,IAAM,IAE5C3kB,KAAKolD,QAAQroD,KAAK,CAAEgd,KAAM,YAAaiB,MAAOxc,GAClD,CAKA,QAAA0oD,CAASzqD,GACLuD,KAAKqnD,OAAM,KACP,IAAK,MAAM7oD,KAAQ/B,EACfuD,KAAKgoD,UAAUxpD,EACnB,GAER,CAKA,OAAA0pD,CAAQ1pD,GACJwB,KAAKknD,SAAS,CAAC1oD,GACnB,CACA,YAAA2pD,CAAajpB,GACT,MAAM1gC,EAAOwB,KAAK8kD,QAAQ5lB,GACpB2lB,EAAY7kD,KAAKgkD,aAAapgC,IAAIsb,GACxC2lB,GAAWroD,SAASL,GAAS6D,KAAKooD,aAAajsD,EAAK+iC,MACpDl/B,KAAK6mD,QAAQ9B,OAAO7lB,GACpBl/B,KAAK+mD,YAAYvqD,SAAS6Q,IACtBA,EAAK46C,YAAYrkC,IAAIsb,IAAK1iC,SAASmO,IAC/B0C,EAAKg7C,UAAUtD,OAAOp6C,EAAMu0B,GAAG,IAEnC7xB,EAAKg7C,UAAUtD,OAAO7lB,GACtB7xB,EAAK46C,YAAYlD,OAAO7lB,EAAG,IAE/Bl/B,KAAKolD,QAAQroD,KAAK,CAAEgd,KAAM,cAAeiB,MAAOxc,GACpD,CAKA,WAAA8pD,CAAYC,GACRvoD,KAAKqnD,OAAM,KACPkB,EAAO/rD,SAAS0iC,GAAOl/B,KAAKmoD,aAAajpB,IAAI,GAErD,CAKA,UAAAh8B,CAAWg8B,GACPl/B,KAAKsoD,YAAY,CAACppB,GACtB,CACA,sBAAAspB,CAAuBtpB,EAAIomB,EAActqC,GACrC,MAAMxc,EAAOwB,KAAK8kD,QAAQ5lB,GAC1Bl/B,KAAKqnD,OAAM,KACP,MAAM9B,EAAW/mD,EAAK8mB,KAAKggC,GACrBv2B,EAAW/T,EACjBxc,EAAK8mB,KAAKggC,GAAgBv2B,EAC1B/uB,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,kBACNmlB,KACAomB,eACAC,WACAx2B,YACF,GAEV,CAMA,aAAA05B,CAAcvpB,EAAIwpB,GACd1oD,KAAKqnD,OAAM,KACPnlC,OAAOnT,QAAQ25C,GAAOlsD,SAAQ,EAAE8oD,EAActqC,MAC1Chb,KAAKwoD,uBAAuBtpB,EAAIomB,EAActqC,EAAM,GACtD,GAEV,CACA,cAAA2tC,IAAkB1nC,GACd,MAAMie,EAAKje,EAAK,GACVziB,EAAOwB,KAAK8kD,QAAQ5lB,GAC1B,GAAuB,iBAAZje,EAAK,GAGZ,YADAjhB,KAAKwoD,uBAAuBtpB,EAAIje,EAAK,GAAIA,EAAK,IAGlD,IAAIqE,EACJ,GAAuB,mBAAZrE,EAAK,GAAmB,CAE/B,MAAM2nC,EAAS3nC,EAAK,GACpBqE,EAAOsjC,EAAOpqD,EAAK8mB,KACvB,KAC4B,iBAAZrE,EAAK,KAEjBqE,EAAOrE,EAAK,IAEhBjhB,KAAKqnD,OAAM,KACP,MAAM9B,EAAW/mD,EAAK8mB,KAChByJ,EAAWzJ,EACjB9mB,EAAK8mB,KAAOA,EACZtlB,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,kBACNmlB,KACAqmB,WACAx2B,YACF,GAEV,CAEA,kBAAA85B,CAAmB3pB,GACf,IAAKl/B,KAAKiZ,QAAQimB,GACd,MAAM,IAAItkB,MAAM,0BAA4BskB,EAEpD,CAKA,OAAAjmB,CAAQimB,GACJ,OAAOl/B,KAAK8mD,QAAQlqD,IAAIsiC,EAC5B,CAKA,OAAA8lB,CAAQ9lB,GAEJ,OADAl/B,KAAK6oD,mBAAmB3pB,GACjBl/B,KAAK8mD,QAAQljC,IAAIsb,EAC5B,CAKA,aAAAilB,CAAcjlB,GACV,MAAM/iC,EAAO6D,KAAKglD,QAAQ9lB,GAC1B,MAAO,CACH/iC,OACAsT,OAAQzP,KAAK8kD,QAAQ3oD,EAAKsT,QAC1BD,OAAQxP,KAAK8kD,QAAQ3oD,EAAKqT,QAElC,CACA,SAAAs5C,CAAU3sD,GACN,GAAI6D,KAAKiZ,QAAQ9c,EAAK+iC,IAClB,MAAM,IAAItkB,MAAM,wBAA0Bze,EAAK+iC,IAEnDl/B,KAAKwlD,mBAAmBrpD,EAAKsT,QAC7BzP,KAAKwlD,mBAAmBrpD,EAAKqT,QAC7BxP,KAAK8mD,QAAQnjC,IAAIxnB,EAAK+iC,GAAI/iC,GAC1B,MAAMsH,EAAUzD,KAAK8jD,WAAWlgC,IAAIznB,EAAKqT,QACnC3S,EAAWmD,KAAK+jD,YAAYngC,IAAIznB,EAAKsT,QACrCs5C,EAAoB/oD,KAAKgkD,aAAapgC,IAAIznB,EAAKsT,QAC/Cu5C,EAAoBhpD,KAAKgkD,aAAapgC,IAAIznB,EAAKqT,QACrD/L,EAAQ8Y,IAAIpgB,GACZU,EAAS0f,IAAIpgB,GACb4sD,EAAkBxsC,IAAIpgB,GACtB6sD,EAAkBzsC,IAAIpgB,GACtB6D,KAAKolD,QAAQroD,KAAK,CAAEgd,KAAM,YAAaiB,MAAO7e,GAClD,CAKA,QAAAgrD,CAAS1pD,GACLuC,KAAKqnD,OAAM,KACP,IAAK,MAAMlrD,KAAQsB,EACfuC,KAAK8oD,UAAU3sD,EACnB,GAER,CAaA,OAAA8sD,CAAQ9sD,GACJ6D,KAAKmnD,SAAS,CAAChrD,GACnB,CACA,YAAAisD,CAAalpB,GACT,MAAM/iC,EAAO6D,KAAKglD,QAAQ9lB,GACpBriC,EAAWmD,KAAK+jD,YAAYngC,IAAIznB,EAAKsT,QACrChM,EAAUzD,KAAK8jD,WAAWlgC,IAAIznB,EAAKqT,QACnCu5C,EAAoB/oD,KAAKgkD,aAAapgC,IAAIznB,EAAKsT,QAC/Cu5C,EAAoBhpD,KAAKgkD,aAAapgC,IAAIznB,EAAKqT,QACrD3S,EAASkoD,OAAO5oD,GAChBsH,EAAQshD,OAAO5oD,GACf4sD,EAAkBhE,OAAO5oD,GACzB6sD,EAAkBjE,OAAO5oD,GACzB6D,KAAK8mD,QAAQ/B,OAAO7lB,GACpBl/B,KAAKolD,QAAQroD,KAAK,CAAEgd,KAAM,cAAeiB,MAAO7e,GACpD,CAKA,WAAA+sD,CAAYX,GACRvoD,KAAKqnD,OAAM,KACPkB,EAAO/rD,SAAS0iC,GAAOl/B,KAAKooD,aAAalpB,IAAI,GAErD,CAKA,UAAAhiC,CAAWgiC,GACPl/B,KAAKkpD,YAAY,CAAChqB,GACtB,CAKA,gBAAAiqB,CAAiBjqB,EAAIzvB,GACjB,MAAMtT,EAAO6D,KAAKglD,QAAQ9lB,GAC1Bl/B,KAAKwlD,mBAAmB/1C,GACxB,MAAM25C,EAAYjtD,EAAKsT,OACjB45C,EAAY55C,EAClBzP,KAAK+jD,YAAYngC,IAAIwlC,GAAWrE,OAAO5oD,GACvC6D,KAAKgkD,aAAapgC,IAAIwlC,GAAWrE,OAAO5oD,GACxC6D,KAAK+jD,YAAYngC,IAAIylC,GAAW9sC,IAAIpgB,GACpC6D,KAAKgkD,aAAapgC,IAAIylC,GAAW9sC,IAAIpgB,GACrCA,EAAKsT,OAASA,EACdzP,KAAKqnD,OAAM,KACPrnD,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,cACNmlB,KACAomB,aAAc,SACdC,SAAU6D,EACVr6B,SAAUs6B,GACZ,GAEV,CAKA,gBAAAC,CAAiBpqB,EAAI1vB,GACjB,MAAMrT,EAAO6D,KAAKglD,QAAQ9lB,GAC1Bl/B,KAAKwlD,mBAAmBh2C,GACxB,MAAM+5C,EAAYptD,EAAKqT,OACjBg6C,EAAYh6C,EAClBxP,KAAK8jD,WAAWlgC,IAAI2lC,GAAWxE,OAAO5oD,GACtC6D,KAAKgkD,aAAapgC,IAAI2lC,GAAWxE,OAAO5oD,GACxC6D,KAAK8jD,WAAWlgC,IAAI4lC,GAAWjtC,IAAIpgB,GACnC6D,KAAKgkD,aAAapgC,IAAI4lC,GAAWjtC,IAAIpgB,GACrCA,EAAKqT,OAASA,EACdxP,KAAKqnD,OAAM,KACPrnD,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,cACNmlB,KACAomB,aAAc,SACdC,SAAUgE,EACVx6B,SAAUy6B,GACZ,GAEV,CACA,sBAAAC,CAAuBvqB,EAAIomB,EAActqC,GACrC,MAAM7e,EAAO6D,KAAKglD,QAAQ9lB,GAC1Bl/B,KAAKqnD,OAAM,KACP,MAAM9B,EAAWppD,EAAKmpB,KAAKggC,GACrBv2B,EAAW/T,EACjB7e,EAAKmpB,KAAKggC,GAAgBv2B,EAC1B/uB,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,kBACNmlB,KACAomB,eACAC,WACAx2B,YACF,GAEV,CACA,cAAA26B,IAAkBzoC,GACd,MAAMie,EAAKje,EAAK,GACV9kB,EAAO6D,KAAKglD,QAAQ9lB,GAC1B,GAAuB,iBAAZje,EAAK,GAGZ,YADAjhB,KAAKypD,uBAAuBvqB,EAAIje,EAAK,GAAIA,EAAK,IAGlD,IAAIqE,EACJ,GAAuB,mBAAZrE,EAAK,GAAmB,CAE/B,MAAM2nC,EAAS3nC,EAAK,GACpBqE,EAAOsjC,EAAOzsD,EAAKmpB,KACvB,KAC4B,iBAAZrE,EAAK,KAEjBqE,EAAOrE,EAAK,IAEhBjhB,KAAKqnD,OAAM,KACP,MAAM9B,EAAWppD,EAAKmpB,KAChByJ,EAAWzJ,EACjBnpB,EAAKmpB,KAAOA,EACZtlB,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,kBACNmlB,KACAqmB,WACAx2B,YACF,GAEV,CAIA,aAAA46B,CAAczqB,EAAIwpB,GACd1oD,KAAKqnD,OAAM,KACPnlC,OAAOnT,QAAQ25C,GAAOlsD,SAAQ,EAAE8oD,EAActqC,MAC1Chb,KAAKypD,uBAAuBvqB,EAAIomB,EAActqC,EAAM,GACtD,GAEV,CAEA,kBAAA4uC,CAAmBvD,GACf,IAAKrmD,KAAKomD,iBAAiBC,GACvB,MAAM,IAAIzrC,MAAM,yCAA2CyrC,EAEnE,CACA,gBAAAD,CAAiBC,GACb,OAAOrmD,KAAK+mD,YAAYnqD,IAAIypD,EAChC,CAiBA,mBAAAwD,CAAoBxD,GACZrmD,KAAK+mD,YAAYnqD,IAAIypD,KAIzBrmD,KAAK+mD,YAAYpjC,IAAI0iC,EAAS,CAC1BgC,UAAW,IAAIlkC,IACf8jC,YAAa,IAAI9jC,MAErBnkB,KAAKqnD,OAAM,KACPrnD,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,wBACNssC,WACF,IAEV,CAUA,mBAAAyD,CAAoBzD,GAChBrmD,KAAK4pD,mBAAmBvD,GACxBrmD,KAAK+mD,YAAYhC,OAAOsB,GACxBrmD,KAAKqnD,OAAM,KACPrnD,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,wBACNssC,WACF,GAEV,CAmBA,OAAAe,CAAQ/5C,EAAMg5C,GACVrmD,KAAKqnD,OAAM,KACPrnD,KAAK6pD,oBAAoBxD,GAEzB,MAAM5pD,EAAQ,GACRH,EAAQgR,MAAMoO,QAAQrO,GAAQA,EAAO,CAACA,GAC5C,KAAO/Q,EAAMmC,QAAQ,CACjB,MAAMD,EAAOlC,EAAMy+C,QACnBt+C,EAAMM,KAAKyB,GACPA,EAAKD,UACLjC,EAAMS,QAAQyB,EAAKD,SAE3B,CACAyB,KAAKknD,SAASzqD,GAEdA,EAAMD,SAAS4I,IACXA,EAAO7G,UAAU/B,SAASmO,IACtB3K,KAAK1B,UAAUqM,EAAMu0B,GAAI95B,EAAO85B,GAAImnB,EAAQ,GAC9C,GACJ,GAEV,CA0DA,QAAAC,CAASD,GAEL,OADArmD,KAAK4pD,mBAAmBvD,GACjBrmD,KAAKwkD,cAAc36C,QAAQrL,IAAUwB,KAAKwmD,UAAUhoD,EAAK0gC,GAAImnB,IACxE,CAKA,WAAAE,CAAYrnB,EAAImnB,GACZrmD,KAAKwlD,mBAAmBtmB,GACxBl/B,KAAK4pD,mBAAmBvD,GACxB,MACM9nD,EADOyB,KAAK+mD,YAAYnjC,IAAIyiC,GACZ4B,YAAYrkC,IAAIsb,GACtC,OAAO5xB,MAAM8gC,KAAK7vC,GAAY,GAClC,CAMA,SAAAioD,CAAUtnB,EAAImnB,GAIV,OAHArmD,KAAKwlD,mBAAmBtmB,GACxBl/B,KAAK4pD,mBAAmBvD,GACXrmD,KAAK+mD,YAAYnjC,IAAIyiC,GACtBgC,UAAUzkC,IAAIsb,IAAO,IACrC,CAIA,YAAA6qB,CAAa7qB,EAAImnB,GACb,MAAM2D,EAAY,GAClB,IACI5kD,EADA6kB,EAAUjqB,KAAK8kD,QAAQ5lB,GAG3B,KAAQ95B,EAASpF,KAAKwmD,UAAUv8B,EAAQiV,GAAImnB,IACxC2D,EAAUjtD,KAAKqI,GACf6kB,EAAU7kB,EAEd,OAAO4kD,CACX,CAQA,SAAA1rD,CAAU4gC,EAAI95B,EAAQihD,GAClBrmD,KAAK4pD,mBAAmBvD,GACxB,MAAMh5C,EAAOrN,KAAK+mD,YAAYnjC,IAAIyiC,GAC5B7nD,EAAOwB,KAAK8kD,QAAQ5lB,GACpB+qB,EAAY58C,EAAKg7C,UAAUzkC,IAAIsb,GAErC,GAAI+qB,GAAW/qB,KAAO95B,EAClB,OAEJ,QAAe5B,IAAX4B,EAKA,OAJI6kD,GACA58C,EAAK46C,YAAYrkC,IAAIqmC,EAAU/qB,KAAK6lB,OAAOvmD,QAE/C6O,EAAKg7C,UAAUtD,OAAO7lB,GAG1B,MAAMgrB,EAAYlqD,KAAK8kD,QAAQ1/C,GAE/BiI,EAAKg7C,UAAU1kC,IAAIub,EAAIgrB,GAEnBD,GACA58C,EAAK46C,YAAYrkC,IAAIqmC,EAAU/qB,KAAK6lB,OAAOvmD,GAE/C,IAAID,EAAW8O,EAAK46C,YAAYrkC,IAAIsmC,EAAUhrB,IACzC3gC,IACDA,EAAW,IAAIomB,IACftX,EAAK46C,YAAYtkC,IAAIumC,EAAUhrB,GAAI3gC,IAEvCA,EAASge,IAAI/d,GACbwB,KAAKqnD,OAAM,KACPrnD,KAAKolD,QAAQroD,KAAK,CACdgd,KAAM,uBACNssC,UACAuB,OAAQ1oB,EACRirB,YAAaF,GAAW/qB,GACxB6oB,YAAamC,EAAUhrB,IACzB,GAEV,CACA,OAAAkrB,CAAQlrB,EAAInkB,EAAIsrC,GAEZ,OAAO7C,EAAMxjD,KAAK8kD,QAAQ5lB,GAAK,IAAIva,IAAO5J,GADvB6sC,GAAW5nD,KAAKumD,YAAYqB,EAAQvB,IAE3D,CACA,OAAAgE,CAAQnrB,EAAInkB,EAAIsrC,GAEZ,OAAOhD,EAAM,CAACrjD,KAAK8kD,QAAQ5lB,IAAM,IAAIva,IAAO5J,GADzB6sC,GAAW5nD,KAAKumD,YAAYqB,EAAQvB,IAE3D,CAKA,WAAA7B,GACI,OAAOl3C,MAAM8gC,KAAKpuC,KAAK6mD,QAAQz8C,SACnC,CAIA,WAAAq8C,GACI,OAAOn5C,MAAM8gC,KAAKpuC,KAAK8mD,QAAQ18C,SACnC,CACA,GAAAs8C,CAAIxnB,EAAInkB,EAAIgrC,EAAY,OACpB,MAAMxC,EAAY,CACdoD,GAAI3mD,KAAKmmD,gBAAgB5wC,KAAKvV,MAC9BmC,IAAKnC,KAAKimD,cAAc1wC,KAAKvV,MAC7B4mD,KAAM5mD,KAAK4lD,aAAarwC,KAAKvV,OAC/B+lD,GACF,OAAO1C,EAAM,CAACrjD,KAAK8kD,QAAQ5lB,IAAM,IAAIva,IAAO5J,EAAIwoC,EACpD,CACA,GAAA7mD,CAAIwiC,EAAInkB,EAAIgrC,EAAY,OACpB,MAAMxC,EAAY,CACdoD,GAAI3mD,KAAKmmD,gBAAgB5wC,KAAKvV,MAC9BmC,IAAKnC,KAAKimD,cAAc1wC,KAAKvV,MAC7B4mD,KAAM5mD,KAAK4lD,aAAarwC,KAAKvV,OAC/B+lD,GACF,OAAOvC,EAAMxjD,KAAK8kD,QAAQ5lB,GAAK,IAAIva,IAAO5J,EAAIwoC,EAClD,CACA,KAAA5gC,GAEI,MAAM2nC,EAAWtqD,KAAKwkD,cAAc9hD,KAAK6nD,IAC9B,IAAKA,EAASjlC,KAAM,IAAKilC,EAAQjlC,UAEtCklC,EAAWxqD,KAAKymD,cAAc/jD,KAAK+nD,IAC9B,IAAKA,EAASnlC,KAAM,IAAKmlC,EAAQnlC,UAGtColC,EAAW,IAAI5pD,EAAM,CACvBrE,MAAO6tD,EACP7sD,MAAO+sD,IAiBX,OAdAxqD,KAAK+mD,YAAYvqD,SAAQ,EAAG6rD,UAAWsC,EAAc1C,YAAa2C,GAAkBvE,KAChF,MAAMgC,EAAY,IAAIlkC,IACtBwmC,EAAanuD,SAAQ,CAAC4I,EAAQoZ,KAC1B6pC,EAAU1kC,IAAInF,EAAKksC,EAAS5F,QAAQ1/C,EAAO85B,IAAI,IAEnD,MAAM+oB,EAAc,IAAI9jC,IACxBymC,EAAepuD,SAAQ,CAAC+B,EAAUigB,KAC9BypC,EAAYtkC,IAAInF,EAAK,IAAImG,IAAIrX,MAAM8gC,KAAK7vC,GAAUmE,KAAKquB,GAAM25B,EAAS5F,QAAQ/zB,EAAEmO,OAAM,IAE1FwrB,EAAS3D,YAAYpjC,IAAI0iC,EAAS,CAC9BgC,UAAWA,EACXJ,YAAaA,GACf,IAECyC,CACX,CACA,MAAA7lB,GACI,OAAOlkC,KAAKC,UAAU,CAClBnE,MAAOuD,KAAKwkD,cACZ/mD,MAAOuC,KAAKymD,eAGpB,CACA,UAAAoE,CAAWnoC,GACP,OAAO,IAAIghC,EAAU,CACjB1nD,MAAOgE,QACJ0iB,GAEX,ECj9BJ,IAAI,EAAW,CAAC,EAAEjiB,SAElB,QADa,SAAUua,EAAOjB,GAAQ,OAAO,EAASgJ,KAAK/H,KAAW,WAAajB,EAAO,GAAK,ECO/F,EAHe,SAAUiB,GACrB,OAAO,EAAOA,EAAO,SACzB,ECPM5a,EAAiB,CAACC,EAAW1D,KACjC,GAAU,SAAN0D,GAAsB,SAANA,EAClB,OAAO1D,C,EASLuD,EAAaC,IACjBA,EAAMhC,KAAM6jD,KAAO7hD,EAAM6hD,KACzB7hD,EAAM6hD,KAAM7jD,KAAOgC,EAAMhC,YAClBgC,EAAM6hD,YACN7hD,EAAMhC,IAAI,EAGJ,MAAM,EAInB,WAAAujB,GACE,MAAMopC,EAA4B,CAAC,EACnCA,EAAS3sD,KAAO2sD,EAChBA,EAAS9I,KAAO8I,EAAS3sD,KACzB6B,KAAK8qD,SAAWA,CAClB,CAEO,OAAAvqD,GACL,MAAMuqD,EAAW9qD,KAAK8qD,SAChB3qD,EAAQ2qD,EAAS3sD,KACvB,GAAIgC,GAASA,IAAU2qD,EAErB,OADA5qD,EAAOC,GACAA,CAEX,CAEO,OAAAK,CAAQL,GACb,MAAM2qD,EAAW9qD,KAAK8qD,SAClB3qD,EAAMhC,MAAQgC,EAAM6hD,MACtB9hD,EAAOC,GAETA,EAAM6hD,KAAO8I,EAAS9I,KACtB8I,EAAS9I,KAAM7jD,KAAOgC,EACtB2qD,EAAS9I,KAAO7hD,EAChBA,EAAMhC,KAAO2sD,CACf,CAEO,QAAArqD,GACL,MAAMC,EAAO,GACPb,EAAWG,KAAK8qD,SACtB,IAAI1sD,EAAOyB,EAAS1B,KACpB,KAAOC,IAASyB,GACda,EAAK3D,KAAK4D,KAAKC,UAAUxC,EAAMgC,IAC/BhC,EAAOA,aAAI,EAAJA,EAAMD,KAEf,MAAO,IAAIuC,EAAKG,KAAK,QACvB,ECpCF,MAAMjB,UAAa,GAEnB,MAAMkD,EAAoB,IAAM,EA8C1BI,EAAa,CACjBpH,EACA0G,EACAG,EACAxC,EACAoD,K,QAEA,MAAMR,EAAuB,GAoC7B,OAlCIjH,EAAE4Q,QAAQvM,EAAMxD,KACc,QAAhC,EAAAb,EAAE8oD,gBAAgBzkD,EAAMxD,EAAG,aAAK,SAAEH,SAASL,IACzC,MAAMC,EAASD,EAAKmpB,KAAKlpB,OACnBsH,EAAS5H,EAAEgpD,QAAQ3oD,EAAKsT,QAE1BlM,GAEFR,EAAQhG,KAAK,CAAEJ,EAAGR,EAAKsT,OAAQ3S,EAAGX,EAAKqT,OAAQm3C,GAAI,EAAGxkD,IAAK,SAErCqB,IAApBE,EAAO4hB,KAAKnjB,MAAmBuB,EAAO4hB,KAAKnjB,IAAM,GAErDuB,EAAO4hB,KAAKnjB,KAAO/F,EACnBwG,EAAaJ,EAASG,EAAS,eAC7BhG,EAAG+G,EAAOw7B,IACPx7B,EAAO4hB,MACG,IAGgB,QAAjC,EAAAxpB,EAAE8oD,gBAAgBzkD,EAAMxD,EAAG,cAAM,SAAEH,SAASL,IAC1C,MAAMC,EAASD,EAAKmpB,KAAKlpB,OACnBU,EAAIX,EAAKqT,OACT7L,EAAS7H,EAAEgpD,QAAQhoD,QACF0G,IAAnBG,EAAO2hB,KAAKqhC,KAAkBhjD,EAAO2hB,KAAKqhC,GAAK,GAEnDhjD,EAAO2hB,KAAKqhC,IAAMvqD,EAClBwG,EAAaJ,EAASG,EAAS,eAC7BhG,EAAGgH,EAAOu7B,IACPv7B,EAAO2hB,MACG,IAGjBxpB,EAAEoH,WAAW/C,EAAMxD,IAGd4G,EAAsBR,OAAUS,CAAS,EA4D5CZ,EAAe,CAACJ,EAAiBG,EAAiBxC,KACjDA,EAAMgC,IAEChC,EAAU,GAGpBqC,EAAQrC,EAAMgC,IAAMhC,EAAU,GAAIwC,GAASnC,QAAQL,GAFnDqC,EAAQA,EAAQ/D,OAAS,GAAG+B,QAAQL,GAFpCqC,EAAQ,GAAGhC,QAAQL,E,EC3KjBtE,EAAM,CAACC,EAAUG,KACrB,MAGMF,EAAoB,WAAdE,EDkBW,EACvBH,EACAO,K,MAEA,GAAIP,EAAE0oD,cAAc/lD,QAAU,EAAG,MAAO,GACxC,MAAMsD,EAqFW,EAACjG,EAAWO,KAC7B,MAAM2F,EAAW,IAAIlB,EACrB,IAAImB,EAAQ,EACRC,EAAS,EAEbpG,EAAE0oD,cAAchoD,SAASG,IACvBqF,EAASkmD,QAAQ,CACfhpB,GAAIviC,EAAEuiC,GACN5Z,KAAM,CAAE3oB,EAAGA,EAAEuiC,GAAIynB,GAAI,EAAGxkD,IAAK,IAC7B,IAKJrG,EAAE2qD,cAAcjqD,SAASN,IACvB,MAAMC,EAAO6F,EACV4iD,gBAAgB1oD,EAAEuT,OAAQ,OAC1B3F,MAAM3N,GAASA,EAAKqT,SAAWtT,EAAEsT,SAC9BpT,GAASC,aAAQ,EAARA,EAAWH,KAAM,EAC3BC,EAUH6F,EAAS0nD,eAAevtD,aAAI,EAAJA,EAAM+iC,GAAK,OAAF,wBAC5B/iC,EAAKmpB,MAAI,CACZlpB,OAAQD,EAAKmpB,KAAKlpB,OAAUA,KAX9B4F,EAASinD,QAAQ,CACf/pB,GAAIhjC,EAAEgjC,GACNzvB,OAAQvT,EAAEuT,OACVD,OAAQtT,EAAEsT,OACV8V,KAAM,CACJlpB,YAUN8F,EAASI,KAAKC,IAAIL,EAASF,EAAS8iD,QAAQ5oD,EAAEuT,QAAS6V,KAAKnjB,KAAO/F,GAEnE6F,EAAQK,KAAKC,IAAIN,EAAQD,EAAS8iD,QAAQ5oD,EAAEsT,QAAS8V,KAAKqhC,IAAMvqD,EAAQ,IAG1E,MAAMoG,EAAkB,GAClBuoD,EAAW7oD,EAASD,EAAQ,EAClC,IAAK,IAAIT,EAAI,EAAGA,EAAIupD,EAAUvpD,IAC5BgB,EAAQzF,KAAK,IAAI6C,GAEnB,MAAM+C,EAAUV,EAAQ,EASxB,OAPAD,EAASwiD,cAAchoD,SAASG,IAC9BiG,EAAaJ,EAASG,EAAS,eAC7BhG,EAAGA,EAAEuiC,IACFl9B,EAAS8iD,QAAQnoD,EAAEuiC,IAAI5Z,MACb,IAGV,CAAE9iB,UAASG,UAAS3G,MAAOgG,EAAU,EA3I9Ba,CAAW/G,ECzBhB,CAACI,GAAsBA,EAAEopB,KAAKlpB,QAAU,IDyBT0G,GAGxC,OAGG,QAHI,EAOW,EAAChH,EAAW0G,EAAiBG,KAC/C,IAAII,EAAuB,GAC3B,MAAMC,EAAUR,EAAQA,EAAQ/D,OAAS,GACnCwE,EAAQT,EAAQ,GAEtB,IAAIrC,EACJ,KAAOrE,EAAE0oD,cAAc/lD,QAAQ,CAC7B,KAAQ0B,EAAQ8C,EAAM1C,WACpB2C,EAAWpH,EAAG0G,EAASG,EAASxC,GAElC,KAAQA,EAAQ6C,EAAQzC,WACtB2C,EAAWpH,EAAG0G,EAASG,EAASxC,GAElC,GAAIrE,EAAE0oD,cAAc/lD,OAClB,IAAK,IAAI+C,EAAIgB,EAAQ/D,OAAS,EAAG+C,EAAI,IAAKA,EAExC,GADArB,EAAQqC,EAAQhB,GAAGjB,UACfJ,EAAO,CACT4C,EAAUA,EAAQI,OAChBD,EAAWpH,EAAG0G,EAASG,EAASxC,GAAO,IAEzC,K,EAMR,OAAO4C,CAAO,EAnCEK,CAAYrB,EAAM/F,MAAO+F,EAAMS,QAAST,EAAMY,SAG3DD,KAAKxG,GACJJ,EAAE8oD,gBAAgB1oD,EAAES,EAAG,OAAOkN,QAAO,EAAG2F,YAAaA,IAAWtT,EAAEY,aACnE,eACCkuD,MAAM,EC9B2BpvD,CAAUE,GAAkBkB,EAAOlB,GACxEC,SAAAA,EAAKS,SAASN,IACZ,MAAMe,EAAQf,EAAEopB,KAChBxpB,EAAEoB,WAAWhB,EAAEgjC,IACfjiC,EAAME,YAAcjB,EAAEopB,KAAKloB,KAC3BH,EAAMI,UAAW,EACjBvB,EAAEmtD,QAAQ,CACR/pB,GAAIhjC,EAAEgjC,GACNzvB,OAAQvT,EAAEsT,OACVA,OAAQtT,EAAEuT,OACV6V,KAAM,OAAF,UACCroB,IAEL,GACF,EAGED,EAAUlB,IACd,MAAMC,EAAwB,GACxBO,EAA6B,CAAC,EAC9BC,EAA+B,CAAC,EAEhCG,EAAOC,IACPJ,EAAQI,KAGZJ,EAAQI,IAAK,EACbL,EAAMK,IAAK,EACXb,EAAE8oD,gBAAgBjoD,EAAG,OAAOH,SAASN,IAC/BI,EAAMJ,EAAEsT,QACVzT,EAAIgB,KAAKb,GAETQ,EAAIR,EAAEsT,O,WAGHlT,EAAMK,GAAE,EAIjB,OADAb,EAAE0oD,cAAchoD,SAASu0B,GAAMr0B,EAAIq0B,EAAEmO,MAC9BnjC,CAAG,ECpCCsC,EAAe,CAC1BvC,EACAie,EACAuL,EACAloB,KAEA,IAAIT,EACJ,GACEA,EAAI,GAAGS,IAAOkF,KAAK0hC,iBACZloC,EAAE4Q,QAAQ/P,IAQnB,OANA2oB,EAAKhf,MAAQyT,EACbje,EAAEosD,QAAQ,CACRhpB,GAAIviC,EACJ2oB,SAGK3oB,CAAC,EAqCGqJ,EAAsBlK,IACjC,MAAMke,EAAa,IAAIlZ,EAYvB,OAVAhF,EAAE0oD,cAAchoD,SAASgC,IAClB1C,EAAEyqD,YAAY/nD,EAAK0gC,IAAIzgC,QAC1Bub,EAAWkuC,QAAQ,OAAD,UAAM1pD,G,IAI5B1C,EAAE2qD,cAAcjqD,SAASL,IACvB6d,EAAWivC,QAAQ9sD,EAAK,IAGnB6d,CAAU,EA4CNnR,EAAgB,CAC3B2R,EACAC,KAEA,MAAMrb,EAAIsI,OAAO8S,EAAKpb,GAChBF,EAAIwI,OAAO8S,EAAKtb,GAIhB4H,EAAKY,OAAO+S,EAAMrb,GAAKA,EACvB2H,EAAKW,OAAO+S,EAAMvb,GAAKA,EAC7B,IAQIwb,EACAC,EATA7d,EAAI4K,OAAO8S,EAAKxc,OAAS,EACzBkD,EAAIwG,OAAO8S,EAAKvc,QAAU,EAE9B,OAAK6I,GAAOC,GAQRzE,KAAKgF,IAAIP,GAAMjK,EAAIwF,KAAKgF,IAAIR,GAAM5F,GAEhC6F,EAAK,IACP7F,GAAKA,GAEPwZ,EAAMxZ,EAAI4F,EAAMC,EAChB4T,EAAKzZ,IAGD4F,EAAK,IACPhK,GAAKA,GAEP4d,EAAK5d,EACL6d,EAAM7d,EAAIiK,EAAMD,GAGX,CAAE1H,EAAGA,EAAIsb,EAAIxb,EAAGA,EAAIyb,IAtBlB,CAAEvb,EAAG,EAAGF,EAAG,EAsBW,EAOpB,EAAoBpD,IAC/B,MAAMmvD,EAAwB,GACxBC,EAAUrsD,EAAQ/C,GAAK,EAC7B,IAAK,IAAI0F,EAAI,EAAGA,EAAI0pD,EAAS1pD,IAC3BypD,EAAcluD,KAAK,IAIrBjB,EAAE0oD,cAAchoD,SAASgC,IACvB,MAAMT,EAAOS,EAAK8mB,KAAKvnB,UACVyF,IAATzF,GAAsBktD,EAAcltD,IACtCktD,EAAcltD,GAAMhB,KAAKyB,EAAK0gC,G,IAIlC,IAAK,IAAI19B,EAAI,EAAGA,EAAI0pD,EAAS1pD,IAC3BypD,EAAczpD,GAAKypD,EAAczpD,GAAGuO,MAAK,CAACo7C,EAAQC,KAChDC,OApLYC,EAoLHxvD,EAAEgpD,QAAQqG,GAAI7lC,KAAKlhB,MApLCmnD,EAoLOzvD,EAAEgpD,QAAQsG,GAAI9lC,KAAKlhB,MAnLpDsD,OAAO4jD,GAAU5jD,OAAO6jD,GADhB,IAACD,EAAiBC,CAoLiC,IAIlE,OAAON,CAAa,EA0DTvtD,EAAgB,CAC3B5B,EACA8B,EACAG,EACAqG,KAEA,MAAM5F,EAAiB,CACrBR,MAAO,EACPC,OAAQ,GAMV,OAJI,EAASF,IAAS,EAASqG,KAC7B5F,EAAKT,KAAOA,EACZS,EAAK4F,MAAQA,GAER/F,EAAavC,EAAG,SAAU0C,EAAMZ,EAAO,EAGnCiB,EAAW/C,IACtB,IAAI+C,EAaJ,OAZA/C,EAAE0oD,cAAchoD,SAASG,IACvB,MAAMoB,EAAOpB,EAAE2oB,KAAKvnB,UACPyF,IAATzF,SACcyF,IAAZ3E,GAAyBd,EAAOc,KAClCA,EAAUd,E,IAKXc,IACHA,EAAU,GAELA,CAAO,EAuBHoL,EAAQ,CAAU4b,EAAYH,IAClCG,EAAMnkB,QAAO,CAAC6qC,EAAGrlC,IACTwe,EAAK6mB,GACL7mB,EAAKxe,GACGA,EAAIqlC,IAIvB,EAAQ,CACZvwC,EACAwC,EACA8S,EACA/U,EACAgnD,EACAl3C,KAEK9P,EAAQ0mB,SAASzkB,EAAK0gC,MACzB3iC,EAAQQ,KAAKyB,EAAK0gC,IACb5tB,GACHjF,EAAOtP,KAAKyB,EAAK0gC,IAEnBqkB,EAAU/kD,EAAK0gC,IAAI1iC,SAASu0B,GAC1B,EAAM/0B,EAAO+0B,EAAGzf,EAAW/U,EAASgnD,EAAWl3C,KAE7CiF,GACFjF,EAAOtP,KAAKyB,EAAK0gC,I,EASVxiC,EAAM,CACjBV,EACAwC,EACA4F,EACAuX,KAEA,MAAMlf,EAAQ6Q,MAAMoO,QAAQld,GAAQA,EAAO,CAACA,GACtC+kD,EAAaxyB,GAChBpV,EAAa3f,EAAMiqD,cAAcl1B,GAAK/0B,EAAM4pD,aAAa70B,GACtDhuB,EAAgB,GAChBxG,EAAgB,GAStB,OARAE,EAAMD,SAASgC,IACb,IAAKxC,EAAM0Q,QAAQlO,EAAK0gC,IACtB,MAAM,IAAItkB,MAAM,6BAA6Bpc,KAE7C,EAAMxC,EAAOwC,EAAgB,SAAV4F,EAAkB7H,EAASgnD,EAAWxgD,E,IAItDA,CAAO,ECpUV,EAAgB,CACpBjH,EACA6B,EACAC,EACAC,EACAC,EACAC,KAEA,MAAMd,EAAkB,CAAEc,OAAMG,WAAYP,EAAMK,MAAO,EAAGC,OAAQ,GAE9DE,EAAOL,EAAOwnB,KAAK3nB,GAAMI,EAAO,GAChCK,EAAOC,EAAavC,EAAG,SAAUmB,EAAOW,GAE9CE,EAAOwnB,KAAK3nB,GAAMI,GAAQK,EAC1BtC,EAAEwC,UAAUF,EAAMP,GACdM,GACFrC,EAAEmtD,QAAQ,CACR/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQtR,EACRqR,OAAQpR,EACRknB,KAAM,CAAElpB,OAAQ,I,EC1BhB0C,EAAmBhD,IACvBA,EAAE0oD,cAAchoD,SAASG,IACvBoC,EAAmBpC,EAAE,IAEvBb,EAAE2qD,cAAcjqD,SAASN,IACvB6C,EAAmB7C,EAAE,GACrB,EAGE6C,EAAsBP,IAC1B,MAAM1B,EAAI0B,EAAK8mB,KAAKtnB,MACpBQ,EAAK8mB,KAAKtnB,MAAQQ,EAAK8mB,KAAKrnB,OAC5BO,EAAK8mB,KAAKrnB,OAASnB,CAAC,EAgBhBmC,EAAeT,KACfA,aAAI,EAAJA,EAAMU,KACRV,EAAKU,GAAKV,EAAKU,E,EAiBbC,EAAaX,IACjB,MAAMY,EAAIZ,EAAKY,EACfZ,EAAKY,EAAIZ,EAAKU,EACdV,EAAKU,EAAIE,CAAC,ECNN,EAAM,CACVtD,EACAwO,EACAC,EACAnO,EACA6B,EACAuM,EACA7N,KAEA,MAAM4B,EAAWzC,EAAEyqD,YAAY5pD,GAC/B,KAAK4B,aAAQ,EAARA,EAAUE,QAUb,YATI9B,IAAM2N,GAERxO,EAAEmtD,QAAQ,CACR/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQnF,EACRkF,OAAQ7S,EACR2oB,KAAM,CAAElpB,OAAQ,EAAGsJ,OAAQ6E,MAMjC,MAAME,EAAM/M,EAAc5B,EAAG,OACvB4O,EAAShN,EAAc5B,EAAG,OAC1BmB,EAAQnB,EAAEgpD,QAAQnoD,GAExBb,EAAEwC,UAAUmM,EAAK9N,GACjBM,EAAMqoB,KAAKnf,UAAYsE,EACvB3O,EAAEwC,UAAUoM,EAAQ/N,GACpBM,EAAMqoB,KAAKlf,aAAesE,EAE1BnM,SAAAA,EAAU/B,SAASoO,IACjB,EAAI9O,EAAGwO,EAAMC,EAASnO,EAAQ6B,EAAQuM,EAAQI,EAAUs0B,IAExD,MAAMr0B,EAAWD,EAAU0a,KAAKnf,UAC3ByE,EAAU0a,KAAKnf,UAChByE,EAAUs0B,GACRp0B,EAAcF,EAAU0a,KAAKlf,aAC9BwE,EAAU0a,KAAKlf,aAChBwE,EAAUs0B,GACRn0B,EAAaH,EAAU0a,KAAKnf,UAAY/J,EAAS,EAAIA,EACrDsJ,EAASmF,IAAaC,EAAc,EAAI7M,EAASuM,EAAO7N,GAAK,EAEnEb,EAAEmtD,QAAQ,CACR/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQhF,EACR+E,OAAQ3E,EACRya,KAAM,CACJ5f,SACAtJ,OAAQ2O,EACRC,aAAa,KAIjBlP,EAAEmtD,QAAQ,CACR/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQ3E,EACR0E,OAAQ9E,EACR4a,KAAM,CACJ5f,SACAtJ,OAAQ2O,EACRC,aAAa,IAEf,IAGClP,EAAE0qD,UAAU7pD,IACfb,EAAEmtD,QAAQ,CACR/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQnF,EACRkF,OAAQ/E,EACR6a,KAAM,CACJlpB,OAAQ,EACRsJ,OAAQzH,EAASuM,EAAO7N,K,ECvH1B6uD,EAAwB,aCrB9B,IAAI7oC,EAAQ,SAAUpZ,GAClB,GAAmB,iBAARA,GAA4B,OAARA,EAC3B,OAAOA,EAEX,IAAIkiD,ECJkBzwC,EDKtB,GCLsBA,EDKVzR,ECJL+D,MAAMoO,QAAUpO,MAAMoO,QAAQV,GAAS,EAAOA,EAAO,SDI1C,CACdywC,EAAM,GACN,IAAK,IAAIjqD,EAAI,EAAG2F,EAAIoC,EAAI9K,OAAQ+C,EAAI2F,EAAG3F,IACb,iBAAX+H,EAAI/H,IAA6B,MAAV+H,EAAI/H,GAClCiqD,EAAIjqD,GAAKmhB,EAAMpZ,EAAI/H,IAGnBiqD,EAAIjqD,GAAK+H,EAAI/H,EAGzB,MAGI,IAAK,IAAInB,KADTorD,EAAM,CAAC,EACOliD,EACY,iBAAXA,EAAIlJ,IAA6B,MAAVkJ,EAAIlJ,GAClCorD,EAAIprD,GAAKsiB,EAAMpZ,EAAIlJ,IAGnBorD,EAAIprD,GAAKkJ,EAAIlJ,GAIzB,OAAOorD,CACX,EACA,UETM5+C,EAAqB,CAAC/Q,EAAUgR,EAAkBC,KAItD,MAAMC,GPwD2BuR,EOvD/BxR,EPuD2C3C,EOtD3C2C,EAAWrK,KAAI,CAAC/F,EAAG6E,IAAMA,IPuDpB+c,aAAI,EAAJA,EAAM7c,QAAO,CAAC6H,EAAKiV,EAAKhd,KAC7B+H,EAAIiV,GAAOpU,EAAO5I,GACX+H,IACN,CAAC,IOxDEmiD,EAAS5+C,EAAWpK,KAAK/F,IAC7B,MAAMgvD,EAAS7vD,EAAE8oD,gBAAgBjoD,EAAG,OAAO+F,KAAKxG,IACvC,CAAEgR,IAAKF,EAAS9Q,EAAEsT,SAAW,EAAGpT,OAAQF,EAAEopB,KAAKlpB,WAExD,OAAOuvD,aAAM,EAANA,EAAQ57C,MAAK,CAACw8B,EAAGrlC,IAAMqlC,EAAEr/B,IAAMhG,EAAEgG,KAAI,IAExCD,EAAey+C,EAAOV,OAAOnhD,QAAQ1J,QAAoBqD,IAAVrD,IP8C9B,IAAUoe,EAAYnU,EO3C7C,IAAI+C,EAAa,EACjB,KAAOA,EAAaJ,EAAWtO,QAAQ0O,IAAe,EACtD,MAAMC,EAAW,EAAID,EAAa,EAClCA,GAAc,EACd,MAAME,EAAOC,MAAMF,GAAU02B,KAAK,EAAG,EAAG12B,GAGxC,IAAIG,EAAK,EAiBT,OAhBAN,SAAAA,EAAczQ,SAAS2D,IACrB,GAAIA,EAAO,CACT,IAAIqN,EAAQrN,EAAM+M,IAAMC,EACxBE,EAAKG,IAAUrN,EAAM/D,OACrB,IAAIqR,EAAY,EAChB,KAAOD,EAAQ,GACTA,EAAQ,IACVC,GAAaJ,EAAKG,EAAQ,IAE5BA,EAASA,EAAQ,GAAM,EACvBH,EAAKG,IAAUrN,EAAM/D,OAEvBmR,GAAMpN,EAAM/D,OAAUqR,C,KAInBF,CAAE,EAGEK,EAAa,CAAC9R,EAAU4R,KACnC,IAAIH,EAAK,EACT,IAAK,IAAI/L,EAAI,EAAGA,GAAIkM,aAAQ,EAARA,EAAUjP,QAAQ+C,GAAK,EACzC+L,GAAMV,EAAmB/Q,EAAG4R,EAASlM,EAAI,GAAIkM,EAASlM,IAExD,OAAO+L,CAAE,ECxDEI,EAAa7R,IACxB,MAAMS,EAAmC,CAAC,EAIpCsS,EAAc/S,EAAE0oD,cAChBoH,EAAY/8C,EAAYnM,KAAK/F,IAAK,MAAC,OAAY,QAAZ,EAAAA,EAAE2oB,KAAKvnB,YAAK,SAAI,GAAS,IAE5Dc,EAAUyD,KAAKC,OAAOqpD,GACtBnlD,EAAiB,GACvB,IAAK,IAAIjF,EAAI,EAAGA,EAAI3C,EAAU,EAAG2C,IAC/BiF,EAAO1J,KAAK,IAGd,MAAM+R,EAAYD,EAAYkB,MAC5B,CAACw8B,EAAGrlC,IAAMpL,EAAEgpD,QAAQvY,EAAErN,IAAI5Z,KAAKvnB,KAAQjC,EAAEgpD,QAAQ59C,EAAEg4B,IAAI5Z,KAAKvnB,OAQxD8tD,EAHa/8C,EAAUjF,QAAQknB,QACMvtB,IAAlC1H,EAAEgpD,QAAQ/zB,EAAEmO,IAAI5Z,KAAKwmC,WAEG/7C,MAC/B,CAACw8B,EAAGrlC,IAAMpL,EAAEgpD,QAAQvY,EAAErN,IAAI5Z,KAAKwmC,SAAYhwD,EAAEgpD,QAAQ59C,EAAEg4B,IAAI5Z,KAAKwmC,WAmBlE,OAjBAD,SAAAA,EAAervD,SAASu0B,IACjBupB,MAAMx+C,EAAEgpD,QAAQ/zB,EAAEmO,IAAI5Z,KAAKvnB,OAC9B0I,EAAO3K,EAAEgpD,QAAQ/zB,EAAEmO,IAAI5Z,KAAKvnB,MAAOhB,KAAKg0B,EAAEmO,IAE5C3iC,EAAQw0B,EAAEmO,KAAM,CAAI,IAGtBpwB,SAAAA,EAAWtS,SAASu0B,GAClBj1B,EAAEsuD,QAAQr5B,EAAEmO,IAAK1gC,IACf,GAAIjC,EAAQiqB,eAAehoB,EAAK0gC,IAAK,OAAO,EAC5C3iC,EAAQiC,EAAK0gC,KAAM,EACdob,MAAM97C,EAAK8mB,KAAKvnB,OACnB0I,EAAOjI,EAAK8mB,KAAKvnB,MAAOhB,KAAKyB,EAAK0gC,G,MAKjCz4B,CAAM,EC0ETslD,EAAe,CAACv8C,EAAuBC,K,MAC3C,IAAIlD,EAAM,EACNnQ,EAAS,EAEToT,EAAOpT,SACTmQ,GAAOiD,EAAOhD,WAAcgD,EAAOpT,OACnCA,GAAUoT,EAAOpT,QAGfqT,EAAOrT,SACTmQ,GAAOkD,EAAOjD,WAAciD,EAAOrT,OACnCA,GAAUqT,EAAOrT,QAGnBoT,EAAOxD,GAAc,QAAT,EAAAyD,EAAOzD,UAAE,eAAE7I,OAAOqM,EAAOxD,IACrCwD,EAAOhD,WAAaD,EAAMnQ,EAC1BoT,EAAOpT,OAASA,EAChBoT,EAAOhO,EAAIc,KAAK+F,IAAIoH,EAAOjO,EAAGgO,EAAOhO,GACrCiO,EAAOC,QAAS,CAAI,EAGtB,EA9GyB,CACvBX,EAKAhD,K,UAEA,MAAMiD,EAA+C,CAAC,EACtDD,SAAAA,EAASvS,SAAQ,CAAC2D,EAAOqB,KACvBwN,EAAc7O,EAAMxD,GAAK,CACvB6E,IACA0N,SAAU,EACVy3C,GAAI,GACJxkD,IAAK,GACL6J,GAAI,CAAC7L,EAAMxD,IAEb,MAAMsS,EAAMD,EAAc7O,EAAMxD,QACP6G,IAArBrD,EAAMqM,aACRyC,EAAIzC,WAAarM,EAAMqM,WACvByC,EAAI7S,OAAS+D,EAAM/D,O,IAIP,QAAhB,EAAA2P,EAAG06C,qBAAa,SAAEjqD,SAASN,IACzB,MAAMiT,EAASH,EAAc9S,EAAEuT,QACzBL,EAASJ,EAAc9S,EAAEsT,aAChBhM,IAAX2L,QAAmC3L,IAAX4L,IAC1BA,EAAOF,WACPC,EAAOhN,IAAKpF,KAAKiS,EAAc9S,EAAEsT,S,IAQrC,MAGyB,CAACH,I,QAC1B,MAAMN,EAAU,GAwBhB,KAAOM,aAAS,EAATA,EAAW5Q,QAAQ,CACxB,MAAM0B,EAAQkP,EAAUO,MACxBb,EAAQhS,KAAKoD,GACS,QAAtB,EAAAA,EAAU,GAAG4I,iBAAS,SAAEvM,SAASN,IAAqBoT,OAzBtCC,EAyB+CpP,EAxBvDuD,IACFA,EAAOgM,cAEalM,IAAtBE,EAAO8I,iBACehJ,IAAtB+L,EAAO/C,YACP9I,EAAO8I,YAAc+C,EAAO/C,aAE5Bu/C,EAAax8C,EAAQ7L,E,GAiB6CxH,GAzBvD,IAACqT,CAyBwD,IAC/D,QAAT,EAAApP,EAAMgC,WAAG,SAAE3F,SAASN,IAAqByT,OAbxBJ,EAakCpP,EAZ3CwD,IACNA,EAAW,GAAG5G,KAAKwS,GACQ,KAArB5L,EAAOuL,UACXG,EAAUtS,KAAK4G,E,GASuCzH,GAb1C,IAACqT,CAa2C,G,CAG9D,MAAMy8C,EAAWj9C,EAAQlF,QAAQ1J,IAAWA,EAAMuP,SAC5C6O,EAAiD,CACrD,KACA,IACA,aACA,UAEF,OAAOytC,EAAStpD,KAAKvC,IACnB,MAAM8rD,EAA8B,CAAC,EAKrC,OAJA1tC,SAAAA,EAAM/hB,SAASgiB,SACMhb,IAAfrD,EAAMqe,KACVytC,EAAOztC,GAAOre,EAAMqe,GAAI,IAEnBytC,CAAuB,GAC9B,EAjDKp8C,CAJ8C,QAAnC,KAAAqS,OAAO9X,OAAO4E,IAAenF,cAAM,uBAClD1J,IAA0BA,EAAM+O,WAGC,EC/BhCwB,EAAoB,CACxB1E,EACA2E,EACAnD,KAEA,IACIpG,EADA8kD,EAAS1+C,EAEb,KACEmD,EAAWlS,SACV2I,EAAOuJ,EAAWA,EAAWlS,OAAS,IAAI+C,GAAK0qD,GAEhDv7C,EAAWf,MACX5D,SAAAA,EAAIjP,KAAKqK,EAAK4E,IACdkgD,IAEF,OAAOA,CAAM,ECzDFr+C,EAAe,CAC1B/R,EACAa,EACAoP,EACAqC,EACA+9C,EACAC,K,YAEA,IAAIjgD,EAAUrQ,EAAEyqD,YAAY5pD,GAAG+F,KAAKquB,GAAMA,EAAEmO,KAE5C,MAAM1gC,EAAO1C,EAAEgpD,QAAQnoD,GACjBqT,EAAKxR,EAAQA,EAAK8mB,KAAK5mB,gBAAoB8E,EAC3CyM,EAAKzR,EAAQA,EAAK8mB,KAAK3mB,iBAAqB6E,EAC5C0M,EAAoD,CAAC,EAEvDF,IACF7D,EAAUA,aAAO,EAAPA,EAAStC,QAAQ/M,GAClBA,IAAMkT,GAAMlT,IAAMmT,KAI7B,MAAME,ECrBkB,EAACrU,EAAUqQ,IAC5BA,EAAQzJ,KAAK/F,IAClB,MAAMyP,EAAMtQ,EAAE8oD,gBAAgBjoD,EAAG,MACjC,KAAKyP,aAAG,EAAHA,EAAK3N,QACR,MAAO,CAAE9B,KAGX,MAAM0P,EAAS,CAAEE,IAAK,EAAGnQ,OAAQ,GAMjC,OALAgQ,SAAAA,EAAK5P,SAASN,IACZ,MAAMoQ,EAAQxQ,EAAEgpD,QAAQ5oD,EAAEuT,QAC1BpD,EAAOE,KAAOrQ,EAAEopB,KAAKlpB,OAAUkQ,EAAMgZ,KAAKlhB,MAC1CiI,EAAOjQ,QAAUF,EAAEopB,KAAKlpB,MAAO,IAE1B,CACLO,IACA6P,WAAYH,EAAOE,IAAMF,EAAOjQ,OAChCA,OAAQiQ,EAAOjQ,OAChB,IDIiBoQ,CAAW1Q,EAAGqQ,GAAW,IAC7CgE,SAAAA,EAAa3T,SAAS2D,I,MACpB,GAA0B,QAAtB,EAAArE,EAAEyqD,YAAYpmD,EAAMxD,UAAE,eAAE8B,OAAQ,CAClC,MAAM2R,EAAiBvC,EACrB/R,EACAqE,EAAMxD,EACNoP,EACAqC,EACAg+C,GAEFl8C,EAAU/P,EAAMxD,GAAKyT,EACjBA,EAAeoW,eAAe,eAChC6lC,EAAiBlsD,EAAOiQ,E,KAK9B,MAAMrB,EAAU,EAAiBoB,EAAapE,GAC9CuE,EAAgBvB,EAASmB,GAKQ,QADjC,EAAAnB,EACGlF,QAAQ3N,GAAMA,EAAE8P,GAAGvN,OAAS,WAAE,SAC7BjC,SAASN,IACT,MAAMsC,EAAO1C,EAAEgpD,QAAQ5oD,EAAE8P,GAAG,IACxBxN,IACFtC,EAAE4vD,SAAWttD,EAAK8mB,KAAKwmC,SACvB5vD,EAAEkI,MAAQ5F,EAAK8mB,KAAKlhB,M,IAI1B,MAAMiI,EDvDY,EAClB0C,EACAX,EACA+9C,EACAC,KAEA,MAAMv7C,EVmRiB,EACvBiK,EACAC,KAEA,MAAM1O,EAAS,CAAE2E,IAAK,GAAWC,IAAK,IAQtC,OAPA6J,SAAAA,EAAYte,SAASwe,IUxRY,CAAC7a,IAChC,MAAMmsD,EACJnsD,EAAMqmB,eAAe,cAAgB8zB,MAAMn6C,EAAM2rD,UACnD,OAAIM,GACME,GAAensD,EAAMqmB,eAAe,cAGvC8lC,GAAensD,EAAMqmB,eAAe,aAAa,EVkRpDzL,CAAGC,GACL3O,EAAO2E,IAAIjU,KAAKie,GAEhB3O,EAAO4E,IAAIlU,KAAKie,E,IAGb3O,CAAM,EU/RCyE,CAAU/B,GASlBgC,EAAWF,EAAMG,IACjBL,EAAaE,EAAMI,IAAIlB,MAAK,CAACw8B,EAAGrlC,KAAOqlC,EAAE/qC,IAAK0F,EAAE1F,IAChDwK,EAAa,GACnB,IAAIO,EAAM,EACNnQ,EAAS,EACT8U,EAAU,EAEdH,SAAAA,EAAUhB,KA2CY,EAACa,EAAeu7C,IAC/B,CAACh9C,EAAuBC,KAE7B,QAAwB5L,IAApB2L,EAAO28C,eAA8CtoD,IAApB4L,EAAO08C,SAC1C,OAAO38C,EAAO28C,SAAW18C,EAAO08C,SAElC,GAAI38C,EAAO3C,WAAc4C,EAAO5C,WAC9B,OAAQ,EAEV,GAAI2C,EAAO3C,WAAc4C,EAAO5C,WAC9B,OAAO,EAGT,GAAI2/C,QAA4B3oD,IAAjB2L,EAAO/K,YAAwCZ,IAAjB4L,EAAOhL,MAAqB,CACvE,GAAI+K,EAAO/K,MAAQgL,EAAOhL,MACxB,OAAQ,EAEV,GAAI+K,EAAO/K,MAAQgL,EAAOhL,MACxB,OAAO,C,CAIX,OAAQwM,EAA6BxB,EAAO5N,EAAI2N,EAAO3N,EAAxC2N,EAAO3N,EAAI4N,EAAO5N,CAAuB,EAjE3C+qD,GAAkBn+C,IAAa+9C,IAE9Cj7C,EAAUR,EAAkB1E,EAAI2E,EAAYO,GAE5CH,SAAAA,EAAUvU,SAAS2D,I,MACjB+Q,GAAmB,QAAR,EAAA/Q,EAAM6L,UAAE,eAAEvN,OACrBuN,EAAGjP,KAAKoD,EAAM6L,IACdO,GAAOpM,EAAMqM,WAAcrM,EAAM/D,OACjCA,GAAU+D,EAAM/D,OAChB8U,EAAUR,EAAkB1E,EAAI2E,EAAYO,EAAQ,IAGtD,MAAM7E,EAA6D,CACjEL,GAAIA,EAAGg/C,QAMT,OAJI5uD,IACFiQ,EAAOG,WAAaD,EAAMnQ,EAC1BiQ,EAAOjQ,OAASA,GAEXiQ,CAAM,ECcE0D,CAAKhB,EAASX,EAAW+9C,EAASC,GAEjD,GAAIp8C,IACF3D,EAAOL,GAAK,CAACgE,EAAI3D,EAAOL,GAAIiE,GAAI+6C,OACP,QAArB,EAAAlvD,EAAEqqD,gBAAgBn2C,UAAG,eAAEvR,QAAQ,CACjC,MAAM+R,EAAS1U,EAAEgpD,SAA6B,QAArB,EAAAhpD,EAAEqqD,gBAAgBn2C,UAAG,eAAG,GAAGkvB,KAAM,IACpDzuB,EAAS3U,EAAEgpD,SAA8B,QAAtB,EAAAhpD,EAAEqqD,gBAAgBl2C,UAAI,eAAG,GAAGivB,KAAM,IACtD7yB,EAAOma,eAAe,gBACzBna,EAAOG,WAAa,EACpBH,EAAOjQ,OAAS,GAElBiQ,EAAOG,YACJH,EAAOG,WAAcH,EAAOjQ,OAC3BoU,EAAO8U,KAAKlhB,MACZqM,EAAO6U,KAAKlhB,QACbiI,EAAOjQ,OAAU,GACpBiQ,EAAOjQ,QAAW,C,CAItB,OAAOiQ,CAAM,EAGTiE,EAAkB,CACtBvB,EACAmB,KAEAnB,SAAAA,EAASvS,SAAS2D,I,MAChB,MAAMqsD,EAAc,QAAR,EAAArsD,EAAM6L,UAAE,eAAEtJ,KAAK/F,GACrBuT,EAAUvT,GACLuT,EAAUvT,GAAGqP,GAEfrP,IAETwD,EAAM6L,GAAKwgD,EAAIxB,MAAM,GACrB,EAGEqB,EAAmB,CACvB78C,EACAa,UAE0B7M,IAAtBgM,EAAOhD,YACTgD,EAAOhD,YACJgD,EAAOhD,WAAagD,EAAOpT,OAAUiU,EAAM7D,WAAc6D,EAAMjU,SAC/DoT,EAAOpT,OAAUiU,EAAMjU,QAC1BoT,EAAOpT,QAAWiU,EAAMjU,SAExBoT,EAAOhD,WAAa6D,EAAM7D,WAC1BgD,EAAOpT,OAASiU,EAAMjU,O,EE9BpB4R,EAAmB,CACvBlS,EACAmS,EACA83C,IAEO93C,EAAMvL,KAAK3E,GClDW,EAC7BjC,EACAiC,EACAgoD,KAEA,MAAMz7C,EAwEe,CAACxO,IACtB,IAAIa,EACJ,KAAOb,EAAE4Q,QAAS/P,EAAI,QAAQ2F,KAAK0hC,cACnC,OAAOrnC,CAAC,EA3EKgQ,CAAe7Q,GACtBuQ,EAAS,IAAIvL,EAA0B,CAC3CuM,KAAM,CACJ,CACE6xB,GAAI50B,EACJ/L,SAAU,GACV+mB,KAAM,CAAC,MA+Db,OA1DAxpB,EAAE0oD,cAAchoD,SAASG,IACvB,MAAMyI,EAAStJ,EAAE0qD,UAAU7pD,EAAEuiC,KAG3BviC,EAAE2oB,KAAKvnB,OAASA,GACfpB,EAAE2oB,KAAK1mB,SAAYb,GAAQA,GAAQpB,EAAE2oB,KAAKzmB,WAEtCwN,EAAOK,QAAQ/P,EAAEuiC,KACpB7yB,EAAO67C,QAAQ,OAAD,UAAMvrD,KAGlByI,aAAM,EAANA,EAAQ85B,MAAO7yB,EAAOK,QAAQtH,aAAM,EAANA,EAAQ85B,KACxC7yB,EAAO67C,QAAQ,OAAD,UAAM9iD,IAGtBiH,EAAO/N,UAAU3B,EAAEuiC,IAAI95B,aAAM,EAANA,EAAQ85B,KAAM50B,GAGrCxO,EAAE8oD,gBAAgBjoD,EAAEuiC,GAAI6mB,GAAWvpD,SAASN,IAC1C,MAAMyF,EAAIzF,EAAEuT,SAAW9S,EAAEuiC,GAAKhjC,EAAEsT,OAAStT,EAAEuT,OACtCpD,EAAOK,QAAQ/K,IAClB0K,EAAO67C,QAAQ,OAAD,UAAMpsD,EAAEgpD,QAAQnjD,KAGhC,MAAMxF,EAAOkQ,EACVu4C,gBAAgBjjD,EAAG,OACnBmI,MAAK,EAAG0F,YAAaA,IAAW7S,EAAEuiC,KAC/B9iC,OAAkBoH,IAATrH,EAAqBA,EAAKmpB,KAAKlpB,OAAU,EAEnDD,EAUHkQ,EAAOq9C,eAAevtD,EAAK+iC,GAAI,OAAF,wBACxB/iC,EAAKmpB,MAAI,CACZlpB,OAAQF,EAAEopB,KAAKlpB,OAAUA,KAX3BiQ,EAAO48C,QAAQ,CACb/pB,GAAIhjC,EAAEgjC,GACNzvB,OAAQ9N,EACR6N,OAAQ7S,EAAEuiC,GACV5Z,KAAM,CACJlpB,OAAQF,EAAEopB,KAAKlpB,OAAUA,I,IAa7BO,EAAE2oB,KAAKkB,eAAe,YACxBna,EAAOs8C,eAAehsD,EAAEuiC,GAAI,OAAF,wBACrBviC,EAAE2oB,MAAI,CACT5mB,WAAa/B,EAAE2oB,KAAK5mB,WAAoBX,GACxCY,YAAchC,EAAE2oB,KAAK3mB,YAAqBZ,M,IAM3CsO,CAAM,EDvBJyB,CAAgBhS,EAAGiC,EAAMgoD,KAI9B73C,EAAmB,CACvBC,EACAC,EACA+9C,EACAC,KAEA,MAAMrgD,EAAK,IAAIjL,EACfqN,SAAAA,EAAa3R,SAAS6R,I,MAEpB,MAAM/D,EAAO+D,EAAGi4C,WAAW,GAAGpnB,GACxB5wB,EAAST,EACbQ,EACA/D,EACAyB,EACAqC,EACA+9C,EACAC,GAEF,IAAK,IAAI5qD,EAAI,EAAGA,GAAa,QAAT,EAAA8M,EAAOtC,UAAE,eAAEvN,QAAa+C,IAAK,CAC/C,MAAMirD,EAAQp+C,EAAGy2C,QAAQx2C,EAAOtC,GAAGxK,IAC/BirD,IACFA,EAAMnnC,KAAKlhB,MAAQ5C,E,CE1GW,EAAC1F,EAAUiQ,EAAWC,KAC1D,MAAM7N,EAAuB,CAAC,EAC9B,IAAI8N,EAEJD,SAAAA,EAAIxP,SAASG,IACX,IACIyI,EACA8G,EAFAvB,EAAQ7O,EAAE0qD,UAAU7pD,GAGxB,KAAOgO,GAAO,CASZ,GARAvF,EAAStJ,EAAE0qD,UAAU77C,EAAMu0B,IACvB95B,GACF8G,EAAY/N,EAAKiH,EAAO85B,IACxB/gC,EAAKiH,EAAO85B,IAAMv0B,EAAMu0B,KAExBhzB,EAAYD,EACZA,EAAWtB,EAAMu0B,IAEfhzB,GAAaA,IAAcvB,EAAMu0B,GAqBnC,OApBKnzB,EAAGW,QAAQR,IACdH,EAAGm8C,QAAQ,CACThpB,GAAIhzB,EACJoZ,KAAM,CAAC,IAGNvZ,EAAGW,QAAQ/B,EAAMu0B,KACpBnzB,EAAGm8C,QAAQ,CACThpB,GAAIv0B,EAAMu0B,GACV5Z,KAAM,CAAC,SAGNvZ,EAAGkN,QAAQ,IAAI/M,KAAavB,EAAMu0B,OACrCnzB,EAAGk9C,QAAQ,CACT/pB,GAAI,IAAIhzB,KAAavB,EAAMu0B,KAC3BzvB,OAAQvD,EACRsD,OAAQ7E,EAAMu0B,GACd5Z,KAAM,CAAC,KAKb3a,EAAQvF,C,IAEV,EFmEA2I,CAAuBM,EAAItC,EAAIuC,EAAOtC,GAAG,GACzC,EAGEuC,EAAc,CAACzS,EAAW4R,KAC9BA,SAAAA,EAAUlR,SAAS+E,IACjBA,SAAAA,EAAO/E,SAAQ,CAACG,EAAO6E,KACrB1F,EAAEgpD,QAAQnoD,GAAG2oB,KAAKlhB,MAAQ5C,CAAC,GAC3B,GACF,EGgCS+Q,EAA4B,CAACzW,EAAWa,K,QACnD,GAAgB,QAAZ,EAAAb,EAAEgpD,QAAQnoD,UAAE,eAAE2oB,KAAKhf,MACrB,OAA2B,QAApB,EAAAxK,EAAEqqD,gBAAgBxpD,UAAE,eAAEmN,MAAMnI,GAAM7F,EAAEgpD,QAAQnjD,EAAEu9B,IAAI5Z,KAAKhf,O,EAIrDuM,EAAc,CAACZ,EAAsBtV,EAAOG,KACvD,IAAI4vD,EAAK/vD,EACLgwD,EAAK7vD,EACT,GAAI4vD,EAAKC,EAAI,CACX,MAAM19C,EAAMy9C,EACZA,EAAKC,EACLA,EAAK19C,C,CAGP,IAAIwE,EAAaxB,EAAUy6C,GACtBj5C,IACHxB,EAAUy6C,GAAMj5C,EAAa,CAAC,GAEhCA,EAAWk5C,IAAM,CAAI,EAGVj5C,GAAc,CAACzB,EAAsBtV,EAAOG,KACvD,IAAI4vD,EAAK/vD,EACLgwD,EAAK7vD,EAMT,OALI4vD,EADK5vD,IAGP4vD,EAHO5vD,EAIP6vD,EAFYhwD,KAILsV,EAAUy6C,EAAG,EA+IXx3C,GAAkB,CAC7BpZ,EACA4R,EACApD,EACAhB,EACAD,EACAgL,KAEA,MAAMG,EAAa,IAAI1T,EACjB2T,EAAQK,GAAIxL,EAASD,EAASgL,GAsCpC,OApCA3G,SAAAA,EAAUlR,SAAS+E,IACjB,IAAII,EACJJ,SAAAA,EAAO/E,SAASG,IACd,MAAMoY,EAAQzK,EAAK3N,GAOnB,GANK6X,EAAW9H,QAAQqI,IACtBP,EAAW0zC,QAAQ,CACjBhpB,GAAInqB,EACJuQ,KAAM,CAAC,IAGP3jB,EAAG,CACL,MAAMqT,EAAQ1K,EAAK3I,GAEbxF,EAAOqY,EACVowC,gBAAgB5vC,EAAO,OACvBlL,MAAM3N,GAASA,EAAKqT,SAAWuF,IAC7B5Y,EAUHqY,EAAWk1C,eAAevtD,EAAK+iC,GAAI,OAAF,wBAC5B/iC,EAAKmpB,MAAI,CACZlpB,OAAQkG,KAAKC,IAAIkS,EAAM3Y,EAAGa,EAAGgF,GAAIxF,EAAKmpB,KAAKlpB,QAAW,MAXxDoY,EAAWy0C,QAAQ,CACjB/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQuF,EACRxF,OAAQuF,EACRuQ,KAAM,CACJlpB,OAAQkG,KAAKC,IAAIkS,EAAM3Y,EAAGa,EAAGgF,GAAI,K,CAUzCA,EAAIhF,CAAC,GACL,IAGG6X,CAAU,EA+DZ,MA4EMM,GAAM,CAACvK,EAAiBmK,EAAiBL,IAC7C,CAACvY,EAAWa,EAAOG,KACxB,MAAM8X,EAAS9Y,EAAEgpD,QAAQnoD,GACnBkY,EAAS/Y,EAAEgpD,QAAQhoD,GACzB,IAAIyP,EAAM,EACNoI,EAAgB,EAGpB,GADApI,GAAOqI,EAAO0Q,KAAKtnB,MAAS,EACxB4W,EAAO0Q,KAAKkB,eAAe,YAC7B,QAAU5R,EAAO0Q,KAAK3f,UAAuB,IAAInG,eAC/C,IAAK,IACHmV,GAASC,EAAO0Q,KAAKtnB,MAAS,EAC9B,MACF,IAAK,IACH2W,EAAQC,EAAO0Q,KAAKtnB,MAAS,EAanC,GATI2W,IACFpI,GAAO8H,EAAaM,GAASA,GAE/BA,EAAQ,EAERpI,IAAQqI,EAAO0Q,KAAKhf,MAAQoO,EAAUnK,GAAW,EACjDgC,IAAQsI,EAAOyQ,KAAKhf,MAAQoO,EAAUnK,GAAW,EAEjDgC,GAAOsI,EAAOyQ,KAAKtnB,MAAS,EACxB6W,EAAOyQ,KAAK3f,SACd,QAAUkP,EAAOyQ,KAAK3f,UAAuB,IAAInG,eAC/C,IAAK,IACHmV,EAAQE,EAAOyQ,KAAKtnB,MAAS,EAC7B,MACF,IAAK,IACH2W,GAASE,EAAOyQ,KAAKtnB,MAAS,EASpC,OALI2W,IACFpI,GAAO8H,EAAaM,GAASA,GAE/BA,EAAQ,EAEDpI,CAAG,EAIDvO,GAAQ,CAAClC,EAAWa,IAAUb,EAAEgpD,QAAQnoD,GAAI2oB,KAAKtnB,OAAU,ECld3DqG,GAAW,CACtBvI,EACA4mB,K,MAOA,MAAMkqC,EAAK5mD,EAAmBlK,GAvFd,EAChBA,EACA4mB,KAIA,MAAM,QAAEjd,EAAU,GAAMid,GAAW,CAAC,EAC9BhV,EAAW,EAAiB5R,GAElC,IAAI+a,EAAQ,EACZnJ,SAAAA,EAAUlR,SAAS+E,IACjB,MAAMsrD,EAAUtrD,EAAMmB,KAAK/F,GAAMb,EAAEgpD,QAAQnoD,GAAG2oB,KAAKrnB,SAC7C6Y,EAAYxU,KAAKC,OAAOsqD,EAAS,GACvCtrD,SAAAA,EAAO/E,SAASG,IACdb,EAAEgpD,QAAQnoD,GAAG2oB,KAAKpmB,EAAI2X,EAAQC,EAAY,CAAC,IAE7CD,GAASC,EAAYrR,CAAO,GAC5B,EAwEFsR,CAAU61C,EAAIlqC,GACd,MAAMpO,EAtEU,EAChBxY,EACA4mB,KAMA,MAAQ7O,MAAOi5C,EAAU,QAAExjD,EAAU,EAAC,QAAED,EAAU,GAAMqZ,GAAW,CAAC,EAE9DhV,EAAW,EAAiB5R,GAC5BmW,EAAYiQ,OAAO6qC,ODhBO,EAACjxD,EAAW4R,KAC5C,MAAMuE,EAAY,CAAC,EAwCnB,OAHIvE,aAAQ,EAARA,EAAUjP,SACZiP,EAAShM,QApCQ,CAACwQ,EAAiB3Q,KAGnC,IAAI4Q,EAAK,EAGLC,EAAU,EACd,MAAMC,EAAkBH,EAAUzT,OAC5B6T,EAAW/Q,aAAK,EAALA,GAAQA,aAAK,EAALA,EAAO9C,QAAS,GAwBzC,OAtBA8C,SAAAA,EAAO/E,SAAQ,CAACG,EAAO6E,K,MACrB,MAAM1E,EAAIyV,EAA0BzW,EAAGa,GACjC6V,EAAK1V,EAAIhB,EAAEgpD,QAAQhoD,EAAEoiC,IAAK5Z,KAAKlhB,MAASiO,GAE1CvV,GAAKH,IAAM2V,KACc,QAA3B,EAAA/Q,EAAMkR,MAAML,EAAS5Q,EAAI,UAAE,SAAEhF,SAASkW,I,MACT,QAA3B,EAAA5W,EAAEqqD,gBAAgBzzC,UAAS,SAAElW,SAASmF,I,MACpC,MAAMgR,EAAS7W,EAAEgpD,QAAQnjD,EAAEu9B,IACrBtsB,EAAOD,EAAO2S,KAAKlhB,QAEtBwO,EAAOT,GAAMK,EAAKI,IACjBD,EAAO2S,KAAKhf,QAA4B,QAAnB,EAAAxK,EAAEgpD,QAAQpyC,UAAS,eAAE4S,KAAKhf,QAEjDuM,EAAYZ,EAAWtQ,EAAEu9B,GAAIxsB,E,GAE/B,IAEJN,EAAU5Q,EAAI,EACd2Q,EAAKK,E,IAIFjR,CAAK,IAMP0Q,CAAS,ECxBdD,CAAmBlW,EAAG4R,GD2BQ,EAAC5R,EAAW4R,KAC5C,MAAMuE,EAAY,CAAC,EAgCnB,SAAS+6C,EACPC,EACAC,GAEA,MAAMC,EATR,SAAuBF,GAErB,OAAOtsD,KAAKC,UAAUqsD,EAAOx6C,MAAM,GACrC,CAMmB26C,CAAcH,GAE3BC,EAAUtpC,IAAIupC,KApCpB,SACEn6C,EACAhG,EACAiG,EACAC,EACAC,G,QAEA,IAAIxW,EACJ,IAAK,IAAI6E,EAAIwL,EAAUxL,EAAIyR,EAAUzR,IACnC7E,EAAIqW,EAAMxR,IACM,QAAZ,EAAA1F,EAAEgpD,QAAQnoD,UAAE,eAAE2oB,KAAKhf,SACD,QAApB,EAAAxK,EAAEqqD,gBAAgBxpD,UAAE,SAAEH,SAASmF,IAC7B,MAAMyR,EAAQtX,EAAEgpD,QAAQnjD,EAAEu9B,IAExB9rB,EAAMkS,KAAKhf,QACV8M,EAAMkS,KAAKlhB,MAAS8O,GACnBE,EAAMkS,KAAKlhB,MAAS+O,IAEtBN,EAAYZ,EAAWtQ,EAAEu9B,GAAIviC,E,IAKvC,CAeEoW,IAAQk6C,GACRC,EAAUvpC,IAAIwpC,GAAU,GAC1B,CAkCA,OAHIz/C,aAAQ,EAARA,EAAUjP,SACZiP,EAAShM,QA9BQ,CAAC2R,EAAiBL,KACnC,IACIM,EADAC,GAAgB,EAEhBvG,EAAW,EAEf,MAAMqgD,EAAU,IAAIlpC,IAqBpB,OAnBAnR,SAAAA,EAAOxW,SAAQ,CAACG,EAAW6W,K,MACzB,GAAiC,YAAjB,QAAZ,EAAA1X,EAAEgpD,QAAQnoD,UAAE,eAAE2oB,KAAKhf,OAAoB,CACzC,MAAMiK,EAAezU,EAAEqqD,gBAAgBxpD,IAAM,GACzC4T,EAAa9R,SACf6U,EAAexX,EAAEgpD,QAAQv0C,EAAa,GAAG2uB,IAAK5Z,KAAKlhB,MACnD4oD,EACE,CAACh6C,EAAOhG,EAAUwG,EAAgBD,EAAcD,GAChD+5C,GAEFrgD,EAAWwG,EACXD,EAAeD,E,CAGnB05C,EACE,CAACh6C,EAAOhG,EAAUgG,EAAMvU,OAAQ6U,EAAcD,EAAM5U,QACpD4uD,EACD,IAGIr6C,CAAK,IAMPf,CAAS,ECvGda,CAAmBhX,EAAG4R,IAGlB+H,EAA8C,CAAC,EACrD,IAAIgB,EAA2B,GAC/B,CAAC,IAAK,KAAKja,SAASyZ,IAClBQ,EACW,MAATR,EAAevI,EAAWwU,OAAO9X,OAAOsD,GAAU3E,UACpD,CAAC,IAAK,KAAKvM,SAAS0Z,IACJ,MAAVA,IACFO,EAAmBA,EAAiB/T,KAAKgU,GACvCwL,OAAO9X,OAAOsM,GAAO3N,aAIzB,MAAM6K,GACK,MAATqC,EAAena,EAAEqqD,gBAAkBrqD,EAAEmqD,eACrC1wC,KAAKzZ,GACD+X,EDiIqB,EAC/B/X,EACA4R,EACAuE,EACA2B,KAEA,MAAMtJ,EAAuB,CAAC,EACxBuJ,EAAwB,CAAC,EACzB3G,EAA0B,CAAC,EAqCjC,OAhCAQ,SAAAA,EAAUlR,SAAS+E,IACjBA,SAAAA,EAAO/E,SAAQ,CAACG,EAAGyH,KACjBkG,EAAK3N,GAAKA,EACVkX,EAAMlX,GAAKA,EACXuQ,EAAIvQ,GAAKyH,CAAK,GACd,IAGJsJ,SAAAA,EAAUlR,SAAS+E,IACjB,IAAIuS,GAAW,EACfvS,SAAAA,EAAO/E,SAASG,IACd,IAAIoX,EAAKH,EAAWjX,GAAG+F,KAAKquB,GAAMA,EAAEmO,KAEpC,GAAInrB,EAAGtV,OAAQ,CACbsV,EAAKA,EAAGhE,MAAK,CAACw8B,EAAOrlC,IAAUgG,EAAIq/B,GAAKr/B,EAAIhG,KAC5C,MAAM8M,GAAMD,EAAGtV,OAAS,GAAK,EAC7B,IAAK,IAAI+C,EAAIc,KAAK2R,MAAMD,GAAKE,EAAK5R,KAAK6R,KAAKH,GAAKxS,GAAK0S,IAAM1S,EAAG,CAC7D,MAAM1E,EAAIiX,EAAGvS,GAEXqS,EAAMlX,KAAOA,GACbmX,EAAU5G,EAAIpQ,KACb4W,GAAYzB,EAAWtV,EAAGG,KAE3B+W,EAAM/W,GAAKH,EACXkX,EAAMlX,GAAK2N,EAAK3N,GAAK2N,EAAKxN,GAC1BgX,EAAU5G,EAAIpQ,G,KAIpB,IAGG,CAAEwN,OAAMuJ,QAAO,EC9KJF,CACZ7X,EACA2a,EACAxE,EACA2B,GAEIU,ED2KwB,EAClCxY,EACA4R,EACApD,EACAuJ,EACAvK,EACAD,EACAgL,K,MAOA,MAAMC,EAAyB,CAAC,EAC1BC,EAASW,GACbpZ,EACA4R,EACApD,EACAhB,EACAD,EACAgL,GAEInW,EAAamW,EAAa,aAAe,cAEzCc,EAAU,CACdC,EACAC,KAEA,IAAI/Y,EAAQiY,EAAOiwC,cACflvC,EAAOhZ,EAAMsT,MACjB,MAAMrT,EAA+B,CAAC,EACtC,KAAO+Y,GACD/Y,EAAQ+Y,EAAK4pB,IACf9pB,EAAUE,EAAK4pB,KAEf3iC,EAAQ+Y,EAAK4pB,KAAM,EACnB5iC,EAAMS,KAAKuY,GACXhZ,EAAQA,EAAM6G,OAAOkS,EAAcC,EAAK4pB,MAG1C5pB,EAAOhZ,EAAMsT,K,EAwCjB,OARAuF,GA3BeG,IACbhB,EAAGgB,IAASf,EAAOqwC,gBAAgBtvC,EAAM,OAAS,IAAI5T,QACpD,CAAC0J,EAAalP,IACLoG,KAAKC,IAAI6I,GAAMkJ,EAAGpY,EAAEuT,SAAW,GAAKvT,EAAEopB,KAAKlpB,SAEpD,EACD,GAqBYmY,EAAO4xC,gBAAgB5wC,KAAKhB,IAC3CY,GAlBeG,IACb,MAAMjN,GAAOkM,EAAOqwC,gBAAgBtvC,EAAM,QAAU,IAAI5T,QACtD,CAAC0J,EAAalP,IACLoG,KAAK+F,IAAI+C,GAAMkJ,EAAGpY,EAAEsT,SAAW,GAAKtT,EAAEopB,KAAKlpB,SAEpDsL,OAAOC,mBAGHnJ,EAAO1C,EAAEgpD,QAAQxvC,GAErBjN,IAAQX,OAAOC,mBACfnJ,EAAK8mB,KAAKpnB,aAAeA,IAEzBoW,EAAGgB,GAAQhT,KAAKC,IAAI+R,EAAGgB,GAAOjN,G,GAKnBkM,EAAO0xC,cAAc1wC,KAAKhB,IAGrB,QAApB,EAAA2N,OAAO9X,OAAOyJ,UAAM,SAAErX,SAASG,IAC7B2X,EAAG3X,GAAK2X,EAAGhK,EAAK3N,GAAG,IAGd2X,CAAE,EC5PMF,CACTtY,EACA2a,EACA5C,EAAMvJ,KACNuJ,EAAMA,MACNvK,EACAD,EACU,MAAV6M,GAEY,MAAVA,GACFgM,OAAO3D,KAAKjK,GAAI9X,SAAS8wD,GAAWh5C,EAAGg5C,IAAUh5C,EAAGg5C,KAEtD73C,EAAIQ,EAAOC,GAAS5B,CAAE,GACtB,IAGJ,MAAMqC,EDmSkC,EACxC7a,EACA2Z,IAEOxL,EAAMiY,OAAO9X,OAAOqL,IAAOnB,I,MAChC,IAAI/R,EAAMmF,OAAOgO,kBACbrN,EAAMX,OAAOC,kBAUjB,OARe,QAAf,EAAAua,OAAO3D,KAAKjK,UAAG,SAAE9X,SAASG,IACxB,MAAMyC,EAAIkV,EAAG3X,GACPgZ,EAAY3X,GAAMlC,EAAGa,GAAK,EAEhC4F,EAAMD,KAAKC,IAAInD,EAAIuW,EAAWpT,GAC9B8F,EAAM/F,KAAK+F,IAAIjJ,EAAIuW,EAAWtN,EAAI,IAG7B9F,EAAM8F,CAAG,ICnTImN,CAA2B1Z,EAAG2Z,GAEpD,OADAkB,GD6TK,SACLlB,EACAI,GAEA,MAAMC,EAAcoM,OAAO9X,OAAOyL,GAC5BE,EAAazT,KAAK+F,OAAOyN,GACzBE,EAAa1T,KAAKC,OAAOuT,GAE/B,CAAC,IAAK,KAAKtZ,SAASyZ,IAClB,CAAC,IAAK,KAAKzZ,SAAS0Z,IAClB,MAAMC,EAAYF,EAAOC,EACnB5B,EAAKmB,EAAIU,GACf,IAAIxB,EACJ,GAAIL,IAAOuB,EAAS,OAEpB,MAAMO,EAAS8L,OAAO9X,OAAOkK,GAC7BK,EACY,MAAVuB,EACIH,EAAazT,KAAK+F,OAAO+N,GACzBJ,EAAa1T,KAAKC,OAAO6T,GAE3BzB,IACFc,EAAIU,GAAa,CAAC,EAClB+L,OAAO3D,KAAKjK,GAAI9X,SAASgiB,IACvB/I,EAAIU,GAAWqI,GAAOlK,EAAGkK,GAAO7J,CAAK,I,GAGzC,GAEN,CC1VmBiB,CAAiBH,EAAKkB,GD4VlB,EACrBlB,EACA5B,KAEA,MAAMxH,EAAiC,CAAC,EASxC,OARA6V,OAAO3D,KAAK9I,EAAIa,IAAI9Z,SAASgiB,IAC3B,GAAI3K,EACFxH,EAAOmS,GAAO/I,EAAI5B,EAAMrU,eAAegf,OAClC,CACL,MAAMpU,EAAS8X,OAAO9X,OAAOqL,GAAK/S,KAAKtD,GAAMA,EAAEof,KAC/CnS,EAAOmS,IAAQpU,EAAO,GAAKA,EAAO,IAAM,C,KAGrCiC,CAAM,ECxWNgK,CAAQZ,EAAKq3C,EAAW,EAepB,CAAUF,EAAIlqC,GACV,QAAf,EAAAR,OAAO3D,KAAKjK,UAAG,SAAE9X,SAASgiB,IACxBouC,EAAG9H,QAAQtmC,GAAK8G,KAAKlmB,EAAIkV,EAAGkK,EAAI,GAChC,ECnFE/G,GAAe3b,IACnB,MAAMS,EAA+B,CAAC,EAEhCG,EAAOC,I,MACX,MAAMM,EAAQnB,EAAEgpD,QAAQnoD,GACxB,IAAKM,EAAO,OAAO,EACnB,GAAIV,EAAQI,GACV,OAAOM,EAAMqoB,KAAKvnB,KAIpB,IAAIA,EAkBJ,OApBAxB,EAAQI,IAAK,EAIc,QAA3B,EAAAb,EAAE8oD,gBAAgBjoD,EAAG,cAAM,SAAEH,SAASN,IACpC,MAEMmL,EAFQ3K,EAAIR,EAAEsT,QACLtT,EAAEopB,KAAK5f,OAElB2B,SACW7D,IAATzF,GAAsBsJ,EAAItJ,KAC5BA,EAAOsJ,E,IAKRtJ,IACHA,EAAO,GAGTd,EAAMqoB,KAAKvnB,KAAOA,EACXA,CAAI,EAGbjC,EAAE0oD,cACC36C,QAAQknB,GAA+C,IAAzCj1B,EAAE8oD,gBAAgB7zB,EAAEmO,GAAI,MAAMzgC,SAC5CjC,SAASiT,GAAW/S,EAAI+S,EAAOyvB,KAAI,EA0FlCloB,GAAQ,CAAClb,EAAUI,IAErBJ,EAAEgpD,QAAQ5oD,EAAEsT,QAAQ8V,KAAKvnB,KACzBjC,EAAEgpD,QAAQ5oD,EAAEuT,QAAQ6V,KAAKvnB,KACzB7B,EAAEopB,KAAK5f,OCjGLuR,GAAY,CAAChQ,EAAWnL,KAC5B,MAAMY,EAAOC,IACXb,EAAE8oD,gBAAgBjoD,EAAG,QAAQH,SAASN,IACpC,MAAMib,EAAQjb,EAAEuT,OACV3S,EAAIH,IAAMwa,EAAQjb,EAAEsT,OAAS2H,EAC9BlQ,EAAEyF,QAAQ5P,IAAOka,GAAMlb,EAAGI,KAC7B+K,EAAEihD,QAAQ,CACRhpB,GAAIpiC,EACJwoB,KAAM,CAAC,IAETre,EAAEgiD,QAAQ,CACR/pB,GAAIhjC,EAAEgjC,GACNzvB,OAAQ9S,EACR6S,OAAQ1S,EACRwoB,KAAM,CAAC,IAET5oB,EAAII,G,GAEN,EAIJ,OADAmK,EAAEu9C,cAAchoD,SAASu0B,GAAMr0B,EAAIq0B,EAAEmO,MAC9Bj4B,EAAEu9C,cAAc/lD,MAAM,EAmDzB8uD,GAAqB,CAACtmD,EAAWnL,KACrC,MAAMY,EAAOC,I,MACiB,QAA5B,EAAAb,EAAE8oD,gBAAgBjoD,EAAG,eAAO,SAAEH,SAASN,IACrC,MAAMib,EAAQjb,EAAEuT,OACV3S,EAAIH,IAAMwa,EAAQjb,EAAEsT,OAAS2H,EAGhClQ,EAAEyF,QAAQ5P,SACmB0G,IAA7B1H,EAAEgpD,QAAQhoD,GAAIwoB,KAAK/jB,OAAwByV,GAAMlb,EAAGI,KAErD+K,EAAEihD,QAAQ,CACRhpB,GAAIpiC,EACJwoB,KAAM,CAAC,IAETre,EAAEgiD,QAAQ,CACR/pB,GAAIhjC,EAAEgjC,GACNzvB,OAAQ9S,EACR6S,OAAQ1S,EACRwoB,KAAM,CAAC,IAET5oB,EAAII,G,GAEN,EAIJ,OADAmK,EAAEu9C,cAAchoD,SAASu0B,GAAMr0B,EAAIq0B,EAAEmO,MAC9Bj4B,EAAEu9C,cAAc/lD,MAAM,EAOzB2Y,GAAmB,CAACnQ,EAAWnL,IAC5BmO,EAAMnO,EAAE2qD,eAAgBvqD,GACzB+K,EAAEyF,QAAQxQ,EAAEuT,UAAYxI,EAAEyF,QAAQxQ,EAAEsT,QAC/BwH,GAAMlb,EAAGI,GAEXsxD,MAILn2C,GAAa,CAACpQ,EAAWnL,EAAW6Y,KACxC1N,EAAEu9C,cAAchoD,SAASixD,IACvB,MAAM9wD,EAAIb,EAAEgpD,QAAQ2I,EAAGvuB,IAClBviC,EAAE2oB,KAAKvnB,OAAMpB,EAAE2oB,KAAKvnB,KAAO,GAChCpB,EAAE2oB,KAAKvnB,MAAS4W,CAAK,GACrB,ECtHSyD,GAAgB,CAACnR,EAAWnL,KACvC,IAAIkQ,EAAKtP,EAAIuK,EAAGA,EAAEu9C,cAAe,QAAQ,GACzCx4C,EAAKA,EAAGyG,MAAM,GAAGzG,aAAE,EAAFA,EAAIvN,QAAS,GAC9BuN,EAAGxP,SAASG,IACV+b,GAAezR,EAAGnL,EAAGa,EAAE,GACvB,EAGE+b,GAAiB,CAACzR,EAAWnL,EAAW6O,KAC5C,MACMvF,EADW6B,EAAE69C,QAAQn6C,GACH2a,KAAKlgB,OAGhB6B,EACV29C,gBAAgBj6C,EAAO,QACvBb,MAAM5N,GAAMA,EAAEsT,SAAWpK,GAAUlJ,EAAEuT,SAAWrK,IAC9CkgB,KAAK9M,SAAWC,GAAaxR,EAAGnL,EAAG6O,EAAM,EAOnC8N,GAAe,CAACxR,EAAWnL,EAAW6O,KACjD,MACMvF,EADW6B,EAAE69C,QAAQn6C,GACH2a,KAAKlgB,OAE7B,IAAIuT,GAAc,EAGdC,EAAY9c,EACb8oD,gBAAgBj6C,EAAO,OACvBb,MAAM5N,GAAMA,EAAEsT,SAAWpK,IAExByT,EAAW,EA+Bf,OA7BKD,IACHD,GAAc,EACdC,EAAY9c,EACT8oD,gBAAgBx/C,EAAQ,OACxB0E,MAAM5N,GAAMA,EAAEsT,SAAW7E,KAG9BkO,EAAWD,EAAU0M,KAAKlpB,OAE1BN,EAAE8oD,gBAAgBj6C,EAAO,QAAQnO,SAASN,IACxC,MAAM4c,EAAY5c,EAAEuT,SAAW9E,EACzB0F,EAAQyI,EAAY5c,EAAEsT,OAAStT,EAAEuT,OAEvC,GAAIY,IAAUjL,EAAQ,CACpB,MAAM2T,EAAeD,IAAcH,EAC7BK,EAAc9c,EAAEopB,KAAKlpB,OAG3B,GADAyc,GAAYE,EAAeC,GAAeA,EACtC00C,GAAWzmD,EAAG0D,EAAO0F,GAAQ,CAE/B,MAAM6I,EAAgBjS,EACnB29C,gBAAgBj6C,EAAO,QACvBb,MAAM5N,GAAMA,EAAEuT,SAAWY,GAASnU,EAAEsT,SAAWa,IAAQiV,KACvD9M,SACHK,GAAYE,GAAgBG,EAAgBA,C,MAK3CL,CAAQ,EAGJV,GAAmB,CAC9B9K,EACA/C,EAAW+C,EAAKm3C,cAAc,GAAGtlB,MAEjC9lB,GAAgB/L,EAAM,CAAC,EAAG,EAAG/C,EAAK,EAG9B8O,GAAkB,CACtB/L,EACA9Q,EACA8c,EACA1c,EACAyI,K,MAEA,MAAMiM,EAAMgI,EACZ,IAAIs0C,EAAat0C,EACjB,MAAMpc,EAAQoQ,EAAKy3C,QAAQnoD,GAkB3B,OAhBAJ,EAAQI,IAAK,EACO,QAApB,EAAA0Q,EAAKu4C,aAAajpD,UAAE,SAAEH,SAASM,IACxBP,EAAQO,EAAEoiC,MACbyuB,EAAav0C,GAAgB/L,EAAM9Q,EAASoxD,EAAY7wD,EAAEoiC,GAAIviC,G,IAIlEM,EAAMqoB,KAAKjU,IAAMA,EACjBpU,EAAMqoB,KAAKlU,IAAMu8C,IACbvoD,EACFnI,EAAMqoB,KAAKlgB,OAASA,SAGbnI,EAAMqoB,KAAKlgB,OAGbuoD,CAAU,EAGNt1C,GAAahL,GACjBA,EAAKo5C,cAAc38C,MAAM5N,GACvBA,EAAEopB,KAAK9M,SAAY,IAIjBD,GAAY,CAACtR,EAAWnL,EAAWK,KAC9C,IAAIQ,EAAIR,EAAKsT,OACT3S,EAAIX,EAAKqT,OAKR1T,EAAE8oD,gBAAgBjoD,EAAG,OAAOmN,MAAM5N,GAAMA,EAAEsT,SAAW1S,MACxDH,EAAIR,EAAKqT,OACT1S,EAAIX,EAAKsT,QAGX,MAAMmF,EAAS3N,EAAE69C,QAAQnoD,GACnBkY,EAAS5N,EAAE69C,QAAQhoD,GACzB,IAAIyc,EAAY3E,EACZ4E,GAAO,EAIP5E,EAAO0Q,KAAKlU,IAAOyD,EAAOyQ,KAAKlU,MACjCmI,EAAY1E,EACZ2E,GAAO,GAGT,MAAMC,EAAa3d,EAAE2qD,cAAc58C,QAAQ1N,GAEvCqd,IAASE,GAAazS,EAAE69C,QAAQ3oD,EAAKsT,QAAS8J,IAC9CC,IAASE,GAAazS,EAAE69C,QAAQ3oD,EAAKqT,QAAS+J,KAIlD,OAAOtP,EAAMwP,GAAatd,GACjB6a,GAAMlb,EAAGK,IAChB,EAUSmc,GAAgB,CAC3BrR,EACAnL,EACAI,EACAyd,KAGA,MAAMi0C,EAAU3mD,EACb29C,gBAAgB1oD,EAAEuT,OAAQ,QAC1B3F,MAAM3N,GAASA,EAAKsT,SAAWvT,EAAEsT,QAAUrT,EAAKqT,SAAWtT,EAAEsT,SAC5Do+C,GACF3mD,EAAE/J,WAAW0wD,EAAQ1uB,IAGvBj4B,EAAEgiD,QAAQ,CACR/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQkK,EAAElK,OACVD,OAAQmK,EAAEnK,OACV8V,KAAM,CAAC,IAGTnN,GAAiBlR,GACjBmR,GAAcnR,EAAGnL,GACjB+d,GAAY5S,EAAGnL,EAAE,EAGb+d,GAAc,CAAC5S,EAAWnL,KAC9B,MAAMwO,EAAOrD,EAAEu9C,cAAc16C,MAAMnN,IACzBA,EAAE2oB,KAAKlgB,SAGjB,IAAI4G,EAAKtP,EAAIuK,EAAGqD,EAAM,OAAO,GAC7B0B,EAAKA,EAAGyG,MAAM,GACdzG,EAAGxP,SAASG,IACV,MAAMyI,EAAS6B,EAAE69C,QAAQnoD,GAAG2oB,KAAKlgB,OACjC,IAAIjJ,EAAOL,EAAE8oD,gBAAgBjoD,EAAG,OAAOmN,MAAM5N,GAAMA,EAAEsT,SAAWpK,IAE5DwU,GAAU,GAETzd,GAAQL,EAAE4Q,QAAQtH,KAErBjJ,EAAOL,EAAE8oD,gBAAgBx/C,EAAQ,OAAO0E,MAAM5N,GAAMA,EAAEsT,SAAW7S,IACjEid,GAAU,GAGZ9d,EAAEgpD,QAAQnoD,GAAG2oB,KAAKvnB,MACdjC,EAAE4Q,QAAQtH,IAAWtJ,EAAEgpD,QAAQ1/C,GAAQkgB,KAAKvnB,MAAU,IACvD6b,EAAUzd,aAAI,EAAJA,EAAMmpB,KAAK5f,SAAWvJ,aAAI,EAAJA,EAAMmpB,KAAK5f,QAAQ,GACtD,EAMEgoD,GAAa,CAACrgD,EAAc1L,EAAOhF,IAEhC0Q,EACJu3C,gBAAgBjjD,EAAG,QACnBmI,MAAM5N,GAAMA,EAAEuT,SAAW9S,GAAKT,EAAEsT,SAAW7S,IAO1C+c,GAAe,CAAC9E,EAAwBkF,IAE1CA,EAAUwL,KAAKjU,KAAQuD,EAAO0Q,KAAKlU,KACnCwD,EAAO0Q,KAAKlU,KAAQ0I,EAAUwL,KAAKlU,IC1OjC2G,GAAoBN,GAOpBI,GAAwB/b,IDbA,CAAC+xD,IAC7B,MAAM/xD,EpBLgB,CAACA,IACvB,MAAMke,EAAa,IAAIlZ,EA0BvB,OAzBAhF,EAAE0oD,cAAchoD,SAASG,IACvBqd,EAAWkuC,QAAQ,OAAD,UAAMvrD,GAAI,IAE9Bb,EAAE2qD,cAAcjqD,SAASN,IACvB,MAAMC,EAAO6d,EACV4qC,gBAAgB1oD,EAAEuT,OAAQ,OAC1B3F,MAAM3N,GAASA,EAAKqT,SAAWtT,EAAEsT,SAC/BrT,EAWH6d,EAAW0vC,eAAevtD,aAAI,EAAJA,EAAM+iC,GAAK,OAAF,wBAC9B/iC,EAAKmpB,MAAI,CACZlpB,OAAQD,EAAKmpB,KAAKlpB,OAAUF,EAAEopB,KAAKlpB,QAAW,EAC9CsJ,OAAQpD,KAAKC,IAAIpG,EAAKmpB,KAAK5f,OAASxJ,EAAEopB,KAAK5f,QAAW,MAbxDsU,EAAWivC,QAAQ,CACjB/pB,GAAIhjC,EAAEgjC,GACNzvB,OAAQvT,EAAEuT,OACVD,OAAQtT,EAAEsT,OACV8V,KAAM,CACJlpB,OAAQF,EAAEopB,KAAKlpB,QAAW,EAC1BsJ,OAAQxJ,EAAEopB,KAAK5f,QAAW,I,IAW3BsU,CAAU,EoBtBP9B,CAAS21C,GACnB,GAAS/xD,GACT,MAAMmL,EDZa,CAACnL,IACpB,MAAMmL,EAAI,IAAInG,EAAM,CAClBuM,KAAM,KAIFkK,EAAQzb,EAAE0oD,cAAc,GACxBhtC,EAAO1b,EAAE0oD,cAAc/lD,OAG7B,IAAItC,EACAwY,EACJ,IAJA1N,EAAEihD,QAAQ3wC,GAIHN,GAAUhQ,EAAGnL,GAAK0b,GACvBrb,EAAOib,GAAiBnQ,EAAGnL,GAC3B6Y,EAAQ1N,EAAEyF,QAAQvQ,EAAKsT,QAAUuH,GAAMlb,EAAGK,IAAS6a,GAAMlb,EAAGK,GAC5Dkb,GAAWpQ,EAAGnL,EAAG6Y,GAGnB,OAAO1N,CAAC,ECNEyQ,CAAa5b,GAIvB,IAAII,EACAyd,EACJ,IALAxB,GAAiBlR,GACjBmR,GAAcnR,EAAGnL,GAITI,EAAImc,GAAUpR,IACpB0S,EAAIpB,GAAUtR,EAAGnL,EAAGI,GACpBoc,GAAcrR,EAAGnL,EAAGI,EAAGyd,E,ECGzBhC,CAAe7b,EAAE,ECgCbmN,GAAY,CAChBnN,EACA4mB,KAYA,MAAM,UACJzmB,EAAS,OACT2b,EAAM,QACNrY,EAAU,KAAI,UACduuD,EAAS,cACT1B,EAAa,MACbv4C,EAAK,QACLvK,EAAU,GAAE,QACZD,EAAU,GAAE,QACZ5D,EAAU,IACRid,EAEJ3c,GAAgBjK,GAEhBD,EAAWC,EAAGG,GAEd,MAAM,YAAEkP,EAAW,eAAEG,GnBxFX,CAACxP,IACX,MAAMwO,EAAOjM,EAAavC,EAAG,OAAQ,CAAC,EAAG,SACnC0O,EAsHW,CAAC1O,IAClB,MAAM0O,EAA6B,CAAC,EAC9B9N,EAAM,CAACC,EAAOsO,KAClB,MAAM1M,EAAWzC,EAAEyqD,YAAY5pD,GAC/B4B,SAAAA,EAAU/B,SAASmO,GAAUjO,EAAIiO,EAAMu0B,GAAIj0B,EAAQ,KACnDT,EAAO7N,GAAKsO,CAAK,EAKnB,OADAnP,EAAEwqD,WAAW9pD,SAASG,GAAMD,EAAIC,EAAEuiC,GAAI,KAC/B10B,CAAM,EAhIEU,CAAWpP,GAC1B,IAAIiyD,EAAWzrD,KAAKC,OAAO2f,OAAO9X,OAAOI,IAErClI,KAAKgF,IAAIymD,KAAcP,MACzBO,EAAW,GAGb,MAAM9vD,EAAS8vD,EAAW,EACpBxjD,EAAU,EAAItM,EAAS,EAK7BnC,EAAE2qD,cAAcjqD,SAASN,IACvBA,EAAEopB,KAAK5f,QAAW6E,CAAO,IAI3B,MAAMnO,EAiHW,CAACN,IAClB,IAAIuQ,EAAS,EAIb,OAHAvQ,EAAE2qD,cAAcjqD,SAASN,IACvBmQ,GAAUnQ,EAAEopB,KAAKlpB,MAAO,IAEnBiQ,CAAM,EAtHEhB,CAAWvP,GAAK,EAc/B,OARAA,EAAEwqD,WAAW9pD,SAASmO,IACpB,EAAI7O,EAAGwO,EAAMC,EAASnO,EAAQ6B,EAAQuM,EAAQG,EAAMu0B,GAAG,IAOlD,CACL/zB,YAAab,EACbgB,eAAgBf,EACjB,EmBmDuC,CAAgBzO,GD3FtC,EAClBA,EACA8b,KAEA,OAAQA,GACN,IAAK,kBACHC,GAAqB/b,GACrB,MACF,IAAK,aAOL,QAQoB,CAACA,IHcI,CAACA,IAE5B,MAAMS,EAA+B,CAAC,EACtC,IAAIqC,EAEJ,MAAMlC,EAAOC,I,MACX,MAAMM,EAAQnB,EAAEgpD,QAAQnoD,GACxB,IAAKM,EAAO,OAAO,EACnB,GAAIV,EAAQI,GACV,OAAOM,EAAMqoB,KAAKvnB,KAIpB,IAAIA,EAsBJ,OAxBAxB,EAAQI,IAAK,EAIc,QAA3B,EAAAb,EAAE8oD,gBAAgBjoD,EAAG,cAAM,SAAEH,SAASN,IACpC,MAEMmL,EAFQ3K,EAAIR,EAAEsT,QACLtT,EAAEopB,KAAK5f,OAElB2B,SACW7D,IAATzF,GAAsBsJ,EAAItJ,KAC5BA,EAAOsJ,E,IAKRtJ,IACHA,EAAO,SAGOyF,IAAZ5E,GAAyBb,EAAOa,KAClCA,EAAUb,GAGZd,EAAMqoB,KAAKvnB,KAAOA,EACXA,CAAI,EAGbjC,EAAE0oD,cACC36C,QAAQknB,GAA+C,IAAzCj1B,EAAE8oD,gBAAgB7zB,EAAEmO,GAAI,MAAMzgC,SAC5CjC,SAASiT,IACJA,GAAQ/S,EAAI+S,EAAOyvB,GAAG,SAGb17B,IAAb5E,IACFA,EAAU,GAMZ,MAAMovD,EAA0C,CAAC,EAC3CC,EAAa,CAACtxD,EAAOuxD,K,MACzB,MAAMjxD,EAAQnB,EAAEgpD,QAAQnoD,GAElBwxD,EAAY7T,MAAMr9C,EAAMqoB,KAAK/jB,OAA8B2sD,EAApBjxD,EAAMqoB,KAAK/jB,YAGhCiC,IAApBvG,EAAMqoB,KAAKvnB,MAAsBd,EAAMqoB,KAAKvnB,KAAQowD,KACtDlxD,EAAMqoB,KAAKvnB,KAAOowD,GAGhBH,EAAerxD,KACnBqxD,EAAerxD,IAAK,EAGO,QAA3B,EAAAb,EAAE8oD,gBAAgBjoD,EAAG,cAAM,SAAEH,SAASN,IACpC+xD,EAAW/xD,EAAEsT,OAAQ2+C,EAAWjyD,EAAEopB,KAAK5f,OAAQ,IAC/C,EAIJ5J,EAAE0oD,cAAchoD,SAASu0B,IACvB,MAAM9zB,EAAQ8zB,EAAEzL,KACXroB,IACAq9C,MAAMr9C,EAAMsE,OAGftE,EAAMc,MAASa,EAFfqvD,EAAWl9B,EAAEmO,GAAIjiC,EAAMsE,O,GAIzB,EG7FF6sD,CAAqBtyD,GFyDO,CAACA,IAC7B,MAAMmL,EAAI,IAAInG,EAAM,CAAEuM,KAAM,KAGtBkK,EAAQzb,EAAE0oD,cAAc,GACxBhtC,EAAO1b,EAAE0oD,cAAc/lD,OAG7B,IAAItC,EACAwY,EACJ,IAJA1N,EAAEihD,QAAQ3wC,GAIHg2C,GAAmBtmD,EAAGnL,GAAM0b,GACjCrb,EAAOib,GAAiBnQ,EAAGnL,GAC3B6Y,EAAQ1N,EAAEyF,QAAQvQ,EAAKsT,QAAUuH,GAAMlb,EAAGK,IAAS6a,GAAMlb,EAAGK,GAC5Dkb,GAAWpQ,EAAGnL,EAAG6Y,EAGX,EExER,CAAa7Y,EAAE,EATXgc,CAAgBhc,SALlB,IAAK,eACHic,GAAkBjc,G,ECiFtBiC,CAAKiI,EAAmBlK,GAAI8b,GAE5B3R,GAAuBnK,GtByFO,EAACA,EAAWwP,EAAyB,KAEnE,MAAM7O,EAAQX,EAAE0oD,cACVoH,EAAYnvD,EACfoN,QAAQlN,QAAsB6G,IAAhB7G,EAAE2oB,KAAKvnB,OACrB2E,KAAK/F,GAAMA,EAAE2oB,KAAKvnB,OAEf8c,EAASvY,KAAK+F,OAAOujD,GACrBnlD,EAAiB,GAEvBhK,EAAMD,SAASG,IACb,MAAMoB,GAAQpB,EAAE2oB,KAAKvnB,MAAS,GAAK8c,EAE9BpU,EAAO1I,KACV0I,EAAO1I,GAAQ,IAEjB0I,EAAO1I,GAAMhB,KAAKJ,EAAEuiC,GAAG,IAGzB,IAAIvqB,EAAQ,EACZ,IAAK,IAAInT,EAAI,EAAGA,EAAIiF,EAAOhI,OAAQ+C,IAAK,CACtC,MAAMwK,EAAKvF,EAAOjF,QACPgC,IAAPwI,EACExK,EAAI8J,GAAmB,IACzBqJ,GAAS,GAEFA,IACT3I,SAAAA,EAAIxP,SAASG,IACX,MAAM6B,EAAO1C,EAAEgpD,QAAQnoD,GACnB6B,IACFA,EAAK8mB,KAAKvnB,KAAOS,EAAK8mB,KAAKvnB,MAAQ,EACnCS,EAAK8mB,KAAKvnB,MAAS4W,E,OsBtH3B3Q,CAAiBlI,EAAGwP,GnB+CN,EAACxP,EAAWqP,KAItBA,GACFrP,EAAEoH,WAAWiI,GAGfrP,EAAE2qD,cAAcjqD,SAASN,IACnBA,EAAEopB,KAAKta,aACTlP,EAAEoB,WAAWhB,EAAEgjC,G,GAEjB,EmBzDFh5B,CAAoBpK,EAAGqP,GtBwEK,CAACrP,IAC7B,MAAM8vD,EAAY9vD,EACf0oD,cACA36C,QAAQlN,QAAsB6G,IAAhB7G,EAAE2oB,KAAKvnB,OACrB2E,KAAK/F,GAAMA,EAAE2oB,KAAKvnB,OACfsK,EAAM/F,KAAK+F,OAAOujD,GACxB9vD,EAAE0oD,cAAchoD,SAASG,IACnBA,EAAE2oB,KAAKkB,eAAe,SAAWne,IAAQmlD,MAC3C7wD,EAAE2oB,KAAKvnB,MAASsK,E,GAElB,EsBhFFvE,CAAehI,GAEfuK,GAAiBvK,GAEjB0K,GAAuB1K,GAEvB,MAAMyP,EAAoB,GlB3GhB,EAACzP,EAAWyP,KACtBzP,EAAE2qD,cAAcjqD,SAASL,GAGL,EAACL,EAAWI,EAAmBqP,KACnD,IAAI5O,EAAIT,EAAEuT,OACNjE,EAAQ1P,EAAEgpD,QAAQnoD,GAAI2oB,KAAKvnB,KAC/B,MAAMjB,EAAIZ,EAAEsT,OACN/D,EAAQ3P,EAAEgpD,QAAQhoD,GAAIwoB,KAAKvnB,KAC3BwI,EAAYrK,EAAEopB,KAAK/e,UAEzB,GAAIkF,IAAUD,EAAQ,EAAG,OAIzB,IAAIlF,EACA+nD,EAQA7sD,EACJ,IAZA1F,EAAEoB,WAAWhB,EAAEgjC,IAYV19B,EAAI,IAAKgK,EAAOA,EAAQC,IAASjK,IAAKgK,EACzCtP,EAAEopB,KAAK7lB,OAAS,GAChB4uD,EAAW,CACTC,aAAcpyD,EACd8B,MAAO,EACPC,OAAQ,EACRF,KAAMyN,GAGRlF,EAAQjI,EAAavC,EArCD,OAqCqBuyD,EAAU,MAE/C7iD,IAAUjF,IACZ8nD,EAASrwD,MAAQ9B,EAAEopB,KAAKtnB,MACxBqwD,EAASpwD,OAAS/B,EAAEopB,KAAKrnB,OACzBowD,EAAS/nD,MAAQklD,EACjB6C,EAAS1oD,SAAWzJ,EAAEopB,KAAK3f,UAG7B7J,EAAEmtD,QAAQ,CACR/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQ9S,EACR6S,OAAQlJ,EACRgf,KAAM,CAAElpB,OAAQF,EAAEopB,KAAKlpB,UAEf,IAANoF,GACF+J,EAAYxO,KAAKuJ,GAEnB3J,EAAI2J,EAGNxK,EAAEmtD,QAAQ,CACR/pB,GAAI,IAAI58B,KAAK0hC,WACbv0B,OAAQ9S,EACR6S,OAAQ1S,EACRwoB,KAAM,CAAElpB,OAAQF,EAAEopB,KAAKlpB,SACvB,EA3DgCwP,CAAc9P,EAAGK,EAAMoP,IAAa,EkB2GtE,CAAazP,EAAGyP,GC5Ee,EAACzP,EAAWyP,KAC3C,MAAM4F,EAnDa,CAACrV,IACpB,MAAMuQ,EAAgC,CAAC,EACvC,IAAI+E,EAAM,EAEV,MAAM1U,EAAOC,IACX,MAAM0U,EAAMD,EACZtV,EAAEyqD,YAAY5pD,GAAGH,SAASu0B,GAAMr0B,EAAIq0B,EAAEmO,MACtC7yB,EAAO1P,GAAK,CAAE0U,MAAKD,IAAKA,IAAO,EAIjC,OAFAtV,EAAEwqD,WAAW9pD,SAASu0B,GAAMr0B,EAAIq0B,EAAEmO,MAE3B7yB,CAAM,EAwCSkiD,CAAazyD,GAEnCyP,EAAY/O,SAASgyD,I,QACnB,IAAI7xD,EAAI6xD,EACJhwD,EAAO1C,EAAEgpD,QAAQnoD,GACrB,MAAM2xD,EAAe9vD,EAAK8mB,KAAKgpC,aAC/B,IAAKA,EAAc,OACnB,MAAM/8C,EA1CO,EACfzV,EACAqV,EACAxU,EACAG,K,QAEA,MAAM2U,EAAc,GACdC,EAAc,GACdL,EAAM/O,KAAK+F,IAAI8I,EAAcxU,GAAG0U,IAAKF,EAAcrU,GAAGuU,KACtDD,EAAM9O,KAAKC,IAAI4O,EAAcxU,GAAGyU,IAAKD,EAAcrU,GAAGsU,KAC5D,IAAIhM,EACAoM,EAGJpM,EAASzI,EACT,GACEyI,EAA4B,QAAnB,EAAAtJ,EAAE0qD,UAAUphD,UAAO,eAAE85B,GAC9BztB,EAAM1U,KAAKqI,SAEXA,IACC+L,EAAc/L,GAAQiM,IAAMA,GAAOD,EAAMD,EAAc/L,GAAQgM,MAMlE,IAJAI,EAAMpM,EAGNA,EAAStI,EACFsI,GAAUA,IAAWoM,GAC1BE,EAAM3U,KAAKqI,GACXA,EAA4B,QAAnB,EAAAtJ,EAAE0qD,UAAUphD,UAAO,eAAE85B,GAGhC,MAAO,CAAE1tB,MAAKG,KAAMF,EAAMtO,OAAOuO,EAAM3I,WAAY,EAWhC6I,CACf9V,EACAqV,EACAm9C,EAAa7+C,OACb6+C,EAAa9+C,QAETmC,EAAOJ,EAASI,KAChBH,EAAMD,EAASC,IACrB,IAAIK,EAAU,EACVC,EAAQH,EAAKE,GACbE,GAAY,EAEhB,KAAOpV,IAAM2xD,EAAa9+C,QAAQ,CAGhC,GAFAhR,EAAO1C,EAAEgpD,QAAQnoD,GAEboV,EAAW,CACb,KACED,IAAUN,IACM,QAAhB,EAAA1V,EAAEgpD,QAAQhzC,UAAM,eAAEwT,KAAKzmB,SAAWL,EAAK8mB,KAAKvnB,MAE5C8T,IACAC,EAAQH,EAAKE,GAGXC,IAAUN,IACZO,GAAY,E,CAIhB,IAAKA,EAAW,CACd,KACEF,EAAUF,EAAKlT,OAAS,IACK,QAA7B,EAAA3C,EAAEgpD,QAAQnzC,EAAKE,EAAU,WAAI,eAAEyT,KAAK1mB,UAAYJ,EAAK8mB,KAAKvnB,MAE1D8T,IAEFC,EAAQH,EAAKE,E,CAGX/V,EAAE4Q,QAAQoF,IACZhW,EAAEwC,UAAU3B,EAAGmV,GAGjBnV,EAAIb,EAAEmqD,cAActpD,GAAI,GAAGuiC,E,IAE7B,EDwBFn7B,CAAkBjI,EAAGyP,GrBjIU,CAACzP,IAChC,MAAMY,EAAOC,IACX,MAAM4B,EAAWzC,EAAEyqD,YAAY5pD,GACzB6B,EAAO1C,EAAEgpD,QAAQnoD,GAKvB,IAJI4B,aAAQ,EAARA,EAAUE,SACZF,EAAS/B,SAASmO,GAAUjO,EAAIiO,EAAMu0B,MAGpC1gC,EAAK8mB,KAAKkB,eAAe,WAAY,CACvChoB,EAAK8mB,KAAK5mB,WAAa,GACvBF,EAAK8mB,KAAK3mB,YAAc,GACxB,IACE,IAAIZ,EAAOS,EAAK8mB,KAAK1mB,QAAUC,EAAUL,EAAK8mB,KAAKzmB,QAAW,EAC9Dd,EAAOc,EACPd,GAAQ,EAER,EAAcjC,EAAG,aAAc,MAAOa,EAAG6B,EAAMT,GAC/C,EAAcjC,EAAG,cAAe,MAAOa,EAAG6B,EAAMT,E,GAKtDjC,EAAEwqD,WAAW9pD,SAASmO,GAAUjO,EAAIiO,EAAMu0B,KAAI,EqB6G9Ch7B,CAAkBpI,GAEdswD,GEnIuB,EAACtwD,EAAUgyD,KACtC,MAGM7/C,EAHcnS,EAAE0oD,cAAc36C,QAAQlN,I,MAC1C,QAA2B,QAAnB,EAAAb,EAAEyqD,YAAY5pD,EAAEuiC,WAAG,eAAEzgC,OAAM,IAEXiE,KAAK/F,GAAMA,EAAE2oB,KAAKvnB,OACtCc,EAAUyD,KAAKC,OAAO0L,GACtBxH,EAAiB,GACvB,IAAK,IAAIjF,EAAI,EAAGA,EAAI3C,EAAU,EAAG2C,IAC/BiF,EAAOjF,GAAK,GAGdssD,SAAAA,EAAWtxD,SAASu0B,IAClB,MAAMvyB,EAAO1C,EAAEgpD,QAAQ/zB,GAElBvyB,IAAQA,EAAK8mB,KAAKhf,QAGlBg0C,MAAM97C,EAAK8mB,KAAKvnB,QACnBS,EAAK8mB,KAAKwmC,SAAWrlD,EAAOjI,EAAK8mB,KAAKvnB,MAAOU,OAC7CgI,EAAOjI,EAAK8mB,KAAKvnB,MAAOhB,KAAKg0B,I,GAE/B,EF+GA09B,CAAc3yD,EAAGgyD,GTjHA,EAAChyD,EAAWswD,KAC/B,MAAMsC,EAAS7vD,EAAQ/C,GACjB6yD,EAAS,GACTC,EAAS,GACf,IAAK,IAAIptD,EAAI,EAAGA,EAAIktD,EAAS,EAAGltD,IAAKmtD,EAAO5xD,KAAKyE,GACjD,IAAK,IAAIA,EAAIktD,EAAS,EAAGltD,GAAK,EAAGA,IAAKotD,EAAO7xD,KAAKyE,GAClD,MAAMgN,EAAkBR,EAAiBlS,EAAG6yD,EAAQ,MAC9ClgD,EAAgBT,EAAiBlS,EAAG8yD,EAAQ,OAElD,IAAIlhD,EAAWC,EAAU7R,GACzByS,EAAYzS,EAAG4R,GAEf,IACIgB,EADAC,EAASjH,OAAOC,kBAEpB,IAAK,IAAInG,EAAI,EAAGoN,EAAW,EAAGA,EAAW,IAAKpN,IAAKoN,EAAU,CAC3DV,EACE1M,EAAI,EAAIgN,EAAkBC,EAC1BjN,EAAI,GAAK,GACT,EACA4qD,GAGF1+C,EAAW,EAAiB5R,GAC5B,MAAMyR,EAAKK,EAAW9R,EAAG4R,GACrBH,EAAKoB,IACPC,EAAW,EACXF,EAAO,EAAMhB,GACbiB,EAASpB,E,CAKbG,EAAWC,EAAU7R,GACrByS,EAAYzS,EAAG4R,GACf,IAAK,IAAIlM,EAAI,EAAGoN,EAAW,EAAGA,EAAW,IAAKpN,IAAKoN,EAAU,CAC3DV,EACE1M,EAAI,EAAIgN,EAAkBC,EAC1BjN,EAAI,GAAK,GACT,EACA4qD,GAGF1+C,EAAW,EAAiB5R,GAC5B,MAAMyR,EAAKK,EAAW9R,EAAG4R,GACrBH,EAAKoB,IACPC,EAAW,EACXF,EAAO,EAAMhB,GACbiB,EAASpB,E,CAGbgB,EAAYzS,EAAG4S,EAAM,ESkErBtK,CAAMtI,EAAGswD,GAETxlD,GAAgB9K,GpB3IH,EAACA,EAAUyD,KACxB,MAAMsvD,EAAKtvD,EAAQC,cACR,OAAPqvD,GAAsB,OAAPA,GACjB/vD,EAAgBhD,E,EoB0IlBuD,CAAuBvD,EAAGyD,GAE1B8E,GAASvI,EAAG,CACV+X,QACAvK,UACAD,UACA5D,YAGFuB,GAAkBlL,GAElByL,GAAkBzL,GlBrEP,EAACA,EAAWyP,KACvBA,EAAY/O,SAASG,IACnB,IAAI6B,EAAO1C,EAAEgpD,QAAQnoD,GACrB,MAAM,KAAE2oB,GAAS9mB,EACX8vD,EAAehpC,EAAKgpC,aAE1B,IAAIxxD,EAEAwxD,GACFxyD,EAAEmtD,QAAQqF,GAGZ,IAAIQ,EAAWnyD,EACf,KAAO6B,EAAK8mB,KAAKhf,OACfxJ,EAAIhB,EAAEmqD,cAAc6I,GAAW,GAC/BhzD,EAAEoH,WAAW4rD,GACbR,EAAahpC,KAAK7lB,OAAQ1C,KAAK,CAC7BqC,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,IAEXV,EAAK8mB,KAAKhf,QAAUklD,IACtB8C,EAAahpC,KAAKlmB,EAAIZ,EAAK8mB,KAAKlmB,EAChCkvD,EAAahpC,KAAKpmB,EAAIV,EAAK8mB,KAAKpmB,EAChCovD,EAAahpC,KAAKtnB,MAAQQ,EAAK8mB,KAAKtnB,MACpCswD,EAAahpC,KAAKrnB,OAASO,EAAK8mB,KAAKrnB,QAEvC6wD,EAAWhyD,EAAEoiC,GACb1gC,EAAO1C,EAAEgpD,QAAQgK,E,GAEnB,EkB0CF,CAAchzD,EAAGyP,GAEjB/D,GAAqB1L,GpBrJV,EAACA,EAAUyD,KACtB,MAAMsvD,EAAKtvD,EAAQC,cACR,OAAPqvD,GAAsB,OAAPA,GAyBJ,CAAC/yD,IAChBA,EAAE0oD,cAAchoD,SAASG,IACvBsC,EAAYtC,EAAE2oB,KAAK,IAGrBxpB,EAAE2qD,cAAcjqD,SAASL,I,MACP,QAAhB,EAAAA,EAAKmpB,KAAK7lB,cAAM,SAAEjD,SAASie,GAAiBxb,EAAYwb,KACpDte,EAAKmpB,KAAKkB,eAAe,MAC3BvnB,EAAY9C,EAAKmpB,K,GAEnB,EAlCA5lB,CAAS5D,GAGA,OAAP+yD,GAAsB,OAAPA,IAwCN,CAAC/yD,IACdA,EAAE0oD,cAAchoD,SAASG,IACvBwC,EAAUxC,EAAE2oB,KAAK,IAGnBxpB,EAAE2qD,cAAcjqD,SAASL,I,MACP,QAAhB,EAAAA,EAAKmpB,KAAK7lB,cAAM,SAAEjD,SAASie,GAAiBtb,EAAUsb,KAClDte,EAAKmpB,KAAKkB,eAAe,MAC3BrnB,EAAUhD,EAAKmpB,K,GAEjB,EAjDA3lB,CAAO7D,GACPgD,EAAgBhD,G,EoB+IlB,CAAqBA,EAAGyD,GAExB,MAAM,MAAEvB,EAAK,OAAEC,GAAWsK,GAAezM,GAQzC,OANAgN,GAAqBhN,GAErBkN,GAA8BlN,GvBtHnB,CAACA,IACZA,EAAE2qD,cAAcjqD,SAASN,IACvB,MAAMe,EAAQf,EAAEopB,KAChB,GAAIroB,EAAMI,SAAU,CAClBvB,EAAEoB,WAAWhB,EAAEgjC,IAEf,MAAM/hC,EAAcF,EAAME,mBACnBF,EAAMI,gBACNJ,EAAME,YACbrB,EAAEmtD,QAAQ,CACR/pB,GAAIhjC,EAAEgjC,GACNzvB,OAAQvT,EAAEsT,OACVA,OAAQtT,EAAEuT,OACV6V,KAAM,OAAF,wBAAOroB,GAAK,CAAEE,iB,IAGtB,EuBwGFK,CAAY1B,GAEL,CAAEkC,QAAOC,SAAQ,EA2DpBiH,GAAe,CAAC,QAAS,SAAU,QAAS,YAC5CC,GAAe,CAAEnH,MAAO,EAAGC,OAAQ,GACnCqH,GAAe,CAAC,SAAU,SAAU,QAAS,SAAU,eACvDD,GAAe,CACnBK,OAAQ,EACRtJ,OAAQ,EACR4B,MAAO,EACPC,OAAQ,EACR2H,YAAa,GACbD,SAAU,KAENJ,GAAY,CAAC,YAuGbU,GAA0BnK,IAC9BA,EAAE2qD,cAAcjqD,SAASN,IACvB,GAAIA,EAAEopB,KAAKtnB,OAAS9B,EAAEopB,KAAKrnB,OAAQ,CACjC,MAAMtB,EAAIb,EAAEgpD,QAAQ5oD,EAAEuT,QAEhBxS,EAAQ,CACZf,EACA6B,MAHQjC,EAAEgpD,QAAQ5oD,EAAEsT,QAGX8V,KAAKvnB,KAAQpB,EAAE2oB,KAAKvnB,MAAS,EAAIpB,EAAE2oB,KAAKvnB,MAEnDM,EAAavC,EAAG,aAAcmB,EAAO,M,IAEvC,EAGEoJ,GAAoBvK,IACxB,IAAI+C,EAAU,EASd,OARA/C,EAAE0oD,cAAchoD,SAASgC,I,QACnBA,EAAK8mB,KAAKnf,YACZ3H,EAAK8mB,KAAK1mB,QAA8C,QAApC,EAAA9C,EAAEgpD,QAAQtmD,EAAK8mB,KAAKnf,kBAAgB,eAAEmf,KAAKvnB,KAC/DS,EAAK8mB,KAAKzmB,QAAiD,QAAvC,EAAA/C,EAAEgpD,QAAQtmD,EAAK8mB,KAAKlf,qBAAmB,eAAEkf,KAAKvnB,KAClEc,EAAUyD,KAAKC,IAAI1D,EAASL,EAAK8mB,KAAKzmB,UAAW,K,IAI9CA,CAAO,EAGV2H,GAA0B1K,IAC9BA,EAAE0oD,cAAchoD,SAASgC,IACC,eAApBA,EAAK8mB,KAAKhf,QACZxK,EAAEkpD,QAAQxmD,EAAK8mB,KAAKppB,EAAGgjC,IAAK5Z,KAAK/e,UAAY/H,EAAK8mB,KAAKvnB,KACvDjC,EAAEoH,WAAW1E,EAAK0gC,I,GAEpB,EAGE32B,GAAiB,CACrBzM,EACA4mB,KAKA,IAAIjb,EAEAI,EADAD,EAAO,EAEPE,EAAO,EAEX,MAAQG,QAASD,EAAU,EAAGG,QAASD,EAAU,GAAMwa,GAAW,CAAC,EAE7Dta,EAAepJ,IACnB,IAAKA,EAAMsmB,KAAM,OACjB,MAAMlmB,EAAIJ,EAAMsmB,KAAKlmB,EACfF,EAAIF,EAAMsmB,KAAKpmB,EACfpC,EAAIkC,EAAMsmB,KAAKtnB,MACfkD,EAAIlC,EAAMsmB,KAAKrnB,OAChBq8C,MAAMl7C,IAAOk7C,MAAMx9C,UACT0G,IAATiE,IACFA,EAAOrI,EAAItC,EAAI,GAEjB2K,EAAOnF,KAAK+F,IAAIZ,EAAMrI,EAAItC,EAAI,GAC9B8K,EAAOtF,KAAKC,IAAIqF,EAAMxI,EAAItC,EAAI,IAE3Bw9C,MAAMp7C,IAAOo7C,MAAMp5C,UACTsC,IAATqE,IACFA,EAAO3I,EAAIgC,EAAI,GAEjB2G,EAAOvF,KAAK+F,IAAIR,EAAM3I,EAAIgC,EAAI,GAC9B4G,EAAOxF,KAAKC,IAAIuF,EAAM5I,EAAIgC,EAAI,G,EAkClC,OA9BApF,EAAE0oD,cAAchoD,SAASG,IACvByL,EAAYzL,EAAE,IAEhBb,EAAE2qD,cAAcjqD,SAASN,KACnBA,aAAC,EAADA,EAAGopB,KAAKkB,eAAe,OACzBpe,EAAYlM,E,IAIhBuL,GAASO,EACTH,GAASK,EAETpM,EAAE0oD,cAAchoD,SAASgC,IACvBA,EAAK8mB,KAAKlmB,GAAMqI,EAChBjJ,EAAK8mB,KAAKpmB,GAAM2I,CAAI,IAGtB/L,EAAE2qD,cAAcjqD,SAASL,I,MACP,QAAhB,EAAAA,EAAKmpB,KAAK7lB,cAAM,SAAEjD,SAAS8L,IACzBA,EAAElJ,GAAKqI,EACPa,EAAEpJ,GAAK2I,CAAI,IAET1L,EAAKmpB,KAAKkB,eAAe,OAC3BrqB,EAAKmpB,KAAKlmB,GAAMqI,GAEdtL,EAAKmpB,KAAKkB,eAAe,OAC3BrqB,EAAKmpB,KAAKpmB,GAAM2I,E,IAIb,CACL7J,MAAO4J,EAAOH,EAAQO,EACtB/J,OAAQ6J,EAAOD,EAAQK,EACxB,EAGGY,GAAwBhN,IAC5BA,EAAE2qD,cAAcjqD,SAASN,IACvB,MAAMwM,EAAQ5M,EAAEgpD,QAAQ5oD,EAAEuT,QACpB9G,EAAQ7M,EAAEgpD,QAAQ5oD,EAAEsT,QAC1B,IAAIhH,EACAC,EACCvM,EAAEopB,KAAK7lB,QAKV+I,EAAKtM,EAAEopB,KAAK7lB,OAAO,GACnBgJ,EAAKvM,EAAEopB,KAAK7lB,OAAOvD,EAAEopB,KAAK7lB,OAAOhB,OAAS,KAL1CvC,EAAEopB,KAAK7lB,OAAS,GAChB+I,EAAK,CAAEpJ,EAAGuJ,EAAM2c,KAAKlmB,EAAIF,EAAGyJ,EAAM2c,KAAKpmB,GACvCuJ,EAAK,CAAErJ,EAAGsJ,EAAM4c,KAAKlmB,EAAIF,EAAGwJ,EAAM4c,KAAKpmB,IAMzChD,EAAEopB,KAAK7lB,OAAOmJ,QAAQC,EAAcH,EAAM4c,KAAM9c,IAChDtM,EAAEopB,KAAK7lB,OAAO1C,KAAK8L,EAAcF,EAAM2c,KAAM7c,GAAI,GACjD,EAGEjB,GAAwB1L,IAC5BA,EAAE2qD,cAAcjqD,SAASL,IACvB,GAAIA,EAAKmpB,KAAKkB,eAAe,KAI3B,OAH2B,MAAvBrqB,EAAKmpB,KAAK3f,UAA2C,MAAvBxJ,EAAKmpB,KAAK3f,WAC1CxJ,EAAKmpB,KAAKtnB,OAAU7B,EAAKmpB,KAAK1f,aAExBzJ,EAAKmpB,KAAK3f,UAChB,IAAK,IACHxJ,EAAKmpB,KAAKlmB,GAAMjD,EAAKmpB,KAAKtnB,MAAS,EAAI7B,EAAKmpB,KAAK1f,YACjD,MACF,IAAK,IACHzJ,EAAKmpB,KAAKlmB,GAAMjD,EAAKmpB,KAAKtnB,MAAS,EAAI7B,EAAKmpB,KAAK1f,Y,GAIvD,EAGEoD,GAAiClN,IACrCA,EAAE2qD,cAAcjqD,SAASL,I,MACnBA,EAAKmpB,KAAKjoB,WACI,QAAhB,EAAAlB,EAAKmpB,KAAK7lB,cAAM,SAAEsJ,U,GAEpB,EAGExB,GAAqBzL,IACzBA,EAAE0oD,cAAchoD,SAASG,I,UACvB,GAAuB,QAAnB,EAAAb,EAAEyqD,YAAY5pD,EAAEuiC,WAAG,eAAEzgC,OAAQ,CAC/B,MAAMD,EAAO1C,EAAEgpD,QAAQnoD,EAAEuiC,IACnBj4B,EAAInL,EAAEgpD,QAAQtmD,EAAK8mB,KAAKnf,WACxBe,EAAIpL,EAAEgpD,QAAQtmD,EAAK8mB,KAAKlf,cACxBe,EAAIrL,EAAEgpD,QACTtmD,EAAK8mB,KAAK5mB,YACqB,QAA9B,EAACF,EAAK8mB,KAAK5mB,kBAAmB,eAAED,QAAS,IAGvC4I,EAAIvL,EAAEgpD,QACTtmD,EAAK8mB,KAAK3mB,aACsB,QAA/B,EAACH,EAAK8mB,KAAK3mB,mBAAoB,eAAEF,QAAS,IAI9CD,EAAK8mB,KAAKtnB,MAAQsE,KAAKgF,KAAID,aAAC,EAADA,EAAGie,KAAKlmB,IAAK+H,aAAC,EAADA,EAAGme,KAAKlmB,KAAO,GACvDZ,EAAK8mB,KAAKrnB,OAASqE,KAAKgF,KAAIJ,aAAC,EAADA,EAAGoe,KAAKpmB,IAAK+H,aAAC,EAADA,EAAGqe,KAAKpmB,KAAO,GACxDV,EAAK8mB,KAAKlmB,IAAK+H,aAAC,EAADA,EAAGme,KAAKlmB,IAAM,GAAKZ,EAAK8mB,KAAKtnB,MAAS,EACrDQ,EAAK8mB,KAAKpmB,IAAK+H,aAAC,EAADA,EAAGqe,KAAKpmB,IAAM,GAAKV,EAAK8mB,KAAKrnB,OAAU,C,KAI1DnC,EAAE0oD,cAAchoD,SAASu0B,IACF,WAAjBA,EAAEzL,KAAKhf,OACTxK,EAAEoH,WAAW6tB,EAAEmO,G,GAEjB,EAGEn5B,GAAmBjK,IACvBA,EAAE2qD,cAAcjqD,SAASN,IACvB,GAAIA,EAAEuT,SAAWvT,EAAEsT,OAAQ,CACzB,MAAMhR,EAAO1C,EAAEgpD,QAAQ5oD,EAAEuT,QACpBjR,EAAK8mB,KAAKxf,YACbtH,EAAK8mB,KAAKxf,UAAY,IAExBtH,EAAK8mB,KAAKxf,UAAU/I,KAAKb,GACzBJ,EAAEoB,WAAWhB,EAAEgjC,G,IAEjB,EAGEt4B,GAAmB9K,IACvB,MAAM2K,EAAS,EAAiB3K,GAChC2K,SAAAA,EAAQjK,SAAS+E,IACf,IAAImF,EAAa,EACjBnF,SAAAA,EAAO/E,SAAQ,CAACG,EAAO6E,K,MACrB,MAAMhD,EAAO1C,EAAEgpD,QAAQnoD,GACvB6B,EAAK8mB,KAAKlhB,MAAQ5C,EAAIkF,EACH,QAAnB,EAAAlI,EAAK8mB,KAAKxf,iBAAS,SAAEtJ,SAASmK,IAC5BtI,EACEvC,EACA,WACA,CACEkC,MAAO2I,EAAS2e,KAAKtnB,MACrBC,OAAQ0I,EAAS2e,KAAKrnB,OACtBF,KAAMS,EAAK8mB,KAAKvnB,KAChBqG,MAAO5C,KAAMkF,EACbxK,GAEF,MACD,WAEIsC,EAAK8mB,KAAKxf,SAAS,GAC1B,GACF,EAGEkB,GAAqBlL,IACzBA,EAAE0oD,cAAchoD,SAASG,IACvB,MAAM6B,EAAO1C,EAAEgpD,QAAQnoD,EAAEuiC,IACzB,GAAwB,aAApB1gC,EAAK8mB,KAAKhf,MAAsB,CAClC,MAAMO,EAAW/K,EAAEgpD,QAAQtmD,EAAK8mB,KAAKppB,EAAGuT,QAClCrQ,EAAIyH,EAASye,KAAKlmB,EAAKyH,EAASye,KAAKtnB,MAAS,EAC9CkB,EAAI2H,EAASye,KAAKpmB,EAClB4H,EAAKtI,EAAK8mB,KAAKlmB,EAAKA,EACpB2H,EAAKF,EAASye,KAAKrnB,OAAU,EAE/BnC,EAAEmd,QAAQza,EAAK8mB,KAAKppB,EAAGgjC,IACzBpjC,EAAE4tD,eAAelrD,EAAK8mB,KAAKppB,EAAGgjC,GAAI1gC,EAAK8mB,KAAKppB,EAAGopB,MAE/CxpB,EAAEmtD,QAAQ,CACR/pB,GAAI1gC,EAAK8mB,KAAKppB,EAAGgjC,GACjBzvB,OAAQjR,EAAK8mB,KAAKppB,EAAGuT,OACrBD,OAAQhR,EAAK8mB,KAAKppB,EAAGsT,OACrB8V,KAAM9mB,EAAK8mB,KAAKppB,EAAGopB,OAGvBxpB,EAAEoH,WAAWvG,EAAEuiC,IAEf1gC,EAAK8mB,KAAKppB,EAAGopB,KAAK7lB,OAAS,CACzB,CAAEL,EAAGA,EAAK,EAAI0H,EAAM,EAAG5H,EAAGA,EAAI6H,GAC9B,CAAE3H,EAAGA,EAAK,EAAI0H,EAAM,EAAG5H,EAAGA,EAAI6H,GAC9B,CAAE7H,IAAGE,EAAGA,EAAI0H,GACZ,CAAE1H,EAAGA,EAAK,EAAI0H,EAAM,EAAG5H,EAAGA,EAAI6H,GAC9B,CAAE3H,EAAGA,EAAK,EAAI0H,EAAM,EAAG5H,EAAGA,EAAI6H,IAGhCvI,EAAK8mB,KAAKppB,EAAGopB,KAAKlmB,EAAIZ,EAAK8mB,KAAKlmB,EAChCZ,EAAK8mB,KAAKppB,EAAGopB,KAAKpmB,EAAIV,EAAK8mB,KAAKpmB,C,IAElC,EAGE2F,GAAoB,CAAC0E,EAA0BvK,KACnD,MAAM+vD,EAAwC,CAAC,EAK/C,OAJA/vD,SAAAA,EAAOxC,SAASgiB,SACGhb,IAAb+F,EAAIiV,KACRuwC,EAAiBvwC,IAAQjV,EAAIiV,GAAI,IAE5BuwC,CAAgB,EAGnBrqD,GAAe,CAAC1F,EAA6B,CAAC,KAClD,MAAMyK,EAAgC,CAAC,EAIvC,OAHAyY,OAAO3D,KAAKvf,GAAOxC,SAAS6D,IAC1BoJ,EAASpJ,EAAEb,eAAiBR,EAAMqB,EAAE,IAE/BoJ,CAAQ,EGxmBjB,YAA0BuR,GACtB,MAAwB,mBAAVA,CACjB,ECLD,YAA0BA,GAOtB,IAAIjB,SAAciB,EAClB,OAAkB,OAAVA,GAA2B,WAATjB,GAA+B,aAATA,CACnD,ECAM,SAASi1C,GACd7yB,EACAnhB,GAEA,IAAIi0C,EAUJ,OAREA,EADE,GAAWj0C,GACAA,EACJ,EAASA,GAEL,IAAMA,EAGN,IAAMmhB,EAEd8yB,CACT,CASO,SAASC,GACd/yB,EACAnhB,EAMAm0C,GAA0B,GAE1B,OAAKn0C,GAAmB,IAAVA,EAeV,GAAWA,GACNA,EAEL,EAASA,GACJ,IAAMA,EAEX1N,MAAMoO,QAAQV,GACT,KACL,GAAIm0C,EAAgB,CAClB,MAAM5sD,EAAMD,KAAKC,OAAOyY,GACxB,OAAOs/B,MAAM/3C,GAAO45B,EAAe55B,C,CAErC,OAAOyY,CAAK,EAGZ,GAASA,GACJ,KACL,GAAIm0C,EAAgB,CAClB,MAAM5sD,EAAMD,KAAKC,IAAIyY,EAAMhd,MAAOgd,EAAM/c,QACxC,OAAOq8C,MAAM/3C,GAAO45B,EAAe55B,C,CAErC,MAAO,CAACyY,EAAMhd,MAAOgd,EAAM/c,OAAO,EAG/B,IAAMk+B,EAtCHtf,IACN,MAAM,KAAErF,GAASqF,EAAEyI,MAAQ,CAAC,EAC5B,OAAI9N,EACElK,MAAMoO,QAAQlE,GACTA,EAAK,GAAKA,EAAK,GAAKA,EAAK,GAAKA,EAAK,GAExC,GAA4CA,GACvCA,EAAKxZ,MAAQwZ,EAAKvZ,OAASuZ,EAAKxZ,MAAQwZ,EAAKvZ,OAE/CuZ,EAEF2kB,CAAY,CA4BzB,CAQO,MAAMizB,GAAiB,CAC5BC,EACAC,KAEA,IAAIC,EACAC,EAwCJ,OAtCEA,EADE,EAASF,GACO,IAAMA,EACf,GAAWA,GACFA,EAEA,IAAM,EAyBxBC,EAtBGF,EAqBM/hD,MAAMoO,QAAQ2zC,GACPxyC,IACFwyC,EAAS,GAAKA,EAAS,GAAKA,EAAS,GAAKA,EAAS,IAClDG,EAAgB3yC,GAEtB,GAAWwyC,GACLA,EAECxyC,GAAYwyC,EAAWG,EAAgB3yC,GA5BvCA,I,QACd,GAAU,QAAN,EAAAA,EAAEyI,YAAI,eAAEmqC,SACV,OACEntD,KAAKC,IAAIsa,EAAEyI,KAAKmqC,SAAS,GAAI5yC,EAAEyI,KAAKmqC,SAAS,IAAMD,EAAgB3yC,GAGvE,GAAU,QAAN,EAAAA,EAAEyI,YAAI,eAAE9N,KAAM,CAChB,GAAIlK,MAAMoO,QAAQmB,EAAEyI,KAAK9N,MACvB,OAAOlV,KAAKC,IAAIsa,EAAEyI,KAAK9N,KAAK,GAAIqF,EAAEyI,KAAK9N,KAAK,IAAMg4C,EAAgB3yC,GAEpE,MAAM6yC,EAAW7yC,EAAEyI,KAAK9N,KACxB,OAAI,GAA4Ck4C,IAE5CA,EAAS1xD,MAAQ0xD,EAASzxD,OAASyxD,EAAS1xD,MAAQ0xD,EAASzxD,QAClDuxD,EAAgB3yC,GAExB6yC,EAAWF,EAAgB3yC,E,CAEpC,OAAO,GAAK2yC,EAAgB3yC,EAAE,EAY3B0yC,CAAY,ECrIR,GAAY//C,IACvB,GAAe,OAAXA,EACF,OAAOA,EAET,GAAIA,aAAkBoqB,KACpB,OAAO,IAAIA,KAAKpqB,EAAOmgD,WAEzB,GAAIngD,aAAkBlC,MAAO,CAC3B,MAAMsiD,EAAK,GAIX,OAHCpgD,EAAiBhT,SAASG,IACzBizD,EAAG7yD,KAAKJ,EAAE,IAELizD,EAAGltD,KAAKquB,GAAW,GAAWA,I,CAEvC,GAAsB,iBAAXvhB,EAAqB,CAC9B,MAAMogD,EAAK,CAAC,EAIZ,OAHA1tC,OAAO3D,KAAK/O,GAAQhT,SAAS6D,IAC3BuvD,EAAGvvD,GAAK,GAAYmP,EAAenP,GAAG,IAEjCuvD,C,CAET,OAAOpgD,CAAM,EASFqgD,GAAkB,CAC7BrgD,EACAsgD,KAEA,MAAMC,EAAS,GAAMvgD,GAMrB,OALAugD,EAAOzqC,KAAOyqC,EAAOzqC,MAAQ,CAAC,EAC1BwqC,IACG,EAASC,EAAOzqC,KAAKlmB,KAAI2wD,EAAOzqC,KAAKlmB,EAAIkD,KAAK0hC,SAAW8rB,EAAU,IACnE,EAASC,EAAOzqC,KAAKpmB,KAAI6wD,EAAOzqC,KAAKpmB,EAAIoD,KAAK0hC,SAAW8rB,EAAU,KAEnEC,CAAM,ECNTC,GAA2D,CAC/DzwD,QAAS,KACT+J,QAAS,GACT7D,QAAS,GACTwqD,gBAAgB,EAChBr4C,OAAQ,aACRs4C,eAAe,EACfC,QAAQ,EACRC,UAAW,MCpCAC,GAAwB,CACnCr0D,EACA+wD,EACAzd,KAEA,MAAM7yC,EAAQT,EAAMwoD,cACd/mD,EAAQzB,EAAMyqD,cACpB,OAAKhqD,aAAK,EAALA,EAAOgC,QAIS,IAAjBhC,EAAMgC,QACJsuD,GACF/wD,EAAMysD,cAAchsD,EAAM,GAAGyiC,GAAI,CAC/B9/B,EAAGkwC,EAAO,GACVpwC,EAAGowC,EAAO,KAGC,CACb7yC,MAAO,C,+BAEAA,EAAM,IAAE,CACX6oB,KAAM,OAAF,wBACC7oB,EAAM,GAAG6oB,MAAI,CAChBlmB,EAAGkwC,EAAO,GACVpwC,EAAGowC,EAAO,QAIhB7xC,eAlBJ,EAHiB,CAAEhB,MAAO,GAAagB,Q,ECJnC,GAA0D,CAC9D6yD,OAAQ,KACRC,YAAa,KACbC,UAAW,KACXC,WAAY,EACZC,SAAU,EAAIpuD,KAAKquD,GACnBC,WAAW,EACXC,UAAW,EACXC,SAAU,KACVC,WAAY,GA+KRC,GAAmB,CACvBh1D,EACAS,EACA6a,GAAoB,KAEpB,MAAM25C,EAA2B,CAACpB,GAAgBpzD,EAAM,KAClDy0D,EAAuC,CAAC,EACxCngC,EAAIt0B,EAAMgC,OAChByyD,EAAUz0D,EAAM,GAAGyiC,KAAM,EAEzB,IAAI7+B,EAAI,EA6CR,OA5CA5D,EAAMD,SAAQ,CAACgC,EAAMgD,KACnB,GAAU,IAANA,EACF,GACGA,IAAMuvB,EAAI,GACT/0B,EAAMgqD,UAAUxnD,EAAK0gC,GAAI,UACvBljC,EAAMgqD,UAAUvpD,EAAM+E,EAAI,GAAG09B,GAAI,UACnCljC,EAAMypD,aAAawL,EAAc5wD,GAAG6+B,GAAI1gC,EAAK0gC,KAC9CgyB,EAAU1yD,EAAK0gC,IAKX,CACL,MAAM3gC,EAAW+Y,EACbtb,EAAMiqD,cAAcgL,EAAc5wD,GAAG6+B,IACrCljC,EAAM4pD,aAAaqL,EAAc5wD,GAAG6+B,IACxC,IAAIiyB,GAAa,EACjB,IAAK,IAAIn0C,EAAI,EAAGA,EAAIze,EAASE,OAAQue,IAAK,CACxC,MAAMrS,EAAQpM,EAASye,GACvB,GACEhhB,EAAMgqD,UAAUr7C,EAAMu0B,MAAQljC,EAAMgqD,UAAUxnD,EAAK0gC,MAClDgyB,EAAUvmD,EAAMu0B,IACjB,CACA+xB,EAAcl0D,KAAK8yD,GAAgBllD,IACnCumD,EAAUvmD,EAAMu0B,KAAM,EACtBiyB,GAAa,EACb,K,EAGJ,IAAInV,EAAK,EACT,MAAQmV,IACDD,EAAUz0D,EAAMu/C,GAAI9c,MACvB+xB,EAAcl0D,KAAK8yD,GAAgBpzD,EAAMu/C,KACzCkV,EAAUz0D,EAAMu/C,GAAI9c,KAAM,EAC1BiyB,GAAa,GAEfnV,IACIA,IAAOjrB,K,MA5BbkgC,EAAcl0D,KAAK8yD,GAAgBrxD,IACnC0yD,EAAU1yD,EAAK0gC,KAAM,EACrB7+B,G,IAiCC4wD,CAAa,EC3PtB,YAA0BxvB,GACtB,OAAO,EAAOA,EAAK,SACtB,ECHY/lB,GAAUpO,MAAMoO,QCcvB,GAA4D,CAChE2zC,SAAU,GACVC,YAAa,GACb8B,gBAAgB,EAChBC,WAAO7tD,EACP8tD,aAAa,EACbb,WAAY,IAAUnuD,KAAKquD,GAC3BC,WAAW,EACXW,kBAAc/tD,EACd2G,OAAQ,UAkBH,MAAMqnD,GAGX,WAAA9vC,CACSgB,EAAmC,CAAC,GAApC,KAAAA,QAAAA,EAHT,KAAAwc,GAAK,aAKHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAK0xD,yBAAwB,EAAO11D,EAAO0mB,EACpD,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAK0xD,yBAAwB,EAAM11D,EAAO0mB,EAC5C,G,CAYc,uBAAAgvC,CACZ3E,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,IAE1C4sB,OAAQsiB,EACR5zD,MAAO6zD,EACP5zD,OAAQ6zD,EACR3nD,OAAQ4nD,EACRR,aAAcS,EACdX,MAAOY,EAAU,UACjBrB,EAAS,YACTU,EAAW,eACXF,EAAc,WACdX,EAAa,IAAUnuD,KAAKquD,GAAE,SAC9BtB,EAAQ,YACRC,GACEqC,EAEEl1D,EAAQT,EAAMwoD,cACd/mD,EAAQzB,EAAMyqD,cAEdzoD,EACH6zD,GAAgC,oBAAXhwD,OAEjBgwD,EADDhwD,OAAOqwD,WAEPj0D,EACH6zD,GAAiC,oBAAXjwD,OAElBiwD,EADDjwD,OAAOswD,YAEP7iB,EACHsiB,GAAc,CAAC5zD,EAAQ,EAAGC,EAAS,GAGtC,KAAKxB,aAAK,EAALA,EAAOgC,SAA2B,IAAjBhC,EAAMgC,OAC1B,OAAO4xD,GAAsBr0D,EAAO+wD,EAAQzd,GAG9C,MAAM8iB,EAAyB,GAC/B,IAAIC,EACAC,EAAyB,EACzB52C,GAAQ2zC,GACVgD,EAAc/vD,KAAKC,IAAI8sD,EAAS,GAAIA,EAAS,IACpC,GAAWA,IACpBgD,GAAc,IACd51D,EAAMD,SAASgC,IACb,MAAM+zD,EAAclD,EAAS7wD,GACzB+zD,EAAcF,IAAaA,EAAcE,EAAW,KAG1DF,EAAchD,EAEZ3zC,GAAQ4zC,GACVgD,EAAiBhwD,KAAKC,IAAI+sD,EAAY,GAAIA,EAAY,IAC7C,EAASA,KAClBgD,EAAiBhD,GAEnB7yD,EAAMD,SAASgC,IACb,MAAMg0D,EAAQ3C,GAAgBrxD,GAC9B4zD,EAAYr1D,KAAKy1D,GACjB,IAAInD,EAAmBgD,EACvB,MAAM,KAAE/sC,GAASktC,EACb92C,GAAQ4J,EAAK9N,MACf63C,EAAW/sD,KAAKC,IAAI+iB,EAAK9N,KAAK,GAAI8N,EAAK9N,KAAK,IACnC,EAAS8N,EAAK9N,MACvB63C,EAAW/pC,EAAK9N,KACP,GAAS8N,EAAK9N,QACvB63C,EAAW/sD,KAAKC,IACb+iB,EAAK9N,KAAaxZ,MAClBsnB,EAAK9N,KAAavZ,SAGvBo0D,EAAc/vD,KAAKC,IAAI8vD,EAAahD,GAEhC,GAAWC,KACbgD,EAAiBhwD,KAAKC,IAAI+sD,EAAY9wD,GAAO8zD,G,IAKjD,MAAMG,EAAuB,CAAC,EAC9BL,EAAY51D,SAAQ,CAACgC,EAAMgD,KACzBixD,EAAWj0D,EAAK0gC,IAAM19B,CAAC,IAIzB,IAAI2I,EAAS4nD,EAEV,GAAS5nD,SAC+B3G,IAAxC4uD,EAAY,GAAW9sC,KAAKnb,KAE7BA,EAAS,UAEI,WAAXA,EACFioD,EAAYriD,MACV,CAAC2iD,EAAUC,IACT32D,EAAMgqD,UAAU2M,EAAGzzB,GAAI,QAAUljC,EAAMgqD,UAAU0M,EAAGxzB,GAAI,UAI5DkzB,EAAYriD,MACV,CAAC2iD,EAAUC,IACRA,EAAWrtC,KAAKnb,GAAWuoD,EAAWptC,KAAKnb,KAIlD,MAAMyoD,EAAeR,EAAY,GAC3Bb,GACHS,IACa,WAAX7nD,EACGnO,EAAMgqD,UAAU4M,EAAa1zB,GAAI,QAChC0zB,EAAqBttC,KAAKnb,KAAY,EAGzC0oD,EAIA,CAAC,CAAEp2D,MAAO,KAChB,IAAIq2D,EAAeD,EAAO,GAC1BT,EAAY51D,SAASgC,IACnB,GAAIs0D,EAAar2D,MAAMgC,OAAS,EAAG,CACjC,MAAMghD,EACO,WAAXt1C,EACI7H,KAAKgF,IACHtL,EAAMgqD,UAAU8M,EAAar2D,MAAM,GAAGyiC,GAAI,QACxCljC,EAAMgqD,UAAUxnD,EAAK0gC,GAAI,SAE7B58B,KAAKgF,IACFwrD,EAAar2D,MAAM,GAAG6oB,KAAKnb,GACzB3L,EAAa8mB,KAAKnb,IAGzBonD,GAAgB9R,GAAQ8R,IAC1BuB,EAAe,CAAEr2D,MAAO,IACxBo2D,EAAO91D,KAAK+1D,G,CAGhBA,EAAar2D,MAAMM,KAAKyB,EAAK,IAI/B,IAAIu0D,EAAUV,EAAcC,EAC5B,IAAKlB,EAAgB,CAEnB,MAAM4B,EAAmBH,EAAOp0D,OAAS,GAAKo0D,EAAO,GAAGp2D,MAAMgC,OAAS,EAEjEw0D,GADO3wD,KAAK+F,IAAIrK,EAAOC,GAAU,EAAI80D,IACrBF,EAAOp0D,QAAUu0D,EAAmB,EAAI,IAE9DD,EAAUzwD,KAAK+F,IAAI0qD,EAASE,E,CAI9B,IAAI5rD,EAAI,EAuBR,GAtBAwrD,EAAOr2D,SAAS02D,IACd,MAAM7B,OACW7tD,IAAfyuD,EACI,EAAI3vD,KAAKquD,GAAM,EAAIruD,KAAKquD,GAAMuC,EAAMz2D,MAAMgC,OAC1CwzD,EAIN,GAHAiB,EAAMC,OAAS9B,EAAQ/uD,KAAKC,IAAI,EAAG2wD,EAAMz2D,MAAMgC,OAAS,GAGpDy0D,EAAMz2D,MAAMgC,OAAS,GAAK2yD,EAAgB,CAE5C,MAAMgC,EAAO9wD,KAAKqyC,IAAIue,EAAMC,QAAU7wD,KAAKqyC,IAAI,GACzC0e,EAAO/wD,KAAK6yC,IAAI+d,EAAMC,QAAU7wD,KAAK6yC,IAAI,GACzCme,EAAOhxD,KAAK+lC,KACf0qB,EAAUA,GAAYK,EAAOA,EAAOC,EAAOA,IAG9ChsD,EAAI/E,KAAKC,IAAI+wD,EAAMjsD,E,CAErB6rD,EAAM7rD,EAAIA,EACVA,GAAK0rD,CAAO,IAGVzB,EAAa,CACf,IAAIiC,EAAY,EACZC,EAAK,EACT,IAAK,IAAIhyD,EAAI,EAAGA,EAAIqxD,EAAOp0D,OAAQ+C,IAAK,CACtC,MACMiyD,GADQZ,EAAOrxD,GACC6F,GAAK,GAAKmsD,EAChCD,EAAYjxD,KAAKC,IAAIgxD,EAAWE,E,CAElCD,EAAK,EACLX,EAAOr2D,SAAQ,CAAC02D,EAAO1xD,KACX,IAANA,IACFgyD,EAAKN,EAAM7rD,GAAK,GAElB6rD,EAAM7rD,EAAImsD,EACVA,GAAMD,CAAS,G,CA6BnB,OAxBAV,EAAOr2D,SAAS02D,IACd,MAAMC,EAASD,EAAMC,QAAU,EACzBK,EAAKN,EAAM7rD,GAAK,EACtB6rD,EAAMz2D,MAAMD,SAAQ,CAACgC,EAAewe,KAClC,MAAM02C,EAAQjD,GAAcG,EAAY,GAAK,GAAKuC,EAASn2C,EAC3Dxe,EAAK8mB,KAAKlmB,EAAIkwC,EAAO,GAAKkkB,EAAKlxD,KAAKqyC,IAAI+e,GACxCl1D,EAAK8mB,KAAKpmB,EAAIowC,EAAO,GAAKkkB,EAAKlxD,KAAK6yC,IAAIue,EAAM,GAC9C,IAGA3G,GACFqF,EAAY51D,SAASgC,GACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,MAKJ,CACbzC,MAAO21D,EACP30D,QAIJ,G,ECpSF,SAAS,GAAI4P,EAAMjO,EAAGF,EAAG2d,GACvB,GAAIy9B,MAAMl7C,IAAMk7C,MAAMp7C,GAAI,OAAOmO,EAEjC,IAAIjI,EAOAuuD,EACAC,EACAC,EACAC,EACAC,EACArpD,EACAlJ,EACAwb,EAbAxe,EAAO6O,EAAK2mD,MACZC,EAAO,CAAC3uC,KAAMzI,GACdq3C,EAAK7mD,EAAK8mD,IACVC,EAAK/mD,EAAKgnD,IACVC,EAAKjnD,EAAKknD,IACVC,EAAKnnD,EAAKonD,IAWd,IAAKj2D,EAAM,OAAO6O,EAAK2mD,MAAQC,EAAM5mD,EAGrC,KAAO7O,EAAKC,QAGV,IAFIs1D,EAAQ30D,IAAMu0D,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACtDjpD,EAASxL,IAAM00D,GAAMQ,EAAKI,GAAM,IAAIJ,EAAKR,EAASY,EAAKZ,EACvDxuD,EAAS5G,IAAQA,EAAOA,EAAKgD,EAAIkJ,GAAU,EAAIqpD,IAAS,OAAO3uD,EAAO5D,GAAKyyD,EAAM5mD,EAMvF,GAFAwmD,GAAMxmD,EAAKqnD,GAAG3xC,KAAK,KAAMvkB,EAAK8mB,MAC9BwuC,GAAMzmD,EAAKsnD,GAAG5xC,KAAK,KAAMvkB,EAAK8mB,MAC1BlmB,IAAMy0D,GAAM30D,IAAM40D,EAAI,OAAOG,EAAKjS,KAAOxjD,EAAM4G,EAASA,EAAO5D,GAAKyyD,EAAO5mD,EAAK2mD,MAAQC,EAAM5mD,EAGlG,GACEjI,EAASA,EAASA,EAAO5D,GAAK,IAAI8L,MAAM,GAAKD,EAAK2mD,MAAQ,IAAI1mD,MAAM,IAChEymD,EAAQ30D,IAAMu0D,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACtDjpD,EAASxL,IAAM00D,GAAMQ,EAAKI,GAAM,IAAIJ,EAAKR,EAASY,EAAKZ,SACnDpyD,EAAIkJ,GAAU,EAAIqpD,KAAY/2C,GAAK82C,GAAMF,IAAO,EAAKC,GAAMF,IACrE,OAAOvuD,EAAO4X,GAAKxe,EAAM4G,EAAO5D,GAAKyyD,EAAM5mD,CAC7C,CC/Ce,YAAS7O,EAAM01D,EAAIE,EAAIE,EAAIE,GACxCx0D,KAAKxB,KAAOA,EACZwB,KAAKk0D,GAAKA,EACVl0D,KAAKo0D,GAAKA,EACVp0D,KAAKs0D,GAAKA,EACVt0D,KAAKw0D,GAAKA,CACZ,CCNO,SAASI,GAAS/3C,GACvB,OAAOA,EAAE,EACX,CCFO,SAASg4C,GAASh4C,GACvB,OAAOA,EAAE,EACX,CCWe,SAASi4C,GAASr4D,EAAO2C,EAAGF,GACzC,IAAImO,EAAO,IAAI0nD,GAAc,MAAL31D,EAAYw1D,GAAWx1D,EAAQ,MAALF,EAAY21D,GAAW31D,EAAGuoC,IAAKA,IAAKA,IAAKA,KAC3F,OAAgB,MAAThrC,EAAgB4Q,EAAOA,EAAK2nD,OAAOv4D,EAC5C,CAEA,SAASs4D,GAAS31D,EAAGF,EAAGg1D,EAAIE,EAAIE,EAAIE,GAClCx0D,KAAK00D,GAAKt1D,EACVY,KAAK20D,GAAKz1D,EACVc,KAAKm0D,IAAMD,EACXl0D,KAAKq0D,IAAMD,EACXp0D,KAAKu0D,IAAMD,EACXt0D,KAAKy0D,IAAMD,EACXx0D,KAAKg0D,WAAQxwD,CACf,CAEA,SAASyxD,GAAUhB,GAEjB,IADA,IAAIxyC,EAAO,CAAC6D,KAAM2uC,EAAK3uC,MAAO08B,EAAOvgC,EAC9BwyC,EAAOA,EAAKjS,MAAMA,EAAOA,EAAKA,KAAO,CAAC18B,KAAM2uC,EAAK3uC,MACxD,OAAO7D,CACT,CAEA,IAAIyzC,GAAYJ,GAASx0D,UAAYy0D,GAASz0D,UC3B9C,SAAS,GAAI+M,EAAMjO,EAAGF,EAAGi/C,EAAGthC,GAC1B,GAAIy9B,MAAMl7C,IAAMk7C,MAAMp7C,IAAMo7C,MAAM6D,GAAI,OAAO9wC,EAE7C,IAAIjI,EASAuuD,EACAC,EACAuB,EACAtB,EACAC,EACAsB,EACArB,EACArpD,EACA2qD,EACA7zD,EACAwb,EAlBAxe,EAAO6O,EAAK2mD,MACZC,EAAO,CAAC3uC,KAAMzI,GACdq3C,EAAK7mD,EAAK8mD,IACVC,EAAK/mD,EAAKgnD,IACViB,EAAKjoD,EAAKkoD,IACVjB,EAAKjnD,EAAKknD,IACVC,EAAKnnD,EAAKonD,IACVe,EAAKnoD,EAAKooD,IAcd,IAAKj3D,EAAM,OAAO6O,EAAK2mD,MAAQC,EAAM5mD,EAGrC,KAAO7O,EAAKC,QAIV,IAHIs1D,EAAQ30D,IAAMu0D,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACtDjpD,EAASxL,IAAM00D,GAAMQ,EAAKI,GAAM,IAAIJ,EAAKR,EAASY,EAAKZ,GACvDyB,EAAOlX,IAAMgX,GAAMG,EAAKE,GAAM,IAAIF,EAAKH,EAASK,EAAKL,EACrD/vD,EAAS5G,IAAQA,EAAOA,EAAKgD,EAAI6zD,GAAQ,EAAI3qD,GAAU,EAAIqpD,IAAS,OAAO3uD,EAAO5D,GAAKyyD,EAAM5mD,EAOnG,GAHAwmD,GAAMxmD,EAAKqnD,GAAG3xC,KAAK,KAAMvkB,EAAK8mB,MAC9BwuC,GAAMzmD,EAAKsnD,GAAG5xC,KAAK,KAAMvkB,EAAK8mB,MAC9B8vC,GAAM/nD,EAAKqoD,GAAG3yC,KAAK,KAAMvkB,EAAK8mB,MAC1BlmB,IAAMy0D,GAAM30D,IAAM40D,GAAM3V,IAAMiX,EAAI,OAAOnB,EAAKjS,KAAOxjD,EAAM4G,EAASA,EAAO5D,GAAKyyD,EAAO5mD,EAAK2mD,MAAQC,EAAM5mD,EAG9G,GACEjI,EAASA,EAASA,EAAO5D,GAAK,IAAI8L,MAAM,GAAKD,EAAK2mD,MAAQ,IAAI1mD,MAAM,IAChEymD,EAAQ30D,IAAMu0D,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACtDjpD,EAASxL,IAAM00D,GAAMQ,EAAKI,GAAM,IAAIJ,EAAKR,EAASY,EAAKZ,GACvDyB,EAAOlX,IAAMgX,GAAMG,EAAKE,GAAM,IAAIF,EAAKH,EAASK,EAAKL,SACjD3zD,EAAI6zD,GAAQ,EAAI3qD,GAAU,EAAIqpD,KAAY/2C,GAAKo4C,GAAMD,IAAO,GAAKrB,GAAMF,IAAO,EAAKC,GAAMF,IACnG,OAAOvuD,EAAO4X,GAAKxe,EAAM4G,EAAO5D,GAAKyyD,EAAM5mD,CAC7C,CCxDe,YAAS7O,EAAM01D,EAAIE,EAAIkB,EAAIhB,EAAIE,EAAIgB,GAChDx1D,KAAKxB,KAAOA,EACZwB,KAAKk0D,GAAKA,EACVl0D,KAAKo0D,GAAKA,EACVp0D,KAAKs1D,GAAKA,EACVt1D,KAAKs0D,GAAKA,EACVt0D,KAAKw0D,GAAKA,EACVx0D,KAAKw1D,GAAKA,CACZ,CCRO,SAAS,GAAS34C,GACvB,OAAOA,EAAE,EACX,CCFO,SAAS,GAASA,GACvB,OAAOA,EAAE,EACX,CCFO,SAAS84C,GAAS94C,GACvB,OAAOA,EAAE,EACX,CCYe,SAAS+4C,GAAOn5D,EAAO2C,EAAGF,EAAGi/C,GAC1C,IAAI9wC,EAAO,IAAIwoD,GAAY,MAALz2D,EAAY,GAAWA,EAAQ,MAALF,EAAY,GAAWA,EAAQ,MAALi/C,EAAYwX,GAAWxX,EAAG1W,IAAKA,IAAKA,IAAKA,IAAKA,IAAKA,KAC7H,OAAgB,MAAThrC,EAAgB4Q,EAAOA,EAAK2nD,OAAOv4D,EAC5C,CAEA,SAASo5D,GAAOz2D,EAAGF,EAAGi/C,EAAG+V,EAAIE,EAAIkB,EAAIhB,EAAIE,EAAIgB,GAC3Cx1D,KAAK00D,GAAKt1D,EACVY,KAAK20D,GAAKz1D,EACVc,KAAK01D,GAAKvX,EACVn+C,KAAKm0D,IAAMD,EACXl0D,KAAKq0D,IAAMD,EACXp0D,KAAKu1D,IAAMD,EACXt1D,KAAKu0D,IAAMD,EACXt0D,KAAKy0D,IAAMD,EACXx0D,KAAKy1D,IAAMD,EACXx1D,KAAKg0D,WAAQxwD,CACf,CAEA,SAAS,GAAUywD,GAEjB,IADA,IAAIxyC,EAAO,CAAC6D,KAAM2uC,EAAK3uC,MAAO08B,EAAOvgC,EAC9BwyC,EAAOA,EAAKjS,MAAMA,EAAOA,EAAKA,KAAO,CAAC18B,KAAM2uC,EAAK3uC,MACxD,OAAO7D,CACT,CNAAyzC,GAAUzzC,KAAO,WACf,IAEIhlB,EACAkO,EAHA8W,EAAO,IAAIszC,GAAS/0D,KAAK00D,GAAI10D,KAAK20D,GAAI30D,KAAKm0D,IAAKn0D,KAAKq0D,IAAKr0D,KAAKu0D,IAAKv0D,KAAKy0D,KACzEj2D,EAAOwB,KAAKg0D,MAIhB,IAAKx1D,EAAM,OAAOijB,EAElB,IAAKjjB,EAAKC,OAAQ,OAAOgjB,EAAKuyC,MAAQiB,GAAUz2D,GAAOijB,EAGvD,IADAhlB,EAAQ,CAAC,CAACgT,OAAQjR,EAAMgR,OAAQiS,EAAKuyC,MAAQ,IAAI1mD,MAAM,KAChD9O,EAAO/B,EAAMmT,OAClB,IAAK,IAAIpO,EAAI,EAAGA,EAAI,IAAKA,GACnBmJ,EAAQnM,EAAKiR,OAAOjO,MAClBmJ,EAAMlM,OAAQhC,EAAMM,KAAK,CAAC0S,OAAQ9E,EAAO6E,OAAQhR,EAAKgR,OAAOhO,GAAK,IAAI8L,MAAM,KAC3E9O,EAAKgR,OAAOhO,GAAKyzD,GAAUtqD,IAKtC,OAAO8W,CACT,EAEAyzC,GAAU34C,IJ3DK,SAASM,GACtB,MAAMzd,GAAKY,KAAK00D,GAAG3xC,KAAK,KAAMlG,GAC1B3d,GAAKc,KAAK20D,GAAG5xC,KAAK,KAAMlG,GAC5B,OAAO,GAAI7c,KAAK81D,MAAM12D,EAAGF,GAAIE,EAAGF,EAAG2d,EACrC,EIwDAq4C,GAAUF,OJXH,SAAgB1vC,GACrB,IAAIzI,EAAGrb,EACHpC,EACAF,EAFM6xB,EAAIzL,EAAK7mB,OAGfs3D,EAAK,IAAIzoD,MAAMyjB,GACfilC,EAAK,IAAI1oD,MAAMyjB,GACfmjC,EAAK1G,IACL4G,EAAK5G,IACL8G,GAAK,IACLE,GAAK,IAGT,IAAKhzD,EAAI,EAAGA,EAAIuvB,IAAKvvB,EACf84C,MAAMl7C,GAAKY,KAAK00D,GAAG3xC,KAAK,KAAMlG,EAAIyI,EAAK9jB,MAAQ84C,MAAMp7C,GAAKc,KAAK20D,GAAG5xC,KAAK,KAAMlG,MACjFk5C,EAAGv0D,GAAKpC,EACR42D,EAAGx0D,GAAKtC,EACJE,EAAI80D,IAAIA,EAAK90D,GACbA,EAAIk1D,IAAIA,EAAKl1D,GACbF,EAAIk1D,IAAIA,EAAKl1D,GACbA,EAAIs1D,IAAIA,EAAKt1D,IAInB,GAAIg1D,EAAKI,GAAMF,EAAKI,EAAI,OAAOx0D,KAM/B,IAHAA,KAAK81D,MAAM5B,EAAIE,GAAI0B,MAAMxB,EAAIE,GAGxBhzD,EAAI,EAAGA,EAAIuvB,IAAKvvB,EACnB,GAAIxB,KAAM+1D,EAAGv0D,GAAIw0D,EAAGx0D,GAAI8jB,EAAK9jB,IAG/B,OAAOxB,IACT,EItBAk1D,GAAUY,MO7DK,SAAS12D,EAAGF,GACzB,GAAIo7C,MAAMl7C,GAAKA,IAAMk7C,MAAMp7C,GAAKA,GAAI,OAAOc,KAE3C,IAAIk0D,EAAKl0D,KAAKm0D,IACVC,EAAKp0D,KAAKq0D,IACVC,EAAKt0D,KAAKu0D,IACVC,EAAKx0D,KAAKy0D,IAKd,GAAIna,MAAM4Z,GACRI,GAAMJ,EAAK5xD,KAAK2R,MAAM7U,IAAM,EAC5Bo1D,GAAMJ,EAAK9xD,KAAK2R,MAAM/U,IAAM,MAIzB,CAMH,IALA,IAEIkG,EACA5D,EAHA28C,EAAImW,EAAKJ,GAAM,EACf11D,EAAOwB,KAAKg0D,MAITE,EAAK90D,GAAKA,GAAKk1D,GAAMF,EAAKl1D,GAAKA,GAAKs1D,GAGzC,OAFAhzD,GAAKtC,EAAIk1D,IAAO,EAAKh1D,EAAI80D,GACzB9uD,EAAS,IAAIkI,MAAM,IAAW9L,GAAKhD,EAAMA,EAAO4G,EAAQ+4C,GAAK,EACrD38C,GACN,KAAK,EAAG8yD,EAAKJ,EAAK/V,EAAGqW,EAAKJ,EAAKjW,EAAG,MAClC,KAAK,EAAG+V,EAAKI,EAAKnW,EAAGqW,EAAKJ,EAAKjW,EAAG,MAClC,KAAK,EAAGmW,EAAKJ,EAAK/V,EAAGiW,EAAKI,EAAKrW,EAAG,MAClC,KAAK,EAAG+V,EAAKI,EAAKnW,EAAGiW,EAAKI,EAAKrW,EAI/Bn+C,KAAKg0D,OAASh0D,KAAKg0D,MAAMv1D,SAAQuB,KAAKg0D,MAAQx1D,EACpD,CAMA,OAJAwB,KAAKm0D,IAAMD,EACXl0D,KAAKq0D,IAAMD,EACXp0D,KAAKu0D,IAAMD,EACXt0D,KAAKy0D,IAAMD,EACJx0D,IACT,EPoBAk1D,GAAU5vC,KQ9DK,WACb,IAAIA,EAAO,GAIX,OAHAtlB,KAAKoe,OAAM,SAAS5f,GAClB,IAAKA,EAAKC,OAAQ,GAAG6mB,EAAKvoB,KAAKyB,EAAK8mB,YAAc9mB,EAAOA,EAAKwjD,KAChE,IACO18B,CACT,ERyDA4vC,GAAUe,OS/DK,SAASt6D,GACtB,OAAOwd,UAAU1a,OACXuB,KAAK81D,OAAOn6D,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAIm6D,OAAOn6D,EAAE,GAAG,IAAKA,EAAE,GAAG,IACrD2+C,MAAMt6C,KAAKm0D,UAAO3wD,EAAY,CAAC,CAACxD,KAAKm0D,IAAKn0D,KAAKq0D,KAAM,CAACr0D,KAAKu0D,IAAKv0D,KAAKy0D,KAC7E,ET4DAS,GAAUprD,KU9DK,SAAS1K,EAAGF,EAAGoxD,GAC5B,IAAIhrC,EAGAgvC,EACAE,EACA0B,EACAC,EAKA/oB,EACA5rC,EAXA0yD,EAAKl0D,KAAKm0D,IACVC,EAAKp0D,KAAKq0D,IAKV+B,EAAKp2D,KAAKu0D,IACV8B,EAAKr2D,KAAKy0D,IACV6B,EAAQ,GACR93D,EAAOwB,KAAKg0D,MAYhB,IARIx1D,GAAM83D,EAAMv5D,KAAK,IAAI,GAAKyB,EAAM01D,EAAIE,EAAIgC,EAAIC,IAClC,MAAV/F,EAAgBA,EAAS9C,KAE3B0G,EAAK90D,EAAIkxD,EAAQ8D,EAAKl1D,EAAIoxD,EAC1B8F,EAAKh3D,EAAIkxD,EAAQ+F,EAAKn3D,EAAIoxD,EAC1BA,GAAUA,GAGLljB,EAAIkpB,EAAM1mD,OAGf,OAAMpR,EAAO4uC,EAAE5uC,QACP81D,EAAKlnB,EAAE8mB,IAAMkC,IACb5B,EAAKpnB,EAAEgnB,IAAMiC,IACbH,EAAK9oB,EAAEknB,IAAMJ,IACbiC,EAAK/oB,EAAEonB,IAAMJ,GAGrB,GAAI51D,EAAKC,OAAQ,CACf,IAAIk1D,GAAMW,EAAK4B,GAAM,EACjBtC,GAAMY,EAAK2B,GAAM,EAErBG,EAAMv5D,KACJ,IAAI,GAAKyB,EAAK,GAAIm1D,EAAIC,EAAIsC,EAAIC,GAC9B,IAAI,GAAK33D,EAAK,GAAI81D,EAAIV,EAAID,EAAIwC,GAC9B,IAAI,GAAK33D,EAAK,GAAIm1D,EAAIa,EAAI0B,EAAItC,GAC9B,IAAI,GAAKp1D,EAAK,GAAI81D,EAAIE,EAAIb,EAAIC,KAI5BpyD,GAAKtC,GAAK00D,IAAO,EAAKx0D,GAAKu0D,KAC7BvmB,EAAIkpB,EAAMA,EAAM73D,OAAS,GACzB63D,EAAMA,EAAM73D,OAAS,GAAK63D,EAAMA,EAAM73D,OAAS,EAAI+C,GACnD80D,EAAMA,EAAM73D,OAAS,EAAI+C,GAAK4rC,EAElC,KAGK,CACH,IAAItmC,EAAK1H,GAAKY,KAAK00D,GAAG3xC,KAAK,KAAMvkB,EAAK8mB,MAClCve,EAAK7H,GAAKc,KAAK20D,GAAG5xC,KAAK,KAAMvkB,EAAK8mB,MAClCixC,EAAKzvD,EAAKA,EAAKC,EAAKA,EACxB,GAAIwvD,EAAKjG,EAAQ,CACf,IAAIzzC,EAAIva,KAAK+lC,KAAKioB,EAASiG,GAC3BrC,EAAK90D,EAAIyd,EAAGu3C,EAAKl1D,EAAI2d,EACrBu5C,EAAKh3D,EAAIyd,EAAGw5C,EAAKn3D,EAAI2d,EACrByI,EAAO9mB,EAAK8mB,IACd,CACF,CAGF,OAAOA,CACT,EVJA4vC,GAAUsB,OWjEK,SAAS35C,GACtB,GAAIy9B,MAAMl7C,GAAKY,KAAK00D,GAAG3xC,KAAK,KAAMlG,KAAOy9B,MAAMp7C,GAAKc,KAAK20D,GAAG5xC,KAAK,KAAMlG,IAAK,OAAO7c,KAEnF,IAAIoF,EAEAqxD,EACAC,EACA1U,EAKA5iD,EACAF,EACAy0D,EACAC,EACAG,EACArpD,EACAlJ,EACAwb,EAfAxe,EAAOwB,KAAKg0D,MAIZE,EAAKl0D,KAAKm0D,IACVC,EAAKp0D,KAAKq0D,IACVC,EAAKt0D,KAAKu0D,IACVC,EAAKx0D,KAAKy0D,IAWd,IAAKj2D,EAAM,OAAOwB,KAIlB,GAAIxB,EAAKC,OAAQ,OAAa,CAG5B,IAFIs1D,EAAQ30D,IAAMu0D,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACtDjpD,EAASxL,IAAM00D,GAAMQ,EAAKI,GAAM,IAAIJ,EAAKR,EAASY,EAAKZ,EACrDxuD,EAAS5G,IAAMA,EAAOA,EAAKgD,EAAIkJ,GAAU,EAAIqpD,IAAS,OAAO/zD,KACnE,IAAKxB,EAAKC,OAAQ,OACd2G,EAAQ5D,EAAI,EAAK,IAAM4D,EAAQ5D,EAAI,EAAK,IAAM4D,EAAQ5D,EAAI,EAAK,MAAIi1D,EAAWrxD,EAAQ4X,EAAIxb,EAChG,CAGA,KAAOhD,EAAK8mB,OAASzI,MAAS65C,EAAWl4D,IAAMA,EAAOA,EAAKwjD,MAAO,OAAOhiD,KAIzE,OAHIgiD,EAAOxjD,EAAKwjD,cAAaxjD,EAAKwjD,KAG9B0U,GAAkB1U,EAAO0U,EAAS1U,KAAOA,SAAc0U,EAAS1U,KAAOhiD,MAGtEoF,GAGL48C,EAAO58C,EAAO5D,GAAKwgD,SAAc58C,EAAO5D,IAGnChD,EAAO4G,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,KACnD5G,KAAU4G,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,MACvD5G,EAAKC,SACPg4D,EAAUA,EAASz5C,GAAKxe,EACvBwB,KAAKg0D,MAAQx1D,GAGbwB,OAbaA,KAAKg0D,MAAQhS,EAAMhiD,KAczC,EXUAk1D,GAAUyB,UWRH,SAAmBrxC,GACxB,IAAK,IAAI9jB,EAAI,EAAGuvB,EAAIzL,EAAK7mB,OAAQ+C,EAAIuvB,IAAKvvB,EAAGxB,KAAKw2D,OAAOlxC,EAAK9jB,IAC9D,OAAOxB,IACT,EXMAk1D,GAAU5qD,KYnEK,WACb,OAAOtK,KAAKg0D,KACd,EZkEAkB,GAAU19C,KapEK,WACb,IAAIA,EAAO,EAIX,OAHAxX,KAAKoe,OAAM,SAAS5f,GAClB,IAAKA,EAAKC,OAAQ,KAAK+Y,QAAahZ,EAAOA,EAAKwjD,KAClD,IACOxqC,CACT,Eb+DA09C,GAAU92C,McnEK,SAASumB,GACtB,IAAgByI,EAAsBziC,EAAOupD,EAAIE,EAAIE,EAAIE,EAArD8B,EAAQ,GAAO93D,EAAOwB,KAAKg0D,MAE/B,IADIx1D,GAAM83D,EAAMv5D,KAAK,IAAI,GAAKyB,EAAMwB,KAAKm0D,IAAKn0D,KAAKq0D,IAAKr0D,KAAKu0D,IAAKv0D,KAAKy0D,MAChErnB,EAAIkpB,EAAM1mD,OACf,IAAK+0B,EAASnmC,EAAO4uC,EAAE5uC,KAAM01D,EAAK9mB,EAAE8mB,GAAIE,EAAKhnB,EAAEgnB,GAAIE,EAAKlnB,EAAEknB,GAAIE,EAAKpnB,EAAEonB,KAAOh2D,EAAKC,OAAQ,CACvF,IAAIk1D,GAAMO,EAAKI,GAAM,EAAGV,GAAMQ,EAAKI,GAAM,GACrC7pD,EAAQnM,EAAK,KAAI83D,EAAMv5D,KAAK,IAAI,GAAK4N,EAAOgpD,EAAIC,EAAIU,EAAIE,KACxD7pD,EAAQnM,EAAK,KAAI83D,EAAMv5D,KAAK,IAAI,GAAK4N,EAAOupD,EAAIN,EAAID,EAAIa,KACxD7pD,EAAQnM,EAAK,KAAI83D,EAAMv5D,KAAK,IAAI,GAAK4N,EAAOgpD,EAAIS,EAAIE,EAAIV,KACxDjpD,EAAQnM,EAAK,KAAI83D,EAAMv5D,KAAK,IAAI,GAAK4N,EAAOupD,EAAIE,EAAIT,EAAIC,GAC9D,CAEF,OAAO5zD,IACT,EduDAk1D,GAAU0B,WepEK,SAASjyB,GACtB,IAA2ByI,EAAvBkpB,EAAQ,GAAItU,EAAO,GAEvB,IADIhiD,KAAKg0D,OAAOsC,EAAMv5D,KAAK,IAAI,GAAKiD,KAAKg0D,MAAOh0D,KAAKm0D,IAAKn0D,KAAKq0D,IAAKr0D,KAAKu0D,IAAKv0D,KAAKy0D,MAC5ErnB,EAAIkpB,EAAM1mD,OAAO,CACtB,IAAIpR,EAAO4uC,EAAE5uC,KACb,GAAIA,EAAKC,OAAQ,CACf,IAAIkM,EAAOupD,EAAK9mB,EAAE8mB,GAAIE,EAAKhnB,EAAEgnB,GAAIE,EAAKlnB,EAAEknB,GAAIE,EAAKpnB,EAAEonB,GAAIb,GAAMO,EAAKI,GAAM,EAAGV,GAAMQ,EAAKI,GAAM,GACxF7pD,EAAQnM,EAAK,KAAI83D,EAAMv5D,KAAK,IAAI,GAAK4N,EAAOupD,EAAIE,EAAIT,EAAIC,KACxDjpD,EAAQnM,EAAK,KAAI83D,EAAMv5D,KAAK,IAAI,GAAK4N,EAAOgpD,EAAIS,EAAIE,EAAIV,KACxDjpD,EAAQnM,EAAK,KAAI83D,EAAMv5D,KAAK,IAAI,GAAK4N,EAAOupD,EAAIN,EAAID,EAAIa,KACxD7pD,EAAQnM,EAAK,KAAI83D,EAAMv5D,KAAK,IAAI,GAAK4N,EAAOgpD,EAAIC,EAAIU,EAAIE,GAC9D,CACAxS,EAAKjlD,KAAKqwC,EACZ,CACA,KAAOA,EAAI4U,EAAKpyC,OACd+0B,EAASyI,EAAE5uC,KAAM4uC,EAAE8mB,GAAI9mB,EAAEgnB,GAAIhnB,EAAEknB,GAAIlnB,EAAEonB,IAEvC,OAAOx0D,IACT,EfmDAk1D,GAAU91D,EFnEK,SAASzD,GACtB,OAAOwd,UAAU1a,QAAUuB,KAAK00D,GAAK/4D,EAAGqE,MAAQA,KAAK00D,EACvD,EEkEAQ,GAAUh2D,EDpEK,SAASvD,GACtB,OAAOwd,UAAU1a,QAAUuB,KAAK20D,GAAKh5D,EAAGqE,MAAQA,KAAK20D,EACvD,EOgCA,IAAI,GAAYiB,GAAOt1D,UAAYu1D,GAAOv1D,UU2C1C,SAASu2D,GAAWC,GAClB,IAAIC,EAAY,EACZC,EAAO,EACPC,EAAO,EACPC,EAAO,EACPC,EAAU,EACd,MAAMC,EAAcN,EAASr4D,OAE7B,GAAI24D,EAAa,CAEf,IAAK,IAAI51D,EAAI,EAAGA,EAAI41D,EAAa51D,IAAK,CACpC,MAAM4rC,EAAI0pB,EAASt1D,GACf4rC,GAAKA,EAAEhxC,SACT26D,GAAa3pB,EAAEhxC,OACf46D,GAAQ5pB,EAAEhuC,EAAIguC,EAAEhxC,OAChB66D,GAAQ7pB,EAAEluC,EAAIkuC,EAAEhxC,OAChB86D,GAAQ9pB,EAAE+Q,EAAI/Q,EAAEhxC,OAChB+6D,GAAW/pB,EAAE51B,KAAO41B,EAAEhxC,O,CAG1B06D,EAAS13D,EAAI43D,EAAOD,EACpBD,EAAS53D,EAAI+3D,EAAOF,EACpBD,EAAS3Y,EAAI+Y,EAAOH,EACpBD,EAASt/C,KAAO2/C,EAAUJ,EAC1BD,EAAS16D,OAAS26D,C,KACb,CAEL,MAAM3pB,EAAI0pB,EACVA,EAAS13D,EAAIguC,EAAE9nB,KAAKlmB,EACpB03D,EAAS53D,EAAIkuC,EAAE9nB,KAAKpmB,EACpB43D,EAAS3Y,EAAI/Q,EAAE9nB,KAAK64B,EACpB2Y,EAASt/C,KAAO41B,EAAE9nB,KAAK9N,KACvBs/C,EAAS16D,OAASgxC,EAAE9nB,KAAKlpB,M,CAE7B,CV3EA,GAAUqlB,KAAO,WACf,IAEIhlB,EACAkO,EAHA8W,EAAO,IAAIo0C,GAAO71D,KAAK00D,GAAI10D,KAAK20D,GAAI30D,KAAK01D,GAAI11D,KAAKm0D,IAAKn0D,KAAKq0D,IAAKr0D,KAAKu1D,IAAKv1D,KAAKu0D,IAAKv0D,KAAKy0D,IAAKz0D,KAAKy1D,KACpGj3D,EAAOwB,KAAKg0D,MAIhB,IAAKx1D,EAAM,OAAOijB,EAElB,IAAKjjB,EAAKC,OAAQ,OAAOgjB,EAAKuyC,MAAQ,GAAUx1D,GAAOijB,EAGvD,IADAhlB,EAAQ,CAAC,CAACgT,OAAQjR,EAAMgR,OAAQiS,EAAKuyC,MAAQ,IAAI1mD,MAAM,KAChD9O,EAAO/B,EAAMmT,OAClB,IAAK,IAAIpO,EAAI,EAAGA,EAAI,IAAKA,GACnBmJ,EAAQnM,EAAKiR,OAAOjO,MAClBmJ,EAAMlM,OAAQhC,EAAMM,KAAK,CAAC0S,OAAQ9E,EAAO6E,OAAQhR,EAAKgR,OAAOhO,GAAK,IAAI8L,MAAM,KAC3E9O,EAAKgR,OAAOhO,GAAK,GAAUmJ,IAKtC,OAAO8W,CACT,EAEA,GAAUlF,IL/DK,SAASM,GACtB,MAAMzd,GAAKY,KAAK00D,GAAG3xC,KAAK,KAAMlG,GAC1B3d,GAAKc,KAAK20D,GAAG5xC,KAAK,KAAMlG,GACxBshC,GAAKn+C,KAAK01D,GAAG3yC,KAAK,KAAMlG,GAC5B,OAAO,GAAI7c,KAAK81D,MAAM12D,EAAGF,EAAGi/C,GAAI/+C,EAAGF,EAAGi/C,EAAGthC,EAC3C,EK2DA,GAAUm4C,OLNH,SAAgB1vC,GAChBhY,MAAMoO,QAAQ4J,KAAOA,EAAOhY,MAAM8gC,KAAK9oB,IAC5C,MAAMyL,EAAIzL,EAAK7mB,OACTs3D,EAAK,IAAIntB,aAAa7X,GACtBilC,EAAK,IAAIptB,aAAa7X,GACtBsmC,EAAK,IAAIzuB,aAAa7X,GAC5B,IAAImjC,EAAK1G,IACL4G,EAAK5G,IACL8H,EAAK9H,IACL8G,GAAK,IACLE,GAAK,IACLgB,GAAK,IAGT,IAAK,IAAW34C,EAAGzd,EAAGF,EAAGi/C,EAAhB38C,EAAI,EAAeA,EAAIuvB,IAAKvvB,EAC/B84C,MAAMl7C,GAAKY,KAAK00D,GAAG3xC,KAAK,KAAMlG,EAAIyI,EAAK9jB,MAAQ84C,MAAMp7C,GAAKc,KAAK20D,GAAG5xC,KAAK,KAAMlG,KAAOy9B,MAAM6D,GAAKn+C,KAAK01D,GAAG3yC,KAAK,KAAMlG,MACtHk5C,EAAGv0D,GAAKpC,EACR42D,EAAGx0D,GAAKtC,EACRm4D,EAAG71D,GAAK28C,EACJ/+C,EAAI80D,IAAIA,EAAK90D,GACbA,EAAIk1D,IAAIA,EAAKl1D,GACbF,EAAIk1D,IAAIA,EAAKl1D,GACbA,EAAIs1D,IAAIA,EAAKt1D,GACbi/C,EAAImX,IAAIA,EAAKnX,GACbA,EAAIqX,IAAIA,EAAKrX,IAInB,GAAI+V,EAAKI,GAAMF,EAAKI,GAAMc,EAAKE,EAAI,OAAOx1D,KAG1CA,KAAK81D,MAAM5B,EAAIE,EAAIkB,GAAIQ,MAAMxB,EAAIE,EAAIgB,GAGrC,IAAK,IAAIh0D,EAAI,EAAGA,EAAIuvB,IAAKvvB,EACvB,GAAIxB,KAAM+1D,EAAGv0D,GAAIw0D,EAAGx0D,GAAI61D,EAAG71D,GAAI8jB,EAAK9jB,IAGtC,OAAOxB,IACT,EKhCA,GAAU81D,MWjEK,SAAS12D,EAAGF,EAAGi/C,GAC5B,GAAI7D,MAAMl7C,GAAKA,IAAMk7C,MAAMp7C,GAAKA,IAAMo7C,MAAM6D,GAAKA,GAAI,OAAOn+C,KAE5D,IAAIk0D,EAAKl0D,KAAKm0D,IACVC,EAAKp0D,KAAKq0D,IACViB,EAAKt1D,KAAKu1D,IACVjB,EAAKt0D,KAAKu0D,IACVC,EAAKx0D,KAAKy0D,IACVe,EAAKx1D,KAAKy1D,IAKd,GAAInb,MAAM4Z,GACRI,GAAMJ,EAAK5xD,KAAK2R,MAAM7U,IAAM,EAC5Bo1D,GAAMJ,EAAK9xD,KAAK2R,MAAM/U,IAAM,EAC5Bs2D,GAAMF,EAAKhzD,KAAK2R,MAAMkqC,IAAM,MAIzB,CAMH,IALA,IAEI/4C,EACA5D,EAHAyF,EAAIqtD,EAAKJ,GAAM,EACf11D,EAAOwB,KAAKg0D,MAITE,EAAK90D,GAAKA,GAAKk1D,GAAMF,EAAKl1D,GAAKA,GAAKs1D,GAAMc,EAAKnX,GAAKA,GAAKqX,GAG9D,OAFAh0D,GAAK28C,EAAImX,IAAO,GAAKp2D,EAAIk1D,IAAO,EAAKh1D,EAAI80D,GACzC9uD,EAAS,IAAIkI,MAAM,IAAW9L,GAAKhD,EAAMA,EAAO4G,EAAQ6B,GAAK,EACrDzF,GACN,KAAK,EAAG8yD,EAAKJ,EAAKjtD,EAAGutD,EAAKJ,EAAKntD,EAAGuuD,EAAKF,EAAKruD,EAAG,MAC/C,KAAK,EAAGitD,EAAKI,EAAKrtD,EAAGutD,EAAKJ,EAAKntD,EAAGuuD,EAAKF,EAAKruD,EAAG,MAC/C,KAAK,EAAGqtD,EAAKJ,EAAKjtD,EAAGmtD,EAAKI,EAAKvtD,EAAGuuD,EAAKF,EAAKruD,EAAG,MAC/C,KAAK,EAAGitD,EAAKI,EAAKrtD,EAAGmtD,EAAKI,EAAKvtD,EAAGuuD,EAAKF,EAAKruD,EAAG,MAC/C,KAAK,EAAGqtD,EAAKJ,EAAKjtD,EAAGutD,EAAKJ,EAAKntD,EAAGquD,EAAKE,EAAKvuD,EAAG,MAC/C,KAAK,EAAGitD,EAAKI,EAAKrtD,EAAGutD,EAAKJ,EAAKntD,EAAGquD,EAAKE,EAAKvuD,EAAG,MAC/C,KAAK,EAAGqtD,EAAKJ,EAAKjtD,EAAGmtD,EAAKI,EAAKvtD,EAAGquD,EAAKE,EAAKvuD,EAAG,MAC/C,KAAK,EAAGitD,EAAKI,EAAKrtD,EAAGmtD,EAAKI,EAAKvtD,EAAGquD,EAAKE,EAAKvuD,EAI5CjH,KAAKg0D,OAASh0D,KAAKg0D,MAAMv1D,SAAQuB,KAAKg0D,MAAQx1D,EACpD,CAQA,OANAwB,KAAKm0D,IAAMD,EACXl0D,KAAKq0D,IAAMD,EACXp0D,KAAKu1D,IAAMD,EACXt1D,KAAKu0D,IAAMD,EACXt0D,KAAKy0D,IAAMD,EACXx0D,KAAKy1D,IAAMD,EACJx1D,IACT,EXeA,GAAUslB,KYlEK,WACb,IAAIA,EAAO,GAIX,OAHAtlB,KAAKoe,OAAM,SAAS5f,GAClB,IAAKA,EAAKC,OAAQ,GAAG6mB,EAAKvoB,KAAKyB,EAAK8mB,YAAc9mB,EAAOA,EAAKwjD,KAChE,IACO18B,CACT,EZ6DA,GAAU2wC,OanEK,SAASt6D,GACtB,OAAOwd,UAAU1a,OACXuB,KAAK81D,OAAOn6D,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAIm6D,OAAOn6D,EAAE,GAAG,IAAKA,EAAE,GAAG,IAAKA,EAAE,GAAG,IACzE2+C,MAAMt6C,KAAKm0D,UAAO3wD,EAAY,CAAC,CAACxD,KAAKm0D,IAAKn0D,KAAKq0D,IAAKr0D,KAAKu1D,KAAM,CAACv1D,KAAKu0D,IAAKv0D,KAAKy0D,IAAKz0D,KAAKy1D,KACjG,EbgEA,GAAU3rD,KclEK,SAAS1K,EAAGF,EAAGi/C,EAAGmS,GAC/B,IAAIhrC,EAIAgvC,EACAE,EACAgB,EACAU,EACAC,EACAmB,EAMAlqB,EACA5rC,EAfA0yD,EAAKl0D,KAAKm0D,IACVC,EAAKp0D,KAAKq0D,IACViB,EAAKt1D,KAAKu1D,IAOVa,EAAKp2D,KAAKu0D,IACV8B,EAAKr2D,KAAKy0D,IACV8C,EAAKv3D,KAAKy1D,IACV+B,EAAO,GACPh5D,EAAOwB,KAAKg0D,MAYhB,IARIx1D,GAAMg5D,EAAKz6D,KAAK,IAAI,GAAOyB,EAAM01D,EAAIE,EAAIkB,EAAIc,EAAIC,EAAIkB,IAC3C,MAAVjH,EAAgBA,EAAS9C,KAE3B0G,EAAK90D,EAAIkxD,EAAQ8D,EAAKl1D,EAAIoxD,EAAQgF,EAAKnX,EAAImS,EAC3C8F,EAAKh3D,EAAIkxD,EAAQ+F,EAAKn3D,EAAIoxD,EAAQiH,EAAKpZ,EAAImS,EAC3CA,GAAUA,GAGLljB,EAAIoqB,EAAK5nD,OAGd,OAAMpR,EAAO4uC,EAAE5uC,QACP81D,EAAKlnB,EAAE8mB,IAAMkC,IACb5B,EAAKpnB,EAAEgnB,IAAMiC,IACbb,EAAKpoB,EAAEkoB,IAAMiC,IACbrB,EAAK9oB,EAAEknB,IAAMJ,IACbiC,EAAK/oB,EAAEonB,IAAMJ,IACbkD,EAAKlqB,EAAEooB,IAAMF,GAGrB,GAAI92D,EAAKC,OAAQ,CACf,IAAIk1D,GAAMW,EAAK4B,GAAM,EACjBtC,GAAMY,EAAK2B,GAAM,EACjBhB,GAAMK,EAAK8B,GAAM,EAErBE,EAAKz6D,KACH,IAAI,GAAOyB,EAAK,GAAIm1D,EAAIC,EAAIuB,EAAIe,EAAIC,EAAImB,GACxC,IAAI,GAAO94D,EAAK,GAAI81D,EAAIV,EAAIuB,EAAIxB,EAAIwC,EAAImB,GACxC,IAAI,GAAO94D,EAAK,GAAIm1D,EAAIa,EAAIW,EAAIe,EAAItC,EAAI0D,GACxC,IAAI,GAAO94D,EAAK,GAAI81D,EAAIE,EAAIW,EAAIxB,EAAIC,EAAI0D,GACxC,IAAI,GAAO94D,EAAK,GAAIm1D,EAAIC,EAAI4B,EAAIU,EAAIC,EAAIhB,GACxC,IAAI,GAAO32D,EAAK,GAAI81D,EAAIV,EAAI4B,EAAI7B,EAAIwC,EAAIhB,GACxC,IAAI,GAAO32D,EAAK,GAAIm1D,EAAIa,EAAIgB,EAAIU,EAAItC,EAAIuB,GACxC,IAAI,GAAO32D,EAAK,GAAI81D,EAAIE,EAAIgB,EAAI7B,EAAIC,EAAIuB,KAItC3zD,GAAK28C,GAAKgX,IAAO,GAAKj2D,GAAK00D,IAAO,EAAKx0D,GAAKu0D,KAC9CvmB,EAAIoqB,EAAKA,EAAK/4D,OAAS,GACvB+4D,EAAKA,EAAK/4D,OAAS,GAAK+4D,EAAKA,EAAK/4D,OAAS,EAAI+C,GAC/Cg2D,EAAKA,EAAK/4D,OAAS,EAAI+C,GAAK4rC,EAEhC,KAGK,CACH,IAAItmC,EAAK1H,GAAKY,KAAK00D,GAAG3xC,KAAK,KAAMvkB,EAAK8mB,MAClCve,EAAK7H,GAAKc,KAAK20D,GAAG5xC,KAAK,KAAMvkB,EAAK8mB,MAClCmyC,EAAKtZ,GAAKn+C,KAAK01D,GAAG3yC,KAAK,KAAMvkB,EAAK8mB,MAClCixC,EAAKzvD,EAAKA,EAAKC,EAAKA,EAAK0wD,EAAKA,EAClC,GAAIlB,EAAKjG,EAAQ,CACf,IAAIzzC,EAAIva,KAAK+lC,KAAKioB,EAASiG,GAC3BrC,EAAK90D,EAAIyd,EAAGu3C,EAAKl1D,EAAI2d,EAAGy4C,EAAKnX,EAAIthC,EACjCu5C,EAAKh3D,EAAIyd,EAAGw5C,EAAKn3D,EAAI2d,EAAG06C,EAAKpZ,EAAIthC,EACjCyI,EAAO9mB,EAAK8mB,IACd,CACF,CAGF,OAAOA,CACT,EdZA,GAAUkxC,OerEK,SAAS35C,GACtB,GAAIy9B,MAAMl7C,GAAKY,KAAK00D,GAAG3xC,KAAK,KAAMlG,KAAOy9B,MAAMp7C,GAAKc,KAAK20D,GAAG5xC,KAAK,KAAMlG,KAAOy9B,MAAM6D,GAAKn+C,KAAK01D,GAAG3yC,KAAK,KAAMlG,IAAK,OAAO7c,KAExH,IAAIoF,EAEAqxD,EACAC,EACA1U,EAOA5iD,EACAF,EACAi/C,EACAwV,EACAC,EACAuB,EACApB,EACArpD,EACA2qD,EACA7zD,EACAwb,EApBAxe,EAAOwB,KAAKg0D,MAIZE,EAAKl0D,KAAKm0D,IACVC,EAAKp0D,KAAKq0D,IACViB,EAAKt1D,KAAKu1D,IACVjB,EAAKt0D,KAAKu0D,IACVC,EAAKx0D,KAAKy0D,IACVe,EAAKx1D,KAAKy1D,IAcd,IAAKj3D,EAAM,OAAOwB,KAIlB,GAAIxB,EAAKC,OAAQ,OAAa,CAI5B,IAHIs1D,EAAQ30D,IAAMu0D,GAAMO,EAAKI,GAAM,IAAIJ,EAAKP,EAASW,EAAKX,GACtDjpD,EAASxL,IAAM00D,GAAMQ,EAAKI,GAAM,IAAIJ,EAAKR,EAASY,EAAKZ,GACvDyB,EAAOlX,IAAMgX,GAAMG,EAAKE,GAAM,IAAIF,EAAKH,EAASK,EAAKL,EACnD/vD,EAAS5G,IAAMA,EAAOA,EAAKgD,EAAI6zD,GAAQ,EAAI3qD,GAAU,EAAIqpD,IAAS,OAAO/zD,KAC/E,IAAKxB,EAAKC,OAAQ,OACd2G,EAAQ5D,EAAI,EAAK,IAAM4D,EAAQ5D,EAAI,EAAK,IAAM4D,EAAQ5D,EAAI,EAAK,IAAM4D,EAAQ5D,EAAI,EAAK,IAAM4D,EAAQ5D,EAAI,EAAK,IAAM4D,EAAQ5D,EAAI,EAAK,IAAM4D,EAAQ5D,EAAI,EAAK,MAAIi1D,EAAWrxD,EAAQ4X,EAAIxb,EAC5L,CAGA,KAAOhD,EAAK8mB,OAASzI,MAAS65C,EAAWl4D,IAAMA,EAAOA,EAAKwjD,MAAO,OAAOhiD,KAIzE,OAHIgiD,EAAOxjD,EAAKwjD,cAAaxjD,EAAKwjD,KAG9B0U,GAAkB1U,EAAO0U,EAAS1U,KAAOA,SAAc0U,EAAS1U,KAAOhiD,MAGtEoF,GAGL48C,EAAO58C,EAAO5D,GAAKwgD,SAAc58C,EAAO5D,IAGnChD,EAAO4G,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,KACvG5G,KAAU4G,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,IAAMA,EAAO,MAC3G5G,EAAKC,SACPg4D,EAAUA,EAASz5C,GAAKxe,EACvBwB,KAAKg0D,MAAQx1D,GAGbwB,OAbaA,KAAKg0D,MAAQhS,EAAMhiD,KAczC,EfQA,GAAU22D,UeNH,SAAmBrxC,GACxB,IAAK,IAAI9jB,EAAI,EAAGuvB,EAAIzL,EAAK7mB,OAAQ+C,EAAIuvB,IAAKvvB,EAAGxB,KAAKw2D,OAAOlxC,EAAK9jB,IAC9D,OAAOxB,IACT,EfIA,GAAUsK,KgBvEK,WACb,OAAOtK,KAAKg0D,KACd,EhBsEA,GAAUx8C,KiBxEK,WACb,IAAIA,EAAO,EAIX,OAHAxX,KAAKoe,OAAM,SAAS5f,GAClB,IAAKA,EAAKC,OAAQ,KAAK+Y,QAAahZ,EAAOA,EAAKwjD,KAClD,IACOxqC,CACT,EjBmEA,GAAU4G,MkBvEK,SAASumB,GACtB,IAAeyI,EAAsBziC,EAAOupD,EAAIE,EAAIkB,EAAIhB,EAAIE,EAAIgB,EAA5DgC,EAAO,GAAOh5D,EAAOwB,KAAKg0D,MAE9B,IADIx1D,GAAMg5D,EAAKz6D,KAAK,IAAI,GAAOyB,EAAMwB,KAAKm0D,IAAKn0D,KAAKq0D,IAAKr0D,KAAKu1D,IAAKv1D,KAAKu0D,IAAKv0D,KAAKy0D,IAAKz0D,KAAKy1D,MACrFroB,EAAIoqB,EAAK5nD,OACd,IAAK+0B,EAASnmC,EAAO4uC,EAAE5uC,KAAM01D,EAAK9mB,EAAE8mB,GAAIE,EAAKhnB,EAAEgnB,GAAIkB,EAAKloB,EAAEkoB,GAAIhB,EAAKlnB,EAAEknB,GAAIE,EAAKpnB,EAAEonB,GAAIgB,EAAKpoB,EAAEooB,KAAOh3D,EAAKC,OAAQ,CAC7G,IAAIk1D,GAAMO,EAAKI,GAAM,EAAGV,GAAMQ,EAAKI,GAAM,EAAGW,GAAMG,EAAKE,GAAM,GACzD7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOgpD,EAAIC,EAAIuB,EAAIb,EAAIE,EAAIgB,KACjE7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOupD,EAAIN,EAAIuB,EAAIxB,EAAIa,EAAIgB,KACjE7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOgpD,EAAIS,EAAIe,EAAIb,EAAIV,EAAI4B,KACjE7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOupD,EAAIE,EAAIe,EAAIxB,EAAIC,EAAI4B,KACjE7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOgpD,EAAIC,EAAI0B,EAAIhB,EAAIE,EAAIW,KACjExqD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOupD,EAAIN,EAAI0B,EAAI3B,EAAIa,EAAIW,KACjExqD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOgpD,EAAIS,EAAIkB,EAAIhB,EAAIV,EAAIuB,KACjExqD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOupD,EAAIE,EAAIkB,EAAI3B,EAAIC,EAAIuB,GACvE,CAEF,OAAOn1D,IACT,ElBuDA,GAAU42D,WmBxEK,SAASjyB,GACtB,IAA0ByI,EAAtBoqB,EAAO,GAAIxV,EAAO,GAEtB,IADIhiD,KAAKg0D,OAAOwD,EAAKz6D,KAAK,IAAI,GAAOiD,KAAKg0D,MAAOh0D,KAAKm0D,IAAKn0D,KAAKq0D,IAAKr0D,KAAKu1D,IAAKv1D,KAAKu0D,IAAKv0D,KAAKy0D,IAAKz0D,KAAKy1D,MACjGroB,EAAIoqB,EAAK5nD,OAAO,CACrB,IAAIpR,EAAO4uC,EAAE5uC,KACb,GAAIA,EAAKC,OAAQ,CACf,IAAIkM,EAAOupD,EAAK9mB,EAAE8mB,GAAIE,EAAKhnB,EAAEgnB,GAAIkB,EAAKloB,EAAEkoB,GAAIhB,EAAKlnB,EAAEknB,GAAIE,EAAKpnB,EAAEonB,GAAIgB,EAAKpoB,EAAEooB,GAAI7B,GAAMO,EAAKI,GAAM,EAAGV,GAAMQ,EAAKI,GAAM,EAAGW,GAAMG,EAAKE,GAAM,GAClI7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOupD,EAAIE,EAAIkB,EAAI3B,EAAIC,EAAIuB,KACjExqD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOgpD,EAAIS,EAAIkB,EAAIhB,EAAIV,EAAIuB,KACjExqD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOupD,EAAIN,EAAI0B,EAAI3B,EAAIa,EAAIW,KACjExqD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOgpD,EAAIC,EAAI0B,EAAIhB,EAAIE,EAAIW,KACjExqD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOupD,EAAIE,EAAIe,EAAIxB,EAAIC,EAAI4B,KACjE7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOgpD,EAAIS,EAAIe,EAAIb,EAAIV,EAAI4B,KACjE7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOupD,EAAIN,EAAIuB,EAAIxB,EAAIa,EAAIgB,KACjE7qD,EAAQnM,EAAK,KAAIg5D,EAAKz6D,KAAK,IAAI,GAAO4N,EAAOgpD,EAAIC,EAAIuB,EAAIb,EAAIE,EAAIgB,GACvE,CACAxT,EAAKjlD,KAAKqwC,EACZ,CACA,KAAOA,EAAI4U,EAAKpyC,OACd+0B,EAASyI,EAAE5uC,KAAM4uC,EAAE8mB,GAAI9mB,EAAEgnB,GAAIhnB,EAAEkoB,GAAIloB,EAAEknB,GAAIlnB,EAAEonB,GAAIpnB,EAAEooB,IAEnD,OAAOx1D,IACT,EnBmDA,GAAUZ,EHvEK,SAASzD,GACtB,OAAOwd,UAAU1a,QAAUuB,KAAK00D,GAAK/4D,EAAGqE,MAAQA,KAAK00D,EACvD,EGsEA,GAAUx1D,EFxEK,SAASvD,GACtB,OAAOwd,UAAU1a,QAAUuB,KAAK20D,GAAKh5D,EAAGqE,MAAQA,KAAK20D,EACvD,EEuEA,GAAUxW,EDzEK,SAASxiD,GACtB,OAAOwd,UAAU1a,QAAUuB,KAAK01D,GAAK/5D,EAAGqE,MAAQA,KAAK01D,EACvD,EW+GA,MAAM9vC,GAAQ,CACZkxC,EACAxC,EACAoD,EACAC,EACAC,EACAp5D,EACAq5D,K,MAEA,IAAiB,QAAb,EAAAf,EAASxxC,YAAI,eAAE4Z,MAAO1gC,EAAK0gC,GAAI,OACnC,MAAMg3B,EAAK,CAACwB,EAAMC,EAAMC,GAAMC,EAAa,GAErC/wD,EAAKtI,EAAKY,EAAI03D,EAAS13D,GA1Hf,GA2HR2H,EAAKvI,EAAKU,EAAI43D,EAAS53D,GA3Hf,GA4HRu4D,EAAKj5D,EAAK2/C,EAAI2Y,EAAS3Y,GA5Hf,GA6HRjxC,EAAM,CAACpG,EAAIC,EAAI0wD,GACfz5D,EAAQk4D,EAAK5B,EACnB,IAAIwD,EAAO,EACX,IAAK,IAAIt2D,EAAI,EAAGA,EAAIq2D,EAAYr2D,IAC9Bs2D,GAAQ5qD,EAAI1L,GAAK0L,EAAI1L,GAEvB,MACMu2D,EADOz1D,KAAK+lC,KAAKyvB,GACHA,EAGpB,GAAI95D,EAAQA,EAxIC,IAwIgB85D,EAAM,CACjC,MAAME,EAAQlB,EAAS16D,OAAS27D,EAIhC,OAHAv5D,EAAKy5D,IAAMnxD,EAAKkxD,EAChBx5D,EAAK05D,IAAMnxD,EAAKixD,EAChBx5D,EAAK25D,IAAMV,EAAKO,GACT,C,CAGT,GAAIlB,EAASr4D,OAAQ,OAAO,EAI5B,GAAIq4D,EAASxxC,OAAS9mB,EAAM,CAC1B,MAAMw5D,EAAQlB,EAASxxC,KAAKlpB,OAAS27D,EACrCv5D,EAAKy5D,IAAMnxD,EAAKkxD,EAChBx5D,EAAK05D,IAAMnxD,EAAKixD,EAChBx5D,EAAK25D,IAAMV,EAAKO,C,GUtId,GAAuD,CAC3DH,WAAY,EACZO,aAAc,IACdC,QAAS,GACTl4B,OAAQ,EACRm4B,aAAc,GACdC,aAAc,IACdC,gBAAiB,KACjBC,QAAS,GACTC,SAAU,IACVC,YAAa,GACbz0B,SAAU,IACV00B,aAAc,IACdC,oBAAqB,GACrBzH,gBAAgB,EAChB0H,sBAAuB,QAkBlB,MAAMC,GAuBX,WAAAr3C,CAAmBgB,EAA8B,CAAC,GAA/B,KAAAA,QAAAA,EAtBnB,KAAAwc,GAAK,QAIG,KAAA85B,aAAuB,EAIvB,KAAAC,gBAA0B,EAE1B,KAAAC,SAAmB,EAazBl5D,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAKm5D,oBAAmB,EAAOn9D,EAAO0mB,EAC/C,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAKm5D,oBAAmB,EAAMn9D,EAAO0mB,EACvC,G,CAKA,IAAA02C,GACMp5D,KAAKg5D,cAAkC,oBAAXn3D,QAC9BA,OAAOw3D,cAAcr5D,KAAKg5D,cAE5Bh5D,KAAKk5D,SAAU,CACjB,CAMA,IAAAI,CAAKC,EAAav5D,KAAK0iB,QAAQ01C,cAAgB,GAC7C,GAAIp4D,KAAKw5D,WACP,OAAOx5D,KAAKw5D,WAGd,IACE,IAAIh4D,EAAI,GACPxB,KAAKi5D,gBAAkBj5D,KAAKy5D,YAAYd,aAAen3D,EAAI,IAC5DA,EAAI+3D,EACJ/3D,IAEAxB,KAAK05D,WACH15D,KAAK25D,cACL35D,KAAK45D,UACLp4D,EACAxB,KAAK65D,WACL75D,KAAKy5D,aAEPz5D,KAAK85D,eACH95D,KAAK45D,UACL55D,KAAK25D,cACL35D,KAAK65D,WACL75D,KAAKy5D,aAIT,MAAMptD,EAAS,CACb5P,MAAOuD,KAAK+5D,gBACZt8D,MAAOuC,KAAKg6D,iBAad,OAVIh6D,KAAKi6D,YACP5tD,EAAO5P,MAAMD,SAASgC,GACpBwB,KAAK45D,UAAUnR,cAAcjqD,EAAK0gC,GAAI,CACpC9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,EACbi/C,EAA+B,IAA5Bn+C,KAAK0iB,QAAQm1C,WAAmBr5D,EAAK8mB,KAAK64B,OAAI36C,MAKhD6I,CACT,CAYc,kBAAA8sD,CACZpM,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,GAEtCjmB,EAAQT,EAAMwoD,cACd/mD,EAAQzB,EAAMyqD,cAEdyT,EAAmBl6D,KAAKm6D,cAAcxI,EAAe31D,IACrD,WACJ67D,EAAU,MACV75D,EAAK,OACLC,EAAM,SACNoxD,EAAQ,QACR+K,EAAO,aACP7B,EAAY,aACZD,EAAY,aACZM,GACEsB,EAEE9H,EAA0B31D,EAAMiG,KAAI,CAAClE,EAAMgD,IACxC,+BACFhD,GAAI,CACP8mB,KAAM,OAAF,wBACC9mB,EAAK8mB,MAAI,CAEZlmB,EAAG,EAASZ,EAAK8mB,KAAKlmB,GAAKZ,EAAK8mB,KAAKlmB,EAAIkD,KAAK0hC,SAAWhmC,EACzDkB,EAAG,EAASV,EAAK8mB,KAAKpmB,GAAKV,EAAK8mB,KAAKpmB,EAAIoD,KAAK0hC,SAAW/lC,EACzDkgD,EAAG,EAAS3/C,EAAK8mB,KAAK64B,GAClB3/C,EAAK8mB,KAAK64B,EACV77C,KAAK0hC,SAAW1hC,KAAK+lC,KAAKrqC,EAAQC,GACtCuZ,KAAM63C,EAAS7wD,IAAS,GACxB67D,KAAMD,EAAQ57D,GACd+5D,aAAcA,EAAa/5D,SAI3B87D,EAA0B78D,EAAMiF,KAAKvG,GAAU,OAAD,wBAC/CA,GAAI,CACPmpB,KAAM,OAAF,wBACCnpB,EAAKmpB,MAAI,CACZgzC,aAAcA,EAAan8D,GAC3By8D,aAAcA,EACZz8D,EACAH,EAAM8oD,QAAQ3oD,EAAKsT,QACnBzT,EAAM8oD,QAAQ3oD,EAAKqT,eAKzB,KAAK/S,aAAK,EAALA,EAAOgC,QAEV,OADAuB,KAAKw5D,WAAa,CAAE/8D,MAAO,GAAIgB,SACxB,CAAEhB,MAAO,GAAIgB,SAGtB,MAAM88D,EAAkC,CAAC,EACzC99D,EAAMD,SAAQ,CAACgC,EAAMgD,KACnB+4D,EAAO/7D,EAAK0gC,IAAM,CAChB9/B,EAAG,EACHF,EAAG,EACHi/C,EAAG,EACJ,IAGH,MAAMqc,EAAY,IAAI,EAAmC,CACvD/9D,MAAO21D,EACP30D,MAAO68D,IAGTt6D,KAAKy6D,kBAAkBP,EAAkBM,GAEzC,MAAM,aAAEpC,EAAY,YAAEO,EAAW,OAAE+B,GAAWR,EAW9C,GARAl6D,KAAK+5D,gBAAkB3H,EACvBpyD,KAAKg6D,gBAAkBM,EACvBt6D,KAAKi6D,WAAalN,EAClB/sD,KAAK45D,UAAY59D,EACjBgE,KAAK25D,cAAgBa,EACrBx6D,KAAKy5D,YAAcS,EACnBl6D,KAAK65D,WAAaU,EAEI,oBAAX14D,OAAwB,OACnC,IAAIu8C,EAAO,EAEX,OAAO,IAAI15B,SAASiT,IAElB33B,KAAKg5D,aAAen3D,OAAO84D,aAAY,KAChCl+D,GAAUuD,KAAKk5D,SAClBvhC,EAAQ,CACNl7B,MAAOm+D,GAAe5+D,EAAOo2D,GAC7B30D,UAGJuC,KAAK05D,WAAWc,EAAWx+D,EAAOoiD,EAAMmc,EAAQL,GAChDl6D,KAAK85D,eAAe99D,EAAOw+D,EAAWD,EAAQL,GAC1CnN,GACFqF,EAAY51D,SAASgC,GACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,EACbi/C,EAAkB,IAAf0Z,EAAmBr5D,EAAK8mB,KAAK64B,OAAI36C,MAI1Ck3D,SAAAA,EAAS,CACPj+D,MAAOm+D,GAAe5+D,EAAOo2D,GAC7B30D,UAEF2gD,KACIA,GAAQga,GAAgBp4D,KAAKi5D,gBAAkBN,KACjD92D,OAAOw3D,cAAcr5D,KAAKg5D,cAE1BrhC,EAAQ,CACNl7B,MAAOm+D,GAAe5+D,EAAOo2D,GAC7B30D,U,GAGH,GACHuC,KAAKk5D,SAAU,CAAI,GAEvB,G,CAQQ,aAAAiB,CACNz3C,EACA1mB,GAEA,MAAMk+D,EAAmB,iBAAKx3C,IAE5B1kB,MAAO6zD,EACP5zD,OAAQ6zD,EAAW,QACnBsI,EAAO,SACP/K,GACE3sC,EAGJw3C,EAAiBl8D,MACd6zD,GAAgC,oBAAXhwD,OAEjBgwD,EADDhwD,OAAOqwD,WAEbgI,EAAiBj8D,OACd6zD,GAAiC,oBAAXjwD,OAElBiwD,EADDjwD,OAAOswD,YAERzvC,EAAQ4sB,SACX4qB,EAAiB5qB,OAAS,CACxB4qB,EAAiBl8D,MAAQ,EACzBk8D,EAAiBj8D,OAAS,IAKzBm8D,IACHF,EAAiBE,QAAWv9C,IAC1B,IAAIg+C,EAAa,EACb,EAASh+C,aAAC,EAADA,EAAGyI,KAAK+0C,QAAOQ,EAAah+C,aAAC,EAADA,EAAGyI,KAAK+0C,MACjD,MAAMS,EAAS9+D,EAAMgqD,UAAUnpC,EAAGqiB,GAAI,QACtC,OAAQ47B,GAAUA,EAAS,EAAID,EAAsB,EAATC,EAAaD,CAAU,GAMvE,MAAMrL,EAAkBR,GAAqB,EAAGtsC,EAAQ4sC,aACxD,IAAIyL,EAgBFA,EAfG1L,EAcM,GAAWA,GACNxyC,GAAcwyC,EAAsBxyC,GAAK2yC,EAAgB3yC,GAC9DnB,GAAQ2zC,GACHxyC,IACZ,MAAMm+C,EAAc3L,EACpB,OAAO/sD,KAAKC,IAAIy4D,EAAY,GAAIA,EAAY,IAAMxL,EAAgB3yC,EAAE,EAGxDA,GAAcwyC,EAAsBG,EAAgB3yC,GArBpDA,IACZ,MAAM,KAAErF,IAASqF,aAAC,EAADA,EAAGyI,OAAQ,CAAC,EAC7B,OAAI9N,EACEkE,GAAQlE,GACHlV,KAAKC,IAAIiV,EAAK,GAAIA,EAAK,IAAMg4C,EAAgB3yC,GAElD,GAA4CrF,GACvClV,KAAKC,IAAIiV,EAAKxZ,MAAOwZ,EAAKvZ,QAAUuxD,EAAgB3yC,GAErDrF,EAAkBg4C,EAAgB3yC,GAErC,GAAK2yC,EAAgB3yC,EAAE,EAYlCq9C,EAAiB7K,SAAW0L,EAG5B,MAAME,EAAiBv4C,EAAQk2C,aAC3B5J,GAAe,EAAGtsC,EAAQk2C,cACzBz8D,GAEG,EACA+9D,EAAiB7K,SAASrzD,EAAM8oD,QAAQ3oD,EAAMsT,SAC9CyqD,EAAiB7K,SAASrzD,EAAM8oD,QAAQ3oD,EAAMqT,SAOtD,OAJA0qD,EAAiBtB,aAAeqC,EAChCf,EAAiB3B,aAAevJ,GAAe,EAAGtsC,EAAQ61C,cAC1D2B,EAAiB5B,aAAetJ,GAAe,EAAGtsC,EAAQ41C,cAEnD4B,CACT,CAOQ,iBAAAO,CAAkB/3C,EAA0B83C,GAClD,MAAM,WACJ3C,EAAU,mBACVqD,EAAkB,OAClB5rB,EAAM,oBACNupB,EAAmB,YACnBsC,EAAW,WACXC,EAAU,cACVC,GACE34C,EACE44C,EAAYd,EAAUhW,cAEtB+W,EAAmBL,GAAsB,CAC7CjH,KAAM,EACNuH,OAAQ,EACRC,OAAQ,EAERnsB,OAASve,IACA,CACL3xB,EAAGkwC,EAAO,GACVpwC,EAAGowC,EAAO,GACV6O,EAAkB,IAAf0Z,EAAmBvoB,EAAO,QAAK9rC,KAQxC,IAAIk4D,EACAC,EAyDJ,GA9DmC,mBAAxB9C,IACTn2C,EAAQm2C,oBAAuBr6D,GAC7Bq6D,GAIAsC,GAAeE,IACjBK,EAAkBE,GAAmBpB,EAAWa,GAChDM,EACEruD,MAAM8gC,KACJ,IAAIzpB,IAAI22C,aAAS,EAATA,EAAW54D,KAAKlE,GAASA,EAAK8mB,KAAK+1C,QACxC,GAEP34C,EAAQw4C,mBAAqBh5C,OAAO6qC,OAAOwO,EAAkB,CAC3DC,OAAQ,IACRvH,KAAOz1D,IAEL,MAAM,cAAEq9D,EAAa,eAAEC,GACrBJ,EAAgBl9D,EAAK0gC,KAAO,CAAC,EAE/B,OACE48B,aAAc,EAAdA,EAAgBr9D,WAAWo9D,aAAa,EAAbA,EAAep9D,SACrB,KAArBk9D,aAAQ,EAARA,EAAUl9D,QAEH,EAEFikB,EAAQm2C,oBAAoBr6D,EAAK,EAE1Ci9D,OAAQ,EACRnsB,OAAS9wC,IACP,MAAMs8D,EAASN,EAAUxU,UAAUxnD,EAAK0gC,GAAI,QAE5C,IAAK47B,EACH,MAAO,CACL17D,EAAG,IACHF,EAAG,IACHi/C,EAAG,GAGP,IAAI4d,EACJ,GAAe,IAAXjB,EAAc,CAGhB,MAAM,eAAEgB,EAAiB,IAAOJ,EAAgBl9D,EAAK0gC,KAAO,CAAC,EAC/B,IAA1B48B,EAAer9D,OAEjBs9D,OAAYv4D,EACHs4D,EAAer9D,OAAS,IAEjCs9D,EAAYC,GAAmBF,G,MAGjCC,OAAYv4D,EAEd,MAAO,CACLpE,EAAG28D,aAAS,EAATA,EAAW38D,EACdF,EAAG68D,aAAS,EAATA,EAAW78D,EACdi/C,EAAG4d,aAAS,EAATA,EAAW5d,EACf,KAIHid,GAAcC,EAAe,CAC1BK,IACHA,EAAkBE,GAAmBpB,EAAWa,IAE7CM,IACHA,EAAWruD,MAAM8gC,KACf,IAAIzpB,IACF22C,EAAU54D,KAAKlE,GAAeA,EAAK8mB,KAAK+1C,QAI9CM,EAAWA,EAAS9xD,QAAQoyD,QAAkBz4D,IAATy4D,IAErC,MAAMC,EAAuC,CAAC,EAC9CP,EAASn/D,SAAS2/D,IAChB,MAAMC,EAAgBd,EACnBzxD,QAAQrL,GAASA,EAAK8mB,KAAK+1C,KAAmBc,IAC9Cz5D,KAAKlE,GAASg8D,EAAU1V,QAAQtmD,EAAK0gC,MAExCg9B,EAAWC,GAAWH,GAAmBI,EAAc,IAEzD15C,EAAQw4C,mBAAqBh5C,OAAO6qC,OAAOwO,EAAkB,CAC3DC,OAASh9D,GAAekkB,EAAQm2C,oBAAoBr6D,GACpDy1D,KAAOz1D,GAAekkB,EAAQm2C,oBAAoBr6D,GAClDi9D,OAASj9D,GAAekkB,EAAQm2C,oBAAoBr6D,GACpD8wC,OAAS9wC,IAEP,MAAMu9D,EAAYG,EAAW19D,EAAK8mB,KAAK+1C,IACvC,MAAO,CACLj8D,EAAG28D,aAAS,EAATA,EAAW38D,EACdF,EAAG68D,aAAS,EAATA,EAAW78D,EACdi/C,EAAG4d,aAAS,EAATA,EAAW5d,EACf,G,CAIP,MAAM,KAAE8V,EAAI,OAAEuH,EAAM,OAAEC,GAAW/4C,EAAQw4C,oBAAsB,CAAC,EAC5DjH,GAAwB,mBAATA,IACjBvxC,EAAQw4C,mBAAmBjH,KAAO,IAAMA,GAEtCuH,GAA4B,mBAAXA,IACnB94C,EAAQw4C,mBAAmBM,OAAS,IAAMA,GAExCC,GAA4B,mBAAXA,IACnB/4C,EAAQw4C,mBAAmBO,OAAS,IAAMA,EAE9C,CAWQ,UAAA/B,CACNc,EACAx+D,EACAoiD,EACAmc,EACA73C,GAEA,MAAM25C,EAAkC,CAAC,EACnCf,EAAYd,EAAUhW,cACtB8X,EAAY9B,EAAU/T,cAC5B,KAAK6U,aAAS,EAATA,EAAW78D,QAAQ,OACxB,MAAM,QAAE89D,GAAY75C,EACpB1iB,KAAKw8D,aAAahC,EAAW6B,EAAQ35C,GACjC45C,GAAWt8D,KAAKy8D,cAAcjC,EAAW6B,EAAQ35C,GACrD1iB,KAAK08D,WAAWlC,EAAWx+D,EAAOqgE,EAAQ35C,GAC1C1iB,KAAK28D,eAAenC,EAAW6B,EAAQ9B,EAAQ73C,GAG3C65C,GAEFA,EAAQ,CACNK,OAFa58D,KAAK68D,eAAeR,EAAQf,GAGzC7+D,MAAOT,EAAMwoD,cACb/mD,MAAOzB,EAAMyqD,cACb8S,WAAYnb,GAGlB,CAQQ,cAAAye,CAAeR,EAAiC5/D,GACtD,KAAKA,aAAK,EAALA,EAAOgC,QAAQ,OAAO,EAC3B,IAAIm+D,EAAS,EAWb,OATAngE,EAAMD,SAAQ,CAACgC,EAAMgD,KACnB,MAAMy2D,EAAKoE,EAAO79D,EAAK0gC,IAAI9/B,EACrB84D,EAAKmE,EAAO79D,EAAK0gC,IAAIhgC,EACrBi5D,EAAiC,IAA5Bn4D,KAAK0iB,QAAQm1C,WAAmBwE,EAAO79D,EAAK0gC,IAAIif,EAAI,EACzD2e,EAAS7E,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,GAClC,KAAEkC,EAAO,GAAM77D,EAAK8mB,KAC1Bs3C,GAAUvC,EAAOyC,EAAS,EAAG,IAGxBF,CACT,CAQO,YAAAJ,CACLhC,EACA6B,EACA35C,GAEA,MAAM,WAAEm1C,EAAU,OAAE13B,EAAM,gBAAEq4B,GAAoB91C,GV9jB7C,SACL83C,EACAr6B,EACA48B,EACAV,EACAxE,EAAqB,GAErB,MAAMmF,EAAc78B,EAAS48B,EACvBzB,EAAYd,EAAUhW,cACtBl/B,EAAOg2C,EAAU54D,KAAI,CAACu6D,EAAUz7D,KACpC,MAAM,aAAE+2D,EAAY,EAAEn5D,EAAC,EAAEF,EAAC,EAAEi/C,EAAC,KAAE3mC,GAASylD,EAAS33C,KACjD,MAAO,CACLlmB,IACAF,IACAi/C,IACA3mC,OACAhK,MAAOhM,EACP09B,GAAI+9B,EAAS/9B,GACb+4B,GAAI,EACJC,GAAI,EACJC,GAAI,EACJ/7D,OAAQ4gE,EAAczE,EACvB,IAGGlrD,GACW,IAAfwqD,EACI/C,GACExvC,GACCzI,GAAWA,EAAEzd,IACbyd,GAAWA,EAAE3d,IAEhB02D,GACEtwC,GACCzI,GAAWA,EAAEzd,IACbyd,GAAWA,EAAE3d,IACb2d,GAAWA,EAAEshC,KAEpByY,WAAWC,IAEPhQ,EAAU,IAAI1iC,IACpBmB,EAAK9oB,SAASu0B,IACZ81B,EAAQljC,IAAIoN,EAAEmO,GAAInO,GAoGtB,SAAsBvyB,EAAoB6O,EAAWwqD,GAEnDxqD,EAAK+Q,OAAM,CAAC04C,EAAUxC,EAAIE,EAAI0B,EAAIC,IAChCvwC,GAAMkxC,EAAUxC,EAAIE,EAAI0B,EAAIC,EAAI33D,EAAMq5D,IAE1C,CAvGIqF,CAAansC,EAAG1jB,EAAMwqD,EAAW,IAGnCvyC,EAAK5iB,KAAI,CAACquB,EAAGvvB,KACX,MAAM,GAAE09B,EAAE,KAAE5Z,GAASg2C,EAAU95D,IACzB,KAAE64D,EAAO,GAAM/0C,EAErB+2C,EAAOn9B,GAAM,CACX9/B,EAAG2xB,EAAEknC,GAAKoC,EACVn7D,EAAG6xB,EAAEmnC,GAAKmC,EACVlc,EAAGptB,EAAEonC,GAAKkC,EACX,GAGL,CUqgBI8C,CACE3C,EACAr6B,EACAq4B,EAAkBA,EAClB6D,EACAxE,EAEJ,CAOO,aAAA4E,CACLjC,EACA6B,EACA35C,GAEA,MAAM,WAAEm1C,EAAU,SAAExI,GAAa3sC,EACjC83C,EAAU/T,cAAcjqD,SAAQ,CAACL,EAAMqF,KACrC,MAAM,OAAEiO,EAAM,OAAED,GAAWrT,EACrBihE,EAAa5C,EAAU1V,QAAQr1C,GAC/B4tD,EAAa7C,EAAU1V,QAAQt1C,GACrC,IAAK4tD,IAAeC,EAAY,OAChC,IAAIC,EAAOD,EAAW/3C,KAAKlmB,EAAIg+D,EAAW93C,KAAKlmB,EAC3Cm+D,EAAOF,EAAW/3C,KAAKpmB,EAAIk+D,EAAW93C,KAAKpmB,EAC3Cs+D,EAAsB,IAAf3F,EAAmBwF,EAAW/3C,KAAK64B,EAAIif,EAAW93C,KAAK64B,EAAI,EACjEmf,GAASC,IACZD,EAAuB,IAAhBh7D,KAAK0hC,SACZu5B,EAAuB,IAAhBj7D,KAAK0hC,SAEO,IAAf6zB,GAAqB2F,IACvBA,EAAuB,IAAhBl7D,KAAK0hC,WAGhB,MAAMy5B,EAAYn7D,KAAK+lC,KAAKi1B,EAAOA,EAAOC,EAAOA,EAAOC,EAAOA,GAC/D,GAAIC,EAAYpO,EAAS+N,GAAc/N,EAASgO,GAAa,OAC7D,MAAMK,EAAQJ,EAAOG,EACfE,EAAQJ,EAAOE,EACfG,EAAQJ,EAAOC,GACf,aAAE7E,EAAe,IAAG,aAAEN,EAAe,KAAQn8D,EAAKmpB,MAAQ,CAAC,EAE3D0yC,GADOY,EAAe6E,GACPnF,EAIfuF,EAAkB,GAHLT,EAAW93C,KAAK+0C,MAAQ,GAIrCyD,EAAkB,GAHLT,EAAW/3C,KAAK+0C,MAAQ,GAIrC0D,EAAOL,EAAQ1F,EACfgG,EAAOL,EAAQ3F,EACfiG,EAAOL,EAAQ5F,EACrBqE,EAAO5sD,GAAQrQ,GAAK2+D,EAAOF,EAC3BxB,EAAO5sD,GAAQvQ,GAAK8+D,EAAOH,EAC3BxB,EAAO5sD,GAAQ0uC,GAAK8f,EAAOJ,EAC3BxB,EAAO7sD,GAAQpQ,GAAK2+D,EAAOD,EAC3BzB,EAAO7sD,GAAQtQ,GAAK8+D,EAAOF,EAC3BzB,EAAO7sD,GAAQ2uC,GAAK8f,EAAOH,CAAe,GAE9C,CASO,UAAApB,CACLlC,EACAx+D,EACAqgE,EACA35C,GAEA,MAAM,UAAEw7C,GAAcx7C,EAChB44C,EAAYd,EAAUhW,cACtB/nD,EAAQT,EAAMwoD,cACd/mD,EAAQzB,EAAMyqD,eACd,MACJzoD,EAAK,OACLC,EAAM,OACNqxC,EACA+oB,QAAS8F,EAAc,mBACvBjD,GACEx4C,EACC44C,GACLA,EAAU9+D,SAASygE,IACjB,MAAM,GAAE/9B,EAAE,KAAE5Z,GAAS23C,GACf,KAAE5C,EAAI,EAAEj7D,EAAC,EAAEF,EAAC,EAAEi/C,GAAM74B,EACpB9mB,EAAOxC,EAAM8oD,QAAQ5lB,GAC3B,IAAIo+B,EAAO,EACPC,EAAO,EACPC,EAAO,EACPnF,EAAU8F,EACd,MAAMC,EAAW5D,EAAUxU,UAAU9mB,EAAI,MACnCm/B,EAAY7D,EAAUxU,UAAU9mB,EAAI,OACpC47B,EAASN,EAAUxU,UAAU9mB,EAAI,QACjCo/B,EAAcJ,aAAS,EAATA,EAAY1/D,EAAMs8D,GACtC,GAAIwD,EAAa,CACf,MAAOC,EAASC,EAASC,GAAYH,EACrChB,EAAOl+D,EAAIm/D,EACXhB,EAAOr+D,EAAIs/D,EACXnG,EAAUoG,C,MAEVnB,EAAOl+D,EAAIkwC,EAAO,GAClBiuB,EAAOr+D,EAAIowC,EAAO,GAClBkuB,EAAOrf,EAAI7O,EAAO,GASpB,GANI+oB,IACFgE,EAAOn9B,GAAI9/B,GAAMi5D,EAAUiF,EAAQjD,EACnCgC,EAAOn9B,GAAIhgC,GAAMm5D,EAAUkF,EAAQlD,EACnCgC,EAAOn9B,GAAIif,GAAMka,EAAUmF,EAAQnD,GAGjCa,EAAoB,CACtB,MAAM,KACJjH,EAAI,OACJuH,EAAM,OACNC,EACAnsB,OAAQovB,GACNxD,GAEF97D,EAAGu/D,EACHz/D,EAAG0/D,EACHzgB,EAAG0gB,EAAO,eACVC,IACEJ,aAAY,EAAZA,EAAelgE,EAAM/B,EAAOgB,EAAOO,EAAOC,KAAW,CACvDmB,EAAG,EACHF,EAAG,EACHi/C,EAAG,EACH2gB,eAAgB,GAElB,IAAK,EAASH,KAAa,EAASC,GAAU,OAC9C,MAAM3G,GAAM74D,EAAIu/D,GAAWtE,EACrBnC,GAAMh5D,EAAI0/D,GAAWvE,EACrBlC,GAAMha,EAAI0gB,GAAWxE,EAQ3B,GAPIyE,IACFzC,EAAOn9B,GAAI9/B,GAAK0/D,EAAiB7G,EACjCoE,EAAOn9B,GAAIhgC,GAAK4/D,EAAiB5G,EACjCmE,EAAOn9B,GAAIif,GAAK2gB,EAAiB3G,GAIpB,IAAX2C,EAAc,CAChB,MAAMiE,EAAiBvD,EAAOh9D,GAC9B,IAAKugE,EAAgB,OAIrB,OAHA1C,EAAOn9B,GAAI9/B,GAAK2/D,EAAiB9G,EACjCoE,EAAOn9B,GAAIhgC,GAAK6/D,EAAiB7G,OACjCmE,EAAOn9B,GAAIif,GAAK4gB,EAAiB5G,E,CAKnC,GAAiB,IAAbiG,GAAgC,IAAdC,EAAiB,CACrC,MAAMW,EAAe/K,EAAKz1D,EAAM/B,EAAOgB,GACvC,IAAKuhE,EAAc,OAInB,OAHA3C,EAAOn9B,GAAI9/B,GAAK4/D,EAAe/G,EAC/BoE,EAAOn9B,GAAIhgC,GAAK8/D,EAAe9G,OAC/BmE,EAAOn9B,GAAIif,GAAK6gB,EAAe7G,E,CAKjC,MAAM8G,EAAiBxD,EAAOj9D,GAC9B,IAAKygE,EAAgB,OACrB5C,EAAOn9B,GAAI9/B,GAAK6/D,EAAiBhH,EACjCoE,EAAOn9B,GAAIhgC,GAAK+/D,EAAiB/G,EACjCmE,EAAOn9B,GAAIif,GAAK8gB,EAAiB9G,C,IAGvC,CAUO,cAAAwE,CACLnC,EACA6B,EACA9B,EACA73C,GAEA,MAAM,QAAE+1C,EAAO,SAAEC,EAAQ,SAAEx0B,EAAQ,WAAE2zB,GAAen1C,EAC9C44C,EAAYd,EAAUhW,eACvB8W,aAAS,EAATA,EAAW78D,SAChB68D,EAAU9+D,SAASygE,IACjB,MAAM,GAAE/9B,GAAO+9B,EACf,IAAIhF,GAAMsC,EAAOr7B,GAAI9/B,EAAIi9D,EAAOn9B,GAAI9/B,EAAI8kC,GAAYu0B,GAAW,IAC3DP,GAAMqC,EAAOr7B,GAAIhgC,EAAIm9D,EAAOn9B,GAAIhgC,EAAIglC,GAAYu0B,GAAW,IAC3DN,EACa,IAAfN,GACK0C,EAAOr7B,GAAIif,EAAIke,EAAOn9B,GAAIif,EAAIja,GAAYu0B,GAAW,IACtD,EACN,MAAMyG,EAAU58D,KAAK+lC,KAAK4vB,EAAKA,EAAKC,EAAKA,EAAKC,EAAKA,GACnD,GAAI+G,EAAUxG,EAAU,CACtB,MAAMyG,EAASzG,EAAWwG,EAC1BjH,GAAKkH,EACLjH,GAAKiH,EACLhH,GAAKgH,C,CAEP5E,EAAOr7B,GAAM,CACX9/B,EAAG64D,EACH/4D,EAAGg5D,EACH/Z,EAAGga,EACJ,GAEL,CAUO,cAAA2B,CACL99D,EACAw+D,EACAD,EACA73C,GAEA,MAAM,sBAAEo2C,EAAqB,SAAE50B,EAAQ,WAAE2zB,GAAen1C,EAClD44C,EAAYd,EAAUhW,cAC5B,KAAK8W,aAAS,EAATA,EAAW78D,QAEd,YADAuB,KAAKi5D,gBAAkB,GAGzB,IAAI1sD,EAAM,EACoB,QAA1BusD,EAAiC94D,KAAKi5D,iBAAkB,IACzB,QAA1BH,IAAiC94D,KAAKi5D,gBAAkBzL,KAEjE8N,EAAU9+D,SAASygE,IACjB,MAAM,GAAE/9B,GAAO+9B,EACTz+D,EAAOxC,EAAM8oD,QAAQ5lB,GAC3B,GAAI,EAAS1gC,EAAK8mB,KAAK85C,KAAO,EAAS5gE,EAAK8mB,KAAK+5C,IAM/C,YALA7E,EAAU/R,cAAcvpB,EAAI,CAC1B9/B,EAAGZ,EAAK8mB,KAAK85C,GACblgE,EAAGV,EAAK8mB,KAAK+5C,GACblhB,EAAkB,IAAf0Z,EAAoBr5D,EAAK8mB,KAAKg6C,QAAgB97D,IAIrD,MAAM+7D,EAAQhF,EAAOr7B,GAAI9/B,EAAI8kC,EACvBs7B,EAAQjF,EAAOr7B,GAAIhgC,EAAIglC,EACvBu7B,EAAuB,IAAf5H,EAAmB0C,EAAOr7B,GAAIif,EAAIja,EAAW,EAC3Ds2B,EAAU/R,cAAcvpB,EAAI,CAC1B9/B,EAAG69D,EAAS33C,KAAKlmB,EAAImgE,EACrBrgE,EAAG+9D,EAAS33C,KAAKpmB,EAAIsgE,EACrBrhB,EAAG8e,EAAS33C,KAAK64B,EAAIshB,IAGvB,MAAMC,EAAoBp9D,KAAK+lC,KAC7Bk3B,EAAQA,EAAQC,EAAQA,EAAQC,EAAQA,GAE1C,OAAQ3G,GACN,IAAK,MACC94D,KAAKi5D,gBAAkByG,IACzB1/D,KAAKi5D,gBAAkByG,GAEzB,MACF,IAAK,MACC1/D,KAAKi5D,gBAAkByG,IACzB1/D,KAAKi5D,gBAAkByG,GAEzB,MACF,QACEnzD,GAAYmzD,E,IAIb5G,GAAmD,SAA1BA,IAC5B94D,KAAKi5D,gBAAkB1sD,EAAM+uD,EAAU78D,OAE3C,EAiBF,MAAMm9D,GAAqB,CACzBpB,EACAa,KAEA,MAAMC,EAAYd,EAAUhW,cAC5B,KAAK8W,aAAS,EAATA,EAAW78D,QAAQ,MAAO,CAAC,EAChC,MAAMi9D,EAAmC,CAAC,EAY1C,OAXAJ,EAAU9+D,SAAQ,CAACgC,EAAMgD,KAER,IADAg5D,EAAUxU,UAAUxnD,EAAK0gC,GAAI,UAE1Cw8B,EAAgBl9D,EAAK0gC,IAAMygC,GACzBnF,EACA,OACAh8D,EACA68D,G,IAICK,CAAe,EAWlBiE,GAA8B,CAClCnF,EACAzgD,EACAvb,EACA68D,KAMA,MAAM+C,EAAW5D,EAAUxU,UAAUxnD,EAAK0gC,GAAI,MACxCm/B,EAAY7D,EAAUxU,UAAUxnD,EAAK0gC,GAAI,OAE/C,IAAI0gC,EAAiBphE,EACjBq9D,EAAwB,GAuB5B,OAtBiB,IAAbuC,GAEFwB,EAAWpF,EAAUvU,cAAcznD,EAAK0gC,IAAI,GAC5C28B,EAAgBrB,EAAU5U,aAAaga,EAAS1gC,KACzB,IAAdm/B,IAETuB,EAAWpF,EAAUrU,gBAAgB3nD,EAAK0gC,IAAI,GAC9C28B,EAAgBrB,EAAU5U,aAAaga,EAAS1gC,KAGlD28B,EAAgBA,EAAchyD,QAC3BrL,GACwC,IAAvCg8D,EAAUxU,UAAUxnD,EAAK0gC,GAAI,OACW,IAAxCs7B,EAAUxU,UAAUxnD,EAAK0gC,GAAI,SAS1B,CAAE0gC,WAAU/D,gBAAeC,eAPX+D,GACrBrF,EACAzgD,EACAshD,EACA78D,EACAq9D,GAEgD,EAY9CgE,GAAmB,CACvBrF,EACAzgD,EACAshD,EACA78D,EACAshE,KAEA,MAAMC,EAAWvhE,EAAK8mB,KAAK+1C,IAAkB,GAC7C,IAAIe,GACF0D,aAAa,EAAbA,EAAej2D,QAAQoyD,GAASA,EAAK32C,KAAK+1C,KAAmB0E,MAC7D,GAQF,MAPa,SAAThmD,IACFqiD,EAAgBA,EAAcvyD,QAC3BoyD,GACwC,IAAvCzB,EAAUxU,UAAUiW,EAAK/8B,GAAI,OACW,IAAxCs7B,EAAUxU,UAAUiW,EAAK/8B,GAAI,UAG5Bk9B,CAAa,EAQhBJ,GAAsBv/D,IAC1B,MAAMujE,EAAa,CAAE5gE,EAAG,EAAGF,EAAG,GAC9BzC,EAAMD,SAASgC,IACb,MAAM,EAAEY,EAAC,EAAEF,GAAMV,EAAK8mB,KACtB06C,EAAW5gE,GAAKA,GAAK,EACrB4gE,EAAW9gE,GAAKA,GAAK,CAAC,IAGxB,MAAMT,EAAShC,EAAMgC,QAAU,EAC/B,MAAO,CACLW,EAAG4gE,EAAW5gE,EAAIX,EAClBS,EAAG8gE,EAAW9gE,EAAIT,EACnB,EASGm8D,GAAiB,CAAC5+D,EAAco2D,IACpCA,EAAY1vD,KAAKu6D,IACf,MAAM,GAAE/9B,EAAE,KAAE5Z,GAAS23C,EACfz+D,EAAOxC,EAAM8oD,QAAQ5lB,GAC3B,OAAO,+BACF1gC,GAAI,CACP8mB,KAAM,OAAF,wBACC9mB,EAAK8mB,MAAI,CACZlmB,EAAGkmB,EAAKlmB,EACRF,EAAGomB,EAAKpmB,EACRi/C,EAAG74B,EAAK64B,KAEA,I,eCngCc3d,GAAA,GACXA,GAAA,GACkBA,GAAA,GACPA,GAAA,GACXA,GAAA,GACoBA,GAAA,GACrBA,GAAOqX,GACMrX,GAAA,GAPxB,MAQM+C,GAAS/C,GAAA,GAeTsY,IAd4BtY,GAAA,GACTA,GAAA,GACIA,GAAA,GACHA,GAAA,GACKA,GAAA,GACTA,GAAA,GACMA,GAAA,GACNA,GAAA,GACMA,GAAA,GACbA,GAAA,GACAA,GAAA,GACJA,GAAOkY,GACMlY,GAAA,GACZA,GAAA,GACuBA,GAAA,ICpB7B/iB,IDqBkB+iB,GAAA,EACAA,GAAA,GACAA,GAAA,GACJA,GAAA,GACDA,GAAA,GACXA,GAAA,GAAwBA,GAAA,GACZA,GAAA,GACJA,GAAA,GACWA,GAAA,GACLA,GAAA,GACRA,GAAA,GACDA,GAAA,GChCUy/B,IAE5B,MAAMC,EAAiB,GACjB1oD,EAAOyoD,EAAUxhE,OACvB,IAAK,IAAI+C,EAAI,EAAGA,EAAIgW,EAAMhW,GAAK,EAAG,CAChC0+D,EAAK1+D,GAAK,GACV,IAAK,IAAIwb,EAAI,EAAGA,EAAIxF,EAAMwF,GAAK,EACzBxb,IAAMwb,EACRkjD,EAAK1+D,GAAGwb,GAAK,EACgB,IAApBijD,EAAUz+D,GAAGwb,IAAaijD,EAAUz+D,GAAGwb,GAGhDkjD,EAAK1+D,GAAGwb,GAAKijD,EAAUz+D,GAAGwb,GAF1BkjD,EAAK1+D,GAAGwb,GAAKwwC,G,CAOnB,IAAK,IAAIntD,EAAI,EAAGA,EAAImX,EAAMnX,GAAK,EAC7B,IAAK,IAAImB,EAAI,EAAGA,EAAIgW,EAAMhW,GAAK,EAC7B,IAAK,IAAIwb,EAAI,EAAGA,EAAIxF,EAAMwF,GAAK,EACzBkjD,EAAK1+D,GAAGwb,GAAKkjD,EAAK1+D,GAAGnB,GAAK6/D,EAAK7/D,GAAG2c,KACpCkjD,EAAK1+D,GAAGwb,GAAKkjD,EAAK1+D,GAAGnB,GAAK6/D,EAAK7/D,GAAG2c,IAK1C,OAAOkjD,CAAI,GAGAC,GAAe,CAC1B76C,EACAhO,KAEA,MAAM,MAAE7a,EAAK,MAAEgB,GAAU6nB,EACnBkb,EAAmB,GAEnBqmB,EAEF,CAAC,EAEL,IAAKpqD,EACH,MAAM,IAAIme,MAAM,uBAoBlB,OAlBIne,GACFA,EAAMD,SAAQ,CAACgC,EAAMgD,KACnBqlD,EAAQroD,EAAK0gC,IAAM19B,EAEnBg/B,EAAOzjC,KADe,GACN,IAIpBU,SAAAA,EAAOjB,SAASN,IACd,MAAM,OAAEuT,EAAM,OAAED,GAAWtT,EACrBkkE,EAASvZ,EAAQp3C,GACjB4wD,EAASxZ,EAAQr3C,QACRhM,IAAX48D,QAAmC58D,IAAX68D,IAC5B7/B,EAAO4/B,GAAQC,GAAU,EACpB/oD,IACHkpB,EAAO6/B,GAAQD,GAAU,G,IAGtB5/B,CAAM,EA4DF8/B,GAAuB,CAAC93D,EAAWC,IAC9CnG,KAAK+lC,MAAM7/B,EAAGpJ,EAAIqJ,EAAGrJ,IAAMoJ,EAAGpJ,EAAIqJ,EAAGrJ,IAAMoJ,EAAGtJ,EAAIuJ,EAAGvJ,IAAMsJ,EAAGtJ,EAAIuJ,EAAGvJ,IAU1DqhE,GAAe,CAC1BvkE,EACAS,EACAse,EACAylD,EAAoB,KACpBna,EACAoa,EAGI,CAAC,KAEL,KAAKhkE,aAAK,EAALA,EAAOgC,QAAQ,OACpB,MAAM,aAAEiiE,EAAY,UAAEC,GAAcF,EACpC,IAAK,IAAIj/D,EAAI,EAAGA,EAAI/E,EAAMgC,OAAQ+C,IAAK,CACrC,MAAMhD,EAAO/B,EAAM+E,GACnB,GAAKxF,EAAM0Q,QAAQlO,EAAK0gC,OACpBwhC,aAAY,EAAZA,EAAeliE,IAAnB,CACA,GAAImiE,aAAS,EAATA,EAAYniE,GAAO,OACV,OAATgiE,GAAezlD,EAAGvc,GACtB+hE,GACEvkE,EACAA,EAAMuqD,YAAY/nD,EAAK0gC,GAAImnB,GAC3BtrC,EACAylD,EACAna,EACAoa,GAEW,OAATD,GAAezlD,EAAGvc,EAXY,C,GCvIhC,GAAqD,CACzD8wC,OAAQ,CAAC,EAAG,GACZspB,aAAc,IAkBT,MAAMgI,GAGX,WAAAl/C,CAAmBgB,EAA4B,CAAC,GAA7B,KAAAA,QAAAA,EAFnB,KAAAwc,GAAK,MAGHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAK6gE,kBAAiB,EAAO7kE,EAAO0mB,EAC7C,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAK6gE,kBAAiB,EAAM7kE,EAAO0mB,EACrC,G,CAYc,gBAAAm+C,CACZ9T,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,IACtC,OAAE4sB,EAAS,CAAC,EAAG,GAAE,aAAEspB,EAAe,IAAOjH,EAEzCl1D,EAAQT,EAAMwoD,cACd/mD,EAAQzB,EAAMyqD,cAEpB,KAAKhqD,aAAK,EAALA,EAAOgC,SAA2B,IAAjBhC,EAAMgC,OAC1B,OAAO4xD,GAAsBr0D,EAAO+wD,EAAQzd,GAI9C,MAAM2wB,EAAYE,GAAa,CAAE1jE,QAAOgB,UAAS,GAC3CqjE,EAAYrjD,GAAcwiD,GAChCc,GAAeD,GAGf,MAAME,EDlBiB,EAACxgC,EAAkBygC,KAC5C,MAAM50D,EAAmB,GAQzB,OAPAm0B,EAAOhkC,SAASgnC,IACd,MAAM2N,EAAmB,GACzB3N,EAAIhnC,SAASG,IACXw0C,EAAOp0C,KAAKJ,EAAIskE,EAAM,IAExB50D,EAAOtP,KAAKo0C,EAAO,IAEd9kC,CAAM,ECSK60D,CAAYJ,EAAWlI,GAGjCuI,EAAYC,GAAOJ,GACnB5O,EAAyB,GAsB/B,OArBA+O,EAAU3kE,SAAQ,CAAC8L,EAAa9G,KAC9B,MAAMgxD,EAAQ3C,GAAgBpzD,EAAM+E,IACpCgxD,EAAMltC,KAAKlmB,EAAIkJ,EAAE,GAAKgnC,EAAO,GAC7BkjB,EAAMltC,KAAKpmB,EAAIoJ,EAAE,GAAKgnC,EAAO,GAC7B8iB,EAAYr1D,KAAKy1D,EAAM,IAGrBzF,GACFqF,EAAY51D,SAASgC,GACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,MAKJ,CACbzC,MAAO21D,EACP30D,QAIJ,G,EAGF,MAAMsjE,GAAkBD,IACtB,IAAIO,GAAe,OACnBP,EAAUtkE,SAASgnC,IACjBA,EAAIhnC,SAASwe,IACPA,IAAUwyC,KAGV6T,EAAcrmD,IAChBqmD,EAAcrmD,E,GAEhB,IAEJ8lD,EAAUtkE,SAAQ,CAACgnC,EAAKhiC,KACtBgiC,EAAIhnC,SAAQ,CAACwe,EAAOgC,KACdhC,IAAUwyC,MACZsT,EAAUt/D,GAAGwb,GAAKqkD,E,GAEpB,GACF,EAOED,GAAUN,IACd,MAGMQ,EAAI,GAAS1vB,IAAI,GAASjC,IAAImxB,EAAW,IAAK,IAG9CS,EAAWD,EAAEzyB,KAAK,OAClB2yB,EAAWF,EAAEzyB,KAAK,UAClB4yB,EAAYH,EAAEzyB,OACpByyB,EAAE/kD,IAAIklD,GAAW16B,aAAaw6B,GAAUp6B,gBAAgBq6B,GAIxD,MAAME,EAAM,IAAI5oB,GAA2BwoB,GACrCK,EAAc,GAASt5B,KAAKq5B,EAAIxlB,gBAAgB3L,WACtD,OAAOmxB,EAAIzlB,oBAAoBpX,SAASniC,KAAK8gC,GACpC,GAASoO,IAAI,CAACpO,GAAM,CAACm+B,IACzB98B,SAAS,GACT/L,OAAO,EAlBM,IAmBhB,ECtJE8oC,GAAoD,CACxDC,QAAQ,EACRC,QAAQ,EACRC,SAAS,EACTC,aAAa,EACbC,aAAa,EACbC,OAAO,EACP,iBAAiB,GAGb,GAA+D,CACnE5yB,OAAQ,CAAC,EAAG,GACZ6yB,aAAc,GACd9b,QAAS,SC9BI,YAASjnD,GACtB,OAAO,WACL,OAAOA,CACT,CACF,CCJe,YAAS4kC,GACtB,OAA0B,MAAlBA,IAAW,GACrB,CCFA,IAAIpP,GAAO,CAAC5Z,MAAO,QAEnB,SAASonD,KACP,IAAK,IAAyCn7D,EAArCzF,EAAI,EAAGuvB,EAAI5X,UAAU1a,OAAQ9C,EAAI,CAAC,EAAM6F,EAAIuvB,IAAKvvB,EAAG,CAC3D,KAAMyF,EAAIkS,UAAU3X,GAAK,KAAQyF,KAAKtL,GAAM,QAAQ6xB,KAAKvmB,GAAI,MAAM,IAAI2T,MAAM,iBAAmB3T,GAChGtL,EAAEsL,GAAK,EACT,CACA,OAAO,IAAIo7D,GAAS1mE,EACtB,CAEA,SAAS0mE,GAAS1mE,GAChBqE,KAAKrE,EAAIA,CACX,CAoDA,SAASioB,GAAI7J,EAAM3c,GACjB,IAAK,IAA4B+uC,EAAxB3qC,EAAI,EAAGuvB,EAAIhX,EAAKtb,OAAW+C,EAAIuvB,IAAKvvB,EAC3C,IAAK2qC,EAAIpyB,EAAKvY,IAAIpE,OAASA,EACzB,OAAO+uC,EAAEnxB,KAGf,CAEA,SAAS2I,GAAI5J,EAAM3c,EAAMunC,GACvB,IAAK,IAAInjC,EAAI,EAAGuvB,EAAIhX,EAAKtb,OAAQ+C,EAAIuvB,IAAKvvB,EACxC,GAAIuY,EAAKvY,GAAGpE,OAASA,EAAM,CACzB2c,EAAKvY,GAAKozB,GAAM7a,EAAOA,EAAKtH,MAAM,EAAGjR,GAAG2B,OAAO4W,EAAKtH,MAAMjR,EAAI,IAC9D,KACF,CAGF,OADgB,MAAZmjC,GAAkB5qB,EAAKhd,KAAK,CAACK,KAAMA,EAAM4d,MAAO2pB,IAC7C5qB,CACT,CA1DAsoD,GAAS/hE,UAAY8hE,GAAS9hE,UAAY,CACxCohB,YAAa2gD,GACb9f,GAAI,SAAS+f,EAAU39B,GACrB,IAEI19B,EAd2BoyB,EAY3B19B,EAAIqE,KAAKrE,EACT4mE,GAb2BlpC,EAaO19B,GAAf2mE,EAAW,IAZnBE,OAAOC,MAAM,SAAS//D,KAAI,SAASuE,GAClD,IAAI7J,EAAO,GAAIoE,EAAIyF,EAAEw6C,QAAQ,KAE7B,GADIjgD,GAAK,IAAGpE,EAAO6J,EAAEwL,MAAMjR,EAAI,GAAIyF,EAAIA,EAAEwL,MAAM,EAAGjR,IAC9CyF,IAAMoyB,EAAM7S,eAAevf,GAAI,MAAM,IAAI2T,MAAM,iBAAmB3T,GACtE,MAAO,CAAC8S,KAAM9S,EAAG7J,KAAMA,EACzB,KASMoE,GAAK,EACLuvB,EAAIwxC,EAAE9jE,OAGV,KAAI0a,UAAU1a,OAAS,GAAvB,CAOA,GAAgB,MAAZkmC,GAAwC,mBAAbA,EAAyB,MAAM,IAAI/pB,MAAM,qBAAuB+pB,GAC/F,OAASnjC,EAAIuvB,GACX,GAAI9pB,GAAKq7D,EAAWC,EAAE/gE,IAAIuY,KAAMpe,EAAEsL,GAAK0c,GAAIhoB,EAAEsL,GAAIq7D,EAASllE,KAAMunC,QAC3D,GAAgB,MAAZA,EAAkB,IAAK19B,KAAKtL,EAAGA,EAAEsL,GAAK0c,GAAIhoB,EAAEsL,GAAIq7D,EAASllE,KAAM,MAG1E,OAAO4C,IAVP,CAFE,OAASwB,EAAIuvB,OAAQ9pB,GAAKq7D,EAAWC,EAAE/gE,IAAIuY,QAAU9S,EAAI2c,GAAIjoB,EAAEsL,GAAIq7D,EAASllE,OAAQ,OAAO6J,CAa/F,EACAwa,KAAM,WACJ,IAAIA,EAAO,CAAC,EAAG9lB,EAAIqE,KAAKrE,EACxB,IAAK,IAAIsL,KAAKtL,EAAG8lB,EAAKxa,GAAKtL,EAAEsL,GAAGwL,QAChC,OAAO,IAAI4vD,GAAS5gD,EACtB,EACAsB,KAAM,SAAShJ,EAAM2oD,GACnB,IAAK3xC,EAAI5X,UAAU1a,OAAS,GAAK,EAAG,IAAK,IAAgCsyB,EAAG9pB,EAA/Bga,EAAO,IAAI3T,MAAMyjB,GAAIvvB,EAAI,EAASA,EAAIuvB,IAAKvvB,EAAGyf,EAAKzf,GAAK2X,UAAU3X,EAAI,GACnH,IAAKxB,KAAKrE,EAAE6qB,eAAezM,GAAO,MAAM,IAAIa,MAAM,iBAAmBb,GACrE,IAAuBvY,EAAI,EAAGuvB,GAAzB9pB,EAAIjH,KAAKrE,EAAEoe,IAAoBtb,OAAQ+C,EAAIuvB,IAAKvvB,EAAGyF,EAAEzF,GAAGwZ,MAAM4K,MAAM88C,EAAMzhD,EACjF,EACA2E,MAAO,SAAS7L,EAAM2oD,EAAMzhD,GAC1B,IAAKjhB,KAAKrE,EAAE6qB,eAAezM,GAAO,MAAM,IAAIa,MAAM,iBAAmBb,GACrE,IAAK,IAAI9S,EAAIjH,KAAKrE,EAAEoe,GAAOvY,EAAI,EAAGuvB,EAAI9pB,EAAExI,OAAQ+C,EAAIuvB,IAAKvvB,EAAGyF,EAAEzF,GAAGwZ,MAAM4K,MAAM88C,EAAMzhD,EACrF,GAsBF,YCnFA,IAII0hD,GACAC,GALA,GAAQ,EACRC,GAAU,EACV3+B,GAAW,EACX4+B,GAAY,IAGZC,GAAY,EACZC,GAAW,EACXC,GAAY,EACZC,GAA+B,iBAAhBC,aAA4BA,YAAYj5D,IAAMi5D,YAAcvpC,KAC3EwpC,GAA6B,iBAAXvhE,QAAuBA,OAAOwhE,sBAAwBxhE,OAAOwhE,sBAAsB9tD,KAAK1T,QAAU,SAAS8X,GAAK2pD,WAAW3pD,EAAG,GAAK,EAElJ,SAASzP,KACd,OAAO84D,KAAaI,GAASG,IAAWP,GAAWE,GAAMh5D,MAAQ+4D,GACnE,CAEA,SAASM,KACPP,GAAW,CACb,CAEO,SAASQ,KACdxjE,KAAKyjE,MACLzjE,KAAK0jE,MACL1jE,KAAKF,MAAQ,IACf,CAyBO,SAAS6jE,GAAMh/B,EAAUi/B,EAAOpoE,GACrC,IAAIyL,EAAI,IAAIu8D,GAEZ,OADAv8D,EAAE48D,QAAQl/B,EAAUi/B,EAAOpoE,GACpByL,CACT,CAaA,SAAS68D,KACPd,IAAYD,GAAYG,GAAMh5D,OAAS+4D,GACvC,GAAQJ,GAAU,EAClB,KAdK,WACL34D,OACE,GAEF,IADA,IAAkBhO,EAAd+K,EAAI07D,GACD17D,IACA/K,EAAI8mE,GAAW/7D,EAAEy8D,QAAU,GAAGz8D,EAAEw8D,MAAM1gD,UAAKvf,EAAWtH,GAC3D+K,EAAIA,EAAEnH,QAEN,EACJ,CAMIikE,EACF,CAAE,QACA,GAAQ,EAWZ,WAEE,IADA,IAAIC,EAAmBC,EAAfC,EAAKvB,GAAcnnE,EAAOgyD,IAC3B0W,GACDA,EAAGT,OACDjoE,EAAO0oE,EAAGR,QAAOloE,EAAO0oE,EAAGR,OAC/BM,EAAKE,EAAIA,EAAKA,EAAGpkE,QAEjBmkE,EAAKC,EAAGpkE,MAAOokE,EAAGpkE,MAAQ,KAC1BokE,EAAKF,EAAKA,EAAGlkE,MAAQmkE,EAAKtB,GAAWsB,GAGzCrB,GAAWoB,EACXG,GAAM3oE,EACR,CAvBI4oE,GACApB,GAAW,CACb,CACF,CAEA,SAASqB,KACP,IAAIn6D,EAAMg5D,GAAMh5D,MAAO05D,EAAQ15D,EAAM64D,GACjCa,EAAQd,KAAWG,IAAaW,EAAOb,GAAY74D,EACzD,CAiBA,SAASi6D,GAAM3oE,GACT,KACAqnE,KAASA,GAAUyB,aAAazB,KACxBrnE,EAAOwnE,GACP,IACNxnE,EAAOgyD,MAAUqV,GAAUS,WAAWQ,GAAMtoE,EAAO0nE,GAAMh5D,MAAQ+4D,KACjE/+B,KAAUA,GAAWm1B,cAAcn1B,OAElCA,KAAU6+B,GAAYG,GAAMh5D,MAAOg6B,GAAWy2B,YAAY0J,GAAMvB,KACrE,GAAQ,EAAGM,GAASU,KAExB,CAnFAN,GAAMljE,UAAYqjE,GAAMrjE,UAAY,CAClCohB,YAAa8hD,GACbK,QAAS,SAASl/B,EAAUi/B,EAAOpoE,GACjC,GAAwB,mBAAbmpC,EAAyB,MAAM,IAAIrH,UAAU,8BACxD9hC,GAAgB,MAARA,EAAe0O,MAAS1O,IAAkB,MAATooE,EAAgB,GAAKA,GACzD5jE,KAAKF,OAAS8iE,KAAa5iE,OAC1B4iE,GAAUA,GAAS9iE,MAAQE,KAC1B2iE,GAAW3iE,KAChB4iE,GAAW5iE,MAEbA,KAAKyjE,MAAQ9+B,EACb3kC,KAAK0jE,MAAQloE,EACb2oE,IACF,EACA/K,KAAM,WACAp5D,KAAKyjE,QACPzjE,KAAKyjE,MAAQ,KACbzjE,KAAK0jE,MAAQlW,IACb2W,KAEJ,GC7CF,MAAM53B,GAAI,QACJJ,GAAI,WACJvG,GAAI,WCCH,SAAS,GAAE/oB,GAChB,OAAOA,EAAEzd,CACX,CAEO,SAAS,GAAEyd,GAChB,OAAOA,EAAE3d,CACX,CAEA,IAAIqlE,GAAgB,GAChBC,GAAeliE,KAAKquD,IAAM,EAAIruD,KAAK+lC,KAAK,IAE7B,YAAS5rC,GACtB,IAAIgoE,EACArqB,EAAQ,EACRsqB,EAAW,KACXC,EAAa,EAAIriE,KAAKqtC,IAAI+0B,EAAU,EAAI,KACxCE,EAAc,EACdC,EAAgB,GAChBC,EAAS,IAAI3gD,IACb4gD,EAAUpB,GAAMrzC,GAChB60B,EAAQ,GAAS,OAAQ,OACzBnhB,EDpBS,WACb,IAAI6E,EAAI,EACR,MAAO,KAAOA,GAAK0D,GAAI1D,EAAIsD,IAAKvG,IAAKA,EACvC,CCiBeo/B,GAIb,SAAS10C,IACPgpC,IACAnU,EAAMpiC,KAAK,OAAQ0hD,GACfrqB,EAAQsqB,IACVK,EAAQ3L,OACRjU,EAAMpiC,KAAK,MAAO0hD,GAEtB,CAEA,SAASnL,EAAKC,GACZ,IAAI/3D,EAAqBhD,EAAlBuyB,EAAIt0B,EAAMgC,YAEE+E,IAAf+1D,IAA0BA,EAAa,GAE3C,IAAK,IAAIl5D,EAAI,EAAGA,EAAIk5D,IAAcl5D,EAOhC,IANA+5C,IAAUwqB,EAAcxqB,GAASuqB,EAEjCG,EAAOtoE,SAAQ,SAAS0lE,GACtBA,EAAM9nB,EACR,IAEK54C,EAAI,EAAGA,EAAIuvB,IAAKvvB,EAEJ,OADfhD,EAAO/B,EAAM+E,IACJ49D,GAAY5gE,EAAKY,GAAKZ,EAAKy5D,IAAM4M,GACrCrmE,EAAKY,EAAIZ,EAAK4gE,GAAI5gE,EAAKy5D,GAAK,GAClB,MAAXz5D,EAAK6gE,GAAY7gE,EAAKU,GAAKV,EAAK05D,IAAM2M,GACrCrmE,EAAKU,EAAIV,EAAK6gE,GAAI7gE,EAAK05D,GAAK,GAIrC,OAAOuM,CACT,CAEA,SAASQ,IACP,IAAK,IAA6BzmE,EAAzBgD,EAAI,EAAGuvB,EAAIt0B,EAAMgC,OAAc+C,EAAIuvB,IAAKvvB,EAAG,CAIlD,IAHAhD,EAAO/B,EAAM+E,IAASgM,MAAQhM,EACf,MAAXhD,EAAK4gE,KAAY5gE,EAAKY,EAAIZ,EAAK4gE,IACpB,MAAX5gE,EAAK6gE,KAAY7gE,EAAKU,EAAIV,EAAK6gE,IAC/B/kB,MAAM97C,EAAKY,IAAMk7C,MAAM97C,EAAKU,GAAI,CAClC,IAAIoxD,EAASiU,GAAgBjiE,KAAK+lC,KAAK,GAAM7mC,GAAI0jE,EAAQ1jE,EAAIgjE,GAC7DhmE,EAAKY,EAAIkxD,EAAShuD,KAAKqyC,IAAIuwB,GAC3B1mE,EAAKU,EAAIoxD,EAAShuD,KAAK6yC,IAAI+vB,EAC7B,EACI5qB,MAAM97C,EAAKy5D,KAAO3d,MAAM97C,EAAK05D,OAC/B15D,EAAKy5D,GAAKz5D,EAAK05D,GAAK,EAExB,CACF,CAEA,SAASiN,EAAgBjD,GAEvB,OADIA,EAAMkD,YAAYlD,EAAMkD,WAAW3oE,EAAOunC,GACvCk+B,CACT,CAIA,OA1Da,MAATzlE,IAAeA,EAAQ,IAwD3BwoE,IAEOR,EAAa,CAClBnL,KAAMA,EAENuK,QAAS,WACP,OAAOkB,EAAQlB,QAAQvzC,GAAOm0C,CAChC,EAEArL,KAAM,WACJ,OAAO2L,EAAQ3L,OAAQqL,CACzB,EAEAhoE,MAAO,SAASd,GACd,OAAOwd,UAAU1a,QAAUhC,EAAQd,EAAGspE,IAAmBH,EAAOtoE,QAAQ2oE,GAAkBV,GAAchoE,CAC1G,EAEA29C,MAAO,SAASz+C,GACd,OAAOwd,UAAU1a,QAAU27C,GAASz+C,EAAG8oE,GAAcrqB,CACvD,EAEAsqB,SAAU,SAAS/oE,GACjB,OAAOwd,UAAU1a,QAAUimE,GAAY/oE,EAAG8oE,GAAcC,CAC1D,EAEAC,WAAY,SAAShpE,GACnB,OAAOwd,UAAU1a,QAAUkmE,GAAchpE,EAAG8oE,IAAeE,CAC7D,EAEAC,YAAa,SAASjpE,GACpB,OAAOwd,UAAU1a,QAAUmmE,GAAejpE,EAAG8oE,GAAcG,CAC7D,EAEAC,cAAe,SAASlpE,GACtB,OAAOwd,UAAU1a,QAAUomE,EAAgB,EAAIlpE,EAAG8oE,GAAc,EAAII,CACtE,EAEAQ,aAAc,SAAS1pE,GACrB,OAAOwd,UAAU1a,QAAUulC,EAASroC,EAAGmpE,EAAOtoE,QAAQ2oE,GAAkBV,GAAczgC,CACxF,EAEAk+B,MAAO,SAAS9kE,EAAMzB,GACpB,OAAOwd,UAAU1a,OAAS,GAAW,MAAL9C,EAAYmpE,EAAO/f,OAAO3nD,GAAQ0nE,EAAOnhD,IAAIvmB,EAAM+nE,EAAgBxpE,IAAM8oE,GAAcK,EAAOlhD,IAAIxmB,EACpI,EAEA0M,KAAM,SAAS1K,EAAGF,EAAGoxD,GACnB,IAEIxpD,EACAC,EACAwvD,EACA/3D,EACA8mE,EANA9jE,EAAI,EACJuvB,EAAIt0B,EAAMgC,OAUd,IAHc,MAAV6xD,EAAgBA,EAAS9C,IACxB8C,GAAUA,EAEV9uD,EAAI,EAAGA,EAAIuvB,IAAKvvB,GAInB+0D,GAFAzvD,EAAK1H,GADLZ,EAAO/B,EAAM+E,IACCpC,GAEJ0H,GADVC,EAAK7H,EAAIV,EAAKU,GACM6H,GACXupD,IAAQgV,EAAU9mE,EAAM8xD,EAASiG,GAG5C,OAAO+O,CACT,EAEA/iB,GAAI,SAASnlD,EAAMzB,GACjB,OAAOwd,UAAU1a,OAAS,GAAK0mD,EAAM5C,GAAGnlD,EAAMzB,GAAI8oE,GAActf,EAAM5C,GAAGnlD,EAC3E,EAEJ,CCtJe,cACb,IAAIX,EACA+B,EACAwlC,EACAoW,EAEAmrB,EADA9G,EAAWn7D,IAAU,IAErBkiE,EAAe,EACfC,EAAejY,IACfkY,EAAS,IAEb,SAASxD,EAAMvmE,GACb,IAAI6F,EAAGuvB,EAAIt0B,EAAMgC,OAAQ4O,EAAOynD,GAASr4D,EAAO,GAAG,IAAGm6D,WAAWC,GACjE,IAAKzc,EAAQz+C,EAAG6F,EAAI,EAAGA,EAAIuvB,IAAKvvB,EAAGhD,EAAO/B,EAAM+E,GAAI6L,EAAK+Q,MAAMwH,EACjE,CAEA,SAASw/C,IACP,GAAK3oE,EAAL,CACA,IAAI+E,EAAqBhD,EAAlBuyB,EAAIt0B,EAAMgC,OAEjB,IADA8mE,EAAY,IAAIj4D,MAAMyjB,GACjBvvB,EAAI,EAAGA,EAAIuvB,IAAKvvB,EAAGhD,EAAO/B,EAAM+E,GAAI+jE,EAAU/mE,EAAKgP,QAAUixD,EAASjgE,EAAMgD,EAAG/E,EAHlE,CAIpB,CAEA,SAASo6D,EAAW8O,GAClB,IAAkBv4B,EAAGjB,EAAe/sC,EAAGF,EAAGsC,EAAtCi9D,EAAW,EAASriE,EAAS,EAGjC,GAAIupE,EAAKlnE,OAAQ,CACf,IAAKW,EAAIF,EAAIsC,EAAI,EAAGA,EAAI,IAAKA,GACtB4rC,EAAIu4B,EAAKnkE,MAAQ2qC,EAAI7pC,KAAKgF,IAAI8lC,EAAEpyB,UACnCyjD,GAAYrxB,EAAEpyB,MAAO5e,GAAU+vC,EAAG/sC,GAAK+sC,EAAIiB,EAAEhuC,EAAGF,GAAKitC,EAAIiB,EAAEluC,GAG/DymE,EAAKvmE,EAAIA,EAAIhD,EACbupE,EAAKzmE,EAAIA,EAAI9C,CACf,KAGK,EACHgxC,EAAIu4B,GACFvmE,EAAIguC,EAAE9nB,KAAKlmB,EACbguC,EAAEluC,EAAIkuC,EAAE9nB,KAAKpmB,EACb,GAAGu/D,GAAY8G,EAAUn4B,EAAE9nB,KAAK9X,aACzB4/B,EAAIA,EAAE4U,KACf,CAEA2jB,EAAK3qD,MAAQyjD,CACf,CAEA,SAAS74C,EAAM+/C,EAAMrR,EAAI34D,EAAGu6D,GAC1B,IAAKyP,EAAK3qD,MAAO,OAAO,EAExB,IAAI5b,EAAIumE,EAAKvmE,EAAIZ,EAAKY,EAClBF,EAAIymE,EAAKzmE,EAAIV,EAAKU,EAClBpC,EAAIo5D,EAAK5B,EACTntD,EAAI/H,EAAIA,EAAIF,EAAIA,EAIpB,GAAIpC,EAAIA,EAAI4oE,EAASv+D,EAQnB,OAPIA,EAAIs+D,IACI,IAANrmE,IAA6B+H,IAApB/H,EAAIwmE,GAAO5hC,IAAkB5kC,GAChC,IAANF,IAA6BiI,IAApBjI,EAAI0mE,GAAO5hC,IAAkB9kC,GACtCiI,EAAIq+D,IAAcr+D,EAAI7E,KAAK+lC,KAAKm9B,EAAer+D,IACnD3I,EAAKy5D,IAAM74D,EAAIumE,EAAK3qD,MAAQo/B,EAAQjzC,EACpC3I,EAAK05D,IAAMh5D,EAAIymE,EAAK3qD,MAAQo/B,EAAQjzC,IAE/B,EAIJ,KAAIw+D,EAAKlnE,QAAU0I,GAAKs+D,GAAxB,EAGDE,EAAKrgD,OAAS9mB,GAAQmnE,EAAK3jB,QACnB,IAAN5iD,IAA6B+H,IAApB/H,EAAIwmE,GAAO5hC,IAAkB5kC,GAChC,IAANF,IAA6BiI,IAApBjI,EAAI0mE,GAAO5hC,IAAkB9kC,GACtCiI,EAAIq+D,IAAcr+D,EAAI7E,KAAK+lC,KAAKm9B,EAAer+D,KAGrD,GAAOw+D,EAAKrgD,OAAS9mB,IACnB1B,EAAIyoE,EAAUI,EAAKrgD,KAAK9X,OAAS4sC,EAAQjzC,EACzC3I,EAAKy5D,IAAM74D,EAAItC,EACf0B,EAAK05D,IAAMh5D,EAAIpC,SACR6oE,EAAOA,EAAK3jB,KAb4B,CAcnD,CAwBA,OAtBAkgB,EAAMkD,WAAa,SAAS1lD,EAAQmmD,GAClCppE,EAAQijB,EACRskB,EAAS6hC,EACTT,GACF,EAEAlD,EAAMzD,SAAW,SAAS9iE,GACxB,OAAOwd,UAAU1a,QAAUggE,EAAwB,mBAAN9iE,EAAmBA,EAAI2H,IAAU3H,GAAIypE,IAAclD,GAASzD,CAC3G,EAEAyD,EAAM4D,YAAc,SAASnqE,GAC3B,OAAOwd,UAAU1a,QAAU+mE,EAAe7pE,EAAIA,EAAGumE,GAAS5/D,KAAK+lC,KAAKm9B,EACtE,EAEAtD,EAAM6D,YAAc,SAASpqE,GAC3B,OAAOwd,UAAU1a,QAAUgnE,EAAe9pE,EAAIA,EAAGumE,GAAS5/D,KAAK+lC,KAAKo9B,EACtE,EAEAvD,EAAMxO,MAAQ,SAAS/3D,GACrB,OAAOwd,UAAU1a,QAAUinE,EAAS/pE,EAAIA,EAAGumE,GAAS5/D,KAAK+lC,KAAKq9B,EAChE,EAEOxD,CACT,CChHA,SAAS10D,GAAMqP,GACb,OAAOA,EAAErP,KACX,CAEA,SAAS,GAAKw4D,EAAUpe,GACtB,IAAIppD,EAAOwnE,EAASpiD,IAAIgkC,GACxB,IAAKppD,EAAM,MAAM,IAAIoc,MAAM,mBAAqBgtC,GAChD,OAAOppD,CACT,CAEe,YAASynE,GACtB,IAEIV,EAEAzE,EACArkE,EACAo9B,EACAjpB,EACAozB,EARA9E,EAAK1xB,GACLixD,EAYJ,SAAyByH,GACvB,OAAO,EAAI5jE,KAAK+F,IAAIwxB,EAAMqsC,EAAKz2D,OAAOjC,OAAQqsB,EAAMqsC,EAAK12D,OAAOhC,OAClE,EAZI4O,EAAW9Y,GAAS,IAMpBi2D,EAAa,EAQjB,SAAS2I,EAAM9nB,GACb,IAAK,IAAI/5C,EAAI,EAAG0wB,EAAIk1C,EAAMxnE,OAAQ4B,EAAIk5D,IAAcl5D,EAClD,IAAK,IAAW6lE,EAAMz2D,EAAQD,EAAQpQ,EAAGF,EAAGiI,EAAGD,EAAtC1F,EAAI,EAAqCA,EAAIuvB,IAAKvvB,EACxCiO,GAAjBy2D,EAAOD,EAAMzkE,IAAkBiO,OAC/BrQ,GADuCoQ,EAAS02D,EAAK12D,QAC1CpQ,EAAIoQ,EAAOyoD,GAAKxoD,EAAOrQ,EAAIqQ,EAAOwoD,IAAM2N,GAAO5hC,GAC1D9kC,EAAIsQ,EAAOtQ,EAAIsQ,EAAO0oD,GAAKzoD,EAAOvQ,EAAIuQ,EAAOyoD,IAAM0N,GAAO5hC,GAG1D5kC,GADA+H,IADAA,EAAI7E,KAAK+lC,KAAKjpC,EAAIA,EAAIF,EAAIA,IACjB4hE,EAAUt/D,IAAM2F,EAAIizC,EAAQmrB,EAAU/jE,GACvCtC,GAAKiI,EACbqI,EAAOyoD,IAAM74D,GAAK8H,EAAI0J,EAAKpP,IAC3BgO,EAAO0oD,IAAMh5D,EAAIgI,EACjBuI,EAAOwoD,IAAM74D,GAAK8H,EAAI,EAAIA,GAC1BuI,EAAOyoD,IAAMh5D,EAAIgI,CAGvB,CAEA,SAASk+D,IACP,GAAK3oE,EAAL,CAEA,IAAI+E,EAIA0kE,EAHAn1C,EAAIt0B,EAAMgC,OACVmnC,EAAIqgC,EAAMxnE,OACVunE,EAAW,IAAI7hD,IAAI1nB,EAAMiG,KAAI,CAACma,EAAGrb,IAAM,CAAC09B,EAAGriB,EAAGrb,EAAG/E,GAAQogB,MAG7D,IAAKrb,EAAI,EAAGq4B,EAAQ,IAAIvsB,MAAMyjB,GAAIvvB,EAAIokC,IAAKpkC,GACzC0kE,EAAOD,EAAMzkE,IAASgM,MAAQhM,EACH,iBAAhB0kE,EAAKz2D,SAAqBy2D,EAAKz2D,OAAS,GAAKu2D,EAAUE,EAAKz2D,SAC5C,iBAAhBy2D,EAAK12D,SAAqB02D,EAAK12D,OAAS,GAAKw2D,EAAUE,EAAK12D,SACvEqqB,EAAMqsC,EAAKz2D,OAAOjC,QAAUqsB,EAAMqsC,EAAKz2D,OAAOjC,QAAU,GAAK,EAC7DqsB,EAAMqsC,EAAK12D,OAAOhC,QAAUqsB,EAAMqsC,EAAK12D,OAAOhC,QAAU,GAAK,EAG/D,IAAKhM,EAAI,EAAGoP,EAAO,IAAItD,MAAMs4B,GAAIpkC,EAAIokC,IAAKpkC,EACxC0kE,EAAOD,EAAMzkE,GAAIoP,EAAKpP,GAAKq4B,EAAMqsC,EAAKz2D,OAAOjC,QAAUqsB,EAAMqsC,EAAKz2D,OAAOjC,OAASqsB,EAAMqsC,EAAK12D,OAAOhC,QAGtG+3D,EAAY,IAAIj4D,MAAMs4B,GAAIugC,IAC1BrF,EAAY,IAAIxzD,MAAMs4B,GAAIwgC,GArBR,CAsBpB,CAEA,SAASD,IACP,GAAK1pE,EAEL,IAAK,IAAI+E,EAAI,EAAGuvB,EAAIk1C,EAAMxnE,OAAQ+C,EAAIuvB,IAAKvvB,EACzC+jE,EAAU/jE,IAAMi9D,EAASwH,EAAMzkE,GAAIA,EAAGykE,EAE1C,CAEA,SAASG,IACP,GAAK3pE,EAEL,IAAK,IAAI+E,EAAI,EAAGuvB,EAAIk1C,EAAMxnE,OAAQ+C,EAAIuvB,IAAKvvB,EACzCs/D,EAAUt/D,IAAM4a,EAAS6pD,EAAMzkE,GAAIA,EAAGykE,EAE1C,CA4BA,OA1Fa,MAATA,IAAeA,EAAQ,IAgE3B/D,EAAMkD,WAAa,SAAS1lD,EAAQmmD,GAClCppE,EAAQijB,EACRskB,EAAS6hC,EACTT,GACF,EAEAlD,EAAM+D,MAAQ,SAAStqE,GACrB,OAAOwd,UAAU1a,QAAUwnE,EAAQtqE,EAAGypE,IAAclD,GAAS+D,CAC/D,EAEA/D,EAAMhjC,GAAK,SAASvjC,GAClB,OAAOwd,UAAU1a,QAAUygC,EAAKvjC,EAAGumE,GAAShjC,CAC9C,EAEAgjC,EAAM3I,WAAa,SAAS59D,GAC1B,OAAOwd,UAAU1a,QAAU86D,GAAc59D,EAAGumE,GAAS3I,CACvD,EAEA2I,EAAMzD,SAAW,SAAS9iE,GACxB,OAAOwd,UAAU1a,QAAUggE,EAAwB,mBAAN9iE,EAAmBA,EAAI2H,IAAU3H,GAAIwqE,IAAsBjE,GAASzD,CACnH,EAEAyD,EAAM9lD,SAAW,SAASzgB,GACxB,OAAOwd,UAAU1a,QAAU2d,EAAwB,mBAANzgB,EAAmBA,EAAI2H,IAAU3H,GAAIyqE,IAAsBlE,GAAS9lD,CACnH,EAEO8lD,CACT,CChHA,SAAS,GAAErlD,GACT,OAAOA,EAAEzd,EAAIyd,EAAEo7C,EACjB,CAEA,SAAS,GAAEp7C,GACT,OAAOA,EAAE3d,EAAI2d,EAAEq7C,EACjB,CAEe,YAAS5H,GACtB,IAAI7zD,EACA4pE,EACAriC,EACAy6B,EAAW,EACXlF,EAAa,EAIjB,SAAS2I,IASP,IARA,IAAI1gE,EACA6L,EACA7O,EACAmgD,EACAE,EACAynB,EACAC,EANGx1C,EAAIt0B,EAAMgC,OAQR4B,EAAI,EAAGA,EAAIk5D,IAAcl5D,EAEhC,IADAgN,EAAOynD,GAASr4D,EAAO,GAAG,IAAGm6D,WAAW4P,GACnChlE,EAAI,EAAGA,EAAIuvB,IAAKvvB,EACnBhD,EAAO/B,EAAM+E,GACb8kE,EAAKD,EAAM7nE,EAAKgP,OAAQ+4D,EAAMD,EAAKA,EACnC3nB,EAAKngD,EAAKY,EAAIZ,EAAKy5D,GACnBpZ,EAAKrgD,EAAKU,EAAIV,EAAK05D,GACnB7qD,EAAK+Q,MAAMwH,GAIf,SAASA,EAAM+/C,EAAMzR,EAAIE,EAAIE,EAAIE,GAC/B,IAAIlvC,EAAOqgD,EAAKrgD,KAAMmhD,EAAKd,EAAKt+D,EAAGA,EAAIi/D,EAAKG,EAC5C,IAAInhD,EAiBJ,OAAO4uC,EAAKvV,EAAKt3C,GAAKitD,EAAK3V,EAAKt3C,GAAK+sD,EAAKvV,EAAKx3C,GAAKmtD,EAAK3V,EAAKx3C,EAhB5D,GAAIie,EAAK9X,MAAQhP,EAAKgP,MAAO,CAC3B,IAAIpO,EAAIu/C,EAAKr5B,EAAKlmB,EAAIkmB,EAAK2yC,GACvB/4D,EAAI2/C,EAAKv5B,EAAKpmB,EAAIomB,EAAK4yC,GACvB/wD,EAAI/H,EAAIA,EAAIF,EAAIA,EAChBiI,EAAIE,EAAIA,IACA,IAANjI,IAA6B+H,IAApB/H,EAAIwmE,GAAO5hC,IAAkB5kC,GAChC,IAANF,IAA6BiI,IAApBjI,EAAI0mE,GAAO5hC,IAAkB9kC,GAC1CiI,GAAKE,GAAKF,EAAI7E,KAAK+lC,KAAKlhC,KAAOA,EAAIs3D,EACnCjgE,EAAKy5D,KAAO74D,GAAK+H,IAAME,GAAKo/D,GAAMA,IAAOF,EAAME,IAC/CjoE,EAAK05D,KAAOh5D,GAAKiI,GAAKE,EACtBie,EAAK2yC,IAAM74D,GAAKiI,EAAI,EAAIA,GACxBie,EAAK4yC,IAAMh5D,EAAImI,EAEnB,CAIJ,CACF,CAEA,SAASm/D,EAAQb,GACf,GAAIA,EAAKrgD,KAAM,OAAOqgD,EAAKt+D,EAAIg/D,EAAMV,EAAKrgD,KAAK9X,OAC/C,IAAK,IAAIhM,EAAImkE,EAAKt+D,EAAI,EAAG7F,EAAI,IAAKA,EAC5BmkE,EAAKnkE,IAAMmkE,EAAKnkE,GAAG6F,EAAIs+D,EAAKt+D,IAC9Bs+D,EAAKt+D,EAAIs+D,EAAKnkE,GAAG6F,EAGvB,CAEA,SAAS+9D,IACP,GAAK3oE,EAAL,CACA,IAAI+E,EAAqBhD,EAAlBuyB,EAAIt0B,EAAMgC,OAEjB,IADA4nE,EAAQ,IAAI/4D,MAAMyjB,GACbvvB,EAAI,EAAGA,EAAIuvB,IAAKvvB,EAAGhD,EAAO/B,EAAM+E,GAAI6kE,EAAM7nE,EAAKgP,QAAU8iD,EAAO9xD,EAAMgD,EAAG/E,EAH5D,CAIpB,CAoBA,MA/EsB,mBAAX6zD,IAAuBA,EAAShtD,GAAmB,MAAVgtD,EAAiB,GAAKA,IA6D1E4R,EAAMkD,WAAa,SAAS1lD,EAAQmmD,GAClCppE,EAAQijB,EACRskB,EAAS6hC,EACTT,GACF,EAEAlD,EAAM3I,WAAa,SAAS59D,GAC1B,OAAOwd,UAAU1a,QAAU86D,GAAc59D,EAAGumE,GAAS3I,CACvD,EAEA2I,EAAMzD,SAAW,SAAS9iE,GACxB,OAAOwd,UAAU1a,QAAUggE,GAAY9iE,EAAGumE,GAASzD,CACrD,EAEAyD,EAAM5R,OAAS,SAAS30D,GACtB,OAAOwd,UAAU1a,QAAU6xD,EAAsB,mBAAN30D,EAAmBA,EAAI2H,IAAU3H,GAAIypE,IAAclD,GAAS5R,CACzG,EAEO4R,CACT,CCjGe,YAAS9iE,GACtB,IACI3C,EACA8oE,EACAxP,EAHA0I,EAAWn7D,GAAS,IAOxB,SAAS4+D,EAAM9nB,GACb,IAAK,IAA6B57C,EAAzBgD,EAAI,EAAGuvB,EAAIt0B,EAAMgC,OAAc+C,EAAIuvB,IAAKvvB,GAC/ChD,EAAO/B,EAAM+E,IAASy2D,KAAOlC,EAAGv0D,GAAKhD,EAAKY,GAAKmmE,EAAU/jE,GAAK44C,CAElE,CAEA,SAASgrB,IACP,GAAK3oE,EAAL,CACA,IAAI+E,EAAGuvB,EAAIt0B,EAAMgC,OAGjB,IAFA8mE,EAAY,IAAIj4D,MAAMyjB,GACtBglC,EAAK,IAAIzoD,MAAMyjB,GACVvvB,EAAI,EAAGA,EAAIuvB,IAAKvvB,EACnB+jE,EAAU/jE,GAAK84C,MAAMyb,EAAGv0D,IAAMpC,EAAE3C,EAAM+E,GAAIA,EAAG/E,IAAU,GAAKgiE,EAAShiE,EAAM+E,GAAIA,EAAG/E,EALlE,CAOpB,CAeA,MA/BiB,mBAAN2C,IAAkBA,EAAIkE,GAAc,MAALlE,EAAY,GAAKA,IAkB3D8iE,EAAMkD,WAAa,SAASzpE,GAC1Bc,EAAQd,EACRypE,GACF,EAEAlD,EAAMzD,SAAW,SAAS9iE,GACxB,OAAOwd,UAAU1a,QAAUggE,EAAwB,mBAAN9iE,EAAmBA,EAAI2H,IAAU3H,GAAIypE,IAAclD,GAASzD,CAC3G,EAEAyD,EAAM9iE,EAAI,SAASzD,GACjB,OAAOwd,UAAU1a,QAAUW,EAAiB,mBAANzD,EAAmBA,EAAI2H,IAAU3H,GAAIypE,IAAclD,GAAS9iE,CACpG,EAEO8iE,CACT,CCtCe,YAAShjE,GACtB,IACIzC,EACA8oE,EACAvP,EAHAyI,EAAWn7D,GAAS,IAOxB,SAAS4+D,EAAM9nB,GACb,IAAK,IAA6B57C,EAAzBgD,EAAI,EAAGuvB,EAAIt0B,EAAMgC,OAAc+C,EAAIuvB,IAAKvvB,GAC/ChD,EAAO/B,EAAM+E,IAAS02D,KAAOlC,EAAGx0D,GAAKhD,EAAKU,GAAKqmE,EAAU/jE,GAAK44C,CAElE,CAEA,SAASgrB,IACP,GAAK3oE,EAAL,CACA,IAAI+E,EAAGuvB,EAAIt0B,EAAMgC,OAGjB,IAFA8mE,EAAY,IAAIj4D,MAAMyjB,GACtBilC,EAAK,IAAI1oD,MAAMyjB,GACVvvB,EAAI,EAAGA,EAAIuvB,IAAKvvB,EACnB+jE,EAAU/jE,GAAK84C,MAAM0b,EAAGx0D,IAAMtC,EAAEzC,EAAM+E,GAAIA,EAAG/E,IAAU,GAAKgiE,EAAShiE,EAAM+E,GAAIA,EAAG/E,EALlE,CAOpB,CAeA,MA/BiB,mBAANyC,IAAkBA,EAAIoE,GAAc,MAALpE,EAAY,GAAKA,IAkB3DgjE,EAAMkD,WAAa,SAASzpE,GAC1Bc,EAAQd,EACRypE,GACF,EAEAlD,EAAMzD,SAAW,SAAS9iE,GACxB,OAAOwd,UAAU1a,QAAUggE,EAAwB,mBAAN9iE,EAAmBA,EAAI2H,IAAU3H,GAAIypE,IAAclD,GAASzD,CAC3G,EAEAyD,EAAMhjE,EAAI,SAASvD,GACjB,OAAOwd,UAAU1a,QAAUS,EAAiB,mBAANvD,EAAmBA,EAAI2H,IAAU3H,GAAIypE,IAAclD,GAAShjE,CACpG,EAEOgjE,CACT,CC5Be,SAASwE,KACtB,SAASpjE,EAAS3H,GAChB,MAAO,IAAMA,CACf,CAEA,IAqBIgrE,EArBAC,EAAW/pD,GACNA,EAAEs/C,QAEP0K,EAAuDvjE,EAAS,GAChEwjE,EAAqDxjE,GAAU,GAC/DyjE,EAA2DzjE,EAAS,KACpE0jE,EAA2D1jE,EAAS,IACpEuX,EAAS,CAAC,EAAG,GAEbpe,EAAiB,GACjBwqE,EAAgB,CAAC,EACjBhB,EAAe,GACf1H,EAAU,IACVC,EAAU,IACV0I,EAAY,CACdC,KAAM,CACJ/nE,EAAG,EACHF,EAAG,IAGHkoE,EAAyB,GAEzBC,EAAW,QACXC,GAAiB,EACjB7I,EAAW,GAEf,SAASyD,EAAM9nB,GACb,IAAKktB,EACH,OAAOpF,EAETyE,EAAcrN,OACdiO,IAEA,IAAK,IAA6B/oE,EAAzBgD,EAAI,EAAGuvB,EAAIt0B,EAAMgC,OAAc4B,EAAI+5C,EAAQqkB,EAAUj9D,EAAIuvB,IAAKvvB,EACrEhD,EAAO/B,EAAM+E,GACbhD,EAAKy5D,KAAOiP,EAAKN,EAAQpoE,IAAOY,EAAIZ,EAAKY,GAAKiB,EAC9C7B,EAAK05D,KAAOgP,EAAKN,EAAQpoE,IAAOU,EAAIV,EAAKU,GAAKmB,CAElD,CAEA,SAAS+kE,IACF3oE,GAIP,WACE,IAAKA,IAAUA,EAAMgC,OACnB,OAGF,QAA0B+E,IAAtBojE,EAAQnqE,EAAM,IAChB,MAAMme,MACJ,4IAMJ,MAAM4sD,EAoBR,WACE,MAAMC,EAAc,GACdC,EAAc,GACdC,EAAc,CAAC,EACrB,IAAIC,EAAyB,GACzBC,EAAsB,CAAC,EACvBC,EAAqB,GAgCzB,OA9BAD,EAoCF,SAAmCprE,GACjC,MAAMorE,EAAsB,CAAC,EAqB7B,OAnBAprE,EAAMD,SAASqgB,IACb,MAAM2B,EAAMooD,EAAQ/pD,GACfgrD,EAAerpD,KAClBqpD,EAAerpD,GAAO,CACpBqb,MAAO,EACPkuC,iBAAkB,G,IAIxBtrE,EAAMD,SAASqgB,IACb,MAAM2B,EAAMooD,EAAQ/pD,GACdwyC,EAAWwX,EAAchqD,GACzBmrD,EAAWH,EAAerpD,GAChCwpD,EAASnuC,MAAQmuC,EAASnuC,MAAQ,EAClCmuC,EAASD,iBACPC,EAASD,iBAAmBzlE,KAAKquD,IAAMtB,EAAWA,GAAY,IAChEwY,EAAerpD,GAAOwpD,CAAQ,IAGzBH,CACT,CA3DmBI,CAA0BxrE,GAC3CqrE,EA4DF,SAAmC7B,GACjC,MAAMiC,EAAqB,CAAC,EACtBC,EAAoB,GA0B1B,OAzBAlC,EAAMzpE,SAAS2K,IACb,MAAMqX,EA2CV,SAAoB0nD,GAClB,MAAMz2D,EAASy2D,EAAKz2D,OACdD,EAAS02D,EAAK12D,OACd44D,EAAWxB,EAAQK,EAASx3D,IAC5B44D,EAAWzB,EAAQK,EAASz3D,IAElC,OAAO44D,GAAYC,EACf,GAAGD,KAAYC,IACf,GAAGA,KAAYD,GACrB,CApDgBE,CAAWnhE,GACvB,IAAI0yB,EAAQ,OACer2B,IAAvB0kE,EAAc1pD,KAChBqb,EAAQquC,EAAc1pD,IAExBqb,GAAS,EACTquC,EAAc1pD,GAAOqb,CAAK,IAIZ3X,OAAOnT,QAAQm5D,GAEvB1rE,SAAQ,EAAEgiB,EAAKqb,MACrB,MAAMpqB,EAAS+O,EAAIikD,MAAM,KAAK,GACxBjzD,EAASgP,EAAIikD,MAAM,KAAK,QACfj/D,IAAXiM,QAAmCjM,IAAXgM,GAC1B24D,EAAaprE,KAAK,CAChB0S,SACAD,SACAqqB,S,IAKCsuC,CACT,CAzFkBI,CAA0BtC,GAE1C2B,EAAe1lD,OAAO3D,KAAKspD,GAE3BD,EAAaprE,SAAQ,CAACgiB,EAAKhR,KACzB,MAAMg7D,EAAMX,EAAerpD,GAE3BipD,EAAO1qE,KAAK,CACVmiC,GAAI1gB,EACJhH,KAAMgxD,EAAI3uC,MACVxyB,EAAG/E,KAAK+lC,KAAKmgC,EAAIT,iBAAmBzlE,KAAKquD,MAE3CgX,EAAOnpD,GAAOhR,CAAK,IAGrBs6D,EAActrE,SAAS0pE,IACrB,MAAMuC,EAAiBvC,EAAKz2D,OACtBi5D,EAAiBxC,EAAK12D,OACtBC,EAASk4D,EAAOc,GAChBj5D,EAASm4D,EAAOe,QACPllE,IAAXiM,QAAmCjM,IAAXgM,GAC1Bk4D,EAAO3qE,KAAK,CACV0S,SACAD,SACAqqB,MAAOqsC,EAAKrsC,O,IAKX,CACLp9B,MAAOgrE,EACPxB,MAAOyB,EAEX,CA9DciB,GACZhC,EAAgB,GACGa,EAAI/qE,OACpBylE,MAAM,IAAK,GAAe3D,GAASE,SAAS,KAC5CyD,MAAM,IAAK,GAAe1D,GAASC,SAAS,KAC5CyD,MAAM,UAAW,IAAsBrlD,GAAWA,EAAExV,IAAGkyD,WAAW,IAClE2I,MAAM,SAAU,KAAwBzD,SAASqI,IACjD5E,MACC,QACA,GACasF,EAAI/qE,MAAMgC,OAAS+oE,EAAIvB,MAAQ,IACzC7pD,SAAS2qD,GACTtI,SAASuI,IAGhBI,EAAgBT,EAAclqE,QAE9B8qE,GACF,CAlCEqB,EACF,CAuIA,SAASrB,IAaP,OAZAL,EAAO,CACLC,KAAM,CACJ/nE,EAAG,EACHF,EAAG,IAGPkoE,EAAc5qE,SAASqgB,IACrBqqD,EAAKrqD,EAAEqiB,IAAM,CACX9/B,EAAGyd,EAAEzd,EAAIyb,EAAO,GAChB3b,EAAG2d,EAAE3d,EAAI2b,EAAO,GACjB,IAEIqsD,CACT,CA4LA,OApCAhF,EAAMkD,WAAczpE,IAClBc,EAAQd,EACRypE,GAAY,EAGdlD,EAAMmF,SAzIN,SAAqBjoE,GACnB,OAAK+Z,UAAU1a,QACf4oE,EAAWjoE,EACXgmE,IACOlD,GAHuBmF,CAIhC,EAsIAnF,EAAM0E,QApIN,SAAoBxnE,GAClB,OAAK+Z,UAAU1a,OACE,iBAANW,GACTwnE,EAAW/pD,GACFA,EAAEzd,GAEJ8iE,IAET0E,EAAUxnE,EACH8iE,GARuB0E,CAShC,EA4HA1E,EAAMoF,eA1HN,SAA2BloE,GACzB,OAAK+Z,UAAU1a,QACf6oE,EAAiBloE,EACV8iE,GAFuBoF,CAGhC,EAwHApF,EAAMzD,SAtHN,SAAqBr/D,GACnB,OAAK+Z,UAAU1a,QACfggE,EAAWr/D,EACJ8iE,GAFuBzD,CAGhC,EAoHAyD,EAAM3D,QAlHN,SAAoB5iE,GAClB,OAAIwd,UAAU1a,QACZ8/D,EAAU5iE,EACHumE,GAGF3D,CACT,EA6GA2D,EAAM1D,QA3GN,SAAoB7iE,GAClB,OAAIwd,UAAU1a,QACZ+/D,EAAU7iE,EACHumE,GAGF1D,CACT,EAsGA0D,EAAMzlE,MApGN,SAAkBd,GAChB,OAAIwd,UAAU1a,QAzDhB,SAAqBhC,GACnBwqE,EAAW,CAAC,EACZxqE,EAAMD,SAASgC,IACbyoE,EAASzoE,EAAK0gC,IAAM1gC,CAAI,GAE5B,CAqDIqqE,CAAYltE,GAAK,IACjBc,EAAQd,GAAK,GACNumE,GAEFzlE,CACT,EA+FAylE,EAAM+D,MA7FN,SAAkBtqE,GAChB,OAAIwd,UAAU1a,QACZwnE,EAAQtqE,GAAK,GACbypE,IACOlD,GAEF+D,CACT,EAwFA/D,EAAM2E,cAtFN,SAA0BlrE,GACxB,OAAIwd,UAAU1a,QAEVooE,EADe,mBAANlrE,EACOA,EAEA2H,GAAU3H,GAE5BypE,IACOlD,GAGF2E,CACT,EA6EA3E,EAAM7S,SAAW6S,EAAM2E,cAEvB3E,EAAM4E,YA7EN,SAAwBnrE,GACtB,OAAIwd,UAAU1a,QAEVqoE,EADe,mBAANnrE,EACKA,EAEA2H,GAAU3H,GAE1BypE,IACOlD,GAGF4E,CACT,EAmEA5E,EAAM6E,kBAjEN,SAA8BprE,GAC5B,OAAIwd,UAAU1a,QAEVsoE,EADe,mBAANprE,EACWA,EAEA2H,GAAU3H,GAEhCypE,IACOlD,GAGF6E,CACT,EAuDA7E,EAAM8E,kBArDN,SAA8BrrE,GAC5B,OAAIwd,UAAU1a,QAEVuoE,EADe,mBAANrrE,EACWA,EAEA2H,GAAU3H,GAEhCypE,IACOlD,GAGF8E,CACT,EA2CA9E,EAAMrnD,OAzCN,SAAmBlf,GACjB,OAAIwd,UAAU1a,QACZoc,EAASlf,EACFumE,GAGFrnD,CACT,EAoCAqnD,EAAM4G,SAAWvB,EAEVrF,CACT,CCvXA,MAAM,GAAyD,CAC7D5yB,OAAQ,CAAC,EAAG,GACZ8hB,gBAAgB,EAChB/B,cAAU7rD,EACV8rD,iBAAa9rD,EACbo1D,aAAc,GACdmQ,gBAAiB,KACjBpE,WAAY,KACZD,SAAU,KACVtqB,MAAO,GACP4uB,gBAAiB,EACjB5N,YAAY,EACZvC,qBAAsB,EACtBoQ,oBAAqB,GACrBC,oBAAqB,IACrBC,oBAAqB,GACrBC,gBAAiB,IA0Wb,GAAkBhX,GACtBA,EAAY1vD,KAAKlE,IACf,MAAM,EAAEY,EAAC,EAAEF,GAAiBV,EAAXi9D,EAAM,EAAKj9D,EAAtB,WACN,OAAO,OAAP,wBACKi9D,GAAM,CACTn2C,KAAM,OAAF,wBACCm2C,EAAOn2C,MAAI,CACdlmB,IACAF,OAAC,IAQHmqE,GAAkB5rE,GACtBA,EAAMiF,KAAKvG,IACT,MAAM,OAAEsT,EAAM,OAAED,GAAoBrT,EAATmtE,EAAI,EAAKntE,EAA9B,qBACN,OAAO,OAAP,wBACKmtE,GAAI,CACP75D,OAAQA,EAAOyvB,GACf1vB,OAAQA,EAAO0vB,IAAE,I,0BCzZhB,MAAMqqC,GAOX,WAAA7nD,CAAYgB,GAJL,KAAAwc,GAAK,QAEL,KAAAxc,QAAuC,CAAC,EAG7CR,OAAO6qC,OAAO/sD,KAAK0iB,QAAS6mD,GAAYC,eAAgB9mD,EAC1D,CAEM,OAAA+uC,CACJz1D,EACA0mB,G,yCAEA,OAAO1iB,KAAKypE,oBAAmB,EAAOztE,EAAO,OAAF,wBACtCgE,KAAK0iB,SACLA,GAEP,G,CAEM,MAAAqqC,CAAO/wD,EAAc0mB,G,+CACnB1iB,KAAKypE,oBAAmB,EAAMztE,EAAO,OAAF,wBAAOgE,KAAK0iB,SAAYA,GACnE,G,CAEc,kBAAA+mD,CACZ1c,EACA/wD,EACA0mB,G,yCAEA,MAAM,SAAE2sC,GAAa3sC,EACf5mB,EAAI,IAAI,GAAAV,SAAS0F,MACvBhF,EAAEuF,SAASqhB,GACX5mB,EAAE8lB,qBAAoB,KAAM,CAAG,KAK3B,IAHU5lB,EAAMwoD,iBACNxoD,EAAMyqD,eAEKZ,MAAK,EAAG3mB,QAAS,EAASA,MACjDjkB,QAAQwhC,MACN,0EAIJzgD,EAAMwoD,cAAchoD,SAASgC,IAC3B,MAAM,GAAE0gC,GAAO1gC,EACT8mB,EAAO,OAAH,UAAQ9mB,EAAK8mB,MACvB,QAAiB9hB,IAAb6rD,EAAwB,CAC1B,MAAOrxD,EAAOC,GCzDf,SAAmBuZ,GACxB,IAAKA,EAAM,MAAO,CAAC,EAAG,EAAG,GACzB,GAAI,EAASA,GAAO,MAAO,CAACA,EAAMA,EAAMA,GACnC,GAAoB,IAAhBA,EAAK/Y,OAAc,MAAO,CAAC,EAAG,EAAG,GAC1C,MAAOW,EAAGF,EAAIE,EAAG++C,EAAI/+C,GAAKoY,EAC1B,MAAO,CAACpY,EAAGF,EAAGi/C,EAChB,CDmDgCurB,CACtB,GAAWra,GAAYA,EAAS7wD,GAAQ6wD,GAE1CntC,OAAO6qC,OAAOznC,EAAM,CAAEtnB,QAAOC,U,CAE/BnC,EAAEwF,QAAQ49B,EAAGz+B,WAAY6kB,EAAK,IAEhCtpB,EAAMyqD,cAAcjqD,SAAQ,EAAG0iC,KAAIzvB,SAAQD,aACzC1T,EAAEwB,QAAQmS,EAAOhP,WAAY+O,EAAO/O,WAAY,CAAEy+B,MAAK,IAGzD,YAAapjC,GAEb,MAAM6tE,EAAyB,CAAEltE,MAAO,GAAIgB,MAAO,IAenD,OAbA3B,EAAEW,QAAQD,SAAS0iC,IACjB,MAAM5Z,EAAOxpB,EAAE0C,KAAK0gC,GACpByqC,EAAQltE,MAAMM,KAAK,CAAEmiC,KAAI5Z,SACrBynC,GAAQ/wD,EAAMysD,cAAcvpB,EAAI5Z,EAAK,IAG3CxpB,EAAE2B,QAAQjB,SAASL,IACjB,MAAM,EAAkBL,EAAEK,KAAKA,IAAzB,GAAE+iC,GAAE,EAAK5Z,EAAI,IAAb,SACE3oB,EAAG8S,EAAQ3S,EAAG0S,GAAWrT,EACjCwtE,EAAQlsE,MAAMV,KAAK,CAAEmiC,KAAIzvB,SAAQD,SAAQ8V,SACrCynC,GAAQ/wD,EAAM2tD,cAAczqB,EAAI5Z,EAAK,IAGpCqkD,CACT,G,EA5EO,GAAAH,eAA8C,CAAC,EEIzC,MAAMI,GAUnB,WAAAloD,CAAYurC,GAKVjtD,KAAKk/B,GAAK+tB,EAAO/tB,IAAM,EAKvBl/B,KAAK6pE,GAAK5c,EAAO4c,GAKjB7pE,KAAK8pE,GAAK7c,EAAO6c,GAKjB9pE,KAAKo/D,GAAK,EAKVp/D,KAAKq/D,GAAK,EAKVr/D,KAAKq6D,KAAOpN,EAAOoN,KAKnBr6D,KAAK86D,OAAS7N,EAAO6N,OAKrB96D,KAAKlE,EAAImxD,EAAOnxD,GAAK,CACvB,CAEA,UAAAiuE,CAAWC,GACT,MAAMljE,EAAK9G,KAAK6pE,GAAKG,EAAGH,GAClB9iE,EAAK/G,KAAK8pE,GAAKE,EAAGF,GACxB,OAAOxnE,KAAK2nE,MAAMnjE,EAAIC,EACxB,CACA,MAAAmjE,CAAO9qE,EAAWF,GAChBc,KAAK6pE,GAAKzqE,EACVY,KAAK8pE,GAAK5qE,CACZ,CAEA,UAAAirE,GACEnqE,KAAKo/D,GAAK,EACVp/D,KAAKq/D,GAAK,CACZ,CACA,QAAA+K,CAASljE,GACP,MAAMJ,EAAKI,EAAE2iE,GAAK7pE,KAAK6pE,GACjB9iE,EAAKG,EAAE4iE,GAAK9pE,KAAK8pE,GACvB,IAAI5J,EAAO59D,KAAK2nE,MAAMnjE,EAAIC,GAC1Bm5D,EAAOA,EAAO,KAAS,KAASA,EAEhC,MAAMmK,EAAKrqE,KAAKlE,GAAKkE,KAAK86D,OAAS,IAAM5zD,EAAE4zD,OAAS,GAAMoF,EAC1DlgE,KAAKo/D,IAAOiL,EAAIvjE,EAAMo5D,EACtBlgE,KAAKq/D,IAAOgL,EAAItjE,EAAMm5D,CACxB,CAEA,GAAGyF,GACD,OAAOA,EAAK2E,SAAStqE,KAAK6pE,GAAI7pE,KAAK8pE,GACrC,CAEA,GAAAvtD,CAAIytD,GACF,MAAMO,EAAWvqE,KAAKq6D,KAAO2P,EAAG3P,KAC1Bj7D,GAAKY,KAAK6pE,GAAK7pE,KAAKq6D,KAAO2P,EAAGH,GAAKG,EAAG3P,MAAQkQ,EAC9CrrE,GAAKc,KAAK8pE,GAAK9pE,KAAKq6D,KAAO2P,EAAGF,GAAKE,EAAG3P,MAAQkQ,EAC9CC,EAAKxqE,KAAK86D,OAASkP,EAAGlP,OAO5B,OAAO,IAAI8O,GANe,CACxBC,GAAIzqE,EACJ0qE,GAAI5qE,EACJm7D,KAAMkQ,EACNzP,OAAQ0P,GAGZ,EClGa,MAAMC,GAMnB,WAAA/oD,CAAYurC,GAKVjtD,KAAK0qE,KAAOzd,EAAOyd,KAKnB1qE,KAAK2qE,KAAO1d,EAAO0d,KAKnB3qE,KAAKvB,OAASwuD,EAAOxuD,OAKrBuB,KAAK4qE,WAAa3d,EAAO2d,YAAc,CAAC,EAAG,GAK3C5qE,KAAKq6D,KAAOpN,EAAOoN,MAAQ,CAC7B,CACA,SAAAwQ,GACE,OAAO7qE,KAAKvB,MACd,CACA,QAAA6rE,CAASlrE,EAAWF,GAClB,MAAM4rE,EAAU9qE,KAAKvB,OAAS,EAC9B,OACEW,GAAKY,KAAK0qE,KAAOI,GACjB1rE,GAAKY,KAAK0qE,KAAOI,GACjB5rE,GAAKc,KAAK2qE,KAAOG,GACjB5rE,GAAKc,KAAK2qE,KAAOG,CAErB,CAGA,EAAAC,GACE,MAAM3rE,EAAIY,KAAK0qE,KAAO1qE,KAAKvB,OAAS,EAC9BS,EAAIc,KAAK2qE,KAAO3qE,KAAKvB,OAAS,EAC9B+iC,EAAMxhC,KAAKvB,OAAS,EAO1B,OADW,IAAIgsE,GALW,CACxBC,KAAMtrE,EACNurE,KAAMzrE,EACNT,OAAQ+iC,GAIZ,CAGA,EAAAwpC,GACE,MAAM5rE,EAAIY,KAAK0qE,KAAO1qE,KAAKvB,OAAS,EAC9BS,EAAIc,KAAK2qE,KAAO3qE,KAAKvB,OAAS,EAC9B+iC,EAAMxhC,KAAKvB,OAAS,EAO1B,OADW,IAAIgsE,GALA,CACbC,KAAMtrE,EACNurE,KAAMzrE,EACNT,OAAQ+iC,GAIZ,CAGA,EAAAypC,GACE,MAAM7rE,EAAIY,KAAK0qE,KAAO1qE,KAAKvB,OAAS,EAC9BS,EAAIc,KAAK2qE,KAAO3qE,KAAKvB,OAAS,EAC9B+iC,EAAMxhC,KAAKvB,OAAS,EAO1B,OADW,IAAIgsE,GALA,CACbC,KAAMtrE,EACNurE,KAAMzrE,EACNT,OAAQ+iC,GAIZ,CAGA,EAAA0pC,GACE,MAAM9rE,EAAIY,KAAK0qE,KAAO1qE,KAAKvB,OAAS,EAC9BS,EAAIc,KAAK2qE,KAAO3qE,KAAKvB,OAAS,EAC9B+iC,EAAMxhC,KAAKvB,OAAS,EAO1B,OADW,IAAIgsE,GALA,CACbC,KAAMtrE,EACNurE,KAAMzrE,EACNT,OAAQ+iC,GAIZ,EC3Ga,MAAM2pC,GAWnB,WAAAzpD,CAAYs2C,GAKVh4D,KAAKorE,KAAO,KAKZprE,KAAK2lE,KAAO,KACZ3lE,KAAK+qE,GAAK,KACV/qE,KAAKgrE,GAAK,KACVhrE,KAAKirE,GAAK,KACVjrE,KAAKkrE,GAAK,KAKVlrE,KAAK0zD,MAAQ,GACA,MAATsE,IAAeh4D,KAAK2lE,KAAO3N,EACjC,CAEA,MAAAqT,CAAOrB,GAEY,MAAbhqE,KAAKorE,KAKJprE,KAAKsrE,eAQJtrE,KAAK2lE,OACP3lE,KAAK+qE,GAAK,IAAII,GAASnrE,KAAK2lE,KAAKoF,MACjC/qE,KAAKgrE,GAAK,IAAIG,GAASnrE,KAAK2lE,KAAKqF,MACjChrE,KAAKirE,GAAK,IAAIE,GAASnrE,KAAK2lE,KAAKsF,MACjCjrE,KAAKkrE,GAAK,IAAIC,GAASnrE,KAAK2lE,KAAKuF,OAInClrE,KAAKurE,SAASvrE,KAAKorE,MACnBprE,KAAKurE,SAASvB,GAEdhqE,KAAKorE,KAAOprE,KAAKorE,KAAK7uD,IAAIytD,KAjB1BhqE,KAAKorE,KAAOprE,KAAKorE,KAAK7uD,IAAIytD,GAE1BhqE,KAAKurE,SAASvB,IARdhqE,KAAKorE,KAAOpB,CAyBhB,CAGA,QAAAuB,CAASvB,GACFhqE,KAAK2lE,OACNqE,EAAGrjB,GAAG3mD,KAAK2lE,KAAKoF,OAAS/qE,KAAK+qE,GAAI/qE,KAAK+qE,GAAGM,OAAOrB,GAC5CA,EAAGrjB,GAAG3mD,KAAK2lE,KAAKqF,OAAShrE,KAAKgrE,GAAIhrE,KAAKgrE,GAAGK,OAAOrB,GACjDA,EAAGrjB,GAAG3mD,KAAK2lE,KAAKsF,OAASjrE,KAAKirE,GAAIjrE,KAAKirE,GAAGI,OAAOrB,GACjDA,EAAGrjB,GAAG3mD,KAAK2lE,KAAKuF,OAASlrE,KAAKkrE,IAAIlrE,KAAKkrE,GAAGG,OAAOrB,GAC5D,CAEA,WAAAsB,GAEE,OACa,MAAXtrE,KAAK+qE,IAAyB,MAAX/qE,KAAKgrE,IAAyB,MAAXhrE,KAAKirE,IAAyB,MAAXjrE,KAAKkrE,EAElE,CAEA,WAAAM,CAAYxB,GACO,MAAbhqE,KAAKorE,MAAgBpB,IAAOhqE,KAAKorE,OAIjCprE,KAAKsrE,gBAGGtrE,KAAK2lE,KAAO3lE,KAAK2lE,KAAKkF,YAAc,GACpC7qE,KAAKorE,KAAKrB,WAAWC,GAEnBhqE,KAAK0zD,MANKsW,EAAGI,SAASpqE,KAAKorE,OAQrCprE,KAAK+qE,IAAM/qE,KAAK+qE,GAAGS,YAAYxB,GAC/BhqE,KAAKgrE,IAAMhrE,KAAKgrE,GAAGQ,YAAYxB,GAC/BhqE,KAAKirE,IAAMjrE,KAAKirE,GAAGO,YAAYxB,GAC/BhqE,KAAKkrE,IAAMlrE,KAAKkrE,GAAGM,YAAYxB,IAGrC,ECrFF,MAAM,GAA6D,CACjE16B,OAAQ,CAAC,EAAG,GACZtxC,MAAO,IACPC,OAAQ,IACRwtE,GAAI,EACJC,GAAI,EACJlL,KAAM,SACNpP,gBAAgB,EAChBua,cAAc,EACdvT,aAAc,EACd7d,GAAI,GACJqxB,MAAO,GACPC,IAAK,ICjBD,GAA6D,CACjEzT,aAAc,IACdC,QAAS,GACTyT,MAAO,EACP1Q,YAAY,EACZ2Q,eAAgB,GAChB/tE,MAAO,IACPC,OAAQ,IACRo9D,cAAe,WCOX,GAAsD,CAC1D2Q,MAAO,CAAC,EAAG,GACX5a,gBAAgB,EAChB6a,sBAAuB,GACvBC,UAAU,EACVrrC,UAAMr9B,EACN0oC,UAAM1oC,EACNa,cAAUb,EACV2G,OAAQ,SACRklD,SAAU,GACVrxD,MAAO,IACPC,OAAQ,KAgRJkuE,GAAQ,CACZC,EACA5D,KAEA,IAAI6D,EACJ,MAAMxrC,EAAOurC,EAAIvrC,MAAQ,EACnBqL,EAAOkgC,EAAIlgC,MAAQ,EAWzB,OAVW,MAAPs8B,EACF6D,EAAM/pE,KAAK+F,IAAIw4B,EAAMqL,GAET5pC,KAAK+F,IAAIw4B,EAAMqL,KACfkgC,EAAIvrC,KACdurC,EAAIvrC,KAAO2nC,EAEX4D,EAAIlgC,KAAOs8B,EAGR6D,CAAG,EAGNC,GAAQ,CAACF,EAAkB5D,KAC/B,IAAIn8D,EACJ,MAAMkgE,EAAWH,EAAIvrC,MAAQ,EACvB2rC,EAAWJ,EAAIlgC,MAAQ,EAW7B,OAVW,MAAPs8B,EACFn8D,EAAS/J,KAAKC,IAAIgqE,EAAUC,GAEhBlqE,KAAKC,IAAIgqE,EAAUC,KACnBJ,EAAIvrC,KACdurC,EAAIvrC,KAAO2nC,EAEX4D,EAAIlgC,KAAOs8B,EAGRn8D,CAAM,EAGTogE,GAAO,CAACC,EAAoBC,IAChCD,EAAS,KAAKC,EAAGnpC,OAAOmpC,EAAGv8B,SAAU,EAEjCw8B,GAAM,CAACF,EAAoBC,IAC9BD,EAAS,KAAKC,EAAGnpC,OAAOmpC,EAAGv8B,QAAS,EAEjCy8B,GAAiB,CAACT,EAAkBO,KACxC,MAAMzgC,EAAOkgC,EAAIlgC,MAAQ,EACzBygC,EAAGv8B,MACCu8B,EAAGv8B,KAAOlE,IACZygC,EAAGv8B,IAAM,EACTu8B,EAAGnpC,M,EAIDspC,GAAS,CACbtuE,EACAwtE,EACAe,EACAC,EACAC,EACAb,EACAO,EACAD,KAEA,IAAIttE,EACAF,EAGJ,MAAMguE,EAAQD,EAAUzuE,EAAK0gC,IAC7B,GAAIguC,EACF9tE,EAAI8tE,EAAM98B,IAAM28B,EAAYA,EAAY,EAAIf,EAAM,GAClD9sE,EAAIguE,EAAM1pC,IAAMwpC,EAAaA,EAAa,EAAIhB,EAAM,OAC/C,CAGL,KAAOS,GAAKC,EAAUC,IACpBE,GAAeT,EAAKO,GAGtBvtE,EAAIutE,EAAGv8B,IAAM28B,EAAYA,EAAY,EAAIf,EAAM,GAC/C9sE,EAAIytE,EAAGnpC,IAAMwpC,EAAaA,EAAa,EAAIhB,EAAM,GACjDY,GAAIF,EAAUC,GAEdE,GAAeT,EAAKO,E,CAEtBnuE,EAAK8mB,KAAKlmB,EAAIA,EACdZ,EAAK8mB,KAAKpmB,EAAIA,CAAC,EC5XX,GAAiE,CACrEq6D,WAAY,GACZt7D,OAAQ,GACRD,MAAO,GACP8tE,MAAO,IACPzT,QAAS,GACTh4D,EAAG,GA6CC8sE,GAAe,CACnB1wE,EACA0kE,EACAiM,EACA/sE,EACAgmE,EACA9W,KAEA4R,EAAU3kE,SAAQ,CAACG,EAAU6E,KAC3B4rE,EAAK5rE,GAAK,CAAEpC,EAAG,EAAGF,EAAG,GACrBiiE,EAAU3kE,SAAQ,CAACmF,EAAUqb,KAC3B,GAAIxb,IAAMwb,EACR,OAGF,GAAIqpD,EAAM7kE,KAAO6kE,EAAMrpD,GACrB,OAEF,IAAIqwD,EAAO1wE,EAAEyC,EAAIuC,EAAEvC,EACfkuE,EAAO3wE,EAAEuC,EAAIyC,EAAEzC,EACfu+D,EAAYn7D,KAAK+lC,KAAKglC,EAAOA,EAAOC,EAAOA,GAC/C,GAAkB,IAAd7P,EAAiB,CACnBA,EAAY,EACZ,MAAMvoB,EAAO1zC,EAAIwb,EAAI,GAAK,EAC1BqwD,EAAO,IAAOn4B,EACdo4B,EAAO,IAAOp4B,C,CAGhB,GAAIuoB,EAAYlO,EAAa9yD,EAAM+E,IAAM,EAAI+tD,EAAa9yD,EAAMugB,IAAM,EAAG,CACvE,MAAMuwD,EAAUltE,EAAIA,EAAKo9D,EACzB2P,EAAK5rE,GAAGpC,GAAMiuE,EAAO5P,EAAa8P,EAClCH,EAAK5rE,GAAGtC,GAAMouE,EAAO7P,EAAa8P,C,IAEpC,GACF,EAGEC,GAAkB,CACtBrM,EACAiM,EACAtB,EACA2B,EACAC,EACAC,EACA3vE,EACAqoE,KAEA,MAAMuH,EAAUD,GAAe3vE,EAAQ,GA6CvC,OA5CIyvE,GACFL,EAAK5wE,SAAQ,CAACqxE,EAAIrsE,KAChB,MAAMy2D,EAAKkJ,EAAU3/D,GAAGpC,EAAI+hE,EAAUuM,GAAUtuE,EAC1C84D,EAAKiJ,EAAU3/D,GAAGtC,EAAIiiE,EAAUuM,GAAUxuE,EAC1CggE,EAAU58D,KAAK+lC,KAAK4vB,EAAKA,EAAKC,EAAKA,GACzC,IAAI4V,EAAM5V,EAAKgH,EACX6O,GAAO9V,EAAKiH,EAChB,MAAM8O,EAAW1rE,KAAK+lC,KAAKwlC,EAAGzuE,EAAIyuE,EAAGzuE,EAAIyuE,EAAG3uE,EAAI2uE,EAAG3uE,GACnD,IAAIk7C,EAAQ93C,KAAK6xC,MAAM25B,EAAMD,EAAGzuE,EAAI2uE,EAAMF,EAAG3uE,GAAK8uE,GAC9C5zB,EAAQ93C,KAAKquD,GAAK,IACpBvW,GAAS93C,KAAKquD,GAAK,EACnBmd,IAAQ,EACRC,IAAQ,GAEV,MAAME,EAAc3rE,KAAKqyC,IAAIyF,GAAS4zB,EACtCH,EAAGzuE,EAAI0uE,EAAMG,EACbJ,EAAG3uE,EAAI6uE,EAAME,CAAW,IAK5B9M,EAAU3kE,SAAQ,CAACu0B,EAAGvvB,KACpB,GAAIA,IAAMksE,EACR,OAEF,MAAMQ,EAAa5rE,KAAK+lC,KAAK+kC,EAAK5rE,GAAGpC,EAAIguE,EAAK5rE,GAAGpC,EAAIguE,EAAK5rE,GAAGtC,EAAIkuE,EAAK5rE,GAAGtC,GACzE,GAAIgvE,EAAa,GAAK1sE,IAAMksE,EAAU,CACpC,MAAMS,EAAc7rE,KAAK+F,IACvBulE,GAAW9B,EAhJG,KAiJdoC,GAIF,GAFAn9C,EAAE3xB,GAAMguE,EAAK5rE,GAAGpC,EAAI8uE,EAAcC,EAClCp9C,EAAE7xB,GAAMkuE,EAAK5rE,GAAGtC,EAAIgvE,EAAcC,EAC9BV,EAAc,CAChB,IAAIxV,EAAKlnC,EAAE3xB,EAAI+hE,EAAUuM,GAAUtuE,EAC/B84D,EAAKnnC,EAAE7xB,EAAIiiE,EAAUuM,GAAUxuE,EACnC,MAAMkvE,EAAQ9rE,KAAK+lC,KAAK4vB,EAAKA,EAAKC,EAAKA,GACvCD,EAAMA,EAAKmW,EAAS/H,EAAM7kE,GAC1B02D,EAAMA,EAAKkW,EAAS/H,EAAM7kE,GAC1BuvB,EAAE3xB,EAAI+hE,EAAUuM,GAAUtuE,EAAI64D,EAC9BlnC,EAAE7xB,EAAIiiE,EAAUuM,GAAUxuE,EAAIg5D,C,MAI7BiJ,CAAS,ECxIZ,GAAwD,CAC5D/I,aAAc,IACdhI,UAAW,KACXie,WAAY,KACZzV,aAAc,GACdxH,gBAAgB,EAChBqc,cAAc,EACda,2BAA4B,IAC5BC,aAAc,ICzBV,GAAwD,CAC5Dj/B,OAAQ,CAAC,EAAG,GACZtxC,MAAO,IACPC,OAAQ,KCGGuwE,GAA8D,CACzEC,S/DwBK,MAGL,WAAA/sD,CACSgB,EAAiC,CAAC,GAAlC,KAAAA,QAAAA,EAHT,KAAAwc,GAAK,WAKHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAK0uE,uBAAsB,EAAO1yE,EAAO0mB,EAClD,G,CAKM,MAAAqqC,CAAO/wD,EAAc0mB,G,+CACnB1iB,KAAK0uE,uBAAsB,EAAM1yE,EAAO0mB,EAChD,G,CAYc,qBAAAgsD,CACZ3hB,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,IACtC,MACJ1kB,EAAK,OACLC,EAAM,OACNqxC,EAAM,UACNuhB,EAAS,WACTJ,EAAa,EAAC,SACdC,EAAW,EAAIpuD,KAAKquD,GAAE,WACtBI,EAAU,SACVD,EAAQ,UACRF,EACAtB,YAAaqf,EACbtf,SAAUuf,GACRjd,EAEEl1D,EAAgBT,EAAMwoD,cACtB/mD,EAAgBzB,EAAMyqD,eAGrBooB,EAAiBC,EAAkBC,GAoLtB,EACtB/wE,EACAC,EACAqxC,KAEA,IAAIu/B,EAAkB7wE,EAClB8wE,EAAmB7wE,EACnB8wE,EAAmBz/B,EAUvB,OATKu/B,GAAqC,oBAAXhtE,SAC7BgtE,EAAkBhtE,OAAOqwD,YAEtB4c,GAAsC,oBAAXjtE,SAC9BitE,EAAmBjtE,OAAOswD,aAEvB4c,IACHA,EAAmB,CAACF,EAAmB,EAAGC,EAAoB,IAEzD,CAACD,EAAkBC,EAAmBC,EAAiB,EApM1DC,CAAgBhxE,EAAOC,EAAQqxC,GAC3Bve,EAAIt0B,aAAK,EAALA,EAAOgC,OACjB,IAAKsyB,GAAW,IAANA,EACR,OAAOs/B,GAAsBr0D,EAAO+wD,EAAQgiB,GAG9C,MAAME,GAAave,EAAWD,GAAc1/B,EAE5C,IAAI,OAAEu/B,EAAM,YAAEC,EAAW,UAAEC,GAAcmB,EACzC,GAAIgd,EAAkB,CACpB,MAAMrf,EAAwBN,GAAe,GAAI2f,GAC3Ctf,EAAqBH,GAAa,GAAI0f,GAC5C,IAAIvc,GAAc,IAClB51D,EAAMD,SAASgC,IACb,MAAM0wE,EAAQ7f,EAAS7wD,GACnB6zD,EAAc6c,IAAO7c,EAAc6c,EAAK,IAE9C,IAAIC,EAAY,EAChB1yE,EAAMD,SAAQ,CAACgC,EAAMgD,KACN2tE,GAAH,IAAN3tE,EAAsB6wD,GAAe,IACtB/C,EAAY9wD,IAAS,IAAM6zD,GAAe,GAAG,IAElE/B,EAAS6e,GAAa,EAAI7sE,KAAKquD,G,MACrBL,GAAWC,GAAgBC,GAE3BD,GAAeC,EACzBD,EAAcC,EACLD,IAAgBC,IACzBA,EAAYD,GAJZD,EAAShuD,KAAK+F,IAAIymE,EAAkBD,GAAmB,EAMzD,MAAMO,EAAQH,EAAYle,EAG1B,IAAIqB,EAAyB,GAG3BA,EAFe,aAAbtB,EAEYE,GAAiBh1D,EAAOS,GAChB,sBAAbq0D,EAEKE,GAAiBh1D,EAAOS,GAAO,GACvB,WAAbq0D,EAwHf,SAAwB90D,EAAcS,GACpC,MAAM4yE,EAA0B,GAQhC,OAPA5yE,EAAMD,SAAQ,CAACgC,EAAMgD,KACnB6tE,EAAatyE,KAAK8yD,GAAgBrxD,GAAiB,IAErD6wE,EAAat/D,MACX,CAACu/D,EAAaC,IACZvzE,EAAMgqD,UAAUspB,EAAMpwC,GAAI,QAAUljC,EAAMgqD,UAAUupB,EAAMrwC,GAAI,UAE3DmwC,CACT,CAhIoBG,CAAexzE,EAAOS,GAGtBA,EAAMiG,KAAKlE,GAASqxD,GAAgBrxD,KAGpD,MAAMixE,EAAOntE,KAAK6R,KAAK4c,EAAI8/B,GAC3B,IAAK,IAAIrvD,EAAI,EAAGA,EAAIuvB,IAAKvvB,EAAG,CAC1B,IAAI6F,EAAIipD,EACHjpD,GAAqB,OAAhBkpD,GAAsC,OAAdC,IAChCnpD,EAAIkpD,EAAgB/uD,GAAKgvD,EAAaD,IAAkBx/B,EAAI,IAEzD1pB,IACHA,EAAI,GAAU,IAAJ7F,GAAYuvB,EAAI,IAE5B,IAAIm0C,EACFzU,EACCjvD,EAAIiuE,EAAQL,EACX,EAAI9sE,KAAKquD,GAAME,EAAcvuD,KAAK2R,MAAMzS,EAAIiuE,GAC3C7e,IACHsU,EACExU,EACClvD,EAAIiuE,EAAQL,EACX,EAAI9sE,KAAKquD,GAAME,EAAcvuD,KAAK2R,MAAMzS,EAAIiuE,IAElDrd,EAAY5wD,GAAG8jB,KAAKlmB,EAAI2vE,EAAiB,GAAKzsE,KAAKqyC,IAAIuwB,GAAS79D,EAChE+qD,EAAY5wD,GAAG8jB,KAAKpmB,EAAI6vE,EAAiB,GAAKzsE,KAAK6yC,IAAI+vB,GAAS79D,C,CAiBlE,OAdI0lD,GACFqF,EAAY51D,SAASgC,IACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,GACb,IAIS,CACbzC,MAAO21D,EACP30D,QAIJ,G,G+D1KAiyE,WAAYle,GACZme,IAAK/O,GACL58B,ODWK,MAGL,WAAAtiB,CAAmBgB,EAA+B,CAAC,GAAhC,KAAAA,QAAAA,EAFnB,KAAAwc,GAAK,SAGHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAK4vE,qBAAoB,EAAO5zE,EAAO0mB,EAChD,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAK4vE,qBAAoB,EAAM5zE,EAAO0mB,EACxC,G,CAYc,mBAAAktD,CACZ7iB,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,IAE1C4sB,OAAQsiB,EACR5zD,MAAO6zD,EACP5zD,OAAQ6zD,GACNH,EAEEl1D,EAAQT,EAAMwoD,cAEdxmD,EACH6zD,GAAgC,oBAAXhwD,OAEjBgwD,EADDhwD,OAAOqwD,WAEPj0D,EACH6zD,GAAiC,oBAAXjwD,OAElBiwD,EADDjwD,OAAOswD,YAEP7iB,EAAUsiB,GACZ,CAAC5zD,EAAQ,EAAGC,EAAS,GAGnBm0D,EAAyB,GA2B/B,OA1BI31D,GACFA,EAAMD,SAASgC,IACb4zD,EAAYr1D,KAAK,CACfmiC,GAAI1gC,EAAK0gC,GACT5Z,KAAM,CACJlmB,EAnBY,IAmBRkD,KAAK0hC,SAAW,IAAqBhmC,EAAQsxC,EAAO,GACxDpwC,EApBY,IAoBRoD,KAAK0hC,SAAW,IAAqB/lC,EAASqxC,EAAO,KAE3D,IAIFyd,GACFqF,EAAY51D,SAASgC,GACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,MAKJ,CACbzC,MAAO21D,EACP30D,MAAOzB,EAAMyqD,cAIjB,G,GCjGAopB,KJyCK,MAGL,WAAAnuD,CAAmBgB,EAA6B,CAAC,GAA9B,KAAAA,QAAAA,EAFnB,KAAAwc,GAAK,OAGHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAK8vE,mBAAkB,EAAO9zE,EAAO0mB,EAC9C,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAK8vE,mBAAkB,EAAM9zE,EAAO0mB,EACtC,G,CAYc,iBAAAotD,CACZ/iB,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,IACtC,MACJspD,EAAQ,CAAC,EAAG,GAAE,SACdE,EAAQ,sBACRD,EAAqB,eACrB7a,EACAvwB,KAAMkvC,EACN7jC,KAAM8jC,EACN1gB,YAAaqf,EACbtf,SAAUuf,EACV5wE,MAAO6zD,EACP5zD,OAAQ6zD,EAAW,SACnBztD,GACEstD,EACJ,IAAI,OAAExnD,GAAWwnD,EAEjB,MAAMl1D,EAAgBT,EAAMwoD,cACtB/mD,EAAgBzB,EAAMyqD,cAEtB11B,EAAIt0B,aAAK,EAALA,EAAOgC,OAGjB,IAAKsyB,GAAW,IAANA,EACR,OAAOs/B,GAAsBr0D,EAAO+wD,EAAQif,GAG9C,MAAM5Z,EAAyB31D,EAAMiG,KAClClE,GAASqxD,GAAgBrxD,KAKf,OAAX2L,GACE,GAASA,SAAoD3G,IAAxC4uD,EAAY,GAAW9sC,KAAKnb,KAEnDA,EAAS,UAGI,WAAXA,EACFioD,EAAYriD,MACV,CAAC2iD,EAAIC,IACH32D,EAAMgqD,UAAU2M,EAAGzzB,GAAI,QAAUljC,EAAMgqD,UAAU0M,EAAGxzB,GAAI,UAExC,OAAX/0B,EAETioD,EAAYriD,MAAK,CAAC2iD,EAAIC,IAChB,EAASA,EAAGzzB,KAAO,EAASwzB,EAAGxzB,IAC1ByzB,EAAGzzB,GAAKwzB,EAAGxzB,GAEb,GAAGwzB,EAAGxzB,KAAK+wC,cAAc,GAAGtd,EAAGzzB,QAIxCkzB,EAAYriD,MACV,CAAC2iD,EAAIC,IAAQA,EAAWrtC,KAAKnb,GAAYuoD,EAAWptC,KAAKnb,KAG7D,MAAMnM,EACH6zD,GAAgC,oBAAXhwD,OAEjBgwD,EADDhwD,OAAOqwD,WAEPj0D,EACH6zD,GAAiC,oBAAXjwD,OAElBiwD,EADDjwD,OAAOswD,YAGP+d,EAAQn/C,EACRq7C,EAAM,CAAEvrC,KAAMkvC,EAAW7jC,KAAM8jC,GAGrC,GAAiB,MAAbD,GAAkC,MAAbC,EACvB5D,EAAIvrC,KAAOkvC,EACX3D,EAAIlgC,KAAO8jC,OACN,GAAiB,MAAbD,GAAkC,MAAbC,EAC9B5D,EAAIvrC,KAAOkvC,EACX3D,EAAIlgC,KAAO5pC,KAAK6R,KAAK+7D,EAAQ9D,EAAIvrC,WAC5B,GAAiB,MAAbkvC,GAAkC,MAAbC,EAC9B5D,EAAIlgC,KAAO8jC,EACX5D,EAAIvrC,KAAOv+B,KAAK6R,KAAK+7D,EAAQ9D,EAAIlgC,UAC5B,CAGL,MAAMikC,EAAS7tE,KAAK+lC,KAAM6nC,EAAQjyE,EAAUD,GAC5CouE,EAAIvrC,KAAOv+B,KAAK6hC,MAAMgsC,GACtB/D,EAAIlgC,KAAO5pC,KAAK6hC,MAAOnmC,EAAQC,EAAUkyE,E,CAI3C,GAFA/D,EAAIvrC,KAAOv+B,KAAKC,IAAI6pE,EAAIvrC,KAAM,GAC9BurC,EAAIlgC,KAAO5pC,KAAKC,IAAI6pE,EAAIlgC,KAAM,GAC1BkgC,EAAIlgC,KAAOkgC,EAAIvrC,KAAOqvC,EAAO,CAG/B,MAAME,EAAKjE,GAAMC,GACX/9D,EAAKi+D,GAAMF,IAGZgE,EAAK,GAAK/hE,GAAM6hE,EACnB/D,GAAMC,EAAKgE,EAAK,IACN/hE,EAAK,GAAK+hE,GAAMF,GAC1B5D,GAAMF,EAAK/9D,EAAK,E,MAIlB,KAAO+9D,EAAIlgC,KAAOkgC,EAAIvrC,KAAOqvC,GAAO,CAClC,MAAME,EAAKjE,GAAMC,GACX/9D,EAAKi+D,GAAMF,IAGZ/9D,EAAK,GAAK+hE,GAAMF,EACnB5D,GAAMF,EAAK/9D,EAAK,GAEhB89D,GAAMC,EAAKgE,EAAK,E,CAKtB,IAAIrD,EAAYb,EAAW,EAAIluE,EAAQouE,EAAIlgC,KACvC8gC,EAAad,EAAW,EAAIjuE,EAASmuE,EAAIvrC,KAE7C,GAAIuwB,GAAkBud,EAAkB,CACtC,MAAMrf,EAAwBN,GAC5B,GACA2f,GAEItf,EAAqBH,GAAa,GAAI0f,GAAe,GAC3Dxc,EAAY51D,SAASgC,IACdA,EAAK8mB,KAAKlmB,GAAMZ,EAAK8mB,KAAKpmB,IAE7BV,EAAK8mB,KAAKlmB,EAAI,EACdZ,EAAK8mB,KAAKpmB,EAAI,GAGhB,MAAMmxE,EAAQr0E,EAAM8oD,QAAQtmD,EAAK0gC,IAC3BmtC,EAAMhd,EAASghB,IAAU,GAE/B,IAAI1nE,EACA2nE,EAEA50D,GAAQ2wD,IACV1jE,EAAQ0jE,EAAI,GACZiE,EAAQjE,EAAI,KAEZ1jE,EAAQ0jE,EACRiE,EAAQjE,GAGV,MAAM/jE,OACY9E,IAAhB8rD,EAA4BA,EAAY9wD,GAAQytE,EAE5CnvE,EAAI6L,EAAQL,EACZpH,EAAIovE,EAAQhoE,EAElBykE,EAAYzqE,KAAKC,IAAIwqE,EAAWjwE,GAChCkwE,EAAa1qE,KAAKC,IAAIyqE,EAAY9rE,EAAE,G,CAIxC,MAAMwrE,EAAqB,CAAC,EAGtBC,EAAK,CAAEnpC,IAAK,EAAG4M,IAAK,GAGpB68B,EAA4B,CAAC,EACnC,IAAK,IAAIzrE,EAAI,EAAGA,EAAI4wD,EAAY3zD,OAAQ+C,IAAK,CAC3C,MAAMhD,EAAO4zD,EAAY5wD,GACzB,IAAI0rE,EAMJ,GALI7oE,IAEF6oE,EAAQ7oE,EAASrI,EAAM8oD,QAAQtmD,EAAK0gC,MAGlCguC,SAAwB1pE,IAAd0pE,EAAM1pC,UAAmChgC,IAAd0pE,EAAM98B,KAAoB,CAEjE,MAAMljC,EAAM,CACVs2B,IAAK0pC,EAAM1pC,IACX4M,IAAK88B,EAAM98B,KAGb,QAAgB5sC,IAAZ0J,EAAIkjC,IAIN,IAFAljC,EAAIkjC,IAAM,EAEHq8B,GAAKC,EAAUx/D,IACpBA,EAAIkjC,WAED,QAAgB5sC,IAAZ0J,EAAIs2B,IAIb,IAFAt2B,EAAIs2B,IAAM,EAEHipC,GAAKC,EAAUx/D,IACpBA,EAAIs2B,MAIRypC,EAAUzuE,EAAK0gC,IAAMhyB,EACrB0/D,GAAIF,EAAUx/D,E,CAEhB4/D,GAAOtuE,EAAMwtE,EAAOe,EAAWC,EAAYC,EAAWb,EAAKO,EAAID,E,CAEjE,MAAMrgE,EAAS,CACb5P,MAAO21D,EACP30D,SAWF,OARIsvD,GACFqF,EAAY51D,SAASgC,IACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,GACb,IAGCmN,CACT,G,GInSA8jD,OF+BK,MAGL,WAAAzuC,CAAmBgB,EAA+B,CAAC,GAAhC,KAAAA,QAAAA,EAFnB,KAAAwc,GAAK,SAGHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAKuwE,qBAAoB,EAAOv0E,EAAO0mB,EAChD,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAKuwE,qBAAoB,EAAMv0E,EAAO0mB,EACxC,G,CAYc,mBAAA6tD,CACZxjB,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,IAE1C1kB,MAAO6zD,EACP5zD,OAAQ6zD,EACRxiB,OAAQsiB,EACRxB,UAAWogB,EACXnC,WAAYoC,EAAe,SAC3BphB,EAAQ,YACRC,EAAW,aACXme,EAAY,eACZrc,EAAc,2BACdkd,EAA0B,OAC1BnkE,EAAM,aACNyuD,EAAe,GAAE,aACjB2V,EAAe,GAAE,aACjBnW,EAAe,KACbzG,EAEEl1D,EAAQT,EAAMwoD,cACd/mD,EAAQzB,EAAMyqD,cAEdzoD,EACH6zD,GAAgC,oBAAXhwD,OAElBgwD,EADAhwD,OAAOqwD,WAEPj0D,EACH6zD,GAAiC,oBAAXjwD,OAEnBiwD,EADAjwD,OAAOswD,YAEP7iB,EACHsiB,GAAc,CAAC5zD,EAAQ,EAAGC,EAAS,GAGtC,KAAKxB,aAAK,EAALA,EAAOgC,SAA2B,IAAjBhC,EAAMgC,OAC1B,OAAO4xD,GAAsBr0D,EAAO+wD,EAAQzd,GAG9C,IAAI8gB,EAAY3zD,EAAM,GACtB,GAAI,GAAS+zE,IACX,IAAK,IAAIhvE,EAAI,EAAGA,EAAI/E,EAAMgC,OAAQ+C,IAChC,GAAI/E,EAAM+E,GAAG09B,KAAOsxC,EAAgB,CAClCpgB,EAAY3zD,EAAM+E,GAClB,K,OAIJ4uD,EAAYogB,GAAkB/zE,EAAM,GAItC,MAAMi0E,EAiRW,EAAC7qD,EAAcqZ,KAClC,IAAI1xB,GAAS,EAMb,OALAqY,EAAMrpB,SAAQ,CAAC+vC,EAAG/qC,KACZ+qC,EAAErN,KAAOA,IACX1xB,EAAQhM,E,IAGLc,KAAKC,IAAIiL,EAAO,EAAE,EAxRJmjE,CAAal0E,EAAO2zD,EAAUlxB,IAG3C+gC,EAAYE,GAAa,CAAE1jE,QAAOgB,UAAS,GAC3CqjE,EAAYrjD,GAAcwiD,GAC1BoB,EAsTS,EAAC7gC,EAAkBkwC,KACpC,IAAInuE,EAAM,EACV,IAAK,IAAIf,EAAI,EAAGA,EAAIg/B,EAAOkwC,GAAYjyE,OAAQ+C,IACzCg/B,EAAOkwC,GAAYlvE,KAAOgsD,MAG9BjrD,EAAMi+B,EAAOkwC,GAAYlvE,GAAKe,EAAMi+B,EAAOkwC,GAAYlvE,GAAKe,GAE9D,OAAOA,CAAG,EA9TYquE,CAAW9P,EAAW4P,GAsRvB,EAAClwC,EAAkBkwC,EAAoBpgD,KAC5D,MAAM7xB,EAAS+hC,EAAO/hC,OAEtB,IAAK,IAAI+C,EAAI,EAAGA,EAAI/C,EAAQ+C,IAE1B,GAAIg/B,EAAOkwC,GAAYlvE,KAAOgsD,IAAU,CACtChtB,EAAOkwC,GAAYlvE,GAAK8uB,EACxBkQ,EAAOh/B,GAAGkvE,GAAcpgD,EAExB,IAAK,IAAItT,EAAI,EAAGA,EAAIve,EAAQue,IACtBwjB,EAAOh/B,GAAGwb,KAAOwwC,KAAYhtB,EAAOkwC,GAAY1zD,KAAOwwC,MACzDhtB,EAAOkwC,GAAY1zD,GAAKsT,EAAOkQ,EAAOh/B,GAAGwb,GACzCwjB,EAAOxjB,GAAG0zD,GAAcpgD,EAAOkQ,EAAOh/B,GAAGwb,G,CAMjD,IAAK,IAAIxb,EAAI,EAAGA,EAAI/C,EAAQ+C,IAC1B,GAAIA,IAAMkvE,EAGV,IAAK,IAAI1zD,EAAI,EAAGA,EAAIve,EAAQue,IAC1B,GAAIwjB,EAAOh/B,GAAGwb,KAAOwwC,IAAU,CAC7B,IAAIqjB,EAAQvuE,KAAKgF,IAAIk5B,EAAOkwC,GAAYlvE,GAAKg/B,EAAOkwC,GAAY1zD,IAChE6zD,EAAkB,IAAVA,EAAc,EAAIA,EAC1BrwC,EAAOh/B,GAAGwb,GAAK6zD,C,GA9SnB,CAAe/P,EAAW4P,EAAYrP,EAAc,GAGpD,MAAMyP,EAAahQ,EAAU4P,GAC7B,IAAIK,EACF/yE,EAAQsxC,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKtxC,EAAQsxC,EAAO,GACzD0hC,EACF/yE,EAASqxC,EAAO,GAAKA,EAAO,GAAKA,EAAO,GAAKrxC,EAASqxC,EAAO,GAC7C,IAAdyhC,IACFA,EAAY/yE,EAAQ,GAEH,IAAfgzE,IACFA,EAAa/yE,EAAS,GAGxB,MAAMgzE,EAAY3uE,KAAK+F,IAAI0oE,EAAWC,GAChCE,EAAO5uE,KAAKC,OAAOuuE,GAEnBzK,EAAkB,GAClBgI,EAAcoC,GAAkBQ,EAAYC,EAClDJ,EAAWt0E,SAAQ,CAACwe,EAAOxZ,KACzB6kE,EAAM7kE,GAAKwZ,EAAQqzD,CAAU,IAG/B,MAAM8C,EAgJc,EACtB10E,EACAqkE,EACAlI,EACAyN,EACAgI,EACAlkE,EACAokE,KAEA,IAAK9xE,EAAO,MAAO,GACnB,MAAM4P,EAAmB,GACzB,GAAIy0D,EAAW,CAEb,MAAMsQ,EAEF,CAAC,EACLtQ,EAAUtkE,SAAQ,CAACgnC,EAAehiC,KAChC,MAAM2vC,EAAiB,GACvB3N,EAAIhnC,SAAQ,CAACG,EAAGqgB,K,QACd,GAAIxb,IAAMwb,EACRm0B,EAAOp0C,KAAK,QACP,GAAIspE,EAAM7kE,KAAO6kE,EAAMrpD,GAE5B,GAAe,SAAX7S,EAEFgnC,EAAOp0C,KACJJ,GAAK2F,KAAKgF,IAAI9F,EAAIwb,GAAKuxD,IAAkBlI,EAAM7kE,GAAK6sE,SAElD,GAAIlkE,EAAQ,CAEjB,IAAIknE,EACAC,EACJ,GAAIF,EAAe30E,EAAM+E,GAAG09B,IAC1BmyC,EAASD,EAAe30E,EAAM+E,GAAG09B,QAC5B,CACL,MAAMlkB,GACQ,OAAX7Q,EACG1N,EAAM+E,GAAG09B,GACK,QAAb,EAAAziC,EAAM+E,GAAG8jB,YAAI,eAAGnb,KAAgC,EAErDknE,EADE,GAASr2D,GACFA,EAAMwf,WAAW,GAEjBxf,EAEXo2D,EAAe30E,EAAM+E,GAAG09B,IAAMmyC,C,CAGhC,GAAID,EAAe30E,EAAMugB,GAAGkiB,IAC1BoyC,EAASF,EAAe30E,EAAMugB,GAAGkiB,QAC5B,CACL,MAAMlkB,GACQ,OAAX7Q,EACG1N,EAAMugB,GAAGkiB,GACK,QAAb,EAAAziC,EAAMugB,GAAGsI,YAAI,eAAGnb,KAAgC,EAErDmnE,EADE,GAASt2D,GACFA,EAAMwf,WAAW,GAEjBxf,EAEXo2D,EAAe30E,EAAMugB,GAAGkiB,IAAMoyC,C,CAEhCngC,EAAOp0C,KACJJ,GAAK2F,KAAKgF,IAAI+pE,EAASC,GAAU/C,IAC/BlI,EAAM7kE,GAAK6sE,G,MAGhBl9B,EAAOp0C,KAAMJ,EAAIi8D,GAAiByN,EAAM7kE,GAAK6sE,QAE1C,CAEL,MAAMnI,GAAQtN,EAAeyV,GAAc,EAC3Cl9B,EAAOp0C,KAAKJ,EAAIupE,E,KAGpB75D,EAAOtP,KAAKo0C,EAAO,G,CAGvB,OAAO9kC,CAAM,EA7NYklE,CACrB90E,EACAqkE,EACAlI,EACAyN,EACAgI,EACAlkE,EACAokE,GAGIiD,EAsNc,CAACL,IACvB,MAAMtwC,EAAOswC,EAAe1yE,OACtBytC,EAAOilC,EAAe,GAAG1yE,OACzB4N,EAAqB,GAC3B,IAAK,IAAI7K,EAAI,EAAGA,EAAIq/B,EAAMr/B,IAAK,CAC7B,MAAMgiC,EAAgB,GACtB,IAAK,IAAIxmB,EAAI,EAAGA,EAAIkvB,EAAMlvB,IACK,IAAzBm0D,EAAe3vE,GAAGwb,GACpBwmB,EAAIzmC,KAAK,GAAKo0E,EAAe3vE,GAAGwb,GAAKm0D,EAAe3vE,GAAGwb,KAEvDwmB,EAAIzmC,KAAK,GAGbsP,EAAOtP,KAAKymC,E,CAEd,OAAOn3B,CAAM,EArOKolE,CAAgBN,GAG1BO,EGrLS,EACjB3yB,EACA+hB,EACAlI,KAEA,IAEE,MAAM0I,EAAI,GAAS1vB,IAAI,GAASjC,IAAImxB,EAAW,IAAK,IAG9CS,EAAWD,EAAEzyB,KAAK,OAClB2yB,EAAWF,EAAEzyB,KAAK,UAClB4yB,EAAYH,EAAEzyB,OACpByyB,EAAE/kD,IAAIklD,GAAW16B,aAAaw6B,GAAUp6B,gBAAgBq6B,GAIxD,MAAME,EAAM,IAAI5oB,GAA2BwoB,GACrCK,EAAc,GAASt5B,KAAKq5B,EAAIxlB,gBAAgB3L,WACtD,OAAOmxB,EAAIzlB,oBAAoBpX,SAASniC,KAAK8gC,GACpC,GAASoO,IAAI,CAACpO,GAAM,CAACm+B,IACzB98B,SAAS,GACT/L,OAAO,EAAGimB,I,CAEf,SACA,MAAMstB,EAAoB,GAC1B,IAAK,IAAI7qE,EAAI,EAAGA,EAAIs/D,EAAUriE,OAAQ+C,IAAK,CACzC,MAAMpC,EAAIkD,KAAK0hC,SAAW40B,EACpB15D,EAAIoD,KAAK0hC,SAAW40B,EAC1ByT,EAAItvE,KAAK,CAACqC,EAAGF,G,CAEf,OAAOmtE,C,GHsJWsD,CAAI/W,EAAcuY,EAAgBvY,GACpD,IAiBIrJ,EAjBA4R,EAAYuQ,EAAUhvE,KAAI,EAAEtD,EAAGF,MAAO,CACxCE,GACGk7C,MAAMl7C,GAAKkD,KAAK0hC,SAAW40B,EAAex5D,GAC3CsyE,EAAUhB,GAAY,GACxBxxE,GACGo7C,MAAMp7C,GAAKoD,KAAK0hC,SAAW40B,EAAe15D,GAC3CwyE,EAAUhB,GAAY,OAa1B,GAVA1wE,KAAKnE,IACHu8D,EACA+I,EACAqQ,EACAL,EACA9K,EACAqK,GAIEtf,EAAgB,CAClB7B,EAAeH,GAAeC,EAAUC,GACxC,MAAMqiB,EAAsD,CAC1Dl1E,QACA8yD,eACA4R,YACAkF,QACApoE,SACAD,QACAyvE,aAAct0B,QAAQs0B,GACtBC,SAAUgD,EACVnX,WAAY+U,GAA8B,IAC1CjuE,EAAG8gE,EAAU1iE,OAAS,KAExB0iE,ED9L+B,EACnCnlE,EACA0mB,KAEA,MAAMivC,EAAgB,OAAH,wBAAQ,IAA4BjvC,IACjD,UACJy+C,EAAS,WACT5H,EAAU,MACVv7D,EAAK,EACLqC,EAAC,MACDyrE,EAAQ,IAAG,aACX2B,EAAY,SACZC,EAAQ,MACRrH,EAAQ,GAAE,aACV9W,GACEoC,EAEEl1D,EAAQT,EAAMwoD,cAEd4oB,EAAgB,GAChBO,EAAc3vE,EAAQ,GAE5B,IAAK,IAAIwD,EAAI,EAAGA,EAAI+3D,EAAY/3D,IAC9B2/D,EAAU3kE,SAAQ,CAACb,EAAU0E,KAC3B+sE,EAAK/sE,GAAK,CAAEjB,EAAG,EAAGF,EAAG,EAAG,IAG1BiuE,GAAa1wE,EAAO0kE,EAAWiM,EAAM/sE,EAAGgmE,EAAO9W,GAC/Cie,GACErM,EACAiM,EACAtB,EACA2B,EACAC,EACAC,EACA3vE,EACAqoE,GAGJ,OAAOlF,CAAS,ECuJAyQ,CAAsB51E,EAAO21E,E,CAG3C,MAAMvf,EAAyB,GAsB/B,OArBA+O,EAAU3kE,SAAQ,CAAC8L,EAAU9G,KAC3B,MAAMgxD,EAAQ3C,GAAgBpzD,EAAM+E,IACpCgxD,EAAMltC,KAAKlmB,EAAIkJ,EAAElJ,EAAIkwC,EAAO,GAC5BkjB,EAAMltC,KAAKpmB,EAAIoJ,EAAEpJ,EAAIowC,EAAO,GAC5B8iB,EAAYr1D,KAAKy1D,EAAM,IAGrBzF,GACFqF,EAAY51D,SAASgC,GACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,MAKJ,CACbzC,MAAO21D,EACP30D,QAIJ,G,CACQ,GAAA5B,CACNu8D,EACA+I,EACAqQ,EACAL,EACA9K,EACAqK,GAEA,IAAK,IAAIlvE,EAAI,EAAGA,GAAK42D,EAAc52D,IAAK,CACtC,MAAMw2D,EAAQx2D,EAAI42D,EAClBp4D,KAAK6xE,aACH7Z,EACAmJ,EACAkF,EACA8K,EACAK,EACAd,E,CAGN,CACQ,YAAAmB,CACN7Z,EACAmJ,EACAkF,EACAvF,EACA0Q,EACAd,GAEA,MAAMoB,EAAS,EAAI9Z,EACnBmJ,EAAU3kE,SAAQ,CAACG,EAAU6E,KAE3B,MAAMuwE,EAAYzR,GAAqB3jE,EAAG,CAAEyC,EAAG,EAAGF,EAAG,IAC/C8yE,EAAyB,IAAdD,EAAkB,EAAI,EAAIA,EAC3C,GAAIvwE,IAAMkvE,EACR,OAEF,IAAIuB,EAAY,EACZC,EAAY,EACZC,EAAc,EAClBhR,EAAU3kE,SAAQ,CAACmF,EAAGqb,KAEpB,GAAIxb,IAAMwb,EACR,OAGF,MAAMo1D,EAAO9R,GAAqB3jE,EAAGgF,GAC/B0wE,EAAoB,IAATD,EAAa,EAAI,EAAIA,EAChCE,EAAWxR,EAAU9jD,GAAGxb,GAE9B2wE,GAAeX,EAAQhwE,GAAGwb,GAE1Bi1D,GAAaT,EAAQhwE,GAAGwb,IAAMrb,EAAEvC,EAAIkzE,GAAY31E,EAAEyC,EAAIuC,EAAEvC,GAAKizE,GAE7DH,GAAaV,EAAQhwE,GAAGwb,IAAMrb,EAAEzC,EAAIozE,GAAY31E,EAAEuC,EAAIyC,EAAEzC,GAAKmzE,EAAS,IAExE,MAAME,EAAqB,IAAblM,EAAM7kE,GAAW,EAAI,EAAI6kE,EAAM7kE,GAC7C2wE,GAAeL,EACfK,GAAena,EAAQua,EAAQA,EAE/BN,GAAaH,EACbG,GAAaja,EAAQua,EAAQ51E,EAAEyC,EAAI4yE,EACnCr1E,EAAEyC,EAAI6yE,EAAYE,EAElBD,GAAaJ,EACbI,GAAala,EAAQua,EAAQ51E,EAAEuC,EAAI8yE,EACnCr1E,EAAEuC,EAAIgzE,EAAYC,CAAW,GAEjC,GElSAjQ,MAAOnJ,GACPgJ,QZkCK,MAYL,WAAArgD,CACSgB,EAAgC,CAAC,GAAjC,KAAAA,QAAAA,EAVT,KAAAwc,GAAK,UAYHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAKm5D,oBAAmB,EAAOn9D,EAAO0mB,EAC/C,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAKm5D,oBAAmB,EAAMn9D,EAAO0mB,EACvC,G,CAKA,IAAA02C,G,MACsB,QAApB,EAAAp5D,KAAK+oE,uBAAe,SAAE3P,MACxB,CAMA,IAAAE,CAAKC,EAAa,GAChBv5D,KAAK+oE,gBAAgBzP,KAAKC,GAE1B,MAAMltD,EAAS,CACb5P,MAAO,GAAeuD,KAAK+5D,iBAC3Bt8D,MAAO4rE,GAAerpE,KAAKg6D,kBAY7B,OATIh6D,KAAKi6D,YACP5tD,EAAO5P,MAAMD,SAASgC,GACpBwB,KAAK45D,UAAUnR,cAAcjqD,EAAK0gC,GAAI,CACpC9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,MAKZmN,CACT,CAYc,kBAAA8sD,CACZpM,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,GAEtCjmB,EAAQT,EAAMwoD,cACd/mD,EAAQzB,EAAMyqD,cACd2L,EAA0B31D,EAAMiG,KACnClE,I,QACC,OAAC,+BACIqxD,GAAgBrxD,IAAK,CACxBY,EAAY,QAAT,EAAAZ,EAAK8mB,YAAI,eAAElmB,EACdF,EAAY,QAAT,EAAAV,EAAK8mB,YAAI,eAAEpmB,GACF,IAEZo7D,EAAyB78D,EAAMiF,KAAKvG,GAAS0zD,GAAgB1zD,KAGnE6D,KAAK+5D,gBAAkB3H,EACvBpyD,KAAKg6D,gBAAkBM,EACvBt6D,KAAKi6D,WAAalN,EAClB/sD,KAAK45D,UAAY59D,EAEjB,MAAM,SACJ0oE,EAAQ,WACRC,EAAU,MACVvqB,EAAK,aACLme,EAAY,aACZD,EAAY,aACZM,EAAY,WACZwC,EAAU,oBACV+N,EAAmB,oBACnBD,EAAmB,oBACnBD,EAAmB,oBACnBpQ,EAAmB,gBACnBuQ,EAAe,gBACfJ,EAAkB,EAAC,OACnB15B,EAAS,CAAC,EAAG,GAAE,eACf8hB,EAAc,SACd/B,EAAQ,YACRC,EAAW,OACXoL,GACE/I,EACJ,IAAI,gBAAEoX,GAAoBpX,EAE1B,OAAO,IAAIjtC,SAASiT,IAClB,GAAKoxC,EAiGE,CAEL,GAAI3N,EAAY,CACd,MAAMoX,EAAe9L,KACrB8L,EAAa/1E,MAAM21D,GACnBogB,EAAavM,MAAM3L,E,CAGrB,GADAyO,EAAgBtsE,MAAM21D,GAClBkI,EAAa,CAEf,MAAMmY,EAAY,KAEfvzC,IAAIriB,GAAWA,EAAEqiB,KACjB+mC,MAAM3L,GACLhC,GACFma,EAAUhU,SAASnG,GAEjBM,GACF6Z,EAAUr2D,SAASw8C,GAErBmQ,EAAgB7G,MAAM,OAAQuQ,E,CAE5BrhB,GACFpxD,KAAK0yE,eAAe3J,EAAiB,CACnC1Z,WACAC,cACA0Z,oBAGJD,EAAgB3uB,MAAMA,GAAOypB,UAG7B,MAAM8O,EAAW,GAAevgB,GAC1Bv1D,EAAWwsE,GAAe/O,GAE5BvN,GACF4lB,EAASn2E,SAASgC,GAChBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,MAKnBy4B,EAAQ,CACNl7B,MAAOk2E,EACPl1E,MAAOZ,G,MA9IT,IAEE,MAAM+1E,EAAY,KAMlB,GALIra,GACFqa,EAAUnU,SAASlG,GAErBwQ,EAAkB,KAA0BtsE,MAAM21D,GAE9CgJ,EAAY,CACd,MAAMoX,EAAe9L,KACrB8L,EACGjU,QAAQjvB,EAAO,IACfkvB,QAAQlvB,EAAO,IACf+3B,SAAS,SACT5I,SAAS0K,GACR7O,GACFkY,EAAavM,MAAM3L,GAEjBlI,GACFogB,EAAa/1E,MAAM21D,GAErBogB,EACGzL,kBAAkBmC,GAClBlC,kBAAkBiC,GAClBnC,YAAYjO,GACZgO,cAAcuC,GAEjBL,EAAgB7G,MAAM,QAASsQ,E,CAiBjC,GAfAzJ,EACG7G,MAAM,ScnNJ,SAAS9iE,EAAGF,GACzB,IAAIzC,EAAOgiE,EAAW,EAKtB,SAASyD,IACP,IAAI1gE,EAEAhD,EADAuyB,EAAIt0B,EAAMgC,OAEVic,EAAK,EACLC,EAAK,EAET,IAAKnZ,EAAI,EAAGA,EAAIuvB,IAAKvvB,EACFkZ,IAAjBlc,EAAO/B,EAAM+E,IAAepC,EAAGub,GAAMnc,EAAKU,EAG5C,IAAKwb,GAAMA,EAAKqW,EAAI3xB,GAAKq/D,EAAU9jD,GAAMA,EAAKoW,EAAI7xB,GAAKu/D,EAAUj9D,EAAI,EAAGA,EAAIuvB,IAAKvvB,GAC/EhD,EAAO/B,EAAM+E,IAASpC,GAAKsb,EAAIlc,EAAKU,GAAKyb,CAE7C,CAkBA,OAnCS,MAALvb,IAAWA,EAAI,GACV,MAALF,IAAWA,EAAI,GAkBnBgjE,EAAMkD,WAAa,SAASzpE,GAC1Bc,EAAQd,CACV,EAEAumE,EAAM9iE,EAAI,SAASzD,GACjB,OAAOwd,UAAU1a,QAAUW,GAAKzD,EAAGumE,GAAS9iE,CAC9C,EAEA8iE,EAAMhjE,EAAI,SAASvD,GACjB,OAAOwd,UAAU1a,QAAUS,GAAKvD,EAAGumE,GAAShjE,CAC9C,EAEAgjE,EAAMzD,SAAW,SAAS9iE,GACxB,OAAOwd,UAAU1a,QAAUggE,GAAY9iE,EAAGumE,GAASzD,CACrD,EAEOyD,CACT,Cd4K6B,CAAoB5yB,EAAO,GAAIA,EAAO,KACtD4yB,MAAM,SAAU0Q,GAChBx4B,MAAMA,GACNuqB,WAAWA,GACXD,SAASA,GAERtT,GACFpxD,KAAK0yE,eAAe3J,EAAiB,CACnC1Z,WACAC,cACA0Z,oBAIA1O,EAAa,CAEf,MAAMmY,EAAY,KAEfvzC,IAAIriB,GAAWA,EAAEqiB,KACjB+mC,MAAM3L,GACLhC,GACFma,EAAUhU,SAASnG,GAEjBM,GACF6Z,EAAUr2D,SAASw8C,GAErBmQ,EAAgB7G,MAAM,OAAQuQ,E,CAGhC1J,EACGxmB,GAAG,QAAQ,KACV,MAAMowB,EAAW,GAAevgB,GAChCsI,SAAAA,EAAS,CACPj+D,MAAOk2E,EACPl1E,MAAO4rE,GAAe/O,KAGpBvN,GACF4lB,EAASn2E,SAASgC,GAChBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,K,IAKpBqjD,GAAG,OAAO,KACT,MAAMowB,EAAW,GAAevgB,GAE5BrF,GACF4lB,EAASn2E,SAASgC,GAChBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,MAKnBy4B,EAAQ,CACNl7B,MAAOk2E,EACPl1E,MAAO4rE,GAAe/O,IACtB,G,CAEN,MAAOp+D,GACP+e,QAAQoxB,KAAKnwC,E,CAoDjB8D,KAAK+oE,gBAAkBA,CAAe,GAE1C,G,CAMO,cAAA2J,CACLjO,EACA/hD,GAMA,MAAM,SAAE2sC,EAAQ,YAAEC,EAAW,gBAAE0Z,GAAoBtmD,EACnD,IAAI6sC,EACAC,EAUJ,GAPEA,EADE,EAASF,GACO,IAAMA,EACf,GAAWA,GACFA,EAEA,IAAM,EAGrBD,EAgBE,GAAI,GAAWA,GACpBE,EAAgB1yC,GACDwyC,EAASxyC,GACR2yC,EAAgB3yC,QAE3B,GAAInB,GAAQ2zC,GAAW,CAC5B,MACMiB,GADSjB,EAAS,GAAKA,EAAS,GAAKA,EAAS,GAAKA,EAAS,IAC1C,EACxBE,EAAgB1yC,GAAMyzC,EAASd,EAAgB3yC,E,MAC1C,GAAI,EAASwyC,GAAW,CAC7B,MAAMiB,EAAUjB,EAAsB,EACtCE,EAAgB1yC,GAAMyzC,EAASd,EAAgB3yC,E,MAE/C0yC,EAAe,IAAM,QA5BrBA,EAAgB1yC,GACVA,EAAErF,KACAkE,GAAQmB,EAAErF,OACAqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,IAC1C,EAAIg4C,EAAgB3yC,GAE/B,GAASA,EAAErF,OAEXqF,EAAErF,KAAKxZ,MAAQ6e,EAAErF,KAAKvZ,OAAS4e,EAAErF,KAAKxZ,MAAQ6e,EAAErF,KAAKvZ,QAC1C,EAAIuxD,EAAgB3yC,GAE5BA,EAAErF,KAAO,EAAIg4C,EAAgB3yC,GAE/B,GAAK2yC,EAAgB3yC,GAmBhC4nD,EAAWvC,MACT,iBACA,GAAqB3S,GAAckP,SAASuK,GAEhD,GYhXAhH,YL6CK,MAgBL,WAAAtgD,CACSgB,EAAoC,CAAC,GAArC,KAAAA,QAAAA,EAdT,KAAAwc,GAAK,cAEG,KAAA85B,aAAuB,EAEvB,KAAAE,SAAmB,EAYzBl5D,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAK6yE,0BAAyB,EAAO72E,EAAO0mB,EACrD,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAK6yE,0BAAyB,EAAM72E,EAAO0mB,EAC7C,G,CAKA,IAAA02C,GACMp5D,KAAKg5D,cAAkC,oBAAXn3D,QAC9BA,OAAOw3D,cAAcr5D,KAAKg5D,cAE5Bh5D,KAAKk5D,SAAU,CACjB,CAMA,IAAAI,CAAKC,EAAav5D,KAAK0iB,QAAQ01C,cAAgB,GAC7C,GAAIp4D,KAAKw5D,WACP,OAAOx5D,KAAKw5D,WAGd,IAAK,IAAIh4D,EAAI,EAAGA,EAAI+3D,EAAY/3D,IAC9BxB,KAAK05D,WAAW15D,KAAK45D,UAAW55D,KAAK8yE,eAAgB9yE,KAAKy5D,aAG5D,MAAMptD,EAAS,CACb5P,MAAOuD,KAAK+5D,gBACZt8D,MAAOuC,KAAKg6D,iBAad,OAVIh6D,KAAKi6D,YACP5tD,EAAO5P,MAAMD,SAASgC,GACpBwB,KAAK45D,UAAUnR,cAAcjqD,EAAK0gC,GAAI,CACpC9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,EACbi/C,EAA+B,IAA5Bn+C,KAAK0iB,QAAQm1C,WAAmBr5D,EAAK8mB,KAAK64B,OAAI36C,MAKhD6I,CACT,CAYc,wBAAAwmE,CACZ9lB,EACA/wD,EACA0mB,G,yCAEA,GAAI1iB,KAAKk5D,QAAS,OAElB,MAAMgB,EAAmBl6D,KAAKm6D,cAAcz3C,IACtC,WACJm1C,EAAU,MACV75D,EAAK,OACLC,EAAM,OACNqxC,EAAM,WACN8rB,EAAU,cACVC,EAAa,aACbjD,EAAY,OACZsC,GACER,EAEEz9D,EAAQT,EAAMwoD,cACd/mD,EAAQzB,EAAMyqD,cAEpB,KAAKhqD,aAAK,EAALA,EAAOgC,QAAQ,CAClB,MAAM4N,EAAS,CAAE5P,MAAO,GAAagB,SAErC,OADAuC,KAAKw5D,WAAantD,EACXA,C,CAGT,GAAqB,IAAjB5P,EAAMgC,OAAc,CAClBsuD,GACF/wD,EAAMysD,cAAchsD,EAAM,GAAGyiC,GAAI,CAC/B9/B,EAAGkwC,EAAO,GACVpwC,EAAGowC,EAAO,GACV6O,EAAkB,IAAf0Z,EAAmBvoB,EAAO,QAAK9rC,IAGtC,MAAM6I,EAAS,CACb5P,MAAO,C,+BAEAA,EAAM,IAAE,CACX6oB,KAAM,OAAF,wBACC7oB,EAAM,GAAG6oB,MAAI,CAChBlmB,EAAGkwC,EAAO,GACVpwC,EAAGowC,EAAO,GACV6O,EAAkB,IAAf0Z,EAAmBvoB,EAAO,QAAK9rC,OAIxC/F,SAGF,OADAuC,KAAKw5D,WAAantD,EACXA,C,CAGT,MAAM+lD,EAAyB31D,EAAMiG,KAClClE,GAASqxD,GAAgBrxD,EAAM,CAACR,EAAOC,MAEpCu8D,EAAY,IAAI,EAAiC,CACrD/9D,MAAO21D,EACP30D,UAIIs1E,EAAyB,CAAC,EAuBhC,GAtBI3X,GACFhJ,EAAY51D,SAASgC,IACnB,MAAMw0E,EAAex0E,EAAK8mB,KAAK+1C,GAC1B0X,EAAWC,KACdD,EAAWC,GAAgB,CACzB51E,KAAM41E,EACNC,GAAI,EACJC,GAAI,EACJr5C,MAAO,G,IAOf75B,KAAK+5D,gBAAkB3H,EACvBpyD,KAAKg6D,gBAAkBv8D,EACvBuC,KAAKi6D,WAAalN,EAClB/sD,KAAK45D,UAAYY,EACjBx6D,KAAKy5D,YAAcS,EACnBl6D,KAAK8yE,eAAiBC,EAEA,oBAAXlxE,OAAwB,OACnC,IAAIu8C,EAAO,EAEX,OAAO,IAAI15B,SAASiT,IAElB33B,KAAKg5D,aAAen3D,OAAO84D,aAAY,KAChC36D,KAAKk5D,SAKVl5D,KAAK05D,WAAWc,EAAWuY,EAAY7Y,GACnCnN,GACFqF,EAAY51D,SAAQ,EAAG0iC,KAAI5Z,UACzBtpB,EAAMysD,cAAcvpB,EAAI,CACtB9/B,EAAGkmB,EAAKlmB,EACRF,EAAGomB,EAAKpmB,EACRi/C,EAAkB,IAAf0Z,EAAmBvyC,EAAK64B,OAAI36C,MAIrCk3D,SAAAA,EAAS,CACPj+D,MAAO21D,EACP30D,UAEF2gD,IACIA,GAAQga,IACVv2D,OAAOw3D,cAAcr5D,KAAKg5D,cAC1BrhC,EAAQ,CAAEl7B,MAAO21D,EAAa30D,YArB9Bk6B,EAAQ,CAAEl7B,MAAO21D,EAAa30D,S,GAuB/B,GACHuC,KAAKk5D,SAAU,CAAI,GAEvB,G,CAEQ,aAAAiB,CACNz3C,EAAoC,CAAC,GAErC,MAAMivC,EAAgB,+BAAK3xD,KAAK0iB,SAAYA,IACtC,WAAE04C,EAAU,cAAEC,GAAkB1J,GAGpCriB,OAAQsiB,EACR5zD,MAAO6zD,EACP5zD,OAAQ6zD,GACNH,EAeJ,OAdAA,EAAc3zD,MACX6zD,GAAgC,oBAAXhwD,OAEjBgwD,EADDhwD,OAAOqwD,WAEbP,EAAc1zD,OACX6zD,GAAiC,oBAAXjwD,OAElBiwD,EADDjwD,OAAOswD,YAEbR,EAAcriB,OAAUsiB,GACpB,CAACD,EAAc3zD,MAAQ,EAAG2zD,EAAc1zD,OAAS,GAGrD0zD,EAAcyJ,WAAaA,KAAgBC,EAEpC1J,CACT,CAEQ,UAAA+H,CACNc,EACAuY,EACArwD,GAEA,MAAM,WACJm1C,EAAU,OACV55D,EAAM,MACND,EAAK,QACLq6D,EAAO,OACP/oB,EAAM,MACNw8B,EAAK,WACL1Q,EAAU,cACVC,EACA0Q,eAAgBoH,GACdzwD,EACE0wD,EAAOn1E,EAASD,EAChB2vE,EAAcrrE,KAAK+lC,KAAK+qC,GAAQ,GAChC32E,EAAQ+9D,EAAUhW,cAClB6uB,EAAKD,GAAQ32E,EAAMgC,OAAS,GAC5B4B,EAAIiC,KAAK+lC,KAAKgrC,GACdC,EAAiC,CAAC,EAIxC,GAHAtzE,KAAKuzE,eAAe/Y,EAAW8Y,EAAejzE,EAAGgzE,GAG7CjY,EAAY,CAEd,IAAK,MAAM58C,KAAOu0D,EAChBA,EAAWv0D,GAAKy0D,GAAK,EACrBF,EAAWv0D,GAAK00D,GAAK,EACrBH,EAAWv0D,GAAKqb,MAAQ,EAG1Bp9B,EAAMD,SAASgC,IACb,MAAM,KAAE8mB,GAAS9mB,EACX2tC,EAAI4mC,EAAWztD,EAAK+1C,IACtB,EAAS/1C,EAAKlmB,KAChB+sC,EAAE8mC,IAAM3tD,EAAKlmB,GAEX,EAASkmB,EAAKpmB,KAChBitC,EAAE+mC,IAAM5tD,EAAKpmB,GAEfitC,EAAEtS,OAAO,IAEX,IAAK,MAAMrb,KAAOu0D,EAChBA,EAAWv0D,GAAKy0D,IAAMF,EAAWv0D,GAAKqb,MACtCk5C,EAAWv0D,GAAK00D,IAAMH,EAAWv0D,GAAKqb,MAIxC,MAAMkyC,EAAkBoH,GAAuB9a,EAC/C57D,EAAMD,SAAQ,CAACgC,EAAMwe,KACnB,MAAM,GAAEkiB,EAAE,KAAE5Z,GAAS9mB,EACrB,IAAK,EAAS8mB,EAAKlmB,KAAO,EAASkmB,EAAKpmB,GAAI,OAC5C,MAAMitC,EAAI4mC,EAAWztD,EAAK+1C,IACpB6S,EAAa5rE,KAAK+lC,MACrB/iB,EAAKlmB,EAAI+sC,EAAE8mC,KAAO3tD,EAAKlmB,EAAI+sC,EAAE8mC,KAAO3tD,EAAKpmB,EAAIitC,EAAE+mC,KAAO5tD,EAAKpmB,EAAIitC,EAAE+mC,KAE9DM,EAAenzE,EAAI0rE,EACzBuH,EAAcp0C,GAAI9/B,GAAMo0E,GAAgBluD,EAAKlmB,EAAI+sC,EAAE8mC,IAAO/E,EAC1DoF,EAAcp0C,GAAIhgC,GAAMs0E,GAAgBluD,EAAKpmB,EAAIitC,EAAE+mC,IAAOhF,CAAU,G,CAKxEzxE,EAAMD,SAAQ,CAACgC,EAAMwe,KACnB,MAAM,GAAEkiB,EAAE,KAAE5Z,GAAS9mB,EACrB,IAAK,EAAS8mB,EAAKlmB,KAAO,EAASkmB,EAAKpmB,GAAI,OAC5C,MAAMs0E,EAAe,IAAOnzE,EAAIg4D,EAChCib,EAAcp0C,GAAI9/B,GAAKo0E,GAAgBluD,EAAKlmB,EAAIkwC,EAAO,IACvDgkC,EAAcp0C,GAAIhgC,GAAKs0E,GAAgBluD,EAAKpmB,EAAIowC,EAAO,IACpC,IAAfuoB,IACFyb,EAAcp0C,GAAIif,GAAKq1B,GAAgBluD,EAAK64B,EAAI7O,EAAO,I,IAK3D7yC,EAAMD,SAAQ,CAACgC,EAAewe,KAC5B,MAAM,GAAEkiB,EAAE,KAAE5Z,GAAS9mB,EACrB,GAAI,EAAS8mB,EAAK85C,KAAO,EAAS95C,EAAK+5C,IAMrC,OALA/5C,EAAKlmB,EAAIkmB,EAAK85C,GACd95C,EAAKpmB,EAAIomB,EAAK+5C,QACK,IAAfxH,IACFvyC,EAAK64B,EAAI74B,EAAKg6C,KAIlB,IAAK,EAASh6C,EAAKlmB,KAAO,EAASkmB,EAAKpmB,GAAI,OAC5C,MAAMgvE,EAAa5rE,KAAK+lC,KACtBirC,EAAcp0C,GAAI9/B,EAAIk0E,EAAcp0C,GAAI9/B,EACtCk0E,EAAcp0C,GAAIhgC,EAAIo0E,EAAcp0C,GAAIhgC,GACxB,IAAf24D,EAAmByb,EAAcp0C,GAAIif,EAAIm1B,EAAcp0C,GAAIif,EAAI,IAEpE,GAAI+vB,EAAa,EAAG,CAElB,MAAMC,EAAc7rE,KAAK+F,IACvBslE,GAAe7B,EAxXH,KAyXZoC,GAEF1T,EAAU/R,cAAcvpB,EAAI,CAC1B9/B,EAAGkmB,EAAKlmB,EAAKk0E,EAAcp0C,GAAI9/B,EAAI8uE,EAAcC,EACjDjvE,EAAGomB,EAAKpmB,EAAKo0E,EAAcp0C,GAAIhgC,EAAIgvE,EAAcC,EACjDhwB,EACiB,IAAf0Z,EACIvyC,EAAK64B,EAAKm1B,EAAcp0C,GAAIif,EAAI+vB,EAAcC,OAC9C3qE,G,IAId,CACQ,cAAA+vE,CACN/Y,EACA8Y,EACAjzE,EACAgzE,GAEArzE,KAAKw8D,aAAahC,EAAW8Y,EAAeD,GAC5CrzE,KAAKy8D,cAAcjC,EAAW8Y,EAAejzE,EAC/C,CAEQ,YAAAm8D,CACNhC,EACA8Y,EACAD,GAEA,MAAM52E,EAAQ+9D,EAAUhW,cACxB/nD,EAAMD,SAAQ,EAAG8oB,KAAM3oB,EAAGuiC,GAAIu0C,GAAOjyE,KACnC8xE,EAAcG,GAAO,CAAEr0E,EAAG,EAAGF,EAAG,EAAGi/C,EAAG,GACtC1hD,EAAMD,SAAQ,EAAG8oB,KAAM3jB,EAAGu9B,GAAIxG,GAAO1b,KACnC,GACExb,GAAKwb,IACJ,EAASrgB,EAAEyC,KACX,EAASuC,EAAEvC,KACX,EAASzC,EAAEuC,KACX,EAASyC,EAAEzC,GAEZ,OAEF,IAAIo+D,EAAO3gE,EAAEyC,EAAIuC,EAAEvC,EACfm+D,EAAO5gE,EAAEuC,EAAIyC,EAAEzC,EACfs+D,EAAmC,IAA5Bx9D,KAAK0iB,QAAQm1C,WAAmBl7D,EAAEwhD,EAAIx8C,EAAEw8C,EAAI,EACnDu1B,EAAYpW,EAAOA,EAAOC,EAAOA,EAAOC,EAAOA,EACjC,IAAdkW,IACFA,EAAY,EACZpW,EAAO,IACPC,EAAO,IACPC,EAAO,KAET,MAAM+P,EAAS8F,EAAKK,EACdC,EAAQrW,EAAOiQ,EACfqG,EAAQrW,EAAOgQ,EACfsG,EAAQrW,EAAO+P,EACrB+F,EAAcG,GAAKr0E,GAAKu0E,EACxBL,EAAcG,GAAKv0E,GAAK00E,EACxBN,EAAc56C,GAAKt5B,GAAKu0E,EACxBL,EAAc56C,GAAKx5B,GAAK00E,EAEQ,IAA5B5zE,KAAK0iB,QAAQm1C,aACfyb,EAAcG,GAAKt1B,GAAK01B,EACxBP,EAAc56C,GAAKylB,GAAK01B,E,GAE1B,GAEN,CAEQ,aAAApX,CACNjC,EACA8Y,EACAjzE,GAEcm6D,EAAU/T,cAClBjqD,SAASN,IACb,MAAM,OAAEuT,EAAM,OAAED,GAAWtT,EAC3B,IAAKuT,IAAWD,GAAUC,IAAWD,EACnC,OAEF,MAAQ8V,KAAM3jB,GAAM64D,EAAU1V,QAAQr1C,IAC9B6V,KAAM3oB,GAAM69D,EAAU1V,QAAQt1C,GACtC,KACG,EAAS7S,EAAEyC,IACX,EAASuC,EAAEvC,IACX,EAASzC,EAAEuC,IACX,EAASyC,EAAEzC,IAEZ,OAEF,MAAMo+D,EAAO3gE,EAAEyC,EAAIuC,EAAEvC,EACfm+D,EAAO5gE,EAAEuC,EAAIyC,EAAEzC,EACfs+D,EAAmC,IAA5Bx9D,KAAK0iB,QAAQm1C,WAAmBl7D,EAAEwhD,EAAIx8C,EAAEw8C,EAAI,EACnDovB,EAASjrE,KAAK+lC,KAAKi1B,EAAOA,EAAOC,EAAOA,EAAOC,EAAOA,GAAQn9D,EAC9DszE,EAAQrW,EAAOiQ,EACfqG,EAAQrW,EAAOgQ,EACfsG,EAAQrW,EAAO+P,EACrB+F,EAAc7jE,GAAQrQ,GAAKu0E,EAC3BL,EAAc7jE,GAAQvQ,GAAK00E,EAC3BN,EAAc9jE,GAAQpQ,GAAKu0E,EAC3BL,EAAc9jE,GAAQtQ,GAAK00E,EAEK,IAA5B5zE,KAAK0iB,QAAQm1C,aACfyb,EAAc7jE,GAAQ0uC,GAAK01B,EAC3BP,EAAc9jE,GAAQ2uC,GAAK01B,E,GAGjC,GKreA5R,YN+CK,MAGL,WAAAvgD,CACSgB,EAAoC,CAAC,GAArC,KAAAA,QAAAA,EAHT,KAAAwc,GAAK,cAKHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAK8zE,0BAAyB,EAAO93E,EAAO0mB,EACrD,G,CAIM,MAAAqqC,CAAO/wD,EAAc0mB,G,yCACzB1iB,KAAK8zE,0BAAyB,EAAM93E,EAAO0mB,EAC7C,G,CAYc,wBAAAoxD,CACZ/mB,EACA/wD,EACA0mB,G,yCAEA,MAAMjlB,EAAQzB,EAAMyqD,cACdhqD,EAAQT,EAAMwoD,cAEdmN,EAAgB3xD,KAAKm6D,cAAcz3C,EAASjmB,EAAMgC,SAClD,MAAET,EAAK,OAAEC,EAAM,MAAE81E,EAAK,aAAE3b,EAAY,SAAE/I,EAAQ,OAAE/f,GACpDqiB,EAEF,KAAKl1D,aAAK,EAALA,EAAOgC,SAA2B,IAAjBhC,EAAMgC,OAC1B,OAAO4xD,GAAsBr0D,EAAO+wD,EAAQzd,GAG9C,MAAMgsB,EAAY7+D,EAAMiG,KACrBlE,GAASqxD,GAAgBrxD,EAAM,CAACR,EAAOC,MAEpCq+D,EAAY7+D,EAAMoM,QAAQ1N,IAC9B,MAAM,OAAEsT,EAAM,OAAED,GAAWrT,EAC3B,OAAOsT,IAAWD,CAAM,IAEpBgrD,EAAY,IAAI,EAAiC,CACrD/9D,MAAO6+D,EACP79D,MAAO6+D,IAEH0X,EAAiBh0E,KAAKi0E,SAASzZ,EAAWx+D,EAAOqzD,GAKvD,GAHArvD,KAAKnE,IAAI2+D,EAAWx+D,EAAOo8D,EAAc4b,EAAOjnB,EAAQ4E,GAGpDoiB,EAAO,CACT,IAAK,IAAI/2D,EAAI,EAAGA,EAAIs/C,EAAU79D,OAAQue,GAAK,EAAG,CAC5C,MAAM,OAAEvN,EAAM,OAAED,GAAW8sD,EAAUt/C,GAC/Bk3D,EAAe1Z,EAAUxU,UAAUv2C,GACnC0kE,EAAe3Z,EAAUxU,UAAUv2C,GACzC,GAAIykE,GAAgB,EAAG,CACrB,MAAM7W,EAAa7C,EAAU1V,QAAQt1C,GACrCgrD,EAAU/R,cAAch5C,EAAQ,CAC9BrQ,EAAGi+D,EAAW/3C,KAAKlmB,EACnBF,EAAGm+D,EAAW/3C,KAAKpmB,G,MAEhB,GAAIi1E,GAAgB,EAAG,CAC5B,MAAM/W,EAAa5C,EAAU1V,QAAQr1C,GACrC+qD,EAAU/R,cAAcj5C,EAAQ,CAC9BpQ,EAAGg+D,EAAW93C,KAAKlmB,EACnBF,EAAGk+D,EAAW93C,KAAKpmB,G,EAIzB,MAAMk1E,EAAc,OAAH,wBACZziB,GAAa,CAChBoiB,OAAO,EACPM,WAAW,IAEbr0E,KAAKnE,IAAI2+D,EAAWx+D,EAAO,IAAKg4E,EAAOjnB,EAAQqnB,E,CAGjD,MAAO,CACL33E,MAAO6+D,EACP79D,QAEJ,G,CAUQ,QAAAw2E,CACNzZ,EACAx+D,EACAqzD,GAEA,MAAM5yD,EAAQ+9D,EAAUhW,cAClBwvB,EAAiB,CAAC,EACxB,IAAK,IAAIxyE,EAAI,EAAGA,EAAI/E,EAAMgC,OAAQ+C,GAAK,EAAG,CACxC,MAAM,GAAE09B,EAAE,KAAE5Z,GAAS7oB,EAAM+E,GAE3B,GADAwyE,EAAM90C,GAAM,GACR,EAAS5Z,EAAK9N,MAChBw8D,EAAM90C,GAAM5Z,EAAK9N,UACZ,GAAIkE,GAAQ4J,EAAK9N,MACjB8iC,MAAMh1B,EAAK9N,KAAK,MAAKw8D,EAAM90C,GAAM58B,KAAKC,IAAI+iB,EAAK9N,KAAK,KACpD8iC,MAAMh1B,EAAK9N,KAAK,MAAKw8D,EAAM90C,GAAM58B,KAAKC,IAAI+iB,EAAK9N,KAAK,UACpD,GAAI,GAAS8N,EAAK9N,MAEvBw8D,EAAM90C,GAAM58B,KAAKC,IAAI+iB,EAAK9N,KAAKxZ,MAAOsnB,EAAK9N,KAAKvZ,aAC3C,GAAI,GAAWoxD,GAAW,CAC/B,MACM73C,EAAO63C,EADMrzD,EAAM8oD,QAAQ5lB,IAE7BxjB,GAAQlE,GACVw8D,EAAM90C,GAAM58B,KAAKC,OAAOiV,GAExBw8D,EAAM90C,GAAM1nB,C,MAELkE,GAAQ2zC,GACjB2kB,EAAM90C,GAAM58B,KAAKC,OAAO8sD,GACf,EAASA,KAClB2kB,EAAM90C,GAAMmwB,E,CAGhB,OAAO2kB,CACT,CAQQ,aAAA7Z,CACNz3C,EAAoC,CAAC,EACrC4xD,GAEA,MAAM3iB,EAAgB,+BAAK3xD,KAAK0iB,SAAYA,IACtC,OAAE4sB,EAAM,MAAEtxC,EAAK,OAAEC,EAAM,UAAEo2E,EAAS,MAAEN,EAAK,aAAE3b,EAAY,GAAEqT,EAAE,GAAEC,GACjE/Z,EAkCF,OAjCAA,EAAc3zD,MACXA,GAA2B,oBAAX6D,OAA6C7D,EAApB6D,OAAOqwD,WACnDP,EAAc1zD,OACXA,GAA4B,oBAAX4D,OAA8C5D,EAArB4D,OAAOswD,YACpDR,EAAcriB,OAAUA,GACpB,CAACqiB,EAAc3zD,MAAQ,EAAG2zD,EAAc1zD,OAAS,QAGnCuF,IAAd6wE,GAA2BC,EAAU,MACvC3iB,EAAc0iB,WAAY,QAEd7wE,IAAVuwE,GAAuBO,EAAU,MAAK3iB,EAAcoiB,OAAQ,GAC3C,IAAjB3b,GAAuB2b,EAIC,IAAjB3b,GAAsB2b,IAC/BpiB,EAAcyG,aAAe,IACzBkc,GAAW,KAAOA,EAAU,IAAK3iB,EAAcyG,aAAe,IACzDkc,EAAU,MAAK3iB,EAAcyG,aAAe,OANrDzG,EAAcyG,aAAe,IACzBkc,GAAW,KAAOA,EAAU,IAAK3iB,EAAcyG,aAAe,IACzDkc,EAAU,MAAK3iB,EAAcyG,aAAe,OAOlDqT,IACH9Z,EAAc8Z,GAAK,GACf6I,EAAU,KAAOA,GAAW,IAAK3iB,EAAc8Z,GAAK,GAC/C6I,EAAU,MAAK3iB,EAAc8Z,GAAK,IAExCC,IACH/Z,EAAc+Z,GAAK,GACf4I,EAAU,KAAOA,GAAW,IAAK3iB,EAAc+Z,GAAK,GAC/C4I,EAAU,MAAK3iB,EAAc+Z,GAAK,IAGtC/Z,CACT,CAWQ,GAAA91D,CACN2+D,EACAx+D,EACAu4E,EACAP,EACAjnB,EACArqC,GAEA,MAAM,GAAE+oD,EAAE,UAAE4I,EAAS,OAAE3Z,GAAWh4C,EAC5B44C,EAAYd,EAAUhW,cAC5B,IAAI3mD,EAAK,EACLugD,EAAOm2B,EACX,MAAMzP,EAAmB,CAAC,EACpB0P,EAAsB,CAAC,EACvBC,EAAkB,CAAC,EAEzB,IAAK,IAAIjzE,EAAI,EAAGA,EAAI85D,EAAU78D,OAAQ+C,GAAK,EAAG,CAC5C,MAAM,KAAE8jB,EAAI,GAAE4Z,GAAOo8B,EAAU95D,GAG/B,GAFAsjE,EAAO5lC,GAAM,CAAC,EAAG,GAEbm1C,EAAW,CACb,MAAMpnB,EAAS,CACb/tB,GAAI19B,EACJqoE,GAAIvkD,EAAKlmB,EACT0qE,GAAIxkD,EAAKpmB,EACTm7D,KAAM,EACNv+D,EAAG2vE,EACH3Q,OAAQN,EAAUxU,UAAU9mB,IAE9Bu1C,EAAOv1C,GAAM,IAAI0qC,GAAK3c,E,EAI1B,KAAO7O,EAAO,GACZvgD,EAAKmC,KAAK00E,QACRla,EACA,CACEpc,OACAu2B,oBAAqB,GACrBC,QAAS,IACT/2E,KACAinE,SACA0P,YACAC,SACAT,SAEFtxD,GAEF07B,IACAsc,SAAAA,EAAS,CACPj+D,MAAO6+D,EACP79D,MAAOzB,EAAMyqD,gBAUjB,OAAO+T,CACT,CASQ,OAAAka,CACN14E,EACAixD,EAUAvqC,GAEA,MAAM,KAAE07B,EAAI,oBAAEu2B,EAAmB,QAAEC,EAAO,GAAE/2E,EAAE,UAAE22E,EAAS,OAAEC,EAAM,MAAET,GACjE/mB,EACF,IAAI,OAAE6X,GAAW7X,EACjB,MAAM,eAAEmE,EAAc,UAAEijB,GAAc3xD,EAChCjmB,EAAQT,EAAMwoD,cACpB,IAAK,IAAIhjD,EAAI,EAAGA,EAAI/E,EAAMgC,OAAQ+C,GAAK,EAAG,CACxC,MAAM,GAAE09B,GAAOziC,EAAM+E,GACrBgzE,EAAUt1C,GAAM,IAAI4lC,EAAO5lC,IAC3B4lC,EAAO5lC,GAAM,CAAC,EAAG,E,CA+BnB,OA5BA4lC,EAAS9kE,KAAK60E,cACZ74E,EACAoiD,EACAu2B,EACAX,EACAlP,EACApiD,GASAoiD,EAHAuP,IACEjjB,GAAkBhT,EAAOu2B,IAAyBvjB,GAE3CpxD,KAAK80E,mBAAmB94E,EAAO8oE,EAAQ2P,EAAQ/xD,GAE/C1iB,KAAK+0E,gBACZ/4E,EACAoiD,EACAu2B,EACA7P,EACA8P,EACAZ,EACAtxD,GAIG1iB,KAAKg1E,UAAUh5E,EAAO8oE,EAAQ0P,EAAW32E,EAAI6kB,EACtD,CAYQ,aAAAmyD,CACN74E,EACAoiD,EACAu2B,EACAX,EACAlP,EACApiD,GAEA,MAAM,eAAE0uC,EAAc,aAAEua,EAAY,KAAEnL,EAAI,MAAEuT,GAAUrxD,EAChDjlB,EAAQzB,EAAMyqD,cACpB,IAAK,IAAIjlD,EAAI,EAAGA,EAAI/D,EAAMgB,OAAQ+C,GAAK,EAAG,CACxC,MAAM,OAAEiO,EAAM,OAAED,GAAW/R,EAAM+D,GAC3B47D,EAAaphE,EAAM8oD,QAAQr1C,GAC3B4tD,EAAarhE,EAAM8oD,QAAQt1C,GAE3B0kE,EAAel4E,EAAMgqD,UAAUv2C,GAC/B0kE,EAAen4E,EAAMgqD,UAAUx2C,GACrC,GAAIukE,IAAUG,GAAgB,GAAKC,GAAgB,GAAI,SAEvD,MAAMc,EAAM,CACV5X,EAAW/3C,KAAKlmB,EAAIg+D,EAAW93C,KAAKlmB,EACpCi+D,EAAW/3C,KAAKpmB,EAAIk+D,EAAW93C,KAAKpmB,GAEtC,IAAIg2E,EAAW5yE,KAAK2nE,MAAMgL,EAAI,GAAIA,EAAI,IACtCC,EAAWA,EAAW,KAAS,KAASA,EACxCD,EAAI,GAAKA,EAAI,GAAKC,EAClBD,EAAI,GAAKA,EAAI,GAAKC,EAEd9jB,GAAkBhT,EAAOu2B,IAC3BO,EAAWA,EAAWlB,EAAMvkE,GAAUukE,EAAMxkE,IAE9C,IAAI2lE,EAAMD,EACNE,EAAMD,EACG,WAAT3U,IACF2U,EAAM7yE,KAAK4Y,IAAI,EAAIg6D,GACnBE,EAAMD,GAEJxJ,IACFwJ,EAAMD,EAAWhB,EACjBkB,EAAMF,EAAWf,GAEf/iB,GAAkBhT,EAAOu2B,GAAuBO,GAAY,GAC9DC,EAAM,EACNC,EAAM,GACGhkB,GAAkBhT,EAAOu2B,GAAuBO,EAAW,IACpEC,EAAMD,EACNE,EAAMF,GAERpQ,EAAOr1D,GAAQ,IAAM0lE,EAAMF,EAAI,GAC/BnQ,EAAOt1D,GAAQ,IAAM4lE,EAAMH,EAAI,GAC/BnQ,EAAOr1D,GAAQ,IAAM0lE,EAAMF,EAAI,GAC/BnQ,EAAOt1D,GAAQ,IAAM4lE,EAAMH,EAAI,E,CAEjC,OAAOnQ,CACT,CAUQ,kBAAAgQ,CACN94E,EACA8oE,EACA2P,EACA/xD,GAEA,MAAM,GAAEgpD,EAAE,OAAEp8B,EAAM,MAAEykC,GAAUrxD,EACxBjmB,EAAQT,EAAMwoD,cACd8vB,EAAU73E,EAAMgC,OACtB,IAAI42E,EAAO,KACPC,GAAQ,KACRC,EAAO,KACPC,GAAQ,KACZ,IAAK,IAAIh0E,EAAI,EAAGA,EAAI8yE,EAAS9yE,GAAK,EAAG,CACnC,MAAM,GAAE09B,EAAE,KAAE5Z,GAAS7oB,EAAM+E,GACvBuyE,GAAS/3E,EAAMgqD,UAAU9mB,IAAO,IACpCu1C,EAAOv1C,GAAIgrC,OAAO5kD,EAAKlmB,EAAGkmB,EAAKpmB,GAC3BomB,EAAKlmB,GAAKk2E,IAAMA,EAAOhwD,EAAKlmB,GAC5BkmB,EAAKlmB,GAAKi2E,IAAMA,EAAO/vD,EAAKlmB,GAC5BkmB,EAAKpmB,GAAKs2E,IAAMA,EAAOlwD,EAAKpmB,GAC5BomB,EAAKpmB,GAAKq2E,IAAMA,EAAOjwD,EAAKpmB,G,CAGlC,MAAMlB,EAAQsE,KAAKC,IAAI+yE,EAAOD,EAAMG,EAAOD,GASrC5P,EAAO,IAAI8E,GAPE,CACjBC,MAAO4K,EAAOD,GAAQ,EACtB1K,MAAO6K,EAAOD,GAAQ,EACtB92E,OAAQT,EACR4sE,WAAYt7B,EACZ+qB,KAAMia,IAGFmB,EAAW,IAAItK,GAASxF,GAG9B,IAAK,IAAInkE,EAAI,EAAGA,EAAI8yE,EAAS9yE,GAAK,EAAG,CACnC,MAAM,GAAE09B,GAAOziC,EAAM+E,GACjBuyE,GAAS/3E,EAAMgqD,UAAU9mB,IAAO,GAEhCu1C,EAAOv1C,GAAIynB,GAAGgf,IAAO8P,EAASpK,OAAOoJ,EAAOv1C,G,CAGlD,IAAK,IAAI19B,EAAI,EAAGA,EAAI8yE,EAAS9yE,GAAK,EAAG,CACnC,MAAM,GAAE09B,EAAE,KAAE5Z,GAAS7oB,EAAM+E,GACrBs5D,EAAS9+D,EAAMgqD,UAAU9mB,GAC/B,GAAI60C,GAASjZ,GAAU,EAAG,SAE1B2Z,EAAOv1C,GAAIirC,aACXsL,EAASjK,YAAYiJ,EAAOv1C,IAC5B4lC,EAAO5lC,GAAI,IAAMu1C,EAAOv1C,GAAIkgC,GAC5B0F,EAAO5lC,GAAI,IAAMu1C,EAAOv1C,GAAImgC,GAG5B,MAAM4V,EAAM,CAAC3vD,EAAKlmB,EAAIkwC,EAAO,GAAIhqB,EAAKpmB,EAAIowC,EAAO,IACjD,IAAI4lC,EAAW5yE,KAAK2nE,MAAMgL,EAAI,GAAIA,EAAI,IACtCC,EAAWA,EAAW,KAAS,KAASA,EACxCD,EAAI,GAAKA,EAAI,GAAKC,EAClBD,EAAI,GAAKA,EAAI,GAAKC,EAClB,MAAMQ,EAAKhK,GAAM5Q,EAAS,GAC1BgK,EAAO5lC,GAAI,IAAMw2C,EAAKT,EAAI,GAC1BnQ,EAAO5lC,GAAI,IAAMw2C,EAAKT,EAAI,E,CAE5B,OAAOnQ,CACT,CAaQ,eAAAiQ,CACN/4E,EACAoiD,EACAu2B,EACA7P,EACA8P,EACAZ,EACAtxD,GAEA,MAAM,eAAE0uC,EAAc,GAAEqa,EAAE,GAAEC,EAAE,OAAEp8B,EAAM,MAAEykC,GAAUrxD,EAC5CjmB,EAAQT,EAAMwoD,cACd8vB,EAAU73E,EAAMgC,OACtB,IAAK,IAAI+C,EAAI,EAAGA,EAAI8yE,EAAS9yE,GAAK,EAAG,CACnC,MAAMm0E,EAAQl5E,EAAM+E,GACdo0E,EAAU55E,EAAMgqD,UAAU2vB,EAAMz2C,IACtC,IAAK,IAAIliB,EAAIxb,EAAI,EAAGwb,EAAIs3D,EAASt3D,GAAK,EAAG,CACvC,MAAM64D,EAAQp5E,EAAMugB,GACd84D,EAAU95E,EAAMgqD,UAAU6vB,EAAM32C,IAEtC,GAAI60C,IAAU6B,GAAW,GAAKE,GAAW,GAAI,SAE7C,MAAMb,EAAM,CAACY,EAAMvwD,KAAKlmB,EAAIu2E,EAAMrwD,KAAKlmB,EAAGy2E,EAAMvwD,KAAKpmB,EAAIy2E,EAAMrwD,KAAKpmB,GACpE,IAAIg2E,EAAW5yE,KAAK2nE,MAAMgL,EAAI,GAAIA,EAAI,IACtCC,EAAWA,EAAW,KAAS,KAASA,EACxCD,EAAI,GAAKA,EAAI,GAAKC,EAClBD,EAAI,GAAKA,EAAI,GAAKC,EAEd9jB,GAAkBhT,EAAOu2B,IAC3BO,EAAWA,EAAWlB,EAAM2B,EAAMz2C,IAAM80C,EAAM6B,EAAM32C,KAGtD,IAAI62C,EAAMtK,GAAMmK,EAAU,IAAME,EAAU,GAAMZ,EAE5C9jB,GAAkBhT,EAAOu2B,GAAuBO,EAAW,EAC7Da,EAAKnB,GAAWgB,EAAU,IAAME,EAAU,GAE1C1kB,GACAhT,EAAOu2B,GACM,IAAbO,EAEAa,EAAK,EAEL3kB,GACAhT,EAAOu2B,GACPO,EAAW,IAEXa,EAAMtK,GAAMmK,EAAU,IAAME,EAAU,GAAMZ,GAE9CpQ,EAAO6Q,EAAMz2C,IAAI,IAAM62C,EAAKd,EAAI,GAChCnQ,EAAO+Q,EAAM32C,IAAI,IAAM62C,EAAKd,EAAI,GAChCnQ,EAAO6Q,EAAMz2C,IAAI,IAAM62C,EAAKd,EAAI,GAChCnQ,EAAO+Q,EAAM32C,IAAI,IAAM62C,EAAKd,EAAI,E,CAIlC,MAAMA,EAAM,CAACU,EAAMrwD,KAAKlmB,EAAIkwC,EAAO,GAAIqmC,EAAMrwD,KAAKpmB,EAAIowC,EAAO,IACvD4lC,EAAW5yE,KAAK2nE,MAAMgL,EAAI,GAAIA,EAAI,IACxCA,EAAI,GAAKA,EAAI,GAAKC,EAClBD,EAAI,GAAKA,EAAI,GAAKC,EAClB,MAAMQ,EAAKhK,GAAMkK,EAAU,GAC3B9Q,EAAO6Q,EAAMz2C,IAAI,IAAMw2C,EAAKT,EAAI,GAChCnQ,EAAO6Q,EAAMz2C,IAAI,IAAMw2C,EAAKT,EAAI,E,CAElC,OAAOnQ,CACT,CAWQ,SAAAkQ,CACNh5E,EACA8oE,EACA0P,EACA32E,EACA6kB,GAEA,MAAM,GAAE63B,EAAE,IAAEsxB,EAAG,MAAEkI,EAAK,MAAEnI,GAAUlpD,EAC5BjmB,EAAQT,EAAMwoD,cACd8vB,EAAU73E,EAAMgC,OAChBu3E,EAAQ,GACRC,EAAQ,GAEd,IAAIC,EAAO,EACPC,EAAO,EACPC,EAAUv4E,EACd,IAAK,IAAI2D,EAAI,EAAGA,EAAI8yE,EAAS9yE,GAAK,EAAG,CACnC,MAAM,GAAE09B,GAAOziC,EAAM+E,GACfs5D,EAAS9+D,EAAMgqD,UAAU9mB,GAC/B,GAAI60C,GAASjZ,GAAU,EAAG,SAE1B,MAAM+V,EAAQ,CACZ/L,EAAO5lC,GAAI,GAAKs1C,EAAUt1C,GAAI,GAC9B4lC,EAAO5lC,GAAI,GAAKs1C,EAAUt1C,GAAI,IAE1Bm3C,EAAY/zE,KAAK2nE,MAAM4G,EAAM,GAAIA,EAAM,IACvCt0D,EAAM,CACVuoD,EAAO5lC,GAAI,GAAKs1C,EAAUt1C,GAAI,GAC9B4lC,EAAO5lC,GAAI,GAAKs1C,EAAUt1C,GAAI,IAE1Bo3C,EAAUh0E,KAAK2nE,MAAM1tD,EAAI,GAAIA,EAAI,IAEvCy5D,EAAMx0E,GAAK60E,EACXJ,EAAMz0E,GAAK80E,EAAU,EAErBJ,IAASpb,EAAS,GAAKkb,EAAMx0E,GAC7B20E,IAASrb,EAAS,GAAKmb,EAAMz0E,E,CAG/B,MAAM+0E,EAAQH,EACdA,EAAWvK,EAAMsK,EAAQD,EACX,IAAVK,IACFH,EAAUA,EAAU,IAAMG,EAAQ,IAAMA,EAAQH,GAGlD,IAAK,IAAI50E,EAAI,EAAGA,EAAI8yE,EAAS9yE,GAAK,EAAG,CACnC,MAAM,GAAE09B,EAAE,KAAE5Z,GAAS7oB,EAAM+E,GACrBs5D,EAAS9+D,EAAMgqD,UAAU9mB,GAC/B,GAAI60C,GAASjZ,GAAU,EAAG,SAC1B,GAAI,EAASx1C,EAAK85C,KAAO,EAAS95C,EAAK+5C,IAAK,SAE5C,IAAI5kB,EAAMF,EAAK67B,GAAY,EAAIA,EAAU9zE,KAAK+lC,KAAK2tC,EAAMx0E,KACrDg1E,EAAWl0E,KAAK2nE,MAAMnF,EAAO5lC,GAAI,GAAI4lC,EAAO5lC,GAAI,IACpDs3C,EAAWA,EAAW,KAAS,KAASA,EACxC,MAAMj0E,EAAMqpE,EAAQ4K,EACpB/7B,EAAKA,EAAKl4C,EAAMA,EAAMk4C,EACtB,MAAMg8B,EAAMh8B,EAAKqqB,EAAO5lC,GAAI,GACtBw3C,EAAMj8B,EAAKqqB,EAAO5lC,GAAI,GAC5BljC,EAAMysD,cAAcvpB,EAAI,CACtB9/B,EAAGkmB,EAAKlmB,EAAIq3E,EACZv3E,EAAGomB,EAAKpmB,EAAIw3E,G,CAGhB,OAAON,CACT,GMxpBAO,MAAOpN,GACPqN,UjEoCK,MAGL,WAAAl1D,CAAmBgB,EAAkC,CAAC,GAAnC,KAAAA,QAAAA,EAFnB,KAAAwc,GAAK,aAGHl/B,KAAK0iB,QAAU,OAAH,wBACPstC,IACAttC,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAe0mB,G,yCAC3B,OAAO1iB,KAAKypE,oBAAmB,EAAOztE,EAAO0mB,EAC/C,G,CAKM,MAAAqqC,CAAO/wD,EAAe0mB,G,+CACpB1iB,KAAKypE,oBAAmB,EAAMztE,EAAO0mB,EAC7C,G,CAYc,kBAAA+mD,CACZ1c,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB,OAAH,wBAAQ3xD,KAAK0iB,SAAYA,IACtC,SACJ2sC,EAAQ,MACRx7C,EAAK,QACLtU,EAAU,KAAI,QACdkG,EAAO,QACP6D,EAAO,YACPutE,EAAW,YACXC,EAAW,eACX7mB,EAAc,OACdr4C,EAAM,UACNk2C,EAAS,MACTke,EAAK,cACL9b,EAAa,OACbC,EAAM,YACN4mB,EAAW,OAEXC,GACErlB,EAEE71D,EAAI,IAAIgF,EAA0B,CACtCuM,KAAM,KAGF4pE,EAAcjoB,GAAevpD,GAAW,GAAIoxE,GAC5CK,EAAcloB,GAAe1lD,GAAW,GAAIwtE,GAClD,IAAIK,EAA4CD,EAC5CE,EAA6CH,EACjC,OAAZ13E,GAAgC,OAAZA,IACtB43E,EAAUF,EACVG,EAAWF,GAEb,MAAM3nB,EAAeH,GAAeC,OAAU7rD,GAGxC/G,EAAgBT,EAAMwoD,cACtB/mD,EAAgBzB,EAAMyqD,cAgD5B,IAAI4wB,EA9CJ56E,EAAMD,SAASgC,IACb,MAAMgZ,EAAO+3C,EAAa/wD,GACpB84E,EAAQF,EAAS54E,GAKjBR,EAAQwZ,EAAO,EAJR2/D,EAAQ34E,GAKfP,EAASuZ,EAAO,EAAI8/D,EACpB/1E,EAAQ/C,EAAK8mB,KAAK/jB,MACpB,EAASA,GAEXzF,EAAEosD,QAAQ,CACRhpB,GAAI1gC,EAAK0gC,GACT5Z,KAAM,CAAEtnB,QAAOC,SAAQsD,WAGzBzF,EAAEosD,QAAQ,CACRhpB,GAAI1gC,EAAK0gC,GACT5Z,KAAM,CAAEtnB,QAAOC,W,IAIjB84E,IACFj7E,EAAE+tD,oBAAoB,SACtBptD,EAAMD,SAASgC,IACb,MAAM,SAAE+4E,GAAa/4E,EAAK8mB,UACT9hB,IAAb+zE,GACAz7E,EAAE4Q,QAAQ6qE,IACZz7E,EAAEwC,UAAUE,EAAK0gC,GAAIq4C,EAAgB,Q,KAK3C95E,EAAMjB,SAASL,IAEbL,EAAEmtD,QAAQ,CACR/pB,GAAI/iC,EAAK+iC,GACTzvB,OAAQtT,EAAKsT,OACbD,OAAQrT,EAAKqT,OACb8V,KAAM,CACJlpB,OAAQD,EAAKmpB,KAAKlpB,QAAU,IAE9B,KAIA46E,aAAM,EAANA,EAAQv4E,UACV44E,EAAY,IAAIv2E,EAAM,CACpBrE,MAAOu6E,KP5JO,EACpBl7E,EACA4mB,KAcA,MAAM,eAAEutC,EAAc,cAAE7D,EAAa,UAAEirB,EAAS,QAAE93E,EAAO,QAAEkG,GACzDid,EAiIiB,IAAC80D,EAAeC,GA9H9BrrB,GAAiBirB,IA8HaI,EA7HjBJ,GA6HEG,EA7HL17E,GA8HT0oD,cAAchoD,SAASu0B,IAC3B,MAAMvyB,EAAOg5E,EAAM1yB,QAAQ/zB,EAAEmO,IAC7B,GAAIu4C,EAAM/qE,QAAQqkB,EAAEmO,IAAK,CACvB,MAAMw4C,EAAWD,EAAM3yB,QAAQ/zB,EAAEmO,IACjC1gC,EAAK8mB,KAAKwmC,SAAW4rB,EAASpyD,KAAKqyD,cAC5BD,EAASpyD,KAAKqyD,M,aAEdn5E,EAAK8mB,KAAKwmC,Q,KAnIrB,MAAMtnD,EAkMiB,CAACC,IACxB,MAAM3I,EAAI,IAAIgF,EAAM,CAAEuM,KAAM,KAkD5B,OAjDA5I,EAAW+/C,cAAchoD,SAASG,IAChC,MAAM6B,EAAOkG,GAAaD,EAAWqgD,QAAQnoD,EAAEuiC,IAAI5Z,MAC7CsyD,EAAc,+BACfzyE,IACA3G,GAECq5E,EAAehzE,GAAkB+yE,EAAa1yE,IAE/CpJ,EAAE4Q,QAAQ/P,EAAEuiC,KACfpjC,EAAEosD,QAAQ,CACRhpB,GAAIviC,EAAEuiC,GACN5Z,KAAM,OAAF,UACCuyD,KAKT,MAAMzyE,EAASX,EAAW2hD,iBAAiB,SACvC3hD,EAAW+hD,UAAU7pD,EAAEuiC,GAAI,SAC3Bz6B,EAAW+hD,UAAU7pD,EAAEuiC,I2EzQpBlkB,M3E0QI5V,IACJtJ,EAAE4Q,QAAQtH,EAAO85B,KACpBpjC,EAAEosD,QAAQ,OAAD,UAAM9iD,IAEjBtJ,EAAEwC,UAAU3B,EAAEuiC,GAAI95B,EAAO85B,I,IAI7Bz6B,EAAWgiD,cAAcjqD,SAASN,IAChC,MAAMC,EAAOuI,GAAaD,EAAWugD,QAAQ9oD,EAAEgjC,IAAI5Z,MAE7CypC,EAAwB,CAAC,EAC/BxpD,UAAAA,GAAW/I,SAASgiB,SACAhb,IAAdrH,EAAKqiB,KAAoBuwC,EAAiBvwC,GAAOriB,EAAKqiB,GAAI,IAGhE1iB,EAAEmtD,QAAQ,CACR/pB,GAAIhjC,EAAEgjC,GACNzvB,OAAQvT,EAAEuT,OACVD,OAAQtT,EAAEsT,OACV8V,KAAMpD,OAAO6qC,OACX,CAAC,EACD1nD,GACAR,GAAkB1I,EAAMmJ,IACxBypD,IAEF,IAGGjzD,CAAC,EArPY0J,CAAiB1J,GASrC,IAAIijD,EANEkR,IACJvtC,EAAQjd,QA4PmB,EAC7B3J,EACA4mB,KAKA,MAAM,QAAEjd,EAAU,EAAC,QAAElG,GAAYmjB,EAiBjC,OAhBA5mB,EAAE0oD,cAAchoD,SAASgC,IAClB87C,MAAM97C,EAAK8mB,KAAK/jB,QACd/C,EAAK8mB,KAAK/jB,QAAO/C,EAAK8mB,KAAK/jB,MAAQ,E,IAG5CzF,EAAE2qD,cAAcjqD,SAASL,I,MACvBA,EAAKmpB,KAAK5f,QAAW,EACiC,OAApB,QAA9B,EAACvJ,EAAKmpB,KAAK3f,gBAAmB,eAAEnG,iBAClB,OAAZD,GAAgC,OAAZA,EACtBpD,EAAKmpB,KAAKtnB,OAAU7B,EAAKmpB,KAAK1f,YAE9BzJ,EAAKmpB,KAAKrnB,QAAW9B,EAAKmpB,KAAK1f,Y,IAK9BH,EAAU,CAAC,EApREI,CAAuBrB,EAAa,CACpDjF,UACAkG,aAKJ,IACEs5C,EAAY91C,GAAUzE,EAAake,E,CACnC,MAAOxmB,GACP,GACgB,8DAAdA,EAAEs5B,QAMF,YAJAva,QAAQwhC,MACN,oJACAvgD,GAIJ,MAAMA,C,CAuHe,EAACuI,EAAoBD,KAC5CC,EAAW+/C,cAAchoD,SAASG,I,MAChC,MAAMuM,EAAazE,EAAWqgD,QAAQnoD,EAAEuiC,IAExC,GAAIh2B,EAAY,CACd,MAAMC,EAAc3E,EAAYsgD,QAAQnoD,EAAEuiC,IAC1Ch2B,EAAWoc,KAAKlmB,EAAI+J,EAAYmc,KAAKlmB,EACrC8J,EAAWoc,KAAKpmB,EAAIiK,EAAYmc,KAAKpmB,EACrCgK,EAAWoc,KAAKqyD,OAASxuE,EAAYmc,KAAKlhB,MAC1C8E,EAAWoc,KAAKwyD,MAAQ3uE,EAAYmc,KAAKvnB,MAER,QAA7B,EAAAyG,EAAY+hD,YAAY5pD,EAAEuiC,WAAG,eAAEzgC,UACjCyK,EAAWoc,KAAKtnB,MAAQmL,EAAYmc,KAAKtnB,MACzCkL,EAAWoc,KAAKrnB,OAASkL,EAAYmc,KAAKrnB,O,KAKhDwG,EAAWgiD,cAAcjqD,SAASN,IAChC,MAAMgN,EAAazE,EAAWugD,QAAQ9oD,EAAEgjC,IAClC/1B,EAAc3E,EAAYwgD,QAAQ9oD,EAAEgjC,IAE1Ch2B,EAAWoc,KAAK7lB,OAAS0J,EAAcA,EAAYmc,KAAK7lB,OAAS,GAC7D0J,GAAeA,EAAYmc,KAAKkB,eAAe,OACjDtd,EAAWoc,KAAKlmB,EAAI+J,EAAYmc,KAAKlmB,EACrC8J,EAAWoc,KAAKpmB,EAAIiK,EAAYmc,KAAKpmB,E,GAEvC,EAhJFkK,CAAiBtN,EAAG0I,EACJ,EO+GdnJ,CAAOS,EAAG,CACRu7E,YACApnB,iBACA7D,gBAAiB0B,EACjBA,UAAWA,GAAa,GACxB7xD,UAAW,SACX2b,SACArY,UACA+J,UACAuK,UAGF,MAAMkkE,EAAgB,CAAC,EAAG,GAC1B,GAAI/L,EAAO,CACT,IAAIvkE,EAAO+lD,IACP3lD,EAAO2lD,IACX1xD,EAAE0oD,cAAchoD,SAASgC,IACnBiJ,EAAOjJ,EAAK8mB,KAAKlmB,IAAIqI,EAAOjJ,EAAK8mB,KAAKlmB,GACtCyI,EAAOrJ,EAAK8mB,KAAKpmB,IAAI2I,EAAOrJ,EAAK8mB,KAAKpmB,EAAE,IAE9CpD,EAAE2qD,cAAcjqD,SAASL,I,MACP,QAAhB,EAAAA,EAAKmpB,KAAK7lB,cAAM,SAAEjD,SAASie,IACrBhT,EAAOgT,EAAMrb,IAAGqI,EAAOgT,EAAMrb,GAC7ByI,EAAO4S,EAAMvb,IAAG2I,EAAO4S,EAAMvb,EAAC,GAClC,IAEJ64E,EAAc,GAAK/L,EAAM,GAAKvkE,EAC9BswE,EAAc,GAAK/L,EAAM,GAAKnkE,C,CAGhC,MAAMmwE,EAA2B,OAAZz4E,GAAgC,OAAZA,EACzC,GAAI4wD,OAmNG,CACL,MAAM8nB,EAA2B,IAAItzD,IAE/BuzD,EADuB,OAAZ34E,GAAgC,OAAZA,EAEjC,CAACgtC,EAAWrlC,IAAcA,EAAIqlC,EAC9B,CAACA,EAAWrlC,IAAcqlC,EAAIrlC,EAClCpL,EAAE0oD,cAAchoD,SAASgC,IAYvBA,EAAK8mB,KAAKlmB,EAAIZ,EAAK8mB,KAAKlmB,EAAK24E,EAAc,GAC3Cv5E,EAAK8mB,KAAKpmB,EAAIV,EAAK8mB,KAAKpmB,EAAK64E,EAAc,GAC3CE,EAAY17D,IAAIy7D,EAAex5E,EAAK8mB,KAAKlmB,EAAIZ,EAAK8mB,KAAKpmB,EAAE,IAE3D,MAAMi5E,EAAiB7qE,MAAM8gC,KAAK6pC,GAAaloE,KAAKmoE,GAG9CE,EAAmBJ,EACrB,CAACK,EAAeC,IAAkBD,EAAOj5E,IAAMk5E,EAAOl5E,EACtD,CAACi5E,EAAeC,IAAkBD,EAAOn5E,IAAMo5E,EAAOp5E,EACpDq5E,EAAmCP,EACrC,CAACQ,EAAaH,EAAeC,KAC3B,MAAM/1E,EAAMD,KAAKC,IAAI81E,EAAOn5E,EAAGo5E,EAAOp5E,GAChCmJ,EAAM/F,KAAK+F,IAAIgwE,EAAOn5E,EAAGo5E,EAAOp5E,GACtC,OAAOs5E,EAAG3uE,QAAQ4Q,GAAUA,EAAMvb,GAAKqD,GAAOkY,EAAMvb,GAAKmJ,GAAI,EAE/D,CAACmwE,EAAaH,EAAeC,KAC3B,MAAM/1E,EAAMD,KAAKC,IAAI81E,EAAOj5E,EAAGk5E,EAAOl5E,GAChCiJ,EAAM/F,KAAK+F,IAAIgwE,EAAOj5E,EAAGk5E,EAAOl5E,GACtC,OAAOo5E,EAAG3uE,QAAQ4Q,GAAUA,EAAMrb,GAAKmD,GAAOkY,EAAMrb,GAAKiJ,GAAI,EAGnEvM,EAAE2qD,cAAcjqD,SAAQ,CAACL,EAAMqF,K,MAKzByuD,GAAkBC,GAAoC,SAAnB/zD,EAAKmpB,KAAKvL,OAC/C5d,EAAKmpB,KAAK4qC,cAwDK,EACvBzwD,EACA29D,EACAC,EACA8a,EACAH,EACAI,EACAG,KAMA,IAAIroB,GAAgBzwD,aAAM,EAANA,EAAQgT,MAAM,EAAGhT,EAAOhB,OAAS,KAAM,GAE3D,GAAI2+D,GAAcC,EAAY,CAC5B,IAAMj+D,EAAGq5E,EAASv5E,EAAGw5E,GAAYtb,EAAW93C,MACtClmB,EAAGu5E,EAASz5E,EAAG05E,GAAYvb,EAAW/3C,KAY5C,GAXI0yD,IACFS,EAAUrb,EAAW93C,KAAKpmB,EAC1Bw5E,EAAUtb,EAAW93C,KAAKlmB,EAC1Bu5E,EAAUtb,EAAW/3C,KAAKpmB,EAC1B05E,EAAUvb,EAAW/3C,KAAKlmB,GAOxBw5E,IAAYF,GAAWD,IAAYE,EAAS,CAC9C,MAAME,EAAcV,EAAe12B,QAAQi3B,GACrCI,EAAuBX,EAAeU,EAAc,GAC1D,GAAIC,EAAsB,CACxB,MAAMC,EAAoB7oB,EAAc,GAClC8oB,EACJhB,EACI,CACE54E,GAAIs5E,EAAWI,GAAwB,EACvC55E,GAAG65E,aAAiB,EAAjBA,EAAmB75E,IAAKy5E,GAE7B,CACEv5E,GAAG25E,aAAiB,EAAjBA,EAAmB35E,IAAKu5E,EAC3Bz5E,GAAIw5E,EAAWI,GAAwB,GAK5CC,IACDX,EAAiBW,EAAmBC,IAEpC9oB,EAActnD,QAAQowE,E,CAI1B,MAAMC,EAAcd,EAAe12B,QAAQm3B,GACrCM,EAAY52E,KAAKgF,IAAI2xE,EAAcJ,GACzC,GAAkB,IAAdK,EACFhpB,EAAgBqoB,EACdroB,EACAkN,EAAW93C,KACX+3C,EAAW/3C,MAGR4qC,EAAczxD,QACjByxD,EAAcnzD,KACXi7E,EACG,CACE54E,GAAIs5E,EAAWE,GAAY,EAC3B15E,EAAGu5E,GAEL,CACEr5E,EAAGq5E,EACHv5E,GAAIw5E,EAAWE,GAAY,SAIhC,GAAIM,EAAY,EAAG,CACxB,MAAMC,EAAuBhB,EAAec,EAAc,GAC1D,GAAIE,EAAsB,CACxB,MAAMC,EAAoBlpB,EAAcA,EAAczxD,OAAS,GACzD46E,EACJrB,EACI,CACE54E,GAAIw5E,EAAWO,GAAwB,EACvCj6E,GAAGk6E,aAAiB,EAAjBA,EAAmBl6E,IAAKy5E,GAE7B,CACEv5E,GAAGg6E,aAAiB,EAAjBA,EAAmBh6E,IAAKq5E,EAC3Bv5E,GAAI05E,EAAWO,GAAwB,GAK5CC,IACDhB,EAAiBgB,EAAmBC,IAEpCnpB,EAAcnzD,KAAKs8E,E,IAM7B,OAAOnpB,CAAa,EA9JcopB,CACR,QAAhB,EAAAn9E,EAAKmpB,KAAK7lB,cAAM,eAAEiD,KAAI,EAAGtD,IAAGF,QAAe,CACzCE,EAAGA,EAAI24E,EAAc,GACrB74E,EAAGA,EAAI64E,EAAc,OAEvBj8E,EAAEgpD,QAAQ3oD,EAAKsT,QACf3T,EAAEgpD,QAAQ3oD,EAAKqT,QACf2oE,EACAH,EACAI,EACAG,G,IAOR,IAAInmB,EAAyB,GAE7BA,EAAct2D,EACX0oD,cACA9hD,KAAKlE,GAASqxD,GAAgBrxD,KACjC,MAAM87D,EAAcx+D,EAAE2qD,cAqBtB,OAnBIsG,IACFqF,EAAY51D,SAASgC,IACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,GACb,IAEJo7D,EAAY99D,SAASL,IACnBH,EAAM2tD,cAAcxtD,EAAK+iC,GAAI,CAC3BgxB,cAAe/zD,EAAKmpB,KAAK4qC,eACzB,KAIS,CACbzzD,MAAO21D,EACP30D,MAAO68D,EAIX,G,GiEjfAif,czBoBK,MAGL,WAAA73D,CACSgB,EAAsC,CAAC,GAAvC,KAAAA,QAAAA,EAHT,KAAAwc,GAAK,gBAKHl/B,KAAK0iB,QAAU,OAAH,wBACP,IACAA,EAEP,CAKM,OAAA+uC,CAAQz1D,EAAc0mB,G,yCAC1B,OAAO1iB,KAAKw5E,4BAA2B,EAAOx9E,EAAO0mB,EACvD,G,CAKM,MAAAqqC,CAAO/wD,EAAc0mB,G,+CACnB1iB,KAAKw5E,4BAA2B,EAAMx9E,EAAO0mB,EACrD,G,CAYc,0BAAA82D,CACZzsB,EACA/wD,EACA0mB,G,yCAEA,MAAMivC,EAAgB3xD,KAAKy5E,SAAS,OAAD,wBAAMz5E,KAAK0iB,SAAYA,KACpD,OAAE4sB,EAAM,QAAE+W,EAASqzB,YAAaC,GAAqBhoB,EAErDl1D,EAAgBT,EACnBwoD,cACA36C,QAAQrL,IAAUA,EAAK8mB,KAAKs0D,WACzBC,EAAiB79E,EACpBwoD,cACA36C,QAAQrL,GAASA,EAAK8mB,KAAKs0D,WACxBn8E,EAAgBzB,EAAMyqD,cAEtB11B,EAAIt0B,aAAK,EAALA,EAAOgC,OACjB,IAAKsyB,GAAW,IAANA,EACR,OAAOs/B,GAAsBr0D,EAAO+wD,EAAQzd,GAI9C,MAAM8iB,EAAyB,GAEzBvL,EAAyB,IAAI1iC,IACnC1nB,EAAMD,SAASgC,IACbqoD,EAAQljC,IAAInlB,EAAK0gC,GAAI1gC,EAAK,IAE5B,MAAMs7E,EAA0B,IAAI31D,IACpC01D,EAAOr9E,SAASu9E,IACdD,EAASn2D,IAAIo2D,EAAM76C,GAAI66C,EAAM,IAK/B,MAAMC,EAA4B,IAAI71D,IAEhC81D,EAA2Bj6E,KAAKk6E,eACpCl+E,EACAqqD,EACAQ,EACAizB,EACAr8E,EACAk0D,EACAqoB,SAEIt1D,QAAQy1D,IAAIF,GAElB,MAAMG,EAAiC,IAAIj2D,IACrCk2D,EAA2B,GAC3BC,EAAiC,IAAIn2D,IAC3C,IAAIo2D,GAAoB,EACxBv+E,EAAMsqD,SAASD,GAAS7pD,SAAS8N,IAC/B,MAAMyvE,EAAQC,EAAWp2D,IAAItZ,EAAK40B,IAC5Bs7C,EAAaV,EAASl2D,IAAItZ,EAAK40B,KAAO2nB,EAAQjjC,IAAItZ,EAAK40B,IACvDu7C,EAAkB,CACtBv7C,GAAI50B,EAAK40B,GACT5Z,KAAM,OAAF,wBACChb,EAAKgb,MAAI,CACZlmB,EAAG26E,EAAMz0D,KAAKlmB,GAAKo7E,EAAWl1D,KAAKlmB,EACnCF,EAAG66E,EAAMz0D,KAAKpmB,GAAKs7E,EAAWl1D,KAAKpmB,EACnCkgE,GAAI2a,EAAMz0D,KAAK85C,IAAMob,EAAWl1D,KAAK85C,GACrCC,GAAI0a,EAAMz0D,KAAK+5C,IAAMmb,EAAWl1D,KAAK+5C,GACrChF,KAAM0f,EAAMz0D,KAAK+0C,MAAQmgB,EAAWl1D,KAAK+0C,KACzC7iD,KAAMuiE,EAAMz0D,KAAK9N,QAGrB6iE,EAAiBt9E,KAAK09E,GACtBL,EAAaz2D,IAAIrZ,EAAK40B,IAAI,GAEvBob,MAAMmgC,EAAgBn1D,KAAKlmB,IACD,IAA3Bq7E,EAAgBn1D,KAAKlmB,GACpBk7C,MAAMmgC,EAAgBn1D,KAAKpmB,IACD,IAA3Bu7E,EAAgBn1D,KAAKpmB,GAIrBu7E,EAAgBn1D,KAAKlmB,EAAoB,IAAhBkD,KAAK0hC,SAC9By2C,EAAgBn1D,KAAKpmB,EAAoB,IAAhBoD,KAAK0hC,UAH9Bu2C,GAAoB,EAKtBha,GACEvkE,EACA,CAACsO,IACAK,IACKA,EAAMu0B,KAAO50B,EAAK40B,IAAIo7C,EAAkB32D,IAAIhZ,EAAMu0B,GAAI50B,EAAK40B,GAAG,GAEpE,KACAmnB,EACD,IAGH,MAAMq0B,EAAwB,GAsB9B,IAAIC,EACJ,GAtBAl9E,EAAMjB,SAASL,IACb,MAAMy+E,EACJN,EAAkB12D,IAAIznB,EAAKsT,SAAWtT,EAAKsT,OACvCorE,EACJP,EAAkB12D,IAAIznB,EAAKqT,SAAWrT,EAAKqT,OAG3CorE,IAAqBC,GACrBT,EAAax9E,IAAIg+E,IACjBR,EAAax9E,IAAIi+E,IAEjBH,EAAiB39E,KAAK,CACpBmiC,GAAI/iC,EAAK+iC,GACTzvB,OAAQmrE,EACRprE,OAAQqrE,EACRv1D,KAAM,CAAC,G,IAOT+0D,aAAgB,EAAhBA,EAAkB57E,OAAQ,CAC5B,GAAgC,IAA5B47E,EAAiB57E,OACnB47E,EAAiB,GAAG/0D,KAAKlmB,EAAIkwC,EAAO,GACpC+qC,EAAiB,GAAG/0D,KAAKpmB,EAAIowC,EAAO,OAC/B,CACL,MAAMwrC,EAAmB,IAAIh6E,EAAU,CACrCrE,MAAO49E,EACP58E,MAAOi9E,IAEHhB,EAAcC,GAAoB,IAAI5gB,GAE5C,GAAIwhB,GAAqB3Y,GAAsB8X,EAAYx6C,IAAK,CAC9D,MAAM67C,EACJV,EAAiB57E,OAAS,IACtB,IAAImiE,GACJ,IAAIpP,SACJupB,EAAkBhuB,OAAO+tB,E,CAEjCH,QAAuBjB,EAAYjoB,QAAQqpB,EAAkB,OAAF,QACzDxrC,SACAo8B,GAAI,EACJta,gBAAgB,EAChB4pB,SAAS,GACc,UAAnBtB,EAAYx6C,GACZ,CACEm5B,QAAS,EACTl4B,OAAQ,EACRy4B,aAAc,CAACz8D,EAAYsT,EAAcD,KAErClN,KAAKC,OAAQkN,EAAO6V,KAAK9N,OAAsB,IAG7B,GADlBlV,KAAKC,OAAQiN,EAAO8V,KAAK9N,OAAsB,IACZ,EAAI,KAG7C,CAAC,G,CAKTwiE,EAAWx9E,SAASy+E,I,MAClB,MAAMC,EAAgBP,EAAel+E,MAAMqN,MACxCoD,GAAcA,EAAIgyB,KAAO+7C,EAAU/7C,KAEtC,GAAIg8C,EAAe,CAEjB,MAAM,EAAE97E,EAAC,EAAEF,GAAMg8E,EAAc51D,KAC/B21D,EAAU31D,KAAK/oB,SAAU,EACzB0+E,EAAU31D,KAAKlmB,EAAIA,EACnB67E,EAAU31D,KAAKpmB,EAAIA,EACnBkzD,EAAYr1D,KAAK,CACfmiC,GAAI+7C,EAAU/7C,GACd5Z,KAAM,CAAElmB,IAAGF,M,CAIf,MAAM,EAAEE,EAAC,EAAEF,GAAM+7E,EAAU31D,KACK,QAA/B,EAAA21D,EAAU31D,KAAK7oB,aAAgB,SAAED,SAASgC,IACzC4zD,EAAYr1D,KAAK,CACfmiC,GAAI1gC,EAAK0gC,GACT5Z,KAAM,CAAElmB,EAAGZ,EAAK8mB,KAAKlmB,EAAIA,EAAGF,EAAGV,EAAK8mB,KAAKpmB,EAAIA,IAC7C,GACF,IAGJ86E,EAAWx9E,SAAQ,EAAG8oB,WACpB,MAAM,EAAElmB,EAAC,EAAEF,EAAC,QAAE3C,EAAO,MAAEE,GAAU6oB,EAChC7oB,SAAAA,EAAkBD,SAASgC,IAC1B,IAAKjC,EAAS,CACZ,MAAM4+E,EAAa/oB,EAAYtoD,MAAMinB,GAAMA,EAAEmO,KAAO1gC,EAAK0gC,KACzDi8C,EAAW71D,KAAKlmB,GAAKA,GAAK,EAC1B+7E,EAAW71D,KAAKpmB,GAAKA,GAAK,C,IAE5B,G,CAkBN,OAdI6tD,GACFqF,EAAY51D,SAASgC,IACnBxC,EAAMysD,cAAcjqD,EAAK0gC,GAAI,CAC3B9/B,EAAGZ,EAAK8mB,KAAKlmB,EACbF,EAAGV,EAAK8mB,KAAKpmB,GACb,IAIS,CACbzC,MAAO21D,EACP30D,QAIJ,G,CAEQ,QAAAg8E,CAAS/2D,GACf,MAAMw3C,EAAmB,OAAH,UAAQx3C,IACxB,SAAE2sC,EAAQ,QAAE+rB,EAAO,aAAEjZ,GAAiBz/C,EAC5C,IAAI6sC,EACA8rB,EAoDAC,EAvCJ,GATED,EADE,EAASD,GACG,IAAMA,EACX,GAAWA,GACNA,EAEA,IAAM,EAEtBlhB,EAAiBkhB,QAAUC,EAGtBhsB,EAiBE,GAAI,GAAWA,GACpBE,EAAgB1yC,IACd,MAAMrF,EAAO63C,EAASxyC,GAChBu+D,EAAUC,EAAYx+D,GAC5B,OAAInB,GAAQmB,EAAErF,QACAqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,IACzC4jE,GAAW,IAElB5jE,GAAQ,IAAM4jE,GAAW,CAAC,OAEhC,GAAI1/D,GAAQ2zC,GAAW,CAC5B,MACMiB,GADSjB,EAAS,GAAKA,EAAS,GAAKA,EAAS,GAAKA,EAAS,IAC1C,EACxBE,EAAgB1yC,GAAMyzC,EAAS+qB,EAAYx+D,GAAK,C,KAC3C,CAEL,MAAMyzC,EAASjB,EAAW,EAC1BE,EAAgB1yC,GAAMyzC,EAAS+qB,EAAYx+D,GAAK,C,MAjChD0yC,EAAgB1yC,IACd,MAAMu+D,EAAUC,EAAYx+D,GAC5B,OAAIA,EAAErF,KACAkE,GAAQmB,EAAErF,QACAqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,GAAKqF,EAAErF,KAAK,IACzC4jE,GAAW,EAEvB,GAASv+D,EAAErF,QAEXqF,EAAErF,KAAKxZ,MAAQ6e,EAAErF,KAAKvZ,OAAS4e,EAAErF,KAAKxZ,MAAQ6e,EAAErF,KAAKvZ,QACzCm9E,GAAW,GAEnBv+D,EAAErF,KAAO4jE,GAAW,EAEvB,GAAKA,EAAU,CAAC,EAoC3B,OAfAlhB,EAAiB7K,SAAWE,EAK1B+rB,EADE,EAASnZ,GACQ,IAAMA,EAChBzmD,GAAQymD,GACE,IAAM7/D,KAAKC,IAAIqjB,MAAM,KAAMu8C,GACrC,GAAWA,GACDA,EAGA,IAAM,EAE3BjI,EAAiBiI,aAAemZ,EACzBphB,CACT,CAEQ,cAAAggB,CACNl+E,EACAqqD,EACAQ,EACAizB,EACAr8E,EACAilB,EACAs3D,GAEA,MAAM,SAAE3qB,EAAQ,aAAE8S,EAAY,QAAEiZ,EAAO,YAAEG,GAAgB74D,EAEnD84D,EAAwBD,GAAe,IAAI/pB,GAAiB,CAAC,GAC7DiqB,EAAqB,CACzBnsC,OAAQ,CAAC,EAAG,GACZ8hB,gBAAgB,EAChB9B,YAAa8rB,GAETM,EAAsC,GAEtCC,EAAWn9E,IAEf,IAAIo9E,GAAUzZ,aAAY,EAAZA,EAAe3jE,KAAS,GAEtC,OADIkd,GAAQkgE,KAAUA,EAAUt5E,KAAKC,OAAOq5E,IACrC,CACLpkE,KAAMokE,EAAU,CAAW,EAAVA,EAAuB,EAAVA,GAAe,CAAC,GAAI,IAClDA,UACD,EA0HH,OAvHA5/E,EAAMsqD,SAASD,GAAS7pD,SAAS8N,IAE/B0vE,EAAWr2D,IAAIrZ,EAAK40B,GAAI,CACtBA,GAAI50B,EAAK40B,GACT5Z,KAAM,CACJ7oB,MAAO,GACP+a,KAAMmkE,EAAQrxE,GAAMkN,QAIxB,IAAID,EAAQmN,QAAQiT,UAGpB4oC,GACEvkE,EACA,CAACsO,IACAwsD,I,MACC,IAAKA,EAASxxC,KAAKs0D,SAAU,OAC7B,MAAQpiE,KAAMqkE,EAAK,QAAED,GAAYD,EAAQ7kB,GACzC,GAA4C,QAAvC,EAAA96D,EAAMuqD,YAAYuQ,EAAS53B,GAAImnB,UAAQ,eAAE5nD,OASvC,CAEL,MAAMw8E,EAAYjB,EAAWp2D,IAAIkzC,EAAS53B,IAC1C86C,EAAWr2D,IAAImzC,EAAS53B,GAAI,CAC1BA,GAAI43B,EAAS53B,GACb5Z,KAAM,OAAF,QACF7oB,MAAO,IACJw+E,aAAS,EAATA,EAAW31D,QAGlB,MAAMw2D,EAAqB,IAAI33D,IACzB43D,EAAmB//E,EACtBuqD,YAAYuQ,EAAS53B,GAAImnB,GACzB3jD,KAAKiI,IACJ,GAAIA,EAAM2a,KAAKs0D,SAUb,OATKI,EAAWp9E,IAAI+N,EAAMu0B,KACxB86C,EAAWr2D,IAAIhZ,EAAMu0B,GAAI,CACvBA,GAAIv0B,EAAMu0B,GACV5Z,KAAM,OAAF,UACC3a,EAAM2a,QAIfw2D,EAAmBn4D,IAAIhZ,EAAMu0B,IAAI,GAC1B86C,EAAWp2D,IAAIjZ,EAAMu0B,IAE9B,MAAM88C,EAAUn1B,EAAQjjC,IAAIjZ,EAAMu0B,KAAO46C,EAASl2D,IAAIjZ,EAAMu0B,IAE5D,OADA48C,EAAmBn4D,IAAIhZ,EAAMu0B,IAAI,GAC1B,CACLA,GAAIv0B,EAAMu0B,GACV5Z,KAAM,OAAF,wBACC02D,EAAQ12D,MACR3a,EAAM2a,MAEZ,IAEC22D,EAAiB,CACrBx/E,MAAOs/E,EACPt+E,MAAOA,EAAMoM,QACV1N,GACC2/E,EAAmBl/E,IAAIT,EAAKsT,SAC5BqsE,EAAmBl/E,IAAIT,EAAKqT,WAGlC,IAAI0sE,EAAc1uB,IAClBuuB,EAAiBv/E,SAASgC,I,MACxB,IAAI,KAAEgZ,GAAShZ,EAAK8mB,KACf9N,IACHA,GAA8B,QAAvB,EAAAwiE,EAAWp2D,IAAIplB,EAAK0gC,WAAG,eAAE5Z,KAAK9N,QAClC63C,aAAQ,EAARA,EAAwB7wD,KAAS,CAAC,GAAI,KAEvC,EAASgZ,KAAOA,EAAO,CAACA,EAAMA,IAClC,MAAO2kE,EAAOC,GAAS5kE,EACnB0kE,EAAcC,IAAOD,EAAcC,GACnCD,EAAcE,IAAOF,EAAcE,GACvC59E,EAAK8mB,KAAK9N,KAAOA,CAAI,IAIvBD,EAAQA,EAAM4qC,MAAK,IAAY,kCAC7B,MAAMk6B,EAAiB,IAAIv7E,EAAUm7E,GAC/BV,QAAoBC,EAAiBzuB,OACzCsvB,EACAZ,IAEI,KAAEh0E,EAAI,KAAEI,EAAI,KAAED,EAAI,KAAEE,GF1YX,CAACrL,IAC5B,IAAIgL,EAAO+lD,IACP3lD,EAAO2lD,IACP5lD,GAAO,IACPE,GAAO,IAsBX,OArBArL,EAAMD,SAASgC,IACb,IAAIgZ,EAAOhZ,EAAK8mB,KAAK9N,KACjBkE,GAAQlE,GACU,IAAhBA,EAAK/Y,SAAc+Y,EAAO,CAACA,EAAK,GAAIA,EAAK,KACpC,EAASA,GAClBA,EAAO,CAACA,EAAMA,SACIhU,IAATgU,GAAsB8iC,MAAM9iC,MACrCA,EAAO,CAAC,GAAI,KAGd,MAAM8kE,EAAW,CAAC9kE,EAAK,GAAK,EAAGA,EAAK,GAAK,GACnC+kE,EAAO/9E,EAAK8mB,KAAKlmB,EAAIk9E,EAAS,GAC9BvoB,EAAQv1D,EAAK8mB,KAAKlmB,EAAIk9E,EAAS,GAC/B7xE,EAAMjM,EAAK8mB,KAAKpmB,EAAIo9E,EAAS,GAC7B5xE,EAASlM,EAAK8mB,KAAKpmB,EAAIo9E,EAAS,GAElC70E,EAAO80E,IAAM90E,EAAO80E,GACpB10E,EAAO4C,IAAK5C,EAAO4C,GACnB7C,EAAOmsD,IAAOnsD,EAAOmsD,GACrBjsD,EAAO4C,IAAQ5C,EAAO4C,EAAM,IAE3B,CAAEjD,OAAMI,OAAMD,OAAME,OAAM,EEgXc00E,CACjCT,GAGIzsC,GAAe1nC,EAAOH,GAAQ,EAA9B6nC,GAAqCxnC,EAAOD,GAAQ,EAC1Do0E,EAAex/E,MAAMD,SAASgC,IAC5BA,EAAK8mB,KAAKlmB,GAAKkwC,EACf9wC,EAAK8mB,KAAKpmB,GAAKowC,CAAQ,IAEzB,MAAM93B,EAAyB,CAC7BlV,KAAKC,IAAIqF,EAAOH,EAAMy0E,GAAyB,EAAVN,EACrCt5E,KAAKC,IAAIuF,EAAOD,EAAMq0E,GAAyB,EAAVN,GAKvC,OAFA5B,EAAWp2D,IAAIkzC,EAAS53B,IAAI5Z,KAAK9N,KAAOA,EACxCwiE,EAAWp2D,IAAIkzC,EAAS53B,IAAI5Z,KAAK7oB,MAAQs/E,EAClCR,CACT,K,MAzFAvB,EAAWr2D,IAAImzC,EAAS53B,GAAI,CAC1BA,GAAI43B,EAAS53B,GACb5Z,KAAM,OAAF,wBACCwxC,EAASxxC,MAAI,CAChB9N,KAAMqkE,MAuFZ,OAAO,CAAI,GAEb,KACAx1B,GAEFq1B,EAAoB3+E,KAAKwa,EAAM,IAE1BmkE,CACT,I6B/eF,IAAIe,GAEG,SAASC,MACTD,cAAa,EAAbA,GAA6CrjB,OAC/CqjB,GAA4CrjB,MAEjD,CAEO,SAAeujB,GACpBC,EACAC,G,yCAEA,MACExhF,QAAQ,GAAE6jC,EAAE,QAAExc,EAAO,WAAE62C,GAAY,MACnC98D,EAAK,MACLgB,GACEm/E,EAME5gF,EAAQ,IAAI8E,EAAM,CACtBrE,QACAgB,UAOIq/E,EAAatO,GAAStvC,GAC5B,IAAI49C,EAGF,MAAM,IAAIliE,MAAM,sBAAsBskB,KAFtCu9C,GAAgB,IAAIK,EAAWp6D,GAKjC,IAAIy+C,QAAkBsb,GAAchrB,QAAQz1D,GAK5C,SCDAX,EDH2BohF,ICKXnjB,QAAUj+D,EAAO+9D,ODJ/BqjB,GAAcrjB,OACd+H,EAAYsb,GAAcnjB,KAAKC,IAE1B,CAAC4H,EAAW0b,GCFd,IACLxhF,CDEF,G","sources":["webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/index.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/acyclic.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/add-border-segments.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/coordinate-system.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/data/list.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/debug.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/graphlib.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/greedy-fas.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/layout.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/lodash.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/nesting-graph.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/normalize.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/add-subgraph-constraints.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/barycenter.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/build-layer-graph.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/cross-count.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/index.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/init-order.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/resolve-conflicts.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort-subgraph.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/order/sort.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/parent-dummy-chains.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/bk.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/position/index.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/feasible-tree.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/index.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/network-simplex.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/rank/util.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/util.js","webpack://Layout/../../node_modules/.pnpm/dagre@0.8.5/node_modules/dagre/lib/version.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/index.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/components.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dfs.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra-all.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/dijkstra.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/find-cycles.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/floyd-warshall.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/index.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/is-acyclic.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/postorder.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/preorder.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/prim.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/tarjan.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/alg/topsort.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/data/priority-queue.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/graph.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/index.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/json.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/lodash.js","webpack://Layout/../../node_modules/.pnpm/graphlib@2.1.8/node_modules/graphlib/lib/version.js","webpack://Layout/../../node_modules/.pnpm/is-any-array@2.0.1/node_modules/is-any-array/lib-esm/index.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_DataView.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Hash.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_ListCache.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Map.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_MapCache.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Promise.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Set.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_SetCache.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Stack.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Symbol.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_Uint8Array.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_WeakMap.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_apply.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayEach.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayFilter.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayIncludes.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayIncludesWith.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayLikeKeys.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayMap.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayPush.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arrayReduce.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_arraySome.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_asciiSize.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assignMergeValue.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assignValue.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_assocIndexOf.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssign.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssignIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseAssignValue.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseClone.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseCreate.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseEach.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseExtremum.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFilter.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFindIndex.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFlatten.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseFor.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseForOwn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGetAllKeys.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGetTag.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseGt.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseHas.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseHasIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIndexOf.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsArguments.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsEqual.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsEqualDeep.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsMap.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsMatch.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsNaN.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsNative.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsSet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIsTypedArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseIteratee.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseKeys.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseKeysIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseLt.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMap.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMatches.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMatchesProperty.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMerge.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseMergeDeep.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseOrderBy.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePick.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePickBy.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseProperty.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_basePropertyDeep.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseRange.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseReduce.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseRest.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSetToString.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseSortBy.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseTimes.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseToString.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseTrim.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseUnary.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseUniq.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseValues.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_baseZipObject.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cacheHas.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_castFunction.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_castPath.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneArrayBuffer.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneBuffer.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneDataView.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneRegExp.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneSymbol.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_cloneTypedArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_compareAscending.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_compareMultiple.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copyArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copyObject.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copySymbols.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_copySymbolsIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_coreJsData.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createAssigner.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createBaseEach.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createBaseFor.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createFind.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createRange.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_createSet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_defineProperty.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalArrays.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalByTag.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_equalObjects.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_flatRest.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_freeGlobal.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getAllKeys.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getAllKeysIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getMapData.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getMatchData.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getNative.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getPrototype.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getRawTag.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getSymbols.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getSymbolsIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getTag.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_getValue.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hasPath.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hasUnicode.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashClear.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashDelete.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashGet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashHas.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_hashSet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneByTag.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_initCloneObject.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isFlattenable.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isIndex.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isIterateeCall.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isKey.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isKeyable.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isMasked.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isPrototype.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_isStrictComparable.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheClear.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheDelete.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheGet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheHas.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_listCacheSet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheClear.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheDelete.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheGet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheHas.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapCacheSet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_mapToArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_matchesStrictComparable.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_memoizeCapped.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeCreate.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeKeys.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nativeKeysIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_nodeUtil.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_objectToString.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_overArg.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_overRest.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_root.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_safeGet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setCacheAdd.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setCacheHas.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setToArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_setToString.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_shortOut.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackClear.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackDelete.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackGet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackHas.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stackSet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_strictIndexOf.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stringSize.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_stringToPath.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_toKey.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_toSource.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_trimmedEndIndex.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/_unicodeSize.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/clone.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/cloneDeep.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/constant.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/defaults.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/each.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/eq.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/filter.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/find.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/findIndex.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/flatten.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/forEach.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/forIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/get.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/has.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/hasIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/identity.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArguments.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArrayLike.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isArrayLikeObject.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isBuffer.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isEmpty.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isFunction.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isLength.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isMap.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isObject.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isObjectLike.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isPlainObject.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isSet.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isString.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isSymbol.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isTypedArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/isUndefined.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/keys.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/keysIn.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/last.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/map.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/mapValues.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/max.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/memoize.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/merge.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/min.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/minBy.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/noop.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/now.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/pick.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/property.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/range.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/reduce.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/size.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/sortBy.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/stubArray.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/stubFalse.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toFinite.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toInteger.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toNumber.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toPlainObject.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/toString.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/transform.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/union.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/uniqueId.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/values.js","webpack://Layout/../../node_modules/.pnpm/lodash@4.17.21/node_modules/lodash/zipObject.js","webpack://Layout/../../node_modules/.pnpm/ml-array-rescale@1.3.7/node_modules/ml-array-rescale/lib-es6/index.js","webpack://Layout/../../node_modules/.pnpm/ml-array-min@1.2.3/node_modules/ml-array-min/lib-es6/index.js","webpack://Layout/../../node_modules/.pnpm/ml-array-max@1.2.4/node_modules/ml-array-max/lib-es6/index.js","webpack://Layout/../../node_modules/.pnpm/ml-matrix@6.11.0/node_modules/ml-matrix/matrix.js","webpack://Layout/webpack/bootstrap","webpack://Layout/webpack/runtime/compat get default export","webpack://Layout/webpack/runtime/define property getters","webpack://Layout/webpack/runtime/global","webpack://Layout/webpack/runtime/hasOwnProperty shorthand","webpack://Layout/webpack/runtime/make namespace object","webpack://Layout/webpack/runtime/node module decorator","webpack://Layout/../../node_modules/.pnpm/tslib@2.6.2/node_modules/tslib/tslib.es6.mjs","webpack://Layout/../../node_modules/.pnpm/@antv+event-emitter@0.1.3/node_modules/@antv/event-emitter/esm/index.js","webpack://Layout/../../node_modules/.pnpm/@antv+graphlib@2.0.2/node_modules/@antv/graphlib/esm/utils/traverse.js","webpack://Layout/../../node_modules/.pnpm/@antv+graphlib@2.0.2/node_modules/@antv/graphlib/esm/graphView.js","webpack://Layout/../../node_modules/.pnpm/@antv+graphlib@2.0.2/node_modules/@antv/graphlib/esm/graph.js","webpack://Layout/../../node_modules/.pnpm/@antv+util@3.3.7/node_modules/@antv/util/esm/lodash/is-type.js","webpack://Layout/../../node_modules/.pnpm/@antv+util@3.3.7/node_modules/@antv/util/esm/lodash/is-number.js","webpack://Layout/./src/antv-dagre/data/list.ts","webpack://Layout/./src/antv-dagre/greedy-fas.ts","webpack://Layout/./src/antv-dagre/acyclic.ts","webpack://Layout/./src/antv-dagre/util.ts","webpack://Layout/./src/antv-dagre/add-border-segments.ts","webpack://Layout/./src/antv-dagre/coordinate-system.ts","webpack://Layout/./src/antv-dagre/nesting-graph.ts","webpack://Layout/./src/antv-dagre/normalize.ts","webpack://Layout/../../node_modules/.pnpm/@antv+util@3.3.7/node_modules/@antv/util/esm/lodash/clone.js","webpack://Layout/../../node_modules/.pnpm/@antv+util@3.3.7/node_modules/@antv/util/esm/lodash/is-array.js","webpack://Layout/./src/antv-dagre/order/cross-count.ts","webpack://Layout/./src/antv-dagre/order/init-order.ts","webpack://Layout/./src/antv-dagre/order/resolve-conflicts.ts","webpack://Layout/./src/antv-dagre/order/sort.ts","webpack://Layout/./src/antv-dagre/order/sort-subgraph.ts","webpack://Layout/./src/antv-dagre/order/barycenter.ts","webpack://Layout/./src/antv-dagre/order/index.ts","webpack://Layout/./src/antv-dagre/order/build-layer-graph.ts","webpack://Layout/./src/antv-dagre/order/add-subgraph-constraints.ts","webpack://Layout/./src/antv-dagre/position/bk.ts","webpack://Layout/./src/antv-dagre/position/index.ts","webpack://Layout/./src/antv-dagre/rank/util.ts","webpack://Layout/./src/antv-dagre/rank/feasible-tree.ts","webpack://Layout/./src/antv-dagre/rank/network-simplex.ts","webpack://Layout/./src/antv-dagre/rank/index.ts","webpack://Layout/./src/antv-dagre/layout.ts","webpack://Layout/./src/antv-dagre/parent-dummy-chains.ts","webpack://Layout/./src/antv-dagre/order/init-data-order.ts","webpack://Layout/../../node_modules/.pnpm/@antv+util@3.3.7/node_modules/@antv/util/esm/lodash/is-function.js","webpack://Layout/../../node_modules/.pnpm/@antv+util@3.3.7/node_modules/@antv/util/esm/lodash/is-object.js","webpack://Layout/./src/util/function.ts","webpack://Layout/./src/util/object.ts","webpack://Layout/./src/antv-dagre.ts","webpack://Layout/./src/util/common.ts","webpack://Layout/./src/circular.ts","webpack://Layout/../../node_modules/.pnpm/@antv+util@3.3.7/node_modules/@antv/util/esm/lodash/is-string.js","webpack://Layout/./src/util/array.ts","webpack://Layout/./src/concentric.ts","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/add.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quad.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/x.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/y.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/quadtree.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/add.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/octant.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/x.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/y.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/z.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/octree.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/cover.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/data.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/extent.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/find.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/remove.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/root.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/size.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/visit.js","webpack://Layout/../../node_modules/.pnpm/d3-quadtree@3.0.1/node_modules/d3-quadtree/src/visitAfter.js","webpack://Layout/./src/force/forceNBody.ts","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/cover.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/data.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/extent.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/find.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/remove.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/root.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/size.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/visit.js","webpack://Layout/../../node_modules/.pnpm/d3-octree@1.0.2/node_modules/d3-octree/src/visitAfter.js","webpack://Layout/./src/force/index.ts","webpack://Layout/../../node_modules/.pnpm/ml-matrix@6.11.0/node_modules/ml-matrix/matrix.mjs","webpack://Layout/./src/util/math.ts","webpack://Layout/./src/mds.ts","webpack://Layout/./src/comboCombined.ts","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/constant.js","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/jiggle.js","webpack://Layout/../../node_modules/.pnpm/d3-dispatch@3.0.1/node_modules/d3-dispatch/src/dispatch.js","webpack://Layout/../../node_modules/.pnpm/d3-timer@3.0.1/node_modules/d3-timer/src/timer.js","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/lcg.js","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/simulation.js","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/manyBody.js","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/link.js","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/collide.js","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/x.js","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/y.js","webpack://Layout/./src/d3Force/forceInBox.ts","webpack://Layout/./src/d3Force/index.ts","webpack://Layout/./src/dagre.ts","webpack://Layout/./src/util/size.ts","webpack://Layout/./src/forceAtlas2/body.ts","webpack://Layout/./src/forceAtlas2/quad.ts","webpack://Layout/./src/forceAtlas2/quadTree.ts","webpack://Layout/./src/forceAtlas2/index.ts","webpack://Layout/./src/fruchterman.ts","webpack://Layout/./src/grid.ts","webpack://Layout/./src/radial/radial-nonoverlap-force.ts","webpack://Layout/./src/radial/index.ts","webpack://Layout/./src/random.ts","webpack://Layout/./src/registry.ts","webpack://Layout/./src/radial/mds.ts","webpack://Layout/../../node_modules/.pnpm/d3-force@3.0.0/node_modules/d3-force/src/center.js","webpack://Layout/../../node_modules/.pnpm/@antv+util@3.3.7/node_modules/@antv/util/esm/lodash/is-nil.js","webpack://Layout/./src/bundle-worker.ts","webpack://Layout/./src/types.ts"],"sourcesContent":["/*\nCopyright (c) 2012-2014 Chris Pettitt\n\nPermission is hereby granted, free of charge, to any person obtaining a copy\nof this software and associated documentation files (the \"Software\"), to deal\nin the Software without restriction, including without limitation the rights\nto use, copy, modify, merge, publish, distribute, sublicense, and/or sell\ncopies of the Software, and to permit persons to whom the Software is\nfurnished to do so, subject to the following conditions:\n\nThe above copyright notice and this permission notice shall be included in\nall copies or substantial portions of the Software.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR\nIMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,\nFITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE\nAUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER\nLIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,\nOUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN\nTHE SOFTWARE.\n*/\n\nmodule.exports = {\n  graphlib: require(\"./lib/graphlib\"),\n\n  layout: require(\"./lib/layout\"),\n  debug: require(\"./lib/debug\"),\n  util: {\n    time: require(\"./lib/util\").time,\n    notime: require(\"./lib/util\").notime\n  },\n  version: require(\"./lib/version\")\n};\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar greedyFAS = require(\"./greedy-fas\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\nfunction run(g) {\n  var fas = (g.graph().acyclicer === \"greedy\"\n    ? greedyFAS(g, weightFn(g))\n    : dfsFAS(g));\n  _.forEach(fas, function(e) {\n    var label = g.edge(e);\n    g.removeEdge(e);\n    label.forwardName = e.name;\n    label.reversed = true;\n    g.setEdge(e.w, e.v, label, _.uniqueId(\"rev\"));\n  });\n\n  function weightFn(g) {\n    return function(e) {\n      return g.edge(e).weight;\n    };\n  }\n}\n\nfunction dfsFAS(g) {\n  var fas = [];\n  var stack = {};\n  var visited = {};\n\n  function dfs(v) {\n    if (_.has(visited, v)) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    _.forEach(g.outEdges(v), function(e) {\n      if (_.has(stack, e.w)) {\n        fas.push(e);\n      } else {\n        dfs(e.w);\n      }\n    });\n    delete stack[v];\n  }\n\n  _.forEach(g.nodes(), dfs);\n  return fas;\n}\n\nfunction undo(g) {\n  _.forEach(g.edges(), function(e) {\n    var label = g.edge(e);\n    if (label.reversed) {\n      g.removeEdge(e);\n\n      var forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.setEdge(e.w, e.v, label, forwardName);\n    }\n  });\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = addBorderSegments;\n\nfunction addBorderSegments(g) {\n  function dfs(v) {\n    var children = g.children(v);\n    var node = g.node(v);\n    if (children.length) {\n      _.forEach(children, dfs);\n    }\n\n    if (_.has(node, \"minRank\")) {\n      node.borderLeft = [];\n      node.borderRight = [];\n      for (var rank = node.minRank, maxRank = node.maxRank + 1;\n        rank < maxRank;\n        ++rank) {\n        addBorderNode(g, \"borderLeft\", \"_bl\", v, node, rank);\n        addBorderNode(g, \"borderRight\", \"_br\", v, node, rank);\n      }\n    }\n  }\n\n  _.forEach(g.children(), dfs);\n}\n\nfunction addBorderNode(g, prop, prefix, sg, sgNode, rank) {\n  var label = { width: 0, height: 0, rank: rank, borderType: prop };\n  var prev = sgNode[prop][rank - 1];\n  var curr = util.addDummyNode(g, \"border\", label, prefix);\n  sgNode[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.setEdge(prev, curr, { weight: 1 });\n  }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = {\n  adjust: adjust,\n  undo: undo\n};\n\nfunction adjust(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapWidthHeight(g);\n  }\n}\n\nfunction undo(g) {\n  var rankDir = g.graph().rankdir.toLowerCase();\n  if (rankDir === \"bt\" || rankDir === \"rl\") {\n    reverseY(g);\n  }\n\n  if (rankDir === \"lr\" || rankDir === \"rl\") {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n}\n\nfunction swapWidthHeight(g) {\n  _.forEach(g.nodes(), function(v) { swapWidthHeightOne(g.node(v)); });\n  _.forEach(g.edges(), function(e) { swapWidthHeightOne(g.edge(e)); });\n}\n\nfunction swapWidthHeightOne(attrs) {\n  var w = attrs.width;\n  attrs.width = attrs.height;\n  attrs.height = w;\n}\n\nfunction reverseY(g) {\n  _.forEach(g.nodes(), function(v) { reverseYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, reverseYOne);\n    if (_.has(edge, \"y\")) {\n      reverseYOne(edge);\n    }\n  });\n}\n\nfunction reverseYOne(attrs) {\n  attrs.y = -attrs.y;\n}\n\nfunction swapXY(g) {\n  _.forEach(g.nodes(), function(v) { swapXYOne(g.node(v)); });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, swapXYOne);\n    if (_.has(edge, \"x\")) {\n      swapXYOne(edge);\n    }\n  });\n}\n\nfunction swapXYOne(attrs) {\n  var x = attrs.x;\n  attrs.x = attrs.y;\n  attrs.y = x;\n}\n","/*\n * Simple doubly linked list implementation derived from Cormen, et al.,\n * \"Introduction to Algorithms\".\n */\n\nmodule.exports = List;\n\nfunction List() {\n  var sentinel = {};\n  sentinel._next = sentinel._prev = sentinel;\n  this._sentinel = sentinel;\n}\n\nList.prototype.dequeue = function() {\n  var sentinel = this._sentinel;\n  var entry = sentinel._prev;\n  if (entry !== sentinel) {\n    unlink(entry);\n    return entry;\n  }\n};\n\nList.prototype.enqueue = function(entry) {\n  var sentinel = this._sentinel;\n  if (entry._prev && entry._next) {\n    unlink(entry);\n  }\n  entry._next = sentinel._next;\n  sentinel._next._prev = entry;\n  sentinel._next = entry;\n  entry._prev = sentinel;\n};\n\nList.prototype.toString = function() {\n  var strs = [];\n  var sentinel = this._sentinel;\n  var curr = sentinel._prev;\n  while (curr !== sentinel) {\n    strs.push(JSON.stringify(curr, filterOutLinks));\n    curr = curr._prev;\n  }\n  return \"[\" + strs.join(\", \") + \"]\";\n};\n\nfunction unlink(entry) {\n  entry._prev._next = entry._next;\n  entry._next._prev = entry._prev;\n  delete entry._next;\n  delete entry._prev;\n}\n\nfunction filterOutLinks(k, v) {\n  if (k !== \"_next\" && k !== \"_prev\") {\n    return v;\n  }\n}\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  debugOrdering: debugOrdering\n};\n\n/* istanbul ignore next */\nfunction debugOrdering(g) {\n  var layerMatrix = util.buildLayerMatrix(g);\n\n  var h = new Graph({ compound: true, multigraph: true }).setGraph({});\n\n  _.forEach(g.nodes(), function(v) {\n    h.setNode(v, { label: v });\n    h.setParent(v, \"layer\" + g.node(v).rank);\n  });\n\n  _.forEach(g.edges(), function(e) {\n    h.setEdge(e.v, e.w, {}, e.name);\n  });\n\n  _.forEach(layerMatrix, function(layer, i) {\n    var layerV = \"layer\" + i;\n    h.setNode(layerV, { rank: \"same\" });\n    _.reduce(layer, function(u, v) {\n      h.setEdge(u, v, { style: \"invis\" });\n      return v;\n    });\n  });\n\n  return h;\n}\n","/* global window */\n\nvar graphlib;\n\nif (typeof require === \"function\") {\n  try {\n    graphlib = require(\"graphlib\");\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!graphlib) {\n  graphlib = window.graphlib;\n}\n\nmodule.exports = graphlib;\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\nvar List = require(\"./data/list\");\n\n/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n */\nmodule.exports = greedyFAS;\n\nvar DEFAULT_WEIGHT_FN = _.constant(1);\n\nfunction greedyFAS(g, weightFn) {\n  if (g.nodeCount() <= 1) {\n    return [];\n  }\n  var state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  var results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  // Expand multi-edges\n  return _.flatten(_.map(results, function(e) {\n    return g.outEdges(e.v, e.w);\n  }), true);\n}\n\nfunction doGreedyFAS(g, buckets, zeroIdx) {\n  var results = [];\n  var sources = buckets[buckets.length - 1];\n  var sinks = buckets[0];\n\n  var entry;\n  while (g.nodeCount()) {\n    while ((entry = sinks.dequeue()))   { removeNode(g, buckets, zeroIdx, entry); }\n    while ((entry = sources.dequeue())) { removeNode(g, buckets, zeroIdx, entry); }\n    if (g.nodeCount()) {\n      for (var i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(removeNode(g, buckets, zeroIdx, entry, true));\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n}\n\nfunction removeNode(g, buckets, zeroIdx, entry, collectPredecessors) {\n  var results = collectPredecessors ? [] : undefined;\n\n  _.forEach(g.inEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var uEntry = g.node(edge.v);\n\n    if (collectPredecessors) {\n      results.push({ v: edge.v, w: edge.w });\n    }\n\n    uEntry.out -= weight;\n    assignBucket(buckets, zeroIdx, uEntry);\n  });\n\n  _.forEach(g.outEdges(entry.v), function(edge) {\n    var weight = g.edge(edge);\n    var w = edge.w;\n    var wEntry = g.node(w);\n    wEntry[\"in\"] -= weight;\n    assignBucket(buckets, zeroIdx, wEntry);\n  });\n\n  g.removeNode(entry.v);\n\n  return results;\n}\n\nfunction buildState(g, weightFn) {\n  var fasGraph = new Graph();\n  var maxIn = 0;\n  var maxOut = 0;\n\n  _.forEach(g.nodes(), function(v) {\n    fasGraph.setNode(v, { v: v, \"in\": 0, out: 0 });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  _.forEach(g.edges(), function(e) {\n    var prevWeight = fasGraph.edge(e.v, e.w) || 0;\n    var weight = weightFn(e);\n    var edgeWeight = prevWeight + weight;\n    fasGraph.setEdge(e.v, e.w, edgeWeight);\n    maxOut = Math.max(maxOut, fasGraph.node(e.v).out += weight);\n    maxIn  = Math.max(maxIn,  fasGraph.node(e.w)[\"in\"]  += weight);\n  });\n\n  var buckets = _.range(maxOut + maxIn + 3).map(function() { return new List(); });\n  var zeroIdx = maxIn + 1;\n\n  _.forEach(fasGraph.nodes(), function(v) {\n    assignBucket(buckets, zeroIdx, fasGraph.node(v));\n  });\n\n  return { graph: fasGraph, buckets: buckets, zeroIdx: zeroIdx };\n}\n\nfunction assignBucket(buckets, zeroIdx, entry) {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry[\"in\"]) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry[\"in\"] + zeroIdx].enqueue(entry);\n  }\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar acyclic = require(\"./acyclic\");\nvar normalize = require(\"./normalize\");\nvar rank = require(\"./rank\");\nvar normalizeRanks = require(\"./util\").normalizeRanks;\nvar parentDummyChains = require(\"./parent-dummy-chains\");\nvar removeEmptyRanks = require(\"./util\").removeEmptyRanks;\nvar nestingGraph = require(\"./nesting-graph\");\nvar addBorderSegments = require(\"./add-border-segments\");\nvar coordinateSystem = require(\"./coordinate-system\");\nvar order = require(\"./order\");\nvar position = require(\"./position\");\nvar util = require(\"./util\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = layout;\n\nfunction layout(g, opts) {\n  var time = opts && opts.debugTiming ? util.time : util.notime;\n  time(\"layout\", function() {\n    var layoutGraph = \n      time(\"  buildLayoutGraph\", function() { return buildLayoutGraph(g); });\n    time(\"  runLayout\",        function() { runLayout(layoutGraph, time); });\n    time(\"  updateInputGraph\", function() { updateInputGraph(g, layoutGraph); });\n  });\n}\n\nfunction runLayout(g, time) {\n  time(\"    makeSpaceForEdgeLabels\", function() { makeSpaceForEdgeLabels(g); });\n  time(\"    removeSelfEdges\",        function() { removeSelfEdges(g); });\n  time(\"    acyclic\",                function() { acyclic.run(g); });\n  time(\"    nestingGraph.run\",       function() { nestingGraph.run(g); });\n  time(\"    rank\",                   function() { rank(util.asNonCompoundGraph(g)); });\n  time(\"    injectEdgeLabelProxies\", function() { injectEdgeLabelProxies(g); });\n  time(\"    removeEmptyRanks\",       function() { removeEmptyRanks(g); });\n  time(\"    nestingGraph.cleanup\",   function() { nestingGraph.cleanup(g); });\n  time(\"    normalizeRanks\",         function() { normalizeRanks(g); });\n  time(\"    assignRankMinMax\",       function() { assignRankMinMax(g); });\n  time(\"    removeEdgeLabelProxies\", function() { removeEdgeLabelProxies(g); });\n  time(\"    normalize.run\",          function() { normalize.run(g); });\n  time(\"    parentDummyChains\",      function() { parentDummyChains(g); });\n  time(\"    addBorderSegments\",      function() { addBorderSegments(g); });\n  time(\"    order\",                  function() { order(g); });\n  time(\"    insertSelfEdges\",        function() { insertSelfEdges(g); });\n  time(\"    adjustCoordinateSystem\", function() { coordinateSystem.adjust(g); });\n  time(\"    position\",               function() { position(g); });\n  time(\"    positionSelfEdges\",      function() { positionSelfEdges(g); });\n  time(\"    removeBorderNodes\",      function() { removeBorderNodes(g); });\n  time(\"    normalize.undo\",         function() { normalize.undo(g); });\n  time(\"    fixupEdgeLabelCoords\",   function() { fixupEdgeLabelCoords(g); });\n  time(\"    undoCoordinateSystem\",   function() { coordinateSystem.undo(g); });\n  time(\"    translateGraph\",         function() { translateGraph(g); });\n  time(\"    assignNodeIntersects\",   function() { assignNodeIntersects(g); });\n  time(\"    reversePoints\",          function() { reversePointsForReversedEdges(g); });\n  time(\"    acyclic.undo\",           function() { acyclic.undo(g); });\n}\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction updateInputGraph(inputGraph, layoutGraph) {\n  _.forEach(inputGraph.nodes(), function(v) {\n    var inputLabel = inputGraph.node(v);\n    var layoutLabel = layoutGraph.node(v);\n\n    if (inputLabel) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n\n      if (layoutGraph.children(v).length) {\n        inputLabel.width = layoutLabel.width;\n        inputLabel.height = layoutLabel.height;\n      }\n    }\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var inputLabel = inputGraph.edge(e);\n    var layoutLabel = layoutGraph.edge(e);\n\n    inputLabel.points = layoutLabel.points;\n    if (_.has(layoutLabel, \"x\")) {\n      inputLabel.x = layoutLabel.x;\n      inputLabel.y = layoutLabel.y;\n    }\n  });\n\n  inputGraph.graph().width = layoutGraph.graph().width;\n  inputGraph.graph().height = layoutGraph.graph().height;\n}\n\nvar graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\nvar graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\nvar graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\nvar nodeNumAttrs = [\"width\", \"height\"];\nvar nodeDefaults = { width: 0, height: 0 };\nvar edgeNumAttrs = [\"minlen\", \"weight\", \"width\", \"height\", \"labeloffset\"];\nvar edgeDefaults = {\n  minlen: 1, weight: 1, width: 0, height: 0,\n  labeloffset: 10, labelpos: \"r\"\n};\nvar edgeAttrs = [\"labelpos\"];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nfunction buildLayoutGraph(inputGraph) {\n  var g = new Graph({ multigraph: true, compound: true });\n  var graph = canonicalize(inputGraph.graph());\n\n  g.setGraph(_.merge({},\n    graphDefaults,\n    selectNumberAttrs(graph, graphNumAttrs),\n    _.pick(graph, graphAttrs)));\n\n  _.forEach(inputGraph.nodes(), function(v) {\n    var node = canonicalize(inputGraph.node(v));\n    g.setNode(v, _.defaults(selectNumberAttrs(node, nodeNumAttrs), nodeDefaults));\n    g.setParent(v, inputGraph.parent(v));\n  });\n\n  _.forEach(inputGraph.edges(), function(e) {\n    var edge = canonicalize(inputGraph.edge(e));\n    g.setEdge(e, _.merge({},\n      edgeDefaults,\n      selectNumberAttrs(edge, edgeNumAttrs),\n      _.pick(edge, edgeAttrs)));\n  });\n\n  return g;\n}\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nfunction makeSpaceForEdgeLabels(g) {\n  var graph = g.graph();\n  graph.ranksep /= 2;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    edge.minlen *= 2;\n    if (edge.labelpos.toLowerCase() !== \"c\") {\n      if (graph.rankdir === \"TB\" || graph.rankdir === \"BT\") {\n        edge.width += edge.labeloffset;\n      } else {\n        edge.height += edge.labeloffset;\n      }\n    }\n  });\n}\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nfunction injectEdgeLabelProxies(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.width && edge.height) {\n      var v = g.node(e.v);\n      var w = g.node(e.w);\n      var label = { rank: (w.rank - v.rank) / 2 + v.rank, e: e };\n      util.addDummyNode(g, \"edge-proxy\", label, \"_ep\");\n    }\n  });\n}\n\nfunction assignRankMinMax(g) {\n  var maxRank = 0;\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.borderTop) {\n      node.minRank = g.node(node.borderTop).rank;\n      node.maxRank = g.node(node.borderBottom).rank;\n      maxRank = _.max(maxRank, node.maxRank);\n    }\n  });\n  g.graph().maxRank = maxRank;\n}\n\nfunction removeEdgeLabelProxies(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"edge-proxy\") {\n      g.edge(node.e).labelRank = node.rank;\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction translateGraph(g) {\n  var minX = Number.POSITIVE_INFINITY;\n  var maxX = 0;\n  var minY = Number.POSITIVE_INFINITY;\n  var maxY = 0;\n  var graphLabel = g.graph();\n  var marginX = graphLabel.marginx || 0;\n  var marginY = graphLabel.marginy || 0;\n\n  function getExtremes(attrs) {\n    var x = attrs.x;\n    var y = attrs.y;\n    var w = attrs.width;\n    var h = attrs.height;\n    minX = Math.min(minX, x - w / 2);\n    maxX = Math.max(maxX, x + w / 2);\n    minY = Math.min(minY, y - h / 2);\n    maxY = Math.max(maxY, y + h / 2);\n  }\n\n  _.forEach(g.nodes(), function(v) { getExtremes(g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      getExtremes(edge);\n    }\n  });\n\n  minX -= marginX;\n  minY -= marginY;\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    node.x -= minX;\n    node.y -= minY;\n  });\n\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    _.forEach(edge.points, function(p) {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (_.has(edge, \"x\")) { edge.x -= minX; }\n    if (_.has(edge, \"y\")) { edge.y -= minY; }\n  });\n\n  graphLabel.width = maxX - minX + marginX;\n  graphLabel.height = maxY - minY + marginY;\n}\n\nfunction assignNodeIntersects(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    var nodeV = g.node(e.v);\n    var nodeW = g.node(e.w);\n    var p1, p2;\n    if (!edge.points) {\n      edge.points = [];\n      p1 = nodeW;\n      p2 = nodeV;\n    } else {\n      p1 = edge.points[0];\n      p2 = edge.points[edge.points.length - 1];\n    }\n    edge.points.unshift(util.intersectRect(nodeV, p1));\n    edge.points.push(util.intersectRect(nodeW, p2));\n  });\n}\n\nfunction fixupEdgeLabelCoords(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (_.has(edge, \"x\")) {\n      if (edge.labelpos === \"l\" || edge.labelpos === \"r\") {\n        edge.width -= edge.labeloffset;\n      }\n      switch (edge.labelpos) {\n      case \"l\": edge.x -= edge.width / 2 + edge.labeloffset; break;\n      case \"r\": edge.x += edge.width / 2 + edge.labeloffset; break;\n      }\n    }\n  });\n}\n\nfunction reversePointsForReversedEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.reversed) {\n      edge.points.reverse();\n    }\n  });\n}\n\nfunction removeBorderNodes(g) {\n  _.forEach(g.nodes(), function(v) {\n    if (g.children(v).length) {\n      var node = g.node(v);\n      var t = g.node(node.borderTop);\n      var b = g.node(node.borderBottom);\n      var l = g.node(_.last(node.borderLeft));\n      var r = g.node(_.last(node.borderRight));\n\n      node.width = Math.abs(r.x - l.x);\n      node.height = Math.abs(b.y - t.y);\n      node.x = l.x + node.width / 2;\n      node.y = t.y + node.height / 2;\n    }\n  });\n\n  _.forEach(g.nodes(), function(v) {\n    if (g.node(v).dummy === \"border\") {\n      g.removeNode(v);\n    }\n  });\n}\n\nfunction removeSelfEdges(g) {\n  _.forEach(g.edges(), function(e) {\n    if (e.v === e.w) {\n      var node = g.node(e.v);\n      if (!node.selfEdges) {\n        node.selfEdges = [];\n      }\n      node.selfEdges.push({ e: e, label: g.edge(e) });\n      g.removeEdge(e);\n    }\n  });\n}\n\nfunction insertSelfEdges(g) {\n  var layers = util.buildLayerMatrix(g);\n  _.forEach(layers, function(layer) {\n    var orderShift = 0;\n    _.forEach(layer, function(v, i) {\n      var node = g.node(v);\n      node.order = i + orderShift;\n      _.forEach(node.selfEdges, function(selfEdge) {\n        util.addDummyNode(g, \"selfedge\", {\n          width: selfEdge.label.width,\n          height: selfEdge.label.height,\n          rank: node.rank,\n          order: i + (++orderShift),\n          e: selfEdge.e,\n          label: selfEdge.label\n        }, \"_se\");\n      });\n      delete node.selfEdges;\n    });\n  });\n}\n\nfunction positionSelfEdges(g) {\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (node.dummy === \"selfedge\") {\n      var selfNode = g.node(node.e.v);\n      var x = selfNode.x + selfNode.width / 2;\n      var y = selfNode.y;\n      var dx = node.x - x;\n      var dy = selfNode.height / 2;\n      g.setEdge(node.e, node.label);\n      g.removeNode(v);\n      node.label.points = [\n        { x: x + 2 * dx / 3, y: y - dy },\n        { x: x + 5 * dx / 6, y: y - dy },\n        { x: x +     dx    , y: y },\n        { x: x + 5 * dx / 6, y: y + dy },\n        { x: x + 2 * dx / 3, y: y + dy }\n      ];\n      node.label.x = node.x;\n      node.label.y = node.y;\n    }\n  });\n}\n\nfunction selectNumberAttrs(obj, attrs) {\n  return _.mapValues(_.pick(obj, attrs), Number);\n}\n\nfunction canonicalize(attrs) {\n  var newAttrs = {};\n  _.forEach(attrs, function(v, k) {\n    newAttrs[k.toLowerCase()] = v;\n  });\n  return newAttrs;\n}\n","/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      cloneDeep: require(\"lodash/cloneDeep\"),\n      constant: require(\"lodash/constant\"),\n      defaults: require(\"lodash/defaults\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      find: require(\"lodash/find\"),\n      flatten: require(\"lodash/flatten\"),\n      forEach: require(\"lodash/forEach\"),\n      forIn: require(\"lodash/forIn\"),\n      has:  require(\"lodash/has\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      last: require(\"lodash/last\"),\n      map: require(\"lodash/map\"),\n      mapValues: require(\"lodash/mapValues\"),\n      max: require(\"lodash/max\"),\n      merge: require(\"lodash/merge\"),\n      min: require(\"lodash/min\"),\n      minBy: require(\"lodash/minBy\"),\n      now: require(\"lodash/now\"),\n      pick: require(\"lodash/pick\"),\n      range: require(\"lodash/range\"),\n      reduce: require(\"lodash/reduce\"),\n      sortBy: require(\"lodash/sortBy\"),\n      uniqueId: require(\"lodash/uniqueId\"),\n      values: require(\"lodash/values\"),\n      zipObject: require(\"lodash/zipObject\"),\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n","var _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  cleanup: cleanup\n};\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nfunction run(g) {\n  var root = util.addDummyNode(g, \"root\", {}, \"_root\");\n  var depths = treeDepths(g);\n  var height = _.max(_.values(depths)) - 1; // Note: depths is an Object not an array\n  var nodeSep = 2 * height + 1;\n\n  g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  _.forEach(g.edges(), function(e) { g.edge(e).minlen *= nodeSep; });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  var weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  _.forEach(g.children(), function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  g.graph().nodeRankFactor = nodeSep;\n}\n\nfunction dfs(g, root, nodeSep, weight, height, depths, v) {\n  var children = g.children(v);\n  if (!children.length) {\n    if (v !== root) {\n      g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n    }\n    return;\n  }\n\n  var top = util.addBorderNode(g, \"_bt\");\n  var bottom = util.addBorderNode(g, \"_bb\");\n  var label = g.node(v);\n\n  g.setParent(top, v);\n  label.borderTop = top;\n  g.setParent(bottom, v);\n  label.borderBottom = bottom;\n\n  _.forEach(children, function(child) {\n    dfs(g, root, nodeSep, weight, height, depths, child);\n\n    var childNode = g.node(child);\n    var childTop = childNode.borderTop ? childNode.borderTop : child;\n    var childBottom = childNode.borderBottom ? childNode.borderBottom : child;\n    var thisWeight = childNode.borderTop ? weight : 2 * weight;\n    var minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.setEdge(top, childTop, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n\n    g.setEdge(childBottom, bottom, {\n      weight: thisWeight,\n      minlen: minlen,\n      nestingEdge: true\n    });\n  });\n\n  if (!g.parent(v)) {\n    g.setEdge(root, top, { weight: 0, minlen: height + depths[v] });\n  }\n}\n\nfunction treeDepths(g) {\n  var depths = {};\n  function dfs(v, depth) {\n    var children = g.children(v);\n    if (children && children.length) {\n      _.forEach(children, function(child) {\n        dfs(child, depth + 1);\n      });\n    }\n    depths[v] = depth;\n  }\n  _.forEach(g.children(), function(v) { dfs(v, 1); });\n  return depths;\n}\n\nfunction sumWeights(g) {\n  return _.reduce(g.edges(), function(acc, e) {\n    return acc + g.edge(e).weight;\n  }, 0);\n}\n\nfunction cleanup(g) {\n  var graphLabel = g.graph();\n  g.removeNode(graphLabel.nestingRoot);\n  delete graphLabel.nestingRoot;\n  _.forEach(g.edges(), function(e) {\n    var edge = g.edge(e);\n    if (edge.nestingEdge) {\n      g.removeEdge(e);\n    }\n  });\n}\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar util = require(\"./util\");\n\nmodule.exports = {\n  run: run,\n  undo: undo\n};\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\nfunction run(g) {\n  g.graph().dummyChains = [];\n  _.forEach(g.edges(), function(edge) { normalizeEdge(g, edge); });\n}\n\nfunction normalizeEdge(g, e) {\n  var v = e.v;\n  var vRank = g.node(v).rank;\n  var w = e.w;\n  var wRank = g.node(w).rank;\n  var name = e.name;\n  var edgeLabel = g.edge(e);\n  var labelRank = edgeLabel.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e);\n\n  var dummy, attrs, i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    edgeLabel.points = [];\n    attrs = {\n      width: 0, height: 0,\n      edgeLabel: edgeLabel, edgeObj: e,\n      rank: vRank\n    };\n    dummy = util.addDummyNode(g, \"edge\", attrs, \"_d\");\n    if (vRank === labelRank) {\n      attrs.width = edgeLabel.width;\n      attrs.height = edgeLabel.height;\n      attrs.dummy = \"edge-label\";\n      attrs.labelpos = edgeLabel.labelpos;\n    }\n    g.setEdge(v, dummy, { weight: edgeLabel.weight }, name);\n    if (i === 0) {\n      g.graph().dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.setEdge(v, w, { weight: edgeLabel.weight }, name);\n}\n\nfunction undo(g) {\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var origLabel = node.edgeLabel;\n    var w;\n    g.setEdge(node.edgeObj, origLabel);\n    while (node.dummy) {\n      w = g.successors(v)[0];\n      g.removeNode(v);\n      origLabel.points.push({ x: node.x, y: node.y });\n      if (node.dummy === \"edge-label\") {\n        origLabel.x = node.x;\n        origLabel.y = node.y;\n        origLabel.width = node.width;\n        origLabel.height = node.height;\n      }\n      v = w;\n      node = g.node(v);\n    }\n  });\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = addSubgraphConstraints;\n\nfunction addSubgraphConstraints(g, cg, vs) {\n  var prev = {},\n    rootPrev;\n\n  _.forEach(vs, function(v) {\n    var child = g.parent(v),\n      parent,\n      prevChild;\n    while (child) {\n      parent = g.parent(child);\n      if (parent) {\n        prevChild = prev[parent];\n        prev[parent] = child;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child;\n      }\n      if (prevChild && prevChild !== child) {\n        cg.setEdge(prevChild, child);\n        return;\n      }\n      child = parent;\n    }\n  });\n\n  /*\n  function dfs(v) {\n    var children = v ? g.children(v) : g.children();\n    if (children.length) {\n      var min = Number.POSITIVE_INFINITY,\n          subgraphs = [];\n      _.each(children, function(child) {\n        var childMin = dfs(child);\n        if (g.children(child).length) {\n          subgraphs.push({ v: child, order: childMin });\n        }\n        min = Math.min(min, childMin);\n      });\n      _.reduce(_.sortBy(subgraphs, \"order\"), function(prev, curr) {\n        cg.setEdge(prev.v, curr.v);\n        return curr;\n      });\n      return min;\n    }\n    return g.node(v).order;\n  }\n  dfs(undefined);\n  */\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = barycenter;\n\nfunction barycenter(g, movable) {\n  return _.map(movable, function(v) {\n    var inV = g.inEdges(v);\n    if (!inV.length) {\n      return { v: v };\n    } else {\n      var result = _.reduce(inV, function(acc, e) {\n        var edge = g.edge(e),\n          nodeU = g.node(e.v);\n        return {\n          sum: acc.sum + (edge.weight * nodeU.order),\n          weight: acc.weight + edge.weight\n        };\n      }, { sum: 0, weight: 0 });\n\n      return {\n        v: v,\n        barycenter: result.sum / result.weight,\n        weight: result.weight\n      };\n    }\n  });\n}\n\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\n\nmodule.exports = buildLayerGraph;\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nfunction buildLayerGraph(g, rank, relationship) {\n  var root = createRootNode(g),\n    result = new Graph({ compound: true }).setGraph({ root: root })\n      .setDefaultNodeLabel(function(v) { return g.node(v); });\n\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v),\n      parent = g.parent(v);\n\n    if (node.rank === rank || node.minRank <= rank && rank <= node.maxRank) {\n      result.setNode(v);\n      result.setParent(v, parent || root);\n\n      // This assumes we have only short edges!\n      _.forEach(g[relationship](v), function(e) {\n        var u = e.v === v ? e.w : e.v,\n          edge = result.edge(u, v),\n          weight = !_.isUndefined(edge) ? edge.weight : 0;\n        result.setEdge(u, v, { weight: g.edge(e).weight + weight });\n      });\n\n      if (_.has(node, \"minRank\")) {\n        result.setNode(v, {\n          borderLeft: node.borderLeft[rank],\n          borderRight: node.borderRight[rank]\n        });\n      }\n    }\n  });\n\n  return result;\n}\n\nfunction createRootNode(g) {\n  var v;\n  while (g.hasNode((v = _.uniqueId(\"_root\"))));\n  return v;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = crossCount;\n\n/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\nfunction crossCount(g, layering) {\n  var cc = 0;\n  for (var i = 1; i < layering.length; ++i) {\n    cc += twoLayerCrossCount(g, layering[i-1], layering[i]);\n  }\n  return cc;\n}\n\nfunction twoLayerCrossCount(g, northLayer, southLayer) {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  var southPos = _.zipObject(southLayer,\n    _.map(southLayer, function (v, i) { return i; }));\n  var southEntries = _.flatten(_.map(northLayer, function(v) {\n    return _.sortBy(_.map(g.outEdges(v), function(e) {\n      return { pos: southPos[e.w], weight: g.edge(e).weight };\n    }), \"pos\");\n  }), true);\n\n  // Build the accumulator tree\n  var firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  var treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  var tree = _.map(new Array(treeSize), function() { return 0; });\n\n  // Calculate the weighted crossings\n  var cc = 0;\n  _.forEach(southEntries.forEach(function(entry) {\n    var index = entry.pos + firstIndex;\n    tree[index] += entry.weight;\n    var weightSum = 0;\n    while (index > 0) {\n      if (index % 2) {\n        weightSum += tree[index + 1];\n      }\n      index = (index - 1) >> 1;\n      tree[index] += entry.weight;\n    }\n    cc += entry.weight * weightSum;\n  }));\n\n  return cc;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar initOrder = require(\"./init-order\");\nvar crossCount = require(\"./cross-count\");\nvar sortSubgraph = require(\"./sort-subgraph\");\nvar buildLayerGraph = require(\"./build-layer-graph\");\nvar addSubgraphConstraints = require(\"./add-subgraph-constraints\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\nmodule.exports = order;\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nfunction order(g) {\n  var maxRank = util.maxRank(g),\n    downLayerGraphs = buildLayerGraphs(g, _.range(1, maxRank + 1), \"inEdges\"),\n    upLayerGraphs = buildLayerGraphs(g, _.range(maxRank - 1, -1, -1), \"outEdges\");\n\n  var layering = initOrder(g);\n  assignOrder(g, layering);\n\n  var bestCC = Number.POSITIVE_INFINITY,\n    best;\n\n  for (var i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(i % 2 ? downLayerGraphs : upLayerGraphs, i % 4 >= 2);\n\n    layering = util.buildLayerMatrix(g);\n    var cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = _.cloneDeep(layering);\n      bestCC = cc;\n    }\n  }\n\n  assignOrder(g, best);\n}\n\nfunction buildLayerGraphs(g, ranks, relationship) {\n  return _.map(ranks, function(rank) {\n    return buildLayerGraph(g, rank, relationship);\n  });\n}\n\nfunction sweepLayerGraphs(layerGraphs, biasRight) {\n  var cg = new Graph();\n  _.forEach(layerGraphs, function(lg) {\n    var root = lg.graph().root;\n    var sorted = sortSubgraph(lg, root, cg, biasRight);\n    _.forEach(sorted.vs, function(v, i) {\n      lg.node(v).order = i;\n    });\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n}\n\nfunction assignOrder(g, layering) {\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, i) {\n      g.node(v).order = i;\n    });\n  });\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = initOrder;\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nfunction initOrder(g) {\n  var visited = {};\n  var simpleNodes = _.filter(g.nodes(), function(v) {\n    return !g.children(v).length;\n  });\n  var maxRank = _.max(_.map(simpleNodes, function(v) { return g.node(v).rank; }));\n  var layers = _.map(_.range(maxRank + 1), function() { return []; });\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    var node = g.node(v);\n    layers[node.rank].push(v);\n    _.forEach(g.successors(v), dfs);\n  }\n\n  var orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v).rank; });\n  _.forEach(orderedVs, dfs);\n\n  return layers;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = resolveConflicts;\n\n/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\nfunction resolveConflicts(entries, cg) {\n  var mappedEntries = {};\n  _.forEach(entries, function(entry, i) {\n    var tmp = mappedEntries[entry.v] = {\n      indegree: 0,\n      \"in\": [],\n      out: [],\n      vs: [entry.v],\n      i: i\n    };\n    if (!_.isUndefined(entry.barycenter)) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  _.forEach(cg.edges(), function(e) {\n    var entryV = mappedEntries[e.v];\n    var entryW = mappedEntries[e.w];\n    if (!_.isUndefined(entryV) && !_.isUndefined(entryW)) {\n      entryW.indegree++;\n      entryV.out.push(mappedEntries[e.w]);\n    }\n  });\n\n  var sourceSet = _.filter(mappedEntries, function(entry) {\n    return !entry.indegree;\n  });\n\n  return doResolveConflicts(sourceSet);\n}\n\nfunction doResolveConflicts(sourceSet) {\n  var entries = [];\n\n  function handleIn(vEntry) {\n    return function(uEntry) {\n      if (uEntry.merged) {\n        return;\n      }\n      if (_.isUndefined(uEntry.barycenter) ||\n          _.isUndefined(vEntry.barycenter) ||\n          uEntry.barycenter >= vEntry.barycenter) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  }\n\n  function handleOut(vEntry) {\n    return function(wEntry) {\n      wEntry[\"in\"].push(vEntry);\n      if (--wEntry.indegree === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  }\n\n  while (sourceSet.length) {\n    var entry = sourceSet.pop();\n    entries.push(entry);\n    _.forEach(entry[\"in\"].reverse(), handleIn(entry));\n    _.forEach(entry.out, handleOut(entry));\n  }\n\n  return _.map(_.filter(entries, function(entry) { return !entry.merged; }),\n    function(entry) {\n      return _.pick(entry, [\"vs\", \"i\", \"barycenter\", \"weight\"]);\n    });\n\n}\n\nfunction mergeEntries(target, source) {\n  var sum = 0;\n  var weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n}\n","var _ = require(\"../lodash\");\nvar barycenter = require(\"./barycenter\");\nvar resolveConflicts = require(\"./resolve-conflicts\");\nvar sort = require(\"./sort\");\n\nmodule.exports = sortSubgraph;\n\nfunction sortSubgraph(g, v, cg, biasRight) {\n  var movable = g.children(v);\n  var node = g.node(v);\n  var bl = node ? node.borderLeft : undefined;\n  var br = node ? node.borderRight: undefined;\n  var subgraphs = {};\n\n  if (bl) {\n    movable = _.filter(movable, function(w) {\n      return w !== bl && w !== br;\n    });\n  }\n\n  var barycenters = barycenter(g, movable);\n  _.forEach(barycenters, function(entry) {\n    if (g.children(entry.v).length) {\n      var subgraphResult = sortSubgraph(g, entry.v, cg, biasRight);\n      subgraphs[entry.v] = subgraphResult;\n      if (_.has(subgraphResult, \"barycenter\")) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  var entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  var result = sort(entries, biasRight);\n\n  if (bl) {\n    result.vs = _.flatten([bl, result.vs, br], true);\n    if (g.predecessors(bl).length) {\n      var blPred = g.node(g.predecessors(bl)[0]),\n        brPred = g.node(g.predecessors(br)[0]);\n      if (!_.has(result, \"barycenter\")) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter = (result.barycenter * result.weight +\n                           blPred.order + brPred.order) / (result.weight + 2);\n      result.weight += 2;\n    }\n  }\n\n  return result;\n}\n\nfunction expandSubgraphs(entries, subgraphs) {\n  _.forEach(entries, function(entry) {\n    entry.vs = _.flatten(entry.vs.map(function(v) {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs;\n      }\n      return v;\n    }), true);\n  });\n}\n\nfunction mergeBarycenters(target, other) {\n  if (!_.isUndefined(target.barycenter)) {\n    target.barycenter = (target.barycenter * target.weight +\n                         other.barycenter * other.weight) /\n                        (target.weight + other.weight);\n    target.weight += other.weight;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n}\n","var _ = require(\"../lodash\");\nvar util = require(\"../util\");\n\nmodule.exports = sort;\n\nfunction sort(entries, biasRight) {\n  var parts = util.partition(entries, function(entry) {\n    return _.has(entry, \"barycenter\");\n  });\n  var sortable = parts.lhs,\n    unsortable = _.sortBy(parts.rhs, function(entry) { return -entry.i; }),\n    vs = [],\n    sum = 0,\n    weight = 0,\n    vsIndex = 0;\n\n  sortable.sort(compareWithBias(!!biasRight));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  _.forEach(sortable, function (entry) {\n    vsIndex += entry.vs.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter * entry.weight;\n    weight += entry.weight;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  var result = { vs: _.flatten(vs, true) };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n}\n\nfunction consumeUnsortable(vs, unsortable, index) {\n  var last;\n  while (unsortable.length && (last = _.last(unsortable)).i <= index) {\n    unsortable.pop();\n    vs.push(last.vs);\n    index++;\n  }\n  return index;\n}\n\nfunction compareWithBias(bias) {\n  return function(entryV, entryW) {\n    if (entryV.barycenter < entryW.barycenter) {\n      return -1;\n    } else if (entryV.barycenter > entryW.barycenter) {\n      return 1;\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n}\n","var _ = require(\"./lodash\");\n\nmodule.exports = parentDummyChains;\n\nfunction parentDummyChains(g) {\n  var postorderNums = postorder(g);\n\n  _.forEach(g.graph().dummyChains, function(v) {\n    var node = g.node(v);\n    var edgeObj = node.edgeObj;\n    var pathData = findPath(g, postorderNums, edgeObj.v, edgeObj.w);\n    var path = pathData.path;\n    var lca = pathData.lca;\n    var pathIdx = 0;\n    var pathV = path[pathIdx];\n    var ascending = true;\n\n    while (v !== edgeObj.w) {\n      node = g.node(v);\n\n      if (ascending) {\n        while ((pathV = path[pathIdx]) !== lca &&\n               g.node(pathV).maxRank < node.rank) {\n          pathIdx++;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (pathIdx < path.length - 1 &&\n               g.node(pathV = path[pathIdx + 1]).minRank <= node.rank) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx];\n      }\n\n      g.setParent(v, pathV);\n      v = g.successors(v)[0];\n    }\n  });\n}\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nfunction findPath(g, postorderNums, v, w) {\n  var vPath = [];\n  var wPath = [];\n  var low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  var lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  var parent;\n  var lca;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.parent(parent);\n    vPath.push(parent);\n  } while (parent &&\n           (postorderNums[parent].low > low || lim > postorderNums[parent].lim));\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while ((parent = g.parent(parent)) !== lca) {\n    wPath.push(parent);\n  }\n\n  return { path: vPath.concat(wPath.reverse()), lca: lca };\n}\n\nfunction postorder(g) {\n  var result = {};\n  var lim = 0;\n\n  function dfs(v) {\n    var low = lim;\n    _.forEach(g.children(v), dfs);\n    result[v] = { low: low, lim: lim++ };\n  }\n  _.forEach(g.children(), dfs);\n\n  return result;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar util = require(\"../util\");\n\n/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\n\nmodule.exports = {\n  positionX: positionX,\n  findType1Conflicts: findType1Conflicts,\n  findType2Conflicts: findType2Conflicts,\n  addConflict: addConflict,\n  hasConflict: hasConflict,\n  verticalAlignment: verticalAlignment,\n  horizontalCompaction: horizontalCompaction,\n  alignCoordinates: alignCoordinates,\n  findSmallestWidthAlignment: findSmallestWidthAlignment,\n  balance: balance\n};\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\nfunction findType1Conflicts(g, layering) {\n  var conflicts = {};\n\n  function visitLayer(prevLayer, layer) {\n    var\n      // last visited node in the previous layer that is incident on an inner\n      // segment.\n      k0 = 0,\n      // Tracks the last node in this layer scanned for crossings with a type-1\n      // segment.\n      scanPos = 0,\n      prevLayerLength = prevLayer.length,\n      lastNode = _.last(layer);\n\n    _.forEach(layer, function(v, i) {\n      var w = findOtherInnerSegmentNode(g, v),\n        k1 = w ? g.node(w).order : prevLayerLength;\n\n      if (w || v === lastNode) {\n        _.forEach(layer.slice(scanPos, i +1), function(scanNode) {\n          _.forEach(g.predecessors(scanNode), function(u) {\n            var uLabel = g.node(u),\n              uPos = uLabel.order;\n            if ((uPos < k0 || k1 < uPos) &&\n                !(uLabel.dummy && g.node(scanNode).dummy)) {\n              addConflict(conflicts, u, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findType2Conflicts(g, layering) {\n  var conflicts = {};\n\n  function scan(south, southPos, southEnd, prevNorthBorder, nextNorthBorder) {\n    var v;\n    _.forEach(_.range(southPos, southEnd), function(i) {\n      v = south[i];\n      if (g.node(v).dummy) {\n        _.forEach(g.predecessors(v), function(u) {\n          var uNode = g.node(u);\n          if (uNode.dummy &&\n              (uNode.order < prevNorthBorder || uNode.order > nextNorthBorder)) {\n            addConflict(conflicts, u, v);\n          }\n        });\n      }\n    });\n  }\n\n\n  function visitLayer(north, south) {\n    var prevNorthPos = -1,\n      nextNorthPos,\n      southPos = 0;\n\n    _.forEach(south, function(v, southLookahead) {\n      if (g.node(v).dummy === \"border\") {\n        var predecessors = g.predecessors(v);\n        if (predecessors.length) {\n          nextNorthPos = g.node(predecessors[0]).order;\n          scan(south, southPos, southLookahead, prevNorthPos, nextNorthPos);\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scan(south, southPos, south.length, nextNorthPos, north.length);\n    });\n\n    return south;\n  }\n\n  _.reduce(layering, visitLayer);\n  return conflicts;\n}\n\nfunction findOtherInnerSegmentNode(g, v) {\n  if (g.node(v).dummy) {\n    return _.find(g.predecessors(v), function(u) {\n      return g.node(u).dummy;\n    });\n  }\n}\n\nfunction addConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n\n  var conflictsV = conflicts[v];\n  if (!conflictsV) {\n    conflicts[v] = conflictsV = {};\n  }\n  conflictsV[w] = true;\n}\n\nfunction hasConflict(conflicts, v, w) {\n  if (v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return _.has(conflicts[v], w);\n}\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nfunction verticalAlignment(g, layering, conflicts, neighborFn) {\n  var root = {},\n    align = {},\n    pos = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  _.forEach(layering, function(layer) {\n    _.forEach(layer, function(v, order) {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  _.forEach(layering, function(layer) {\n    var prevIdx = -1;\n    _.forEach(layer, function(v) {\n      var ws = neighborFn(v);\n      if (ws.length) {\n        ws = _.sortBy(ws, function(w) { return pos[w]; });\n        var mp = (ws.length - 1) / 2;\n        for (var i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          var w = ws[i];\n          if (align[v] === v &&\n              prevIdx < pos[w] &&\n              !hasConflict(conflicts, v, w)) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root: root, align: align };\n}\n\nfunction horizontalCompaction(g, layering, root, align, reverseSep) {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  var xs = {},\n    blockG = buildBlockGraph(g, layering, root, reverseSep),\n    borderType = reverseSep ? \"borderLeft\" : \"borderRight\";\n\n  function iterate(setXsFunc, nextNodesFunc) {\n    var stack = blockG.nodes();\n    var elem = stack.pop();\n    var visited = {};\n    while (elem) {\n      if (visited[elem]) {\n        setXsFunc(elem);\n      } else {\n        visited[elem] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem));\n      }\n\n      elem = stack.pop();\n    }\n  }\n\n  // First pass, assign smallest coordinates\n  function pass1(elem) {\n    xs[elem] = blockG.inEdges(elem).reduce(function(acc, e) {\n      return Math.max(acc, xs[e.v] + blockG.edge(e));\n    }, 0);\n  }\n\n  // Second pass, assign greatest coordinates\n  function pass2(elem) {\n    var min = blockG.outEdges(elem).reduce(function(acc, e) {\n      return Math.min(acc, xs[e.w] - blockG.edge(e));\n    }, Number.POSITIVE_INFINITY);\n\n    var node = g.node(elem);\n    if (min !== Number.POSITIVE_INFINITY && node.borderType !== borderType) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  }\n\n  iterate(pass1, blockG.predecessors.bind(blockG));\n  iterate(pass2, blockG.successors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  _.forEach(align, function(v) {\n    xs[v] = xs[root[v]];\n  });\n\n  return xs;\n}\n\n\nfunction buildBlockGraph(g, layering, root, reverseSep) {\n  var blockGraph = new Graph(),\n    graphLabel = g.graph(),\n    sepFn = sep(graphLabel.nodesep, graphLabel.edgesep, reverseSep);\n\n  _.forEach(layering, function(layer) {\n    var u;\n    _.forEach(layer, function(v) {\n      var vRoot = root[v];\n      blockGraph.setNode(vRoot);\n      if (u) {\n        var uRoot = root[u],\n          prevMax = blockGraph.edge(uRoot, vRoot);\n        blockGraph.setEdge(uRoot, vRoot, Math.max(sepFn(g, v, u), prevMax || 0));\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n}\n\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nfunction findSmallestWidthAlignment(g, xss) {\n  return _.minBy(_.values(xss), function (xs) {\n    var max = Number.NEGATIVE_INFINITY;\n    var min = Number.POSITIVE_INFINITY;\n\n    _.forIn(xs, function (x, v) {\n      var halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    return max - min;\n  });\n}\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nfunction alignCoordinates(xss, alignTo) {\n  var alignToVals = _.values(alignTo),\n    alignToMin = _.min(alignToVals),\n    alignToMax = _.max(alignToVals);\n\n  _.forEach([\"u\", \"d\"], function(vert) {\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      var alignment = vert + horiz,\n        xs = xss[alignment],\n        delta;\n      if (xs === alignTo) return;\n\n      var xsVals = _.values(xs);\n      delta = horiz === \"l\" ? alignToMin - _.min(xsVals) : alignToMax - _.max(xsVals);\n\n      if (delta) {\n        xss[alignment] = _.mapValues(xs, function(x) { return x + delta; });\n      }\n    });\n  });\n}\n\nfunction balance(xss, align) {\n  return _.mapValues(xss.ul, function(ignore, v) {\n    if (align) {\n      return xss[align.toLowerCase()][v];\n    } else {\n      var xs = _.sortBy(_.map(xss, v));\n      return (xs[1] + xs[2]) / 2;\n    }\n  });\n}\n\nfunction positionX(g) {\n  var layering = util.buildLayerMatrix(g);\n  var conflicts = _.merge(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering));\n\n  var xss = {};\n  var adjustedLayering;\n  _.forEach([\"u\", \"d\"], function(vert) {\n    adjustedLayering = vert === \"u\" ? layering : _.values(layering).reverse();\n    _.forEach([\"l\", \"r\"], function(horiz) {\n      if (horiz === \"r\") {\n        adjustedLayering = _.map(adjustedLayering, function(inner) {\n          return _.values(inner).reverse();\n        });\n      }\n\n      var neighborFn = (vert === \"u\" ? g.predecessors : g.successors).bind(g);\n      var align = verticalAlignment(g, adjustedLayering, conflicts, neighborFn);\n      var xs = horizontalCompaction(g, adjustedLayering,\n        align.root, align.align, horiz === \"r\");\n      if (horiz === \"r\") {\n        xs = _.mapValues(xs, function(x) { return -x; });\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  var smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, g.graph().align);\n}\n\nfunction sep(nodeSep, edgeSep, reverseSep) {\n  return function(g, v, w) {\n    var vLabel = g.node(v);\n    var wLabel = g.node(w);\n    var sum = 0;\n    var delta;\n\n    sum += vLabel.width / 2;\n    if (_.has(vLabel, \"labelpos\")) {\n      switch (vLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = -vLabel.width / 2; break;\n      case \"r\": delta = vLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.width / 2;\n    if (_.has(wLabel, \"labelpos\")) {\n      switch (wLabel.labelpos.toLowerCase()) {\n      case \"l\": delta = wLabel.width / 2; break;\n      case \"r\": delta = -wLabel.width / 2; break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n}\n\nfunction width(g, v) {\n  return g.node(v).width;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar util = require(\"../util\");\nvar positionX = require(\"./bk\").positionX;\n\nmodule.exports = position;\n\nfunction position(g) {\n  g = util.asNonCompoundGraph(g);\n\n  positionY(g);\n  _.forEach(positionX(g), function(x, v) {\n    g.node(v).x = x;\n  });\n}\n\nfunction positionY(g) {\n  var layering = util.buildLayerMatrix(g);\n  var rankSep = g.graph().ranksep;\n  var prevY = 0;\n  _.forEach(layering, function(layer) {\n    var maxHeight = _.max(_.map(layer, function(v) { return g.node(v).height; }));\n    _.forEach(layer, function(v) {\n      g.node(v).y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + rankSep;\n  });\n}\n\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar Graph = require(\"../graphlib\").Graph;\nvar slack = require(\"./util\").slack;\n\nmodule.exports = feasibleTree;\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nfunction feasibleTree(g) {\n  var t = new Graph({ directed: false });\n\n  // Choose arbitrary node from which to start our tree\n  var start = g.nodes()[0];\n  var size = g.nodeCount();\n  t.setNode(start, {});\n\n  var edge, delta;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.v) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n}\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nfunction tightTree(t, g) {\n  function dfs(v) {\n    _.forEach(g.nodeEdges(v), function(e) {\n      var edgeV = e.v,\n        w = (v === edgeV) ? e.w : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.setNode(w, {});\n        t.setEdge(v, w, {});\n        dfs(w);\n      }\n    });\n  }\n\n  _.forEach(t.nodes(), dfs);\n  return t.nodeCount();\n}\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nfunction findMinSlackEdge(t, g) {\n  return _.minBy(g.edges(), function(e) {\n    if (t.hasNode(e.v) !== t.hasNode(e.w)) {\n      return slack(g, e);\n    }\n  });\n}\n\nfunction shiftRanks(t, g, delta) {\n  _.forEach(t.nodes(), function(v) {\n    g.node(v).rank += delta;\n  });\n}\n","\"use strict\";\n\nvar rankUtil = require(\"./util\");\nvar longestPath = rankUtil.longestPath;\nvar feasibleTree = require(\"./feasible-tree\");\nvar networkSimplex = require(\"./network-simplex\");\n\nmodule.exports = rank;\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nfunction rank(g) {\n  switch(g.graph().ranker) {\n  case \"network-simplex\": networkSimplexRanker(g); break;\n  case \"tight-tree\": tightTreeRanker(g); break;\n  case \"longest-path\": longestPathRanker(g); break;\n  default: networkSimplexRanker(g);\n  }\n}\n\n// A fast and simple ranker, but results are far from optimal.\nvar longestPathRanker = longestPath;\n\nfunction tightTreeRanker(g) {\n  longestPath(g);\n  feasibleTree(g);\n}\n\nfunction networkSimplexRanker(g) {\n  networkSimplex(g);\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\nvar feasibleTree = require(\"./feasible-tree\");\nvar slack = require(\"./util\").slack;\nvar initRank = require(\"./util\").longestPath;\nvar preorder = require(\"../graphlib\").alg.preorder;\nvar postorder = require(\"../graphlib\").alg.postorder;\nvar simplify = require(\"../util\").simplify;\n\nmodule.exports = networkSimplex;\n\n// Expose some internals for testing purposes\nnetworkSimplex.initLowLimValues = initLowLimValues;\nnetworkSimplex.initCutValues = initCutValues;\nnetworkSimplex.calcCutValue = calcCutValue;\nnetworkSimplex.leaveEdge = leaveEdge;\nnetworkSimplex.enterEdge = enterEdge;\nnetworkSimplex.exchangeEdges = exchangeEdges;\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nfunction networkSimplex(g) {\n  g = simplify(g);\n  initRank(g);\n  var t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  var e, f;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n}\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nfunction initCutValues(t, g) {\n  var vs = postorder(t, t.nodes());\n  vs = vs.slice(0, vs.length - 1);\n  _.forEach(vs, function(v) {\n    assignCutValue(t, g, v);\n  });\n}\n\nfunction assignCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  t.edge(child, parent).cutvalue = calcCutValue(t, g, child);\n}\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nfunction calcCutValue(t, g, child) {\n  var childLab = t.node(child);\n  var parent = childLab.parent;\n  // True if the child is on the tail end of the edge in the directed graph\n  var childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n  var graphEdge = g.edge(child, parent);\n  // The accumulated cut value for the edge between this node and its parent\n  var cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g.edge(parent, child);\n  }\n\n  cutValue = graphEdge.weight;\n\n  _.forEach(g.nodeEdges(child), function(e) {\n    var isOutEdge = e.v === child,\n      other = isOutEdge ? e.w : e.v;\n\n    if (other !== parent) {\n      var pointsToHead = isOutEdge === childIsTail,\n        otherWeight = g.edge(e).weight;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        var otherCutValue = t.edge(child, other).cutvalue;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n}\n\nfunction initLowLimValues(tree, root) {\n  if (arguments.length < 2) {\n    root = tree.nodes()[0];\n  }\n  dfsAssignLowLim(tree, {}, 1, root);\n}\n\nfunction dfsAssignLowLim(tree, visited, nextLim, v, parent) {\n  var low = nextLim;\n  var label = tree.node(v);\n\n  visited[v] = true;\n  _.forEach(tree.neighbors(v), function(w) {\n    if (!_.has(visited, w)) {\n      nextLim = dfsAssignLowLim(tree, visited, nextLim, w, v);\n    }\n  });\n\n  label.low = low;\n  label.lim = nextLim++;\n  if (parent) {\n    label.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.parent;\n  }\n\n  return nextLim;\n}\n\nfunction leaveEdge(tree) {\n  return _.find(tree.edges(), function(e) {\n    return tree.edge(e).cutvalue < 0;\n  });\n}\n\nfunction enterEdge(t, g, edge) {\n  var v = edge.v;\n  var w = edge.w;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.hasEdge(v, w)) {\n    v = edge.w;\n    w = edge.v;\n  }\n\n  var vLabel = t.node(v);\n  var wLabel = t.node(w);\n  var tailLabel = vLabel;\n  var flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.lim > wLabel.lim) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  var candidates = _.filter(g.edges(), function(edge) {\n    return flip === isDescendant(t, t.node(edge.v), tailLabel) &&\n           flip !== isDescendant(t, t.node(edge.w), tailLabel);\n  });\n\n  return _.minBy(candidates, function(edge) { return slack(g, edge); });\n}\n\nfunction exchangeEdges(t, g, e, f) {\n  var v = e.v;\n  var w = e.w;\n  t.removeEdge(v, w);\n  t.setEdge(f.v, f.w, {});\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n}\n\nfunction updateRanks(t, g) {\n  var root = _.find(t.nodes(), function(v) { return !g.node(v).parent; });\n  var vs = preorder(t, root);\n  vs = vs.slice(1);\n  _.forEach(vs, function(v) {\n    var parent = t.node(v).parent,\n      edge = g.edge(v, parent),\n      flipped = false;\n\n    if (!edge) {\n      edge = g.edge(parent, v);\n      flipped = true;\n    }\n\n    g.node(v).rank = g.node(parent).rank + (flipped ? edge.minlen : -edge.minlen);\n  });\n}\n\n/*\n * Returns true if the edge is in the tree.\n */\nfunction isTreeEdge(tree, u, v) {\n  return tree.hasEdge(u, v);\n}\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nfunction isDescendant(tree, vLabel, rootLabel) {\n  return rootLabel.low <= vLabel.lim && vLabel.lim <= rootLabel.lim;\n}\n","\"use strict\";\n\nvar _ = require(\"../lodash\");\n\nmodule.exports = {\n  longestPath: longestPath,\n  slack: slack\n};\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nfunction longestPath(g) {\n  var visited = {};\n\n  function dfs(v) {\n    var label = g.node(v);\n    if (_.has(visited, v)) {\n      return label.rank;\n    }\n    visited[v] = true;\n\n    var rank = _.min(_.map(g.outEdges(v), function(e) {\n      return dfs(e.w) - g.edge(e).minlen;\n    }));\n\n    if (rank === Number.POSITIVE_INFINITY || // return value of _.map([]) for Lodash 3\n        rank === undefined || // return value of _.map([]) for Lodash 4\n        rank === null) { // return value of _.map([null])\n      rank = 0;\n    }\n\n    return (label.rank = rank);\n  }\n\n  _.forEach(g.sources(), dfs);\n}\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nfunction slack(g, e) {\n  return g.node(e.w).rank - g.node(e.v).rank - g.edge(e).minlen;\n}\n","/* eslint \"no-console\": off */\n\n\"use strict\";\n\nvar _ = require(\"./lodash\");\nvar Graph = require(\"./graphlib\").Graph;\n\nmodule.exports = {\n  addDummyNode: addDummyNode,\n  simplify: simplify,\n  asNonCompoundGraph: asNonCompoundGraph,\n  successorWeights: successorWeights,\n  predecessorWeights: predecessorWeights,\n  intersectRect: intersectRect,\n  buildLayerMatrix: buildLayerMatrix,\n  normalizeRanks: normalizeRanks,\n  removeEmptyRanks: removeEmptyRanks,\n  addBorderNode: addBorderNode,\n  maxRank: maxRank,\n  partition: partition,\n  time: time,\n  notime: notime\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nfunction addDummyNode(g, type, attrs, name) {\n  var v;\n  do {\n    v = _.uniqueId(name);\n  } while (g.hasNode(v));\n\n  attrs.dummy = type;\n  g.setNode(v, attrs);\n  return v;\n}\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nfunction simplify(g) {\n  var simplified = new Graph().setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) { simplified.setNode(v, g.node(v)); });\n  _.forEach(g.edges(), function(e) {\n    var simpleLabel = simplified.edge(e.v, e.w) || { weight: 0, minlen: 1 };\n    var label = g.edge(e);\n    simplified.setEdge(e.v, e.w, {\n      weight: simpleLabel.weight + label.weight,\n      minlen: Math.max(simpleLabel.minlen, label.minlen)\n    });\n  });\n  return simplified;\n}\n\nfunction asNonCompoundGraph(g) {\n  var simplified = new Graph({ multigraph: g.isMultigraph() }).setGraph(g.graph());\n  _.forEach(g.nodes(), function(v) {\n    if (!g.children(v).length) {\n      simplified.setNode(v, g.node(v));\n    }\n  });\n  _.forEach(g.edges(), function(e) {\n    simplified.setEdge(e, g.edge(e));\n  });\n  return simplified;\n}\n\nfunction successorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var sucs = {};\n    _.forEach(g.outEdges(v), function(e) {\n      sucs[e.w] = (sucs[e.w] || 0) + g.edge(e).weight;\n    });\n    return sucs;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\nfunction predecessorWeights(g) {\n  var weightMap = _.map(g.nodes(), function(v) {\n    var preds = {};\n    _.forEach(g.inEdges(v), function(e) {\n      preds[e.v] = (preds[e.v] || 0) + g.edge(e).weight;\n    });\n    return preds;\n  });\n  return _.zipObject(g.nodes(), weightMap);\n}\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nfunction intersectRect(rect, point) {\n  var x = rect.x;\n  var y = rect.y;\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  var dx = point.x - x;\n  var dy = point.y - y;\n  var w = rect.width / 2;\n  var h = rect.height / 2;\n\n  if (!dx && !dy) {\n    throw new Error(\"Not possible to find intersection inside of the rectangle\");\n  }\n\n  var sx, sy;\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = h * dx / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = w * dy / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n}\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * function will produce a matrix with the ids of each node.\n */\nfunction buildLayerMatrix(g) {\n  var layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    var rank = node.rank;\n    if (!_.isUndefined(rank)) {\n      layering[rank][node.order] = v;\n    }\n  });\n  return layering;\n}\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nfunction normalizeRanks(g) {\n  var min = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n  _.forEach(g.nodes(), function(v) {\n    var node = g.node(v);\n    if (_.has(node, \"rank\")) {\n      node.rank -= min;\n    }\n  });\n}\n\nfunction removeEmptyRanks(g) {\n  // Ranks may not start at 0, so we need to offset them\n  var offset = _.min(_.map(g.nodes(), function(v) { return g.node(v).rank; }));\n\n  var layers = [];\n  _.forEach(g.nodes(), function(v) {\n    var rank = g.node(v).rank - offset;\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v);\n  });\n\n  var delta = 0;\n  var nodeRankFactor = g.graph().nodeRankFactor;\n  _.forEach(layers, function(vs, i) {\n    if (_.isUndefined(vs) && i % nodeRankFactor !== 0) {\n      --delta;\n    } else if (delta) {\n      _.forEach(vs, function(v) { g.node(v).rank += delta; });\n    }\n  });\n}\n\nfunction addBorderNode(g, prefix, rank, order) {\n  var node = {\n    width: 0,\n    height: 0\n  };\n  if (arguments.length >= 4) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, \"border\", node, prefix);\n}\n\nfunction maxRank(g) {\n  return _.max(_.map(g.nodes(), function(v) {\n    var rank = g.node(v).rank;\n    if (!_.isUndefined(rank)) {\n      return rank;\n    }\n  }));\n}\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * function returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nfunction partition(collection, fn) {\n  var result = { lhs: [], rhs: [] };\n  _.forEach(collection, function(value) {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n}\n\n/*\n * Returns a new function that wraps `fn` with a timer. The wrapper logs the\n * time it takes to execute the function.\n */\nfunction time(name, fn) {\n  var start = _.now();\n  try {\n    return fn();\n  } finally {\n    console.log(name + \" time: \" + (_.now() - start) + \"ms\");\n  }\n}\n\nfunction notime(name, fn) {\n  return fn();\n}\n","module.exports = \"0.8.5\";\n","/**\n * Copyright (c) 2014, Chris Pettitt\n * All rights reserved.\n *\n * Redistribution and use in source and binary forms, with or without\n * modification, are permitted provided that the following conditions are met:\n *\n * 1. Redistributions of source code must retain the above copyright notice, this\n * list of conditions and the following disclaimer.\n *\n * 2. Redistributions in binary form must reproduce the above copyright notice,\n * this list of conditions and the following disclaimer in the documentation\n * and/or other materials provided with the distribution.\n *\n * 3. Neither the name of the copyright holder nor the names of its contributors\n * may be used to endorse or promote products derived from this software without\n * specific prior written permission.\n *\n * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS \"AS IS\" AND\n * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED\n * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE\n * DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE\n * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL\n * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR\n * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER\n * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY,\n * OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE\n * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.\n */\n\nvar lib = require(\"./lib\");\n\nmodule.exports = {\n  Graph: lib.Graph,\n  json: require(\"./lib/json\"),\n  alg: require(\"./lib/alg\"),\n  version: lib.version\n};\n","var _ = require(\"../lodash\");\n\nmodule.exports = components;\n\nfunction components(g) {\n  var visited = {};\n  var cmpts = [];\n  var cmpt;\n\n  function dfs(v) {\n    if (_.has(visited, v)) return;\n    visited[v] = true;\n    cmpt.push(v);\n    _.each(g.successors(v), dfs);\n    _.each(g.predecessors(v), dfs);\n  }\n\n  _.each(g.nodes(), function(v) {\n    cmpt = [];\n    dfs(v);\n    if (cmpt.length) {\n      cmpts.push(cmpt);\n    }\n  });\n\n  return cmpts;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = dfs;\n\n/*\n * A helper that preforms a pre- or post-order traversal on the input graph\n * and returns the nodes in the order they were visited. If the graph is\n * undirected then this algorithm will navigate using neighbors. If the graph\n * is directed then this algorithm will navigate using successors.\n *\n * Order must be one of \"pre\" or \"post\".\n */\nfunction dfs(g, vs, order) {\n  if (!_.isArray(vs)) {\n    vs = [vs];\n  }\n\n  var navigation = (g.isDirected() ? g.successors : g.neighbors).bind(g);\n\n  var acc = [];\n  var visited = {};\n  _.each(vs, function(v) {\n    if (!g.hasNode(v)) {\n      throw new Error(\"Graph does not have node: \" + v);\n    }\n\n    doDfs(g, v, order === \"post\", visited, navigation, acc);\n  });\n  return acc;\n}\n\nfunction doDfs(g, v, postorder, visited, navigation, acc) {\n  if (!_.has(visited, v)) {\n    visited[v] = true;\n\n    if (!postorder) { acc.push(v); }\n    _.each(navigation(v), function(w) {\n      doDfs(g, w, postorder, visited, navigation, acc);\n    });\n    if (postorder) { acc.push(v); }\n  }\n}\n","var dijkstra = require(\"./dijkstra\");\nvar _ = require(\"../lodash\");\n\nmodule.exports = dijkstraAll;\n\nfunction dijkstraAll(g, weightFunc, edgeFunc) {\n  return _.transform(g.nodes(), function(acc, v) {\n    acc[v] = dijkstra(g, v, weightFunc, edgeFunc);\n  }, {});\n}\n","var _ = require(\"../lodash\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = dijkstra;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction dijkstra(g, source, weightFn, edgeFn) {\n  return runDijkstra(g, String(source),\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runDijkstra(g, source, weightFn, edgeFn) {\n  var results = {};\n  var pq = new PriorityQueue();\n  var v, vEntry;\n\n  var updateNeighbors = function(edge) {\n    var w = edge.v !== v ? edge.v : edge.w;\n    var wEntry = results[w];\n    var weight = weightFn(edge);\n    var distance = vEntry.distance + weight;\n\n    if (weight < 0) {\n      throw new Error(\"dijkstra does not allow negative edge weights. \" +\n                      \"Bad edge: \" + edge + \" Weight: \" + weight);\n    }\n\n    if (distance < wEntry.distance) {\n      wEntry.distance = distance;\n      wEntry.predecessor = v;\n      pq.decrease(w, distance);\n    }\n  };\n\n  g.nodes().forEach(function(v) {\n    var distance = v === source ? 0 : Number.POSITIVE_INFINITY;\n    results[v] = { distance: distance };\n    pq.add(v, distance);\n  });\n\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    vEntry = results[v];\n    if (vEntry.distance === Number.POSITIVE_INFINITY) {\n      break;\n    }\n\n    edgeFn(v).forEach(updateNeighbors);\n  }\n\n  return results;\n}\n","var _ = require(\"../lodash\");\nvar tarjan = require(\"./tarjan\");\n\nmodule.exports = findCycles;\n\nfunction findCycles(g) {\n  return _.filter(tarjan(g), function(cmpt) {\n    return cmpt.length > 1 || (cmpt.length === 1 && g.hasEdge(cmpt[0], cmpt[0]));\n  });\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = floydWarshall;\n\nvar DEFAULT_WEIGHT_FUNC = _.constant(1);\n\nfunction floydWarshall(g, weightFn, edgeFn) {\n  return runFloydWarshall(g,\n    weightFn || DEFAULT_WEIGHT_FUNC,\n    edgeFn || function(v) { return g.outEdges(v); });\n}\n\nfunction runFloydWarshall(g, weightFn, edgeFn) {\n  var results = {};\n  var nodes = g.nodes();\n\n  nodes.forEach(function(v) {\n    results[v] = {};\n    results[v][v] = { distance: 0 };\n    nodes.forEach(function(w) {\n      if (v !== w) {\n        results[v][w] = { distance: Number.POSITIVE_INFINITY };\n      }\n    });\n    edgeFn(v).forEach(function(edge) {\n      var w = edge.v === v ? edge.w : edge.v;\n      var d = weightFn(edge);\n      results[v][w] = { distance: d, predecessor: v };\n    });\n  });\n\n  nodes.forEach(function(k) {\n    var rowK = results[k];\n    nodes.forEach(function(i) {\n      var rowI = results[i];\n      nodes.forEach(function(j) {\n        var ik = rowI[k];\n        var kj = rowK[j];\n        var ij = rowI[j];\n        var altDistance = ik.distance + kj.distance;\n        if (altDistance < ij.distance) {\n          ij.distance = altDistance;\n          ij.predecessor = kj.predecessor;\n        }\n      });\n    });\n  });\n\n  return results;\n}\n","module.exports = {\n  components: require(\"./components\"),\n  dijkstra: require(\"./dijkstra\"),\n  dijkstraAll: require(\"./dijkstra-all\"),\n  findCycles: require(\"./find-cycles\"),\n  floydWarshall: require(\"./floyd-warshall\"),\n  isAcyclic: require(\"./is-acyclic\"),\n  postorder: require(\"./postorder\"),\n  preorder: require(\"./preorder\"),\n  prim: require(\"./prim\"),\n  tarjan: require(\"./tarjan\"),\n  topsort: require(\"./topsort\")\n};\n","var topsort = require(\"./topsort\");\n\nmodule.exports = isAcyclic;\n\nfunction isAcyclic(g) {\n  try {\n    topsort(g);\n  } catch (e) {\n    if (e instanceof topsort.CycleException) {\n      return false;\n    }\n    throw e;\n  }\n  return true;\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = postorder;\n\nfunction postorder(g, vs) {\n  return dfs(g, vs, \"post\");\n}\n","var dfs = require(\"./dfs\");\n\nmodule.exports = preorder;\n\nfunction preorder(g, vs) {\n  return dfs(g, vs, \"pre\");\n}\n","var _ = require(\"../lodash\");\nvar Graph = require(\"../graph\");\nvar PriorityQueue = require(\"../data/priority-queue\");\n\nmodule.exports = prim;\n\nfunction prim(g, weightFunc) {\n  var result = new Graph();\n  var parents = {};\n  var pq = new PriorityQueue();\n  var v;\n\n  function updateNeighbors(edge) {\n    var w = edge.v === v ? edge.w : edge.v;\n    var pri = pq.priority(w);\n    if (pri !== undefined) {\n      var edgeWeight = weightFunc(edge);\n      if (edgeWeight < pri) {\n        parents[w] = v;\n        pq.decrease(w, edgeWeight);\n      }\n    }\n  }\n\n  if (g.nodeCount() === 0) {\n    return result;\n  }\n\n  _.each(g.nodes(), function(v) {\n    pq.add(v, Number.POSITIVE_INFINITY);\n    result.setNode(v);\n  });\n\n  // Start from an arbitrary node\n  pq.decrease(g.nodes()[0], 0);\n\n  var init = false;\n  while (pq.size() > 0) {\n    v = pq.removeMin();\n    if (_.has(parents, v)) {\n      result.setEdge(v, parents[v]);\n    } else if (init) {\n      throw new Error(\"Input graph is not connected: \" + g);\n    } else {\n      init = true;\n    }\n\n    g.nodeEdges(v).forEach(updateNeighbors);\n  }\n\n  return result;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = tarjan;\n\nfunction tarjan(g) {\n  var index = 0;\n  var stack = [];\n  var visited = {}; // node id -> { onStack, lowlink, index }\n  var results = [];\n\n  function dfs(v) {\n    var entry = visited[v] = {\n      onStack: true,\n      lowlink: index,\n      index: index++\n    };\n    stack.push(v);\n\n    g.successors(v).forEach(function(w) {\n      if (!_.has(visited, w)) {\n        dfs(w);\n        entry.lowlink = Math.min(entry.lowlink, visited[w].lowlink);\n      } else if (visited[w].onStack) {\n        entry.lowlink = Math.min(entry.lowlink, visited[w].index);\n      }\n    });\n\n    if (entry.lowlink === entry.index) {\n      var cmpt = [];\n      var w;\n      do {\n        w = stack.pop();\n        visited[w].onStack = false;\n        cmpt.push(w);\n      } while (v !== w);\n      results.push(cmpt);\n    }\n  }\n\n  g.nodes().forEach(function(v) {\n    if (!_.has(visited, v)) {\n      dfs(v);\n    }\n  });\n\n  return results;\n}\n","var _ = require(\"../lodash\");\n\nmodule.exports = topsort;\ntopsort.CycleException = CycleException;\n\nfunction topsort(g) {\n  var visited = {};\n  var stack = {};\n  var results = [];\n\n  function visit(node) {\n    if (_.has(stack, node)) {\n      throw new CycleException();\n    }\n\n    if (!_.has(visited, node)) {\n      stack[node] = true;\n      visited[node] = true;\n      _.each(g.predecessors(node), visit);\n      delete stack[node];\n      results.push(node);\n    }\n  }\n\n  _.each(g.sinks(), visit);\n\n  if (_.size(visited) !== g.nodeCount()) {\n    throw new CycleException();\n  }\n\n  return results;\n}\n\nfunction CycleException() {}\nCycleException.prototype = new Error(); // must be an instance of Error to pass testing","var _ = require(\"../lodash\");\n\nmodule.exports = PriorityQueue;\n\n/**\n * A min-priority queue data structure. This algorithm is derived from Cormen,\n * et al., \"Introduction to Algorithms\". The basic idea of a min-priority\n * queue is that you can efficiently (in O(1) time) get the smallest key in\n * the queue. Adding and removing elements takes O(log n) time. A key can\n * have its priority decreased in O(log n) time.\n */\nfunction PriorityQueue() {\n  this._arr = [];\n  this._keyIndices = {};\n}\n\n/**\n * Returns the number of elements in the queue. Takes `O(1)` time.\n */\nPriorityQueue.prototype.size = function() {\n  return this._arr.length;\n};\n\n/**\n * Returns the keys that are in the queue. Takes `O(n)` time.\n */\nPriorityQueue.prototype.keys = function() {\n  return this._arr.map(function(x) { return x.key; });\n};\n\n/**\n * Returns `true` if **key** is in the queue and `false` if not.\n */\nPriorityQueue.prototype.has = function(key) {\n  return _.has(this._keyIndices, key);\n};\n\n/**\n * Returns the priority for **key**. If **key** is not present in the queue\n * then this function returns `undefined`. Takes `O(1)` time.\n *\n * @param {Object} key\n */\nPriorityQueue.prototype.priority = function(key) {\n  var index = this._keyIndices[key];\n  if (index !== undefined) {\n    return this._arr[index].priority;\n  }\n};\n\n/**\n * Returns the key for the minimum element in this queue. If the queue is\n * empty this function throws an Error. Takes `O(1)` time.\n */\nPriorityQueue.prototype.min = function() {\n  if (this.size() === 0) {\n    throw new Error(\"Queue underflow\");\n  }\n  return this._arr[0].key;\n};\n\n/**\n * Inserts a new key into the priority queue. If the key already exists in\n * the queue this function returns `false`; otherwise it will return `true`.\n * Takes `O(n)` time.\n *\n * @param {Object} key the key to add\n * @param {Number} priority the initial priority for the key\n */\nPriorityQueue.prototype.add = function(key, priority) {\n  var keyIndices = this._keyIndices;\n  key = String(key);\n  if (!_.has(keyIndices, key)) {\n    var arr = this._arr;\n    var index = arr.length;\n    keyIndices[key] = index;\n    arr.push({key: key, priority: priority});\n    this._decrease(index);\n    return true;\n  }\n  return false;\n};\n\n/**\n * Removes and returns the smallest key in the queue. Takes `O(log n)` time.\n */\nPriorityQueue.prototype.removeMin = function() {\n  this._swap(0, this._arr.length - 1);\n  var min = this._arr.pop();\n  delete this._keyIndices[min.key];\n  this._heapify(0);\n  return min.key;\n};\n\n/**\n * Decreases the priority for **key** to **priority**. If the new priority is\n * greater than the previous priority, this function will throw an Error.\n *\n * @param {Object} key the key for which to raise priority\n * @param {Number} priority the new priority for the key\n */\nPriorityQueue.prototype.decrease = function(key, priority) {\n  var index = this._keyIndices[key];\n  if (priority > this._arr[index].priority) {\n    throw new Error(\"New priority is greater than current priority. \" +\n        \"Key: \" + key + \" Old: \" + this._arr[index].priority + \" New: \" + priority);\n  }\n  this._arr[index].priority = priority;\n  this._decrease(index);\n};\n\nPriorityQueue.prototype._heapify = function(i) {\n  var arr = this._arr;\n  var l = 2 * i;\n  var r = l + 1;\n  var largest = i;\n  if (l < arr.length) {\n    largest = arr[l].priority < arr[largest].priority ? l : largest;\n    if (r < arr.length) {\n      largest = arr[r].priority < arr[largest].priority ? r : largest;\n    }\n    if (largest !== i) {\n      this._swap(i, largest);\n      this._heapify(largest);\n    }\n  }\n};\n\nPriorityQueue.prototype._decrease = function(index) {\n  var arr = this._arr;\n  var priority = arr[index].priority;\n  var parent;\n  while (index !== 0) {\n    parent = index >> 1;\n    if (arr[parent].priority < priority) {\n      break;\n    }\n    this._swap(index, parent);\n    index = parent;\n  }\n};\n\nPriorityQueue.prototype._swap = function(i, j) {\n  var arr = this._arr;\n  var keyIndices = this._keyIndices;\n  var origArrI = arr[i];\n  var origArrJ = arr[j];\n  arr[i] = origArrJ;\n  arr[j] = origArrI;\n  keyIndices[origArrJ.key] = i;\n  keyIndices[origArrI.key] = j;\n};\n","\"use strict\";\n\nvar _ = require(\"./lodash\");\n\nmodule.exports = Graph;\n\nvar DEFAULT_EDGE_NAME = \"\\x00\";\nvar GRAPH_NODE = \"\\x00\";\nvar EDGE_KEY_DELIM = \"\\x01\";\n\n// Implementation notes:\n//\n//  * Node id query functions should return string ids for the nodes\n//  * Edge id query functions should return an \"edgeObj\", edge object, that is\n//    composed of enough information to uniquely identify an edge: {v, w, name}.\n//  * Internally we use an \"edgeId\", a stringified form of the edgeObj, to\n//    reference edges. This is because we need a performant way to look these\n//    edges up and, object properties, which have string keys, are the closest\n//    we're going to get to a performant hashtable in JavaScript.\n\nfunction Graph(opts) {\n  this._isDirected = _.has(opts, \"directed\") ? opts.directed : true;\n  this._isMultigraph = _.has(opts, \"multigraph\") ? opts.multigraph : false;\n  this._isCompound = _.has(opts, \"compound\") ? opts.compound : false;\n\n  // Label for the graph itself\n  this._label = undefined;\n\n  // Defaults to be set when creating a new node\n  this._defaultNodeLabelFn = _.constant(undefined);\n\n  // Defaults to be set when creating a new edge\n  this._defaultEdgeLabelFn = _.constant(undefined);\n\n  // v -> label\n  this._nodes = {};\n\n  if (this._isCompound) {\n    // v -> parent\n    this._parent = {};\n\n    // v -> children\n    this._children = {};\n    this._children[GRAPH_NODE] = {};\n  }\n\n  // v -> edgeObj\n  this._in = {};\n\n  // u -> v -> Number\n  this._preds = {};\n\n  // v -> edgeObj\n  this._out = {};\n\n  // v -> w -> Number\n  this._sucs = {};\n\n  // e -> edgeObj\n  this._edgeObjs = {};\n\n  // e -> label\n  this._edgeLabels = {};\n}\n\n/* Number of nodes in the graph. Should only be changed by the implementation. */\nGraph.prototype._nodeCount = 0;\n\n/* Number of edges in the graph. Should only be changed by the implementation. */\nGraph.prototype._edgeCount = 0;\n\n\n/* === Graph functions ========= */\n\nGraph.prototype.isDirected = function() {\n  return this._isDirected;\n};\n\nGraph.prototype.isMultigraph = function() {\n  return this._isMultigraph;\n};\n\nGraph.prototype.isCompound = function() {\n  return this._isCompound;\n};\n\nGraph.prototype.setGraph = function(label) {\n  this._label = label;\n  return this;\n};\n\nGraph.prototype.graph = function() {\n  return this._label;\n};\n\n\n/* === Node functions ========== */\n\nGraph.prototype.setDefaultNodeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultNodeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.nodeCount = function() {\n  return this._nodeCount;\n};\n\nGraph.prototype.nodes = function() {\n  return _.keys(this._nodes);\n};\n\nGraph.prototype.sources = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._in[v]);\n  });\n};\n\nGraph.prototype.sinks = function() {\n  var self = this;\n  return _.filter(this.nodes(), function(v) {\n    return _.isEmpty(self._out[v]);\n  });\n};\n\nGraph.prototype.setNodes = function(vs, value) {\n  var args = arguments;\n  var self = this;\n  _.each(vs, function(v) {\n    if (args.length > 1) {\n      self.setNode(v, value);\n    } else {\n      self.setNode(v);\n    }\n  });\n  return this;\n};\n\nGraph.prototype.setNode = function(v, value) {\n  if (_.has(this._nodes, v)) {\n    if (arguments.length > 1) {\n      this._nodes[v] = value;\n    }\n    return this;\n  }\n\n  this._nodes[v] = arguments.length > 1 ? value : this._defaultNodeLabelFn(v);\n  if (this._isCompound) {\n    this._parent[v] = GRAPH_NODE;\n    this._children[v] = {};\n    this._children[GRAPH_NODE][v] = true;\n  }\n  this._in[v] = {};\n  this._preds[v] = {};\n  this._out[v] = {};\n  this._sucs[v] = {};\n  ++this._nodeCount;\n  return this;\n};\n\nGraph.prototype.node = function(v) {\n  return this._nodes[v];\n};\n\nGraph.prototype.hasNode = function(v) {\n  return _.has(this._nodes, v);\n};\n\nGraph.prototype.removeNode =  function(v) {\n  var self = this;\n  if (_.has(this._nodes, v)) {\n    var removeEdge = function(e) { self.removeEdge(self._edgeObjs[e]); };\n    delete this._nodes[v];\n    if (this._isCompound) {\n      this._removeFromParentsChildList(v);\n      delete this._parent[v];\n      _.each(this.children(v), function(child) {\n        self.setParent(child);\n      });\n      delete this._children[v];\n    }\n    _.each(_.keys(this._in[v]), removeEdge);\n    delete this._in[v];\n    delete this._preds[v];\n    _.each(_.keys(this._out[v]), removeEdge);\n    delete this._out[v];\n    delete this._sucs[v];\n    --this._nodeCount;\n  }\n  return this;\n};\n\nGraph.prototype.setParent = function(v, parent) {\n  if (!this._isCompound) {\n    throw new Error(\"Cannot set parent in a non-compound graph\");\n  }\n\n  if (_.isUndefined(parent)) {\n    parent = GRAPH_NODE;\n  } else {\n    // Coerce parent to string\n    parent += \"\";\n    for (var ancestor = parent;\n      !_.isUndefined(ancestor);\n      ancestor = this.parent(ancestor)) {\n      if (ancestor === v) {\n        throw new Error(\"Setting \" + parent+ \" as parent of \" + v +\n                        \" would create a cycle\");\n      }\n    }\n\n    this.setNode(parent);\n  }\n\n  this.setNode(v);\n  this._removeFromParentsChildList(v);\n  this._parent[v] = parent;\n  this._children[parent][v] = true;\n  return this;\n};\n\nGraph.prototype._removeFromParentsChildList = function(v) {\n  delete this._children[this._parent[v]][v];\n};\n\nGraph.prototype.parent = function(v) {\n  if (this._isCompound) {\n    var parent = this._parent[v];\n    if (parent !== GRAPH_NODE) {\n      return parent;\n    }\n  }\n};\n\nGraph.prototype.children = function(v) {\n  if (_.isUndefined(v)) {\n    v = GRAPH_NODE;\n  }\n\n  if (this._isCompound) {\n    var children = this._children[v];\n    if (children) {\n      return _.keys(children);\n    }\n  } else if (v === GRAPH_NODE) {\n    return this.nodes();\n  } else if (this.hasNode(v)) {\n    return [];\n  }\n};\n\nGraph.prototype.predecessors = function(v) {\n  var predsV = this._preds[v];\n  if (predsV) {\n    return _.keys(predsV);\n  }\n};\n\nGraph.prototype.successors = function(v) {\n  var sucsV = this._sucs[v];\n  if (sucsV) {\n    return _.keys(sucsV);\n  }\n};\n\nGraph.prototype.neighbors = function(v) {\n  var preds = this.predecessors(v);\n  if (preds) {\n    return _.union(preds, this.successors(v));\n  }\n};\n\nGraph.prototype.isLeaf = function (v) {\n  var neighbors;\n  if (this.isDirected()) {\n    neighbors = this.successors(v);\n  } else {\n    neighbors = this.neighbors(v);\n  }\n  return neighbors.length === 0;\n};\n\nGraph.prototype.filterNodes = function(filter) {\n  var copy = new this.constructor({\n    directed: this._isDirected,\n    multigraph: this._isMultigraph,\n    compound: this._isCompound\n  });\n\n  copy.setGraph(this.graph());\n\n  var self = this;\n  _.each(this._nodes, function(value, v) {\n    if (filter(v)) {\n      copy.setNode(v, value);\n    }\n  });\n\n  _.each(this._edgeObjs, function(e) {\n    if (copy.hasNode(e.v) && copy.hasNode(e.w)) {\n      copy.setEdge(e, self.edge(e));\n    }\n  });\n\n  var parents = {};\n  function findParent(v) {\n    var parent = self.parent(v);\n    if (parent === undefined || copy.hasNode(parent)) {\n      parents[v] = parent;\n      return parent;\n    } else if (parent in parents) {\n      return parents[parent];\n    } else {\n      return findParent(parent);\n    }\n  }\n\n  if (this._isCompound) {\n    _.each(copy.nodes(), function(v) {\n      copy.setParent(v, findParent(v));\n    });\n  }\n\n  return copy;\n};\n\n/* === Edge functions ========== */\n\nGraph.prototype.setDefaultEdgeLabel = function(newDefault) {\n  if (!_.isFunction(newDefault)) {\n    newDefault = _.constant(newDefault);\n  }\n  this._defaultEdgeLabelFn = newDefault;\n  return this;\n};\n\nGraph.prototype.edgeCount = function() {\n  return this._edgeCount;\n};\n\nGraph.prototype.edges = function() {\n  return _.values(this._edgeObjs);\n};\n\nGraph.prototype.setPath = function(vs, value) {\n  var self = this;\n  var args = arguments;\n  _.reduce(vs, function(v, w) {\n    if (args.length > 1) {\n      self.setEdge(v, w, value);\n    } else {\n      self.setEdge(v, w);\n    }\n    return w;\n  });\n  return this;\n};\n\n/*\n * setEdge(v, w, [value, [name]])\n * setEdge({ v, w, [name] }, [value])\n */\nGraph.prototype.setEdge = function() {\n  var v, w, name, value;\n  var valueSpecified = false;\n  var arg0 = arguments[0];\n\n  if (typeof arg0 === \"object\" && arg0 !== null && \"v\" in arg0) {\n    v = arg0.v;\n    w = arg0.w;\n    name = arg0.name;\n    if (arguments.length === 2) {\n      value = arguments[1];\n      valueSpecified = true;\n    }\n  } else {\n    v = arg0;\n    w = arguments[1];\n    name = arguments[3];\n    if (arguments.length > 2) {\n      value = arguments[2];\n      valueSpecified = true;\n    }\n  }\n\n  v = \"\" + v;\n  w = \"\" + w;\n  if (!_.isUndefined(name)) {\n    name = \"\" + name;\n  }\n\n  var e = edgeArgsToId(this._isDirected, v, w, name);\n  if (_.has(this._edgeLabels, e)) {\n    if (valueSpecified) {\n      this._edgeLabels[e] = value;\n    }\n    return this;\n  }\n\n  if (!_.isUndefined(name) && !this._isMultigraph) {\n    throw new Error(\"Cannot set a named edge when isMultigraph = false\");\n  }\n\n  // It didn't exist, so we need to create it.\n  // First ensure the nodes exist.\n  this.setNode(v);\n  this.setNode(w);\n\n  this._edgeLabels[e] = valueSpecified ? value : this._defaultEdgeLabelFn(v, w, name);\n\n  var edgeObj = edgeArgsToObj(this._isDirected, v, w, name);\n  // Ensure we add undirected edges in a consistent way.\n  v = edgeObj.v;\n  w = edgeObj.w;\n\n  Object.freeze(edgeObj);\n  this._edgeObjs[e] = edgeObj;\n  incrementOrInitEntry(this._preds[w], v);\n  incrementOrInitEntry(this._sucs[v], w);\n  this._in[w][e] = edgeObj;\n  this._out[v][e] = edgeObj;\n  this._edgeCount++;\n  return this;\n};\n\nGraph.prototype.edge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return this._edgeLabels[e];\n};\n\nGraph.prototype.hasEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  return _.has(this._edgeLabels, e);\n};\n\nGraph.prototype.removeEdge = function(v, w, name) {\n  var e = (arguments.length === 1\n    ? edgeObjToId(this._isDirected, arguments[0])\n    : edgeArgsToId(this._isDirected, v, w, name));\n  var edge = this._edgeObjs[e];\n  if (edge) {\n    v = edge.v;\n    w = edge.w;\n    delete this._edgeLabels[e];\n    delete this._edgeObjs[e];\n    decrementOrRemoveEntry(this._preds[w], v);\n    decrementOrRemoveEntry(this._sucs[v], w);\n    delete this._in[w][e];\n    delete this._out[v][e];\n    this._edgeCount--;\n  }\n  return this;\n};\n\nGraph.prototype.inEdges = function(v, u) {\n  var inV = this._in[v];\n  if (inV) {\n    var edges = _.values(inV);\n    if (!u) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.v === u; });\n  }\n};\n\nGraph.prototype.outEdges = function(v, w) {\n  var outV = this._out[v];\n  if (outV) {\n    var edges = _.values(outV);\n    if (!w) {\n      return edges;\n    }\n    return _.filter(edges, function(edge) { return edge.w === w; });\n  }\n};\n\nGraph.prototype.nodeEdges = function(v, w) {\n  var inEdges = this.inEdges(v, w);\n  if (inEdges) {\n    return inEdges.concat(this.outEdges(v, w));\n  }\n};\n\nfunction incrementOrInitEntry(map, k) {\n  if (map[k]) {\n    map[k]++;\n  } else {\n    map[k] = 1;\n  }\n}\n\nfunction decrementOrRemoveEntry(map, k) {\n  if (!--map[k]) { delete map[k]; }\n}\n\nfunction edgeArgsToId(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  return v + EDGE_KEY_DELIM + w + EDGE_KEY_DELIM +\n             (_.isUndefined(name) ? DEFAULT_EDGE_NAME : name);\n}\n\nfunction edgeArgsToObj(isDirected, v_, w_, name) {\n  var v = \"\" + v_;\n  var w = \"\" + w_;\n  if (!isDirected && v > w) {\n    var tmp = v;\n    v = w;\n    w = tmp;\n  }\n  var edgeObj =  { v: v, w: w };\n  if (name) {\n    edgeObj.name = name;\n  }\n  return edgeObj;\n}\n\nfunction edgeObjToId(isDirected, edgeObj) {\n  return edgeArgsToId(isDirected, edgeObj.v, edgeObj.w, edgeObj.name);\n}\n","// Includes only the \"core\" of graphlib\nmodule.exports = {\n  Graph: require(\"./graph\"),\n  version: require(\"./version\")\n};\n","var _ = require(\"./lodash\");\nvar Graph = require(\"./graph\");\n\nmodule.exports = {\n  write: write,\n  read: read\n};\n\nfunction write(g) {\n  var json = {\n    options: {\n      directed: g.isDirected(),\n      multigraph: g.isMultigraph(),\n      compound: g.isCompound()\n    },\n    nodes: writeNodes(g),\n    edges: writeEdges(g)\n  };\n  if (!_.isUndefined(g.graph())) {\n    json.value = _.clone(g.graph());\n  }\n  return json;\n}\n\nfunction writeNodes(g) {\n  return _.map(g.nodes(), function(v) {\n    var nodeValue = g.node(v);\n    var parent = g.parent(v);\n    var node = { v: v };\n    if (!_.isUndefined(nodeValue)) {\n      node.value = nodeValue;\n    }\n    if (!_.isUndefined(parent)) {\n      node.parent = parent;\n    }\n    return node;\n  });\n}\n\nfunction writeEdges(g) {\n  return _.map(g.edges(), function(e) {\n    var edgeValue = g.edge(e);\n    var edge = { v: e.v, w: e.w };\n    if (!_.isUndefined(e.name)) {\n      edge.name = e.name;\n    }\n    if (!_.isUndefined(edgeValue)) {\n      edge.value = edgeValue;\n    }\n    return edge;\n  });\n}\n\nfunction read(json) {\n  var g = new Graph(json.options).setGraph(json.value);\n  _.each(json.nodes, function(entry) {\n    g.setNode(entry.v, entry.value);\n    if (entry.parent) {\n      g.setParent(entry.v, entry.parent);\n    }\n  });\n  _.each(json.edges, function(entry) {\n    g.setEdge({ v: entry.v, w: entry.w, name: entry.name }, entry.value);\n  });\n  return g;\n}\n","/* global window */\n\nvar lodash;\n\nif (typeof require === \"function\") {\n  try {\n    lodash = {\n      clone: require(\"lodash/clone\"),\n      constant: require(\"lodash/constant\"),\n      each: require(\"lodash/each\"),\n      filter: require(\"lodash/filter\"),\n      has:  require(\"lodash/has\"),\n      isArray: require(\"lodash/isArray\"),\n      isEmpty: require(\"lodash/isEmpty\"),\n      isFunction: require(\"lodash/isFunction\"),\n      isUndefined: require(\"lodash/isUndefined\"),\n      keys: require(\"lodash/keys\"),\n      map: require(\"lodash/map\"),\n      reduce: require(\"lodash/reduce\"),\n      size: require(\"lodash/size\"),\n      transform: require(\"lodash/transform\"),\n      union: require(\"lodash/union\"),\n      values: require(\"lodash/values\")\n    };\n  } catch (e) {\n    // continue regardless of error\n  }\n}\n\nif (!lodash) {\n  lodash = window._;\n}\n\nmodule.exports = lodash;\n","module.exports = '2.1.8';\n","// eslint-disable-next-line @typescript-eslint/unbound-method\nconst toString = Object.prototype.toString;\n/**\n * Checks if an object is an instance of an Array (array or typed array, except those that contain bigint values).\n *\n * @param value - Object to check.\n * @returns True if the object is an array or a typed array.\n */\nexport function isAnyArray(value) {\n    const tag = toString.call(value);\n    return tag.endsWith('Array]') && !tag.includes('Big');\n}\n//# sourceMappingURL=index.js.map","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar DataView = getNative(root, 'DataView');\n\nmodule.exports = DataView;\n","var hashClear = require('./_hashClear'),\n    hashDelete = require('./_hashDelete'),\n    hashGet = require('./_hashGet'),\n    hashHas = require('./_hashHas'),\n    hashSet = require('./_hashSet');\n\n/**\n * Creates a hash object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Hash(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `Hash`.\nHash.prototype.clear = hashClear;\nHash.prototype['delete'] = hashDelete;\nHash.prototype.get = hashGet;\nHash.prototype.has = hashHas;\nHash.prototype.set = hashSet;\n\nmodule.exports = Hash;\n","var listCacheClear = require('./_listCacheClear'),\n    listCacheDelete = require('./_listCacheDelete'),\n    listCacheGet = require('./_listCacheGet'),\n    listCacheHas = require('./_listCacheHas'),\n    listCacheSet = require('./_listCacheSet');\n\n/**\n * Creates an list cache object.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction ListCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `ListCache`.\nListCache.prototype.clear = listCacheClear;\nListCache.prototype['delete'] = listCacheDelete;\nListCache.prototype.get = listCacheGet;\nListCache.prototype.has = listCacheHas;\nListCache.prototype.set = listCacheSet;\n\nmodule.exports = ListCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Map = getNative(root, 'Map');\n\nmodule.exports = Map;\n","var mapCacheClear = require('./_mapCacheClear'),\n    mapCacheDelete = require('./_mapCacheDelete'),\n    mapCacheGet = require('./_mapCacheGet'),\n    mapCacheHas = require('./_mapCacheHas'),\n    mapCacheSet = require('./_mapCacheSet');\n\n/**\n * Creates a map cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction MapCache(entries) {\n  var index = -1,\n      length = entries == null ? 0 : entries.length;\n\n  this.clear();\n  while (++index < length) {\n    var entry = entries[index];\n    this.set(entry[0], entry[1]);\n  }\n}\n\n// Add methods to `MapCache`.\nMapCache.prototype.clear = mapCacheClear;\nMapCache.prototype['delete'] = mapCacheDelete;\nMapCache.prototype.get = mapCacheGet;\nMapCache.prototype.has = mapCacheHas;\nMapCache.prototype.set = mapCacheSet;\n\nmodule.exports = MapCache;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Promise = getNative(root, 'Promise');\n\nmodule.exports = Promise;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar Set = getNative(root, 'Set');\n\nmodule.exports = Set;\n","var MapCache = require('./_MapCache'),\n    setCacheAdd = require('./_setCacheAdd'),\n    setCacheHas = require('./_setCacheHas');\n\n/**\n *\n * Creates an array cache object to store unique values.\n *\n * @private\n * @constructor\n * @param {Array} [values] The values to cache.\n */\nfunction SetCache(values) {\n  var index = -1,\n      length = values == null ? 0 : values.length;\n\n  this.__data__ = new MapCache;\n  while (++index < length) {\n    this.add(values[index]);\n  }\n}\n\n// Add methods to `SetCache`.\nSetCache.prototype.add = SetCache.prototype.push = setCacheAdd;\nSetCache.prototype.has = setCacheHas;\n\nmodule.exports = SetCache;\n","var ListCache = require('./_ListCache'),\n    stackClear = require('./_stackClear'),\n    stackDelete = require('./_stackDelete'),\n    stackGet = require('./_stackGet'),\n    stackHas = require('./_stackHas'),\n    stackSet = require('./_stackSet');\n\n/**\n * Creates a stack cache object to store key-value pairs.\n *\n * @private\n * @constructor\n * @param {Array} [entries] The key-value pairs to cache.\n */\nfunction Stack(entries) {\n  var data = this.__data__ = new ListCache(entries);\n  this.size = data.size;\n}\n\n// Add methods to `Stack`.\nStack.prototype.clear = stackClear;\nStack.prototype['delete'] = stackDelete;\nStack.prototype.get = stackGet;\nStack.prototype.has = stackHas;\nStack.prototype.set = stackSet;\n\nmodule.exports = Stack;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Symbol = root.Symbol;\n\nmodule.exports = Symbol;\n","var root = require('./_root');\n\n/** Built-in value references. */\nvar Uint8Array = root.Uint8Array;\n\nmodule.exports = Uint8Array;\n","var getNative = require('./_getNative'),\n    root = require('./_root');\n\n/* Built-in method references that are verified to be native. */\nvar WeakMap = getNative(root, 'WeakMap');\n\nmodule.exports = WeakMap;\n","/**\n * A faster alternative to `Function#apply`, this function invokes `func`\n * with the `this` binding of `thisArg` and the arguments of `args`.\n *\n * @private\n * @param {Function} func The function to invoke.\n * @param {*} thisArg The `this` binding of `func`.\n * @param {Array} args The arguments to invoke `func` with.\n * @returns {*} Returns the result of `func`.\n */\nfunction apply(func, thisArg, args) {\n  switch (args.length) {\n    case 0: return func.call(thisArg);\n    case 1: return func.call(thisArg, args[0]);\n    case 2: return func.call(thisArg, args[0], args[1]);\n    case 3: return func.call(thisArg, args[0], args[1], args[2]);\n  }\n  return func.apply(thisArg, args);\n}\n\nmodule.exports = apply;\n","/**\n * A specialized version of `_.forEach` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns `array`.\n */\nfunction arrayEach(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (iteratee(array[index], index, array) === false) {\n      break;\n    }\n  }\n  return array;\n}\n\nmodule.exports = arrayEach;\n","/**\n * A specialized version of `_.filter` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction arrayFilter(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      resIndex = 0,\n      result = [];\n\n  while (++index < length) {\n    var value = array[index];\n    if (predicate(value, index, array)) {\n      result[resIndex++] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayFilter;\n","var baseIndexOf = require('./_baseIndexOf');\n\n/**\n * A specialized version of `_.includes` for arrays without support for\n * specifying an index to search from.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludes(array, value) {\n  var length = array == null ? 0 : array.length;\n  return !!length && baseIndexOf(array, value, 0) > -1;\n}\n\nmodule.exports = arrayIncludes;\n","/**\n * This function is like `arrayIncludes` except that it accepts a comparator.\n *\n * @private\n * @param {Array} [array] The array to inspect.\n * @param {*} target The value to search for.\n * @param {Function} comparator The comparator invoked per element.\n * @returns {boolean} Returns `true` if `target` is found, else `false`.\n */\nfunction arrayIncludesWith(array, value, comparator) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (comparator(value, array[index])) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arrayIncludesWith;\n","var baseTimes = require('./_baseTimes'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isIndex = require('./_isIndex'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Creates an array of the enumerable property names of the array-like `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @param {boolean} inherited Specify returning inherited property names.\n * @returns {Array} Returns the array of property names.\n */\nfunction arrayLikeKeys(value, inherited) {\n  var isArr = isArray(value),\n      isArg = !isArr && isArguments(value),\n      isBuff = !isArr && !isArg && isBuffer(value),\n      isType = !isArr && !isArg && !isBuff && isTypedArray(value),\n      skipIndexes = isArr || isArg || isBuff || isType,\n      result = skipIndexes ? baseTimes(value.length, String) : [],\n      length = result.length;\n\n  for (var key in value) {\n    if ((inherited || hasOwnProperty.call(value, key)) &&\n        !(skipIndexes && (\n           // Safari 9 has enumerable `arguments.length` in strict mode.\n           key == 'length' ||\n           // Node.js 0.10 has enumerable non-index properties on buffers.\n           (isBuff && (key == 'offset' || key == 'parent')) ||\n           // PhantomJS 2 has enumerable non-index properties on typed arrays.\n           (isType && (key == 'buffer' || key == 'byteLength' || key == 'byteOffset')) ||\n           // Skip index properties.\n           isIndex(key, length)\n        ))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = arrayLikeKeys;\n","/**\n * A specialized version of `_.map` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction arrayMap(array, iteratee) {\n  var index = -1,\n      length = array == null ? 0 : array.length,\n      result = Array(length);\n\n  while (++index < length) {\n    result[index] = iteratee(array[index], index, array);\n  }\n  return result;\n}\n\nmodule.exports = arrayMap;\n","/**\n * Appends the elements of `values` to `array`.\n *\n * @private\n * @param {Array} array The array to modify.\n * @param {Array} values The values to append.\n * @returns {Array} Returns `array`.\n */\nfunction arrayPush(array, values) {\n  var index = -1,\n      length = values.length,\n      offset = array.length;\n\n  while (++index < length) {\n    array[offset + index] = values[index];\n  }\n  return array;\n}\n\nmodule.exports = arrayPush;\n","/**\n * A specialized version of `_.reduce` for arrays without support for\n * iteratee shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @param {boolean} [initAccum] Specify using the first element of `array` as\n *  the initial value.\n * @returns {*} Returns the accumulated value.\n */\nfunction arrayReduce(array, iteratee, accumulator, initAccum) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  if (initAccum && length) {\n    accumulator = array[++index];\n  }\n  while (++index < length) {\n    accumulator = iteratee(accumulator, array[index], index, array);\n  }\n  return accumulator;\n}\n\nmodule.exports = arrayReduce;\n","/**\n * A specialized version of `_.some` for arrays without support for iteratee\n * shorthands.\n *\n * @private\n * @param {Array} [array] The array to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {boolean} Returns `true` if any element passes the predicate check,\n *  else `false`.\n */\nfunction arraySome(array, predicate) {\n  var index = -1,\n      length = array == null ? 0 : array.length;\n\n  while (++index < length) {\n    if (predicate(array[index], index, array)) {\n      return true;\n    }\n  }\n  return false;\n}\n\nmodule.exports = arraySome;\n","var baseProperty = require('./_baseProperty');\n\n/**\n * Gets the size of an ASCII `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nvar asciiSize = baseProperty('length');\n\nmodule.exports = asciiSize;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/**\n * This function is like `assignValue` except that it doesn't assign\n * `undefined` values.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignMergeValue(object, key, value) {\n  if ((value !== undefined && !eq(object[key], value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignMergeValue;\n","var baseAssignValue = require('./_baseAssignValue'),\n    eq = require('./eq');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns `value` to `key` of `object` if the existing value is not equivalent\n * using [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction assignValue(object, key, value) {\n  var objValue = object[key];\n  if (!(hasOwnProperty.call(object, key) && eq(objValue, value)) ||\n      (value === undefined && !(key in object))) {\n    baseAssignValue(object, key, value);\n  }\n}\n\nmodule.exports = assignValue;\n","var eq = require('./eq');\n\n/**\n * Gets the index at which the `key` is found in `array` of key-value pairs.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} key The key to search for.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction assocIndexOf(array, key) {\n  var length = array.length;\n  while (length--) {\n    if (eq(array[length][0], key)) {\n      return length;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = assocIndexOf;\n","var copyObject = require('./_copyObject'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.assign` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssign(object, source) {\n  return object && copyObject(source, keys(source), object);\n}\n\nmodule.exports = baseAssign;\n","var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * The base implementation of `_.assignIn` without support for multiple sources\n * or `customizer` functions.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @returns {Object} Returns `object`.\n */\nfunction baseAssignIn(object, source) {\n  return object && copyObject(source, keysIn(source), object);\n}\n\nmodule.exports = baseAssignIn;\n","var defineProperty = require('./_defineProperty');\n\n/**\n * The base implementation of `assignValue` and `assignMergeValue` without\n * value checks.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {string} key The key of the property to assign.\n * @param {*} value The value to assign.\n */\nfunction baseAssignValue(object, key, value) {\n  if (key == '__proto__' && defineProperty) {\n    defineProperty(object, key, {\n      'configurable': true,\n      'enumerable': true,\n      'value': value,\n      'writable': true\n    });\n  } else {\n    object[key] = value;\n  }\n}\n\nmodule.exports = baseAssignValue;\n","var Stack = require('./_Stack'),\n    arrayEach = require('./_arrayEach'),\n    assignValue = require('./_assignValue'),\n    baseAssign = require('./_baseAssign'),\n    baseAssignIn = require('./_baseAssignIn'),\n    cloneBuffer = require('./_cloneBuffer'),\n    copyArray = require('./_copyArray'),\n    copySymbols = require('./_copySymbols'),\n    copySymbolsIn = require('./_copySymbolsIn'),\n    getAllKeys = require('./_getAllKeys'),\n    getAllKeysIn = require('./_getAllKeysIn'),\n    getTag = require('./_getTag'),\n    initCloneArray = require('./_initCloneArray'),\n    initCloneByTag = require('./_initCloneByTag'),\n    initCloneObject = require('./_initCloneObject'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isMap = require('./isMap'),\n    isObject = require('./isObject'),\n    isSet = require('./isSet'),\n    keys = require('./keys'),\n    keysIn = require('./keysIn');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_FLAT_FLAG = 2,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values supported by `_.clone`. */\nvar cloneableTags = {};\ncloneableTags[argsTag] = cloneableTags[arrayTag] =\ncloneableTags[arrayBufferTag] = cloneableTags[dataViewTag] =\ncloneableTags[boolTag] = cloneableTags[dateTag] =\ncloneableTags[float32Tag] = cloneableTags[float64Tag] =\ncloneableTags[int8Tag] = cloneableTags[int16Tag] =\ncloneableTags[int32Tag] = cloneableTags[mapTag] =\ncloneableTags[numberTag] = cloneableTags[objectTag] =\ncloneableTags[regexpTag] = cloneableTags[setTag] =\ncloneableTags[stringTag] = cloneableTags[symbolTag] =\ncloneableTags[uint8Tag] = cloneableTags[uint8ClampedTag] =\ncloneableTags[uint16Tag] = cloneableTags[uint32Tag] = true;\ncloneableTags[errorTag] = cloneableTags[funcTag] =\ncloneableTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.clone` and `_.cloneDeep` which tracks\n * traversed objects.\n *\n * @private\n * @param {*} value The value to clone.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Deep clone\n *  2 - Flatten inherited properties\n *  4 - Clone symbols\n * @param {Function} [customizer] The function to customize cloning.\n * @param {string} [key] The key of `value`.\n * @param {Object} [object] The parent object of `value`.\n * @param {Object} [stack] Tracks traversed objects and their clone counterparts.\n * @returns {*} Returns the cloned value.\n */\nfunction baseClone(value, bitmask, customizer, key, object, stack) {\n  var result,\n      isDeep = bitmask & CLONE_DEEP_FLAG,\n      isFlat = bitmask & CLONE_FLAT_FLAG,\n      isFull = bitmask & CLONE_SYMBOLS_FLAG;\n\n  if (customizer) {\n    result = object ? customizer(value, key, object, stack) : customizer(value);\n  }\n  if (result !== undefined) {\n    return result;\n  }\n  if (!isObject(value)) {\n    return value;\n  }\n  var isArr = isArray(value);\n  if (isArr) {\n    result = initCloneArray(value);\n    if (!isDeep) {\n      return copyArray(value, result);\n    }\n  } else {\n    var tag = getTag(value),\n        isFunc = tag == funcTag || tag == genTag;\n\n    if (isBuffer(value)) {\n      return cloneBuffer(value, isDeep);\n    }\n    if (tag == objectTag || tag == argsTag || (isFunc && !object)) {\n      result = (isFlat || isFunc) ? {} : initCloneObject(value);\n      if (!isDeep) {\n        return isFlat\n          ? copySymbolsIn(value, baseAssignIn(result, value))\n          : copySymbols(value, baseAssign(result, value));\n      }\n    } else {\n      if (!cloneableTags[tag]) {\n        return object ? value : {};\n      }\n      result = initCloneByTag(value, tag, isDeep);\n    }\n  }\n  // Check for circular references and return its corresponding clone.\n  stack || (stack = new Stack);\n  var stacked = stack.get(value);\n  if (stacked) {\n    return stacked;\n  }\n  stack.set(value, result);\n\n  if (isSet(value)) {\n    value.forEach(function(subValue) {\n      result.add(baseClone(subValue, bitmask, customizer, subValue, value, stack));\n    });\n  } else if (isMap(value)) {\n    value.forEach(function(subValue, key) {\n      result.set(key, baseClone(subValue, bitmask, customizer, key, value, stack));\n    });\n  }\n\n  var keysFunc = isFull\n    ? (isFlat ? getAllKeysIn : getAllKeys)\n    : (isFlat ? keysIn : keys);\n\n  var props = isArr ? undefined : keysFunc(value);\n  arrayEach(props || value, function(subValue, key) {\n    if (props) {\n      key = subValue;\n      subValue = value[key];\n    }\n    // Recursively populate clone (susceptible to call stack limits).\n    assignValue(result, key, baseClone(subValue, bitmask, customizer, key, value, stack));\n  });\n  return result;\n}\n\nmodule.exports = baseClone;\n","var isObject = require('./isObject');\n\n/** Built-in value references. */\nvar objectCreate = Object.create;\n\n/**\n * The base implementation of `_.create` without support for assigning\n * properties to the created object.\n *\n * @private\n * @param {Object} proto The object to inherit from.\n * @returns {Object} Returns the new object.\n */\nvar baseCreate = (function() {\n  function object() {}\n  return function(proto) {\n    if (!isObject(proto)) {\n      return {};\n    }\n    if (objectCreate) {\n      return objectCreate(proto);\n    }\n    object.prototype = proto;\n    var result = new object;\n    object.prototype = undefined;\n    return result;\n  };\n}());\n\nmodule.exports = baseCreate;\n","var baseForOwn = require('./_baseForOwn'),\n    createBaseEach = require('./_createBaseEach');\n\n/**\n * The base implementation of `_.forEach` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n */\nvar baseEach = createBaseEach(baseForOwn);\n\nmodule.exports = baseEach;\n","var isSymbol = require('./isSymbol');\n\n/**\n * The base implementation of methods like `_.max` and `_.min` which accepts a\n * `comparator` to determine the extremum value.\n *\n * @private\n * @param {Array} array The array to iterate over.\n * @param {Function} iteratee The iteratee invoked per iteration.\n * @param {Function} comparator The comparator used to compare values.\n * @returns {*} Returns the extremum value.\n */\nfunction baseExtremum(array, iteratee, comparator) {\n  var index = -1,\n      length = array.length;\n\n  while (++index < length) {\n    var value = array[index],\n        current = iteratee(value);\n\n    if (current != null && (computed === undefined\n          ? (current === current && !isSymbol(current))\n          : comparator(current, computed)\n        )) {\n      var computed = current,\n          result = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseExtremum;\n","var baseEach = require('./_baseEach');\n\n/**\n * The base implementation of `_.filter` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} predicate The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n */\nfunction baseFilter(collection, predicate) {\n  var result = [];\n  baseEach(collection, function(value, index, collection) {\n    if (predicate(value, index, collection)) {\n      result.push(value);\n    }\n  });\n  return result;\n}\n\nmodule.exports = baseFilter;\n","/**\n * The base implementation of `_.findIndex` and `_.findLastIndex` without\n * support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} predicate The function invoked per iteration.\n * @param {number} fromIndex The index to search from.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseFindIndex(array, predicate, fromIndex, fromRight) {\n  var length = array.length,\n      index = fromIndex + (fromRight ? 1 : -1);\n\n  while ((fromRight ? index-- : ++index < length)) {\n    if (predicate(array[index], index, array)) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = baseFindIndex;\n","var arrayPush = require('./_arrayPush'),\n    isFlattenable = require('./_isFlattenable');\n\n/**\n * The base implementation of `_.flatten` with support for restricting flattening.\n *\n * @private\n * @param {Array} array The array to flatten.\n * @param {number} depth The maximum recursion depth.\n * @param {boolean} [predicate=isFlattenable] The function invoked per iteration.\n * @param {boolean} [isStrict] Restrict to values that pass `predicate` checks.\n * @param {Array} [result=[]] The initial result value.\n * @returns {Array} Returns the new flattened array.\n */\nfunction baseFlatten(array, depth, predicate, isStrict, result) {\n  var index = -1,\n      length = array.length;\n\n  predicate || (predicate = isFlattenable);\n  result || (result = []);\n\n  while (++index < length) {\n    var value = array[index];\n    if (depth > 0 && predicate(value)) {\n      if (depth > 1) {\n        // Recursively flatten arrays (susceptible to call stack limits).\n        baseFlatten(value, depth - 1, predicate, isStrict, result);\n      } else {\n        arrayPush(result, value);\n      }\n    } else if (!isStrict) {\n      result[result.length] = value;\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseFlatten;\n","var createBaseFor = require('./_createBaseFor');\n\n/**\n * The base implementation of `baseForOwn` which iterates over `object`\n * properties returned by `keysFunc` and invokes `iteratee` for each property.\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @returns {Object} Returns `object`.\n */\nvar baseFor = createBaseFor();\n\nmodule.exports = baseFor;\n","var baseFor = require('./_baseFor'),\n    keys = require('./keys');\n\n/**\n * The base implementation of `_.forOwn` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Object} Returns `object`.\n */\nfunction baseForOwn(object, iteratee) {\n  return object && baseFor(object, iteratee, keys);\n}\n\nmodule.exports = baseForOwn;\n","var castPath = require('./_castPath'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.get` without support for default values.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @returns {*} Returns the resolved value.\n */\nfunction baseGet(object, path) {\n  path = castPath(path, object);\n\n  var index = 0,\n      length = path.length;\n\n  while (object != null && index < length) {\n    object = object[toKey(path[index++])];\n  }\n  return (index && index == length) ? object : undefined;\n}\n\nmodule.exports = baseGet;\n","var arrayPush = require('./_arrayPush'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `getAllKeys` and `getAllKeysIn` which uses\n * `keysFunc` and `symbolsFunc` to get the enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Function} keysFunc The function to get the keys of `object`.\n * @param {Function} symbolsFunc The function to get the symbols of `object`.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction baseGetAllKeys(object, keysFunc, symbolsFunc) {\n  var result = keysFunc(object);\n  return isArray(object) ? result : arrayPush(result, symbolsFunc(object));\n}\n\nmodule.exports = baseGetAllKeys;\n","var Symbol = require('./_Symbol'),\n    getRawTag = require('./_getRawTag'),\n    objectToString = require('./_objectToString');\n\n/** `Object#toString` result references. */\nvar nullTag = '[object Null]',\n    undefinedTag = '[object Undefined]';\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * The base implementation of `getTag` without fallbacks for buggy environments.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nfunction baseGetTag(value) {\n  if (value == null) {\n    return value === undefined ? undefinedTag : nullTag;\n  }\n  return (symToStringTag && symToStringTag in Object(value))\n    ? getRawTag(value)\n    : objectToString(value);\n}\n\nmodule.exports = baseGetTag;\n","/**\n * The base implementation of `_.gt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is greater than `other`,\n *  else `false`.\n */\nfunction baseGt(value, other) {\n  return value > other;\n}\n\nmodule.exports = baseGt;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.has` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHas(object, key) {\n  return object != null && hasOwnProperty.call(object, key);\n}\n\nmodule.exports = baseHas;\n","/**\n * The base implementation of `_.hasIn` without support for deep paths.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {Array|string} key The key to check.\n * @returns {boolean} Returns `true` if `key` exists, else `false`.\n */\nfunction baseHasIn(object, key) {\n  return object != null && key in Object(object);\n}\n\nmodule.exports = baseHasIn;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIsNaN = require('./_baseIsNaN'),\n    strictIndexOf = require('./_strictIndexOf');\n\n/**\n * The base implementation of `_.indexOf` without `fromIndex` bounds checks.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction baseIndexOf(array, value, fromIndex) {\n  return value === value\n    ? strictIndexOf(array, value, fromIndex)\n    : baseFindIndex(array, baseIsNaN, fromIndex);\n}\n\nmodule.exports = baseIndexOf;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]';\n\n/**\n * The base implementation of `_.isArguments`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n */\nfunction baseIsArguments(value) {\n  return isObjectLike(value) && baseGetTag(value) == argsTag;\n}\n\nmodule.exports = baseIsArguments;\n","var baseIsEqualDeep = require('./_baseIsEqualDeep'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * The base implementation of `_.isEqual` which supports partial comparisons\n * and tracks traversed objects.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @param {boolean} bitmask The bitmask flags.\n *  1 - Unordered comparison\n *  2 - Partial comparison\n * @param {Function} [customizer] The function to customize comparisons.\n * @param {Object} [stack] Tracks traversed `value` and `other` objects.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n */\nfunction baseIsEqual(value, other, bitmask, customizer, stack) {\n  if (value === other) {\n    return true;\n  }\n  if (value == null || other == null || (!isObjectLike(value) && !isObjectLike(other))) {\n    return value !== value && other !== other;\n  }\n  return baseIsEqualDeep(value, other, bitmask, customizer, baseIsEqual, stack);\n}\n\nmodule.exports = baseIsEqual;\n","var Stack = require('./_Stack'),\n    equalArrays = require('./_equalArrays'),\n    equalByTag = require('./_equalByTag'),\n    equalObjects = require('./_equalObjects'),\n    getTag = require('./_getTag'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isTypedArray = require('./isTypedArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqual` for arrays and objects which performs\n * deep comparisons and tracks traversed objects enabling objects with circular\n * references to be compared.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} [stack] Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction baseIsEqualDeep(object, other, bitmask, customizer, equalFunc, stack) {\n  var objIsArr = isArray(object),\n      othIsArr = isArray(other),\n      objTag = objIsArr ? arrayTag : getTag(object),\n      othTag = othIsArr ? arrayTag : getTag(other);\n\n  objTag = objTag == argsTag ? objectTag : objTag;\n  othTag = othTag == argsTag ? objectTag : othTag;\n\n  var objIsObj = objTag == objectTag,\n      othIsObj = othTag == objectTag,\n      isSameTag = objTag == othTag;\n\n  if (isSameTag && isBuffer(object)) {\n    if (!isBuffer(other)) {\n      return false;\n    }\n    objIsArr = true;\n    objIsObj = false;\n  }\n  if (isSameTag && !objIsObj) {\n    stack || (stack = new Stack);\n    return (objIsArr || isTypedArray(object))\n      ? equalArrays(object, other, bitmask, customizer, equalFunc, stack)\n      : equalByTag(object, other, objTag, bitmask, customizer, equalFunc, stack);\n  }\n  if (!(bitmask & COMPARE_PARTIAL_FLAG)) {\n    var objIsWrapped = objIsObj && hasOwnProperty.call(object, '__wrapped__'),\n        othIsWrapped = othIsObj && hasOwnProperty.call(other, '__wrapped__');\n\n    if (objIsWrapped || othIsWrapped) {\n      var objUnwrapped = objIsWrapped ? object.value() : object,\n          othUnwrapped = othIsWrapped ? other.value() : other;\n\n      stack || (stack = new Stack);\n      return equalFunc(objUnwrapped, othUnwrapped, bitmask, customizer, stack);\n    }\n  }\n  if (!isSameTag) {\n    return false;\n  }\n  stack || (stack = new Stack);\n  return equalObjects(object, other, bitmask, customizer, equalFunc, stack);\n}\n\nmodule.exports = baseIsEqualDeep;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]';\n\n/**\n * The base implementation of `_.isMap` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n */\nfunction baseIsMap(value) {\n  return isObjectLike(value) && getTag(value) == mapTag;\n}\n\nmodule.exports = baseIsMap;\n","var Stack = require('./_Stack'),\n    baseIsEqual = require('./_baseIsEqual');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.isMatch` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The object to inspect.\n * @param {Object} source The object of property values to match.\n * @param {Array} matchData The property names, values, and compare flags to match.\n * @param {Function} [customizer] The function to customize comparisons.\n * @returns {boolean} Returns `true` if `object` is a match, else `false`.\n */\nfunction baseIsMatch(object, source, matchData, customizer) {\n  var index = matchData.length,\n      length = index,\n      noCustomizer = !customizer;\n\n  if (object == null) {\n    return !length;\n  }\n  object = Object(object);\n  while (index--) {\n    var data = matchData[index];\n    if ((noCustomizer && data[2])\n          ? data[1] !== object[data[0]]\n          : !(data[0] in object)\n        ) {\n      return false;\n    }\n  }\n  while (++index < length) {\n    data = matchData[index];\n    var key = data[0],\n        objValue = object[key],\n        srcValue = data[1];\n\n    if (noCustomizer && data[2]) {\n      if (objValue === undefined && !(key in object)) {\n        return false;\n      }\n    } else {\n      var stack = new Stack;\n      if (customizer) {\n        var result = customizer(objValue, srcValue, key, object, source, stack);\n      }\n      if (!(result === undefined\n            ? baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG, customizer, stack)\n            : result\n          )) {\n        return false;\n      }\n    }\n  }\n  return true;\n}\n\nmodule.exports = baseIsMatch;\n","/**\n * The base implementation of `_.isNaN` without support for number objects.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `NaN`, else `false`.\n */\nfunction baseIsNaN(value) {\n  return value !== value;\n}\n\nmodule.exports = baseIsNaN;\n","var isFunction = require('./isFunction'),\n    isMasked = require('./_isMasked'),\n    isObject = require('./isObject'),\n    toSource = require('./_toSource');\n\n/**\n * Used to match `RegExp`\n * [syntax characters](http://ecma-international.org/ecma-262/7.0/#sec-patterns).\n */\nvar reRegExpChar = /[\\\\^$.*+?()[\\]{}|]/g;\n\n/** Used to detect host constructors (Safari). */\nvar reIsHostCtor = /^\\[object .+?Constructor\\]$/;\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to detect if a method is native. */\nvar reIsNative = RegExp('^' +\n  funcToString.call(hasOwnProperty).replace(reRegExpChar, '\\\\$&')\n  .replace(/hasOwnProperty|(function).*?(?=\\\\\\()| for .+?(?=\\\\\\])/g, '$1.*?') + '$'\n);\n\n/**\n * The base implementation of `_.isNative` without bad shim checks.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a native function,\n *  else `false`.\n */\nfunction baseIsNative(value) {\n  if (!isObject(value) || isMasked(value)) {\n    return false;\n  }\n  var pattern = isFunction(value) ? reIsNative : reIsHostCtor;\n  return pattern.test(toSource(value));\n}\n\nmodule.exports = baseIsNative;\n","var getTag = require('./_getTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar setTag = '[object Set]';\n\n/**\n * The base implementation of `_.isSet` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n */\nfunction baseIsSet(value) {\n  return isObjectLike(value) && getTag(value) == setTag;\n}\n\nmodule.exports = baseIsSet;\n","var baseGetTag = require('./_baseGetTag'),\n    isLength = require('./isLength'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar argsTag = '[object Arguments]',\n    arrayTag = '[object Array]',\n    boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    funcTag = '[object Function]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    objectTag = '[object Object]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    weakMapTag = '[object WeakMap]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/** Used to identify `toStringTag` values of typed arrays. */\nvar typedArrayTags = {};\ntypedArrayTags[float32Tag] = typedArrayTags[float64Tag] =\ntypedArrayTags[int8Tag] = typedArrayTags[int16Tag] =\ntypedArrayTags[int32Tag] = typedArrayTags[uint8Tag] =\ntypedArrayTags[uint8ClampedTag] = typedArrayTags[uint16Tag] =\ntypedArrayTags[uint32Tag] = true;\ntypedArrayTags[argsTag] = typedArrayTags[arrayTag] =\ntypedArrayTags[arrayBufferTag] = typedArrayTags[boolTag] =\ntypedArrayTags[dataViewTag] = typedArrayTags[dateTag] =\ntypedArrayTags[errorTag] = typedArrayTags[funcTag] =\ntypedArrayTags[mapTag] = typedArrayTags[numberTag] =\ntypedArrayTags[objectTag] = typedArrayTags[regexpTag] =\ntypedArrayTags[setTag] = typedArrayTags[stringTag] =\ntypedArrayTags[weakMapTag] = false;\n\n/**\n * The base implementation of `_.isTypedArray` without Node.js optimizations.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n */\nfunction baseIsTypedArray(value) {\n  return isObjectLike(value) &&\n    isLength(value.length) && !!typedArrayTags[baseGetTag(value)];\n}\n\nmodule.exports = baseIsTypedArray;\n","var baseMatches = require('./_baseMatches'),\n    baseMatchesProperty = require('./_baseMatchesProperty'),\n    identity = require('./identity'),\n    isArray = require('./isArray'),\n    property = require('./property');\n\n/**\n * The base implementation of `_.iteratee`.\n *\n * @private\n * @param {*} [value=_.identity] The value to convert to an iteratee.\n * @returns {Function} Returns the iteratee.\n */\nfunction baseIteratee(value) {\n  // Don't store the `typeof` result in a variable to avoid a JIT bug in Safari 9.\n  // See https://bugs.webkit.org/show_bug.cgi?id=156034 for more details.\n  if (typeof value == 'function') {\n    return value;\n  }\n  if (value == null) {\n    return identity;\n  }\n  if (typeof value == 'object') {\n    return isArray(value)\n      ? baseMatchesProperty(value[0], value[1])\n      : baseMatches(value);\n  }\n  return property(value);\n}\n\nmodule.exports = baseIteratee;\n","var isPrototype = require('./_isPrototype'),\n    nativeKeys = require('./_nativeKeys');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keys` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeys(object) {\n  if (!isPrototype(object)) {\n    return nativeKeys(object);\n  }\n  var result = [];\n  for (var key in Object(object)) {\n    if (hasOwnProperty.call(object, key) && key != 'constructor') {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeys;\n","var isObject = require('./isObject'),\n    isPrototype = require('./_isPrototype'),\n    nativeKeysIn = require('./_nativeKeysIn');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * The base implementation of `_.keysIn` which doesn't treat sparse arrays as dense.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction baseKeysIn(object) {\n  if (!isObject(object)) {\n    return nativeKeysIn(object);\n  }\n  var isProto = isPrototype(object),\n      result = [];\n\n  for (var key in object) {\n    if (!(key == 'constructor' && (isProto || !hasOwnProperty.call(object, key)))) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseKeysIn;\n","/**\n * The base implementation of `_.lt` which doesn't coerce arguments.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if `value` is less than `other`,\n *  else `false`.\n */\nfunction baseLt(value, other) {\n  return value < other;\n}\n\nmodule.exports = baseLt;\n","var baseEach = require('./_baseEach'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * The base implementation of `_.map` without support for iteratee shorthands.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n */\nfunction baseMap(collection, iteratee) {\n  var index = -1,\n      result = isArrayLike(collection) ? Array(collection.length) : [];\n\n  baseEach(collection, function(value, key, collection) {\n    result[++index] = iteratee(value, key, collection);\n  });\n  return result;\n}\n\nmodule.exports = baseMap;\n","var baseIsMatch = require('./_baseIsMatch'),\n    getMatchData = require('./_getMatchData'),\n    matchesStrictComparable = require('./_matchesStrictComparable');\n\n/**\n * The base implementation of `_.matches` which doesn't clone `source`.\n *\n * @private\n * @param {Object} source The object of property values to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatches(source) {\n  var matchData = getMatchData(source);\n  if (matchData.length == 1 && matchData[0][2]) {\n    return matchesStrictComparable(matchData[0][0], matchData[0][1]);\n  }\n  return function(object) {\n    return object === source || baseIsMatch(object, source, matchData);\n  };\n}\n\nmodule.exports = baseMatches;\n","var baseIsEqual = require('./_baseIsEqual'),\n    get = require('./get'),\n    hasIn = require('./hasIn'),\n    isKey = require('./_isKey'),\n    isStrictComparable = require('./_isStrictComparable'),\n    matchesStrictComparable = require('./_matchesStrictComparable'),\n    toKey = require('./_toKey');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * The base implementation of `_.matchesProperty` which doesn't clone `srcValue`.\n *\n * @private\n * @param {string} path The path of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction baseMatchesProperty(path, srcValue) {\n  if (isKey(path) && isStrictComparable(srcValue)) {\n    return matchesStrictComparable(toKey(path), srcValue);\n  }\n  return function(object) {\n    var objValue = get(object, path);\n    return (objValue === undefined && objValue === srcValue)\n      ? hasIn(object, path)\n      : baseIsEqual(srcValue, objValue, COMPARE_PARTIAL_FLAG | COMPARE_UNORDERED_FLAG);\n  };\n}\n\nmodule.exports = baseMatchesProperty;\n","var Stack = require('./_Stack'),\n    assignMergeValue = require('./_assignMergeValue'),\n    baseFor = require('./_baseFor'),\n    baseMergeDeep = require('./_baseMergeDeep'),\n    isObject = require('./isObject'),\n    keysIn = require('./keysIn'),\n    safeGet = require('./_safeGet');\n\n/**\n * The base implementation of `_.merge` without support for multiple sources.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} [customizer] The function to customize merged values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMerge(object, source, srcIndex, customizer, stack) {\n  if (object === source) {\n    return;\n  }\n  baseFor(source, function(srcValue, key) {\n    stack || (stack = new Stack);\n    if (isObject(srcValue)) {\n      baseMergeDeep(object, source, key, srcIndex, baseMerge, customizer, stack);\n    }\n    else {\n      var newValue = customizer\n        ? customizer(safeGet(object, key), srcValue, (key + ''), object, source, stack)\n        : undefined;\n\n      if (newValue === undefined) {\n        newValue = srcValue;\n      }\n      assignMergeValue(object, key, newValue);\n    }\n  }, keysIn);\n}\n\nmodule.exports = baseMerge;\n","var assignMergeValue = require('./_assignMergeValue'),\n    cloneBuffer = require('./_cloneBuffer'),\n    cloneTypedArray = require('./_cloneTypedArray'),\n    copyArray = require('./_copyArray'),\n    initCloneObject = require('./_initCloneObject'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isArrayLikeObject = require('./isArrayLikeObject'),\n    isBuffer = require('./isBuffer'),\n    isFunction = require('./isFunction'),\n    isObject = require('./isObject'),\n    isPlainObject = require('./isPlainObject'),\n    isTypedArray = require('./isTypedArray'),\n    safeGet = require('./_safeGet'),\n    toPlainObject = require('./toPlainObject');\n\n/**\n * A specialized version of `baseMerge` for arrays and objects which performs\n * deep merges and tracks traversed objects enabling objects with circular\n * references to be merged.\n *\n * @private\n * @param {Object} object The destination object.\n * @param {Object} source The source object.\n * @param {string} key The key of the value to merge.\n * @param {number} srcIndex The index of `source`.\n * @param {Function} mergeFunc The function to merge values.\n * @param {Function} [customizer] The function to customize assigned values.\n * @param {Object} [stack] Tracks traversed source values and their merged\n *  counterparts.\n */\nfunction baseMergeDeep(object, source, key, srcIndex, mergeFunc, customizer, stack) {\n  var objValue = safeGet(object, key),\n      srcValue = safeGet(source, key),\n      stacked = stack.get(srcValue);\n\n  if (stacked) {\n    assignMergeValue(object, key, stacked);\n    return;\n  }\n  var newValue = customizer\n    ? customizer(objValue, srcValue, (key + ''), object, source, stack)\n    : undefined;\n\n  var isCommon = newValue === undefined;\n\n  if (isCommon) {\n    var isArr = isArray(srcValue),\n        isBuff = !isArr && isBuffer(srcValue),\n        isTyped = !isArr && !isBuff && isTypedArray(srcValue);\n\n    newValue = srcValue;\n    if (isArr || isBuff || isTyped) {\n      if (isArray(objValue)) {\n        newValue = objValue;\n      }\n      else if (isArrayLikeObject(objValue)) {\n        newValue = copyArray(objValue);\n      }\n      else if (isBuff) {\n        isCommon = false;\n        newValue = cloneBuffer(srcValue, true);\n      }\n      else if (isTyped) {\n        isCommon = false;\n        newValue = cloneTypedArray(srcValue, true);\n      }\n      else {\n        newValue = [];\n      }\n    }\n    else if (isPlainObject(srcValue) || isArguments(srcValue)) {\n      newValue = objValue;\n      if (isArguments(objValue)) {\n        newValue = toPlainObject(objValue);\n      }\n      else if (!isObject(objValue) || isFunction(objValue)) {\n        newValue = initCloneObject(srcValue);\n      }\n    }\n    else {\n      isCommon = false;\n    }\n  }\n  if (isCommon) {\n    // Recursively merge objects and arrays (susceptible to call stack limits).\n    stack.set(srcValue, newValue);\n    mergeFunc(newValue, srcValue, srcIndex, customizer, stack);\n    stack['delete'](srcValue);\n  }\n  assignMergeValue(object, key, newValue);\n}\n\nmodule.exports = baseMergeDeep;\n","var arrayMap = require('./_arrayMap'),\n    baseGet = require('./_baseGet'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    baseSortBy = require('./_baseSortBy'),\n    baseUnary = require('./_baseUnary'),\n    compareMultiple = require('./_compareMultiple'),\n    identity = require('./identity'),\n    isArray = require('./isArray');\n\n/**\n * The base implementation of `_.orderBy` without param guards.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function[]|Object[]|string[]} iteratees The iteratees to sort by.\n * @param {string[]} orders The sort orders of `iteratees`.\n * @returns {Array} Returns the new sorted array.\n */\nfunction baseOrderBy(collection, iteratees, orders) {\n  if (iteratees.length) {\n    iteratees = arrayMap(iteratees, function(iteratee) {\n      if (isArray(iteratee)) {\n        return function(value) {\n          return baseGet(value, iteratee.length === 1 ? iteratee[0] : iteratee);\n        }\n      }\n      return iteratee;\n    });\n  } else {\n    iteratees = [identity];\n  }\n\n  var index = -1;\n  iteratees = arrayMap(iteratees, baseUnary(baseIteratee));\n\n  var result = baseMap(collection, function(value, key, collection) {\n    var criteria = arrayMap(iteratees, function(iteratee) {\n      return iteratee(value);\n    });\n    return { 'criteria': criteria, 'index': ++index, 'value': value };\n  });\n\n  return baseSortBy(result, function(object, other) {\n    return compareMultiple(object, other, orders);\n  });\n}\n\nmodule.exports = baseOrderBy;\n","var basePickBy = require('./_basePickBy'),\n    hasIn = require('./hasIn');\n\n/**\n * The base implementation of `_.pick` without support for individual\n * property identifiers.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @returns {Object} Returns the new object.\n */\nfunction basePick(object, paths) {\n  return basePickBy(object, paths, function(value, path) {\n    return hasIn(object, path);\n  });\n}\n\nmodule.exports = basePick;\n","var baseGet = require('./_baseGet'),\n    baseSet = require('./_baseSet'),\n    castPath = require('./_castPath');\n\n/**\n * The base implementation of  `_.pickBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Object} object The source object.\n * @param {string[]} paths The property paths to pick.\n * @param {Function} predicate The function invoked per property.\n * @returns {Object} Returns the new object.\n */\nfunction basePickBy(object, paths, predicate) {\n  var index = -1,\n      length = paths.length,\n      result = {};\n\n  while (++index < length) {\n    var path = paths[index],\n        value = baseGet(object, path);\n\n    if (predicate(value, path)) {\n      baseSet(result, castPath(path, object), value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = basePickBy;\n","/**\n * The base implementation of `_.property` without support for deep paths.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction baseProperty(key) {\n  return function(object) {\n    return object == null ? undefined : object[key];\n  };\n}\n\nmodule.exports = baseProperty;\n","var baseGet = require('./_baseGet');\n\n/**\n * A specialized version of `baseProperty` which supports deep paths.\n *\n * @private\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n */\nfunction basePropertyDeep(path) {\n  return function(object) {\n    return baseGet(object, path);\n  };\n}\n\nmodule.exports = basePropertyDeep;\n","/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeCeil = Math.ceil,\n    nativeMax = Math.max;\n\n/**\n * The base implementation of `_.range` and `_.rangeRight` which doesn't\n * coerce arguments.\n *\n * @private\n * @param {number} start The start of the range.\n * @param {number} end The end of the range.\n * @param {number} step The value to increment or decrement by.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Array} Returns the range of numbers.\n */\nfunction baseRange(start, end, step, fromRight) {\n  var index = -1,\n      length = nativeMax(nativeCeil((end - start) / (step || 1)), 0),\n      result = Array(length);\n\n  while (length--) {\n    result[fromRight ? length : ++index] = start;\n    start += step;\n  }\n  return result;\n}\n\nmodule.exports = baseRange;\n","/**\n * The base implementation of `_.reduce` and `_.reduceRight`, without support\n * for iteratee shorthands, which iterates over `collection` using `eachFunc`.\n *\n * @private\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} iteratee The function invoked per iteration.\n * @param {*} accumulator The initial value.\n * @param {boolean} initAccum Specify using the first or last element of\n *  `collection` as the initial value.\n * @param {Function} eachFunc The function to iterate over `collection`.\n * @returns {*} Returns the accumulated value.\n */\nfunction baseReduce(collection, iteratee, accumulator, initAccum, eachFunc) {\n  eachFunc(collection, function(value, index, collection) {\n    accumulator = initAccum\n      ? (initAccum = false, value)\n      : iteratee(accumulator, value, index, collection);\n  });\n  return accumulator;\n}\n\nmodule.exports = baseReduce;\n","var identity = require('./identity'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * The base implementation of `_.rest` which doesn't validate or coerce arguments.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @returns {Function} Returns the new function.\n */\nfunction baseRest(func, start) {\n  return setToString(overRest(func, start, identity), func + '');\n}\n\nmodule.exports = baseRest;\n","var assignValue = require('./_assignValue'),\n    castPath = require('./_castPath'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject'),\n    toKey = require('./_toKey');\n\n/**\n * The base implementation of `_.set`.\n *\n * @private\n * @param {Object} object The object to modify.\n * @param {Array|string} path The path of the property to set.\n * @param {*} value The value to set.\n * @param {Function} [customizer] The function to customize path creation.\n * @returns {Object} Returns `object`.\n */\nfunction baseSet(object, path, value, customizer) {\n  if (!isObject(object)) {\n    return object;\n  }\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      lastIndex = length - 1,\n      nested = object;\n\n  while (nested != null && ++index < length) {\n    var key = toKey(path[index]),\n        newValue = value;\n\n    if (key === '__proto__' || key === 'constructor' || key === 'prototype') {\n      return object;\n    }\n\n    if (index != lastIndex) {\n      var objValue = nested[key];\n      newValue = customizer ? customizer(objValue, key, nested) : undefined;\n      if (newValue === undefined) {\n        newValue = isObject(objValue)\n          ? objValue\n          : (isIndex(path[index + 1]) ? [] : {});\n      }\n    }\n    assignValue(nested, key, newValue);\n    nested = nested[key];\n  }\n  return object;\n}\n\nmodule.exports = baseSet;\n","var constant = require('./constant'),\n    defineProperty = require('./_defineProperty'),\n    identity = require('./identity');\n\n/**\n * The base implementation of `setToString` without support for hot loop shorting.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar baseSetToString = !defineProperty ? identity : function(func, string) {\n  return defineProperty(func, 'toString', {\n    'configurable': true,\n    'enumerable': false,\n    'value': constant(string),\n    'writable': true\n  });\n};\n\nmodule.exports = baseSetToString;\n","/**\n * The base implementation of `_.sortBy` which uses `comparer` to define the\n * sort order of `array` and replaces criteria objects with their corresponding\n * values.\n *\n * @private\n * @param {Array} array The array to sort.\n * @param {Function} comparer The function to define sort order.\n * @returns {Array} Returns `array`.\n */\nfunction baseSortBy(array, comparer) {\n  var length = array.length;\n\n  array.sort(comparer);\n  while (length--) {\n    array[length] = array[length].value;\n  }\n  return array;\n}\n\nmodule.exports = baseSortBy;\n","/**\n * The base implementation of `_.times` without support for iteratee shorthands\n * or max array length checks.\n *\n * @private\n * @param {number} n The number of times to invoke `iteratee`.\n * @param {Function} iteratee The function invoked per iteration.\n * @returns {Array} Returns the array of results.\n */\nfunction baseTimes(n, iteratee) {\n  var index = -1,\n      result = Array(n);\n\n  while (++index < n) {\n    result[index] = iteratee(index);\n  }\n  return result;\n}\n\nmodule.exports = baseTimes;\n","var Symbol = require('./_Symbol'),\n    arrayMap = require('./_arrayMap'),\n    isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolToString = symbolProto ? symbolProto.toString : undefined;\n\n/**\n * The base implementation of `_.toString` which doesn't convert nullish\n * values to empty strings.\n *\n * @private\n * @param {*} value The value to process.\n * @returns {string} Returns the string.\n */\nfunction baseToString(value) {\n  // Exit early for strings to avoid a performance hit in some environments.\n  if (typeof value == 'string') {\n    return value;\n  }\n  if (isArray(value)) {\n    // Recursively convert values (susceptible to call stack limits).\n    return arrayMap(value, baseToString) + '';\n  }\n  if (isSymbol(value)) {\n    return symbolToString ? symbolToString.call(value) : '';\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = baseToString;\n","var trimmedEndIndex = require('./_trimmedEndIndex');\n\n/** Used to match leading whitespace. */\nvar reTrimStart = /^\\s+/;\n\n/**\n * The base implementation of `_.trim`.\n *\n * @private\n * @param {string} string The string to trim.\n * @returns {string} Returns the trimmed string.\n */\nfunction baseTrim(string) {\n  return string\n    ? string.slice(0, trimmedEndIndex(string) + 1).replace(reTrimStart, '')\n    : string;\n}\n\nmodule.exports = baseTrim;\n","/**\n * The base implementation of `_.unary` without support for storing metadata.\n *\n * @private\n * @param {Function} func The function to cap arguments for.\n * @returns {Function} Returns the new capped function.\n */\nfunction baseUnary(func) {\n  return function(value) {\n    return func(value);\n  };\n}\n\nmodule.exports = baseUnary;\n","var SetCache = require('./_SetCache'),\n    arrayIncludes = require('./_arrayIncludes'),\n    arrayIncludesWith = require('./_arrayIncludesWith'),\n    cacheHas = require('./_cacheHas'),\n    createSet = require('./_createSet'),\n    setToArray = require('./_setToArray');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * The base implementation of `_.uniqBy` without support for iteratee shorthands.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {Function} [iteratee] The iteratee invoked per element.\n * @param {Function} [comparator] The comparator invoked per element.\n * @returns {Array} Returns the new duplicate free array.\n */\nfunction baseUniq(array, iteratee, comparator) {\n  var index = -1,\n      includes = arrayIncludes,\n      length = array.length,\n      isCommon = true,\n      result = [],\n      seen = result;\n\n  if (comparator) {\n    isCommon = false;\n    includes = arrayIncludesWith;\n  }\n  else if (length >= LARGE_ARRAY_SIZE) {\n    var set = iteratee ? null : createSet(array);\n    if (set) {\n      return setToArray(set);\n    }\n    isCommon = false;\n    includes = cacheHas;\n    seen = new SetCache;\n  }\n  else {\n    seen = iteratee ? [] : result;\n  }\n  outer:\n  while (++index < length) {\n    var value = array[index],\n        computed = iteratee ? iteratee(value) : value;\n\n    value = (comparator || value !== 0) ? value : 0;\n    if (isCommon && computed === computed) {\n      var seenIndex = seen.length;\n      while (seenIndex--) {\n        if (seen[seenIndex] === computed) {\n          continue outer;\n        }\n      }\n      if (iteratee) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n    else if (!includes(seen, computed, comparator)) {\n      if (seen !== result) {\n        seen.push(computed);\n      }\n      result.push(value);\n    }\n  }\n  return result;\n}\n\nmodule.exports = baseUniq;\n","var arrayMap = require('./_arrayMap');\n\n/**\n * The base implementation of `_.values` and `_.valuesIn` which creates an\n * array of `object` property values corresponding to the property names\n * of `props`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array} props The property names to get values for.\n * @returns {Object} Returns the array of property values.\n */\nfunction baseValues(object, props) {\n  return arrayMap(props, function(key) {\n    return object[key];\n  });\n}\n\nmodule.exports = baseValues;\n","/**\n * This base implementation of `_.zipObject` which assigns values using `assignFunc`.\n *\n * @private\n * @param {Array} props The property identifiers.\n * @param {Array} values The property values.\n * @param {Function} assignFunc The function to assign values.\n * @returns {Object} Returns the new object.\n */\nfunction baseZipObject(props, values, assignFunc) {\n  var index = -1,\n      length = props.length,\n      valsLength = values.length,\n      result = {};\n\n  while (++index < length) {\n    var value = index < valsLength ? values[index] : undefined;\n    assignFunc(result, props[index], value);\n  }\n  return result;\n}\n\nmodule.exports = baseZipObject;\n","/**\n * Checks if a `cache` value for `key` exists.\n *\n * @private\n * @param {Object} cache The cache to query.\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction cacheHas(cache, key) {\n  return cache.has(key);\n}\n\nmodule.exports = cacheHas;\n","var identity = require('./identity');\n\n/**\n * Casts `value` to `identity` if it's not a function.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {Function} Returns cast function.\n */\nfunction castFunction(value) {\n  return typeof value == 'function' ? value : identity;\n}\n\nmodule.exports = castFunction;\n","var isArray = require('./isArray'),\n    isKey = require('./_isKey'),\n    stringToPath = require('./_stringToPath'),\n    toString = require('./toString');\n\n/**\n * Casts `value` to a path array if it's not one.\n *\n * @private\n * @param {*} value The value to inspect.\n * @param {Object} [object] The object to query keys on.\n * @returns {Array} Returns the cast property path array.\n */\nfunction castPath(value, object) {\n  if (isArray(value)) {\n    return value;\n  }\n  return isKey(value, object) ? [value] : stringToPath(toString(value));\n}\n\nmodule.exports = castPath;\n","var Uint8Array = require('./_Uint8Array');\n\n/**\n * Creates a clone of `arrayBuffer`.\n *\n * @private\n * @param {ArrayBuffer} arrayBuffer The array buffer to clone.\n * @returns {ArrayBuffer} Returns the cloned array buffer.\n */\nfunction cloneArrayBuffer(arrayBuffer) {\n  var result = new arrayBuffer.constructor(arrayBuffer.byteLength);\n  new Uint8Array(result).set(new Uint8Array(arrayBuffer));\n  return result;\n}\n\nmodule.exports = cloneArrayBuffer;\n","var root = require('./_root');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined,\n    allocUnsafe = Buffer ? Buffer.allocUnsafe : undefined;\n\n/**\n * Creates a clone of  `buffer`.\n *\n * @private\n * @param {Buffer} buffer The buffer to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Buffer} Returns the cloned buffer.\n */\nfunction cloneBuffer(buffer, isDeep) {\n  if (isDeep) {\n    return buffer.slice();\n  }\n  var length = buffer.length,\n      result = allocUnsafe ? allocUnsafe(length) : new buffer.constructor(length);\n\n  buffer.copy(result);\n  return result;\n}\n\nmodule.exports = cloneBuffer;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `dataView`.\n *\n * @private\n * @param {Object} dataView The data view to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned data view.\n */\nfunction cloneDataView(dataView, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(dataView.buffer) : dataView.buffer;\n  return new dataView.constructor(buffer, dataView.byteOffset, dataView.byteLength);\n}\n\nmodule.exports = cloneDataView;\n","/** Used to match `RegExp` flags from their coerced string values. */\nvar reFlags = /\\w*$/;\n\n/**\n * Creates a clone of `regexp`.\n *\n * @private\n * @param {Object} regexp The regexp to clone.\n * @returns {Object} Returns the cloned regexp.\n */\nfunction cloneRegExp(regexp) {\n  var result = new regexp.constructor(regexp.source, reFlags.exec(regexp));\n  result.lastIndex = regexp.lastIndex;\n  return result;\n}\n\nmodule.exports = cloneRegExp;\n","var Symbol = require('./_Symbol');\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * Creates a clone of the `symbol` object.\n *\n * @private\n * @param {Object} symbol The symbol object to clone.\n * @returns {Object} Returns the cloned symbol object.\n */\nfunction cloneSymbol(symbol) {\n  return symbolValueOf ? Object(symbolValueOf.call(symbol)) : {};\n}\n\nmodule.exports = cloneSymbol;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer');\n\n/**\n * Creates a clone of `typedArray`.\n *\n * @private\n * @param {Object} typedArray The typed array to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the cloned typed array.\n */\nfunction cloneTypedArray(typedArray, isDeep) {\n  var buffer = isDeep ? cloneArrayBuffer(typedArray.buffer) : typedArray.buffer;\n  return new typedArray.constructor(buffer, typedArray.byteOffset, typedArray.length);\n}\n\nmodule.exports = cloneTypedArray;\n","var isSymbol = require('./isSymbol');\n\n/**\n * Compares values to sort them in ascending order.\n *\n * @private\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {number} Returns the sort order indicator for `value`.\n */\nfunction compareAscending(value, other) {\n  if (value !== other) {\n    var valIsDefined = value !== undefined,\n        valIsNull = value === null,\n        valIsReflexive = value === value,\n        valIsSymbol = isSymbol(value);\n\n    var othIsDefined = other !== undefined,\n        othIsNull = other === null,\n        othIsReflexive = other === other,\n        othIsSymbol = isSymbol(other);\n\n    if ((!othIsNull && !othIsSymbol && !valIsSymbol && value > other) ||\n        (valIsSymbol && othIsDefined && othIsReflexive && !othIsNull && !othIsSymbol) ||\n        (valIsNull && othIsDefined && othIsReflexive) ||\n        (!valIsDefined && othIsReflexive) ||\n        !valIsReflexive) {\n      return 1;\n    }\n    if ((!valIsNull && !valIsSymbol && !othIsSymbol && value < other) ||\n        (othIsSymbol && valIsDefined && valIsReflexive && !valIsNull && !valIsSymbol) ||\n        (othIsNull && valIsDefined && valIsReflexive) ||\n        (!othIsDefined && valIsReflexive) ||\n        !othIsReflexive) {\n      return -1;\n    }\n  }\n  return 0;\n}\n\nmodule.exports = compareAscending;\n","var compareAscending = require('./_compareAscending');\n\n/**\n * Used by `_.orderBy` to compare multiple properties of a value to another\n * and stable sort them.\n *\n * If `orders` is unspecified, all values are sorted in ascending order. Otherwise,\n * specify an order of \"desc\" for descending or \"asc\" for ascending sort order\n * of corresponding values.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {boolean[]|string[]} orders The order to sort by for each property.\n * @returns {number} Returns the sort order indicator for `object`.\n */\nfunction compareMultiple(object, other, orders) {\n  var index = -1,\n      objCriteria = object.criteria,\n      othCriteria = other.criteria,\n      length = objCriteria.length,\n      ordersLength = orders.length;\n\n  while (++index < length) {\n    var result = compareAscending(objCriteria[index], othCriteria[index]);\n    if (result) {\n      if (index >= ordersLength) {\n        return result;\n      }\n      var order = orders[index];\n      return result * (order == 'desc' ? -1 : 1);\n    }\n  }\n  // Fixes an `Array#sort` bug in the JS engine embedded in Adobe applications\n  // that causes it, under certain circumstances, to provide the same value for\n  // `object` and `other`. See https://github.com/jashkenas/underscore/pull/1247\n  // for more details.\n  //\n  // This also ensures a stable sort in V8 and other engines.\n  // See https://bugs.chromium.org/p/v8/issues/detail?id=90 for more details.\n  return object.index - other.index;\n}\n\nmodule.exports = compareMultiple;\n","/**\n * Copies the values of `source` to `array`.\n *\n * @private\n * @param {Array} source The array to copy values from.\n * @param {Array} [array=[]] The array to copy values to.\n * @returns {Array} Returns `array`.\n */\nfunction copyArray(source, array) {\n  var index = -1,\n      length = source.length;\n\n  array || (array = Array(length));\n  while (++index < length) {\n    array[index] = source[index];\n  }\n  return array;\n}\n\nmodule.exports = copyArray;\n","var assignValue = require('./_assignValue'),\n    baseAssignValue = require('./_baseAssignValue');\n\n/**\n * Copies properties of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy properties from.\n * @param {Array} props The property identifiers to copy.\n * @param {Object} [object={}] The object to copy properties to.\n * @param {Function} [customizer] The function to customize copied values.\n * @returns {Object} Returns `object`.\n */\nfunction copyObject(source, props, object, customizer) {\n  var isNew = !object;\n  object || (object = {});\n\n  var index = -1,\n      length = props.length;\n\n  while (++index < length) {\n    var key = props[index];\n\n    var newValue = customizer\n      ? customizer(object[key], source[key], key, object, source)\n      : undefined;\n\n    if (newValue === undefined) {\n      newValue = source[key];\n    }\n    if (isNew) {\n      baseAssignValue(object, key, newValue);\n    } else {\n      assignValue(object, key, newValue);\n    }\n  }\n  return object;\n}\n\nmodule.exports = copyObject;\n","var copyObject = require('./_copyObject'),\n    getSymbols = require('./_getSymbols');\n\n/**\n * Copies own symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbols(source, object) {\n  return copyObject(source, getSymbols(source), object);\n}\n\nmodule.exports = copySymbols;\n","var copyObject = require('./_copyObject'),\n    getSymbolsIn = require('./_getSymbolsIn');\n\n/**\n * Copies own and inherited symbols of `source` to `object`.\n *\n * @private\n * @param {Object} source The object to copy symbols from.\n * @param {Object} [object={}] The object to copy symbols to.\n * @returns {Object} Returns `object`.\n */\nfunction copySymbolsIn(source, object) {\n  return copyObject(source, getSymbolsIn(source), object);\n}\n\nmodule.exports = copySymbolsIn;\n","var root = require('./_root');\n\n/** Used to detect overreaching core-js shims. */\nvar coreJsData = root['__core-js_shared__'];\n\nmodule.exports = coreJsData;\n","var baseRest = require('./_baseRest'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Creates a function like `_.assign`.\n *\n * @private\n * @param {Function} assigner The function to assign values.\n * @returns {Function} Returns the new assigner function.\n */\nfunction createAssigner(assigner) {\n  return baseRest(function(object, sources) {\n    var index = -1,\n        length = sources.length,\n        customizer = length > 1 ? sources[length - 1] : undefined,\n        guard = length > 2 ? sources[2] : undefined;\n\n    customizer = (assigner.length > 3 && typeof customizer == 'function')\n      ? (length--, customizer)\n      : undefined;\n\n    if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n      customizer = length < 3 ? undefined : customizer;\n      length = 1;\n    }\n    object = Object(object);\n    while (++index < length) {\n      var source = sources[index];\n      if (source) {\n        assigner(object, source, index, customizer);\n      }\n    }\n    return object;\n  });\n}\n\nmodule.exports = createAssigner;\n","var isArrayLike = require('./isArrayLike');\n\n/**\n * Creates a `baseEach` or `baseEachRight` function.\n *\n * @private\n * @param {Function} eachFunc The function to iterate over a collection.\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseEach(eachFunc, fromRight) {\n  return function(collection, iteratee) {\n    if (collection == null) {\n      return collection;\n    }\n    if (!isArrayLike(collection)) {\n      return eachFunc(collection, iteratee);\n    }\n    var length = collection.length,\n        index = fromRight ? length : -1,\n        iterable = Object(collection);\n\n    while ((fromRight ? index-- : ++index < length)) {\n      if (iteratee(iterable[index], index, iterable) === false) {\n        break;\n      }\n    }\n    return collection;\n  };\n}\n\nmodule.exports = createBaseEach;\n","/**\n * Creates a base function for methods like `_.forIn` and `_.forOwn`.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new base function.\n */\nfunction createBaseFor(fromRight) {\n  return function(object, iteratee, keysFunc) {\n    var index = -1,\n        iterable = Object(object),\n        props = keysFunc(object),\n        length = props.length;\n\n    while (length--) {\n      var key = props[fromRight ? length : ++index];\n      if (iteratee(iterable[key], key, iterable) === false) {\n        break;\n      }\n    }\n    return object;\n  };\n}\n\nmodule.exports = createBaseFor;\n","var baseIteratee = require('./_baseIteratee'),\n    isArrayLike = require('./isArrayLike'),\n    keys = require('./keys');\n\n/**\n * Creates a `_.find` or `_.findLast` function.\n *\n * @private\n * @param {Function} findIndexFunc The function to find the collection index.\n * @returns {Function} Returns the new find function.\n */\nfunction createFind(findIndexFunc) {\n  return function(collection, predicate, fromIndex) {\n    var iterable = Object(collection);\n    if (!isArrayLike(collection)) {\n      var iteratee = baseIteratee(predicate, 3);\n      collection = keys(collection);\n      predicate = function(key) { return iteratee(iterable[key], key, iterable); };\n    }\n    var index = findIndexFunc(collection, predicate, fromIndex);\n    return index > -1 ? iterable[iteratee ? collection[index] : index] : undefined;\n  };\n}\n\nmodule.exports = createFind;\n","var baseRange = require('./_baseRange'),\n    isIterateeCall = require('./_isIterateeCall'),\n    toFinite = require('./toFinite');\n\n/**\n * Creates a `_.range` or `_.rangeRight` function.\n *\n * @private\n * @param {boolean} [fromRight] Specify iterating from right to left.\n * @returns {Function} Returns the new range function.\n */\nfunction createRange(fromRight) {\n  return function(start, end, step) {\n    if (step && typeof step != 'number' && isIterateeCall(start, end, step)) {\n      end = step = undefined;\n    }\n    // Ensure the sign of `-0` is preserved.\n    start = toFinite(start);\n    if (end === undefined) {\n      end = start;\n      start = 0;\n    } else {\n      end = toFinite(end);\n    }\n    step = step === undefined ? (start < end ? 1 : -1) : toFinite(step);\n    return baseRange(start, end, step, fromRight);\n  };\n}\n\nmodule.exports = createRange;\n","var Set = require('./_Set'),\n    noop = require('./noop'),\n    setToArray = require('./_setToArray');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Creates a set object of `values`.\n *\n * @private\n * @param {Array} values The values to add to the set.\n * @returns {Object} Returns the new set.\n */\nvar createSet = !(Set && (1 / setToArray(new Set([,-0]))[1]) == INFINITY) ? noop : function(values) {\n  return new Set(values);\n};\n\nmodule.exports = createSet;\n","var getNative = require('./_getNative');\n\nvar defineProperty = (function() {\n  try {\n    var func = getNative(Object, 'defineProperty');\n    func({}, '', {});\n    return func;\n  } catch (e) {}\n}());\n\nmodule.exports = defineProperty;\n","var SetCache = require('./_SetCache'),\n    arraySome = require('./_arraySome'),\n    cacheHas = require('./_cacheHas');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/**\n * A specialized version of `baseIsEqualDeep` for arrays with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Array} array The array to compare.\n * @param {Array} other The other array to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `array` and `other` objects.\n * @returns {boolean} Returns `true` if the arrays are equivalent, else `false`.\n */\nfunction equalArrays(array, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      arrLength = array.length,\n      othLength = other.length;\n\n  if (arrLength != othLength && !(isPartial && othLength > arrLength)) {\n    return false;\n  }\n  // Check that cyclic values are equal.\n  var arrStacked = stack.get(array);\n  var othStacked = stack.get(other);\n  if (arrStacked && othStacked) {\n    return arrStacked == other && othStacked == array;\n  }\n  var index = -1,\n      result = true,\n      seen = (bitmask & COMPARE_UNORDERED_FLAG) ? new SetCache : undefined;\n\n  stack.set(array, other);\n  stack.set(other, array);\n\n  // Ignore non-index properties.\n  while (++index < arrLength) {\n    var arrValue = array[index],\n        othValue = other[index];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, arrValue, index, other, array, stack)\n        : customizer(arrValue, othValue, index, array, other, stack);\n    }\n    if (compared !== undefined) {\n      if (compared) {\n        continue;\n      }\n      result = false;\n      break;\n    }\n    // Recursively compare arrays (susceptible to call stack limits).\n    if (seen) {\n      if (!arraySome(other, function(othValue, othIndex) {\n            if (!cacheHas(seen, othIndex) &&\n                (arrValue === othValue || equalFunc(arrValue, othValue, bitmask, customizer, stack))) {\n              return seen.push(othIndex);\n            }\n          })) {\n        result = false;\n        break;\n      }\n    } else if (!(\n          arrValue === othValue ||\n            equalFunc(arrValue, othValue, bitmask, customizer, stack)\n        )) {\n      result = false;\n      break;\n    }\n  }\n  stack['delete'](array);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalArrays;\n","var Symbol = require('./_Symbol'),\n    Uint8Array = require('./_Uint8Array'),\n    eq = require('./eq'),\n    equalArrays = require('./_equalArrays'),\n    mapToArray = require('./_mapToArray'),\n    setToArray = require('./_setToArray');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1,\n    COMPARE_UNORDERED_FLAG = 2;\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    errorTag = '[object Error]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]';\n\n/** Used to convert symbols to primitives and strings. */\nvar symbolProto = Symbol ? Symbol.prototype : undefined,\n    symbolValueOf = symbolProto ? symbolProto.valueOf : undefined;\n\n/**\n * A specialized version of `baseIsEqualDeep` for comparing objects of\n * the same `toStringTag`.\n *\n * **Note:** This function only supports comparing values with tags of\n * `Boolean`, `Date`, `Error`, `Number`, `RegExp`, or `String`.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {string} tag The `toStringTag` of the objects to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalByTag(object, other, tag, bitmask, customizer, equalFunc, stack) {\n  switch (tag) {\n    case dataViewTag:\n      if ((object.byteLength != other.byteLength) ||\n          (object.byteOffset != other.byteOffset)) {\n        return false;\n      }\n      object = object.buffer;\n      other = other.buffer;\n\n    case arrayBufferTag:\n      if ((object.byteLength != other.byteLength) ||\n          !equalFunc(new Uint8Array(object), new Uint8Array(other))) {\n        return false;\n      }\n      return true;\n\n    case boolTag:\n    case dateTag:\n    case numberTag:\n      // Coerce booleans to `1` or `0` and dates to milliseconds.\n      // Invalid dates are coerced to `NaN`.\n      return eq(+object, +other);\n\n    case errorTag:\n      return object.name == other.name && object.message == other.message;\n\n    case regexpTag:\n    case stringTag:\n      // Coerce regexes to strings and treat strings, primitives and objects,\n      // as equal. See http://www.ecma-international.org/ecma-262/7.0/#sec-regexp.prototype.tostring\n      // for more details.\n      return object == (other + '');\n\n    case mapTag:\n      var convert = mapToArray;\n\n    case setTag:\n      var isPartial = bitmask & COMPARE_PARTIAL_FLAG;\n      convert || (convert = setToArray);\n\n      if (object.size != other.size && !isPartial) {\n        return false;\n      }\n      // Assume cyclic values are equal.\n      var stacked = stack.get(object);\n      if (stacked) {\n        return stacked == other;\n      }\n      bitmask |= COMPARE_UNORDERED_FLAG;\n\n      // Recursively compare objects (susceptible to call stack limits).\n      stack.set(object, other);\n      var result = equalArrays(convert(object), convert(other), bitmask, customizer, equalFunc, stack);\n      stack['delete'](object);\n      return result;\n\n    case symbolTag:\n      if (symbolValueOf) {\n        return symbolValueOf.call(object) == symbolValueOf.call(other);\n      }\n  }\n  return false;\n}\n\nmodule.exports = equalByTag;\n","var getAllKeys = require('./_getAllKeys');\n\n/** Used to compose bitmasks for value comparisons. */\nvar COMPARE_PARTIAL_FLAG = 1;\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * A specialized version of `baseIsEqualDeep` for objects with support for\n * partial deep comparisons.\n *\n * @private\n * @param {Object} object The object to compare.\n * @param {Object} other The other object to compare.\n * @param {number} bitmask The bitmask flags. See `baseIsEqual` for more details.\n * @param {Function} customizer The function to customize comparisons.\n * @param {Function} equalFunc The function to determine equivalents of values.\n * @param {Object} stack Tracks traversed `object` and `other` objects.\n * @returns {boolean} Returns `true` if the objects are equivalent, else `false`.\n */\nfunction equalObjects(object, other, bitmask, customizer, equalFunc, stack) {\n  var isPartial = bitmask & COMPARE_PARTIAL_FLAG,\n      objProps = getAllKeys(object),\n      objLength = objProps.length,\n      othProps = getAllKeys(other),\n      othLength = othProps.length;\n\n  if (objLength != othLength && !isPartial) {\n    return false;\n  }\n  var index = objLength;\n  while (index--) {\n    var key = objProps[index];\n    if (!(isPartial ? key in other : hasOwnProperty.call(other, key))) {\n      return false;\n    }\n  }\n  // Check that cyclic values are equal.\n  var objStacked = stack.get(object);\n  var othStacked = stack.get(other);\n  if (objStacked && othStacked) {\n    return objStacked == other && othStacked == object;\n  }\n  var result = true;\n  stack.set(object, other);\n  stack.set(other, object);\n\n  var skipCtor = isPartial;\n  while (++index < objLength) {\n    key = objProps[index];\n    var objValue = object[key],\n        othValue = other[key];\n\n    if (customizer) {\n      var compared = isPartial\n        ? customizer(othValue, objValue, key, other, object, stack)\n        : customizer(objValue, othValue, key, object, other, stack);\n    }\n    // Recursively compare objects (susceptible to call stack limits).\n    if (!(compared === undefined\n          ? (objValue === othValue || equalFunc(objValue, othValue, bitmask, customizer, stack))\n          : compared\n        )) {\n      result = false;\n      break;\n    }\n    skipCtor || (skipCtor = key == 'constructor');\n  }\n  if (result && !skipCtor) {\n    var objCtor = object.constructor,\n        othCtor = other.constructor;\n\n    // Non `Object` object instances with different constructors are not equal.\n    if (objCtor != othCtor &&\n        ('constructor' in object && 'constructor' in other) &&\n        !(typeof objCtor == 'function' && objCtor instanceof objCtor &&\n          typeof othCtor == 'function' && othCtor instanceof othCtor)) {\n      result = false;\n    }\n  }\n  stack['delete'](object);\n  stack['delete'](other);\n  return result;\n}\n\nmodule.exports = equalObjects;\n","var flatten = require('./flatten'),\n    overRest = require('./_overRest'),\n    setToString = require('./_setToString');\n\n/**\n * A specialized version of `baseRest` which flattens the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @returns {Function} Returns the new function.\n */\nfunction flatRest(func) {\n  return setToString(overRest(func, undefined, flatten), func + '');\n}\n\nmodule.exports = flatRest;\n","/** Detect free variable `global` from Node.js. */\nvar freeGlobal = typeof global == 'object' && global && global.Object === Object && global;\n\nmodule.exports = freeGlobal;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbols = require('./_getSymbols'),\n    keys = require('./keys');\n\n/**\n * Creates an array of own enumerable property names and symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeys(object) {\n  return baseGetAllKeys(object, keys, getSymbols);\n}\n\nmodule.exports = getAllKeys;\n","var baseGetAllKeys = require('./_baseGetAllKeys'),\n    getSymbolsIn = require('./_getSymbolsIn'),\n    keysIn = require('./keysIn');\n\n/**\n * Creates an array of own and inherited enumerable property names and\n * symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names and symbols.\n */\nfunction getAllKeysIn(object) {\n  return baseGetAllKeys(object, keysIn, getSymbolsIn);\n}\n\nmodule.exports = getAllKeysIn;\n","var isKeyable = require('./_isKeyable');\n\n/**\n * Gets the data for `map`.\n *\n * @private\n * @param {Object} map The map to query.\n * @param {string} key The reference key.\n * @returns {*} Returns the map data.\n */\nfunction getMapData(map, key) {\n  var data = map.__data__;\n  return isKeyable(key)\n    ? data[typeof key == 'string' ? 'string' : 'hash']\n    : data.map;\n}\n\nmodule.exports = getMapData;\n","var isStrictComparable = require('./_isStrictComparable'),\n    keys = require('./keys');\n\n/**\n * Gets the property names, values, and compare flags of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the match data of `object`.\n */\nfunction getMatchData(object) {\n  var result = keys(object),\n      length = result.length;\n\n  while (length--) {\n    var key = result[length],\n        value = object[key];\n\n    result[length] = [key, value, isStrictComparable(value)];\n  }\n  return result;\n}\n\nmodule.exports = getMatchData;\n","var baseIsNative = require('./_baseIsNative'),\n    getValue = require('./_getValue');\n\n/**\n * Gets the native function at `key` of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the method to get.\n * @returns {*} Returns the function if it's native, else `undefined`.\n */\nfunction getNative(object, key) {\n  var value = getValue(object, key);\n  return baseIsNative(value) ? value : undefined;\n}\n\nmodule.exports = getNative;\n","var overArg = require('./_overArg');\n\n/** Built-in value references. */\nvar getPrototype = overArg(Object.getPrototypeOf, Object);\n\nmodule.exports = getPrototype;\n","var Symbol = require('./_Symbol');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/** Built-in value references. */\nvar symToStringTag = Symbol ? Symbol.toStringTag : undefined;\n\n/**\n * A specialized version of `baseGetTag` which ignores `Symbol.toStringTag` values.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the raw `toStringTag`.\n */\nfunction getRawTag(value) {\n  var isOwn = hasOwnProperty.call(value, symToStringTag),\n      tag = value[symToStringTag];\n\n  try {\n    value[symToStringTag] = undefined;\n    var unmasked = true;\n  } catch (e) {}\n\n  var result = nativeObjectToString.call(value);\n  if (unmasked) {\n    if (isOwn) {\n      value[symToStringTag] = tag;\n    } else {\n      delete value[symToStringTag];\n    }\n  }\n  return result;\n}\n\nmodule.exports = getRawTag;\n","var arrayFilter = require('./_arrayFilter'),\n    stubArray = require('./stubArray');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbols = !nativeGetSymbols ? stubArray : function(object) {\n  if (object == null) {\n    return [];\n  }\n  object = Object(object);\n  return arrayFilter(nativeGetSymbols(object), function(symbol) {\n    return propertyIsEnumerable.call(object, symbol);\n  });\n};\n\nmodule.exports = getSymbols;\n","var arrayPush = require('./_arrayPush'),\n    getPrototype = require('./_getPrototype'),\n    getSymbols = require('./_getSymbols'),\n    stubArray = require('./stubArray');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeGetSymbols = Object.getOwnPropertySymbols;\n\n/**\n * Creates an array of the own and inherited enumerable symbols of `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of symbols.\n */\nvar getSymbolsIn = !nativeGetSymbols ? stubArray : function(object) {\n  var result = [];\n  while (object) {\n    arrayPush(result, getSymbols(object));\n    object = getPrototype(object);\n  }\n  return result;\n};\n\nmodule.exports = getSymbolsIn;\n","var DataView = require('./_DataView'),\n    Map = require('./_Map'),\n    Promise = require('./_Promise'),\n    Set = require('./_Set'),\n    WeakMap = require('./_WeakMap'),\n    baseGetTag = require('./_baseGetTag'),\n    toSource = require('./_toSource');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    objectTag = '[object Object]',\n    promiseTag = '[object Promise]',\n    setTag = '[object Set]',\n    weakMapTag = '[object WeakMap]';\n\nvar dataViewTag = '[object DataView]';\n\n/** Used to detect maps, sets, and weakmaps. */\nvar dataViewCtorString = toSource(DataView),\n    mapCtorString = toSource(Map),\n    promiseCtorString = toSource(Promise),\n    setCtorString = toSource(Set),\n    weakMapCtorString = toSource(WeakMap);\n\n/**\n * Gets the `toStringTag` of `value`.\n *\n * @private\n * @param {*} value The value to query.\n * @returns {string} Returns the `toStringTag`.\n */\nvar getTag = baseGetTag;\n\n// Fallback for data views, maps, sets, and weak maps in IE 11 and promises in Node.js < 6.\nif ((DataView && getTag(new DataView(new ArrayBuffer(1))) != dataViewTag) ||\n    (Map && getTag(new Map) != mapTag) ||\n    (Promise && getTag(Promise.resolve()) != promiseTag) ||\n    (Set && getTag(new Set) != setTag) ||\n    (WeakMap && getTag(new WeakMap) != weakMapTag)) {\n  getTag = function(value) {\n    var result = baseGetTag(value),\n        Ctor = result == objectTag ? value.constructor : undefined,\n        ctorString = Ctor ? toSource(Ctor) : '';\n\n    if (ctorString) {\n      switch (ctorString) {\n        case dataViewCtorString: return dataViewTag;\n        case mapCtorString: return mapTag;\n        case promiseCtorString: return promiseTag;\n        case setCtorString: return setTag;\n        case weakMapCtorString: return weakMapTag;\n      }\n    }\n    return result;\n  };\n}\n\nmodule.exports = getTag;\n","/**\n * Gets the value at `key` of `object`.\n *\n * @private\n * @param {Object} [object] The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction getValue(object, key) {\n  return object == null ? undefined : object[key];\n}\n\nmodule.exports = getValue;\n","var castPath = require('./_castPath'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isIndex = require('./_isIndex'),\n    isLength = require('./isLength'),\n    toKey = require('./_toKey');\n\n/**\n * Checks if `path` exists on `object`.\n *\n * @private\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @param {Function} hasFunc The function to check properties.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n */\nfunction hasPath(object, path, hasFunc) {\n  path = castPath(path, object);\n\n  var index = -1,\n      length = path.length,\n      result = false;\n\n  while (++index < length) {\n    var key = toKey(path[index]);\n    if (!(result = object != null && hasFunc(object, key))) {\n      break;\n    }\n    object = object[key];\n  }\n  if (result || ++index != length) {\n    return result;\n  }\n  length = object == null ? 0 : object.length;\n  return !!length && isLength(length) && isIndex(key, length) &&\n    (isArray(object) || isArguments(object));\n}\n\nmodule.exports = hasPath;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsZWJ = '\\\\u200d';\n\n/** Used to detect strings with [zero-width joiners or code points from the astral planes](http://eev.ee/blog/2015/09/12/dark-corners-of-unicode/). */\nvar reHasUnicode = RegExp('[' + rsZWJ + rsAstralRange  + rsComboRange + rsVarRange + ']');\n\n/**\n * Checks if `string` contains Unicode symbols.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {boolean} Returns `true` if a symbol is found, else `false`.\n */\nfunction hasUnicode(string) {\n  return reHasUnicode.test(string);\n}\n\nmodule.exports = hasUnicode;\n","var nativeCreate = require('./_nativeCreate');\n\n/**\n * Removes all key-value entries from the hash.\n *\n * @private\n * @name clear\n * @memberOf Hash\n */\nfunction hashClear() {\n  this.__data__ = nativeCreate ? nativeCreate(null) : {};\n  this.size = 0;\n}\n\nmodule.exports = hashClear;\n","/**\n * Removes `key` and its value from the hash.\n *\n * @private\n * @name delete\n * @memberOf Hash\n * @param {Object} hash The hash to modify.\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction hashDelete(key) {\n  var result = this.has(key) && delete this.__data__[key];\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = hashDelete;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Gets the hash value for `key`.\n *\n * @private\n * @name get\n * @memberOf Hash\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction hashGet(key) {\n  var data = this.__data__;\n  if (nativeCreate) {\n    var result = data[key];\n    return result === HASH_UNDEFINED ? undefined : result;\n  }\n  return hasOwnProperty.call(data, key) ? data[key] : undefined;\n}\n\nmodule.exports = hashGet;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if a hash value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Hash\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction hashHas(key) {\n  var data = this.__data__;\n  return nativeCreate ? (data[key] !== undefined) : hasOwnProperty.call(data, key);\n}\n\nmodule.exports = hashHas;\n","var nativeCreate = require('./_nativeCreate');\n\n/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Sets the hash `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Hash\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the hash instance.\n */\nfunction hashSet(key, value) {\n  var data = this.__data__;\n  this.size += this.has(key) ? 0 : 1;\n  data[key] = (nativeCreate && value === undefined) ? HASH_UNDEFINED : value;\n  return this;\n}\n\nmodule.exports = hashSet;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Initializes an array clone.\n *\n * @private\n * @param {Array} array The array to clone.\n * @returns {Array} Returns the initialized clone.\n */\nfunction initCloneArray(array) {\n  var length = array.length,\n      result = new array.constructor(length);\n\n  // Add properties assigned by `RegExp#exec`.\n  if (length && typeof array[0] == 'string' && hasOwnProperty.call(array, 'index')) {\n    result.index = array.index;\n    result.input = array.input;\n  }\n  return result;\n}\n\nmodule.exports = initCloneArray;\n","var cloneArrayBuffer = require('./_cloneArrayBuffer'),\n    cloneDataView = require('./_cloneDataView'),\n    cloneRegExp = require('./_cloneRegExp'),\n    cloneSymbol = require('./_cloneSymbol'),\n    cloneTypedArray = require('./_cloneTypedArray');\n\n/** `Object#toString` result references. */\nvar boolTag = '[object Boolean]',\n    dateTag = '[object Date]',\n    mapTag = '[object Map]',\n    numberTag = '[object Number]',\n    regexpTag = '[object RegExp]',\n    setTag = '[object Set]',\n    stringTag = '[object String]',\n    symbolTag = '[object Symbol]';\n\nvar arrayBufferTag = '[object ArrayBuffer]',\n    dataViewTag = '[object DataView]',\n    float32Tag = '[object Float32Array]',\n    float64Tag = '[object Float64Array]',\n    int8Tag = '[object Int8Array]',\n    int16Tag = '[object Int16Array]',\n    int32Tag = '[object Int32Array]',\n    uint8Tag = '[object Uint8Array]',\n    uint8ClampedTag = '[object Uint8ClampedArray]',\n    uint16Tag = '[object Uint16Array]',\n    uint32Tag = '[object Uint32Array]';\n\n/**\n * Initializes an object clone based on its `toStringTag`.\n *\n * **Note:** This function only supports cloning values with tags of\n * `Boolean`, `Date`, `Error`, `Map`, `Number`, `RegExp`, `Set`, or `String`.\n *\n * @private\n * @param {Object} object The object to clone.\n * @param {string} tag The `toStringTag` of the object to clone.\n * @param {boolean} [isDeep] Specify a deep clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneByTag(object, tag, isDeep) {\n  var Ctor = object.constructor;\n  switch (tag) {\n    case arrayBufferTag:\n      return cloneArrayBuffer(object);\n\n    case boolTag:\n    case dateTag:\n      return new Ctor(+object);\n\n    case dataViewTag:\n      return cloneDataView(object, isDeep);\n\n    case float32Tag: case float64Tag:\n    case int8Tag: case int16Tag: case int32Tag:\n    case uint8Tag: case uint8ClampedTag: case uint16Tag: case uint32Tag:\n      return cloneTypedArray(object, isDeep);\n\n    case mapTag:\n      return new Ctor;\n\n    case numberTag:\n    case stringTag:\n      return new Ctor(object);\n\n    case regexpTag:\n      return cloneRegExp(object);\n\n    case setTag:\n      return new Ctor;\n\n    case symbolTag:\n      return cloneSymbol(object);\n  }\n}\n\nmodule.exports = initCloneByTag;\n","var baseCreate = require('./_baseCreate'),\n    getPrototype = require('./_getPrototype'),\n    isPrototype = require('./_isPrototype');\n\n/**\n * Initializes an object clone.\n *\n * @private\n * @param {Object} object The object to clone.\n * @returns {Object} Returns the initialized clone.\n */\nfunction initCloneObject(object) {\n  return (typeof object.constructor == 'function' && !isPrototype(object))\n    ? baseCreate(getPrototype(object))\n    : {};\n}\n\nmodule.exports = initCloneObject;\n","var Symbol = require('./_Symbol'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray');\n\n/** Built-in value references. */\nvar spreadableSymbol = Symbol ? Symbol.isConcatSpreadable : undefined;\n\n/**\n * Checks if `value` is a flattenable `arguments` object or array.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is flattenable, else `false`.\n */\nfunction isFlattenable(value) {\n  return isArray(value) || isArguments(value) ||\n    !!(spreadableSymbol && value && value[spreadableSymbol]);\n}\n\nmodule.exports = isFlattenable;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/** Used to detect unsigned integer values. */\nvar reIsUint = /^(?:0|[1-9]\\d*)$/;\n\n/**\n * Checks if `value` is a valid array-like index.\n *\n * @private\n * @param {*} value The value to check.\n * @param {number} [length=MAX_SAFE_INTEGER] The upper bounds of a valid index.\n * @returns {boolean} Returns `true` if `value` is a valid index, else `false`.\n */\nfunction isIndex(value, length) {\n  var type = typeof value;\n  length = length == null ? MAX_SAFE_INTEGER : length;\n\n  return !!length &&\n    (type == 'number' ||\n      (type != 'symbol' && reIsUint.test(value))) &&\n        (value > -1 && value % 1 == 0 && value < length);\n}\n\nmodule.exports = isIndex;\n","var eq = require('./eq'),\n    isArrayLike = require('./isArrayLike'),\n    isIndex = require('./_isIndex'),\n    isObject = require('./isObject');\n\n/**\n * Checks if the given arguments are from an iteratee call.\n *\n * @private\n * @param {*} value The potential iteratee value argument.\n * @param {*} index The potential iteratee index or key argument.\n * @param {*} object The potential iteratee object argument.\n * @returns {boolean} Returns `true` if the arguments are from an iteratee call,\n *  else `false`.\n */\nfunction isIterateeCall(value, index, object) {\n  if (!isObject(object)) {\n    return false;\n  }\n  var type = typeof index;\n  if (type == 'number'\n        ? (isArrayLike(object) && isIndex(index, object.length))\n        : (type == 'string' && index in object)\n      ) {\n    return eq(object[index], value);\n  }\n  return false;\n}\n\nmodule.exports = isIterateeCall;\n","var isArray = require('./isArray'),\n    isSymbol = require('./isSymbol');\n\n/** Used to match property names within property paths. */\nvar reIsDeepProp = /\\.|\\[(?:[^[\\]]*|([\"'])(?:(?!\\1)[^\\\\]|\\\\.)*?\\1)\\]/,\n    reIsPlainProp = /^\\w*$/;\n\n/**\n * Checks if `value` is a property name and not a property path.\n *\n * @private\n * @param {*} value The value to check.\n * @param {Object} [object] The object to query keys on.\n * @returns {boolean} Returns `true` if `value` is a property name, else `false`.\n */\nfunction isKey(value, object) {\n  if (isArray(value)) {\n    return false;\n  }\n  var type = typeof value;\n  if (type == 'number' || type == 'symbol' || type == 'boolean' ||\n      value == null || isSymbol(value)) {\n    return true;\n  }\n  return reIsPlainProp.test(value) || !reIsDeepProp.test(value) ||\n    (object != null && value in Object(object));\n}\n\nmodule.exports = isKey;\n","/**\n * Checks if `value` is suitable for use as unique object key.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is suitable, else `false`.\n */\nfunction isKeyable(value) {\n  var type = typeof value;\n  return (type == 'string' || type == 'number' || type == 'symbol' || type == 'boolean')\n    ? (value !== '__proto__')\n    : (value === null);\n}\n\nmodule.exports = isKeyable;\n","var coreJsData = require('./_coreJsData');\n\n/** Used to detect methods masquerading as native. */\nvar maskSrcKey = (function() {\n  var uid = /[^.]+$/.exec(coreJsData && coreJsData.keys && coreJsData.keys.IE_PROTO || '');\n  return uid ? ('Symbol(src)_1.' + uid) : '';\n}());\n\n/**\n * Checks if `func` has its source masked.\n *\n * @private\n * @param {Function} func The function to check.\n * @returns {boolean} Returns `true` if `func` is masked, else `false`.\n */\nfunction isMasked(func) {\n  return !!maskSrcKey && (maskSrcKey in func);\n}\n\nmodule.exports = isMasked;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Checks if `value` is likely a prototype object.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a prototype, else `false`.\n */\nfunction isPrototype(value) {\n  var Ctor = value && value.constructor,\n      proto = (typeof Ctor == 'function' && Ctor.prototype) || objectProto;\n\n  return value === proto;\n}\n\nmodule.exports = isPrototype;\n","var isObject = require('./isObject');\n\n/**\n * Checks if `value` is suitable for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` if suitable for strict\n *  equality comparisons, else `false`.\n */\nfunction isStrictComparable(value) {\n  return value === value && !isObject(value);\n}\n\nmodule.exports = isStrictComparable;\n","/**\n * Removes all key-value entries from the list cache.\n *\n * @private\n * @name clear\n * @memberOf ListCache\n */\nfunction listCacheClear() {\n  this.__data__ = [];\n  this.size = 0;\n}\n\nmodule.exports = listCacheClear;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/** Used for built-in method references. */\nvar arrayProto = Array.prototype;\n\n/** Built-in value references. */\nvar splice = arrayProto.splice;\n\n/**\n * Removes `key` and its value from the list cache.\n *\n * @private\n * @name delete\n * @memberOf ListCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction listCacheDelete(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    return false;\n  }\n  var lastIndex = data.length - 1;\n  if (index == lastIndex) {\n    data.pop();\n  } else {\n    splice.call(data, index, 1);\n  }\n  --this.size;\n  return true;\n}\n\nmodule.exports = listCacheDelete;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Gets the list cache value for `key`.\n *\n * @private\n * @name get\n * @memberOf ListCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction listCacheGet(key) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  return index < 0 ? undefined : data[index][1];\n}\n\nmodule.exports = listCacheGet;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Checks if a list cache value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf ListCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction listCacheHas(key) {\n  return assocIndexOf(this.__data__, key) > -1;\n}\n\nmodule.exports = listCacheHas;\n","var assocIndexOf = require('./_assocIndexOf');\n\n/**\n * Sets the list cache `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf ListCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the list cache instance.\n */\nfunction listCacheSet(key, value) {\n  var data = this.__data__,\n      index = assocIndexOf(data, key);\n\n  if (index < 0) {\n    ++this.size;\n    data.push([key, value]);\n  } else {\n    data[index][1] = value;\n  }\n  return this;\n}\n\nmodule.exports = listCacheSet;\n","var Hash = require('./_Hash'),\n    ListCache = require('./_ListCache'),\n    Map = require('./_Map');\n\n/**\n * Removes all key-value entries from the map.\n *\n * @private\n * @name clear\n * @memberOf MapCache\n */\nfunction mapCacheClear() {\n  this.size = 0;\n  this.__data__ = {\n    'hash': new Hash,\n    'map': new (Map || ListCache),\n    'string': new Hash\n  };\n}\n\nmodule.exports = mapCacheClear;\n","var getMapData = require('./_getMapData');\n\n/**\n * Removes `key` and its value from the map.\n *\n * @private\n * @name delete\n * @memberOf MapCache\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction mapCacheDelete(key) {\n  var result = getMapData(this, key)['delete'](key);\n  this.size -= result ? 1 : 0;\n  return result;\n}\n\nmodule.exports = mapCacheDelete;\n","var getMapData = require('./_getMapData');\n\n/**\n * Gets the map value for `key`.\n *\n * @private\n * @name get\n * @memberOf MapCache\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction mapCacheGet(key) {\n  return getMapData(this, key).get(key);\n}\n\nmodule.exports = mapCacheGet;\n","var getMapData = require('./_getMapData');\n\n/**\n * Checks if a map value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf MapCache\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction mapCacheHas(key) {\n  return getMapData(this, key).has(key);\n}\n\nmodule.exports = mapCacheHas;\n","var getMapData = require('./_getMapData');\n\n/**\n * Sets the map `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf MapCache\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the map cache instance.\n */\nfunction mapCacheSet(key, value) {\n  var data = getMapData(this, key),\n      size = data.size;\n\n  data.set(key, value);\n  this.size += data.size == size ? 0 : 1;\n  return this;\n}\n\nmodule.exports = mapCacheSet;\n","/**\n * Converts `map` to its key-value pairs.\n *\n * @private\n * @param {Object} map The map to convert.\n * @returns {Array} Returns the key-value pairs.\n */\nfunction mapToArray(map) {\n  var index = -1,\n      result = Array(map.size);\n\n  map.forEach(function(value, key) {\n    result[++index] = [key, value];\n  });\n  return result;\n}\n\nmodule.exports = mapToArray;\n","/**\n * A specialized version of `matchesProperty` for source values suitable\n * for strict equality comparisons, i.e. `===`.\n *\n * @private\n * @param {string} key The key of the property to get.\n * @param {*} srcValue The value to match.\n * @returns {Function} Returns the new spec function.\n */\nfunction matchesStrictComparable(key, srcValue) {\n  return function(object) {\n    if (object == null) {\n      return false;\n    }\n    return object[key] === srcValue &&\n      (srcValue !== undefined || (key in Object(object)));\n  };\n}\n\nmodule.exports = matchesStrictComparable;\n","var memoize = require('./memoize');\n\n/** Used as the maximum memoize cache size. */\nvar MAX_MEMOIZE_SIZE = 500;\n\n/**\n * A specialized version of `_.memoize` which clears the memoized function's\n * cache when it exceeds `MAX_MEMOIZE_SIZE`.\n *\n * @private\n * @param {Function} func The function to have its output memoized.\n * @returns {Function} Returns the new memoized function.\n */\nfunction memoizeCapped(func) {\n  var result = memoize(func, function(key) {\n    if (cache.size === MAX_MEMOIZE_SIZE) {\n      cache.clear();\n    }\n    return key;\n  });\n\n  var cache = result.cache;\n  return result;\n}\n\nmodule.exports = memoizeCapped;\n","var getNative = require('./_getNative');\n\n/* Built-in method references that are verified to be native. */\nvar nativeCreate = getNative(Object, 'create');\n\nmodule.exports = nativeCreate;\n","var overArg = require('./_overArg');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeKeys = overArg(Object.keys, Object);\n\nmodule.exports = nativeKeys;\n","/**\n * This function is like\n * [`Object.keys`](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * except that it includes inherited enumerable properties.\n *\n * @private\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n */\nfunction nativeKeysIn(object) {\n  var result = [];\n  if (object != null) {\n    for (var key in Object(object)) {\n      result.push(key);\n    }\n  }\n  return result;\n}\n\nmodule.exports = nativeKeysIn;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Detect free variable `process` from Node.js. */\nvar freeProcess = moduleExports && freeGlobal.process;\n\n/** Used to access faster Node.js helpers. */\nvar nodeUtil = (function() {\n  try {\n    // Use `util.types` for Node.js 10+.\n    var types = freeModule && freeModule.require && freeModule.require('util').types;\n\n    if (types) {\n      return types;\n    }\n\n    // Legacy `process.binding('util')` for Node.js < 10.\n    return freeProcess && freeProcess.binding && freeProcess.binding('util');\n  } catch (e) {}\n}());\n\nmodule.exports = nodeUtil;\n","/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/**\n * Used to resolve the\n * [`toStringTag`](http://ecma-international.org/ecma-262/7.0/#sec-object.prototype.tostring)\n * of values.\n */\nvar nativeObjectToString = objectProto.toString;\n\n/**\n * Converts `value` to a string using `Object.prototype.toString`.\n *\n * @private\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n */\nfunction objectToString(value) {\n  return nativeObjectToString.call(value);\n}\n\nmodule.exports = objectToString;\n","/**\n * Creates a unary function that invokes `func` with its argument transformed.\n *\n * @private\n * @param {Function} func The function to wrap.\n * @param {Function} transform The argument transform.\n * @returns {Function} Returns the new function.\n */\nfunction overArg(func, transform) {\n  return function(arg) {\n    return func(transform(arg));\n  };\n}\n\nmodule.exports = overArg;\n","var apply = require('./_apply');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * A specialized version of `baseRest` which transforms the rest array.\n *\n * @private\n * @param {Function} func The function to apply a rest parameter to.\n * @param {number} [start=func.length-1] The start position of the rest parameter.\n * @param {Function} transform The rest array transform.\n * @returns {Function} Returns the new function.\n */\nfunction overRest(func, start, transform) {\n  start = nativeMax(start === undefined ? (func.length - 1) : start, 0);\n  return function() {\n    var args = arguments,\n        index = -1,\n        length = nativeMax(args.length - start, 0),\n        array = Array(length);\n\n    while (++index < length) {\n      array[index] = args[start + index];\n    }\n    index = -1;\n    var otherArgs = Array(start + 1);\n    while (++index < start) {\n      otherArgs[index] = args[index];\n    }\n    otherArgs[start] = transform(array);\n    return apply(func, this, otherArgs);\n  };\n}\n\nmodule.exports = overRest;\n","var freeGlobal = require('./_freeGlobal');\n\n/** Detect free variable `self`. */\nvar freeSelf = typeof self == 'object' && self && self.Object === Object && self;\n\n/** Used as a reference to the global object. */\nvar root = freeGlobal || freeSelf || Function('return this')();\n\nmodule.exports = root;\n","/**\n * Gets the value at `key`, unless `key` is \"__proto__\" or \"constructor\".\n *\n * @private\n * @param {Object} object The object to query.\n * @param {string} key The key of the property to get.\n * @returns {*} Returns the property value.\n */\nfunction safeGet(object, key) {\n  if (key === 'constructor' && typeof object[key] === 'function') {\n    return;\n  }\n\n  if (key == '__proto__') {\n    return;\n  }\n\n  return object[key];\n}\n\nmodule.exports = safeGet;\n","/** Used to stand-in for `undefined` hash values. */\nvar HASH_UNDEFINED = '__lodash_hash_undefined__';\n\n/**\n * Adds `value` to the array cache.\n *\n * @private\n * @name add\n * @memberOf SetCache\n * @alias push\n * @param {*} value The value to cache.\n * @returns {Object} Returns the cache instance.\n */\nfunction setCacheAdd(value) {\n  this.__data__.set(value, HASH_UNDEFINED);\n  return this;\n}\n\nmodule.exports = setCacheAdd;\n","/**\n * Checks if `value` is in the array cache.\n *\n * @private\n * @name has\n * @memberOf SetCache\n * @param {*} value The value to search for.\n * @returns {number} Returns `true` if `value` is found, else `false`.\n */\nfunction setCacheHas(value) {\n  return this.__data__.has(value);\n}\n\nmodule.exports = setCacheHas;\n","/**\n * Converts `set` to an array of its values.\n *\n * @private\n * @param {Object} set The set to convert.\n * @returns {Array} Returns the values.\n */\nfunction setToArray(set) {\n  var index = -1,\n      result = Array(set.size);\n\n  set.forEach(function(value) {\n    result[++index] = value;\n  });\n  return result;\n}\n\nmodule.exports = setToArray;\n","var baseSetToString = require('./_baseSetToString'),\n    shortOut = require('./_shortOut');\n\n/**\n * Sets the `toString` method of `func` to return `string`.\n *\n * @private\n * @param {Function} func The function to modify.\n * @param {Function} string The `toString` result.\n * @returns {Function} Returns `func`.\n */\nvar setToString = shortOut(baseSetToString);\n\nmodule.exports = setToString;\n","/** Used to detect hot functions by number of calls within a span of milliseconds. */\nvar HOT_COUNT = 800,\n    HOT_SPAN = 16;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeNow = Date.now;\n\n/**\n * Creates a function that'll short out and invoke `identity` instead\n * of `func` when it's called `HOT_COUNT` or more times in `HOT_SPAN`\n * milliseconds.\n *\n * @private\n * @param {Function} func The function to restrict.\n * @returns {Function} Returns the new shortable function.\n */\nfunction shortOut(func) {\n  var count = 0,\n      lastCalled = 0;\n\n  return function() {\n    var stamp = nativeNow(),\n        remaining = HOT_SPAN - (stamp - lastCalled);\n\n    lastCalled = stamp;\n    if (remaining > 0) {\n      if (++count >= HOT_COUNT) {\n        return arguments[0];\n      }\n    } else {\n      count = 0;\n    }\n    return func.apply(undefined, arguments);\n  };\n}\n\nmodule.exports = shortOut;\n","var ListCache = require('./_ListCache');\n\n/**\n * Removes all key-value entries from the stack.\n *\n * @private\n * @name clear\n * @memberOf Stack\n */\nfunction stackClear() {\n  this.__data__ = new ListCache;\n  this.size = 0;\n}\n\nmodule.exports = stackClear;\n","/**\n * Removes `key` and its value from the stack.\n *\n * @private\n * @name delete\n * @memberOf Stack\n * @param {string} key The key of the value to remove.\n * @returns {boolean} Returns `true` if the entry was removed, else `false`.\n */\nfunction stackDelete(key) {\n  var data = this.__data__,\n      result = data['delete'](key);\n\n  this.size = data.size;\n  return result;\n}\n\nmodule.exports = stackDelete;\n","/**\n * Gets the stack value for `key`.\n *\n * @private\n * @name get\n * @memberOf Stack\n * @param {string} key The key of the value to get.\n * @returns {*} Returns the entry value.\n */\nfunction stackGet(key) {\n  return this.__data__.get(key);\n}\n\nmodule.exports = stackGet;\n","/**\n * Checks if a stack value for `key` exists.\n *\n * @private\n * @name has\n * @memberOf Stack\n * @param {string} key The key of the entry to check.\n * @returns {boolean} Returns `true` if an entry for `key` exists, else `false`.\n */\nfunction stackHas(key) {\n  return this.__data__.has(key);\n}\n\nmodule.exports = stackHas;\n","var ListCache = require('./_ListCache'),\n    Map = require('./_Map'),\n    MapCache = require('./_MapCache');\n\n/** Used as the size to enable large array optimizations. */\nvar LARGE_ARRAY_SIZE = 200;\n\n/**\n * Sets the stack `key` to `value`.\n *\n * @private\n * @name set\n * @memberOf Stack\n * @param {string} key The key of the value to set.\n * @param {*} value The value to set.\n * @returns {Object} Returns the stack cache instance.\n */\nfunction stackSet(key, value) {\n  var data = this.__data__;\n  if (data instanceof ListCache) {\n    var pairs = data.__data__;\n    if (!Map || (pairs.length < LARGE_ARRAY_SIZE - 1)) {\n      pairs.push([key, value]);\n      this.size = ++data.size;\n      return this;\n    }\n    data = this.__data__ = new MapCache(pairs);\n  }\n  data.set(key, value);\n  this.size = data.size;\n  return this;\n}\n\nmodule.exports = stackSet;\n","/**\n * A specialized version of `_.indexOf` which performs strict equality\n * comparisons of values, i.e. `===`.\n *\n * @private\n * @param {Array} array The array to inspect.\n * @param {*} value The value to search for.\n * @param {number} fromIndex The index to search from.\n * @returns {number} Returns the index of the matched value, else `-1`.\n */\nfunction strictIndexOf(array, value, fromIndex) {\n  var index = fromIndex - 1,\n      length = array.length;\n\n  while (++index < length) {\n    if (array[index] === value) {\n      return index;\n    }\n  }\n  return -1;\n}\n\nmodule.exports = strictIndexOf;\n","var asciiSize = require('./_asciiSize'),\n    hasUnicode = require('./_hasUnicode'),\n    unicodeSize = require('./_unicodeSize');\n\n/**\n * Gets the number of symbols in `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the string size.\n */\nfunction stringSize(string) {\n  return hasUnicode(string)\n    ? unicodeSize(string)\n    : asciiSize(string);\n}\n\nmodule.exports = stringSize;\n","var memoizeCapped = require('./_memoizeCapped');\n\n/** Used to match property names within property paths. */\nvar rePropName = /[^.[\\]]+|\\[(?:(-?\\d+(?:\\.\\d+)?)|([\"'])((?:(?!\\2)[^\\\\]|\\\\.)*?)\\2)\\]|(?=(?:\\.|\\[\\])(?:\\.|\\[\\]|$))/g;\n\n/** Used to match backslashes in property paths. */\nvar reEscapeChar = /\\\\(\\\\)?/g;\n\n/**\n * Converts `string` to a property path array.\n *\n * @private\n * @param {string} string The string to convert.\n * @returns {Array} Returns the property path array.\n */\nvar stringToPath = memoizeCapped(function(string) {\n  var result = [];\n  if (string.charCodeAt(0) === 46 /* . */) {\n    result.push('');\n  }\n  string.replace(rePropName, function(match, number, quote, subString) {\n    result.push(quote ? subString.replace(reEscapeChar, '$1') : (number || match));\n  });\n  return result;\n});\n\nmodule.exports = stringToPath;\n","var isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0;\n\n/**\n * Converts `value` to a string key if it's not a string or symbol.\n *\n * @private\n * @param {*} value The value to inspect.\n * @returns {string|symbol} Returns the key.\n */\nfunction toKey(value) {\n  if (typeof value == 'string' || isSymbol(value)) {\n    return value;\n  }\n  var result = (value + '');\n  return (result == '0' && (1 / value) == -INFINITY) ? '-0' : result;\n}\n\nmodule.exports = toKey;\n","/** Used for built-in method references. */\nvar funcProto = Function.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/**\n * Converts `func` to its source code.\n *\n * @private\n * @param {Function} func The function to convert.\n * @returns {string} Returns the source code.\n */\nfunction toSource(func) {\n  if (func != null) {\n    try {\n      return funcToString.call(func);\n    } catch (e) {}\n    try {\n      return (func + '');\n    } catch (e) {}\n  }\n  return '';\n}\n\nmodule.exports = toSource;\n","/** Used to match a single whitespace character. */\nvar reWhitespace = /\\s/;\n\n/**\n * Used by `_.trim` and `_.trimEnd` to get the index of the last non-whitespace\n * character of `string`.\n *\n * @private\n * @param {string} string The string to inspect.\n * @returns {number} Returns the index of the last non-whitespace character.\n */\nfunction trimmedEndIndex(string) {\n  var index = string.length;\n\n  while (index-- && reWhitespace.test(string.charAt(index))) {}\n  return index;\n}\n\nmodule.exports = trimmedEndIndex;\n","/** Used to compose unicode character classes. */\nvar rsAstralRange = '\\\\ud800-\\\\udfff',\n    rsComboMarksRange = '\\\\u0300-\\\\u036f',\n    reComboHalfMarksRange = '\\\\ufe20-\\\\ufe2f',\n    rsComboSymbolsRange = '\\\\u20d0-\\\\u20ff',\n    rsComboRange = rsComboMarksRange + reComboHalfMarksRange + rsComboSymbolsRange,\n    rsVarRange = '\\\\ufe0e\\\\ufe0f';\n\n/** Used to compose unicode capture groups. */\nvar rsAstral = '[' + rsAstralRange + ']',\n    rsCombo = '[' + rsComboRange + ']',\n    rsFitz = '\\\\ud83c[\\\\udffb-\\\\udfff]',\n    rsModifier = '(?:' + rsCombo + '|' + rsFitz + ')',\n    rsNonAstral = '[^' + rsAstralRange + ']',\n    rsRegional = '(?:\\\\ud83c[\\\\udde6-\\\\uddff]){2}',\n    rsSurrPair = '[\\\\ud800-\\\\udbff][\\\\udc00-\\\\udfff]',\n    rsZWJ = '\\\\u200d';\n\n/** Used to compose unicode regexes. */\nvar reOptMod = rsModifier + '?',\n    rsOptVar = '[' + rsVarRange + ']?',\n    rsOptJoin = '(?:' + rsZWJ + '(?:' + [rsNonAstral, rsRegional, rsSurrPair].join('|') + ')' + rsOptVar + reOptMod + ')*',\n    rsSeq = rsOptVar + reOptMod + rsOptJoin,\n    rsSymbol = '(?:' + [rsNonAstral + rsCombo + '?', rsCombo, rsRegional, rsSurrPair, rsAstral].join('|') + ')';\n\n/** Used to match [string symbols](https://mathiasbynens.be/notes/javascript-unicode). */\nvar reUnicode = RegExp(rsFitz + '(?=' + rsFitz + ')|' + rsSymbol + rsSeq, 'g');\n\n/**\n * Gets the size of a Unicode `string`.\n *\n * @private\n * @param {string} string The string inspect.\n * @returns {number} Returns the string size.\n */\nfunction unicodeSize(string) {\n  var result = reUnicode.lastIndex = 0;\n  while (reUnicode.test(string)) {\n    ++result;\n  }\n  return result;\n}\n\nmodule.exports = unicodeSize;\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * Creates a shallow clone of `value`.\n *\n * **Note:** This method is loosely based on the\n * [structured clone algorithm](https://mdn.io/Structured_clone_algorithm)\n * and supports cloning arrays, array buffers, booleans, date objects, maps,\n * numbers, `Object` objects, regexes, sets, strings, symbols, and typed\n * arrays. The own enumerable properties of `arguments` objects are cloned\n * as plain objects. An empty object is returned for uncloneable values such\n * as error objects, functions, DOM nodes, and WeakMaps.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to clone.\n * @returns {*} Returns the cloned value.\n * @see _.cloneDeep\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var shallow = _.clone(objects);\n * console.log(shallow[0] === objects[0]);\n * // => true\n */\nfunction clone(value) {\n  return baseClone(value, CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = clone;\n","var baseClone = require('./_baseClone');\n\n/** Used to compose bitmasks for cloning. */\nvar CLONE_DEEP_FLAG = 1,\n    CLONE_SYMBOLS_FLAG = 4;\n\n/**\n * This method is like `_.clone` except that it recursively clones `value`.\n *\n * @static\n * @memberOf _\n * @since 1.0.0\n * @category Lang\n * @param {*} value The value to recursively clone.\n * @returns {*} Returns the deep cloned value.\n * @see _.clone\n * @example\n *\n * var objects = [{ 'a': 1 }, { 'b': 2 }];\n *\n * var deep = _.cloneDeep(objects);\n * console.log(deep[0] === objects[0]);\n * // => false\n */\nfunction cloneDeep(value) {\n  return baseClone(value, CLONE_DEEP_FLAG | CLONE_SYMBOLS_FLAG);\n}\n\nmodule.exports = cloneDeep;\n","/**\n * Creates a function that returns `value`.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {*} value The value to return from the new function.\n * @returns {Function} Returns the new constant function.\n * @example\n *\n * var objects = _.times(2, _.constant({ 'a': 1 }));\n *\n * console.log(objects);\n * // => [{ 'a': 1 }, { 'a': 1 }]\n *\n * console.log(objects[0] === objects[1]);\n * // => true\n */\nfunction constant(value) {\n  return function() {\n    return value;\n  };\n}\n\nmodule.exports = constant;\n","var baseRest = require('./_baseRest'),\n    eq = require('./eq'),\n    isIterateeCall = require('./_isIterateeCall'),\n    keysIn = require('./keysIn');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Assigns own and inherited enumerable string keyed properties of source\n * objects to the destination object for all destination properties that\n * resolve to `undefined`. Source objects are applied from left to right.\n * Once a property is set, additional values of the same property are ignored.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @see _.defaultsDeep\n * @example\n *\n * _.defaults({ 'a': 1 }, { 'b': 2 }, { 'a': 3 });\n * // => { 'a': 1, 'b': 2 }\n */\nvar defaults = baseRest(function(object, sources) {\n  object = Object(object);\n\n  var index = -1;\n  var length = sources.length;\n  var guard = length > 2 ? sources[2] : undefined;\n\n  if (guard && isIterateeCall(sources[0], sources[1], guard)) {\n    length = 1;\n  }\n\n  while (++index < length) {\n    var source = sources[index];\n    var props = keysIn(source);\n    var propsIndex = -1;\n    var propsLength = props.length;\n\n    while (++propsIndex < propsLength) {\n      var key = props[propsIndex];\n      var value = object[key];\n\n      if (value === undefined ||\n          (eq(value, objectProto[key]) && !hasOwnProperty.call(object, key))) {\n        object[key] = source[key];\n      }\n    }\n  }\n\n  return object;\n});\n\nmodule.exports = defaults;\n","module.exports = require('./forEach');\n","/**\n * Performs a\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * comparison between two values to determine if they are equivalent.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to compare.\n * @param {*} other The other value to compare.\n * @returns {boolean} Returns `true` if the values are equivalent, else `false`.\n * @example\n *\n * var object = { 'a': 1 };\n * var other = { 'a': 1 };\n *\n * _.eq(object, object);\n * // => true\n *\n * _.eq(object, other);\n * // => false\n *\n * _.eq('a', 'a');\n * // => true\n *\n * _.eq('a', Object('a'));\n * // => false\n *\n * _.eq(NaN, NaN);\n * // => true\n */\nfunction eq(value, other) {\n  return value === other || (value !== value && other !== other);\n}\n\nmodule.exports = eq;\n","var arrayFilter = require('./_arrayFilter'),\n    baseFilter = require('./_baseFilter'),\n    baseIteratee = require('./_baseIteratee'),\n    isArray = require('./isArray');\n\n/**\n * Iterates over elements of `collection`, returning an array of all elements\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * **Note:** Unlike `_.remove`, this method returns a new array.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new filtered array.\n * @see _.reject\n * @example\n *\n * var users = [\n *   { 'user': 'barney', 'age': 36, 'active': true },\n *   { 'user': 'fred',   'age': 40, 'active': false }\n * ];\n *\n * _.filter(users, function(o) { return !o.active; });\n * // => objects for ['fred']\n *\n * // The `_.matches` iteratee shorthand.\n * _.filter(users, { 'age': 36, 'active': true });\n * // => objects for ['barney']\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.filter(users, ['active', false]);\n * // => objects for ['fred']\n *\n * // The `_.property` iteratee shorthand.\n * _.filter(users, 'active');\n * // => objects for ['barney']\n *\n * // Combining several predicates using `_.overEvery` or `_.overSome`.\n * _.filter(users, _.overSome([{ 'age': 36 }, ['age', 40]]));\n * // => objects for ['fred', 'barney']\n */\nfunction filter(collection, predicate) {\n  var func = isArray(collection) ? arrayFilter : baseFilter;\n  return func(collection, baseIteratee(predicate, 3));\n}\n\nmodule.exports = filter;\n","var createFind = require('./_createFind'),\n    findIndex = require('./findIndex');\n\n/**\n * Iterates over elements of `collection`, returning the first element\n * `predicate` returns truthy for. The predicate is invoked with three\n * arguments: (value, index|key, collection).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {*} Returns the matched element, else `undefined`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'age': 36, 'active': true },\n *   { 'user': 'fred',    'age': 40, 'active': false },\n *   { 'user': 'pebbles', 'age': 1,  'active': true }\n * ];\n *\n * _.find(users, function(o) { return o.age < 40; });\n * // => object for 'barney'\n *\n * // The `_.matches` iteratee shorthand.\n * _.find(users, { 'age': 1, 'active': true });\n * // => object for 'pebbles'\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.find(users, ['active', false]);\n * // => object for 'fred'\n *\n * // The `_.property` iteratee shorthand.\n * _.find(users, 'active');\n * // => object for 'barney'\n */\nvar find = createFind(findIndex);\n\nmodule.exports = find;\n","var baseFindIndex = require('./_baseFindIndex'),\n    baseIteratee = require('./_baseIteratee'),\n    toInteger = require('./toInteger');\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeMax = Math.max;\n\n/**\n * This method is like `_.find` except that it returns the index of the first\n * element `predicate` returns truthy for instead of the element itself.\n *\n * @static\n * @memberOf _\n * @since 1.1.0\n * @category Array\n * @param {Array} array The array to inspect.\n * @param {Function} [predicate=_.identity] The function invoked per iteration.\n * @param {number} [fromIndex=0] The index to search from.\n * @returns {number} Returns the index of the found element, else `-1`.\n * @example\n *\n * var users = [\n *   { 'user': 'barney',  'active': false },\n *   { 'user': 'fred',    'active': false },\n *   { 'user': 'pebbles', 'active': true }\n * ];\n *\n * _.findIndex(users, function(o) { return o.user == 'barney'; });\n * // => 0\n *\n * // The `_.matches` iteratee shorthand.\n * _.findIndex(users, { 'user': 'fred', 'active': false });\n * // => 1\n *\n * // The `_.matchesProperty` iteratee shorthand.\n * _.findIndex(users, ['active', false]);\n * // => 0\n *\n * // The `_.property` iteratee shorthand.\n * _.findIndex(users, 'active');\n * // => 2\n */\nfunction findIndex(array, predicate, fromIndex) {\n  var length = array == null ? 0 : array.length;\n  if (!length) {\n    return -1;\n  }\n  var index = fromIndex == null ? 0 : toInteger(fromIndex);\n  if (index < 0) {\n    index = nativeMax(length + index, 0);\n  }\n  return baseFindIndex(array, baseIteratee(predicate, 3), index);\n}\n\nmodule.exports = findIndex;\n","var baseFlatten = require('./_baseFlatten');\n\n/**\n * Flattens `array` a single level deep.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to flatten.\n * @returns {Array} Returns the new flattened array.\n * @example\n *\n * _.flatten([1, [2, [3, [4]], 5]]);\n * // => [1, 2, [3, [4]], 5]\n */\nfunction flatten(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? baseFlatten(array, 1) : [];\n}\n\nmodule.exports = flatten;\n","var arrayEach = require('./_arrayEach'),\n    baseEach = require('./_baseEach'),\n    castFunction = require('./_castFunction'),\n    isArray = require('./isArray');\n\n/**\n * Iterates over elements of `collection` and invokes `iteratee` for each element.\n * The iteratee is invoked with three arguments: (value, index|key, collection).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * **Note:** As with other \"Collections\" methods, objects with a \"length\"\n * property are iterated like arrays. To avoid this behavior use `_.forIn`\n * or `_.forOwn` for object iteration.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @alias each\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array|Object} Returns `collection`.\n * @see _.forEachRight\n * @example\n *\n * _.forEach([1, 2], function(value) {\n *   console.log(value);\n * });\n * // => Logs `1` then `2`.\n *\n * _.forEach({ 'a': 1, 'b': 2 }, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a' then 'b' (iteration order is not guaranteed).\n */\nfunction forEach(collection, iteratee) {\n  var func = isArray(collection) ? arrayEach : baseEach;\n  return func(collection, castFunction(iteratee));\n}\n\nmodule.exports = forEach;\n","var baseFor = require('./_baseFor'),\n    castFunction = require('./_castFunction'),\n    keysIn = require('./keysIn');\n\n/**\n * Iterates over own and inherited enumerable string keyed properties of an\n * object and invokes `iteratee` for each property. The iteratee is invoked\n * with three arguments: (value, key, object). Iteratee functions may exit\n * iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 0.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns `object`.\n * @see _.forInRight\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.forIn(new Foo, function(value, key) {\n *   console.log(key);\n * });\n * // => Logs 'a', 'b', then 'c' (iteration order is not guaranteed).\n */\nfunction forIn(object, iteratee) {\n  return object == null\n    ? object\n    : baseFor(object, castFunction(iteratee), keysIn);\n}\n\nmodule.exports = forIn;\n","var baseGet = require('./_baseGet');\n\n/**\n * Gets the value at `path` of `object`. If the resolved value is\n * `undefined`, the `defaultValue` is returned in its place.\n *\n * @static\n * @memberOf _\n * @since 3.7.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path of the property to get.\n * @param {*} [defaultValue] The value returned for `undefined` resolved values.\n * @returns {*} Returns the resolved value.\n * @example\n *\n * var object = { 'a': [{ 'b': { 'c': 3 } }] };\n *\n * _.get(object, 'a[0].b.c');\n * // => 3\n *\n * _.get(object, ['a', '0', 'b', 'c']);\n * // => 3\n *\n * _.get(object, 'a.b.c', 'default');\n * // => 'default'\n */\nfunction get(object, path, defaultValue) {\n  var result = object == null ? undefined : baseGet(object, path);\n  return result === undefined ? defaultValue : result;\n}\n\nmodule.exports = get;\n","var baseHas = require('./_baseHas'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct property of `object`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = { 'a': { 'b': 2 } };\n * var other = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.has(object, 'a');\n * // => true\n *\n * _.has(object, 'a.b');\n * // => true\n *\n * _.has(object, ['a', 'b']);\n * // => true\n *\n * _.has(other, 'a');\n * // => false\n */\nfunction has(object, path) {\n  return object != null && hasPath(object, path, baseHas);\n}\n\nmodule.exports = has;\n","var baseHasIn = require('./_baseHasIn'),\n    hasPath = require('./_hasPath');\n\n/**\n * Checks if `path` is a direct or inherited property of `object`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @param {Array|string} path The path to check.\n * @returns {boolean} Returns `true` if `path` exists, else `false`.\n * @example\n *\n * var object = _.create({ 'a': _.create({ 'b': 2 }) });\n *\n * _.hasIn(object, 'a');\n * // => true\n *\n * _.hasIn(object, 'a.b');\n * // => true\n *\n * _.hasIn(object, ['a', 'b']);\n * // => true\n *\n * _.hasIn(object, 'b');\n * // => false\n */\nfunction hasIn(object, path) {\n  return object != null && hasPath(object, path, baseHasIn);\n}\n\nmodule.exports = hasIn;\n","/**\n * This method returns the first argument it receives.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {*} value Any value.\n * @returns {*} Returns `value`.\n * @example\n *\n * var object = { 'a': 1 };\n *\n * console.log(_.identity(object) === object);\n * // => true\n */\nfunction identity(value) {\n  return value;\n}\n\nmodule.exports = identity;\n","var baseIsArguments = require('./_baseIsArguments'),\n    isObjectLike = require('./isObjectLike');\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Built-in value references. */\nvar propertyIsEnumerable = objectProto.propertyIsEnumerable;\n\n/**\n * Checks if `value` is likely an `arguments` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an `arguments` object,\n *  else `false`.\n * @example\n *\n * _.isArguments(function() { return arguments; }());\n * // => true\n *\n * _.isArguments([1, 2, 3]);\n * // => false\n */\nvar isArguments = baseIsArguments(function() { return arguments; }()) ? baseIsArguments : function(value) {\n  return isObjectLike(value) && hasOwnProperty.call(value, 'callee') &&\n    !propertyIsEnumerable.call(value, 'callee');\n};\n\nmodule.exports = isArguments;\n","/**\n * Checks if `value` is classified as an `Array` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array, else `false`.\n * @example\n *\n * _.isArray([1, 2, 3]);\n * // => true\n *\n * _.isArray(document.body.children);\n * // => false\n *\n * _.isArray('abc');\n * // => false\n *\n * _.isArray(_.noop);\n * // => false\n */\nvar isArray = Array.isArray;\n\nmodule.exports = isArray;\n","var isFunction = require('./isFunction'),\n    isLength = require('./isLength');\n\n/**\n * Checks if `value` is array-like. A value is considered array-like if it's\n * not a function and has a `value.length` that's an integer greater than or\n * equal to `0` and less than or equal to `Number.MAX_SAFE_INTEGER`.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is array-like, else `false`.\n * @example\n *\n * _.isArrayLike([1, 2, 3]);\n * // => true\n *\n * _.isArrayLike(document.body.children);\n * // => true\n *\n * _.isArrayLike('abc');\n * // => true\n *\n * _.isArrayLike(_.noop);\n * // => false\n */\nfunction isArrayLike(value) {\n  return value != null && isLength(value.length) && !isFunction(value);\n}\n\nmodule.exports = isArrayLike;\n","var isArrayLike = require('./isArrayLike'),\n    isObjectLike = require('./isObjectLike');\n\n/**\n * This method is like `_.isArrayLike` except that it also checks if `value`\n * is an object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an array-like object,\n *  else `false`.\n * @example\n *\n * _.isArrayLikeObject([1, 2, 3]);\n * // => true\n *\n * _.isArrayLikeObject(document.body.children);\n * // => true\n *\n * _.isArrayLikeObject('abc');\n * // => false\n *\n * _.isArrayLikeObject(_.noop);\n * // => false\n */\nfunction isArrayLikeObject(value) {\n  return isObjectLike(value) && isArrayLike(value);\n}\n\nmodule.exports = isArrayLikeObject;\n","var root = require('./_root'),\n    stubFalse = require('./stubFalse');\n\n/** Detect free variable `exports`. */\nvar freeExports = typeof exports == 'object' && exports && !exports.nodeType && exports;\n\n/** Detect free variable `module`. */\nvar freeModule = freeExports && typeof module == 'object' && module && !module.nodeType && module;\n\n/** Detect the popular CommonJS extension `module.exports`. */\nvar moduleExports = freeModule && freeModule.exports === freeExports;\n\n/** Built-in value references. */\nvar Buffer = moduleExports ? root.Buffer : undefined;\n\n/* Built-in method references for those with the same name as other `lodash` methods. */\nvar nativeIsBuffer = Buffer ? Buffer.isBuffer : undefined;\n\n/**\n * Checks if `value` is a buffer.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a buffer, else `false`.\n * @example\n *\n * _.isBuffer(new Buffer(2));\n * // => true\n *\n * _.isBuffer(new Uint8Array(2));\n * // => false\n */\nvar isBuffer = nativeIsBuffer || stubFalse;\n\nmodule.exports = isBuffer;\n","var baseKeys = require('./_baseKeys'),\n    getTag = require('./_getTag'),\n    isArguments = require('./isArguments'),\n    isArray = require('./isArray'),\n    isArrayLike = require('./isArrayLike'),\n    isBuffer = require('./isBuffer'),\n    isPrototype = require('./_isPrototype'),\n    isTypedArray = require('./isTypedArray');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/** Used for built-in method references. */\nvar objectProto = Object.prototype;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/**\n * Checks if `value` is an empty object, collection, map, or set.\n *\n * Objects are considered empty if they have no own enumerable string keyed\n * properties.\n *\n * Array-like values such as `arguments` objects, arrays, buffers, strings, or\n * jQuery-like collections are considered empty if they have a `length` of `0`.\n * Similarly, maps and sets are considered empty if they have a `size` of `0`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is empty, else `false`.\n * @example\n *\n * _.isEmpty(null);\n * // => true\n *\n * _.isEmpty(true);\n * // => true\n *\n * _.isEmpty(1);\n * // => true\n *\n * _.isEmpty([1, 2, 3]);\n * // => false\n *\n * _.isEmpty({ 'a': 1 });\n * // => false\n */\nfunction isEmpty(value) {\n  if (value == null) {\n    return true;\n  }\n  if (isArrayLike(value) &&\n      (isArray(value) || typeof value == 'string' || typeof value.splice == 'function' ||\n        isBuffer(value) || isTypedArray(value) || isArguments(value))) {\n    return !value.length;\n  }\n  var tag = getTag(value);\n  if (tag == mapTag || tag == setTag) {\n    return !value.size;\n  }\n  if (isPrototype(value)) {\n    return !baseKeys(value).length;\n  }\n  for (var key in value) {\n    if (hasOwnProperty.call(value, key)) {\n      return false;\n    }\n  }\n  return true;\n}\n\nmodule.exports = isEmpty;\n","var baseGetTag = require('./_baseGetTag'),\n    isObject = require('./isObject');\n\n/** `Object#toString` result references. */\nvar asyncTag = '[object AsyncFunction]',\n    funcTag = '[object Function]',\n    genTag = '[object GeneratorFunction]',\n    proxyTag = '[object Proxy]';\n\n/**\n * Checks if `value` is classified as a `Function` object.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a function, else `false`.\n * @example\n *\n * _.isFunction(_);\n * // => true\n *\n * _.isFunction(/abc/);\n * // => false\n */\nfunction isFunction(value) {\n  if (!isObject(value)) {\n    return false;\n  }\n  // The use of `Object#toString` avoids issues with the `typeof` operator\n  // in Safari 9 which returns 'object' for typed arrays and other constructors.\n  var tag = baseGetTag(value);\n  return tag == funcTag || tag == genTag || tag == asyncTag || tag == proxyTag;\n}\n\nmodule.exports = isFunction;\n","/** Used as references for various `Number` constants. */\nvar MAX_SAFE_INTEGER = 9007199254740991;\n\n/**\n * Checks if `value` is a valid array-like length.\n *\n * **Note:** This method is loosely based on\n * [`ToLength`](http://ecma-international.org/ecma-262/7.0/#sec-tolength).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a valid length, else `false`.\n * @example\n *\n * _.isLength(3);\n * // => true\n *\n * _.isLength(Number.MIN_VALUE);\n * // => false\n *\n * _.isLength(Infinity);\n * // => false\n *\n * _.isLength('3');\n * // => false\n */\nfunction isLength(value) {\n  return typeof value == 'number' &&\n    value > -1 && value % 1 == 0 && value <= MAX_SAFE_INTEGER;\n}\n\nmodule.exports = isLength;\n","var baseIsMap = require('./_baseIsMap'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsMap = nodeUtil && nodeUtil.isMap;\n\n/**\n * Checks if `value` is classified as a `Map` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a map, else `false`.\n * @example\n *\n * _.isMap(new Map);\n * // => true\n *\n * _.isMap(new WeakMap);\n * // => false\n */\nvar isMap = nodeIsMap ? baseUnary(nodeIsMap) : baseIsMap;\n\nmodule.exports = isMap;\n","/**\n * Checks if `value` is the\n * [language type](http://www.ecma-international.org/ecma-262/7.0/#sec-ecmascript-language-types)\n * of `Object`. (e.g. arrays, functions, objects, regexes, `new Number(0)`, and `new String('')`)\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is an object, else `false`.\n * @example\n *\n * _.isObject({});\n * // => true\n *\n * _.isObject([1, 2, 3]);\n * // => true\n *\n * _.isObject(_.noop);\n * // => true\n *\n * _.isObject(null);\n * // => false\n */\nfunction isObject(value) {\n  var type = typeof value;\n  return value != null && (type == 'object' || type == 'function');\n}\n\nmodule.exports = isObject;\n","/**\n * Checks if `value` is object-like. A value is object-like if it's not `null`\n * and has a `typeof` result of \"object\".\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is object-like, else `false`.\n * @example\n *\n * _.isObjectLike({});\n * // => true\n *\n * _.isObjectLike([1, 2, 3]);\n * // => true\n *\n * _.isObjectLike(_.noop);\n * // => false\n *\n * _.isObjectLike(null);\n * // => false\n */\nfunction isObjectLike(value) {\n  return value != null && typeof value == 'object';\n}\n\nmodule.exports = isObjectLike;\n","var baseGetTag = require('./_baseGetTag'),\n    getPrototype = require('./_getPrototype'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar objectTag = '[object Object]';\n\n/** Used for built-in method references. */\nvar funcProto = Function.prototype,\n    objectProto = Object.prototype;\n\n/** Used to resolve the decompiled source of functions. */\nvar funcToString = funcProto.toString;\n\n/** Used to check objects for own properties. */\nvar hasOwnProperty = objectProto.hasOwnProperty;\n\n/** Used to infer the `Object` constructor. */\nvar objectCtorString = funcToString.call(Object);\n\n/**\n * Checks if `value` is a plain object, that is, an object created by the\n * `Object` constructor or one with a `[[Prototype]]` of `null`.\n *\n * @static\n * @memberOf _\n * @since 0.8.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a plain object, else `false`.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n * }\n *\n * _.isPlainObject(new Foo);\n * // => false\n *\n * _.isPlainObject([1, 2, 3]);\n * // => false\n *\n * _.isPlainObject({ 'x': 0, 'y': 0 });\n * // => true\n *\n * _.isPlainObject(Object.create(null));\n * // => true\n */\nfunction isPlainObject(value) {\n  if (!isObjectLike(value) || baseGetTag(value) != objectTag) {\n    return false;\n  }\n  var proto = getPrototype(value);\n  if (proto === null) {\n    return true;\n  }\n  var Ctor = hasOwnProperty.call(proto, 'constructor') && proto.constructor;\n  return typeof Ctor == 'function' && Ctor instanceof Ctor &&\n    funcToString.call(Ctor) == objectCtorString;\n}\n\nmodule.exports = isPlainObject;\n","var baseIsSet = require('./_baseIsSet'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsSet = nodeUtil && nodeUtil.isSet;\n\n/**\n * Checks if `value` is classified as a `Set` object.\n *\n * @static\n * @memberOf _\n * @since 4.3.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a set, else `false`.\n * @example\n *\n * _.isSet(new Set);\n * // => true\n *\n * _.isSet(new WeakSet);\n * // => false\n */\nvar isSet = nodeIsSet ? baseUnary(nodeIsSet) : baseIsSet;\n\nmodule.exports = isSet;\n","var baseGetTag = require('./_baseGetTag'),\n    isArray = require('./isArray'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar stringTag = '[object String]';\n\n/**\n * Checks if `value` is classified as a `String` primitive or object.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a string, else `false`.\n * @example\n *\n * _.isString('abc');\n * // => true\n *\n * _.isString(1);\n * // => false\n */\nfunction isString(value) {\n  return typeof value == 'string' ||\n    (!isArray(value) && isObjectLike(value) && baseGetTag(value) == stringTag);\n}\n\nmodule.exports = isString;\n","var baseGetTag = require('./_baseGetTag'),\n    isObjectLike = require('./isObjectLike');\n\n/** `Object#toString` result references. */\nvar symbolTag = '[object Symbol]';\n\n/**\n * Checks if `value` is classified as a `Symbol` primitive or object.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a symbol, else `false`.\n * @example\n *\n * _.isSymbol(Symbol.iterator);\n * // => true\n *\n * _.isSymbol('abc');\n * // => false\n */\nfunction isSymbol(value) {\n  return typeof value == 'symbol' ||\n    (isObjectLike(value) && baseGetTag(value) == symbolTag);\n}\n\nmodule.exports = isSymbol;\n","var baseIsTypedArray = require('./_baseIsTypedArray'),\n    baseUnary = require('./_baseUnary'),\n    nodeUtil = require('./_nodeUtil');\n\n/* Node.js helper references. */\nvar nodeIsTypedArray = nodeUtil && nodeUtil.isTypedArray;\n\n/**\n * Checks if `value` is classified as a typed array.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is a typed array, else `false`.\n * @example\n *\n * _.isTypedArray(new Uint8Array);\n * // => true\n *\n * _.isTypedArray([]);\n * // => false\n */\nvar isTypedArray = nodeIsTypedArray ? baseUnary(nodeIsTypedArray) : baseIsTypedArray;\n\nmodule.exports = isTypedArray;\n","/**\n * Checks if `value` is `undefined`.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Lang\n * @param {*} value The value to check.\n * @returns {boolean} Returns `true` if `value` is `undefined`, else `false`.\n * @example\n *\n * _.isUndefined(void 0);\n * // => true\n *\n * _.isUndefined(null);\n * // => false\n */\nfunction isUndefined(value) {\n  return value === undefined;\n}\n\nmodule.exports = isUndefined;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeys = require('./_baseKeys'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects. See the\n * [ES spec](http://ecma-international.org/ecma-262/7.0/#sec-object.keys)\n * for more details.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keys(new Foo);\n * // => ['a', 'b'] (iteration order is not guaranteed)\n *\n * _.keys('hi');\n * // => ['0', '1']\n */\nfunction keys(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object) : baseKeys(object);\n}\n\nmodule.exports = keys;\n","var arrayLikeKeys = require('./_arrayLikeKeys'),\n    baseKeysIn = require('./_baseKeysIn'),\n    isArrayLike = require('./isArrayLike');\n\n/**\n * Creates an array of the own and inherited enumerable property names of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property names.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.keysIn(new Foo);\n * // => ['a', 'b', 'c'] (iteration order is not guaranteed)\n */\nfunction keysIn(object) {\n  return isArrayLike(object) ? arrayLikeKeys(object, true) : baseKeysIn(object);\n}\n\nmodule.exports = keysIn;\n","/**\n * Gets the last element of `array`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {Array} array The array to query.\n * @returns {*} Returns the last element of `array`.\n * @example\n *\n * _.last([1, 2, 3]);\n * // => 3\n */\nfunction last(array) {\n  var length = array == null ? 0 : array.length;\n  return length ? array[length - 1] : undefined;\n}\n\nmodule.exports = last;\n","var arrayMap = require('./_arrayMap'),\n    baseIteratee = require('./_baseIteratee'),\n    baseMap = require('./_baseMap'),\n    isArray = require('./isArray');\n\n/**\n * Creates an array of values by running each element in `collection` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.every`, `_.filter`, `_.map`, `_.mapValues`, `_.reject`, and `_.some`.\n *\n * The guarded methods are:\n * `ary`, `chunk`, `curry`, `curryRight`, `drop`, `dropRight`, `every`,\n * `fill`, `invert`, `parseInt`, `random`, `range`, `rangeRight`, `repeat`,\n * `sampleSize`, `slice`, `some`, `sortBy`, `split`, `take`, `takeRight`,\n * `template`, `trim`, `trimEnd`, `trimStart`, and `words`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Array} Returns the new mapped array.\n * @example\n *\n * function square(n) {\n *   return n * n;\n * }\n *\n * _.map([4, 8], square);\n * // => [16, 64]\n *\n * _.map({ 'a': 4, 'b': 8 }, square);\n * // => [16, 64] (iteration order is not guaranteed)\n *\n * var users = [\n *   { 'user': 'barney' },\n *   { 'user': 'fred' }\n * ];\n *\n * // The `_.property` iteratee shorthand.\n * _.map(users, 'user');\n * // => ['barney', 'fred']\n */\nfunction map(collection, iteratee) {\n  var func = isArray(collection) ? arrayMap : baseMap;\n  return func(collection, baseIteratee(iteratee, 3));\n}\n\nmodule.exports = map;\n","var baseAssignValue = require('./_baseAssignValue'),\n    baseForOwn = require('./_baseForOwn'),\n    baseIteratee = require('./_baseIteratee');\n\n/**\n * Creates an object with the same keys as `object` and values generated\n * by running each own enumerable string keyed property of `object` thru\n * `iteratee`. The iteratee is invoked with three arguments:\n * (value, key, object).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @returns {Object} Returns the new mapped object.\n * @see _.mapKeys\n * @example\n *\n * var users = {\n *   'fred':    { 'user': 'fred',    'age': 40 },\n *   'pebbles': { 'user': 'pebbles', 'age': 1 }\n * };\n *\n * _.mapValues(users, function(o) { return o.age; });\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n *\n * // The `_.property` iteratee shorthand.\n * _.mapValues(users, 'age');\n * // => { 'fred': 40, 'pebbles': 1 } (iteration order is not guaranteed)\n */\nfunction mapValues(object, iteratee) {\n  var result = {};\n  iteratee = baseIteratee(iteratee, 3);\n\n  baseForOwn(object, function(value, key, object) {\n    baseAssignValue(result, key, iteratee(value, key, object));\n  });\n  return result;\n}\n\nmodule.exports = mapValues;\n","var baseExtremum = require('./_baseExtremum'),\n    baseGt = require('./_baseGt'),\n    identity = require('./identity');\n\n/**\n * Computes the maximum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the maximum value.\n * @example\n *\n * _.max([4, 2, 8, 6]);\n * // => 8\n *\n * _.max([]);\n * // => undefined\n */\nfunction max(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseGt)\n    : undefined;\n}\n\nmodule.exports = max;\n","var MapCache = require('./_MapCache');\n\n/** Error message constants. */\nvar FUNC_ERROR_TEXT = 'Expected a function';\n\n/**\n * Creates a function that memoizes the result of `func`. If `resolver` is\n * provided, it determines the cache key for storing the result based on the\n * arguments provided to the memoized function. By default, the first argument\n * provided to the memoized function is used as the map cache key. The `func`\n * is invoked with the `this` binding of the memoized function.\n *\n * **Note:** The cache is exposed as the `cache` property on the memoized\n * function. Its creation may be customized by replacing the `_.memoize.Cache`\n * constructor with one whose instances implement the\n * [`Map`](http://ecma-international.org/ecma-262/7.0/#sec-properties-of-the-map-prototype-object)\n * method interface of `clear`, `delete`, `get`, `has`, and `set`.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Function\n * @param {Function} func The function to have its output memoized.\n * @param {Function} [resolver] The function to resolve the cache key.\n * @returns {Function} Returns the new memoized function.\n * @example\n *\n * var object = { 'a': 1, 'b': 2 };\n * var other = { 'c': 3, 'd': 4 };\n *\n * var values = _.memoize(_.values);\n * values(object);\n * // => [1, 2]\n *\n * values(other);\n * // => [3, 4]\n *\n * object.a = 2;\n * values(object);\n * // => [1, 2]\n *\n * // Modify the result cache.\n * values.cache.set(object, ['a', 'b']);\n * values(object);\n * // => ['a', 'b']\n *\n * // Replace `_.memoize.Cache`.\n * _.memoize.Cache = WeakMap;\n */\nfunction memoize(func, resolver) {\n  if (typeof func != 'function' || (resolver != null && typeof resolver != 'function')) {\n    throw new TypeError(FUNC_ERROR_TEXT);\n  }\n  var memoized = function() {\n    var args = arguments,\n        key = resolver ? resolver.apply(this, args) : args[0],\n        cache = memoized.cache;\n\n    if (cache.has(key)) {\n      return cache.get(key);\n    }\n    var result = func.apply(this, args);\n    memoized.cache = cache.set(key, result) || cache;\n    return result;\n  };\n  memoized.cache = new (memoize.Cache || MapCache);\n  return memoized;\n}\n\n// Expose `MapCache`.\nmemoize.Cache = MapCache;\n\nmodule.exports = memoize;\n","var baseMerge = require('./_baseMerge'),\n    createAssigner = require('./_createAssigner');\n\n/**\n * This method is like `_.assign` except that it recursively merges own and\n * inherited enumerable string keyed properties of source objects into the\n * destination object. Source properties that resolve to `undefined` are\n * skipped if a destination value exists. Array and plain object properties\n * are merged recursively. Other objects and value types are overridden by\n * assignment. Source objects are applied from left to right. Subsequent\n * sources overwrite property assignments of previous sources.\n *\n * **Note:** This method mutates `object`.\n *\n * @static\n * @memberOf _\n * @since 0.5.0\n * @category Object\n * @param {Object} object The destination object.\n * @param {...Object} [sources] The source objects.\n * @returns {Object} Returns `object`.\n * @example\n *\n * var object = {\n *   'a': [{ 'b': 2 }, { 'd': 4 }]\n * };\n *\n * var other = {\n *   'a': [{ 'c': 3 }, { 'e': 5 }]\n * };\n *\n * _.merge(object, other);\n * // => { 'a': [{ 'b': 2, 'c': 3 }, { 'd': 4, 'e': 5 }] }\n */\nvar merge = createAssigner(function(object, source, srcIndex) {\n  baseMerge(object, source, srcIndex);\n});\n\nmodule.exports = merge;\n","var baseExtremum = require('./_baseExtremum'),\n    baseLt = require('./_baseLt'),\n    identity = require('./identity');\n\n/**\n * Computes the minimum value of `array`. If `array` is empty or falsey,\n * `undefined` is returned.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Math\n * @param {Array} array The array to iterate over.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * _.min([4, 2, 8, 6]);\n * // => 2\n *\n * _.min([]);\n * // => undefined\n */\nfunction min(array) {\n  return (array && array.length)\n    ? baseExtremum(array, identity, baseLt)\n    : undefined;\n}\n\nmodule.exports = min;\n","var baseExtremum = require('./_baseExtremum'),\n    baseIteratee = require('./_baseIteratee'),\n    baseLt = require('./_baseLt');\n\n/**\n * This method is like `_.min` except that it accepts `iteratee` which is\n * invoked for each element in `array` to generate the criterion by which\n * the value is ranked. The iteratee is invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Math\n * @param {Array} array The array to iterate over.\n * @param {Function} [iteratee=_.identity] The iteratee invoked per element.\n * @returns {*} Returns the minimum value.\n * @example\n *\n * var objects = [{ 'n': 1 }, { 'n': 2 }];\n *\n * _.minBy(objects, function(o) { return o.n; });\n * // => { 'n': 1 }\n *\n * // The `_.property` iteratee shorthand.\n * _.minBy(objects, 'n');\n * // => { 'n': 1 }\n */\nfunction minBy(array, iteratee) {\n  return (array && array.length)\n    ? baseExtremum(array, baseIteratee(iteratee, 2), baseLt)\n    : undefined;\n}\n\nmodule.exports = minBy;\n","/**\n * This method returns `undefined`.\n *\n * @static\n * @memberOf _\n * @since 2.3.0\n * @category Util\n * @example\n *\n * _.times(2, _.noop);\n * // => [undefined, undefined]\n */\nfunction noop() {\n  // No operation performed.\n}\n\nmodule.exports = noop;\n","var root = require('./_root');\n\n/**\n * Gets the timestamp of the number of milliseconds that have elapsed since\n * the Unix epoch (1 January 1970 00:00:00 UTC).\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Date\n * @returns {number} Returns the timestamp.\n * @example\n *\n * _.defer(function(stamp) {\n *   console.log(_.now() - stamp);\n * }, _.now());\n * // => Logs the number of milliseconds it took for the deferred invocation.\n */\nvar now = function() {\n  return root.Date.now();\n};\n\nmodule.exports = now;\n","var basePick = require('./_basePick'),\n    flatRest = require('./_flatRest');\n\n/**\n * Creates an object composed of the picked `object` properties.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The source object.\n * @param {...(string|string[])} [paths] The property paths to pick.\n * @returns {Object} Returns the new object.\n * @example\n *\n * var object = { 'a': 1, 'b': '2', 'c': 3 };\n *\n * _.pick(object, ['a', 'c']);\n * // => { 'a': 1, 'c': 3 }\n */\nvar pick = flatRest(function(object, paths) {\n  return object == null ? {} : basePick(object, paths);\n});\n\nmodule.exports = pick;\n","var baseProperty = require('./_baseProperty'),\n    basePropertyDeep = require('./_basePropertyDeep'),\n    isKey = require('./_isKey'),\n    toKey = require('./_toKey');\n\n/**\n * Creates a function that returns the value at `path` of a given object.\n *\n * @static\n * @memberOf _\n * @since 2.4.0\n * @category Util\n * @param {Array|string} path The path of the property to get.\n * @returns {Function} Returns the new accessor function.\n * @example\n *\n * var objects = [\n *   { 'a': { 'b': 2 } },\n *   { 'a': { 'b': 1 } }\n * ];\n *\n * _.map(objects, _.property('a.b'));\n * // => [2, 1]\n *\n * _.map(_.sortBy(objects, _.property(['a', 'b'])), 'a.b');\n * // => [1, 2]\n */\nfunction property(path) {\n  return isKey(path) ? baseProperty(toKey(path)) : basePropertyDeep(path);\n}\n\nmodule.exports = property;\n","var createRange = require('./_createRange');\n\n/**\n * Creates an array of numbers (positive and/or negative) progressing from\n * `start` up to, but not including, `end`. A step of `-1` is used if a negative\n * `start` is specified without an `end` or `step`. If `end` is not specified,\n * it's set to `start` with `start` then set to `0`.\n *\n * **Note:** JavaScript follows the IEEE-754 standard for resolving\n * floating-point values which can produce unexpected results.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {number} [start=0] The start of the range.\n * @param {number} end The end of the range.\n * @param {number} [step=1] The value to increment or decrement by.\n * @returns {Array} Returns the range of numbers.\n * @see _.inRange, _.rangeRight\n * @example\n *\n * _.range(4);\n * // => [0, 1, 2, 3]\n *\n * _.range(-4);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 5);\n * // => [1, 2, 3, 4]\n *\n * _.range(0, 20, 5);\n * // => [0, 5, 10, 15]\n *\n * _.range(0, -4, -1);\n * // => [0, -1, -2, -3]\n *\n * _.range(1, 4, 0);\n * // => [1, 1, 1]\n *\n * _.range(0);\n * // => []\n */\nvar range = createRange();\n\nmodule.exports = range;\n","var arrayReduce = require('./_arrayReduce'),\n    baseEach = require('./_baseEach'),\n    baseIteratee = require('./_baseIteratee'),\n    baseReduce = require('./_baseReduce'),\n    isArray = require('./isArray');\n\n/**\n * Reduces `collection` to a value which is the accumulated result of running\n * each element in `collection` thru `iteratee`, where each successive\n * invocation is supplied the return value of the previous. If `accumulator`\n * is not given, the first element of `collection` is used as the initial\n * value. The iteratee is invoked with four arguments:\n * (accumulator, value, index|key, collection).\n *\n * Many lodash methods are guarded to work as iteratees for methods like\n * `_.reduce`, `_.reduceRight`, and `_.transform`.\n *\n * The guarded methods are:\n * `assign`, `defaults`, `defaultsDeep`, `includes`, `merge`, `orderBy`,\n * and `sortBy`\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The initial value.\n * @returns {*} Returns the accumulated value.\n * @see _.reduceRight\n * @example\n *\n * _.reduce([1, 2], function(sum, n) {\n *   return sum + n;\n * }, 0);\n * // => 3\n *\n * _.reduce({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n *   return result;\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] } (iteration order is not guaranteed)\n */\nfunction reduce(collection, iteratee, accumulator) {\n  var func = isArray(collection) ? arrayReduce : baseReduce,\n      initAccum = arguments.length < 3;\n\n  return func(collection, baseIteratee(iteratee, 4), accumulator, initAccum, baseEach);\n}\n\nmodule.exports = reduce;\n","var baseKeys = require('./_baseKeys'),\n    getTag = require('./_getTag'),\n    isArrayLike = require('./isArrayLike'),\n    isString = require('./isString'),\n    stringSize = require('./_stringSize');\n\n/** `Object#toString` result references. */\nvar mapTag = '[object Map]',\n    setTag = '[object Set]';\n\n/**\n * Gets the size of `collection` by returning its length for array-like\n * values or the number of own enumerable string keyed properties for objects.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object|string} collection The collection to inspect.\n * @returns {number} Returns the collection size.\n * @example\n *\n * _.size([1, 2, 3]);\n * // => 3\n *\n * _.size({ 'a': 1, 'b': 2 });\n * // => 2\n *\n * _.size('pebbles');\n * // => 7\n */\nfunction size(collection) {\n  if (collection == null) {\n    return 0;\n  }\n  if (isArrayLike(collection)) {\n    return isString(collection) ? stringSize(collection) : collection.length;\n  }\n  var tag = getTag(collection);\n  if (tag == mapTag || tag == setTag) {\n    return collection.size;\n  }\n  return baseKeys(collection).length;\n}\n\nmodule.exports = size;\n","var baseFlatten = require('./_baseFlatten'),\n    baseOrderBy = require('./_baseOrderBy'),\n    baseRest = require('./_baseRest'),\n    isIterateeCall = require('./_isIterateeCall');\n\n/**\n * Creates an array of elements, sorted in ascending order by the results of\n * running each element in a collection thru each iteratee. This method\n * performs a stable sort, that is, it preserves the original sort order of\n * equal elements. The iteratees are invoked with one argument: (value).\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Collection\n * @param {Array|Object} collection The collection to iterate over.\n * @param {...(Function|Function[])} [iteratees=[_.identity]]\n *  The iteratees to sort by.\n * @returns {Array} Returns the new sorted array.\n * @example\n *\n * var users = [\n *   { 'user': 'fred',   'age': 48 },\n *   { 'user': 'barney', 'age': 36 },\n *   { 'user': 'fred',   'age': 30 },\n *   { 'user': 'barney', 'age': 34 }\n * ];\n *\n * _.sortBy(users, [function(o) { return o.user; }]);\n * // => objects for [['barney', 36], ['barney', 34], ['fred', 48], ['fred', 30]]\n *\n * _.sortBy(users, ['user', 'age']);\n * // => objects for [['barney', 34], ['barney', 36], ['fred', 30], ['fred', 48]]\n */\nvar sortBy = baseRest(function(collection, iteratees) {\n  if (collection == null) {\n    return [];\n  }\n  var length = iteratees.length;\n  if (length > 1 && isIterateeCall(collection, iteratees[0], iteratees[1])) {\n    iteratees = [];\n  } else if (length > 2 && isIterateeCall(iteratees[0], iteratees[1], iteratees[2])) {\n    iteratees = [iteratees[0]];\n  }\n  return baseOrderBy(collection, baseFlatten(iteratees, 1), []);\n});\n\nmodule.exports = sortBy;\n","/**\n * This method returns a new empty array.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {Array} Returns the new empty array.\n * @example\n *\n * var arrays = _.times(2, _.stubArray);\n *\n * console.log(arrays);\n * // => [[], []]\n *\n * console.log(arrays[0] === arrays[1]);\n * // => false\n */\nfunction stubArray() {\n  return [];\n}\n\nmodule.exports = stubArray;\n","/**\n * This method returns `false`.\n *\n * @static\n * @memberOf _\n * @since 4.13.0\n * @category Util\n * @returns {boolean} Returns `false`.\n * @example\n *\n * _.times(2, _.stubFalse);\n * // => [false, false]\n */\nfunction stubFalse() {\n  return false;\n}\n\nmodule.exports = stubFalse;\n","var toNumber = require('./toNumber');\n\n/** Used as references for various `Number` constants. */\nvar INFINITY = 1 / 0,\n    MAX_INTEGER = 1.7976931348623157e+308;\n\n/**\n * Converts `value` to a finite number.\n *\n * @static\n * @memberOf _\n * @since 4.12.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted number.\n * @example\n *\n * _.toFinite(3.2);\n * // => 3.2\n *\n * _.toFinite(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toFinite(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toFinite('3.2');\n * // => 3.2\n */\nfunction toFinite(value) {\n  if (!value) {\n    return value === 0 ? value : 0;\n  }\n  value = toNumber(value);\n  if (value === INFINITY || value === -INFINITY) {\n    var sign = (value < 0 ? -1 : 1);\n    return sign * MAX_INTEGER;\n  }\n  return value === value ? value : 0;\n}\n\nmodule.exports = toFinite;\n","var toFinite = require('./toFinite');\n\n/**\n * Converts `value` to an integer.\n *\n * **Note:** This method is loosely based on\n * [`ToInteger`](http://www.ecma-international.org/ecma-262/7.0/#sec-tointeger).\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {number} Returns the converted integer.\n * @example\n *\n * _.toInteger(3.2);\n * // => 3\n *\n * _.toInteger(Number.MIN_VALUE);\n * // => 0\n *\n * _.toInteger(Infinity);\n * // => 1.7976931348623157e+308\n *\n * _.toInteger('3.2');\n * // => 3\n */\nfunction toInteger(value) {\n  var result = toFinite(value),\n      remainder = result % 1;\n\n  return result === result ? (remainder ? result - remainder : result) : 0;\n}\n\nmodule.exports = toInteger;\n","var baseTrim = require('./_baseTrim'),\n    isObject = require('./isObject'),\n    isSymbol = require('./isSymbol');\n\n/** Used as references for various `Number` constants. */\nvar NAN = 0 / 0;\n\n/** Used to detect bad signed hexadecimal string values. */\nvar reIsBadHex = /^[-+]0x[0-9a-f]+$/i;\n\n/** Used to detect binary string values. */\nvar reIsBinary = /^0b[01]+$/i;\n\n/** Used to detect octal string values. */\nvar reIsOctal = /^0o[0-7]+$/i;\n\n/** Built-in method references without a dependency on `root`. */\nvar freeParseInt = parseInt;\n\n/**\n * Converts `value` to a number.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to process.\n * @returns {number} Returns the number.\n * @example\n *\n * _.toNumber(3.2);\n * // => 3.2\n *\n * _.toNumber(Number.MIN_VALUE);\n * // => 5e-324\n *\n * _.toNumber(Infinity);\n * // => Infinity\n *\n * _.toNumber('3.2');\n * // => 3.2\n */\nfunction toNumber(value) {\n  if (typeof value == 'number') {\n    return value;\n  }\n  if (isSymbol(value)) {\n    return NAN;\n  }\n  if (isObject(value)) {\n    var other = typeof value.valueOf == 'function' ? value.valueOf() : value;\n    value = isObject(other) ? (other + '') : other;\n  }\n  if (typeof value != 'string') {\n    return value === 0 ? value : +value;\n  }\n  value = baseTrim(value);\n  var isBinary = reIsBinary.test(value);\n  return (isBinary || reIsOctal.test(value))\n    ? freeParseInt(value.slice(2), isBinary ? 2 : 8)\n    : (reIsBadHex.test(value) ? NAN : +value);\n}\n\nmodule.exports = toNumber;\n","var copyObject = require('./_copyObject'),\n    keysIn = require('./keysIn');\n\n/**\n * Converts `value` to a plain object flattening inherited enumerable string\n * keyed properties of `value` to own properties of the plain object.\n *\n * @static\n * @memberOf _\n * @since 3.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {Object} Returns the converted plain object.\n * @example\n *\n * function Foo() {\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.assign({ 'a': 1 }, new Foo);\n * // => { 'a': 1, 'b': 2 }\n *\n * _.assign({ 'a': 1 }, _.toPlainObject(new Foo));\n * // => { 'a': 1, 'b': 2, 'c': 3 }\n */\nfunction toPlainObject(value) {\n  return copyObject(value, keysIn(value));\n}\n\nmodule.exports = toPlainObject;\n","var baseToString = require('./_baseToString');\n\n/**\n * Converts `value` to a string. An empty string is returned for `null`\n * and `undefined` values. The sign of `-0` is preserved.\n *\n * @static\n * @memberOf _\n * @since 4.0.0\n * @category Lang\n * @param {*} value The value to convert.\n * @returns {string} Returns the converted string.\n * @example\n *\n * _.toString(null);\n * // => ''\n *\n * _.toString(-0);\n * // => '-0'\n *\n * _.toString([1, 2, 3]);\n * // => '1,2,3'\n */\nfunction toString(value) {\n  return value == null ? '' : baseToString(value);\n}\n\nmodule.exports = toString;\n","var arrayEach = require('./_arrayEach'),\n    baseCreate = require('./_baseCreate'),\n    baseForOwn = require('./_baseForOwn'),\n    baseIteratee = require('./_baseIteratee'),\n    getPrototype = require('./_getPrototype'),\n    isArray = require('./isArray'),\n    isBuffer = require('./isBuffer'),\n    isFunction = require('./isFunction'),\n    isObject = require('./isObject'),\n    isTypedArray = require('./isTypedArray');\n\n/**\n * An alternative to `_.reduce`; this method transforms `object` to a new\n * `accumulator` object which is the result of running each of its own\n * enumerable string keyed properties thru `iteratee`, with each invocation\n * potentially mutating the `accumulator` object. If `accumulator` is not\n * provided, a new object with the same `[[Prototype]]` will be used. The\n * iteratee is invoked with four arguments: (accumulator, value, key, object).\n * Iteratee functions may exit iteration early by explicitly returning `false`.\n *\n * @static\n * @memberOf _\n * @since 1.3.0\n * @category Object\n * @param {Object} object The object to iterate over.\n * @param {Function} [iteratee=_.identity] The function invoked per iteration.\n * @param {*} [accumulator] The custom accumulator value.\n * @returns {*} Returns the accumulated value.\n * @example\n *\n * _.transform([2, 3, 4], function(result, n) {\n *   result.push(n *= n);\n *   return n % 2 == 0;\n * }, []);\n * // => [4, 9]\n *\n * _.transform({ 'a': 1, 'b': 2, 'c': 1 }, function(result, value, key) {\n *   (result[value] || (result[value] = [])).push(key);\n * }, {});\n * // => { '1': ['a', 'c'], '2': ['b'] }\n */\nfunction transform(object, iteratee, accumulator) {\n  var isArr = isArray(object),\n      isArrLike = isArr || isBuffer(object) || isTypedArray(object);\n\n  iteratee = baseIteratee(iteratee, 4);\n  if (accumulator == null) {\n    var Ctor = object && object.constructor;\n    if (isArrLike) {\n      accumulator = isArr ? new Ctor : [];\n    }\n    else if (isObject(object)) {\n      accumulator = isFunction(Ctor) ? baseCreate(getPrototype(object)) : {};\n    }\n    else {\n      accumulator = {};\n    }\n  }\n  (isArrLike ? arrayEach : baseForOwn)(object, function(value, index, object) {\n    return iteratee(accumulator, value, index, object);\n  });\n  return accumulator;\n}\n\nmodule.exports = transform;\n","var baseFlatten = require('./_baseFlatten'),\n    baseRest = require('./_baseRest'),\n    baseUniq = require('./_baseUniq'),\n    isArrayLikeObject = require('./isArrayLikeObject');\n\n/**\n * Creates an array of unique values, in order, from all given arrays using\n * [`SameValueZero`](http://ecma-international.org/ecma-262/7.0/#sec-samevaluezero)\n * for equality comparisons.\n *\n * @static\n * @memberOf _\n * @since 0.1.0\n * @category Array\n * @param {...Array} [arrays] The arrays to inspect.\n * @returns {Array} Returns the new array of combined values.\n * @example\n *\n * _.union([2], [1, 2]);\n * // => [2, 1]\n */\nvar union = baseRest(function(arrays) {\n  return baseUniq(baseFlatten(arrays, 1, isArrayLikeObject, true));\n});\n\nmodule.exports = union;\n","var toString = require('./toString');\n\n/** Used to generate unique IDs. */\nvar idCounter = 0;\n\n/**\n * Generates a unique ID. If `prefix` is given, the ID is appended to it.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Util\n * @param {string} [prefix=''] The value to prefix the ID with.\n * @returns {string} Returns the unique ID.\n * @example\n *\n * _.uniqueId('contact_');\n * // => 'contact_104'\n *\n * _.uniqueId();\n * // => '105'\n */\nfunction uniqueId(prefix) {\n  var id = ++idCounter;\n  return toString(prefix) + id;\n}\n\nmodule.exports = uniqueId;\n","var baseValues = require('./_baseValues'),\n    keys = require('./keys');\n\n/**\n * Creates an array of the own enumerable string keyed property values of `object`.\n *\n * **Note:** Non-object values are coerced to objects.\n *\n * @static\n * @since 0.1.0\n * @memberOf _\n * @category Object\n * @param {Object} object The object to query.\n * @returns {Array} Returns the array of property values.\n * @example\n *\n * function Foo() {\n *   this.a = 1;\n *   this.b = 2;\n * }\n *\n * Foo.prototype.c = 3;\n *\n * _.values(new Foo);\n * // => [1, 2] (iteration order is not guaranteed)\n *\n * _.values('hi');\n * // => ['h', 'i']\n */\nfunction values(object) {\n  return object == null ? [] : baseValues(object, keys(object));\n}\n\nmodule.exports = values;\n","var assignValue = require('./_assignValue'),\n    baseZipObject = require('./_baseZipObject');\n\n/**\n * This method is like `_.fromPairs` except that it accepts two arrays,\n * one of property identifiers and one of corresponding values.\n *\n * @static\n * @memberOf _\n * @since 0.4.0\n * @category Array\n * @param {Array} [props=[]] The property identifiers.\n * @param {Array} [values=[]] The property values.\n * @returns {Object} Returns the new object.\n * @example\n *\n * _.zipObject(['a', 'b'], [1, 2]);\n * // => { 'a': 1, 'b': 2 }\n */\nfunction zipObject(props, values) {\n  return baseZipObject(props || [], values || [], assignValue);\n}\n\nmodule.exports = zipObject;\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","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';\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","'use strict';\n\nObject.defineProperty(exports, '__esModule', { value: true });\n\nvar isAnyArray = require('is-any-array');\nvar rescale = require('ml-array-rescale');\n\nconst indent = ' '.repeat(2);\nconst indentData = ' '.repeat(4);\n\nfunction inspectMatrix() {\n  return inspectMatrixWithOptions(this);\n}\n\nfunction 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\nfunction 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\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 */\nfunction 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 */\nfunction 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 */\nfunction 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 */\nfunction 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\nfunction checkRowIndices(matrix, rowIndices) {\n  if (!isAnyArray.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\nfunction checkColumnIndices(matrix, columnIndices) {\n  if (!isAnyArray.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\nfunction 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\nfunction 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\nfunction checkNonEmpty(matrix) {\n  if (matrix.isEmpty()) {\n    throw new Error('Empty matrix has no elements to index');\n  }\n}\n\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nfunction 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\nclass 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  isDistance() {\n    if (!this.isSymmetric()) return false;\n\n    for (let i = 0; i < this.rows; i++) {\n      if (this.get(i, i) !== 0) return false;\n    }\n\n    return true;\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    switch (type) {\n      case 'max':\n        return this.max();\n      case 'frobenius':\n        return Math.sqrt(this.dot(this));\n      default:\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 result = AbstractMatrix.zeros(2 * c11.rows, 2 * c11.columns);\n      result = result.setSubMatrix(c11, 0, 0);\n      result = result.setSubMatrix(c12, c11.rows, 0);\n      result = result.setSubMatrix(c21, 0, c11.columns);\n      result = result.setSubMatrix(c22, c11.rows, c11.columns);\n      return result.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,\n          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    return this.constructor.copy(this, new Matrix(this.rows, this.columns));\n  }\n\n  /**\n   * @template {AbstractMatrix} M\n   * @param {AbstractMatrix} from\n   * @param {M} to\n   * @return {M}\n   */\n  static copy(from, to) {\n    for (const [row, column, value] of from.entries()) {\n      to.set(row, column, value);\n    }\n\n    return to;\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.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.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.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.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.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.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  [Symbol.iterator]() {\n    return this.entries();\n  }\n\n  /**\n   * iterator from left to right, from top to bottom\n   * yield [row, column, value]\n   * @returns {Generator<[number, number, number], void, *>}\n   */\n  *entries() {\n    for (let row = 0; row < this.rows; row++) {\n      for (let col = 0; col < this.columns; col++) {\n        yield [row, col, this.get(row, col)];\n      }\n    }\n  }\n\n  /**\n   * iterator from left to right, from top to bottom\n   * yield value\n   * @returns {Generator<number, void, *>}\n   */\n  *values() {\n    for (let row = 0; row < this.rows; row++) {\n      for (let col = 0; col < this.columns; col++) {\n        yield this.get(row, col);\n      }\n    }\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\nclass Matrix extends AbstractMatrix {\n  /**\n   * @type {Float64Array[]}\n   */\n  data;\n\n  /**\n   * Init an empty matrix\n   * @param {number} nRows\n   * @param {number} nColumns\n   */\n  #initData(nRows, nColumns) {\n    this.data = [];\n\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\n    this.rows = nRows;\n    this.columns = nColumns;\n  }\n\n  constructor(nRows, nColumns) {\n    super();\n    if (Matrix.isMatrix(nRows)) {\n      this.#initData(nRows.rows, nRows.columns);\n      Matrix.copy(nRows, this);\n    } else if (Number.isInteger(nRows) && nRows >= 0) {\n      this.#initData(nRows, nColumns);\n    } else if (isAnyArray.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\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\n      this.rows = nRows;\n      this.columns = nColumns;\n    } else {\n      throw new TypeError(\n        'First argument must be a positive number or an array',\n      );\n    }\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\n/**\n * @typedef {0 | 1 | number | boolean} Mask\n */\n\nclass SymmetricMatrix extends AbstractMatrix {\n  /** @type {Matrix} */\n  #matrix;\n\n  get size() {\n    return this.#matrix.size;\n  }\n\n  get rows() {\n    return this.#matrix.rows;\n  }\n\n  get columns() {\n    return this.#matrix.columns;\n  }\n\n  get diagonalSize() {\n    return this.rows;\n  }\n\n  /**\n   * not the same as matrix.isSymmetric()\n   * Here is to check if it's instanceof SymmetricMatrix without bundling issues\n   *\n   * @param value\n   * @returns {boolean}\n   */\n  static isSymmetricMatrix(value) {\n    return Matrix.isMatrix(value) && value.klassType === 'SymmetricMatrix';\n  }\n\n  /**\n   * @param diagonalSize\n   * @return {SymmetricMatrix}\n   */\n  static zeros(diagonalSize) {\n    return new this(diagonalSize);\n  }\n\n  /**\n   * @param diagonalSize\n   * @return {SymmetricMatrix}\n   */\n  static ones(diagonalSize) {\n    return new this(diagonalSize).fill(1);\n  }\n\n  /**\n   * @param {number | AbstractMatrix | ArrayLike<ArrayLike<number>>} diagonalSize\n   * @return {this}\n   */\n  constructor(diagonalSize) {\n    super();\n\n    if (Matrix.isMatrix(diagonalSize)) {\n      if (!diagonalSize.isSymmetric()) {\n        throw new TypeError('not symmetric data');\n      }\n\n      this.#matrix = Matrix.copy(\n        diagonalSize,\n        new Matrix(diagonalSize.rows, diagonalSize.rows),\n      );\n    } else if (Number.isInteger(diagonalSize) && diagonalSize >= 0) {\n      this.#matrix = new Matrix(diagonalSize, diagonalSize);\n    } else {\n      this.#matrix = new Matrix(diagonalSize);\n\n      if (!this.isSymmetric()) {\n        throw new TypeError('not symmetric data');\n      }\n    }\n  }\n\n  clone() {\n    const matrix = new SymmetricMatrix(this.diagonalSize);\n\n    for (const [row, col, value] of this.upperRightEntries()) {\n      matrix.set(row, col, value);\n    }\n\n    return matrix;\n  }\n\n  toMatrix() {\n    return new Matrix(this);\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.#matrix.get(rowIndex, columnIndex);\n  }\n  set(rowIndex, columnIndex, value) {\n    // symmetric set\n    this.#matrix.set(rowIndex, columnIndex, value);\n    this.#matrix.set(columnIndex, rowIndex, value);\n\n    return this;\n  }\n\n  removeCross(index) {\n    // symmetric remove side\n    this.#matrix.removeRow(index);\n    this.#matrix.removeColumn(index);\n\n    return this;\n  }\n\n  addCross(index, array) {\n    if (array === undefined) {\n      array = index;\n      index = this.diagonalSize;\n    }\n\n    const row = array.slice();\n    row.splice(index, 1);\n\n    this.#matrix.addRow(index, row);\n    this.#matrix.addColumn(index, array);\n\n    return this;\n  }\n\n  /**\n   * @param {Mask[]} mask\n   */\n  applyMask(mask) {\n    if (mask.length !== this.diagonalSize) {\n      throw new RangeError('Mask size do not match with matrix size');\n    }\n\n    // prepare sides to remove from matrix from mask\n    /** @type {number[]} */\n    const sidesToRemove = [];\n    for (const [index, passthroughs] of mask.entries()) {\n      if (passthroughs) continue;\n      sidesToRemove.push(index);\n    }\n    // to remove from highest to lowest for no mutation shifting\n    sidesToRemove.reverse();\n\n    // remove sides\n    for (const sideIndex of sidesToRemove) {\n      this.removeCross(sideIndex);\n    }\n\n    return this;\n  }\n\n  /**\n   * Compact format upper-right corner of matrix\n   * iterate from left to right, from top to bottom.\n   *\n   * ```\n   *   A B C D\n   * A 1 2 3 4\n   * B 2 5 6 7\n   * C 3 6 8 9\n   * D 4 7 9 10\n   * ```\n   *\n   * will return compact 1D array `[1, 2, 3, 4, 5, 6, 7, 8, 9, 10]`\n   *\n   * length is S(i=0, n=sideSize) => 10 for a 4 sideSized matrix\n   *\n   * @returns {number[]}\n   */\n  toCompact() {\n    const { diagonalSize } = this;\n\n    /** @type {number[]} */\n    const compact = new Array((diagonalSize * (diagonalSize + 1)) / 2);\n    for (let col = 0, row = 0, index = 0; index < compact.length; index++) {\n      compact[index] = this.get(row, col);\n\n      if (++col >= diagonalSize) col = ++row;\n    }\n\n    return compact;\n  }\n\n  /**\n   * @param {number[]} compact\n   * @return {SymmetricMatrix}\n   */\n  static fromCompact(compact) {\n    const compactSize = compact.length;\n    // compactSize = (sideSize * (sideSize + 1)) / 2\n    // https://mathsolver.microsoft.com/fr/solve-problem/y%20%3D%20%20x%20%60cdot%20%20%20%60frac%7B%20%20%60left(%20x%2B1%20%20%60right)%20%20%20%20%7D%7B%202%20%20%7D\n    // sideSize = (Sqrt(8 × compactSize + 1) - 1) / 2\n    const diagonalSize = (Math.sqrt(8 * compactSize + 1) - 1) / 2;\n\n    if (!Number.isInteger(diagonalSize)) {\n      throw new TypeError(\n        `This array is not a compact representation of a Symmetric Matrix, ${JSON.stringify(\n          compact,\n        )}`,\n      );\n    }\n\n    const matrix = new SymmetricMatrix(diagonalSize);\n    for (let col = 0, row = 0, index = 0; index < compactSize; index++) {\n      matrix.set(col, row, compact[index]);\n      if (++col >= diagonalSize) col = ++row;\n    }\n\n    return matrix;\n  }\n\n  /**\n   * half iterator upper-right-corner from left to right, from top to bottom\n   * yield [row, column, value]\n   *\n   * @returns {Generator<[number, number, number], void, *>}\n   */\n  *upperRightEntries() {\n    for (let row = 0, col = 0; row < this.diagonalSize; void 0) {\n      const value = this.get(row, col);\n\n      yield [row, col, value];\n\n      // at the end of row, move cursor to next row at diagonal position\n      if (++col >= this.diagonalSize) col = ++row;\n    }\n  }\n\n  /**\n   * half iterator upper-right-corner from left to right, from top to bottom\n   * yield value\n   *\n   * @returns {Generator<[number, number, number], void, *>}\n   */\n  *upperRightValues() {\n    for (let row = 0, col = 0; row < this.diagonalSize; void 0) {\n      const value = this.get(row, col);\n\n      yield value;\n\n      // at the end of row, move cursor to next row at diagonal position\n      if (++col >= this.diagonalSize) col = ++row;\n    }\n  }\n}\nSymmetricMatrix.prototype.klassType = 'SymmetricMatrix';\n\nclass DistanceMatrix extends SymmetricMatrix {\n  /**\n   * not the same as matrix.isSymmetric()\n   * Here is to check if it's instanceof SymmetricMatrix without bundling issues\n   *\n   * @param value\n   * @returns {boolean}\n   */\n  static isDistanceMatrix(value) {\n    return (\n      SymmetricMatrix.isSymmetricMatrix(value) &&\n      value.klassSubType === 'DistanceMatrix'\n    );\n  }\n\n  constructor(sideSize) {\n    super(sideSize);\n\n    if (!this.isDistance()) {\n      throw new TypeError('Provided arguments do no produce a distance matrix');\n    }\n  }\n\n  set(rowIndex, columnIndex, value) {\n    // distance matrix diagonal is 0\n    if (rowIndex === columnIndex) value = 0;\n\n    return super.set(rowIndex, columnIndex, value);\n  }\n\n  addCross(index, array) {\n    if (array === undefined) {\n      array = index;\n      index = this.diagonalSize;\n    }\n\n    // ensure distance\n    array = array.slice();\n    array[index] = 0;\n\n    return super.addCross(index, array);\n  }\n\n  toSymmetricMatrix() {\n    return new SymmetricMatrix(this);\n  }\n\n  clone() {\n    const matrix = new DistanceMatrix(this.diagonalSize);\n\n    for (const [row, col, value] of this.upperRightEntries()) {\n      if (row === col) continue;\n      matrix.set(row, col, value);\n    }\n\n    return matrix;\n  }\n\n  /**\n   * Compact format upper-right corner of matrix\n   * no diagonal (only zeros)\n   * iterable from left to right, from top to bottom.\n   *\n   * ```\n   *   A B C D\n   * A 0 1 2 3\n   * B 1 0 4 5\n   * C 2 4 0 6\n   * D 3 5 6 0\n   * ```\n   *\n   * will return compact 1D array `[1, 2, 3, 4, 5, 6]`\n   *\n   * length is S(i=0, n=sideSize-1) => 6 for a 4 side sized matrix\n   *\n   * @returns {number[]}\n   */\n  toCompact() {\n    const { diagonalSize } = this;\n    const compactLength = ((diagonalSize - 1) * diagonalSize) / 2;\n\n    /** @type {number[]} */\n    const compact = new Array(compactLength);\n    for (let col = 1, row = 0, index = 0; index < compact.length; index++) {\n      compact[index] = this.get(row, col);\n\n      if (++col >= diagonalSize) col = ++row + 1;\n    }\n\n    return compact;\n  }\n\n  /**\n   * @param {number[]} compact\n   */\n  static fromCompact(compact) {\n    const compactSize = compact.length;\n    // compactSize = (sideSize * (sideSize - 1)) / 2\n    // sideSize = (Sqrt(8 × compactSize + 1) + 1) / 2\n    const diagonalSize = (Math.sqrt(8 * compactSize + 1) + 1) / 2;\n\n    if (!Number.isInteger(diagonalSize)) {\n      throw new TypeError(\n        `This array is not a compact representation of a DistanceMatrix, ${JSON.stringify(\n          compact,\n        )}`,\n      );\n    }\n\n    const matrix = new this(diagonalSize);\n    for (let col = 1, row = 0, index = 0; index < compactSize; index++) {\n      matrix.set(col, row, compact[index]);\n      if (++col >= diagonalSize) col = ++row + 1;\n    }\n\n    return matrix;\n  }\n}\nDistanceMatrix.prototype.klassSubType = 'DistanceMatrix';\n\nclass BaseView extends AbstractMatrix {\n  constructor(matrix, rows, columns) {\n    super();\n    this.matrix = matrix;\n    this.rows = rows;\n    this.columns = columns;\n  }\n}\n\nclass MatrixColumnView extends BaseView {\n  constructor(matrix, column) {\n    checkColumnIndex(matrix, column);\n    super(matrix, matrix.rows, 1);\n    this.column = column;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(rowIndex, this.column, value);\n    return this;\n  }\n\n  get(rowIndex) {\n    return this.matrix.get(rowIndex, this.column);\n  }\n}\n\nclass MatrixColumnSelectionView extends BaseView {\n  constructor(matrix, columnIndices) {\n    checkColumnIndices(matrix, columnIndices);\n    super(matrix, matrix.rows, columnIndices.length);\n    this.columnIndices = columnIndices;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(rowIndex, this.columnIndices[columnIndex], value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(rowIndex, this.columnIndices[columnIndex]);\n  }\n}\n\nclass MatrixFlipColumnView extends BaseView {\n  constructor(matrix) {\n    super(matrix, matrix.rows, matrix.columns);\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(rowIndex, this.columns - columnIndex - 1, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(rowIndex, this.columns - columnIndex - 1);\n  }\n}\n\nclass MatrixFlipRowView extends BaseView {\n  constructor(matrix) {\n    super(matrix, matrix.rows, matrix.columns);\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(this.rows - rowIndex - 1, columnIndex, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(this.rows - rowIndex - 1, columnIndex);\n  }\n}\n\nclass MatrixRowView extends BaseView {\n  constructor(matrix, row) {\n    checkRowIndex(matrix, row);\n    super(matrix, 1, matrix.columns);\n    this.row = row;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(this.row, columnIndex, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(this.row, columnIndex);\n  }\n}\n\nclass MatrixRowSelectionView extends BaseView {\n  constructor(matrix, rowIndices) {\n    checkRowIndices(matrix, rowIndices);\n    super(matrix, rowIndices.length, matrix.columns);\n    this.rowIndices = rowIndices;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(this.rowIndices[rowIndex], columnIndex, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(this.rowIndices[rowIndex], columnIndex);\n  }\n}\n\nclass MatrixSelectionView extends BaseView {\n  constructor(matrix, rowIndices, columnIndices) {\n    checkRowIndices(matrix, rowIndices);\n    checkColumnIndices(matrix, columnIndices);\n    super(matrix, rowIndices.length, columnIndices.length);\n    this.rowIndices = rowIndices;\n    this.columnIndices = columnIndices;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(\n      this.rowIndices[rowIndex],\n      this.columnIndices[columnIndex],\n      value,\n    );\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(\n      this.rowIndices[rowIndex],\n      this.columnIndices[columnIndex],\n    );\n  }\n}\n\nclass MatrixSubView extends BaseView {\n  constructor(matrix, startRow, endRow, startColumn, endColumn) {\n    checkRange(matrix, startRow, endRow, startColumn, endColumn);\n    super(matrix, endRow - startRow + 1, endColumn - startColumn + 1);\n    this.startRow = startRow;\n    this.startColumn = startColumn;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(\n      this.startRow + rowIndex,\n      this.startColumn + columnIndex,\n      value,\n    );\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(\n      this.startRow + rowIndex,\n      this.startColumn + columnIndex,\n    );\n  }\n}\n\nclass MatrixTransposeView extends BaseView {\n  constructor(matrix) {\n    super(matrix, matrix.columns, matrix.rows);\n  }\n\n  set(rowIndex, columnIndex, value) {\n    this.matrix.set(columnIndex, rowIndex, value);\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    return this.matrix.get(columnIndex, rowIndex);\n  }\n}\n\nclass WrapperMatrix1D extends AbstractMatrix {\n  constructor(data, options = {}) {\n    const { rows = 1 } = options;\n\n    if (data.length % rows !== 0) {\n      throw new Error('the data length is not divisible by the number of rows');\n    }\n    super();\n    this.rows = rows;\n    this.columns = data.length / rows;\n    this.data = data;\n  }\n\n  set(rowIndex, columnIndex, value) {\n    let index = this._calculateIndex(rowIndex, columnIndex);\n    this.data[index] = value;\n    return this;\n  }\n\n  get(rowIndex, columnIndex) {\n    let index = this._calculateIndex(rowIndex, columnIndex);\n    return this.data[index];\n  }\n\n  _calculateIndex(row, column) {\n    return row * this.columns + column;\n  }\n}\n\nclass 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\nfunction wrap(array, options) {\n  if (isAnyArray.isAnyArray(array)) {\n    if (array[0] && isAnyArray.isAnyArray(array[0])) {\n      return new WrapperMatrix2D(array);\n    } else {\n      return new WrapperMatrix1D(array, options);\n    }\n  } else {\n    throw new Error('the argument is not an array');\n  }\n}\n\nclass LuDecomposition {\n  constructor(matrix) {\n    matrix = WrapperMatrix2D.checkMatrix(matrix);\n\n    let lu = matrix.clone();\n    let rows = lu.rows;\n    let columns = lu.columns;\n    let pivotVector = new Float64Array(rows);\n    let pivotSign = 1;\n    let i, j, k, p, s, t, v;\n    let LUcolj, kmax;\n\n    for (i = 0; i < rows; i++) {\n      pivotVector[i] = i;\n    }\n\n    LUcolj = new Float64Array(rows);\n\n    for (j = 0; j < columns; j++) {\n      for (i = 0; i < rows; i++) {\n        LUcolj[i] = lu.get(i, j);\n      }\n\n      for (i = 0; i < rows; i++) {\n        kmax = Math.min(i, j);\n        s = 0;\n        for (k = 0; k < kmax; k++) {\n          s += lu.get(i, k) * LUcolj[k];\n        }\n        LUcolj[i] -= s;\n        lu.set(i, j, LUcolj[i]);\n      }\n\n      p = j;\n      for (i = j + 1; i < rows; i++) {\n        if (Math.abs(LUcolj[i]) > Math.abs(LUcolj[p])) {\n          p = i;\n        }\n      }\n\n      if (p !== j) {\n        for (k = 0; k < columns; k++) {\n          t = lu.get(p, k);\n          lu.set(p, k, lu.get(j, k));\n          lu.set(j, k, t);\n        }\n\n        v = pivotVector[p];\n        pivotVector[p] = pivotVector[j];\n        pivotVector[j] = v;\n\n        pivotSign = -pivotSign;\n      }\n\n      if (j < rows && lu.get(j, j) !== 0) {\n        for (i = j + 1; i < rows; i++) {\n          lu.set(i, j, lu.get(i, j) / lu.get(j, j));\n        }\n      }\n    }\n\n    this.LU = lu;\n    this.pivotVector = pivotVector;\n    this.pivotSign = pivotSign;\n  }\n\n  isSingular() {\n    let data = this.LU;\n    let col = data.columns;\n    for (let j = 0; j < col; j++) {\n      if (data.get(j, j) === 0) {\n        return true;\n      }\n    }\n    return false;\n  }\n\n  solve(value) {\n    value = Matrix.checkMatrix(value);\n\n    let lu = this.LU;\n    let rows = lu.rows;\n\n    if (rows !== value.rows) {\n      throw new Error('Invalid matrix dimensions');\n    }\n    if (this.isSingular()) {\n      throw new Error('LU matrix is singular');\n    }\n\n    let count = value.columns;\n    let X = value.subMatrixRow(this.pivotVector, 0, count - 1);\n    let columns = lu.columns;\n    let i, j, k;\n\n    for (k = 0; k < columns; k++) {\n      for (i = k + 1; i < columns; i++) {\n        for (j = 0; j < count; j++) {\n          X.set(i, j, X.get(i, j) - X.get(k, j) * lu.get(i, k));\n        }\n      }\n    }\n    for (k = columns - 1; k >= 0; k--) {\n      for (j = 0; j < count; j++) {\n        X.set(k, j, X.get(k, j) / lu.get(k, k));\n      }\n      for (i = 0; i < k; i++) {\n        for (j = 0; j < count; j++) {\n          X.set(i, j, X.get(i, j) - X.get(k, j) * lu.get(i, k));\n        }\n      }\n    }\n    return X;\n  }\n\n  get determinant() {\n    let data = this.LU;\n    if (!data.isSquare()) {\n      throw new Error('Matrix must be square');\n    }\n    let determinant = this.pivotSign;\n    let col = data.columns;\n    for (let j = 0; j < col; j++) {\n      determinant *= data.get(j, j);\n    }\n    return determinant;\n  }\n\n  get lowerTriangularMatrix() {\n    let data = this.LU;\n    let rows = data.rows;\n    let columns = data.columns;\n    let X = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        if (i > j) {\n          X.set(i, j, data.get(i, j));\n        } else if (i === j) {\n          X.set(i, j, 1);\n        } else {\n          X.set(i, j, 0);\n        }\n      }\n    }\n    return X;\n  }\n\n  get upperTriangularMatrix() {\n    let data = this.LU;\n    let rows = data.rows;\n    let columns = data.columns;\n    let X = new Matrix(rows, columns);\n    for (let i = 0; i < rows; i++) {\n      for (let j = 0; j < columns; j++) {\n        if (i <= j) {\n          X.set(i, j, data.get(i, j));\n        } else {\n          X.set(i, j, 0);\n        }\n      }\n    }\n    return X;\n  }\n\n  get pivotPermutationVector() {\n    return Array.from(this.pivotVector);\n  }\n}\n\nfunction 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\nclass QrDecomposition {\n  constructor(value) {\n    value = WrapperMatrix2D.checkMatrix(value);\n\n    let qr = value.clone();\n    let m = value.rows;\n    let n = value.columns;\n    let rdiag = new Float64Array(n);\n    let i, j, k, s;\n\n    for (k = 0; k < n; k++) {\n      let nrm = 0;\n      for (i = k; i < m; i++) {\n        nrm = hypotenuse(nrm, qr.get(i, k));\n      }\n      if (nrm !== 0) {\n        if (qr.get(k, k) < 0) {\n          nrm = -nrm;\n        }\n        for (i = k; i < m; i++) {\n          qr.set(i, k, qr.get(i, k) / nrm);\n        }\n        qr.set(k, k, qr.get(k, k) + 1);\n        for (j = k + 1; j < n; j++) {\n          s = 0;\n          for (i = k; i < m; i++) {\n            s += qr.get(i, k) * qr.get(i, j);\n          }\n          s = -s / qr.get(k, k);\n          for (i = k; i < m; i++) {\n            qr.set(i, j, qr.get(i, j) + s * qr.get(i, k));\n          }\n        }\n      }\n      rdiag[k] = -nrm;\n    }\n\n    this.QR = qr;\n    this.Rdiag = rdiag;\n  }\n\n  solve(value) {\n    value = Matrix.checkMatrix(value);\n\n    let qr = this.QR;\n    let m = qr.rows;\n\n    if (value.rows !== m) {\n      throw new Error('Matrix row dimensions must agree');\n    }\n    if (!this.isFullRank()) {\n      throw new Error('Matrix is rank deficient');\n    }\n\n    let count = value.columns;\n    let X = value.clone();\n    let n = qr.columns;\n    let i, j, k, s;\n\n    for (k = 0; k < n; k++) {\n      for (j = 0; j < count; j++) {\n        s = 0;\n        for (i = k; i < m; i++) {\n          s += qr.get(i, k) * X.get(i, j);\n        }\n        s = -s / qr.get(k, k);\n        for (i = k; i < m; i++) {\n          X.set(i, j, X.get(i, j) + s * qr.get(i, k));\n        }\n      }\n    }\n    for (k = n - 1; k >= 0; k--) {\n      for (j = 0; j < count; j++) {\n        X.set(k, j, X.get(k, j) / this.Rdiag[k]);\n      }\n      for (i = 0; i < k; i++) {\n        for (j = 0; j < count; j++) {\n          X.set(i, j, X.get(i, j) - X.get(k, j) * qr.get(i, k));\n        }\n      }\n    }\n\n    return X.subMatrix(0, n - 1, 0, count - 1);\n  }\n\n  isFullRank() {\n    let columns = this.QR.columns;\n    for (let i = 0; i < columns; i++) {\n      if (this.Rdiag[i] === 0) {\n        return false;\n      }\n    }\n    return true;\n  }\n\n  get upperTriangularMatrix() {\n    let qr = this.QR;\n    let n = qr.columns;\n    let X = new Matrix(n, n);\n    let i, j;\n    for (i = 0; i < n; i++) {\n      for (j = 0; j < n; j++) {\n        if (i < j) {\n          X.set(i, j, qr.get(i, j));\n        } else if (i === j) {\n          X.set(i, j, this.Rdiag[i]);\n        } else {\n          X.set(i, j, 0);\n        }\n      }\n    }\n    return X;\n  }\n\n  get orthogonalMatrix() {\n    let qr = this.QR;\n    let rows = qr.rows;\n    let columns = qr.columns;\n    let X = new Matrix(rows, columns);\n    let i, j, k, s;\n\n    for (k = columns - 1; k >= 0; k--) {\n      for (i = 0; i < rows; i++) {\n        X.set(i, k, 0);\n      }\n      X.set(k, k, 1);\n      for (j = k; j < columns; j++) {\n        if (qr.get(k, k) !== 0) {\n          s = 0;\n          for (i = k; i < rows; i++) {\n            s += qr.get(i, k) * X.get(i, j);\n          }\n\n          s = -s / qr.get(k, k);\n\n          for (i = k; i < rows; i++) {\n            X.set(i, j, X.get(i, j) + s * qr.get(i, k));\n          }\n        }\n      }\n    }\n    return X;\n  }\n}\n\nclass 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 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          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          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\nfunction inverse(matrix, useSVD = false) {\n  matrix = WrapperMatrix2D.checkMatrix(matrix);\n  if (useSVD) {\n    return new SingularValueDecomposition(matrix).inverse();\n  } else {\n    return solve(matrix, Matrix.eye(matrix.rows));\n  }\n}\n\nfunction solve(leftHandSide, rightHandSide, useSVD = false) {\n  leftHandSide = WrapperMatrix2D.checkMatrix(leftHandSide);\n  rightHandSide = WrapperMatrix2D.checkMatrix(rightHandSide);\n  if (useSVD) {\n    return new SingularValueDecomposition(leftHandSide).solve(rightHandSide);\n  } else {\n    return leftHandSide.isSquare()\n      ? new LuDecomposition(leftHandSide).solve(rightHandSide)\n      : new QrDecomposition(leftHandSide).solve(rightHandSide);\n  }\n}\n\nfunction determinant(matrix) {\n  matrix = Matrix.checkMatrix(matrix);\n  if (matrix.isSquare()) {\n    if (matrix.columns === 0) {\n      return 1;\n    }\n\n    let a, b, c, d;\n    if (matrix.columns === 2) {\n      // 2 x 2 matrix\n      a = matrix.get(0, 0);\n      b = matrix.get(0, 1);\n      c = matrix.get(1, 0);\n      d = matrix.get(1, 1);\n\n      return a * d - b * c;\n    } else if (matrix.columns === 3) {\n      // 3 x 3 matrix\n      let subMatrix0, subMatrix1, subMatrix2;\n      subMatrix0 = new MatrixSelectionView(matrix, [1, 2], [1, 2]);\n      subMatrix1 = new MatrixSelectionView(matrix, [1, 2], [0, 2]);\n      subMatrix2 = new MatrixSelectionView(matrix, [1, 2], [0, 1]);\n      a = matrix.get(0, 0);\n      b = matrix.get(0, 1);\n      c = matrix.get(0, 2);\n\n      return (\n        a * determinant(subMatrix0) -\n        b * determinant(subMatrix1) +\n        c * determinant(subMatrix2)\n      );\n    } else {\n      // general purpose determinant using the LU decomposition\n      return new LuDecomposition(matrix).determinant;\n    }\n  } else {\n    throw Error('determinant can only be calculated for a square matrix');\n  }\n}\n\nfunction xrange(n, exception) {\n  let range = [];\n  for (let i = 0; i < n; i++) {\n    if (i !== exception) {\n      range.push(i);\n    }\n  }\n  return range;\n}\n\nfunction dependenciesOneRow(\n  error,\n  matrix,\n  index,\n  thresholdValue = 10e-10,\n  thresholdError = 10e-10,\n) {\n  if (error > thresholdError) {\n    return new Array(matrix.rows + 1).fill(0);\n  } else {\n    let returnArray = matrix.addRow(index, [0]);\n    for (let i = 0; i < returnArray.rows; i++) {\n      if (Math.abs(returnArray.get(i, 0)) < thresholdValue) {\n        returnArray.set(i, 0, 0);\n      }\n    }\n    return returnArray.to1DArray();\n  }\n}\n\nfunction linearDependencies(matrix, options = {}) {\n  const { thresholdValue = 10e-10, thresholdError = 10e-10 } = options;\n  matrix = Matrix.checkMatrix(matrix);\n\n  let n = matrix.rows;\n  let results = new Matrix(n, n);\n\n  for (let i = 0; i < n; i++) {\n    let b = Matrix.columnVector(matrix.getRow(i));\n    let Abis = matrix.subMatrixRow(xrange(n, i)).transpose();\n    let svd = new SingularValueDecomposition(Abis);\n    let x = svd.solve(b);\n    let error = Matrix.sub(b, Abis.mmul(x)).abs().max();\n    results.setRow(\n      i,\n      dependenciesOneRow(error, x, i, thresholdValue, thresholdError),\n    );\n  }\n  return results;\n}\n\nfunction pseudoInverse(matrix, threshold = Number.EPSILON) {\n  matrix = Matrix.checkMatrix(matrix);\n  if (matrix.isEmpty()) {\n    // with a zero dimension, the pseudo-inverse is the transpose, since all 0xn and nx0 matrices are singular\n    // (0xn)*(nx0)*(0xn) = 0xn\n    // (nx0)*(0xn)*(nx0) = nx0\n    return matrix.transpose();\n  }\n  let svdSolution = new SingularValueDecomposition(matrix, { autoTranspose: true });\n\n  let U = svdSolution.leftSingularVectors;\n  let V = svdSolution.rightSingularVectors;\n  let s = svdSolution.diagonal;\n\n  for (let i = 0; i < s.length; i++) {\n    if (Math.abs(s[i]) > threshold) {\n      s[i] = 1.0 / s[i];\n    } else {\n      s[i] = 0.0;\n    }\n  }\n\n  return V.mmul(Matrix.diag(s).mmul(U.transpose()));\n}\n\nfunction covariance(xMatrix, yMatrix = xMatrix, options = {}) {\n  xMatrix = new Matrix(xMatrix);\n  let yIsSame = false;\n  if (\n    typeof yMatrix === 'object' &&\n    !Matrix.isMatrix(yMatrix) &&\n    !isAnyArray.isAnyArray(yMatrix)\n  ) {\n    options = yMatrix;\n    yMatrix = xMatrix;\n    yIsSame = true;\n  } else {\n    yMatrix = new Matrix(yMatrix);\n  }\n  if (xMatrix.rows !== yMatrix.rows) {\n    throw new TypeError('Both matrices must have the same number of rows');\n  }\n  const { center = true } = options;\n  if (center) {\n    xMatrix = xMatrix.center('column');\n    if (!yIsSame) {\n      yMatrix = yMatrix.center('column');\n    }\n  }\n  const cov = xMatrix.transpose().mmul(yMatrix);\n  for (let i = 0; i < cov.rows; i++) {\n    for (let j = 0; j < cov.columns; j++) {\n      cov.set(i, j, cov.get(i, j) * (1 / (xMatrix.rows - 1)));\n    }\n  }\n  return cov;\n}\n\nfunction correlation(xMatrix, yMatrix = xMatrix, options = {}) {\n  xMatrix = new Matrix(xMatrix);\n  let yIsSame = false;\n  if (\n    typeof yMatrix === 'object' &&\n    !Matrix.isMatrix(yMatrix) &&\n    !isAnyArray.isAnyArray(yMatrix)\n  ) {\n    options = yMatrix;\n    yMatrix = xMatrix;\n    yIsSame = true;\n  } else {\n    yMatrix = new Matrix(yMatrix);\n  }\n  if (xMatrix.rows !== yMatrix.rows) {\n    throw new TypeError('Both matrices must have the same number of rows');\n  }\n\n  const { center = true, scale = true } = options;\n  if (center) {\n    xMatrix.center('column');\n    if (!yIsSame) {\n      yMatrix.center('column');\n    }\n  }\n  if (scale) {\n    xMatrix.scale('column');\n    if (!yIsSame) {\n      yMatrix.scale('column');\n    }\n  }\n\n  const sdx = xMatrix.standardDeviation('column', { unbiased: true });\n  const sdy = yIsSame\n    ? sdx\n    : yMatrix.standardDeviation('column', { unbiased: true });\n\n  const corr = xMatrix.transpose().mmul(yMatrix);\n  for (let i = 0; i < corr.rows; i++) {\n    for (let j = 0; j < corr.columns; j++) {\n      corr.set(\n        i,\n        j,\n        corr.get(i, j) * (1 / (sdx[i] * sdy[j])) * (1 / (xMatrix.rows - 1)),\n      );\n    }\n  }\n  return corr;\n}\n\nclass EigenvalueDecomposition {\n  constructor(matrix, options = {}) {\n    const { assumeSymmetric = false } = options;\n\n    matrix = WrapperMatrix2D.checkMatrix(matrix);\n    if (!matrix.isSquare()) {\n      throw new Error('Matrix is not a square matrix');\n    }\n\n    if (matrix.isEmpty()) {\n      throw new Error('Matrix must be non-empty');\n    }\n\n    let n = matrix.columns;\n    let V = new Matrix(n, n);\n    let d = new Float64Array(n);\n    let e = new Float64Array(n);\n    let value = matrix;\n    let i, j;\n\n    let isSymmetric = false;\n    if (assumeSymmetric) {\n      isSymmetric = true;\n    } else {\n      isSymmetric = matrix.isSymmetric();\n    }\n\n    if (isSymmetric) {\n      for (i = 0; i < n; i++) {\n        for (j = 0; j < n; j++) {\n          V.set(i, j, value.get(i, j));\n        }\n      }\n      tred2(n, e, d, V);\n      tql2(n, e, d, V);\n    } else {\n      let H = new Matrix(n, n);\n      let ort = new Float64Array(n);\n      for (j = 0; j < n; j++) {\n        for (i = 0; i < n; i++) {\n          H.set(i, j, value.get(i, j));\n        }\n      }\n      orthes(n, H, ort, V);\n      hqr2(n, e, d, V, H);\n    }\n\n    this.n = n;\n    this.e = e;\n    this.d = d;\n    this.V = V;\n  }\n\n  get realEigenvalues() {\n    return Array.from(this.d);\n  }\n\n  get imaginaryEigenvalues() {\n    return Array.from(this.e);\n  }\n\n  get eigenvectorMatrix() {\n    return this.V;\n  }\n\n  get diagonalMatrix() {\n    let n = this.n;\n    let e = this.e;\n    let d = this.d;\n    let X = new Matrix(n, n);\n    let i, j;\n    for (i = 0; i < n; i++) {\n      for (j = 0; j < n; j++) {\n        X.set(i, j, 0);\n      }\n      X.set(i, i, d[i]);\n      if (e[i] > 0) {\n        X.set(i, i + 1, e[i]);\n      } else if (e[i] < 0) {\n        X.set(i, i - 1, e[i]);\n      }\n    }\n    return X;\n  }\n}\n\nfunction tred2(n, e, d, V) {\n  let f, g, h, i, j, k, hh, scale;\n\n  for (j = 0; j < n; j++) {\n    d[j] = V.get(n - 1, j);\n  }\n\n  for (i = n - 1; i > 0; i--) {\n    scale = 0;\n    h = 0;\n    for (k = 0; k < i; k++) {\n      scale = scale + Math.abs(d[k]);\n    }\n\n    if (scale === 0) {\n      e[i] = d[i - 1];\n      for (j = 0; j < i; j++) {\n        d[j] = V.get(i - 1, j);\n        V.set(i, j, 0);\n        V.set(j, i, 0);\n      }\n    } else {\n      for (k = 0; k < i; k++) {\n        d[k] /= scale;\n        h += d[k] * d[k];\n      }\n\n      f = d[i - 1];\n      g = Math.sqrt(h);\n      if (f > 0) {\n        g = -g;\n      }\n\n      e[i] = scale * g;\n      h = h - f * g;\n      d[i - 1] = f - g;\n      for (j = 0; j < i; j++) {\n        e[j] = 0;\n      }\n\n      for (j = 0; j < i; j++) {\n        f = d[j];\n        V.set(j, i, f);\n        g = e[j] + V.get(j, j) * f;\n        for (k = j + 1; k <= i - 1; k++) {\n          g += V.get(k, j) * d[k];\n          e[k] += V.get(k, j) * f;\n        }\n        e[j] = g;\n      }\n\n      f = 0;\n      for (j = 0; j < i; j++) {\n        e[j] /= h;\n        f += e[j] * d[j];\n      }\n\n      hh = f / (h + h);\n      for (j = 0; j < i; j++) {\n        e[j] -= hh * d[j];\n      }\n\n      for (j = 0; j < i; j++) {\n        f = d[j];\n        g = e[j];\n        for (k = j; k <= i - 1; k++) {\n          V.set(k, j, V.get(k, j) - (f * e[k] + g * d[k]));\n        }\n        d[j] = V.get(i - 1, j);\n        V.set(i, j, 0);\n      }\n    }\n    d[i] = h;\n  }\n\n  for (i = 0; i < n - 1; i++) {\n    V.set(n - 1, i, V.get(i, i));\n    V.set(i, i, 1);\n    h = d[i + 1];\n    if (h !== 0) {\n      for (k = 0; k <= i; k++) {\n        d[k] = V.get(k, i + 1) / h;\n      }\n\n      for (j = 0; j <= i; j++) {\n        g = 0;\n        for (k = 0; k <= i; k++) {\n          g += V.get(k, i + 1) * V.get(k, j);\n        }\n        for (k = 0; k <= i; k++) {\n          V.set(k, j, V.get(k, j) - g * d[k]);\n        }\n      }\n    }\n\n    for (k = 0; k <= i; k++) {\n      V.set(k, i + 1, 0);\n    }\n  }\n\n  for (j = 0; j < n; j++) {\n    d[j] = V.get(n - 1, j);\n    V.set(n - 1, j, 0);\n  }\n\n  V.set(n - 1, n - 1, 1);\n  e[0] = 0;\n}\n\nfunction tql2(n, e, d, V) {\n  let g, h, i, j, k, l, m, p, r, dl1, c, c2, c3, el1, s, s2;\n\n  for (i = 1; i < n; i++) {\n    e[i - 1] = e[i];\n  }\n\n  e[n - 1] = 0;\n\n  let f = 0;\n  let tst1 = 0;\n  let eps = Number.EPSILON;\n\n  for (l = 0; l < n; l++) {\n    tst1 = Math.max(tst1, Math.abs(d[l]) + Math.abs(e[l]));\n    m = l;\n    while (m < n) {\n      if (Math.abs(e[m]) <= eps * tst1) {\n        break;\n      }\n      m++;\n    }\n\n    if (m > l) {\n      do {\n\n        g = d[l];\n        p = (d[l + 1] - g) / (2 * e[l]);\n        r = hypotenuse(p, 1);\n        if (p < 0) {\n          r = -r;\n        }\n\n        d[l] = e[l] / (p + r);\n        d[l + 1] = e[l] * (p + r);\n        dl1 = d[l + 1];\n        h = g - d[l];\n        for (i = l + 2; i < n; i++) {\n          d[i] -= h;\n        }\n\n        f = f + h;\n\n        p = d[m];\n        c = 1;\n        c2 = c;\n        c3 = c;\n        el1 = e[l + 1];\n        s = 0;\n        s2 = 0;\n        for (i = m - 1; i >= l; i--) {\n          c3 = c2;\n          c2 = c;\n          s2 = s;\n          g = c * e[i];\n          h = c * p;\n          r = hypotenuse(p, e[i]);\n          e[i + 1] = s * r;\n          s = e[i] / r;\n          c = p / r;\n          p = c * d[i] - s * g;\n          d[i + 1] = h + s * (c * g + s * d[i]);\n\n          for (k = 0; k < n; k++) {\n            h = V.get(k, i + 1);\n            V.set(k, i + 1, s * V.get(k, i) + c * h);\n            V.set(k, i, c * V.get(k, i) - s * h);\n          }\n        }\n\n        p = (-s * s2 * c3 * el1 * e[l]) / dl1;\n        e[l] = s * p;\n        d[l] = c * p;\n      } while (Math.abs(e[l]) > eps * tst1);\n    }\n    d[l] = d[l] + f;\n    e[l] = 0;\n  }\n\n  for (i = 0; i < n - 1; i++) {\n    k = i;\n    p = d[i];\n    for (j = i + 1; j < n; j++) {\n      if (d[j] < p) {\n        k = j;\n        p = d[j];\n      }\n    }\n\n    if (k !== i) {\n      d[k] = d[i];\n      d[i] = p;\n      for (j = 0; j < n; j++) {\n        p = V.get(j, i);\n        V.set(j, i, V.get(j, k));\n        V.set(j, k, p);\n      }\n    }\n  }\n}\n\nfunction orthes(n, H, ort, V) {\n  let low = 0;\n  let high = n - 1;\n  let f, g, h, i, j, m;\n  let scale;\n\n  for (m = low + 1; m <= high - 1; m++) {\n    scale = 0;\n    for (i = m; i <= high; i++) {\n      scale = scale + Math.abs(H.get(i, m - 1));\n    }\n\n    if (scale !== 0) {\n      h = 0;\n      for (i = high; i >= m; i--) {\n        ort[i] = H.get(i, m - 1) / scale;\n        h += ort[i] * ort[i];\n      }\n\n      g = Math.sqrt(h);\n      if (ort[m] > 0) {\n        g = -g;\n      }\n\n      h = h - ort[m] * g;\n      ort[m] = ort[m] - g;\n\n      for (j = m; j < n; j++) {\n        f = 0;\n        for (i = high; i >= m; i--) {\n          f += ort[i] * H.get(i, j);\n        }\n\n        f = f / h;\n        for (i = m; i <= high; i++) {\n          H.set(i, j, H.get(i, j) - f * ort[i]);\n        }\n      }\n\n      for (i = 0; i <= high; i++) {\n        f = 0;\n        for (j = high; j >= m; j--) {\n          f += ort[j] * H.get(i, j);\n        }\n\n        f = f / h;\n        for (j = m; j <= high; j++) {\n          H.set(i, j, H.get(i, j) - f * ort[j]);\n        }\n      }\n\n      ort[m] = scale * ort[m];\n      H.set(m, m - 1, scale * g);\n    }\n  }\n\n  for (i = 0; i < n; i++) {\n    for (j = 0; j < n; j++) {\n      V.set(i, j, i === j ? 1 : 0);\n    }\n  }\n\n  for (m = high - 1; m >= low + 1; m--) {\n    if (H.get(m, m - 1) !== 0) {\n      for (i = m + 1; i <= high; i++) {\n        ort[i] = H.get(i, m - 1);\n      }\n\n      for (j = m; j <= high; j++) {\n        g = 0;\n        for (i = m; i <= high; i++) {\n          g += ort[i] * V.get(i, j);\n        }\n\n        g = g / ort[m] / H.get(m, m - 1);\n        for (i = m; i <= high; i++) {\n          V.set(i, j, V.get(i, j) + g * ort[i]);\n        }\n      }\n    }\n  }\n}\n\nfunction hqr2(nn, e, d, V, H) {\n  let n = nn - 1;\n  let low = 0;\n  let high = nn - 1;\n  let eps = Number.EPSILON;\n  let exshift = 0;\n  let norm = 0;\n  let p = 0;\n  let q = 0;\n  let r = 0;\n  let s = 0;\n  let z = 0;\n  let iter = 0;\n  let i, j, k, l, m, t, w, x, y;\n  let ra, sa, vr, vi;\n  let notlast, cdivres;\n\n  for (i = 0; i < nn; i++) {\n    if (i < low || i > high) {\n      d[i] = H.get(i, i);\n      e[i] = 0;\n    }\n\n    for (j = Math.max(i - 1, 0); j < nn; j++) {\n      norm = norm + Math.abs(H.get(i, j));\n    }\n  }\n\n  while (n >= low) {\n    l = n;\n    while (l > low) {\n      s = Math.abs(H.get(l - 1, l - 1)) + Math.abs(H.get(l, l));\n      if (s === 0) {\n        s = norm;\n      }\n      if (Math.abs(H.get(l, l - 1)) < eps * s) {\n        break;\n      }\n      l--;\n    }\n\n    if (l === n) {\n      H.set(n, n, H.get(n, n) + exshift);\n      d[n] = H.get(n, n);\n      e[n] = 0;\n      n--;\n      iter = 0;\n    } else if (l === n - 1) {\n      w = H.get(n, n - 1) * H.get(n - 1, n);\n      p = (H.get(n - 1, n - 1) - H.get(n, n)) / 2;\n      q = p * p + w;\n      z = Math.sqrt(Math.abs(q));\n      H.set(n, n, H.get(n, n) + exshift);\n      H.set(n - 1, n - 1, H.get(n - 1, n - 1) + exshift);\n      x = H.get(n, n);\n\n      if (q >= 0) {\n        z = p >= 0 ? p + z : p - z;\n        d[n - 1] = x + z;\n        d[n] = d[n - 1];\n        if (z !== 0) {\n          d[n] = x - w / z;\n        }\n        e[n - 1] = 0;\n        e[n] = 0;\n        x = H.get(n, n - 1);\n        s = Math.abs(x) + Math.abs(z);\n        p = x / s;\n        q = z / s;\n        r = Math.sqrt(p * p + q * q);\n        p = p / r;\n        q = q / r;\n\n        for (j = n - 1; j < nn; j++) {\n          z = H.get(n - 1, j);\n          H.set(n - 1, j, q * z + p * H.get(n, j));\n          H.set(n, j, q * H.get(n, j) - p * z);\n        }\n\n        for (i = 0; i <= n; i++) {\n          z = H.get(i, n - 1);\n          H.set(i, n - 1, q * z + p * H.get(i, n));\n          H.set(i, n, q * H.get(i, n) - p * z);\n        }\n\n        for (i = low; i <= high; i++) {\n          z = V.get(i, n - 1);\n          V.set(i, n - 1, q * z + p * V.get(i, n));\n          V.set(i, n, q * V.get(i, n) - p * z);\n        }\n      } else {\n        d[n - 1] = x + p;\n        d[n] = x + p;\n        e[n - 1] = z;\n        e[n] = -z;\n      }\n\n      n = n - 2;\n      iter = 0;\n    } else {\n      x = H.get(n, n);\n      y = 0;\n      w = 0;\n      if (l < n) {\n        y = H.get(n - 1, n - 1);\n        w = H.get(n, n - 1) * H.get(n - 1, n);\n      }\n\n      if (iter === 10) {\n        exshift += x;\n        for (i = low; i <= n; i++) {\n          H.set(i, i, H.get(i, i) - x);\n        }\n        s = Math.abs(H.get(n, n - 1)) + Math.abs(H.get(n - 1, n - 2));\n        // eslint-disable-next-line no-multi-assign\n        x = y = 0.75 * s;\n        w = -0.4375 * s * s;\n      }\n\n      if (iter === 30) {\n        s = (y - x) / 2;\n        s = s * s + w;\n        if (s > 0) {\n          s = Math.sqrt(s);\n          if (y < x) {\n            s = -s;\n          }\n          s = x - w / ((y - x) / 2 + s);\n          for (i = low; i <= n; i++) {\n            H.set(i, i, H.get(i, i) - s);\n          }\n          exshift += s;\n          // eslint-disable-next-line no-multi-assign\n          x = y = w = 0.964;\n        }\n      }\n\n      iter = iter + 1;\n\n      m = n - 2;\n      while (m >= l) {\n        z = H.get(m, m);\n        r = x - z;\n        s = y - z;\n        p = (r * s - w) / H.get(m + 1, m) + H.get(m, m + 1);\n        q = H.get(m + 1, m + 1) - z - r - s;\n        r = H.get(m + 2, m + 1);\n        s = Math.abs(p) + Math.abs(q) + Math.abs(r);\n        p = p / s;\n        q = q / s;\n        r = r / s;\n        if (m === l) {\n          break;\n        }\n        if (\n          Math.abs(H.get(m, m - 1)) * (Math.abs(q) + Math.abs(r)) <\n          eps *\n            (Math.abs(p) *\n              (Math.abs(H.get(m - 1, m - 1)) +\n                Math.abs(z) +\n                Math.abs(H.get(m + 1, m + 1))))\n        ) {\n          break;\n        }\n        m--;\n      }\n\n      for (i = m + 2; i <= n; i++) {\n        H.set(i, i - 2, 0);\n        if (i > m + 2) {\n          H.set(i, i - 3, 0);\n        }\n      }\n\n      for (k = m; k <= n - 1; k++) {\n        notlast = k !== n - 1;\n        if (k !== m) {\n          p = H.get(k, k - 1);\n          q = H.get(k + 1, k - 1);\n          r = notlast ? H.get(k + 2, k - 1) : 0;\n          x = Math.abs(p) + Math.abs(q) + Math.abs(r);\n          if (x !== 0) {\n            p = p / x;\n            q = q / x;\n            r = r / x;\n          }\n        }\n\n        if (x === 0) {\n          break;\n        }\n\n        s = Math.sqrt(p * p + q * q + r * r);\n        if (p < 0) {\n          s = -s;\n        }\n\n        if (s !== 0) {\n          if (k !== m) {\n            H.set(k, k - 1, -s * x);\n          } else if (l !== m) {\n            H.set(k, k - 1, -H.get(k, k - 1));\n          }\n\n          p = p + s;\n          x = p / s;\n          y = q / s;\n          z = r / s;\n          q = q / p;\n          r = r / p;\n\n          for (j = k; j < nn; j++) {\n            p = H.get(k, j) + q * H.get(k + 1, j);\n            if (notlast) {\n              p = p + r * H.get(k + 2, j);\n              H.set(k + 2, j, H.get(k + 2, j) - p * z);\n            }\n\n            H.set(k, j, H.get(k, j) - p * x);\n            H.set(k + 1, j, H.get(k + 1, j) - p * y);\n          }\n\n          for (i = 0; i <= Math.min(n, k + 3); i++) {\n            p = x * H.get(i, k) + y * H.get(i, k + 1);\n            if (notlast) {\n              p = p + z * H.get(i, k + 2);\n              H.set(i, k + 2, H.get(i, k + 2) - p * r);\n            }\n\n            H.set(i, k, H.get(i, k) - p);\n            H.set(i, k + 1, H.get(i, k + 1) - p * q);\n          }\n\n          for (i = low; i <= high; i++) {\n            p = x * V.get(i, k) + y * V.get(i, k + 1);\n            if (notlast) {\n              p = p + z * V.get(i, k + 2);\n              V.set(i, k + 2, V.get(i, k + 2) - p * r);\n            }\n\n            V.set(i, k, V.get(i, k) - p);\n            V.set(i, k + 1, V.get(i, k + 1) - p * q);\n          }\n        }\n      }\n    }\n  }\n\n  if (norm === 0) {\n    return;\n  }\n\n  for (n = nn - 1; n >= 0; n--) {\n    p = d[n];\n    q = e[n];\n\n    if (q === 0) {\n      l = n;\n      H.set(n, n, 1);\n      for (i = n - 1; i >= 0; i--) {\n        w = H.get(i, i) - p;\n        r = 0;\n        for (j = l; j <= n; j++) {\n          r = r + H.get(i, j) * H.get(j, n);\n        }\n\n        if (e[i] < 0) {\n          z = w;\n          s = r;\n        } else {\n          l = i;\n          if (e[i] === 0) {\n            H.set(i, n, w !== 0 ? -r / w : -r / (eps * norm));\n          } else {\n            x = H.get(i, i + 1);\n            y = H.get(i + 1, i);\n            q = (d[i] - p) * (d[i] - p) + e[i] * e[i];\n            t = (x * s - z * r) / q;\n            H.set(i, n, t);\n            H.set(\n              i + 1,\n              n,\n              Math.abs(x) > Math.abs(z) ? (-r - w * t) / x : (-s - y * t) / z,\n            );\n          }\n\n          t = Math.abs(H.get(i, n));\n          if (eps * t * t > 1) {\n            for (j = i; j <= n; j++) {\n              H.set(j, n, H.get(j, n) / t);\n            }\n          }\n        }\n      }\n    } else if (q < 0) {\n      l = n - 1;\n\n      if (Math.abs(H.get(n, n - 1)) > Math.abs(H.get(n - 1, n))) {\n        H.set(n - 1, n - 1, q / H.get(n, n - 1));\n        H.set(n - 1, n, -(H.get(n, n) - p) / H.get(n, n - 1));\n      } else {\n        cdivres = cdiv(0, -H.get(n - 1, n), H.get(n - 1, n - 1) - p, q);\n        H.set(n - 1, n - 1, cdivres[0]);\n        H.set(n - 1, n, cdivres[1]);\n      }\n\n      H.set(n, n - 1, 0);\n      H.set(n, n, 1);\n      for (i = n - 2; i >= 0; i--) {\n        ra = 0;\n        sa = 0;\n        for (j = l; j <= n; j++) {\n          ra = ra + H.get(i, j) * H.get(j, n - 1);\n          sa = sa + H.get(i, j) * H.get(j, n);\n        }\n\n        w = H.get(i, i) - p;\n\n        if (e[i] < 0) {\n          z = w;\n          r = ra;\n          s = sa;\n        } else {\n          l = i;\n          if (e[i] === 0) {\n            cdivres = cdiv(-ra, -sa, w, q);\n            H.set(i, n - 1, cdivres[0]);\n            H.set(i, n, cdivres[1]);\n          } else {\n            x = H.get(i, i + 1);\n            y = H.get(i + 1, i);\n            vr = (d[i] - p) * (d[i] - p) + e[i] * e[i] - q * q;\n            vi = (d[i] - p) * 2 * q;\n            if (vr === 0 && vi === 0) {\n              vr =\n                eps *\n                norm *\n                (Math.abs(w) +\n                  Math.abs(q) +\n                  Math.abs(x) +\n                  Math.abs(y) +\n                  Math.abs(z));\n            }\n            cdivres = cdiv(\n              x * r - z * ra + q * sa,\n              x * s - z * sa - q * ra,\n              vr,\n              vi,\n            );\n            H.set(i, n - 1, cdivres[0]);\n            H.set(i, n, cdivres[1]);\n            if (Math.abs(x) > Math.abs(z) + Math.abs(q)) {\n              H.set(\n                i + 1,\n                n - 1,\n                (-ra - w * H.get(i, n - 1) + q * H.get(i, n)) / x,\n              );\n              H.set(\n                i + 1,\n                n,\n                (-sa - w * H.get(i, n) - q * H.get(i, n - 1)) / x,\n              );\n            } else {\n              cdivres = cdiv(\n                -r - y * H.get(i, n - 1),\n                -s - y * H.get(i, n),\n                z,\n                q,\n              );\n              H.set(i + 1, n - 1, cdivres[0]);\n              H.set(i + 1, n, cdivres[1]);\n            }\n          }\n\n          t = Math.max(Math.abs(H.get(i, n - 1)), Math.abs(H.get(i, n)));\n          if (eps * t * t > 1) {\n            for (j = i; j <= n; j++) {\n              H.set(j, n - 1, H.get(j, n - 1) / t);\n              H.set(j, n, H.get(j, n) / t);\n            }\n          }\n        }\n      }\n    }\n  }\n\n  for (i = 0; i < nn; i++) {\n    if (i < low || i > high) {\n      for (j = i; j < nn; j++) {\n        V.set(i, j, H.get(i, j));\n      }\n    }\n  }\n\n  for (j = nn - 1; j >= low; j--) {\n    for (i = low; i <= high; i++) {\n      z = 0;\n      for (k = low; k <= Math.min(j, high); k++) {\n        z = z + V.get(i, k) * H.get(k, j);\n      }\n      V.set(i, j, z);\n    }\n  }\n}\n\nfunction cdiv(xr, xi, yr, yi) {\n  let r, d;\n  if (Math.abs(yr) > Math.abs(yi)) {\n    r = yi / yr;\n    d = yr + r * yi;\n    return [(xr + r * xi) / d, (xi - r * xr) / d];\n  } else {\n    r = yr / yi;\n    d = yi + r * yr;\n    return [(r * xr + xi) / d, (r * xi - xr) / d];\n  }\n}\n\nclass CholeskyDecomposition {\n  constructor(value) {\n    value = WrapperMatrix2D.checkMatrix(value);\n    if (!value.isSymmetric()) {\n      throw new Error('Matrix is not symmetric');\n    }\n\n    let a = value;\n    let dimension = a.rows;\n    let l = new Matrix(dimension, dimension);\n    let positiveDefinite = true;\n    let i, j, k;\n\n    for (j = 0; j < dimension; j++) {\n      let d = 0;\n      for (k = 0; k < j; k++) {\n        let s = 0;\n        for (i = 0; i < k; i++) {\n          s += l.get(k, i) * l.get(j, i);\n        }\n        s = (a.get(j, k) - s) / l.get(k, k);\n        l.set(j, k, s);\n        d = d + s * s;\n      }\n\n      d = a.get(j, j) - d;\n\n      positiveDefinite &= d > 0;\n      l.set(j, j, Math.sqrt(Math.max(d, 0)));\n      for (k = j + 1; k < dimension; k++) {\n        l.set(j, k, 0);\n      }\n    }\n\n    this.L = l;\n    this.positiveDefinite = Boolean(positiveDefinite);\n  }\n\n  isPositiveDefinite() {\n    return this.positiveDefinite;\n  }\n\n  solve(value) {\n    value = WrapperMatrix2D.checkMatrix(value);\n\n    let l = this.L;\n    let dimension = l.rows;\n\n    if (value.rows !== dimension) {\n      throw new Error('Matrix dimensions do not match');\n    }\n    if (this.isPositiveDefinite() === false) {\n      throw new Error('Matrix is not positive definite');\n    }\n\n    let count = value.columns;\n    let B = value.clone();\n    let i, j, k;\n\n    for (k = 0; k < dimension; k++) {\n      for (j = 0; j < count; j++) {\n        for (i = 0; i < k; i++) {\n          B.set(k, j, B.get(k, j) - B.get(i, j) * l.get(k, i));\n        }\n        B.set(k, j, B.get(k, j) / l.get(k, k));\n      }\n    }\n\n    for (k = dimension - 1; k >= 0; k--) {\n      for (j = 0; j < count; j++) {\n        for (i = k + 1; i < dimension; i++) {\n          B.set(k, j, B.get(k, j) - B.get(i, j) * l.get(i, k));\n        }\n        B.set(k, j, B.get(k, j) / l.get(k, k));\n      }\n    }\n\n    return B;\n  }\n\n  get lowerTriangularMatrix() {\n    return this.L;\n  }\n}\n\nclass nipals {\n  constructor(X, options = {}) {\n    X = WrapperMatrix2D.checkMatrix(X);\n    let { Y } = options;\n    const {\n      scaleScores = false,\n      maxIterations = 1000,\n      terminationCriteria = 1e-10,\n    } = options;\n\n    let u;\n    if (Y) {\n      if (isAnyArray.isAnyArray(Y) && typeof Y[0] === 'number') {\n        Y = Matrix.columnVector(Y);\n      } else {\n        Y = WrapperMatrix2D.checkMatrix(Y);\n      }\n      if (Y.rows !== X.rows) {\n        throw new Error('Y should have the same number of rows as X');\n      }\n      u = Y.getColumnVector(0);\n    } else {\n      u = X.getColumnVector(0);\n    }\n\n    let diff = 1;\n    let t, q, w, tOld;\n\n    for (\n      let counter = 0;\n      counter < maxIterations && diff > terminationCriteria;\n      counter++\n    ) {\n      w = X.transpose().mmul(u).div(u.transpose().mmul(u).get(0, 0));\n      w = w.div(w.norm());\n\n      t = X.mmul(w).div(w.transpose().mmul(w).get(0, 0));\n\n      if (counter > 0) {\n        diff = t.clone().sub(tOld).pow(2).sum();\n      }\n      tOld = t.clone();\n\n      if (Y) {\n        q = Y.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n        q = q.div(q.norm());\n\n        u = Y.mmul(q).div(q.transpose().mmul(q).get(0, 0));\n      } else {\n        u = t;\n      }\n    }\n\n    if (Y) {\n      let p = X.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n      p = p.div(p.norm());\n      let xResidual = X.clone().sub(t.clone().mmul(p.transpose()));\n      let residual = u.transpose().mmul(t).div(t.transpose().mmul(t).get(0, 0));\n      let yResidual = Y.clone().sub(\n        t.clone().mulS(residual.get(0, 0)).mmul(q.transpose()),\n      );\n\n      this.t = t;\n      this.p = p.transpose();\n      this.w = w.transpose();\n      this.q = q;\n      this.u = u;\n      this.s = t.transpose().mmul(t);\n      this.xResidual = xResidual;\n      this.yResidual = yResidual;\n      this.betas = residual;\n    } else {\n      this.w = w.transpose();\n      this.s = t.transpose().mmul(t).sqrt();\n      if (scaleScores) {\n        this.t = t.clone().div(this.s.get(0, 0));\n      } else {\n        this.t = t;\n      }\n      this.xResidual = X.sub(t.mmul(w.transpose()));\n    }\n  }\n}\n\nexports.AbstractMatrix = AbstractMatrix;\nexports.CHO = CholeskyDecomposition;\nexports.CholeskyDecomposition = CholeskyDecomposition;\nexports.DistanceMatrix = DistanceMatrix;\nexports.EVD = EigenvalueDecomposition;\nexports.EigenvalueDecomposition = EigenvalueDecomposition;\nexports.LU = LuDecomposition;\nexports.LuDecomposition = LuDecomposition;\nexports.Matrix = Matrix;\nexports.MatrixColumnSelectionView = MatrixColumnSelectionView;\nexports.MatrixColumnView = MatrixColumnView;\nexports.MatrixFlipColumnView = MatrixFlipColumnView;\nexports.MatrixFlipRowView = MatrixFlipRowView;\nexports.MatrixRowSelectionView = MatrixRowSelectionView;\nexports.MatrixRowView = MatrixRowView;\nexports.MatrixSelectionView = MatrixSelectionView;\nexports.MatrixSubView = MatrixSubView;\nexports.MatrixTransposeView = MatrixTransposeView;\nexports.NIPALS = nipals;\nexports.Nipals = nipals;\nexports.QR = QrDecomposition;\nexports.QrDecomposition = QrDecomposition;\nexports.SVD = SingularValueDecomposition;\nexports.SingularValueDecomposition = SingularValueDecomposition;\nexports.SymmetricMatrix = SymmetricMatrix;\nexports.WrapperMatrix1D = WrapperMatrix1D;\nexports.WrapperMatrix2D = WrapperMatrix2D;\nexports.correlation = correlation;\nexports.covariance = covariance;\nexports.default = Matrix;\nexports.determinant = determinant;\nexports.inverse = inverse;\nexports.linearDependencies = linearDependencies;\nexports.pseudoInverse = pseudoInverse;\nexports.solve = solve;\nexports.wrap = wrap;\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\tid: moduleId,\n\t\tloaded: false,\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// Flag the module as loaded\n\tmodule.loaded = true;\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__.g = (function() {\n\tif (typeof globalThis === 'object') return globalThis;\n\ttry {\n\t\treturn this || new Function('return this')();\n\t} catch (e) {\n\t\tif (typeof window === 'object') return window;\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};","__webpack_require__.nmd = (module) => {\n\tmodule.paths = [];\n\tif (!module.children) module.children = [];\n\treturn module;\n};","/******************************************************************************\nCopyright (c) Microsoft Corporation.\n\nPermission to use, copy, modify, and/or distribute this software for any\npurpose with or without fee is hereby granted.\n\nTHE SOFTWARE IS PROVIDED \"AS IS\" AND THE AUTHOR DISCLAIMS ALL WARRANTIES WITH\nREGARD TO THIS SOFTWARE INCLUDING ALL IMPLIED WARRANTIES OF MERCHANTABILITY\nAND FITNESS. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY SPECIAL, DIRECT,\nINDIRECT, OR CONSEQUENTIAL DAMAGES OR ANY DAMAGES WHATSOEVER RESULTING FROM\nLOSS OF USE, DATA OR PROFITS, WHETHER IN AN ACTION OF CONTRACT, NEGLIGENCE OR\nOTHER TORTIOUS ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR\nPERFORMANCE OF THIS SOFTWARE.\n***************************************************************************** */\n/* global Reflect, Promise, SuppressedError, Symbol */\n\nvar extendStatics = function(d, b) {\n  extendStatics = Object.setPrototypeOf ||\n      ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||\n      function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };\n  return extendStatics(d, b);\n};\n\nexport function __extends(d, b) {\n  if (typeof b !== \"function\" && b !== null)\n      throw new TypeError(\"Class extends value \" + String(b) + \" is not a constructor or null\");\n  extendStatics(d, b);\n  function __() { this.constructor = d; }\n  d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());\n}\n\nexport var __assign = function() {\n  __assign = Object.assign || function __assign(t) {\n      for (var s, i = 1, n = arguments.length; i < n; i++) {\n          s = arguments[i];\n          for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p)) t[p] = s[p];\n      }\n      return t;\n  }\n  return __assign.apply(this, arguments);\n}\n\nexport function __rest(s, e) {\n  var t = {};\n  for (var p in s) if (Object.prototype.hasOwnProperty.call(s, p) && e.indexOf(p) < 0)\n      t[p] = s[p];\n  if (s != null && typeof Object.getOwnPropertySymbols === \"function\")\n      for (var i = 0, p = Object.getOwnPropertySymbols(s); i < p.length; i++) {\n          if (e.indexOf(p[i]) < 0 && Object.prototype.propertyIsEnumerable.call(s, p[i]))\n              t[p[i]] = s[p[i]];\n      }\n  return t;\n}\n\nexport function __decorate(decorators, target, key, desc) {\n  var c = arguments.length, r = c < 3 ? target : desc === null ? desc = Object.getOwnPropertyDescriptor(target, key) : desc, d;\n  if (typeof Reflect === \"object\" && typeof Reflect.decorate === \"function\") r = Reflect.decorate(decorators, target, key, desc);\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;\n  return c > 3 && r && Object.defineProperty(target, key, r), r;\n}\n\nexport function __param(paramIndex, decorator) {\n  return function (target, key) { decorator(target, key, paramIndex); }\n}\n\nexport function __esDecorate(ctor, descriptorIn, decorators, contextIn, initializers, extraInitializers) {\n  function accept(f) { if (f !== void 0 && typeof f !== \"function\") throw new TypeError(\"Function expected\"); return f; }\n  var kind = contextIn.kind, key = kind === \"getter\" ? \"get\" : kind === \"setter\" ? \"set\" : \"value\";\n  var target = !descriptorIn && ctor ? contextIn[\"static\"] ? ctor : ctor.prototype : null;\n  var descriptor = descriptorIn || (target ? Object.getOwnPropertyDescriptor(target, contextIn.name) : {});\n  var _, done = false;\n  for (var i = decorators.length - 1; i >= 0; i--) {\n      var context = {};\n      for (var p in contextIn) context[p] = p === \"access\" ? {} : contextIn[p];\n      for (var p in contextIn.access) context.access[p] = contextIn.access[p];\n      context.addInitializer = function (f) { if (done) throw new TypeError(\"Cannot add initializers after decoration has completed\"); extraInitializers.push(accept(f || null)); };\n      var result = (0, decorators[i])(kind === \"accessor\" ? { get: descriptor.get, set: descriptor.set } : descriptor[key], context);\n      if (kind === \"accessor\") {\n          if (result === void 0) continue;\n          if (result === null || typeof result !== \"object\") throw new TypeError(\"Object expected\");\n          if (_ = accept(result.get)) descriptor.get = _;\n          if (_ = accept(result.set)) descriptor.set = _;\n          if (_ = accept(result.init)) initializers.unshift(_);\n      }\n      else if (_ = accept(result)) {\n          if (kind === \"field\") initializers.unshift(_);\n          else descriptor[key] = _;\n      }\n  }\n  if (target) Object.defineProperty(target, contextIn.name, descriptor);\n  done = true;\n};\n\nexport function __runInitializers(thisArg, initializers, value) {\n  var useValue = arguments.length > 2;\n  for (var i = 0; i < initializers.length; i++) {\n      value = useValue ? initializers[i].call(thisArg, value) : initializers[i].call(thisArg);\n  }\n  return useValue ? value : void 0;\n};\n\nexport function __propKey(x) {\n  return typeof x === \"symbol\" ? x : \"\".concat(x);\n};\n\nexport function __setFunctionName(f, name, prefix) {\n  if (typeof name === \"symbol\") name = name.description ? \"[\".concat(name.description, \"]\") : \"\";\n  return Object.defineProperty(f, \"name\", { configurable: true, value: prefix ? \"\".concat(prefix, \" \", name) : name });\n};\n\nexport function __metadata(metadataKey, metadataValue) {\n  if (typeof Reflect === \"object\" && typeof Reflect.metadata === \"function\") return Reflect.metadata(metadataKey, metadataValue);\n}\n\nexport function __awaiter(thisArg, _arguments, P, generator) {\n  function adopt(value) { return value instanceof P ? value : new P(function (resolve) { resolve(value); }); }\n  return new (P || (P = Promise))(function (resolve, reject) {\n      function fulfilled(value) { try { step(generator.next(value)); } catch (e) { reject(e); } }\n      function rejected(value) { try { step(generator[\"throw\"](value)); } catch (e) { reject(e); } }\n      function step(result) { result.done ? resolve(result.value) : adopt(result.value).then(fulfilled, rejected); }\n      step((generator = generator.apply(thisArg, _arguments || [])).next());\n  });\n}\n\nexport function __generator(thisArg, body) {\n  var _ = { label: 0, sent: function() { if (t[0] & 1) throw t[1]; return t[1]; }, trys: [], ops: [] }, f, y, t, g;\n  return g = { next: verb(0), \"throw\": verb(1), \"return\": verb(2) }, typeof Symbol === \"function\" && (g[Symbol.iterator] = function() { return this; }), g;\n  function verb(n) { return function (v) { return step([n, v]); }; }\n  function step(op) {\n      if (f) throw new TypeError(\"Generator is already executing.\");\n      while (g && (g = 0, op[0] && (_ = 0)), _) try {\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;\n          if (y = 0, t) op = [op[0] & 2, t.value];\n          switch (op[0]) {\n              case 0: case 1: t = op; break;\n              case 4: _.label++; return { value: op[1], done: false };\n              case 5: _.label++; y = op[1]; op = [0]; continue;\n              case 7: op = _.ops.pop(); _.trys.pop(); continue;\n              default:\n                  if (!(t = _.trys, t = t.length > 0 && t[t.length - 1]) && (op[0] === 6 || op[0] === 2)) { _ = 0; continue; }\n                  if (op[0] === 3 && (!t || (op[1] > t[0] && op[1] < t[3]))) { _.label = op[1]; break; }\n                  if (op[0] === 6 && _.label < t[1]) { _.label = t[1]; t = op; break; }\n                  if (t && _.label < t[2]) { _.label = t[2]; _.ops.push(op); break; }\n                  if (t[2]) _.ops.pop();\n                  _.trys.pop(); continue;\n          }\n          op = body.call(thisArg, _);\n      } catch (e) { op = [6, e]; y = 0; } finally { f = t = 0; }\n      if (op[0] & 5) throw op[1]; return { value: op[0] ? op[1] : void 0, done: true };\n  }\n}\n\nexport var __createBinding = Object.create ? (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  var desc = Object.getOwnPropertyDescriptor(m, k);\n  if (!desc || (\"get\" in desc ? !m.__esModule : desc.writable || desc.configurable)) {\n      desc = { enumerable: true, get: function() { return m[k]; } };\n  }\n  Object.defineProperty(o, k2, desc);\n}) : (function(o, m, k, k2) {\n  if (k2 === undefined) k2 = k;\n  o[k2] = m[k];\n});\n\nexport function __exportStar(m, o) {\n  for (var p in m) if (p !== \"default\" && !Object.prototype.hasOwnProperty.call(o, p)) __createBinding(o, m, p);\n}\n\nexport function __values(o) {\n  var s = typeof Symbol === \"function\" && Symbol.iterator, m = s && o[s], i = 0;\n  if (m) return m.call(o);\n  if (o && typeof o.length === \"number\") return {\n      next: function () {\n          if (o && i >= o.length) o = void 0;\n          return { value: o && o[i++], done: !o };\n      }\n  };\n  throw new TypeError(s ? \"Object is not iterable.\" : \"Symbol.iterator is not defined.\");\n}\n\nexport function __read(o, n) {\n  var m = typeof Symbol === \"function\" && o[Symbol.iterator];\n  if (!m) return o;\n  var i = m.call(o), r, ar = [], e;\n  try {\n      while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);\n  }\n  catch (error) { e = { error: error }; }\n  finally {\n      try {\n          if (r && !r.done && (m = i[\"return\"])) m.call(i);\n      }\n      finally { if (e) throw e.error; }\n  }\n  return ar;\n}\n\n/** @deprecated */\nexport function __spread() {\n  for (var ar = [], i = 0; i < arguments.length; i++)\n      ar = ar.concat(__read(arguments[i]));\n  return ar;\n}\n\n/** @deprecated */\nexport function __spreadArrays() {\n  for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;\n  for (var r = Array(s), k = 0, i = 0; i < il; i++)\n      for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)\n          r[k] = a[j];\n  return r;\n}\n\nexport function __spreadArray(to, from, pack) {\n  if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {\n      if (ar || !(i in from)) {\n          if (!ar) ar = Array.prototype.slice.call(from, 0, i);\n          ar[i] = from[i];\n      }\n  }\n  return to.concat(ar || Array.prototype.slice.call(from));\n}\n\nexport function __await(v) {\n  return this instanceof __await ? (this.v = v, this) : new __await(v);\n}\n\nexport function __asyncGenerator(thisArg, _arguments, generator) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var g = generator.apply(thisArg, _arguments || []), i, q = [];\n  return i = {}, verb(\"next\"), verb(\"throw\"), verb(\"return\"), i[Symbol.asyncIterator] = function () { return this; }, i;\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); }); }; }\n  function resume(n, v) { try { step(g[n](v)); } catch (e) { settle(q[0][3], e); } }\n  function step(r) { r.value instanceof __await ? Promise.resolve(r.value.v).then(fulfill, reject) : settle(q[0][2], r); }\n  function fulfill(value) { resume(\"next\", value); }\n  function reject(value) { resume(\"throw\", value); }\n  function settle(f, v) { if (f(v), q.shift(), q.length) resume(q[0][0], q[0][1]); }\n}\n\nexport function __asyncDelegator(o) {\n  var i, p;\n  return i = {}, verb(\"next\"), verb(\"throw\", function (e) { throw e; }), verb(\"return\"), i[Symbol.iterator] = function () { return this; }, i;\n  function verb(n, f) { i[n] = o[n] ? function (v) { return (p = !p) ? { value: __await(o[n](v)), done: false } : f ? f(v) : v; } : f; }\n}\n\nexport function __asyncValues(o) {\n  if (!Symbol.asyncIterator) throw new TypeError(\"Symbol.asyncIterator is not defined.\");\n  var m = o[Symbol.asyncIterator], i;\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);\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); }); }; }\n  function settle(resolve, reject, d, v) { Promise.resolve(v).then(function(v) { resolve({ value: v, done: d }); }, reject); }\n}\n\nexport function __makeTemplateObject(cooked, raw) {\n  if (Object.defineProperty) { Object.defineProperty(cooked, \"raw\", { value: raw }); } else { cooked.raw = raw; }\n  return cooked;\n};\n\nvar __setModuleDefault = Object.create ? (function(o, v) {\n  Object.defineProperty(o, \"default\", { enumerable: true, value: v });\n}) : function(o, v) {\n  o[\"default\"] = v;\n};\n\nexport function __importStar(mod) {\n  if (mod && mod.__esModule) return mod;\n  var result = {};\n  if (mod != null) for (var k in mod) if (k !== \"default\" && Object.prototype.hasOwnProperty.call(mod, k)) __createBinding(result, mod, k);\n  __setModuleDefault(result, mod);\n  return result;\n}\n\nexport function __importDefault(mod) {\n  return (mod && mod.__esModule) ? mod : { default: mod };\n}\n\nexport function __classPrivateFieldGet(receiver, state, kind, f) {\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a getter\");\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\");\n  return kind === \"m\" ? f : kind === \"a\" ? f.call(receiver) : f ? f.value : state.get(receiver);\n}\n\nexport function __classPrivateFieldSet(receiver, state, value, kind, f) {\n  if (kind === \"m\") throw new TypeError(\"Private method is not writable\");\n  if (kind === \"a\" && !f) throw new TypeError(\"Private accessor was defined without a setter\");\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\");\n  return (kind === \"a\" ? f.call(receiver, value) : f ? f.value = value : state.set(receiver, value)), value;\n}\n\nexport function __classPrivateFieldIn(state, receiver) {\n  if (receiver === null || (typeof receiver !== \"object\" && typeof receiver !== \"function\")) throw new TypeError(\"Cannot use 'in' operator on non-object\");\n  return typeof state === \"function\" ? receiver === state : state.has(receiver);\n}\n\nexport function __addDisposableResource(env, value, async) {\n  if (value !== null && value !== void 0) {\n    if (typeof value !== \"object\" && typeof value !== \"function\") throw new TypeError(\"Object expected.\");\n    var dispose;\n    if (async) {\n        if (!Symbol.asyncDispose) throw new TypeError(\"Symbol.asyncDispose is not defined.\");\n        dispose = value[Symbol.asyncDispose];\n    }\n    if (dispose === void 0) {\n        if (!Symbol.dispose) throw new TypeError(\"Symbol.dispose is not defined.\");\n        dispose = value[Symbol.dispose];\n    }\n    if (typeof dispose !== \"function\") throw new TypeError(\"Object not disposable.\");\n    env.stack.push({ value: value, dispose: dispose, async: async });\n  }\n  else if (async) {\n    env.stack.push({ async: true });\n  }\n  return value;\n}\n\nvar _SuppressedError = typeof SuppressedError === \"function\" ? SuppressedError : function (error, suppressed, message) {\n  var e = new Error(message);\n  return e.name = \"SuppressedError\", e.error = error, e.suppressed = suppressed, e;\n};\n\nexport function __disposeResources(env) {\n  function fail(e) {\n    env.error = env.hasError ? new _SuppressedError(e, env.error, \"An error was suppressed during disposal.\") : e;\n    env.hasError = true;\n  }\n  function next() {\n    while (env.stack.length) {\n      var rec = env.stack.pop();\n      try {\n        var result = rec.dispose && rec.dispose.call(rec.value);\n        if (rec.async) return Promise.resolve(result).then(next, function(e) { fail(e); return next(); });\n      }\n      catch (e) {\n          fail(e);\n      }\n    }\n    if (env.hasError) throw env.error;\n  }\n  return next();\n}\n\nexport default {\n  __extends,\n  __assign,\n  __rest,\n  __decorate,\n  __param,\n  __metadata,\n  __awaiter,\n  __generator,\n  __createBinding,\n  __exportStar,\n  __values,\n  __read,\n  __spread,\n  __spreadArrays,\n  __spreadArray,\n  __await,\n  __asyncGenerator,\n  __asyncDelegator,\n  __asyncValues,\n  __makeTemplateObject,\n  __importStar,\n  __importDefault,\n  __classPrivateFieldGet,\n  __classPrivateFieldSet,\n  __classPrivateFieldIn,\n  __addDisposableResource,\n  __disposeResources,\n};\n","var WILDCARD = '*';\n/* event-emitter */\nvar EventEmitter = /** @class */ (function () {\n    function EventEmitter() {\n        this._events = {};\n    }\n    /**\n     * 监听一个事件\n     * @param evt\n     * @param callback\n     * @param once\n     */\n    EventEmitter.prototype.on = function (evt, callback, once) {\n        if (!this._events[evt]) {\n            this._events[evt] = [];\n        }\n        this._events[evt].push({\n            callback: callback,\n            once: !!once,\n        });\n        return this;\n    };\n    /**\n     * 监听一个事件一次\n     * @param evt\n     * @param callback\n     */\n    EventEmitter.prototype.once = function (evt, callback) {\n        return this.on(evt, callback, true);\n    };\n    /**\n     * 触发一个事件\n     * @param evt\n     * @param args\n     */\n    EventEmitter.prototype.emit = function (evt) {\n        var _this = this;\n        var args = [];\n        for (var _i = 1; _i < arguments.length; _i++) {\n            args[_i - 1] = arguments[_i];\n        }\n        var events = this._events[evt] || [];\n        var wildcardEvents = this._events[WILDCARD] || [];\n        // 实际的处理 emit 方法\n        var doEmit = function (es) {\n            var length = es.length;\n            for (var i = 0; i < length; i++) {\n                if (!es[i]) {\n                    continue;\n                }\n                var _a = es[i], callback = _a.callback, once = _a.once;\n                if (once) {\n                    es.splice(i, 1);\n                    if (es.length === 0) {\n                        delete _this._events[evt];\n                    }\n                    length--;\n                    i--;\n                }\n                callback.apply(_this, args);\n            }\n        };\n        doEmit(events);\n        doEmit(wildcardEvents);\n    };\n    /**\n     * 取消监听一个事件，或者一个channel\n     * @param evt\n     * @param callback\n     */\n    EventEmitter.prototype.off = function (evt, callback) {\n        if (!evt) {\n            // evt 为空全部清除\n            this._events = {};\n        }\n        else {\n            if (!callback) {\n                // evt 存在，callback 为空，清除事件所有方法\n                delete this._events[evt];\n            }\n            else {\n                // evt 存在，callback 存在，清除匹配的\n                var events = this._events[evt] || [];\n                var length_1 = events.length;\n                for (var i = 0; i < length_1; i++) {\n                    if (events[i].callback === callback) {\n                        events.splice(i, 1);\n                        length_1--;\n                        i--;\n                    }\n                }\n                if (events.length === 0) {\n                    delete this._events[evt];\n                }\n            }\n        }\n        return this;\n    };\n    /* 当前所有的事件 */\n    EventEmitter.prototype.getEvents = function () {\n        return this._events;\n    };\n    return EventEmitter;\n}());\nexport default EventEmitter;\n//# sourceMappingURL=index.js.map","export function doBFS(queue, visited, fn, navigator) {\n    while (queue.length) {\n        const node = queue.shift();\n        const abort = fn(node);\n        if (abort) {\n            return true;\n        }\n        visited.add(node.id);\n        navigator(node.id).forEach((n) => {\n            if (!visited.has(n.id)) {\n                visited.add(n.id);\n                queue.push(n);\n            }\n        });\n    }\n    return false;\n}\nexport function doDFS(node, visited, fn, navigator) {\n    const abort = fn(node);\n    if (abort) {\n        return true;\n    }\n    visited.add(node.id);\n    for (const n of navigator(node.id)) {\n        if (!visited.has(n.id)) {\n            if (doDFS(n, visited, fn, navigator)) {\n                return true;\n            }\n        }\n    }\n    return false;\n}\n//# sourceMappingURL=traverse.js.map","import { doBFS, doDFS } from './utils/traverse';\nconst defaultFilter = () => true;\nexport class GraphView {\n    graph;\n    nodeFilter;\n    edgeFilter;\n    // caches\n    cacheEnabled;\n    inEdgesMap = new Map();\n    outEdgesMap = new Map();\n    bothEdgesMap = new Map();\n    allNodesMap = new Map();\n    allEdgesMap = new Map();\n    constructor(options) {\n        this.graph = options.graph;\n        const nodeFilter = options.nodeFilter || defaultFilter;\n        const edgeFilter = options.edgeFilter || defaultFilter;\n        this.nodeFilter = nodeFilter;\n        this.edgeFilter = (edge) => {\n            const { source, target } = this.graph.getEdgeDetail(edge.id);\n            if (!nodeFilter(source) || !nodeFilter(target)) {\n                return false;\n            }\n            return edgeFilter(edge, source, target);\n        };\n        if (options.cache === 'auto') {\n            this.cacheEnabled = true;\n            this.startAutoCache();\n        }\n        else if (options.cache === 'manual') {\n            this.cacheEnabled = true;\n        }\n        else {\n            this.cacheEnabled = false;\n        }\n    }\n    /**\n     * Clear all cache data. Therefore `getAllNodes()` will return `[]`.\n     * If you want to disable caching, use `graphView.cacheEnabled = false` instead.\n     */\n    clearCache = () => {\n        this.inEdgesMap.clear();\n        this.outEdgesMap.clear();\n        this.bothEdgesMap.clear();\n        this.allNodesMap.clear();\n        this.allEdgesMap.clear();\n    };\n    /**\n     * Fully refresh all cache data to the current graph state.\n     */\n    refreshCache = () => {\n        this.clearCache();\n        this.updateCache(this.graph.getAllNodes().map((node) => node.id));\n    };\n    /**\n     * Instead of a fully refreshment, this method partially update the cache data by specifying\n     * involved(added, removed, updated) nodes. It's more efficient when handling small changes\n     * on a large graph.\n     */\n    updateCache = (involvedNodeIds) => {\n        const involvedEdgeIds = new Set();\n        involvedNodeIds.forEach((id) => {\n            // Collect all involved old edges.\n            const oldEdgesSet = this.bothEdgesMap.get(id);\n            if (oldEdgesSet) {\n                oldEdgesSet.forEach((edge) => involvedEdgeIds.add(edge.id));\n            }\n            if (!this.hasNode(id)) {\n                // When an involved node becomes unvisitable:\n                // 1. Delete its related edges cache.\n                this.inEdgesMap.delete(id);\n                this.outEdgesMap.delete(id);\n                this.bothEdgesMap.delete(id);\n                // 2. Delete it from the allNodesMap.\n                this.allNodesMap.delete(id);\n            }\n            else {\n                // When an involved node becomes or stays visitable:\n                // 1. Collect its new edges.\n                const inEdges = this.graph\n                    .getRelatedEdges(id, 'in')\n                    .filter(this.edgeFilter);\n                const outEdges = this.graph\n                    .getRelatedEdges(id, 'out')\n                    .filter(this.edgeFilter);\n                const bothEdges = Array.from(new Set([...inEdges, ...outEdges]));\n                bothEdges.forEach((edge) => involvedEdgeIds.add(edge.id));\n                // 2. Update its related edges cache.\n                this.inEdgesMap.set(id, inEdges);\n                this.outEdgesMap.set(id, outEdges);\n                this.bothEdgesMap.set(id, bothEdges);\n                // 3. Add to allNodesMap.\n                this.allNodesMap.set(id, this.graph.getNode(id));\n            }\n        });\n        // Update allEdgesMap.\n        involvedEdgeIds.forEach((id) => {\n            if (this.hasEdge(id)) {\n                this.allEdgesMap.set(id, this.graph.getEdge(id));\n            }\n            else {\n                this.allEdgesMap.delete(id);\n            }\n        });\n    };\n    startAutoCache() {\n        this.refreshCache();\n        this.graph.on('changed', this.handleGraphChanged);\n    }\n    stopAutoCache() {\n        this.graph.off('changed', this.handleGraphChanged);\n    }\n    handleGraphChanged = (event) => {\n        // Collect all involved nodes.\n        const involvedNodeIds = new Set();\n        event.changes.forEach((change) => {\n            switch (change.type) {\n                case 'NodeAdded':\n                    involvedNodeIds.add(change.value.id);\n                    break;\n                case 'NodeDataUpdated':\n                    involvedNodeIds.add(change.id);\n                    break;\n                case 'EdgeAdded':\n                    involvedNodeIds.add(change.value.source);\n                    involvedNodeIds.add(change.value.target);\n                    break;\n                case 'EdgeUpdated':\n                    if (change.propertyName === 'source' ||\n                        change.propertyName === 'target') {\n                        involvedNodeIds.add(change.oldValue);\n                        involvedNodeIds.add(change.newValue);\n                    }\n                    break;\n                case 'EdgeDataUpdated':\n                    if (event.graph.hasEdge(change.id)) {\n                        const edge = event.graph.getEdge(change.id);\n                        involvedNodeIds.add(edge.source);\n                        involvedNodeIds.add(edge.target);\n                    }\n                    break;\n                case 'EdgeRemoved':\n                    involvedNodeIds.add(change.value.source);\n                    involvedNodeIds.add(change.value.target);\n                    break;\n                case 'NodeRemoved':\n                    involvedNodeIds.add(change.value.id);\n                    break;\n                default:\n                    break;\n            }\n        });\n        // Update their caches.\n        this.updateCache(involvedNodeIds);\n    };\n    // ================= Node =================\n    checkNodeExistence(id) {\n        this.getNode(id);\n    }\n    hasNode(id) {\n        if (!this.graph.hasNode(id))\n            return false;\n        const node = this.graph.getNode(id);\n        return this.nodeFilter(node);\n    }\n    areNeighbors(firstNodeId, secondNodeId) {\n        this.checkNodeExistence(firstNodeId);\n        return this.getNeighbors(secondNodeId).some((neighbor) => neighbor.id === firstNodeId);\n    }\n    getNode(id) {\n        const node = this.graph.getNode(id);\n        if (!this.nodeFilter(node)) {\n            throw new Error('Node not found for id: ' + id);\n        }\n        return node;\n    }\n    getRelatedEdges(id, direction) {\n        this.checkNodeExistence(id);\n        if (this.cacheEnabled) {\n            if (direction === 'in') {\n                return this.inEdgesMap.get(id);\n            }\n            else if (direction === 'out') {\n                return this.outEdgesMap.get(id);\n            }\n            else {\n                return this.bothEdgesMap.get(id);\n            }\n        }\n        const edges = this.graph.getRelatedEdges(id, direction);\n        return edges.filter(this.edgeFilter);\n    }\n    getDegree(id, direction) {\n        return this.getRelatedEdges(id, direction).length;\n    }\n    getSuccessors(id) {\n        const outEdges = this.getRelatedEdges(id, 'out');\n        const targets = outEdges.map((edge) => this.getNode(edge.target));\n        return Array.from(new Set(targets));\n    }\n    getPredecessors(id) {\n        const inEdges = this.getRelatedEdges(id, 'in');\n        const sources = inEdges.map((edge) => this.getNode(edge.source));\n        return Array.from(new Set(sources));\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    // ================= Edge =================\n    hasEdge(id) {\n        if (!this.graph.hasEdge(id))\n            return false;\n        const edge = this.graph.getEdge(id);\n        return this.edgeFilter(edge);\n    }\n    getEdge(id) {\n        const edge = this.graph.getEdge(id);\n        if (!this.edgeFilter(edge)) {\n            throw new Error('Edge not found for id: ' + id);\n        }\n        return edge;\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    // ================= Tree =================\n    hasTreeStructure(treeKey) {\n        return this.graph.hasTreeStructure(treeKey);\n    }\n    getRoots(treeKey) {\n        return this.graph.getRoots(treeKey).filter(this.nodeFilter);\n    }\n    getChildren(id, treeKey) {\n        this.checkNodeExistence(id);\n        return this.graph.getChildren(id, treeKey).filter(this.nodeFilter);\n    }\n    getParent(id, treeKey) {\n        this.checkNodeExistence(id);\n        const parent = this.graph.getParent(id, treeKey);\n        if (!parent || !this.nodeFilter(parent))\n            return null;\n        return parent;\n    }\n    // ================= Graph =================\n    getAllNodes() {\n        if (this.cacheEnabled) {\n            return Array.from(this.allNodesMap.values());\n        }\n        return this.graph.getAllNodes().filter(this.nodeFilter);\n    }\n    getAllEdges() {\n        if (this.cacheEnabled) {\n            return Array.from(this.allEdgesMap.values());\n        }\n        return this.graph.getAllEdges().filter(this.edgeFilter);\n    }\n    bfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        doBFS([this.getNode(id)], new Set(), fn, navigator);\n    }\n    dfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        doDFS(this.getNode(id), new Set(), fn, navigator);\n    }\n}\n//# sourceMappingURL=graphView.js.map","import EventEmitter from '@antv/event-emitter';\nimport { GraphView } from './graphView';\nimport { doBFS, doDFS } from './utils/traverse';\nexport class Graph extends EventEmitter {\n    nodeMap = new Map();\n    edgeMap = new Map();\n    inEdgesMap = new Map();\n    outEdgesMap = new Map();\n    bothEdgesMap = 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        super();\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        const event = {\n            graph: this,\n            changes,\n        };\n        this.emit('changed', event);\n        this.onChanged(event);\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 index = mergedChanges.findIndex((pastChange) => {\n                        return (pastChange.type === change.type &&\n                            pastChange.id === change.id &&\n                            (change.propertyName === undefined ||\n                                pastChange.propertyName === change.propertyName));\n                    });\n                    const existingChange = mergedChanges[index];\n                    if (existingChange) {\n                        if (change.propertyName !== undefined) {\n                            // The incoming change is of the same property of existing change.\n                            existingChange.newValue = change.newValue;\n                        }\n                        else {\n                            // The incoming change is a whole data override.\n                            mergedChanges.splice(index, 1);\n                            mergedChanges.push(change);\n                        }\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        this.getNode(id);\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        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        const node = this.nodeMap.get(id);\n        if (!node) {\n            throw new Error('Node not found for id: ' + id);\n        }\n        return node;\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        if (direction === 'in') {\n            const inEdges = this.inEdgesMap.get(id);\n            return Array.from(inEdges);\n        }\n        else if (direction === 'out') {\n            const outEdges = this.outEdgesMap.get(id);\n            return Array.from(outEdges);\n        }\n        else {\n            const bothEdges = this.bothEdgesMap.get(id);\n            return Array.from(bothEdges);\n        }\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) => this.getNode(edge.target));\n        return Array.from(new Set(targets));\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) => this.getNode(edge.source));\n        return Array.from(new Set(sources));\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.bothEdgesMap.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 bothEdges = this.bothEdgesMap.get(id);\n        bothEdges?.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    updateNodeDataProperty(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.updateNodeDataProperty(id, propertyName, value);\n            });\n        });\n    }\n    updateNodeData(...args) {\n        const id = args[0];\n        const node = this.getNode(id);\n        if (typeof args[1] === 'string') {\n            // id, propertyName, value\n            this.updateNodeDataProperty(id, args[1], args[2]);\n            return;\n        }\n        let data;\n        if (typeof args[1] === 'function') {\n            // id, update\n            const update = args[1];\n            data = update(node.data);\n        }\n        else if (typeof args[1] === 'object') {\n            // id, data\n            data = args[1];\n        }\n        this.batch(() => {\n            const oldValue = node.data;\n            const newValue = data;\n            node.data = data;\n            this.changes.push({\n                type: 'NodeDataUpdated',\n                id,\n                oldValue,\n                newValue,\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        const bothEdgesOfSource = this.bothEdgesMap.get(edge.source);\n        const bothEdgesOfTarget = this.bothEdgesMap.get(edge.target);\n        inEdges.add(edge);\n        outEdges.add(edge);\n        bothEdgesOfSource.add(edge);\n        bothEdgesOfTarget.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        const bothEdgesOfSource = this.bothEdgesMap.get(edge.source);\n        const bothEdgesOfTarget = this.bothEdgesMap.get(edge.target);\n        outEdges.delete(edge);\n        inEdges.delete(edge);\n        bothEdgesOfSource.delete(edge);\n        bothEdgesOfTarget.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.bothEdgesMap.get(oldSource).delete(edge);\n        this.outEdgesMap.get(newSource).add(edge);\n        this.bothEdgesMap.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.bothEdgesMap.get(oldTarget).delete(edge);\n        this.inEdgesMap.get(newTarget).add(edge);\n        this.bothEdgesMap.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    updateEdgeDataProperty(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    updateEdgeData(...args) {\n        const id = args[0];\n        const edge = this.getEdge(id);\n        if (typeof args[1] === 'string') {\n            // id, propertyName, value\n            this.updateEdgeDataProperty(id, args[1], args[2]);\n            return;\n        }\n        let data;\n        if (typeof args[1] === 'function') {\n            // id, update\n            const update = args[1];\n            data = update(edge.data);\n        }\n        else if (typeof args[1] === 'object') {\n            // id, data\n            data = args[1];\n        }\n        this.batch(() => {\n            const oldValue = edge.data;\n            const newValue = data;\n            edge.data = data;\n            this.changes.push({\n                type: 'EdgeDataUpdated',\n                id,\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.updateEdgeDataProperty(id, propertyName, value);\n            });\n        });\n    }\n    // ================= Tree =================\n    checkTreeExistence(treeKey) {\n        if (!this.hasTreeStructure(treeKey)) {\n            throw new Error('Tree structure not found for treeKey: ' + treeKey);\n        }\n    }\n    hasTreeStructure(treeKey) {\n        return this.treeIndices.has(treeKey);\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     * Returns an array of all the ancestor nodes, staring from the parent to the root.\n     */\n    getAncestors(id, treeKey) {\n        const ancestors = [];\n        let current = this.getNode(id);\n        let parent;\n        // eslint-disable-next-line no-cond-assign\n        while ((parent = this.getParent(current.id, treeKey))) {\n            ancestors.push(parent);\n            current = parent;\n        }\n        return ancestors;\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. If it is undefined, means unset parent for node with id.\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        // Same parent id as old one, skip\n        if (oldParent?.id === parent)\n            return;\n        // New parent is undefined, unset parent for the node\n        if (parent === undefined) {\n            if (oldParent) {\n                tree.childrenMap.get(oldParent.id)?.delete(node);\n            }\n            tree.parentMap.delete(id);\n            return;\n        }\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    dfsTree(id, fn, treeKey) {\n        const navigator = (nodeId) => this.getChildren(nodeId, treeKey);\n        return doDFS(this.getNode(id), new Set(), fn, navigator);\n    }\n    bfsTree(id, fn, treeKey) {\n        const navigator = (nodeId) => this.getChildren(nodeId, treeKey);\n        return doBFS([this.getNode(id)], new Set(), fn, navigator);\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    bfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        return doBFS([this.getNode(id)], new Set(), fn, navigator);\n    }\n    dfs(id, fn, direction = 'out') {\n        const navigator = {\n            in: this.getPredecessors.bind(this),\n            out: this.getSuccessors.bind(this),\n            both: this.getNeighbors.bind(this),\n        }[direction];\n        return doDFS(this.getNode(id), new Set(), fn, navigator);\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    createView(options) {\n        return new GraphView({\n            graph: this,\n            ...options,\n        });\n    }\n}\n//# sourceMappingURL=graph.js.map","var toString = {}.toString;\nvar isType = function (value, type) { return toString.call(value) === '[object ' + type + ']'; };\nexport default isType;\n//# sourceMappingURL=is-type.js.map","/**\n * 判断是否数字\n * @return {Boolean} 是否数字\n */\nimport isType from './is-type';\nvar isNumber = function (value) {\n    return isType(value, 'Number');\n};\nexport default isNumber;\n//# sourceMappingURL=is-number.js.map","const filterOutLinks = (k: string, v: string) => {\n  if (k !== 'next' && k !== 'prev') {\n    return v;\n  }\n};\n\ntype LinkedNode<T> = {\n  prev?: LinkedNode<T>;\n  next?: LinkedNode<T>;\n} & T;\n\nconst unlink = <T>(entry: LinkedNode<T>) => {\n  entry.prev!.next = entry.next;\n  entry.next!.prev = entry.prev;\n  delete entry.next;\n  delete entry.prev;\n};\n\nexport default class List<T> {\n  // a shortcut that next is head and prev is tail\n  public shortcut: LinkedNode<T>;\n\n  constructor() {\n    const shortcut: LinkedNode<any> = {};\n    shortcut.prev = shortcut;\n    shortcut.next = shortcut.prev;\n    this.shortcut = shortcut;\n  }\n\n  public dequeue() {\n    const shortcut = this.shortcut;\n    const entry = shortcut.prev;\n    if (entry && entry !== shortcut) {\n      unlink(entry);\n      return entry;\n    }\n  }\n\n  public enqueue(entry: LinkedNode<T>) {\n    const shortcut = this.shortcut;\n    if (entry.prev && entry.next) {\n      unlink(entry);\n    }\n    entry.next = shortcut.next;\n    shortcut.next!.prev = entry;\n    shortcut.next = entry;\n    entry.prev = shortcut;\n  }\n\n  public toString() {\n    const strs = [];\n    const sentinel = this.shortcut;\n    let curr = sentinel.prev;\n    while (curr !== sentinel) {\n      strs.push(JSON.stringify(curr, filterOutLinks));\n      curr = curr?.prev;\n    }\n    return `[${strs.join(', ')}]`;\n  }\n}\n","/*\n * A greedy heuristic for finding a feedback arc set for a graph. A feedback\n * arc set is a set of edges that can be removed to make a graph acyclic.\n * The algorithm comes from: P. Eades, X. Lin, and W. F. Smyth, \"A fast and\n * effective heuristic for the feedback arc set problem.\" This implementation\n * adjusts that from the paper to allow for weighted edges.\n *\n * @see https://github.com/dagrejs/dagre/blob/master/lib/greedy-fas.js\n */\n\nimport { Edge, Graph, ID } from '@antv/graphlib';\nimport { EdgeData, Graph as IGraph, NodeData } from '../types';\nimport RawList from './data/list';\n\ntype StateNode = {\n  v: ID;\n  w?: ID;\n  in: number;\n  out: number;\n  prev?: StateNode;\n  next?: StateNode;\n};\nclass List extends RawList<StateNode> {}\n\nconst DEFAULT_WEIGHT_FN = () => 1;\n\nexport const greedyFAS = (\n  g: IGraph,\n  weightFn?: (e: Edge<EdgeData>) => number,\n) => {\n  if (g.getAllNodes().length <= 1) return [];\n  const state = buildState(g, weightFn || DEFAULT_WEIGHT_FN);\n  const results = doGreedyFAS(state.graph, state.buckets, state.zeroIdx);\n\n  return results\n    .map((e) =>\n      g.getRelatedEdges(e.v, 'out').filter(({ target }) => target === e.w),\n    )\n    ?.flat();\n};\n\nconst doGreedyFAS = (g: IGraph, buckets: List[], zeroIdx: number) => {\n  let results: StateNode[] = [];\n  const sources = buckets[buckets.length - 1];\n  const sinks = buckets[0];\n\n  let entry;\n  while (g.getAllNodes().length) {\n    while ((entry = sinks.dequeue())) {\n      removeNode(g, buckets, zeroIdx, entry);\n    }\n    while ((entry = sources.dequeue())) {\n      removeNode(g, buckets, zeroIdx, entry);\n    }\n    if (g.getAllNodes().length) {\n      for (let i = buckets.length - 2; i > 0; --i) {\n        entry = buckets[i].dequeue();\n        if (entry) {\n          results = results.concat(\n            removeNode(g, buckets, zeroIdx, entry, true)!,\n          );\n          break;\n        }\n      }\n    }\n  }\n\n  return results;\n};\n\nconst removeNode = (\n  g: IGraph,\n  buckets: List[],\n  zeroIdx: number,\n  entry: StateNode,\n  collectPredecessors?: boolean,\n) => {\n  const results: StateNode[] = [];\n\n  if (g.hasNode(entry.v)) {\n    g.getRelatedEdges(entry.v, 'in')?.forEach((edge) => {\n      const weight = edge.data.weight!;\n      const uEntry = g.getNode(edge.source)!;\n\n      if (collectPredecessors) {\n        // this result not really care about in or out\n        results.push({ v: edge.source, w: edge.target, in: 0, out: 0 });\n      }\n      if (uEntry.data.out === undefined) uEntry.data.out = 0;\n      // @ts-ignore\n      uEntry.data.out -= weight;\n      assignBucket(buckets, zeroIdx, {\n        v: uEntry.id,\n        ...uEntry.data,\n      } as StateNode);\n    });\n\n    g.getRelatedEdges(entry.v, 'out')?.forEach((edge) => {\n      const weight = edge.data.weight!;\n      const w = edge.target;\n      const wEntry = g.getNode(w)!;\n      if (wEntry.data.in === undefined) wEntry.data.in = 0;\n      // @ts-ignore\n      wEntry.data.in -= weight;\n      assignBucket(buckets, zeroIdx, {\n        v: wEntry.id,\n        ...wEntry.data,\n      } as StateNode);\n    });\n\n    g.removeNode(entry.v);\n  }\n\n  return collectPredecessors ? results : undefined;\n};\n\nconst buildState = (g: IGraph, weightFn?: (e: Edge<EdgeData>) => number) => {\n  const fasGraph = new Graph<NodeData, EdgeData>();\n  let maxIn = 0;\n  let maxOut = 0;\n\n  g.getAllNodes().forEach((v) => {\n    fasGraph.addNode({\n      id: v.id,\n      data: { v: v.id, in: 0, out: 0 },\n    });\n  });\n\n  // Aggregate weights on nodes, but also sum the weights across multi-edges\n  // into a single edge for the fasGraph.\n  g.getAllEdges().forEach((e) => {\n    const edge = fasGraph\n      .getRelatedEdges(e.source, 'out')\n      .find((edge) => edge.target === e.target);\n    const weight = weightFn?.(e) || 1;\n    if (!edge) {\n      fasGraph.addEdge({\n        id: e.id,\n        source: e.source,\n        target: e.target,\n        data: {\n          weight,\n        },\n      });\n    } else {\n      fasGraph.updateEdgeData(edge?.id!, {\n        ...edge.data,\n        weight: edge.data.weight! + weight,\n      });\n    }\n    // @ts-ignore\n    maxOut = Math.max(maxOut, (fasGraph.getNode(e.source)!.data.out += weight));\n    // @ts-ignore\n    maxIn = Math.max(maxIn, (fasGraph.getNode(e.target)!.data.in += weight));\n  });\n\n  const buckets: List[] = [];\n  const rangeMax = maxOut + maxIn + 3;\n  for (let i = 0; i < rangeMax; i++) {\n    buckets.push(new List());\n  }\n  const zeroIdx = maxIn + 1;\n\n  fasGraph.getAllNodes().forEach((v) => {\n    assignBucket(buckets, zeroIdx, {\n      v: v.id,\n      ...fasGraph.getNode(v.id).data,\n    } as StateNode);\n  });\n\n  return { buckets, zeroIdx, graph: fasGraph };\n};\n\nconst assignBucket = (buckets: List[], zeroIdx: number, entry: StateNode) => {\n  if (!entry.out) {\n    buckets[0].enqueue(entry);\n  } else if (!entry['in']) {\n    buckets[buckets.length - 1].enqueue(entry);\n  } else {\n    buckets[entry.out - entry['in'] + zeroIdx].enqueue(entry);\n  }\n};\n","import { Edge, ID } from '@antv/graphlib';\nimport { EdgeData, Graph } from '../types';\nimport { greedyFAS } from './greedy-fas';\n\nconst run = (g: Graph, acyclicer: string) => {\n  const weightFn = (g: Graph) => {\n    return (e: Edge<EdgeData>) => e.data.weight || 1;\n  };\n  const fas = acyclicer === 'greedy' ? greedyFAS(g, weightFn(g)) : dfsFAS(g);\n  fas?.forEach((e: Edge<EdgeData>) => {\n    const label = e.data;\n    g.removeEdge(e.id);\n    label.forwardName = e.data.name;\n    label.reversed = true;\n    g.addEdge({\n      id: e.id,\n      source: e.target,\n      target: e.source,\n      data: {\n        ...label,\n      },\n    });\n  });\n};\n\nconst dfsFAS = (g: Graph) => {\n  const fas: Edge<EdgeData>[] = [];\n  const stack: Record<ID, boolean> = {};\n  const visited: Record<ID, boolean> = {};\n\n  const dfs = (v: ID) => {\n    if (visited[v]) {\n      return;\n    }\n    visited[v] = true;\n    stack[v] = true;\n    g.getRelatedEdges(v, 'out').forEach((e) => {\n      if (stack[e.target]) {\n        fas.push(e);\n      } else {\n        dfs(e.target);\n      }\n    });\n    delete stack[v];\n  };\n\n  g.getAllNodes().forEach((n) => dfs(n.id));\n  return fas;\n};\n\nconst undo = (g: Graph) => {\n  g.getAllEdges().forEach((e) => {\n    const label = e.data;\n    if (label.reversed) {\n      g.removeEdge(e.id);\n\n      const forwardName = label.forwardName;\n      delete label.reversed;\n      delete label.forwardName;\n      g.addEdge({\n        id: e.id,\n        source: e.target,\n        target: e.source,\n        data: { ...label, forwardName },\n      });\n    }\n  });\n};\n\nexport { run, undo };\n","import { Graph, ID, Node } from '@antv/graphlib';\nimport { isNumber } from '@antv/util';\nimport { EdgeData, Graph as IGraph, NodeData } from '../types';\n\nconst safeSort = (valueA?: number, valueB?: number) => {\n  return Number(valueA) - Number(valueB);\n};\n\n/*\n * Adds a dummy node to the graph and return v.\n */\nexport const addDummyNode = (\n  g: IGraph,\n  type: string,\n  data: NodeData,\n  name: string,\n): ID => {\n  let v: ID;\n  do {\n    v = `${name}${Math.random()}`;\n  } while (g.hasNode(v));\n\n  data.dummy = type;\n  g.addNode({\n    id: v,\n    data,\n  });\n\n  return v;\n};\n\n/*\n * Returns a new graph with only simple edges. Handles aggregation of data\n * associated with multi-edges.\n */\nexport const simplify = (g: IGraph) => {\n  const simplified = new Graph<NodeData, EdgeData>();\n  g.getAllNodes().forEach((v) => {\n    simplified.addNode({ ...v });\n  });\n  g.getAllEdges().forEach((e) => {\n    const edge = simplified\n      .getRelatedEdges(e.source, 'out')\n      .find((edge) => edge.target === e.target);\n    if (!edge) {\n      simplified.addEdge({\n        id: e.id,\n        source: e.source,\n        target: e.target,\n        data: {\n          weight: e.data.weight! || 0,\n          minlen: e.data.minlen! || 1,\n        },\n      });\n    } else {\n      simplified.updateEdgeData(edge?.id!, {\n        ...edge.data,\n        weight: edge.data.weight! + e.data.weight! || 0,\n        minlen: Math.max(edge.data.minlen!, e.data.minlen! || 1),\n      });\n    }\n  });\n  return simplified;\n};\n\nexport const asNonCompoundGraph = (g: IGraph): IGraph => {\n  const simplified = new Graph();\n\n  g.getAllNodes().forEach((node) => {\n    if (!g.getChildren(node.id).length) {\n      simplified.addNode({ ...node });\n    }\n  });\n\n  g.getAllEdges().forEach((edge) => {\n    simplified.addEdge(edge);\n  });\n\n  return simplified;\n};\n\nexport const zipObject = <T = any>(keys: ID[], values: T[]) => {\n  return keys?.reduce((obj, key, i) => {\n    obj[key] = values[i];\n    return obj;\n  }, {} as Record<ID, T>);\n};\n\nexport const successorWeights = (g: IGraph) => {\n  const weightsMap: Record<ID, Record<string, number>> = {};\n\n  g.getAllNodes().forEach((node) => {\n    const sucs: Record<ID, number> = {};\n    g.getRelatedEdges(node.id, 'out').forEach((e) => {\n      sucs[e.target] = (sucs[e.target] || 0) + (e.data.weight || 0);\n    });\n    weightsMap[node.id] = sucs;\n  });\n\n  return weightsMap;\n};\n\nexport const predecessorWeights = (g: IGraph) => {\n  const nodes = g.getAllNodes();\n\n  const weightMap = nodes.map((v) => {\n    const preds: Record<ID, number> = {};\n    g.getRelatedEdges(v.id, 'in').forEach((e) => {\n      preds[e.source] = (preds[e.source] || 0) + e.data.weight!;\n    });\n    return preds;\n  });\n  return zipObject(\n    nodes.map((n) => n.id),\n    weightMap,\n  );\n};\n\n/*\n * Finds where a line starting at point ({x, y}) would intersect a rectangle\n * ({x, y, width, height}) if it were pointing at the rectangle's center.\n */\nexport const intersectRect = (\n  rect: { x?: number; y?: number; width?: number; height?: number },\n  point: { x?: number; y?: number },\n) => {\n  const x = Number(rect.x);\n  const y = Number(rect.y);\n\n  // Rectangle intersection algorithm from:\n  // http://math.stackexchange.com/questions/108113/find-edge-between-two-boxes\n  const dx = Number(point.x) - x;\n  const dy = Number(point.y) - y;\n  let w = Number(rect.width) / 2;\n  let h = Number(rect.height) / 2;\n\n  if (!dx && !dy) {\n    // completely overlapped directly, then return points its self\n    return { x: 0, y: 0 };\n  }\n\n  let sx;\n  let sy;\n\n  if (Math.abs(dy) * w > Math.abs(dx) * h) {\n    // Intersection is top or bottom of rect.\n    if (dy < 0) {\n      h = -h;\n    }\n    sx = (h * dx) / dy;\n    sy = h;\n  } else {\n    // Intersection is left or right of rect.\n    if (dx < 0) {\n      w = -w;\n    }\n    sx = w;\n    sy = (w * dy) / dx;\n  }\n\n  return { x: x + sx, y: y + sy };\n};\n\n/*\n * Given a DAG with each node assigned \"rank\" and \"order\" properties, this\n * const will produce a matrix with the ids of each node.\n */\nexport const buildLayerMatrix = (g: IGraph) => {\n  const layeringNodes: ID[][] = [];\n  const rankMax = maxRank(g) + 1;\n  for (let i = 0; i < rankMax; i++) {\n    layeringNodes.push([]);\n  }\n\n  // const layering = _.map(_.range(maxRank(g) + 1), function() { return []; });\n  g.getAllNodes().forEach((node) => {\n    const rank = node.data.rank!;\n    if (rank !== undefined && layeringNodes[rank]) {\n      layeringNodes[rank].push(node.id);\n    }\n  });\n\n  for (let i = 0; i < rankMax; i++) {\n    layeringNodes[i] = layeringNodes[i].sort((va: ID, vb: ID) =>\n      safeSort(g.getNode(va).data.order!, g.getNode(vb).data.order!),\n    );\n  }\n\n  return layeringNodes;\n};\n\n/*\n * Adjusts the ranks for all nodes in the graph such that all nodes v have\n * rank(v) >= 0 and at least one node w has rank(w) = 0.\n */\nexport const normalizeRanks = (g: IGraph) => {\n  const nodeRanks = g\n    .getAllNodes()\n    .filter((v) => v.data.rank !== undefined)\n    .map((v) => v.data.rank!);\n  const min = Math.min(...nodeRanks);\n  g.getAllNodes().forEach((v) => {\n    if (v.data.hasOwnProperty('rank') && min !== Infinity) {\n      v.data.rank! -= min;\n    }\n  });\n};\n\nexport const removeEmptyRanks = (g: IGraph, nodeRankFactor: number = 0) => {\n  // Ranks may not start at 0, so we need to offset them\n  const nodes = g.getAllNodes();\n  const nodeRanks = nodes\n    .filter((v) => v.data.rank !== undefined)\n    .map((v) => v.data.rank!);\n\n  const offset = Math.min(...nodeRanks);\n  const layers: ID[][] = [];\n\n  nodes.forEach((v) => {\n    const rank = (v.data.rank! || 0) - offset;\n\n    if (!layers[rank]) {\n      layers[rank] = [];\n    }\n    layers[rank].push(v.id);\n  });\n\n  let delta = 0;\n  for (let i = 0; i < layers.length; i++) {\n    const vs = layers[i];\n    if (vs === undefined) {\n      if (i % nodeRankFactor !== 0) {\n        delta -= 1;\n      }\n    } else if (delta) {\n      vs?.forEach((v: ID) => {\n        const node = g.getNode(v);\n        if (node) {\n          node.data.rank = node.data.rank || 0;\n          node.data.rank! += delta;\n        }\n      });\n    }\n  }\n};\n\nexport const addBorderNode = (\n  g: IGraph,\n  prefix: string,\n  rank?: number,\n  order?: number,\n) => {\n  const node: NodeData = {\n    width: 0,\n    height: 0,\n  };\n  if (isNumber(rank) && isNumber(order)) {\n    node.rank = rank;\n    node.order = order;\n  }\n  return addDummyNode(g, 'border', node, prefix);\n};\n\nexport const maxRank = (g: IGraph) => {\n  let maxRank: number;\n  g.getAllNodes().forEach((v) => {\n    const rank = v.data.rank!;\n    if (rank !== undefined) {\n      if (maxRank === undefined || rank > maxRank) {\n        maxRank = rank;\n      }\n    }\n  });\n\n  if (!maxRank!) {\n    maxRank = 0;\n  }\n  return maxRank;\n};\n\n/*\n * Partition a collection into two groups: `lhs` and `rhs`. If the supplied\n * const returns true for an entry it goes into `lhs`. Otherwise it goes\n * into `rhs.\n */\nexport const partition = <T = any>(\n  collection: T[],\n  fn: (val: T) => boolean,\n) => {\n  const result = { lhs: [] as T[], rhs: [] as T[] };\n  collection?.forEach((value) => {\n    if (fn(value)) {\n      result.lhs.push(value);\n    } else {\n      result.rhs.push(value);\n    }\n  });\n  return result;\n};\n\nexport const minBy = <T = any>(array: T[], func: (param: T) => number) => {\n  return array.reduce((a, b) => {\n    const valA = func(a);\n    const valB = func(b);\n    return valA > valB ? b : a;\n  });\n};\n\nconst doDFS = (\n  graph: IGraph,\n  node: Node<NodeData>,\n  postorder: boolean,\n  visited: ID[],\n  navigator: (n: ID) => Node<NodeData>[],\n  result: ID[],\n) => {\n  if (!visited.includes(node.id)) {\n    visited.push(node.id);\n    if (!postorder) {\n      result.push(node.id);\n    }\n    navigator(node.id).forEach((n) =>\n      doDFS(graph, n, postorder, visited, navigator, result),\n    );\n    if (postorder) {\n      result.push(node.id);\n    }\n  }\n};\n\n/**\n * @description DFS traversal.\n * @description.zh-CN DFS 遍历。\n */\nexport const dfs = (\n  graph: IGraph,\n  node: Node<NodeData> | Node<NodeData>[],\n  order: 'pre' | 'post',\n  isDirected: boolean,\n) => {\n  const nodes = Array.isArray(node) ? node : [node];\n  const navigator = (n: ID) =>\n    (isDirected ? graph.getSuccessors(n) : graph.getNeighbors(n))!;\n  const results: ID[] = [];\n  const visited: ID[] = [];\n  nodes.forEach((node) => {\n    if (!graph.hasNode(node.id)) {\n      throw new Error(`Graph does not have node: ${node}`);\n    } else {\n      doDFS(graph, node, order === 'post', visited, navigator, results);\n    }\n  });\n\n  return results;\n};\n","import { ID, Node } from '@antv/graphlib';\nimport { Graph, NodeData } from '../types';\nimport { addDummyNode } from './util';\n\nexport const addBorderSegments = (g: Graph) => {\n  const dfs = (v: ID) => {\n    const children = g.getChildren(v);\n    const node = g.getNode(v)!;\n    if (children?.length) {\n      children.forEach((child) => dfs(child.id));\n    }\n\n    if (node.data.hasOwnProperty('minRank')) {\n      node.data.borderLeft = [];\n      node.data.borderRight = [];\n      for (\n        let rank = node.data.minRank!, maxRank = node.data.maxRank! + 1;\n        rank < maxRank;\n        rank += 1\n      ) {\n        addBorderNode(g, 'borderLeft', '_bl', v, node, rank);\n        addBorderNode(g, 'borderRight', '_br', v, node, rank);\n      }\n    }\n  };\n\n  g.getRoots().forEach((child) => dfs(child.id));\n};\n\nconst addBorderNode = (\n  g: Graph,\n  prop: string,\n  prefix: string,\n  sg: ID,\n  sgNode: Node<NodeData>,\n  rank: number,\n) => {\n  const label: NodeData = { rank, borderType: prop, width: 0, height: 0 };\n  // @ts-ignore\n  const prev = sgNode.data[prop][rank - 1];\n  const curr = addDummyNode(g, 'border', label, prefix);\n  // @ts-ignore\n  sgNode.data[prop][rank] = curr;\n  g.setParent(curr, sg);\n  if (prev) {\n    g.addEdge({\n      id: `e${Math.random()}`,\n      source: prev,\n      target: curr,\n      data: { weight: 1 },\n    });\n  }\n};\n","import { Node } from '@antv/graphlib';\nimport type { Graph, NodeData, Point } from '../types';\nimport type { DagreRankdir } from './types';\n\nconst adjust = (g: Graph, rankdir: DagreRankdir) => {\n  const rd = rankdir.toLowerCase();\n  if (rd === 'lr' || rd === 'rl') {\n    swapWidthHeight(g);\n  }\n};\n\nconst undo = (g: Graph, rankdir: DagreRankdir) => {\n  const rd = rankdir.toLowerCase();\n  if (rd === 'bt' || rd === 'rl') {\n    reverseY(g);\n  }\n\n  if (rd === 'lr' || rd === 'rl') {\n    swapXY(g);\n    swapWidthHeight(g);\n  }\n};\n\nconst swapWidthHeight = (g: Graph) => {\n  g.getAllNodes().forEach((v) => {\n    swapWidthHeightOne(v);\n  });\n  g.getAllEdges().forEach((e) => {\n    swapWidthHeightOne(e);\n  });\n};\n\nconst swapWidthHeightOne = (node: Node<NodeData>) => {\n  const w = node.data.width;\n  node.data.width = node.data.height;\n  node.data.height = w;\n};\n\nconst reverseY = (g: Graph) => {\n  g.getAllNodes().forEach((v) => {\n    reverseYOne(v.data);\n  });\n\n  g.getAllEdges().forEach((edge) => {\n    edge.data.points?.forEach((point: Point) => reverseYOne(point));\n    if (edge.data.hasOwnProperty('y')) {\n      reverseYOne(edge.data);\n    }\n  });\n};\n\nconst reverseYOne = (node: any) => {\n  if (node?.y) {\n    node.y = -node.y;\n  }\n};\n\nconst swapXY = (g: Graph) => {\n  g.getAllNodes().forEach((v) => {\n    swapXYOne(v.data);\n  });\n\n  g.getAllEdges().forEach((edge) => {\n    edge.data.points?.forEach((point: Point) => swapXYOne(point));\n    if (edge.data.hasOwnProperty('x')) {\n      swapXYOne(edge.data);\n    }\n  });\n};\n\nconst swapXYOne = (node: any) => {\n  const x = node.x;\n  node.x = node.y;\n  node.y = x;\n};\n\nexport { adjust, undo };\n","import { ID } from '@antv/graphlib';\nimport { Graph as IGraph } from '../types';\nimport { addBorderNode, addDummyNode } from './util';\n\n/*\n * A nesting graph creates dummy nodes for the tops and bottoms of subgraphs,\n * adds appropriate edges to ensure that all cluster nodes are placed between\n * these boundries, and ensures that the graph is connected.\n *\n * In addition we ensure, through the use of the minlen property, that nodes\n * and subgraph border nodes to not end up on the same rank.\n *\n * Preconditions:\n *\n *    1. Input graph is a DAG\n *    2. Nodes in the input graph has a minlen attribute\n *\n * Postconditions:\n *\n *    1. Input graph is connected.\n *    2. Dummy nodes are added for the tops and bottoms of subgraphs.\n *    3. The minlen attribute for nodes is adjusted to ensure nodes do not\n *       get placed on the same rank as subgraph border nodes.\n *\n * The nesting graph idea comes from Sander, \"Layout of Compound Directed\n * Graphs.\"\n */\nconst run = (g: IGraph) => {\n  const root = addDummyNode(g, 'root', {}, '_root');\n  const depths = treeDepths(g);\n  let maxDepth = Math.max(...Object.values(depths));\n\n  if (Math.abs(maxDepth) === Infinity) {\n    maxDepth = 1;\n  }\n\n  const height = maxDepth - 1; // Note: depths is an Object not an array\n  const nodeSep = 2 * height + 1;\n\n  // g.graph().nestingRoot = root;\n\n  // Multiply minlen by nodeSep to align nodes on non-border ranks.\n  g.getAllEdges().forEach((e) => {\n    e.data.minlen! *= nodeSep;\n  });\n\n  // Calculate a weight that is sufficient to keep subgraphs vertically compact\n  const weight = sumWeights(g) + 1;\n\n  // Create border nodes and link them up\n  // g.children()?.forEach((child) => {\n  //   dfs(g, root, nodeSep, weight, height, depths, child);\n  // });\n  g.getRoots().forEach((child) => {\n    dfs(g, root, nodeSep, weight, height, depths, child.id);\n  });\n\n  // Save the multiplier for node layers for later removal of empty border\n  // layers.\n  // g.graph().nodeRankFactor = nodeSep;\n\n  return {\n    nestingRoot: root,\n    nodeRankFactor: nodeSep,\n  };\n};\n\nconst dfs = (\n  g: IGraph,\n  root: ID,\n  nodeSep: number,\n  weight: number,\n  height: number,\n  depths: Record<string, number>,\n  v: ID,\n) => {\n  const children = g.getChildren(v);\n  if (!children?.length) {\n    if (v !== root) {\n      // g.setEdge(root, v, { weight: 0, minlen: nodeSep });\n      g.addEdge({\n        id: `e${Math.random()}`,\n        source: root,\n        target: v,\n        data: { weight: 0, minlen: nodeSep },\n      });\n    }\n    return;\n  }\n\n  const top = addBorderNode(g, '_bt');\n  const bottom = addBorderNode(g, '_bb');\n  const label = g.getNode(v)!;\n\n  g.setParent(top, v);\n  label.data.borderTop = top;\n  g.setParent(bottom, v);\n  label.data.borderBottom = bottom;\n\n  children?.forEach((childNode) => {\n    dfs(g, root, nodeSep, weight, height, depths, childNode.id);\n\n    const childTop = childNode.data.borderTop\n      ? (childNode.data.borderTop as ID)\n      : childNode.id;\n    const childBottom = childNode.data.borderBottom\n      ? (childNode.data.borderBottom as ID)\n      : childNode.id;\n    const thisWeight = childNode.data.borderTop ? weight : 2 * weight;\n    const minlen = childTop !== childBottom ? 1 : height - depths[v] + 1;\n\n    g.addEdge({\n      id: `e${Math.random()}`,\n      source: top,\n      target: childTop,\n      data: {\n        minlen,\n        weight: thisWeight,\n        nestingEdge: true,\n      },\n    });\n\n    g.addEdge({\n      id: `e${Math.random()}`,\n      source: childBottom,\n      target: bottom,\n      data: {\n        minlen,\n        weight: thisWeight,\n        nestingEdge: true,\n      },\n    });\n  });\n\n  if (!g.getParent(v)) {\n    g.addEdge({\n      id: `e${Math.random()}`,\n      source: root,\n      target: top,\n      data: {\n        weight: 0,\n        minlen: height + depths[v],\n      },\n    });\n  }\n};\n\nconst treeDepths = (g: IGraph) => {\n  const depths: Record<ID, number> = {};\n  const dfs = (v: ID, depth: number) => {\n    const children = g.getChildren(v);\n    children?.forEach((child) => dfs(child.id, depth + 1));\n    depths[v] = depth;\n  };\n  // g.children()?.forEach((v) => dfs(v, 1));\n\n  g.getRoots().forEach((v) => dfs(v.id, 1));\n  return depths;\n};\n\nconst sumWeights = (g: IGraph) => {\n  let result = 0;\n  g.getAllEdges().forEach((e) => {\n    result += e.data.weight!;\n  });\n  return result;\n};\n\nconst cleanup = (g: IGraph, nestingRoot?: ID) => {\n  // const graphLabel = g.graph();\n  // graphLabel.nestingRoot && g.removeNode(graphLabel.nestingRoot);\n  // delete graphLabel.nestingRoot;\n  if (nestingRoot) {\n    g.removeNode(nestingRoot);\n  }\n\n  g.getAllEdges().forEach((e) => {\n    if (e.data.nestingEdge) {\n      g.removeEdge(e.id);\n    }\n  });\n};\n\nexport { run, cleanup };\n","import { Edge, ID } from '@antv/graphlib';\nimport { EdgeData, Graph as IGraph } from '../types';\nimport { addDummyNode } from './util';\n\n/*\n * Breaks any long edges in the graph into short segments that span 1 layer\n * each. This operation is undoable with the denormalize function.\n *\n * Pre-conditions:\n *\n *    1. The input graph is a DAG.\n *    2. Each node in the graph has a \"rank\" property.\n *\n * Post-condition:\n *\n *    1. All edges in the graph have a length of 1.\n *    2. Dummy nodes are added where edges have been split into segments.\n *    3. The graph is augmented with a \"dummyChains\" attribute which contains\n *       the first dummy in each chain of dummy nodes produced.\n */\n\nconst DUMMY_NODE_EDGE = 'edge';\nconst DUMMY_NODE_EDGE_LABEL = 'edge-label';\n\nconst run = (g: IGraph, dummyChains: ID[]) => {\n  g.getAllEdges().forEach((edge) => normalizeEdge(g, edge, dummyChains));\n};\n\nconst normalizeEdge = (g: IGraph, e: Edge<EdgeData>, dummyChains: ID[]) => {\n  let v = e.source;\n  let vRank = g.getNode(v)!.data.rank!;\n  const w = e.target;\n  const wRank = g.getNode(w)!.data.rank!;\n  const labelRank = e.data.labelRank;\n\n  if (wRank === vRank + 1) return;\n\n  g.removeEdge(e.id);\n\n  let dummy: ID;\n  let nodeData: {\n    width: number;\n    height: number;\n    originalEdge: Edge<EdgeData>;\n    rank: number;\n    dummy?: string;\n    labelpos?: string;\n  };\n  let i;\n  for (i = 0, ++vRank; vRank < wRank; ++i, ++vRank) {\n    e.data.points = [];\n    nodeData = {\n      originalEdge: e,\n      width: 0,\n      height: 0,\n      rank: vRank,\n    };\n\n    dummy = addDummyNode(g, DUMMY_NODE_EDGE, nodeData, '_d');\n\n    if (vRank === labelRank) {\n      nodeData.width = e.data.width!;\n      nodeData.height = e.data.height!;\n      nodeData.dummy = DUMMY_NODE_EDGE_LABEL;\n      nodeData.labelpos = e.data.labelpos as string;\n    }\n\n    g.addEdge({\n      id: `e${Math.random()}`,\n      source: v,\n      target: dummy,\n      data: { weight: e.data.weight },\n    });\n    if (i === 0) {\n      dummyChains.push(dummy);\n    }\n    v = dummy;\n  }\n\n  g.addEdge({\n    id: `e${Math.random()}`,\n    source: v,\n    target: w,\n    data: { weight: e.data.weight },\n  });\n};\n\nconst undo = (g: IGraph, dummyChains: ID[]) => {\n  dummyChains.forEach((v) => {\n    let node = g.getNode(v)!;\n    const { data } = node;\n    const originalEdge = data.originalEdge as Edge<EdgeData>;\n\n    let w;\n    // Restore original edge.\n    if (originalEdge) {\n      g.addEdge(originalEdge);\n    }\n\n    let currentV = v;\n    while (node.data.dummy) {\n      w = g.getSuccessors(currentV)![0];\n      g.removeNode(currentV);\n      originalEdge.data.points!.push({\n        x: node.data.x!,\n        y: node.data.y!,\n      });\n      if (node.data.dummy === DUMMY_NODE_EDGE_LABEL) {\n        originalEdge.data.x = node.data.x;\n        originalEdge.data.y = node.data.y;\n        originalEdge.data.width = node.data.width;\n        originalEdge.data.height = node.data.height;\n      }\n      currentV = w.id;\n      node = g.getNode(currentV)!;\n    }\n  });\n};\n\nexport { run, undo };\n","import isArray from './is-array';\nvar clone = function (obj) {\n    if (typeof obj !== 'object' || obj === null) {\n        return obj;\n    }\n    var rst;\n    if (isArray(obj)) {\n        rst = [];\n        for (var i = 0, l = obj.length; i < l; i++) {\n            if (typeof obj[i] === 'object' && obj[i] != null) {\n                rst[i] = clone(obj[i]);\n            }\n            else {\n                rst[i] = obj[i];\n            }\n        }\n    }\n    else {\n        rst = {};\n        for (var k in obj) {\n            if (typeof obj[k] === 'object' && obj[k] != null) {\n                rst[k] = clone(obj[k]);\n            }\n            else {\n                rst[k] = obj[k];\n            }\n        }\n    }\n    return rst;\n};\nexport default clone;\n//# sourceMappingURL=clone.js.map","import isType from './is-type';\nexport default (function (value) {\n    return Array.isArray ? Array.isArray(value) : isType(value, 'Array');\n});\n//# sourceMappingURL=is-array.js.map","/*\n * A function that takes a layering (an array of layers, each with an array of\n * ordererd nodes) and a graph and returns a weighted crossing count.\n *\n * Pre-conditions:\n *\n *    1. Input graph must be simple (not a multigraph), directed, and include\n *       only simple edges.\n *    2. Edges in the input graph must have assigned weights.\n *\n * Post-conditions:\n *\n *    1. The graph and layering matrix are left unchanged.\n *\n * This algorithm is derived from Barth, et al., \"Bilayer Cross Counting.\"\n */\n\nimport { ID } from '@antv/graphlib';\nimport { Graph } from '../../types';\nimport { zipObject } from '../util';\n\nconst twoLayerCrossCount = (g: Graph, northLayer: ID[], southLayer: ID[]) => {\n  // Sort all of the edges between the north and south layers by their position\n  // in the north layer and then the south. Map these edges to the position of\n  // their head in the south layer.\n  const southPos = zipObject(\n    southLayer,\n    southLayer.map((v, i) => i),\n  );\n  const unflat = northLayer.map((v) => {\n    const unsort = g.getRelatedEdges(v, 'out').map((e) => {\n      return { pos: southPos[e.target] || 0, weight: e.data.weight };\n    });\n    return unsort?.sort((a, b) => a.pos - b.pos);\n  });\n  const southEntries = unflat.flat().filter((entry) => entry !== undefined);\n\n  // Build the accumulator tree\n  let firstIndex = 1;\n  while (firstIndex < southLayer.length) firstIndex <<= 1;\n  const treeSize = 2 * firstIndex - 1;\n  firstIndex -= 1;\n  const tree = Array(treeSize).fill(0, 0, treeSize);\n\n  // Calculate the weighted crossings\n  let cc = 0;\n  southEntries?.forEach((entry) => {\n    if (entry) {\n      let index = entry.pos + firstIndex;\n      tree[index] += entry.weight;\n      let weightSum = 0;\n      while (index > 0) {\n        if (index % 2) {\n          weightSum += tree[index + 1];\n        }\n        index = (index - 1) >> 1;\n        tree[index] += entry.weight;\n      }\n      cc += entry.weight! * weightSum;\n    }\n  });\n\n  return cc;\n};\n\nexport const crossCount = (g: Graph, layering: ID[][]) => {\n  let cc = 0;\n  for (let i = 1; i < layering?.length; i += 1) {\n    cc += twoLayerCrossCount(g, layering[i - 1], layering[i]);\n  }\n  return cc;\n};\n","import { ID } from '@antv/graphlib';\nimport { Graph } from '../../types';\n\n/*\n * Assigns an initial order value for each node by performing a DFS search\n * starting from nodes in the first rank. Nodes are assigned an order in their\n * rank as they are first visited.\n *\n * This approach comes from Gansner, et al., \"A Technique for Drawing Directed\n * Graphs.\"\n *\n * Returns a layering matrix with an array per layer and each layer sorted by\n * the order of its nodes.\n */\nexport const initOrder = (g: Graph) => {\n  const visited: Record<string, boolean> = {};\n  // const simpleNodes = g.getAllNodes().filter((v) => {\n  //   return !g.getChildren(v.id)?.length;\n  // });\n  const simpleNodes = g.getAllNodes();\n  const nodeRanks = simpleNodes.map((v) => v.data.rank! ?? -Infinity);\n\n  const maxRank = Math.max(...nodeRanks);\n  const layers: ID[][] = [];\n  for (let i = 0; i < maxRank + 1; i++) {\n    layers.push([]);\n  }\n\n  const orderedVs = simpleNodes.sort(\n    (a, b) => g.getNode(a.id).data.rank! - g.getNode(b.id).data.rank!,\n  );\n  // const orderedVs = _.sortBy(simpleNodes, function(v) { return g.node(v)!.rank; });\n\n  // 有fixOrder的，直接排序好放进去\n  const beforeSort = orderedVs.filter((n) => {\n    return g.getNode(n.id).data.fixorder !== undefined;\n  });\n  const fixOrderNodes = beforeSort.sort(\n    (a, b) => g.getNode(a.id).data.fixorder! - g.getNode(b.id).data.fixorder!,\n  );\n  fixOrderNodes?.forEach((n) => {\n    if (!isNaN(g.getNode(n.id).data.rank!)) {\n      layers[g.getNode(n.id).data.rank!].push(n.id);\n    }\n    visited[n.id] = true;\n  });\n\n  orderedVs?.forEach((n) =>\n    g.dfsTree(n.id, (node) => {\n      if (visited.hasOwnProperty(node.id)) return true;\n      visited[node.id] = true;\n      if (!isNaN(node.data.rank!)) {\n        layers[node.data.rank!].push(node.id);\n      }\n    }),\n  );\n\n  return layers;\n};\n","/*\n * Given a list of entries of the form {v, barycenter, weight} and a\n * constraint graph this function will resolve any conflicts between the\n * constraint graph and the barycenters for the entries. If the barycenters for\n * an entry would violate a constraint in the constraint graph then we coalesce\n * the nodes in the conflict into a new node that respects the contraint and\n * aggregates barycenter and weight information.\n *\n * This implementation is based on the description in Forster, \"A Fast and\n * Simple Hueristic for Constrained Two-Level Crossing Reduction,\" thought it\n * differs in some specific details.\n *\n * Pre-conditions:\n *\n *    1. Each entry has the form {v, barycenter, weight}, or if the node has\n *       no barycenter, then {v}.\n *\n * Returns:\n *\n *    A new list of entries of the form {vs, i, barycenter, weight}. The list\n *    `vs` may either be a singleton or it may be an aggregation of nodes\n *    ordered such that they do not violate constraints from the constraint\n *    graph. The property `i` is the lowest original index of any of the\n *    elements in `vs`.\n */\n\nimport { ID } from '@antv/graphlib';\nimport { Graph } from '../../types';\n\nexport type ConflictEntry = {\n  i: number;\n  indegree?: number;\n  in?: ConflictEntry[];\n  out?: ConflictEntry[];\n  vs: ID[];\n  barycenter?: number;\n  weight?: number;\n  merged?: boolean;\n  fixorder?: number;\n  order?: number;\n};\n\nconst resolveConflicts = (\n  entries: {\n    v: ID;\n    barycenter?: number;\n    weight?: number;\n  }[],\n  cg: Graph,\n) => {\n  const mappedEntries: Record<string, ConflictEntry> = {};\n  entries?.forEach((entry, i: number) => {\n    mappedEntries[entry.v] = {\n      i,\n      indegree: 0,\n      in: [],\n      out: [],\n      vs: [entry.v],\n    };\n    const tmp = mappedEntries[entry.v];\n    if (entry.barycenter !== undefined) {\n      tmp.barycenter = entry.barycenter;\n      tmp.weight = entry.weight;\n    }\n  });\n\n  cg.getAllEdges()?.forEach((e) => {\n    const entryV = mappedEntries[e.source];\n    const entryW = mappedEntries[e.target];\n    if (entryV !== undefined && entryW !== undefined) {\n      entryW.indegree!++;\n      entryV.out!.push(mappedEntries[e.target]);\n    }\n  });\n\n  const sourceSet = Object.values(mappedEntries).filter?.(\n    (entry: ConflictEntry) => !entry.indegree,\n  );\n\n  return doResolveConflicts(sourceSet);\n};\n\nconst doResolveConflicts = (sourceSet: ConflictEntry[]) => {\n  const entries = [];\n\n  const handleIn = (vEntry: ConflictEntry) => {\n    return (uEntry: ConflictEntry) => {\n      if (uEntry.merged) return;\n      if (\n        uEntry.barycenter === undefined ||\n        vEntry.barycenter === undefined ||\n        uEntry.barycenter >= vEntry.barycenter\n      ) {\n        mergeEntries(vEntry, uEntry);\n      }\n    };\n  };\n\n  const handleOut = (vEntry: ConflictEntry) => {\n    return (wEntry: ConflictEntry) => {\n      wEntry['in']!.push(vEntry);\n      if (--wEntry.indegree! === 0) {\n        sourceSet.push(wEntry);\n      }\n    };\n  };\n\n  while (sourceSet?.length) {\n    const entry = sourceSet.pop()!;\n    entries.push(entry);\n    entry['in']!.reverse()?.forEach((e: ConflictEntry) => handleIn(entry)(e));\n    entry.out?.forEach((e: ConflictEntry) => handleOut(entry)(e));\n  }\n\n  const filtered = entries.filter((entry) => !entry.merged);\n  const keys: ('vs' | 'i' | 'barycenter' | 'weight')[] = [\n    'vs',\n    'i',\n    'barycenter',\n    'weight',\n  ];\n  return filtered.map((entry) => {\n    const picked: Record<string, any> = {};\n    keys?.forEach((key) => {\n      if (entry[key] === undefined) return;\n      picked[key] = entry[key];\n    });\n    return picked as ConflictEntry;\n  });\n};\n\nconst mergeEntries = (target: ConflictEntry, source: ConflictEntry) => {\n  let sum = 0;\n  let weight = 0;\n\n  if (target.weight) {\n    sum += target.barycenter! * target.weight;\n    weight += target.weight;\n  }\n\n  if (source.weight) {\n    sum += source.barycenter! * source.weight;\n    weight += source.weight;\n  }\n\n  target.vs = source.vs?.concat(target.vs);\n  target.barycenter = sum / weight;\n  target.weight = weight;\n  target.i = Math.min(source.i, target.i);\n  source.merged = true;\n};\n\nexport default resolveConflicts;\n","import { ID } from '@antv/graphlib';\nimport { partition } from '../util';\nimport { ConflictEntry } from './resolve-conflicts';\n\nexport const sort = (\n  entries: ConflictEntry[],\n  biasRight?: boolean,\n  usePrev?: boolean,\n  keepNodeOrder?: boolean,\n) => {\n  const parts = partition(entries, (entry) => {\n    const hasFixOrder =\n      entry.hasOwnProperty('fixorder') && !isNaN(entry.fixorder!);\n    if (keepNodeOrder) {\n      return !hasFixOrder && entry.hasOwnProperty('barycenter');\n    }\n    // NOTE: 有fixorder的也可以排\n    return hasFixOrder || entry.hasOwnProperty('barycenter');\n  });\n  const sortable = parts.lhs;\n  const unsortable = parts.rhs.sort((a, b) => -a.i - -b.i);\n  const vs: ID[][] = [];\n  let sum = 0;\n  let weight = 0;\n  let vsIndex = 0;\n\n  sortable?.sort(compareWithBias(!!biasRight, !!usePrev));\n\n  vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n\n  sortable?.forEach((entry) => {\n    vsIndex += entry.vs?.length;\n    vs.push(entry.vs);\n    sum += entry.barycenter! * entry.weight!;\n    weight += entry.weight!;\n    vsIndex = consumeUnsortable(vs, unsortable, vsIndex);\n  });\n\n  const result: { vs: ID[]; barycenter?: number; weight?: number } = {\n    vs: vs.flat(),\n  };\n  if (weight) {\n    result.barycenter = sum / weight;\n    result.weight = weight;\n  }\n  return result;\n};\n\nconst consumeUnsortable = (\n  vs: ID[][],\n  unsortable: ConflictEntry[],\n  index: number,\n) => {\n  let iindex = index;\n  let last;\n  while (\n    unsortable.length &&\n    (last = unsortable[unsortable.length - 1]).i <= iindex\n  ) {\n    unsortable.pop();\n    vs?.push(last.vs);\n    iindex++;\n  }\n  return iindex;\n};\n\n/**\n * 配置是否考虑使用之前的布局结果\n */\nconst compareWithBias = (bias: boolean, usePrev: boolean) => {\n  return (entryV: ConflictEntry, entryW: ConflictEntry) => {\n    // 排序的时候先判断fixorder，不行再判断重心\n    if (entryV.fixorder !== undefined && entryW.fixorder !== undefined) {\n      return entryV.fixorder - entryW.fixorder;\n    }\n    if (entryV.barycenter! < entryW.barycenter!) {\n      return -1;\n    }\n    if (entryV.barycenter! > entryW.barycenter!) {\n      return 1;\n    }\n    // 重心相同，考虑之前排好的顺序\n    if (usePrev && entryV.order !== undefined && entryW.order !== undefined) {\n      if (entryV.order < entryW.order) {\n        return -1;\n      }\n      if (entryV.order > entryW.order) {\n        return 1;\n      }\n    }\n\n    return !bias ? entryV.i - entryW.i : entryW.i - entryV.i;\n  };\n};\n","import { ID } from '@antv/graphlib';\nimport { Graph } from '../../types';\nimport { barycenter } from './barycenter';\nimport resolveConflicts, { ConflictEntry } from './resolve-conflicts';\nimport { sort } from './sort';\n\nexport const sortSubgraph = (\n  g: Graph,\n  v: ID,\n  cg: Graph,\n  biasRight?: boolean,\n  usePrev?: boolean,\n  keepNodeOrder?: boolean,\n) => {\n  let movable = g.getChildren(v).map((n) => n.id);\n  // fixorder的点不参与排序（这个方案不合适，只排了新增节点，和原来的分离）\n  const node = g.getNode(v)!;\n  const bl = node ? (node.data.borderLeft as ID) : undefined;\n  const br = node ? (node.data.borderRight as ID) : undefined;\n  const subgraphs: Record<string, Partial<ConflictEntry>> = {};\n\n  if (bl) {\n    movable = movable?.filter((w) => {\n      return w !== bl && w !== br;\n    });\n  }\n\n  const barycenters = barycenter(g, movable || []);\n  barycenters?.forEach((entry) => {\n    if (g.getChildren(entry.v)?.length) {\n      const subgraphResult = sortSubgraph(\n        g,\n        entry.v,\n        cg,\n        biasRight,\n        keepNodeOrder,\n      );\n      subgraphs[entry.v] = subgraphResult;\n      if (subgraphResult.hasOwnProperty('barycenter')) {\n        mergeBarycenters(entry, subgraphResult);\n      }\n    }\n  });\n\n  const entries = resolveConflicts(barycenters, cg);\n  expandSubgraphs(entries, subgraphs);\n\n  // 添加fixorder信息到entries里边\n  // TODO: 不考虑复合情况，只用第一个点的fixorder信息，后续考虑更完备的实现\n  entries\n    .filter((e) => e.vs.length > 0)\n    ?.forEach((e) => {\n      const node = g.getNode(e.vs[0])!;\n      if (node) {\n        e.fixorder = node.data.fixorder!;\n        e.order = node.data.order!;\n      }\n    });\n\n  const result = sort(entries, biasRight, usePrev, keepNodeOrder);\n\n  if (bl) {\n    result.vs = [bl, result.vs, br].flat() as ID[];\n    if (g.getPredecessors(bl)?.length) {\n      const blPred = g.getNode(g.getPredecessors(bl)?.[0].id || '')!;\n      const brPred = g.getNode(g.getPredecessors(br!)?.[0].id || '')!;\n      if (!result.hasOwnProperty('barycenter')) {\n        result.barycenter = 0;\n        result.weight = 0;\n      }\n      result.barycenter =\n        (result.barycenter! * result.weight! +\n          blPred.data.order! +\n          brPred.data.order!) /\n        (result.weight! + 2);\n      result.weight! += 2;\n    }\n  }\n\n  return result;\n};\n\nconst expandSubgraphs = (\n  entries: ConflictEntry[],\n  subgraphs: Record<string, Partial<ConflictEntry>>,\n) => {\n  entries?.forEach((entry) => {\n    const vss = entry.vs?.map((v: string) => {\n      if (subgraphs[v]) {\n        return subgraphs[v].vs!;\n      }\n      return v;\n    });\n    entry.vs = vss.flat();\n  });\n};\n\nconst mergeBarycenters = (\n  target: { weight?: number; barycenter?: number },\n  other: { weight?: number; barycenter?: number },\n) => {\n  if (target.barycenter !== undefined) {\n    target.barycenter =\n      (target.barycenter * target.weight! + other.barycenter! * other.weight!) /\n      (target.weight! + other.weight!);\n    target.weight! += other.weight!;\n  } else {\n    target.barycenter = other.barycenter;\n    target.weight = other.weight;\n  }\n};\n","import { ID } from '@antv/graphlib';\nimport { Graph } from '../../types';\n\n/**\n * TODO: The median method consistently performs better than the barycenter method and has a slight theoretical advantage\n */\nexport const barycenter = (g: Graph, movable: ID[]) => {\n  return movable.map((v) => {\n    const inV = g.getRelatedEdges(v, 'in');\n    if (!inV?.length) {\n      return { v };\n    }\n\n    const result = { sum: 0, weight: 0 };\n    inV?.forEach((e) => {\n      const nodeU = g.getNode(e.source)!;\n      result.sum += e.data.weight! * nodeU.data.order!;\n      result.weight += e.data.weight!;\n    });\n    return {\n      v,\n      barycenter: result.sum / result.weight,\n      weight: result.weight,\n    };\n  });\n};\n","import { Graph, ID } from '@antv/graphlib';\nimport { clone } from '@antv/util';\nimport { Graph as IGraph } from '../../types';\nimport { buildLayerMatrix, maxRank } from '../util';\nimport { addSubgraphConstraints } from './add-subgraph-constraints';\nimport { buildLayerGraph } from './build-layer-graph';\nimport { crossCount } from './cross-count';\nimport { initOrder } from './init-order';\nimport { sortSubgraph } from './sort-subgraph';\n\n/*\n * Applies heuristics to minimize edge crossings in the graph and sets the best\n * order solution as an order attribute on each node.\n *\n * Pre-conditions:\n *\n *    1. Graph must be DAG\n *    2. Graph nodes must be objects with a \"rank\" attribute\n *    3. Graph edges must have the \"weight\" attribute\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have an \"order\" attribute based on the results of the\n *       algorithm.\n */\nexport const order = (g: IGraph, keepNodeOrder?: boolean) => {\n  const mxRank = maxRank(g);\n  const range1 = [];\n  const range2 = [];\n  for (let i = 1; i < mxRank + 1; i++) range1.push(i);\n  for (let i = mxRank - 1; i > -1; i--) range2.push(i);\n  const downLayerGraphs = buildLayerGraphs(g, range1, 'in');\n  const upLayerGraphs = buildLayerGraphs(g, range2, 'out');\n\n  let layering = initOrder(g);\n  assignOrder(g, layering);\n\n  let bestCC = Number.POSITIVE_INFINITY;\n  let best: string[][];\n  for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(\n      i % 2 ? downLayerGraphs : upLayerGraphs,\n      i % 4 >= 2,\n      false,\n      keepNodeOrder,\n    );\n\n    layering = buildLayerMatrix(g);\n    const cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = clone(layering);\n      bestCC = cc;\n    }\n  }\n\n  // consider use previous result, maybe somewhat reduendant\n  layering = initOrder(g);\n  assignOrder(g, layering);\n  for (let i = 0, lastBest = 0; lastBest < 4; ++i, ++lastBest) {\n    sweepLayerGraphs(\n      i % 2 ? downLayerGraphs : upLayerGraphs,\n      i % 4 >= 2,\n      true,\n      keepNodeOrder,\n    );\n\n    layering = buildLayerMatrix(g);\n    const cc = crossCount(g, layering);\n    if (cc < bestCC) {\n      lastBest = 0;\n      best = clone(layering);\n      bestCC = cc;\n    }\n  }\n  assignOrder(g, best!);\n};\n\nconst buildLayerGraphs = (\n  g: IGraph,\n  ranks: number[],\n  direction: 'in' | 'out',\n) => {\n  return ranks.map((rank) => {\n    return buildLayerGraph(g, rank, direction);\n  });\n};\n\nconst sweepLayerGraphs = (\n  layerGraphs: IGraph[],\n  biasRight: boolean,\n  usePrev?: boolean,\n  keepNodeOrder?: boolean,\n) => {\n  const cg = new Graph();\n  layerGraphs?.forEach((lg) => {\n    // const root = lg.graph().root as string;\n    const root = lg.getRoots()[0].id;\n    const sorted = sortSubgraph(\n      lg,\n      root,\n      cg,\n      biasRight,\n      usePrev,\n      keepNodeOrder,\n    );\n    for (let i = 0; i < sorted.vs?.length || 0; i++) {\n      const lnode = lg.getNode(sorted.vs[i]);\n      if (lnode) {\n        lnode.data.order = i;\n      }\n    }\n    addSubgraphConstraints(lg, cg, sorted.vs);\n  });\n};\n\nconst assignOrder = (g: IGraph, layering: ID[][]) => {\n  layering?.forEach((layer) => {\n    layer?.forEach((v: ID, i: number) => {\n      g.getNode(v).data.order = i;\n    });\n  });\n};\n","import { Graph, ID } from '@antv/graphlib';\nimport { EdgeData, Graph as IGraph, NodeData } from '../../types';\n\n/*\n * Constructs a graph that can be used to sort a layer of nodes. The graph will\n * contain all base and subgraph nodes from the request layer in their original\n * hierarchy and any edges that are incident on these nodes and are of the type\n * requested by the \"relationship\" parameter.\n *\n * Nodes from the requested rank that do not have parents are assigned a root\n * node in the output graph, which is set in the root graph attribute. This\n * makes it easy to walk the hierarchy of movable nodes during ordering.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG\n *    2. Base nodes in the input graph have a rank attribute\n *    3. Subgraph nodes in the input graph has minRank and maxRank attributes\n *    4. Edges have an assigned weight\n *\n * Post-conditions:\n *\n *    1. Output graph has all nodes in the movable rank with preserved\n *       hierarchy.\n *    2. Root nodes in the movable layer are made children of the node\n *       indicated by the root attribute of the graph.\n *    3. Non-movable nodes incident on movable nodes, selected by the\n *       relationship parameter, are included in the graph (without hierarchy).\n *    4. Edges incident on movable nodes, selected by the relationship\n *       parameter, are added to the output graph.\n *    5. The weights for copied edges are aggregated as need, since the output\n *       graph is not a multi-graph.\n */\nexport const buildLayerGraph = (\n  g: IGraph,\n  rank: number,\n  direction: 'in' | 'out',\n) => {\n  const root = createRootNode(g);\n  const result = new Graph<NodeData, EdgeData>({\n    tree: [\n      {\n        id: root,\n        children: [],\n        data: {},\n      },\n    ],\n  });\n\n  g.getAllNodes().forEach((v) => {\n    const parent = g.getParent(v.id);\n\n    if (\n      v.data.rank === rank ||\n      (v.data.minRank! <= rank && rank <= v.data.maxRank!)\n    ) {\n      if (!result.hasNode(v.id)) {\n        result.addNode({ ...v });\n      }\n\n      if (parent?.id && !result.hasNode(parent?.id)) {\n        result.addNode({ ...parent });\n      }\n\n      result.setParent(v.id, parent?.id || root);\n\n      // This assumes we have only short edges!\n      g.getRelatedEdges(v.id, direction).forEach((e) => {\n        const u = e.source === v.id ? e.target : e.source;\n        if (!result.hasNode(u)) {\n          result.addNode({ ...g.getNode(u) });\n        }\n\n        const edge = result\n          .getRelatedEdges(u, 'out')\n          .find(({ target }) => target === v.id);\n        const weight = edge !== undefined ? edge.data.weight! : 0;\n\n        if (!edge) {\n          result.addEdge({\n            id: e.id,\n            source: u,\n            target: v.id,\n            data: {\n              weight: e.data.weight! + weight,\n            },\n          });\n        } else {\n          result.updateEdgeData(edge.id, {\n            ...edge.data,\n            weight: e.data.weight! + weight,\n          });\n        }\n      });\n\n      // console.log(v);\n\n      if (v.data.hasOwnProperty('minRank')) {\n        result.updateNodeData(v.id, {\n          ...v.data,\n          borderLeft: (v.data.borderLeft as ID[])[rank],\n          borderRight: (v.data.borderRight as ID[])[rank],\n        });\n      }\n    }\n  });\n\n  return result;\n};\n\nconst createRootNode = (g: IGraph) => {\n  let v;\n  while (g.hasNode((v = `_root${Math.random()}`)));\n  return v;\n};\n","import { ID } from '@antv/graphlib';\nimport { Graph } from '../../types';\n\nexport const addSubgraphConstraints = (g: Graph, cg: Graph, vs: ID[]) => {\n  const prev: Record<ID, ID> = {};\n  let rootPrev: ID;\n\n  vs?.forEach((v) => {\n    let child = g.getParent(v);\n    let parent;\n    let prevChild: ID;\n    while (child) {\n      parent = g.getParent(child.id);\n      if (parent) {\n        prevChild = prev[parent.id];\n        prev[parent.id] = child.id;\n      } else {\n        prevChild = rootPrev;\n        rootPrev = child.id;\n      }\n      if (prevChild && prevChild !== child.id) {\n        if (!cg.hasNode(prevChild)) {\n          cg.addNode({\n            id: prevChild,\n            data: {},\n          });\n        }\n        if (!cg.hasNode(child.id)) {\n          cg.addNode({\n            id: child.id,\n            data: {},\n          });\n        }\n        if (!cg.hasEdge(`e${prevChild}-${child.id}`)) {\n          cg.addEdge({\n            id: `e${prevChild}-${child.id}`,\n            source: prevChild,\n            target: child.id,\n            data: {},\n          });\n        }\n        return;\n      }\n      child = parent;\n    }\n  });\n};\n","/*\n * This module provides coordinate assignment based on Brandes and Köpf, \"Fast\n * and Simple Horizontal Coordinate Assignment.\"\n */\nimport { Graph, ID, Node } from '@antv/graphlib';\nimport type { EdgeData, Graph as IGraph, NodeData } from '../../types';\nimport type { DagreAlign } from '../types';\nimport { buildLayerMatrix, minBy } from '../util';\n\n/*\n * Marks all edges in the graph with a type-1 conflict with the \"type1Conflict\"\n * property. A type-1 conflict is one where a non-inner segment crosses an\n * inner segment. An inner segment is an edge with both incident nodes marked\n * with the \"dummy\" property.\n *\n * This algorithm scans layer by layer, starting with the second, for type-1\n * conflicts between the current layer and the previous layer. For each layer\n * it scans the nodes from left to right until it reaches one that is incident\n * on an inner segment. It then scans predecessors to determine if they have\n * edges that cross that inner segment. At the end a final scan is done for all\n * nodes on the current rank to see if they cross the last visited inner\n * segment.\n *\n * This algorithm (safely) assumes that a dummy node will only be incident on a\n * single node in the layers being scanned.\n */\n\ntype Conflicts = Record<ID, Record<ID, boolean>>;\n\nexport const findType1Conflicts = (g: IGraph, layering?: ID[][]) => {\n  const conflicts = {};\n\n  const visitLayer = (prevLayer: ID[], layer: ID[]) => {\n    // last visited node in the previous layer that is incident on an inner\n    // segment.\n    let k0 = 0;\n    // Tracks the last node in this layer scanned for crossings with a type-1\n    // segment.\n    let scanPos = 0;\n    const prevLayerLength = prevLayer.length;\n    const lastNode = layer?.[layer?.length - 1];\n\n    layer?.forEach((v: ID, i: number) => {\n      const w = findOtherInnerSegmentNode(g, v);\n      const k1 = w ? g.getNode(w.id)!.data.order! : prevLayerLength;\n\n      if (w || v === lastNode) {\n        layer.slice(scanPos, i + 1)?.forEach((scanNode) => {\n          g.getPredecessors(scanNode)?.forEach((u) => {\n            const uLabel = g.getNode(u.id)!;\n            const uPos = uLabel.data.order!;\n            if (\n              (uPos < k0 || k1 < uPos) &&\n              !(uLabel.data.dummy && g.getNode(scanNode)?.data.dummy)\n            ) {\n              addConflict(conflicts, u.id, scanNode);\n            }\n          });\n        });\n        scanPos = i + 1;\n        k0 = k1;\n      }\n    });\n\n    return layer;\n  };\n\n  if (layering?.length) {\n    layering.reduce(visitLayer);\n  }\n  return conflicts;\n};\n\nexport const findType2Conflicts = (g: IGraph, layering?: ID[][]) => {\n  const conflicts = {};\n\n  function scan(\n    south: string[],\n    southPos: number,\n    southEnd: number,\n    prevNorthBorder: number,\n    nextNorthBorder: number,\n  ) {\n    let v: string;\n    for (let i = southPos; i < southEnd; i++) {\n      v = south[i];\n      if (g.getNode(v)?.data.dummy) {\n        g.getPredecessors(v)?.forEach((u) => {\n          const uNode = g.getNode(u.id)!;\n          if (\n            uNode.data.dummy &&\n            (uNode.data.order! < prevNorthBorder ||\n              uNode.data.order! > nextNorthBorder)\n          ) {\n            addConflict(conflicts, u.id, v);\n          }\n        });\n      }\n    }\n  }\n\n  function getScannedKey(params: Parameters<typeof scan>) {\n    // south数组可能很大，不适合做key\n    return JSON.stringify(params.slice(1));\n  }\n\n  function scanIfNeeded(\n    params: Parameters<typeof scan>,\n    scanCache: Map<string, boolean>,\n  ) {\n    const cacheKey = getScannedKey(params);\n\n    if (scanCache.get(cacheKey)) return;\n\n    scan(...params);\n    scanCache.set(cacheKey, true);\n  }\n\n  const visitLayer = (north: string[], south: string[]) => {\n    let prevNorthPos = -1;\n    let nextNorthPos: number;\n    let southPos = 0;\n\n    const scanned = new Map<string, boolean>();\n\n    south?.forEach((v: string, southLookahead: number) => {\n      if (g.getNode(v)?.data.dummy === 'border') {\n        const predecessors = g.getPredecessors(v) || [];\n        if (predecessors.length) {\n          nextNorthPos = g.getNode(predecessors[0].id)!.data.order!;\n          scanIfNeeded(\n            [south, southPos, southLookahead, prevNorthPos, nextNorthPos],\n            scanned,\n          );\n          southPos = southLookahead;\n          prevNorthPos = nextNorthPos;\n        }\n      }\n      scanIfNeeded(\n        [south, southPos, south.length, nextNorthPos, north.length],\n        scanned,\n      );\n    });\n\n    return south;\n  };\n\n  if (layering?.length) {\n    layering.reduce(visitLayer);\n  }\n  return conflicts;\n};\n\nexport const findOtherInnerSegmentNode = (g: IGraph, v: ID) => {\n  if (g.getNode(v)?.data.dummy) {\n    return g.getPredecessors(v)?.find((u) => g.getNode(u.id).data.dummy);\n  }\n};\n\nexport const addConflict = (conflicts: Conflicts, v: ID, w: ID) => {\n  let vv = v;\n  let ww = w;\n  if (vv > ww) {\n    const tmp = vv;\n    vv = ww;\n    ww = tmp;\n  }\n\n  let conflictsV = conflicts[vv];\n  if (!conflictsV) {\n    conflicts[vv] = conflictsV = {};\n  }\n  conflictsV[ww] = true;\n};\n\nexport const hasConflict = (conflicts: Conflicts, v: ID, w: ID) => {\n  let vv = v;\n  let ww = w;\n  if (vv > ww) {\n    const tmp = v;\n    vv = ww;\n    ww = tmp;\n  }\n  return !!conflicts[vv];\n};\n\n/*\n * Try to align nodes into vertical \"blocks\" where possible. This algorithm\n * attempts to align a node with one of its median neighbors. If the edge\n * connecting a neighbor is a type-1 conflict then we ignore that possibility.\n * If a previous node has already formed a block with a node after the node\n * we're trying to form a block with, we also ignore that possibility - our\n * blocks would be split in that scenario.\n */\nexport const verticalAlignment = (\n  g: IGraph,\n  layering: ID[][],\n  conflicts: Conflicts,\n  neighborFn: (v: ID) => Node<NodeData>[],\n) => {\n  const root: Record<ID, ID> = {};\n  const align: Record<ID, ID> = {};\n  const pos: Record<ID, number> = {};\n\n  // We cache the position here based on the layering because the graph and\n  // layering may be out of sync. The layering matrix is manipulated to\n  // generate different extreme alignments.\n  layering?.forEach((layer) => {\n    layer?.forEach((v, order: number) => {\n      root[v] = v;\n      align[v] = v;\n      pos[v] = order;\n    });\n  });\n\n  layering?.forEach((layer) => {\n    let prevIdx = -1;\n    layer?.forEach((v) => {\n      let ws = neighborFn(v).map((n) => n.id);\n\n      if (ws.length) {\n        ws = ws.sort((a: ID, b: ID) => pos[a] - pos[b]);\n        const mp = (ws.length - 1) / 2;\n        for (let i = Math.floor(mp), il = Math.ceil(mp); i <= il; ++i) {\n          const w = ws[i];\n          if (\n            align[v] === v &&\n            prevIdx < pos[w] &&\n            !hasConflict(conflicts, v, w)\n          ) {\n            align[w] = v;\n            align[v] = root[v] = root[w];\n            prevIdx = pos[w];\n          }\n        }\n      }\n    });\n  });\n\n  return { root, align };\n};\n\nexport const horizontalCompaction = (\n  g: IGraph,\n  layering: ID[][],\n  root: Record<ID, ID>,\n  align: Record<ID, ID>,\n  nodesep: number,\n  edgesep: number,\n  reverseSep?: boolean,\n) => {\n  // This portion of the algorithm differs from BK due to a number of problems.\n  // Instead of their algorithm we construct a new block graph and do two\n  // sweeps. The first sweep places blocks with the smallest possible\n  // coordinates. The second sweep removes unused space by moving blocks to the\n  // greatest coordinates without violating separation.\n  const xs: Record<ID, number> = {};\n  const blockG = buildBlockGraph(\n    g,\n    layering,\n    root,\n    nodesep,\n    edgesep,\n    reverseSep,\n  );\n  const borderType = reverseSep ? 'borderLeft' : 'borderRight';\n\n  const iterate = (\n    setXsFunc: (param: ID) => void,\n    nextNodesFunc: (param: ID) => Node<NodeData>,\n  ) => {\n    let stack = blockG.getAllNodes();\n    let elem = stack.pop();\n    const visited: Record<ID, boolean> = {};\n    while (elem) {\n      if (visited[elem.id]) {\n        setXsFunc(elem.id);\n      } else {\n        visited[elem.id] = true;\n        stack.push(elem);\n        stack = stack.concat(nextNodesFunc(elem.id));\n      }\n\n      elem = stack.pop();\n    }\n  };\n\n  // First pass, assign smallest coordinates\n  const pass1 = (elem: ID) => {\n    xs[elem] = (blockG.getRelatedEdges(elem, 'in') || []).reduce(\n      (acc: number, e) => {\n        return Math.max(acc, (xs[e.source] || 0) + e.data.weight!);\n      },\n      0,\n    );\n  };\n\n  // Second pass, assign greatest coordinates\n  const pass2 = (elem: ID) => {\n    const min = (blockG.getRelatedEdges(elem, 'out') || []).reduce(\n      (acc: number, e) => {\n        return Math.min(acc, (xs[e.target] || 0) - e.data.weight!);\n      },\n      Number.POSITIVE_INFINITY,\n    );\n\n    const node = g.getNode(elem)!;\n    if (\n      min !== Number.POSITIVE_INFINITY &&\n      node.data.borderType !== borderType\n    ) {\n      xs[elem] = Math.max(xs[elem], min);\n    }\n  };\n\n  iterate(pass1, blockG.getPredecessors.bind(blockG));\n  iterate(pass2, blockG.getSuccessors.bind(blockG));\n\n  // Assign x coordinates to all nodes\n  Object.values(align)?.forEach((v) => {\n    xs[v] = xs[root[v]];\n  });\n\n  return xs;\n};\n\nexport const buildBlockGraph = (\n  g: IGraph,\n  layering: ID[][],\n  root: Record<ID, ID>,\n  nodesep: number,\n  edgesep: number,\n  reverseSep?: boolean,\n): IGraph => {\n  const blockGraph = new Graph<NodeData, EdgeData>();\n  const sepFn = sep(nodesep, edgesep, reverseSep as boolean);\n\n  layering?.forEach((layer) => {\n    let u: ID;\n    layer?.forEach((v) => {\n      const vRoot = root[v];\n      if (!blockGraph.hasNode(vRoot)) {\n        blockGraph.addNode({\n          id: vRoot,\n          data: {},\n        });\n      }\n      if (u) {\n        const uRoot = root[u];\n\n        const edge = blockGraph\n          .getRelatedEdges(uRoot, 'out')\n          .find((edge) => edge.target === vRoot);\n        if (!edge) {\n          blockGraph.addEdge({\n            id: `e${Math.random()}`,\n            source: uRoot,\n            target: vRoot,\n            data: {\n              weight: Math.max(sepFn(g, v, u), 0),\n            },\n          });\n        } else {\n          blockGraph.updateEdgeData(edge.id, {\n            ...edge.data,\n            weight: Math.max(sepFn(g, v, u), edge.data.weight! || 0),\n          });\n        }\n      }\n      u = v;\n    });\n  });\n\n  return blockGraph;\n};\n/*\n * Returns the alignment that has the smallest width of the given alignments.\n */\nexport const findSmallestWidthAlignment = (\n  g: IGraph,\n  xss: Record<string, Record<string, number>>,\n) => {\n  return minBy(Object.values(xss), (xs) => {\n    let max = Number.NEGATIVE_INFINITY;\n    let min = Number.POSITIVE_INFINITY;\n\n    Object.keys(xs)?.forEach((v: string) => {\n      const x = xs[v];\n      const halfWidth = width(g, v) / 2;\n\n      max = Math.max(x + halfWidth, max);\n      min = Math.min(x - halfWidth, min);\n    });\n\n    return max - min;\n  });\n};\n\n/*\n * Align the coordinates of each of the layout alignments such that\n * left-biased alignments have their minimum coordinate at the same point as\n * the minimum coordinate of the smallest width alignment and right-biased\n * alignments have their maximum coordinate at the same point as the maximum\n * coordinate of the smallest width alignment.\n */\nexport function alignCoordinates(\n  xss: Record<string, Record<string, number>>,\n  alignTo: Record<string, number>,\n) {\n  const alignToVals = Object.values(alignTo);\n  const alignToMin = Math.min(...alignToVals);\n  const alignToMax = Math.max(...alignToVals);\n\n  ['u', 'd'].forEach((vert) => {\n    ['l', 'r'].forEach((horiz) => {\n      const alignment = vert + horiz;\n      const xs = xss[alignment];\n      let delta: number;\n      if (xs === alignTo) return;\n\n      const xsVals = Object.values(xs);\n      delta =\n        horiz === 'l'\n          ? alignToMin - Math.min(...xsVals)\n          : alignToMax - Math.max(...xsVals);\n\n      if (delta) {\n        xss[alignment] = {};\n        Object.keys(xs).forEach((key) => {\n          xss[alignment][key] = xs[key] + delta;\n        });\n      }\n    });\n  });\n}\n\nexport const balance = (\n  xss: Record<string, Record<string, number>>,\n  align?: DagreAlign,\n) => {\n  const result: Record<string, number> = {};\n  Object.keys(xss.ul).forEach((key) => {\n    if (align) {\n      result[key] = xss[align.toLowerCase()][key];\n    } else {\n      const values = Object.values(xss).map((x) => x[key]);\n      result[key] = (values[0] + values[1]) / 2; // (ur + ul) / 2\n    }\n  });\n  return result;\n};\n\nexport const positionX = (\n  g: IGraph,\n  options?: Partial<{\n    align: DagreAlign;\n    nodesep: number;\n    edgesep: number;\n  }>,\n) => {\n  const { align: graphAlign, nodesep = 0, edgesep = 0 } = options || {};\n\n  const layering = buildLayerMatrix(g);\n  const conflicts = Object.assign(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering),\n  );\n\n  const xss: Record<string, Record<ID, number>> = {};\n  let adjustedLayering: ID[][];\n  ['u', 'd'].forEach((vert) => {\n    adjustedLayering =\n      vert === 'u' ? layering : Object.values(layering).reverse();\n    ['l', 'r'].forEach((horiz) => {\n      if (horiz === 'r') {\n        adjustedLayering = adjustedLayering.map((inner) =>\n          Object.values(inner).reverse(),\n        );\n      }\n\n      const neighborFn = (\n        vert === 'u' ? g.getPredecessors : g.getSuccessors\n      ).bind(g);\n      const align = verticalAlignment(\n        g,\n        adjustedLayering,\n        conflicts,\n        neighborFn,\n      );\n      const xs = horizontalCompaction(\n        g,\n        adjustedLayering,\n        align.root,\n        align.align,\n        nodesep,\n        edgesep,\n        horiz === 'r',\n      );\n      if (horiz === 'r') {\n        Object.keys(xs).forEach((key) => {\n          xs[key] = -xs[key];\n        });\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  const smallestWidth = findSmallestWidthAlignment(g, xss);\n  alignCoordinates(xss, smallestWidth);\n  return balance(xss, graphAlign);\n};\n\nexport const sep = (nodeSep: number, edgeSep: number, reverseSep: boolean) => {\n  return (g: IGraph, v: ID, w: ID) => {\n    const vLabel = g.getNode(v)!;\n    const wLabel = g.getNode(w)!;\n    let sum = 0;\n    let delta: number = 0;\n\n    sum += vLabel.data.width! / 2;\n    if (vLabel.data.hasOwnProperty('labelpos')) {\n      switch (((vLabel.data.labelpos as string) || '').toLowerCase()) {\n        case 'l':\n          delta = -vLabel.data.width! / 2;\n          break;\n        case 'r':\n          delta = vLabel.data.width! / 2;\n          break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    sum += (vLabel.data.dummy ? edgeSep : nodeSep) / 2;\n    sum += (wLabel.data.dummy ? edgeSep : nodeSep) / 2;\n\n    sum += wLabel.data.width! / 2;\n    if (wLabel.data.labelpos) {\n      switch (((wLabel.data.labelpos as string) || '').toLowerCase()) {\n        case 'l':\n          delta = wLabel.data.width! / 2;\n          break;\n        case 'r':\n          delta = -wLabel.data.width! / 2;\n          break;\n      }\n    }\n    if (delta) {\n      sum += reverseSep ? delta : -delta;\n    }\n    delta = 0;\n\n    return sum;\n  };\n};\n\nexport const width = (g: IGraph, v: ID) => g.getNode(v)!.data.width! || 0;\n","import { ID } from '@antv/graphlib';\nimport type { Graph as IGraph } from '../../types';\nimport type { DagreAlign } from '../types';\nimport { asNonCompoundGraph, buildLayerMatrix } from '../util';\nimport {\n  alignCoordinates,\n  balance,\n  findSmallestWidthAlignment,\n  findType1Conflicts,\n  findType2Conflicts,\n  horizontalCompaction,\n  verticalAlignment,\n} from './bk';\n\nconst positionY = (\n  g: IGraph,\n  options?: Partial<{\n    ranksep: number;\n  }>,\n) => {\n  const { ranksep = 0 } = options || {};\n  const layering = buildLayerMatrix(g);\n\n  let prevY = 0;\n  layering?.forEach((layer) => {\n    const heights = layer.map((v) => g.getNode(v).data.height!);\n    const maxHeight = Math.max(...heights, 0);\n    layer?.forEach((v: string) => {\n      g.getNode(v).data.y = prevY + maxHeight / 2;\n    });\n    prevY += maxHeight + ranksep;\n  });\n};\n\nconst positionX = (\n  g: IGraph,\n  options?: Partial<{\n    align: DagreAlign;\n    nodesep: number;\n    edgesep: number;\n  }>,\n): Record<ID, number> => {\n  const { align: graphAlign, nodesep = 0, edgesep = 0 } = options || {};\n\n  const layering = buildLayerMatrix(g);\n  const conflicts = Object.assign(\n    findType1Conflicts(g, layering),\n    findType2Conflicts(g, layering),\n  );\n\n  const xss: Record<string, Record<string, number>> = {};\n  let adjustedLayering: ID[][] = [];\n  ['u', 'd'].forEach((vert) => {\n    adjustedLayering =\n      vert === 'u' ? layering : Object.values(layering).reverse();\n    ['l', 'r'].forEach((horiz) => {\n      if (horiz === 'r') {\n        adjustedLayering = adjustedLayering.map((inner) =>\n          Object.values(inner).reverse(),\n        );\n      }\n\n      const neighborFn = (\n        vert === 'u' ? g.getPredecessors : g.getSuccessors\n      ).bind(g);\n      const align = verticalAlignment(\n        g,\n        adjustedLayering,\n        conflicts,\n        neighborFn,\n      );\n      const xs = horizontalCompaction(\n        g,\n        adjustedLayering,\n        align.root,\n        align.align,\n        nodesep,\n        edgesep,\n        horiz === 'r',\n      );\n      if (horiz === 'r') {\n        Object.keys(xs).forEach((xsKey) => (xs[xsKey] = -xs[xsKey]));\n      }\n      xss[vert + horiz] = xs;\n    });\n  });\n\n  const smallestWidth = findSmallestWidthAlignment(g, xss);\n  smallestWidth && alignCoordinates(xss, smallestWidth);\n  return balance(xss, graphAlign);\n};\n\nexport const position = (\n  g: IGraph,\n  options?: Partial<{\n    align: DagreAlign;\n    nodesep: number;\n    edgesep: number;\n    ranksep: number;\n  }>,\n) => {\n  const ng = asNonCompoundGraph(g);\n\n  positionY(ng, options);\n  const xs = positionX(ng, options);\n  Object.keys(xs)?.forEach((key: ID) => {\n    ng.getNode(key).data.x = xs[key];\n  });\n};\n","import { Edge, ID } from '@antv/graphlib';\nimport { EdgeData, Graph } from '../../types';\n\n/*\n * Initializes ranks for the input graph using the longest path algorithm. This\n * algorithm scales well and is fast in practice, it yields rather poor\n * solutions. Nodes are pushed to the lowest layer possible, leaving the bottom\n * ranks wide and leaving edges longer than necessary. However, due to its\n * speed, this algorithm is good for getting an initial ranking that can be fed\n * into other algorithms.\n *\n * This algorithm does not normalize layers because it will be used by other\n * algorithms in most cases. If using this algorithm directly, be sure to\n * run normalize at the end.\n *\n * Pre-conditions:\n *\n *    1. Input graph is a DAG.\n *    2. Input graph node labels can be assigned properties.\n *\n * Post-conditions:\n *\n *    1. Each node will be assign an (unnormalized) \"rank\" property.\n */\nconst longestPath = (g: Graph) => {\n  const visited: Record<ID, boolean> = {};\n\n  const dfs = (v: ID) => {\n    const label = g.getNode(v)!;\n    if (!label) return 0;\n    if (visited[v]) {\n      return label.data.rank!;\n    }\n    visited[v] = true;\n\n    let rank: number;\n\n    g.getRelatedEdges(v, 'out')?.forEach((e) => {\n      const wRank = dfs(e.target);\n      const minLen = e.data.minlen!;\n      const r = wRank - minLen;\n      if (r) {\n        if (rank === undefined || r < rank) {\n          rank = r;\n        }\n      }\n    });\n\n    if (!rank!) {\n      rank = 0;\n    }\n\n    label.data.rank = rank;\n    return rank;\n  };\n\n  g.getAllNodes()\n    .filter((n) => g.getRelatedEdges(n.id, 'in').length === 0)\n    .forEach((source) => dfs(source.id));\n};\n\nconst longestPathWithLayer = (g: Graph) => {\n  // 用longest path，找出最深的点\n  const visited: Record<ID, boolean> = {};\n  let minRank: number;\n\n  const dfs = (v: ID) => {\n    const label = g.getNode(v)!;\n    if (!label) return 0;\n    if (visited[v]) {\n      return label.data.rank!;\n    }\n    visited[v] = true;\n\n    let rank: number;\n\n    g.getRelatedEdges(v, 'out')?.forEach((e) => {\n      const wRank = dfs(e.target);\n      const minLen = e.data.minlen!;\n      const r = wRank - minLen;\n      if (r) {\n        if (rank === undefined || r < rank) {\n          rank = r;\n        }\n      }\n    });\n\n    if (!rank!) {\n      rank = 0;\n    }\n\n    if (minRank === undefined || rank < minRank) {\n      minRank = rank;\n    }\n\n    label.data.rank = rank;\n    return rank;\n  };\n\n  g.getAllNodes()\n    .filter((n) => g.getRelatedEdges(n.id, 'in').length === 0)\n    .forEach((source) => {\n      if (source) dfs(source.id);\n    });\n\n  if (minRank! === undefined) {\n    minRank = 0;\n  }\n\n  // minRank += 1; // NOTE: 最小的层级是dummy root，+1\n\n  // forward一遍，赋值层级\n  const forwardVisited: Record<string, boolean> = {};\n  const dfsForward = (v: ID, nextRank: number) => {\n    const label = g.getNode(v)!;\n\n    const currRank = !isNaN(label.data.layer!) ? label.data.layer! : nextRank;\n\n    // 没有指定，取最大值\n    if (label.data.rank === undefined || label.data.rank! < currRank) {\n      label.data.rank = currRank;\n    }\n\n    if (forwardVisited[v]) return;\n    forwardVisited[v] = true;\n\n    // DFS遍历子节点\n    g.getRelatedEdges(v, 'out')?.forEach((e) => {\n      dfsForward(e.target, currRank + e.data.minlen!);\n    });\n  };\n\n  // 指定层级的，更新下游\n  g.getAllNodes().forEach((n) => {\n    const label = n.data;\n    if (!label) return;\n    if (!isNaN(label.layer!)) {\n      dfsForward(n.id, label.layer!); // 默认的dummy root所在层的rank是-1\n    } else {\n      label.rank! -= minRank;\n    }\n  });\n};\n\n/*\n * Returns the amount of slack for the given edge. The slack is defined as the\n * difference between the length of the edge and its minimum length.\n */\nconst slack = (g: Graph, e: Edge<EdgeData>) => {\n  return (\n    g.getNode(e.target).data.rank! -\n    g.getNode(e.source).data.rank! -\n    e.data.minlen!\n  );\n};\n\nexport { longestPath, longestPathWithLayer, slack };\n","import { Edge, Graph, ID } from '@antv/graphlib';\nimport { EdgeData, Graph as IGraph } from '../../types';\nimport { minBy } from '../util';\nimport { slack } from './util';\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nconst feasibleTree = (g: IGraph) => {\n  const t = new Graph({\n    tree: [],\n  });\n\n  // Choose arbitrary node from which to start our tree\n  const start = g.getAllNodes()[0];\n  const size = g.getAllNodes().length;\n  t.addNode(start);\n\n  let edge: Edge<EdgeData>;\n  let delta: number;\n  while (tightTree(t, g) < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n};\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nconst tightTree = (t: IGraph, g: IGraph) => {\n  const dfs = (v: ID) => {\n    g.getRelatedEdges(v, 'both').forEach((e) => {\n      const edgeV = e.source;\n      const w = v === edgeV ? e.target : edgeV;\n      if (!t.hasNode(w) && !slack(g, e)) {\n        t.addNode({\n          id: w,\n          data: {},\n        });\n        t.addEdge({\n          id: e.id,\n          source: v,\n          target: w,\n          data: {},\n        });\n        dfs(w);\n      }\n    });\n  };\n\n  t.getAllNodes().forEach((n) => dfs(n.id));\n  return t.getAllNodes().length;\n};\n\n/*\n * Constructs a spanning tree with tight edges and adjusted the input node's\n * ranks to achieve this. A tight edge is one that is has a length that matches\n * its \"minlen\" attribute.\n *\n * The basic structure for this function is derived from Gansner, et al., \"A\n * Technique for Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a DAG.\n *    2. Graph must be connected.\n *    3. Graph must have at least one node.\n *    5. Graph nodes must have been previously assigned a \"rank\" property that\n *       respects the \"minlen\" property of incident edges.\n *    6. Graph edges must have a \"minlen\" property.\n *\n * Post-conditions:\n *\n *    - Graph nodes will have their rank adjusted to ensure that all edges are\n *      tight.\n *\n * Returns a tree (undirected graph) that is constructed using only \"tight\"\n * edges.\n */\nconst feasibleTreeWithLayer = (g: IGraph) => {\n  const t = new Graph({ tree: [] });\n\n  // Choose arbitrary node from which to start our tree\n  const start = g.getAllNodes()[0];\n  const size = g.getAllNodes().length;\n  t.addNode(start);\n\n  let edge: Edge<EdgeData>;\n  let delta: number;\n  while (tightTreeWithLayer(t, g)! < size) {\n    edge = findMinSlackEdge(t, g);\n    delta = t.hasNode(edge.source) ? slack(g, edge) : -slack(g, edge);\n    shiftRanks(t, g, delta);\n  }\n\n  return t;\n};\n\n/*\n * Finds a maximal tree of tight edges and returns the number of nodes in the\n * tree.\n */\nconst tightTreeWithLayer = (t: IGraph, g: IGraph) => {\n  const dfs = (v: ID) => {\n    g.getRelatedEdges(v, 'both')?.forEach((e) => {\n      const edgeV = e.source;\n      const w = v === edgeV ? e.target : edgeV;\n      // 对于指定layer的，直接加入tight-tree，不参与调整\n      if (\n        !t.hasNode(w) &&\n        (g.getNode(w)!.data.layer !== undefined || !slack(g, e))\n      ) {\n        t.addNode({\n          id: w,\n          data: {},\n        });\n        t.addEdge({\n          id: e.id,\n          source: v,\n          target: w,\n          data: {},\n        });\n        dfs(w);\n      }\n    });\n  };\n\n  t.getAllNodes().forEach((n) => dfs(n.id));\n  return t.getAllNodes().length;\n};\n\n/*\n * Finds the edge with the smallest slack that is incident on tree and returns\n * it.\n */\nconst findMinSlackEdge = (t: IGraph, g: IGraph) => {\n  return minBy(g.getAllEdges(), (e) => {\n    if (t.hasNode(e.source) !== t.hasNode(e.target)) {\n      return slack(g, e);\n    }\n    return Infinity;\n  });\n};\n\nconst shiftRanks = (t: IGraph, g: IGraph, delta: number) => {\n  t.getAllNodes().forEach((tn) => {\n    const v = g.getNode(tn.id);\n    if (!v.data.rank) v.data.rank = 0;\n    v.data.rank! += delta;\n  });\n};\n\nexport { feasibleTree, feasibleTreeWithLayer };\n","import { Edge, ID, Node } from '@antv/graphlib';\nimport { EdgeData, Graph as IGraph, NodeData } from '../../types';\nimport { dfs, minBy, simplify } from '../util';\nimport { feasibleTree } from './feasible-tree';\nimport { longestPath as initRank, slack } from './util';\n\n/*\n * The network simplex algorithm assigns ranks to each node in the input graph\n * and iteratively improves the ranking to reduce the length of edges.\n *\n * Preconditions:\n *\n *    1. The input graph must be a DAG.\n *    2. All nodes in the graph must have an object value.\n *    3. All edges in the graph must have \"minlen\" and \"weight\" attributes.\n *\n * Postconditions:\n *\n *    1. All nodes in the graph will have an assigned \"rank\" attribute that has\n *       been optimized by the network simplex algorithm. Ranks start at 0.\n *\n *\n * A rough sketch of the algorithm is as follows:\n *\n *    1. Assign initial ranks to each node. We use the longest path algorithm,\n *       which assigns ranks to the lowest position possible. In general this\n *       leads to very wide bottom ranks and unnecessarily long edges.\n *    2. Construct a feasible tight tree. A tight tree is one such that all\n *       edges in the tree have no slack (difference between length of edge\n *       and minlen for the edge). This by itself greatly improves the assigned\n *       rankings by shorting edges.\n *    3. Iteratively find edges that have negative cut values. Generally a\n *       negative cut value indicates that the edge could be removed and a new\n *       tree edge could be added to produce a more compact graph.\n *\n * Much of the algorithms here are derived from Gansner, et al., \"A Technique\n * for Drawing Directed Graphs.\" The structure of the file roughly follows the\n * structure of the overall algorithm.\n */\nexport const networkSimplex = (og: IGraph) => {\n  const g = simplify(og);\n  initRank(g);\n  const t = feasibleTree(g);\n  initLowLimValues(t);\n  initCutValues(t, g);\n\n  let e: Edge<EdgeData> | undefined;\n  let f: Edge<EdgeData>;\n  while ((e = leaveEdge(t))) {\n    f = enterEdge(t, g, e);\n    exchangeEdges(t, g, e, f);\n  }\n};\n\n/*\n * Initializes cut values for all edges in the tree.\n */\nexport const initCutValues = (t: IGraph, g: IGraph) => {\n  let vs = dfs(t, t.getAllNodes(), 'post', false);\n  vs = vs.slice(0, vs?.length - 1);\n  vs.forEach((v: ID) => {\n    assignCutValue(t, g, v);\n  });\n};\n\nconst assignCutValue = (t: IGraph, g: IGraph, child: ID) => {\n  const childLab = t.getNode(child)!;\n  const parent = childLab.data.parent! as ID;\n\n  // FIXME: use undirected edge?\n  const edge = t\n    .getRelatedEdges(child, 'both')\n    .find((e) => e.target === parent || e.source === parent)!;\n  edge.data.cutvalue = calcCutValue(t, g, child);\n};\n\n/*\n * Given the tight tree, its graph, and a child in the graph calculate and\n * return the cut value for the edge between the child and its parent.\n */\nexport const calcCutValue = (t: IGraph, g: IGraph, child: ID) => {\n  const childLab = t.getNode(child)!;\n  const parent = childLab.data.parent as ID;\n  // True if the child is on the tail end of the edge in the directed graph\n  let childIsTail = true;\n  // The graph's view of the tree edge we're inspecting\n\n  let graphEdge = g\n    .getRelatedEdges(child, 'out')\n    .find((e) => e.target === parent)!;\n  // The accumulated cut value for the edge between this node and its parent\n  let cutValue = 0;\n\n  if (!graphEdge) {\n    childIsTail = false;\n    graphEdge = g\n      .getRelatedEdges(parent, 'out')\n      .find((e) => e.target === child)!;\n  }\n\n  cutValue = graphEdge.data.weight!;\n\n  g.getRelatedEdges(child, 'both').forEach((e) => {\n    const isOutEdge = e.source === child;\n    const other = isOutEdge ? e.target : e.source;\n\n    if (other !== parent) {\n      const pointsToHead = isOutEdge === childIsTail;\n      const otherWeight = e.data.weight!;\n\n      cutValue += pointsToHead ? otherWeight : -otherWeight;\n      if (isTreeEdge(t, child, other)) {\n        // FIXME: use undirected edge?\n        const otherCutValue = t\n          .getRelatedEdges(child, 'both')\n          .find((e) => e.source === other || e.target === other)!.data\n          .cutvalue!;\n        cutValue += pointsToHead ? -otherCutValue : otherCutValue;\n      }\n    }\n  });\n\n  return cutValue;\n};\n\nexport const initLowLimValues = (\n  tree: IGraph,\n  root: ID = tree.getAllNodes()[0].id,\n) => {\n  dfsAssignLowLim(tree, {}, 1, root);\n};\n\nconst dfsAssignLowLim = (\n  tree: IGraph,\n  visited: Record<ID, boolean>,\n  nextLim: number,\n  v: ID,\n  parent?: ID,\n) => {\n  const low = nextLim;\n  let useNextLim = nextLim;\n  const label = tree.getNode(v)!;\n\n  visited[v] = true;\n  tree.getNeighbors(v)?.forEach((w) => {\n    if (!visited[w.id]) {\n      useNextLim = dfsAssignLowLim(tree, visited, useNextLim, w.id, v);\n    }\n  });\n\n  label.data.low = low;\n  label.data.lim = useNextLim++;\n  if (parent) {\n    label.data.parent = parent;\n  } else {\n    // TODO should be able to remove this when we incrementally update low lim\n    delete label.data.parent;\n  }\n\n  return useNextLim;\n};\n\nexport const leaveEdge = (tree: IGraph) => {\n  return tree.getAllEdges().find((e) => {\n    return e.data.cutvalue! < 0;\n  });\n};\n\nexport const enterEdge = (t: IGraph, g: IGraph, edge: Edge<EdgeData>) => {\n  let v = edge.source;\n  let w = edge.target;\n\n  // For the rest of this function we assume that v is the tail and w is the\n  // head, so if we don't have this edge in the graph we should flip it to\n  // match the correct orientation.\n  if (!g.getRelatedEdges(v, 'out').find((e) => e.target === w)) {\n    v = edge.target;\n    w = edge.source;\n  }\n\n  const vLabel = t.getNode(v)!;\n  const wLabel = t.getNode(w)!;\n  let tailLabel = vLabel;\n  let flip = false;\n\n  // If the root is in the tail of the edge then we need to flip the logic that\n  // checks for the head and tail nodes in the candidates function below.\n  if (vLabel.data.lim! > wLabel.data.lim!) {\n    tailLabel = wLabel;\n    flip = true;\n  }\n\n  const candidates = g.getAllEdges().filter((edge) => {\n    return (\n      flip === isDescendant(t.getNode(edge.source), tailLabel) &&\n      flip !== isDescendant(t.getNode(edge.target), tailLabel)\n    );\n  });\n\n  return minBy(candidates, (edge) => {\n    return slack(g, edge);\n  });\n};\n\n/**\n *\n * @param t\n * @param g\n * @param e edge to remove\n * @param f edge to add\n */\nexport const exchangeEdges = (\n  t: IGraph,\n  g: IGraph,\n  e: Edge<EdgeData>,\n  f: Edge<EdgeData>,\n) => {\n  // FIXME: use undirected edge?\n  const existed = t\n    .getRelatedEdges(e.source, 'both')\n    .find((edge) => edge.source === e.target || edge.target === e.target);\n  if (existed) {\n    t.removeEdge(existed.id);\n  }\n\n  t.addEdge({\n    id: `e${Math.random()}`,\n    source: f.source,\n    target: f.target,\n    data: {},\n  });\n\n  initLowLimValues(t);\n  initCutValues(t, g);\n  updateRanks(t, g);\n};\n\nconst updateRanks = (t: IGraph, g: IGraph) => {\n  const root = t.getAllNodes().find((v) => {\n    return !v.data.parent;\n  })!;\n\n  let vs = dfs(t, root, 'pre', false);\n  vs = vs.slice(1);\n  vs.forEach((v: ID) => {\n    const parent = t.getNode(v).data.parent as ID;\n    let edge = g.getRelatedEdges(v, 'out').find((e) => e.target === parent);\n    // let edge = g.edgeFromArgs(v, parent);\n    let flipped = false;\n\n    if (!edge && g.hasNode(parent)) {\n      // edge = g.edgeFromArgs(parent, v)!;\n      edge = g.getRelatedEdges(parent, 'out').find((e) => e.target === v);\n      flipped = true;\n    }\n\n    g.getNode(v).data.rank =\n      ((g.hasNode(parent) && g.getNode(parent).data.rank!) || 0) +\n      (flipped ? edge?.data.minlen! : -edge?.data.minlen!);\n  });\n};\n\n/*\n * Returns true if the edge is in the tree.\n */\nconst isTreeEdge = (tree: IGraph, u: ID, v: ID) => {\n  // FIXME: use undirected edge?\n  return tree\n    .getRelatedEdges(u, 'both')\n    .find((e) => e.source === v || e.target === v);\n};\n\n/*\n * Returns true if the specified node is descendant of the root node per the\n * assigned low and lim attributes in the tree.\n */\nconst isDescendant = (vLabel: Node<NodeData>, rootLabel: Node<NodeData>) => {\n  return (\n    rootLabel.data.low! <= vLabel.data.lim! &&\n    vLabel.data.lim! <= rootLabel.data.lim!\n  );\n};\n","import { Graph as IGraph } from '../../types';\nimport { feasibleTreeWithLayer as feasibleTree } from './feasible-tree';\nimport { networkSimplex } from './network-simplex';\nimport { longestPath, longestPathWithLayer } from './util';\n\n/*\n * Assigns a rank to each node in the input graph that respects the \"minlen\"\n * constraint specified on edges between nodes.\n *\n * This basic structure is derived from Gansner, et al., \"A Technique for\n * Drawing Directed Graphs.\"\n *\n * Pre-conditions:\n *\n *    1. Graph must be a connected DAG\n *    2. Graph nodes must be objects\n *    3. Graph edges must have \"weight\" and \"minlen\" attributes\n *\n * Post-conditions:\n *\n *    1. Graph nodes will have a \"rank\" attribute based on the results of the\n *       algorithm. Ranks can start at any index (including negative), we'll\n *       fix them up later.\n */\nexport const rank = (\n  g: IGraph,\n  ranker: 'network-simplex' | 'tight-tree' | 'longest-path',\n) => {\n  switch (ranker) {\n    case 'network-simplex':\n      networkSimplexRanker(g);\n      break;\n    case 'tight-tree':\n      tightTreeRanker(g);\n      break;\n    case 'longest-path':\n      longestPathRanker(g);\n      break;\n    // default: networkSimplexRanker(g);\n    default:\n      tightTreeRanker(g);\n  }\n};\n\n// A fast and simple ranker, but results are far from optimal.\nconst longestPathRanker = longestPath;\n\nconst tightTreeRanker = (g: IGraph) => {\n  longestPathWithLayer(g);\n  feasibleTree(g);\n};\n\nconst networkSimplexRanker = (g: IGraph) => {\n  networkSimplex(g);\n};\n","import { Edge as IEdge, Graph, ID } from '@antv/graphlib';\nimport { isNil } from '@antv/util';\nimport { EdgeData, Graph as IGraph, NodeData, Point } from '../types';\nimport { run as runAcyclic, undo as undoAcyclic } from './acyclic';\nimport { addBorderSegments } from './add-border-segments';\nimport {\n  adjust as adjustCoordinateSystem,\n  undo as undoCoordinateSystem,\n} from './coordinate-system';\nimport {\n  cleanup as cleanupNestingGraph,\n  run as runNestingGraph,\n} from './nesting-graph';\nimport { run as runNormalize, undo as undoNormalize } from './normalize';\nimport { order } from './order';\nimport { initDataOrder } from './order/init-data-order';\nimport { parentDummyChains } from './parent-dummy-chains';\nimport { position } from './position';\nimport { rank } from './rank';\nimport type { DagreAlign, DagreRankdir } from './types';\nimport {\n  addDummyNode,\n  asNonCompoundGraph,\n  buildLayerMatrix,\n  intersectRect,\n  normalizeRanks,\n  removeEmptyRanks,\n} from './util';\n\n// const graphNumAttrs = [\"nodesep\", \"edgesep\", \"ranksep\", \"marginx\", \"marginy\"];\n// const graphDefaults = { ranksep: 50, edgesep: 20, nodesep: 50, rankdir: \"tb\" };\n// const graphAttrs = [\"acyclicer\", \"ranker\", \"rankdir\", \"align\"];\n\nexport const layout = (\n  g: IGraph,\n  options: {\n    keepNodeOrder: boolean;\n    prevGraph: IGraph | null;\n    edgeLabelSpace?: boolean;\n    align?: DagreAlign;\n    nodesep?: number;\n    edgesep?: number;\n    ranksep?: number;\n    acyclicer: string;\n    nodeOrder: ID[];\n    ranker: 'network-simplex' | 'tight-tree' | 'longest-path';\n    rankdir: DagreRankdir;\n  },\n) => {\n  const { edgeLabelSpace, keepNodeOrder, prevGraph, rankdir, ranksep } =\n    options;\n\n  // 如果在原图基础上修改，继承原图的order结果\n  if (!keepNodeOrder && prevGraph) {\n    inheritOrder(g, prevGraph);\n  }\n  const layoutGraph = buildLayoutGraph(g);\n\n  // 控制是否为边的label留位置（这会影响是否在边中间添加dummy node）\n  if (!!edgeLabelSpace) {\n    options.ranksep = makeSpaceForEdgeLabels(layoutGraph, {\n      rankdir,\n      ranksep,\n    });\n  }\n  let dimension;\n  // TODO: 暂时处理层级设置不正确时的异常报错，提示设置正确的层级\n  try {\n    dimension = runLayout(layoutGraph, options);\n  } catch (e) {\n    if (\n      e.message === 'Not possible to find intersection inside of the rectangle'\n    ) {\n      console.error(\n        \"The following error may be caused by improper layer setting, please make sure your manual layer setting does not violate the graph's structure:\\n\",\n        e,\n      );\n      return;\n    }\n    throw e;\n  }\n  updateInputGraph(g, layoutGraph);\n  return dimension;\n};\n\nconst runLayout = (\n  g: IGraph,\n  options: {\n    acyclicer: string;\n    keepNodeOrder: boolean;\n    nodeOrder: ID[];\n    ranker: 'network-simplex' | 'tight-tree' | 'longest-path';\n    rankdir: DagreRankdir;\n    align?: DagreAlign;\n    nodesep?: number;\n    edgesep?: number;\n    ranksep?: number;\n  },\n) => {\n  const {\n    acyclicer,\n    ranker,\n    rankdir = 'tb',\n    nodeOrder,\n    keepNodeOrder,\n    align,\n    nodesep = 50,\n    edgesep = 20,\n    ranksep = 50,\n  } = options;\n\n  removeSelfEdges(g);\n\n  runAcyclic(g, acyclicer);\n\n  const { nestingRoot, nodeRankFactor } = runNestingGraph(g);\n\n  rank(asNonCompoundGraph(g), ranker);\n\n  injectEdgeLabelProxies(g);\n\n  removeEmptyRanks(g, nodeRankFactor);\n\n  cleanupNestingGraph(g, nestingRoot);\n\n  normalizeRanks(g);\n\n  assignRankMinMax(g);\n\n  removeEdgeLabelProxies(g);\n\n  const dummyChains: ID[] = [];\n  runNormalize(g, dummyChains);\n  parentDummyChains(g, dummyChains);\n\n  addBorderSegments(g);\n\n  if (keepNodeOrder) {\n    initDataOrder(g, nodeOrder);\n  }\n\n  order(g, keepNodeOrder);\n\n  insertSelfEdges(g);\n\n  adjustCoordinateSystem(g, rankdir);\n\n  position(g, {\n    align,\n    nodesep,\n    edgesep,\n    ranksep,\n  });\n\n  positionSelfEdges(g);\n\n  removeBorderNodes(g);\n\n  undoNormalize(g, dummyChains);\n\n  fixupEdgeLabelCoords(g);\n\n  undoCoordinateSystem(g, rankdir);\n\n  const { width, height } = translateGraph(g);\n\n  assignNodeIntersects(g);\n\n  reversePointsForReversedEdges(g);\n\n  undoAcyclic(g);\n\n  return { width, height };\n};\n\n/**\n * 继承上一个布局中的order，防止翻转\n * TODO: 暂时没有考虑涉及层级变动的布局，只保证原来布局层级和相对顺序不变\n */\nconst inheritOrder = (currG: IGraph, prevG: IGraph) => {\n  currG.getAllNodes().forEach((n) => {\n    const node = currG.getNode(n.id)!;\n    if (prevG.hasNode(n.id)) {\n      const prevNode = prevG.getNode(n.id)!;\n      node.data.fixorder = prevNode.data._order as number;\n      delete prevNode.data._order;\n    } else {\n      delete node.data.fixorder;\n    }\n  });\n};\n\n/*\n * Copies final layout information from the layout graph back to the input\n * graph. This process only copies whitelisted attributes from the layout graph\n * to the input graph, so it serves as a good place to determine what\n * attributes can influence layout.\n */\nconst updateInputGraph = (inputGraph: IGraph, layoutGraph: IGraph) => {\n  inputGraph.getAllNodes().forEach((v) => {\n    const inputLabel = inputGraph.getNode(v.id);\n\n    if (inputLabel) {\n      const layoutLabel = layoutGraph.getNode(v.id)!;\n      inputLabel.data.x = layoutLabel.data.x;\n      inputLabel.data.y = layoutLabel.data.y;\n      inputLabel.data._order = layoutLabel.data.order;\n      inputLabel.data._rank = layoutLabel.data.rank;\n\n      if (layoutGraph.getChildren(v.id)?.length) {\n        inputLabel.data.width = layoutLabel.data.width;\n        inputLabel.data.height = layoutLabel.data.height;\n      }\n    }\n  });\n\n  inputGraph.getAllEdges().forEach((e) => {\n    const inputLabel = inputGraph.getEdge(e.id)!;\n    const layoutLabel = layoutGraph.getEdge(e.id)!;\n\n    inputLabel.data.points = layoutLabel ? layoutLabel.data.points : [];\n    if (layoutLabel && layoutLabel.data.hasOwnProperty('x')) {\n      inputLabel.data.x = layoutLabel.data.x;\n      inputLabel.data.y = layoutLabel.data.y;\n    }\n  });\n\n  // inputGraph.graph().width = layoutGraph.graph().width;\n  // inputGraph.graph().height = layoutGraph.graph().height;\n};\n\nconst nodeNumAttrs = ['width', 'height', 'layer', 'fixorder']; // 需要传入layer, fixOrder作为参数参考\nconst nodeDefaults = { width: 0, height: 0 };\nconst edgeNumAttrs = ['minlen', 'weight', 'width', 'height', 'labeloffset'];\nconst edgeDefaults = {\n  minlen: 1,\n  weight: 1,\n  width: 0,\n  height: 0,\n  labeloffset: 10,\n  labelpos: 'r',\n};\nconst edgeAttrs = ['labelpos'];\n\n/*\n * Constructs a new graph from the input graph, which can be used for layout.\n * This process copies only whitelisted attributes from the input graph to the\n * layout graph. Thus this function serves as a good place to determine what\n * attributes can influence layout.\n */\nconst buildLayoutGraph = (inputGraph: IGraph) => {\n  const g = new Graph({ tree: [] });\n  inputGraph.getAllNodes().forEach((v) => {\n    const node = canonicalize(inputGraph.getNode(v.id).data);\n    const defaultNode = {\n      ...nodeDefaults,\n      ...node,\n    } as NodeData;\n    const defaultAttrs = selectNumberAttrs(defaultNode, nodeNumAttrs) as Node;\n\n    if (!g.hasNode(v.id)) {\n      g.addNode({\n        id: v.id,\n        data: {\n          ...defaultAttrs,\n        },\n      });\n    }\n\n    const parent = inputGraph.hasTreeStructure('combo')\n      ? inputGraph.getParent(v.id, 'combo')\n      : inputGraph.getParent(v.id);\n    if (!isNil(parent)) {\n      if (!g.hasNode(parent.id)) {\n        g.addNode({ ...parent });\n      }\n      g.setParent(v.id, parent.id);\n    }\n  });\n\n  inputGraph.getAllEdges().forEach((e) => {\n    const edge = canonicalize(inputGraph.getEdge(e.id).data);\n\n    const pickedProperties: any = {};\n    edgeAttrs?.forEach((key) => {\n      if (edge[key] !== undefined) pickedProperties[key] = edge[key];\n    });\n\n    g.addEdge({\n      id: e.id,\n      source: e.source,\n      target: e.target,\n      data: Object.assign(\n        {},\n        edgeDefaults,\n        selectNumberAttrs(edge, edgeNumAttrs),\n        pickedProperties,\n      ),\n    });\n  });\n\n  return g;\n};\n\n/*\n * This idea comes from the Gansner paper: to account for edge labels in our\n * layout we split each rank in half by doubling minlen and halving ranksep.\n * Then we can place labels at these mid-points between nodes.\n *\n * We also add some minimal padding to the width to push the label for the edge\n * away from the edge itself a bit.\n */\nconst makeSpaceForEdgeLabels = (\n  g: IGraph,\n  options: {\n    ranksep?: number;\n    rankdir: string;\n  },\n) => {\n  const { ranksep = 0, rankdir } = options;\n  g.getAllNodes().forEach((node) => {\n    if (!isNaN(node.data.layer!)) {\n      if (!node.data.layer) node.data.layer = 0;\n    }\n  });\n  g.getAllEdges().forEach((edge) => {\n    edge.data.minlen! *= 2;\n    if ((edge.data.labelpos as string)?.toLowerCase() !== 'c') {\n      if (rankdir === 'TB' || rankdir === 'BT') {\n        edge.data.width! += edge.data.labeloffset!;\n      } else {\n        edge.data.height! += edge.data.labeloffset!;\n      }\n    }\n  });\n\n  return ranksep / 2;\n};\n\n/*\n * Creates temporary dummy nodes that capture the rank in which each edge's\n * label is going to, if it has one of non-zero width and height. We do this\n * so that we can safely remove empty ranks while preserving balance for the\n * label's position.\n */\nconst injectEdgeLabelProxies = (g: IGraph) => {\n  g.getAllEdges().forEach((e) => {\n    if (e.data.width && e.data.height) {\n      const v = g.getNode(e.source)!;\n      const w = g.getNode(e.target)!;\n      const label = {\n        e,\n        rank: (w.data.rank! - v.data.rank!) / 2 + v.data.rank!,\n      };\n      addDummyNode(g, 'edge-proxy', label, '_ep');\n    }\n  });\n};\n\nconst assignRankMinMax = (g: IGraph): number => {\n  let maxRank = 0;\n  g.getAllNodes().forEach((node) => {\n    if (node.data.borderTop) {\n      node.data.minRank = g.getNode(node.data.borderTop as ID)?.data.rank;\n      node.data.maxRank = g.getNode(node.data.borderBottom as ID)?.data.rank;\n      maxRank = Math.max(maxRank, node.data.maxRank || -Infinity);\n    }\n  });\n\n  return maxRank;\n};\n\nconst removeEdgeLabelProxies = (g: IGraph) => {\n  g.getAllNodes().forEach((node) => {\n    if (node.data.dummy === 'edge-proxy') {\n      g.getEdge(node.data.e!.id)!.data.labelRank = node.data.rank;\n      g.removeNode(node.id);\n    }\n  });\n};\n\nconst translateGraph = (\n  g: IGraph,\n  options?: {\n    marginx: number;\n    marginy: number;\n  },\n) => {\n  let minX: number;\n  let maxX = 0;\n  let minY: number;\n  let maxY = 0;\n\n  const { marginx: marginX = 0, marginy: marginY = 0 } = options || {};\n\n  const getExtremes = (attrs: any) => {\n    if (!attrs.data) return;\n    const x = attrs.data.x;\n    const y = attrs.data.y;\n    const w = attrs.data.width;\n    const h = attrs.data.height;\n    if (!isNaN(x) && !isNaN(w)) {\n      if (minX === undefined) {\n        minX = x - w / 2;\n      }\n      minX = Math.min(minX, x - w / 2);\n      maxX = Math.max(maxX, x + w / 2);\n    }\n    if (!isNaN(y) && !isNaN(h)) {\n      if (minY === undefined) {\n        minY = y - h / 2;\n      }\n      minY = Math.min(minY, y - h / 2);\n      maxY = Math.max(maxY, y + h / 2);\n    }\n  };\n\n  g.getAllNodes().forEach((v) => {\n    getExtremes(v);\n  });\n  g.getAllEdges().forEach((e) => {\n    if (e?.data.hasOwnProperty('x')) {\n      getExtremes(e);\n    }\n  });\n\n  minX! -= marginX;\n  minY! -= marginY;\n\n  g.getAllNodes().forEach((node) => {\n    node.data.x! -= minX;\n    node.data.y! -= minY;\n  });\n\n  g.getAllEdges().forEach((edge) => {\n    edge.data.points?.forEach((p: Point) => {\n      p.x -= minX;\n      p.y -= minY;\n    });\n    if (edge.data.hasOwnProperty('x')) {\n      edge.data.x! -= minX;\n    }\n    if (edge.data.hasOwnProperty('y')) {\n      edge.data.y! -= minY;\n    }\n  });\n\n  return {\n    width: maxX - minX! + marginX,\n    height: maxY - minY! + marginY,\n  };\n};\n\nconst assignNodeIntersects = (g: IGraph) => {\n  g.getAllEdges().forEach((e) => {\n    const nodeV = g.getNode(e.source)!;\n    const nodeW = g.getNode(e.target)!;\n    let p1: Point;\n    let p2: Point;\n    if (!e.data.points) {\n      e.data.points = [];\n      p1 = { x: nodeW.data.x!, y: nodeW.data.y! };\n      p2 = { x: nodeV.data.x!, y: nodeV.data.y! };\n    } else {\n      p1 = e.data.points[0];\n      p2 = e.data.points[e.data.points.length - 1];\n    }\n\n    e.data.points.unshift(intersectRect(nodeV.data, p1));\n    e.data.points.push(intersectRect(nodeW.data, p2));\n  });\n};\n\nconst fixupEdgeLabelCoords = (g: IGraph) => {\n  g.getAllEdges().forEach((edge) => {\n    if (edge.data.hasOwnProperty('x')) {\n      if (edge.data.labelpos === 'l' || edge.data.labelpos === 'r') {\n        edge.data.width! -= edge.data.labeloffset!;\n      }\n      switch (edge.data.labelpos) {\n        case 'l':\n          edge.data.x! -= edge.data.width! / 2 + edge.data.labeloffset!;\n          break;\n        case 'r':\n          edge.data.x! += edge.data.width! / 2 + edge.data.labeloffset!;\n          break;\n      }\n    }\n  });\n};\n\nconst reversePointsForReversedEdges = (g: IGraph) => {\n  g.getAllEdges().forEach((edge) => {\n    if (edge.data.reversed) {\n      edge.data.points?.reverse();\n    }\n  });\n};\n\nconst removeBorderNodes = (g: IGraph) => {\n  g.getAllNodes().forEach((v) => {\n    if (g.getChildren(v.id)?.length) {\n      const node = g.getNode(v.id)!;\n      const t = g.getNode(node.data.borderTop as ID);\n      const b = g.getNode(node.data.borderBottom as ID);\n      const l = g.getNode(\n        (node.data.borderLeft as ID[])[\n          (node.data.borderLeft as ID[])?.length - 1\n        ],\n      );\n      const r = g.getNode(\n        (node.data.borderRight as ID[])[\n          (node.data.borderRight as ID[])?.length - 1\n        ],\n      );\n\n      node.data.width = Math.abs(r?.data.x! - l?.data.x!) || 10;\n      node.data.height = Math.abs(b?.data.y! - t?.data.y!) || 10;\n      node.data.x = (l?.data.x! || 0) + node.data.width! / 2;\n      node.data.y = (t?.data.y! || 0) + node.data.height! / 2;\n    }\n  });\n\n  g.getAllNodes().forEach((n) => {\n    if (n.data.dummy === 'border') {\n      g.removeNode(n.id);\n    }\n  });\n};\n\nconst removeSelfEdges = (g: IGraph) => {\n  g.getAllEdges().forEach((e) => {\n    if (e.source === e.target) {\n      const node = g.getNode(e.source)!;\n      if (!node.data.selfEdges) {\n        node.data.selfEdges = [];\n      }\n      node.data.selfEdges.push(e);\n      g.removeEdge(e.id);\n    }\n  });\n};\n\nconst insertSelfEdges = (g: IGraph) => {\n  const layers = buildLayerMatrix(g);\n  layers?.forEach((layer: ID[]) => {\n    let orderShift = 0;\n    layer?.forEach((v: ID, i: number) => {\n      const node = g.getNode(v)!;\n      node.data.order = i + orderShift;\n      node.data.selfEdges?.forEach((selfEdge: IEdge<EdgeData>) => {\n        addDummyNode(\n          g,\n          'selfedge',\n          {\n            width: selfEdge.data.width,\n            height: selfEdge.data.height,\n            rank: node.data.rank,\n            order: i + ++orderShift,\n            e: selfEdge,\n          },\n          '_se',\n        );\n      });\n      delete node.data.selfEdges;\n    });\n  });\n};\n\nconst positionSelfEdges = (g: IGraph) => {\n  g.getAllNodes().forEach((v) => {\n    const node = g.getNode(v.id)!;\n    if (node.data.dummy === 'selfedge') {\n      const selfNode = g.getNode(node.data.e!.source)!;\n      const x = selfNode.data.x! + selfNode.data.width! / 2;\n      const y = selfNode.data.y!;\n      const dx = node.data.x! - x;\n      const dy = selfNode.data.height! / 2;\n\n      if (g.hasEdge(node.data.e!.id)) {\n        g.updateEdgeData(node.data.e!.id, node.data.e!.data);\n      } else {\n        g.addEdge({\n          id: node.data.e!.id,\n          source: node.data.e!.source,\n          target: node.data.e!.target,\n          data: node.data.e!.data,\n        });\n      }\n      g.removeNode(v.id);\n\n      node.data.e!.data.points = [\n        { x: x + (2 * dx) / 3, y: y - dy },\n        { x: x + (5 * dx) / 6, y: y - dy },\n        { y, x: x + dx },\n        { x: x + (5 * dx) / 6, y: y + dy },\n        { x: x + (2 * dx) / 3, y: y + dy },\n      ];\n\n      node.data.e!.data.x = node.data.x;\n      node.data.e!.data.y = node.data.y;\n    }\n  });\n};\n\nconst selectNumberAttrs = (obj: Record<string, any>, attrs: string[]) => {\n  const pickedProperties: Record<string, any> = {};\n  attrs?.forEach((key: string) => {\n    if (obj[key] === undefined) return;\n    pickedProperties[key] = +obj[key];\n  });\n  return pickedProperties;\n};\n\nconst canonicalize = (attrs: Record<string, any> = {}) => {\n  const newAttrs: Record<string, any> = {};\n  Object.keys(attrs).forEach((k: string) => {\n    newAttrs[k.toLowerCase()] = attrs[k];\n  });\n  return newAttrs;\n};\n","import { Edge, ID } from '@antv/graphlib';\nimport { EdgeData, Graph as IGraph } from '../types';\n\ntype OrderItem = { low: number; lim: number };\n\n// deep first search with both order low for pre, lim for post\nconst dfsBothOrder = (g: IGraph) => {\n  const result: Record<ID, OrderItem> = {};\n  let lim = 0;\n\n  const dfs = (v: ID) => {\n    const low = lim;\n    g.getChildren(v).forEach((n) => dfs(n.id));\n    result[v] = { low, lim: lim++ };\n  };\n  g.getRoots().forEach((n) => dfs(n.id));\n\n  return result;\n};\n\n// Find a path from v to w through the lowest common ancestor (LCA). Return the\n// full path and the LCA.\nconst findPath = (\n  g: IGraph,\n  postorderNums: Record<ID, OrderItem>,\n  v: ID,\n  w: ID,\n) => {\n  const vPath: ID[] = [];\n  const wPath: ID[] = [];\n  const low = Math.min(postorderNums[v].low, postorderNums[w].low);\n  const lim = Math.max(postorderNums[v].lim, postorderNums[w].lim);\n  let parent: ID | undefined;\n  let lca: ID | undefined;\n\n  // Traverse up from v to find the LCA\n  parent = v;\n  do {\n    parent = g.getParent(parent)?.id;\n    vPath.push(parent!);\n  } while (\n    parent &&\n    (postorderNums[parent].low > low || lim > postorderNums[parent].lim)\n  );\n  lca = parent;\n\n  // Traverse from w to LCA\n  parent = w;\n  while (parent && parent !== lca) {\n    wPath.push(parent);\n    parent = g.getParent(parent)?.id;\n  }\n\n  return { lca, path: vPath.concat(wPath.reverse()) };\n};\n\nexport const parentDummyChains = (g: IGraph, dummyChains: ID[]) => {\n  const postorderNums = dfsBothOrder(g);\n\n  dummyChains.forEach((startV) => {\n    let v = startV;\n    let node = g.getNode(v)!;\n    const originalEdge = node.data.originalEdge as Edge<EdgeData>;\n    if (!originalEdge) return;\n    const pathData = findPath(\n      g,\n      postorderNums,\n      originalEdge.source,\n      originalEdge.target,\n    );\n    const path = pathData.path;\n    const lca = pathData.lca;\n    let pathIdx = 0;\n    let pathV = path[pathIdx]!;\n    let ascending = true;\n\n    while (v !== originalEdge.target) {\n      node = g.getNode(v)!;\n\n      if (ascending) {\n        while (\n          pathV !== lca &&\n          g.getNode(pathV)?.data.maxRank! < node.data.rank!\n        ) {\n          pathIdx++;\n          pathV = path[pathIdx]!;\n        }\n\n        if (pathV === lca) {\n          ascending = false;\n        }\n      }\n\n      if (!ascending) {\n        while (\n          pathIdx < path.length - 1 &&\n          g.getNode(path[pathIdx + 1]!)?.data.minRank! <= node.data.rank!\n        ) {\n          pathIdx++;\n        }\n        pathV = path[pathIdx]!;\n      }\n\n      if (g.hasNode(pathV)) {\n        g.setParent(v, pathV);\n      }\n\n      v = g.getSuccessors(v)![0].id;\n    }\n  });\n};\n","import { ID } from '@antv/graphlib';\nimport { Graph } from '../../types';\n\n/**\n * 按照数据中的结果设置fixorder\n */\nexport const initDataOrder = (g: Graph, nodeOrder?: ID[]) => {\n  const simpleNodes = g.getAllNodes().filter((v) => {\n    return !g.getChildren(v.id)?.length;\n  });\n  const ranks = simpleNodes.map((v) => v.data.rank!);\n  const maxRank = Math.max(...ranks);\n  const layers: ID[][] = [];\n  for (let i = 0; i < maxRank + 1; i++) {\n    layers[i] = [];\n  }\n\n  nodeOrder?.forEach((n) => {\n    const node = g.getNode(n);\n    // 只考虑原有节点，dummy节点需要按照后续算法排出\n    if (!node || node.data.dummy) {\n      return;\n    }\n    if (!isNaN(node.data.rank!)) {\n      node.data.fixorder = layers[node.data.rank!].length; // 设置fixorder为当层的顺序\n      layers[node.data.rank!].push(n);\n    }\n  });\n};\n","/**\n * @see https://github.com/you-dont-need/You-Dont-Need-Lodash-Underscore#_isfunction\n */\nexport default (function (value) {\n    return typeof value === 'function';\n});\n//# sourceMappingURL=is-function.js.map","export default (function (value) {\n    /**\n     * isObject({}) => true\n     * isObject([1, 2, 3]) => true\n     * isObject(Function) => true\n     * isObject(null) => false\n     */\n    var type = typeof value;\n    return (value !== null && type === 'object') || type === 'function';\n});\n//# sourceMappingURL=is-object.js.map","import { isFunction, isNumber, isObject } from '@antv/util';\nimport { Node } from '../types';\n\n/**\n * Format value with multiple types into a function returns number.\n * @param defaultValue default value when value is invalid\n * @param value value to be formatted\n * @returns formatted result, a function returns number\n */\nexport function formatNumberFn<T = unknown>(\n  defaultValue: number,\n  value: number | ((d?: T) => number) | undefined,\n): (d?: T | undefined) => number {\n  let resultFunc;\n  if (isFunction(value)) {\n    resultFunc = value;\n  } else if (isNumber(value)) {\n    // value is number\n    resultFunc = () => value;\n  } else {\n    // value is not number and function\n    resultFunc = () => defaultValue;\n  }\n  return resultFunc;\n}\n\n/**\n * Format size config with multiple types into a function returns number\n * @param defaultValue default value when value is invalid\n * @param value value to be formatted\n * @param resultIsNumber whether returns number\n * @returns formatted result, a function returns number\n */\nexport function formatSizeFn<T extends Node>(\n  defaultValue: number,\n  value?:\n    | number\n    | number[]\n    | { width: number; height: number }\n    | ((d?: T) => number)\n    | undefined,\n  resultIsNumber: boolean = true,\n): (d: T) => number | number[] {\n  if (!value && value !== 0) {\n    return (d) => {\n      const { size } = d.data || {};\n      if (size) {\n        if (Array.isArray(size)) {\n          return size[0] > size[1] ? size[0] : size[1];\n        }\n        if (isObject<{ width: number; height: number }>(size)) {\n          return size.width > size.height ? size.width : size.height;\n        }\n        return 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 (Array.isArray(value)) {\n    return () => {\n      if (resultIsNumber) {\n        const max = Math.max(...value);\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\n/**\n * format the props nodeSize and nodeSpacing to a function\n * @param nodeSize\n * @param nodeSpacing\n * @returns\n */\nexport const formatNodeSize = (\n  nodeSize: number | number[] | ((nodeData: Node) => 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 (\n          Math.max(d.data.bboxSize[0], d.data.bboxSize[1]) + nodeSpacingFunc(d)\n        );\n      }\n      if (d.data?.size) {\n        if (Array.isArray(d.data.size)) {\n          return Math.max(d.data.size[0], d.data.size[1]) + nodeSpacingFunc(d);\n        }\n        const dataSize = d.data.size;\n        if (isObject<{ width: number; height: number }>(dataSize)) {\n          const res =\n            dataSize.width > dataSize.height ? dataSize.width : dataSize.height;\n          return res + nodeSpacingFunc(d);\n        }\n        return dataSize + nodeSpacingFunc(d);\n      }\n      return 10 + nodeSpacingFunc(d);\n    };\n  } else if (Array.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 if (isFunction(nodeSize)) {\n    nodeSizeFunc = nodeSize as (nodeData: Node) => number;\n  } else {\n    nodeSizeFunc = (d: Node) => nodeSize + nodeSpacingFunc(d);\n  }\n  return nodeSizeFunc;\n};\n","import { isNumber } from '@antv/util';\nimport { Edge, Node } from '../types';\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') {\n    const cp = {} as { [key: string]: any };\n    Object.keys(target).forEach((k) => {\n      cp[k] = clone<any>((target as any)[k]);\n    });\n    return cp as T;\n  }\n  return target;\n};\n\n/**\n * Clone node or edge data and format it\n * @param target node/edge to be cloned\n * @param initRange whether init the x and y in data with the range, which means [xRange, yRange]\n * @returns cloned node/edge\n */\nexport const cloneFormatData = <T extends Node | Edge>(\n  target: T,\n  initRange?: [number, number],\n): T => {\n  const cloned = clone(target);\n  cloned.data = cloned.data || {};\n  if (initRange) {\n    if (!isNumber(cloned.data.x)) cloned.data.x = Math.random() * initRange[0];\n    if (!isNumber(cloned.data.y)) cloned.data.y = Math.random() * initRange[1];\n  }\n  return cloned;\n};\n","import { Graph, ID } from '@antv/graphlib';\nimport { isNumber } from '@antv/util';\nimport { layout } from './antv-dagre/layout';\nimport type { DagreAlign, DagreRankdir } from './antv-dagre/types';\nimport type {\n  Edge,\n  EdgeData,\n  Graph as IGraph,\n  Layout,\n  LayoutMapping,\n  Node,\n  NodeData,\n  OutNode,\n  Point,\n  PointTuple,\n} from './types';\nimport { cloneFormatData, formatNodeSize, formatNumberFn } from './util';\n\nexport interface AntVDagreLayoutOptions {\n  rankdir?: DagreRankdir;\n  ranker?: 'network-simplex' | 'tight-tree' | 'longest-path';\n  align?: DagreAlign;\n  begin?: PointTuple;\n  nodeSize?: number | number[] | ((nodeData: Node) => number);\n  nodesep?: number;\n  ranksep?: number;\n  controlPoints?: boolean;\n  sortByCombo?: boolean;\n  edgeLabelSpace?: boolean;\n  nodeOrder?: string[];\n  radial?: boolean; // 是否基于 dagre 进行辐射布局\n  focusNode?: ID | Node | null; // radial 为 true 时生效，关注的节点\n  preset?: OutNode[];\n  nodesepFunc?: (d?: Node) => number;\n  ranksepFunc?: (d?: Node) => number;\n}\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<AntVDagreLayoutOptions> = {\n  rankdir: 'TB',\n  nodesep: 50, // 节点水平间距(px)\n  ranksep: 50, // 每一层节点之间间距\n  edgeLabelSpace: true,\n  ranker: 'tight-tree',\n  controlPoints: false, // 是否保留布局连线的控制点\n  radial: false, // 是否基于 dagre 进行辐射布局\n  focusNode: null, // radial 为 true 时生效，关注的节点\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 = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = await layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { radius: 20 });\n */\nexport class AntVDagreLayout implements Layout<AntVDagreLayoutOptions> {\n  id = 'antv-dagre';\n\n  constructor(public options: AntVDagreLayoutOptions = {} as AntVDagreLayoutOptions) {\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  async execute(graph: IGraph, options?: AntVDagreLayoutOptions) {\n    return this.genericDagreLayout(false, graph, options);\n  }\n\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: IGraph, options?: AntVDagreLayoutOptions) {\n    await this.genericDagreLayout(true, graph, options);\n  }\n\n  private async genericDagreLayout(\n    assign: false,\n    graph: IGraph,\n    options?: AntVDagreLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericDagreLayout(\n    assign: true,\n    graph: IGraph,\n    options?: AntVDagreLayoutOptions,\n  ): Promise<void>;\n  private async genericDagreLayout(\n    assign: boolean,\n    graph: IGraph,\n    options?: AntVDagreLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      nodeSize,\n      align,\n      rankdir = 'TB',\n      ranksep,\n      nodesep,\n      ranksepFunc,\n      nodesepFunc,\n      edgeLabelSpace,\n      ranker,\n      nodeOrder,\n      begin,\n      controlPoints,\n      radial,\n      sortByCombo,\n      // focusNode,\n      preset,\n    } = mergedOptions;\n\n    const g = new Graph<NodeData, EdgeData>({\n      tree: [],\n    });\n\n    const ranksepfunc = formatNumberFn(ranksep || 50, ranksepFunc);\n    const nodesepfunc = formatNumberFn(nodesep || 50, nodesepFunc);\n    let horisep: (d?: Node | undefined) => number = nodesepfunc;\n    let vertisep: (d?: Node | undefined) => number = ranksepfunc;\n    if (rankdir === 'LR' || rankdir === 'RL') {\n      horisep = ranksepfunc;\n      vertisep = nodesepfunc;\n    }\n    const nodeSizeFunc = formatNodeSize(nodeSize, undefined);\n\n    // copy graph to g\n    const nodes: Node[] = graph.getAllNodes();\n    const edges: Edge[] = graph.getAllEdges();\n\n    nodes.forEach((node) => {\n      const size = nodeSizeFunc(node);\n      const verti = vertisep(node);\n      const hori = horisep(node);\n      // FIXME: support 2 dimensions?\n      // const width = size[0] + 2 * hori;\n      // const height = size[1] + 2 * verti;\n      const width = size + 2 * hori;\n      const height = size + 2 * verti;\n      const layer = node.data.layer;\n      if (isNumber(layer)) {\n        // 如果有layer属性，加入到node的label中\n        g.addNode({\n          id: node.id,\n          data: { width, height, layer },\n        });\n      } else {\n        g.addNode({\n          id: node.id,\n          data: { width, height },\n        });\n      }\n    });\n    if (sortByCombo) {\n      g.attachTreeStructure('combo');\n      nodes.forEach((node) => {\n        const { parentId } = node.data;\n        if (parentId === undefined) return;\n        if (g.hasNode(parentId as ID)) {\n          g.setParent(node.id, parentId as ID, 'combo');\n        }\n      });\n    }\n\n    edges.forEach((edge) => {\n      // dagrejs Wiki https://github.com/dagrejs/dagre/wiki#configuring-the-layout\n      g.addEdge({\n        id: edge.id,\n        source: edge.source,\n        target: edge.target,\n        data: {\n          weight: edge.data.weight || 1,\n        },\n      });\n    });\n\n    let prevGraph: IGraph | undefined = undefined;\n    if (preset?.length) {\n      prevGraph = new Graph({\n        nodes: preset,\n      });\n    }\n\n    layout(g, {\n      prevGraph,\n      edgeLabelSpace,\n      keepNodeOrder: !!nodeOrder,\n      nodeOrder: nodeOrder || [],\n      acyclicer: 'greedy',\n      ranker,\n      rankdir,\n      nodesep,\n      align,\n    });\n\n    const layoutTopLeft = [0, 0];\n    if (begin) {\n      let minX = Infinity;\n      let minY = Infinity;\n      g.getAllNodes().forEach((node) => {\n        if (minX > node.data.x!) minX = node.data.x!;\n        if (minY > node.data.y!) minY = node.data.y!;\n      });\n      g.getAllEdges().forEach((edge) => {\n        edge.data.points?.forEach((point: Point) => {\n          if (minX > point.x) minX = point.x;\n          if (minY > point.y) minY = point.y;\n        });\n      });\n      layoutTopLeft[0] = begin[0] - minX;\n      layoutTopLeft[1] = begin[1] - minY;\n    }\n\n    const isHorizontal = rankdir === 'LR' || rankdir === 'RL';\n    if (radial) {\n      // const focusId = (isString(focusNode) ? focusNode : focusNode?.id) as ID;\n      // const focusLayer = focusId ? g.getNode(focusId)?.data._rank as number : 0;\n      // const layers: any[] = [];\n      // const dim = isHorizontal ? \"y\" : \"x\";\n      // const sizeDim = isHorizontal ? \"height\" : \"width\";\n      // // 找到整个图作为环的坐标维度（dim）的最大、最小值，考虑节点宽度\n      // let min = Infinity;\n      // let max = -Infinity;\n      // g.getAllNodes().forEach((node) => {\n      //   const currentNodesep = nodesepfunc(node);\n      //   if (focusLayer === 0) {\n      //     if (!layers[node.data._rank!]) {\n      //       layers[node.data._rank!] = {\n      //         nodes: [],\n      //         totalWidth: 0,\n      //         maxSize: -Infinity,\n      //       };\n      //     }\n      //     layers[node.data._rank!].nodes.push(node);\n      //     layers[node.data._rank!].totalWidth += currentNodesep * 2 + node.data[sizeDim]!;\n      //     if (\n      //       layers[node.data._rank!].maxSize < Math.max(node.data.width!, node.data.height!)\n      //     ) {\n      //       layers[node.data._rank!].maxSize = Math.max(node.data.width!, node.data.height!);\n      //     }\n      //   } else {\n      //     const diffLayer = node.data._rank! - focusLayer!;\n      //     if (diffLayer === 0) {\n      //       if (!layers[diffLayer]) {\n      //         layers[diffLayer] = {\n      //           nodes: [],\n      //           totalWidth: 0,\n      //           maxSize: -Infinity,\n      //         };\n      //       }\n      //       layers[diffLayer].nodes.push(node);\n      //       layers[diffLayer].totalWidth += currentNodesep * 2 + node.data[sizeDim]!;\n      //       if (\n      //         layers[diffLayer].maxSize < Math.max(node.data.width!, node.data.height!)\n      //       ) {\n      //         layers[diffLayer].maxSize = Math.max(node.data.width!, node.data.height!);\n      //       }\n      //     } else {\n      //       const diffLayerAbs = Math.abs(diffLayer);\n      //       if (!layers[diffLayerAbs]) {\n      //         layers[diffLayerAbs] = {\n      //           left: [],\n      //           right: [],\n      //           totalWidth: 0,\n      //           maxSize: -Infinity,\n      //         };\n      //       }\n      //       layers[diffLayerAbs].totalWidth +=\n      //         currentNodesep * 2 + node.data[sizeDim]!;\n      //       if (\n      //         layers[diffLayerAbs].maxSize < Math.max(node.data.width!, node.data.height!)\n      //       ) {\n      //         layers[diffLayerAbs].maxSize = Math.max(\n      //           node.data.width!,\n      //           node.data.height!\n      //         );\n      //       }\n      //       if (diffLayer < 0) {\n      //         layers[diffLayerAbs].left.push(node);\n      //       } else {\n      //         layers[diffLayerAbs].right.push(node);\n      //       }\n      //     }\n      //   }\n      //   const leftPos = node.data[dim]! - node.data[sizeDim]! / 2 - currentNodesep;\n      //   const rightPos = node.data[dim]! + node.data[sizeDim]! / 2 + currentNodesep;\n      //   if (leftPos < min) min = leftPos;\n      //   if (rightPos > max) max = rightPos;\n      // });\n      // // const padding = (max - min) * 0.1; // TODO\n      // // 初始化为第一圈的半径，后面根据每层 ranksep 叠加\n      // let radius = ranksep || 50; // TODO;\n      // const radiusMap: any = {};\n      // // 扩大最大最小值范围，以便为环上留出接缝处的空隙\n      // const rangeLength = (max - min) / 0.9;\n      // const range = [\n      //   (min + max - rangeLength) * 0.5,\n      //   (min + max + rangeLength) * 0.5,\n      // ];\n      // // 根据半径、分布比例，计算节点在环上的位置，并返回该组节点中最大的 ranksep 值\n      // const processNodes = (\n      //   layerNodes: any,\n      //   radius: number,\n      //   propsMaxRanksep = -Infinity,\n      //   arcRange = [0, 1]\n      // ) => {\n      //   let maxRanksep = propsMaxRanksep;\n      //   layerNodes.forEach((node: any) => {\n      //     const coord = g.node(node);\n      //     radiusMap[node] = radius;\n      //     // 获取变形为 radial 后的直角坐标系坐标\n      //     const { x: newX, y: newY } = getRadialPos(\n      //       coord![dim]!,\n      //       range,\n      //       rangeLength,\n      //       radius,\n      //       arcRange\n      //     );\n      //     // 将新坐标写入源数据\n      //     const i = nodes.findIndex((it) => it.id === node);\n      //     if (!nodes[i]) return;\n      //     nodes[i].x = newX + dBegin[0];\n      //     nodes[i].y = newY + dBegin[1];\n      //     // @ts-ignore: pass layer order to data for increment layout use\n      //     nodes[i]._order = coord._order;\n      //     // 找到本层最大的一个 ranksep，作为下一层与本层的间隙，叠加到下一层的半径上\n      //     const currentNodeRanksep = ranksepfunc(nodes[i]);\n      //     if (maxRanksep < currentNodeRanksep) maxRanksep = currentNodeRanksep;\n      //   });\n      //   return maxRanksep;\n      // };\n      // let isFirstLevel = true;\n      // const lastLayerMaxNodeSize = 0;\n      // layers.forEach((layerNodes) => {\n      //   if (\n      //     !layerNodes?.nodes?.length &&\n      //     !layerNodes?.left?.length &&\n      //     !layerNodes?.right?.length\n      //   ) {\n      //     return;\n      //   }\n      //   // 第一层只有一个节点，直接放在圆心，初始半径设定为 0\n      //   if (isFirstLevel && layerNodes.nodes.length === 1) {\n      //     // 将新坐标写入源数据\n      //     const i = nodes.findIndex((it) => it.id === layerNodes.nodes[0]);\n      //     if (i <= -1) return;\n      //     nodes[i].x = dBegin[0];\n      //     nodes[i].y = dBegin[1];\n      //     radiusMap[layerNodes.nodes[0]] = 0;\n      //     radius = ranksepfunc(nodes[i]);\n      //     isFirstLevel = false;\n      //     return;\n      //   }\n      //   // 为接缝留出空隙，半径也需要扩大\n      //   radius = Math.max(radius, layerNodes.totalWidth / (2 * Math.PI)); // / 0.9;\n      //   let maxRanksep = -Infinity;\n      //   if (focusLayer === 0 || layerNodes.nodes?.length) {\n      //     maxRanksep = processNodes(\n      //       layerNodes.nodes,\n      //       radius,\n      //       maxRanksep,\n      //       [0, 1]\n      //     ); // 0.8\n      //   } else {\n      //     const leftRatio =\n      //       layerNodes.left?.length /\n      //       (layerNodes.left?.length + layerNodes.right?.length);\n      //     maxRanksep = processNodes(layerNodes.left, radius, maxRanksep, [\n      //       0,\n      //       leftRatio,\n      //     ]); // 接缝留出 0.05 的缝隙\n      //     maxRanksep = processNodes(layerNodes.right, radius, maxRanksep, [\n      //       leftRatio + 0.05,\n      //       1,\n      //     ]); // 接缝留出 0.05 的缝隙\n      //   }\n      //   radius += maxRanksep;\n      //   isFirstLevel = false;\n      //   lastLayerMaxNodeSize - layerNodes.maxSize;\n      // });\n      // g.edges().forEach((edge: any) => {\n      //   const coord = g.edge(edge);\n      //   const i = edges.findIndex((it) => {\n      //     const source = getEdgeTerminal(it, \"source\");\n      //     const target = getEdgeTerminal(it, \"target\");\n      //     return source === edge.v && target === edge.w;\n      //   });\n      //   if (i <= -1) return;\n      //   if (\n      //     self.edgeLabelSpace &&\n      //     self.controlPoints &&\n      //     edges[i].type !== \"loop\"\n      //   ) {\n      //     const otherDim = dim === \"x\" ? \"y\" : \"x\";\n      //     const controlPoints = coord?.points?.slice(\n      //       1,\n      //       coord.points.length - 1\n      //     );\n      //     const newControlPoints: Point[] = [];\n      //     const sourceOtherDimValue = g.node(edge.v)?.[otherDim]!;\n      //     const otherDimDist =\n      //       sourceOtherDimValue - g.node(edge.w)?.[otherDim]!;\n      //     const sourceRadius = radiusMap[edge.v];\n      //     const radiusDist = sourceRadius - radiusMap[edge.w];\n      //     controlPoints?.forEach((point: any) => {\n      //       // 根据该边的起点、终点半径，及起点、终点、控制点位置关系，确定该控制点的半径\n      //       const cRadius =\n      //         ((point[otherDim] - sourceOtherDimValue) / otherDimDist) *\n      //           radiusDist +\n      //         sourceRadius;\n      //       // 获取变形为 radial 后的直角坐标系坐标\n      //       const newPos = getRadialPos(\n      //         point[dim],\n      //         range,\n      //         rangeLength,\n      //         cRadius\n      //       );\n      //       newControlPoints.push({\n      //         x: newPos.x + dBegin[0],\n      //         y: newPos.y + dBegin[1],\n      //       });\n      //     });\n      //     edges[i].controlPoints = newControlPoints;\n      //   }\n      // });\n    } else {\n      const layerCoords: Set<number> = new Set();\n      const isInvert = rankdir === 'BT' || rankdir === 'RL';\n      const layerCoordSort = isInvert\n        ? (a: number, b: number) => b - a\n        : (a: number, b: number) => a - b;\n      g.getAllNodes().forEach((node) => {\n        // let ndata: any = this.nodeMap[node];\n        // if (!ndata) {\n        //   ndata = combos?.find((it) => it.id === node);\n        // }\n        // if (!ndata) return;\n        // ndata.x = node.data.x! + dBegin[0];\n        // ndata.y = node.data.y! + dBegin[1];\n        // //  pass layer order to data for increment layout use\n        // ndata._order = node.data._order;\n        // layerCoords.add(isHorizontal ? ndata.x : ndata.y);\n\n        node.data.x = node.data.x! + layoutTopLeft[0];\n        node.data.y = node.data.y! + layoutTopLeft[1];\n        layerCoords.add(isHorizontal ? node.data.x : node.data.y);\n      });\n      const layerCoordsArr = Array.from(layerCoords).sort(layerCoordSort);\n\n      // pre-define the isHorizontal related functions to avoid redundant calc in interations\n      const isDifferentLayer = isHorizontal\n        ? (point1: Point, point2: Point) => point1.x !== point2.x\n        : (point1: Point, point2: Point) => point1.y !== point2.y;\n      const filterControlPointsOutOfBoundary = isHorizontal\n        ? (ps: Point[], point1: Point, point2: Point) => {\n            const max = Math.max(point1.y, point2.y);\n            const min = Math.min(point1.y, point2.y);\n            return ps.filter((point) => point.y <= max && point.y >= min);\n          }\n        : (ps: Point[], point1: Point, point2: Point) => {\n            const max = Math.max(point1.x, point2.x);\n            const min = Math.min(point1.x, point2.x);\n            return ps.filter((point) => point.x <= max && point.x >= min);\n          };\n\n      g.getAllEdges().forEach((edge, i) => {\n        // const i = edges.findIndex((it) => {\n        //   return it.source === edge.source && it.target === edge.target;\n        // });\n        // if (i <= -1) return;\n        if (edgeLabelSpace && controlPoints && edge.data.type !== 'loop') {\n          edge.data.controlPoints = getControlPoints(\n            edge.data.points?.map(({ x, y }: Point) => ({\n              x: x + layoutTopLeft[0],\n              y: y + layoutTopLeft[1],\n            })),\n            g.getNode(edge.source),\n            g.getNode(edge.target),\n            layerCoordsArr,\n            isHorizontal,\n            isDifferentLayer,\n            filterControlPointsOutOfBoundary,\n          );\n        }\n      });\n    }\n\n    // calculated nodes as temporary result\n    let layoutNodes: OutNode[] = [];\n    // layout according to the original order in the data.nodes\n    layoutNodes = g\n      .getAllNodes()\n      .map((node) => cloneFormatData(node) as OutNode);\n    const layoutEdges = g.getAllEdges();\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      layoutEdges.forEach((edge) => {\n        graph.mergeEdgeData(edge.id, {\n          controlPoints: edge.data.controlPoints,\n        });\n      });\n    }\n\n    const result = {\n      nodes: layoutNodes,\n      edges: layoutEdges,\n    };\n\n    return result;\n  }\n}\n\n/**\n * Format controlPoints to avoid polylines crossing nodes\n * @param points\n * @param sourceNode\n * @param targetNode\n * @param layerCoordsArr\n * @param isHorizontal\n * @returns\n */\nconst getControlPoints = (\n  points: Point[] | undefined,\n  sourceNode: Node,\n  targetNode: Node,\n  layerCoordsArr: number[],\n  isHorizontal: boolean,\n  isDifferentLayer: (point1: Point, point2: Point) => boolean,\n  filterControlPointsOutOfBoundary: (\n    ps: Point[],\n    point1: Point,\n    point2: Point,\n  ) => Point[],\n) => {\n  let controlPoints = points?.slice(1, points.length - 1) || []; // 去掉头尾\n  // 酌情增加控制点，使折线不穿过跨层的节点\n  if (sourceNode && targetNode) {\n    let { x: sourceX, y: sourceY } = sourceNode.data;\n    let { x: targetX, y: targetY } = targetNode.data;\n    if (isHorizontal) {\n      sourceX = sourceNode.data.y;\n      sourceY = sourceNode.data.x;\n      targetX = targetNode.data.y;\n      targetY = targetNode.data.x;\n    }\n    // 为跨层级的边增加第一个控制点。忽略垂直的/横向的边。\n    // 新控制点 = {\n    //   x: 终点x,\n    //   y: (起点y + 下一层y) / 2,   #下一层y可能不等于终点y\n    // }\n    if (targetY !== sourceY && sourceX !== targetX) {\n      const sourceLayer = layerCoordsArr.indexOf(sourceY!);\n      const sourceNextLayerCoord = layerCoordsArr[sourceLayer + 1];\n      if (sourceNextLayerCoord) {\n        const firstControlPoint = controlPoints[0];\n        const insertStartControlPoint = (\n          isHorizontal\n            ? {\n                x: (sourceY! + sourceNextLayerCoord) / 2,\n                y: firstControlPoint?.y || targetX,\n              }\n            : {\n                x: firstControlPoint?.x || targetX,\n                y: (sourceY! + sourceNextLayerCoord) / 2,\n              }\n        ) as Point;\n        // 当新增的控制点不存在（!=当前第一个控制点）时添加\n        if (\n          !firstControlPoint ||\n          isDifferentLayer(firstControlPoint, insertStartControlPoint)\n        ) {\n          controlPoints.unshift(insertStartControlPoint);\n        }\n      }\n\n      const targetLayer = layerCoordsArr.indexOf(targetY!);\n      const layerDiff = Math.abs(targetLayer - sourceLayer);\n      if (layerDiff === 1) {\n        controlPoints = filterControlPointsOutOfBoundary(\n          controlPoints,\n          sourceNode.data as Point,\n          targetNode.data as Point,\n        );\n        // one controlPoint at least\n        if (!controlPoints.length) {\n          controlPoints.push(\n            (isHorizontal\n              ? {\n                  x: (sourceY! + targetY!) / 2,\n                  y: sourceX,\n                }\n              : {\n                  x: sourceX,\n                  y: (sourceY! + targetY!) / 2,\n                }) as Point,\n          );\n        }\n      } else if (layerDiff > 1) {\n        const targetLastLayerCoord = layerCoordsArr[targetLayer - 1];\n        if (targetLastLayerCoord) {\n          const lastControlPoints = controlPoints[controlPoints.length - 1];\n          const insertEndControlPoint = (\n            isHorizontal\n              ? {\n                  x: (targetY! + targetLastLayerCoord) / 2,\n                  y: lastControlPoints?.y || targetX,\n                }\n              : {\n                  x: lastControlPoints?.x || sourceX,\n                  y: (targetY! + targetLastLayerCoord) / 2,\n                }\n          ) as Point;\n          // 当新增的控制点不存在（!=当前最后一个控制点）时添加\n          if (\n            !lastControlPoints ||\n            isDifferentLayer(lastControlPoints, insertEndControlPoint)\n          ) {\n            controlPoints.push(insertEndControlPoint);\n          }\n        }\n      }\n    }\n  }\n  return controlPoints;\n};\n","import { Graph, PointTuple } from '../types';\n\n/**\n * Assign or only return the result for the graph who has no nodes or only one node.\n * @param graph original graph\n * @param assign whether assign result to original graph\n * @param center the layout center\n * @returns\n */\nexport const handleSingleNodeGraph = (\n  graph: Graph,\n  assign: boolean,\n  center: PointTuple,\n) => {\n  const nodes = graph.getAllNodes();\n  const edges = graph.getAllEdges();\n  if (!nodes?.length) {\n    const result = { nodes: [] as any[], edges };\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    return result;\n  }\n};\n","import type {\n  CircularLayoutOptions,\n  Edge,\n  Graph,\n  Layout,\n  LayoutMapping,\n  Node,\n  OutNode,\n  PointTuple,\n} from './types';\nimport { cloneFormatData, formatNumberFn, formatSizeFn } from './util';\nimport { handleSingleNodeGraph } from './util/common';\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 = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new CircularLayout({ radius: 10 });\n * const positions = await layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { radius: 20 });\n */\nexport class CircularLayout implements Layout<CircularLayoutOptions> {\n  id = 'circular';\n\n  constructor(\n    public options: CircularLayoutOptions = {} as CircularLayoutOptions,\n  ) {\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  async execute(graph: Graph, options?: CircularLayoutOptions) {\n    return this.genericCircularLayout(false, graph, options);\n  }\n\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: CircularLayoutOptions) {\n    await this.genericCircularLayout(true, graph, options);\n  }\n\n  private async genericCircularLayout(\n    assign: false,\n    graph: Graph,\n    options?: CircularLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericCircularLayout(\n    assign: true,\n    graph: Graph,\n    options?: CircularLayoutOptions,\n  ): Promise<void>;\n  private async genericCircularLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: CircularLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      width,\n      height,\n      center,\n      divisions,\n      startAngle = 0,\n      endAngle = 2 * Math.PI,\n      angleRatio,\n      ordering,\n      clockwise,\n      nodeSpacing: paramNodeSpacing,\n      nodeSize: paramNodeSize,\n    } = mergedOptions;\n\n    const nodes: Node[] = graph.getAllNodes();\n    const edges: Edge[] = graph.getAllEdges();\n\n    // Calculate center according to `window` if not provided.\n    const [calculatedWidth, calculatedHeight, calculatedCenter] =\n      calculateCenter(width, height, center);\n    const n = nodes?.length;\n    if (!n || n === 1) {\n      return handleSingleNodeGraph(graph, assign, calculatedCenter);\n    }\n\n    const angleStep = (endAngle - startAngle) / n;\n\n    let { radius, startRadius, endRadius } = mergedOptions;\n    if (paramNodeSpacing) {\n      const nodeSpacing: Function = formatNumberFn(10, paramNodeSpacing);\n      const nodeSize: Function = formatSizeFn(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) => cloneFormatData(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\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[] = [cloneFormatData(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') !==\n            graph.getDegree(nodes[i + 1].id, 'both') ||\n          graph.areNeighbors(orderedCNodes[k].id, node.id)) &&\n        !pickFlags[node.id]\n      ) {\n        orderedCNodes.push(cloneFormatData(node) as OutNode);\n        pickFlags[node.id] = true;\n        k++;\n      } else {\n        const children = directed\n          ? graph.getSuccessors(orderedCNodes[k].id)\n          : 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 (\n            graph.getDegree(child.id) === graph.getDegree(node.id) &&\n            !pickFlags[child.id]\n          ) {\n            orderedCNodes.push(cloneFormatData(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(cloneFormatData(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(graph: Graph, nodes: Node[]): OutNode[] {\n  const orderedNodes: OutNode[] = [];\n  nodes.forEach((node, i) => {\n    orderedNodes.push(cloneFormatData(node) as OutNode);\n  });\n  orderedNodes.sort(\n    (nodeA: Node, nodeB: Node) =>\n      graph.getDegree(nodeA.id, 'both') - graph.getDegree(nodeB.id, 'both'),\n  );\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};\n","import isType from './is-type';\nexport default (function (str) {\n    return isType(str, 'String');\n});\n//# sourceMappingURL=is-string.js.map","export const isArray = Array.isArray;\n","import { isFunction, isNumber, isObject, isString } from '@antv/util';\nimport type {\n  ConcentricLayoutOptions,\n  Graph,\n  IndexMap,\n  Layout,\n  LayoutMapping,\n  Node,\n  OutNode,\n  PointTuple,\n} from './types';\nimport { cloneFormatData, isArray } from './util';\nimport { handleSingleNodeGraph } from './util/common';\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<ConcentricLayoutOptions> = {\n  nodeSize: 30,\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 = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new ConcentricLayout({ nodeSpacing: 10});\n * const positions = await layout.execute(graph, { nodeSpacing: 10 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { nodeSpacing: 10 });\n */\nexport class ConcentricLayout implements Layout<ConcentricLayoutOptions> {\n  id = 'concentric';\n\n  constructor(\n    public options: ConcentricLayoutOptions = {} as ConcentricLayoutOptions,\n  ) {\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  async execute(graph: Graph, options?: ConcentricLayoutOptions) {\n    return this.genericConcentricLayout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: ConcentricLayoutOptions) {\n    this.genericConcentricLayout(true, graph, options);\n  }\n\n  private async genericConcentricLayout(\n    assign: false,\n    graph: Graph,\n    options?: ConcentricLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericConcentricLayout(\n    assign: true,\n    graph: Graph,\n    options?: ConcentricLayoutOptions,\n  ): Promise<void>;\n  private async genericConcentricLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: ConcentricLayoutOptions,\n  ): Promise<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      preventOverlap,\n      startAngle = (3 / 2) * Math.PI,\n      nodeSize,\n      nodeSpacing,\n    } = mergedOptions;\n\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges();\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 = (\n      !propsCenter ? [width / 2, height / 2] : propsCenter\n    ) as PointTuple;\n\n    if (!nodes?.length || nodes.length === 1) {\n      return handleSingleNodeGraph(graph, assign, center);\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 if (isFunction(nodeSize)) {\n      maxNodeSize = -Infinity;\n      nodes.forEach((node) => {\n        const currentSize = nodeSize(node);\n        if (currentSize > maxNodeSize) maxNodeSize = currentSize;\n      });\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      const cnode = cloneFormatData(node) as OutNode;\n      layoutNodes.push(cnode);\n      let nodeSize: number = maxNodeSize;\n      const { data } = cnode;\n      if (isArray(data.size)) {\n        nodeSize = Math.max(data.size[0], data.size[1]);\n      } else if (isNumber(data.size)) {\n        nodeSize = data.size;\n      } else if (isObject(data.size)) {\n        nodeSize = Math.max(\n          (data.size as any).width,\n          (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    const maxLevelDiff =\n      (propsMaxLevelDiff ||\n        (sortBy === 'degree'\n          ? graph.getDegree(maxValueNode.id, 'both')\n          : (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 =\n          sortBy === 'degree'\n            ? Math.abs(\n                graph.getDegree(currentLevel.nodes[0].id, 'both') -\n                  graph.getDegree(node.id, 'both'),\n              )\n            : Math.abs(\n                (currentLevel.nodes[0].data[sortBy] as number) -\n                  (node as any).data[sortBy],\n              );\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; // 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    return result;\n  }\n}\n","export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d);\n  return add(this.cover(x, y), x, y, d);\n}\n\nfunction add(tree, x, y, d) {\n  if (isNaN(x) || isNaN(y)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      xm,\n      ym,\n      xp,\n      yp,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (parent = node, !(node = node[i = bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  if (x === xp && y === yp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(4) : tree._root = new Array(4);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n  } while ((i = bottom << 1 | right) === (j = (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  var d, i, n = data.length,\n      x,\n      y,\n      xz = new Array(n),\n      yz = new Array(n),\n      x0 = Infinity,\n      y0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (i = 0; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0).cover(x1, y1);\n\n  // Add the new points.\n  for (i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], data[i]);\n  }\n\n  return this;\n}\n","export default function(node, x0, y0, x1, y1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.x1 = x1;\n  this.y1 = y1;\n}\n","export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\n\nexport default function quadtree(nodes, x, y) {\n  var tree = new Quadtree(x == null ? defaultX : x, y == null ? defaultY : y, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Quadtree(x, y, x0, y0, x1, y1) {\n  this._x = x;\n  this._y = y;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = quadtree.prototype = Quadtree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Quadtree(this._x, this._y, this._x0, this._y0, this._x1, this._y1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(4)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 4; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(4)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\n","export default function(d) {\n  const x = +this._x.call(null, d),\n      y = +this._y.call(null, d),\n      z = +this._z.call(null, d);\n  return add(this.cover(x, y, z), x, y, z, d);\n}\n\nfunction add(tree, x, y, z, d) {\n  if (isNaN(x) || isNaN(y) || isNaN(z)) return tree; // ignore invalid points\n\n  var parent,\n      node = tree._root,\n      leaf = {data: d},\n      x0 = tree._x0,\n      y0 = tree._y0,\n      z0 = tree._z0,\n      x1 = tree._x1,\n      y1 = tree._y1,\n      z1 = tree._z1,\n      xm,\n      ym,\n      zm,\n      xp,\n      yp,\n      zp,\n      right,\n      bottom,\n      deep,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return tree._root = leaf, tree;\n\n  // Find the existing leaf for the new point, or add it.\n  while (node.length) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n    if (parent = node, !(node = node[i = deep << 2 | bottom << 1 | right])) return parent[i] = leaf, tree;\n  }\n\n  // Is the new point is exactly coincident with the existing point?\n  xp = +tree._x.call(null, node.data);\n  yp = +tree._y.call(null, node.data);\n  zp = +tree._z.call(null, node.data);\n  if (x === xp && y === yp && z === zp) return leaf.next = node, parent ? parent[i] = leaf : tree._root = leaf, tree;\n\n  // Otherwise, split the leaf node until the old and new point are separated.\n  do {\n    parent = parent ? parent[i] = new Array(8) : tree._root = new Array(8);\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n  } while ((i = deep << 2 | bottom << 1 | right) === (j = (zp >= zm) << 2 | (yp >= ym) << 1 | (xp >= xm)));\n  return parent[j] = node, parent[i] = leaf, tree;\n}\n\nexport function addAll(data) {\n  if (!Array.isArray(data)) data = Array.from(data);\n  const n = data.length;\n  const xz = new Float64Array(n);\n  const yz = new Float64Array(n);\n  const zz = new Float64Array(n);\n  let x0 = Infinity,\n      y0 = Infinity,\n      z0 = Infinity,\n      x1 = -Infinity,\n      y1 = -Infinity,\n      z1 = -Infinity;\n\n  // Compute the points and their extent.\n  for (let i = 0, d, x, y, z; i < n; ++i) {\n    if (isNaN(x = +this._x.call(null, d = data[i])) || isNaN(y = +this._y.call(null, d)) || isNaN(z = +this._z.call(null, d))) continue;\n    xz[i] = x;\n    yz[i] = y;\n    zz[i] = z;\n    if (x < x0) x0 = x;\n    if (x > x1) x1 = x;\n    if (y < y0) y0 = y;\n    if (y > y1) y1 = y;\n    if (z < z0) z0 = z;\n    if (z > z1) z1 = z;\n  }\n\n  // If there were no (valid) points, abort.\n  if (x0 > x1 || y0 > y1 || z0 > z1) return this;\n\n  // Expand the tree to cover the new points.\n  this.cover(x0, y0, z0).cover(x1, y1, z1);\n\n  // Add the new points.\n  for (let i = 0; i < n; ++i) {\n    add(this, xz[i], yz[i], zz[i], data[i]);\n  }\n\n  return this;\n}\n","export default function(node, x0, y0, z0, x1, y1, z1) {\n  this.node = node;\n  this.x0 = x0;\n  this.y0 = y0;\n  this.z0 = z0;\n  this.x1 = x1;\n  this.y1 = y1;\n  this.z1 = z1;\n}\n","export function defaultX(d) {\n  return d[0];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._x = _, this) : this._x;\n}\n","export function defaultY(d) {\n  return d[1];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._y = _, this) : this._y;\n}\n","export function defaultZ(d) {\n  return d[2];\n}\n\nexport default function(_) {\n  return arguments.length ? (this._z = _, this) : this._z;\n}\n","import tree_add, {addAll as tree_addAll} from \"./add.js\";\nimport tree_cover from \"./cover.js\";\nimport tree_data from \"./data.js\";\nimport tree_extent from \"./extent.js\";\nimport tree_find from \"./find.js\";\nimport tree_remove, {removeAll as tree_removeAll} from \"./remove.js\";\nimport tree_root from \"./root.js\";\nimport tree_size from \"./size.js\";\nimport tree_visit from \"./visit.js\";\nimport tree_visitAfter from \"./visitAfter.js\";\nimport tree_x, {defaultX} from \"./x.js\";\nimport tree_y, {defaultY} from \"./y.js\";\nimport tree_z, {defaultZ} from \"./z.js\";\n\nexport default function octree(nodes, x, y, z) {\n  var tree = new Octree(x == null ? defaultX : x, y == null ? defaultY : y, z == null ? defaultZ : z, NaN, NaN, NaN, NaN, NaN, NaN);\n  return nodes == null ? tree : tree.addAll(nodes);\n}\n\nfunction Octree(x, y, z, x0, y0, z0, x1, y1, z1) {\n  this._x = x;\n  this._y = y;\n  this._z = z;\n  this._x0 = x0;\n  this._y0 = y0;\n  this._z0 = z0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._z1 = z1;\n  this._root = undefined;\n}\n\nfunction leaf_copy(leaf) {\n  var copy = {data: leaf.data}, next = copy;\n  while (leaf = leaf.next) next = next.next = {data: leaf.data};\n  return copy;\n}\n\nvar treeProto = octree.prototype = Octree.prototype;\n\ntreeProto.copy = function() {\n  var copy = new Octree(this._x, this._y, this._z, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1),\n      node = this._root,\n      nodes,\n      child;\n\n  if (!node) return copy;\n\n  if (!node.length) return copy._root = leaf_copy(node), copy;\n\n  nodes = [{source: node, target: copy._root = new Array(8)}];\n  while (node = nodes.pop()) {\n    for (var i = 0; i < 8; ++i) {\n      if (child = node.source[i]) {\n        if (child.length) nodes.push({source: child, target: node.target[i] = new Array(8)});\n        else node.target[i] = leaf_copy(child);\n      }\n    }\n  }\n\n  return copy;\n};\n\ntreeProto.add = tree_add;\ntreeProto.addAll = tree_addAll;\ntreeProto.cover = tree_cover;\ntreeProto.data = tree_data;\ntreeProto.extent = tree_extent;\ntreeProto.find = tree_find;\ntreeProto.remove = tree_remove;\ntreeProto.removeAll = tree_removeAll;\ntreeProto.root = tree_root;\ntreeProto.size = tree_size;\ntreeProto.visit = tree_visit;\ntreeProto.visitAfter = tree_visitAfter;\ntreeProto.x = tree_x;\ntreeProto.y = tree_y;\ntreeProto.z = tree_z;\n","export default function(x, y) {\n  if (isNaN(x = +x) || isNaN(y = +y)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1;\n\n  // If the quadtree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing quadrant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var z = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1) {\n      i = (y < y0) << 1 | (x < x0);\n      parent = new Array(4), parent[i] = node, node = parent, z *= 2;\n      switch (i) {\n        case 0: x1 = x0 + z, y1 = y0 + z; break;\n        case 1: x0 = x1 - z, y1 = y0 + z; break;\n        case 2: x1 = x0 + z, y0 = y1 - z; break;\n        case 3: x0 = x1 - z, y0 = y1 - z; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._x1 = x1;\n  this._y1 = y1;\n  return this;\n}\n","export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n","export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1]).cover(+_[1][0], +_[1][1])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0], [this._x1, this._y1]];\n}\n","import Quad from \"./quad.js\";\n\nexport default function(x, y, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1,\n      y1,\n      x2,\n      y2,\n      x3 = this._x1,\n      y3 = this._y1,\n      quads = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) quads.push(new Quad(node, x0, y0, x3, y3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius;\n    x3 = x + radius, y3 = y + radius;\n    radius *= radius;\n  }\n\n  while (q = quads.pop()) {\n\n    // Stop searching if this quadrant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0) continue;\n\n    // Bisect the current quadrant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2;\n\n      quads.push(\n        new Quad(node[3], xm, ym, x2, y2),\n        new Quad(node[2], x1, ym, xm, y2),\n        new Quad(node[1], xm, y1, x2, ym),\n        new Quad(node[0], x1, y1, xm, ym)\n      );\n\n      // Visit the closest quadrant first.\n      if (i = (y >= ym) << 1 | (x >= xm)) {\n        q = quads[quads.length - 1];\n        quads[quads.length - 1] = quads[quads.length - 1 - i];\n        quads[quads.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          d2 = dx * dx + dy * dy;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d;\n        x3 = x + d, y3 = y + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n","export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      x1 = this._x1,\n      y1 = this._y1,\n      x,\n      y,\n      xm,\n      ym,\n      right,\n      bottom,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (!(parent = node, node = node[i = bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 3] || parent[(i + 2) & 3] || parent[(i + 3) & 3]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3])\n      && node === (parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n","export default function() {\n  return this._root;\n}\n","export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], q, node = this._root, child, x0, y0, x1, y1;\n  if (node) quads.push(new Quad(node, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n    }\n  }\n  return this;\n}\n","import Quad from \"./quad.js\";\n\nexport default function(callback) {\n  var quads = [], next = [], q;\n  if (this._root) quads.push(new Quad(this._root, this._x0, this._y0, this._x1, this._y1));\n  while (q = quads.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, x1 = q.x1, y1 = q.y1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2;\n      if (child = node[0]) quads.push(new Quad(child, x0, y0, xm, ym));\n      if (child = node[1]) quads.push(new Quad(child, xm, y0, x1, ym));\n      if (child = node[2]) quads.push(new Quad(child, x0, ym, xm, y1));\n      if (child = node[3]) quads.push(new Quad(child, xm, ym, x1, y1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.x1, q.y1);\n  }\n  return this;\n}\n","import { quadtree } from 'd3-quadtree';\n// @ts-ignore\nimport { octree } from 'd3-octree';\nimport { Point } from '../types';\nimport { CalcGraph } from './types';\n\nconst theta2 = 0.81; // Barnes-Hut approximation threshold\nconst epsilon = 0.1; // 为了防止出现除0的情况，加一个epsilon\n\ninterface InternalNode {\n  id: string;\n  x: number;\n  y: number;\n  z?: number;\n  vx: number;\n  vy: number;\n  vz?: number;\n  weight: number;\n  size: number;\n}\n\nexport function forceNBody(\n  calcGraph: CalcGraph,\n  factor: number,\n  coulombDisScale2: number,\n  accMap: { [id: string]: Point },\n  dimensions: number = 2,\n) {\n  const weightParam = factor / coulombDisScale2;\n  const calcNodes = calcGraph.getAllNodes();\n  const data = calcNodes.map((calcNode, i) => {\n    const { nodeStrength, x, y, z, size } = calcNode.data;\n    return {\n      x,\n      y,\n      z,\n      size,\n      index: i,\n      id: calcNode.id,\n      vx: 0,\n      vy: 0,\n      vz: 0,\n      weight: weightParam * nodeStrength,\n    };\n  });\n\n  const tree = (\n    dimensions === 2\n      ? quadtree(\n          data,\n          (d: any) => d.x,\n          (d: any) => d.y,\n        )\n      : octree(\n          data,\n          (d: any) => d.x,\n          (d: any) => d.y,\n          (d: any) => d.z,\n        )\n  ).visitAfter(accumulate); // init internal node\n\n  const nodeMap = new Map();\n  data.forEach((n) => {\n    nodeMap.set(n.id, n);\n    // @ts-ignore\n    computeForce(n, tree, dimensions);\n  });\n\n  data.map((n, i) => {\n    const { id, data } = calcNodes[i];\n    const { mass = 1 } = data;\n    // 从 0 开始，= 初始化 + 加斥力\n    accMap[id] = {\n      x: n.vx / mass,\n      y: n.vy / mass,\n      z: n.vz / mass,\n    };\n  });\n  return accMap;\n}\n\nfunction accumulate(treeNode: any) {\n  let accWeight = 0;\n  let accX = 0;\n  let accY = 0;\n  let accZ = 0;\n  let accSize = 0;\n  const numChildren = treeNode.length;\n\n  if (numChildren) {\n    // internal node, accumulate 4 child quads\n    for (let i = 0; i < numChildren; i++) {\n      const q = treeNode[i];\n      if (q && q.weight) {\n        accWeight += q.weight;\n        accX += q.x * q.weight;\n        accY += q.y * q.weight;\n        accZ += q.z * q.weight;\n        accSize += q.size * q.weight;\n      }\n    }\n    treeNode.x = accX / accWeight;\n    treeNode.y = accY / accWeight;\n    treeNode.z = accZ / accWeight;\n    treeNode.size = accSize / accWeight;\n    treeNode.weight = accWeight;\n  } else {\n    // leaf node\n    const q = treeNode;\n    treeNode.x = q.data.x;\n    treeNode.y = q.data.y;\n    treeNode.z = q.data.z;\n    treeNode.size = q.data.size;\n    treeNode.weight = q.data.weight;\n  }\n}\n\nconst apply = (\n  treeNode: any,\n  x1: number,\n  arg1: number,\n  arg2: number,\n  arg3: number,\n  node: InternalNode,\n  dimensions: number,\n) => {\n  if (treeNode.data?.id === node.id) return;\n  const x2 = [arg1, arg2, arg3][dimensions - 1];\n\n  const dx = node.x - treeNode.x || epsilon;\n  const dy = node.y - treeNode.y || epsilon;\n  const dz = node.z - treeNode.z || epsilon;\n  const pos = [dx, dy, dz];\n  const width = x2 - x1;\n  let len2 = 0;\n  for (let i = 0; i < dimensions; i++) {\n    len2 += pos[i] * pos[i];\n  }\n  const len1 = Math.sqrt(len2);\n  const len3 = len1 * len2;\n\n  // far node, apply Barnes-Hut approximation\n  if (width * width * theta2 < len2) {\n    const param = treeNode.weight / len3;\n    node.vx += dx * param;\n    node.vy += dy * param;\n    node.vz += dz * param;\n    return true;\n  }\n  // near quad, compute force directly\n  if (treeNode.length) return false; // internal node, visit children\n\n  // leaf node\n\n  if (treeNode.data !== node) {\n    const param = treeNode.data.weight / len3;\n    node.vx += dx * param;\n    node.vy += dy * param;\n    node.vz += dz * param;\n  }\n};\n\n// @ts-ignore\nfunction computeForce(node: InternalNode, tree: any, dimensions: number) {\n  // @ts-ignore\n  tree.visit((treeNode, x1, y1, x2, y2) =>\n    apply(treeNode, x1, y1, x2, y2, node, dimensions),\n  );\n}\n","export default function(x, y, z) {\n  if (isNaN(x = +x) || isNaN(y = +y) || isNaN(z = +z)) return this; // ignore invalid points\n\n  var x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1 = this._x1,\n      y1 = this._y1,\n      z1 = this._z1;\n\n  // If the octree has no extent, initialize them.\n  // Integer extent are necessary so that if we later double the extent,\n  // the existing octant boundaries don’t change due to floating point error!\n  if (isNaN(x0)) {\n    x1 = (x0 = Math.floor(x)) + 1;\n    y1 = (y0 = Math.floor(y)) + 1;\n    z1 = (z0 = Math.floor(z)) + 1;\n  }\n\n  // Otherwise, double repeatedly to cover.\n  else {\n    var t = x1 - x0 || 1,\n        node = this._root,\n        parent,\n        i;\n\n    while (x0 > x || x >= x1 || y0 > y || y >= y1 || z0 > z || z >= z1) {\n      i = (z < z0) << 2 | (y < y0) << 1 | (x < x0);\n      parent = new Array(8), parent[i] = node, node = parent, t *= 2;\n      switch (i) {\n        case 0: x1 = x0 + t, y1 = y0 + t, z1 = z0 + t; break;\n        case 1: x0 = x1 - t, y1 = y0 + t, z1 = z0 + t; break;\n        case 2: x1 = x0 + t, y0 = y1 - t, z1 = z0 + t; break;\n        case 3: x0 = x1 - t, y0 = y1 - t, z1 = z0 + t; break;\n        case 4: x1 = x0 + t, y1 = y0 + t, z0 = z1 - t; break;\n        case 5: x0 = x1 - t, y1 = y0 + t, z0 = z1 - t; break;\n        case 6: x1 = x0 + t, y0 = y1 - t, z0 = z1 - t; break;\n        case 7: x0 = x1 - t, y0 = y1 - t, z0 = z1 - t; break;\n      }\n    }\n\n    if (this._root && this._root.length) this._root = node;\n  }\n\n  this._x0 = x0;\n  this._y0 = y0;\n  this._z0 = z0;\n  this._x1 = x1;\n  this._y1 = y1;\n  this._z1 = z1;\n  return this;\n}\n","export default function() {\n  var data = [];\n  this.visit(function(node) {\n    if (!node.length) do data.push(node.data); while (node = node.next)\n  });\n  return data;\n}\n","export default function(_) {\n  return arguments.length\n      ? this.cover(+_[0][0], +_[0][1], +_[0][2]).cover(+_[1][0], +_[1][1], +_[1][2])\n      : isNaN(this._x0) ? undefined : [[this._x0, this._y0, this._z0], [this._x1, this._y1, this._z1]];\n}\n","import Octant from \"./octant.js\";\n\nexport default function(x, y, z, radius) {\n  var data,\n      x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1,\n      y1,\n      z1,\n      x2,\n      y2,\n      z2,\n      x3 = this._x1,\n      y3 = this._y1,\n      z3 = this._z1,\n      octs = [],\n      node = this._root,\n      q,\n      i;\n\n  if (node) octs.push(new Octant(node, x0, y0, z0, x3, y3, z3));\n  if (radius == null) radius = Infinity;\n  else {\n    x0 = x - radius, y0 = y - radius, z0 = z - radius;\n    x3 = x + radius, y3 = y + radius, z3 = z + radius;\n    radius *= radius;\n  }\n\n  while (q = octs.pop()) {\n\n    // Stop searching if this octant can’t contain a closer node.\n    if (!(node = q.node)\n        || (x1 = q.x0) > x3\n        || (y1 = q.y0) > y3\n        || (z1 = q.z0) > z3\n        || (x2 = q.x1) < x0\n        || (y2 = q.y1) < y0\n        || (z2 = q.z1) < z0) continue;\n\n    // Bisect the current octant.\n    if (node.length) {\n      var xm = (x1 + x2) / 2,\n          ym = (y1 + y2) / 2,\n          zm = (z1 + z2) / 2;\n\n      octs.push(\n        new Octant(node[7], xm, ym, zm, x2, y2, z2),\n        new Octant(node[6], x1, ym, zm, xm, y2, z2),\n        new Octant(node[5], xm, y1, zm, x2, ym, z2),\n        new Octant(node[4], x1, y1, zm, xm, ym, z2),\n        new Octant(node[3], xm, ym, z1, x2, y2, zm),\n        new Octant(node[2], x1, ym, z1, xm, y2, zm),\n        new Octant(node[1], xm, y1, z1, x2, ym, zm),\n        new Octant(node[0], x1, y1, z1, xm, ym, zm)\n      );\n\n      // Visit the closest octant first.\n      if (i = (z >= zm) << 2 | (y >= ym) << 1 | (x >= xm)) {\n        q = octs[octs.length - 1];\n        octs[octs.length - 1] = octs[octs.length - 1 - i];\n        octs[octs.length - 1 - i] = q;\n      }\n    }\n\n    // Visit this point. (Visiting coincident points isn’t necessary!)\n    else {\n      var dx = x - +this._x.call(null, node.data),\n          dy = y - +this._y.call(null, node.data),\n          dz = z - +this._z.call(null, node.data),\n          d2 = dx * dx + dy * dy + dz * dz;\n      if (d2 < radius) {\n        var d = Math.sqrt(radius = d2);\n        x0 = x - d, y0 = y - d, z0 = z - d;\n        x3 = x + d, y3 = y + d, z3 = z + d;\n        data = node.data;\n      }\n    }\n  }\n\n  return data;\n}\n","export default function(d) {\n  if (isNaN(x = +this._x.call(null, d)) || isNaN(y = +this._y.call(null, d)) || isNaN(z = +this._z.call(null, d))) return this; // ignore invalid points\n\n  var parent,\n      node = this._root,\n      retainer,\n      previous,\n      next,\n      x0 = this._x0,\n      y0 = this._y0,\n      z0 = this._z0,\n      x1 = this._x1,\n      y1 = this._y1,\n      z1 = this._z1,\n      x,\n      y,\n      z,\n      xm,\n      ym,\n      zm,\n      right,\n      bottom,\n      deep,\n      i,\n      j;\n\n  // If the tree is empty, initialize the root as a leaf.\n  if (!node) return this;\n\n  // Find the leaf node for the point.\n  // While descending, also retain the deepest parent with a non-removed sibling.\n  if (node.length) while (true) {\n    if (right = x >= (xm = (x0 + x1) / 2)) x0 = xm; else x1 = xm;\n    if (bottom = y >= (ym = (y0 + y1) / 2)) y0 = ym; else y1 = ym;\n    if (deep = z >= (zm = (z0 + z1) / 2)) z0 = zm; else z1 = zm;\n    if (!(parent = node, node = node[i = deep << 2 | bottom << 1 | right])) return this;\n    if (!node.length) break;\n    if (parent[(i + 1) & 7] || parent[(i + 2) & 7] || parent[(i + 3) & 7] || parent[(i + 4) & 7] || parent[(i + 5) & 7] || parent[(i + 6) & 7] || parent[(i + 7) & 7]) retainer = parent, j = i;\n  }\n\n  // Find the point to remove.\n  while (node.data !== d) if (!(previous = node, node = node.next)) return this;\n  if (next = node.next) delete node.next;\n\n  // If there are multiple coincident points, remove just the point.\n  if (previous) return (next ? previous.next = next : delete previous.next), this;\n\n  // If this is the root point, remove it.\n  if (!parent) return this._root = next, this;\n\n  // Remove this leaf.\n  next ? parent[i] = next : delete parent[i];\n\n  // If the parent now contains exactly one leaf, collapse superfluous parents.\n  if ((node = parent[0] || parent[1] || parent[2] || parent[3] || parent[4] || parent[5] || parent[6] || parent[7])\n      && node === (parent[7] || parent[6] || parent[5] || parent[4] || parent[3] || parent[2] || parent[1] || parent[0])\n      && !node.length) {\n    if (retainer) retainer[j] = node;\n    else this._root = node;\n  }\n\n  return this;\n}\n\nexport function removeAll(data) {\n  for (var i = 0, n = data.length; i < n; ++i) this.remove(data[i]);\n  return this;\n}\n","export default function() {\n  return this._root;\n}\n","export default function() {\n  var size = 0;\n  this.visit(function(node) {\n    if (!node.length) do ++size; while (node = node.next)\n  });\n  return size;\n}\n","import Octant from \"./octant.js\";\n\nexport default function(callback) {\n  var octs = [], q, node = this._root, child, x0, y0, z0, x1, y1, z1;\n  if (node) octs.push(new Octant(node, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1));\n  while (q = octs.pop()) {\n    if (!callback(node = q.node, x0 = q.x0, y0 = q.y0, z0 = q.z0, x1 = q.x1, y1 = q.y1, z1 = q.z1) && node.length) {\n      var xm = (x0 + x1) / 2, ym = (y0 + y1) / 2, zm = (z0 + z1) / 2;\n      if (child = node[7]) octs.push(new Octant(child, xm, ym, zm, x1, y1, z1));\n      if (child = node[6]) octs.push(new Octant(child, x0, ym, zm, xm, y1, z1));\n      if (child = node[5]) octs.push(new Octant(child, xm, y0, zm, x1, ym, z1));\n      if (child = node[4]) octs.push(new Octant(child, x0, y0, zm, xm, ym, z1));\n      if (child = node[3]) octs.push(new Octant(child, xm, ym, z0, x1, y1, zm));\n      if (child = node[2]) octs.push(new Octant(child, x0, ym, z0, xm, y1, zm));\n      if (child = node[1]) octs.push(new Octant(child, xm, y0, z0, x1, ym, zm));\n      if (child = node[0]) octs.push(new Octant(child, x0, y0, z0, xm, ym, zm));\n    }\n  }\n  return this;\n}\n","import Octant from \"./octant.js\";\n\nexport default function(callback) {\n  var octs = [], next = [], q;\n  if (this._root) octs.push(new Octant(this._root, this._x0, this._y0, this._z0, this._x1, this._y1, this._z1));\n  while (q = octs.pop()) {\n    var node = q.node;\n    if (node.length) {\n      var child, x0 = q.x0, y0 = q.y0, z0 = q.z0, x1 = q.x1, y1 = q.y1, z1 = q.z1, xm = (x0 + x1) / 2, ym = (y0 + y1) / 2, zm = (z0 + z1) / 2;\n      if (child = node[0]) octs.push(new Octant(child, x0, y0, z0, xm, ym, zm));\n      if (child = node[1]) octs.push(new Octant(child, xm, y0, z0, x1, ym, zm));\n      if (child = node[2]) octs.push(new Octant(child, x0, ym, z0, xm, y1, zm));\n      if (child = node[3]) octs.push(new Octant(child, xm, ym, z0, x1, y1, zm));\n      if (child = node[4]) octs.push(new Octant(child, x0, y0, zm, xm, ym, z1));\n      if (child = node[5]) octs.push(new Octant(child, xm, y0, zm, x1, ym, z1));\n      if (child = node[6]) octs.push(new Octant(child, x0, ym, zm, xm, y1, z1));\n      if (child = node[7]) octs.push(new Octant(child, xm, ym, zm, x1, y1, z1));\n    }\n    next.push(q);\n  }\n  while (q = next.pop()) {\n    callback(q.node, q.x0, q.y0, q.z0, q.x1, q.y1, q.z1);\n  }\n  return this;\n}\n","import { Graph as IGraph } from '@antv/graphlib';\nimport { isFunction, isNumber, isObject } from '@antv/util';\nimport type {\n  Edge,\n  ForceLayoutOptions,\n  Graph,\n  LayoutMapping,\n  LayoutWithIterations,\n  Node,\n  OutEdge,\n  OutNode,\n  Point,\n} from '../types';\nimport { formatNumberFn, isArray } from '../util';\nimport { forceNBody } from './forceNBody';\nimport {\n  CalcEdge,\n  CalcEdgeData,\n  CalcGraph,\n  CalcNode,\n  CalcNodeData,\n  FormatedOptions,\n} from './types';\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<ForceLayoutOptions> = {\n  dimensions: 2,\n  maxIteration: 500,\n  gravity: 10,\n  factor: 1,\n  edgeStrength: 50,\n  nodeStrength: 1000,\n  coulombDisScale: 0.005,\n  damping: 0.9,\n  maxSpeed: 200,\n  minMovement: 0.4,\n  interval: 0.02,\n  linkDistance: 200,\n  clusterNodeStrength: 20,\n  preventOverlap: true,\n  distanceThresholdMode: 'mean',\n};\n\n/**\n * Layout with faster force\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new ForceLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new ForceLayout({ center: [100, 100] });\n * const positions = await 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 * await layout.assign(graph, { center: [100, 100] });\n */\nexport class ForceLayout implements LayoutWithIterations<ForceLayoutOptions> {\n  id = 'force';\n  /**\n   * time interval for layout force animations\n   */\n  private timeInterval: number = 0;\n  /**\n   * compare with minMovement to end the nodes' movement\n   */\n  private judgingDistance: number = 0;\n\n  private running: boolean = false;\n  private lastLayoutNodes: OutNode[];\n  private lastLayoutEdges: OutEdge[];\n  private lastAssign: boolean;\n  private lastCalcGraph: IGraph<CalcNodeData, CalcEdgeData>;\n  private lastGraph: Graph;\n  private lastOptions: FormatedOptions;\n  private lastVelMap: {\n    [id: string]: Point;\n  };\n  private lastResult: LayoutMapping;\n\n  constructor(public options: ForceLayoutOptions = {} as ForceLayoutOptions) {\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  async execute(graph: Graph, options?: ForceLayoutOptions) {\n    return this.genericForceLayout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: ForceLayoutOptions) {\n    this.genericForceLayout(true, graph, options);\n  }\n\n  /**\n   * Stop simulation immediately.\n   */\n  stop() {\n    if (this.timeInterval && typeof window !== 'undefined') {\n      window.clearInterval(this.timeInterval);\n    }\n    this.running = false;\n  }\n\n  /**\n   * Manually steps the simulation by the specified number of iterations.\n   * @see https://github.com/d3/d3-force#simulation_tick\n   */\n  tick(iterations = this.options.maxIteration || 1) {\n    if (this.lastResult) {\n      return this.lastResult;\n    }\n\n    for (\n      let i = 0;\n      (this.judgingDistance > this.lastOptions.minMovement || i < 1) &&\n      i < iterations;\n      i++\n    ) {\n      this.runOneStep(\n        this.lastCalcGraph,\n        this.lastGraph,\n        i,\n        this.lastVelMap,\n        this.lastOptions,\n      );\n      this.updatePosition(\n        this.lastGraph,\n        this.lastCalcGraph,\n        this.lastVelMap,\n        this.lastOptions,\n      );\n    }\n\n    const result = {\n      nodes: this.lastLayoutNodes,\n      edges: this.lastLayoutEdges,\n    };\n\n    if (this.lastAssign) {\n      result.nodes.forEach((node) =>\n        this.lastGraph.mergeNodeData(node.id, {\n          x: node.data.x,\n          y: node.data.y,\n          z: this.options.dimensions === 3 ? node.data.z : undefined,\n        }),\n      );\n    }\n\n    return result;\n  }\n\n  private async genericForceLayout(\n    assign: false,\n    graph: Graph,\n    options?: ForceLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericForceLayout(\n    assign: true,\n    graph: Graph,\n    options?: ForceLayoutOptions,\n  ): Promise<void>;\n  private async genericForceLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: ForceLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const mergedOptions = { ...this.options, ...options };\n\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges();\n\n    const formattedOptions = this.formatOptions(mergedOptions, graph);\n    const {\n      dimensions,\n      width,\n      height,\n      nodeSize,\n      getMass,\n      nodeStrength,\n      edgeStrength,\n      linkDistance,\n    } = formattedOptions;\n    // clones the original data and attaches calculation attributes for this layout algorithm\n    const layoutNodes: CalcNode[] = nodes.map((node, i) => {\n      return {\n        ...node,\n        data: {\n          ...node.data,\n          // ...randomDistribution(node, dimensions, 30, i),\n          x: isNumber(node.data.x) ? node.data.x : Math.random() * width,\n          y: isNumber(node.data.y) ? node.data.y : Math.random() * height,\n          z: isNumber(node.data.z)\n            ? node.data.z\n            : Math.random() * Math.sqrt(width * height),\n          size: nodeSize(node) || 30,\n          mass: getMass(node),\n          nodeStrength: nodeStrength(node),\n        },\n      } as CalcNode;\n    });\n    const layoutEdges: CalcEdge[] = edges.map((edge) => ({\n      ...edge,\n      data: {\n        ...edge.data,\n        edgeStrength: edgeStrength(edge),\n        linkDistance: linkDistance(\n          edge,\n          graph.getNode(edge.source),\n          graph.getNode(edge.target),\n        ),\n      },\n    }));\n\n    if (!nodes?.length) {\n      this.lastResult = { nodes: [], edges };\n      return { nodes: [], edges };\n    }\n\n    const velMap: { [id: string]: Point } = {};\n    nodes.forEach((node, i) => {\n      velMap[node.id] = {\n        x: 0,\n        y: 0,\n        z: 0,\n      };\n    });\n\n    const calcGraph = new IGraph<CalcNodeData, CalcEdgeData>({\n      nodes: layoutNodes,\n      edges: layoutEdges,\n    });\n\n    this.formatCentripetal(formattedOptions, calcGraph);\n\n    const { maxIteration, minMovement, onTick } = formattedOptions;\n\n    // Use them later in `tick`.\n    this.lastLayoutNodes = layoutNodes;\n    this.lastLayoutEdges = layoutEdges;\n    this.lastAssign = assign;\n    this.lastGraph = graph;\n    this.lastCalcGraph = calcGraph;\n    this.lastOptions = formattedOptions;\n    this.lastVelMap = velMap;\n\n    if (typeof window === 'undefined') return;\n    let iter = 0;\n\n    return new Promise((resolve) => {\n      // interval for render the result after each iteration\n      this.timeInterval = window.setInterval(() => {\n        if (!nodes || !this.running) {\n          resolve({\n            nodes: formatOutNodes(graph, layoutNodes),\n            edges,\n          });\n        }\n        this.runOneStep(calcGraph, graph, iter, velMap, formattedOptions);\n        this.updatePosition(graph, calcGraph, velMap, formattedOptions);\n        if (assign) {\n          layoutNodes.forEach((node) =>\n            graph.mergeNodeData(node.id, {\n              x: node.data.x,\n              y: node.data.y,\n              z: dimensions === 3 ? node.data.z : undefined,\n            }),\n          );\n        }\n        onTick?.({\n          nodes: formatOutNodes(graph, layoutNodes),\n          edges,\n        });\n        iter++;\n        if (iter >= maxIteration || this.judgingDistance < minMovement) {\n          window.clearInterval(this.timeInterval);\n\n          resolve({\n            nodes: formatOutNodes(graph, layoutNodes),\n            edges,\n          });\n        }\n      }, 0);\n      this.running = true;\n    });\n  }\n\n  /**\n   * Format merged layout options.\n   * @param options merged layout options\n   * @param graph original graph\n   * @returns\n   */\n  private formatOptions(\n    options: ForceLayoutOptions,\n    graph: Graph,\n  ): FormatedOptions {\n    const formattedOptions = { ...options } as FormatedOptions;\n    const {\n      width: propsWidth,\n      height: propsHeight,\n      getMass,\n      nodeSize,\n    } = options;\n\n    // === formating width, height, and center =====\n    formattedOptions.width =\n      !propsWidth && typeof window !== 'undefined'\n        ? window.innerWidth\n        : (propsWidth as number);\n    formattedOptions.height =\n      !propsHeight && typeof window !== 'undefined'\n        ? window.innerHeight\n        : (propsHeight as number);\n    if (!options.center) {\n      formattedOptions.center = [\n        formattedOptions.width / 2,\n        formattedOptions.height / 2,\n      ];\n    }\n\n    // === formating node mass =====\n    if (!getMass) {\n      formattedOptions.getMass = (d?: Node) => {\n        let massWeight = 1;\n        if (isNumber(d?.data.mass)) massWeight = d?.data.mass as number;\n        const degree = graph.getDegree(d!.id, 'both');\n        return !degree || degree < 5 ? massWeight : degree * 5 * massWeight;\n      };\n    }\n\n    // === formating node size =====\n\n    const nodeSpacingFunc = formatNumberFn<Node>(0, options.nodeSpacing);\n    let nodeSizeFn;\n    if (!nodeSize) {\n      nodeSizeFn = (d?: Node) => {\n        const { size } = d?.data || {};\n        if (size) {\n          if (isArray(size)) {\n            return Math.max(size[0], size[1]) + nodeSpacingFunc(d);\n          }\n          if (isObject<{ width: number; height: number }>(size)) {\n            return Math.max(size.width, size.height) + nodeSpacingFunc(d);\n          }\n          return (size as number) + nodeSpacingFunc(d);\n        }\n        return 10 + nodeSpacingFunc(d);\n      };\n    } else if (isFunction(nodeSize)) {\n      nodeSizeFn = (d?: Node) => (nodeSize as Function)(d) + nodeSpacingFunc(d);\n    } else if (isArray(nodeSize)) {\n      nodeSizeFn = (d?: Node) => {\n        const nodeSizeArr = nodeSize as [number, number];\n        return Math.max(nodeSizeArr[0], nodeSizeArr[1]) + nodeSpacingFunc(d);\n      };\n    } else {\n      nodeSizeFn = (d?: Node) => (nodeSize as number) + nodeSpacingFunc(d);\n    }\n    formattedOptions.nodeSize = nodeSizeFn;\n\n    // === formating node / edge strengths =====\n    const linkDistanceFn = options.linkDistance\n      ? formatNumberFn(1, options.linkDistance)\n      : (edge?: Edge) => {\n          return (\n            1 +\n            formattedOptions.nodeSize(graph.getNode(edge!.source)) +\n            formattedOptions.nodeSize(graph.getNode(edge!.target))\n          );\n        };\n    formattedOptions.linkDistance = linkDistanceFn;\n    formattedOptions.nodeStrength = formatNumberFn(1, options.nodeStrength);\n    formattedOptions.edgeStrength = formatNumberFn(1, options.edgeStrength);\n\n    return formattedOptions as FormatedOptions;\n  }\n\n  /**\n   * Format centripetalOption in the option.\n   * @param options merged layout options\n   * @param calcGraph calculation graph\n   */\n  private formatCentripetal(options: FormatedOptions, calcGraph: CalcGraph) {\n    const {\n      dimensions,\n      centripetalOptions,\n      center,\n      clusterNodeStrength,\n      leafCluster,\n      clustering,\n      nodeClusterBy,\n    } = options;\n    const calcNodes = calcGraph.getAllNodes();\n    // === formating centripetalOptions =====\n    const basicCentripetal = centripetalOptions || {\n      leaf: 2,\n      single: 2,\n      others: 1,\n      // eslint-disable-next-line\n      center: (n: any) => {\n        return {\n          x: center[0],\n          y: center[1],\n          z: dimensions === 3 ? center[2] : undefined,\n        };\n      },\n    };\n    if (typeof clusterNodeStrength !== 'function') {\n      options.clusterNodeStrength = (node?: Node) =>\n        clusterNodeStrength as number;\n    }\n    let sameTypeLeafMap: any;\n    let clusters: string[];\n    if (leafCluster && nodeClusterBy) {\n      sameTypeLeafMap = getSameTypeLeafMap(calcGraph, nodeClusterBy);\n      clusters =\n        Array.from(\n          new Set(calcNodes?.map((node) => node.data[nodeClusterBy] as string)),\n        ) || [];\n      // @ts-ignore\n      options.centripetalOptions = Object.assign(basicCentripetal, {\n        single: 100,\n        leaf: (node: Node) => {\n          // 找出与它关联的边的起点或终点出发的所有一度节点中同类型的叶子节点\n          const { siblingLeaves, sameTypeLeaves } =\n            sameTypeLeafMap[node.id] || {};\n          // 如果都是同一类型或者每种类型只有1个，则施加默认向心力\n          if (\n            sameTypeLeaves?.length === siblingLeaves?.length ||\n            clusters?.length === 1\n          ) {\n            return 1;\n          }\n          return options.clusterNodeStrength(node);\n        },\n        others: 1,\n        center: (node: Node) => {\n          const degree = calcGraph.getDegree(node.id, 'both');\n          // 孤点默认给1个远离的中心点\n          if (!degree) {\n            return {\n              x: 100,\n              y: 100,\n              z: 0,\n            };\n          }\n          let centerPos: Point | undefined;\n          if (degree === 1) {\n            // 如果为叶子节点\n            // 找出与它关联的边的起点出发的所有一度节点中同类型的叶子节点\n            const { sameTypeLeaves = [] } = sameTypeLeafMap[node.id] || {};\n            if (sameTypeLeaves.length === 1) {\n              // 如果同类型的叶子节点只有1个，中心位置为undefined\n              centerPos = undefined;\n            } else if (sameTypeLeaves.length > 1) {\n              // 找出同类型节点平均位置作为中心\n              centerPos = getAvgNodePosition(sameTypeLeaves);\n            }\n          } else {\n            centerPos = undefined;\n          }\n          return {\n            x: centerPos?.x!,\n            y: centerPos?.y!,\n            z: centerPos?.z!,\n          };\n        },\n      });\n    }\n    if (clustering && nodeClusterBy) {\n      if (!sameTypeLeafMap) {\n        sameTypeLeafMap = getSameTypeLeafMap(calcGraph, nodeClusterBy);\n      }\n      if (!clusters) {\n        clusters = Array.from(\n          new Set(\n            calcNodes.map((node: Node) => node.data[nodeClusterBy] as string),\n          ),\n        );\n      }\n      clusters = clusters.filter((item) => item !== undefined);\n\n      const centerInfo: { [key: string]: Point } = {};\n      clusters.forEach((cluster) => {\n        const sameTypeNodes = calcNodes\n          .filter((node) => node.data[nodeClusterBy] === cluster)\n          .map((node) => calcGraph.getNode(node.id));\n        // 找出同类型节点平均位置节点的距离最近的节点作为中心节点\n        centerInfo[cluster] = getAvgNodePosition(sameTypeNodes);\n      });\n      options.centripetalOptions = Object.assign(basicCentripetal, {\n        single: (node: Node) => options.clusterNodeStrength(node),\n        leaf: (node: Node) => options.clusterNodeStrength(node),\n        others: (node: Node) => options.clusterNodeStrength(node),\n        center: (node: Node) => {\n          // 找出同类型节点平均位置节点的距离最近的节点作为中心节点\n          const centerPos = centerInfo[node.data[nodeClusterBy] as string];\n          return {\n            x: centerPos?.x!,\n            y: centerPos?.y!,\n            z: centerPos?.z!,\n          };\n        },\n      });\n    }\n    const { leaf, single, others } = options.centripetalOptions || {};\n    if (leaf && typeof leaf !== 'function') {\n      options.centripetalOptions.leaf = () => leaf;\n    }\n    if (single && typeof single !== 'function') {\n      options.centripetalOptions.single = () => single;\n    }\n    if (others && typeof others !== 'function') {\n      options.centripetalOptions.others = () => others;\n    }\n  }\n\n  /**\n   * One iteration.\n   * @param calcGraph calculation graph\n   * @param graph origin graph\n   * @param iter current iteration index\n   * @param velMap nodes' velocity map\n   * @param options formatted layout options\n   * @returns\n   */\n  private runOneStep(\n    calcGraph: CalcGraph,\n    graph: Graph,\n    iter: number,\n    velMap: { [id: string]: Point },\n    options: FormatedOptions,\n  ) {\n    const accMap: { [id: string]: Point } = {};\n    const calcNodes = calcGraph.getAllNodes();\n    const calcEdges = calcGraph.getAllEdges();\n    if (!calcNodes?.length) return;\n    const { monitor } = options;\n    this.calRepulsive(calcGraph, accMap, options);\n    if (calcEdges) this.calAttractive(calcGraph, accMap, options);\n    this.calGravity(calcGraph, graph, accMap, options);\n    this.updateVelocity(calcGraph, accMap, velMap, options);\n\n    /** 如果需要监控信息，则提供给用户 */\n    if (monitor) {\n      const energy = this.calTotalEnergy(accMap, calcNodes);\n      monitor({\n        energy,\n        nodes: graph.getAllNodes(),\n        edges: graph.getAllEdges(),\n        iterations: iter,\n      });\n    }\n  }\n\n  /**\n   * Calculate graph energy for monitoring convergence.\n   * @param accMap acceleration map\n   * @param nodes calculation nodes\n   * @returns energy\n   */\n  private calTotalEnergy(accMap: { [id: string]: Point }, nodes: CalcNode[]) {\n    if (!nodes?.length) return 0;\n    let energy = 0.0;\n\n    nodes.forEach((node, i) => {\n      const vx = accMap[node.id].x;\n      const vy = accMap[node.id].y;\n      const vz = this.options.dimensions === 3 ? accMap[node.id].z : 0;\n      const speed2 = vx * vx + vy * vy + vz * vz;\n      const { mass = 1 } = node.data;\n      energy += mass * speed2 * 0.5; // p = 1/2*(mv^2)\n    });\n\n    return energy;\n  }\n\n  /**\n   * Calculate the repulsive forces according to coulombs law.\n   * @param calcGraph calculation graph\n   * @param accMap acceleration map\n   * @param options formatted layout options\n   */\n  public calRepulsive(\n    calcGraph: CalcGraph,\n    accMap: { [id: string]: Point },\n    options: FormatedOptions,\n  ) {\n    const { dimensions, factor, coulombDisScale } = options;\n    forceNBody(\n      calcGraph,\n      factor,\n      coulombDisScale * coulombDisScale,\n      accMap,\n      dimensions,\n    );\n  }\n\n  /**\n   * Calculate the attractive forces according to hooks law.\n   * @param calcGraph calculation graph\n   * @param accMap acceleration map\n   */\n  public calAttractive(\n    calcGraph: CalcGraph,\n    accMap: { [id: string]: Point },\n    options: FormatedOptions,\n  ) {\n    const { dimensions, nodeSize } = options;\n    calcGraph.getAllEdges().forEach((edge, i) => {\n      const { source, target } = edge;\n      const sourceNode = calcGraph.getNode(source);\n      const targetNode = calcGraph.getNode(target);\n      if (!sourceNode || !targetNode) return;\n      let vecX = targetNode.data.x - sourceNode.data.x;\n      let vecY = targetNode.data.y - sourceNode.data.y;\n      let vecZ = dimensions === 3 ? targetNode.data.z - sourceNode.data.z : 0;\n      if (!vecX && !vecY) {\n        vecX = Math.random() * 0.01;\n        vecY = Math.random() * 0.01;\n\n        if (dimensions === 3 && !vecZ) {\n          vecZ = Math.random() * 0.01;\n        }\n      }\n      const vecLength = Math.sqrt(vecX * vecX + vecY * vecY + vecZ * vecZ);\n      if (vecLength < nodeSize(sourceNode) + nodeSize(targetNode)) return;\n      const direX = vecX / vecLength;\n      const direY = vecY / vecLength;\n      const direZ = vecZ / vecLength;\n      const { linkDistance = 200, edgeStrength = 200 } = edge.data || {};\n      const diff = linkDistance - vecLength;\n      const param = diff * edgeStrength;\n      const massSource = sourceNode.data.mass || 1;\n      const massTarget = targetNode.data.mass || 1;\n      // 质量占比越大，对另一端影响程度越大\n      const sourceMassRatio = 1 / massSource;\n      const targetMassRatio = 1 / massTarget;\n      const disX = direX * param;\n      const disY = direY * param;\n      const disZ = direZ * param;\n      accMap[source].x -= disX * sourceMassRatio;\n      accMap[source].y -= disY * sourceMassRatio;\n      accMap[source].z -= disZ * sourceMassRatio;\n      accMap[target].x += disX * targetMassRatio;\n      accMap[target].y += disY * targetMassRatio;\n      accMap[target].z += disZ * targetMassRatio;\n    });\n  }\n\n  /**\n   * Calculate the gravity forces toward center.\n   * @param calcGraph calculation graph\n   * @param graph origin graph\n   * @param accMap acceleration map\n   * @param options formatted layout options\n   */\n  public calGravity(\n    calcGraph: CalcGraph,\n    graph: Graph,\n    accMap: { [id: string]: Point },\n    options: FormatedOptions,\n  ) {\n    const { getCenter } = options;\n    const calcNodes = calcGraph.getAllNodes();\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges();\n    const {\n      width,\n      height,\n      center,\n      gravity: defaultGravity,\n      centripetalOptions,\n    } = options;\n    if (!calcNodes) return;\n    calcNodes.forEach((calcNode) => {\n      const { id, data } = calcNode;\n      const { mass, x, y, z } = data;\n      const node = graph.getNode(id);\n      let vecX = 0;\n      let vecY = 0;\n      let vecZ = 0;\n      let gravity = defaultGravity;\n      const inDegree = calcGraph.getDegree(id, 'in');\n      const outDegree = calcGraph.getDegree(id, 'out');\n      const degree = calcGraph.getDegree(id, 'both');\n      const forceCenter = getCenter?.(node, degree);\n      if (forceCenter) {\n        const [centerX, centerY, strength] = forceCenter;\n        vecX = x - centerX;\n        vecY = y - centerY;\n        gravity = strength;\n      } else {\n        vecX = x - center[0];\n        vecY = y - center[1];\n        vecZ = z - center[2];\n      }\n\n      if (gravity) {\n        accMap[id].x -= (gravity * vecX) / mass;\n        accMap[id].y -= (gravity * vecY) / mass;\n        accMap[id].z -= (gravity * vecZ) / mass;\n      }\n\n      if (centripetalOptions) {\n        const {\n          leaf,\n          single,\n          others,\n          center: centriCenter,\n        } = centripetalOptions;\n        const {\n          x: centriX,\n          y: centriY,\n          z: centriZ,\n          centerStrength,\n        } = centriCenter?.(node, nodes, edges, width, height) || {\n          x: 0,\n          y: 0,\n          z: 0,\n          centerStrength: 0,\n        };\n        if (!isNumber(centriX) || !isNumber(centriY)) return;\n        const vx = (x - centriX) / mass;\n        const vy = (y - centriY) / mass;\n        const vz = (z - centriZ) / mass;\n        if (centerStrength) {\n          accMap[id].x -= centerStrength * vx;\n          accMap[id].y -= centerStrength * vy;\n          accMap[id].z -= centerStrength * vz;\n        }\n\n        // 孤点\n        if (degree === 0) {\n          const singleStrength = single(node);\n          if (!singleStrength) return;\n          accMap[id].x -= singleStrength * vx;\n          accMap[id].y -= singleStrength * vy;\n          accMap[id].z -= singleStrength * vz;\n          return;\n        }\n\n        // 没有出度或没有入度，都认为是叶子节点\n        if (inDegree === 0 || outDegree === 0) {\n          const leafStrength = leaf(node, nodes, edges);\n          if (!leafStrength) return;\n          accMap[id].x -= leafStrength * vx;\n          accMap[id].y -= leafStrength * vy;\n          accMap[id].z -= leafStrength * vz;\n          return;\n        }\n\n        /** others */\n        const othersStrength = others(node);\n        if (!othersStrength) return;\n        accMap[id].x -= othersStrength * vx;\n        accMap[id].y -= othersStrength * vy;\n        accMap[id].z -= othersStrength * vz;\n      }\n    });\n  }\n\n  /**\n   * Update the velocities for nodes.\n   * @param calcGraph calculation graph\n   * @param accMap acceleration map\n   * @param velMap velocity map\n   * @param options formatted layout options\n   * @returns\n   */\n  public updateVelocity(\n    calcGraph: CalcGraph,\n    accMap: { [id: string]: Point },\n    velMap: { [id: string]: Point },\n    options: FormatedOptions,\n  ) {\n    const { damping, maxSpeed, interval, dimensions } = options;\n    const calcNodes = calcGraph.getAllNodes();\n    if (!calcNodes?.length) return;\n    calcNodes.forEach((calcNode) => {\n      const { id } = calcNode;\n      let vx = (velMap[id].x + accMap[id].x * interval) * damping || 0.01;\n      let vy = (velMap[id].y + accMap[id].y * interval) * damping || 0.01;\n      let vz =\n        dimensions === 3\n          ? (velMap[id].z + accMap[id].z * interval) * damping || 0.01\n          : 0.0;\n      const vLength = Math.sqrt(vx * vx + vy * vy + vz * vz);\n      if (vLength > maxSpeed) {\n        const param2 = maxSpeed / vLength;\n        vx = param2 * vx;\n        vy = param2 * vy;\n        vz = param2 * vz;\n      }\n      velMap[id] = {\n        x: vx,\n        y: vy,\n        z: vz,\n      };\n    });\n  }\n\n  /**\n   * Update nodes' positions.\n   * @param graph origin graph\n   * @param calcGraph calculatition graph\n   * @param velMap velocity map\n   * @param options formatted layou options\n   * @returns\n   */\n  public updatePosition(\n    graph: Graph,\n    calcGraph: CalcGraph,\n    velMap: { [id: string]: Point },\n    options: FormatedOptions,\n  ) {\n    const { distanceThresholdMode, interval, dimensions } = options;\n    const calcNodes = calcGraph.getAllNodes();\n    if (!calcNodes?.length) {\n      this.judgingDistance = 0;\n      return;\n    }\n    let sum = 0;\n    if (distanceThresholdMode === 'max') this.judgingDistance = -Infinity;\n    else if (distanceThresholdMode === 'min') this.judgingDistance = Infinity;\n\n    calcNodes.forEach((calcNode: CalcNode) => {\n      const { id } = calcNode;\n      const node = graph.getNode(id);\n      if (isNumber(node.data.fx) && isNumber(node.data.fy)) {\n        calcGraph.mergeNodeData(id, {\n          x: node.data.fx,\n          y: node.data.fy,\n          z: dimensions === 3 ? (node.data.fz as number) : undefined,\n        });\n        return;\n      }\n      const distX = velMap[id].x * interval;\n      const distY = velMap[id].y * interval;\n      const distZ = dimensions === 3 ? velMap[id].z * interval : 0.0;\n      calcGraph.mergeNodeData(id, {\n        x: calcNode.data.x + distX,\n        y: calcNode.data.y + distY,\n        z: calcNode.data.z + distZ,\n      });\n\n      const distanceMagnitude = Math.sqrt(\n        distX * distX + distY * distY + distZ * distZ,\n      );\n      switch (distanceThresholdMode) {\n        case 'max':\n          if (this.judgingDistance < distanceMagnitude) {\n            this.judgingDistance = distanceMagnitude;\n          }\n          break;\n        case 'min':\n          if (this.judgingDistance > distanceMagnitude) {\n            this.judgingDistance = distanceMagnitude;\n          }\n          break;\n        default:\n          sum = sum + distanceMagnitude;\n          break;\n      }\n    });\n    if (!distanceThresholdMode || distanceThresholdMode === 'mean') {\n      this.judgingDistance = sum / calcNodes.length;\n    }\n  }\n}\n\ntype SameTypeLeafMap = {\n  [nodeId: string]: {\n    coreNode: Node;\n    siblingLeaves: Node[];\n    sameTypeLeaves: Node[];\n  };\n};\n\n/**\n * Group the leaf nodes according to nodeClusterBy field.\n * @param calcGraph calculation graph\n * @param nodeClusterBy the field name in node.data to ditinguish different node clusters\n * @returns related same group leaf nodes for each leaf node\n */\nconst getSameTypeLeafMap = (\n  calcGraph: CalcGraph,\n  nodeClusterBy: string,\n): SameTypeLeafMap => {\n  const calcNodes = calcGraph.getAllNodes();\n  if (!calcNodes?.length) return {};\n  const sameTypeLeafMap: SameTypeLeafMap = {};\n  calcNodes.forEach((node, i) => {\n    const degree = calcGraph.getDegree(node.id, 'both');\n    if (degree === 1) {\n      sameTypeLeafMap[node.id] = getCoreNodeAndSiblingLeaves(\n        calcGraph,\n        'leaf',\n        node,\n        nodeClusterBy,\n      );\n    }\n  });\n  return sameTypeLeafMap;\n};\n\n/**\n * Find the successor or predecessor of node as coreNode, the sibling leaf nodes\n * @param calcGraph calculation graph\n * @param type ('all') filter out the not-same-cluster nodes, ('leaf') or filter out the not-leaf nodes in the same time\n * @param node the target node\n * @param nodeClusterBy the field name in node.data to ditinguish different node clusters\n * @returns coreNode, sibling leaf nodes, and grouped sibling leaf nodes\n */\nconst getCoreNodeAndSiblingLeaves = (\n  calcGraph: CalcGraph,\n  type: 'leaf' | 'all',\n  node: Node,\n  nodeClusterBy: string,\n): {\n  coreNode: Node;\n  siblingLeaves: Node[];\n  sameTypeLeaves: Node[];\n} => {\n  const inDegree = calcGraph.getDegree(node.id, 'in');\n  const outDegree = calcGraph.getDegree(node.id, 'out');\n  // node is not a leaf, coreNode is itself, siblingLeaves is empty\n  let coreNode: Node = node;\n  let siblingLeaves: Node[] = [];\n  if (inDegree === 0) {\n    // node is a leaf node without out edges, its related(successor) node is coreNode, siblingLeaves is the neighbors of its related node\n    coreNode = calcGraph.getSuccessors(node.id)[0];\n    siblingLeaves = calcGraph.getNeighbors(coreNode.id);\n  } else if (outDegree === 0) {\n    // node is a leaf node without in edges, its related(predecessor) node is coreNode, siblingLeaves is the neighbors of its related node\n    coreNode = calcGraph.getPredecessors(node.id)[0];\n    siblingLeaves = calcGraph.getNeighbors(coreNode.id);\n  }\n  // siblingLeaves are leaf nodes\n  siblingLeaves = siblingLeaves.filter(\n    (node) =>\n      calcGraph.getDegree(node.id, 'in') === 0 ||\n      calcGraph.getDegree(node.id, 'out') === 0,\n  );\n  const sameTypeLeaves = getSameTypeNodes(\n    calcGraph,\n    type,\n    nodeClusterBy,\n    node,\n    siblingLeaves,\n  );\n  return { coreNode, siblingLeaves, sameTypeLeaves };\n};\n\n/**\n * Find the same type (according to nodeClusterBy field) of node in relativeNodes.\n * @param calcGraph calculation graph\n * @param type ('all') filter out the not-same-cluster nodes, ('leaf') or filter out the not-leaf nodes in the same time\n * @param nodeClusterBy the field name in node.data to ditinguish different node clusters\n * @param node the target node\n * @param relativeNodes node's related ndoes to be filtered\n * @returns related nodes that meet the filtering conditions\n */\nconst getSameTypeNodes = (\n  calcGraph: CalcGraph,\n  type: 'leaf' | 'all',\n  nodeClusterBy: string,\n  node: Node,\n  relativeNodes: Node[],\n) => {\n  const typeName = node.data[nodeClusterBy] || '';\n  let sameTypeNodes =\n    relativeNodes?.filter((item) => item.data[nodeClusterBy] === typeName) ||\n    [];\n  if (type === 'leaf') {\n    sameTypeNodes = sameTypeNodes.filter(\n      (item) =>\n        calcGraph.getDegree(item.id, 'in') === 0 ||\n        calcGraph.getDegree(item.id, 'out') === 0,\n    );\n  }\n  return sameTypeNodes;\n};\n\n/**\n * Get the average position of nodes.\n * @param nodes nodes set\n * @returns average ppsition\n */\nconst getAvgNodePosition = (nodes: CalcNode[]): Point => {\n  const totalNodes = { x: 0, y: 0 };\n  nodes.forEach((node) => {\n    const { x, y } = node.data;\n    totalNodes.x += x || 0;\n    totalNodes.y += 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/**\n * Format the output nodes from CalcNode[].\n * @param graph origin graph\n * @param layoutNodes calculation nodes\n * @returns output nodes\n */\nconst formatOutNodes = (graph: Graph, layoutNodes: CalcNode[]): OutNode[] =>\n  layoutNodes.map((calcNode) => {\n    const { id, data } = calcNode;\n    const node = graph.getNode(id);\n    return {\n      ...node,\n      data: {\n        ...node.data,\n        x: data.x,\n        y: data.y,\n        z: data.z,\n      },\n    } as OutNode;\n  });\n","import * as matrix from './matrix.js';\n\nexport const AbstractMatrix = matrix.AbstractMatrix;\nexport const CHO = matrix.CHO;\nexport const CholeskyDecomposition = matrix.CholeskyDecomposition;\nexport const DistanceMatrix = matrix.DistanceMatrix;\nexport const EVD = matrix.EVD;\nexport const EigenvalueDecomposition = matrix.EigenvalueDecomposition;\nexport const LU = matrix.LU;\nexport const LuDecomposition = matrix.LuDecomposition;\nexport const Matrix = matrix.Matrix;\nexport const MatrixColumnSelectionView = matrix.MatrixColumnSelectionView;\nexport const MatrixColumnView = matrix.MatrixColumnView;\nexport const MatrixFlipColumnView = matrix.MatrixFlipColumnView;\nexport const MatrixFlipRowView = matrix.MatrixFlipRowView;\nexport const MatrixRowSelectionView = matrix.MatrixRowSelectionView;\nexport const MatrixRowView = matrix.MatrixRowView;\nexport const MatrixSelectionView = matrix.MatrixSelectionView;\nexport const MatrixSubView = matrix.MatrixSubView;\nexport const MatrixTransposeView = matrix.MatrixTransposeView;\nexport const NIPALS = matrix.NIPALS;\nexport const Nipals = matrix.Nipals;\nexport const QR = matrix.QR;\nexport const QrDecomposition = matrix.QrDecomposition;\nexport const SVD = matrix.SVD;\nexport const SingularValueDecomposition = matrix.SingularValueDecomposition;\nexport const SymmetricMatrix = matrix.SymmetricMatrix;\nexport const WrapperMatrix1D = matrix.WrapperMatrix1D;\nexport const WrapperMatrix2D = matrix.WrapperMatrix2D;\nexport const correlation = matrix.correlation;\nexport const covariance = matrix.covariance;\nexport default matrix.default.Matrix ? matrix.default.Matrix : matrix.Matrix;\nexport const determinant = matrix.determinant;\nexport const inverse = matrix.inverse;\nexport const linearDependencies = matrix.linearDependencies;\nexport const pseudoInverse = matrix.pseudoInverse;\nexport const solve = matrix.solve;\nexport const wrap = matrix.wrap;\n","import { Graph } from '@antv/graphlib';\nimport { isNumber } from '@antv/util';\nimport type { Matrix, Edge, Node, OutNode, Point } from '../types';\nimport { isArray } from './array';\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 = (\n  data: { nodes: Node[]; edges: Edge[] },\n  directed: boolean,\n): 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 * 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 * calculate the euclidean distance form p1 to p2\n * @param p1\n * @param p2\n * @returns\n */\nexport const getEuclideanDistance = (p1: Point, p2: Point) =>\n  Math.sqrt((p1.x - p2.x) * (p1.x - p2.x) + (p1.y - p2.y) * (p1.y - p2.y));\n\n/**\n * Depth first search begin from nodes in graphCore data.\n * @param graphCore graphlib data structure\n * @param nodes begin nodes\n * @param fn will be called while visiting each node\n * @param mode 'TB' - visit from top to bottom; 'BT' - visit from bottom to top;\n * @returns\n */\nexport const graphTreeDfs = (\n  graph: Graph<any, any>,\n  nodes: Node[],\n  fn: (n: Node) => void,\n  mode: 'TB' | 'BT' = 'TB',\n  treeKey: string,\n  stopFns: {\n    stopBranchFn?: (node: Node) => boolean;\n    stopAllFn?: (node: Node) => boolean;\n  } = {},\n) => {\n  if (!nodes?.length) return;\n  const { stopBranchFn, stopAllFn } = stopFns;\n  for (let i = 0; i < nodes.length; i++) {\n    const node = nodes[i];\n    if (!graph.hasNode(node.id)) continue;\n    if (stopBranchFn?.(node)) continue; // Stop this branch\n    if (stopAllFn?.(node)) return; // Stop all\n    if (mode === 'TB') fn(node); // Traverse from top to bottom\n    graphTreeDfs(\n      graph,\n      graph.getChildren(node.id, treeKey),\n      fn,\n      mode,\n      treeKey,\n      stopFns,\n    );\n    if (mode !== 'TB') fn(node); // Traverse from bottom to top\n  }\n};\n","import { Matrix as MLMatrix, SingularValueDecomposition } from 'ml-matrix';\nimport type {\n  Graph,\n  Layout,\n  LayoutMapping,\n  Matrix,\n  MDSLayoutOptions,\n  OutNode,\n  PointTuple,\n} from './types';\nimport {\n  cloneFormatData,\n  floydWarshall,\n  getAdjMatrix,\n  scaleMatrix,\n} from './util';\nimport { handleSingleNodeGraph } from './util/common';\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 = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new MDSLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph, { rows: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { center: [100, 100] });\n */\nexport class MDSLayout implements Layout<MDSLayoutOptions> {\n  id = 'mds';\n\n  constructor(public options: MDSLayoutOptions = {} as MDSLayoutOptions) {\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  async execute(graph: Graph, options?: MDSLayoutOptions) {\n    return this.genericMDSLayout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: MDSLayoutOptions) {\n    this.genericMDSLayout(true, graph, options);\n  }\n\n  private async genericMDSLayout(\n    assign: false,\n    graph: Graph,\n    options?: MDSLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericMDSLayout(\n    assign: true,\n    graph: Graph,\n    options?: MDSLayoutOptions,\n  ): Promise<void>;\n  private async genericMDSLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: MDSLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const mergedOptions = { ...this.options, ...options };\n    const { center = [0, 0], linkDistance = 50 } = mergedOptions;\n\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges();\n\n    if (!nodes?.length || nodes.length === 1) {\n      return handleSingleNodeGraph(graph, assign, center);\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 = cloneFormatData(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\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).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])\n      .toJSON()[0]\n      .splice(0, dimension) as PointTuple;\n  });\n};\n","import { Graph as GraphCore, ID } from '@antv/graphlib';\nimport { isFunction, isNumber, isObject } from '@antv/util';\nimport { ConcentricLayout } from './concentric';\nimport { ForceLayout } from './force';\nimport { MDSLayout } from './mds';\nimport type {\n  ComboCombinedLayoutOptions,\n  Edge,\n  Graph,\n  Layout,\n  LayoutMapping,\n  Node,\n  OutNode,\n} from './types';\nimport { getLayoutBBox, graphTreeDfs, isArray } from './util';\nimport { handleSingleNodeGraph } from './util/common';\n\nconst FORCE_LAYOUT_TYPE_MAP: { [key: string]: boolean } = {\n  gForce: true,\n  force2: true,\n  d3force: true,\n  fruchterman: true,\n  forceAtlas2: true,\n  force: true,\n  'graphin-force': true,\n};\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<ComboCombinedLayoutOptions> = {\n  center: [0, 0],\n  comboPadding: 10,\n  treeKey: 'combo',\n};\n\n/**\n * Layout arranging the nodes and combos with combination of inner and outer layouts.\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new ComboCombinedLayout({});\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new ComboCombinedLayout({ radius: 10 });\n * const positions = await layout.execute(graph, { radius: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { radius: 20 });\n */\nexport class ComboCombinedLayout implements Layout<ComboCombinedLayoutOptions> {\n  id = 'comboCombined';\n\n  constructor(\n    public options: ComboCombinedLayoutOptions = {} as ComboCombinedLayoutOptions,\n  ) {\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  async execute(graph: Graph, options?: ComboCombinedLayoutOptions) {\n    return this.genericComboCombinedLayout(false, graph, options);\n  }\n\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: ComboCombinedLayoutOptions) {\n    await this.genericComboCombinedLayout(true, graph, options);\n  }\n\n  private async genericComboCombinedLayout(\n    assign: false,\n    graph: Graph,\n    options?: ComboCombinedLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericComboCombinedLayout(\n    assign: true,\n    graph: Graph,\n    options?: ComboCombinedLayoutOptions,\n  ): Promise<void>;\n  private async genericComboCombinedLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: ComboCombinedLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const mergedOptions = this.initVals({ ...this.options, ...options });\n    const { center, treeKey, outerLayout: propsOuterLayout } = mergedOptions;\n\n    const nodes: Node[] = graph\n      .getAllNodes()\n      .filter((node) => !node.data._isCombo);\n    const combos: Node[] = graph\n      .getAllNodes()\n      .filter((node) => node.data._isCombo);\n    const edges: Edge[] = graph.getAllEdges();\n\n    const n = nodes?.length;\n    if (!n || n === 1) {\n      return handleSingleNodeGraph(graph, assign, center);\n    }\n\n    // output nodes\n    const layoutNodes: OutNode[] = [];\n\n    const nodeMap: Map<ID, Node> = new Map();\n    nodes.forEach((node) => {\n      nodeMap.set(node.id, node);\n    });\n    const comboMap: Map<ID, Node> = new Map();\n    combos.forEach((combo) => {\n      comboMap.set(combo.id, combo);\n    });\n\n    // each one in comboNodes is a combo contains the size and child nodes\n    // comboNodes ncludes the node who has no parent combo\n    const comboNodes: Map<ID, Node> = new Map();\n    // the inner layouts, the result positions are stored in comboNodes and their child nodes\n    const innerGraphLayoutPromises = this.getInnerGraphs(\n      graph,\n      treeKey,\n      nodeMap,\n      comboMap,\n      edges,\n      mergedOptions,\n      comboNodes,\n    );\n    await Promise.all(innerGraphLayoutPromises);\n\n    const outerNodeIds: Map<ID, boolean> = new Map();\n    const outerLayoutNodes: Node[] = [];\n    const nodeAncestorIdMap: Map<ID, ID> = new Map();\n    let allHaveNoPosition = true;\n    graph.getRoots(treeKey).forEach((root: Node) => {\n      const combo = comboNodes.get(root.id);\n      const cacheCombo = comboMap.get(root.id) || nodeMap.get(root.id);\n      const comboLayoutNode = {\n        id: root.id,\n        data: {\n          ...root.data,\n          x: combo.data.x || cacheCombo.data.x,\n          y: combo.data.y || cacheCombo.data.y,\n          fx: combo.data.fx || cacheCombo.data.fx,\n          fy: combo.data.fy || cacheCombo.data.fy,\n          mass: combo.data.mass || cacheCombo.data.mass,\n          size: combo.data.size,\n        },\n      };\n      outerLayoutNodes.push(comboLayoutNode);\n      outerNodeIds.set(root.id, true);\n      if (\n        !isNaN(comboLayoutNode.data.x) &&\n        comboLayoutNode.data.x !== 0 &&\n        !isNaN(comboLayoutNode.data.y) &&\n        comboLayoutNode.data.y !== 0\n      ) {\n        allHaveNoPosition = false;\n      } else {\n        comboLayoutNode.data.x = Math.random() * 100;\n        comboLayoutNode.data.y = Math.random() * 100;\n      }\n      graphTreeDfs(\n        graph,\n        [root],\n        (child) => {\n          if (child.id !== root.id) nodeAncestorIdMap.set(child.id, root.id);\n        },\n        'TB',\n        treeKey,\n      );\n    });\n\n    const outerLayoutEdges: any = [];\n    edges.forEach((edge) => {\n      const sourceAncestorId =\n        nodeAncestorIdMap.get(edge.source) || edge.source;\n      const targetAncestorId =\n        nodeAncestorIdMap.get(edge.target) || edge.target;\n      // create an edge for outer layout if both source and target's ancestor combo is in outer layout nodes\n      if (\n        sourceAncestorId !== targetAncestorId &&\n        outerNodeIds.has(sourceAncestorId) &&\n        outerNodeIds.has(targetAncestorId)\n      ) {\n        outerLayoutEdges.push({\n          id: edge.id,\n          source: sourceAncestorId,\n          target: targetAncestorId,\n          data: {},\n        });\n      }\n    });\n\n    // 若有需要最外层的 combo 或节点，则对最外层执行力导向\n    let outerPositions: any;\n    if (outerLayoutNodes?.length) {\n      if (outerLayoutNodes.length === 1) {\n        outerLayoutNodes[0].data.x = center[0];\n        outerLayoutNodes[0].data.y = center[1];\n      } else {\n        const outerLayoutGraph = new GraphCore({\n          nodes: outerLayoutNodes,\n          edges: outerLayoutEdges,\n        });\n        const outerLayout = propsOuterLayout || new ForceLayout();\n        // preset the nodes if the outerLayout is a force family layout\n        if (allHaveNoPosition && FORCE_LAYOUT_TYPE_MAP[outerLayout.id]) {\n          const outerLayoutPreset =\n            outerLayoutNodes.length < 100\n              ? new MDSLayout()\n              : new ConcentricLayout();\n          await outerLayoutPreset.assign(outerLayoutGraph);\n        }\n        outerPositions = await outerLayout.execute(outerLayoutGraph, {\n          center,\n          kg: 5,\n          preventOverlap: true,\n          animate: false,\n          ...(outerLayout.id === 'force'\n            ? {\n                gravity: 1,\n                factor: 4,\n                linkDistance: (edge: Edge, source: Node, target: Node) => {\n                  const sourceSize =\n                    Math.max(...(source.data.size as number[])) || 32;\n                  const targetSize =\n                    Math.max(...(target.data.size as number[])) || 32;\n                  return sourceSize / 2 + targetSize / 2 + 200;\n                },\n              }\n            : {}),\n        });\n      }\n\n      // move the combos and their child nodes\n      comboNodes.forEach((comboNode: Node) => {\n        const outerPosition = outerPositions.nodes.find(\n          (pos: Node) => pos.id === comboNode.id,\n        );\n        if (outerPosition) {\n          // if it is one of the outer layout nodes, update the positions\n          const { x, y } = outerPosition.data;\n          comboNode.data.visited = true;\n          comboNode.data.x = x;\n          comboNode.data.y = y;\n          layoutNodes.push({\n            id: comboNode.id,\n            data: { x, y },\n          });\n        }\n        // move the child nodes\n        const { x, y } = comboNode.data;\n        (comboNode.data.nodes as Node[])?.forEach((node: OutNode) => {\n          layoutNodes.push({\n            id: node.id,\n            data: { x: node.data.x + x, y: node.data.y + y },\n          });\n        });\n      });\n      // move the nodes from top to bottom\n      comboNodes.forEach(({ data }: Node) => {\n        const { x, y, visited, nodes } = data;\n        (nodes as Node[])?.forEach((node: OutNode) => {\n          if (!visited) {\n            const layoutNode = layoutNodes.find((n) => n.id === node.id);\n            layoutNode.data.x += x || 0;\n            layoutNode.data.y += y || 0;\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,\n    };\n\n    return result;\n  }\n\n  private initVals(options: ComboCombinedLayoutOptions) {\n    const formattedOptions = { ...options };\n    const { nodeSize, spacing, comboPadding } = options;\n    let nodeSizeFunc: (d: any) => number;\n    let spacingFunc: (d: any) => number;\n\n    // nodeSpacing to function\n    if (isNumber(spacing)) {\n      spacingFunc = () => spacing as any;\n    } else if (isFunction(spacing)) {\n      spacingFunc = spacing;\n    } else {\n      spacingFunc = () => 0;\n    }\n    formattedOptions.spacing = spacingFunc;\n\n    // nodeSize to function\n    if (!nodeSize) {\n      nodeSizeFunc = (d) => {\n        const spacing = spacingFunc(d);\n        if (d.size) {\n          if (isArray(d.size)) {\n            const res = d.size[0] > d.size[1] ? d.size[0] : d.size[1];\n            return (res + spacing) / 2;\n          }\n          if (isObject(d.size)) {\n            const res =\n              d.size.width > d.size.height ? d.size.width : d.size.height;\n            return (res + spacing) / 2;\n          }\n          return (d.size + spacing) / 2;\n        }\n        return 32 + spacing / 2;\n      };\n    } else if (isFunction(nodeSize)) {\n      nodeSizeFunc = (d) => {\n        const size = nodeSize(d);\n        const spacing = spacingFunc(d);\n        if (isArray(d.size)) {\n          const res = d.size[0] > d.size[1] ? d.size[0] : d.size[1];\n          return (res + spacing) / 2;\n        }\n        return ((size || 32) + spacing) / 2;\n      };\n    } else if (isArray(nodeSize)) {\n      const larger = nodeSize[0] > nodeSize[1] ? nodeSize[0] : nodeSize[1];\n      const radius = larger / 2;\n      nodeSizeFunc = (d) => radius + spacingFunc(d) / 2;\n    } else {\n      // number type\n      const radius = nodeSize / 2;\n      nodeSizeFunc = (d) => radius + spacingFunc(d) / 2;\n    }\n    formattedOptions.nodeSize = nodeSizeFunc;\n\n    // comboPadding to function\n    let comboPaddingFunc: (d: any) => number;\n    if (isNumber(comboPadding)) {\n      comboPaddingFunc = () => comboPadding as any;\n    } else if (isArray(comboPadding)) {\n      comboPaddingFunc = () => Math.max.apply(null, comboPadding);\n    } else if (isFunction(comboPadding)) {\n      comboPaddingFunc = comboPadding;\n    } else {\n      // null type\n      comboPaddingFunc = () => 0;\n    }\n    formattedOptions.comboPadding = comboPaddingFunc;\n    return formattedOptions;\n  }\n\n  private getInnerGraphs(\n    graph: Graph,\n    treeKey: string,\n    nodeMap: Map<ID, Node>,\n    comboMap: Map<ID, Node>,\n    edges: Edge[],\n    options: ComboCombinedLayoutOptions,\n    comboNodes: Map<ID, Node>,\n  ): Promise<any>[] {\n    const { nodeSize, comboPadding, spacing, innerLayout } = options;\n\n    const innerGraphLayout: any = innerLayout || new ConcentricLayout({});\n    const innerLayoutOptions = {\n      center: [0, 0],\n      preventOverlap: true,\n      nodeSpacing: spacing,\n    };\n    const innerLayoutPromises: Promise<any>[] = [];\n\n    const getSize = (node: Node) => {\n      // @ts-ignore\n      let padding = comboPadding?.(node) || 10;\n      if (isArray(padding)) padding = Math.max(...padding);\n      return {\n        size: padding ? [padding * 2, padding * 2] : [30, 30],\n        padding,\n      };\n    };\n\n    graph.getRoots(treeKey).forEach((root: any) => {\n      // @ts-ignore\n      comboNodes.set(root.id, {\n        id: root.id,\n        data: {\n          nodes: [],\n          size: getSize(root).size,\n        },\n      });\n\n      let start = Promise.resolve();\n\n      // Regard the child nodes in one combo as a graph, and layout them from bottom to top\n      graphTreeDfs(\n        graph,\n        [root],\n        (treeNode) => {\n          if (!treeNode.data._isCombo) return;\n          const { size: nsize, padding } = getSize(treeNode);\n          if (!graph.getChildren(treeNode.id, treeKey)?.length) {\n            // empty combo\n            comboNodes.set(treeNode.id, {\n              id: treeNode.id,\n              data: {\n                ...treeNode.data,\n                size: nsize,\n              },\n            });\n          } else {\n            // combo not empty\n            const comboNode = comboNodes.get(treeNode.id);\n            comboNodes.set(treeNode.id, {\n              id: treeNode.id,\n              data: {\n                nodes: [],\n                ...comboNode?.data,\n              },\n            });\n            const innerLayoutNodeIds = new Map();\n            const innerLayoutNodes = graph\n              .getChildren(treeNode.id, treeKey)\n              .map((child) => {\n                if (child.data._isCombo) {\n                  if (!comboNodes.has(child.id)) {\n                    comboNodes.set(child.id, {\n                      id: child.id,\n                      data: {\n                        ...child.data,\n                      },\n                    });\n                  }\n                  innerLayoutNodeIds.set(child.id, true);\n                  return comboNodes.get(child.id);\n                }\n                const oriNode = nodeMap.get(child.id) || comboMap.get(child.id);\n                innerLayoutNodeIds.set(child.id, true);\n                return {\n                  id: child.id,\n                  data: {\n                    ...oriNode.data,\n                    ...child.data,\n                  },\n                };\n              });\n            const innerGraphData = {\n              nodes: innerLayoutNodes,\n              edges: edges.filter(\n                (edge) =>\n                  innerLayoutNodeIds.has(edge.source) &&\n                  innerLayoutNodeIds.has(edge.target),\n              ),\n            };\n            let minNodeSize = Infinity;\n            innerLayoutNodes.forEach((node) => {\n              let { size } = node.data;\n              if (!size) {\n                size = comboNodes.get(node.id)?.data.size ||\n                  (nodeSize as Function)?.(node) || [30, 30];\n              }\n              if (isNumber(size)) size = [size, size];\n              const [size0, size1] = size;\n              if (minNodeSize > size0) minNodeSize = size0;\n              if (minNodeSize > size1) minNodeSize = size1;\n              node.data.size = size;\n            });\n\n            // innerGraphLayout.assign(innerGraphCore, innerLayoutOptions);\n            start = start.then(async () => {\n              const innerGraphCore = new GraphCore(innerGraphData);\n              const innerLayout = await innerGraphLayout.assign(\n                innerGraphCore,\n                innerLayoutOptions,\n              );\n              const { minX, minY, maxX, maxY } = getLayoutBBox(\n                innerLayoutNodes as OutNode[],\n              );\n              // move the innerGraph to [0, 0], for later controled by parent layout\n              const center = { x: (maxX + minX) / 2, y: (maxY + minY) / 2 };\n              innerGraphData.nodes.forEach((node) => {\n                node.data.x -= center.x;\n                node.data.y -= center.y;\n              });\n              const size: [number, number] = [\n                Math.max(maxX - minX, minNodeSize) + padding * 2,\n                Math.max(maxY - minY, minNodeSize) + padding * 2,\n              ];\n\n              comboNodes.get(treeNode.id).data.size = size;\n              comboNodes.get(treeNode.id).data.nodes = innerLayoutNodes;\n              return innerLayout;\n            });\n          }\n          return true;\n        },\n        'BT',\n        treeKey,\n      );\n      innerLayoutPromises.push(start);\n    });\n    return innerLayoutPromises;\n  }\n}\n","export default function(x) {\n  return function() {\n    return x;\n  };\n}\n","export default function(random) {\n  return (random() - 0.5) * 1e-6;\n}\n","var noop = {value: () => {}};\n\nfunction dispatch() {\n  for (var i = 0, n = arguments.length, _ = {}, t; i < n; ++i) {\n    if (!(t = arguments[i] + \"\") || (t in _) || /[\\s.]/.test(t)) throw new Error(\"illegal type: \" + t);\n    _[t] = [];\n  }\n  return new Dispatch(_);\n}\n\nfunction Dispatch(_) {\n  this._ = _;\n}\n\nfunction parseTypenames(typenames, types) {\n  return typenames.trim().split(/^|\\s+/).map(function(t) {\n    var name = \"\", i = t.indexOf(\".\");\n    if (i >= 0) name = t.slice(i + 1), t = t.slice(0, i);\n    if (t && !types.hasOwnProperty(t)) throw new Error(\"unknown type: \" + t);\n    return {type: t, name: name};\n  });\n}\n\nDispatch.prototype = dispatch.prototype = {\n  constructor: Dispatch,\n  on: function(typename, callback) {\n    var _ = this._,\n        T = parseTypenames(typename + \"\", _),\n        t,\n        i = -1,\n        n = T.length;\n\n    // If no callback was specified, return the callback of the given type and name.\n    if (arguments.length < 2) {\n      while (++i < n) if ((t = (typename = T[i]).type) && (t = get(_[t], typename.name))) return t;\n      return;\n    }\n\n    // If a type was specified, set the callback for the given type and name.\n    // Otherwise, if a null callback was specified, remove callbacks of the given name.\n    if (callback != null && typeof callback !== \"function\") throw new Error(\"invalid callback: \" + callback);\n    while (++i < n) {\n      if (t = (typename = T[i]).type) _[t] = set(_[t], typename.name, callback);\n      else if (callback == null) for (t in _) _[t] = set(_[t], typename.name, null);\n    }\n\n    return this;\n  },\n  copy: function() {\n    var copy = {}, _ = this._;\n    for (var t in _) copy[t] = _[t].slice();\n    return new Dispatch(copy);\n  },\n  call: function(type, that) {\n    if ((n = arguments.length - 2) > 0) for (var args = new Array(n), i = 0, n, t; i < n; ++i) args[i] = arguments[i + 2];\n    if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n    for (t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n  },\n  apply: function(type, that, args) {\n    if (!this._.hasOwnProperty(type)) throw new Error(\"unknown type: \" + type);\n    for (var t = this._[type], i = 0, n = t.length; i < n; ++i) t[i].value.apply(that, args);\n  }\n};\n\nfunction get(type, name) {\n  for (var i = 0, n = type.length, c; i < n; ++i) {\n    if ((c = type[i]).name === name) {\n      return c.value;\n    }\n  }\n}\n\nfunction set(type, name, callback) {\n  for (var i = 0, n = type.length; i < n; ++i) {\n    if (type[i].name === name) {\n      type[i] = noop, type = type.slice(0, i).concat(type.slice(i + 1));\n      break;\n    }\n  }\n  if (callback != null) type.push({name: name, value: callback});\n  return type;\n}\n\nexport default dispatch;\n","var frame = 0, // is an animation frame pending?\n    timeout = 0, // is a timeout pending?\n    interval = 0, // are any timers active?\n    pokeDelay = 1000, // how frequently we check for clock skew\n    taskHead,\n    taskTail,\n    clockLast = 0,\n    clockNow = 0,\n    clockSkew = 0,\n    clock = typeof performance === \"object\" && performance.now ? performance : Date,\n    setFrame = typeof window === \"object\" && window.requestAnimationFrame ? window.requestAnimationFrame.bind(window) : function(f) { setTimeout(f, 17); };\n\nexport function now() {\n  return clockNow || (setFrame(clearNow), clockNow = clock.now() + clockSkew);\n}\n\nfunction clearNow() {\n  clockNow = 0;\n}\n\nexport function Timer() {\n  this._call =\n  this._time =\n  this._next = null;\n}\n\nTimer.prototype = timer.prototype = {\n  constructor: Timer,\n  restart: function(callback, delay, time) {\n    if (typeof callback !== \"function\") throw new TypeError(\"callback is not a function\");\n    time = (time == null ? now() : +time) + (delay == null ? 0 : +delay);\n    if (!this._next && taskTail !== this) {\n      if (taskTail) taskTail._next = this;\n      else taskHead = this;\n      taskTail = this;\n    }\n    this._call = callback;\n    this._time = time;\n    sleep();\n  },\n  stop: function() {\n    if (this._call) {\n      this._call = null;\n      this._time = Infinity;\n      sleep();\n    }\n  }\n};\n\nexport function timer(callback, delay, time) {\n  var t = new Timer;\n  t.restart(callback, delay, time);\n  return t;\n}\n\nexport function timerFlush() {\n  now(); // Get the current time, if not already set.\n  ++frame; // Pretend we’ve set an alarm, if we haven’t already.\n  var t = taskHead, e;\n  while (t) {\n    if ((e = clockNow - t._time) >= 0) t._call.call(undefined, e);\n    t = t._next;\n  }\n  --frame;\n}\n\nfunction wake() {\n  clockNow = (clockLast = clock.now()) + clockSkew;\n  frame = timeout = 0;\n  try {\n    timerFlush();\n  } finally {\n    frame = 0;\n    nap();\n    clockNow = 0;\n  }\n}\n\nfunction poke() {\n  var now = clock.now(), delay = now - clockLast;\n  if (delay > pokeDelay) clockSkew -= delay, clockLast = now;\n}\n\nfunction nap() {\n  var t0, t1 = taskHead, t2, time = Infinity;\n  while (t1) {\n    if (t1._call) {\n      if (time > t1._time) time = t1._time;\n      t0 = t1, t1 = t1._next;\n    } else {\n      t2 = t1._next, t1._next = null;\n      t1 = t0 ? t0._next = t2 : taskHead = t2;\n    }\n  }\n  taskTail = t0;\n  sleep(time);\n}\n\nfunction sleep(time) {\n  if (frame) return; // Soonest alarm already set, or will be.\n  if (timeout) timeout = clearTimeout(timeout);\n  var delay = time - clockNow; // Strictly less than if we recomputed clockNow.\n  if (delay > 24) {\n    if (time < Infinity) timeout = setTimeout(wake, time - clock.now() - clockSkew);\n    if (interval) interval = clearInterval(interval);\n  } else {\n    if (!interval) clockLast = clock.now(), interval = setInterval(poke, pokeDelay);\n    frame = 1, setFrame(wake);\n  }\n}\n","// https://en.wikipedia.org/wiki/Linear_congruential_generator#Parameters_in_common_use\nconst a = 1664525;\nconst c = 1013904223;\nconst m = 4294967296; // 2^32\n\nexport default function() {\n  let s = 1;\n  return () => (s = (a * s + c) % m) / m;\n}\n","import {dispatch} from \"d3-dispatch\";\nimport {timer} from \"d3-timer\";\nimport lcg from \"./lcg.js\";\n\nexport function x(d) {\n  return d.x;\n}\n\nexport function y(d) {\n  return d.y;\n}\n\nvar initialRadius = 10,\n    initialAngle = Math.PI * (3 - Math.sqrt(5));\n\nexport default function(nodes) {\n  var simulation,\n      alpha = 1,\n      alphaMin = 0.001,\n      alphaDecay = 1 - Math.pow(alphaMin, 1 / 300),\n      alphaTarget = 0,\n      velocityDecay = 0.6,\n      forces = new Map(),\n      stepper = timer(step),\n      event = dispatch(\"tick\", \"end\"),\n      random = lcg();\n\n  if (nodes == null) nodes = [];\n\n  function step() {\n    tick();\n    event.call(\"tick\", simulation);\n    if (alpha < alphaMin) {\n      stepper.stop();\n      event.call(\"end\", simulation);\n    }\n  }\n\n  function tick(iterations) {\n    var i, n = nodes.length, node;\n\n    if (iterations === undefined) iterations = 1;\n\n    for (var k = 0; k < iterations; ++k) {\n      alpha += (alphaTarget - alpha) * alphaDecay;\n\n      forces.forEach(function(force) {\n        force(alpha);\n      });\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        if (node.fx == null) node.x += node.vx *= velocityDecay;\n        else node.x = node.fx, node.vx = 0;\n        if (node.fy == null) node.y += node.vy *= velocityDecay;\n        else node.y = node.fy, node.vy = 0;\n      }\n    }\n\n    return simulation;\n  }\n\n  function initializeNodes() {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.index = i;\n      if (node.fx != null) node.x = node.fx;\n      if (node.fy != null) node.y = node.fy;\n      if (isNaN(node.x) || isNaN(node.y)) {\n        var radius = initialRadius * Math.sqrt(0.5 + i), angle = i * initialAngle;\n        node.x = radius * Math.cos(angle);\n        node.y = radius * Math.sin(angle);\n      }\n      if (isNaN(node.vx) || isNaN(node.vy)) {\n        node.vx = node.vy = 0;\n      }\n    }\n  }\n\n  function initializeForce(force) {\n    if (force.initialize) force.initialize(nodes, random);\n    return force;\n  }\n\n  initializeNodes();\n\n  return simulation = {\n    tick: tick,\n\n    restart: function() {\n      return stepper.restart(step), simulation;\n    },\n\n    stop: function() {\n      return stepper.stop(), simulation;\n    },\n\n    nodes: function(_) {\n      return arguments.length ? (nodes = _, initializeNodes(), forces.forEach(initializeForce), simulation) : nodes;\n    },\n\n    alpha: function(_) {\n      return arguments.length ? (alpha = +_, simulation) : alpha;\n    },\n\n    alphaMin: function(_) {\n      return arguments.length ? (alphaMin = +_, simulation) : alphaMin;\n    },\n\n    alphaDecay: function(_) {\n      return arguments.length ? (alphaDecay = +_, simulation) : +alphaDecay;\n    },\n\n    alphaTarget: function(_) {\n      return arguments.length ? (alphaTarget = +_, simulation) : alphaTarget;\n    },\n\n    velocityDecay: function(_) {\n      return arguments.length ? (velocityDecay = 1 - _, simulation) : 1 - velocityDecay;\n    },\n\n    randomSource: function(_) {\n      return arguments.length ? (random = _, forces.forEach(initializeForce), simulation) : random;\n    },\n\n    force: function(name, _) {\n      return arguments.length > 1 ? ((_ == null ? forces.delete(name) : forces.set(name, initializeForce(_))), simulation) : forces.get(name);\n    },\n\n    find: function(x, y, radius) {\n      var i = 0,\n          n = nodes.length,\n          dx,\n          dy,\n          d2,\n          node,\n          closest;\n\n      if (radius == null) radius = Infinity;\n      else radius *= radius;\n\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        dx = x - node.x;\n        dy = y - node.y;\n        d2 = dx * dx + dy * dy;\n        if (d2 < radius) closest = node, radius = d2;\n      }\n\n      return closest;\n    },\n\n    on: function(name, _) {\n      return arguments.length > 1 ? (event.on(name, _), simulation) : event.on(name);\n    }\n  };\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\nimport {x, y} from \"./simulation.js\";\n\nexport default function() {\n  var nodes,\n      node,\n      random,\n      alpha,\n      strength = constant(-30),\n      strengths,\n      distanceMin2 = 1,\n      distanceMax2 = Infinity,\n      theta2 = 0.81;\n\n  function force(_) {\n    var i, n = nodes.length, tree = quadtree(nodes, x, y).visitAfter(accumulate);\n    for (alpha = _, i = 0; i < n; ++i) node = nodes[i], tree.visit(apply);\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    strengths = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], strengths[node.index] = +strength(node, i, nodes);\n  }\n\n  function accumulate(quad) {\n    var strength = 0, q, c, weight = 0, x, y, i;\n\n    // For internal nodes, accumulate forces from child quadrants.\n    if (quad.length) {\n      for (x = y = i = 0; i < 4; ++i) {\n        if ((q = quad[i]) && (c = Math.abs(q.value))) {\n          strength += q.value, weight += c, x += c * q.x, y += c * q.y;\n        }\n      }\n      quad.x = x / weight;\n      quad.y = y / weight;\n    }\n\n    // For leaf nodes, accumulate forces from coincident quadrants.\n    else {\n      q = quad;\n      q.x = q.data.x;\n      q.y = q.data.y;\n      do strength += strengths[q.data.index];\n      while (q = q.next);\n    }\n\n    quad.value = strength;\n  }\n\n  function apply(quad, x1, _, x2) {\n    if (!quad.value) return true;\n\n    var x = quad.x - node.x,\n        y = quad.y - node.y,\n        w = x2 - x1,\n        l = x * x + y * y;\n\n    // Apply the Barnes-Hut approximation if possible.\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (w * w / theta2 < l) {\n      if (l < distanceMax2) {\n        if (x === 0) x = jiggle(random), l += x * x;\n        if (y === 0) y = jiggle(random), l += y * y;\n        if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n        node.vx += x * quad.value * alpha / l;\n        node.vy += y * quad.value * alpha / l;\n      }\n      return true;\n    }\n\n    // Otherwise, process points directly.\n    else if (quad.length || l >= distanceMax2) return;\n\n    // Limit forces for very close nodes; randomize direction if coincident.\n    if (quad.data !== node || quad.next) {\n      if (x === 0) x = jiggle(random), l += x * x;\n      if (y === 0) y = jiggle(random), l += y * y;\n      if (l < distanceMin2) l = Math.sqrt(distanceMin2 * l);\n    }\n\n    do if (quad.data !== node) {\n      w = strengths[quad.data.index] * alpha / l;\n      node.vx += x * w;\n      node.vy += y * w;\n    } while (quad = quad.next);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.distanceMin = function(_) {\n    return arguments.length ? (distanceMin2 = _ * _, force) : Math.sqrt(distanceMin2);\n  };\n\n  force.distanceMax = function(_) {\n    return arguments.length ? (distanceMax2 = _ * _, force) : Math.sqrt(distanceMax2);\n  };\n\n  force.theta = function(_) {\n    return arguments.length ? (theta2 = _ * _, force) : Math.sqrt(theta2);\n  };\n\n  return force;\n}\n","import constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction index(d) {\n  return d.index;\n}\n\nfunction find(nodeById, nodeId) {\n  var node = nodeById.get(nodeId);\n  if (!node) throw new Error(\"node not found: \" + nodeId);\n  return node;\n}\n\nexport default function(links) {\n  var id = index,\n      strength = defaultStrength,\n      strengths,\n      distance = constant(30),\n      distances,\n      nodes,\n      count,\n      bias,\n      random,\n      iterations = 1;\n\n  if (links == null) links = [];\n\n  function defaultStrength(link) {\n    return 1 / Math.min(count[link.source.index], count[link.target.index]);\n  }\n\n  function force(alpha) {\n    for (var k = 0, n = links.length; k < iterations; ++k) {\n      for (var i = 0, link, source, target, x, y, l, b; i < n; ++i) {\n        link = links[i], source = link.source, target = link.target;\n        x = target.x + target.vx - source.x - source.vx || jiggle(random);\n        y = target.y + target.vy - source.y - source.vy || jiggle(random);\n        l = Math.sqrt(x * x + y * y);\n        l = (l - distances[i]) / l * alpha * strengths[i];\n        x *= l, y *= l;\n        target.vx -= x * (b = bias[i]);\n        target.vy -= y * b;\n        source.vx += x * (b = 1 - b);\n        source.vy += y * b;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n\n    var i,\n        n = nodes.length,\n        m = links.length,\n        nodeById = new Map(nodes.map((d, i) => [id(d, i, nodes), d])),\n        link;\n\n    for (i = 0, count = new Array(n); i < m; ++i) {\n      link = links[i], link.index = i;\n      if (typeof link.source !== \"object\") link.source = find(nodeById, link.source);\n      if (typeof link.target !== \"object\") link.target = find(nodeById, link.target);\n      count[link.source.index] = (count[link.source.index] || 0) + 1;\n      count[link.target.index] = (count[link.target.index] || 0) + 1;\n    }\n\n    for (i = 0, bias = new Array(m); i < m; ++i) {\n      link = links[i], bias[i] = count[link.source.index] / (count[link.source.index] + count[link.target.index]);\n    }\n\n    strengths = new Array(m), initializeStrength();\n    distances = new Array(m), initializeDistance();\n  }\n\n  function initializeStrength() {\n    if (!nodes) return;\n\n    for (var i = 0, n = links.length; i < n; ++i) {\n      strengths[i] = +strength(links[i], i, links);\n    }\n  }\n\n  function initializeDistance() {\n    if (!nodes) return;\n\n    for (var i = 0, n = links.length; i < n; ++i) {\n      distances[i] = +distance(links[i], i, links);\n    }\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.links = function(_) {\n    return arguments.length ? (links = _, initialize(), force) : links;\n  };\n\n  force.id = function(_) {\n    return arguments.length ? (id = _, force) : id;\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initializeStrength(), force) : strength;\n  };\n\n  force.distance = function(_) {\n    return arguments.length ? (distance = typeof _ === \"function\" ? _ : constant(+_), initializeDistance(), force) : distance;\n  };\n\n  return force;\n}\n","import {quadtree} from \"d3-quadtree\";\nimport constant from \"./constant.js\";\nimport jiggle from \"./jiggle.js\";\n\nfunction x(d) {\n  return d.x + d.vx;\n}\n\nfunction y(d) {\n  return d.y + d.vy;\n}\n\nexport default function(radius) {\n  var nodes,\n      radii,\n      random,\n      strength = 1,\n      iterations = 1;\n\n  if (typeof radius !== \"function\") radius = constant(radius == null ? 1 : +radius);\n\n  function force() {\n    var i, n = nodes.length,\n        tree,\n        node,\n        xi,\n        yi,\n        ri,\n        ri2;\n\n    for (var k = 0; k < iterations; ++k) {\n      tree = quadtree(nodes, x, y).visitAfter(prepare);\n      for (i = 0; i < n; ++i) {\n        node = nodes[i];\n        ri = radii[node.index], ri2 = ri * ri;\n        xi = node.x + node.vx;\n        yi = node.y + node.vy;\n        tree.visit(apply);\n      }\n    }\n\n    function apply(quad, x0, y0, x1, y1) {\n      var data = quad.data, rj = quad.r, r = ri + rj;\n      if (data) {\n        if (data.index > node.index) {\n          var x = xi - data.x - data.vx,\n              y = yi - data.y - data.vy,\n              l = x * x + y * y;\n          if (l < r * r) {\n            if (x === 0) x = jiggle(random), l += x * x;\n            if (y === 0) y = jiggle(random), l += y * y;\n            l = (r - (l = Math.sqrt(l))) / l * strength;\n            node.vx += (x *= l) * (r = (rj *= rj) / (ri2 + rj));\n            node.vy += (y *= l) * r;\n            data.vx -= x * (r = 1 - r);\n            data.vy -= y * r;\n          }\n        }\n        return;\n      }\n      return x0 > xi + r || x1 < xi - r || y0 > yi + r || y1 < yi - r;\n    }\n  }\n\n  function prepare(quad) {\n    if (quad.data) return quad.r = radii[quad.data.index];\n    for (var i = quad.r = 0; i < 4; ++i) {\n      if (quad[i] && quad[i].r > quad.r) {\n        quad.r = quad[i].r;\n      }\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length, node;\n    radii = new Array(n);\n    for (i = 0; i < n; ++i) node = nodes[i], radii[node.index] = +radius(node, i, nodes);\n  }\n\n  force.initialize = function(_nodes, _random) {\n    nodes = _nodes;\n    random = _random;\n    initialize();\n  };\n\n  force.iterations = function(_) {\n    return arguments.length ? (iterations = +_, force) : iterations;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  force.radius = function(_) {\n    return arguments.length ? (radius = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : radius;\n  };\n\n  return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(x) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      xz;\n\n  if (typeof x !== \"function\") x = constant(x == null ? 0 : +x);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vx += (xz[i] - node.x) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    xz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(xz[i] = +x(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : x;\n  };\n\n  return force;\n}\n","import constant from \"./constant.js\";\n\nexport default function(y) {\n  var strength = constant(0.1),\n      nodes,\n      strengths,\n      yz;\n\n  if (typeof y !== \"function\") y = constant(y == null ? 0 : +y);\n\n  function force(alpha) {\n    for (var i = 0, n = nodes.length, node; i < n; ++i) {\n      node = nodes[i], node.vy += (yz[i] - node.y) * strengths[i] * alpha;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    var i, n = nodes.length;\n    strengths = new Array(n);\n    yz = new Array(n);\n    for (i = 0; i < n; ++i) {\n      strengths[i] = isNaN(yz[i] = +y(nodes[i], i, nodes)) ? 0 : +strength(nodes[i], i, nodes);\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n    initialize();\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : strength;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = typeof _ === \"function\" ? _ : constant(+_), initialize(), force) : y;\n  };\n\n  return force;\n}\n","import * as d3Force from 'd3-force';\n\ninterface INode {\n  id: string;\n  x: number;\n  y: number;\n  vx: number;\n  vy: number;\n  cluster: any;\n}\n\n// https://github.com/john-guerra/forceInABox/blob/master/src/forceInABox.js\nexport default function forceInBox() {\n  function constant(_: any): () => any {\n    return () => _;\n  }\n\n  let groupBy = (d: INode) => {\n    return d.cluster;\n  };\n  let forceNodeSize: (() => number) | ((d: any) => number) = constant(1);\n  let forceCharge: (() => number) | ((d: any) => number) = constant(-1);\n  let forceLinkDistance: (() => number) | ((d: any) => number) = constant(100);\n  let forceLinkStrength: (() => number) | ((d: any) => number) = constant(0.1);\n  let offset = [0, 0];\n\n  let nodes: INode[] = [];\n  let nodesMap: any = {};\n  let links: any[] = [];\n  let centerX = 100;\n  let centerY = 100;\n  let foci: any = {\n    none: {\n      x: 0,\n      y: 0,\n    },\n  };\n  let templateNodes: INode[] = [];\n  let templateForce: any;\n  let template = 'force';\n  let enableGrouping = true;\n  let strength = 0.1;\n\n  function force(alpha: number) {\n    if (!enableGrouping) {\n      return force;\n    }\n    templateForce.tick();\n    getFocisFromTemplate();\n\n    for (let i = 0, n = nodes.length, node, k = alpha * strength; i < n; ++i) {\n      node = nodes[i];\n      node.vx += (foci[groupBy(node)].x - node.x) * k;\n      node.vy += (foci[groupBy(node)].y - node.y) * k;\n    }\n  }\n\n  function initialize() {\n    if (!nodes) return;\n    initializeWithForce();\n  }\n\n  function initializeWithForce() {\n    if (!nodes || !nodes.length) {\n      return;\n    }\n\n    if (groupBy(nodes[0]) === undefined) {\n      throw Error(\n        \"Couldnt find the grouping attribute for the nodes. Make sure to set it up with forceInBox.groupBy('clusterAttr') before calling .links()\",\n      );\n    }\n\n    // checkLinksAsObjects();\n\n    const net = getGroupsGraph();\n    templateForce = d3Force\n      .forceSimulation(net.nodes)\n      .force('x', d3Force.forceX(centerX).strength(0.1))\n      .force('y', d3Force.forceY(centerY).strength(0.1))\n      .force('collide', d3Force.forceCollide((d: any) => d.r).iterations(4))\n      .force('charge', d3Force.forceManyBody().strength(forceCharge))\n      .force(\n        'links',\n        d3Force\n          .forceLink(net.nodes.length ? net.links : [])\n          .distance(forceLinkDistance)\n          .strength(forceLinkStrength),\n      );\n\n    templateNodes = templateForce.nodes();\n\n    getFocisFromTemplate();\n  }\n\n  function getGroupsGraph() {\n    const gnodes: any = [];\n    const glinks: any = [];\n    const dNodes: any = {};\n    let clustersList: string[] = [];\n    let clustersCounts: any = {};\n    let clustersLinks: any = [];\n\n    clustersCounts = computeClustersNodeCounts(nodes);\n    clustersLinks = computeClustersLinkCounts(links);\n\n    clustersList = Object.keys(clustersCounts);\n\n    clustersList.forEach((key, index) => {\n      const val = clustersCounts[key];\n      // Uses approx meta-node size\n      gnodes.push({\n        id: key,\n        size: val.count,\n        r: Math.sqrt(val.sumforceNodeSize / Math.PI),\n      });\n      dNodes[key] = index;\n    });\n\n    clustersLinks.forEach((link: any) => {\n      const sourceTerminal = link.source;\n      const targetTerminal = link.target;\n      const source = dNodes[sourceTerminal];\n      const target = dNodes[targetTerminal];\n      if (source !== undefined && target !== undefined) {\n        glinks.push({\n          source,\n          target,\n          count: link.count,\n        });\n      }\n    });\n\n    return {\n      nodes: gnodes,\n      links: glinks,\n    };\n  }\n\n  function computeClustersNodeCounts(nodes: any) {\n    const clustersCounts: any = {};\n\n    nodes.forEach((d: any) => {\n      const key = groupBy(d);\n      if (!clustersCounts[key]) {\n        clustersCounts[key] = {\n          count: 0,\n          sumforceNodeSize: 0,\n        };\n      }\n    });\n    nodes.forEach((d: any) => {\n      const key = groupBy(d);\n      const nodeSize = forceNodeSize(d);\n      const tmpCount = clustersCounts[key];\n      tmpCount.count = tmpCount.count + 1;\n      tmpCount.sumforceNodeSize =\n        tmpCount.sumforceNodeSize + Math.PI * (nodeSize * nodeSize) * 1.3;\n      clustersCounts[key] = tmpCount;\n    });\n\n    return clustersCounts;\n  }\n\n  function computeClustersLinkCounts(links: any) {\n    const dClusterLinks: any = {};\n    const clusterLinks: any = [];\n    links.forEach((l: any) => {\n      const key = getLinkKey(l);\n      let count = 0;\n      if (dClusterLinks[key] !== undefined) {\n        count = dClusterLinks[key];\n      }\n      count += 1;\n      dClusterLinks[key] = count;\n    });\n\n    // @ts-ignore\n    const entries = Object.entries(dClusterLinks);\n\n    entries.forEach(([key, count]: any) => {\n      const source = key.split('~')[0];\n      const target = key.split('~')[1];\n      if (source !== undefined && target !== undefined) {\n        clusterLinks.push({\n          source,\n          target,\n          count,\n        });\n      }\n    });\n\n    return clusterLinks;\n  }\n\n  function getFocisFromTemplate() {\n    foci = {\n      none: {\n        x: 0,\n        y: 0,\n      },\n    };\n    templateNodes.forEach((d) => {\n      foci[d.id] = {\n        x: d.x - offset[0],\n        y: d.y - offset[1],\n      };\n    });\n    return foci;\n  }\n\n  function getLinkKey(link: any) {\n    const source = link.source;\n    const target = link.target;\n    const sourceID = groupBy(nodesMap[source]);\n    const targetID = groupBy(nodesMap[target]);\n\n    return sourceID <= targetID\n      ? `${sourceID}~${targetID}`\n      : `${targetID}~${sourceID}`;\n  }\n\n  function genNodesMap(nodes: any) {\n    nodesMap = {};\n    nodes.forEach((node: any) => {\n      nodesMap[node.id] = node;\n    });\n  }\n\n  function setTemplate(x: any) {\n    if (!arguments.length) return template;\n    template = x;\n    initialize();\n    return force;\n  }\n\n  function setGroupBy(x: any) {\n    if (!arguments.length) return groupBy;\n    if (typeof x === 'string') {\n      groupBy = (d: any) => {\n        return d[x];\n      };\n      return force;\n    }\n    groupBy = x;\n    return force;\n  }\n\n  function setEnableGrouping(x: any) {\n    if (!arguments.length) return enableGrouping;\n    enableGrouping = x;\n    return force;\n  }\n\n  function setStrength(x: any) {\n    if (!arguments.length) return strength;\n    strength = x;\n    return force;\n  }\n\n  function setCenterX(_: any) {\n    if (arguments.length) {\n      centerX = _;\n      return force;\n    }\n\n    return centerX;\n  }\n\n  function setCenterY(_: any) {\n    if (arguments.length) {\n      centerY = _;\n      return force;\n    }\n\n    return centerY;\n  }\n\n  function setNodes(_: any) {\n    if (arguments.length) {\n      genNodesMap(_ || []);\n      nodes = _ || [];\n      return force;\n    }\n    return nodes;\n  }\n\n  function setLinks(_: any) {\n    if (arguments.length) {\n      links = _ || [];\n      initialize();\n      return force;\n    }\n    return links;\n  }\n\n  function setForceNodeSize(_: any) {\n    if (arguments.length) {\n      if (typeof _ === 'function') {\n        forceNodeSize = _;\n      } else {\n        forceNodeSize = constant(+_);\n      }\n      initialize();\n      return force;\n    }\n\n    return forceNodeSize;\n  }\n\n  function setForceCharge(_: any) {\n    if (arguments.length) {\n      if (typeof _ === 'function') {\n        forceCharge = _;\n      } else {\n        forceCharge = constant(+_);\n      }\n      initialize();\n      return force;\n    }\n\n    return forceCharge;\n  }\n\n  function setForceLinkDistance(_: any) {\n    if (arguments.length) {\n      if (typeof _ === 'function') {\n        forceLinkDistance = _;\n      } else {\n        forceLinkDistance = constant(+_);\n      }\n      initialize();\n      return force;\n    }\n\n    return forceLinkDistance;\n  }\n\n  function setForceLinkStrength(_: any) {\n    if (arguments.length) {\n      if (typeof _ === 'function') {\n        forceLinkStrength = _;\n      } else {\n        forceLinkStrength = constant(+_);\n      }\n      initialize();\n      return force;\n    }\n\n    return forceLinkStrength;\n  }\n\n  function setOffset(_: any) {\n    if (arguments.length) {\n      offset = _;\n      return force;\n    }\n\n    return offset;\n  }\n\n  force.initialize = (_: any) => {\n    nodes = _;\n    initialize();\n  };\n\n  force.template = setTemplate;\n\n  force.groupBy = setGroupBy;\n\n  force.enableGrouping = setEnableGrouping;\n\n  force.strength = setStrength;\n\n  force.centerX = setCenterX;\n\n  force.centerY = setCenterY;\n\n  force.nodes = setNodes;\n\n  force.links = setLinks;\n\n  force.forceNodeSize = setForceNodeSize;\n\n  // Legacy support\n  force.nodeSize = force.forceNodeSize;\n\n  force.forceCharge = setForceCharge;\n\n  force.forceLinkDistance = setForceLinkDistance;\n\n  force.forceLinkStrength = setForceLinkStrength;\n\n  force.offset = setOffset;\n\n  force.getFocis = getFocisFromTemplate;\n\n  return force;\n}\n","import { isFunction, isNumber, isObject } from '@antv/util';\nimport * as d3Force from 'd3-force';\nimport type {\n  D3ForceLayoutOptions,\n  Edge,\n  Graph,\n  LayoutMapping,\n  LayoutWithIterations,\n  Node,\n  OutEdge,\n  OutNode,\n} from '../types';\nimport { cloneFormatData, isArray } from '../util';\nimport forceInBox from './forceInBox';\n\n/**\n * D3 writes x and y as the first level properties\n */\ninterface CalcNode extends Node {\n  x: number;\n  y: number;\n}\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<D3ForceLayoutOptions> = {\n  center: [0, 0],\n  preventOverlap: false,\n  nodeSize: undefined,\n  nodeSpacing: undefined,\n  linkDistance: 50,\n  forceSimulation: null,\n  alphaDecay: 0.028,\n  alphaMin: 0.001,\n  alpha: 0.3,\n  collideStrength: 1,\n  clustering: false,\n  clusterNodeStrength: -1,\n  clusterEdgeStrength: 0.1,\n  clusterEdgeDistance: 100,\n  clusterFociStrength: 0.8,\n  clusterNodeSize: 10,\n};\n\n/**\n * Layout the nodes' positions with d3's basic classic force\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new D3ForceLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new D3ForceLayout({ center: [100, 100] });\n * const positions = await 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 * await layout.assign(graph, { center: [100, 100] });\n */\nexport class D3ForceLayout\n  implements LayoutWithIterations<D3ForceLayoutOptions>\n{\n  id = 'd3force';\n\n  private forceSimulation: d3Force.Simulation<any, any>;\n\n  private lastLayoutNodes: CalcNode[];\n  private lastLayoutEdges: OutEdge[];\n  private lastAssign: boolean;\n  private lastGraph: Graph;\n\n  constructor(\n    public options: D3ForceLayoutOptions = {} as D3ForceLayoutOptions,\n  ) {\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  async execute(graph: Graph, options?: D3ForceLayoutOptions) {\n    return this.genericForceLayout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: D3ForceLayoutOptions) {\n    this.genericForceLayout(true, graph, options);\n  }\n\n  /**\n   * Stop simulation immediately.\n   */\n  stop() {\n    this.forceSimulation?.stop();\n  }\n\n  /**\n   * Manually steps the simulation by the specified number of iterations.\n   * @see https://github.com/d3/d3-force#simulation_tick\n   */\n  tick(iterations = 1) {\n    this.forceSimulation.tick(iterations);\n\n    const result = {\n      nodes: formatOutNodes(this.lastLayoutNodes),\n      edges: formatOutEdges(this.lastLayoutEdges),\n    };\n\n    if (this.lastAssign) {\n      result.nodes.forEach((node) =>\n        this.lastGraph.mergeNodeData(node.id, {\n          x: node.data.x,\n          y: node.data.y,\n        }),\n      );\n    }\n\n    return result;\n  }\n\n  private async genericForceLayout(\n    assign: false,\n    graph: Graph,\n    options?: D3ForceLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericForceLayout(\n    assign: true,\n    graph: Graph,\n    options?: D3ForceLayoutOptions,\n  ): Promise<void>;\n  private async genericForceLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: D3ForceLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const mergedOptions = { ...this.options, ...options };\n\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges();\n    const layoutNodes: CalcNode[] = nodes.map(\n      (node) =>\n        ({\n          ...cloneFormatData(node),\n          x: node.data?.x,\n          y: node.data?.y,\n        } as CalcNode),\n    );\n    const layoutEdges: OutEdge[] = edges.map((edge) => cloneFormatData(edge));\n\n    // Use them later in `tick`.\n    this.lastLayoutNodes = layoutNodes;\n    this.lastLayoutEdges = layoutEdges;\n    this.lastAssign = assign;\n    this.lastGraph = graph;\n\n    const {\n      alphaMin,\n      alphaDecay,\n      alpha,\n      nodeStrength,\n      edgeStrength,\n      linkDistance,\n      clustering,\n      clusterFociStrength,\n      clusterEdgeDistance,\n      clusterEdgeStrength,\n      clusterNodeStrength,\n      clusterNodeSize,\n      collideStrength = 1,\n      center = [0, 0],\n      preventOverlap,\n      nodeSize,\n      nodeSpacing,\n      onTick,\n    } = mergedOptions;\n    let { forceSimulation } = mergedOptions;\n\n    return new Promise((resolve) => {\n      if (!forceSimulation) {\n        try {\n          // 定义节点的力\n          const nodeForce = d3Force.forceManyBody();\n          if (nodeStrength) {\n            nodeForce.strength(nodeStrength as any);\n          }\n          forceSimulation = d3Force.forceSimulation().nodes(layoutNodes as any);\n\n          if (clustering) {\n            const clusterForce = forceInBox() as any;\n            clusterForce\n              .centerX(center[0])\n              .centerY(center[1])\n              .template('force')\n              .strength(clusterFociStrength);\n            if (layoutEdges) {\n              clusterForce.links(layoutEdges);\n            }\n            if (layoutNodes) {\n              clusterForce.nodes(layoutNodes);\n            }\n            clusterForce\n              .forceLinkDistance(clusterEdgeDistance)\n              .forceLinkStrength(clusterEdgeStrength)\n              .forceCharge(clusterNodeStrength)\n              .forceNodeSize(clusterNodeSize);\n\n            forceSimulation.force('group', clusterForce);\n          }\n          forceSimulation\n            .force('center', d3Force.forceCenter(center[0], center[1]))\n            .force('charge', nodeForce)\n            .alpha(alpha)\n            .alphaDecay(alphaDecay)\n            .alphaMin(alphaMin);\n\n          if (preventOverlap) {\n            this.overlapProcess(forceSimulation, {\n              nodeSize,\n              nodeSpacing,\n              collideStrength,\n            });\n          }\n          // 如果有边，定义边的力\n          if (layoutEdges) {\n            // d3 的 forceLayout 会重新生成边的数据模型，为了避免污染源数据\n            const edgeForce = d3Force\n              .forceLink()\n              .id((d: any) => d.id)\n              .links(layoutEdges);\n            if (edgeStrength) {\n              edgeForce.strength(edgeStrength as any);\n            }\n            if (linkDistance) {\n              edgeForce.distance(linkDistance as any);\n            }\n            forceSimulation.force('link', edgeForce);\n          }\n\n          forceSimulation\n            .on('tick', () => {\n              const outNodes = formatOutNodes(layoutNodes);\n              onTick?.({\n                nodes: outNodes,\n                edges: formatOutEdges(layoutEdges),\n              });\n\n              if (assign) {\n                outNodes.forEach((node) =>\n                  graph.mergeNodeData(node.id, {\n                    x: node.data.x,\n                    y: node.data.y,\n                  }),\n                );\n              }\n            })\n            .on('end', () => {\n              const outNodes = formatOutNodes(layoutNodes);\n\n              if (assign) {\n                outNodes.forEach((node) =>\n                  graph.mergeNodeData(node.id, {\n                    x: node.data.x,\n                    y: node.data.y,\n                  }),\n                );\n              }\n\n              resolve({\n                nodes: outNodes,\n                edges: formatOutEdges(layoutEdges),\n              });\n            });\n        } catch (e) {\n          console.warn(e);\n        }\n      } else {\n        // forceSimulation is defined\n        if (clustering) {\n          const clusterForce = forceInBox() as any;\n          clusterForce.nodes(layoutNodes);\n          clusterForce.links(layoutEdges);\n        }\n        forceSimulation.nodes(layoutNodes);\n        if (layoutEdges) {\n          // d3 的 forceLayout 会重新生成边的数据模型，为了避免污染源数据\n          const edgeForce = d3Force\n            .forceLink()\n            .id((d: any) => d.id)\n            .links(layoutEdges);\n          if (edgeStrength) {\n            edgeForce.strength(edgeStrength as any);\n          }\n          if (linkDistance) {\n            edgeForce.distance(linkDistance as any);\n          }\n          forceSimulation.force('link', edgeForce);\n        }\n        if (preventOverlap) {\n          this.overlapProcess(forceSimulation, {\n            nodeSize,\n            nodeSpacing,\n            collideStrength,\n          });\n        }\n        forceSimulation.alpha(alpha).restart();\n\n        // since d3 writes x and y as node's first level properties, format them into data\n        const outNodes = formatOutNodes(layoutNodes);\n        const outEdges = formatOutEdges(layoutEdges);\n\n        if (assign) {\n          outNodes.forEach((node) =>\n            graph.mergeNodeData(node.id, {\n              x: node.data.x,\n              y: node.data.y,\n            }),\n          );\n        }\n\n        resolve({\n          nodes: outNodes,\n          edges: outEdges,\n        });\n      }\n\n      this.forceSimulation = forceSimulation;\n    });\n  }\n\n  /**\n   * Prevent overlappings.\n   * @param {object} simulation force simulation of d3\n   */\n  public overlapProcess(\n    simulation: d3Force.Simulation<any, any>,\n    options: {\n      nodeSize: number | number[] | ((d?: Node) => number) | undefined;\n      nodeSpacing: number | number[] | ((d?: Node) => number) | undefined;\n      collideStrength: number;\n    },\n  ) {\n    const { nodeSize, nodeSpacing, collideStrength } = options;\n    let nodeSizeFunc: (d: any) => number;\n    let nodeSpacingFunc: any;\n\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) => {\n        if (d.size) {\n          if (isArray(d.size)) {\n            const res = d.size[0] > d.size[1] ? d.size[0] : d.size[1];\n            return res / 2 + nodeSpacingFunc(d);\n          }\n          if (isObject(d.size)) {\n            const res =\n              d.size.width > d.size.height ? d.size.width : d.size.height;\n            return res / 2 + nodeSpacingFunc(d);\n          }\n          return d.size / 2 + nodeSpacingFunc(d);\n        }\n        return 10 + nodeSpacingFunc(d);\n      };\n    } else if (isFunction(nodeSize)) {\n      nodeSizeFunc = (d) => {\n        const size = nodeSize(d);\n        return size + nodeSpacingFunc(d);\n      };\n    } else if (isArray(nodeSize)) {\n      const larger = nodeSize[0] > nodeSize[1] ? nodeSize[0] : nodeSize[1];\n      const radius = larger / 2;\n      nodeSizeFunc = (d) => radius + nodeSpacingFunc(d);\n    } else if (isNumber(nodeSize)) {\n      const radius = (nodeSize as number) / 2;\n      nodeSizeFunc = (d) => radius + nodeSpacingFunc(d);\n    } else {\n      nodeSizeFunc = () => 10;\n    }\n\n    // forceCollide's parameter is a radius\n    simulation.force(\n      'collisionForce',\n      d3Force.forceCollide(nodeSizeFunc).strength(collideStrength),\n    );\n  }\n}\n\n/**\n * Format the calculation nodes into output nodes.\n * Since d3 reads properties in plain node data object which is not compact to the OutNode\n * @param layoutNodes\n * @returns\n */\nconst formatOutNodes = (layoutNodes: CalcNode[]): OutNode[] =>\n  layoutNodes.map((node) => {\n    const { x, y, ...others } = node;\n    return {\n      ...others,\n      data: {\n        ...others.data,\n        x,\n        y,\n      },\n    };\n  });\n\n/**\n * d3 will modify `source` and `target` on edge object.\n */\nconst formatOutEdges = (edges: any[]): Edge[] =>\n  edges.map((edge) => {\n    const { source, target, ...rest } = edge;\n    return {\n      ...rest,\n      source: source.id,\n      target: target.id,\n    };\n  });\n","import { isFunction, isNumber } from '@antv/util';\nimport type { EdgeConfig, GraphLabel, NodeConfig } from 'dagre';\nimport dagre, { graphlib } from 'dagre';\nimport type { Graph, Layout, LayoutMapping, Node } from './types';\nimport { parseSize, type Size } from './util/size';\n\nexport interface DagreLayoutOptions extends GraphLabel, NodeConfig, EdgeConfig {\n  nodeSize?: Size | ((node: Node) => Size);\n}\n\n/**\n * Adapt dagre.js layout\n * @link https://github.com/dagrejs/dagre\n */\nexport class DagreLayout implements Layout<DagreLayoutOptions> {\n  static defaultOptions: Partial<DagreLayoutOptions> = {};\n\n  public id = 'dagre';\n\n  public options: Partial<DagreLayoutOptions> = {};\n\n  constructor(options: Partial<DagreLayoutOptions>) {\n    Object.assign(this.options, DagreLayout.defaultOptions, options);\n  }\n\n  async execute(\n    graph: Graph,\n    options?: DagreLayoutOptions,\n  ): Promise<LayoutMapping> {\n    return this.genericDagreLayout(false, graph, {\n      ...this.options,\n      ...options,\n    });\n  }\n\n  async assign(graph: Graph, options?: DagreLayoutOptions): Promise<void> {\n    await this.genericDagreLayout(true, graph, { ...this.options, ...options });\n  }\n\n  private async genericDagreLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: DagreLayoutOptions,\n  ) {\n    const { nodeSize } = options;\n    const g = new graphlib.Graph();\n    g.setGraph(options);\n    g.setDefaultEdgeLabel(() => ({}));\n\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges();\n\n    if ([...nodes, ...edges].some(({ id }) => isNumber(id))) {\n      console.error(\n        'Dagre layout only support string id, it will convert number to string.',\n      );\n    }\n\n    graph.getAllNodes().forEach((node) => {\n      const { id } = node;\n      const data = { ...node.data };\n      if (nodeSize !== undefined) {\n        const [width, height] = parseSize(\n          isFunction(nodeSize) ? nodeSize(node) : nodeSize,\n        );\n        Object.assign(data, { width, height });\n      }\n      g.setNode(id.toString(), data);\n    });\n    graph.getAllEdges().forEach(({ id, source, target }) => {\n      g.setEdge(source.toString(), target.toString(), { id });\n    });\n\n    dagre.layout(g);\n\n    const mapping: LayoutMapping = { nodes: [], edges: [] };\n\n    g.nodes().forEach((id) => {\n      const data = g.node(id);\n      mapping.nodes.push({ id, data });\n      if (assign) graph.mergeNodeData(id, data);\n    });\n\n    g.edges().forEach((edge) => {\n      const { id, ...data } = g.edge(edge);\n      const { v: source, w: target } = edge;\n      mapping.edges.push({ id, source, target, data });\n      if (assign) graph.mergeEdgeData(id, data);\n    });\n\n    return mapping;\n  }\n}\n","import { isNumber } from '@antv/util';\n\nexport type Size = number | number[];\nexport type STDSize = [number, number, number];\n\nexport function parseSize(size?: Size): STDSize {\n  if (!size) return [0, 0, 0];\n  if (isNumber(size)) return [size, size, size];\n  else if (size.length === 0) return [0, 0, 0];\n  const [x, y = x, z = x] = size;\n  return [x, y, z];\n}\n","import Quad from './quad';\n\n/**\n * @fileOverview body\n * @author shiwu.wyy@antfin.com\n */\n\ntype BodyProps = {\n  id?: Number;\n  rx: number;\n  ry: number;\n  fx?: number;\n  fy?: number;\n  mass: number;\n  degree: number;\n  g?: number;\n};\n\n// represents a body(a point mass) and its position\nexport default class Body {\n  public id: Number;\n  public rx: number;\n  public ry: number;\n  public fx: number;\n  public fy: number;\n  public mass: number;\n  public degree: number;\n  public g: number;\n\n  constructor(params: BodyProps) {\n    /**\n     * the id of this body, the same with the node id\n     * @type  {number}\n     */\n    this.id = params.id || 0;\n    /**\n     * the position of this body\n     * @type  {number}\n     */\n    this.rx = params.rx;\n    /**\n     * the position of this body\n     * @type  {number}\n     */\n    this.ry = params.ry;\n    /**\n     * the force acting on this body\n     * @type  {number}\n     */\n    this.fx = 0;\n    /**\n     * the force acting on this body\n     * @type  {number}\n     */\n    this.fy = 0;\n    /**\n     * the mass of this body, =1 for a node\n     * @type  {number}\n     */\n    this.mass = params.mass;\n    /**\n     * the degree of the node represented by this body\n     * @type  {number}\n     */\n    this.degree = params.degree;\n    /**\n     * the parameter for repulsive force, = kr\n     * @type  {number}\n     */\n    this.g = params.g || 0;\n  }\n  // returns the euclidean distance\n  distanceTo(bo: Body) {\n    const dx = this.rx - bo.rx;\n    const dy = this.ry - bo.ry;\n    return Math.hypot(dx, dy);\n  }\n  setPos(x: number, y: number) {\n    this.rx = x;\n    this.ry = y;\n  }\n  // resets the forces\n  resetForce() {\n    this.fx = 0;\n    this.fy = 0;\n  }\n  addForce(b: Body) {\n    const dx = b.rx - this.rx;\n    const dy = b.ry - this.ry;\n    let dist = Math.hypot(dx, dy);\n    dist = dist < 0.0001 ? 0.0001 : dist;\n    // the repulsive defined by force atlas 2\n    const F = (this.g * (this.degree + 1) * (b.degree + 1)) / dist;\n    this.fx += (F * dx) / dist;\n    this.fy += (F * dy) / dist;\n  }\n  // if quad contains this body\n  in(quad: Quad) {\n    return quad.contains(this.rx, this.ry);\n  }\n  // returns a new body\n  add(bo: Body) {\n    const nenwMass = this.mass + bo.mass;\n    const x = (this.rx * this.mass + bo.rx * bo.mass) / nenwMass;\n    const y = (this.ry * this.mass + bo.ry * bo.mass) / nenwMass;\n    const dg = this.degree + bo.degree;\n    const params: BodyProps = {\n      rx: x,\n      ry: y,\n      mass: nenwMass,\n      degree: dg,\n    };\n    return new Body(params);\n  }\n}\n","import { PointTuple } from '../types';\n\n/**\n * @fileOverview quad\n * @author shiwu.wyy@antfin.com\n */\n\ntype QuadProps = {\n  xmid: number;\n  ymid: number;\n  length: number;\n  massCenter?: PointTuple;\n  mass?: number;\n};\n\nexport default class Quad {\n  public xmid: number;\n  public ymid: number;\n  public length: number;\n  public massCenter: PointTuple;\n  public mass: number;\n  constructor(params: QuadProps) {\n    /**\n     * the center position of this quad\n     * @type  {number}\n     */\n    this.xmid = params.xmid;\n    /**\n     * the center position of this quad\n     * @type  {number}\n     */\n    this.ymid = params.ymid;\n    /**\n     * the length of this quad\n     * @type  {number}\n     */\n    this.length = params.length;\n    /**\n     * the mass center of this quad\n     * @type  {number}\n     */\n    this.massCenter = params.massCenter || [0, 0];\n    /**\n     * the mass of this quad\n     * @type  {number}\n     */\n    this.mass = params.mass || 1;\n  }\n  getLength() {\n    return this.length;\n  }\n  contains(x: number, y: number) {\n    const halfLen = this.length / 2;\n    return (\n      x <= this.xmid + halfLen &&\n      x >= this.xmid - halfLen &&\n      y <= this.ymid + halfLen &&\n      y >= this.ymid - halfLen\n    );\n  }\n  // northwest quadrant\n  // tslint:disable-next-line\n  NW() {\n    const x = this.xmid - this.length / 4;\n    const y = this.ymid + this.length / 4;\n    const len = this.length / 2;\n    const params: QuadProps = {\n      xmid: x,\n      ymid: y,\n      length: len,\n    };\n    const NW = new Quad(params);\n    return NW;\n  }\n  // northeast\n  // tslint:disable-next-line\n  NE() {\n    const x = this.xmid + this.length / 4;\n    const y = this.ymid + this.length / 4;\n    const len = this.length / 2;\n    const params = {\n      xmid: x,\n      ymid: y,\n      length: len,\n    };\n    const NE = new Quad(params);\n    return NE;\n  }\n  // southwest\n  // tslint:disable-next-line\n  SW() {\n    const x = this.xmid - this.length / 4;\n    const y = this.ymid - this.length / 4;\n    const len = this.length / 2;\n    const params = {\n      xmid: x,\n      ymid: y,\n      length: len,\n    };\n    const SW = new Quad(params);\n    return SW;\n  }\n  // southeast\n  // tslint:disable-next-line\n  SE() {\n    const x = this.xmid + this.length / 4;\n    const y = this.ymid - this.length / 4;\n    const len = this.length / 2;\n    const params = {\n      xmid: x,\n      ymid: y,\n      length: len,\n    };\n    const SE = new Quad(params);\n    return SE;\n  }\n}\n","import Body from './body';\nimport Quad from './quad';\n\n/**\n * @fileOverview quadTree\n * @author shiwu.wyy@antfin.com\n */\n\nexport default class QuadTree {\n  public body: Body | null;\n  public quad: Quad | null;\n  public theta: number;\n  public NW: QuadTree | null;\n  public NE: QuadTree | null;\n  public SW: QuadTree | null;\n  public SE: QuadTree | null;\n\n  // each quadtree represents a quadrant and an aggregate body\n  // that represents all bodies inside the quadrant\n  constructor(param: Quad | null) {\n    /**\n     * (aggregated) body in this quad\n     * @type  {object}\n     */\n    this.body = null;\n    /**\n     * tree representing the northwest quadrant\n     * @type  {object}\n     */\n    this.quad = null;\n    this.NW = null;\n    this.NE = null;\n    this.SW = null;\n    this.SE = null;\n    /**\n     * threshold\n     * @type  {number}\n     */\n    this.theta = 0.5;\n    if (param != null) this.quad = param;\n  }\n  // insert a body(node) into the tree\n  insert(bo: Body) {\n    // if this node does not contain a body, put the new body bo here\n    if (this.body == null) {\n      this.body = bo;\n      return;\n    }\n    // internal node\n    if (!this._isExternal()) {\n      // update mass info\n      this.body = this.body.add(bo);\n      // insert body into quadrant\n      this._putBody(bo);\n    } else {\n      // external node\n      // divide this region into four children\n      if (this.quad) {\n        this.NW = new QuadTree(this.quad.NW());\n        this.NE = new QuadTree(this.quad.NE());\n        this.SW = new QuadTree(this.quad.SW());\n        this.SE = new QuadTree(this.quad.SE());\n      }\n\n      // insert this body and bo\n      this._putBody(this.body);\n      this._putBody(bo);\n      // update the mass info\n      this.body = this.body.add(bo);\n    }\n  }\n  // inserts bo into a quad\n  // tslint:disable-next-line\n  _putBody(bo: Body) {\n    if (!this.quad) return;\n    if (bo.in(this.quad.NW()) && this.NW) this.NW.insert(bo);\n    else if (bo.in(this.quad.NE()) && this.NE) this.NE.insert(bo);\n    else if (bo.in(this.quad.SW()) && this.SW) this.SW.insert(bo);\n    else if (bo.in(this.quad.SE()) && this.SE) this.SE.insert(bo);\n  }\n  // tslint:disable-next-line\n  _isExternal() {\n    // four children are null\n    return (\n      this.NW == null && this.NE == null && this.SW == null && this.SE == null\n    );\n  }\n  // update the forces\n  updateForce(bo: Body) {\n    if (this.body == null || bo === this.body) {\n      return;\n    }\n    // if the current node is external\n    if (this._isExternal()) bo.addForce(this.body);\n    // internal nodes\n    else {\n      const s = this.quad ? this.quad.getLength() : 0;\n      const d = this.body.distanceTo(bo);\n      // b is far enough\n      if (s / d < this.theta) bo.addForce(this.body);\n      else {\n        this.NW && this.NW.updateForce(bo);\n        this.NE && this.NE.updateForce(bo);\n        this.SW && this.SW.updateForce(bo);\n        this.SE && this.SE.updateForce(bo);\n      }\n    }\n  }\n}\n","import { Graph as GGraph } from '@antv/graphlib';\nimport { isFunction, isNumber, isObject } from '@antv/util';\nimport type {\n  Edge,\n  EdgeData,\n  ForceAtlas2LayoutOptions,\n  Graph,\n  Layout,\n  LayoutMapping,\n  Node,\n  OutEdge,\n  OutEdgeData,\n  OutNode,\n  OutNodeData,\n  PointTuple,\n} from '../types';\nimport { cloneFormatData, isArray } from '../util';\nimport { handleSingleNodeGraph } from '../util/common';\nimport Body from './body';\nimport Quad from './quad';\nimport QuadTree from './quadTree';\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<ForceAtlas2LayoutOptions> = {\n  center: [0, 0],\n  width: 300,\n  height: 300,\n  kr: 5,\n  kg: 1,\n  mode: 'normal',\n  preventOverlap: false,\n  dissuadeHubs: false,\n  maxIteration: 0,\n  ks: 0.1,\n  ksmax: 10,\n  tao: 0.1,\n};\n\ninterface FormattedOptions extends ForceAtlas2LayoutOptions {\n  width: number;\n  height: number;\n  maxIteration: number;\n  center: PointTuple;\n  kr: number;\n  kg: number;\n  ks: number;\n  ksmax: number;\n  tao: number;\n}\ntype ForceMap = {\n  [id: string]: PointTuple;\n};\ntype BodyMap = {\n  [id: string]: Body;\n};\ntype SizeMap = { [id: string]: number };\ntype CalcGraph = GGraph<OutNodeData, EdgeData>;\n\n/**\n * Layout nodes with force atlas 2 model\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new ForceAtlas2Layout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new ForceAtlas2Layout({ center: [100, 100] });\n * const positions = await 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 * await layout.assign(graph, { center: [100, 100] });\n */\nexport class ForceAtlas2Layout implements Layout<ForceAtlas2LayoutOptions> {\n  id = 'forceAtlas2';\n\n  constructor(\n    public options: ForceAtlas2LayoutOptions = {} as ForceAtlas2LayoutOptions,\n  ) {\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  async execute(graph: Graph, options?: ForceAtlas2LayoutOptions) {\n    return this.genericForceAtlas2Layout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: ForceAtlas2LayoutOptions) {\n    this.genericForceAtlas2Layout(true, graph, options);\n  }\n\n  private async genericForceAtlas2Layout(\n    assign: false,\n    graph: Graph,\n    options?: ForceAtlas2LayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericForceAtlas2Layout(\n    assign: true,\n    graph: Graph,\n    options?: ForceAtlas2LayoutOptions,\n  ): Promise<void>;\n  private async genericForceAtlas2Layout(\n    assign: boolean,\n    graph: Graph,\n    options?: ForceAtlas2LayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const edges = graph.getAllEdges();\n    const nodes = graph.getAllNodes();\n\n    const mergedOptions = this.formatOptions(options, nodes.length);\n    const { width, height, prune, maxIteration, nodeSize, center } =\n      mergedOptions;\n\n    if (!nodes?.length || nodes.length === 1) {\n      return handleSingleNodeGraph(graph, assign, center);\n    }\n\n    const calcNodes = nodes.map(\n      (node) => cloneFormatData(node, [width, height]) as OutNode,\n    );\n    const calcEdges = edges.filter((edge: Edge) => {\n      const { source, target } = edge;\n      return source !== target;\n    }) as OutEdge[];\n    const calcGraph = new GGraph<OutNodeData, OutEdgeData>({\n      nodes: calcNodes,\n      edges: calcEdges,\n    });\n    const sizes: SizeMap = this.getSizes(calcGraph, graph, nodeSize);\n\n    this.run(calcGraph, graph, maxIteration, sizes, assign, mergedOptions);\n\n    // if prune, place the leaves around their parents, and then re-layout for several iterations.\n    if (prune) {\n      for (let j = 0; j < calcEdges.length; j += 1) {\n        const { source, target } = calcEdges[j];\n        const sourceDegree = calcGraph.getDegree(source);\n        const targetDegree = calcGraph.getDegree(source);\n        if (sourceDegree <= 1) {\n          const targetNode = calcGraph.getNode(target);\n          calcGraph.mergeNodeData(source, {\n            x: targetNode.data.x,\n            y: targetNode.data.y,\n          });\n        } else if (targetDegree <= 1) {\n          const sourceNode = calcGraph.getNode(source);\n          calcGraph.mergeNodeData(target, {\n            x: sourceNode.data.x,\n            y: sourceNode.data.y,\n          });\n        }\n      }\n      const postOptions = {\n        ...mergedOptions,\n        prune: false,\n        barnesHut: false,\n      };\n      this.run(calcGraph, graph, 100, sizes, assign, postOptions);\n    }\n\n    return {\n      nodes: calcNodes,\n      edges,\n    };\n  }\n\n  /**\n   * Init the node positions if there is no initial positions.\n   * And pre-calculate the size (max of width and height) for each node.\n   * @param calcGraph graph for calculation\n   * @param graph origin graph\n   * @param nodeSize node size config from layout options\n   * @returns {SizeMap} node'id mapped to max of its width and height\n   */\n  private getSizes(\n    calcGraph: CalcGraph,\n    graph: Graph,\n    nodeSize?: number | number[] | ((d?: Node) => number),\n  ): SizeMap {\n    const nodes = calcGraph.getAllNodes();\n    const sizes: SizeMap = {};\n    for (let i = 0; i < nodes.length; i += 1) {\n      const { id, data } = nodes[i];\n      sizes[id] = 10;\n      if (isNumber(data.size)) {\n        sizes[id] = data.size;\n      } else if (isArray(data.size)) {\n        if (!isNaN(data.size[0])) sizes[id] = Math.max(data.size[0]);\n        if (!isNaN(data.size[1])) sizes[id] = Math.max(data.size[1]);\n      } else if (isObject(data.size)) {\n        // @ts-ignore\n        sizes[id] = Math.max(data.size.width, data.size.height);\n      } else if (isFunction(nodeSize)) {\n        const originNode = graph.getNode(id);\n        const size = nodeSize(originNode);\n        if (isArray(size)) {\n          sizes[id] = Math.max(...size);\n        } else {\n          sizes[id] = size;\n        }\n      } else if (isArray(nodeSize)) {\n        sizes[id] = Math.max(...nodeSize);\n      } else if (isNumber(nodeSize)) {\n        sizes[id] = nodeSize;\n      }\n    }\n    return sizes;\n  }\n\n  /**\n   * Format the options.\n   * @param options input options\n   * @param nodeNum number of nodes\n   * @returns formatted options\n   */\n  private formatOptions(\n    options: ForceAtlas2LayoutOptions = {},\n    nodeNum: number,\n  ): FormattedOptions {\n    const mergedOptions = { ...this.options, ...options } as FormattedOptions;\n    const { center, width, height, barnesHut, prune, maxIteration, kr, kg } =\n      mergedOptions;\n    mergedOptions.width =\n      !width && typeof window !== 'undefined' ? window.innerWidth : width;\n    mergedOptions.height =\n      !height && typeof window !== 'undefined' ? window.innerHeight : height;\n    mergedOptions.center = !center\n      ? [mergedOptions.width / 2, mergedOptions.height / 2]\n      : center;\n\n    if (barnesHut === undefined && nodeNum > 250) {\n      mergedOptions.barnesHut = true;\n    }\n    if (prune === undefined && nodeNum > 100) mergedOptions.prune = true;\n    if (maxIteration === 0 && !prune) {\n      mergedOptions.maxIteration = 250;\n      if (nodeNum <= 200 && nodeNum > 100) mergedOptions.maxIteration = 1000;\n      else if (nodeNum > 200) mergedOptions.maxIteration = 1200;\n    } else if (maxIteration === 0 && prune) {\n      mergedOptions.maxIteration = 100;\n      if (nodeNum <= 200 && nodeNum > 100) mergedOptions.maxIteration = 500;\n      else if (nodeNum > 200) mergedOptions.maxIteration = 950;\n    }\n\n    if (!kr) {\n      mergedOptions.kr = 50;\n      if (nodeNum > 100 && nodeNum <= 500) mergedOptions.kr = 20;\n      else if (nodeNum > 500) mergedOptions.kr = 1;\n    }\n    if (!kg) {\n      mergedOptions.kg = 20;\n      if (nodeNum > 100 && nodeNum <= 500) mergedOptions.kg = 10;\n      else if (nodeNum > 500) mergedOptions.kg = 1;\n    }\n\n    return mergedOptions;\n  }\n\n  /**\n   * Loops for fa2.\n   * @param calcGraph graph for calculation\n   * @param graph original graph\n   * @param iteration iteration number\n   * @param sizes nodes' size\n   * @param options formatted layout options\n   * @returns\n   */\n  private run(\n    calcGraph: CalcGraph,\n    graph: Graph,\n    iteration: number,\n    sizes: SizeMap,\n    assign: boolean,\n    options: FormattedOptions,\n  ) {\n    const { kr, barnesHut, onTick } = options;\n    const calcNodes = calcGraph.getAllNodes();\n    let sg = 0;\n    let iter = iteration;\n    const forces: ForceMap = {};\n    const preForces: ForceMap = {};\n    const bodies: BodyMap = {};\n\n    for (let i = 0; i < calcNodes.length; i += 1) {\n      const { data, id } = calcNodes[i];\n      forces[id] = [0, 0];\n\n      if (barnesHut) {\n        const params = {\n          id: i,\n          rx: data.x,\n          ry: data.y,\n          mass: 1,\n          g: kr,\n          degree: calcGraph.getDegree(id),\n        };\n        bodies[id] = new Body(params);\n      }\n    }\n\n    while (iter > 0) {\n      sg = this.oneStep(\n        calcGraph,\n        {\n          iter,\n          preventOverlapIters: 50,\n          krPrime: 100,\n          sg,\n          forces,\n          preForces,\n          bodies,\n          sizes,\n        },\n        options,\n      );\n      iter--;\n      onTick?.({\n        nodes: calcNodes,\n        edges: graph.getAllEdges(),\n      });\n      // if (assign) {\n      //   calcNodes.forEach(({ id, data }) => graph.mergeNodeData(id, {\n      //     x: data.x,\n      //     y: data.y\n      //   }))\n      // }\n    }\n\n    return calcGraph;\n  }\n\n  /**\n   * One step for a loop.\n   * @param graph graph for calculation\n   * @param params parameters for a loop\n   * @param options formatted layout's input options\n   * @returns\n   */\n  private oneStep(\n    graph: CalcGraph,\n    params: {\n      iter: number;\n      preventOverlapIters: number;\n      krPrime: number;\n      sg: number;\n      forces: ForceMap;\n      preForces: ForceMap;\n      bodies: BodyMap;\n      sizes: SizeMap;\n    },\n    options: FormattedOptions,\n  ) {\n    const { iter, preventOverlapIters, krPrime, sg, preForces, bodies, sizes } =\n      params;\n    let { forces } = params;\n    const { preventOverlap, barnesHut } = options;\n    const nodes = graph.getAllNodes();\n    for (let i = 0; i < nodes.length; i += 1) {\n      const { id } = nodes[i];\n      preForces[id] = [...forces[id]];\n      forces[id] = [0, 0];\n    }\n    // attractive forces, existing on every actual edge\n    forces = this.getAttrForces(\n      graph,\n      iter,\n      preventOverlapIters,\n      sizes,\n      forces,\n      options,\n    );\n\n    // repulsive forces and Gravity, existing on every node pair\n    // if preventOverlap, using the no-optimized method in the last preventOverlapIters instead.\n    if (\n      barnesHut &&\n      ((preventOverlap && iter > preventOverlapIters) || !preventOverlap)\n    ) {\n      forces = this.getOptRepGraForces(graph, forces, bodies, options);\n    } else {\n      forces = this.getRepGraForces(\n        graph,\n        iter,\n        preventOverlapIters,\n        forces,\n        krPrime,\n        sizes,\n        options,\n      );\n    }\n    // update the positions\n    return this.updatePos(graph, forces, preForces, sg, options);\n  }\n\n  /**\n   * Calculate the attract forces for nodes.\n   * @param graph graph for calculation\n   * @param iter current iteration index\n   * @param preventOverlapIters the iteration number for preventing overlappings\n   * @param sizes nodes' sizes\n   * @param forces forces for nodes, which will be modified\n   * @param options formatted layout's input options\n   * @returns\n   */\n  private getAttrForces(\n    graph: CalcGraph,\n    iter: number,\n    preventOverlapIters: number,\n    sizes: SizeMap,\n    forces: ForceMap,\n    options: FormattedOptions,\n  ): ForceMap {\n    const { preventOverlap, dissuadeHubs, mode, prune } = options;\n    const edges = graph.getAllEdges();\n    for (let i = 0; i < edges.length; i += 1) {\n      const { source, target } = edges[i];\n      const sourceNode = graph.getNode(source);\n      const targetNode = graph.getNode(target);\n\n      const sourceDegree = graph.getDegree(source);\n      const targetDegree = graph.getDegree(target);\n      if (prune && (sourceDegree <= 1 || targetDegree <= 1)) continue;\n\n      const dir = [\n        targetNode.data.x - sourceNode.data.x,\n        targetNode.data.y - sourceNode.data.y,\n      ];\n      let eucliDis = Math.hypot(dir[0], dir[1]);\n      eucliDis = eucliDis < 0.0001 ? 0.0001 : eucliDis;\n      dir[0] = dir[0] / eucliDis;\n      dir[1] = dir[1] / eucliDis;\n\n      if (preventOverlap && iter < preventOverlapIters) {\n        eucliDis = eucliDis - sizes[source] - sizes[target];\n      }\n      let fa1 = eucliDis;\n      let fa2 = fa1;\n      if (mode === 'linlog') {\n        fa1 = Math.log(1 + eucliDis);\n        fa2 = fa1;\n      }\n      if (dissuadeHubs) {\n        fa1 = eucliDis / sourceDegree;\n        fa2 = eucliDis / targetDegree;\n      }\n      if (preventOverlap && iter < preventOverlapIters && eucliDis <= 0) {\n        fa1 = 0;\n        fa2 = 0;\n      } else if (preventOverlap && iter < preventOverlapIters && eucliDis > 0) {\n        fa1 = eucliDis;\n        fa2 = eucliDis;\n      }\n      forces[source][0] += fa1 * dir[0];\n      forces[target][0] -= fa2 * dir[0];\n      forces[source][1] += fa1 * dir[1];\n      forces[target][1] -= fa2 * dir[1];\n    }\n    return forces;\n  }\n\n  /**\n   * Calculate the repulsive forces for nodes under barnesHut mode.\n   * @param graph graph for calculatiion\n   * @param forces forces for nodes, which will be modified\n   * @param bodies force body map\n   * @param options formatted layout's input options\n   * @returns\n   */\n  private getOptRepGraForces(\n    graph: CalcGraph,\n    forces: ForceMap,\n    bodies: BodyMap,\n    options: FormattedOptions,\n  ) {\n    const { kg, center, prune } = options;\n    const nodes = graph.getAllNodes();\n    const nodeNum = nodes.length;\n    let minx = 9e10;\n    let maxx = -9e10;\n    let miny = 9e10;\n    let maxy = -9e10;\n    for (let i = 0; i < nodeNum; i += 1) {\n      const { id, data } = nodes[i];\n      if (prune && graph.getDegree(id) <= 1) continue;\n      bodies[id].setPos(data.x, data.y);\n      if (data.x >= maxx) maxx = data.x;\n      if (data.x <= minx) minx = data.x;\n      if (data.y >= maxy) maxy = data.y;\n      if (data.y <= miny) miny = data.y;\n    }\n\n    const width = Math.max(maxx - minx, maxy - miny);\n\n    const quadParams = {\n      xmid: (maxx + minx) / 2,\n      ymid: (maxy + miny) / 2,\n      length: width,\n      massCenter: center,\n      mass: nodeNum,\n    };\n    const quad = new Quad(quadParams);\n    const quadTree = new QuadTree(quad);\n\n    // build the tree, insert the nodes(quads) into the tree\n    for (let i = 0; i < nodeNum; i += 1) {\n      const { id } = nodes[i];\n      if (prune && graph.getDegree(id) <= 1) continue;\n\n      if (bodies[id].in(quad)) quadTree.insert(bodies[id]);\n    }\n    // update the repulsive forces and the gravity.\n    for (let i = 0; i < nodeNum; i += 1) {\n      const { id, data } = nodes[i];\n      const degree = graph.getDegree(id);\n      if (prune && degree <= 1) continue;\n\n      bodies[id].resetForce();\n      quadTree.updateForce(bodies[id]);\n      forces[id][0] -= bodies[id].fx;\n      forces[id][1] -= bodies[id].fy;\n\n      // gravity\n      const dir = [data.x - center[0], data.y - center[1]];\n      let eucliDis = Math.hypot(dir[0], dir[1]);\n      eucliDis = eucliDis < 0.0001 ? 0.0001 : eucliDis;\n      dir[0] = dir[0] / eucliDis;\n      dir[1] = dir[1] / eucliDis;\n      const fg = kg * (degree + 1); // tslint:disable-line\n      forces[id][0] -= fg * dir[0];\n      forces[id][1] -= fg * dir[1];\n    }\n    return forces;\n  }\n\n  /**\n   * Calculate the repulsive forces for nodes.\n   * @param graph graph for calculatiion\n   * @param iter current iteration index\n   * @param preventOverlapIters the iteration number for preventing overlappings\n   * @param forces forces for nodes, which will be modified\n   * @param krPrime larger the krPrime, larger the repulsive force\n   * @param sizes nodes' sizes\n   * @param options formatted layout's input options\n   * @returns\n   */\n  private getRepGraForces(\n    graph: CalcGraph,\n    iter: number,\n    preventOverlapIters: number,\n    forces: ForceMap,\n    krPrime: number,\n    sizes: SizeMap,\n    options: FormattedOptions,\n  ): ForceMap {\n    const { preventOverlap, kr, kg, center, prune } = options;\n    const nodes = graph.getAllNodes();\n    const nodeNum = nodes.length;\n    for (let i = 0; i < nodeNum; i += 1) {\n      const nodei = nodes[i];\n      const degreei = graph.getDegree(nodei.id);\n      for (let j = i + 1; j < nodeNum; j += 1) {\n        const nodej = nodes[j];\n        const degreej = graph.getDegree(nodej.id);\n\n        if (prune && (degreei <= 1 || degreej <= 1)) continue;\n\n        const dir = [nodej.data.x - nodei.data.x, nodej.data.y - nodei.data.y];\n        let eucliDis = Math.hypot(dir[0], dir[1]);\n        eucliDis = eucliDis < 0.0001 ? 0.0001 : eucliDis;\n        dir[0] = dir[0] / eucliDis;\n        dir[1] = dir[1] / eucliDis;\n\n        if (preventOverlap && iter < preventOverlapIters) {\n          eucliDis = eucliDis - sizes[nodei.id] - sizes[nodej.id];\n        }\n\n        let fr = (kr * (degreei + 1) * (degreej + 1)) / eucliDis;\n\n        if (preventOverlap && iter < preventOverlapIters && eucliDis < 0) {\n          fr = krPrime * (degreei + 1) * (degreej + 1);\n        } else if (\n          preventOverlap &&\n          iter < preventOverlapIters &&\n          eucliDis === 0\n        ) {\n          fr = 0;\n        } else if (\n          preventOverlap &&\n          iter < preventOverlapIters &&\n          eucliDis > 0\n        ) {\n          fr = (kr * (degreei + 1) * (degreej + 1)) / eucliDis;\n        }\n        forces[nodei.id][0] -= fr * dir[0];\n        forces[nodej.id][0] += fr * dir[0];\n        forces[nodei.id][1] -= fr * dir[1];\n        forces[nodej.id][1] += fr * dir[1];\n      }\n\n      // gravity\n      const dir = [nodei.data.x - center[0], nodei.data.y - center[1]];\n      const eucliDis = Math.hypot(dir[0], dir[1]);\n      dir[0] = dir[0] / eucliDis;\n      dir[1] = dir[1] / eucliDis;\n      const fg = kg * (degreei + 1); // tslint:disable-line\n      forces[nodei.id][0] -= fg * dir[0];\n      forces[nodei.id][1] -= fg * dir[1];\n    }\n    return forces;\n  }\n\n  /**\n   * Update node positions.\n   * @param graph graph for calculatiion\n   * @param forces forces for nodes, which will be modified\n   * @param preForces previous forces for nodes, which will be modified\n   * @param sg constant for move distance of one step\n   * @param options formatted layout's input options\n   * @returns\n   */\n  private updatePos(\n    graph: CalcGraph,\n    forces: ForceMap,\n    preForces: ForceMap,\n    sg: number,\n    options: FormattedOptions,\n  ): number {\n    const { ks, tao, prune, ksmax } = options;\n    const nodes = graph.getAllNodes();\n    const nodeNum = nodes.length;\n    const swgns = [];\n    const trans = [];\n    // swg(G) and tra(G)\n    let swgG = 0;\n    let traG = 0;\n    let usingSg = sg;\n    for (let i = 0; i < nodeNum; i += 1) {\n      const { id } = nodes[i];\n      const degree = graph.getDegree(id);\n      if (prune && degree <= 1) continue;\n\n      const minus = [\n        forces[id][0] - preForces[id][0],\n        forces[id][1] - preForces[id][1],\n      ];\n      const minusNorm = Math.hypot(minus[0], minus[1]);\n      const add = [\n        forces[id][0] + preForces[id][0],\n        forces[id][1] + preForces[id][1],\n      ];\n      const addNorm = Math.hypot(add[0], add[1]);\n\n      swgns[i] = minusNorm;\n      trans[i] = addNorm / 2;\n\n      swgG += (degree + 1) * swgns[i];\n      traG += (degree + 1) * trans[i];\n    }\n\n    const preSG = usingSg;\n    usingSg = (tao * traG) / swgG;\n    if (preSG !== 0) {\n      usingSg = usingSg > 1.5 * preSG ? 1.5 * preSG : usingSg;\n    }\n    // update the node positions\n    for (let i = 0; i < nodeNum; i += 1) {\n      const { id, data } = nodes[i];\n      const degree = graph.getDegree(id);\n      if (prune && degree <= 1) continue;\n      if (isNumber(data.fx) && isNumber(data.fy)) continue;\n\n      let sn = (ks * usingSg) / (1 + usingSg * Math.sqrt(swgns[i]));\n      let absForce = Math.hypot(forces[id][0], forces[id][1]);\n      absForce = absForce < 0.0001 ? 0.0001 : absForce;\n      const max = ksmax / absForce;\n      sn = sn > max ? max : sn;\n      const dnx = sn * forces[id][0];\n      const dny = sn * forces[id][1];\n      graph.mergeNodeData(id, {\n        x: data.x + dnx,\n        y: data.y + dny,\n      });\n    }\n    return usingSg;\n  }\n}\n","import { Graph as IGraph } from '@antv/graphlib';\nimport { isNumber } from '@antv/util';\nimport type {\n  EdgeData,\n  FruchtermanLayoutOptions,\n  Graph,\n  LayoutMapping,\n  LayoutWithIterations,\n  OutEdge,\n  OutEdgeData,\n  OutNode,\n  OutNodeData,\n  Point,\n  PointTuple\n} from './types';\nimport { cloneFormatData } from './util';\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<FruchtermanLayoutOptions> = {\n  maxIteration: 1000,\n  gravity: 10,\n  speed: 5,\n  clustering: false,\n  clusterGravity: 10,\n  width: 300,\n  height: 300,\n  nodeClusterBy: 'cluster',\n};\nconst SPEED_DIVISOR = 800;\n\ninterface ClusterMap {\n  [clusterName: string]: {\n    name: string;\n    cx: number;\n    cy: number;\n    count: number;\n  };\n}\n\ntype CalcGraph = IGraph<OutNodeData, EdgeData>;\n\ntype DisplacementMap = {\n  [id: string]: Point;\n};\n\ninterface FormattedOptions extends FruchtermanLayoutOptions {\n  width: number;\n  height: number;\n  center: PointTuple;\n  maxIteration: number;\n  nodeClusterBy: string;\n  gravity: number;\n  speed: number;\n}\n\n/**\n * Layout with fructherman force model\n *\n * @example\n * // Assign layout options when initialization.\n * const layout = new FruchtermanLayout({ center: [100, 100] });\n * const positions = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new FruchtermanLayout({ center: [100, 100] });\n * const positions = await 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 * await layout.assign(graph, { center: [100, 100] });\n */\nexport class FruchtermanLayout\n  implements LayoutWithIterations<FruchtermanLayoutOptions>\n{\n  id = 'fruchterman';\n\n  private timeInterval: number = 0;\n\n  private running: boolean = false;\n  private lastLayoutNodes: OutNode[];\n  private lastLayoutEdges: OutEdge[];\n  private lastAssign: boolean;\n  private lastGraph: IGraph<OutNodeData, EdgeData>;\n  private lastOptions: FormattedOptions;\n  private lastClusterMap: ClusterMap;\n  private lastResult: LayoutMapping;\n\n  constructor(\n    public options: FruchtermanLayoutOptions = {} as FruchtermanLayoutOptions,\n  ) {\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  async execute(graph: Graph, options?: FruchtermanLayoutOptions) {\n    return this.genericFruchtermanLayout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: FruchtermanLayoutOptions) {\n    this.genericFruchtermanLayout(true, graph, options);\n  }\n\n  /**\n   * Stop simulation immediately.\n   */\n  stop() {\n    if (this.timeInterval && typeof window !== 'undefined') {\n      window.clearInterval(this.timeInterval);\n    }\n    this.running = false;\n  }\n\n  /**\n   * Manually steps the simulation by the specified number of iterations.\n   * @see https://github.com/d3/d3-force#simulation_tick\n   */\n  tick(iterations = this.options.maxIteration || 1) {\n    if (this.lastResult) {\n      return this.lastResult;\n    }\n\n    for (let i = 0; i < iterations; i++) {\n      this.runOneStep(this.lastGraph, this.lastClusterMap, this.lastOptions);\n    }\n\n    const result = {\n      nodes: this.lastLayoutNodes,\n      edges: this.lastLayoutEdges,\n    };\n\n    if (this.lastAssign) {\n      result.nodes.forEach((node) =>\n        this.lastGraph.mergeNodeData(node.id, {\n          x: node.data.x,\n          y: node.data.y,\n          z: this.options.dimensions === 3 ? node.data.z : undefined,\n        }),\n      );\n    }\n\n    return result;\n  }\n\n  private async genericFruchtermanLayout(\n    assign: false,\n    graph: Graph,\n    options?: FruchtermanLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericFruchtermanLayout(\n    assign: true,\n    graph: Graph,\n    options?: FruchtermanLayoutOptions,\n  ): Promise<void>;\n  private async genericFruchtermanLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: FruchtermanLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    if (this.running) return;\n\n    const formattedOptions = this.formatOptions(options);\n    const {\n      dimensions,\n      width,\n      height,\n      center,\n      clustering,\n      nodeClusterBy,\n      maxIteration,\n      onTick,\n    } = formattedOptions;\n\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges();\n\n    if (!nodes?.length) {\n      const result = { nodes: [] as any[], edges };\n      this.lastResult = result;\n      return result;\n    }\n\n    if (nodes.length === 1) {\n      if (assign) {\n        graph.mergeNodeData(nodes[0].id, {\n          x: center[0],\n          y: center[1],\n          z: dimensions === 3 ? center[2] : undefined,\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              z: dimensions === 3 ? center[2] : undefined,\n            },\n          },\n        ],\n        edges,\n      };\n      this.lastResult = result;\n      return result;\n    }\n\n    const layoutNodes: OutNode[] = nodes.map(\n      (node) => cloneFormatData(node, [width, height]) as OutNode,\n    );\n    const calcGraph = new IGraph<OutNodeData, OutEdgeData>({\n      nodes: layoutNodes,\n      edges,\n    });\n\n    // clustering info\n    const clusterMap: ClusterMap = {};\n    if (clustering) {\n      layoutNodes.forEach((node) => {\n        const clusterValue = node.data[nodeClusterBy] as string;\n        if (!clusterMap[clusterValue]) {\n          clusterMap[clusterValue] = {\n            name: clusterValue,\n            cx: 0,\n            cy: 0,\n            count: 0,\n          };\n        }\n      });\n    }\n\n    // Use them later in `tick`.\n    this.lastLayoutNodes = layoutNodes;\n    this.lastLayoutEdges = edges;\n    this.lastAssign = assign;\n    this.lastGraph = calcGraph;\n    this.lastOptions = formattedOptions;\n    this.lastClusterMap = clusterMap;\n\n    if (typeof window === 'undefined') return;\n    let iter = 0;\n\n    return new Promise((resolve) => {\n      // interval for render the result after each iteration\n      this.timeInterval = window.setInterval(() => {\n        if (!this.running) {\n          resolve({ nodes: layoutNodes, edges });\n          return;\n        }\n\n        this.runOneStep(calcGraph, clusterMap, formattedOptions);\n        if (assign) {\n          layoutNodes.forEach(({ id, data }) =>\n            graph.mergeNodeData(id, {\n              x: data.x,\n              y: data.y,\n              z: dimensions === 3 ? data.z : undefined,\n            }),\n          );\n        }\n        onTick?.({\n          nodes: layoutNodes,\n          edges,\n        });\n        iter++;\n        if (iter >= maxIteration) {\n          window.clearInterval(this.timeInterval);\n          resolve({ nodes: layoutNodes, edges });\n        }\n      }, 0);\n      this.running = true;\n    });\n  }\n\n  private formatOptions(\n    options: FruchtermanLayoutOptions = {},\n  ): FormattedOptions {\n    const mergedOptions = { ...this.options, ...options } as FormattedOptions;\n    const { clustering, nodeClusterBy } = mergedOptions;\n\n    const {\n      center: propsCenter,\n      width: propsWidth,\n      height: propsHeight,\n    } = mergedOptions;\n    mergedOptions.width =\n      !propsWidth && typeof window !== 'undefined'\n        ? window.innerWidth\n        : (propsWidth as number);\n    mergedOptions.height =\n      !propsHeight && typeof window !== 'undefined'\n        ? window.innerHeight\n        : (propsHeight as number);\n    mergedOptions.center = !propsCenter\n      ? [mergedOptions.width / 2, mergedOptions.height / 2]\n      : (propsCenter as PointTuple);\n\n    mergedOptions.clustering = clustering && !!nodeClusterBy;\n\n    return mergedOptions;\n  }\n\n  private runOneStep(\n    calcGraph: CalcGraph,\n    clusterMap: ClusterMap,\n    options: FormattedOptions,\n  ) {\n    const {\n      dimensions,\n      height,\n      width,\n      gravity,\n      center,\n      speed,\n      clustering,\n      nodeClusterBy,\n      clusterGravity: propsClusterGravity,\n    } = options;\n    const area = height * width;\n    const maxDisplace = Math.sqrt(area) / 10;\n    const nodes = calcGraph.getAllNodes();\n    const k2 = area / (nodes.length + 1);\n    const k = Math.sqrt(k2);\n    const displacements: DisplacementMap = {};\n    this.applyCalculate(calcGraph, displacements, k, k2);\n\n    // gravity for clusters\n    if (clustering) {\n      // reset the clustering centers\n      for (const key in clusterMap) {\n        clusterMap[key].cx = 0;\n        clusterMap[key].cy = 0;\n        clusterMap[key].count = 0;\n      }\n      // re-compute clustering centers\n      nodes.forEach((node) => {\n        const { data } = node; // node is one of layoutNodes, which is formatted and data field exists\n        const c = clusterMap[data[nodeClusterBy] as string];\n        if (isNumber(data.x)) {\n          c.cx += data.x;\n        }\n        if (isNumber(data.y)) {\n          c.cy += data.y;\n        }\n        c.count++;\n      });\n      for (const key in clusterMap) {\n        clusterMap[key].cx /= clusterMap[key].count;\n        clusterMap[key].cy /= clusterMap[key].count;\n      }\n\n      // compute the cluster gravity forces\n      const clusterGravity = (propsClusterGravity || gravity) as number;\n      nodes.forEach((node, j) => {\n        const { id, data } = node;\n        if (!isNumber(data.x) || !isNumber(data.y)) return;\n        const c = clusterMap[data[nodeClusterBy] as string];\n        const distLength = Math.sqrt(\n          (data.x - c.cx) * (data.x - c.cx) + (data.y - c.cy) * (data.y - c.cy),\n        );\n        const gravityForce = k * clusterGravity;\n        displacements[id].x -= (gravityForce * (data.x - c.cx)) / distLength;\n        displacements[id].y -= (gravityForce * (data.y - c.cy)) / distLength;\n      });\n    }\n\n    // gravity\n    nodes.forEach((node, j) => {\n      const { id, data } = node;\n      if (!isNumber(data.x) || !isNumber(data.y)) return;\n      const gravityForce = 0.01 * k * gravity;\n      displacements[id].x -= gravityForce * (data.x - center[0]);\n      displacements[id].y -= gravityForce * (data.y - center[1]);\n      if (dimensions === 3) {\n        displacements[id].z -= gravityForce * (data.z - center[2]);\n      }\n    });\n\n    // move\n    nodes.forEach((node: OutNode, j) => {\n      const { id, data } = node;\n      if (isNumber(data.fx) && isNumber(data.fy)) {\n        data.x = data.fx as number;\n        data.y = data.fy as number;\n        if (dimensions === 3) {\n          data.z = data.fz as number;\n        }\n        return;\n      }\n      if (!isNumber(data.x) || !isNumber(data.y)) return;\n      const distLength = Math.sqrt(\n        displacements[id].x * displacements[id].x +\n          displacements[id].y * displacements[id].y +\n          (dimensions === 3 ? displacements[id].z * displacements[id].z : 0),\n      );\n      if (distLength > 0) {\n        // && !n.isFixed()\n        const limitedDist = Math.min(\n          maxDisplace * (speed / SPEED_DIVISOR),\n          distLength,\n        );\n        calcGraph.mergeNodeData(id, {\n          x: data.x + (displacements[id].x / distLength) * limitedDist,\n          y: data.y + (displacements[id].y / distLength) * limitedDist,\n          z:\n            dimensions === 3\n              ? data.z + (displacements[id].z / distLength) * limitedDist\n              : undefined,\n        });\n      }\n    });\n  }\n  private applyCalculate(\n    calcGraph: CalcGraph,\n    displacements: DisplacementMap,\n    k: number,\n    k2: number,\n  ) {\n    this.calRepulsive(calcGraph, displacements, k2);\n    this.calAttractive(calcGraph, displacements, k);\n  }\n\n  private calRepulsive(\n    calcGraph: CalcGraph,\n    displacements: DisplacementMap,\n    k2: number,\n  ) {\n    const nodes = calcGraph.getAllNodes();\n    nodes.forEach(({ data: v, id: vid }, i) => {\n      displacements[vid] = { x: 0, y: 0, z: 0 };\n      nodes.forEach(({ data: u, id: uid }, j) => {\n        if (\n          i <= j ||\n          !isNumber(v.x) ||\n          !isNumber(u.x) ||\n          !isNumber(v.y) ||\n          !isNumber(u.y)\n        ) {\n          return;\n        }\n        let vecX = v.x - u.x;\n        let vecY = v.y - u.y;\n        let vecZ = this.options.dimensions === 3 ? v.z - u.z : 0;\n        let lengthSqr = vecX * vecX + vecY * vecY + vecZ * vecZ;\n        if (lengthSqr === 0) {\n          lengthSqr = 1;\n          vecX = 0.01;\n          vecY = 0.01;\n          vecZ = 0.01;\n        }\n        const common = k2 / lengthSqr;\n        const dispX = vecX * common;\n        const dispY = vecY * common;\n        const dispZ = vecZ * common;\n        displacements[vid].x += dispX;\n        displacements[vid].y += dispY;\n        displacements[uid].x -= dispX;\n        displacements[uid].y -= dispY;\n\n        if (this.options.dimensions === 3) {\n          displacements[vid].z += dispZ;\n          displacements[uid].z -= dispZ;\n        }\n      });\n    });\n  }\n\n  private calAttractive(\n    calcGraph: CalcGraph,\n    displacements: DisplacementMap,\n    k: number,\n  ) {\n    const edges = calcGraph.getAllEdges();\n    edges.forEach((e) => {\n      const { source, target } = e;\n      if (!source || !target || source === target) {\n        return;\n      }\n      const { data: u } = calcGraph.getNode(source);\n      const { data: v } = calcGraph.getNode(target);\n      if (\n        !isNumber(v.x) ||\n        !isNumber(u.x) ||\n        !isNumber(v.y) ||\n        !isNumber(u.y)\n      ) {\n        return;\n      }\n      const vecX = v.x - u.x;\n      const vecY = v.y - u.y;\n      const vecZ = this.options.dimensions === 3 ? v.z - u.z : 0;\n      const common = Math.sqrt(vecX * vecX + vecY * vecY + vecZ * vecZ) / k;\n      const dispX = vecX * common;\n      const dispY = vecY * common;\n      const dispZ = vecZ * common;\n      displacements[source].x += dispX;\n      displacements[source].y += dispY;\n      displacements[target].x -= dispX;\n      displacements[target].y -= dispY;\n\n      if (this.options.dimensions === 3) {\n        displacements[source].z += dispZ;\n        displacements[target].z -= dispZ;\n      }\n    });\n  }\n}\n","import { isNumber, isString } from '@antv/util';\nimport type {\n  Edge,\n  Graph,\n  GridLayoutOptions,\n  Layout,\n  LayoutMapping,\n  Node,\n  OutNode,\n  PointTuple,\n} from './types';\nimport { cloneFormatData, formatNumberFn, formatSizeFn, isArray } from './util';\nimport { handleSingleNodeGraph } from './util/common';\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 = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new GridLayout({ rows: 10 });\n * const positions = await layout.execute(graph, { rows: 20 }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { rows: 20 });\n */\nexport class GridLayout implements Layout<GridLayoutOptions> {\n  id = 'grid';\n\n  constructor(public options: GridLayoutOptions = {} as GridLayoutOptions) {\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  async execute(graph: Graph, options?: GridLayoutOptions) {\n    return this.genericGridLayout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: GridLayoutOptions) {\n    this.genericGridLayout(true, graph, options);\n  }\n\n  private async genericGridLayout(\n    assign: false,\n    graph: Graph,\n    options?: GridLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericGridLayout(\n    assign: true,\n    graph: Graph,\n    options?: GridLayoutOptions,\n  ): Promise<void>;\n  private async genericGridLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: GridLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      begin = [0, 0],\n      condense,\n      preventOverlapPadding,\n      preventOverlap,\n      rows: propsRows,\n      cols: propsCols,\n      nodeSpacing: paramNodeSpacing,\n      nodeSize: paramNodeSize,\n      width: propsWidth,\n      height: propsHeight,\n      position,\n    } = mergedOptions;\n    let { sortBy } = mergedOptions;\n\n    const nodes: Node[] = graph.getAllNodes();\n    const edges: Edge[] = graph.getAllEdges();\n\n    const n = nodes?.length;\n\n    // Need no layout if there is no node.\n    if (!n || n === 1) {\n      return handleSingleNodeGraph(graph, assign, begin);\n    }\n\n    const layoutNodes: OutNode[] = nodes.map(\n      (node) => cloneFormatData(node) as OutNode,\n    );\n\n    if (\n      // `id` should be reserved keyword\n      sortBy !== 'id' &&\n      (!isString(sortBy) || (layoutNodes[0] as any).data[sortBy] === undefined)\n    ) {\n      sortBy = 'degree';\n    }\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 if (sortBy === 'id') {\n      // sort nodes by ID\n      layoutNodes.sort((n1, n2) => {\n        if (isNumber(n2.id) && isNumber(n1.id)) {\n          return n2.id - n1.id;\n        }\n        return `${n1.id}`.localeCompare(`${n2.id}`);\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 = formatNumberFn(\n        10,\n        paramNodeSpacing as number,\n      );\n      const nodeSize: Function = formatSizeFn(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    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","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 = (\n  graph: Graph,\n  options: RadialNonoverlapForceOptions,\n): Point[] => {\n  const mergedOptions = { ...DEFAULTS_LAYOUT_OPTIONS, ...options };\n  const {\n    positions,\n    iterations,\n    width,\n    k,\n    speed = 100,\n    strictRadial,\n    focusIdx,\n    radii = [],\n    nodeSizeFunc,\n  } = 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(\n      positions,\n      disp,\n      speed,\n      strictRadial,\n      focusIdx,\n      maxDisplace,\n      width,\n      radii,\n    );\n  }\n  return positions;\n};\n\nconst getRepulsion = (\n  nodes: Node[],\n  positions: Point[],\n  disp: Point[],\n  k: number,\n  radii: number[],\n  nodeSizeFunc: (node: Node) => number,\n) => {\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 = (\n  positions: Point[],\n  disp: Point[],\n  speed: number,\n  strictRadial: boolean,\n  focusIdx: number,\n  maxDisplace: number,\n  width: number,\n  radii: number[],\n) => {\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(\n        maxDisp * (speed / SPEED_DIVISOR),\n        distLength,\n      );\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};\n","import { isString } from '@antv/util';\nimport type {\n  Graph,\n  Layout,\n  LayoutMapping,\n  Matrix,\n  Node,\n  OutNode,\n  Point,\n  PointTuple,\n  RadialLayoutOptions,\n} from '../types';\nimport {\n  cloneFormatData,\n  floydWarshall,\n  formatNodeSize,\n  getAdjMatrix,\n  getEuclideanDistance,\n} from '../util';\nimport { handleSingleNodeGraph } from '../util/common';\nimport { mds } from './mds';\nimport {\n  radialNonoverlapForce,\n  RadialNonoverlapForceOptions,\n} from './radial-nonoverlap-force';\n\nconst DEFAULTS_LAYOUT_OPTIONS: Partial<RadialLayoutOptions> = {\n  maxIteration: 1000,\n  focusNode: null,\n  unitRadius: null,\n  linkDistance: 50,\n  preventOverlap: false,\n  strictRadial: true,\n  maxPreventOverlapIteration: 200,\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 = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new RadialLayout({ focusNode: 'node0' });\n * const positions = await layout.execute(graph, { focusNode: 'node0' }); // { nodes: [], edges: [] }\n *\n * // If you want to assign the positions directly to the nodes, use assign method.\n * await layout.assign(graph, { focusNode: 'node0' });\n */\nexport class RadialLayout implements Layout<RadialLayoutOptions> {\n  id = 'radial';\n\n  constructor(public options: RadialLayoutOptions = {} as RadialLayoutOptions) {\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  async execute(graph: Graph, options?: RadialLayoutOptions) {\n    return this.genericRadialLayout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: RadialLayoutOptions) {\n    this.genericRadialLayout(true, graph, options);\n  }\n\n  private async genericRadialLayout(\n    assign: false,\n    graph: Graph,\n    options?: RadialLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericRadialLayout(\n    assign: true,\n    graph: Graph,\n    options?: RadialLayoutOptions,\n  ): Promise<void>;\n  private async genericRadialLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: RadialLayoutOptions,\n  ): Promise<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    } = mergedOptions;\n\n    const nodes = graph.getAllNodes();\n    const edges = graph.getAllEdges();\n\n    const width =\n      !propsWidth && typeof window !== 'undefined'\n        ? window.innerWidth\n        : propsWidth!;\n    const height =\n      !propsHeight && typeof window !== 'undefined'\n        ? window.innerHeight\n        : propsHeight!;\n    const center = (\n      !propsCenter ? [width / 2, height / 2] : propsCenter\n    ) as PointTuple;\n\n    if (!nodes?.length || nodes.length === 1) {\n      return handleSingleNodeGraph(graph, assign, center);\n    }\n\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(\n      nodes,\n      distances,\n      linkDistance,\n      radii,\n      unitRadius,\n      sortBy,\n      sortStrength,\n    );\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    const mdsResult = mds(linkDistance, idealDistances, linkDistance);\n    let positions = mdsResult.map(([x, y]) => ({\n      x:\n        (isNaN(x) ? Math.random() * linkDistance : x) -\n        mdsResult[focusIndex][0],\n      y:\n        (isNaN(y) ? Math.random() * linkDistance : y) -\n        mdsResult[focusIndex][1],\n    }));\n\n    this.run(\n      maxIteration,\n      positions,\n      weights,\n      idealDistances,\n      radii,\n      focusIndex,\n    );\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      const cnode = cloneFormatData(nodes[i]) as OutNode;\n      cnode.data.x = p.x + center[0];\n      cnode.data.y = p.y + 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\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(\n        param,\n        positions,\n        radii,\n        idealDistances,\n        weights,\n        focusIndex,\n      );\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 = getEuclideanDistance(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 = getEuclideanDistance(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    // cache the value of field sortBy for nodes to avoid dupliate calculation\n    const sortValueCache: {\n      [id: string]: number;\n    } = {};\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)) / (radii[i] / unitRadius),\n            );\n          } else if (sortBy) {\n            // sort the nodes on the same circle according to the attributes\n            let iValue: number;\n            let jValue: number;\n            if (sortValueCache[nodes[i].id]) {\n              iValue = sortValueCache[nodes[i].id];\n            } else {\n              const value =\n                (sortBy === 'id'\n                  ? nodes[i].id\n                  : (nodes[i].data?.[sortBy] as number | string)) || 0;\n              if (isString(value)) {\n                iValue = value.charCodeAt(0);\n              } else {\n                iValue = value;\n              }\n              sortValueCache[nodes[i].id] = iValue;\n            }\n\n            if (sortValueCache[nodes[j].id]) {\n              jValue = sortValueCache[nodes[j].id];\n            } else {\n              const value =\n                (sortBy === 'id'\n                  ? nodes[j].id\n                  : (nodes[j].data?.[sortBy] as number | string)) || 0;\n              if (isString(value)) {\n                jValue = value.charCodeAt(0);\n              } else {\n                jValue = value;\n              }\n              sortValueCache[nodes[j].id] = jValue;\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\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","import type {\n  Graph,\n  Layout,\n  LayoutMapping,\n  OutNode,\n  PointTuple,\n  RandomLayoutOptions,\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 = await layout.execute(graph); // { nodes: [], edges: [] }\n *\n * // Or use different options later.\n * const layout = new RandomLayout({ center: [100, 100] });\n * const positions = await 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 * await layout.assign(graph, { center: [100, 100] });\n */\nexport class RandomLayout implements Layout<RandomLayoutOptions> {\n  id = 'random';\n\n  constructor(public options: RandomLayoutOptions = {} as RandomLayoutOptions) {\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  async execute(graph: Graph, options?: RandomLayoutOptions) {\n    return this.genericRandomLayout(false, graph, options);\n  }\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  async assign(graph: Graph, options?: RandomLayoutOptions) {\n    this.genericRandomLayout(true, graph, options);\n  }\n\n  private async genericRandomLayout(\n    assign: false,\n    graph: Graph,\n    options?: RandomLayoutOptions,\n  ): Promise<LayoutMapping>;\n  private async genericRandomLayout(\n    assign: true,\n    graph: Graph,\n    options?: RandomLayoutOptions,\n  ): Promise<void>;\n  private async genericRandomLayout(\n    assign: boolean,\n    graph: Graph,\n    options?: RandomLayoutOptions,\n  ): Promise<LayoutMapping | void> {\n    const mergedOptions = { ...this.options, ...options };\n    const {\n      center: propsCenter,\n      width: propsWidth,\n      height: propsHeight,\n    } = mergedOptions;\n\n    const nodes = graph.getAllNodes();\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    return result;\n  }\n}\n","import { AntVDagreLayout } from './antv-dagre';\nimport { CircularLayout } from './circular';\nimport { ComboCombinedLayout } from './comboCombined';\nimport { ConcentricLayout } from './concentric';\nimport { D3ForceLayout } from './d3Force';\nimport { DagreLayout } from './dagre';\nimport { ForceLayout } from './force';\nimport { ForceAtlas2Layout } from './forceAtlas2';\nimport { FruchtermanLayout } from './fruchterman';\nimport { GridLayout } from './grid';\nimport { MDSLayout } from './mds';\nimport { RadialLayout } from './radial';\nimport { RandomLayout } from './random';\nimport type { Layout } from './types';\n\nexport const registry: Record<string, new (...args: any) => Layout<any>> = {\n  circular: CircularLayout,\n  concentric: ConcentricLayout,\n  mds: MDSLayout,\n  random: RandomLayout,\n  grid: GridLayout,\n  radial: RadialLayout,\n  force: ForceLayout,\n  d3force: D3ForceLayout,\n  fruchterman: FruchtermanLayout,\n  forceAtlas2: ForceAtlas2Layout,\n  dagre: DagreLayout,\n  antvDagre: AntVDagreLayout,\n  comboCombined: ComboCombinedLayout,\n};\n","import { Matrix as MLMatrix, SingularValueDecomposition } from 'ml-matrix';\nimport type { Matrix, PointTuple } from '../types';\n\nexport const mds = (\n  dimension: number,\n  distances: Matrix[],\n  linkDistance: number,\n): PointTuple[] => {\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])\n        .toJSON()[0]\n        .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};\n","export default function(x, y) {\n  var nodes, strength = 1;\n\n  if (x == null) x = 0;\n  if (y == null) y = 0;\n\n  function force() {\n    var i,\n        n = nodes.length,\n        node,\n        sx = 0,\n        sy = 0;\n\n    for (i = 0; i < n; ++i) {\n      node = nodes[i], sx += node.x, sy += node.y;\n    }\n\n    for (sx = (sx / n - x) * strength, sy = (sy / n - y) * strength, i = 0; i < n; ++i) {\n      node = nodes[i], node.x -= sx, node.y -= sy;\n    }\n  }\n\n  force.initialize = function(_) {\n    nodes = _;\n  };\n\n  force.x = function(_) {\n    return arguments.length ? (x = +_, force) : x;\n  };\n\n  force.y = function(_) {\n    return arguments.length ? (y = +_, force) : y;\n  };\n\n  force.strength = function(_) {\n    return arguments.length ? (strength = +_, force) : strength;\n  };\n\n  return force;\n}\n","// isFinite,\nvar isNil = function (value) {\n    /**\n     * isNil(null) => true\n     * isNil() => true\n     */\n    return value === null || value === undefined;\n};\nexport default isNil;\n//# sourceMappingURL=is-nil.js.map","import { Graph } from '@antv/graphlib';\n// import { setupTransferableMethodsOnWorker } from \"@naoak/workerize-transferable\";\nimport { registry } from './registry';\nimport type { Payload } from './supervisor';\nimport { isLayoutWithIterations, Layout, LayoutWithIterations } from './types';\n\n// @see https://www.npmjs.com/package/@naoak/workerize-transferable\n// setupTransferableMethodsOnWorker({\n//   // The name of function which use some transferables.\n//   calculateLayout: {\n//     // Specify an instance of the function\n//     fn: calculateLayout,\n//     // Pick a transferable object from the result which is an instance of Float32Array\n//     pickTransferablesFromResult: (result) => [result[1].buffer],\n//   },\n// });\n\nlet currentLayout: Layout<any>;\n\nexport function stopLayout() {\n  if ((currentLayout as LayoutWithIterations<any>)?.stop) {\n    (currentLayout as LayoutWithIterations<any>).stop();\n  }\n}\n\nexport async function calculateLayout(\n  payload: Payload,\n  transferables: Float32Array[],\n) {\n  const {\n    layout: { id, options, iterations },\n    nodes,\n    edges,\n  } = payload;\n\n  // Sync graph on the worker side.\n  // TODO: Use transferable objects like ArrayBuffer for nodes & edges,\n  // in which case we don't need the whole graph.\n  // @see https://github.com/graphology/graphology/blob/master/src/layout-noverlap/webworker.tpl.js#L32\n  const graph = new Graph({\n    nodes,\n    edges,\n  });\n\n  /**\n   * Create layout instance on the worker side.\n   */\n\n  const layoutCtor = registry[id];\n  if (layoutCtor) {\n    currentLayout = new layoutCtor(options);\n  } else {\n    throw new Error(`Unknown layout id: ${id}`);\n  }\n\n  let positions = await currentLayout.execute(graph);\n  if (isLayoutWithIterations(currentLayout)) {\n    currentLayout.stop();\n    positions = currentLayout.tick(iterations);\n  }\n  return [positions, transferables];\n}\n","import { Edge as IEdge, Graph as IGraph, Node as INode } from '@antv/graphlib';\n\nexport interface NodeData {\n  x?: number;\n  y?: number;\n  z?: number;\n  size?: number | number[];\n  [key: string]: any;\n}\n\nexport interface EdgeData {\n  weight?: number;\n  [keys: string]: any;\n}\n\nexport interface OutNodeData extends NodeData {\n  x: number;\n  y: number;\n}\n\nexport interface OutEdgeData extends EdgeData {}\n\nexport type Node = INode<NodeData>;\nexport type Edge = IEdge<EdgeData>;\nexport type OutNode = INode<OutNodeData>;\nexport type OutEdge = IEdge<OutEdgeData>;\n\n// maps node's id and its index in the nodes array\nexport type IndexMap = {\n  [nodeId: string]: number;\n};\n\nexport type Graph = IGraph<NodeData, EdgeData>;\n\nexport type PointTuple = [number, number] | [number, number, number];\nexport type Point = { x: number; y: number; z?: number };\nexport type Matrix = number[];\nexport type LayoutMapping = { nodes: OutNode[]; edges: OutEdge[] };\n\nexport interface Layout<LayoutOptions> {\n  /**\n   * To directly assign the positions to the nodes.\n   */\n  assign(graph: Graph, options?: LayoutOptions): Promise<void>;\n  /**\n   * Return the positions of nodes and edges(if needed).\n   */\n  execute(graph: Graph, options?: LayoutOptions): Promise<LayoutMapping>;\n  /**\n   * Layout options, can be changed in runtime.\n   */\n  options: LayoutOptions;\n  /**\n   * Unique ID, it will get registered and used on the webworker-side.\n   */\n  id: string;\n}\n\nexport function isLayoutWithIterations(\n  layout: any,\n): layout is LayoutWithIterations<any> {\n  return !!layout.tick && !!layout.stop;\n}\n\nexport interface LayoutWithIterations<LayoutOptions>\n  extends Layout<LayoutOptions> {\n  /**\n   * Some layout algorithm has n iterations so that the simulation needs to be stopped at any time.\n   * This method is useful for running the simulation manually.\n   * @see https://github.com/d3/d3-force#simulation_stop\n   */\n  stop: () => void;\n\n  /**\n   * Manually steps the simulation by the specified number of iterations.\n   * @see https://github.com/d3/d3-force#simulation_tick\n   */\n  tick: (iterations?: number) => LayoutMapping;\n}\n\nexport interface LayoutSupervisor {\n  execute(): Promise<LayoutMapping>;\n  stop(): void;\n  kill(): void;\n  isRunning(): boolean;\n}\n\nexport interface CircularLayoutOptions {\n  center?: PointTuple;\n  width?: number;\n  height?: number;\n  radius?: number | null;\n  startRadius?: number | null;\n  endRadius?: number | null;\n  clockwise?: boolean;\n  divisions?: number;\n  ordering?: 'topology' | 'topology-directed' | 'degree' | null;\n  angleRatio?: number;\n  startAngle?: number;\n  endAngle?: number;\n  nodeSpacing?: ((node?: Node) => number) | number;\n  nodeSize?: number | number[] | ((nodeData: Node) => number);\n}\n\nexport interface GridLayoutOptions {\n  width?: number;\n  height?: number;\n  begin?: PointTuple;\n  preventOverlap?: boolean;\n  nodeSize?: number | number[] | ((nodeData: Node) => number);\n  preventOverlapPadding?: number;\n  condense?: boolean;\n  rows?: number;\n  cols?: number;\n  sortBy?: string;\n  position?: (node?: Node) => { row?: number; col?: number };\n  nodeSpacing?: ((node?: Node) => number) | number;\n}\n\nexport interface RandomLayoutOptions {\n  center?: PointTuple;\n  width?: number;\n  height?: number;\n}\n\nexport interface MDSLayoutOptions {\n  center?: PointTuple;\n  linkDistance?: number;\n}\n\nexport interface ConcentricLayoutOptions {\n  center?: PointTuple;\n  preventOverlap?: boolean;\n  nodeSize?: number | PointTuple | ((nodeData: Node) => number);\n  sweep?: number;\n  equidistant?: boolean;\n  startAngle?: number;\n  clockwise?: boolean;\n  maxLevelDiff?: number;\n  sortBy?: string;\n  width?: number;\n  height?: number;\n  nodeSpacing?: number | number[] | ((node?: Node) => number);\n}\n\nexport interface RadialLayoutOptions {\n  center?: PointTuple;\n  width?: number;\n  height?: number;\n  linkDistance?: number;\n  maxIteration?: number;\n  focusNode?: string | Node | null;\n  unitRadius?: number | null;\n  preventOverlap?: boolean;\n  nodeSize?: number | number[] | ((nodeData: Node) => number);\n  nodeSpacing?: number | Function;\n  maxPreventOverlapIteration?: number;\n  strictRadial?: boolean;\n  sortBy?: string;\n  sortStrength?: number;\n}\n\nexport interface D3ForceLayoutOptions {\n  center?: PointTuple;\n  linkDistance?: number | ((edge?: Edge) => number);\n  edgeStrength?: number | ((edge?: Edge) => number);\n  nodeStrength?: number | ((node?: Node) => number);\n  preventOverlap?: boolean;\n  collideStrength?: number;\n  nodeSize?: number | number[] | ((node?: Node) => number);\n  nodeSpacing?: number | number[] | ((node?: Node) => number);\n  alpha?: number;\n  alphaDecay?: number;\n  alphaMin?: number;\n  clustering?: boolean;\n  clusterNodeStrength?: number;\n  clusterEdgeStrength?: number;\n  clusterEdgeDistance?: number;\n  clusterNodeSize?: number;\n  clusterFociStrength?: number;\n  forceSimulation?: any;\n  onTick?: (data: LayoutMapping) => void;\n}\n\nexport interface CentripetalOptions {\n  /** Force strength for leaf nodes. */\n  leaf?: number | ((node: Node, nodes: Node[], edges: Edge[]) => number);\n  /** Force strength for single nodes. */\n  single?: number | ((node: Node) => number);\n  /** Force strength for other nodes. */\n  others?: number | ((node: Node) => number);\n  /** Centri force's position and sterngth, points to the canvas center by default */\n  center?: (\n    node: Node,\n    nodes: Node[],\n    edges: Edge[],\n    width: number,\n    height: number,\n  ) => {\n    x: number;\n    y: number;\n    z?: number;\n    centerStrength?: number;\n  };\n}\n\nexport interface ComboCombinedLayoutOptions {\n  center?: PointTuple;\n  nodeSize?: number | number[] | ((d?: Node) => number);\n  spacing?: number | ((d?: Node) => number);\n  outerLayout?: Layout<any>;\n  innerLayout?: Layout<any>;\n  comboPadding?: ((d?: unknown) => number) | number | number[] | undefined;\n  treeKey?: string;\n}\n\ninterface CommonForceLayoutOptions {\n  dimensions?: number;\n  center?: PointTuple;\n  minMovement?: number;\n  maxIteration?: number;\n  distanceThresholdMode?: 'mean' | 'max' | 'min';\n\n  /**\n   * If distance is specified, sets the maximum distance between nodes over which this force is considered.\n   * If distance is not specified, returns the current maximum distance, which defaults to infinity.\n   * Specifying a finite maximum distance improves performance and produces a more localized layout.\n   */\n  maxDistance?: number;\n}\n\nexport interface ForceLayoutOptions extends CommonForceLayoutOptions {\n  width?: number;\n  height?: number;\n  linkDistance?: number | ((edge?: Edge, source?: any, target?: any) => number);\n  nodeStrength?: number | ((d?: Node) => number);\n  edgeStrength?: number | ((d?: Edge) => number);\n  preventOverlap?: boolean;\n  nodeSize?: number | number[] | ((d?: Node) => number);\n  nodeSpacing?: number | ((d?: Node) => number);\n  damping?: number;\n  maxSpeed?: number;\n  coulombDisScale?: number;\n  gravity?: number;\n  factor?: number;\n  interval?: number;\n  centripetalOptions?: CentripetalOptions;\n  leafCluster?: boolean;\n  clustering?: boolean;\n  nodeClusterBy?: string;\n  clusterNodeStrength?: number | ((node: Node) => number);\n  collideStrength?: number;\n  onTick?: (data: LayoutMapping) => void;\n  getMass?: (node?: Node) => number;\n  getCenter?: (node?: Node, degree?: number) => number[];\n  monitor?: (params: {\n    energy: number;\n    nodes: Node[];\n    edges: Edge[];\n    iterations: number;\n  }) => void;\n}\n\nexport interface ForceAtlas2LayoutOptions extends CommonForceLayoutOptions {\n  width?: number;\n  height?: number;\n  kr?: number;\n  kg?: number;\n  ks?: number;\n  ksmax?: number;\n  tao?: number;\n  mode?: 'normal' | 'linlog';\n  preventOverlap?: boolean;\n  dissuadeHubs?: boolean;\n  barnesHut?: boolean;\n  prune?: boolean;\n  nodeSize?: number | number[] | ((node?: Node) => number);\n  onTick?: (data: LayoutMapping) => void;\n}\nexport interface FruchtermanLayoutOptions extends CommonForceLayoutOptions {\n  width?: number;\n  height?: number;\n  gravity?: number;\n  speed?: number;\n  clustering?: boolean;\n  clusterGravity?: number;\n  nodeClusterBy?: string;\n  onTick?: (data: LayoutMapping) => void;\n}\n"],"names":["module","exports","graphlib","layout","debug","util","time","notime","version","_","greedyFAS","run","g","fas","graph","acyclicer","e","edge","weight","weightFn","stack","visited","forEach","nodes","dfs","v","has","outEdges","w","push","dfsFAS","label","removeEdge","forwardName","name","reversed","setEdge","uniqueId","undo","edges","addBorderNode","prop","prefix","sg","sgNode","rank","width","height","borderType","prev","curr","addDummyNode","setParent","children","node","length","borderLeft","borderRight","minRank","maxRank","swapWidthHeight","swapWidthHeightOne","attrs","reverseYOne","y","swapXYOne","x","adjust","rankDir","rankdir","toLowerCase","points","reverseY","swapXY","List","sentinel","_next","_prev","this","_sentinel","unlink","entry","filterOutLinks","k","prototype","dequeue","enqueue","toString","strs","JSON","stringify","join","Graph","debugOrdering","layerMatrix","buildLayerMatrix","h","compound","multigraph","setGraph","setNode","layer","i","layerV","reduce","u","style","window","nodeCount","state","fasGraph","maxIn","maxOut","out","prevWeight","edgeWeight","Math","max","buckets","range","map","zeroIdx","assignBucket","buildState","DEFAULT_WEIGHT_FN","results","sources","sinks","removeNode","concat","doGreedyFAS","flatten","constant","collectPredecessors","undefined","inEdges","uEntry","wEntry","acyclic","normalize","normalizeRanks","parentDummyChains","removeEmptyRanks","nestingGraph","addBorderSegments","coordinateSystem","order","position","opts","debugTiming","layoutGraph","inputGraph","canonicalize","merge","graphDefaults","selectNumberAttrs","graphNumAttrs","pick","graphAttrs","defaults","nodeNumAttrs","nodeDefaults","parent","edgeDefaults","edgeNumAttrs","edgeAttrs","buildLayoutGraph","ranksep","minlen","labelpos","labeloffset","makeSpaceForEdgeLabels","selfEdges","removeSelfEdges","asNonCompoundGraph","injectEdgeLabelProxies","cleanup","borderTop","borderBottom","assignRankMinMax","dummy","labelRank","removeEdgeLabelProxies","layers","orderShift","selfEdge","insertSelfEdges","selfNode","dx","dy","positionSelfEdges","t","b","l","last","r","abs","removeBorderNodes","fixupEdgeLabelCoords","minX","Number","POSITIVE_INFINITY","maxX","minY","maxY","graphLabel","marginX","marginx","marginY","marginy","getExtremes","min","p","translateGraph","p1","p2","nodeV","nodeW","unshift","intersectRect","assignNodeIntersects","reverse","reversePointsForReversedEdges","runLayout","inputLabel","layoutLabel","updateInputGraph","edgesep","nodesep","obj","mapValues","newAttrs","lodash","cloneDeep","each","filter","find","forIn","isUndefined","minBy","now","sortBy","values","zipObject","root","nodeSep","depths","top","bottom","child","childNode","childTop","childBottom","thisWeight","nestingEdge","depth","treeDepths","nestingRoot","acc","sumWeights","nodeRankFactor","dummyChains","vRank","wRank","edgeLabel","edgeObj","normalizeEdge","origLabel","successors","cg","vs","rootPrev","prevChild","movable","inV","result","nodeU","sum","barycenter","relationship","hasNode","createRootNode","setDefaultNodeLabel","twoLayerCrossCount","northLayer","southLayer","southPos","southEntries","pos","firstIndex","treeSize","tree","Array","cc","index","weightSum","layering","initOrder","crossCount","sortSubgraph","buildLayerGraph","addSubgraphConstraints","buildLayerGraphs","ranks","sweepLayerGraphs","layerGraphs","biasRight","lg","sorted","assignOrder","downLayerGraphs","upLayerGraphs","best","bestCC","lastBest","simpleNodes","orderedVs","entries","mappedEntries","tmp","indegree","entryV","entryW","sourceSet","handleIn","vEntry","target","source","merged","handleOut","pop","doResolveConflicts","resolveConflicts","sort","bl","br","subgraphs","barycenters","subgraphResult","other","expandSubgraphs","predecessors","blPred","brPred","consumeUnsortable","unsortable","bias","parts","partition","sortable","lhs","rhs","vsIndex","postorderNums","lim","low","postorder","pathData","lca","vPath","wPath","path","findPath","pathIdx","pathV","ascending","findType1Conflicts","conflicts","prevLayer","k0","scanPos","prevLayerLength","lastNode","findOtherInnerSegmentNode","k1","slice","scanNode","uLabel","uPos","addConflict","findType2Conflicts","scan","south","southEnd","prevNorthBorder","nextNorthBorder","uNode","north","nextNorthPos","prevNorthPos","southLookahead","conflictsV","hasConflict","verticalAlignment","neighborFn","align","prevIdx","ws","mp","floor","il","ceil","horizontalCompaction","reverseSep","xs","blockG","blockGraph","sepFn","edgeSep","delta","vLabel","wLabel","sep","vRoot","uRoot","prevMax","buildBlockGraph","iterate","setXsFunc","nextNodesFunc","elem","bind","findSmallestWidthAlignment","xss","NEGATIVE_INFINITY","halfWidth","alignCoordinates","alignTo","alignToVals","alignToMin","alignToMax","vert","horiz","alignment","xsVals","balance","ul","ignore","positionX","adjustedLayering","inner","smallestWidth","rankSep","prevY","maxHeight","positionY","slack","tightTree","nodeEdges","edgeV","findMinSlackEdge","shiftRanks","directed","start","size","longestPath","feasibleTree","networkSimplex","ranker","networkSimplexRanker","tightTreeRanker","longestPathRanker","initRank","preorder","simplify","initLowLimValues","initCutValues","leaveEdge","exchangeEdges","enterEdge","cutvalue","calcCutValue","assignCutValue","childIsTail","graphEdge","cutValue","isOutEdge","pointsToHead","otherWeight","hasEdge","otherCutValue","arguments","dfsAssignLowLim","nextLim","neighbors","tailLabel","flip","candidates","isDescendant","f","flipped","updateRanks","rootLabel","type","simplified","simpleLabel","isMultigraph","successorWeights","weightMap","sucs","predecessorWeights","preds","rect","point","sx","sy","Error","offset","collection","fn","value","console","log","lib","json","alg","cmpt","cmpts","doDfs","navigation","isArray","isDirected","dijkstra","weightFunc","edgeFunc","transform","PriorityQueue","edgeFn","pq","updateNeighbors","distance","predecessor","decrease","add","removeMin","runDijkstra","String","DEFAULT_WEIGHT_FUNC","tarjan","d","rowK","rowI","j","ik","kj","ij","altDistance","runFloydWarshall","components","dijkstraAll","findCycles","floydWarshall","isAcyclic","prim","topsort","CycleException","parents","pri","priority","init","onStack","lowlink","visit","_arr","_keyIndices","keys","key","keyIndices","arr","_decrease","_swap","_heapify","largest","origArrI","origArrJ","DEFAULT_EDGE_NAME","GRAPH_NODE","EDGE_KEY_DELIM","_isDirected","_isMultigraph","_isCompound","_label","_defaultNodeLabelFn","_defaultEdgeLabelFn","_nodes","_parent","_children","_in","_preds","_out","_sucs","_edgeObjs","_edgeLabels","incrementOrInitEntry","decrementOrRemoveEntry","edgeArgsToId","v_","w_","edgeObjToId","_nodeCount","_edgeCount","isCompound","newDefault","isFunction","self","isEmpty","setNodes","args","_removeFromParentsChildList","ancestor","predsV","sucsV","union","isLeaf","filterNodes","copy","constructor","findParent","setDefaultEdgeLabel","edgeCount","setPath","valueSpecified","arg0","edgeArgsToObj","Object","freeze","outV","writeNodes","nodeValue","writeEdges","edgeValue","write","options","clone","read","isAnyArray","tag","call","endsWith","includes","DataView","getNative","hashClear","hashDelete","hashGet","hashHas","hashSet","Hash","clear","set","get","listCacheClear","listCacheDelete","listCacheGet","listCacheHas","listCacheSet","ListCache","Map","mapCacheClear","mapCacheDelete","mapCacheGet","mapCacheHas","mapCacheSet","MapCache","Promise","Set","setCacheAdd","setCacheHas","SetCache","__data__","stackClear","stackDelete","stackGet","stackHas","stackSet","Stack","data","Symbol","Uint8Array","WeakMap","func","thisArg","apply","array","iteratee","predicate","resIndex","baseIndexOf","comparator","baseTimes","isArguments","isBuffer","isIndex","isTypedArray","hasOwnProperty","inherited","isArr","isArg","isBuff","isType","skipIndexes","accumulator","initAccum","asciiSize","baseProperty","baseAssignValue","eq","object","objValue","copyObject","keysIn","defineProperty","arrayEach","assignValue","baseAssign","baseAssignIn","cloneBuffer","copyArray","copySymbols","copySymbolsIn","getAllKeys","getAllKeysIn","getTag","initCloneArray","initCloneByTag","initCloneObject","isMap","isObject","isSet","argsTag","funcTag","objectTag","cloneableTags","baseClone","bitmask","customizer","isDeep","isFlat","isFull","isFunc","stacked","subValue","props","objectCreate","create","baseCreate","proto","baseForOwn","baseEach","createBaseEach","isSymbol","current","computed","fromIndex","fromRight","arrayPush","isFlattenable","baseFlatten","isStrict","baseFor","createBaseFor","castPath","toKey","keysFunc","symbolsFunc","getRawTag","objectToString","symToStringTag","toStringTag","baseFindIndex","baseIsNaN","strictIndexOf","baseGetTag","isObjectLike","baseIsEqualDeep","baseIsEqual","equalArrays","equalByTag","equalObjects","arrayTag","equalFunc","objIsArr","othIsArr","objTag","othTag","objIsObj","othIsObj","isSameTag","objIsWrapped","othIsWrapped","objUnwrapped","othUnwrapped","matchData","noCustomizer","srcValue","COMPARE_PARTIAL_FLAG","isMasked","toSource","reIsHostCtor","funcProto","Function","objectProto","funcToString","reIsNative","RegExp","replace","test","isLength","typedArrayTags","baseMatches","baseMatchesProperty","identity","property","isPrototype","nativeKeys","nativeKeysIn","isProto","isArrayLike","baseIsMatch","getMatchData","matchesStrictComparable","hasIn","isKey","isStrictComparable","assignMergeValue","baseMergeDeep","safeGet","baseMerge","srcIndex","newValue","cloneTypedArray","isArrayLikeObject","isPlainObject","toPlainObject","mergeFunc","isCommon","isTyped","arrayMap","baseGet","baseIteratee","baseMap","baseSortBy","baseUnary","compareMultiple","iteratees","orders","basePickBy","paths","baseSet","nativeCeil","nativeMax","end","step","eachFunc","overRest","setToString","lastIndex","nested","baseSetToString","string","comparer","n","symbolProto","symbolToString","baseToString","trimmedEndIndex","reTrimStart","arrayIncludes","arrayIncludesWith","cacheHas","createSet","setToArray","seen","outer","seenIndex","assignFunc","valsLength","cache","stringToPath","arrayBuffer","byteLength","freeExports","nodeType","freeModule","Buffer","allocUnsafe","buffer","cloneArrayBuffer","dataView","byteOffset","reFlags","regexp","exec","symbolValueOf","valueOf","symbol","typedArray","valIsDefined","valIsNull","valIsReflexive","valIsSymbol","othIsDefined","othIsNull","othIsReflexive","othIsSymbol","compareAscending","objCriteria","criteria","othCriteria","ordersLength","isNew","getSymbols","getSymbolsIn","coreJsData","baseRest","isIterateeCall","assigner","guard","iterable","findIndexFunc","baseRange","toFinite","noop","arraySome","isPartial","arrLength","othLength","arrStacked","othStacked","arrValue","othValue","compared","othIndex","mapToArray","message","convert","objProps","objLength","objStacked","skipCtor","objCtor","othCtor","freeGlobal","baseGetAllKeys","isKeyable","baseIsNative","getValue","getPrototype","overArg","getPrototypeOf","nativeObjectToString","isOwn","unmasked","arrayFilter","stubArray","propertyIsEnumerable","nativeGetSymbols","getOwnPropertySymbols","mapTag","promiseTag","setTag","weakMapTag","dataViewTag","dataViewCtorString","mapCtorString","promiseCtorString","setCtorString","weakMapCtorString","ArrayBuffer","resolve","Ctor","ctorString","hasFunc","reHasUnicode","nativeCreate","input","cloneDataView","cloneRegExp","cloneSymbol","spreadableSymbol","isConcatSpreadable","reIsUint","reIsDeepProp","reIsPlainProp","uid","maskSrcKey","IE_PROTO","assocIndexOf","splice","getMapData","memoize","freeProcess","process","nodeUtil","require","types","binding","arg","otherArgs","freeSelf","shortOut","nativeNow","Date","count","lastCalled","stamp","remaining","pairs","LARGE_ARRAY_SIZE","hasUnicode","unicodeSize","memoizeCapped","rePropName","reEscapeChar","charCodeAt","match","number","quote","subString","reWhitespace","charAt","rsAstralRange","rsAstral","rsCombo","rsFitz","rsNonAstral","rsRegional","rsSurrPair","reOptMod","rsModifier","rsOptVar","rsSeq","rsSymbol","reUnicode","CLONE_DEEP_FLAG","propsIndex","propsLength","baseFilter","createFind","toInteger","castFunction","defaultValue","baseHas","hasPath","baseHasIn","baseIsArguments","stubFalse","baseKeys","baseIsMap","nodeIsMap","objectCtorString","baseIsSet","nodeIsSet","baseIsTypedArray","nodeIsTypedArray","arrayLikeKeys","baseKeysIn","baseExtremum","baseGt","resolver","TypeError","memoized","Cache","createAssigner","baseLt","basePick","flatRest","basePropertyDeep","createRange","arrayReduce","baseReduce","isString","stringSize","baseOrderBy","toNumber","INFINITY","remainder","baseTrim","reIsBadHex","reIsBinary","reIsOctal","freeParseInt","parseInt","isBinary","isArrLike","baseUniq","arrays","idCounter","id","baseValues","baseZipObject","rescale","output","currentMin","_options$fromIndex","_options$toIndex","toIndex","isInteger","minValue","currentMax","maxValue","RangeError","_options$min","autoMinMax","_options$max","factor","indent","repeat","indentData","inspectMatrixWithOptions","matrix","maxRows","maxColumns","maxNumSize","padMinus","rows","columns","maxI","maxJ","loop","line","formatNumber","inspectData","num","formatNumber2","padEnd","len","str","fix","toFixed","startsWith","exp","toExponential","checkRowIndex","checkColumnIndex","checkRowVector","vector","to1DArray","checkColumnVector","checkRowIndices","rowIndices","checkColumnIndices","columnIndices","checkRange","startRow","endRow","startColumn","endColumn","checkNumber","newArray","checkNonEmpty","AbstractMatrix","from1DArray","newRows","newColumns","newData","newMatrix","Matrix","row","column","rowVector","columnVector","zeros","ones","fill","rand","random","randInt","interval","round","eye","diag","matrix1","matrix2","checkMatrix","isMatrix","klass","callback","to2DArray","toJSON","isRowVector","isColumnVector","isVector","isSquare","isSymmetric","isDistance","isEchelonForm","previousColumn","checked","isReducedEchelonForm","echelonForm","iMax","swapRows","reducedEchelonForm","m","maxRow","pivot","setSubMatrix","neg","mulS","getRow","getRowVector","setRow","row1","row2","temp","getColumn","getColumnVector","setColumn","swapColumns","column1","column2","addRowVector","subRowVector","mulRowVector","divRowVector","addColumnVector","subColumnVector","mulColumnVector","divColumnVector","mulRow","mulColumn","by","NaN","maxIndex","idx","minIndex","maxRowIndex","minRow","minRowIndex","maxColumn","maxColumnIndex","minColumn","minColumnIndex","norm","sqrt","dot","cumulativeSum","vector2","vector1","mmul","Bcolj","Float64Array","s","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","cols","c","resultat","warn","blockMult","a","halfRows","halfCols","subMatrix","sub","scaleRows","isFinite","scaleColumns","flipRows","middle","first","flipColumns","kroneckerProduct","q","kroneckerSum","AxI","IxB","transpose","sortRows","compareFunction","compareNumbers","sortColumns","subMatrixRow","indices","subMatrixColumn","selection","rowIndex","columnIndex","trace","from","to","sumByRow","sumByColumn","sumAll","product","productByRow","productByColumn","productAll","mean","variance","unbiased","sum1","sum2","varianceByRow","varianceByColumn","varianceAll","standardDeviation","center","centerByRow","centerByColumn","centerAll","scale","pow","getScaleByRow","scaleByRow","getScaleByColumn","scaleByColumn","divider","getScaleAll","scaleAll","iterator","col","for","randomInt","diagonal","negate","tensorProduct","nRows","nColumns","super","arrayData","every","element","removeRow","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","cos","cosh","expm1","fround","log1p","log10","log2","sign","sin","sinh","tan","tanh","trunc","powS","powM","installMathOperations","SymmetricMatrix","diagonalSize","isSymmetricMatrix","klassType","upperRightEntries","toMatrix","removeCross","addCross","applyMask","mask","sidesToRemove","passthroughs","sideIndex","toCompact","compact","fromCompact","compactSize","upperRightValues","DistanceMatrix","isDistanceMatrix","klassSubType","sideSize","toSymmetricMatrix","BaseView","MatrixSelectionView","WrapperMatrix1D","_calculateIndex","WrapperMatrix2D","LuDecomposition","LUcolj","kmax","lu","pivotVector","pivotSign","LU","isSingular","solve","X","determinant","lowerTriangularMatrix","upperTriangularMatrix","pivotPermutationVector","hypotenuse","QrDecomposition","qr","rdiag","nrm","QR","Rdiag","isFullRank","orthogonalMatrix","SingularValueDecomposition","computeLeftSingularVectors","computeRightSingularVectors","autoTranspose","wantu","Boolean","wantv","swapped","aux","nu","ni","U","V","work","si","nct","nrt","mrc","pp","eps","EPSILON","kase","alpha","MIN_VALUE","isNaN","ks","cs","sn","sp","spm1","epm1","sk","ek","shift","Y","threshold","scols","Ls","rightSingularVectors","VL","vrows","urows","VLU","solveForDiagonal","inverse","vcols","ucols","condition","norm2","tol","ii","leftSingularVectors","diagonalMatrix","leftHandSide","rightHandSide","useSVD","xrange","exception","dependenciesOneRow","error","thresholdValue","thresholdError","returnArray","EigenvalueDecomposition","assumeSymmetric","hh","tred2","dl1","c3","el1","s2","tst1","tql2","H","ort","high","orthes","nn","ra","sa","vr","vi","notlast","cdivres","exshift","z","iter","cdiv","hqr2","realEigenvalues","imaginaryEigenvalues","eigenvectorMatrix","xr","xi","yr","yi","CholeskyDecomposition","dimension","positiveDefinite","L","isPositiveDefinite","B","nipals","scaleScores","maxIterations","terminationCriteria","tOld","diff","counter","xResidual","residual","yResidual","betas","xMatrix","yMatrix","yIsSame","sdx","sdy","corr","cov","subMatrix0","subMatrix1","subMatrix2","Abis","svdSolution","__webpack_module_cache__","__webpack_require__","moduleId","cachedModule","loaded","__webpack_modules__","getter","__esModule","definition","o","enumerable","globalThis","nmd","__rest","indexOf","__awaiter","_arguments","P","generator","reject","fulfilled","next","rejected","done","then","SuppressedError","EventEmitter","_events","on","evt","once","emit","_this","_i","events","wildcardEvents","doEmit","es","_a","off","length_1","getEvents","doBFS","queue","navigator","doDFS","defaultFilter","GraphView","nodeFilter","edgeFilter","cacheEnabled","inEdgesMap","outEdgesMap","bothEdgesMap","allNodesMap","allEdgesMap","getEdgeDetail","startAutoCache","clearCache","refreshCache","updateCache","getAllNodes","involvedNodeIds","involvedEdgeIds","oldEdgesSet","getRelatedEdges","bothEdges","getNode","delete","getEdge","handleGraphChanged","stopAutoCache","event","changes","change","propertyName","oldValue","checkNodeExistence","areNeighbors","firstNodeId","secondNodeId","getNeighbors","some","neighbor","direction","getDegree","getSuccessors","targets","getPredecessors","hasTreeStructure","treeKey","getRoots","getChildren","getParent","getAllEdges","bfs","in","both","nodeMap","edgeMap","treeIndices","batchCount","onChanged","addNodes","addEdges","addTree","batch","commit","reduceChanges","mergedChanges","isNewlyAdded","pastChange","sameId","nodeId","findIndex","existingChange","newParentId","doAddNode","childrenMap","addNode","doRemoveNode","doRemoveEdge","parentMap","removeNodes","idList","updateNodeDataProperty","mergeNodeData","patch","updateNodeData","update","checkEdgeExistence","doAddEdge","bothEdgesOfSource","bothEdgesOfTarget","addEdge","removeEdges","updateEdgeSource","oldSource","newSource","updateEdgeTarget","oldTarget","newTarget","updateEdgeDataProperty","updateEdgeData","mergeEdgeData","checkTreeExistence","attachTreeStructure","detachTreeStructure","getAncestors","ancestors","oldParent","newParent","oldParentId","dfsTree","bfsTree","newNodes","oldNode","newEdges","oldEdge","newGraph","oldParentMap","oldChildrenMap","createView","shortcut","rangeMax","flat","layeringNodes","rankMax","va","vb","safeSort","valueA","valueB","DUMMY_NODE_EDGE_LABEL","rst","unflat","unsort","nodeRanks","fixOrderNodes","fixorder","mergeEntries","filtered","picked","iindex","usePrev","keepNodeOrder","mergeBarycenters","hasFixOrder","compareWithBias","vss","lnode","vv","ww","ng","heights","graphAlign","assign","scanIfNeeded","params","scanCache","cacheKey","getScannedKey","scanned","xsKey","tightTreeWithLayer","Infinity","tn","isTreeEdge","useNextLim","existed","og","nodeOrder","maxDepth","forwardVisited","dfsForward","nextRank","currRank","longestPathWithLayer","nodeData","originalEdge","dfsBothOrder","startV","initDataOrder","mxRank","range1","range2","rd","currentV","pickedProperties","formatNumberFn","resultFunc","formatSizeFn","resultIsNumber","formatNodeSize","nodeSize","nodeSpacing","nodeSizeFunc","nodeSpacingFunc","bboxSize","dataSize","getTime","cp","cloneFormatData","initRange","cloned","DEFAULTS_LAYOUT_OPTIONS","edgeLabelSpace","controlPoints","radial","focusNode","handleSingleNodeGraph","radius","startRadius","endRadius","startAngle","endAngle","PI","clockwise","divisions","ordering","angleRatio","topologyOrdering","orderedCNodes","pickFlags","foundChild","preventOverlap","sweep","equidistant","maxLevelDiff","ConcentricLayout","execute","genericConcentricLayout","mergedOptions","propsCenter","propsWidth","propsHeight","propsSortBy","propsMaxLevelDiff","propsSweep","innerWidth","innerHeight","layoutNodes","maxNodeSize","maxNodeSpacing","currentSize","cnode","nodeIdxMap","n1","n2","maxValueNode","levels","currentLevel","minDist","firstLvlHasMulti","rStep","level","dTheta","dcos","dsin","rMin","rDeltaMax","rr","rDelta","theta","xm","ym","xp","yp","right","_root","leaf","x0","_x0","y0","_y0","x1","_x1","y1","_y1","_x","_y","defaultX","defaultY","quadtree","Quadtree","addAll","leaf_copy","treeProto","zm","zp","deep","z0","_z0","z1","_z1","_z","defaultZ","octree","Octree","cover","xz","yz","extent","x2","y2","x3","y3","quads","d2","remove","retainer","previous","removeAll","visitAfter","accumulate","treeNode","accWeight","accX","accY","accZ","accSize","numChildren","zz","z2","z3","octs","dz","arg1","arg2","arg3","dimensions","len2","len3","param","vx","vy","vz","maxIteration","gravity","edgeStrength","nodeStrength","coulombDisScale","damping","maxSpeed","minMovement","linkDistance","clusterNodeStrength","distanceThresholdMode","ForceLayout","timeInterval","judgingDistance","running","genericForceLayout","stop","clearInterval","tick","iterations","lastResult","lastOptions","runOneStep","lastCalcGraph","lastGraph","lastVelMap","updatePosition","lastLayoutNodes","lastLayoutEdges","lastAssign","formattedOptions","formatOptions","getMass","mass","layoutEdges","velMap","calcGraph","formatCentripetal","onTick","setInterval","formatOutNodes","massWeight","degree","nodeSizeFn","nodeSizeArr","linkDistanceFn","centripetalOptions","leafCluster","clustering","nodeClusterBy","calcNodes","basicCentripetal","single","others","sameTypeLeafMap","clusters","getSameTypeLeafMap","siblingLeaves","sameTypeLeaves","centerPos","getAvgNodePosition","item","centerInfo","cluster","sameTypeNodes","accMap","calcEdges","monitor","calRepulsive","calAttractive","calGravity","updateVelocity","energy","calTotalEnergy","speed2","coulombDisScale2","weightParam","calcNode","computeForce","forceNBody","sourceNode","targetNode","vecX","vecY","vecZ","vecLength","direX","direY","direZ","sourceMassRatio","targetMassRatio","disX","disY","disZ","getCenter","defaultGravity","inDegree","outDegree","forceCenter","centerX","centerY","strength","centriCenter","centriX","centriY","centriZ","centerStrength","singleStrength","leafStrength","othersStrength","vLength","param2","fx","fy","fz","distX","distY","distZ","distanceMagnitude","getCoreNodeAndSiblingLeaves","coreNode","getSameTypeNodes","relativeNodes","typeName","totalNodes","adjMatrix","dist","getAdjMatrix","sIndex","tIndex","getEuclideanDistance","graphTreeDfs","mode","stopFns","stopBranchFn","stopAllFn","MDSLayout","genericMDSLayout","distances","handleInfinity","scaledD","ratio","scaleMatrix","positions","runMDS","maxDistance","M","rowMeans","colMeans","totalMean","ret","eigenValues","FORCE_LAYOUT_TYPE_MAP","gForce","force2","d3force","fruchterman","forceAtlas2","force","comboPadding","dispatch","Dispatch","typename","T","trim","split","that","taskHead","taskTail","timeout","pokeDelay","clockLast","clockNow","clockSkew","clock","performance","setFrame","requestAnimationFrame","setTimeout","clearNow","Timer","_call","_time","timer","delay","restart","wake","timerFlush","t0","t2","t1","sleep","nap","poke","clearTimeout","initialRadius","initialAngle","simulation","alphaMin","alphaDecay","alphaTarget","velocityDecay","forces","stepper","lcg","initializeNodes","angle","initializeForce","initialize","randomSource","closest","strengths","distanceMin2","distanceMax2","theta2","quad","jiggle","_random","distanceMin","distanceMax","nodeById","links","link","initializeStrength","initializeDistance","radii","ri","ri2","prepare","rj","forceInBox","templateForce","groupBy","forceNodeSize","forceCharge","forceLinkDistance","forceLinkStrength","nodesMap","foci","none","templateNodes","template","enableGrouping","getFocisFromTemplate","net","gnodes","glinks","dNodes","clustersList","clustersCounts","clustersLinks","sumforceNodeSize","tmpCount","computeClustersNodeCounts","dClusterLinks","clusterLinks","sourceID","targetID","getLinkKey","computeClustersLinkCounts","val","sourceTerminal","targetTerminal","getGroupsGraph","initializeWithForce","genNodesMap","getFocis","forceSimulation","collideStrength","clusterEdgeStrength","clusterEdgeDistance","clusterFociStrength","clusterNodeSize","formatOutEdges","rest","DagreLayout","defaultOptions","genericDagreLayout","parseSize","mapping","Body","rx","ry","distanceTo","bo","hypot","setPos","resetForce","addForce","F","contains","nenwMass","dg","Quad","xmid","ymid","massCenter","getLength","halfLen","NW","NE","SW","SE","QuadTree","body","insert","_isExternal","_putBody","updateForce","kr","kg","dissuadeHubs","ksmax","tao","speed","clusterGravity","begin","preventOverlapPadding","condense","small","rcs","res","large","usedRows","usedCols","used","cellUsed","rc","use","moveToNextCell","getPos","cellWidth","cellHeight","id2manPos","rcPos","getRepulsion","disp","vecx","vecy","common","updatePositions","strictRadial","focusIdx","maxDisplace","maxDisp","di","vpx","vpy","diLength","tdispLength","distLength","limitedDist","nfDis","unitRadius","maxPreventOverlapIteration","sortStrength","registry","circular","genericCircularLayout","paramNodeSpacing","paramNodeSize","calculatedWidth","calculatedHeight","calculatedCenter","calculateCenter","angleStep","nSize","perimeter","astep","orderedNodes","nodeA","nodeB","degreeOrdering","divN","concentric","mds","genericRandomLayout","grid","genericGridLayout","propsRows","propsCols","localeCompare","cells","splits","sm","oNode","nodeH","genericRadialLayout","propsFocusNode","propsUnitRadius","focusIndex","getIndexById","maxToFocus","minus","focusNodeD","semiWidth","semiHeight","maxRadius","maxD","idealDistances","sortValueCache","iValue","jValue","eIdealDisMatrix","weights","getWeightMatrix","mdsResult","nonoverlapForceParams","radialNonoverlapForce","oneIteration","vparam","originDis","reciODis","xMolecule","yMolecule","denominator","edis","reciEdis","idealDis","reciR","clusterForce","edgeForce","overlapProcess","outNodes","nodeForce","genericFruchtermanLayout","lastClusterMap","clusterMap","clusterValue","cx","cy","propsClusterGravity","area","k2","displacements","applyCalculate","gravityForce","vid","lengthSqr","dispX","dispY","dispZ","genericForceAtlas2Layout","prune","sizes","getSizes","sourceDegree","targetDegree","postOptions","barnesHut","nodeNum","iteration","preForces","bodies","oneStep","preventOverlapIters","krPrime","getAttrForces","getOptRepGraForces","getRepGraForces","updatePos","dir","eucliDis","fa1","fa2","minx","maxx","miny","maxy","quadTree","fg","nodei","degreei","nodej","degreej","fr","swgns","trans","swgG","traG","usingSg","minusNorm","addNorm","preSG","absForce","dnx","dny","dagre","antvDagre","ranksepFunc","nodesepFunc","sortByCombo","preset","ranksepfunc","nodesepfunc","horisep","vertisep","prevGraph","verti","parentId","currG","prevG","prevNode","_order","defaultNode","defaultAttrs","_rank","layoutTopLeft","isHorizontal","layerCoords","layerCoordSort","layerCoordsArr","isDifferentLayer","point1","point2","filterControlPointsOutOfBoundary","ps","sourceX","sourceY","targetX","targetY","sourceLayer","sourceNextLayerCoord","firstControlPoint","insertStartControlPoint","targetLayer","layerDiff","targetLastLayerCoord","lastControlPoints","insertEndControlPoint","getControlPoints","comboCombined","genericComboCombinedLayout","initVals","outerLayout","propsOuterLayout","_isCombo","combos","comboMap","combo","comboNodes","innerGraphLayoutPromises","getInnerGraphs","all","outerNodeIds","outerLayoutNodes","nodeAncestorIdMap","allHaveNoPosition","cacheCombo","comboLayoutNode","outerLayoutEdges","outerPositions","sourceAncestorId","targetAncestorId","outerLayoutGraph","outerLayoutPreset","animate","comboNode","outerPosition","layoutNode","spacing","spacingFunc","comboPaddingFunc","innerLayout","innerGraphLayout","innerLayoutOptions","innerLayoutPromises","getSize","padding","nsize","innerLayoutNodeIds","innerLayoutNodes","oriNode","innerGraphData","minNodeSize","size0","size1","innerGraphCore","halfSize","left","getLayoutBBox","currentLayout","stopLayout","calculateLayout","payload","transferables","layoutCtor"],"sourceRoot":""}